healpy-1.8.1/0000755000175000017500000000000012351601662013253 5ustar zoncazonca00000000000000healpy-1.8.1/INSTALL.rst0000644000175000017500000001065112351422052015110 0ustar zoncazonca00000000000000Installation procedure for Healpy ================================= Requirements ------------ Healpy depends on the HEALPix C++ and cfitsio C libraries. Source code for both is include with Healpy and is built automatically, so you do not need to install them yourself. Quick installation with Pip --------------------------- The quickest way to install Healpy is with `pip `_ (>= 1.4.2), which automatically fetches the latest version of Healpy and any missing dependencies:: pip install --user healpy If you have installed with ``pip``, you can keep your installation up to date by upgrading from time to time:: pip install --user --upgrade healpy Even quicker installation on Mac OS with MacPorts ------------------------------------------------- If you are using a Mac and have the `MacPorts `_ package manager, it's even easer to install Healpy with:: sudo port install py27-healpy Binary `apt-get` style packages are also available in the development versions of `Debian (sid) `_ and `Ubuntu (utopic) `_. Almost-as-quick installation from official source release --------------------------------------------------------- Healpy is also available in the `Python Package Index (PyPI) `_. You can download it with:: curl -O https://pypi.python.org/packages/source/h/healpy/healpy-1.7.4.tar.gz and build it with:: tar -xzf healpy-1.7.4.tar.gz pushd healpy-1.7.4 python setup.py install --user popd If everything goes fine, you can test it:: python >>> import matplotlib.pyplot as plt >>> import numpy as np >>> import healpy as hp >>> hp.mollview(np.arange(12)) >>> plt.show() or run the test suite with nose:: cd healpy-1.7.4 && python setup.py test Building against external Healpix and cfitsio --------------------------------------------- Healpy uses pkg-config to detect the presence of the Healpix and cfitsio libraries. pkg-config is available on most systems. If you do not have pkg-config installed, then Healpy will download and use (but not install) a Python clone called pykg-config. If you want to provide your own external builds of Healpix and cfitsio, then download the following packages: * `pkg-config `_ * `HEALPix `_ autotools-style C++ package * `cfitsio `_ If you are going to install the packages in a nonstandard location (say, ``--prefix=/path/to/local``), then you should set the environment variable ``PKG_CONFIG_PATH=/path/to/local/lib/pkgconfig`` when building. No other environment variable settings are necessary, and you do not need to set ``PKG_CONFIG_PATH`` to use Healpy after you have built it. Then, unpack each of the above packages and build them with the usual ``configure; make; make install`` recipe. Known issues ------------ * Incompatibility with ``cfitisio`` from ``HEASOFT``: due to a conflict of header file names it is currently not possible to use the cfitsio library provided with the HEASOFT package for compilation of Healpix C++. HEASOFT's include directory contains a file called "rotmatrix.h" which clashes with Healpix's own rotmatrix.h. * Compilation problems in the C++ package: some gcc versions (we have reports for 4.4.5 and 4.4.6) crash with an internal compiler error during compilation of libsharp. Unfortunately we have not found a workaround for this compiler problem. To our knowledge, it has been fixed in gcc 4.4.7 and in the 4.5.x and newer versions. Development install ------------------- Developers building from a snapshot of the github repository need: * ``autoconf`` and ``libtool`` (in Debian or Ubuntu: ``sudo apt-get install autoconf automake libtool pkg-config``) * `cython` > 0.16 * run ``git submodule init`` and ``git submodule update`` to get the bundled HEALPix sources the best way to install healpy if you plan to develop is to build the C++ extensions in place with:: python setup.py build_ext --inplace then add the ``healpy/healpy`` folder to your ``PYTHONPATH``. Clean ----- When you run "python setup.py", temporary build products are placed in the "build" directory. If you want to clean out and remove the ``build`` directory, then run:: python setup.py clean --all healpy-1.8.1/healpy.egg-info/0000755000175000017500000000000012351601662016227 5ustar zoncazonca00000000000000healpy-1.8.1/healpy.egg-info/requires.txt0000644000175000017500000000001212351601661020617 0ustar zoncazonca00000000000000pyfits sixhealpy-1.8.1/healpy.egg-info/top_level.txt0000644000175000017500000000000712351601661020755 0ustar zoncazonca00000000000000healpy healpy-1.8.1/healpy.egg-info/dependency_links.txt0000644000175000017500000000000112351601661022274 0ustar zoncazonca00000000000000 healpy-1.8.1/healpy.egg-info/PKG-INFO0000644000175000017500000000165312351601661017330 0ustar zoncazonca00000000000000Metadata-Version: 1.1 Name: healpy Version: 1.8.1 Summary: Healpix tools package for Python Home-page: http://github.com/healpy Author: C. Rosset, A. Zonca Author-email: cyrille.rosset@apc.univ-paris-diderot.fr License: GPLv2 Description: UNKNOWN Platform: UNKNOWN Classifier: Development Status :: 5 - Production/Stable Classifier: Environment :: Console Classifier: Intended Audience :: Science/Research Classifier: License :: OSI Approved :: GNU General Public License v2 or later (GPLv2+) Classifier: Operating System :: POSIX Classifier: Programming Language :: C++ Classifier: Programming Language :: Python :: 2.6 Classifier: Programming Language :: Python :: 2.7 Classifier: Programming Language :: Python :: 3.2 Classifier: Programming Language :: Python :: 3.3 Classifier: Programming Language :: Python :: 3.4 Classifier: Topic :: Scientific/Engineering :: Astronomy Classifier: Topic :: Scientific/Engineering :: Visualization healpy-1.8.1/healpy.egg-info/SOURCES.txt0000644000175000017500000003616612351601662020127 0ustar zoncazonca00000000000000CHANGELOG.rst CITATION COPYING INSTALL.rst MANIFEST.in README.rst ez_setup.py pykg_config.py setup.py cfitsio/CMakeLists.txt cfitsio/FindPthreads.cmake cfitsio/License.txt cfitsio/Makefile.in cfitsio/README cfitsio/README.MacOS cfitsio/README.win cfitsio/README_OLD.win cfitsio/buffers.c cfitsio/cfileio.c cfitsio/cfitsio.pc.in cfitsio/cfitsio_mac.sit.hqx cfitsio/cfortran.h cfitsio/checksum.c cfitsio/config.guess cfitsio/config.sub cfitsio/configure cfitsio/configure.in cfitsio/cookbook.c cfitsio/cookbook.f cfitsio/drvrfile.c cfitsio/drvrgsiftp.c cfitsio/drvrgsiftp.h cfitsio/drvrmem.c cfitsio/drvrnet.c cfitsio/drvrsmem.c cfitsio/drvrsmem.h cfitsio/editcol.c cfitsio/edithdu.c cfitsio/eval.l cfitsio/eval.y cfitsio/eval_defs.h cfitsio/eval_f.c cfitsio/eval_l.c cfitsio/eval_tab.h cfitsio/eval_y.c cfitsio/f77.inc cfitsio/f77_wrap.h cfitsio/f77_wrap1.c cfitsio/f77_wrap2.c cfitsio/f77_wrap3.c cfitsio/f77_wrap4.c cfitsio/fits_hcompress.c cfitsio/fits_hdecompress.c cfitsio/fitscopy.c cfitsio/fitscore.c cfitsio/fitsio.h cfitsio/fitsio2.h cfitsio/fpack.c cfitsio/fpack.h cfitsio/fpackutil.c cfitsio/funpack.c cfitsio/getcol.c cfitsio/getcolb.c cfitsio/getcold.c cfitsio/getcole.c cfitsio/getcoli.c cfitsio/getcolj.c cfitsio/getcolk.c cfitsio/getcoll.c cfitsio/getcols.c cfitsio/getcolsb.c cfitsio/getcolui.c cfitsio/getcoluj.c cfitsio/getcoluk.c cfitsio/getkey.c cfitsio/group.c cfitsio/group.h cfitsio/grparser.c cfitsio/grparser.h cfitsio/histo.c cfitsio/imcompress.c cfitsio/imcopy.c cfitsio/install-sh cfitsio/iraffits.c cfitsio/iter_a.c cfitsio/iter_a.f cfitsio/iter_a.fit cfitsio/iter_b.c cfitsio/iter_b.f cfitsio/iter_b.fit cfitsio/iter_c.c cfitsio/iter_c.f cfitsio/iter_c.fit cfitsio/iter_image.c cfitsio/iter_var.c cfitsio/longnam.h cfitsio/makefile.bc cfitsio/makefile.vcc cfitsio/makepc.bat cfitsio/modkey.c cfitsio/pliocomp.c cfitsio/putcol.c cfitsio/putcolb.c cfitsio/putcold.c cfitsio/putcole.c cfitsio/putcoli.c cfitsio/putcolj.c cfitsio/putcolk.c cfitsio/putcoll.c cfitsio/putcols.c cfitsio/putcolsb.c cfitsio/putcolu.c cfitsio/putcolui.c cfitsio/putcoluj.c cfitsio/putcoluk.c cfitsio/putkey.c cfitsio/quantize.c cfitsio/region.c cfitsio/region.h cfitsio/ricecomp.c cfitsio/sample.tpl cfitsio/scalnull.c cfitsio/smem.c cfitsio/speed.c cfitsio/swapproc.c cfitsio/testf77.f cfitsio/testf77.out cfitsio/testf77.std cfitsio/testprog.c cfitsio/testprog.out cfitsio/testprog.std cfitsio/testprog.tpt cfitsio/vmsieee.c cfitsio/wcssub.c cfitsio/wcsutil.c cfitsio/winDumpExts.mak cfitsio/windumpexts.c cfitsio/zlib/adler32.c cfitsio/zlib/crc32.c cfitsio/zlib/crc32.h cfitsio/zlib/deflate.c cfitsio/zlib/deflate.h cfitsio/zlib/infback.c cfitsio/zlib/inffast.c cfitsio/zlib/inffast.h cfitsio/zlib/inffixed.h cfitsio/zlib/inflate.c cfitsio/zlib/inflate.h cfitsio/zlib/inftrees.c cfitsio/zlib/inftrees.h cfitsio/zlib/trees.c cfitsio/zlib/trees.h cfitsio/zlib/uncompr.c cfitsio/zlib/zcompress.c cfitsio/zlib/zconf.h cfitsio/zlib/zlib.h cfitsio/zlib/zuncompress.c cfitsio/zlib/zutil.c cfitsio/zlib/zutil.h healpixsubmodule/src/cxx/autotools/Makefile.am healpixsubmodule/src/cxx/autotools/Makefile.in healpixsubmodule/src/cxx/autotools/aclocal.m4 healpixsubmodule/src/cxx/autotools/ar-lib healpixsubmodule/src/cxx/autotools/compile healpixsubmodule/src/cxx/autotools/config.guess healpixsubmodule/src/cxx/autotools/config.sub healpixsubmodule/src/cxx/autotools/configure healpixsubmodule/src/cxx/autotools/configure.ac healpixsubmodule/src/cxx/autotools/depcomp healpixsubmodule/src/cxx/autotools/install-sh healpixsubmodule/src/cxx/autotools/ltmain.sh healpixsubmodule/src/cxx/autotools/make_release healpixsubmodule/src/cxx/autotools/missing healpixsubmodule/src/cxx/autotools/test-driver healpixsubmodule/src/cxx/autotools/Healpix_cxx/Healpix_cxx.dox healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm2map_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm2map_cxx.par.txt healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm2map_cxx_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_fitsio.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_fitsio.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_healpix_tools.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_healpix_tools.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_powspec_tools.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_powspec_tools.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/anafast_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/anafast_cxx.par.txt healpixsubmodule/src/cxx/autotools/Healpix_cxx/anafast_cxx_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/calc_powspec.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/calc_powspec_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_base.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_base.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_data_io.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_data_io.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map_fitsio.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map_fitsio.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_tables.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_tables.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/hotspots_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/hotspots_cxx_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/hpxtest.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/map2tga.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/map2tga.par.txt healpixsubmodule/src/cxx/autotools/Healpix_cxx/map2tga_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/median_filter_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/median_filter_cxx_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/mult_alm.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/mult_alm.par.txt healpixsubmodule/src/cxx/autotools/Healpix_cxx/mult_alm_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/planck.make healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec_fitsio.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec_fitsio.h healpixsubmodule/src/cxx/autotools/Healpix_cxx/rotalm_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/smoothing_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/smoothing_cxx.par.txt healpixsubmodule/src/cxx/autotools/Healpix_cxx/smoothing_cxx_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/syn_alm_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/syn_alm_cxx.par.txt healpixsubmodule/src/cxx/autotools/Healpix_cxx/syn_alm_cxx_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_cxx_module.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_harmonic_cxx.cc healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_harmonic_cxx_module.cc healpixsubmodule/src/cxx/autotools/c_utils/c_utils.c healpixsubmodule/src/cxx/autotools/c_utils/c_utils.h healpixsubmodule/src/cxx/autotools/c_utils/planck.make healpixsubmodule/src/cxx/autotools/c_utils/sse_utils.h healpixsubmodule/src/cxx/autotools/c_utils/walltime_c.c healpixsubmodule/src/cxx/autotools/c_utils/walltime_c.h healpixsubmodule/src/cxx/autotools/cxxsupport/alloc_utils.h healpixsubmodule/src/cxx/autotools/cxxsupport/announce.cc healpixsubmodule/src/cxx/autotools/cxxsupport/announce.h healpixsubmodule/src/cxx/autotools/cxxsupport/arr.h healpixsubmodule/src/cxx/autotools/cxxsupport/bstream.h healpixsubmodule/src/cxx/autotools/cxxsupport/cxxsupport.dox healpixsubmodule/src/cxx/autotools/cxxsupport/datatypes.h healpixsubmodule/src/cxx/autotools/cxxsupport/error_handling.cc healpixsubmodule/src/cxx/autotools/cxxsupport/error_handling.h healpixsubmodule/src/cxx/autotools/cxxsupport/fftpack_support.h healpixsubmodule/src/cxx/autotools/cxxsupport/fitshandle.cc healpixsubmodule/src/cxx/autotools/cxxsupport/fitshandle.h healpixsubmodule/src/cxx/autotools/cxxsupport/font_data.inc healpixsubmodule/src/cxx/autotools/cxxsupport/geom_utils.cc healpixsubmodule/src/cxx/autotools/cxxsupport/geom_utils.h healpixsubmodule/src/cxx/autotools/cxxsupport/levels_facilities.h healpixsubmodule/src/cxx/autotools/cxxsupport/ls_image.cc healpixsubmodule/src/cxx/autotools/cxxsupport/ls_image.h healpixsubmodule/src/cxx/autotools/cxxsupport/lsconstants.h healpixsubmodule/src/cxx/autotools/cxxsupport/math_utils.h healpixsubmodule/src/cxx/autotools/cxxsupport/openmp_support.h healpixsubmodule/src/cxx/autotools/cxxsupport/paramfile.cc healpixsubmodule/src/cxx/autotools/cxxsupport/paramfile.h healpixsubmodule/src/cxx/autotools/cxxsupport/planck.make healpixsubmodule/src/cxx/autotools/cxxsupport/planck_rng.h healpixsubmodule/src/cxx/autotools/cxxsupport/pointing.cc healpixsubmodule/src/cxx/autotools/cxxsupport/pointing.h healpixsubmodule/src/cxx/autotools/cxxsupport/rangeset.h healpixsubmodule/src/cxx/autotools/cxxsupport/rotmatrix.cc healpixsubmodule/src/cxx/autotools/cxxsupport/rotmatrix.h healpixsubmodule/src/cxx/autotools/cxxsupport/safe_cast.h healpixsubmodule/src/cxx/autotools/cxxsupport/safe_ptr.h healpixsubmodule/src/cxx/autotools/cxxsupport/share_utils.h healpixsubmodule/src/cxx/autotools/cxxsupport/sse_utils_cxx.h healpixsubmodule/src/cxx/autotools/cxxsupport/string_utils.cc healpixsubmodule/src/cxx/autotools/cxxsupport/string_utils.h healpixsubmodule/src/cxx/autotools/cxxsupport/trafos.cc healpixsubmodule/src/cxx/autotools/cxxsupport/trafos.h healpixsubmodule/src/cxx/autotools/cxxsupport/vec3.h healpixsubmodule/src/cxx/autotools/cxxsupport/walltimer.cc healpixsubmodule/src/cxx/autotools/cxxsupport/walltimer.h healpixsubmodule/src/cxx/autotools/cxxsupport/wigner.cc healpixsubmodule/src/cxx/autotools/cxxsupport/wigner.h healpixsubmodule/src/cxx/autotools/cxxsupport/xcomplex.h healpixsubmodule/src/cxx/autotools/libfftpack/README healpixsubmodule/src/cxx/autotools/libfftpack/bluestein.c healpixsubmodule/src/cxx/autotools/libfftpack/bluestein.h healpixsubmodule/src/cxx/autotools/libfftpack/fftpack.c healpixsubmodule/src/cxx/autotools/libfftpack/fftpack.h healpixsubmodule/src/cxx/autotools/libfftpack/fftpack_inc.c healpixsubmodule/src/cxx/autotools/libfftpack/libfftpack.dox healpixsubmodule/src/cxx/autotools/libfftpack/ls_fft.c healpixsubmodule/src/cxx/autotools/libfftpack/ls_fft.h healpixsubmodule/src/cxx/autotools/libfftpack/planck.make healpixsubmodule/src/cxx/autotools/libsharp/libsharp.dox healpixsubmodule/src/cxx/autotools/libsharp/planck.make healpixsubmodule/src/cxx/autotools/libsharp/sharp.c healpixsubmodule/src/cxx/autotools/libsharp/sharp.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_almhelpers.c healpixsubmodule/src/cxx/autotools/libsharp/sharp_almhelpers.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_complex_hacks.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_core.c healpixsubmodule/src/cxx/autotools/libsharp/sharp_core.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_core_inc.c healpixsubmodule/src/cxx/autotools/libsharp/sharp_core_inc2.c healpixsubmodule/src/cxx/autotools/libsharp/sharp_core_inchelper.c healpixsubmodule/src/cxx/autotools/libsharp/sharp_cxx.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_geomhelpers.c healpixsubmodule/src/cxx/autotools/libsharp/sharp_geomhelpers.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_internal.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_lowlevel.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_vecsupport.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_vecutil.h healpixsubmodule/src/cxx/autotools/libsharp/sharp_ylmgen_c.c healpixsubmodule/src/cxx/autotools/libsharp/sharp_ylmgen_c.h healpixsubmodule/src/cxx/autotools/m4/libtool.m4 healpixsubmodule/src/cxx/autotools/m4/ltoptions.m4 healpixsubmodule/src/cxx/autotools/m4/ltsugar.m4 healpixsubmodule/src/cxx/autotools/m4/ltversion.m4 healpixsubmodule/src/cxx/autotools/m4/lt~obsolete.m4 healpixsubmodule/src/cxx/autotools/m4/m4_ax_create_pkgconfig_info.m4 healpy/__init__.py healpy/cookbook.py healpy/fitsfunc.py healpy/newvisufunc.py healpy/pixelfunc.py healpy/projaxes.py healpy/projector.py healpy/rotator.py healpy/sphtfunc.py healpy/version.py healpy/visufunc.py healpy/zoomtool.py healpy.egg-info/PKG-INFO healpy.egg-info/SOURCES.txt healpy.egg-info/dependency_links.txt healpy.egg-info/requires.txt healpy.egg-info/top_level.txt healpy/data/pixel_window_n0002.fits healpy/data/pixel_window_n0004.fits healpy/data/pixel_window_n0008.fits healpy/data/pixel_window_n0016.fits healpy/data/pixel_window_n0032.fits healpy/data/pixel_window_n0064.fits healpy/data/pixel_window_n0128.fits healpy/data/pixel_window_n0256.fits healpy/data/pixel_window_n0512.fits healpy/data/pixel_window_n1024.fits healpy/data/pixel_window_n2048.fits healpy/data/pixel_window_n4096.fits healpy/data/pixel_window_n8192.fits healpy/data/totcls.dat healpy/data/weight_ring_n00002.fits healpy/data/weight_ring_n00004.fits healpy/data/weight_ring_n00008.fits healpy/data/weight_ring_n00016.fits healpy/data/weight_ring_n00032.fits healpy/data/weight_ring_n00064.fits healpy/data/weight_ring_n00128.fits healpy/data/weight_ring_n00256.fits healpy/data/weight_ring_n00512.fits healpy/data/weight_ring_n01024.fits healpy/data/weight_ring_n02048.fits healpy/data/weight_ring_n04096.fits healpy/data/weight_ring_n08192.fits healpy/src/_common.pxd healpy/src/_healpy_fitsio_lib.cc healpy/src/_healpy_pixel_lib.cc healpy/src/_healpy_sph_transform_lib.cc healpy/src/_healpy_utils.h healpy/src/_pixelfunc.cpp healpy/src/_pixelfunc.pyx healpy/src/_query_disc.cpp healpy/src/_query_disc.pyx healpy/src/_sphtools.cpp healpy/src/_sphtools.pyx healpy/test/__init__.py healpy/test/test_doctest_cython.py healpy/test/test_fitsfunc.py healpy/test/test_pixelfunc.py healpy/test/test_query_disc.py healpy/test/test_sphtfunc.py healpy/test/test_spinfunc.py healpy/test/test_visufunc.py healpy/test/data/anafast_3_11_config_test_anafast.par healpy/test/data/anafast_3_11_config_test_anafast_nomask.par healpy/test/data/anafast_3_11_config_test_anafast_xspectra.par healpy/test/data/cl_wmap_band_iqumap_r9_7yr_WVxspec_v4_udgraded32_II_lmax64_rmmono_3iter.fits healpy/test/data/cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_II_lmax64_rmmono_3iter.fits healpy/test/data/cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_II_lmax64_rmmono_3iter_nomask.fits healpy/test/data/cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_IQU_lmax64_rmmono_3iter.fits healpy/test/data/gaussbeam_10arcmin_lmax512_pol.fits healpy/test/data/map_synfast_seed12345.fits healpy/test/data/smoothing_3_11_config_test_smoothing_masked.par healpy/test/data/smoothing_3_11_config_test_smoothing_notmasked.par healpy/test/data/synfast_3_11_config_test_synfast.par healpy/test/data/wmap_band_iqumap_r9_7yr_V_v4_udgraded32.fits healpy/test/data/wmap_band_iqumap_r9_7yr_V_v4_udgraded32_masked.fits healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32.fits healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked_smoothed10deg_fortran.fits healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32_smoothed10deg_fortran.fits healpy/test/data/wmap_temperature_analysis_mask_r9_7yr_v4_udgraded32.fitshealpy-1.8.1/healpy/0000755000175000017500000000000012351601662014535 5ustar zoncazonca00000000000000healpy-1.8.1/healpy/sphtfunc.py0000644000175000017500000010030112346125412016732 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # import warnings import numpy as np import six pi = np.pi from . import _healpy_sph_transform_lib as sphtlib from . import _healpy_fitsio_lib as hfitslib from . import _sphtools as _sphtools from . import cookbook as cb import os.path from . import pixelfunc from .pixelfunc import maptype, UNSEEN, ma_to_array, accept_ma class FutureChangeWarning(UserWarning): pass DATAPATH = os.path.join(os.path.dirname(os.path.abspath(__file__)), 'data') # Spherical harmonics transformation def anafast(map1, map2 = None, nspec = None, lmax = None, mmax = None, iter = 3, alm = False, pol = True, use_weights = False, datapath = None): """Computes the power spectrum of an Healpix map, or the cross-spectrum between two maps if *map2* is given. No removal of monopole or dipole is performed. Parameters ---------- map1 : float, array-like shape (Npix,) or (3, Npix) Either an array representing a map, or a sequence of 3 arrays representing I, Q, U maps map2 : float, array-like shape (Npix,) or (3, Npix) Either an array representing a map, or a sequence of 3 arrays representing I, Q, U maps nspec : None or int, optional The number of spectra to return. If None, returns all, otherwise returns cls[:nspec] lmax : int, scalar, optional Maximum l of the power spectrum (default: 3*nside-1) mmax : int, scalar, optional Maximum m of the alm (default: lmax) iter : int, scalar, optional Number of iteration (default: 3) alm : bool, scalar, optional If True, returns both cl and alm, otherwise only cl is returned pol : bool, optional If True, assumes input maps are TQU. Output will be TEB cl's and correlations (input must be 1 or 3 maps). If False, maps are assumed to be described by spin 0 spherical harmonics. (input can be any number of maps) If there is only one input map, it has no effect. Default: True. datapath : None or str, optional If given, the directory where to find the weights data. Returns ------- res : array or sequence of arrays If *alm* is False, returns cl or a list of cl's (TT, EE, BB, TE, EB, TB for polarized input map) Otherwise, returns a tuple (cl, alm), where cl is as above and alm is the spherical harmonic transform or a list of almT, almE, almB for polarized input """ map1 = ma_to_array(map1) alms1 = map2alm(map1, lmax = lmax, mmax = mmax, pol = pol, iter = iter, use_weights = use_weights, datapath = datapath) if map2 is not None: map2 = ma_to_array(map2) alms2 = map2alm(map2, lmax = lmax, mmax = mmax, pol = pol, iter = iter, use_weights = use_weights, datapath = datapath) else: alms2 = None cls = alm2cl(alms1, alms2 = alms2, lmax = lmax, mmax = mmax, lmax_out = lmax, nspec = nspec) if alm: if map2 is not None: return (cls, alms1, alms2) else: return (cls, alms1) else: return cls def map2alm(maps, lmax = None, mmax = None, iter = 3, pol = True, use_weights = False, datapath = None): """Computes the alm of an Healpix map. Parameters ---------- maps : array-like, shape (Npix,) or (n, Npix) The input map or a list of n input maps. lmax : int, scalar, optional Maximum l of the power spectrum. Default: 3*nside-1 mmax : int, scalar, optional Maximum m of the alm. Default: lmax iter : int, scalar, optional Number of iteration (default: 3) pol : bool, optional If True, assumes input maps are TQU. Output will be TEB alm's. (input must be 1 or 3 maps) If False, apply spin 0 harmonic transform to each map. (input can be any number of maps) If there is only one input map, it has no effect. Default: True. use_weights: bool, scalar, optional If True, use the ring weighting. Default: False. datapath : None or str, optional If given, the directory where to find the weights data. Returns ------- alms : array or tuple of array alm or a tuple of 3 alm (almT, almE, almB) if polarized input. Notes ----- The pixels which have the special `UNSEEN` value are replaced by zeros before spherical harmonic transform. They are converted back to `UNSEEN` value, so that the input maps are not modified. Each map have its own, independent mask. """ maps = ma_to_array(maps) info = maptype(maps) if pol or info in (0, 1): alms = _sphtools.map2alm(maps, niter = iter, datapath = datapath, use_weights = use_weights, lmax = lmax, mmax = mmax) else: # info >= 2 and pol is False : spin 0 spht for each map alms = [_sphtools.map2alm(mm, niter = iter, datapath = datapath, use_weights = use_weights, lmax = lmax, mmax = mmax) for mm in maps] return alms def alm2map(alms, nside, lmax = None, mmax = None, pixwin = False, fwhm = 0.0, sigma = None, invert = False, pol = True, inplace = False, verbose=True): """Computes an Healpix map given the alm. The alm are given as a complex array. You can specify lmax and mmax, or they will be computed from array size (assuming lmax==mmax). Parameters ---------- alms : complex, array or sequence of arrays A complex array or a sequence of complex arrays. Each array must have a size of the form: mmax * (2 * lmax + 1 - mmax) / 2 + lmax + 1 nside : int, scalar The nside of the output map. lmax : None or int, scalar, optional Explicitly define lmax (needed if mmax!=lmax) mmax : None or int, scalar, optional Explicitly define mmax (needed if mmax!=lmax) pixwin : bool, optional Smooth the alm using the pixel window functions. Default: False. fwhm : float, scalar, optional The fwhm of the Gaussian used to smooth the map (applied on alm) [in radians] sigma : float, scalar, optional The sigma of the Gaussian used to smooth the map (applied on alm) [in radians] invert : bool, optional If True, alms are divided by Gaussian beam function (un-smooth). Otherwise, alms are multiplied by Gaussian beam function (smooth). Default: False. pol : bool, optional If True, assumes input alms are TEB. Output will be TQU maps. (input must be 1 or 3 alms) If False, apply spin 0 harmonic transform to each alm. (input can be any number of alms) If there is only one input alm, it has no effect. Default: True. inplace : bool, optional If True, input alms may be modified by pixel window function and beam smoothing (if alm(s) are complex128 contiguous arrays). Otherwise, input alms are not modified. A copy is made if needed to apply beam smoothing or pixel window. Returns ------- maps : array or list of arrays An Healpix map in RING scheme at nside or a list of T,Q,U maps (if polarized input) """ if not cb.is_seq(alms): raise TypeError("alms must be a sequence") alms = smoothalm(alms, fwhm = fwhm, sigma = sigma, invert = invert, pol = pol, inplace = inplace, verbose=verbose) if not cb.is_seq_of_seq(alms): alms = [alms] lonely = True else: lonely = False if pixwin: pw = globals()['pixwin'](nside,True) alms_new = [] for ialm, alm in enumerate(alms): pixelwindow = pw[1] if ialm >= 1 and pol else pw[0] alms_new.append(almxfl(alm, pixelwindow, inplace = inplace)) else: alms_new = alms if lmax is None: lmax = -1 if mmax is None: mmax = -1 if pol: output = sphtlib._alm2map(alms_new[0] if lonely else alms_new, nside, lmax = lmax, mmax = mmax) if lonely: output = [output] else: output = [sphtlib._alm2map(alm, nside, lmax = lmax, mmax = mmax) for alm in alms_new] if lonely: return output[0] else: return output def synalm(cls, lmax = None, mmax = None, new = False, verbose=True): """Generate a set of alm given cl. The cl are given as a float array. Corresponding alm are generated. If lmax is None, it is assumed lmax=cl.size-1 If mmax is None, it is assumed mmax=lmax. Parameters ---------- cls : float, array or tuple of arrays Either one cl (1D array) or a tuple of either 4 cl or of n*(n+1)/2 cl. Some of the cl may be None, implying no cross-correlation. See *new* parameter. lmax : int, scalar, optional The lmax (if None or <0, the largest size-1 of cls) mmax : int, scalar, optional The mmax (if None or <0, =lmax) new : bool, optional If True, use the new ordering of cl's, ie by diagonal (e.g. TT, EE, BB, TE, EB, TB or TT, EE, BB, TE if 4 cl as input). If False, use the old ordering, ie by row (e.g. TT, TE, TB, EE, EB, BB or TT, TE, EE, BB if 4 cl as input). Returns ------- alms : array or list of arrays the generated alm if one spectrum is given, or a list of n alms (with n(n+1)/2 the number of input cl, or n=3 if there are 4 input cl). Notes ----- The order of the spectra will change in a future release. The new= parameter help to make the transition smoother. You can start using the new order by setting new=True. In the next version of healpy, the default will be new=True. This change is done for consistency between the different tools (alm2cl, synfast, anafast). In the new order, the spectra are ordered by diagonal of the correlation matrix. Eg, if fields are T, E, B, the spectra are TT, EE, BB, TE, EB, TB with new=True, and TT, TE, TB, EE, EB, BB if new=False. """ if (not new) and verbose: warnings.warn("The order of the input cl's will change in a future " "release.\n" "Use new=True keyword to start using the new order.\n" "See documentation of healpy.synalm.", category=FutureChangeWarning) if not cb.is_seq(cls): raise TypeError('cls must be an array or a sequence of arrays') if not cb.is_seq_of_seq(cls): # Only one spectrum if lmax is None or lmax < 0: lmax = cls.size-1 if mmax is None or mmax < 0: mmax = lmax cls_list = [np.asarray(cls, dtype = np.float64)] szalm = Alm.getsize(lmax,mmax) alm = np.zeros(szalm,'D') alm.real = np.random.standard_normal(szalm) alm.imag = np.random.standard_normal(szalm) alms_list=[alm] sphtlib._synalm(cls_list,alms_list,lmax,mmax) return alm # From here, we interpret cls as a list of spectra cls_list = list(cls) maxsize = max([len(c) for c in cls]) if lmax is None or lmax < 0: lmax = maxsize-1 if mmax is None or mmax < 0: mmax = lmax Nspec = sphtlib._getn(len(cls_list)) if Nspec <= 0: if len(cls_list) == 4: if new: ## new input order: TT EE BB TE -> TT EE BB TE 0 0 cls_list = [cls[0], cls[1], cls[2], cls[3], None, None] else: ## old input order: TT TE EE BB -> TT TE 0 EE 0 BB cls_list = [cls[0], cls[1], None, cls[2], None, cls[3]] Nspec = 3 else: raise TypeError("The sequence of arrays must have either 4 elements " "or n(n+1)/2 elements (some may be None)") szalm = Alm.getsize(lmax,mmax) alms_list = [] for i in six.moves.xrange(Nspec): alm = np.zeros(szalm,'D') alm.real = np.random.standard_normal(szalm) alm.imag = np.random.standard_normal(szalm) alms_list.append(alm) if new: # new input order: input given by diagonal, should be given by row cls_list = new_to_old_spectra_order(cls_list) # ensure cls are float64 cls_list = [(np.asarray(cl, dtype = np.float64) if cl is not None else None) for cl in cls_list] sphtlib._synalm(cls_list, alms_list, lmax, mmax) return alms_list def synfast(cls, nside, lmax = None, mmax = None, alm = False, pol = True, pixwin = False, fwhm = 0.0, sigma = None, new = False, verbose=True): """Create a map(s) from cl(s). Parameters ---------- cls : array or tuple of array A cl or a list of cl (either 4 or 6, see :func:`synalm`) nside : int, scalar The nside of the output map(s) lmax : int, scalar, optional Maximum l for alm. Default: min of 3*nside-1 or length of the cls - 1 mmax : int, scalar, optional Maximum m for alm. alm : bool, scalar, optional If True, return also alm(s). Default: False. pol : bool, optional If True, assumes input cls are TEB and correlation. Output will be TQU maps. (input must be 1, 4 or 6 cl's) If False, fields are assumed to be described by spin 0 spherical harmonics. (input can be any number of cl's) If there is only one input cl, it has no effect. Default: True. pixwin : bool, scalar, optional If True, convolve the alm by the pixel window function. Default: False. fwhm : float, scalar, optional The fwhm of the Gaussian used to smooth the map (applied on alm) [in radians] sigma : float, scalar, optional The sigma of the Gaussian used to smooth the map (applied on alm) [in radians] Returns ------- maps : array or tuple of arrays The output map (possibly list of maps if polarized input). or, if alm is True, a tuple of (map,alm) (alm possibly a list of alm if polarized input) Notes ----- The order of the spectra will change in a future release. The new= parameter help to make the transition smoother. You can start using the new order by setting new=True. In the next version of healpy, the default will be new=True. This change is done for consistency between the different tools (alm2cl, synfast, anafast). In the new order, the spectra are ordered by diagonal of the correlation matrix. Eg, if fields are T, E, B, the spectra are TT, EE, BB, TE, EB, TB with new=True, and TT, TE, TB, EE, EB, BB if new=False. """ if not pixelfunc.isnsideok(nside): raise ValueError("Wrong nside value (must be a power of two).") cls_lmax = cb.len_array_or_arrays(cls) -1 if lmax is None or lmax < 0: lmax = min(cls_lmax, 3 * nside - 1) alms = synalm(cls, lmax = lmax, mmax = mmax, new = new, verbose=verbose) maps = alm2map(alms, nside, lmax = lmax, mmax = mmax, pixwin = pixwin, pol = pol, fwhm = fwhm, sigma = sigma, inplace = True, verbose=verbose) if alm: return maps, alms else: return maps class Alm(object): """This class provides some static methods for alm index computation. Methods ------- getlm getidx getsize getlmax """ def __init__(self): pass @staticmethod def getlm(lmax,i=None): """Get the l and m from index and lmax. Parameters ---------- lmax : int The maximum l defining the alm layout i : int or None The index for which to compute the l and m. If None, the function return l and m for i=0..Alm.getsize(lmax) """ if i is None: i=np.arange(Alm.getsize(lmax)) m=(np.ceil(((2*lmax+1)-np.sqrt((2*lmax+1)**2-8*(i-lmax)))/2)).astype(int) l = i-m*(2*lmax+1-m)//2 return (l,m) @staticmethod def getidx(lmax,l,m): """Returns index corresponding to (l,m) in an array describing alm up to lmax. Parameters ---------- lmax : int The maximum l, defines the alm layout l : int The l for which to get the index m : int The m for which to get the index Returns ------- idx : int The index corresponding to (l,m) """ return m*(2*lmax+1-m)//2+l @staticmethod def getsize(lmax,mmax = None): """Returns the size of the array needed to store alm up to *lmax* and *mmax* Parameters ---------- lmax : int The maximum l, defines the alm layout mmax : int, optional The maximum m, defines the alm layout. Default: lmax. Returns ------- size : int The size of the array needed to store alm up to lmax, mmax. """ if mmax is None or mmax < 0 or mmax > lmax: mmax = lmax return mmax * (2 * lmax + 1 - mmax) // 2 + lmax + 1 @staticmethod def getlmax(s, mmax = None): """Returns the lmax corresponding to a given array size. Parameters ---------- s : int Size of the array mmax : None or int, optional The maximum m, defines the alm layout. Default: lmax. Returns ------- lmax : int The maximum l of the array, or -1 if it is not a valid size. """ if mmax is not None and mmax >= 0: x = (2 * s + mmax ** 2 - mmax - 2) / (2 * mmax + 2) else: x = (-3 + np.sqrt(1 + 8 * s)) / 2 if x != np.floor(x): return -1 else: return int(x) def alm2cl(alms1, alms2 = None, lmax = None, mmax = None, lmax_out = None, nspec = None): """Computes (cross-)spectra from alm(s). If alm2 is given, cross-spectra between alm and alm2 are computed. If alm (and alm2 if provided) contains n alm, then n(n+1)/2 auto and cross-spectra are returned. Parameters ---------- alm : complex, array or sequence of arrays The alm from which to compute the power spectrum. If n>=2 arrays are given, computes both auto- and cross-spectra. alms2 : complex, array or sequence of 3 arrays, optional If provided, computes cross-spectra between alm and alm2. Default: alm2=alm, so auto-spectra are computed. lmax : None or int, optional The maximum l of the input alm. Default: computed from size of alm and mmax_in mmax : None or int, optional The maximum m of the input alm. Default: assume mmax_in = lmax_in lmax_out : None or int, optional The maximum l of the returned spectra. By default: the lmax of the given alm(s). nspec : None or int, optional The number of spectra to return. None means all, otherwise returns cl[:nspec] Returns ------- cl : array or tuple of n(n+1)/2 arrays the spectrum <*alm* x *alm2*> if *alm* (and *alm2*) is one alm, or the auto- and cross-spectra <*alm*[i] x *alm2*[j]> if alm (and alm2) contains more than one spectra. If more than one spectrum is returned, they are ordered by diagonal. For example, if *alm* is almT, almE, almB, then the returned spectra are: TT, EE, BB, TE, EB, TB. """ cls = _sphtools.alm2cl(alms1, alms2 = alms2, lmax = lmax, mmax = mmax, lmax_out = lmax_out) if nspec is None: return cls else: return cls[:nspec] def almxfl(alm, fl, mmax = None, inplace = False): """Multiply alm by a function of l. The function is assumed to be zero where not defined. Parameters ---------- alm : array The alm to multiply fl : array The function (at l=0..fl.size-1) by which alm must be multiplied. mmax : None or int, optional The maximum m defining the alm layout. Default: lmax. inplace : bool, optional If True, modify the given alm, otherwise make a copy before multiplying. Returns ------- alm : array The modified alm, either a new array or a reference to input alm, if inplace is True. """ almout = _sphtools.almxfl(alm, fl, mmax = mmax, inplace = inplace) return almout def smoothalm(alms, fwhm = 0.0, sigma = None, invert = False, pol = True, mmax = None, verbose = True, inplace = True): """Smooth alm with a Gaussian symmetric beam function. Parameters ---------- alms : array or sequence of 3 arrays Either an array representing one alm, or a sequence of arrays. See *pol* parameter. fwhm : float, optional The full width half max parameter of the Gaussian. Default:0.0 [in radians] sigma : float, optional The sigma of the Gaussian. Override fwhm. [in radians] invert : bool, optional If True, alms are divided by Gaussian beam function (un-smooth). Otherwise, alms are multiplied by Gaussian beam function (smooth). Default: False. pol : bool, optional If True, assumes input alms are TEB. Output will be TQU maps. (input must be 1 or 3 alms) If False, apply spin 0 harmonic transform to each alm. (input can be any number of alms) If there is only one input alm, it has no effect. Default: True. mmax : None or int, optional The maximum m for alm. Default: mmax=lmax inplace : bool, optional If True, the alm's are modified inplace if they are contiguous arrays of type complex128. Otherwise, a copy of alm is made. Default: True. verbose : bool, optional If True prints diagnostic information. Default: True Returns ------- alms : array or sequence of 3 arrays The smoothed alm. If alm[i] is a contiguous array of type complex128, and *inplace* is True the smoothing is applied inplace. Otherwise, a copy is made. """ if sigma is None: sigma = fwhm / (2.*np.sqrt(2.*np.log(2.))) if verbose: print("Sigma is {0:f} arcmin ({1:f} rad) ".format(sigma*60*180/pi,sigma)) print("-> fwhm is {0:f} arcmin".format(sigma*60*180/pi*(2.*np.sqrt(2.*np.log(2.))))) # Check alms if not cb.is_seq(alms): raise ValueError("alm must be a sequence") if sigma == 0: # nothing to be done return alms lonely = False if not cb.is_seq_of_seq(alms): alms = [alms] lonely = True # we have 3 alms -> apply smoothing to each map. # polarization has different B_l from temperature # exp{-[ell(ell+1) - s**2] * sigma**2/2} # with s the spin of spherical harmonics # s = 2 for pol, s=0 for temperature retalm = [] for ialm, alm in enumerate(alms): lmax = Alm.getlmax(len(alm), mmax) if lmax < 0: raise TypeError('Wrong alm size for the given ' 'mmax (len(alms[%d]) = %d).'%(ialm, len(alm))) ell = np.arange(lmax + 1.) s = 2 if ialm >= 1 and pol else 0 fact = np.exp(-0.5 * (ell * (ell + 1) - s ** 2) * sigma ** 2) res = almxfl(alm, fact, mmax = mmax, inplace = inplace) retalm.append(res) # Test what to return (inplace/not inplace...) # Case 1: 1d input, return 1d output if lonely: return retalm[0] # case 2: 2d input, check if in-place smoothing for all alm's for i in six.moves.xrange(len(alms)): samearray = alms[i] is retalm[i] if not samearray: # Case 2a: # at least one of the alm could not be smoothed in place: # return the list of alm return retalm # Case 2b: # all smoothing have been performed in place: # return the input alms return alms @accept_ma def smoothing(maps, fwhm = 0.0, sigma = None, invert = False, pol = True, iter = 3, lmax = None, mmax = None, use_weights = False, datapath = None, verbose = True): """Smooth a map with a Gaussian symmetric beam. No removal of monopole or dipole is performed. Parameters ---------- maps : array or sequence of 3 arrays Either an array representing one map, or a sequence of 3 arrays representing 3 maps, accepts masked arrays fwhm : float, optional The full width half max parameter of the Gaussian [in radians]. Default:0.0 sigma : float, optional The sigma of the Gaussian [in radians]. Override fwhm. invert : bool, optional If True, alms are divided by Gaussian beam function (un-smooth). Otherwise, alms are multiplied by Gaussian beam function (smooth). Default: False. pol : bool, optional If True, assumes input maps are TQU. Output will be TQU maps. (input must be 1 or 3 alms) If False, each map is assumed to be a spin 0 map and is treated independently (input can be any number of alms). If there is only one input map, it has no effect. Default: True. iter : int, scalar, optional Number of iteration (default: 3) lmax : int, scalar, optional Maximum l of the power spectrum. Default: 3*nside-1 mmax : int, scalar, optional Maximum m of the alm. Default: lmax use_weights: bool, scalar, optional If True, use the ring weighting. Default: False. datapath : None or str, optional If given, the directory where to find the weights data. verbose : bool, optional If True prints diagnostic information. Default: True Returns ------- maps : array or list of 3 arrays The smoothed map(s) """ if not cb.is_seq(maps): raise TypeError("maps must be a sequence") # save the masks of inputs masks = pixelfunc.mask_bad(maps) if cb.is_seq_of_seq(maps): nside = pixelfunc.npix2nside(len(maps[0])) n_maps = len(maps) else: nside = pixelfunc.npix2nside(len(maps)) n_maps = 0 if pol or n_maps in (0, 1): # Treat the maps together (1 or 3 maps) alms = map2alm(maps, lmax = lmax, mmax = mmax, iter = iter, pol = pol, use_weights = use_weights, datapath = datapath) smoothalm(alms, fwhm = fwhm, sigma = sigma, invert = invert, inplace = True, verbose = verbose) output_map = alm2map(alms, nside, pixwin = False, verbose=verbose) else: # Treat each map independently (any number) output_map = [] for m, mask in zip(maps, masks): alm = map2alm(maps, iter = iter, pol = pol, use_weights = use_weights, datapath = datapath) smoothalm(alm, fwhm = fwhm, sigma = sigma, invert = invert, inplace = True, verbose = verbose) output_map.append(alm2map(alm, nside, pixwin = False, verbose=verbose)) if pixelfunc.maptype(output_map) == 0: output_map[masks.flatten()] = UNSEEN else: for m, mask in zip(output_map, masks): m[mask] = UNSEEN return output_map def pixwin(nside, pol = False): """Return the pixel window function for the given nside. Parameters ---------- nside : int The nside for which to return the pixel window function pol : bool, optional If True, return also the polar pixel window. Default: False Returns ------- pw or pwT,pwP : array or tuple of 2 arrays The temperature pixel window function, or a tuple with both temperature and polarisation pixel window functions. """ datapath = DATAPATH if not pixelfunc.isnsideok(nside): raise ValueError("Wrong nside value (must be a power of two).") fname = os.path.join(datapath, 'pixel_window_n%04d.fits'%nside) if not os.path.isfile(fname): raise ValueError("No pixel window for this nside " "or data files missing") # return hfitslib._pixwin(nside,datapath,pol) ## BROKEN -> seg fault... try: import pyfits except ImportError: raise ImportError("You need to install pyfits to use this function.") pw = pyfits.getdata(fname) pw_temp, pw_pol = pw.field(0), pw.field(1) if pol: return pw_temp, pw_pol else: return pw_temp def alm2map_der1(alm, nside, lmax = None, mmax = None): """Computes an Healpix map and its first derivatives given the alm. The alm are given as a complex array. You can specify lmax and mmax, or they will be computed from array size (assuming lmax==mmax). Parameters ---------- alm : array, complex A complex array of alm. Size must be of the form mmax(lmax-mmax+1)/2+lmax nside : int The nside of the output map. lmax : None or int, optional Explicitly define lmax (needed if mmax!=lmax) mmax : None or int, optional Explicitly define mmax (needed if mmax!=lmax) Returns ------- m, d_theta, d_phi : tuple of arrays The maps correponding to alm, and its derivatives with respect to theta and phi. d_phi is already divided by sin(theta) """ if lmax is None: lmax = -1 if mmax is None: mmax = -1 return sphtlib._alm2map_der1(alm,nside,lmax=lmax,mmax=mmax) def new_to_old_spectra_order(cls_new_order): """Reorder the cls from new order (by diagonal) to old order (by row). For example : TT, EE, BB, TE, EB, BB => TT, TE, TB, EE, EB, BB """ Nspec = sphtlib._getn(len(cls_new_order)) if Nspec < 0: raise ValueError("Input must be a list of n(n+1)/2 arrays") cls_old_order = [] for i in six.moves.xrange(Nspec): for j in six.moves.xrange(i, Nspec): p = j - i q = i idx_new = p * (2 * Nspec + 1 - p) / 2 + q cls_old_order.append(cls_new_order[idx_new]) return cls_old_order def load_sample_spectra(): """Read a sample power spectra for testing and demo purpose. Based on LambdaCDM. Gives TT, EE, BB, TE. Returns ------- ell, f, cls : arrays ell is the array of ell values (from 0 to lmax) f is the factor ell*(ell+1)/2pi (in general, plots show f * cl) cls is a sequence of the power spectra TT, EE, BB and TE """ cls = np.loadtxt(os.path.join(DATAPATH, 'totcls.dat'), unpack = True) ell = cls[0] f = ell * (ell + 1) / 2 / np.pi cls[1:, 1:] /= f[1:] return ell, f, cls[1:] def gauss_beam(fwhm, lmax=512, pol=False): """Gaussian beam window function Computes the spherical transform of an axisimmetric gaussian beam For a sky of underlying power spectrum C(l) observed with beam of given FWHM, the measured power spectrum will be C(l)_meas = C(l) B(l)^2 where B(l) is given by gaussbeam(Fwhm,Lmax). The polarization beam is also provided (when pol = True ) assuming a perfectly co-polarized beam (e.g., Challinor et al 2000, astro-ph/0008228) Parameters ---------- fwhm : float full width half max in radians lmax : integer ell max pol : bool if False, output has size (lmax+1) and is temperature beam if True output has size (lmax+1, 4) with components: * temperature beam * grad/electric polarization beam * curl/magnetic polarization beam * temperature * grad beam Returns ------- beam : array beam window function [0, lmax] if dim not specified otherwise (lmax+1, 4) contains polarized beam """ sigma = fwhm / np.sqrt(8. * np.log(2.)) ell = np.arange(lmax + 1) sigma2 = sigma ** 2 g = np.exp(-.5 * ell * (ell + 1) * sigma2) if not pol: # temperature-only beam return g else: # polarization beam # polarization factors [1, 2 sigma^2, 2 sigma^2, sigma^2] pol_factor = np.exp([0., 2*sigma2, 2*sigma2, sigma2]) return g[:, np.newaxis] * pol_factor healpy-1.8.1/healpy/src/0000755000175000017500000000000012351601662015324 5ustar zoncazonca00000000000000healpy-1.8.1/healpy/src/_query_disc.pyx0000644000175000017500000003000512351601276020373 0ustar zoncazonca00000000000000# Wrapper around the query_disc method of Healpix_base class import numpy as np cimport numpy as np from libcpp cimport bool from libcpp.vector cimport vector cimport cython from _common cimport int64, pointing, rangeset, vec3, Healpix_Ordering_Scheme, RING, NEST, SET_NSIDE, T_Healpix_Base @cython.boundscheck(False) @cython.wraparound(False) def query_disc(nside, vec, radius, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): """Returns pixels whose centers lie within the disk defined by *vec* and *radius* (in radians) (if *inclusive* is False), or which overlap with this disk (if *inclusive* is True). Parameters ---------- nside : int The nside of the Healpix map. vec : float, sequence of 3 elements The coordinates of unit vector defining the disk center. radius : float The radius (in radians) of the disk inclusive : bool, optional If False, return the exact set of pixels whose pixel centers lie within the disk; if True, return all pixels that overlap with the disk, and maybe a few more. Default: False fact : int, optional Only used when inclusive=True. The overlapping test will be done at the resolution fact*nside. For NESTED ordering, fact must be a power of 2, less than 2**30, else it can be any positive integer. Default: 4. nest: bool, optional if True, assume NESTED pixel ordering, otherwise, RING pixel ordering buff: int array, optional if provided, this numpy array is used to contain the return values and must be at least long enough to do so Returns ------- ipix : int, array The pixels which lie within the given disk. Note ---- This method is more efficient in the RING scheme. For inclusive=True, the algorithm may return some pixels which don't overlap with the disk at all. The higher fact is chosen, the fewer false positives are returned, at the cost of increased run time. """ # Check Nside value if not isnsideok(nside): raise ValueError('Wrong nside value, must be a power of 2, less than 2**30') cdef vec3 v = vec3(vec[0], vec[1], vec[2]) cdef Healpix_Ordering_Scheme scheme if nest: scheme = NEST else: scheme = RING cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) cdef rangeset[int64] pixset cdef int factor = fact cdef pointing ptg = pointing(v) ptg.normalize() if inclusive: factor = abs(fact) if nest and (factor == 0 or (factor & (factor - 1) != 0)): raise ValueError('fact must be a power of 2, less than 2**30 when ' 'nest is True (fact=%d)' % (fact)) hb.query_disc_inclusive(ptg, radius, pixset, factor) else: hb.query_disc(ptg, radius, pixset) return pixset_to_array(pixset, buff) def query_polygon(nside, vertices, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): """ Returns the pixels whose centers lie within the convex polygon defined by the *vertices* array (if *inclusive* is False), or which overlap with this polygon (if *inclusive* is True). Parameters ---------- nside : int The nside of the Healpix map. vertices : float, array-like Vertex array containing the vertices of the polygon, shape (N, 3). inclusive : bool, optional If False, return the exact set of pixels whose pixel centers lie within the polygon; if True, return all pixels that overlap with the polygon, and maybe a few more. Default: False. fact : int, optional Only used when inclusive=True. The overlapping test will be done at the resolution fact*nside. For NESTED ordering, fact must be a power of 2, less than 2**30, else it can be any positive integer. Default: 4. nest: bool, optional if True, assume NESTED pixel ordering, otherwise, RING pixel ordering buff: int array, optional if provided, this numpy array is used to contain the return values and must be at least long enough to do so Returns ------- ipix : int, array The pixels which lie within the given polygon. Note ---- This method is more efficient in the RING scheme. For inclusive=True, the algorithm may return some pixels which don't overlap with the disk at all. The higher fact is chosen, the fewer false positives are returned, at the cost of increased run time. """ # Check Nside value if not isnsideok(nside): raise ValueError('Wrong nside value, must be a power of 2, less than 2**30') # Create vector of vertices cdef vector[pointing] vert cdef pointing ptg for v in vertices: ptg = pointing(vec3(v[0], v[1], v[2])) ptg.normalize() vert.push_back(ptg) # Create the Healpix_Base2 structure cdef Healpix_Ordering_Scheme scheme if nest: scheme = NEST else: scheme = RING cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # Call query_polygon cdef rangeset[int64] pixset cdef int factor if inclusive: factor = abs(fact) if nest and (factor == 0 or (factor & (factor - 1) != 0)): raise ValueError('fact must be a power of 2, less than 2**30 when ' 'nest is True (fact=%d)' % (fact)) hb.query_polygon_inclusive(vert, pixset, factor) else: hb.query_polygon(vert, pixset) return pixset_to_array(pixset, buff) def query_strip(nside, theta1, theta2, inclusive = False, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): """Returns pixels whose centers lie within the colatitude range defined by *theta1* and *theta2* (if inclusive is False), or which overlap with this region (if *inclusive* is True). If theta1= (12*nside*nside): raise ValueError('Pixel identifier is too large') hb.boundaries(pix, step, bounds) cdef size_t n = bounds.size() cdef np.ndarray[double, ndim = 2] out = np.empty((3, n), dtype=np.float) for i in range(n): out[0,i] = bounds[i].x out[1,i] = bounds[i].y out[2,i] = bounds[i].z return out def _boundaries_multiple(nside, pix, step=1, nest=False): cdef Healpix_Ordering_Scheme scheme if nest: scheme = NEST else: scheme = RING cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) cdef size_t npix = len(pix) cdef size_t n = step * 4 cdef size_t maxnpix = 12*nside*nside cdef np.ndarray[double, ndim = 3] out = np.empty((npix, 3, n), dtype=np.float) cdef vector[vec3] bounds for j in range(npix): if pix[j] >= maxnpix: raise ValueError('Pixel identifier is too large') hb.boundaries(pix[j], step, bounds) for i in range(n): out[j, 0, i] = bounds[i].x out[j, 1, i] = bounds[i].y out[j, 2, i] = bounds[i].z return out def boundaries(nside, pix, step=1, nest=False): """Returns an array containing vectors to the boundary of the nominated pixel. The returned array has shape (3, 4*step), the elements of which are the x,y,z positions on the unit sphere of the pixel boundary. In order to get vector positions for just the corners, specify step=1. Parameters ---------- nside : int The nside of the Healpix map. pix : int Pixel identifier step : int, optional Number of elements for each side of the pixel. nest : bool, optional if True, assume NESTED pixel ordering, otherwise, RING pixel ordering Returns ------- boundary : float, array x,y,z for positions on the boundary of the pixel Example ------- # Get corners of HEALPixel 5 in nside=2, RINGS ordering. >>> import healpy as hp >>> import numpy as np >>> nside = 2 >>> corners = hp.boundaries(nside, 5) # Now convert to phi,theta representation: >>> phi_theta = hp.vec2ang(np.transpose(corners)) >>> corners = hp.boundaries(nside, np.array([5,5])) # doctest moved to test_query_disc.py """ if not isnsideok(nside): raise ValueError('Wrong nside value, must be a power of 2, less than 2**30') if isinstance(pix, (int, long)): return _boundaries_single(nside, pix, step=step, nest=nest) if type(pix) is np.ndarray: if not issubclass(pix.dtype.type, np.integer): raise ValueError('Array of pixels has to be integers') if pix.ndim!=1: raise ValueError('Array has to one dimensional') return _boundaries_multiple(nside, pix, step=step, nest=nest) # Try to implement pix2ang ### @cython.boundscheck(False) ### @cython.wraparound(False) ### def pix2ang(nside, ipix, nest = False): ### # Check Nside value ### if not isnsideok(nside): ### raise ValueError('Wrong nside value, must be a power of 2, less than 2**30') ### # Create the Healpix_Base2 structure ### cdef Healpix_Ordering_Scheme scheme ### if nest: ### scheme = NEST ### else: ### scheme = RING ### cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) ### cdef pointing p ### ipix_ = np.asarray(ipix, dtype = np.int64) ### out_shape = (2,) + ipix_.shape ### out = np.empty(out_shape, dtype = np.float64) ### cdef np.ndarray[int64, ndim = 1] ipix_r = ipix_.reshape(-1) ### cdef np.ndarray[double, ndim = 2] out_r = out.reshape(2, -1) ### cdef int i, n ### n = ipix_r.size ### for i in range(n): ### p = hb.pix2ang(ipix_r[i]) ### out_r[0, i] = p.theta ### out_r[1, i] = p.phi ### del out_r, ipix_r, ipix_ ### return out @cython.boundscheck(False) @cython.wraparound(False) cdef pixset_to_array(rangeset[int64] &pixset, buff=None): cdef int64 i, n n = pixset.nval() cdef np.ndarray[np.int64_t, ndim=1] ipix if buff is None : ipix = np.empty(n, dtype=np.int64) else : if n>=len(buff) : raise ValueError("Buffer too small to contain return value") ipix = buff[:n] cdef int64 a, b, ii, ip ii = 0 n = pixset.size() for i in range(n): a = pixset.ivbegin(i) b = pixset.ivend(i) for ip in range(a, b): ipix[ii] = ip ii += 1 return ipix cdef bool isnsideok(int nside): return nside > 0 and ((nside & (nside -1))==0) healpy-1.8.1/healpy/src/_query_disc.cpp0000644000175000017500000146374112346125214020354 0ustar zoncazonca00000000000000/* Generated by Cython 0.20.1 on Wed Jun 11 12:14:20 2014 */ #define PY_SSIZE_T_CLEAN #ifndef CYTHON_USE_PYLONG_INTERNALS #ifdef PYLONG_BITS_IN_DIGIT #define CYTHON_USE_PYLONG_INTERNALS 0 #else #include "pyconfig.h" #ifdef PYLONG_BITS_IN_DIGIT #define CYTHON_USE_PYLONG_INTERNALS 1 #else #define CYTHON_USE_PYLONG_INTERNALS 0 #endif #endif #endif #include "Python.h" #ifndef Py_PYTHON_H #error Python headers needed to compile C extensions, please install development version of Python. #elif PY_VERSION_HEX < 0x02040000 #error Cython requires Python 2.4+. #else #define CYTHON_ABI "0_20_1" #include /* For offsetof */ #ifndef offsetof #define offsetof(type, member) ( (size_t) & ((type*)0) -> member ) #endif #if !defined(WIN32) && !defined(MS_WINDOWS) #ifndef __stdcall #define __stdcall #endif #ifndef __cdecl #define __cdecl #endif #ifndef __fastcall #define __fastcall #endif #endif #ifndef DL_IMPORT #define DL_IMPORT(t) t #endif #ifndef DL_EXPORT #define DL_EXPORT(t) t #endif #ifndef PY_LONG_LONG #define PY_LONG_LONG LONG_LONG #endif #ifndef Py_HUGE_VAL #define Py_HUGE_VAL HUGE_VAL #endif #ifdef PYPY_VERSION #define CYTHON_COMPILING_IN_PYPY 1 #define CYTHON_COMPILING_IN_CPYTHON 0 #else #define CYTHON_COMPILING_IN_PYPY 0 #define CYTHON_COMPILING_IN_CPYTHON 1 #endif #if CYTHON_COMPILING_IN_PYPY #define Py_OptimizeFlag 0 #endif #if PY_VERSION_HEX < 0x02050000 typedef int Py_ssize_t; #define PY_SSIZE_T_MAX INT_MAX #define PY_SSIZE_T_MIN INT_MIN #define PY_FORMAT_SIZE_T "" #define CYTHON_FORMAT_SSIZE_T "" #define PyInt_FromSsize_t(z) PyInt_FromLong(z) #define PyInt_AsSsize_t(o) __Pyx_PyInt_As_int(o) #define PyNumber_Index(o) ((PyNumber_Check(o) && !PyFloat_Check(o)) ? PyNumber_Int(o) : \ (PyErr_Format(PyExc_TypeError, \ "expected index value, got %.200s", Py_TYPE(o)->tp_name), \ (PyObject*)0)) #define __Pyx_PyIndex_Check(o) (PyNumber_Check(o) && !PyFloat_Check(o) && \ !PyComplex_Check(o)) #define PyIndex_Check __Pyx_PyIndex_Check #define PyErr_WarnEx(category, message, stacklevel) PyErr_Warn(category, message) #define __PYX_BUILD_PY_SSIZE_T "i" #else #define __PYX_BUILD_PY_SSIZE_T "n" #define CYTHON_FORMAT_SSIZE_T "z" #define __Pyx_PyIndex_Check PyIndex_Check #endif #if PY_VERSION_HEX < 0x02060000 #define Py_REFCNT(ob) (((PyObject*)(ob))->ob_refcnt) #define Py_TYPE(ob) (((PyObject*)(ob))->ob_type) #define Py_SIZE(ob) (((PyVarObject*)(ob))->ob_size) #define PyVarObject_HEAD_INIT(type, size) \ PyObject_HEAD_INIT(type) size, #define PyType_Modified(t) typedef struct { void *buf; PyObject *obj; Py_ssize_t len; Py_ssize_t itemsize; int readonly; int ndim; char *format; Py_ssize_t *shape; Py_ssize_t *strides; Py_ssize_t *suboffsets; void *internal; } Py_buffer; #define PyBUF_SIMPLE 0 #define PyBUF_WRITABLE 0x0001 #define PyBUF_FORMAT 0x0004 #define PyBUF_ND 0x0008 #define PyBUF_STRIDES (0x0010 | PyBUF_ND) #define PyBUF_C_CONTIGUOUS (0x0020 | PyBUF_STRIDES) #define PyBUF_F_CONTIGUOUS (0x0040 | PyBUF_STRIDES) #define PyBUF_ANY_CONTIGUOUS (0x0080 | PyBUF_STRIDES) #define PyBUF_INDIRECT (0x0100 | PyBUF_STRIDES) #define PyBUF_RECORDS (PyBUF_STRIDES | PyBUF_FORMAT | PyBUF_WRITABLE) #define PyBUF_FULL (PyBUF_INDIRECT | PyBUF_FORMAT | PyBUF_WRITABLE) typedef int (*getbufferproc)(PyObject *, Py_buffer *, int); typedef void (*releasebufferproc)(PyObject *, Py_buffer *); #endif #if PY_MAJOR_VERSION < 3 #define __Pyx_BUILTIN_MODULE_NAME "__builtin__" #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) \ PyCode_New(a+k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) #define __Pyx_DefaultClassType PyClass_Type #else #define __Pyx_BUILTIN_MODULE_NAME "builtins" #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) \ PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) #define __Pyx_DefaultClassType PyType_Type #endif #if PY_VERSION_HEX < 0x02060000 #define PyUnicode_FromString(s) PyUnicode_Decode(s, strlen(s), "UTF-8", "strict") #endif #if PY_MAJOR_VERSION >= 3 #define Py_TPFLAGS_CHECKTYPES 0 #define Py_TPFLAGS_HAVE_INDEX 0 #endif #if (PY_VERSION_HEX < 0x02060000) || (PY_MAJOR_VERSION >= 3) #define Py_TPFLAGS_HAVE_NEWBUFFER 0 #endif #if PY_VERSION_HEX < 0x02060000 #define Py_TPFLAGS_HAVE_VERSION_TAG 0 #endif #if PY_VERSION_HEX < 0x02060000 && !defined(Py_TPFLAGS_IS_ABSTRACT) #define Py_TPFLAGS_IS_ABSTRACT 0 #endif #if PY_VERSION_HEX < 0x030400a1 && !defined(Py_TPFLAGS_HAVE_FINALIZE) #define Py_TPFLAGS_HAVE_FINALIZE 0 #endif #if PY_VERSION_HEX > 0x03030000 && defined(PyUnicode_KIND) #define CYTHON_PEP393_ENABLED 1 #define __Pyx_PyUnicode_READY(op) (likely(PyUnicode_IS_READY(op)) ? \ 0 : _PyUnicode_Ready((PyObject *)(op))) #define __Pyx_PyUnicode_GET_LENGTH(u) PyUnicode_GET_LENGTH(u) #define __Pyx_PyUnicode_READ_CHAR(u, i) PyUnicode_READ_CHAR(u, i) #define __Pyx_PyUnicode_KIND(u) PyUnicode_KIND(u) #define __Pyx_PyUnicode_DATA(u) PyUnicode_DATA(u) #define __Pyx_PyUnicode_READ(k, d, i) PyUnicode_READ(k, d, i) #else #define CYTHON_PEP393_ENABLED 0 #define __Pyx_PyUnicode_READY(op) (0) #define __Pyx_PyUnicode_GET_LENGTH(u) PyUnicode_GET_SIZE(u) #define __Pyx_PyUnicode_READ_CHAR(u, i) ((Py_UCS4)(PyUnicode_AS_UNICODE(u)[i])) #define __Pyx_PyUnicode_KIND(u) (sizeof(Py_UNICODE)) #define __Pyx_PyUnicode_DATA(u) ((void*)PyUnicode_AS_UNICODE(u)) #define __Pyx_PyUnicode_READ(k, d, i) ((void)(k), (Py_UCS4)(((Py_UNICODE*)d)[i])) #endif #if CYTHON_COMPILING_IN_PYPY #define __Pyx_PyUnicode_Concat(a, b) PyNumber_Add(a, b) #define __Pyx_PyUnicode_ConcatSafe(a, b) PyNumber_Add(a, b) #else #define __Pyx_PyUnicode_Concat(a, b) PyUnicode_Concat(a, b) #define __Pyx_PyUnicode_ConcatSafe(a, b) ((unlikely((a) == Py_None) || unlikely((b) == Py_None)) ? \ PyNumber_Add(a, b) : __Pyx_PyUnicode_Concat(a, b)) #endif #define __Pyx_PyString_FormatSafe(a, b) ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : __Pyx_PyString_Format(a, b)) #define __Pyx_PyUnicode_FormatSafe(a, b) ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : PyUnicode_Format(a, b)) #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyString_Format(a, b) PyUnicode_Format(a, b) #else #define __Pyx_PyString_Format(a, b) PyString_Format(a, b) #endif #if PY_MAJOR_VERSION >= 3 #define PyBaseString_Type PyUnicode_Type #define PyStringObject PyUnicodeObject #define PyString_Type PyUnicode_Type #define PyString_Check PyUnicode_Check #define PyString_CheckExact PyUnicode_CheckExact #endif #if PY_VERSION_HEX < 0x02060000 #define PyBytesObject PyStringObject #define PyBytes_Type PyString_Type #define PyBytes_Check PyString_Check #define PyBytes_CheckExact PyString_CheckExact #define PyBytes_FromString PyString_FromString #define PyBytes_FromStringAndSize PyString_FromStringAndSize #define PyBytes_FromFormat PyString_FromFormat #define PyBytes_DecodeEscape PyString_DecodeEscape #define PyBytes_AsString PyString_AsString #define PyBytes_AsStringAndSize PyString_AsStringAndSize #define PyBytes_Size PyString_Size #define PyBytes_AS_STRING PyString_AS_STRING #define PyBytes_GET_SIZE PyString_GET_SIZE #define PyBytes_Repr PyString_Repr #define PyBytes_Concat PyString_Concat #define PyBytes_ConcatAndDel PyString_ConcatAndDel #endif #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyBaseString_Check(obj) PyUnicode_Check(obj) #define __Pyx_PyBaseString_CheckExact(obj) PyUnicode_CheckExact(obj) #else #define __Pyx_PyBaseString_Check(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj) || \ PyString_Check(obj) || PyUnicode_Check(obj)) #define __Pyx_PyBaseString_CheckExact(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj)) #endif #if PY_VERSION_HEX < 0x02060000 #define PySet_Check(obj) PyObject_TypeCheck(obj, &PySet_Type) #define PyFrozenSet_Check(obj) PyObject_TypeCheck(obj, &PyFrozenSet_Type) #endif #ifndef PySet_CheckExact #define PySet_CheckExact(obj) (Py_TYPE(obj) == &PySet_Type) #endif #define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type) #if PY_MAJOR_VERSION >= 3 #define PyIntObject PyLongObject #define PyInt_Type PyLong_Type #define PyInt_Check(op) PyLong_Check(op) #define PyInt_CheckExact(op) PyLong_CheckExact(op) #define PyInt_FromString PyLong_FromString #define PyInt_FromUnicode PyLong_FromUnicode #define PyInt_FromLong PyLong_FromLong #define PyInt_FromSize_t PyLong_FromSize_t #define PyInt_FromSsize_t PyLong_FromSsize_t #define PyInt_AsLong PyLong_AsLong #define PyInt_AS_LONG PyLong_AS_LONG #define PyInt_AsSsize_t PyLong_AsSsize_t #define PyInt_AsUnsignedLongMask PyLong_AsUnsignedLongMask #define PyInt_AsUnsignedLongLongMask PyLong_AsUnsignedLongLongMask #define PyNumber_Int PyNumber_Long #endif #if PY_MAJOR_VERSION >= 3 #define PyBoolObject PyLongObject #endif #if PY_VERSION_HEX < 0x030200A4 typedef long Py_hash_t; #define __Pyx_PyInt_FromHash_t PyInt_FromLong #define __Pyx_PyInt_AsHash_t PyInt_AsLong #else #define __Pyx_PyInt_FromHash_t PyInt_FromSsize_t #define __Pyx_PyInt_AsHash_t PyInt_AsSsize_t #endif #if (PY_MAJOR_VERSION < 3) || (PY_VERSION_HEX >= 0x03010300) #define __Pyx_PySequence_GetSlice(obj, a, b) PySequence_GetSlice(obj, a, b) #define __Pyx_PySequence_SetSlice(obj, a, b, value) PySequence_SetSlice(obj, a, b, value) #define __Pyx_PySequence_DelSlice(obj, a, b) PySequence_DelSlice(obj, a, b) #else #define __Pyx_PySequence_GetSlice(obj, a, b) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), (PyObject*)0) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_GetSlice(obj, a, b)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object is unsliceable", (obj)->ob_type->tp_name), (PyObject*)0))) #define __Pyx_PySequence_SetSlice(obj, a, b, value) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), -1) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_SetSlice(obj, a, b, value)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object doesn't support slice assignment", (obj)->ob_type->tp_name), -1))) #define __Pyx_PySequence_DelSlice(obj, a, b) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), -1) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_DelSlice(obj, a, b)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object doesn't support slice deletion", (obj)->ob_type->tp_name), -1))) #endif #if PY_MAJOR_VERSION >= 3 #define PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : PyInstanceMethod_New(func)) #endif #if PY_VERSION_HEX < 0x02050000 #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),((char *)(n))) #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),((char *)(n)),(a)) #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),((char *)(n))) #else #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),(n)) #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),(n),(a)) #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),(n)) #endif #if PY_VERSION_HEX < 0x02050000 #define __Pyx_NAMESTR(n) ((char *)(n)) #define __Pyx_DOCSTR(n) ((char *)(n)) #else #define __Pyx_NAMESTR(n) (n) #define __Pyx_DOCSTR(n) (n) #endif #ifndef CYTHON_INLINE #if defined(__GNUC__) #define CYTHON_INLINE __inline__ #elif defined(_MSC_VER) #define CYTHON_INLINE __inline #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L #define CYTHON_INLINE inline #else #define CYTHON_INLINE #endif #endif #ifndef CYTHON_RESTRICT #if defined(__GNUC__) #define CYTHON_RESTRICT __restrict__ #elif defined(_MSC_VER) && _MSC_VER >= 1400 #define CYTHON_RESTRICT __restrict #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L #define CYTHON_RESTRICT restrict #else #define CYTHON_RESTRICT #endif #endif #ifdef NAN #define __PYX_NAN() ((float) NAN) #else static CYTHON_INLINE float __PYX_NAN() { /* Initialize NaN. The sign is irrelevant, an exponent with all bits 1 and a nonzero mantissa means NaN. If the first bit in the mantissa is 1, it is a quiet NaN. */ float value; memset(&value, 0xFF, sizeof(value)); return value; } #endif #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyNumber_Divide(x,y) PyNumber_TrueDivide(x,y) #define __Pyx_PyNumber_InPlaceDivide(x,y) PyNumber_InPlaceTrueDivide(x,y) #else #define __Pyx_PyNumber_Divide(x,y) PyNumber_Divide(x,y) #define __Pyx_PyNumber_InPlaceDivide(x,y) PyNumber_InPlaceDivide(x,y) #endif #ifndef __PYX_EXTERN_C #ifdef __cplusplus #define __PYX_EXTERN_C extern "C" #else #define __PYX_EXTERN_C extern #endif #endif #if defined(WIN32) || defined(MS_WINDOWS) #define _USE_MATH_DEFINES #endif #include #define __PYX_HAVE__healpy___query_disc #define __PYX_HAVE_API__healpy___query_disc #include "string.h" #include "stdio.h" #include "stdlib.h" #include "numpy/arrayobject.h" #include "numpy/ufuncobject.h" #include #include "ios" #include "new" #include "stdexcept" #include "typeinfo" #include "stddef.h" #include "datatypes.h" #include "xcomplex.h" #include "arr.h" #include "rangeset.h" #include "vec3.h" #include "pointing.h" #include "healpix_base.h" #include "healpix_map.h" #include "alm.h" #ifdef _OPENMP #include #endif /* _OPENMP */ #ifdef PYREX_WITHOUT_ASSERTIONS #define CYTHON_WITHOUT_ASSERTIONS #endif #ifndef CYTHON_UNUSED # if defined(__GNUC__) # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)) # define CYTHON_UNUSED __attribute__ ((__unused__)) # else # define CYTHON_UNUSED # endif # elif defined(__ICC) || (defined(__INTEL_COMPILER) && !defined(_MSC_VER)) # define CYTHON_UNUSED __attribute__ ((__unused__)) # else # define CYTHON_UNUSED # endif #endif typedef struct {PyObject **p; char *s; const Py_ssize_t n; const char* encoding; const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry; /*proto*/ #define __PYX_DEFAULT_STRING_ENCODING_IS_ASCII 0 #define __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT 0 #define __PYX_DEFAULT_STRING_ENCODING "" #define __Pyx_PyObject_FromString __Pyx_PyBytes_FromString #define __Pyx_PyObject_FromStringAndSize __Pyx_PyBytes_FromStringAndSize #define __Pyx_fits_Py_ssize_t(v, type, is_signed) ( \ (sizeof(type) < sizeof(Py_ssize_t)) || \ (sizeof(type) > sizeof(Py_ssize_t) && \ likely(v < (type)PY_SSIZE_T_MAX || \ v == (type)PY_SSIZE_T_MAX) && \ (!is_signed || likely(v > (type)PY_SSIZE_T_MIN || \ v == (type)PY_SSIZE_T_MIN))) || \ (sizeof(type) == sizeof(Py_ssize_t) && \ (is_signed || likely(v < (type)PY_SSIZE_T_MAX || \ v == (type)PY_SSIZE_T_MAX))) ) static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject*); static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length); #define __Pyx_PyByteArray_FromString(s) PyByteArray_FromStringAndSize((const char*)s, strlen((const char*)s)) #define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l) #define __Pyx_PyBytes_FromString PyBytes_FromString #define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(char*); #if PY_MAJOR_VERSION < 3 #define __Pyx_PyStr_FromString __Pyx_PyBytes_FromString #define __Pyx_PyStr_FromStringAndSize __Pyx_PyBytes_FromStringAndSize #else #define __Pyx_PyStr_FromString __Pyx_PyUnicode_FromString #define __Pyx_PyStr_FromStringAndSize __Pyx_PyUnicode_FromStringAndSize #endif #define __Pyx_PyObject_AsSString(s) ((signed char*) __Pyx_PyObject_AsString(s)) #define __Pyx_PyObject_AsUString(s) ((unsigned char*) __Pyx_PyObject_AsString(s)) #define __Pyx_PyObject_FromUString(s) __Pyx_PyObject_FromString((char*)s) #define __Pyx_PyBytes_FromUString(s) __Pyx_PyBytes_FromString((char*)s) #define __Pyx_PyByteArray_FromUString(s) __Pyx_PyByteArray_FromString((char*)s) #define __Pyx_PyStr_FromUString(s) __Pyx_PyStr_FromString((char*)s) #define __Pyx_PyUnicode_FromUString(s) __Pyx_PyUnicode_FromString((char*)s) #if PY_MAJOR_VERSION < 3 static CYTHON_INLINE size_t __Pyx_Py_UNICODE_strlen(const Py_UNICODE *u) { const Py_UNICODE *u_end = u; while (*u_end++) ; return u_end - u - 1; } #else #define __Pyx_Py_UNICODE_strlen Py_UNICODE_strlen #endif #define __Pyx_PyUnicode_FromUnicode(u) PyUnicode_FromUnicode(u, __Pyx_Py_UNICODE_strlen(u)) #define __Pyx_PyUnicode_FromUnicodeAndLength PyUnicode_FromUnicode #define __Pyx_PyUnicode_AsUnicode PyUnicode_AsUnicode #define __Pyx_Owned_Py_None(b) (Py_INCREF(Py_None), Py_None) #define __Pyx_PyBool_FromLong(b) ((b) ? (Py_INCREF(Py_True), Py_True) : (Py_INCREF(Py_False), Py_False)) static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*); static CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x); static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*); static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t); #if CYTHON_COMPILING_IN_CPYTHON #define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x)) #else #define __pyx_PyFloat_AsDouble(x) PyFloat_AsDouble(x) #endif #define __pyx_PyFloat_AsFloat(x) ((float) __pyx_PyFloat_AsDouble(x)) #if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII static int __Pyx_sys_getdefaultencoding_not_ascii; static int __Pyx_init_sys_getdefaultencoding_params(void) { PyObject* sys = NULL; PyObject* default_encoding = NULL; PyObject* ascii_chars_u = NULL; PyObject* ascii_chars_b = NULL; sys = PyImport_ImportModule("sys"); if (sys == NULL) goto bad; default_encoding = PyObject_CallMethod(sys, (char*) (const char*) "getdefaultencoding", NULL); if (default_encoding == NULL) goto bad; if (strcmp(PyBytes_AsString(default_encoding), "ascii") == 0) { __Pyx_sys_getdefaultencoding_not_ascii = 0; } else { const char* default_encoding_c = PyBytes_AS_STRING(default_encoding); char ascii_chars[128]; int c; for (c = 0; c < 128; c++) { ascii_chars[c] = c; } __Pyx_sys_getdefaultencoding_not_ascii = 1; ascii_chars_u = PyUnicode_DecodeASCII(ascii_chars, 128, NULL); if (ascii_chars_u == NULL) goto bad; ascii_chars_b = PyUnicode_AsEncodedString(ascii_chars_u, default_encoding_c, NULL); if (ascii_chars_b == NULL || strncmp(ascii_chars, PyBytes_AS_STRING(ascii_chars_b), 128) != 0) { PyErr_Format( PyExc_ValueError, "This module compiled with c_string_encoding=ascii, but default encoding '%.200s' is not a superset of ascii.", default_encoding_c); goto bad; } } Py_XDECREF(sys); Py_XDECREF(default_encoding); Py_XDECREF(ascii_chars_u); Py_XDECREF(ascii_chars_b); return 0; bad: Py_XDECREF(sys); Py_XDECREF(default_encoding); Py_XDECREF(ascii_chars_u); Py_XDECREF(ascii_chars_b); return -1; } #endif #if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT && PY_MAJOR_VERSION >= 3 #define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_DecodeUTF8(c_str, size, NULL) #else #define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_Decode(c_str, size, __PYX_DEFAULT_STRING_ENCODING, NULL) #if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT static char* __PYX_DEFAULT_STRING_ENCODING; static int __Pyx_init_sys_getdefaultencoding_params(void) { PyObject* sys = NULL; PyObject* default_encoding = NULL; char* default_encoding_c; sys = PyImport_ImportModule("sys"); if (sys == NULL) goto bad; default_encoding = PyObject_CallMethod(sys, (char*) (const char*) "getdefaultencoding", NULL); if (default_encoding == NULL) goto bad; default_encoding_c = PyBytes_AS_STRING(default_encoding); __PYX_DEFAULT_STRING_ENCODING = (char*) malloc(strlen(default_encoding_c)); strcpy(__PYX_DEFAULT_STRING_ENCODING, default_encoding_c); Py_DECREF(sys); Py_DECREF(default_encoding); return 0; bad: Py_XDECREF(sys); Py_XDECREF(default_encoding); return -1; } #endif #endif #ifdef __GNUC__ /* Test for GCC > 2.95 */ #if __GNUC__ > 2 || (__GNUC__ == 2 && (__GNUC_MINOR__ > 95)) #define likely(x) __builtin_expect(!!(x), 1) #define unlikely(x) __builtin_expect(!!(x), 0) #else /* __GNUC__ > 2 ... */ #define likely(x) (x) #define unlikely(x) (x) #endif /* __GNUC__ > 2 ... */ #else /* __GNUC__ */ #define likely(x) (x) #define unlikely(x) (x) #endif /* __GNUC__ */ static PyObject *__pyx_m; static PyObject *__pyx_d; static PyObject *__pyx_b; static PyObject *__pyx_empty_tuple; static PyObject *__pyx_empty_bytes; static int __pyx_lineno; static int __pyx_clineno = 0; static const char * __pyx_cfilenm= __FILE__; static const char *__pyx_filename; #if !defined(CYTHON_CCOMPLEX) #if defined(__cplusplus) #define CYTHON_CCOMPLEX 1 #elif defined(_Complex_I) #define CYTHON_CCOMPLEX 1 #else #define CYTHON_CCOMPLEX 0 #endif #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus #include #else #include #endif #endif #if CYTHON_CCOMPLEX && !defined(__cplusplus) && defined(__sun__) && defined(__GNUC__) #undef _Complex_I #define _Complex_I 1.0fj #endif static const char *__pyx_f[] = { "_query_disc.pyx", "_common.pxd", "__init__.pxd", "type.pxd", }; #define IS_UNSIGNED(type) (((type) -1) > 0) struct __Pyx_StructField_; #define __PYX_BUF_FLAGS_PACKED_STRUCT (1 << 0) typedef struct { const char* name; /* for error messages only */ struct __Pyx_StructField_* fields; size_t size; /* sizeof(type) */ size_t arraysize[8]; /* length of array in each dimension */ int ndim; char typegroup; /* _R_eal, _C_omplex, Signed _I_nt, _U_nsigned int, _S_truct, _P_ointer, _O_bject, c_H_ar */ char is_unsigned; int flags; } __Pyx_TypeInfo; typedef struct __Pyx_StructField_ { __Pyx_TypeInfo* type; const char* name; size_t offset; } __Pyx_StructField; typedef struct { __Pyx_StructField* field; size_t parent_offset; } __Pyx_BufFmt_StackElem; typedef struct { __Pyx_StructField root; __Pyx_BufFmt_StackElem* head; size_t fmt_offset; size_t new_count, enc_count; size_t struct_alignment; int is_complex; char enc_type; char new_packmode; char enc_packmode; char is_valid_array; } __Pyx_BufFmt_Context; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":723 * # in Cython to enable them only on the right systems. * * ctypedef npy_int8 int8_t # <<<<<<<<<<<<<< * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t */ typedef npy_int8 __pyx_t_5numpy_int8_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":724 * * ctypedef npy_int8 int8_t * ctypedef npy_int16 int16_t # <<<<<<<<<<<<<< * ctypedef npy_int32 int32_t * ctypedef npy_int64 int64_t */ typedef npy_int16 __pyx_t_5numpy_int16_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":725 * ctypedef npy_int8 int8_t * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t # <<<<<<<<<<<<<< * ctypedef npy_int64 int64_t * #ctypedef npy_int96 int96_t */ typedef npy_int32 __pyx_t_5numpy_int32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":726 * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t * ctypedef npy_int64 int64_t # <<<<<<<<<<<<<< * #ctypedef npy_int96 int96_t * #ctypedef npy_int128 int128_t */ typedef npy_int64 __pyx_t_5numpy_int64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":730 * #ctypedef npy_int128 int128_t * * ctypedef npy_uint8 uint8_t # <<<<<<<<<<<<<< * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t */ typedef npy_uint8 __pyx_t_5numpy_uint8_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":731 * * ctypedef npy_uint8 uint8_t * ctypedef npy_uint16 uint16_t # <<<<<<<<<<<<<< * ctypedef npy_uint32 uint32_t * ctypedef npy_uint64 uint64_t */ typedef npy_uint16 __pyx_t_5numpy_uint16_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":732 * ctypedef npy_uint8 uint8_t * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t # <<<<<<<<<<<<<< * ctypedef npy_uint64 uint64_t * #ctypedef npy_uint96 uint96_t */ typedef npy_uint32 __pyx_t_5numpy_uint32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":733 * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t * ctypedef npy_uint64 uint64_t # <<<<<<<<<<<<<< * #ctypedef npy_uint96 uint96_t * #ctypedef npy_uint128 uint128_t */ typedef npy_uint64 __pyx_t_5numpy_uint64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":737 * #ctypedef npy_uint128 uint128_t * * ctypedef npy_float32 float32_t # <<<<<<<<<<<<<< * ctypedef npy_float64 float64_t * #ctypedef npy_float80 float80_t */ typedef npy_float32 __pyx_t_5numpy_float32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":738 * * ctypedef npy_float32 float32_t * ctypedef npy_float64 float64_t # <<<<<<<<<<<<<< * #ctypedef npy_float80 float80_t * #ctypedef npy_float128 float128_t */ typedef npy_float64 __pyx_t_5numpy_float64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":747 * # The int types are mapped a bit surprising -- * # numpy.int corresponds to 'l' and numpy.long to 'q' * ctypedef npy_long int_t # <<<<<<<<<<<<<< * ctypedef npy_longlong long_t * ctypedef npy_longlong longlong_t */ typedef npy_long __pyx_t_5numpy_int_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":748 * # numpy.int corresponds to 'l' and numpy.long to 'q' * ctypedef npy_long int_t * ctypedef npy_longlong long_t # <<<<<<<<<<<<<< * ctypedef npy_longlong longlong_t * */ typedef npy_longlong __pyx_t_5numpy_long_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":749 * ctypedef npy_long int_t * ctypedef npy_longlong long_t * ctypedef npy_longlong longlong_t # <<<<<<<<<<<<<< * * ctypedef npy_ulong uint_t */ typedef npy_longlong __pyx_t_5numpy_longlong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":751 * ctypedef npy_longlong longlong_t * * ctypedef npy_ulong uint_t # <<<<<<<<<<<<<< * ctypedef npy_ulonglong ulong_t * ctypedef npy_ulonglong ulonglong_t */ typedef npy_ulong __pyx_t_5numpy_uint_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":752 * * ctypedef npy_ulong uint_t * ctypedef npy_ulonglong ulong_t # <<<<<<<<<<<<<< * ctypedef npy_ulonglong ulonglong_t * */ typedef npy_ulonglong __pyx_t_5numpy_ulong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":753 * ctypedef npy_ulong uint_t * ctypedef npy_ulonglong ulong_t * ctypedef npy_ulonglong ulonglong_t # <<<<<<<<<<<<<< * * ctypedef npy_intp intp_t */ typedef npy_ulonglong __pyx_t_5numpy_ulonglong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":755 * ctypedef npy_ulonglong ulonglong_t * * ctypedef npy_intp intp_t # <<<<<<<<<<<<<< * ctypedef npy_uintp uintp_t * */ typedef npy_intp __pyx_t_5numpy_intp_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":756 * * ctypedef npy_intp intp_t * ctypedef npy_uintp uintp_t # <<<<<<<<<<<<<< * * ctypedef npy_double float_t */ typedef npy_uintp __pyx_t_5numpy_uintp_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":758 * ctypedef npy_uintp uintp_t * * ctypedef npy_double float_t # <<<<<<<<<<<<<< * ctypedef npy_double double_t * ctypedef npy_longdouble longdouble_t */ typedef npy_double __pyx_t_5numpy_float_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":759 * * ctypedef npy_double float_t * ctypedef npy_double double_t # <<<<<<<<<<<<<< * ctypedef npy_longdouble longdouble_t * */ typedef npy_double __pyx_t_5numpy_double_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":760 * ctypedef npy_double float_t * ctypedef npy_double double_t * ctypedef npy_longdouble longdouble_t # <<<<<<<<<<<<<< * * ctypedef npy_cfloat cfloat_t */ typedef npy_longdouble __pyx_t_5numpy_longdouble_t; /* "_common.pxd":6 * from libcpp.vector cimport vector * * ctypedef unsigned size_t # <<<<<<<<<<<<<< * ctypedef size_t tsize * */ typedef unsigned int __pyx_t_7_common_size_t; /* "_common.pxd":7 * * ctypedef unsigned size_t * ctypedef size_t tsize # <<<<<<<<<<<<<< * * cdef extern from "stddef.h": */ typedef size_t __pyx_t_7_common_tsize; /* "_common.pxd":11 * cdef extern from "stddef.h": * ctypedef long ptrdiff_t * ctypedef ptrdiff_t tdiff # <<<<<<<<<<<<<< * * cdef extern from "datatypes.h": */ typedef ptrdiff_t __pyx_t_7_common_tdiff; #if CYTHON_CCOMPLEX #ifdef __cplusplus typedef ::std::complex< float > __pyx_t_float_complex; #else typedef float _Complex __pyx_t_float_complex; #endif #else typedef struct { float real, imag; } __pyx_t_float_complex; #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus typedef ::std::complex< double > __pyx_t_double_complex; #else typedef double _Complex __pyx_t_double_complex; #endif #else typedef struct { double real, imag; } __pyx_t_double_complex; #endif /*--- Type declarations ---*/ /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":762 * ctypedef npy_longdouble longdouble_t * * ctypedef npy_cfloat cfloat_t # <<<<<<<<<<<<<< * ctypedef npy_cdouble cdouble_t * ctypedef npy_clongdouble clongdouble_t */ typedef npy_cfloat __pyx_t_5numpy_cfloat_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":763 * * ctypedef npy_cfloat cfloat_t * ctypedef npy_cdouble cdouble_t # <<<<<<<<<<<<<< * ctypedef npy_clongdouble clongdouble_t * */ typedef npy_cdouble __pyx_t_5numpy_cdouble_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":764 * ctypedef npy_cfloat cfloat_t * ctypedef npy_cdouble cdouble_t * ctypedef npy_clongdouble clongdouble_t # <<<<<<<<<<<<<< * * ctypedef npy_cdouble complex_t */ typedef npy_clongdouble __pyx_t_5numpy_clongdouble_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":766 * ctypedef npy_clongdouble clongdouble_t * * ctypedef npy_cdouble complex_t # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew1(a): */ typedef npy_cdouble __pyx_t_5numpy_complex_t; struct __pyx_opt_args_6healpy_11_query_disc_pixset_to_array; /* "healpy/src/_query_disc.pyx":320 * @cython.boundscheck(False) * @cython.wraparound(False) * cdef pixset_to_array(rangeset[int64] &pixset, buff=None): # <<<<<<<<<<<<<< * cdef int64 i, n * n = pixset.nval() */ struct __pyx_opt_args_6healpy_11_query_disc_pixset_to_array { int __pyx_n; PyObject *buff; }; #ifndef CYTHON_REFNANNY #define CYTHON_REFNANNY 0 #endif #if CYTHON_REFNANNY typedef struct { void (*INCREF)(void*, PyObject*, int); void (*DECREF)(void*, PyObject*, int); void (*GOTREF)(void*, PyObject*, int); void (*GIVEREF)(void*, PyObject*, int); void* (*SetupContext)(const char*, int, const char*); void (*FinishContext)(void**); } __Pyx_RefNannyAPIStruct; static __Pyx_RefNannyAPIStruct *__Pyx_RefNanny = NULL; static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname); /*proto*/ #define __Pyx_RefNannyDeclarations void *__pyx_refnanny = NULL; #ifdef WITH_THREAD #define __Pyx_RefNannySetupContext(name, acquire_gil) \ if (acquire_gil) { \ PyGILState_STATE __pyx_gilstate_save = PyGILState_Ensure(); \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__); \ PyGILState_Release(__pyx_gilstate_save); \ } else { \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__); \ } #else #define __Pyx_RefNannySetupContext(name, acquire_gil) \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__) #endif #define __Pyx_RefNannyFinishContext() \ __Pyx_RefNanny->FinishContext(&__pyx_refnanny) #define __Pyx_INCREF(r) __Pyx_RefNanny->INCREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_DECREF(r) __Pyx_RefNanny->DECREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_GOTREF(r) __Pyx_RefNanny->GOTREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_GIVEREF(r) __Pyx_RefNanny->GIVEREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_XINCREF(r) do { if((r) != NULL) {__Pyx_INCREF(r); }} while(0) #define __Pyx_XDECREF(r) do { if((r) != NULL) {__Pyx_DECREF(r); }} while(0) #define __Pyx_XGOTREF(r) do { if((r) != NULL) {__Pyx_GOTREF(r); }} while(0) #define __Pyx_XGIVEREF(r) do { if((r) != NULL) {__Pyx_GIVEREF(r);}} while(0) #else #define __Pyx_RefNannyDeclarations #define __Pyx_RefNannySetupContext(name, acquire_gil) #define __Pyx_RefNannyFinishContext() #define __Pyx_INCREF(r) Py_INCREF(r) #define __Pyx_DECREF(r) Py_DECREF(r) #define __Pyx_GOTREF(r) #define __Pyx_GIVEREF(r) #define __Pyx_XINCREF(r) Py_XINCREF(r) #define __Pyx_XDECREF(r) Py_XDECREF(r) #define __Pyx_XGOTREF(r) #define __Pyx_XGIVEREF(r) #endif /* CYTHON_REFNANNY */ #define __Pyx_XDECREF_SET(r, v) do { \ PyObject *tmp = (PyObject *) r; \ r = v; __Pyx_XDECREF(tmp); \ } while (0) #define __Pyx_DECREF_SET(r, v) do { \ PyObject *tmp = (PyObject *) r; \ r = v; __Pyx_DECREF(tmp); \ } while (0) #define __Pyx_CLEAR(r) do { PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);} while(0) #define __Pyx_XCLEAR(r) do { if((r) != NULL) {PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);}} while(0) #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_GetAttrStr(PyObject* obj, PyObject* attr_name) { PyTypeObject* tp = Py_TYPE(obj); if (likely(tp->tp_getattro)) return tp->tp_getattro(obj, attr_name); #if PY_MAJOR_VERSION < 3 if (likely(tp->tp_getattr)) return tp->tp_getattr(obj, PyString_AS_STRING(attr_name)); #endif return PyObject_GetAttr(obj, attr_name); } #else #define __Pyx_PyObject_GetAttrStr(o,n) PyObject_GetAttr(o,n) #endif static PyObject *__Pyx_GetBuiltinName(PyObject *name); /*proto*/ static void __Pyx_RaiseArgtupleInvalid(const char* func_name, int exact, Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found); /*proto*/ static void __Pyx_RaiseDoubleKeywordsError(const char* func_name, PyObject* kw_name); /*proto*/ static int __Pyx_ParseOptionalKeywords(PyObject *kwds, PyObject **argnames[], \ PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args, \ const char* function_name); /*proto*/ static CYTHON_INLINE int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed, const char *name, int exact); /*proto*/ static CYTHON_INLINE int __Pyx_GetBufferAndValidate(Py_buffer* buf, PyObject* obj, __Pyx_TypeInfo* dtype, int flags, int nd, int cast, __Pyx_BufFmt_StackElem* stack); static CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info); #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw); /*proto*/ #else #define __Pyx_PyObject_Call(func, arg, kw) PyObject_Call(func, arg, kw) #endif static CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb); /*proto*/ static CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb); /*proto*/ static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause); /*proto*/ #define __Pyx_GetItemInt(o, i, type, is_signed, to_py_func, is_list, wraparound, boundscheck) \ (__Pyx_fits_Py_ssize_t(i, type, is_signed) ? \ __Pyx_GetItemInt_Fast(o, (Py_ssize_t)i, is_list, wraparound, boundscheck) : \ (is_list ? (PyErr_SetString(PyExc_IndexError, "list index out of range"), (PyObject*)NULL) : \ __Pyx_GetItemInt_Generic(o, to_py_func(i)))) #define __Pyx_GetItemInt_List(o, i, type, is_signed, to_py_func, is_list, wraparound, boundscheck) \ (__Pyx_fits_Py_ssize_t(i, type, is_signed) ? \ __Pyx_GetItemInt_List_Fast(o, (Py_ssize_t)i, wraparound, boundscheck) : \ (PyErr_SetString(PyExc_IndexError, "list index out of range"), (PyObject*)NULL)) static CYTHON_INLINE PyObject *__Pyx_GetItemInt_List_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck); #define __Pyx_GetItemInt_Tuple(o, i, type, is_signed, to_py_func, is_list, wraparound, boundscheck) \ (__Pyx_fits_Py_ssize_t(i, type, is_signed) ? \ __Pyx_GetItemInt_Tuple_Fast(o, (Py_ssize_t)i, wraparound, boundscheck) : \ (PyErr_SetString(PyExc_IndexError, "tuple index out of range"), (PyObject*)NULL)) static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Tuple_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck); static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Generic(PyObject *o, PyObject* j); static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Fast(PyObject *o, Py_ssize_t i, int is_list, int wraparound, int boundscheck); static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name); /*proto*/ static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type); /*proto*/ static void __Pyx_RaiseBufferIndexError(int axis); /*proto*/ #define __Pyx_BufPtrStrided2d(type, buf, i0, s0, i1, s1) (type)((char*)buf + i0 * s0 + i1 * s1) #define __Pyx_BufPtrStrided3d(type, buf, i0, s0, i1, s1, i2, s2) (type)((char*)buf + i0 * s0 + i1 * s1 + i2 * s2) static void __Pyx_RaiseBufferFallbackError(void); /*proto*/ static CYTHON_INLINE PyObject* __Pyx_PyObject_GetSlice( PyObject* obj, Py_ssize_t cstart, Py_ssize_t cstop, PyObject** py_start, PyObject** py_stop, PyObject** py_slice, int has_cstart, int has_cstop, int wraparound); #define __Pyx_BufPtrStrided1d(type, buf, i0, s0) (type)((char*)buf + i0 * s0) #define __Pyx_BufPtrCContig1d(type, buf, i0, s0) ((type)buf + i0) static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected); static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index); static CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void); typedef struct { Py_ssize_t shape, strides, suboffsets; } __Pyx_Buf_DimInfo; typedef struct { size_t refcount; Py_buffer pybuffer; } __Pyx_Buffer; typedef struct { __Pyx_Buffer *rcbuffer; char *data; __Pyx_Buf_DimInfo diminfo[8]; } __Pyx_LocalBuf_ND; #if PY_MAJOR_VERSION < 3 static int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags); static void __Pyx_ReleaseBuffer(Py_buffer *view); #else #define __Pyx_GetBuffer PyObject_GetBuffer #define __Pyx_ReleaseBuffer PyBuffer_Release #endif static Py_ssize_t __Pyx_zeros[] = {0, 0, 0, 0, 0, 0, 0, 0}; static Py_ssize_t __Pyx_minusones[] = {-1, -1, -1, -1, -1, -1, -1, -1}; static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level); /*proto*/ static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *); static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value); static CYTHON_INLINE int64 __Pyx_PyInt_As_int64(PyObject *); static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *); static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int64(int64 value); #if CYTHON_CCOMPLEX #ifdef __cplusplus #define __Pyx_CREAL(z) ((z).real()) #define __Pyx_CIMAG(z) ((z).imag()) #else #define __Pyx_CREAL(z) (__real__(z)) #define __Pyx_CIMAG(z) (__imag__(z)) #endif #else #define __Pyx_CREAL(z) ((z).real) #define __Pyx_CIMAG(z) ((z).imag) #endif #if (defined(_WIN32) || defined(__clang__)) && defined(__cplusplus) && CYTHON_CCOMPLEX #define __Pyx_SET_CREAL(z,x) ((z).real(x)) #define __Pyx_SET_CIMAG(z,y) ((z).imag(y)) #else #define __Pyx_SET_CREAL(z,x) __Pyx_CREAL(z) = (x) #define __Pyx_SET_CIMAG(z,y) __Pyx_CIMAG(z) = (y) #endif static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float, float); #if CYTHON_CCOMPLEX #define __Pyx_c_eqf(a, b) ((a)==(b)) #define __Pyx_c_sumf(a, b) ((a)+(b)) #define __Pyx_c_difff(a, b) ((a)-(b)) #define __Pyx_c_prodf(a, b) ((a)*(b)) #define __Pyx_c_quotf(a, b) ((a)/(b)) #define __Pyx_c_negf(a) (-(a)) #ifdef __cplusplus #define __Pyx_c_is_zerof(z) ((z)==(float)0) #define __Pyx_c_conjf(z) (::std::conj(z)) #if 1 #define __Pyx_c_absf(z) (::std::abs(z)) #define __Pyx_c_powf(a, b) (::std::pow(a, b)) #endif #else #define __Pyx_c_is_zerof(z) ((z)==0) #define __Pyx_c_conjf(z) (conjf(z)) #if 1 #define __Pyx_c_absf(z) (cabsf(z)) #define __Pyx_c_powf(a, b) (cpowf(a, b)) #endif #endif #else static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex); static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex); #if 1 static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex, __pyx_t_float_complex); #endif #endif static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double, double); #if CYTHON_CCOMPLEX #define __Pyx_c_eq(a, b) ((a)==(b)) #define __Pyx_c_sum(a, b) ((a)+(b)) #define __Pyx_c_diff(a, b) ((a)-(b)) #define __Pyx_c_prod(a, b) ((a)*(b)) #define __Pyx_c_quot(a, b) ((a)/(b)) #define __Pyx_c_neg(a) (-(a)) #ifdef __cplusplus #define __Pyx_c_is_zero(z) ((z)==(double)0) #define __Pyx_c_conj(z) (::std::conj(z)) #if 1 #define __Pyx_c_abs(z) (::std::abs(z)) #define __Pyx_c_pow(a, b) (::std::pow(a, b)) #endif #else #define __Pyx_c_is_zero(z) ((z)==0) #define __Pyx_c_conj(z) (conj(z)) #if 1 #define __Pyx_c_abs(z) (cabs(z)) #define __Pyx_c_pow(a, b) (cpow(a, b)) #endif #endif #else static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex); static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex); #if 1 static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex, __pyx_t_double_complex); #endif #endif static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value); static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *); static int __Pyx_check_binary_version(void); #if !defined(__Pyx_PyIdentifier_FromString) #if PY_MAJOR_VERSION < 3 #define __Pyx_PyIdentifier_FromString(s) PyString_FromString(s) #else #define __Pyx_PyIdentifier_FromString(s) PyUnicode_FromString(s) #endif #endif static PyObject *__Pyx_ImportModule(const char *name); /*proto*/ static PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, size_t size, int strict); /*proto*/ typedef struct { int code_line; PyCodeObject* code_object; } __Pyx_CodeObjectCacheEntry; struct __Pyx_CodeObjectCache { int count; int max_count; __Pyx_CodeObjectCacheEntry* entries; }; static struct __Pyx_CodeObjectCache __pyx_code_cache = {0,0,NULL}; static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line); static PyCodeObject *__pyx_find_code_object(int code_line); static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object); static void __Pyx_AddTraceback(const char *funcname, int c_line, int py_line, const char *filename); /*proto*/ static int __Pyx_InitStrings(__Pyx_StringTabEntry *t); /*proto*/ /* Module declarations from 'cpython.buffer' */ /* Module declarations from 'cpython.ref' */ /* Module declarations from 'libc.string' */ /* Module declarations from 'libc.stdio' */ /* Module declarations from 'cpython.object' */ /* Module declarations from '__builtin__' */ /* Module declarations from 'cpython.type' */ static PyTypeObject *__pyx_ptype_7cpython_4type_type = 0; /* Module declarations from 'libc.stdlib' */ /* Module declarations from 'numpy' */ /* Module declarations from 'numpy' */ static PyTypeObject *__pyx_ptype_5numpy_dtype = 0; static PyTypeObject *__pyx_ptype_5numpy_flatiter = 0; static PyTypeObject *__pyx_ptype_5numpy_broadcast = 0; static PyTypeObject *__pyx_ptype_5numpy_ndarray = 0; static PyTypeObject *__pyx_ptype_5numpy_ufunc = 0; static CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *, char *, char *, int *); /*proto*/ /* Module declarations from 'libcpp' */ /* Module declarations from 'libcpp.vector' */ /* Module declarations from 'cython' */ /* Module declarations from '_common' */ /* Module declarations from 'healpy._query_disc' */ static PyObject *__pyx_f_6healpy_11_query_disc_pixset_to_array(rangeset &, struct __pyx_opt_args_6healpy_11_query_disc_pixset_to_array *__pyx_optional_args); /*proto*/ static bool __pyx_f_6healpy_11_query_disc_isnsideok(int); /*proto*/ static __Pyx_TypeInfo __Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t = { "int64_t", NULL, sizeof(__pyx_t_5numpy_int64_t), { 0 }, 0, IS_UNSIGNED(__pyx_t_5numpy_int64_t) ? 'U' : 'I', IS_UNSIGNED(__pyx_t_5numpy_int64_t), 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo_double = { "double", NULL, sizeof(double), { 0 }, 0, 'R', 0, 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo_nn___pyx_t_5numpy_float64_t = { "float64_t", NULL, sizeof(__pyx_t_5numpy_float64_t), { 0 }, 0, 'R', 0, 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo___pyx_t_double_complex = { "double complex", NULL, sizeof(__pyx_t_double_complex), { 0 }, 0, 'C', 0, 0 }; #define __Pyx_MODULE_NAME "healpy._query_disc" int __pyx_module_is_main_healpy___query_disc = 0; /* Implementation of 'healpy._query_disc' */ static PyObject *__pyx_builtin_ValueError; static PyObject *__pyx_builtin_range; static PyObject *__pyx_builtin_RuntimeError; static PyObject *__pyx_pf_6healpy_11_query_disc_query_disc(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_vec, PyObject *__pyx_v_radius, PyObject *__pyx_v_inclusive, PyObject *__pyx_v_fact, PyObject *__pyx_v_nest, PyArrayObject *__pyx_v_buff); /* proto */ static PyObject *__pyx_pf_6healpy_11_query_disc_2query_polygon(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_vertices, PyObject *__pyx_v_inclusive, PyObject *__pyx_v_fact, PyObject *__pyx_v_nest, PyArrayObject *__pyx_v_buff); /* proto */ static PyObject *__pyx_pf_6healpy_11_query_disc_4query_strip(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_theta1, PyObject *__pyx_v_theta2, PyObject *__pyx_v_inclusive, PyObject *__pyx_v_nest, PyArrayObject *__pyx_v_buff); /* proto */ static PyObject *__pyx_pf_6healpy_11_query_disc_6_boundaries_single(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_pix, PyObject *__pyx_v_step, PyObject *__pyx_v_nest); /* proto */ static PyObject *__pyx_pf_6healpy_11_query_disc_8_boundaries_multiple(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_pix, PyObject *__pyx_v_step, PyObject *__pyx_v_nest); /* proto */ static PyObject *__pyx_pf_6healpy_11_query_disc_10boundaries(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_pix, PyObject *__pyx_v_step, PyObject *__pyx_v_nest); /* proto */ static int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /* proto */ static void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info); /* proto */ static char __pyx_k_B[] = "B"; static char __pyx_k_H[] = "H"; static char __pyx_k_I[] = "I"; static char __pyx_k_L[] = "L"; static char __pyx_k_O[] = "O"; static char __pyx_k_Q[] = "Q"; static char __pyx_k_b[] = "b"; static char __pyx_k_d[] = "d"; static char __pyx_k_f[] = "f"; static char __pyx_k_g[] = "g"; static char __pyx_k_h[] = "h"; static char __pyx_k_i[] = "i"; static char __pyx_k_j[] = "j"; static char __pyx_k_l[] = "l"; static char __pyx_k_n[] = "n"; static char __pyx_k_q[] = "q"; static char __pyx_k_v[] = "v"; static char __pyx_k_Zd[] = "Zd"; static char __pyx_k_Zf[] = "Zf"; static char __pyx_k_Zg[] = "Zg"; static char __pyx_k_hb[] = "hb"; static char __pyx_k_np[] = "np"; static char __pyx_k_out[] = "out"; static char __pyx_k_pix[] = "pix"; static char __pyx_k_ptg[] = "ptg"; static char __pyx_k_vec[] = "vec"; static char __pyx_k_buff[] = "buff"; static char __pyx_k_fact[] = "fact"; static char __pyx_k_main[] = "__main__"; static char __pyx_k_ndim[] = "ndim"; static char __pyx_k_nest[] = "nest"; static char __pyx_k_npix[] = "npix"; static char __pyx_k_size[] = "size"; static char __pyx_k_step[] = "step"; static char __pyx_k_test[] = "__test__"; static char __pyx_k_type[] = "type"; static char __pyx_k_vert[] = "vert"; static char __pyx_k_dtype[] = "dtype"; static char __pyx_k_empty[] = "empty"; static char __pyx_k_float[] = "float"; static char __pyx_k_int64[] = "int64"; static char __pyx_k_nside[] = "nside"; static char __pyx_k_numpy[] = "numpy"; static char __pyx_k_range[] = "range"; static char __pyx_k_bounds[] = "bounds"; static char __pyx_k_factor[] = "factor"; static char __pyx_k_import[] = "__import__"; static char __pyx_k_pixset[] = "pixset"; static char __pyx_k_radius[] = "radius"; static char __pyx_k_scheme[] = "scheme"; static char __pyx_k_theta1[] = "theta1"; static char __pyx_k_theta2[] = "theta2"; static char __pyx_k_integer[] = "integer"; static char __pyx_k_maxnpix[] = "maxnpix"; static char __pyx_k_vertices[] = "vertices"; static char __pyx_k_inclusive[] = "inclusive"; static char __pyx_k_ValueError[] = "ValueError"; static char __pyx_k_boundaries[] = "boundaries"; static char __pyx_k_query_disc[] = "query_disc"; static char __pyx_k_query_strip[] = "query_strip"; static char __pyx_k_RuntimeError[] = "RuntimeError"; static char __pyx_k_pyx_getbuffer[] = "__pyx_getbuffer"; static char __pyx_k_query_polygon[] = "query_polygon"; static char __pyx_k_boundaries_single[] = "_boundaries_single"; static char __pyx_k_pyx_releasebuffer[] = "__pyx_releasebuffer"; static char __pyx_k_healpy__query_disc[] = "healpy._query_disc"; static char __pyx_k_boundaries_line_236[] = "boundaries (line 236)"; static char __pyx_k_boundaries_multiple[] = "_boundaries_multiple"; static char __pyx_k_ndarray_is_not_C_contiguous[] = "ndarray is not C contiguous"; static char __pyx_k_Array_has_to_one_dimensional[] = "Array has to one dimensional"; static char __pyx_k_Pixel_identifier_is_too_large[] = "Pixel identifier is too large"; static char __pyx_k_home_zonca_p_software_healpy_he[] = "/home/zonca/p/software/healpy/healpy/src/_query_disc.pyx"; static char __pyx_k_unknown_dtype_code_in_numpy_pxd[] = "unknown dtype code in numpy.pxd (%d)"; static char __pyx_k_Array_of_pixels_has_to_be_intege[] = "Array of pixels has to be integers"; static char __pyx_k_Buffer_too_small_to_contain_retu[] = "Buffer too small to contain return value"; static char __pyx_k_Format_string_allocated_too_shor[] = "Format string allocated too short, see comment in numpy.pxd"; static char __pyx_k_Non_native_byte_order_not_suppor[] = "Non-native byte order not supported"; static char __pyx_k_Returns_an_array_containing_vect[] = "Returns an array containing vectors to the boundary of\n the nominated pixel.\n\n The returned array has shape (3, 4*step), the elements of\n which are the x,y,z positions on the unit sphere of the\n pixel boundary. In order to get vector positions for just\n the corners, specify step=1.\n\n Parameters\n ----------\n nside : int\n The nside of the Healpix map.\n pix : int\n Pixel identifier\n step : int, optional\n Number of elements for each side of the pixel.\n nest : bool, optional\n if True, assume NESTED pixel ordering, otherwise, RING pixel ordering\n\n Returns\n -------\n boundary : float, array\n x,y,z for positions on the boundary of the pixel\n\n Example\n -------\n # Get corners of HEALPixel 5 in nside=2, RINGS ordering.\n\n >>> import healpy as hp\n >>> import numpy as np\n >>> nside = 2\n >>> corners = hp.boundaries(nside, 5)\n\n # Now convert to phi,theta representation:\n >>> phi_theta = hp.vec2ang(np.transpose(corners))\n\n >>> corners = hp.boundaries(nside, np.array([5,5]))\n\n # doctest moved to test_query_disc.py\n "; static char __pyx_k_Wrong_nside_value_must_be_a_powe[] = "Wrong nside value, must be a power of 2"; static char __pyx_k_fact_must_be_a_power_of_2_when_n[] = "fact must be a power of 2 when nest is True (fact=%d)"; static char __pyx_k_ndarray_is_not_Fortran_contiguou[] = "ndarray is not Fortran contiguous"; static char __pyx_k_Format_string_allocated_too_shor_2[] = "Format string allocated too short."; static PyObject *__pyx_kp_s_Array_has_to_one_dimensional; static PyObject *__pyx_kp_s_Array_of_pixels_has_to_be_intege; static PyObject *__pyx_kp_s_Buffer_too_small_to_contain_retu; static PyObject *__pyx_kp_u_Format_string_allocated_too_shor; static PyObject *__pyx_kp_u_Format_string_allocated_too_shor_2; static PyObject *__pyx_kp_u_Non_native_byte_order_not_suppor; static PyObject *__pyx_kp_s_Pixel_identifier_is_too_large; static PyObject *__pyx_kp_u_Returns_an_array_containing_vect; static PyObject *__pyx_n_s_RuntimeError; static PyObject *__pyx_n_s_ValueError; static PyObject *__pyx_kp_s_Wrong_nside_value_must_be_a_powe; static PyObject *__pyx_n_s_boundaries; static PyObject *__pyx_kp_u_boundaries_line_236; static PyObject *__pyx_n_s_boundaries_multiple; static PyObject *__pyx_n_s_boundaries_single; static PyObject *__pyx_n_s_bounds; static PyObject *__pyx_n_s_buff; static PyObject *__pyx_n_s_dtype; static PyObject *__pyx_n_s_empty; static PyObject *__pyx_n_s_fact; static PyObject *__pyx_kp_s_fact_must_be_a_power_of_2_when_n; static PyObject *__pyx_n_s_factor; static PyObject *__pyx_n_s_float; static PyObject *__pyx_n_s_hb; static PyObject *__pyx_n_s_healpy__query_disc; static PyObject *__pyx_kp_s_home_zonca_p_software_healpy_he; static PyObject *__pyx_n_s_i; static PyObject *__pyx_n_s_import; static PyObject *__pyx_n_s_inclusive; static PyObject *__pyx_n_s_int64; static PyObject *__pyx_n_s_integer; static PyObject *__pyx_n_s_j; static PyObject *__pyx_n_s_main; static PyObject *__pyx_n_s_maxnpix; static PyObject *__pyx_n_s_n; static PyObject *__pyx_kp_u_ndarray_is_not_C_contiguous; static PyObject *__pyx_kp_u_ndarray_is_not_Fortran_contiguou; static PyObject *__pyx_n_s_ndim; static PyObject *__pyx_n_s_nest; static PyObject *__pyx_n_s_np; static PyObject *__pyx_n_s_npix; static PyObject *__pyx_n_s_nside; static PyObject *__pyx_n_s_numpy; static PyObject *__pyx_n_s_out; static PyObject *__pyx_n_s_pix; static PyObject *__pyx_n_s_pixset; static PyObject *__pyx_n_s_ptg; static PyObject *__pyx_n_s_pyx_getbuffer; static PyObject *__pyx_n_s_pyx_releasebuffer; static PyObject *__pyx_n_s_query_disc; static PyObject *__pyx_n_s_query_polygon; static PyObject *__pyx_n_s_query_strip; static PyObject *__pyx_n_s_radius; static PyObject *__pyx_n_s_range; static PyObject *__pyx_n_s_scheme; static PyObject *__pyx_n_s_size; static PyObject *__pyx_n_s_step; static PyObject *__pyx_n_s_test; static PyObject *__pyx_n_s_theta1; static PyObject *__pyx_n_s_theta2; static PyObject *__pyx_n_s_type; static PyObject *__pyx_kp_u_unknown_dtype_code_in_numpy_pxd; static PyObject *__pyx_n_s_v; static PyObject *__pyx_n_s_vec; static PyObject *__pyx_n_s_vert; static PyObject *__pyx_n_s_vertices; static PyObject *__pyx_int_1; static PyObject *__pyx_int_3; static PyObject *__pyx_int_4; static PyObject *__pyx_int_12; static PyObject *__pyx_tuple_; static PyObject *__pyx_tuple__2; static PyObject *__pyx_tuple__3; static PyObject *__pyx_tuple__4; static PyObject *__pyx_tuple__5; static PyObject *__pyx_tuple__6; static PyObject *__pyx_tuple__7; static PyObject *__pyx_tuple__8; static PyObject *__pyx_tuple__9; static PyObject *__pyx_tuple__10; static PyObject *__pyx_tuple__11; static PyObject *__pyx_tuple__12; static PyObject *__pyx_tuple__13; static PyObject *__pyx_tuple__14; static PyObject *__pyx_tuple__15; static PyObject *__pyx_tuple__16; static PyObject *__pyx_tuple__18; static PyObject *__pyx_tuple__20; static PyObject *__pyx_tuple__22; static PyObject *__pyx_tuple__24; static PyObject *__pyx_tuple__26; static PyObject *__pyx_codeobj__17; static PyObject *__pyx_codeobj__19; static PyObject *__pyx_codeobj__21; static PyObject *__pyx_codeobj__23; static PyObject *__pyx_codeobj__25; static PyObject *__pyx_codeobj__27; /* "healpy/src/_query_disc.pyx":13 * @cython.boundscheck(False) * @cython.wraparound(False) * def query_disc(nside, vec, radius, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the disk defined by * *vec* and *radius* (in radians) (if *inclusive* is False), or which */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_11_query_disc_1query_disc(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_11_query_disc_query_disc[] = "Returns pixels whose centers lie within the disk defined by\n *vec* and *radius* (in radians) (if *inclusive* is False), or which\n overlap with this disk (if *inclusive* is True).\n\n Parameters\n ----------\n nside : int\n The nside of the Healpix map.\n vec : float, sequence of 3 elements\n The coordinates of unit vector defining the disk center.\n radius : float\n The radius (in radians) of the disk\n inclusive : bool, optional\n If False, return the exact set of pixels whose pixel centers lie \n within the disk; if True, return all pixels that overlap with the disk,\n and maybe a few more. Default: False\n fact : int, optional\n Only used when inclusive=True. The overlapping test will be done at\n the resolution fact*nside. For NESTED ordering, fact must be a power of 2,\n else it can be any positive integer. Default: 4.\n nest: bool, optional\n if True, assume NESTED pixel ordering, otherwise, RING pixel ordering\n buff: int array, optional\n if provided, this numpy array is used to contain the return values and must be\n at least long enough to do so\n\n Returns\n -------\n ipix : int, array\n The pixels which lie within the given disk.\n\n Note\n ----\n This method is more efficient in the RING scheme.\n For inclusive=True, the algorithm may return some pixels which don't overlap\n with the disk at all. The higher fact is chosen, the fewer false positives\n are returned, at the cost of increased run time.\n "; static PyMethodDef __pyx_mdef_6healpy_11_query_disc_1query_disc = {__Pyx_NAMESTR("query_disc"), (PyCFunction)__pyx_pw_6healpy_11_query_disc_1query_disc, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_11_query_disc_query_disc)}; static PyObject *__pyx_pw_6healpy_11_query_disc_1query_disc(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_nside = 0; PyObject *__pyx_v_vec = 0; PyObject *__pyx_v_radius = 0; PyObject *__pyx_v_inclusive = 0; PyObject *__pyx_v_fact = 0; PyObject *__pyx_v_nest = 0; PyArrayObject *__pyx_v_buff = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("query_disc (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nside,&__pyx_n_s_vec,&__pyx_n_s_radius,&__pyx_n_s_inclusive,&__pyx_n_s_fact,&__pyx_n_s_nest,&__pyx_n_s_buff,0}; PyObject* values[7] = {0,0,0,0,0,0,0}; values[3] = ((PyObject *)Py_False); values[4] = ((PyObject *)__pyx_int_4); values[5] = ((PyObject *)Py_False); values[6] = (PyObject *)((PyArrayObject *)Py_None); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6); case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_vec)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("query_disc", 0, 3, 7, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (likely((values[2] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_radius)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("query_disc", 0, 3, 7, 2); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_inclusive); if (value) { values[3] = value; kw_args--; } } case 4: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fact); if (value) { values[4] = value; kw_args--; } } case 5: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nest); if (value) { values[5] = value; kw_args--; } } case 6: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_buff); if (value) { values[6] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "query_disc") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 7: values[6] = PyTuple_GET_ITEM(__pyx_args, 6); case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_nside = values[0]; __pyx_v_vec = values[1]; __pyx_v_radius = values[2]; __pyx_v_inclusive = values[3]; __pyx_v_fact = values[4]; __pyx_v_nest = values[5]; __pyx_v_buff = ((PyArrayObject *)values[6]); } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("query_disc", 0, 3, 7, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._query_disc.query_disc", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_buff), __pyx_ptype_5numpy_ndarray, 1, "buff", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_r = __pyx_pf_6healpy_11_query_disc_query_disc(__pyx_self, __pyx_v_nside, __pyx_v_vec, __pyx_v_radius, __pyx_v_inclusive, __pyx_v_fact, __pyx_v_nest, __pyx_v_buff); /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_11_query_disc_query_disc(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_vec, PyObject *__pyx_v_radius, PyObject *__pyx_v_inclusive, PyObject *__pyx_v_fact, PyObject *__pyx_v_nest, PyArrayObject *__pyx_v_buff) { vec3 __pyx_v_v; enum Healpix_Ordering_Scheme __pyx_v_scheme; T_Healpix_Base __pyx_v_hb; rangeset __pyx_v_pixset; int __pyx_v_factor; pointing __pyx_v_ptg; __Pyx_LocalBuf_ND __pyx_pybuffernd_buff; __Pyx_Buffer __pyx_pybuffer_buff; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; double __pyx_t_4; double __pyx_t_5; double __pyx_t_6; int64 __pyx_t_7; int __pyx_t_8; int __pyx_t_9; int __pyx_t_10; PyObject *__pyx_t_11 = NULL; struct __pyx_opt_args_6healpy_11_query_disc_pixset_to_array __pyx_t_12; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("query_disc", 0); __pyx_pybuffer_buff.pybuffer.buf = NULL; __pyx_pybuffer_buff.refcount = 0; __pyx_pybuffernd_buff.data = NULL; __pyx_pybuffernd_buff.rcbuffer = &__pyx_pybuffer_buff; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_buff.rcbuffer->pybuffer, (PyObject*)__pyx_v_buff, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_buff.diminfo[0].strides = __pyx_pybuffernd_buff.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_buff.diminfo[0].shape = __pyx_pybuffernd_buff.rcbuffer->pybuffer.shape[0]; /* "healpy/src/_query_disc.pyx":53 * """ * # Check Nside value * if not isnsideok(nside): # <<<<<<<<<<<<<< * raise ValueError('Wrong nside value, must be a power of 2') * cdef vec3 v = vec3(vec[0], vec[1], vec[2]) */ __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nside); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((!(__pyx_f_6healpy_11_query_disc_isnsideok(__pyx_t_1) != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":54 * # Check Nside value * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * cdef vec3 v = vec3(vec[0], vec[1], vec[2]) * cdef Healpix_Ordering_Scheme scheme */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple_, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":55 * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') * cdef vec3 v = vec3(vec[0], vec[1], vec[2]) # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ __pyx_t_3 = __Pyx_GetItemInt(__pyx_v_vec, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 0); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_4 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_GetItemInt(__pyx_v_vec, 1, long, 1, __Pyx_PyInt_From_long, 0, 0, 0); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_GetItemInt(__pyx_v_vec, 2, long, 1, __Pyx_PyInt_From_long, 0, 0, 0); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = __pyx_PyFloat_AsDouble(__pyx_t_3); if (unlikely((__pyx_t_6 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_v = vec3(__pyx_t_4, __pyx_t_5, __pyx_t_6); /* "healpy/src/_query_disc.pyx":57 * cdef vec3 v = vec3(vec[0], vec[1], vec[2]) * cdef Healpix_Ordering_Scheme scheme * if nest: # <<<<<<<<<<<<<< * scheme = NEST * else: */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":58 * cdef Healpix_Ordering_Scheme scheme * if nest: * scheme = NEST # <<<<<<<<<<<<<< * else: * scheme = RING */ __pyx_v_scheme = NEST; goto __pyx_L4; } /*else*/ { /* "healpy/src/_query_disc.pyx":60 * scheme = NEST * else: * scheme = RING # <<<<<<<<<<<<<< * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * cdef rangeset[int64] pixset */ __pyx_v_scheme = RING; } __pyx_L4:; /* "healpy/src/_query_disc.pyx":61 * else: * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # <<<<<<<<<<<<<< * cdef rangeset[int64] pixset * cdef int factor = fact */ __pyx_t_7 = __Pyx_PyInt_As_int64(__pyx_v_nside); if (unlikely((__pyx_t_7 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 61; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb = T_Healpix_Base(__pyx_t_7, __pyx_v_scheme, SET_NSIDE); /* "healpy/src/_query_disc.pyx":63 * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * cdef rangeset[int64] pixset * cdef int factor = fact # <<<<<<<<<<<<<< * cdef pointing ptg = pointing(v) * ptg.normalize() */ __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_fact); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 63; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_factor = __pyx_t_1; /* "healpy/src/_query_disc.pyx":64 * cdef rangeset[int64] pixset * cdef int factor = fact * cdef pointing ptg = pointing(v) # <<<<<<<<<<<<<< * ptg.normalize() * if inclusive: */ __pyx_v_ptg = pointing(__pyx_v_v); /* "healpy/src/_query_disc.pyx":65 * cdef int factor = fact * cdef pointing ptg = pointing(v) * ptg.normalize() # <<<<<<<<<<<<<< * if inclusive: * factor = abs(fact) */ __pyx_v_ptg.normalize(); /* "healpy/src/_query_disc.pyx":66 * cdef pointing ptg = pointing(v) * ptg.normalize() * if inclusive: # <<<<<<<<<<<<<< * factor = abs(fact) * if nest and (factor == 0 or (factor & (factor - 1) != 0)): */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_inclusive); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 66; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":67 * ptg.normalize() * if inclusive: * factor = abs(fact) # <<<<<<<<<<<<<< * if nest and (factor == 0 or (factor & (factor - 1) != 0)): * raise ValueError('fact must be a power of 2 when ' */ __pyx_t_3 = PyNumber_Absolute(__pyx_v_fact); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 67; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 67; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_factor = __pyx_t_1; /* "healpy/src/_query_disc.pyx":68 * if inclusive: * factor = abs(fact) * if nest and (factor == 0 or (factor & (factor - 1) != 0)): # <<<<<<<<<<<<<< * raise ValueError('fact must be a power of 2 when ' * 'nest is True (fact=%d)' % (fact)) */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 68; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { __pyx_t_8 = (__pyx_v_factor == 0); if (!__pyx_t_8) { __pyx_t_9 = ((__pyx_v_factor & (__pyx_v_factor - 1)) != 0); __pyx_t_10 = __pyx_t_9; } else { __pyx_t_10 = __pyx_t_8; } __pyx_t_8 = __pyx_t_10; } else { __pyx_t_8 = __pyx_t_2; } if (__pyx_t_8) { /* "healpy/src/_query_disc.pyx":70 * if nest and (factor == 0 or (factor & (factor - 1) != 0)): * raise ValueError('fact must be a power of 2 when ' * 'nest is True (fact=%d)' % (fact)) # <<<<<<<<<<<<<< * hb.query_disc_inclusive(ptg, radius, pixset, factor) * else: */ __pyx_t_3 = __Pyx_PyString_Format(__pyx_kp_s_fact_must_be_a_power_of_2_when_n, __pyx_v_fact); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 70; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); /* "healpy/src/_query_disc.pyx":69 * factor = abs(fact) * if nest and (factor == 0 or (factor & (factor - 1) != 0)): * raise ValueError('fact must be a power of 2 when ' # <<<<<<<<<<<<<< * 'nest is True (fact=%d)' % (fact)) * hb.query_disc_inclusive(ptg, radius, pixset, factor) */ __pyx_t_11 = PyTuple_New(1); if (unlikely(!__pyx_t_11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 69; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_11); PyTuple_SET_ITEM(__pyx_t_11, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_11, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 69; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0; __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 69; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":71 * raise ValueError('fact must be a power of 2 when ' * 'nest is True (fact=%d)' % (fact)) * hb.query_disc_inclusive(ptg, radius, pixset, factor) # <<<<<<<<<<<<<< * else: * hb.query_disc(ptg, radius, pixset) */ __pyx_t_6 = __pyx_PyFloat_AsDouble(__pyx_v_radius); if (unlikely((__pyx_t_6 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 71; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb.query_disc_inclusive(__pyx_v_ptg, __pyx_t_6, __pyx_v_pixset, __pyx_v_factor); goto __pyx_L5; } /*else*/ { /* "healpy/src/_query_disc.pyx":73 * hb.query_disc_inclusive(ptg, radius, pixset, factor) * else: * hb.query_disc(ptg, radius, pixset) # <<<<<<<<<<<<<< * * return pixset_to_array(pixset, buff) */ __pyx_t_6 = __pyx_PyFloat_AsDouble(__pyx_v_radius); if (unlikely((__pyx_t_6 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 73; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb.query_disc(__pyx_v_ptg, __pyx_t_6, __pyx_v_pixset); } __pyx_L5:; /* "healpy/src/_query_disc.pyx":75 * hb.query_disc(ptg, radius, pixset) * * return pixset_to_array(pixset, buff) # <<<<<<<<<<<<<< * * */ __Pyx_XDECREF(__pyx_r); __pyx_t_12.__pyx_n = 1; __pyx_t_12.buff = ((PyObject *)__pyx_v_buff); __pyx_t_3 = __pyx_f_6healpy_11_query_disc_pixset_to_array(__pyx_v_pixset, &__pyx_t_12); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 75; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_r = __pyx_t_3; __pyx_t_3 = 0; goto __pyx_L0; /* "healpy/src/_query_disc.pyx":13 * @cython.boundscheck(False) * @cython.wraparound(False) * def query_disc(nside, vec, radius, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the disk defined by * *vec* and *radius* (in radians) (if *inclusive* is False), or which */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_11); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_buff.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._query_disc.query_disc", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_buff.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_query_disc.pyx":78 * * * def query_polygon(nside, vertices, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """ Returns the pixels whose centers lie within the convex polygon * defined by the *vertices* array (if *inclusive* is False), or which */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_11_query_disc_3query_polygon(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_11_query_disc_2query_polygon[] = " Returns the pixels whose centers lie within the convex polygon \n defined by the *vertices* array (if *inclusive* is False), or which \n overlap with this polygon (if *inclusive* is True).\n\n Parameters\n ----------\n nside : int\n The nside of the Healpix map.\n vertices : float, array-like\n Vertex array containing the vertices of the polygon, shape (N, 3).\n inclusive : bool, optional\n If False, return the exact set of pixels whose pixel centers lie\n within the polygon; if True, return all pixels that overlap with the\n polygon, and maybe a few more. Default: False.\n fact : int, optional\n Only used when inclusive=True. The overlapping test will be done at\n the resolution fact*nside. For NESTED ordering, fact must be a power of 2,\n else it can be any positive integer. Default: 4.\n nest: bool, optional\n if True, assume NESTED pixel ordering, otherwise, RING pixel ordering\n buff: int array, optional\n if provided, this numpy array is used to contain the return values and must be\n at least long enough to do so\n \n Returns\n -------\n ipix : int, array\n The pixels which lie within the given polygon.\n\n Note\n ----\n This method is more efficient in the RING scheme.\n For inclusive=True, the algorithm may return some pixels which don't overlap\n with the disk at all. The higher fact is chosen, the fewer false positives\n are returned, at the cost of increased run time.\n "; static PyMethodDef __pyx_mdef_6healpy_11_query_disc_3query_polygon = {__Pyx_NAMESTR("query_polygon"), (PyCFunction)__pyx_pw_6healpy_11_query_disc_3query_polygon, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_11_query_disc_2query_polygon)}; static PyObject *__pyx_pw_6healpy_11_query_disc_3query_polygon(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_nside = 0; PyObject *__pyx_v_vertices = 0; PyObject *__pyx_v_inclusive = 0; PyObject *__pyx_v_fact = 0; PyObject *__pyx_v_nest = 0; PyArrayObject *__pyx_v_buff = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("query_polygon (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nside,&__pyx_n_s_vertices,&__pyx_n_s_inclusive,&__pyx_n_s_fact,&__pyx_n_s_nest,&__pyx_n_s_buff,0}; PyObject* values[6] = {0,0,0,0,0,0}; values[2] = ((PyObject *)Py_False); values[3] = ((PyObject *)__pyx_int_4); values[4] = ((PyObject *)Py_False); values[5] = (PyObject *)((PyArrayObject *)Py_None); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_vertices)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("query_polygon", 0, 2, 6, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_inclusive); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fact); if (value) { values[3] = value; kw_args--; } } case 4: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nest); if (value) { values[4] = value; kw_args--; } } case 5: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_buff); if (value) { values[5] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "query_polygon") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_nside = values[0]; __pyx_v_vertices = values[1]; __pyx_v_inclusive = values[2]; __pyx_v_fact = values[3]; __pyx_v_nest = values[4]; __pyx_v_buff = ((PyArrayObject *)values[5]); } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("query_polygon", 0, 2, 6, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._query_disc.query_polygon", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_buff), __pyx_ptype_5numpy_ndarray, 1, "buff", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_r = __pyx_pf_6healpy_11_query_disc_2query_polygon(__pyx_self, __pyx_v_nside, __pyx_v_vertices, __pyx_v_inclusive, __pyx_v_fact, __pyx_v_nest, __pyx_v_buff); /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_11_query_disc_2query_polygon(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_vertices, PyObject *__pyx_v_inclusive, PyObject *__pyx_v_fact, PyObject *__pyx_v_nest, PyArrayObject *__pyx_v_buff) { std::vector __pyx_v_vert; pointing __pyx_v_ptg; PyObject *__pyx_v_v = NULL; enum Healpix_Ordering_Scheme __pyx_v_scheme; T_Healpix_Base __pyx_v_hb; rangeset __pyx_v_pixset; int __pyx_v_factor; __Pyx_LocalBuf_ND __pyx_pybuffernd_buff; __Pyx_Buffer __pyx_pybuffer_buff; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; Py_ssize_t __pyx_t_4; PyObject *(*__pyx_t_5)(PyObject *); PyObject *__pyx_t_6 = NULL; double __pyx_t_7; double __pyx_t_8; double __pyx_t_9; int64 __pyx_t_10; int __pyx_t_11; int __pyx_t_12; int __pyx_t_13; struct __pyx_opt_args_6healpy_11_query_disc_pixset_to_array __pyx_t_14; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("query_polygon", 0); __pyx_pybuffer_buff.pybuffer.buf = NULL; __pyx_pybuffer_buff.refcount = 0; __pyx_pybuffernd_buff.data = NULL; __pyx_pybuffernd_buff.rcbuffer = &__pyx_pybuffer_buff; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_buff.rcbuffer->pybuffer, (PyObject*)__pyx_v_buff, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_buff.diminfo[0].strides = __pyx_pybuffernd_buff.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_buff.diminfo[0].shape = __pyx_pybuffernd_buff.rcbuffer->pybuffer.shape[0]; /* "healpy/src/_query_disc.pyx":116 * """ * # Check Nside value * if not isnsideok(nside): # <<<<<<<<<<<<<< * raise ValueError('Wrong nside value, must be a power of 2') * # Create vector of vertices */ __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nside); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 116; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((!(__pyx_f_6healpy_11_query_disc_isnsideok(__pyx_t_1) != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":117 * # Check Nside value * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * # Create vector of vertices * cdef vector[pointing] vert */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__2, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 117; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 117; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":121 * cdef vector[pointing] vert * cdef pointing ptg * for v in vertices: # <<<<<<<<<<<<<< * ptg = pointing(vec3(v[0], v[1], v[2])) * ptg.normalize() */ if (PyList_CheckExact(__pyx_v_vertices) || PyTuple_CheckExact(__pyx_v_vertices)) { __pyx_t_3 = __pyx_v_vertices; __Pyx_INCREF(__pyx_t_3); __pyx_t_4 = 0; __pyx_t_5 = NULL; } else { __pyx_t_4 = -1; __pyx_t_3 = PyObject_GetIter(__pyx_v_vertices); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = Py_TYPE(__pyx_t_3)->tp_iternext; } for (;;) { if (!__pyx_t_5 && PyList_CheckExact(__pyx_t_3)) { if (__pyx_t_4 >= PyList_GET_SIZE(__pyx_t_3)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_6 = PyList_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_5 && PyTuple_CheckExact(__pyx_t_3)) { if (__pyx_t_4 >= PyTuple_GET_SIZE(__pyx_t_3)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_6 = PyTuple_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_6); __pyx_t_4++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_6 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_6 = __pyx_t_5(__pyx_t_3); if (unlikely(!__pyx_t_6)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 121; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_6); } __Pyx_XDECREF_SET(__pyx_v_v, __pyx_t_6); __pyx_t_6 = 0; /* "healpy/src/_query_disc.pyx":122 * cdef pointing ptg * for v in vertices: * ptg = pointing(vec3(v[0], v[1], v[2])) # <<<<<<<<<<<<<< * ptg.normalize() * vert.push_back(ptg) */ __pyx_t_6 = __Pyx_GetItemInt(__pyx_v_v, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_6 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 122; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = __pyx_PyFloat_AsDouble(__pyx_t_6); if (unlikely((__pyx_t_7 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 122; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_GetItemInt(__pyx_v_v, 1, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_6 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 122; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_6); __pyx_t_8 = __pyx_PyFloat_AsDouble(__pyx_t_6); if (unlikely((__pyx_t_8 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 122; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_GetItemInt(__pyx_v_v, 2, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_6 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 122; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_6); __pyx_t_9 = __pyx_PyFloat_AsDouble(__pyx_t_6); if (unlikely((__pyx_t_9 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 122; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_v_ptg = pointing(vec3(__pyx_t_7, __pyx_t_8, __pyx_t_9)); /* "healpy/src/_query_disc.pyx":123 * for v in vertices: * ptg = pointing(vec3(v[0], v[1], v[2])) * ptg.normalize() # <<<<<<<<<<<<<< * vert.push_back(ptg) * # Create the Healpix_Base2 structure */ __pyx_v_ptg.normalize(); /* "healpy/src/_query_disc.pyx":124 * ptg = pointing(vec3(v[0], v[1], v[2])) * ptg.normalize() * vert.push_back(ptg) # <<<<<<<<<<<<<< * # Create the Healpix_Base2 structure * cdef Healpix_Ordering_Scheme scheme */ __pyx_v_vert.push_back(__pyx_v_ptg); } __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_query_disc.pyx":127 * # Create the Healpix_Base2 structure * cdef Healpix_Ordering_Scheme scheme * if nest: # <<<<<<<<<<<<<< * scheme = NEST * else: */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 127; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":128 * cdef Healpix_Ordering_Scheme scheme * if nest: * scheme = NEST # <<<<<<<<<<<<<< * else: * scheme = RING */ __pyx_v_scheme = NEST; goto __pyx_L6; } /*else*/ { /* "healpy/src/_query_disc.pyx":130 * scheme = NEST * else: * scheme = RING # <<<<<<<<<<<<<< * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * # Call query_polygon */ __pyx_v_scheme = RING; } __pyx_L6:; /* "healpy/src/_query_disc.pyx":131 * else: * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # <<<<<<<<<<<<<< * # Call query_polygon * cdef rangeset[int64] pixset */ __pyx_t_10 = __Pyx_PyInt_As_int64(__pyx_v_nside); if (unlikely((__pyx_t_10 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 131; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb = T_Healpix_Base(__pyx_t_10, __pyx_v_scheme, SET_NSIDE); /* "healpy/src/_query_disc.pyx":135 * cdef rangeset[int64] pixset * cdef int factor * if inclusive: # <<<<<<<<<<<<<< * factor = abs(fact) * if nest and (factor == 0 or (factor & (factor - 1) != 0)): */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_inclusive); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 135; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":136 * cdef int factor * if inclusive: * factor = abs(fact) # <<<<<<<<<<<<<< * if nest and (factor == 0 or (factor & (factor - 1) != 0)): * raise ValueError('fact must be a power of 2 when ' */ __pyx_t_3 = PyNumber_Absolute(__pyx_v_fact); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_factor = __pyx_t_1; /* "healpy/src/_query_disc.pyx":137 * if inclusive: * factor = abs(fact) * if nest and (factor == 0 or (factor & (factor - 1) != 0)): # <<<<<<<<<<<<<< * raise ValueError('fact must be a power of 2 when ' * 'nest is True (fact=%d)' % (fact)) */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 137; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { __pyx_t_11 = (__pyx_v_factor == 0); if (!__pyx_t_11) { __pyx_t_12 = ((__pyx_v_factor & (__pyx_v_factor - 1)) != 0); __pyx_t_13 = __pyx_t_12; } else { __pyx_t_13 = __pyx_t_11; } __pyx_t_11 = __pyx_t_13; } else { __pyx_t_11 = __pyx_t_2; } if (__pyx_t_11) { /* "healpy/src/_query_disc.pyx":139 * if nest and (factor == 0 or (factor & (factor - 1) != 0)): * raise ValueError('fact must be a power of 2 when ' * 'nest is True (fact=%d)' % (fact)) # <<<<<<<<<<<<<< * hb.query_polygon_inclusive(vert, pixset, factor) * else: */ __pyx_t_3 = __Pyx_PyString_Format(__pyx_kp_s_fact_must_be_a_power_of_2_when_n, __pyx_v_fact); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 139; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); /* "healpy/src/_query_disc.pyx":138 * factor = abs(fact) * if nest and (factor == 0 or (factor & (factor - 1) != 0)): * raise ValueError('fact must be a power of 2 when ' # <<<<<<<<<<<<<< * 'nest is True (fact=%d)' % (fact)) * hb.query_polygon_inclusive(vert, pixset, factor) */ __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 138; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_6, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 138; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 138; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":140 * raise ValueError('fact must be a power of 2 when ' * 'nest is True (fact=%d)' % (fact)) * hb.query_polygon_inclusive(vert, pixset, factor) # <<<<<<<<<<<<<< * else: * hb.query_polygon(vert, pixset) */ __pyx_v_hb.query_polygon_inclusive(__pyx_v_vert, __pyx_v_pixset, __pyx_v_factor); goto __pyx_L7; } /*else*/ { /* "healpy/src/_query_disc.pyx":142 * hb.query_polygon_inclusive(vert, pixset, factor) * else: * hb.query_polygon(vert, pixset) # <<<<<<<<<<<<<< * * return pixset_to_array(pixset, buff) */ __pyx_v_hb.query_polygon(__pyx_v_vert, __pyx_v_pixset); } __pyx_L7:; /* "healpy/src/_query_disc.pyx":144 * hb.query_polygon(vert, pixset) * * return pixset_to_array(pixset, buff) # <<<<<<<<<<<<<< * * def query_strip(nside, theta1, theta2, inclusive = False, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): */ __Pyx_XDECREF(__pyx_r); __pyx_t_14.__pyx_n = 1; __pyx_t_14.buff = ((PyObject *)__pyx_v_buff); __pyx_t_3 = __pyx_f_6healpy_11_query_disc_pixset_to_array(__pyx_v_pixset, &__pyx_t_14); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 144; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_r = __pyx_t_3; __pyx_t_3 = 0; goto __pyx_L0; /* "healpy/src/_query_disc.pyx":78 * * * def query_polygon(nside, vertices, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """ Returns the pixels whose centers lie within the convex polygon * defined by the *vertices* array (if *inclusive* is False), or which */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_6); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_buff.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._query_disc.query_polygon", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_buff.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF(__pyx_v_v); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_query_disc.pyx":146 * return pixset_to_array(pixset, buff) * * def query_strip(nside, theta1, theta2, inclusive = False, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the colatitude range * defined by *theta1* and *theta2* (if inclusive is False), or which */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_11_query_disc_5query_strip(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_11_query_disc_4query_strip[] = "Returns pixels whose centers lie within the colatitude range\n defined by *theta1* and *theta2* (if inclusive is False), or which \n overlap with this region (if *inclusive* is True). If theta1 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_inclusive); if (value) { values[3] = value; kw_args--; } } case 4: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nest); if (value) { values[4] = value; kw_args--; } } case 5: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_buff); if (value) { values[5] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "query_strip") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_nside = values[0]; __pyx_v_theta1 = values[1]; __pyx_v_theta2 = values[2]; __pyx_v_inclusive = values[3]; __pyx_v_nest = values[4]; __pyx_v_buff = ((PyArrayObject *)values[5]); } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("query_strip", 0, 3, 6, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._query_disc.query_strip", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_buff), __pyx_ptype_5numpy_ndarray, 1, "buff", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_r = __pyx_pf_6healpy_11_query_disc_4query_strip(__pyx_self, __pyx_v_nside, __pyx_v_theta1, __pyx_v_theta2, __pyx_v_inclusive, __pyx_v_nest, __pyx_v_buff); /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_11_query_disc_4query_strip(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_theta1, PyObject *__pyx_v_theta2, PyObject *__pyx_v_inclusive, PyObject *__pyx_v_nest, PyArrayObject *__pyx_v_buff) { enum Healpix_Ordering_Scheme __pyx_v_scheme; T_Healpix_Base __pyx_v_hb; rangeset __pyx_v_pixset; __Pyx_LocalBuf_ND __pyx_pybuffernd_buff; __Pyx_Buffer __pyx_pybuffer_buff; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; int64 __pyx_t_4; double __pyx_t_5; double __pyx_t_6; struct __pyx_opt_args_6healpy_11_query_disc_pixset_to_array __pyx_t_7; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("query_strip", 0); __pyx_pybuffer_buff.pybuffer.buf = NULL; __pyx_pybuffer_buff.refcount = 0; __pyx_pybuffernd_buff.data = NULL; __pyx_pybuffernd_buff.rcbuffer = &__pyx_pybuffer_buff; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_buff.rcbuffer->pybuffer, (PyObject*)__pyx_v_buff, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_buff.diminfo[0].strides = __pyx_pybuffernd_buff.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_buff.diminfo[0].shape = __pyx_pybuffernd_buff.rcbuffer->pybuffer.shape[0]; /* "healpy/src/_query_disc.pyx":177 * """ * # Check Nside value * if not isnsideok(nside): # <<<<<<<<<<<<<< * raise ValueError('Wrong nside value, must be a power of 2') * # Create the Healpix_Base2 structure */ __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nside); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 177; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((!(__pyx_f_6healpy_11_query_disc_isnsideok(__pyx_t_1) != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":178 * # Check Nside value * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * # Create the Healpix_Base2 structure * cdef Healpix_Ordering_Scheme scheme */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__3, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":181 * # Create the Healpix_Base2 structure * cdef Healpix_Ordering_Scheme scheme * if nest: # <<<<<<<<<<<<<< * scheme = NEST * else: */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 181; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":182 * cdef Healpix_Ordering_Scheme scheme * if nest: * scheme = NEST # <<<<<<<<<<<<<< * else: * scheme = RING */ __pyx_v_scheme = NEST; goto __pyx_L4; } /*else*/ { /* "healpy/src/_query_disc.pyx":184 * scheme = NEST * else: * scheme = RING # <<<<<<<<<<<<<< * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * # Call query_polygon */ __pyx_v_scheme = RING; } __pyx_L4:; /* "healpy/src/_query_disc.pyx":185 * else: * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # <<<<<<<<<<<<<< * # Call query_polygon * cdef rangeset[int64] pixset */ __pyx_t_4 = __Pyx_PyInt_As_int64(__pyx_v_nside); if (unlikely((__pyx_t_4 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 185; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb = T_Healpix_Base(__pyx_t_4, __pyx_v_scheme, SET_NSIDE); /* "healpy/src/_query_disc.pyx":188 * # Call query_polygon * cdef rangeset[int64] pixset * hb.query_strip(theta1, theta2, inclusive, pixset) # <<<<<<<<<<<<<< * * return pixset_to_array(pixset, buff) */ __pyx_t_5 = __pyx_PyFloat_AsDouble(__pyx_v_theta1); if (unlikely((__pyx_t_5 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_6 = __pyx_PyFloat_AsDouble(__pyx_v_theta2); if (unlikely((__pyx_t_6 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_inclusive); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 188; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb.query_strip(__pyx_t_5, __pyx_t_6, __pyx_t_2, __pyx_v_pixset); /* "healpy/src/_query_disc.pyx":190 * hb.query_strip(theta1, theta2, inclusive, pixset) * * return pixset_to_array(pixset, buff) # <<<<<<<<<<<<<< * * */ __Pyx_XDECREF(__pyx_r); __pyx_t_7.__pyx_n = 1; __pyx_t_7.buff = ((PyObject *)__pyx_v_buff); __pyx_t_3 = __pyx_f_6healpy_11_query_disc_pixset_to_array(__pyx_v_pixset, &__pyx_t_7); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 190; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_r = __pyx_t_3; __pyx_t_3 = 0; goto __pyx_L0; /* "healpy/src/_query_disc.pyx":146 * return pixset_to_array(pixset, buff) * * def query_strip(nside, theta1, theta2, inclusive = False, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the colatitude range * defined by *theta1* and *theta2* (if inclusive is False), or which */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_buff.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._query_disc.query_strip", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_buff.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_query_disc.pyx":193 * * * def _boundaries_single(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_11_query_disc_7_boundaries_single(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static PyMethodDef __pyx_mdef_6healpy_11_query_disc_7_boundaries_single = {__Pyx_NAMESTR("_boundaries_single"), (PyCFunction)__pyx_pw_6healpy_11_query_disc_7_boundaries_single, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)}; static PyObject *__pyx_pw_6healpy_11_query_disc_7_boundaries_single(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_nside = 0; PyObject *__pyx_v_pix = 0; PyObject *__pyx_v_step = 0; PyObject *__pyx_v_nest = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("_boundaries_single (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nside,&__pyx_n_s_pix,&__pyx_n_s_step,&__pyx_n_s_nest,0}; PyObject* values[4] = {0,0,0,0}; values[2] = ((PyObject *)__pyx_int_1); values[3] = ((PyObject *)Py_False); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_pix)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("_boundaries_single", 0, 2, 4, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 193; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_step); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nest); if (value) { values[3] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "_boundaries_single") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 193; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_nside = values[0]; __pyx_v_pix = values[1]; __pyx_v_step = values[2]; __pyx_v_nest = values[3]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("_boundaries_single", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 193; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._query_disc._boundaries_single", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_11_query_disc_6_boundaries_single(__pyx_self, __pyx_v_nside, __pyx_v_pix, __pyx_v_step, __pyx_v_nest); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_11_query_disc_6_boundaries_single(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_pix, PyObject *__pyx_v_step, PyObject *__pyx_v_nest) { enum Healpix_Ordering_Scheme __pyx_v_scheme; T_Healpix_Base __pyx_v_hb; std::vector __pyx_v_bounds; size_t __pyx_v_n; PyArrayObject *__pyx_v_out = 0; size_t __pyx_v_i; __Pyx_LocalBuf_ND __pyx_pybuffernd_out; __Pyx_Buffer __pyx_pybuffer_out; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int64 __pyx_t_2; PyObject *__pyx_t_3 = NULL; PyObject *__pyx_t_4 = NULL; size_t __pyx_t_5; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyObject *__pyx_t_8 = NULL; PyArrayObject *__pyx_t_9 = NULL; size_t __pyx_t_10; double __pyx_t_11; long __pyx_t_12; size_t __pyx_t_13; int __pyx_t_14; long __pyx_t_15; size_t __pyx_t_16; long __pyx_t_17; size_t __pyx_t_18; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("_boundaries_single", 0); __pyx_pybuffer_out.pybuffer.buf = NULL; __pyx_pybuffer_out.refcount = 0; __pyx_pybuffernd_out.data = NULL; __pyx_pybuffernd_out.rcbuffer = &__pyx_pybuffer_out; /* "healpy/src/_query_disc.pyx":195 * def _boundaries_single(nside, pix, step=1, nest=False): * cdef Healpix_Ordering_Scheme scheme * if nest: # <<<<<<<<<<<<<< * scheme = NEST * else: */ __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_1 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 195; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_1) { /* "healpy/src/_query_disc.pyx":196 * cdef Healpix_Ordering_Scheme scheme * if nest: * scheme = NEST # <<<<<<<<<<<<<< * else: * scheme = RING */ __pyx_v_scheme = NEST; goto __pyx_L3; } /*else*/ { /* "healpy/src/_query_disc.pyx":198 * scheme = NEST * else: * scheme = RING # <<<<<<<<<<<<<< * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * cdef vector[vec3] bounds */ __pyx_v_scheme = RING; } __pyx_L3:; /* "healpy/src/_query_disc.pyx":199 * else: * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # <<<<<<<<<<<<<< * cdef vector[vec3] bounds * if pix >= (12*nside*nside): */ __pyx_t_2 = __Pyx_PyInt_As_int64(__pyx_v_nside); if (unlikely((__pyx_t_2 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 199; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb = T_Healpix_Base(__pyx_t_2, __pyx_v_scheme, SET_NSIDE); /* "healpy/src/_query_disc.pyx":201 * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * cdef vector[vec3] bounds * if pix >= (12*nside*nside): # <<<<<<<<<<<<<< * raise ValueError('Pixel identifier is too large') * hb.boundaries(pix, step, bounds) */ __pyx_t_3 = PyNumber_Multiply(__pyx_int_12, __pyx_v_nside); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyNumber_Multiply(__pyx_t_3, __pyx_v_nside); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyObject_RichCompare(__pyx_v_pix, __pyx_t_4, Py_GE); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_1 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_1) { /* "healpy/src/_query_disc.pyx":202 * cdef vector[vec3] bounds * if pix >= (12*nside*nside): * raise ValueError('Pixel identifier is too large') # <<<<<<<<<<<<<< * hb.boundaries(pix, step, bounds) * cdef size_t n = bounds.size() */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__4, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 202; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 202; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":203 * if pix >= (12*nside*nside): * raise ValueError('Pixel identifier is too large') * hb.boundaries(pix, step, bounds) # <<<<<<<<<<<<<< * cdef size_t n = bounds.size() * cdef np.ndarray[double, ndim = 2] out = np.empty((3, n), dtype=np.float) */ __pyx_t_2 = __Pyx_PyInt_As_int64(__pyx_v_pix); if (unlikely((__pyx_t_2 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 203; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_v_step); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 203; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb.boundaries(__pyx_t_2, __pyx_t_5, __pyx_v_bounds); /* "healpy/src/_query_disc.pyx":204 * raise ValueError('Pixel identifier is too large') * hb.boundaries(pix, step, bounds) * cdef size_t n = bounds.size() # <<<<<<<<<<<<<< * cdef np.ndarray[double, ndim = 2] out = np.empty((3, n), dtype=np.float) * for i in range(n): */ __pyx_v_n = __pyx_v_bounds.size(); /* "healpy/src/_query_disc.pyx":205 * hb.boundaries(pix, step, bounds) * cdef size_t n = bounds.size() * cdef np.ndarray[double, ndim = 2] out = np.empty((3, n), dtype=np.float) # <<<<<<<<<<<<<< * for i in range(n): * out[0,i] = bounds[i].x */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_empty); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyInt_FromSize_t(__pyx_v_n); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = PyTuple_New(2); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_INCREF(__pyx_int_3); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_int_3); __Pyx_GIVEREF(__pyx_int_3); PyTuple_SET_ITEM(__pyx_t_6, 1, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_6); __Pyx_GIVEREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = PyDict_New(); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_7, __pyx_n_s_float); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (PyDict_SetItem(__pyx_t_6, __pyx_n_s_dtype, __pyx_t_8) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_3, __pyx_t_6); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (!(likely(((__pyx_t_8) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_8, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_9 = ((PyArrayObject *)__pyx_t_8); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_out.rcbuffer->pybuffer, (PyObject*)__pyx_t_9, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 2, 0, __pyx_stack) == -1)) { __pyx_v_out = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_out.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_out.diminfo[0].strides = __pyx_pybuffernd_out.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_out.diminfo[0].shape = __pyx_pybuffernd_out.rcbuffer->pybuffer.shape[0]; __pyx_pybuffernd_out.diminfo[1].strides = __pyx_pybuffernd_out.rcbuffer->pybuffer.strides[1]; __pyx_pybuffernd_out.diminfo[1].shape = __pyx_pybuffernd_out.rcbuffer->pybuffer.shape[1]; } } __pyx_t_9 = 0; __pyx_v_out = ((PyArrayObject *)__pyx_t_8); __pyx_t_8 = 0; /* "healpy/src/_query_disc.pyx":206 * cdef size_t n = bounds.size() * cdef np.ndarray[double, ndim = 2] out = np.empty((3, n), dtype=np.float) * for i in range(n): # <<<<<<<<<<<<<< * out[0,i] = bounds[i].x * out[1,i] = bounds[i].y */ __pyx_t_5 = __pyx_v_n; for (__pyx_t_10 = 0; __pyx_t_10 < __pyx_t_5; __pyx_t_10+=1) { __pyx_v_i = __pyx_t_10; /* "healpy/src/_query_disc.pyx":207 * cdef np.ndarray[double, ndim = 2] out = np.empty((3, n), dtype=np.float) * for i in range(n): * out[0,i] = bounds[i].x # <<<<<<<<<<<<<< * out[1,i] = bounds[i].y * out[2,i] = bounds[i].z */ __pyx_t_11 = (__pyx_v_bounds[__pyx_v_i]).x; __pyx_t_12 = 0; __pyx_t_13 = __pyx_v_i; __pyx_t_14 = -1; if (__pyx_t_12 < 0) { __pyx_t_12 += __pyx_pybuffernd_out.diminfo[0].shape; if (unlikely(__pyx_t_12 < 0)) __pyx_t_14 = 0; } else if (unlikely(__pyx_t_12 >= __pyx_pybuffernd_out.diminfo[0].shape)) __pyx_t_14 = 0; if (unlikely(__pyx_t_13 >= (size_t)__pyx_pybuffernd_out.diminfo[1].shape)) __pyx_t_14 = 1; if (unlikely(__pyx_t_14 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_14); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided2d(double *, __pyx_pybuffernd_out.rcbuffer->pybuffer.buf, __pyx_t_12, __pyx_pybuffernd_out.diminfo[0].strides, __pyx_t_13, __pyx_pybuffernd_out.diminfo[1].strides) = __pyx_t_11; /* "healpy/src/_query_disc.pyx":208 * for i in range(n): * out[0,i] = bounds[i].x * out[1,i] = bounds[i].y # <<<<<<<<<<<<<< * out[2,i] = bounds[i].z * return out */ __pyx_t_11 = (__pyx_v_bounds[__pyx_v_i]).y; __pyx_t_15 = 1; __pyx_t_16 = __pyx_v_i; __pyx_t_14 = -1; if (__pyx_t_15 < 0) { __pyx_t_15 += __pyx_pybuffernd_out.diminfo[0].shape; if (unlikely(__pyx_t_15 < 0)) __pyx_t_14 = 0; } else if (unlikely(__pyx_t_15 >= __pyx_pybuffernd_out.diminfo[0].shape)) __pyx_t_14 = 0; if (unlikely(__pyx_t_16 >= (size_t)__pyx_pybuffernd_out.diminfo[1].shape)) __pyx_t_14 = 1; if (unlikely(__pyx_t_14 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_14); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 208; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided2d(double *, __pyx_pybuffernd_out.rcbuffer->pybuffer.buf, __pyx_t_15, __pyx_pybuffernd_out.diminfo[0].strides, __pyx_t_16, __pyx_pybuffernd_out.diminfo[1].strides) = __pyx_t_11; /* "healpy/src/_query_disc.pyx":209 * out[0,i] = bounds[i].x * out[1,i] = bounds[i].y * out[2,i] = bounds[i].z # <<<<<<<<<<<<<< * return out * */ __pyx_t_11 = (__pyx_v_bounds[__pyx_v_i]).z; __pyx_t_17 = 2; __pyx_t_18 = __pyx_v_i; __pyx_t_14 = -1; if (__pyx_t_17 < 0) { __pyx_t_17 += __pyx_pybuffernd_out.diminfo[0].shape; if (unlikely(__pyx_t_17 < 0)) __pyx_t_14 = 0; } else if (unlikely(__pyx_t_17 >= __pyx_pybuffernd_out.diminfo[0].shape)) __pyx_t_14 = 0; if (unlikely(__pyx_t_18 >= (size_t)__pyx_pybuffernd_out.diminfo[1].shape)) __pyx_t_14 = 1; if (unlikely(__pyx_t_14 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_14); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 209; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided2d(double *, __pyx_pybuffernd_out.rcbuffer->pybuffer.buf, __pyx_t_17, __pyx_pybuffernd_out.diminfo[0].strides, __pyx_t_18, __pyx_pybuffernd_out.diminfo[1].strides) = __pyx_t_11; } /* "healpy/src/_query_disc.pyx":210 * out[1,i] = bounds[i].y * out[2,i] = bounds[i].z * return out # <<<<<<<<<<<<<< * * def _boundaries_multiple(nside, pix, step=1, nest=False): */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_out)); __pyx_r = ((PyObject *)__pyx_v_out); goto __pyx_L0; /* "healpy/src/_query_disc.pyx":193 * * * def _boundaries_single(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_XDECREF(__pyx_t_8); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_out.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._query_disc._boundaries_single", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_out.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_out); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_query_disc.pyx":212 * return out * * def _boundaries_multiple(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_11_query_disc_9_boundaries_multiple(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static PyMethodDef __pyx_mdef_6healpy_11_query_disc_9_boundaries_multiple = {__Pyx_NAMESTR("_boundaries_multiple"), (PyCFunction)__pyx_pw_6healpy_11_query_disc_9_boundaries_multiple, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)}; static PyObject *__pyx_pw_6healpy_11_query_disc_9_boundaries_multiple(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_nside = 0; PyObject *__pyx_v_pix = 0; PyObject *__pyx_v_step = 0; PyObject *__pyx_v_nest = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("_boundaries_multiple (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nside,&__pyx_n_s_pix,&__pyx_n_s_step,&__pyx_n_s_nest,0}; PyObject* values[4] = {0,0,0,0}; values[2] = ((PyObject *)__pyx_int_1); values[3] = ((PyObject *)Py_False); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_pix)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("_boundaries_multiple", 0, 2, 4, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_step); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nest); if (value) { values[3] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "_boundaries_multiple") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_nside = values[0]; __pyx_v_pix = values[1]; __pyx_v_step = values[2]; __pyx_v_nest = values[3]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("_boundaries_multiple", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._query_disc._boundaries_multiple", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_11_query_disc_8_boundaries_multiple(__pyx_self, __pyx_v_nside, __pyx_v_pix, __pyx_v_step, __pyx_v_nest); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_11_query_disc_8_boundaries_multiple(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_pix, PyObject *__pyx_v_step, PyObject *__pyx_v_nest) { enum Healpix_Ordering_Scheme __pyx_v_scheme; T_Healpix_Base __pyx_v_hb; size_t __pyx_v_npix; size_t __pyx_v_n; size_t __pyx_v_maxnpix; PyArrayObject *__pyx_v_out = 0; std::vector __pyx_v_bounds; size_t __pyx_v_j; size_t __pyx_v_i; __Pyx_LocalBuf_ND __pyx_pybuffernd_out; __Pyx_Buffer __pyx_pybuffer_out; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int64 __pyx_t_2; Py_ssize_t __pyx_t_3; PyObject *__pyx_t_4 = NULL; size_t __pyx_t_5; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyObject *__pyx_t_8 = NULL; PyObject *__pyx_t_9 = NULL; PyArrayObject *__pyx_t_10 = NULL; size_t __pyx_t_11; size_t __pyx_t_12; size_t __pyx_t_13; double __pyx_t_14; size_t __pyx_t_15; long __pyx_t_16; size_t __pyx_t_17; int __pyx_t_18; size_t __pyx_t_19; long __pyx_t_20; size_t __pyx_t_21; size_t __pyx_t_22; long __pyx_t_23; size_t __pyx_t_24; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("_boundaries_multiple", 0); __pyx_pybuffer_out.pybuffer.buf = NULL; __pyx_pybuffer_out.refcount = 0; __pyx_pybuffernd_out.data = NULL; __pyx_pybuffernd_out.rcbuffer = &__pyx_pybuffer_out; /* "healpy/src/_query_disc.pyx":214 * def _boundaries_multiple(nside, pix, step=1, nest=False): * cdef Healpix_Ordering_Scheme scheme * if nest: # <<<<<<<<<<<<<< * scheme = NEST * else: */ __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_1 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 214; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_1) { /* "healpy/src/_query_disc.pyx":215 * cdef Healpix_Ordering_Scheme scheme * if nest: * scheme = NEST # <<<<<<<<<<<<<< * else: * scheme = RING */ __pyx_v_scheme = NEST; goto __pyx_L3; } /*else*/ { /* "healpy/src/_query_disc.pyx":217 * scheme = NEST * else: * scheme = RING # <<<<<<<<<<<<<< * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * cdef size_t npix = len(pix) */ __pyx_v_scheme = RING; } __pyx_L3:; /* "healpy/src/_query_disc.pyx":218 * else: * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # <<<<<<<<<<<<<< * cdef size_t npix = len(pix) * cdef size_t n = step * 4 */ __pyx_t_2 = __Pyx_PyInt_As_int64(__pyx_v_nside); if (unlikely((__pyx_t_2 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 218; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb = T_Healpix_Base(__pyx_t_2, __pyx_v_scheme, SET_NSIDE); /* "healpy/src/_query_disc.pyx":219 * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * cdef size_t npix = len(pix) # <<<<<<<<<<<<<< * cdef size_t n = step * 4 * cdef size_t maxnpix = 12*nside*nside */ __pyx_t_3 = PyObject_Length(__pyx_v_pix); if (unlikely(__pyx_t_3 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_npix = __pyx_t_3; /* "healpy/src/_query_disc.pyx":220 * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * cdef size_t npix = len(pix) * cdef size_t n = step * 4 # <<<<<<<<<<<<<< * cdef size_t maxnpix = 12*nside*nside * cdef np.ndarray[double, ndim = 3] out = np.empty((npix, 3, n), dtype=np.float) */ __pyx_t_4 = PyNumber_Multiply(__pyx_v_step, __pyx_int_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 220; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_4); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 220; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_v_n = __pyx_t_5; /* "healpy/src/_query_disc.pyx":221 * cdef size_t npix = len(pix) * cdef size_t n = step * 4 * cdef size_t maxnpix = 12*nside*nside # <<<<<<<<<<<<<< * cdef np.ndarray[double, ndim = 3] out = np.empty((npix, 3, n), dtype=np.float) * cdef vector[vec3] bounds */ __pyx_t_4 = PyNumber_Multiply(__pyx_int_12, __pyx_v_nside); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_6 = PyNumber_Multiply(__pyx_t_4, __pyx_v_nside); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_5 = __Pyx_PyInt_As_size_t(__pyx_t_6); if (unlikely((__pyx_t_5 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_v_maxnpix = __pyx_t_5; /* "healpy/src/_query_disc.pyx":222 * cdef size_t n = step * 4 * cdef size_t maxnpix = 12*nside*nside * cdef np.ndarray[double, ndim = 3] out = np.empty((npix, 3, n), dtype=np.float) # <<<<<<<<<<<<<< * cdef vector[vec3] bounds * */ __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_empty); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_PyInt_FromSize_t(__pyx_v_npix); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = __Pyx_PyInt_FromSize_t(__pyx_v_n); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = PyTuple_New(3); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_8, 0, __pyx_t_6); __Pyx_GIVEREF(__pyx_t_6); __Pyx_INCREF(__pyx_int_3); PyTuple_SET_ITEM(__pyx_t_8, 1, __pyx_int_3); __Pyx_GIVEREF(__pyx_int_3); PyTuple_SET_ITEM(__pyx_t_8, 2, __pyx_t_7); __Pyx_GIVEREF(__pyx_t_7); __pyx_t_6 = 0; __pyx_t_7 = 0; __pyx_t_7 = PyTuple_New(1); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = PyDict_New(); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_9 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_float); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (PyDict_SetItem(__pyx_t_8, __pyx_n_s_dtype, __pyx_t_9) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_t_9 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, __pyx_t_8); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; if (!(likely(((__pyx_t_9) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_9, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_10 = ((PyArrayObject *)__pyx_t_9); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_out.rcbuffer->pybuffer, (PyObject*)__pyx_t_10, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 3, 0, __pyx_stack) == -1)) { __pyx_v_out = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_out.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_out.diminfo[0].strides = __pyx_pybuffernd_out.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_out.diminfo[0].shape = __pyx_pybuffernd_out.rcbuffer->pybuffer.shape[0]; __pyx_pybuffernd_out.diminfo[1].strides = __pyx_pybuffernd_out.rcbuffer->pybuffer.strides[1]; __pyx_pybuffernd_out.diminfo[1].shape = __pyx_pybuffernd_out.rcbuffer->pybuffer.shape[1]; __pyx_pybuffernd_out.diminfo[2].strides = __pyx_pybuffernd_out.rcbuffer->pybuffer.strides[2]; __pyx_pybuffernd_out.diminfo[2].shape = __pyx_pybuffernd_out.rcbuffer->pybuffer.shape[2]; } } __pyx_t_10 = 0; __pyx_v_out = ((PyArrayObject *)__pyx_t_9); __pyx_t_9 = 0; /* "healpy/src/_query_disc.pyx":225 * cdef vector[vec3] bounds * * for j in range(npix): # <<<<<<<<<<<<<< * if pix[j] >= maxnpix: * raise ValueError('Pixel identifier is too large') */ __pyx_t_5 = __pyx_v_npix; for (__pyx_t_11 = 0; __pyx_t_11 < __pyx_t_5; __pyx_t_11+=1) { __pyx_v_j = __pyx_t_11; /* "healpy/src/_query_disc.pyx":226 * * for j in range(npix): * if pix[j] >= maxnpix: # <<<<<<<<<<<<<< * raise ValueError('Pixel identifier is too large') * */ __pyx_t_9 = __Pyx_GetItemInt(__pyx_v_pix, __pyx_v_j, size_t, 0, __Pyx_PyInt_FromSize_t, 0, 0, 1); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 226; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_9); __pyx_t_8 = __Pyx_PyInt_FromSize_t(__pyx_v_maxnpix); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 226; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_7 = PyObject_RichCompare(__pyx_t_9, __pyx_t_8, Py_GE); __Pyx_XGOTREF(__pyx_t_7); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 226; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_t_7); if (unlikely(__pyx_t_1 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 226; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (__pyx_t_1) { /* "healpy/src/_query_disc.pyx":227 * for j in range(npix): * if pix[j] >= maxnpix: * raise ValueError('Pixel identifier is too large') # <<<<<<<<<<<<<< * * hb.boundaries(pix[j], step, bounds) */ __pyx_t_7 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__5, NULL); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_Raise(__pyx_t_7, 0, 0, 0); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":229 * raise ValueError('Pixel identifier is too large') * * hb.boundaries(pix[j], step, bounds) # <<<<<<<<<<<<<< * for i in range(n): * out[j, 0, i] = bounds[i].x */ __pyx_t_7 = __Pyx_GetItemInt(__pyx_v_pix, __pyx_v_j, size_t, 0, __Pyx_PyInt_FromSize_t, 0, 0, 1); if (unlikely(__pyx_t_7 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 229; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_7); __pyx_t_2 = __Pyx_PyInt_As_int64(__pyx_t_7); if (unlikely((__pyx_t_2 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 229; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_12 = __Pyx_PyInt_As_size_t(__pyx_v_step); if (unlikely((__pyx_t_12 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 229; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb.boundaries(__pyx_t_2, __pyx_t_12, __pyx_v_bounds); /* "healpy/src/_query_disc.pyx":230 * * hb.boundaries(pix[j], step, bounds) * for i in range(n): # <<<<<<<<<<<<<< * out[j, 0, i] = bounds[i].x * out[j, 1, i] = bounds[i].y */ __pyx_t_12 = __pyx_v_n; for (__pyx_t_13 = 0; __pyx_t_13 < __pyx_t_12; __pyx_t_13+=1) { __pyx_v_i = __pyx_t_13; /* "healpy/src/_query_disc.pyx":231 * hb.boundaries(pix[j], step, bounds) * for i in range(n): * out[j, 0, i] = bounds[i].x # <<<<<<<<<<<<<< * out[j, 1, i] = bounds[i].y * out[j, 2, i] = bounds[i].z */ __pyx_t_14 = (__pyx_v_bounds[__pyx_v_i]).x; __pyx_t_15 = __pyx_v_j; __pyx_t_16 = 0; __pyx_t_17 = __pyx_v_i; __pyx_t_18 = -1; if (unlikely(__pyx_t_15 >= (size_t)__pyx_pybuffernd_out.diminfo[0].shape)) __pyx_t_18 = 0; if (__pyx_t_16 < 0) { __pyx_t_16 += __pyx_pybuffernd_out.diminfo[1].shape; if (unlikely(__pyx_t_16 < 0)) __pyx_t_18 = 1; } else if (unlikely(__pyx_t_16 >= __pyx_pybuffernd_out.diminfo[1].shape)) __pyx_t_18 = 1; if (unlikely(__pyx_t_17 >= (size_t)__pyx_pybuffernd_out.diminfo[2].shape)) __pyx_t_18 = 2; if (unlikely(__pyx_t_18 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_18); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 231; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided3d(double *, __pyx_pybuffernd_out.rcbuffer->pybuffer.buf, __pyx_t_15, __pyx_pybuffernd_out.diminfo[0].strides, __pyx_t_16, __pyx_pybuffernd_out.diminfo[1].strides, __pyx_t_17, __pyx_pybuffernd_out.diminfo[2].strides) = __pyx_t_14; /* "healpy/src/_query_disc.pyx":232 * for i in range(n): * out[j, 0, i] = bounds[i].x * out[j, 1, i] = bounds[i].y # <<<<<<<<<<<<<< * out[j, 2, i] = bounds[i].z * return out */ __pyx_t_14 = (__pyx_v_bounds[__pyx_v_i]).y; __pyx_t_19 = __pyx_v_j; __pyx_t_20 = 1; __pyx_t_21 = __pyx_v_i; __pyx_t_18 = -1; if (unlikely(__pyx_t_19 >= (size_t)__pyx_pybuffernd_out.diminfo[0].shape)) __pyx_t_18 = 0; if (__pyx_t_20 < 0) { __pyx_t_20 += __pyx_pybuffernd_out.diminfo[1].shape; if (unlikely(__pyx_t_20 < 0)) __pyx_t_18 = 1; } else if (unlikely(__pyx_t_20 >= __pyx_pybuffernd_out.diminfo[1].shape)) __pyx_t_18 = 1; if (unlikely(__pyx_t_21 >= (size_t)__pyx_pybuffernd_out.diminfo[2].shape)) __pyx_t_18 = 2; if (unlikely(__pyx_t_18 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_18); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 232; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided3d(double *, __pyx_pybuffernd_out.rcbuffer->pybuffer.buf, __pyx_t_19, __pyx_pybuffernd_out.diminfo[0].strides, __pyx_t_20, __pyx_pybuffernd_out.diminfo[1].strides, __pyx_t_21, __pyx_pybuffernd_out.diminfo[2].strides) = __pyx_t_14; /* "healpy/src/_query_disc.pyx":233 * out[j, 0, i] = bounds[i].x * out[j, 1, i] = bounds[i].y * out[j, 2, i] = bounds[i].z # <<<<<<<<<<<<<< * return out * */ __pyx_t_14 = (__pyx_v_bounds[__pyx_v_i]).z; __pyx_t_22 = __pyx_v_j; __pyx_t_23 = 2; __pyx_t_24 = __pyx_v_i; __pyx_t_18 = -1; if (unlikely(__pyx_t_22 >= (size_t)__pyx_pybuffernd_out.diminfo[0].shape)) __pyx_t_18 = 0; if (__pyx_t_23 < 0) { __pyx_t_23 += __pyx_pybuffernd_out.diminfo[1].shape; if (unlikely(__pyx_t_23 < 0)) __pyx_t_18 = 1; } else if (unlikely(__pyx_t_23 >= __pyx_pybuffernd_out.diminfo[1].shape)) __pyx_t_18 = 1; if (unlikely(__pyx_t_24 >= (size_t)__pyx_pybuffernd_out.diminfo[2].shape)) __pyx_t_18 = 2; if (unlikely(__pyx_t_18 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_18); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 233; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided3d(double *, __pyx_pybuffernd_out.rcbuffer->pybuffer.buf, __pyx_t_22, __pyx_pybuffernd_out.diminfo[0].strides, __pyx_t_23, __pyx_pybuffernd_out.diminfo[1].strides, __pyx_t_24, __pyx_pybuffernd_out.diminfo[2].strides) = __pyx_t_14; } } /* "healpy/src/_query_disc.pyx":234 * out[j, 1, i] = bounds[i].y * out[j, 2, i] = bounds[i].z * return out # <<<<<<<<<<<<<< * * def boundaries(nside, pix, step=1, nest=False): */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_out)); __pyx_r = ((PyObject *)__pyx_v_out); goto __pyx_L0; /* "healpy/src/_query_disc.pyx":212 * return out * * def _boundaries_multiple(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_XDECREF(__pyx_t_8); __Pyx_XDECREF(__pyx_t_9); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_out.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._query_disc._boundaries_multiple", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_out.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_out); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_query_disc.pyx":236 * return out * * def boundaries(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * """Returns an array containing vectors to the boundary of * the nominated pixel. */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_11_query_disc_11boundaries(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_11_query_disc_10boundaries[] = "Returns an array containing vectors to the boundary of\n the nominated pixel.\n\n The returned array has shape (3, 4*step), the elements of\n which are the x,y,z positions on the unit sphere of the\n pixel boundary. In order to get vector positions for just\n the corners, specify step=1.\n\n Parameters\n ----------\n nside : int\n The nside of the Healpix map.\n pix : int\n Pixel identifier\n step : int, optional\n Number of elements for each side of the pixel.\n nest : bool, optional\n if True, assume NESTED pixel ordering, otherwise, RING pixel ordering\n\n Returns\n -------\n boundary : float, array\n x,y,z for positions on the boundary of the pixel\n\n Example\n -------\n # Get corners of HEALPixel 5 in nside=2, RINGS ordering.\n\n >>> import healpy as hp\n >>> import numpy as np\n >>> nside = 2\n >>> corners = hp.boundaries(nside, 5)\n\n # Now convert to phi,theta representation:\n >>> phi_theta = hp.vec2ang(np.transpose(corners))\n\n >>> corners = hp.boundaries(nside, np.array([5,5]))\n\n # doctest moved to test_query_disc.py\n "; static PyMethodDef __pyx_mdef_6healpy_11_query_disc_11boundaries = {__Pyx_NAMESTR("boundaries"), (PyCFunction)__pyx_pw_6healpy_11_query_disc_11boundaries, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_11_query_disc_10boundaries)}; static PyObject *__pyx_pw_6healpy_11_query_disc_11boundaries(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_nside = 0; PyObject *__pyx_v_pix = 0; PyObject *__pyx_v_step = 0; PyObject *__pyx_v_nest = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("boundaries (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nside,&__pyx_n_s_pix,&__pyx_n_s_step,&__pyx_n_s_nest,0}; PyObject* values[4] = {0,0,0,0}; values[2] = ((PyObject *)__pyx_int_1); values[3] = ((PyObject *)Py_False); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_pix)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("boundaries", 0, 2, 4, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 236; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_step); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nest); if (value) { values[3] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "boundaries") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 236; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_nside = values[0]; __pyx_v_pix = values[1]; __pyx_v_step = values[2]; __pyx_v_nest = values[3]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("boundaries", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 236; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._query_disc.boundaries", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_11_query_disc_10boundaries(__pyx_self, __pyx_v_nside, __pyx_v_pix, __pyx_v_step, __pyx_v_nest); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_11_query_disc_10boundaries(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyObject *__pyx_v_pix, PyObject *__pyx_v_step, PyObject *__pyx_v_nest) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; int __pyx_t_4; int __pyx_t_5; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyObject *__pyx_t_8 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("boundaries", 0); /* "healpy/src/_query_disc.pyx":278 * """ * * if not isnsideok(nside): # <<<<<<<<<<<<<< * raise ValueError('Wrong nside value, must be a power of 2') * if isinstance(pix, (int, long)): */ __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nside); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 278; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((!(__pyx_f_6healpy_11_query_disc_isnsideok(__pyx_t_1) != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":279 * * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * if isinstance(pix, (int, long)): * return _boundaries_single(nside, pix, step=step, nest=nest) */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__6, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":280 * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') * if isinstance(pix, (int, long)): # <<<<<<<<<<<<<< * return _boundaries_single(nside, pix, step=step, nest=nest) * if type(pix) is np.ndarray: */ __pyx_t_2 = PyInt_Check(__pyx_v_pix); if (!__pyx_t_2) { __pyx_t_4 = PyLong_Check(__pyx_v_pix); __pyx_t_5 = __pyx_t_4; } else { __pyx_t_5 = __pyx_t_2; } __pyx_t_2 = (__pyx_t_5 != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":281 * raise ValueError('Wrong nside value, must be a power of 2') * if isinstance(pix, (int, long)): * return _boundaries_single(nside, pix, step=step, nest=nest) # <<<<<<<<<<<<<< * if type(pix) is np.ndarray: * if not issubclass(pix.dtype.type, np.integer): */ __Pyx_XDECREF(__pyx_r); __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_boundaries_single); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = PyTuple_New(2); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_INCREF(__pyx_v_nside); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_v_nside); __Pyx_GIVEREF(__pyx_v_nside); __Pyx_INCREF(__pyx_v_pix); PyTuple_SET_ITEM(__pyx_t_6, 1, __pyx_v_pix); __Pyx_GIVEREF(__pyx_v_pix); __pyx_t_7 = PyDict_New(); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); if (PyDict_SetItem(__pyx_t_7, __pyx_n_s_step, __pyx_v_step) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (PyDict_SetItem(__pyx_t_7, __pyx_n_s_nest, __pyx_v_nest) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_6, __pyx_t_7); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_r = __pyx_t_8; __pyx_t_8 = 0; goto __pyx_L0; } /* "healpy/src/_query_disc.pyx":282 * if isinstance(pix, (int, long)): * return _boundaries_single(nside, pix, step=step, nest=nest) * if type(pix) is np.ndarray: # <<<<<<<<<<<<<< * if not issubclass(pix.dtype.type, np.integer): * raise ValueError('Array of pixels has to be integers') */ __pyx_t_2 = (((PyObject *)Py_TYPE(__pyx_v_pix)) == ((PyObject *)((PyObject*)__pyx_ptype_5numpy_ndarray))); __pyx_t_5 = (__pyx_t_2 != 0); if (__pyx_t_5) { /* "healpy/src/_query_disc.pyx":283 * return _boundaries_single(nside, pix, step=step, nest=nest) * if type(pix) is np.ndarray: * if not issubclass(pix.dtype.type, np.integer): # <<<<<<<<<<<<<< * raise ValueError('Array of pixels has to be integers') * if pix.ndim!=1: */ __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_v_pix, __pyx_n_s_dtype); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_t_8, __pyx_n_s_type); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_8, __pyx_n_s_integer); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_5 = PyObject_IsSubclass(__pyx_t_7, __pyx_t_6); if (unlikely(__pyx_t_5 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_2 = ((!(__pyx_t_5 != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":284 * if type(pix) is np.ndarray: * if not issubclass(pix.dtype.type, np.integer): * raise ValueError('Array of pixels has to be integers') # <<<<<<<<<<<<<< * if pix.ndim!=1: * raise ValueError('Array has to one dimensional') */ __pyx_t_6 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__7, NULL); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 284; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_Raise(__pyx_t_6, 0, 0, 0); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 284; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":285 * if not issubclass(pix.dtype.type, np.integer): * raise ValueError('Array of pixels has to be integers') * if pix.ndim!=1: # <<<<<<<<<<<<<< * raise ValueError('Array has to one dimensional') * return _boundaries_multiple(nside, pix, step=step, nest=nest) */ __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_v_pix, __pyx_n_s_ndim); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 285; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = PyObject_RichCompare(__pyx_t_6, __pyx_int_1, Py_NE); __Pyx_XGOTREF(__pyx_t_7); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 285; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_7); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 285; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":286 * raise ValueError('Array of pixels has to be integers') * if pix.ndim!=1: * raise ValueError('Array has to one dimensional') # <<<<<<<<<<<<<< * return _boundaries_multiple(nside, pix, step=step, nest=nest) * */ __pyx_t_7 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__8, NULL); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_Raise(__pyx_t_7, 0, 0, 0); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":287 * if pix.ndim!=1: * raise ValueError('Array has to one dimensional') * return _boundaries_multiple(nside, pix, step=step, nest=nest) # <<<<<<<<<<<<<< * * # Try to implement pix2ang */ __Pyx_XDECREF(__pyx_r); __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_boundaries_multiple); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 287; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_6 = PyTuple_New(2); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 287; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_INCREF(__pyx_v_nside); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_v_nside); __Pyx_GIVEREF(__pyx_v_nside); __Pyx_INCREF(__pyx_v_pix); PyTuple_SET_ITEM(__pyx_t_6, 1, __pyx_v_pix); __Pyx_GIVEREF(__pyx_v_pix); __pyx_t_8 = PyDict_New(); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 287; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); if (PyDict_SetItem(__pyx_t_8, __pyx_n_s_step, __pyx_v_step) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 287; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (PyDict_SetItem(__pyx_t_8, __pyx_n_s_nest, __pyx_v_nest) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 287; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_6, __pyx_t_8); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 287; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_r = __pyx_t_3; __pyx_t_3 = 0; goto __pyx_L0; } /* "healpy/src/_query_disc.pyx":236 * return out * * def boundaries(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * """Returns an array containing vectors to the boundary of * the nominated pixel. */ /* function exit code */ __pyx_r = Py_None; __Pyx_INCREF(Py_None); goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_XDECREF(__pyx_t_8); __Pyx_AddTraceback("healpy._query_disc.boundaries", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_query_disc.pyx":320 * @cython.boundscheck(False) * @cython.wraparound(False) * cdef pixset_to_array(rangeset[int64] &pixset, buff=None): # <<<<<<<<<<<<<< * cdef int64 i, n * n = pixset.nval() */ static PyObject *__pyx_f_6healpy_11_query_disc_pixset_to_array(rangeset &__pyx_v_pixset, struct __pyx_opt_args_6healpy_11_query_disc_pixset_to_array *__pyx_optional_args) { PyObject *__pyx_v_buff = ((PyObject *)Py_None); int64 __pyx_v_i; int64 __pyx_v_n; PyArrayObject *__pyx_v_ipix = 0; int64 __pyx_v_a; int64 __pyx_v_b; int64 __pyx_v_ii; int64 __pyx_v_ip; __Pyx_LocalBuf_ND __pyx_pybuffernd_ipix; __Pyx_Buffer __pyx_pybuffer_ipix; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; PyObject *__pyx_t_4 = NULL; PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyArrayObject *__pyx_t_8 = NULL; int __pyx_t_9; PyObject *__pyx_t_10 = NULL; PyObject *__pyx_t_11 = NULL; PyObject *__pyx_t_12 = NULL; Py_ssize_t __pyx_t_13; int64 __pyx_t_14; int64 __pyx_t_15; int64 __pyx_t_16; int64 __pyx_t_17; int64 __pyx_t_18; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("pixset_to_array", 0); if (__pyx_optional_args) { if (__pyx_optional_args->__pyx_n > 0) { __pyx_v_buff = __pyx_optional_args->buff; } } __pyx_pybuffer_ipix.pybuffer.buf = NULL; __pyx_pybuffer_ipix.refcount = 0; __pyx_pybuffernd_ipix.data = NULL; __pyx_pybuffernd_ipix.rcbuffer = &__pyx_pybuffer_ipix; /* "healpy/src/_query_disc.pyx":322 * cdef pixset_to_array(rangeset[int64] &pixset, buff=None): * cdef int64 i, n * n = pixset.nval() # <<<<<<<<<<<<<< * cdef np.ndarray[np.int64_t, ndim=1] ipix * */ __pyx_v_n = __pyx_v_pixset.nval(); /* "healpy/src/_query_disc.pyx":325 * cdef np.ndarray[np.int64_t, ndim=1] ipix * * if buff is None : # <<<<<<<<<<<<<< * ipix = np.empty(n, dtype=np.int64) * else : */ __pyx_t_1 = (__pyx_v_buff == Py_None); __pyx_t_2 = (__pyx_t_1 != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":326 * * if buff is None : * ipix = np.empty(n, dtype=np.int64) # <<<<<<<<<<<<<< * else : * if n>=len(buff) : */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_empty); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyInt_From_int64(__pyx_v_n); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyDict_New(); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_int64); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (PyDict_SetItem(__pyx_t_3, __pyx_n_s_dtype, __pyx_t_7) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_5, __pyx_t_3); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (!(likely(((__pyx_t_7) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_7, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_8 = ((PyArrayObject *)__pyx_t_7); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer); __pyx_t_9 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer, (PyObject*)__pyx_t_8, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack); if (unlikely(__pyx_t_9 < 0)) { PyErr_Fetch(&__pyx_t_10, &__pyx_t_11, &__pyx_t_12); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer, (PyObject*)__pyx_v_ipix, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_10); Py_XDECREF(__pyx_t_11); Py_XDECREF(__pyx_t_12); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_10, __pyx_t_11, __pyx_t_12); } } __pyx_pybuffernd_ipix.diminfo[0].strides = __pyx_pybuffernd_ipix.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_ipix.diminfo[0].shape = __pyx_pybuffernd_ipix.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_9 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 326; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_8 = 0; __pyx_v_ipix = ((PyArrayObject *)__pyx_t_7); __pyx_t_7 = 0; goto __pyx_L3; } /*else*/ { /* "healpy/src/_query_disc.pyx":328 * ipix = np.empty(n, dtype=np.int64) * else : * if n>=len(buff) : # <<<<<<<<<<<<<< * raise ValueError("Buffer too small to contain return value") * ipix = buff[:n] */ __pyx_t_13 = PyObject_Length(__pyx_v_buff); if (unlikely(__pyx_t_13 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 328; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((__pyx_v_n >= __pyx_t_13) != 0); if (__pyx_t_2) { /* "healpy/src/_query_disc.pyx":329 * else : * if n>=len(buff) : * raise ValueError("Buffer too small to contain return value") # <<<<<<<<<<<<<< * ipix = buff[:n] * */ __pyx_t_7 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__9, NULL); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 329; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_Raise(__pyx_t_7, 0, 0, 0); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 329; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_query_disc.pyx":330 * if n>=len(buff) : * raise ValueError("Buffer too small to contain return value") * ipix = buff[:n] # <<<<<<<<<<<<<< * * cdef int64 a, b, ii, ip */ __pyx_t_7 = __Pyx_PyObject_GetSlice(__pyx_v_buff, 0, __pyx_v_n, NULL, NULL, NULL, 0, 1, 0); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 330; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); if (!(likely(((__pyx_t_7) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_7, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 330; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_8 = ((PyArrayObject *)__pyx_t_7); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer); __pyx_t_9 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer, (PyObject*)__pyx_t_8, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack); if (unlikely(__pyx_t_9 < 0)) { PyErr_Fetch(&__pyx_t_12, &__pyx_t_11, &__pyx_t_10); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer, (PyObject*)__pyx_v_ipix, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int64_t, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_12); Py_XDECREF(__pyx_t_11); Py_XDECREF(__pyx_t_10); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_12, __pyx_t_11, __pyx_t_10); } } __pyx_pybuffernd_ipix.diminfo[0].strides = __pyx_pybuffernd_ipix.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_ipix.diminfo[0].shape = __pyx_pybuffernd_ipix.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_9 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 330; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_8 = 0; __pyx_v_ipix = ((PyArrayObject *)__pyx_t_7); __pyx_t_7 = 0; } __pyx_L3:; /* "healpy/src/_query_disc.pyx":333 * * cdef int64 a, b, ii, ip * ii = 0 # <<<<<<<<<<<<<< * n = pixset.size() * for i in range(n): */ __pyx_v_ii = 0; /* "healpy/src/_query_disc.pyx":334 * cdef int64 a, b, ii, ip * ii = 0 * n = pixset.size() # <<<<<<<<<<<<<< * for i in range(n): * a = pixset.ivbegin(i) */ __pyx_v_n = __pyx_v_pixset.size(); /* "healpy/src/_query_disc.pyx":335 * ii = 0 * n = pixset.size() * for i in range(n): # <<<<<<<<<<<<<< * a = pixset.ivbegin(i) * b = pixset.ivend(i) */ __pyx_t_14 = __pyx_v_n; for (__pyx_t_15 = 0; __pyx_t_15 < __pyx_t_14; __pyx_t_15+=1) { __pyx_v_i = __pyx_t_15; /* "healpy/src/_query_disc.pyx":336 * n = pixset.size() * for i in range(n): * a = pixset.ivbegin(i) # <<<<<<<<<<<<<< * b = pixset.ivend(i) * for ip in range(a, b): */ __pyx_v_a = __pyx_v_pixset.ivbegin(__pyx_v_i); /* "healpy/src/_query_disc.pyx":337 * for i in range(n): * a = pixset.ivbegin(i) * b = pixset.ivend(i) # <<<<<<<<<<<<<< * for ip in range(a, b): * ipix[ii] = ip */ __pyx_v_b = __pyx_v_pixset.ivend(__pyx_v_i); /* "healpy/src/_query_disc.pyx":338 * a = pixset.ivbegin(i) * b = pixset.ivend(i) * for ip in range(a, b): # <<<<<<<<<<<<<< * ipix[ii] = ip * ii += 1 */ __pyx_t_16 = __pyx_v_b; for (__pyx_t_17 = __pyx_v_a; __pyx_t_17 < __pyx_t_16; __pyx_t_17+=1) { __pyx_v_ip = __pyx_t_17; /* "healpy/src/_query_disc.pyx":339 * b = pixset.ivend(i) * for ip in range(a, b): * ipix[ii] = ip # <<<<<<<<<<<<<< * ii += 1 * return ipix */ __pyx_t_18 = __pyx_v_ii; *__Pyx_BufPtrStrided1d(__pyx_t_5numpy_int64_t *, __pyx_pybuffernd_ipix.rcbuffer->pybuffer.buf, __pyx_t_18, __pyx_pybuffernd_ipix.diminfo[0].strides) = __pyx_v_ip; /* "healpy/src/_query_disc.pyx":340 * for ip in range(a, b): * ipix[ii] = ip * ii += 1 # <<<<<<<<<<<<<< * return ipix * */ __pyx_v_ii = (__pyx_v_ii + 1); } } /* "healpy/src/_query_disc.pyx":341 * ipix[ii] = ip * ii += 1 * return ipix # <<<<<<<<<<<<<< * * cdef bool isnsideok(int nside): */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_ipix)); __pyx_r = ((PyObject *)__pyx_v_ipix); goto __pyx_L0; /* "healpy/src/_query_disc.pyx":320 * @cython.boundscheck(False) * @cython.wraparound(False) * cdef pixset_to_array(rangeset[int64] &pixset, buff=None): # <<<<<<<<<<<<<< * cdef int64 i, n * n = pixset.nval() */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._query_disc.pixset_to_array", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ipix.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_ipix); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_query_disc.pyx":343 * return ipix * * cdef bool isnsideok(int nside): # <<<<<<<<<<<<<< * return nside > 0 and ((nside & (nside -1))==0) * */ static bool __pyx_f_6healpy_11_query_disc_isnsideok(int __pyx_v_nside) { bool __pyx_r; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; int __pyx_t_3; __Pyx_RefNannySetupContext("isnsideok", 0); /* "healpy/src/_query_disc.pyx":344 * * cdef bool isnsideok(int nside): * return nside > 0 and ((nside & (nside -1))==0) # <<<<<<<<<<<<<< * * */ __pyx_t_1 = (__pyx_v_nside > 0); if (__pyx_t_1) { __pyx_t_2 = ((__pyx_v_nside & (__pyx_v_nside - 1)) == 0); __pyx_t_3 = __pyx_t_2; } else { __pyx_t_3 = __pyx_t_1; } __pyx_r = __pyx_t_3; goto __pyx_L0; /* "healpy/src/_query_disc.pyx":343 * return ipix * * cdef bool isnsideok(int nside): # <<<<<<<<<<<<<< * return nside > 0 and ((nside & (nside -1))==0) * */ /* function exit code */ __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "_common.pxd":124 * tsize Num_Alms (int l, int m) * * cdef inline Healpix_Map[double]* ndarray2map(np.ndarray[np.float64_t, ndim=1, mode='c'] array, Healpix_Ordering_Scheme scheme) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as a Healpix Map. """ * # To ensure that the output map is a view of the input array, the latter */ static CYTHON_INLINE Healpix_Map *__pyx_f_7_common_ndarray2map(PyArrayObject *__pyx_v_array, enum Healpix_Ordering_Scheme __pyx_v_scheme) { arr *__pyx_v_a; Healpix_Map *__pyx_v_map; __Pyx_LocalBuf_ND __pyx_pybuffernd_array; __Pyx_Buffer __pyx_pybuffer_array; Healpix_Map *__pyx_r; __Pyx_RefNannyDeclarations long __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; size_t __pyx_t_4; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("ndarray2map", 0); __pyx_pybuffer_array.pybuffer.buf = NULL; __pyx_pybuffer_array.refcount = 0; __pyx_pybuffernd_array.data = NULL; __pyx_pybuffernd_array.rcbuffer = &__pyx_pybuffer_array; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_array.rcbuffer->pybuffer, (PyObject*)__pyx_v_array, &__Pyx_TypeInfo_nn___pyx_t_5numpy_float64_t, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 124; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_array.diminfo[0].strides = __pyx_pybuffernd_array.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_array.diminfo[0].shape = __pyx_pybuffernd_array.rcbuffer->pybuffer.shape[0]; /* "_common.pxd":129 * # is forced to be contiguous, of correct type and dimensions (otherwise, an * # exception is raised). * cdef arr[double] *a = new arr[double](&array[0], array.size) # <<<<<<<<<<<<<< * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) */ __pyx_t_1 = 0; __pyx_t_2 = -1; if (__pyx_t_1 < 0) { __pyx_t_1 += __pyx_pybuffernd_array.diminfo[0].shape; if (unlikely(__pyx_t_1 < 0)) __pyx_t_2 = 0; } else if (unlikely(__pyx_t_1 >= __pyx_pybuffernd_array.diminfo[0].shape)) __pyx_t_2 = 0; if (unlikely(__pyx_t_2 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_2); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 129; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_array), __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 129; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_size_t(__pyx_t_3); if (unlikely((__pyx_t_4 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 129; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_a = new arr((&(*__Pyx_BufPtrCContig1d(__pyx_t_5numpy_float64_t *, __pyx_pybuffernd_array.rcbuffer->pybuffer.buf, __pyx_t_1, __pyx_pybuffernd_array.diminfo[0].strides))), __pyx_t_4); /* "_common.pxd":130 * # exception is raised). * cdef arr[double] *a = new arr[double](&array[0], array.size) * cdef Healpix_Map[double] *map = new Healpix_Map[double]() # <<<<<<<<<<<<<< * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated */ __pyx_v_map = new Healpix_Map(); /* "_common.pxd":131 * cdef arr[double] *a = new arr[double](&array[0], array.size) * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) # <<<<<<<<<<<<<< * del a # a does not own its buffer, so it won't be deallocated * return map */ __pyx_v_map->Set((__pyx_v_a[0]), __pyx_v_scheme); /* "_common.pxd":132 * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated # <<<<<<<<<<<<<< * return map * */ delete __pyx_v_a; /* "_common.pxd":133 * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated * return map # <<<<<<<<<<<<<< * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: */ __pyx_r = __pyx_v_map; goto __pyx_L0; /* "_common.pxd":124 * tsize Num_Alms (int l, int m) * * cdef inline Healpix_Map[double]* ndarray2map(np.ndarray[np.float64_t, ndim=1, mode='c'] array, Healpix_Ordering_Scheme scheme) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as a Healpix Map. """ * # To ensure that the output map is a view of the input array, the latter */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("_common.ndarray2map", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __pyx_L2:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "_common.pxd":135 * return map * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) */ static CYTHON_INLINE Alm > *__pyx_f_7_common_ndarray2alm(PyArrayObject *__pyx_v_array, int __pyx_v_lmax, int __pyx_v_mmax) { arr > *__pyx_v_a; Alm > *__pyx_v_alm; __Pyx_LocalBuf_ND __pyx_pybuffernd_array; __Pyx_Buffer __pyx_pybuffer_array; Alm > *__pyx_r; __Pyx_RefNannyDeclarations long __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; size_t __pyx_t_4; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("ndarray2alm", 0); __pyx_pybuffer_array.pybuffer.buf = NULL; __pyx_pybuffer_array.refcount = 0; __pyx_pybuffernd_array.data = NULL; __pyx_pybuffernd_array.rcbuffer = &__pyx_pybuffer_array; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_array.rcbuffer->pybuffer, (PyObject*)__pyx_v_array, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 135; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_array.diminfo[0].strides = __pyx_pybuffernd_array.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_array.diminfo[0].shape = __pyx_pybuffernd_array.rcbuffer->pybuffer.shape[0]; /* "_common.pxd":137 * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) # <<<<<<<<<<<<<< * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) */ __pyx_t_1 = 0; __pyx_t_2 = -1; if (__pyx_t_1 < 0) { __pyx_t_1 += __pyx_pybuffernd_array.diminfo[0].shape; if (unlikely(__pyx_t_1 < 0)) __pyx_t_2 = 0; } else if (unlikely(__pyx_t_1 >= __pyx_pybuffernd_array.diminfo[0].shape)) __pyx_t_2 = 0; if (unlikely(__pyx_t_2 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_2); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 137; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_array), __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 137; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_size_t(__pyx_t_3); if (unlikely((__pyx_t_4 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 137; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_a = new arr >(((xcomplex *)(&(*__Pyx_BufPtrCContig1d(__pyx_t_double_complex *, __pyx_pybuffernd_array.rcbuffer->pybuffer.buf, __pyx_t_1, __pyx_pybuffernd_array.diminfo[0].strides)))), __pyx_t_4); /* "_common.pxd":138 * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() # <<<<<<<<<<<<<< * alm.Set(a[0], lmax, mmax) * del a */ __pyx_v_alm = new Alm >(); /* "_common.pxd":139 * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) # <<<<<<<<<<<<<< * del a * return alm */ __pyx_v_alm->Set((__pyx_v_a[0]), __pyx_v_lmax, __pyx_v_mmax); /* "_common.pxd":140 * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) * del a # <<<<<<<<<<<<<< * return alm */ delete __pyx_v_a; /* "_common.pxd":141 * alm.Set(a[0], lmax, mmax) * del a * return alm # <<<<<<<<<<<<<< */ __pyx_r = __pyx_v_alm; goto __pyx_L0; /* "_common.pxd":135 * return map * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("_common.ndarray2alm", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __pyx_L2:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":194 * # experimental exception made for __getbuffer__ and __releasebuffer__ * # -- the details of this may change. * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<< * # This implementation of getbuffer is geared towards Cython * # requirements, and does not yet fullfill the PEP. */ /* Python wrapper */ static CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /*proto*/ static CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) { int __pyx_r; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__getbuffer__ (wrapper)", 0); __pyx_r = __pyx_pf_5numpy_7ndarray___getbuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info), ((int)__pyx_v_flags)); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) { int __pyx_v_copy_shape; int __pyx_v_i; int __pyx_v_ndim; int __pyx_v_endian_detector; int __pyx_v_little_endian; int __pyx_v_t; char *__pyx_v_f; PyArray_Descr *__pyx_v_descr = 0; int __pyx_v_offset; int __pyx_v_hasfields; int __pyx_r; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; int __pyx_t_3; PyObject *__pyx_t_4 = NULL; int __pyx_t_5; int __pyx_t_6; int __pyx_t_7; PyObject *__pyx_t_8 = NULL; char *__pyx_t_9; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("__getbuffer__", 0); if (__pyx_v_info != NULL) { __pyx_v_info->obj = Py_None; __Pyx_INCREF(Py_None); __Pyx_GIVEREF(__pyx_v_info->obj); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":200 * # of flags * * if info == NULL: return # <<<<<<<<<<<<<< * * cdef int copy_shape, i, ndim */ __pyx_t_1 = ((__pyx_v_info == NULL) != 0); if (__pyx_t_1) { __pyx_r = 0; goto __pyx_L0; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":203 * * cdef int copy_shape, i, ndim * cdef int endian_detector = 1 # <<<<<<<<<<<<<< * cdef bint little_endian = ((&endian_detector)[0] != 0) * */ __pyx_v_endian_detector = 1; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":204 * cdef int copy_shape, i, ndim * cdef int endian_detector = 1 * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<< * * ndim = PyArray_NDIM(self) */ __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":206 * cdef bint little_endian = ((&endian_detector)[0] != 0) * * ndim = PyArray_NDIM(self) # <<<<<<<<<<<<<< * * if sizeof(npy_intp) != sizeof(Py_ssize_t): */ __pyx_v_ndim = PyArray_NDIM(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":208 * ndim = PyArray_NDIM(self) * * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<< * copy_shape = 1 * else: */ __pyx_t_1 = (((sizeof(npy_intp)) != (sizeof(Py_ssize_t))) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":209 * * if sizeof(npy_intp) != sizeof(Py_ssize_t): * copy_shape = 1 # <<<<<<<<<<<<<< * else: * copy_shape = 0 */ __pyx_v_copy_shape = 1; goto __pyx_L4; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":211 * copy_shape = 1 * else: * copy_shape = 0 # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) */ __pyx_v_copy_shape = 0; } __pyx_L4:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":213 * copy_shape = 0 * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) # <<<<<<<<<<<<<< * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") */ __pyx_t_1 = (((__pyx_v_flags & PyBUF_C_CONTIGUOUS) == PyBUF_C_CONTIGUOUS) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":214 * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): # <<<<<<<<<<<<<< * raise ValueError(u"ndarray is not C contiguous") * */ __pyx_t_2 = ((!(PyArray_CHKFLAGS(__pyx_v_self, NPY_C_CONTIGUOUS) != 0)) != 0); __pyx_t_3 = __pyx_t_2; } else { __pyx_t_3 = __pyx_t_1; } if (__pyx_t_3) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":215 * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__10, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":217 * raise ValueError(u"ndarray is not C contiguous") * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) # <<<<<<<<<<<<<< * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") */ __pyx_t_3 = (((__pyx_v_flags & PyBUF_F_CONTIGUOUS) == PyBUF_F_CONTIGUOUS) != 0); if (__pyx_t_3) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":218 * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): # <<<<<<<<<<<<<< * raise ValueError(u"ndarray is not Fortran contiguous") * */ __pyx_t_1 = ((!(PyArray_CHKFLAGS(__pyx_v_self, NPY_F_CONTIGUOUS) != 0)) != 0); __pyx_t_2 = __pyx_t_1; } else { __pyx_t_2 = __pyx_t_3; } if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":219 * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") # <<<<<<<<<<<<<< * * info.buf = PyArray_DATA(self) */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__11, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":221 * raise ValueError(u"ndarray is not Fortran contiguous") * * info.buf = PyArray_DATA(self) # <<<<<<<<<<<<<< * info.ndim = ndim * if copy_shape: */ __pyx_v_info->buf = PyArray_DATA(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":222 * * info.buf = PyArray_DATA(self) * info.ndim = ndim # <<<<<<<<<<<<<< * if copy_shape: * # Allocate new buffer for strides and shape info. */ __pyx_v_info->ndim = __pyx_v_ndim; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":223 * info.buf = PyArray_DATA(self) * info.ndim = ndim * if copy_shape: # <<<<<<<<<<<<<< * # Allocate new buffer for strides and shape info. * # This is allocated as one block, strides first. */ __pyx_t_2 = (__pyx_v_copy_shape != 0); if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":226 * # Allocate new buffer for strides and shape info. * # This is allocated as one block, strides first. * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) # <<<<<<<<<<<<<< * info.shape = info.strides + ndim * for i in range(ndim): */ __pyx_v_info->strides = ((Py_ssize_t *)malloc((((sizeof(Py_ssize_t)) * ((size_t)__pyx_v_ndim)) * 2))); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":227 * # This is allocated as one block, strides first. * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) * info.shape = info.strides + ndim # <<<<<<<<<<<<<< * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] */ __pyx_v_info->shape = (__pyx_v_info->strides + __pyx_v_ndim); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":228 * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) * info.shape = info.strides + ndim * for i in range(ndim): # <<<<<<<<<<<<<< * info.strides[i] = PyArray_STRIDES(self)[i] * info.shape[i] = PyArray_DIMS(self)[i] */ __pyx_t_5 = __pyx_v_ndim; for (__pyx_t_6 = 0; __pyx_t_6 < __pyx_t_5; __pyx_t_6+=1) { __pyx_v_i = __pyx_t_6; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":229 * info.shape = info.strides + ndim * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] # <<<<<<<<<<<<<< * info.shape[i] = PyArray_DIMS(self)[i] * else: */ (__pyx_v_info->strides[__pyx_v_i]) = (PyArray_STRIDES(__pyx_v_self)[__pyx_v_i]); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":230 * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] * info.shape[i] = PyArray_DIMS(self)[i] # <<<<<<<<<<<<<< * else: * info.strides = PyArray_STRIDES(self) */ (__pyx_v_info->shape[__pyx_v_i]) = (PyArray_DIMS(__pyx_v_self)[__pyx_v_i]); } goto __pyx_L7; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":232 * info.shape[i] = PyArray_DIMS(self)[i] * else: * info.strides = PyArray_STRIDES(self) # <<<<<<<<<<<<<< * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL */ __pyx_v_info->strides = ((Py_ssize_t *)PyArray_STRIDES(__pyx_v_self)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":233 * else: * info.strides = PyArray_STRIDES(self) * info.shape = PyArray_DIMS(self) # <<<<<<<<<<<<<< * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) */ __pyx_v_info->shape = ((Py_ssize_t *)PyArray_DIMS(__pyx_v_self)); } __pyx_L7:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":234 * info.strides = PyArray_STRIDES(self) * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL # <<<<<<<<<<<<<< * info.itemsize = PyArray_ITEMSIZE(self) * info.readonly = not PyArray_ISWRITEABLE(self) */ __pyx_v_info->suboffsets = NULL; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":235 * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) # <<<<<<<<<<<<<< * info.readonly = not PyArray_ISWRITEABLE(self) * */ __pyx_v_info->itemsize = PyArray_ITEMSIZE(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":236 * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) * info.readonly = not PyArray_ISWRITEABLE(self) # <<<<<<<<<<<<<< * * cdef int t */ __pyx_v_info->readonly = (!(PyArray_ISWRITEABLE(__pyx_v_self) != 0)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":239 * * cdef int t * cdef char* f = NULL # <<<<<<<<<<<<<< * cdef dtype descr = self.descr * cdef list stack */ __pyx_v_f = NULL; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":240 * cdef int t * cdef char* f = NULL * cdef dtype descr = self.descr # <<<<<<<<<<<<<< * cdef list stack * cdef int offset */ __pyx_t_4 = ((PyObject *)__pyx_v_self->descr); __Pyx_INCREF(__pyx_t_4); __pyx_v_descr = ((PyArray_Descr *)__pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":244 * cdef int offset * * cdef bint hasfields = PyDataType_HASFIELDS(descr) # <<<<<<<<<<<<<< * * if not hasfields and not copy_shape: */ __pyx_v_hasfields = PyDataType_HASFIELDS(__pyx_v_descr); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":246 * cdef bint hasfields = PyDataType_HASFIELDS(descr) * * if not hasfields and not copy_shape: # <<<<<<<<<<<<<< * # do not call releasebuffer * info.obj = None */ __pyx_t_2 = ((!(__pyx_v_hasfields != 0)) != 0); if (__pyx_t_2) { __pyx_t_3 = ((!(__pyx_v_copy_shape != 0)) != 0); __pyx_t_1 = __pyx_t_3; } else { __pyx_t_1 = __pyx_t_2; } if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":248 * if not hasfields and not copy_shape: * # do not call releasebuffer * info.obj = None # <<<<<<<<<<<<<< * else: * # need to call releasebuffer */ __Pyx_INCREF(Py_None); __Pyx_GIVEREF(Py_None); __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = Py_None; goto __pyx_L10; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":251 * else: * # need to call releasebuffer * info.obj = self # <<<<<<<<<<<<<< * * if not hasfields: */ __Pyx_INCREF(((PyObject *)__pyx_v_self)); __Pyx_GIVEREF(((PyObject *)__pyx_v_self)); __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = ((PyObject *)__pyx_v_self); } __pyx_L10:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":253 * info.obj = self * * if not hasfields: # <<<<<<<<<<<<<< * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or */ __pyx_t_1 = ((!(__pyx_v_hasfields != 0)) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":254 * * if not hasfields: * t = descr.type_num # <<<<<<<<<<<<<< * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): */ __pyx_t_5 = __pyx_v_descr->type_num; __pyx_v_t = __pyx_t_5; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":255 * if not hasfields: * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<< * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") */ __pyx_t_1 = ((__pyx_v_descr->byteorder == '>') != 0); if (__pyx_t_1) { __pyx_t_2 = (__pyx_v_little_endian != 0); } else { __pyx_t_2 = __pyx_t_1; } if (!__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":256 * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<< * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" */ __pyx_t_1 = ((__pyx_v_descr->byteorder == '<') != 0); if (__pyx_t_1) { __pyx_t_3 = ((!(__pyx_v_little_endian != 0)) != 0); __pyx_t_7 = __pyx_t_3; } else { __pyx_t_7 = __pyx_t_1; } __pyx_t_1 = __pyx_t_7; } else { __pyx_t_1 = __pyx_t_2; } if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":257 * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__12, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":274 * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ switch (__pyx_v_t) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":258 * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" # <<<<<<<<<<<<<< * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" */ case NPY_BYTE: __pyx_v_f = __pyx_k_b; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":259 * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" # <<<<<<<<<<<<<< * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" */ case NPY_UBYTE: __pyx_v_f = __pyx_k_B; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":260 * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" # <<<<<<<<<<<<<< * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" */ case NPY_SHORT: __pyx_v_f = __pyx_k_h; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":261 * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" # <<<<<<<<<<<<<< * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" */ case NPY_USHORT: __pyx_v_f = __pyx_k_H; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":262 * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" # <<<<<<<<<<<<<< * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" */ case NPY_INT: __pyx_v_f = __pyx_k_i; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":263 * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" # <<<<<<<<<<<<<< * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" */ case NPY_UINT: __pyx_v_f = __pyx_k_I; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":264 * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" # <<<<<<<<<<<<<< * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" */ case NPY_LONG: __pyx_v_f = __pyx_k_l; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":265 * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" # <<<<<<<<<<<<<< * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" */ case NPY_ULONG: __pyx_v_f = __pyx_k_L; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":266 * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" # <<<<<<<<<<<<<< * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" */ case NPY_LONGLONG: __pyx_v_f = __pyx_k_q; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":267 * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" # <<<<<<<<<<<<<< * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" */ case NPY_ULONGLONG: __pyx_v_f = __pyx_k_Q; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":268 * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" # <<<<<<<<<<<<<< * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" */ case NPY_FLOAT: __pyx_v_f = __pyx_k_f; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":269 * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" # <<<<<<<<<<<<<< * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" */ case NPY_DOUBLE: __pyx_v_f = __pyx_k_d; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":270 * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" # <<<<<<<<<<<<<< * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" */ case NPY_LONGDOUBLE: __pyx_v_f = __pyx_k_g; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":271 * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" # <<<<<<<<<<<<<< * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" */ case NPY_CFLOAT: __pyx_v_f = __pyx_k_Zf; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":272 * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" # <<<<<<<<<<<<<< * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" */ case NPY_CDOUBLE: __pyx_v_f = __pyx_k_Zd; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":273 * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" # <<<<<<<<<<<<<< * elif t == NPY_OBJECT: f = "O" * else: */ case NPY_CLONGDOUBLE: __pyx_v_f = __pyx_k_Zg; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":274 * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ case NPY_OBJECT: __pyx_v_f = __pyx_k_O; break; default: /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":276 * elif t == NPY_OBJECT: f = "O" * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) # <<<<<<<<<<<<<< * info.format = f * return */ __pyx_t_4 = __Pyx_PyInt_From_int(__pyx_v_t); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_8 = PyUnicode_Format(__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_t_4); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_4, NULL); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_Raise(__pyx_t_8, 0, 0, 0); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} break; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":277 * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * info.format = f # <<<<<<<<<<<<<< * return * else: */ __pyx_v_info->format = __pyx_v_f; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":278 * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * info.format = f * return # <<<<<<<<<<<<<< * else: * info.format = stdlib.malloc(_buffer_format_string_len) */ __pyx_r = 0; goto __pyx_L0; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":280 * return * else: * info.format = stdlib.malloc(_buffer_format_string_len) # <<<<<<<<<<<<<< * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 */ __pyx_v_info->format = ((char *)malloc(255)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":281 * else: * info.format = stdlib.malloc(_buffer_format_string_len) * info.format[0] = c'^' # Native data types, manual alignment # <<<<<<<<<<<<<< * offset = 0 * f = _util_dtypestring(descr, info.format + 1, */ (__pyx_v_info->format[0]) = '^'; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":282 * info.format = stdlib.malloc(_buffer_format_string_len) * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 # <<<<<<<<<<<<<< * f = _util_dtypestring(descr, info.format + 1, * info.format + _buffer_format_string_len, */ __pyx_v_offset = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":283 * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 * f = _util_dtypestring(descr, info.format + 1, # <<<<<<<<<<<<<< * info.format + _buffer_format_string_len, * &offset) */ __pyx_t_9 = __pyx_f_5numpy__util_dtypestring(__pyx_v_descr, (__pyx_v_info->format + 1), (__pyx_v_info->format + 255), (&__pyx_v_offset)); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_f = __pyx_t_9; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":286 * info.format + _buffer_format_string_len, * &offset) * f[0] = c'\0' # Terminate format string # <<<<<<<<<<<<<< * * def __releasebuffer__(ndarray self, Py_buffer* info): */ (__pyx_v_f[0]) = '\x00'; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":194 * # experimental exception made for __getbuffer__ and __releasebuffer__ * # -- the details of this may change. * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<< * # This implementation of getbuffer is geared towards Cython * # requirements, and does not yet fullfill the PEP. */ /* function exit code */ __pyx_r = 0; goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_8); __Pyx_AddTraceback("numpy.ndarray.__getbuffer__", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = -1; if (__pyx_v_info != NULL && __pyx_v_info->obj != NULL) { __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = NULL; } goto __pyx_L2; __pyx_L0:; if (__pyx_v_info != NULL && __pyx_v_info->obj == Py_None) { __Pyx_GOTREF(Py_None); __Pyx_DECREF(Py_None); __pyx_v_info->obj = NULL; } __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_descr); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":288 * f[0] = c'\0' # Terminate format string * * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<< * if PyArray_HASFIELDS(self): * stdlib.free(info.format) */ /* Python wrapper */ static CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info); /*proto*/ static CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info) { __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__releasebuffer__ (wrapper)", 0); __pyx_pf_5numpy_7ndarray_2__releasebuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info)); /* function exit code */ __Pyx_RefNannyFinishContext(); } static void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info) { __Pyx_RefNannyDeclarations int __pyx_t_1; __Pyx_RefNannySetupContext("__releasebuffer__", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":289 * * def __releasebuffer__(ndarray self, Py_buffer* info): * if PyArray_HASFIELDS(self): # <<<<<<<<<<<<<< * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): */ __pyx_t_1 = (PyArray_HASFIELDS(__pyx_v_self) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":290 * def __releasebuffer__(ndarray self, Py_buffer* info): * if PyArray_HASFIELDS(self): * stdlib.free(info.format) # <<<<<<<<<<<<<< * if sizeof(npy_intp) != sizeof(Py_ssize_t): * stdlib.free(info.strides) */ free(__pyx_v_info->format); goto __pyx_L3; } __pyx_L3:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":291 * if PyArray_HASFIELDS(self): * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<< * stdlib.free(info.strides) * # info.shape was stored after info.strides in the same block */ __pyx_t_1 = (((sizeof(npy_intp)) != (sizeof(Py_ssize_t))) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":292 * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): * stdlib.free(info.strides) # <<<<<<<<<<<<<< * # info.shape was stored after info.strides in the same block * */ free(__pyx_v_info->strides); goto __pyx_L4; } __pyx_L4:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":288 * f[0] = c'\0' # Terminate format string * * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<< * if PyArray_HASFIELDS(self): * stdlib.free(info.format) */ /* function exit code */ __Pyx_RefNannyFinishContext(); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":768 * ctypedef npy_cdouble complex_t * * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(1, a) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew1(PyObject *__pyx_v_a) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew1", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":769 * * cdef inline object PyArray_MultiIterNew1(a): * return PyArray_MultiIterNew(1, a) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew2(a, b): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(1, ((void *)__pyx_v_a)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 769; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":768 * ctypedef npy_cdouble complex_t * * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(1, a) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew1", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":771 * return PyArray_MultiIterNew(1, a) * * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(2, a, b) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew2(PyObject *__pyx_v_a, PyObject *__pyx_v_b) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew2", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":772 * * cdef inline object PyArray_MultiIterNew2(a, b): * return PyArray_MultiIterNew(2, a, b) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew3(a, b, c): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(2, ((void *)__pyx_v_a), ((void *)__pyx_v_b)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 772; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":771 * return PyArray_MultiIterNew(1, a) * * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(2, a, b) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew2", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":774 * return PyArray_MultiIterNew(2, a, b) * * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(3, a, b, c) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew3(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew3", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":775 * * cdef inline object PyArray_MultiIterNew3(a, b, c): * return PyArray_MultiIterNew(3, a, b, c) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(3, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 775; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":774 * return PyArray_MultiIterNew(2, a, b) * * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(3, a, b, c) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew3", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":777 * return PyArray_MultiIterNew(3, a, b, c) * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(4, a, b, c, d) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew4(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew4", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":778 * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): * return PyArray_MultiIterNew(4, a, b, c, d) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(4, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 778; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":777 * return PyArray_MultiIterNew(3, a, b, c) * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(4, a, b, c, d) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew4", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":780 * return PyArray_MultiIterNew(4, a, b, c, d) * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(5, a, b, c, d, e) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew5(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d, PyObject *__pyx_v_e) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew5", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":781 * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): * return PyArray_MultiIterNew(5, a, b, c, d, e) # <<<<<<<<<<<<<< * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(5, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d), ((void *)__pyx_v_e)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 781; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":780 * return PyArray_MultiIterNew(4, a, b, c, d) * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(5, a, b, c, d, e) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew5", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":783 * return PyArray_MultiIterNew(5, a, b, c, d, e) * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<< * # Recursive utility function used in __getbuffer__ to get format * # string. The new location in the format string is returned. */ static CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *__pyx_v_descr, char *__pyx_v_f, char *__pyx_v_end, int *__pyx_v_offset) { PyArray_Descr *__pyx_v_child = 0; int __pyx_v_endian_detector; int __pyx_v_little_endian; PyObject *__pyx_v_fields = 0; PyObject *__pyx_v_childname = NULL; PyObject *__pyx_v_new_offset = NULL; PyObject *__pyx_v_t = NULL; char *__pyx_r; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; Py_ssize_t __pyx_t_2; PyObject *__pyx_t_3 = NULL; PyObject *__pyx_t_4 = NULL; int __pyx_t_5; int __pyx_t_6; int __pyx_t_7; int __pyx_t_8; int __pyx_t_9; long __pyx_t_10; char *__pyx_t_11; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("_util_dtypestring", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":790 * cdef int delta_offset * cdef tuple i * cdef int endian_detector = 1 # <<<<<<<<<<<<<< * cdef bint little_endian = ((&endian_detector)[0] != 0) * cdef tuple fields */ __pyx_v_endian_detector = 1; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":791 * cdef tuple i * cdef int endian_detector = 1 * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<< * cdef tuple fields * */ __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":794 * cdef tuple fields * * for childname in descr.names: # <<<<<<<<<<<<<< * fields = descr.fields[childname] * child, new_offset = fields */ if (unlikely(__pyx_v_descr->names == Py_None)) { PyErr_SetString(PyExc_TypeError, "'NoneType' object is not iterable"); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_1 = __pyx_v_descr->names; __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0; for (;;) { if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_3 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_3); __pyx_t_2++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif __Pyx_XDECREF_SET(__pyx_v_childname, __pyx_t_3); __pyx_t_3 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":795 * * for childname in descr.names: * fields = descr.fields[childname] # <<<<<<<<<<<<<< * child, new_offset = fields * */ __pyx_t_3 = PyObject_GetItem(__pyx_v_descr->fields, __pyx_v_childname); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); if (!(likely(PyTuple_CheckExact(__pyx_t_3))||((__pyx_t_3) == Py_None)||(PyErr_Format(PyExc_TypeError, "Expected %.16s, got %.200s", "tuple", Py_TYPE(__pyx_t_3)->tp_name), 0))) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_XDECREF_SET(__pyx_v_fields, ((PyObject*)__pyx_t_3)); __pyx_t_3 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":796 * for childname in descr.names: * fields = descr.fields[childname] * child, new_offset = fields # <<<<<<<<<<<<<< * * if (end - f) - (new_offset - offset[0]) < 15: */ if (likely(__pyx_v_fields != Py_None)) { PyObject* sequence = __pyx_v_fields; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_3 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); __Pyx_INCREF(__pyx_t_3); __Pyx_INCREF(__pyx_t_4); #else __pyx_t_3 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); #endif } else { __Pyx_RaiseNoneNotIterableError(); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_5numpy_dtype))))) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_XDECREF_SET(__pyx_v_child, ((PyArray_Descr *)__pyx_t_3)); __pyx_t_3 = 0; __Pyx_XDECREF_SET(__pyx_v_new_offset, __pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":798 * child, new_offset = fields * * if (end - f) - (new_offset - offset[0]) < 15: # <<<<<<<<<<<<<< * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") * */ __pyx_t_4 = __Pyx_PyInt_From_int((__pyx_v_offset[0])); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyNumber_Subtract(__pyx_v_new_offset, __pyx_t_4); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_5 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_5 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = ((((__pyx_v_end - __pyx_v_f) - ((int)__pyx_t_5)) < 15) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":799 * * if (end - f) - (new_offset - offset[0]) < 15: * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") # <<<<<<<<<<<<<< * * if ((child.byteorder == c'>' and little_endian) or */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_RuntimeError, __pyx_tuple__13, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":801 * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") * * if ((child.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<< * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") */ __pyx_t_6 = ((__pyx_v_child->byteorder == '>') != 0); if (__pyx_t_6) { __pyx_t_7 = (__pyx_v_little_endian != 0); } else { __pyx_t_7 = __pyx_t_6; } if (!__pyx_t_7) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":802 * * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<< * raise ValueError(u"Non-native byte order not supported") * # One could encode it in the format string and have Cython */ __pyx_t_6 = ((__pyx_v_child->byteorder == '<') != 0); if (__pyx_t_6) { __pyx_t_8 = ((!(__pyx_v_little_endian != 0)) != 0); __pyx_t_9 = __pyx_t_8; } else { __pyx_t_9 = __pyx_t_6; } __pyx_t_6 = __pyx_t_9; } else { __pyx_t_6 = __pyx_t_7; } if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":803 * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * # One could encode it in the format string and have Cython * # complain instead, BUT: < and > in format strings also imply */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__14, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":813 * * # Output padding bytes * while offset[0] < new_offset: # <<<<<<<<<<<<<< * f[0] = 120 # "x"; pad byte * f += 1 */ while (1) { __pyx_t_3 = __Pyx_PyInt_From_int((__pyx_v_offset[0])); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_t_3, __pyx_v_new_offset, Py_LT); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (!__pyx_t_6) break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":814 * # Output padding bytes * while offset[0] < new_offset: * f[0] = 120 # "x"; pad byte # <<<<<<<<<<<<<< * f += 1 * offset[0] += 1 */ (__pyx_v_f[0]) = 120; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":815 * while offset[0] < new_offset: * f[0] = 120 # "x"; pad byte * f += 1 # <<<<<<<<<<<<<< * offset[0] += 1 * */ __pyx_v_f = (__pyx_v_f + 1); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":816 * f[0] = 120 # "x"; pad byte * f += 1 * offset[0] += 1 # <<<<<<<<<<<<<< * * offset[0] += child.itemsize */ __pyx_t_10 = 0; (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + 1); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":818 * offset[0] += 1 * * offset[0] += child.itemsize # <<<<<<<<<<<<<< * * if not PyDataType_HASFIELDS(child): */ __pyx_t_10 = 0; (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + __pyx_v_child->elsize); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":820 * offset[0] += child.itemsize * * if not PyDataType_HASFIELDS(child): # <<<<<<<<<<<<<< * t = child.type_num * if end - f < 5: */ __pyx_t_6 = ((!(PyDataType_HASFIELDS(__pyx_v_child) != 0)) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":821 * * if not PyDataType_HASFIELDS(child): * t = child.type_num # <<<<<<<<<<<<<< * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") */ __pyx_t_4 = __Pyx_PyInt_From_int(__pyx_v_child->type_num); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 821; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_XDECREF_SET(__pyx_v_t, __pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":822 * if not PyDataType_HASFIELDS(child): * t = child.type_num * if end - f < 5: # <<<<<<<<<<<<<< * raise RuntimeError(u"Format string allocated too short.") * */ __pyx_t_6 = (((__pyx_v_end - __pyx_v_f) < 5) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":823 * t = child.type_num * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") # <<<<<<<<<<<<<< * * # Until ticket #99 is fixed, use integers to avoid warnings */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_RuntimeError, __pyx_tuple__15, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":826 * * # Until ticket #99 is fixed, use integers to avoid warnings * if t == NPY_BYTE: f[0] = 98 #"b" # <<<<<<<<<<<<<< * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" */ __pyx_t_4 = PyInt_FromLong(NPY_BYTE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 98; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":827 * # Until ticket #99 is fixed, use integers to avoid warnings * if t == NPY_BYTE: f[0] = 98 #"b" * elif t == NPY_UBYTE: f[0] = 66 #"B" # <<<<<<<<<<<<<< * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" */ __pyx_t_3 = PyInt_FromLong(NPY_UBYTE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 66; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":828 * if t == NPY_BYTE: f[0] = 98 #"b" * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" # <<<<<<<<<<<<<< * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" */ __pyx_t_4 = PyInt_FromLong(NPY_SHORT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 104; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":829 * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" # <<<<<<<<<<<<<< * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" */ __pyx_t_3 = PyInt_FromLong(NPY_USHORT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 72; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":830 * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" # <<<<<<<<<<<<<< * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" */ __pyx_t_4 = PyInt_FromLong(NPY_INT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 105; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":831 * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" # <<<<<<<<<<<<<< * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" */ __pyx_t_3 = PyInt_FromLong(NPY_UINT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 73; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":832 * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" # <<<<<<<<<<<<<< * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" */ __pyx_t_4 = PyInt_FromLong(NPY_LONG); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 108; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":833 * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" # <<<<<<<<<<<<<< * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" */ __pyx_t_3 = PyInt_FromLong(NPY_ULONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 76; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":834 * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" # <<<<<<<<<<<<<< * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" */ __pyx_t_4 = PyInt_FromLong(NPY_LONGLONG); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 113; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":835 * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" # <<<<<<<<<<<<<< * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" */ __pyx_t_3 = PyInt_FromLong(NPY_ULONGLONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 81; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":836 * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" # <<<<<<<<<<<<<< * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" */ __pyx_t_4 = PyInt_FromLong(NPY_FLOAT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 102; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":837 * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" # <<<<<<<<<<<<<< * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf */ __pyx_t_3 = PyInt_FromLong(NPY_DOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 100; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":838 * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" # <<<<<<<<<<<<<< * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd */ __pyx_t_4 = PyInt_FromLong(NPY_LONGDOUBLE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 103; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":839 * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf # <<<<<<<<<<<<<< * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg */ __pyx_t_3 = PyInt_FromLong(NPY_CFLOAT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 102; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":840 * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd # <<<<<<<<<<<<<< * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg * elif t == NPY_OBJECT: f[0] = 79 #"O" */ __pyx_t_4 = PyInt_FromLong(NPY_CDOUBLE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 100; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":841 * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg # <<<<<<<<<<<<<< * elif t == NPY_OBJECT: f[0] = 79 #"O" * else: */ __pyx_t_3 = PyInt_FromLong(NPY_CLONGDOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 103; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":842 * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg * elif t == NPY_OBJECT: f[0] = 79 #"O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ __pyx_t_4 = PyInt_FromLong(NPY_OBJECT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 79; goto __pyx_L11; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":844 * elif t == NPY_OBJECT: f[0] = 79 #"O" * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) # <<<<<<<<<<<<<< * f += 1 * else: */ __pyx_t_3 = PyUnicode_Format(__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_v_t); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_L11:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":845 * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * f += 1 # <<<<<<<<<<<<<< * else: * # Cython ignores struct boundary information ("T{...}"), */ __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L9; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":849 * # Cython ignores struct boundary information ("T{...}"), * # so don't output it * f = _util_dtypestring(child, f, end, offset) # <<<<<<<<<<<<<< * return f * */ __pyx_t_11 = __pyx_f_5numpy__util_dtypestring(__pyx_v_child, __pyx_v_f, __pyx_v_end, __pyx_v_offset); if (unlikely(__pyx_t_11 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 849; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_f = __pyx_t_11; } __pyx_L9:; } __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":850 * # so don't output it * f = _util_dtypestring(child, f, end, offset) * return f # <<<<<<<<<<<<<< * * */ __pyx_r = __pyx_v_f; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":783 * return PyArray_MultiIterNew(5, a, b, c, d, e) * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<< * # Recursive utility function used in __getbuffer__ to get format * # string. The new location in the format string is returned. */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_4); __Pyx_AddTraceback("numpy._util_dtypestring", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF((PyObject *)__pyx_v_child); __Pyx_XDECREF(__pyx_v_fields); __Pyx_XDECREF(__pyx_v_childname); __Pyx_XDECREF(__pyx_v_new_offset); __Pyx_XDECREF(__pyx_v_t); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":966 * * * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<< * cdef PyObject* baseptr * if base is None: */ static CYTHON_INLINE void __pyx_f_5numpy_set_array_base(PyArrayObject *__pyx_v_arr, PyObject *__pyx_v_base) { PyObject *__pyx_v_baseptr; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; __Pyx_RefNannySetupContext("set_array_base", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":968 * cdef inline void set_array_base(ndarray arr, object base): * cdef PyObject* baseptr * if base is None: # <<<<<<<<<<<<<< * baseptr = NULL * else: */ __pyx_t_1 = (__pyx_v_base == Py_None); __pyx_t_2 = (__pyx_t_1 != 0); if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":969 * cdef PyObject* baseptr * if base is None: * baseptr = NULL # <<<<<<<<<<<<<< * else: * Py_INCREF(base) # important to do this before decref below! */ __pyx_v_baseptr = NULL; goto __pyx_L3; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":971 * baseptr = NULL * else: * Py_INCREF(base) # important to do this before decref below! # <<<<<<<<<<<<<< * baseptr = base * Py_XDECREF(arr.base) */ Py_INCREF(__pyx_v_base); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":972 * else: * Py_INCREF(base) # important to do this before decref below! * baseptr = base # <<<<<<<<<<<<<< * Py_XDECREF(arr.base) * arr.base = baseptr */ __pyx_v_baseptr = ((PyObject *)__pyx_v_base); } __pyx_L3:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":973 * Py_INCREF(base) # important to do this before decref below! * baseptr = base * Py_XDECREF(arr.base) # <<<<<<<<<<<<<< * arr.base = baseptr * */ Py_XDECREF(__pyx_v_arr->base); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":974 * baseptr = base * Py_XDECREF(arr.base) * arr.base = baseptr # <<<<<<<<<<<<<< * * cdef inline object get_array_base(ndarray arr): */ __pyx_v_arr->base = __pyx_v_baseptr; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":966 * * * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<< * cdef PyObject* baseptr * if base is None: */ /* function exit code */ __Pyx_RefNannyFinishContext(); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_get_array_base(PyArrayObject *__pyx_v_arr) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; __Pyx_RefNannySetupContext("get_array_base", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":977 * * cdef inline object get_array_base(ndarray arr): * if arr.base is NULL: # <<<<<<<<<<<<<< * return None * else: */ __pyx_t_1 = ((__pyx_v_arr->base == NULL) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":978 * cdef inline object get_array_base(ndarray arr): * if arr.base is NULL: * return None # <<<<<<<<<<<<<< * else: * return arr.base */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(Py_None); __pyx_r = Py_None; goto __pyx_L0; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":980 * return None * else: * return arr.base # <<<<<<<<<<<<<< */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_arr->base)); __pyx_r = ((PyObject *)__pyx_v_arr->base); goto __pyx_L0; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ /* function exit code */ __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyMethodDef __pyx_methods[] = { {0, 0, 0, 0} }; #if PY_MAJOR_VERSION >= 3 static struct PyModuleDef __pyx_moduledef = { #if PY_VERSION_HEX < 0x03020000 { PyObject_HEAD_INIT(NULL) NULL, 0, NULL }, #else PyModuleDef_HEAD_INIT, #endif __Pyx_NAMESTR("_query_disc"), 0, /* m_doc */ -1, /* m_size */ __pyx_methods /* m_methods */, NULL, /* m_reload */ NULL, /* m_traverse */ NULL, /* m_clear */ NULL /* m_free */ }; #endif static __Pyx_StringTabEntry __pyx_string_tab[] = { {&__pyx_kp_s_Array_has_to_one_dimensional, __pyx_k_Array_has_to_one_dimensional, sizeof(__pyx_k_Array_has_to_one_dimensional), 0, 0, 1, 0}, {&__pyx_kp_s_Array_of_pixels_has_to_be_intege, __pyx_k_Array_of_pixels_has_to_be_intege, sizeof(__pyx_k_Array_of_pixels_has_to_be_intege), 0, 0, 1, 0}, {&__pyx_kp_s_Buffer_too_small_to_contain_retu, __pyx_k_Buffer_too_small_to_contain_retu, sizeof(__pyx_k_Buffer_too_small_to_contain_retu), 0, 0, 1, 0}, {&__pyx_kp_u_Format_string_allocated_too_shor, __pyx_k_Format_string_allocated_too_shor, sizeof(__pyx_k_Format_string_allocated_too_shor), 0, 1, 0, 0}, {&__pyx_kp_u_Format_string_allocated_too_shor_2, __pyx_k_Format_string_allocated_too_shor_2, sizeof(__pyx_k_Format_string_allocated_too_shor_2), 0, 1, 0, 0}, {&__pyx_kp_u_Non_native_byte_order_not_suppor, __pyx_k_Non_native_byte_order_not_suppor, sizeof(__pyx_k_Non_native_byte_order_not_suppor), 0, 1, 0, 0}, {&__pyx_kp_s_Pixel_identifier_is_too_large, __pyx_k_Pixel_identifier_is_too_large, sizeof(__pyx_k_Pixel_identifier_is_too_large), 0, 0, 1, 0}, {&__pyx_kp_u_Returns_an_array_containing_vect, __pyx_k_Returns_an_array_containing_vect, sizeof(__pyx_k_Returns_an_array_containing_vect), 0, 1, 0, 0}, {&__pyx_n_s_RuntimeError, __pyx_k_RuntimeError, sizeof(__pyx_k_RuntimeError), 0, 0, 1, 1}, {&__pyx_n_s_ValueError, __pyx_k_ValueError, sizeof(__pyx_k_ValueError), 0, 0, 1, 1}, {&__pyx_kp_s_Wrong_nside_value_must_be_a_powe, __pyx_k_Wrong_nside_value_must_be_a_powe, sizeof(__pyx_k_Wrong_nside_value_must_be_a_powe), 0, 0, 1, 0}, {&__pyx_n_s_boundaries, __pyx_k_boundaries, sizeof(__pyx_k_boundaries), 0, 0, 1, 1}, {&__pyx_kp_u_boundaries_line_236, __pyx_k_boundaries_line_236, sizeof(__pyx_k_boundaries_line_236), 0, 1, 0, 0}, {&__pyx_n_s_boundaries_multiple, __pyx_k_boundaries_multiple, sizeof(__pyx_k_boundaries_multiple), 0, 0, 1, 1}, {&__pyx_n_s_boundaries_single, __pyx_k_boundaries_single, sizeof(__pyx_k_boundaries_single), 0, 0, 1, 1}, {&__pyx_n_s_bounds, __pyx_k_bounds, sizeof(__pyx_k_bounds), 0, 0, 1, 1}, {&__pyx_n_s_buff, __pyx_k_buff, sizeof(__pyx_k_buff), 0, 0, 1, 1}, {&__pyx_n_s_dtype, __pyx_k_dtype, sizeof(__pyx_k_dtype), 0, 0, 1, 1}, {&__pyx_n_s_empty, __pyx_k_empty, sizeof(__pyx_k_empty), 0, 0, 1, 1}, {&__pyx_n_s_fact, __pyx_k_fact, sizeof(__pyx_k_fact), 0, 0, 1, 1}, {&__pyx_kp_s_fact_must_be_a_power_of_2_when_n, __pyx_k_fact_must_be_a_power_of_2_when_n, sizeof(__pyx_k_fact_must_be_a_power_of_2_when_n), 0, 0, 1, 0}, {&__pyx_n_s_factor, __pyx_k_factor, sizeof(__pyx_k_factor), 0, 0, 1, 1}, {&__pyx_n_s_float, __pyx_k_float, sizeof(__pyx_k_float), 0, 0, 1, 1}, {&__pyx_n_s_hb, __pyx_k_hb, sizeof(__pyx_k_hb), 0, 0, 1, 1}, {&__pyx_n_s_healpy__query_disc, __pyx_k_healpy__query_disc, sizeof(__pyx_k_healpy__query_disc), 0, 0, 1, 1}, {&__pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_k_home_zonca_p_software_healpy_he, sizeof(__pyx_k_home_zonca_p_software_healpy_he), 0, 0, 1, 0}, {&__pyx_n_s_i, __pyx_k_i, sizeof(__pyx_k_i), 0, 0, 1, 1}, {&__pyx_n_s_import, __pyx_k_import, sizeof(__pyx_k_import), 0, 0, 1, 1}, {&__pyx_n_s_inclusive, __pyx_k_inclusive, sizeof(__pyx_k_inclusive), 0, 0, 1, 1}, {&__pyx_n_s_int64, __pyx_k_int64, sizeof(__pyx_k_int64), 0, 0, 1, 1}, {&__pyx_n_s_integer, __pyx_k_integer, sizeof(__pyx_k_integer), 0, 0, 1, 1}, {&__pyx_n_s_j, __pyx_k_j, sizeof(__pyx_k_j), 0, 0, 1, 1}, {&__pyx_n_s_main, __pyx_k_main, sizeof(__pyx_k_main), 0, 0, 1, 1}, {&__pyx_n_s_maxnpix, __pyx_k_maxnpix, sizeof(__pyx_k_maxnpix), 0, 0, 1, 1}, {&__pyx_n_s_n, __pyx_k_n, sizeof(__pyx_k_n), 0, 0, 1, 1}, {&__pyx_kp_u_ndarray_is_not_C_contiguous, __pyx_k_ndarray_is_not_C_contiguous, sizeof(__pyx_k_ndarray_is_not_C_contiguous), 0, 1, 0, 0}, {&__pyx_kp_u_ndarray_is_not_Fortran_contiguou, __pyx_k_ndarray_is_not_Fortran_contiguou, sizeof(__pyx_k_ndarray_is_not_Fortran_contiguou), 0, 1, 0, 0}, {&__pyx_n_s_ndim, __pyx_k_ndim, sizeof(__pyx_k_ndim), 0, 0, 1, 1}, {&__pyx_n_s_nest, __pyx_k_nest, sizeof(__pyx_k_nest), 0, 0, 1, 1}, {&__pyx_n_s_np, __pyx_k_np, sizeof(__pyx_k_np), 0, 0, 1, 1}, {&__pyx_n_s_npix, __pyx_k_npix, sizeof(__pyx_k_npix), 0, 0, 1, 1}, {&__pyx_n_s_nside, __pyx_k_nside, sizeof(__pyx_k_nside), 0, 0, 1, 1}, {&__pyx_n_s_numpy, __pyx_k_numpy, sizeof(__pyx_k_numpy), 0, 0, 1, 1}, {&__pyx_n_s_out, __pyx_k_out, sizeof(__pyx_k_out), 0, 0, 1, 1}, {&__pyx_n_s_pix, __pyx_k_pix, sizeof(__pyx_k_pix), 0, 0, 1, 1}, {&__pyx_n_s_pixset, __pyx_k_pixset, sizeof(__pyx_k_pixset), 0, 0, 1, 1}, {&__pyx_n_s_ptg, __pyx_k_ptg, sizeof(__pyx_k_ptg), 0, 0, 1, 1}, {&__pyx_n_s_pyx_getbuffer, __pyx_k_pyx_getbuffer, sizeof(__pyx_k_pyx_getbuffer), 0, 0, 1, 1}, {&__pyx_n_s_pyx_releasebuffer, __pyx_k_pyx_releasebuffer, sizeof(__pyx_k_pyx_releasebuffer), 0, 0, 1, 1}, {&__pyx_n_s_query_disc, __pyx_k_query_disc, sizeof(__pyx_k_query_disc), 0, 0, 1, 1}, {&__pyx_n_s_query_polygon, __pyx_k_query_polygon, sizeof(__pyx_k_query_polygon), 0, 0, 1, 1}, {&__pyx_n_s_query_strip, __pyx_k_query_strip, sizeof(__pyx_k_query_strip), 0, 0, 1, 1}, {&__pyx_n_s_radius, __pyx_k_radius, sizeof(__pyx_k_radius), 0, 0, 1, 1}, {&__pyx_n_s_range, __pyx_k_range, sizeof(__pyx_k_range), 0, 0, 1, 1}, {&__pyx_n_s_scheme, __pyx_k_scheme, sizeof(__pyx_k_scheme), 0, 0, 1, 1}, {&__pyx_n_s_size, __pyx_k_size, sizeof(__pyx_k_size), 0, 0, 1, 1}, {&__pyx_n_s_step, __pyx_k_step, sizeof(__pyx_k_step), 0, 0, 1, 1}, {&__pyx_n_s_test, __pyx_k_test, sizeof(__pyx_k_test), 0, 0, 1, 1}, {&__pyx_n_s_theta1, __pyx_k_theta1, sizeof(__pyx_k_theta1), 0, 0, 1, 1}, {&__pyx_n_s_theta2, __pyx_k_theta2, sizeof(__pyx_k_theta2), 0, 0, 1, 1}, {&__pyx_n_s_type, __pyx_k_type, sizeof(__pyx_k_type), 0, 0, 1, 1}, {&__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_k_unknown_dtype_code_in_numpy_pxd, sizeof(__pyx_k_unknown_dtype_code_in_numpy_pxd), 0, 1, 0, 0}, {&__pyx_n_s_v, __pyx_k_v, sizeof(__pyx_k_v), 0, 0, 1, 1}, {&__pyx_n_s_vec, __pyx_k_vec, sizeof(__pyx_k_vec), 0, 0, 1, 1}, {&__pyx_n_s_vert, __pyx_k_vert, sizeof(__pyx_k_vert), 0, 0, 1, 1}, {&__pyx_n_s_vertices, __pyx_k_vertices, sizeof(__pyx_k_vertices), 0, 0, 1, 1}, {0, 0, 0, 0, 0, 0, 0} }; static int __Pyx_InitCachedBuiltins(void) { __pyx_builtin_ValueError = __Pyx_GetBuiltinName(__pyx_n_s_ValueError); if (!__pyx_builtin_ValueError) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_range = __Pyx_GetBuiltinName(__pyx_n_s_range); if (!__pyx_builtin_range) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 206; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_RuntimeError = __Pyx_GetBuiltinName(__pyx_n_s_RuntimeError); if (!__pyx_builtin_RuntimeError) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} return 0; __pyx_L1_error:; return -1; } static int __Pyx_InitCachedConstants(void) { __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__Pyx_InitCachedConstants", 0); /* "healpy/src/_query_disc.pyx":54 * # Check Nside value * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * cdef vec3 v = vec3(vec[0], vec[1], vec[2]) * cdef Healpix_Ordering_Scheme scheme */ __pyx_tuple_ = PyTuple_Pack(1, __pyx_kp_s_Wrong_nside_value_must_be_a_powe); if (unlikely(!__pyx_tuple_)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple_); __Pyx_GIVEREF(__pyx_tuple_); /* "healpy/src/_query_disc.pyx":117 * # Check Nside value * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * # Create vector of vertices * cdef vector[pointing] vert */ __pyx_tuple__2 = PyTuple_Pack(1, __pyx_kp_s_Wrong_nside_value_must_be_a_powe); if (unlikely(!__pyx_tuple__2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 117; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__2); __Pyx_GIVEREF(__pyx_tuple__2); /* "healpy/src/_query_disc.pyx":178 * # Check Nside value * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * # Create the Healpix_Base2 structure * cdef Healpix_Ordering_Scheme scheme */ __pyx_tuple__3 = PyTuple_Pack(1, __pyx_kp_s_Wrong_nside_value_must_be_a_powe); if (unlikely(!__pyx_tuple__3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__3); __Pyx_GIVEREF(__pyx_tuple__3); /* "healpy/src/_query_disc.pyx":202 * cdef vector[vec3] bounds * if pix >= (12*nside*nside): * raise ValueError('Pixel identifier is too large') # <<<<<<<<<<<<<< * hb.boundaries(pix, step, bounds) * cdef size_t n = bounds.size() */ __pyx_tuple__4 = PyTuple_Pack(1, __pyx_kp_s_Pixel_identifier_is_too_large); if (unlikely(!__pyx_tuple__4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 202; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__4); __Pyx_GIVEREF(__pyx_tuple__4); /* "healpy/src/_query_disc.pyx":227 * for j in range(npix): * if pix[j] >= maxnpix: * raise ValueError('Pixel identifier is too large') # <<<<<<<<<<<<<< * * hb.boundaries(pix[j], step, bounds) */ __pyx_tuple__5 = PyTuple_Pack(1, __pyx_kp_s_Pixel_identifier_is_too_large); if (unlikely(!__pyx_tuple__5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__5); __Pyx_GIVEREF(__pyx_tuple__5); /* "healpy/src/_query_disc.pyx":279 * * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * if isinstance(pix, (int, long)): * return _boundaries_single(nside, pix, step=step, nest=nest) */ __pyx_tuple__6 = PyTuple_Pack(1, __pyx_kp_s_Wrong_nside_value_must_be_a_powe); if (unlikely(!__pyx_tuple__6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__6); __Pyx_GIVEREF(__pyx_tuple__6); /* "healpy/src/_query_disc.pyx":284 * if type(pix) is np.ndarray: * if not issubclass(pix.dtype.type, np.integer): * raise ValueError('Array of pixels has to be integers') # <<<<<<<<<<<<<< * if pix.ndim!=1: * raise ValueError('Array has to one dimensional') */ __pyx_tuple__7 = PyTuple_Pack(1, __pyx_kp_s_Array_of_pixels_has_to_be_intege); if (unlikely(!__pyx_tuple__7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 284; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__7); __Pyx_GIVEREF(__pyx_tuple__7); /* "healpy/src/_query_disc.pyx":286 * raise ValueError('Array of pixels has to be integers') * if pix.ndim!=1: * raise ValueError('Array has to one dimensional') # <<<<<<<<<<<<<< * return _boundaries_multiple(nside, pix, step=step, nest=nest) * */ __pyx_tuple__8 = PyTuple_Pack(1, __pyx_kp_s_Array_has_to_one_dimensional); if (unlikely(!__pyx_tuple__8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 286; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__8); __Pyx_GIVEREF(__pyx_tuple__8); /* "healpy/src/_query_disc.pyx":329 * else : * if n>=len(buff) : * raise ValueError("Buffer too small to contain return value") # <<<<<<<<<<<<<< * ipix = buff[:n] * */ __pyx_tuple__9 = PyTuple_Pack(1, __pyx_kp_s_Buffer_too_small_to_contain_retu); if (unlikely(!__pyx_tuple__9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 329; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__9); __Pyx_GIVEREF(__pyx_tuple__9); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":215 * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) */ __pyx_tuple__10 = PyTuple_Pack(1, __pyx_kp_u_ndarray_is_not_C_contiguous); if (unlikely(!__pyx_tuple__10)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__10); __Pyx_GIVEREF(__pyx_tuple__10); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":219 * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") # <<<<<<<<<<<<<< * * info.buf = PyArray_DATA(self) */ __pyx_tuple__11 = PyTuple_Pack(1, __pyx_kp_u_ndarray_is_not_Fortran_contiguou); if (unlikely(!__pyx_tuple__11)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__11); __Pyx_GIVEREF(__pyx_tuple__11); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":257 * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" */ __pyx_tuple__12 = PyTuple_Pack(1, __pyx_kp_u_Non_native_byte_order_not_suppor); if (unlikely(!__pyx_tuple__12)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__12); __Pyx_GIVEREF(__pyx_tuple__12); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":799 * * if (end - f) - (new_offset - offset[0]) < 15: * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") # <<<<<<<<<<<<<< * * if ((child.byteorder == c'>' and little_endian) or */ __pyx_tuple__13 = PyTuple_Pack(1, __pyx_kp_u_Format_string_allocated_too_shor); if (unlikely(!__pyx_tuple__13)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__13); __Pyx_GIVEREF(__pyx_tuple__13); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":803 * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * # One could encode it in the format string and have Cython * # complain instead, BUT: < and > in format strings also imply */ __pyx_tuple__14 = PyTuple_Pack(1, __pyx_kp_u_Non_native_byte_order_not_suppor); if (unlikely(!__pyx_tuple__14)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__14); __Pyx_GIVEREF(__pyx_tuple__14); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":823 * t = child.type_num * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") # <<<<<<<<<<<<<< * * # Until ticket #99 is fixed, use integers to avoid warnings */ __pyx_tuple__15 = PyTuple_Pack(1, __pyx_kp_u_Format_string_allocated_too_shor_2); if (unlikely(!__pyx_tuple__15)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__15); __Pyx_GIVEREF(__pyx_tuple__15); /* "healpy/src/_query_disc.pyx":13 * @cython.boundscheck(False) * @cython.wraparound(False) * def query_disc(nside, vec, radius, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the disk defined by * *vec* and *radius* (in radians) (if *inclusive* is False), or which */ __pyx_tuple__16 = PyTuple_Pack(13, __pyx_n_s_nside, __pyx_n_s_vec, __pyx_n_s_radius, __pyx_n_s_inclusive, __pyx_n_s_fact, __pyx_n_s_nest, __pyx_n_s_buff, __pyx_n_s_v, __pyx_n_s_scheme, __pyx_n_s_hb, __pyx_n_s_pixset, __pyx_n_s_factor, __pyx_n_s_ptg); if (unlikely(!__pyx_tuple__16)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__16); __Pyx_GIVEREF(__pyx_tuple__16); __pyx_codeobj__17 = (PyObject*)__Pyx_PyCode_New(7, 0, 13, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__16, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_query_disc, 13, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__17)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_query_disc.pyx":78 * * * def query_polygon(nside, vertices, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """ Returns the pixels whose centers lie within the convex polygon * defined by the *vertices* array (if *inclusive* is False), or which */ __pyx_tuple__18 = PyTuple_Pack(13, __pyx_n_s_nside, __pyx_n_s_vertices, __pyx_n_s_inclusive, __pyx_n_s_fact, __pyx_n_s_nest, __pyx_n_s_buff, __pyx_n_s_vert, __pyx_n_s_ptg, __pyx_n_s_v, __pyx_n_s_scheme, __pyx_n_s_hb, __pyx_n_s_pixset, __pyx_n_s_factor); if (unlikely(!__pyx_tuple__18)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__18); __Pyx_GIVEREF(__pyx_tuple__18); __pyx_codeobj__19 = (PyObject*)__Pyx_PyCode_New(6, 0, 13, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__18, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_query_polygon, 78, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__19)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_query_disc.pyx":146 * return pixset_to_array(pixset, buff) * * def query_strip(nside, theta1, theta2, inclusive = False, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the colatitude range * defined by *theta1* and *theta2* (if inclusive is False), or which */ __pyx_tuple__20 = PyTuple_Pack(9, __pyx_n_s_nside, __pyx_n_s_theta1, __pyx_n_s_theta2, __pyx_n_s_inclusive, __pyx_n_s_nest, __pyx_n_s_buff, __pyx_n_s_scheme, __pyx_n_s_hb, __pyx_n_s_pixset); if (unlikely(!__pyx_tuple__20)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__20); __Pyx_GIVEREF(__pyx_tuple__20); __pyx_codeobj__21 = (PyObject*)__Pyx_PyCode_New(6, 0, 9, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__20, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_query_strip, 146, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__21)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_query_disc.pyx":193 * * * def _boundaries_single(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ __pyx_tuple__22 = PyTuple_Pack(10, __pyx_n_s_nside, __pyx_n_s_pix, __pyx_n_s_step, __pyx_n_s_nest, __pyx_n_s_scheme, __pyx_n_s_hb, __pyx_n_s_bounds, __pyx_n_s_n, __pyx_n_s_out, __pyx_n_s_i); if (unlikely(!__pyx_tuple__22)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 193; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__22); __Pyx_GIVEREF(__pyx_tuple__22); __pyx_codeobj__23 = (PyObject*)__Pyx_PyCode_New(4, 0, 10, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__22, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_boundaries_single, 193, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__23)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 193; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_query_disc.pyx":212 * return out * * def _boundaries_multiple(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ __pyx_tuple__24 = PyTuple_Pack(13, __pyx_n_s_nside, __pyx_n_s_pix, __pyx_n_s_step, __pyx_n_s_nest, __pyx_n_s_scheme, __pyx_n_s_hb, __pyx_n_s_npix, __pyx_n_s_n, __pyx_n_s_maxnpix, __pyx_n_s_out, __pyx_n_s_bounds, __pyx_n_s_j, __pyx_n_s_i); if (unlikely(!__pyx_tuple__24)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__24); __Pyx_GIVEREF(__pyx_tuple__24); __pyx_codeobj__25 = (PyObject*)__Pyx_PyCode_New(4, 0, 13, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__24, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_boundaries_multiple, 212, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__25)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_query_disc.pyx":236 * return out * * def boundaries(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * """Returns an array containing vectors to the boundary of * the nominated pixel. */ __pyx_tuple__26 = PyTuple_Pack(4, __pyx_n_s_nside, __pyx_n_s_pix, __pyx_n_s_step, __pyx_n_s_nest); if (unlikely(!__pyx_tuple__26)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 236; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__26); __Pyx_GIVEREF(__pyx_tuple__26); __pyx_codeobj__27 = (PyObject*)__Pyx_PyCode_New(4, 0, 4, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__26, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_boundaries, 236, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__27)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 236; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_RefNannyFinishContext(); return 0; __pyx_L1_error:; __Pyx_RefNannyFinishContext(); return -1; } static int __Pyx_InitGlobals(void) { if (__Pyx_InitStrings(__pyx_string_tab) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __pyx_int_1 = PyInt_FromLong(1); if (unlikely(!__pyx_int_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_3 = PyInt_FromLong(3); if (unlikely(!__pyx_int_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_4 = PyInt_FromLong(4); if (unlikely(!__pyx_int_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_12 = PyInt_FromLong(12); if (unlikely(!__pyx_int_12)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} return 0; __pyx_L1_error:; return -1; } #if PY_MAJOR_VERSION < 3 PyMODINIT_FUNC init_query_disc(void); /*proto*/ PyMODINIT_FUNC init_query_disc(void) #else PyMODINIT_FUNC PyInit__query_disc(void); /*proto*/ PyMODINIT_FUNC PyInit__query_disc(void) #endif { PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannyDeclarations #if CYTHON_REFNANNY __Pyx_RefNanny = __Pyx_RefNannyImportAPI("refnanny"); if (!__Pyx_RefNanny) { PyErr_Clear(); __Pyx_RefNanny = __Pyx_RefNannyImportAPI("Cython.Runtime.refnanny"); if (!__Pyx_RefNanny) Py_FatalError("failed to import 'refnanny' module"); } #endif __Pyx_RefNannySetupContext("PyMODINIT_FUNC PyInit__query_disc(void)", 0); if ( __Pyx_check_binary_version() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_empty_bytes = PyBytes_FromStringAndSize("", 0); if (unlikely(!__pyx_empty_bytes)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #ifdef __Pyx_CyFunction_USED if (__Pyx_CyFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif #ifdef __Pyx_FusedFunction_USED if (__pyx_FusedFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif #ifdef __Pyx_Generator_USED if (__pyx_Generator_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif /*--- Library function declarations ---*/ /*--- Threads initialization code ---*/ #if defined(__PYX_FORCE_INIT_THREADS) && __PYX_FORCE_INIT_THREADS #ifdef WITH_THREAD /* Python build with threading support? */ PyEval_InitThreads(); #endif #endif /*--- Module creation code ---*/ #if PY_MAJOR_VERSION < 3 __pyx_m = Py_InitModule4(__Pyx_NAMESTR("_query_disc"), __pyx_methods, 0, 0, PYTHON_API_VERSION); Py_XINCREF(__pyx_m); #else __pyx_m = PyModule_Create(&__pyx_moduledef); #endif if (unlikely(!__pyx_m)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_d = PyModule_GetDict(__pyx_m); if (unlikely(!__pyx_d)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} Py_INCREF(__pyx_d); __pyx_b = PyImport_AddModule(__Pyx_NAMESTR(__Pyx_BUILTIN_MODULE_NAME)); if (unlikely(!__pyx_b)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #if CYTHON_COMPILING_IN_PYPY Py_INCREF(__pyx_b); #endif if (__Pyx_SetAttrString(__pyx_m, "__builtins__", __pyx_b) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; /*--- Initialize various global constants etc. ---*/ if (unlikely(__Pyx_InitGlobals() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #if PY_MAJOR_VERSION < 3 && (__PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT) if (__Pyx_init_sys_getdefaultencoding_params() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif if (__pyx_module_is_main_healpy___query_disc) { if (__Pyx_SetAttrString(__pyx_m, "__name__", __pyx_n_s_main) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; } #if PY_MAJOR_VERSION >= 3 { PyObject *modules = PyImport_GetModuleDict(); if (unlikely(!modules)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (!PyDict_GetItemString(modules, "healpy._query_disc")) { if (unlikely(PyDict_SetItemString(modules, "healpy._query_disc", __pyx_m) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } } #endif /*--- Builtin init code ---*/ if (unlikely(__Pyx_InitCachedBuiltins() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Constants init code ---*/ if (unlikely(__Pyx_InitCachedConstants() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Global init code ---*/ /*--- Variable export code ---*/ /*--- Function export code ---*/ /*--- Type init code ---*/ /*--- Type import code ---*/ __pyx_ptype_7cpython_4type_type = __Pyx_ImportType(__Pyx_BUILTIN_MODULE_NAME, "type", #if CYTHON_COMPILING_IN_PYPY sizeof(PyTypeObject), #else sizeof(PyHeapTypeObject), #endif 0); if (unlikely(!__pyx_ptype_7cpython_4type_type)) {__pyx_filename = __pyx_f[3]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_dtype = __Pyx_ImportType("numpy", "dtype", sizeof(PyArray_Descr), 0); if (unlikely(!__pyx_ptype_5numpy_dtype)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 155; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_flatiter = __Pyx_ImportType("numpy", "flatiter", sizeof(PyArrayIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_flatiter)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 165; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_broadcast = __Pyx_ImportType("numpy", "broadcast", sizeof(PyArrayMultiIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_broadcast)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 169; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_ndarray = __Pyx_ImportType("numpy", "ndarray", sizeof(PyArrayObject), 0); if (unlikely(!__pyx_ptype_5numpy_ndarray)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_ufunc = __Pyx_ImportType("numpy", "ufunc", sizeof(PyUFuncObject), 0); if (unlikely(!__pyx_ptype_5numpy_ufunc)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 861; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Variable import code ---*/ /*--- Function import code ---*/ /*--- Execution code ---*/ /* "healpy/src/_query_disc.pyx":3 * # Wrapper around the query_disc method of Healpix_base class * * import numpy as np # <<<<<<<<<<<<<< * cimport numpy as np * from libcpp cimport bool */ __pyx_t_1 = __Pyx_Import(__pyx_n_s_numpy, 0, -1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 3; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_np, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 3; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_query_disc.pyx":13 * @cython.boundscheck(False) * @cython.wraparound(False) * def query_disc(nside, vec, radius, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the disk defined by * *vec* and *radius* (in radians) (if *inclusive* is False), or which */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_11_query_disc_1query_disc, NULL, __pyx_n_s_healpy__query_disc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_query_disc, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 13; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_query_disc.pyx":78 * * * def query_polygon(nside, vertices, inclusive = False, fact = 4, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """ Returns the pixels whose centers lie within the convex polygon * defined by the *vertices* array (if *inclusive* is False), or which */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_11_query_disc_3query_polygon, NULL, __pyx_n_s_healpy__query_disc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_query_polygon, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 78; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_query_disc.pyx":146 * return pixset_to_array(pixset, buff) * * def query_strip(nside, theta1, theta2, inclusive = False, nest = False, np.ndarray[np.int64_t, ndim=1] buff=None): # <<<<<<<<<<<<<< * """Returns pixels whose centers lie within the colatitude range * defined by *theta1* and *theta2* (if inclusive is False), or which */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_11_query_disc_5query_strip, NULL, __pyx_n_s_healpy__query_disc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_query_strip, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 146; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_query_disc.pyx":193 * * * def _boundaries_single(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_11_query_disc_7_boundaries_single, NULL, __pyx_n_s_healpy__query_disc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 193; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_boundaries_single, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 193; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_query_disc.pyx":212 * return out * * def _boundaries_multiple(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_11_query_disc_9_boundaries_multiple, NULL, __pyx_n_s_healpy__query_disc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_boundaries_multiple, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_query_disc.pyx":236 * return out * * def boundaries(nside, pix, step=1, nest=False): # <<<<<<<<<<<<<< * """Returns an array containing vectors to the boundary of * the nominated pixel. */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_11_query_disc_11boundaries, NULL, __pyx_n_s_healpy__query_disc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 236; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_boundaries, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 236; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_query_disc.pyx":1 * # Wrapper around the query_disc method of Healpix_base class # <<<<<<<<<<<<<< * * import numpy as np */ __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_t_1, __pyx_kp_u_boundaries_line_236, __pyx_kp_u_Returns_an_array_containing_vect) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (PyDict_SetItem(__pyx_d, __pyx_n_s_test, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); if (__pyx_m) { __Pyx_AddTraceback("init healpy._query_disc", __pyx_clineno, __pyx_lineno, __pyx_filename); Py_DECREF(__pyx_m); __pyx_m = 0; } else if (!PyErr_Occurred()) { PyErr_SetString(PyExc_ImportError, "init healpy._query_disc"); } __pyx_L0:; __Pyx_RefNannyFinishContext(); #if PY_MAJOR_VERSION < 3 return; #else return __pyx_m; #endif } /* Runtime support code */ #if CYTHON_REFNANNY static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname) { PyObject *m = NULL, *p = NULL; void *r = NULL; m = PyImport_ImportModule((char *)modname); if (!m) goto end; p = PyObject_GetAttrString(m, (char *)"RefNannyAPI"); if (!p) goto end; r = PyLong_AsVoidPtr(p); end: Py_XDECREF(p); Py_XDECREF(m); return (__Pyx_RefNannyAPIStruct *)r; } #endif /* CYTHON_REFNANNY */ static PyObject *__Pyx_GetBuiltinName(PyObject *name) { PyObject* result = __Pyx_PyObject_GetAttrStr(__pyx_b, name); if (unlikely(!result)) { PyErr_Format(PyExc_NameError, #if PY_MAJOR_VERSION >= 3 "name '%U' is not defined", name); #else "name '%.200s' is not defined", PyString_AS_STRING(name)); #endif } return result; } static void __Pyx_RaiseArgtupleInvalid( const char* func_name, int exact, Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found) { Py_ssize_t num_expected; const char *more_or_less; if (num_found < num_min) { num_expected = num_min; more_or_less = "at least"; } else { num_expected = num_max; more_or_less = "at most"; } if (exact) { more_or_less = "exactly"; } PyErr_Format(PyExc_TypeError, "%.200s() takes %.8s %" CYTHON_FORMAT_SSIZE_T "d positional argument%.1s (%" CYTHON_FORMAT_SSIZE_T "d given)", func_name, more_or_less, num_expected, (num_expected == 1) ? "" : "s", num_found); } static void __Pyx_RaiseDoubleKeywordsError( const char* func_name, PyObject* kw_name) { PyErr_Format(PyExc_TypeError, #if PY_MAJOR_VERSION >= 3 "%s() got multiple values for keyword argument '%U'", func_name, kw_name); #else "%s() got multiple values for keyword argument '%s'", func_name, PyString_AsString(kw_name)); #endif } static int __Pyx_ParseOptionalKeywords( PyObject *kwds, PyObject **argnames[], PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args, const char* function_name) { PyObject *key = 0, *value = 0; Py_ssize_t pos = 0; PyObject*** name; PyObject*** first_kw_arg = argnames + num_pos_args; while (PyDict_Next(kwds, &pos, &key, &value)) { name = first_kw_arg; while (*name && (**name != key)) name++; if (*name) { values[name-argnames] = value; continue; } name = first_kw_arg; #if PY_MAJOR_VERSION < 3 if (likely(PyString_CheckExact(key)) || likely(PyString_Check(key))) { while (*name) { if ((CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**name) == PyString_GET_SIZE(key)) && _PyString_Eq(**name, key)) { values[name-argnames] = value; break; } name++; } if (*name) continue; else { PyObject*** argname = argnames; while (argname != first_kw_arg) { if ((**argname == key) || ( (CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**argname) == PyString_GET_SIZE(key)) && _PyString_Eq(**argname, key))) { goto arg_passed_twice; } argname++; } } } else #endif if (likely(PyUnicode_Check(key))) { while (*name) { int cmp = (**name == key) ? 0 : #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3 (PyUnicode_GET_SIZE(**name) != PyUnicode_GET_SIZE(key)) ? 1 : #endif PyUnicode_Compare(**name, key); if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad; if (cmp == 0) { values[name-argnames] = value; break; } name++; } if (*name) continue; else { PyObject*** argname = argnames; while (argname != first_kw_arg) { int cmp = (**argname == key) ? 0 : #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3 (PyUnicode_GET_SIZE(**argname) != PyUnicode_GET_SIZE(key)) ? 1 : #endif PyUnicode_Compare(**argname, key); if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad; if (cmp == 0) goto arg_passed_twice; argname++; } } } else goto invalid_keyword_type; if (kwds2) { if (unlikely(PyDict_SetItem(kwds2, key, value))) goto bad; } else { goto invalid_keyword; } } return 0; arg_passed_twice: __Pyx_RaiseDoubleKeywordsError(function_name, key); goto bad; invalid_keyword_type: PyErr_Format(PyExc_TypeError, "%.200s() keywords must be strings", function_name); goto bad; invalid_keyword: PyErr_Format(PyExc_TypeError, #if PY_MAJOR_VERSION < 3 "%.200s() got an unexpected keyword argument '%.200s'", function_name, PyString_AsString(key)); #else "%s() got an unexpected keyword argument '%U'", function_name, key); #endif bad: return -1; } static void __Pyx_RaiseArgumentTypeInvalid(const char* name, PyObject *obj, PyTypeObject *type) { PyErr_Format(PyExc_TypeError, "Argument '%.200s' has incorrect type (expected %.200s, got %.200s)", name, type->tp_name, Py_TYPE(obj)->tp_name); } static CYTHON_INLINE int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed, const char *name, int exact) { if (unlikely(!type)) { PyErr_SetString(PyExc_SystemError, "Missing type object"); return 0; } if (none_allowed && obj == Py_None) return 1; else if (exact) { if (likely(Py_TYPE(obj) == type)) return 1; #if PY_MAJOR_VERSION == 2 else if ((type == &PyBaseString_Type) && likely(__Pyx_PyBaseString_CheckExact(obj))) return 1; #endif } else { if (likely(PyObject_TypeCheck(obj, type))) return 1; } __Pyx_RaiseArgumentTypeInvalid(name, obj, type); return 0; } static CYTHON_INLINE int __Pyx_IsLittleEndian(void) { unsigned int n = 1; return *(unsigned char*)(&n) != 0; } static void __Pyx_BufFmt_Init(__Pyx_BufFmt_Context* ctx, __Pyx_BufFmt_StackElem* stack, __Pyx_TypeInfo* type) { stack[0].field = &ctx->root; stack[0].parent_offset = 0; ctx->root.type = type; ctx->root.name = "buffer dtype"; ctx->root.offset = 0; ctx->head = stack; ctx->head->field = &ctx->root; ctx->fmt_offset = 0; ctx->head->parent_offset = 0; ctx->new_packmode = '@'; ctx->enc_packmode = '@'; ctx->new_count = 1; ctx->enc_count = 0; ctx->enc_type = 0; ctx->is_complex = 0; ctx->is_valid_array = 0; ctx->struct_alignment = 0; while (type->typegroup == 'S') { ++ctx->head; ctx->head->field = type->fields; ctx->head->parent_offset = 0; type = type->fields->type; } } static int __Pyx_BufFmt_ParseNumber(const char** ts) { int count; const char* t = *ts; if (*t < '0' || *t > '9') { return -1; } else { count = *t++ - '0'; while (*t >= '0' && *t < '9') { count *= 10; count += *t++ - '0'; } } *ts = t; return count; } static int __Pyx_BufFmt_ExpectNumber(const char **ts) { int number = __Pyx_BufFmt_ParseNumber(ts); if (number == -1) /* First char was not a digit */ PyErr_Format(PyExc_ValueError,\ "Does not understand character buffer dtype format string ('%c')", **ts); return number; } static void __Pyx_BufFmt_RaiseUnexpectedChar(char ch) { PyErr_Format(PyExc_ValueError, "Unexpected format string character: '%c'", ch); } static const char* __Pyx_BufFmt_DescribeTypeChar(char ch, int is_complex) { switch (ch) { case 'c': return "'char'"; case 'b': return "'signed char'"; case 'B': return "'unsigned char'"; case 'h': return "'short'"; case 'H': return "'unsigned short'"; case 'i': return "'int'"; case 'I': return "'unsigned int'"; case 'l': return "'long'"; case 'L': return "'unsigned long'"; case 'q': return "'long long'"; case 'Q': return "'unsigned long long'"; case 'f': return (is_complex ? "'complex float'" : "'float'"); case 'd': return (is_complex ? "'complex double'" : "'double'"); case 'g': return (is_complex ? "'complex long double'" : "'long double'"); case 'T': return "a struct"; case 'O': return "Python object"; case 'P': return "a pointer"; case 's': case 'p': return "a string"; case 0: return "end"; default: return "unparseable format string"; } } static size_t __Pyx_BufFmt_TypeCharToStandardSize(char ch, int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return 2; case 'i': case 'I': case 'l': case 'L': return 4; case 'q': case 'Q': return 8; case 'f': return (is_complex ? 8 : 4); case 'd': return (is_complex ? 16 : 8); case 'g': { PyErr_SetString(PyExc_ValueError, "Python does not define a standard format string size for long double ('g').."); return 0; } case 'O': case 'P': return sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } static size_t __Pyx_BufFmt_TypeCharToNativeSize(char ch, int is_complex) { switch (ch) { case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(short); case 'i': case 'I': return sizeof(int); case 'l': case 'L': return sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(float) * (is_complex ? 2 : 1); case 'd': return sizeof(double) * (is_complex ? 2 : 1); case 'g': return sizeof(long double) * (is_complex ? 2 : 1); case 'O': case 'P': return sizeof(void*); default: { __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } } typedef struct { char c; short x; } __Pyx_st_short; typedef struct { char c; int x; } __Pyx_st_int; typedef struct { char c; long x; } __Pyx_st_long; typedef struct { char c; float x; } __Pyx_st_float; typedef struct { char c; double x; } __Pyx_st_double; typedef struct { char c; long double x; } __Pyx_st_longdouble; typedef struct { char c; void *x; } __Pyx_st_void_p; #ifdef HAVE_LONG_LONG typedef struct { char c; PY_LONG_LONG x; } __Pyx_st_longlong; #endif static size_t __Pyx_BufFmt_TypeCharToAlignment(char ch, CYTHON_UNUSED int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(__Pyx_st_short) - sizeof(short); case 'i': case 'I': return sizeof(__Pyx_st_int) - sizeof(int); case 'l': case 'L': return sizeof(__Pyx_st_long) - sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(__Pyx_st_longlong) - sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(__Pyx_st_float) - sizeof(float); case 'd': return sizeof(__Pyx_st_double) - sizeof(double); case 'g': return sizeof(__Pyx_st_longdouble) - sizeof(long double); case 'P': case 'O': return sizeof(__Pyx_st_void_p) - sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } /* These are for computing the padding at the end of the struct to align on the first member of the struct. This will probably the same as above, but we don't have any guarantees. */ typedef struct { short x; char c; } __Pyx_pad_short; typedef struct { int x; char c; } __Pyx_pad_int; typedef struct { long x; char c; } __Pyx_pad_long; typedef struct { float x; char c; } __Pyx_pad_float; typedef struct { double x; char c; } __Pyx_pad_double; typedef struct { long double x; char c; } __Pyx_pad_longdouble; typedef struct { void *x; char c; } __Pyx_pad_void_p; #ifdef HAVE_LONG_LONG typedef struct { PY_LONG_LONG x; char c; } __Pyx_pad_longlong; #endif static size_t __Pyx_BufFmt_TypeCharToPadding(char ch, CYTHON_UNUSED int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(__Pyx_pad_short) - sizeof(short); case 'i': case 'I': return sizeof(__Pyx_pad_int) - sizeof(int); case 'l': case 'L': return sizeof(__Pyx_pad_long) - sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(__Pyx_pad_longlong) - sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(__Pyx_pad_float) - sizeof(float); case 'd': return sizeof(__Pyx_pad_double) - sizeof(double); case 'g': return sizeof(__Pyx_pad_longdouble) - sizeof(long double); case 'P': case 'O': return sizeof(__Pyx_pad_void_p) - sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } static char __Pyx_BufFmt_TypeCharToGroup(char ch, int is_complex) { switch (ch) { case 'c': return 'H'; case 'b': case 'h': case 'i': case 'l': case 'q': case 's': case 'p': return 'I'; case 'B': case 'H': case 'I': case 'L': case 'Q': return 'U'; case 'f': case 'd': case 'g': return (is_complex ? 'C' : 'R'); case 'O': return 'O'; case 'P': return 'P'; default: { __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } } static void __Pyx_BufFmt_RaiseExpected(__Pyx_BufFmt_Context* ctx) { if (ctx->head == NULL || ctx->head->field == &ctx->root) { const char* expected; const char* quote; if (ctx->head == NULL) { expected = "end"; quote = ""; } else { expected = ctx->head->field->type->name; quote = "'"; } PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch, expected %s%s%s but got %s", quote, expected, quote, __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex)); } else { __Pyx_StructField* field = ctx->head->field; __Pyx_StructField* parent = (ctx->head - 1)->field; PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch, expected '%s' but got %s in '%s.%s'", field->type->name, __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex), parent->type->name, field->name); } } static int __Pyx_BufFmt_ProcessTypeChunk(__Pyx_BufFmt_Context* ctx) { char group; size_t size, offset, arraysize = 1; if (ctx->enc_type == 0) return 0; if (ctx->head->field->type->arraysize[0]) { int i, ndim = 0; if (ctx->enc_type == 's' || ctx->enc_type == 'p') { ctx->is_valid_array = ctx->head->field->type->ndim == 1; ndim = 1; if (ctx->enc_count != ctx->head->field->type->arraysize[0]) { PyErr_Format(PyExc_ValueError, "Expected a dimension of size %zu, got %zu", ctx->head->field->type->arraysize[0], ctx->enc_count); return -1; } } if (!ctx->is_valid_array) { PyErr_Format(PyExc_ValueError, "Expected %d dimensions, got %d", ctx->head->field->type->ndim, ndim); return -1; } for (i = 0; i < ctx->head->field->type->ndim; i++) { arraysize *= ctx->head->field->type->arraysize[i]; } ctx->is_valid_array = 0; ctx->enc_count = 1; } group = __Pyx_BufFmt_TypeCharToGroup(ctx->enc_type, ctx->is_complex); do { __Pyx_StructField* field = ctx->head->field; __Pyx_TypeInfo* type = field->type; if (ctx->enc_packmode == '@' || ctx->enc_packmode == '^') { size = __Pyx_BufFmt_TypeCharToNativeSize(ctx->enc_type, ctx->is_complex); } else { size = __Pyx_BufFmt_TypeCharToStandardSize(ctx->enc_type, ctx->is_complex); } if (ctx->enc_packmode == '@') { size_t align_at = __Pyx_BufFmt_TypeCharToAlignment(ctx->enc_type, ctx->is_complex); size_t align_mod_offset; if (align_at == 0) return -1; align_mod_offset = ctx->fmt_offset % align_at; if (align_mod_offset > 0) ctx->fmt_offset += align_at - align_mod_offset; if (ctx->struct_alignment == 0) ctx->struct_alignment = __Pyx_BufFmt_TypeCharToPadding(ctx->enc_type, ctx->is_complex); } if (type->size != size || type->typegroup != group) { if (type->typegroup == 'C' && type->fields != NULL) { size_t parent_offset = ctx->head->parent_offset + field->offset; ++ctx->head; ctx->head->field = type->fields; ctx->head->parent_offset = parent_offset; continue; } if ((type->typegroup == 'H' || group == 'H') && type->size == size) { } else { __Pyx_BufFmt_RaiseExpected(ctx); return -1; } } offset = ctx->head->parent_offset + field->offset; if (ctx->fmt_offset != offset) { PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch; next field is at offset %" CYTHON_FORMAT_SSIZE_T "d but %" CYTHON_FORMAT_SSIZE_T "d expected", (Py_ssize_t)ctx->fmt_offset, (Py_ssize_t)offset); return -1; } ctx->fmt_offset += size; if (arraysize) ctx->fmt_offset += (arraysize - 1) * size; --ctx->enc_count; /* Consume from buffer string */ while (1) { if (field == &ctx->root) { ctx->head = NULL; if (ctx->enc_count != 0) { __Pyx_BufFmt_RaiseExpected(ctx); return -1; } break; /* breaks both loops as ctx->enc_count == 0 */ } ctx->head->field = ++field; if (field->type == NULL) { --ctx->head; field = ctx->head->field; continue; } else if (field->type->typegroup == 'S') { size_t parent_offset = ctx->head->parent_offset + field->offset; if (field->type->fields->type == NULL) continue; /* empty struct */ field = field->type->fields; ++ctx->head; ctx->head->field = field; ctx->head->parent_offset = parent_offset; break; } else { break; } } } while (ctx->enc_count); ctx->enc_type = 0; ctx->is_complex = 0; return 0; } static CYTHON_INLINE PyObject * __pyx_buffmt_parse_array(__Pyx_BufFmt_Context* ctx, const char** tsp) { const char *ts = *tsp; int i = 0, number; int ndim = ctx->head->field->type->ndim; ; ++ts; if (ctx->new_count != 1) { PyErr_SetString(PyExc_ValueError, "Cannot handle repeated arrays in format string"); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; while (*ts && *ts != ')') { switch (*ts) { case ' ': case '\f': case '\r': case '\n': case '\t': case '\v': continue; default: break; /* not a 'break' in the loop */ } number = __Pyx_BufFmt_ExpectNumber(&ts); if (number == -1) return NULL; if (i < ndim && (size_t) number != ctx->head->field->type->arraysize[i]) return PyErr_Format(PyExc_ValueError, "Expected a dimension of size %zu, got %d", ctx->head->field->type->arraysize[i], number); if (*ts != ',' && *ts != ')') return PyErr_Format(PyExc_ValueError, "Expected a comma in format string, got '%c'", *ts); if (*ts == ',') ts++; i++; } if (i != ndim) return PyErr_Format(PyExc_ValueError, "Expected %d dimension(s), got %d", ctx->head->field->type->ndim, i); if (!*ts) { PyErr_SetString(PyExc_ValueError, "Unexpected end of format string, expected ')'"); return NULL; } ctx->is_valid_array = 1; ctx->new_count = 1; *tsp = ++ts; return Py_None; } static const char* __Pyx_BufFmt_CheckString(__Pyx_BufFmt_Context* ctx, const char* ts) { int got_Z = 0; while (1) { switch(*ts) { case 0: if (ctx->enc_type != 0 && ctx->head == NULL) { __Pyx_BufFmt_RaiseExpected(ctx); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; if (ctx->head != NULL) { __Pyx_BufFmt_RaiseExpected(ctx); return NULL; } return ts; case ' ': case 10: case 13: ++ts; break; case '<': if (!__Pyx_IsLittleEndian()) { PyErr_SetString(PyExc_ValueError, "Little-endian buffer not supported on big-endian compiler"); return NULL; } ctx->new_packmode = '='; ++ts; break; case '>': case '!': if (__Pyx_IsLittleEndian()) { PyErr_SetString(PyExc_ValueError, "Big-endian buffer not supported on little-endian compiler"); return NULL; } ctx->new_packmode = '='; ++ts; break; case '=': case '@': case '^': ctx->new_packmode = *ts++; break; case 'T': /* substruct */ { const char* ts_after_sub; size_t i, struct_count = ctx->new_count; size_t struct_alignment = ctx->struct_alignment; ctx->new_count = 1; ++ts; if (*ts != '{') { PyErr_SetString(PyExc_ValueError, "Buffer acquisition: Expected '{' after 'T'"); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_type = 0; /* Erase processed last struct element */ ctx->enc_count = 0; ctx->struct_alignment = 0; ++ts; ts_after_sub = ts; for (i = 0; i != struct_count; ++i) { ts_after_sub = __Pyx_BufFmt_CheckString(ctx, ts); if (!ts_after_sub) return NULL; } ts = ts_after_sub; if (struct_alignment) ctx->struct_alignment = struct_alignment; } break; case '}': /* end of substruct; either repeat or move on */ { size_t alignment = ctx->struct_alignment; ++ts; if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_type = 0; /* Erase processed last struct element */ if (alignment && ctx->fmt_offset % alignment) { ctx->fmt_offset += alignment - (ctx->fmt_offset % alignment); } } return ts; case 'x': if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->fmt_offset += ctx->new_count; ctx->new_count = 1; ctx->enc_count = 0; ctx->enc_type = 0; ctx->enc_packmode = ctx->new_packmode; ++ts; break; case 'Z': got_Z = 1; ++ts; if (*ts != 'f' && *ts != 'd' && *ts != 'g') { __Pyx_BufFmt_RaiseUnexpectedChar('Z'); return NULL; } /* fall through */ case 'c': case 'b': case 'B': case 'h': case 'H': case 'i': case 'I': case 'l': case 'L': case 'q': case 'Q': case 'f': case 'd': case 'g': case 'O': case 's': case 'p': if (ctx->enc_type == *ts && got_Z == ctx->is_complex && ctx->enc_packmode == ctx->new_packmode) { ctx->enc_count += ctx->new_count; } else { if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_count = ctx->new_count; ctx->enc_packmode = ctx->new_packmode; ctx->enc_type = *ts; ctx->is_complex = got_Z; } ++ts; ctx->new_count = 1; got_Z = 0; break; case ':': ++ts; while(*ts != ':') ++ts; ++ts; break; case '(': if (!__pyx_buffmt_parse_array(ctx, &ts)) return NULL; break; default: { int number = __Pyx_BufFmt_ExpectNumber(&ts); if (number == -1) return NULL; ctx->new_count = (size_t)number; } } } } static CYTHON_INLINE void __Pyx_ZeroBuffer(Py_buffer* buf) { buf->buf = NULL; buf->obj = NULL; buf->strides = __Pyx_zeros; buf->shape = __Pyx_zeros; buf->suboffsets = __Pyx_minusones; } static CYTHON_INLINE int __Pyx_GetBufferAndValidate( Py_buffer* buf, PyObject* obj, __Pyx_TypeInfo* dtype, int flags, int nd, int cast, __Pyx_BufFmt_StackElem* stack) { if (obj == Py_None || obj == NULL) { __Pyx_ZeroBuffer(buf); return 0; } buf->buf = NULL; if (__Pyx_GetBuffer(obj, buf, flags) == -1) goto fail; if (buf->ndim != nd) { PyErr_Format(PyExc_ValueError, "Buffer has wrong number of dimensions (expected %d, got %d)", nd, buf->ndim); goto fail; } if (!cast) { __Pyx_BufFmt_Context ctx; __Pyx_BufFmt_Init(&ctx, stack, dtype); if (!__Pyx_BufFmt_CheckString(&ctx, buf->format)) goto fail; } if ((unsigned)buf->itemsize != dtype->size) { PyErr_Format(PyExc_ValueError, "Item size of buffer (%" CYTHON_FORMAT_SSIZE_T "d byte%s) does not match size of '%s' (%" CYTHON_FORMAT_SSIZE_T "d byte%s)", buf->itemsize, (buf->itemsize > 1) ? "s" : "", dtype->name, (Py_ssize_t)dtype->size, (dtype->size > 1) ? "s" : ""); goto fail; } if (buf->suboffsets == NULL) buf->suboffsets = __Pyx_minusones; return 0; fail:; __Pyx_ZeroBuffer(buf); return -1; } static CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info) { if (info->buf == NULL) return; if (info->suboffsets == __Pyx_minusones) info->suboffsets = NULL; __Pyx_ReleaseBuffer(info); } #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw) { PyObject *result; ternaryfunc call = func->ob_type->tp_call; if (unlikely(!call)) return PyObject_Call(func, arg, kw); #if PY_VERSION_HEX >= 0x02060000 if (unlikely(Py_EnterRecursiveCall((char*)" while calling a Python object"))) return NULL; #endif result = (*call)(func, arg, kw); #if PY_VERSION_HEX >= 0x02060000 Py_LeaveRecursiveCall(); #endif if (unlikely(!result) && unlikely(!PyErr_Occurred())) { PyErr_SetString( PyExc_SystemError, "NULL result without error in PyObject_Call"); } return result; } #endif static CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb) { #if CYTHON_COMPILING_IN_CPYTHON PyObject *tmp_type, *tmp_value, *tmp_tb; PyThreadState *tstate = PyThreadState_GET(); tmp_type = tstate->curexc_type; tmp_value = tstate->curexc_value; tmp_tb = tstate->curexc_traceback; tstate->curexc_type = type; tstate->curexc_value = value; tstate->curexc_traceback = tb; Py_XDECREF(tmp_type); Py_XDECREF(tmp_value); Py_XDECREF(tmp_tb); #else PyErr_Restore(type, value, tb); #endif } static CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb) { #if CYTHON_COMPILING_IN_CPYTHON PyThreadState *tstate = PyThreadState_GET(); *type = tstate->curexc_type; *value = tstate->curexc_value; *tb = tstate->curexc_traceback; tstate->curexc_type = 0; tstate->curexc_value = 0; tstate->curexc_traceback = 0; #else PyErr_Fetch(type, value, tb); #endif } #if PY_MAJOR_VERSION < 3 static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, CYTHON_UNUSED PyObject *cause) { Py_XINCREF(type); if (!value || value == Py_None) value = NULL; else Py_INCREF(value); if (!tb || tb == Py_None) tb = NULL; else { Py_INCREF(tb); if (!PyTraceBack_Check(tb)) { PyErr_SetString(PyExc_TypeError, "raise: arg 3 must be a traceback or None"); goto raise_error; } } #if PY_VERSION_HEX < 0x02050000 if (PyClass_Check(type)) { #else if (PyType_Check(type)) { #endif #if CYTHON_COMPILING_IN_PYPY if (!value) { Py_INCREF(Py_None); value = Py_None; } #endif PyErr_NormalizeException(&type, &value, &tb); } else { if (value) { PyErr_SetString(PyExc_TypeError, "instance exception may not have a separate value"); goto raise_error; } value = type; #if PY_VERSION_HEX < 0x02050000 if (PyInstance_Check(type)) { type = (PyObject*) ((PyInstanceObject*)type)->in_class; Py_INCREF(type); } else { type = 0; PyErr_SetString(PyExc_TypeError, "raise: exception must be an old-style class or instance"); goto raise_error; } #else type = (PyObject*) Py_TYPE(type); Py_INCREF(type); if (!PyType_IsSubtype((PyTypeObject *)type, (PyTypeObject *)PyExc_BaseException)) { PyErr_SetString(PyExc_TypeError, "raise: exception class must be a subclass of BaseException"); goto raise_error; } #endif } __Pyx_ErrRestore(type, value, tb); return; raise_error: Py_XDECREF(value); Py_XDECREF(type); Py_XDECREF(tb); return; } #else /* Python 3+ */ static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause) { PyObject* owned_instance = NULL; if (tb == Py_None) { tb = 0; } else if (tb && !PyTraceBack_Check(tb)) { PyErr_SetString(PyExc_TypeError, "raise: arg 3 must be a traceback or None"); goto bad; } if (value == Py_None) value = 0; if (PyExceptionInstance_Check(type)) { if (value) { PyErr_SetString(PyExc_TypeError, "instance exception may not have a separate value"); goto bad; } value = type; type = (PyObject*) Py_TYPE(value); } else if (PyExceptionClass_Check(type)) { PyObject *instance_class = NULL; if (value && PyExceptionInstance_Check(value)) { instance_class = (PyObject*) Py_TYPE(value); if (instance_class != type) { if (PyObject_IsSubclass(instance_class, type)) { type = instance_class; } else { instance_class = NULL; } } } if (!instance_class) { PyObject *args; if (!value) args = PyTuple_New(0); else if (PyTuple_Check(value)) { Py_INCREF(value); args = value; } else args = PyTuple_Pack(1, value); if (!args) goto bad; owned_instance = PyObject_Call(type, args, NULL); Py_DECREF(args); if (!owned_instance) goto bad; value = owned_instance; if (!PyExceptionInstance_Check(value)) { PyErr_Format(PyExc_TypeError, "calling %R should have returned an instance of " "BaseException, not %R", type, Py_TYPE(value)); goto bad; } } } else { PyErr_SetString(PyExc_TypeError, "raise: exception class must be a subclass of BaseException"); goto bad; } #if PY_VERSION_HEX >= 0x03030000 if (cause) { #else if (cause && cause != Py_None) { #endif PyObject *fixed_cause; if (cause == Py_None) { fixed_cause = NULL; } else if (PyExceptionClass_Check(cause)) { fixed_cause = PyObject_CallObject(cause, NULL); if (fixed_cause == NULL) goto bad; } else if (PyExceptionInstance_Check(cause)) { fixed_cause = cause; Py_INCREF(fixed_cause); } else { PyErr_SetString(PyExc_TypeError, "exception causes must derive from " "BaseException"); goto bad; } PyException_SetCause(value, fixed_cause); } PyErr_SetObject(type, value); if (tb) { PyThreadState *tstate = PyThreadState_GET(); PyObject* tmp_tb = tstate->curexc_traceback; if (tb != tmp_tb) { Py_INCREF(tb); tstate->curexc_traceback = tb; Py_XDECREF(tmp_tb); } } bad: Py_XDECREF(owned_instance); return; } #endif static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Generic(PyObject *o, PyObject* j) { PyObject *r; if (!j) return NULL; r = PyObject_GetItem(o, j); Py_DECREF(j); return r; } static CYTHON_INLINE PyObject *__Pyx_GetItemInt_List_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck) { #if CYTHON_COMPILING_IN_CPYTHON if (wraparound & unlikely(i < 0)) i += PyList_GET_SIZE(o); if ((!boundscheck) || likely((0 <= i) & (i < PyList_GET_SIZE(o)))) { PyObject *r = PyList_GET_ITEM(o, i); Py_INCREF(r); return r; } return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i)); #else return PySequence_GetItem(o, i); #endif } static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Tuple_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck) { #if CYTHON_COMPILING_IN_CPYTHON if (wraparound & unlikely(i < 0)) i += PyTuple_GET_SIZE(o); if ((!boundscheck) || likely((0 <= i) & (i < PyTuple_GET_SIZE(o)))) { PyObject *r = PyTuple_GET_ITEM(o, i); Py_INCREF(r); return r; } return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i)); #else return PySequence_GetItem(o, i); #endif } static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Fast(PyObject *o, Py_ssize_t i, int is_list, int wraparound, int boundscheck) { #if CYTHON_COMPILING_IN_CPYTHON if (is_list || PyList_CheckExact(o)) { Py_ssize_t n = ((!wraparound) | likely(i >= 0)) ? i : i + PyList_GET_SIZE(o); if ((!boundscheck) || (likely((n >= 0) & (n < PyList_GET_SIZE(o))))) { PyObject *r = PyList_GET_ITEM(o, n); Py_INCREF(r); return r; } } else if (PyTuple_CheckExact(o)) { Py_ssize_t n = ((!wraparound) | likely(i >= 0)) ? i : i + PyTuple_GET_SIZE(o); if ((!boundscheck) || likely((n >= 0) & (n < PyTuple_GET_SIZE(o)))) { PyObject *r = PyTuple_GET_ITEM(o, n); Py_INCREF(r); return r; } } else { PySequenceMethods *m = Py_TYPE(o)->tp_as_sequence; if (likely(m && m->sq_item)) { if (wraparound && unlikely(i < 0) && likely(m->sq_length)) { Py_ssize_t l = m->sq_length(o); if (likely(l >= 0)) { i += l; } else { if (PyErr_ExceptionMatches(PyExc_OverflowError)) PyErr_Clear(); else return NULL; } } return m->sq_item(o, i); } } #else if (is_list || PySequence_Check(o)) { return PySequence_GetItem(o, i); } #endif return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i)); } static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name) { PyObject *result; #if CYTHON_COMPILING_IN_CPYTHON result = PyDict_GetItem(__pyx_d, name); if (result) { Py_INCREF(result); } else { #else result = PyObject_GetItem(__pyx_d, name); if (!result) { PyErr_Clear(); #endif result = __Pyx_GetBuiltinName(name); } return result; } static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type) { if (unlikely(!type)) { PyErr_SetString(PyExc_SystemError, "Missing type object"); return 0; } if (likely(PyObject_TypeCheck(obj, type))) return 1; PyErr_Format(PyExc_TypeError, "Cannot convert %.200s to %.200s", Py_TYPE(obj)->tp_name, type->tp_name); return 0; } static void __Pyx_RaiseBufferIndexError(int axis) { PyErr_Format(PyExc_IndexError, "Out of bounds on buffer access (axis %d)", axis); } static void __Pyx_RaiseBufferFallbackError(void) { PyErr_SetString(PyExc_ValueError, "Buffer acquisition failed on assignment; and then reacquiring the old buffer failed too!"); } static CYTHON_INLINE PyObject* __Pyx_PyObject_GetSlice( PyObject* obj, Py_ssize_t cstart, Py_ssize_t cstop, PyObject** _py_start, PyObject** _py_stop, PyObject** _py_slice, int has_cstart, int has_cstop, CYTHON_UNUSED int wraparound) { #if CYTHON_COMPILING_IN_CPYTHON PyMappingMethods* mp; #if PY_MAJOR_VERSION < 3 PySequenceMethods* ms = Py_TYPE(obj)->tp_as_sequence; if (likely(ms && ms->sq_slice)) { if (!has_cstart) { if (_py_start && (*_py_start != Py_None)) { cstart = __Pyx_PyIndex_AsSsize_t(*_py_start); if ((cstart == (Py_ssize_t)-1) && PyErr_Occurred()) goto bad; } else cstart = 0; } if (!has_cstop) { if (_py_stop && (*_py_stop != Py_None)) { cstop = __Pyx_PyIndex_AsSsize_t(*_py_stop); if ((cstop == (Py_ssize_t)-1) && PyErr_Occurred()) goto bad; } else cstop = PY_SSIZE_T_MAX; } if (wraparound && unlikely((cstart < 0) | (cstop < 0)) && likely(ms->sq_length)) { Py_ssize_t l = ms->sq_length(obj); if (likely(l >= 0)) { if (cstop < 0) { cstop += l; if (cstop < 0) cstop = 0; } if (cstart < 0) { cstart += l; if (cstart < 0) cstart = 0; } } else { if (PyErr_ExceptionMatches(PyExc_OverflowError)) PyErr_Clear(); else goto bad; } } return ms->sq_slice(obj, cstart, cstop); } #endif mp = Py_TYPE(obj)->tp_as_mapping; if (likely(mp && mp->mp_subscript)) #endif { PyObject* result; PyObject *py_slice, *py_start, *py_stop; if (_py_slice) { py_slice = *_py_slice; } else { PyObject* owned_start = NULL; PyObject* owned_stop = NULL; if (_py_start) { py_start = *_py_start; } else { if (has_cstart) { owned_start = py_start = PyInt_FromSsize_t(cstart); if (unlikely(!py_start)) goto bad; } else py_start = Py_None; } if (_py_stop) { py_stop = *_py_stop; } else { if (has_cstop) { owned_stop = py_stop = PyInt_FromSsize_t(cstop); if (unlikely(!py_stop)) { Py_XDECREF(owned_start); goto bad; } } else py_stop = Py_None; } py_slice = PySlice_New(py_start, py_stop, Py_None); Py_XDECREF(owned_start); Py_XDECREF(owned_stop); if (unlikely(!py_slice)) goto bad; } #if CYTHON_COMPILING_IN_CPYTHON result = mp->mp_subscript(obj, py_slice); #else result = PyObject_GetItem(obj, py_slice); #endif if (!_py_slice) { Py_DECREF(py_slice); } return result; } PyErr_Format(PyExc_TypeError, "'%.200s' object is unsliceable", Py_TYPE(obj)->tp_name); bad: return NULL; } static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected) { PyErr_Format(PyExc_ValueError, "too many values to unpack (expected %" CYTHON_FORMAT_SSIZE_T "d)", expected); } static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) { PyErr_Format(PyExc_ValueError, "need more than %" CYTHON_FORMAT_SSIZE_T "d value%.1s to unpack", index, (index == 1) ? "" : "s"); } static CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void) { PyErr_SetString(PyExc_TypeError, "'NoneType' object is not iterable"); } #if PY_MAJOR_VERSION < 3 static int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags) { #if PY_VERSION_HEX >= 0x02060000 if (PyObject_CheckBuffer(obj)) return PyObject_GetBuffer(obj, view, flags); #endif if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) return __pyx_pw_5numpy_7ndarray_1__getbuffer__(obj, view, flags); #if PY_VERSION_HEX < 0x02060000 if (obj->ob_type->tp_dict) { PyObject *getbuffer_cobj = PyObject_GetItem( obj->ob_type->tp_dict, __pyx_n_s_pyx_getbuffer); if (getbuffer_cobj) { getbufferproc func = (getbufferproc) PyCObject_AsVoidPtr(getbuffer_cobj); Py_DECREF(getbuffer_cobj); if (!func) goto fail; return func(obj, view, flags); } else { PyErr_Clear(); } } #endif PyErr_Format(PyExc_TypeError, "'%.200s' does not have the buffer interface", Py_TYPE(obj)->tp_name); #if PY_VERSION_HEX < 0x02060000 fail: #endif return -1; } static void __Pyx_ReleaseBuffer(Py_buffer *view) { PyObject *obj = view->obj; if (!obj) return; #if PY_VERSION_HEX >= 0x02060000 if (PyObject_CheckBuffer(obj)) { PyBuffer_Release(view); return; } #endif if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) { __pyx_pw_5numpy_7ndarray_3__releasebuffer__(obj, view); return; } #if PY_VERSION_HEX < 0x02060000 if (obj->ob_type->tp_dict) { PyObject *releasebuffer_cobj = PyObject_GetItem( obj->ob_type->tp_dict, __pyx_n_s_pyx_releasebuffer); if (releasebuffer_cobj) { releasebufferproc func = (releasebufferproc) PyCObject_AsVoidPtr(releasebuffer_cobj); Py_DECREF(releasebuffer_cobj); if (!func) goto fail; func(obj, view); return; } else { PyErr_Clear(); } } #endif goto nofail; #if PY_VERSION_HEX < 0x02060000 fail: #endif PyErr_WriteUnraisable(obj); nofail: Py_DECREF(obj); view->obj = NULL; } #endif /* PY_MAJOR_VERSION < 3 */ static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level) { PyObject *empty_list = 0; PyObject *module = 0; PyObject *global_dict = 0; PyObject *empty_dict = 0; PyObject *list; #if PY_VERSION_HEX < 0x03030000 PyObject *py_import; py_import = __Pyx_PyObject_GetAttrStr(__pyx_b, __pyx_n_s_import); if (!py_import) goto bad; #endif if (from_list) list = from_list; else { empty_list = PyList_New(0); if (!empty_list) goto bad; list = empty_list; } global_dict = PyModule_GetDict(__pyx_m); if (!global_dict) goto bad; empty_dict = PyDict_New(); if (!empty_dict) goto bad; #if PY_VERSION_HEX >= 0x02050000 { #if PY_MAJOR_VERSION >= 3 if (level == -1) { if (strchr(__Pyx_MODULE_NAME, '.')) { #if PY_VERSION_HEX < 0x03030000 PyObject *py_level = PyInt_FromLong(1); if (!py_level) goto bad; module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, py_level, NULL); Py_DECREF(py_level); #else module = PyImport_ImportModuleLevelObject( name, global_dict, empty_dict, list, 1); #endif if (!module) { if (!PyErr_ExceptionMatches(PyExc_ImportError)) goto bad; PyErr_Clear(); } } level = 0; /* try absolute import on failure */ } #endif if (!module) { #if PY_VERSION_HEX < 0x03030000 PyObject *py_level = PyInt_FromLong(level); if (!py_level) goto bad; module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, py_level, NULL); Py_DECREF(py_level); #else module = PyImport_ImportModuleLevelObject( name, global_dict, empty_dict, list, level); #endif } } #else if (level>0) { PyErr_SetString(PyExc_RuntimeError, "Relative import is not supported for Python <=2.4."); goto bad; } module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, NULL); #endif bad: #if PY_VERSION_HEX < 0x03030000 Py_XDECREF(py_import); #endif Py_XDECREF(empty_list); Py_XDECREF(empty_dict); return module; } #define __PYX_VERIFY_RETURN_INT(target_type, func_type, func) \ { \ func_type value = func(x); \ if (sizeof(target_type) < sizeof(func_type)) { \ if (unlikely(value != (func_type) (target_type) value)) { \ func_type zero = 0; \ PyErr_SetString(PyExc_OverflowError, \ (is_unsigned && unlikely(value < zero)) ? \ "can't convert negative value to " #target_type : \ "value too large to convert to " #target_type); \ return (target_type) -1; \ } \ } \ return (target_type) value; \ } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *x) { const int neg_one = (int) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(int) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(int, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int"); return (int) -1; } return (int) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (int) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int"); return (int) -1; } if (sizeof(int) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(int, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(int) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(int, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(int) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(int) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(int) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(int, long, PyLong_AsLong) } else if (sizeof(int) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(int, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else int val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (int) -1; } } else { int val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (int) -1; val = __Pyx_PyInt_As_int(tmp); Py_DECREF(tmp); return val; } } static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value) { const long neg_one = (long) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(long) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(long) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(long) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(long) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(long) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(long), little, !is_unsigned); } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE int64 __Pyx_PyInt_As_int64(PyObject *x) { const int64 neg_one = (int64) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(int64) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(int64, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int64"); return (int64) -1; } return (int64) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int64)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (int64) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int64"); return (int64) -1; } if (sizeof(int64) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(int64, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(int64) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(int64, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int64)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(int64) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(int64) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(int64) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(int64, long, PyLong_AsLong) } else if (sizeof(int64) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(int64, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else int64 val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (int64) -1; } } else { int64 val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (int64) -1; val = __Pyx_PyInt_As_int64(tmp); Py_DECREF(tmp); return val; } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *x) { const size_t neg_one = (size_t) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(size_t) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(size_t, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to size_t"); return (size_t) -1; } return (size_t) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(size_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (size_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to size_t"); return (size_t) -1; } if (sizeof(size_t) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(size_t, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(size_t) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(size_t, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(size_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(size_t) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(size_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(size_t) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(size_t, long, PyLong_AsLong) } else if (sizeof(size_t) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(size_t, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else size_t val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (size_t) -1; } } else { size_t val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (size_t) -1; val = __Pyx_PyInt_As_size_t(tmp); Py_DECREF(tmp); return val; } } static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int64(int64 value) { const int64 neg_one = (int64) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(int64) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int64) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(int64) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(int64) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int64) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(int64), little, !is_unsigned); } } #if CYTHON_CCOMPLEX #ifdef __cplusplus static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { return ::std::complex< float >(x, y); } #else static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { return x + y*(__pyx_t_float_complex)_Complex_I; } #endif #else static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { __pyx_t_float_complex z; z.real = x; z.imag = y; return z; } #endif #if CYTHON_CCOMPLEX #else static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex a, __pyx_t_float_complex b) { return (a.real == b.real) && (a.imag == b.imag); } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real + b.real; z.imag = a.imag + b.imag; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real - b.real; z.imag = a.imag - b.imag; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real * b.real - a.imag * b.imag; z.imag = a.real * b.imag + a.imag * b.real; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; float denom = b.real * b.real + b.imag * b.imag; z.real = (a.real * b.real + a.imag * b.imag) / denom; z.imag = (a.imag * b.real - a.real * b.imag) / denom; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex a) { __pyx_t_float_complex z; z.real = -a.real; z.imag = -a.imag; return z; } static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex a) { return (a.real == 0) && (a.imag == 0); } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex a) { __pyx_t_float_complex z; z.real = a.real; z.imag = -a.imag; return z; } #if 1 static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex z) { #if !defined(HAVE_HYPOT) || defined(_MSC_VER) return sqrtf(z.real*z.real + z.imag*z.imag); #else return hypotf(z.real, z.imag); #endif } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; float r, lnr, theta, z_r, z_theta; if (b.imag == 0 && b.real == (int)b.real) { if (b.real < 0) { float denom = a.real * a.real + a.imag * a.imag; a.real = a.real / denom; a.imag = -a.imag / denom; b.real = -b.real; } switch ((int)b.real) { case 0: z.real = 1; z.imag = 0; return z; case 1: return a; case 2: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(a, a); case 3: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(z, a); case 4: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(z, z); } } if (a.imag == 0) { if (a.real == 0) { return a; } r = a.real; theta = 0; } else { r = __Pyx_c_absf(a); theta = atan2f(a.imag, a.real); } lnr = logf(r); z_r = expf(lnr * b.real - theta * b.imag); z_theta = theta * b.real + lnr * b.imag; z.real = z_r * cosf(z_theta); z.imag = z_r * sinf(z_theta); return z; } #endif #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { return ::std::complex< double >(x, y); } #else static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { return x + y*(__pyx_t_double_complex)_Complex_I; } #endif #else static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { __pyx_t_double_complex z; z.real = x; z.imag = y; return z; } #endif #if CYTHON_CCOMPLEX #else static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex a, __pyx_t_double_complex b) { return (a.real == b.real) && (a.imag == b.imag); } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real + b.real; z.imag = a.imag + b.imag; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real - b.real; z.imag = a.imag - b.imag; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real * b.real - a.imag * b.imag; z.imag = a.real * b.imag + a.imag * b.real; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; double denom = b.real * b.real + b.imag * b.imag; z.real = (a.real * b.real + a.imag * b.imag) / denom; z.imag = (a.imag * b.real - a.real * b.imag) / denom; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex a) { __pyx_t_double_complex z; z.real = -a.real; z.imag = -a.imag; return z; } static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex a) { return (a.real == 0) && (a.imag == 0); } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex a) { __pyx_t_double_complex z; z.real = a.real; z.imag = -a.imag; return z; } #if 1 static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex z) { #if !defined(HAVE_HYPOT) || defined(_MSC_VER) return sqrt(z.real*z.real + z.imag*z.imag); #else return hypot(z.real, z.imag); #endif } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; double r, lnr, theta, z_r, z_theta; if (b.imag == 0 && b.real == (int)b.real) { if (b.real < 0) { double denom = a.real * a.real + a.imag * a.imag; a.real = a.real / denom; a.imag = -a.imag / denom; b.real = -b.real; } switch ((int)b.real) { case 0: z.real = 1; z.imag = 0; return z; case 1: return a; case 2: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(a, a); case 3: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(z, a); case 4: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(z, z); } } if (a.imag == 0) { if (a.real == 0) { return a; } r = a.real; theta = 0; } else { r = __Pyx_c_abs(a); theta = atan2(a.imag, a.real); } lnr = log(r); z_r = exp(lnr * b.real - theta * b.imag); z_theta = theta * b.real + lnr * b.imag; z.real = z_r * cos(z_theta); z.imag = z_r * sin(z_theta); return z; } #endif #endif static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value) { const int neg_one = (int) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(int) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(int) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(int) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(int), little, !is_unsigned); } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *x) { const long neg_one = (long) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(long) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(long, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to long"); return (long) -1; } return (long) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(long)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (long) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to long"); return (long) -1; } if (sizeof(long) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(long, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(long) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(long, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(long)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(long) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(long) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(long) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(long, long, PyLong_AsLong) } else if (sizeof(long) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(long, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else long val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (long) -1; } } else { long val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (long) -1; val = __Pyx_PyInt_As_long(tmp); Py_DECREF(tmp); return val; } } static int __Pyx_check_binary_version(void) { char ctversion[4], rtversion[4]; PyOS_snprintf(ctversion, 4, "%d.%d", PY_MAJOR_VERSION, PY_MINOR_VERSION); PyOS_snprintf(rtversion, 4, "%s", Py_GetVersion()); if (ctversion[0] != rtversion[0] || ctversion[2] != rtversion[2]) { char message[200]; PyOS_snprintf(message, sizeof(message), "compiletime version %s of module '%.100s' " "does not match runtime version %s", ctversion, __Pyx_MODULE_NAME, rtversion); #if PY_VERSION_HEX < 0x02050000 return PyErr_Warn(NULL, message); #else return PyErr_WarnEx(NULL, message, 1); #endif } return 0; } #ifndef __PYX_HAVE_RT_ImportModule #define __PYX_HAVE_RT_ImportModule static PyObject *__Pyx_ImportModule(const char *name) { PyObject *py_name = 0; PyObject *py_module = 0; py_name = __Pyx_PyIdentifier_FromString(name); if (!py_name) goto bad; py_module = PyImport_Import(py_name); Py_DECREF(py_name); return py_module; bad: Py_XDECREF(py_name); return 0; } #endif #ifndef __PYX_HAVE_RT_ImportType #define __PYX_HAVE_RT_ImportType static PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, size_t size, int strict) { PyObject *py_module = 0; PyObject *result = 0; PyObject *py_name = 0; char warning[200]; Py_ssize_t basicsize; #ifdef Py_LIMITED_API PyObject *py_basicsize; #endif py_module = __Pyx_ImportModule(module_name); if (!py_module) goto bad; py_name = __Pyx_PyIdentifier_FromString(class_name); if (!py_name) goto bad; result = PyObject_GetAttr(py_module, py_name); Py_DECREF(py_name); py_name = 0; Py_DECREF(py_module); py_module = 0; if (!result) goto bad; if (!PyType_Check(result)) { PyErr_Format(PyExc_TypeError, "%.200s.%.200s is not a type object", module_name, class_name); goto bad; } #ifndef Py_LIMITED_API basicsize = ((PyTypeObject *)result)->tp_basicsize; #else py_basicsize = PyObject_GetAttrString(result, "__basicsize__"); if (!py_basicsize) goto bad; basicsize = PyLong_AsSsize_t(py_basicsize); Py_DECREF(py_basicsize); py_basicsize = 0; if (basicsize == (Py_ssize_t)-1 && PyErr_Occurred()) goto bad; #endif if (!strict && (size_t)basicsize > size) { PyOS_snprintf(warning, sizeof(warning), "%s.%s size changed, may indicate binary incompatibility", module_name, class_name); #if PY_VERSION_HEX < 0x02050000 if (PyErr_Warn(NULL, warning) < 0) goto bad; #else if (PyErr_WarnEx(NULL, warning, 0) < 0) goto bad; #endif } else if ((size_t)basicsize != size) { PyErr_Format(PyExc_ValueError, "%.200s.%.200s has the wrong size, try recompiling", module_name, class_name); goto bad; } return (PyTypeObject *)result; bad: Py_XDECREF(py_module); Py_XDECREF(result); return NULL; } #endif static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line) { int start = 0, mid = 0, end = count - 1; if (end >= 0 && code_line > entries[end].code_line) { return count; } while (start < end) { mid = (start + end) / 2; if (code_line < entries[mid].code_line) { end = mid; } else if (code_line > entries[mid].code_line) { start = mid + 1; } else { return mid; } } if (code_line <= entries[mid].code_line) { return mid; } else { return mid + 1; } } static PyCodeObject *__pyx_find_code_object(int code_line) { PyCodeObject* code_object; int pos; if (unlikely(!code_line) || unlikely(!__pyx_code_cache.entries)) { return NULL; } pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line); if (unlikely(pos >= __pyx_code_cache.count) || unlikely(__pyx_code_cache.entries[pos].code_line != code_line)) { return NULL; } code_object = __pyx_code_cache.entries[pos].code_object; Py_INCREF(code_object); return code_object; } static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object) { int pos, i; __Pyx_CodeObjectCacheEntry* entries = __pyx_code_cache.entries; if (unlikely(!code_line)) { return; } if (unlikely(!entries)) { entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Malloc(64*sizeof(__Pyx_CodeObjectCacheEntry)); if (likely(entries)) { __pyx_code_cache.entries = entries; __pyx_code_cache.max_count = 64; __pyx_code_cache.count = 1; entries[0].code_line = code_line; entries[0].code_object = code_object; Py_INCREF(code_object); } return; } pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line); if ((pos < __pyx_code_cache.count) && unlikely(__pyx_code_cache.entries[pos].code_line == code_line)) { PyCodeObject* tmp = entries[pos].code_object; entries[pos].code_object = code_object; Py_DECREF(tmp); return; } if (__pyx_code_cache.count == __pyx_code_cache.max_count) { int new_max = __pyx_code_cache.max_count + 64; entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Realloc( __pyx_code_cache.entries, new_max*sizeof(__Pyx_CodeObjectCacheEntry)); if (unlikely(!entries)) { return; } __pyx_code_cache.entries = entries; __pyx_code_cache.max_count = new_max; } for (i=__pyx_code_cache.count; i>pos; i--) { entries[i] = entries[i-1]; } entries[pos].code_line = code_line; entries[pos].code_object = code_object; __pyx_code_cache.count++; Py_INCREF(code_object); } #include "compile.h" #include "frameobject.h" #include "traceback.h" static PyCodeObject* __Pyx_CreateCodeObjectForTraceback( const char *funcname, int c_line, int py_line, const char *filename) { PyCodeObject *py_code = 0; PyObject *py_srcfile = 0; PyObject *py_funcname = 0; #if PY_MAJOR_VERSION < 3 py_srcfile = PyString_FromString(filename); #else py_srcfile = PyUnicode_FromString(filename); #endif if (!py_srcfile) goto bad; if (c_line) { #if PY_MAJOR_VERSION < 3 py_funcname = PyString_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line); #else py_funcname = PyUnicode_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line); #endif } else { #if PY_MAJOR_VERSION < 3 py_funcname = PyString_FromString(funcname); #else py_funcname = PyUnicode_FromString(funcname); #endif } if (!py_funcname) goto bad; py_code = __Pyx_PyCode_New( 0, /*int argcount,*/ 0, /*int kwonlyargcount,*/ 0, /*int nlocals,*/ 0, /*int stacksize,*/ 0, /*int flags,*/ __pyx_empty_bytes, /*PyObject *code,*/ __pyx_empty_tuple, /*PyObject *consts,*/ __pyx_empty_tuple, /*PyObject *names,*/ __pyx_empty_tuple, /*PyObject *varnames,*/ __pyx_empty_tuple, /*PyObject *freevars,*/ __pyx_empty_tuple, /*PyObject *cellvars,*/ py_srcfile, /*PyObject *filename,*/ py_funcname, /*PyObject *name,*/ py_line, /*int firstlineno,*/ __pyx_empty_bytes /*PyObject *lnotab*/ ); Py_DECREF(py_srcfile); Py_DECREF(py_funcname); return py_code; bad: Py_XDECREF(py_srcfile); Py_XDECREF(py_funcname); return NULL; } static void __Pyx_AddTraceback(const char *funcname, int c_line, int py_line, const char *filename) { PyCodeObject *py_code = 0; PyObject *py_globals = 0; PyFrameObject *py_frame = 0; py_code = __pyx_find_code_object(c_line ? c_line : py_line); if (!py_code) { py_code = __Pyx_CreateCodeObjectForTraceback( funcname, c_line, py_line, filename); if (!py_code) goto bad; __pyx_insert_code_object(c_line ? c_line : py_line, py_code); } py_globals = PyModule_GetDict(__pyx_m); if (!py_globals) goto bad; py_frame = PyFrame_New( PyThreadState_GET(), /*PyThreadState *tstate,*/ py_code, /*PyCodeObject *code,*/ py_globals, /*PyObject *globals,*/ 0 /*PyObject *locals*/ ); if (!py_frame) goto bad; py_frame->f_lineno = py_line; PyTraceBack_Here(py_frame); bad: Py_XDECREF(py_code); Py_XDECREF(py_frame); } static int __Pyx_InitStrings(__Pyx_StringTabEntry *t) { while (t->p) { #if PY_MAJOR_VERSION < 3 if (t->is_unicode) { *t->p = PyUnicode_DecodeUTF8(t->s, t->n - 1, NULL); } else if (t->intern) { *t->p = PyString_InternFromString(t->s); } else { *t->p = PyString_FromStringAndSize(t->s, t->n - 1); } #else /* Python 3+ has unicode identifiers */ if (t->is_unicode | t->is_str) { if (t->intern) { *t->p = PyUnicode_InternFromString(t->s); } else if (t->encoding) { *t->p = PyUnicode_Decode(t->s, t->n - 1, t->encoding, NULL); } else { *t->p = PyUnicode_FromStringAndSize(t->s, t->n - 1); } } else { *t->p = PyBytes_FromStringAndSize(t->s, t->n - 1); } #endif if (!*t->p) return -1; ++t; } return 0; } static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(char* c_str) { return __Pyx_PyUnicode_FromStringAndSize(c_str, strlen(c_str)); } static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject* o) { Py_ssize_t ignore; return __Pyx_PyObject_AsStringAndSize(o, &ignore); } static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject* o, Py_ssize_t *length) { #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT if ( #if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII __Pyx_sys_getdefaultencoding_not_ascii && #endif PyUnicode_Check(o)) { #if PY_VERSION_HEX < 0x03030000 char* defenc_c; PyObject* defenc = _PyUnicode_AsDefaultEncodedString(o, NULL); if (!defenc) return NULL; defenc_c = PyBytes_AS_STRING(defenc); #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII { char* end = defenc_c + PyBytes_GET_SIZE(defenc); char* c; for (c = defenc_c; c < end; c++) { if ((unsigned char) (*c) >= 128) { PyUnicode_AsASCIIString(o); return NULL; } } } #endif /*__PYX_DEFAULT_STRING_ENCODING_IS_ASCII*/ *length = PyBytes_GET_SIZE(defenc); return defenc_c; #else /* PY_VERSION_HEX < 0x03030000 */ if (PyUnicode_READY(o) == -1) return NULL; #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII if (PyUnicode_IS_ASCII(o)) { *length = PyUnicode_GET_DATA_SIZE(o); return PyUnicode_AsUTF8(o); } else { PyUnicode_AsASCIIString(o); return NULL; } #else /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII */ return PyUnicode_AsUTF8AndSize(o, length); #endif /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII */ #endif /* PY_VERSION_HEX < 0x03030000 */ } else #endif /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT */ #if !CYTHON_COMPILING_IN_PYPY #if PY_VERSION_HEX >= 0x02060000 if (PyByteArray_Check(o)) { *length = PyByteArray_GET_SIZE(o); return PyByteArray_AS_STRING(o); } else #endif #endif { char* result; int r = PyBytes_AsStringAndSize(o, &result, length); if (unlikely(r < 0)) { return NULL; } else { return result; } } } static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject* x) { int is_true = x == Py_True; if (is_true | (x == Py_False) | (x == Py_None)) return is_true; else return PyObject_IsTrue(x); } static CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x) { PyNumberMethods *m; const char *name = NULL; PyObject *res = NULL; #if PY_MAJOR_VERSION < 3 if (PyInt_Check(x) || PyLong_Check(x)) #else if (PyLong_Check(x)) #endif return Py_INCREF(x), x; m = Py_TYPE(x)->tp_as_number; #if PY_MAJOR_VERSION < 3 if (m && m->nb_int) { name = "int"; res = PyNumber_Int(x); } else if (m && m->nb_long) { name = "long"; res = PyNumber_Long(x); } #else if (m && m->nb_int) { name = "int"; res = PyNumber_Long(x); } #endif if (res) { #if PY_MAJOR_VERSION < 3 if (!PyInt_Check(res) && !PyLong_Check(res)) { #else if (!PyLong_Check(res)) { #endif PyErr_Format(PyExc_TypeError, "__%.4s__ returned non-%.4s (type %.200s)", name, name, Py_TYPE(res)->tp_name); Py_DECREF(res); return NULL; } } else if (!PyErr_Occurred()) { PyErr_SetString(PyExc_TypeError, "an integer is required"); } return res; } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) { Py_ssize_t ival; PyObject *x; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_CheckExact(b))) return PyInt_AS_LONG(b); #endif if (likely(PyLong_CheckExact(b))) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS switch (Py_SIZE(b)) { case -1: return -(sdigit)((PyLongObject*)b)->ob_digit[0]; case 0: return 0; case 1: return ((PyLongObject*)b)->ob_digit[0]; } #endif #endif #if PY_VERSION_HEX < 0x02060000 return PyInt_AsSsize_t(b); #else return PyLong_AsSsize_t(b); #endif } x = PyNumber_Index(b); if (!x) return -1; ival = PyInt_AsSsize_t(x); Py_DECREF(x); return ival; } static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) { #if PY_VERSION_HEX < 0x02050000 if (ival <= LONG_MAX) return PyInt_FromLong((long)ival); else { unsigned char *bytes = (unsigned char *) &ival; int one = 1; int little = (int)*(unsigned char*)&one; return _PyLong_FromByteArray(bytes, sizeof(size_t), little, 0); } #else return PyInt_FromSize_t(ival); #endif } #endif /* Py_PYTHON_H */ healpy-1.8.1/healpy/src/_sphtools.pyx0000644000175000017500000004606212336442722020113 0ustar zoncazonca00000000000000# coding: utf-8 # Wrapper around the query_disc method of Healpix_base class import numpy as np cimport numpy as np from libcpp.string cimport string from libc.math cimport sqrt, floor, fabs cimport libc from healpy import npix2nside, nside2npix from healpy.pixelfunc import maptype import os import cython from libcpp cimport bool as cbool from _common cimport tsize, arr, xcomplex, Healpix_Ordering_Scheme, RING, NEST, Healpix_Map, Alm, ndarray2map, ndarray2alm cdef double UNSEEN = -1.6375e30 cdef double rtol_UNSEEN = 1.e-7 * 1.6375e30 cdef extern from "alm_healpix_tools.h": cdef void map2alm_iter(Healpix_Map[double] &m, Alm[xcomplex[double]] &alm, int num_iter, arr[double] &weight) cdef void map2alm_pol_iter(Healpix_Map[double] &mapT, Healpix_Map[double] &mapQ, Healpix_Map[double] &mapU, Alm[xcomplex[double]] &almT, Alm[xcomplex[double]] &almG, Alm[xcomplex[double]] &almC, int num_iter, arr[double] &weight) cdef void map2alm_spin( Healpix_Map[double] &map1, Healpix_Map[double] &map2, Alm[xcomplex[double]] &alm1, Alm[xcomplex[double]] &alm2, int spin, arr[double] &weight, cbool add_alm) cdef void alm2map_spin( Alm[xcomplex[double]] &alm1, Alm[xcomplex[double]] &alm2, Healpix_Map[double] &map1, Healpix_Map[double] &map2, int spin) cdef extern from "alm_powspec_tools.h": cdef void c_rotate_alm "rotate_alm" (Alm[xcomplex[double]] &alm, double psi, double theta, double phi) cdef void c_rotate_alm "rotate_alm" (Alm[xcomplex[double]] &ai, Alm[xcomplex[double]] &ag, Alm[xcomplex[double]] &ac, double psi, double theta, double phi) cdef extern from "healpix_data_io.h": cdef void read_weight_ring (string &dir, int nside, arr[double] &weight) DATAPATH = None def get_datapath(): global DATAPATH if DATAPATH is None: DATAPATH = os.path.join(os.path.dirname(os.path.abspath(__file__)), 'data') return DATAPATH def map2alm_spin_healpy(maps, spin, lmax = None, mmax = None): """Computes the spinned alm of a 2 Healpix maps. Parameters ---------- m : list of 2 arrays list of 2 input maps as numpy arrays spin : int spin of the alms (either 1, 2 or 3) lmax : int, scalar, optional Maximum l of the power spectrum. Default: 3*nside-1 mmax : int, scalar, optional Maximum m of the alm. Default: lmax Returns ------- alms : list of 2 arrays list of 2 alms """ maps_c = [np.ascontiguousarray(m, dtype=np.float64) for m in maps] # create UNSEEN mask for map masks = [False if count_bad(m) == 0 else mkmask(m) for m in maps_c] # Adjust lmax and mmax cdef int lmax_, mmax_, nside, npix npix = maps_c[0].size nside = npix2nside(npix) if lmax is None: lmax_ = 3 * nside - 1 else: lmax_ = lmax if mmax is None: mmax_ = lmax_ else: mmax_ = mmax # Check all maps have same npix if maps_c[1].size != npix: raise ValueError("Input maps must have same size") # View the ndarray as a Healpix_Map M1 = ndarray2map(maps_c[0], RING) M2 = ndarray2map(maps_c[1], RING) # replace UNSEEN pixels with zeros for m, mask in zip(maps_c, masks): if mask: m[mask] = 0.0 # Create an ndarray object that will contain the alm for output (to be returned) n_alm = alm_getn(lmax_, mmax_) alms = [np.empty(n_alm, dtype=np.complex128) for m in maps] # View the ndarray as an Alm # Alms = [ndarray2alm(alm, lmax_, mmax_) for alm in alms] A1 = ndarray2alm(alms[0], lmax_, mmax_) A2 = ndarray2alm(alms[1], lmax_, mmax_) # ring weights cdef arr[double] * w_arr = new arr[double]() cdef int i cdef char *c_datapath w_arr.allocAndFill(2 * nside, 1.) map2alm_spin(M1[0], M2[0], A1[0], A2[0], spin, w_arr[0], False) # restore input map with UNSEEN pixels for m, mask in zip(maps_c, masks): if mask: m[mask] = UNSEEN del w_arr del M1, M2, A1, A2 return alms def alm2map_spin_healpy(alms, nside, spin, lmax, mmax=None): """Computes maps from a set of 2 spinned alm Parameters ---------- alms : list of 2 arrays list of 2 alms nside : int requested nside of the output map spin : int spin of the alms (either 1, 2 or 3) lmax : int, scalar Maximum l of the power spectrum. mmax : int, scalar, optional Maximum m of the alm. Default: lmax Returns ------- m : list of 2 arrays list of 2 out maps in RING scheme as numpy arrays """ alms_c = [np.ascontiguousarray(alm, dtype=np.complex128) for alm in alms] npix = nside2npix(nside) maps = [np.zeros(npix, dtype=np.float64) for alm in alms] # View the ndarray as a Healpix_Map M1 = ndarray2map(maps[0], RING) M2 = ndarray2map(maps[1], RING) if not mmax: mmax = lmax # View the ndarray as an Alm A1 = ndarray2alm(alms_c[0], lmax, mmax) A2 = ndarray2alm(alms_c[1], lmax, mmax) alm2map_spin(A1[0], A2[0], M1[0], M2[0], spin) del M1, M2, A1, A2 return maps def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, datapath = None): """Computes the alm of a Healpix map. Parameters ---------- m : array-like, shape (Npix,) or (3, Npix) The input map or a list of 3 input maps (polariztion). lmax : int, scalar, optional Maximum l of the power spectrum. Default: 3*nside-1 mmax : int, scalar, optional Maximum m of the alm. Default: lmax iter : int, scalar, optional Number of iteration (default: 1) use_weights: bool, scalar, optional If True, use the ring weighting. Default: False. Returns ------- alm : array or tuple of arrays alm or a tuple of 3 alm (almT, almE, almB) if polarized input. """ # Check if the input map is polarized or not info = maptype(m) if info == 0: polarization = False mi = np.ascontiguousarray(m, dtype=np.float64) elif info == 1: polarization = False mi = np.ascontiguousarray(m[0], dtype=np.float64) elif info == 3: polarization = True mi = np.ascontiguousarray(m[0], dtype=np.float64) mq = np.ascontiguousarray(m[1], dtype=np.float64) mu = np.ascontiguousarray(m[2], dtype=np.float64) else: raise ValueError("Wrong input map (must be a valid healpix map " "or a sequence of 1 or 3 maps)") # create UNSEEN mask for I map mask_mi = False if count_bad(mi) == 0 else mkmask(mi) # same for polarization maps if needed if polarization: mask_mq = False if count_bad(mq) == 0 else mkmask(mq) mask_mu = False if count_bad(mu) == 0 else mkmask(mu) # Adjust lmax and mmax cdef int lmax_, mmax_, nside, npix npix = mi.size nside = npix2nside(npix) if lmax is None: lmax_ = 3 * nside - 1 else: lmax_ = lmax if mmax is None: mmax_ = lmax_ else: mmax_ = mmax # Check all maps have same npix if polarization: if mq.size != npix or mu.size != npix: raise ValueError("Input maps must have same size") # View the ndarray as a Healpix_Map MI = ndarray2map(mi, RING) if polarization: MQ = ndarray2map(mq, RING) MU = ndarray2map(mu, RING) # replace UNSEEN pixels with zeros if mask_mi is not False: mi[mask_mi] = 0.0 if polarization: if mask_mq is not False: mq[mask_mq] = 0.0 if mask_mu is not False: mu[mask_mu] = 0.0 # Create an ndarray object that will contain the alm for output (to be returned) n_alm = alm_getn(lmax_, mmax_) almI = np.empty(n_alm, dtype=np.complex128) if polarization: almG = np.empty(n_alm, dtype=np.complex128) almC = np.empty(n_alm, dtype=np.complex128) # View the ndarray as an Alm AI = ndarray2alm(almI, lmax_, mmax_) if polarization: AG = ndarray2alm(almG, lmax_, mmax_) AC = ndarray2alm(almC, lmax_, mmax_) # ring weights cdef arr[double] * w_arr = new arr[double]() cdef int i cdef char *c_datapath if use_weights: if datapath is None: datapath = get_datapath() c_datapath = datapath weightfile = 'weight_ring_n%05d.fits' % (nside) if not os.path.isfile(os.path.join(datapath, weightfile)): raise IOError('Weight file not found in %s' % (datapath)) read_weight_ring(string(c_datapath), nside, w_arr[0]) for i in range(w_arr.size()): w_arr[0][i] += 1 else: w_arr.allocAndFill(2 * nside, 1.) if polarization: map2alm_pol_iter(MI[0], MQ[0], MU[0], AI[0], AG[0], AC[0], niter, w_arr[0]) else: map2alm_iter(MI[0], AI[0], niter, w_arr[0]) # restore input map with UNSEEN pixels if mask_mi is not False: mi[mask_mi] = UNSEEN if polarization: if mask_mq is not False: mq[mask_mq] = UNSEEN if mask_mu is not False: mu[mask_mu] = UNSEEN del w_arr if polarization: del MI, MQ, MU, AI, AG, AC return almI, almG, almC else: del MI, AI return almI def alm2cl(alms, alms2 = None, lmax = None, mmax = None, lmax_out = None): """Computes (cross-)spectra from alm(s). If alm2 is given, cross-spectra between alm and alm2 are computed. If alm (and alm2 if provided) contains n alm, then n(n+1)/2 auto and cross-spectra are returned. Parameters ---------- alms : complex, array or sequence of arrays The alm from which to compute the power spectrum. If n>=2 arrays are given, computes both auto- and cross-spectra. alms2 : complex, array or sequence of 3 arrays, optional If provided, computes cross-spectra between alm and alm2. Default: alm2=alm, so auto-spectra are computed. lmax : None or int, optional The maximum l of the input alm. Default: computed from size of alm and mmax_in mmax : None or int, optional The maximum m of the input alm. Default: assume mmax_in = lmax_in lmax_out : None or int, optional The maximum l of the returned spectra. By default: the lmax of the given alm(s). Returns ------- cl : array or tuple of n(n+1)/2 arrays the spectrum <*alm* x *alm2*> if *alm* (and *alm2*) is one alm, or the auto- and cross-spectra <*alm*[i] x *alm2*[j]> if alm (and alm2) contains more than one spectra. If more than one spectrum is returned, they are ordered by diagonal. For example, if *alm* is almT, almE, almB, then the returned spectra are: TT, EE, BB, TE, EB, TB. """ ############################# # Check alm and number of spectra # cdef int Nspec, Nspec2 if not hasattr(alms, '__len__'): raise ValueError('alms must be an array or a sequence of arrays') if not hasattr(alms[0], '__len__'): alms_lonely = True alms = [alms] else: alms_lonely = False Nspec = len(alms) if alms2 is None: alms2 = alms if not hasattr(alms2, '__len__'): raise ValueError('alms2 must be an array or a sequence of arrays') if not hasattr(alms2[0], '__len__'): alms2 = [alms2] Nspec2 = len(alms2) if Nspec != Nspec2: raise ValueError('alms and alms2 must have same number of spectra') ############################################## # Check sizes of alm's and lmax/mmax/lmax_out # cdef int almsize almsize = alms[0].size for i in xrange(Nspec): if alms[i].size != almsize or alms2[i].size != almsize: raise ValueError('all alms must have same size') lmax, mmax = alm_getlmmax(alms[0], lmax, mmax) if lmax_out is None: lmax_out = lmax ####################### # Computing the spectra # cdef int j, l, m, limit cdef int lmax_ = lmax, mmax_ = mmax cdef int lmax_out_ = lmax_out cdef np.ndarray[double, ndim=1] powspec_ cdef np.ndarray[np.complex128_t, ndim=1] alm1_ cdef np.ndarray[np.complex128_t, ndim=1] alm2_ spectra = [] for n in xrange(Nspec): # diagonal rank for m in xrange(0, Nspec - n): # position in the diagonal powspec_ = np.zeros(lmax + 1) alm1_ = alms[m] alm2_ = alms2[m + n] # compute cross-spectrum alm1[n] x alm2[n+m] # and place result in result list for l in range(lmax_ + 1): j = alm_getidx(lmax_, l, 0) powspec_[l] = alm1_[j].real * alm2_[j].real limit = l if l <= mmax else mmax for m in range(1, limit + 1): j = alm_getidx(lmax_, l, m) powspec_[l] += 2 * (alm1_[j].real * alm2_[j].real + alm1_[j].imag * alm2_[j].imag) powspec_[l] /= (2 * l + 1) spectra.append(powspec_) # if only one alm was given, returns only cl and not a list with one cl if alms_lonely: spectra = spectra[0] return spectra @cython.wraparound(False) @cython.boundscheck(False) def almxfl(alm, fl, mmax = None, inplace = False): """Multiply an a_lm by a vector b_l. Parameters ---------- alm : array, double The array representing the spherical harmonics coefficients fl : array, double The array giving the factor f_l by which to multiply a_lm mmax : None or int, optional The maximum m of the input alm inplace : bool, optional If True, performs the computation in-place if possible (input alm is modified if it is a 1d-array of type float64). Otherwise, a copy of alm is done. Returns ------- alm : array, double The result of a_lm * f_l. If *inplace* is True, returns the input alm modified """ cdef np.ndarray[np.complex128_t, ndim=1] alm_ cdef np.ndarray[np.complex128_t, ndim=1] fl_ if inplace: alm_ = np.ascontiguousarray(alm, dtype = np.complex128) else: alm_ = np.array(alm, dtype = np.complex128, copy = True) fl_ = np.ascontiguousarray(fl, dtype = np.complex128) cdef int lmax_, mmax_ cdef int l, m lmax_, mmax_ = alm_getlmmax(alm_, None, mmax) cdef np.complex128_t f cdef int maxm, i cdef int flsize = fl_.size for l in xrange(lmax_ + 1): f = fl_[l] if l < flsize else 0. maxm = l if l <= mmax_ else mmax_ for m in xrange(maxm + 1): i = alm_getidx(lmax_, l, m) alm_[i] *= f return alm_ def rotate_alm(alm not None, double psi, double theta, double phi, lmax=None, mmax=None): """ This routine transforms the scalar (and tensor) a_lm coefficients to emulate the effect of an arbitrary rotation of the underlying map. The rotation is done directly on the a_lm using the Wigner rotation matrices, computed by recursion. To rotate the a_lm for l ≤ l_max the number of operations scales like l_max^3. Parameters ---------- alm : array-like of shape (n,) or (k,n), or list of arrays Complex a_lm values before and after rotation of the coordinate system. psi : float First rotation: angle ψ about the z-axis. All angles are in radians and should lie in [-2pi,2pi], the rotations are active and the referential system is assumed to be right handed. The routine coordsys2euler zyz can be used to generate the Euler angles ψ, θ, φ for rotation between standard astronomical coordinate systems. theta : float Second rotation: angle θ about the original (unrotated) y-axis phi : float. Third rotation: angle φ about the original (unrotated) z-axis. lmax : int Maximum multipole order l of the data set. mmax : int Maximum degree m of data set. """ if isinstance(alm, np.ndarray) and alm.ndim == 1: alm = [alm] if not isinstance(alm, (list, tuple, np.ndarray)) or len(alm) == 0: raise ValueError('Invalid input.') # C++ rotate_alm only handles 1 or 3 maps. The function handling 3 maps # is faster than running 3 times the 1-map function, but gives identical # results. if len(alm) not in (1, 3): for a in alm: rotate_alm(a, psi, theta, phi) return lmax, mmax = alm_getlmmax(alm[0], lmax, mmax) ai = np.ascontiguousarray(alm[0], dtype=np.complex128) AI = ndarray2alm(ai, lmax, mmax) if len(alm) == 1: c_rotate_alm(AI[0], psi, theta, phi) del AI else: ag = np.ascontiguousarray(alm[1], dtype=np.complex128) ac = np.ascontiguousarray(alm[2], dtype=np.complex128) AG = ndarray2alm(ag, lmax, mmax) AC = ndarray2alm(ac, lmax, mmax) c_rotate_alm(AI[0], AG[0], AC[0], psi, theta, phi) del AI, AG, AC cdef int alm_getn(int l, int m): if not m <= l: raise ValueError("mmax must be <= lmax") return ((m+1)*(m+2))/2 + (m+1)*(l-m) def alm_getlmmax(a, lmax, mmax): if lmax is None: if mmax is None: lmax = alm_getlmax(a.size) mmax = lmax else: lmax = alm_getlmax2(a.size, mmax) elif mmax is None: mmax = lmax return lmax, mmax @cython.cdivision(True) cdef inline int alm_getlmax(int s): cdef double x x=(-3+np.sqrt(1+8*s))/2 if x != floor(x): return -1 else: return floor(x) @cython.cdivision(True) cdef inline int alm_getlmax2(int s, int mmax): cdef double x x = (2 * s + mmax ** 2 - mmax - 2.) / (2 * mmax + 2.) if x != floor(x): return -1 else: return floor(x) @cython.cdivision(True) cdef inline int alm_getidx(int lmax, int l, int m): return m*(2*lmax+1-m)/2+l @cython.wraparound(False) @cython.boundscheck(False) cpdef mkmask(np.ndarray[double, ndim=1] m): cdef int nbad cdef int size = m.size cdef int i # first, count number of bad pixels, to see if allocating a mask is needed nbad = count_bad(m) cdef np.ndarray[np.int8_t, ndim=1] mask #cdef np.ndarray[double, ndim=1] m_ if nbad == 0: return False else: mask = np.zeros(size, dtype = np.int8) #m_ = m for i in range(size): if fabs(m[i] - UNSEEN) < rtol_UNSEEN: mask[i] = 1 mask.dtype = bool return mask @cython.wraparound(False) @cython.boundscheck(False) cpdef int count_bad(np.ndarray[double, ndim=1] m): cdef int i cdef int nbad = 0 cdef size = m.size for i in xrange(m.size): if fabs(m[i] - UNSEEN) < rtol_UNSEEN: nbad += 1 return nbad healpy-1.8.1/healpy/src/_sphtools.cpp0000644000175000017500000227153312346122725020061 0ustar zoncazonca00000000000000/* Generated by Cython 0.20.1 on Wed Jun 11 11:54:03 2014 */ #define PY_SSIZE_T_CLEAN #ifndef CYTHON_USE_PYLONG_INTERNALS #ifdef PYLONG_BITS_IN_DIGIT #define CYTHON_USE_PYLONG_INTERNALS 0 #else #include "pyconfig.h" #ifdef PYLONG_BITS_IN_DIGIT #define CYTHON_USE_PYLONG_INTERNALS 1 #else #define CYTHON_USE_PYLONG_INTERNALS 0 #endif #endif #endif #include "Python.h" #ifndef Py_PYTHON_H #error Python headers needed to compile C extensions, please install development version of Python. #elif PY_VERSION_HEX < 0x02040000 #error Cython requires Python 2.4+. #else #define CYTHON_ABI "0_20_1" #include /* For offsetof */ #ifndef offsetof #define offsetof(type, member) ( (size_t) & ((type*)0) -> member ) #endif #if !defined(WIN32) && !defined(MS_WINDOWS) #ifndef __stdcall #define __stdcall #endif #ifndef __cdecl #define __cdecl #endif #ifndef __fastcall #define __fastcall #endif #endif #ifndef DL_IMPORT #define DL_IMPORT(t) t #endif #ifndef DL_EXPORT #define DL_EXPORT(t) t #endif #ifndef PY_LONG_LONG #define PY_LONG_LONG LONG_LONG #endif #ifndef Py_HUGE_VAL #define Py_HUGE_VAL HUGE_VAL #endif #ifdef PYPY_VERSION #define CYTHON_COMPILING_IN_PYPY 1 #define CYTHON_COMPILING_IN_CPYTHON 0 #else #define CYTHON_COMPILING_IN_PYPY 0 #define CYTHON_COMPILING_IN_CPYTHON 1 #endif #if CYTHON_COMPILING_IN_PYPY #define Py_OptimizeFlag 0 #endif #if PY_VERSION_HEX < 0x02050000 typedef int Py_ssize_t; #define PY_SSIZE_T_MAX INT_MAX #define PY_SSIZE_T_MIN INT_MIN #define PY_FORMAT_SIZE_T "" #define CYTHON_FORMAT_SSIZE_T "" #define PyInt_FromSsize_t(z) PyInt_FromLong(z) #define PyInt_AsSsize_t(o) __Pyx_PyInt_As_int(o) #define PyNumber_Index(o) ((PyNumber_Check(o) && !PyFloat_Check(o)) ? PyNumber_Int(o) : \ (PyErr_Format(PyExc_TypeError, \ "expected index value, got %.200s", Py_TYPE(o)->tp_name), \ (PyObject*)0)) #define __Pyx_PyIndex_Check(o) (PyNumber_Check(o) && !PyFloat_Check(o) && \ !PyComplex_Check(o)) #define PyIndex_Check __Pyx_PyIndex_Check #define PyErr_WarnEx(category, message, stacklevel) PyErr_Warn(category, message) #define __PYX_BUILD_PY_SSIZE_T "i" #else #define __PYX_BUILD_PY_SSIZE_T "n" #define CYTHON_FORMAT_SSIZE_T "z" #define __Pyx_PyIndex_Check PyIndex_Check #endif #if PY_VERSION_HEX < 0x02060000 #define Py_REFCNT(ob) (((PyObject*)(ob))->ob_refcnt) #define Py_TYPE(ob) (((PyObject*)(ob))->ob_type) #define Py_SIZE(ob) (((PyVarObject*)(ob))->ob_size) #define PyVarObject_HEAD_INIT(type, size) \ PyObject_HEAD_INIT(type) size, #define PyType_Modified(t) typedef struct { void *buf; PyObject *obj; Py_ssize_t len; Py_ssize_t itemsize; int readonly; int ndim; char *format; Py_ssize_t *shape; Py_ssize_t *strides; Py_ssize_t *suboffsets; void *internal; } Py_buffer; #define PyBUF_SIMPLE 0 #define PyBUF_WRITABLE 0x0001 #define PyBUF_FORMAT 0x0004 #define PyBUF_ND 0x0008 #define PyBUF_STRIDES (0x0010 | PyBUF_ND) #define PyBUF_C_CONTIGUOUS (0x0020 | PyBUF_STRIDES) #define PyBUF_F_CONTIGUOUS (0x0040 | PyBUF_STRIDES) #define PyBUF_ANY_CONTIGUOUS (0x0080 | PyBUF_STRIDES) #define PyBUF_INDIRECT (0x0100 | PyBUF_STRIDES) #define PyBUF_RECORDS (PyBUF_STRIDES | PyBUF_FORMAT | PyBUF_WRITABLE) #define PyBUF_FULL (PyBUF_INDIRECT | PyBUF_FORMAT | PyBUF_WRITABLE) typedef int (*getbufferproc)(PyObject *, Py_buffer *, int); typedef void (*releasebufferproc)(PyObject *, Py_buffer *); #endif #if PY_MAJOR_VERSION < 3 #define __Pyx_BUILTIN_MODULE_NAME "__builtin__" #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) \ PyCode_New(a+k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) #define __Pyx_DefaultClassType PyClass_Type #else #define __Pyx_BUILTIN_MODULE_NAME "builtins" #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) \ PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) #define __Pyx_DefaultClassType PyType_Type #endif #if PY_VERSION_HEX < 0x02060000 #define PyUnicode_FromString(s) PyUnicode_Decode(s, strlen(s), "UTF-8", "strict") #endif #if PY_MAJOR_VERSION >= 3 #define Py_TPFLAGS_CHECKTYPES 0 #define Py_TPFLAGS_HAVE_INDEX 0 #endif #if (PY_VERSION_HEX < 0x02060000) || (PY_MAJOR_VERSION >= 3) #define Py_TPFLAGS_HAVE_NEWBUFFER 0 #endif #if PY_VERSION_HEX < 0x02060000 #define Py_TPFLAGS_HAVE_VERSION_TAG 0 #endif #if PY_VERSION_HEX < 0x02060000 && !defined(Py_TPFLAGS_IS_ABSTRACT) #define Py_TPFLAGS_IS_ABSTRACT 0 #endif #if PY_VERSION_HEX < 0x030400a1 && !defined(Py_TPFLAGS_HAVE_FINALIZE) #define Py_TPFLAGS_HAVE_FINALIZE 0 #endif #if PY_VERSION_HEX > 0x03030000 && defined(PyUnicode_KIND) #define CYTHON_PEP393_ENABLED 1 #define __Pyx_PyUnicode_READY(op) (likely(PyUnicode_IS_READY(op)) ? \ 0 : _PyUnicode_Ready((PyObject *)(op))) #define __Pyx_PyUnicode_GET_LENGTH(u) PyUnicode_GET_LENGTH(u) #define __Pyx_PyUnicode_READ_CHAR(u, i) PyUnicode_READ_CHAR(u, i) #define __Pyx_PyUnicode_KIND(u) PyUnicode_KIND(u) #define __Pyx_PyUnicode_DATA(u) PyUnicode_DATA(u) #define __Pyx_PyUnicode_READ(k, d, i) PyUnicode_READ(k, d, i) #else #define CYTHON_PEP393_ENABLED 0 #define __Pyx_PyUnicode_READY(op) (0) #define __Pyx_PyUnicode_GET_LENGTH(u) PyUnicode_GET_SIZE(u) #define __Pyx_PyUnicode_READ_CHAR(u, i) ((Py_UCS4)(PyUnicode_AS_UNICODE(u)[i])) #define __Pyx_PyUnicode_KIND(u) (sizeof(Py_UNICODE)) #define __Pyx_PyUnicode_DATA(u) ((void*)PyUnicode_AS_UNICODE(u)) #define __Pyx_PyUnicode_READ(k, d, i) ((void)(k), (Py_UCS4)(((Py_UNICODE*)d)[i])) #endif #if CYTHON_COMPILING_IN_PYPY #define __Pyx_PyUnicode_Concat(a, b) PyNumber_Add(a, b) #define __Pyx_PyUnicode_ConcatSafe(a, b) PyNumber_Add(a, b) #else #define __Pyx_PyUnicode_Concat(a, b) PyUnicode_Concat(a, b) #define __Pyx_PyUnicode_ConcatSafe(a, b) ((unlikely((a) == Py_None) || unlikely((b) == Py_None)) ? \ PyNumber_Add(a, b) : __Pyx_PyUnicode_Concat(a, b)) #endif #define __Pyx_PyString_FormatSafe(a, b) ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : __Pyx_PyString_Format(a, b)) #define __Pyx_PyUnicode_FormatSafe(a, b) ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : PyUnicode_Format(a, b)) #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyString_Format(a, b) PyUnicode_Format(a, b) #else #define __Pyx_PyString_Format(a, b) PyString_Format(a, b) #endif #if PY_MAJOR_VERSION >= 3 #define PyBaseString_Type PyUnicode_Type #define PyStringObject PyUnicodeObject #define PyString_Type PyUnicode_Type #define PyString_Check PyUnicode_Check #define PyString_CheckExact PyUnicode_CheckExact #endif #if PY_VERSION_HEX < 0x02060000 #define PyBytesObject PyStringObject #define PyBytes_Type PyString_Type #define PyBytes_Check PyString_Check #define PyBytes_CheckExact PyString_CheckExact #define PyBytes_FromString PyString_FromString #define PyBytes_FromStringAndSize PyString_FromStringAndSize #define PyBytes_FromFormat PyString_FromFormat #define PyBytes_DecodeEscape PyString_DecodeEscape #define PyBytes_AsString PyString_AsString #define PyBytes_AsStringAndSize PyString_AsStringAndSize #define PyBytes_Size PyString_Size #define PyBytes_AS_STRING PyString_AS_STRING #define PyBytes_GET_SIZE PyString_GET_SIZE #define PyBytes_Repr PyString_Repr #define PyBytes_Concat PyString_Concat #define PyBytes_ConcatAndDel PyString_ConcatAndDel #endif #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyBaseString_Check(obj) PyUnicode_Check(obj) #define __Pyx_PyBaseString_CheckExact(obj) PyUnicode_CheckExact(obj) #else #define __Pyx_PyBaseString_Check(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj) || \ PyString_Check(obj) || PyUnicode_Check(obj)) #define __Pyx_PyBaseString_CheckExact(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj)) #endif #if PY_VERSION_HEX < 0x02060000 #define PySet_Check(obj) PyObject_TypeCheck(obj, &PySet_Type) #define PyFrozenSet_Check(obj) PyObject_TypeCheck(obj, &PyFrozenSet_Type) #endif #ifndef PySet_CheckExact #define PySet_CheckExact(obj) (Py_TYPE(obj) == &PySet_Type) #endif #define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type) #if PY_MAJOR_VERSION >= 3 #define PyIntObject PyLongObject #define PyInt_Type PyLong_Type #define PyInt_Check(op) PyLong_Check(op) #define PyInt_CheckExact(op) PyLong_CheckExact(op) #define PyInt_FromString PyLong_FromString #define PyInt_FromUnicode PyLong_FromUnicode #define PyInt_FromLong PyLong_FromLong #define PyInt_FromSize_t PyLong_FromSize_t #define PyInt_FromSsize_t PyLong_FromSsize_t #define PyInt_AsLong PyLong_AsLong #define PyInt_AS_LONG PyLong_AS_LONG #define PyInt_AsSsize_t PyLong_AsSsize_t #define PyInt_AsUnsignedLongMask PyLong_AsUnsignedLongMask #define PyInt_AsUnsignedLongLongMask PyLong_AsUnsignedLongLongMask #define PyNumber_Int PyNumber_Long #endif #if PY_MAJOR_VERSION >= 3 #define PyBoolObject PyLongObject #endif #if PY_VERSION_HEX < 0x030200A4 typedef long Py_hash_t; #define __Pyx_PyInt_FromHash_t PyInt_FromLong #define __Pyx_PyInt_AsHash_t PyInt_AsLong #else #define __Pyx_PyInt_FromHash_t PyInt_FromSsize_t #define __Pyx_PyInt_AsHash_t PyInt_AsSsize_t #endif #if (PY_MAJOR_VERSION < 3) || (PY_VERSION_HEX >= 0x03010300) #define __Pyx_PySequence_GetSlice(obj, a, b) PySequence_GetSlice(obj, a, b) #define __Pyx_PySequence_SetSlice(obj, a, b, value) PySequence_SetSlice(obj, a, b, value) #define __Pyx_PySequence_DelSlice(obj, a, b) PySequence_DelSlice(obj, a, b) #else #define __Pyx_PySequence_GetSlice(obj, a, b) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), (PyObject*)0) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_GetSlice(obj, a, b)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object is unsliceable", (obj)->ob_type->tp_name), (PyObject*)0))) #define __Pyx_PySequence_SetSlice(obj, a, b, value) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), -1) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_SetSlice(obj, a, b, value)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object doesn't support slice assignment", (obj)->ob_type->tp_name), -1))) #define __Pyx_PySequence_DelSlice(obj, a, b) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), -1) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_DelSlice(obj, a, b)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object doesn't support slice deletion", (obj)->ob_type->tp_name), -1))) #endif #if PY_MAJOR_VERSION >= 3 #define PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : PyInstanceMethod_New(func)) #endif #if PY_VERSION_HEX < 0x02050000 #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),((char *)(n))) #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),((char *)(n)),(a)) #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),((char *)(n))) #else #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),(n)) #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),(n),(a)) #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),(n)) #endif #if PY_VERSION_HEX < 0x02050000 #define __Pyx_NAMESTR(n) ((char *)(n)) #define __Pyx_DOCSTR(n) ((char *)(n)) #else #define __Pyx_NAMESTR(n) (n) #define __Pyx_DOCSTR(n) (n) #endif #ifndef CYTHON_INLINE #if defined(__GNUC__) #define CYTHON_INLINE __inline__ #elif defined(_MSC_VER) #define CYTHON_INLINE __inline #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L #define CYTHON_INLINE inline #else #define CYTHON_INLINE #endif #endif #ifndef CYTHON_RESTRICT #if defined(__GNUC__) #define CYTHON_RESTRICT __restrict__ #elif defined(_MSC_VER) && _MSC_VER >= 1400 #define CYTHON_RESTRICT __restrict #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L #define CYTHON_RESTRICT restrict #else #define CYTHON_RESTRICT #endif #endif #ifdef NAN #define __PYX_NAN() ((float) NAN) #else static CYTHON_INLINE float __PYX_NAN() { /* Initialize NaN. The sign is irrelevant, an exponent with all bits 1 and a nonzero mantissa means NaN. If the first bit in the mantissa is 1, it is a quiet NaN. */ float value; memset(&value, 0xFF, sizeof(value)); return value; } #endif #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyNumber_Divide(x,y) PyNumber_TrueDivide(x,y) #define __Pyx_PyNumber_InPlaceDivide(x,y) PyNumber_InPlaceTrueDivide(x,y) #else #define __Pyx_PyNumber_Divide(x,y) PyNumber_Divide(x,y) #define __Pyx_PyNumber_InPlaceDivide(x,y) PyNumber_InPlaceDivide(x,y) #endif #ifndef __PYX_EXTERN_C #ifdef __cplusplus #define __PYX_EXTERN_C extern "C" #else #define __PYX_EXTERN_C extern #endif #endif #if defined(WIN32) || defined(MS_WINDOWS) #define _USE_MATH_DEFINES #endif #include #define __PYX_HAVE__healpy___sphtools #define __PYX_HAVE_API__healpy___sphtools #include "string.h" #include "stdio.h" #include "stdlib.h" #include "numpy/arrayobject.h" #include "numpy/ufuncobject.h" #include #include "ios" #include "new" #include "stdexcept" #include "typeinfo" #include "math.h" #include #include "stddef.h" #include "datatypes.h" #include "xcomplex.h" #include "arr.h" #include "rangeset.h" #include "vec3.h" #include "pointing.h" #include "healpix_base.h" #include "healpix_map.h" #include "alm.h" #include "alm_healpix_tools.h" #include "alm_powspec_tools.h" #include "healpix_data_io.h" #ifdef _OPENMP #include #endif /* _OPENMP */ #ifdef PYREX_WITHOUT_ASSERTIONS #define CYTHON_WITHOUT_ASSERTIONS #endif #ifndef CYTHON_UNUSED # if defined(__GNUC__) # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)) # define CYTHON_UNUSED __attribute__ ((__unused__)) # else # define CYTHON_UNUSED # endif # elif defined(__ICC) || (defined(__INTEL_COMPILER) && !defined(_MSC_VER)) # define CYTHON_UNUSED __attribute__ ((__unused__)) # else # define CYTHON_UNUSED # endif #endif typedef struct {PyObject **p; char *s; const Py_ssize_t n; const char* encoding; const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry; /*proto*/ #define __PYX_DEFAULT_STRING_ENCODING_IS_ASCII 0 #define __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT 0 #define __PYX_DEFAULT_STRING_ENCODING "" #define __Pyx_PyObject_FromString __Pyx_PyBytes_FromString #define __Pyx_PyObject_FromStringAndSize __Pyx_PyBytes_FromStringAndSize #define __Pyx_fits_Py_ssize_t(v, type, is_signed) ( \ (sizeof(type) < sizeof(Py_ssize_t)) || \ (sizeof(type) > sizeof(Py_ssize_t) && \ likely(v < (type)PY_SSIZE_T_MAX || \ v == (type)PY_SSIZE_T_MAX) && \ (!is_signed || likely(v > (type)PY_SSIZE_T_MIN || \ v == (type)PY_SSIZE_T_MIN))) || \ (sizeof(type) == sizeof(Py_ssize_t) && \ (is_signed || likely(v < (type)PY_SSIZE_T_MAX || \ v == (type)PY_SSIZE_T_MAX))) ) static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject*); static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length); #define __Pyx_PyByteArray_FromString(s) PyByteArray_FromStringAndSize((const char*)s, strlen((const char*)s)) #define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l) #define __Pyx_PyBytes_FromString PyBytes_FromString #define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(char*); #if PY_MAJOR_VERSION < 3 #define __Pyx_PyStr_FromString __Pyx_PyBytes_FromString #define __Pyx_PyStr_FromStringAndSize __Pyx_PyBytes_FromStringAndSize #else #define __Pyx_PyStr_FromString __Pyx_PyUnicode_FromString #define __Pyx_PyStr_FromStringAndSize __Pyx_PyUnicode_FromStringAndSize #endif #define __Pyx_PyObject_AsSString(s) ((signed char*) __Pyx_PyObject_AsString(s)) #define __Pyx_PyObject_AsUString(s) ((unsigned char*) __Pyx_PyObject_AsString(s)) #define __Pyx_PyObject_FromUString(s) __Pyx_PyObject_FromString((char*)s) #define __Pyx_PyBytes_FromUString(s) __Pyx_PyBytes_FromString((char*)s) #define __Pyx_PyByteArray_FromUString(s) __Pyx_PyByteArray_FromString((char*)s) #define __Pyx_PyStr_FromUString(s) __Pyx_PyStr_FromString((char*)s) #define __Pyx_PyUnicode_FromUString(s) __Pyx_PyUnicode_FromString((char*)s) #if PY_MAJOR_VERSION < 3 static CYTHON_INLINE size_t __Pyx_Py_UNICODE_strlen(const Py_UNICODE *u) { const Py_UNICODE *u_end = u; while (*u_end++) ; return u_end - u - 1; } #else #define __Pyx_Py_UNICODE_strlen Py_UNICODE_strlen #endif #define __Pyx_PyUnicode_FromUnicode(u) PyUnicode_FromUnicode(u, __Pyx_Py_UNICODE_strlen(u)) #define __Pyx_PyUnicode_FromUnicodeAndLength PyUnicode_FromUnicode #define __Pyx_PyUnicode_AsUnicode PyUnicode_AsUnicode #define __Pyx_Owned_Py_None(b) (Py_INCREF(Py_None), Py_None) #define __Pyx_PyBool_FromLong(b) ((b) ? (Py_INCREF(Py_True), Py_True) : (Py_INCREF(Py_False), Py_False)) static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*); static CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x); static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*); static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t); #if CYTHON_COMPILING_IN_CPYTHON #define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x)) #else #define __pyx_PyFloat_AsDouble(x) PyFloat_AsDouble(x) #endif #define __pyx_PyFloat_AsFloat(x) ((float) __pyx_PyFloat_AsDouble(x)) #if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII static int __Pyx_sys_getdefaultencoding_not_ascii; static int __Pyx_init_sys_getdefaultencoding_params(void) { PyObject* sys = NULL; PyObject* default_encoding = NULL; PyObject* ascii_chars_u = NULL; PyObject* ascii_chars_b = NULL; sys = PyImport_ImportModule("sys"); if (sys == NULL) goto bad; default_encoding = PyObject_CallMethod(sys, (char*) (const char*) "getdefaultencoding", NULL); if (default_encoding == NULL) goto bad; if (strcmp(PyBytes_AsString(default_encoding), "ascii") == 0) { __Pyx_sys_getdefaultencoding_not_ascii = 0; } else { const char* default_encoding_c = PyBytes_AS_STRING(default_encoding); char ascii_chars[128]; int c; for (c = 0; c < 128; c++) { ascii_chars[c] = c; } __Pyx_sys_getdefaultencoding_not_ascii = 1; ascii_chars_u = PyUnicode_DecodeASCII(ascii_chars, 128, NULL); if (ascii_chars_u == NULL) goto bad; ascii_chars_b = PyUnicode_AsEncodedString(ascii_chars_u, default_encoding_c, NULL); if (ascii_chars_b == NULL || strncmp(ascii_chars, PyBytes_AS_STRING(ascii_chars_b), 128) != 0) { PyErr_Format( PyExc_ValueError, "This module compiled with c_string_encoding=ascii, but default encoding '%.200s' is not a superset of ascii.", default_encoding_c); goto bad; } } Py_XDECREF(sys); Py_XDECREF(default_encoding); Py_XDECREF(ascii_chars_u); Py_XDECREF(ascii_chars_b); return 0; bad: Py_XDECREF(sys); Py_XDECREF(default_encoding); Py_XDECREF(ascii_chars_u); Py_XDECREF(ascii_chars_b); return -1; } #endif #if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT && PY_MAJOR_VERSION >= 3 #define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_DecodeUTF8(c_str, size, NULL) #else #define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_Decode(c_str, size, __PYX_DEFAULT_STRING_ENCODING, NULL) #if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT static char* __PYX_DEFAULT_STRING_ENCODING; static int __Pyx_init_sys_getdefaultencoding_params(void) { PyObject* sys = NULL; PyObject* default_encoding = NULL; char* default_encoding_c; sys = PyImport_ImportModule("sys"); if (sys == NULL) goto bad; default_encoding = PyObject_CallMethod(sys, (char*) (const char*) "getdefaultencoding", NULL); if (default_encoding == NULL) goto bad; default_encoding_c = PyBytes_AS_STRING(default_encoding); __PYX_DEFAULT_STRING_ENCODING = (char*) malloc(strlen(default_encoding_c)); strcpy(__PYX_DEFAULT_STRING_ENCODING, default_encoding_c); Py_DECREF(sys); Py_DECREF(default_encoding); return 0; bad: Py_XDECREF(sys); Py_XDECREF(default_encoding); return -1; } #endif #endif #ifdef __GNUC__ /* Test for GCC > 2.95 */ #if __GNUC__ > 2 || (__GNUC__ == 2 && (__GNUC_MINOR__ > 95)) #define likely(x) __builtin_expect(!!(x), 1) #define unlikely(x) __builtin_expect(!!(x), 0) #else /* __GNUC__ > 2 ... */ #define likely(x) (x) #define unlikely(x) (x) #endif /* __GNUC__ > 2 ... */ #else /* __GNUC__ */ #define likely(x) (x) #define unlikely(x) (x) #endif /* __GNUC__ */ static PyObject *__pyx_m; static PyObject *__pyx_d; static PyObject *__pyx_b; static PyObject *__pyx_empty_tuple; static PyObject *__pyx_empty_bytes; static int __pyx_lineno; static int __pyx_clineno = 0; static const char * __pyx_cfilenm= __FILE__; static const char *__pyx_filename; #if !defined(CYTHON_CCOMPLEX) #if defined(__cplusplus) #define CYTHON_CCOMPLEX 1 #elif defined(_Complex_I) #define CYTHON_CCOMPLEX 1 #else #define CYTHON_CCOMPLEX 0 #endif #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus #include #else #include #endif #endif #if CYTHON_CCOMPLEX && !defined(__cplusplus) && defined(__sun__) && defined(__GNUC__) #undef _Complex_I #define _Complex_I 1.0fj #endif static const char *__pyx_f[] = { "_sphtools.pyx", "_common.pxd", "__init__.pxd", "type.pxd", }; #define IS_UNSIGNED(type) (((type) -1) > 0) struct __Pyx_StructField_; #define __PYX_BUF_FLAGS_PACKED_STRUCT (1 << 0) typedef struct { const char* name; /* for error messages only */ struct __Pyx_StructField_* fields; size_t size; /* sizeof(type) */ size_t arraysize[8]; /* length of array in each dimension */ int ndim; char typegroup; /* _R_eal, _C_omplex, Signed _I_nt, _U_nsigned int, _S_truct, _P_ointer, _O_bject, c_H_ar */ char is_unsigned; int flags; } __Pyx_TypeInfo; typedef struct __Pyx_StructField_ { __Pyx_TypeInfo* type; const char* name; size_t offset; } __Pyx_StructField; typedef struct { __Pyx_StructField* field; size_t parent_offset; } __Pyx_BufFmt_StackElem; typedef struct { __Pyx_StructField root; __Pyx_BufFmt_StackElem* head; size_t fmt_offset; size_t new_count, enc_count; size_t struct_alignment; int is_complex; char enc_type; char new_packmode; char enc_packmode; char is_valid_array; } __Pyx_BufFmt_Context; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":723 * # in Cython to enable them only on the right systems. * * ctypedef npy_int8 int8_t # <<<<<<<<<<<<<< * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t */ typedef npy_int8 __pyx_t_5numpy_int8_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":724 * * ctypedef npy_int8 int8_t * ctypedef npy_int16 int16_t # <<<<<<<<<<<<<< * ctypedef npy_int32 int32_t * ctypedef npy_int64 int64_t */ typedef npy_int16 __pyx_t_5numpy_int16_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":725 * ctypedef npy_int8 int8_t * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t # <<<<<<<<<<<<<< * ctypedef npy_int64 int64_t * #ctypedef npy_int96 int96_t */ typedef npy_int32 __pyx_t_5numpy_int32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":726 * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t * ctypedef npy_int64 int64_t # <<<<<<<<<<<<<< * #ctypedef npy_int96 int96_t * #ctypedef npy_int128 int128_t */ typedef npy_int64 __pyx_t_5numpy_int64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":730 * #ctypedef npy_int128 int128_t * * ctypedef npy_uint8 uint8_t # <<<<<<<<<<<<<< * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t */ typedef npy_uint8 __pyx_t_5numpy_uint8_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":731 * * ctypedef npy_uint8 uint8_t * ctypedef npy_uint16 uint16_t # <<<<<<<<<<<<<< * ctypedef npy_uint32 uint32_t * ctypedef npy_uint64 uint64_t */ typedef npy_uint16 __pyx_t_5numpy_uint16_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":732 * ctypedef npy_uint8 uint8_t * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t # <<<<<<<<<<<<<< * ctypedef npy_uint64 uint64_t * #ctypedef npy_uint96 uint96_t */ typedef npy_uint32 __pyx_t_5numpy_uint32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":733 * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t * ctypedef npy_uint64 uint64_t # <<<<<<<<<<<<<< * #ctypedef npy_uint96 uint96_t * #ctypedef npy_uint128 uint128_t */ typedef npy_uint64 __pyx_t_5numpy_uint64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":737 * #ctypedef npy_uint128 uint128_t * * ctypedef npy_float32 float32_t # <<<<<<<<<<<<<< * ctypedef npy_float64 float64_t * #ctypedef npy_float80 float80_t */ typedef npy_float32 __pyx_t_5numpy_float32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":738 * * ctypedef npy_float32 float32_t * ctypedef npy_float64 float64_t # <<<<<<<<<<<<<< * #ctypedef npy_float80 float80_t * #ctypedef npy_float128 float128_t */ typedef npy_float64 __pyx_t_5numpy_float64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":747 * # The int types are mapped a bit surprising -- * # numpy.int corresponds to 'l' and numpy.long to 'q' * ctypedef npy_long int_t # <<<<<<<<<<<<<< * ctypedef npy_longlong long_t * ctypedef npy_longlong longlong_t */ typedef npy_long __pyx_t_5numpy_int_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":748 * # numpy.int corresponds to 'l' and numpy.long to 'q' * ctypedef npy_long int_t * ctypedef npy_longlong long_t # <<<<<<<<<<<<<< * ctypedef npy_longlong longlong_t * */ typedef npy_longlong __pyx_t_5numpy_long_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":749 * ctypedef npy_long int_t * ctypedef npy_longlong long_t * ctypedef npy_longlong longlong_t # <<<<<<<<<<<<<< * * ctypedef npy_ulong uint_t */ typedef npy_longlong __pyx_t_5numpy_longlong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":751 * ctypedef npy_longlong longlong_t * * ctypedef npy_ulong uint_t # <<<<<<<<<<<<<< * ctypedef npy_ulonglong ulong_t * ctypedef npy_ulonglong ulonglong_t */ typedef npy_ulong __pyx_t_5numpy_uint_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":752 * * ctypedef npy_ulong uint_t * ctypedef npy_ulonglong ulong_t # <<<<<<<<<<<<<< * ctypedef npy_ulonglong ulonglong_t * */ typedef npy_ulonglong __pyx_t_5numpy_ulong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":753 * ctypedef npy_ulong uint_t * ctypedef npy_ulonglong ulong_t * ctypedef npy_ulonglong ulonglong_t # <<<<<<<<<<<<<< * * ctypedef npy_intp intp_t */ typedef npy_ulonglong __pyx_t_5numpy_ulonglong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":755 * ctypedef npy_ulonglong ulonglong_t * * ctypedef npy_intp intp_t # <<<<<<<<<<<<<< * ctypedef npy_uintp uintp_t * */ typedef npy_intp __pyx_t_5numpy_intp_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":756 * * ctypedef npy_intp intp_t * ctypedef npy_uintp uintp_t # <<<<<<<<<<<<<< * * ctypedef npy_double float_t */ typedef npy_uintp __pyx_t_5numpy_uintp_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":758 * ctypedef npy_uintp uintp_t * * ctypedef npy_double float_t # <<<<<<<<<<<<<< * ctypedef npy_double double_t * ctypedef npy_longdouble longdouble_t */ typedef npy_double __pyx_t_5numpy_float_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":759 * * ctypedef npy_double float_t * ctypedef npy_double double_t # <<<<<<<<<<<<<< * ctypedef npy_longdouble longdouble_t * */ typedef npy_double __pyx_t_5numpy_double_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":760 * ctypedef npy_double float_t * ctypedef npy_double double_t * ctypedef npy_longdouble longdouble_t # <<<<<<<<<<<<<< * * ctypedef npy_cfloat cfloat_t */ typedef npy_longdouble __pyx_t_5numpy_longdouble_t; /* "_common.pxd":6 * from libcpp.vector cimport vector * * ctypedef unsigned size_t # <<<<<<<<<<<<<< * ctypedef size_t tsize * */ typedef unsigned int __pyx_t_7_common_size_t; /* "_common.pxd":7 * * ctypedef unsigned size_t * ctypedef size_t tsize # <<<<<<<<<<<<<< * * cdef extern from "stddef.h": */ typedef size_t __pyx_t_7_common_tsize; /* "_common.pxd":11 * cdef extern from "stddef.h": * ctypedef long ptrdiff_t * ctypedef ptrdiff_t tdiff # <<<<<<<<<<<<<< * * cdef extern from "datatypes.h": */ typedef ptrdiff_t __pyx_t_7_common_tdiff; #if CYTHON_CCOMPLEX #ifdef __cplusplus typedef ::std::complex< double > __pyx_t_double_complex; #else typedef double _Complex __pyx_t_double_complex; #endif #else typedef struct { double real, imag; } __pyx_t_double_complex; #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus typedef ::std::complex< float > __pyx_t_float_complex; #else typedef float _Complex __pyx_t_float_complex; #endif #else typedef struct { float real, imag; } __pyx_t_float_complex; #endif /*--- Type declarations ---*/ /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":762 * ctypedef npy_longdouble longdouble_t * * ctypedef npy_cfloat cfloat_t # <<<<<<<<<<<<<< * ctypedef npy_cdouble cdouble_t * ctypedef npy_clongdouble clongdouble_t */ typedef npy_cfloat __pyx_t_5numpy_cfloat_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":763 * * ctypedef npy_cfloat cfloat_t * ctypedef npy_cdouble cdouble_t # <<<<<<<<<<<<<< * ctypedef npy_clongdouble clongdouble_t * */ typedef npy_cdouble __pyx_t_5numpy_cdouble_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":764 * ctypedef npy_cfloat cfloat_t * ctypedef npy_cdouble cdouble_t * ctypedef npy_clongdouble clongdouble_t # <<<<<<<<<<<<<< * * ctypedef npy_cdouble complex_t */ typedef npy_clongdouble __pyx_t_5numpy_clongdouble_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":766 * ctypedef npy_clongdouble clongdouble_t * * ctypedef npy_cdouble complex_t # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew1(a): */ typedef npy_cdouble __pyx_t_5numpy_complex_t; #ifndef CYTHON_REFNANNY #define CYTHON_REFNANNY 0 #endif #if CYTHON_REFNANNY typedef struct { void (*INCREF)(void*, PyObject*, int); void (*DECREF)(void*, PyObject*, int); void (*GOTREF)(void*, PyObject*, int); void (*GIVEREF)(void*, PyObject*, int); void* (*SetupContext)(const char*, int, const char*); void (*FinishContext)(void**); } __Pyx_RefNannyAPIStruct; static __Pyx_RefNannyAPIStruct *__Pyx_RefNanny = NULL; static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname); /*proto*/ #define __Pyx_RefNannyDeclarations void *__pyx_refnanny = NULL; #ifdef WITH_THREAD #define __Pyx_RefNannySetupContext(name, acquire_gil) \ if (acquire_gil) { \ PyGILState_STATE __pyx_gilstate_save = PyGILState_Ensure(); \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__); \ PyGILState_Release(__pyx_gilstate_save); \ } else { \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__); \ } #else #define __Pyx_RefNannySetupContext(name, acquire_gil) \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__) #endif #define __Pyx_RefNannyFinishContext() \ __Pyx_RefNanny->FinishContext(&__pyx_refnanny) #define __Pyx_INCREF(r) __Pyx_RefNanny->INCREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_DECREF(r) __Pyx_RefNanny->DECREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_GOTREF(r) __Pyx_RefNanny->GOTREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_GIVEREF(r) __Pyx_RefNanny->GIVEREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_XINCREF(r) do { if((r) != NULL) {__Pyx_INCREF(r); }} while(0) #define __Pyx_XDECREF(r) do { if((r) != NULL) {__Pyx_DECREF(r); }} while(0) #define __Pyx_XGOTREF(r) do { if((r) != NULL) {__Pyx_GOTREF(r); }} while(0) #define __Pyx_XGIVEREF(r) do { if((r) != NULL) {__Pyx_GIVEREF(r);}} while(0) #else #define __Pyx_RefNannyDeclarations #define __Pyx_RefNannySetupContext(name, acquire_gil) #define __Pyx_RefNannyFinishContext() #define __Pyx_INCREF(r) Py_INCREF(r) #define __Pyx_DECREF(r) Py_DECREF(r) #define __Pyx_GOTREF(r) #define __Pyx_GIVEREF(r) #define __Pyx_XINCREF(r) Py_XINCREF(r) #define __Pyx_XDECREF(r) Py_XDECREF(r) #define __Pyx_XGOTREF(r) #define __Pyx_XGIVEREF(r) #endif /* CYTHON_REFNANNY */ #define __Pyx_XDECREF_SET(r, v) do { \ PyObject *tmp = (PyObject *) r; \ r = v; __Pyx_XDECREF(tmp); \ } while (0) #define __Pyx_DECREF_SET(r, v) do { \ PyObject *tmp = (PyObject *) r; \ r = v; __Pyx_DECREF(tmp); \ } while (0) #define __Pyx_CLEAR(r) do { PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);} while(0) #define __Pyx_XCLEAR(r) do { if((r) != NULL) {PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);}} while(0) #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_GetAttrStr(PyObject* obj, PyObject* attr_name) { PyTypeObject* tp = Py_TYPE(obj); if (likely(tp->tp_getattro)) return tp->tp_getattro(obj, attr_name); #if PY_MAJOR_VERSION < 3 if (likely(tp->tp_getattr)) return tp->tp_getattr(obj, PyString_AS_STRING(attr_name)); #endif return PyObject_GetAttr(obj, attr_name); } #else #define __Pyx_PyObject_GetAttrStr(o,n) PyObject_GetAttr(o,n) #endif static PyObject *__Pyx_GetBuiltinName(PyObject *name); /*proto*/ static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name); /*proto*/ #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw); /*proto*/ #else #define __Pyx_PyObject_Call(func, arg, kw) PyObject_Call(func, arg, kw) #endif static void __Pyx_RaiseArgtupleInvalid(const char* func_name, int exact, Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found); /*proto*/ static void __Pyx_RaiseDoubleKeywordsError(const char* func_name, PyObject* kw_name); /*proto*/ static int __Pyx_ParseOptionalKeywords(PyObject *kwds, PyObject **argnames[], \ PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args, \ const char* function_name); /*proto*/ #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE int __Pyx_ListComp_Append(PyObject* list, PyObject* x) { PyListObject* L = (PyListObject*) list; Py_ssize_t len = Py_SIZE(list); if (likely(L->allocated > len)) { Py_INCREF(x); PyList_SET_ITEM(list, len, x); Py_SIZE(list) = len+1; return 0; } return PyList_Append(list, x); } #else #define __Pyx_ListComp_Append(L,x) PyList_Append(L,x) #endif static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type); /*proto*/ #define __Pyx_GetItemInt(o, i, type, is_signed, to_py_func, is_list, wraparound, boundscheck) \ (__Pyx_fits_Py_ssize_t(i, type, is_signed) ? \ __Pyx_GetItemInt_Fast(o, (Py_ssize_t)i, is_list, wraparound, boundscheck) : \ (is_list ? (PyErr_SetString(PyExc_IndexError, "list index out of range"), (PyObject*)NULL) : \ __Pyx_GetItemInt_Generic(o, to_py_func(i)))) #define __Pyx_GetItemInt_List(o, i, type, is_signed, to_py_func, is_list, wraparound, boundscheck) \ (__Pyx_fits_Py_ssize_t(i, type, is_signed) ? \ __Pyx_GetItemInt_List_Fast(o, (Py_ssize_t)i, wraparound, boundscheck) : \ (PyErr_SetString(PyExc_IndexError, "list index out of range"), (PyObject*)NULL)) static CYTHON_INLINE PyObject *__Pyx_GetItemInt_List_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck); #define __Pyx_GetItemInt_Tuple(o, i, type, is_signed, to_py_func, is_list, wraparound, boundscheck) \ (__Pyx_fits_Py_ssize_t(i, type, is_signed) ? \ __Pyx_GetItemInt_Tuple_Fast(o, (Py_ssize_t)i, wraparound, boundscheck) : \ (PyErr_SetString(PyExc_IndexError, "tuple index out of range"), (PyObject*)NULL)) static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Tuple_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck); static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Generic(PyObject *o, PyObject* j); static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Fast(PyObject *o, Py_ssize_t i, int is_list, int wraparound, int boundscheck); static CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb); /*proto*/ static CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb); /*proto*/ static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause); /*proto*/ static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected); static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index); static CYTHON_INLINE int __Pyx_IterFinish(void); /*proto*/ static int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected); /*proto*/ static CYTHON_INLINE void __Pyx_RaiseUnboundLocalError(const char *varname); static CYTHON_INLINE int __Pyx_GetBufferAndValidate(Py_buffer* buf, PyObject* obj, __Pyx_TypeInfo* dtype, int flags, int nd, int cast, __Pyx_BufFmt_StackElem* stack); static CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info); static void __Pyx_RaiseBufferFallbackError(void); /*proto*/ static void __Pyx_RaiseBufferIndexError(int axis); /*proto*/ #define __Pyx_BufPtrStrided1d(type, buf, i0, s0) (type)((char*)buf + i0 * s0) #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE int __Pyx_PyList_Append(PyObject* list, PyObject* x) { PyListObject* L = (PyListObject*) list; Py_ssize_t len = Py_SIZE(list); if (likely(L->allocated > len) & likely(len > (L->allocated >> 1))) { Py_INCREF(x); PyList_SET_ITEM(list, len, x); Py_SIZE(list) = len+1; return 0; } return PyList_Append(list, x); } #else #define __Pyx_PyList_Append(L,x) PyList_Append(L,x) #endif static PyObject* __Pyx_PyObject_CallMethodTuple(PyObject* obj, PyObject* method_name, PyObject* args) { PyObject *method, *result = NULL; if (unlikely(!args)) return NULL; method = __Pyx_PyObject_GetAttrStr(obj, method_name); if (unlikely(!method)) goto bad; result = __Pyx_PyObject_Call(method, args, NULL); Py_DECREF(method); bad: Py_DECREF(args); return result; } #define __Pyx_PyObject_CallMethod3(obj, name, arg1, arg2, arg3) \ __Pyx_PyObject_CallMethodTuple(obj, name, PyTuple_Pack(3, arg1, arg2, arg3)) #define __Pyx_PyObject_CallMethod2(obj, name, arg1, arg2) \ __Pyx_PyObject_CallMethodTuple(obj, name, PyTuple_Pack(2, arg1, arg2)) #define __Pyx_PyObject_CallMethod1(obj, name, arg1) \ __Pyx_PyObject_CallMethodTuple(obj, name, PyTuple_Pack(1, arg1)) #define __Pyx_PyObject_CallMethod0(obj, name) \ __Pyx_PyObject_CallMethodTuple(obj, name, (Py_INCREF(__pyx_empty_tuple), __pyx_empty_tuple)) static CYTHON_INLINE int __Pyx_PyObject_Append(PyObject* L, PyObject* x); /*proto*/ static CYTHON_INLINE long __Pyx_div_long(long, long); /* proto */ static void __Pyx_WriteUnraisable(const char *name, int clineno, int lineno, const char *filename, int full_traceback); /*proto*/ #if CYTHON_COMPILING_IN_CPYTHON #define __Pyx_PyObject_DelAttrStr(o,n) __Pyx_PyObject_SetAttrStr(o,n,NULL) static CYTHON_INLINE int __Pyx_PyObject_SetAttrStr(PyObject* obj, PyObject* attr_name, PyObject* value) { PyTypeObject* tp = Py_TYPE(obj); if (likely(tp->tp_setattro)) return tp->tp_setattro(obj, attr_name, value); #if PY_MAJOR_VERSION < 3 if (likely(tp->tp_setattr)) return tp->tp_setattr(obj, PyString_AS_STRING(attr_name), value); #endif return PyObject_SetAttr(obj, attr_name, value); } #else #define __Pyx_PyObject_DelAttrStr(o,n) PyObject_DelAttr(o,n) #define __Pyx_PyObject_SetAttrStr(o,n,v) PyObject_SetAttr(o,n,v) #endif static CYTHON_INLINE int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed, const char *name, int exact); /*proto*/ #define __Pyx_BufPtrCContig1d(type, buf, i0, s0) ((type)buf + i0) static CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void); static PyObject* __Pyx_ImportFrom(PyObject* module, PyObject* name); /*proto*/ typedef struct { Py_ssize_t shape, strides, suboffsets; } __Pyx_Buf_DimInfo; typedef struct { size_t refcount; Py_buffer pybuffer; } __Pyx_Buffer; typedef struct { __Pyx_Buffer *rcbuffer; char *data; __Pyx_Buf_DimInfo diminfo[8]; } __Pyx_LocalBuf_ND; #if PY_MAJOR_VERSION < 3 static int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags); static void __Pyx_ReleaseBuffer(Py_buffer *view); #else #define __Pyx_GetBuffer PyObject_GetBuffer #define __Pyx_ReleaseBuffer PyBuffer_Release #endif static Py_ssize_t __Pyx_zeros[] = {0, 0, 0, 0, 0, 0, 0, 0}; static Py_ssize_t __Pyx_minusones[] = {-1, -1, -1, -1, -1, -1, -1, -1}; static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level); /*proto*/ static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value); static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *); static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value); #ifndef __Pyx_CppExn2PyErr #include #include #include #include static void __Pyx_CppExn2PyErr() { try { if (PyErr_Occurred()) ; // let the latest Python exn pass through and ignore the current one else throw; } catch (const std::bad_alloc& exn) { PyErr_SetString(PyExc_MemoryError, exn.what()); } catch (const std::bad_cast& exn) { PyErr_SetString(PyExc_TypeError, exn.what()); } catch (const std::domain_error& exn) { PyErr_SetString(PyExc_ValueError, exn.what()); } catch (const std::invalid_argument& exn) { PyErr_SetString(PyExc_ValueError, exn.what()); } catch (const std::ios_base::failure& exn) { PyErr_SetString(PyExc_IOError, exn.what()); } catch (const std::out_of_range& exn) { PyErr_SetString(PyExc_IndexError, exn.what()); } catch (const std::overflow_error& exn) { PyErr_SetString(PyExc_OverflowError, exn.what()); } catch (const std::range_error& exn) { PyErr_SetString(PyExc_ArithmeticError, exn.what()); } catch (const std::underflow_error& exn) { PyErr_SetString(PyExc_ArithmeticError, exn.what()); } catch (const std::exception& exn) { PyErr_SetString(PyExc_RuntimeError, exn.what()); } catch (...) { PyErr_SetString(PyExc_RuntimeError, "Unknown exception"); } } #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus #define __Pyx_CREAL(z) ((z).real()) #define __Pyx_CIMAG(z) ((z).imag()) #else #define __Pyx_CREAL(z) (__real__(z)) #define __Pyx_CIMAG(z) (__imag__(z)) #endif #else #define __Pyx_CREAL(z) ((z).real) #define __Pyx_CIMAG(z) ((z).imag) #endif #if (defined(_WIN32) || defined(__clang__)) && defined(__cplusplus) && CYTHON_CCOMPLEX #define __Pyx_SET_CREAL(z,x) ((z).real(x)) #define __Pyx_SET_CIMAG(z,y) ((z).imag(y)) #else #define __Pyx_SET_CREAL(z,x) __Pyx_CREAL(z) = (x) #define __Pyx_SET_CIMAG(z,y) __Pyx_CIMAG(z) = (y) #endif static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double, double); #if CYTHON_CCOMPLEX #define __Pyx_c_eq(a, b) ((a)==(b)) #define __Pyx_c_sum(a, b) ((a)+(b)) #define __Pyx_c_diff(a, b) ((a)-(b)) #define __Pyx_c_prod(a, b) ((a)*(b)) #define __Pyx_c_quot(a, b) ((a)/(b)) #define __Pyx_c_neg(a) (-(a)) #ifdef __cplusplus #define __Pyx_c_is_zero(z) ((z)==(double)0) #define __Pyx_c_conj(z) (::std::conj(z)) #if 1 #define __Pyx_c_abs(z) (::std::abs(z)) #define __Pyx_c_pow(a, b) (::std::pow(a, b)) #endif #else #define __Pyx_c_is_zero(z) ((z)==0) #define __Pyx_c_conj(z) (conj(z)) #if 1 #define __Pyx_c_abs(z) (cabs(z)) #define __Pyx_c_pow(a, b) (cpow(a, b)) #endif #endif #else static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex); static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex); #if 1 static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex, __pyx_t_double_complex); #endif #endif static CYTHON_INLINE long __Pyx_pow_long(long, long); /* proto */ static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *); static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *); static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float, float); #if CYTHON_CCOMPLEX #define __Pyx_c_eqf(a, b) ((a)==(b)) #define __Pyx_c_sumf(a, b) ((a)+(b)) #define __Pyx_c_difff(a, b) ((a)-(b)) #define __Pyx_c_prodf(a, b) ((a)*(b)) #define __Pyx_c_quotf(a, b) ((a)/(b)) #define __Pyx_c_negf(a) (-(a)) #ifdef __cplusplus #define __Pyx_c_is_zerof(z) ((z)==(float)0) #define __Pyx_c_conjf(z) (::std::conj(z)) #if 1 #define __Pyx_c_absf(z) (::std::abs(z)) #define __Pyx_c_powf(a, b) (::std::pow(a, b)) #endif #else #define __Pyx_c_is_zerof(z) ((z)==0) #define __Pyx_c_conjf(z) (conjf(z)) #if 1 #define __Pyx_c_absf(z) (cabsf(z)) #define __Pyx_c_powf(a, b) (cpowf(a, b)) #endif #endif #else static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex); static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex); #if 1 static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex, __pyx_t_float_complex); #endif #endif static int __Pyx_check_binary_version(void); #if !defined(__Pyx_PyIdentifier_FromString) #if PY_MAJOR_VERSION < 3 #define __Pyx_PyIdentifier_FromString(s) PyString_FromString(s) #else #define __Pyx_PyIdentifier_FromString(s) PyUnicode_FromString(s) #endif #endif static PyObject *__Pyx_ImportModule(const char *name); /*proto*/ static PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, size_t size, int strict); /*proto*/ typedef struct { int code_line; PyCodeObject* code_object; } __Pyx_CodeObjectCacheEntry; struct __Pyx_CodeObjectCache { int count; int max_count; __Pyx_CodeObjectCacheEntry* entries; }; static struct __Pyx_CodeObjectCache __pyx_code_cache = {0,0,NULL}; static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line); static PyCodeObject *__pyx_find_code_object(int code_line); static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object); static void __Pyx_AddTraceback(const char *funcname, int c_line, int py_line, const char *filename); /*proto*/ static int __Pyx_InitStrings(__Pyx_StringTabEntry *t); /*proto*/ /* Module declarations from 'cpython.buffer' */ /* Module declarations from 'cpython.ref' */ /* Module declarations from 'libc.string' */ /* Module declarations from 'libc.stdio' */ /* Module declarations from 'cpython.object' */ /* Module declarations from '__builtin__' */ /* Module declarations from 'cpython.type' */ static PyTypeObject *__pyx_ptype_7cpython_4type_type = 0; /* Module declarations from 'libc.stdlib' */ /* Module declarations from 'numpy' */ /* Module declarations from 'numpy' */ static PyTypeObject *__pyx_ptype_5numpy_dtype = 0; static PyTypeObject *__pyx_ptype_5numpy_flatiter = 0; static PyTypeObject *__pyx_ptype_5numpy_broadcast = 0; static PyTypeObject *__pyx_ptype_5numpy_ndarray = 0; static PyTypeObject *__pyx_ptype_5numpy_ufunc = 0; static CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *, char *, char *, int *); /*proto*/ /* Module declarations from 'libcpp.string' */ /* Module declarations from 'libc.math' */ /* Module declarations from 'libc' */ /* Module declarations from 'cython' */ /* Module declarations from 'libcpp' */ /* Module declarations from 'libcpp.vector' */ /* Module declarations from '_common' */ static CYTHON_INLINE Healpix_Map *__pyx_f_7_common_ndarray2map(PyArrayObject *, enum Healpix_Ordering_Scheme); /*proto*/ static CYTHON_INLINE Alm > *__pyx_f_7_common_ndarray2alm(PyArrayObject *, int, int); /*proto*/ /* Module declarations from 'healpy._sphtools' */ static double __pyx_v_6healpy_9_sphtools_UNSEEN; static double __pyx_v_6healpy_9_sphtools_rtol_UNSEEN; static int __pyx_f_6healpy_9_sphtools_alm_getn(int, int); /*proto*/ static CYTHON_INLINE int __pyx_f_6healpy_9_sphtools_alm_getlmax(int); /*proto*/ static CYTHON_INLINE int __pyx_f_6healpy_9_sphtools_alm_getlmax2(int, int); /*proto*/ static CYTHON_INLINE int __pyx_f_6healpy_9_sphtools_alm_getidx(int, int, int); /*proto*/ static PyObject *__pyx_f_6healpy_9_sphtools_mkmask(PyArrayObject *, int __pyx_skip_dispatch); /*proto*/ static int __pyx_f_6healpy_9_sphtools_count_bad(PyArrayObject *, int __pyx_skip_dispatch); /*proto*/ static __Pyx_TypeInfo __Pyx_TypeInfo_double = { "double", NULL, sizeof(double), { 0 }, 0, 'R', 0, 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo___pyx_t_double_complex = { "double complex", NULL, sizeof(__pyx_t_double_complex), { 0 }, 0, 'C', 0, 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo_nn___pyx_t_5numpy_int8_t = { "int8_t", NULL, sizeof(__pyx_t_5numpy_int8_t), { 0 }, 0, IS_UNSIGNED(__pyx_t_5numpy_int8_t) ? 'U' : 'I', IS_UNSIGNED(__pyx_t_5numpy_int8_t), 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo_nn___pyx_t_5numpy_float64_t = { "float64_t", NULL, sizeof(__pyx_t_5numpy_float64_t), { 0 }, 0, 'R', 0, 0 }; #define __Pyx_MODULE_NAME "healpy._sphtools" int __pyx_module_is_main_healpy___sphtools = 0; /* Implementation of 'healpy._sphtools' */ static PyObject *__pyx_builtin_ValueError; static PyObject *__pyx_builtin_zip; static PyObject *__pyx_builtin_IOError; static PyObject *__pyx_builtin_range; static PyObject *__pyx_builtin_xrange; static PyObject *__pyx_builtin_RuntimeError; static PyObject *__pyx_pf_6healpy_9_sphtools_get_datapath(CYTHON_UNUSED PyObject *__pyx_self); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_2map2alm_spin_healpy(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_maps, PyObject *__pyx_v_spin, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_4alm2map_spin_healpy(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alms, PyObject *__pyx_v_nside, PyObject *__pyx_v_spin, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_6map2alm(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_m, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax, PyObject *__pyx_v_niter, PyObject *__pyx_v_use_weights, PyObject *__pyx_v_datapath); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_8alm2cl(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alms, PyObject *__pyx_v_alms2, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax, PyObject *__pyx_v_lmax_out); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_10almxfl(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alm, PyObject *__pyx_v_fl, PyObject *__pyx_v_mmax, PyObject *__pyx_v_inplace); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_12rotate_alm(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alm, double __pyx_v_psi, double __pyx_v_theta, double __pyx_v_phi, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_14alm_getlmmax(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_a, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_16mkmask(CYTHON_UNUSED PyObject *__pyx_self, PyArrayObject *__pyx_v_m); /* proto */ static PyObject *__pyx_pf_6healpy_9_sphtools_18count_bad(CYTHON_UNUSED PyObject *__pyx_self, PyArrayObject *__pyx_v_m); /* proto */ static int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /* proto */ static void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info); /* proto */ static char __pyx_k_B[] = "B"; static char __pyx_k_H[] = "H"; static char __pyx_k_I[] = "I"; static char __pyx_k_L[] = "L"; static char __pyx_k_O[] = "O"; static char __pyx_k_Q[] = "Q"; static char __pyx_k_a[] = "a"; static char __pyx_k_b[] = "b"; static char __pyx_k_d[] = "d"; static char __pyx_k_f[] = "f"; static char __pyx_k_g[] = "g"; static char __pyx_k_h[] = "h"; static char __pyx_k_i[] = "i"; static char __pyx_k_j[] = "j"; static char __pyx_k_l[] = "l"; static char __pyx_k_m[] = "m"; static char __pyx_k_n[] = "n"; static char __pyx_k_q[] = "q"; static char __pyx_k_A1[] = "A1"; static char __pyx_k_A2[] = "A2"; static char __pyx_k_AC[] = "AC"; static char __pyx_k_AG[] = "AG"; static char __pyx_k_AI[] = "AI"; static char __pyx_k_M1[] = "M1"; static char __pyx_k_M2[] = "M2"; static char __pyx_k_MI[] = "MI"; static char __pyx_k_MQ[] = "MQ"; static char __pyx_k_MU[] = "MU"; static char __pyx_k_Zd[] = "Zd"; static char __pyx_k_Zf[] = "Zf"; static char __pyx_k_Zg[] = "Zg"; static char __pyx_k_ac[] = "ac"; static char __pyx_k_ag[] = "ag"; static char __pyx_k_ai[] = "ai"; static char __pyx_k_fl[] = "fl"; static char __pyx_k_mi[] = "mi"; static char __pyx_k_mq[] = "mq"; static char __pyx_k_mu[] = "mu"; static char __pyx_k_np[] = "np"; static char __pyx_k_os[] = "os"; static char __pyx_k_alm[] = "alm"; static char __pyx_k_len[] = "__len__"; static char __pyx_k_phi[] = "phi"; static char __pyx_k_psi[] = "psi"; static char __pyx_k_zip[] = "zip"; static char __pyx_k_alm1[] = "alm1_"; static char __pyx_k_alm2[] = "alm2_"; static char __pyx_k_almC[] = "almC"; static char __pyx_k_almG[] = "almG"; static char __pyx_k_almI[] = "almI"; static char __pyx_k_alms[] = "alms"; static char __pyx_k_copy[] = "copy"; static char __pyx_k_data[] = "data"; static char __pyx_k_file[] = "__file__"; static char __pyx_k_fl_2[] = "fl_"; static char __pyx_k_info[] = "info"; static char __pyx_k_int8[] = "int8"; static char __pyx_k_join[] = "join"; static char __pyx_k_lmax[] = "lmax"; static char __pyx_k_main[] = "__main__"; static char __pyx_k_maps[] = "maps"; static char __pyx_k_mask[] = "mask"; static char __pyx_k_maxm[] = "maxm"; static char __pyx_k_mmax[] = "mmax"; static char __pyx_k_ndim[] = "ndim"; static char __pyx_k_npix[] = "npix"; static char __pyx_k_path[] = "path"; static char __pyx_k_size[] = "size"; static char __pyx_k_spin[] = "spin"; static char __pyx_k_sqrt[] = "sqrt"; static char __pyx_k_test[] = "__test__"; static char __pyx_k_Nspec[] = "Nspec"; static char __pyx_k_alm_2[] = "alm_"; static char __pyx_k_alms2[] = "alms2"; static char __pyx_k_array[] = "array"; static char __pyx_k_dtype[] = "dtype"; static char __pyx_k_empty[] = "empty"; static char __pyx_k_limit[] = "limit"; static char __pyx_k_masks[] = "masks"; static char __pyx_k_n_alm[] = "n_alm"; static char __pyx_k_niter[] = "niter"; static char __pyx_k_nside[] = "nside"; static char __pyx_k_numpy[] = "numpy"; static char __pyx_k_range[] = "range"; static char __pyx_k_theta[] = "theta"; static char __pyx_k_w_arr[] = "w_arr"; static char __pyx_k_zeros[] = "zeros"; static char __pyx_k_Nspec2[] = "Nspec2"; static char __pyx_k_alm2cl[] = "alm2cl"; static char __pyx_k_alms_c[] = "alms_c"; static char __pyx_k_almxfl[] = "almxfl"; static char __pyx_k_append[] = "append"; static char __pyx_k_flsize[] = "flsize"; static char __pyx_k_healpy[] = "healpy"; static char __pyx_k_import[] = "__import__"; static char __pyx_k_isfile[] = "isfile"; static char __pyx_k_lmax_2[] = "lmax_"; static char __pyx_k_maps_c[] = "maps_c"; static char __pyx_k_mmax_2[] = "mmax_"; static char __pyx_k_xrange[] = "xrange"; static char __pyx_k_IOError[] = "IOError"; static char __pyx_k_abspath[] = "abspath"; static char __pyx_k_almsize[] = "almsize"; static char __pyx_k_dirname[] = "dirname"; static char __pyx_k_float64[] = "float64"; static char __pyx_k_inplace[] = "inplace"; static char __pyx_k_map2alm[] = "map2alm"; static char __pyx_k_maptype[] = "maptype"; static char __pyx_k_mask_mi[] = "mask_mi"; static char __pyx_k_mask_mq[] = "mask_mq"; static char __pyx_k_mask_mu[] = "mask_mu"; static char __pyx_k_powspec[] = "powspec_"; static char __pyx_k_spectra[] = "spectra"; static char __pyx_k_DATAPATH[] = "DATAPATH"; static char __pyx_k_datapath[] = "datapath"; static char __pyx_k_lmax_out[] = "lmax_out"; static char __pyx_k_ValueError[] = "ValueError"; static char __pyx_k_c_datapath[] = "c_datapath"; static char __pyx_k_complex128[] = "complex128"; static char __pyx_k_lmax_out_2[] = "lmax_out_"; static char __pyx_k_npix2nside[] = "npix2nside"; static char __pyx_k_nside2npix[] = "nside2npix"; static char __pyx_k_rotate_alm[] = "rotate_alm"; static char __pyx_k_weightfile[] = "weightfile"; static char __pyx_k_alms_lonely[] = "alms_lonely"; static char __pyx_k_use_weights[] = "use_weights"; static char __pyx_k_RuntimeError[] = "RuntimeError"; static char __pyx_k_alm_getlmmax[] = "alm_getlmmax"; static char __pyx_k_get_datapath[] = "get_datapath"; static char __pyx_k_polarization[] = "polarization"; static char __pyx_k_Invalid_input[] = "Invalid input."; static char __pyx_k_pyx_getbuffer[] = "__pyx_getbuffer"; static char __pyx_k_healpy__sphtools[] = "healpy._sphtools"; static char __pyx_k_healpy_pixelfunc[] = "healpy.pixelfunc"; static char __pyx_k_ascontiguousarray[] = "ascontiguousarray"; static char __pyx_k_mmax_must_be_lmax[] = "mmax must be <= lmax"; static char __pyx_k_pyx_releasebuffer[] = "__pyx_releasebuffer"; static char __pyx_k_alm2map_spin_healpy[] = "alm2map_spin_healpy"; static char __pyx_k_map2alm_spin_healpy[] = "map2alm_spin_healpy"; static char __pyx_k_weight_ring_n_05d_fits[] = "weight_ring_n%05d.fits"; static char __pyx_k_Weight_file_not_found_in_s[] = "Weight file not found in %s"; static char __pyx_k_ndarray_is_not_C_contiguous[] = "ndarray is not C contiguous"; static char __pyx_k_all_alms_must_have_same_size[] = "all alms must have same size"; static char __pyx_k_Input_maps_must_have_same_size[] = "Input maps must have same size"; static char __pyx_k_Wrong_input_map_must_be_a_valid[] = "Wrong input map (must be a valid healpix map or a sequence of 1 or 3 maps)"; static char __pyx_k_home_zonca_p_software_healpy_he[] = "/home/zonca/p/software/healpy/healpy/src/_sphtools.pyx"; static char __pyx_k_unknown_dtype_code_in_numpy_pxd[] = "unknown dtype code in numpy.pxd (%d)"; static char __pyx_k_Format_string_allocated_too_shor[] = "Format string allocated too short, see comment in numpy.pxd"; static char __pyx_k_Non_native_byte_order_not_suppor[] = "Non-native byte order not supported"; static char __pyx_k_alms2_must_be_an_array_or_a_sequ[] = "alms2 must be an array or a sequence of arrays"; static char __pyx_k_alms_and_alms2_must_have_same_nu[] = "alms and alms2 must have same number of spectra"; static char __pyx_k_alms_must_be_an_array_or_a_seque[] = "alms must be an array or a sequence of arrays"; static char __pyx_k_ndarray_is_not_Fortran_contiguou[] = "ndarray is not Fortran contiguous"; static char __pyx_k_Format_string_allocated_too_shor_2[] = "Format string allocated too short."; static PyObject *__pyx_n_s_A1; static PyObject *__pyx_n_s_A2; static PyObject *__pyx_n_s_AC; static PyObject *__pyx_n_s_AG; static PyObject *__pyx_n_s_AI; static PyObject *__pyx_n_s_DATAPATH; static PyObject *__pyx_kp_u_Format_string_allocated_too_shor; static PyObject *__pyx_kp_u_Format_string_allocated_too_shor_2; static PyObject *__pyx_n_s_IOError; static PyObject *__pyx_kp_s_Input_maps_must_have_same_size; static PyObject *__pyx_kp_s_Invalid_input; static PyObject *__pyx_n_s_M1; static PyObject *__pyx_n_s_M2; static PyObject *__pyx_n_s_MI; static PyObject *__pyx_n_s_MQ; static PyObject *__pyx_n_s_MU; static PyObject *__pyx_kp_u_Non_native_byte_order_not_suppor; static PyObject *__pyx_n_s_Nspec; static PyObject *__pyx_n_s_Nspec2; static PyObject *__pyx_n_s_RuntimeError; static PyObject *__pyx_n_s_ValueError; static PyObject *__pyx_kp_s_Weight_file_not_found_in_s; static PyObject *__pyx_kp_s_Wrong_input_map_must_be_a_valid; static PyObject *__pyx_n_s_a; static PyObject *__pyx_n_s_abspath; static PyObject *__pyx_n_s_ac; static PyObject *__pyx_n_s_ag; static PyObject *__pyx_n_s_ai; static PyObject *__pyx_kp_s_all_alms_must_have_same_size; static PyObject *__pyx_n_s_alm; static PyObject *__pyx_n_s_alm1; static PyObject *__pyx_n_s_alm2; static PyObject *__pyx_n_s_alm2cl; static PyObject *__pyx_n_s_alm2map_spin_healpy; static PyObject *__pyx_n_s_almC; static PyObject *__pyx_n_s_almG; static PyObject *__pyx_n_s_almI; static PyObject *__pyx_n_s_alm_2; static PyObject *__pyx_n_s_alm_getlmmax; static PyObject *__pyx_n_s_alms; static PyObject *__pyx_n_s_alms2; static PyObject *__pyx_kp_s_alms2_must_be_an_array_or_a_sequ; static PyObject *__pyx_kp_s_alms_and_alms2_must_have_same_nu; static PyObject *__pyx_n_s_alms_c; static PyObject *__pyx_n_s_alms_lonely; static PyObject *__pyx_kp_s_alms_must_be_an_array_or_a_seque; static PyObject *__pyx_n_s_almsize; static PyObject *__pyx_n_s_almxfl; static PyObject *__pyx_n_s_append; static PyObject *__pyx_n_s_array; static PyObject *__pyx_n_s_ascontiguousarray; static PyObject *__pyx_n_s_c_datapath; static PyObject *__pyx_n_s_complex128; static PyObject *__pyx_n_s_copy; static PyObject *__pyx_n_s_data; static PyObject *__pyx_n_s_datapath; static PyObject *__pyx_n_s_dirname; static PyObject *__pyx_n_s_dtype; static PyObject *__pyx_n_s_empty; static PyObject *__pyx_n_s_f; static PyObject *__pyx_n_s_file; static PyObject *__pyx_n_s_fl; static PyObject *__pyx_n_s_fl_2; static PyObject *__pyx_n_s_float64; static PyObject *__pyx_n_s_flsize; static PyObject *__pyx_n_s_get_datapath; static PyObject *__pyx_n_s_healpy; static PyObject *__pyx_n_s_healpy__sphtools; static PyObject *__pyx_n_s_healpy_pixelfunc; static PyObject *__pyx_kp_s_home_zonca_p_software_healpy_he; static PyObject *__pyx_n_s_i; static PyObject *__pyx_n_s_import; static PyObject *__pyx_n_s_info; static PyObject *__pyx_n_s_inplace; static PyObject *__pyx_n_s_int8; static PyObject *__pyx_n_s_isfile; static PyObject *__pyx_n_s_j; static PyObject *__pyx_n_s_join; static PyObject *__pyx_n_s_l; static PyObject *__pyx_n_s_len; static PyObject *__pyx_n_s_limit; static PyObject *__pyx_n_s_lmax; static PyObject *__pyx_n_s_lmax_2; static PyObject *__pyx_n_s_lmax_out; static PyObject *__pyx_n_s_lmax_out_2; static PyObject *__pyx_n_s_m; static PyObject *__pyx_n_s_main; static PyObject *__pyx_n_s_map2alm; static PyObject *__pyx_n_s_map2alm_spin_healpy; static PyObject *__pyx_n_s_maps; static PyObject *__pyx_n_s_maps_c; static PyObject *__pyx_n_s_maptype; static PyObject *__pyx_n_s_mask; static PyObject *__pyx_n_s_mask_mi; static PyObject *__pyx_n_s_mask_mq; static PyObject *__pyx_n_s_mask_mu; static PyObject *__pyx_n_s_masks; static PyObject *__pyx_n_s_maxm; static PyObject *__pyx_n_s_mi; static PyObject *__pyx_n_s_mmax; static PyObject *__pyx_n_s_mmax_2; static PyObject *__pyx_kp_s_mmax_must_be_lmax; static PyObject *__pyx_n_s_mq; static PyObject *__pyx_n_s_mu; static PyObject *__pyx_n_s_n; static PyObject *__pyx_n_s_n_alm; static PyObject *__pyx_kp_u_ndarray_is_not_C_contiguous; static PyObject *__pyx_kp_u_ndarray_is_not_Fortran_contiguou; static PyObject *__pyx_n_s_ndim; static PyObject *__pyx_n_s_niter; static PyObject *__pyx_n_s_np; static PyObject *__pyx_n_s_npix; static PyObject *__pyx_n_s_npix2nside; static PyObject *__pyx_n_s_nside; static PyObject *__pyx_n_s_nside2npix; static PyObject *__pyx_n_s_numpy; static PyObject *__pyx_n_s_os; static PyObject *__pyx_n_s_path; static PyObject *__pyx_n_s_phi; static PyObject *__pyx_n_s_polarization; static PyObject *__pyx_n_s_powspec; static PyObject *__pyx_n_s_psi; static PyObject *__pyx_n_s_pyx_getbuffer; static PyObject *__pyx_n_s_pyx_releasebuffer; static PyObject *__pyx_n_s_range; static PyObject *__pyx_n_s_rotate_alm; static PyObject *__pyx_n_s_size; static PyObject *__pyx_n_s_spectra; static PyObject *__pyx_n_s_spin; static PyObject *__pyx_n_s_sqrt; static PyObject *__pyx_n_s_test; static PyObject *__pyx_n_s_theta; static PyObject *__pyx_kp_u_unknown_dtype_code_in_numpy_pxd; static PyObject *__pyx_n_s_use_weights; static PyObject *__pyx_n_s_w_arr; static PyObject *__pyx_kp_s_weight_ring_n_05d_fits; static PyObject *__pyx_n_s_weightfile; static PyObject *__pyx_n_s_xrange; static PyObject *__pyx_n_s_zeros; static PyObject *__pyx_n_s_zip; static PyObject *__pyx_float_0_0; static PyObject *__pyx_int_0; static PyObject *__pyx_int_1; static PyObject *__pyx_int_2; static PyObject *__pyx_int_3; static PyObject *__pyx_int_neg_3; static PyObject *__pyx_tuple_; static PyObject *__pyx_tuple__2; static PyObject *__pyx_tuple__3; static PyObject *__pyx_tuple__4; static PyObject *__pyx_tuple__5; static PyObject *__pyx_tuple__6; static PyObject *__pyx_tuple__7; static PyObject *__pyx_tuple__8; static PyObject *__pyx_tuple__9; static PyObject *__pyx_tuple__10; static PyObject *__pyx_tuple__11; static PyObject *__pyx_tuple__12; static PyObject *__pyx_tuple__13; static PyObject *__pyx_tuple__14; static PyObject *__pyx_tuple__15; static PyObject *__pyx_tuple__17; static PyObject *__pyx_tuple__19; static PyObject *__pyx_tuple__21; static PyObject *__pyx_tuple__23; static PyObject *__pyx_tuple__25; static PyObject *__pyx_tuple__27; static PyObject *__pyx_tuple__29; static PyObject *__pyx_codeobj__16; static PyObject *__pyx_codeobj__18; static PyObject *__pyx_codeobj__20; static PyObject *__pyx_codeobj__22; static PyObject *__pyx_codeobj__24; static PyObject *__pyx_codeobj__26; static PyObject *__pyx_codeobj__28; static PyObject *__pyx_codeobj__30; /* "healpy/src/_sphtools.pyx":54 * DATAPATH = None * * def get_datapath(): # <<<<<<<<<<<<<< * global DATAPATH * if DATAPATH is None: */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_1get_datapath(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused); /*proto*/ static PyMethodDef __pyx_mdef_6healpy_9_sphtools_1get_datapath = {__Pyx_NAMESTR("get_datapath"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_1get_datapath, METH_NOARGS, __Pyx_DOCSTR(0)}; static PyObject *__pyx_pw_6healpy_9_sphtools_1get_datapath(PyObject *__pyx_self, CYTHON_UNUSED PyObject *unused) { PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("get_datapath (wrapper)", 0); __pyx_r = __pyx_pf_6healpy_9_sphtools_get_datapath(__pyx_self); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_get_datapath(CYTHON_UNUSED PyObject *__pyx_self) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_t_2; int __pyx_t_3; PyObject *__pyx_t_4 = NULL; PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("get_datapath", 0); /* "healpy/src/_sphtools.pyx":56 * def get_datapath(): * global DATAPATH * if DATAPATH is None: # <<<<<<<<<<<<<< * DATAPATH = os.path.join(os.path.dirname(os.path.abspath(__file__)), 'data') * return DATAPATH */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_DATAPATH); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 56; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = (__pyx_t_1 == Py_None); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_3 = (__pyx_t_2 != 0); if (__pyx_t_3) { /* "healpy/src/_sphtools.pyx":57 * global DATAPATH * if DATAPATH is None: * DATAPATH = os.path.join(os.path.dirname(os.path.abspath(__file__)), 'data') # <<<<<<<<<<<<<< * return DATAPATH * */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_os); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_path); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_join); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_os); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_path); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_dirname); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_os); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_path); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_abspath); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_file); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = PyTuple_New(1); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_6); __Pyx_GIVEREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_7, NULL); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = PyTuple_New(1); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_6); __Pyx_GIVEREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_7, NULL); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = PyTuple_New(2); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); PyTuple_SET_ITEM(__pyx_t_7, 0, __pyx_t_6); __Pyx_GIVEREF(__pyx_t_6); __Pyx_INCREF(__pyx_n_s_data); PyTuple_SET_ITEM(__pyx_t_7, 1, __pyx_n_s_data); __Pyx_GIVEREF(__pyx_n_s_data); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_7, NULL); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (PyDict_SetItem(__pyx_d, __pyx_n_s_DATAPATH, __pyx_t_6) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 57; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; goto __pyx_L3; } __pyx_L3:; /* "healpy/src/_sphtools.pyx":58 * if DATAPATH is None: * DATAPATH = os.path.join(os.path.dirname(os.path.abspath(__file__)), 'data') * return DATAPATH # <<<<<<<<<<<<<< * * def map2alm_spin_healpy(maps, spin, lmax = None, mmax = None): */ __Pyx_XDECREF(__pyx_r); __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_DATAPATH); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_r = __pyx_t_6; __pyx_t_6 = 0; goto __pyx_L0; /* "healpy/src/_sphtools.pyx":54 * DATAPATH = None * * def get_datapath(): # <<<<<<<<<<<<<< * global DATAPATH * if DATAPATH is None: */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_AddTraceback("healpy._sphtools.get_datapath", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":60 * return DATAPATH * * def map2alm_spin_healpy(maps, spin, lmax = None, mmax = None): # <<<<<<<<<<<<<< * """Computes the spinned alm of a 2 Healpix maps. * */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_3map2alm_spin_healpy(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_9_sphtools_2map2alm_spin_healpy[] = "Computes the spinned alm of a 2 Healpix maps.\n\n Parameters\n ----------\n m : list of 2 arrays\n list of 2 input maps as numpy arrays\n spin : int\n spin of the alms (either 1, 2 or 3)\n lmax : int, scalar, optional\n Maximum l of the power spectrum. Default: 3*nside-1\n mmax : int, scalar, optional\n Maximum m of the alm. Default: lmax\n \n Returns\n -------\n alms : list of 2 arrays\n list of 2 alms\n "; static PyMethodDef __pyx_mdef_6healpy_9_sphtools_3map2alm_spin_healpy = {__Pyx_NAMESTR("map2alm_spin_healpy"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_3map2alm_spin_healpy, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_9_sphtools_2map2alm_spin_healpy)}; static PyObject *__pyx_pw_6healpy_9_sphtools_3map2alm_spin_healpy(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_maps = 0; PyObject *__pyx_v_spin = 0; PyObject *__pyx_v_lmax = 0; PyObject *__pyx_v_mmax = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("map2alm_spin_healpy (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_maps,&__pyx_n_s_spin,&__pyx_n_s_lmax,&__pyx_n_s_mmax,0}; PyObject* values[4] = {0,0,0,0}; values[2] = ((PyObject *)Py_None); values[3] = ((PyObject *)Py_None); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_maps)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_spin)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("map2alm_spin_healpy", 0, 2, 4, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 60; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lmax); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mmax); if (value) { values[3] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "map2alm_spin_healpy") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 60; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_maps = values[0]; __pyx_v_spin = values[1]; __pyx_v_lmax = values[2]; __pyx_v_mmax = values[3]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("map2alm_spin_healpy", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 60; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._sphtools.map2alm_spin_healpy", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_9_sphtools_2map2alm_spin_healpy(__pyx_self, __pyx_v_maps, __pyx_v_spin, __pyx_v_lmax, __pyx_v_mmax); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_2map2alm_spin_healpy(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_maps, PyObject *__pyx_v_spin, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax) { PyObject *__pyx_v_maps_c = NULL; PyObject *__pyx_v_masks = NULL; int __pyx_v_lmax_; int __pyx_v_mmax_; int __pyx_v_nside; int __pyx_v_npix; Healpix_Map *__pyx_v_M1; Healpix_Map *__pyx_v_M2; PyObject *__pyx_v_m = NULL; PyObject *__pyx_v_mask = NULL; int __pyx_v_n_alm; PyObject *__pyx_v_alms = NULL; Alm > *__pyx_v_A1; Alm > *__pyx_v_A2; arr *__pyx_v_w_arr; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; PyObject *__pyx_t_2 = NULL; Py_ssize_t __pyx_t_3; PyObject *(*__pyx_t_4)(PyObject *); PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyObject *__pyx_t_8 = NULL; PyObject *__pyx_t_9 = NULL; int __pyx_t_10; int __pyx_t_11; int __pyx_t_12; Healpix_Map *__pyx_t_13; PyObject *(*__pyx_t_14)(PyObject *); Alm > *__pyx_t_15; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("map2alm_spin_healpy", 0); /* "healpy/src/_sphtools.pyx":79 * list of 2 alms * """ * maps_c = [np.ascontiguousarray(m, dtype=np.float64) for m in maps] # <<<<<<<<<<<<<< * * # create UNSEEN mask for map */ __pyx_t_1 = PyList_New(0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyList_CheckExact(__pyx_v_maps) || PyTuple_CheckExact(__pyx_v_maps)) { __pyx_t_2 = __pyx_v_maps; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0; __pyx_t_4 = NULL; } else { __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(__pyx_v_maps); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; } for (;;) { if (!__pyx_t_4 && PyList_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_5 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_4 && PyTuple_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_5 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_5 = __pyx_t_4(__pyx_t_2); if (unlikely(!__pyx_t_5)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_5); } __Pyx_XDECREF_SET(__pyx_v_m, __pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_INCREF(__pyx_v_m); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_v_m); __Pyx_GIVEREF(__pyx_v_m); __pyx_t_7 = PyDict_New(); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_9 = __Pyx_PyObject_GetAttrStr(__pyx_t_8, __pyx_n_s_float64); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; if (PyDict_SetItem(__pyx_t_7, __pyx_n_s_dtype, __pyx_t_9) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_t_9 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (unlikely(__Pyx_ListComp_Append(__pyx_t_1, (PyObject*)__pyx_t_9))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 79; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; } __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_maps_c = ((PyObject*)__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":82 * * # create UNSEEN mask for map * masks = [False if count_bad(m) == 0 else mkmask(m) for m in maps_c] # <<<<<<<<<<<<<< * * # Adjust lmax and mmax */ __pyx_t_1 = PyList_New(0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 82; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __pyx_v_maps_c; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0; for (;;) { if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_9 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_9); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 82; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_9 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 82; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif __Pyx_XDECREF_SET(__pyx_v_m, __pyx_t_9); __pyx_t_9 = 0; if (!(likely(((__pyx_v_m) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_m, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 82; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (((__pyx_f_6healpy_9_sphtools_count_bad(((PyArrayObject *)__pyx_v_m), 0) == 0) != 0)) { __Pyx_INCREF(Py_False); __pyx_t_9 = Py_False; } else { if (!(likely(((__pyx_v_m) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_m, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 82; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_7 = __pyx_f_6healpy_9_sphtools_mkmask(((PyArrayObject *)__pyx_v_m), 0); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 82; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_9 = __pyx_t_7; __pyx_t_7 = 0; } if (unlikely(__Pyx_ListComp_Append(__pyx_t_1, (PyObject*)__pyx_t_9))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 82; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; } __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_masks = ((PyObject*)__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":86 * # Adjust lmax and mmax * cdef int lmax_, mmax_, nside, npix * npix = maps_c[0].size # <<<<<<<<<<<<<< * nside = npix2nside(npix) * if lmax is None: */ __pyx_t_1 = __Pyx_GetItemInt_List(__pyx_v_maps_c, 0, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_1 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 86; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_size); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 86; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_10 = __Pyx_PyInt_As_int(__pyx_t_2); if (unlikely((__pyx_t_10 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 86; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_npix = __pyx_t_10; /* "healpy/src/_sphtools.pyx":87 * cdef int lmax_, mmax_, nside, npix * npix = maps_c[0].size * nside = npix2nside(npix) # <<<<<<<<<<<<<< * if lmax is None: * lmax_ = 3 * nside - 1 */ __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_npix2nside); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_v_npix); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_9 = PyTuple_New(1); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); PyTuple_SET_ITEM(__pyx_t_9, 0, __pyx_t_1); __Pyx_GIVEREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_9, NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_t_10 = __Pyx_PyInt_As_int(__pyx_t_1); if (unlikely((__pyx_t_10 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 87; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_nside = __pyx_t_10; /* "healpy/src/_sphtools.pyx":88 * npix = maps_c[0].size * nside = npix2nside(npix) * if lmax is None: # <<<<<<<<<<<<<< * lmax_ = 3 * nside - 1 * else: */ __pyx_t_11 = (__pyx_v_lmax == Py_None); __pyx_t_12 = (__pyx_t_11 != 0); if (__pyx_t_12) { /* "healpy/src/_sphtools.pyx":89 * nside = npix2nside(npix) * if lmax is None: * lmax_ = 3 * nside - 1 # <<<<<<<<<<<<<< * else: * lmax_ = lmax */ __pyx_v_lmax_ = ((3 * __pyx_v_nside) - 1); goto __pyx_L7; } /*else*/ { /* "healpy/src/_sphtools.pyx":91 * lmax_ = 3 * nside - 1 * else: * lmax_ = lmax # <<<<<<<<<<<<<< * if mmax is None: * mmax_ = lmax_ */ __pyx_t_10 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_10 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 91; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_lmax_ = __pyx_t_10; } __pyx_L7:; /* "healpy/src/_sphtools.pyx":92 * else: * lmax_ = lmax * if mmax is None: # <<<<<<<<<<<<<< * mmax_ = lmax_ * else: */ __pyx_t_12 = (__pyx_v_mmax == Py_None); __pyx_t_11 = (__pyx_t_12 != 0); if (__pyx_t_11) { /* "healpy/src/_sphtools.pyx":93 * lmax_ = lmax * if mmax is None: * mmax_ = lmax_ # <<<<<<<<<<<<<< * else: * mmax_ = mmax */ __pyx_v_mmax_ = __pyx_v_lmax_; goto __pyx_L8; } /*else*/ { /* "healpy/src/_sphtools.pyx":95 * mmax_ = lmax_ * else: * mmax_ = mmax # <<<<<<<<<<<<<< * * # Check all maps have same npix */ __pyx_t_10 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_10 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 95; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_mmax_ = __pyx_t_10; } __pyx_L8:; /* "healpy/src/_sphtools.pyx":98 * * # Check all maps have same npix * if maps_c[1].size != npix: # <<<<<<<<<<<<<< * raise ValueError("Input maps must have same size") * */ __pyx_t_1 = __Pyx_GetItemInt_List(__pyx_v_maps_c, 1, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_1 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 98; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_1); __pyx_t_9 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_size); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 98; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_v_npix); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 98; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = PyObject_RichCompare(__pyx_t_9, __pyx_t_1, Py_NE); __Pyx_XGOTREF(__pyx_t_2); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 98; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_11 = __Pyx_PyObject_IsTrue(__pyx_t_2); if (unlikely(__pyx_t_11 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 98; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; if (__pyx_t_11) { /* "healpy/src/_sphtools.pyx":99 * # Check all maps have same npix * if maps_c[1].size != npix: * raise ValueError("Input maps must have same size") # <<<<<<<<<<<<<< * * # View the ndarray as a Healpix_Map */ __pyx_t_2 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple_, NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 99; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_Raise(__pyx_t_2, 0, 0, 0); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 99; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":102 * * # View the ndarray as a Healpix_Map * M1 = ndarray2map(maps_c[0], RING) # <<<<<<<<<<<<<< * M2 = ndarray2map(maps_c[1], RING) * */ __pyx_t_2 = __Pyx_GetItemInt_List(__pyx_v_maps_c, 0, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_2 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 102; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_2); if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 102; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = __pyx_f_7_common_ndarray2map(((PyArrayObject *)__pyx_t_2), RING); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 102; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_M1 = __pyx_t_13; /* "healpy/src/_sphtools.pyx":103 * # View the ndarray as a Healpix_Map * M1 = ndarray2map(maps_c[0], RING) * M2 = ndarray2map(maps_c[1], RING) # <<<<<<<<<<<<<< * * # replace UNSEEN pixels with zeros */ __pyx_t_2 = __Pyx_GetItemInt_List(__pyx_v_maps_c, 1, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_2 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 103; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_2); if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 103; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = __pyx_f_7_common_ndarray2map(((PyArrayObject *)__pyx_t_2), RING); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 103; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_M2 = __pyx_t_13; /* "healpy/src/_sphtools.pyx":106 * * # replace UNSEEN pixels with zeros * for m, mask in zip(maps_c, masks): # <<<<<<<<<<<<<< * if mask: * m[mask] = 0.0 */ __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_INCREF(__pyx_v_maps_c); PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_v_maps_c); __Pyx_GIVEREF(__pyx_v_maps_c); __Pyx_INCREF(__pyx_v_masks); PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_v_masks); __Pyx_GIVEREF(__pyx_v_masks); __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_zip, __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; if (PyList_CheckExact(__pyx_t_1) || PyTuple_CheckExact(__pyx_t_1)) { __pyx_t_2 = __pyx_t_1; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0; __pyx_t_4 = NULL; } else { __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(__pyx_t_1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; } __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; for (;;) { if (!__pyx_t_4 && PyList_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_1 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_1); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_1 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_4 && PyTuple_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_1 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_1); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_1 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_1 = __pyx_t_4(__pyx_t_2); if (unlikely(!__pyx_t_1)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_1); } if ((likely(PyTuple_CheckExact(__pyx_t_1))) || (PyList_CheckExact(__pyx_t_1))) { PyObject* sequence = __pyx_t_1; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON if (likely(PyTuple_CheckExact(sequence))) { __pyx_t_9 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_7 = PyTuple_GET_ITEM(sequence, 1); } else { __pyx_t_9 = PyList_GET_ITEM(sequence, 0); __pyx_t_7 = PyList_GET_ITEM(sequence, 1); } __Pyx_INCREF(__pyx_t_9); __Pyx_INCREF(__pyx_t_7); #else __pyx_t_9 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __pyx_t_7 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); #endif __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; } else { Py_ssize_t index = -1; __pyx_t_5 = PyObject_GetIter(__pyx_t_1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_14 = Py_TYPE(__pyx_t_5)->tp_iternext; index = 0; __pyx_t_9 = __pyx_t_14(__pyx_t_5); if (unlikely(!__pyx_t_9)) goto __pyx_L12_unpacking_failed; __Pyx_GOTREF(__pyx_t_9); index = 1; __pyx_t_7 = __pyx_t_14(__pyx_t_5); if (unlikely(!__pyx_t_7)) goto __pyx_L12_unpacking_failed; __Pyx_GOTREF(__pyx_t_7); if (__Pyx_IternextUnpackEndCheck(__pyx_t_14(__pyx_t_5), 2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = NULL; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; goto __pyx_L13_unpacking_done; __pyx_L12_unpacking_failed:; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_14 = NULL; if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_L13_unpacking_done:; } __Pyx_XDECREF_SET(__pyx_v_m, __pyx_t_9); __pyx_t_9 = 0; __Pyx_XDECREF_SET(__pyx_v_mask, __pyx_t_7); __pyx_t_7 = 0; /* "healpy/src/_sphtools.pyx":107 * # replace UNSEEN pixels with zeros * for m, mask in zip(maps_c, masks): * if mask: # <<<<<<<<<<<<<< * m[mask] = 0.0 * */ __pyx_t_11 = __Pyx_PyObject_IsTrue(__pyx_v_mask); if (unlikely(__pyx_t_11 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 107; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_11) { /* "healpy/src/_sphtools.pyx":108 * for m, mask in zip(maps_c, masks): * if mask: * m[mask] = 0.0 # <<<<<<<<<<<<<< * * # Create an ndarray object that will contain the alm for output (to be returned) */ if (unlikely(PyObject_SetItem(__pyx_v_m, __pyx_v_mask, __pyx_float_0_0) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 108; __pyx_clineno = __LINE__; goto __pyx_L1_error;} goto __pyx_L14; } __pyx_L14:; } __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":111 * * # Create an ndarray object that will contain the alm for output (to be returned) * n_alm = alm_getn(lmax_, mmax_) # <<<<<<<<<<<<<< * alms = [np.empty(n_alm, dtype=np.complex128) for m in maps] * */ __pyx_v_n_alm = __pyx_f_6healpy_9_sphtools_alm_getn(__pyx_v_lmax_, __pyx_v_mmax_); /* "healpy/src/_sphtools.pyx":112 * # Create an ndarray object that will contain the alm for output (to be returned) * n_alm = alm_getn(lmax_, mmax_) * alms = [np.empty(n_alm, dtype=np.complex128) for m in maps] # <<<<<<<<<<<<<< * * # View the ndarray as an Alm */ __pyx_t_2 = PyList_New(0); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); if (PyList_CheckExact(__pyx_v_maps) || PyTuple_CheckExact(__pyx_v_maps)) { __pyx_t_1 = __pyx_v_maps; __Pyx_INCREF(__pyx_t_1); __pyx_t_3 = 0; __pyx_t_4 = NULL; } else { __pyx_t_3 = -1; __pyx_t_1 = PyObject_GetIter(__pyx_v_maps); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_4 = Py_TYPE(__pyx_t_1)->tp_iternext; } for (;;) { if (!__pyx_t_4 && PyList_CheckExact(__pyx_t_1)) { if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_1)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_7 = PyList_GET_ITEM(__pyx_t_1, __pyx_t_3); __Pyx_INCREF(__pyx_t_7); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_7 = PySequence_ITEM(__pyx_t_1, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_4 && PyTuple_CheckExact(__pyx_t_1)) { if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_1)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_7 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_3); __Pyx_INCREF(__pyx_t_7); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_7 = PySequence_ITEM(__pyx_t_1, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_7 = __pyx_t_4(__pyx_t_1); if (unlikely(!__pyx_t_7)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_7); } __Pyx_XDECREF_SET(__pyx_v_m, __pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_9 = __Pyx_PyObject_GetAttrStr(__pyx_t_7, __pyx_n_s_empty); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = __Pyx_PyInt_From_int(__pyx_v_n_alm); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_7); __Pyx_GIVEREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = PyDict_New(); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_complex128); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (PyDict_SetItem(__pyx_t_7, __pyx_n_s_dtype, __pyx_t_8) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_9, __pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (unlikely(__Pyx_ListComp_Append(__pyx_t_2, (PyObject*)__pyx_t_8))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 112; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; } __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_alms = ((PyObject*)__pyx_t_2); __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":116 * # View the ndarray as an Alm * # Alms = [ndarray2alm(alm, lmax_, mmax_) for alm in alms] * A1 = ndarray2alm(alms[0], lmax_, mmax_) # <<<<<<<<<<<<<< * A2 = ndarray2alm(alms[1], lmax_, mmax_) * */ __pyx_t_2 = __Pyx_GetItemInt_List(__pyx_v_alms, 0, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_2 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 116; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_2); if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 116; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_15 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_t_2), __pyx_v_lmax_, __pyx_v_mmax_); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 116; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_A1 = __pyx_t_15; /* "healpy/src/_sphtools.pyx":117 * # Alms = [ndarray2alm(alm, lmax_, mmax_) for alm in alms] * A1 = ndarray2alm(alms[0], lmax_, mmax_) * A2 = ndarray2alm(alms[1], lmax_, mmax_) # <<<<<<<<<<<<<< * * # ring weights */ __pyx_t_2 = __Pyx_GetItemInt_List(__pyx_v_alms, 1, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_2 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 117; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_2); if (!(likely(((__pyx_t_2) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_2, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 117; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_15 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_t_2), __pyx_v_lmax_, __pyx_v_mmax_); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 117; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_A2 = __pyx_t_15; /* "healpy/src/_sphtools.pyx":120 * * # ring weights * cdef arr[double] * w_arr = new arr[double]() # <<<<<<<<<<<<<< * cdef int i * cdef char *c_datapath */ __pyx_v_w_arr = new arr(); /* "healpy/src/_sphtools.pyx":123 * cdef int i * cdef char *c_datapath * w_arr.allocAndFill(2 * nside, 1.) # <<<<<<<<<<<<<< * * map2alm_spin(M1[0], M2[0], A1[0], A2[0], spin, w_arr[0], False) */ __pyx_v_w_arr->allocAndFill((2 * __pyx_v_nside), 1.); /* "healpy/src/_sphtools.pyx":125 * w_arr.allocAndFill(2 * nside, 1.) * * map2alm_spin(M1[0], M2[0], A1[0], A2[0], spin, w_arr[0], False) # <<<<<<<<<<<<<< * * # restore input map with UNSEEN pixels */ __pyx_t_10 = __Pyx_PyInt_As_int(__pyx_v_spin); if (unlikely((__pyx_t_10 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 125; __pyx_clineno = __LINE__; goto __pyx_L1_error;} map2alm_spin((__pyx_v_M1[0]), (__pyx_v_M2[0]), (__pyx_v_A1[0]), (__pyx_v_A2[0]), __pyx_t_10, (__pyx_v_w_arr[0]), 0); /* "healpy/src/_sphtools.pyx":128 * * # restore input map with UNSEEN pixels * for m, mask in zip(maps_c, masks): # <<<<<<<<<<<<<< * if mask: * m[mask] = UNSEEN */ __pyx_t_2 = PyTuple_New(2); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_INCREF(__pyx_v_maps_c); PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_v_maps_c); __Pyx_GIVEREF(__pyx_v_maps_c); __Pyx_INCREF(__pyx_v_masks); PyTuple_SET_ITEM(__pyx_t_2, 1, __pyx_v_masks); __Pyx_GIVEREF(__pyx_v_masks); __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_zip, __pyx_t_2, NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; if (PyList_CheckExact(__pyx_t_1) || PyTuple_CheckExact(__pyx_t_1)) { __pyx_t_2 = __pyx_t_1; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0; __pyx_t_4 = NULL; } else { __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(__pyx_t_1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; } __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; for (;;) { if (!__pyx_t_4 && PyList_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_1 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_1); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_1 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_4 && PyTuple_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_1 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_1); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_1 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_1 = __pyx_t_4(__pyx_t_2); if (unlikely(!__pyx_t_1)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_1); } if ((likely(PyTuple_CheckExact(__pyx_t_1))) || (PyList_CheckExact(__pyx_t_1))) { PyObject* sequence = __pyx_t_1; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON if (likely(PyTuple_CheckExact(sequence))) { __pyx_t_8 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_7 = PyTuple_GET_ITEM(sequence, 1); } else { __pyx_t_8 = PyList_GET_ITEM(sequence, 0); __pyx_t_7 = PyList_GET_ITEM(sequence, 1); } __Pyx_INCREF(__pyx_t_8); __Pyx_INCREF(__pyx_t_7); #else __pyx_t_8 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_7 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); #endif __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; } else { Py_ssize_t index = -1; __pyx_t_5 = PyObject_GetIter(__pyx_t_1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_14 = Py_TYPE(__pyx_t_5)->tp_iternext; index = 0; __pyx_t_8 = __pyx_t_14(__pyx_t_5); if (unlikely(!__pyx_t_8)) goto __pyx_L19_unpacking_failed; __Pyx_GOTREF(__pyx_t_8); index = 1; __pyx_t_7 = __pyx_t_14(__pyx_t_5); if (unlikely(!__pyx_t_7)) goto __pyx_L19_unpacking_failed; __Pyx_GOTREF(__pyx_t_7); if (__Pyx_IternextUnpackEndCheck(__pyx_t_14(__pyx_t_5), 2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = NULL; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; goto __pyx_L20_unpacking_done; __pyx_L19_unpacking_failed:; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_14 = NULL; if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_L20_unpacking_done:; } __Pyx_XDECREF_SET(__pyx_v_m, __pyx_t_8); __pyx_t_8 = 0; __Pyx_XDECREF_SET(__pyx_v_mask, __pyx_t_7); __pyx_t_7 = 0; /* "healpy/src/_sphtools.pyx":129 * # restore input map with UNSEEN pixels * for m, mask in zip(maps_c, masks): * if mask: # <<<<<<<<<<<<<< * m[mask] = UNSEEN * */ __pyx_t_11 = __Pyx_PyObject_IsTrue(__pyx_v_mask); if (unlikely(__pyx_t_11 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 129; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_11) { /* "healpy/src/_sphtools.pyx":130 * for m, mask in zip(maps_c, masks): * if mask: * m[mask] = UNSEEN # <<<<<<<<<<<<<< * * del w_arr */ __pyx_t_1 = PyFloat_FromDouble(__pyx_v_6healpy_9_sphtools_UNSEEN); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 130; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (unlikely(PyObject_SetItem(__pyx_v_m, __pyx_v_mask, __pyx_t_1) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 130; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; goto __pyx_L21; } __pyx_L21:; } __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":132 * m[mask] = UNSEEN * * del w_arr # <<<<<<<<<<<<<< * del M1, M2, A1, A2 * return alms */ delete __pyx_v_w_arr; /* "healpy/src/_sphtools.pyx":133 * * del w_arr * del M1, M2, A1, A2 # <<<<<<<<<<<<<< * return alms * */ delete __pyx_v_M1; delete __pyx_v_M2; delete __pyx_v_A1; delete __pyx_v_A2; /* "healpy/src/_sphtools.pyx":134 * del w_arr * del M1, M2, A1, A2 * return alms # <<<<<<<<<<<<<< * * def alm2map_spin_healpy(alms, nside, spin, lmax, mmax=None): */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(__pyx_v_alms); __pyx_r = __pyx_v_alms; goto __pyx_L0; /* "healpy/src/_sphtools.pyx":60 * return DATAPATH * * def map2alm_spin_healpy(maps, spin, lmax = None, mmax = None): # <<<<<<<<<<<<<< * """Computes the spinned alm of a 2 Healpix maps. * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_2); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_XDECREF(__pyx_t_8); __Pyx_XDECREF(__pyx_t_9); __Pyx_AddTraceback("healpy._sphtools.map2alm_spin_healpy", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF(__pyx_v_maps_c); __Pyx_XDECREF(__pyx_v_masks); __Pyx_XDECREF(__pyx_v_m); __Pyx_XDECREF(__pyx_v_mask); __Pyx_XDECREF(__pyx_v_alms); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":136 * return alms * * def alm2map_spin_healpy(alms, nside, spin, lmax, mmax=None): # <<<<<<<<<<<<<< * """Computes maps from a set of 2 spinned alm * */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_5alm2map_spin_healpy(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_9_sphtools_4alm2map_spin_healpy[] = "Computes maps from a set of 2 spinned alm\n\n Parameters\n ----------\n alms : list of 2 arrays\n list of 2 alms\n nside : int\n requested nside of the output map \n spin : int\n spin of the alms (either 1, 2 or 3)\n lmax : int, scalar\n Maximum l of the power spectrum.\n mmax : int, scalar, optional\n Maximum m of the alm. Default: lmax\n \n Returns\n -------\n m : list of 2 arrays\n list of 2 out maps in RING scheme as numpy arrays\n "; static PyMethodDef __pyx_mdef_6healpy_9_sphtools_5alm2map_spin_healpy = {__Pyx_NAMESTR("alm2map_spin_healpy"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_5alm2map_spin_healpy, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_9_sphtools_4alm2map_spin_healpy)}; static PyObject *__pyx_pw_6healpy_9_sphtools_5alm2map_spin_healpy(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_alms = 0; PyObject *__pyx_v_nside = 0; PyObject *__pyx_v_spin = 0; PyObject *__pyx_v_lmax = 0; PyObject *__pyx_v_mmax = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("alm2map_spin_healpy (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_alms,&__pyx_n_s_nside,&__pyx_n_s_spin,&__pyx_n_s_lmax,&__pyx_n_s_mmax,0}; PyObject* values[5] = {0,0,0,0,0}; values[4] = ((PyObject *)Py_None); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_alms)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("alm2map_spin_healpy", 0, 4, 5, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (likely((values[2] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_spin)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("alm2map_spin_healpy", 0, 4, 5, 2); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 3: if (likely((values[3] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lmax)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("alm2map_spin_healpy", 0, 4, 5, 3); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 4: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mmax); if (value) { values[4] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "alm2map_spin_healpy") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); values[2] = PyTuple_GET_ITEM(__pyx_args, 2); values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_alms = values[0]; __pyx_v_nside = values[1]; __pyx_v_spin = values[2]; __pyx_v_lmax = values[3]; __pyx_v_mmax = values[4]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("alm2map_spin_healpy", 0, 4, 5, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._sphtools.alm2map_spin_healpy", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_9_sphtools_4alm2map_spin_healpy(__pyx_self, __pyx_v_alms, __pyx_v_nside, __pyx_v_spin, __pyx_v_lmax, __pyx_v_mmax); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_4alm2map_spin_healpy(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alms, PyObject *__pyx_v_nside, PyObject *__pyx_v_spin, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax) { PyObject *__pyx_v_alms_c = NULL; PyObject *__pyx_v_npix = NULL; PyObject *__pyx_v_maps = NULL; Healpix_Map *__pyx_v_M1; Healpix_Map *__pyx_v_M2; Alm > *__pyx_v_A1; Alm > *__pyx_v_A2; PyObject *__pyx_v_alm = NULL; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; PyObject *__pyx_t_2 = NULL; Py_ssize_t __pyx_t_3; PyObject *(*__pyx_t_4)(PyObject *); PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyObject *__pyx_t_8 = NULL; PyObject *__pyx_t_9 = NULL; Healpix_Map *__pyx_t_10; int __pyx_t_11; int __pyx_t_12; int __pyx_t_13; int __pyx_t_14; Alm > *__pyx_t_15; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("alm2map_spin_healpy", 0); __Pyx_INCREF(__pyx_v_mmax); /* "healpy/src/_sphtools.pyx":157 * list of 2 out maps in RING scheme as numpy arrays * """ * alms_c = [np.ascontiguousarray(alm, dtype=np.complex128) for alm in alms] # <<<<<<<<<<<<<< * * npix = nside2npix(nside) */ __pyx_t_1 = PyList_New(0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyList_CheckExact(__pyx_v_alms) || PyTuple_CheckExact(__pyx_v_alms)) { __pyx_t_2 = __pyx_v_alms; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0; __pyx_t_4 = NULL; } else { __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(__pyx_v_alms); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; } for (;;) { if (!__pyx_t_4 && PyList_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_5 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_4 && PyTuple_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_5 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_5); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_5 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_5 = __pyx_t_4(__pyx_t_2); if (unlikely(!__pyx_t_5)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_5); } __Pyx_XDECREF_SET(__pyx_v_alm, __pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_INCREF(__pyx_v_alm); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_v_alm); __Pyx_GIVEREF(__pyx_v_alm); __pyx_t_7 = PyDict_New(); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_9 = __Pyx_PyObject_GetAttrStr(__pyx_t_8, __pyx_n_s_complex128); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; if (PyDict_SetItem(__pyx_t_7, __pyx_n_s_dtype, __pyx_t_9) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_t_9 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_5, __pyx_t_7); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (unlikely(__Pyx_ListComp_Append(__pyx_t_1, (PyObject*)__pyx_t_9))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 157; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; } __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_alms_c = ((PyObject*)__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":159 * alms_c = [np.ascontiguousarray(alm, dtype=np.complex128) for alm in alms] * * npix = nside2npix(nside) # <<<<<<<<<<<<<< * maps = [np.zeros(npix, dtype=np.float64) for alm in alms] * */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_nside2npix); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 159; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 159; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_INCREF(__pyx_v_nside); PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_v_nside); __Pyx_GIVEREF(__pyx_v_nside); __pyx_t_9 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_2, NULL); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 159; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_npix = __pyx_t_9; __pyx_t_9 = 0; /* "healpy/src/_sphtools.pyx":160 * * npix = nside2npix(nside) * maps = [np.zeros(npix, dtype=np.float64) for alm in alms] # <<<<<<<<<<<<<< * * # View the ndarray as a Healpix_Map */ __pyx_t_9 = PyList_New(0); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); if (PyList_CheckExact(__pyx_v_alms) || PyTuple_CheckExact(__pyx_v_alms)) { __pyx_t_2 = __pyx_v_alms; __Pyx_INCREF(__pyx_t_2); __pyx_t_3 = 0; __pyx_t_4 = NULL; } else { __pyx_t_3 = -1; __pyx_t_2 = PyObject_GetIter(__pyx_v_alms); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_4 = Py_TYPE(__pyx_t_2)->tp_iternext; } for (;;) { if (!__pyx_t_4 && PyList_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyList_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_1 = PyList_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_1); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_1 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_4 && PyTuple_CheckExact(__pyx_t_2)) { if (__pyx_t_3 >= PyTuple_GET_SIZE(__pyx_t_2)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_1 = PyTuple_GET_ITEM(__pyx_t_2, __pyx_t_3); __Pyx_INCREF(__pyx_t_1); __pyx_t_3++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_1 = PySequence_ITEM(__pyx_t_2, __pyx_t_3); __pyx_t_3++; if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_1 = __pyx_t_4(__pyx_t_2); if (unlikely(!__pyx_t_1)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_1); } __Pyx_XDECREF_SET(__pyx_v_alm, __pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_zeros); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = PyTuple_New(1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_INCREF(__pyx_v_npix); PyTuple_SET_ITEM(__pyx_t_1, 0, __pyx_v_npix); __Pyx_GIVEREF(__pyx_v_npix); __pyx_t_5 = PyDict_New(); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_float64); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (PyDict_SetItem(__pyx_t_5, __pyx_n_s_dtype, __pyx_t_8) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_1, __pyx_t_5); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (unlikely(__Pyx_ListComp_Append(__pyx_t_9, (PyObject*)__pyx_t_8))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 160; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; } __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_maps = ((PyObject*)__pyx_t_9); __pyx_t_9 = 0; /* "healpy/src/_sphtools.pyx":163 * * # View the ndarray as a Healpix_Map * M1 = ndarray2map(maps[0], RING) # <<<<<<<<<<<<<< * M2 = ndarray2map(maps[1], RING) * */ __pyx_t_9 = __Pyx_GetItemInt_List(__pyx_v_maps, 0, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 163; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_9); if (!(likely(((__pyx_t_9) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_9, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 163; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_10 = __pyx_f_7_common_ndarray2map(((PyArrayObject *)__pyx_t_9), RING); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 163; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_v_M1 = __pyx_t_10; /* "healpy/src/_sphtools.pyx":164 * # View the ndarray as a Healpix_Map * M1 = ndarray2map(maps[0], RING) * M2 = ndarray2map(maps[1], RING) # <<<<<<<<<<<<<< * * if not mmax: */ __pyx_t_9 = __Pyx_GetItemInt_List(__pyx_v_maps, 1, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 164; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_9); if (!(likely(((__pyx_t_9) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_9, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 164; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_10 = __pyx_f_7_common_ndarray2map(((PyArrayObject *)__pyx_t_9), RING); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 164; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_v_M2 = __pyx_t_10; /* "healpy/src/_sphtools.pyx":166 * M2 = ndarray2map(maps[1], RING) * * if not mmax: # <<<<<<<<<<<<<< * mmax = lmax * */ __pyx_t_11 = __Pyx_PyObject_IsTrue(__pyx_v_mmax); if (unlikely(__pyx_t_11 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 166; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_12 = ((!__pyx_t_11) != 0); if (__pyx_t_12) { /* "healpy/src/_sphtools.pyx":167 * * if not mmax: * mmax = lmax # <<<<<<<<<<<<<< * * # View the ndarray as an Alm */ __Pyx_INCREF(__pyx_v_lmax); __Pyx_DECREF_SET(__pyx_v_mmax, __pyx_v_lmax); goto __pyx_L7; } __pyx_L7:; /* "healpy/src/_sphtools.pyx":170 * * # View the ndarray as an Alm * A1 = ndarray2alm(alms_c[0], lmax, mmax) # <<<<<<<<<<<<<< * A2 = ndarray2alm(alms_c[1], lmax, mmax) * */ __pyx_t_9 = __Pyx_GetItemInt_List(__pyx_v_alms_c, 0, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 170; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_9); if (!(likely(((__pyx_t_9) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_9, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 170; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_13 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 170; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_14 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 170; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_15 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_t_9), __pyx_t_13, __pyx_t_14); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 170; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_v_A1 = __pyx_t_15; /* "healpy/src/_sphtools.pyx":171 * # View the ndarray as an Alm * A1 = ndarray2alm(alms_c[0], lmax, mmax) * A2 = ndarray2alm(alms_c[1], lmax, mmax) # <<<<<<<<<<<<<< * * alm2map_spin(A1[0], A2[0], M1[0], M2[0], spin) */ __pyx_t_9 = __Pyx_GetItemInt_List(__pyx_v_alms_c, 1, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 171; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_9); if (!(likely(((__pyx_t_9) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_9, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 171; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_14 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 171; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_13 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 171; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_15 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_t_9), __pyx_t_14, __pyx_t_13); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 171; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_v_A2 = __pyx_t_15; /* "healpy/src/_sphtools.pyx":173 * A2 = ndarray2alm(alms_c[1], lmax, mmax) * * alm2map_spin(A1[0], A2[0], M1[0], M2[0], spin) # <<<<<<<<<<<<<< * * del M1, M2, A1, A2 */ __pyx_t_13 = __Pyx_PyInt_As_int(__pyx_v_spin); if (unlikely((__pyx_t_13 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 173; __pyx_clineno = __LINE__; goto __pyx_L1_error;} alm2map_spin((__pyx_v_A1[0]), (__pyx_v_A2[0]), (__pyx_v_M1[0]), (__pyx_v_M2[0]), __pyx_t_13); /* "healpy/src/_sphtools.pyx":175 * alm2map_spin(A1[0], A2[0], M1[0], M2[0], spin) * * del M1, M2, A1, A2 # <<<<<<<<<<<<<< * return maps * */ delete __pyx_v_M1; delete __pyx_v_M2; delete __pyx_v_A1; delete __pyx_v_A2; /* "healpy/src/_sphtools.pyx":176 * * del M1, M2, A1, A2 * return maps # <<<<<<<<<<<<<< * * def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(__pyx_v_maps); __pyx_r = __pyx_v_maps; goto __pyx_L0; /* "healpy/src/_sphtools.pyx":136 * return alms * * def alm2map_spin_healpy(alms, nside, spin, lmax, mmax=None): # <<<<<<<<<<<<<< * """Computes maps from a set of 2 spinned alm * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_2); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_XDECREF(__pyx_t_8); __Pyx_XDECREF(__pyx_t_9); __Pyx_AddTraceback("healpy._sphtools.alm2map_spin_healpy", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF(__pyx_v_alms_c); __Pyx_XDECREF(__pyx_v_npix); __Pyx_XDECREF(__pyx_v_maps); __Pyx_XDECREF(__pyx_v_alm); __Pyx_XDECREF(__pyx_v_mmax); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":178 * return maps * * def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, # <<<<<<<<<<<<<< * datapath = None): * """Computes the alm of a Healpix map. */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_7map2alm(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_9_sphtools_6map2alm[] = "Computes the alm of a Healpix map.\n\n Parameters\n ----------\n m : array-like, shape (Npix,) or (3, Npix)\n The input map or a list of 3 input maps (polariztion).\n lmax : int, scalar, optional\n Maximum l of the power spectrum. Default: 3*nside-1\n mmax : int, scalar, optional\n Maximum m of the alm. Default: lmax\n iter : int, scalar, optional\n Number of iteration (default: 1)\n use_weights: bool, scalar, optional\n If True, use the ring weighting. Default: False.\n \n Returns\n -------\n alm : array or tuple of arrays\n alm or a tuple of 3 alm (almT, almE, almB) if polarized input.\n "; static PyMethodDef __pyx_mdef_6healpy_9_sphtools_7map2alm = {__Pyx_NAMESTR("map2alm"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_7map2alm, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_9_sphtools_6map2alm)}; static PyObject *__pyx_pw_6healpy_9_sphtools_7map2alm(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_m = 0; PyObject *__pyx_v_lmax = 0; PyObject *__pyx_v_mmax = 0; PyObject *__pyx_v_niter = 0; PyObject *__pyx_v_use_weights = 0; PyObject *__pyx_v_datapath = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("map2alm (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_m,&__pyx_n_s_lmax,&__pyx_n_s_mmax,&__pyx_n_s_niter,&__pyx_n_s_use_weights,&__pyx_n_s_datapath,0}; PyObject* values[6] = {0,0,0,0,0,0}; values[1] = ((PyObject *)Py_None); values[2] = ((PyObject *)Py_None); values[3] = ((PyObject *)__pyx_int_3); values[4] = ((PyObject *)Py_False); /* "healpy/src/_sphtools.pyx":179 * * def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, * datapath = None): # <<<<<<<<<<<<<< * """Computes the alm of a Healpix map. * */ values[5] = ((PyObject *)Py_None); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_m)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lmax); if (value) { values[1] = value; kw_args--; } } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mmax); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_niter); if (value) { values[3] = value; kw_args--; } } case 4: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_use_weights); if (value) { values[4] = value; kw_args--; } } case 5: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_datapath); if (value) { values[5] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "map2alm") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_m = values[0]; __pyx_v_lmax = values[1]; __pyx_v_mmax = values[2]; __pyx_v_niter = values[3]; __pyx_v_use_weights = values[4]; __pyx_v_datapath = values[5]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("map2alm", 0, 1, 6, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._sphtools.map2alm", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_9_sphtools_6map2alm(__pyx_self, __pyx_v_m, __pyx_v_lmax, __pyx_v_mmax, __pyx_v_niter, __pyx_v_use_weights, __pyx_v_datapath); /* "healpy/src/_sphtools.pyx":178 * return maps * * def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, # <<<<<<<<<<<<<< * datapath = None): * """Computes the alm of a Healpix map. */ /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_6map2alm(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_m, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax, PyObject *__pyx_v_niter, PyObject *__pyx_v_use_weights, PyObject *__pyx_v_datapath) { PyObject *__pyx_v_info = NULL; int __pyx_v_polarization; PyObject *__pyx_v_mi = NULL; PyObject *__pyx_v_mq = NULL; PyObject *__pyx_v_mu = NULL; PyObject *__pyx_v_mask_mi = NULL; PyObject *__pyx_v_mask_mq = NULL; PyObject *__pyx_v_mask_mu = NULL; int __pyx_v_lmax_; int __pyx_v_mmax_; int __pyx_v_nside; int __pyx_v_npix; Healpix_Map *__pyx_v_MI; Healpix_Map *__pyx_v_MQ; Healpix_Map *__pyx_v_MU; int __pyx_v_n_alm; PyObject *__pyx_v_almI = NULL; PyObject *__pyx_v_almG = NULL; PyObject *__pyx_v_almC = NULL; Alm > *__pyx_v_AI; Alm > *__pyx_v_AG; Alm > *__pyx_v_AC; arr *__pyx_v_w_arr; int __pyx_v_i; char *__pyx_v_c_datapath; PyObject *__pyx_v_weightfile = NULL; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; PyObject *__pyx_t_2 = NULL; PyObject *__pyx_t_3 = NULL; int __pyx_t_4; PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; int __pyx_t_7; int __pyx_t_8; int __pyx_t_9; Healpix_Map *__pyx_t_10; Alm > *__pyx_t_11; char *__pyx_t_12; std::string __pyx_t_13; size_t __pyx_t_14; long __pyx_t_15; int __pyx_t_16; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("map2alm", 0); __Pyx_INCREF(__pyx_v_datapath); /* "healpy/src/_sphtools.pyx":201 * """ * # Check if the input map is polarized or not * info = maptype(m) # <<<<<<<<<<<<<< * if info == 0: * polarization = False */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_maptype); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_INCREF(__pyx_v_m); PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_v_m); __Pyx_GIVEREF(__pyx_v_m); __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_2, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 201; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_info = __pyx_t_3; __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":202 * # Check if the input map is polarized or not * info = maptype(m) * if info == 0: # <<<<<<<<<<<<<< * polarization = False * mi = np.ascontiguousarray(m, dtype=np.float64) */ __pyx_t_3 = PyObject_RichCompare(__pyx_v_info, __pyx_int_0, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 202; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_4 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 202; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":203 * info = maptype(m) * if info == 0: * polarization = False # <<<<<<<<<<<<<< * mi = np.ascontiguousarray(m, dtype=np.float64) * elif info == 1: */ __pyx_v_polarization = 0; /* "healpy/src/_sphtools.pyx":204 * if info == 0: * polarization = False * mi = np.ascontiguousarray(m, dtype=np.float64) # <<<<<<<<<<<<<< * elif info == 1: * polarization = False */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_INCREF(__pyx_v_m); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_v_m); __Pyx_GIVEREF(__pyx_v_m); __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_float64); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_dtype, __pyx_t_6) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_3, __pyx_t_1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 204; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_mi = __pyx_t_6; __pyx_t_6 = 0; goto __pyx_L3; } /* "healpy/src/_sphtools.pyx":205 * polarization = False * mi = np.ascontiguousarray(m, dtype=np.float64) * elif info == 1: # <<<<<<<<<<<<<< * polarization = False * mi = np.ascontiguousarray(m[0], dtype=np.float64) */ __pyx_t_6 = PyObject_RichCompare(__pyx_v_info, __pyx_int_1, Py_EQ); __Pyx_XGOTREF(__pyx_t_6); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_t_6); if (unlikely(__pyx_t_4 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 205; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":206 * mi = np.ascontiguousarray(m, dtype=np.float64) * elif info == 1: * polarization = False # <<<<<<<<<<<<<< * mi = np.ascontiguousarray(m[0], dtype=np.float64) * elif info == 3: */ __pyx_v_polarization = 0; /* "healpy/src/_sphtools.pyx":207 * elif info == 1: * polarization = False * mi = np.ascontiguousarray(m[0], dtype=np.float64) # <<<<<<<<<<<<<< * elif info == 3: * polarization = True */ __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_GetItemInt(__pyx_v_m, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_6 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_6); __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_6); __Pyx_GIVEREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = PyDict_New(); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_float64); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; if (PyDict_SetItem(__pyx_t_6, __pyx_n_s_dtype, __pyx_t_5) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_3, __pyx_t_6); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 207; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_v_mi = __pyx_t_5; __pyx_t_5 = 0; goto __pyx_L3; } /* "healpy/src/_sphtools.pyx":208 * polarization = False * mi = np.ascontiguousarray(m[0], dtype=np.float64) * elif info == 3: # <<<<<<<<<<<<<< * polarization = True * mi = np.ascontiguousarray(m[0], dtype=np.float64) */ __pyx_t_5 = PyObject_RichCompare(__pyx_v_info, __pyx_int_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 208; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_4 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 208; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":209 * mi = np.ascontiguousarray(m[0], dtype=np.float64) * elif info == 3: * polarization = True # <<<<<<<<<<<<<< * mi = np.ascontiguousarray(m[0], dtype=np.float64) * mq = np.ascontiguousarray(m[1], dtype=np.float64) */ __pyx_v_polarization = 1; /* "healpy/src/_sphtools.pyx":210 * elif info == 3: * polarization = True * mi = np.ascontiguousarray(m[0], dtype=np.float64) # <<<<<<<<<<<<<< * mq = np.ascontiguousarray(m[1], dtype=np.float64) * mu = np.ascontiguousarray(m[2], dtype=np.float64) */ __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_GetItemInt(__pyx_v_m, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_5 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_5); __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_5); __Pyx_GIVEREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyDict_New(); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_float64); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; if (PyDict_SetItem(__pyx_t_5, __pyx_n_s_dtype, __pyx_t_2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_3, __pyx_t_5); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 210; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_v_mi = __pyx_t_2; __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":211 * polarization = True * mi = np.ascontiguousarray(m[0], dtype=np.float64) * mq = np.ascontiguousarray(m[1], dtype=np.float64) # <<<<<<<<<<<<<< * mu = np.ascontiguousarray(m[2], dtype=np.float64) * else: */ __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_GetItemInt(__pyx_v_m, 1, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_2 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_2); __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_2); __Pyx_GIVEREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = PyDict_New(); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_float64); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (PyDict_SetItem(__pyx_t_2, __pyx_n_s_dtype, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_3, __pyx_t_2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 211; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_mq = __pyx_t_1; __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":212 * mi = np.ascontiguousarray(m[0], dtype=np.float64) * mq = np.ascontiguousarray(m[1], dtype=np.float64) * mu = np.ascontiguousarray(m[2], dtype=np.float64) # <<<<<<<<<<<<<< * else: * raise ValueError("Wrong input map (must be a valid healpix map " */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_GetItemInt(__pyx_v_m, 2, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_1 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_1); __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_1); __Pyx_GIVEREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_float64); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_dtype, __pyx_t_6) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_3, __pyx_t_1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 212; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_mu = __pyx_t_6; __pyx_t_6 = 0; goto __pyx_L3; } /*else*/ { /* "healpy/src/_sphtools.pyx":214 * mu = np.ascontiguousarray(m[2], dtype=np.float64) * else: * raise ValueError("Wrong input map (must be a valid healpix map " # <<<<<<<<<<<<<< * "or a sequence of 1 or 3 maps)") * */ __pyx_t_6 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__2, NULL); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 214; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_Raise(__pyx_t_6, 0, 0, 0); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 214; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_L3:; /* "healpy/src/_sphtools.pyx":218 * * # create UNSEEN mask for I map * mask_mi = False if count_bad(mi) == 0 else mkmask(mi) # <<<<<<<<<<<<<< * # same for polarization maps if needed * if polarization: */ if (!(likely(((__pyx_v_mi) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mi, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 218; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (((__pyx_f_6healpy_9_sphtools_count_bad(((PyArrayObject *)__pyx_v_mi), 0) == 0) != 0)) { __Pyx_INCREF(Py_False); __pyx_t_6 = Py_False; } else { if (!(likely(((__pyx_v_mi) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mi, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 218; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_1 = __pyx_f_6healpy_9_sphtools_mkmask(((PyArrayObject *)__pyx_v_mi), 0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 218; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_6 = __pyx_t_1; __pyx_t_1 = 0; } __pyx_v_mask_mi = __pyx_t_6; __pyx_t_6 = 0; /* "healpy/src/_sphtools.pyx":220 * mask_mi = False if count_bad(mi) == 0 else mkmask(mi) * # same for polarization maps if needed * if polarization: # <<<<<<<<<<<<<< * mask_mq = False if count_bad(mq) == 0 else mkmask(mq) * mask_mu = False if count_bad(mu) == 0 else mkmask(mu) */ __pyx_t_4 = (__pyx_v_polarization != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":221 * # same for polarization maps if needed * if polarization: * mask_mq = False if count_bad(mq) == 0 else mkmask(mq) # <<<<<<<<<<<<<< * mask_mu = False if count_bad(mu) == 0 else mkmask(mu) * */ if (unlikely(!__pyx_v_mq)) { __Pyx_RaiseUnboundLocalError("mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_mq) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mq, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (((__pyx_f_6healpy_9_sphtools_count_bad(((PyArrayObject *)__pyx_v_mq), 0) == 0) != 0)) { __Pyx_INCREF(Py_False); __pyx_t_6 = Py_False; } else { if (unlikely(!__pyx_v_mq)) { __Pyx_RaiseUnboundLocalError("mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_mq) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mq, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_1 = __pyx_f_6healpy_9_sphtools_mkmask(((PyArrayObject *)__pyx_v_mq), 0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 221; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_6 = __pyx_t_1; __pyx_t_1 = 0; } __pyx_v_mask_mq = __pyx_t_6; __pyx_t_6 = 0; /* "healpy/src/_sphtools.pyx":222 * if polarization: * mask_mq = False if count_bad(mq) == 0 else mkmask(mq) * mask_mu = False if count_bad(mu) == 0 else mkmask(mu) # <<<<<<<<<<<<<< * * # Adjust lmax and mmax */ if (unlikely(!__pyx_v_mu)) { __Pyx_RaiseUnboundLocalError("mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_mu) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mu, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (((__pyx_f_6healpy_9_sphtools_count_bad(((PyArrayObject *)__pyx_v_mu), 0) == 0) != 0)) { __Pyx_INCREF(Py_False); __pyx_t_6 = Py_False; } else { if (unlikely(!__pyx_v_mu)) { __Pyx_RaiseUnboundLocalError("mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_mu) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mu, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_1 = __pyx_f_6healpy_9_sphtools_mkmask(((PyArrayObject *)__pyx_v_mu), 0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 222; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_6 = __pyx_t_1; __pyx_t_1 = 0; } __pyx_v_mask_mu = __pyx_t_6; __pyx_t_6 = 0; goto __pyx_L4; } __pyx_L4:; /* "healpy/src/_sphtools.pyx":226 * # Adjust lmax and mmax * cdef int lmax_, mmax_, nside, npix * npix = mi.size # <<<<<<<<<<<<<< * nside = npix2nside(npix) * if lmax is None: */ __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_v_mi, __pyx_n_s_size); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 226; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = __Pyx_PyInt_As_int(__pyx_t_6); if (unlikely((__pyx_t_7 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 226; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_v_npix = __pyx_t_7; /* "healpy/src/_sphtools.pyx":227 * cdef int lmax_, mmax_, nside, npix * npix = mi.size * nside = npix2nside(npix) # <<<<<<<<<<<<<< * if lmax is None: * lmax_ = 3 * nside - 1 */ __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_npix2nside); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_v_npix); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_1); __Pyx_GIVEREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_6, __pyx_t_3, NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_7 = __Pyx_PyInt_As_int(__pyx_t_1); if (unlikely((__pyx_t_7 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 227; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_nside = __pyx_t_7; /* "healpy/src/_sphtools.pyx":228 * npix = mi.size * nside = npix2nside(npix) * if lmax is None: # <<<<<<<<<<<<<< * lmax_ = 3 * nside - 1 * else: */ __pyx_t_4 = (__pyx_v_lmax == Py_None); __pyx_t_8 = (__pyx_t_4 != 0); if (__pyx_t_8) { /* "healpy/src/_sphtools.pyx":229 * nside = npix2nside(npix) * if lmax is None: * lmax_ = 3 * nside - 1 # <<<<<<<<<<<<<< * else: * lmax_ = lmax */ __pyx_v_lmax_ = ((3 * __pyx_v_nside) - 1); goto __pyx_L5; } /*else*/ { /* "healpy/src/_sphtools.pyx":231 * lmax_ = 3 * nside - 1 * else: * lmax_ = lmax # <<<<<<<<<<<<<< * if mmax is None: * mmax_ = lmax_ */ __pyx_t_7 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_7 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 231; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_lmax_ = __pyx_t_7; } __pyx_L5:; /* "healpy/src/_sphtools.pyx":232 * else: * lmax_ = lmax * if mmax is None: # <<<<<<<<<<<<<< * mmax_ = lmax_ * else: */ __pyx_t_8 = (__pyx_v_mmax == Py_None); __pyx_t_4 = (__pyx_t_8 != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":233 * lmax_ = lmax * if mmax is None: * mmax_ = lmax_ # <<<<<<<<<<<<<< * else: * mmax_ = mmax */ __pyx_v_mmax_ = __pyx_v_lmax_; goto __pyx_L6; } /*else*/ { /* "healpy/src/_sphtools.pyx":235 * mmax_ = lmax_ * else: * mmax_ = mmax # <<<<<<<<<<<<<< * * # Check all maps have same npix */ __pyx_t_7 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_7 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 235; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_mmax_ = __pyx_t_7; } __pyx_L6:; /* "healpy/src/_sphtools.pyx":238 * * # Check all maps have same npix * if polarization: # <<<<<<<<<<<<<< * if mq.size != npix or mu.size != npix: * raise ValueError("Input maps must have same size") */ __pyx_t_4 = (__pyx_v_polarization != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":239 * # Check all maps have same npix * if polarization: * if mq.size != npix or mu.size != npix: # <<<<<<<<<<<<<< * raise ValueError("Input maps must have same size") * */ if (unlikely(!__pyx_v_mq)) { __Pyx_RaiseUnboundLocalError("mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_v_mq, __pyx_n_s_size); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_3 = __Pyx_PyInt_From_int(__pyx_v_npix); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = PyObject_RichCompare(__pyx_t_1, __pyx_t_3, Py_NE); __Pyx_XGOTREF(__pyx_t_6); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_t_6); if (unlikely(__pyx_t_4 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (!__pyx_t_4) { if (unlikely(!__pyx_v_mu)) { __Pyx_RaiseUnboundLocalError("mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_v_mu, __pyx_n_s_size); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_3 = __Pyx_PyInt_From_int(__pyx_v_npix); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_1 = PyObject_RichCompare(__pyx_t_6, __pyx_t_3, Py_NE); __Pyx_XGOTREF(__pyx_t_1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_8 = __Pyx_PyObject_IsTrue(__pyx_t_1); if (unlikely(__pyx_t_8 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 239; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_9 = __pyx_t_8; } else { __pyx_t_9 = __pyx_t_4; } if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":240 * if polarization: * if mq.size != npix or mu.size != npix: * raise ValueError("Input maps must have same size") # <<<<<<<<<<<<<< * * # View the ndarray as a Healpix_Map */ __pyx_t_1 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__3, NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 240; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_Raise(__pyx_t_1, 0, 0, 0); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 240; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } goto __pyx_L7; } __pyx_L7:; /* "healpy/src/_sphtools.pyx":243 * * # View the ndarray as a Healpix_Map * MI = ndarray2map(mi, RING) # <<<<<<<<<<<<<< * if polarization: * MQ = ndarray2map(mq, RING) */ if (!(likely(((__pyx_v_mi) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mi, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 243; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_10 = __pyx_f_7_common_ndarray2map(((PyArrayObject *)__pyx_v_mi), RING); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 243; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_MI = __pyx_t_10; /* "healpy/src/_sphtools.pyx":244 * # View the ndarray as a Healpix_Map * MI = ndarray2map(mi, RING) * if polarization: # <<<<<<<<<<<<<< * MQ = ndarray2map(mq, RING) * MU = ndarray2map(mu, RING) */ __pyx_t_9 = (__pyx_v_polarization != 0); if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":245 * MI = ndarray2map(mi, RING) * if polarization: * MQ = ndarray2map(mq, RING) # <<<<<<<<<<<<<< * MU = ndarray2map(mu, RING) * */ if (unlikely(!__pyx_v_mq)) { __Pyx_RaiseUnboundLocalError("mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 245; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_mq) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mq, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 245; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_10 = __pyx_f_7_common_ndarray2map(((PyArrayObject *)__pyx_v_mq), RING); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 245; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_MQ = __pyx_t_10; /* "healpy/src/_sphtools.pyx":246 * if polarization: * MQ = ndarray2map(mq, RING) * MU = ndarray2map(mu, RING) # <<<<<<<<<<<<<< * * # replace UNSEEN pixels with zeros */ if (unlikely(!__pyx_v_mu)) { __Pyx_RaiseUnboundLocalError("mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 246; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_mu) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_mu, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 246; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_10 = __pyx_f_7_common_ndarray2map(((PyArrayObject *)__pyx_v_mu), RING); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 246; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_MU = __pyx_t_10; goto __pyx_L9; } __pyx_L9:; /* "healpy/src/_sphtools.pyx":249 * * # replace UNSEEN pixels with zeros * if mask_mi is not False: # <<<<<<<<<<<<<< * mi[mask_mi] = 0.0 * if polarization: */ __pyx_t_9 = (__pyx_v_mask_mi != Py_False); __pyx_t_4 = (__pyx_t_9 != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":250 * # replace UNSEEN pixels with zeros * if mask_mi is not False: * mi[mask_mi] = 0.0 # <<<<<<<<<<<<<< * if polarization: * if mask_mq is not False: */ if (unlikely(PyObject_SetItem(__pyx_v_mi, __pyx_v_mask_mi, __pyx_float_0_0) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 250; __pyx_clineno = __LINE__; goto __pyx_L1_error;} goto __pyx_L10; } __pyx_L10:; /* "healpy/src/_sphtools.pyx":251 * if mask_mi is not False: * mi[mask_mi] = 0.0 * if polarization: # <<<<<<<<<<<<<< * if mask_mq is not False: * mq[mask_mq] = 0.0 */ __pyx_t_4 = (__pyx_v_polarization != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":252 * mi[mask_mi] = 0.0 * if polarization: * if mask_mq is not False: # <<<<<<<<<<<<<< * mq[mask_mq] = 0.0 * if mask_mu is not False: */ if (unlikely(!__pyx_v_mask_mq)) { __Pyx_RaiseUnboundLocalError("mask_mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 252; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_4 = (__pyx_v_mask_mq != Py_False); __pyx_t_9 = (__pyx_t_4 != 0); if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":253 * if polarization: * if mask_mq is not False: * mq[mask_mq] = 0.0 # <<<<<<<<<<<<<< * if mask_mu is not False: * mu[mask_mu] = 0.0 */ if (unlikely(!__pyx_v_mq)) { __Pyx_RaiseUnboundLocalError("mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 253; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(!__pyx_v_mask_mq)) { __Pyx_RaiseUnboundLocalError("mask_mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 253; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(PyObject_SetItem(__pyx_v_mq, __pyx_v_mask_mq, __pyx_float_0_0) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 253; __pyx_clineno = __LINE__; goto __pyx_L1_error;} goto __pyx_L12; } __pyx_L12:; /* "healpy/src/_sphtools.pyx":254 * if mask_mq is not False: * mq[mask_mq] = 0.0 * if mask_mu is not False: # <<<<<<<<<<<<<< * mu[mask_mu] = 0.0 * */ if (unlikely(!__pyx_v_mask_mu)) { __Pyx_RaiseUnboundLocalError("mask_mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 254; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_9 = (__pyx_v_mask_mu != Py_False); __pyx_t_4 = (__pyx_t_9 != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":255 * mq[mask_mq] = 0.0 * if mask_mu is not False: * mu[mask_mu] = 0.0 # <<<<<<<<<<<<<< * * */ if (unlikely(!__pyx_v_mu)) { __Pyx_RaiseUnboundLocalError("mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 255; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(!__pyx_v_mask_mu)) { __Pyx_RaiseUnboundLocalError("mask_mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 255; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(PyObject_SetItem(__pyx_v_mu, __pyx_v_mask_mu, __pyx_float_0_0) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 255; __pyx_clineno = __LINE__; goto __pyx_L1_error;} goto __pyx_L13; } __pyx_L13:; goto __pyx_L11; } __pyx_L11:; /* "healpy/src/_sphtools.pyx":259 * * # Create an ndarray object that will contain the alm for output (to be returned) * n_alm = alm_getn(lmax_, mmax_) # <<<<<<<<<<<<<< * almI = np.empty(n_alm, dtype=np.complex128) * if polarization: */ __pyx_v_n_alm = __pyx_f_6healpy_9_sphtools_alm_getn(__pyx_v_lmax_, __pyx_v_mmax_); /* "healpy/src/_sphtools.pyx":260 * # Create an ndarray object that will contain the alm for output (to be returned) * n_alm = alm_getn(lmax_, mmax_) * almI = np.empty(n_alm, dtype=np.complex128) # <<<<<<<<<<<<<< * if polarization: * almG = np.empty(n_alm, dtype=np.complex128) */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_empty); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_v_n_alm); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_1); __Pyx_GIVEREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_complex128); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_dtype, __pyx_t_5) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_6, __pyx_t_1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 260; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_almI = __pyx_t_5; __pyx_t_5 = 0; /* "healpy/src/_sphtools.pyx":261 * n_alm = alm_getn(lmax_, mmax_) * almI = np.empty(n_alm, dtype=np.complex128) * if polarization: # <<<<<<<<<<<<<< * almG = np.empty(n_alm, dtype=np.complex128) * almC = np.empty(n_alm, dtype=np.complex128) */ __pyx_t_4 = (__pyx_v_polarization != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":262 * almI = np.empty(n_alm, dtype=np.complex128) * if polarization: * almG = np.empty(n_alm, dtype=np.complex128) # <<<<<<<<<<<<<< * almC = np.empty(n_alm, dtype=np.complex128) * */ __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_1 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_empty); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyInt_From_int(__pyx_v_n_alm); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __Pyx_GIVEREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyDict_New(); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_complex128); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (PyDict_SetItem(__pyx_t_5, __pyx_n_s_dtype, __pyx_t_2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_1, __pyx_t_6, __pyx_t_5); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 262; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_v_almG = __pyx_t_2; __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":263 * if polarization: * almG = np.empty(n_alm, dtype=np.complex128) * almC = np.empty(n_alm, dtype=np.complex128) # <<<<<<<<<<<<<< * * # View the ndarray as an Alm */ __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_empty); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_PyInt_From_int(__pyx_v_n_alm); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_2); __Pyx_GIVEREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = PyDict_New(); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_complex128); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; if (PyDict_SetItem(__pyx_t_2, __pyx_n_s_dtype, __pyx_t_3) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_6, __pyx_t_2); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 263; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_almC = __pyx_t_3; __pyx_t_3 = 0; goto __pyx_L14; } __pyx_L14:; /* "healpy/src/_sphtools.pyx":266 * * # View the ndarray as an Alm * AI = ndarray2alm(almI, lmax_, mmax_) # <<<<<<<<<<<<<< * if polarization: * AG = ndarray2alm(almG, lmax_, mmax_) */ if (!(likely(((__pyx_v_almI) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_almI, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 266; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_11 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_v_almI), __pyx_v_lmax_, __pyx_v_mmax_); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 266; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_AI = __pyx_t_11; /* "healpy/src/_sphtools.pyx":267 * # View the ndarray as an Alm * AI = ndarray2alm(almI, lmax_, mmax_) * if polarization: # <<<<<<<<<<<<<< * AG = ndarray2alm(almG, lmax_, mmax_) * AC = ndarray2alm(almC, lmax_, mmax_) */ __pyx_t_4 = (__pyx_v_polarization != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":268 * AI = ndarray2alm(almI, lmax_, mmax_) * if polarization: * AG = ndarray2alm(almG, lmax_, mmax_) # <<<<<<<<<<<<<< * AC = ndarray2alm(almC, lmax_, mmax_) * */ if (unlikely(!__pyx_v_almG)) { __Pyx_RaiseUnboundLocalError("almG"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 268; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_almG) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_almG, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 268; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_11 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_v_almG), __pyx_v_lmax_, __pyx_v_mmax_); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 268; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_AG = __pyx_t_11; /* "healpy/src/_sphtools.pyx":269 * if polarization: * AG = ndarray2alm(almG, lmax_, mmax_) * AC = ndarray2alm(almC, lmax_, mmax_) # <<<<<<<<<<<<<< * * # ring weights */ if (unlikely(!__pyx_v_almC)) { __Pyx_RaiseUnboundLocalError("almC"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 269; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_v_almC) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_almC, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 269; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_11 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_v_almC), __pyx_v_lmax_, __pyx_v_mmax_); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 269; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_AC = __pyx_t_11; goto __pyx_L15; } __pyx_L15:; /* "healpy/src/_sphtools.pyx":272 * * # ring weights * cdef arr[double] * w_arr = new arr[double]() # <<<<<<<<<<<<<< * cdef int i * cdef char *c_datapath */ __pyx_v_w_arr = new arr(); /* "healpy/src/_sphtools.pyx":275 * cdef int i * cdef char *c_datapath * if use_weights: # <<<<<<<<<<<<<< * if datapath is None: * datapath = get_datapath() */ __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_v_use_weights); if (unlikely(__pyx_t_4 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 275; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":276 * cdef char *c_datapath * if use_weights: * if datapath is None: # <<<<<<<<<<<<<< * datapath = get_datapath() * c_datapath = datapath */ __pyx_t_4 = (__pyx_v_datapath == Py_None); __pyx_t_9 = (__pyx_t_4 != 0); if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":277 * if use_weights: * if datapath is None: * datapath = get_datapath() # <<<<<<<<<<<<<< * c_datapath = datapath * weightfile = 'weight_ring_n%05d.fits' % (nside) */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_get_datapath); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 277; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_empty_tuple, NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 277; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF_SET(__pyx_v_datapath, __pyx_t_2); __pyx_t_2 = 0; goto __pyx_L17; } __pyx_L17:; /* "healpy/src/_sphtools.pyx":278 * if datapath is None: * datapath = get_datapath() * c_datapath = datapath # <<<<<<<<<<<<<< * weightfile = 'weight_ring_n%05d.fits' % (nside) * if not os.path.isfile(os.path.join(datapath, weightfile)): */ __pyx_t_12 = __Pyx_PyObject_AsString(__pyx_v_datapath); if (unlikely((!__pyx_t_12) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 278; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_c_datapath = __pyx_t_12; /* "healpy/src/_sphtools.pyx":279 * datapath = get_datapath() * c_datapath = datapath * weightfile = 'weight_ring_n%05d.fits' % (nside) # <<<<<<<<<<<<<< * if not os.path.isfile(os.path.join(datapath, weightfile)): * raise IOError('Weight file not found in %s' % (datapath)) */ __pyx_t_2 = __Pyx_PyInt_From_int(__pyx_v_nside); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_3 = __Pyx_PyString_Format(__pyx_kp_s_weight_ring_n_05d_fits, __pyx_t_2); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 279; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_weightfile = __pyx_t_3; __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":280 * c_datapath = datapath * weightfile = 'weight_ring_n%05d.fits' % (nside) * if not os.path.isfile(os.path.join(datapath, weightfile)): # <<<<<<<<<<<<<< * raise IOError('Weight file not found in %s' % (datapath)) * read_weight_ring(string(c_datapath), nside, w_arr[0]) */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_os); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_path); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_isfile); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_os); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_path); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_join); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = PyTuple_New(2); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_INCREF(__pyx_v_datapath); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_v_datapath); __Pyx_GIVEREF(__pyx_v_datapath); __Pyx_INCREF(__pyx_v_weightfile); PyTuple_SET_ITEM(__pyx_t_6, 1, __pyx_v_weightfile); __Pyx_GIVEREF(__pyx_v_weightfile); __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_6, NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __Pyx_GIVEREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_6, NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_9 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_9 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 280; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_4 = ((!__pyx_t_9) != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":281 * weightfile = 'weight_ring_n%05d.fits' % (nside) * if not os.path.isfile(os.path.join(datapath, weightfile)): * raise IOError('Weight file not found in %s' % (datapath)) # <<<<<<<<<<<<<< * read_weight_ring(string(c_datapath), nside, w_arr[0]) * for i in range(w_arr.size()): */ __pyx_t_5 = __Pyx_PyString_Format(__pyx_kp_s_Weight_file_not_found_in_s, __pyx_v_datapath); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __Pyx_GIVEREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyObject_Call(__pyx_builtin_IOError, __pyx_t_6, NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_Raise(__pyx_t_5, 0, 0, 0); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":282 * if not os.path.isfile(os.path.join(datapath, weightfile)): * raise IOError('Weight file not found in %s' % (datapath)) * read_weight_ring(string(c_datapath), nside, w_arr[0]) # <<<<<<<<<<<<<< * for i in range(w_arr.size()): * w_arr[0][i] += 1 */ try { __pyx_t_13 = std::string(__pyx_v_c_datapath); } catch(...) { __Pyx_CppExn2PyErr(); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 282; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } read_weight_ring(__pyx_t_13, __pyx_v_nside, (__pyx_v_w_arr[0])); /* "healpy/src/_sphtools.pyx":283 * raise IOError('Weight file not found in %s' % (datapath)) * read_weight_ring(string(c_datapath), nside, w_arr[0]) * for i in range(w_arr.size()): # <<<<<<<<<<<<<< * w_arr[0][i] += 1 * else: */ __pyx_t_14 = __pyx_v_w_arr->size(); for (__pyx_t_7 = 0; __pyx_t_7 < __pyx_t_14; __pyx_t_7+=1) { __pyx_v_i = __pyx_t_7; /* "healpy/src/_sphtools.pyx":284 * read_weight_ring(string(c_datapath), nside, w_arr[0]) * for i in range(w_arr.size()): * w_arr[0][i] += 1 # <<<<<<<<<<<<<< * else: * w_arr.allocAndFill(2 * nside, 1.) */ __pyx_t_15 = 0; __pyx_t_16 = __pyx_v_i; ((__pyx_v_w_arr[__pyx_t_15])[__pyx_t_16]) = (((__pyx_v_w_arr[__pyx_t_15])[__pyx_t_16]) + 1.0); } goto __pyx_L16; } /*else*/ { /* "healpy/src/_sphtools.pyx":286 * w_arr[0][i] += 1 * else: * w_arr.allocAndFill(2 * nside, 1.) # <<<<<<<<<<<<<< * * if polarization: */ __pyx_v_w_arr->allocAndFill((2 * __pyx_v_nside), 1.); } __pyx_L16:; /* "healpy/src/_sphtools.pyx":288 * w_arr.allocAndFill(2 * nside, 1.) * * if polarization: # <<<<<<<<<<<<<< * map2alm_pol_iter(MI[0], MQ[0], MU[0], AI[0], AG[0], AC[0], niter, w_arr[0]) * else: */ __pyx_t_4 = (__pyx_v_polarization != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":289 * * if polarization: * map2alm_pol_iter(MI[0], MQ[0], MU[0], AI[0], AG[0], AC[0], niter, w_arr[0]) # <<<<<<<<<<<<<< * else: * map2alm_iter(MI[0], AI[0], niter, w_arr[0]) */ __pyx_t_7 = __Pyx_PyInt_As_int(__pyx_v_niter); if (unlikely((__pyx_t_7 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 289; __pyx_clineno = __LINE__; goto __pyx_L1_error;} map2alm_pol_iter((__pyx_v_MI[0]), (__pyx_v_MQ[0]), (__pyx_v_MU[0]), (__pyx_v_AI[0]), (__pyx_v_AG[0]), (__pyx_v_AC[0]), __pyx_t_7, (__pyx_v_w_arr[0])); goto __pyx_L21; } /*else*/ { /* "healpy/src/_sphtools.pyx":291 * map2alm_pol_iter(MI[0], MQ[0], MU[0], AI[0], AG[0], AC[0], niter, w_arr[0]) * else: * map2alm_iter(MI[0], AI[0], niter, w_arr[0]) # <<<<<<<<<<<<<< * * # restore input map with UNSEEN pixels */ __pyx_t_7 = __Pyx_PyInt_As_int(__pyx_v_niter); if (unlikely((__pyx_t_7 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 291; __pyx_clineno = __LINE__; goto __pyx_L1_error;} map2alm_iter((__pyx_v_MI[0]), (__pyx_v_AI[0]), __pyx_t_7, (__pyx_v_w_arr[0])); } __pyx_L21:; /* "healpy/src/_sphtools.pyx":294 * * # restore input map with UNSEEN pixels * if mask_mi is not False: # <<<<<<<<<<<<<< * mi[mask_mi] = UNSEEN * if polarization: */ __pyx_t_4 = (__pyx_v_mask_mi != Py_False); __pyx_t_9 = (__pyx_t_4 != 0); if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":295 * # restore input map with UNSEEN pixels * if mask_mi is not False: * mi[mask_mi] = UNSEEN # <<<<<<<<<<<<<< * if polarization: * if mask_mq is not False: */ __pyx_t_5 = PyFloat_FromDouble(__pyx_v_6healpy_9_sphtools_UNSEEN); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 295; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); if (unlikely(PyObject_SetItem(__pyx_v_mi, __pyx_v_mask_mi, __pyx_t_5) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 295; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; goto __pyx_L22; } __pyx_L22:; /* "healpy/src/_sphtools.pyx":296 * if mask_mi is not False: * mi[mask_mi] = UNSEEN * if polarization: # <<<<<<<<<<<<<< * if mask_mq is not False: * mq[mask_mq] = UNSEEN */ __pyx_t_9 = (__pyx_v_polarization != 0); if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":297 * mi[mask_mi] = UNSEEN * if polarization: * if mask_mq is not False: # <<<<<<<<<<<<<< * mq[mask_mq] = UNSEEN * if mask_mu is not False: */ if (unlikely(!__pyx_v_mask_mq)) { __Pyx_RaiseUnboundLocalError("mask_mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 297; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_9 = (__pyx_v_mask_mq != Py_False); __pyx_t_4 = (__pyx_t_9 != 0); if (__pyx_t_4) { /* "healpy/src/_sphtools.pyx":298 * if polarization: * if mask_mq is not False: * mq[mask_mq] = UNSEEN # <<<<<<<<<<<<<< * if mask_mu is not False: * mu[mask_mu] = UNSEEN */ __pyx_t_5 = PyFloat_FromDouble(__pyx_v_6healpy_9_sphtools_UNSEEN); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 298; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); if (unlikely(!__pyx_v_mq)) { __Pyx_RaiseUnboundLocalError("mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 298; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(!__pyx_v_mask_mq)) { __Pyx_RaiseUnboundLocalError("mask_mq"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 298; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(PyObject_SetItem(__pyx_v_mq, __pyx_v_mask_mq, __pyx_t_5) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 298; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; goto __pyx_L24; } __pyx_L24:; /* "healpy/src/_sphtools.pyx":299 * if mask_mq is not False: * mq[mask_mq] = UNSEEN * if mask_mu is not False: # <<<<<<<<<<<<<< * mu[mask_mu] = UNSEEN * */ if (unlikely(!__pyx_v_mask_mu)) { __Pyx_RaiseUnboundLocalError("mask_mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 299; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_4 = (__pyx_v_mask_mu != Py_False); __pyx_t_9 = (__pyx_t_4 != 0); if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":300 * mq[mask_mq] = UNSEEN * if mask_mu is not False: * mu[mask_mu] = UNSEEN # <<<<<<<<<<<<<< * * del w_arr */ __pyx_t_5 = PyFloat_FromDouble(__pyx_v_6healpy_9_sphtools_UNSEEN); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 300; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); if (unlikely(!__pyx_v_mu)) { __Pyx_RaiseUnboundLocalError("mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 300; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(!__pyx_v_mask_mu)) { __Pyx_RaiseUnboundLocalError("mask_mu"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 300; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(PyObject_SetItem(__pyx_v_mu, __pyx_v_mask_mu, __pyx_t_5) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 300; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; goto __pyx_L25; } __pyx_L25:; goto __pyx_L23; } __pyx_L23:; /* "healpy/src/_sphtools.pyx":302 * mu[mask_mu] = UNSEEN * * del w_arr # <<<<<<<<<<<<<< * if polarization: * del MI, MQ, MU, AI, AG, AC */ delete __pyx_v_w_arr; /* "healpy/src/_sphtools.pyx":303 * * del w_arr * if polarization: # <<<<<<<<<<<<<< * del MI, MQ, MU, AI, AG, AC * return almI, almG, almC */ __pyx_t_9 = (__pyx_v_polarization != 0); if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":304 * del w_arr * if polarization: * del MI, MQ, MU, AI, AG, AC # <<<<<<<<<<<<<< * return almI, almG, almC * else: */ delete __pyx_v_MI; delete __pyx_v_MQ; delete __pyx_v_MU; delete __pyx_v_AI; delete __pyx_v_AG; delete __pyx_v_AC; /* "healpy/src/_sphtools.pyx":305 * if polarization: * del MI, MQ, MU, AI, AG, AC * return almI, almG, almC # <<<<<<<<<<<<<< * else: * del MI, AI */ __Pyx_XDECREF(__pyx_r); if (unlikely(!__pyx_v_almG)) { __Pyx_RaiseUnboundLocalError("almG"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 305; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (unlikely(!__pyx_v_almC)) { __Pyx_RaiseUnboundLocalError("almC"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 305; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_5 = PyTuple_New(3); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 305; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_INCREF(__pyx_v_almI); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_v_almI); __Pyx_GIVEREF(__pyx_v_almI); __Pyx_INCREF(__pyx_v_almG); PyTuple_SET_ITEM(__pyx_t_5, 1, __pyx_v_almG); __Pyx_GIVEREF(__pyx_v_almG); __Pyx_INCREF(__pyx_v_almC); PyTuple_SET_ITEM(__pyx_t_5, 2, __pyx_v_almC); __Pyx_GIVEREF(__pyx_v_almC); __pyx_r = __pyx_t_5; __pyx_t_5 = 0; goto __pyx_L0; } /*else*/ { /* "healpy/src/_sphtools.pyx":307 * return almI, almG, almC * else: * del MI, AI # <<<<<<<<<<<<<< * return almI * */ delete __pyx_v_MI; delete __pyx_v_AI; /* "healpy/src/_sphtools.pyx":308 * else: * del MI, AI * return almI # <<<<<<<<<<<<<< * * */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(__pyx_v_almI); __pyx_r = __pyx_v_almI; goto __pyx_L0; } /* "healpy/src/_sphtools.pyx":178 * return maps * * def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, # <<<<<<<<<<<<<< * datapath = None): * """Computes the alm of a Healpix map. */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_2); __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_AddTraceback("healpy._sphtools.map2alm", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF(__pyx_v_info); __Pyx_XDECREF(__pyx_v_mi); __Pyx_XDECREF(__pyx_v_mq); __Pyx_XDECREF(__pyx_v_mu); __Pyx_XDECREF(__pyx_v_mask_mi); __Pyx_XDECREF(__pyx_v_mask_mq); __Pyx_XDECREF(__pyx_v_mask_mu); __Pyx_XDECREF(__pyx_v_almI); __Pyx_XDECREF(__pyx_v_almG); __Pyx_XDECREF(__pyx_v_almC); __Pyx_XDECREF(__pyx_v_weightfile); __Pyx_XDECREF(__pyx_v_datapath); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":311 * * * def alm2cl(alms, alms2 = None, lmax = None, mmax = None, lmax_out = None): # <<<<<<<<<<<<<< * """Computes (cross-)spectra from alm(s). If alm2 is given, cross-spectra between * alm and alm2 are computed. If alm (and alm2 if provided) contains n alm, */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_9alm2cl(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_9_sphtools_8alm2cl[] = "Computes (cross-)spectra from alm(s). If alm2 is given, cross-spectra between\n alm and alm2 are computed. If alm (and alm2 if provided) contains n alm,\n then n(n+1)/2 auto and cross-spectra are returned.\n\n Parameters\n ----------\n alms : complex, array or sequence of arrays\n The alm from which to compute the power spectrum. If n>=2 arrays are given,\n computes both auto- and cross-spectra.\n alms2 : complex, array or sequence of 3 arrays, optional\n If provided, computes cross-spectra between alm and alm2.\n Default: alm2=alm, so auto-spectra are computed.\n lmax : None or int, optional\n The maximum l of the input alm. Default: computed from size of alm\n and mmax_in\n mmax : None or int, optional\n The maximum m of the input alm. Default: assume mmax_in = lmax_in\n lmax_out : None or int, optional\n The maximum l of the returned spectra. By default: the lmax of the given\n alm(s).\n\n Returns\n -------\n cl : array or tuple of n(n+1)/2 arrays\n the spectrum <*alm* x *alm2*> if *alm* (and *alm2*) is one alm, or \n the auto- and cross-spectra <*alm*[i] x *alm2*[j]> if alm (and alm2)\n contains more than one spectra.\n If more than one spectrum is returned, they are ordered by diagonal.\n For example, if *alm* is almT, almE, almB, then the returned spectra are:\n TT, EE, BB, TE, EB, TB.\n "; static PyMethodDef __pyx_mdef_6healpy_9_sphtools_9alm2cl = {__Pyx_NAMESTR("alm2cl"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_9alm2cl, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_9_sphtools_8alm2cl)}; static PyObject *__pyx_pw_6healpy_9_sphtools_9alm2cl(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_alms = 0; PyObject *__pyx_v_alms2 = 0; PyObject *__pyx_v_lmax = 0; PyObject *__pyx_v_mmax = 0; PyObject *__pyx_v_lmax_out = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("alm2cl (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_alms,&__pyx_n_s_alms2,&__pyx_n_s_lmax,&__pyx_n_s_mmax,&__pyx_n_s_lmax_out,0}; PyObject* values[5] = {0,0,0,0,0}; values[1] = ((PyObject *)Py_None); values[2] = ((PyObject *)Py_None); values[3] = ((PyObject *)Py_None); values[4] = ((PyObject *)Py_None); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_alms)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_alms2); if (value) { values[1] = value; kw_args--; } } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lmax); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mmax); if (value) { values[3] = value; kw_args--; } } case 4: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lmax_out); if (value) { values[4] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "alm2cl") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 311; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_alms = values[0]; __pyx_v_alms2 = values[1]; __pyx_v_lmax = values[2]; __pyx_v_mmax = values[3]; __pyx_v_lmax_out = values[4]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("alm2cl", 0, 1, 5, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 311; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._sphtools.alm2cl", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_9_sphtools_8alm2cl(__pyx_self, __pyx_v_alms, __pyx_v_alms2, __pyx_v_lmax, __pyx_v_mmax, __pyx_v_lmax_out); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_8alm2cl(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alms, PyObject *__pyx_v_alms2, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax, PyObject *__pyx_v_lmax_out) { int __pyx_v_Nspec; int __pyx_v_Nspec2; int __pyx_v_alms_lonely; int __pyx_v_almsize; int __pyx_v_i; int __pyx_v_j; int __pyx_v_l; int __pyx_v_m; int __pyx_v_limit; int __pyx_v_lmax_; CYTHON_UNUSED int __pyx_v_mmax_; CYTHON_UNUSED int __pyx_v_lmax_out_; PyArrayObject *__pyx_v_powspec_ = 0; PyArrayObject *__pyx_v_alm1_ = 0; PyArrayObject *__pyx_v_alm2_ = 0; PyObject *__pyx_v_spectra = NULL; PyObject *__pyx_v_n = NULL; __Pyx_LocalBuf_ND __pyx_pybuffernd_alm1_; __Pyx_Buffer __pyx_pybuffer_alm1_; __Pyx_LocalBuf_ND __pyx_pybuffernd_alm2_; __Pyx_Buffer __pyx_pybuffer_alm2_; __Pyx_LocalBuf_ND __pyx_pybuffernd_powspec_; __Pyx_Buffer __pyx_pybuffer_powspec_; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; Py_ssize_t __pyx_t_4; PyObject *__pyx_t_5 = NULL; int __pyx_t_6; int __pyx_t_7; PyObject *__pyx_t_8 = NULL; int __pyx_t_9; PyObject *__pyx_t_10 = NULL; PyObject *(*__pyx_t_11)(PyObject *); PyObject *(*__pyx_t_12)(PyObject *); long __pyx_t_13; PyArrayObject *__pyx_t_14 = NULL; PyObject *__pyx_t_15 = NULL; PyObject *__pyx_t_16 = NULL; PyObject *__pyx_t_17 = NULL; PyArrayObject *__pyx_t_18 = NULL; PyArrayObject *__pyx_t_19 = NULL; long __pyx_t_20; int __pyx_t_21; int __pyx_t_22; int __pyx_t_23; int __pyx_t_24; int __pyx_t_25; long __pyx_t_26; int __pyx_t_27; int __pyx_t_28; int __pyx_t_29; int __pyx_t_30; int __pyx_t_31; int __pyx_t_32; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("alm2cl", 0); __Pyx_INCREF(__pyx_v_alms); __Pyx_INCREF(__pyx_v_alms2); __Pyx_INCREF(__pyx_v_lmax); __Pyx_INCREF(__pyx_v_mmax); __Pyx_INCREF(__pyx_v_lmax_out); __pyx_pybuffer_powspec_.pybuffer.buf = NULL; __pyx_pybuffer_powspec_.refcount = 0; __pyx_pybuffernd_powspec_.data = NULL; __pyx_pybuffernd_powspec_.rcbuffer = &__pyx_pybuffer_powspec_; __pyx_pybuffer_alm1_.pybuffer.buf = NULL; __pyx_pybuffer_alm1_.refcount = 0; __pyx_pybuffernd_alm1_.data = NULL; __pyx_pybuffernd_alm1_.rcbuffer = &__pyx_pybuffer_alm1_; __pyx_pybuffer_alm2_.pybuffer.buf = NULL; __pyx_pybuffer_alm2_.refcount = 0; __pyx_pybuffernd_alm2_.data = NULL; __pyx_pybuffernd_alm2_.rcbuffer = &__pyx_pybuffer_alm2_; /* "healpy/src/_sphtools.pyx":347 * # * cdef int Nspec, Nspec2 * if not hasattr(alms, '__len__'): # <<<<<<<<<<<<<< * raise ValueError('alms must be an array or a sequence of arrays') * if not hasattr(alms[0], '__len__'): */ __pyx_t_1 = PyObject_HasAttr(__pyx_v_alms, __pyx_n_s_len); if (unlikely(__pyx_t_1 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 347; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((!(__pyx_t_1 != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":348 * cdef int Nspec, Nspec2 * if not hasattr(alms, '__len__'): * raise ValueError('alms must be an array or a sequence of arrays') # <<<<<<<<<<<<<< * if not hasattr(alms[0], '__len__'): * alms_lonely = True */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__4, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 348; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 348; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":349 * if not hasattr(alms, '__len__'): * raise ValueError('alms must be an array or a sequence of arrays') * if not hasattr(alms[0], '__len__'): # <<<<<<<<<<<<<< * alms_lonely = True * alms = [alms] */ __pyx_t_3 = __Pyx_GetItemInt(__pyx_v_alms, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 349; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); __pyx_t_2 = PyObject_HasAttr(__pyx_t_3, __pyx_n_s_len); if (unlikely(__pyx_t_2 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 349; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_1 = ((!(__pyx_t_2 != 0)) != 0); if (__pyx_t_1) { /* "healpy/src/_sphtools.pyx":350 * raise ValueError('alms must be an array or a sequence of arrays') * if not hasattr(alms[0], '__len__'): * alms_lonely = True # <<<<<<<<<<<<<< * alms = [alms] * else: */ __pyx_v_alms_lonely = 1; /* "healpy/src/_sphtools.pyx":351 * if not hasattr(alms[0], '__len__'): * alms_lonely = True * alms = [alms] # <<<<<<<<<<<<<< * else: * alms_lonely = False */ __pyx_t_3 = PyList_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 351; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_INCREF(__pyx_v_alms); PyList_SET_ITEM(__pyx_t_3, 0, __pyx_v_alms); __Pyx_GIVEREF(__pyx_v_alms); __Pyx_DECREF_SET(__pyx_v_alms, __pyx_t_3); __pyx_t_3 = 0; goto __pyx_L4; } /*else*/ { /* "healpy/src/_sphtools.pyx":353 * alms = [alms] * else: * alms_lonely = False # <<<<<<<<<<<<<< * * Nspec = len(alms) */ __pyx_v_alms_lonely = 0; } __pyx_L4:; /* "healpy/src/_sphtools.pyx":355 * alms_lonely = False * * Nspec = len(alms) # <<<<<<<<<<<<<< * * if alms2 is None: */ __pyx_t_4 = PyObject_Length(__pyx_v_alms); if (unlikely(__pyx_t_4 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 355; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_Nspec = __pyx_t_4; /* "healpy/src/_sphtools.pyx":357 * Nspec = len(alms) * * if alms2 is None: # <<<<<<<<<<<<<< * alms2 = alms * */ __pyx_t_1 = (__pyx_v_alms2 == Py_None); __pyx_t_2 = (__pyx_t_1 != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":358 * * if alms2 is None: * alms2 = alms # <<<<<<<<<<<<<< * * if not hasattr(alms2, '__len__'): */ __Pyx_INCREF(__pyx_v_alms); __Pyx_DECREF_SET(__pyx_v_alms2, __pyx_v_alms); goto __pyx_L5; } __pyx_L5:; /* "healpy/src/_sphtools.pyx":360 * alms2 = alms * * if not hasattr(alms2, '__len__'): # <<<<<<<<<<<<<< * raise ValueError('alms2 must be an array or a sequence of arrays') * if not hasattr(alms2[0], '__len__'): */ __pyx_t_2 = PyObject_HasAttr(__pyx_v_alms2, __pyx_n_s_len); if (unlikely(__pyx_t_2 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 360; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_1 = ((!(__pyx_t_2 != 0)) != 0); if (__pyx_t_1) { /* "healpy/src/_sphtools.pyx":361 * * if not hasattr(alms2, '__len__'): * raise ValueError('alms2 must be an array or a sequence of arrays') # <<<<<<<<<<<<<< * if not hasattr(alms2[0], '__len__'): * alms2 = [alms2] */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__5, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 361; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 361; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":362 * if not hasattr(alms2, '__len__'): * raise ValueError('alms2 must be an array or a sequence of arrays') * if not hasattr(alms2[0], '__len__'): # <<<<<<<<<<<<<< * alms2 = [alms2] * Nspec2 = len(alms2) */ __pyx_t_3 = __Pyx_GetItemInt(__pyx_v_alms2, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 362; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); __pyx_t_1 = PyObject_HasAttr(__pyx_t_3, __pyx_n_s_len); if (unlikely(__pyx_t_1 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 362; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_2 = ((!(__pyx_t_1 != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":363 * raise ValueError('alms2 must be an array or a sequence of arrays') * if not hasattr(alms2[0], '__len__'): * alms2 = [alms2] # <<<<<<<<<<<<<< * Nspec2 = len(alms2) * */ __pyx_t_3 = PyList_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 363; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_INCREF(__pyx_v_alms2); PyList_SET_ITEM(__pyx_t_3, 0, __pyx_v_alms2); __Pyx_GIVEREF(__pyx_v_alms2); __Pyx_DECREF_SET(__pyx_v_alms2, __pyx_t_3); __pyx_t_3 = 0; goto __pyx_L7; } __pyx_L7:; /* "healpy/src/_sphtools.pyx":364 * if not hasattr(alms2[0], '__len__'): * alms2 = [alms2] * Nspec2 = len(alms2) # <<<<<<<<<<<<<< * * if Nspec != Nspec2: */ __pyx_t_4 = PyObject_Length(__pyx_v_alms2); if (unlikely(__pyx_t_4 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 364; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_Nspec2 = __pyx_t_4; /* "healpy/src/_sphtools.pyx":366 * Nspec2 = len(alms2) * * if Nspec != Nspec2: # <<<<<<<<<<<<<< * raise ValueError('alms and alms2 must have same number of spectra') * */ __pyx_t_2 = ((__pyx_v_Nspec != __pyx_v_Nspec2) != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":367 * * if Nspec != Nspec2: * raise ValueError('alms and alms2 must have same number of spectra') # <<<<<<<<<<<<<< * * ############################################## */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__6, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 367; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 367; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":373 * # * cdef int almsize * almsize = alms[0].size # <<<<<<<<<<<<<< * for i in xrange(Nspec): * if alms[i].size != almsize or alms2[i].size != almsize: */ __pyx_t_3 = __Pyx_GetItemInt(__pyx_v_alms, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 373; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_size); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 373; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyInt_As_int(__pyx_t_5); if (unlikely((__pyx_t_6 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 373; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_v_almsize = __pyx_t_6; /* "healpy/src/_sphtools.pyx":374 * cdef int almsize * almsize = alms[0].size * for i in xrange(Nspec): # <<<<<<<<<<<<<< * if alms[i].size != almsize or alms2[i].size != almsize: * raise ValueError('all alms must have same size') */ __pyx_t_6 = __pyx_v_Nspec; for (__pyx_t_7 = 0; __pyx_t_7 < __pyx_t_6; __pyx_t_7+=1) { __pyx_v_i = __pyx_t_7; /* "healpy/src/_sphtools.pyx":375 * almsize = alms[0].size * for i in xrange(Nspec): * if alms[i].size != almsize or alms2[i].size != almsize: # <<<<<<<<<<<<<< * raise ValueError('all alms must have same size') * */ __pyx_t_5 = __Pyx_GetItemInt(__pyx_v_alms, __pyx_v_i, int, 1, __Pyx_PyInt_From_int, 0, 1, 1); if (unlikely(__pyx_t_5 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_5); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyInt_From_int(__pyx_v_almsize); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_8 = PyObject_RichCompare(__pyx_t_3, __pyx_t_5, Py_NE); __Pyx_XGOTREF(__pyx_t_8); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_8); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; if (!__pyx_t_2) { __pyx_t_8 = __Pyx_GetItemInt(__pyx_v_alms2, __pyx_v_i, int, 1, __Pyx_PyInt_From_int, 0, 1, 1); if (unlikely(__pyx_t_8 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_8); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_8, __pyx_n_s_size); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyInt_From_int(__pyx_v_almsize); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_3 = PyObject_RichCompare(__pyx_t_5, __pyx_t_8, Py_NE); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_1 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 375; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_9 = __pyx_t_1; } else { __pyx_t_9 = __pyx_t_2; } if (__pyx_t_9) { /* "healpy/src/_sphtools.pyx":376 * for i in xrange(Nspec): * if alms[i].size != almsize or alms2[i].size != almsize: * raise ValueError('all alms must have same size') # <<<<<<<<<<<<<< * * lmax, mmax = alm_getlmmax(alms[0], lmax, mmax) */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__7, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 376; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 376; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } } /* "healpy/src/_sphtools.pyx":378 * raise ValueError('all alms must have same size') * * lmax, mmax = alm_getlmmax(alms[0], lmax, mmax) # <<<<<<<<<<<<<< * * if lmax_out is None: */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_alm_getlmmax); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_8 = __Pyx_GetItemInt(__pyx_v_alms, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_8 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_8); __pyx_t_5 = PyTuple_New(3); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); __Pyx_INCREF(__pyx_v_lmax); PyTuple_SET_ITEM(__pyx_t_5, 1, __pyx_v_lmax); __Pyx_GIVEREF(__pyx_v_lmax); __Pyx_INCREF(__pyx_v_mmax); PyTuple_SET_ITEM(__pyx_t_5, 2, __pyx_v_mmax); __Pyx_GIVEREF(__pyx_v_mmax); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_5, NULL); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if ((likely(PyTuple_CheckExact(__pyx_t_8))) || (PyList_CheckExact(__pyx_t_8))) { PyObject* sequence = __pyx_t_8; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON if (likely(PyTuple_CheckExact(sequence))) { __pyx_t_5 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_3 = PyTuple_GET_ITEM(sequence, 1); } else { __pyx_t_5 = PyList_GET_ITEM(sequence, 0); __pyx_t_3 = PyList_GET_ITEM(sequence, 1); } __Pyx_INCREF(__pyx_t_5); __Pyx_INCREF(__pyx_t_3); #else __pyx_t_5 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_3 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); #endif __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; } else { Py_ssize_t index = -1; __pyx_t_10 = PyObject_GetIter(__pyx_t_8); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_11 = Py_TYPE(__pyx_t_10)->tp_iternext; index = 0; __pyx_t_5 = __pyx_t_11(__pyx_t_10); if (unlikely(!__pyx_t_5)) goto __pyx_L12_unpacking_failed; __Pyx_GOTREF(__pyx_t_5); index = 1; __pyx_t_3 = __pyx_t_11(__pyx_t_10); if (unlikely(!__pyx_t_3)) goto __pyx_L12_unpacking_failed; __Pyx_GOTREF(__pyx_t_3); if (__Pyx_IternextUnpackEndCheck(__pyx_t_11(__pyx_t_10), 2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_11 = NULL; __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; goto __pyx_L13_unpacking_done; __pyx_L12_unpacking_failed:; __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; __pyx_t_11 = NULL; if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 378; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_L13_unpacking_done:; } __Pyx_DECREF_SET(__pyx_v_lmax, __pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF_SET(__pyx_v_mmax, __pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":380 * lmax, mmax = alm_getlmmax(alms[0], lmax, mmax) * * if lmax_out is None: # <<<<<<<<<<<<<< * lmax_out = lmax * */ __pyx_t_9 = (__pyx_v_lmax_out == Py_None); __pyx_t_2 = (__pyx_t_9 != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":381 * * if lmax_out is None: * lmax_out = lmax # <<<<<<<<<<<<<< * * */ __Pyx_INCREF(__pyx_v_lmax); __Pyx_DECREF_SET(__pyx_v_lmax_out, __pyx_v_lmax); goto __pyx_L14; } __pyx_L14:; /* "healpy/src/_sphtools.pyx":388 * # * cdef int j, l, m, limit * cdef int lmax_ = lmax, mmax_ = mmax # <<<<<<<<<<<<<< * cdef int lmax_out_ = lmax_out * */ __pyx_t_6 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_6 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 388; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_lmax_ = __pyx_t_6; __pyx_t_6 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_6 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 388; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_mmax_ = __pyx_t_6; /* "healpy/src/_sphtools.pyx":389 * cdef int j, l, m, limit * cdef int lmax_ = lmax, mmax_ = mmax * cdef int lmax_out_ = lmax_out # <<<<<<<<<<<<<< * * cdef np.ndarray[double, ndim=1] powspec_ */ __pyx_t_6 = __Pyx_PyInt_As_int(__pyx_v_lmax_out); if (unlikely((__pyx_t_6 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 389; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_lmax_out_ = __pyx_t_6; /* "healpy/src/_sphtools.pyx":395 * cdef np.ndarray[np.complex128_t, ndim=1] alm2_ * * spectra = [] # <<<<<<<<<<<<<< * for n in xrange(Nspec): # diagonal rank * for m in xrange(0, Nspec - n): # position in the diagonal */ __pyx_t_8 = PyList_New(0); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 395; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_v_spectra = __pyx_t_8; __pyx_t_8 = 0; /* "healpy/src/_sphtools.pyx":396 * * spectra = [] * for n in xrange(Nspec): # diagonal rank # <<<<<<<<<<<<<< * for m in xrange(0, Nspec - n): # position in the diagonal * powspec_ = np.zeros(lmax + 1) */ __pyx_t_8 = __Pyx_PyInt_From_int(__pyx_v_Nspec); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_builtin_xrange, __pyx_t_3, NULL); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (PyList_CheckExact(__pyx_t_8) || PyTuple_CheckExact(__pyx_t_8)) { __pyx_t_3 = __pyx_t_8; __Pyx_INCREF(__pyx_t_3); __pyx_t_4 = 0; __pyx_t_12 = NULL; } else { __pyx_t_4 = -1; __pyx_t_3 = PyObject_GetIter(__pyx_t_8); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_12 = Py_TYPE(__pyx_t_3)->tp_iternext; } __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; for (;;) { if (!__pyx_t_12 && PyList_CheckExact(__pyx_t_3)) { if (__pyx_t_4 >= PyList_GET_SIZE(__pyx_t_3)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_8 = PyList_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_8); __pyx_t_4++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_8 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_12 && PyTuple_CheckExact(__pyx_t_3)) { if (__pyx_t_4 >= PyTuple_GET_SIZE(__pyx_t_3)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_8 = PyTuple_GET_ITEM(__pyx_t_3, __pyx_t_4); __Pyx_INCREF(__pyx_t_8); __pyx_t_4++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_8 = PySequence_ITEM(__pyx_t_3, __pyx_t_4); __pyx_t_4++; if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_8 = __pyx_t_12(__pyx_t_3); if (unlikely(!__pyx_t_8)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 396; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_8); } __Pyx_XDECREF_SET(__pyx_v_n, __pyx_t_8); __pyx_t_8 = 0; /* "healpy/src/_sphtools.pyx":397 * spectra = [] * for n in xrange(Nspec): # diagonal rank * for m in xrange(0, Nspec - n): # position in the diagonal # <<<<<<<<<<<<<< * powspec_ = np.zeros(lmax + 1) * alm1_ = alms[m] */ __pyx_t_8 = __Pyx_PyInt_From_int(__pyx_v_Nspec); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 397; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_5 = PyNumber_Subtract(__pyx_t_8, __pyx_v_n); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 397; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_13 = __Pyx_PyInt_As_long(__pyx_t_5); if (unlikely((__pyx_t_13 == (long)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 397; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; for (__pyx_t_6 = 0; __pyx_t_6 < __pyx_t_13; __pyx_t_6+=1) { __pyx_v_m = __pyx_t_6; /* "healpy/src/_sphtools.pyx":398 * for n in xrange(Nspec): # diagonal rank * for m in xrange(0, Nspec - n): # position in the diagonal * powspec_ = np.zeros(lmax + 1) # <<<<<<<<<<<<<< * alm1_ = alms[m] * alm2_ = alms2[m + n] */ __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 398; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_zeros); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 398; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyNumber_Add(__pyx_v_lmax, __pyx_int_1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 398; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_10 = PyTuple_New(1); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 398; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); PyTuple_SET_ITEM(__pyx_t_10, 0, __pyx_t_5); __Pyx_GIVEREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_8, __pyx_t_10, NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 398; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; if (!(likely(((__pyx_t_5) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_5, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 398; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = ((PyArrayObject *)__pyx_t_5); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_powspec_.rcbuffer->pybuffer); __pyx_t_7 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_powspec_.rcbuffer->pybuffer, (PyObject*)__pyx_t_14, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack); if (unlikely(__pyx_t_7 < 0)) { PyErr_Fetch(&__pyx_t_15, &__pyx_t_16, &__pyx_t_17); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_powspec_.rcbuffer->pybuffer, (PyObject*)__pyx_v_powspec_, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_15); Py_XDECREF(__pyx_t_16); Py_XDECREF(__pyx_t_17); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_15, __pyx_t_16, __pyx_t_17); } } __pyx_pybuffernd_powspec_.diminfo[0].strides = __pyx_pybuffernd_powspec_.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_powspec_.diminfo[0].shape = __pyx_pybuffernd_powspec_.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 398; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_14 = 0; __Pyx_XDECREF_SET(__pyx_v_powspec_, ((PyArrayObject *)__pyx_t_5)); __pyx_t_5 = 0; /* "healpy/src/_sphtools.pyx":399 * for m in xrange(0, Nspec - n): # position in the diagonal * powspec_ = np.zeros(lmax + 1) * alm1_ = alms[m] # <<<<<<<<<<<<<< * alm2_ = alms2[m + n] * # compute cross-spectrum alm1[n] x alm2[n+m] */ __pyx_t_5 = __Pyx_GetItemInt(__pyx_v_alms, __pyx_v_m, int, 1, __Pyx_PyInt_From_int, 0, 1, 1); if (unlikely(__pyx_t_5 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 399; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_5); if (!(likely(((__pyx_t_5) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_5, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 399; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_18 = ((PyArrayObject *)__pyx_t_5); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm1_.rcbuffer->pybuffer); __pyx_t_7 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm1_.rcbuffer->pybuffer, (PyObject*)__pyx_t_18, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack); if (unlikely(__pyx_t_7 < 0)) { PyErr_Fetch(&__pyx_t_17, &__pyx_t_16, &__pyx_t_15); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm1_.rcbuffer->pybuffer, (PyObject*)__pyx_v_alm1_, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_17); Py_XDECREF(__pyx_t_16); Py_XDECREF(__pyx_t_15); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_17, __pyx_t_16, __pyx_t_15); } } __pyx_pybuffernd_alm1_.diminfo[0].strides = __pyx_pybuffernd_alm1_.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_alm1_.diminfo[0].shape = __pyx_pybuffernd_alm1_.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 399; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_18 = 0; __Pyx_XDECREF_SET(__pyx_v_alm1_, ((PyArrayObject *)__pyx_t_5)); __pyx_t_5 = 0; /* "healpy/src/_sphtools.pyx":400 * powspec_ = np.zeros(lmax + 1) * alm1_ = alms[m] * alm2_ = alms2[m + n] # <<<<<<<<<<<<<< * # compute cross-spectrum alm1[n] x alm2[n+m] * # and place result in result list */ __pyx_t_5 = __Pyx_PyInt_From_int(__pyx_v_m); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 400; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_10 = PyNumber_Add(__pyx_t_5, __pyx_v_n); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 400; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyObject_GetItem(__pyx_v_alms2, __pyx_t_10); if (unlikely(__pyx_t_5 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 400; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; if (!(likely(((__pyx_t_5) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_5, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 400; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_19 = ((PyArrayObject *)__pyx_t_5); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm2_.rcbuffer->pybuffer); __pyx_t_7 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm2_.rcbuffer->pybuffer, (PyObject*)__pyx_t_19, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack); if (unlikely(__pyx_t_7 < 0)) { PyErr_Fetch(&__pyx_t_15, &__pyx_t_16, &__pyx_t_17); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm2_.rcbuffer->pybuffer, (PyObject*)__pyx_v_alm2_, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_15); Py_XDECREF(__pyx_t_16); Py_XDECREF(__pyx_t_17); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_15, __pyx_t_16, __pyx_t_17); } } __pyx_pybuffernd_alm2_.diminfo[0].strides = __pyx_pybuffernd_alm2_.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_alm2_.diminfo[0].shape = __pyx_pybuffernd_alm2_.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_7 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 400; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_19 = 0; __Pyx_XDECREF_SET(__pyx_v_alm2_, ((PyArrayObject *)__pyx_t_5)); __pyx_t_5 = 0; /* "healpy/src/_sphtools.pyx":403 * # compute cross-spectrum alm1[n] x alm2[n+m] * # and place result in result list * for l in range(lmax_ + 1): # <<<<<<<<<<<<<< * j = alm_getidx(lmax_, l, 0) * powspec_[l] = alm1_[j].real * alm2_[j].real */ __pyx_t_20 = (__pyx_v_lmax_ + 1); for (__pyx_t_7 = 0; __pyx_t_7 < __pyx_t_20; __pyx_t_7+=1) { __pyx_v_l = __pyx_t_7; /* "healpy/src/_sphtools.pyx":404 * # and place result in result list * for l in range(lmax_ + 1): * j = alm_getidx(lmax_, l, 0) # <<<<<<<<<<<<<< * powspec_[l] = alm1_[j].real * alm2_[j].real * limit = l if l <= mmax else mmax */ __pyx_v_j = __pyx_f_6healpy_9_sphtools_alm_getidx(__pyx_v_lmax_, __pyx_v_l, 0); /* "healpy/src/_sphtools.pyx":405 * for l in range(lmax_ + 1): * j = alm_getidx(lmax_, l, 0) * powspec_[l] = alm1_[j].real * alm2_[j].real # <<<<<<<<<<<<<< * limit = l if l <= mmax else mmax * for m in range(1, limit + 1): */ __pyx_t_21 = __pyx_v_j; __pyx_t_22 = -1; if (__pyx_t_21 < 0) { __pyx_t_21 += __pyx_pybuffernd_alm1_.diminfo[0].shape; if (unlikely(__pyx_t_21 < 0)) __pyx_t_22 = 0; } else if (unlikely(__pyx_t_21 >= __pyx_pybuffernd_alm1_.diminfo[0].shape)) __pyx_t_22 = 0; if (unlikely(__pyx_t_22 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_22); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 405; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_22 = __pyx_v_j; __pyx_t_23 = -1; if (__pyx_t_22 < 0) { __pyx_t_22 += __pyx_pybuffernd_alm2_.diminfo[0].shape; if (unlikely(__pyx_t_22 < 0)) __pyx_t_23 = 0; } else if (unlikely(__pyx_t_22 >= __pyx_pybuffernd_alm2_.diminfo[0].shape)) __pyx_t_23 = 0; if (unlikely(__pyx_t_23 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_23); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 405; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_23 = __pyx_v_l; __pyx_t_24 = -1; if (__pyx_t_23 < 0) { __pyx_t_23 += __pyx_pybuffernd_powspec_.diminfo[0].shape; if (unlikely(__pyx_t_23 < 0)) __pyx_t_24 = 0; } else if (unlikely(__pyx_t_23 >= __pyx_pybuffernd_powspec_.diminfo[0].shape)) __pyx_t_24 = 0; if (unlikely(__pyx_t_24 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_24); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 405; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided1d(double *, __pyx_pybuffernd_powspec_.rcbuffer->pybuffer.buf, __pyx_t_23, __pyx_pybuffernd_powspec_.diminfo[0].strides) = (__Pyx_CREAL((*__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_alm1_.rcbuffer->pybuffer.buf, __pyx_t_21, __pyx_pybuffernd_alm1_.diminfo[0].strides))) * __Pyx_CREAL((*__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_alm2_.rcbuffer->pybuffer.buf, __pyx_t_22, __pyx_pybuffernd_alm2_.diminfo[0].strides)))); /* "healpy/src/_sphtools.pyx":406 * j = alm_getidx(lmax_, l, 0) * powspec_[l] = alm1_[j].real * alm2_[j].real * limit = l if l <= mmax else mmax # <<<<<<<<<<<<<< * for m in range(1, limit + 1): * j = alm_getidx(lmax_, l, m) */ __pyx_t_5 = __Pyx_PyInt_From_int(__pyx_v_l); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 406; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_10 = PyObject_RichCompare(__pyx_t_5, __pyx_v_mmax, Py_LE); __Pyx_XGOTREF(__pyx_t_10); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 406; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_t_10); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 406; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; if (__pyx_t_2) { __pyx_t_24 = __pyx_v_l; } else { __pyx_t_25 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_25 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 406; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_24 = __pyx_t_25; } __pyx_v_limit = __pyx_t_24; /* "healpy/src/_sphtools.pyx":407 * powspec_[l] = alm1_[j].real * alm2_[j].real * limit = l if l <= mmax else mmax * for m in range(1, limit + 1): # <<<<<<<<<<<<<< * j = alm_getidx(lmax_, l, m) * powspec_[l] += 2 * (alm1_[j].real * alm2_[j].real + */ __pyx_t_26 = (__pyx_v_limit + 1); for (__pyx_t_24 = 1; __pyx_t_24 < __pyx_t_26; __pyx_t_24+=1) { __pyx_v_m = __pyx_t_24; /* "healpy/src/_sphtools.pyx":408 * limit = l if l <= mmax else mmax * for m in range(1, limit + 1): * j = alm_getidx(lmax_, l, m) # <<<<<<<<<<<<<< * powspec_[l] += 2 * (alm1_[j].real * alm2_[j].real + * alm1_[j].imag * alm2_[j].imag) */ __pyx_v_j = __pyx_f_6healpy_9_sphtools_alm_getidx(__pyx_v_lmax_, __pyx_v_l, __pyx_v_m); /* "healpy/src/_sphtools.pyx":409 * for m in range(1, limit + 1): * j = alm_getidx(lmax_, l, m) * powspec_[l] += 2 * (alm1_[j].real * alm2_[j].real + # <<<<<<<<<<<<<< * alm1_[j].imag * alm2_[j].imag) * powspec_[l] /= (2 * l + 1) */ __pyx_t_25 = __pyx_v_j; __pyx_t_27 = -1; if (__pyx_t_25 < 0) { __pyx_t_25 += __pyx_pybuffernd_alm1_.diminfo[0].shape; if (unlikely(__pyx_t_25 < 0)) __pyx_t_27 = 0; } else if (unlikely(__pyx_t_25 >= __pyx_pybuffernd_alm1_.diminfo[0].shape)) __pyx_t_27 = 0; if (unlikely(__pyx_t_27 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_27); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 409; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_27 = __pyx_v_j; __pyx_t_28 = -1; if (__pyx_t_27 < 0) { __pyx_t_27 += __pyx_pybuffernd_alm2_.diminfo[0].shape; if (unlikely(__pyx_t_27 < 0)) __pyx_t_28 = 0; } else if (unlikely(__pyx_t_27 >= __pyx_pybuffernd_alm2_.diminfo[0].shape)) __pyx_t_28 = 0; if (unlikely(__pyx_t_28 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_28); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 409; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":410 * j = alm_getidx(lmax_, l, m) * powspec_[l] += 2 * (alm1_[j].real * alm2_[j].real + * alm1_[j].imag * alm2_[j].imag) # <<<<<<<<<<<<<< * powspec_[l] /= (2 * l + 1) * spectra.append(powspec_) */ __pyx_t_28 = __pyx_v_j; __pyx_t_29 = -1; if (__pyx_t_28 < 0) { __pyx_t_28 += __pyx_pybuffernd_alm1_.diminfo[0].shape; if (unlikely(__pyx_t_28 < 0)) __pyx_t_29 = 0; } else if (unlikely(__pyx_t_28 >= __pyx_pybuffernd_alm1_.diminfo[0].shape)) __pyx_t_29 = 0; if (unlikely(__pyx_t_29 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_29); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 410; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_29 = __pyx_v_j; __pyx_t_30 = -1; if (__pyx_t_29 < 0) { __pyx_t_29 += __pyx_pybuffernd_alm2_.diminfo[0].shape; if (unlikely(__pyx_t_29 < 0)) __pyx_t_30 = 0; } else if (unlikely(__pyx_t_29 >= __pyx_pybuffernd_alm2_.diminfo[0].shape)) __pyx_t_30 = 0; if (unlikely(__pyx_t_30 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_30); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 410; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":409 * for m in range(1, limit + 1): * j = alm_getidx(lmax_, l, m) * powspec_[l] += 2 * (alm1_[j].real * alm2_[j].real + # <<<<<<<<<<<<<< * alm1_[j].imag * alm2_[j].imag) * powspec_[l] /= (2 * l + 1) */ __pyx_t_30 = __pyx_v_l; __pyx_t_31 = -1; if (__pyx_t_30 < 0) { __pyx_t_30 += __pyx_pybuffernd_powspec_.diminfo[0].shape; if (unlikely(__pyx_t_30 < 0)) __pyx_t_31 = 0; } else if (unlikely(__pyx_t_30 >= __pyx_pybuffernd_powspec_.diminfo[0].shape)) __pyx_t_31 = 0; if (unlikely(__pyx_t_31 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_31); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 409; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided1d(double *, __pyx_pybuffernd_powspec_.rcbuffer->pybuffer.buf, __pyx_t_30, __pyx_pybuffernd_powspec_.diminfo[0].strides) += (2.0 * ((__Pyx_CREAL((*__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_alm1_.rcbuffer->pybuffer.buf, __pyx_t_25, __pyx_pybuffernd_alm1_.diminfo[0].strides))) * __Pyx_CREAL((*__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_alm2_.rcbuffer->pybuffer.buf, __pyx_t_27, __pyx_pybuffernd_alm2_.diminfo[0].strides)))) + (__Pyx_CIMAG((*__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_alm1_.rcbuffer->pybuffer.buf, __pyx_t_28, __pyx_pybuffernd_alm1_.diminfo[0].strides))) * __Pyx_CIMAG((*__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_alm2_.rcbuffer->pybuffer.buf, __pyx_t_29, __pyx_pybuffernd_alm2_.diminfo[0].strides)))))); } /* "healpy/src/_sphtools.pyx":411 * powspec_[l] += 2 * (alm1_[j].real * alm2_[j].real + * alm1_[j].imag * alm2_[j].imag) * powspec_[l] /= (2 * l + 1) # <<<<<<<<<<<<<< * spectra.append(powspec_) * */ __pyx_t_24 = __pyx_v_l; __pyx_t_31 = -1; if (__pyx_t_24 < 0) { __pyx_t_24 += __pyx_pybuffernd_powspec_.diminfo[0].shape; if (unlikely(__pyx_t_24 < 0)) __pyx_t_31 = 0; } else if (unlikely(__pyx_t_24 >= __pyx_pybuffernd_powspec_.diminfo[0].shape)) __pyx_t_31 = 0; if (unlikely(__pyx_t_31 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_31); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 411; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided1d(double *, __pyx_pybuffernd_powspec_.rcbuffer->pybuffer.buf, __pyx_t_24, __pyx_pybuffernd_powspec_.diminfo[0].strides) /= ((2 * __pyx_v_l) + 1); } /* "healpy/src/_sphtools.pyx":412 * alm1_[j].imag * alm2_[j].imag) * powspec_[l] /= (2 * l + 1) * spectra.append(powspec_) # <<<<<<<<<<<<<< * * # if only one alm was given, returns only cl and not a list with one cl */ __pyx_t_32 = __Pyx_PyObject_Append(__pyx_v_spectra, ((PyObject *)__pyx_v_powspec_)); if (unlikely(__pyx_t_32 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 412; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } } __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":415 * * # if only one alm was given, returns only cl and not a list with one cl * if alms_lonely: # <<<<<<<<<<<<<< * spectra = spectra[0] * */ __pyx_t_2 = (__pyx_v_alms_lonely != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":416 * # if only one alm was given, returns only cl and not a list with one cl * if alms_lonely: * spectra = spectra[0] # <<<<<<<<<<<<<< * * return spectra */ __pyx_t_3 = __Pyx_GetItemInt_List(__pyx_v_spectra, 0, long, 1, __Pyx_PyInt_From_long, 1, 0, 1); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 416; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF_SET(__pyx_v_spectra, __pyx_t_3); __pyx_t_3 = 0; goto __pyx_L23; } __pyx_L23:; /* "healpy/src/_sphtools.pyx":418 * spectra = spectra[0] * * return spectra # <<<<<<<<<<<<<< * * */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(__pyx_v_spectra); __pyx_r = __pyx_v_spectra; goto __pyx_L0; /* "healpy/src/_sphtools.pyx":311 * * * def alm2cl(alms, alms2 = None, lmax = None, mmax = None, lmax_out = None): # <<<<<<<<<<<<<< * """Computes (cross-)spectra from alm(s). If alm2 is given, cross-spectra between * alm and alm2 are computed. If alm (and alm2 if provided) contains n alm, */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_8); __Pyx_XDECREF(__pyx_t_10); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm1_.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm2_.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_powspec_.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._sphtools.alm2cl", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm1_.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm2_.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_powspec_.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_powspec_); __Pyx_XDECREF((PyObject *)__pyx_v_alm1_); __Pyx_XDECREF((PyObject *)__pyx_v_alm2_); __Pyx_XDECREF(__pyx_v_spectra); __Pyx_XDECREF(__pyx_v_n); __Pyx_XDECREF(__pyx_v_alms); __Pyx_XDECREF(__pyx_v_alms2); __Pyx_XDECREF(__pyx_v_lmax); __Pyx_XDECREF(__pyx_v_mmax); __Pyx_XDECREF(__pyx_v_lmax_out); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":423 * @cython.wraparound(False) * @cython.boundscheck(False) * def almxfl(alm, fl, mmax = None, inplace = False): # <<<<<<<<<<<<<< * """Multiply an a_lm by a vector b_l. * */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_11almxfl(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_9_sphtools_10almxfl[] = "Multiply an a_lm by a vector b_l.\n\n Parameters\n ----------\n alm : array, double\n The array representing the spherical harmonics coefficients\n fl : array, double\n The array giving the factor f_l by which to multiply a_lm\n mmax : None or int, optional\n The maximum m of the input alm\n inplace : bool, optional\n If True, performs the computation in-place if possible (input alm\n is modified if it is a 1d-array of type float64). Otherwise,\n a copy of alm is done.\n\n Returns\n -------\n alm : array, double\n The result of a_lm * f_l. If *inplace* is True, returns the input\n alm modified\n "; static PyMethodDef __pyx_mdef_6healpy_9_sphtools_11almxfl = {__Pyx_NAMESTR("almxfl"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_11almxfl, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_9_sphtools_10almxfl)}; static PyObject *__pyx_pw_6healpy_9_sphtools_11almxfl(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_alm = 0; PyObject *__pyx_v_fl = 0; PyObject *__pyx_v_mmax = 0; PyObject *__pyx_v_inplace = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("almxfl (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_alm,&__pyx_n_s_fl,&__pyx_n_s_mmax,&__pyx_n_s_inplace,0}; PyObject* values[4] = {0,0,0,0}; values[2] = ((PyObject *)Py_None); values[3] = ((PyObject *)Py_False); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_alm)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_fl)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("almxfl", 0, 2, 4, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mmax); if (value) { values[2] = value; kw_args--; } } case 3: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_inplace); if (value) { values[3] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "almxfl") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_alm = values[0]; __pyx_v_fl = values[1]; __pyx_v_mmax = values[2]; __pyx_v_inplace = values[3]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("almxfl", 0, 2, 4, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._sphtools.almxfl", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_9_sphtools_10almxfl(__pyx_self, __pyx_v_alm, __pyx_v_fl, __pyx_v_mmax, __pyx_v_inplace); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_10almxfl(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alm, PyObject *__pyx_v_fl, PyObject *__pyx_v_mmax, PyObject *__pyx_v_inplace) { PyArrayObject *__pyx_v_alm_ = 0; PyArrayObject *__pyx_v_fl_ = 0; int __pyx_v_lmax_; int __pyx_v_mmax_; int __pyx_v_l; int __pyx_v_m; __pyx_t_double_complex __pyx_v_f; int __pyx_v_maxm; int __pyx_v_i; int __pyx_v_flsize; __Pyx_LocalBuf_ND __pyx_pybuffernd_alm_; __Pyx_Buffer __pyx_pybuffer_alm_; __Pyx_LocalBuf_ND __pyx_pybuffernd_fl_; __Pyx_Buffer __pyx_pybuffer_fl_; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; PyObject *__pyx_t_2 = NULL; PyObject *__pyx_t_3 = NULL; PyObject *__pyx_t_4 = NULL; PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyArrayObject *__pyx_t_7 = NULL; int __pyx_t_8; PyObject *__pyx_t_9 = NULL; PyObject *__pyx_t_10 = NULL; PyObject *__pyx_t_11 = NULL; PyArrayObject *__pyx_t_12 = NULL; PyObject *(*__pyx_t_13)(PyObject *); int __pyx_t_14; long __pyx_t_15; __pyx_t_double_complex __pyx_t_16; int __pyx_t_17; long __pyx_t_18; int __pyx_t_19; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("almxfl", 0); __pyx_pybuffer_alm_.pybuffer.buf = NULL; __pyx_pybuffer_alm_.refcount = 0; __pyx_pybuffernd_alm_.data = NULL; __pyx_pybuffernd_alm_.rcbuffer = &__pyx_pybuffer_alm_; __pyx_pybuffer_fl_.pybuffer.buf = NULL; __pyx_pybuffer_fl_.refcount = 0; __pyx_pybuffernd_fl_.data = NULL; __pyx_pybuffernd_fl_.rcbuffer = &__pyx_pybuffer_fl_; /* "healpy/src/_sphtools.pyx":448 * cdef np.ndarray[np.complex128_t, ndim=1] fl_ * * if inplace: # <<<<<<<<<<<<<< * alm_ = np.ascontiguousarray(alm, dtype = np.complex128) * else: */ __pyx_t_1 = __Pyx_PyObject_IsTrue(__pyx_v_inplace); if (unlikely(__pyx_t_1 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 448; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_1) { /* "healpy/src/_sphtools.pyx":449 * * if inplace: * alm_ = np.ascontiguousarray(alm, dtype = np.complex128) # <<<<<<<<<<<<<< * else: * alm_ = np.array(alm, dtype = np.complex128, copy = True) */ __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = PyTuple_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_INCREF(__pyx_v_alm); PyTuple_SET_ITEM(__pyx_t_2, 0, __pyx_v_alm); __Pyx_GIVEREF(__pyx_v_alm); __pyx_t_4 = PyDict_New(); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_complex128); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (PyDict_SetItem(__pyx_t_4, __pyx_n_s_dtype, __pyx_t_6) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_2, __pyx_t_4); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (!(likely(((__pyx_t_6) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_6, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_7 = ((PyArrayObject *)__pyx_t_6); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer); __pyx_t_8 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer, (PyObject*)__pyx_t_7, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack); if (unlikely(__pyx_t_8 < 0)) { PyErr_Fetch(&__pyx_t_9, &__pyx_t_10, &__pyx_t_11); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer, (PyObject*)__pyx_v_alm_, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_9); Py_XDECREF(__pyx_t_10); Py_XDECREF(__pyx_t_11); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_9, __pyx_t_10, __pyx_t_11); } } __pyx_pybuffernd_alm_.diminfo[0].strides = __pyx_pybuffernd_alm_.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_alm_.diminfo[0].shape = __pyx_pybuffernd_alm_.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_8 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 449; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_7 = 0; __pyx_v_alm_ = ((PyArrayObject *)__pyx_t_6); __pyx_t_6 = 0; goto __pyx_L3; } /*else*/ { /* "healpy/src/_sphtools.pyx":451 * alm_ = np.ascontiguousarray(alm, dtype = np.complex128) * else: * alm_ = np.array(alm, dtype = np.complex128, copy = True) # <<<<<<<<<<<<<< * * fl_ = np.ascontiguousarray(fl, dtype = np.complex128) */ __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_array); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_INCREF(__pyx_v_alm); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_v_alm); __Pyx_GIVEREF(__pyx_v_alm); __pyx_t_2 = PyDict_New(); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_complex128); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (PyDict_SetItem(__pyx_t_2, __pyx_n_s_dtype, __pyx_t_5) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (PyDict_SetItem(__pyx_t_2, __pyx_n_s_copy, Py_True) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_6, __pyx_t_2); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; if (!(likely(((__pyx_t_5) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_5, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_7 = ((PyArrayObject *)__pyx_t_5); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer); __pyx_t_8 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer, (PyObject*)__pyx_t_7, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack); if (unlikely(__pyx_t_8 < 0)) { PyErr_Fetch(&__pyx_t_11, &__pyx_t_10, &__pyx_t_9); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer, (PyObject*)__pyx_v_alm_, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_11); Py_XDECREF(__pyx_t_10); Py_XDECREF(__pyx_t_9); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_11, __pyx_t_10, __pyx_t_9); } } __pyx_pybuffernd_alm_.diminfo[0].strides = __pyx_pybuffernd_alm_.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_alm_.diminfo[0].shape = __pyx_pybuffernd_alm_.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_8 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 451; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_7 = 0; __pyx_v_alm_ = ((PyArrayObject *)__pyx_t_5); __pyx_t_5 = 0; } __pyx_L3:; /* "healpy/src/_sphtools.pyx":453 * alm_ = np.array(alm, dtype = np.complex128, copy = True) * * fl_ = np.ascontiguousarray(fl, dtype = np.complex128) # <<<<<<<<<<<<<< * * cdef int lmax_, mmax_ */ __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_INCREF(__pyx_v_fl); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_v_fl); __Pyx_GIVEREF(__pyx_v_fl); __pyx_t_6 = PyDict_New(); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_4 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_4, __pyx_n_s_complex128); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (PyDict_SetItem(__pyx_t_6, __pyx_n_s_dtype, __pyx_t_3) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_5, __pyx_t_6); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_12 = ((PyArrayObject *)__pyx_t_3); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_fl_.rcbuffer->pybuffer); __pyx_t_8 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_fl_.rcbuffer->pybuffer, (PyObject*)__pyx_t_12, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack); if (unlikely(__pyx_t_8 < 0)) { PyErr_Fetch(&__pyx_t_9, &__pyx_t_10, &__pyx_t_11); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_fl_.rcbuffer->pybuffer, (PyObject*)__pyx_v_fl_, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_9); Py_XDECREF(__pyx_t_10); Py_XDECREF(__pyx_t_11); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_9, __pyx_t_10, __pyx_t_11); } } __pyx_pybuffernd_fl_.diminfo[0].strides = __pyx_pybuffernd_fl_.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_fl_.diminfo[0].shape = __pyx_pybuffernd_fl_.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_8 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 453; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_12 = 0; __pyx_v_fl_ = ((PyArrayObject *)__pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":457 * cdef int lmax_, mmax_ * cdef int l, m * lmax_, mmax_ = alm_getlmmax(alm_, None, mmax) # <<<<<<<<<<<<<< * * cdef np.complex128_t f */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_alm_getlmmax); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = PyTuple_New(3); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __Pyx_INCREF(((PyObject *)__pyx_v_alm_)); PyTuple_SET_ITEM(__pyx_t_6, 0, ((PyObject *)__pyx_v_alm_)); __Pyx_GIVEREF(((PyObject *)__pyx_v_alm_)); __Pyx_INCREF(Py_None); PyTuple_SET_ITEM(__pyx_t_6, 1, Py_None); __Pyx_GIVEREF(Py_None); __Pyx_INCREF(__pyx_v_mmax); PyTuple_SET_ITEM(__pyx_t_6, 2, __pyx_v_mmax); __Pyx_GIVEREF(__pyx_v_mmax); __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_6, NULL); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if ((likely(PyTuple_CheckExact(__pyx_t_5))) || (PyList_CheckExact(__pyx_t_5))) { PyObject* sequence = __pyx_t_5; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON if (likely(PyTuple_CheckExact(sequence))) { __pyx_t_6 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_3 = PyTuple_GET_ITEM(sequence, 1); } else { __pyx_t_6 = PyList_GET_ITEM(sequence, 0); __pyx_t_3 = PyList_GET_ITEM(sequence, 1); } __Pyx_INCREF(__pyx_t_6); __Pyx_INCREF(__pyx_t_3); #else __pyx_t_6 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_3 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); #endif __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; } else { Py_ssize_t index = -1; __pyx_t_2 = PyObject_GetIter(__pyx_t_5); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_13 = Py_TYPE(__pyx_t_2)->tp_iternext; index = 0; __pyx_t_6 = __pyx_t_13(__pyx_t_2); if (unlikely(!__pyx_t_6)) goto __pyx_L4_unpacking_failed; __Pyx_GOTREF(__pyx_t_6); index = 1; __pyx_t_3 = __pyx_t_13(__pyx_t_2); if (unlikely(!__pyx_t_3)) goto __pyx_L4_unpacking_failed; __Pyx_GOTREF(__pyx_t_3); if (__Pyx_IternextUnpackEndCheck(__pyx_t_13(__pyx_t_2), 2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = NULL; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; goto __pyx_L5_unpacking_done; __pyx_L4_unpacking_failed:; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_13 = NULL; if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_L5_unpacking_done:; } __pyx_t_8 = __Pyx_PyInt_As_int(__pyx_t_6); if (unlikely((__pyx_t_8 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __pyx_t_14 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_14 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 457; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_lmax_ = __pyx_t_8; __pyx_v_mmax_ = __pyx_t_14; /* "healpy/src/_sphtools.pyx":461 * cdef np.complex128_t f * cdef int maxm, i * cdef int flsize = fl_.size # <<<<<<<<<<<<<< * for l in xrange(lmax_ + 1): * f = fl_[l] if l < flsize else 0. */ __pyx_t_5 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_fl_), __pyx_n_s_size); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 461; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_14 = __Pyx_PyInt_As_int(__pyx_t_5); if (unlikely((__pyx_t_14 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 461; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_v_flsize = __pyx_t_14; /* "healpy/src/_sphtools.pyx":462 * cdef int maxm, i * cdef int flsize = fl_.size * for l in xrange(lmax_ + 1): # <<<<<<<<<<<<<< * f = fl_[l] if l < flsize else 0. * maxm = l if l <= mmax_ else mmax_ */ __pyx_t_15 = (__pyx_v_lmax_ + 1); for (__pyx_t_14 = 0; __pyx_t_14 < __pyx_t_15; __pyx_t_14+=1) { __pyx_v_l = __pyx_t_14; /* "healpy/src/_sphtools.pyx":463 * cdef int flsize = fl_.size * for l in xrange(lmax_ + 1): * f = fl_[l] if l < flsize else 0. # <<<<<<<<<<<<<< * maxm = l if l <= mmax_ else mmax_ * for m in xrange(maxm + 1): */ if (((__pyx_v_l < __pyx_v_flsize) != 0)) { __pyx_t_8 = __pyx_v_l; __pyx_t_16 = (*__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_fl_.rcbuffer->pybuffer.buf, __pyx_t_8, __pyx_pybuffernd_fl_.diminfo[0].strides)); } else { __pyx_t_16 = __pyx_t_double_complex_from_parts(0., 0); } __pyx_v_f = __pyx_t_16; /* "healpy/src/_sphtools.pyx":464 * for l in xrange(lmax_ + 1): * f = fl_[l] if l < flsize else 0. * maxm = l if l <= mmax_ else mmax_ # <<<<<<<<<<<<<< * for m in xrange(maxm + 1): * i = alm_getidx(lmax_, l, m) */ if (((__pyx_v_l <= __pyx_v_mmax_) != 0)) { __pyx_t_17 = __pyx_v_l; } else { __pyx_t_17 = __pyx_v_mmax_; } __pyx_v_maxm = __pyx_t_17; /* "healpy/src/_sphtools.pyx":465 * f = fl_[l] if l < flsize else 0. * maxm = l if l <= mmax_ else mmax_ * for m in xrange(maxm + 1): # <<<<<<<<<<<<<< * i = alm_getidx(lmax_, l, m) * alm_[i] *= f */ __pyx_t_18 = (__pyx_v_maxm + 1); for (__pyx_t_17 = 0; __pyx_t_17 < __pyx_t_18; __pyx_t_17+=1) { __pyx_v_m = __pyx_t_17; /* "healpy/src/_sphtools.pyx":466 * maxm = l if l <= mmax_ else mmax_ * for m in xrange(maxm + 1): * i = alm_getidx(lmax_, l, m) # <<<<<<<<<<<<<< * alm_[i] *= f * */ __pyx_v_i = __pyx_f_6healpy_9_sphtools_alm_getidx(__pyx_v_lmax_, __pyx_v_l, __pyx_v_m); /* "healpy/src/_sphtools.pyx":467 * for m in xrange(maxm + 1): * i = alm_getidx(lmax_, l, m) * alm_[i] *= f # <<<<<<<<<<<<<< * * return alm_ */ __pyx_t_19 = __pyx_v_i; *__Pyx_BufPtrStrided1d(__pyx_t_double_complex *, __pyx_pybuffernd_alm_.rcbuffer->pybuffer.buf, __pyx_t_19, __pyx_pybuffernd_alm_.diminfo[0].strides) *= __pyx_v_f; } } /* "healpy/src/_sphtools.pyx":469 * alm_[i] *= f * * return alm_ # <<<<<<<<<<<<<< * * */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_alm_)); __pyx_r = ((PyObject *)__pyx_v_alm_); goto __pyx_L0; /* "healpy/src/_sphtools.pyx":423 * @cython.wraparound(False) * @cython.boundscheck(False) * def almxfl(alm, fl, mmax = None, inplace = False): # <<<<<<<<<<<<<< * """Multiply an a_lm by a vector b_l. * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_2); __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_fl_.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._sphtools.almxfl", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_alm_.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_fl_.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_alm_); __Pyx_XDECREF((PyObject *)__pyx_v_fl_); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":472 * * * def rotate_alm(alm not None, double psi, double theta, double phi, lmax=None, # <<<<<<<<<<<<<< * mmax=None): * """ */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_13rotate_alm(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_9_sphtools_12rotate_alm[] = "\n This routine transforms the scalar (and tensor) a_lm coefficients\n to emulate the effect of an arbitrary rotation of the underlying\n map. The rotation is done directly on the a_lm using the Wigner\n rotation matrices, computed by recursion. To rotate the a_lm for\n l \342\211\244 l_max the number of operations scales like l_max^3.\n\n Parameters\n ----------\n alm : array-like of shape (n,) or (k,n), or list of arrays\n Complex a_lm values before and after rotation of the coordinate system.\n psi : float\n First rotation: angle \317\210 about the z-axis. All angles are in radians\n and should lie in [-2pi,2pi], the rotations are active and the\n referential system is assumed to be right handed. The routine\n coordsys2euler zyz can be used to generate the Euler angles \317\210, \316\270, \317\206\n for rotation between standard astronomical coordinate systems.\n theta : float\n Second rotation: angle \316\270 about the original (unrotated) y-axis\n phi : float.\n Third rotation: angle \317\206 about the original (unrotated) z-axis.\n lmax : int\n Maximum multipole order l of the data set.\n mmax : int\n Maximum degree m of data set.\n\n "; static PyMethodDef __pyx_mdef_6healpy_9_sphtools_13rotate_alm = {__Pyx_NAMESTR("rotate_alm"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_13rotate_alm, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_9_sphtools_12rotate_alm)}; static PyObject *__pyx_pw_6healpy_9_sphtools_13rotate_alm(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_alm = 0; double __pyx_v_psi; double __pyx_v_theta; double __pyx_v_phi; PyObject *__pyx_v_lmax = 0; PyObject *__pyx_v_mmax = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("rotate_alm (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_alm,&__pyx_n_s_psi,&__pyx_n_s_theta,&__pyx_n_s_phi,&__pyx_n_s_lmax,&__pyx_n_s_mmax,0}; PyObject* values[6] = {0,0,0,0,0,0}; values[4] = ((PyObject *)Py_None); /* "healpy/src/_sphtools.pyx":473 * * def rotate_alm(alm not None, double psi, double theta, double phi, lmax=None, * mmax=None): # <<<<<<<<<<<<<< * """ * This routine transforms the scalar (and tensor) a_lm coefficients */ values[5] = ((PyObject *)Py_None); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_alm)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_psi)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("rotate_alm", 0, 4, 6, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (likely((values[2] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_theta)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("rotate_alm", 0, 4, 6, 2); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 3: if (likely((values[3] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_phi)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("rotate_alm", 0, 4, 6, 3); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 4: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lmax); if (value) { values[4] = value; kw_args--; } } case 5: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mmax); if (value) { values[5] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "rotate_alm") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 6: values[5] = PyTuple_GET_ITEM(__pyx_args, 5); case 5: values[4] = PyTuple_GET_ITEM(__pyx_args, 4); case 4: values[3] = PyTuple_GET_ITEM(__pyx_args, 3); values[2] = PyTuple_GET_ITEM(__pyx_args, 2); values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_alm = values[0]; __pyx_v_psi = __pyx_PyFloat_AsDouble(values[1]); if (unlikely((__pyx_v_psi == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_v_theta = __pyx_PyFloat_AsDouble(values[2]); if (unlikely((__pyx_v_theta == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_v_phi = __pyx_PyFloat_AsDouble(values[3]); if (unlikely((__pyx_v_phi == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_v_lmax = values[4]; __pyx_v_mmax = values[5]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("rotate_alm", 0, 4, 6, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._sphtools.rotate_alm", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; if (unlikely(((PyObject *)__pyx_v_alm) == Py_None)) { PyErr_Format(PyExc_TypeError, "Argument '%.200s' must not be None", "alm"); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_r = __pyx_pf_6healpy_9_sphtools_12rotate_alm(__pyx_self, __pyx_v_alm, __pyx_v_psi, __pyx_v_theta, __pyx_v_phi, __pyx_v_lmax, __pyx_v_mmax); /* "healpy/src/_sphtools.pyx":472 * * * def rotate_alm(alm not None, double psi, double theta, double phi, lmax=None, # <<<<<<<<<<<<<< * mmax=None): * """ */ /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_12rotate_alm(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_alm, double __pyx_v_psi, double __pyx_v_theta, double __pyx_v_phi, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax) { PyObject *__pyx_v_a = NULL; PyObject *__pyx_v_ai = NULL; Alm > *__pyx_v_AI; PyObject *__pyx_v_ag = NULL; PyObject *__pyx_v_ac = NULL; Alm > *__pyx_v_AG; Alm > *__pyx_v_AC; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; PyObject *__pyx_t_2 = NULL; PyObject *__pyx_t_3 = NULL; int __pyx_t_4; int __pyx_t_5; Py_ssize_t __pyx_t_6; PyObject *(*__pyx_t_7)(PyObject *); PyObject *__pyx_t_8 = NULL; PyObject *__pyx_t_9 = NULL; PyObject *__pyx_t_10 = NULL; PyObject *__pyx_t_11 = NULL; PyObject *(*__pyx_t_12)(PyObject *); int __pyx_t_13; int __pyx_t_14; Alm > *__pyx_t_15; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("rotate_alm", 0); __Pyx_INCREF(__pyx_v_alm); __Pyx_INCREF(__pyx_v_lmax); __Pyx_INCREF(__pyx_v_mmax); /* "healpy/src/_sphtools.pyx":501 * * """ * if isinstance(alm, np.ndarray) and alm.ndim == 1: # <<<<<<<<<<<<<< * alm = [alm] * */ __pyx_t_1 = __Pyx_TypeCheck(__pyx_v_alm, ((PyObject*)__pyx_ptype_5numpy_ndarray)); if (__pyx_t_1) { __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_v_alm, __pyx_n_s_ndim); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 501; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_3 = PyObject_RichCompare(__pyx_t_2, __pyx_int_1, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 501; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_4 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_4 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 501; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_5 = __pyx_t_4; } else { __pyx_t_5 = __pyx_t_1; } if (__pyx_t_5) { /* "healpy/src/_sphtools.pyx":502 * """ * if isinstance(alm, np.ndarray) and alm.ndim == 1: * alm = [alm] # <<<<<<<<<<<<<< * * if not isinstance(alm, (list, tuple, np.ndarray)) or len(alm) == 0: */ __pyx_t_3 = PyList_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 502; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_INCREF(__pyx_v_alm); PyList_SET_ITEM(__pyx_t_3, 0, __pyx_v_alm); __Pyx_GIVEREF(__pyx_v_alm); __Pyx_DECREF_SET(__pyx_v_alm, __pyx_t_3); __pyx_t_3 = 0; goto __pyx_L3; } __pyx_L3:; /* "healpy/src/_sphtools.pyx":504 * alm = [alm] * * if not isinstance(alm, (list, tuple, np.ndarray)) or len(alm) == 0: # <<<<<<<<<<<<<< * raise ValueError('Invalid input.') * */ __pyx_t_5 = PyList_Check(__pyx_v_alm); if (!__pyx_t_5) { __pyx_t_1 = PyTuple_Check(__pyx_v_alm); __pyx_t_4 = __pyx_t_1; } else { __pyx_t_4 = __pyx_t_5; } if (!__pyx_t_4) { __pyx_t_5 = __Pyx_TypeCheck(__pyx_v_alm, ((PyObject*)__pyx_ptype_5numpy_ndarray)); __pyx_t_1 = __pyx_t_5; } else { __pyx_t_1 = __pyx_t_4; } __pyx_t_4 = ((!(__pyx_t_1 != 0)) != 0); if (!__pyx_t_4) { __pyx_t_6 = PyObject_Length(__pyx_v_alm); if (unlikely(__pyx_t_6 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 504; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_1 = ((__pyx_t_6 == 0) != 0); __pyx_t_5 = __pyx_t_1; } else { __pyx_t_5 = __pyx_t_4; } if (__pyx_t_5) { /* "healpy/src/_sphtools.pyx":505 * * if not isinstance(alm, (list, tuple, np.ndarray)) or len(alm) == 0: * raise ValueError('Invalid input.') # <<<<<<<<<<<<<< * * # C++ rotate_alm only handles 1 or 3 maps. The function handling 3 maps */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__8, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 505; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 505; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":510 * # is faster than running 3 times the 1-map function, but gives identical * # results. * if len(alm) not in (1, 3): # <<<<<<<<<<<<<< * for a in alm: * rotate_alm(a, psi, theta, phi) */ __pyx_t_6 = PyObject_Length(__pyx_v_alm); if (unlikely(__pyx_t_6 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 510; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_5 = ((__pyx_t_6 != 1) != 0); if (__pyx_t_5) { __pyx_t_4 = ((__pyx_t_6 != 3) != 0); __pyx_t_1 = __pyx_t_4; } else { __pyx_t_1 = __pyx_t_5; } __pyx_t_5 = (__pyx_t_1 != 0); if (__pyx_t_5) { /* "healpy/src/_sphtools.pyx":511 * # results. * if len(alm) not in (1, 3): * for a in alm: # <<<<<<<<<<<<<< * rotate_alm(a, psi, theta, phi) * return */ if (PyList_CheckExact(__pyx_v_alm) || PyTuple_CheckExact(__pyx_v_alm)) { __pyx_t_3 = __pyx_v_alm; __Pyx_INCREF(__pyx_t_3); __pyx_t_6 = 0; __pyx_t_7 = NULL; } else { __pyx_t_6 = -1; __pyx_t_3 = PyObject_GetIter(__pyx_v_alm); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 511; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_7 = Py_TYPE(__pyx_t_3)->tp_iternext; } for (;;) { if (!__pyx_t_7 && PyList_CheckExact(__pyx_t_3)) { if (__pyx_t_6 >= PyList_GET_SIZE(__pyx_t_3)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_2 = PyList_GET_ITEM(__pyx_t_3, __pyx_t_6); __Pyx_INCREF(__pyx_t_2); __pyx_t_6++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 511; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_2 = PySequence_ITEM(__pyx_t_3, __pyx_t_6); __pyx_t_6++; if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 511; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else if (!__pyx_t_7 && PyTuple_CheckExact(__pyx_t_3)) { if (__pyx_t_6 >= PyTuple_GET_SIZE(__pyx_t_3)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_2 = PyTuple_GET_ITEM(__pyx_t_3, __pyx_t_6); __Pyx_INCREF(__pyx_t_2); __pyx_t_6++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 511; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_2 = PySequence_ITEM(__pyx_t_3, __pyx_t_6); __pyx_t_6++; if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 511; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif } else { __pyx_t_2 = __pyx_t_7(__pyx_t_3); if (unlikely(!__pyx_t_2)) { PyObject* exc_type = PyErr_Occurred(); if (exc_type) { if (likely(exc_type == PyExc_StopIteration || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration))) PyErr_Clear(); else {__pyx_filename = __pyx_f[0]; __pyx_lineno = 511; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } break; } __Pyx_GOTREF(__pyx_t_2); } __Pyx_XDECREF_SET(__pyx_v_a, __pyx_t_2); __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":512 * if len(alm) not in (1, 3): * for a in alm: * rotate_alm(a, psi, theta, phi) # <<<<<<<<<<<<<< * return * */ __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_rotate_alm); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_8 = PyFloat_FromDouble(__pyx_v_psi); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_9 = PyFloat_FromDouble(__pyx_v_theta); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __pyx_t_10 = PyFloat_FromDouble(__pyx_v_phi); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __pyx_t_11 = PyTuple_New(4); if (unlikely(!__pyx_t_11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_11); __Pyx_INCREF(__pyx_v_a); PyTuple_SET_ITEM(__pyx_t_11, 0, __pyx_v_a); __Pyx_GIVEREF(__pyx_v_a); PyTuple_SET_ITEM(__pyx_t_11, 1, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); PyTuple_SET_ITEM(__pyx_t_11, 2, __pyx_t_9); __Pyx_GIVEREF(__pyx_t_9); PyTuple_SET_ITEM(__pyx_t_11, 3, __pyx_t_10); __Pyx_GIVEREF(__pyx_t_10); __pyx_t_8 = 0; __pyx_t_9 = 0; __pyx_t_10 = 0; __pyx_t_10 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_11, NULL); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 512; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0; __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; } __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":513 * for a in alm: * rotate_alm(a, psi, theta, phi) * return # <<<<<<<<<<<<<< * * lmax, mmax = alm_getlmmax(alm[0], lmax, mmax) */ __Pyx_XDECREF(__pyx_r); __pyx_r = Py_None; __Pyx_INCREF(Py_None); goto __pyx_L0; } /* "healpy/src/_sphtools.pyx":515 * return * * lmax, mmax = alm_getlmmax(alm[0], lmax, mmax) # <<<<<<<<<<<<<< * ai = np.ascontiguousarray(alm[0], dtype=np.complex128) * AI = ndarray2alm(ai, lmax, mmax) */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_alm_getlmmax); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_10 = __Pyx_GetItemInt(__pyx_v_alm, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_10 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_10); __pyx_t_11 = PyTuple_New(3); if (unlikely(!__pyx_t_11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_11); PyTuple_SET_ITEM(__pyx_t_11, 0, __pyx_t_10); __Pyx_GIVEREF(__pyx_t_10); __Pyx_INCREF(__pyx_v_lmax); PyTuple_SET_ITEM(__pyx_t_11, 1, __pyx_v_lmax); __Pyx_GIVEREF(__pyx_v_lmax); __Pyx_INCREF(__pyx_v_mmax); PyTuple_SET_ITEM(__pyx_t_11, 2, __pyx_v_mmax); __Pyx_GIVEREF(__pyx_v_mmax); __pyx_t_10 = 0; __pyx_t_10 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_11, NULL); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0; if ((likely(PyTuple_CheckExact(__pyx_t_10))) || (PyList_CheckExact(__pyx_t_10))) { PyObject* sequence = __pyx_t_10; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON if (likely(PyTuple_CheckExact(sequence))) { __pyx_t_11 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_3 = PyTuple_GET_ITEM(sequence, 1); } else { __pyx_t_11 = PyList_GET_ITEM(sequence, 0); __pyx_t_3 = PyList_GET_ITEM(sequence, 1); } __Pyx_INCREF(__pyx_t_11); __Pyx_INCREF(__pyx_t_3); #else __pyx_t_11 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_11); __pyx_t_3 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); #endif __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; } else { Py_ssize_t index = -1; __pyx_t_2 = PyObject_GetIter(__pyx_t_10); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; __pyx_t_12 = Py_TYPE(__pyx_t_2)->tp_iternext; index = 0; __pyx_t_11 = __pyx_t_12(__pyx_t_2); if (unlikely(!__pyx_t_11)) goto __pyx_L8_unpacking_failed; __Pyx_GOTREF(__pyx_t_11); index = 1; __pyx_t_3 = __pyx_t_12(__pyx_t_2); if (unlikely(!__pyx_t_3)) goto __pyx_L8_unpacking_failed; __Pyx_GOTREF(__pyx_t_3); if (__Pyx_IternextUnpackEndCheck(__pyx_t_12(__pyx_t_2), 2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_12 = NULL; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; goto __pyx_L9_unpacking_done; __pyx_L8_unpacking_failed:; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_12 = NULL; if (__Pyx_IterFinish() == 0) __Pyx_RaiseNeedMoreValuesError(index); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 515; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_L9_unpacking_done:; } __Pyx_DECREF_SET(__pyx_v_lmax, __pyx_t_11); __pyx_t_11 = 0; __Pyx_DECREF_SET(__pyx_v_mmax, __pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":516 * * lmax, mmax = alm_getlmmax(alm[0], lmax, mmax) * ai = np.ascontiguousarray(alm[0], dtype=np.complex128) # <<<<<<<<<<<<<< * AI = ndarray2alm(ai, lmax, mmax) * if len(alm) == 1: */ __pyx_t_10 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_10, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; __pyx_t_10 = __Pyx_GetItemInt(__pyx_v_alm, 0, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_10 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_10); __pyx_t_11 = PyTuple_New(1); if (unlikely(!__pyx_t_11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_11); PyTuple_SET_ITEM(__pyx_t_11, 0, __pyx_t_10); __Pyx_GIVEREF(__pyx_t_10); __pyx_t_10 = 0; __pyx_t_10 = PyDict_New(); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_9 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_complex128); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; if (PyDict_SetItem(__pyx_t_10, __pyx_n_s_dtype, __pyx_t_9) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_t_9 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_11, __pyx_t_10); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 516; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0; __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; __pyx_v_ai = __pyx_t_9; __pyx_t_9 = 0; /* "healpy/src/_sphtools.pyx":517 * lmax, mmax = alm_getlmmax(alm[0], lmax, mmax) * ai = np.ascontiguousarray(alm[0], dtype=np.complex128) * AI = ndarray2alm(ai, lmax, mmax) # <<<<<<<<<<<<<< * if len(alm) == 1: * c_rotate_alm(AI[0], psi, theta, phi) */ if (!(likely(((__pyx_v_ai) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_ai, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 517; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_13 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 517; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_14 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 517; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_15 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_v_ai), __pyx_t_13, __pyx_t_14); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 517; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_AI = __pyx_t_15; /* "healpy/src/_sphtools.pyx":518 * ai = np.ascontiguousarray(alm[0], dtype=np.complex128) * AI = ndarray2alm(ai, lmax, mmax) * if len(alm) == 1: # <<<<<<<<<<<<<< * c_rotate_alm(AI[0], psi, theta, phi) * del AI */ __pyx_t_6 = PyObject_Length(__pyx_v_alm); if (unlikely(__pyx_t_6 == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 518; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_5 = ((__pyx_t_6 == 1) != 0); if (__pyx_t_5) { /* "healpy/src/_sphtools.pyx":519 * AI = ndarray2alm(ai, lmax, mmax) * if len(alm) == 1: * c_rotate_alm(AI[0], psi, theta, phi) # <<<<<<<<<<<<<< * del AI * else: */ rotate_alm((__pyx_v_AI[0]), __pyx_v_psi, __pyx_v_theta, __pyx_v_phi); /* "healpy/src/_sphtools.pyx":520 * if len(alm) == 1: * c_rotate_alm(AI[0], psi, theta, phi) * del AI # <<<<<<<<<<<<<< * else: * ag = np.ascontiguousarray(alm[1], dtype=np.complex128) */ delete __pyx_v_AI; goto __pyx_L10; } /*else*/ { /* "healpy/src/_sphtools.pyx":522 * del AI * else: * ag = np.ascontiguousarray(alm[1], dtype=np.complex128) # <<<<<<<<<<<<<< * ac = np.ascontiguousarray(alm[2], dtype=np.complex128) * AG = ndarray2alm(ag, lmax, mmax) */ __pyx_t_9 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __pyx_t_10 = __Pyx_PyObject_GetAttrStr(__pyx_t_9, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_t_9 = __Pyx_GetItemInt(__pyx_v_alm, 1, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_9); __pyx_t_11 = PyTuple_New(1); if (unlikely(!__pyx_t_11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_11); PyTuple_SET_ITEM(__pyx_t_11, 0, __pyx_t_9); __Pyx_GIVEREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_t_9 = PyDict_New(); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_complex128); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (PyDict_SetItem(__pyx_t_9, __pyx_n_s_dtype, __pyx_t_2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_PyObject_Call(__pyx_t_10, __pyx_t_11, __pyx_t_9); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 522; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0; __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __pyx_v_ag = __pyx_t_2; __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":523 * else: * ag = np.ascontiguousarray(alm[1], dtype=np.complex128) * ac = np.ascontiguousarray(alm[2], dtype=np.complex128) # <<<<<<<<<<<<<< * AG = ndarray2alm(ag, lmax, mmax) * AC = ndarray2alm(ac, lmax, mmax) */ __pyx_t_2 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_9 = __Pyx_PyObject_GetAttrStr(__pyx_t_2, __pyx_n_s_ascontiguousarray); if (unlikely(!__pyx_t_9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_9); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_GetItemInt(__pyx_v_alm, 2, long, 1, __Pyx_PyInt_From_long, 0, 0, 1); if (unlikely(__pyx_t_2 == NULL)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_2); __pyx_t_11 = PyTuple_New(1); if (unlikely(!__pyx_t_11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_11); PyTuple_SET_ITEM(__pyx_t_11, 0, __pyx_t_2); __Pyx_GIVEREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = PyDict_New(); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_10 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_10); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_10, __pyx_n_s_complex128); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_10); __pyx_t_10 = 0; if (PyDict_SetItem(__pyx_t_2, __pyx_n_s_dtype, __pyx_t_3) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_9, __pyx_t_11, __pyx_t_2); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 523; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_9); __pyx_t_9 = 0; __Pyx_DECREF(__pyx_t_11); __pyx_t_11 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_v_ac = __pyx_t_3; __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":524 * ag = np.ascontiguousarray(alm[1], dtype=np.complex128) * ac = np.ascontiguousarray(alm[2], dtype=np.complex128) * AG = ndarray2alm(ag, lmax, mmax) # <<<<<<<<<<<<<< * AC = ndarray2alm(ac, lmax, mmax) * c_rotate_alm(AI[0], AG[0], AC[0], psi, theta, phi) */ if (!(likely(((__pyx_v_ag) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_ag, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 524; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_14 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 524; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_13 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 524; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_15 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_v_ag), __pyx_t_14, __pyx_t_13); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 524; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_AG = __pyx_t_15; /* "healpy/src/_sphtools.pyx":525 * ac = np.ascontiguousarray(alm[2], dtype=np.complex128) * AG = ndarray2alm(ag, lmax, mmax) * AC = ndarray2alm(ac, lmax, mmax) # <<<<<<<<<<<<<< * c_rotate_alm(AI[0], AG[0], AC[0], psi, theta, phi) * del AI, AG, AC */ if (!(likely(((__pyx_v_ac) == Py_None) || likely(__Pyx_TypeTest(__pyx_v_ac, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 525; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = __Pyx_PyInt_As_int(__pyx_v_lmax); if (unlikely((__pyx_t_13 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 525; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_14 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_14 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 525; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_15 = __pyx_f_7_common_ndarray2alm(((PyArrayObject *)__pyx_v_ac), __pyx_t_13, __pyx_t_14); if (unlikely(PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 525; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_AC = __pyx_t_15; /* "healpy/src/_sphtools.pyx":526 * AG = ndarray2alm(ag, lmax, mmax) * AC = ndarray2alm(ac, lmax, mmax) * c_rotate_alm(AI[0], AG[0], AC[0], psi, theta, phi) # <<<<<<<<<<<<<< * del AI, AG, AC * */ rotate_alm((__pyx_v_AI[0]), (__pyx_v_AG[0]), (__pyx_v_AC[0]), __pyx_v_psi, __pyx_v_theta, __pyx_v_phi); /* "healpy/src/_sphtools.pyx":527 * AC = ndarray2alm(ac, lmax, mmax) * c_rotate_alm(AI[0], AG[0], AC[0], psi, theta, phi) * del AI, AG, AC # <<<<<<<<<<<<<< * * */ delete __pyx_v_AI; delete __pyx_v_AG; delete __pyx_v_AC; } __pyx_L10:; /* "healpy/src/_sphtools.pyx":472 * * * def rotate_alm(alm not None, double psi, double theta, double phi, lmax=None, # <<<<<<<<<<<<<< * mmax=None): * """ */ /* function exit code */ __pyx_r = Py_None; __Pyx_INCREF(Py_None); goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_2); __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_8); __Pyx_XDECREF(__pyx_t_9); __Pyx_XDECREF(__pyx_t_10); __Pyx_XDECREF(__pyx_t_11); __Pyx_AddTraceback("healpy._sphtools.rotate_alm", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF(__pyx_v_a); __Pyx_XDECREF(__pyx_v_ai); __Pyx_XDECREF(__pyx_v_ag); __Pyx_XDECREF(__pyx_v_ac); __Pyx_XDECREF(__pyx_v_alm); __Pyx_XDECREF(__pyx_v_lmax); __Pyx_XDECREF(__pyx_v_mmax); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":530 * * * cdef int alm_getn(int l, int m): # <<<<<<<<<<<<<< * if not m <= l: * raise ValueError("mmax must be <= lmax") */ static int __pyx_f_6healpy_9_sphtools_alm_getn(int __pyx_v_l, int __pyx_v_m) { int __pyx_r; __Pyx_RefNannyDeclarations int __pyx_t_1; PyObject *__pyx_t_2 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("alm_getn", 0); /* "healpy/src/_sphtools.pyx":531 * * cdef int alm_getn(int l, int m): * if not m <= l: # <<<<<<<<<<<<<< * raise ValueError("mmax must be <= lmax") * return ((m+1)*(m+2))/2 + (m+1)*(l-m) */ __pyx_t_1 = ((!((__pyx_v_m <= __pyx_v_l) != 0)) != 0); if (__pyx_t_1) { /* "healpy/src/_sphtools.pyx":532 * cdef int alm_getn(int l, int m): * if not m <= l: * raise ValueError("mmax must be <= lmax") # <<<<<<<<<<<<<< * return ((m+1)*(m+2))/2 + (m+1)*(l-m) * */ __pyx_t_2 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__9, NULL); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 532; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_Raise(__pyx_t_2, 0, 0, 0); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 532; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_sphtools.pyx":533 * if not m <= l: * raise ValueError("mmax must be <= lmax") * return ((m+1)*(m+2))/2 + (m+1)*(l-m) # <<<<<<<<<<<<<< * * */ __pyx_r = (__Pyx_div_long(((__pyx_v_m + 1) * (__pyx_v_m + 2)), 2) + ((__pyx_v_m + 1) * (__pyx_v_l - __pyx_v_m))); goto __pyx_L0; /* "healpy/src/_sphtools.pyx":530 * * * cdef int alm_getn(int l, int m): # <<<<<<<<<<<<<< * if not m <= l: * raise ValueError("mmax must be <= lmax") */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_2); __Pyx_WriteUnraisable("healpy._sphtools.alm_getn", __pyx_clineno, __pyx_lineno, __pyx_filename, 0); __pyx_r = 0; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":536 * * * def alm_getlmmax(a, lmax, mmax): # <<<<<<<<<<<<<< * if lmax is None: * if mmax is None: */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_15alm_getlmmax(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static PyMethodDef __pyx_mdef_6healpy_9_sphtools_15alm_getlmmax = {__Pyx_NAMESTR("alm_getlmmax"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_15alm_getlmmax, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(0)}; static PyObject *__pyx_pw_6healpy_9_sphtools_15alm_getlmmax(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_a = 0; PyObject *__pyx_v_lmax = 0; PyObject *__pyx_v_mmax = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("alm_getlmmax (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_a,&__pyx_n_s_lmax,&__pyx_n_s_mmax,0}; PyObject* values[3] = {0,0,0}; if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_a)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_lmax)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("alm_getlmmax", 1, 3, 3, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (likely((values[2] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_mmax)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("alm_getlmmax", 1, 3, 3, 2); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "alm_getlmmax") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else if (PyTuple_GET_SIZE(__pyx_args) != 3) { goto __pyx_L5_argtuple_error; } else { values[0] = PyTuple_GET_ITEM(__pyx_args, 0); values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[2] = PyTuple_GET_ITEM(__pyx_args, 2); } __pyx_v_a = values[0]; __pyx_v_lmax = values[1]; __pyx_v_mmax = values[2]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("alm_getlmmax", 1, 3, 3, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._sphtools.alm_getlmmax", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; __pyx_r = __pyx_pf_6healpy_9_sphtools_14alm_getlmmax(__pyx_self, __pyx_v_a, __pyx_v_lmax, __pyx_v_mmax); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_14alm_getlmmax(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_a, PyObject *__pyx_v_lmax, PyObject *__pyx_v_mmax) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; int __pyx_t_4; int __pyx_t_5; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("alm_getlmmax", 0); __Pyx_INCREF(__pyx_v_lmax); __Pyx_INCREF(__pyx_v_mmax); /* "healpy/src/_sphtools.pyx":537 * * def alm_getlmmax(a, lmax, mmax): * if lmax is None: # <<<<<<<<<<<<<< * if mmax is None: * lmax = alm_getlmax(a.size) */ __pyx_t_1 = (__pyx_v_lmax == Py_None); __pyx_t_2 = (__pyx_t_1 != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":538 * def alm_getlmmax(a, lmax, mmax): * if lmax is None: * if mmax is None: # <<<<<<<<<<<<<< * lmax = alm_getlmax(a.size) * mmax = lmax */ __pyx_t_2 = (__pyx_v_mmax == Py_None); __pyx_t_1 = (__pyx_t_2 != 0); if (__pyx_t_1) { /* "healpy/src/_sphtools.pyx":539 * if lmax is None: * if mmax is None: * lmax = alm_getlmax(a.size) # <<<<<<<<<<<<<< * mmax = lmax * else: */ __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_v_a, __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 539; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_4 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 539; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyInt_From_int(__pyx_f_6healpy_9_sphtools_alm_getlmax(__pyx_t_4)); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 539; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF_SET(__pyx_v_lmax, __pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_sphtools.pyx":540 * if mmax is None: * lmax = alm_getlmax(a.size) * mmax = lmax # <<<<<<<<<<<<<< * else: * lmax = alm_getlmax2(a.size, mmax) */ __Pyx_INCREF(__pyx_v_lmax); __Pyx_DECREF_SET(__pyx_v_mmax, __pyx_v_lmax); goto __pyx_L4; } /*else*/ { /* "healpy/src/_sphtools.pyx":542 * mmax = lmax * else: * lmax = alm_getlmax2(a.size, mmax) # <<<<<<<<<<<<<< * elif mmax is None: * mmax = lmax */ __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_v_a, __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 542; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_4 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 542; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_5 = __Pyx_PyInt_As_int(__pyx_v_mmax); if (unlikely((__pyx_t_5 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 542; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_3 = __Pyx_PyInt_From_int(__pyx_f_6healpy_9_sphtools_alm_getlmax2(__pyx_t_4, __pyx_t_5)); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 542; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF_SET(__pyx_v_lmax, __pyx_t_3); __pyx_t_3 = 0; } __pyx_L4:; goto __pyx_L3; } /* "healpy/src/_sphtools.pyx":543 * else: * lmax = alm_getlmax2(a.size, mmax) * elif mmax is None: # <<<<<<<<<<<<<< * mmax = lmax * return lmax, mmax */ __pyx_t_1 = (__pyx_v_mmax == Py_None); __pyx_t_2 = (__pyx_t_1 != 0); if (__pyx_t_2) { /* "healpy/src/_sphtools.pyx":544 * lmax = alm_getlmax2(a.size, mmax) * elif mmax is None: * mmax = lmax # <<<<<<<<<<<<<< * return lmax, mmax * */ __Pyx_INCREF(__pyx_v_lmax); __Pyx_DECREF_SET(__pyx_v_mmax, __pyx_v_lmax); goto __pyx_L3; } __pyx_L3:; /* "healpy/src/_sphtools.pyx":545 * elif mmax is None: * mmax = lmax * return lmax, mmax # <<<<<<<<<<<<<< * * */ __Pyx_XDECREF(__pyx_r); __pyx_t_3 = PyTuple_New(2); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 545; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_INCREF(__pyx_v_lmax); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_v_lmax); __Pyx_GIVEREF(__pyx_v_lmax); __Pyx_INCREF(__pyx_v_mmax); PyTuple_SET_ITEM(__pyx_t_3, 1, __pyx_v_mmax); __Pyx_GIVEREF(__pyx_v_mmax); __pyx_r = __pyx_t_3; __pyx_t_3 = 0; goto __pyx_L0; /* "healpy/src/_sphtools.pyx":536 * * * def alm_getlmmax(a, lmax, mmax): # <<<<<<<<<<<<<< * if lmax is None: * if mmax is None: */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_AddTraceback("healpy._sphtools.alm_getlmmax", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF(__pyx_v_lmax); __Pyx_XDECREF(__pyx_v_mmax); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":549 * * @cython.cdivision(True) * cdef inline int alm_getlmax(int s): # <<<<<<<<<<<<<< * cdef double x * x=(-3+np.sqrt(1+8*s))/2 */ static CYTHON_INLINE int __pyx_f_6healpy_9_sphtools_alm_getlmax(int __pyx_v_s) { double __pyx_v_x; int __pyx_r; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; PyObject *__pyx_t_2 = NULL; PyObject *__pyx_t_3 = NULL; double __pyx_t_4; int __pyx_t_5; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("alm_getlmax", 0); /* "healpy/src/_sphtools.pyx":551 * cdef inline int alm_getlmax(int s): * cdef double x * x=(-3+np.sqrt(1+8*s))/2 # <<<<<<<<<<<<<< * if x != floor(x): * return -1 */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_sqrt); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyInt_From_long((1 + (8 * __pyx_v_s))); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_3 = PyTuple_New(1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); PyTuple_SET_ITEM(__pyx_t_3, 0, __pyx_t_1); __Pyx_GIVEREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyObject_Call(__pyx_t_2, __pyx_t_3, NULL); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyNumber_Add(__pyx_int_neg_3, __pyx_t_1); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyNumber_Divide(__pyx_t_3, __pyx_int_2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_4 = __pyx_PyFloat_AsDouble(__pyx_t_1); if (unlikely((__pyx_t_4 == (double)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 551; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_x = __pyx_t_4; /* "healpy/src/_sphtools.pyx":552 * cdef double x * x=(-3+np.sqrt(1+8*s))/2 * if x != floor(x): # <<<<<<<<<<<<<< * return -1 * else: */ __pyx_t_5 = ((__pyx_v_x != floor(__pyx_v_x)) != 0); if (__pyx_t_5) { /* "healpy/src/_sphtools.pyx":553 * x=(-3+np.sqrt(1+8*s))/2 * if x != floor(x): * return -1 # <<<<<<<<<<<<<< * else: * return floor(x) */ __pyx_r = -1; goto __pyx_L0; } /*else*/ { /* "healpy/src/_sphtools.pyx":555 * return -1 * else: * return floor(x) # <<<<<<<<<<<<<< * * */ __pyx_r = ((int)floor(__pyx_v_x)); goto __pyx_L0; } /* "healpy/src/_sphtools.pyx":549 * * @cython.cdivision(True) * cdef inline int alm_getlmax(int s): # <<<<<<<<<<<<<< * cdef double x * x=(-3+np.sqrt(1+8*s))/2 */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_2); __Pyx_XDECREF(__pyx_t_3); __Pyx_WriteUnraisable("healpy._sphtools.alm_getlmax", __pyx_clineno, __pyx_lineno, __pyx_filename, 0); __pyx_r = 0; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":559 * * @cython.cdivision(True) * cdef inline int alm_getlmax2(int s, int mmax): # <<<<<<<<<<<<<< * cdef double x * x = (2 * s + mmax ** 2 - mmax - 2.) / (2 * mmax + 2.) */ static CYTHON_INLINE int __pyx_f_6healpy_9_sphtools_alm_getlmax2(int __pyx_v_s, int __pyx_v_mmax) { double __pyx_v_x; int __pyx_r; __Pyx_RefNannyDeclarations int __pyx_t_1; __Pyx_RefNannySetupContext("alm_getlmax2", 0); /* "healpy/src/_sphtools.pyx":561 * cdef inline int alm_getlmax2(int s, int mmax): * cdef double x * x = (2 * s + mmax ** 2 - mmax - 2.) / (2 * mmax + 2.) # <<<<<<<<<<<<<< * if x != floor(x): * return -1 */ __pyx_v_x = (((((2 * __pyx_v_s) + __Pyx_pow_long(((long)__pyx_v_mmax), 2)) - __pyx_v_mmax) - 2.) / ((2 * __pyx_v_mmax) + 2.)); /* "healpy/src/_sphtools.pyx":562 * cdef double x * x = (2 * s + mmax ** 2 - mmax - 2.) / (2 * mmax + 2.) * if x != floor(x): # <<<<<<<<<<<<<< * return -1 * else: */ __pyx_t_1 = ((__pyx_v_x != floor(__pyx_v_x)) != 0); if (__pyx_t_1) { /* "healpy/src/_sphtools.pyx":563 * x = (2 * s + mmax ** 2 - mmax - 2.) / (2 * mmax + 2.) * if x != floor(x): * return -1 # <<<<<<<<<<<<<< * else: * return floor(x) */ __pyx_r = -1; goto __pyx_L0; } /*else*/ { /* "healpy/src/_sphtools.pyx":565 * return -1 * else: * return floor(x) # <<<<<<<<<<<<<< * * */ __pyx_r = ((int)floor(__pyx_v_x)); goto __pyx_L0; } /* "healpy/src/_sphtools.pyx":559 * * @cython.cdivision(True) * cdef inline int alm_getlmax2(int s, int mmax): # <<<<<<<<<<<<<< * cdef double x * x = (2 * s + mmax ** 2 - mmax - 2.) / (2 * mmax + 2.) */ /* function exit code */ __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":569 * * @cython.cdivision(True) * cdef inline int alm_getidx(int lmax, int l, int m): # <<<<<<<<<<<<<< * return m*(2*lmax+1-m)/2+l * */ static CYTHON_INLINE int __pyx_f_6healpy_9_sphtools_alm_getidx(int __pyx_v_lmax, int __pyx_v_l, int __pyx_v_m) { int __pyx_r; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("alm_getidx", 0); /* "healpy/src/_sphtools.pyx":570 * @cython.cdivision(True) * cdef inline int alm_getidx(int lmax, int l, int m): * return m*(2*lmax+1-m)/2+l # <<<<<<<<<<<<<< * * */ __pyx_r = (((__pyx_v_m * (((2 * __pyx_v_lmax) + 1) - __pyx_v_m)) / 2) + __pyx_v_l); goto __pyx_L0; /* "healpy/src/_sphtools.pyx":569 * * @cython.cdivision(True) * cdef inline int alm_getidx(int lmax, int l, int m): # <<<<<<<<<<<<<< * return m*(2*lmax+1-m)/2+l * */ /* function exit code */ __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":575 * @cython.wraparound(False) * @cython.boundscheck(False) * cpdef mkmask(np.ndarray[double, ndim=1] m): # <<<<<<<<<<<<<< * cdef int nbad * cdef int size = m.size */ static PyObject *__pyx_pw_6healpy_9_sphtools_17mkmask(PyObject *__pyx_self, PyObject *__pyx_v_m); /*proto*/ static PyObject *__pyx_f_6healpy_9_sphtools_mkmask(PyArrayObject *__pyx_v_m, CYTHON_UNUSED int __pyx_skip_dispatch) { int __pyx_v_nbad; int __pyx_v_size; int __pyx_v_i; PyArrayObject *__pyx_v_mask = 0; __Pyx_LocalBuf_ND __pyx_pybuffernd_m; __Pyx_Buffer __pyx_pybuffer_m; __Pyx_LocalBuf_ND __pyx_pybuffernd_mask; __Pyx_Buffer __pyx_pybuffer_mask; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_t_2; int __pyx_t_3; PyObject *__pyx_t_4 = NULL; PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyArrayObject *__pyx_t_8 = NULL; PyObject *__pyx_t_9 = NULL; PyObject *__pyx_t_10 = NULL; PyObject *__pyx_t_11 = NULL; int __pyx_t_12; int __pyx_t_13; int __pyx_t_14; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("mkmask", 0); __pyx_pybuffer_mask.pybuffer.buf = NULL; __pyx_pybuffer_mask.refcount = 0; __pyx_pybuffernd_mask.data = NULL; __pyx_pybuffernd_mask.rcbuffer = &__pyx_pybuffer_mask; __pyx_pybuffer_m.pybuffer.buf = NULL; __pyx_pybuffer_m.refcount = 0; __pyx_pybuffernd_m.data = NULL; __pyx_pybuffernd_m.rcbuffer = &__pyx_pybuffer_m; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_m.rcbuffer->pybuffer, (PyObject*)__pyx_v_m, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 575; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_m.diminfo[0].strides = __pyx_pybuffernd_m.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_m.diminfo[0].shape = __pyx_pybuffernd_m.rcbuffer->pybuffer.shape[0]; /* "healpy/src/_sphtools.pyx":577 * cpdef mkmask(np.ndarray[double, ndim=1] m): * cdef int nbad * cdef int size = m.size # <<<<<<<<<<<<<< * cdef int i * # first, count number of bad pixels, to see if allocating a mask is needed */ __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_m), __pyx_n_s_size); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 577; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __Pyx_PyInt_As_int(__pyx_t_1); if (unlikely((__pyx_t_2 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 577; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_v_size = __pyx_t_2; /* "healpy/src/_sphtools.pyx":580 * cdef int i * # first, count number of bad pixels, to see if allocating a mask is needed * nbad = count_bad(m) # <<<<<<<<<<<<<< * cdef np.ndarray[np.int8_t, ndim=1] mask * #cdef np.ndarray[double, ndim=1] m_ */ __pyx_v_nbad = __pyx_f_6healpy_9_sphtools_count_bad(((PyArrayObject *)__pyx_v_m), 0); /* "healpy/src/_sphtools.pyx":583 * cdef np.ndarray[np.int8_t, ndim=1] mask * #cdef np.ndarray[double, ndim=1] m_ * if nbad == 0: # <<<<<<<<<<<<<< * return False * else: */ __pyx_t_3 = ((__pyx_v_nbad == 0) != 0); if (__pyx_t_3) { /* "healpy/src/_sphtools.pyx":584 * #cdef np.ndarray[double, ndim=1] m_ * if nbad == 0: * return False # <<<<<<<<<<<<<< * else: * mask = np.zeros(size, dtype = np.int8) */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(Py_False); __pyx_r = Py_False; goto __pyx_L0; } /*else*/ { /* "healpy/src/_sphtools.pyx":586 * return False * else: * mask = np.zeros(size, dtype = np.int8) # <<<<<<<<<<<<<< * #m_ = m * for i in range(size): */ __pyx_t_1 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_1, __pyx_n_s_zeros); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_v_size); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_1); __Pyx_GIVEREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_6 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_t_6, __pyx_n_s_int8); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; if (PyDict_SetItem(__pyx_t_1, __pyx_n_s_dtype, __pyx_t_7) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_5, __pyx_t_1); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; if (!(likely(((__pyx_t_7) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_7, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_8 = ((PyArrayObject *)__pyx_t_7); { __Pyx_BufFmt_StackElem __pyx_stack[1]; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_mask.rcbuffer->pybuffer); __pyx_t_2 = __Pyx_GetBufferAndValidate(&__pyx_pybuffernd_mask.rcbuffer->pybuffer, (PyObject*)__pyx_t_8, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int8_t, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack); if (unlikely(__pyx_t_2 < 0)) { PyErr_Fetch(&__pyx_t_9, &__pyx_t_10, &__pyx_t_11); if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_mask.rcbuffer->pybuffer, (PyObject*)__pyx_v_mask, &__Pyx_TypeInfo_nn___pyx_t_5numpy_int8_t, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack) == -1)) { Py_XDECREF(__pyx_t_9); Py_XDECREF(__pyx_t_10); Py_XDECREF(__pyx_t_11); __Pyx_RaiseBufferFallbackError(); } else { PyErr_Restore(__pyx_t_9, __pyx_t_10, __pyx_t_11); } } __pyx_pybuffernd_mask.diminfo[0].strides = __pyx_pybuffernd_mask.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_mask.diminfo[0].shape = __pyx_pybuffernd_mask.rcbuffer->pybuffer.shape[0]; if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 586; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_8 = 0; __pyx_v_mask = ((PyArrayObject *)__pyx_t_7); __pyx_t_7 = 0; /* "healpy/src/_sphtools.pyx":588 * mask = np.zeros(size, dtype = np.int8) * #m_ = m * for i in range(size): # <<<<<<<<<<<<<< * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: * mask[i] = 1 */ __pyx_t_2 = __pyx_v_size; for (__pyx_t_12 = 0; __pyx_t_12 < __pyx_t_2; __pyx_t_12+=1) { __pyx_v_i = __pyx_t_12; /* "healpy/src/_sphtools.pyx":589 * #m_ = m * for i in range(size): * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: # <<<<<<<<<<<<<< * mask[i] = 1 * mask.dtype = bool */ __pyx_t_13 = __pyx_v_i; __pyx_t_3 = ((fabs(((*__Pyx_BufPtrStrided1d(double *, __pyx_pybuffernd_m.rcbuffer->pybuffer.buf, __pyx_t_13, __pyx_pybuffernd_m.diminfo[0].strides)) - __pyx_v_6healpy_9_sphtools_UNSEEN)) < __pyx_v_6healpy_9_sphtools_rtol_UNSEEN) != 0); if (__pyx_t_3) { /* "healpy/src/_sphtools.pyx":590 * for i in range(size): * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: * mask[i] = 1 # <<<<<<<<<<<<<< * mask.dtype = bool * return mask */ __pyx_t_14 = __pyx_v_i; *__Pyx_BufPtrStrided1d(__pyx_t_5numpy_int8_t *, __pyx_pybuffernd_mask.rcbuffer->pybuffer.buf, __pyx_t_14, __pyx_pybuffernd_mask.diminfo[0].strides) = 1; goto __pyx_L6; } __pyx_L6:; } } /* "healpy/src/_sphtools.pyx":591 * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: * mask[i] = 1 * mask.dtype = bool # <<<<<<<<<<<<<< * return mask * */ if (__Pyx_PyObject_SetAttrStr(((PyObject *)__pyx_v_mask), __pyx_n_s_dtype, ((PyObject*)&PyBool_Type)) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 591; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":592 * mask[i] = 1 * mask.dtype = bool * return mask # <<<<<<<<<<<<<< * * @cython.wraparound(False) */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_mask)); __pyx_r = ((PyObject *)__pyx_v_mask); goto __pyx_L0; /* "healpy/src/_sphtools.pyx":575 * @cython.wraparound(False) * @cython.boundscheck(False) * cpdef mkmask(np.ndarray[double, ndim=1] m): # <<<<<<<<<<<<<< * cdef int nbad * cdef int size = m.size */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_mask.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._sphtools.mkmask", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_mask.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_mask); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_17mkmask(PyObject *__pyx_self, PyObject *__pyx_v_m); /*proto*/ static PyObject *__pyx_pw_6healpy_9_sphtools_17mkmask(PyObject *__pyx_self, PyObject *__pyx_v_m) { CYTHON_UNUSED int __pyx_lineno = 0; CYTHON_UNUSED const char *__pyx_filename = NULL; CYTHON_UNUSED int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("mkmask (wrapper)", 0); if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_m), __pyx_ptype_5numpy_ndarray, 1, "m", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 575; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_r = __pyx_pf_6healpy_9_sphtools_16mkmask(__pyx_self, ((PyArrayObject *)__pyx_v_m)); /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_16mkmask(CYTHON_UNUSED PyObject *__pyx_self, PyArrayObject *__pyx_v_m) { __Pyx_LocalBuf_ND __pyx_pybuffernd_m; __Pyx_Buffer __pyx_pybuffer_m; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("mkmask", 0); __pyx_pybuffer_m.pybuffer.buf = NULL; __pyx_pybuffer_m.refcount = 0; __pyx_pybuffernd_m.data = NULL; __pyx_pybuffernd_m.rcbuffer = &__pyx_pybuffer_m; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_m.rcbuffer->pybuffer, (PyObject*)__pyx_v_m, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 575; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_m.diminfo[0].strides = __pyx_pybuffernd_m.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_m.diminfo[0].shape = __pyx_pybuffernd_m.rcbuffer->pybuffer.shape[0]; __Pyx_XDECREF(__pyx_r); __pyx_t_1 = __pyx_f_6healpy_9_sphtools_mkmask(__pyx_v_m, 0); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 575; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._sphtools.mkmask", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_sphtools.pyx":596 * @cython.wraparound(False) * @cython.boundscheck(False) * cpdef int count_bad(np.ndarray[double, ndim=1] m): # <<<<<<<<<<<<<< * cdef int i * cdef int nbad = 0 */ static PyObject *__pyx_pw_6healpy_9_sphtools_19count_bad(PyObject *__pyx_self, PyObject *__pyx_v_m); /*proto*/ static int __pyx_f_6healpy_9_sphtools_count_bad(PyArrayObject *__pyx_v_m, CYTHON_UNUSED int __pyx_skip_dispatch) { int __pyx_v_i; int __pyx_v_nbad; CYTHON_UNUSED PyObject *__pyx_v_size = 0; __Pyx_LocalBuf_ND __pyx_pybuffernd_m; __Pyx_Buffer __pyx_pybuffer_m; int __pyx_r; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; long __pyx_t_2; int __pyx_t_3; int __pyx_t_4; int __pyx_t_5; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("count_bad", 0); __pyx_pybuffer_m.pybuffer.buf = NULL; __pyx_pybuffer_m.refcount = 0; __pyx_pybuffernd_m.data = NULL; __pyx_pybuffernd_m.rcbuffer = &__pyx_pybuffer_m; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_m.rcbuffer->pybuffer, (PyObject*)__pyx_v_m, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 596; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_m.diminfo[0].strides = __pyx_pybuffernd_m.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_m.diminfo[0].shape = __pyx_pybuffernd_m.rcbuffer->pybuffer.shape[0]; /* "healpy/src/_sphtools.pyx":598 * cpdef int count_bad(np.ndarray[double, ndim=1] m): * cdef int i * cdef int nbad = 0 # <<<<<<<<<<<<<< * cdef size = m.size * for i in xrange(m.size): */ __pyx_v_nbad = 0; /* "healpy/src/_sphtools.pyx":599 * cdef int i * cdef int nbad = 0 * cdef size = m.size # <<<<<<<<<<<<<< * for i in xrange(m.size): * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: */ __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_m), __pyx_n_s_size); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 599; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_v_size = __pyx_t_1; __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":600 * cdef int nbad = 0 * cdef size = m.size * for i in xrange(m.size): # <<<<<<<<<<<<<< * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: * nbad += 1 */ __pyx_t_1 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_m), __pyx_n_s_size); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 600; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_t_2 = __Pyx_PyInt_As_long(__pyx_t_1); if (unlikely((__pyx_t_2 == (long)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 600; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; for (__pyx_t_3 = 0; __pyx_t_3 < __pyx_t_2; __pyx_t_3+=1) { __pyx_v_i = __pyx_t_3; /* "healpy/src/_sphtools.pyx":601 * cdef size = m.size * for i in xrange(m.size): * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: # <<<<<<<<<<<<<< * nbad += 1 * return nbad */ __pyx_t_4 = __pyx_v_i; __pyx_t_5 = ((fabs(((*__Pyx_BufPtrStrided1d(double *, __pyx_pybuffernd_m.rcbuffer->pybuffer.buf, __pyx_t_4, __pyx_pybuffernd_m.diminfo[0].strides)) - __pyx_v_6healpy_9_sphtools_UNSEEN)) < __pyx_v_6healpy_9_sphtools_rtol_UNSEEN) != 0); if (__pyx_t_5) { /* "healpy/src/_sphtools.pyx":602 * for i in xrange(m.size): * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: * nbad += 1 # <<<<<<<<<<<<<< * return nbad */ __pyx_v_nbad = (__pyx_v_nbad + 1); goto __pyx_L5; } __pyx_L5:; } /* "healpy/src/_sphtools.pyx":603 * if fabs(m[i] - UNSEEN) < rtol_UNSEEN: * nbad += 1 * return nbad # <<<<<<<<<<<<<< */ __pyx_r = __pyx_v_nbad; goto __pyx_L0; /* "healpy/src/_sphtools.pyx":596 * @cython.wraparound(False) * @cython.boundscheck(False) * cpdef int count_bad(np.ndarray[double, ndim=1] m): # <<<<<<<<<<<<<< * cdef int i * cdef int nbad = 0 */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_WriteUnraisable("healpy._sphtools.count_bad", __pyx_clineno, __pyx_lineno, __pyx_filename, 0); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF(__pyx_v_size); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* Python wrapper */ static PyObject *__pyx_pw_6healpy_9_sphtools_19count_bad(PyObject *__pyx_self, PyObject *__pyx_v_m); /*proto*/ static PyObject *__pyx_pw_6healpy_9_sphtools_19count_bad(PyObject *__pyx_self, PyObject *__pyx_v_m) { CYTHON_UNUSED int __pyx_lineno = 0; CYTHON_UNUSED const char *__pyx_filename = NULL; CYTHON_UNUSED int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("count_bad (wrapper)", 0); if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_m), __pyx_ptype_5numpy_ndarray, 1, "m", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 596; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_r = __pyx_pf_6healpy_9_sphtools_18count_bad(__pyx_self, ((PyArrayObject *)__pyx_v_m)); /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_9_sphtools_18count_bad(CYTHON_UNUSED PyObject *__pyx_self, PyArrayObject *__pyx_v_m) { __Pyx_LocalBuf_ND __pyx_pybuffernd_m; __Pyx_Buffer __pyx_pybuffer_m; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("count_bad", 0); __pyx_pybuffer_m.pybuffer.buf = NULL; __pyx_pybuffer_m.refcount = 0; __pyx_pybuffernd_m.data = NULL; __pyx_pybuffernd_m.rcbuffer = &__pyx_pybuffer_m; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_m.rcbuffer->pybuffer, (PyObject*)__pyx_v_m, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 596; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_m.diminfo[0].strides = __pyx_pybuffernd_m.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_m.diminfo[0].shape = __pyx_pybuffernd_m.rcbuffer->pybuffer.shape[0]; __Pyx_XDECREF(__pyx_r); __pyx_t_1 = __Pyx_PyInt_From_int(__pyx_f_6healpy_9_sphtools_count_bad(__pyx_v_m, 0)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 596; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._sphtools.count_bad", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_m.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "_common.pxd":123 * tsize Num_Alms (int l, int m) * * cdef inline Healpix_Map[double]* ndarray2map(np.ndarray[np.float64_t, ndim=1, mode='c'] array, Healpix_Ordering_Scheme scheme) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as a Healpix Map. """ * # To ensure that the output map is a view of the input array, the latter */ static CYTHON_INLINE Healpix_Map *__pyx_f_7_common_ndarray2map(PyArrayObject *__pyx_v_array, enum Healpix_Ordering_Scheme __pyx_v_scheme) { arr *__pyx_v_a; Healpix_Map *__pyx_v_map; __Pyx_LocalBuf_ND __pyx_pybuffernd_array; __Pyx_Buffer __pyx_pybuffer_array; Healpix_Map *__pyx_r; __Pyx_RefNannyDeclarations long __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; size_t __pyx_t_4; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("ndarray2map", 0); __pyx_pybuffer_array.pybuffer.buf = NULL; __pyx_pybuffer_array.refcount = 0; __pyx_pybuffernd_array.data = NULL; __pyx_pybuffernd_array.rcbuffer = &__pyx_pybuffer_array; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_array.rcbuffer->pybuffer, (PyObject*)__pyx_v_array, &__Pyx_TypeInfo_nn___pyx_t_5numpy_float64_t, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 123; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_array.diminfo[0].strides = __pyx_pybuffernd_array.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_array.diminfo[0].shape = __pyx_pybuffernd_array.rcbuffer->pybuffer.shape[0]; /* "_common.pxd":128 * # is forced to be contiguous, of correct type and dimensions (otherwise, an * # exception is raised). * cdef arr[double] *a = new arr[double](&array[0], array.size) # <<<<<<<<<<<<<< * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) */ __pyx_t_1 = 0; __pyx_t_2 = -1; if (__pyx_t_1 < 0) { __pyx_t_1 += __pyx_pybuffernd_array.diminfo[0].shape; if (unlikely(__pyx_t_1 < 0)) __pyx_t_2 = 0; } else if (unlikely(__pyx_t_1 >= __pyx_pybuffernd_array.diminfo[0].shape)) __pyx_t_2 = 0; if (unlikely(__pyx_t_2 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_2); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_array), __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_size_t(__pyx_t_3); if (unlikely((__pyx_t_4 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_a = new arr((&(*__Pyx_BufPtrCContig1d(__pyx_t_5numpy_float64_t *, __pyx_pybuffernd_array.rcbuffer->pybuffer.buf, __pyx_t_1, __pyx_pybuffernd_array.diminfo[0].strides))), __pyx_t_4); /* "_common.pxd":129 * # exception is raised). * cdef arr[double] *a = new arr[double](&array[0], array.size) * cdef Healpix_Map[double] *map = new Healpix_Map[double]() # <<<<<<<<<<<<<< * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated */ __pyx_v_map = new Healpix_Map(); /* "_common.pxd":130 * cdef arr[double] *a = new arr[double](&array[0], array.size) * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) # <<<<<<<<<<<<<< * del a # a does not own its buffer, so it won't be deallocated * return map */ __pyx_v_map->Set((__pyx_v_a[0]), __pyx_v_scheme); /* "_common.pxd":131 * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated # <<<<<<<<<<<<<< * return map * */ delete __pyx_v_a; /* "_common.pxd":132 * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated * return map # <<<<<<<<<<<<<< * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: */ __pyx_r = __pyx_v_map; goto __pyx_L0; /* "_common.pxd":123 * tsize Num_Alms (int l, int m) * * cdef inline Healpix_Map[double]* ndarray2map(np.ndarray[np.float64_t, ndim=1, mode='c'] array, Healpix_Ordering_Scheme scheme) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as a Healpix Map. """ * # To ensure that the output map is a view of the input array, the latter */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("_common.ndarray2map", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __pyx_L2:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "_common.pxd":134 * return map * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) */ static CYTHON_INLINE Alm > *__pyx_f_7_common_ndarray2alm(PyArrayObject *__pyx_v_array, int __pyx_v_lmax, int __pyx_v_mmax) { arr > *__pyx_v_a; Alm > *__pyx_v_alm; __Pyx_LocalBuf_ND __pyx_pybuffernd_array; __Pyx_Buffer __pyx_pybuffer_array; Alm > *__pyx_r; __Pyx_RefNannyDeclarations long __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; size_t __pyx_t_4; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("ndarray2alm", 0); __pyx_pybuffer_array.pybuffer.buf = NULL; __pyx_pybuffer_array.refcount = 0; __pyx_pybuffernd_array.data = NULL; __pyx_pybuffernd_array.rcbuffer = &__pyx_pybuffer_array; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_array.rcbuffer->pybuffer, (PyObject*)__pyx_v_array, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 134; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_array.diminfo[0].strides = __pyx_pybuffernd_array.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_array.diminfo[0].shape = __pyx_pybuffernd_array.rcbuffer->pybuffer.shape[0]; /* "_common.pxd":136 * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) # <<<<<<<<<<<<<< * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) */ __pyx_t_1 = 0; __pyx_t_2 = -1; if (__pyx_t_1 < 0) { __pyx_t_1 += __pyx_pybuffernd_array.diminfo[0].shape; if (unlikely(__pyx_t_1 < 0)) __pyx_t_2 = 0; } else if (unlikely(__pyx_t_1 >= __pyx_pybuffernd_array.diminfo[0].shape)) __pyx_t_2 = 0; if (unlikely(__pyx_t_2 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_2); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_array), __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_size_t(__pyx_t_3); if (unlikely((__pyx_t_4 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_a = new arr >(((xcomplex *)(&(*__Pyx_BufPtrCContig1d(__pyx_t_double_complex *, __pyx_pybuffernd_array.rcbuffer->pybuffer.buf, __pyx_t_1, __pyx_pybuffernd_array.diminfo[0].strides)))), __pyx_t_4); /* "_common.pxd":137 * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() # <<<<<<<<<<<<<< * alm.Set(a[0], lmax, mmax) * del a */ __pyx_v_alm = new Alm >(); /* "_common.pxd":138 * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) # <<<<<<<<<<<<<< * del a * return alm */ __pyx_v_alm->Set((__pyx_v_a[0]), __pyx_v_lmax, __pyx_v_mmax); /* "_common.pxd":139 * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) * del a # <<<<<<<<<<<<<< * return alm */ delete __pyx_v_a; /* "_common.pxd":140 * alm.Set(a[0], lmax, mmax) * del a * return alm # <<<<<<<<<<<<<< */ __pyx_r = __pyx_v_alm; goto __pyx_L0; /* "_common.pxd":134 * return map * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("_common.ndarray2alm", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __pyx_L2:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":194 * # experimental exception made for __getbuffer__ and __releasebuffer__ * # -- the details of this may change. * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<< * # This implementation of getbuffer is geared towards Cython * # requirements, and does not yet fullfill the PEP. */ /* Python wrapper */ static CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /*proto*/ static CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) { int __pyx_r; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__getbuffer__ (wrapper)", 0); __pyx_r = __pyx_pf_5numpy_7ndarray___getbuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info), ((int)__pyx_v_flags)); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) { int __pyx_v_copy_shape; int __pyx_v_i; int __pyx_v_ndim; int __pyx_v_endian_detector; int __pyx_v_little_endian; int __pyx_v_t; char *__pyx_v_f; PyArray_Descr *__pyx_v_descr = 0; int __pyx_v_offset; int __pyx_v_hasfields; int __pyx_r; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; int __pyx_t_3; PyObject *__pyx_t_4 = NULL; int __pyx_t_5; int __pyx_t_6; int __pyx_t_7; PyObject *__pyx_t_8 = NULL; char *__pyx_t_9; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("__getbuffer__", 0); if (__pyx_v_info != NULL) { __pyx_v_info->obj = Py_None; __Pyx_INCREF(Py_None); __Pyx_GIVEREF(__pyx_v_info->obj); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":200 * # of flags * * if info == NULL: return # <<<<<<<<<<<<<< * * cdef int copy_shape, i, ndim */ __pyx_t_1 = ((__pyx_v_info == NULL) != 0); if (__pyx_t_1) { __pyx_r = 0; goto __pyx_L0; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":203 * * cdef int copy_shape, i, ndim * cdef int endian_detector = 1 # <<<<<<<<<<<<<< * cdef bint little_endian = ((&endian_detector)[0] != 0) * */ __pyx_v_endian_detector = 1; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":204 * cdef int copy_shape, i, ndim * cdef int endian_detector = 1 * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<< * * ndim = PyArray_NDIM(self) */ __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":206 * cdef bint little_endian = ((&endian_detector)[0] != 0) * * ndim = PyArray_NDIM(self) # <<<<<<<<<<<<<< * * if sizeof(npy_intp) != sizeof(Py_ssize_t): */ __pyx_v_ndim = PyArray_NDIM(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":208 * ndim = PyArray_NDIM(self) * * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<< * copy_shape = 1 * else: */ __pyx_t_1 = (((sizeof(npy_intp)) != (sizeof(Py_ssize_t))) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":209 * * if sizeof(npy_intp) != sizeof(Py_ssize_t): * copy_shape = 1 # <<<<<<<<<<<<<< * else: * copy_shape = 0 */ __pyx_v_copy_shape = 1; goto __pyx_L4; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":211 * copy_shape = 1 * else: * copy_shape = 0 # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) */ __pyx_v_copy_shape = 0; } __pyx_L4:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":213 * copy_shape = 0 * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) # <<<<<<<<<<<<<< * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") */ __pyx_t_1 = (((__pyx_v_flags & PyBUF_C_CONTIGUOUS) == PyBUF_C_CONTIGUOUS) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":214 * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): # <<<<<<<<<<<<<< * raise ValueError(u"ndarray is not C contiguous") * */ __pyx_t_2 = ((!(PyArray_CHKFLAGS(__pyx_v_self, NPY_C_CONTIGUOUS) != 0)) != 0); __pyx_t_3 = __pyx_t_2; } else { __pyx_t_3 = __pyx_t_1; } if (__pyx_t_3) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":215 * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__10, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":217 * raise ValueError(u"ndarray is not C contiguous") * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) # <<<<<<<<<<<<<< * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") */ __pyx_t_3 = (((__pyx_v_flags & PyBUF_F_CONTIGUOUS) == PyBUF_F_CONTIGUOUS) != 0); if (__pyx_t_3) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":218 * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): # <<<<<<<<<<<<<< * raise ValueError(u"ndarray is not Fortran contiguous") * */ __pyx_t_1 = ((!(PyArray_CHKFLAGS(__pyx_v_self, NPY_F_CONTIGUOUS) != 0)) != 0); __pyx_t_2 = __pyx_t_1; } else { __pyx_t_2 = __pyx_t_3; } if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":219 * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") # <<<<<<<<<<<<<< * * info.buf = PyArray_DATA(self) */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__11, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":221 * raise ValueError(u"ndarray is not Fortran contiguous") * * info.buf = PyArray_DATA(self) # <<<<<<<<<<<<<< * info.ndim = ndim * if copy_shape: */ __pyx_v_info->buf = PyArray_DATA(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":222 * * info.buf = PyArray_DATA(self) * info.ndim = ndim # <<<<<<<<<<<<<< * if copy_shape: * # Allocate new buffer for strides and shape info. */ __pyx_v_info->ndim = __pyx_v_ndim; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":223 * info.buf = PyArray_DATA(self) * info.ndim = ndim * if copy_shape: # <<<<<<<<<<<<<< * # Allocate new buffer for strides and shape info. * # This is allocated as one block, strides first. */ __pyx_t_2 = (__pyx_v_copy_shape != 0); if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":226 * # Allocate new buffer for strides and shape info. * # This is allocated as one block, strides first. * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) # <<<<<<<<<<<<<< * info.shape = info.strides + ndim * for i in range(ndim): */ __pyx_v_info->strides = ((Py_ssize_t *)malloc((((sizeof(Py_ssize_t)) * ((size_t)__pyx_v_ndim)) * 2))); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":227 * # This is allocated as one block, strides first. * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) * info.shape = info.strides + ndim # <<<<<<<<<<<<<< * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] */ __pyx_v_info->shape = (__pyx_v_info->strides + __pyx_v_ndim); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":228 * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) * info.shape = info.strides + ndim * for i in range(ndim): # <<<<<<<<<<<<<< * info.strides[i] = PyArray_STRIDES(self)[i] * info.shape[i] = PyArray_DIMS(self)[i] */ __pyx_t_5 = __pyx_v_ndim; for (__pyx_t_6 = 0; __pyx_t_6 < __pyx_t_5; __pyx_t_6+=1) { __pyx_v_i = __pyx_t_6; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":229 * info.shape = info.strides + ndim * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] # <<<<<<<<<<<<<< * info.shape[i] = PyArray_DIMS(self)[i] * else: */ (__pyx_v_info->strides[__pyx_v_i]) = (PyArray_STRIDES(__pyx_v_self)[__pyx_v_i]); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":230 * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] * info.shape[i] = PyArray_DIMS(self)[i] # <<<<<<<<<<<<<< * else: * info.strides = PyArray_STRIDES(self) */ (__pyx_v_info->shape[__pyx_v_i]) = (PyArray_DIMS(__pyx_v_self)[__pyx_v_i]); } goto __pyx_L7; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":232 * info.shape[i] = PyArray_DIMS(self)[i] * else: * info.strides = PyArray_STRIDES(self) # <<<<<<<<<<<<<< * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL */ __pyx_v_info->strides = ((Py_ssize_t *)PyArray_STRIDES(__pyx_v_self)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":233 * else: * info.strides = PyArray_STRIDES(self) * info.shape = PyArray_DIMS(self) # <<<<<<<<<<<<<< * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) */ __pyx_v_info->shape = ((Py_ssize_t *)PyArray_DIMS(__pyx_v_self)); } __pyx_L7:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":234 * info.strides = PyArray_STRIDES(self) * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL # <<<<<<<<<<<<<< * info.itemsize = PyArray_ITEMSIZE(self) * info.readonly = not PyArray_ISWRITEABLE(self) */ __pyx_v_info->suboffsets = NULL; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":235 * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) # <<<<<<<<<<<<<< * info.readonly = not PyArray_ISWRITEABLE(self) * */ __pyx_v_info->itemsize = PyArray_ITEMSIZE(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":236 * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) * info.readonly = not PyArray_ISWRITEABLE(self) # <<<<<<<<<<<<<< * * cdef int t */ __pyx_v_info->readonly = (!(PyArray_ISWRITEABLE(__pyx_v_self) != 0)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":239 * * cdef int t * cdef char* f = NULL # <<<<<<<<<<<<<< * cdef dtype descr = self.descr * cdef list stack */ __pyx_v_f = NULL; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":240 * cdef int t * cdef char* f = NULL * cdef dtype descr = self.descr # <<<<<<<<<<<<<< * cdef list stack * cdef int offset */ __pyx_t_4 = ((PyObject *)__pyx_v_self->descr); __Pyx_INCREF(__pyx_t_4); __pyx_v_descr = ((PyArray_Descr *)__pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":244 * cdef int offset * * cdef bint hasfields = PyDataType_HASFIELDS(descr) # <<<<<<<<<<<<<< * * if not hasfields and not copy_shape: */ __pyx_v_hasfields = PyDataType_HASFIELDS(__pyx_v_descr); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":246 * cdef bint hasfields = PyDataType_HASFIELDS(descr) * * if not hasfields and not copy_shape: # <<<<<<<<<<<<<< * # do not call releasebuffer * info.obj = None */ __pyx_t_2 = ((!(__pyx_v_hasfields != 0)) != 0); if (__pyx_t_2) { __pyx_t_3 = ((!(__pyx_v_copy_shape != 0)) != 0); __pyx_t_1 = __pyx_t_3; } else { __pyx_t_1 = __pyx_t_2; } if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":248 * if not hasfields and not copy_shape: * # do not call releasebuffer * info.obj = None # <<<<<<<<<<<<<< * else: * # need to call releasebuffer */ __Pyx_INCREF(Py_None); __Pyx_GIVEREF(Py_None); __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = Py_None; goto __pyx_L10; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":251 * else: * # need to call releasebuffer * info.obj = self # <<<<<<<<<<<<<< * * if not hasfields: */ __Pyx_INCREF(((PyObject *)__pyx_v_self)); __Pyx_GIVEREF(((PyObject *)__pyx_v_self)); __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = ((PyObject *)__pyx_v_self); } __pyx_L10:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":253 * info.obj = self * * if not hasfields: # <<<<<<<<<<<<<< * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or */ __pyx_t_1 = ((!(__pyx_v_hasfields != 0)) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":254 * * if not hasfields: * t = descr.type_num # <<<<<<<<<<<<<< * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): */ __pyx_t_5 = __pyx_v_descr->type_num; __pyx_v_t = __pyx_t_5; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":255 * if not hasfields: * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<< * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") */ __pyx_t_1 = ((__pyx_v_descr->byteorder == '>') != 0); if (__pyx_t_1) { __pyx_t_2 = (__pyx_v_little_endian != 0); } else { __pyx_t_2 = __pyx_t_1; } if (!__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":256 * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<< * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" */ __pyx_t_1 = ((__pyx_v_descr->byteorder == '<') != 0); if (__pyx_t_1) { __pyx_t_3 = ((!(__pyx_v_little_endian != 0)) != 0); __pyx_t_7 = __pyx_t_3; } else { __pyx_t_7 = __pyx_t_1; } __pyx_t_1 = __pyx_t_7; } else { __pyx_t_1 = __pyx_t_2; } if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":257 * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__12, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":274 * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ switch (__pyx_v_t) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":258 * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" # <<<<<<<<<<<<<< * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" */ case NPY_BYTE: __pyx_v_f = __pyx_k_b; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":259 * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" # <<<<<<<<<<<<<< * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" */ case NPY_UBYTE: __pyx_v_f = __pyx_k_B; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":260 * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" # <<<<<<<<<<<<<< * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" */ case NPY_SHORT: __pyx_v_f = __pyx_k_h; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":261 * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" # <<<<<<<<<<<<<< * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" */ case NPY_USHORT: __pyx_v_f = __pyx_k_H; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":262 * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" # <<<<<<<<<<<<<< * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" */ case NPY_INT: __pyx_v_f = __pyx_k_i; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":263 * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" # <<<<<<<<<<<<<< * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" */ case NPY_UINT: __pyx_v_f = __pyx_k_I; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":264 * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" # <<<<<<<<<<<<<< * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" */ case NPY_LONG: __pyx_v_f = __pyx_k_l; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":265 * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" # <<<<<<<<<<<<<< * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" */ case NPY_ULONG: __pyx_v_f = __pyx_k_L; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":266 * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" # <<<<<<<<<<<<<< * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" */ case NPY_LONGLONG: __pyx_v_f = __pyx_k_q; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":267 * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" # <<<<<<<<<<<<<< * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" */ case NPY_ULONGLONG: __pyx_v_f = __pyx_k_Q; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":268 * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" # <<<<<<<<<<<<<< * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" */ case NPY_FLOAT: __pyx_v_f = __pyx_k_f; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":269 * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" # <<<<<<<<<<<<<< * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" */ case NPY_DOUBLE: __pyx_v_f = __pyx_k_d; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":270 * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" # <<<<<<<<<<<<<< * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" */ case NPY_LONGDOUBLE: __pyx_v_f = __pyx_k_g; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":271 * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" # <<<<<<<<<<<<<< * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" */ case NPY_CFLOAT: __pyx_v_f = __pyx_k_Zf; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":272 * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" # <<<<<<<<<<<<<< * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" */ case NPY_CDOUBLE: __pyx_v_f = __pyx_k_Zd; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":273 * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" # <<<<<<<<<<<<<< * elif t == NPY_OBJECT: f = "O" * else: */ case NPY_CLONGDOUBLE: __pyx_v_f = __pyx_k_Zg; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":274 * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ case NPY_OBJECT: __pyx_v_f = __pyx_k_O; break; default: /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":276 * elif t == NPY_OBJECT: f = "O" * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) # <<<<<<<<<<<<<< * info.format = f * return */ __pyx_t_4 = __Pyx_PyInt_From_int(__pyx_v_t); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_8 = PyUnicode_Format(__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_t_4); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_4, NULL); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_Raise(__pyx_t_8, 0, 0, 0); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} break; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":277 * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * info.format = f # <<<<<<<<<<<<<< * return * else: */ __pyx_v_info->format = __pyx_v_f; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":278 * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * info.format = f * return # <<<<<<<<<<<<<< * else: * info.format = stdlib.malloc(_buffer_format_string_len) */ __pyx_r = 0; goto __pyx_L0; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":280 * return * else: * info.format = stdlib.malloc(_buffer_format_string_len) # <<<<<<<<<<<<<< * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 */ __pyx_v_info->format = ((char *)malloc(255)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":281 * else: * info.format = stdlib.malloc(_buffer_format_string_len) * info.format[0] = c'^' # Native data types, manual alignment # <<<<<<<<<<<<<< * offset = 0 * f = _util_dtypestring(descr, info.format + 1, */ (__pyx_v_info->format[0]) = '^'; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":282 * info.format = stdlib.malloc(_buffer_format_string_len) * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 # <<<<<<<<<<<<<< * f = _util_dtypestring(descr, info.format + 1, * info.format + _buffer_format_string_len, */ __pyx_v_offset = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":283 * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 * f = _util_dtypestring(descr, info.format + 1, # <<<<<<<<<<<<<< * info.format + _buffer_format_string_len, * &offset) */ __pyx_t_9 = __pyx_f_5numpy__util_dtypestring(__pyx_v_descr, (__pyx_v_info->format + 1), (__pyx_v_info->format + 255), (&__pyx_v_offset)); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_f = __pyx_t_9; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":286 * info.format + _buffer_format_string_len, * &offset) * f[0] = c'\0' # Terminate format string # <<<<<<<<<<<<<< * * def __releasebuffer__(ndarray self, Py_buffer* info): */ (__pyx_v_f[0]) = '\x00'; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":194 * # experimental exception made for __getbuffer__ and __releasebuffer__ * # -- the details of this may change. * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<< * # This implementation of getbuffer is geared towards Cython * # requirements, and does not yet fullfill the PEP. */ /* function exit code */ __pyx_r = 0; goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_8); __Pyx_AddTraceback("numpy.ndarray.__getbuffer__", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = -1; if (__pyx_v_info != NULL && __pyx_v_info->obj != NULL) { __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = NULL; } goto __pyx_L2; __pyx_L0:; if (__pyx_v_info != NULL && __pyx_v_info->obj == Py_None) { __Pyx_GOTREF(Py_None); __Pyx_DECREF(Py_None); __pyx_v_info->obj = NULL; } __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_descr); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":288 * f[0] = c'\0' # Terminate format string * * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<< * if PyArray_HASFIELDS(self): * stdlib.free(info.format) */ /* Python wrapper */ static CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info); /*proto*/ static CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info) { __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__releasebuffer__ (wrapper)", 0); __pyx_pf_5numpy_7ndarray_2__releasebuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info)); /* function exit code */ __Pyx_RefNannyFinishContext(); } static void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info) { __Pyx_RefNannyDeclarations int __pyx_t_1; __Pyx_RefNannySetupContext("__releasebuffer__", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":289 * * def __releasebuffer__(ndarray self, Py_buffer* info): * if PyArray_HASFIELDS(self): # <<<<<<<<<<<<<< * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): */ __pyx_t_1 = (PyArray_HASFIELDS(__pyx_v_self) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":290 * def __releasebuffer__(ndarray self, Py_buffer* info): * if PyArray_HASFIELDS(self): * stdlib.free(info.format) # <<<<<<<<<<<<<< * if sizeof(npy_intp) != sizeof(Py_ssize_t): * stdlib.free(info.strides) */ free(__pyx_v_info->format); goto __pyx_L3; } __pyx_L3:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":291 * if PyArray_HASFIELDS(self): * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<< * stdlib.free(info.strides) * # info.shape was stored after info.strides in the same block */ __pyx_t_1 = (((sizeof(npy_intp)) != (sizeof(Py_ssize_t))) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":292 * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): * stdlib.free(info.strides) # <<<<<<<<<<<<<< * # info.shape was stored after info.strides in the same block * */ free(__pyx_v_info->strides); goto __pyx_L4; } __pyx_L4:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":288 * f[0] = c'\0' # Terminate format string * * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<< * if PyArray_HASFIELDS(self): * stdlib.free(info.format) */ /* function exit code */ __Pyx_RefNannyFinishContext(); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":768 * ctypedef npy_cdouble complex_t * * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(1, a) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew1(PyObject *__pyx_v_a) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew1", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":769 * * cdef inline object PyArray_MultiIterNew1(a): * return PyArray_MultiIterNew(1, a) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew2(a, b): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(1, ((void *)__pyx_v_a)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 769; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":768 * ctypedef npy_cdouble complex_t * * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(1, a) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew1", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":771 * return PyArray_MultiIterNew(1, a) * * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(2, a, b) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew2(PyObject *__pyx_v_a, PyObject *__pyx_v_b) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew2", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":772 * * cdef inline object PyArray_MultiIterNew2(a, b): * return PyArray_MultiIterNew(2, a, b) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew3(a, b, c): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(2, ((void *)__pyx_v_a), ((void *)__pyx_v_b)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 772; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":771 * return PyArray_MultiIterNew(1, a) * * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(2, a, b) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew2", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":774 * return PyArray_MultiIterNew(2, a, b) * * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(3, a, b, c) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew3(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew3", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":775 * * cdef inline object PyArray_MultiIterNew3(a, b, c): * return PyArray_MultiIterNew(3, a, b, c) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(3, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 775; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":774 * return PyArray_MultiIterNew(2, a, b) * * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(3, a, b, c) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew3", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":777 * return PyArray_MultiIterNew(3, a, b, c) * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(4, a, b, c, d) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew4(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew4", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":778 * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): * return PyArray_MultiIterNew(4, a, b, c, d) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(4, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 778; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":777 * return PyArray_MultiIterNew(3, a, b, c) * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(4, a, b, c, d) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew4", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":780 * return PyArray_MultiIterNew(4, a, b, c, d) * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(5, a, b, c, d, e) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew5(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d, PyObject *__pyx_v_e) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew5", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":781 * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): * return PyArray_MultiIterNew(5, a, b, c, d, e) # <<<<<<<<<<<<<< * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(5, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d), ((void *)__pyx_v_e)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 781; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":780 * return PyArray_MultiIterNew(4, a, b, c, d) * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(5, a, b, c, d, e) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew5", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":783 * return PyArray_MultiIterNew(5, a, b, c, d, e) * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<< * # Recursive utility function used in __getbuffer__ to get format * # string. The new location in the format string is returned. */ static CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *__pyx_v_descr, char *__pyx_v_f, char *__pyx_v_end, int *__pyx_v_offset) { PyArray_Descr *__pyx_v_child = 0; int __pyx_v_endian_detector; int __pyx_v_little_endian; PyObject *__pyx_v_fields = 0; PyObject *__pyx_v_childname = NULL; PyObject *__pyx_v_new_offset = NULL; PyObject *__pyx_v_t = NULL; char *__pyx_r; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; Py_ssize_t __pyx_t_2; PyObject *__pyx_t_3 = NULL; PyObject *__pyx_t_4 = NULL; int __pyx_t_5; int __pyx_t_6; int __pyx_t_7; int __pyx_t_8; int __pyx_t_9; long __pyx_t_10; char *__pyx_t_11; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("_util_dtypestring", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":790 * cdef int delta_offset * cdef tuple i * cdef int endian_detector = 1 # <<<<<<<<<<<<<< * cdef bint little_endian = ((&endian_detector)[0] != 0) * cdef tuple fields */ __pyx_v_endian_detector = 1; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":791 * cdef tuple i * cdef int endian_detector = 1 * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<< * cdef tuple fields * */ __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":794 * cdef tuple fields * * for childname in descr.names: # <<<<<<<<<<<<<< * fields = descr.fields[childname] * child, new_offset = fields */ if (unlikely(__pyx_v_descr->names == Py_None)) { PyErr_SetString(PyExc_TypeError, "'NoneType' object is not iterable"); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_1 = __pyx_v_descr->names; __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0; for (;;) { if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_3 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_3); __pyx_t_2++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif __Pyx_XDECREF_SET(__pyx_v_childname, __pyx_t_3); __pyx_t_3 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":795 * * for childname in descr.names: * fields = descr.fields[childname] # <<<<<<<<<<<<<< * child, new_offset = fields * */ __pyx_t_3 = PyObject_GetItem(__pyx_v_descr->fields, __pyx_v_childname); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); if (!(likely(PyTuple_CheckExact(__pyx_t_3))||((__pyx_t_3) == Py_None)||(PyErr_Format(PyExc_TypeError, "Expected %.16s, got %.200s", "tuple", Py_TYPE(__pyx_t_3)->tp_name), 0))) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_XDECREF_SET(__pyx_v_fields, ((PyObject*)__pyx_t_3)); __pyx_t_3 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":796 * for childname in descr.names: * fields = descr.fields[childname] * child, new_offset = fields # <<<<<<<<<<<<<< * * if (end - f) - (new_offset - offset[0]) < 15: */ if (likely(__pyx_v_fields != Py_None)) { PyObject* sequence = __pyx_v_fields; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_3 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); __Pyx_INCREF(__pyx_t_3); __Pyx_INCREF(__pyx_t_4); #else __pyx_t_3 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); #endif } else { __Pyx_RaiseNoneNotIterableError(); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_5numpy_dtype))))) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_XDECREF_SET(__pyx_v_child, ((PyArray_Descr *)__pyx_t_3)); __pyx_t_3 = 0; __Pyx_XDECREF_SET(__pyx_v_new_offset, __pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":798 * child, new_offset = fields * * if (end - f) - (new_offset - offset[0]) < 15: # <<<<<<<<<<<<<< * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") * */ __pyx_t_4 = __Pyx_PyInt_From_int((__pyx_v_offset[0])); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyNumber_Subtract(__pyx_v_new_offset, __pyx_t_4); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_5 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_5 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = ((((__pyx_v_end - __pyx_v_f) - ((int)__pyx_t_5)) < 15) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":799 * * if (end - f) - (new_offset - offset[0]) < 15: * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") # <<<<<<<<<<<<<< * * if ((child.byteorder == c'>' and little_endian) or */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_RuntimeError, __pyx_tuple__13, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":801 * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") * * if ((child.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<< * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") */ __pyx_t_6 = ((__pyx_v_child->byteorder == '>') != 0); if (__pyx_t_6) { __pyx_t_7 = (__pyx_v_little_endian != 0); } else { __pyx_t_7 = __pyx_t_6; } if (!__pyx_t_7) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":802 * * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<< * raise ValueError(u"Non-native byte order not supported") * # One could encode it in the format string and have Cython */ __pyx_t_6 = ((__pyx_v_child->byteorder == '<') != 0); if (__pyx_t_6) { __pyx_t_8 = ((!(__pyx_v_little_endian != 0)) != 0); __pyx_t_9 = __pyx_t_8; } else { __pyx_t_9 = __pyx_t_6; } __pyx_t_6 = __pyx_t_9; } else { __pyx_t_6 = __pyx_t_7; } if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":803 * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * # One could encode it in the format string and have Cython * # complain instead, BUT: < and > in format strings also imply */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__14, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":813 * * # Output padding bytes * while offset[0] < new_offset: # <<<<<<<<<<<<<< * f[0] = 120 # "x"; pad byte * f += 1 */ while (1) { __pyx_t_3 = __Pyx_PyInt_From_int((__pyx_v_offset[0])); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_t_3, __pyx_v_new_offset, Py_LT); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (!__pyx_t_6) break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":814 * # Output padding bytes * while offset[0] < new_offset: * f[0] = 120 # "x"; pad byte # <<<<<<<<<<<<<< * f += 1 * offset[0] += 1 */ (__pyx_v_f[0]) = 120; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":815 * while offset[0] < new_offset: * f[0] = 120 # "x"; pad byte * f += 1 # <<<<<<<<<<<<<< * offset[0] += 1 * */ __pyx_v_f = (__pyx_v_f + 1); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":816 * f[0] = 120 # "x"; pad byte * f += 1 * offset[0] += 1 # <<<<<<<<<<<<<< * * offset[0] += child.itemsize */ __pyx_t_10 = 0; (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + 1); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":818 * offset[0] += 1 * * offset[0] += child.itemsize # <<<<<<<<<<<<<< * * if not PyDataType_HASFIELDS(child): */ __pyx_t_10 = 0; (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + __pyx_v_child->elsize); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":820 * offset[0] += child.itemsize * * if not PyDataType_HASFIELDS(child): # <<<<<<<<<<<<<< * t = child.type_num * if end - f < 5: */ __pyx_t_6 = ((!(PyDataType_HASFIELDS(__pyx_v_child) != 0)) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":821 * * if not PyDataType_HASFIELDS(child): * t = child.type_num # <<<<<<<<<<<<<< * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") */ __pyx_t_4 = __Pyx_PyInt_From_int(__pyx_v_child->type_num); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 821; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_XDECREF_SET(__pyx_v_t, __pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":822 * if not PyDataType_HASFIELDS(child): * t = child.type_num * if end - f < 5: # <<<<<<<<<<<<<< * raise RuntimeError(u"Format string allocated too short.") * */ __pyx_t_6 = (((__pyx_v_end - __pyx_v_f) < 5) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":823 * t = child.type_num * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") # <<<<<<<<<<<<<< * * # Until ticket #99 is fixed, use integers to avoid warnings */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_RuntimeError, __pyx_tuple__15, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":826 * * # Until ticket #99 is fixed, use integers to avoid warnings * if t == NPY_BYTE: f[0] = 98 #"b" # <<<<<<<<<<<<<< * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" */ __pyx_t_4 = PyInt_FromLong(NPY_BYTE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 98; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":827 * # Until ticket #99 is fixed, use integers to avoid warnings * if t == NPY_BYTE: f[0] = 98 #"b" * elif t == NPY_UBYTE: f[0] = 66 #"B" # <<<<<<<<<<<<<< * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" */ __pyx_t_3 = PyInt_FromLong(NPY_UBYTE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 66; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":828 * if t == NPY_BYTE: f[0] = 98 #"b" * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" # <<<<<<<<<<<<<< * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" */ __pyx_t_4 = PyInt_FromLong(NPY_SHORT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 104; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":829 * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" # <<<<<<<<<<<<<< * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" */ __pyx_t_3 = PyInt_FromLong(NPY_USHORT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 72; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":830 * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" # <<<<<<<<<<<<<< * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" */ __pyx_t_4 = PyInt_FromLong(NPY_INT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 105; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":831 * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" # <<<<<<<<<<<<<< * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" */ __pyx_t_3 = PyInt_FromLong(NPY_UINT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 73; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":832 * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" # <<<<<<<<<<<<<< * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" */ __pyx_t_4 = PyInt_FromLong(NPY_LONG); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 108; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":833 * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" # <<<<<<<<<<<<<< * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" */ __pyx_t_3 = PyInt_FromLong(NPY_ULONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 76; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":834 * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" # <<<<<<<<<<<<<< * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" */ __pyx_t_4 = PyInt_FromLong(NPY_LONGLONG); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 113; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":835 * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" # <<<<<<<<<<<<<< * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" */ __pyx_t_3 = PyInt_FromLong(NPY_ULONGLONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 81; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":836 * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" # <<<<<<<<<<<<<< * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" */ __pyx_t_4 = PyInt_FromLong(NPY_FLOAT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 102; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":837 * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" # <<<<<<<<<<<<<< * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf */ __pyx_t_3 = PyInt_FromLong(NPY_DOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 100; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":838 * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" # <<<<<<<<<<<<<< * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd */ __pyx_t_4 = PyInt_FromLong(NPY_LONGDOUBLE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 103; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":839 * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf # <<<<<<<<<<<<<< * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg */ __pyx_t_3 = PyInt_FromLong(NPY_CFLOAT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 102; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":840 * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd # <<<<<<<<<<<<<< * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg * elif t == NPY_OBJECT: f[0] = 79 #"O" */ __pyx_t_4 = PyInt_FromLong(NPY_CDOUBLE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 100; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":841 * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg # <<<<<<<<<<<<<< * elif t == NPY_OBJECT: f[0] = 79 #"O" * else: */ __pyx_t_3 = PyInt_FromLong(NPY_CLONGDOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 103; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":842 * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg * elif t == NPY_OBJECT: f[0] = 79 #"O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ __pyx_t_4 = PyInt_FromLong(NPY_OBJECT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 79; goto __pyx_L11; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":844 * elif t == NPY_OBJECT: f[0] = 79 #"O" * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) # <<<<<<<<<<<<<< * f += 1 * else: */ __pyx_t_3 = PyUnicode_Format(__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_v_t); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_L11:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":845 * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * f += 1 # <<<<<<<<<<<<<< * else: * # Cython ignores struct boundary information ("T{...}"), */ __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L9; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":849 * # Cython ignores struct boundary information ("T{...}"), * # so don't output it * f = _util_dtypestring(child, f, end, offset) # <<<<<<<<<<<<<< * return f * */ __pyx_t_11 = __pyx_f_5numpy__util_dtypestring(__pyx_v_child, __pyx_v_f, __pyx_v_end, __pyx_v_offset); if (unlikely(__pyx_t_11 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 849; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_f = __pyx_t_11; } __pyx_L9:; } __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":850 * # so don't output it * f = _util_dtypestring(child, f, end, offset) * return f # <<<<<<<<<<<<<< * * */ __pyx_r = __pyx_v_f; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":783 * return PyArray_MultiIterNew(5, a, b, c, d, e) * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<< * # Recursive utility function used in __getbuffer__ to get format * # string. The new location in the format string is returned. */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_4); __Pyx_AddTraceback("numpy._util_dtypestring", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF((PyObject *)__pyx_v_child); __Pyx_XDECREF(__pyx_v_fields); __Pyx_XDECREF(__pyx_v_childname); __Pyx_XDECREF(__pyx_v_new_offset); __Pyx_XDECREF(__pyx_v_t); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":966 * * * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<< * cdef PyObject* baseptr * if base is None: */ static CYTHON_INLINE void __pyx_f_5numpy_set_array_base(PyArrayObject *__pyx_v_arr, PyObject *__pyx_v_base) { PyObject *__pyx_v_baseptr; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; __Pyx_RefNannySetupContext("set_array_base", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":968 * cdef inline void set_array_base(ndarray arr, object base): * cdef PyObject* baseptr * if base is None: # <<<<<<<<<<<<<< * baseptr = NULL * else: */ __pyx_t_1 = (__pyx_v_base == Py_None); __pyx_t_2 = (__pyx_t_1 != 0); if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":969 * cdef PyObject* baseptr * if base is None: * baseptr = NULL # <<<<<<<<<<<<<< * else: * Py_INCREF(base) # important to do this before decref below! */ __pyx_v_baseptr = NULL; goto __pyx_L3; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":971 * baseptr = NULL * else: * Py_INCREF(base) # important to do this before decref below! # <<<<<<<<<<<<<< * baseptr = base * Py_XDECREF(arr.base) */ Py_INCREF(__pyx_v_base); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":972 * else: * Py_INCREF(base) # important to do this before decref below! * baseptr = base # <<<<<<<<<<<<<< * Py_XDECREF(arr.base) * arr.base = baseptr */ __pyx_v_baseptr = ((PyObject *)__pyx_v_base); } __pyx_L3:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":973 * Py_INCREF(base) # important to do this before decref below! * baseptr = base * Py_XDECREF(arr.base) # <<<<<<<<<<<<<< * arr.base = baseptr * */ Py_XDECREF(__pyx_v_arr->base); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":974 * baseptr = base * Py_XDECREF(arr.base) * arr.base = baseptr # <<<<<<<<<<<<<< * * cdef inline object get_array_base(ndarray arr): */ __pyx_v_arr->base = __pyx_v_baseptr; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":966 * * * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<< * cdef PyObject* baseptr * if base is None: */ /* function exit code */ __Pyx_RefNannyFinishContext(); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_get_array_base(PyArrayObject *__pyx_v_arr) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; __Pyx_RefNannySetupContext("get_array_base", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":977 * * cdef inline object get_array_base(ndarray arr): * if arr.base is NULL: # <<<<<<<<<<<<<< * return None * else: */ __pyx_t_1 = ((__pyx_v_arr->base == NULL) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":978 * cdef inline object get_array_base(ndarray arr): * if arr.base is NULL: * return None # <<<<<<<<<<<<<< * else: * return arr.base */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(Py_None); __pyx_r = Py_None; goto __pyx_L0; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":980 * return None * else: * return arr.base # <<<<<<<<<<<<<< */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_arr->base)); __pyx_r = ((PyObject *)__pyx_v_arr->base); goto __pyx_L0; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ /* function exit code */ __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyMethodDef __pyx_methods[] = { {__Pyx_NAMESTR("mkmask"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_17mkmask, METH_O, __Pyx_DOCSTR(0)}, {__Pyx_NAMESTR("count_bad"), (PyCFunction)__pyx_pw_6healpy_9_sphtools_19count_bad, METH_O, __Pyx_DOCSTR(0)}, {0, 0, 0, 0} }; #if PY_MAJOR_VERSION >= 3 static struct PyModuleDef __pyx_moduledef = { #if PY_VERSION_HEX < 0x03020000 { PyObject_HEAD_INIT(NULL) NULL, 0, NULL }, #else PyModuleDef_HEAD_INIT, #endif __Pyx_NAMESTR("_sphtools"), 0, /* m_doc */ -1, /* m_size */ __pyx_methods /* m_methods */, NULL, /* m_reload */ NULL, /* m_traverse */ NULL, /* m_clear */ NULL /* m_free */ }; #endif static __Pyx_StringTabEntry __pyx_string_tab[] = { {&__pyx_n_s_A1, __pyx_k_A1, sizeof(__pyx_k_A1), 0, 0, 1, 1}, {&__pyx_n_s_A2, __pyx_k_A2, sizeof(__pyx_k_A2), 0, 0, 1, 1}, {&__pyx_n_s_AC, __pyx_k_AC, sizeof(__pyx_k_AC), 0, 0, 1, 1}, {&__pyx_n_s_AG, __pyx_k_AG, sizeof(__pyx_k_AG), 0, 0, 1, 1}, {&__pyx_n_s_AI, __pyx_k_AI, sizeof(__pyx_k_AI), 0, 0, 1, 1}, {&__pyx_n_s_DATAPATH, __pyx_k_DATAPATH, sizeof(__pyx_k_DATAPATH), 0, 0, 1, 1}, {&__pyx_kp_u_Format_string_allocated_too_shor, __pyx_k_Format_string_allocated_too_shor, sizeof(__pyx_k_Format_string_allocated_too_shor), 0, 1, 0, 0}, {&__pyx_kp_u_Format_string_allocated_too_shor_2, __pyx_k_Format_string_allocated_too_shor_2, sizeof(__pyx_k_Format_string_allocated_too_shor_2), 0, 1, 0, 0}, {&__pyx_n_s_IOError, __pyx_k_IOError, sizeof(__pyx_k_IOError), 0, 0, 1, 1}, {&__pyx_kp_s_Input_maps_must_have_same_size, __pyx_k_Input_maps_must_have_same_size, sizeof(__pyx_k_Input_maps_must_have_same_size), 0, 0, 1, 0}, {&__pyx_kp_s_Invalid_input, __pyx_k_Invalid_input, sizeof(__pyx_k_Invalid_input), 0, 0, 1, 0}, {&__pyx_n_s_M1, __pyx_k_M1, sizeof(__pyx_k_M1), 0, 0, 1, 1}, {&__pyx_n_s_M2, __pyx_k_M2, sizeof(__pyx_k_M2), 0, 0, 1, 1}, {&__pyx_n_s_MI, __pyx_k_MI, sizeof(__pyx_k_MI), 0, 0, 1, 1}, {&__pyx_n_s_MQ, __pyx_k_MQ, sizeof(__pyx_k_MQ), 0, 0, 1, 1}, {&__pyx_n_s_MU, __pyx_k_MU, sizeof(__pyx_k_MU), 0, 0, 1, 1}, {&__pyx_kp_u_Non_native_byte_order_not_suppor, __pyx_k_Non_native_byte_order_not_suppor, sizeof(__pyx_k_Non_native_byte_order_not_suppor), 0, 1, 0, 0}, {&__pyx_n_s_Nspec, __pyx_k_Nspec, sizeof(__pyx_k_Nspec), 0, 0, 1, 1}, {&__pyx_n_s_Nspec2, __pyx_k_Nspec2, sizeof(__pyx_k_Nspec2), 0, 0, 1, 1}, {&__pyx_n_s_RuntimeError, __pyx_k_RuntimeError, sizeof(__pyx_k_RuntimeError), 0, 0, 1, 1}, {&__pyx_n_s_ValueError, __pyx_k_ValueError, sizeof(__pyx_k_ValueError), 0, 0, 1, 1}, {&__pyx_kp_s_Weight_file_not_found_in_s, __pyx_k_Weight_file_not_found_in_s, sizeof(__pyx_k_Weight_file_not_found_in_s), 0, 0, 1, 0}, {&__pyx_kp_s_Wrong_input_map_must_be_a_valid, __pyx_k_Wrong_input_map_must_be_a_valid, sizeof(__pyx_k_Wrong_input_map_must_be_a_valid), 0, 0, 1, 0}, {&__pyx_n_s_a, __pyx_k_a, sizeof(__pyx_k_a), 0, 0, 1, 1}, {&__pyx_n_s_abspath, __pyx_k_abspath, sizeof(__pyx_k_abspath), 0, 0, 1, 1}, {&__pyx_n_s_ac, __pyx_k_ac, sizeof(__pyx_k_ac), 0, 0, 1, 1}, {&__pyx_n_s_ag, __pyx_k_ag, sizeof(__pyx_k_ag), 0, 0, 1, 1}, {&__pyx_n_s_ai, __pyx_k_ai, sizeof(__pyx_k_ai), 0, 0, 1, 1}, {&__pyx_kp_s_all_alms_must_have_same_size, __pyx_k_all_alms_must_have_same_size, sizeof(__pyx_k_all_alms_must_have_same_size), 0, 0, 1, 0}, {&__pyx_n_s_alm, __pyx_k_alm, sizeof(__pyx_k_alm), 0, 0, 1, 1}, {&__pyx_n_s_alm1, __pyx_k_alm1, sizeof(__pyx_k_alm1), 0, 0, 1, 1}, {&__pyx_n_s_alm2, __pyx_k_alm2, sizeof(__pyx_k_alm2), 0, 0, 1, 1}, {&__pyx_n_s_alm2cl, __pyx_k_alm2cl, sizeof(__pyx_k_alm2cl), 0, 0, 1, 1}, {&__pyx_n_s_alm2map_spin_healpy, __pyx_k_alm2map_spin_healpy, sizeof(__pyx_k_alm2map_spin_healpy), 0, 0, 1, 1}, {&__pyx_n_s_almC, __pyx_k_almC, sizeof(__pyx_k_almC), 0, 0, 1, 1}, {&__pyx_n_s_almG, __pyx_k_almG, sizeof(__pyx_k_almG), 0, 0, 1, 1}, {&__pyx_n_s_almI, __pyx_k_almI, sizeof(__pyx_k_almI), 0, 0, 1, 1}, {&__pyx_n_s_alm_2, __pyx_k_alm_2, sizeof(__pyx_k_alm_2), 0, 0, 1, 1}, {&__pyx_n_s_alm_getlmmax, __pyx_k_alm_getlmmax, sizeof(__pyx_k_alm_getlmmax), 0, 0, 1, 1}, {&__pyx_n_s_alms, __pyx_k_alms, sizeof(__pyx_k_alms), 0, 0, 1, 1}, {&__pyx_n_s_alms2, __pyx_k_alms2, sizeof(__pyx_k_alms2), 0, 0, 1, 1}, {&__pyx_kp_s_alms2_must_be_an_array_or_a_sequ, __pyx_k_alms2_must_be_an_array_or_a_sequ, sizeof(__pyx_k_alms2_must_be_an_array_or_a_sequ), 0, 0, 1, 0}, {&__pyx_kp_s_alms_and_alms2_must_have_same_nu, __pyx_k_alms_and_alms2_must_have_same_nu, sizeof(__pyx_k_alms_and_alms2_must_have_same_nu), 0, 0, 1, 0}, {&__pyx_n_s_alms_c, __pyx_k_alms_c, sizeof(__pyx_k_alms_c), 0, 0, 1, 1}, {&__pyx_n_s_alms_lonely, __pyx_k_alms_lonely, sizeof(__pyx_k_alms_lonely), 0, 0, 1, 1}, {&__pyx_kp_s_alms_must_be_an_array_or_a_seque, __pyx_k_alms_must_be_an_array_or_a_seque, sizeof(__pyx_k_alms_must_be_an_array_or_a_seque), 0, 0, 1, 0}, {&__pyx_n_s_almsize, __pyx_k_almsize, sizeof(__pyx_k_almsize), 0, 0, 1, 1}, {&__pyx_n_s_almxfl, __pyx_k_almxfl, sizeof(__pyx_k_almxfl), 0, 0, 1, 1}, {&__pyx_n_s_append, __pyx_k_append, sizeof(__pyx_k_append), 0, 0, 1, 1}, {&__pyx_n_s_array, __pyx_k_array, sizeof(__pyx_k_array), 0, 0, 1, 1}, {&__pyx_n_s_ascontiguousarray, __pyx_k_ascontiguousarray, sizeof(__pyx_k_ascontiguousarray), 0, 0, 1, 1}, {&__pyx_n_s_c_datapath, __pyx_k_c_datapath, sizeof(__pyx_k_c_datapath), 0, 0, 1, 1}, {&__pyx_n_s_complex128, __pyx_k_complex128, sizeof(__pyx_k_complex128), 0, 0, 1, 1}, {&__pyx_n_s_copy, __pyx_k_copy, sizeof(__pyx_k_copy), 0, 0, 1, 1}, {&__pyx_n_s_data, __pyx_k_data, sizeof(__pyx_k_data), 0, 0, 1, 1}, {&__pyx_n_s_datapath, __pyx_k_datapath, sizeof(__pyx_k_datapath), 0, 0, 1, 1}, {&__pyx_n_s_dirname, __pyx_k_dirname, sizeof(__pyx_k_dirname), 0, 0, 1, 1}, {&__pyx_n_s_dtype, __pyx_k_dtype, sizeof(__pyx_k_dtype), 0, 0, 1, 1}, {&__pyx_n_s_empty, __pyx_k_empty, sizeof(__pyx_k_empty), 0, 0, 1, 1}, {&__pyx_n_s_f, __pyx_k_f, sizeof(__pyx_k_f), 0, 0, 1, 1}, {&__pyx_n_s_file, __pyx_k_file, sizeof(__pyx_k_file), 0, 0, 1, 1}, {&__pyx_n_s_fl, __pyx_k_fl, sizeof(__pyx_k_fl), 0, 0, 1, 1}, {&__pyx_n_s_fl_2, __pyx_k_fl_2, sizeof(__pyx_k_fl_2), 0, 0, 1, 1}, {&__pyx_n_s_float64, __pyx_k_float64, sizeof(__pyx_k_float64), 0, 0, 1, 1}, {&__pyx_n_s_flsize, __pyx_k_flsize, sizeof(__pyx_k_flsize), 0, 0, 1, 1}, {&__pyx_n_s_get_datapath, __pyx_k_get_datapath, sizeof(__pyx_k_get_datapath), 0, 0, 1, 1}, {&__pyx_n_s_healpy, __pyx_k_healpy, sizeof(__pyx_k_healpy), 0, 0, 1, 1}, {&__pyx_n_s_healpy__sphtools, __pyx_k_healpy__sphtools, sizeof(__pyx_k_healpy__sphtools), 0, 0, 1, 1}, {&__pyx_n_s_healpy_pixelfunc, __pyx_k_healpy_pixelfunc, sizeof(__pyx_k_healpy_pixelfunc), 0, 0, 1, 1}, {&__pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_k_home_zonca_p_software_healpy_he, sizeof(__pyx_k_home_zonca_p_software_healpy_he), 0, 0, 1, 0}, {&__pyx_n_s_i, __pyx_k_i, sizeof(__pyx_k_i), 0, 0, 1, 1}, {&__pyx_n_s_import, __pyx_k_import, sizeof(__pyx_k_import), 0, 0, 1, 1}, {&__pyx_n_s_info, __pyx_k_info, sizeof(__pyx_k_info), 0, 0, 1, 1}, {&__pyx_n_s_inplace, __pyx_k_inplace, sizeof(__pyx_k_inplace), 0, 0, 1, 1}, {&__pyx_n_s_int8, __pyx_k_int8, sizeof(__pyx_k_int8), 0, 0, 1, 1}, {&__pyx_n_s_isfile, __pyx_k_isfile, sizeof(__pyx_k_isfile), 0, 0, 1, 1}, {&__pyx_n_s_j, __pyx_k_j, sizeof(__pyx_k_j), 0, 0, 1, 1}, {&__pyx_n_s_join, __pyx_k_join, sizeof(__pyx_k_join), 0, 0, 1, 1}, {&__pyx_n_s_l, __pyx_k_l, sizeof(__pyx_k_l), 0, 0, 1, 1}, {&__pyx_n_s_len, __pyx_k_len, sizeof(__pyx_k_len), 0, 0, 1, 1}, {&__pyx_n_s_limit, __pyx_k_limit, sizeof(__pyx_k_limit), 0, 0, 1, 1}, {&__pyx_n_s_lmax, __pyx_k_lmax, sizeof(__pyx_k_lmax), 0, 0, 1, 1}, {&__pyx_n_s_lmax_2, __pyx_k_lmax_2, sizeof(__pyx_k_lmax_2), 0, 0, 1, 1}, {&__pyx_n_s_lmax_out, __pyx_k_lmax_out, sizeof(__pyx_k_lmax_out), 0, 0, 1, 1}, {&__pyx_n_s_lmax_out_2, __pyx_k_lmax_out_2, sizeof(__pyx_k_lmax_out_2), 0, 0, 1, 1}, {&__pyx_n_s_m, __pyx_k_m, sizeof(__pyx_k_m), 0, 0, 1, 1}, {&__pyx_n_s_main, __pyx_k_main, sizeof(__pyx_k_main), 0, 0, 1, 1}, {&__pyx_n_s_map2alm, __pyx_k_map2alm, sizeof(__pyx_k_map2alm), 0, 0, 1, 1}, {&__pyx_n_s_map2alm_spin_healpy, __pyx_k_map2alm_spin_healpy, sizeof(__pyx_k_map2alm_spin_healpy), 0, 0, 1, 1}, {&__pyx_n_s_maps, __pyx_k_maps, sizeof(__pyx_k_maps), 0, 0, 1, 1}, {&__pyx_n_s_maps_c, __pyx_k_maps_c, sizeof(__pyx_k_maps_c), 0, 0, 1, 1}, {&__pyx_n_s_maptype, __pyx_k_maptype, sizeof(__pyx_k_maptype), 0, 0, 1, 1}, {&__pyx_n_s_mask, __pyx_k_mask, sizeof(__pyx_k_mask), 0, 0, 1, 1}, {&__pyx_n_s_mask_mi, __pyx_k_mask_mi, sizeof(__pyx_k_mask_mi), 0, 0, 1, 1}, {&__pyx_n_s_mask_mq, __pyx_k_mask_mq, sizeof(__pyx_k_mask_mq), 0, 0, 1, 1}, {&__pyx_n_s_mask_mu, __pyx_k_mask_mu, sizeof(__pyx_k_mask_mu), 0, 0, 1, 1}, {&__pyx_n_s_masks, __pyx_k_masks, sizeof(__pyx_k_masks), 0, 0, 1, 1}, {&__pyx_n_s_maxm, __pyx_k_maxm, sizeof(__pyx_k_maxm), 0, 0, 1, 1}, {&__pyx_n_s_mi, __pyx_k_mi, sizeof(__pyx_k_mi), 0, 0, 1, 1}, {&__pyx_n_s_mmax, __pyx_k_mmax, sizeof(__pyx_k_mmax), 0, 0, 1, 1}, {&__pyx_n_s_mmax_2, __pyx_k_mmax_2, sizeof(__pyx_k_mmax_2), 0, 0, 1, 1}, {&__pyx_kp_s_mmax_must_be_lmax, __pyx_k_mmax_must_be_lmax, sizeof(__pyx_k_mmax_must_be_lmax), 0, 0, 1, 0}, {&__pyx_n_s_mq, __pyx_k_mq, sizeof(__pyx_k_mq), 0, 0, 1, 1}, {&__pyx_n_s_mu, __pyx_k_mu, sizeof(__pyx_k_mu), 0, 0, 1, 1}, {&__pyx_n_s_n, __pyx_k_n, sizeof(__pyx_k_n), 0, 0, 1, 1}, {&__pyx_n_s_n_alm, __pyx_k_n_alm, sizeof(__pyx_k_n_alm), 0, 0, 1, 1}, {&__pyx_kp_u_ndarray_is_not_C_contiguous, __pyx_k_ndarray_is_not_C_contiguous, sizeof(__pyx_k_ndarray_is_not_C_contiguous), 0, 1, 0, 0}, {&__pyx_kp_u_ndarray_is_not_Fortran_contiguou, __pyx_k_ndarray_is_not_Fortran_contiguou, sizeof(__pyx_k_ndarray_is_not_Fortran_contiguou), 0, 1, 0, 0}, {&__pyx_n_s_ndim, __pyx_k_ndim, sizeof(__pyx_k_ndim), 0, 0, 1, 1}, {&__pyx_n_s_niter, __pyx_k_niter, sizeof(__pyx_k_niter), 0, 0, 1, 1}, {&__pyx_n_s_np, __pyx_k_np, sizeof(__pyx_k_np), 0, 0, 1, 1}, {&__pyx_n_s_npix, __pyx_k_npix, sizeof(__pyx_k_npix), 0, 0, 1, 1}, {&__pyx_n_s_npix2nside, __pyx_k_npix2nside, sizeof(__pyx_k_npix2nside), 0, 0, 1, 1}, {&__pyx_n_s_nside, __pyx_k_nside, sizeof(__pyx_k_nside), 0, 0, 1, 1}, {&__pyx_n_s_nside2npix, __pyx_k_nside2npix, sizeof(__pyx_k_nside2npix), 0, 0, 1, 1}, {&__pyx_n_s_numpy, __pyx_k_numpy, sizeof(__pyx_k_numpy), 0, 0, 1, 1}, {&__pyx_n_s_os, __pyx_k_os, sizeof(__pyx_k_os), 0, 0, 1, 1}, {&__pyx_n_s_path, __pyx_k_path, sizeof(__pyx_k_path), 0, 0, 1, 1}, {&__pyx_n_s_phi, __pyx_k_phi, sizeof(__pyx_k_phi), 0, 0, 1, 1}, {&__pyx_n_s_polarization, __pyx_k_polarization, sizeof(__pyx_k_polarization), 0, 0, 1, 1}, {&__pyx_n_s_powspec, __pyx_k_powspec, sizeof(__pyx_k_powspec), 0, 0, 1, 1}, {&__pyx_n_s_psi, __pyx_k_psi, sizeof(__pyx_k_psi), 0, 0, 1, 1}, {&__pyx_n_s_pyx_getbuffer, __pyx_k_pyx_getbuffer, sizeof(__pyx_k_pyx_getbuffer), 0, 0, 1, 1}, {&__pyx_n_s_pyx_releasebuffer, __pyx_k_pyx_releasebuffer, sizeof(__pyx_k_pyx_releasebuffer), 0, 0, 1, 1}, {&__pyx_n_s_range, __pyx_k_range, sizeof(__pyx_k_range), 0, 0, 1, 1}, {&__pyx_n_s_rotate_alm, __pyx_k_rotate_alm, sizeof(__pyx_k_rotate_alm), 0, 0, 1, 1}, {&__pyx_n_s_size, __pyx_k_size, sizeof(__pyx_k_size), 0, 0, 1, 1}, {&__pyx_n_s_spectra, __pyx_k_spectra, sizeof(__pyx_k_spectra), 0, 0, 1, 1}, {&__pyx_n_s_spin, __pyx_k_spin, sizeof(__pyx_k_spin), 0, 0, 1, 1}, {&__pyx_n_s_sqrt, __pyx_k_sqrt, sizeof(__pyx_k_sqrt), 0, 0, 1, 1}, {&__pyx_n_s_test, __pyx_k_test, sizeof(__pyx_k_test), 0, 0, 1, 1}, {&__pyx_n_s_theta, __pyx_k_theta, sizeof(__pyx_k_theta), 0, 0, 1, 1}, {&__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_k_unknown_dtype_code_in_numpy_pxd, sizeof(__pyx_k_unknown_dtype_code_in_numpy_pxd), 0, 1, 0, 0}, {&__pyx_n_s_use_weights, __pyx_k_use_weights, sizeof(__pyx_k_use_weights), 0, 0, 1, 1}, {&__pyx_n_s_w_arr, __pyx_k_w_arr, sizeof(__pyx_k_w_arr), 0, 0, 1, 1}, {&__pyx_kp_s_weight_ring_n_05d_fits, __pyx_k_weight_ring_n_05d_fits, sizeof(__pyx_k_weight_ring_n_05d_fits), 0, 0, 1, 0}, {&__pyx_n_s_weightfile, __pyx_k_weightfile, sizeof(__pyx_k_weightfile), 0, 0, 1, 1}, {&__pyx_n_s_xrange, __pyx_k_xrange, sizeof(__pyx_k_xrange), 0, 0, 1, 1}, {&__pyx_n_s_zeros, __pyx_k_zeros, sizeof(__pyx_k_zeros), 0, 0, 1, 1}, {&__pyx_n_s_zip, __pyx_k_zip, sizeof(__pyx_k_zip), 0, 0, 1, 1}, {0, 0, 0, 0, 0, 0, 0} }; static int __Pyx_InitCachedBuiltins(void) { __pyx_builtin_ValueError = __Pyx_GetBuiltinName(__pyx_n_s_ValueError); if (!__pyx_builtin_ValueError) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 99; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_zip = __Pyx_GetBuiltinName(__pyx_n_s_zip); if (!__pyx_builtin_zip) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 106; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_IOError = __Pyx_GetBuiltinName(__pyx_n_s_IOError); if (!__pyx_builtin_IOError) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 281; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_range = __Pyx_GetBuiltinName(__pyx_n_s_range); if (!__pyx_builtin_range) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #if PY_MAJOR_VERSION >= 3 __pyx_builtin_xrange = __Pyx_GetBuiltinName(__pyx_n_s_range); if (!__pyx_builtin_xrange) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 374; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_builtin_xrange = __Pyx_GetBuiltinName(__pyx_n_s_xrange); if (!__pyx_builtin_xrange) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 374; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif __pyx_builtin_RuntimeError = __Pyx_GetBuiltinName(__pyx_n_s_RuntimeError); if (!__pyx_builtin_RuntimeError) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} return 0; __pyx_L1_error:; return -1; } static int __Pyx_InitCachedConstants(void) { __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__Pyx_InitCachedConstants", 0); /* "healpy/src/_sphtools.pyx":99 * # Check all maps have same npix * if maps_c[1].size != npix: * raise ValueError("Input maps must have same size") # <<<<<<<<<<<<<< * * # View the ndarray as a Healpix_Map */ __pyx_tuple_ = PyTuple_Pack(1, __pyx_kp_s_Input_maps_must_have_same_size); if (unlikely(!__pyx_tuple_)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 99; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple_); __Pyx_GIVEREF(__pyx_tuple_); /* "healpy/src/_sphtools.pyx":214 * mu = np.ascontiguousarray(m[2], dtype=np.float64) * else: * raise ValueError("Wrong input map (must be a valid healpix map " # <<<<<<<<<<<<<< * "or a sequence of 1 or 3 maps)") * */ __pyx_tuple__2 = PyTuple_Pack(1, __pyx_kp_s_Wrong_input_map_must_be_a_valid); if (unlikely(!__pyx_tuple__2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 214; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__2); __Pyx_GIVEREF(__pyx_tuple__2); /* "healpy/src/_sphtools.pyx":240 * if polarization: * if mq.size != npix or mu.size != npix: * raise ValueError("Input maps must have same size") # <<<<<<<<<<<<<< * * # View the ndarray as a Healpix_Map */ __pyx_tuple__3 = PyTuple_Pack(1, __pyx_kp_s_Input_maps_must_have_same_size); if (unlikely(!__pyx_tuple__3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 240; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__3); __Pyx_GIVEREF(__pyx_tuple__3); /* "healpy/src/_sphtools.pyx":348 * cdef int Nspec, Nspec2 * if not hasattr(alms, '__len__'): * raise ValueError('alms must be an array or a sequence of arrays') # <<<<<<<<<<<<<< * if not hasattr(alms[0], '__len__'): * alms_lonely = True */ __pyx_tuple__4 = PyTuple_Pack(1, __pyx_kp_s_alms_must_be_an_array_or_a_seque); if (unlikely(!__pyx_tuple__4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 348; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__4); __Pyx_GIVEREF(__pyx_tuple__4); /* "healpy/src/_sphtools.pyx":361 * * if not hasattr(alms2, '__len__'): * raise ValueError('alms2 must be an array or a sequence of arrays') # <<<<<<<<<<<<<< * if not hasattr(alms2[0], '__len__'): * alms2 = [alms2] */ __pyx_tuple__5 = PyTuple_Pack(1, __pyx_kp_s_alms2_must_be_an_array_or_a_sequ); if (unlikely(!__pyx_tuple__5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 361; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__5); __Pyx_GIVEREF(__pyx_tuple__5); /* "healpy/src/_sphtools.pyx":367 * * if Nspec != Nspec2: * raise ValueError('alms and alms2 must have same number of spectra') # <<<<<<<<<<<<<< * * ############################################## */ __pyx_tuple__6 = PyTuple_Pack(1, __pyx_kp_s_alms_and_alms2_must_have_same_nu); if (unlikely(!__pyx_tuple__6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 367; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__6); __Pyx_GIVEREF(__pyx_tuple__6); /* "healpy/src/_sphtools.pyx":376 * for i in xrange(Nspec): * if alms[i].size != almsize or alms2[i].size != almsize: * raise ValueError('all alms must have same size') # <<<<<<<<<<<<<< * * lmax, mmax = alm_getlmmax(alms[0], lmax, mmax) */ __pyx_tuple__7 = PyTuple_Pack(1, __pyx_kp_s_all_alms_must_have_same_size); if (unlikely(!__pyx_tuple__7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 376; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__7); __Pyx_GIVEREF(__pyx_tuple__7); /* "healpy/src/_sphtools.pyx":505 * * if not isinstance(alm, (list, tuple, np.ndarray)) or len(alm) == 0: * raise ValueError('Invalid input.') # <<<<<<<<<<<<<< * * # C++ rotate_alm only handles 1 or 3 maps. The function handling 3 maps */ __pyx_tuple__8 = PyTuple_Pack(1, __pyx_kp_s_Invalid_input); if (unlikely(!__pyx_tuple__8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 505; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__8); __Pyx_GIVEREF(__pyx_tuple__8); /* "healpy/src/_sphtools.pyx":532 * cdef int alm_getn(int l, int m): * if not m <= l: * raise ValueError("mmax must be <= lmax") # <<<<<<<<<<<<<< * return ((m+1)*(m+2))/2 + (m+1)*(l-m) * */ __pyx_tuple__9 = PyTuple_Pack(1, __pyx_kp_s_mmax_must_be_lmax); if (unlikely(!__pyx_tuple__9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 532; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__9); __Pyx_GIVEREF(__pyx_tuple__9); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":215 * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) */ __pyx_tuple__10 = PyTuple_Pack(1, __pyx_kp_u_ndarray_is_not_C_contiguous); if (unlikely(!__pyx_tuple__10)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__10); __Pyx_GIVEREF(__pyx_tuple__10); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":219 * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") # <<<<<<<<<<<<<< * * info.buf = PyArray_DATA(self) */ __pyx_tuple__11 = PyTuple_Pack(1, __pyx_kp_u_ndarray_is_not_Fortran_contiguou); if (unlikely(!__pyx_tuple__11)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__11); __Pyx_GIVEREF(__pyx_tuple__11); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":257 * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" */ __pyx_tuple__12 = PyTuple_Pack(1, __pyx_kp_u_Non_native_byte_order_not_suppor); if (unlikely(!__pyx_tuple__12)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__12); __Pyx_GIVEREF(__pyx_tuple__12); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":799 * * if (end - f) - (new_offset - offset[0]) < 15: * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") # <<<<<<<<<<<<<< * * if ((child.byteorder == c'>' and little_endian) or */ __pyx_tuple__13 = PyTuple_Pack(1, __pyx_kp_u_Format_string_allocated_too_shor); if (unlikely(!__pyx_tuple__13)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__13); __Pyx_GIVEREF(__pyx_tuple__13); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":803 * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * # One could encode it in the format string and have Cython * # complain instead, BUT: < and > in format strings also imply */ __pyx_tuple__14 = PyTuple_Pack(1, __pyx_kp_u_Non_native_byte_order_not_suppor); if (unlikely(!__pyx_tuple__14)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__14); __Pyx_GIVEREF(__pyx_tuple__14); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":823 * t = child.type_num * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") # <<<<<<<<<<<<<< * * # Until ticket #99 is fixed, use integers to avoid warnings */ __pyx_tuple__15 = PyTuple_Pack(1, __pyx_kp_u_Format_string_allocated_too_shor_2); if (unlikely(!__pyx_tuple__15)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__15); __Pyx_GIVEREF(__pyx_tuple__15); /* "healpy/src/_sphtools.pyx":54 * DATAPATH = None * * def get_datapath(): # <<<<<<<<<<<<<< * global DATAPATH * if DATAPATH is None: */ __pyx_codeobj__16 = (PyObject*)__Pyx_PyCode_New(0, 0, 0, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_get_datapath, 54, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__16)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":60 * return DATAPATH * * def map2alm_spin_healpy(maps, spin, lmax = None, mmax = None): # <<<<<<<<<<<<<< * """Computes the spinned alm of a 2 Healpix maps. * */ __pyx_tuple__17 = PyTuple_Pack(21, __pyx_n_s_maps, __pyx_n_s_spin, __pyx_n_s_lmax, __pyx_n_s_mmax, __pyx_n_s_maps_c, __pyx_n_s_masks, __pyx_n_s_lmax_2, __pyx_n_s_mmax_2, __pyx_n_s_nside, __pyx_n_s_npix, __pyx_n_s_M1, __pyx_n_s_M2, __pyx_n_s_m, __pyx_n_s_mask, __pyx_n_s_n_alm, __pyx_n_s_alms, __pyx_n_s_A1, __pyx_n_s_A2, __pyx_n_s_w_arr, __pyx_n_s_i, __pyx_n_s_c_datapath); if (unlikely(!__pyx_tuple__17)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 60; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__17); __Pyx_GIVEREF(__pyx_tuple__17); __pyx_codeobj__18 = (PyObject*)__Pyx_PyCode_New(4, 0, 21, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__17, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_map2alm_spin_healpy, 60, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__18)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 60; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":136 * return alms * * def alm2map_spin_healpy(alms, nside, spin, lmax, mmax=None): # <<<<<<<<<<<<<< * """Computes maps from a set of 2 spinned alm * */ __pyx_tuple__19 = PyTuple_Pack(13, __pyx_n_s_alms, __pyx_n_s_nside, __pyx_n_s_spin, __pyx_n_s_lmax, __pyx_n_s_mmax, __pyx_n_s_alms_c, __pyx_n_s_npix, __pyx_n_s_maps, __pyx_n_s_M1, __pyx_n_s_M2, __pyx_n_s_A1, __pyx_n_s_A2, __pyx_n_s_alm); if (unlikely(!__pyx_tuple__19)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__19); __Pyx_GIVEREF(__pyx_tuple__19); __pyx_codeobj__20 = (PyObject*)__Pyx_PyCode_New(5, 0, 13, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__19, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_alm2map_spin_healpy, 136, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__20)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":178 * return maps * * def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, # <<<<<<<<<<<<<< * datapath = None): * """Computes the alm of a Healpix map. */ __pyx_tuple__21 = PyTuple_Pack(32, __pyx_n_s_m, __pyx_n_s_lmax, __pyx_n_s_mmax, __pyx_n_s_niter, __pyx_n_s_use_weights, __pyx_n_s_datapath, __pyx_n_s_info, __pyx_n_s_polarization, __pyx_n_s_mi, __pyx_n_s_mq, __pyx_n_s_mu, __pyx_n_s_mask_mi, __pyx_n_s_mask_mq, __pyx_n_s_mask_mu, __pyx_n_s_lmax_2, __pyx_n_s_mmax_2, __pyx_n_s_nside, __pyx_n_s_npix, __pyx_n_s_MI, __pyx_n_s_MQ, __pyx_n_s_MU, __pyx_n_s_n_alm, __pyx_n_s_almI, __pyx_n_s_almG, __pyx_n_s_almC, __pyx_n_s_AI, __pyx_n_s_AG, __pyx_n_s_AC, __pyx_n_s_w_arr, __pyx_n_s_i, __pyx_n_s_c_datapath, __pyx_n_s_weightfile); if (unlikely(!__pyx_tuple__21)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__21); __Pyx_GIVEREF(__pyx_tuple__21); __pyx_codeobj__22 = (PyObject*)__Pyx_PyCode_New(6, 0, 32, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__21, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_map2alm, 178, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__22)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":311 * * * def alm2cl(alms, alms2 = None, lmax = None, mmax = None, lmax_out = None): # <<<<<<<<<<<<<< * """Computes (cross-)spectra from alm(s). If alm2 is given, cross-spectra between * alm and alm2 are computed. If alm (and alm2 if provided) contains n alm, */ __pyx_tuple__23 = PyTuple_Pack(22, __pyx_n_s_alms, __pyx_n_s_alms2, __pyx_n_s_lmax, __pyx_n_s_mmax, __pyx_n_s_lmax_out, __pyx_n_s_Nspec, __pyx_n_s_Nspec2, __pyx_n_s_alms_lonely, __pyx_n_s_almsize, __pyx_n_s_i, __pyx_n_s_j, __pyx_n_s_l, __pyx_n_s_m, __pyx_n_s_limit, __pyx_n_s_lmax_2, __pyx_n_s_mmax_2, __pyx_n_s_lmax_out_2, __pyx_n_s_powspec, __pyx_n_s_alm1, __pyx_n_s_alm2, __pyx_n_s_spectra, __pyx_n_s_n); if (unlikely(!__pyx_tuple__23)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 311; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__23); __Pyx_GIVEREF(__pyx_tuple__23); __pyx_codeobj__24 = (PyObject*)__Pyx_PyCode_New(5, 0, 22, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__23, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_alm2cl, 311, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__24)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 311; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":423 * @cython.wraparound(False) * @cython.boundscheck(False) * def almxfl(alm, fl, mmax = None, inplace = False): # <<<<<<<<<<<<<< * """Multiply an a_lm by a vector b_l. * */ __pyx_tuple__25 = PyTuple_Pack(14, __pyx_n_s_alm, __pyx_n_s_fl, __pyx_n_s_mmax, __pyx_n_s_inplace, __pyx_n_s_alm_2, __pyx_n_s_fl_2, __pyx_n_s_lmax_2, __pyx_n_s_mmax_2, __pyx_n_s_l, __pyx_n_s_m, __pyx_n_s_f, __pyx_n_s_maxm, __pyx_n_s_i, __pyx_n_s_flsize); if (unlikely(!__pyx_tuple__25)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__25); __Pyx_GIVEREF(__pyx_tuple__25); __pyx_codeobj__26 = (PyObject*)__Pyx_PyCode_New(4, 0, 14, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__25, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_almxfl, 423, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__26)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":472 * * * def rotate_alm(alm not None, double psi, double theta, double phi, lmax=None, # <<<<<<<<<<<<<< * mmax=None): * """ */ __pyx_tuple__27 = PyTuple_Pack(13, __pyx_n_s_alm, __pyx_n_s_psi, __pyx_n_s_theta, __pyx_n_s_phi, __pyx_n_s_lmax, __pyx_n_s_mmax, __pyx_n_s_a, __pyx_n_s_ai, __pyx_n_s_AI, __pyx_n_s_ag, __pyx_n_s_ac, __pyx_n_s_AG, __pyx_n_s_AC); if (unlikely(!__pyx_tuple__27)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__27); __Pyx_GIVEREF(__pyx_tuple__27); __pyx_codeobj__28 = (PyObject*)__Pyx_PyCode_New(6, 0, 13, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__27, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_rotate_alm, 472, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__28)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":536 * * * def alm_getlmmax(a, lmax, mmax): # <<<<<<<<<<<<<< * if lmax is None: * if mmax is None: */ __pyx_tuple__29 = PyTuple_Pack(3, __pyx_n_s_a, __pyx_n_s_lmax, __pyx_n_s_mmax); if (unlikely(!__pyx_tuple__29)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__29); __Pyx_GIVEREF(__pyx_tuple__29); __pyx_codeobj__30 = (PyObject*)__Pyx_PyCode_New(3, 0, 3, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__29, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_alm_getlmmax, 536, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__30)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_RefNannyFinishContext(); return 0; __pyx_L1_error:; __Pyx_RefNannyFinishContext(); return -1; } static int __Pyx_InitGlobals(void) { if (__Pyx_InitStrings(__pyx_string_tab) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __pyx_float_0_0 = PyFloat_FromDouble(0.0); if (unlikely(!__pyx_float_0_0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_0 = PyInt_FromLong(0); if (unlikely(!__pyx_int_0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_1 = PyInt_FromLong(1); if (unlikely(!__pyx_int_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_2 = PyInt_FromLong(2); if (unlikely(!__pyx_int_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_3 = PyInt_FromLong(3); if (unlikely(!__pyx_int_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_int_neg_3 = PyInt_FromLong(-3); if (unlikely(!__pyx_int_neg_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} return 0; __pyx_L1_error:; return -1; } #if PY_MAJOR_VERSION < 3 PyMODINIT_FUNC init_sphtools(void); /*proto*/ PyMODINIT_FUNC init_sphtools(void) #else PyMODINIT_FUNC PyInit__sphtools(void); /*proto*/ PyMODINIT_FUNC PyInit__sphtools(void) #endif { PyObject *__pyx_t_1 = NULL; PyObject *__pyx_t_2 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannyDeclarations #if CYTHON_REFNANNY __Pyx_RefNanny = __Pyx_RefNannyImportAPI("refnanny"); if (!__Pyx_RefNanny) { PyErr_Clear(); __Pyx_RefNanny = __Pyx_RefNannyImportAPI("Cython.Runtime.refnanny"); if (!__Pyx_RefNanny) Py_FatalError("failed to import 'refnanny' module"); } #endif __Pyx_RefNannySetupContext("PyMODINIT_FUNC PyInit__sphtools(void)", 0); if ( __Pyx_check_binary_version() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_empty_bytes = PyBytes_FromStringAndSize("", 0); if (unlikely(!__pyx_empty_bytes)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #ifdef __Pyx_CyFunction_USED if (__Pyx_CyFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif #ifdef __Pyx_FusedFunction_USED if (__pyx_FusedFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif #ifdef __Pyx_Generator_USED if (__pyx_Generator_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif /*--- Library function declarations ---*/ /*--- Threads initialization code ---*/ #if defined(__PYX_FORCE_INIT_THREADS) && __PYX_FORCE_INIT_THREADS #ifdef WITH_THREAD /* Python build with threading support? */ PyEval_InitThreads(); #endif #endif /*--- Module creation code ---*/ #if PY_MAJOR_VERSION < 3 __pyx_m = Py_InitModule4(__Pyx_NAMESTR("_sphtools"), __pyx_methods, 0, 0, PYTHON_API_VERSION); Py_XINCREF(__pyx_m); #else __pyx_m = PyModule_Create(&__pyx_moduledef); #endif if (unlikely(!__pyx_m)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_d = PyModule_GetDict(__pyx_m); if (unlikely(!__pyx_d)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} Py_INCREF(__pyx_d); __pyx_b = PyImport_AddModule(__Pyx_NAMESTR(__Pyx_BUILTIN_MODULE_NAME)); if (unlikely(!__pyx_b)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #if CYTHON_COMPILING_IN_PYPY Py_INCREF(__pyx_b); #endif if (__Pyx_SetAttrString(__pyx_m, "__builtins__", __pyx_b) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; /*--- Initialize various global constants etc. ---*/ if (unlikely(__Pyx_InitGlobals() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #if PY_MAJOR_VERSION < 3 && (__PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT) if (__Pyx_init_sys_getdefaultencoding_params() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif if (__pyx_module_is_main_healpy___sphtools) { if (__Pyx_SetAttrString(__pyx_m, "__name__", __pyx_n_s_main) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; } #if PY_MAJOR_VERSION >= 3 { PyObject *modules = PyImport_GetModuleDict(); if (unlikely(!modules)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (!PyDict_GetItemString(modules, "healpy._sphtools")) { if (unlikely(PyDict_SetItemString(modules, "healpy._sphtools", __pyx_m) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } } #endif /*--- Builtin init code ---*/ if (unlikely(__Pyx_InitCachedBuiltins() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Constants init code ---*/ if (unlikely(__Pyx_InitCachedConstants() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Global init code ---*/ /*--- Variable export code ---*/ /*--- Function export code ---*/ /*--- Type init code ---*/ /*--- Type import code ---*/ __pyx_ptype_7cpython_4type_type = __Pyx_ImportType(__Pyx_BUILTIN_MODULE_NAME, "type", #if CYTHON_COMPILING_IN_PYPY sizeof(PyTypeObject), #else sizeof(PyHeapTypeObject), #endif 0); if (unlikely(!__pyx_ptype_7cpython_4type_type)) {__pyx_filename = __pyx_f[3]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_dtype = __Pyx_ImportType("numpy", "dtype", sizeof(PyArray_Descr), 0); if (unlikely(!__pyx_ptype_5numpy_dtype)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 155; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_flatiter = __Pyx_ImportType("numpy", "flatiter", sizeof(PyArrayIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_flatiter)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 165; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_broadcast = __Pyx_ImportType("numpy", "broadcast", sizeof(PyArrayMultiIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_broadcast)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 169; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_ndarray = __Pyx_ImportType("numpy", "ndarray", sizeof(PyArrayObject), 0); if (unlikely(!__pyx_ptype_5numpy_ndarray)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_ufunc = __Pyx_ImportType("numpy", "ufunc", sizeof(PyUFuncObject), 0); if (unlikely(!__pyx_ptype_5numpy_ufunc)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 861; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Variable import code ---*/ /*--- Function import code ---*/ /*--- Execution code ---*/ /* "healpy/src/_sphtools.pyx":4 * # Wrapper around the query_disc method of Healpix_base class * * import numpy as np # <<<<<<<<<<<<<< * cimport numpy as np * from libcpp.string cimport string */ __pyx_t_1 = __Pyx_Import(__pyx_n_s_numpy, 0, -1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 4; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_np, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 4; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":9 * from libc.math cimport sqrt, floor, fabs * cimport libc * from healpy import npix2nside, nside2npix # <<<<<<<<<<<<<< * from healpy.pixelfunc import maptype * import os */ __pyx_t_1 = PyList_New(2); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_INCREF(__pyx_n_s_npix2nside); PyList_SET_ITEM(__pyx_t_1, 0, __pyx_n_s_npix2nside); __Pyx_GIVEREF(__pyx_n_s_npix2nside); __Pyx_INCREF(__pyx_n_s_nside2npix); PyList_SET_ITEM(__pyx_t_1, 1, __pyx_n_s_nside2npix); __Pyx_GIVEREF(__pyx_n_s_nside2npix); __pyx_t_2 = __Pyx_Import(__pyx_n_s_healpy, __pyx_t_1, -1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_ImportFrom(__pyx_t_2, __pyx_n_s_npix2nside); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_npix2nside, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __pyx_t_1 = __Pyx_ImportFrom(__pyx_t_2, __pyx_n_s_nside2npix); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_nside2npix, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; /* "healpy/src/_sphtools.pyx":10 * cimport libc * from healpy import npix2nside, nside2npix * from healpy.pixelfunc import maptype # <<<<<<<<<<<<<< * import os * import cython */ __pyx_t_2 = PyList_New(1); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 10; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __Pyx_INCREF(__pyx_n_s_maptype); PyList_SET_ITEM(__pyx_t_2, 0, __pyx_n_s_maptype); __Pyx_GIVEREF(__pyx_n_s_maptype); __pyx_t_1 = __Pyx_Import(__pyx_n_s_healpy_pixelfunc, __pyx_t_2, -1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 10; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __pyx_t_2 = __Pyx_ImportFrom(__pyx_t_1, __pyx_n_s_maptype); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 10; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); if (PyDict_SetItem(__pyx_d, __pyx_n_s_maptype, __pyx_t_2) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 10; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":11 * from healpy import npix2nside, nside2npix * from healpy.pixelfunc import maptype * import os # <<<<<<<<<<<<<< * import cython * from libcpp cimport bool as cbool */ __pyx_t_1 = __Pyx_Import(__pyx_n_s_os, 0, -1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 11; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_os, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 11; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":17 * from _common cimport tsize, arr, xcomplex, Healpix_Ordering_Scheme, RING, NEST, Healpix_Map, Alm, ndarray2map, ndarray2alm * * cdef double UNSEEN = -1.6375e30 # <<<<<<<<<<<<<< * cdef double rtol_UNSEEN = 1.e-7 * 1.6375e30 * */ __pyx_v_6healpy_9_sphtools_UNSEEN = -1.6375e30; /* "healpy/src/_sphtools.pyx":18 * * cdef double UNSEEN = -1.6375e30 * cdef double rtol_UNSEEN = 1.e-7 * 1.6375e30 # <<<<<<<<<<<<<< * * cdef extern from "alm_healpix_tools.h": */ __pyx_v_6healpy_9_sphtools_rtol_UNSEEN = (1.e-7 * 1.6375e30); /* "healpy/src/_sphtools.pyx":52 * cdef void read_weight_ring (string &dir, int nside, arr[double] &weight) * * DATAPATH = None # <<<<<<<<<<<<<< * * def get_datapath(): */ if (PyDict_SetItem(__pyx_d, __pyx_n_s_DATAPATH, Py_None) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_sphtools.pyx":54 * DATAPATH = None * * def get_datapath(): # <<<<<<<<<<<<<< * global DATAPATH * if DATAPATH is None: */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_1get_datapath, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_get_datapath, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":60 * return DATAPATH * * def map2alm_spin_healpy(maps, spin, lmax = None, mmax = None): # <<<<<<<<<<<<<< * """Computes the spinned alm of a 2 Healpix maps. * */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_3map2alm_spin_healpy, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 60; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_map2alm_spin_healpy, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 60; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":136 * return alms * * def alm2map_spin_healpy(alms, nside, spin, lmax, mmax=None): # <<<<<<<<<<<<<< * """Computes maps from a set of 2 spinned alm * */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_5alm2map_spin_healpy, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_alm2map_spin_healpy, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":178 * return maps * * def map2alm(m, lmax = None, mmax = None, niter = 3, use_weights = False, # <<<<<<<<<<<<<< * datapath = None): * """Computes the alm of a Healpix map. */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_7map2alm, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_map2alm, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":311 * * * def alm2cl(alms, alms2 = None, lmax = None, mmax = None, lmax_out = None): # <<<<<<<<<<<<<< * """Computes (cross-)spectra from alm(s). If alm2 is given, cross-spectra between * alm and alm2 are computed. If alm (and alm2 if provided) contains n alm, */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_9alm2cl, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 311; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_alm2cl, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 311; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":423 * @cython.wraparound(False) * @cython.boundscheck(False) * def almxfl(alm, fl, mmax = None, inplace = False): # <<<<<<<<<<<<<< * """Multiply an a_lm by a vector b_l. * */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_11almxfl, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_almxfl, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 423; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":472 * * * def rotate_alm(alm not None, double psi, double theta, double phi, lmax=None, # <<<<<<<<<<<<<< * mmax=None): * """ */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_13rotate_alm, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_rotate_alm, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 472; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":536 * * * def alm_getlmmax(a, lmax, mmax): # <<<<<<<<<<<<<< * if lmax is None: * if mmax is None: */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_9_sphtools_15alm_getlmmax, NULL, __pyx_n_s_healpy__sphtools); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_alm_getlmmax, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 536; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_sphtools.pyx":1 * # coding: utf-8 # <<<<<<<<<<<<<< * # Wrapper around the query_disc method of Healpix_base class * */ __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_test, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_2); if (__pyx_m) { __Pyx_AddTraceback("init healpy._sphtools", __pyx_clineno, __pyx_lineno, __pyx_filename); Py_DECREF(__pyx_m); __pyx_m = 0; } else if (!PyErr_Occurred()) { PyErr_SetString(PyExc_ImportError, "init healpy._sphtools"); } __pyx_L0:; __Pyx_RefNannyFinishContext(); #if PY_MAJOR_VERSION < 3 return; #else return __pyx_m; #endif } /* Runtime support code */ #if CYTHON_REFNANNY static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname) { PyObject *m = NULL, *p = NULL; void *r = NULL; m = PyImport_ImportModule((char *)modname); if (!m) goto end; p = PyObject_GetAttrString(m, (char *)"RefNannyAPI"); if (!p) goto end; r = PyLong_AsVoidPtr(p); end: Py_XDECREF(p); Py_XDECREF(m); return (__Pyx_RefNannyAPIStruct *)r; } #endif /* CYTHON_REFNANNY */ static PyObject *__Pyx_GetBuiltinName(PyObject *name) { PyObject* result = __Pyx_PyObject_GetAttrStr(__pyx_b, name); if (unlikely(!result)) { PyErr_Format(PyExc_NameError, #if PY_MAJOR_VERSION >= 3 "name '%U' is not defined", name); #else "name '%.200s' is not defined", PyString_AS_STRING(name)); #endif } return result; } static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name) { PyObject *result; #if CYTHON_COMPILING_IN_CPYTHON result = PyDict_GetItem(__pyx_d, name); if (result) { Py_INCREF(result); } else { #else result = PyObject_GetItem(__pyx_d, name); if (!result) { PyErr_Clear(); #endif result = __Pyx_GetBuiltinName(name); } return result; } #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw) { PyObject *result; ternaryfunc call = func->ob_type->tp_call; if (unlikely(!call)) return PyObject_Call(func, arg, kw); #if PY_VERSION_HEX >= 0x02060000 if (unlikely(Py_EnterRecursiveCall((char*)" while calling a Python object"))) return NULL; #endif result = (*call)(func, arg, kw); #if PY_VERSION_HEX >= 0x02060000 Py_LeaveRecursiveCall(); #endif if (unlikely(!result) && unlikely(!PyErr_Occurred())) { PyErr_SetString( PyExc_SystemError, "NULL result without error in PyObject_Call"); } return result; } #endif static void __Pyx_RaiseArgtupleInvalid( const char* func_name, int exact, Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found) { Py_ssize_t num_expected; const char *more_or_less; if (num_found < num_min) { num_expected = num_min; more_or_less = "at least"; } else { num_expected = num_max; more_or_less = "at most"; } if (exact) { more_or_less = "exactly"; } PyErr_Format(PyExc_TypeError, "%.200s() takes %.8s %" CYTHON_FORMAT_SSIZE_T "d positional argument%.1s (%" CYTHON_FORMAT_SSIZE_T "d given)", func_name, more_or_less, num_expected, (num_expected == 1) ? "" : "s", num_found); } static void __Pyx_RaiseDoubleKeywordsError( const char* func_name, PyObject* kw_name) { PyErr_Format(PyExc_TypeError, #if PY_MAJOR_VERSION >= 3 "%s() got multiple values for keyword argument '%U'", func_name, kw_name); #else "%s() got multiple values for keyword argument '%s'", func_name, PyString_AsString(kw_name)); #endif } static int __Pyx_ParseOptionalKeywords( PyObject *kwds, PyObject **argnames[], PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args, const char* function_name) { PyObject *key = 0, *value = 0; Py_ssize_t pos = 0; PyObject*** name; PyObject*** first_kw_arg = argnames + num_pos_args; while (PyDict_Next(kwds, &pos, &key, &value)) { name = first_kw_arg; while (*name && (**name != key)) name++; if (*name) { values[name-argnames] = value; continue; } name = first_kw_arg; #if PY_MAJOR_VERSION < 3 if (likely(PyString_CheckExact(key)) || likely(PyString_Check(key))) { while (*name) { if ((CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**name) == PyString_GET_SIZE(key)) && _PyString_Eq(**name, key)) { values[name-argnames] = value; break; } name++; } if (*name) continue; else { PyObject*** argname = argnames; while (argname != first_kw_arg) { if ((**argname == key) || ( (CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**argname) == PyString_GET_SIZE(key)) && _PyString_Eq(**argname, key))) { goto arg_passed_twice; } argname++; } } } else #endif if (likely(PyUnicode_Check(key))) { while (*name) { int cmp = (**name == key) ? 0 : #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3 (PyUnicode_GET_SIZE(**name) != PyUnicode_GET_SIZE(key)) ? 1 : #endif PyUnicode_Compare(**name, key); if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad; if (cmp == 0) { values[name-argnames] = value; break; } name++; } if (*name) continue; else { PyObject*** argname = argnames; while (argname != first_kw_arg) { int cmp = (**argname == key) ? 0 : #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3 (PyUnicode_GET_SIZE(**argname) != PyUnicode_GET_SIZE(key)) ? 1 : #endif PyUnicode_Compare(**argname, key); if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad; if (cmp == 0) goto arg_passed_twice; argname++; } } } else goto invalid_keyword_type; if (kwds2) { if (unlikely(PyDict_SetItem(kwds2, key, value))) goto bad; } else { goto invalid_keyword; } } return 0; arg_passed_twice: __Pyx_RaiseDoubleKeywordsError(function_name, key); goto bad; invalid_keyword_type: PyErr_Format(PyExc_TypeError, "%.200s() keywords must be strings", function_name); goto bad; invalid_keyword: PyErr_Format(PyExc_TypeError, #if PY_MAJOR_VERSION < 3 "%.200s() got an unexpected keyword argument '%.200s'", function_name, PyString_AsString(key)); #else "%s() got an unexpected keyword argument '%U'", function_name, key); #endif bad: return -1; } static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type) { if (unlikely(!type)) { PyErr_SetString(PyExc_SystemError, "Missing type object"); return 0; } if (likely(PyObject_TypeCheck(obj, type))) return 1; PyErr_Format(PyExc_TypeError, "Cannot convert %.200s to %.200s", Py_TYPE(obj)->tp_name, type->tp_name); return 0; } static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Generic(PyObject *o, PyObject* j) { PyObject *r; if (!j) return NULL; r = PyObject_GetItem(o, j); Py_DECREF(j); return r; } static CYTHON_INLINE PyObject *__Pyx_GetItemInt_List_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck) { #if CYTHON_COMPILING_IN_CPYTHON if (wraparound & unlikely(i < 0)) i += PyList_GET_SIZE(o); if ((!boundscheck) || likely((0 <= i) & (i < PyList_GET_SIZE(o)))) { PyObject *r = PyList_GET_ITEM(o, i); Py_INCREF(r); return r; } return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i)); #else return PySequence_GetItem(o, i); #endif } static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Tuple_Fast(PyObject *o, Py_ssize_t i, int wraparound, int boundscheck) { #if CYTHON_COMPILING_IN_CPYTHON if (wraparound & unlikely(i < 0)) i += PyTuple_GET_SIZE(o); if ((!boundscheck) || likely((0 <= i) & (i < PyTuple_GET_SIZE(o)))) { PyObject *r = PyTuple_GET_ITEM(o, i); Py_INCREF(r); return r; } return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i)); #else return PySequence_GetItem(o, i); #endif } static CYTHON_INLINE PyObject *__Pyx_GetItemInt_Fast(PyObject *o, Py_ssize_t i, int is_list, int wraparound, int boundscheck) { #if CYTHON_COMPILING_IN_CPYTHON if (is_list || PyList_CheckExact(o)) { Py_ssize_t n = ((!wraparound) | likely(i >= 0)) ? i : i + PyList_GET_SIZE(o); if ((!boundscheck) || (likely((n >= 0) & (n < PyList_GET_SIZE(o))))) { PyObject *r = PyList_GET_ITEM(o, n); Py_INCREF(r); return r; } } else if (PyTuple_CheckExact(o)) { Py_ssize_t n = ((!wraparound) | likely(i >= 0)) ? i : i + PyTuple_GET_SIZE(o); if ((!boundscheck) || likely((n >= 0) & (n < PyTuple_GET_SIZE(o)))) { PyObject *r = PyTuple_GET_ITEM(o, n); Py_INCREF(r); return r; } } else { PySequenceMethods *m = Py_TYPE(o)->tp_as_sequence; if (likely(m && m->sq_item)) { if (wraparound && unlikely(i < 0) && likely(m->sq_length)) { Py_ssize_t l = m->sq_length(o); if (likely(l >= 0)) { i += l; } else { if (PyErr_ExceptionMatches(PyExc_OverflowError)) PyErr_Clear(); else return NULL; } } return m->sq_item(o, i); } } #else if (is_list || PySequence_Check(o)) { return PySequence_GetItem(o, i); } #endif return __Pyx_GetItemInt_Generic(o, PyInt_FromSsize_t(i)); } static CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb) { #if CYTHON_COMPILING_IN_CPYTHON PyObject *tmp_type, *tmp_value, *tmp_tb; PyThreadState *tstate = PyThreadState_GET(); tmp_type = tstate->curexc_type; tmp_value = tstate->curexc_value; tmp_tb = tstate->curexc_traceback; tstate->curexc_type = type; tstate->curexc_value = value; tstate->curexc_traceback = tb; Py_XDECREF(tmp_type); Py_XDECREF(tmp_value); Py_XDECREF(tmp_tb); #else PyErr_Restore(type, value, tb); #endif } static CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb) { #if CYTHON_COMPILING_IN_CPYTHON PyThreadState *tstate = PyThreadState_GET(); *type = tstate->curexc_type; *value = tstate->curexc_value; *tb = tstate->curexc_traceback; tstate->curexc_type = 0; tstate->curexc_value = 0; tstate->curexc_traceback = 0; #else PyErr_Fetch(type, value, tb); #endif } #if PY_MAJOR_VERSION < 3 static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, CYTHON_UNUSED PyObject *cause) { Py_XINCREF(type); if (!value || value == Py_None) value = NULL; else Py_INCREF(value); if (!tb || tb == Py_None) tb = NULL; else { Py_INCREF(tb); if (!PyTraceBack_Check(tb)) { PyErr_SetString(PyExc_TypeError, "raise: arg 3 must be a traceback or None"); goto raise_error; } } #if PY_VERSION_HEX < 0x02050000 if (PyClass_Check(type)) { #else if (PyType_Check(type)) { #endif #if CYTHON_COMPILING_IN_PYPY if (!value) { Py_INCREF(Py_None); value = Py_None; } #endif PyErr_NormalizeException(&type, &value, &tb); } else { if (value) { PyErr_SetString(PyExc_TypeError, "instance exception may not have a separate value"); goto raise_error; } value = type; #if PY_VERSION_HEX < 0x02050000 if (PyInstance_Check(type)) { type = (PyObject*) ((PyInstanceObject*)type)->in_class; Py_INCREF(type); } else { type = 0; PyErr_SetString(PyExc_TypeError, "raise: exception must be an old-style class or instance"); goto raise_error; } #else type = (PyObject*) Py_TYPE(type); Py_INCREF(type); if (!PyType_IsSubtype((PyTypeObject *)type, (PyTypeObject *)PyExc_BaseException)) { PyErr_SetString(PyExc_TypeError, "raise: exception class must be a subclass of BaseException"); goto raise_error; } #endif } __Pyx_ErrRestore(type, value, tb); return; raise_error: Py_XDECREF(value); Py_XDECREF(type); Py_XDECREF(tb); return; } #else /* Python 3+ */ static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause) { PyObject* owned_instance = NULL; if (tb == Py_None) { tb = 0; } else if (tb && !PyTraceBack_Check(tb)) { PyErr_SetString(PyExc_TypeError, "raise: arg 3 must be a traceback or None"); goto bad; } if (value == Py_None) value = 0; if (PyExceptionInstance_Check(type)) { if (value) { PyErr_SetString(PyExc_TypeError, "instance exception may not have a separate value"); goto bad; } value = type; type = (PyObject*) Py_TYPE(value); } else if (PyExceptionClass_Check(type)) { PyObject *instance_class = NULL; if (value && PyExceptionInstance_Check(value)) { instance_class = (PyObject*) Py_TYPE(value); if (instance_class != type) { if (PyObject_IsSubclass(instance_class, type)) { type = instance_class; } else { instance_class = NULL; } } } if (!instance_class) { PyObject *args; if (!value) args = PyTuple_New(0); else if (PyTuple_Check(value)) { Py_INCREF(value); args = value; } else args = PyTuple_Pack(1, value); if (!args) goto bad; owned_instance = PyObject_Call(type, args, NULL); Py_DECREF(args); if (!owned_instance) goto bad; value = owned_instance; if (!PyExceptionInstance_Check(value)) { PyErr_Format(PyExc_TypeError, "calling %R should have returned an instance of " "BaseException, not %R", type, Py_TYPE(value)); goto bad; } } } else { PyErr_SetString(PyExc_TypeError, "raise: exception class must be a subclass of BaseException"); goto bad; } #if PY_VERSION_HEX >= 0x03030000 if (cause) { #else if (cause && cause != Py_None) { #endif PyObject *fixed_cause; if (cause == Py_None) { fixed_cause = NULL; } else if (PyExceptionClass_Check(cause)) { fixed_cause = PyObject_CallObject(cause, NULL); if (fixed_cause == NULL) goto bad; } else if (PyExceptionInstance_Check(cause)) { fixed_cause = cause; Py_INCREF(fixed_cause); } else { PyErr_SetString(PyExc_TypeError, "exception causes must derive from " "BaseException"); goto bad; } PyException_SetCause(value, fixed_cause); } PyErr_SetObject(type, value); if (tb) { PyThreadState *tstate = PyThreadState_GET(); PyObject* tmp_tb = tstate->curexc_traceback; if (tb != tmp_tb) { Py_INCREF(tb); tstate->curexc_traceback = tb; Py_XDECREF(tmp_tb); } } bad: Py_XDECREF(owned_instance); return; } #endif static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected) { PyErr_Format(PyExc_ValueError, "too many values to unpack (expected %" CYTHON_FORMAT_SSIZE_T "d)", expected); } static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) { PyErr_Format(PyExc_ValueError, "need more than %" CYTHON_FORMAT_SSIZE_T "d value%.1s to unpack", index, (index == 1) ? "" : "s"); } static CYTHON_INLINE int __Pyx_IterFinish(void) { #if CYTHON_COMPILING_IN_CPYTHON PyThreadState *tstate = PyThreadState_GET(); PyObject* exc_type = tstate->curexc_type; if (unlikely(exc_type)) { if (likely(exc_type == PyExc_StopIteration) || PyErr_GivenExceptionMatches(exc_type, PyExc_StopIteration)) { PyObject *exc_value, *exc_tb; exc_value = tstate->curexc_value; exc_tb = tstate->curexc_traceback; tstate->curexc_type = 0; tstate->curexc_value = 0; tstate->curexc_traceback = 0; Py_DECREF(exc_type); Py_XDECREF(exc_value); Py_XDECREF(exc_tb); return 0; } else { return -1; } } return 0; #else if (unlikely(PyErr_Occurred())) { if (likely(PyErr_ExceptionMatches(PyExc_StopIteration))) { PyErr_Clear(); return 0; } else { return -1; } } return 0; #endif } static int __Pyx_IternextUnpackEndCheck(PyObject *retval, Py_ssize_t expected) { if (unlikely(retval)) { Py_DECREF(retval); __Pyx_RaiseTooManyValuesError(expected); return -1; } else { return __Pyx_IterFinish(); } return 0; } static CYTHON_INLINE void __Pyx_RaiseUnboundLocalError(const char *varname) { PyErr_Format(PyExc_UnboundLocalError, "local variable '%s' referenced before assignment", varname); } static CYTHON_INLINE int __Pyx_IsLittleEndian(void) { unsigned int n = 1; return *(unsigned char*)(&n) != 0; } static void __Pyx_BufFmt_Init(__Pyx_BufFmt_Context* ctx, __Pyx_BufFmt_StackElem* stack, __Pyx_TypeInfo* type) { stack[0].field = &ctx->root; stack[0].parent_offset = 0; ctx->root.type = type; ctx->root.name = "buffer dtype"; ctx->root.offset = 0; ctx->head = stack; ctx->head->field = &ctx->root; ctx->fmt_offset = 0; ctx->head->parent_offset = 0; ctx->new_packmode = '@'; ctx->enc_packmode = '@'; ctx->new_count = 1; ctx->enc_count = 0; ctx->enc_type = 0; ctx->is_complex = 0; ctx->is_valid_array = 0; ctx->struct_alignment = 0; while (type->typegroup == 'S') { ++ctx->head; ctx->head->field = type->fields; ctx->head->parent_offset = 0; type = type->fields->type; } } static int __Pyx_BufFmt_ParseNumber(const char** ts) { int count; const char* t = *ts; if (*t < '0' || *t > '9') { return -1; } else { count = *t++ - '0'; while (*t >= '0' && *t < '9') { count *= 10; count += *t++ - '0'; } } *ts = t; return count; } static int __Pyx_BufFmt_ExpectNumber(const char **ts) { int number = __Pyx_BufFmt_ParseNumber(ts); if (number == -1) /* First char was not a digit */ PyErr_Format(PyExc_ValueError,\ "Does not understand character buffer dtype format string ('%c')", **ts); return number; } static void __Pyx_BufFmt_RaiseUnexpectedChar(char ch) { PyErr_Format(PyExc_ValueError, "Unexpected format string character: '%c'", ch); } static const char* __Pyx_BufFmt_DescribeTypeChar(char ch, int is_complex) { switch (ch) { case 'c': return "'char'"; case 'b': return "'signed char'"; case 'B': return "'unsigned char'"; case 'h': return "'short'"; case 'H': return "'unsigned short'"; case 'i': return "'int'"; case 'I': return "'unsigned int'"; case 'l': return "'long'"; case 'L': return "'unsigned long'"; case 'q': return "'long long'"; case 'Q': return "'unsigned long long'"; case 'f': return (is_complex ? "'complex float'" : "'float'"); case 'd': return (is_complex ? "'complex double'" : "'double'"); case 'g': return (is_complex ? "'complex long double'" : "'long double'"); case 'T': return "a struct"; case 'O': return "Python object"; case 'P': return "a pointer"; case 's': case 'p': return "a string"; case 0: return "end"; default: return "unparseable format string"; } } static size_t __Pyx_BufFmt_TypeCharToStandardSize(char ch, int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return 2; case 'i': case 'I': case 'l': case 'L': return 4; case 'q': case 'Q': return 8; case 'f': return (is_complex ? 8 : 4); case 'd': return (is_complex ? 16 : 8); case 'g': { PyErr_SetString(PyExc_ValueError, "Python does not define a standard format string size for long double ('g').."); return 0; } case 'O': case 'P': return sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } static size_t __Pyx_BufFmt_TypeCharToNativeSize(char ch, int is_complex) { switch (ch) { case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(short); case 'i': case 'I': return sizeof(int); case 'l': case 'L': return sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(float) * (is_complex ? 2 : 1); case 'd': return sizeof(double) * (is_complex ? 2 : 1); case 'g': return sizeof(long double) * (is_complex ? 2 : 1); case 'O': case 'P': return sizeof(void*); default: { __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } } typedef struct { char c; short x; } __Pyx_st_short; typedef struct { char c; int x; } __Pyx_st_int; typedef struct { char c; long x; } __Pyx_st_long; typedef struct { char c; float x; } __Pyx_st_float; typedef struct { char c; double x; } __Pyx_st_double; typedef struct { char c; long double x; } __Pyx_st_longdouble; typedef struct { char c; void *x; } __Pyx_st_void_p; #ifdef HAVE_LONG_LONG typedef struct { char c; PY_LONG_LONG x; } __Pyx_st_longlong; #endif static size_t __Pyx_BufFmt_TypeCharToAlignment(char ch, CYTHON_UNUSED int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(__Pyx_st_short) - sizeof(short); case 'i': case 'I': return sizeof(__Pyx_st_int) - sizeof(int); case 'l': case 'L': return sizeof(__Pyx_st_long) - sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(__Pyx_st_longlong) - sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(__Pyx_st_float) - sizeof(float); case 'd': return sizeof(__Pyx_st_double) - sizeof(double); case 'g': return sizeof(__Pyx_st_longdouble) - sizeof(long double); case 'P': case 'O': return sizeof(__Pyx_st_void_p) - sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } /* These are for computing the padding at the end of the struct to align on the first member of the struct. This will probably the same as above, but we don't have any guarantees. */ typedef struct { short x; char c; } __Pyx_pad_short; typedef struct { int x; char c; } __Pyx_pad_int; typedef struct { long x; char c; } __Pyx_pad_long; typedef struct { float x; char c; } __Pyx_pad_float; typedef struct { double x; char c; } __Pyx_pad_double; typedef struct { long double x; char c; } __Pyx_pad_longdouble; typedef struct { void *x; char c; } __Pyx_pad_void_p; #ifdef HAVE_LONG_LONG typedef struct { PY_LONG_LONG x; char c; } __Pyx_pad_longlong; #endif static size_t __Pyx_BufFmt_TypeCharToPadding(char ch, CYTHON_UNUSED int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(__Pyx_pad_short) - sizeof(short); case 'i': case 'I': return sizeof(__Pyx_pad_int) - sizeof(int); case 'l': case 'L': return sizeof(__Pyx_pad_long) - sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(__Pyx_pad_longlong) - sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(__Pyx_pad_float) - sizeof(float); case 'd': return sizeof(__Pyx_pad_double) - sizeof(double); case 'g': return sizeof(__Pyx_pad_longdouble) - sizeof(long double); case 'P': case 'O': return sizeof(__Pyx_pad_void_p) - sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } static char __Pyx_BufFmt_TypeCharToGroup(char ch, int is_complex) { switch (ch) { case 'c': return 'H'; case 'b': case 'h': case 'i': case 'l': case 'q': case 's': case 'p': return 'I'; case 'B': case 'H': case 'I': case 'L': case 'Q': return 'U'; case 'f': case 'd': case 'g': return (is_complex ? 'C' : 'R'); case 'O': return 'O'; case 'P': return 'P'; default: { __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } } static void __Pyx_BufFmt_RaiseExpected(__Pyx_BufFmt_Context* ctx) { if (ctx->head == NULL || ctx->head->field == &ctx->root) { const char* expected; const char* quote; if (ctx->head == NULL) { expected = "end"; quote = ""; } else { expected = ctx->head->field->type->name; quote = "'"; } PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch, expected %s%s%s but got %s", quote, expected, quote, __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex)); } else { __Pyx_StructField* field = ctx->head->field; __Pyx_StructField* parent = (ctx->head - 1)->field; PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch, expected '%s' but got %s in '%s.%s'", field->type->name, __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex), parent->type->name, field->name); } } static int __Pyx_BufFmt_ProcessTypeChunk(__Pyx_BufFmt_Context* ctx) { char group; size_t size, offset, arraysize = 1; if (ctx->enc_type == 0) return 0; if (ctx->head->field->type->arraysize[0]) { int i, ndim = 0; if (ctx->enc_type == 's' || ctx->enc_type == 'p') { ctx->is_valid_array = ctx->head->field->type->ndim == 1; ndim = 1; if (ctx->enc_count != ctx->head->field->type->arraysize[0]) { PyErr_Format(PyExc_ValueError, "Expected a dimension of size %zu, got %zu", ctx->head->field->type->arraysize[0], ctx->enc_count); return -1; } } if (!ctx->is_valid_array) { PyErr_Format(PyExc_ValueError, "Expected %d dimensions, got %d", ctx->head->field->type->ndim, ndim); return -1; } for (i = 0; i < ctx->head->field->type->ndim; i++) { arraysize *= ctx->head->field->type->arraysize[i]; } ctx->is_valid_array = 0; ctx->enc_count = 1; } group = __Pyx_BufFmt_TypeCharToGroup(ctx->enc_type, ctx->is_complex); do { __Pyx_StructField* field = ctx->head->field; __Pyx_TypeInfo* type = field->type; if (ctx->enc_packmode == '@' || ctx->enc_packmode == '^') { size = __Pyx_BufFmt_TypeCharToNativeSize(ctx->enc_type, ctx->is_complex); } else { size = __Pyx_BufFmt_TypeCharToStandardSize(ctx->enc_type, ctx->is_complex); } if (ctx->enc_packmode == '@') { size_t align_at = __Pyx_BufFmt_TypeCharToAlignment(ctx->enc_type, ctx->is_complex); size_t align_mod_offset; if (align_at == 0) return -1; align_mod_offset = ctx->fmt_offset % align_at; if (align_mod_offset > 0) ctx->fmt_offset += align_at - align_mod_offset; if (ctx->struct_alignment == 0) ctx->struct_alignment = __Pyx_BufFmt_TypeCharToPadding(ctx->enc_type, ctx->is_complex); } if (type->size != size || type->typegroup != group) { if (type->typegroup == 'C' && type->fields != NULL) { size_t parent_offset = ctx->head->parent_offset + field->offset; ++ctx->head; ctx->head->field = type->fields; ctx->head->parent_offset = parent_offset; continue; } if ((type->typegroup == 'H' || group == 'H') && type->size == size) { } else { __Pyx_BufFmt_RaiseExpected(ctx); return -1; } } offset = ctx->head->parent_offset + field->offset; if (ctx->fmt_offset != offset) { PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch; next field is at offset %" CYTHON_FORMAT_SSIZE_T "d but %" CYTHON_FORMAT_SSIZE_T "d expected", (Py_ssize_t)ctx->fmt_offset, (Py_ssize_t)offset); return -1; } ctx->fmt_offset += size; if (arraysize) ctx->fmt_offset += (arraysize - 1) * size; --ctx->enc_count; /* Consume from buffer string */ while (1) { if (field == &ctx->root) { ctx->head = NULL; if (ctx->enc_count != 0) { __Pyx_BufFmt_RaiseExpected(ctx); return -1; } break; /* breaks both loops as ctx->enc_count == 0 */ } ctx->head->field = ++field; if (field->type == NULL) { --ctx->head; field = ctx->head->field; continue; } else if (field->type->typegroup == 'S') { size_t parent_offset = ctx->head->parent_offset + field->offset; if (field->type->fields->type == NULL) continue; /* empty struct */ field = field->type->fields; ++ctx->head; ctx->head->field = field; ctx->head->parent_offset = parent_offset; break; } else { break; } } } while (ctx->enc_count); ctx->enc_type = 0; ctx->is_complex = 0; return 0; } static CYTHON_INLINE PyObject * __pyx_buffmt_parse_array(__Pyx_BufFmt_Context* ctx, const char** tsp) { const char *ts = *tsp; int i = 0, number; int ndim = ctx->head->field->type->ndim; ; ++ts; if (ctx->new_count != 1) { PyErr_SetString(PyExc_ValueError, "Cannot handle repeated arrays in format string"); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; while (*ts && *ts != ')') { switch (*ts) { case ' ': case '\f': case '\r': case '\n': case '\t': case '\v': continue; default: break; /* not a 'break' in the loop */ } number = __Pyx_BufFmt_ExpectNumber(&ts); if (number == -1) return NULL; if (i < ndim && (size_t) number != ctx->head->field->type->arraysize[i]) return PyErr_Format(PyExc_ValueError, "Expected a dimension of size %zu, got %d", ctx->head->field->type->arraysize[i], number); if (*ts != ',' && *ts != ')') return PyErr_Format(PyExc_ValueError, "Expected a comma in format string, got '%c'", *ts); if (*ts == ',') ts++; i++; } if (i != ndim) return PyErr_Format(PyExc_ValueError, "Expected %d dimension(s), got %d", ctx->head->field->type->ndim, i); if (!*ts) { PyErr_SetString(PyExc_ValueError, "Unexpected end of format string, expected ')'"); return NULL; } ctx->is_valid_array = 1; ctx->new_count = 1; *tsp = ++ts; return Py_None; } static const char* __Pyx_BufFmt_CheckString(__Pyx_BufFmt_Context* ctx, const char* ts) { int got_Z = 0; while (1) { switch(*ts) { case 0: if (ctx->enc_type != 0 && ctx->head == NULL) { __Pyx_BufFmt_RaiseExpected(ctx); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; if (ctx->head != NULL) { __Pyx_BufFmt_RaiseExpected(ctx); return NULL; } return ts; case ' ': case 10: case 13: ++ts; break; case '<': if (!__Pyx_IsLittleEndian()) { PyErr_SetString(PyExc_ValueError, "Little-endian buffer not supported on big-endian compiler"); return NULL; } ctx->new_packmode = '='; ++ts; break; case '>': case '!': if (__Pyx_IsLittleEndian()) { PyErr_SetString(PyExc_ValueError, "Big-endian buffer not supported on little-endian compiler"); return NULL; } ctx->new_packmode = '='; ++ts; break; case '=': case '@': case '^': ctx->new_packmode = *ts++; break; case 'T': /* substruct */ { const char* ts_after_sub; size_t i, struct_count = ctx->new_count; size_t struct_alignment = ctx->struct_alignment; ctx->new_count = 1; ++ts; if (*ts != '{') { PyErr_SetString(PyExc_ValueError, "Buffer acquisition: Expected '{' after 'T'"); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_type = 0; /* Erase processed last struct element */ ctx->enc_count = 0; ctx->struct_alignment = 0; ++ts; ts_after_sub = ts; for (i = 0; i != struct_count; ++i) { ts_after_sub = __Pyx_BufFmt_CheckString(ctx, ts); if (!ts_after_sub) return NULL; } ts = ts_after_sub; if (struct_alignment) ctx->struct_alignment = struct_alignment; } break; case '}': /* end of substruct; either repeat or move on */ { size_t alignment = ctx->struct_alignment; ++ts; if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_type = 0; /* Erase processed last struct element */ if (alignment && ctx->fmt_offset % alignment) { ctx->fmt_offset += alignment - (ctx->fmt_offset % alignment); } } return ts; case 'x': if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->fmt_offset += ctx->new_count; ctx->new_count = 1; ctx->enc_count = 0; ctx->enc_type = 0; ctx->enc_packmode = ctx->new_packmode; ++ts; break; case 'Z': got_Z = 1; ++ts; if (*ts != 'f' && *ts != 'd' && *ts != 'g') { __Pyx_BufFmt_RaiseUnexpectedChar('Z'); return NULL; } /* fall through */ case 'c': case 'b': case 'B': case 'h': case 'H': case 'i': case 'I': case 'l': case 'L': case 'q': case 'Q': case 'f': case 'd': case 'g': case 'O': case 's': case 'p': if (ctx->enc_type == *ts && got_Z == ctx->is_complex && ctx->enc_packmode == ctx->new_packmode) { ctx->enc_count += ctx->new_count; } else { if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_count = ctx->new_count; ctx->enc_packmode = ctx->new_packmode; ctx->enc_type = *ts; ctx->is_complex = got_Z; } ++ts; ctx->new_count = 1; got_Z = 0; break; case ':': ++ts; while(*ts != ':') ++ts; ++ts; break; case '(': if (!__pyx_buffmt_parse_array(ctx, &ts)) return NULL; break; default: { int number = __Pyx_BufFmt_ExpectNumber(&ts); if (number == -1) return NULL; ctx->new_count = (size_t)number; } } } } static CYTHON_INLINE void __Pyx_ZeroBuffer(Py_buffer* buf) { buf->buf = NULL; buf->obj = NULL; buf->strides = __Pyx_zeros; buf->shape = __Pyx_zeros; buf->suboffsets = __Pyx_minusones; } static CYTHON_INLINE int __Pyx_GetBufferAndValidate( Py_buffer* buf, PyObject* obj, __Pyx_TypeInfo* dtype, int flags, int nd, int cast, __Pyx_BufFmt_StackElem* stack) { if (obj == Py_None || obj == NULL) { __Pyx_ZeroBuffer(buf); return 0; } buf->buf = NULL; if (__Pyx_GetBuffer(obj, buf, flags) == -1) goto fail; if (buf->ndim != nd) { PyErr_Format(PyExc_ValueError, "Buffer has wrong number of dimensions (expected %d, got %d)", nd, buf->ndim); goto fail; } if (!cast) { __Pyx_BufFmt_Context ctx; __Pyx_BufFmt_Init(&ctx, stack, dtype); if (!__Pyx_BufFmt_CheckString(&ctx, buf->format)) goto fail; } if ((unsigned)buf->itemsize != dtype->size) { PyErr_Format(PyExc_ValueError, "Item size of buffer (%" CYTHON_FORMAT_SSIZE_T "d byte%s) does not match size of '%s' (%" CYTHON_FORMAT_SSIZE_T "d byte%s)", buf->itemsize, (buf->itemsize > 1) ? "s" : "", dtype->name, (Py_ssize_t)dtype->size, (dtype->size > 1) ? "s" : ""); goto fail; } if (buf->suboffsets == NULL) buf->suboffsets = __Pyx_minusones; return 0; fail:; __Pyx_ZeroBuffer(buf); return -1; } static CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info) { if (info->buf == NULL) return; if (info->suboffsets == __Pyx_minusones) info->suboffsets = NULL; __Pyx_ReleaseBuffer(info); } static void __Pyx_RaiseBufferFallbackError(void) { PyErr_SetString(PyExc_ValueError, "Buffer acquisition failed on assignment; and then reacquiring the old buffer failed too!"); } static void __Pyx_RaiseBufferIndexError(int axis) { PyErr_Format(PyExc_IndexError, "Out of bounds on buffer access (axis %d)", axis); } static CYTHON_INLINE int __Pyx_PyObject_Append(PyObject* L, PyObject* x) { if (likely(PyList_CheckExact(L))) { if (unlikely(__Pyx_PyList_Append(L, x) < 0)) return -1; } else { PyObject* retval = __Pyx_PyObject_CallMethod1(L, __pyx_n_s_append, x); if (unlikely(!retval)) return -1; Py_DECREF(retval); } return 0; } static CYTHON_INLINE long __Pyx_div_long(long a, long b) { long q = a / b; long r = a - q*b; q -= ((r != 0) & ((r ^ b) < 0)); return q; } static void __Pyx_WriteUnraisable(const char *name, CYTHON_UNUSED int clineno, CYTHON_UNUSED int lineno, CYTHON_UNUSED const char *filename, int full_traceback) { PyObject *old_exc, *old_val, *old_tb; PyObject *ctx; __Pyx_ErrFetch(&old_exc, &old_val, &old_tb); if (full_traceback) { Py_XINCREF(old_exc); Py_XINCREF(old_val); Py_XINCREF(old_tb); __Pyx_ErrRestore(old_exc, old_val, old_tb); PyErr_PrintEx(1); } #if PY_MAJOR_VERSION < 3 ctx = PyString_FromString(name); #else ctx = PyUnicode_FromString(name); #endif __Pyx_ErrRestore(old_exc, old_val, old_tb); if (!ctx) { PyErr_WriteUnraisable(Py_None); } else { PyErr_WriteUnraisable(ctx); Py_DECREF(ctx); } } static void __Pyx_RaiseArgumentTypeInvalid(const char* name, PyObject *obj, PyTypeObject *type) { PyErr_Format(PyExc_TypeError, "Argument '%.200s' has incorrect type (expected %.200s, got %.200s)", name, type->tp_name, Py_TYPE(obj)->tp_name); } static CYTHON_INLINE int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed, const char *name, int exact) { if (unlikely(!type)) { PyErr_SetString(PyExc_SystemError, "Missing type object"); return 0; } if (none_allowed && obj == Py_None) return 1; else if (exact) { if (likely(Py_TYPE(obj) == type)) return 1; #if PY_MAJOR_VERSION == 2 else if ((type == &PyBaseString_Type) && likely(__Pyx_PyBaseString_CheckExact(obj))) return 1; #endif } else { if (likely(PyObject_TypeCheck(obj, type))) return 1; } __Pyx_RaiseArgumentTypeInvalid(name, obj, type); return 0; } static CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void) { PyErr_SetString(PyExc_TypeError, "'NoneType' object is not iterable"); } static PyObject* __Pyx_ImportFrom(PyObject* module, PyObject* name) { PyObject* value = __Pyx_PyObject_GetAttrStr(module, name); if (unlikely(!value) && PyErr_ExceptionMatches(PyExc_AttributeError)) { PyErr_Format(PyExc_ImportError, #if PY_MAJOR_VERSION < 3 "cannot import name %.230s", PyString_AS_STRING(name)); #else "cannot import name %S", name); #endif } return value; } #if PY_MAJOR_VERSION < 3 static int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags) { #if PY_VERSION_HEX >= 0x02060000 if (PyObject_CheckBuffer(obj)) return PyObject_GetBuffer(obj, view, flags); #endif if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) return __pyx_pw_5numpy_7ndarray_1__getbuffer__(obj, view, flags); #if PY_VERSION_HEX < 0x02060000 if (obj->ob_type->tp_dict) { PyObject *getbuffer_cobj = PyObject_GetItem( obj->ob_type->tp_dict, __pyx_n_s_pyx_getbuffer); if (getbuffer_cobj) { getbufferproc func = (getbufferproc) PyCObject_AsVoidPtr(getbuffer_cobj); Py_DECREF(getbuffer_cobj); if (!func) goto fail; return func(obj, view, flags); } else { PyErr_Clear(); } } #endif PyErr_Format(PyExc_TypeError, "'%.200s' does not have the buffer interface", Py_TYPE(obj)->tp_name); #if PY_VERSION_HEX < 0x02060000 fail: #endif return -1; } static void __Pyx_ReleaseBuffer(Py_buffer *view) { PyObject *obj = view->obj; if (!obj) return; #if PY_VERSION_HEX >= 0x02060000 if (PyObject_CheckBuffer(obj)) { PyBuffer_Release(view); return; } #endif if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) { __pyx_pw_5numpy_7ndarray_3__releasebuffer__(obj, view); return; } #if PY_VERSION_HEX < 0x02060000 if (obj->ob_type->tp_dict) { PyObject *releasebuffer_cobj = PyObject_GetItem( obj->ob_type->tp_dict, __pyx_n_s_pyx_releasebuffer); if (releasebuffer_cobj) { releasebufferproc func = (releasebufferproc) PyCObject_AsVoidPtr(releasebuffer_cobj); Py_DECREF(releasebuffer_cobj); if (!func) goto fail; func(obj, view); return; } else { PyErr_Clear(); } } #endif goto nofail; #if PY_VERSION_HEX < 0x02060000 fail: #endif PyErr_WriteUnraisable(obj); nofail: Py_DECREF(obj); view->obj = NULL; } #endif /* PY_MAJOR_VERSION < 3 */ static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level) { PyObject *empty_list = 0; PyObject *module = 0; PyObject *global_dict = 0; PyObject *empty_dict = 0; PyObject *list; #if PY_VERSION_HEX < 0x03030000 PyObject *py_import; py_import = __Pyx_PyObject_GetAttrStr(__pyx_b, __pyx_n_s_import); if (!py_import) goto bad; #endif if (from_list) list = from_list; else { empty_list = PyList_New(0); if (!empty_list) goto bad; list = empty_list; } global_dict = PyModule_GetDict(__pyx_m); if (!global_dict) goto bad; empty_dict = PyDict_New(); if (!empty_dict) goto bad; #if PY_VERSION_HEX >= 0x02050000 { #if PY_MAJOR_VERSION >= 3 if (level == -1) { if (strchr(__Pyx_MODULE_NAME, '.')) { #if PY_VERSION_HEX < 0x03030000 PyObject *py_level = PyInt_FromLong(1); if (!py_level) goto bad; module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, py_level, NULL); Py_DECREF(py_level); #else module = PyImport_ImportModuleLevelObject( name, global_dict, empty_dict, list, 1); #endif if (!module) { if (!PyErr_ExceptionMatches(PyExc_ImportError)) goto bad; PyErr_Clear(); } } level = 0; /* try absolute import on failure */ } #endif if (!module) { #if PY_VERSION_HEX < 0x03030000 PyObject *py_level = PyInt_FromLong(level); if (!py_level) goto bad; module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, py_level, NULL); Py_DECREF(py_level); #else module = PyImport_ImportModuleLevelObject( name, global_dict, empty_dict, list, level); #endif } } #else if (level>0) { PyErr_SetString(PyExc_RuntimeError, "Relative import is not supported for Python <=2.4."); goto bad; } module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, NULL); #endif bad: #if PY_VERSION_HEX < 0x03030000 Py_XDECREF(py_import); #endif Py_XDECREF(empty_list); Py_XDECREF(empty_dict); return module; } static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value) { const long neg_one = (long) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(long) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(long) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(long) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(long) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(long) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(long), little, !is_unsigned); } } #define __PYX_VERIFY_RETURN_INT(target_type, func_type, func) \ { \ func_type value = func(x); \ if (sizeof(target_type) < sizeof(func_type)) { \ if (unlikely(value != (func_type) (target_type) value)) { \ func_type zero = 0; \ PyErr_SetString(PyExc_OverflowError, \ (is_unsigned && unlikely(value < zero)) ? \ "can't convert negative value to " #target_type : \ "value too large to convert to " #target_type); \ return (target_type) -1; \ } \ } \ return (target_type) value; \ } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *x) { const int neg_one = (int) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(int) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(int, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int"); return (int) -1; } return (int) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (int) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int"); return (int) -1; } if (sizeof(int) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(int, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(int) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(int, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(int) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(int) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(int) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(int, long, PyLong_AsLong) } else if (sizeof(int) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(int, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else int val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (int) -1; } } else { int val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (int) -1; val = __Pyx_PyInt_As_int(tmp); Py_DECREF(tmp); return val; } } static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value) { const int neg_one = (int) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(int) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(int) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(int) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(int), little, !is_unsigned); } } #if CYTHON_CCOMPLEX #ifdef __cplusplus static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { return ::std::complex< double >(x, y); } #else static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { return x + y*(__pyx_t_double_complex)_Complex_I; } #endif #else static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { __pyx_t_double_complex z; z.real = x; z.imag = y; return z; } #endif #if CYTHON_CCOMPLEX #else static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex a, __pyx_t_double_complex b) { return (a.real == b.real) && (a.imag == b.imag); } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real + b.real; z.imag = a.imag + b.imag; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real - b.real; z.imag = a.imag - b.imag; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real * b.real - a.imag * b.imag; z.imag = a.real * b.imag + a.imag * b.real; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; double denom = b.real * b.real + b.imag * b.imag; z.real = (a.real * b.real + a.imag * b.imag) / denom; z.imag = (a.imag * b.real - a.real * b.imag) / denom; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex a) { __pyx_t_double_complex z; z.real = -a.real; z.imag = -a.imag; return z; } static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex a) { return (a.real == 0) && (a.imag == 0); } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex a) { __pyx_t_double_complex z; z.real = a.real; z.imag = -a.imag; return z; } #if 1 static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex z) { #if !defined(HAVE_HYPOT) || defined(_MSC_VER) return sqrt(z.real*z.real + z.imag*z.imag); #else return hypot(z.real, z.imag); #endif } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; double r, lnr, theta, z_r, z_theta; if (b.imag == 0 && b.real == (int)b.real) { if (b.real < 0) { double denom = a.real * a.real + a.imag * a.imag; a.real = a.real / denom; a.imag = -a.imag / denom; b.real = -b.real; } switch ((int)b.real) { case 0: z.real = 1; z.imag = 0; return z; case 1: return a; case 2: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(a, a); case 3: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(z, a); case 4: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(z, z); } } if (a.imag == 0) { if (a.real == 0) { return a; } r = a.real; theta = 0; } else { r = __Pyx_c_abs(a); theta = atan2(a.imag, a.real); } lnr = log(r); z_r = exp(lnr * b.real - theta * b.imag); z_theta = theta * b.real + lnr * b.imag; z.real = z_r * cos(z_theta); z.imag = z_r * sin(z_theta); return z; } #endif #endif static CYTHON_INLINE long __Pyx_pow_long(long b, long e) { long t = b; switch (e) { case 3: t *= b; case 2: t *= b; case 1: return t; case 0: return 1; } #if 1 if (unlikely(e<0)) return 0; #endif t = 1; while (likely(e)) { t *= (b * (e&1)) | ((~e)&1); /* 1 or b */ b *= b; e >>= 1; } return t; } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *x) { const long neg_one = (long) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(long) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(long, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to long"); return (long) -1; } return (long) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(long)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (long) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to long"); return (long) -1; } if (sizeof(long) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(long, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(long) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(long, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(long)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(long) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(long) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(long) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(long, long, PyLong_AsLong) } else if (sizeof(long) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(long, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else long val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (long) -1; } } else { long val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (long) -1; val = __Pyx_PyInt_As_long(tmp); Py_DECREF(tmp); return val; } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *x) { const size_t neg_one = (size_t) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(size_t) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(size_t, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to size_t"); return (size_t) -1; } return (size_t) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(size_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (size_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to size_t"); return (size_t) -1; } if (sizeof(size_t) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(size_t, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(size_t) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(size_t, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(size_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(size_t) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(size_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(size_t) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(size_t, long, PyLong_AsLong) } else if (sizeof(size_t) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(size_t, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else size_t val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (size_t) -1; } } else { size_t val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (size_t) -1; val = __Pyx_PyInt_As_size_t(tmp); Py_DECREF(tmp); return val; } } #if CYTHON_CCOMPLEX #ifdef __cplusplus static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { return ::std::complex< float >(x, y); } #else static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { return x + y*(__pyx_t_float_complex)_Complex_I; } #endif #else static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { __pyx_t_float_complex z; z.real = x; z.imag = y; return z; } #endif #if CYTHON_CCOMPLEX #else static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex a, __pyx_t_float_complex b) { return (a.real == b.real) && (a.imag == b.imag); } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real + b.real; z.imag = a.imag + b.imag; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real - b.real; z.imag = a.imag - b.imag; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real * b.real - a.imag * b.imag; z.imag = a.real * b.imag + a.imag * b.real; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; float denom = b.real * b.real + b.imag * b.imag; z.real = (a.real * b.real + a.imag * b.imag) / denom; z.imag = (a.imag * b.real - a.real * b.imag) / denom; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex a) { __pyx_t_float_complex z; z.real = -a.real; z.imag = -a.imag; return z; } static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex a) { return (a.real == 0) && (a.imag == 0); } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex a) { __pyx_t_float_complex z; z.real = a.real; z.imag = -a.imag; return z; } #if 1 static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex z) { #if !defined(HAVE_HYPOT) || defined(_MSC_VER) return sqrtf(z.real*z.real + z.imag*z.imag); #else return hypotf(z.real, z.imag); #endif } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; float r, lnr, theta, z_r, z_theta; if (b.imag == 0 && b.real == (int)b.real) { if (b.real < 0) { float denom = a.real * a.real + a.imag * a.imag; a.real = a.real / denom; a.imag = -a.imag / denom; b.real = -b.real; } switch ((int)b.real) { case 0: z.real = 1; z.imag = 0; return z; case 1: return a; case 2: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(a, a); case 3: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(z, a); case 4: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(z, z); } } if (a.imag == 0) { if (a.real == 0) { return a; } r = a.real; theta = 0; } else { r = __Pyx_c_absf(a); theta = atan2f(a.imag, a.real); } lnr = logf(r); z_r = expf(lnr * b.real - theta * b.imag); z_theta = theta * b.real + lnr * b.imag; z.real = z_r * cosf(z_theta); z.imag = z_r * sinf(z_theta); return z; } #endif #endif static int __Pyx_check_binary_version(void) { char ctversion[4], rtversion[4]; PyOS_snprintf(ctversion, 4, "%d.%d", PY_MAJOR_VERSION, PY_MINOR_VERSION); PyOS_snprintf(rtversion, 4, "%s", Py_GetVersion()); if (ctversion[0] != rtversion[0] || ctversion[2] != rtversion[2]) { char message[200]; PyOS_snprintf(message, sizeof(message), "compiletime version %s of module '%.100s' " "does not match runtime version %s", ctversion, __Pyx_MODULE_NAME, rtversion); #if PY_VERSION_HEX < 0x02050000 return PyErr_Warn(NULL, message); #else return PyErr_WarnEx(NULL, message, 1); #endif } return 0; } #ifndef __PYX_HAVE_RT_ImportModule #define __PYX_HAVE_RT_ImportModule static PyObject *__Pyx_ImportModule(const char *name) { PyObject *py_name = 0; PyObject *py_module = 0; py_name = __Pyx_PyIdentifier_FromString(name); if (!py_name) goto bad; py_module = PyImport_Import(py_name); Py_DECREF(py_name); return py_module; bad: Py_XDECREF(py_name); return 0; } #endif #ifndef __PYX_HAVE_RT_ImportType #define __PYX_HAVE_RT_ImportType static PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, size_t size, int strict) { PyObject *py_module = 0; PyObject *result = 0; PyObject *py_name = 0; char warning[200]; Py_ssize_t basicsize; #ifdef Py_LIMITED_API PyObject *py_basicsize; #endif py_module = __Pyx_ImportModule(module_name); if (!py_module) goto bad; py_name = __Pyx_PyIdentifier_FromString(class_name); if (!py_name) goto bad; result = PyObject_GetAttr(py_module, py_name); Py_DECREF(py_name); py_name = 0; Py_DECREF(py_module); py_module = 0; if (!result) goto bad; if (!PyType_Check(result)) { PyErr_Format(PyExc_TypeError, "%.200s.%.200s is not a type object", module_name, class_name); goto bad; } #ifndef Py_LIMITED_API basicsize = ((PyTypeObject *)result)->tp_basicsize; #else py_basicsize = PyObject_GetAttrString(result, "__basicsize__"); if (!py_basicsize) goto bad; basicsize = PyLong_AsSsize_t(py_basicsize); Py_DECREF(py_basicsize); py_basicsize = 0; if (basicsize == (Py_ssize_t)-1 && PyErr_Occurred()) goto bad; #endif if (!strict && (size_t)basicsize > size) { PyOS_snprintf(warning, sizeof(warning), "%s.%s size changed, may indicate binary incompatibility", module_name, class_name); #if PY_VERSION_HEX < 0x02050000 if (PyErr_Warn(NULL, warning) < 0) goto bad; #else if (PyErr_WarnEx(NULL, warning, 0) < 0) goto bad; #endif } else if ((size_t)basicsize != size) { PyErr_Format(PyExc_ValueError, "%.200s.%.200s has the wrong size, try recompiling", module_name, class_name); goto bad; } return (PyTypeObject *)result; bad: Py_XDECREF(py_module); Py_XDECREF(result); return NULL; } #endif static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line) { int start = 0, mid = 0, end = count - 1; if (end >= 0 && code_line > entries[end].code_line) { return count; } while (start < end) { mid = (start + end) / 2; if (code_line < entries[mid].code_line) { end = mid; } else if (code_line > entries[mid].code_line) { start = mid + 1; } else { return mid; } } if (code_line <= entries[mid].code_line) { return mid; } else { return mid + 1; } } static PyCodeObject *__pyx_find_code_object(int code_line) { PyCodeObject* code_object; int pos; if (unlikely(!code_line) || unlikely(!__pyx_code_cache.entries)) { return NULL; } pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line); if (unlikely(pos >= __pyx_code_cache.count) || unlikely(__pyx_code_cache.entries[pos].code_line != code_line)) { return NULL; } code_object = __pyx_code_cache.entries[pos].code_object; Py_INCREF(code_object); return code_object; } static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object) { int pos, i; __Pyx_CodeObjectCacheEntry* entries = __pyx_code_cache.entries; if (unlikely(!code_line)) { return; } if (unlikely(!entries)) { entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Malloc(64*sizeof(__Pyx_CodeObjectCacheEntry)); if (likely(entries)) { __pyx_code_cache.entries = entries; __pyx_code_cache.max_count = 64; __pyx_code_cache.count = 1; entries[0].code_line = code_line; entries[0].code_object = code_object; Py_INCREF(code_object); } return; } pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line); if ((pos < __pyx_code_cache.count) && unlikely(__pyx_code_cache.entries[pos].code_line == code_line)) { PyCodeObject* tmp = entries[pos].code_object; entries[pos].code_object = code_object; Py_DECREF(tmp); return; } if (__pyx_code_cache.count == __pyx_code_cache.max_count) { int new_max = __pyx_code_cache.max_count + 64; entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Realloc( __pyx_code_cache.entries, new_max*sizeof(__Pyx_CodeObjectCacheEntry)); if (unlikely(!entries)) { return; } __pyx_code_cache.entries = entries; __pyx_code_cache.max_count = new_max; } for (i=__pyx_code_cache.count; i>pos; i--) { entries[i] = entries[i-1]; } entries[pos].code_line = code_line; entries[pos].code_object = code_object; __pyx_code_cache.count++; Py_INCREF(code_object); } #include "compile.h" #include "frameobject.h" #include "traceback.h" static PyCodeObject* __Pyx_CreateCodeObjectForTraceback( const char *funcname, int c_line, int py_line, const char *filename) { PyCodeObject *py_code = 0; PyObject *py_srcfile = 0; PyObject *py_funcname = 0; #if PY_MAJOR_VERSION < 3 py_srcfile = PyString_FromString(filename); #else py_srcfile = PyUnicode_FromString(filename); #endif if (!py_srcfile) goto bad; if (c_line) { #if PY_MAJOR_VERSION < 3 py_funcname = PyString_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line); #else py_funcname = PyUnicode_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line); #endif } else { #if PY_MAJOR_VERSION < 3 py_funcname = PyString_FromString(funcname); #else py_funcname = PyUnicode_FromString(funcname); #endif } if (!py_funcname) goto bad; py_code = __Pyx_PyCode_New( 0, /*int argcount,*/ 0, /*int kwonlyargcount,*/ 0, /*int nlocals,*/ 0, /*int stacksize,*/ 0, /*int flags,*/ __pyx_empty_bytes, /*PyObject *code,*/ __pyx_empty_tuple, /*PyObject *consts,*/ __pyx_empty_tuple, /*PyObject *names,*/ __pyx_empty_tuple, /*PyObject *varnames,*/ __pyx_empty_tuple, /*PyObject *freevars,*/ __pyx_empty_tuple, /*PyObject *cellvars,*/ py_srcfile, /*PyObject *filename,*/ py_funcname, /*PyObject *name,*/ py_line, /*int firstlineno,*/ __pyx_empty_bytes /*PyObject *lnotab*/ ); Py_DECREF(py_srcfile); Py_DECREF(py_funcname); return py_code; bad: Py_XDECREF(py_srcfile); Py_XDECREF(py_funcname); return NULL; } static void __Pyx_AddTraceback(const char *funcname, int c_line, int py_line, const char *filename) { PyCodeObject *py_code = 0; PyObject *py_globals = 0; PyFrameObject *py_frame = 0; py_code = __pyx_find_code_object(c_line ? c_line : py_line); if (!py_code) { py_code = __Pyx_CreateCodeObjectForTraceback( funcname, c_line, py_line, filename); if (!py_code) goto bad; __pyx_insert_code_object(c_line ? c_line : py_line, py_code); } py_globals = PyModule_GetDict(__pyx_m); if (!py_globals) goto bad; py_frame = PyFrame_New( PyThreadState_GET(), /*PyThreadState *tstate,*/ py_code, /*PyCodeObject *code,*/ py_globals, /*PyObject *globals,*/ 0 /*PyObject *locals*/ ); if (!py_frame) goto bad; py_frame->f_lineno = py_line; PyTraceBack_Here(py_frame); bad: Py_XDECREF(py_code); Py_XDECREF(py_frame); } static int __Pyx_InitStrings(__Pyx_StringTabEntry *t) { while (t->p) { #if PY_MAJOR_VERSION < 3 if (t->is_unicode) { *t->p = PyUnicode_DecodeUTF8(t->s, t->n - 1, NULL); } else if (t->intern) { *t->p = PyString_InternFromString(t->s); } else { *t->p = PyString_FromStringAndSize(t->s, t->n - 1); } #else /* Python 3+ has unicode identifiers */ if (t->is_unicode | t->is_str) { if (t->intern) { *t->p = PyUnicode_InternFromString(t->s); } else if (t->encoding) { *t->p = PyUnicode_Decode(t->s, t->n - 1, t->encoding, NULL); } else { *t->p = PyUnicode_FromStringAndSize(t->s, t->n - 1); } } else { *t->p = PyBytes_FromStringAndSize(t->s, t->n - 1); } #endif if (!*t->p) return -1; ++t; } return 0; } static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(char* c_str) { return __Pyx_PyUnicode_FromStringAndSize(c_str, strlen(c_str)); } static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject* o) { Py_ssize_t ignore; return __Pyx_PyObject_AsStringAndSize(o, &ignore); } static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject* o, Py_ssize_t *length) { #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT if ( #if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII __Pyx_sys_getdefaultencoding_not_ascii && #endif PyUnicode_Check(o)) { #if PY_VERSION_HEX < 0x03030000 char* defenc_c; PyObject* defenc = _PyUnicode_AsDefaultEncodedString(o, NULL); if (!defenc) return NULL; defenc_c = PyBytes_AS_STRING(defenc); #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII { char* end = defenc_c + PyBytes_GET_SIZE(defenc); char* c; for (c = defenc_c; c < end; c++) { if ((unsigned char) (*c) >= 128) { PyUnicode_AsASCIIString(o); return NULL; } } } #endif /*__PYX_DEFAULT_STRING_ENCODING_IS_ASCII*/ *length = PyBytes_GET_SIZE(defenc); return defenc_c; #else /* PY_VERSION_HEX < 0x03030000 */ if (PyUnicode_READY(o) == -1) return NULL; #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII if (PyUnicode_IS_ASCII(o)) { *length = PyUnicode_GET_DATA_SIZE(o); return PyUnicode_AsUTF8(o); } else { PyUnicode_AsASCIIString(o); return NULL; } #else /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII */ return PyUnicode_AsUTF8AndSize(o, length); #endif /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII */ #endif /* PY_VERSION_HEX < 0x03030000 */ } else #endif /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT */ #if !CYTHON_COMPILING_IN_PYPY #if PY_VERSION_HEX >= 0x02060000 if (PyByteArray_Check(o)) { *length = PyByteArray_GET_SIZE(o); return PyByteArray_AS_STRING(o); } else #endif #endif { char* result; int r = PyBytes_AsStringAndSize(o, &result, length); if (unlikely(r < 0)) { return NULL; } else { return result; } } } static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject* x) { int is_true = x == Py_True; if (is_true | (x == Py_False) | (x == Py_None)) return is_true; else return PyObject_IsTrue(x); } static CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x) { PyNumberMethods *m; const char *name = NULL; PyObject *res = NULL; #if PY_MAJOR_VERSION < 3 if (PyInt_Check(x) || PyLong_Check(x)) #else if (PyLong_Check(x)) #endif return Py_INCREF(x), x; m = Py_TYPE(x)->tp_as_number; #if PY_MAJOR_VERSION < 3 if (m && m->nb_int) { name = "int"; res = PyNumber_Int(x); } else if (m && m->nb_long) { name = "long"; res = PyNumber_Long(x); } #else if (m && m->nb_int) { name = "int"; res = PyNumber_Long(x); } #endif if (res) { #if PY_MAJOR_VERSION < 3 if (!PyInt_Check(res) && !PyLong_Check(res)) { #else if (!PyLong_Check(res)) { #endif PyErr_Format(PyExc_TypeError, "__%.4s__ returned non-%.4s (type %.200s)", name, name, Py_TYPE(res)->tp_name); Py_DECREF(res); return NULL; } } else if (!PyErr_Occurred()) { PyErr_SetString(PyExc_TypeError, "an integer is required"); } return res; } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) { Py_ssize_t ival; PyObject *x; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_CheckExact(b))) return PyInt_AS_LONG(b); #endif if (likely(PyLong_CheckExact(b))) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS switch (Py_SIZE(b)) { case -1: return -(sdigit)((PyLongObject*)b)->ob_digit[0]; case 0: return 0; case 1: return ((PyLongObject*)b)->ob_digit[0]; } #endif #endif #if PY_VERSION_HEX < 0x02060000 return PyInt_AsSsize_t(b); #else return PyLong_AsSsize_t(b); #endif } x = PyNumber_Index(b); if (!x) return -1; ival = PyInt_AsSsize_t(x); Py_DECREF(x); return ival; } static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) { #if PY_VERSION_HEX < 0x02050000 if (ival <= LONG_MAX) return PyInt_FromLong((long)ival); else { unsigned char *bytes = (unsigned char *) &ival; int one = 1; int little = (int)*(unsigned char*)&one; return _PyLong_FromByteArray(bytes, sizeof(size_t), little, 0); } #else return PyInt_FromSize_t(ival); #endif } #endif /* Py_PYTHON_H */ healpy-1.8.1/healpy/src/_pixelfunc.cpp0000644000175000017500000117711712346122733020204 0ustar zoncazonca00000000000000/* Generated by Cython 0.20.1 on Wed Jun 11 11:54:03 2014 */ #define PY_SSIZE_T_CLEAN #ifndef CYTHON_USE_PYLONG_INTERNALS #ifdef PYLONG_BITS_IN_DIGIT #define CYTHON_USE_PYLONG_INTERNALS 0 #else #include "pyconfig.h" #ifdef PYLONG_BITS_IN_DIGIT #define CYTHON_USE_PYLONG_INTERNALS 1 #else #define CYTHON_USE_PYLONG_INTERNALS 0 #endif #endif #endif #include "Python.h" #ifndef Py_PYTHON_H #error Python headers needed to compile C extensions, please install development version of Python. #elif PY_VERSION_HEX < 0x02040000 #error Cython requires Python 2.4+. #else #define CYTHON_ABI "0_20_1" #include /* For offsetof */ #ifndef offsetof #define offsetof(type, member) ( (size_t) & ((type*)0) -> member ) #endif #if !defined(WIN32) && !defined(MS_WINDOWS) #ifndef __stdcall #define __stdcall #endif #ifndef __cdecl #define __cdecl #endif #ifndef __fastcall #define __fastcall #endif #endif #ifndef DL_IMPORT #define DL_IMPORT(t) t #endif #ifndef DL_EXPORT #define DL_EXPORT(t) t #endif #ifndef PY_LONG_LONG #define PY_LONG_LONG LONG_LONG #endif #ifndef Py_HUGE_VAL #define Py_HUGE_VAL HUGE_VAL #endif #ifdef PYPY_VERSION #define CYTHON_COMPILING_IN_PYPY 1 #define CYTHON_COMPILING_IN_CPYTHON 0 #else #define CYTHON_COMPILING_IN_PYPY 0 #define CYTHON_COMPILING_IN_CPYTHON 1 #endif #if CYTHON_COMPILING_IN_PYPY #define Py_OptimizeFlag 0 #endif #if PY_VERSION_HEX < 0x02050000 typedef int Py_ssize_t; #define PY_SSIZE_T_MAX INT_MAX #define PY_SSIZE_T_MIN INT_MIN #define PY_FORMAT_SIZE_T "" #define CYTHON_FORMAT_SSIZE_T "" #define PyInt_FromSsize_t(z) PyInt_FromLong(z) #define PyInt_AsSsize_t(o) __Pyx_PyInt_As_int(o) #define PyNumber_Index(o) ((PyNumber_Check(o) && !PyFloat_Check(o)) ? PyNumber_Int(o) : \ (PyErr_Format(PyExc_TypeError, \ "expected index value, got %.200s", Py_TYPE(o)->tp_name), \ (PyObject*)0)) #define __Pyx_PyIndex_Check(o) (PyNumber_Check(o) && !PyFloat_Check(o) && \ !PyComplex_Check(o)) #define PyIndex_Check __Pyx_PyIndex_Check #define PyErr_WarnEx(category, message, stacklevel) PyErr_Warn(category, message) #define __PYX_BUILD_PY_SSIZE_T "i" #else #define __PYX_BUILD_PY_SSIZE_T "n" #define CYTHON_FORMAT_SSIZE_T "z" #define __Pyx_PyIndex_Check PyIndex_Check #endif #if PY_VERSION_HEX < 0x02060000 #define Py_REFCNT(ob) (((PyObject*)(ob))->ob_refcnt) #define Py_TYPE(ob) (((PyObject*)(ob))->ob_type) #define Py_SIZE(ob) (((PyVarObject*)(ob))->ob_size) #define PyVarObject_HEAD_INIT(type, size) \ PyObject_HEAD_INIT(type) size, #define PyType_Modified(t) typedef struct { void *buf; PyObject *obj; Py_ssize_t len; Py_ssize_t itemsize; int readonly; int ndim; char *format; Py_ssize_t *shape; Py_ssize_t *strides; Py_ssize_t *suboffsets; void *internal; } Py_buffer; #define PyBUF_SIMPLE 0 #define PyBUF_WRITABLE 0x0001 #define PyBUF_FORMAT 0x0004 #define PyBUF_ND 0x0008 #define PyBUF_STRIDES (0x0010 | PyBUF_ND) #define PyBUF_C_CONTIGUOUS (0x0020 | PyBUF_STRIDES) #define PyBUF_F_CONTIGUOUS (0x0040 | PyBUF_STRIDES) #define PyBUF_ANY_CONTIGUOUS (0x0080 | PyBUF_STRIDES) #define PyBUF_INDIRECT (0x0100 | PyBUF_STRIDES) #define PyBUF_RECORDS (PyBUF_STRIDES | PyBUF_FORMAT | PyBUF_WRITABLE) #define PyBUF_FULL (PyBUF_INDIRECT | PyBUF_FORMAT | PyBUF_WRITABLE) typedef int (*getbufferproc)(PyObject *, Py_buffer *, int); typedef void (*releasebufferproc)(PyObject *, Py_buffer *); #endif #if PY_MAJOR_VERSION < 3 #define __Pyx_BUILTIN_MODULE_NAME "__builtin__" #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) \ PyCode_New(a+k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) #define __Pyx_DefaultClassType PyClass_Type #else #define __Pyx_BUILTIN_MODULE_NAME "builtins" #define __Pyx_PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) \ PyCode_New(a, k, l, s, f, code, c, n, v, fv, cell, fn, name, fline, lnos) #define __Pyx_DefaultClassType PyType_Type #endif #if PY_VERSION_HEX < 0x02060000 #define PyUnicode_FromString(s) PyUnicode_Decode(s, strlen(s), "UTF-8", "strict") #endif #if PY_MAJOR_VERSION >= 3 #define Py_TPFLAGS_CHECKTYPES 0 #define Py_TPFLAGS_HAVE_INDEX 0 #endif #if (PY_VERSION_HEX < 0x02060000) || (PY_MAJOR_VERSION >= 3) #define Py_TPFLAGS_HAVE_NEWBUFFER 0 #endif #if PY_VERSION_HEX < 0x02060000 #define Py_TPFLAGS_HAVE_VERSION_TAG 0 #endif #if PY_VERSION_HEX < 0x02060000 && !defined(Py_TPFLAGS_IS_ABSTRACT) #define Py_TPFLAGS_IS_ABSTRACT 0 #endif #if PY_VERSION_HEX < 0x030400a1 && !defined(Py_TPFLAGS_HAVE_FINALIZE) #define Py_TPFLAGS_HAVE_FINALIZE 0 #endif #if PY_VERSION_HEX > 0x03030000 && defined(PyUnicode_KIND) #define CYTHON_PEP393_ENABLED 1 #define __Pyx_PyUnicode_READY(op) (likely(PyUnicode_IS_READY(op)) ? \ 0 : _PyUnicode_Ready((PyObject *)(op))) #define __Pyx_PyUnicode_GET_LENGTH(u) PyUnicode_GET_LENGTH(u) #define __Pyx_PyUnicode_READ_CHAR(u, i) PyUnicode_READ_CHAR(u, i) #define __Pyx_PyUnicode_KIND(u) PyUnicode_KIND(u) #define __Pyx_PyUnicode_DATA(u) PyUnicode_DATA(u) #define __Pyx_PyUnicode_READ(k, d, i) PyUnicode_READ(k, d, i) #else #define CYTHON_PEP393_ENABLED 0 #define __Pyx_PyUnicode_READY(op) (0) #define __Pyx_PyUnicode_GET_LENGTH(u) PyUnicode_GET_SIZE(u) #define __Pyx_PyUnicode_READ_CHAR(u, i) ((Py_UCS4)(PyUnicode_AS_UNICODE(u)[i])) #define __Pyx_PyUnicode_KIND(u) (sizeof(Py_UNICODE)) #define __Pyx_PyUnicode_DATA(u) ((void*)PyUnicode_AS_UNICODE(u)) #define __Pyx_PyUnicode_READ(k, d, i) ((void)(k), (Py_UCS4)(((Py_UNICODE*)d)[i])) #endif #if CYTHON_COMPILING_IN_PYPY #define __Pyx_PyUnicode_Concat(a, b) PyNumber_Add(a, b) #define __Pyx_PyUnicode_ConcatSafe(a, b) PyNumber_Add(a, b) #else #define __Pyx_PyUnicode_Concat(a, b) PyUnicode_Concat(a, b) #define __Pyx_PyUnicode_ConcatSafe(a, b) ((unlikely((a) == Py_None) || unlikely((b) == Py_None)) ? \ PyNumber_Add(a, b) : __Pyx_PyUnicode_Concat(a, b)) #endif #define __Pyx_PyString_FormatSafe(a, b) ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : __Pyx_PyString_Format(a, b)) #define __Pyx_PyUnicode_FormatSafe(a, b) ((unlikely((a) == Py_None)) ? PyNumber_Remainder(a, b) : PyUnicode_Format(a, b)) #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyString_Format(a, b) PyUnicode_Format(a, b) #else #define __Pyx_PyString_Format(a, b) PyString_Format(a, b) #endif #if PY_MAJOR_VERSION >= 3 #define PyBaseString_Type PyUnicode_Type #define PyStringObject PyUnicodeObject #define PyString_Type PyUnicode_Type #define PyString_Check PyUnicode_Check #define PyString_CheckExact PyUnicode_CheckExact #endif #if PY_VERSION_HEX < 0x02060000 #define PyBytesObject PyStringObject #define PyBytes_Type PyString_Type #define PyBytes_Check PyString_Check #define PyBytes_CheckExact PyString_CheckExact #define PyBytes_FromString PyString_FromString #define PyBytes_FromStringAndSize PyString_FromStringAndSize #define PyBytes_FromFormat PyString_FromFormat #define PyBytes_DecodeEscape PyString_DecodeEscape #define PyBytes_AsString PyString_AsString #define PyBytes_AsStringAndSize PyString_AsStringAndSize #define PyBytes_Size PyString_Size #define PyBytes_AS_STRING PyString_AS_STRING #define PyBytes_GET_SIZE PyString_GET_SIZE #define PyBytes_Repr PyString_Repr #define PyBytes_Concat PyString_Concat #define PyBytes_ConcatAndDel PyString_ConcatAndDel #endif #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyBaseString_Check(obj) PyUnicode_Check(obj) #define __Pyx_PyBaseString_CheckExact(obj) PyUnicode_CheckExact(obj) #else #define __Pyx_PyBaseString_Check(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj) || \ PyString_Check(obj) || PyUnicode_Check(obj)) #define __Pyx_PyBaseString_CheckExact(obj) (PyString_CheckExact(obj) || PyUnicode_CheckExact(obj)) #endif #if PY_VERSION_HEX < 0x02060000 #define PySet_Check(obj) PyObject_TypeCheck(obj, &PySet_Type) #define PyFrozenSet_Check(obj) PyObject_TypeCheck(obj, &PyFrozenSet_Type) #endif #ifndef PySet_CheckExact #define PySet_CheckExact(obj) (Py_TYPE(obj) == &PySet_Type) #endif #define __Pyx_TypeCheck(obj, type) PyObject_TypeCheck(obj, (PyTypeObject *)type) #if PY_MAJOR_VERSION >= 3 #define PyIntObject PyLongObject #define PyInt_Type PyLong_Type #define PyInt_Check(op) PyLong_Check(op) #define PyInt_CheckExact(op) PyLong_CheckExact(op) #define PyInt_FromString PyLong_FromString #define PyInt_FromUnicode PyLong_FromUnicode #define PyInt_FromLong PyLong_FromLong #define PyInt_FromSize_t PyLong_FromSize_t #define PyInt_FromSsize_t PyLong_FromSsize_t #define PyInt_AsLong PyLong_AsLong #define PyInt_AS_LONG PyLong_AS_LONG #define PyInt_AsSsize_t PyLong_AsSsize_t #define PyInt_AsUnsignedLongMask PyLong_AsUnsignedLongMask #define PyInt_AsUnsignedLongLongMask PyLong_AsUnsignedLongLongMask #define PyNumber_Int PyNumber_Long #endif #if PY_MAJOR_VERSION >= 3 #define PyBoolObject PyLongObject #endif #if PY_VERSION_HEX < 0x030200A4 typedef long Py_hash_t; #define __Pyx_PyInt_FromHash_t PyInt_FromLong #define __Pyx_PyInt_AsHash_t PyInt_AsLong #else #define __Pyx_PyInt_FromHash_t PyInt_FromSsize_t #define __Pyx_PyInt_AsHash_t PyInt_AsSsize_t #endif #if (PY_MAJOR_VERSION < 3) || (PY_VERSION_HEX >= 0x03010300) #define __Pyx_PySequence_GetSlice(obj, a, b) PySequence_GetSlice(obj, a, b) #define __Pyx_PySequence_SetSlice(obj, a, b, value) PySequence_SetSlice(obj, a, b, value) #define __Pyx_PySequence_DelSlice(obj, a, b) PySequence_DelSlice(obj, a, b) #else #define __Pyx_PySequence_GetSlice(obj, a, b) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), (PyObject*)0) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_GetSlice(obj, a, b)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object is unsliceable", (obj)->ob_type->tp_name), (PyObject*)0))) #define __Pyx_PySequence_SetSlice(obj, a, b, value) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), -1) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_SetSlice(obj, a, b, value)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object doesn't support slice assignment", (obj)->ob_type->tp_name), -1))) #define __Pyx_PySequence_DelSlice(obj, a, b) (unlikely(!(obj)) ? \ (PyErr_SetString(PyExc_SystemError, "null argument to internal routine"), -1) : \ (likely((obj)->ob_type->tp_as_mapping) ? (PySequence_DelSlice(obj, a, b)) : \ (PyErr_Format(PyExc_TypeError, "'%.200s' object doesn't support slice deletion", (obj)->ob_type->tp_name), -1))) #endif #if PY_MAJOR_VERSION >= 3 #define PyMethod_New(func, self, klass) ((self) ? PyMethod_New(func, self) : PyInstanceMethod_New(func)) #endif #if PY_VERSION_HEX < 0x02050000 #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),((char *)(n))) #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),((char *)(n)),(a)) #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),((char *)(n))) #else #define __Pyx_GetAttrString(o,n) PyObject_GetAttrString((o),(n)) #define __Pyx_SetAttrString(o,n,a) PyObject_SetAttrString((o),(n),(a)) #define __Pyx_DelAttrString(o,n) PyObject_DelAttrString((o),(n)) #endif #if PY_VERSION_HEX < 0x02050000 #define __Pyx_NAMESTR(n) ((char *)(n)) #define __Pyx_DOCSTR(n) ((char *)(n)) #else #define __Pyx_NAMESTR(n) (n) #define __Pyx_DOCSTR(n) (n) #endif #ifndef CYTHON_INLINE #if defined(__GNUC__) #define CYTHON_INLINE __inline__ #elif defined(_MSC_VER) #define CYTHON_INLINE __inline #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L #define CYTHON_INLINE inline #else #define CYTHON_INLINE #endif #endif #ifndef CYTHON_RESTRICT #if defined(__GNUC__) #define CYTHON_RESTRICT __restrict__ #elif defined(_MSC_VER) && _MSC_VER >= 1400 #define CYTHON_RESTRICT __restrict #elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L #define CYTHON_RESTRICT restrict #else #define CYTHON_RESTRICT #endif #endif #ifdef NAN #define __PYX_NAN() ((float) NAN) #else static CYTHON_INLINE float __PYX_NAN() { /* Initialize NaN. The sign is irrelevant, an exponent with all bits 1 and a nonzero mantissa means NaN. If the first bit in the mantissa is 1, it is a quiet NaN. */ float value; memset(&value, 0xFF, sizeof(value)); return value; } #endif #if PY_MAJOR_VERSION >= 3 #define __Pyx_PyNumber_Divide(x,y) PyNumber_TrueDivide(x,y) #define __Pyx_PyNumber_InPlaceDivide(x,y) PyNumber_InPlaceTrueDivide(x,y) #else #define __Pyx_PyNumber_Divide(x,y) PyNumber_Divide(x,y) #define __Pyx_PyNumber_InPlaceDivide(x,y) PyNumber_InPlaceDivide(x,y) #endif #ifndef __PYX_EXTERN_C #ifdef __cplusplus #define __PYX_EXTERN_C extern "C" #else #define __PYX_EXTERN_C extern #endif #endif #if defined(WIN32) || defined(MS_WINDOWS) #define _USE_MATH_DEFINES #endif #include #define __PYX_HAVE__healpy___pixelfunc #define __PYX_HAVE_API__healpy___pixelfunc #include "string.h" #include "stdio.h" #include "stdlib.h" #include "numpy/arrayobject.h" #include "numpy/ufuncobject.h" #include #include "ios" #include "new" #include "stdexcept" #include "typeinfo" #include "stddef.h" #include "datatypes.h" #include "xcomplex.h" #include "arr.h" #include "rangeset.h" #include "vec3.h" #include "pointing.h" #include "healpix_base.h" #include "healpix_map.h" #include "alm.h" #ifdef _OPENMP #include #endif /* _OPENMP */ #ifdef PYREX_WITHOUT_ASSERTIONS #define CYTHON_WITHOUT_ASSERTIONS #endif #ifndef CYTHON_UNUSED # if defined(__GNUC__) # if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)) # define CYTHON_UNUSED __attribute__ ((__unused__)) # else # define CYTHON_UNUSED # endif # elif defined(__ICC) || (defined(__INTEL_COMPILER) && !defined(_MSC_VER)) # define CYTHON_UNUSED __attribute__ ((__unused__)) # else # define CYTHON_UNUSED # endif #endif typedef struct {PyObject **p; char *s; const Py_ssize_t n; const char* encoding; const char is_unicode; const char is_str; const char intern; } __Pyx_StringTabEntry; /*proto*/ #define __PYX_DEFAULT_STRING_ENCODING_IS_ASCII 0 #define __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT 0 #define __PYX_DEFAULT_STRING_ENCODING "" #define __Pyx_PyObject_FromString __Pyx_PyBytes_FromString #define __Pyx_PyObject_FromStringAndSize __Pyx_PyBytes_FromStringAndSize #define __Pyx_fits_Py_ssize_t(v, type, is_signed) ( \ (sizeof(type) < sizeof(Py_ssize_t)) || \ (sizeof(type) > sizeof(Py_ssize_t) && \ likely(v < (type)PY_SSIZE_T_MAX || \ v == (type)PY_SSIZE_T_MAX) && \ (!is_signed || likely(v > (type)PY_SSIZE_T_MIN || \ v == (type)PY_SSIZE_T_MIN))) || \ (sizeof(type) == sizeof(Py_ssize_t) && \ (is_signed || likely(v < (type)PY_SSIZE_T_MAX || \ v == (type)PY_SSIZE_T_MAX))) ) static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject*); static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length); #define __Pyx_PyByteArray_FromString(s) PyByteArray_FromStringAndSize((const char*)s, strlen((const char*)s)) #define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l) #define __Pyx_PyBytes_FromString PyBytes_FromString #define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(char*); #if PY_MAJOR_VERSION < 3 #define __Pyx_PyStr_FromString __Pyx_PyBytes_FromString #define __Pyx_PyStr_FromStringAndSize __Pyx_PyBytes_FromStringAndSize #else #define __Pyx_PyStr_FromString __Pyx_PyUnicode_FromString #define __Pyx_PyStr_FromStringAndSize __Pyx_PyUnicode_FromStringAndSize #endif #define __Pyx_PyObject_AsSString(s) ((signed char*) __Pyx_PyObject_AsString(s)) #define __Pyx_PyObject_AsUString(s) ((unsigned char*) __Pyx_PyObject_AsString(s)) #define __Pyx_PyObject_FromUString(s) __Pyx_PyObject_FromString((char*)s) #define __Pyx_PyBytes_FromUString(s) __Pyx_PyBytes_FromString((char*)s) #define __Pyx_PyByteArray_FromUString(s) __Pyx_PyByteArray_FromString((char*)s) #define __Pyx_PyStr_FromUString(s) __Pyx_PyStr_FromString((char*)s) #define __Pyx_PyUnicode_FromUString(s) __Pyx_PyUnicode_FromString((char*)s) #if PY_MAJOR_VERSION < 3 static CYTHON_INLINE size_t __Pyx_Py_UNICODE_strlen(const Py_UNICODE *u) { const Py_UNICODE *u_end = u; while (*u_end++) ; return u_end - u - 1; } #else #define __Pyx_Py_UNICODE_strlen Py_UNICODE_strlen #endif #define __Pyx_PyUnicode_FromUnicode(u) PyUnicode_FromUnicode(u, __Pyx_Py_UNICODE_strlen(u)) #define __Pyx_PyUnicode_FromUnicodeAndLength PyUnicode_FromUnicode #define __Pyx_PyUnicode_AsUnicode PyUnicode_AsUnicode #define __Pyx_Owned_Py_None(b) (Py_INCREF(Py_None), Py_None) #define __Pyx_PyBool_FromLong(b) ((b) ? (Py_INCREF(Py_True), Py_True) : (Py_INCREF(Py_False), Py_False)) static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*); static CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x); static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*); static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t); #if CYTHON_COMPILING_IN_CPYTHON #define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x)) #else #define __pyx_PyFloat_AsDouble(x) PyFloat_AsDouble(x) #endif #define __pyx_PyFloat_AsFloat(x) ((float) __pyx_PyFloat_AsDouble(x)) #if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII static int __Pyx_sys_getdefaultencoding_not_ascii; static int __Pyx_init_sys_getdefaultencoding_params(void) { PyObject* sys = NULL; PyObject* default_encoding = NULL; PyObject* ascii_chars_u = NULL; PyObject* ascii_chars_b = NULL; sys = PyImport_ImportModule("sys"); if (sys == NULL) goto bad; default_encoding = PyObject_CallMethod(sys, (char*) (const char*) "getdefaultencoding", NULL); if (default_encoding == NULL) goto bad; if (strcmp(PyBytes_AsString(default_encoding), "ascii") == 0) { __Pyx_sys_getdefaultencoding_not_ascii = 0; } else { const char* default_encoding_c = PyBytes_AS_STRING(default_encoding); char ascii_chars[128]; int c; for (c = 0; c < 128; c++) { ascii_chars[c] = c; } __Pyx_sys_getdefaultencoding_not_ascii = 1; ascii_chars_u = PyUnicode_DecodeASCII(ascii_chars, 128, NULL); if (ascii_chars_u == NULL) goto bad; ascii_chars_b = PyUnicode_AsEncodedString(ascii_chars_u, default_encoding_c, NULL); if (ascii_chars_b == NULL || strncmp(ascii_chars, PyBytes_AS_STRING(ascii_chars_b), 128) != 0) { PyErr_Format( PyExc_ValueError, "This module compiled with c_string_encoding=ascii, but default encoding '%.200s' is not a superset of ascii.", default_encoding_c); goto bad; } } Py_XDECREF(sys); Py_XDECREF(default_encoding); Py_XDECREF(ascii_chars_u); Py_XDECREF(ascii_chars_b); return 0; bad: Py_XDECREF(sys); Py_XDECREF(default_encoding); Py_XDECREF(ascii_chars_u); Py_XDECREF(ascii_chars_b); return -1; } #endif #if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT && PY_MAJOR_VERSION >= 3 #define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_DecodeUTF8(c_str, size, NULL) #else #define __Pyx_PyUnicode_FromStringAndSize(c_str, size) PyUnicode_Decode(c_str, size, __PYX_DEFAULT_STRING_ENCODING, NULL) #if __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT static char* __PYX_DEFAULT_STRING_ENCODING; static int __Pyx_init_sys_getdefaultencoding_params(void) { PyObject* sys = NULL; PyObject* default_encoding = NULL; char* default_encoding_c; sys = PyImport_ImportModule("sys"); if (sys == NULL) goto bad; default_encoding = PyObject_CallMethod(sys, (char*) (const char*) "getdefaultencoding", NULL); if (default_encoding == NULL) goto bad; default_encoding_c = PyBytes_AS_STRING(default_encoding); __PYX_DEFAULT_STRING_ENCODING = (char*) malloc(strlen(default_encoding_c)); strcpy(__PYX_DEFAULT_STRING_ENCODING, default_encoding_c); Py_DECREF(sys); Py_DECREF(default_encoding); return 0; bad: Py_XDECREF(sys); Py_XDECREF(default_encoding); return -1; } #endif #endif #ifdef __GNUC__ /* Test for GCC > 2.95 */ #if __GNUC__ > 2 || (__GNUC__ == 2 && (__GNUC_MINOR__ > 95)) #define likely(x) __builtin_expect(!!(x), 1) #define unlikely(x) __builtin_expect(!!(x), 0) #else /* __GNUC__ > 2 ... */ #define likely(x) (x) #define unlikely(x) (x) #endif /* __GNUC__ > 2 ... */ #else /* __GNUC__ */ #define likely(x) (x) #define unlikely(x) (x) #endif /* __GNUC__ */ static PyObject *__pyx_m; static PyObject *__pyx_d; static PyObject *__pyx_b; static PyObject *__pyx_empty_tuple; static PyObject *__pyx_empty_bytes; static int __pyx_lineno; static int __pyx_clineno = 0; static const char * __pyx_cfilenm= __FILE__; static const char *__pyx_filename; #if !defined(CYTHON_CCOMPLEX) #if defined(__cplusplus) #define CYTHON_CCOMPLEX 1 #elif defined(_Complex_I) #define CYTHON_CCOMPLEX 1 #else #define CYTHON_CCOMPLEX 0 #endif #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus #include #else #include #endif #endif #if CYTHON_CCOMPLEX && !defined(__cplusplus) && defined(__sun__) && defined(__GNUC__) #undef _Complex_I #define _Complex_I 1.0fj #endif static const char *__pyx_f[] = { "_pixelfunc.pyx", "_common.pxd", "__init__.pxd", "type.pxd", }; #define IS_UNSIGNED(type) (((type) -1) > 0) struct __Pyx_StructField_; #define __PYX_BUF_FLAGS_PACKED_STRUCT (1 << 0) typedef struct { const char* name; /* for error messages only */ struct __Pyx_StructField_* fields; size_t size; /* sizeof(type) */ size_t arraysize[8]; /* length of array in each dimension */ int ndim; char typegroup; /* _R_eal, _C_omplex, Signed _I_nt, _U_nsigned int, _S_truct, _P_ointer, _O_bject, c_H_ar */ char is_unsigned; int flags; } __Pyx_TypeInfo; typedef struct __Pyx_StructField_ { __Pyx_TypeInfo* type; const char* name; size_t offset; } __Pyx_StructField; typedef struct { __Pyx_StructField* field; size_t parent_offset; } __Pyx_BufFmt_StackElem; typedef struct { __Pyx_StructField root; __Pyx_BufFmt_StackElem* head; size_t fmt_offset; size_t new_count, enc_count; size_t struct_alignment; int is_complex; char enc_type; char new_packmode; char enc_packmode; char is_valid_array; } __Pyx_BufFmt_Context; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":723 * # in Cython to enable them only on the right systems. * * ctypedef npy_int8 int8_t # <<<<<<<<<<<<<< * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t */ typedef npy_int8 __pyx_t_5numpy_int8_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":724 * * ctypedef npy_int8 int8_t * ctypedef npy_int16 int16_t # <<<<<<<<<<<<<< * ctypedef npy_int32 int32_t * ctypedef npy_int64 int64_t */ typedef npy_int16 __pyx_t_5numpy_int16_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":725 * ctypedef npy_int8 int8_t * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t # <<<<<<<<<<<<<< * ctypedef npy_int64 int64_t * #ctypedef npy_int96 int96_t */ typedef npy_int32 __pyx_t_5numpy_int32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":726 * ctypedef npy_int16 int16_t * ctypedef npy_int32 int32_t * ctypedef npy_int64 int64_t # <<<<<<<<<<<<<< * #ctypedef npy_int96 int96_t * #ctypedef npy_int128 int128_t */ typedef npy_int64 __pyx_t_5numpy_int64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":730 * #ctypedef npy_int128 int128_t * * ctypedef npy_uint8 uint8_t # <<<<<<<<<<<<<< * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t */ typedef npy_uint8 __pyx_t_5numpy_uint8_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":731 * * ctypedef npy_uint8 uint8_t * ctypedef npy_uint16 uint16_t # <<<<<<<<<<<<<< * ctypedef npy_uint32 uint32_t * ctypedef npy_uint64 uint64_t */ typedef npy_uint16 __pyx_t_5numpy_uint16_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":732 * ctypedef npy_uint8 uint8_t * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t # <<<<<<<<<<<<<< * ctypedef npy_uint64 uint64_t * #ctypedef npy_uint96 uint96_t */ typedef npy_uint32 __pyx_t_5numpy_uint32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":733 * ctypedef npy_uint16 uint16_t * ctypedef npy_uint32 uint32_t * ctypedef npy_uint64 uint64_t # <<<<<<<<<<<<<< * #ctypedef npy_uint96 uint96_t * #ctypedef npy_uint128 uint128_t */ typedef npy_uint64 __pyx_t_5numpy_uint64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":737 * #ctypedef npy_uint128 uint128_t * * ctypedef npy_float32 float32_t # <<<<<<<<<<<<<< * ctypedef npy_float64 float64_t * #ctypedef npy_float80 float80_t */ typedef npy_float32 __pyx_t_5numpy_float32_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":738 * * ctypedef npy_float32 float32_t * ctypedef npy_float64 float64_t # <<<<<<<<<<<<<< * #ctypedef npy_float80 float80_t * #ctypedef npy_float128 float128_t */ typedef npy_float64 __pyx_t_5numpy_float64_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":747 * # The int types are mapped a bit surprising -- * # numpy.int corresponds to 'l' and numpy.long to 'q' * ctypedef npy_long int_t # <<<<<<<<<<<<<< * ctypedef npy_longlong long_t * ctypedef npy_longlong longlong_t */ typedef npy_long __pyx_t_5numpy_int_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":748 * # numpy.int corresponds to 'l' and numpy.long to 'q' * ctypedef npy_long int_t * ctypedef npy_longlong long_t # <<<<<<<<<<<<<< * ctypedef npy_longlong longlong_t * */ typedef npy_longlong __pyx_t_5numpy_long_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":749 * ctypedef npy_long int_t * ctypedef npy_longlong long_t * ctypedef npy_longlong longlong_t # <<<<<<<<<<<<<< * * ctypedef npy_ulong uint_t */ typedef npy_longlong __pyx_t_5numpy_longlong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":751 * ctypedef npy_longlong longlong_t * * ctypedef npy_ulong uint_t # <<<<<<<<<<<<<< * ctypedef npy_ulonglong ulong_t * ctypedef npy_ulonglong ulonglong_t */ typedef npy_ulong __pyx_t_5numpy_uint_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":752 * * ctypedef npy_ulong uint_t * ctypedef npy_ulonglong ulong_t # <<<<<<<<<<<<<< * ctypedef npy_ulonglong ulonglong_t * */ typedef npy_ulonglong __pyx_t_5numpy_ulong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":753 * ctypedef npy_ulong uint_t * ctypedef npy_ulonglong ulong_t * ctypedef npy_ulonglong ulonglong_t # <<<<<<<<<<<<<< * * ctypedef npy_intp intp_t */ typedef npy_ulonglong __pyx_t_5numpy_ulonglong_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":755 * ctypedef npy_ulonglong ulonglong_t * * ctypedef npy_intp intp_t # <<<<<<<<<<<<<< * ctypedef npy_uintp uintp_t * */ typedef npy_intp __pyx_t_5numpy_intp_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":756 * * ctypedef npy_intp intp_t * ctypedef npy_uintp uintp_t # <<<<<<<<<<<<<< * * ctypedef npy_double float_t */ typedef npy_uintp __pyx_t_5numpy_uintp_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":758 * ctypedef npy_uintp uintp_t * * ctypedef npy_double float_t # <<<<<<<<<<<<<< * ctypedef npy_double double_t * ctypedef npy_longdouble longdouble_t */ typedef npy_double __pyx_t_5numpy_float_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":759 * * ctypedef npy_double float_t * ctypedef npy_double double_t # <<<<<<<<<<<<<< * ctypedef npy_longdouble longdouble_t * */ typedef npy_double __pyx_t_5numpy_double_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":760 * ctypedef npy_double float_t * ctypedef npy_double double_t * ctypedef npy_longdouble longdouble_t # <<<<<<<<<<<<<< * * ctypedef npy_cfloat cfloat_t */ typedef npy_longdouble __pyx_t_5numpy_longdouble_t; /* "_common.pxd":6 * from libcpp.vector cimport vector * * ctypedef unsigned size_t # <<<<<<<<<<<<<< * ctypedef size_t tsize * */ typedef unsigned int __pyx_t_7_common_size_t; /* "_common.pxd":7 * * ctypedef unsigned size_t * ctypedef size_t tsize # <<<<<<<<<<<<<< * * cdef extern from "stddef.h": */ typedef size_t __pyx_t_7_common_tsize; /* "_common.pxd":11 * cdef extern from "stddef.h": * ctypedef long ptrdiff_t * ctypedef ptrdiff_t tdiff # <<<<<<<<<<<<<< * * cdef extern from "datatypes.h": */ typedef ptrdiff_t __pyx_t_7_common_tdiff; #if CYTHON_CCOMPLEX #ifdef __cplusplus typedef ::std::complex< float > __pyx_t_float_complex; #else typedef float _Complex __pyx_t_float_complex; #endif #else typedef struct { float real, imag; } __pyx_t_float_complex; #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus typedef ::std::complex< double > __pyx_t_double_complex; #else typedef double _Complex __pyx_t_double_complex; #endif #else typedef struct { double real, imag; } __pyx_t_double_complex; #endif /*--- Type declarations ---*/ /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":762 * ctypedef npy_longdouble longdouble_t * * ctypedef npy_cfloat cfloat_t # <<<<<<<<<<<<<< * ctypedef npy_cdouble cdouble_t * ctypedef npy_clongdouble clongdouble_t */ typedef npy_cfloat __pyx_t_5numpy_cfloat_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":763 * * ctypedef npy_cfloat cfloat_t * ctypedef npy_cdouble cdouble_t # <<<<<<<<<<<<<< * ctypedef npy_clongdouble clongdouble_t * */ typedef npy_cdouble __pyx_t_5numpy_cdouble_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":764 * ctypedef npy_cfloat cfloat_t * ctypedef npy_cdouble cdouble_t * ctypedef npy_clongdouble clongdouble_t # <<<<<<<<<<<<<< * * ctypedef npy_cdouble complex_t */ typedef npy_clongdouble __pyx_t_5numpy_clongdouble_t; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":766 * ctypedef npy_clongdouble clongdouble_t * * ctypedef npy_cdouble complex_t # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew1(a): */ typedef npy_cdouble __pyx_t_5numpy_complex_t; #ifndef CYTHON_REFNANNY #define CYTHON_REFNANNY 0 #endif #if CYTHON_REFNANNY typedef struct { void (*INCREF)(void*, PyObject*, int); void (*DECREF)(void*, PyObject*, int); void (*GOTREF)(void*, PyObject*, int); void (*GIVEREF)(void*, PyObject*, int); void* (*SetupContext)(const char*, int, const char*); void (*FinishContext)(void**); } __Pyx_RefNannyAPIStruct; static __Pyx_RefNannyAPIStruct *__Pyx_RefNanny = NULL; static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname); /*proto*/ #define __Pyx_RefNannyDeclarations void *__pyx_refnanny = NULL; #ifdef WITH_THREAD #define __Pyx_RefNannySetupContext(name, acquire_gil) \ if (acquire_gil) { \ PyGILState_STATE __pyx_gilstate_save = PyGILState_Ensure(); \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__); \ PyGILState_Release(__pyx_gilstate_save); \ } else { \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__); \ } #else #define __Pyx_RefNannySetupContext(name, acquire_gil) \ __pyx_refnanny = __Pyx_RefNanny->SetupContext((name), __LINE__, __FILE__) #endif #define __Pyx_RefNannyFinishContext() \ __Pyx_RefNanny->FinishContext(&__pyx_refnanny) #define __Pyx_INCREF(r) __Pyx_RefNanny->INCREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_DECREF(r) __Pyx_RefNanny->DECREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_GOTREF(r) __Pyx_RefNanny->GOTREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_GIVEREF(r) __Pyx_RefNanny->GIVEREF(__pyx_refnanny, (PyObject *)(r), __LINE__) #define __Pyx_XINCREF(r) do { if((r) != NULL) {__Pyx_INCREF(r); }} while(0) #define __Pyx_XDECREF(r) do { if((r) != NULL) {__Pyx_DECREF(r); }} while(0) #define __Pyx_XGOTREF(r) do { if((r) != NULL) {__Pyx_GOTREF(r); }} while(0) #define __Pyx_XGIVEREF(r) do { if((r) != NULL) {__Pyx_GIVEREF(r);}} while(0) #else #define __Pyx_RefNannyDeclarations #define __Pyx_RefNannySetupContext(name, acquire_gil) #define __Pyx_RefNannyFinishContext() #define __Pyx_INCREF(r) Py_INCREF(r) #define __Pyx_DECREF(r) Py_DECREF(r) #define __Pyx_GOTREF(r) #define __Pyx_GIVEREF(r) #define __Pyx_XINCREF(r) Py_XINCREF(r) #define __Pyx_XDECREF(r) Py_XDECREF(r) #define __Pyx_XGOTREF(r) #define __Pyx_XGIVEREF(r) #endif /* CYTHON_REFNANNY */ #define __Pyx_XDECREF_SET(r, v) do { \ PyObject *tmp = (PyObject *) r; \ r = v; __Pyx_XDECREF(tmp); \ } while (0) #define __Pyx_DECREF_SET(r, v) do { \ PyObject *tmp = (PyObject *) r; \ r = v; __Pyx_DECREF(tmp); \ } while (0) #define __Pyx_CLEAR(r) do { PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);} while(0) #define __Pyx_XCLEAR(r) do { if((r) != NULL) {PyObject* tmp = ((PyObject*)(r)); r = NULL; __Pyx_DECREF(tmp);}} while(0) #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_GetAttrStr(PyObject* obj, PyObject* attr_name) { PyTypeObject* tp = Py_TYPE(obj); if (likely(tp->tp_getattro)) return tp->tp_getattro(obj, attr_name); #if PY_MAJOR_VERSION < 3 if (likely(tp->tp_getattr)) return tp->tp_getattr(obj, PyString_AS_STRING(attr_name)); #endif return PyObject_GetAttr(obj, attr_name); } #else #define __Pyx_PyObject_GetAttrStr(o,n) PyObject_GetAttr(o,n) #endif static PyObject *__Pyx_GetBuiltinName(PyObject *name); /*proto*/ static void __Pyx_RaiseArgtupleInvalid(const char* func_name, int exact, Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found); /*proto*/ static void __Pyx_RaiseDoubleKeywordsError(const char* func_name, PyObject* kw_name); /*proto*/ static int __Pyx_ParseOptionalKeywords(PyObject *kwds, PyObject **argnames[], \ PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args, \ const char* function_name); /*proto*/ static CYTHON_INLINE int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed, const char *name, int exact); /*proto*/ static CYTHON_INLINE int __Pyx_GetBufferAndValidate(Py_buffer* buf, PyObject* obj, __Pyx_TypeInfo* dtype, int flags, int nd, int cast, __Pyx_BufFmt_StackElem* stack); static CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info); #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw); /*proto*/ #else #define __Pyx_PyObject_Call(func, arg, kw) PyObject_Call(func, arg, kw) #endif static CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb); /*proto*/ static CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb); /*proto*/ static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause); /*proto*/ static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name); /*proto*/ static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type); /*proto*/ static void __Pyx_RaiseBufferIndexError(int axis); /*proto*/ #define __Pyx_BufPtrStrided1d(type, buf, i0, s0) (type)((char*)buf + i0 * s0) static void __Pyx_WriteUnraisable(const char *name, int clineno, int lineno, const char *filename, int full_traceback); /*proto*/ #define __Pyx_BufPtrCContig1d(type, buf, i0, s0) ((type)buf + i0) static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected); static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index); static CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void); typedef struct { Py_ssize_t shape, strides, suboffsets; } __Pyx_Buf_DimInfo; typedef struct { size_t refcount; Py_buffer pybuffer; } __Pyx_Buffer; typedef struct { __Pyx_Buffer *rcbuffer; char *data; __Pyx_Buf_DimInfo diminfo[8]; } __Pyx_LocalBuf_ND; #if PY_MAJOR_VERSION < 3 static int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags); static void __Pyx_ReleaseBuffer(Py_buffer *view); #else #define __Pyx_GetBuffer PyObject_GetBuffer #define __Pyx_ReleaseBuffer PyBuffer_Release #endif static Py_ssize_t __Pyx_zeros[] = {0, 0, 0, 0, 0, 0, 0, 0}; static Py_ssize_t __Pyx_minusones[] = {-1, -1, -1, -1, -1, -1, -1, -1}; static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level); /*proto*/ static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *); static CYTHON_INLINE int64 __Pyx_PyInt_As_int64(PyObject *); static CYTHON_INLINE PyObject* __Pyx_PyInt_From_Py_intptr_t(Py_intptr_t value); static CYTHON_INLINE Py_intptr_t __Pyx_PyInt_As_Py_intptr_t(PyObject *); static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value); static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *); #if CYTHON_CCOMPLEX #ifdef __cplusplus #define __Pyx_CREAL(z) ((z).real()) #define __Pyx_CIMAG(z) ((z).imag()) #else #define __Pyx_CREAL(z) (__real__(z)) #define __Pyx_CIMAG(z) (__imag__(z)) #endif #else #define __Pyx_CREAL(z) ((z).real) #define __Pyx_CIMAG(z) ((z).imag) #endif #if (defined(_WIN32) || defined(__clang__)) && defined(__cplusplus) && CYTHON_CCOMPLEX #define __Pyx_SET_CREAL(z,x) ((z).real(x)) #define __Pyx_SET_CIMAG(z,y) ((z).imag(y)) #else #define __Pyx_SET_CREAL(z,x) __Pyx_CREAL(z) = (x) #define __Pyx_SET_CIMAG(z,y) __Pyx_CIMAG(z) = (y) #endif static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float, float); #if CYTHON_CCOMPLEX #define __Pyx_c_eqf(a, b) ((a)==(b)) #define __Pyx_c_sumf(a, b) ((a)+(b)) #define __Pyx_c_difff(a, b) ((a)-(b)) #define __Pyx_c_prodf(a, b) ((a)*(b)) #define __Pyx_c_quotf(a, b) ((a)/(b)) #define __Pyx_c_negf(a) (-(a)) #ifdef __cplusplus #define __Pyx_c_is_zerof(z) ((z)==(float)0) #define __Pyx_c_conjf(z) (::std::conj(z)) #if 1 #define __Pyx_c_absf(z) (::std::abs(z)) #define __Pyx_c_powf(a, b) (::std::pow(a, b)) #endif #else #define __Pyx_c_is_zerof(z) ((z)==0) #define __Pyx_c_conjf(z) (conjf(z)) #if 1 #define __Pyx_c_absf(z) (cabsf(z)) #define __Pyx_c_powf(a, b) (cpowf(a, b)) #endif #endif #else static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex, __pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex); static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex); #if 1 static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex); static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex, __pyx_t_float_complex); #endif #endif static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double, double); #if CYTHON_CCOMPLEX #define __Pyx_c_eq(a, b) ((a)==(b)) #define __Pyx_c_sum(a, b) ((a)+(b)) #define __Pyx_c_diff(a, b) ((a)-(b)) #define __Pyx_c_prod(a, b) ((a)*(b)) #define __Pyx_c_quot(a, b) ((a)/(b)) #define __Pyx_c_neg(a) (-(a)) #ifdef __cplusplus #define __Pyx_c_is_zero(z) ((z)==(double)0) #define __Pyx_c_conj(z) (::std::conj(z)) #if 1 #define __Pyx_c_abs(z) (::std::abs(z)) #define __Pyx_c_pow(a, b) (::std::pow(a, b)) #endif #else #define __Pyx_c_is_zero(z) ((z)==0) #define __Pyx_c_conj(z) (conj(z)) #if 1 #define __Pyx_c_abs(z) (cabs(z)) #define __Pyx_c_pow(a, b) (cpow(a, b)) #endif #endif #else static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex, __pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex); static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex); #if 1 static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex); static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex, __pyx_t_double_complex); #endif #endif static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value); static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *); static int __Pyx_check_binary_version(void); #if !defined(__Pyx_PyIdentifier_FromString) #if PY_MAJOR_VERSION < 3 #define __Pyx_PyIdentifier_FromString(s) PyString_FromString(s) #else #define __Pyx_PyIdentifier_FromString(s) PyUnicode_FromString(s) #endif #endif static PyObject *__Pyx_ImportModule(const char *name); /*proto*/ static PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, size_t size, int strict); /*proto*/ typedef struct { int code_line; PyCodeObject* code_object; } __Pyx_CodeObjectCacheEntry; struct __Pyx_CodeObjectCache { int count; int max_count; __Pyx_CodeObjectCacheEntry* entries; }; static struct __Pyx_CodeObjectCache __pyx_code_cache = {0,0,NULL}; static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line); static PyCodeObject *__pyx_find_code_object(int code_line); static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object); static void __Pyx_AddTraceback(const char *funcname, int c_line, int py_line, const char *filename); /*proto*/ static int __Pyx_InitStrings(__Pyx_StringTabEntry *t); /*proto*/ /* Module declarations from 'cpython.buffer' */ /* Module declarations from 'cpython.ref' */ /* Module declarations from 'libc.string' */ /* Module declarations from 'libc.stdio' */ /* Module declarations from 'cpython.object' */ /* Module declarations from '__builtin__' */ /* Module declarations from 'cpython.type' */ static PyTypeObject *__pyx_ptype_7cpython_4type_type = 0; /* Module declarations from 'libc.stdlib' */ /* Module declarations from 'numpy' */ /* Module declarations from 'numpy' */ static PyTypeObject *__pyx_ptype_5numpy_dtype = 0; static PyTypeObject *__pyx_ptype_5numpy_flatiter = 0; static PyTypeObject *__pyx_ptype_5numpy_broadcast = 0; static PyTypeObject *__pyx_ptype_5numpy_ndarray = 0; static PyTypeObject *__pyx_ptype_5numpy_ufunc = 0; static CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *, char *, char *, int *); /*proto*/ /* Module declarations from 'libcpp' */ /* Module declarations from 'cython' */ /* Module declarations from 'libcpp.vector' */ /* Module declarations from '_common' */ /* Module declarations from 'healpy._pixelfunc' */ static bool __pyx_f_6healpy_10_pixelfunc_isnsideok(int); /*proto*/ static __Pyx_TypeInfo __Pyx_TypeInfo_nn_int64 = { "int64", NULL, sizeof(int64), { 0 }, 0, IS_UNSIGNED(int64) ? 'U' : 'I', IS_UNSIGNED(int64), 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo_double = { "double", NULL, sizeof(double), { 0 }, 0, 'R', 0, 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo_nn_bool = { "bool", NULL, sizeof(bool), { 0 }, 0, IS_UNSIGNED(bool) ? 'U' : 'I', IS_UNSIGNED(bool), 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo_nn___pyx_t_5numpy_float64_t = { "float64_t", NULL, sizeof(__pyx_t_5numpy_float64_t), { 0 }, 0, 'R', 0, 0 }; static __Pyx_TypeInfo __Pyx_TypeInfo___pyx_t_double_complex = { "double complex", NULL, sizeof(__pyx_t_double_complex), { 0 }, 0, 'C', 0, 0 }; #define __Pyx_MODULE_NAME "healpy._pixelfunc" int __pyx_module_is_main_healpy___pixelfunc = 0; /* Implementation of 'healpy._pixelfunc' */ static PyObject *__pyx_builtin_ValueError; static PyObject *__pyx_builtin_range; static PyObject *__pyx_builtin_round; static PyObject *__pyx_builtin_RuntimeError; static PyObject *__pyx_pf_6healpy_10_pixelfunc_ringinfo(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyArrayObject *__pyx_v_ring); /* proto */ static PyObject *__pyx_pf_6healpy_10_pixelfunc_2pix2ring(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyArrayObject *__pyx_v_pix, PyObject *__pyx_v_nest); /* proto */ static int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /* proto */ static void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info); /* proto */ static char __pyx_k_B[] = "B"; static char __pyx_k_H[] = "H"; static char __pyx_k_I[] = "I"; static char __pyx_k_L[] = "L"; static char __pyx_k_O[] = "O"; static char __pyx_k_Q[] = "Q"; static char __pyx_k_b[] = "b"; static char __pyx_k_d[] = "d"; static char __pyx_k_f[] = "f"; static char __pyx_k_g[] = "g"; static char __pyx_k_h[] = "h"; static char __pyx_k_i[] = "i"; static char __pyx_k_l[] = "l"; static char __pyx_k_q[] = "q"; static char __pyx_k_Zd[] = "Zd"; static char __pyx_k_Zf[] = "Zf"; static char __pyx_k_Zg[] = "Zg"; static char __pyx_k_hb[] = "hb"; static char __pyx_k_np[] = "np"; static char __pyx_k_num[] = "num"; static char __pyx_k_pix[] = "pix"; static char __pyx_k_bool[] = "bool"; static char __pyx_k_log2[] = "log2"; static char __pyx_k_main[] = "__main__"; static char __pyx_k_nest[] = "nest"; static char __pyx_k_ring[] = "ring"; static char __pyx_k_size[] = "size"; static char __pyx_k_test[] = "__test__"; static char __pyx_k_dtype[] = "dtype"; static char __pyx_k_empty[] = "empty"; static char __pyx_k_float[] = "float"; static char __pyx_k_int64[] = "int64"; static char __pyx_k_nside[] = "nside"; static char __pyx_k_numpy[] = "numpy"; static char __pyx_k_range[] = "range"; static char __pyx_k_round[] = "round"; static char __pyx_k_import[] = "__import__"; static char __pyx_k_scheme[] = "scheme"; static char __pyx_k_ringpix[] = "ringpix"; static char __pyx_k_shifted[] = "shifted"; static char __pyx_k_costheta[] = "costheta"; static char __pyx_k_pix2ring[] = "pix2ring"; static char __pyx_k_ringinfo[] = "ringinfo"; static char __pyx_k_sintheta[] = "sintheta"; static char __pyx_k_startpix[] = "startpix"; static char __pyx_k_ValueError[] = "ValueError"; static char __pyx_k_RuntimeError[] = "RuntimeError"; static char __pyx_k_pyx_getbuffer[] = "__pyx_getbuffer"; static char __pyx_k_ringinfo_line_9[] = "ringinfo (line 9)"; static char __pyx_k_pix2ring_line_58[] = "pix2ring (line 58)"; static char __pyx_k_healpy__pixelfunc[] = "healpy._pixelfunc"; static char __pyx_k_pyx_releasebuffer[] = "__pyx_releasebuffer"; static char __pyx_k_ndarray_is_not_C_contiguous[] = "ndarray is not C contiguous"; static char __pyx_k_Get_information_for_rings_Rings[] = "Get information for rings\n\n Rings are specified by a positive integer, 1 <= ring <= 4*nside-1.\n\n Parameters\n ----------\n nside : int\n The healpix nside parameter, must be a power of 2\n ring : int, scalar or array-like\n The ring number\n\n Returns\n -------\n startpix : int64, length equal to that of *ring*\n Starting pixel identifier (NEST ordering)\n ringpix : int64, length equal to that of *ring*\n Number of pixels in ring\n costheta : float, length equal to that of *ring*\n Cosine of the co-latitude\n sintheta : float, length equal to that of *ring*\n Sine of the co-latitude\n shifted : bool, length equal to that of *ring*\n If True, the center of the first pixel is not at phi=0\n\n Example\n -------\n >>> import healpy as hp\n >>> import numpy as np\n >>> nside = 2\n >>> hp.ringinfo(nside, np.arange(4*nside-1))\n (array([ 0, 0, 4, 12, 20, 28, 36]), array([0, 4, 8, 8, 8, 8, 8]), array([ 1. , 0.91666667, 0.66666667, 0.33333333, 0. ,\n -0.33333333, -0.66666667]), array([ 0. , 0.39965263, 0.74535599, 0.94280904, 1. ,\n 0.94280904, 0.74535599]), array([ True, True, True, False, True, False, True], dtype=bool))\n "; static char __pyx_k_home_zonca_p_software_healpy_he[] = "/home/zonca/p/software/healpy/healpy/src/_pixelfunc.pyx"; static char __pyx_k_unknown_dtype_code_in_numpy_pxd[] = "unknown dtype code in numpy.pxd (%d)"; static char __pyx_k_Convert_pixel_identifier_to_ring[] = "Convert pixel identifier to ring number\n\n Rings are specified by a positive integer, 1 <= ring <= 4*nside-1.\n\n Parameters\n ----------\n nside : int\n The healpix nside parameter, must be a power of 2\n pix : int64, scalar or array-like\n The pixel identifier(s)\n nest : bool\n Is *pix* specified in the NEST ordering scheme?\n\n Returns\n -------\n ring : int, length equal to that of *pix*\n Ring number\n\n Example\n -------\n >>> import healpy as hp\n >>> import numpy as np\n >>> nside = 2\n >>> hp.pix2ring(nside, np.arange(hp.nside2npix(nside)))\n array([1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4,\n 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7,\n 7, 7])\n "; static char __pyx_k_Format_string_allocated_too_shor[] = "Format string allocated too short, see comment in numpy.pxd"; static char __pyx_k_Non_native_byte_order_not_suppor[] = "Non-native byte order not supported"; static char __pyx_k_Wrong_nside_value_must_be_a_powe[] = "Wrong nside value, must be a power of 2"; static char __pyx_k_ndarray_is_not_Fortran_contiguou[] = "ndarray is not Fortran contiguous"; static char __pyx_k_Format_string_allocated_too_shor_2[] = "Format string allocated too short."; static PyObject *__pyx_kp_u_Convert_pixel_identifier_to_ring; static PyObject *__pyx_kp_u_Format_string_allocated_too_shor; static PyObject *__pyx_kp_u_Format_string_allocated_too_shor_2; static PyObject *__pyx_kp_u_Get_information_for_rings_Rings; static PyObject *__pyx_kp_u_Non_native_byte_order_not_suppor; static PyObject *__pyx_n_s_RuntimeError; static PyObject *__pyx_n_s_ValueError; static PyObject *__pyx_kp_s_Wrong_nside_value_must_be_a_powe; static PyObject *__pyx_n_s_bool; static PyObject *__pyx_n_s_costheta; static PyObject *__pyx_n_s_dtype; static PyObject *__pyx_n_s_empty; static PyObject *__pyx_n_s_float; static PyObject *__pyx_n_s_hb; static PyObject *__pyx_n_s_healpy__pixelfunc; static PyObject *__pyx_kp_s_home_zonca_p_software_healpy_he; static PyObject *__pyx_n_s_i; static PyObject *__pyx_n_s_import; static PyObject *__pyx_n_s_int64; static PyObject *__pyx_n_s_log2; static PyObject *__pyx_n_s_main; static PyObject *__pyx_kp_u_ndarray_is_not_C_contiguous; static PyObject *__pyx_kp_u_ndarray_is_not_Fortran_contiguou; static PyObject *__pyx_n_s_nest; static PyObject *__pyx_n_s_np; static PyObject *__pyx_n_s_nside; static PyObject *__pyx_n_s_num; static PyObject *__pyx_n_s_numpy; static PyObject *__pyx_n_s_pix; static PyObject *__pyx_n_s_pix2ring; static PyObject *__pyx_kp_u_pix2ring_line_58; static PyObject *__pyx_n_s_pyx_getbuffer; static PyObject *__pyx_n_s_pyx_releasebuffer; static PyObject *__pyx_n_s_range; static PyObject *__pyx_n_s_ring; static PyObject *__pyx_n_s_ringinfo; static PyObject *__pyx_kp_u_ringinfo_line_9; static PyObject *__pyx_n_s_ringpix; static PyObject *__pyx_n_s_round; static PyObject *__pyx_n_s_scheme; static PyObject *__pyx_n_s_shifted; static PyObject *__pyx_n_s_sintheta; static PyObject *__pyx_n_s_size; static PyObject *__pyx_n_s_startpix; static PyObject *__pyx_n_s_test; static PyObject *__pyx_kp_u_unknown_dtype_code_in_numpy_pxd; static PyObject *__pyx_int_2; static PyObject *__pyx_tuple_; static PyObject *__pyx_tuple__2; static PyObject *__pyx_tuple__3; static PyObject *__pyx_tuple__4; static PyObject *__pyx_tuple__5; static PyObject *__pyx_tuple__6; static PyObject *__pyx_tuple__7; static PyObject *__pyx_tuple__8; static PyObject *__pyx_tuple__9; static PyObject *__pyx_tuple__11; static PyObject *__pyx_codeobj__10; static PyObject *__pyx_codeobj__12; /* "healpy/src/_pixelfunc.pyx":9 * from _common cimport int64, Healpix_Ordering_Scheme, RING, NEST, SET_NSIDE, T_Healpix_Base * * def ringinfo(nside, np.ndarray[int64, ndim=1] ring not None): # <<<<<<<<<<<<<< * """Get information for rings * */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_10_pixelfunc_1ringinfo(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_10_pixelfunc_ringinfo[] = "Get information for rings\n\n Rings are specified by a positive integer, 1 <= ring <= 4*nside-1.\n\n Parameters\n ----------\n nside : int\n The healpix nside parameter, must be a power of 2\n ring : int, scalar or array-like\n The ring number\n\n Returns\n -------\n startpix : int64, length equal to that of *ring*\n Starting pixel identifier (NEST ordering)\n ringpix : int64, length equal to that of *ring*\n Number of pixels in ring\n costheta : float, length equal to that of *ring*\n Cosine of the co-latitude\n sintheta : float, length equal to that of *ring*\n Sine of the co-latitude\n shifted : bool, length equal to that of *ring*\n If True, the center of the first pixel is not at phi=0\n\n Example\n -------\n >>> import healpy as hp\n >>> import numpy as np\n >>> nside = 2\n >>> hp.ringinfo(nside, np.arange(4*nside-1))\n (array([ 0, 0, 4, 12, 20, 28, 36]), array([0, 4, 8, 8, 8, 8, 8]), array([ 1. , 0.91666667, 0.66666667, 0.33333333, 0. ,\n -0.33333333, -0.66666667]), array([ 0. , 0.39965263, 0.74535599, 0.94280904, 1. ,\n 0.94280904, 0.74535599]), array([ True, True, True, False, True, False, True], dtype=bool))\n "; static PyMethodDef __pyx_mdef_6healpy_10_pixelfunc_1ringinfo = {__Pyx_NAMESTR("ringinfo"), (PyCFunction)__pyx_pw_6healpy_10_pixelfunc_1ringinfo, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_10_pixelfunc_ringinfo)}; static PyObject *__pyx_pw_6healpy_10_pixelfunc_1ringinfo(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_nside = 0; PyArrayObject *__pyx_v_ring = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("ringinfo (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nside,&__pyx_n_s_ring,0}; PyObject* values[2] = {0,0}; if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_ring)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("ringinfo", 1, 2, 2, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "ringinfo") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else if (PyTuple_GET_SIZE(__pyx_args) != 2) { goto __pyx_L5_argtuple_error; } else { values[0] = PyTuple_GET_ITEM(__pyx_args, 0); values[1] = PyTuple_GET_ITEM(__pyx_args, 1); } __pyx_v_nside = values[0]; __pyx_v_ring = ((PyArrayObject *)values[1]); } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("ringinfo", 1, 2, 2, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._pixelfunc.ringinfo", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_ring), __pyx_ptype_5numpy_ndarray, 0, "ring", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_r = __pyx_pf_6healpy_10_pixelfunc_ringinfo(__pyx_self, __pyx_v_nside, __pyx_v_ring); /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_10_pixelfunc_ringinfo(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyArrayObject *__pyx_v_ring) { enum Healpix_Ordering_Scheme __pyx_v_scheme; T_Healpix_Base __pyx_v_hb; npy_intp __pyx_v_num; PyArrayObject *__pyx_v_startpix = 0; PyArrayObject *__pyx_v_ringpix = 0; PyArrayObject *__pyx_v_costheta = 0; PyArrayObject *__pyx_v_sintheta = 0; PyArrayObject *__pyx_v_shifted = 0; npy_intp __pyx_v_i; __Pyx_LocalBuf_ND __pyx_pybuffernd_costheta; __Pyx_Buffer __pyx_pybuffer_costheta; __Pyx_LocalBuf_ND __pyx_pybuffernd_ring; __Pyx_Buffer __pyx_pybuffer_ring; __Pyx_LocalBuf_ND __pyx_pybuffernd_ringpix; __Pyx_Buffer __pyx_pybuffer_ringpix; __Pyx_LocalBuf_ND __pyx_pybuffernd_shifted; __Pyx_Buffer __pyx_pybuffer_shifted; __Pyx_LocalBuf_ND __pyx_pybuffernd_sintheta; __Pyx_Buffer __pyx_pybuffer_sintheta; __Pyx_LocalBuf_ND __pyx_pybuffernd_startpix; __Pyx_Buffer __pyx_pybuffer_startpix; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; int64 __pyx_t_4; PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyObject *__pyx_t_8 = NULL; PyArrayObject *__pyx_t_9 = NULL; PyArrayObject *__pyx_t_10 = NULL; PyArrayObject *__pyx_t_11 = NULL; PyArrayObject *__pyx_t_12 = NULL; PyArrayObject *__pyx_t_13 = NULL; npy_intp __pyx_t_14; npy_intp __pyx_t_15; npy_intp __pyx_t_16; npy_intp __pyx_t_17; npy_intp __pyx_t_18; npy_intp __pyx_t_19; npy_intp __pyx_t_20; npy_intp __pyx_t_21; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("ringinfo", 0); __pyx_pybuffer_startpix.pybuffer.buf = NULL; __pyx_pybuffer_startpix.refcount = 0; __pyx_pybuffernd_startpix.data = NULL; __pyx_pybuffernd_startpix.rcbuffer = &__pyx_pybuffer_startpix; __pyx_pybuffer_ringpix.pybuffer.buf = NULL; __pyx_pybuffer_ringpix.refcount = 0; __pyx_pybuffernd_ringpix.data = NULL; __pyx_pybuffernd_ringpix.rcbuffer = &__pyx_pybuffer_ringpix; __pyx_pybuffer_costheta.pybuffer.buf = NULL; __pyx_pybuffer_costheta.refcount = 0; __pyx_pybuffernd_costheta.data = NULL; __pyx_pybuffernd_costheta.rcbuffer = &__pyx_pybuffer_costheta; __pyx_pybuffer_sintheta.pybuffer.buf = NULL; __pyx_pybuffer_sintheta.refcount = 0; __pyx_pybuffernd_sintheta.data = NULL; __pyx_pybuffernd_sintheta.rcbuffer = &__pyx_pybuffer_sintheta; __pyx_pybuffer_shifted.pybuffer.buf = NULL; __pyx_pybuffer_shifted.refcount = 0; __pyx_pybuffernd_shifted.data = NULL; __pyx_pybuffernd_shifted.rcbuffer = &__pyx_pybuffer_shifted; __pyx_pybuffer_ring.pybuffer.buf = NULL; __pyx_pybuffer_ring.refcount = 0; __pyx_pybuffernd_ring.data = NULL; __pyx_pybuffernd_ring.rcbuffer = &__pyx_pybuffer_ring; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_ring.rcbuffer->pybuffer, (PyObject*)__pyx_v_ring, &__Pyx_TypeInfo_nn_int64, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_ring.diminfo[0].strides = __pyx_pybuffernd_ring.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_ring.diminfo[0].shape = __pyx_pybuffernd_ring.rcbuffer->pybuffer.shape[0]; /* "healpy/src/_pixelfunc.pyx":44 * 0.94280904, 0.74535599]), array([ True, True, True, False, True, False, True], dtype=bool)) * """ * if not isnsideok(nside): # <<<<<<<<<<<<<< * raise ValueError('Wrong nside value, must be a power of 2') * cdef Healpix_Ordering_Scheme scheme = NEST */ __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nside); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 44; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((!(__pyx_f_6healpy_10_pixelfunc_isnsideok(__pyx_t_1) != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_pixelfunc.pyx":45 * """ * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme = NEST * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple_, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 45; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 45; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_pixelfunc.pyx":46 * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') * cdef Healpix_Ordering_Scheme scheme = NEST # <<<<<<<<<<<<<< * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * num = ring.shape[0] */ __pyx_v_scheme = NEST; /* "healpy/src/_pixelfunc.pyx":47 * raise ValueError('Wrong nside value, must be a power of 2') * cdef Healpix_Ordering_Scheme scheme = NEST * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # <<<<<<<<<<<<<< * num = ring.shape[0] * cdef np.ndarray[int64, ndim=1] startpix = np.empty(num, dtype=np.int64) */ __pyx_t_4 = __Pyx_PyInt_As_int64(__pyx_v_nside); if (unlikely((__pyx_t_4 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 47; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb = T_Healpix_Base(__pyx_t_4, __pyx_v_scheme, SET_NSIDE); /* "healpy/src/_pixelfunc.pyx":48 * cdef Healpix_Ordering_Scheme scheme = NEST * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * num = ring.shape[0] # <<<<<<<<<<<<<< * cdef np.ndarray[int64, ndim=1] startpix = np.empty(num, dtype=np.int64) * cdef np.ndarray[int64, ndim=1] ringpix = np.empty(num, dtype=np.int64) */ __pyx_v_num = (__pyx_v_ring->dimensions[0]); /* "healpy/src/_pixelfunc.pyx":49 * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * num = ring.shape[0] * cdef np.ndarray[int64, ndim=1] startpix = np.empty(num, dtype=np.int64) # <<<<<<<<<<<<<< * cdef np.ndarray[int64, ndim=1] ringpix = np.empty(num, dtype=np.int64) * cdef np.ndarray[double, ndim=1] costheta = np.empty(num, dtype=np.float) */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_empty); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyInt_From_Py_intptr_t(__pyx_v_num); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyDict_New(); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_7, __pyx_n_s_int64); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (PyDict_SetItem(__pyx_t_3, __pyx_n_s_dtype, __pyx_t_8) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_6, __pyx_t_3); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (!(likely(((__pyx_t_8) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_8, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_9 = ((PyArrayObject *)__pyx_t_8); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_startpix.rcbuffer->pybuffer, (PyObject*)__pyx_t_9, &__Pyx_TypeInfo_nn_int64, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) { __pyx_v_startpix = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_startpix.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 49; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_startpix.diminfo[0].strides = __pyx_pybuffernd_startpix.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_startpix.diminfo[0].shape = __pyx_pybuffernd_startpix.rcbuffer->pybuffer.shape[0]; } } __pyx_t_9 = 0; __pyx_v_startpix = ((PyArrayObject *)__pyx_t_8); __pyx_t_8 = 0; /* "healpy/src/_pixelfunc.pyx":50 * num = ring.shape[0] * cdef np.ndarray[int64, ndim=1] startpix = np.empty(num, dtype=np.int64) * cdef np.ndarray[int64, ndim=1] ringpix = np.empty(num, dtype=np.int64) # <<<<<<<<<<<<<< * cdef np.ndarray[double, ndim=1] costheta = np.empty(num, dtype=np.float) * cdef np.ndarray[double, ndim=1] sintheta = np.empty(num, dtype=np.float) */ __pyx_t_8 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_8, __pyx_n_s_empty); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyInt_From_Py_intptr_t(__pyx_v_num); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = PyDict_New(); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_int64); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (PyDict_SetItem(__pyx_t_8, __pyx_n_s_dtype, __pyx_t_7) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = __Pyx_PyObject_Call(__pyx_t_3, __pyx_t_6, __pyx_t_8); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; if (!(likely(((__pyx_t_7) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_7, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_10 = ((PyArrayObject *)__pyx_t_7); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_ringpix.rcbuffer->pybuffer, (PyObject*)__pyx_t_10, &__Pyx_TypeInfo_nn_int64, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) { __pyx_v_ringpix = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_ringpix.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 50; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_ringpix.diminfo[0].strides = __pyx_pybuffernd_ringpix.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_ringpix.diminfo[0].shape = __pyx_pybuffernd_ringpix.rcbuffer->pybuffer.shape[0]; } } __pyx_t_10 = 0; __pyx_v_ringpix = ((PyArrayObject *)__pyx_t_7); __pyx_t_7 = 0; /* "healpy/src/_pixelfunc.pyx":51 * cdef np.ndarray[int64, ndim=1] startpix = np.empty(num, dtype=np.int64) * cdef np.ndarray[int64, ndim=1] ringpix = np.empty(num, dtype=np.int64) * cdef np.ndarray[double, ndim=1] costheta = np.empty(num, dtype=np.float) # <<<<<<<<<<<<<< * cdef np.ndarray[double, ndim=1] sintheta = np.empty(num, dtype=np.float) * cdef np.ndarray[bool, ndim=1, cast=True] shifted = np.empty(num, dtype=np.bool) */ __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_7, __pyx_n_s_empty); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = __Pyx_PyInt_From_Py_intptr_t(__pyx_v_num); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_7); __Pyx_GIVEREF(__pyx_t_7); __pyx_t_7 = 0; __pyx_t_7 = PyDict_New(); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_float); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (PyDict_SetItem(__pyx_t_7, __pyx_n_s_dtype, __pyx_t_5) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyObject_Call(__pyx_t_8, __pyx_t_6, __pyx_t_7); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (!(likely(((__pyx_t_5) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_5, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_11 = ((PyArrayObject *)__pyx_t_5); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_costheta.rcbuffer->pybuffer, (PyObject*)__pyx_t_11, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) { __pyx_v_costheta = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_costheta.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 51; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_costheta.diminfo[0].strides = __pyx_pybuffernd_costheta.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_costheta.diminfo[0].shape = __pyx_pybuffernd_costheta.rcbuffer->pybuffer.shape[0]; } } __pyx_t_11 = 0; __pyx_v_costheta = ((PyArrayObject *)__pyx_t_5); __pyx_t_5 = 0; /* "healpy/src/_pixelfunc.pyx":52 * cdef np.ndarray[int64, ndim=1] ringpix = np.empty(num, dtype=np.int64) * cdef np.ndarray[double, ndim=1] costheta = np.empty(num, dtype=np.float) * cdef np.ndarray[double, ndim=1] sintheta = np.empty(num, dtype=np.float) # <<<<<<<<<<<<<< * cdef np.ndarray[bool, ndim=1, cast=True] shifted = np.empty(num, dtype=np.bool) * for i in range(num): */ __pyx_t_5 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_7 = __Pyx_PyObject_GetAttrStr(__pyx_t_5, __pyx_n_s_empty); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = __Pyx_PyInt_From_Py_intptr_t(__pyx_v_num); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_5); __Pyx_GIVEREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyDict_New(); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __pyx_t_8 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __pyx_t_3 = __Pyx_PyObject_GetAttrStr(__pyx_t_8, __pyx_n_s_float); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; if (PyDict_SetItem(__pyx_t_5, __pyx_n_s_dtype, __pyx_t_3) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_7, __pyx_t_6, __pyx_t_5); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_12 = ((PyArrayObject *)__pyx_t_3); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_sintheta.rcbuffer->pybuffer, (PyObject*)__pyx_t_12, &__Pyx_TypeInfo_double, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) { __pyx_v_sintheta = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_sintheta.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 52; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_sintheta.diminfo[0].strides = __pyx_pybuffernd_sintheta.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_sintheta.diminfo[0].shape = __pyx_pybuffernd_sintheta.rcbuffer->pybuffer.shape[0]; } } __pyx_t_12 = 0; __pyx_v_sintheta = ((PyArrayObject *)__pyx_t_3); __pyx_t_3 = 0; /* "healpy/src/_pixelfunc.pyx":53 * cdef np.ndarray[double, ndim=1] costheta = np.empty(num, dtype=np.float) * cdef np.ndarray[double, ndim=1] sintheta = np.empty(num, dtype=np.float) * cdef np.ndarray[bool, ndim=1, cast=True] shifted = np.empty(num, dtype=np.bool) # <<<<<<<<<<<<<< * for i in range(num): * hb.get_ring_info(ring[i], startpix[i], ringpix[i], costheta[i], sintheta[i], shifted[i]) */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_empty); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyInt_From_Py_intptr_t(__pyx_v_num); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyDict_New(); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_7, __pyx_n_s_bool); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (PyDict_SetItem(__pyx_t_3, __pyx_n_s_dtype, __pyx_t_8) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_6, __pyx_t_3); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (!(likely(((__pyx_t_8) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_8, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_13 = ((PyArrayObject *)__pyx_t_8); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_shifted.rcbuffer->pybuffer, (PyObject*)__pyx_t_13, &__Pyx_TypeInfo_nn_bool, PyBUF_FORMAT| PyBUF_STRIDES, 1, 1, __pyx_stack) == -1)) { __pyx_v_shifted = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_shifted.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 53; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_shifted.diminfo[0].strides = __pyx_pybuffernd_shifted.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_shifted.diminfo[0].shape = __pyx_pybuffernd_shifted.rcbuffer->pybuffer.shape[0]; } } __pyx_t_13 = 0; __pyx_v_shifted = ((PyArrayObject *)__pyx_t_8); __pyx_t_8 = 0; /* "healpy/src/_pixelfunc.pyx":54 * cdef np.ndarray[double, ndim=1] sintheta = np.empty(num, dtype=np.float) * cdef np.ndarray[bool, ndim=1, cast=True] shifted = np.empty(num, dtype=np.bool) * for i in range(num): # <<<<<<<<<<<<<< * hb.get_ring_info(ring[i], startpix[i], ringpix[i], costheta[i], sintheta[i], shifted[i]) * return startpix, ringpix, costheta, sintheta, shifted */ __pyx_t_14 = __pyx_v_num; for (__pyx_t_15 = 0; __pyx_t_15 < __pyx_t_14; __pyx_t_15+=1) { __pyx_v_i = __pyx_t_15; /* "healpy/src/_pixelfunc.pyx":55 * cdef np.ndarray[bool, ndim=1, cast=True] shifted = np.empty(num, dtype=np.bool) * for i in range(num): * hb.get_ring_info(ring[i], startpix[i], ringpix[i], costheta[i], sintheta[i], shifted[i]) # <<<<<<<<<<<<<< * return startpix, ringpix, costheta, sintheta, shifted * */ __pyx_t_16 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_16 < 0) { __pyx_t_16 += __pyx_pybuffernd_ring.diminfo[0].shape; if (unlikely(__pyx_t_16 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_16 >= __pyx_pybuffernd_ring.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_17 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_17 < 0) { __pyx_t_17 += __pyx_pybuffernd_startpix.diminfo[0].shape; if (unlikely(__pyx_t_17 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_17 >= __pyx_pybuffernd_startpix.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_18 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_18 < 0) { __pyx_t_18 += __pyx_pybuffernd_ringpix.diminfo[0].shape; if (unlikely(__pyx_t_18 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_18 >= __pyx_pybuffernd_ringpix.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_19 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_19 < 0) { __pyx_t_19 += __pyx_pybuffernd_costheta.diminfo[0].shape; if (unlikely(__pyx_t_19 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_19 >= __pyx_pybuffernd_costheta.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_20 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_20 < 0) { __pyx_t_20 += __pyx_pybuffernd_sintheta.diminfo[0].shape; if (unlikely(__pyx_t_20 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_20 >= __pyx_pybuffernd_sintheta.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_21 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_21 < 0) { __pyx_t_21 += __pyx_pybuffernd_shifted.diminfo[0].shape; if (unlikely(__pyx_t_21 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_21 >= __pyx_pybuffernd_shifted.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 55; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_v_hb.get_ring_info((*__Pyx_BufPtrStrided1d(int64 *, __pyx_pybuffernd_ring.rcbuffer->pybuffer.buf, __pyx_t_16, __pyx_pybuffernd_ring.diminfo[0].strides)), (*__Pyx_BufPtrStrided1d(int64 *, __pyx_pybuffernd_startpix.rcbuffer->pybuffer.buf, __pyx_t_17, __pyx_pybuffernd_startpix.diminfo[0].strides)), (*__Pyx_BufPtrStrided1d(int64 *, __pyx_pybuffernd_ringpix.rcbuffer->pybuffer.buf, __pyx_t_18, __pyx_pybuffernd_ringpix.diminfo[0].strides)), (*__Pyx_BufPtrStrided1d(double *, __pyx_pybuffernd_costheta.rcbuffer->pybuffer.buf, __pyx_t_19, __pyx_pybuffernd_costheta.diminfo[0].strides)), (*__Pyx_BufPtrStrided1d(double *, __pyx_pybuffernd_sintheta.rcbuffer->pybuffer.buf, __pyx_t_20, __pyx_pybuffernd_sintheta.diminfo[0].strides)), (*__Pyx_BufPtrStrided1d(bool *, __pyx_pybuffernd_shifted.rcbuffer->pybuffer.buf, __pyx_t_21, __pyx_pybuffernd_shifted.diminfo[0].strides))); } /* "healpy/src/_pixelfunc.pyx":56 * for i in range(num): * hb.get_ring_info(ring[i], startpix[i], ringpix[i], costheta[i], sintheta[i], shifted[i]) * return startpix, ringpix, costheta, sintheta, shifted # <<<<<<<<<<<<<< * * def pix2ring(nside, np.ndarray[int64, ndim=1] pix not None, nest=False): */ __Pyx_XDECREF(__pyx_r); __pyx_t_8 = PyTuple_New(5); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 56; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_INCREF(((PyObject *)__pyx_v_startpix)); PyTuple_SET_ITEM(__pyx_t_8, 0, ((PyObject *)__pyx_v_startpix)); __Pyx_GIVEREF(((PyObject *)__pyx_v_startpix)); __Pyx_INCREF(((PyObject *)__pyx_v_ringpix)); PyTuple_SET_ITEM(__pyx_t_8, 1, ((PyObject *)__pyx_v_ringpix)); __Pyx_GIVEREF(((PyObject *)__pyx_v_ringpix)); __Pyx_INCREF(((PyObject *)__pyx_v_costheta)); PyTuple_SET_ITEM(__pyx_t_8, 2, ((PyObject *)__pyx_v_costheta)); __Pyx_GIVEREF(((PyObject *)__pyx_v_costheta)); __Pyx_INCREF(((PyObject *)__pyx_v_sintheta)); PyTuple_SET_ITEM(__pyx_t_8, 3, ((PyObject *)__pyx_v_sintheta)); __Pyx_GIVEREF(((PyObject *)__pyx_v_sintheta)); __Pyx_INCREF(((PyObject *)__pyx_v_shifted)); PyTuple_SET_ITEM(__pyx_t_8, 4, ((PyObject *)__pyx_v_shifted)); __Pyx_GIVEREF(((PyObject *)__pyx_v_shifted)); __pyx_r = __pyx_t_8; __pyx_t_8 = 0; goto __pyx_L0; /* "healpy/src/_pixelfunc.pyx":9 * from _common cimport int64, Healpix_Ordering_Scheme, RING, NEST, SET_NSIDE, T_Healpix_Base * * def ringinfo(nside, np.ndarray[int64, ndim=1] ring not None): # <<<<<<<<<<<<<< * """Get information for rings * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_XDECREF(__pyx_t_8); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_costheta.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ring.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ringpix.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_shifted.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_sintheta.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_startpix.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._pixelfunc.ringinfo", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_costheta.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ring.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ringpix.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_shifted.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_sintheta.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_startpix.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_startpix); __Pyx_XDECREF((PyObject *)__pyx_v_ringpix); __Pyx_XDECREF((PyObject *)__pyx_v_costheta); __Pyx_XDECREF((PyObject *)__pyx_v_sintheta); __Pyx_XDECREF((PyObject *)__pyx_v_shifted); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_pixelfunc.pyx":58 * return startpix, ringpix, costheta, sintheta, shifted * * def pix2ring(nside, np.ndarray[int64, ndim=1] pix not None, nest=False): # <<<<<<<<<<<<<< * """Convert pixel identifier to ring number * */ /* Python wrapper */ static PyObject *__pyx_pw_6healpy_10_pixelfunc_3pix2ring(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds); /*proto*/ static char __pyx_doc_6healpy_10_pixelfunc_2pix2ring[] = "Convert pixel identifier to ring number\n\n Rings are specified by a positive integer, 1 <= ring <= 4*nside-1.\n\n Parameters\n ----------\n nside : int\n The healpix nside parameter, must be a power of 2\n pix : int64, scalar or array-like\n The pixel identifier(s)\n nest : bool\n Is *pix* specified in the NEST ordering scheme?\n\n Returns\n -------\n ring : int, length equal to that of *pix*\n Ring number\n\n Example\n -------\n >>> import healpy as hp\n >>> import numpy as np\n >>> nside = 2\n >>> hp.pix2ring(nside, np.arange(hp.nside2npix(nside)))\n array([1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4,\n 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7,\n 7, 7])\n "; static PyMethodDef __pyx_mdef_6healpy_10_pixelfunc_3pix2ring = {__Pyx_NAMESTR("pix2ring"), (PyCFunction)__pyx_pw_6healpy_10_pixelfunc_3pix2ring, METH_VARARGS|METH_KEYWORDS, __Pyx_DOCSTR(__pyx_doc_6healpy_10_pixelfunc_2pix2ring)}; static PyObject *__pyx_pw_6healpy_10_pixelfunc_3pix2ring(PyObject *__pyx_self, PyObject *__pyx_args, PyObject *__pyx_kwds) { PyObject *__pyx_v_nside = 0; PyArrayObject *__pyx_v_pix = 0; PyObject *__pyx_v_nest = 0; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; PyObject *__pyx_r = 0; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("pix2ring (wrapper)", 0); { static PyObject **__pyx_pyargnames[] = {&__pyx_n_s_nside,&__pyx_n_s_pix,&__pyx_n_s_nest,0}; PyObject* values[3] = {0,0,0}; values[2] = ((PyObject *)Py_False); if (unlikely(__pyx_kwds)) { Py_ssize_t kw_args; const Py_ssize_t pos_args = PyTuple_GET_SIZE(__pyx_args); switch (pos_args) { case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); case 1: values[0] = PyTuple_GET_ITEM(__pyx_args, 0); case 0: break; default: goto __pyx_L5_argtuple_error; } kw_args = PyDict_Size(__pyx_kwds); switch (pos_args) { case 0: if (likely((values[0] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nside)) != 0)) kw_args--; else goto __pyx_L5_argtuple_error; case 1: if (likely((values[1] = PyDict_GetItem(__pyx_kwds, __pyx_n_s_pix)) != 0)) kw_args--; else { __Pyx_RaiseArgtupleInvalid("pix2ring", 0, 2, 3, 1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } case 2: if (kw_args > 0) { PyObject* value = PyDict_GetItem(__pyx_kwds, __pyx_n_s_nest); if (value) { values[2] = value; kw_args--; } } } if (unlikely(kw_args > 0)) { if (unlikely(__Pyx_ParseOptionalKeywords(__pyx_kwds, __pyx_pyargnames, 0, values, pos_args, "pix2ring") < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L3_error;} } } else { switch (PyTuple_GET_SIZE(__pyx_args)) { case 3: values[2] = PyTuple_GET_ITEM(__pyx_args, 2); case 2: values[1] = PyTuple_GET_ITEM(__pyx_args, 1); values[0] = PyTuple_GET_ITEM(__pyx_args, 0); break; default: goto __pyx_L5_argtuple_error; } } __pyx_v_nside = values[0]; __pyx_v_pix = ((PyArrayObject *)values[1]); __pyx_v_nest = values[2]; } goto __pyx_L4_argument_unpacking_done; __pyx_L5_argtuple_error:; __Pyx_RaiseArgtupleInvalid("pix2ring", 0, 2, 3, PyTuple_GET_SIZE(__pyx_args)); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L3_error;} __pyx_L3_error:; __Pyx_AddTraceback("healpy._pixelfunc.pix2ring", __pyx_clineno, __pyx_lineno, __pyx_filename); __Pyx_RefNannyFinishContext(); return NULL; __pyx_L4_argument_unpacking_done:; if (unlikely(!__Pyx_ArgTypeTest(((PyObject *)__pyx_v_pix), __pyx_ptype_5numpy_ndarray, 0, "pix", 0))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_r = __pyx_pf_6healpy_10_pixelfunc_2pix2ring(__pyx_self, __pyx_v_nside, __pyx_v_pix, __pyx_v_nest); /* function exit code */ goto __pyx_L0; __pyx_L1_error:; __pyx_r = NULL; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyObject *__pyx_pf_6healpy_10_pixelfunc_2pix2ring(CYTHON_UNUSED PyObject *__pyx_self, PyObject *__pyx_v_nside, PyArrayObject *__pyx_v_pix, PyObject *__pyx_v_nest) { enum Healpix_Ordering_Scheme __pyx_v_scheme; T_Healpix_Base __pyx_v_hb; npy_intp __pyx_v_num; PyArrayObject *__pyx_v_ring = 0; npy_intp __pyx_v_i; __Pyx_LocalBuf_ND __pyx_pybuffernd_pix; __Pyx_Buffer __pyx_pybuffer_pix; __Pyx_LocalBuf_ND __pyx_pybuffernd_ring; __Pyx_Buffer __pyx_pybuffer_ring; PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; int64 __pyx_t_4; PyObject *__pyx_t_5 = NULL; PyObject *__pyx_t_6 = NULL; PyObject *__pyx_t_7 = NULL; PyObject *__pyx_t_8 = NULL; PyArrayObject *__pyx_t_9 = NULL; npy_intp __pyx_t_10; npy_intp __pyx_t_11; npy_intp __pyx_t_12; npy_intp __pyx_t_13; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("pix2ring", 0); __pyx_pybuffer_ring.pybuffer.buf = NULL; __pyx_pybuffer_ring.refcount = 0; __pyx_pybuffernd_ring.data = NULL; __pyx_pybuffernd_ring.rcbuffer = &__pyx_pybuffer_ring; __pyx_pybuffer_pix.pybuffer.buf = NULL; __pyx_pybuffer_pix.refcount = 0; __pyx_pybuffernd_pix.data = NULL; __pyx_pybuffernd_pix.rcbuffer = &__pyx_pybuffer_pix; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_pix.rcbuffer->pybuffer, (PyObject*)__pyx_v_pix, &__Pyx_TypeInfo_nn_int64, PyBUF_FORMAT| PyBUF_STRIDES, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_pix.diminfo[0].strides = __pyx_pybuffernd_pix.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_pix.diminfo[0].shape = __pyx_pybuffernd_pix.rcbuffer->pybuffer.shape[0]; /* "healpy/src/_pixelfunc.pyx":88 * """ * * if not isnsideok(nside): # <<<<<<<<<<<<<< * raise ValueError('Wrong nside value, must be a power of 2') * cdef Healpix_Ordering_Scheme scheme */ __pyx_t_1 = __Pyx_PyInt_As_int(__pyx_v_nside); if (unlikely((__pyx_t_1 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 88; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_2 = ((!(__pyx_f_6healpy_10_pixelfunc_isnsideok(__pyx_t_1) != 0)) != 0); if (__pyx_t_2) { /* "healpy/src/_pixelfunc.pyx":89 * * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__2, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 89; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 89; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "healpy/src/_pixelfunc.pyx":91 * raise ValueError('Wrong nside value, must be a power of 2') * cdef Healpix_Ordering_Scheme scheme * if nest: # <<<<<<<<<<<<<< * scheme = NEST * else: */ __pyx_t_2 = __Pyx_PyObject_IsTrue(__pyx_v_nest); if (unlikely(__pyx_t_2 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 91; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (__pyx_t_2) { /* "healpy/src/_pixelfunc.pyx":92 * cdef Healpix_Ordering_Scheme scheme * if nest: * scheme = NEST # <<<<<<<<<<<<<< * else: * scheme = RING */ __pyx_v_scheme = NEST; goto __pyx_L4; } /*else*/ { /* "healpy/src/_pixelfunc.pyx":94 * scheme = NEST * else: * scheme = RING # <<<<<<<<<<<<<< * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * num = pix.shape[0] */ __pyx_v_scheme = RING; } __pyx_L4:; /* "healpy/src/_pixelfunc.pyx":95 * else: * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) # <<<<<<<<<<<<<< * num = pix.shape[0] * cdef np.ndarray[int64, ndim=1] ring = np.empty(num, dtype=np.int64) */ __pyx_t_4 = __Pyx_PyInt_As_int64(__pyx_v_nside); if (unlikely((__pyx_t_4 == (int64)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 95; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_hb = T_Healpix_Base(__pyx_t_4, __pyx_v_scheme, SET_NSIDE); /* "healpy/src/_pixelfunc.pyx":96 * scheme = RING * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * num = pix.shape[0] # <<<<<<<<<<<<<< * cdef np.ndarray[int64, ndim=1] ring = np.empty(num, dtype=np.int64) * for i in range(num): */ __pyx_v_num = (__pyx_v_pix->dimensions[0]); /* "healpy/src/_pixelfunc.pyx":97 * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) * num = pix.shape[0] * cdef np.ndarray[int64, ndim=1] ring = np.empty(num, dtype=np.int64) # <<<<<<<<<<<<<< * for i in range(num): * ring[i] = hb.pix2ring(pix[i]) */ __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_empty); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyInt_From_Py_intptr_t(__pyx_v_num); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_6 = PyTuple_New(1); if (unlikely(!__pyx_t_6)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_6); PyTuple_SET_ITEM(__pyx_t_6, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyDict_New(); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_7 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_7)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_7); __pyx_t_8 = __Pyx_PyObject_GetAttrStr(__pyx_t_7, __pyx_n_s_int64); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_7); __pyx_t_7 = 0; if (PyDict_SetItem(__pyx_t_3, __pyx_n_s_dtype, __pyx_t_8) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_t_5, __pyx_t_6, __pyx_t_3); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __Pyx_DECREF(__pyx_t_6); __pyx_t_6 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (!(likely(((__pyx_t_8) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_8, __pyx_ptype_5numpy_ndarray))))) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_t_9 = ((PyArrayObject *)__pyx_t_8); { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_ring.rcbuffer->pybuffer, (PyObject*)__pyx_t_9, &__Pyx_TypeInfo_nn_int64, PyBUF_FORMAT| PyBUF_STRIDES| PyBUF_WRITABLE, 1, 0, __pyx_stack) == -1)) { __pyx_v_ring = ((PyArrayObject *)Py_None); __Pyx_INCREF(Py_None); __pyx_pybuffernd_ring.rcbuffer->pybuffer.buf = NULL; {__pyx_filename = __pyx_f[0]; __pyx_lineno = 97; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } else {__pyx_pybuffernd_ring.diminfo[0].strides = __pyx_pybuffernd_ring.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_ring.diminfo[0].shape = __pyx_pybuffernd_ring.rcbuffer->pybuffer.shape[0]; } } __pyx_t_9 = 0; __pyx_v_ring = ((PyArrayObject *)__pyx_t_8); __pyx_t_8 = 0; /* "healpy/src/_pixelfunc.pyx":98 * num = pix.shape[0] * cdef np.ndarray[int64, ndim=1] ring = np.empty(num, dtype=np.int64) * for i in range(num): # <<<<<<<<<<<<<< * ring[i] = hb.pix2ring(pix[i]) * return ring */ __pyx_t_10 = __pyx_v_num; for (__pyx_t_11 = 0; __pyx_t_11 < __pyx_t_10; __pyx_t_11+=1) { __pyx_v_i = __pyx_t_11; /* "healpy/src/_pixelfunc.pyx":99 * cdef np.ndarray[int64, ndim=1] ring = np.empty(num, dtype=np.int64) * for i in range(num): * ring[i] = hb.pix2ring(pix[i]) # <<<<<<<<<<<<<< * return ring * */ __pyx_t_12 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_12 < 0) { __pyx_t_12 += __pyx_pybuffernd_pix.diminfo[0].shape; if (unlikely(__pyx_t_12 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_12 >= __pyx_pybuffernd_pix.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 99; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_13 = __pyx_v_i; __pyx_t_1 = -1; if (__pyx_t_13 < 0) { __pyx_t_13 += __pyx_pybuffernd_ring.diminfo[0].shape; if (unlikely(__pyx_t_13 < 0)) __pyx_t_1 = 0; } else if (unlikely(__pyx_t_13 >= __pyx_pybuffernd_ring.diminfo[0].shape)) __pyx_t_1 = 0; if (unlikely(__pyx_t_1 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_1); {__pyx_filename = __pyx_f[0]; __pyx_lineno = 99; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } *__Pyx_BufPtrStrided1d(int64 *, __pyx_pybuffernd_ring.rcbuffer->pybuffer.buf, __pyx_t_13, __pyx_pybuffernd_ring.diminfo[0].strides) = __pyx_v_hb.pix2ring((*__Pyx_BufPtrStrided1d(int64 *, __pyx_pybuffernd_pix.rcbuffer->pybuffer.buf, __pyx_t_12, __pyx_pybuffernd_pix.diminfo[0].strides))); } /* "healpy/src/_pixelfunc.pyx":100 * for i in range(num): * ring[i] = hb.pix2ring(pix[i]) * return ring # <<<<<<<<<<<<<< * * */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_ring)); __pyx_r = ((PyObject *)__pyx_v_ring); goto __pyx_L0; /* "healpy/src/_pixelfunc.pyx":58 * return startpix, ringpix, costheta, sintheta, shifted * * def pix2ring(nside, np.ndarray[int64, ndim=1] pix not None, nest=False): # <<<<<<<<<<<<<< * """Convert pixel identifier to ring number * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_5); __Pyx_XDECREF(__pyx_t_6); __Pyx_XDECREF(__pyx_t_7); __Pyx_XDECREF(__pyx_t_8); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_pix.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ring.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("healpy._pixelfunc.pix2ring", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_pix.rcbuffer->pybuffer); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_ring.rcbuffer->pybuffer); __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_ring); __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "healpy/src/_pixelfunc.pyx":103 * * * cdef bool isnsideok(int nside): # <<<<<<<<<<<<<< * if nside < 0 or nside != 2**int(round(np.log2(nside))): * return False */ static bool __pyx_f_6healpy_10_pixelfunc_isnsideok(int __pyx_v_nside) { bool __pyx_r; __Pyx_RefNannyDeclarations int __pyx_t_1; PyObject *__pyx_t_2 = NULL; PyObject *__pyx_t_3 = NULL; PyObject *__pyx_t_4 = NULL; PyObject *__pyx_t_5 = NULL; int __pyx_t_6; int __pyx_t_7; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("isnsideok", 0); /* "healpy/src/_pixelfunc.pyx":104 * * cdef bool isnsideok(int nside): * if nside < 0 or nside != 2**int(round(np.log2(nside))): # <<<<<<<<<<<<<< * return False * else: */ __pyx_t_1 = (__pyx_v_nside < 0); if (!__pyx_t_1) { __pyx_t_2 = __Pyx_PyInt_From_int(__pyx_v_nside); if (unlikely(!__pyx_t_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_2); __pyx_t_3 = __Pyx_GetModuleGlobalName(__pyx_n_s_np); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyObject_GetAttrStr(__pyx_t_3, __pyx_n_s_log2); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyInt_From_int(__pyx_v_nside); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_t_4, __pyx_t_5, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyTuple_New(1); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); PyTuple_SET_ITEM(__pyx_t_5, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_round, __pyx_t_5, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyNumber_Int(__pyx_t_3); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_5); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = PyNumber_Power(__pyx_int_2, __pyx_t_5, Py_None); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_5 = PyObject_RichCompare(__pyx_t_2, __pyx_t_3, Py_NE); __Pyx_XGOTREF(__pyx_t_5); if (unlikely(!__pyx_t_5)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_2); __pyx_t_2 = 0; __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_5); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_5); __pyx_t_5 = 0; __pyx_t_7 = __pyx_t_6; } else { __pyx_t_7 = __pyx_t_1; } if (__pyx_t_7) { /* "healpy/src/_pixelfunc.pyx":105 * cdef bool isnsideok(int nside): * if nside < 0 or nside != 2**int(round(np.log2(nside))): * return False # <<<<<<<<<<<<<< * else: * return True */ __pyx_r = 0; goto __pyx_L0; } /*else*/ { /* "healpy/src/_pixelfunc.pyx":107 * return False * else: * return True # <<<<<<<<<<<<<< * * */ __pyx_r = 1; goto __pyx_L0; } /* "healpy/src/_pixelfunc.pyx":103 * * * cdef bool isnsideok(int nside): # <<<<<<<<<<<<<< * if nside < 0 or nside != 2**int(round(np.log2(nside))): * return False */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_2); __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_5); __Pyx_WriteUnraisable("healpy._pixelfunc.isnsideok", __pyx_clineno, __pyx_lineno, __pyx_filename, 0); __pyx_r = 0; __pyx_L0:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "_common.pxd":123 * tsize Num_Alms (int l, int m) * * cdef inline Healpix_Map[double]* ndarray2map(np.ndarray[np.float64_t, ndim=1, mode='c'] array, Healpix_Ordering_Scheme scheme) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as a Healpix Map. """ * # To ensure that the output map is a view of the input array, the latter */ static CYTHON_INLINE Healpix_Map *__pyx_f_7_common_ndarray2map(PyArrayObject *__pyx_v_array, enum Healpix_Ordering_Scheme __pyx_v_scheme) { arr *__pyx_v_a; Healpix_Map *__pyx_v_map; __Pyx_LocalBuf_ND __pyx_pybuffernd_array; __Pyx_Buffer __pyx_pybuffer_array; Healpix_Map *__pyx_r; __Pyx_RefNannyDeclarations long __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; size_t __pyx_t_4; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("ndarray2map", 0); __pyx_pybuffer_array.pybuffer.buf = NULL; __pyx_pybuffer_array.refcount = 0; __pyx_pybuffernd_array.data = NULL; __pyx_pybuffernd_array.rcbuffer = &__pyx_pybuffer_array; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_array.rcbuffer->pybuffer, (PyObject*)__pyx_v_array, &__Pyx_TypeInfo_nn___pyx_t_5numpy_float64_t, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 123; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_array.diminfo[0].strides = __pyx_pybuffernd_array.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_array.diminfo[0].shape = __pyx_pybuffernd_array.rcbuffer->pybuffer.shape[0]; /* "_common.pxd":128 * # is forced to be contiguous, of correct type and dimensions (otherwise, an * # exception is raised). * cdef arr[double] *a = new arr[double](&array[0], array.size) # <<<<<<<<<<<<<< * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) */ __pyx_t_1 = 0; __pyx_t_2 = -1; if (__pyx_t_1 < 0) { __pyx_t_1 += __pyx_pybuffernd_array.diminfo[0].shape; if (unlikely(__pyx_t_1 < 0)) __pyx_t_2 = 0; } else if (unlikely(__pyx_t_1 >= __pyx_pybuffernd_array.diminfo[0].shape)) __pyx_t_2 = 0; if (unlikely(__pyx_t_2 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_2); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_array), __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_size_t(__pyx_t_3); if (unlikely((__pyx_t_4 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 128; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_a = new arr((&(*__Pyx_BufPtrCContig1d(__pyx_t_5numpy_float64_t *, __pyx_pybuffernd_array.rcbuffer->pybuffer.buf, __pyx_t_1, __pyx_pybuffernd_array.diminfo[0].strides))), __pyx_t_4); /* "_common.pxd":129 * # exception is raised). * cdef arr[double] *a = new arr[double](&array[0], array.size) * cdef Healpix_Map[double] *map = new Healpix_Map[double]() # <<<<<<<<<<<<<< * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated */ __pyx_v_map = new Healpix_Map(); /* "_common.pxd":130 * cdef arr[double] *a = new arr[double](&array[0], array.size) * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) # <<<<<<<<<<<<<< * del a # a does not own its buffer, so it won't be deallocated * return map */ __pyx_v_map->Set((__pyx_v_a[0]), __pyx_v_scheme); /* "_common.pxd":131 * cdef Healpix_Map[double] *map = new Healpix_Map[double]() * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated # <<<<<<<<<<<<<< * return map * */ delete __pyx_v_a; /* "_common.pxd":132 * map.Set(a[0], scheme) * del a # a does not own its buffer, so it won't be deallocated * return map # <<<<<<<<<<<<<< * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: */ __pyx_r = __pyx_v_map; goto __pyx_L0; /* "_common.pxd":123 * tsize Num_Alms (int l, int m) * * cdef inline Healpix_Map[double]* ndarray2map(np.ndarray[np.float64_t, ndim=1, mode='c'] array, Healpix_Ordering_Scheme scheme) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as a Healpix Map. """ * # To ensure that the output map is a view of the input array, the latter */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("_common.ndarray2map", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __pyx_L2:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "_common.pxd":134 * return map * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) */ static CYTHON_INLINE Alm > *__pyx_f_7_common_ndarray2alm(PyArrayObject *__pyx_v_array, int __pyx_v_lmax, int __pyx_v_mmax) { arr > *__pyx_v_a; Alm > *__pyx_v_alm; __Pyx_LocalBuf_ND __pyx_pybuffernd_array; __Pyx_Buffer __pyx_pybuffer_array; Alm > *__pyx_r; __Pyx_RefNannyDeclarations long __pyx_t_1; int __pyx_t_2; PyObject *__pyx_t_3 = NULL; size_t __pyx_t_4; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("ndarray2alm", 0); __pyx_pybuffer_array.pybuffer.buf = NULL; __pyx_pybuffer_array.refcount = 0; __pyx_pybuffernd_array.data = NULL; __pyx_pybuffernd_array.rcbuffer = &__pyx_pybuffer_array; { __Pyx_BufFmt_StackElem __pyx_stack[1]; if (unlikely(__Pyx_GetBufferAndValidate(&__pyx_pybuffernd_array.rcbuffer->pybuffer, (PyObject*)__pyx_v_array, &__Pyx_TypeInfo___pyx_t_double_complex, PyBUF_FORMAT| PyBUF_C_CONTIGUOUS, 1, 0, __pyx_stack) == -1)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 134; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_pybuffernd_array.diminfo[0].strides = __pyx_pybuffernd_array.rcbuffer->pybuffer.strides[0]; __pyx_pybuffernd_array.diminfo[0].shape = __pyx_pybuffernd_array.rcbuffer->pybuffer.shape[0]; /* "_common.pxd":136 * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) # <<<<<<<<<<<<<< * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) */ __pyx_t_1 = 0; __pyx_t_2 = -1; if (__pyx_t_1 < 0) { __pyx_t_1 += __pyx_pybuffernd_array.diminfo[0].shape; if (unlikely(__pyx_t_1 < 0)) __pyx_t_2 = 0; } else if (unlikely(__pyx_t_1 >= __pyx_pybuffernd_array.diminfo[0].shape)) __pyx_t_2 = 0; if (unlikely(__pyx_t_2 != -1)) { __Pyx_RaiseBufferIndexError(__pyx_t_2); {__pyx_filename = __pyx_f[1]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_3 = __Pyx_PyObject_GetAttrStr(((PyObject *)__pyx_v_array), __pyx_n_s_size); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = __Pyx_PyInt_As_size_t(__pyx_t_3); if (unlikely((__pyx_t_4 == (size_t)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[1]; __pyx_lineno = 136; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_v_a = new arr >(((xcomplex *)(&(*__Pyx_BufPtrCContig1d(__pyx_t_double_complex *, __pyx_pybuffernd_array.rcbuffer->pybuffer.buf, __pyx_t_1, __pyx_pybuffernd_array.diminfo[0].strides)))), __pyx_t_4); /* "_common.pxd":137 * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() # <<<<<<<<<<<<<< * alm.Set(a[0], lmax, mmax) * del a */ __pyx_v_alm = new Alm >(); /* "_common.pxd":138 * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) # <<<<<<<<<<<<<< * del a * return alm */ __pyx_v_alm->Set((__pyx_v_a[0]), __pyx_v_lmax, __pyx_v_mmax); /* "_common.pxd":139 * cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() * alm.Set(a[0], lmax, mmax) * del a # <<<<<<<<<<<<<< * return alm */ delete __pyx_v_a; /* "_common.pxd":140 * alm.Set(a[0], lmax, mmax) * del a * return alm # <<<<<<<<<<<<<< */ __pyx_r = __pyx_v_alm; goto __pyx_L0; /* "_common.pxd":134 * return map * * cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: # <<<<<<<<<<<<<< * """ View a contiguous ndarray as an Alm. """ * cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_3); { PyObject *__pyx_type, *__pyx_value, *__pyx_tb; __Pyx_ErrFetch(&__pyx_type, &__pyx_value, &__pyx_tb); __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __Pyx_ErrRestore(__pyx_type, __pyx_value, __pyx_tb);} __Pyx_AddTraceback("_common.ndarray2alm", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; goto __pyx_L2; __pyx_L0:; __Pyx_SafeReleaseBuffer(&__pyx_pybuffernd_array.rcbuffer->pybuffer); __pyx_L2:; __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":194 * # experimental exception made for __getbuffer__ and __releasebuffer__ * # -- the details of this may change. * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<< * # This implementation of getbuffer is geared towards Cython * # requirements, and does not yet fullfill the PEP. */ /* Python wrapper */ static CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags); /*proto*/ static CYTHON_UNUSED int __pyx_pw_5numpy_7ndarray_1__getbuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) { int __pyx_r; __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__getbuffer__ (wrapper)", 0); __pyx_r = __pyx_pf_5numpy_7ndarray___getbuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info), ((int)__pyx_v_flags)); /* function exit code */ __Pyx_RefNannyFinishContext(); return __pyx_r; } static int __pyx_pf_5numpy_7ndarray___getbuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info, int __pyx_v_flags) { int __pyx_v_copy_shape; int __pyx_v_i; int __pyx_v_ndim; int __pyx_v_endian_detector; int __pyx_v_little_endian; int __pyx_v_t; char *__pyx_v_f; PyArray_Descr *__pyx_v_descr = 0; int __pyx_v_offset; int __pyx_v_hasfields; int __pyx_r; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; int __pyx_t_3; PyObject *__pyx_t_4 = NULL; int __pyx_t_5; int __pyx_t_6; int __pyx_t_7; PyObject *__pyx_t_8 = NULL; char *__pyx_t_9; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("__getbuffer__", 0); if (__pyx_v_info != NULL) { __pyx_v_info->obj = Py_None; __Pyx_INCREF(Py_None); __Pyx_GIVEREF(__pyx_v_info->obj); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":200 * # of flags * * if info == NULL: return # <<<<<<<<<<<<<< * * cdef int copy_shape, i, ndim */ __pyx_t_1 = ((__pyx_v_info == NULL) != 0); if (__pyx_t_1) { __pyx_r = 0; goto __pyx_L0; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":203 * * cdef int copy_shape, i, ndim * cdef int endian_detector = 1 # <<<<<<<<<<<<<< * cdef bint little_endian = ((&endian_detector)[0] != 0) * */ __pyx_v_endian_detector = 1; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":204 * cdef int copy_shape, i, ndim * cdef int endian_detector = 1 * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<< * * ndim = PyArray_NDIM(self) */ __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":206 * cdef bint little_endian = ((&endian_detector)[0] != 0) * * ndim = PyArray_NDIM(self) # <<<<<<<<<<<<<< * * if sizeof(npy_intp) != sizeof(Py_ssize_t): */ __pyx_v_ndim = PyArray_NDIM(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":208 * ndim = PyArray_NDIM(self) * * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<< * copy_shape = 1 * else: */ __pyx_t_1 = (((sizeof(npy_intp)) != (sizeof(Py_ssize_t))) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":209 * * if sizeof(npy_intp) != sizeof(Py_ssize_t): * copy_shape = 1 # <<<<<<<<<<<<<< * else: * copy_shape = 0 */ __pyx_v_copy_shape = 1; goto __pyx_L4; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":211 * copy_shape = 1 * else: * copy_shape = 0 # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) */ __pyx_v_copy_shape = 0; } __pyx_L4:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":213 * copy_shape = 0 * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) # <<<<<<<<<<<<<< * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") */ __pyx_t_1 = (((__pyx_v_flags & PyBUF_C_CONTIGUOUS) == PyBUF_C_CONTIGUOUS) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":214 * * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): # <<<<<<<<<<<<<< * raise ValueError(u"ndarray is not C contiguous") * */ __pyx_t_2 = ((!(PyArray_CHKFLAGS(__pyx_v_self, NPY_C_CONTIGUOUS) != 0)) != 0); __pyx_t_3 = __pyx_t_2; } else { __pyx_t_3 = __pyx_t_1; } if (__pyx_t_3) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":215 * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__3, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":217 * raise ValueError(u"ndarray is not C contiguous") * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) # <<<<<<<<<<<<<< * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") */ __pyx_t_3 = (((__pyx_v_flags & PyBUF_F_CONTIGUOUS) == PyBUF_F_CONTIGUOUS) != 0); if (__pyx_t_3) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":218 * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): # <<<<<<<<<<<<<< * raise ValueError(u"ndarray is not Fortran contiguous") * */ __pyx_t_1 = ((!(PyArray_CHKFLAGS(__pyx_v_self, NPY_F_CONTIGUOUS) != 0)) != 0); __pyx_t_2 = __pyx_t_1; } else { __pyx_t_2 = __pyx_t_3; } if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":219 * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") # <<<<<<<<<<<<<< * * info.buf = PyArray_DATA(self) */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__4, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":221 * raise ValueError(u"ndarray is not Fortran contiguous") * * info.buf = PyArray_DATA(self) # <<<<<<<<<<<<<< * info.ndim = ndim * if copy_shape: */ __pyx_v_info->buf = PyArray_DATA(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":222 * * info.buf = PyArray_DATA(self) * info.ndim = ndim # <<<<<<<<<<<<<< * if copy_shape: * # Allocate new buffer for strides and shape info. */ __pyx_v_info->ndim = __pyx_v_ndim; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":223 * info.buf = PyArray_DATA(self) * info.ndim = ndim * if copy_shape: # <<<<<<<<<<<<<< * # Allocate new buffer for strides and shape info. * # This is allocated as one block, strides first. */ __pyx_t_2 = (__pyx_v_copy_shape != 0); if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":226 * # Allocate new buffer for strides and shape info. * # This is allocated as one block, strides first. * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) # <<<<<<<<<<<<<< * info.shape = info.strides + ndim * for i in range(ndim): */ __pyx_v_info->strides = ((Py_ssize_t *)malloc((((sizeof(Py_ssize_t)) * ((size_t)__pyx_v_ndim)) * 2))); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":227 * # This is allocated as one block, strides first. * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) * info.shape = info.strides + ndim # <<<<<<<<<<<<<< * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] */ __pyx_v_info->shape = (__pyx_v_info->strides + __pyx_v_ndim); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":228 * info.strides = stdlib.malloc(sizeof(Py_ssize_t) * ndim * 2) * info.shape = info.strides + ndim * for i in range(ndim): # <<<<<<<<<<<<<< * info.strides[i] = PyArray_STRIDES(self)[i] * info.shape[i] = PyArray_DIMS(self)[i] */ __pyx_t_5 = __pyx_v_ndim; for (__pyx_t_6 = 0; __pyx_t_6 < __pyx_t_5; __pyx_t_6+=1) { __pyx_v_i = __pyx_t_6; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":229 * info.shape = info.strides + ndim * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] # <<<<<<<<<<<<<< * info.shape[i] = PyArray_DIMS(self)[i] * else: */ (__pyx_v_info->strides[__pyx_v_i]) = (PyArray_STRIDES(__pyx_v_self)[__pyx_v_i]); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":230 * for i in range(ndim): * info.strides[i] = PyArray_STRIDES(self)[i] * info.shape[i] = PyArray_DIMS(self)[i] # <<<<<<<<<<<<<< * else: * info.strides = PyArray_STRIDES(self) */ (__pyx_v_info->shape[__pyx_v_i]) = (PyArray_DIMS(__pyx_v_self)[__pyx_v_i]); } goto __pyx_L7; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":232 * info.shape[i] = PyArray_DIMS(self)[i] * else: * info.strides = PyArray_STRIDES(self) # <<<<<<<<<<<<<< * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL */ __pyx_v_info->strides = ((Py_ssize_t *)PyArray_STRIDES(__pyx_v_self)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":233 * else: * info.strides = PyArray_STRIDES(self) * info.shape = PyArray_DIMS(self) # <<<<<<<<<<<<<< * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) */ __pyx_v_info->shape = ((Py_ssize_t *)PyArray_DIMS(__pyx_v_self)); } __pyx_L7:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":234 * info.strides = PyArray_STRIDES(self) * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL # <<<<<<<<<<<<<< * info.itemsize = PyArray_ITEMSIZE(self) * info.readonly = not PyArray_ISWRITEABLE(self) */ __pyx_v_info->suboffsets = NULL; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":235 * info.shape = PyArray_DIMS(self) * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) # <<<<<<<<<<<<<< * info.readonly = not PyArray_ISWRITEABLE(self) * */ __pyx_v_info->itemsize = PyArray_ITEMSIZE(__pyx_v_self); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":236 * info.suboffsets = NULL * info.itemsize = PyArray_ITEMSIZE(self) * info.readonly = not PyArray_ISWRITEABLE(self) # <<<<<<<<<<<<<< * * cdef int t */ __pyx_v_info->readonly = (!(PyArray_ISWRITEABLE(__pyx_v_self) != 0)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":239 * * cdef int t * cdef char* f = NULL # <<<<<<<<<<<<<< * cdef dtype descr = self.descr * cdef list stack */ __pyx_v_f = NULL; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":240 * cdef int t * cdef char* f = NULL * cdef dtype descr = self.descr # <<<<<<<<<<<<<< * cdef list stack * cdef int offset */ __pyx_t_4 = ((PyObject *)__pyx_v_self->descr); __Pyx_INCREF(__pyx_t_4); __pyx_v_descr = ((PyArray_Descr *)__pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":244 * cdef int offset * * cdef bint hasfields = PyDataType_HASFIELDS(descr) # <<<<<<<<<<<<<< * * if not hasfields and not copy_shape: */ __pyx_v_hasfields = PyDataType_HASFIELDS(__pyx_v_descr); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":246 * cdef bint hasfields = PyDataType_HASFIELDS(descr) * * if not hasfields and not copy_shape: # <<<<<<<<<<<<<< * # do not call releasebuffer * info.obj = None */ __pyx_t_2 = ((!(__pyx_v_hasfields != 0)) != 0); if (__pyx_t_2) { __pyx_t_3 = ((!(__pyx_v_copy_shape != 0)) != 0); __pyx_t_1 = __pyx_t_3; } else { __pyx_t_1 = __pyx_t_2; } if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":248 * if not hasfields and not copy_shape: * # do not call releasebuffer * info.obj = None # <<<<<<<<<<<<<< * else: * # need to call releasebuffer */ __Pyx_INCREF(Py_None); __Pyx_GIVEREF(Py_None); __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = Py_None; goto __pyx_L10; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":251 * else: * # need to call releasebuffer * info.obj = self # <<<<<<<<<<<<<< * * if not hasfields: */ __Pyx_INCREF(((PyObject *)__pyx_v_self)); __Pyx_GIVEREF(((PyObject *)__pyx_v_self)); __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = ((PyObject *)__pyx_v_self); } __pyx_L10:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":253 * info.obj = self * * if not hasfields: # <<<<<<<<<<<<<< * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or */ __pyx_t_1 = ((!(__pyx_v_hasfields != 0)) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":254 * * if not hasfields: * t = descr.type_num # <<<<<<<<<<<<<< * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): */ __pyx_t_5 = __pyx_v_descr->type_num; __pyx_v_t = __pyx_t_5; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":255 * if not hasfields: * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<< * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") */ __pyx_t_1 = ((__pyx_v_descr->byteorder == '>') != 0); if (__pyx_t_1) { __pyx_t_2 = (__pyx_v_little_endian != 0); } else { __pyx_t_2 = __pyx_t_1; } if (!__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":256 * t = descr.type_num * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<< * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" */ __pyx_t_1 = ((__pyx_v_descr->byteorder == '<') != 0); if (__pyx_t_1) { __pyx_t_3 = ((!(__pyx_v_little_endian != 0)) != 0); __pyx_t_7 = __pyx_t_3; } else { __pyx_t_7 = __pyx_t_1; } __pyx_t_1 = __pyx_t_7; } else { __pyx_t_1 = __pyx_t_2; } if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":257 * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__5, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":274 * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ switch (__pyx_v_t) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":258 * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" # <<<<<<<<<<<<<< * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" */ case NPY_BYTE: __pyx_v_f = __pyx_k_b; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":259 * raise ValueError(u"Non-native byte order not supported") * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" # <<<<<<<<<<<<<< * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" */ case NPY_UBYTE: __pyx_v_f = __pyx_k_B; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":260 * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" # <<<<<<<<<<<<<< * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" */ case NPY_SHORT: __pyx_v_f = __pyx_k_h; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":261 * elif t == NPY_UBYTE: f = "B" * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" # <<<<<<<<<<<<<< * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" */ case NPY_USHORT: __pyx_v_f = __pyx_k_H; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":262 * elif t == NPY_SHORT: f = "h" * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" # <<<<<<<<<<<<<< * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" */ case NPY_INT: __pyx_v_f = __pyx_k_i; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":263 * elif t == NPY_USHORT: f = "H" * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" # <<<<<<<<<<<<<< * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" */ case NPY_UINT: __pyx_v_f = __pyx_k_I; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":264 * elif t == NPY_INT: f = "i" * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" # <<<<<<<<<<<<<< * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" */ case NPY_LONG: __pyx_v_f = __pyx_k_l; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":265 * elif t == NPY_UINT: f = "I" * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" # <<<<<<<<<<<<<< * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" */ case NPY_ULONG: __pyx_v_f = __pyx_k_L; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":266 * elif t == NPY_LONG: f = "l" * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" # <<<<<<<<<<<<<< * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" */ case NPY_LONGLONG: __pyx_v_f = __pyx_k_q; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":267 * elif t == NPY_ULONG: f = "L" * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" # <<<<<<<<<<<<<< * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" */ case NPY_ULONGLONG: __pyx_v_f = __pyx_k_Q; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":268 * elif t == NPY_LONGLONG: f = "q" * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" # <<<<<<<<<<<<<< * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" */ case NPY_FLOAT: __pyx_v_f = __pyx_k_f; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":269 * elif t == NPY_ULONGLONG: f = "Q" * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" # <<<<<<<<<<<<<< * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" */ case NPY_DOUBLE: __pyx_v_f = __pyx_k_d; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":270 * elif t == NPY_FLOAT: f = "f" * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" # <<<<<<<<<<<<<< * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" */ case NPY_LONGDOUBLE: __pyx_v_f = __pyx_k_g; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":271 * elif t == NPY_DOUBLE: f = "d" * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" # <<<<<<<<<<<<<< * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" */ case NPY_CFLOAT: __pyx_v_f = __pyx_k_Zf; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":272 * elif t == NPY_LONGDOUBLE: f = "g" * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" # <<<<<<<<<<<<<< * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" */ case NPY_CDOUBLE: __pyx_v_f = __pyx_k_Zd; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":273 * elif t == NPY_CFLOAT: f = "Zf" * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" # <<<<<<<<<<<<<< * elif t == NPY_OBJECT: f = "O" * else: */ case NPY_CLONGDOUBLE: __pyx_v_f = __pyx_k_Zg; break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":274 * elif t == NPY_CDOUBLE: f = "Zd" * elif t == NPY_CLONGDOUBLE: f = "Zg" * elif t == NPY_OBJECT: f = "O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ case NPY_OBJECT: __pyx_v_f = __pyx_k_O; break; default: /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":276 * elif t == NPY_OBJECT: f = "O" * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) # <<<<<<<<<<<<<< * info.format = f * return */ __pyx_t_4 = __Pyx_PyInt_From_int(__pyx_v_t); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_8 = PyUnicode_Format(__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_t_4); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_8); __Pyx_GIVEREF(__pyx_t_8); __pyx_t_8 = 0; __pyx_t_8 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_4, NULL); if (unlikely(!__pyx_t_8)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_8); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_Raise(__pyx_t_8, 0, 0, 0); __Pyx_DECREF(__pyx_t_8); __pyx_t_8 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 276; __pyx_clineno = __LINE__; goto __pyx_L1_error;} break; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":277 * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * info.format = f # <<<<<<<<<<<<<< * return * else: */ __pyx_v_info->format = __pyx_v_f; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":278 * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * info.format = f * return # <<<<<<<<<<<<<< * else: * info.format = stdlib.malloc(_buffer_format_string_len) */ __pyx_r = 0; goto __pyx_L0; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":280 * return * else: * info.format = stdlib.malloc(_buffer_format_string_len) # <<<<<<<<<<<<<< * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 */ __pyx_v_info->format = ((char *)malloc(255)); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":281 * else: * info.format = stdlib.malloc(_buffer_format_string_len) * info.format[0] = c'^' # Native data types, manual alignment # <<<<<<<<<<<<<< * offset = 0 * f = _util_dtypestring(descr, info.format + 1, */ (__pyx_v_info->format[0]) = '^'; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":282 * info.format = stdlib.malloc(_buffer_format_string_len) * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 # <<<<<<<<<<<<<< * f = _util_dtypestring(descr, info.format + 1, * info.format + _buffer_format_string_len, */ __pyx_v_offset = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":283 * info.format[0] = c'^' # Native data types, manual alignment * offset = 0 * f = _util_dtypestring(descr, info.format + 1, # <<<<<<<<<<<<<< * info.format + _buffer_format_string_len, * &offset) */ __pyx_t_9 = __pyx_f_5numpy__util_dtypestring(__pyx_v_descr, (__pyx_v_info->format + 1), (__pyx_v_info->format + 255), (&__pyx_v_offset)); if (unlikely(__pyx_t_9 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 283; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_f = __pyx_t_9; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":286 * info.format + _buffer_format_string_len, * &offset) * f[0] = c'\0' # Terminate format string # <<<<<<<<<<<<<< * * def __releasebuffer__(ndarray self, Py_buffer* info): */ (__pyx_v_f[0]) = '\x00'; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":194 * # experimental exception made for __getbuffer__ and __releasebuffer__ * # -- the details of this may change. * def __getbuffer__(ndarray self, Py_buffer* info, int flags): # <<<<<<<<<<<<<< * # This implementation of getbuffer is geared towards Cython * # requirements, and does not yet fullfill the PEP. */ /* function exit code */ __pyx_r = 0; goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_4); __Pyx_XDECREF(__pyx_t_8); __Pyx_AddTraceback("numpy.ndarray.__getbuffer__", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = -1; if (__pyx_v_info != NULL && __pyx_v_info->obj != NULL) { __Pyx_GOTREF(__pyx_v_info->obj); __Pyx_DECREF(__pyx_v_info->obj); __pyx_v_info->obj = NULL; } goto __pyx_L2; __pyx_L0:; if (__pyx_v_info != NULL && __pyx_v_info->obj == Py_None) { __Pyx_GOTREF(Py_None); __Pyx_DECREF(Py_None); __pyx_v_info->obj = NULL; } __pyx_L2:; __Pyx_XDECREF((PyObject *)__pyx_v_descr); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":288 * f[0] = c'\0' # Terminate format string * * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<< * if PyArray_HASFIELDS(self): * stdlib.free(info.format) */ /* Python wrapper */ static CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info); /*proto*/ static CYTHON_UNUSED void __pyx_pw_5numpy_7ndarray_3__releasebuffer__(PyObject *__pyx_v_self, Py_buffer *__pyx_v_info) { __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__releasebuffer__ (wrapper)", 0); __pyx_pf_5numpy_7ndarray_2__releasebuffer__(((PyArrayObject *)__pyx_v_self), ((Py_buffer *)__pyx_v_info)); /* function exit code */ __Pyx_RefNannyFinishContext(); } static void __pyx_pf_5numpy_7ndarray_2__releasebuffer__(PyArrayObject *__pyx_v_self, Py_buffer *__pyx_v_info) { __Pyx_RefNannyDeclarations int __pyx_t_1; __Pyx_RefNannySetupContext("__releasebuffer__", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":289 * * def __releasebuffer__(ndarray self, Py_buffer* info): * if PyArray_HASFIELDS(self): # <<<<<<<<<<<<<< * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): */ __pyx_t_1 = (PyArray_HASFIELDS(__pyx_v_self) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":290 * def __releasebuffer__(ndarray self, Py_buffer* info): * if PyArray_HASFIELDS(self): * stdlib.free(info.format) # <<<<<<<<<<<<<< * if sizeof(npy_intp) != sizeof(Py_ssize_t): * stdlib.free(info.strides) */ free(__pyx_v_info->format); goto __pyx_L3; } __pyx_L3:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":291 * if PyArray_HASFIELDS(self): * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): # <<<<<<<<<<<<<< * stdlib.free(info.strides) * # info.shape was stored after info.strides in the same block */ __pyx_t_1 = (((sizeof(npy_intp)) != (sizeof(Py_ssize_t))) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":292 * stdlib.free(info.format) * if sizeof(npy_intp) != sizeof(Py_ssize_t): * stdlib.free(info.strides) # <<<<<<<<<<<<<< * # info.shape was stored after info.strides in the same block * */ free(__pyx_v_info->strides); goto __pyx_L4; } __pyx_L4:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":288 * f[0] = c'\0' # Terminate format string * * def __releasebuffer__(ndarray self, Py_buffer* info): # <<<<<<<<<<<<<< * if PyArray_HASFIELDS(self): * stdlib.free(info.format) */ /* function exit code */ __Pyx_RefNannyFinishContext(); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":768 * ctypedef npy_cdouble complex_t * * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(1, a) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew1(PyObject *__pyx_v_a) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew1", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":769 * * cdef inline object PyArray_MultiIterNew1(a): * return PyArray_MultiIterNew(1, a) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew2(a, b): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(1, ((void *)__pyx_v_a)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 769; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":768 * ctypedef npy_cdouble complex_t * * cdef inline object PyArray_MultiIterNew1(a): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(1, a) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew1", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":771 * return PyArray_MultiIterNew(1, a) * * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(2, a, b) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew2(PyObject *__pyx_v_a, PyObject *__pyx_v_b) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew2", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":772 * * cdef inline object PyArray_MultiIterNew2(a, b): * return PyArray_MultiIterNew(2, a, b) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew3(a, b, c): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(2, ((void *)__pyx_v_a), ((void *)__pyx_v_b)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 772; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":771 * return PyArray_MultiIterNew(1, a) * * cdef inline object PyArray_MultiIterNew2(a, b): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(2, a, b) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew2", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":774 * return PyArray_MultiIterNew(2, a, b) * * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(3, a, b, c) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew3(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew3", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":775 * * cdef inline object PyArray_MultiIterNew3(a, b, c): * return PyArray_MultiIterNew(3, a, b, c) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(3, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 775; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":774 * return PyArray_MultiIterNew(2, a, b) * * cdef inline object PyArray_MultiIterNew3(a, b, c): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(3, a, b, c) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew3", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":777 * return PyArray_MultiIterNew(3, a, b, c) * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(4, a, b, c, d) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew4(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew4", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":778 * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): * return PyArray_MultiIterNew(4, a, b, c, d) # <<<<<<<<<<<<<< * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(4, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 778; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":777 * return PyArray_MultiIterNew(3, a, b, c) * * cdef inline object PyArray_MultiIterNew4(a, b, c, d): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(4, a, b, c, d) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew4", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":780 * return PyArray_MultiIterNew(4, a, b, c, d) * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(5, a, b, c, d, e) * */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_PyArray_MultiIterNew5(PyObject *__pyx_v_a, PyObject *__pyx_v_b, PyObject *__pyx_v_c, PyObject *__pyx_v_d, PyObject *__pyx_v_e) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("PyArray_MultiIterNew5", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":781 * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): * return PyArray_MultiIterNew(5, a, b, c, d, e) # <<<<<<<<<<<<<< * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: */ __Pyx_XDECREF(__pyx_r); __pyx_t_1 = PyArray_MultiIterNew(5, ((void *)__pyx_v_a), ((void *)__pyx_v_b), ((void *)__pyx_v_c), ((void *)__pyx_v_d), ((void *)__pyx_v_e)); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 781; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); __pyx_r = __pyx_t_1; __pyx_t_1 = 0; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":780 * return PyArray_MultiIterNew(4, a, b, c, d) * * cdef inline object PyArray_MultiIterNew5(a, b, c, d, e): # <<<<<<<<<<<<<< * return PyArray_MultiIterNew(5, a, b, c, d, e) * */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_AddTraceback("numpy.PyArray_MultiIterNew5", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = 0; __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":783 * return PyArray_MultiIterNew(5, a, b, c, d, e) * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<< * # Recursive utility function used in __getbuffer__ to get format * # string. The new location in the format string is returned. */ static CYTHON_INLINE char *__pyx_f_5numpy__util_dtypestring(PyArray_Descr *__pyx_v_descr, char *__pyx_v_f, char *__pyx_v_end, int *__pyx_v_offset) { PyArray_Descr *__pyx_v_child = 0; int __pyx_v_endian_detector; int __pyx_v_little_endian; PyObject *__pyx_v_fields = 0; PyObject *__pyx_v_childname = NULL; PyObject *__pyx_v_new_offset = NULL; PyObject *__pyx_v_t = NULL; char *__pyx_r; __Pyx_RefNannyDeclarations PyObject *__pyx_t_1 = NULL; Py_ssize_t __pyx_t_2; PyObject *__pyx_t_3 = NULL; PyObject *__pyx_t_4 = NULL; int __pyx_t_5; int __pyx_t_6; int __pyx_t_7; int __pyx_t_8; int __pyx_t_9; long __pyx_t_10; char *__pyx_t_11; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannySetupContext("_util_dtypestring", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":790 * cdef int delta_offset * cdef tuple i * cdef int endian_detector = 1 # <<<<<<<<<<<<<< * cdef bint little_endian = ((&endian_detector)[0] != 0) * cdef tuple fields */ __pyx_v_endian_detector = 1; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":791 * cdef tuple i * cdef int endian_detector = 1 * cdef bint little_endian = ((&endian_detector)[0] != 0) # <<<<<<<<<<<<<< * cdef tuple fields * */ __pyx_v_little_endian = ((((char *)(&__pyx_v_endian_detector))[0]) != 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":794 * cdef tuple fields * * for childname in descr.names: # <<<<<<<<<<<<<< * fields = descr.fields[childname] * child, new_offset = fields */ if (unlikely(__pyx_v_descr->names == Py_None)) { PyErr_SetString(PyExc_TypeError, "'NoneType' object is not iterable"); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_t_1 = __pyx_v_descr->names; __Pyx_INCREF(__pyx_t_1); __pyx_t_2 = 0; for (;;) { if (__pyx_t_2 >= PyTuple_GET_SIZE(__pyx_t_1)) break; #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_3 = PyTuple_GET_ITEM(__pyx_t_1, __pyx_t_2); __Pyx_INCREF(__pyx_t_3); __pyx_t_2++; if (unlikely(0 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #else __pyx_t_3 = PySequence_ITEM(__pyx_t_1, __pyx_t_2); __pyx_t_2++; if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 794; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif __Pyx_XDECREF_SET(__pyx_v_childname, __pyx_t_3); __pyx_t_3 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":795 * * for childname in descr.names: * fields = descr.fields[childname] # <<<<<<<<<<<<<< * child, new_offset = fields * */ __pyx_t_3 = PyObject_GetItem(__pyx_v_descr->fields, __pyx_v_childname); if (unlikely(__pyx_t_3 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __Pyx_GOTREF(__pyx_t_3); if (!(likely(PyTuple_CheckExact(__pyx_t_3))||((__pyx_t_3) == Py_None)||(PyErr_Format(PyExc_TypeError, "Expected %.16s, got %.200s", "tuple", Py_TYPE(__pyx_t_3)->tp_name), 0))) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 795; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_XDECREF_SET(__pyx_v_fields, ((PyObject*)__pyx_t_3)); __pyx_t_3 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":796 * for childname in descr.names: * fields = descr.fields[childname] * child, new_offset = fields # <<<<<<<<<<<<<< * * if (end - f) - (new_offset - offset[0]) < 15: */ if (likely(__pyx_v_fields != Py_None)) { PyObject* sequence = __pyx_v_fields; #if CYTHON_COMPILING_IN_CPYTHON Py_ssize_t size = Py_SIZE(sequence); #else Py_ssize_t size = PySequence_Size(sequence); #endif if (unlikely(size != 2)) { if (size > 2) __Pyx_RaiseTooManyValuesError(2); else if (size >= 0) __Pyx_RaiseNeedMoreValuesError(size); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } #if CYTHON_COMPILING_IN_CPYTHON __pyx_t_3 = PyTuple_GET_ITEM(sequence, 0); __pyx_t_4 = PyTuple_GET_ITEM(sequence, 1); __Pyx_INCREF(__pyx_t_3); __Pyx_INCREF(__pyx_t_4); #else __pyx_t_3 = PySequence_ITEM(sequence, 0); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PySequence_ITEM(sequence, 1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); #endif } else { __Pyx_RaiseNoneNotIterableError(); {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } if (!(likely(((__pyx_t_3) == Py_None) || likely(__Pyx_TypeTest(__pyx_t_3, __pyx_ptype_5numpy_dtype))))) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 796; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_XDECREF_SET(__pyx_v_child, ((PyArray_Descr *)__pyx_t_3)); __pyx_t_3 = 0; __Pyx_XDECREF_SET(__pyx_v_new_offset, __pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":798 * child, new_offset = fields * * if (end - f) - (new_offset - offset[0]) < 15: # <<<<<<<<<<<<<< * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") * */ __pyx_t_4 = __Pyx_PyInt_From_int((__pyx_v_offset[0])); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyNumber_Subtract(__pyx_v_new_offset, __pyx_t_4); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_5 = __Pyx_PyInt_As_int(__pyx_t_3); if (unlikely((__pyx_t_5 == (int)-1) && PyErr_Occurred())) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 798; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = ((((__pyx_v_end - __pyx_v_f) - ((int)__pyx_t_5)) < 15) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":799 * * if (end - f) - (new_offset - offset[0]) < 15: * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") # <<<<<<<<<<<<<< * * if ((child.byteorder == c'>' and little_endian) or */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_RuntimeError, __pyx_tuple__6, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":801 * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") * * if ((child.byteorder == c'>' and little_endian) or # <<<<<<<<<<<<<< * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") */ __pyx_t_6 = ((__pyx_v_child->byteorder == '>') != 0); if (__pyx_t_6) { __pyx_t_7 = (__pyx_v_little_endian != 0); } else { __pyx_t_7 = __pyx_t_6; } if (!__pyx_t_7) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":802 * * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): # <<<<<<<<<<<<<< * raise ValueError(u"Non-native byte order not supported") * # One could encode it in the format string and have Cython */ __pyx_t_6 = ((__pyx_v_child->byteorder == '<') != 0); if (__pyx_t_6) { __pyx_t_8 = ((!(__pyx_v_little_endian != 0)) != 0); __pyx_t_9 = __pyx_t_8; } else { __pyx_t_9 = __pyx_t_6; } __pyx_t_6 = __pyx_t_9; } else { __pyx_t_6 = __pyx_t_7; } if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":803 * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * # One could encode it in the format string and have Cython * # complain instead, BUT: < and > in format strings also imply */ __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_tuple__7, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":813 * * # Output padding bytes * while offset[0] < new_offset: # <<<<<<<<<<<<<< * f[0] = 120 # "x"; pad byte * f += 1 */ while (1) { __pyx_t_3 = __Pyx_PyInt_From_int((__pyx_v_offset[0])); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_t_3, __pyx_v_new_offset, Py_LT); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 813; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (!__pyx_t_6) break; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":814 * # Output padding bytes * while offset[0] < new_offset: * f[0] = 120 # "x"; pad byte # <<<<<<<<<<<<<< * f += 1 * offset[0] += 1 */ (__pyx_v_f[0]) = 120; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":815 * while offset[0] < new_offset: * f[0] = 120 # "x"; pad byte * f += 1 # <<<<<<<<<<<<<< * offset[0] += 1 * */ __pyx_v_f = (__pyx_v_f + 1); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":816 * f[0] = 120 # "x"; pad byte * f += 1 * offset[0] += 1 # <<<<<<<<<<<<<< * * offset[0] += child.itemsize */ __pyx_t_10 = 0; (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + 1); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":818 * offset[0] += 1 * * offset[0] += child.itemsize # <<<<<<<<<<<<<< * * if not PyDataType_HASFIELDS(child): */ __pyx_t_10 = 0; (__pyx_v_offset[__pyx_t_10]) = ((__pyx_v_offset[__pyx_t_10]) + __pyx_v_child->elsize); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":820 * offset[0] += child.itemsize * * if not PyDataType_HASFIELDS(child): # <<<<<<<<<<<<<< * t = child.type_num * if end - f < 5: */ __pyx_t_6 = ((!(PyDataType_HASFIELDS(__pyx_v_child) != 0)) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":821 * * if not PyDataType_HASFIELDS(child): * t = child.type_num # <<<<<<<<<<<<<< * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") */ __pyx_t_4 = __Pyx_PyInt_From_int(__pyx_v_child->type_num); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 821; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_XDECREF_SET(__pyx_v_t, __pyx_t_4); __pyx_t_4 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":822 * if not PyDataType_HASFIELDS(child): * t = child.type_num * if end - f < 5: # <<<<<<<<<<<<<< * raise RuntimeError(u"Format string allocated too short.") * */ __pyx_t_6 = (((__pyx_v_end - __pyx_v_f) < 5) != 0); if (__pyx_t_6) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":823 * t = child.type_num * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") # <<<<<<<<<<<<<< * * # Until ticket #99 is fixed, use integers to avoid warnings */ __pyx_t_4 = __Pyx_PyObject_Call(__pyx_builtin_RuntimeError, __pyx_tuple__8, NULL); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __Pyx_Raise(__pyx_t_4, 0, 0, 0); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":826 * * # Until ticket #99 is fixed, use integers to avoid warnings * if t == NPY_BYTE: f[0] = 98 #"b" # <<<<<<<<<<<<<< * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" */ __pyx_t_4 = PyInt_FromLong(NPY_BYTE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 826; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 98; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":827 * # Until ticket #99 is fixed, use integers to avoid warnings * if t == NPY_BYTE: f[0] = 98 #"b" * elif t == NPY_UBYTE: f[0] = 66 #"B" # <<<<<<<<<<<<<< * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" */ __pyx_t_3 = PyInt_FromLong(NPY_UBYTE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 827; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 66; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":828 * if t == NPY_BYTE: f[0] = 98 #"b" * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" # <<<<<<<<<<<<<< * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" */ __pyx_t_4 = PyInt_FromLong(NPY_SHORT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 828; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 104; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":829 * elif t == NPY_UBYTE: f[0] = 66 #"B" * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" # <<<<<<<<<<<<<< * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" */ __pyx_t_3 = PyInt_FromLong(NPY_USHORT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 829; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 72; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":830 * elif t == NPY_SHORT: f[0] = 104 #"h" * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" # <<<<<<<<<<<<<< * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" */ __pyx_t_4 = PyInt_FromLong(NPY_INT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 830; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 105; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":831 * elif t == NPY_USHORT: f[0] = 72 #"H" * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" # <<<<<<<<<<<<<< * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" */ __pyx_t_3 = PyInt_FromLong(NPY_UINT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 831; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 73; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":832 * elif t == NPY_INT: f[0] = 105 #"i" * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" # <<<<<<<<<<<<<< * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" */ __pyx_t_4 = PyInt_FromLong(NPY_LONG); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 832; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 108; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":833 * elif t == NPY_UINT: f[0] = 73 #"I" * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" # <<<<<<<<<<<<<< * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" */ __pyx_t_3 = PyInt_FromLong(NPY_ULONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 833; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 76; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":834 * elif t == NPY_LONG: f[0] = 108 #"l" * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" # <<<<<<<<<<<<<< * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" */ __pyx_t_4 = PyInt_FromLong(NPY_LONGLONG); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 834; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 113; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":835 * elif t == NPY_ULONG: f[0] = 76 #"L" * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" # <<<<<<<<<<<<<< * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" */ __pyx_t_3 = PyInt_FromLong(NPY_ULONGLONG); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 835; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 81; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":836 * elif t == NPY_LONGLONG: f[0] = 113 #"q" * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" # <<<<<<<<<<<<<< * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" */ __pyx_t_4 = PyInt_FromLong(NPY_FLOAT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 836; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 102; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":837 * elif t == NPY_ULONGLONG: f[0] = 81 #"Q" * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" # <<<<<<<<<<<<<< * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf */ __pyx_t_3 = PyInt_FromLong(NPY_DOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 837; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 100; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":838 * elif t == NPY_FLOAT: f[0] = 102 #"f" * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" # <<<<<<<<<<<<<< * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd */ __pyx_t_4 = PyInt_FromLong(NPY_LONGDOUBLE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 838; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 103; goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":839 * elif t == NPY_DOUBLE: f[0] = 100 #"d" * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf # <<<<<<<<<<<<<< * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg */ __pyx_t_3 = PyInt_FromLong(NPY_CFLOAT); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 839; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 102; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":840 * elif t == NPY_LONGDOUBLE: f[0] = 103 #"g" * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd # <<<<<<<<<<<<<< * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg * elif t == NPY_OBJECT: f[0] = 79 #"O" */ __pyx_t_4 = PyInt_FromLong(NPY_CDOUBLE); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 840; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 100; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":841 * elif t == NPY_CFLOAT: f[0] = 90; f[1] = 102; f += 1 # Zf * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg # <<<<<<<<<<<<<< * elif t == NPY_OBJECT: f[0] = 79 #"O" * else: */ __pyx_t_3 = PyInt_FromLong(NPY_CLONGDOUBLE); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyObject_RichCompare(__pyx_v_t, __pyx_t_3, Py_EQ); __Pyx_XGOTREF(__pyx_t_4); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_4); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 841; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 90; (__pyx_v_f[1]) = 103; __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L11; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":842 * elif t == NPY_CDOUBLE: f[0] = 90; f[1] = 100; f += 1 # Zd * elif t == NPY_CLONGDOUBLE: f[0] = 90; f[1] = 103; f += 1 # Zg * elif t == NPY_OBJECT: f[0] = 79 #"O" # <<<<<<<<<<<<<< * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) */ __pyx_t_4 = PyInt_FromLong(NPY_OBJECT); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); __pyx_t_3 = PyObject_RichCompare(__pyx_v_t, __pyx_t_4, Py_EQ); __Pyx_XGOTREF(__pyx_t_3); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __pyx_t_6 = __Pyx_PyObject_IsTrue(__pyx_t_3); if (unlikely(__pyx_t_6 < 0)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 842; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; if (__pyx_t_6) { (__pyx_v_f[0]) = 79; goto __pyx_L11; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":844 * elif t == NPY_OBJECT: f[0] = 79 #"O" * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) # <<<<<<<<<<<<<< * f += 1 * else: */ __pyx_t_3 = PyUnicode_Format(__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_v_t); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __pyx_t_4 = PyTuple_New(1); if (unlikely(!__pyx_t_4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_4); PyTuple_SET_ITEM(__pyx_t_4, 0, __pyx_t_3); __Pyx_GIVEREF(__pyx_t_3); __pyx_t_3 = 0; __pyx_t_3 = __Pyx_PyObject_Call(__pyx_builtin_ValueError, __pyx_t_4, NULL); if (unlikely(!__pyx_t_3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_3); __Pyx_DECREF(__pyx_t_4); __pyx_t_4 = 0; __Pyx_Raise(__pyx_t_3, 0, 0, 0); __Pyx_DECREF(__pyx_t_3); __pyx_t_3 = 0; {__pyx_filename = __pyx_f[2]; __pyx_lineno = 844; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } __pyx_L11:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":845 * else: * raise ValueError(u"unknown dtype code in numpy.pxd (%d)" % t) * f += 1 # <<<<<<<<<<<<<< * else: * # Cython ignores struct boundary information ("T{...}"), */ __pyx_v_f = (__pyx_v_f + 1); goto __pyx_L9; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":849 * # Cython ignores struct boundary information ("T{...}"), * # so don't output it * f = _util_dtypestring(child, f, end, offset) # <<<<<<<<<<<<<< * return f * */ __pyx_t_11 = __pyx_f_5numpy__util_dtypestring(__pyx_v_child, __pyx_v_f, __pyx_v_end, __pyx_v_offset); if (unlikely(__pyx_t_11 == NULL)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 849; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_v_f = __pyx_t_11; } __pyx_L9:; } __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":850 * # so don't output it * f = _util_dtypestring(child, f, end, offset) * return f # <<<<<<<<<<<<<< * * */ __pyx_r = __pyx_v_f; goto __pyx_L0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":783 * return PyArray_MultiIterNew(5, a, b, c, d, e) * * cdef inline char* _util_dtypestring(dtype descr, char* f, char* end, int* offset) except NULL: # <<<<<<<<<<<<<< * # Recursive utility function used in __getbuffer__ to get format * # string. The new location in the format string is returned. */ /* function exit code */ __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); __Pyx_XDECREF(__pyx_t_3); __Pyx_XDECREF(__pyx_t_4); __Pyx_AddTraceback("numpy._util_dtypestring", __pyx_clineno, __pyx_lineno, __pyx_filename); __pyx_r = NULL; __pyx_L0:; __Pyx_XDECREF((PyObject *)__pyx_v_child); __Pyx_XDECREF(__pyx_v_fields); __Pyx_XDECREF(__pyx_v_childname); __Pyx_XDECREF(__pyx_v_new_offset); __Pyx_XDECREF(__pyx_v_t); __Pyx_RefNannyFinishContext(); return __pyx_r; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":966 * * * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<< * cdef PyObject* baseptr * if base is None: */ static CYTHON_INLINE void __pyx_f_5numpy_set_array_base(PyArrayObject *__pyx_v_arr, PyObject *__pyx_v_base) { PyObject *__pyx_v_baseptr; __Pyx_RefNannyDeclarations int __pyx_t_1; int __pyx_t_2; __Pyx_RefNannySetupContext("set_array_base", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":968 * cdef inline void set_array_base(ndarray arr, object base): * cdef PyObject* baseptr * if base is None: # <<<<<<<<<<<<<< * baseptr = NULL * else: */ __pyx_t_1 = (__pyx_v_base == Py_None); __pyx_t_2 = (__pyx_t_1 != 0); if (__pyx_t_2) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":969 * cdef PyObject* baseptr * if base is None: * baseptr = NULL # <<<<<<<<<<<<<< * else: * Py_INCREF(base) # important to do this before decref below! */ __pyx_v_baseptr = NULL; goto __pyx_L3; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":971 * baseptr = NULL * else: * Py_INCREF(base) # important to do this before decref below! # <<<<<<<<<<<<<< * baseptr = base * Py_XDECREF(arr.base) */ Py_INCREF(__pyx_v_base); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":972 * else: * Py_INCREF(base) # important to do this before decref below! * baseptr = base # <<<<<<<<<<<<<< * Py_XDECREF(arr.base) * arr.base = baseptr */ __pyx_v_baseptr = ((PyObject *)__pyx_v_base); } __pyx_L3:; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":973 * Py_INCREF(base) # important to do this before decref below! * baseptr = base * Py_XDECREF(arr.base) # <<<<<<<<<<<<<< * arr.base = baseptr * */ Py_XDECREF(__pyx_v_arr->base); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":974 * baseptr = base * Py_XDECREF(arr.base) * arr.base = baseptr # <<<<<<<<<<<<<< * * cdef inline object get_array_base(ndarray arr): */ __pyx_v_arr->base = __pyx_v_baseptr; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":966 * * * cdef inline void set_array_base(ndarray arr, object base): # <<<<<<<<<<<<<< * cdef PyObject* baseptr * if base is None: */ /* function exit code */ __Pyx_RefNannyFinishContext(); } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ static CYTHON_INLINE PyObject *__pyx_f_5numpy_get_array_base(PyArrayObject *__pyx_v_arr) { PyObject *__pyx_r = NULL; __Pyx_RefNannyDeclarations int __pyx_t_1; __Pyx_RefNannySetupContext("get_array_base", 0); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":977 * * cdef inline object get_array_base(ndarray arr): * if arr.base is NULL: # <<<<<<<<<<<<<< * return None * else: */ __pyx_t_1 = ((__pyx_v_arr->base == NULL) != 0); if (__pyx_t_1) { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":978 * cdef inline object get_array_base(ndarray arr): * if arr.base is NULL: * return None # <<<<<<<<<<<<<< * else: * return arr.base */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(Py_None); __pyx_r = Py_None; goto __pyx_L0; } /*else*/ { /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":980 * return None * else: * return arr.base # <<<<<<<<<<<<<< */ __Pyx_XDECREF(__pyx_r); __Pyx_INCREF(((PyObject *)__pyx_v_arr->base)); __pyx_r = ((PyObject *)__pyx_v_arr->base); goto __pyx_L0; } /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ /* function exit code */ __pyx_L0:; __Pyx_XGIVEREF(__pyx_r); __Pyx_RefNannyFinishContext(); return __pyx_r; } static PyMethodDef __pyx_methods[] = { {0, 0, 0, 0} }; #if PY_MAJOR_VERSION >= 3 static struct PyModuleDef __pyx_moduledef = { #if PY_VERSION_HEX < 0x03020000 { PyObject_HEAD_INIT(NULL) NULL, 0, NULL }, #else PyModuleDef_HEAD_INIT, #endif __Pyx_NAMESTR("_pixelfunc"), 0, /* m_doc */ -1, /* m_size */ __pyx_methods /* m_methods */, NULL, /* m_reload */ NULL, /* m_traverse */ NULL, /* m_clear */ NULL /* m_free */ }; #endif static __Pyx_StringTabEntry __pyx_string_tab[] = { {&__pyx_kp_u_Convert_pixel_identifier_to_ring, __pyx_k_Convert_pixel_identifier_to_ring, sizeof(__pyx_k_Convert_pixel_identifier_to_ring), 0, 1, 0, 0}, {&__pyx_kp_u_Format_string_allocated_too_shor, __pyx_k_Format_string_allocated_too_shor, sizeof(__pyx_k_Format_string_allocated_too_shor), 0, 1, 0, 0}, {&__pyx_kp_u_Format_string_allocated_too_shor_2, __pyx_k_Format_string_allocated_too_shor_2, sizeof(__pyx_k_Format_string_allocated_too_shor_2), 0, 1, 0, 0}, {&__pyx_kp_u_Get_information_for_rings_Rings, __pyx_k_Get_information_for_rings_Rings, sizeof(__pyx_k_Get_information_for_rings_Rings), 0, 1, 0, 0}, {&__pyx_kp_u_Non_native_byte_order_not_suppor, __pyx_k_Non_native_byte_order_not_suppor, sizeof(__pyx_k_Non_native_byte_order_not_suppor), 0, 1, 0, 0}, {&__pyx_n_s_RuntimeError, __pyx_k_RuntimeError, sizeof(__pyx_k_RuntimeError), 0, 0, 1, 1}, {&__pyx_n_s_ValueError, __pyx_k_ValueError, sizeof(__pyx_k_ValueError), 0, 0, 1, 1}, {&__pyx_kp_s_Wrong_nside_value_must_be_a_powe, __pyx_k_Wrong_nside_value_must_be_a_powe, sizeof(__pyx_k_Wrong_nside_value_must_be_a_powe), 0, 0, 1, 0}, {&__pyx_n_s_bool, __pyx_k_bool, sizeof(__pyx_k_bool), 0, 0, 1, 1}, {&__pyx_n_s_costheta, __pyx_k_costheta, sizeof(__pyx_k_costheta), 0, 0, 1, 1}, {&__pyx_n_s_dtype, __pyx_k_dtype, sizeof(__pyx_k_dtype), 0, 0, 1, 1}, {&__pyx_n_s_empty, __pyx_k_empty, sizeof(__pyx_k_empty), 0, 0, 1, 1}, {&__pyx_n_s_float, __pyx_k_float, sizeof(__pyx_k_float), 0, 0, 1, 1}, {&__pyx_n_s_hb, __pyx_k_hb, sizeof(__pyx_k_hb), 0, 0, 1, 1}, {&__pyx_n_s_healpy__pixelfunc, __pyx_k_healpy__pixelfunc, sizeof(__pyx_k_healpy__pixelfunc), 0, 0, 1, 1}, {&__pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_k_home_zonca_p_software_healpy_he, sizeof(__pyx_k_home_zonca_p_software_healpy_he), 0, 0, 1, 0}, {&__pyx_n_s_i, __pyx_k_i, sizeof(__pyx_k_i), 0, 0, 1, 1}, {&__pyx_n_s_import, __pyx_k_import, sizeof(__pyx_k_import), 0, 0, 1, 1}, {&__pyx_n_s_int64, __pyx_k_int64, sizeof(__pyx_k_int64), 0, 0, 1, 1}, {&__pyx_n_s_log2, __pyx_k_log2, sizeof(__pyx_k_log2), 0, 0, 1, 1}, {&__pyx_n_s_main, __pyx_k_main, sizeof(__pyx_k_main), 0, 0, 1, 1}, {&__pyx_kp_u_ndarray_is_not_C_contiguous, __pyx_k_ndarray_is_not_C_contiguous, sizeof(__pyx_k_ndarray_is_not_C_contiguous), 0, 1, 0, 0}, {&__pyx_kp_u_ndarray_is_not_Fortran_contiguou, __pyx_k_ndarray_is_not_Fortran_contiguou, sizeof(__pyx_k_ndarray_is_not_Fortran_contiguou), 0, 1, 0, 0}, {&__pyx_n_s_nest, __pyx_k_nest, sizeof(__pyx_k_nest), 0, 0, 1, 1}, {&__pyx_n_s_np, __pyx_k_np, sizeof(__pyx_k_np), 0, 0, 1, 1}, {&__pyx_n_s_nside, __pyx_k_nside, sizeof(__pyx_k_nside), 0, 0, 1, 1}, {&__pyx_n_s_num, __pyx_k_num, sizeof(__pyx_k_num), 0, 0, 1, 1}, {&__pyx_n_s_numpy, __pyx_k_numpy, sizeof(__pyx_k_numpy), 0, 0, 1, 1}, {&__pyx_n_s_pix, __pyx_k_pix, sizeof(__pyx_k_pix), 0, 0, 1, 1}, {&__pyx_n_s_pix2ring, __pyx_k_pix2ring, sizeof(__pyx_k_pix2ring), 0, 0, 1, 1}, {&__pyx_kp_u_pix2ring_line_58, __pyx_k_pix2ring_line_58, sizeof(__pyx_k_pix2ring_line_58), 0, 1, 0, 0}, {&__pyx_n_s_pyx_getbuffer, __pyx_k_pyx_getbuffer, sizeof(__pyx_k_pyx_getbuffer), 0, 0, 1, 1}, {&__pyx_n_s_pyx_releasebuffer, __pyx_k_pyx_releasebuffer, sizeof(__pyx_k_pyx_releasebuffer), 0, 0, 1, 1}, {&__pyx_n_s_range, __pyx_k_range, sizeof(__pyx_k_range), 0, 0, 1, 1}, {&__pyx_n_s_ring, __pyx_k_ring, sizeof(__pyx_k_ring), 0, 0, 1, 1}, {&__pyx_n_s_ringinfo, __pyx_k_ringinfo, sizeof(__pyx_k_ringinfo), 0, 0, 1, 1}, {&__pyx_kp_u_ringinfo_line_9, __pyx_k_ringinfo_line_9, sizeof(__pyx_k_ringinfo_line_9), 0, 1, 0, 0}, {&__pyx_n_s_ringpix, __pyx_k_ringpix, sizeof(__pyx_k_ringpix), 0, 0, 1, 1}, {&__pyx_n_s_round, __pyx_k_round, sizeof(__pyx_k_round), 0, 0, 1, 1}, {&__pyx_n_s_scheme, __pyx_k_scheme, sizeof(__pyx_k_scheme), 0, 0, 1, 1}, {&__pyx_n_s_shifted, __pyx_k_shifted, sizeof(__pyx_k_shifted), 0, 0, 1, 1}, {&__pyx_n_s_sintheta, __pyx_k_sintheta, sizeof(__pyx_k_sintheta), 0, 0, 1, 1}, {&__pyx_n_s_size, __pyx_k_size, sizeof(__pyx_k_size), 0, 0, 1, 1}, {&__pyx_n_s_startpix, __pyx_k_startpix, sizeof(__pyx_k_startpix), 0, 0, 1, 1}, {&__pyx_n_s_test, __pyx_k_test, sizeof(__pyx_k_test), 0, 0, 1, 1}, {&__pyx_kp_u_unknown_dtype_code_in_numpy_pxd, __pyx_k_unknown_dtype_code_in_numpy_pxd, sizeof(__pyx_k_unknown_dtype_code_in_numpy_pxd), 0, 1, 0, 0}, {0, 0, 0, 0, 0, 0, 0} }; static int __Pyx_InitCachedBuiltins(void) { __pyx_builtin_ValueError = __Pyx_GetBuiltinName(__pyx_n_s_ValueError); if (!__pyx_builtin_ValueError) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 45; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_range = __Pyx_GetBuiltinName(__pyx_n_s_range); if (!__pyx_builtin_range) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 54; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_round = __Pyx_GetBuiltinName(__pyx_n_s_round); if (!__pyx_builtin_round) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 104; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_builtin_RuntimeError = __Pyx_GetBuiltinName(__pyx_n_s_RuntimeError); if (!__pyx_builtin_RuntimeError) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} return 0; __pyx_L1_error:; return -1; } static int __Pyx_InitCachedConstants(void) { __Pyx_RefNannyDeclarations __Pyx_RefNannySetupContext("__Pyx_InitCachedConstants", 0); /* "healpy/src/_pixelfunc.pyx":45 * """ * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme = NEST * cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) */ __pyx_tuple_ = PyTuple_Pack(1, __pyx_kp_s_Wrong_nside_value_must_be_a_powe); if (unlikely(!__pyx_tuple_)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 45; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple_); __Pyx_GIVEREF(__pyx_tuple_); /* "healpy/src/_pixelfunc.pyx":89 * * if not isnsideok(nside): * raise ValueError('Wrong nside value, must be a power of 2') # <<<<<<<<<<<<<< * cdef Healpix_Ordering_Scheme scheme * if nest: */ __pyx_tuple__2 = PyTuple_Pack(1, __pyx_kp_s_Wrong_nside_value_must_be_a_powe); if (unlikely(!__pyx_tuple__2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 89; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__2); __Pyx_GIVEREF(__pyx_tuple__2); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":215 * if ((flags & pybuf.PyBUF_C_CONTIGUOUS == pybuf.PyBUF_C_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_C_CONTIGUOUS)): * raise ValueError(u"ndarray is not C contiguous") # <<<<<<<<<<<<<< * * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) */ __pyx_tuple__3 = PyTuple_Pack(1, __pyx_kp_u_ndarray_is_not_C_contiguous); if (unlikely(!__pyx_tuple__3)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 215; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__3); __Pyx_GIVEREF(__pyx_tuple__3); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":219 * if ((flags & pybuf.PyBUF_F_CONTIGUOUS == pybuf.PyBUF_F_CONTIGUOUS) * and not PyArray_CHKFLAGS(self, NPY_F_CONTIGUOUS)): * raise ValueError(u"ndarray is not Fortran contiguous") # <<<<<<<<<<<<<< * * info.buf = PyArray_DATA(self) */ __pyx_tuple__4 = PyTuple_Pack(1, __pyx_kp_u_ndarray_is_not_Fortran_contiguou); if (unlikely(!__pyx_tuple__4)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 219; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__4); __Pyx_GIVEREF(__pyx_tuple__4); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":257 * if ((descr.byteorder == c'>' and little_endian) or * (descr.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * if t == NPY_BYTE: f = "b" * elif t == NPY_UBYTE: f = "B" */ __pyx_tuple__5 = PyTuple_Pack(1, __pyx_kp_u_Non_native_byte_order_not_suppor); if (unlikely(!__pyx_tuple__5)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 257; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__5); __Pyx_GIVEREF(__pyx_tuple__5); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":799 * * if (end - f) - (new_offset - offset[0]) < 15: * raise RuntimeError(u"Format string allocated too short, see comment in numpy.pxd") # <<<<<<<<<<<<<< * * if ((child.byteorder == c'>' and little_endian) or */ __pyx_tuple__6 = PyTuple_Pack(1, __pyx_kp_u_Format_string_allocated_too_shor); if (unlikely(!__pyx_tuple__6)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 799; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__6); __Pyx_GIVEREF(__pyx_tuple__6); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":803 * if ((child.byteorder == c'>' and little_endian) or * (child.byteorder == c'<' and not little_endian)): * raise ValueError(u"Non-native byte order not supported") # <<<<<<<<<<<<<< * # One could encode it in the format string and have Cython * # complain instead, BUT: < and > in format strings also imply */ __pyx_tuple__7 = PyTuple_Pack(1, __pyx_kp_u_Non_native_byte_order_not_suppor); if (unlikely(!__pyx_tuple__7)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 803; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__7); __Pyx_GIVEREF(__pyx_tuple__7); /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":823 * t = child.type_num * if end - f < 5: * raise RuntimeError(u"Format string allocated too short.") # <<<<<<<<<<<<<< * * # Until ticket #99 is fixed, use integers to avoid warnings */ __pyx_tuple__8 = PyTuple_Pack(1, __pyx_kp_u_Format_string_allocated_too_shor_2); if (unlikely(!__pyx_tuple__8)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 823; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__8); __Pyx_GIVEREF(__pyx_tuple__8); /* "healpy/src/_pixelfunc.pyx":9 * from _common cimport int64, Healpix_Ordering_Scheme, RING, NEST, SET_NSIDE, T_Healpix_Base * * def ringinfo(nside, np.ndarray[int64, ndim=1] ring not None): # <<<<<<<<<<<<<< * """Get information for rings * */ __pyx_tuple__9 = PyTuple_Pack(11, __pyx_n_s_nside, __pyx_n_s_ring, __pyx_n_s_scheme, __pyx_n_s_hb, __pyx_n_s_num, __pyx_n_s_startpix, __pyx_n_s_ringpix, __pyx_n_s_costheta, __pyx_n_s_sintheta, __pyx_n_s_shifted, __pyx_n_s_i); if (unlikely(!__pyx_tuple__9)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__9); __Pyx_GIVEREF(__pyx_tuple__9); __pyx_codeobj__10 = (PyObject*)__Pyx_PyCode_New(2, 0, 11, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__9, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_ringinfo, 9, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__10)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /* "healpy/src/_pixelfunc.pyx":58 * return startpix, ringpix, costheta, sintheta, shifted * * def pix2ring(nside, np.ndarray[int64, ndim=1] pix not None, nest=False): # <<<<<<<<<<<<<< * """Convert pixel identifier to ring number * */ __pyx_tuple__11 = PyTuple_Pack(8, __pyx_n_s_nside, __pyx_n_s_pix, __pyx_n_s_nest, __pyx_n_s_scheme, __pyx_n_s_hb, __pyx_n_s_num, __pyx_n_s_ring, __pyx_n_s_i); if (unlikely(!__pyx_tuple__11)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_tuple__11); __Pyx_GIVEREF(__pyx_tuple__11); __pyx_codeobj__12 = (PyObject*)__Pyx_PyCode_New(3, 0, 8, 0, 0, __pyx_empty_bytes, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_tuple__11, __pyx_empty_tuple, __pyx_empty_tuple, __pyx_kp_s_home_zonca_p_software_healpy_he, __pyx_n_s_pix2ring, 58, __pyx_empty_bytes); if (unlikely(!__pyx_codeobj__12)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_RefNannyFinishContext(); return 0; __pyx_L1_error:; __Pyx_RefNannyFinishContext(); return -1; } static int __Pyx_InitGlobals(void) { if (__Pyx_InitStrings(__pyx_string_tab) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; __pyx_int_2 = PyInt_FromLong(2); if (unlikely(!__pyx_int_2)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} return 0; __pyx_L1_error:; return -1; } #if PY_MAJOR_VERSION < 3 PyMODINIT_FUNC init_pixelfunc(void); /*proto*/ PyMODINIT_FUNC init_pixelfunc(void) #else PyMODINIT_FUNC PyInit__pixelfunc(void); /*proto*/ PyMODINIT_FUNC PyInit__pixelfunc(void) #endif { PyObject *__pyx_t_1 = NULL; int __pyx_lineno = 0; const char *__pyx_filename = NULL; int __pyx_clineno = 0; __Pyx_RefNannyDeclarations #if CYTHON_REFNANNY __Pyx_RefNanny = __Pyx_RefNannyImportAPI("refnanny"); if (!__Pyx_RefNanny) { PyErr_Clear(); __Pyx_RefNanny = __Pyx_RefNannyImportAPI("Cython.Runtime.refnanny"); if (!__Pyx_RefNanny) Py_FatalError("failed to import 'refnanny' module"); } #endif __Pyx_RefNannySetupContext("PyMODINIT_FUNC PyInit__pixelfunc(void)", 0); if ( __Pyx_check_binary_version() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_empty_tuple = PyTuple_New(0); if (unlikely(!__pyx_empty_tuple)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_empty_bytes = PyBytes_FromStringAndSize("", 0); if (unlikely(!__pyx_empty_bytes)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #ifdef __Pyx_CyFunction_USED if (__Pyx_CyFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif #ifdef __Pyx_FusedFunction_USED if (__pyx_FusedFunction_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif #ifdef __Pyx_Generator_USED if (__pyx_Generator_init() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif /*--- Library function declarations ---*/ /*--- Threads initialization code ---*/ #if defined(__PYX_FORCE_INIT_THREADS) && __PYX_FORCE_INIT_THREADS #ifdef WITH_THREAD /* Python build with threading support? */ PyEval_InitThreads(); #endif #endif /*--- Module creation code ---*/ #if PY_MAJOR_VERSION < 3 __pyx_m = Py_InitModule4(__Pyx_NAMESTR("_pixelfunc"), __pyx_methods, 0, 0, PYTHON_API_VERSION); Py_XINCREF(__pyx_m); #else __pyx_m = PyModule_Create(&__pyx_moduledef); #endif if (unlikely(!__pyx_m)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_d = PyModule_GetDict(__pyx_m); if (unlikely(!__pyx_d)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} Py_INCREF(__pyx_d); __pyx_b = PyImport_AddModule(__Pyx_NAMESTR(__Pyx_BUILTIN_MODULE_NAME)); if (unlikely(!__pyx_b)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #if CYTHON_COMPILING_IN_PYPY Py_INCREF(__pyx_b); #endif if (__Pyx_SetAttrString(__pyx_m, "__builtins__", __pyx_b) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; /*--- Initialize various global constants etc. ---*/ if (unlikely(__Pyx_InitGlobals() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #if PY_MAJOR_VERSION < 3 && (__PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT) if (__Pyx_init_sys_getdefaultencoding_params() < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} #endif if (__pyx_module_is_main_healpy___pixelfunc) { if (__Pyx_SetAttrString(__pyx_m, "__name__", __pyx_n_s_main) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;}; } #if PY_MAJOR_VERSION >= 3 { PyObject *modules = PyImport_GetModuleDict(); if (unlikely(!modules)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (!PyDict_GetItemString(modules, "healpy._pixelfunc")) { if (unlikely(PyDict_SetItemString(modules, "healpy._pixelfunc", __pyx_m) < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} } } #endif /*--- Builtin init code ---*/ if (unlikely(__Pyx_InitCachedBuiltins() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Constants init code ---*/ if (unlikely(__Pyx_InitCachedConstants() < 0)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Global init code ---*/ /*--- Variable export code ---*/ /*--- Function export code ---*/ /*--- Type init code ---*/ /*--- Type import code ---*/ __pyx_ptype_7cpython_4type_type = __Pyx_ImportType(__Pyx_BUILTIN_MODULE_NAME, "type", #if CYTHON_COMPILING_IN_PYPY sizeof(PyTypeObject), #else sizeof(PyHeapTypeObject), #endif 0); if (unlikely(!__pyx_ptype_7cpython_4type_type)) {__pyx_filename = __pyx_f[3]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_dtype = __Pyx_ImportType("numpy", "dtype", sizeof(PyArray_Descr), 0); if (unlikely(!__pyx_ptype_5numpy_dtype)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 155; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_flatiter = __Pyx_ImportType("numpy", "flatiter", sizeof(PyArrayIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_flatiter)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 165; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_broadcast = __Pyx_ImportType("numpy", "broadcast", sizeof(PyArrayMultiIterObject), 0); if (unlikely(!__pyx_ptype_5numpy_broadcast)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 169; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_ndarray = __Pyx_ImportType("numpy", "ndarray", sizeof(PyArrayObject), 0); if (unlikely(!__pyx_ptype_5numpy_ndarray)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 178; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __pyx_ptype_5numpy_ufunc = __Pyx_ImportType("numpy", "ufunc", sizeof(PyUFuncObject), 0); if (unlikely(!__pyx_ptype_5numpy_ufunc)) {__pyx_filename = __pyx_f[2]; __pyx_lineno = 861; __pyx_clineno = __LINE__; goto __pyx_L1_error;} /*--- Variable import code ---*/ /*--- Function import code ---*/ /*--- Execution code ---*/ /* "healpy/src/_pixelfunc.pyx":3 * # Wrapper around the geometry methods in Healpix_base class * * import numpy as np # <<<<<<<<<<<<<< * cimport numpy as np * from libcpp cimport bool */ __pyx_t_1 = __Pyx_Import(__pyx_n_s_numpy, 0, -1); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 3; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_np, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 3; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_pixelfunc.pyx":9 * from _common cimport int64, Healpix_Ordering_Scheme, RING, NEST, SET_NSIDE, T_Healpix_Base * * def ringinfo(nside, np.ndarray[int64, ndim=1] ring not None): # <<<<<<<<<<<<<< * """Get information for rings * */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_10_pixelfunc_1ringinfo, NULL, __pyx_n_s_healpy__pixelfunc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_ringinfo, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 9; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_pixelfunc.pyx":58 * return startpix, ringpix, costheta, sintheta, shifted * * def pix2ring(nside, np.ndarray[int64, ndim=1] pix not None, nest=False): # <<<<<<<<<<<<<< * """Convert pixel identifier to ring number * */ __pyx_t_1 = PyCFunction_NewEx(&__pyx_mdef_6healpy_10_pixelfunc_3pix2ring, NULL, __pyx_n_s_healpy__pixelfunc); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_d, __pyx_n_s_pix2ring, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 58; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "healpy/src/_pixelfunc.pyx":1 * # Wrapper around the geometry methods in Healpix_base class # <<<<<<<<<<<<<< * * import numpy as np */ __pyx_t_1 = PyDict_New(); if (unlikely(!__pyx_t_1)) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_GOTREF(__pyx_t_1); if (PyDict_SetItem(__pyx_t_1, __pyx_kp_u_ringinfo_line_9, __pyx_kp_u_Get_information_for_rings_Rings) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (PyDict_SetItem(__pyx_t_1, __pyx_kp_u_pix2ring_line_58, __pyx_kp_u_Convert_pixel_identifier_to_ring) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} if (PyDict_SetItem(__pyx_d, __pyx_n_s_test, __pyx_t_1) < 0) {__pyx_filename = __pyx_f[0]; __pyx_lineno = 1; __pyx_clineno = __LINE__; goto __pyx_L1_error;} __Pyx_DECREF(__pyx_t_1); __pyx_t_1 = 0; /* "/home/zonca/anaconda/lib/python2.7/site-packages/Cython/Includes/numpy/__init__.pxd":976 * arr.base = baseptr * * cdef inline object get_array_base(ndarray arr): # <<<<<<<<<<<<<< * if arr.base is NULL: * return None */ goto __pyx_L0; __pyx_L1_error:; __Pyx_XDECREF(__pyx_t_1); if (__pyx_m) { __Pyx_AddTraceback("init healpy._pixelfunc", __pyx_clineno, __pyx_lineno, __pyx_filename); Py_DECREF(__pyx_m); __pyx_m = 0; } else if (!PyErr_Occurred()) { PyErr_SetString(PyExc_ImportError, "init healpy._pixelfunc"); } __pyx_L0:; __Pyx_RefNannyFinishContext(); #if PY_MAJOR_VERSION < 3 return; #else return __pyx_m; #endif } /* Runtime support code */ #if CYTHON_REFNANNY static __Pyx_RefNannyAPIStruct *__Pyx_RefNannyImportAPI(const char *modname) { PyObject *m = NULL, *p = NULL; void *r = NULL; m = PyImport_ImportModule((char *)modname); if (!m) goto end; p = PyObject_GetAttrString(m, (char *)"RefNannyAPI"); if (!p) goto end; r = PyLong_AsVoidPtr(p); end: Py_XDECREF(p); Py_XDECREF(m); return (__Pyx_RefNannyAPIStruct *)r; } #endif /* CYTHON_REFNANNY */ static PyObject *__Pyx_GetBuiltinName(PyObject *name) { PyObject* result = __Pyx_PyObject_GetAttrStr(__pyx_b, name); if (unlikely(!result)) { PyErr_Format(PyExc_NameError, #if PY_MAJOR_VERSION >= 3 "name '%U' is not defined", name); #else "name '%.200s' is not defined", PyString_AS_STRING(name)); #endif } return result; } static void __Pyx_RaiseArgtupleInvalid( const char* func_name, int exact, Py_ssize_t num_min, Py_ssize_t num_max, Py_ssize_t num_found) { Py_ssize_t num_expected; const char *more_or_less; if (num_found < num_min) { num_expected = num_min; more_or_less = "at least"; } else { num_expected = num_max; more_or_less = "at most"; } if (exact) { more_or_less = "exactly"; } PyErr_Format(PyExc_TypeError, "%.200s() takes %.8s %" CYTHON_FORMAT_SSIZE_T "d positional argument%.1s (%" CYTHON_FORMAT_SSIZE_T "d given)", func_name, more_or_less, num_expected, (num_expected == 1) ? "" : "s", num_found); } static void __Pyx_RaiseDoubleKeywordsError( const char* func_name, PyObject* kw_name) { PyErr_Format(PyExc_TypeError, #if PY_MAJOR_VERSION >= 3 "%s() got multiple values for keyword argument '%U'", func_name, kw_name); #else "%s() got multiple values for keyword argument '%s'", func_name, PyString_AsString(kw_name)); #endif } static int __Pyx_ParseOptionalKeywords( PyObject *kwds, PyObject **argnames[], PyObject *kwds2, PyObject *values[], Py_ssize_t num_pos_args, const char* function_name) { PyObject *key = 0, *value = 0; Py_ssize_t pos = 0; PyObject*** name; PyObject*** first_kw_arg = argnames + num_pos_args; while (PyDict_Next(kwds, &pos, &key, &value)) { name = first_kw_arg; while (*name && (**name != key)) name++; if (*name) { values[name-argnames] = value; continue; } name = first_kw_arg; #if PY_MAJOR_VERSION < 3 if (likely(PyString_CheckExact(key)) || likely(PyString_Check(key))) { while (*name) { if ((CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**name) == PyString_GET_SIZE(key)) && _PyString_Eq(**name, key)) { values[name-argnames] = value; break; } name++; } if (*name) continue; else { PyObject*** argname = argnames; while (argname != first_kw_arg) { if ((**argname == key) || ( (CYTHON_COMPILING_IN_PYPY || PyString_GET_SIZE(**argname) == PyString_GET_SIZE(key)) && _PyString_Eq(**argname, key))) { goto arg_passed_twice; } argname++; } } } else #endif if (likely(PyUnicode_Check(key))) { while (*name) { int cmp = (**name == key) ? 0 : #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3 (PyUnicode_GET_SIZE(**name) != PyUnicode_GET_SIZE(key)) ? 1 : #endif PyUnicode_Compare(**name, key); if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad; if (cmp == 0) { values[name-argnames] = value; break; } name++; } if (*name) continue; else { PyObject*** argname = argnames; while (argname != first_kw_arg) { int cmp = (**argname == key) ? 0 : #if !CYTHON_COMPILING_IN_PYPY && PY_MAJOR_VERSION >= 3 (PyUnicode_GET_SIZE(**argname) != PyUnicode_GET_SIZE(key)) ? 1 : #endif PyUnicode_Compare(**argname, key); if (cmp < 0 && unlikely(PyErr_Occurred())) goto bad; if (cmp == 0) goto arg_passed_twice; argname++; } } } else goto invalid_keyword_type; if (kwds2) { if (unlikely(PyDict_SetItem(kwds2, key, value))) goto bad; } else { goto invalid_keyword; } } return 0; arg_passed_twice: __Pyx_RaiseDoubleKeywordsError(function_name, key); goto bad; invalid_keyword_type: PyErr_Format(PyExc_TypeError, "%.200s() keywords must be strings", function_name); goto bad; invalid_keyword: PyErr_Format(PyExc_TypeError, #if PY_MAJOR_VERSION < 3 "%.200s() got an unexpected keyword argument '%.200s'", function_name, PyString_AsString(key)); #else "%s() got an unexpected keyword argument '%U'", function_name, key); #endif bad: return -1; } static void __Pyx_RaiseArgumentTypeInvalid(const char* name, PyObject *obj, PyTypeObject *type) { PyErr_Format(PyExc_TypeError, "Argument '%.200s' has incorrect type (expected %.200s, got %.200s)", name, type->tp_name, Py_TYPE(obj)->tp_name); } static CYTHON_INLINE int __Pyx_ArgTypeTest(PyObject *obj, PyTypeObject *type, int none_allowed, const char *name, int exact) { if (unlikely(!type)) { PyErr_SetString(PyExc_SystemError, "Missing type object"); return 0; } if (none_allowed && obj == Py_None) return 1; else if (exact) { if (likely(Py_TYPE(obj) == type)) return 1; #if PY_MAJOR_VERSION == 2 else if ((type == &PyBaseString_Type) && likely(__Pyx_PyBaseString_CheckExact(obj))) return 1; #endif } else { if (likely(PyObject_TypeCheck(obj, type))) return 1; } __Pyx_RaiseArgumentTypeInvalid(name, obj, type); return 0; } static CYTHON_INLINE int __Pyx_IsLittleEndian(void) { unsigned int n = 1; return *(unsigned char*)(&n) != 0; } static void __Pyx_BufFmt_Init(__Pyx_BufFmt_Context* ctx, __Pyx_BufFmt_StackElem* stack, __Pyx_TypeInfo* type) { stack[0].field = &ctx->root; stack[0].parent_offset = 0; ctx->root.type = type; ctx->root.name = "buffer dtype"; ctx->root.offset = 0; ctx->head = stack; ctx->head->field = &ctx->root; ctx->fmt_offset = 0; ctx->head->parent_offset = 0; ctx->new_packmode = '@'; ctx->enc_packmode = '@'; ctx->new_count = 1; ctx->enc_count = 0; ctx->enc_type = 0; ctx->is_complex = 0; ctx->is_valid_array = 0; ctx->struct_alignment = 0; while (type->typegroup == 'S') { ++ctx->head; ctx->head->field = type->fields; ctx->head->parent_offset = 0; type = type->fields->type; } } static int __Pyx_BufFmt_ParseNumber(const char** ts) { int count; const char* t = *ts; if (*t < '0' || *t > '9') { return -1; } else { count = *t++ - '0'; while (*t >= '0' && *t < '9') { count *= 10; count += *t++ - '0'; } } *ts = t; return count; } static int __Pyx_BufFmt_ExpectNumber(const char **ts) { int number = __Pyx_BufFmt_ParseNumber(ts); if (number == -1) /* First char was not a digit */ PyErr_Format(PyExc_ValueError,\ "Does not understand character buffer dtype format string ('%c')", **ts); return number; } static void __Pyx_BufFmt_RaiseUnexpectedChar(char ch) { PyErr_Format(PyExc_ValueError, "Unexpected format string character: '%c'", ch); } static const char* __Pyx_BufFmt_DescribeTypeChar(char ch, int is_complex) { switch (ch) { case 'c': return "'char'"; case 'b': return "'signed char'"; case 'B': return "'unsigned char'"; case 'h': return "'short'"; case 'H': return "'unsigned short'"; case 'i': return "'int'"; case 'I': return "'unsigned int'"; case 'l': return "'long'"; case 'L': return "'unsigned long'"; case 'q': return "'long long'"; case 'Q': return "'unsigned long long'"; case 'f': return (is_complex ? "'complex float'" : "'float'"); case 'd': return (is_complex ? "'complex double'" : "'double'"); case 'g': return (is_complex ? "'complex long double'" : "'long double'"); case 'T': return "a struct"; case 'O': return "Python object"; case 'P': return "a pointer"; case 's': case 'p': return "a string"; case 0: return "end"; default: return "unparseable format string"; } } static size_t __Pyx_BufFmt_TypeCharToStandardSize(char ch, int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return 2; case 'i': case 'I': case 'l': case 'L': return 4; case 'q': case 'Q': return 8; case 'f': return (is_complex ? 8 : 4); case 'd': return (is_complex ? 16 : 8); case 'g': { PyErr_SetString(PyExc_ValueError, "Python does not define a standard format string size for long double ('g').."); return 0; } case 'O': case 'P': return sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } static size_t __Pyx_BufFmt_TypeCharToNativeSize(char ch, int is_complex) { switch (ch) { case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(short); case 'i': case 'I': return sizeof(int); case 'l': case 'L': return sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(float) * (is_complex ? 2 : 1); case 'd': return sizeof(double) * (is_complex ? 2 : 1); case 'g': return sizeof(long double) * (is_complex ? 2 : 1); case 'O': case 'P': return sizeof(void*); default: { __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } } typedef struct { char c; short x; } __Pyx_st_short; typedef struct { char c; int x; } __Pyx_st_int; typedef struct { char c; long x; } __Pyx_st_long; typedef struct { char c; float x; } __Pyx_st_float; typedef struct { char c; double x; } __Pyx_st_double; typedef struct { char c; long double x; } __Pyx_st_longdouble; typedef struct { char c; void *x; } __Pyx_st_void_p; #ifdef HAVE_LONG_LONG typedef struct { char c; PY_LONG_LONG x; } __Pyx_st_longlong; #endif static size_t __Pyx_BufFmt_TypeCharToAlignment(char ch, CYTHON_UNUSED int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(__Pyx_st_short) - sizeof(short); case 'i': case 'I': return sizeof(__Pyx_st_int) - sizeof(int); case 'l': case 'L': return sizeof(__Pyx_st_long) - sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(__Pyx_st_longlong) - sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(__Pyx_st_float) - sizeof(float); case 'd': return sizeof(__Pyx_st_double) - sizeof(double); case 'g': return sizeof(__Pyx_st_longdouble) - sizeof(long double); case 'P': case 'O': return sizeof(__Pyx_st_void_p) - sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } /* These are for computing the padding at the end of the struct to align on the first member of the struct. This will probably the same as above, but we don't have any guarantees. */ typedef struct { short x; char c; } __Pyx_pad_short; typedef struct { int x; char c; } __Pyx_pad_int; typedef struct { long x; char c; } __Pyx_pad_long; typedef struct { float x; char c; } __Pyx_pad_float; typedef struct { double x; char c; } __Pyx_pad_double; typedef struct { long double x; char c; } __Pyx_pad_longdouble; typedef struct { void *x; char c; } __Pyx_pad_void_p; #ifdef HAVE_LONG_LONG typedef struct { PY_LONG_LONG x; char c; } __Pyx_pad_longlong; #endif static size_t __Pyx_BufFmt_TypeCharToPadding(char ch, CYTHON_UNUSED int is_complex) { switch (ch) { case '?': case 'c': case 'b': case 'B': case 's': case 'p': return 1; case 'h': case 'H': return sizeof(__Pyx_pad_short) - sizeof(short); case 'i': case 'I': return sizeof(__Pyx_pad_int) - sizeof(int); case 'l': case 'L': return sizeof(__Pyx_pad_long) - sizeof(long); #ifdef HAVE_LONG_LONG case 'q': case 'Q': return sizeof(__Pyx_pad_longlong) - sizeof(PY_LONG_LONG); #endif case 'f': return sizeof(__Pyx_pad_float) - sizeof(float); case 'd': return sizeof(__Pyx_pad_double) - sizeof(double); case 'g': return sizeof(__Pyx_pad_longdouble) - sizeof(long double); case 'P': case 'O': return sizeof(__Pyx_pad_void_p) - sizeof(void*); default: __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } static char __Pyx_BufFmt_TypeCharToGroup(char ch, int is_complex) { switch (ch) { case 'c': return 'H'; case 'b': case 'h': case 'i': case 'l': case 'q': case 's': case 'p': return 'I'; case 'B': case 'H': case 'I': case 'L': case 'Q': return 'U'; case 'f': case 'd': case 'g': return (is_complex ? 'C' : 'R'); case 'O': return 'O'; case 'P': return 'P'; default: { __Pyx_BufFmt_RaiseUnexpectedChar(ch); return 0; } } } static void __Pyx_BufFmt_RaiseExpected(__Pyx_BufFmt_Context* ctx) { if (ctx->head == NULL || ctx->head->field == &ctx->root) { const char* expected; const char* quote; if (ctx->head == NULL) { expected = "end"; quote = ""; } else { expected = ctx->head->field->type->name; quote = "'"; } PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch, expected %s%s%s but got %s", quote, expected, quote, __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex)); } else { __Pyx_StructField* field = ctx->head->field; __Pyx_StructField* parent = (ctx->head - 1)->field; PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch, expected '%s' but got %s in '%s.%s'", field->type->name, __Pyx_BufFmt_DescribeTypeChar(ctx->enc_type, ctx->is_complex), parent->type->name, field->name); } } static int __Pyx_BufFmt_ProcessTypeChunk(__Pyx_BufFmt_Context* ctx) { char group; size_t size, offset, arraysize = 1; if (ctx->enc_type == 0) return 0; if (ctx->head->field->type->arraysize[0]) { int i, ndim = 0; if (ctx->enc_type == 's' || ctx->enc_type == 'p') { ctx->is_valid_array = ctx->head->field->type->ndim == 1; ndim = 1; if (ctx->enc_count != ctx->head->field->type->arraysize[0]) { PyErr_Format(PyExc_ValueError, "Expected a dimension of size %zu, got %zu", ctx->head->field->type->arraysize[0], ctx->enc_count); return -1; } } if (!ctx->is_valid_array) { PyErr_Format(PyExc_ValueError, "Expected %d dimensions, got %d", ctx->head->field->type->ndim, ndim); return -1; } for (i = 0; i < ctx->head->field->type->ndim; i++) { arraysize *= ctx->head->field->type->arraysize[i]; } ctx->is_valid_array = 0; ctx->enc_count = 1; } group = __Pyx_BufFmt_TypeCharToGroup(ctx->enc_type, ctx->is_complex); do { __Pyx_StructField* field = ctx->head->field; __Pyx_TypeInfo* type = field->type; if (ctx->enc_packmode == '@' || ctx->enc_packmode == '^') { size = __Pyx_BufFmt_TypeCharToNativeSize(ctx->enc_type, ctx->is_complex); } else { size = __Pyx_BufFmt_TypeCharToStandardSize(ctx->enc_type, ctx->is_complex); } if (ctx->enc_packmode == '@') { size_t align_at = __Pyx_BufFmt_TypeCharToAlignment(ctx->enc_type, ctx->is_complex); size_t align_mod_offset; if (align_at == 0) return -1; align_mod_offset = ctx->fmt_offset % align_at; if (align_mod_offset > 0) ctx->fmt_offset += align_at - align_mod_offset; if (ctx->struct_alignment == 0) ctx->struct_alignment = __Pyx_BufFmt_TypeCharToPadding(ctx->enc_type, ctx->is_complex); } if (type->size != size || type->typegroup != group) { if (type->typegroup == 'C' && type->fields != NULL) { size_t parent_offset = ctx->head->parent_offset + field->offset; ++ctx->head; ctx->head->field = type->fields; ctx->head->parent_offset = parent_offset; continue; } if ((type->typegroup == 'H' || group == 'H') && type->size == size) { } else { __Pyx_BufFmt_RaiseExpected(ctx); return -1; } } offset = ctx->head->parent_offset + field->offset; if (ctx->fmt_offset != offset) { PyErr_Format(PyExc_ValueError, "Buffer dtype mismatch; next field is at offset %" CYTHON_FORMAT_SSIZE_T "d but %" CYTHON_FORMAT_SSIZE_T "d expected", (Py_ssize_t)ctx->fmt_offset, (Py_ssize_t)offset); return -1; } ctx->fmt_offset += size; if (arraysize) ctx->fmt_offset += (arraysize - 1) * size; --ctx->enc_count; /* Consume from buffer string */ while (1) { if (field == &ctx->root) { ctx->head = NULL; if (ctx->enc_count != 0) { __Pyx_BufFmt_RaiseExpected(ctx); return -1; } break; /* breaks both loops as ctx->enc_count == 0 */ } ctx->head->field = ++field; if (field->type == NULL) { --ctx->head; field = ctx->head->field; continue; } else if (field->type->typegroup == 'S') { size_t parent_offset = ctx->head->parent_offset + field->offset; if (field->type->fields->type == NULL) continue; /* empty struct */ field = field->type->fields; ++ctx->head; ctx->head->field = field; ctx->head->parent_offset = parent_offset; break; } else { break; } } } while (ctx->enc_count); ctx->enc_type = 0; ctx->is_complex = 0; return 0; } static CYTHON_INLINE PyObject * __pyx_buffmt_parse_array(__Pyx_BufFmt_Context* ctx, const char** tsp) { const char *ts = *tsp; int i = 0, number; int ndim = ctx->head->field->type->ndim; ; ++ts; if (ctx->new_count != 1) { PyErr_SetString(PyExc_ValueError, "Cannot handle repeated arrays in format string"); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; while (*ts && *ts != ')') { switch (*ts) { case ' ': case '\f': case '\r': case '\n': case '\t': case '\v': continue; default: break; /* not a 'break' in the loop */ } number = __Pyx_BufFmt_ExpectNumber(&ts); if (number == -1) return NULL; if (i < ndim && (size_t) number != ctx->head->field->type->arraysize[i]) return PyErr_Format(PyExc_ValueError, "Expected a dimension of size %zu, got %d", ctx->head->field->type->arraysize[i], number); if (*ts != ',' && *ts != ')') return PyErr_Format(PyExc_ValueError, "Expected a comma in format string, got '%c'", *ts); if (*ts == ',') ts++; i++; } if (i != ndim) return PyErr_Format(PyExc_ValueError, "Expected %d dimension(s), got %d", ctx->head->field->type->ndim, i); if (!*ts) { PyErr_SetString(PyExc_ValueError, "Unexpected end of format string, expected ')'"); return NULL; } ctx->is_valid_array = 1; ctx->new_count = 1; *tsp = ++ts; return Py_None; } static const char* __Pyx_BufFmt_CheckString(__Pyx_BufFmt_Context* ctx, const char* ts) { int got_Z = 0; while (1) { switch(*ts) { case 0: if (ctx->enc_type != 0 && ctx->head == NULL) { __Pyx_BufFmt_RaiseExpected(ctx); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; if (ctx->head != NULL) { __Pyx_BufFmt_RaiseExpected(ctx); return NULL; } return ts; case ' ': case 10: case 13: ++ts; break; case '<': if (!__Pyx_IsLittleEndian()) { PyErr_SetString(PyExc_ValueError, "Little-endian buffer not supported on big-endian compiler"); return NULL; } ctx->new_packmode = '='; ++ts; break; case '>': case '!': if (__Pyx_IsLittleEndian()) { PyErr_SetString(PyExc_ValueError, "Big-endian buffer not supported on little-endian compiler"); return NULL; } ctx->new_packmode = '='; ++ts; break; case '=': case '@': case '^': ctx->new_packmode = *ts++; break; case 'T': /* substruct */ { const char* ts_after_sub; size_t i, struct_count = ctx->new_count; size_t struct_alignment = ctx->struct_alignment; ctx->new_count = 1; ++ts; if (*ts != '{') { PyErr_SetString(PyExc_ValueError, "Buffer acquisition: Expected '{' after 'T'"); return NULL; } if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_type = 0; /* Erase processed last struct element */ ctx->enc_count = 0; ctx->struct_alignment = 0; ++ts; ts_after_sub = ts; for (i = 0; i != struct_count; ++i) { ts_after_sub = __Pyx_BufFmt_CheckString(ctx, ts); if (!ts_after_sub) return NULL; } ts = ts_after_sub; if (struct_alignment) ctx->struct_alignment = struct_alignment; } break; case '}': /* end of substruct; either repeat or move on */ { size_t alignment = ctx->struct_alignment; ++ts; if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_type = 0; /* Erase processed last struct element */ if (alignment && ctx->fmt_offset % alignment) { ctx->fmt_offset += alignment - (ctx->fmt_offset % alignment); } } return ts; case 'x': if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->fmt_offset += ctx->new_count; ctx->new_count = 1; ctx->enc_count = 0; ctx->enc_type = 0; ctx->enc_packmode = ctx->new_packmode; ++ts; break; case 'Z': got_Z = 1; ++ts; if (*ts != 'f' && *ts != 'd' && *ts != 'g') { __Pyx_BufFmt_RaiseUnexpectedChar('Z'); return NULL; } /* fall through */ case 'c': case 'b': case 'B': case 'h': case 'H': case 'i': case 'I': case 'l': case 'L': case 'q': case 'Q': case 'f': case 'd': case 'g': case 'O': case 's': case 'p': if (ctx->enc_type == *ts && got_Z == ctx->is_complex && ctx->enc_packmode == ctx->new_packmode) { ctx->enc_count += ctx->new_count; } else { if (__Pyx_BufFmt_ProcessTypeChunk(ctx) == -1) return NULL; ctx->enc_count = ctx->new_count; ctx->enc_packmode = ctx->new_packmode; ctx->enc_type = *ts; ctx->is_complex = got_Z; } ++ts; ctx->new_count = 1; got_Z = 0; break; case ':': ++ts; while(*ts != ':') ++ts; ++ts; break; case '(': if (!__pyx_buffmt_parse_array(ctx, &ts)) return NULL; break; default: { int number = __Pyx_BufFmt_ExpectNumber(&ts); if (number == -1) return NULL; ctx->new_count = (size_t)number; } } } } static CYTHON_INLINE void __Pyx_ZeroBuffer(Py_buffer* buf) { buf->buf = NULL; buf->obj = NULL; buf->strides = __Pyx_zeros; buf->shape = __Pyx_zeros; buf->suboffsets = __Pyx_minusones; } static CYTHON_INLINE int __Pyx_GetBufferAndValidate( Py_buffer* buf, PyObject* obj, __Pyx_TypeInfo* dtype, int flags, int nd, int cast, __Pyx_BufFmt_StackElem* stack) { if (obj == Py_None || obj == NULL) { __Pyx_ZeroBuffer(buf); return 0; } buf->buf = NULL; if (__Pyx_GetBuffer(obj, buf, flags) == -1) goto fail; if (buf->ndim != nd) { PyErr_Format(PyExc_ValueError, "Buffer has wrong number of dimensions (expected %d, got %d)", nd, buf->ndim); goto fail; } if (!cast) { __Pyx_BufFmt_Context ctx; __Pyx_BufFmt_Init(&ctx, stack, dtype); if (!__Pyx_BufFmt_CheckString(&ctx, buf->format)) goto fail; } if ((unsigned)buf->itemsize != dtype->size) { PyErr_Format(PyExc_ValueError, "Item size of buffer (%" CYTHON_FORMAT_SSIZE_T "d byte%s) does not match size of '%s' (%" CYTHON_FORMAT_SSIZE_T "d byte%s)", buf->itemsize, (buf->itemsize > 1) ? "s" : "", dtype->name, (Py_ssize_t)dtype->size, (dtype->size > 1) ? "s" : ""); goto fail; } if (buf->suboffsets == NULL) buf->suboffsets = __Pyx_minusones; return 0; fail:; __Pyx_ZeroBuffer(buf); return -1; } static CYTHON_INLINE void __Pyx_SafeReleaseBuffer(Py_buffer* info) { if (info->buf == NULL) return; if (info->suboffsets == __Pyx_minusones) info->suboffsets = NULL; __Pyx_ReleaseBuffer(info); } #if CYTHON_COMPILING_IN_CPYTHON static CYTHON_INLINE PyObject* __Pyx_PyObject_Call(PyObject *func, PyObject *arg, PyObject *kw) { PyObject *result; ternaryfunc call = func->ob_type->tp_call; if (unlikely(!call)) return PyObject_Call(func, arg, kw); #if PY_VERSION_HEX >= 0x02060000 if (unlikely(Py_EnterRecursiveCall((char*)" while calling a Python object"))) return NULL; #endif result = (*call)(func, arg, kw); #if PY_VERSION_HEX >= 0x02060000 Py_LeaveRecursiveCall(); #endif if (unlikely(!result) && unlikely(!PyErr_Occurred())) { PyErr_SetString( PyExc_SystemError, "NULL result without error in PyObject_Call"); } return result; } #endif static CYTHON_INLINE void __Pyx_ErrRestore(PyObject *type, PyObject *value, PyObject *tb) { #if CYTHON_COMPILING_IN_CPYTHON PyObject *tmp_type, *tmp_value, *tmp_tb; PyThreadState *tstate = PyThreadState_GET(); tmp_type = tstate->curexc_type; tmp_value = tstate->curexc_value; tmp_tb = tstate->curexc_traceback; tstate->curexc_type = type; tstate->curexc_value = value; tstate->curexc_traceback = tb; Py_XDECREF(tmp_type); Py_XDECREF(tmp_value); Py_XDECREF(tmp_tb); #else PyErr_Restore(type, value, tb); #endif } static CYTHON_INLINE void __Pyx_ErrFetch(PyObject **type, PyObject **value, PyObject **tb) { #if CYTHON_COMPILING_IN_CPYTHON PyThreadState *tstate = PyThreadState_GET(); *type = tstate->curexc_type; *value = tstate->curexc_value; *tb = tstate->curexc_traceback; tstate->curexc_type = 0; tstate->curexc_value = 0; tstate->curexc_traceback = 0; #else PyErr_Fetch(type, value, tb); #endif } #if PY_MAJOR_VERSION < 3 static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, CYTHON_UNUSED PyObject *cause) { Py_XINCREF(type); if (!value || value == Py_None) value = NULL; else Py_INCREF(value); if (!tb || tb == Py_None) tb = NULL; else { Py_INCREF(tb); if (!PyTraceBack_Check(tb)) { PyErr_SetString(PyExc_TypeError, "raise: arg 3 must be a traceback or None"); goto raise_error; } } #if PY_VERSION_HEX < 0x02050000 if (PyClass_Check(type)) { #else if (PyType_Check(type)) { #endif #if CYTHON_COMPILING_IN_PYPY if (!value) { Py_INCREF(Py_None); value = Py_None; } #endif PyErr_NormalizeException(&type, &value, &tb); } else { if (value) { PyErr_SetString(PyExc_TypeError, "instance exception may not have a separate value"); goto raise_error; } value = type; #if PY_VERSION_HEX < 0x02050000 if (PyInstance_Check(type)) { type = (PyObject*) ((PyInstanceObject*)type)->in_class; Py_INCREF(type); } else { type = 0; PyErr_SetString(PyExc_TypeError, "raise: exception must be an old-style class or instance"); goto raise_error; } #else type = (PyObject*) Py_TYPE(type); Py_INCREF(type); if (!PyType_IsSubtype((PyTypeObject *)type, (PyTypeObject *)PyExc_BaseException)) { PyErr_SetString(PyExc_TypeError, "raise: exception class must be a subclass of BaseException"); goto raise_error; } #endif } __Pyx_ErrRestore(type, value, tb); return; raise_error: Py_XDECREF(value); Py_XDECREF(type); Py_XDECREF(tb); return; } #else /* Python 3+ */ static void __Pyx_Raise(PyObject *type, PyObject *value, PyObject *tb, PyObject *cause) { PyObject* owned_instance = NULL; if (tb == Py_None) { tb = 0; } else if (tb && !PyTraceBack_Check(tb)) { PyErr_SetString(PyExc_TypeError, "raise: arg 3 must be a traceback or None"); goto bad; } if (value == Py_None) value = 0; if (PyExceptionInstance_Check(type)) { if (value) { PyErr_SetString(PyExc_TypeError, "instance exception may not have a separate value"); goto bad; } value = type; type = (PyObject*) Py_TYPE(value); } else if (PyExceptionClass_Check(type)) { PyObject *instance_class = NULL; if (value && PyExceptionInstance_Check(value)) { instance_class = (PyObject*) Py_TYPE(value); if (instance_class != type) { if (PyObject_IsSubclass(instance_class, type)) { type = instance_class; } else { instance_class = NULL; } } } if (!instance_class) { PyObject *args; if (!value) args = PyTuple_New(0); else if (PyTuple_Check(value)) { Py_INCREF(value); args = value; } else args = PyTuple_Pack(1, value); if (!args) goto bad; owned_instance = PyObject_Call(type, args, NULL); Py_DECREF(args); if (!owned_instance) goto bad; value = owned_instance; if (!PyExceptionInstance_Check(value)) { PyErr_Format(PyExc_TypeError, "calling %R should have returned an instance of " "BaseException, not %R", type, Py_TYPE(value)); goto bad; } } } else { PyErr_SetString(PyExc_TypeError, "raise: exception class must be a subclass of BaseException"); goto bad; } #if PY_VERSION_HEX >= 0x03030000 if (cause) { #else if (cause && cause != Py_None) { #endif PyObject *fixed_cause; if (cause == Py_None) { fixed_cause = NULL; } else if (PyExceptionClass_Check(cause)) { fixed_cause = PyObject_CallObject(cause, NULL); if (fixed_cause == NULL) goto bad; } else if (PyExceptionInstance_Check(cause)) { fixed_cause = cause; Py_INCREF(fixed_cause); } else { PyErr_SetString(PyExc_TypeError, "exception causes must derive from " "BaseException"); goto bad; } PyException_SetCause(value, fixed_cause); } PyErr_SetObject(type, value); if (tb) { PyThreadState *tstate = PyThreadState_GET(); PyObject* tmp_tb = tstate->curexc_traceback; if (tb != tmp_tb) { Py_INCREF(tb); tstate->curexc_traceback = tb; Py_XDECREF(tmp_tb); } } bad: Py_XDECREF(owned_instance); return; } #endif static CYTHON_INLINE PyObject *__Pyx_GetModuleGlobalName(PyObject *name) { PyObject *result; #if CYTHON_COMPILING_IN_CPYTHON result = PyDict_GetItem(__pyx_d, name); if (result) { Py_INCREF(result); } else { #else result = PyObject_GetItem(__pyx_d, name); if (!result) { PyErr_Clear(); #endif result = __Pyx_GetBuiltinName(name); } return result; } static CYTHON_INLINE int __Pyx_TypeTest(PyObject *obj, PyTypeObject *type) { if (unlikely(!type)) { PyErr_SetString(PyExc_SystemError, "Missing type object"); return 0; } if (likely(PyObject_TypeCheck(obj, type))) return 1; PyErr_Format(PyExc_TypeError, "Cannot convert %.200s to %.200s", Py_TYPE(obj)->tp_name, type->tp_name); return 0; } static void __Pyx_RaiseBufferIndexError(int axis) { PyErr_Format(PyExc_IndexError, "Out of bounds on buffer access (axis %d)", axis); } static void __Pyx_WriteUnraisable(const char *name, CYTHON_UNUSED int clineno, CYTHON_UNUSED int lineno, CYTHON_UNUSED const char *filename, int full_traceback) { PyObject *old_exc, *old_val, *old_tb; PyObject *ctx; __Pyx_ErrFetch(&old_exc, &old_val, &old_tb); if (full_traceback) { Py_XINCREF(old_exc); Py_XINCREF(old_val); Py_XINCREF(old_tb); __Pyx_ErrRestore(old_exc, old_val, old_tb); PyErr_PrintEx(1); } #if PY_MAJOR_VERSION < 3 ctx = PyString_FromString(name); #else ctx = PyUnicode_FromString(name); #endif __Pyx_ErrRestore(old_exc, old_val, old_tb); if (!ctx) { PyErr_WriteUnraisable(Py_None); } else { PyErr_WriteUnraisable(ctx); Py_DECREF(ctx); } } static CYTHON_INLINE void __Pyx_RaiseTooManyValuesError(Py_ssize_t expected) { PyErr_Format(PyExc_ValueError, "too many values to unpack (expected %" CYTHON_FORMAT_SSIZE_T "d)", expected); } static CYTHON_INLINE void __Pyx_RaiseNeedMoreValuesError(Py_ssize_t index) { PyErr_Format(PyExc_ValueError, "need more than %" CYTHON_FORMAT_SSIZE_T "d value%.1s to unpack", index, (index == 1) ? "" : "s"); } static CYTHON_INLINE void __Pyx_RaiseNoneNotIterableError(void) { PyErr_SetString(PyExc_TypeError, "'NoneType' object is not iterable"); } #if PY_MAJOR_VERSION < 3 static int __Pyx_GetBuffer(PyObject *obj, Py_buffer *view, int flags) { #if PY_VERSION_HEX >= 0x02060000 if (PyObject_CheckBuffer(obj)) return PyObject_GetBuffer(obj, view, flags); #endif if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) return __pyx_pw_5numpy_7ndarray_1__getbuffer__(obj, view, flags); #if PY_VERSION_HEX < 0x02060000 if (obj->ob_type->tp_dict) { PyObject *getbuffer_cobj = PyObject_GetItem( obj->ob_type->tp_dict, __pyx_n_s_pyx_getbuffer); if (getbuffer_cobj) { getbufferproc func = (getbufferproc) PyCObject_AsVoidPtr(getbuffer_cobj); Py_DECREF(getbuffer_cobj); if (!func) goto fail; return func(obj, view, flags); } else { PyErr_Clear(); } } #endif PyErr_Format(PyExc_TypeError, "'%.200s' does not have the buffer interface", Py_TYPE(obj)->tp_name); #if PY_VERSION_HEX < 0x02060000 fail: #endif return -1; } static void __Pyx_ReleaseBuffer(Py_buffer *view) { PyObject *obj = view->obj; if (!obj) return; #if PY_VERSION_HEX >= 0x02060000 if (PyObject_CheckBuffer(obj)) { PyBuffer_Release(view); return; } #endif if (PyObject_TypeCheck(obj, __pyx_ptype_5numpy_ndarray)) { __pyx_pw_5numpy_7ndarray_3__releasebuffer__(obj, view); return; } #if PY_VERSION_HEX < 0x02060000 if (obj->ob_type->tp_dict) { PyObject *releasebuffer_cobj = PyObject_GetItem( obj->ob_type->tp_dict, __pyx_n_s_pyx_releasebuffer); if (releasebuffer_cobj) { releasebufferproc func = (releasebufferproc) PyCObject_AsVoidPtr(releasebuffer_cobj); Py_DECREF(releasebuffer_cobj); if (!func) goto fail; func(obj, view); return; } else { PyErr_Clear(); } } #endif goto nofail; #if PY_VERSION_HEX < 0x02060000 fail: #endif PyErr_WriteUnraisable(obj); nofail: Py_DECREF(obj); view->obj = NULL; } #endif /* PY_MAJOR_VERSION < 3 */ static PyObject *__Pyx_Import(PyObject *name, PyObject *from_list, int level) { PyObject *empty_list = 0; PyObject *module = 0; PyObject *global_dict = 0; PyObject *empty_dict = 0; PyObject *list; #if PY_VERSION_HEX < 0x03030000 PyObject *py_import; py_import = __Pyx_PyObject_GetAttrStr(__pyx_b, __pyx_n_s_import); if (!py_import) goto bad; #endif if (from_list) list = from_list; else { empty_list = PyList_New(0); if (!empty_list) goto bad; list = empty_list; } global_dict = PyModule_GetDict(__pyx_m); if (!global_dict) goto bad; empty_dict = PyDict_New(); if (!empty_dict) goto bad; #if PY_VERSION_HEX >= 0x02050000 { #if PY_MAJOR_VERSION >= 3 if (level == -1) { if (strchr(__Pyx_MODULE_NAME, '.')) { #if PY_VERSION_HEX < 0x03030000 PyObject *py_level = PyInt_FromLong(1); if (!py_level) goto bad; module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, py_level, NULL); Py_DECREF(py_level); #else module = PyImport_ImportModuleLevelObject( name, global_dict, empty_dict, list, 1); #endif if (!module) { if (!PyErr_ExceptionMatches(PyExc_ImportError)) goto bad; PyErr_Clear(); } } level = 0; /* try absolute import on failure */ } #endif if (!module) { #if PY_VERSION_HEX < 0x03030000 PyObject *py_level = PyInt_FromLong(level); if (!py_level) goto bad; module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, py_level, NULL); Py_DECREF(py_level); #else module = PyImport_ImportModuleLevelObject( name, global_dict, empty_dict, list, level); #endif } } #else if (level>0) { PyErr_SetString(PyExc_RuntimeError, "Relative import is not supported for Python <=2.4."); goto bad; } module = PyObject_CallFunctionObjArgs(py_import, name, global_dict, empty_dict, list, NULL); #endif bad: #if PY_VERSION_HEX < 0x03030000 Py_XDECREF(py_import); #endif Py_XDECREF(empty_list); Py_XDECREF(empty_dict); return module; } #define __PYX_VERIFY_RETURN_INT(target_type, func_type, func) \ { \ func_type value = func(x); \ if (sizeof(target_type) < sizeof(func_type)) { \ if (unlikely(value != (func_type) (target_type) value)) { \ func_type zero = 0; \ PyErr_SetString(PyExc_OverflowError, \ (is_unsigned && unlikely(value < zero)) ? \ "can't convert negative value to " #target_type : \ "value too large to convert to " #target_type); \ return (target_type) -1; \ } \ } \ return (target_type) value; \ } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE int __Pyx_PyInt_As_int(PyObject *x) { const int neg_one = (int) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(int) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(int, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int"); return (int) -1; } return (int) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (int) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int"); return (int) -1; } if (sizeof(int) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(int, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(int) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(int, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(int) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(int) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(int) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(int, long, PyLong_AsLong) } else if (sizeof(int) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(int, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else int val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (int) -1; } } else { int val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (int) -1; val = __Pyx_PyInt_As_int(tmp); Py_DECREF(tmp); return val; } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE int64 __Pyx_PyInt_As_int64(PyObject *x) { const int64 neg_one = (int64) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(int64) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(int64, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int64"); return (int64) -1; } return (int64) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int64)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (int64) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to int64"); return (int64) -1; } if (sizeof(int64) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(int64, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(int64) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(int64, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(int64)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(int64) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(int64) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(int64) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(int64, long, PyLong_AsLong) } else if (sizeof(int64) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(int64, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else int64 val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (int64) -1; } } else { int64 val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (int64) -1; val = __Pyx_PyInt_As_int64(tmp); Py_DECREF(tmp); return val; } } static CYTHON_INLINE PyObject* __Pyx_PyInt_From_Py_intptr_t(Py_intptr_t value) { const Py_intptr_t neg_one = (Py_intptr_t) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(Py_intptr_t) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(Py_intptr_t) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(Py_intptr_t) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(Py_intptr_t) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(Py_intptr_t) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(Py_intptr_t), little, !is_unsigned); } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE Py_intptr_t __Pyx_PyInt_As_Py_intptr_t(PyObject *x) { const Py_intptr_t neg_one = (Py_intptr_t) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(Py_intptr_t) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(Py_intptr_t, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to Py_intptr_t"); return (Py_intptr_t) -1; } return (Py_intptr_t) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(Py_intptr_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (Py_intptr_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to Py_intptr_t"); return (Py_intptr_t) -1; } if (sizeof(Py_intptr_t) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(Py_intptr_t, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(Py_intptr_t) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(Py_intptr_t, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(Py_intptr_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(Py_intptr_t) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(Py_intptr_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(Py_intptr_t) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(Py_intptr_t, long, PyLong_AsLong) } else if (sizeof(Py_intptr_t) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(Py_intptr_t, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else Py_intptr_t val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (Py_intptr_t) -1; } } else { Py_intptr_t val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (Py_intptr_t) -1; val = __Pyx_PyInt_As_Py_intptr_t(tmp); Py_DECREF(tmp); return val; } } static CYTHON_INLINE PyObject* __Pyx_PyInt_From_int(int value) { const int neg_one = (int) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(int) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(int) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(int) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(int) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(int), little, !is_unsigned); } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE size_t __Pyx_PyInt_As_size_t(PyObject *x) { const size_t neg_one = (size_t) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(size_t) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(size_t, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to size_t"); return (size_t) -1; } return (size_t) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(size_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (size_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to size_t"); return (size_t) -1; } if (sizeof(size_t) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(size_t, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(size_t) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(size_t, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(size_t)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(size_t) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(size_t) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(size_t) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(size_t, long, PyLong_AsLong) } else if (sizeof(size_t) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(size_t, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else size_t val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (size_t) -1; } } else { size_t val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (size_t) -1; val = __Pyx_PyInt_As_size_t(tmp); Py_DECREF(tmp); return val; } } #if CYTHON_CCOMPLEX #ifdef __cplusplus static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { return ::std::complex< float >(x, y); } #else static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { return x + y*(__pyx_t_float_complex)_Complex_I; } #endif #else static CYTHON_INLINE __pyx_t_float_complex __pyx_t_float_complex_from_parts(float x, float y) { __pyx_t_float_complex z; z.real = x; z.imag = y; return z; } #endif #if CYTHON_CCOMPLEX #else static CYTHON_INLINE int __Pyx_c_eqf(__pyx_t_float_complex a, __pyx_t_float_complex b) { return (a.real == b.real) && (a.imag == b.imag); } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_sumf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real + b.real; z.imag = a.imag + b.imag; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_difff(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real - b.real; z.imag = a.imag - b.imag; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_prodf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; z.real = a.real * b.real - a.imag * b.imag; z.imag = a.real * b.imag + a.imag * b.real; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_quotf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; float denom = b.real * b.real + b.imag * b.imag; z.real = (a.real * b.real + a.imag * b.imag) / denom; z.imag = (a.imag * b.real - a.real * b.imag) / denom; return z; } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_negf(__pyx_t_float_complex a) { __pyx_t_float_complex z; z.real = -a.real; z.imag = -a.imag; return z; } static CYTHON_INLINE int __Pyx_c_is_zerof(__pyx_t_float_complex a) { return (a.real == 0) && (a.imag == 0); } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_conjf(__pyx_t_float_complex a) { __pyx_t_float_complex z; z.real = a.real; z.imag = -a.imag; return z; } #if 1 static CYTHON_INLINE float __Pyx_c_absf(__pyx_t_float_complex z) { #if !defined(HAVE_HYPOT) || defined(_MSC_VER) return sqrtf(z.real*z.real + z.imag*z.imag); #else return hypotf(z.real, z.imag); #endif } static CYTHON_INLINE __pyx_t_float_complex __Pyx_c_powf(__pyx_t_float_complex a, __pyx_t_float_complex b) { __pyx_t_float_complex z; float r, lnr, theta, z_r, z_theta; if (b.imag == 0 && b.real == (int)b.real) { if (b.real < 0) { float denom = a.real * a.real + a.imag * a.imag; a.real = a.real / denom; a.imag = -a.imag / denom; b.real = -b.real; } switch ((int)b.real) { case 0: z.real = 1; z.imag = 0; return z; case 1: return a; case 2: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(a, a); case 3: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(z, a); case 4: z = __Pyx_c_prodf(a, a); return __Pyx_c_prodf(z, z); } } if (a.imag == 0) { if (a.real == 0) { return a; } r = a.real; theta = 0; } else { r = __Pyx_c_absf(a); theta = atan2f(a.imag, a.real); } lnr = logf(r); z_r = expf(lnr * b.real - theta * b.imag); z_theta = theta * b.real + lnr * b.imag; z.real = z_r * cosf(z_theta); z.imag = z_r * sinf(z_theta); return z; } #endif #endif #if CYTHON_CCOMPLEX #ifdef __cplusplus static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { return ::std::complex< double >(x, y); } #else static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { return x + y*(__pyx_t_double_complex)_Complex_I; } #endif #else static CYTHON_INLINE __pyx_t_double_complex __pyx_t_double_complex_from_parts(double x, double y) { __pyx_t_double_complex z; z.real = x; z.imag = y; return z; } #endif #if CYTHON_CCOMPLEX #else static CYTHON_INLINE int __Pyx_c_eq(__pyx_t_double_complex a, __pyx_t_double_complex b) { return (a.real == b.real) && (a.imag == b.imag); } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_sum(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real + b.real; z.imag = a.imag + b.imag; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_diff(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real - b.real; z.imag = a.imag - b.imag; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_prod(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; z.real = a.real * b.real - a.imag * b.imag; z.imag = a.real * b.imag + a.imag * b.real; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_quot(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; double denom = b.real * b.real + b.imag * b.imag; z.real = (a.real * b.real + a.imag * b.imag) / denom; z.imag = (a.imag * b.real - a.real * b.imag) / denom; return z; } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_neg(__pyx_t_double_complex a) { __pyx_t_double_complex z; z.real = -a.real; z.imag = -a.imag; return z; } static CYTHON_INLINE int __Pyx_c_is_zero(__pyx_t_double_complex a) { return (a.real == 0) && (a.imag == 0); } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_conj(__pyx_t_double_complex a) { __pyx_t_double_complex z; z.real = a.real; z.imag = -a.imag; return z; } #if 1 static CYTHON_INLINE double __Pyx_c_abs(__pyx_t_double_complex z) { #if !defined(HAVE_HYPOT) || defined(_MSC_VER) return sqrt(z.real*z.real + z.imag*z.imag); #else return hypot(z.real, z.imag); #endif } static CYTHON_INLINE __pyx_t_double_complex __Pyx_c_pow(__pyx_t_double_complex a, __pyx_t_double_complex b) { __pyx_t_double_complex z; double r, lnr, theta, z_r, z_theta; if (b.imag == 0 && b.real == (int)b.real) { if (b.real < 0) { double denom = a.real * a.real + a.imag * a.imag; a.real = a.real / denom; a.imag = -a.imag / denom; b.real = -b.real; } switch ((int)b.real) { case 0: z.real = 1; z.imag = 0; return z; case 1: return a; case 2: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(a, a); case 3: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(z, a); case 4: z = __Pyx_c_prod(a, a); return __Pyx_c_prod(z, z); } } if (a.imag == 0) { if (a.real == 0) { return a; } r = a.real; theta = 0; } else { r = __Pyx_c_abs(a); theta = atan2(a.imag, a.real); } lnr = log(r); z_r = exp(lnr * b.real - theta * b.imag); z_theta = theta * b.real + lnr * b.imag; z.real = z_r * cos(z_theta); z.imag = z_r * sin(z_theta); return z; } #endif #endif static CYTHON_INLINE PyObject* __Pyx_PyInt_From_long(long value) { const long neg_one = (long) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; if (is_unsigned) { if (sizeof(long) < sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(long) <= sizeof(unsigned long)) { return PyLong_FromUnsignedLong((unsigned long) value); } else if (sizeof(long) <= sizeof(unsigned long long)) { return PyLong_FromUnsignedLongLong((unsigned long long) value); } } else { if (sizeof(long) <= sizeof(long)) { return PyInt_FromLong((long) value); } else if (sizeof(long) <= sizeof(long long)) { return PyLong_FromLongLong((long long) value); } } { int one = 1; int little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&value; return _PyLong_FromByteArray(bytes, sizeof(long), little, !is_unsigned); } } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE long __Pyx_PyInt_As_long(PyObject *x) { const long neg_one = (long) -1, const_zero = 0; const int is_unsigned = neg_one > const_zero; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_Check(x))) { if (sizeof(long) < sizeof(long)) { __PYX_VERIFY_RETURN_INT(long, long, PyInt_AS_LONG) } else { long val = PyInt_AS_LONG(x); if (is_unsigned && unlikely(val < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to long"); return (long) -1; } return (long) val; } } else #endif if (likely(PyLong_Check(x))) { if (is_unsigned) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(long)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return (long) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (unlikely(Py_SIZE(x) < 0)) { PyErr_SetString(PyExc_OverflowError, "can't convert negative value to long"); return (long) -1; } if (sizeof(long) <= sizeof(unsigned long)) { __PYX_VERIFY_RETURN_INT(long, unsigned long, PyLong_AsUnsignedLong) } else if (sizeof(long) <= sizeof(unsigned long long)) { __PYX_VERIFY_RETURN_INT(long, unsigned long long, PyLong_AsUnsignedLongLong) } } else { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS if (sizeof(digit) <= sizeof(long)) { switch (Py_SIZE(x)) { case 0: return 0; case 1: return +(long) ((PyLongObject*)x)->ob_digit[0]; case -1: return -(long) ((PyLongObject*)x)->ob_digit[0]; } } #endif #endif if (sizeof(long) <= sizeof(long)) { __PYX_VERIFY_RETURN_INT(long, long, PyLong_AsLong) } else if (sizeof(long) <= sizeof(long long)) { __PYX_VERIFY_RETURN_INT(long, long long, PyLong_AsLongLong) } } { #if CYTHON_COMPILING_IN_PYPY && !defined(_PyLong_AsByteArray) PyErr_SetString(PyExc_RuntimeError, "_PyLong_AsByteArray() not available in PyPy, cannot convert large numbers"); #else long val; PyObject *v = __Pyx_PyNumber_Int(x); #if PY_MAJOR_VERSION < 3 if (likely(v) && !PyLong_Check(v)) { PyObject *tmp = v; v = PyNumber_Long(tmp); Py_DECREF(tmp); } #endif if (likely(v)) { int one = 1; int is_little = (int)*(unsigned char *)&one; unsigned char *bytes = (unsigned char *)&val; int ret = _PyLong_AsByteArray((PyLongObject *)v, bytes, sizeof(val), is_little, !is_unsigned); Py_DECREF(v); if (likely(!ret)) return val; } #endif return (long) -1; } } else { long val; PyObject *tmp = __Pyx_PyNumber_Int(x); if (!tmp) return (long) -1; val = __Pyx_PyInt_As_long(tmp); Py_DECREF(tmp); return val; } } static int __Pyx_check_binary_version(void) { char ctversion[4], rtversion[4]; PyOS_snprintf(ctversion, 4, "%d.%d", PY_MAJOR_VERSION, PY_MINOR_VERSION); PyOS_snprintf(rtversion, 4, "%s", Py_GetVersion()); if (ctversion[0] != rtversion[0] || ctversion[2] != rtversion[2]) { char message[200]; PyOS_snprintf(message, sizeof(message), "compiletime version %s of module '%.100s' " "does not match runtime version %s", ctversion, __Pyx_MODULE_NAME, rtversion); #if PY_VERSION_HEX < 0x02050000 return PyErr_Warn(NULL, message); #else return PyErr_WarnEx(NULL, message, 1); #endif } return 0; } #ifndef __PYX_HAVE_RT_ImportModule #define __PYX_HAVE_RT_ImportModule static PyObject *__Pyx_ImportModule(const char *name) { PyObject *py_name = 0; PyObject *py_module = 0; py_name = __Pyx_PyIdentifier_FromString(name); if (!py_name) goto bad; py_module = PyImport_Import(py_name); Py_DECREF(py_name); return py_module; bad: Py_XDECREF(py_name); return 0; } #endif #ifndef __PYX_HAVE_RT_ImportType #define __PYX_HAVE_RT_ImportType static PyTypeObject *__Pyx_ImportType(const char *module_name, const char *class_name, size_t size, int strict) { PyObject *py_module = 0; PyObject *result = 0; PyObject *py_name = 0; char warning[200]; Py_ssize_t basicsize; #ifdef Py_LIMITED_API PyObject *py_basicsize; #endif py_module = __Pyx_ImportModule(module_name); if (!py_module) goto bad; py_name = __Pyx_PyIdentifier_FromString(class_name); if (!py_name) goto bad; result = PyObject_GetAttr(py_module, py_name); Py_DECREF(py_name); py_name = 0; Py_DECREF(py_module); py_module = 0; if (!result) goto bad; if (!PyType_Check(result)) { PyErr_Format(PyExc_TypeError, "%.200s.%.200s is not a type object", module_name, class_name); goto bad; } #ifndef Py_LIMITED_API basicsize = ((PyTypeObject *)result)->tp_basicsize; #else py_basicsize = PyObject_GetAttrString(result, "__basicsize__"); if (!py_basicsize) goto bad; basicsize = PyLong_AsSsize_t(py_basicsize); Py_DECREF(py_basicsize); py_basicsize = 0; if (basicsize == (Py_ssize_t)-1 && PyErr_Occurred()) goto bad; #endif if (!strict && (size_t)basicsize > size) { PyOS_snprintf(warning, sizeof(warning), "%s.%s size changed, may indicate binary incompatibility", module_name, class_name); #if PY_VERSION_HEX < 0x02050000 if (PyErr_Warn(NULL, warning) < 0) goto bad; #else if (PyErr_WarnEx(NULL, warning, 0) < 0) goto bad; #endif } else if ((size_t)basicsize != size) { PyErr_Format(PyExc_ValueError, "%.200s.%.200s has the wrong size, try recompiling", module_name, class_name); goto bad; } return (PyTypeObject *)result; bad: Py_XDECREF(py_module); Py_XDECREF(result); return NULL; } #endif static int __pyx_bisect_code_objects(__Pyx_CodeObjectCacheEntry* entries, int count, int code_line) { int start = 0, mid = 0, end = count - 1; if (end >= 0 && code_line > entries[end].code_line) { return count; } while (start < end) { mid = (start + end) / 2; if (code_line < entries[mid].code_line) { end = mid; } else if (code_line > entries[mid].code_line) { start = mid + 1; } else { return mid; } } if (code_line <= entries[mid].code_line) { return mid; } else { return mid + 1; } } static PyCodeObject *__pyx_find_code_object(int code_line) { PyCodeObject* code_object; int pos; if (unlikely(!code_line) || unlikely(!__pyx_code_cache.entries)) { return NULL; } pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line); if (unlikely(pos >= __pyx_code_cache.count) || unlikely(__pyx_code_cache.entries[pos].code_line != code_line)) { return NULL; } code_object = __pyx_code_cache.entries[pos].code_object; Py_INCREF(code_object); return code_object; } static void __pyx_insert_code_object(int code_line, PyCodeObject* code_object) { int pos, i; __Pyx_CodeObjectCacheEntry* entries = __pyx_code_cache.entries; if (unlikely(!code_line)) { return; } if (unlikely(!entries)) { entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Malloc(64*sizeof(__Pyx_CodeObjectCacheEntry)); if (likely(entries)) { __pyx_code_cache.entries = entries; __pyx_code_cache.max_count = 64; __pyx_code_cache.count = 1; entries[0].code_line = code_line; entries[0].code_object = code_object; Py_INCREF(code_object); } return; } pos = __pyx_bisect_code_objects(__pyx_code_cache.entries, __pyx_code_cache.count, code_line); if ((pos < __pyx_code_cache.count) && unlikely(__pyx_code_cache.entries[pos].code_line == code_line)) { PyCodeObject* tmp = entries[pos].code_object; entries[pos].code_object = code_object; Py_DECREF(tmp); return; } if (__pyx_code_cache.count == __pyx_code_cache.max_count) { int new_max = __pyx_code_cache.max_count + 64; entries = (__Pyx_CodeObjectCacheEntry*)PyMem_Realloc( __pyx_code_cache.entries, new_max*sizeof(__Pyx_CodeObjectCacheEntry)); if (unlikely(!entries)) { return; } __pyx_code_cache.entries = entries; __pyx_code_cache.max_count = new_max; } for (i=__pyx_code_cache.count; i>pos; i--) { entries[i] = entries[i-1]; } entries[pos].code_line = code_line; entries[pos].code_object = code_object; __pyx_code_cache.count++; Py_INCREF(code_object); } #include "compile.h" #include "frameobject.h" #include "traceback.h" static PyCodeObject* __Pyx_CreateCodeObjectForTraceback( const char *funcname, int c_line, int py_line, const char *filename) { PyCodeObject *py_code = 0; PyObject *py_srcfile = 0; PyObject *py_funcname = 0; #if PY_MAJOR_VERSION < 3 py_srcfile = PyString_FromString(filename); #else py_srcfile = PyUnicode_FromString(filename); #endif if (!py_srcfile) goto bad; if (c_line) { #if PY_MAJOR_VERSION < 3 py_funcname = PyString_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line); #else py_funcname = PyUnicode_FromFormat( "%s (%s:%d)", funcname, __pyx_cfilenm, c_line); #endif } else { #if PY_MAJOR_VERSION < 3 py_funcname = PyString_FromString(funcname); #else py_funcname = PyUnicode_FromString(funcname); #endif } if (!py_funcname) goto bad; py_code = __Pyx_PyCode_New( 0, /*int argcount,*/ 0, /*int kwonlyargcount,*/ 0, /*int nlocals,*/ 0, /*int stacksize,*/ 0, /*int flags,*/ __pyx_empty_bytes, /*PyObject *code,*/ __pyx_empty_tuple, /*PyObject *consts,*/ __pyx_empty_tuple, /*PyObject *names,*/ __pyx_empty_tuple, /*PyObject *varnames,*/ __pyx_empty_tuple, /*PyObject *freevars,*/ __pyx_empty_tuple, /*PyObject *cellvars,*/ py_srcfile, /*PyObject *filename,*/ py_funcname, /*PyObject *name,*/ py_line, /*int firstlineno,*/ __pyx_empty_bytes /*PyObject *lnotab*/ ); Py_DECREF(py_srcfile); Py_DECREF(py_funcname); return py_code; bad: Py_XDECREF(py_srcfile); Py_XDECREF(py_funcname); return NULL; } static void __Pyx_AddTraceback(const char *funcname, int c_line, int py_line, const char *filename) { PyCodeObject *py_code = 0; PyObject *py_globals = 0; PyFrameObject *py_frame = 0; py_code = __pyx_find_code_object(c_line ? c_line : py_line); if (!py_code) { py_code = __Pyx_CreateCodeObjectForTraceback( funcname, c_line, py_line, filename); if (!py_code) goto bad; __pyx_insert_code_object(c_line ? c_line : py_line, py_code); } py_globals = PyModule_GetDict(__pyx_m); if (!py_globals) goto bad; py_frame = PyFrame_New( PyThreadState_GET(), /*PyThreadState *tstate,*/ py_code, /*PyCodeObject *code,*/ py_globals, /*PyObject *globals,*/ 0 /*PyObject *locals*/ ); if (!py_frame) goto bad; py_frame->f_lineno = py_line; PyTraceBack_Here(py_frame); bad: Py_XDECREF(py_code); Py_XDECREF(py_frame); } static int __Pyx_InitStrings(__Pyx_StringTabEntry *t) { while (t->p) { #if PY_MAJOR_VERSION < 3 if (t->is_unicode) { *t->p = PyUnicode_DecodeUTF8(t->s, t->n - 1, NULL); } else if (t->intern) { *t->p = PyString_InternFromString(t->s); } else { *t->p = PyString_FromStringAndSize(t->s, t->n - 1); } #else /* Python 3+ has unicode identifiers */ if (t->is_unicode | t->is_str) { if (t->intern) { *t->p = PyUnicode_InternFromString(t->s); } else if (t->encoding) { *t->p = PyUnicode_Decode(t->s, t->n - 1, t->encoding, NULL); } else { *t->p = PyUnicode_FromStringAndSize(t->s, t->n - 1); } } else { *t->p = PyBytes_FromStringAndSize(t->s, t->n - 1); } #endif if (!*t->p) return -1; ++t; } return 0; } static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(char* c_str) { return __Pyx_PyUnicode_FromStringAndSize(c_str, strlen(c_str)); } static CYTHON_INLINE char* __Pyx_PyObject_AsString(PyObject* o) { Py_ssize_t ignore; return __Pyx_PyObject_AsStringAndSize(o, &ignore); } static CYTHON_INLINE char* __Pyx_PyObject_AsStringAndSize(PyObject* o, Py_ssize_t *length) { #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT if ( #if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII __Pyx_sys_getdefaultencoding_not_ascii && #endif PyUnicode_Check(o)) { #if PY_VERSION_HEX < 0x03030000 char* defenc_c; PyObject* defenc = _PyUnicode_AsDefaultEncodedString(o, NULL); if (!defenc) return NULL; defenc_c = PyBytes_AS_STRING(defenc); #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII { char* end = defenc_c + PyBytes_GET_SIZE(defenc); char* c; for (c = defenc_c; c < end; c++) { if ((unsigned char) (*c) >= 128) { PyUnicode_AsASCIIString(o); return NULL; } } } #endif /*__PYX_DEFAULT_STRING_ENCODING_IS_ASCII*/ *length = PyBytes_GET_SIZE(defenc); return defenc_c; #else /* PY_VERSION_HEX < 0x03030000 */ if (PyUnicode_READY(o) == -1) return NULL; #if __PYX_DEFAULT_STRING_ENCODING_IS_ASCII if (PyUnicode_IS_ASCII(o)) { *length = PyUnicode_GET_DATA_SIZE(o); return PyUnicode_AsUTF8(o); } else { PyUnicode_AsASCIIString(o); return NULL; } #else /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII */ return PyUnicode_AsUTF8AndSize(o, length); #endif /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII */ #endif /* PY_VERSION_HEX < 0x03030000 */ } else #endif /* __PYX_DEFAULT_STRING_ENCODING_IS_ASCII || __PYX_DEFAULT_STRING_ENCODING_IS_DEFAULT */ #if !CYTHON_COMPILING_IN_PYPY #if PY_VERSION_HEX >= 0x02060000 if (PyByteArray_Check(o)) { *length = PyByteArray_GET_SIZE(o); return PyByteArray_AS_STRING(o); } else #endif #endif { char* result; int r = PyBytes_AsStringAndSize(o, &result, length); if (unlikely(r < 0)) { return NULL; } else { return result; } } } static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject* x) { int is_true = x == Py_True; if (is_true | (x == Py_False) | (x == Py_None)) return is_true; else return PyObject_IsTrue(x); } static CYTHON_INLINE PyObject* __Pyx_PyNumber_Int(PyObject* x) { PyNumberMethods *m; const char *name = NULL; PyObject *res = NULL; #if PY_MAJOR_VERSION < 3 if (PyInt_Check(x) || PyLong_Check(x)) #else if (PyLong_Check(x)) #endif return Py_INCREF(x), x; m = Py_TYPE(x)->tp_as_number; #if PY_MAJOR_VERSION < 3 if (m && m->nb_int) { name = "int"; res = PyNumber_Int(x); } else if (m && m->nb_long) { name = "long"; res = PyNumber_Long(x); } #else if (m && m->nb_int) { name = "int"; res = PyNumber_Long(x); } #endif if (res) { #if PY_MAJOR_VERSION < 3 if (!PyInt_Check(res) && !PyLong_Check(res)) { #else if (!PyLong_Check(res)) { #endif PyErr_Format(PyExc_TypeError, "__%.4s__ returned non-%.4s (type %.200s)", name, name, Py_TYPE(res)->tp_name); Py_DECREF(res); return NULL; } } else if (!PyErr_Occurred()) { PyErr_SetString(PyExc_TypeError, "an integer is required"); } return res; } #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS #include "longintrepr.h" #endif #endif static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject* b) { Py_ssize_t ival; PyObject *x; #if PY_MAJOR_VERSION < 3 if (likely(PyInt_CheckExact(b))) return PyInt_AS_LONG(b); #endif if (likely(PyLong_CheckExact(b))) { #if CYTHON_COMPILING_IN_CPYTHON && PY_MAJOR_VERSION >= 3 #if CYTHON_USE_PYLONG_INTERNALS switch (Py_SIZE(b)) { case -1: return -(sdigit)((PyLongObject*)b)->ob_digit[0]; case 0: return 0; case 1: return ((PyLongObject*)b)->ob_digit[0]; } #endif #endif #if PY_VERSION_HEX < 0x02060000 return PyInt_AsSsize_t(b); #else return PyLong_AsSsize_t(b); #endif } x = PyNumber_Index(b); if (!x) return -1; ival = PyInt_AsSsize_t(x); Py_DECREF(x); return ival; } static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t ival) { #if PY_VERSION_HEX < 0x02050000 if (ival <= LONG_MAX) return PyInt_FromLong((long)ival); else { unsigned char *bytes = (unsigned char *) &ival; int one = 1; int little = (int)*(unsigned char*)&one; return _PyLong_FromByteArray(bytes, sizeof(size_t), little, 0); } #else return PyInt_FromSize_t(ival); #endif } #endif /* Py_PYTHON_H */ healpy-1.8.1/healpy/src/_healpy_pixel_lib.cc0000644000175000017500000004102012351422052021272 0ustar zoncazonca00000000000000/* * This file is part of Healpy. * * Healpy 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 2 of the License, or * (at your option) any later version. * * Healpy 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 Healpy; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about Healpy, see http://code.google.com/p/healpy */ /* This module provides Healpix functions to Python. It uses the healpix_cxx library. */ #include #include "arr.h" #include "healpix_base.h" #include "healpix_map.h" #include "_healpy_utils.h" #include "numpy/arrayobject.h" #include "numpy/ufuncobject.h" #include "numpy/noprefix.h" /* ang2pix */ templatestatic void ufunc_ang2pix(char **args, intp *dimensions, intp *steps, void *func) { intp n=dimensions[0]; intp is1=steps[0],is2=steps[1],is3=steps[2], os=steps[3]; char *ip1=args[0], *ip2=args[1], *ip3=args[2], *op=args[3]; Healpix_Base2 hb; long oldnside=-1; for(intp i=0; i static void ufunc_pix2ang(char **args, intp *dimensions, intp *steps, void *func) { register intp i, n=dimensions[0]; register intp is1=steps[0],is2=steps[1],os1=steps[2],os2=steps[3]; char *ip1=args[0], *ip2=args[1], *op1=args[2], *op2=args[3]; Healpix_Base2 hb; long oldnside=-1; for(i=0; i static void ufunc_pix2vec(char **args, intp *dimensions, intp *steps, void *func) { register intp i, n=dimensions[0]; register intp is1=steps[0],is2=steps[1],os1=steps[2],os2=steps[3],os3=steps[4]; char *ip1=args[0], *ip2=args[1], *op1=args[2], *op2=args[3], *op3=args[4]; Healpix_Base2 hb; long oldnside=-1; for(i=0; i static void ufunc_vec2pix(char **args, intp *dimensions, intp *steps, void *func) { register intp i, n=dimensions[0]; register intp is1=steps[0],is2=steps[1],is3=steps[2],is4=steps[3],os1=steps[4]; char *ip1=args[0], *ip2=args[1], *ip3=args[2], *ip4=args[3], *op1=args[4]; Healpix_Base2 hb; long oldnside=-1; for(i=0; i static void ufunc_get_interpol(char **args, intp *dimensions, intp *steps, void *func) { register intp i, n=dimensions[0]; register intp is1=steps[0],is2=steps[1],is3=steps[2], os1=steps[3],os2=steps[4],os3=steps[5],os4=steps[6], os5=steps[7],os6=steps[8],os7=steps[9],os8=steps[10]; char *ip1=args[0], *ip2=args[1], *ip3=args[2], *op1=args[3],*op2=args[4],*op3=args[5],*op4=args[6], *op5=args[7],*op6=args[8],*op7=args[9],*op8=args[10]; Healpix_Base2 hb; long oldnside=-1; for(i=0; i pix; fix_arr wgt; long nside = *(long*)ip1; if (nside!=oldnside) { oldnside=nside; hb.SetNside(nside, scheme); } try { pointing ptg = pointing(*(double*)ip2, *(double*)ip3); ptg.normalize(); hb.get_interpol(ptg, pix, wgt); *(long*)op1 = (long)pix[0]; *(long*)op2 = (long)pix[1]; *(long*)op3 = (long)pix[2]; *(long*)op4 = (long)pix[3]; *(double*)op5 = wgt[0]; *(double*)op6 = wgt[1]; *(double*)op7 = wgt[2]; *(double*)op8 = wgt[3]; } catch (PlanckError &e) { *(long*)op1 = -1; *(long*)op2 = -1; *(long*)op3 = -1; *(long*)op4 = -1; *(double*)op5 = NAN; *(double*)op6 = NAN; *(double*)op7 = NAN; *(double*)op8 = NAN; } } } /* get_neighbors */ template static void ufunc_get_neighbors(char **args, intp *dimensions, intp *steps, void *func) { register intp i, n=dimensions[0]; register intp is1=steps[0],is2=steps[1], os1=steps[2],os2=steps[3],os3=steps[4],os4=steps[5], os5=steps[6],os6=steps[7],os7=steps[8],os8=steps[9]; char *ip1=args[0], *ip2=args[1], *op1=args[2],*op2=args[3],*op3=args[4],*op4=args[5], *op5=args[6],*op6=args[7],*op7=args[8],*op8=args[9]; Healpix_Base2 hb; for(i=0; i pix; hb.SetNside(*(long*)ip1, scheme); try { hb.neighbors(*(long*)ip2, pix); *(long*)op1 = (long)pix[0]; *(long*)op2 = (long)pix[1]; *(long*)op3 = (long)pix[2]; *(long*)op4 = (long)pix[3]; *(long*)op5 = (long)pix[4]; *(long*)op6 = (long)pix[5]; *(long*)op7 = (long)pix[6]; *(long*)op8 = (long)pix[7]; } catch (PlanckError & e) { *(long*)op1 = -1; *(long*)op2 = -1; *(long*)op3 = -1; *(long*)op4 = -1; *(long*)op5 = -1; *(long*)op6 = -1; *(long*)op7 = -1; *(long*)op8 = -1; } } } /* max_pixrad */ static void ufunc_max_pixrad(char **args, intp *dimensions, intp *steps, void *func) { register intp i, n=dimensions[0]; register intp is1=steps[0],os1=steps[1]; char *ip1=args[0], *op1=args[1]; Healpix_Base2 hb; long oldnside=-1; for(i=0; inest swapping, etc.\n" "\n" "Available ufunc: _ang2pix_ring, _ang2pix_nest, _pix2ang_ring,\n" " _pix2ang_nest, _ring2nest, _nest2ring,\n" " _get_interpol_ring, _get_interpol_nest."); /* to define the ufunc */ static PyUFuncGenericFunction ang2pix_ring_functions[] = { ufunc_ang2pix }; static PyUFuncGenericFunction ang2pix_nest_functions[] = { ufunc_ang2pix }; static PyUFuncGenericFunction pix2ang_ring_functions[] = { ufunc_pix2ang }; static PyUFuncGenericFunction pix2ang_nest_functions[] = { ufunc_pix2ang }; static PyUFuncGenericFunction vec2pix_ring_functions[] = { ufunc_vec2pix }; static PyUFuncGenericFunction vec2pix_nest_functions[] = { ufunc_vec2pix }; static PyUFuncGenericFunction pix2vec_ring_functions[] = { ufunc_pix2vec }; static PyUFuncGenericFunction pix2vec_nest_functions[] = { ufunc_pix2vec }; static PyUFuncGenericFunction ring2nest_functions[] = { ufunc_ring2nest }; static PyUFuncGenericFunction nest2ring_functions[] = { ufunc_nest2ring }; static PyUFuncGenericFunction get_interpol_ring_functions[] = { ufunc_get_interpol }; static PyUFuncGenericFunction get_interpol_nest_functions[] = { ufunc_get_interpol }; static PyUFuncGenericFunction get_neighbors_ring_functions[] = { ufunc_get_neighbors }; static PyUFuncGenericFunction get_neighbors_nest_functions[] = { ufunc_get_neighbors }; static PyUFuncGenericFunction max_pixrad_functions[] = { ufunc_max_pixrad }; static void * blank_data[] = { (void *)NULL }; static char ang2pix_signatures[] = { PyArray_LONG, PyArray_DOUBLE, PyArray_DOUBLE, PyArray_LONG }; static char pix2ang_signatures[] = { PyArray_LONG, PyArray_LONG, PyArray_DOUBLE, PyArray_DOUBLE }; static char pix2vec_signatures[] = { PyArray_LONG, PyArray_LONG, PyArray_DOUBLE, PyArray_DOUBLE, PyArray_DOUBLE }; static char vec2pix_signatures[] = { PyArray_LONG, PyArray_DOUBLE, PyArray_DOUBLE, PyArray_DOUBLE, PyArray_LONG }; static char ring2nest_signatures[] = { PyArray_LONG, PyArray_LONG, PyArray_LONG }; static char get_interpol_signatures[] = { PyArray_LONG, PyArray_DOUBLE, PyArray_DOUBLE, PyArray_LONG, PyArray_LONG, PyArray_LONG, PyArray_LONG, PyArray_DOUBLE, PyArray_DOUBLE, PyArray_DOUBLE, PyArray_DOUBLE }; static char get_neighbors_ring_signatures[] = { PyArray_LONG, PyArray_LONG, // input PyArray_LONG, PyArray_LONG, PyArray_LONG, PyArray_LONG, // output PyArray_LONG, PyArray_LONG, PyArray_LONG, PyArray_LONG // output }; static char get_neighbors_nest_signatures[] = { PyArray_LONG, PyArray_LONG, // input PyArray_LONG, PyArray_LONG, PyArray_LONG, PyArray_LONG, // output PyArray_LONG, PyArray_LONG, PyArray_LONG, PyArray_LONG // output }; static char max_pixrad_signatures[] = { PyArray_LONG, PyArray_DOUBLE }; #if PY_MAJOR_VERSION >= 3 static PyModuleDef moduledef = { PyModuleDef_HEAD_INIT, "_healpy_pixel_lib", NULL, -1, NULL }; #endif #if PY_MAJOR_VERSION < 3 #define FREE_MODULE_AND_FAIL do { return; } while(0) #else #define FREE_MODULE_AND_FAIL do { Py_DECREF(m); return NULL; } while(0) #endif PyMODINIT_FUNC #if PY_MAJOR_VERSION < 3 init_healpy_pixel_lib(void) #else PyInit__healpy_pixel_lib(void) #endif { PyObject *m; import_array(); import_ufunc(); #if PY_MAJOR_VERSION < 3 m = Py_InitModule3("_healpy_pixel_lib", NULL, docstring); if (!m) return; #else m = PyModule_Create(&moduledef); if (!m) return NULL; #endif if (PyModule_AddObject(m, "_ang2pix_ring", PyUFunc_FromFuncAndData( ang2pix_ring_functions, blank_data, ang2pix_signatures, 1, 3, 1, PyUFunc_None, CP_("_ang2pix_ring"), CP_("nside,theta,phi [rad] -> ipix (RING)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_ang2pix_nest", PyUFunc_FromFuncAndData( ang2pix_nest_functions, blank_data, ang2pix_signatures, 1, 3, 1, PyUFunc_None, CP_("_ang2pix_nest"), CP_("nside,theta,phi [rad] -> ipix (NEST)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_pix2ang_ring", PyUFunc_FromFuncAndData( pix2ang_ring_functions, blank_data, pix2ang_signatures, 1, 2, 2, PyUFunc_None, CP_("_pix2ang_ring"), CP_("nside,ipix -> theta,phi [rad] (RING)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_pix2ang_nest", PyUFunc_FromFuncAndData( pix2ang_nest_functions, blank_data, pix2ang_signatures, 1, 2, 2, PyUFunc_None, CP_("_pix2ang_nest"), CP_("nside,ipix -> theta,phi [rad] (NEST)"),0)) < 0) FREE_MODULE_AND_FAIL; //========= if (PyModule_AddObject(m, "_vec2pix_ring", PyUFunc_FromFuncAndData( vec2pix_ring_functions, blank_data, vec2pix_signatures, 1, 4, 1, PyUFunc_None, CP_("_vec2pix_ring"), CP_("nside,x,y,z -> ipix (RING)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_vec2pix_nest", PyUFunc_FromFuncAndData( vec2pix_nest_functions, blank_data, vec2pix_signatures, 1, 4, 1, PyUFunc_None, CP_("_vec2pix_nest"), CP_("nside,x,y,z -> ipix (NEST)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_pix2vec_ring", PyUFunc_FromFuncAndData( pix2vec_ring_functions, blank_data, pix2vec_signatures, 1, 2, 3, PyUFunc_None, CP_("_pix2vec_ring"), CP_("nside,ipix -> x,y,z (RING)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_pix2vec_nest", PyUFunc_FromFuncAndData( pix2vec_nest_functions, blank_data, pix2vec_signatures, 1, 2, 3, PyUFunc_None, CP_("_pix2vec_nest"), CP_("nside,ipix -> x,y,z (NEST)"),0)) < 0) FREE_MODULE_AND_FAIL; //============= if (PyModule_AddObject(m, "_ring2nest", PyUFunc_FromFuncAndData( ring2nest_functions, blank_data, ring2nest_signatures, 1, 2, 1, PyUFunc_None, CP_("_ring2nest"), CP_("ipix(ring) -> ipix(nest)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_nest2ring", PyUFunc_FromFuncAndData( nest2ring_functions, blank_data, ring2nest_signatures, 1, 2, 1, PyUFunc_None, CP_("_nest2ring"), CP_("ipix(nest) -> ipix(ring)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_get_interpol_ring", PyUFunc_FromFuncAndData( get_interpol_ring_functions, blank_data, get_interpol_signatures, 1, 3, 8, PyUFunc_None, CP_("_get_interpol_ring"), CP_("nside,theta,phi->4 nearest pixels+4weights"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_get_interpol_nest", PyUFunc_FromFuncAndData( get_interpol_nest_functions, blank_data, get_interpol_signatures, 1, 3, 8, PyUFunc_None, CP_("_get_interpol_nest"), CP_("nside,theta,phi->4 nearest pixels+4weights"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_get_neighbors_ring", PyUFunc_FromFuncAndData( get_neighbors_ring_functions, blank_data, get_neighbors_ring_signatures, 1, 2, 8, PyUFunc_None, CP_("_get_neigbors_ring"), CP_("nside, ipix [rad] -> 8 neighbors"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_get_neighbors_nest", PyUFunc_FromFuncAndData( get_neighbors_nest_functions, blank_data, get_neighbors_nest_signatures, 1, 2, 8, PyUFunc_None, CP_("_get_neigbors_nest"), CP_("nside, ipix [rad] -> 8 neighbors"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "_max_pixrad", PyUFunc_FromFuncAndData( max_pixrad_functions, blank_data, max_pixrad_signatures, 1, 1, 1, PyUFunc_None, CP_("max_pixrad"), CP_("nside -> max_distance to pixel corners from center)"),0)) < 0) FREE_MODULE_AND_FAIL; if (PyModule_AddObject(m, "UNSEEN", PyFloat_FromDouble(Healpix_undef)) < 0) FREE_MODULE_AND_FAIL; #if PY_MAJOR_VERSION >= 3 return m; #endif } healpy-1.8.1/healpy/src/_healpy_sph_transform_lib.cc0000644000175000017500000007372312346125412023061 0ustar zoncazonca00000000000000/* * This file is part of Healpy. * * Healpy 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 2 of the License, or * (at your option) any later version. * * Healpy 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 Healpy; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about Healpy, see http://code.google.com/p/healpy */ /* This module provides Healpix functions to Python. It uses the healpix_cxx library. */ #include #include "numpy/arrayobject.h" #include #include #include "arr.h" #include "alm.h" #include "lsconstants.h" #include "healpix_map.h" #include "xcomplex.h" #include "alm_healpix_tools.h" #include "powspec.h" #include "alm_powspec_tools.h" #include "healpix_data_io.h" #include "_healpy_utils.h" #define IS_DEBUG_ON 0 /* Some helpful macro */ #define XMALLOC(X,Y,Z) if( !(X = (Y*)malloc(Z*sizeof(Y))) ) { PyErr_NoMemory(); goto fail;} #define XNEW(X,Y,Z) if( !(X = new Y[Z]) ) { PyErr_NoMemory(); goto fail; } #define XFREE(X) if( X ) free(X); #define XDELETE(X) if( X ) delete[] X; #define DBGPRINTF(X,...) if( IS_DEBUG_ON ) printf(X, ## __VA_ARGS__) static long nside2npix(long nside) { return 12*nside*nside; } static long npix2nside(long npix) { long nside; long npix2; nside = (long)floor(sqrt(npix/12.)); npix2 = 12*nside*nside; if( npix2 == npix ) return nside; else return -1; } /* Helper functions */ /* static void getij(long n, long idx, long *i, long *j) { *i = (long)ceil(((2*n+1)-sqrt((2*n+1)*(2*n+1)-8*(idx-n)))/2); *j = idx - (*i)*(2*n+1- (*i) )/2; } */ static long getidx(long n, long i, long j) { long tmp; if( i > j ) {tmp = j; j=i; i=tmp;} return i*(2*n-1-i)/2+j; } static long getn(long s) { long x; x = (long)floor((-1+sqrt(1+8*s))/2); if( (x*(x+1)/2) != s ) return -1; else return x; } static void cholesky(int n, double *data, double *res) { int i,j,k; double sum; for( j=0; jj) { sum = data[getidx(n,i,j)]; for( k=0; kflags&NPY_C_CONTIGUOUS, "Array must be C contiguous for this operation."); if( polarisation ) healpyAssertValue(mapQin->flags&mapUin->flags&NPY_C_CONTIGUOUS, "Array must be C contiguous for this operation."); /* Check type of data : must be double ('d') */ healpyAssertType(mapIin->descr->type == 'd', "Type must be Float64 for this function"); if( polarisation ) { healpyAssertType(mapQin->descr->type == 'd', "Type must be Float64 for this function"); healpyAssertType(mapUin->descr->type == 'd', "Type must be Float64 for this function"); } /* Check number of dimension : must be 1 */ healpyAssertType(mapIin->nd==1,"Array must be 1D."); npix = mapIin->dimensions[0]; if( polarisation ) { healpyAssertType((mapQin->nd==1)&&(mapUin->nd==1),"Array must be 1D."); healpyAssertType((mapQin->dimensions[0]==npix)&& (mapQin->dimensions[0]==npix), "All maps must have same dimension."); } /* Check that the number of pixel is ok (12*nside^2) */ nside = npix2nside(npix); healpyAssertValue(nside>=0,"Number of pixel not valid for healpix map."); /* lmax and mmax */ if( lmax < 0 ) lmax = 3*nside-1; if( mmax <0 || mmax > lmax ) mmax = lmax; Healpix_Map mapI, mapQ, mapU; { arr arr_map((double*)mapIin->data, npix); mapI.Set(arr_map, RING); } if(polarisation) { arr arr_map((double*)mapQin->data, npix); mapQ.Set(arr_map, RING); } if( polarisation ) { arr arr_map((double*)mapUin->data, npix); mapU.Set(arr_map, RING); } npy_intp szalm = Alm >::Num_Alms(lmax,mmax); PyArrayObject *almIout = (PyArrayObject*)PyArray_SimpleNew (1, (npy_intp*)&szalm, PyArray_CDOUBLE); if( !almIout ) return NULL; PyArrayObject *almGout=NULL, *almCout=NULL; if( polarisation ) { almGout = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&szalm, PyArray_CDOUBLE); if( !almGout ) { Py_DECREF(almIout); return NULL; } almCout = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&szalm, PyArray_CDOUBLE); if( !almCout ) { Py_DECREF(almIout); Py_DECREF(almGout); return NULL; } } Alm< xcomplex > almIalm; { arr< xcomplex > alm_arr((xcomplex*)almIout->data, szalm); almIalm.Set(alm_arr, lmax, mmax); } Alm< xcomplex > almGalm; if( polarisation ) { arr< xcomplex > alm_arr((xcomplex*)almGout->data, szalm); almGalm.Set(alm_arr, lmax, mmax); } Alm< xcomplex > almCalm; if( polarisation ) { arr< xcomplex > alm_arr((xcomplex*)almCout->data, szalm); almCalm.Set(alm_arr, lmax, mmax); } arr weight; if( use_weights ) { read_weight_ring(datapath, nside, weight); for (tsize m=0; mflags&NPY_C_CONTIGUOUS, "Array must be C contiguous for this operation."); if( polarisation ) healpyAssertValue(almGin->flags&almCin->flags&NPY_C_CONTIGUOUS, "Array must be C contiguous for this operation."); /* Check type of data : must be double, real ('d') or complex ('D') */ healpyAssertType(almIin->descr->type == 'D', "Type must be Complex for this function"); if( polarisation ) { healpyAssertType(almGin->descr->type == 'D', "Type must be Complex for this function"); healpyAssertType(almCin->descr->type == 'D', "Type must be Complex for this function"); } /* Check number of dimension : must be 1 */ healpyAssertType(almIin->nd==1,"The a_lm must be a 1D array."); if( polarisation ) { healpyAssertType(almGin->nd==1,"The a_lm must be a 1D array."); healpyAssertType(almCin->nd==1,"The a_lm must be a 1D array."); } /* Need to have lmax and mmax defined */ if( lmax < 0 ) { /* Check that the dimension is compatible with lmax=mmax */ long imax = almIin->dimensions[0] - 1; double ell = (-3.+sqrt(9.+8.*imax))/2.; healpyAssertType(ell==floor(ell), "Wrong alm size (or give lmax and mmax)"); lmax=(int)floor(ell); mmax = lmax; } if( mmax < 0 || mmax > lmax) mmax = lmax; /* Check lmax and mmax are ok compared to alm.size */ int szalm = Alm< xcomplex >::Num_Alms(lmax,mmax); healpyAssertValue(almIin->dimensions[0]==szalm,"Wrong alm size."); if( polarisation ) { healpyAssertValue(almGin->dimensions[0]==szalm,"Wrong alm size."); healpyAssertValue(almCin->dimensions[0]==szalm,"Wrong alm size."); } /* Now we can build an Alm and give it to alm2map_iter */ Alm< xcomplex > almIalm; { arr< xcomplex > alm_arr((xcomplex*)almIin->data, szalm); almIalm.Set(alm_arr, lmax, mmax); } Alm< xcomplex > almGalm; if( polarisation ) { arr< xcomplex > alm_arr((xcomplex*)almGin->data, szalm); almGalm.Set(alm_arr, lmax, mmax); } Alm< xcomplex > almCalm; if( polarisation ) { arr< xcomplex > alm_arr((xcomplex*)almCin->data, szalm); almCalm.Set(alm_arr, lmax, mmax); } /* We must prepare the map */ npy_intp npix = nside2npix(nside); PyArrayObject *mapIout = NULL; mapIout = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&npix, PyArray_DOUBLE); if( !mapIout ) return NULL; PyArrayObject *mapQout = NULL; if( polarisation ) { mapQout = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&npix, PyArray_DOUBLE); if( !mapQout ) return NULL; } PyArrayObject *mapUout = NULL; if( polarisation ) { mapUout = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&npix, PyArray_DOUBLE); if( !mapUout ) return NULL; } Healpix_Map mapI; { arr arr_map((double*)mapIout->data, npix); mapI.Set(arr_map, RING); } Healpix_Map mapQ; if( polarisation ) { arr arr_map((double*)mapQout->data, npix); mapQ.Set(arr_map, RING); } Healpix_Map mapU; if( polarisation ) { arr arr_map((double*)mapUout->data, npix); mapU.Set(arr_map, RING); } /* We now call alm2map */ if( !polarisation ) { double offset = almIalm(0,0).real()/sqrt(fourpi); xcomplex almI00 = almIalm(0,0); almIalm(0,0) = 0; alm2map(almIalm,mapI); mapI.Add(offset); almIalm(0,0) = almI00; } else { double offset = almIalm(0,0).real()/sqrt(fourpi); xcomplex almI00 = almIalm(0,0); almIalm(0,0) = 0; alm2map_pol(almIalm,almGalm,almCalm,mapI,mapQ,mapU); mapI.Add(offset); almIalm(0,0) = almI00; } /* We now return the map */ if( !polarisation ) return Py_BuildValue("N",mapIout); else return Py_BuildValue("NNN",mapIout,mapQout,mapUout); } /*********************************************************************** alm2map_der1 input: alm, nside, output: map in RING scheme */ static PyObject *healpy_alm2map_der1(PyObject *self, PyObject *args, PyObject *kwds) { PyArrayObject *almIin = NULL; int nside = 64; int lmax = -1; int mmax = -1; static const char* kwlist[] = {"","nside", "lmax", "mmax", NULL}; if (!PyArg_ParseTupleAndKeywords(args, kwds, "O!|iii", (char **)kwlist, &PyArray_Type, &almIin, &nside, &lmax, &mmax)) { return NULL; } /* Check array is contiguous */ healpyAssertValue(almIin->flags & NPY_C_CONTIGUOUS, "Array must be C contiguous for this operation."); /* Check type of data : must be double, real ('d') or complex ('D') */ healpyAssertType(almIin->descr->type == 'D', "Type must be Complex for this function"); /* Check number of dimension : must be 1 */ healpyAssertValue(almIin->nd==1, "The map must be a 1D array"); /* Need to have lmax and mmax defined */ if( lmax < 0 ) { /* Check that the dimension is compatible with lmax=mmax */ long imax = almIin->dimensions[0] - 1; double ell = (-3.+sqrt(9.+8.*imax))/2.; healpyAssertValue(ell == floor(ell), "Wrong alm size (or give lmax and mmax)."); lmax=(int)floor(ell); mmax = lmax; } if( mmax < 0 || mmax > lmax) { mmax = lmax; } /* Check lmax and mmax are ok compared to alm.size */ int szalm = Alm< xcomplex >::Num_Alms(lmax,mmax); healpyAssertValue(almIin->dimensions[0] == szalm,"Wrong alm size."); /* Now we can build an Alm and give it to alm2map_iter */ Alm< xcomplex > almIalm; { arr< xcomplex > alm_arr((xcomplex*)almIin->data, szalm); almIalm.Set(alm_arr, lmax, mmax); } /* We must prepare the map */ npy_intp npix = nside2npix(nside); PyArrayObject *mapIout = NULL; mapIout = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&npix, PyArray_DOUBLE); if( !mapIout ) return NULL; Healpix_Map mapI; { arr arr_map((double*)mapIout->data, npix); mapI.Set(arr_map, RING); } PyArrayObject *mapDtheta = NULL; mapDtheta = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&npix, PyArray_DOUBLE); if( !mapDtheta ) return NULL; Healpix_Map mapDt; { arr arr_map((double*)mapDtheta->data, npix); mapDt.Set(arr_map, RING); } PyArrayObject *mapDphi = NULL; mapDphi = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&npix, PyArray_DOUBLE); if( !mapDphi ) return NULL; Healpix_Map mapDp; { arr arr_map((double*)mapDphi->data, npix); mapDp.Set(arr_map, RING); } /* We now call alm2map_der1 */ double offset = almIalm(0,0).real()/sqrt(fourpi); xcomplex almI00 = almIalm(0,0); almIalm(0,0) = 0; alm2map_der1(almIalm,mapI,mapDt,mapDp); mapI.Add(offset); almIalm(0,0) = almI00; return Py_BuildValue("NNN",mapIout,mapDtheta,mapDphi); } /* Functions needed to create alm from cl in the polarised case. The idea is as follow: - this function take as argument a sequence of n(n+1)/2 arrays, where n is the number of components - these arrays represents the symetric correlation matrices of n components - this functions use the cholesky decomposition to compute the */ /*********************************************************************** synalm input: a sequence of Cl(i,j) where 0<=i,j=j are given. output: alm */ static PyObject *healpy_synalm(PyObject *self, PyObject *args, PyObject *kwds) { int lmax=-1, mmax=-1; int ncl, nalm; const double sqrt_two = sqrt(2.); /* Take also a sequence of unit variance random vectors for the alm. */ static const char* kwlist[] = {"","", "", "", NULL}; PyObject *t = NULL; PyObject *u = NULL; DBGPRINTF("Parsing keyword\n"); if( !PyArg_ParseTupleAndKeywords(args, kwds, "OOii", (char **)kwlist, &t, &u, &lmax, &mmax) ) return NULL; DBGPRINTF("Checking sequence\n"); if( (!PySequence_Check(t)) || (!PySequence_Check(u)) ) return NULL; ncl = PySequence_Size(t); nalm = getn(ncl); DBGPRINTF("Sequence size: ncl=%d, nalm=%d\n", ncl, nalm); healpyAssertType((nalm>0)&&(PySequence_Size(u)==nalm), "First argument must be a sequence with " "n(n+1)/2 elements, and second argument " "a sequence with n elements."); DBGPRINTF("Allocating memory\n"); /* Memory allocation */ PyArrayObject **cls = NULL; PyArrayObject **alms = NULL; Alm< xcomplex > *almalms = NULL; double *mat = NULL; double *res = NULL; XMALLOC(cls, PyArrayObject*, ncl); XMALLOC(alms, PyArrayObject*, nalm); XNEW(almalms, Alm< xcomplex >, nalm); XMALLOC(mat, double, ncl); XMALLOC(res, double, ncl); /* From now on, I should do a 'goto fail' to return from the function in order to free allocated memory */ /* Get the cls objects. If an object is None, set the array to NULL */ for( int i=0; ilmax ) mmax=lmax; DBGPRINTF("lmax=%d, mmax=%d\n", lmax, mmax); /* Now, I check the arrays cls and alms are 1D and complex for alms */ DBGPRINTF("Check dimension and size of cls\n"); for( int i=0; ind != 1) //|| ((cls[i]->descr->type != 'd') && (cls[i]->descr->type != 'f')) ) || (cls[i]->descr->type != 'd') ) { PyErr_SetString(PyExc_TypeError, "Type of cls must be float64 and arrays must be 1D."); goto fail; } } DBGPRINTF("Check dimension and size of alms\n"); for( int i=0; ind != 1) || (alms[i]->descr->type != 'D') ) { PyErr_SetString(PyExc_TypeError, "Type of alms must be complex128 and arrays must be 1D."); goto fail; } } /* Now, I check that all alms have the same size and that it is compatible with lmax and mmax */ DBGPRINTF("Check alms have identical size\n"); int szalm; szalm = -1; for( int i=0; idimensions[0]; else if( alms[i]->dimensions[0] != szalm ) { PyErr_SetString(PyExc_ValueError, "All alms arrays must have same size."); goto fail; } } if( szalm != int(Alm< xcomplex >::Num_Alms(lmax,mmax)) ) { PyErr_SetString(PyExc_ValueError, "lmax and mmax are not compatible with size of alms."); goto fail; } DBGPRINTF("Alms have all size %d\n", szalm); /* Set the objects Alm */ DBGPRINTF("Set alm objects\n"); for( int i=0; i > * alm_arr; alm_arr = new arr< xcomplex >((xcomplex*)alms[i]->data, szalm); DBGPRINTF("Set...\n"); almalms[i].Set(*alm_arr, lmax, mmax); delete alm_arr; } /* Now, I can loop over l, for each l, I make the Cholesky decomposition of the correlation matrix given by the cls[*][l] */ DBGPRINTF("Start loop over l\n"); for( int l=0; l<=lmax; l++ ) { DBGPRINTF("l=%d\n", l); /* fill the matrix of cls */ for( int i=0; idimensions[0] < l ) mat[i] = 0.0; else { if( cls[i]->descr->type == 'f' ) mat[i] = (double)(*((float*)PyArray_GETPTR1(cls[i],l))); else mat[i] = *((double*)PyArray_GETPTR1(cls[i],l)); } } /* Make the Cholesky decomposition */ cholesky(nalm, mat, res); if( l == 400 ) { DBGPRINTF("matrice: "); for( int i=0; i=0; i-- ) { double x; x = 0.0; almalms[i](l,0).im = 0.0; for( int j=0; j<=i; j++ ) x += res[getidx(nalm,i,j)]*almalms[j](l,0).re; almalms[i](l,0).re = x; DBGPRINTF(" %lg %lg ;", almalms[i](l,0).re, almalms[i](l,0).im); } DBGPRINTF("\n"); /* m > 1 */ for( int m=1; m<=l; m++ ) { DBGPRINTF(" m=%d: ", m); for( int i=nalm-1; i>=0; i-- ) { double xr, xi; xi = xr = 0.0; for( int j=0; j<=i; j++ ) { xr += res[getidx(nalm,i,j)]*almalms[j](l,m).re; xi += res[getidx(nalm,i,j)]*almalms[j](l,m).im; DBGPRINTF("(res[%d]=%lg, alm=%lg,%lg) %lg %lg", (int)getidx(nalm,i,j), res[getidx(nalm,i,j)], almalms[j](l,m).re, almalms[j](l,m).im, xr, xi); } almalms[i](l,m).re = xr/sqrt_two; almalms[i](l,m).im = xi/sqrt_two; DBGPRINTF(" xre,xim[%d]: %lg %lg ;", i, almalms[i](l,m).re, almalms[i](l,m).im); } DBGPRINTF("\n"); } } /* Should be finished now... */ XFREE(cls); XFREE(alms); XDELETE(almalms); XFREE(mat); XFREE(res); Py_INCREF(Py_None); return Py_None; /* To be done before returning */ fail: XFREE(cls); XFREE(alms); XDELETE(almalms); XFREE(mat); XFREE(res); return NULL; } PyObject *healpy_getn(PyObject *self, PyObject *args) { long s; healpyAssertType (PyArg_ParseTuple(args, "l", &s), "This function takes an integer as argument."); long n = getn(s); return Py_BuildValue("l",n); } static PyMethodDef methods[] = { {"_map2alm", (PyCFunction)healpy_map2alm, METH_VARARGS | METH_KEYWORDS, "Compute alm or cl from an input map.\n" "The input map is assumed to be ordered in RING.\n" "anafast(map,lmax=3*nside-1,mmax=lmax,cl=False,\n" " iter=3,use_weights=False,data_path=None"}, {"_alm2map", (PyCFunction)healpy_alm2map, METH_VARARGS | METH_KEYWORDS, "Compute a map from alm.\n" "The output map is ordered in RING scheme.\n" "alm2map(alm,nside=64,lmax=-1,mmax=-1)"}, {"_alm2map_der1", (PyCFunction)healpy_alm2map_der1, METH_VARARGS | METH_KEYWORDS, "Compute a map and derivatives from alm.\n" "The output map is ordered in RING scheme.\n" "alm2map_der1(alm,nside=64,lmax=-1,mmax=-1)"}, {"_synalm", (PyCFunction)healpy_synalm, METH_VARARGS | METH_KEYWORDS, "Compute alm's given cl's and unit variance random arrays.\n"}, {"_getn", healpy_getn, METH_VARARGS, "Compute number n such that n(n+1)/2 is equal to the argument.\n"}, {NULL, NULL, 0, NULL} /* Sentinel */ }; #if PY_MAJOR_VERSION >= 3 static PyModuleDef moduledef = { PyModuleDef_HEAD_INIT, "_healpy_sph_transform_lib", NULL, -1, methods }; #endif PyMODINIT_FUNC #if PY_MAJOR_VERSION < 3 init_healpy_sph_transform_lib(void) #else PyInit__healpy_sph_transform_lib(void) #endif { import_array(); #if PY_MAJOR_VERSION < 3 Py_InitModule("_healpy_sph_transform_lib", methods); #else return PyModule_Create(&moduledef); #endif } healpy-1.8.1/healpy/src/_pixelfunc.pyx0000644000175000017500000000753712351601276020237 0ustar zoncazonca00000000000000# Wrapper around the geometry methods in Healpix_base class import numpy as np cimport numpy as np from libcpp cimport bool cimport cython from _common cimport int64, Healpix_Ordering_Scheme, RING, NEST, SET_NSIDE, T_Healpix_Base def ringinfo(nside, np.ndarray[int64, ndim=1] ring not None): """Get information for rings Rings are specified by a positive integer, 1 <= ring <= 4*nside-1. Parameters ---------- nside : int The healpix nside parameter, must be a power of 2, less than 2**30 ring : int, scalar or array-like The ring number Returns ------- startpix : int64, length equal to that of *ring* Starting pixel identifier (NEST ordering) ringpix : int64, length equal to that of *ring* Number of pixels in ring costheta : float, length equal to that of *ring* Cosine of the co-latitude sintheta : float, length equal to that of *ring* Sine of the co-latitude shifted : bool, length equal to that of *ring* If True, the center of the first pixel is not at phi=0 Example ------- >>> import healpy as hp >>> import numpy as np >>> nside = 2 >>> hp.ringinfo(nside, np.arange(4*nside-1)) (array([ 0, 0, 4, 12, 20, 28, 36]), array([0, 4, 8, 8, 8, 8, 8]), array([ 1. , 0.91666667, 0.66666667, 0.33333333, 0. , -0.33333333, -0.66666667]), array([ 0. , 0.39965263, 0.74535599, 0.94280904, 1. , 0.94280904, 0.74535599]), array([ True, True, True, False, True, False, True], dtype=bool)) """ if not isnsideok(nside): raise ValueError('Wrong nside value, must be a power of 2, less than 2**30') cdef Healpix_Ordering_Scheme scheme = NEST cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) num = ring.shape[0] cdef np.ndarray[int64, ndim=1] startpix = np.empty(num, dtype=np.int64) cdef np.ndarray[int64, ndim=1] ringpix = np.empty(num, dtype=np.int64) cdef np.ndarray[double, ndim=1] costheta = np.empty(num, dtype=np.float) cdef np.ndarray[double, ndim=1] sintheta = np.empty(num, dtype=np.float) cdef np.ndarray[bool, ndim=1, cast=True] shifted = np.empty(num, dtype=np.bool) for i in range(num): hb.get_ring_info(ring[i], startpix[i], ringpix[i], costheta[i], sintheta[i], shifted[i]) return startpix, ringpix, costheta, sintheta, shifted def pix2ring(nside, np.ndarray[int64, ndim=1] pix not None, nest=False): """Convert pixel identifier to ring number Rings are specified by a positive integer, 1 <= ring <= 4*nside-1. Parameters ---------- nside : int The healpix nside parameter, must be a power of 2, less than 2**30 pix : int64, scalar or array-like The pixel identifier(s) nest : bool Is *pix* specified in the NEST ordering scheme? Returns ------- ring : int, length equal to that of *pix* Ring number Example ------- >>> import healpy as hp >>> import numpy as np >>> nside = 2 >>> hp.pix2ring(nside, np.arange(hp.nside2npix(nside))) array([1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7]) """ if not isnsideok(nside): raise ValueError('Wrong nside value, must be a power of 2, less than 2**30') cdef Healpix_Ordering_Scheme scheme if nest: scheme = NEST else: scheme = RING cdef T_Healpix_Base[int64] hb = T_Healpix_Base[int64](nside, scheme, SET_NSIDE) num = pix.shape[0] cdef np.ndarray[int64, ndim=1] ring = np.empty(num, dtype=np.int64) for i in range(num): ring[i] = hb.pix2ring(pix[i]) return ring cdef bool isnsideok(int nside): if nside < 0 or nside != 2**int(round(np.log2(nside))): return False else: return True healpy-1.8.1/healpy/src/_healpy_utils.h0000650000175000017530000000053611705033043020472 0ustar zoncaplanck00000000000000#ifndef HEALPY_UTILS_H #define HEALPY_UTILS_H #define healpyAssertType(testval,msg) \ do { if (testval); else { PyErr_SetString(PyExc_TypeError, msg); return NULL; } } while(0) #define healpyAssertValue(testval,msg) \ do { if (testval); else { PyErr_SetString(PyExc_ValueError, msg); return NULL; } } while(0) #define CP_(str)(char *)(str) #endif healpy-1.8.1/healpy/src/_healpy_fitsio_lib.cc0000644000175000017500000000613612351601276021466 0ustar zoncazonca00000000000000/* * This file is part of Healpy. * * Healpy 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 2 of the License, or * (at your option) any later version. * * Healpy 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 Healpy; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about Healpy, see http://code.google.com/p/healpy */ /* This module provides Healpix functions to Python. It uses the healpix_cxx library. */ #include #include #include #include "numpy/arrayobject.h" #include "healpix_data_io.h" #include "arr.h" #include "_healpy_utils.h" /*********************************************************************** healpy_pixwin input: nside, data_path, pol=False output: W(l), the pixel window function */ static PyObject *healpy_pixwin(PyObject *self, PyObject *args, PyObject *kwds) { int nside; char * datapath=NULL; int polarisation = 0; /* not polarised by default */ static const char* kwlist[] = {"","", "pol", NULL}; if (!PyArg_ParseTupleAndKeywords(args, kwds, "is|i", (char **)kwlist, &nside, &datapath, &polarisation)) return NULL; healpyAssertValue((nside&(nside-1))==0, "Wrong nside value (must be a power of 2, less than 2**30)"); arr pw_temp, pw_pol; read_pixwin(datapath, nside, pw_temp, pw_pol); npy_intp szpw; szpw = pw_temp.size(); PyArrayObject *pixwin_temp = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&szpw, PyArray_DOUBLE); if( !pixwin_temp ) return NULL; PyArrayObject *pixwin_pol = (PyArrayObject*)PyArray_SimpleNew(1, (npy_intp*)&szpw, PyArray_DOUBLE); if( !pixwin_pol ) return NULL; for(int i=0; i= 3 static PyModuleDef moduledef = { PyModuleDef_HEAD_INIT, "_healpy_sph_transform_lib", NULL, -1, methods }; #endif PyMODINIT_FUNC #if PY_MAJOR_VERSION < 3 init_healpy_fitsio_lib(void) #else PyInit__healpy_fitsio_lib(void) #endif { import_array(); #if PY_MAJOR_VERSION < 3 Py_InitModule("_healpy_fitsio_lib", methods); #else return PyModule_Create(&moduledef); #endif } healpy-1.8.1/healpy/src/_common.pxd0000644000175000017500000001153412351422052017466 0ustar zoncazonca00000000000000import numpy as np cimport numpy as np from libcpp cimport bool from libcpp.vector cimport vector ctypedef unsigned size_t ctypedef size_t tsize cdef extern from "stddef.h": ctypedef long ptrdiff_t ctypedef ptrdiff_t tdiff cdef extern from "datatypes.h": ctypedef int int64 cdef extern from "xcomplex.h": cdef cppclass xcomplex[T]: T re, im cdef extern from "arr.h": cdef cppclass arr[T]: arr() arr(T *ptr, tsize sz) void allocAndFill (tsize sz, T &inival) tsize size() T &operator[] (tsize n) cdef cppclass fix_arr[T, int]: pass cdef extern from "rangeset.h": cdef cppclass rangeset[T]: tsize size() int64 nval() T ivbegin(tdiff i) T ivend(tdiff i) cdef extern from "vec3.h": cdef cppclass vec3: double x, y, z vec3() vec3(double xc, double yc, double zc) cdef extern from "pointing.h": cdef cppclass pointing: pointing() pointing(vec3 inp) void normalize() double theta double phi cdef extern from "healpix_base.h": ctypedef int val_4 "4" ctypedef int val_8 "8" cdef enum Healpix_Ordering_Scheme: RING, NEST cdef cppclass nside_dummy: pass cdef nside_dummy SET_NSIDE cdef cppclass T_Healpix_Base[I]: int nside2order(I nside) I npix2nside(I npix) T_Healpix_Base() T_Healpix_Base(int order, Healpix_Ordering_Scheme scheme) T_Healpix_Base(I nside, Healpix_Ordering_Scheme scheme, nside_dummy) void Set(int order, Healpix_Ordering_Scheme scheme) void SetNside(I nside, Healpix_Ordering_Scheme scheme) double ring2z(I ring) I pix2ring(I pix) I xyf2pix(int ix, int iy, int face_num) void pix2xyf(I pix, int &ix, int &iy, int &face_num) I nest2ring(I pix) I ring2nest(I pix) I nest2peano(I pix) I peano2nest(I pix) I zphi2pix(double z, double phi) I ang2pix(pointing &ang) I vec2pix(vec3 &vec) void pix2zphi(I pix, double &z, double &phi) pointing pix2ang(I pix) vec3 pix2vec(I pix) void get_ring_info(I ring, I &startpix, I &ringpix, double &costheta, double &sintheta, bool &shifted) void get_ring_info2(I ring, I &startpix, I &ringpix, double &theta, bool &shifted) void get_ring_info_small(I ring, I &startpix, I &ringpix, bool &shifted) void neighbors(I pix, fix_arr[I,val_8] &result) void get_interpol(pointing &ptg, fix_arr[I,val_4] &pix, fix_arr[double,val_4] &wgt) int Order() I Nside() I Npix() Healpix_Ordering_Scheme Scheme() bool conformable(T_Healpix_Base &other) void swap(T_Healpix_Base &other) double max_pixrad() double max_pixrad(I ring) void boundaries(I pix, size_t step, vector[vec3] &out) arr[int] swap_cycles() void query_disc(pointing ptg, double radius, rangeset[I]& pixset) void query_disc_inclusive(pointing ptg, double radius, rangeset[I]& pixset, int fact) void query_polygon(vector[pointing] vert, rangeset[I]& pixset) void query_polygon_inclusive(vector[pointing] vert, rangeset[I]& pixset, int fact) void query_strip(double theta1, double theta2, bool inclusive, rangeset[I]& pixset) cdef extern from "healpix_map.h": cdef cppclass Healpix_Map[T]: Healpix_Map() void Set(arr[T] &data, Healpix_Ordering_Scheme scheme) T average() void Add(T x) cdef extern from "alm.h": cdef cppclass Alm[T]: Alm() Alm(int lmax_, int mmax_) void Set (int lmax_, int mmax_) void Set (arr[T] &data, int lmax_, int mmax_) tsize Num_Alms (int l, int m) cdef inline Healpix_Map[double]* ndarray2map(np.ndarray[np.float64_t, ndim=1, mode='c'] array, Healpix_Ordering_Scheme scheme) except *: """ View a contiguous ndarray as a Healpix Map. """ # To ensure that the output map is a view of the input array, the latter # is forced to be contiguous, of correct type and dimensions (otherwise, an # exception is raised). cdef arr[double] *a = new arr[double](&array[0], array.size) cdef Healpix_Map[double] *map = new Healpix_Map[double]() map.Set(a[0], scheme) del a # a does not own its buffer, so it won't be deallocated return map cdef inline Alm[xcomplex[double]]* ndarray2alm(np.ndarray[np.complex128_t, ndim=1, mode='c'] array, int lmax, int mmax) except *: """ View a contiguous ndarray as an Alm. """ cdef arr[xcomplex[double]] *a = new arr[xcomplex[double]](&array[0], array.size) cdef Alm[xcomplex[double]] *alm = new Alm[xcomplex[double]]() alm.Set(a[0], lmax, mmax) del a return alm healpy-1.8.1/healpy/projector.py0000644000175000017500000010215012346125412017113 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # """This module provides classes for some spherical projection. To be used when calling SphereProjAxes class. SphericalProj : a virtual class (do nothing). Just a template for derived (useful) classes GnomonicProj : Gnomonic projection """ from . import rotator as R import numpy as np from . import pixelfunc from .pixelfunc import UNSEEN pi = np.pi dtor = np.pi/180. class SphericalProj(object): """ This class defines functions for spherical projection. This class contains class method for spherical projection computation. It should not be instantiated. It should be inherited from and methods should be overloaded for desired projection. """ name = "None" def __init__(self, rot=None, coord=None, flipconv=None, **kwds): self.rotator = R.Rotator(rot=rot, coord=None, eulertype='ZYX') self.coordsys = R.Rotator(coord=coord).coordout self.coordsysstr = R.Rotator(coord=coord).coordoutstr self.set_flip(flipconv) self.set_proj_plane_info(**kwds) def set_proj_plane_info(self, **kwds): allNone = True for v in kwds.values(): if v is not None: allNone = False if not allNone: self._arrayinfo = dict(kwds) else: self._arrayinfo = None def get_proj_plane_info(self): return self._arrayinfo arrayinfo = property(get_proj_plane_info, doc="Dictionary with information on the projection array") def __eq__(self, a): if type(a) is not type(self): return False return ( (self.rotator == a.rotator) and (self.coordsys == a.coordsys ) ) def ang2xy(self, theta, phi=None, lonlat=False, direct=False): """From angular direction to position in the projection plane (%s). Input: - theta: if phi is None, theta[0] contains theta, theta[1] contains phi - phi : if phi is not None, theta,phi are direction - lonlat: if True, angle are assumed in degree, and longitude, latitude - flipconv is either 'astro' or 'geo'. None will be default. Return: - x, y: position in %s plane. """ pass def vec2xy(self, vx, vy=None, vz=None, direct=False): """From unit vector direction to position in the projection plane (%s). Input: - vx: if vy and vz are None, vx[0],vx[1],vx[2] defines the unit vector. - vy,vz: if defined, vx,vy,vz define the unit vector - lonlat: if True, angle are assumed in degree, and longitude, latitude - flipconv is either 'astro' or 'geo'. None will be default. Return: - x, y: position in %s plane. """ pass def xy2ang(self, x, y=None, lonlat=False, direct=False): """From position in the projection plane to angular direction (%s). Input: - x : if y is None, x[0], x[1] define the position in %s plane. - y : if defined, x,y define the position in projection plane. - lonlat: if True, angle are assumed in degree, and longitude, latitude - flipconv is either 'astro' or 'geo'. None will be default. Return: - theta, phi : angular direction. """ pass def xy2vec(self, x, y=None, direct=False): """From position in the projection plane to unit vector direction (%s). Input: - x : if y is None, x[0], x[1] define the position in %s plane. - y : if defined, x,y define the position in projection plane. - lonlat: if True, angle are assumed in degree, and longitude, latitude - flipconv is either 'astro' or 'geo'. None will be default. Return: - theta, phi : angular direction. """ pass def xy2ij(self, x, y=None): """From position in the projection plane to image array index (%s). Input: - x : if y is None, x[0], x[1] define the position in %s plane. - y : if defined, x,y define the position in projection plane. - projinfo : additional projection information. Return: - i,j : image array indices. """ pass def ij2xy(self, i=None, j=None): """From image array indices to position in projection plane (%s). Input: - if i and j are None, generate arrays of i and j as input - i : if j is None, i[0], j[1] define array indices in %s image. - j : if defined, i,j define array indices in image. - projinfo : additional projection information. Return: - x,y : position in projection plane. """ pass def projmap(self, map, vec2pix_func,rot=None,coord=None): """Create an array containing the projection of the map. Input: - vec2pix_func: a function taking theta,phi and returning pixel number - map: an array containing the spherical map to project, the pixelisation is described by vec2pix_func Return: - a 2D array with the projection of the map. Note: the Projector must contain information on the array. """ x,y = self.ij2xy() if np.__version__ >= '1.1': matype = np.ma.core.MaskedArray else: matype = np.ma.array if type(x) is matype and x.mask is not np.ma.nomask: w = (x.mask == False) else: w = slice(None) img=np.zeros(x.shape,np.float64)-np.inf vec = self.xy2vec(np.asarray(x[w]),np.asarray(y[w])) vec = (R.Rotator(rot=rot,coord=self.mkcoord(coord))).I(vec) pix=vec2pix_func(vec[0],vec[1],vec[2]) # support masked array for map, or a dictionnary (for explicit pixelisation) if isinstance(map, matype) and map.mask is not np.ma.nomask: mpix = map[pix] mpix[map.mask[pix]] = UNSEEN elif isinstance(map, dict): is_pix_seen = np.in1d(pix, map.keys()).reshape(pix.shape) is_pix_unseen = ~is_pix_seen mpix = np.zeros_like(img[w]) mpix[is_pix_unseen] = UNSEEN pix_seen = pix[is_pix_seen] iterable = (map[p] for p in pix_seen) mpix[is_pix_seen] = np.fromiter(iterable, mpix.dtype, count = pix_seen.size) else: mpix = map[pix] img[w] = mpix return img def set_flip(self, flipconv): """flipconv is either 'astro' or 'geo'. None will be default. With 'astro', east is toward left and west toward right. It is the opposite for 'geo' """ if flipconv is None: flipconv = 'astro' # default if flipconv == 'astro': self._flip = -1 elif flipconv == 'geo': self._flip = 1 else: raise ValueError("flipconv must be 'astro', 'geo' or None for default.") def get_extent(self): """Get the extension of the projection plane. Return: extent = (left,right,bottom,top) """ pass def get_fov(self): """Get the field of view in degree of the plane of projection Return: fov: the diameter in radian of the field of view """ return 2.*pi def get_center(self,lonlat=False): """Get the center of the projection. Input: - lonlat : if True, will return longitude and latitude in degree, otherwise, theta and phi in radian Return: - theta,phi or lonlat depending on lonlat keyword """ lon, lat = np.asarray(self.rotator.rots[0][0:2])*180/pi if lonlat: return lon,lat else: return pi/2.-lat*dtor, lon*dtor def mkcoord(self,coord): if self.coordsys is None: return (coord,coord) elif coord is None: return (self.coordsys,self.coordsys) elif type(coord) is str: return (coord,self.coordsys) else: return (tuple(coord)[0],self.coordsys) class GnomonicProj(SphericalProj): """This class provides class methods for Gnomonic projection. """ name = "Gnomonic" def __init__(self, rot=None, coord=None, xsize=None, ysize=None, reso=None, **kwds): super(GnomonicProj,self).__init__(rot=rot, coord=coord, xsize=xsize, ysize=ysize,reso=reso, **kwds) def set_proj_plane_info(self, xsize=200,ysize=None,reso=1.5): if xsize is None: xsize=200 if ysize is None: ysize=xsize if reso is None: reso=1.5 super(GnomonicProj,self).set_proj_plane_info(xsize=xsize, ysize=ysize,reso=reso) def vec2xy(self, vx, vy=None, vz=None, direct=False): if not direct: vec = self.rotator(vx,vy,vz) elif vy is None and vz is None: vec=vx elif vy is not None and vz is not None: vec=vx,vy,vz else: raise ValueError("vy and vz must be both defined or both not defined") flip = self._flip mask = (np.asarray(vec[0])<=0.) w = np.where(mask == False) if not mask.any(): mask=np.ma.nomask if not hasattr(vec[0],'__len__'): if mask is not np.ma.nomask: x = np.nan y = np.nan else: x = flip*vec[1]/vec[0] y = vec[2]/vec[0] else: x = np.zeros(vec[0].shape)+np.nan y = np.zeros(vec[0].shape)+np.nan x[w] = flip*vec[1][w]/vec[0][w] y[w] = vec[2][w]/vec[0][w] return x,y vec2xy.__doc__ = SphericalProj.ang2xy.__doc__ % (name,name) def xy2vec(self, x, y=None, direct=False): flip = self._flip if y is None: x,y = x x,y=np.asarray(x),np.asarray(y) rm1=1./np.sqrt(1.+x**2+y**2) vec = (rm1,flip*rm1*x,rm1*y) if not direct: return self.rotator.I(vec) else: return vec xy2vec.__doc__ = SphericalProj.xy2vec.__doc__ % (name,name) def ang2xy(self, theta, phi=None, lonlat=False, direct=False): vec=R.dir2vec(theta,phi,lonlat=lonlat) return self.vec2xy(vec,direct=direct) ang2xy.__doc__ = SphericalProj.ang2xy.__doc__ % (name,name) def xy2ang(self, x, y=None, lonlat=False, direct=False): return R.vec2dir(self.xy2vec(x,y,direct=direct),lonlat=lonlat) xy2ang.__doc__ = SphericalProj.xy2ang.__doc__ % (name,name) def xy2ij(self, x, y=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for " "this projector") xsize,ysize = self.arrayinfo['xsize'],self.arrayinfo['ysize'] reso = self.arrayinfo['reso'] if y is None: x,y = x dx = reso/60. * dtor xc,yc = 0.5*(xsize-1), 0.5*(ysize-1) j = np.around(xc+x/dx).astype(np.long) i = np.around(yc+y/dx).astype(np.long) return i,j xy2ij.__doc__ = SphericalProj.xy2ij.__doc__ % (name,name) def ij2xy(self, i=None, j=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for " "this projector") xsize,ysize = self.arrayinfo['xsize'],self.arrayinfo['ysize'] reso = self.arrayinfo['reso'] dx = reso/60. * dtor xc,yc = 0.5*(xsize-1), 0.5*(ysize-1) if i is None and j is None: idx=np.outer(np.ones(xsize),np.arange(ysize)) x=(idx-xc) * dx # astro= '-' sign, geo '+' sign idx=np.outer(np.arange(xsize),np.ones(ysize)) y=(idx-yc)*dx #(idx-yc) * dx elif i is not None and j is not None: x=(np.asarray(j)-xc) * dx y=(np.asarray(i)-yc) * dx #(asarray(i)-yc) * dx elif i is not None and j is None: i, j = i x=(np.asarray(j)-xc) * dx y=(np.asarray(i)-yc) * dx #(i-yc) * dx else: raise TypeError("Wrong parameters") return x,y ij2xy.__doc__ = SphericalProj.ij2xy.__doc__ % (name,name) def get_extent(self): xsize,ysize = self.arrayinfo['xsize'],self.arrayinfo['ysize'] left,bottom = self.ij2xy(0,0) right,top = self.ij2xy(xsize-1,ysize-1) return (left,right,bottom,top) def get_fov(self): vx,vy,vz = self.xy2vec(self.ij2xy(0,0), direct=True) a = np.arccos(vx) return 2.*a class MollweideProj(SphericalProj): """This class provides class methods for Mollweide projection. """ name = "Mollweide" __molldata = [] def __init__(self, rot=None, coord=None, xsize=800, **kwds): self.__initialise_data() super(MollweideProj,self).__init__(rot=rot, coord=coord, xsize=xsize, **kwds) def set_proj_plane_info(self,xsize): super(MollweideProj,self).set_proj_plane_info(xsize=xsize) def vec2xy(self, vx, vy=None, vz=None, direct=False): if not direct: theta,phi=R.vec2dir(self.rotator(vx,vy,vz)) else: theta,phi=R.vec2dir(vx,vy,vz) flip = self._flip X,Y = MollweideProj.__molldata # set phi in [-pi,pi] phi = (phi+pi)%(2*pi)-pi lat = pi/2. - theta A = MollweideProj.__lininterp(X,Y,lat) x = flip*2./pi * phi * np.cos(A) y = np.sin(A) return x,y vec2xy.__doc__ = SphericalProj.vec2xy.__doc__ % (name,name) def xy2vec(self, x, y=None, direct=False): flip = self._flip if y is None: x,y = x mask = (np.asarray(x)**2/4.+np.asarray(y)**2 > 1.) w=np.where(mask == False) if not mask.any(): mask = np.ma.nomask if not hasattr(x,'__len__'): if mask is not np.ma.nomask: return np.nan,np.nan,np.nan else: s = np.sqrt((1-y)*(1+y)) a = np.arcsin(y) z = 2./pi * (a + y*s) phi = flip * pi/2. * x/np.maximum(s,1.e-6) sz = np.sqrt((1-z)*(1+z)) vec = sz*np.cos(phi),sz*np.sin(phi),z if not direct: return self.rotator.I(vec) else: return vec else: vec = (np.zeros(x.shape)+np.nan, np.zeros(x.shape)+np.nan, np.zeros(x.shape)+np.nan) s = np.sqrt((1-y[w])*(1+y[w])) a = np.arcsin(y[w]) vec[2][w] = 2./pi * (a + y[w]*s) phi = flip * pi/2. * x[w]/np.maximum(s,1.e-6) sz = np.sqrt((1-vec[2][w])*(1+vec[2][w])) vec[0][w] = sz*np.cos(phi) vec[1][w] = sz*np.sin(phi) if not direct: return self.rotator.I(vec) else: return vec xy2vec.__doc__ = SphericalProj.xy2vec.__doc__ % (name,name) def ang2xy(self, theta, phi=None, lonlat=False, direct=False): return self.vec2xy(R.dir2vec(theta,phi,lonlat=lonlat),direct=direct) ang2xy.__doc__ = SphericalProj.ang2xy.__doc__ % (name,name) def xy2ang(self, x, y=None, lonlat=False, direct=False): vec = self.xy2vec(x,y,direct=direct) return R.vec2dir(vec,lonlat=lonlat) xy2ang.__doc__ = SphericalProj.xy2ang.__doc__ % (name,name) def xy2ij(self, x, y=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for " "this projector") xsize = self.arrayinfo['xsize'] ysize=xsize/2 if y is None: x,y = x xc,yc = (xsize-1.)/2., (ysize-1.)/2. if hasattr(x,'__len__'): j = np.around(x*xc/2.+xc).astype(np.long) i = np.around(yc+y*yc).astype(np.long) mask = (x**2/4.+y**2>1.) if not mask.any(): mask=np.ma.nomask j=np.ma.array(j,mask=mask) i=np.ma.array(i,mask=mask) else: if x**2/4.+y**2 > 1.: i,j=np.nan,np.nan else: j = np.around(x*xc/2.+xc).astype(np.long) i = np.around(yc+y*yc).astype(np.long) return i,j xy2ij.__doc__ = SphericalProj.xy2ij.__doc__ % (name,name) def ij2xy(self, i=None, j=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for " "this projector") xsize = self.arrayinfo['xsize'] ysize=xsize/2 xc,yc=(xsize-1.)/2.,(ysize-1.)/2. if i is None and j is None: idx = np.outer(np.arange(ysize),np.ones(xsize)) y = (idx-yc)/yc idx = np.outer(np.ones(ysize),np.arange(xsize)) x = 2.*(idx-xc)/xc mask = x**2/4.+y**2 > 1. if not mask.any(): mask=np.ma.nomask x = np.ma.array(x,mask=mask) y = np.ma.array(y,mask=mask) elif i is not None and j is not None: y = (np.asarray(i)-yc)/yc x=2.*(np.asarray(j)-xc)/xc if x**2/4.+y**2 > 1.: x,y=np.nan,np.nan elif i is not None and j is None: i,j = i y=(np.asarray(i)-yc)/yc x=2.*(np.asarray(j)-xc)/xc if x**2/4.+y**2 > 1.: x,y=np.nan,np.nan else: raise TypeError("i and j must be both given or both not given") return x,y ij2xy.__doc__ = SphericalProj.ij2xy.__doc__ % (name,name) def get_extent(self): return (-2.0,2.0,-1.0,1.0) @staticmethod def __initialise_data(): if len(MollweideProj.__molldata) == 0: X = (np.arange(1.,180.,1.)-90.)*dtor Y = MollweideProj.__findRoot(MollweideProj.__fmoll, MollweideProj.__dfmoll, X.copy(),X,niter=10) X = np.concatenate([[-pi/2],X,[pi/2]]) Y = np.concatenate([[-pi/2],Y,[pi/2]]) MollweideProj.__molldata.append( X ) MollweideProj.__molldata.append( Y ) return @staticmethod def __findRoot(f, df, x0, argsf=None, argsdf=None, niter=100): x = x0 niter = min(abs(niter),1000) i = 0 while i < niter: dx = -f(x,argsf)/df(x,argsdf) x += dx i += 1 return x @staticmethod def __fmoll(x,args): return 2.*x+np.sin(2.*x)-pi*np.sin(args) @staticmethod def __dfmoll(x,args): return 2.*(1.+np.cos(2.*x)) @staticmethod def __lininterp(X,Y,x): idx = X.searchsorted(x) y = Y[idx-1] + (Y[idx]-Y[idx-1])/(X[idx]-X[idx-1]) * (x-X[idx-1]) return y class CartesianProj(SphericalProj): """This class provides class methods for Cartesian projection. """ name = "Cartesian" def __init__(self, rot=None, coord=None, xsize=800, ysize=None, lonra=None, latra=None, **kwds): super(CartesianProj,self).__init__(rot=rot, coord=coord, xsize=xsize, ysize=ysize, lonra=lonra, latra=latra, **kwds) def set_proj_plane_info(self,xsize,ysize,lonra,latra): if lonra is None: lonra = [-180.,180.] if latra is None: latra = [-90.,90.] if (len(lonra)!=2 or len(latra)!=2 or lonra[0]<-180. or lonra[1]>180. or latra[0]<-90 or latra[1]>90 or lonra[0]>=lonra[1] or latra[0]>=latra[1]): raise TypeError("Wrong argument lonra or latra. Must be lonra=[a,b],latra=[c,d] " "with a=-180, b<=180, c>=-90, d<=+90") lonra = self._flip*np.float64(lonra)[::self._flip] latra = np.float64(latra) xsize = np.long(xsize) if ysize is None: ratio = (latra[1]-latra[0])/(lonra[1]-lonra[0]) ysize = np.long(round(ratio*xsize)) else: ysize = np.long(ysize) ratio = float(ysize)/float(xsize) if max(xsize,ysize) > 2000: if max(xsize,ysize) == xsize: xsize = 2000 ysize = np.long(round(ratio*xsize)) else: ysize = 2000 xsize = np.long(round(ysize/ratio)) super(CartesianProj,self).set_proj_plane_info(xsize=xsize, lonra=lonra, latra=latra, ysize=ysize, ratio=ratio) def vec2xy(self, vx, vy=None, vz=None, direct=False): if not direct: theta,phi=R.vec2dir(self.rotator(vx,vy,vz)) else: theta,phi=R.vec2dir(vx,vy,vz) flip = self._flip # set phi in [-pi,pi] x = flip*((phi+pi)%(2*pi)-pi) x /= dtor # convert in degree y = pi/2. - theta y /= dtor # convert in degree return x,y vec2xy.__doc__ = SphericalProj.vec2xy.__doc__ % (name,name) def xy2vec(self, x, y=None, direct=False): if y is None: x,y = np.asarray(x) else: x,y = np.asarray(x),np.asarray(y) flip = self._flip theta = pi/2.-y*dtor # convert in radian phi = flip*x*dtor # convert in radian # dir2vec does not support 2d arrays, so first use flatten and then # reshape back to previous shape if not direct: vec = self.rotator.I(R.dir2vec(theta.flatten(),phi.flatten())) else: vec = R.dir2vec(theta.flatten(),phi.flatten()) vec = [v.reshape(theta.shape) for v in vec] return vec xy2vec.__doc__ = SphericalProj.xy2vec.__doc__ % (name,name) def ang2xy(self, theta, phi=None, lonlat=False, direct=False): return self.vec2xy(R.dir2vec(theta,phi,lonlat=lonlat),direct=direct) ang2xy.__doc__ = SphericalProj.ang2xy.__doc__ % (name,name) def xy2ang(self, x, y=None, lonlat=False, direct=False): vec = self.xy2vec(x,y,direct=direct) return R.vec2dir(vec,lonlat=lonlat) xy2ang.__doc__ = SphericalProj.xy2ang.__doc__ % (name,name) def xy2ij(self, x, y=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for " "this projector") xsize = self.arrayinfo['xsize'] ysize = self.arrayinfo['ysize'] lonra = self.arrayinfo['lonra'] latra = self.arrayinfo['latra'] if y is None: x,y = np.asarray(x) else: x,y = np.asarray(x), np.asarray(y) j = np.around((x-lonra[0])/(lonra[1]-lonra[0])*(xsize-1)).astype(np.int64) i = np.around((y-latra[0])/(latra[1]-latra[0])*(ysize-1)).astype(np.int64) if len(x.shape) > 0: mask = ((i<0)|(i>=ysize)|(j<0)|(j>=xsize)) if not mask.any(): mask=np.ma.nomask j=np.ma.array(j,mask=mask) i=np.ma.array(i,mask=mask) else: if j<0 or j>=xsize or i<0 or i>=ysize: i=j=None return i,j xy2ij.__doc__ = SphericalProj.xy2ij.__doc__ % (name,name) def ij2xy(self, i=None, j=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for " "this projector") xsize = self.arrayinfo['xsize'] ysize = self.arrayinfo['ysize'] lonra = self.arrayinfo['lonra'] latra = self.arrayinfo['latra'] if i is not None and j is None: i,j = np.asarray(i) elif i is not None and j is not None: i,j = np.asarray(i),np.asarray(j) if i is None and j is None: idx = np.outer(np.arange(ysize),np.ones(xsize)) y = (float(latra[1]-latra[0])/(ysize-1.)) * idx y += latra[0] idx = np.outer(np.ones(ysize),np.arange(xsize)) x = (float(lonra[1]-lonra[0])/(xsize-1.) * idx) x += lonra[0] x = np.ma.array(x) y = np.ma.array(y) elif i is not None and j is not None: y = (float(latra[1]-latra[0])/(ysize-1) ) * i y += latra[0] x = (float(lonra[1]-lonra[0])/(xsize-1)) * j x += lonra[0] if len(i.shape) > 0: mask = ((x<-180)|(x>180)|(y<-90)|(y>90)) if not mask.any(): mask = np.ma.nomask x = np.ma.array(x,mask=mask) y = np.ma.array(y,mask=mask) else: if x<-180 or x>180 or y<-90 or y>90: x = y = np.nan else: raise TypeError("i and j must be both given or both not given") return x,y ij2xy.__doc__ = SphericalProj.ij2xy.__doc__ % (name,name) def get_extent(self): lonra = self.arrayinfo['lonra'] latra = self.arrayinfo['latra'] return (lonra[0],lonra[1],latra[0],latra[1]) get_extent.__doc__ = SphericalProj.get_extent.__doc__ def get_fov(self): xsize = self.arrayinfo['xsize'] ysize = self.arrayinfo['ysize'] v1 = np.asarray(self.xy2vec(self.ij2xy(0,0), direct=True)) v2 = np.asarray(self.xy2vec(self.ij2xy(ysize-1,xsize-1), direct=True)) a = np.arccos((v1*v2).sum()) return 2*a # def get_fov(self): # lonra = self.arrayinfo['lonra'] # latra = self.arrayinfo['latra'] # return np.sqrt((lonra[1]-lonra[0])**2+(latra[1]-latra[0])**2) def get_center(self,lonlat=False): lonra = self.arrayinfo['lonra'] latra = self.arrayinfo['latra'] xc = 0.5*(lonra[1]+lonra[0]) yc = 0.5*(latra[1]+latra[0]) return self.xy2ang(xc,yc,lonlat=lonlat) get_center.__doc__ = SphericalProj.get_center.__doc__ class OrthographicProj(SphericalProj): """This class provides methods for orthographic projection """ name = "Orthographic" def __init__(self, rot=None, coord=None, xsize=800, half_sky=False,**kwds): super(OrthographicProj,self).__init__(rot=rot, coord=coord,xsize=xsize, half_sky=half_sky,**kwds) def set_proj_plane_info(self,xsize,half_sky): super(OrthographicProj,self).set_proj_plane_info(xsize=xsize, half_sky=half_sky) def vec2xy(self, vx, vy=None, vz=None, direct=False): if not direct: theta,phi=R.vec2dir(self.rotator(vx,vy,vz)) else: theta,phi=R.vec2dir(vx,vy,vz) if self.arrayinfo is None: raise TypeError("No projection plane array information defined for" " this projector") half_sky = self.arrayinfo['half_sky'] flip = self._flip # set phi in [-pi,pi] phi = flip*(phi+pi)%(2*pi)-pi lat = pi/2. - theta x = np.cos(lat)*np.sin(phi) if not half_sky: x -= 1.0 y = np.sin(lat) # unfold back of sphere cosc = np.cos(lat)*np.cos(phi) if np.any(cosc<0): hmask = (cosc<0) if hasattr(x,'__len__'): if half_sky: x[hmask] = np.nan else: x[hmask] *= -1 elif hmask: if half_sky: x = np.nan else: x *= 1 if half_sky: mask = (np.asarray(x)**2+np.asarray(y)**2>1.0) else: mask = ((np.mod(np.asarray(x)+2.0,2.0)-1.0)**2 + \ np.asarray(y)**2>1.0) if mask.any(): if not hasattr(x,'__len__'): x = np.nan y = np.nan else: x[mask] = np.nan y[mask] = np.nan return x,y vec2xy.__doc__ = SphericalProj.vec2xy.__doc__ % (name,name) def xy2vec(self, x, y=None, direct=False): if y is None: x,y = x if hasattr(x,'__len__'): x,y = np.asarray(x),np.asarray(y) if self.arrayinfo is None: raise TypeError("No projection plane array information defined for" " this projector") half_sky = self.arrayinfo['half_sky'] flip = self._flip # re-fold back of sphere mask = None if not half_sky: if hasattr(x,'__len__'): if np.any(x>0.0): mask = (x>0.0) x[mask] *= -1 elif x>0: mask = 0 x = -x x+=1.0 r = np.sqrt(x**2+y**2) if hasattr(r,'__len__'): r[r>1] = np.nan elif r>1: r = np.nan c = np.arcsin(r) if hasattr(y,'__len__'): y[np.abs(y)>1] = np.nan elif np.abs(y)>1: y = np.nan lat = np.arcsin(y) phi = np.arctan2(x,np.cos(c)) phi *= flip if not mask is None: if hasattr(phi,'__len__'): phi[mask] = pi-phi[mask] else: phi = pi-phi theta = pi/2. - lat vec = R.dir2vec(theta,phi) if not direct: return self.rotator.I(vec) else: return vec xy2vec.__doc__ = SphericalProj.xy2vec.__doc__ % (name,name) def ang2xy(self, theta, phi=None, lonlat=False, direct=False): return self.vec2xy(R.dir2vec(theta,phi,lonlat=lonlat),direct=direct) ang2xy.__doc__ = SphericalProj.ang2xy.__doc__ % (name,name) def xy2ang(self, x, y=None, lonlat=False, direct=False): return R.vec2dir(self.xy2vec(x,y,direct=direct),lonlat=lonlat) xy2ang.__doc__ = SphericalProj.xy2ang.__doc__ % (name,name) def xy2ij(self, x, y=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for" " this projector") xsize = self.arrayinfo['xsize'] half_sky = self.arrayinfo['half_sky'] if half_sky: ratio = 1.0 else: ratio = 2.0 ysize = xsize/ratio if y is None: x,y = np.asarray(x) else: x,y = np.asarray(x), np.asarray(y) xc,yc = (xsize-1.)/2., (ysize-1.)/2. if hasattr(x,'__len__'): if half_sky: mask = (x**2+y**2>1.0) else: mask = ((np.mod(x+2.0,2.0)-1.0)**2+y**2>1.0) if not mask.any(): mask = np.ma.nomask j=np.ma.array(np.around(x*xc/ratio+xc).astype(np.long),mask=mask) i=np.ma.array(np.around(yc+y*yc).astype(np.long),mask=mask) else: if ( half_sky and x**2+y**2>1.0 ) or \ ( not half_sky and (np.mod(x+2.0,2.0)-1.0)**2+y**2>1.0 ): i,j,=np.nan,np.nan else: j = np.around(x*xc/ratio+xc).astype(np.long) i = np.around(yc+y*yc).astype(np.long) return i,j xy2ij.__doc__ = SphericalProj.xy2ij.__doc__ % (name,name) def ij2xy(self, i=None, j=None): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for" " this projector") xsize = self.arrayinfo['xsize'] half_sky = self.arrayinfo['half_sky'] if half_sky: ratio = 1.0 else: ratio = 2.0 ysize=xsize/ratio xc,yc=(xsize-1.)/2.,(ysize-1.)/2. if i is None and j is None: idx = np.outer(np.arange(ysize),np.ones(xsize)) y = (idx-yc)/yc idx = np.outer(np.ones(ysize),np.arange(xsize)) x = ratio*(idx-xc)/xc elif i is not None and j is not None: y = (np.asarray(i)-yc)/yc x = ratio*(np.asarray(j)-xc)/xc # if np.mod(x,1.0)**2+y**2 > 1.0: x,y=np.nan,np.nan elif i is not None and j is None: i,j = i y=(np.asarray(i)-yc)/yc x=ratio*(np.asarray(j)-xc)/xc # if np.mod(x,1.0)**2.+y**2 > 1.: x,y=np.nan,np.nan else: raise TypeError("i and j must be both given or both not given") if half_sky: mask = (x**2+y**2>1.) else: mask = ((np.mod(x+2.0,2.0)-1.0)**2+y**2 > 1.) if not mask.any(): mask=np.ma.nomask x = np.ma.array(x,mask=mask) y = np.ma.array(y,mask=mask) if len(x)==0: x = x[0] if len(y)==0: y = y[0] return x,y ij2xy.__doc__ = SphericalProj.ij2xy.__doc__ % (name,name) def get_extent(self): if self.arrayinfo is None: raise TypeError("No projection plane array information defined for" " this projector") half_sky = self.arrayinfo['half_sky'] if half_sky: ratio = 1.0 else: ratio = 2.0 return (-ratio,ratio,-1.0,1.0) get_extent.__doc__ = SphericalProj.get_extent.__doc__ healpy-1.8.1/healpy/version.py0000654000175000017530000000002412351601344016727 0ustar zoncaplanck00000000000000__version__='1.8.1' healpy-1.8.1/healpy/newvisufunc.py0000644000175000017500000001557512346125412017476 0ustar zoncazonca00000000000000__all__ = ['mollview', 'projplot'] import numpy as np from .pixelfunc import ang2pix, npix2nside from .rotator import Rotator from matplotlib.projections.geo import GeoAxes ###### WARNING ################# # this module is work in progress, the aim is to reimplement the healpy # plot functions using the new features of matplotlib and remove most # of the custom projection code class ThetaFormatterShiftPi(GeoAxes.ThetaFormatter): """Shifts labelling by pi Shifts labelling from -180,180 to 0-360""" def __call__(self, x, pos=None): if x != 0: x *= -1 if x < 0: x += 2*np.pi return super(ThetaFormatterShiftPi, self).__call__(x, pos) def lonlat(theta, phi): """Converts theta and phi to longitude and latitude From colatitude to latitude and from astro longitude to geo longitude""" longitude = -1*np.asarray(phi) latitude = np.pi/2 - np.asarray(theta) return longitude, latitude def mollview(m=None, rot=None, coord=None, unit='', xsize=1000, nest=False, min=None, max=None, flip='astro', format='%g', cbar=True, cmap=None, norm=None, graticule=False, graticule_labels=False, **kwargs): """Plot an healpix map (given as an array) in Mollweide projection. Parameters ---------- map : float, array-like or None An array containing the map, supports masked maps, see the `ma` function. If None, will display a blank map, useful for overplotting. rot : scalar or sequence, optional Describe the rotation to apply. In the form (lon, lat, psi) (unit: degrees) : the point at longitude *lon* and latitude *lat* will be at the center. An additional rotation of angle *psi* around this direction is applied. coord : sequence of character, optional Either one of 'G', 'E' or 'C' to describe the coordinate system of the map, or a sequence of 2 of these to rotate the map from the first to the second coordinate system. unit : str, optional A text describing the unit of the data. Default: '' xsize : int, optional The size of the image. Default: 800 nest : bool, optional If True, ordering scheme is NESTED. Default: False (RING) min : float, optional The minimum range value max : float, optional The maximum range value flip : {'astro', 'geo'}, optional Defines the convention of projection : 'astro' (default, east towards left, west towards right) or 'geo' (east towards roght, west towards left) format : str, optional The format of the scale label. Default: '%g' cbar : bool, optional Display the colorbar. Default: True norm : {'hist', 'log', None} Color normalization, hist= histogram equalized color mapping, log= logarithmic color mapping, default: None (linear color mapping) kwargs : keywords any additional keyword is passed to pcolormesh graticule : bool add graticule graticule_labels : bool longitude and latitude labels """ # not implemented features if not (norm is None): raise NotImplementedError() # Create the figure import matplotlib.pyplot as plt width = 8.5 fig = plt.figure(figsize=(width,width*.63)) ax = fig.add_subplot(111, projection="mollweide") # FIXME: make a more general axes creation that works also with subplots #ax = plt.gcf().add_axes((.125, .1, .9, .9), projection="mollweide") # remove white space around the image plt.subplots_adjust(left=0.02, right=0.98, top=0.95, bottom=0.05) if graticule and graticule_labels: plt.subplots_adjust(left=0.04, right=0.98, top=0.95, bottom=0.05) if not m is None: # auto min and max if min is None: min = m.min() if max is None: max = m.max() # allow callers to override the hold state by passing hold=True|False washold = ax.ishold() hold = kwargs.pop('hold', None) if hold is not None: ax.hold(hold) try: ysize = xsize/2 theta = np.linspace(np.pi, 0, ysize) phi = np.linspace(-np.pi, np.pi, xsize) longitude = np.radians(np.linspace(-180, 180, xsize)) if flip == "astro": longitude = longitude[::-1] latitude = np.radians(np.linspace(-90, 90, ysize)) # project the map to a rectangular matrix xsize x ysize PHI, THETA = np.meshgrid(phi, theta) # coord or rotation if coord or rot: r = Rotator(coord=coord, rot=rot, inv=True) THETA, PHI = r(THETA.flatten(), PHI.flatten()) THETA = THETA.reshape(ysize, xsize) PHI = PHI.reshape(ysize, xsize) nside = npix2nside(len(m)) if not m is None: grid_pix = ang2pix(nside, THETA, PHI, nest=nest) grid_map = m[grid_pix] # plot ret = plt.pcolormesh(longitude, latitude, grid_map, vmin=min, vmax=max, rasterized=True, **kwargs) # graticule plt.grid(graticule) if graticule: longitude_grid_spacing = 60 # deg ax.set_longitude_grid(longitude_grid_spacing) if width < 10: ax.set_latitude_grid(45) ax.set_longitude_grid_ends(90) if graticule_labels: ax.xaxis.set_major_formatter(ThetaFormatterShiftPi(longitude_grid_spacing)) else: # remove longitude and latitude labels ax.xaxis.set_ticklabels([]) ax.yaxis.set_ticklabels([]) # colorbar if cbar and not m is None: cb = fig.colorbar(ret, orientation='horizontal', shrink=.4, pad=0.05, ticks=[min, max]) cb.ax.xaxis.set_label_text(unit) cb.ax.xaxis.labelpad = -8 # workaround for issue with viewers, see colorbar docstring cb.solids.set_edgecolor("face") plt.draw() finally: ax.hold(washold) return ret def projplot(theta, phi, fmt=None, **kwargs): """projplot is a wrapper around :func:`matplotlib.Axes.plot` to take into account the spherical projection. You can call this function as:: projplot(theta, phi) # plot a line going through points at coord (theta, phi) projplot(theta, phi, 'bo') # plot 'o' in blue at coord (theta, phi) Parameters ---------- theta, phi : float, array-like Coordinates of point to plot in radians. fmt : str A format string (see :func:`matplotlib.Axes.plot` for details) Notes ----- Other keywords are passed to :func:`matplotlib.Axes.plot`. See Also -------- projscatter, projtext """ import matplotlib.pyplot as plt longitude, latitude = lonlat(theta, phi) if fmt is None: ret = plt.plot(longitude, latitude, **kwargs) else: ret = plt.plot(longitude, latitude, fmt, **kwargs) return ret healpy-1.8.1/healpy/__init__.py0000644000175000017500000000710312346125412016645 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # """HealPy is a package to manipulate Healpix maps (ang2pix, pix2ang) and compute spherical harmonics tranforms on them. """ import warnings try: ImportWarning except NameError: class ImportWarning(Warning): pass from .version import __version__ from .pixelfunc import (ma, mask_good, mask_bad, ang2pix, pix2ang, pix2vec, vec2pix, vec2ang, ang2vec, nside2npix, npix2nside, isnsideok, isnpixok, ring2nest, nest2ring, reorder, get_neighbours, get_all_neighbours, max_pixrad, get_interp_val, fit_dipole, fit_monopole, remove_dipole, remove_monopole, get_nside, maptype, ud_grade, nside2resol, nside2pixarea, get_map_size) from .sphtfunc import (anafast, map2alm, alm2map, Alm, synalm, synfast, smoothing, smoothalm, almxfl, alm2cl, pixwin, alm2map_der1, gauss_beam) try: from ._query_disc import query_disc, query_strip, query_polygon, boundaries except ImportError: warnings.warn('Warning: cannot import query disc module') try: from ._pixelfunc import ringinfo, pix2ring except ImportError: warnings.warn('Warning: cannot import pixelfunc module') try: from ._sphtools import rotate_alm from ._sphtools import alm2map_spin_healpy as alm2map_spin from ._sphtools import map2alm_spin_healpy as map2alm_spin except ImportError: warnings.warn('Warning: cannot import _sphtools module') from .rotator import Rotator, vec2dir, dir2vec try: from ._healpy_pixel_lib import UNSEEN except ImportError: warnings.warn('Warning: cannot import pixel lib module') try: from pshyt import job from pshyt import * except ImportError: warnings.warn("Warning: Cannot import pshyt module)", category=ImportWarning) try: from .visufunc import (mollview,graticule,delgraticules,gnomview, projplot,projscatter, projtext, cartview, orthview) from .zoomtool import mollzoom,set_g_clim if visufunc.matplotlib.__version__ == '0.98,3': warnings.warn("Bug in matplotlib 0.98.3 prevents mollview from working\n"+ "You should upgrade to matplotlib 0.98.4 or above", category=ImportWarning) except ImportError: warnings.warn("Warning: Cannot import visualisation tools (needs matplotlib)", category=ImportWarning) try: from .fitsfunc import write_map,read_map,mrdfits,mwrfits,read_alm,write_alm,write_cl,read_cl except: warnings.warn("Warning: Cannot import fits i/o tools (needs pyfits)", category=ImportWarning) healpy-1.8.1/healpy/visufunc.py0000644000175000017500000010267012346125412016755 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # """ ===================================================== visufunc.py : Healpix visualization functions ===================================================== This module provides functions to display Healpix map. Map projections --------------- - :func:`mollview` displays a map using Mollweide projection (full sky) - :func:`gnomview` displays a map using Gnomonic projection (local map) - :func:`cartview` displays a map using Cartesian projection - :func:`orthview` displays a map using Orthographic projection (full or half sky) Graticules ---------- - :func:`graticule` adds a graticule to the current map - :func:`delgraticules` deletes all graticules of a map Tracing lines or points ----------------------- - :func:`projplot` plots data points on the current map - :func:`projscatter` displays scatter points - :func:`projtext` display a text on the current map """ __all__ = ['mollview', 'gnomview', 'cartview', 'orthview', 'graticule', 'delgraticules', 'projplot', 'projscatter', 'projtext'] from . import projaxes as PA import numpy as np import matplotlib from . import pixelfunc pi = np.pi dtor = pi/180. def mollview(map=None,fig=None,rot=None,coord=None,unit='', xsize=800,title='Mollweide view',nest=False, min=None,max=None,flip='astro', remove_dip=False,remove_mono=False, gal_cut=0, format='%g',format2='%g', cbar=True,cmap=None, notext=False, norm=None,hold=False,margins=None,sub=None, return_projected_map=False): """Plot an healpix map (given as an array) in Mollweide projection. Parameters ---------- map : float, array-like or None An array containing the map, supports masked maps, see the `ma` function. If None, will display a blank map, useful for overplotting. fig : int or None, optional The figure number to use. Default: create a new figure rot : scalar or sequence, optional Describe the rotation to apply. In the form (lon, lat, psi) (unit: degrees) : the point at longitude *lon* and latitude *lat* will be at the center. An additional rotation of angle *psi* around this direction is applied. coord : sequence of character, optional Either one of 'G', 'E' or 'C' to describe the coordinate system of the map, or a sequence of 2 of these to rotate the map from the first to the second coordinate system. unit : str, optional A text describing the unit of the data. Default: '' xsize : int, optional The size of the image. Default: 800 title : str, optional The title of the plot. Default: 'Mollweide view' nest : bool, optional If True, ordering scheme is NESTED. Default: False (RING) min : float, optional The minimum range value max : float, optional The maximum range value flip : {'astro', 'geo'}, optional Defines the convention of projection : 'astro' (default, east towards left, west towards right) or 'geo' (east towards roght, west towards left) remove_dip : bool, optional If :const:`True`, remove the dipole+monopole remove_mono : bool, optional If :const:`True`, remove the monopole gal_cut : float, scalar, optional Symmetric galactic cut for the dipole/monopole fit. Removes points in latitude range [-gal_cut, +gal_cut] format : str, optional The format of the scale label. Default: '%g' format2 : str, optional Format of the pixel value under mouse. Default: '%g' cbar : bool, optional Display the colorbar. Default: True notext : bool, optional If True, no text is printed around the map norm : {'hist', 'log', None} Color normalization, hist= histogram equalized color mapping, log= logarithmic color mapping, default: None (linear color mapping) hold : bool, optional If True, replace the current Axes by a MollweideAxes. use this if you want to have multiple maps on the same figure. Default: False sub : int, scalar or sequence, optional Use only a zone of the current figure (same syntax as subplot). Default: None margins : None or sequence, optional Either None, or a sequence (left,bottom,right,top) giving the margins on left,bottom,right and top of the axes. Values are relative to figure (0-1). Default: None return_projected_map : bool if True returns the projected map in a 2d numpy array See Also -------- gnomview, cartview, orthview """ # Create the figure import pylab if not (hold or sub): f=pylab.figure(fig,figsize=(8.5,5.4)) extent = (0.02,0.05,0.96,0.9) elif hold: f=pylab.gcf() left,bottom,right,top = np.array(f.gca().get_position()).ravel() extent = (left,bottom,right-left,top-bottom) f.delaxes(f.gca()) else: # using subplot syntax f=pylab.gcf() if hasattr(sub,'__len__'): nrows, ncols, idx = sub else: nrows, ncols, idx = sub/100, (sub%100)/10, (sub%10) if idx < 1 or idx > ncols*nrows: raise ValueError('Wrong values for sub: %d, %d, %d'%(nrows, ncols, idx)) c,r = (idx-1)%ncols,(idx-1)/ncols if not margins: margins = (0.01,0.0,0.0,0.02) extent = (c*1./ncols+margins[0], 1.-(r+1)*1./nrows+margins[1], 1./ncols-margins[2]-margins[0], 1./nrows-margins[3]-margins[1]) extent = (extent[0]+margins[0], extent[1]+margins[1], extent[2]-margins[2]-margins[0], extent[3]-margins[3]-margins[1]) #extent = (c*1./ncols, 1.-(r+1)*1./nrows,1./ncols,1./nrows) #f=pylab.figure(fig,figsize=(8.5,5.4)) # Starting to draw : turn interactive off wasinteractive = pylab.isinteractive() pylab.ioff() try: if map is None: map = np.zeros(12)+np.inf cbar=False map = pixelfunc.ma_to_array(map) ax=PA.HpxMollweideAxes(f,extent,coord=coord,rot=rot, format=format2,flipconv=flip) f.add_axes(ax) if remove_dip: map=pixelfunc.remove_dipole(map,gal_cut=gal_cut, nest=nest,copy=True, verbose=True) elif remove_mono: map=pixelfunc.remove_monopole(map,gal_cut=gal_cut,nest=nest, copy=True,verbose=True) img = ax.projmap(map,nest=nest,xsize=xsize,coord=coord,vmin=min,vmax=max, cmap=cmap,norm=norm) if cbar: im = ax.get_images()[0] b = im.norm.inverse(np.linspace(0,1,im.cmap.N+1)) v = np.linspace(im.norm.vmin,im.norm.vmax,im.cmap.N) if matplotlib.__version__ >= '0.91.0': cb=f.colorbar(im,ax=ax, orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.05,fraction=0.1,boundaries=b,values=v, format=format) else: # for older matplotlib versions, no ax kwarg cb=f.colorbar(im,orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.05,fraction=0.1,boundaries=b,values=v, format=format) ax.set_title(title) if not notext: ax.text(0.86,0.05,ax.proj.coordsysstr,fontsize=14, fontweight='bold',transform=ax.transAxes) if cbar: cb.ax.text(0.5,-1.0,unit,fontsize=14, transform=cb.ax.transAxes,ha='center',va='center') f.sca(ax) finally: pylab.draw() if wasinteractive: pylab.ion() #pylab.show() if return_projected_map: return img def gnomview(map=None,fig=None,rot=None,coord=None,unit='', xsize=200,ysize=None,reso=1.5,degree=False, title='Gnomonic view',nest=False,remove_dip=False, remove_mono=False,gal_cut=0, min=None,max=None,flip='astro', format='%.3g',cbar=True, cmap=None, norm=None, hold=False,sub=None,margins=None,notext=False, return_projected_map=False): """Plot an healpix map (given as an array) in Gnomonic projection. Parameters ---------- map : array-like The map to project, supports masked maps, see the `ma` function. If None, use a blank map, useful for overplotting. fig : None or int, optional A figure number. Default: None= create a new figure rot : scalar or sequence, optional Describe the rotation to apply. In the form (lon, lat, psi) (unit: degrees) : the point at longitude *lon* and latitude *lat* will be at the center. An additional rotation of angle *psi* around this direction is applied. coord : sequence of character, optional Either one of 'G', 'E' or 'C' to describe the coordinate system of the map, or a sequence of 2 of these to rotate the map from the first to the second coordinate system. unit : str, optional A text describing the unit of the data. Default: '' xsize : int, optional The size of the image. Default: 200 ysize : None or int, optional The size of the image. Default: None= xsize reso : float, optional Resolution (in arcmin if degree is False). Default: 1.5 arcmin degree : bool, optional if True, reso is in degree. Default: False title : str, optional The title of the plot. Default: 'Gnomonic view' nest : bool, optional If True, ordering scheme is NESTED. Default: False (RING) min : float, scalar, optional The minimum range value max : float, scalar, optional The maximum range value flip : {'astro', 'geo'}, optional Defines the convention of projection : 'astro' (default, east towards left, west towards right) or 'geo' (east towards roght, west towards left) remove_dip : bool, optional If :const:`True`, remove the dipole+monopole remove_mono : bool, optional If :const:`True`, remove the monopole gal_cut : float, scalar, optional Symmetric galactic cut for the dipole/monopole fit. Removes points in latitude range [-gal_cut, +gal_cut] format : str, optional The format of the scale label. Default: '%g' hold : bool, optional If True, replace the current Axes by a MollweideAxes. use this if you want to have multiple maps on the same figure. Default: False sub : int or sequence, optional Use only a zone of the current figure (same syntax as subplot). Default: None margins : None or sequence, optional Either None, or a sequence (left,bottom,right,top) giving the margins on left,bottom,right and top of the axes. Values are relative to figure (0-1). Default: None notext: bool, optional If True: do not add resolution info text. Default=False return_projected_map : bool if True returns the projected map in a 2d numpy array See Also -------- mollview, cartview, orthview """ import pylab if not (hold or sub): f=pylab.figure(fig,figsize=(5.8,6.4)) if not margins: margins = (0.075,0.05,0.075,0.05) extent = (0.0,0.0,1.0,1.0) elif hold: f=pylab.gcf() left,bottom,right,top = np.array(pylab.gca().get_position()).ravel() if not margins: margins = (0.0,0.0,0.0,0.0) extent = (left,bottom,right-left,top-bottom) f.delaxes(pylab.gca()) else: # using subplot syntax f=pylab.gcf() if hasattr(sub,'__len__'): nrows, ncols, idx = sub else: nrows, ncols, idx = sub/100, (sub%100)/10, (sub%10) if idx < 1 or idx > ncols*nrows: raise ValueError('Wrong values for sub: %d, %d, %d'%(nrows, ncols, idx)) c,r = (idx-1)%ncols,(idx-1)/ncols if not margins: margins = (0.01,0.0,0.0,0.02) extent = (c*1./ncols+margins[0], 1.-(r+1)*1./nrows+margins[1], 1./ncols-margins[2]-margins[0], 1./nrows-margins[3]-margins[1]) extent = (extent[0]+margins[0], extent[1]+margins[1], extent[2]-margins[2]-margins[0], extent[3]-margins[3]-margins[1]) #f=pylab.figure(fig,figsize=(5.5,6)) # Starting to draw : turn interactive off wasinteractive = pylab.isinteractive() pylab.ioff() try: if map is None: map = np.zeros(12)+np.inf cbar=False map = pixelfunc.ma_to_array(map) ax=PA.HpxGnomonicAxes(f,extent,coord=coord,rot=rot, format=format,flipconv=flip) f.add_axes(ax) if remove_dip: map=pixelfunc.remove_dipole(map,gal_cut=gal_cut,nest=nest,copy=True) elif remove_mono: map=pixelfunc.remove_monopole(map,gal_cut=gal_cut,nest=nest,copy=True) img = ax.projmap(map,nest=nest,coord=coord,vmin=min,vmax=max, xsize=xsize,ysize=ysize,reso=reso,cmap=cmap,norm=norm) if cbar: im = ax.get_images()[0] b = im.norm.inverse(np.linspace(0,1,im.cmap.N+1)) v = np.linspace(im.norm.vmin,im.norm.vmax,im.cmap.N) if matplotlib.__version__ >= '0.91.0': cb=f.colorbar(im,ax=ax, orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.08,fraction=0.1,boundaries=b,values=v, format=format) else: cb=f.colorbar(im,orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.08,fraction=0.1,boundaries=b,values=v, format=format) ax.set_title(title) if not notext: ax.text(-0.07,0.02, "%g '/pix, %dx%d pix"%(ax.proj.arrayinfo['reso'], ax.proj.arrayinfo['xsize'], ax.proj.arrayinfo['ysize']), fontsize=12,verticalalignment='bottom', transform=ax.transAxes,rotation=90) ax.text(-0.07,0.6,ax.proj.coordsysstr,fontsize=14, fontweight='bold',rotation=90,transform=ax.transAxes) lon,lat = np.around(ax.proj.get_center(lonlat=True),ax._coordprec) ax.text(0.5,-0.03,'(%g,%g)'%(lon,lat), verticalalignment='center', horizontalalignment='center', transform=ax.transAxes) if cbar: cb.ax.text(1.05,0.30,unit,fontsize=14,fontweight='bold', transform=cb.ax.transAxes,ha='left',va='center') f.sca(ax) finally: pylab.draw() if wasinteractive: pylab.ion() #pylab.show() if return_projected_map: return img def cartview(map=None,fig=None,rot=None,zat=None,coord=None,unit='', xsize=800,ysize=None,lonra=None,latra=None, title='Cartesian view',nest=False,remove_dip=False, remove_mono=False,gal_cut=0, min=None,max=None,flip='astro', format='%.3g',cbar=True, cmap=None, norm=None,aspect=None, hold=False,sub=None,margins=None,notext=False, return_projected_map=False): """Plot an healpix map (given as an array) in Cartesian projection. Parameters ---------- map : float, array-like or None An array containing the map, supports masked maps, see the `ma` function. If None, will display a blank map, useful for overplotting. fig : int or None, optional The figure number to use. Default: create a new figure rot : scalar or sequence, optional Describe the rotation to apply. In the form (lon, lat, psi) (unit: degrees) : the point at longitude *lon* and latitude *lat* will be at the center. An additional rotation of angle *psi* around this direction is applied. coord : sequence of character, optional Either one of 'G', 'E' or 'C' to describe the coordinate system of the map, or a sequence of 2 of these to rotate the map from the first to the second coordinate system. unit : str, optional A text describing the unit of the data. Default: '' xsize : int, optional The size of the image. Default: 800 lonra : sequence, optional Range in longitude. Default: [-180,180] latra : sequence, optional Range in latitude. Default: [-90,90] title : str, optional The title of the plot. Default: 'Mollweide view' nest : bool, optional If True, ordering scheme is NESTED. Default: False (RING) min : float, optional The minimum range value max : float, optional The maximum range value flip : {'astro', 'geo'}, optional Defines the convention of projection : 'astro' (default, east towards left, west towards right) or 'geo' (east towards roght, west towards left) remove_dip : bool, optional If :const:`True`, remove the dipole+monopole remove_mono : bool, optional If :const:`True`, remove the monopole gal_cut : float, scalar, optional Symmetric galactic cut for the dipole/monopole fit. Removes points in latitude range [-gal_cut, +gal_cut] format : str, optional The format of the scale label. Default: '%g' cbar : bool, optional Display the colorbar. Default: True notext : bool, optional If True, no text is printed around the map norm : {'hist', 'log', None}, optional Color normalization, hist= histogram equalized color mapping, log= logarithmic color mapping, default: None (linear color mapping) hold : bool, optional If True, replace the current Axes by a CartesianAxes. use this if you want to have multiple maps on the same figure. Default: False sub : int, scalar or sequence, optional Use only a zone of the current figure (same syntax as subplot). Default: None margins : None or sequence, optional Either None, or a sequence (left,bottom,right,top) giving the margins on left,bottom,right and top of the axes. Values are relative to figure (0-1). Default: None return_projected_map : bool if True returns the projected map in a 2d numpy array See Also -------- mollview, gnomview, orthview """ import pylab if not (hold or sub): f=pylab.figure(fig,figsize=(8.5,5.4)) if not margins: margins = (0.075,0.05,0.075,0.05) extent = (0.0,0.0,1.0,1.0) elif hold: f=pylab.gcf() left,bottom,right,top = np.array(pylab.gca().get_position()).ravel() if not margins: margins = (0.0,0.0,0.0,0.0) extent = (left,bottom,right-left,top-bottom) f.delaxes(pylab.gca()) else: # using subplot syntax f=pylab.gcf() if hasattr(sub,'__len__'): nrows, ncols, idx = sub else: nrows, ncols, idx = sub/100, (sub%100)/10, (sub%10) if idx < 1 or idx > ncols*nrows: raise ValueError('Wrong values for sub: %d, %d, %d'%(nrows, ncols, idx)) c,r = (idx-1)%ncols,(idx-1)/ncols if not margins: margins = (0.01,0.0,0.0,0.02) extent = (c*1./ncols+margins[0], 1.-(r+1)*1./nrows+margins[1], 1./ncols-margins[2]-margins[0], 1./nrows-margins[3]-margins[1]) extent = (extent[0]+margins[0], extent[1]+margins[1], extent[2]-margins[2]-margins[0], extent[3]-margins[3]-margins[1]) #f=pylab.figure(fig,figsize=(5.5,6)) # Starting to draw : turn interactive off wasinteractive = pylab.isinteractive() pylab.ioff() try: if map is None: map = np.zeros(12)+np.inf cbar=False map = pixelfunc.ma_to_array(map) if zat and rot: raise ValueError('Only give rot or zat, not both') if zat: rot = np.array(zat,dtype=np.float64) rot.resize(3) rot[1] -= 90 ax=PA.HpxCartesianAxes(f,extent,coord=coord,rot=rot, format=format,flipconv=flip) f.add_axes(ax) if remove_dip: map=pixelfunc.remove_dipole(map,gal_cut=gal_cut,nest=nest,copy=True) elif remove_mono: map=pixelfunc.remove_monopole(map,gal_cut=gal_cut,nest=nest,copy=True) img = ax.projmap(map,nest=nest,coord=coord,vmin=min,vmax=max, xsize=xsize,ysize=ysize,lonra=lonra,latra=latra, cmap=cmap,norm=norm,aspect=aspect) if cbar: im = ax.get_images()[0] b = im.norm.inverse(np.linspace(0,1,im.cmap.N+1)) v = np.linspace(im.norm.vmin,im.norm.vmax,im.cmap.N) if matplotlib.__version__ >= '0.91.0': cb=f.colorbar(im,ax=ax, orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.08,fraction=0.1,boundaries=b,values=v, format=format) else: cb=f.colorbar(im,orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.08,fraction=0.1,boundaries=b,values=v, format=format) ax.set_title(title) if not notext: ax.text(-0.07,0.6,ax.proj.coordsysstr,fontsize=14, fontweight='bold',rotation=90,transform=ax.transAxes) if cbar: cb.ax.text(1.05,0.30,unit,fontsize=14,fontweight='bold', transform=cb.ax.transAxes,ha='left',va='center') f.sca(ax) finally: if wasinteractive: pylab.ion() pylab.draw() #pylab.show() if return_projected_map: return img def orthview(map=None,fig=None,rot=None,coord=None,unit='', xsize=800,half_sky=False, title='Orthographic view',nest=False, min=None,max=None,flip='astro', remove_dip=False,remove_mono=False, gal_cut=0, format='%g',format2='%g', cbar=True,cmap=None, notext=False, norm=None,hold=False,margins=None,sub=None, return_projected_map=False): """Plot an healpix map (given as an array) in Orthographic projection. Parameters ---------- map : float, array-like or None An array containing the map. If None, will display a blank map, useful for overplotting. fig : int or None, optional The figure number to use. Default: create a new figure rot : scalar or sequence, optional Describe the rotation to apply. In the form (lon, lat, psi) (unit: degrees) : the point at longitude *lon* and latitude *lat* will be at the center. An additional rotation of angle *psi* around this direction is applied. coord : sequence of character, optional Either one of 'G', 'E' or 'C' to describe the coordinate system of the map, or a sequence of 2 of these to rotate the map from the first to the second coordinate system. half_sky : bool, optional Plot only one side of the sphere. Default: False unit : str, optional A text describing the unit of the data. Default: '' xsize : int, optional The size of the image. Default: 800 title : str, optional The title of the plot. Default: 'Orthographic view' nest : bool, optional If True, ordering scheme is NESTED. Default: False (RING) min : float, optional The minimum range value max : float, optional The maximum range value flip : {'astro', 'geo'}, optional Defines the convention of projection : 'astro' (default, east towards left, west towards right) or 'geo' (east towards roght, west towards left) remove_dip : bool, optional If :const:`True`, remove the dipole+monopole remove_mono : bool, optional If :const:`True`, remove the monopole gal_cut : float, scalar, optional Symmetric galactic cut for the dipole/monopole fit. Removes points in latitude range [-gal_cut, +gal_cut] format : str, optional The format of the scale label. Default: '%g' format2 : str, optional Format of the pixel value under mouse. Default: '%g' cbar : bool, optional Display the colorbar. Default: True notext : bool, optional If True, no text is printed around the map norm : {'hist', 'log', None} Color normalization, hist= histogram equalized color mapping, log= logarithmic color mapping, default: None (linear color mapping) hold : bool, optional If True, replace the current Axes by an OrthographicAxes. use this if you want to have multiple maps on the same figure. Default: False sub : int, scalar or sequence, optional Use only a zone of the current figure (same syntax as subplot). Default: None margins : None or sequence, optional Either None, or a sequence (left,bottom,right,top) giving the margins on left,bottom,right and top of the axes. Values are relative to figure (0-1). Default: None return_projected_map : bool if True returns the projected map in a 2d numpy array See Also -------- mollview, gnomview, cartview """ # Create the figure import pylab if not (hold or sub): f=pylab.figure(fig,figsize=(8.5,5.4)) extent = (0.02,0.05,0.96,0.9) elif hold: f=pylab.gcf() left,bottom,right,top = np.array(f.gca().get_position()).ravel() extent = (left,bottom,right-left,top-bottom) f.delaxes(f.gca()) else: # using subplot syntax f=pylab.gcf() if hasattr(sub,'__len__'): nrows, ncols, idx = sub else: nrows, ncols, idx = sub/100, (sub%100)/10, (sub%10) if idx < 1 or idx > ncols*nrows: raise ValueError('Wrong values for sub: %d, %d, %d'%(nrows, ncols, idx)) c,r = (idx-1)%ncols,(idx-1)/ncols if not margins: margins = (0.01,0.0,0.0,0.02) extent = (c*1./ncols+margins[0], 1.-(r+1)*1./nrows+margins[1], 1./ncols-margins[2]-margins[0], 1./nrows-margins[3]-margins[1]) extent = (extent[0]+margins[0], extent[1]+margins[1], extent[2]-margins[2]-margins[0], extent[3]-margins[3]-margins[1]) #extent = (c*1./ncols, 1.-(r+1)*1./nrows,1./ncols,1./nrows) #f=pylab.figure(fig,figsize=(8.5,5.4)) # Starting to draw : turn interactive off wasinteractive = pylab.isinteractive() pylab.ioff() try: if map is None: map = np.zeros(12)+np.inf cbar=False ax=PA.HpxOrthographicAxes(f,extent,coord=coord,rot=rot, format=format2,flipconv=flip) f.add_axes(ax) if remove_dip: map=pixelfunc.remove_dipole(map,gal_cut=gal_cut, nest=nest,copy=True, verbose=True) elif remove_mono: map=pixelfunc.remove_monopole(map,gal_cut=gal_cut,nest=nest, copy=True,verbose=True) img = ax.projmap(map,nest=nest,xsize=xsize,half_sky=half_sky, coord=coord,vmin=min,vmax=max, cmap=cmap,norm=norm) if cbar: im = ax.get_images()[0] b = im.norm.inverse(np.linspace(0,1,im.cmap.N+1)) v = np.linspace(im.norm.vmin,im.norm.vmax,im.cmap.N) if matplotlib.__version__ >= '0.91.0': cb=f.colorbar(im,ax=ax, orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.05,fraction=0.1,boundaries=b,values=v, format=format) else: # for older matplotlib versions, no ax kwarg cb=f.colorbar(im,orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.05,fraction=0.1,boundaries=b,values=v, format=format) ax.set_title(title) if not notext: ax.text(0.86,0.05,ax.proj.coordsysstr,fontsize=14, fontweight='bold',transform=ax.transAxes) if cbar: cb.ax.text(0.5,-1.0,unit,fontsize=14, transform=cb.ax.transAxes,ha='center',va='center') f.sca(ax) finally: pylab.draw() if wasinteractive: pylab.ion() #pylab.show() if return_projected_map: return img def graticule(dpar=None,dmer=None,coord=None,local=None,**kwds): """Draw a graticule on the current Axes. Parameters ---------- dpar, dmer : float, scalars Interval in degrees between meridians and between parallels coord : {'E', 'G', 'C'} The coordinate system of the graticule (make rotation if needed, using coordinate system of the map if it is defined). local : bool If True, draw a local graticule (no rotation is performed, useful for a gnomonic view, for example) Notes ----- Other keyword parameters will be transmitted to the projplot function. See Also -------- delgraticules """ import pylab f = pylab.gcf() wasinteractive = pylab.isinteractive() pylab.ioff() try: if len(f.get_axes()) == 0: ax=PA.HpxMollweideAxes(f,(0.02,0.05,0.96,0.9),coord=coord) f.add_axes(ax) ax.text(0.86,0.05,ax.proj.coordsysstr,fontsize=14, fontweight='bold',transform=ax.transAxes) for ax in f.get_axes(): if isinstance(ax,PA.SphericalProjAxes): ax.graticule(dpar=dpar,dmer=dmer,coord=coord, local=local,**kwds) finally: pylab.draw() if wasinteractive: pylab.ion() def delgraticules(): """Delete all graticules previously created on the Axes. See Also -------- graticule """ import pylab f = pylab.gcf() wasinteractive = pylab.isinteractive() pylab.ioff() try: for ax in f.get_axes(): if isinstance(ax,PA.SphericalProjAxes): ax.delgraticules() finally: pylab.draw() if wasinteractive: pylab.ion() #pylab.show() def projplot(*args,**kwds): import pylab f = pylab.gcf() wasinteractive = pylab.isinteractive() pylab.ioff() ret = None try: for ax in f.get_axes(): if isinstance(ax,PA.SphericalProjAxes): ret = ax.projplot(*args,**kwds) finally: pylab.draw() if wasinteractive: pylab.ion() #pylab.show() return ret projplot.__doc__ = PA.SphericalProjAxes.projplot.__doc__ def projscatter(*args,**kwds): import pylab f = pylab.gcf() wasinteractive = pylab.isinteractive() pylab.ioff() ret=None try: for ax in f.get_axes(): if isinstance(ax,PA.SphericalProjAxes): ret = ax.projscatter(*args,**kwds) finally: pylab.draw() if wasinteractive: pylab.ion() #pylab.show() return ret projscatter.__doc__ = PA.SphericalProjAxes.projscatter.__doc__ def projtext(*args,**kwds): import pylab f = pylab.gcf() wasinteractive = pylab.isinteractive() pylab.ioff() ret = None try: for ax in f.get_axes(): if isinstance(ax,PA.SphericalProjAxes): ret = ax.projtext(*args,**kwds) finally: pylab.draw() if wasinteractive: pylab.ion() #pylab.show() return ret projtext.__doc__ = PA.SphericalProjAxes.projtext.__doc__ healpy-1.8.1/healpy/fitsfunc.py0000644000175000017500000004004112346125412016725 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # """Provides input and output functions for Healpix maps, alm, and cl. """ import pyfits as pf import numpy as np from . import pixelfunc from .sphtfunc import Alm import warnings from .pixelfunc import UNSEEN standard_column_names = { 1 : "I_STOKES", 3 : ["%s_STOKES" % comp for comp in "IQU"], 6 : ["II", "IQ", "IU", "QQ", "QU", "UU"] } class HealpixFitsWarning(Warning): pass def read_cl(filename, dtype=np.float64, h=False): """Reads Cl from an healpix file, as IDL fits2cl. Parameters ---------- filename : str the fits file name dtype : data type, optional the data type of the returned array Returns ------- cl : array the cl array """ hdulist=pf.open(filename) cl = [hdulist[1].data.field(n) for n in range(len(hdulist[1].data.columns))] hdulist.close() if len(cl) == 1: return cl[0] else: return cl def write_cl(filename, cl, dtype=np.float64): """Writes Cl into an healpix file, as IDL cl2fits. Parameters ---------- filename : str the fits file name cl : array the cl array to write to file, currently TT only """ # check the dtype and convert it fitsformat = getformat(dtype) column_names = ['TEMPERATURE','GRADIENT','CURL','G-T','C-T','C-G'] if isinstance(cl, list): cols = [pf.Column(name=column_name, format='%s'%fitsformat, array=column_cl) for column_name, column_cl in zip(column_names[:len(cl)], cl)] else: # we write only one TT cols = [pf.Column(name='TEMPERATURE', format='%s'%fitsformat, array=cl)] tbhdu = pf.new_table(cols) # add needed keywords tbhdu.header.update('CREATOR','healpy') tbhdu.writeto(filename,clobber=True) def write_map(filename,m,nest=False,dtype=np.float32,fits_IDL=True,coord=None,column_names=None): """Writes an healpix map into an healpix file. Parameters ---------- filename : str the fits file name m : array or sequence of 3 arrays the map to write. Possibly a sequence of 3 maps of same size. They will be considered as I, Q, U maps. Supports masked maps, see the `ma` function. nest : bool, optional If True, ordering scheme is assumed to be NESTED, otherwise, RING. Default: RING. The map ordering is not modified by this function, the input map array should already be in the desired ordering (run `ud_grade` beforehand). fits_IDL : bool, optional If True, reshapes columns in rows of 1024, otherwise all the data will go in one column. Default: True coord : str The coordinate system, typically 'E' for Ecliptic, 'G' for Galactic or 'C' for Celestial (equatorial) column_names : str or list Column name or list of column names, if None we use: I_STOKES for 1 component, I/Q/U_STOKES for 3 components, II, IQ, IU, QQ, QU, UU for 6 components, COLUMN_0, COLUMN_1... otherwise """ if not hasattr(m, '__len__'): raise TypeError('The map must be a sequence') # check the dtype and convert it fitsformat = getformat(dtype) m = pixelfunc.ma_to_array(m) if pixelfunc.maptype(m) == 0: # a single map is converted to a list m = [m] if column_names is None: column_names = standard_column_names.get(len(m), ["COLUMN_%d" % n for n in range(len(m))]) else: assert len(column_names) == len(m), "Length column_names != number of maps" # maps must have same length assert len(set(map(len, m))) == 1, "Maps must have same length" nside = pixelfunc.npix2nside(len(m[0])) if nside < 0: raise ValueError('Invalid healpix map : wrong number of pixel') cols=[] for cn, mm in zip(column_names, m): if len(mm) > 1024 and fits_IDL: # I need an ndarray, for reshape: mm2 = np.asarray(mm) cols.append(pf.Column(name=cn, format='1024%s' % fitsformat, array=mm2.reshape(mm2.size/1024,1024))) else: cols.append(pf.Column(name=cn, format='%s' % fitsformat, array=mm)) tbhdu = pf.new_table(cols) # add needed keywords tbhdu.header.update('PIXTYPE','HEALPIX','HEALPIX pixelisation') if nest: ordering = 'NESTED' else: ordering = 'RING' tbhdu.header.update('ORDERING',ordering, 'Pixel ordering scheme, either RING or NESTED') if coord: tbhdu.header.update('COORDSYS',coord, 'Ecliptic, Galactic or Celestial (equatorial)') tbhdu.header.update('EXTNAME','xtension', 'name of this binary table extension') tbhdu.header.update('NSIDE',nside,'Resolution parameter of HEALPIX') tbhdu.header.update('FIRSTPIX', 0, 'First pixel # (0 based)') tbhdu.header.update('LASTPIX',pixelfunc.nside2npix(nside)-1, 'Last pixel # (0 based)') tbhdu.header.update('INDXSCHM','IMPLICIT', 'Indexing: IMPLICIT or EXPLICIT') tbhdu.writeto(filename,clobber=True) def read_map(filename,field=0,dtype=np.float64,nest=False,hdu=1,h=False, verbose=True,memmap=False): """Read an healpix map from a fits file. Parameters ---------- filename : str the fits file name field : int or tuple of int, optional The column to read. Default: 0. By convention 0 is temperature, 1 is Q, 2 is U. Field can be a tuple to read multiple columns (0,1,2) dtype : data type, optional Force the conversion to some type. Default: np.float64 nest : bool, optional If True return the map in NEST ordering, otherwise in RING ordering; use fits keyword ORDERING to decide whether conversion is needed or not If None, no conversion is performed. hdu : int, optional the header number to look at (start at 0) h : bool, optional If True, return also the header. Default: False. verbose : bool, optional If True, print a number of diagnostic messages memmap : bool, optional Argument passed to pyfits.open, if True, the map is not read into memory, but only the required pixels are read when needed. Default: False. Returns ------- m | (m0, m1, ...) [, header] : array or a tuple of arrays, optionally with header appended The map(s) read from the file, and the header if *h* is True. """ hdulist=pf.open(filename, memmap=memmap) #print hdulist[1].header nside = hdulist[hdu].header.get('NSIDE') if nside is None: warnings.warn("No NSIDE in the header file : will use length of array", HealpixFitsWarning) else: nside = int(nside) if verbose: print('NSIDE = {0:d}'.format(nside)) if not pixelfunc.isnsideok(nside): raise ValueError('Wrong nside parameter.') ordering = hdulist[hdu].header.get('ORDERING','UNDEF').strip() if ordering == 'UNDEF': ordering = (nest and 'NESTED' or 'RING') warnings.warn("No ORDERING keyword in header file : " "assume %s"%ordering) if verbose: print('ORDERING = {0:s} in fits file'.format(ordering)) sz=pixelfunc.nside2npix(nside) if not (hasattr(field, '__len__') or isinstance(field, str)): field = (field,) ret = [] for ff in field: try: m=hdulist[hdu].data.field(ff).astype(dtype).ravel() except pf.VerifyError as e: print(e) print("Trying to fix a badly formatted header") m=hdulist[hdu].verify("fix") m=hdulist[hdu].data.field(ff).astype(dtype).ravel() if (not pixelfunc.isnpixok(m.size) or (sz>0 and sz != m.size)) and verbose: print('nside={0:d}, sz={1:d}, m.size={2:d}'.format(nside,sz,m.size)) raise ValueError('Wrong nside parameter.') if not nest is None: # no conversion with None if nest and ordering == 'RING': idx = pixelfunc.nest2ring(nside,np.arange(m.size,dtype=np.int32)) m = m[idx] if verbose: print('Ordering converted to NEST') elif (not nest) and ordering == 'NESTED': idx = pixelfunc.ring2nest(nside,np.arange(m.size,dtype=np.int32)) m = m[idx] if verbose: print('Ordering converted to RING') try: m[pixelfunc.mask_bad(m)] = UNSEEN except OverflowError: pass ret.append(m) if len(ret) == 1: if h: return ret[0],hdulist[hdu].header.items() else: return ret[0] else: if h: ret.append(hdulist[hdu].header.items()) return tuple(ret) else: return tuple(ret) def write_alm(filename,alms,out_dtype=None,lmax=-1,mmax=-1,mmax_in=-1): """Write alms to a fits file. In the fits file the alms are written with explicit index scheme, index = l*l + l + m +1, possibly out of order. By default write_alm makes a table with the same precision as the alms. If specified, the lmax and mmax parameters truncate the input data to include only alms for which l <= lmax and m <= mmax. Parameters ---------- filename : str The filename of the output fits file alms : array, complex A complex ndarray holding the alms, index = m*(2*lmax+1-m)/2+l, see Alm.getidx lmax : int, optional The maximum l in the output file mmax : int, optional The maximum m in the output file out_dtype : data type, optional data type in the output file (must be a numpy dtype). Default: *alms*.real.dtype mmax_in : int, optional maximum m in the input array """ l2max = Alm.getlmax(len(alms),mmax=mmax_in) if (lmax != -1 and lmax > l2max): raise ValueError("Too big lmax in parameter") elif lmax == -1: lmax = l2max if mmax_in == -1: mmax_in = l2max if mmax == -1: mmax = lmax if mmax > mmax_in: mmax = mmax_in if (out_dtype == None): out_dtype = alms.real.dtype l,m = Alm.getlm(lmax) idx = np.where((l <= lmax)*(m <= mmax)) l = l[idx] m = m[idx] idx_in_original = Alm.getidx(l2max, l=l, m=m) index = l**2 + l + m + 1 out_data = np.empty(len(index), dtype=[('index','i'), ('real',out_dtype), ('imag',out_dtype)]) out_data['index'] = index out_data['real'] = alms.real[idx_in_original] out_data['imag'] = alms.imag[idx_in_original] cindex = pf.Column(name="index", format=getformat(np.int32), unit="l*l+l+m+1", array=out_data['index']) creal = pf.Column(name="real", format=getformat(out_dtype), unit="unknown", array=out_data['real']) cimag = pf.Column(name="imag", format=getformat(out_dtype), unit="unknown", array=out_data['imag']) tbhdu = pf.new_table([cindex,creal,cimag]) tbhdu.writeto(filename,clobber=True) def read_alm(filename,hdu=1,return_mmax=False): """Read alm from a fits file. In the fits file, the alm are written with explicit index scheme, index = l**2+l+m+1, while healpix cxx uses index = m*(2*lmax+1-m)/2+l. The conversion is done in this function. Parameters ---------- filename : str The name of the fits file to read hdu : int, optional The header to read. Start at 0. Default: hdu=1 return_mmax : bool, optional If true, both the alms and mmax is returned in a tuple. Default: return_mmax=False Returns ------- alms[, mmax] : complex array or tuple of a complex array and an int The alms read from the file and optionally mmax read from the file """ idx, almr, almi = mrdfits(filename,hdu=hdu) l = np.floor(np.sqrt(idx-1)).astype(np.long) m = idx - l**2 - l - 1 if (m<0).any(): raise ValueError('Negative m value encountered !') lmax = l.max() mmax = m.max() alm = almr*(0+0j) i = Alm.getidx(lmax,l,m) alm.real[i] = almr alm.imag[i] = almi if return_mmax: return alm, mmax else: return alm ## Generic functions to read and write column of data in fits file def mrdfits(filename,hdu=1): """Read a table in a fits file. Parameters ---------- filename : str The name of the fits file to read hdu : int, optional The header to read. Start at 0. Default: hdu=1 Returns ------- cols : a list of arrays A list of column data in the given header """ hdulist=pf.open(filename) if hdu>=len(hdulist): raise ValueError('Available hdu in [0-%d]'%len(hdulist)) hdu=hdulist[hdu] val=[] for i in range(len(hdu.columns)): val.append(hdu.data.field(i)) hdulist.close() del hdulist return val def mwrfits(filename,data,hdu=1,colnames=None,keys=None): """Write columns to a fits file in a table extension. Parameters ---------- filename : str The fits file name data : list of 1D arrays A list of 1D arrays to write in the table hdu : int, optional The header where to write the data. Default: 1 colnames : list of str The column names keys : dict-like A dictionary with keywords to write in the header """ # Check the inputs if colnames is not None: if len(colnames) != len(data): raise ValueError("colnames and data must the same length") else: colnames = ['']*len(data) cols=[] for line in xrange(len(data)): cols.append(pf.Column(name=colnames[line], format=getformat(data[line]), array=data[line])) tbhdu = pf.new_table(cols) if type(keys) is dict: for k,v in keys.items(): tbhdu.header.update(k,v) # write the file tbhdu.writeto(filename,clobber=True) def getformat(t): """Get the FITS convention format string of data type t. Parameters ---------- t : data type The data type for which the FITS type is requested Returns ------- fits_type : str or None The FITS string code describing the data type, or None if unknown type. """ conv = { np.dtype(np.bool): 'L', np.dtype(np.uint8): 'B', np.dtype(np.int16): 'I', np.dtype(np.int32): 'J', np.dtype(np.int64): 'K', np.dtype(np.float32): 'E', np.dtype(np.float64): 'D', np.dtype(np.complex64): 'C', np.dtype(np.complex128): 'M' } try: if t in conv: return conv[t] except: pass try: if np.dtype(t) in conv: return conv[np.dtype(t)] except: pass try: if np.dtype(type(t)) in conv: return conv[np.dtype(type(t))] except: pass try: if np.dtype(type(t[0])) in conv: return conv[np.dtype(type(t[0]))] except: pass try: if t is str: return 'A' except: pass try: if type(t) is str: return 'A%d'%(len(t)) except: pass try: if type(t[0]) is str: l=max(len(s) for s in t) return 'A%d'%(l) except: pass healpy-1.8.1/healpy/rotator.py0000644000175000017500000010426712346125412016611 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # import numpy as np import warnings coordname = {'G': 'Galactic', 'E': 'Ecliptic', 'C': 'Equatorial'} class ConsistencyWarning(Warning): """Warns for a problem in the consistency of data """ pass if __name__ != '__main__': warnings.filterwarnings("always", category=ConsistencyWarning, module=__name__) class Rotator(object): """Rotation operator, including astronomical coordinate systems. This class provides tools for spherical rotations. It is meant to be used in the healpy library for plotting, and for this reason reflects the convention used in the Healpix IDL library. Parameters ---------- rot : None or sequence Describe the rotation by its euler angle. See :func:`euler_matrix_new`. coord : None or sequence of str Describe the coordinate system transform. If *rot* is also given, the coordinate transform is applied first, and then the rotation. inv : bool If True, the inverse rotation is defined. (Default: False) deg : bool If True, angles are assumed to be in degree. (Default: True) eulertype : str The Euler angle convention used. See :func:`euler_matrix_new`. Attributes ---------- mat coordin coordout coordinstr coordoutstr rots coords Examples -------- >>> r = Rotator(coord=['G','E']) # Transforms galactic to ecliptic coordinates >>> theta_gal, phi_gal = np.pi/2., 0. >>> theta_ecl, phi_ecl = r(theta_gal, phi_gal) # Apply the conversion >>> print(theta_ecl) 1.66742286715 >>> print(phi_ecl) -1.62596400306 >>> theta_ecl, phi_ecl = Rotator(coord='ge')(theta_gal, phi_gal) # In one line >>> print(theta_ecl) 1.66742286715 >>> print(phi_ecl) -1.62596400306 >>> vec_gal = np.array([1, 0, 0]) #Using vectors >>> vec_ecl = r(vec_gal) >>> print(vec_ecl) [-0.05488249 -0.99382103 -0.09647625] """ ErrMessWrongPar = ("rot and coord must be single elements or " "sequence of same size.") def __init__(self,rot=None,coord=None,inv=None,deg=True, eulertype='ZYX'): """Create a rotator with given parameters. - rot: a float, a tuple of 1,2 or 3 floats or a sequence of tuples. If it is a sequence of tuple, it must have the same length as coord. - coord: a string or a tuple of 1 or 2 strings or a sequence of tuple If it is a sequence of tuple, it must have same length as rot. - inv: whether to use inverse rotation or not - deg: if True, angles in rot are assumed in degree (default: True) - eulertype: the convention for Euler angles in rot. Note: the coord system conversion is applied first, then the rotation. """ rot_is_seq = (hasattr(rot,'__len__') and hasattr(rot[0], '__len__')) coord_is_seq = (hasattr(coord,'__len__') and hasattr(coord[0],'__len__') and type(coord[0]) is not str) if rot_is_seq and coord_is_seq: if len(rot) != len(coord): raise ValueError(Rotator.ErrMessWrongPar) else: rots = rot coords = coord elif (rot_is_seq or coord_is_seq) and (rot is not None and coord is not None): raise ValueError(Rotator.ErrMessWrongPar) else: rots = [rot] coords = [coord] inv_is_seq = hasattr(inv,'__len__') if inv_is_seq: if len(inv) != len(rots): raise ValueError("inv must have same length as rot and/or coord") invs = inv else: invs = [inv]*len(rots) # check the argument and normalize them if eulertype in ['ZYX','X','Y']: self._eultype = eulertype else: self._eultype = 'ZYX' self._rots = [] self._coords = [] self._invs = [] for r,c,i in zip(rots,coords,invs): rn = normalise_rot(r,deg=deg) # if self._eultype in ['X','Y']: # rn[1] = -rn[1] cn = normalise_coord(c) self._rots.append(rn) # append(rn) or insert(0, rn) ? self._coords.append(cn) # append(cn) or insert(0, cn) ? self._invs.append(bool(i)) if not self.consistent: warnings.warn("The chain of coord system rotations is not consistent", category=ConsistencyWarning) self._update_matrix() def _update_matrix(self): self._matrix = np.identity(3) self._do_rotation = False for r,c,i in zip(self._rots, self._coords,self._invs): rotmat,do_rot,rotnorm = get_rotation_matrix(r, eulertype=self._eultype) convmat,do_conv,coordnorm = get_coordconv_matrix(c) r = np.dot(rotmat,convmat) if i: r = r.T self._matrix = np.dot(self._matrix, r) self._do_rotation = self._do_rotation or (do_rot or do_conv) def _is_coords_consistent(self): for c,i in zip(self._coords,self._invs): break for cnext,inext in zip(self._coords[1:],self._invs[1:]): if c[i] != cnext[not inext]: return False c,i = cnext,inext return True consistent = property(_is_coords_consistent, doc="consistency of the coords transform chain") def __eq__(self,a): if type(a) is not type(self): return False # compare the _rots v = [np.allclose(x,y,rtol=0,atol=1e-15) for x,y in zip(self._rots,a._rots)] return ( np.array(v).all() and (self._coords == a._coords) and (self._invs == a._invs) ) def __call__(self,*args,**kwds): """Use the rotator to rotate either spherical coordinates (theta, phi) or a vector (x,y,z). You can use lonla keyword to use longitude, latitude (in degree) instead of theta, phi (in radian). In this case, returns longitude, latitude in degree. Accepted forms: r(x,y,z) # x,y,z either scalars or arrays r(theta,phi) # theta, phi scalars or arrays r(lon,lat,lonlat=True) # lon, lat scalars or arrays r(vec) # vec 1-D array with 3 elements, or 2-D array 3xN r(direction) # direction 1-D array with 2 elements, or 2xN array Parameters ---------- vec_or_dir : array or multiple arrays The direction to rotate. See above for accepted formats. lonlat : bool, optional If True, assumes the input direction is longitude/latitude in degrees. Otherwise, assumes co-latitude/longitude in radians. Default: False inv : bool, optional If True, applies the inverse rotation. Default: False. """ if kwds.pop('inv',False): m=self._matrix.T else: m=self._matrix lonlat = kwds.pop('lonlat',False) if len(args) == 1: arg=args[0] if not hasattr(arg,'__len__') or len(arg) < 2 or len(arg) > 3: raise TypeError('Argument must be a sequence of 2 or 3 ' 'elements') if len(arg) == 2: return rotateDirection(m,arg[0],arg[1], self._do_rotation,lonlat=lonlat) else: return rotateVector(m,arg[0],arg[1],arg[2], self._do_rotation) elif len(args) == 2: return rotateDirection(m,args[0],args[1], self._do_rotation,lonlat=lonlat) elif len(args) == 3: return rotateVector(m,args[0],args[1],args[2], self._do_rotation) else: raise TypeError('Either 1, 2 or 3 arguments accepted') def __mul__(self,a): """Composition of rotation. """ if not isinstance(a,Rotator): raise TypeError("A Rotator can only multiply another Rotator " "(composition of rotations)") rots = self._rots + a._rots coords = self._coords + a._coords invs = self._invs + a._invs return Rotator(rot=rots,coord=coords,inv=invs,deg=False) def __rmul__(self,b): if not isinstance(b,Rotator): raise TypeError("A Rotator can only be multiplied by another Rotator " "(composition of rotations)") rots = b._rots + self._rots coords = b._coords + self._coords invs = self._invs + a._invs return Rotator(rot=rots,coord=coords,inv=invs,deg=False) def __nonzero__(self): return self._do_rotation def get_inverse(self): rots = self._rots[::-1] coords = self._coords[::-1] invs = [ not i for i in self._invs[::-1]] return Rotator(rot=rots,coord=coords,inv=invs,deg=False) #I = property(get_inverse,doc='Return a new rotator representing the ' # 'inverse rotation') def I(self,*args,**kwds): """Rotate the given vector or direction using the inverse matrix. rot.I(vec) <==> rot(vec,inv=True) """ kwds['inv'] = True return self.__call__(*args,**kwds) @property def mat(self): """The matrix representing the rotation. """ return np.matrix(self._matrix) @property def coordin(self): """The input coordinate system. """ if not self.consistent: return None for c,i in zip(self._coords,self._invs): pass return c[i] @property def coordout(self): """The output coordinate system. """ if not self.consistent: return None for c,i in zip(self._coords,self._invs): pass return c[not i] @property def coordinstr(self): """The input coordinate system in str. """ return coordname.get(self.coordin,'') @property def coordoutstr(self): """The output coordinate system in str. """ return coordname.get(self.coordout,'') @property def rots(self): """The sequence of rots defining the rotation. """ return self._rots @property def coords(self): """The sequence of coords defining the rotation. """ return self._coords def do_rot(self,i): """Returns True if rotation is not (close to) identity. """ return not np.allclose(self.rots[i],np.zeros(3),rtol=0.,atol=1.e-15) def angle_ref(self,*args,**kwds): """Compute the angle between transverse reference direction of initial and final frames For example, if angle of polarisation is psi in initial frame, it will be psi+angle_ref in final frame. Parameters ---------- dir_or_vec : array Direction or vector (see Rotator.__call__) lonlat: bool, optional If True, assume input is longitude,latitude in degrees. Otherwise, theta,phi in radian. Default: False inv : bool, optional If True, use the inverse transforms. Default: False Returns ------- angle : float, scalar or array Angle in radian (a scalar or an array if input is a sequence of direction/vector) """ R = self lonlat = kwds.get('lonlat',False) inv = kwds.get('inv',False) if len(args) == 1: arg=args[0] if not hasattr(arg,'__len__') or len(arg) < 2 or len(arg) > 3: raise TypeError('Argument must be a sequence of 2 or 3 ' 'elements') if len(arg) == 2: v = dir2vec(arg[0],arg[1],lonlat=lonlat) else: v = arg elif len(args) == 2: v = dir2vec(args[0],args[1],lonlat=lonlat) elif len(args) == 3: v = args else: raise TypeError('Either 1, 2 or 3 arguments accepted') vp = R(v,inv=inv) north_pole = R([0.,0.,1.],inv=inv) sinalpha = north_pole[0]*vp[1]-north_pole[1]*vp[0] cosalpha = north_pole[2] - vp[2]*np.dot(north_pole,vp) return np.arctan2(sinalpha,cosalpha) def __repr__(self): return '[ '+', '.join([str(self._coords), str(self._rots), str(self._invs)]) +' ]' __str__ = __repr__ ################################################################ # # Helpers function for rotation # used in the Rotator class. def rotateVector(rotmat,vec,vy=None,vz=None, do_rot=True): """Rotate a vector (or a list of vectors) using the rotation matrix given as first argument. Parameters ---------- rotmat : float, array-like shape (3,3) The rotation matrix vec : float, scalar or array-like The vector to transform (shape (3,) or (3,N)), or x component (scalar or shape (N,)) if vy and vz are given vy : float, scalar or array-like, optional The y component of the vector (scalar or shape (N,)) vz : float, scalar or array-like, optional The z component of the vector (scalar or shape (N,)) do_rot : bool, optional if True, really perform the operation, if False do nothing. Returns ------- vec : float, array The component of the rotated vector(s). See Also -------- Rotator """ if vy is None and vz is None: if do_rot: return np.tensordot(rotmat,vec,axes=(1,0)) else: return vec elif vy is not None and vz is not None: if do_rot: return np.tensordot(rotmat,np.array([vec,vy,vz]),axes=(1,0)) else: return vec,vy,vz else: raise TypeError("You must give either vec only or vec, vy " "and vz parameters") def rotateDirection(rotmat,theta,phi=None,do_rot=True,lonlat=False): """Rotate the vector described by angles theta,phi using the rotation matrix given as first argument. Parameters ---------- rotmat : float, array-like shape (3,3) The rotation matrix theta : float, scalar or array-like The angle theta (scalar or shape (N,)) or both angles (scalar or shape (2, N)) if phi is not given. phi : float, scalar or array-like, optionnal The angle phi (scalar or shape (N,)). do_rot : bool, optional if True, really perform the operation, if False do nothing. lonlat : bool If True, input angles are assumed to be longitude and latitude in degree, otherwise, they are co-latitude and longitude in radians. Returns ------- angles : float, array The angles of describing the rotated vector(s). See Also -------- Rotator """ vx,vy,vz=rotateVector(rotmat,dir2vec(theta,phi,lonlat=lonlat),do_rot=do_rot) return vec2dir(vx,vy,vz,lonlat=lonlat) def vec2dir(vec,vy=None,vz=None,lonlat=False): """Transform a vector to angle given by theta,phi. Parameters ---------- vec : float, scalar or array-like The vector to transform (shape (3,) or (3,N)), or x component (scalar or shape (N,)) if vy and vz are given vy : float, scalar or array-like, optional The y component of the vector (scalar or shape (N,)) vz : float, scalar or array-like, optional The z component of the vector (scalar or shape (N,)) lonlat : bool, optional If True, return angles will be longitude and latitude in degree, otherwise, angles will be longitude and co-latitude in radians (default) Returns ------- angles : float, array The angles (unit depending on *lonlat*) in an array of shape (2,) (if scalar input) or (2, N) See Also -------- :func:`dir2vec`, :func:`pixelfunc.ang2vec`, :func:`pixelfunc.vec2ang` """ if np.any(np.isnan(vec)): return np.nan, np.nan if vy is None and vz is None: vx,vy,vz = vec elif vy is not None and vz is not None: vx=vec else: raise TypeError("You must either give both vy and vz or none of them") r = np.sqrt(vx**2+vy**2+vz**2) ang = np.empty((2, r.size)) ang[0, :] = np.arccos(vz / r) ang[1, :] = np.arctan2(vy, vx) if lonlat: ang = np.degrees(ang) np.negative(ang[0, :], ang[0, :]) ang[0, :] += 90. return ang[::-1,:].squeeze() else: return ang.squeeze() def dir2vec(theta,phi=None,lonlat=False): """Transform a direction theta,phi to a unit vector. Parameters ---------- theta : float, scalar or array-like The angle theta (scalar or shape (N,)) or both angles (scalar or shape (2, N)) if phi is not given. phi : float, scalar or array-like, optionnal The angle phi (scalar or shape (N,)). lonlat : bool If True, input angles are assumed to be longitude and latitude in degree, otherwise, they are co-latitude and longitude in radians. Returns ------- vec : array The vector(s) corresponding to given angles, shape is (3,) or (3, N). See Also -------- :func:`vec2dir`, :func:`pixelfunc.ang2vec`, :func:`pixelfunc.vec2ang` """ if phi is None: theta,phi=theta if lonlat: lon,lat=theta,phi theta,phi = np.pi/2.-np.radians(lat),np.radians(lon) ct,st,cp,sp = np.cos(theta),np.sin(theta),np.cos(phi),np.sin(phi) vec = np.empty((3, ct.size), np.float64) vec[0, :] = st * cp vec[1, :] = st * sp vec[2, :] = ct return vec.squeeze() def angdist(dir1,dir2,lonlat=False): """Returns the angular distance between dir1 and dir2. Parameters ---------- dir1, dir2 : float, array-like The directions between which computing the angular distance. Angular if len(dir) == 2 or vector if len(dir) == 3. See *lonlat* for unit lonlat : bool, scalar or sequence If True, angles are assumed to be longitude and latitude in degree, otherwise they are interpreted as colatitude and longitude in radian. If a sequence, lonlat[0] applies to dir1 and lonlat[1] applies to dir2. Returns ------- angles : float, scalar or array-like The angle(s) between dir1 and dir2 in radian. Examples -------- >>> import healpy as hp >>> hp.rotator.angdist([.2,0], [.2, 1e-6]) array([ 1.98669331e-07]) """ if hasattr(lonlat,'__len__') and len(lonlat) == 2: lonlat1,lonlat2 = lonlat else: lonlat1=lonlat2=lonlat dir1 = np.asarray(dir1) dir2 = np.asarray(dir2) if dir1.ndim == 2: if dir1.shape[0] == 2: # theta, phi -> vec vec1 = dir2vec(dir1, lonlat = lonlat1) else: vec1 = np.reshape(dir1, (3, -1)) vec1 = normalize_vec(vec1) elif dir1.ndim == 1: if dir1.shape[0] == 2: # theta, phi -> vec vec1 = np.reshape(dir2vec(dir1, lonlat = lonlat1), (3, 1)) else: vec1 = np.reshape(dir1, (3, 1)) vec1 = normalize_vec(vec1) if dir2.ndim == 2: if dir2.shape[0] == 2: # theta, phi -> vec vec2 = dir2vec(dir2, lonlat = lonlat2) else: vec2 = np.reshape(dir2, (3, -1)) vec2 = normalize_vec(vec2) elif dir2.ndim == 1: if dir2.shape[0] == 2: # theta, phi -> vec vec2 = np.reshape(dir2vec(dir2, lonlat = lonlat2), (3, 1)) else: vec2 = np.reshape(dir2, (3, 1)) vec2 = normalize_vec(vec2) # compute vec product vec_prod = np.sqrt((np.cross(vec1.T, vec2.T)**2).sum(axis=1)) # compute scalar product scal_prod = (vec1*vec2).sum(axis=0) return np.arctan2(vec_prod, scal_prod) def normalize_vec(vec): """Normalize the vector(s) *vec* (in-place if it is a ndarray). Parameters ---------- vec : float, array-like of shape (D,) or (D, N) The D-vector(s) to normalize. Returns ------- vec_normed : float, array Normalized vec, shape (D,) or (D, N) """ vec = np.array(vec, np.float64) r = np.sqrt(np.sum(vec ** 2, axis = 0)) vec /= r return vec ####################################################### # # Manage the coord system conventions # def check_coord(c): """Check if parameter is a valid coord system. Raise a TypeError exception if it is not, otherwise returns the normalized coordinate system name. """ if c is None: return c if type(c) is not str: raise TypeError('Coordinate must be a string (G[alactic],' ' E[cliptic], C[elestial]' ' or Equatorial=Celestial)') if c[0].upper() == 'G': x='G' elif c[0].upper() == 'E' and c != 'Equatorial': x='E' elif c[0].upper() == 'C' or c == 'Equatorial': x='C' else: raise ValueError('Wrong coordinate (either G[alactic],' ' E[cliptic], C[elestial]' ' or Equatorial=Celestial)') return x def normalise_coord(coord): """Normalise the coord argument. Coord sys are either 'E','G', 'C' or 'X' if undefined. Input: either a string or a sequence of string. Output: a tuple of two strings, each being one of the norm coord sys name above. eg, 'E' -> ['E','E'], ['Ecliptic','G'] -> ['E','G'] None -> ['X','X'] etc. """ coord_norm = [] if coord is None: coord = (None,None) coord=tuple(coord) if len(coord) > 2: raise TypeError('Coordinate must be a string (G[alactic],' ' E[cliptic] or C[elestial])' ' or a sequence of 2 strings') for x in coord: coord_norm.append(check_coord(x)) if len(coord_norm) < 2: coord_norm.append(coord_norm[0]) return tuple(coord_norm) def normalise_rot(rot,deg=False): """Return rot possibly completed with zeroes to reach size 3. If rot is None, return a vector of 0. If deg is True, convert from degree to radian, otherwise assume input is in radian. """ if deg: convert=np.pi/180. else: convert=1. if rot is None: rot=np.zeros(3) else: rot=np.array(rot,np.float64).flatten()*convert rot.resize(3) return rot def get_rotation_matrix(rot, deg=False, eulertype='ZYX'): """Return the rotation matrix corresponding to angles given in rot. Usage: matrot,do_rot,normrot = get_rotation_matrix(rot) Input: - rot: either None, an angle or a tuple of 1,2 or 3 angles corresponding to Euler angles. Output: - matrot: 3x3 rotation matrix - do_rot: True if rotation is not identity, False otherwise - normrot: the normalized version of the input rot. """ rot = normalise_rot(rot, deg=deg) if not np.allclose(rot,np.zeros(3),rtol=0.,atol=1.e-15): do_rot = True else: do_rot = False if eulertype == 'X': matrot=euler_matrix_new(rot[0],-rot[1],rot[2],X=True) elif eulertype == 'Y': matrot=euler_matrix_new(rot[0],-rot[1],rot[2],Y=True) else: matrot=euler_matrix_new(rot[0],-rot[1],rot[2],ZYX=True) return matrot,do_rot,rot def get_coordconv_matrix(coord): """Return the rotation matrix corresponding to coord systems given in coord. Usage: matconv,do_conv,normcoord = get_coordconv_matrix(coord) Input: - coord: a tuple with initial and final coord systems. See normalise_coord. Output: - matconv: the euler matrix for coord sys conversion - do_conv: True if matconv is not identity, False otherwise - normcoord: the tuple of initial and final coord sys. History: adapted from CGIS IDL library. """ coord_norm = normalise_coord(coord) if coord_norm[0] == coord_norm[1]: matconv = np.identity(3) do_conv = False else: eps = 23.452294 - 0.0130125 - 1.63889E-6 + 5.02778E-7 eps = eps * np.pi / 180. # ecliptic to galactic e2g = np.array([[-0.054882486, -0.993821033, -0.096476249], [ 0.494116468, -0.110993846, 0.862281440], [-0.867661702, -0.000346354, 0.497154957]]) # ecliptic to equatorial e2q = np.array([[1., 0. , 0. ], [0., np.cos( eps ), -1. * np.sin( eps )], [0., np.sin( eps ), np.cos( eps ) ]]) # galactic to ecliptic g2e = np.linalg.inv(e2g) # galactic to equatorial g2q = np.dot(e2q , g2e) # equatorial to ecliptic q2e = np.linalg.inv(e2q) # equatorial to galactic q2g = np.dot(e2g , q2e) if coord_norm == ('E','G'): matconv = e2g elif coord_norm == ('G','E'): matconv = g2e elif coord_norm == ('E','C'): matconv = e2q elif coord_norm == ('C','E'): matconv = q2e elif coord_norm == ('C','G'): matconv = q2g elif coord_norm == ('G','C'): matconv = g2q else: raise ValueError('Wrong coord transform :',coord_norm) do_conv = True return matconv,do_conv,coord_norm ################################################### ## ## ## euler functions ## ## ## ###### ####### def euler(ai, bi, select, FK4 = 0): """ NAME: euler PURPOSE: Transform between Galactic, celestial, and ecliptic coordinates. EXPLANATION: Use the procedure ASTRO to use this routine interactively CALLING SEQUENCE: EULER, AI, BI, AO, BO, [ SELECT, /FK4, SELECT = ] INPUTS: AI - Input Longitude in DEGREES, scalar or vector. If only two parameters are supplied, then AI and BI will be modified to contain the output longitude and latitude. BI - Input Latitude in DEGREES OPTIONAL INPUT: SELECT - Integer (1-6) specifying type of coordinate transformation. SELECT From To | SELECT From To 1 RA-Dec (2000) Galactic | 4 Ecliptic RA-Dec 2 Galactic RA-DEC | 5 Ecliptic Galactic 3 RA-Dec Ecliptic | 6 Galactic Ecliptic If not supplied as a parameter or keyword, then EULER will prompt for the value of SELECT Celestial coordinates (RA, Dec) should be given in equinox J2000 unless the /FK4 keyword is set. OUTPUTS: AO - Output Longitude in DEGREES BO - Output Latitude in DEGREES INPUT KEYWORD: /FK4 - If this keyword is set and non-zero, then input and output celestial and ecliptic coordinates should be given in equinox B1950. /SELECT - The coordinate conversion integer (1-6) may alternatively be specified as a keyword NOTES: EULER was changed in December 1998 to use J2000 coordinates as the default, ** and may be incompatible with earlier versions***. REVISION HISTORY: Written W. Landsman, February 1987 Adapted from Fortran by Daryl Yentis NRL Converted to IDL V5.0 W. Landsman September 1997 Made J2000 the default, added /FK4 keyword W. Landsman December 1998 Add option to specify SELECT as a keyword W. Landsman March 2003 Converted to python by K. Ganga December 2007 """ # npar = N_params() # if npar LT 2 then begin # print,'Syntax - EULER, AI, BI, A0, B0, [ SELECT, /FK4, SELECT= ]' # print,' AI,BI - Input longitude,latitude in degrees' # print,' AO,BO - Output longitude, latitude in degrees' # print,' SELECT - Scalar (1-6) specifying transformation type' # return # endif PI = np.pi twopi = 2.0*PI fourpi = 4.0*PI deg_to_rad = 180.0/PI # # ; J2000 coordinate conversions are based on the following constants # ; (see the Hipparcos explanatory supplement). # ; eps = 23.4392911111 # Obliquity of the ecliptic # ; alphaG = 192.85948d Right Ascension of Galactic North Pole # ; deltaG = 27.12825d Declination of Galactic North Pole # ; lomega = 32.93192d Galactic longitude of celestial equator # ; alphaE = 180.02322d Ecliptic longitude of Galactic North Pole # ; deltaE = 29.811438523d Ecliptic latitude of Galactic North Pole # ; Eomega = 6.3839743d Galactic longitude of ecliptic equator # if FK4 == 1: equinox = '(B1950)' psi = [ 0.57595865315, 4.9261918136, 0.00000000000, 0.0000000000, 0.11129056012, 4.7005372834] stheta =[ 0.88781538514,-0.88781538514, 0.39788119938,-0.39788119938, 0.86766174755,-0.86766174755] ctheta =[ 0.46019978478, 0.46019978478, 0.91743694670, 0.91743694670, 0.49715499774, 0.49715499774] phi = [ 4.9261918136, 0.57595865315, 0.0000000000, 0.00000000000, 4.7005372834, 0.11129056012] else: equinox = '(J2000)' psi = [ 0.57477043300, 4.9368292465, 0.00000000000, 0.0000000000, 0.11142137093, 4.71279419371] stheta =[ 0.88998808748,-0.88998808748, 0.39777715593,-0.39777715593, 0.86766622025,-0.86766622025] ctheta =[ 0.45598377618, 0.45598377618, 0.91748206207, 0.91748206207, 0.49714719172, 0.49714719172] phi = [ 4.9368292465, 0.57477043300, 0.0000000000, 0.00000000000, 4.71279419371, 0.11142137093] # i = select - 1 # IDL offset a = ai/deg_to_rad - phi[i] b = bi/deg_to_rad sb = np.sin(b) cb = np.cos(b) cbsa = cb * np.sin(a) b = -stheta[i] * cbsa + ctheta[i] * sb #bo = math.asin(where(b<1.0, b, 1.0)*deg_to_rad) bo = np.arcsin(b)*deg_to_rad # a = np.arctan2( ctheta[i] * cbsa + stheta[i] * sb, cb * np.cos(a) ) ao = np.fmod( (a+psi[i]+fourpi), twopi) * deg_to_rad return ao, bo def euler_matrix_new(a1,a2,a3,X=True,Y=False,ZYX=False,deg=False): """ NAME: euler_matrix_new PURPOSE: computes the Euler matrix of an arbitrary rotation described by 3 Euler angles correct bugs present in Euler_Matrix CALLING SEQUENCE: result = euler_matrix_new (a1, a2, a3 [,X, Y, ZYX, DEG ]) INPUTS: a1, a2, a3 = Euler angles, scalar (in radian by default, in degree if DEG is set) all the angles are measured counterclockwise correspond to x, y, zyx-conventions (see Goldstein) the default is x KEYWORD PARAMETERS: DEG : if set the angle are measured in degree X : rotation a1 around original Z rotation a2 around interm X rotation a3 around final Z DEFAULT, classical mechanics convention Y : rotation a1 around original Z rotation a2 around interm Y rotation a3 around final Z quantum mechanics convention (override X) ZYX : rotation a1 around original Z rotation a2 around interm Y rotation a3 around final X aeronautics convention (override X) * these last three keywords are obviously mutually exclusive * OUTPUTS: result is a 3x3 matrix USAGE: if vec is an Nx3 array containing N 3D vectors, vec # euler_matrix_new(a1,a2,a3,/Y) will be the rotated vectors MODIFICATION HISTORY: March 2002, EH, Caltech, rewritting of euler_matrix convention euler_matrix_new euler_matrix X: M_new(a,b,c,/X) = M_old(-a,-b,-c,/X) = Transpose( M_old(c, b, a,/X)) Y: M_new(a,b,c,/Y) = M_old(-a, b,-c,/Y) = Transpose( M_old(c,-b, a,/Y)) ZYX: M_new(a,b,c,/Z) = M_old(-a, b,-c,/Z) """ t_k = 0 if ZYX: t_k = t_k + 1 #if X: t_k = t_k + 1 if Y: t_k = t_k + 1 if t_k > 1: raise ValueError('Choose either X, Y or ZYX convention') convert = 1.0 if deg: convert = np.pi/180. c1 = np.cos(a1*convert) s1 = np.sin(a1*convert) c2 = np.cos(a2*convert) s2 = np.sin(a2*convert) c3 = np.cos(a3*convert) s3 = np.sin(a3*convert) if ZYX: m1 = np.array([[ c1,-s1, 0], [ s1, c1, 0], [ 0, 0, 1]]) # around z m2 = np.array([[ c2, 0, s2], [ 0, 1, 0], [-s2, 0, c2]]) # around y m3 = np.array([[ 1, 0, 0], [ 0, c3,-s3], [ 0, s3, c3]]) # around x elif Y: m1 = np.array([[ c1,-s1, 0], [ s1, c1, 0], [ 0, 0, 1]]) # around z m2 = np.array([[ c2, 0, s2], [ 0, 1, 0], [-s2, 0, c2]]) # around y m3 = np.array([[ c3,-s3, 0], [ s3, c3, 0], [ 0, 0, 1]]) # around z else: m1 = np.array([[ c1,-s1, 0], [ s1, c1, 0], [ 0, 0, 1]]) # around z m2 = np.array([[ 1, 0, 0], [ 0, c2,-s2], [ 0, s2, c2]]) # around x m3 = np.array([[ c3,-s3, 0], [ s3, c3, 0], [ 0, 0, 1]]) # around z M = np.dot(m3.T,np.dot(m2.T,m1.T)) return M healpy-1.8.1/healpy/zoomtool.py0000644000175000017500000004613412346125412016777 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # from . import projaxes as PA from . import rotator as R import numpy as np import matplotlib from ._healpy_pixel_lib import UNSEEN from . import pixelfunc pi = np.pi dtor = pi/180. def mollzoom(map=None,fig=None,rot=None,coord=None,unit='', xsize=800,title='Mollweide view',nest=False, min=None,max=None,flip='astro', remove_dip=False,remove_mono=False, gal_cut=0, format='%g',cmap=None, norm=None,hold=False,margins=None,sub=None): """Interactive mollweide plot with zoomed gnomview. Parameters: ----------- map : float, array-like shape (Npix,) An array containing the map, supports masked maps, see the `ma` function. if None, use map with inf value (white map), useful for overplotting fig : a figure number. Default: create a new figure rot : scalar or sequence, optional Describe the rotation to apply. In the form (lon, lat, psi) (unit: degrees) : the point at longitude *lon* and latitude *lat* will be at the center. An additional rotation of angle *psi* around this direction is applied. coord : sequence of character, optional Either one of 'G', 'E' or 'C' to describe the coordinate system of the map, or a sequence of 2 of these to rotate the map from the first to the second coordinate system. unit : str, optional A text describing the unit of the data. Default: '' xsize : int, optional The size of the image. Default: 800 title : str, optional The title of the plot. Default: 'Mollweide view' nest : bool, optional If True, ordering scheme is NESTED. Default: False (RING) min : float, optional The minimum range value max : float, optional The maximum range value flip : {'astro', 'geo'}, optional Defines the convention of projection : 'astro' (default, east towards left, west towards right) or 'geo' (east towards roght, west towards left) remove_dip : bool, optional If :const:`True`, remove the dipole+monopole remove_mono : bool, optional If :const:`True`, remove the monopole gal_cut : float, scalar, optional Symmetric galactic cut for the dipole/monopole fit. Removes points in latitude range [-gal_cut, +gal_cut] format : str, optional The format of the scale label. Default: '%g' """ import pylab # create the figure (if interactive, it will open the window now) f=pylab.figure(fig,figsize=(10.5,5.4)) extent = (0.02,0.25,0.56,0.72) # Starting to draw : turn interactive off wasinteractive = pylab.isinteractive() pylab.ioff() try: if map is None: map = np.zeros(12)+np.inf map = pixelfunc.ma_to_array(map) ax=PA.HpxMollweideAxes(f,extent,coord=coord,rot=rot, format=format,flipconv=flip) f.add_axes(ax) if remove_dip: map=pixelfunc.remove_dipole(map,gal_cut=gal_cut, nest=nest,copy=True, verbose=True) elif remove_mono: map=pixelfunc.remove_monopole(map,gal_cut=gal_cut,nest=nest, copy=True,verbose=True) ax.projmap(map,nest=nest,xsize=xsize,coord=coord,vmin=min,vmax=max, cmap=cmap,norm=norm) im = ax.get_images()[0] b = im.norm.inverse(np.linspace(0,1,im.cmap.N+1)) v = np.linspace(im.norm.vmin,im.norm.vmax,im.cmap.N) if matplotlib.__version__ >= '0.91.0': cb=f.colorbar(ax.get_images()[0],ax=ax, orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.05,fraction=0.1,boundaries=b,values=v) else: # for older matplotlib versions, no ax kwarg cb=f.colorbar(ax.get_images()[0],orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.05,fraction=0.1,boundaries=b,values=v) ax.set_title(title) ax.text(0.86,0.05,ax.proj.coordsysstr,fontsize=14, fontweight='bold',transform=ax.transAxes) cb.ax.text(1.05,0.30,unit,fontsize=14,fontweight='bold', transform=cb.ax.transAxes,ha='left',va='center') f.sca(ax) ## Gnomonic axes #extent = (0.02,0.25,0.56,0.72) g_xsize=600 g_reso = 1. extent = (0.60,0.04,0.38,0.94) g_ax=PA.HpxGnomonicAxes(f,extent,coord=coord,rot=rot, format=format,flipconv=flip) f.add_axes(g_ax) if remove_dip: map=pixelfunc.remove_dipole(map,gal_cut=gal_cut,nest=nest,copy=True) elif remove_mono: map=pixelfunc.remove_monopole(map,gal_cut=gal_cut,nest=nest,copy=True) g_ax.projmap(map,nest=nest,coord=coord,vmin=min,vmax=max, xsize=g_xsize,ysize=g_xsize,reso=g_reso,cmap=cmap,norm=norm) im = g_ax.get_images()[0] b = im.norm.inverse(np.linspace(0,1,im.cmap.N+1)) v = np.linspace(im.norm.vmin,im.norm.vmax,im.cmap.N) if matplotlib.__version__ >= '0.91.0': cb=f.colorbar(g_ax.get_images()[0],ax=g_ax, orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.08,fraction=0.1,boundaries=b,values=v) else: cb=f.colorbar(g_ax.get_images()[0],orientation='horizontal', shrink=0.5,aspect=25,ticks=PA.BoundaryLocator(), pad=0.08,fraction=0.1,boundaries=b,values=v) g_ax.set_title(title) g_ax.text(-0.07,0.02, "%g '/pix, %dx%d pix"%(g_ax.proj.arrayinfo['reso'], g_ax.proj.arrayinfo['xsize'], g_ax.proj.arrayinfo['ysize']), fontsize=12,verticalalignment='bottom', transform=g_ax.transAxes,rotation=90) g_ax.text(-0.07,0.8,g_ax.proj.coordsysstr,fontsize=14, fontweight='bold',rotation=90,transform=g_ax.transAxes) lon,lat = np.around(g_ax.proj.get_center(lonlat=True),g_ax._coordprec) g_ax.text(0.5,-0.03,'on (%g,%g)'%(lon,lat), verticalalignment='center', horizontalalignment='center', transform=g_ax.transAxes) cb.ax.text(1.05,0.30,unit,fontsize=14,fontweight='bold', transform=cb.ax.transAxes,ha='left',va='center') # Add graticule info axes grat_ax = pylab.axes([0.25, 0.02, 0.22,0.25]) grat_ax.axis('off') # Add help text help_ax = pylab.axes([0.02,0.02,0.22,0.25]) help_ax.axis('off') t = help_ax.transAxes help_ax.text(0.1, 0.8, 'r/t .... zoom out/in',transform=t,va='baseline') help_ax.text(0.1, 0.65,'p/v .... print coord/val',transform=t,va='baseline') help_ax.text(0.1, 0.5, 'c ...... go to center',transform=t,va='baseline') help_ax.text(0.1, 0.35,'f ...... next color scale',transform=t,va='baseline') help_ax.text(0.1, 0.2, 'k ...... save current scale',transform=t, va='baseline') help_ax.text(0.1, 0.05,'g ...... toggle graticule',transform=t,va='baseline') f.sca(g_ax) # Set up the zoom capability zt=ZoomTool(map,fig=f.number,nest=nest,cmap=cmap,norm=norm,coord=coord) finally: pylab.draw() if wasinteractive: pylab.ion() def set_g_clim(vmin,vmax): """Set min/max value of the gnomview part of a mollzoom. """ import pylab f=pylab.gcf() if not hasattr(f,'zoomtool'): raise TypeError('The current figure has no zoomtool') f.zoomtool.save_min = vmin f.zoomtool.save_max = vmax f.zoomtool._range_status = 2 f.zoomtool.draw_gnom() class ZoomTool(object): """A class providing zoom capability to a figure containing a Mollweide and a Gnomonic axis. """ def __init__(self,m,fig=None,nest=False,cmap=None,norm=None, coord=None): """m: the map to be zoomed (already plotted in Mollweide view) fig: the figure to instrument (None->gcf()) """ import pylab self.reso_list = [0.05,0.1,0.2,0.3,0.5,0.75,1.,1.5,3.,5.,10.,15., 30.,45.,60.] self._map = m self._nest = nest self._cmap = cmap self._norm = norm self._coord = coord self._range_status = 0 #0:normal, 1:global map min,max, 2: saved self.save_min = self.save_max = None self._graton = False # find min, max of map if isinstance(m, dict): if len(m) == 0: self._mapmin, self._mapmax = -1., 1. else: self._mapmin,self._mapmax = min(m.values()), max(m.values()) else: mgood = m[m!=UNSEEN] if mgood.size == 0: self._mapmin, self._mapmax = -1., 1. else: self._mapmin,self._mapmax = mgood.min(),mgood.max() del mgood if fig is None: f=pylab.gcf() else: f=pylab.figure(fig) self.f = f f.zoomtool = self (self._moll_ax, self._moll_cb_ax, self._gnom_ax, self._gnom_cb_ax) = f.get_axes()[:4] self._grat_ax = f.get_axes()[4] self._text_reso, self._text_coord, self._text_loc = self._gnom_ax.texts self._xsize = self._gnom_ax.proj.arrayinfo['xsize'] self._ysize = self._gnom_ax.proj.arrayinfo['ysize'] try: self._reso_idx = self.reso_list.index(self._gnom_ax.proj._arrayinfo['reso']) except ValueError as e: raise ValueError('Resolution not in %s'%self.reso_list) self.zoomcenter, = self._moll_ax.plot([0],[0],'ok', mew=1,ms=15,alpha=0.1) self.zoomcenter2, = self._moll_ax.plot([0], [0], 'xr', ms=15, alpha=0.5, mew=3) self._text_range = self._gnom_ax.text(-0.4, -0.2, 'scale mode: loc', transform= self._gnom_ax.transAxes, va='baseline', ha='left') self.draw_gnom(0,0) self._connected = False self.connect_callbacks() def _zoom_on_click(self, ev): import pylab try: ax = ev.inaxes lon,lat = ax.get_lonlat(ev.xdata,ev.ydata) if np.isnan(lon) or np.isnan(lat): raise ValueError('invalid position') val = ax.get_value(ev.xdata,ev.ydata) self.lastval = val self._move_zoom_center(lon,lat) self.draw_gnom(lon,lat) except Exception as s: self._move_zoom_center(0,0,False) pylab.draw_if_interactive() #print s return def _reso_on_key(self, ev): if ev.key == 'r': self._decrease_reso() elif ev.key == 't': self._increase_reso() elif ev.key == 'p': print('lon,lat = %.17g,%.17g'%(self.lon,self.lat)) elif ev.key == 'c': self._move_zoom_center(0,0) self.draw_gnom(0,0) elif ev.key == 'v': print('val = %.17g'%(self.lastval)) elif ev.key == 'f': self._range_status += 1 self._range_status %= 3 self.draw_gnom() elif ev.key == 'k': self.save_min = self._gnom_ax.images[0].norm.vmin self.save_max = self._gnom_ax.images[0].norm.vmax elif ev.key == 'g': if hasattr(self,'_graton') and self._graton == True: self._gnom_ax.delgraticules() self._moll_ax.delgraticules() self._graton = False else: (self._g_dpar, self._g_dmer) = self._gnom_ax.graticule(local=False, verbose=False) (self._m_dpar, self._m_dmer) = self._moll_ax.graticule(verbose=False) self._graton = True self.draw_gnom() def _update_grat_info(self): self._grat_ax.cla() self._grat_ax.axis('off') if self._graton: a = self._grat_ax t = a.transAxes a.text(0.1, 0.8, 'moll. grat.:',transform=t,weight='bold') vdeg = np.floor(np.around(self._m_dpar/dtor,10)) varcmin = (self._m_dpar/dtor-vdeg)*60. a.text(0.1, 0.65, " -par: %d d %.2f '"%(vdeg,varcmin), transform=t) vdeg = np.floor(np.around(self._m_dmer/dtor,10)) varcmin = (self._m_dmer/dtor-vdeg)*60. a.text(0.1, 0.5, " -mer: %d d %.2f '"%(vdeg,varcmin), transform=t) a.text(0.1, 0.35, 'gnom. grat.:',transform=t,weight='bold') vdeg = np.floor(np.around(self._g_dpar/dtor,10)) varcmin = (self._g_dpar/dtor-vdeg)*60. a.text(0.1, 0.2, " -par: %d d %.2f '"%(vdeg,varcmin), transform=t) vdeg = np.floor(np.around(self._g_dmer/dtor,10)) varcmin = (self._g_dmer/dtor-vdeg)*60. a.text(0.1, 0.05, " -mer: %d d %.2f '"%(vdeg,varcmin), transform=t) def _increase_reso(self): if self._reso_idx > 0: self._reso_idx -= 1 self.draw_gnom(self.lon,self.lat) def _decrease_reso(self): if self._reso_idx < len(self.reso_list)-1: self._reso_idx += 1 self.draw_gnom(self.lon,self.lat) def get_reso(self): return self.reso_list[self._reso_idx] def connect_callbacks(self): if not self._connected: self._callbacks_id = [] cid = self.f.canvas.mpl_connect('button_press_event', self._zoom_on_click) self._callbacks_id.append(cid) cid = self.f.canvas.mpl_connect('key_press_event', self._reso_on_key) self._callbacks_id.append(cid) self._connected = True def disconnect_callbacks(self): if self._connected: for cid in self._callbacks_id: self.figure.canvas.mpl_disconnect(cid) def _move_zoom_center(self, lon, lat, visible=True): # Move the zoom center marker. if self.zoomcenter: x,y = self._moll_ax.proj.ang2xy(lon,lat,lonlat=True) self.zoomcenter.set_xdata([x]) self.zoomcenter.set_ydata([y]) self.zoomcenter.set_visible(visible) if self.zoomcenter2: x,y = self._moll_ax.proj.ang2xy(lon,lat,lonlat=True) self.zoomcenter2.set_xdata([x]) self.zoomcenter2.set_ydata([y]) self.zoomcenter2.set_visible(visible) def draw_gnom(self,lon=None,lat=None): import pylab wasinteractive = pylab.isinteractive() pylab.ioff() try: # modify rot of the gnom_ax if lon is None: lon = self._lon else: self._lon = lon if lat is None: lat = self._lat else: self._lat = lat self._gnom_ax.proj.rotator._rots.pop() self._gnom_ax.proj.rotator._rots.append(R.normalise_rot((lon,lat),deg=True)) self._gnom_ax.proj.rotator._update_matrix() if self._range_status == 0: vmin=vmax = None elif self._range_status == 1: vmin,vmax = self._mapmin,self._mapmax elif self._range_status == 2: vmin,vmax = self.save_min, self.save_max self._gnom_ax.images.pop() self._gnom_ax.projmap(self._map,nest=self._nest,coord=self._coord, vmin=vmin,vmax=vmax, xsize=self._xsize,ysize=self._ysize, reso=self.get_reso(), cmap=self._cmap, norm=self._norm) if hasattr(self._gnom_ax, '_scatter_data'): l = [x for x in self._gnom_ax._scatter_data] #print l for sd in l: s, input_data = sd #print input_data self._gnom_ax.collections.remove(s) self._gnom_ax._scatter_data.remove(sd) theta, phi, args, kwds = input_data self._gnom_ax.projscatter(theta, phi = phi, *args, **kwds) del l if self._graton: self._gnom_ax.delgraticules() (self._g_dpar, self._g_dmer) = self._gnom_ax.graticule(local=False, verbose=False) self._gnom_cb_ax.cla() im = self._gnom_ax.images[0] if matplotlib.__version__ >= '0.91.0': cb=self.f.colorbar(im,ax=self._gnom_ax, cax=self._gnom_cb_ax,orientation='horizontal', ticks=PA.BoundaryLocator()) else: cb=self.f.colorbar(im,cax=self._gnom_cb_ax, orientation='horizontal',ticks=PA.BoundaryLocator()) lon,lat = np.around(self._gnom_ax.proj.get_center(lonlat=True), self._gnom_ax._coordprec) self._text_loc.set_text('on (%g,%g)'%(lon,lat)) reso = self._gnom_ax.proj.arrayinfo['reso'] xsize = self._gnom_ax.proj.arrayinfo['xsize'] ysize = self._gnom_ax.proj.arrayinfo['ysize'] self._text_reso.set_text("%g '/pix, %dx%d pix"% (reso, xsize, ysize)) mode = ['loc','map','sav'][self._range_status] self._text_range.set_text('scale mode: %s'%mode) self.lon,self.lat = lon,lat self._update_grat_info() except Exception as e: pass #print e finally: if wasinteractive: pylab.ion() pylab.draw() pylab.show() healpy-1.8.1/healpy/test/0000755000175000017500000000000012351601662015514 5ustar zoncazonca00000000000000healpy-1.8.1/healpy/test/test_sphtfunc.py0000644000175000017500000001443512346125412020764 0ustar zoncazonca00000000000000import pyfits import os import numpy as np from copy import deepcopy from itertools import chain import unittest import healpy as hp import warnings # disable new order warnings in tests warnings.filterwarnings('ignore') class TestSphtFunc(unittest.TestCase): def setUp(self): self.lmax = 64 self.path = os.path.dirname( os.path.realpath( __file__ ) ) self.map1 = [hp.ma(m) for m in hp.read_map(os.path.join(self.path, 'data', 'wmap_band_iqumap_r9_7yr_W_v4_udgraded32.fits'), (0,1,2))] self.map2 = [hp.ma(m) for m in hp.read_map(os.path.join(self.path, 'data', 'wmap_band_iqumap_r9_7yr_V_v4_udgraded32.fits'), (0,1,2))] self.mask = hp.read_map(os.path.join(self.path, 'data', 'wmap_temperature_analysis_mask_r9_7yr_v4_udgraded32.fits')).astype(np.bool) for m in chain(self.map1, self.map2): m.mask = np.logical_not(self.mask) self.cla = hp.read_cl(os.path.join(self.path, 'data', 'cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_II_lmax64_rmmono_3iter.fits')) self.cl_fortran_nomask = hp.read_cl(os.path.join(self.path, 'data', 'cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_II_lmax64_rmmono_3iter_nomask.fits')) cls_file = pyfits.open(os.path.join(self.path, 'data', 'cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_IQU_lmax64_rmmono_3iter.fits')) # fix for pyfits to read the file with duplicate column names for i in range(2, 6): cls_file[1].header['TTYPE%d' % i] += '-%d' % i cls = cls_file[1].data # order of HEALPIX is TB, EB while in healpy is EB, TB self.cliqu = [np.array(cls.field(i)) for i in (0,1,2,3,5,4)] nside = 32 lmax = 64 fwhm_deg = 7. seed = 12345 np.random.seed(seed) self.mapiqu = hp.synfast(self.cliqu, nside, lmax=lmax, pixwin=False, fwhm=np.radians(fwhm_deg), new=False) def test_anafast(self): cl = hp.anafast(hp.remove_monopole(self.map1[0].filled()), lmax = self.lmax) self.assertEqual(len(cl), 65) np.testing.assert_array_almost_equal(cl, self.cla, decimal=8) def test_anafast_nomask(self): cl = hp.anafast(hp.remove_monopole(self.map1[0].data), lmax = self.lmax) self.assertEqual(len(cl), 65) np.testing.assert_array_almost_equal(cl, self.cl_fortran_nomask, decimal=8) def test_anafast_iqu(self): self.map1[0] = hp.remove_monopole(self.map1[0]) cl = hp.anafast(self.map1, lmax = self.lmax) self.assertEqual(len(cl[0]), 65) self.assertEqual(len(cl), 6) for i in range(6): np.testing.assert_array_almost_equal(cl[i], self.cliqu[i], decimal=8) def test_anafast_xspectra(self): cl = hp.anafast(hp.remove_monopole(self.map1[0]), hp.remove_monopole(self.map2[0]), lmax = self.lmax) self.assertEqual(len(cl), self.lmax+1) clx = hp.read_cl(os.path.join(self.path, 'data', 'cl_wmap_band_iqumap_r9_7yr_WVxspec_v4_udgraded32_II_lmax64_rmmono_3iter.fits')) np.testing.assert_array_almost_equal(cl, clx, decimal=8) def test_synfast(self): nside = 32 lmax = 64 fwhm_deg = 7. seed = 12345 np.random.seed(seed) map_pregen = hp.read_map(os.path.join(self.path, 'data', 'map_synfast_seed%d.fits' % seed), (0,1,2)) sim_map = hp.synfast(self.cliqu, nside, lmax = lmax, pixwin=False, fwhm=np.radians(fwhm_deg), new=False, pol=True) np.testing.assert_array_almost_equal(sim_map, map_pregen, decimal=8) def test_smoothing_notmasked(self): smoothed = hp.smoothing([m.data for m in self.map1], fwhm=np.radians(10), lmax=self.lmax) smoothed_f90 = hp.read_map(os.path.join(self.path, 'data', 'wmap_band_iqumap_r9_7yr_W_v4_udgraded32_smoothed10deg_fortran.fits'), (0,1,2)) np.testing.assert_array_almost_equal(smoothed, smoothed_f90, decimal=6) def test_smoothing_masked(self): smoothed = hp.smoothing(self.map1, fwhm=np.radians(10), lmax=self.lmax) smoothed_f90 = hp.ma(hp.read_map(os.path.join(self.path, 'data', 'wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked_smoothed10deg_fortran.fits'), (0,1,2))) # fortran does not restore the mask for mm in smoothed_f90: mm.mask = smoothed[0].mask for i in range(3): np.testing.assert_array_almost_equal(smoothed[i].filled(), smoothed_f90[i].filled(), decimal=6) def test_gauss_beam(self): idl_gauss_beam = np.array(pyfits.open(os.path.join(self.path, 'data', 'gaussbeam_10arcmin_lmax512_pol.fits'))[0].data).T gauss_beam = hp.gauss_beam(np.radians(10./60.), lmax=512, pol=True) np.testing.assert_allclose(idl_gauss_beam, gauss_beam) def test_map2alm(self): nside = 32 lmax = 64 fwhm_deg = 7. seed = 12345 np.random.seed(seed) orig = hp.synfast(self.cla, nside, lmax=lmax, pixwin=False, fwhm=np.radians(fwhm_deg), new=False) tmp = np.empty(orig.size * 2) tmp[::2] = orig maps = [orig, orig.astype(np.float32), tmp[::2]] for input in maps: alm = hp.map2alm(input, iter=10) output = hp.alm2map(alm, nside) np.testing.assert_allclose(input, output, atol=1e-4) def test_map2alm_pol(self): tmp = [np.empty(o.size*2) for o in self.mapiqu] for t, o in zip(tmp, self.mapiqu): t[::2] = o maps = [self.mapiqu, [o.astype(np.float32) for o in self.mapiqu], [t[::2] for t in tmp]] for input in maps: alm = hp.map2alm(input, iter=10) output = hp.alm2map(alm, 32) for i, o in zip(input, output): np.testing.assert_allclose(i, o, atol=1e-4) def test_rotate_alm(self): almigc = hp.map2alm(self.mapiqu) alms = [almigc[0], almigc[0:2], almigc, np.vstack(almigc)] for i in alms: o = deepcopy(i) hp.rotate_alm(o, 0.1, 0.2, 0.3) hp.rotate_alm(o, -0.3, -0.2, -0.1) np.testing.assert_allclose(i, o, rtol=1e-6) if __name__ == '__main__': unittest.main() healpy-1.8.1/healpy/test/test_query_disc.py0000644000175000017500000000644612346125412021304 0ustar zoncazonca00000000000000import unittest import numpy as np from .. import query_disc, boundaries, nside2npix class TestQueryDisc(unittest.TestCase): def setUp(self): self.NSIDE = 8 self.vec = np.array([ 0.17101007, 0.03015369, 0.98480775]) self.radius = np.radians(6) def test_not_inclusive(self): #HIDL> query_disc, 8, [ 0.17101007, 0.03015369, 0.98480775],6,listpix,/DEG,NESTED=0 #HIDL> print,listpix # 4 np.testing.assert_array_equal( query_disc(self.NSIDE, self.vec, self.radius, inclusive=False), np.array([4]) ) def test_inclusive(self): #HIDL> query_disc, 8, [ 0.17101007, 0.03015369, 0.98480775],6,listpix,/DEG,NESTED=0,/inclusive #HIDL> print,listpix # 0 3 4 5 11 12 13 23 np.testing.assert_array_equal( query_disc(self.NSIDE, self.vec, self.radius, inclusive=True), np.array([ 0, 3, 4, 5, 11, 12, 13, 23 ]) ) def test_boundaries(self): nside = 2 corners = boundaries(nside, 5) corners_precomp = np.array( [[ 2.44708573e-17, 5.27046277e-01, 3.60797400e-01, 4.56383842e-17], [ 3.99652627e-01, 5.27046277e-01, 8.71041977e-01, 7.45355992e-01], [ 9.16666667e-01, 6.66666667e-01, 3.33333333e-01, 6.66666667e-01]]) np.testing.assert_array_almost_equal(corners, corners_precomp, decimal=8) def test_boundaries_phi_theta(self): nside = 2 corners = boundaries(nside, np.array([5,5])) corners_precomp = np.array( [[[ 2.44708573e-17, 5.27046277e-01, 3.60797400e-01, 4.56383842e-17], [ 3.99652627e-01, 5.27046277e-01, 8.71041977e-01, 7.45355992e-01], [ 9.16666667e-01, 6.66666667e-01, 3.33333333e-01, 6.66666667e-01]], [[ 2.44708573e-17, 5.27046277e-01, 3.60797400e-01, 4.56383842e-17], [ 3.99652627e-01, 5.27046277e-01, 8.71041977e-01, 7.45355992e-01], [ 9.16666667e-01, 6.66666667e-01, 3.33333333e-01, 6.66666667e-01]]] ) np.testing.assert_array_almost_equal(corners, corners_precomp, decimal=8) def test_buffer_mode(self) : # allocate something manifestly too short, should raise a value error buff = np.empty(0, dtype=np.int64) self.assertRaises(ValueError, query_disc, self.NSIDE, self.vec, self.radius, inclusive=True, buff=buff) # allocate something of wrong type, should raise a value error buff = np.empty(nside2npix(self.NSIDE), dtype=np.float64) self.assertRaises(ValueError, query_disc, self.NSIDE, self.vec, self.radius, inclusive=True, buff=buff) # allocate something acceptable, should succeed and return a subview buff = np.empty(nside2npix(self.NSIDE), dtype=np.int64) result = query_disc(self.NSIDE, self.vec, self.radius, inclusive=True, buff=buff) assert result.base is buff np.testing.assert_array_equal( result, np.array([ 0, 3, 4, 5, 11, 12, 13, 23 ]) ) healpy-1.8.1/healpy/test/__init__.py0000650000175000017530000000000012076101224017742 0ustar zoncaplanck00000000000000healpy-1.8.1/healpy/test/test_pixelfunc.py0000644000175000017500000001073612351601276021132 0ustar zoncazonca00000000000000from ..pixelfunc import * from .._query_disc import boundaries from .._pixelfunc import ringinfo, pix2ring import numpy as np import unittest class TestPixelFunc(unittest.TestCase): def setUp(self): # data fixture self.theta0 = [ 1.52911759, 0.78550497, 1.57079633, 0.05103658, 3.09055608] self.phi0 = [ 0. , 0.78539816, 1.61988371, 0.78539816, 0.78539816] def test_nside2npix(self): self.assertEqual(nside2npix(512), 3145728) self.assertEqual(nside2npix(1024), 12582912) def test_nside2resol(self): self.assertAlmostEqual(nside2resol(512,arcmin=True), 6.87097282363) self.assertAlmostEqual(nside2resol(1024,arcmin=True), 3.43548641181) def test_nside2pixarea(self): self.assertAlmostEqual(nside2pixarea(512), 3.9947416351188569e-06) def test_ang2pix_ring(self): # ensure nside = 1 << 23 is correctly calculated # by comparing the original theta phi are restored. # NOTE: nside needs to be sufficiently large! id = ang2pix(1048576 * 8, self.theta0, self.phi0, nest=False) theta1, phi1 = pix2ang(1048576 * 8, id, nest=False) np.testing.assert_array_almost_equal(theta1, self.theta0) np.testing.assert_array_almost_equal(phi1, self.phi0) def test_ang2pix_ring_outofrange(self): # Healpy_Base2 works up to nside = 2**29. # Check that a ValueError is raised for nside = 2**30. self.assertRaises( ValueError, ang2pix, 1<<30, self.theta0, self.phi0, nest=False) def test_ang2pix_nest(self): # ensure nside = 1 << 23 is correctly calculated # by comparing the original theta phi are restored. # NOTE: nside needs to be sufficiently large! # NOTE: with Healpy_Base this will fail because nside # is limited to 1 << 13 with Healpy_Base. id = ang2pix(1048576 * 8, self.theta0, self.phi0, nest=True) theta1, phi1 = pix2ang(1048576 * 8, id, nest=True) np.testing.assert_array_almost_equal(theta1, self.theta0) np.testing.assert_array_almost_equal(phi1, self.phi0) self.assertTrue(np.allclose(theta1, self.theta0)) self.assertTrue(np.allclose(phi1, self.phi0)) def test_ang2pix_nest_outofrange_doesntcrash(self): # Healpy_Base2 works up to nside = 2**29. # Check that a ValueError is raised for nside = 2**30. self.assertRaises( ValueError, ang2pix, 1<<30, self.theta0, self.phi0, nest=False) def test_ang2pix_negative_theta(self): self.assertRaises(AssertionError, ang2pix, 32, -1, 0) def test_fit_dipole(self): nside = 32 npix = nside2npix(nside) d = [0.3, 0.5, 0.2] vec = np.transpose(pix2vec(nside, np.arange(npix))) signal = vec.dot(d) mono, dipole = fit_dipole(signal) self.assertAlmostEqual(mono, 0.) self.assertAlmostEqual(d[0], dipole[0]) self.assertAlmostEqual(d[1], dipole[1]) self.assertAlmostEqual(d[2], dipole[2]) def test_boundaries(self): """Test whether the boundary shapes look sane""" for lgNside in range(1, 5): nside = 1<€Ñ©?ïô¸G_^ ?ïô.Þéû?ïó¢E}?ïó|—;?ïò„»;„?ïñé]°‰Ó?ïñP¤%3?ïð³‚Ä‚?ïðÏ?-?ïïpíE!?ïîÊÝÓ®?ïî!ž¶1r?ïíu2…Ñ;?ïìŘ©Yô?ïìÑUe‰?ïë\Ü¿€È?ïꣻ+N?ïéçl¨×g?ïé'ñ—éò?ïèeJ$ºH?ïçŸv‰’?ïæÖw­f?ïæ KÉ:3?ïå:õXœ?ïähs<œ?ïã’Ædƒó?ïâ¹îÖŠ?ïáÝìÓÈ?ïàþÀ›ù…?ïàjtÖ?ïß6êžðw?ïÞNAah$?ïÝbox?ïÜssÄ^Ï?ïÛOòé?ïÚŒÕÂ?ïÙ“´Cƒ?ïØ—óÚÁC?ï×™0“Íõ?ïÖ—F+˜l?ïÕ’4ï?6?ïÔ‰ý,Ð|?ïÓ~Ÿ3IÓ?ïÒpR˜?ïÑ^qÛ—N?ïÐI£ g?ïÏ1¯rÃ+?ïΗ'R?ïÌøZ’Uà?ïËÖú Sô?ïʲuâ¿¥?ïÉŠÎuúQ?ïÈ`S*?ïÇ2,?ïÆ@0?ïÄÌÖùE?ïÕ„lÿ?ïÂ[¹™?ïÁ|>Æ?ï¿ÜÇXÏA?ﾘòi|Ú?ï½QýÐÂ+?ï¼éð.Ô?ﺺ·*>H?ï¹jeâWž?ï¸ö|Í_?ï¶Ài^ÝT?ïµf¾î°U?ï´ ÷“Z?ﲪ´Øê?ï±G¼¦?ï¯àøãX?ï®wÁ#ÿ?ï­ o[Ù?ï«œ$¦*?ïª)|î< ?勉Ý&4¦?ï§;$;Ü2?勵RŸg£?ï¤@hÁô|?gˆ›?ï¡9N ù?ft?ïž%׸C™?{VNd?ï› m ?ï™q‚t¹?ï—Ùæã}g?ï–?74½‰?sáëä?ï“fD?ï‘\´=,I?ﵸä $?ïŽ «Øi]?ïŒ^˜ï?^¥#1?ïˆû}pN?ï‡DУ'N?ï…‹r˜|°?ïƒÏàˆÌ?ï‚ŠÿG‘?ï€My˜F?ï~‡lÕ=D?ï|¾Ê˜Û¹?ïzóKûb?ïy$bwG?ïwR£H{?ïu}ÎZï×?ïs¥õ) ³?ïqË™Œ¤?ïoí'9D8?ïn 3•ä¬?ïl(8>©?ïjA5Á ÿ?ïhW,¯VZ?ïfjšÿ?ïdz X?ïb†ï®v?ï`ÑþÐæ?ïJ7®ðñ?ïHõ‚¯?ïEÿÖ[Š¢?ïCß»çç?ïA¼¤žSç?ï?–“Šb ?ï=mˆ€f?ï;A„#òo?ï9‡Ú¨?ï6à’0Q?ï4«¥‹Ä?ï2sÂV>¹?ï08é Î?ï-ûRÂY?ï+ºVÖRƒ?ï)vŸ?×F?ï'/ô:-?ï$æVq™?ï"™ÆìÑÝ»?ï«¢•Ž¸?ï6ºb?îþ½±äH?îüB^áï?îùÄ%¼8~?î÷C.zB?îô¿ôÛ?îò8ÌQÇ?îï®Rr¡?î›vÿc?h•½?î•« V ?î’ÀáS¦÷?îÓòT›¸?îŒä<á|?î‰ñÁÓ?î†ü‚[?î„~X¨ƒ?î ·¤<^?î~ .ǧ«?î{ ä¡9–?îxÚÿ?îuóÂ?îqú‡- û?înï@?îká=%ñú?îhÐ}ªLÆ?îe½  Ç?îb¦Î4?î_à²Û?î\r9_?îYSÛ/i¤?îV2Æ[ó?îSûÉ°?îOè|cÂC?îL¿I°Å?îI“bÀ`•?îFdÊWã?îC3€ÃsB?î?ÿ†ðU5?î<ÈÝÊõ½?î9†@Ùê?î6S@;d?î3ϸþ?î/Ór—á>?î,jÐï?î)H¹Q¿§?î%ÿ_†[?î"³\øÛä?îd´Ý?îe#Y§?î¿qKÏ?îhÙrl?îž²?î³Á’IA?î UCyRŽ?îô%:9?îgÍ/¢?î* +á{?íýÁPN?íúU~4ˆ?íöçMÔfc?íóvƒ+°¶?íð70?íì"ó¸…?íé_·r?íå™ey¤>?íâ¦@ÇD?íÞ›Rµw?íÛk×ë?í×’ò¨'Y?íÔ è*¡?íЀM_‡W?íÌó#KŸ??íÉcjò=Ú?íÅÑ%Wâã?í¾3Qð4?í:Ðe Î?í6à1öéÞ?í2í›5já?í.ø¡â x?í+G?í'‹ûeX?í# q¤cJ?í ù4 ?í #ÉÞ[?íò…ø½?ífˆûO?íû€ô?í ñBép?íä­Š®?íÕÁúi?ìþÄ\Z?ìú°ìÔÝY?ìö›ˆ ¹?ìò‚ÌšÝÝ?ìîhC2Û?ìêKjv?ìæ,C‹ ¤?ìâ Ϙò8?ìÝçÇ^|?ìÙÁ>z0?ìÕ˜±&òŠ?ìÑn©ù¯?ìÍA0ñF)?ìÉ'Y?ìÄà˜vó?ìÀ¬æ £m?ì¼vñ kx?ì¸>º­¸u?ì´DOé?ì¯ÇŽwwï?쫈šûöµ?ì§GjÓç?ì£ÿ+Ž'?ìž¾Y4®„?ìšvz3é?ì–,c\“?ì‘àSã†?ì‘’ÿþ?ì‰@ÚTdã?ì„íï}@=?쀘ү:¥?ì|A…v»?ìwèû•?ìsŒ\}5?ìo.ƒØ)÷?ìjÎ@< ?ìflOëOÖ?ìb÷X€?ì]¡uâ¿I?ìY8Íœc ?ìTÍÿs—«?ìPa  %?ìKñöZHÎ?ìG€½Ú±6?ìC dZ"?ì>—ëM;?ì: S?Ô?ì5¦žda?ì1*ÌÚä?ì,¬à¿sZ?ì(,ÛY1?ì#ª¼äö¶?ì&‡ð‚?ì R?ïןŽöV£?ïÖ¤Z‹K?ïÕ˜’éúç?ïÔZò³®?ïÓ„üóG?ïÒvx¬æŸ?ïÑdÎÿ)Ç?ïÐP GÃ?ïÏ8 &úk?ïÎó¢ê?ﾟKËëþ?ï½XVñÌ…?ï¼BÏ4‡?ïºÁÆŸ‹?ï¹p¾;t¼?ï¸N’·?ï¶ÆÁ/“X?ïµmzCŽ?ï´NÙ+?ï²°j´Hu?ï±Mjt„x?ï¯çNƒ²L?ï®~L ?ï­Å:Áù?ï«¢XºÛ~?ïª/Ò:UÃ?墨2'”?ï§Axñâ¦?ï¥Å§ v—?ï¤F¼ßm{?ï¢ÄºåÍF?ï¡?¡„ ?qPgº?ïž,*5ü?ïœÍë“ã?ï› [² º?ï™wÔhÊ?ï—à8† ?ï–Eˆ…%G?Äß’?ï“î\‹?ï‘c“wF?ï¼店?ïŽû„ä"?ïŒdÜï–š?­¥YŽ?ï‰n&™&?ï‡Kô¥á?ï…‘À‘´Y?ïƒÕS€Ý?ï‚ØFâ?ï€SOfP\?ï~¹g<å?ï|ÅφÅ?ïzùh&µÔ?ïy*­õ46?ïwXèÄN?ïu„1p?ïs¬?í±?ïqÑ\ŸsŒ?ïoópß”¬?ïn|Üi?ïl.#RŠ?ïjG~Dôû?ïh]tÑ=…?ïfpeY^‰?ïd€Poi·?ïb6¦OÇ?ï`—‘à0?ï^öÆÈÞ?ï\¡ÑÚ•è?ïZ¢ªc±K?ïX €ùbœ?ïV›V3λ?ïT“*«÷?ïR‡þû»¯?ïPyÓ½Ö&?ïNh©Þ?ïLTFˆ?ïJ=ZÊ]é?ïH#7rMø?ïFŸT?ïCåûð¥;?ïAÂå¥7?ï?œÓ…®Ï?ï=sÈ /:?ï;GÃAm ?ï9ÅƇì?ï6æÐAx7?ï4±ãX¹?ï2yÿ°ô]?ï0?%ó©Ñ?ï.Vȇ>?ï+À’Ø»í?ï)|ÚÎMü?ï'6/T?ï$ì‘ÒÁ?ï" ÀÏ?ï PF?ïþ „ e?﨩û!F?ïPX#~?ïõ‚ÁÐ?ï–èõ€Ï?ï5͸‹?ïÑÄ´”6?ï jÐhÒ?ï ðïÒ?ï”&ÿÉ?ï$sN•?ï±Ö”òH?ïMN+?îï´‚rƒã?îí'Õ#´?îê˜F!c?îèÖ*ì'?îåp†Ä?îâØVhsã?îà=H ˆ„?îÝŸ[í¹­?îÚþ’”3?îØZìØëj?îÕ´k¤©?îÓ Të?îÐ^ÙÝ?îͯəB\?îÊýá›]?îÈI!êA?îÅ‘‹Oì2?îÂט?îÀÜŽ»?î½YÆ’¼?ۻ?’?î·Ñ!Ý?îµE`?î²=.³æ¹?î¯ný©g†?î¬ü÷Yt?î©Ê-oø ?î¦óæCp?î¤%-ÿ*?î¡=?îž^넧û?î›}>ìi?‡!O#?'aL?î’Æþ½ux?îÚ(ŸJ?îŒêY³?î‰÷ÝzE&?ò?î„ ˜Ïõ?îÑ‚ù??î~H G›?î{ýM/…?îxò!¾ ?îu 'j½Ž?îržµE?înõVÜèÞ?îkçRÉX?îhÖ’°¾(?îeÃv‘ ?îb¬áÿ­?î_“ó.ÿÚ?î\xKì+‹?îYYíå›?îV8רEè?îS vã?îOîŒnó!?îLÅX|ê?îI™q‡UÍ?îFjØ{ˆ(?îC9ŽD½?î@“Ìæ>?î<ÎêüÜ?î9•‘ÓÍÖ?î6YŒ-“?î3Ùÿ:i?î/Ù|8eº?î,•sÉiô?î)NÁ£NÚ?î&f·Î•?î"¹cùU,?îjº[?îjÐä?îÅvN­‡?înÝÊ^?î¢9Ž^?î¹Ä’Ì+?î [EÍT?îú&áî?î–hÆ›G?î0 w9?íýÇìÜá?íú[}"%ö?íöíL_F?íó|€¹C?íð 'W?íì“£g?íéŠÙée?íåŸ`A˜É?íâ! Uú"?íÞ¡Lþ–?íÛd…?m?íטê¡ý“?íÔßo!?íІCï8Í?íÌù%y¡?íÉi`¾L?íÅ×Ć½?íÂBG6÷§?í¾ªérÙþ?í»~š…?í·taIF?í³Õ—"™?í°4Êß7?í¬c•?í¨é„ôËŽ?í¥@uŠCT?í¡”ã.Sq?íæÎìuL?íš69ÐÁª?í–ƒ$çð*?í’Í‘?VÐ?íäé{?í‹Zñç9l?í‡èUtÀ?íƒÞd?eù?í€fµsr?í|WðÈžç?íx‘Š„ó?ítÇ  \‰?ípûÇcöz?ím-z¡¼ï?íi\ºÚ²å?íe‰‰#s´?ía³æ‘2€?í]ÛÔ9¹À?íZS3j¹?íV$d•<ø?íRE v½Ò?íNcBðÞ?íJês?íF˜x ™&?íB¯uäû>?í>Ä ºƒ:?í:Ö=©6D?í6æ Ì«²?í2órA |?í.þx#¼?í+ #?í' `¥Êw?í#E‚Á?íÌEæC?íöÁõ?íÃýiû?í 72¥?íPÏ9/?í ÷õM8?íê{ÇC?íÛg8'?ìþÊMùA?ìú¶¸¡ d?ìö Ðƒ]?ìòˆ–Ä4_?ìîn Šÿ?ìêQ2ú³û?ìæ2 <¨«?ìâ–w ~?ìÝìÕÑ„l?ìÙÆÊt5r?ìÕžu‡Íÿ?ìÑsØ5€v?ìÍFó§š?ìÉÉ’ ?ìÄæY~é´?ìÀ²¦;KJ?ì¼|°gy»?ì¸Dy/¹¡?ì´ ÀÐÀ?ì¯ÍKHm?ì«ŽVó?ì§M%ð`œ?ì£ ¹n‘ä?ìžÄœõ9?ìš|2«KÁ?ì–2ÉÓ÷?ì‘åÌ)I?ì—Gúâ¨?ì‰FpSÀ?ì„ó£»Ê«?쀞†ð>?ì|G7ŸçV?ìwí¹ŸLH?ìs’ B4S?ìo43½-?ìjÔ.E;ë?ìfqþÝŽ?ìb ¤SX?ì]§"EÊ?ìY>yü?ìTÓª ?ìPf¶\™?ìK÷Ÿ3!?ìG†eÐ?ìC le?ì>‘@~²?ì:%ø‡’ü?ì5¬B{´ö?ì10pWÌß?ì,²ƒW2õ?ì(2|µ®ä?ì#°]¯w9?ì,'0Ì?ì¥Ûgî5?ìz¡/9?ì“jà;?ì €Y©?ìwè©_n?ìçAœ _?ëÿTŒ5ª?ëú¿Éf¢H?ëö(ú¾Òg?ëñ!dšÝ?ëìõ>™8“?ëèXSžOõ?ëã¹aµìc?ëßj"š?ëÚun&á$?ëÕÐoMÉ?ëÑ)nfú?ëÌ€le2??ëÇÕkm¤?ëÃ(l`æ*?ë¾yp…É1?ë¹Èy!Qæ?뵇yq±?ë°`œÔz£?ë«©ºyá?ë¦ðá®p?ë¢6»Þ×?ëyQé:?똺~®•?ë“ù÷ÄÆA?ë7bg°?ëŠr݆Մ?ë…¬k•­Ü?ë€ä zé½?ë|Ä€Ü?ëwM‘ò3A?ërwôB?ëm¯uC~b?ëhݺˆ„?ëd ÁË ú?ë_4Á¬ò?ëZ\êçá?ëUƒ“âñ?ëP§À l?ëKÊ‘›"?ëF놔ùá?ëB  F>Ñ?ë='ßýŠì?ë8CG åb?ë3\Öº§ ?ë.t_yÅ?ë)ŠuHWó?ë$ž†Å‹×?ë°Æ'¯?ëÁ4¿©Ë?ëÏÓÞ² ?ëܤÖM‹?ë ç¨øK?ëðá–Ê?ëøP2_?êüýõ“8à?êøӖܼ?êóëbg"?êî>IjÆ?êéÍŸÃ;?êãÿš¹”l?êÞú¦ëIý?êÙóó‰–º?êÔëét?êÏáS`!,?êÊÕiC"û?êÅÇÄèBþ?êÀ¸g¥Žÿ?껧RÑXs?궔‡Â3Ù?ê±€Îø,?ê¬iÔN¾L?ê§Qî˜ài?ê¢8Xùh?êêäU?꘢»È?ê’á|„ÙP?êÁ/éÔà?ꈟ9*„5?êƒ{™ŸúA?ê~VR£†›?êy/eŽ´â?êtÓ»L(?ênÜžƒNa?êi°Ç@÷Ê?êdƒON¾P?ê_T8Q?êZ#‚Å—r?êTñ0ä±)?êO½C¿õ?êJ‡¼²ð¸?êEPh?ê@æOTŒ?ê:Ý™°äœ?ê5¡¸š{+?ê0dDh®ù?ð3;–à?ð™¶õ?ïÿüÌÄä?ïÿó3{?ïÿæf0 ?ïÿÖfŠe?ïÿÃ2Ó¥ˆ?ïÿ¬Ìg*?ïÿ“2ÙÐV?ïÿvf3Fm?ïÿVf|0?ïÿ33¾&è?ïÿ ιï?ïþã5Xn?ïþ¶iȽž?ïþ†kbÆ?ïþS:2å!?ïþÖJ}ß?ïýã?¹3¹?ïý¦vLã?ïýfzâ ?ïý#LÁA?ïüÜìC ?ïü“Y{&?ïüF”QÆ?ïûök0I?ïû£tQ4H?ïûMLNŠ?ïúóŒvdô?ïú–ÍêR?ïú6ÝÃç'?ïùÓ¼çß?ïùmi‚?ïùä× Å?ïø—/p})?ïø'I ç?ï÷´1Â!â?ï÷=é¾a™?ïöÄq!6?ïöGÈ Ã?ïõÇî­;’?ïõDå"°?ïô¾«”úŒ?ïô5B. À?ïó¨©~ÿ?ïóàxzû?ïò…èU?ïñïÁV\†?ïñVk+LÇ?ïð¹æ+Ùý?ïð2†ê ?ïïwPlX§?ïîÑ@ ñj?ïî(šu’?ïí{•G˜ö?ïìËûHŽ?ïì3ÐLN?ïëc??ïêªO¦z?ïéíδ¨æ?ïé.S}oR?ïןŽöV£?ïÖ¤Z‹K?ïÕ˜’éúç?ïÔZò³®?ïÓ„üóG?ïÒvx¬æŸ?ïÑdÎÿ)Ç?ïÐP GÃ?ïÏ8 &úk?ïÎó¢ê?ﾟKËëþ?ï½XVñÌ…?ï¼BÏ4‡?ïºÁÆŸ‹?ï¹p¾;t¼?ï¸N’·?ï¶ÆÁ/“X?ïµmzCŽ?ï´NÙ+?ï²°j´Hu?ï±Mjt„x?ï¯çNƒ²L?ï®~L ?ï­Å:Áù?ï«¢XºÛ~?ïª/Ò:UÃ?墨2'”?ï§Axñâ¦?ï¥Å§ v—?ï¤F¼ßm{?ï¢ÄºåÍF?ï¡?¡„ ?qPgº?ïž,*5ü?ïœÍë“ã?ï› [² º?ï™wÔhÊ?ï—à8† ?ï–Eˆ…%G?Äß’?ï“î\‹?ï‘c“wF?ï¼店?ïŽû„ä"?ïŒdÜï–š?­¥YŽ?ï‰n&™&?ï‡Kô¥á?ï…‘À‘´Y?ïƒÕS€Ý?ï‚ØFâ?ï€SOfP\?ï~¹g<å?ï|ÅφÅ?ïzùh&µÔ?ïy*­õ46?ïwXèÄN?ïu„1p?ïs¬?í±?ïqÑ\ŸsŒ?ïoópß”¬?ïn|Üi?ïl.#RŠ?ïjG~Dôû?ïh]tÑ=…?ïfpeY^‰?ïd€Poi·?ïb6¦OÇ?ï`—‘à0?ï^öÆÈÞ?ï\¡ÑÚ•è?ïZ¢ªc±K?ïX €ùbœ?ïV›V3λ?ïT“*«÷?ïR‡þû»¯?ïPyÓ½Ö&?ïNh©Þ?ïLTFˆ?ïJ=ZÊ]é?ïH#7rMø?ïFŸT?ïCåûð¥;?ïAÂå¥7?ï?œÓ…®Ï?ï=sÈ /:?ï;GÃAm ?ï9ÅƇì?ï6æÐAx7?ï4±ãX¹?ï2yÿ°ô]?ï0?%ó©Ñ?ï.Vȇ>?ï+À’Ø»í?ï)|ÚÎMü?ï'6/T?ï$ì‘ÒÁ?ï" ÀÏ?ï PF?ïþ „ e?﨩û!F?ïPX#~?ïõ‚ÁÐ?ï–èõ€Ï?ï5͸‹?ïÑÄ´”6?ï jÐhÒ?ï ðïÒ?ï”&ÿÉ?ï$sN•?ï±Ö”òH?ïMN+?îï´‚rƒã?îí'Õ#´?îê˜F!c?îèÖ*ì'?îåp†Ä?îâØVhsã?îà=H ˆ„?îÝŸ[í¹­?îÚþ’”3?îØZìØëj?îÕ´k¤©?îÓ Të?îÐ^ÙÝ?îͯəB\?îÊýá›]?îÈI!êA?îÅ‘‹Oì2?îÂט?îÀÜŽ»?î½YÆ’¼?ۻ?’?î·Ñ!Ý?îµE`?î²=.³æ¹?î¯ný©g†?î¬ü÷Yt?î©Ê-oø ?î¦óæCp?î¤%-ÿ*?î¡=?îž^넧û?î›}>ìi?‡!O#?'aL?î’Æþ½ux?îÚ(ŸJ?îŒêY³?î‰÷ÝzE&?ò?î„ ˜Ïõ?îÑ‚ù??î~H G›?î{ýM/…?îxò!¾ ?îu 'j½Ž?îržµE?înõVÜèÞ?îkçRÉX?îhÖ’°¾(?îeÃv‘ ?îb¬áÿ­?î_“ó.ÿÚ?î\xKì+‹?îYYíå›?îV8רEè?îS vã?îOîŒnó!?îLÅX|ê?îI™q‡UÍ?îFjØ{ˆ(?îC9ŽD½?î@“Ìæ>?î<ÎêüÜ?î9•‘ÓÍÖ?î6YŒ-“?î3Ùÿ:i?î/Ù|8eº?î,•sÉiô?î)NÁ£NÚ?î&f·Î•?î"¹cùU,?îjº[?îjÐä?îÅvN­‡?înÝÊ^?î¢9Ž^?î¹Ä’Ì+?î [EÍT?îú&áî?î–hÆ›G?î0 w9?íýÇìÜá?íú[}"%ö?íöíL_F?íó|€¹C?íð 'W?íì“£g?íéŠÙée?íåŸ`A˜É?íâ! Uú"?íÞ¡Lþ–?íÛd…?m?íטê¡ý“?íÔßo!?íІCï8Í?íÌù%y¡?íÉi`¾L?íÅ×Ć½?íÂBG6÷§?í¾ªérÙþ?í»~š…?í·taIF?í³Õ—"™?í°4Êß7?í¬c•?í¨é„ôËŽ?í¥@uŠCT?í¡”ã.Sq?íæÎìuL?íš69ÐÁª?í–ƒ$çð*?í’Í‘?VÐ?íäé{?í‹Zñç9l?í‡èUtÀ?íƒÞd?eù?í€fµsr?í|WðÈžç?íx‘Š„ó?ítÇ  \‰?ípûÇcöz?ím-z¡¼ï?íi\ºÚ²å?íe‰‰#s´?ía³æ‘2€?í]ÛÔ9¹À?íZS3j¹?íV$d•<ø?íRE v½Ò?íNcBðÞ?íJês?íF˜x ™&?íB¯uäû>?í>Ä ºƒ:?í:Ö=©6D?í6æ Ì«²?í2órA |?í.þx#¼?í+ #?í' `¥Êw?í#E‚Á?íÌEæC?íöÁõ?íÃýiû?í 72¥?íPÏ9/?í ÷õM8?íê{ÇC?íÛg8'?ìþÊMùA?ìú¶¸¡ d?ìö Ðƒ]?ìòˆ–Ä4_?ìîn Šÿ?ìêQ2ú³û?ìæ2 <¨«?ìâ–w ~?ìÝìÕÑ„l?ìÙÆÊt5r?ìÕžu‡Íÿ?ìÑsØ5€v?ìÍFó§š?ìÉÉ’ ?ìÄæY~é´?ìÀ²¦;KJ?ì¼|°gy»?ì¸Dy/¹¡?ì´ ÀÐÀ?ì¯ÍKHm?ì«ŽVó?ì§M%ð`œ?ì£ ¹n‘ä?ìžÄœõ9?ìš|2«KÁ?ì–2ÉÓ÷?ì‘åÌ)I?ì—Gúâ¨?ì‰FpSÀ?ì„ó£»Ê«?쀞†ð>?ì|G7ŸçV?ìwí¹ŸLH?ìs’ B4S?ìo43½-?ìjÔ.E;ë?ìfqþÝŽ?ìb ¤SX?ì]§"EÊ?ìY>yü?ìTÓª ?ìPf¶\™?ìK÷Ÿ3!?ìG†eÐ?ìC le?ì>‘@~²?ì:%ø‡’ü?ì5¬B{´ö?ì10pWÌß?ì,²ƒW2õ?ì(2|µ®ä?ì#°]¯w9?ì,'0Ì?ì¥Ûgî5?ìz¡/9?ì“jà;?ì €Y©?ìwè©_n?ìçAœ _?ëÿTŒ5ª?ëú¿Éf¢H?ëö(ú¾Òg?ëñ!dšÝ?ëìõ>™8“?ëèXSžOõ?ëã¹aµìc?ëßj"š?ëÚun&á$?ëÕÐoMÉ?ëÑ)nfú?ëÌ€le2??ëÇÕkm¤?ëÃ(l`æ*?ë¾yp…É1?ë¹Èy!Qæ?뵇yq±?ë°`œÔz£?ë«©ºyá?ë¦ðá®p?ë¢6»Þ×?ëyQé:?똺~®•?ë“ù÷ÄÆA?ë7bg°?ëŠr݆Մ?ë…¬k•­Ü?ë€ä zé½?ë|Ä€Ü?ëwM‘ò3A?ërwôB?ëm¯uC~b?ëhݺˆ„?ëd ÁË ú?ë_4Á¬ò?ëZ\êçá?ëUƒ“âñ?ëP§À l?ëKÊ‘›"?ëF놔ùá?ëB  F>Ñ?ë='ßýŠì?ë8CG åb?ë3\Öº§ ?ë.t_yÅ?ë)ŠuHWó?ë$ž†Å‹×?ë°Æ'¯?ëÁ4¿©Ë?ëÏÓÞ² ?ëܤÖM‹?ë ç¨øK?ëðá–Ê?ëøP2_?êüýõ“8à?êøӖܼ?êóëbg"?êî>IjÆ?êéÍŸÃ;?êãÿš¹”l?êÞú¦ëIý?êÙóó‰–º?êÔëét?êÏáS`!,?êÊÕiC"û?êÅÇÄèBþ?êÀ¸g¥Žÿ?껧RÑXs?궔‡Â3Ù?ê±€Îø,?ê¬iÔN¾L?ê§Qî˜ài?ê¢8Xùh?êêäU?꘢»È?ê’á|„ÙP?êÁ/éÔà?ꈟ9*„5?êƒ{™ŸúA?ê~VR£†›?êy/eŽ´â?êtÓ»L(?ênÜžƒNa?êi°Ç@÷Ê?êdƒON¾P?ê_T8Q?êZ#‚Å—r?êTñ0ä±)?êO½C¿õ?êJ‡¼²ð¸?êEPh?ê@æOTŒ?ê:Ý™°äœ?ê5¡¸š{+?ê0dDh®ù?ð™¶õ?ð?ïÿù™Šõ?ïÿïÿÛ§V?ïÿã2÷‰w?ïÿÓ2á—q?ïÿ¿ÿžž ?ïÿ©™4`?ïÿÿ©•Å?ïÿs3í(?ïÿS3R ?ïÿ0—…ò?ïÿ šàïü?ïþà9Ìû?ïþ³6®—`?ïþƒ8L¿7?ïþP"ª$?ïþ£?³T?ïýà ´+}?ïý£C‘XÔ?ïýcGéw?ïý Ï·?ïüÙ¹X?•?ïü&˜,C?ïüCa¥ŽC?ïûój—kõ?ïû A…Àñ?ïûIæ‰}ü?ïúðY¼ˆø?ïú“›9¼Ü?ïú3«éŸ?ïùЉ‚Ô3?ïùj6‰6p?ïù²N¿?ïø“üów?ïø$–Åõ?ï÷°ÿ[i_?ï÷:·c}4?ïöÁ>Òwr?ïöD•Ì“?ïõļw½r?ïõA²ù»>?ïô»yzc?ïô2 Ñw?ïó¥wU'?ï󮇲#?ïò‚¶?ïñìƒJI?ïñS9g?ïð¶´wÄ]?ïðâÍ…?ïïtØ…ƒ?ïîΉ¹¬?ïî$Ð(*£?ïíxcæŒ:?ïìÈÉø…c?ïì’°?ïë` ê™?ïê¦ì6À ?ïéê®—M?ïé+"Šƒ¾?ïèh{ܽ?ï碧Tì?ïæÙ§¸í‹?ïæ |lj?ïå>%«qÀ?ïäk£µ&?ïã•öÈ1˜?ïâ½$ˆM?ïáá ¡?ïáð½¥ì?ïàšË?ïß:“?ïÞQq>:T?ïÝežÆEb?ïÜv£qµ?ïÛ„ˆÓ?ïÚ3Q­ ?ïÙ–¿·?ïØ›#%W?ïל_ÄéŠ?ïÖšuBé?ïÕ•cìtO?ïÔ,™W?ïÓÍûUÐ?ïÒsIÿ– ?ïÑa m7Ð?ïÐLÑ–\?ïÏ4Ý̶?ïÎÅdõk?ïÌûˆ³YS?ïËÚ( g?ïʵ£É’ ?ïÉü?;¬?ïÈc1Ƴ/?ïÇ5D¹5q?ïÆ5pìÊ?ïÄÐHðÛ?ïرFj?ïÂ^=Êß(?ïÁ ©/™Š?ï¿ßô*@œ?ﾜ‹Ê?ï½U*a·?ï¼ _‰?ﺽãxFL?ï¹m’½‘?ï¸"‡Aq?ï¶Ã•G¾?ïµiê´Q[?ï´ #6?ï²­?4h?ï±J?$~?ï¯ä#K"C?ï®zì8?ï­šJÀ]?ï«Ÿ-ï˜J?ïª,§” ^?嘆¦»Ô?ï§>N–¶ç?ï¥Â|ÔFš?ï¤C’Ј{?ï¢Áý‚r?ï¡œ?ïž)*”R?¤ È­?ï› 2gí?ï™t«måO?ï—Ý´šÒ?ï–B_ÜÈù?œ`–•?ï“Å»}?ï‘_Üh)_?ï¸àä¹w?ïŽÓ®~[?ïŒaµD³?†%?ïˆþFÑÜ\?ï‡G÷˾¾3‹?î÷FðX?îôÂvQà?îò;5 Ë?îï±jrjö?îí$½dàÍ?îê•.£ØŽ?îè¾ïô?îåmoÑÒ?îâÕ?±•¾?îà:1¬_¥?îÝœE¼y?îÚû|¦PË?îØW×.šl?îÕ±V.?îÓú2—á?îÐ[Ä<.8?îͬµ!?îÊúÍG*?îÈF Û+S?îÅŽw†?îÂÔ ›C?îÀÉQX%?î½V³ ™?îº“É ÷¥?î·Î #Óð?îµ}#Tj?î²:Ùe]?î¯kì¸?ë¬ÄÛ?î©ÇmÅÈ?î¦ð,»&?h§?î¡:ÝôUx?îž[Û¦ËÚ?î›zªØ¸?w×KF?î•®´?î’Ãðg?î×¾vb?îŒçJÿ¶¦?î‰ôϦ¼D?î†ÿŽÛo?î„‹”'¾?î Ä“sÃ?î~;jP›?î{ð÷ ‰?îx æ·‡?îu¯Ú?îqý’š¸§?înòK¼Ú…?îkäG÷~?îhÓˆ-^Š?îeÀ AòJ?îb©Øjt?î_防y?î\uB¥o©?îYVä&Ç?îV5Ï}™?îS¶x?îOë„i3å?îLÂPÇ6?îI–j#´l?îFgÑi]E?îC6‡ƒ•C?î@^w?î<ËãæÒ˜?î9’Œ -0?î6V†¶Àˆ?î3ÔÛzŒ?î/ÖwgüØ?î,’oLœR?î)K½z`¥?î&bãá?î"¶`xñõ?îg·/HG?îgùÕ;?îÂsͽ?îkÛž>Í?î c) ?î¶Ãd=?î XD£,Ü?î÷& m£?î“hI¿?î- Qf×?íýÄW´?íúX}«0œ?íöêLóÁ H?í:ÓQY\ÿ?í6ãá¥c?í2ð†»N?í.ûi¿?í+1ÔêI?í' vPr—?í#[“là?íâ¼Òe?í ì*æ?í ÛAŒ ?íNÝ™C?íþhá‚o?í ô*o'?í用fÑ?íب°~&?ìþÇgª¨±?ìú³ÒºÏF?ìöëdx?ìò…±¯d?ìîk'ÞR‡?ìêNN¸<{?ìæ/'c¶*?ìâ ³Úâ?ìÝéòÌL?ìÙÃçÙ2ã?ìÕ›“W;\?ìÑpöo˜/?ìÍDL?ìÉè­Y?ìÄãxú^?ìÀ¯Æ"RŽ?ì¼yкMÑ?ì¸A™î”H?ì´"ëë—?ì¯Êlß™ö?ì«‹x÷e±?ì§JHa””?ì£ÜLë^?ìžÁ5è­ðó®?ì‘âð¾q¿?ì”lþLÆ?ì‰C´â7Ë?ì„ðÉœ`ò?쀛¬_põ?ì|D^^Š’?ìwêàÍIþ?ìs4ßÄY?ìo1[ʇ?ìjÑV—š?ìfo&ýrX?ìb ͱ —?ì]¤Lɺ?ìY;£\Žº?ìTÐÔ­™?ìPcá}îÎ?ìKôÊÆŽ¿?ìGƒ‘Õ=)?ìC7ã–?ì>š¾)ÁÏ?ì:#%ã3G?ì5©pIè?ì1-ž˜ÉË?ì,¯² /?ì(/«Üà?ì#­Jó?ì)Wl¨?ì£ éÿ˜?ì«—Kh?ì7Õ<\?ì ±â*Á?ìuüÚb?ìätdyö?ëÿQ¿X¢‰?ëú¼ýVô?ëö&.çF?ëñV|5?ëìòs¬þ‰?ëèU‰(.?ë㶗¶…?ëß ™+ ?ëÚr¥@…?ëÕͦj” ?ëÑ&¥ßÈ«?ëÌ}¤·â ?ëÇÒ¤7I²?ëÃ%¥¢Ë{?ë¾vª?•¦?ë¹Å³S8A?ëµÂ#¤“?ë°]×÷,Œ?뫦ö‚1?ë¦î· ?ë¢3PI;?ëvŽïÞ’?똷Úþ̬?ë“÷5¾±?ë4 x?ëŠptŠU?ë…©ªý¢s?ë€áM]OS?ë|Ýä+?ëwJÒÊ ö?ër|¸lÒ×?ëm¬·‘‰?ëhÚÐÐ?ëd.Ý?ë_1V€º?ëZYŧ±¾?ëU€TÌÒð?ëP¥¿Jy?ëKÇÖÌÓ?ëFèÌC{G?ëBæq¥B?ë=%&¦Ë?ë8@Ž/£÷?ë3Z]Øv?ë.qØ€M ?ë)‡½æûñ?ë$›Ïâ/M?뮀?ë¾~Ø×å?ëÍvk£?ëÙïì¿®?ë äô¤é?ëî-«8š?ëõœ—ãß?êüûB¦[ ?ê÷ÿ!)$?êó9tó2?êîŒÛïÈ?êé²nW?êãüêL’©?êÞ÷öþÈ??êÙñDÁÄ?êÔèÒþxt?êÏÞ¤ö+…?êÊÒ»Z_•?êÅÅ€Þ?êÀµº¿´ª?껤¦m4§?궑Ûßòh?ê±}\nÄÉ?ê¬g)pÄ„?ê§OD=K¨?ê¢5®+ôù?êh”›_?ê—ýtÏYP?ê’ÞÔ4ˆ9?꾈¿é?ꈜ‘àÕü?êƒxòÙÝB?ê~S¬a%.?êy,¿Ð9=?êt.€à_?ênÙùÍd?êi®#)g?êd€«¡}3?ê_Q”ÞƳ?êZ à!íZ?êTîŽÆŠ?êOº¢&‡?êJ…žÞK?êEMüŠÚ?ê@FFs½?ê:Úú-ÙŽ?ê5ŸnP?ê0a¥ñÈ£healpy-1.8.1/healpy/test/data/cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_II_lmax64_rmmono_3iter.fits0000654000175000017530000002640012276746731034046 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2014-01-14T18:57:57' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'TABLE ' / ASCII table extension BITPIX = 8 / 8-bit ASCII characters NAXIS = 2 / 2-dimensional ASCII table NAXIS1 = 15 / width of table in characters NAXIS2 = 65 / number of rows in table PCOUNT = 0 / no group parameters (required keyword) GCOUNT = 1 / one data group (required keyword) TFIELDS = 1 / number of fields in each row COMMENT ----------------------------------------------- COMMENT Map Analysis Specific Keywords COMMENT ----------------------------------------------- EXTNAME = 'ANALYSED AUTO POWER SPECTRUM' COMMENT CREATOR = 'ANAFAST ' / Software creating the FITS file VERSION = '3.11 ' / Version of the simulation software COMMENT MAX-LPOL= 64 / Maximum Legendre order L COMMENT POLAR = F / Polarisation included (True/False) BCROSS = F / Magnetic cross terms included (True/False) COMMENT NSIDE = 32 / Resolution Parameter of Input Map COORDSYS= 'unknown ' / Input Map Coordinate system COMMENT G = Galactic, E = ecliptic, C = celestial = equatorial COMMENT TBCOL1 = 1 / beginning column of field 1 TFORM1 = 'E15.7 ' TTYPE1 = 'TEMPERATURE' / Temperature C(l) TUNIT1 = '^2 ' / square of map units COMMENT CUT-SKY = 0.000000000000E+00 / [deg] Symmetric Cut Sky NITERALM= 3 / Number of iterations for a_lms extraction LREGRESS= 1 / Regression of low multipoles (0/1/2) NMAPS_IN= 1 / Number of maps (co-)analysed (1/2) COMMENT HISTORY Input Map = wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits END 3.3414573E-11 3.3517558E-06 4.8989430E-05 1.0169477E-04 1.2062433E-04 1.1325596E-04 4.7197471E-05 4.6721838E-05 3.1373249E-05 2.9179017E-05 1.6283797E-05 2.8455279E-05 1.5565542E-05 1.7469347E-05 1.7716973E-05 1.2910575E-05 1.2409597E-05 1.1831381E-05 6.3309044E-06 9.5228725E-06 5.5759465E-06 5.0533667E-06 4.0194614E-06 4.6285672E-06 5.7274942E-06 4.6215828E-06 5.1510547E-06 5.0876070E-06 4.6781470E-06 4.5110633E-06 3.7194425E-06 4.3340710E-06 5.3396429E-06 3.4312413E-06 3.6795705E-06 2.3858963E-06 3.5362266E-06 2.5809411E-06 3.5526471E-06 3.5767098E-06 3.3679785E-06 3.5763799E-06 3.6576841E-06 3.3139222E-06 2.2850354E-06 2.2602651E-06 2.4078142E-06 2.5892639E-06 1.8113082E-06 2.4214503E-06 2.0994112E-06 2.1263249E-06 2.1714288E-06 1.6605873E-06 1.9703330E-06 2.1057131E-06 1.7174100E-06 1.6981736E-06 1.6703773E-06 1.6212538E-06 1.8049700E-06 1.6118177E-06 1.5781592E-06 1.2372816E-06 1.1714108E-06 healpy-1.8.1/healpy/test/data/anafast_3_11_config_test_anafast.par0000654000175000017530000000041412276746731025530 0ustar zoncaplanck00000000000000infile = wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits outfile = !cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_II_lmax64_rmmono_3iter.fits simul_type = 1 nlmax = 64 #maskfile = wmap_temperature_analysis_mask_r9_7yr_v4_udgraded32.fits iter_order = 3 regression = 1 ././@LongLink0000000000000000000000000000014600000000000011216 Lustar 00000000000000healpy-1.8.1/healpy/test/data/cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_IQU_lmax64_rmmono_3iter.fitshealpy-1.8.1/healpy/test/data/cl_wmap_band_iqumap_r9_7yr_W_v4_udgraded32_IQU_lmax64_rmmono_3iter.fit0000654000175000017530000004160012276746731034017 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2014-01-14T18:50:12' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'TABLE ' / ASCII table extension BITPIX = 8 / 8-bit ASCII characters NAXIS = 2 / 2-dimensional ASCII table NAXIS1 = 95 / width of table in characters NAXIS2 = 65 / number of rows in table PCOUNT = 0 / no group parameters (required keyword) GCOUNT = 1 / one data group (required keyword) TFIELDS = 6 / number of fields in each row COMMENT ----------------------------------------------- COMMENT Map Analysis Specific Keywords COMMENT ----------------------------------------------- EXTNAME = 'ANALYSED AUTO POWER SPECTRUM' COMMENT CREATOR = 'ANAFAST ' / Software creating the FITS file VERSION = '3.11 ' / Version of the simulation software COMMENT MAX-LPOL= 64 / Maximum Legendre order L COMMENT POLAR = T / Polarisation included (True/False) BCROSS = T / Magnetic cross terms included (True/False) COMMENT NSIDE = 32 / Resolution Parameter of Input Map COORDSYS= 'unknown ' / Input Map Coordinate system COMMENT G = Galactic, E = ecliptic, C = celestial = equatorial COMMENT TBCOL1 = 1 / beginning column of field 1 TFORM1 = 'E15.7 ' TTYPE1 = 'TEMPERATURE' / Temperature C(l) TUNIT1 = '^2 ' / square of map units COMMENT TBCOL2 = 17 / beginning column of field 2 TFORM2 = 'E15.7 ' TTYPE2 = 'GRADIENT' / Gradient (=ELECTRIC) polarisation C(l) TUNIT2 = '^2 ' / power spectrum units COMMENT TBCOL3 = 33 / beginning column of field 3 TFORM3 = 'E15.7 ' TTYPE3 = 'CURL ' / Curl (=MAGNETIC) polarisation C(l) TUNIT3 = '^2 ' / power spectrum units COMMENT TBCOL4 = 49 / beginning column of field 4 TFORM4 = 'E15.7 ' TTYPE4 = 'G-T ' / Gradient-Temperature (=CROSS) terms TUNIT4 = '^2 ' / power spectrum units COMMENT TBCOL5 = 65 / beginning column of field 5 TFORM5 = 'E15.7 ' TTYPE5 = 'C-T ' / Curl-Temperature terms TUNIT5 = '^2 ' / power spectrum units COMMENT TBCOL6 = 81 / beginning column of field 6 TFORM6 = 'E15.7 ' TTYPE6 = 'C-G ' / Curl-Gradient terms TUNIT6 = '^2 ' / power spectrum units COMMENT COMMENT The polarisation power spectra have the same definition as in CMBFAST COMMENT CUT-SKY = 0.000000000000E+00 / [deg] Symmetric Cut Sky NITERALM= 3 / Number of iterations for a_lms extraction LREGRESS= 1 / Regression of low multipoles (0/1/2) NMAPS_IN= 1 / Number of maps (co-)analysed (1/2) COMMENT HISTORY Input Map = wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits END 3.3414573E-11 0.0000000E+00 0.0000000E+00 0.0000000E+00 0.0000000E+00 0.0000000E+00 3.3517558E-06 0.0000000E+00 0.0000000E+00 0.0000000E+00 0.0000000E+00 0.0000000E+00 4.8989430E-05 1.1326727E-05 1.5167591E-06 1.8729554E-05 -5.0660765E-07 -1.2990840E-06 1.0169477E-04 5.5491796E-07 3.8988201E-05 -8.2934815E-07 -1.1219169E-05 1.8067552E-06 1.2062433E-04 2.7363657E-07 3.1835313E-07 2.8755430E-06 2.4569422E-06 1.0931864E-07 1.1325596E-04 1.7977787E-07 1.5543286E-06 2.8972218E-07 -3.5698260E-06 3.8918211E-07 4.7197471E-05 3.5122463E-07 8.0548624E-08 1.6187582E-06 -2.5457095E-07 -7.8117601E-09 4.6721838E-05 2.9025040E-07 5.4732448E-07 1.8679569E-07 8.0861071E-07 1.6300866E-07 3.1373249E-05 1.6711914E-07 1.3002980E-07 -1.5752390E-07 6.0998417E-07 -5.9480239E-08 2.9179017E-05 7.4773467E-08 2.1617154E-07 -6.2634064E-07 -3.4087824E-07 2.3513314E-08 1.6283797E-05 1.1672569E-07 7.1538452E-08 4.2229684E-07 4.8906196E-07 -1.4694910E-09 2.8455279E-05 6.2293317E-08 1.5802097E-07 3.8576127E-07 -2.6001143E-07 3.6031366E-08 1.5565542E-05 9.0137057E-08 8.4176719E-08 -3.6806281E-07 -5.4398683E-08 1.1470060E-08 1.7469347E-05 5.2516327E-08 1.1767365E-07 1.7213877E-07 -1.0687624E-07 2.2248097E-08 1.7716973E-05 1.1285540E-07 1.2472890E-07 -1.1188859E-07 9.8666881E-08 -1.6694468E-08 1.2910575E-05 8.4291230E-08 6.3593774E-08 -1.9726707E-09 9.3617935E-08 -2.4510989E-08 1.2409597E-05 7.7402902E-08 5.3499942E-08 1.3308906E-07 -6.6400737E-08 2.6162448E-09 1.1831381E-05 6.5099499E-08 9.1751886E-08 7.6643175E-08 -1.6233711E-08 -1.6971301E-08 6.3309044E-06 6.6205367E-08 8.1543647E-08 -1.0657038E-07 5.5560379E-09 2.7702651E-08 9.5228725E-06 5.1687952E-08 1.3422897E-07 -5.0333743E-08 9.4987918E-08 7.1446986E-09 5.5759465E-06 4.8521827E-08 6.9847218E-08 1.2662450E-07 1.1206572E-07 9.5209955E-09 5.0533667E-06 3.7051095E-08 5.9060927E-08 3.3978118E-08 9.5742443E-08 6.9442746E-10 4.0194614E-06 4.5561773E-08 8.2329564E-08 -4.4227448E-08 -1.3380291E-07 -1.0451082E-08 4.6285672E-06 7.0213218E-08 5.5583765E-08 -1.5426014E-08 4.0318479E-08 -5.4374962E-09 5.7274942E-06 4.4926225E-08 1.0069360E-07 7.6489544E-09 4.5717421E-08 1.2411229E-08 4.6215828E-06 7.4644234E-08 6.2953333E-08 1.2454113E-08 -8.2562039E-08 -1.4207249E-08 5.1510547E-06 4.9761585E-08 3.5465646E-08 5.5413921E-08 3.4581070E-08 2.3994184E-09 5.0876070E-06 4.8609841E-08 7.1690437E-08 -1.4455247E-07 1.4442573E-07 -3.7034631E-10 4.6781470E-06 4.2000664E-08 4.0190177E-08 -1.8539815E-08 -5.2430789E-08 6.9588251E-09 4.5110633E-06 3.7648888E-08 8.0887602E-08 -3.1838638E-08 8.2901671E-08 8.8493275E-09 3.7194425E-06 4.4569632E-08 4.9354561E-08 -5.1000637E-08 2.3846111E-08 -4.2243560E-09 4.3340710E-06 2.4894126E-08 5.0191655E-08 8.1070919E-09 1.0444322E-07 -9.8000241E-10 5.3396429E-06 3.8473491E-08 5.6868114E-08 -7.3734519E-08 -4.9318459E-08 -6.9752404E-09 3.4312413E-06 4.1023235E-08 4.1241520E-08 1.3148380E-07 -8.1654548E-08 -3.6472485E-09 3.6795705E-06 2.9387111E-08 5.8280023E-08 -1.0297464E-08 5.6925320E-08 -1.7731748E-09 2.3858963E-06 4.4388191E-08 4.7877904E-08 6.1468919E-09 -3.5399477E-08 -7.0660344E-09 3.5362266E-06 3.1711508E-08 3.6997882E-08 -1.9408519E-08 2.1578805E-08 -2.3280804E-09 2.5809411E-06 4.3973770E-08 5.6319994E-08 2.6172218E-09 -3.7576058E-08 7.0989445E-09 3.5526471E-06 3.2260786E-08 3.5412384E-08 2.6822459E-08 -2.9876123E-08 2.8594191E-09 3.5767098E-06 3.6238013E-08 4.2996703E-08 3.3229757E-08 1.9209260E-08 -4.2390638E-09 3.3679785E-06 3.3644760E-08 3.3077626E-08 -5.4325586E-08 5.0498823E-08 -1.1307041E-08 3.5763799E-06 3.6355459E-08 3.6421220E-08 -3.9380279E-08 -6.5472513E-08 -2.4136253E-09 3.6576841E-06 3.7718280E-08 4.0498847E-08 2.3284095E-08 -3.8424332E-08 -6.0553257E-10 3.3139222E-06 3.7356493E-08 3.5905590E-08 -6.7429170E-08 -3.6308005E-08 1.7868270E-09 2.2850354E-06 3.4967957E-08 4.7278032E-08 -3.9159801E-08 2.1897767E-08 -6.0651590E-09 2.2602651E-06 3.5784261E-08 5.5064127E-08 1.3484804E-08 2.1172231E-09 -1.4507182E-09 2.4078142E-06 4.0586173E-08 3.5370299E-08 3.9109043E-08 -1.5488581E-08 -2.8332496E-09 2.5892639E-06 3.2592350E-08 4.2571667E-08 -1.4736191E-08 -4.9003592E-09 -1.0316374E-09 1.8113082E-06 4.7515925E-08 4.1403972E-08 -1.9459398E-08 1.0315002E-08 4.5571702E-09 2.4214503E-06 3.3786378E-08 4.0579021E-08 9.0302112E-09 -8.0383266E-08 -2.3375817E-09 2.0994112E-06 5.1217686E-08 4.9477457E-08 -3.0651046E-09 4.8709912E-09 -3.0967717E-10 2.1263249E-06 3.0008440E-08 3.2908694E-08 -6.8305024E-09 -8.1724325E-09 -1.9307356E-09 2.1714288E-06 2.6085985E-08 3.3008497E-08 1.1039996E-08 -5.2998816E-10 -2.9880032E-09 1.6605873E-06 2.7855240E-08 2.9612035E-08 1.7350445E-08 -1.9177701E-08 -6.0001644E-09 1.9703330E-06 3.2100829E-08 4.5367933E-08 1.3381025E-08 1.6832031E-09 4.2481360E-10 2.1057131E-06 4.5092165E-08 3.4587522E-08 -3.6454928E-08 -2.1820563E-08 -4.0278456E-09 1.7174100E-06 2.9217579E-08 3.9498520E-08 2.1351259E-08 4.1037776E-08 -3.8102206E-09 1.6981736E-06 3.4158209E-08 4.1009987E-08 -2.4353895E-08 1.0280260E-08 -4.7005932E-09 1.6703773E-06 4.0781380E-08 3.6596671E-08 4.1422975E-08 -5.5711361E-08 -2.3359064E-09 1.6212538E-06 3.2762653E-08 3.0405566E-08 -1.8850663E-09 1.5046229E-08 -1.0119409E-09 1.8049700E-06 3.2124838E-08 3.7500346E-08 -1.6460463E-08 -2.1222910E-08 2.1940931E-09 1.6118177E-06 3.1331698E-08 3.5415919E-08 3.8942797E-08 -1.6711065E-08 2.3549926E-09 1.5781592E-06 3.5286966E-08 3.4420523E-08 -2.0983954E-08 5.3279359E-09 -2.5278641E-09 1.2372816E-06 3.0536871E-08 3.7504719E-08 9.7266977E-09 -7.6671878E-09 7.0666482E-09 1.1714108E-06 3.4840955E-08 3.5955313E-08 -1.9077234E-08 -1.1136090E-09 -8.6695498E-11 healpy-1.8.1/healpy/test/data/anafast_3_11_config_test_anafast_xspectra.par0000654000175000017530000000052012276746731027437 0ustar zoncaplanck00000000000000infile = wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits infile2 = wmap_band_iqumap_r9_7yr_V_v4_udgraded32_masked.fits outfile = !cl_wmap_band_iqumap_r9_7yr_WVxspec_v4_udgraded32_II_lmax64_rmmono_3iter.fits simul_type = 1 nlmax = 64 #maskfile = wmap_temperature_analysis_mask_r9_7yr_v4_udgraded32.fits iter_order = 3 regression = 1 healpy-1.8.1/healpy/test/data/wmap_band_iqumap_r9_7yr_V_v4_udgraded32_masked.fits0000654000175000017530000045760012276746731030454 0ustar zoncaplanck00000000000000SIMPLE = T / conforms to FITS standard BITPIX = 8 / array data type NAXIS = 0 / number of array dimensions EXTEND = T END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / array data type NAXIS = 2 / number of array dimensions NAXIS1 = 12288 / length of dimension 1 NAXIS2 = 12 / length of dimension 2 PCOUNT = 0 / number of group parameters GCOUNT = 1 / number of groups TFIELDS = 3 / number of table fields TTYPE1 = 'I_STOKES' TFORM1 = '1024E ' TTYPE2 = 'Q_STOKES' TFORM2 = '1024E ' TTYPE3 = 'U_STOKES' TFORM3 = '1024E ' PIXTYPE = 'HEALPIX ' / HEALPIX pixelisation ORDERING= 'RING ' / Pixel ordering scheme, either RING or NESTED EXTNAME = 'xtension' / name of this binary table extension NSIDE = 32 / Resolution parameter of HEALPIX FIRSTPIX= 0 / First pixel # (0 based) LASTPIX = 12287 / Last pixel # (0 based) INDXSCHM= 'IMPLICIT' / Indexing: IMPLICIT or EXPLICIT END ñ¥Xbñ¥Xb½'Ú½º[Æe¼HÖº¼ºÙ¼€5<Í)<ö ‡½7÷ö<ñŠî½ Y;;‚á=¥}="6ñ¥Xb=2fð=dÂÒ>áÔ<TA¼ŸÞ$==Ó=–Äh<“5=œ©V=º*>Vùñ¥Xbñ¥Xb=ò==±[P=Þ‡<=»Õ:è“U¼f²r=ÍbÛ=ßò½-‘ª=³êñ¥Xb=Q÷Zñ¥Xb<‹‚ñ¥Xbñ¥Xb¼ö=ê¼ ¶Ð=J;i=®ƒ=¾q<ÆæÃñ¥Xbñ¥Xb=é&Tñ¥Xb=|W·½M¹™=g/Hñ¥Xb:,‡2½¬‹R½t»Ý»¼ <§‰¼‰Ü3½O•F=@rû;ÇS½bí<½)„;„a»¦b.=)¼ÃÚë<›°Œ=8 »ˆPñ>(ãÓ>æÝ>GQ><œÄñ¥Xb=Ñ =|PÚñ¥Xb»¨°“ñ¥Xb=dÛ›=^å5=;§<%ç+½{öx½|…ÿ¼ßz½<ÌNM¹ÃÆÀ<šÖç½ISÔ<¯Èº=´A‚; )P;uì¼H®\<Ãyañ¥Xb=*î‹<¸b=o!a'Eë>É>%'=þb=ÿ>=ƒå=é©Åñ¥Xb=–é‹=S­)=}¶e=Òñ¥Xbñ¥Xb=†\`<Æ>†½!ÏÓ=¹øï<§¥ó= ·:=Ä=‰C;Ñþõ=Ûq¯=‰'N>|w>,o¹=CÎü=“Ÿ=…VN<`À›ñ¥Xb=Q\/=OÁÛ=Dvë=\лðÃ]ñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼Ôhšñ¥Xb=º <Æùy=¢÷u=j')ñ¥Xbñ¥Xb"Á=²;ü=W›…=)‚U=K-K»pR=µ¶“=€:Ó=âr¼RÅž=Èïñ¥Xb=¹àñ¥Xb;Æüñ¥Xbñ¥Xbñ¥Xbñ¥Xb½.ñ¥Xbñ¥Xbñ¥Xb=@µ<À«<‘d;žI=>?;ñ¥Xb>½×=…Æ=|¢@ñ¥Xb=ßã—=ƒÞ6= 3±½*0¸=g·Í=ÜÌ];=–&=Ó š=Yu =–ÝM=œíñ¥Xb<Ѥg=*ß<ÂWu=}^<=Ï@>··=Þ½„8ñ¥Xb=D‹Añ¥Xb½4Ô ñ¥Xbñ¥Xbñ¥Xb9*õ<ÒÚ;Hú½ED“ñ¥Xb½(q»0Ãk<ôÃb=`C<¢Ú=…=šÿ@>1dØ=Íò>ãñ¥Xb=ê«Ê> Œñ¥Xb»ÿ«;‘F <îw¼ÌUÄ<Š¨=nu«=|Ÿ=Boñ¥Xb=¤ÌM<›a<ù]4:ç}L=…’·ñ¥Xb¼wñ¥Xb1lþñ¥Xbñ¥Xb;øÏ<­±Ç½-C ½fí+=)R0=[¾S=©xû=¿Çñ¥Xb=š*=X•öñ¥Xb;2R= =VàÝ=<ïÒñ¥Xbñ¥Xb<¤2Ù½#jg¼÷rF=@{<]Ù»=BG]=Ãûð< }}= Øû½K»®o‹¾»Q<ÌPg¼à5ú<ÅÀ—½¶·½C=žñ¥Xb=#ÿJ<;A=\-"¼åhº=î<„Ñ=Ò¿Áñ¥Xb=µO=…ƒ‰=!RS=ÆWñ¥Xbñ¥Xb½3]w=~Oð=óxã=ø.âñ¥Xbñ¥Xb<ªÔñ¥Xb=‡þ¹ñiÚ¼ÞŽ= zƒ¼5]™=‚&´=²'qñ¥Xb=TüA=3˜´ñ¥Xbñ¥Xb=‚úKÿ<ÃÖ=P¸`=¬FB=Ķñ¥Xb½)?3<ä¸=Œ!«ñ¥Xb½ 4ª==Bf=ïîÅ=Ϩâ=z¯N=j<ñ:Û—=‰c¨=º ¼¾Õq¼«º <'ÂX<•ÐL¼á>Œ¼ÿ"÷=´7½ë÷Ó¼{@Û=£ñ¼ŒRˆ=*:λ¹{H<?½;λTŒ<ÿÑÌ;æD†<—ïH> f;†„ã=#³=ñ¥Xbñ¥Xb=œ7<=ºF€=‹ï¼Áâ;¶é½PY,ñ¥Xbñ¥Xb<Ô§½¡^¼”ßññ¥Xb½]§½RÜG¼¸æ^<žN<Ш4½1Xþ½%Ö®»8Œ8ñ¥Xbñ¥Xb¼ûbˆ½7Ò<=u ¼k9<j =‹ÚYñ¥Xb» Í¿=¶: =$™<öÛ=¹iëñ¥Xbñ¥Xb=õ:<ÑŸñ¥Xbñ¥Xb=AX•=LÓï=†¸g=i ©<86=="È> }½fTÚ¼~¼ý¼8=Fä¼{šb½Wþ¼¡¨ñ¥Xbñ¥Xbñ¥Xb;½ë“=7ñ¥Xb½l"œº¶éï<¹<Í%…<µ1ð¼[У=Jì=ÕË›=Í=µÿÿ= ¢Í½Ÿa‚½•Ý:< “µ;#£<Ó¥N½iw½6%‹ñ¥Xbñ¥Xbñ¥Xb;ú$½CÄÞ¼ÇgÞ¼®Ç¼Bf9=l8=1²H¼Êå=Bs=_²<ÐZ'½ÅXç½Ûçú½pq4ñ¥Xb½žú½§ô¼"Št;GV=»G <};Mñ¥Xb»âŸñ=„ê<ÑEñ¥Xb=/ÆEñ¥Xb<´Éñ¥Xb=ÏémÖ=aû£=g¦=I†‚=€m ñ¥Xbñ¥Xb=†?ñ¥Xb=„úE<Œà1ñ¥Xb=.Ÿ»ïÈ=¾¸ó=ÅÛ€=43½),=­Qñ¥Xb<&绨w½¾%"¼Hlñ¥Xb=UúÑñ¥Xb=¬*=²X¶¼šieñ¥Xb½ D ñ¥Xb<_”M=l^/<$+Æ<‰ñ¥Xbñ¥Xb½“¹d=O¼¼=ð̼‘Á³½›Ä½€¿<ú%ý½b]=)–ø<£»Š»ï1Ë=BŒñ¥Xb¼ñ™½˜û=êž=+JÁ=Í!ż/ C=`i½6ýï=a;åN=”9‹ñ¥Xb=Ã(á=­_$=®ûÈ=v=Ÿûˆ¼:—ñ¥Xb=ê$=‘¥Õ<ŽnÙ=‡æO;ÙoZ½K5=Ú,Qñ¥Xb=´<¦L <ž"½fŽ<ò<Èör=PÚÍñ¥Xb=S 3=çÛ‚=&fFñ¥Xbñ¥Xbñ¥Xbñ¥Xb<¤æ=‘­>?=»+Ùñ¥XbºÔ½» ûì=*éN½.롼Á§P½†U<½ â5;ÈÔ„=1ÛŸ=¶,:= êÐ<[RU=Û¯­ñ¥Xbñ¥Xbñ¥Xb=Wð¨=®!Â=éx<®¬;À.‹¼Í¬: PÐ=_<Â|=DÆÛ=*¯Ù=>Ǽ¼2½VÚ¹ÕEÛ<Š%V»´,{½ë<ŒC#»¾Èã½43„»^ä½è ‘½ºJJ½‡«½™y!ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=`ë}=®˜·<ÿ@=Øì=¶©±=¢ê%=ç¬Z;¾v,=‹qE=(X=¤Eò<è^N;ñºù¿ñ¥Xb=š&¥=s‹=}[æ=N‡ó=D· ìñ¥Xb<Æu?½Añ¥Xbñ¥Xb» ̆ºæ):Úw&;ö,; lÒ;xȺß„»N¼ñ¥Xb;OÕZñ¥Xbº˜k9ñ¥Xbñ¥Xb»Œ‡$¼S;‘}ÿºü˜;ÁÈÕ:¶ºññ¥Xbñ¥Xbgñ¥Xb;/fç:%b·»ŠW_;¢¬:$6»H"»ñ_-»H§ñ¥Xb;9ßi;=©O¼/D;“†=;œ² ñ¥Xb»kš¦ñ¥Xb;sȹiY»¸7;Ï6„ñ¥XbºÄoŹF–»Éš@¹ó…›»VHƒ;­µ»—™‹»ú““;ÛaŽ9,R.¼%Kþñ¥Xb;, 6;ˆæ`:Ñ£†»dˆ{»ê‹¢;‘e¥;ËÚñ¥Xbº§a:º4X;\Mbñ¥Xb:¸óÞ:/Ÿ~ñ¥Xb;å ú¹ª; ñ¥Xbñ¥Xb»±Ä{»%Ѐ»Ô溸qk8ò©xºD@‚º o¹ôÐÂñ¥Xb:ÚN;™*ñ¥Xb» Ó:ºÄ.ñ:»>::Sþñ¥Xbñ¥Xb¼ âi;¹Ûd»Šø¼*ˆªº¯ê1¼#»Yi:ßà»:”À";ºUª;†ü»í³;±u <ÆT;‚½½»áœTñ¥Xb;‚‰»B G;ÿiº¶B»3È‹< Ì<(kñ¥Xb»Tœ[;ý#yñ:Îr&;,W:œ”½» 1f;`Êi»çQ¹œû;•Ìþ»û}ñ¥Xb¹—¨8®ÛÜñ¥Xbñ¥Xb» |#;©H 93‡è¹œ¦»š<ç;öT¤º‡Hϼ)ÉÃ;1T ;·‘;ª?‡º¯˺éï» ›µ;‚dP;‡Þ°ñ¥XbºŽ,þ»”z$»_ò¹Ê|»*Ç(»÷Z8»{YÉ»Æim<¯Z¼ÇTñ¥Xbñ¥Xb;ë9Èqɼ<,ºa¼Zð»¯$ä;ïŽ]¸°f·;”Ä©<dž:ù–ïñ¥Xb;°ºN¼ Â59³ñ¥Xb;*åà9þ »„Ñ;úºÉ2Zº€oÀ»r!„:Ž"¼%Çõ»² ©;!H:Ñ‹p¼ ™Zº”ßÑ»2,ë»ÉÆ:E º×¡ »ƒ‰»Üo:¬v¹”µ;‹¾3;¤5»¨>(;>‡!º-WË:¬Øм3`9‰x;’fñ¥Xbñ¥Xb»™›ö»Ȧ8h»»‰c˺r¾»æŠ7ñ¥Xbñ¥Xb;>ý»x9®»·þñ¥Xb»ì³ø»µü»¤÷—;°„.» ;Ù»¦f;‚ã™;™Pñ¥Xbñ¥XbºWåÕ¼ oмÍx¼<9ã»æL绦£­ñ¥Xb<í¹Âòmº–b”;E ;;Œhêñ¥Xbñ¥Xb»€ÝE;ý¼Ìñ¥Xbñ¥Xb»¹ºã»¼K»Egtº;“SºÒ`àºÐ«§:7“¹§yÌ;² cºù|a»nY:ÓÔ¹J»®¶ ¼&‹ïñ¥Xbñ¥Xbñ¥Xbº49ÏÒñ¥Xb»·x¾»Œ€»´ñ»ÆHu:ŽNϼÏn»·˜ˆ¹Àj;оþº¥ZÓ:pFð»:þñ;Ÿsº» At;¥:Ý»4,»ƒF¼ yéñ¥Xbñ¥Xbñ¥Xbº÷ís8oé;µÄN;I K»ŠÌºíd÷:Æû¢»å”»–7ñ»ËÄÊ<4¢¿<+ ¦º»¹¼iñ¥Xb;Dõ%¼$¼ç;ƒ÷=:»å;‡žñ¥Xb¸¼@9W : Y.ñ¥Xb;eñ¥Xb;ˆ¹ñ¥Xb;ñ4:Œ¬ºfUññ¥Xb¸º>ó»÷£ü¹²ö§ñ¥Xb»³5¾:BÓ…·ØŒ¸:˜‚Îñ¥XbºÙD»Ç á»£W¹Œ Ý;MÑIñ¥Xbº…¤ëñ¥Xb¼õ¸ñ¥Xbºž|¤»‚qKñ¥Xbñ¥Xb:¤ô׺ÜU:±I­;—ç;P(*:RKɺޖŸº§•»=x;L2;G¤¢»Š"û:TpU;¸¿x¼&—ô»²â»‚e;u,ñ¥Xbñ¥Xbñ¥Xbñ¥Xb9œ º•†»Í—>¼<þ›;¾<+ØŸ;¨ƒ:îÔṞ2¼  <_ˬ;¨‘Õ»—CQ»õîžñ¥Xbñ¥Xb»°ô´»6`ö:ðG3¼"0F:g/ »?X;¹å)s»<“…ñ¥Xbñ¥Xb;;Ghñ¥Xb;SL<”˜Rñ¥Xb;‚™W;(;TêY»(G;R§~¼÷=;’ñ¥XbºÑ+EºÂ!9@ëÓ»!‰Ùñ¥Xb;ªu^ñ¥Xb»ÑÖ»¹лnìñ¥Xb:ûñ¥Xb»3J»×/:ÿ¹£Ë€ñ¥Xbñ¥Xb;ÔD_;¦u¬< %º`†¯»;ÉUr:¹ðºé&Ö»èdœ:¨ËŽ:â̧»oÓ®ñ¥Xb:Ëع˜6:X ><8N< Qœ»•UBºíŠYñ¥Xb»‡z´<Õ»<2;¶ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:sqî»ÃÞ|¼^ù: ‡S;Á,4;\92"o;²9Z»„¼DX¿:Pñ¥Xbñ¥Xb;Yím:B“F» y‚;ˆ•{;˱M»*¡ñ¥Xb;^¹³ñ¥Xb;¾ÉVñ¥Xbñ¥Xb;¼3®ºúqV;L²·;[†÷:û=O;u1Kñ¥Xbñ¥Xb;¦ Äñ¥Xb»&Ïí;)o¼2ëYñ¥Xb¼#©b:\J;ÃÔºÕþº¤Iï;AÈ;ÔÙT8߸Pº&àu»=š;›½¦¼!‰;ý>D8Îä뼸¢;Ÿ”ý;@A;×ß;T'‘9/+i»#÷,º«ð-ñ¥Xb»îÕ»s}}ñ¥Xb»übÛñ¥Xb»0'ê¼9¡ú;).:ŸË¡;på»\¯+;$,ºËÅ´< »–uÕº¾Ü;oÞN<Ø£;r¼Q±Õ»O#»LN-ñ¥Xb;]w¥:¹º¼mÖ;}.;»‰ï:kT3; ©;’ôP»â‘t»”ªý;|ãû< A» bS¼(6£¼*¢º}à,ñ¥Xb;‘D!¼ 4»cä¸#iÃñ¥Xbñ¥Xb;,Da:—{»oª<¦o›:îÉ÷;l"-9ßGHº.tº²D< s9;|;qÀ›ñ¥Xbñ¥Xb<*ò»ÀÒ­ºÙÐ(;è´»7?”;IÔ´»Íu;¥@³;ÚýS<µ¯ºC/«:1ê4»#RÅ»ª¼ ‰ó¼'ÀC;©Iñ¥Xb;â7j:¨×»”ÖÒ;Å2I¼l“Ÿñ¥Xbñ¥Xbñ¥Xbñ¥Xb»œÔ'ñ¥Xb:B}(»Ämž;) ¹­ .ñ¥Xbñ¥Xb<÷P»€.ô98âÞñ¥Xb:‚êíºµš»‹²»>™ÿ¹á—y»¬ž”:é9¯;´>u<êõ:ôó;|O?;¦èÉ»+Û/;£4U»4'»Ër+»ž \¹ç4V;k Ù:ä)¼~ˆ/;@Ž<ñ¥Xb»BKMñ¥Xb»p§³ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;ȹñ¥Xbñ¥Xbñ¥Xb»ð«»µà»ó„;ˆ¼ agñ¥Xb¹²¯¼ðÁ»_êQñ¥Xb»lrK;äû‹»·ý­»åm·:¬#¿º§a‰;‡Ë¼»aòǺº%P: §i9ÌÃá9A¼Q»Û<xœº:¬:|Öñ¥Xb;„t¬¼:¤A;û_º""Wº0)t<ý ¼z}¶;‹ß~ñ¥Xb» Cñ¥Xb9ö…Ññ¥Xbñ¥Xbñ¥Xb;Ktj<ŒÂ<%1Ã;–Ÿñ¥Xbö»M$<ñ¥XbºJóÖ»‹¤âñ¥Xbñ¥Xb¹Ôu »‘eù»4gÓ;z–õºóI;9Ç: »º·;ÓÃñ¥Xbº€z»‰íñ¥XbºƒHÎ;lž;伨»W§ñ¥Xbñ¥Xb9M±Æ;Féú»Ð%¨»­E»WAÿ¼: (;è¿;Â.9Ö͆; 4º:å["¼aœ½ºsGî;ƒ/Š< ªc;ÿ;ÛSñ¥Xb;ïž<»Ò[ºTÊœ9‰Þq;¯äÁ;èî<'íÖñ¥Xb¼õ,ºEÌ89ï4¼ †ñ¥Xbñ¥Xb»š: 9×¢^¼#:»¡Ï^ñ¥Xbñ¥Xb;…¼bñ¥Xb; o»_˜¹¥ÂÐ;KŠØ;ÖÑ€» v§: ±sñ¥Xb»Â»±Oñ¥Xbñ¥Xb:û$c;¯Yº»¦?º¹-ñ¥Xb:7‰úº‡ùÚ:Yš»Ò.¹¾ͼBu9È>ß¼bo¬; ‰q:†}h;åÿè;þǺä^Æ;xJºKÓÆ6ß”ñ¥Xbñ¥Xb;Yüä¨À=¡ƒ=WôSñ¥Xbñ¥Xb½n=¼’‰¼»ëÂ<²H=ŸÅ=Üóå=bÎ=ZL_»#=o;çô,½)D+=ŠA¼Æí¼Îõ¯¼u+Z¼ˆÇ9ñ¥Xb»Öq=W> >E”=ÞÜñ¥Xbñ¥Xb¼Ý£óñ¥Xb=ÂËG=>==iÂ=…Ëñ¥Xb<›¨ïñ¥Xb=pŸñ»÷X<¹¢Åñ¥Xb¼–8¢½Ñ 0½½QO¼-ÎBñ¥Xbñ¥Xb½k¾i½‡‰½hu½¾“C½û7w<±t'À½@⮺‘Ä\¼Ã«çñ¥Xb=¶4½À½fâh½IÊÂñ¥Xb½¸Nñ¥Xb=ʇ¹< JGñ¥Xbñ¥Xb=³ž< ›ñ= •¶¼¨,¾»¢Zr½4h'=€g¶ñ¥Xb»æñ¥Xbx½?QF¿Áñ¥Xb=<Âwñ¥Xb½6Ëö<…f<Õ¾Ó=a=qñ¥Xb¼Wð=Ýoñ¥Xb<…Ètñ¥Xbñ¥Xb<¢ Û<î‘=Pðö¼(lTñ¥Xbñ¥Xb½?[`=S<îe<êºð=“›ì=:–G=Çê=±B¾¼§ ½£¹ ¼ó¾½eì`¾ zq½¡õƒ=¦æó<@ì=µëùñ¥Xb¼õ:Nñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÎGñ¥Xb>ºšñ¥Xb=Q-s=ˆªò¼”&ˆ<Ãm<Û]Æ=3¼R=˜ ¼¯ν9ýoñ¥Xb< J¼Dyý×Ó½6[eñ¥Xb<ªÈ„¼sw³ñ¥Xb½6¼â(Ò=“ç$=K—=¼¸ñ¥Xbñ¥Xb;7V‹»Öwƒ½ŠÑy½Rål<ÅÃϼÜÃà=c¹ˆº¾ïñ¥Xb9>Zž¼bsɽ…h¦ñ¥Xb<œZ‹=Q}ñ¥Xbñ¥Xb»PÐ(=,{Ð<«Ú"=O¢¼¾¥½ñ¥Xbñ¥Xb=å$=$­ì=x}=DvÐ;É#C=ryL=ݽŒ‚Ý=Ëu^=«n'=øÊñ¥Xb½¿Å׹˴G<ÊÝ=Çñ¥Xb<õÃN¼*Bñ<Ù¼öñ¥Xb<°?µ=)÷Ï=k_D=æ/ñ¥Xb=¢ô=AP€¼ˆ7´ñ¥Xb=}„=<tñ¥Xbñ¥Xb½R½Àœã¼xuo½„ƒ¼,UÇ<Ž/5ñ¥Xb¼¨ ½<ͽBø!<”Uf¼v§5¼³”ú=ÐI<†¯x¼íAU<ª„å½B™¡»ÔÊ1ñ¥Xb¼Œü6½¼rÒñ¥Xb½©i‰<¯Ó”ñ¥Xb=FóG¼ÍDz½Hü¶W>Mr=†YË=0 Ý<¯•‡= Z6ñ¥Xbñ¥Xb:Œ”½?¨ñ¥Xb<)Oý½#Ž ©=1¶ñ¥Xb<šç½<âó<ù,|<ÝÊš:Ç€ ;<º$ñ¥Xb<+~ò»ÁP4¹H׈½>¢ò½;ÿhñ¥Xbñ¥Xb½,ò¦ñ¥Xb<€{^=CRšñ¥Xbñ¥Xb½Öv½ÍF;¼†Ø=0. ¼»ÿĽ -ý¼åˆ¼˜ëÀñ¥Xbñ¥Xbñ¥Xb<áö.=J®Þ=Œ­z;º¼I;hëÍ=?#y=Ù„Ù=ø¾½±kÙ¼øôT½²K¼þ×y=|„¼jÅ}ñ¥Xb<7‰Nñ¥Xb=˜c;Š»¼ÃwV½ÈDÒ½ÀDƽÈþõ½´a¼¾ç>»·zN;Ä{r» 3={Ÿµ¼þ‚Fñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ñÞ;ªþ›¼Á$û¼Bñ¥Xb¼¥ù½ñ†ñ¥Xbñ¥Xb=Ï=d"H½)ø*¼µ/™ñ¥Xbñ¥Xb<犳=͉ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=6™È¼Åƒ3ñ¥Xb»0nCñ¥Xb=’šá=Ú©ä>*u+=œÿ“<ÞþÎ=’I> rr=‚$™=Éu@º¯9B»Y¤;]ªî:Nš®ºÍGø;rÂpñ¥Xb; n»ìĺ¥Œw;Œ€èñ¥Xbñ¥Xb9¶EÅñ¥Xb;zZB¹ë´K»ˆ‹<4'¾ñ¥Xb¼#Âøñ¥XbºžáÓ»û.; Ðñ¥Xb¼{»Èq»ÎRa¼#~[»âÊ‹»ì³^;U¿äñ¥Xbñ¥Xb¼ÔX¹T¡?¼Z&ºÖÉw»&¤ñ¥Xbñ¥Xbºª^Mº’…/ºÌïɹêÆH;-ñª»ü3ºšQ;Gôì»z9Œ£T¼Æ8»JSñ;¡=Ÿ9­Çn¹m;ðfš»ß‹Ô:¯GÉ»ƒ];v9ZºWdXºé»˜º¸- ñ¥Xb¸º¼Á»Ƭ¼Cé»G)[º‚g£»§|ñ¥Xbñ¥Xb»!⻚ó;Œ3«»¬Ó»I:$»™TX»î»Èñ¥Xbñ¥Xb»®ź¶Šx;ÓDñ¥Xbñ¥Xbñ¥Xbñ¥Xb;‘Âü;ªO»š*yºmÙO¼!¿ñ¥Xb¼_»í-[ñ¥Xb»´±_» ¼:ŒÏc<e»ÂCg:óàwbW»XĺáC ºÄE¸Aô&»ƒ×Ѻ§ ñ»4ãTº’Ð<ç8;.»]I±»nî?9T‰;E˜Ü;ºÙq8ÖQ|»u+:y 9…·»‰¤—:>¼n;¾8P<‚³»}€»´_%;Иñ;-á:è@p»:Kè;ŒMÖ»™¯â·ÍÊñ¥Xbñ¥Xb:²zA;q6âñ¥Xb;©ñ¥Xbñ¥Xb»¿:ó59ûÇ»?oñ¥Xb;‰ðh;ÄßÈñ¥Xb;©ºeã<6š ñ¥Xb;Èq·»kó ñ¥Xbº‚/2»˜’S»S–‘»pvqñ¥Xb»~ñÙ:Ø.:(º "ñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼$Má¼YU]¼ Çz<:Σ; #‹»SÅÎ<šÏñ¥Xb¼e>â< ÝÙ;†òÖ»°fr»‹áUñ¥Xbñ¥Xb<:&ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;[†š:CÔ:b ¡ñ¥Xb;Âr2;Þ~G»Àä@¼,˜ô<‘t}:ŠÛcºÛ <¹QýÆ;& Ýñ¥Xbñ¥Xbº v›;$·ÞHíñ¥Xb»p89¡n*»£mϺØ`»Ô!ºžÚë9k _»Ý!ñ¥Xb;É^ê¸Ø¬J;äõ¾;NGȺڗâ;9=»mËyñ¥Xb»­X;óÜlºÍ¨;KÎ 9²@ñ¥Xbñ¥Xb;$ç:ø8ñ¥Xb:P=;¿wp»(CÏ;PI¦: öñ¥Xb;úNñ¥Xb<wñ¥Xbñ¥Xb;æ›>»>x”»+ª%»‚Qñ¥Xb9—ż:´ðû; !­ñ¥Xb»P*Úñ¥Xb»riк“T¹$Ǽh iñ¥Xb»Ýv;Ü‘´ñ¥Xb;›DDñ¥Xbñ¥Xb»#¸¼*G=;÷º]C5ñ¥Xbñ¥Xbºçâ³»¦¤Ê»Eò5;¢Ãƒ»ÚÚ¹:Ÿ#…;2§f»ò›Ô»IÔ/¼ô»º&a±»¹‘Ê:Æ°!;ª‹Ù¼!¡Ùº•<Ð<ˆ=8ñ¥Xb;†6;ñ¥Xbñ¥Xbñ¥Xbñ¥Xb9%É8ñ¥Xb:R÷ñ¥Xb¼‰ñ<6PO;¨Î¥< —Â:‚ :Çq™< ]<¼ Oo;…R­ñ¥Xb»r»û:Ç·4<UÖ»_ñ¥Xb<CoºfÁñ¥Xb¼Áº»ÂE;j~å¼Ü 96{áñ¥Xbñ¥Xbº`ï90ú;@»ÐË´»Y /»¦rñ¥XbºÊÊM;-µ‹9²¢»¸K;R×½»xf»‚2Âñ¥Xb¼ â«;½•:ŽÅغ`Ö;×½ù:ÃÛ·;)6º—­ˆñ¥Xb:q~ºIš»Áñ¥XbºÓæ);†W»r§ñ¥Xb;b2»<<@);j£»Ê”ûÄ­ñ¥Xb»†ý³ñ¥Xb;cÈ};!Ž¿»º>¢» x—ºlŠK»µWܺNg;Uœñ¥Xbº€|!ñ¥Xb<Q‚;‹' ñ¥Xb»XFɼR4<â³»åǹ:Ãb^;*î;Ç~ºÂ’J;D!uº ÏZ:4Fz9Éò»—ÚOºàå½¼rÁ9Ö9¹§I»•ÕÕ»AÊi»ù2zñ¥Xb9†z˜;ž° :'ºñ¥Xb:ß.qñ¥Xbñ¥Xbñ¥Xb8— <;VÓS:¿S¶< ™];ÅÈvº)?i:ö[4< ŒN‚>;z÷Fñ¥Xb;B9ûpƒºûõ©;l}Ýñ¥Xbñ¥Xb»\¿¹ûó]ñ¥Xb;» û;U—$:ûÌ‚< K[;­1¼'9g: ã¼5‚ê»j; w:!'ñ¥Xbñ¥Xb»àú»aÇñ¥Xb<$QV»lyÈ:ÄÄ»÷\Õ;$s;¯\©»Ž&l:دG»®£¼;Àº±Ó)»Äçñ¥Xbñ¥Xbñ¥Xb;h@l;¥ŸJ»Û¿Ãñ¥Xbñ¥Xb:¼¸@»Ð©’ñ¥Xb;t(L;56œ¼6&¼;­6“;—;Ë‚ñ¥Xbñ¥XbºëÕv;ói=¼(Ú< ŽV;tše<&à<ž]¼"oñ¥Xbñ¥Xbñ¥Xbñ¥Xb<$*D:Áš@º¤1Ž<·Gñ¥Xb;ˆ»,<&>qñ¥Xbñ¥Xb<"XÀ¼;‚<ì=ºÿÙ¥;?É©ºh(Kñ¥Xb»m«:Ç¢<Sþ9ÍäM;‹< ;P™:sŠeóñ¥Xbñ¥Xbñ¥Xb;wM,ñ¥Xb;™LÒ<²·ºfï+< Ô»Ó»¹éñ¥Xb»uóñ¥Xbñ¥Xb9Ë,]:á>}<0  :Ý—¶9£Pi¼|ê;@ºüY“»‹ÿêñ¥Xbñ¥Xb»oÛºK¼Ê»¸j%:†l9[x\¼*!Ö»ÿ ;å]»£:9r ;½¥ºŠ?;纆…N;¾6ºA¼#ñ¥Xb»d Y»ß¯‡»—Ä$ºÌ‘ñ¥Xbñ¥Xb»NÖ‡ñ¥Xb;9'b:WËŸº+ëλ»}Àñ¥Xb;0Nñ¥Xb¼©,»¾LÚ<|ƒñ¥Xb»£}¢;U}¼¼YÑç¼\&Œ»7ÓD»à“ó»ïŸ½;ˆ‚»²Ò:=AG;ÈøEñ¥Xbñ¥Xb9–+°»Æ¶¦<<Íñ¥Xb;¾°ñ¥Xb9SYr;Wê< Ïáñ¥Xb¼ CλcªºÀÅ+<74:óI˜;¥(ë;ô¤^ñ¥Xb»(·;)[~;ô­µñ¥Xbñ¥Xb¼ ™¥»×ÿL:ˆ'» ”¦»©‘¢ñ¥Xbñ¥Xb»Nue»]Ã;:l+ˆ»ì,É»·é<ôú¼+ø:¨:öÇ‚¼áü¼B¶Ô»,1绫;; ·ù<1dÃ;—5&;4ìß;LZ¢ºJ9)';Œû;½ÎB¸ Ÿ©ñ¥Xb¼ <¢,»˜Ñ|».œÊ»ÜŸ¹Š  ñ¥Xbñ¥Xbºó¤¥;‹ì»¢\ž»Ð&˜; ]:³˜<2§tñ¥Xbñ¥Xb;êã;ÎGd»³hyñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼4Í#¼)|¼K[;Z¢ªºª¤Ÿñ¥Xb;2!»w¤¡ñ¥Xb:îå”»¢êÛºhr¹»”¢O;»þt»®u‚;œÞñ¥Xb¼6Yb»·2»ll»ìçñ¥Xb9rN¹ñ¥Xb<<ÍX<–rÿñ¥Xbñ¥Xb»Ô;¼}¼< g]9÷Bê;3Xfº¾ýGºìj}ñ¥Xb¼'¤ñ¥Xb»o° ñ¥Xbñ¥XbºóZºÄ2¼:껞;õº@—ã:æLñ¥Xb;Hv»Í:s»GéP»ÏÐý<$äJ:û59Ɔ7ä[»ª½8j6ä¼4ǃ»Z‘ˆ: w"»Ÿ¡{;+$i;5ÞD»ôéÆ»³ŠÖ»0üœñ¥Xb;ÁG¼1E<Ü;”‚žñ¥Xbñ¥Xb:ªÆÒ;¼S©;7ÖT»מ»$;’ŸXº:b¿; 0r;”Ñ›»·H]»VŸ‘» ¤Kºát>;³;Dh_<ý[;ÂL3º¨øVñ¥Xb¼7ñ¥Xbñ¥Xbñ¥Xbñ¥Xb<5Áñ¥Xb;×Cñ¥Xb¼b!U;-.‰ºN/’¼©T»Ò`Ù»g1¼`»°Õ•¼É#ñ¥Xb¼L2ç¼;ÁU9¬°x¼+ñ¥Xb»?é¼ Äñ¥XbºüqzºIUo»;;Œ°;~+]ñ¥Xbñ¥Xbº<Ñ»YÉ;  < ò/< » +ñ¥Xb»Ï¯%»Éί;€c¼;¿”½»Jƒë;>·:»QÖÜñ¥Xb;“+»#Ør;KƸ<€ä;*<;±ÀŒ»;–4»K§‹ñ¥Xb»WG:€bºç7`ñ¥Xb:>@Ê»õ©Æº<“˜ñ¥Xb»Œí™:ÚÁ:=wx:Û²Ú»ËÒº|Zñ¥Xb»` cñ¥Xb»r»:ó»’° »óCI»O]»…¤%¼;-»»„xþñ¥Xb<&-ñ¥Xb;£¡Å»‹±”ñ¥XbºCF9íÃr¼ÀS¼ f <Ç*:£á»’àO;zˆ”»»Z»;xW»ÂŒØ;Û¥§»GwŽ;ö»&ï±»„ó⻽¶É;W‰P;çÀÍú;vº]»¾Ço;i¢á:èâÊ;Ùó²;B2•ñ¥XbºDÎ~»•;“Dkñ¥Xb;Ï–©:ïŽVñ¥Xbñ¥Xb;ïÞº¢›*ºÃ”š0¢ñ¥Xb=íä >ßÚ=Qî=™l¸=òÍñ¥Xbñ¥Xbñ¥Xb½AFÈñ¥Xb;?¤½_@½K¦º=-ß ñ¥Xb=Vñ¥Xb½‚—½ñ¥Xb¼ªóñ¥Xb½Ç´ñ¥Xb;×ÝÈ»©Qñ¥Xb¼¡Ü=.<ôq½2ãμ¼2»ºÁÔƒ»ì(Hñ¥Xb»=¯Ìñ¥Xb½‡™\ñ¥Xb½va=îô<¦¤¼ƒiu¼z:ë¼M{b½Bu1½­‡<Íâ[>t°>È=n <áâ=@}*».p¼(­4<–$«<P¼Ãd»iõ¡½Ç„õ½»ª…=·=]_¼[¡•¼…‹~½`¥ =B¬;l¡¼®;ö½–™ÿ¾ Ž½÷½ˆqA½‹Ì°;½†—½Ãv=/„Á<¨!f½¥L¼ô1ò½dÇ=ñŒñ¥Xb=ÒôË= ò<Ó„W½¼?X=zþe;ð=ü¬ó;´)y=g?^;p—+<éΈ=tÕ-=„£I;œÀñ¥Xb=d÷ñ¥Xb»•Í.½Axs=&Sºž÷<¼˜€—ñ¥Xbñ¥Xb¼½ÏK5»úP=vo•¼€÷n¼Í×Ì=2ƒ0=™‘[=Œû‡=‡ ñ¥Xbñ¥Xb>ÐÃ>l´=âwû» Gæ<0Vñ¥Xbñ¥Xb<ò%Qñ¥Xbñ¥Xb9ñ½½&S¤;­sñ¥Xb<Ý™lñ¥Xbñ¥Xb=Î2<´"<D4ñ¥Xb;É·Î<âA5½dP½¤µâ<=ŒŸ<êŒÀ¼K†½ 缆Fi<']S¼ÛÑ®<]=ˆg=g£‹½Žªó½·ïĽí㻥Îñ¥Xb½1Á»}Ì=ŠºážN½ÓP½˜ñŠ=R•\=¹¾5=_þ¯=WM=äk%=Ø(L»*-—ºVˆ@=JØÿ¼æª<•”9½Cy#½Ûƒ¤¾ ûÔ½+< -¼½%ëÛ»´/•¼Yv=Ma½‡¨ç;ˆW¾*ž¾Y”½Î—¨½‡ʽeb½—»ã<ñ×=O™ä=>¨½Wî½ö~\¼¶cý=\p^ñ¥Xb=¤Ö=z8¼ÌD»“.%ñ¥Xb½*€‡»½ñ=ŽŸ’ñ¥Xbñ¥Xb¼¶56<Ð(Š;|Ýð=ÏÃÉ=Œ¤´=à!P<¿@&=¬´ñ¥Xb9¾yøñ¥Xb<¡ <íüZ=AºÊ<ÿ ¶=ÂÑ=K‡<ÙOø=>¡¶»•_=<â¶=9™½‘ù„¼üE%=°‹L=¿éê¼ÜLq=ŽH=‡Þâ»óIÚ<¹L ½º×ƒ=!“;Qš<¶œüñ¥Xb¼Â÷b<¾T=²t=‡—b¼¾ññ¥Xb½ h[ñ¥Xb:fÓu=­aâ=ŠÌ^=6Àh»Ú,Œ=Ó=Zùñ;ü*l» ±°ñ¥Xbñ¥Xb½A\nñ¥Xb½„Ih¼Æf=Ž\Ú<¯ÅŽ½ˆN¦¼M™Š=¡`½ºRGñ¥Xbñ¥Xb<Ër<=$Kñ¥Xb=ªG&½yJ`<}¤9ñ¥Xb<„Ü£=fíä=¡gß=pºø=»4è=ö–<‰jÛ<˜þ¬ñ¥Xb½$þ†¼4Ë˽U»½œ/C½œ­y½äÈ´½ý<¥•<]ë^†¼‡Ÿ3½8÷# E÷ñ¥Xb¼²°Q¼§›É=bLš¼`= ²ñ¥Xbñ¥Xb½hݪñ¥Xb=¬= &µ¼—Pñ¥Xb<»Æí="o¶=Ý=ˆœ=€•/½‚·³º¦Îz=΃~¼+2=Jß:²è‘½C︼œ¨¼“Ÿ’ñ¥Xb<ò‰Ïñ¥Xb=­Æ¿<%SØñ¥Xbñ¥Xb½LèXñ¥Xb¼‰+c<ϼӳ[< Ký=l9½–± ½ZÒ½ê½<"¼ñ¥Xb¼^3¼™ññ¥Xb<òJ·=H\=R˜g¼&¾V=„/ê='|{¶>\è=œqñ¥Xb> áÞñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»wÄÞ=è$==/=‡½µ=΃¦="rG=îEx<çœ[<òð¹=b#vîõA> [±=™`²<øvvñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Mi= @=é&ü=´Î—=´ŽÓñ¥Xbñ¥Xb=½Ùô=Ú†[=…\ƒñ¥Xb¼èZ½£F¢¼*d'<™sŽ½’™üñ¥Xb<<ð½  Œ¾ ²½ ñ¥Xb½Š´N½Ö&@»Øz=ÇùÏñ¥Xbñ¥Xb<¨{—ñ¥Xb=:“=‘î‰=ÀÁ¯:W*Y<>»ÊÖU»L¼m»Ü‰Yº(>;ÒÛÚ»‚½:5ôg»ÆwϺÂ`¬;×*ºÙêÊ»kÂÖ¸Çw»îC8;Wêñ¥Xb:¡¥!»™•f»òu¬;‚u@ñ¥Xbƒ¯ñ¥Xb;¯:iñ¥Xb;¡;)H÷º”æP9¤^º0‡ñ¥Xbñ¥Xb»•-º¡,b:Ù¹ý»šT:Ôϼ  » û»åL»É§L:9ÿwñ¥Xbñ¥Xb:£Ý2ºf7`&›:Wl’;ðÁÓñ¥Xbñ¥Xb»–'ñ¥Xbñ¥Xb»—U;Ûxó;¦Kñ¥Xb»š6ñ¥Xbñ¥Xb¹DÂò»‹½ ;*rpñ¥Xb:š>,:»:¸Œº J:A¸†;b;|¼™Õ;­t¾»¥z»JÜ;¿N±»ÿŒº–Ï¥:˜ÆJ:Zol¼ Ð×<;÷»¶||;ùa#ñ¥Xb<:y»Vû»ÒÒ9|wç;ÀYö9¾†ø: lg¹gö¾9’·l:L‘ãñ¥Xbñ¥Xbñ¥Xb:¿l³ñ¥Xbñ¥Xb:‚6»ÏYÁ9ä½#º§\Ú;Ùü»¬¼»uå;€tM; ¨ú;¸™;§/«; ½ñ¥Xb<9rÅñ¥XbºÌ)¹;¨Ó»Hë†;ÞIK:#Ù”;ýb;j,h:ßxm»G1ñ¥Xbºí;! î;¬ÂS»€ » ¾S¼ ±»õ¥t; ™[ñ¥Xbñ¥Xb»ìjñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:ÁZ;ÉÛ:¡—¹D»F±ñ¥Xb¼Cä‡:fpW;¶—¸®>$»$/;8é)Ë;Qè;û–¼vƒº„Ä<ºàð#»¾·¥¹B6;¸‡ø; ’¿:ÑÛ¼¶ê»žîñ¥Xbñ¥Xbº™*H;ó»€-Fñ¥Xbñ¥Xbñ¥Xb; ‘ýñ¥Xbñ¥Xbñ¥Xb8{…€ºä¹Ø;é×¢;… ìñ¥Xbñ¥Xb<µAŒñ¥Xb<"ŠD:Ö=:aìÝ»…øÞ»1 U»š€Rñ¥Xbñ¥Xb»< ¤9Ta»‰oº-ê³ñ¥XbGñ¥Xb»¾†ñ¥Xb» àâ:ÍÖ&»Eã;¢—/ñ¥Xbñ¥Xb»Ê为ú¶»qè;r -ñ¥Xb:ùF; Á<::œð¼K»»öŒ6ñ¥Xb»¡’;7!ù»ƒl‡ºôšŠ»%n¡<,zc»bf^<*~²<ò~;ç»Ü_Ã;5öÞ»áDÇñ¥Xb;‡Yl;­?Ϻ&^´;w9‡¡Õ;x«?ñ¥Xb;ŠÏ£º«D<YÉ<#û;0hÐ;œ1p;Ïئ;Õv»FÈ;願ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Ä|:ê*s»ôMÈ9é¶:ñàñ¥Xbñ¥Xb;4Ý:‹½#»ôrO¼ˆ4;ŸEñ¥Xb»®ó;»€‚»µèæñ¥Xb;Ž²¥ñ¥Xbñ¥Xb;Î6€<XŒ»(Uñ¥Xbñ¥Xb: ÞJñ¥Xb:~Èæ»/Ÿœ7ykc»Ñ2òñ¥Xbñ¥Xb»ei:ìA#;³„ñ¥Xb¼lmgñ¥XbºÆÜ»'ç ;Lâì:Iлʫvñ¥Xb»|d¹9µxºÐ¶ã;²TPñ¥Xb;÷L2ºJ«ïºçöI»}Ýøñ¥Xbñ¥Xb;(Žñ¥Xbº˜T¨;¹¢D;ÞŽ;†H¥»Ñõµ;Žà;(g`»†ý;™äã»åÁeº‘t¹•]!ºI v:'º•Ë<$÷ͼ>–»)º;[D»fxõñ¥Xb:ä `»ž—»¼ÚK»¶›ø;20t»("¼ø­¼&¬ö»æ ñ¥Xbñ¥Xbñ¥Xb;ÅÆ;̲:§V8»ÅF 8üW;©ý-»ª¦Ã;VD; Í;žAèº,À;nü=ñ¥Xb¼Š†êñ¥Xb¼dö0¼Bo:FêW»¾»—½&ñ¥Xbñ¥Xb»ÈR¢¼O^ݼCÃ*»ñÞU¼zÁÉ;›©…¼;_ÕÁ¹ u¼8ñ¥Xbñ¥Xb»¼Ñº\aò»HF;‹{g9áýñ¥Xbñ¥Xb:G"ñ¥Xbñ¥Xb:dóü»4•Ã:ìE¹ñ¥Xb;€¼9ñ¥Xbñ¥Xb¹»úÊ»@xl»z8 ñ¥Xb»Z6"¼/P¬<´";‹Hý<0vºÕ4P»š‚j<NÞ»ŽÅ乬Qºú‰é»›Îù;‰8ĺÞyÿ;€¿C9ÊxÒ<¶ù»“­ñ¥Xb»îÝ`º~òÝ;¹ZÍ»O›¼]—;I<  Z; r»XÎy;‚0]J±»¡»B¸µl¦;¡=ý;k»Ô—²;À·b<´4;†;²ÉI<—̼÷Áº·öfº¹x;01/:„`I»:˜lñ¥Xb;*ÿº¼D»5wÖ;„ñ¥Xb<>ËϼW¦:Y_ñ¥Xbñ¥Xb:Ø¡];þ.š;%<Ý»‡ò;º`Ü;Âßû;\ó_»\¤÷ñ¥Xb<²‚¸öHýñ¥Xbºµ;¶;DsL»ÈLÚñ¥Xb»³Šì;/F黧×Ƽ/³;²o¼_‹_ñ¥Xbñ¥Xbñ¥Xb¹_Ç®¼"z»Ûl¼0ö¼È¼Œ>ƒ»3»àBºœ Î:óTLñ¥Xb:*<‚;Îõ¨;ŸúÔ:¬É¨;r w¹w; ;.5;‚ŒÂº—™ñ¥Xb»¿Öƒ;Øèé»ü²[ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»¹dg;|›èñ¥Xb»œàB;z:¨im:Cž¸;‚sŽ;þ0‘;—e;-…Iñ¥Xbº˜r&;‰· »v;iÐ:\³Åºœ9ñ¼2;‹/º(mFñ¥Xbñ¥Xbñ¥Xb;€¤ñ¥Xbñ¥Xbº¥¹5»¢†{;ˆ-¼ `b<Oú;tö< g;¿½ë¼9à³»Ú÷ :q,»ÉÏå;«<‰$¼`†:ñˆ »^”»BŽÎ;(Y»êŃ»Ã0»`gÛ;‚ÏEº í»RTï;pP9™‰Z¹×e+ºÖžE»ÈW\»ðñ¥Xb:ؤÏñ¥Xb<#Çw¼'—»¶S¨ñ¥Xb»Gꛦ•:/•;ŠÃÔ<+_N;rù‘¼wBºé’<ƒY*»}å²;þžQ»}ð#»®"L< ¶Ð;B G:†[§¼ÿL»K¿ñ»ùCμ}A»b4¼ A–ºÀÉÌ:¤˜Ïñ¥Xb;k¬[¼+:ߌÀº¥¯ÊºÄñ¥Xb;Štñ¥Xbºô²&»’¢ö¼©i»#×J¹ù“K»•Ò໵l£ºqýÖ»žL¦9§–a:‡ý,:±½a¹ØF:}¹I¼œk»‹ù/;çè»Åãñ¥Xbñ¥Xb»7MBº`÷{ñ¥Xb»ý}äºé`c»&k!»|±ºùÛ;›Üg:áwuº‚œñ¥Xbñ¥Xb¼<—ñ¥XbºÚã»j.Ÿ:{†{¹œÞ³º,ç¹»;Ø<» v;௔ñ¥Xbñ¥Xb;ºÃO;%AÜñ¥Xb;—Rj»ÏN»Á[añ¥Xb;¯%É;Îæ3;’jñ¥Xb;Ùz:ÄÉn;O§;{„·»@bi;‚¸I¼é<&;š×ñ¥Xbñ¥Xb»9êš;HZž;Nô; VÆñ¥Xb»¬Kp»a˜j¹€sÇñ¥Xb¼˜Ý;LÚNñ¥Xb¼g„cñ¥Xbñ¥Xbñ¥Xb»Òª$< ð”¼$Õ;»—ñ¥Xbñ¥Xb»øCZ;ˆÏ€;À*“;O-ñ¥Xb;TÎOºÊád»‘…»ˆ¯_;VÝ#»£Ãnñ¥Xb;¯Þö»ˆDŒ»’f;!O¼A’:o‹¼P64Ðxº®<å:5;ù,Ÿ»u6÷»ã~§ñ¥Xb¼3¥.»)Fñ;¼IŽ»í3/<†%»éáñ¥Xb»#ú¯<"~»ÙÝ»±·w¼:¤:$ÍòºCœ»Ú>+¼›f9!¸ìñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:ѱ¼»SjW¼ö}<(8ž;mǘñ¥Xbñ¥Xb9×Y„¼+å9¦ÚJ¼ i·9Ï'Ýñ¥XbºdoI»•m2»@~ñ¥Xb;=½¬ñ¥Xbñ¥Xb»šHç:Áiºœñ¥Xbñ¥Xb»)-ñ¥Xb9¶Ï:³.‹9ý¯º*×@ñ¥Xbñ¥Xb»`²`¹ž½É¹Nvñ¥Xbºš[ñ¥Xb»cÛù»]Vù·=,»/š:¾'ˆñ¥Xb»)캿`Ÿ»ÁC.»Šrñ¥Xb·]ú"ºh;" W¼[°ñ¥Xbñ¥Xb¼5Šñ¥Xb;Ô3ºêèç¼r^‘º¢j`½wû½U•¶½®i,½E†ñ=Oò»=lÜŸñ¥Xb½t^1»ºúb<Ò’ñ¥Xb> µ =$Çè= ÷=8†_¼ Dñ¥Xb<ø€! Àö<莲¾¼ß)—<»ÀÜ=f˼aK<³Û–<Þz=¡ñ¥Xbñ¥Xb=­š^<ú©ú½ZéJ½&=3pg=íT?;”ù¼÷¥=_Ѽ®ƒH= B<=ÍG3=™ ñ¥Xb=Ê°=Ù‘¶ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ô,<ò1L=¬Žñ¥Xbñ¥Xbñ¥Xbñ¥Xb>™Ö=ˆ€z=Ð øñ¥Xb<Þ9<šei½lÜì¼È[»S÷~½œ·U¼ëäòº¼q–=,];Üñ¥Xb= }W¼Jg¥½{ݽ :ñ¥Xb½“-ǽ+;“¬2ñ¥Xbñ¥Xbñ¥Xb=]—(=9ò> Ä=÷ÿ<ëº=AÀÿ¼À|×=6¤7=*¦g½(ÂI½°jp=#ès¼ŽõV½fD¼º©~<îÙ < z“<Äì¹=¾=‚Ð=}n=¹‹< ¦@=@µ=DÅ=¹F5=.1/ñ¥Xb=®gU¼=f]¼­|c=•ˆ*=ƒ|z<±l½–túñ¥Xbñ¥Xbñ¥Xb=žš=“6’=oDž=˜tæ1Åê=N{¹=gæ¯=¶ ñ¥Xb=’¢=L\o½UZ¼FÄ= ö½@õ½Sº¼‚Aýñ¥Xb¼sµñ¥Xb=.ýP½@íÄ:OîÃñ¥Xbñ¥Xb¼—7½„ƒ<Ûµñ¥Xbñ¥Xb=åµ»ÀfZ½<<½E„½\§½`¸ñ¥Xb=éæ½*T5»<“@Äì=¡ð”=—S•>"1»\$›=+öÔ=š· =™ûˆ=Q¼]í»Âof<¼êk<Ãúñ¥Xb¼žK¦ñ¥Xb=eD= xæ¾Ôý<#Xñ¥Xbñ¥Xb½—É–<Øhñ¥Xbñ¥Xb< O¸ñ¥Xbñ¥Xb=?i‰=…Aý=Ae¼±¿M=êQ½ ÑÕ½sŽ7½Ò(¤ñ¥Xb½©r-<í®ñ¥Xb½¸öª½&‰È=ÒÈ =å‰=*£=Ôi(>"`¼g(=ˆ©4=ÊH£>r=Kÿ<ÑU<ÂA¼HœØ½bÉP¼ …½Œ. ½TÉñ¥Xb»µÎ*½*ãϼ‹& ¼Ö¹0½Œ&5=«|²=ÎdÝ>Eâû=Çðúñ¥Xb½­®i½K ×<«F=¸<½" "ñ¥Xb>)ˆºÔ™½ B‹º×›x»$=P \=¦P6;x³›=Ó©†ñ¥Xb=F/õñ¥Xb=‹8 =kƒ¼sR<ä”Öñ¥Xb=2€=2*l¼ñ5V½C1S½`;|½QŽ<-}¼™`'»›è¾¼o€<¡ñ¥Xbñ¥Xb>S-¼¨î*;‚kͼý(ùñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÕÆñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=´´û=?k¦>W =ðP‘ñ¥Xb<þ‘½!â<¼Û<¡^ž»ì ¼ä3Xñ¥Xb¼¯¥¼§ó¼<¬½ä*ñ¥Xbñ¥Xb=œ¾=ñ¥Xb¼¯rw½›©?ñ¥Xb½o=3§Cñ¥Xbñ¥Xb½ sØ<ßÖñ¥Xb;‡Xú=³ÄŽ;¨ k¼¥0=Ž®É<Šò3ñ¥Xbñ¥Xb½ XO½3Ëžº‚]H;ȶñ¥Xb¼}L=w‘Ú=ôÐz=—ÿ·ºÏz<ÿ8ò¼/—†¼Ù{ß=§á`=ž£v>´ù=5Þ~=iÝO½ϽŸ1v<­s<½jÙõ½Ïß½Szè¼ÌvŽ½@lbñ¥Xb½={€½@¼²’±=Y6=‚D“ñ¥Xbñ¥Xbñ¥Xb½ØaË»›¥=ëÚ6=¯¨¯=d'ñ¥Xb½ Sˆ¼ÑÎìÝFñ¥Xbñ¥Xb=dê™»ˆ½â<ÑÚ=š=0,2=Œã¼×àb<"öy½&}½fé=D¶¼©$j¼\4»kï<|:×»’Áz<ÀüÓñ¥Xb=&Š¶=¯›J=R:_<´2õñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Æg×=åt‡=îÞÄñ¥Xbñ¥XbP<-×ñ¥Xb=ùjñ¥Xbñ¥Xb=n¨«<…øó<¡g7<ð¦=Š ñ¥XbºÉúö=£$wñ¥Xbñ¥Xbñ¥Xb<ÒŽ­¼õÃc¼?‡¦=û'ñ¥Xb¾%¡½zi¼¤Y*½È^¼°Â½+8¼¸­$‡=”Ĥ=lÓ™=‘Éîñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb= u·<û¼¢=ÍM‚=›“Ý=×3³½–Úñ¥Xbñ¥Xb¼üg½§ õ¼¯º½»H*:ÉOÍ=°ž<þ|[½ ¼Ö=N?=b!ñ¥Xbñ¥Xb=[Õ=ü=-nd¶]=ÆÛ¼±È4:ˆ=nºè „s=ñ2_¼ õY½‹¥=mWŸ=’ä|ñ¥Xb=¹ü=P•;M©Ò¼a2ñ¥Xb<¿/øñ¥Xbñ¥Xb;Ó£<.a·<’ Z;CH>Ò=ûŽTñ¥Xb<ê«øñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¼¸ñ¥Xbñ¥Xb=ÀP^=Sºe<´þ¹ñ¥Xb¼©ô„½6O¼¥e†<ÄQ_=*ºM½<) úñ¥Xbñ¥Xb¼Ãzm»)E¦½q)z½5U½ƒñä½]þ½¤à*½yè> 5Y=ò+A<~sWƒª=µ]<Ó¤‰ñ¥Xb»ð>¿¼W¼ƒ¼V<ª†M=P`m< "\ »¨èî¼k¯N:K»Vǘ;’-¼IaŽ:·A"ñ¥Xb;(í¦;ÿ2;·Öñ¥Xb¼•ä; Ø«»·MÁ;õ®»Ü)Zñ¥Xb¼je¼ ߺ2=º£ö½º¿E»ÊBé»6׳»fi»‡ð}» €M»Å]‚¼,]7;Ó]Ờ»ºàµZ<9Ô‚¹°S{;WE.»Še¸;pr¼4v»À³¹Û¿&;Þ!K<[Æ;Ò•ñ¥Xbñ¥Xb;I>#:Ê¡™;›´Ž:”‰²:¸ƒX<ݸ<˜;¤ÓX:à»—;ºN;C±“;5â–;(Iöñ¥Xb;›Ý¼»ChSñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Ü´R¹$m)»õ)`ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»‚Lï»Y÷»Œ¨Lñ¥Xb:Åë²» -i»D‚£¹ÞÅ;°…R»ÍÓ$¹î·¼I¥v»¨Ô}::ÿõñ¥Xb;3­˜º±Ôº`*É;üCñ¥Xb;Ÿ=໇湞Ñ#ñ¥Xbñ¥Xbñ¥Xb»_):¢<ñ¥Xb;¸)—;·»|œú<€_d¹Çà¶;-h»}Œñ¥Xbñ¥Xb;SF´º'opñ¥Xbñ¥Xbñ¥Xb;¼¶0:Kó”;hŸ“»‡N;ZÊô<$ɾ<pŸñ¥Xb;´@O¼c“{¼yÙñ¥Xb:eZB;¹ßº;aP”;»-c¼VàÍ»².ñ¥Xb»¹Àç;‘÷»Æ—»Á`ºº ª!»˜£º :<‰»c;ß麼Uz£¼ (>ºô3Ë:ºœ »eå=»ð*µ:þ–¿¼*1‚»)1é»é£u»Fë7¼©ò:Ë Û»ýÙ;»Ë&‡;iû<ß?<éñ¥Xbñ¥Xbºíœ; ŽÂ;€ƒµ;¾¿ëñ¥Xbñ¥Xbñ¥Xbñ¥Xb9$²žñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»o7뻚€ »ªÇê¼f¯Òñ¥Xb<0f¹¶Î»ƒ¸¸:" »²´»Äñ¥Xb;;ź‘óÙ:ë²::› "ñ¥Xbñ¥Xb»6'íñ¥Xb:‰Ö;×uÃñ¥Xb»@ñu:4–ñ¥Xbñ¥Xb;= ¿:‰>Ôñ¥XbºÍ ì;j_Ô»Lï;#™Ú:$³#¼2gÌñ¥Xbñ¥Xb;,³Ó; /˜;¢¸ºhZ¨ñ¥Xb:éW8»mp;êž»^8;§Í»7è–;fŠº$x8Ýçå»ë&s;¾˜Þ:ÄGÕ¼=-c»£Q¼º%:4]Áº–Få»ÎöüXòºÓ»+:dœ~;Z¶w<d:áùŠñ¥Xb;g§]º¦°I»IJ;Ëñ¥Xb»ÈKÂ:£žñ¥Xbñ¥Xbº°ý`;BÁª;Ó»»Ûl¼gÿ» íÇ;Ÿöñ¥Xb<"¢¼j ñ¥Xb8ˆ¦€»ù3;,›~:…\Î;µÖŠñ¥Xb»¼ïÄ;4U<¾Êñ¥Xbñ¥XbºãÖº‹ »ÇÛ×;Rß络›Kñ¥Xb;ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Pïå¼ ™–ºÍy¨:Í×;Qö—<C;ñ¥Xb9k…;ã@e<»T;Œ:8ñ¥Xb¸kºBñ¥Xbñ¥Xb;–„t;´&Ù;Ëz%<•fz<5ª$»`®·ñ¥Xb¼ëñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»9˜/ñ¥Xbñ¥Xb» ç¼C˜Ü»Õ¥½ñ¥Xb»Ù¬î»Í=:ƃ%;¤šÚ:³â†: jλå;ºXð&»³÷뻹•ñ¥Xbñ¥Xb;dO_8ûÍ»›Æ+;"z"»€s›ñ¥Xb;ýbi;h÷:¬@ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;$;¶ªñ¥Xb»ÙºyC©º¤3»¯t;ýšõ:¯ë•ñ¥Xb< ¨5»]«Ü8¯ W;uÛñ¥Xb»#¿;_­J:#|jñ¥Xbñ¥Xbñ¥Xb;uöÓºMèñ¥Xb»Ý›»Uó›:]@ºÊÇgºmâ:³íV;añ¥Xbñ¥Xb»µ‚¸÷†ñ¥Xbñ¥Xbñ¥Xb¹ƒà$¹o©3ºõ^Á:cºãs×¼L)Ì;%àñ¥Xbº-[ηáG<äñ¥Xb;ËŠ;Óñ缚¡;Ðëy;Óç»ñØñ¥Xb;rl²:’̉<ŠÐ;Ärû;]ŠÁ¼;¡»túÚ<»ºÈŽ»ú¼<¼EŽU;xI‡:/Wj:ÕrÁ;ÇùbºKÛ•»…F;pm7;Èý»ç>¼5í¼—­:-§: -Åîü9mÌÃ:I\Žº!Æ÷;ÂØ»?ñ¥Xb»üa¡;NˆÙ»Ü69;˜Ú:ñ¥Xbñ¥Xb;©%»€©¶»WR» M‡ñ¥Xb;Qê‘;@ºG§<Ùò< 4a;˜ Ÿ¹ÜÕ9.æ»ÒRœ;Îð$;fc;üë;‘Rw<:pê;€’c»œ‰¿»é]%»Y¡2<Ép;a¹‹¼MAÖñ¥Xb¼;hP:¿•;âüV:¤dr¼¸#ñ¥Xbñ¥Xbñ¥Xbº²`L;gËؼ) @¼/--»•”añ¥Xb»FvA;gv»Ý«ò<ˆ)»|¸‹ñ¥Xbñ¥Xbñ¥Xb» "›ñ¥Xbñ¥Xb:œb ¼ ³•º­Ãp;6†;/ý:—ôDAñ¥Xbº•_†:êFñ¥Xbñ¥Xbñ¥Xb»]Ç;\%G;ã/Ë»v¼&ñ¥Xbºaµ»Õ‡Ë»tò›;1Çh;<žãºO@…»8”׺éZ»®Ôáºý¡j»Ð-¼dè;©,ñ¥Xb»AC¶ñ¥Xbñ¥Xbñ¥Xb<:Œ~»ý+O;}»†‰ñ¥Xb;]&;å@ñ¥Xb:Y©Yñ¥Xbñ¥Xb;"ø´¼j;Ojå;f8;Þß©ñ¥Xbñ¥XbºMµ±;Ç¥ûñ¥Xb;„Ú1;†;"ëÑ:ãm< 00¼Ys<'ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºÕj;˜ÞŒñ¥Xb:¥;¼g¶:ÀvX»@+¢ñ¥Xb;Á”Ö;{4;š Ê;âì¼ t»’qDñ¥Xb»–䟻½€€<Ìô»Ç®»Äå‰:¸ÍÁ¼|»<ˆ›<_[Íñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;ð³»™g¤;×;¦¬O»2¼!CÎñ¥Xbñ¥Xbºìl69ûP`:Û”ë;¦r=»ëb„:×y;}oå»èºÏù鹞þLñ¥Xbñ¥Xb:Ü|é8ò;NU8ú$3»êyÝ;¹»3c~»q×ñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼?À»õQ\<(¡ôºÀ½5»fŠã»5nº:¾àû»/#t»^“;’*-:¤{ß»÷~añ¥Xb¹÷€¸Ê\ó;ÑÄA»˜-ñ¥Xb:Å&»»'Ññ¥Xbñ¥Xb»¬+“A<û;]øb<Ää¼ èñ¥Xb»ÓØ9\Œñ¥Xb;¾ __ñ¥Xb»”^†ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼¬=;ä¼ »Ê®Ä;¿‘;£6u9j­µñ¥Xb¼ EN»˜ ’9}g¼ìÌñ¥Xb9ýSLñ¥Xbñ¥Xb; ãÏ»ò :ønT¼&lQ:³öлt Ðñ¥Xb<)ßUñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:<*ñ¥Xbñ¥Xb:ŠZ:I‘¼§¶ñ¥Xb;Xç ¼6:;N¯­:ÉÞa;ƒVûºáíÐ;­¹j:_Æкڪ”;RŠœñ¥Xbñ¥Xb;›÷r:(¥=;]-h»ßµ»gôñ¥Xb»¢8; k:™Çñ¥Xbñ¥Xbñ¥Xbñ¥Xb;5»¯8ûñ¥Xb9Ãú‘»Tÿ¶»Ui…9™ø»`\ç;±Ä³:œ©¯ºõ‰]ñ¥Xbº½›§;Ï&:æïÌ;·J_;Ú])»­X;Šû<#ð¶;ÜÑhñ¥Xb¼Vë;å/ñ¥Xbñ¥Xb;{Wvºå‘ »˜˜b<ì<H½»Úòå;ŠeMº}gòºóCº5²»1qp;¤ ‡;¸»Ï;Ý^Àº€°£:Ê®ö;ŒäI:˜E×;.Å»Ü9ñ¥Xb;£4 ;šœ´;Š<7ñ¥Xb»³.qñ¥Xbñ¥Xb;„{¦ñ¥Xb¹Cs\ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;qFñ¥Xbñ¥Xb;Í,L»’;»&Uñ¥Xb;¸ŒW»SáÀ;oíM»i¯;©>ºƒnÉñ¥XbºûÖ8;ü†K¼!ÜE»¨õHºI;w¹Žü;2Z„<…hh=G×຅Ì<ëv½ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½ ‡>½V»”ÐŽ=RäÍ>óÔ=Rv<ÿ­Ô=ƒA„=»˜’ñ¥Xb½!ï’<",gñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼çƒd=ÉàŸ„o=ÿA[ñ¥Xb=Çõ;<¸o ='Í,½G½ŠC®ñ¥Xb=“N=Ñœ=ç=]Dô¸> ûwñ¥Xb=9Ž=¦¢<¥L¼¯Ãž½Kta=œ¢=jFTñ¥Xbñ¥Xb:Øð<<È=<ðu~¼¼1<¢èE<õ¬k=Êd=!<›¶ñ¼ú!=¯G<ãÔ~ñ¥Xb;é©ñ¥Xbñ¥Xbñ¥Xbñ¥Xb<¸n§ñ¥Xbñ¥Xb»µ°°¼Òn¼ =ñ¥Xb='Ê=…â’¼€³W½7EÚ=¹Ð™>P¶> ¼&x»c=<­1¢=ºë¥½Rñ¥Xb<í^= {¢ñ¥Xb=‚u2=±Í<êŽô¼‰=À¼—sªò:=í‰c=Ž@^=Àç£=¥ U=Ùp=\?=•B{¼=Ÿ–Éñ¥Xb=‹j›=¥g]=n8=æY|= ¨y:‰âe¼ƒ¿Ý=@Ór¼¡HÖ<\Ãgñ¥Xb=w=;·Ø> Þ¼øŒÂ=)gP=¬6(¼N J= ȼóúv<´“f=r‚¼=Tôâñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¾ x=ýHñ¥Xbñ¥Xbñ¥Xbg> ¨<ÉË.<ÔÂß=ÉçJñ¥Xb=Ø‚­=4ײ=5ƒº«[= bñ¥Xbñ¥Xb)R;¡ŠÜ=Zk’=Ðp#ñ¥Xb=Z¬7=€¥T='F=ÑØ­>"ÝŽ> Ÿ=š<&<Þá=îL©=€~=;}–=+ê=8'Æñ¥Xb¼¼þ=>¡=ì=‡²m=©ÀÒ<˜ =3Ÿ—=ŸãCñ¥Xb=?¢pñ¥Xb=‰Xœ<¼œµ=~Wñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<…ÿä=õ&¼a5Eñ¥Xbñ¥Xbñ¥Xb=Oå<}¼×±¼Ì;ôä齈ìöñ¥Xb¼ƒ¬ñ=Žâœ<Çò<¶9Z<¹w=Ð<¸=ém]ñ¥Xb=¤iñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¢àèñ¥Xb>¡/=`Å=Å+=Áƒ;ÔÂZñ¥Xb¼·õš;ëdó=.F»&’ñ¥Xbñ¥Xb:Ñ ¬½´D­ñ¥Xb="=³Fu<„d=C~;N í<*i=Š^-=/£¥ñ¥Xb½èàñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼’bË=›Ùš=/‡= äºñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=½ €<@jw=wB+=Jë=áù=¤Ôúñ¥Xb=ýÙ =%»=©‡d>DoÒ>ã=ı=i”O=‘0=×(Å=kê<ú7Ú½ ÏÊñ¥Xb=>{5=è †>¾U>Õ1<Êi=›Rê=':_,Jñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¹Ýñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½Ã{=XÝ{ñ¥Xb=Õß=>añ¥Xbñ¥Xb» `ñ¥Xb¼e‰¥»1\Ö9…J·ñ¥Xbñ¥Xb¼¯Íß=K³b=Ç!»ƒ„=€¸h>m=m<*;‚0Ûñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¾ŒÈñ¥Xb=Zòƒ=—=Pñ¥Xb=‰sƽª!N=Ž_7=tÜañ¥Xb> $Ëñ¥Xb<<Æ@ñ¥Xb<Å-î=£€g=t ñ¥Xb=‡Èñ¥Xb=gÎ=v=žrÁñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=‡¸Ëñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ËÜ‚=Sè*>é8ñ¥Xb=YŽ¤>Í=-Ø=tU>?=š[~=0Ï•<ýgÜ==A”=ƒ:Œ=‘Æ»¹Pö½#HB¼¦ô =´¤=±·ž>h²=ßJ=¬ÙÌñ¥Xbñ¥Xb=yì<”‘Ûñ¥Xbñ¥Xbñ¥Xb=ÄÅï=òÝ.ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=LöÔ=‡,=+åý½ >pñ¥Xb=¨*ñ¥Xb=WŒf<üëfñ¥Xb½IÔk= ²<íÉý;5ñ¥Xb=‡ñ=}UË=˜f ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=–ËDñ¥Xb>C˜¼•Që;’;U;½ñ¥Xbñ¥Xb=[ £=QSW=2uI½"J†»u*ÿ=CB2=ìWJñ¥Xb<Ìóñ¥Xb½a¡Kñ¥Xb=0¨_ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=àÌ=zñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¾¥¯ñ¥Xbñ¥Xb;oXó<†^ìñ¥Xb=ÿè>'M=ªS=^µ <‚¤d>8>ZÁ=Køm<˽Šdè=™}<³'Ö=Vµ=e4K=xß4ñ¥Xbñ¥Xb>¶¤=‡»¹=²ñ¥Xb>/H^=À%d=¶AKñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<ñÈcñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<è@ñ¥Xb= ¨U¼ãôü½™T=RÿŸñ¥Xbñ¥Xb< ÿñ¥Xbñ¥Xb½k_,ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¬¹H=cŧñ¥Xbñ¥Xb¼æ3 ñ¥Xbñ¥Xbñ¥Xb<`ÉW< ¼ëS^½.bÊ;8p*=â Íñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=-3ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=×ú!ñ¥Xbñ¥Xb<ê±%ñ¥Xbñ¥Xb=ÜÞ=„ñañ¥Xbñ¥Xb;‘8‰:Và;–”¬»“3 :&%K<Ål»t7ªñ¥Xbñ¥Xbñ¥Xb;"'ùºÛôhñ¥Xb;¤P…9ÆÖš:O®˜;Ä{p<D»'wÿ;akû4=²:Åÿ»’bÒ¼)ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Q¨Ð;Êâ{;Øx\»”ãüº^XV»ªö»L†;ÚžÎ;r_Gñ¥Xb»û><%üñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»„N€»¢ò»Ë„ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Ãš±:‡Â&ñ¥Xbñ¥Xb»†‰9Õ… ñ¥Xb¹’U›;”V­»LC;—í»°Yï»c:}ñ¥Xb»ÎYÙ»5b7»Ä0:ÍA;nyºÐA”;™+÷ñ¥Xb¸£{ùñ¥Xb¼ }]ñ¥Xb»t«’ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;ð¶ñ¥Xb;fäfº¾N3v»s¯o:ÔTÔ»l.$;‰Äp»7<>ñ¥Xbñ¥Xb¼0€3¸¤ŸÍ»«[¸![<íè»cþ¹–K,;!ºÛD»>š;-Âu»Š5; fñ¥Xb;® ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;.[ñ¥Xbñ¥Xb;Ü‚…ºCžN»T–ñ¥Xb;'M»)éz;›O.:‰âÝ:v"×;ɹÏ<9jñ;kx;è®:mÝv<:+¿<oŠñ¥Xb»ˆºíÜñ¥XbY;¿‡*96ÐÊñ¥Xb»†ëA<'&zñ¥Xb»¶ûÿºíªÛ;wz™ñ¥Xb:Àž;¬âM»ÑT•;[ ý¹Q;x”:Af<:s·¶S†ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:×Àhºx·;ïû’ñ¥Xbºk»-5&»žʺ·£w9éç^ñ¥Xb»='*»›äöñ¥Xb;[Ë»²¹Šyß9Žÿ»jÓñ¥Xbñ¥Xb»rk»œ(¶»ÊGÝ;ñdì»»Yn;hª¹|“é»åƒá»¯€©;x\Œñ¥Xb»ñ¥Xbñ¥Xbñ¥Xbñ¥Xb¹Ã®Ð;¨Šwº cZ<âÒñ¥Xbñ¥Xbñ¥Xb<VF<q<+§ñ¥Xbñ¥Xb<À•»ÛI»Ž¹Û;‡MZ»ìwv<&73ñ¥XbòŸ»¥Û°ñ¥Xb;ãxË;!i»ªÅ3»ZÍ仳»“ ¦;—ûW;êþhñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Ÿ.dñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbºì–9;£ÃÝñ¥Xb;ž*­» šñ¥Xbñ¥Xb;Û„ñ¥Xb;ŽnLºöÁaºüÏ›ñ¥Xbñ¥Xb<$ºò[ 9üÑ´;¼Ëc;´d&º­z¼òÏ<Ÿ7»Bý0ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Øe ñ¥Xb»œ63¼Püpñ¥Xb¼<eºÒ]ê<±.;¨Âñ¥Xb:‘îøñ¥Xb»s‹Ãñ¥Xb»#Æéº'Ž¼t…ñ¥Xb:ÆOñ¥Xb;j%É;ðM»÷q£ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ÕMfñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;ìi;¡ë.;6öHñ¥Xb9°vѸt> ¼?™<:Y´;ÙÇ;Jø\¼¥»¦øg;ј†ºÃÖG< 4;§Ù³¹¾Ê3»^;T×”»›¥;±J»ì[`;]q›ñ¥Xbñ¥Xb<±<£íñ¥Xbñ¥Xbñ¥Xb»¯€"»Ðv/ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¾s,<8¶5º†>B»ªÿàñ¥Xb¹VŸÐñ¥Xb»H›P< ŠUñ¥Xb;œ!-º¦èc¹T11;žF©ñ¥Xb;3»L;ž ù9íƒdñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:…æ ñ¥XbºçÞA:.Ò†:©Ð?<X£ñ¥Xbñ¥Xb»L9#zz;1óU;‘Ùù;)ºå)»òñ¥Xb»¡@Zñ¥XbºŠÁñ¥Xb»¶1…ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºyéR»’kÐñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¡qñ¥Xbñ¥Xbo0»õñ¢ñ¥Xbñ¥Xb¹ÜÖñ¥Xbñ¥Xb:±%vñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;gt»¾ckñ¥Xbñ¥Xb< Óñ¥Xbñ¥Xbñ¥Xb»qƒÍ¹Cûô;Ÿ’»Þ¨9P–u9ÕÇñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¸—+ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;6l]ñ¥Xbñ¥Xb<‹òVñ¥Xbñ¥Xb;Úúï;¥ñ¥Xbñ¥Xb;—æ‚;³q;®¶r;@p :éI»«¤×;¦ÉCñ¥Xbñ¥Xbñ¥Xb»¢âÃ:¡l"ñ¥Xb¼2;‘d¼ 0<"s;•dË;8ëî;D¾h;+D;XÑz;Òo×»tBñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<-‚G»N:sër·rè¼F¼5׺ÑQ;hŠ º´›Áñ¥Xb»b/Î;:ª ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»BJ˺9ÎÁ»/qAñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;ïøO:ÒÖtñ¥Xbñ¥Xb¼Çû:;›ñ¥Xb»ð˜õ:¿Üp;!š:è7Å:¶6P»–ˆñ¥Xb»¸šª»€¸»¢Ï2;o¹»;¨1»zu·;ØŽ;¡u¨ñ¥Xb;•h“ñ¥Xb;EE’ñ¥Xb;VÛ>ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»™(Yñ¥Xb»ãðÏP…ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ÜŽ¹ªµ3»×v»c8´»ö¬½»¨8»À¼‡Âæ»E›¼ Öš<Q©»8Ëñ¥Xbºˆi2ñ¥Xb;/;G³¹æ2~¼J^»fß×»“¬[¹Kœ¡»¬Ô<Q?< =W;¦[°ºªÁ¡ñ¥Xb;]µAñ¥Xbñ¥Xbñ¥Xbñ¥Xb:ׯ»§z$ñ¥Xb:/Ó<¢¬;&º£¼$¯Îºÿo‡»óá”;¶™°»À;Ó„Ö9‚áàºí£;Ç•º¼6¸;²»B°‹»Ï›¹%»ÈÛ€»â&;úظñ¥Xbº­X8:¬b6¼¬§…»Ññœ;´ˆ;wõë;ÒD‘;¿·Œ»jí£:õ"ñ¥Xb¼O¶;ÇBº·5i»† ]»5Õ¾;»ms»l_h9ü€‡ºµºrlB;†çë:åhñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºÕö;[¼ˆñ¥Xbñ¥Xbñ¥Xb»ðÎûmäK»Äß9 /•ñ¥Xb¼ Ñb¼ȉ<ÞY;,e»4P; ûªñ¥Xb»}»MxA<;ˆ¨;“Ÿ°º+Ñò;aoÍ<$º”;r”®»ä²9»Bú¼/ÿ×;¨TPñ¥Xb»&D:»ºR;é³y»½i;£;⼬B;¤¼ óìñ¥Xbñ¥Xbñ¥Xbñ¥Xb»±`ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:ƒa »Øbñ¥Xb»Œ¦à»tœÙñ¥Xbñ¥XbºB.kñ¥Xb<¶Þ;€¿þ»Å‡ ñ¥Xbñ¥Xb»…«¼9®»›ç»€h•»#ý»€Ø»žYà»™oŒ»Ìžqñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»—Vpñ¥Xb9²q¹»Ö½ñ¥Xb¼_˜‡8ø;@‹‚¹£ÖGñ¥Xbº»š\ñ¥Xb»À†îñ¥XbºOu};Š ;p‘Áñ¥Xbº>ÿñ¥Xb»7k:Dõw»,Tññ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»F)Àñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<.&1<óV;†dúñ¥XbºÍç.»ò4»kš7V÷è:Fî=»Ð©;=ës<‡1ǼÜE;J5N;ˆS¼<©Ê¼2žÆ»¾„¸»È“ºt£ü»uS2;†~®;¤ßYñ¥Xbñ¥Xb»{BÊ9žCzñ¥Xbñ¥Xbñ¥Xb¸ÁhÐ;ïUñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:þC̻ԩ;¾Z³;Œñ¥Xb;®œ©ñ¥Xb:‡ò»±à=ñ¥Xbºu&ºš];ÂR¹ڭ ñ¥Xb»e2®»°ÓÄ»ªöñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Õ'ñ¥Xb;…ã¼½î»_ºLø³ñ¥Xbñ¥Xb;Öc:ë¥: ˜‡º\ãëºø)b»¯Í”ºÚͳñ¥Xb;Žñ¥Xbµ‹Ôßñ¥Xb9íT¨ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ûB¹Öí^ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¿pñ¥Xbñ¥Xb»Ç‚»¦ÀÒñ¥Xb<+]ôºGá;•œî;{ô»².h»ª¸»¼Sù»²Ï4:òBö;¼þ»£ýs;’®'»¨ëÙºæqý;gæåñ¥Xbñ¥Xb¼âu;Î÷A;¡\õñ¥Xb»št´»‹6˜9ç èñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»†Ý6ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ïÇñ¥Xb»$V|;€’y»y‚ »®nñ¥Xbñ¥Xb»Gvñ¥Xbñ¥Xb¼5Ï}ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºDÖõ»*ñ¥Xbñ¥XbºNäeñ¥Xbñ¥Xbñ¥Xb:jT;{Ô»SäÒ»­”;«X;Îññ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;—ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»fгñ¥Xbñ¥Xb;ùRlñ¥Xbñ¥Xb;†°&;5R=¸Hñ=ÌÄ•<¼¦ã=%ÿE=ï’3>0)o<Òó=$Õ<>ü°>_D=õQ?;£¡9ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ímt=¥üK<ŠÑ <”ññ¥Xbñ¥Xbñ¥Xb=€Ô(ñ¥Xbñ¥Xbñ¥Xb=Û ©ñ¥Xb½q=;}ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½4š‘ñ¥Xbñ¥Xbñ¥Xb<—³ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=›r­ñ¥Xbñ¥Xb=G^;ÙáÒñ¥Xb=ÝÉÞ=ÍËï=ë(0=ÞC<=ì=ï»i=ö;ÞYü¼I¬Þ=O¼9=]Iå<µ”ð<°Þ¸ñ¥Xbñ¥Xb=áHÑ<ù„`>;‡=·Fò¼g m=C>9î>sl<‡""=Êgxñ¥Xbñ¥Xb>`Ò=¤)¾=ØÖ=“<ñ¥Xb= [ñ¥Xbñ¥Xbñ¥Xbñ¥Xb<;|§ñ¥Xb=¾ç²ñ¥Xb¼Ï£õ=?Ññ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ˆnñ¥Xb<‡¬<¦A‰ñ¥Xbñ¥Xb>åP=­/Óñ¥Xb=éû¸= xž>Ó±½GK½¥¶…<¥Gà<®M»„6¼3â¼=P,ßñ¥Xb=¨:÷ñ¥Xb> ôl>(Ø=s­þ=‘6[>]š=éêÈñ¥Xb=6çIñ¥Xbñ¥Xb>d›ç>!»¢=¾^€<·ã=ö¢ú>Ñø>Ð2>>> ~=h=ló> ø=ìñ¥Xbñ¥Xb>?šñ¥Xbñ¥Xb>9>=ð©Wñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ºnH»õKݽKžñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=S~­;Ïßõñ¥Xbñ¥Xb=²T=’;=Þ!F=ö*­>Zj=ÆŒ0=ÅZ˜=¾Yo>„=¿)Óñ¥Xbñ¥Xb> ñ&ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=øX¯=ò1ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÝxÑ>¨ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¾xßñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>Q'Òñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb€; q;yÛè;#øsº±Èn;zÖR;qØɼ$Auñ¥Xbñ¥Xb;÷×&ñ¥Xbñ¥Xb»­©;º’g’ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;•ùÿ»4ë:I`Dñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<)Ý ;Øý5ñ¥Xbñ¥Xb;vN‰9öÂ;!Ig»Ù»Éu—¹Çfv;š˜·¹6¥r¼"­?¾ñ¥Xbñ¥Xb;0´ðñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Ä$ ¹ŠB¼¹œGºëñͺ†2‹¼CB:§(¾:-Ý”»ÃÜß;øÈ»í›Öº@–Ñêñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>8&…ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ºŠvñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ìvñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=óá>ª=³;Bñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ç¦F=e×/ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½9õ¼Ÿ½¸½´ïñ¥Xb½’!6¾+Ùñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;0O¼2Šñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>°Ë=Ž7y=I¥ø=”¾>+Þ]ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=­²ó=‘=h<¬Zñ¥Xbñ¥Xbñ¥Xbñ¥Xb=–¾I<´˜ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=›åÙñ¥Xbñ¥Xbñ¥Xb½Äf½ßh³|¾=œV1ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ș=Ê· ¼æiÙFlÅñ¥Xbñ¥Xbñ¥Xb=Þ…=e&>æ;=÷R½,…»ªøR=~1;ñ¥Xb<ÈzN=Y‚=;¨µ“ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<.B~ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Ä'ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;©íúñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Ÿêœñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb< ·ÝºÑ'º°D(ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;÷Ì¡;Ø´’ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<9üŸ<…b:äšÍñ¥XbºÚˆ;Ññ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¥Ç®;ñA‹ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»À(ñ»i‹<›ýñ¥Xb8̲7¸úÈBñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;%É­»CË#ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<(<»X-Z;•9;’ëj:Ü–ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbºâ=~;bŠ·;Ó]Zñ¥Xbñ¥Xbñ¥Xbñ¥Xbº«eÉ;©‘æñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼%Wñ¥Xbñ¥Xbñ¥Xb»iº» ¾‰»ÍƒÀ;•þKºGŒ%ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;æ];µuÛ<e×»' fº‚ ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Š×¼»#?ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:ëÜ“;˜‘RºOçñº)¦œñ¥Xbº¶å»‹ôFñ¥Xbñ¥Xbñ¥Xbñ¥Xb:ÖA;ø爺òò©;CãQ:ôcˆñ¥Xbñ¥Xbñ¥Xbº^?ºœP-ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼OÕ‚ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºOgŠ» Mñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;þñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:Ù¼7­»¿úÂñ¥Xbñ¥Xbº÷Š2ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:ñ1Ò;ëž8õ† ñ¥Xb»}ç¹;9(ñ¥Xbñ¥Xbñ¥Xb»Ô[»ân;ot2<í¼!Ë_:àÝŽ:Þ_ñ¥Xb¼ªã¼ ʇ;jýiñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>µ°=Ž÷¯ñ¥Xbñ¥Xbñ¥Xb½L›<é­¼àøñ¥Xbñ¥Xb=“u}ñ¥Xbñ¥Xbñ¥Xbñ¥Xb½G$¾Ûl¾+ Áñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>//õñ¥Xbñ¥Xb=г=âÚ{=‘Vw>ò…ñ¥Xb»/75<÷lÉñ¥Xb=i <ˬ<»~ðñ¥Xbñ¥Xbñ¥Xb={Y¼ñ¥Xb½°·Q¼¥Åíñ¥Xb=p…gñ¥Xbñ¥Xbñ¥Xb=$2ñ¥Xbñ¥Xbñ¥Xb= µ»ñb=¾üƒ=Ê•=Œê=È@†=ïÇñ¥Xbñ¥Xb=º|=¡0=SÓæ=ÕÓÉ=©µ¼¡7=ìat=T—<`!Ì»2±º<~=K ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb={‘~>Ð6>/óJñ¥Xbñ¥Xbñ¥Xb=v>±ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ç;_<Ëé·½NûUñ¥Xb¼q^™¼{"»›Æ½4º<ñ¥Xb>&‹=Â{<£*a<ˆwi½)½èæ¼ögû½³>Ú¾”ý½uݽü½äñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb==¤5»ºŠ%½ûƒñ¥Xb=¥ÉŠ>¸³=౬=…´Z=uÁ=ç’S=þ•‡=Þ‰ü=Ûty<í&§ñ¥Xbñ¥Xb<ÁH½˜Añ¥Xbñ¥Xbñ¥Xbñ¥Xb»ºHå½lòï½¥µ#½¬P¥<°òÑñ¥Xbñ¥Xb½˘;2‚vñ¥Xbñ¥Xbñ¥Xbñ¥Xb=€Þê> }?=Ð[®=¨L=V3Rñ¥Xb>d =角ñ¥Xb=\й=JJñ¼$\=T¼m\r<ÊUë=©°©=¦@2=«Îdñ¥Xb=¢\ÿñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb> ®ö=Ãíc=È®%ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Üyâñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ž“2¼œ<Ȇ]=;ä ½é="™ñ½ B>ñ¥Xbñ¥Xb= ù=èH=€L:¶Þ—½wº½š´½ªaŸ¾!n4ñ¥Xbñ¥Xb¾'Â9ñ¥Xbñ¥Xbñ¥Xbñ¥Xb½@Äñ¥Xb=FzÂñ¥Xbñ¥Xb¼2ÈÉ<<ìÝ×<9~æ=9Èß=²_ì>¥¶ñ¥Xb>ãS>#<éWÃ<ÞÊ=Àø=¶]ª¼:ˆ=Ž3ñ¥Xb=µ `=Gjºñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Œ«G½=±Ž½âð"¾1H\¼Žìäñ¥Xbñ¥Xb½Ù\7½cñ¥Xbñ¥Xbñ¥Xbñ¥Xb=òPd=Ñ;>1õ=>–.<*ÿH=ͺ®=ßOÏ>B]º²ܽ¸ÿñ¥Xb¼Ðg}¼‚zi¼Äž;ªiÏ=‹Í=Ö&@¼‚Ù•ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¯·_ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=;0¤>[Û=…ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÊW†=‡FJñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb< ¤&:Ú» »¼G9…1'9Èu ¼e.é½O¶ñ¥Xb=ŒYe¼xÍê<‘~¦½&Áœ»‰õ]½snº½”AWñ¥Xb½¬Œtñ¥Xbñ¥Xb½‰ÿ»ñ¥Xbñ¥Xbñ¥Xb½bùm½8oTñ¥Xb¼o+½+£Ã¼˜pj¼žj=™çÃ=« 3='åÊ=¾FÍ>B>*Õ=d£|=à«•=ºÍ€=éÅß=†C1=«Ü<üS=dÄÖ=•É=¦~˜½Ù†ñ¥Xbñ¥Xbñ¥Xb»±£½%ÓÀ½9EA½@²l½ÏwÀ½ž÷žñ¥Xb½@Þ ºóŠ´ à=ñ¥Xb=}’=—+[=t0q=f=§H¼tn+ñ¥Xb½é ñ¥Xb¼õ Ö ý=ñ¥Xbñ¥Xbñ¥Xb=aë€ñ¥Xb=íºEñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Õ¸Ï=ª£=NQ#¼K<ñDB=g^=§ 8<`9¶¼§ è=6Í>x©=k„­Ü>Q­ñ¥Xb>ö+=0Æ•=æÿ=YÁ!=Ñö=Ä` ºP'==÷?=@wî= à=ÅQ÷$‚ñ¥Xb<ñ¥Xb=âJÿ<úßX<˜Bt¼‹Ÿ=:Y\½±£¼^º@¼ÜIà<¤RIñ¥Xb½V]½!”ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>ð°>-—°ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼}{ñ¥Xb=ò Û=¡dz<¦Þñ¥Xb=þë=T«r¼ÛÐñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¹ïß<å?ª=$§<¹ Ï;«XÄ=¿O«=þ¶=fèH=ÿS>=B¦U<š‰‚zEñ¥Xb=Á¥=ñ¥Xb<Æ$Ä>)C‘=7=tg§½·÷=“=6Ö¼=Í¿»já=¤ç?ñ¥Xb=ŒFn<€Ã½jº½Wl¼ÕFý½JQ‰ñ¥Xb;vÁT=tú<•¼,Ž3=“Îý=så/ñ¥Xbñ¥Xbñ¥Xb=߇ñ¥Xbñ¥Xb¼€¡=ŠÉ£»¨ =—zR½f—Ë=¾}»~ B=6G¼¯$÷=†©cñ¥Xbñ¥Xb½|,“½—[Añ¥Xb¼¾#Sñ¥Xbñ¥Xbñ¥Xb=Û>¦-= #V=»Àƒñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<}â=Ì'¹ñ¥Xb=v@=€=»LÙñ¥Xb<òëñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ôl> X@> fz=#§/<3­<¢'u=£r;é<¯œ6ñ¥Xb=¬Ñæ½ 9¼Ñמ<­¢*½,x·<9ò½3V+½ã¹É¾ Õxñ¥XbX¡=*Éyñ¥Xb>þ <¥år¼‚¾ñ=ÿ;Ü(ñ=L§=]òf=‡Ø«<»Cb=‡×ñ¥Xb:ÜQ_=Niµ=NÝa¼vÊͼàñ¥Xbñ¥Xb=6tc=\)œñ¥Xbñ¥Xb< Å><E€ñ¥Xbñ¥Xb=äÓ­=·"ñ¥Xb=; <­´"<:œ;Ýs½rP½C’=R¥ï¼Eå;Ýñä=F†=<“c6ñ¥Xb;¿€Š¼táQ½H'=}Ã;½ßMñ¥Xbñ¥Xbñ¥Xb¼¢Ey<°›¡<×Aiñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½7E=6ó ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb= åíñ¥Xb=Ò;Kñ¥Xb>í2;ŽŒï<ÌUû k¬=Ç„=º@Þ=Oú=ƒ-¼Í“›ñ¥Xb=èý½ ñ¥Xbñ¥XbXZ=a­D> º=MyG<Ÿ¼<‚&]½Âà=*º½GëM¼é…ñ¥Xb½Ê=[´ó=@ñcñ¥Xb¼ieö»ß9Ù:É.#=¾SÍñ¥Xb=m…Íñ¥Xb¼UÓ.<Ðÿr<á¹½‡ÅÒº™¯"<² Ÿ;ŠÇn=™Ð,<1½®=|4»ç)=\6j:ìJ½½,“½I B=l®Ü= ¸ñ¥Xbñ¥Xbñ¥Xb¼ÒâÒñ¥Xb< .îñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb9¸©];¬‹­ñ¥Xbñ¥Xbñ¥Xb<( ;ºÇ¾:£Œñ¥Xbñ¥Xb:f2`ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»:u;'Õ:Iõûñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Zgñ¥Xbñ¥Xb¹ë»Ç»»O[;5«añ¥Xb»Oĺóñ¥Xb»‡xºbý;»ã±ñ¥Xbñ¥Xbñ¥Xb»Ë˜ûñ¥Xb;´W<ø.ñ¥Xb;Às¢ñ¥Xbñ¥Xbñ¥Xb»¼òZñ¥Xbñ¥Xbñ¥XbºQrp;€·»šv;ÈžP;ü ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<+ (ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»nwR»©:uÃ/ñ¥Xbñ¥Xbñ¥Xbñ¥Xb:Õ¾º âxñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;{„»fê;>j;S‘<»EOX»Óº™0§;ÚeÔñ¥Xb;3c;1€¿º£k²<s—»Ó<‘кÃ\lñ¥Xb;…Üñ¥Xbñ¥Xb»¶êÎñ¥Xbñ¥Xbñ¥Xb»†De;MêTñ¥Xb;UÈÚ¼k»/ç»8©îºÞ{ ;?GS¼H¢?;Ÿeº-Ç»?5ºÐ;TW—»&Ce:ÅB¦»œ™»—2€9÷_e»¡¤»ðý»„ÕŸ»ô=»ñ¥Xbñ¥Xbñ¥Xbºé}»ìbÍ: Ø3;OG»®|Yº°M²ñ¥Xb»?Vµ;_~;'k]ñ¥Xb»®¥ñ¥Xbñ¥Xb:Ò.›»pñ¥Xb»“<ØA;—bq:Vïú;º¾XºÆvÉñ¥Xb;1ñ¥Xbº½ué;h@€;ÚÞ‚“@¼/•»y8L:6µ£¼üººÝ(ñ¥Xbñ¥Xb»ÍÐ;Ý ­º¡)Ë»K‚Ö;–wd:zÕû»2–÷;žõ½:£`8;„®;àñ3;©M‡;vè·ñ¥Xbñ¥Xbñ¥Xb;ô×ñ¥Xb»ýn%ñ¥Xb;£q´:Ëp¼¦8»Ó>ºËý:̧7P-ºÅ’»ruÆñ¥Xb<0À;½gñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»£^X»÷cMñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»oFñ¥Xb;„^¢ºÉ4h;zŒ²ñ¥Xb:Ú†!»Ó,e»§Œñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<œ¢;¥RH¹\ ;»Å;ŠÔ‰;,3š<(ø;‚™†:¤Ìý;à«y;êx:о:«Çö;‰FÝ:­Ðs; @;,wð»‹:ñ¥Xbñ¥Xbñ¥XbºVYñ¥Xb¼£»>bÌ:½hÜ;±Þ;<^’»†é:å×̺­u¾;ðGê;ñd$»‚Ék:HhÕºûŠ¤ñ¥Xb»•Ìñ¥Xb»Ý:º‹}(:žñåºÆås;tqt¼H’m:Ïæþ¼‡pº˜W39åÂñ¥Xb»ò½F»¬™Â¼™S˜;ªï»Ýý»Smùñ¥Xb< ¾ »e³ý;—<;‡M;p¯1»› Pñ¥Xbñ¥Xbñ¥Xb;Î)ñ¥Xbñ¥Xb¹¯Œ; ýó< šŒ¼# Ç;X/Q:úµ—:WèÅ»A<4»™.‹»ø®‘7­Ïؼ¿Ü»¼Qûºªùf¼[¼F»± »Xù»Þ˜¼‹óñ¥Xbº¡ÅÆ<è½:¼d¨ñ¥Xb9­…Ó<×\»´án;¼šŠñ¥Xb;Ã,Ùñ¥Xb;íAQ;‹1Õ¼:®Û:÷Žg;uä2;±ì×¼M‡9ªÄ&;Íáá:œBÎ; Æ;³;u“‡À¼„ú< šËñ¥Xbñ¥Xb;ÏÁºÖ Cñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ñ»/ñL:…b»ïG=;Ãîñ¥Xbñ¥Xb»rÿ9q.¾ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;íÿBºNªW:Äd-;i6;çH¦ñ¥Xbº•ëª;¢XÐñ¥Xb»];ÌÚc<ç;ó"9»×y»,þ–»¹O9Yyð;éâxñ¥Xb;ß•²ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;ÄZt»¿N»¹‡cñ¥Xbñ¥Xbñ¥Xbñ¥Xb9´¿ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:|:qºü <o»;}•;Ï+YºŠ‹u¸+"™ñ¥Xbñ¥Xb;áÜ|< ‰E»Û£»ã:a»š4U»@Bç9Ó"Ë»›Ó`ñ¥Xbñ¥Xb;£­Áñ¥Xbñ¥Xbñ¥Xbñ¥Xb;µ¬tñ¥Xb<Doñ¥Xbñ¥Xb<"[¾<=¦;ó¶ ;…¹);¼ M:Ä; ,ñ¥Xb¼6ú0»„É:ãV\»×gߺ®¯v9Ë+þ;œ$»:c…ñ¥Xb»ÉŸº¿àñ¥Xbñ¥Xbñ¥Xbñ¥Xb;®àá;DÃó¼,Zd;E×þ»4Ëñ¥Xbñ¥Xb¹ßן»cÿñ¥Xbñ¥Xbñ¥Xbñ¥Xb8¢æÐ;lsº:ðo<9m?»’ŽÜºÜ–#<¨­ñ¥Xb:S³ºå³ñ¥Xbñ¥Xb;’ :ÁW_< ®Ì< j< 5ü»)â;L‹9—y»ù!9Õþ-¹½ÚT<†;ß ñ¥Xb»*/.»Â?Í;¡÷;u;"Cñ¥Xb=u=-5+=¼¾¼¦dþ<„/ñ¥Xb½Gž=8¨=¸£#=°ØH=¯o=oØt¼Ùðç;ìG<ûÌ󺤵(½ž Œ<µ1½=!ÿ¼>Ƽ8@ß½ž§F<³³¼}ɺ(¥»½·O=Š$,ñ¥Xbñ¥Xb;Lžh=5×½V=áóÝ<—›ñ¥Xbñ¥Xb;b†=®±@ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÄŸøñ¥Xb>Ef=Åh=Âz:ñ¥Xb=¨œ‹<¼¿Ð=PX÷ñ¥Xbñ¥Xb¼º»¦¼‚nl½^bñ¥Xb¼Ë½¹½8±½¢¶‚º#9Êñ¥Xbñ¥Xbñ¥Xbñ¥Xb¾-½wͽ¨Ì½³÷©¼áÜ\½‘½Š=ŠÁñ¥Xb=ÌÁ¢=€?>)ƪ=Î=™þâ>·ºñ¥Xbñ¥Xb=¦!< <ú=AùÚñ¥Xb¼†+$=:2=áØ=õ¸=Êм;Ûl=@\k¼xÃç=ðÓ½tù¼@*F½¼e‘½a.»¹È Ç=’è=J‰Å½2½`?̽)¢¼9¯Vl<Áק¼–aeñ¥Xb=x‡Ô<jñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼?ƒë<<=Å Ð=5üc<–f==\6ñ¥Xb½”/a½ü­=mùñ¥Xb<žñ¥Xb<×.=J•¼öô=½ áÐñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼Õ6añ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½o¥½³ß[¼M:9øÝZ;¿þ<Ýßþ×ñ¥Xbñ¥Xbñ¥Xbñ¥Xb½ É=ÄÖ„ñ¥Xbñ¥Xbñ¥Xb>pº >§“ñ¥Xbñ¥Xb=àl¢<ŸØN=gº(<™ŠÜ=ZN¬=žbÕ=Ý4=ÿŽÛ=WD§=0è§ñ¥Xb<êìÎñ¥Xb½˜ëñ¥Xb½}/½!v™½'§B½AÕ½D8añ¥Xb¼$ñ¥Xb½È ½ÝÁò½é')½êíº¾’½í™A*¿!=©u€=•ª=•üañ¥Xbñ¥Xb=]be=¸~³<ð[Àñ¥Xb2=sž/¼,Y*=·YÃñ¥Xb=¬Ò‹=ggå=9¾°=EÆ>Ò»ñ¥Xb=I5#<%s"<¯@±¼¿`¼ªÔh½6‰eñ¥Xbñ¥Xb¼Ê™ñ;áúñ¥Xb;Ì…”½^bB½7C•½±•ï½ù%ܽpÙ½ E:½ñCð½ÓGþ¼æ軿™ê<(J¡=¡ö=õµ=…”¼=ê—ê=¥¶9=#1Ú=9é{½—Zšñ¥Xbñ¥Xb=“Žý»ñ¥Xbñ¥Xb¼wÃ9¼°\B=…ÈÞ;±U»SVx=§<„<̽zgt»¿q8<=á×ñ¥Xb=4É…<ÛMÛ¼€Jò½6Šñ¥Xb¼gyQ¼c ä=1t‚=›‘>ñ¥Xbñ¥Xb½ ¥';È÷˜½>CH;óÞñ¥Xbñ¥Xb½šÍ½ˆT¨½WìØ=1Ær=‰}®=cG¾<Žàl=*p¼ðüg½ª¯üñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Pä=Îd½xtL½pmS½³©"ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½mM¬½¨ûá½’°ë¾ÔP½GJ"»À”¼Àc„ñ¥Xb<³ªˆ=ë¸Åñ¥Xb=KÒ<ÖÉ =H¶®=‹R“ñ¥Xbñ¥Xb=—¦×<þ¶=Å×@ñ¥Xb;IAk<ãÿÎ=Ù((=#‚×>0Ú>ŸFñ¥Xb<ú=]ñ³=T†»¸iF=F†”<çBÊñ¥Xb½íÙÁ½®ô_ñ¥Xbñ¥Xb;¼@<Àž°½Æƒë½–DȽ‚´i½­¡‡½û9¾£¥½V Ûñ¥Xb<ü€òñ¥Xbñ¥Xb=‘4Ï=í§=žÚ´=éH=î>Q=ˆÑŒ;ýö½Æ›mà¢=zçÎñ¥Xb=¹³·=6Öa½.3/=A@<Ù!<ñ¥Xbñ¥Xb¼­Çâ½nƒñ¥Xbñ¥Xb½€¨zñ¥XbÕ=â_‡=Z²¥ñ¥Xb=˜¥8=ô(‹=UÚÀ=îK{ñ¥Xb½[wË=¯•=,~ñ¥Xb=ˆY]=ì;‡.º=`«;÷µî¼J =tb¼=Óã <ó:i<"¸¼ºÛA½Gx1ñ¥Xb=x~<¥j&½³¯Þ½¦È*¼A½—K½}‚¡½_çú½³ë•ñ¥Xbñ¥Xb¼2Åañ¥Xb=¢e=à?=µr?=ð3÷=¹XÓ=…¼PiÈ<£Ñ=”ϼZ»P½¬â×¼½ ¤=ÀpÃ=_«ñ¥Xb=tÃ>=ø 4ñ¥Xb=š¶ã=Fý4=Wþ:ŸkÙ=¬Xôñ¥Xbñ¥Xbñ¥Xb½mLÛ¼Ö¢ñ¥Xb½™ï½ùw=ÒP¦=•B°=½À»Ñ8)=`¹$½í<1‰˜»(O_=X"&ñ¥Xbñ¥Xb<ê ;¸z—ñ¥Xb½­lªñ¥Xb= wGñ¥Xb=O"S½© D¼YO ½ƒI½½w¯k½Ç“‚½×©´½ºñ¥Xb= M<—p¼‡â¬ñ¥Xbñ¥Xb¼à¼Ðkññ¥Xb½°Ã@½•&ý½ÿÁm½¹xX½÷›ãñ¥Xbñ¥Xb½7½†“½v˜¿½¬Á‹½”æñ¥Xbñ¥Xbñ¥Xbñ¥Xb=»Üt=Äà=÷yJñ¥Xb= ®·ñ¥Xb=œ†¸ ½(H6.ñ¥Xbñ¥Xb=úW=!µn=|>=K{<ÝŸ=ã[ä<¯ «=DW]ñ¥Xb½°|½Q® ;‹ \=lb¹:þw¼›Î¢»n b½±Q½(“é½-q½X;½’€^½?—]ñ¥Xb¼ÉDB=­Vƒñ¥Xbñ¥Xb>ñ¥Xb=_ÎÏ=‰W;=°®¿<Ü­æ¼Ä²–¶Y­ú='±´¼üàë½OU=p@=¼³\<ì‡á=ýà®=Þ=%„=Di¨> ÚÌ=®:»òÜÚ=TUñ¥Xb<¸`ñ¥Xbñ¥Xb½c潘r½6 ¥=L$¿=¥¸È=Ȭ’>”=cÄä½£È=hn;mã𺶙e=´=ÃîÄñ¥Xbñ¥Xb=å7ñ¥Xbñ¥Xbñ¥Xbñ¥Xb='•ñ¥Xb½4·½ªñ¥Xb½í¾( ½él¾Svñ¥Xb<¤+ ¼ˆ„‚½§GüåHÿ½Z;=+Ðñ¥Xb=R(½¶ñ¥Xb½™Œ¥ñ¥Xb½²l½M¿½ÑÙº¼¿ý½.“½"̽³ä”½îäNñ¥Xbñ¥Xbñ¥Xb¼.äÐñ¥Xb= Ïñ¥Xb=©Ñ;_¬-=Y«—ñ¥Xbñ¥Xb;|vË=A³99Ô:m=¢Ø=XÄ)ñ¥Xb=Ÿîç=û¾_ñ¥Xb=ÛnÁ=jñ¥Xb=M> Ù>{<νÚ=e†>C‘p=Ì^§<ÒãÂ=áK†ñ¥Xb=V&<_%V=N`ñ¥Xb½'b”ñ¥Xbñ¥Xb¼Æe½«^9ñ¥Xb½|ᘽ˜ È=ˆ•‘¼Á@=˜êÙñ¥Xb= \^=´ò <›‚ =hÎ-="=Mõ½B—¼‘^¿á¸>/ì=Ÿ=Ôí==W'ñ¥Xb=Ö–y¼¡J<÷/O½©ż-Ù ñ¥Xbñ¥Xb½¨óDñ¥Xb=–r=Æ ý=îƒ=‰c“=ŠÌ½ñ¥Xb»±ÿ=’M;šQ½LKK=¢E=;µñ¥Xb<§µ÷ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=› <Ò뙼ŽÐ½®Ó½÷½ã•?½²ý½ñáð¾v8½–ð»hsÛ¼¨Q ½ÆU¼¯ Áñ¥XbºÕöº4Ÿñ¥Xbñ¥Xb:8·Â¹ˆ&M;¥ñ¥Xb»i˜";ÿrñ¥Xbñ¥Xb:Ÿ?Ò;–*ý;¬­4:×E ñ¥Xbñ¥Xb»è›Gñ¥Xbñ¥Xb9´Ö]»y¿~ñ¥Xb;Œá;PÒR<°:*Žü»VºÃ.o¼3Œ€ñ¥Xb;>&Dº6»ü;ŒQrñ¥Xb:hð;'Šw¸{S˜»kˆ;çÖñ¥Xb»¢xÌ;x¼)Ý¡»ûg»aª;|Ì;Áª;Tø;›Gu;{±›:M7`ºîNØ»-¬½:SÊ»x¶Ò;Â"éºãU¹µ›f»iÇ:çÅ{ºvúñ¥Xbñ¥Xb<¥“<Á;|󽻢ýîñ¥Xb:×’Yñ¥Xb;©xº—.<##I;9mÍ;‘ˆÌñ¥Xbñ¥Xb;w ž;yN;脸:Lõ<%t‚;érþ¹p|¸»öƒº"T±;ÙPñ¥Xb:›5ñ¥Xb»+9&ñ¥Xb;ëÇâ¹,WÖ¹˜]»Bâ;‚8Êñ¥Xb;³nmñ¥Xb;;j3;“Íd;âùÒ;b´p¹¥æOº<»Ô:èÐ3»VÁñ¥Xb»>ÃäºRàf».k< ßôºc^ï¼oº«:ñ¥Xbñ¥Xb;À`̼MÈñ»ðžÚñ¥Xb»ØÙ„¼;x»ø3ºÞËÈ»—vú¼4kþ»åì:©iÔ;Öƒì;¹ «;™Ö;°¿:k¿©:þËe:òº0»%‹…:À‰;Ô˼ g7ºÎM»yZƒ;L#,ñ¥Xb;dI};°A&ñ¥Xbñ¥Xb·®ðl;Iˆ+ñ¥Xbºzñ¥Xb»ío¢¹¥Âà;¹6õ;Y!”;„L[ñ¥Xb;M¾9ml :Ì;Aòñ¥Xbñ¥Xb»ÝÝ;lhLñ¥Xbñ¥Xb:Þs.:#¬ä»Üäæ»/ø#»ƒcr<¢³<êœ<2Ù;­ØV:¨jÒ¸S)ñ¥Xb<ɬ;-ÊBºí<Ã:Ù¶¤ñ¥Xb:ÛÜ€:&;ó>ôºÆSÝñ¥Xb:•Hþ;€„9»cÚºX:Æ»ìç»­o4ºii²» d‚»Iàñ¥Xb»Ð÷±¼çǼAø;¢Rñ¥Xbñ¥Xb»6[âê9¼‚Ô©ºÔV£ñ¥Xb»†Þ9„ñ¥Xbñ¥Xb:€s<<_!œ;ã¿õ;Ÿ$; h<‘:E<%Ž›;¢†¥;]oñ¥Xb;"ì/ñ¥Xbñ¥Xb;0¼ ~);MŸ‹º¥}Öº¥³[»£Tk»BÖ«¼tß;O}Ð»Ò ¼äÚ¹€ªCñ¥Xbº3òϺµ¨Âñ¥Xb;…eÀ9hÕÁñ¥Xb:^;‹Ê»‡¿ñ»—ø;‚;[ñ¥Xbñ¥Xb»É컇Œ‰ñ¥Xbñ¥Xb;-XXñ¥Xb:d ù»®‚» í;8A5ñ¥Xb;ØVN¼8Ö„<@ÿä;{”Uñ¥Xb<ÿ<ö•;Ê –;£ˆQ<©å:)ù»\ôfº‡A/¼Ž²—9í,S¼'dÙ< ôH‹ »Ã…®;š*»]G¹R¨}ñ¥Xb;ƒc»•7a;Çõ뻉A[;¤‹T:ðl;(Qß:Ò)†¹ÑÁ ñ¥Xbñ¥Xb;˘‡ñ¥Xb»^G;­Ë«º®b»Ä{»ö“ºrsÜ<4¡$<=:;3ñ¥Xbñ¥Xb»;v°;Ýñ¥Xb;Ì8ñ¥Xb»ù6Îñ¥Xb< Ò˜;:tðºÙ e»ÝǾ¼3í˜$[;ÐU®<ãô¼T*"ñ¥XbºÕwù·%ùñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:|‡<"4ý< ß;,|¼8HY»t”ñ¥Xb;¼]%¼ ÚG<ÉBñ¥Xb:E‡Ûñ¥Xb¼JW;~¨™9ÍoFe;Å“}»íUM;6Ïñ¥Xbñ¥Xb<@ ]<34¼é7ñ¥Xb¼0£š;ǧ:¡P»¶€åñ¥Xbñ¥Xb< Ûh;Lªuñ¥Xb:.â¼ÐB»·§:ÌD:Õ_ª:< Îï»4<$”溜¼4:øy\º×j[:1Cå;K…;âEñ¥Xb»^%»à ¼$]^»t:àñ¥Xb¹Ò@§»*59 É;ÒÏ;¾j<;Ò:¾:B¿"»\;Ù`ñ¥Xb¼›H;l¨iºº5!;uñ¥Xbñ¥Xb»’y*¼6Ð;{2Ñ;ÉÎ{:ˆúÕsºþ°Á;SO:8K»k¾ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Ïd:–©õ»²–`<æj»ÜÚ»®|kñ¥Xb»[--9âѼD®ñ¥Xbñ¥Xb»Þ«þ;ãH:Œô@::`sñ¥Xb;ˆÒ\:sc.;Ó½þ;2öñ¥Xb»‰©ü:³5 ;I2sñ¥XbºÌ°ã¹þLÜ;¢M躣t,¼ u:èÂ~º¬Å<›»²»o:Ìi⻯¯œ»‡N/ñ¥Xb»˜,t»ÑÚ;áBõ;†Ä3¹Êþ;ñW»/e¦:Ê=:‡BÝñ¥Xbñ¥Xb;›0 ñ¥Xb»î <+‰²;½Õ» c<‹*¼-O;P©ø;Àý×.ñ¥Xbñ¥Xbñ¥Xbºõò§»eJ ñ¥Xb;¶©w»4ÇV<2 :5œâ»¬„:4ôÜ»ÚÝ»¿»›k”;Ä.¹¶ ñ¥Xbñ¥Xb»åàD»hJñ¥Xb;?^ñ¥Xb»±\ƒñ¥Xb»s&2»µVº¡ûE¼“ºæ;¡–<¼^:ýñ¥Xb;{ :NÐ=<&u;J÷Fñ¥Xbñ¥Xb;¶Ô´8ªöñ¥XbW;Š7a;ý ñ¥Xb:Âñ¥Xb8Ö’¶;<‡»v/ºŽžk:“XZ»¿É³»mt°ñ¥Xb;¶L ñ¥Xb»« ñ¥Xbñ¥Xb»¡Ž<žª»·8ºx’ˆ;1[B;¯ »T»—}‹ñ¥XbºóN:ÙpκÓkî;ÏíÒº¸—ý;º!»‰±í»ð±dº™és»Òùu9ªÜò;¼ñÊ;;gYñ¥Xb;©ä[;”2ìñ¥Xbñ¥Xb»ÊxÜñ¥Xb¼“”:5`¾:ë"x»ì_½º©b¿:¹¤9;|Ôk<Åå»ôÉñ¥Xbñ¥Xbºmãñ¥Xb;™!ýº4~—»CW»…£ÿ¼êñ¥Xb:á£Û¼$üº<§d;kƒ»CºFýÐñ¥Xb;0}ñ¥Xbñ¥Xbñ¥Xbñ¥Xbºu³¼ <B¾<>ô¶»¯éÆ<³’œ» Q;«É»Ìî÷;7±»}òß»Çó»±`ó;:ýI»Ê8»¼d¢=çiâ=œéñ¥Xb»ÅÎ’ñ¥Xb½ÒT:½É¨Â½jb*<Ï ½„°å¼eì½™$f½«Á@½âçîñ¥Xbñ¥Xbñ¥Xb½­Lç:"¤á=@2Èñ¥Xb¼ØÜê:u@Å=Ò«iñ¥Xbñ¥Xb<†hž9È<ð—=tjPñ¥Xb=°FJ=uÐñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ô ƒ=£ñ{ñ¥Xb=¶v ;ôæ°=Ë©(>9Ç1=9ßê=¦Z”=»À¿=ø.°=÷^¦>*eWñ¥Xbñ¥Xb¼™iñ¥Xbñ¥Xb¼à, ñ¥Xb='u–½E< =¥§<?e=Xãs<÷¡Í=ŽNP=/à=%*Ð=lhx=mâØ=…ªÉ½xrѼ‚BG¼c5=½6ì|=[FÛ=†¼Z=reN=››É>ð= +ú=XP5= àÎ=ø"ñ¥Xb<á µñ¥Xb=UÜø½‡Ð½ Ÿóñ¥Xb¾ ·½Ûᕼ·=¶×);Ì{À=UHë¼Ä¼éñ¥Xbñ¥Xbñ¥Xb>/¿X=U=.A-½ P*º§õ=‹äEñ¥Xbñ¥Xbñ¥Xb<¢]°="G1='’V½‰µ¡½}zè½­ÿÞ½Šµ)½ÔM½Üž9½ÚÞ)½Û/¼£F½ Þ=fµ¼‘ÌA¼¡œ»¹u™ñ¥Xb=âñ¥Xbñ¥Xbñ¥Xbñ¥Xb½F01½ Nƽ~Ñ|¼f.½t~½î ½¢ º¾ô½¥Zuñ¥Xbñ¥Xb½· é½]e¡<²«á½;$²%©ñ¥Xb<Â~)ñ¥Xb>ëz>[u>1{èñ¥Xb=‹¼¼šñ¥Xb½ãd½QP=ñ¥Xb½]Ñ<{=–Ù=©†J<âlª=-B†=æ7Ÿ=4 ’<Ô°=Sî>é=2÷ ½§î: ™ð=í“=*4Æ=ÌU˜=`¶Ÿ=Â7A=ŒÈì=EFM<œ¹c=ˆn=Œ’$=Øòáñ¥Xb¹Å®Gñ¥Xbñ¥Xb¼6²È¼Ö·ñ¥Xb½Ò;I/l¼Ñ ¼útMñ¥Xb=~…[=êä~¾ _ñ¥Xb½»2Š½ 7ݽ1 Àñ¥Xbñ¥Xb¼æ…ýñ¥Xb=ÂJ¼¤kñ¥Xbñ¥Xbñ¥Xb=l—“åÇ>.Dñ¥Xbñ¥Xbñ¥Xb>qÕ=Ïk=ÿ;=ÖÖ¼À3<Ù‡¼_Í⼕ʊ½ƒÃ[½êRý-£ññ¥Xb½YÕ=oŽk¼ã!¼f‘´=­ó…<Žb“ñ¥Xb=i:Â=ŽÝ7=ÓÈœñ¥Xb;—Þd¼$)Ü<ðx=¦Ž =n9“=µœ6ñ¥Xb=8+¼¼#kˆ½ˆ_|=fÓñ¥Xb<ÀGñ¥Xbñ¥Xb>žÓ=-wñ¥Xbñ¥Xb¾×½µ¦)=L‹ñ¥Xb¼ O=ÅþŽ=ªm=™»¯Úañ¥Xb=¦‚–¼5dý¼h8Y=º¡=˜g=–„=cƒ;5|ª;Koª½Aù¯½¼µŠ¼pHæ _1>/q.=QÅôñ¥Xb¼ ó<ƒ¿¼¾Ð=öŽk;÷÷;¸iä=½N0=§¢‚9^õÏñ¥Xb=µh=·J»'-½ïü½?qq½›ýñ¥Xb½…=¼»ûú<ƒšá»ØŸ‘½™æÕ½º¸ë½©6$½/n¯=_Y…ñ¥Xbñ¥Xb<¥ðñ¥Xbñ¥Xb:Ò¸£= `{ñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼3ßñ¥Xb½¹~Ô¾:£¼æ‹<óÉúñ¥Xb½½¨8½º¬½À°‡ñ¥Xbñ¥Xb½Qíÿñ¥Xbñ¥Xbñ¥Xb;Æ]<ÇÓÆ<º`4<(â“;+¸Ìñ¥Xbñ¥Xb=Ã=Ç»q„= ð%=V-†=ögñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=m*·ñ¥Xb½zü=bh?ñ¥Xb=œ¥=:$†¼à-J¼é=tà‰ñ¥Xbñ¥Xb=ÉõÁ>1²j=´"ê½Íðƒ¼…€¼çßd=MNÎñ¥Xb¼×Y®<½ïu½°§½«–c:Nª`<…q:Q¬="…'=Èd>ñ¥Xb<3õA<˜IÄ= º=Ú=I<€¼°µñ¥Xb<¶÷3=´Ì;=LjÓñ¥Xb=„Ú:»ŸW:æ²{»ÍÜÅñ¥Xb=:v;¨J`=…Òz=1*½øñ¥Xb½ ?½¨¤Ç½{ ½äŽ1ñ¥Xbñ¥Xb»áѼ>8Ê=¾ßs=A·Û<ÊŸ=G¯‘=ØŠK=ÀkŽ=>-ñ¥Xb<Ç×=p°H:¼mnà:éS@<’Øk¼ìë¶=Å?»=`=ê<–¶Ò<²„$ñ¥Xb=} âñ¥Xbñ¥Xb<§=i½mŒ< ’=~èÅ=+=†ST¼'{®ñ¥Xb¼Q Q8=r•<¢E<Ñ8°»nÐ=Ÿðu=•fg;caì=g.ñ¥Xb=k½cÒïñ¥Xb½ƒÑŠñ¥Xb½<ª9ñ¥Xbñ¥Xb½lO¼ù‹˜;Æ y»V,ñ¥Xb=2[Õ<ÿÆ=¥ Jñ¥Xbñ¥Xb=C C¼?®_=xC£<ÇŽ‰;÷Ë<ÕÉgñ¥Xb= ¾r=_Œä;¯ú ½äFM½…}.»êê½ UÕ½²þñ¥Xb¼Ð¯u¼„·4;ŒåÓ½ƒÒ ñ¥Xbñ¥Xb½„x«<©«t½wC½»eǽ>%-½"2lñ¥Xb=B=O™½0|‰=BC¼ŒbZ; e`ñ¥Xb=–žË=3øNñ¥Xbñ¥Xb=—]ó;M¦á½…sGñ¥Xbñ¥Xb=á1½K™˜;—kñ;è‚ä<@Ù¯={·<8\ä¼îzj=(¶r¼Ä]V»ƒ³½m»‡Æm½@í.½’u½q®@½UnZ»jBÛ½²#Êñ¥Xb¼àc=s'«ñ¥Xb<ùo¼»DbºóNùñ¥Xb=t~øñ¥Xbñ¥Xbñ¥Xb=H2ÓJ¼Îî±¼üØr½Ö»½Ù©ñ¥Xbñ¥Xbñ¥Xb=\²}>Ñt=ÈÌX½ x<î»±#J<ºfr:•ìæñ¥Xb¸Êa¼Í}›ñ¥Xbº2ˆs<’PÏñ¥Xb½†¤ñ¥Xbñ¥Xbñ¥Xb½Dî6»Øø ½TTš=c®ã»”áÓñ¥Xb<-ãª=©H=ˆ £ñ¥Xb=«¥ÿ=üd]=J){=|ÉB=_ªu<¢2<úöŽ=Sô“=Þ ú¼£[½‰UƽÒçmñ¥Xb½ æs¼–¥£ Û=µ—¶=Á´)=v»= ‹ñ¥Xbñ¥Xbñ¥Xb=SP¼¡Š¾!»bâñ¥Xb;cþNñ¥Xb»´ ¿<÷<Ú¼r}T»OÔ;¢å<ò¹5Å<; "Þñ¥Xbñ¥Xbñ¥Xb»ML¹ìóÀº­ýñ¥XbºžL:½UÀ»ÛÜêñ¥Xbñ¥Xb<|< ^Í;…ÉÀ<|ã§ñ¥XbºÖzí;¦²)ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»“ú ¸¸­Hñ¥Xb:¤7;8<òv:)²ì;Ê?ª;ÓÖ&;7Ûºoä6<&t©»]{Ÿñ¥Xbñ¥Xb»)×ñ¥Xbñ¥Xb¼Úñ¥Xb9­”P»ÎbÜ;4ȼè8·ëi·º÷xv»‚Æ»£·;–d¼!ù`¼åRº':vºîtκՆ;ƒOG»Š&3ºI_»œ&¯;[+M;#iĹߩ‰:¥"¸°ÂǺš÷:ÅÀD;¤ïQñ¥Xb»´çéñ¥Xb»k »K:ÔÒÁñ¥Xb;ìï»ý% »æN2:mVt9<7è:ŽP;KwZñ¥Xbñ¥Xbñ¥XbºˆM;îJ»Xã;?LJ»°×ö;žÎ«ñ¥Xbñ¥Xbñ¥Xb<b¼º|ÙÙº¦|y;⪦;]=;“/x»©$ýº‘¬»p, ;&><$[9–ÇÀ¼‰Ê`;‘pA·Ð®´ºÃ™ö;pÜñ¥Xb<¿ëñ¥Xbñ¥Xbñ¥Xbñ¥Xb»¬â» ý3<›‡;gÚ/;‘K¢»Qô ¼R‡º!K»ËÞŒñ¥Xbñ¥Xb»„’ºýô;»Ë*õº’Ž¡9 A÷;†ÏÏ<Ómñ¥Xbñ¥Xb»÷1×;Ä5»¶¼.ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;®³;êÍñ¥Xbñ¥Xbºã"…8ÕEÁ< 8çpñ¥Xb;ý1º«cˆñ¥Xb»RÃ;¨®[ñ¥Xb»šßw:±€…»óÓ7;€Bß9ùc-¼ >U»Ÿö»”É»ºœÅì¼Êg»Öº";{»‘9;B»[»ºJk¹‚#á;Œ}N:Âå»rÂó»óå½»,¹º97Ì»árÖ¼ˆÁ»’:ªñ¥Xb»£Ctñ¥Xbñ¥Xb»Ã%»÷7Óñ¥Xb9!ì™;Øžº'!»íË¢ñ¥Xb;1‡Û:Õàü;¥ºÊñ¥Xbñ¥Xb»­dM»Ô»\Y:ò{Ê<ÛÆ<¦c²ºÅÊñ¥Xb¹sOT9™pÞ»0ñ¿».&F<œA»bÁ溌Á;tÓ»“:âÕy<2;2´¹TÿÍñ¥Xbñ¥Xb;ÕžV;†¾*;v¦:Á W:™ä­:Ç’ñ¥Xb<€Îñ¥Xbñ¥Xb:†÷¹W˜ø:Ýkà¼é:]t»†Fy¸ð¥:Æ÷ñ¥Xbº,Z¼º*㸵0)ñ¥Xbñ¥Xb9èöñ¥Xb;•æ;ʘñ¥Xbñ¥Xbñ¥Xb¼ :&tñ¥Xb<,+áñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ü|:zLK;Àqñ¥Xb< §¤:ꡉ¹$…‰;½áó:“ñ¥Xbñ¥Xbñ¥Xb»PU ;€|Œ:õ4ʹɗã;pV-<Tð;L›»Ã»ñ¡;ΖWº©Œñ¥Xb¼,Û±;†Ò»h¼ä»Ñ‹C;™/Šñ¥Xbº*?>8l¥H:ϧ†ñ¥Xb;c@ò»ÎÇ„:ì†P»ˆ¯3ºÙí'¹Ño'ñ¥Xb¼ˆž:ðQÂ;v:ÿ'`< ù¤ñ¥Xb:â‚ñ¥Xbñ¥Xb:ŒŸÂ;žJñ¥Xbñ¥Xbº6Ë|;wòo;~´ñ¥Xb»…ö;ªRš¼"Fý<{¡a¹ßqŒñ¥Xb;Ä€ð;Lš=»‚Œ]»¯N®9³­E8û$<@-:ºÜ¼Õ7»‘aÚþ=¹McUWñ¥Xbñ¥XbF:×ÙÅ;¬»ÕëV»Z:™…ï:ꊻ> ;Û¶k»­Ž(;O˜š:Óº-:Ó¬Ö:™8 »À¬Eº>É<;›.ýñ¥Xb»øy/¼3¡eñ¥Xb»Ö‚¼4oóº+Lnñ¥Xb<Ð+ñ¥Xbñ¥Xbñ¥Xb»kÈ8; Se¹¨À;É‚Çñ¥Xbñ¥Xbñ¥Xb»åÒ*»–NP¼Ep»ÊÝ<'¸0»uÄu;#§ó»à‹‘»»Å#»úgZ»…=j<Ì<Gyñ¥Xbñ¥Xbñ¥Xb;]nº¬€Ï< Õb<ˆÇÝ;/&Àº–Œ%;ö¤»G*}ñ¥Xb;;uº¡"áñ¥Xb;‚ÿX»¿&ªñ¥Xb¼î¬ñ¥Xbñ¥Xbñ¥Xbº¥Â}<*÷»gœ8»žwôº†½…ñ¥Xb¼ÞÛ; 0¼"Z¾ñ¥Xb;^||< i»žŒ²;óæÏ<$¡»øÑX»ì[‰;J\Q<mñ¥Xb»x€‘ñ¥Xb9àGA;‹Mê;¤t;Þu™:#sܺ±l];{0):óYºŸ‹ºñ¥Xbñ¥Xbñ¥Xb;Ûs¹;H&»®€ñ¥Xbº¶Ë¼»ÌŲ;úÿñ¥Xbñ¥Xb»ÑП»*°û;¶£»d3©ñ¥Xb:Øä-ºíhñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;D¬±;,9ûñ¥Xb;k³ø¸Ö=?»”§Ç9Ëõ=»ú“:`O¶8—Û;iz!¹&8`;œÆôñ¥Xbñ¥Xb¹–¢ªñ¥Xbñ¥Xb:Ûñ¥Xb;M´Þ») º–4å;™š;s¾»´hêñ¥Xb;-á;¤–¾ñ¥Xb;³‚:Ò(žñ¥Xb;pŽÏ<Л;– <$dê;‘n|¼#Ui;´p;C¾é;–†¹»l·º“;~;¯¤/»Øá <3µQ<5ApºgÛŒ<ƒŽ;ÞdÅ‹ñ¥Xb<*±Œº”=¤;<š°ñ¥Xbñ¥Xb»lÏ¢ñ¥Xb;”ö7;K¼ñ¥Xbñ¥Xbñ¥Xb8˜9œ;é Ðñ¥Xb;§žâñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»‹…Ü:¼ÿY»Rí#ñ¥Xb¹Îã ;þQÊ»ŒïZ:Þé<;çW$ñ¥Xbñ¥Xbñ¥Xb»+S5» õ©»µ÷½º°«›¯u<‚”;m’»–WD»Ÿ¨Î;¼‡Ôñ¥Xb:ÃÛ;­¶Ûñ¥Xbñ¥Xb»³:ߺš%·;Ž C»}*ç:ý›æ»SÁôñ¥Xb;iH<#;ŒúÕ;êÁa;€ºp:2ÛZ;4÷ê»»@ñ¥Xb;‰Zº;|0-»ðà»»Þ» ø廡—æñ¥Xbñ¥Xb;jŠ#:`×U»Ënÿ:ý@[»—p»læ»´ñy»ÆÅ)¹Âþ+ñ¥Xbñ¥Xbñ¥Xb;ª¨ü;&Â;”uÏ»€‡ñ¥Xb;±Ýª;$B:ƒœ:¹:"9E§õ»Ä¤¯»P‘Ðñ¥Xb;k–»ÈÚ;>`Ú»k…¼<*Ôû;ÈSÌ;×;;æÉpº‘º »–Yñ¥Xbñ¥Xb< µ2ñ¥Xb»ÍA»l0Þ<)®<%ûÚ;*øÙºÚÂñ¥Xb»¿(5;(ô¦»±»l/2ñ¥Xbñ¥Xbñ¥XbºçD<" (»ŠÐÛñ¥Xbñ¥Xb¼Ì+=åI#=EšÜ<ØœÀ…Mñ¥Xb>*¥=D•ý=! ª;ßÓÌ=ÿIñ¥Xbñ¥Xbñ¥Xb=•û£ñ¥Xb¼ý÷¼¨Æs½ã·¼= ¦~½!Û¼¼Ojã=IÄ;É‘>=/rñ¥Xb»Ã]ä<³Q©<½D§¼Éúú¾W½™kB¾&®J½ñžè¼…÷j½<‹÷ñ¥Xb¼5˜)ñ¥Xbñ¥Xb½(ý`½Shz<®Ëa=&Û¼4g=óÒ =‘Ê‹=Ä¥=f <™E}=y.Ðñ¥Xbñ¥Xb»ÐQ#½x®&¼!b!=}ñ=FÛüY™ñ¥Xb>Í>?„Ü=Ã=<¸ þ=åËñ¥Xb¼¦Ê®<ìŽ=›öç=6+ܼG*ºñ¥Xb<¬6‚'³ñ¥Xbñ¥Xb<å½_ñ¥Xbñ¥Xb=Ri½zaøñ¥Xbñ¥Xb;ˆÞé½^BÛ½ÎõN½"¨¼c£G»é¥¼“wܼë2ˆ½USºš¼ó™ž½Ï…¾žÂ½µh;¼†kn¼ž¡ì½»w ½ÅªÞ¼.—|½¥"º½m ¼µê»—·†=Žó}<àéÅ=~p=©Šº=Ó½O«¦;0 e½³¬Vuñ¥Xb½£Å“½‰z<øÄT¼ðš°½5íTf¶=Ç•=uñ¥Xb=nP=i„½Z~h=Á7­ñ¥Xb<÷)l=æU=¹ &ñ¥Xbñ¥Xbñ¥Xb=´v¼ê˜ñ¥Xb»ï¡½Ìøñ¥Xb<`éö½/'"ñ¥Xbñ¥Xbñ¥Xbñ¥Xb½¯E6=3FÌ»ŸòB=…¥Ÿ=|\<½* ¼ËðŠ½2.¼‘ÆZ=i> à =É!•ñ¥Xb=½´=$Ÿp<›^7½ßá½jy¼_=ª¼|ò¼ö­]ñ¥Xb¼›*š½k½ˆ>Ê=÷ñ¥Xb=?Ì*<Õgmñ¥Xb<{¯˜ñ¥Xbñ¥Xb½`T<Å »l¨=wÝ»C¦”> á=˜Ó`>ì[¼âr=«,d=lÝÛ;Õ¥€> Hö½OTD½®‹|<ꨪ<~  =‘¤¼´çÏñ¥Xb=¡B½Š€ê»Wl„¼­Òªñ¥Xb½ŒW/½%nü½às ­®=©Õ =~ÆP<¢u¬½}^ñ¥Xb=žÄñ¥Xb<Ë´ç<Œ ñ¥Xbñ¥Xbñ¥Xb<ïM<Ð_ ñ¥Xbñ¥Xb¼í½™½ÐQ×½aäÊñ¥Xbñ¥Xbñ¥Xbñ¥Xb¾!±j=Zܪ¼×ãC¼L+|=nÕ=_{½a±ç¼×_fº9õäñ¥Xb½~-½¼[Ľ£SŽ½K½à¼3_ñ¥Xb=`_á=A´ñ¥Xb=¦ö9ñ¥Xb>·Ê>ûˆñ¥Xb>)=übq=¶˜¼ÓŽwºI{»¬±<ñsñ¥Xb¼mE¢ñ¥Xb½¥)Á½c5ï:´ñ¥Xb;))d¼%Ÿgñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=è=ŽP<üŸÍ=$1=¥¬Œ=æ±=É…oŸ’=¨ñS»¯¿u<“z¼q-Ù=mé=†$¼-œñ¥Xbñ¥Xbñ¥Xb¼¤&=@Dü=Cã½Û(½efñ¥Xbñ¥Xbñ¥Xbñ¥Xb½ƒ¹ñ¥Xb¼ Ãë=#'ñ¥Xb»=ƒ­<¦«–½¯ú½¡ìB¼ºj/ñ¥Xbñ¥Xbñ¥Xb¼Ú,t¼ þA=Ž*!»€D*=ˆCŒ<÷Uñ¥Xbñ¥Xbñ¥Xbñ¥Xb=‹i>¾ñ¥Xb=°ý„¼ÈÛ=âÁ=. ñ=‡<ÿ½¹4ñ¥Xb<¿ó*;̓þ½²]ýñ¥Xb;£N½ ñ¥Xb=-7Ûñ¥Xb=O½Üñ¥Xbñ¥Xb=Öéþ<›Ã,¼›Ø=S/A=eGX=×ù.=~x¦<§I=‹ví=æ®Gñ¥Xb9TçW½‹–¼£ç=‹ãû=-0=|Œ¾<4sa¼îAŸ½ê¶; ã<Õ~]½Óiž½÷çk½—ã1½~á½}нlM ñ¥Xbñ¥Xbñ¥Xb½Ÿè½¥·€½“5ô¼Ø „<šŽÓ<éÙ@=kD=”whñ¥Xbñ¥Xb=@®?=y,E=¯Õ¬=³pñ¥Xbñ¥Xb<S:‰ ¶=Y³ñ¥Xbñ¥Xbñ¥Xb=d_Ä»»¶È=M²ò½iÕ/½9šÒñ¥Xbñ¥Xb½Ãwñ¥Xbñ¥Xb¼mÏ»ÑÑñ¥Xb½Ã宽kç¿;" ˆñ¥Xb½‘*¾½ ¬Ïñ¥Xbñ¥Xb3‘==Yx>#R=œŒ½Ž¢Qñô>Q²> 5>âó=­}½M/<¡þE¼Åv]½Žª¾`ñ¥Xbñ¥Xb½©«ñ¥Xb<þá(>ä=‰^–=A=u=óÚ=2j ½ kÿ;Îg= Ð= Q¢=¼Äj=I-ü=+ÅÌ=ˆN»«Ã†½S¼ ½vi)½””(½;Q/½ 1 ºxQ»½¦|&½•½R{?ñ¥Xb¼÷Ó-½uÞl½-™â<ËѽˆO½W(m=-:õ½5äQ=Mš£<›Ü×<äü=nÿ­=D,™ñ¥Xbñ¥Xb½Ò(½\ã0=¸UW=¦<ÓŒ<<´Ù¼X!:(¼o>ï•>B‹Í=ÄZ1=6ʽSÙ½g¾½Ž)ì¾܆¾:ïñ¥Xbñ¥Xb¼_Õ¹=Pê=ï2G=…MÈñ¥Xb<§ünñ¥Xb=K½·ñ¥Xb=|TG=³s=Œx=?Wñ¥Xb="b>Rí=Ù†‚=±èk=h*±¼š6½A«½;ÌB½X&»Öñ¥XbÈW=R”:¼@Mê<ÒLÙ<ÇŒœ¾"˹¾š‘¾Cîj¾ǘñ¥Xb½0!6<Ò¨Ã= :™=±¹ñ¥Xbñ¥Xbz.:›”ç< lEº—§;ÎÕk;×U<µšºÛ€Oñ¥Xb;ƒiñ¥Xbñ¥Xb;Ã]ë»W&´:h毻m¢¼@Ī¹6¬;ÉnͺÁ¶–;Ži»ž~Â;€Ã¤ñ¥Xbñ¥Xb¼éæ»n»z»-s»eþ¸< NŒ:‰Èš¼8 š:ú=t»í6<ÙG¼O ë:ãÃi»·Óñ¥Xb¼*ú;¢ªK»Øí;ä4h_;ût:¡ï3;šS±¸nå;P[¸;`DÝ:îÖþ:©>ù<1…¹<ì&»1ô°¹áaq»›8¬Qˆ<%((:üN幈6v<,I„;ªü;ê;»G ;ò_»ÕN;sD 80Ioñ¥Xb»¤Q|ñ¥Xb»ç»–ŧ8à¹Éº‰ýE;o{¼!Dšñ¥Xbñ¥Xb;;Ôÿ;¬Cc»RzçºÚÈ?º’¦ã;kC†»É8™¼ 𹻈‚;õüº5mD: c :°¦³:ãÎrº½¹¦«Ò»xÂØ:Ä;*º8)·ñ¥Xb;W8s:Þ »±Æ»Ìa…ñ¥Xbº¡þW»òˆ»Úk3;µŒ™»á­‰»zË!;,Ú<1©¾ºì»ü&º9H »^5;ÑÀM:JÞª»©NXºjwê;™nª¼@™;p é»ÔÍ»Ü@ô;ñï;΃ø;¸¿óº5kñ¥Xb;iÕñ¥Xb»£•¯º¤:½ñ¥Xbñ¥Xbñ¥XbºÑ´n9˜cDñ¥Xbñ¥Xb;-ƒ¡¼RöW¼(F“ñ¥Xbñ¥Xbñ¥Xbñ¥Xbº¹ë<5À=:Ò³¯»­VÝ;Áe:’°óñ¥Xb:Šƒ‘ºçc¦ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»²;j0,;¤' »‡c:€ƒ×¹ä3ª;c!!ºF Ð:ü-L»,ßñ¥Xbñ¥Xb»&k÷;Dq;dÉK;g9_:ñ°&:¥E€º³‘Ö; cñ¥Xbº êÎ;ý@à:ˆv;ºdVºv;Qr»$½»ˆ>@ñ¥Xbñ¥Xbñ¥Xb;E»`h<•t»OïI;yµMº)n:!›Ú:\³«:_ú¯ñ¥Xbñ¥Xb<%Œã<‹ä$»OÃÇ;©yÌ»vj;ȇj:ŒF-»&§º®µ¿ñ¥Xbñ¥Xbñ¥Xb:‘Å-¹í°_¼UÇ<³©»e/ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»£ë©ñ¥Xb¼&Ì";¸sºñ¥Xb<ua:©5º žl¼sÜ»Sñ¥Xbñ¥Xbñ¥Xb<žx;2v;h I»È®»dbÛººÔñ¥Xbñ¥Xbñ¥Xbñ¥Xb;œBLºª’Ëñ¥Xb<Zš;²‡@:Éeº†ÎºT'!;Žxñ¥Xb»¤ðÀ;Ö7é;ο¯ñ¥Xbº™L<Á±ñ¥Xb;#@kñ¥Xb;[ÒÓñ¥Xbñ¥Xb»<÷л„d;µ»A:w8Þ˜»W¾»Gôn»ˆCX;GÊï:À3÷ñ¥Xb;AÃ&;‡d¥;µ»¬2ºoˆ9º6+#»Jïà·|ja»Ã¿»ÖŽ1»4Ý»G>·»ºc2»¶v­9¤ 8¹ó@&:±ñ¥Xbñ¥Xbñ¥Xb;Ïeɺ¸-9¹k—®¼ 4:;çÖ¬»:t_:Úy½;Œ§—ñ¥Xbñ¥Xb»¯[¤»¢h];±;›‘Dñ¥Xbñ¥Xb;üŽ¹†¿Îºàycñ¥Xbñ¥Xbñ¥Xb;–ðLÃ:¶Êb»'ñ+;Ý¢©ñ¥Xbñ¥Xb¼>¯ìñ¥Xbñ¥Xb;©³[¹Ážüñ¥Xb;#˜Þ:Ïþ«¼c“ ñ¥Xb;ô‰:”|uñ¥Xbñ¥Xb<$<ôñ;Ž½´»Ý†d¹³‚|:Ûõ:»1G;Žú2»^B»–S€ñ¥Xb<6°:G N»¢Ê;‘^_9Þ$»;b|¹‹$7;r.l;´¿w;ŠÒYº5=ùñ¥Xbñ¥Xb:æŽóñ¥Xbñ¥Xb9Dj½ñ¥Xb;TFÖ»Úe¤º;G¬;æ û¼»Û;Zmï:Žºíºy`Ï:KªÍ¼FÕ-»¢b&»MÈ;>ð¸é;–¨7;ÚF`;K»R‚º1!C;’²%»=¤I»Õ"®:ås;zû­¹7‚;ÑòÉñ¥Xb:$ );š,Kñ¥Xb<|Û;ªc¼§(;Áøi»N[:¼Ý,¼·³»èqyº¶åmñ¥Xb;{v®»h¥ ñ¥Xbñ¥Xb;Jà ñ¥Xbñ¥Xb»Rùº:Ú5>;âêñ¥Xb;šü;ÜÊ⹦ž&¼K!»?¼'50:`z?ñ¥Xbº÷Ã;°z×;¯¼ó»œì?ºQ6ñ¥Xbºû}&¼9˜¹ñ¥Xbñ¥Xb;•B¡¹¾íÊ;&B–ñ¥Xb;×.+<-1%;ÜŸ ;‹á_»BKˆ»ôáñ¥Xb;,$<¿­ñ¥Xbñ¥Xb»ê!º:Ô¿ ;\œ»W‘::ìƒÛ»Êõt:-˺ý"m9ãg¶;íÅ÷ñ¥Xbñ¥Xb:ËNhñ¥Xb»ØŽ¹_M”ñ¥Xbñ¥Xbñ¥Xb8`R®<É@»Ÿ*Ï»›À»Ê%Ë»ÿs„9Ó€C»(F»âm»;탺ì˜è;ÛÉü;–tº»§qÍ:lÒ»¢V <y’»€K';Žï”¼Ñé:Å•g»Ã•³<¿`º0Sñ¥Xb:»‡;xb”:Ì•¼.¬:­ÿƒ:‘?;ÜK¹LR»;6¥;¦¤ù»)ó,ºÄqŒ;êiñ¥Xbñ¥Xb;îèºäJ ;%s<<Ü; ½ »”ô¤:ZI:²#æ;÷ X»6ÙÇ:ÊY»‚<©»cÝk»Œoâ»Åv4:ã]óº_a;¶…š;æ* ;6Ú÷ñ¥Xbº®Ù;.Xdñ¥Xb;¦ž<š ;äMoñ¥Xb;Ð)í9ÒÛW»ÀB·ñ¥Xb»C "¹é+ªñ¥Xbñ¥Xb;Ä{¤¹¦}Ûº4À!;€;=•w<7'6ºƒ.$;ó»;VG¼s¨â;¤xÂ;ÍWü:¶9G;Pq»®C?»²œÓ<ŠÃœ»£§ÿñ¥Xbñ¥Xb»\• ¹Â°:»îsĺoµÏ;&Ê; ùf;£’“;2׎;kºÒ÷m»Nyµñ¥Xb»¬Î:Æz|9˦ð:ôà®<9Û£< "f<Éߺö‘µ: è><@–¸€˜ª;ñ1ø¹›Žrñ¥Xb; “+»²Õ:Ås;1Vñ¥Xbñ¥Xbº­ŒÀ:²¾~ñ¥Xbñ¥Xb¹l‡ª;×?~;-Æñ¥Xb:.6î»?Oã;¤¥æ»Edºoˆ˜»¸9;)ä: ¨±º‹Œñ¥Xb¼Ýñ¥Xbñ¥Xb¼2†Ô¼UõÒ»’±h¼nMñ¥Xbñ¥Xb:r1…»º¼‘ñ¥Xbñ¥Xb»YdƺƎþ:¬š†;zÞ-;RÒ…» j;9Œ8ñ¥Xb·*›4»U§ñ¥Xbñ¥Xbºxr“;fÞL<6Màñ¥Xb»_/®:êmˆ;TvÚºªþ¶É;1p˜ñ¥Xb»4È”»Íº:#pc»Tvñº™4Š»a;ϼ,oؼr³¼#÷í» Ffº¹W;§† ñ¥Xb<$ì»arí;‡Ì¶ºÂ]»:çÛ;a’oñ¥Xbñ¥Xb9¸Y?;¿‰Þº¿…öñ¥Xbº‘v;ú»i'=9äe»É9å:MÍÒºÖ÷ó¼Ò¢:Ãe;“ø»_–ù:›;æ¢jº4Ú‡»¹]*;¨º¥»xJI<,$~¼«»ùÒ‚:š€ò¹¡•Cñ¥Xb<´Ë;^¨_8]{aº zÖñ¥Xb»RØ;ĸgºÅ÷_ñ¥Xbñ¥Xbñ¥Xb»™Ð;`çñ¥Xb;¬»§#¾ñ¥Xb»9´ºõ<ìñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼¼ê¼;‡;Ñ»˜»À»•»`z˜;¹Iò»–s¼£ ô»Äà;´w»{¾C¼v;éBl»¬æµ¼  ¬ñ¥Xb¼ âN;£ªX;ƒ»G€Ü;‘Öh»ƒ‡«»Œ!Y;jNVºæÊ»eÛþ»'iñ¥Xb;Ë:(;ûC·»jÈ:Pó®ñ¥Xb<^;¡¦ñ¥Xb:ÿñ¥Xbñ¥Xb:2±³»¢òº¥Zbº»~’<̯<(ºv}›;‚f†ºÙ®mºÑhX;†.Ì:Ö`-;^[¾; );½:Í,Ù;Ú–;  '¼róñ¥Xb;¸ :_Ø;¼Æ|;“<¿ñ¥Xb;';ÏCQ:“èÌ:ɯ ;Mm».—3;ÁË)º“ÇŽ:Ü{;‹É¡;ÍÜV;#˜º@즺YR»á±ç»‘…õ;Q_ð»cöU;° m9m2a»Œ";ŸÓ:鶊º¥Ksñ¥Xbº#úJñ¥Xb;2>»ä›…ñ¥Xbñ¥Xbñ¥Xb»F5󻇿‚ñ¥Xbñ¥Xb»i2€< Im;jŒ0ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»§dðº÷]'9Š­Ã¼.Ã;òØ=»±”¸;*Àÿ»Â°–;†ªñ¥Xb9àì»ëÏ»‚º‚jŽ;™œþñ¥Xb»žu.; ’6ñ¥Xb<U¹ñ¥Xb;Ü@Ò<±ñ¥Xb:–o;žò3»ý“:ã,P;'þ ;‘ú$ºŒÏØñ¥Xb;BÓñ¥Xb»o;×õ=:T‰yñ¥Xb¹û{«;¬Äñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:¹^v;? < ;÷­(¸âºL»AÝ»(7ñ¥Xb»ð•›»ßƒ9—Z¯¼ 9,<`xñ¥Xb»Š/º~¡ñ¥Xbñ¥XbºŽ<©;|›0;ÄØñ¥Xb;:™Ûºz`;øNv¼ÑÖ¼±"•»ŸÛkñ¥Xb»µ!ººüH-ñ¥Xbñ¥Xb»bƒ»ãñ;×iw»ÐBk;™|J< ,ñ;„J¨;,•ºÒ|ïºMÕ]ñ¥Xbñ¥Xb;nÐûñ¥Xb<"-λD"ñ¥Xbñ¥Xbñ¥Xb;8ˆ¬»+ú]»ƒ#j:7;:Þ¼;oΓ»±Âº¾ˆ;”Y¾:ý´ì;u m»$˜;<b1;4Å»]OP¼' œ9Ô‘û9Ʀ;ŸÄé¹û*€»—á»Ë :·®U»t‡ñ¥Xb»Su´<^›;ï»öî¦;ÇøÅ;)IÓºðªX;‰Eé;‡ñ5»b³c;ž¶;ˆD•<.½¸ñ¥Xbñ¥Xb;¹ì»½É”9Ú ;’ù.;B[Œ¼²ü¼‡_»Ýä¼Zžöº$ ä;šIA;‘tÌ;V­¨:k·ùö=˜-æ>WÍ> jñ¥Xb=Õ¶D=¶7¾=‹ˆO¼íO„¾1\½½¾.K ½¾‘½NT_½'<½‰Çö=:å›=pЀñ¥Xbñ¥Xb="€ =r2ü=¯´r=Æ0=‰â=5hé=š?;=c±ž=HBg=˜›L½…yà½Ûhg¼Ž×¼É/;¿Y>º»¨¾=?–¹½r…Òñ¥Xb;Lêμ—Jñ¥Xb»×7†½ Óžñ¥Xb½”ËŽ<¤Z3ñ¥Xbñ¥Xb½“ž|½2hº²7<›=¨á€=û=2í~ñ¥Xb½Ða»”K‘=! …ñ¥Xb¼˜7=44¼ÕþCººd*½%]Àñ¥Xbñ¥Xb½ƒÐo;…ÆU=oéñ¥Xb=,øØ<×ä¬<à; _=A‚g=kã½ÅÆãñ¥Xb¹«üÏ þñ¥Xb<²|±=_¨ó<…¼þ»Ýñt½Î³U½ÃN¾ˆj½ÁÑí½„•ñ½ˆ7½/×=ÈMh<{N:ñ¥Xb=Õàü=`Wå=–õZ=¶R=½²ˆ=n Ï<ùÒ‚Å1ñ¥Xbñ¥Xb<šo`½žâ¼Ç õ<ï³|ñ¥Xb=S„ñ¥Xb¼œåª=ÉÛ¼Ú«¹ñ¥Xb¼qcñ¥Xbñ¥Xb»q#zñ¥Xb=i7Rñ¥Xbñ¥Xb¼ö§ñ¥Xb½ ݼcó½fýô(ñ¥Xb=¢8’ñ¥Xb»ìüñ¥Xb<%×Üñ¥Xbñ¥Xb<\ìñ¥Xbñ¥Xb=IÓÒ;IôÆ;-¼Ð=Ï% =¢0;Q+Ë=R3;=†”Ÿ½$PW=Äm<ÁÐM½Mòí½œ.Ìñ¥Xbñ¥Xb½2ñ¥Xb8Q“Iñ¥Xbñ¥Xb<Ü<™¡)¼'¸”=™x=6€=˜<¼ˆ)=¤ï“=7‰=2 <^M½ñ¥Xb;˜"‹½¼oê½L½ç£=^j=Úku=·¾‚;Ðæ=¡F­:I³=SY¤=]Ÿ6ñ¥Xb<,(0¼Yïø¼y•Ëñ¥Xbñ¥Xb=ÜZí»ê^—=§?¡¼Òïd¼ÊÒ:=rÚXñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<æQlñ¥Xbñ¥Xb½£ˆ¼¶¿Ù½YÅñ¥Xb½Ÿîã<Û)=ýШ=z<±{»˜Àé½ ¥¾½1l“¼¡îË<uë½;´Ø½VsL½¡Û¼Éé~½”øk¼^Bñ¥Xb½nç§ñ¥Xb=•ÆÍñ¥Xb<=CŠû;®V§=Fe»½rƒå= ÉK=¤t„=Yñ¥Xb=T# =Xf®ñ¥Xbñ¥Xbñ¥Xb»Ÿ€¼A›M=›ò=Âo°=þ’O=íz¾=¨Ã¦<”Çp<ŠF=’°ã¼o‡Ø=ц<þ <{»ñ¥Xb=¯¸¤»€¢Ù¼®_@=A—¹=@c²< ôùñ¥Xb¹Ó£Ëñ¥Xb¼·CÞñ¥Xb=°½l¿ª» =î½}:þ}ú¼3ˆ:½Öj7½„s</¼RT½”ª"¼tšáñ¥Xb¼ p½XQAºýœ½T”»íq)ñ¥Xb½%Ô‘½y¢–½‰Œcñ¥Xb½)Õ=á|¯=ß³=Ã}Ø=˜¦È=,r+<±?<ÚM@=‚Ññ¥XbºÀ²}ñ¥Xb<Èô7;×fíñ¥Xb½.çIñ¥Xb½Ýÿ=o@l>Dæ>x,=Òz×= ’);¢0¼ ³=ú=U=´¨=Å;ª“<Ÿ Œ<ø_¯=Á¾@½‰å½jT¦=n†ñ¥Xb=Oü4=\¤T»jAœ ‘ë=ûˆÕ= Ðñ¥Xb=‹áñ¥Xbñ¥Xb=%£É;„gÀ=-Õ1ƒ»œÒ×½­­s¼óGÎñ¥Xb½µÚ=Ù0ñ¥Xbñ¥Xb½m\½e8¨½œÎC½€}ñ¥Xbñ¥Xb„Ê=SÕDñ¥Xb;oŒ¼r¾=.õÉ=—ëñ¥Xb=5 ½r(k=ô¼š =—I«ñ¥Xb=ðôñ¥Xbñ¥Xbñ¥Xb<~u¼;ªë='Šñ¥Xb½O¤Âñ¥Xb=¸™s;5cÉ:Okwñ¥Xb½Þ4½cGLñ¥Xb¼/¼»Ž#?<š6¡ñ¥Xb=¡ Q=´Y=¦}=Ý<©><ô˜>xÁ<ñ8n=®0ñ¥Xb¼Ãhмoñƒ=R(±=wÎ=캡>x¼¼°…;®E=¬+€=’Tzñ¥Xbñ¥Xb=Z¹9`Ç»X7¼vbñ¥Xbñ¥Xb7=/MÒ=r„F»¡¤<úÀz<žŠj=§Õx=bs¬=i;ˆ=â»Õ÷ =,ɽ>Þñ¥Xb=ph¾º)Z;WÌ=]’°<£o+ñ¥Xb=+Øàñ¥Xb=u¸ž=R“Œ=M“¿=˜T`=Eãªñ¥Xb=.}½•MCñ¥Xbñ¥Xbñ¥Xb=»šZ=µïè=‰Ùñ=‚8U=dÁ=%æÖñ¥Xb=P-j<ÕAT<þõ=Âز=Rå(¼£Ð[;®hÙñ¥Xbñ¥Xb=ºh€=¿ÿ¡:S)À;I<î:B,:7Ä »³±t¹ì›):¤ñ9à¡ü; ž9€‹º~ÿ…»¸•ø»:ë½»n`5<)‚-:‰-@;TF:; Û‚:‰@T»KûS;Êõ–»îêñ¥Xbñ¥Xbñ¥XbºéÂñ¥Xb;%e—»üyÛñ¥Xb;~,Õñ¥Xb;.õ¼;G:W;N°ßñ¥Xb9øGB;/Œ@ñ¥Xb¼]z§ñ¥Xb;Øoñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»'^©¼nÇ»u¼;ͽ+»:®I3ñ¥Xbñ¥Xb»}¸•ñ¥Xb»À„óñ¥Xbñ¥Xbºõ'h»ÇQ¹»3—Ì»ôê;Ì—Ì<ŒÎ»Ý;ó•c»€n<±Cº¾­7ñ¥Xb<âi9Ê7ẵººÀº“µé»½^»_"À¹À­&;¿B…¹»•ú:ðÊ€»äZÁñ¥Xbº CÉ; <:¡]<ñ¥Xbñ¥Xb:ñ§p¹gZ:6W;¥»,T·»Ñ(ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»”®©ñ¥Xbñ¥Xb;àdø:û9;È:€ñ¥Xb;bŽ:Õ™:åªQº´w®º>µ‹»ºõæ<§Z¼ “–º6Ìõ»†ˆñ¥Xb;Øå‹;‰1B:Æw¥ñ¥Xb¹êó2¹Íïå»w8š»ÔÖêñ¥Xbñ¥Xb;³l;S·ñ¥Xbñ¥Xb;×÷ž;Šr©»T÷ñ¥Xbñ¥Xbñ¥Xb:t¯»;¯2;¼…†ºx‰ñ¥Xb»²œX¹/xŠñ¥Xbñ¥Xb¼lî¢;ž‡Ÿ¼¸iØ;™Üñ¥Xbñ¥Xb¹¶ ºfèç:µ»k²ñ¥Xb9Âaé¹4è;º°»çM^ñ¥Xb:Æq»~·Û»b5‡< W;…?ºñ¥Xb»l–ñ¥Xbñ¥Xbñ¥Xb;ƒ~mº¹<%¹mvŠñ¥Xb»ˆªˆñ¥Xb»Di»£n¼íxñ¥Xb»·®ƒ»¬cñ¥Xb9¦­¼t’º´æí¼¾»k@a<9µ¼$S–ñ¥Xb:é+";w;\\q;#ϼžºÑÁÛ< C%ºŠP©;$„f;˜€ñ¥Xbñ¥Xb:ŒcK»ñ¥Xbñ¥Xb;óÞù:‹ ¹Jz}ñ¥Xb»á¢ñ¥Xbñ¥Xb;fº:¸`…9–“;vÚ(¼Ü»ø¦ÌºŽlÄ»£ë6»ÉS¬BºÉ{e;Ë„Ô»Û±jñ¥Xbñ¥Xb»;­Ð»D¾µ:¨4<;»>x;ƒ>;Žäñ¥Xbº;†^úñ¥Xbñ¥Xb9öç•;.‚kºí,ñ¥Xb;„ŒÂñ¥Xbñ¥Xb;¦i¶ñYf»£ Dñ¥Xb;y4;Ƨ»c¢Ø»ª:K€Ö:ï»9½9ñ¥Xbñ¥Xb;Ãð‹»a lñ¥Xbñ¥Xb¼%Jº»÷ùê»Í÷»»ÑbÏñ¥Xbñ¥Xbñ¥Xb»»È»ðZv»Ef:Ë¥»KÎE¼T4,ñ¥Xb;ïŒ:ž¯7»Êðºñ6@¼F†ñ¥Xb»–6»ÅI¤;áw,;%©Ä»¸…;sº»X8îÜÇ;-ˆ¹;<ø«»²Jñ¥Xb»A³»ãļ"eìñ¥Xb»À µ;Ó?H:†{»ŒDr»„:ñ¥Xbñ¥Xb;y^»f»¾G¿ñ¥Xbº@#»—ÐѼX`mº§ 궲 »ü?Ç»G¾0ñ¥Xb»½î}< ÐYºÀG•;¾5›»Æ‚q»t@;–ц;è »Ð¬»k£ñ¥Xb;Z®»ÊÜĺ#Ý»6ܲ;Þð9ûö!;–N»RÁÁ;DOï;†Ù9+qîºÎÊŒ»>ñ¥Xb;ZUf9,ù;»v4»µ]Ž:v‘ä;Íäc»‹x:@¯Å:ê f»Q[»3.¹»ãb˜»Ôé^ñ¥Xb»¢ógM¼0 7‘h»Å~ä¼DƒP»•f[:zÒº^$‡:F •;I¦»:·m»è£f»!ã‘»Á[=ñ¥Xbñ¥Xb¸ó¾¶;rV¸îC¥8»9ÓÏ»&¡(;¡Þ»€©;žŒñ¥Xbñ¥Xbº“²Ç:ãÀñ¥Xb< €Î:ç+»–,Ê»Ôñ¥Xbñ¥Xbºþ€^;°w,9v§ï»•ñ¯ñ¥Xb¹¤ñ¥Xb;~„íºoÌäºâe ñ¥Xb»Œ×úñ¥Xbñ¥Xb;‚Ãñ¥Xb;›¨ôñ¥Xbñ¥Xb;î$;ñ¥Xb¼$o+:˜uxº•î;ß»ôYÎ:äÙ º2˜G;LwD;/;•é½¹úZ6ñ¥Xb;"µñ¥Xb»n×Åñ¥Xbº¾_ðñ¥Xbñ¥Xb;!éñ¥Xbñ¥Xb»~i5;7k»F‰9lÿ8»À —»C‡§;Ùx;cκ÷è^;-Od:ìM;*Á`»IŸ »‚Èâ¼ Œ&9üŸ_;#§¼;KÍ;YEª;~Æú¹=\:F z» Çjñ¥Xbñ¥Xbñ¥Xb:ã<ëñ¥Xb;úìJ;ÀZ¯ñ¥Xb»¾i ñ¥Xb»»hñ;;e:‘íPñ¥Xb;¨²öA»§{•;l¥•ñ¥Xb»Õ©S¼ #;j‰ñ¥Xb»¦wû#û´;˜ø;7f<ýY´áźÊÜÇ9½U9:Ó§ñ¥Xbñ¥Xb;C»‡uõ;üõŠ;B©³»ª((»x798²‰Y¹¯4ñ¥Xbñ¥Xbñ¥Xb;$&Àñ¥Xb»žšëñ¥Xb»‘F¨;‚ÛºÉG›»ëb »¢Þ<<‰‡(ñ¥Xb»k¶ñ¥Xb¼/%:º )öºäFš»œj®;wÜýñ¥Xb;ú{;´Ë`ñ¥Xbñ¥Xbñ¥Xb8³`{:hX;˜ÖW¼. S<ìq»)É–ñ¥Xb»àº;“5:™8,:Áû;Ësß¼± :a1 ñ¥Xbñ¥Xb;]’ »¯îZ:øù‚»¶7»›3 ºÞ¿pºV¡;:½¡;þ«ºc¦—ñ¥Xbñ¥Xb;Ê3/»£ª\;ByŠ»XyN;íÜ9øOñ¥Xbºíª<zÏhealpy-1.8.1/healpy/test/data/smoothing_3_11_config_test_smoothing_notmasked.par0000654000175000017530000000027712276746731030570 0ustar zoncaplanck00000000000000infile = wmap_band_iqumap_r9_7yr_W_v4_udgraded32.fits outfile = !wmap_band_iqumap_r9_7yr_W_v4_udgraded32_smoothed10deg_fortran.fits simul_type = 2 fwhm_arcmin = 600 nlmax = 64 iter_order = 3 healpy-1.8.1/healpy/test/data/wmap_band_iqumap_r9_7yr_V_v4_udgraded32.fits0000654000175000017530000045760012276746731027130 0ustar zoncaplanck00000000000000SIMPLE = T / conforms to FITS standard BITPIX = 8 / array data type NAXIS = 0 / number of array dimensions EXTEND = T END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / array data type NAXIS = 2 / number of array dimensions NAXIS1 = 12288 / length of dimension 1 NAXIS2 = 12 / length of dimension 2 PCOUNT = 0 / number of group parameters GCOUNT = 1 / number of groups TFIELDS = 3 / number of table fields TTYPE1 = 'I_STOKES' TFORM1 = '1024E ' TTYPE2 = 'Q_STOKES' TFORM2 = '1024E ' TTYPE3 = 'U_STOKES' TFORM3 = '1024E ' PIXTYPE = 'HEALPIX ' / HEALPIX pixelisation ORDERING= 'RING ' / Pixel ordering scheme, either RING or NESTED EXTNAME = 'xtension' / name of this binary table extension NSIDE = 32 / Resolution parameter of HEALPIX FIRSTPIX= 0 / First pixel # (0 based) LASTPIX = 12287 / Last pixel # (0 based) INDXSCHM= 'IMPLICIT' / Indexing: IMPLICIT or EXPLICIT END ¾a‘½ón½'Ú½º[Æe¼HÖº¼ºÙ¼€5<Í)<ö ‡½7÷ö<ñŠî½ Y;;‚á=¥}="6<§P=2fð=dÂÒ>áÔ<TA¼ŸÞ$==Ó=–Äh<“5=œ©V=º*>Vù=ÿwk¼çÿ=^3Û»TÕˆ=Tâ„=-5é<–)·<¯à¡=¢9Ä=€F]¼¯º,=GÁï<Óý‰=Ù y<¬%=¶Ã<ÿR<ü"â<Ôp¡<Ô2;=—%x=–ïB=]ð<‘kž½½hûÁÚ¼‹>½-‘ª=³ê<ƒáp=Q÷Z¼½í<‹‚=í:n¼ö=ê¼ ¶Ð=J;i=®ƒ=¾q<ÆæÃ=Þe=£ºå=é&T=™J=|W·½M¹™=g/H=ŒŠq:,‡2½¬‹R½t»Ý»¼ <§‰¼‰Ü3½O•F=@rû;ÇS½bí<½)„;„a»¦b.=)¼ÃÚë<›°Œ=8 »ˆPñ>(ãÓ>æÝ>GQ><œÄ=¹¦Þ=Ñ =|PÚ=Ć0»¨°“=´,=dÛ›=^å5=;§<%ç+½{öx½|…ÿ¼ßz½<ÌNM¹ÃÆÀ<šÖç½ISÔ<¯Èº=´A‚; )P;uì¼H®\<Ãya<èÎ=*î‹<¸b=o!a'Eë>É>%'=þb=ÿ>=ƒå=é©Å=”Y=–é‹=S­)=}¶e=Ò½b•k=åa=†\`<Æ>†½!ÏÓ=¹øï<§¥ó= ·:=Ä=‰C;Ñþõ=Ûq¯=‰'N>|w>,o¹=CÎü=“Ÿ=…VN<`À›=RÀþ=Q\/=OÁÛ=Dvë=\лðÃ]<Û´´=¼òÄ;åå)"Á=²;ü=W›…=)‚U=K-K»pR=µ¶“=€:Ó=âr¼RÅž=Èï= ˆÈ=¹à=¡ùÜ;Æü=4Ž?;=Æœ°>½×=…Æ=|¢@=$0°=ßã—=ƒÞ6= 3±½*0¸=g·Í=ÜÌ];=–&=Ó š=Yu =–ÝM=œí<=½<Ѥg=*ß<ÂWu=}^<=Ï@>··=Þ½„8=0 ˜=D‹A=)«6½4Ô <ÄZF=Uuc¼Qdr9*õ<ÒÚ;Hú½ED“=ˆJ_½(q»0Ãk<ôÃb=`C<¢Ú=…=šÿ@>1dØ=Íò>ã=DTÓ=ê«Ê> Œ= лÿ«;‘F <îw¼ÌUÄ<Š¨=nu«=|Ÿ=Bo>ߧ=¤ÌM<›a<ù]4:ç}L=…’·<"ù¼w<5@ä¤7=‰ñ¾>1lþ=Chã=é\;øÏ<­±Ç½-C ½fí+=)R0=[¾S=©xû=¿Ç=Š×Ë=š*=X•ö<ï3<;2R= =VàÝ=<ïÒ»øéf=!ÝD<¤2Ù½#jg¼÷rF=@{<]Ù»=BG]=Ãûð< }}= Øû½K»®o‹¾»Q<ÌPg¼à5ú<ÅÀ—½¶·½C=ž:¼Lm=#ÿJ<;A=\-"¼åhº=î<„Ñ=Ò¿Á¼ºiþ=µO=…ƒ‰=!RS=ÆW=M‡ÿ<ÃÖ=P¸`=¬FB=Ķ=Ü}í½)?3<ä¸=Œ!«»Zô>½ 4ª==Bf=ïîÅ=Ϩâ=z¯N=j<ñ:Û—=‰c¨=º ¼¾Õq¼«º <'ÂX<•ÐL¼á>Œ¼ÿ"÷=´7½ë÷Ó¼{@Û=£ñ¼ŒRˆ=*:λ¹{H<?½;λTŒ<ÿÑÌ;æD†<—ïH> f;†„ã=#³=¼‹i^½_+Ê=œ7<=ºF€=‹ï¼Áâ;¶é½PY,¼J¨NºËyÍ<Ô§½¡^¼”ßñ½Ë€½]§½RÜG¼¸æ^<žN<Ш4½1Xþ½%Ö®»8Œ8½/µ&½*¹<¼ûbˆ½7Ò<=u ¼k9<j =‹ÚY=;„a» Í¿=¶: =$™<öÛ=¹ië<~(=Aà=õ:<ÑŸ¼°µÏ<›‚¹=AX•=LÓï=†¸g=i ©<86=="È> }½fTÚ¼~¼ý¼8=Fä¼{šb½Wþ¼¡¨<.Öõ= R<¿¢;½ë“=7<Û^Ž½l"œº¶éï<¹<Í%…<µ1ð¼[У=Jì=ÕË›=Í=µÿÿ= ¢Í½Ÿa‚½•Ý:< “µ;#£<Ó¥N½iw½6%‹=&Ø;<²6n=Ÿ\½;ú$½CÄÞ¼ÇgÞ¼®Ç¼Bf9=l8=1²H¼Êå=Bs=_²<ÐZ'½ÅXç½Ûçú½pq4½ø¦½žú½§ô¼"Št;GV=»G <};M=æû»âŸñ=„ê<ÑE=+…=/ÆE> *š<´É:´é=ÏémÖ=aû£=g¦=I†‚=€m =±U;=Ž€ç=†?=‡rƒ=„úE<Œà1=/= =.Ÿ»ïÈ=¾¸ó=ÅÛ€=43½),=­Q<þ/<&绨w½¾%"¼Hl½–¹=UúÑ=Y•—=¬*=²X¶¼šie=Eõ°½ D ½;Ó<_”M=l^/<$+Æ<‰½l«»£Õ齓¹d=O¼¼=ð̼‘Á³½›Ä½€¿<ú%ý½b]=)–ø<£»Š»ï1Ë=BŒ=b]d¼ñ™½˜û=êž=+JÁ=Í!ż/ C=`i½6ýï=a;åN=”9‹>ä8=Ã(á=­_$=®ûÈ=v=Ÿûˆ¼:—?=»+Ù=ÊóºÔ½» ûì=*éN½.롼Á§P½†U<½ â5;ÈÔ„=1ÛŸ=¶,:= êÐ<[RU=Û¯­=¿i<˜PS½4™1=Wð¨=®!Â=éx<®¬;À.‹¼Í¬: PÐ=_<Â|=DÆÛ=*¯Ù=>Ǽ¼2½VÚ¹ÕEÛ<Š%V»´,{½ë<ŒC#»¾Èã½43„»^ä½è ‘½ºJJ½‡«½™y!½#ÿ¼Z¿O>Eúv=FI^=`ë}=®˜·<ÿ@=Øì=¶©±=¢ê%=ç¬Z;¾v,=‹qE=(X=¤Eò<è^N;ñºù¿¼³s=š&¥=s‹=}[æ=N‡ó=D· ì=¬Ð®<Æu?½A;.þó; lÒ;xȺß„»N¼<¾‡;OÕZ;” º˜k9»?Ÿ:~9»»Œ‡$¼S;‘}ÿºü˜;ÁÈÕ:¶ºñ;«ëzºE•¹g;Y6d;/fç:%b·»ŠW_;¢¬:$6»H"»ñ_-»H§;HHâ;9ßi;=©O¼/D;“†=;œ² ;j{»kš¦»¼ÇŠ;sȹiY»¸7;Ï6„» Ô•ºÄoŹF–»Éš@¹ó…›»VHƒ;­µ»—™‹»ú““;ÛaŽ9,R.¼%Kþ<CÐ;, 6;ˆæ`:Ñ£†»dˆ{»ê‹¢;‘e¥;ËÚ<#Lº§a:º4X;\Mb:¿cK:¸óÞ:/Ÿ~;‡p;å ú¹ª; ¼ö2»n>Æ»±Ä{»%Ѐ»Ô溸qk8ò©xºD@‚º o¹ôÐÂ:´':ÚN;™*:¸ß» Ó:ºÄ.ñ:»>::Sþ:Úȶ;‘—n¼ âi;¹Ûd»Šø¼*ˆªº¯ê1¼#»Yi:ßà»:”À";ºUª;†ü»í³;±u <ÆT;‚½½»áœT:0ùŽ;‚‰»B G;ÿiº¶B»3È‹< Ì<(k<8Ø;»Tœ[;ý#yñ:Îr&;,W:œ”½» 1f;`Êi»çQ¹œû;•Ìþ»û}ºÒt$¹—¨8®ÛܺªÉÙ;ܪ‘» |#;©H 93‡è¹œ¦»š<ç;öT¤º‡Hϼ)ÉÃ;1T ;·‘;ª?‡º¯˺éï» ›µ;‚dP;‡Þ°»‡é›ºŽ,þ»”z$»_ò¹Ê|»*Ç(»÷Z8»{YÉ»Æim<¯Z¼ÇT»Uºï·¶çj;ë9Èqɼ<,ºa¼Zð»¯$ä;ïŽ]¸°f·;”Ä©<dž:ù–ï»>â”;°ºN¼ Â59³;«¥Õ;*åà9þ »„Ñ;úºÉ2Zº€oÀ»r!„:Ž"¼%Çõ»² ©;!H:Ñ‹p¼ ™Zº”ßÑ»2,ë»ÉÆ:E º×¡ »ƒ‰»Üo:¬v¹”µ;‹¾3;¤5»¨>(;>‡!º-WË:¬Øм3`9‰x;’f»!0;Sã»™›ö»Ȧ8h»»‰c˺r¾»æŠ7»Ÿ`®:¨;>ý»x9®»·þ»æò»ì³ø»µü»¤÷—;°„.» ;Ù»¦f;‚ã™;™P»6ýy:‘ãºWåÕ¼ oмÍx¼<9ã»æL绦£­:±F.<í¹Âòmº–b”;E ;;Œhê;¿®Š:I¢»€ÝE;ý¼Ìº'M;-Ù㻹ºã»¼K»Egtº;“SºÒ`àºÐ«§:7“¹§yÌ;² cºù|a»nY:ÓÔ¹J»®¶ ¼&‹ï;kÿgºÄüá<;h†º49ÏÒ:H{»·x¾»Œ€»´ñ»ÆHu:ŽNϼÏn»·˜ˆ¹Àj;оþº¥ZÓ:pFð»:þñ;Ÿsº» At;¥:Ý»4,»ƒF¼ yé¼*8;€D4:ßÒº÷ís8oé;µÄN;I K»ŠÌºíd÷:Æû¢»å”»–7ñ»ËÄÊ<4¢¿<+ ¦º»¹¼i»ÿ)È;Dõ%¼$¼ç;ƒ÷=:»å;‡ž;0‘…¸¼@9W : Y.¹Ó°c;eºå¶˜;ˆ¹º•³Ï;ñ4:Œ¬ºfUñ¼Cü¸º>ó»÷£ü¹²ö§;>Áö»³5¾:BÓ…·ØŒ¸:˜‚Î:àüöºÙD»Ç á»£W¹Œ Ý;MÑI;µU º…¤ë:)d‡¼õ¸»Äººž|¤»‚qK;~uºB¸É:¤ô׺ÜU:±I­;—ç;P(*:RKɺޖŸº§•»=x;L2;G¤¢»Š"û:TpU;¸¿x¼&—ô»²â»‚e;u,»‡`.;zÕj»âÐÕ»à19œ º•†»Í—>¼<þ›;¾<+ØŸ;¨ƒ:îÔṞ2¼  <_ˬ;¨‘Õ»—CQ»õîž¼M;¶Að»°ô´»6`ö:ðG3¼"0F:g/ »?X;¹å)s»<“…;ᶻ;¾µ;;Gh<5Ç…;SL<”˜R;Tˆ;‚™W;(;TêY»(G;R§~¼÷=;’:òYôºÑ+EºÂ!9@ëÓ»!‰Ù»\§B;ªu^;„»ÑÖ»¹лnì9´Õä:û;ÞÜZ»3J»×/:ÿ¹£Ë€;G¡;µf;ÔD_;¦u¬< %º`†¯»;ÉUr:¹ðºé&Ö»èdœ:¨ËŽ:â̧»oÓ®80•:Ëع˜6:X ><8N< Qœ;¹ º.¼4»m.»¥ã•º7ÞºÓ“¼ƒ$»•UBºíŠYº§ệz´<Õ»<2;¶ºÅvÔº“sB;†F—¼E«.;”l:sqî»ÃÞ|¼^ù: ‡S;Á,4;\92"o;²9Z»„¼DX¿:P:™ó¹:¤.;Yím:B“F» y‚;ˆ•{;˱M»*¡»wB:;^¹³º K;¾ÉVºÔÁ·;?… ;¼3®ºúqV;L²·;[†÷:û=O;u1Kºæ"‹»‹;¦ Ä99‡;»&Ïí;)o¼2ëY»}>9¼#©b:\J;ÃÔºÕþº¤Iï;AÈ;ÔÙT8߸Pº&àu»=š;›½¦¼!‰;ý>D8Îä뼸¢;Ÿ”ý;@A;×ß;T'‘9/+i»#÷,º«ð-:EÑ»îÕ»s}}»5X»übÛ;W¹x»0'ê¼9¡ú;).:ŸË¡;på»\¯+;$,ºËÅ´< »–uÕº¾Ü;oÞN<Ø£;r¼Q±Õ»O#»LN-»Þ¿`;]w¥:¹º¼mÖ;}.;»‰ï:kT3; ©;’ôP»â‘t»”ªý;|ãû< A» bS¼(6£¼*¢º}à,»ï¯;‘D!¼ 4»cä¸#iÃ;2š»BdÜ;,Da:—{»oª<¦o›:îÉ÷;l"-9ßGHº.tº²D< s9;|;qÀ›;²óûÎÈŠ<*ò»ÀÒ­ºÙÐ(;è´»7?”;IÔ´»Íu;¥@³;ÚýS<µ¯ºC/«:1ê4»#RÅ»ª¼ ‰ó¼'ÀC;©I;Hn¶;â7j:¨×»”ÖÒ;Å2I¼l“Ÿ: Ø»#ö»æ¶;Áx»œÔ'º.Gz:B}(»Ämž;) ¹­ .;£x¸ûƒ6<÷P»€.ô98âÞ»Æë:‚êíºµš»‹²»>™ÿ¹á—y»¬ž”:é9¯;´>u<êõ:ôó;|O?;¦èÉ»+Û/;£4U»4'»Ër+»ž \¹ç4V;k Ù:ä)¼~ˆ/;@Ž<;SØï»BKM»£ë»p§³;GÃ|<9ø:Ý ;‰S/;ȹ¹ÂÎ;¥‰H<4•—»ð«»µà»ó„;ˆ¼ ag¹áÚj¹²¯¼ðÁ»_êQ9®Á/»lrK;äû‹»·ý­»åm·:¬#¿º§a‰;‡Ë¼»aòǺº%P: §i9ÌÃá9A¼Q»Û<xœº:¬:|Ö·]C ;„t¬¼:¤A;û_º""Wº0)t<ý ¼z}¶;‹ß~¹,Ï» C»¥‚´9ö…Ñ: £»é'<3sY;Ktj<ŒÂ<%1Ã;–Ÿö»M$<;ö¡FºJóÖ»‹¤â»‚¡Ï:n-M¹Ôu »‘eù»4gÓ;z–õºóI;9Ç: »º·;ÓÃ;’ä­º€z»‰í; BºƒHÎ;lž;伨»W§:‚®àº‹Ñ9M±Æ;Féú»Ð%¨»­E»WAÿ¼: (;è¿;Â.9Ö͆; 4º:å["¼aœ½ºsGî;ƒ/Š< ªc;ÿ;ÛS< ÃS;ïž<»Ò[ºTÊœ9‰Þq;¯äÁ;èî<'íÖ8õ¹¼õ,ºEÌ89ï4¼ †¼l• :›+໚: 9×¢^¼#:»¡Ï^9‚™¤»Bˆ;…¼b»©#¶; o»_˜¹¥ÂÐ;KŠØ;ÖÑ€» v§: ±s;Ôࣻ»±O»4¶´:¬ßg:û$c;¯Yº»¦?º¹-;Ÿ:7‰úº‡ùÚ:Yš»Ò.¹¾ͼBu9È>ß¼bo¬; ‰q:†}h;åÿè;þǺä^Æ;xJºKÓÆ6ß”<7<¿»/ù6;Yü井—ʺ õ» ‰º;T¼O;àé::u‘ü:¢컎=¯9€©“;Fbˆ»ãÙº¢<ñ»õ0p;ÇGj:Š ä;ƒmì;y»‹ †;„ÍS»•¥å»ôè<‚Þ³¨À=¡ƒ=WôS½ ¬¼€Üã½n=¼’‰¼»ëÂ<²H=ŸÅ=Üóå=bÎ=ZL_»#=o;çô,½)D+=ŠA¼Æí¼Îõ¯¼u+Z¼ˆÇ9<{ú»Öq=W> >E”=ÞÜ=ÓüÇ=»Äæ¼Ý£ó=f =ÂËG=>==iÂ=…Ë;ì.M<›¨ï<~’=pŸñ»÷X<¹¢Å¼™>±¼–8¢½Ñ 0½½QO¼-ÎB=`Ã<þ<½k¾i½‡‰½hu½¾“C½û7w<±t'À½@⮺‘Ä\¼Ã«ç:é×=¶4½À½fâh½Iʽ¸ ½¸N<~š=ʇ¹< JG=½êO=µþ"=³ž< ›ñ= •¶¼¨,¾»¢Zr½4h'=€g¶;þ;»æ=•úüx½?QF¶/¼óc=E"ƼӲ<¼ÎA¶¼­C‰=ii =ØÄ<>¿Á<‡Ê=<Âw<]yÛ½6Ëö<…f<Õ¾Ó=a=q¼ü]ª¼Wð=Ýo»º3â<…Èt»´/ü=ë<¢ Û<î‘=Pðö¼(lT½=Ñý»q*]½?[`=S<îe<êºð=“›ì=:–G=Çê=±B¾¼§ ½£¹ ¼ó¾½eì`¾ zq½¡õƒ=¦æó<@ì=µëù¼Ã­É¼õ:N=ê<ä==nc&<æUÇ=ÎG=ÂÒ>ºš=M¥=Q-s=ˆªò¼”&ˆ<Ãm<Û]Æ=3¼R=˜ ¼¯ν9ýo<\jó< J¼Dyý×Ó½6[e=²~<ªÈ„¼sw³½Ê7À½6¼â(Ò=“ç$=K—=¼¸»¹ÍÊ=)ü;7V‹»Öwƒ½ŠÑy½Rål<ÅÃϼÜÃà=c¹ˆº¾ï=µ‚¿9>Zž¼bsɽ…h¦»û<œZ‹=Q}=¦^Þ=M9 »PÐ(=,{Ð<«Ú"=O¢¼¾¥½½ATS¼ÀÉÞ=å$=$­ì=x}=DvÐ;É#C=ryL=ݽŒ‚Ý=Ëu^=«n'=øʻڽ¿Å׹˴G<ÊÝ=Ç=.Y§<õÃN¼*Bñ<Ù¼ö³Ý=¢ô=AP€¼ˆ7´W>Mr=†YË=0 Ý<¯•‡= Z6=|9|<øÛM:Œ”½?¨»*Ò<)Oý½#Ž ©=1¶¼‡+<šç½<âó<ù,|<ÝÊš:Ç€ ;<º$½}A<+~ò»ÁP4¹H׈½>¢ò½;ÿh½Ï«¼’¯Æ½,ò¦;|¿1<€{^=CRš¼>?»·zN;Ä{r» 3={Ÿµ¼þ‚F»‹»=·ú,=;t=½¡t=ñÞ;ªþ›¼Á$û¼B;eѼ¥ù½ñ†<¦î¾=.Ó=Ï=d"H½$Y¾<‡ÎÜ=Lº$éÈ=†ó» c¼¥>½)ø*¼µ/™½ÕR/¼Çï¨<犳=͉=¢;÷¡¯º@G»óLø<}˜.=6™È¼Åƒ3=7Ñœ»0nC=!V=’šá=Ú©ä>*u+=œÿ“<ÞþÎ=’I> rr=‚$™=Éu@º¯9B»Y¤;]ªî:Nš®ºÍGø;rÂpºÔè; n»ìĺ¥Œw;Œ€è;@3ͼ)ÍÏ9¶EÅ;4„;zZB¹ë´K»ˆ‹<4'¾:ÚN4¼#Âø:SÕ%ºžáÓ»û.; Ð;U¿ä»ËJ®»Æõa¼ÔX¹T¡?¼Z&ºÖÉw»&¤;ö5½;G­Úºª^Mº’…/ºÌïɹêÆH;-ñª»ü3ºšQ;Gôì»z9Œ£T¼Æ8»JSñ;¡=Ÿ9­Çn¹m;ðfš»ß‹Ô:¯GÉ»ƒ];v9ZºWdXºé»˜º¸- º B,¸º¼Á»Ƭ¼Cé»G)[º‚g£»§|»‘·f:Ù“¦»!⻚ó;Œ3«»¬Ó»I:$»™TX»î»È8wo;u÷Ž»®ź¶Šx;ÓD;[y“»«Rl¼Û$;ݯ;‘Âü;ªO»š*yºmÙO¼!¿¼,:¼_»í-[ºíí]»´±_» ¼:ŒÏc<e»ÂCg:óàwbW»XĺáC ºÄE¸Aô&»ƒ×Ѻ§ ñ»4ãTº’Ð<ç8;.»]I±»nî?9T‰;E˜Ü;ºÙq8ÖQ|»u+:y 9…·»‰¤—:>¼n;¾8P<‚³»}€»´_%;Иñ;-á:è@p»:Kè;ŒMÖ»™¯â·ÍÊ:Är5:Ÿ •:²zA;q6âºñù;©»ƒ•e;_U»¿:ó59ûÇ»?oºíÖÒ;‰ðh;ÄßÈ<×;©ºeã<6š ;B&Ð;Èq·»kó ;\Fƺ‚/2»˜’S»S–‘»pvq¼±Ä»~ñÙ:Ø.:(º "» 4‘»˜<ë:Eœ¿»Ðo¼$Má¼YU]¼ Çz<:Σ; #‹»SÅÎ<šÏ;'k¼e>â< ÝÙ;†òÖ»°fr»‹áU»’áK;,ë{<:&»¶Ëz»²{|;Lˆ£;.÷¨;[†š:CÔ:b ¡»‡‹¥;Âr2;Þ~G»Àä@¼,˜ô<‘t}:ŠÛcºÛ <¹QýÆ;& Ý»êÄ8»ê º v›;$·ÞHí:›3z»p89¡n*»£mϺØ`»Ô!ºžÚë9k _»Ý!¼T®;É^ê¸Ø¬J;äõ¾;NGȺڗâ;9=»mËy;²ÙJ»­X;óÜlºÍ¨;KÎ 9²@»QAE»êb_;$ç:ø8;Näš:P=;¿wp»(CÏ;PI¦: ö;æ®å;úN;2¹o<w»Oœº ´w;æ›>»>x”»+ª%»‚Q¼ÓH9—ż:´ðû; !­»Â»»P*Ú¼°»riк“T¹$Ǽh iº1›O»Ýv;Ü‘´;ç¿Ž;›DDº-ž;ýZ»#¸¼*G=;÷º]C5º°¿;”ëRºçâ³»¦¤Ê»Eò5;¢Ãƒ»ÚÚ¹:Ÿ#…;2§f»ò›Ô»IÔ/¼ô»º&a±»¹‘Ê:Æ°!;ª‹Ù¼!¡Ùº•<Ð<ˆ=8»cú­;†6;»Tnõ»ýR€;“òôºîèü9%É8»¢Ú:R÷;ĵU¼‰ñ<6PO;¨Î¥< —Â:‚ :Çq™< ]<¼ Oo;…R­»U+»r»û:Ç·4<UÖ»_ºF…4<CoºfÁ9¼ Á¼Áº»ÂE;j~å¼Ü 96{á»Ô©‘;!mº`ï90ú;@»ÐË´»Y /»¦r»yŽ˜ºÊÊM;-µ‹9²¢»¸K;R×½»xf»‚2¼"ª¼ â«;½•:ŽÅغ`Ö;×½ù:ÃÛ·;)6º—­ˆº†Ä˜:q~ºIš»Á;ˆ¼ ºÓæ);†W»r§7‹DŸ;b2»<<@);j£»Ê”ûÄ­;Œ=»†ý³;¤I;cÈ};!Ž¿»º>¢» x—ºlŠK»µWܺNg;Uœ; ñº€|!<Ÿs<Q‚;‹' º8»XFɼR4<â³»åǹ:Ãb^;*î;Ç~ºÂ’J;D!uº ÏZ:4Fz9Éò»—ÚOºàå½¼rÁ9Ö9¹§I»•ÕÕ»AÊi»ù2z‚>;z÷F»Æ;B9ûpƒºûõ©;l}ݺÀ*—»Ì»\¿¹ûó]¼£A;» û;U—$:ûÌ‚< K[;­1¼'9g: ã¼5‚ê»j; w:!'9]Up»éBæ»àú»aÇ9(–9<$QV»lyÈ:ÄÄ»÷\Õ;$s;¯\©»Ž&l:دG»®£¼;Àº±Ó)»Äç;Õ—ç¼ E»Ó°;h@l;¥ŸJ»Û¿Ã»]*ƒ;ô‘Y:¼¸@»Ð©’;£;t(L;56œ¼6&¼;­6“;—;Ë‚;m²q; ŠºëÕv;ói=¼(Ú< ŽV;tše<&à<ž]¼"o»YÝ»³ºŽ¼2[5;¹ÓL<$*D:Áš@º¤1Ž<·G»ŒÎÐ;ˆ»,<&>qºžiy:Æ)„<"XÀ¼;‚<ì=ºÿÙ¥;?É©ºh(K;vJ »m«:Ç¢<Sþ9ÍäM;‹< ;P™:sŠ4kºœà »v™G:Œñ».å};q]ºŒ/ß;€ÃÈ;bF.»†8šºw¹Ô9üb»ž¢s:Ìþº‚q:Ëÿ» ));­ºýdʺyAŠ»Ø/c» #9ðõ·;ÎÇĺñ€Ú;?%y;̃ç»Md»"Ìú;̬Ž:5™÷8ýT»Ô~o»êŠ;È"õ9+dÄ:–¿a;R™ºAƒ ;ð :»D1/»B(L;6q:l¸’»­o4»ŽÁ¸M$7<>eó;Úù5¹ÈÓÃ:¡Â.;wM,»}ˆà;™LÒ<²·ºfï+< Ô»Ó»¹é»Ñï»uó»è-»D®¦9Ë,]:á>}<0  :Ý—¶9£Pi¼|ê;@ºüY“»‹ÿê;ŸCºÚ?Ý»oÛºK¼Ê»¸j%:†l9[x\¼*!Ö»ÿ ;å]»£:9r ;½¥ºŠ?;纆…N;¾6ºA¼#:É„­»d Y»ß¯‡»—Ä$ºÌ‘º´­"»'Œ»NÖ‡»,i;9'b:WËŸº+ëλ»}À»‹ò0;0N;™ ~¼©,»¾LÚ<|ƒ<’¨–»£}¢;U}¼¼YÑç¼\&Œ»7ÓD»à“ó»ïŸ½;ˆ‚»²Ò:=AG;ÈøE;Žƒº:‰tÎ9–+°»Æ¶¦<<ͼ+ïÚ;¾°»©9SYr;Wê< Ïừ8ÿ¼ CλcªºÀÅ+<74:óI˜;¥(ë;ô¤^9Ô.Ô»(·;)[~;ô­µ;o‡8:Á{F¼ ™¥»×ÿL:ˆ'» ”¦»©‘¢»ÖËÄ;ô‚d»Nue»]Ã;:l+ˆ»ì,É»·é<ôú¼+ø:¨:öÇ‚¼áü¼B¶Ô»,1绫;; ·ù<1dÃ;—5&;4ìß;LZ¢ºJ9)';Œû;½ÎB¸ Ÿ©ºêñ¼ <¢,»˜Ñ|».œÊ»ÜŸ¹Š  ;/C;}ºó¤¥;‹ì»¢\ž»Ð&˜; ]:³˜<2§t»q¹¼¯Ý;êã;ÎGd»³hyº Ù`;Ësó;ÁG¼1E<Ü;”‚ž;é¥;‹Ê²:ªÆÒ;¼S©;7ÖT»מ»$;’ŸXº:b¿; 0r;”Ñ›»·H]»VŸ‘» ¤Kºát>;³;Dh_<ý[;ÂL3º¨øV<–ý¼7;R®1·:»QÖÜ;ˆÆ;“+»#Ør;KƸ<€ä;*<;±ÀŒ»;–4»K§‹»#ö[»WG:€bºç7`»X:>@Ê»õ©Æº<“˜º‡õ…»Œí™:ÚÁ:=wx:Û²Ú»ËÒº|Z;>ç»` c»;‰»r»:ó»’° »óCI»O]»…¤%¼;-»»„xþ»Ëo™<&-<mŒ;£¡Å»‹±”;mùºCF9íÃr¼ÀS¼ f <Ç*:£á»’àO;zˆ”»»Z»;xW»ÂŒØ;Û¥§»GwŽ;ö»&ï±»„ó⻽¶É;W‰P;çÀÍú;vº]»¾Ço;i¢á:èâÊ;Ùó²;B2•¹õåºDÎ~»•;“Dk:½«g;Ï–©:ïŽV;{îÇL¼W„<4¶¼¡•:ÿÛÒ<0¢c»”ë껪e–<6=º» p:ˆýy;Æ¡º=scH="fZ¼0ËZ=‡ƒA½P½4X…<dk=¡<-½br ½DÒ%<[*½m& ¼ë¯è½·8µ=¼a_<=Ù彔ƽ­†ª<ÈqE½pˆ¾ l½7ŒÁ½žÞ¢¾ £½œe­¼ût=e[<—Ýì<°u€¼xª‘º0¢=lô=íä >ßÚ=Qî=™l¸=òÍ<ض=ˆôi=6ƒÁ½AFȽ\)0;?¤½_@½K¦º=-ß =Yú=V½MG½‚—½<ÀLL¼ªó¼:K½½Ç´¼êʳ;×ÝÈ»©Q¼®FÒ¼¡Ü=.<ôq½2ãμ¼2»ºÁÔƒ»ì(H=Út»=¯Ì½ ·à½‡™\½É\Ž½va=îô<¦¤¼ƒiu¼z:ë¼M{b½Bu1½­‡<Íâ[>t°>È=n <áâ=@}*».p¼(­4<–$«<P¼Ãd»iõ¡½Ç„õ½»ª…=·=]_¼[¡•¼…‹~½`¥ =B¬;l¡¼®;ö½–™ÿ¾ Ž½÷½ˆqA½‹Ì°;½†—½Ãv=/„Á<¨!f½¥L¼ô1ò½dÇ=ñŒ=Äj=ÒôË= ò<Ó„W½¼?X=zþe;ð=ü¬ó;´)y=g?^;p—+<éΈ=tÕ-=„£I;œÀ½=Îü=d÷»â »•Í.½Axs=&Sºž÷<¼˜€—= ßO¼nW¡¼½ÏK5»úP=vo•¼€÷n¼Í×Ì=2ƒ0=™‘[=Œû‡=‡ <¬‰:=q#É>ÐÃ>l´=âwû» Gæ<0V=»‹0=Ó¶<ò%Q½h ´=QÛœ9ñ½½&S¤;­s¨½Wî½ö~\¼¶cý=\p^> b=¤Ö=z8¼ÌD»“.%;ö3ï½*€‡»½ñ=ŽŸ’=²‡ =;*E¼¶56<Ð(Š;|Ýð=ÏÃÉ=Œ¤´=à!P<¿@&=¬´=ú¹9¾yø<ñ5<¡ <íüZ=AºÊ<ÿ ¶=ÂÑ=K‡<ÙOø=>¡¶»•_=<â¶=9™½‘ù„¼üE%=°‹L=¿éê¼ÜLq=ŽH=‡Þâ»óIÚ<¹L ½º×ƒ=!“;Qš<¶œü=cü7¼Â÷b<¾T=²t=‡—b¼¾ñ9m¦[½ h[½ UÐ:ài½A\n»í;½„Ih¼Æf=Ž\Ú<¯ÅŽ½ˆN¦¼M™Š=¡`½ºRG=PÛ=(½<Ër<=$K=`‚ =ªG&½yJ`<}¤9<±\É<„Ü£=fíä=¡gß=pºø=»4è=ö–<‰jÛ<˜þ¬=h}o½$þ†¼4Ë˽U»½œ/C½œ­y½äÈ´½ý<¥•<]ë^†¼‡Ÿ3½8÷# E÷=ûAV¼²°Q¼§›É=bLš¼`= ²ºXI½Cë½hݪ»ìef=¬= &µ¼—P»ôKÝ<»Æí="o¶=Ý=ˆœ=€•/½‚·³º¦Îz=΃~¼+2=Jß:²è‘½C︼œ¨¼“Ÿ’=ÊA<ò‰Ï=™{ñ=­Æ¿<%SØ=la<–F½LèX•˜=y¼ž¼”±»dØ{¼·¯Ò¼ˆÊý½çb‡ =1=i`=e6Ÿ<{ÁÅ=‘ÜÛ<ÁW弸Æ=‚Ć¼—Å:={“=-Ñ=èm–=Å"\;õ: =v ;ú¢=}ïG=š†Û<ÏÍO=›ƒ©=L&¼q¼’»X<Í: ½Íj4<GD=F»ŒÖ=$Fž<ÆLv<)T…='¡ »O¢§½gd7<ºp`=(½½>™ñ¼¼Ú‹<òJ·=H\=R˜g¼&¾V=„/ê='|{Ø5=ƒÅ¯»¡…Á» 4=r…=^Oq=Ó®k»¨º3<<Á&=N|U½†±=ŸX<¥!c=¨ß=wÙý¼뼑 V½›4=!żýÀu<·à]½ <íB«¼¹0d=3/ã½çÅc<ö°ÿ=†Œ¼å S½^ð²½ð1½ ®Š½t½1¸¾<Îê½4@i½ ´$<»MÆ:}!Ù=Ñü½=‡¨¼ƒ·(½½Ë4¼–Zø¼bÀ;Q¿Q½"ñ8½ho7<ü=„òß=ž;åÈõ»¾Œ<Ü«x<ííý½ û„<ëQ°»®¶½Ñù=¾à…= ô<OÙ=M©= ¶€<èJk;¦•X>¶>\è=œq=L6> áÞ»©<„×#<ÖS$¼«Ö”¼¢Îœ»wÄÞ=è$==/=‡½µ=΃¦="rG=îEx<çœ[<òð¹=b#vŠw= h°¼ Ä8½¤Vj:Ü}齆ǚ;qV =X份ñ´½—nK½ëœ#¼“ÑŸ½uô˾ c½7Ã=diz<ˆÊ <÷Þ=²în=½¼=—G=à¿Û=ð=Tê» ]7=M>Ã=L‰¼Þçð=x<Ðœœ<~m¼ùq‡=s4ø:t½=¥¾½M*¼jû =eè =H>îõA> [±=™`²<øvvÔã=“èL=½Ùô=Ú†[=…\ƒ=•“¼èZ½£F¢¼*d'<™sŽ½’™ü;Ñô€<<ð½  Œ¾ ²½ ½(99½Š´N½Ö&@»Øz=ÇùÏ=DF±<†: <¨{—¼QÐG=:“=‘î‰=ÀÁ¯:W*Y<>»ÊÖU»L¼m»Ü‰Yº(>;ÒÛÚ»‚½:5ôg»ÆwϺÂ`¬;×*ºÙêÊ»kÂÖ¸Çw»îC8;W껡'É:¡¥!»™•f»òu¬;‚u@¼(–惯<,·k;¯:i;ÐäŠ;¡;)H÷º”æP9¤^º0‡»-Ƚ:òU(»•-º¡,b:Ù¹ý»šT:Ôϼ  » û»åL»É§L:9ÿw»Ì߈;<³:£Ý2ºf7`&›:Wl’;ðÁÓ,:»:¸Œº J:A¸†;b;|¼™Õ;­t¾»¥z»JÜ;¿N±»ÿŒº–Ï¥:˜ÆJ:Zol¼ Ð×<;÷»¶||;ùa#:åF(<:y»Vû»ÒÒ9|wç;ÀYö9¾†ø: lg¹gö¾9’·l:L‘ã:ÿv°:4H¹›¬Ù:¿l³9ä½#º§\Ú;Ùü»¬¼»uå;€tM; ¨ú;¸™;§/«; ½¼J§ì<9rÅ;.µ¸ºÌ)¹;¨Ó»Hë†;ÞIK:#Ù”;ýb;j,h:ßxm»G1º-]Vºí;! î;¬ÂS»€ » ¾S¼ ±»õ¥t; ™[»üL>;£uà»ìj;¯Ô¹:5ý¨;ú÷†»Œ¢ó»KUó:ÁZ;ÉÛ:¡—¹D»F±»Žág¼Cä‡:fpW;¶—¸®>$»$/;8é)Ë;Qè;û–¼vƒº„Ä<ºàð#»¾·¥¹B6;¸‡ø; ’¿:ÑÛ¼¶ê»žî<( Ÿºè)„º™*H;ó»€-F¼a:½Ø§º¥¥à; ‘ý;RôìG:ºî»¾†:¹7G» àâ:ÍÖ&»Eã;¢—/;ŒËºêþË»Ê为ú¶»qè;r -»ÁSq:ùF; Á<::œð¼K»»öŒ684²»¡’;7!ù»ƒl‡ºôšŠ»%n¡<,zc»bf^<*~²<ò~;ç»Ü_Ã;5öÞ»áDÇ;ﲨ;‡Yl;­?Ϻ&^´;w9‡¡Õ;x«?:y;ŠÏ£º«D<YÉ<#û;0hÐ;œ1p;Ïئ;Õv»FÈ;願;F:›»ZùѺ‘t¹•]!ºI v:'º•Ë<$÷ͼ>–»)º;[D»fxõ;„ÔX:ä `»ž—»¼ÚK»¶›ø;20t»("¼ø­¼&¬ö»æ ;¡Ø¢¼}0G»wY;ÅÆ;̲:§V8»ÅF 8üW;©ý-»ª¦Ã;VD; Í;žAèº,À;nü=¼´@¼Š†ê»?Jö¼dö0¼Bo:FêW»¾»—½&»þú^ºÇIL»ÈR¢¼O^ݼCÃ*»ñÞU¼zÁÉ;›©…¼;_ÕÁ¹ u¼8»H¥W¼ü{»¼Ñº\aò»HF;‹{g9áý9ð¤4»çÇ1:G"¼Du%»ÑÍŸ:dóü»4•Ã:ìE¹»Yz;€¼9»‡üäºè£¹»úÊ»@xl»z8 ;!,¤»Z6"¼/P¬<´";‹Hý<0vºÕ4P»š‚j<NÞ»ŽÅ乬Qºú‰é»›Îù;‰8ĺÞyÿ;€¿C9ÊxÒ<¶ù»“­:üs»îÝ`º~òÝ;¹ZÍ»O›¼]—;I<  Z; r»XÎy;‚0]J±»¡»B¸µl¦;¡=ý;k»Ô—²;À·b<´4;†;²ÉI<—̼÷Áº·öfº¹x;01/:„`I»:˜l;bßW;*ÿº¼D»5wÖ;„:á3Š<>ËϼW¦:Y_¼A‹x»lˆ‡:Ø¡];þ.š;%<Ý»‡ò;º`Ü;Âßû;\ó_»\¤÷»[<â<²‚¸öHý;®ÅZºµ;¶;DsL»ÈLÚ»©›Õ»³Šì;/F黧×Ƽ/³;²o¼_‹_¼<œ#¼Gï»öÏß¹_Ç®¼"z»Ûl¼0ö¼È¼Œ>ƒ»3»àBºœ Î:óTL; ^:*<‚;Îõ¨;ŸúÔ:¬É¨;r w¹w; ;.5;‚ŒÂº—™»tÁÑ»¿Öƒ;Øèé»ü²[ºÎ»”9È%x;¹y»»¹dg;|›è;Ô:ù»œàB;z:¨im:Cž¸;‚sŽ;þ0‘;—e;-…I;ºŸº˜r&;‰· »v;iÐ:\³Åºœ9ñ¼2;‹/º(mF¼5hs:g æ;ÃÍR;€¤: ˹»¡Ágº¥¹5»¢†{;ˆ-¼ `b<Oú;tö< g;¿½ë¼9à³»Ú÷ :q,»ÉÏå;«<‰$¼`†:ñˆ »^”»BŽÎ;(Y»êŃ»Ã0»`gÛ;‚ÏEº í»RTï;pP9™‰Z¹×e+ºÖžE»ÈW\»ð»qt8:ؤÏ;7‹ <#Çw¼'—»¶S¨:—$Å»Gꛦ•:/•;ŠÃÔ<+_N;rù‘¼wBºé’<ƒY*»}å²;þžQ»}ð#»®"L< ¶Ð;B G:†[§¼ÿL»K¿ñ»ùCμ}A»b4¼ A–ºÀÉÌ:¤˜Ï»v9_;k¬[¼+:ߌÀº¥¯ÊºÄ;ê¿N;Št»tȺô²&»’¢ö¼©i»#×J¹ù“K»•Ò໵l£ºqýÖ»žL¦9§–a:‡ý,:±½a¹ØF:}¹I¼œk»‹ù/;çè»Åã:ÃB:¡° »7MBº`÷{:±pv»ý}äºé`c»&k!»|±ºùÛ;›Üg:áwuº‚œ:‘µB»?vœ¼<—¹…_ºÚã»j.Ÿ:{†{¹œÞ³º,ç¹»;Ø<» v;௔»UÔµ^€;ºÃO;%AÜ:ÙÓæ;—Rj»ÏN»Á[a<‡É&;¯%É;Îæ3;’j;Ø;Ùz:ÄÉn;O§;{„·»@bi;‚¸I¼é<&;š×»ˆƒÄ»6b²»9êš;HZž;Nô; VÆ:„»¬Kp»a˜j¹€sÇ»)r–¼˜Ý;LÚN»f¢ ¼g„c<á[»ÊÒþ}»î/”¼74»åŠ¼ Õ';™»÷nݺë j;µº< ð:±9Ÿ»õn-¼!“óºžÑ§º÷t»á/Ë:kq::‰¾»ˆ’ý;ÔÜ=:šbù; ûj:•;Žº_ÎLºÿÚ»™…\:Q…;°ŒT;.o­:sÜ„;@ï:ÁP;2ø<;ì:–Üí;°Ãû»]Hþ:ø-P:È•j»2&ôºü£»™Örº þÿ;Eø»ƒør»–®9œÔ—;Šƒ:›5ֺ嫻;@}»ÞØÈ;L92»€xV;ð§:‰çø;2›;ºëä”»Ž˜»×;~@<"ª(ºÃtÇ»b~X»ŽU‹»™ð•;Þõ';àF:­»åº8¢ <$N<ª„¸;@E<­°>»ËÊZ»Òª$< ð”¼$Õ;»—:þŽñ;¡ÄÆ»øCZ;ˆÏ€;À*“;O-»O@¤;TÎOºÊád»‘…»ˆ¯_;VÝ#»£Ãnºƒë;¯Þö»ˆDŒ»’f;!O¼A’:o‹¼P64Ðxº®<å:5;ù,Ÿ»u6÷»ã~§»¦¼3¥.»)Fñ;¼IŽ»í3/<†%»éá< -Õ»#ú¯<"~»ÙÝ»±·w¼:¤:$ÍòºCœ»Ú>+¼›f9!¸ì»™Ëñ¼™À‹;ì’™»¯Óy¼;2X:ѱ¼»SjW¼ö}<(8ž;mǘ»„2~¼G9×Y„¼+å9¦ÚJ¼ i·9Ï'Ý»„aºdoI»•m2»@~»›š—;=½¬9l\»‰pª»šHç:Áiºœ»$:;³N²»)-¸§Ä89¶Ï:³.‹9ý¯º*×@»Šo »J¡Ž»`²`¹ž½É¹Nv»m ºš[;4×M»cÛù»]Vù·=,»/š:¾'ˆ»áÀ»)캿`Ÿ»ÁC.»Šr»´ït·]ú"ºh;" W¼[°¼²:;òU¼5Š<q»;Ô3ºêèç¼r^‘º¢j`½wû½U•¶½®i,½E†ñ=Oò»=lÜŸ=0wá½t^1»ºúb<Ò’=OH¤> µ =$Çè= ÷=8†_¼ D¼ª–•<ø€! Àö<莲¾¼ß)—<»ÀÜ=f˼aK<³Û–<Þz=¡=a0;ÉY=­š^<ú©ú½ZéJ½&=3pg=íT?;”ù¼÷¥=_Ѽ®ƒH= B<=ÍG3=™ =…øÅ=Ê°=Ù‘¶<ÒU˜=tÜ.=´ê> ^=´(=†òù=ô,<ò1L=¬Ž=ÕUz=Ö> >=ÈK=™7>™Ö=ˆ€z=Ð ø<@àÝ<Þ9<šei½lÜì¼È[»S÷~½œ·U¼ëäòº¼q–=,];Ü=qÈ7= }W¼Jg¥½{ݽ :½`¦½“-ǽ+;“¬2=$ ¼;Þ‹<¾óò=]—(=9ò> Ä=÷ÿ<ëº=AÀÿ¼À|×=6¤7=*¦g½(ÂI½°jp=#ès¼ŽõV½fD¼º©~<îÙ < z“<Äì¹=¾=‚Ð=}n=¹‹< ¦@=@µ=DÅ=¹F5=.1/=—â­=®gU¼=f]¼­|c=•ˆ*=ƒ|z<±l½–tú=hÚ»«Zß<°C:=žš=“6’=oDž=˜t梔=«ä=€@ç=Ûö<=ÐÙù=î‚‚¼Z_>K…ÿ>7M5>6H§>hï= 3=GœA>œU=ÕlV=×ÒÇ<„ñ,>1Åê=N{¹=gæ¯=¶ =“!=’¢=L\o½UZ¼FÄ= ö½@õ½Sº¼‚Aý=åµ»ÀfZ½<<½E„½\§½`¸½Ò—=éæ½*T5»<“@ ÷=‡øË=OûÞ¼õO’=Ð#1={º=@Ôœ=Ž…d="ºh=“³ =È%ü=°A=ÒÕ½=·r7=Ϲ>v'4>Žæm=Ùc=;µi=ã*>÷=ÊØÞ=ªz^>Äì=¡ð”=—S•>"1»\$›=+öÔ=š· =™ûˆ=Q¼]í»Âof<¼êk<Ãú¼Ýµ¼žK¦½ /=eD= xæ¾Ôý<#X»Ù‚î¼.´*½—É–<Øh½&ï=ª+< O¸;Ö¨<à¦=?i‰=…Aý=Ae¼±¿M=êQ½ ÑÕ½sŽ7½Ò(¤ºõyÓ½©r-<í®;Ð"ʽ¸öª½&‰È=ÒÈ =å‰=*£=Ôi(>"`¼g(=ˆ©4=ÊH£>r=Kÿ<ÑU<ÂA¼HœØ½bÉP¼ …½Œ. ½Tɽƒ™ñ»µÎ*½*ãϼ‹& ¼Ö¹0½Œ&5=«|²=ÎdÝ>Eâû=Çðú=“ðú½­®i½K ×<«F=¸<½" "¼ îÔ>)ˆºÔ™½ B‹º×›x»$=P \=¦P6;x³›=Ó©†<›!B=F/õ=æ¯=‹8 =kƒ¼sR<ä”Ö=Ë_r=2€=2*l¼ñ5V½C1S½`;|½QŽ<-}¼™`'»›è¾¼o€<¡=²$=æò>S-¼¨î*;‚kͼý(ù=è\Û=+Šq=É°Ï>{æ=ÕÆ=å)=½¶ƒ>Ž—>‚l>‰I›>=Æò=È=ÝÆ=ÊÙ=–X=´´û=?k¦>W =ðP‘=É I<þ‘½!â<¼Û<¡^ž»ì ¼ä3X¼Ï¢¯¼¯¥¼§ó¼<¬½ä*¼uy=]p.=œ¾==£±¼¯rw½›©?=T'½o=3§C½L¡Ù¼ýl½ sØ<ßÖ=€7 ;‡Xú=³ÄŽ;¨ k¼¥0=Ž®É<Šò3½âù—½Ê½t½ XO½3Ëžº‚]H;ȶ½Ñ¼}L=w‘Ú=ôÐz=—ÿ·ºÏz<ÿ8ò¼/—†¼Ù{ß=§á`=ž£v>´ù=5Þ~=iÝO½ϽŸ1v<­s<½jÙõ½Ïß½Szè¼ÌvŽ½@lb¼ßw ½={€½@¼²’±=Y6=‚D“=ø•N=„``<­!g½ØaË»›¥=ëÚ6=¯¨¯=d'½Þ*½ Sˆ¼ÑÎì¦$=Dc¢==å>ÝF=©ˆy=Ì(=dê™»ˆ½â<ÑÚ=š=0,2=Œã¼×àb<"öy½&}½fé=D¶¼©$j¼\4»kï<|:×»’Áz<ÀüÓ>„`=&Š¶=¯›J=R:_<´2õ< Dœ=Ñ¡m=ÎÆÉ>sŸÍ>ßï=ê–…>:~Ä=YÎ+>-}¾>‚>]Å>2œã>.Îé=Ú_Ü=ª."< Ü—=ìt²=Æg×=åt‡=îÞÄ=—È3=C¬gP<-×=¡+‰=ùj=’E9<¸¸=n¨«<…øó<¡g7<ð¦=Š »_éºÉúö=£$w=6dR=¨ˆ¢=õ!Ï<ÒŽ­¼õÃc¼?‡¦=û'=M£³¾%¡½zi¼¤Y*½È^¼°Â½+8¼¸­ 8=³#‡=‡k»¬ìø½&M‘=MÈ=3èS» öô;© í½ŸíŠ½1í¯½‡°r½eÚ½š&=m6<Û^=é¼7=½Ç­=ĶμK—q½´«=AÈÃ=è‚=L ='á½à›<ŸJû½7-`=R Ê;ý—†=+Ÿ3<˼–>,”3=ñT[=q€«=·Næ=Ìs;=0ñ\½˜Î<6ƒ=«=Ì9>À¾ºQqä$‡=”Ĥ=lÓ™=‘Éî=næ§>ØØ=È®¬=ú f>[+B=³r>#~ÿ> ‚Ž>:™è>„I«>”¸|>‚žú=x‹%=Nã=€è=n è= u·<û¼¢=ÍM‚=›“Ý=×3³½–Ú=™ú=¼üg½§ õ¼¯º½»H*:ÉOÍ=°ž<þ|[½ ¼Ö=N?=b!=†T®<šu/=[Õ=ü=-nd¶]=ÆÛ¼±È4:ˆ=nºè „õz=¼~D=gÛ©=Õ/½;=E7ÿ< ¡u<Æ2¤;ÍßÊ:ñþv¼.tμ€.=‚í;º‡H¼-ÈR=w%> Û=þÕÕ=¸>s=ñ2_¼ õY½‹¥=mWŸ=’ä|<Ùò7=¹ü=P•;M©Ò¼a2¼zê<¿/ø<'Ɖ¼ˆ´C;Ó£<.a·<’ Z;CH>Ò=ûŽT¼†é%<ê«ø=Er=¡ªU<ãf={¶á=HCU>C̦>1y`>J£þ>‹>P;>I>us.>›ô>3Î:© O=˜zä=Íê=ÒŒ=¼¸=¬æ‘>^Ù=ÀP^=Sºe<´þ¹;«ë缩ô„½6O¼¥e†<ÄQ_=*ºM½<) ~Ä=’ø‰> ú<6ò¼n«¼Ãzm»)E¦½q)z½5U½ƒñä½]þ½¤à*½yè> 5Y=ò+A<~s[»Å„Ù=qáÀ=€h…»ý=ë-=Üy>/´>€M.=ÙE¿>0:5>8?¦>5dþ>3=–·ß=Ú¾9=Í=Ûª¶=æ¦æ=Ái>Wƒª=µ]<Ó¤‰;ÈGD»ð>¿¼W¼ƒ¼V<ª†M=P`m< "\ »¨èî¼k¯N:K»Vǘ;’-¼IaŽ:·A";º`|;(í¦;ÿ2;·Ö#:Ê¡™;›´Ž:”‰²:¸ƒX<ݸ<˜;¤ÓX:à»—;ºN;C±“;5â–;(Iö;¦NO;›Ý¼»ChS;ÇÑ–:eˆ<W»ŸWç8­ot»ñ¿l;Ü´R¹$m)»õ)`;Z³n:±Ê;F.š;"¿»‚Lï»Y÷»Œ¨L¹4+‹:Åë²» -i»D‚£¹ÞÅ;°…R»ÍÓ$¹î·¼I¥v»¨Ô}::ÿõºeÀ¼;3­˜º±Ôº`*É;üC»Ñ6;Ÿ=໇湞Ñ#»u¸i8@Õ¹'Dü»_):¢<»›ÏÞ;¸)—;·»|œú<€_d¹Çà¶;-h»}Œ;3‚<;Ï“Q;SF´º'op¼«•º_c[;Ž¦$;¼¶0:Kó”;hŸ“»‡N;ZÊô<$ɾ<pŸ¼.Ýi;´@O¼c“{¼yÙºÅÕ=:eZB;¹ßº;aP”;»-c¼VàÍ»².<5ü »¹Àç;‘÷»Æ—»Á`ºº ª!»˜£º :<‰»c;ß麼Uz£¼ (>ºô3Ë:ºœ »eå=»ð*µ:þ–¿¼*1‚»)1é»é£u»Fë7¼©ò:Ë Û»ýÙ;»Ë&‡;iû<ß?<é;l:pJþºíœ; ŽÂ;€ƒµ;¾¿ëº°r ;% :ÍßÙ;”á9$²ž»{tÔ:À•ÖºÍ ì;j_Ô»Lï;#™Ú:$³#¼2g̺»}Í8ˆ(;,³Ó; /˜;¢¸ºhZ¨:ÚÅÕ:éW8»mp;êž»^8;§Í»7è–;fŠº$x8Ýçå»ë&s;¾˜Þ:ÄGÕ¼=-c»£Q¼º%:4]Áº–Få»Îöü6¸ÌÎ<ìT;z—¼j«z¼ 8;iZH¹If);½@p»„Ú¢;Û1¹Eæ»A@o¼?,¹ævл¼ÂÕ»¾ã–»Ás›9îIœ»æ—ªºëî];¨žh;‹R«»õ ¾;/]»»•j*¹LjË»ÌZü¼(æº;<Ρ; 8ä» špºƒbC»+°ÄºGò¹§Ë¦;’àÞ¹‹¨è¹GúöºEì†9Çâ›9ñ‰œ<˜×;a°Ê;ph¤;ÿê´9üK;Uü\;'ý º>XòºÓ»+:dœ~;Z¶w<d:áùŠ<¡;g§]º¦°I»IJ;Ë:ê+»ÈKÂ:£ž»ÙºyC©º¤3»¯t;ýšõ:¯ë•;¾þ›< ¨5»]«Ü8¯ W;uÛº‚OU»#¿;_­J:#|j:Û?Ö¹8ĺÖNm;uöÓºMè¹xý)»Ý›»Uó›:]@ºÊÇgºmâ:³íV;aº¶ –»å}‘»µ‚¸÷†ºÓ±»Tp3:Ô‹B¹ƒà$¹o©3ºõ^Á:cºãs×¼L)Ì;%à8©¾èº-[ηáG<ä< Ú§;ËŠ;Óñ缚¡;Ðëy;Óç»ñØ»»Å);rl²:’̉<ŠÐ;Ärû;]ŠÁ¼;¡»túÚ<»ºÈŽ»ú¼<¼EŽU;xI‡:/Wj:ÕrÁ;ÇùbºKÛ•»…F;pm7;Èý»ç>¼5í¼—­:-§: -Åîü9mÌÃ:I\Žº!Æ÷;ÂØ»?;Óp‡»üa¡;NˆÙ»Ü69;˜Ú:< Ü­;o.Œ;©%»€©¶»WR» M‡»‚üÿ;Qê‘;@ºG§<Ùò< 4a;˜ Ÿ¹ÜÕ9.æ»ÒRœ;Îð$;fc;üë;‘Rw<:pê;€’c»œ‰¿»é]%»Y¡2<Ép;a¹‹¼MAÖ;Óœg¼;hP:¿•;âüV:¤dr¼¸#»³ÈŸ¼gD‰ºH0”º²`L;gËؼ) @¼/--»•”a;yž¢»FvA;gv»Ý«ò<ˆ)»|¸‹8ëôµ;'s;°Ë» "›ºÄ.c:¢Hæ:œb ¼ ³•º­Ãp;6†;/ý:—ôDAº‹œÛº•_†:êF»l8ûº©›:Ù,®»]Ç;\%G;ã/Ë»v¼&»dЉºaµ»Õ‡Ë»tò›;1Çh;<žãºO@…»8”׺éZ»®Ôáºý¡j»Ð-¼dè;©,;'µË»AC¶ºx?¼ ¼¨»6æš<:Œ~»ý+O;}»†‰A<û;]øb<Ää¼ è;Ïæà»ÓØ9\Œº÷è›;¾ __ºfÀ»”^†»vº;ünÍ;´< Y໶.¼¬=;ä¼ »Ê®Ä;¿‘;£6u9j­µ;HÂK¼ EN»˜ ’9}g¼ìÌ;=ä$9ýSLº .ºgâe; ãÏ»ò :ønT¼&lQ:³öлt Ð;²%<)ßU<æH;NÁϼ ƒ8¼äÈ:Gb";‚ú»ÛQo¹Bö¦»¢ÙǼÝî:¹4¼fe)¼„Ûÿ¼ÞK¼/°¼*0¬»Tv»EM :<*¹³»'a:ŠZ:I‘¼§¶»x';Xç ¼6:;N¯­:ÉÞa;ƒVûºáíÐ;­¹j:_Æкڪ”;RŠœ;OS;ãü;›÷r:(¥=;]-h»ßµ»gô»œÎ)»¢8; k:™Ç;÷—Z;®À¿:-4e:k²h;5»¯8û;À19Ãú‘»Tÿ¶»Ui…9™ø»`\ç;±Ä³:œ©¯ºõ‰];‹Õº½›§;Ï&:æïÌ;·J_;Ú])»­X;Šû<#ð¶;ÜÑhº_¼Vë;å/;{Wvºå‘ »˜˜b<ì<H½»Úòå;ŠeMº}gòºóCº5²»1qp;¤ ‡;¸»Ï;Ý^Àº€°£:Ê®ö;ŒäI:˜E×;.Å»Ü9;kkk;£4 ;šœ´;Š<7;£@h»³.qºè;7¬“;„{¦<PI¹Cs\<5ÿŸ;-è¼»Ž`l»€V;qF;1R:‡O;Í,L»’;»&U¹¯©;¸ŒW»SáÀ;oíM»i¯;©>ºƒnÉ»,ÁGºûÖ8;ü†K¼!ÜE»¨õHºI;w¹Žü;2Z„<…hh=G×຅Ì<ëv½=ÑØ=v Ù½Gì ¼Òx¹=#‰½0lp½ ‡>½V»”ÐŽ=RäÍ>óÔ=Rv<ÿ­Ô=ƒA„=»˜’êx½7ˆ¼óø4¼çƒd=ÉàŸñ=B$ =FxP>=œ¡‡=•L£=|Ä~=LŒ=Q=»‘&><…> Ò=©6N=Á3´=¢eÞ=Ñö=¯1×=Æë > ¤#=uØ¥=Éú=x’´=¼G¤=å(û=éu =DÃŒ=Muþ=¨c¼ô$½½[3^:‚CH=Qy¼…·½<‘?<€Ô©¼J"<Úhg<¥aL<ªÔ©»¸v»œ”v=ŠqÍ=µâPºÏ±¼¬z¼u1î¼³[=\Â= ÷=`ÚÌ=Ò‡=ßÍ×<³Ÿ<< ‘Ì=ƒ,<¨s¼Ò,î» xA= ]p½P±¿9ö›û=q¬=þ‡¼Ù©=¯:>„o=ÿA[¼…<í=Çõ;<¸o ='Í,½G½ŠC®¼‘˜=“N=Ñœ=ç=]D!šã=8ÐC;ÂÈÄ=›{ø½!Ø,=þ/Æ>ƒ=]Ùƒ>Dë=N‰3=ʆÌ=‹­ =¢µ=ù%^=“H=,ª=¼hA=Ë>ô¸> ûw>*¹m=9Ž=¦¢<¥L¼¯Ãž½Kta=œ¢=jFT=LO¼èòi:Øð<<È=<ðu~¼¼1<¢èE<õ¬k=Êd=!<›¶ñ¼ú!=¯G<ãÔ~=ÀŠ;é©=d=î=•Ù‘½a[;fV<¸n§¼Í‡a¹ Ë¦»µ°°¼Òn¼ =º9c='Ê=…â’¼€³W½7EÚ=¹Ð™>P¶> ¼&x»c=<­1¢=ºë¥½R:iQ <í^= {¢>*kÄ=‚u2=±Í<êŽô¼‰=À¼—sª5I=hâ„=Hh=ã ]¼{z=Ûäå>`¢;ð?’=£=õõè>#–>ì=¾*<ø¤F>(A=YÖò=Õ~Â>k?<Àž§>X=VÎŒ;«õž=©0'=½Â>ò:=í‰c=Ž@^=Àç£=¥ U=Ùp=\?=•B{/<æ ¹=­q;±=Z<¼ÿ$¼üAC¼švl¼Tü=2ͺ;e ¬=UUT<襽—¹q¼¦õf=å°/=ü«¸¼ÔöÕ= Ь=·F=3wˆ=ˆN<_Tí=³$X>¼=Ÿ–É>Ê™=‹j›=¥g]=n8=æY|= ¨y:‰âe¼ƒ¿Ý=@Ór¼¡HÖ<\Ãg»»?Ù=w=;·Ø> Þ¼øŒÂ=)gP=¬6(¼N J= ȼóúv<´“f=r‚¼=Tôâ=^â6=š »åK#=HM¼«P= =…ë$=|¢=#ž=¾ x=ýH<²]À=zæ¿<óØ.Q>R>G×Þ=5…Ì=ŸàE=éøÕ=C­µ=yQ=œèæ>(ˆž=45ƒ=g> ¨<ÉË.<ÔÂß=ÉçJ<æKÑ=Ø‚­=4ײ=5ƒº«[= b<úºE=‰7o,¥>#.®=œ“ <®H̼Ú2Q;Ý«u<« o=W=ΛŒ;¤˜G»°l=|l!»[Ï;ðÃ><Ìâ#=¤‘f=>)R;¡ŠÜ=Zk’=Ðp#=Š =Z¬7=€¥T='F=ÑØ­>"ÝŽ> Ÿ=š<&<Þá=îL©=€~=;}–=+ê=8'Æ;1ñ¼¼þ=>¡=ì=‡²m=©ÀÒ<˜ =3Ÿ—=ŸãC½o=?¢p=‘„Ž=‰Xœ<¼œµ=~W=ÌÓ8={Üò¹[É£=¦ì#=n|A½&"d<ó±£=èC<¶<…ÿä=õ&¼a5E=^X¾> ^¬96`=Oå<}¼×±¼Ì;ôä齈ìö<¾þS¼ƒ¬ñ=Žâœ<Çò<¶9Z<¹w=Ð<¸=ém]=…,`=¤i=öX=³„…=(ñ‹=´<*¸>À1>=Ã>,#)=§¾û=û”=€9=Š>4>ôŒ=íéÐ>¯Œ=Åx¢=ž<8>øÁ=¢àè>5ÙÂ>¡/=`Å=Å+=Áƒ;ÔÂZ=†Ìé¼·õš;ëdó=.F»&’=Æ£3=Nj\:Ñ ¬½´D­<™6="=³Fu<„d=C~;N í<*i=Š^-=/£¥=* u½èà=¯‹=ÜÕ¯=áòÄ>L=¼¶=¼’bË=›Ùš=/‡= äº=6/{=oý<==Y0¼»RW<Øk;=PÐO=‰ Ž=ì7=½ €<@jw=wB+=Jë=áù=¤Ôú=Æÿ=ýÙ =%»=©‡d>DoÒ>ã=ı=i”O=‘0=×(Å=kê<ú7Ú½ Ïʼ¢á‚=>{5=è †>¾U>Õ1<Êi=›Rê=':_,JX™=×Ôé=iˆì»»ü¼ëùÙ=s=«G¸½Ã{=XÝ{=‡,=Õß=>a;è„~¼)õ» `¼J°¼e‰¥»1\Ö9…J·<¥ã=M ¼¯Íß=K³b=Ç!»ƒ„=€¸h>m=m<*;‚0Û;³c¡=<*É<²I=ÝÖÒ=•Âí>μ>16=Æh¼=“rØ=^Iï=O¸ü=¶U‡=’7Ë=÷ì">é]>*ËÞ>=@’=½ K=wˆí>{ù=¾ŒÈ<åQÁ=Zòƒ=—=P¼%\þ=‰sƽª!N=Ž_7=tÜa½ ]> $Ë=äúü<<Æ@½¹ž<Å-î=£€g=t <¹‹=‡È<·‹x=gÎ=v=žrÁ½¥7=u¹«=°¸$=aܺ=Ü/>{Î;{¿:ÍUd=ß…=§‘ª=‡¸Ë=Ùp=Š¹‰½!o=EÄ <@ Ÿ=²Ü=ÂuÈ=›¦Ä=ËœÁ=ËÜ‚=Sè*>é8=–üª=YŽ¤>Í=-Ø=tU>?=š[~=0Ï•<ýgÜ==A”=ƒ:Œ=‘Æ»¹Pö½#HB¼¦ô =´¤=±·ž>h²=ßJ=¬ÙÌ=©1};îû)=yì<”‘Û<£*»=™7B>î_=ÄÅï=òÝ.=n1Ý>?|‡>’8>àœ=öéV=©o= <¢ ="Ý=ØÿE=¿´R==“= £J=LöÔ=‡,=+åý½ >p½J-F=¨*=’/ÿ=WŒf<üëf¼Óx½IÔk= ²<íÉý;5=y@ƒ=‡ñ=}UË=˜f »Ú%»Xñn=}Þu=Ù#E=híð=€\¼=®-¤<Û{[<˜—y=}˜=½µé=h‰J=³qy=ý‘e=]ðÎ>Í3>rÖ>Dàè>'¿U>ï~=Ê×=ßr~>¦%=_ä¨=–ËD=#‹>C˜¼•Që;’;U;½=Ð <ª_I=[ £=QSW=2uI½"J†»u*ÿ=CB2=ìWJ=ï?˜<Ìó»„컽a¡K=AŸ…=0¨_=h^;tå”=å\d=Àë¼=ÇpÒ=ˆ=¯RÊ=oKc<ù‘¢=Ÿß=àÌ=z=w.{=Ž¸y<Ô•9=¯>¼">É—:˜_=ØÄ>AÎð=Éà=¾¥¯=¸â=¬¤œ;oXó<†^ì<¢â¨=ÿè>'M=ªS=^µ <‚¤d>8>ZÁ=Køm<˽Šdè=™}<³'Ö=Vµ=e4K=xß4=ÒQ:=‘ü>¶¤=‡»¹=²;NEÍ>/H^=À%d=¶AK=â)Ø=·w>-vU=²<Å>FÐ=¤ÿÓn<ñÈc=W©:ß>û==Ò5Ú<è@=–= ¨U¼ãôü½™T=RÿŸ> wð>$‰£< ÿ= ôú=1ý¸½k_,=Zñ<ÑC±=g°<¸Å<ÏG<ÿ@=†=»ÄP<§k\=‹Rf=&û=Ñ6ó=F‘<›7Ú»+V½)=‚¯J=Ú¾º=·¹=w=ôX$>Ü>;V(>W¤>'FØ>pß¼>,7¼>-$½=2, >/Æä=¬¹H=cŧ<—P!=,·¼æ3 > :)=·¾ <å¸Á<`ÉW< ¼ëS^½.bÊ;8p*=â Í=ÙèÃ=õºu=¡´„½h†=¬Í&<\²=œ_¿=¤c=õ(·>Yä=ùBß=§gï=Y€=Ž¥™=×ò>"­>$0›=-3=Û]7<¯dà=â»æ¼wb>#ìF>aÚ>\Ì=” '=ÐÇú>;ñ,=Œ,=×ú!>…=\<ê±%½§ˆD<Õ­r=ÜÞ=„ña:ùÁ <x¼;‘8‰:Và;–”¬»“3 :&%K<Ål»t7ª;)·»TK<Õ";"'ùºÛôh¼K ];¤P…9ÆÖš:O®˜;Ä{p<D»'wÿ;akû4=²:Åÿ»’bÒ¼):H^;I›-;ìþ<:ƒm;3 Wº†4v»Q¨Ð;Êâ{;Øx\»”ãüº^XV»ªö»L†;ÚžÎ;r_Gº›ÐS»û><%ü;ä"ô;aØ4;*Üÿ;as¤¹—µy»„N€»¢ò»Ë„;ØŽ;Ý :­°º;‹…R»ƒÞÏ·î·†;òdé;<­Å;Ÿš <-2H»¤áQ;¥˜—9Ïo•:Ÿ(¤»ŠÜQ:CþO;éZv»s¯o:ÔTÔ»l.$;‰Äp»7<>º¢Š®:ÍÚ¼0€3¸¤ŸÍ»«[¸![<íè»cþ¹–K,;!ºÛD»>š;-Âu»Š5; f»a:s;® »jÐ?;†¹U;Jqö<«õ;.[;–n;UŸ;Ü‚…ºCžN»T–;®Þ;'M»)éz;›O.:‰âÝ:v"×;ɹÏ<9jñ;kx;è®:mÝv<:+¿<oŠ<ZT»ˆºíÜ»Å]ÙY;¿‡*96ÐÊ;˜¢ž»†ëA<'&z»ÕsÞ»¶ûÿºíªÛ;wz™:Íòó:Àž;¬âM»ÑT•;[ ý¹Q;x”:Af<:s·¶S†»M-~¼O)R»Ñsu»LºFaW»ò⃺Á;!; ë‡:×Àhºx·;ïû’;¡ Pºk»-5&»žʺ·£w9éç^»«d«M8uQºƒ¤±¼!¬ »Mª ;¨fú¼ú{¼5¬·9Ê~;rX¸;élâ¼)çݻ媻^»º„˜Kº3aµ;š ;±®£;ÞÒºèä»Ñ9“E9»“úk;€ºë‡0;~Û¥º–Îä¼$©i¼#”Ä;a=·:uÍÈ»í¨¤º¦ ¼¹Ã’=;ºà;×¼O<;H;¢ :¡"­< .R¹<;<;’Øä;°,;— $:ú¼< CÑ;–(< 茻='*»›äö»À,`;[Ë»²¹Šyß9Žÿ»jÓ»È-¼$R‰»rk»œ(¶»ÊGÝ;ñdì»»Yn;hª¹|“é»åƒá»¯€©;x\Œ;`Hp»:¬2Ú»‹ºï;Áa ¹Ã®Ð;¨Šwº cZ<âÒ:ùnW;²ƒï¹¹¼«<VF<q<+§;¦Ô?;#ó+<À•»ÛI»Ž¹Û;‡MZ»ìwv<&73ºùšîr¸’dž;hbà»Ašò<–);é¹B»ÔNL»F ”;"-«9Èì1:—ÿ»_ÎO¼Cs˜;06n;Íyà»´‹º÷Å:ñÇ8»…`Æ»ñi÷»+B¹åÞ»a76»f5»îÈF;†ki;ñh¦¹Š28;Äk¼$6ú»‘ª;P¢ºÖY: º«»£Û»½¬:ºÖ@};t¨:»®\9ƒZb;¥QW;¿&É<lö;Ä¿J;Ña0:©P•:¶ô«òŸ»¥Û°:n2;ãxË;!i»ªÅ3»ZÍ仳»“ ¦;—ûW;êþh»W—»¥u…]¼œ:;Ÿ.dº¥¶(:jÞä;ëÖ»!¯ˆºsjÜ:J <;‹ ;¿Yü»MïÀ;jºì–9;£ÃÝ»…ë;ž*­» š;Ÿpú;‚”Ö;Û„;Rø.;ŽnLºöÁaºüÏ›;/hš:Am<$ºò[ 9üÑ´;¼Ëc;´d&º­z¼òÏ<Ÿ7»Bý0»:“;Gë­<õW:‘Üž»¹1ôºRsC;Ÿ•©<ƒ < Ùë»k=;¥Pºá»öpº°$»×šj;_”ºüºœ»Y)+;O=»j/»Øe º"Me»œ63¼Püp¼˜×¼<eºÒ]ê<±.;¨Â¹E®:‘îø:ÙP»»s‹Ã»3¦…»#Æéº'Ž¼t…ºð5:ÆO8ìþa;j%É;ðM»÷q£»ªú:fÕ:&ëÛº>U;f":—!v;ɇô» ¬;>/;¹R»ÕMf;Í<N5<1n<J¾ ¼?™<:Y´;ÙÇ;Jø\¼¥»¦øg;ј†ºÃÖG< 4;§Ù³¹¾Ê3»^;T×”»›¥;±J»ì[`;]q›»‡Û‡:ŸÜ‡<±<£í»G÷¼;R[:‹âÈ»¯€"»Ðv/<ˆ2»~½Ÿ¸—„´;`Þ+¼.I:Íq;„–Q»ÃÄé¹_< ¼(¸9£¿¾;ÙÍ3»7ƒô;¾s,<8¶5º†>B»ªÿà:Ôq¹VŸÐ;›Ü»H›P< ŠU;ú¯c;œ!-º¦èc¹T11;žF©ºé;3»L;ž ù9íƒd;@ž :) º?Ïþ;’6´:ë·;× ÿ< Œa<M»«Ç‚<Œ&;³{;KÎe» M;Á‚;Ig:Ÿ:‚»Ó[í¼ôá:öuºÔ~i»JÁeº«=O:õî¡»Ÿ;å:…æ »Ê㎺çÞA:.Ò†:©Ð?<X£;9:Ó*Y»L9#zz;1óU;‘Ùù;)ºå)»ò;ª”»¡@Z»B°ºŠÁ»ˆR»¶1…»Ê .:БcºÝP »ô`©;•Ýp;½ ;q¡';Žm:¬Zw;aèüºyéR»’kÐo0»õñ¢ºnÐÛ»Hâ¹ÜÖºY(ž:¿Â¢:±%v:½ Õ;m`Ä»Y…z;»U»Û8°¹Ê:„ÇÙ;˜Ÿ¤:üË9;¨xÄ;áj;>¢<S·;°ÎÄ:Þ€;=M»ù­™»…6~»=‹×ºZSÓ;w4»$œ¼AŠ¼ÄźjäºÝؘ9ð~¨º-³ÎºÞJ£»àÉ;gt»¾ckºÈs€:$û;< Ó;‰~³ºº :üñ»qƒÍ¹Cûô;Ÿ’»Þ¨9P–u9ÕÇ»/±–8ú'/;¶*»WjÓ¼þÏ;G»¼òºösÄ<3óÒ:¦½;éO;ˆž¸;*ø³¹Ádò;Q´›:g’¢:—Ûi;¸—+;^<Šå<"¾;ò_<ƒˆ¦;Ø€<—’;~9X¼!ì\¼B8ž¤#»ÿå»™(YºdC»ãðÏ‚ºM‚°º™5t;L\¼5€Ÿ»Ÿ©»»Ìù¬¹2ºó†û¼©¼hI»>P…»Ü`¼!¯;5 à»Ñãã¼E{¼ì‘²»’Vˆ¼nûj»•(¼pï’¼I—¨¼štq¼|ÛM»ÜŽ¹ªµ3»×v»c8´»ö¬½»¨8»À¼‡Âæ»E›¼ Öš<Q©»8Ë:æƒÇºˆi2;%c½;/;G³¹æ2~¼J^»fß×»“¬[¹Kœ¡»¬Ô<Q?< =W;¦[°ºªÁ¡¹¿YŽ;]µA»{“L»$a§;®Ù]9¶ƒ@:ׯ»§z$;,Q:/Ó<¢¬;&º£¼$¯Îºÿo‡»óá”;¶™°»À;Ó„Ö9‚áàºí£;Ç•º¼6¸;²»B°‹»Ï›¹%»ÈÛ€»â&;úظºØg º­X8:¬b6¼¬§…»Ññœ;´ˆ;wõë;ÒD‘;¿·Œ»jí£:õ";‹´´¼O¶;ÇBº·5i»† ]»5Õ¾;»ms»l_h9ü€‡ºµºrlB;†çë:åh» Ë;þLç<…µ;œ„«;¦­ê;r®Z<8z£»«2 º-9”ºÕö;[¼ˆºLBq¼…U<4¬Å»ðÎûmäK»Äß9 /•9«Ÿ¼ Ñb»'RǺ±©ðº®h»Êçb9Cn¼ ×¼)Æ´»¯“;PjE»1d{»¾;i@™»5λ¹ J¼ZT›ºÜaa;÷Y;~||»¥ß;ÕÆ9ëø»…{H»CÀ;ËÈY»÷S§;³:`º-ê¼B½;b%;¾»[Xy¼Gš;w?»ù­¥»’;̺šõºŽUºˆ0ú»aõ:d¤;åú »g¹;© ô¼€Ü»÷á»bÍ<H㻵&<@ g» ||»ƒ¸2;Œ°¼ÌL¼9è¼ãl¹Gbø¹Ï'^;¤M^»×℺Œn>¼ȉ<ÞY;,e»4P; ûª<<¡H»}»MxA<;ˆ¨;“Ÿ°º+Ñò;aoÍ<$º”;r”®»ä²9»Bú¼/ÿ×;¨TP»˜âe»&D:»ºR;é³y»½i;£;⼬B;¤¼ óì;€'î;šP¶;K÷T;òI»»±`;­Mgº‹ »Us;$Œé»¼CÀ:°ÏïºÑçL:Û†Û¹èò6»¥Ñ›:ƒa »Øb:cÙC»Œ¦à»tœÙ»±*Ô:ºB.k»¦œh<¶Þ;€¿þ»Å‡ 9€ˆÃ¼ )I»…«¼9®»›ç»€h•»#ý»€Ø»žYà»™oŒ»Ìžq¼f&%»2ðý»™†J¼þô:d`É»‘§^»‘ªkºC5»2ç³»Û­ã»Ú»,bc»ÄÌ»€yJ»ôÒŠ¼†ã½º¡Ë»¤Æ°:<:Ÿ©r»—Vp;F29²q¹»Ö½;'Õ¼_˜‡8ø;@‹‚¹£ÖG9Ì º»š\¹µZ®»À†î;“éúOu};Š ;p‘Á;Ì ,º>ÿ¹JÜ›»7k:Dõw»,Tñ»´™p»Ïi}ºÁQn¼Ðó:8r’;ïH‹:fAd»«×†»«Kƒº×ÁÏ»F)À;cÅ»n85;Ñ:Ô »ŸÅs;R¡;D7ç»zH¼¹Ø"’<.&1<óV;†dú¼TqºÍç.»ò4»kš7V÷è:Fî=»Ð©;=ës<‡1ǼÜE;J5N;ˆS¼<©Ê¼2žÆ»¾„¸»È“ºt£ü»uS2;†~®;¤ßYº¥/»žÖÌ»{BÊ9žCz:ÖÔ:»´Û,9p[ǸÁhÐ;ïU»=¥»‚vÓ:€ûS»Øˆ»…1:ðB]¼%¥c;W^k;Ó»œãÖ9ê⤻ hm»{•‡ºDÖõ»*º\:€»²’oºNäe»Ã–:ÔÑ<G:jT;{Ô»SäÒ»­”;«X;Îñ;Å®kº«‡;¼ÂA;µý»)Úº¶Š¦;Xa;œÄ_¹rys»Zø1;dÛ\:ûÒ»]Îå<&3;©Ó¼QžÂ»ä;—;Mã4»=ŒÐ;è˜1;1:¬-aºK—X;£¤ˆ;;ë9¨“D;Ì+¯º´±y»fг»ŽKJ»ŒYÊ;ùRl;’è<=1J;†°&;5R=¸Hñ=ÌÄ•<¼¦ã=%ÿE=ï’3>0)o<Òó=$Õ<>ü°>_D=õQ?;£¡9=Üî-> Ý=åÞ|>Fà=Ímt=¥üK<ŠÑ <”ñ=Eþ=”*|=•Àž=€Ô(=U*Ù=$¢È=$ÏH=Û ©½0 Û½q=;}>C·˜>*8ï=™aº=ýÔÐ<#+ï=¼>—›=`²&<‹dk:œÅ<Óõœ=g =sˆô<ƒÌ‘=ˆ¨=²ûú=”OP=¤†=I•¼Êƒ\=Út;-™€=Áù½=¦ù> =,=·\ž=¡3>.Õ×>*‚®>„òó>0H>jal>r;L>>¥æ>&kÝ>9=—Hæ=ÉÆ®=—>;å>y<÷Q½4š‘=ãWà=Ͼ>=™Ë<—³<v“½Eå=G\a=*^[=ÕHê>+ÝÜ=ëT=¬âä=T»ê·ž=Ϫó=Õ-»>kCJ>_TÀ=Õ\>>F*><´+=Ë=†J=´çê=þWÅ=¦7> xˆ<èŠ@>RÏ>c=Ãj›>Qk>,¼Â=žÀÛ>+pú>6Ò—=üöé=›r­=ûA<=¶Pl=G^;ÙáÒ¼’¡4=ÝÉÞ=ÍËï=ë(0=ÞC<=ì=ï»i=ö;ÞYü¼I¬Þ=O¼9=]Iå<µ”ð<°Þ¸¼[%=¦» =áHÑ<ù„`>;‡=·Fò¼g m=C>9î>sl<‡""=Êgx=òMi>Xr>`Ò=¤)¾=ØÖ=“<=|8Í= [> ¡Ú=íÏ>;)M=²ô<;|§<#ü6=¾ç²=f”­¼Ï£õ=?Ñ>ÒA> Ê><ÚE>5uf=¸§Ã=ºn>òÆ>p­=µÏ<Ìa <¶¶Z<‘‰Y=œ½ÿ=\îÑ=Šl=…¤³=eL)>)$0=¶¶=„# =—+>¯´>9ä>l'>E‚e>‘8¸>]Ò >W8\>¤y>v“>.a÷=ÍTM>2³>@²=u–½ n¼¥œQ=“é=Æ*ý=„µé;÷y@=BA½•ÐI=~=<³éT=Õ\">cþ>„×>'Ù¥=á>ß=—& =•¯q>Ÿ=âÚ£> Wm=äf”>-·“>}c|>C²ï=è‚×=ós5>Kk =ÆúÅ>Ó:=²Ck=VD>I›^=à>_=É€ >DÊ=çG.> `ú=íPF> c~=ˆn=ý ó<‡¬<¦A‰åP=­/Ó=N-Û=éû¸= xž>Ó±½GK½¥¶…<¥Gà<®M»„6¼3â¼=P,ß=¹å‡=¨:÷=O)0> ôl>(Ø=s­þ=‘6[>]š=éêÈ= 9ù=6çI=®½“>%vz>d›ç>!»Aé^=Ó?,>#er=Îà=ç½Ów[=—¨=”=4¯ï¼×YÒ>'~>·O>$•=æ¯?=â?;=ìBd=órK=çra>1åˆ<¸¡³=WÆ«= q=Õùr=ú-.=ü§=‰?K>BÃQ>ø^>a=ä9B=£”¦=ºŸ<¥ã+=@f×=ø =àQ®>=|>1£^=ª©>6¿">H€„>sŸÚ>)LÐ>E7¼>‚–_>—¬Ì>U{f>ÇR>L¨>m`;Cú½=„g¼$ë/=™ •=70´<òú·< ɼ ÔÆ=oÇ=•ÿ?=ìá‘>Õå´>ÞÕ‡?"Kï>¥¥¼>È >ȶ=Ù`=ÌÑ>. a>(×$>©ö>üwÎ>¯µ–>dìù>!ZÕ?zÉg>N?˜=é É>D±¼=©.°=L÷>eë=®c\>A‹“>¹ñ>$=Â=É«>DòÂ>4Ñ> –ð=Õpê=Ã뺼Ðfà=hŠ=¯‘Ö=ú¤c=áXË=â\=ïZE=ÌùÛ="¢P=´²F¢=¾^€<·ã=ö¢ú>Ñø>Ð2>>> ~=h=ló> ø=ì> £Ñ=e©>?š>ª>Ùn>9>=ð©W=ñ4=½=Á·’=s”À=è–_>¾I>Ø »ºnH»õKݽKž<å i=u+¼<)a2=Èݼ><ý>1Ë>>/Žˆ>7×þ=à½í>+%{>Lˆu>&»|K=Cë=‚Í‹=Õ#>ë¤>*ây=ôà5>^–Á>KBÅ>,ª;=üœÑ=¾M6=ÖW~>íO>i§M>Vš> >bƒ>˜>„¹þ>”Pÿ>RÃ>^ y>¨)O>¡—ÿ>£±>O²k>=0>÷ì=g÷l=46O=‡5A;äYZ={¶Ÿ=ò=‚?¡<®$:þo‡=VÏ>O">†õR? î?z¢½>á3>üc>ã¤5>›ü(> €>N®á?1Ò>j>Šl? $>« >‹Âð?äð??éM>]è=üùŠ>-åU>)=Î<˜>«·>2h‹>>Ç=ȯ­>5ÞY>h Õ>hû¦>LCÔ=Có>8È»Ó=Úl$>ft>¤E=Åã=ëø§>0/*=Ÿ‹Ì>5¶¯=aC=S~­;Ïßõ<4K=&ðŽ=²T=’;=Þ!F=ö*­>Zj=ÆŒ0=ÅZ˜=¾Yo>„=¿)Ó>M*Œ=”ÓÝ> ñ&>» =ÍÇŠ=ƨ¨> êŽ=ð~„=˜¼¥=Å8Õ=ð‡¼>?Š>¿D>V}Ö=˽Ü=ÐÚ²½Yé=aÔc=¡& <³¶#=ÓÇÔ>/#Ú>"„>‰Àq>9Ôì>_½>mÜ1>bsx>3°>32í=Ö‰S=þÒj<œË=ëW><ÞÀ>EŽ¤>YÝ‘>rxÞ>à !>‡ùœ>ï>”j>“> În>:-Ð>®Þ>¢£C>]wx>{Ÿå>;›ò>«Î>ß@Ñ>ã+Â>Y>Y ?F".>©†ÿ>‹cª>Œæœ>©f¸>C&=gx =Ö/>#å=æØ/>"‰(=ê{|=½:k=ï³=ø>5œŽ>yÅ©?6+<@é;?ΚE?ÏÇ>ÄÐï>È°0?B‚ÿ>”ÞØ?‚¤>Ì£>Éúø>ÛzC>í ò>å¦V>Úç/?2žP>¼‹[>œÚß>=–=¶–>7—=Í2¢>;H2>d2þ>>Œ(>ƒ¾>€÷>•7>á0>=Ó`>7• =56> «=æTJ>!Uí>"œ='¸¾=»þw=ï+ø=Ý­?‚Y=«‚!=Ï=û±3;uiì><äî>š > >)'v=øX¯=ò1=ªQ>I\±=Û€>/¦>A >!o>]xq=ÝxÑ>¨=Â"ž=ó°Ò> O==È=¬‹Z=¿GË=÷Û•>,ê>k0>1^Ÿ> ¿> ɼ=ËCá=ªŒö=²»Š> ¶=ž]ì=ŒòO>'‚->„„?>ä™>^£>¡\4>Æp§>iÞž>#ó>Wî>>ÓA>É™>^ºd>Šÿ…>,>£jÂ?Ç>μç>·UÙ>½wÎ>¦ ~>ßÍ…>¸!?‹’>³˜8>Ø«>â™>õˆU?=Ã@2èH>á§>ïKK?ñ>ÿ‘Ÿ?Ø´>õ:?˜?Vé>¼ >Wad>…U*>bœK>›‰½>_Åi>‚›G>—œ}>¶X>¡ T?>÷”?6·@"¬'@N³,?úÕµ?ç>É߃?@Õë?,Ç­>³–?Áè>ç·Ö? X’? Õ¾?;¶•>Àá>>Û>ÎðÒ>±œ…>|óK> d>”Nµ??¤>|“I>߬D>¤½ >JëÒ>[Óò>˜*q>}”ë> g~>(Éï>)ó=È>>º‰>„˜>³{æ=–d=Y4 =¾xß>‹X=|¿>€|‰=Ü0ž='”< >™ñ>Ô‰4>x_ó>/æ›>|ð>œÓ>é>p0>z™ù>¢>R!~>cõk>_(>™5³>kT>öR<ü£>³Í=ä¥=¾6²=²BÐ>c¯>Ø>“`–>&úü>œô>0“k>C=À±> >Yæ>ˆñü>‡¶>*I>¦·&>ª] >¤"€? †²>÷L>à:>¸>\>… ú>°rÃ>7hs>«oé? Ý©?*Èà>Õ8“>Õ '?}1?…àË?Pî³?”?ŒÕŽ?AQ_? þ@­?Šeí?‡T?˜ôQ? c‡?¬=z@ZÚÓ?ÝòŽ? ïÝ?àc?¬­¼?õ´Ö?‹ÎP?¤<?†h?Lß?*-?Ëö?3$5?/úB>Ô K>ùú>äC4>–gE>½¦Ó?tÛô?IÁ?Ÿü@¬û @–ø­?™!Î>ÝâÏ>çu? ¤>µN>à–>À“ï?ã>æü?Vâ?A“Q>Íÿ©>ÓðÑ>×O~>– ²>’Ä>'Ò$>«´g?ñÚ ?br>ÞUp>º¨>•ŸÎ>¥Ã7>RòŠ>G|>\üþ>Jw]> öˆ> =>h× >™ñ@>k™ =Ø­¤=qJë>kì=˜mï>]ýA>4“…=ƒ;åß>#‹Ä>ÎGÎ>¸²Æ>N/‘>`¨>0«Þ>CM}>RgM>†\J>‘z>fäÍ>¢">tŒh>–>1¼>4¶Y=ÄJÞ>×Á>0wc=Áx~>#¥‹>¿H’?lˆ?t„}>¼0ø? >ÀoÇ>š&ç>ø!> ?(/×?&4Ò?=ô÷>ÍL>Æ×M?s¥?pý]?rý!?¡­ü?š^S?É4+?:ˆk?X[H?}’W?#äÅ?ÈNœ@ °Þ?ásÊ?—% ?²ðh?Å>?¿™Ã@#ÃW?Ãbï@ìî@)ê?½Ó{@¿OÀ@+êh@säå@irÈ@ˆ¿~@âYË@{•b@;ò@® @qIN@¯R@UlZ@PìÏ@P6;?é¡@Éa?Ì=@ˆ—?ÁúN?Š–E?:éë?[ |?Ô>´‰[>äˆ?O¸? ß@ (5@Š\º@%÷m?Ùy3>oµu>«_`>׊”>Á>€¿Ó?ïM>éfö?bÒ?J >Ów:>ܪ>áXB>ƒoó>„‹u>+Êy>mÆÔ?q6?~>’?>ÓB>‚k%>æ9ÿ?Ñþ>C”{>d¨ >T_"=ð³»>Q'Ò=Üo>kØ­>¿?›=̼b=²Æa»€œ”ºä濺Òö»(·»ð$9ëKjº§¼Äõ»‚ƒ¹¹ï‰Þ;¢üß¼¹;PŒ¼7±•»å•ß¹š×Ä;÷›O;øÈ;,y ;h‰5;su=ºM;³)*;ÝS<'-‚ý]; B4;‡£<:#4»Á×y»òú’;Â(»™Î£<†â;o1Þ;Á…Ž;¶½Ø»–s ;¡<C™:¡fž;Ÿ><»JªI»åAÊ;~Y :Kn™;­Æ;Bò𹬄 ;Îq…»tì¼ê):²œÝ;|•-<Êýº€ƒ:;¦Ûd;¬—F;,Q;0çŠ;Ö‰»’7غ}?'»)}Sº7¸ß;Ýï:vb;§N;ÜÝj»h]û#’6»®óY;O;Ã=¶;º¯t;Jùð;22^;¦·;’ß;6ö_< Å—;ø/;åFZ:•‰ <¼Ù;Øz <‚×fºô.$<•]^<=µ¥€; q;yÛè;#øsº±Èn;zÖR;qØɼ$Au;ÑøS;9‰!;÷×&:žËî;ò^Ò»­©;º’g’;XºÈè×;øy:¸Ö;Ó°ß;“w»Ùhk;•ùÿ»4ë:I`D»‰]U;ý»þh»°%<»Ò»C:úÅ6G»+—M¹ógþ;x°Žº”ù¡9“ÁÌ<#ž¹'W·¹°ÁgºÜ©è;õ² ;îR<"¹<=ŽG;ÇÛ¹ݚƒ»ºÖs:ö5(;¸ªz»|Ýݼ˜æ;‡R<eþ9Èk¬:ÛL˜¬<™ùÉ<¡¡¹%š»”Ö;‚¥›;@Ó™ôâ;¼zu<–‘ˆ;ÿ"|;ìŠ.<peºÌ F;éÿθ¹š»«A<_³%<™A©<ˆ#<38¼/Ë<*S0<‹»ì;ìa»y±n¸ÎÌ;; F9®j[<µ›š<¦ <”@Ô;‰ßõ<4ò><;Š‡;ëÆǹíøÒ;”Ë‚<I;¤Y™<8å\<Ê1ì=6Y<¥gÃ<g;ÿ£Ò<²|`<òa=Œs=5~<ðá8<ö•ã= 'É</=‰€=¢¿=)ýü<Ç„ª=!ÖX= Ȭ<ØïÀ<ò©>ÿ<µ [<´x;¦ŠB;ŠÛU<1èÞ ’;EŸ;:&°£;mÿ¥9ÁÖ;_ ºø;lAD¸Ûªç»)˜µ»C/¹»¸eƒ;ÿå;u?!8&;ðغ¥»*Ù:øã»9ëÜÉ»ÐÍŸ»n)º*è»J@;«gô¼†/»ÒÂ<3%+»Ê™:Ü Ï;奰»g]-:ÒP;î´¨¼ hüµé9¹™Ø»'°’;Ê4A»i¾¼ZW9êzL¹ ¸:!@çºéIL»K"^;Ü$»*žÊº®œ¤» µêº•Hçº(¾»Œ²§;_„ :ìXi»—ôº‘»&Ey¼ð_:[°Õ¼.%Ø:ªÇ»ÉÞ!;rÔ;Ô~ô;ØÒ;Só:»A*¹;Óì»Á\M¼%«@»»Çt»ÿ•»JÌx»NYþ»I½W¸ë;L”Ñ»’Žö;]ˆ<'Lá»Ù‚¼?QØ»ñœß¼9{»’q¾;˜·Å:´7;0´ð¹Âœ}¼3r´;WC÷;?¿ »Ä$ ¹ŠB¼¹œGºëñͺ†2‹¼CB:§(¾:-Ý”»ÃÜß;øÈ»í›Öº@–õ;»zºÇÖ»€a­º­Jž;= ¹¹Ð”¹ë ¢:¡±º;þNª<ªd; –(»îÕS»P;Û¼‘»ƒáÍ;¤ge;ÆË;¢³;±„L:–1º¯|j;•>µ»Kf»|›1:Jâÿ»§”~6‚¾Ü»#?7;É€3ºØH;ò¾»Í5¨»í°“»'¢:³9ù;-¡6;CO9ëx“ºáøL¼&7ºÉ—»»6l,»Á\ɺø£»=<ø¼_–{;?̯»ºäº§¦Ô;Éè*;1 ‡º¨Ó»+£©<*ÐG<1qé<éø<Àœ:Ï…Óº9*á» J?»ö‰‰¼&Q¼.*á»Äàþ:ãQ»ÐZ@;—•Ë¼tQ+»Üwpºub;<5h,¹ÅÛU<½ ¹SD”;Ò‚ˆ;ÐHȸ°µƒºkdi;@æ;Qc:A\;à‘»¤¼»u7μÿ»;ºç;;œœ”;?ò;Ÿƒ»Ðºj»’[H;„ JºÄÛÿ»À³»Éä»—S[ºÁ?T;B¹W¹Ô” ¼¤¢: ]gñ»ðO黎§T»¸®»çq>-‹>j==è̤?Ñ>I=zûÑ=Ÿ*7=ÏdÉ>K>ÁïÐ>P‰É>dË>$>Z²è>Wiî>Á<>Y€>‹Y¼>­¢">­„q>Q->`ž >—[ñ>„EÛ>0¼r>$ò¸>ŸC>¡M²?¨ ?nºc?Z ?ob®?,…]>Ò©G>€Ž¾>à}?¾K@"p@†š¥@u $?~Ý?uÛ@³&?ÌTù@ˆ!^?ý;@v K@$nó@2µ@4Ò?Ǽä?Üõ=@ 0@ŒAe@ëà\@À<†@¥²¾@j˜O@[‹…@C­{@Rì~@×ú @XÏ$@Ÿd@V•š?˜îb@a™?×b•@ú/@\W?âuˆ?úÞ€?ëþ†?ÕSý?›÷@z'?4$?“ï3?¼Ñ?]O¨?_™„?;ÔÎ?2…x?*¢„>¸>Ô» >ñÞ=>”Xß>híu? ß?.ª?Š:D@%î]?ù´J@

¿I>>[ïö>[€i>Þbx> <†>fϦ>ÌÞ>ÞÓX?Ÿq?m>±À¾>ŸJá>¦òÐ>®™=ù8Ç>ND)>Å\>†V+>…{>ÍD>¡ËÙ>¤>Ú¹Ò??é>>¶>”ÛE> aV>Ñê=ầ>˼>™lü>•*t=- > G>X6>ÙÃ>HEÞ>PŽ>ŸÏ> Å=“ÿƒ> __>ì-…>¶G=>Ë&,>ƒHÛ>-­Ã>GG|>tks?çK>odm>äù>}Ér>›õc>víV>K“¹>€L¢>†¹²> Ï1>”›k>i!>>»A±?‡?K`¯@+uv?¦³?8<¢>Ä~>ŽÚ?Î<9@‚ƨ@´åû@Õ˜@W÷@<¯?Õ;?^-?’¾?ƒªÙ?˜ð«?ÁÌÛ?HÚ¢?¯Êå?õxd?OÍ?él«?ªay@Gp?ð„<@Q?´@Â?Ì…Ô?Ò4@s@Ô?e,?ÄF>¿ªÂ>ú×™?d>ž?`?/Â?\†ñ?…?œ?‚*>¿sV>ãZ>Âo%?"ŽF>”ª>’`>jâÖ>cÊw>9:s>vÚã>û[>]Hâ>V™,>=ä>VÛ|>bS>¾©Ø>ÒÌ?–¨?h–×?@v? y‹>J*6>¤Ó>–)£>2ö=¸/o>‰&±>Œ€>Š{€?¿u>¯ôx>–®>K >p¸>t\9=®Bz=òÃl>êÙ>;au>¤¾>’¯¾>S>™•_>¿. >9H>3mq>Ašþ=ýhZ>8&…=àì®>GˆC>Þƒd=Êý«=ªnë>mç·=q¿&>PÐ=Òš›>2±]=¹}E> ÃG»þb>3¿Õ?ć²>¦`o>=Ó>;õ7>0®»>2Á>ÛÆb>›ïÍ>pÀ >³û >B(&>š ã>g—> >’ï>u¥õ>€V>‚›È>Ë‹? ª·?8žÌ?.À¢?gÒé? ¾ÿ>›q0>¤>—äí?Q3^>ýÓ}?UÑÂ?&a¡?u²±>÷ R>·„m>З•>å>>ÕöR>»Õ'>™>Y>n+0>Øn>Ç;e>:-I>ƒ'G>­šÂ?ºh? 1?bEe?D‰Ò?A³b>øwí?G>²Vá>åþ?"a>ŽY˜>‰zî>‘3 >M>ªO>³‰?ï'>º÷>‹µ>ˆ>dÝ>rî8>>ƒ=¦:·>BÀÃ>%#)=™KF=«¾e<Ø,V>Ôu>H€è=½Àv=ÊU’=ã"‰>Äø>Q¸Å>S£å>7}L>ƒØ¤>~¯Ä>VÒ>š3>÷Â>Vö>"Wu=úûš>ÌÂ>mb>g#>^ï2>–¯†>zö.>lÊw>8µR>‡·Ó=óÈT>/Sq=5©=¥ƒ>7zË>¨à%>;ÒÂ> î>d[b=çN> §f>J¥.> A"=üò=­LÒ>ð=Ä;ã=¼èX=p*ú¼PÄ>@Ý=E¨=Ð/ý¼ûÝ×=¼6C<ú‘r;5¦= *=ì?>T™Û>5(ÿ>LÐÍ=¿Õ,>8´Â=ÿI>–xF>sì§>EÜ >†Â­>™(Ž>uœ—>Zº¦>Sr >$ß>£`f>z<Î>Œ‡›>£â&?¥?C@‰>ûMö>€;Ž>q¢> î(>VÕ>|Nø=Ç¥†>tîw>vÍ°>•©Œ>œú±>ˆŽ3>“ªI>–ÆÓ>B>*)=†?=¢G>Pú@>ý=:t <×É=±¾>'M>eÇ>½6ˆ?Uí>ôâà>ןË>1üv>ŸaY>>‘%>e¹>>?¾>->,G>€;P>Š;ë>…¬ > ·ç>‚AØ=óŠš>ûÁ>¯A=òº><ãaŒ=öšÉ=¿V<ªSÛ¼ÃåL=Qp*=¼>*O=ôi=ïÉ<êÃã>¯à>²C>LG¥> €£=‘,Å=rÛý=WÀ¨>kkñ=ßu…> ¾=>}f=ÏÛæ=¯ï§>ÅI>‘>yÙÇ>F‘T>U„>I”=þµs>™G=»[À=píª=ºŠv=Óèä>>n¬>VÎ>>Âê>W2=ÐøD=x¹"=צ >UÊx=¤#L=à™>QºK<†s»=¢[ì¼Vry?Z)R=Ðø½ãN½3½£c ¼Ëj{½à^½>6/=©EÎ>óù=Ñ0=ˆ~Ê>.ð>&…>-¯Ì>d7ø>3Ê~>}ô~>ˆ·>œÇ>z¥>"M>N$•>ª¶>—G%>„´>>iÈí>¨L?™¹>Ô¿P>‘Ý‘>O\ç=×l•> Úè=Ì}==Ž[~>c >ÂA>xý›>'z:=ß„õ>$¸7>djŒ>HûÝ>`L½;aÓ¼ú "=Ö⥻Íàž¼=š{;³öž=4o›=±Bp> L§>i‡Ù>³¶ü>â>DU=×{´>-=n×|>Õ·>x>DQH=Ïp°>-±ì>à=ÔKÇ>O">!>G>m“>.¿Û>> ÔÇ=tâ=Æ_Ã=Á9¼.;\`¼&¼=Ìv=°š=¨6=ƾ=½ļšoc=`(¾=wd=w”v=9Õ}=…<¼…¹Ö<šs¶»WS2>8m>(<þÐ^=óá>ª=³;B=ÞÉË>%úÓ>eì>Ã=æ§k=Ív>D¼Ž> =?£<Óe=ç¦F=e×/>ll>CD˜=Ÿê=©.º=‚·»½&Ôï=ÃY8>1kR=>Ý×>€E^>=Il> ó>=u -=hS»îÅé¼Í|©?Ñin½9õ¼Ÿ½¸½´ï½³s½’!6¾+Ù¼²í8<”Ô=¥m>8=å«Ö>nQ=³ _>QTù=Ö.â>'´>inŸ>_9Æ>f2>ªV>(>mÈ>rËi>3]f>q]Ž=þjJ>|j8>ï |>¶ >c²>Z_= Ü=žxS»ï¿=`£=}.>( *>†>U×Ì=å>W`=xµ$>0Ñ>Y»˜Ö½’±G¾çE½F"ù½Œ‰ˆ½‹bJ½Då½ ²q><b=¯Œr=ã[=°Jý=e{Í>à†>#ö>>†è>(mú=©”®=gî¯>Cçü=ÖéZ> bt=xUÍ=Ê1ñ=¦ú=Ç\=—LŸü,=Õ+=ÒW°Ë=Ž7y=I¥ø=”¾>+Þ]=˜§\>N¦=²ë7>%ïá<þÄÓ=×­ý=º^C=­²ó=‘=h<¬Z>™=à<=–L$=Y=!=–¾I<´˜=ÙþÑ=ä>&n{>dnè>&Úç>p«=ÜÅ°;¥½“½ƒÛ½Tæ—½‚Ÿ=›åÙI¯=ûc9=‡mª> >a¡2> ¿>Jj=ôÆ">Ñá=ûyÞ>1ØÉ>Y9$> ] >_³q>™`>-$J>=öw>¥}">äDn>‘“ý>9=Æ“=IÀ¬= ÓÇ»¢Y‚=7Qç=XY_>ÔŒ=Êpe=þŒ=ÛzŸ=Áhg=­É–<šg*=¦à½*<½Ç3Ͻ²Bó½Ì{I¾"°R½$øð½Ç¨_½¿44<+Ù9½ïU=Š)>]=Î …=¯’•=N>5>4Æ>Ö<Ü£Ý=3£5>$( =0Y2>Hò=ãRì>«Ê=ƒ{ê> ]¬>Æs=ÄyZ=Ö1õ=V­»Ñ‹=¶|¼=¶aL=‹ª—¼ù=µŠ•=ľ~='Q—;Çûg¼´n¼Eàñ=ÿØ=Ž¬½p`­=úL½|n¼ k=C†Ý=õÜÉ= ³='†u=®-+;zë|¾=œV1=¿¾Ù=g=± \=»Ñ=Ș=Ê· ¼æiÙ#„¥=ò ß= ÈTº>M {>ŠŠF=í =ÍÐø<ñ~ì< |t¼ øê½pµò¼÷Ÿg=‹‹É?=ò#=ðò;=ìxÌ>Laé>%?K>?G>YÚN>'ô>xT=ØÓ=>¨>‡÷F>—´=>—•>¡>uµÌ>ù¥{>Ê£>†¾b>'ð=oÊI<Çî½Þ½½<Ø+_L§º=ùA<ªh¼P·ü½µ¯¾Š¯¾,µf½Up ¾éx½Þ1ì¼®˜ñ½ª-ë½³è0;?®½@ý1<³Gó»Ë™=Ásc=ib=¼¤Î>,ûè=4¼=háÙ==‚G> ˜>ÎÀ>ÒÂ>è=Sa>Ù?> p> ¨ù>3K=É^=¼Ç£¨;¶Šn=ß&Í=žO<2«ì=mû=£®=…¿?= ø<²‚¢»…‚½"cY¼¤T;.Öß½;ŒÚ½¯h€½-‹Î¼;FlÅ=ËQx<ç¦P=¼šn=Þ…=e&>æ;=÷R½,…»ªøR=~1;=2ÞÛ<ÈzN=Y‚=;¨µ“=žéA>`­>~ïô=¤…P=ÞÎ;=ñ]æ=.rÓ=F曼‘Ú$:óQ–;òOF<‚Z:K:úºk:µóü;COT}=< Âä;ë`ñ;(²6;øˆ<†‹< b½;sñ»’k¸åq˜;zÉe;쪻1;è¬÷¸õ<:‚Ûc<'*×:ÚS;ºûP<`é:$›;‹F!;§oz:€®¾;¯É;?DÄ;Co;‡Ì/;ªŠ;¾2ÿ;]uÎ;^A^;bËÁ: ßä<0°G;Cö8;Ûlk;+àq;‹Ú:ß.";Jß¹<Hø»7µH»[‰-;·œ9;»Ð…»9KµºµÖ†»®Q¦»Óè÷;»¯-š:á;GóûºûžÄ;Só;#¡p;Ä< 9;Ó;0Ú4;†:åÓ<ûØ;dlÕ;ªû;‘Åâ<:L];ÿ;š ;$E9ôytºñ²|; ÊÃ< "÷;˜Åÿ”ºgYJºž^;ß:x» ®|:ª‰H;“¯;+Y;ÃuR:¶8P;Åb8;Baº;ËkI;úÈ; /¢;ûãè;íKŠ»ÈËì;¤Ø;†V=ºE:£™M;n;L3o<6(f:Î0 <:ÐG; ά;Å-9øRÄ°;λ»Ü:;h½»]•ý;=«»Ë–»Ûœ;ý »yã<-ë[:½ â»éÀ(<”ò ¼Ý(ì»ò¼î<\m<,áv;ƒ¸ºà}»OHæ;Á3?º(­ª;ƒ•T¼ “Í<ÌԻ؞R»×ŸÊ»ÅEïü;…øº÷þØ;T$< B"< WÓ» iº9$ » Bí»·ý;¡Î8:ÔLÄ;Ò;~¹Î9áV:¹I/»—¬‚:¨‡»˜<[ Ç:“ˆ;%jŒ<Ï?;9˜¯:u&໫>(:Q(Œ¼âýo;û^³»;€;±í<‘@š»D0»D8<J ;Öy°;s¥C;¯PT<;|<„’ˆ»™.¸¼A»(7ÑÜÌ;À ,:X¥³;™6;ÿŽÎ;xDT»wZý¹‚•;‰S»T¦f;4~w;â°á:¬e';…B•ºø…1;Âk ºÏ¬s:ìj9ãS:vÃ-»‰Œ»ýì‹;˜¶á;˜b—»Ë²À¸Š.â;u´};’¼ a»™ù»ÀλíBN»Æ¤m;ôÔ¼ŠË‡;¨.Þ¼#a¼/Ï<ʹ;é¾ç»“”t¼–Dºj‘«¼à »޻Ơï;5Ž¹à‰j;~&†;žÅ»×æʺš*°¼9¬ã;Èô;ô0Ñ:Ù"º'E¸»ˆ×;0J¶;_ðB;¢³»ÊJ;’ÄU;ñ6B»ž ˆ»hÒ´º¹»X]¸;lÓz;…CÍ;¾ ;äV¼8[ˆ»ª;Èó;Ã:…Ì<;~«\»_™Ó»V.»i2o»Æ溊Š˜¹ÁyÑ< žÌ¹¶Š;-wY»±Å;V¼§:ÏŒûº½ü*;7ðý»atF»¯¿K<ƒ¯Á<†©.ºŽ&è»ÞJò»Qn·;å0E£P;ÛWo: %»Ÿž»µíÕ: Æ$¼¤2»ºåɹC};÷_ž<Òð;ì/ ;”ã\»{‡:eõ5»>©;oh_;b8‹:ûè—<1B•;Æf_»nË»šÖû9jÒ:{|;O:Ø£º(c;ƒÀ:–d;¸×”;Ü;{ýœ;xâÓ»€J(;™h»ªz ;µid:îBÙ;qØî;W(š;•1i:9Rl:îÉh;â–·»즻doÜ:G*»;黼)ýº ±1»Gm–;×k9ýÁ;\Ž|ºÚˆ;ѹŒ®@:ÿˆï;ýVN; 1>;‹eº€³c»p˜:7;3]È;ó';¥Ç®;ñA‹;¾‘×»ˆ»\L<0©Î<:Ô0»©·Ÿ¼<‘:Åd;’×D»5œ0<Áëy»•5@:Â;Ýqè;*Cà<!7<‡‡z»À(ñ»i‹<›ý»¸ô'8̲7¸úÈBºÆ\ó;¤ßo¼?ƒ¨9†,»g¶X:ø)z»žµ:ÔÐ?;+Ýq:×™¹¹Ý±¬;·õ»T‰"ºþ?µ»J´­»…î»Pp|;¨Ñ°»†8¡º`ZØ» —<' ;"\=<”….<ˆº2€ < ÁÓ;º@÷9Ïk»Ô<]q‘;AÞ~;¥cø;¹éñt;»‰G¼}b»Bˆ;((#:ªY;æ];µuÛ<e×»' fº‚ ;»,ý8¤º(;·8ã»_BÙ»Š×¼»#?<„:˜;ƃ;â@O¼î:;¹ƒ9NæÝ»’˜;§~Ù:ƒ„%:ëÜ“;˜‘RºOçñº)¦œ:`Õ º¶å»‹ôF;H»•Œ‘;†™9:,Õ=:ÖA;ø爺òò©;CãQ:ôcˆ;“*T9œ9·ºªTº^?ºœP-;¡ÕFºÜëE‰:ï Ò:bû9»P¼É;zyÀº™ÈØ»f]ž»ùK;ï”a;„»°;þ»ËêÈ;\‰š: Dþ:™Pî;uSô;Ûxå¼0?»|F2;ŽøDº€Éú;Ï Úº÷Š29ÎÒè9ñràº×µ;»A¡^;ÔƧ9  ]:„Ö:ñ1Ò;ëž8õ† »)†‰»}ç¹;9(PŒ>4¢4=Hç>6ø;>%M=°¸>Nas=>‚)>˜³>âw¦>I )>é(>¯ ‘>äÉ>"¢>R®:=âüH>µ°=Ž÷¯¼N›<úÛX½5ƒ[½L›<é­¼àø=Åç>`î=“u}¼àY.¼ÃI½½Ýné½Î—º½G$¾Ûl¾+ Á½8u½†±‘½xk¼×cÛ=xg½ÕͽŒã¼><:âãe¼Zâq=*¨.=GH-<,<žQ¼-óß<­Zµ='t>//õ>AÑ=__¹=г=âÚ{=‘Vw>ò…><œÅ»/75<÷lÉ<¡ A=i <ˬ<»~ð=ƒý=)˜R<|Rx={Y¼½ñ½°·Q¼¥Åí»×_=p…g;ÄsÚ½Rϼú =$2=\"=Áp(=Òîj= µ»ñb=¾üƒ=Ê•=Œê=È@†=ïÇ>ƒ»=Ûkô=º|=¡0=SÓæ=ÕÓÉ=©µ¼¡7=ìat=T—<`!Ì»2±º<~=K >¹h><†i=§‰=4ê=þrÒ=ÇX=z‹”=å:t½™2¼fmã=BâS=š¢X<§Qy=N˜í¼]ǽ…Fà=Ú=„4=êP,=ƒB&>Pƒ=Ü=±[¾={‘~>Ð6>/óJ="ð<=»¹=Í¢=v>±>Nm>½h>#Ì!>›ë>¦?û>­|>Yá>sF¸>Êny>¬ >RÑ3=šßM=ç;_<Ëé·½NûU½A4ͼq^™¼{"»›Æ½4º<= Q>&‹=Â{<£*a<ˆwi½)½èæ¼ögû½³>Ú¾”ý½uݽü½ä½£ý—¼ç)x¼Èž ¼ßÖC½æ*<ýo=‘ÏŒ<Ÿ®=D˜0½—š ==¤5»ºŠ%½ûƒ=ôTQ=¥ÉŠ>¸³=౬=…´Z=uÁ=ç’S=þ•‡=Þ‰ü=Ûty<í&§¼Äž»<Ÿá<ÁH½˜A½ [;ùŸ=Dlˆ<ÉÇ»ºHå½lòï½¥µ#½¬P¥<°òÑ:¡ÂY½#Úë½˘;2‚v }?=Ð[®=¨L=V3R>6{œ>d =角=©¦~=\й=JJñ¼$\=T¼m\r<ÊUë=©°©=¦@2=«Îd¼ŸþÅ=¢\ÿ=f@>˜¤›>ª6š=:œè=­õÅ>É>å×=Ó£V¼#¦]=k§¥=Ô>h=}€½5ˆ7> qš>Qƒl<ÂM%½D3=È>GaŠ=Kð>Rõ>Q*=¾3> ®ö=Ãíc=È®%=òß…¼qœ=——==¹Qµ=Üyâ=üp>k>|Ç>©'Á>pCû>‡Œc>„ >ÆÖø>”;>ݘ=Õc=i¶=ž“2¼œ<Ȇ]=;ä ½é="™ñ½ B>¼d’“;›lN= ù=èH=€L:¶Þ—½wº½š´½ªaŸ¾!n4¾¢¸»üå¾'Â9½›ñE¼í6Ù½ùÛ̽ÜH½@Ä=Э=FzÂ;æá½ò¼2ÈÉ<<ìÝ×<9~æ=9Èß=²_ì>¥¶>/.š>ãS>#<éWÃ<ÞÊ=Àø=¶]ª¼:ˆ=Ž3¼[Ï¿=µ `=Gjº<*Ø:»ëÅ‚1õ=>–.<*ÿH=ͺ®=ßOÏ>B]º²ܽ¸ÿ½§¼Ðg}¼‚zi¼Äž;ªiÏ=‹Í=Ö&@¼‚Ù•;¸Õ`<ýày<Ñô >‹‘>ÂïŠ=fu?=¯·_>!U_> ù=Þçr=`x½µ–=‹Ò=Àxí=)<+½pÙi>EU½=»ÿZ;Þ²Q=^çÍ>ˆ‚U>P²=Ú >'š=‚Ô\=;0¤>[Û=…=ÚÚr¼2à¼<ÏÐ=f±z=ÊW†=‡FJ=ËìÁ>Yâ™><™>h{K>@¬¸>¤a™>©Nâ>r™Ô>GA]>%,=‚[< ¤&:Ú» »¼G9…1'9Èu ¼e.é½O¶½€Xÿ=ŒYe¼xÍê<‘~¦½&Áœ»‰õ]½snº½”AW½©f³½¬Œt½à£½¾ž½‰ÿ»¼å轞̣½0ÃW½bùm½8oT»¦¼o+½+£Ã¼˜pj¼žj=™çÃ=« 3='åÊ=¾FÍ>B>*Õ=d£|=à«•=ºÍ€=éÅß=†C1=«Ü<üS=dÄÖ=•É=¦~˜½Ù†=‡|¼zËB»úž»±£½%ÓÀ½9EA½@²l½ÏwÀ½ž÷ž¼¤½@Þ ºóŠ´.=š—> à==ÇÚ³=}’=—+[=t0q=f=§H¼tn+½!½é ±é=¥>½Q½È¼l™Ð=Yƒ =Ïþã=rhg¼£Js=mѶ½¹)a=¨ù‹=»>]êƒ>}$=Þ£‹=…¢#=iô¤º’çð> ý==twÐ; Dd=#PG=aë€<ïÑ=íºE=}±">m-k>–au>qŠP>›_>“÷Ï>Jº>då>$C<­§Q=Õ¸Ï=ª£=NQ#¼K<ñDB=g^=§ 8<`9¶¼§ è=6Í>x©=k„­Ü>Q­>,ŽN>ö+=0Æ•=æÿ=YÁ!=Ñö=Ä` ºP'==÷?=@wî= à=ÅQ÷$‚>?µÐ<=è=âJÿ<úßX<˜Bt¼‹Ÿ=:Y\½±£¼^º@¼ÜIà<¤RI=…á ½V]½!”½{›Q½,}ºÁ4 >m=¯_=À%>ð°>-—°=úF¡=ÌN½œªO=™ûE=¦­=§ñk=uª½Žy<°V¼Ã¯=‡ì’=?ŠÉ=é7`>‚ –>Pܼ<;=]›¼}{=Å–r=ò Û=¡dz<¦Þ<ööÏ=þë=T«r¼ÛÐ<g>žd>b$>Pmq>H£}>`‰>U¼¡> uá>pCª=ÔµÃ=ï=!=¹ïß<å?ª=$§<¹ Ï;«XÄ=¿O«=þ¶=fèH=ÿS>=B¦U<š‰‚zE=ˆÑÍ=Á¥==>R<<Æ$Ä>)C‘=7=tg§½·÷=“=6Ö¼=Í¿»já=¤ç?=M¶=ŒFn<€Ã½jº½Wl¼ÕFý½JQ‰½¡ü(;vÁT=tú<•¼,Ž3=“Îý=så/=ØÐK>.Ù°>ìñ=߇>*³à<àAj¼€¡=ŠÉ£»¨ =—zR½f—Ë=¾}»~ B=6G¼¯$÷=†©c<èj"È^=š#=Û>¦-= #V=»ÀƒR r>Â4<‹m±<ð „=›=ö 5<}â=Ì'¹<õ =v@=€=»LÙ=³,3<òë>@«Ë>ƒ—x>w²=ò>Y©>ŠÂÃ>*‚>4ϧ=÷Y­=ôl> X@> fz=#§/<3­<¢'u=£r;é<¯œ6<ÃO=¬Ñæ½ 9¼Ñמ<­¢*½,x·<9ò½3V+½ã¹É¾ Õx:«‘‘X¡=*Éy½†=>þ <¥år¼‚¾ñ=ÿ;Ü(ñ=L§=]òf=‡Ø«<»Cb=‡×=3}:ÜQ_=Niµ=NÝa¼vÊͼà½V©8½wâ$=6tc=\)œ¼¹78=‚è< Å><E€=ÝV0=Û©{=äÓ­=·"=Ÿ®Ý=; <­´"<:œ;Ýs½rP½C’=R¥ï¼Eå;Ýñä=F†=<“c6½¸7;¿€Š¼táQ½H'=}Ã;½ßM>%>>–­Ä<–VD¼¢Ey<°›¡<×Ai¼_ã=U£^<¹y$=ŸÇ<ôô‡<Âk)½;Hx£½7E=6ó ½ iÍ=y F>‹õG>b>“À¼ÇSøí2;ŽŒï<ÌUûÉj>"Ž+=óIn=î >´>af»>=¶q> D¹> k¬=Ç„=º@Þ=Oú=ƒ-¼Í“›==ÄJ=èý½ =±ø=éä78(Ã=œ-=£1W=J»=×Ú6<Žâu<1–!»íoŸ=s¨ã=6ºÑ.»¶yú=¤8Ç>XZ=a­D> º=MyG<Ÿ¼<‚&]½Âà=*º½GëM¼é…½Nò½Ê=[´ó=@ñc†^ì=ɱt¼ÒâÒ=q< .î¼ÖAò=V \<É?³ºN¡w< î9:(‡:«Áõ»š;@»ÇBv<<‹ç»G4;®ôz:öÝ·»Ÿo±:ÈM4<-˜<É3;ù¹“;`5˜;XÈ~»_™t9Gð=;y5«º5¾ê;ÑO9º²‹< 3RºÛgŽ;ÁðZ:šÜ<.í¹‰Å;6/;U ¼q§°}ºvO̺ʳ¥;¬à[;8ÇÝ·œÁL< zo9Óeà9Çòº$²» í99*ð;ñ"Ò»¤ôr;Dü<;€ù;‰»ã.D;—½;À3!:§h©;»·ø:†<§9ì™:œƒŒ; Ç;*ß;Õ\A»cݺ™º<‰â»¨ ¼¸»ªMÄ;RlS;Ísòº²×;yZ;¼áí<‘É0¼l W¹Ù?ž;Ó€¼ó»‚ìù»œ3{¼=( :¾·»@mÜ»‡L²»Ó-9»ÊãÀ»Ö5ê»Í»®\;åy;¿$ºžô¯»?*»äY¶;l’³8O fºí¤ ¸3 ²;;ƒ€ºˆè »«r4;Ȥ2»z""»vI;C/Ê;qŠA»3÷ö9¶¬§;w̾;ëŽ;îÃÐ;Ö;Õ·;ìˆ6;“WÄ9¥Ñ;Îhð¼*Hz»ƒÁŽ»K;ãË·º×<È<ûä;³{j»uœ;ç¬%;§ì«» S»U.]:hºO8×< ûp;Æ8ê;Ôy 92ÆY;ŽY.:š%¹;+Fƒ»Ðj·»ŠÌí;g«X<*f;€ºhi»….r;k»”» HW;ÐŽl;íJ;;Ά»&¡Rv;ÈžP;ü ;ó@;ÿ}\»‚";nÿ 9îb:Ûƒ<+ (;}qE;4Ó¼kÎýj;S‘<»EOX»Óº™0§;ÚeÔ:u”?;3c;1€¿º£k²<s—»Ó<‘кÃ\l:Âfc;…Ü»#v¹»|òn»¶êλµi­»…É®¹ÂÑ«»†De;MêT;Fc§;UÈÚ¼k»/ç»8©îºÞ{ ;?GS¼H¢?;Ÿeº-Ç»?5ºÐ;TW—»&Ce:ÅB¦»œ™»—2€9÷_e»¡¤»ðý»„ÕŸ»ô=»;Œ»»¬)ê:´³ºé}»ìbÍ: Ø3;OG»®|Yº°M²;Ø…î»?Vµ;_~;'k]»LQS»®¥:È·F;Ïè&:Ò.›»p;çþU»“<ØA;—bq:Vïú;º¾XºÆvÉ;äØÅ;1» Y?º½ué;h@€;ÚÞ‚°U;eCžºìÁ;;;s;…ẖb»ðt»çBU;ŸÞo»GïiºÀˆ;ºìÎ<V<5Ž#<ðŽ“@¼/•»y8L:6µ£¼üººÝ(»ÌÀ8»ìÀ˜»ÍÐ;Ý ­º¡)Ë»K‚Ö;–wd:zÕû»2–÷;žõ½:£`8;„®;àñ3;©M‡;vè·»+{<ºÄ;O2+;ô×»Œ_}»ýn%¹œO;£q´:Ëp¼¦8»Ó>ºËý:̧7P-ºÅ’»ruÆbÌ:½hÜ;±Þ;<^’»†é:å×̺­u¾;ðGê;ñd$»‚Ék:HhÕºûŠ¤º5àL»•Ì9“g¼2D?<hò:迺ø <°\;§ÊH;σ ;¹Ä¥o8¢g;åл|~;½ÛG;“•ß9˜Z6<%绾55;”0ì;|z;f‘»ì4y;ÕÆ:\X¯;c¡[ºqíÙ:à­< ô»¤$»…hnºƒÇe¹­\;„÷%;"kÂ; |È»ïB;»bq»™.‹»ø®‘7­Ïؼ¿Ü»¼Qûºªùf¼[¼F»± »Xù»Þ˜¼‹ó» ¢ º¡ÅÆ<è½:¼d¨»=âá9­…Ó<×\»´án;¼šŠ»Î[_;Ã,Ù;ˆ!';íAQ;‹1Õ¼:®Û:÷Žg;uä2;±ì×¼M‡9ªÄ&;Íáá:œBÎ; Æ;³;u“‡À¼„ú< šËºöß+8ƒ Û;ÏÁºÖ C»3B8㱋;ç¨:‹~Ì»ñ»/ñL:…b»ïG=;Ãî;ãî©9÷»rÿ9q.¾:‹ °»o²c:¼»u÷‡;íÿBºNªW:Äd-;i6;çH¦< •Pº•ëª;¢XÐ;³‡ »];ÌÚc<ç;ó"9»×y»,þ–»¹O9Yyð;éâx<6ß;ß•²» Xâ:ÅzÝ» +;‡s¼/¾¤:VÓ¡:ÒWÔ»8ñ; ÙQ;é¡+»¬r~;È|å»Y3»rœÅ„;Fp.»øó5»A@»ö¼SN”»³p‹ºP³;Ñÿ—;ÄZt»¿N»¹‡c¹ýbDº6Wúº$´I¹›Y{9´¿» oS»ïdC9öJʼšC‰;oPÊ;¤<;{^¹é“:ŠOÔ9ʦX¹Êˆ;ˆ„[:|:qºü <o»;}•;Ï+YºŠ‹u¸+"™¼‡ <¬f;áÜ|< ‰E»Û£»ã:a»š4U»@Bç9Ó"Ë»›Ó`<Ó»m¢¹;£­Á;½úœ;¨`š;Œáiº @ö;µ¬t<¬Ðá<Do<yë;ƒ•1<"[¾<=¦;ó¶ ;…¹);¼ M:Ä; ,8¿L|¼6ú0»„É:ãV\»×gߺ®¯v9Ë+þ;œ$»:c…»Ê»ɟº¿à» ";‚1•;E%Ù¹æmz;®àá;DÃó¼,Zd;E×þ»4Ë;;Õ5<+E¹ßן»cÿ;Ü»¼½8ºŠe×:¬MU8¢æÐ;lsº:ðo<9m?»’ŽÜºÜ–#Ý˺5i;Cé;<õšÕ¯¼+¼6¼(R<<C‘;ƒž:‚&º v¼Æ@º¹OкªÜ’»JML»Üæ;;&{T»]Bm:ÃbŸ»»7§»Ë¢¸ö½¼.;&dR:L;A ¸ÓzϹ¦Ù6;ë7ø;»h{;´-º|}ª¼¿=º¶ ?» ¹ºª -9¼oºÄ¤^º®‚Ó;€Á><¨­j$º©†&<<Ãźh4ç¼#Ïo<'D9µ‚O;q9D:Ó¿:} ¬;€@_)>Hœí<œ>;z6ä=O*n=Ž¨W=¡fæ= ´<ó.3<)O<<ÂM4<±7J»Ï¸<2>cÏ>fþ>DŽ‘=3æ=Œ‹=<ó;=²…L=ÈŠ°<¶D;œÄ!=œö)= Rºï=A;òÅÞ=êý7;–¸à:f½%ú¼åE²;fñÀ½•äĽÉZK¼„Lä½Ü=«/(=ËÂÝ>;"C=Ä™ë=u=-5+=¼¾¼¦dþ<„/½³Î½Gž=8¨=¸£#=°ØH=¯o=oØt¼Ùðç;ìG<ûÌ󺤵(½ž Œ<µ1½=!ÿ¼>Ƽ8@ß½ž§F<³³¼}ɺ(¥»½·O=Š$,>Hº<Ñö#;Lžh=5×½Vo¦½ ”è=0+¼-½—<,äý=h*w=’²‹<ÊlÒ=%ÌN=Û«=)ü<Íí®=áóÝ<—›=:c=g‘;b†=®±@>W1d=kC—=ÅG>QÐ>o®><"=´ÚN=bËg=ÄŸø=–§|>Ef=Åh=Âz:><ž=¨œ‹<¼¿Ð=PX÷=qà0<—Û¼º»¦¼‚nl½^b½ê C¼Ë½¹½8±½¢¶‚º#9ʼ”ú[¼Ài½²?¼­’{¾-½wͽ¨Ì½³÷©¼áÜ\½‘½Š=ŠÁ=`CË=ÌÁ¢=€?>)ƪ=Î=™þâ>·º=^{7=Õ=¦!< <ú=AùÚ½TšR¼†+$=:2=áØ=õ¸=Êм;Ûl=@\k¼xÃç=ðÓ½tù¼@*F½¼e‘½a.»¹È Ç=’è=J‰Å½2½`?̽)¢¼9¯Vl<Áק¼–ae<¥˜=x‡Ô<j¼—äa¼l±Ï=}#=NVÒ=ˆ­£<Š”ؼ?ƒë<<=Å Ð=5üc<–f==\6»€"…½”/a½ü­=mù;•*<ž=àãÍ<×.=J•¼öô=½ áÐ=Z\<ï™3=öl;=Þn‡=…›^=VŒí¼Õ6a;æ¡ù¾xL½å]½…½¡uÁ='—õ½ ;><нݑ ½o¥½³ß[¼M:9øÝZ;¿þ<Ýßþ×=g”Lüc>pº >§“=¬–Ý=p=àl¢<ŸØN=gº(<™ŠÜ=ZN¬=žbÕ=Ý4=ÿŽÛ=WD§=0觼èT±<êìμý‡ƒ½˜ë½,9½}/½!v™½'§B½AÕ½D8a½$­-¼$½ èñ½È ½ÝÁò½é')½êíº¾’½í™A*¿!=©u€=•ª=•üa¼ç†õ=×S=]be=¸~³<ð[À;ÖÊ„Ù=ú1=‹Ží=mt=L±R;ª’2‹=øz¤<þ.:»6¨Ï<³Ã=ºH4½Ã ´¾$Ò½ˆ&˜½Âê¾w²»JR»=%VŽÕ0™½´GÕ½Õô‹¾&2=sž/¼,Y*=·YÃ<‘2D=¬Ò‹=ggå=9¾°=EÆ>Ò»=ëy=I5#<%s"<¯@±¼¿`¼ªÔh½6‰e=*}»åX™¼Ê™ñ;áú¼¿ß;Ì…”½^bB½7C•½±•ï½ù%ܽpÙ½ E:½ñCð½ÓGþ¼æ軿™ê<(J¡=¡ö=õµ=…”¼=ê—ê=¥¶9=#1Ú=9é{½—Zš½3r=+%m=“Žý»=m±î<¦OܼwÃ9¼°\B=…ÈÞ;±U»SVx=§<„<̽zgt»¿q8<=á×<2–’=4É…<ÛMÛ¼€Jò½6Š½Lþ¼gyQ¼c ä=1t‚=›‘><âè¼ðô#½ ¥';È÷˜½>CH;óÞ½5·½0w½šÍ½ˆT¨½WìØ=1Ær=‰}®=cG¾<Žàl=*p¼ðüg½ª¯ü=«´7=–3=˜~żÑY=Pä=Îd½xtL½pmS½³©"½_üŸ½Z¾^Ó9¤½~ ã½tqë½mM¬½¨ûá½’°ë¾ÔP½GJ"»À”¼Àc„=…Lå<³ªˆ=ë¸Å<0óÎ=KÒ<ÖÉ =H¶®=‹R“=ˆ0›=Ì[2=—¦×<þ¶=Å×@=Å©Ý;IAk<ãÿÎ=Ù((=#‚×>0Ú>ŸF>߉<ú=]ñ³=T†»¸iF=F†”<çBÊ=“¶½íÙÁ½®ô_½55É:mãí;¼@<Àž°½Æƒë½–DȽ‚´i½­¡‡½û9¾£¥½V Û½ Fé<ü€ò¹=¬~=@™«=‘4Ï=í§=žÚ´=éH=î>Q=ˆÑŒ;ýö½Æ›mà¢=zçÎ=×4V=¹³·=6Öa½.3/=A@<Ù!<=ê\½ú¢¼­Çâ½nƒ¼ÿtÛ½ž±½€¨z<ÒÚ˜Õ=â_‡=Z²¥==º"=˜¥8=ô(‹=UÚÀ=îK{<åžK½[wË=¯•=,~=ïf=ˆY]=ì;‡.º=`«;÷µî¼J =tb¼=Óã <ó:i<"¸¼ºÛA½Gx1½;‹³=x~<¥j&½³¯Þ½¦È*¼A½—K½}‚¡½_çú½³ë•½f²¦¼:ÅѼ2Åa=¦Í4=¢e=à?=µr?=ð3÷=¹XÓ=…¼PiÈ<£Ñ=”ϼZ»P½¬â×¼½ ¤=ÀpÃ=_«=ø 4=8O=š¶ã=Fý4=Wþ:ŸkÙ=¬Xô=Sé«<ÊD½½Ð©²½mLÛ¼Ö¢½±'t½™ï½ùw=ÒP¦=•B°=½À»Ñ8)=`¹$½í<1‰˜»(O_=X"&=‘HH=©¦<ê ;¸z—½;=X½­lª¼N^>= wG;“¤=O"S½© D¼YO ½ƒI½½w¯k½Ç“‚½×©´½º¼š¼= M<—p¼‡â¬¼Eä=L¢¼à¼Ðkñ=0Àp½°Ã@½•&ý½ÿÁm½¹xX½÷›ã½Hr½v<ˆ½7½†“½v˜¿½¬Á‹½”æ½*º“¼„úˆ<…ôj<¹8ø=»Üt=Äà=÷yJ½w¾= ®·=RÓt=œ†¸ ½(H6.> p»fr|=úW=!µn=|>=K{<ÝŸ=ã[ä<¯ «=DW]=×µ½°|½Q® ;‹ \=lb¹:þw¼›Î¢»n b½±Q½(“é½-q½X;½’€^½?—]ºaFs¼ÉDB=­Vƒ=·©=}\ß>=¤¼Œ=_ÎÏ=‰W;=°®¿<Ü­æ¼Ä²–¶Y­ú='±´¼üàë½OU=p@=¼³\<ì‡á=ýà®=Þ=%„=Di¨> ÚÌ=®:»òÜÚ=TU”=cÄä½£È=hn;mã𺶙e=´=ÃîÄ=ƒšP=hÜ=å7<µ]g¼Ñ k¼„¾c<°‘0='•;³¾½4·½ª<"êë½í¾( ½él¾Sv»ÉÑ×<¤+ ¼ˆ„‚½§GüåHÿ½Z;=+Ð=!N=R(½¶½\!º½™Œ¥½ö㥽²l½M¿½ÑÙº¼¿ý½.“½"̽³ä”½îäN½h7½¤ï½á“¼.äÐ<ó׌= ϼñÍV=©Ñ;_¬-=Y«—=­l%<º,;|vË=A³99Ô:m=¢Ø=XÄ)<â}M=Ÿîç=û¾_=v}=ÛnÁ=j=8EÈ=M> Ù>{<νÚ=e†>C‘p=Ì^§<ÒãÂ=áK†=DcH=V&<_%V=N`= k9½'b”½XZ½z,¼Æe½«^9½9]O½|ᘽ˜ È=ˆ•‘¼Á@=˜êÙ=‰¨"= \^=´ò <›‚ =hÎ-="=Mõ½B—¼‘^¿á¸>/ì=Ÿ=Ôí==W'=º‘*=Ö–y¼¡J<÷/O½©ż-Ù ½Š@½´Q€½¨óD½-G=–r=Æ ý=îƒ=‰c“=ŠÌ½»‚tL»±ÿ=’M;šQ½LKK=¢E=;µ<üÝ•<§µ÷½^óp½,sŸ½OÃM=}¨q=› <Ò뙼ŽÐ½®Ó½÷½ã•?½²ý½ñáð¾v8½–ð»hsÛ¼¨Q ½ÆU¼¯ Á:ß¼²ºÕöº4Ÿ9îx;Äi¤:8·Â¹ˆ&M;¥<ª¿»i˜";ÿr&Dº6»ü;ŒQrº^w¹:hð;'Šw¸{S˜»kˆ;çÖºÿ›»¢xÌ;x¼)Ý¡»ûg»aª;|Ì;Áª;Tø;›Gu;{±›:M7`ºîNØ»-¬½:SÊ»x¶Ò;Â"éºãU¹µ›f»iÇ:çÅ{ºvú;µ‘d»†­¾<¥“<Á;|󽻢ýî; –Ø:×’Yºá ;©xº—.<##I;9mÍ;‘ˆÌò»é$;“ñú:ï9ª:Ò)È»dQ;i#¢º?G»í᩹eCy¹s(I8•È»£_8:_6;›mI»{•„¼)-:Þå;wH¶ºÏ©3;™+»^Š;¬Ç<rC:~cR;G3Cº)·û;Æðº–5h;ºkL;fò’;)þ`;¼º¶:Œqi»´®3;ÄIñ<rfº¨ÆÆ:’Pê;¾B!¹«¹ ;Õ¾î;~ý;¨'¤:åpá¼$°";]¤rºî~P:7&+;Óóq:ó–’:Uv¦;4ÒÏ;w ž;yN;脸:Lõ<%t‚;érþ¹p|¸»öƒº"T±;ÙP;na·:›5;kOg»+9&:­îÈ;ëÇâ¹,WÖ¹˜]»Bâ;‚8Ê;)Yy;³nm:¤y];;j3;“Íd;âùÒ;b´p¹¥æOº<»Ô:èÐ3»VÁ»ÉKˆ»>ÃäºRàf».k< ßôºc^ï¼oº«:»01¯»%;À`̼MÈñ»ðžÚºÝ²ú»ØÙ„¼;x»ø3ºÞËÈ»—vú¼4kþ»åì:©iÔ;Öƒì;¹ «;™Ö;°¿:k¿©:þËe:òº0»%‹…:À‰;Ô˼ g7ºÎM»yZƒ;L#,:[Íæ;dI};°A&;pÚ†9#J·®ðl;Iˆ+»©vºz¹œÀØ»ío¢¹¥Âà;¹6õ;Y!”;„L[;åÈ\;M¾9ml :Ì;Aò;ÿ¦"»ƒä3»ÝÝ;lhL:_âá¼føÝ:Þs.:#¬ä»Üäæ»/ø#»ƒcr<¢³<êœ<2Ù;­ØV:¨jÒ¸S)»Ë\ô<ɬ;-ÊBºí<Ã:Ù¶¤»Ã6_:ÛÜ€:&;ó>ôºÆSÝ:Î :•Hþ;€„9»cÚºX:Æ»ìç»­o4ºii²» d‚»I໳P»Ð÷±¼çǼAø;¢R;ó<‡Ì»6[âê9¼‚Ô©ºÔV£:ë³»†Þ9„;R„:ø]:€s<<_!œ;ã¿õ;Ÿ$; h<‘:E<%Ž›;¢†¥;]o¼EùD;"ì/;{U;´n ;0¼ ~);MŸ‹º¥}Öº¥³[»£Tk»BÖ«¼tß;O}Ð»Ò ¼äÚ¹€ªC¹±:cº3òϺµ¨ÂºJØ;…eÀ9hÕÁ¹—C:^;‹Ê»‡¿ñ»—ø;‚;[:†‹y»%˜»É컇Œ‰;ÉmÛ<¼„;-XX< 1:d ù»®‚» í;8A5»ezï;ØVN¼8Ö„<@ÿä;{”U‹ »Ã…®;š*»]G¹R¨}»Hã;ƒc»•7a;Çõ뻉A[;¤‹T:ðl;(Qß:Ò)†¹ÑÁ ºó¢Ù;M ¼;˘‡;§Z»^G;­Ë«º®b»Ä{»ö“ºrsÜ<4¡$<=:;3¹„†¥»F/»;v°;Ý;ý[;Ì8»¾»ù6Î:¬=t< Ò˜;:tðºÙ e»ÝǾ¼3호ÕõÞ»Ã?r»¤Ä;N;p5¢<ð–;z9!;žr~9{›;ó+¿:FÌÿ<'—L:ô†19já<”;ø„O9`8; ,‰<,H;ɤ«»8Š<p»°`m8šº»HÎÚ:ñÞ ;–Î";“@ë;S ;EÜ0;€«Î<=7+9 çÅ»!Q;©dî;Ä*‡;QŸ¸Ô~{»NžwºÔŸà¼MÉy»ÍŸs8ÇŒJ<27 »¦·à:Ïœ?»¿¢¾;?šD¼yÙí¹|„Œ»â¬;A4¼¨ä;í7š:ͥ´ »¦€´;’ŽÃ;ܹœ—:<_:J6';·ÑR»„;…íX»{ §;³$[;ÐU®<ãô¼T*"ºG£5ºÕwù·%ù;¡ ¹»¢¯g<=y:TÕºš¢;¤ß¦:|‡<"4ý< ß;,|¼8HY»t”:bßf;¼]%¼ ÚG<ÉBe;Å“}»íUM;6Ï<ƒ»•~ó<@ ]<34¼é7;—Œê¼0£š;ǧ:¡P»¶€å:ö©C;„î¾< Ûh;Lªu<,a:.â¼ÐB»·§:ÌD:Õ_ª:< Îï»4<$”溜¼4:øy\º×j[:1Cå;K…;âE»q Y»^%»à ¼$]^»t:à;l y¹Ò@§»*59 É;ÒÏ;¾j<;Ò:¾:B¿"»\;Ù`»æ<©¼›H;l¨iºº5!;u»š »0.¡»’y*¼6Ð;{2Ñ;ÉÎ{:ˆúÕsºþ°Á;SO:8K»k¾ô0»Óè»Ïd:–©õ»²–`<æj»ÜÚ»®|k;·Ø»[--9âѼD®»-û:»Þ«þ;ãH:Œô@::`s:ür;ˆÒ\:sc.;Ó½þ;2ö;à껉©ü:³5 ;I2sº&ºÌ°ã¹þLÜ;¢M躣t,¼ u:èÂ~º¬Å<›»²»o:Ìi⻯¯œ»‡N/ºå•ú»˜,t»ÑÚ;áBõ;†Ä3¹Êþ;ñW»/e¦:Ê=:‡BÝ<Éê;ú Í;›0 ¼x9A»î <+‰²;½Õ» c<‹*¼-O;P©ø;Àý×.»Ó‡:l58<‡t­ºõò§»eJ <-*;¶©w»4ÇV<2 :5œâ»¬„:4ôÜ»ÚÝ»¿»›k”;Ä.¹¶ »º•*»«Ê»åàD»hJ»›NÂ;?^¼_ŽÐ»±\ƒ<s>»s&2»µVº¡ûE¼“ºæ;¡–<¼^:ý;ˆ¼õ;{ :NÐ=<&u;J÷F¼dÁ¾¼!;¶Ô´8ªö:nmFW;Š7a;ý ºØ¡W:ºXîO8Ö’¶;<‡»v/ºŽžk:“XZ»¿É³»mt°;t#‹;¶L ;(q“»« ;'åºÄA»¡Ž<žª»·8ºx’ˆ;1[B;¯ »T»—}‹;׺óN:ÙpκÓkî;ÏíÒº¸—ý;º!»‰±í»ð±dº™és»Òùu9ªÜò;¼ñÊ;;gY;µr;©ä[;”2ìº×Fˆ;‘ØÄ»ÊxÜ»Rß弓”:5`¾:ë"x»ì_½º©b¿:¹¤9;|Ôk<Åå»ôÉ;‘);Ѻmã;â’;™!ýº4~—»CW»…£ÿ¼ê9÷X:á£Û¼$üº<§d;kƒ»CºFýлÓæò;0}ô¶»¯éÆ<³’œ» Q;«É»Ìî÷;7±»}òß»Çó»±`ó;:ýI»Ê8»¼d¢=çiâ=œé<‚…»ÅÎ’½/õ7½ÒT:½É¨Â½jb*<Ï ½„°å¼eì½™$f½«Á@½âçî½Ç<½>û¾¶ ½­Lç:"¤á=@2È=$b¼ØÜê:u@Å=Ò«i=Æ1ö=£Êø<†hž9È<ð—=tjP=¿¼ñ=°FJ=uÐ;’DØ=ì€=Ñ)©<¸Nb< ´H¼ô ƒ=£ñ{> µÍ=¶v ;ôæ°=Ë©(>9Ç1=9ßê=¦Z”=»À¿=ø.°=÷^¦>*eW=u°»ÿã¼™i= É#½&­¼à, ½¼4I='u–½E< =¥§<?e=Xãs<÷¡Í=ŽNP=/à=%*Ð=lhx=mâØ=…ªÉ½xrѼ‚BG¼c5=½6ì|=[FÛ=†¼Z=reN=››É>ð= +ú=XP5= àÎ=ø"=ÿCy<á µ<‘ŽV=UÜø½‡Ð½ Ÿó½Ÿ”<¾ ·½Ûᕼ·=¶×);Ì{À=UHë¼Ä¼é½Y˜;Ú"ë=›ø§>/¿X=U=.A-½ P*º§õ=‹äE<п»ª+b½2\â<¢]°="G1='’V½‰µ¡½}zè½­ÿÞ½Šµ)½ÔM½Üž9½ÚÞ)½Û/¼£F½ Þ=fµ¼‘ÌA¼¡œ»¹u™; J==â=ÛôÀ=R¯ì½ƒÜ2½»:;½F01½ Nƽ~Ñ|¼f.½t~½î ½¢ º¾ô½¥Zu½•A¾Òd½· é½]e¡<²«á½;$²Íö6>XÎ:=531;›Õh=ÙÀ=D»=<áˆ<á”ø=0NŠ=4Õç>%©=q³˜<Â~)=ˆ{0>ëz>[u>1{è=˜+=‹¼¼š<ß­F½ãd½QP=½výø½]Ñ<{=–Ù=©†J<âlª=-B†=æ7Ÿ=4 ’<Ô°=Sî>é=2÷ ½§î: ™ð=í“=*4Æ=ÌU˜=`¶Ÿ=Â7A=ŒÈì=EFM<œ¹c=ˆn=Œ’$=Øòá=*ÇݹŮG¼/çá=2C¼6²È¼Ö·½jË[½Ò;I/l¼Ñ ¼útM½/Î=~…[=êä~¾ _¼° ¤½»2Š½ 7ݽ1 À¼Ëûæ<²Ç¼æ…ý<à(Ï=ÂJ¼¤k;éÚì½(‚|¼Ø0v=l—“0YÄ>à¶>Ž®<øŽj=éB=Yüå=B›Ã½SRÐ=:Zo=©¯¬>åÇ>.D=˜P=1ÿº=ÿ—=>qÕ=Ïk=ÿ;=ÖÖ¼À3<Ù‡¼_Í⼕ʊ½ƒÃ[½êRý-£ñ;¨+a½YÕ=oŽk¼ã!¼f‘´=­ó…<Žb“½(HU=i:Â=ŽÝ7=ÓÈœ¼À2;—Þd¼$)Ü<ðx=¦Ž =n9“=µœ6=?…=8+¼¼#kˆ½ˆ_|=fÓ=&Ž<ÀG<; &ºÐoÜ>žÓ=-w¼å×½º¼Ä¾×½µ¦)=L‹½`3¼ O=ÅþŽ=ªm=™»¯Úa=¾s=¦‚–¼5dý¼h8Y=º¡=˜g=–„=cƒ;5|ª;Koª½Aù¯½¼µŠ¼pHæ3Ô¹=¨K­=Œ N>VÅs>¾=Š6”=Îu;!H=‡6½‰”=¡„=PÅæ=„Î=€ù>Ð;»gX=Oâd> _1>/q.=QÅô=?.â¼ ó<ƒ¿¼¾Ð=öŽk;÷÷;¸iä=½N0=§¢‚9^õÏ=MÞ=µh=·J»'-½ïü½?qq½›ý½æ"½…=¼»ûú<ƒšá»ØŸ‘½™æÕ½º¸ë½©6$½/n¯=_Y…»D¿¼ù X<¥ð½2£å<›*ù:Ò¸£= `{=×zw:‘Ï=ÎØô=•î¼3ß=€ƒ£½¹~Ô¾:£¼æ‹<óÉú½§ù§½½¨8½º¬½À°‡¼_•*½!†æ½Qíÿ¼áãó¼9 p=‚¢K;Æ]<ÇÓÆ<º`4<(â“;+¸Ì»»b:=n‰=Ã=Ç»q„= ð%=V-†=ög=Ô›Ù=+ÁN>d.=ø±¿=±¸`=m*·=T½zü=bh?¼2ù"=œ¥=:$†¼à-J¼é=tà‰= ¡G=ïÜ“=ÉõÁ>1²j=´"ê½Íðƒ¼…€¼çßd=MNν*_Ò¼×Y®<½ïu½°§½«–c:Nª`<…q:Q¬="…'=Èd>=¡<<3õA<˜IÄ= º=Ú=I<€¼°µ½dä<¶÷3=´Ì;=LjÓ=íZ=„Ú:»ŸW:æ²{»ÍÜÅ<ܦ©=:v;¨J`=…Òz=1*½ø<›ˆ¦½ ?½¨¤Ç½{ ½äŽ1½•Þ¼Øïá»áѼ>8Ê=¾ßs=A·Û<ÊŸ=G¯‘=ØŠK=ÀkŽ=>-> Ìö<Ç×=p°H;½sÕb½u#_½$?[½b„ï½DBS½†Òš½cÅã½–‹,<“š'=›M*=LÎÌ=XÚ‡<åoW=€Ú<”Æ<£1~=ð™»<Xþ=rI%=Äeÿ> mѼe³<ø,a½üªó½UǼ什-®½¼¼Î¨¶½fAr½uñ;–"µ½,(ྲྀ’½E=©¼¼à ù<ö‘0¼Q{6½ñ³<½J¿½Ü­=Z=ow‹;Öq˜=`8™=!Mž¼a'B=”“÷;±Es=ãSþ=Õ7ª=-’?;ÎpŠ;Œ­¤½3—<ˆŠ==^!¬<*v7<ºç=¿r¼#’x:¼mnà:éS@<’Øk¼ìë¶=Å?»=`=ê<–¶Ò<²„$¼Ž>=} â<åÒí=ç2<§=i½mŒ< ’=~èÅ=+=†ST¼'{®;…o¼Qª{=ˆ†½ª†s½~Äy½`=7°K<ÂP<øž=è¡Ê> Q8=r•<¢E<Ñ8°»nÐ=Ÿðu=•fg;caì=g.»Ð‰j=k½cÒï=“±Ä½ƒÑŠ½Ï„×½<ª9½«½%qнlO¼ù‹˜;Æ y»V,¼ðÿn=2[Õ<ÿÆ=¥ J¼ÔCÕ=Ÿ€l=C C¼?®_=xC£<ÇŽ‰;÷Ë<ÕÉg=òýŸ= ¾r=_Œä;¯ú ½äFM½…}.»êê½ UÕ½²þ½Æ@¼Ð¯u¼„·4;ŒåÓ½ƒÒ ¼ü“¦ºÕ9<½„x«<©«t½wC½»eǽ>%-½"2l=.W§=B=O™½0|‰=BC¼ŒbZ; e`=ú(=–žË=3øN=´Ñª<»=—]ó;M¦á½…sG¬¼’Íš=á1½K™˜;—kñ;è‚ä<@Ù¯={·<8\ä¼îzj=(¶r¼Ä]V»ƒ³½m»‡Æm½@í.½’u½q®@½UnZ»jBÛ½²#Ê»˜·¼àc=s'«=jO<ùo¼»DbºóNù¼:f6=t~ø=•€â¼DŠ¡½4ï=H2ÓJ¼Îî±¼üØr½Ö»½Ù©<Ô¾z½SÁ<8‘m=\²}>Ñt=ÈÌX½ x<î»±#J<ºfr:•ìæ¹ÝÉ0¸Êa¼Í}›¼Ô ¸º2ˆs<’PÏ<­ò’½†¤½…$½¶ðP½H‘ ½Dî6»Øø ½TTš=c®ã»”áÓ;Ú„¡<-ãª=©H=ˆ £=Ýv=«¥ÿ=üd]=J){=|ÉB=_ªu<¢2<úöŽ=Sô“=Þ ú¼£[½‰UƽÒçm=5¦½ æs¼–¥£ Û=µ—¶=Á´)=v»= ‹=ºÈ+=­¬,¼Õ)=SP¼¡Š¾Ø¸¶,Ò¼¤²ž½dBþ¼—»|=Z3=»çÔ;iv<¾rü»:m^½ºrn½((8¼Ôä¼vÓw<Œ¤Ç½!»bâ<$[9–ÇÀ¼‰Ê`;‘pA·Ð®´ºÃ™ö;pÜ;C‹ò<¿ë»qÚR;ŽI»#ž¼ k}»¬â» ý3<›‡;gÚ/;‘K¢»Qô ¼R‡º!K»ËÞŒ<¡¼u$»„’ºýô;»Ë*õº’Ž¡9 A÷;†ÏÏ<Óm;ßNj»Žº»÷1×;Ä5»¶¼.;«mäº2¦e:#¾n;¹­Îº5²:AZ:¼ïV;Ì®º±ãt;®³;êÍ;‚šú» ÃKºã"…8ÕEÁ< 8çp;«Ò;ý1º«cˆ»¦"Ø»RÃ;¨®[·Ý‰z»šßw:±€…»óÓ7;€Bß9ùc-¼ >U»Ÿö»”É»ºœÅì¼Êg»Öº";{»‘9;B»[»ºJk¹‚#á;Œ}N:Âå»rÂó»óå½»,¹º97Ì»árÖ¼ˆÁ»’:ª»†Ý»£Ct¼JHл›±<»Ã%»÷7Ó<8”}9!ì™;Øžº'!»íË¢»Õ|Ä;1‡Û:Õàü;¥ºÊ;/£;ñÚ»­dM»Ô»\Y:ò{Ê<ÛÆ<¦c²ºÅÊ»JŽ:¹sOT9™pÞ»0ñ¿».&F<œA»bÁ溌Á;tÓ»“:âÕy<2;2´¹TÿÍ;$E•»ÂÕ;ÕžV;†¾*;v¦:Á W:™ä­:Ç’;áy<€Î»6<ãi:†÷¹W˜ø:Ýkà¼é:]t»†Fy¸ð¥:Æ÷¹ÌnÕº,Z¼º*㸵0)»¤aŽ;v›Ä9èöºã™];•æ;ʘ;šòx¼÷»¯J¥¼ :&tºSB<,+ểÈ;i‚ù;¹AD:$ò;5—¬¸¹³–»ü|:zLK;Àq;.K< §¤:ꡉ¹$…‰;½áó:“»^jOºÑ„:\Œì»PU ;€|Œ:õ4ʹɗã;pV-<Tð;L›»Ã»ñ¡;ΖWº©Œ¼‹lk¼,Û±;†Ò»h¼ä»Ñ‹C;™/Š;1­Aº*?>8l¥H:ϧ†:®@;c@ò»ÎÇ„:ì†P»ˆ¯3ºÙí'¹Ño':Yðżˆž:ðQÂ;v:ÿ'`< ù¤¼7V£:â‚»À»›{¿:ŒŸÂ;žJ;pŽM;£¬÷º6Ë|;wòo;~´:¢§Ø»…ö;ªRš¼"Fý<{¡a¹ßqŒ<"2½;Ä€ð;Lš=»‚Œ]»¯N®9³­E8û$<@-:ºÜ¼Õ7»‘aÚþ=¹McU;‰#< ^@;ºe:[¸£Yº…ð𻢘1:-â º$¸ú;òÑQº¤C:x^ëºBK:Ìäi;ÜA7¼Dóc; 2¼Q·;?â¾9Š«ˆ:fæƒ;˜(Ú;~*¼ r<¹ß»V¤»Î`+;¯Mt»‚7@;I$C;#åí»ô2:„îã<n;›M< fp< J»ºÄEv;«ü:Ý;»¸•b9õ`»‡u®;Ã×)»Rô~;Xñ§»"ïÄ»f”ø;‘› ;YWQ»J[c¼x¼<eÁ:öe»‡Ítºu*ð;‡‰€;³Á&¼ w<Ìæ»gW<[N[¼ÿá;±àp;Û9Ç:4dC»©z=ºéil» ï?;Š8a;?”;™ä’¼Á»>W;;²»n&ñ»˜‹ù;ìÊN9îyL<ûj9ÜŽø;WÎ ¹ônü»îw<GC¼)M;XH¼ 2Ûº–‘»Ó°ö».ˆß»Ý˜±:MÖr»¬»‰ôß:Ó?åºÉ󹻋z ¹kVV;n;ƒºK¼IÚ;snQ;›a »Ý—";C‚S¼-}•<;Kn< y»¼8T:ƒ—á;주9‡»´ x;Ž„º`fý;ºÀ<5ŒÜ¼A Ǽ%5¢º!Ý9ûôŠ;(›:9¢û;Mbý»3¼»;+ßV»þ•:Ý̼Dº»µZB:%µ;;u3{;ÝX@;·ÿµ¼.pë;7,:›šõ¹Ñß(<ƒ8 V´;§ÍÞ»1š¡9ìNºòUÝ»—ïV;ÔþÉ;Ácj;ú‘[;®C»~¼¸’A¨:ž¡á»Á¬;º ,;„Ï»5CÝ;ÍZ::“~»%»ö¡²¼…Ý»•ž}¼q×¼Cøï¼xÔ:¼ƒ: »qº?º§ íº³ h¼“…l;Šµ-º/p»‘hÅ;¹¶]ºÏHB:á í; \;÷ˆØ» ÆÉ»õÏ×7Òq;QUõ9ÿðø»ñ½»–W¨¼%C';|æñº«DÞ»¬ñ㺑ÝW»kk;‡¯m¼V@M¼UÉ:ds/¼"»P99Åñ©º¶oµ¼uý»§D:@ÁºñUµ»V¸_:’Û{;õ²;~cÅ:±Þ6»2? :1s:¡yV»ˆv^;>F:×ÙÅ;¬»ÕëV»Z:™…ï:ꊻ> ;Û¶k»­Ž(;O˜š:Óº-:Ó¬Ö:™8 »À¬Eº>É<;›.ý:3q›»øy/¼3¡e:¶ª÷»Ö‚¼4oóº+Ln;õ…Ò<Ð+¼+Š;»•d©º2“É»kÈ8; Se¹¨À;ɂǼº$·»ö5<»åÒ*»–NP¼Ep»ÊÝ<'¸0»uÄu;#§ó»à‹‘»»Å#»úgZ»…=j<Ì<Gy»Ñìh»}XI;жI;]nº¬€Ï< Õb<ˆÇÝ;/&Àº–Œ%;ö¤»G*};$§c;;uº¡"á;Èš;‚ÿX»¿&ª» Ö¼ífv<Ø;!Ú׺¥Â}<*÷»gœ8»žwôº†½…;-|…¼ÞÛ; 0¼"Z¾;Ž;^||< i»žŒ²;óæÏ<$¡»øÑX»ì[‰;J\Q<m;âO£»x€‘¹Ë~™9àGA;‹Mê;¤t;Þu™:#sܺ±l];{0):óYºŸ‹º»‹S¹þsì7ŸÔY;Ûs¹;H&»®€:ý"Eº¶Ë¼»ÌŲ;úÿ»½dE;î{»ÑП»*°û;¶£»d3©»]ŠD:Øä-ºíh:"`±:û$;*åȹb'ë;¶ö9;D¬±;,9û:ñFÙ;k³ø¸Ö=?»”§Ç9Ëõ=»ú“:`O¶8—Û;iz!¹&8`;œÆô»ª;#;ò¹–¢ª:?9‹:¬±:Û; •;M´Þ») º–4å;™šN˜»Ìb¥»*::^*>:Á/~»p·: Ãߺ;ºå»M:q»‚ĺ0Ý; óh:÷É“:¹Ž»£}̺í‡"»2"»\ä»±U;„Å>;s¾»´h꺰òG;-á;¤–¾¹MB;³‚:Ò(žºR+;pŽÏ<Л;– <$dê;‘n|¼#Ui;´p;C¾é;–†¹»l·º“;~;¯¤/»Øá <3µQ<5ApºgÛŒ<ƒŽ;ÞdÅ‹: ŒÃ<*±Œº”=¤;<š°;Ë©;ÛÉb»lÏ¢»"L;”ö7;K¼»‚ºÚÇk:] 8˜9œ;é Ð;©¡W;§žâ;³úF¹~ä:Ÿ¢Ã;X¶Ôº¦ö»»§B"»‹…Ü:¼ÿY»Rí#»€Åˆ¹Îã ;þQÊ»ŒïZ:Þé<;çW$»}ä6¬ï »95»+S5» õ©»µ÷½º°«›¯u<‚”;m’»–WD»Ÿ¨Î;¼‡Ô;‚ƒ:ÃÛ´;Áä»Ù‡Ç»sºÄH-;åÄB¼ø»Tey¼7¹ù;ìŠ;K|»l3ë»'¦`;Y°l:ëP;Œ­%;"=Ò:™'õ:õH»ÈÓ7:ÛÝJ¹ž³/»HU;»¾ø;Š_ó;EÈu;"š:®c¥:7 M»ÃÔ;#(½»€Á»•ƒ=»¬¹¼ A»&^»·Õ:u¥|»­Ñg»] ¯; @Ð:¾nò9âíÖ;oÝ;·€Ù¹; _:¾W»Tä:®"µºR0Ö:Ñ/ä;Ûž;Œ«ž;È£Õ;êÒ²;‰‡÷ºiÞ'ºáïS< +Š»q©;­¶Û¹Žé;S@‚»³:ߺš%·;Ž C»}*ç:ý›æ»SÁô;œZ=;iH<#b‰<Ç<¼(€;ØõoºB§ºÙ·»º®™º9;Y¥»Ûª»]C˜»œ¨³;­ƒ×º™TÈ»„»U9¦Ë‘;D»ºžw»^ʻĵø» ] ;—ƒ;…òr»±¹Ö;#œn»oFw»‡w¼<³D¼‘¨»ý³;9)(¼uÈ<"\ô;Å.¡<6@m<…¾Ò¼;õi»<é€;Kàþ»´Š[;­¥:ÄG£;¢ŒÖ»õú<8Àµ»›ÜJ;Eßî<2Ò&:¼'®Tºé—+;§è”; Ô^;9SÀ:™gw:-:åz»›cñ;wãñ;{»UÊ;™hH»­+5;¿¶¦;׌»Ñiº` »-L{9šj¾;óè»õ•Ê;˜j4<ÏÇ;ÆV ;«3±ºNÚ»ýž<$(1:Zsô;…ÃÝ:ŽžY: ^;žÜÊ»q.;»ZY«»0ÿ²;n9;IÎ ;p:Û­µ»Ä$<ú<» Þ0;ü˜;·kß»¶&):ÎÊ;ŒúÕ;êÁa;€ºp:2ÛZ;4÷ê»»@;…n;‰Zº;|0-»ðà»»Þ» ø廡—æ»8˜;¼i›;jŠ#:`×U»Ënÿ:ý@[»—p»læ»´ñy»ÆÅ)¹Âþ+;­è×;Ɔº~RY;ª¨ü;&Â;”uÏ»€‡¸øŒò;±Ýª;$B:ƒœ:¹:"9E§õ»Ä¤¯»P‘лÌ0¬;k–»ÈÚ;>`Ú»k…¼<*Ôû;ÈSÌ;×;;æÉpº‘º »–Y:GI&;6½t< µ2º×þÊ»ÍA»l0Þ<)®<%ûÚ;*øÙºÚÂ;Ä»¿(5;(ô¦»±»l/2:·¹â<–;£»ÒáâºçD<" (»ŠÐÛ/z»‘&<»d %;¶];vE4ºè¨¹¼#´Œ»‡Ãÿ;’5ö; H;%3¼u“»(bÖ:´˜»£2»õ﻽ ;­*=¼ç»ÿ¼»±§a…M=ÞÊ>*¥=D•ý=! ª;ßÓÌ=ÿI=àQJ<‰¶= ´®=•û£<}“¼ý÷¼¨Æs½ã·¼= ¦~½!Û¼¼Ojã=IÄ;É‘>=/r¼®¬—»Ã]ä<³Q©<½D§¼Éúú¾W½™kB¾&®J½ñžè¼…÷j½<‹÷½ËË_¼5˜)¼Ð?¶¼¿½(ý`½Shz<®Ëa=&Û¼4g=óÒ =‘Ê‹=Ä¥=f <™E}=y.мÈ@Á= D »ÐQ#½x®&¼!b!=}ñ=FÛüë=Ö½Ž¼î11½5£ü;6^b¼¢Æ2¹Õò;¤ý©¼R.<ÙÒ¼ëÌ =“˽ B`½IJ½§þ½9 h=¶=¦Uë=Ÿ—Õ>Y™>(Ït>Í>?„Ü=Ã=<¸ þ=åË=Ž6¼¦Ê®<ìŽ=›öç=6+ܼG*º'³=¢Ç<ý R<å½_¼"gÓ½O«¦;0 e½³¬:”¤>;‰ý>@W=<¤Ê=h ø=qÌ;»o½Éc½Áø=Ó¬¼ Ï Vu½ÐS}½£Å“½‰z<øÄT¼ðš°½5íTf¶=Ç•=u½"(É=nP=i„½Z~h=Á7­<án—<÷)l=æU=¹ &½R“=OwŠ=Ž µ=´v¼ê˜½>»ï¡½Ìø½½c<`éö½/'"½Km½>Þ̼®Òνï彯E6=3FÌ»ŸòB=…¥Ÿ=|\<½* ¼ËðŠ½2.¼‘ÆZ=i> à =É!•=÷Àþ=½´=$Ÿp<›^7½ßá½jy¼_=ª¼|ò¼ö­]<‹ña¼›*š½k½ˆ>Ê=÷</A=?Ì*<Õgm=—´<{¯˜<ár¼Q½`T<Å »l¨=wÝ»C¦”> á=˜Ó`>ì[¼âr=«,d=lÝÛ;Õ¥€> Hö½OTD½®‹|<ꨪ<~  =‘¤¼´çÏ<ìç]=¡B½Š€ê»Wl„¼­Òª½]Ú ½ŒW/½%nü½às ­®=©Õ =~ÆP<¢u¬½}^¼ïþ=žÄ=(K|<Ë´ç<Œ <Ü=˜t=¤»¼<ïM<Ð_ ½¼Ï½ž\7¼í½™½ÐQ×½aäÊ<áq;=N’½dW¼®Vþ¾!±j=Zܪ¼×ãC¼L+|=nÕ=_{½a±ç¼×_fº9õä<áI½~-½¼[Ľ£SŽ½K½à¼3_·Ê>ûˆ=òx¡>)=übq=¶˜¼ÓŽwºI{»¬±<ñs=Do¼mE¢Ÿ’=¨ñS»¯¿u<“z¼q-Ù=mé=†$¼-œ=(§„=ÔF‚=Œ>£¼¤&=@Dü=Cã½Û(½ef½„mz½lÜ=½½˜½~©Ì½ƒ¹¼4ýü Ãë=#'¼Ùd,»=ƒ­<¦«–½¯ú½¡ìB¼ºj/½'?E½³1½­„¼Ú,t¼ þA=Ž*!»€D*=ˆCŒ<÷U=:J´=.õ4<Ðs=°‚c=‹i>¾>*²=°ý„¼ÈÛ=âÁ=. ñ=‡<ÿ½¹4¼Õ§<¿ó*;̓þ½²]ý½^‹õ;£N½ *ò=Ã=d_Ä»»¶È=M²ò½iÕ/½9šÒ½†=ï½Ùb`½Ãw½)ˆr=‹ób¼mÏ»ÑÑ;f˜?½Ã宽kç¿;" ˆ¼Ð™w½‘*¾½ ¬Ï:úQ×»ƒÕ'3‘==Yx>#R=œŒ½Ž¢Q¼ù„‚¼Œä¿½b¸;½«E¼ð<4:S½J‰Y=@t<Ñ¡è=—³q¼|-0=`Œ”=~à=n~¼ª;»Å‡S<¥|ß=ˆ}Ž=-þG=„À¼¡ =£ÃN=cÔ™½Uô¼˜vô½(q|½;*´ñô>Q²> 5>âó=­}½M/<¡þE¼Åv]½Žª¾`½ÊÍZ=T2­½©«=‡Gí<þá(¿‘=—>Q=÷¤=½ê>>ä=‰^–=A=u=óÚ=2j ½ kÿ;Îg= Ð= Q¢=¼Äj=I-ü=+ÅÌ=ˆN»«Ã†½S¼ ½vi)½””(½;Q/½ 1 ºxQ»½¦|&½•½R{?½<¼÷Ó-½uÞl½-™â<ËѽˆO½W(m=-:õ½5äQ=Mš£<›Ü×<äü=nÿ­=D,™> à$<ú]R½Ò(½\ã0=¸UW=¦<ÓŒ<<´Ù¼X!:(¼o>ï•>B‹Í=ÄZ1=6ʽSÙ½g¾½Ž)ì¾܆¾:ï=Š$Ù¼<Âa¼_Õ¹=Pê=ï2G=…MÈ=œ«<§ün=i€n=K½·=ÅÞÚ=|TG=³s=Œx=?W=Yj½="b>Rí=Ù†‚=±èk=h*±¼š6½A«½;ÌB½X&»Ö½eH’ÈW=R”:¼@Mê<ÒLÙ<ÇŒœ¾"˹¾š‘¾Cîj¾ǘ=A ½0!6<Ò¨Ã= :™=±¹=벜>tiz.:›”ç< lEº—§;ÎÕk;×U<µšºÛ€O¼/ÚW;ƒi»ý:;Õu‹;Ã]ë»W&´:h毻m¢¼@Ī¹6¬;ÉnͺÁ¶–;Ži»ž~Â;€Ã¤;É@A;¬Á)¼éæ»n»z»-s»eþ¸< NŒ:‰Èš¼8 š:ú=t»í6<ÙG¼O ë:ãÃi»·ÓºÝå ¼*ú;¢ªK»Øí;ä4h_;ût:¡ï3;šS±¸nå;P[¸;`DÝ:îÖþ:©>ù<1…¹<ì&»1ô°¹áaq»›8¬Qˆ<%((:üN幈6v<,I„;ªü;ê;»G ;ò_»ÕN;sD 80Io»¡Û¢»¤Q|:¼Ph»ç»–ŧ8à¹Éº‰ýE;o{¼!DšºÇHÞº‡š;;Ôÿ;¬Cc»RzçºÚÈ?º’¦ã;kC†»É8™¼ 𹻈‚;õüº5mD: c :°¦³:ãÎrº½¹¦«Ò»xÂØ:Ä;*º8)·»Šß^;W8s:Þ »±Æ»Ìa…»ÁåIº¡þW»òˆ»Úk3;µŒ™»á­‰»zË!;,Ú<1©¾ºì»ü&º9H »^5;ÑÀM:JÞª»©NXºjwê;™nª¼@™;p é»ÔÍ»Ü@ô;ñï;΃ø;¸¿óº5k7‘} ;iÕ¹à3绣•¯º¤:½;BÝ„;•_.¼ œºÑ´n9˜cD»yJZ¼5Ô;-ƒ¡¼RöW¼(F“;œo‚;Ù¨;Ã<ˆ‚º¹ë<5À=:Ò³¯»­VÝ;Áe:’°ó;’¸:Šƒ‘ºçc¦ºŒ¤…»nƒýºq©ÃººõºÔC»²;j0,;¤' »‡c:€ƒ×¹ä3ª;c!!ºF Ð:ü-L»,ß;£òÌ»ÇIz»&k÷;Dq;dÉK;g9_:ñ°&:¥E€º³‘Ö; c»Ú9º êÎ;ý@à:ˆv;ºdVºv;Qr»$½»ˆ>@:’e?»(­»ø å;E»`h<•t»OïI;yµMº)n:!›Ú:\³«:_ú¯;y ûÎ,©<%Œã<‹ä$»OÃÇ;©yÌ»vj;ȇj:ŒF-»&§º®µ¿9@Ä&»b/3»HAH:‘Å-¹í°_¼UÇ<³©»e/»‡AQ;&Õí»ŒÁ¼¸»£ë©<+ï[¼&Ì";¸sº<ý<ua:©5º žl¼sÜ»S;x=q»ýðx;Ü“<žx;2v;h I»È®»dbÛººÔ6÷/›»b@;lO»>ÁH;œBLºª’Ë·»ºc2»¶v­9¤ 8¹ó@&:±;ùÀ¶: Ñl:%yJ;Ïeɺ¸-9¹k—®¼ 4:;çÖ¬»:t_:Úy½;Œ§—»ˆ•;g廯[¤»¢h];±;›‘D;M«»B€©;üŽ¹†¿ÎºàycºwÁ:ûÑð»‡Îû;–ðLÃ:¶Êb»'ñ+;Ý¢©;PR;°_Ѽ>¯ìð¸é;–¨7;ÚF`;K»R‚º1!C;’²%»=¤I»Õ"®:ås;zû­¹7‚;ÑòÉ:p¾t:$ );š,K:´˜‹<|Û;ªc¼§(;Áøi»N[:¼Ý,¼·³»èqyº¶åm:v0;{v®»h¥ ;&9;f3;Jà ºÁæ;âê;Kk;šü;ÜÊ⹦ž&¼K!»?¼'50:`z?»ILº÷Ã;°z×;¯¼ó»œì?ºQ6»ç¨Ãºû}&¼9˜¹<#Óλ¸—Á;•B¡¹¾íÊ;&B–»¹Ô~;×.+<-1%;ÜŸ ;‹á_»BKˆ»ôá;›¯;,$<¿­¼F{u¼ ¥F»ê!º:Ô¿ ;\œ»W‘::ìƒÛ»Êõt:-˺ý"m9ãg¶;íÅ÷<=è–ºêò :ËNh»Õ+»ØŽ¹_M”;/´q¸ ¶3:Â,˜8`R®<É@»Ÿ*Ï»›À»Ê%Ë»ÿs„9Ó€C»(F»âm»;탺ì˜è;ÛÉü;–tº»§qÍ:lÒ»¢V <y’»€K';Žï”¼Ñé:Å•g»Ã•³<¿`º0S:Ó"¾:»‡;xb”:Ì•¼.¬:­ÿƒ:‘?;ÜK¹LR»;6¥;¦¤ù»)ó,ºÄqŒ;êi»: ¿ºî)@;îèºäJ ;%s<<Ü; ½ »”ô¤:ZI:²#æ;÷ X»6ÙÇ:ÊY»‚<©»cÝk»Œoâ»Åv4:ã]óº_a;¶…š;æ* ;6Ú÷º 3Uº®Ù;.Xd;=ü&;¦ž<š ;äMo<(§Ú;Ð)í9ÒÛW»ÀB·;Øf»C "¹é+ª<0(ºžNç;Ä{¤¹¦}Ûº4À!;€;=•w<7'6ºƒ.$;ó»;VG¼s¨â;¤xÂ;ÍWü:¶9G;Pq»®C?»²œÓ<ŠÃœ»£§ÿ;Ž L;r»+»\• ¹Â°:»îsĺoµÏ;&Ê; ùf;£’“;2׎;kºÒ÷m»Nyµ;Ún껬Î:Æz|9˦ð:ôà®<9Û£< "f<Éߺö‘µ: è><@–¸€˜ª;ñ1ø¹›Žr9¾µ; “+»²Õ:Ås;1V¹îuG9Ž2¢º­ŒÀ:²¾~»,Ø»¤ƒQ¹l‡ª;×?~;-ƺò ¼:.6î»?Oã;¤¥æ»Edºoˆ˜»¸9;)ä: ¨±º‹Œ¼k×.¼Ý:ÅÕÿº„?ƒ¼2†Ô¼UõÒ»’±h¼nM;Õ ;àŒ:r1…»º¼‘:ÛM;ámW»YdƺƎþ:¬š†;zÞ-;RÒ…» j;9Œ8º:·*›4»U§;W!º»¨wºxr“;fÞL<6Mà<>I»_/®:êmˆ;TvÚºªþ¶É;1p˜¸@xw»4È”»Íº:#pc»Tvñº™4Š»a;ϼ,oؼr³¼#÷í» Ffº¹W;§† ;››¤<$ì»arí;‡Ì¶ºÂ]»:çÛ;a’o;+ÕY;Šï9¸Y?;¿‰Þº¿…öº]«Šº‘v;ú»i'=9äe»É9å:MÍÒºÖ÷ó¼Ò¢:Ãe;“ø»_–ù:›;æ¢jº4Ú‡»¹]*;¨º¥»xJI<,$~¼«»ùÒ‚:š€ò¹¡•C¹êPD<´Ë;^¨_8]{aº zÖ;‘Öh»ƒ‡«»Œ!Y;jNVºæÊ»eÛþ»'i:éž‹;Ë:(;ûC·»jÈ:Pó®;v>c<^;¡¦;èl:ÿ< íö;’Å6:2±³»¢òº¥Zbº»~’<̯<(ºv}›;‚f†ºÙ®mºÑhX;†.Ì:Ö`-;^[¾; );½:Í,Ù;Ú–;  '¼ró:lƒŽ;¸ :_Ø;¼Æ|;“<¿:é ”;';ÏCQ:“èÌ:ɯ ;Mm».—3;ÁË)º“ÇŽ:Ü{;‹É¡;ÍÜV;#˜º@즺YR»á±ç»‘…õ;Q_ð»cöU;° m9m2a»Œ";ŸÓ:鶊º¥Ks»ä›…»÷0ã;¨6þ»‘{%»F5󻇿‚»T·< }»i2€< Im;jŒ0ºô8p»›¡¼>Š³»¸Ç»§dðº÷]'9Š­Ã¼.Ã;òØ=»±”¸;*Àÿ»Â°–;†ª;EX9àì»ëÏ»‚º‚jŽ;™œþ:çOþ»žu.; ’6¼1#\<U¹:7µ;Ü@Ò<±<Ê":–o;žò3»ý“:ã,P;'þ ;‘ú$ºŒÏØ<&׋;BÓ»³»o;×õ=:T‰y;‘ïX¹û{«;¬Ä;”de9ؾn»Éý;-€»;¬¥:¹^v;? < ;÷­(¸âºL[¼H;dN»€S»Rø‚»AÝ»(7»Þüå»ð•›»ßƒ9—Z¯¼ 9,<`x»yy»Š/º~¡;룤»LwòºŽ<©;|›0;Äؼ<Â:;:™Ûºz`;øNv¼ÑÖ¼±"•»ŸÛk9êPáº(~_»¦¶p<'aA¼:Þ뻜Ãx<Êÿ;ƒ “¼'*J» ¥<ƒ<5B¨¼Xì<ƒ};»Ü:<ƒ;dØá¼-ª*»jÊì;ó2¨»×› ;Ëì;ÍŽ»üv¤»rõY:1á »‚’æ;iÎ;R‚;uôÔ;"35ºè:#<„o<;® ;¢¶Ú»bÓw:¦â;Ò´l¼¨ù;‹š»;0Q<º?3T;TH9âýº$sºº:{Áº½‚i;¶ZQ»#Ûs»­Ï-»MÒT=3§6¼„;jó½žH›½¦ñ›<ìïJ½2"T½†;“½rÏ1½Z×(½EKs½•Þ‚¼Cuz½Ë£z¼—X€=]¸T=±!¤=ˆºt<®/P<æ”;É›¼Êª1¼Äl’= =ÎF<°>F<‰j½u&³½›u‡½ÀÅ<Ÿè°½4zD½ À½”$?<—ë༮¡Î=—ùö=˜-æ>WÍ> j=ŸÚ†=Õ¶D=¶7¾=‹ˆO¼íO„¾1\½½¾.K ½¾‘½NT_½'<½‰Çö=:å›=pЀ=Þ‰<¥q="€ =r2ü=¯´r=Æ0=‰â=5hé=š?;=c±ž=HBg=˜›L½…yà½Ûhg¼Ž×¼É/;¿Y>º»¨¾=?–¹½r…Ò<˜o—;Lêμ—J<)»×7†½ Óž< ݘ½”ËŽ<¤Z3»°á‡½WE½“ž|½2hº²7<›=¨á€=û=2í~=$¢½Ða»”K‘=! …<ô¼˜7=44¼ÕþCººd*½%]À½À?¹<†>„½ƒÐo;…ÆU=oé½D,~=,øØ<×ä¬<à; _=A‚g=kã½ÅÆã½JÒU¹«üÏ þ=áÎ <²|±=_¨ó<…¼þ»Ýñt½Î³U½ÃN¾ˆj½ÁÑí½„•ñ½ˆ7½/×=ÈMh<{N:>YÜ=Õàü=`Wå=–õZ=¶R=½²ˆ=n Ï<ùÒ‚*ˆ;K‹›¼ =’¼iíV¼ðí¸½lž»-Ã}<;*&=NÀ‘=—V»ÔÜ=f6W=O?É=aÖ=¼?ï= =‡â: …‹½m5ê¹M˜Å1<œ7=%Û%<šo`½žâ¼Ç õ<ï³|=@¨=S„=ļœåª=ÉÛ¼Ú«¹½G ¼qc½&Zù¼¿ïT»q#z<ƒ`é=i7R<íÓ=O©Ó¼ö§<«MZ½ ݼcó½fýô(;ÿ›ã=¢8’½Mòí½œ.̼BýÒ¾`S½2ºÖPÿ8Q“I=>}“<Î<<Ü<™¡)¼'¸”=™x=6€=˜<¼ˆ)=¤ï“=7‰=2 <^M½Dæ>x,=Òz×= ’);¢0¼ ³=ú=U=´¨=Å;ª“<Ÿ Œ<ø_¯=Á¾@½‰å½jT¦=n†=ás=Oü4=\¤T»jAœ ‘ë=ûˆÕ= Ð=Xs1=‹á½ï»ÃÎ\=%£É;„gÀ=-Õ1ƒ»œÒ×½­­s¼óGν…)½µÚ=Ù0½Žú¿¼Ó<½m\½e8¨½œÎC½€}=¸ò<“lo&{=æâP„Ê=SÕD¼¥ÓI;oŒ¼r¾=.õÉ=—ë<ô‘=5 ½r(k=ô¼š =—I«»=ú=ðô=!f½Ž)X=ç <~u¼;ªë='Š< f½O¤Â¼=¸™s;5cÉ:Okw»Œ ½Þ4½cGL½­ë¼/¼»Ž#?<š6¡¼õšÔ=¡ Q=´Y=¦}=Ý<©><ô˜>xÁ<ñ8n=®0=ͼÃhмoñƒ=R(±=wÎ=캡>x¼¼°…;®E=¬+€=’Tz= a =ŒñÑ=Z¹9`Ç»X7¼vb;¦ÿ€:ŸŒ7=/MÒ=r„F»¡¤<úÀz<žŠj=§Õx=bs¬=i;ˆ=â»Õ÷ =,ɽ>Þ<›`/=ph¾º)Z;âÓ=,ŽU=„9<–à<[N@=;žK½ qì»ñŸC¼lt;[Ý̼²1½Ë=R»=XÊ«¼ñ‰Ã½%ὡ=%¸=L½ = »®=%h^=å =Œ*_<~žä<Û*Ò=ÑÛl=ð„¹=k¢U=iŽ<½ø#;§.»<±â»=-ž =¶²=çsÍ»Á‡;= Å;{ÌJ=åD<EL¼XؼÑv<ãYù=÷‡ÂY=a5=œªÂ=wè~;Öð„=‘ìGv=Ä;¼Ñ˜;®w<:X!¼óm•=V­Á<[ˆ9=¨žJ=üÚ=ËÆd=ˆ“À;¯ë­½IÐ(¾ º½Ö ¶=¾=³ y1šZ½'E¼±Â­=ŸŽÛ<µÅv={`è=fk=Àçó¼äæ!;£•‡»öoA½™Éq¼mï½ í½N…F¼ƒde=¥¾8=îôy=˜8W>WÌ=]’°<£o+¼ý1½=+Øà¼Ù¿†=u¸ž=R“Œ=M“¿=˜T`=Eãª<‡çÔ=.}½•MC½˜¦G¼€t==!=»šZ=µïè=‰Ùñ=‚8U=dÁ=%æÖ=?A=P-j<ÕAT<þõ=Âز=Rå(¼£Ð[;®hÙ< W…=û”{=ºh€=¿ÿ¡:S)À;I<î:B,:7Ä »³±t¹ì›):¤ñ9à¡ü; ž9€‹º~ÿ…»¸•ø»:ë½»n`5<)‚-:‰-@;TF:; Û‚:‰@T»KûS;Êõ–»îê»Ä!µ»"Ål8©K!ºéºšÿÓ;%e—»üyÛ»+*;~,Õ¼Oé¤;.õ¼;G:W;N°ß;!w9øGB;/Œ@9D2³¼]z§»Ýt;Øo»•%Ø»í¤;Ƶ;;¡<¹?ª8»'^©¼nÇ»u¼;ͽ+»:®I3»<€±¹5‰»}¸•;‚綻À„ó»Ð;ždèºõ'h»ÇQ¹»3—Ì»ôê;Ì—Ì<ŒÎ»Ý;ó•c»€n<±Cº¾­7;†–'<âi9Ê7ẵººÀº“µé»½^»_"À¹À­&;¿B…¹»•ú:ðÊ€»äZÁ;]Òº CÉ; <:¡]<:òŒÐ:–Ê“:ñ§p¹gZ:6W;¥»,T·»Ñ(»˜ i¼’æ<»þÒº†Õ;\ ý»”®©;´ 뻣XÖ;àdø:û9;È:€<=»;bŽ:Õ™:åªQº´w®º>µ‹»ºõæ<§Z¼ “–º6Ìõ»†ˆ:1?;Øå‹;‰1B:Æw¥;Œ8#¹êó2¹Íïå»w8š»ÔÖê<²7;]`¢;³l;S·:Ý!I:(j;×÷ž;Šr©»T÷»kA:¨"£;‰*Ê:t¯»;¯2;¼…†ºx‰:ÑRC»²œX¹/xŠ»¸¼TŒ¡¼lî¢;ž‡Ÿ¼¸iØ;™ܺx™;qÄt¹¶ ºfèç:µ»k²»²ya9Âaé¹4è;º°»çM^;Es :Æq»~·Û»b5‡< W;…?º:‰t¯»l–¼H»¹¬;;ƒ~mº¹<%¹mvŠ;'ú@»ˆªˆ;ˆL)»Di»£n¼íx;ËR¯»·®ƒ»¬c¹ô5Z9¦­¼t’º´æí¼¾»k@a<9µ¼$S–»ÞøO:é+";w;\\q;#ϼžºÑÁÛ< C%ºŠP©;$„f;˜€»*ß,»\\¤:ŒcK»»yÚ…;Ì];óÞù:‹ ¹Jz};iùD»á¢»Æõ/ºM}ã;fº:¸`…9–“;vÚ(¼Ü»ø¦ÌºŽlÄ»£ë6»ÉS¬BºÉ{e;Ë„Ô»Û±j; @~9¨°¶»;­Ð»D¾µ:¨4<;»>x;ƒ>;Žä¼=Hº;†^ú:¦¦”»>Ø9öç•;.‚kºí,;y>;„ŒÂ¹jê¸<zl;¦i¶ñYf»£ D¸äK};y4;Ƨ»c¢Ø»ª:K€Ö:ï»9½9:“Ï{ºa/#;Ãð‹»a l¼ 2¼U¼%Jº»÷ùê»Í÷»»ÑbϺIa‘:œTñ;¨õ »»È»ðZv»Ef:Ë¥»KÎE¼T4,;óV8;ïŒ:ž¯7»Êðºñ6@¼F†;Ph»–6»ÅI¤;áw,;%©Ä»¸…;sº»X8îÜÇ;-ˆ¹;<ø«»²J<Q»A³»ãļ"eì;.b»À µ;Ó?H:†{»ŒDr»„:¼yñ¤:ÊäŸ;y^»f»¾G¿»Wº@#»—ÐѼX`mº§ 궲 »ü?Ç»G¾0»9ë©»½î}< ÐYºÀG•;¾5›»Æ‚q»t@;–ц;è »Ð¬»k£º…L;ZUf9,ù;»v4»µ]Ž:v‘ä;Íäc»‹x:@¯Å:ê f»Q[»3.¹»ãb˜»Ôé^»"*컢ógM¼0 7‘h»Å~ä¼DƒP»•f[:zÒº^$‡:F •;I¦»:·m»è£f»!ã‘»Á[=:Lè¹ú'¸ó¾¶;rV¸îC¥8»9ÓÏ»&¡(;¡Þ»€©;žŒ: º× º“²Ç:ãÀ;‘3e< €Î:ç+»–,ʻԻ›àŒ:sàÿºþ€^;°w,9v§ï»•ñ¯ºÑ”õ¹¤»D.Õ;~„íºoÌäºâe ;R»Œ×ú»à]y¼'q;‚ü ;›¨ô¼Áõ»c{¶;î$;¼¥uì¼$o+:˜uxº•î;ß»ôYÎ:äÙ º2˜G;LwD;/;•é½¹úZ6;¦Ÿ9;"µ;"Ãú»n×Å»©Iº¾_ðº©(ºŽhR;!黥e‡:¾C©»~i5;7k»F‰9lÿ8»À —»C‡§;Ùx;cκ÷è^;-Od:ìM;*Á`»IŸ »‚Èâ¼ Œ&9üŸ_;#§¼;KÍ;YEª;~Æú¹=\:F z» Çj;`—;ÞL›<V¿:ã<ë:Ⱦw;úìJ;ÀZ¯< š»¾i :Jæ»»hñ;;e:‘íP9ªŸ;¨²öA»§{•;l¥•»gí»»Õ©S¼ #;j‰;ˆ¼ß»¦wû#û´;˜ø;7f<ýY´áŒ;ÊÍÒ¸Á\xºˆY·»8;Oœ»×Hi»Ì¬º!I»é8 ¼à?9¡I&ºôè;™o³»~Å:"f ;,:%Î2:Ùó;’éî;…=¤;£‹;£_•;n¯<Ì»ÑÂ;•_»Æü»?v:ñDÇ:cÌø¼Ôf;À!h<`J»‹IòºçÍ»–1°;¨»ÿ.¦9Ù¬l:óÆç;ÃïD; íè»Ü€dźÊÜÇ9½U9:Ó§ºnT+;J—9;C»‡uõ;üõŠ;B©³»ª((»x798²‰Y¹¯4:›g;»IGG;¬\;$&À¼2ž¹»žšë»é!…»‘F¨;‚ÛºÉG›»ëb »¢Þ<<‰‡(;᯻k¶;<м/%:º )öºäFš»œj®;wÜý:st;ú{;´Ë`:¼ +xºÜõ‘8³`{:hX;˜ÖW¼. S<ìq»)É–¼ Ÿt»àº;“5:™8,:Áû;Ësß¼± :a1 <$ôT»ãdð;]’ »¯îZ:øù‚»¶7»›3 ºÞ¿pºV¡;:½¡;þ«ºc¦—»._°»´p;Ê3/»£ª\;ByŠ»XyN;íÜ9øO»Àwcºíª<zÏhealpy-1.8.1/healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits0000654000175000017530000045760012276746731030455 0ustar zoncaplanck00000000000000SIMPLE = T / conforms to FITS standard BITPIX = 8 / array data type NAXIS = 0 / number of array dimensions EXTEND = T END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / array data type NAXIS = 2 / number of array dimensions NAXIS1 = 12288 / length of dimension 1 NAXIS2 = 12 / length of dimension 2 PCOUNT = 0 / number of group parameters GCOUNT = 1 / number of groups TFIELDS = 3 / number of table fields TTYPE1 = 'I_STOKES' TFORM1 = '1024E ' TTYPE2 = 'Q_STOKES' TFORM2 = '1024E ' TTYPE3 = 'U_STOKES' TFORM3 = '1024E ' PIXTYPE = 'HEALPIX ' / HEALPIX pixelisation ORDERING= 'RING ' / Pixel ordering scheme, either RING or NESTED EXTNAME = 'xtension' / name of this binary table extension NSIDE = 32 / Resolution parameter of HEALPIX FIRSTPIX= 0 / First pixel # (0 based) LASTPIX = 12287 / Last pixel # (0 based) INDXSCHM= 'IMPLICIT' / Indexing: IMPLICIT or EXPLICIT END ñ¥Xbñ¥Xb¼Äl$né;Ïjf¼ŸSä<î‡3=¨¸6<¹ …=©Øç=7 ¡>íÑñ¥Xbñ¥Xb=CÏ<¶}e=¯L1=ã¼Â=W;ëÖ†»ô”T=ä®=ÝnN¼Û? =VVr¼*b_=agñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼œ™š=5Œ¶<ÔQP=àg'•n>?š>MV×>:¬ñ¥Xb=Ôte=‚Òñ¥Xb¼FCñ¥Xb=odë=¨ =05r<®}ýEL¡½k”€¼Ú„¦<É!»(;i<¸y½Gq<¡â-=´?';sšP;³;Bœ<ÀCUñ¥Xb=.ÚÆ*ZO>Kf>:á=†Ë—=ù8=ycÿ=â·Ùñ¥Xb=œ*÷=YN"=ˆ"¸='_©ñ¥Xbñ¥Xb=UcÄ=s=½"O=Ìn¨–y=}Õ/>>x>-°=@‚ã=¤»=‡‰<&§ñ¥Xb=`nŸ=N'=æ¢='÷Á¼L(ªñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼“°›ñ¥Xb=Äê‡<²¨G=§·Â=c·ñ¥Xbñ¥Xb;⽊=²÷F¼‹2·ñ¥Xb=qY1°Á=¥g1="+º=)©=<üÕ»t¡P=µ–®=ss=Ÿ•»Ò²~<ý[ñ¥Xb=¶ „ñ¥Xbº"èOñ¥Xbñ¥Xbñ¥Xbñ¥Xb½ *:ñ¥Xbñ¥Xbñ¥Xb=N¸;­Á{<}:,;_u<=.]?ñ¥Xb>·=3’=w8ñ¥Xb=áï=´„=Í>½ZÂ=^o2=Œm-‰=¤ƒI=É»R=[o=š!=‘0ñ¥Xb"™¸= Üo½ ý ñ¥Xb=¯5ñ¥Xb½b6ñ¥Xbñ¥Xbñ¥Xb;wÍ3<ÿw&»–ôê½cO>ñ¥Xb¼Ý¢ ¼wj=•=‘fS<¦bš=ŠÅ=“w%>7wˆ=Ìr2>/šñ¥Xb=âjˆ> ž2ñ¥Xb»nãŽ:¼¨7=–Ƽàï<"v=pã=Xv=NOBñ¥Xb=´DÄ<’ö—<¾ç7<¢ˆ=‘Nñ¥Xb»Üú²ñ¥Xb<[ÜY½2м„€&>‚™ñ¥Xb=Êt= P=Á˜K=‰ä¶<þê@½¸ì½.€D¼UP¢»ŠŒq½Kb»×$Õñ¥Xb<¨ü<¢[ÿ=t¼³?½~´=€uG=AˆÑñ¥Xb=FFk=”4J=øàÓñ¥Xb=ø_=´]Îñ¥Xb=ƒë>>*Ì—ñ¥Xbñ¥Xb;WJa<Š¼E½9C.½Ù=*|=rn;=¥º9=‡Ótñ¥Xb=—.T=flÕñ¥Xb;†d_=  =:p=/ýñ¥Xbñ¥Xb= ¶½aï½ ½þ=nÒµ<† Ö=BX@=»Ï‘<ŒìE=-±ø¼‡Ì;‘kí¾Ç= è½(ð<ÂM½QQk½Ïñ¥Xb=>T\<¸õ==qìú¼òs$=\Û<ÆÍë=ã'Iñ¥Xb=©Em=ˆ§—<û‘€=„Øñ¥Xbñ¥Xb½ ¸„=a…Ê=ô==ðyñ¥Xbñ¥Xb<§Öàñ¥Xb=m%þ;¯™!¼ö‡,=êI»Æs¡=‘ZN=½âÒñ¥Xb=NW=ûáñ¥Xbñ¥Xb=ˆ¹;š²Ê=».ò=·Dñ¥Xb='Wê<œùñ<Ó™W<,3E<À4=Zz = †î;­­K<ö2æ½P¼ó½ºk½ý¼õm=½‚\Ö;â|½% í½³š6ñ¥Xbñ¥Xb<4íQ<äõk¼N†W¼IÓè½Aí:ÏTê=`i="å;Ÿ$R=K‹=Ìj‹=t€vñ¥Xb=šLN<Å_Iñ¥XbºW©­=ƒ[¯=¢¤=,—¤=±ñ¥Xb=f–½”[¼’¼¯¿£<ÒP¼þ…¹=Rft<Êf;›æ=í ò<àlñ¥Xb¼¤Ïz=¡;ñ¥Xbñ¥Xb=&r¿¼‘ž?= ¿R=Þæ=£Ýi<ÎuÙ=~æ<ÏO²=e·×¼/ôŠ<7ó<=7E¼ùL«½v`½ø¶+½Ïl”ñ¥Xb½tLµ½=ð¼ôë ¼‚²t½? j½Týõ úñ¥Xbñ¥Xb<Ül6é=ž›c= ¬$ñ¥Xb=“òè=j¿<ë¿8½b;½UÛ=ëÔ¤=¯Øm=¦<訽ºã=Óû«½\"½x§¼ìõ亄@&c»ÄÉü=‡ü=-þѼ}¼‚^;²Ã¢<†pO½ q½ Ñú=G©½ß£Ö¼ =ž;ž¼ ¡~=0á¼>u<<½ Þ«;kýñ= õv8;Ô=îÖñ¥Xbñ¥Xb=Ÿ·V=°åÁ=ŠL༮üü»Qºí½U=ñ¥Xbñ¥Xb=äé½B»¼¶ñ¥Xb½_‘…½u¢¼C<³T=O—½>½<'“;¿iÔñ¥Xbñ¥Xb¼Ì]Š½*=€m ¼ úý»5¢,=™æ*ñ¥Xb»âN=½•¯=jÁ==§=²¡ñ¥Xbñ¥Xb<Ûï%<Ô¢åñ¥Xbñ¥Xb=.i =Nóë=’×=uª<a0=& »=rÁ> ˆJ½„ô¼ŠrU¼ÕlÌ=¡³þ¼Aìe½#Õ¼“Ï.ñ¥Xbñ¥Xbñ¥Xb;—àB=lÞñ¥Xb½…䊻%Ä<Ñw<µ3·<ôo»ù6`=M]=Ök„=…;‰=±‚ =GÞ½¤ãº½Ž;û•Ü:€ Ü<ÌrϽ‡àO½+íÍñ¥Xbñ¥Xbñ¥Xb;¨½+Þ¿¼ãÖE¼PŸ»1Þ¨=%¶8=p¯ö¼i=9m¶=ìÂ<ߧ½Ä8ª½ÇžÓ½Šñ¥Xb½§Ëʽ WÙ¼µŒëºxC¹=·HV<5­kñ¥Xb¼Õ"=–b¼;¨‘–ñ¥Xb=.èYñ¥Xb<Îû­ñ¥Xb=¹­:àfÊ;À,þñ¥Xb<å•h;Hì|=^&Ìñ¥Xb:ê¼›=‘Í8½–ç8½ÊÃñ¥Xb¼5<%<Ú(ï=°œp;¸Ž}½äV}ñ¥Xb¼»¯Éñ¥Xb=ÆJ€ñ¥Xb-¼'x¦¼Ææ`½›½yá#= ³*¼ùó³=3á/<°„Ü» à=„ =ñ¥Xb½ ½‘§P<ýœ=@ï=À!Z¼h5m=^JR½—&=r« <ŒÆñ¥Xb»ŸŽ0=ÍËü“×–¼Å˜Ê=/gX<Þ3ï½D¥€½L×R½€»½ƒÂrñ¥Xb;aéõ½…f½¤=Þ½KtŒñ¥Xbñ¥Xb¼"³gñ¥Xb=ö=·lC=îí=é¯Ê> j=‡ó@ñ¥Xb=Æ–¥=¶"_=¹3Ö<ìmm=£Bq:N ñ¥Xb='Ûý=…tË<¤š=…($;©zÁ½Û¶=èa‘ñ¥Xb=Šs<·ý<¤ó½ÿ<Ó†<þ`F=eÆ‚ñ¥Xb=?•==èë±=3æ2ñ¥Xbñ¥Xbñ¥Xbñ¥XbOÀ=²úWñ¥Xb¼)²ÿ;äÿ=%W½3¦¼Ü‹#½ì/½Å< âv=874=œ´á<õQ <¥º=ÝÐœñ¥Xbñ¥Xbñ¥Xb=eÄ€=­.=7'= hº/ƒa»ò!ºV”< ²ñ¥Xbñ¥Xb;VÂóñ¥Xb;½ò.ºp/~¼.=ñ¥Xb¹#‡ñ;w£ñº” <',šºh]ä¼(/‡»’ÙƒºÁÓ;¡(O»Å2 ñ¥Xb:„KÇ;Òûñ¥Xb»Ó—ñ¥Xb»üØM;a–T;¬(¼:²‡3;Ò»ã?†æ;’ ¬»Ì,Ÿ»„ð¼ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¹Òñ¥Xb;æ “;ßïÎ<%&„ºôñ<¼¨¾ñ¥Xb¼ßñ¥Xb»‡ñ¥Xbñ¥Xbñ¥Xbñ¥Xb<‹åñ¥Xbñ¥Xbñ¥Xb9µ™;`ä:!;¥btºÆPŸñ¥Xb»Gݺ fA:®ÆÎñ¥Xb;aûŠ<8à;¶^2;§*s;$¤?ºÀÕż Z;œe»áߢ8¹+Ë:»’ª;rí»ªžQ:Ä‹ª¹ºßøºLðñ¥Xb¼=©Z¼Z”; –Q¹Æ?e¼Ž›©»¼¼=»Ý–»êMÉñ¥Xb»“*ñ¥Xb¼"¼ñ¥Xbñ¥Xbñ¥Xb<5e·;ñÏ<,Ã÷<%Mñ¥Xb;·f»–Ì&<0›Œ;Mú]»Q”:pùì¼VJñ¥Xb;ºø–< wã¼P‘|ñ¥Xbñ¥Xb9…€V¼’î)¼—nU¼ÅͼU“滳„ô¼RƼ2ºÌ»CÉe»_ýñ¥Xb¼6Ó‡<«7¼'Å;Ž ¾»ë¯»6¦/<-½é;Þ ñ¥Xbñ¥Xb;ǨǓ;ÂÒk:†¨ »ó¥L;ŸBŠñ¥Xbñ¥Xb»¡9¢¼5&1¼tƒ¼+_»¾Iþ¼(/—ñ¥Xbñ¥Xb¼Šà9»œôš¼s;nñ¥Xb¹Úµ@<2>¼‚NÏ»M3–:'軃(‡:©ô¼Ì¼~’ ¼O »²ˆ¼tð_»EYG¼bSñ¥Xbñ¥Xbñ¥Xb»åÙP¼³_'¼­¯|¼¶ëÀ9þϼ¬º]‹¼м+ô'»Ýô<@©< ˆ;Çÿt´:±ÙºßäÕ;ÅÄœ»®Šw:Õ5Á:‚Ÿ)ñ¥Xbºâº»ÀZñ¥Xb¼ä>ñ¥Xb<4õ}<è ¹CN:;ùyb;–]¹;„Á£< ò<“»çõ;:Hä»Øb;ÑÅ&»Å;¶»¹8i»ôÊм4!Õ¼ܼ%l^ºô°¹[‘*»¯\=ñ¥Xb;¯6f:Ãœ;ÁÅ<Îòñ¥Xbñ¥Xb<'≻”€L:âéY¼ˆñ9&7»›ãZ»%¼†M»T’û»TÂ¥¼!˜º+^ñ¥Xbñ¥XbºŒ2»Û_’;·ïÀ»Qžš»ªhI;n/¶;œ?»X¬Ž;ª|¹O×»¶?…¼ ÷c¼š ¼~D»¨˜4»Ö'¼Sþ1ñ¥Xb¼‡Óˆ;§+í<-âa<%¬¬»¤Rºñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Ô—ôñ¥Xb¼[¿¿¼àºLYt»Ýë§ñ¥Xbñ¥Xb»¡e;.!òºÓA¡ñ¥Xb» ä»€NS»Ð0»±¸Ð»æA/»e¼KØ:-½;ûâµ;¤ñU»ƒAL::‘¼"9H; \9âÜR»%ˆè»ìV¼ZÀº£¯¼(>ú:õö;ÜžQñ¥Xb;“ðšñ¥Xb;·Ë©ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¨;ñ¥Xbñ¥Xbñ¥Xbº½éÒ»Ü?¾»5à;œôÙ;Vµ‚ñ¥Xbº“èf»Ž¸¸öuñ¥Xb»£[﹑“¼y{±:Î)–;_°»´†ñ¥Xb»†Éòñ¥Xb»´Òh¼Aÿ#ºÊ¤&º«‰«ñ¥Xb<²Â<8ª<uL»ñäIÂ<a »4Ÿn<¡l1¼UIñ¥Xb;ÚÿR;îF#;µwy@9ðÇ»;›©»×?r;ÁîX»ŒÈñ»Ï“—»Hdõñ¥Xb»ºö»Ìàp»Ñ"dºÆq~:-ÏO;ö}´¼Lù¼Gà°¼<÷þ¼_n»©ž»MQ¼•i»ôÞÀ¼Ÿƒ£»Ù;»©9:ç1‰¼6L»ä5E»Hm±ñ¥Xb»Ñؤ9 £N»é„ 9`ÉÍñ¥Xb»|Õ;__x»~r¼LÜn¼Ë‘ñ¥Xbñ¥Xb»:Ž»¡»í0;Ãs÷:Iæ<ŒV7;Èá <°g¸¼(:<Œþñ¥Xb»?¢9;Ò}=8•ùû;˜9‚¬‡:ÌD#<Fé;.á‡ñ¥Xbñ¥Xb¼/þ;¶½¼Y˜]ºîõS;y*×»§};ÂåŽ<£?¼ciS¼ +º:X–ñ¥Xbºz’ì¼;Þ:ŽWÔñ¥Xb<,›><µÞº7»ºGõ”¼ éÏ»‘E»©°M»Dâ@;ò\»¦f»lGQ»UàF¼V°Þ»Î#Y»âq*¼ %¡¼ WÌ»ìz8±G»¦ó»žÓ³<°c»kB96æ¡»‡£R¼7μÝb»Å“'¼pR¸»¡‡¼E)ÿñ¥Xbñ¥Xb¼[õ¼9¥!¼RÍ\»^:>¼”ÊL»LÕÃñ¥Xbñ¥Xb±»Ïñ\º)Îõñ¥Xb¼jZ¼mAPºâfÔñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼Â9b»âa½¼7hG»ïGñ¥Xbº½ ;»y÷ú7S=‘Òb=e  ñ¥Xbñ¥Xb½ I¼®iö»§by<=ªx¥=ØUl=_Ââ=dlP¼Ù׌s=åÞñ¥Xbñ¥Xb¼«“_ñ¥Xb=¾qc=q¬‘=…ü= ^~ñ¥XbwØ> •ñ¥Xbñ¥Xb½x›L½ƒ„p½ À›½É‘½òk¤<‰iø;¼’=wî½``é<\¦="1ƒ¼>‘,½a¸½Hõ¾½¤—$½$Ã^½‚F<6Ù¿=€Ù%=:)=–ó³<æË<ùQñ¥Xb½eš¼Ñg=+4O¼6‰Ú:à»ïD6ñ¥Xbñ¥Xb=aöK=E‹=Ñ’¹<>™§=ë»/=żÌ[kñ¥Xbñ¥Xb<ø;w<{^J¼zû:ñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼0Àá½|‡½Ž„ò<莼¥³ýñ¥XbÏì=Ñ¢<÷I»°3=*ºTñ¥Xbñ¥Xbñ¥Xb½2^½¿£Zñ¥Xbñ¥Xb;h=‚»ú'ý¼›N%¼¸ÂK½oòD½º^ñ¥Xbñ¥Xb=­§…ñ¥Xbñ¥Xb¼>îL=nĤ<ÕXÚ¼{«=[òñ¥Xb»øÄÞ½7s‡½¬ïª½Žf!½Kjñ¥Xb½Û½,è ñ¥Xbñ¥Xb;•Ü£=^Æiñ¥Xb<)¤¯=oN½C6L=3=@‹À<ºx}=U±D¹ÿß4=—‚= )'ñ¥Xb=¼iŠñ¥Xb¼À<ƉC½eÈs=ñ¿= AÞ¼¿‰;Á§¼†æ½w¼ï—b:™6é¼SAK<²t;å”n½„ǽ²½7ľ "g½Þb½F“è½lÌÌ;è-h½ôõ»{¦…<Ûq彈b6½Ú{…='`J»Îsß< ø–½ŸL¼µž!½ŽE„=S5nñ¥Xbñ¥Xb=V¯~<—¢¸ñ¥Xb9áÝ3ñ¥Xbñ¥Xb;(’f½5âá½H=ü=jØñ¥Xb=«o==«Uµñ¥Xb="'n<µz¼èÝ«ñ¥Xb=¿Ø¼ˆÐãñ¥Xb<ƒ6Ü<¦,´¼ó½G½‚…Ìñ¥Xb=”ên=¦†<£t¼÷ý ñ¥Xbñ¥Xbñ¥Xbñ¥Xb<?=8Q=”SÎ=GE‘=ÈèÐ=µÛ˜¼yZŽ½®Ô›¼+½??ñ¾Kø½ŸŽý=Á <;/=²> ñ¥Xb¼”:[ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=K·ñ¥Xb> &cñ¥Xb=jÍ=´¬¼‚‘<ôwo=K/=KΘ=šZ¼y #½L«Uñ¥Xb<ÁÀ¼š½€8„½Bäñ¥Xb< ´¼šš&ñ¥Xb½]4˼í†{=šÑâ=†Ål= ˆñ¥Xbñ¥Xb¼8/»ŽÆ—½©»L½J)Ï<¥~Ê<5ñ£ñ¥Xb=zl ¼?‘¼úí¡»ÈÿZ=!*½"²_½$ñ¥Xb¼¼¼î÷<' œ=Šæp¼·ÀX¼ô埽gïÚ:A×ñ¥Xb½ÕÔ¼zó½ØKñ¥Xb=ZåÈ<þõI½ŽÍ ñ¥Xb<õœ =øž§<·æ=>yª=ð²ú<ñ¥Xb;þJ“ñ¥Xb½Ží= _¿<5“r»ž±8=H=‘ªK<Ð^I½;Á‚ñ¥Xb¼¦!=ñ¥Xb½.u¼ úñ¥Xb=¼(˽2-<R!½™Ž= +¼=#[ì<ÌùG=[—-=—êÛ=§ ==öÿ] «T>ƒ=1 =*5;<šÌå=”\¿ñ¥Xbñ¥Xb»€Š…½>øÚñ¥Xb;’nô½2)˽ƒ0=6 Ÿñ¥XbYØ=žÿ<Ê­×=}äú>Pê=xè=Á3ñ¥Xb»wµN¼—%º±™Ú¼%_º¼%Í©9µ¼y»Îe»¢ÙŠ¼¼‚™¼—£lñ¥Xbñ¥Xbñ¥Xb¼a_4¼@QÙñ¥Xbñ¥Xb¼Cɼ}^?¼³Õ—»Š4»rD§º‚?ñ¥Xbñ¥Xb»Zâñ¥Xbñ¥Xbºk ½ºy³¼h½»[€ ;-ÎŽñ¥Xb;áâ <.ë½ø;¼|.<È;7è:ȹ;n;©[^:œ÷ ; 7Ù;Þjà:ܹõ»ç$»;÷ÕP;Þ»#Ão:K™I»žÒö¼(.»‹à»7ã<:¥»®ië¼j‡»HÜ„»—/9»¨a~ñ¥Xbñ¥Xb»Äßé<øüñ¥Xb;A_ñ¥Xbñ¥Xb:±7kºEy»£Gd¼¹Âñ¥Xb¼”Z¼eðkñ¥Xb¼)qè¼_p¯¼›¡ñ¥Xb»:z-¼.ñ¥Xb¼œu»Øœ¼I<­¼\¸9ñ¥Xb¼©»7P®»ß-ß¼[d,ñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼&É»Áÿ»(i»ÀéP<ˆ¯:Ž*z;ÊæÐñ¥Xb<¦aV<" {<Ž‡f¼#W黪K„ñ¥Xbñ¥Xb<&ìûñ¥Xbñ¥Xbñ¥Xbñ¥Xb<%ôø¹âP¹ñ¥Xb»¤§£ñ¥Xb¼3‡¼nQ¤¼˜Ò ¼•&»×ȹ¢¼ò§¼ JRñ¥Xb¼¦1+ñ¥Xb¼+”r¼G¬|ñ¥Xb:‚Èϼ´³»›ÚD»7R>Ú»e¨³;ÅмFp´9!@å¼0y;ï›}ñ¥Xb;Ìð ºÈK<>ªpñ¥Xb<%r< ¹È[ñ¥Xb;튶»¡Ó¹îßÃ;yÿ¼H}¼9$Q»jÂ^»Ênó:.zÆ»°L¼ ñ™¼ ÕÁñ¥Xb»dS¼.îñ¥Xb»•q:êÍHñ¥Xb¼Vļ ý­:>mK;N38:Ùj¥»Ðó¼:¼¥ñ¥Xbñ¥Xb¼+¾=»ª>ñ¥Xb:Wã|¼ƒv¼Œsk¼rz ½.Ú¼¢ ¼n¯ø»§ta»üM®¼Ñ<¼wañ¥Xbñ¥Xb¼F‘ú»ô>ñ¥Xb»ñmo¼8mn»™\U¼NZͼ"A}:Ê`í;°—¼"@Ѽ ؼV@»s;Çúñ¥Xb¼’ƒM»þÏ»H­»Îò±»‚Iݼ-øÁ¼œ<–º»¸Â;&m ¼@oV¼<½»Äùé¼PÔº°'»ÏUC¼  Ú¼g­š¼-'¶»¹95ñ¥Xb¼Ñ»´Þ»qr¼^qÅñ¥Xbñ¥Xb¼ó*»«ý.;Oḻ†ß»Þyñ¥Xb»òfN;Òº¼}w½¼yç°¼§Å$» ŠÐ¼`9»‹ð…») /ºA]ÿñ¥Xbñ¥Xbñ¥Xb¼«Žs»E©Êñ¥Xbñ¥Xb¼ 4ß¼É);Í~»ÉP¿:är]¼Ba»Â ß»º›;~ nñ¥Xb;žw»”Í@»y¼uÈÆ»‘@ãñ¥Xbñ¥Xb¼ X¹<&¿vñ¥Xb:‹J:»ËÖ»Á¼…3¨9úÝñ¥Xb:¢öÁñ¥Xb»Š”ñ¥Xbñ¥Xb»Ç_»]â½¼²Æ»Œl¡ñ¥Xb¼c»é¿¼Q` ñ¥Xb¼2vÔñ¥Xb¼bè7»øZ–¼1*¼I—ñ¥Xb¼@Þ>ºùñ¥Xb¼{TWñ¥Xbñ¥Xb<ÐM²»¥ÛZ¸¼¯"<ˆ¸tñ¥Xbñ¥Xbº8…‡»Âçõ<]Óü<,ÐÃ;²ÞÍ9‡9“;¤ã\»?:ãÛk¼D[ »€†¼,ä«ñ¥Xb¼Oâ »(‰2»×Lsº‚ A¼Ô7ºÊ F¼t!»iúñ¥Xb»t/H»„²v:ãÄ“ñ¥Xb:¸òE;£k×»¨¾ïñ¥Xb»Ýçµ»•í¸a‚„¼" »°Ö²¼³ dñ¥Xb¼Íñ¥Xb¼x/†¼S¸»¾½¼Žöy9¢Ï‘¼Uz¼Òuê;€þñ¥Xb»LØñ¥Xb;øƒ°»T×Àñ¥Xb:P-<Ìo<Mº<ËT¡¸ÿ8:Î=ã< 8c<VŸCº×Šg¼B¯Q»òÉ»B«V»¿‰¹¢X9ÉÅ­» ¢­¼ZŠ ¼CÝNñ¥Xb»®5­ñ¥Xbñ¥Xbº÷Oˆ¼rŽ ¼4v‘¼BîJ¼iS=8§¹ñ¼—’K»34z¼}†¼“#Ÿñ¥Xbñ¥Xb»ïÓT:Gt`ñ¥Xbñ¥Xb;M&»Ô`¶;C ¯;‰{…;€ég:T»»íè$<|‹;ðLß;¸­N<ãå»' Q< %¦:!òùñ¥Xbñ¥Xbñ¥Xb< º»~3ºi‘ñ¥Xbñ¥Xb;©BA¼xóQñ¥Xb;D$¼…6\¼I ÿ¼6; ñá:ÿ; ñ¥Xbñ¥Xb¼F+;»¹»L‡a¼tÈÜ:%}X;H ;ÙdŠº\^q¼^ô+»±p\»¥”A“k»¤¼c¼n¶Ç:§»È»ñ¥Xbñ¥Xbñ¥Xb¼Ø|ñ¥Xbñ¥Xb¼¬C·;KÑO»F.Šñ¥Xb»î®¡¼D ¼!Ak» ~“ñ¥Xb»ïmõ: öÜñ¥Xbñ¥Xb»-s;À ºÕûí¼î».·ñ¥Xb»›žpñ¥Xbñ¥Xb»^0iñ¥Xbñ¥Xbñ¥Xb»‰·ñ¥Xb¼`‚½»æ¯:S.ä¼`–ï»îo¥¼±Æ;ñ¥Xb¼5Ñ%ñ¥Xb=„ém=ÇV»1-]=™îø½;Tì½'ŠÉ<‰œ¹=âÓ½HÕ̽4}»;—J£½ró~¼ÔÙ½´ˆ$=¾º<Qó½‡ÙXñ¥Xb<Ø*7½v¼õ¾ –Ó½Iñ¥Xb¾¡ƒ½²Ó½®W=70õ<ÔQ0<µ®î¼‡|<L~»ihT<Òç±=7£ñ¥Xb=³T<ž*-½&$ñ:¥ <•£f¼ŒªÁ<Æ4=5€ñ¥Xbñ¥Xb=¹$ß;ë«Í½m`´½œ»ž¼„Ë=nÑÌñ¥Xb<Ýh²<ô<ý=wò‰¼¨½é¼UEÍ=—Åñ¥Xb½‚^Y¼î•›ñ¥Xb=#ùú<¿è:(\â=Ǽ¼ñ¥Xb»f*‹ñ¥Xbñ¥Xb¼ûíÖºO¹ƒñ¥Xb=l]&½ bì=˜-M=WØe=Øß=³å<=ÿÿñ¥Xb=èI£>Žæ=3¯ =¦ =$=mñ¥Xbñ¥Xbñ¥Xb½E1zñ¥Xb;Å(ѽX±\½C¢‡=Enñ¥Xb=/ôñ¥Xb½‘Óeñ¥Xb¼R:mñ¥Xb½Îz¡ñ¥Xb;ín•»“™ñ¥Xb¼×—9=3‚ =Û½$Wµ¼·Búº˜d ¼ Þµñ¥Xb¸Y¯£ñ¥Xb½Tôñ¥Xb½p¯<âÛ×<:t€¼V#G¼[é¼I²½yS½¨>˜= Ôo=óÁf>=tqí<˽=>Ù‡»Ôe¼¬i±<|$o<„·p¼ð<>‚v½Ï1-½ªÚ= ¯m=hE¼ºÍ¼—4U½M¾ <ê“«"<.¤…=dN<.Aá=Ýd=ƒ[=Œ Û<5 ñ¥Xb=3kñ¥Xbº€×ø½H =_ö`;—°¼ñ^ñ¥Xbñ¥Xb:50K½â¬h¼àlÓ=).û»¥Ã>½”H=,©h=“ZÆ=†h…=t˜Þñ¥Xbñ¥Xb>$m>Dõ=Ód»´ÆZ;)Óñ¥Xbñ¥Xb<¬² ñ¥Xbñ¥Xb;2U½Eá»Äfñ¥Xb<ÕZñ¥Xbñ¥Xb<ɹ?<³9Ï;×Aëñ¥Xb;u´’<çµ~½‘„e½«­;í³E<Û5‡¼*v¼ë†|¼’ª®<…ᑼÕÀ°;îš=ã=m[ä½yµ½•y¢½Þ3ؼÕíñ¥Xb½L® ;;=Ey‚;²oê½Çƒó½.ž=5³ð=ÎÀw=iWì=L$”=çØ"=ÓØ »ë•9QN=\%¼ ¡ö=™åñ¥Xbñ¥Xb¼¿*='f{æ0=ž¬}<¥ß¼Žº-<ó¿¼pg©»mÄE½_5n½¤dܽ; ½ro㽚'½în½_k=ž¿‹<5aI=ay½)£C½Ÿ³y¸œ;Ö¼¯«¼c>¼äH;Ž<¬œ¬=6ä=I€¼,ra<ÁSJ<)<{ô.<ñæ(=eeãñ¥Xb½€$ñ¥Xb¼AÊô;2!<òQXñ¥Xb<¯ëÀ=:b~=zÙ¼=- Ù=¦Ÿó=\L„<ûM²=p_‘¼"L=>¢=./Ͻ|WݽÎJ=Çn.=¿qQ¼ÚÕd=ˆ-n=rïÆ»EÿÕ=·.½³Ôð=g<Ò2Ù<ñ ñ¥Xb¼¾K:X½„¦½F-Ã< Sˆñ¥Xbñ¥Xb<¢æ½±]ñ¥Xb¹å <¼õs;ïAô»Åˆ»æÔ…½¤¸»¼­’¼Ñ½¨ñ¥Xbñ¥Xb½ͼñ¥Xb½Ƚ½\6=šûc<®¦¯½“Ú¼‚Hå=N­½µ“¢ñ¥Xbñ¥Xb=_v=JĪ> ƒñ¥Xb¼‚Eº¼7Î=b&»ž^ˆ=6HZñ¥Xbñ¥Xb½W¹¾ñ¥Xb=f=SÆ»¼TLñ¥Xb<ØQ²=b‹Ý=ÄJ=‰£¹=B[ ½tÐÅ<1P³=¿e1¼ÛJi=Q³ó;“å½g¿¼1…Ò¼ËAýñ¥Xb= 1°ñ¥Xb=Ã$<©Áwñ¥Xbñ¥Xb½^p:;ûj+<ªÉˆ=rXÁ<éHH=ÿ¥=šc=—yx=¹á¥ñ¥Xbñ¥Xb½T™ <þÇ`= P­=^R)<¡ïżˑ~¼aÃ=£SU¼Ì•î=‚ºï7Üñ¥Xb<ÁFrñ¥Xb¼§%aÉHñ¥Xb¼[ç<é,@½ ¥F<Øt,½)³4½“vý¼¿Iï½–}‘½løñ¥Xb¼·‘<±D£½2½)Š½ h;ñ B¼ŽãN;"uݼ T=dó=q = ­±ñ¥Xbñ¥Xb¼y*È;á⡼¤“s¼Ù¶½Äfmñ¥Xb¼éñ¥Xb;º‘G<÷[¥=jcp; ;Œ½¹ô <—"Æ<»]:ÀB=t¾¼¡†=,^ñ¥Xb= =K=2‹8= ”é<±ãË=!i‡=§1Vñ¥Xb=:ã©ñ¥Xbñ¥Xb={=]îù<¶==º Œ=-ϼô…=ƒL.¼¨FS=fÆ£=NH´=ù©(=À–Òñ¥Xb=s‰Cº [=oº=›ëd<…ù =œL="ùļlµ¼AL"<§^‰½Ñr}ñ¥Xbñ¥Xb:ÑÜöñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½g&¦<¾:è=hŒ½¡nÕ½+”~ñ¥Xb<Ó¢=%Ü=>Œ4»$ÿW=ƒ*ã=* ü<Âôá½Ö¬M¸ôѽ 1œ½Y<©à¼ª½Ì%æ½ËƬ½l¶5¼°|½ôñ¥Xbñ¥Xb=†q¼dS·;/¹ñ¥Xbñ¥Xbñ¥Xb;·÷hñ¥Xbñ¥Xbñ¥Xb=›Üe<µ§[=§é=…ìsñ¥Xbñ¥Xb½%>ñ¥Xb½U$<ƒ:¼¸2Y=,J¼ËGV=;-/ñ¥Xbñ¥Xb=€ñؽT±½‰2‚½“Ýœñ¥Xb½‚QÓ½E=ôî½E>Û¼“Xî=“Oñ¥Xbñ¥Xb=”„î¼£Ìe½¼T ¼I°¼P¿c<šh2½ÐÔ½nQ<|s=U­=¨´½:c‰Ç»±JÉ=<Î=A~Õ¼úÿA<¯øsº—˜È½x ñ¥Xbñ¥Xb< 0Ì=‚^å=n=KaºmB>>Lš>%Ë=¬àeñ¥Xb> ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbº…’= óo=OŒ‘=ƒµÏ=Õy=œ½=ëÐ\=:<‚[=œÿ<˜ßÝ<©B³=H:=½=ŒMÙ=)b¿½n„ñ¥Xb=+â ñ¥Xbñ¥Xb=/¾¼ñ¥Xbñ¥Xbñ¥Xb¼ïÍñ¥Xb½×žœ;‚–4;8ƒz¼æh“º‚Zsñ¥Xb=ŒR]¼bÀW»7Ã=Õ?Õñ¥Xb=P™¼)½yò<µ3½ŽÏ¹< ÒR=Kêg½óƒû½¤Ýú½ßÆŒ¼¡½Í½qg²¾7°ñ¥Xb=aÕC½Ž‘¤:ªñ¥Xb½•É<ô݆º'Ù‹½?¯ñ¼™²=Y2|ñ¥Xb=¢Žu=ŠÜϽY<¼)Ý=Zâš»_5;†Q½ÍÑk=$ ñ¥Xb=¥p=‡ #º>K\=®2D=1ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=`“Ó=,£F=ù¿ =Ãç¶=»ã;ñ¥Xbñ¥Xb=ÁY=ßUí=ÞÚ9[ä=2ÑÁñ¥Xb<£³ø»WCH<Ç­„ñ¥Xb=Eó/ñ¥Xbñ¥Xb»êÈq=3!Ã<·Q ñ¥Xbñ¥Xb¼•ýØñ¥Xb½£N{½Á½¼¼ùÿ=BÀñ¥Xbñ¥Xb=^rÞ½H=¾ñ¥Xb=Ÿ‡ñ¥Xb¼Ÿ.•½¬•:¤˜<˜Ïß½¯ñ¥Xb<E‚½˜øƒ¾è½–Ó-ñ¥Xb½‹4T½¿D»9;W=ÅTŠñ¥Xbñ¥Xb漤m»€{d»—°–»Š™P¼(€¼@Ö¼²’ò¼)W¼l{m¼¸»H…h¼Q|P¼B„s¼UÂëñ¥Xb¼99»Úa5¼CF;ˆ žñ¥XbºOKê:±lÛ»>ƈ»êõi;Ä*Ð:^ÕL:¢7b;¾ ®»^Î@<x;Žúñ¥Xb¼èg<”ÊY»±¯â: ³< y®»+ûúsÝ™»Æô#¼Çå»›b꼓»~§¼%zŸ¼]/A¼&¤³º³Ÿ»”;Ï»£ýü¼¤­¼cܼB¾»àK¼pS>¼‚µI»Û{C»Ð„,¼¨V`¼ld‹»Xhµ»¥­k¼\Z#<-±_:“Y9½Øœ;Ék<»Eú<¢Æ¡_¼Ñ^L»ž¤¼‡>¼ÅÆ-»w‚Q¼ 2­¼ZO»Ö輚0“»m<Ó¼Gd"»§=:C6M¼”dè»öS»óȼ0i§¼8ã¼’¼ì«Èº¸ƒn¹<¯Ë¼‰a/< }9:N‡á»ïÏ—»°¢r<9[…<+‰<>Æ<;ô`a»Â¼ì6<¨{7» V:Ä‘;ÙÆúñ¥Xb<`*$ñ¥Xb<Âm¸=½»Ó0‚ñ¥Xb:vºûHq:·³â»-fÿ<1Á<v;󿤻¯ÈD:‹‰&;™AÉ<ë¾Þ;¼ñ¥Xb;ú0¼mX;hî¼6~ <{œrñ¥Xbñ¥Xb¼4ñ¥Xb<ˆý²<,ö;•Vðñ¥Xb»ë%»òáÅ»…ðÏ<–ÿK»fúð;FÁy¸u˜:”¦;Ö=껸q”»Œfa;ëD»º 1:E4nñ¥Xb;†7»öS*;$Ç»›9><7㤻ì‡9À¯]¼½8¥»R¯¢ñ¥Xbñ¥Xb;tÂM:öUw»pR’»ÁÕàñ¥Xb»ͤ: õ‡< òñ¥Xb:z<b1ñ¥Xb¹5$ñ¥Xbñ¥Xb¼Eë>ñ¥Xb¼_nÔñ¥Xb¼œ² ¼÷6¼”Éø¼i:¼Ëañ¥Xb¼êð»ä~¼Ž¼[Ö«¼^§Ú¼¹¼÷n»$j¼Lz]ñ¥Xb¼7ÖM¼’‘¼1Xg¼?ˆ¼\k‚¼^—e»²˜<|< §N»Äî¹<Ñ!•;­Öœº°øw;N)i;h#¼¡#t¼œ¼`»‚ýJ¼º¸ë:òô\;Ç’ª:ò´‚<•^ß‚»¨—ἧìý¼$íñ¥Xbñ¥Xb¹ÃÀå¼Wˆ[»ØR*»|“ººˆ{x¼™7»]‡ ºlä5»›Q~º„s&ñ¥Xbñ¥Xb»•…‹»÷漑"¼I& »ú‡üñ¥Xbñ¥Xb»z€ßñ¥Xbñ¥Xb»–E;Ϥºg\ñ¥Xb»cÛñ¥Xbñ¥Xb»Óe»L ñ¼¹—ñ¥Xb:®K¶»ö°¹ô‚ò:Ý ‹;šáZ»¾é6;Å<©~:ÕÃ<\È» Õ ».SκsSz»Lçl;Lx‹:¢¶¼£÷¼†^Æñ¥Xb»øЊ¼Ìo»õ³1»·.Ö¼¦q»äÙ¼ùõü;‚;"ºM¤·¼JñļrN¼àõ¼”L¬¼†ÿ¼Ÿªn¼¾¤S¼POù¼Ïw¼Ezv;˜ªë;¯Þkži¼|6'»‹ZËñ¥Xbñ¥Xbñ¥Xb»¶Âßñ¥Xbñ¥Xb¼‡"2<[¼££”¼ÿ{X¼)¢¼Ê6¼Ø²¼I6ü¼`Ｇ#¼©2ô¼²t¼ƒM¼\ ;9‚v<‰¶ù<žÝÓ;âЛ;óœ¼4tݺò­¼’KÎ;;î;óâƒ; ^€|;Pñ8¸´— 92ÿ;<†»Ý;¼3&»›aÍñ¥Xb:~+ñ¥Xb¼(Žƒ¼XƼCÁ™ñ¥Xb»Àݻ̴ºº¿¯Ö¼‰L°¼[D» ÚÒ;׈Ž¼at9<@j»ÿÞÊ:íä»°?z¼$)-»ù±¯¼/öºYÉ»Ù`»ªc»xÙ»{Õ½;n¦/»qn»ç”_ñ¥Xb¼%¼Bç¼9h»˜ö»ñ·„ñ¥Xb¼t°ñ¥Xbºu÷ò»¹Ãñ¼Mnc¼'Œº|ï»y4b:@W0¼WÈ»·¤ú9o Œº.éy»`üº=QB:ÿ®¼'¼Á »ÃË:,ñ¥Xbñ¥Xb»„}€»‘²>ñ¥Xb»¼“::Œ\:¼Qu_¼"L÷¼4ớĻ¾z—¹ó`ñ¥Xbñ¥Xb:“€ñ¥Xb¼&Ï »ÝÁh;—:ð¼GػЕY»@Ë:ŽU»Ì=eñ¥Xbñ¥Xb¼»jº· Dñ¥Xb¼•#,»“~ð¼L3¸ñ¥Xb< Ùõ¼‰T̼Ó[Ò¼4Pû¼hã¼´ì.¼2û¼ø ¡ñ¥Xb¼:»œ»¸Ë‚»µô•ºçè|</Z:ÍÇÄ;Uð9ˆÃ;šE}º8š¹·«ž<ƒ‘†ñ¥Xbñ¥Xbº´œ';á•I¼D;(⼘›þñ¥Xb¼ó—ñ¥Xb»ÐFǼ¼Õ¼.—¢;—i±»ò0»ÌÅ8»¤ÆÕ:ds]¼€´»†¤9¼B»3ñ¥Xbº¹O¼Ï‘á;‚4f¼-»Sº>| ¼M|Þñ¥Xb:å…pñ¥Xbñ¥Xb;4Ïë;z¥ ¼‡š½¼”Œº>èT<€ã¦º@» ;vÀ(;Ó¿Ð:†4µ¹ ÁD»…A~ñ¥Xb»òþ@»C·ˆ;+j»lPF»»0ó;’&‡¼2 »«#œ:“° »C_;Ƙõñ¥Xbñ¥Xb»f8–ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»b:¨SÉ»ò»Ÿr»Û˜ñ¥Xb»{•B»þ&à:͆л_÷»‘Œ»C©h:œ„º»µÓ¾»*¤;ýÀa¹Ä,Ù»®²[»$uC:³‡?946º3=Ÿ:zvº !Óñ¥Xbñ¥Xb¼jK¼Mþ¼‚Þ¶ñ¥Xbñ¥Xbñ¥Xb¼r&fñ¥Xbñ¥Xbñ¥Xb¼X/Ѽå½ J3¼ˆ›Añ¥Xbñ¥Xb¼[®¦ñ¥Xb¼‡à¼Ðí~»¸}(¼…Ïè<†ÿμÌ)òñ¥Xbñ¥Xb;ÝYɼs(š¼k°«;µLüñ¥Xb¼Á)±;dq®»ªv»jÃÿ;]7ü<,Xñ¥Xbñ¥Xb»Ó*<Ÿ»/åž»+Ñ »Ò8r»‘±ã»nÜ»>ñg»©–-»lï³»è¥c¼Ž¾ûº¬ì£¼gJ¼{õ¼kÞ®»ë®0¼Á@¸äa&ñ¥Xbñ¥Xbº^“À¼Ž~¼ò¼ªeš¼™ì»èSÝ»8Îœ¼”„Rñ¥Xb»§íñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbº*\.º È.;¤qÄ<`#M9bW®:Ucé;/Z»BÓr;o:n;oCk<&‰»;j/§»3á:‚.êº Š ;Eõ»àñ¥Xb:ðŽñ¥Xbñ¥Xbº%“»¯»ñ¥Xbñ¥Xbñ¥Xbº`‰•ñ¥Xb»ñÓª;E/£»hÿH»ÕRAºAîSñ¥Xb:ÆF÷»T»e®a;¶bñ¥Xb»ZSì»!…:'6±;‘ää»—p¥:³õºº4磻 .¾¼.³ª»0KN»Ìﺶ#º©kñ¥Xb¼Užñ¥Xb»ƒÁñ¥Xb¼—F¼6¬¼i!¼DÞ㼸ãWñ¥Xb»È{ƒ¼3½¼«,Ò¼¨Üfñ¥Xb»=8þê=˜J=Q@<CBñ¥Xb<Íê>< ä¿½¾ÑŽ\Y>«ð<Ñ. ½lƼçÞ~<çMû=/h_»÷Æ{<“%ó= •6=‘œñ¥Xbñ¥Xb=¥cc=uB½H:½ Z‚=#6ý=åú£;Z\½O¥=a¼–õ”=ED=Â.Š=’òRñ¥Xb=‡„g=ãñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¢?<ÅAŽ=„Á“ñ¥Xbñ¥Xbñ¥Xbñ¥Xb>!=„¤>=ÇÆ3ñ¥Xb<æ8C<‰½r¢b½mþ:G ;½˜»Ž¼ÔZÛ»¸ëØ=í׺ Fñ¥Xb=/×k¼×½É¡½–P•ñ¥Xb½/“½‹P:X·ñ¥Xbñ¥Xbñ¥Xb=SêØ<•yhñ¥Xb=x0<…Ûu;l棽‘Σ½$;J²Ý½ž`ßñ¥Xbñ¥Xb½ô ½…h[ñ¥Xbñ¥Xbñ¥Xb½[Íí<Ò£©=ÿß—<¶1þ=1öϽŸö=hÄ=%Èç½$Kž½¬Ý‰=;y¼a„½KÐ༲ãÜ= ”<Ñ%< 2†=û=QT=;°='ˆ,û=^©X=`=¨ˆõñ¥Xb=K[=+\ø½s~„¼¿gÑ=\½F½E–ñ¼¶²ãñ¥Xb¼«Üºñ¥Xb=)Ø:½>¢^»¾ñ¥Xbñ¥Xb¼:˜<½‘£<× \…=© /=•>q÷¹çˆ=DwM= ÎÆ=mÙ=C,¼AT¼<ó<µq%<Ý>Dñ¥Xb¼´eoñ¥Xb=Ž@Æ=§z²¾Ôé;¼0ñ¥Xbñ¥Xb½¥<»A=Ïn1=)'=!S'=¾\³>s¼’Æ6=‡qƒ=Éî4> êq=ëc<Ùѯ<­`s»¸ÃF½‚ÍN;•ÓÁ½‡¢ì½W¥‹ñ¥Xb<L½ߟ¼j|¼éEd½•' =§Ùj=Ñqd>F?9=ÇOTñ¥Xb½„|I½lÌ–<Ä„<ñA¼þ}¥ñ¥Xb=ÿ}Ñ Š¼ÕÚÿºÍ é½Ñ%ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ﮓñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¦L\=kö¾>”Ø=ôX¡ñ¥Xb<åKB½B«­<ÓÍè<’0λN‘¼Ébäñ¥Xb¼­_×¼ ¹Õ<»î³½!ñ¥Xbñ¥Xb=¤ËAñ¥Xb¼}WQ½žjƒñ¥Xb¼çÖ=,éMñ¥Xbñ¥Xb¼èc…=§+ñ¥Xb<'ú~=´Q<µ^㼆û1=¯Àx=š¸ñ¥Xbñ¥Xb¼Â{ ½1=á;î¨;;0¨Rñ¥Xb¼•bŒ=pÛ>Y¶=­cm:«ý0<âÒ¼/¼ìno=ª0s=šé>î˜=Jê=neü½ƒða½´å˜<ú8¥½i‹«½Ç#î½п½~ã½OÄHñ¥Xb½NÏû½;•§½5í=Gä=vwGñ¥Xbñ¥Xbñ¥Xb½Æ#3º“`=ëy=Å(¿=|b ñ¥Xb¼Þ;ô¼Â>c<[+ʼÔÎÄ=& ñ¥Xbñ¥Xbñ¥Xb>·‹ñ¥Xbñ¥Xb=€?껧5<ë²î=¤Ž=5¿ÿ=©ˆZ¼´ª-XÀ=¶ñ¥Xbñ¥Xb½³=4bßñ¥Xb=Mõ=Tr§½ 1‚<}ýº½pê=Pƒ 5=›¸–=ˆÌ»=ž€Uñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=µÆ = ‡Á=Æš=’ =¶L½’Hñ¥Xbñ¥Xb½¤…½°É¼›È›¼@ ƺ'z=å´<”Õ½!íÚ=BøŸ<ú7ñ¥Xbñ¥Xb=j'<Î÷À=R¶;lÃ=i7¹=Ýø#¼Uœ:ï-Yñ¥Xbñ¥Xbñ¥Xbñ¥Xb<°ç¤=üy=Ë­Ø}P=Ô «¼©dh¹Ö»*;yk â=úÉñ¥Xb<ò[Åñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÊGùñ¥Xbñ¥Xb=³Š5=‡ï<¢ÓYñ¥Xb¼ºº½†ÈG¼Ž«#<Ï= ³½½Dlß;6,¼`ŠG¹<ì{ñ¥Xbñ¥Xb½<Á=Õ$<3 z<å¤4ñ¥Xb;ž|t=ÞàD<À2bñ¥Xbñ¥Xbñ¥Xbñ¥Xb<ɱ‚<é}ßñ¥Xb¼ÈT×=ˆð=^ËF=Z €½S¸¤½@ 5½4½/´ñ¥Xb=×µP<áæé=™½ž<Ñ[½qk=zp½Ì#;ZøŽ=V&Íñ¥Xb=’ìR>ñ|ñ¥Xbñ¥Xb¼ñV3»ƒV¥½V¬ ½HÚD½¥™½m]T½¶”½wÈÌ=û+‚=ö¿ <‚D$Ì»GW¤ñ¥Xbñ¥Xbñ¥Xb<‹«(½::#=V<½ð=½ÿ ñ¥Xb¹Í ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ýñ¥Xbñ¥Xb>Jh`=®§2<  äñ¥Xb»¡8ñ¼6ja¼¢¡£<¬n=@ñòðñ¥Xb;Ž3<àX¦¼¤í‘»ª-·;êµ;¼mÿ=‚ÎÕ=¥)ì>]Ÿ¼}„Xºñô¼¿ ¼OH̼=F2¼¥Ûg¼ØKÉñ¥XbºNcÔ:·V~º£ß©ñ¥Xb¼}CF»Q©·¼6œû¼\H?¼…óIñ¥Xb¼1廋»?U»œÈɼaM_»Ê¡};Ó—¼zId;¸Ca¼+ž ¼nÖ ¼…Œ{¼:4¼p›°¼²’l¼^e$ñ¥Xb¼Ä,¼iåà»äw×¼I1¼!+Þ»üê»ýÊZ;Ÿ÷ñ»ÿI컄‹ö¼à¼)ɼž’»‰´;ø³»4–:ñ¼4?ºÍNžºÏºc¸í”F: –;Ekv9I²ºñò: ˆè».¶S¼*Æ/9,F;Ûž<—H;»”4G¼nv(¼¿á¤»#t™¹¼Òö¼Jgÿ»,®¼-¹öÀªñ¥Xb¼¼th¼u6 »úÜ :ŽL–»¡5U¼>,?¼–Ë(¼¼!Q¿ñ¥Xb¼0x&ºÜŸê¼™,~¼DU¼›Ýjñ¥Xb»+e91•< Iá»Y»TM9¹¥­4<i¡¼(’¯_ºšhñ¥Xb;À½:µvù;òý;Ï&;ØÝñ¥Xb<]9Æñ¥Xbñ¥Xbºü‘Á<"‰»–°;ÑbÅ»íÁñ¥Xb»öFW»ƒ¶(ñ¥Xbñ¥Xbñ¥Xb»æØ;Ú)X;Np;^¦êñ¥Xb»¦¬;ÂSò»‰aº÷5×<;º;¼½º:ÍñŠ;Õš»»q ¤¼@™;·øD»Íƒ,»N ²ñ¥Xb»—7Yñ¥Xbñ¥Xbñ¥Xb:Ûèn»ÐD¼Õÿ»¯à¾ñ¥Xb»GÕæ¼Úgñ¥Xb¼±U¶ñ¥Xbñ¥Xb¼L°À¼ÑÖ;YŽ*;ÌÑÕ¼}µýñ¥Xbñ¥Xb»8¤»Ž*/ñ¥Xb:©àǺ[jŽ¼$…»q »ÇTp<h¼ 7ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:—ø=<’k‚ñ¥Xb;6Ü-<öÝ»˜Áá»ðÊñ»@8»Ï(t8,£»Ç ´¼öQ¼$ª¸¼gE÷¼wëì¼G®¼ý2¼žQ*ñ¥Xbñ¥Xb¼®Ç$¼F_¼7•2¼'Åp;o¼gYE»ù“Þ» ü›<7»À“È<»<ª–»º«Úñ¥Xbºº1³;yûHñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼nï¼-¼™ÅÎñ¥Xbñ¥Xbñ¥Xbñ¥Xb;ܼش:)ô{ñ¥Xb:ó)0¹çAŽ9ö­ö¼<…:pZ»¹2F»Œ[‚;¨…M; z_ºÅæ>ñ¥Xb;'Ö¯;ó®»0Þá¹fImñ¥Xbº˜‘<»·9¢:îîlñ¥Xbñ¥Xbñ¥Xb»];'.ñ¥Xbºí.ê9`>9þ…»íô•»F r»¹ H»Ba ñ¥Xbñ¥Xb;ï-D¹9TÒñ¥Xbñ¥Xbñ¥Xb»»_:ØFˆ»Ê¸7¼3±0¼bù¼¾+¼²VÏñ¥Xb¼X[¼‘fü-eñ¥Xb¼|Zy» o¼¯î÷¼½2i»ŸJºX,#ñ¥Xb¼z»¼•÷ʼÔi;½›¼?Úª;<^_;è’»Ó[C»»ýÖ;«Æš¼l”þ»ÐkC»ï}¼Š46º=TºM#ý¼@ç´¼‚º¼ Žañ¥Xb¼ %²»h¢¹¼-«äñ¥Xb»·,¼‘ãH¼FÚ¥»€Nñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:AÊñ¥Xbñ¥Xb»5Q|:ÍðÝ;ÊyV»LÆ ;]“„»šú*»íÖ©»â&»x(»'¸º©»Ãjt;¡/Á;Î ë;>ÊÍñ¥Xbºªöôñ¥Xb»â »ïÛ»õONº«ÞÝñ¥Xbñ¥Xb8 †;“ã ñ¥Xbñ¥Xb;4iñ¥Xbñ¥Xb»âWÌ;¨gºðžºû©Q;öl9»³C(»tÜáºañ¥Xb»£R‚:vò}ñ¥Xb¼8Ë< ÎÊ:Ó7­¼nÏD:h˜ ¼Frû:ÄGÞ»bu9Åx:Šs¼+°®»ûDd¼ƒ½j¼0¯'»“F¼Œ{¼Œú¼c—š; ŸJñ¥Xb»ì¼Õ¼麋­2»m²¼ƒht¼b¢¼b«»•æÔ¼_ Pñ¥Xb¼;N»‡ÈºûJ»ã;­98ñ¥Xb<kÞ¼\¨ç¼o¾ƒ»ƒß‘9š¶«;8ÍA»"廾¢A¼Dñ¥Xb<Ïåñ¥Xb¹¥ºŠ»ä£·¸›w¼Ã[1ñ¥Xb»ªM ¼qíx¼›5»»&L¼Dbx»ê¬{»ù'º¼J.º$‰¼¢ÿ»Ô Iñ¥Xbñ¥Xb»{ ¼žMU¼HÁ¼ µÜñ¥Xbñ¥Xbñ¥Xbñ¥Xb<(CÈñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;’g»!Œ~;)×­»mÌžñ¥Xb¹hz(»ÛÚÒ»Jݺ­q›¸‹‚è:‹ñ¤ñ¥Xb;Ìd;mµº>*ì»iPñ¥Xbñ¥Xb¼.0™ñ¥Xb¼eXɺqÿñ¥Xb8–’‘:ho ñ¥Xbñ¥Xb;A¨{»ÒÒÙñ¥Xb;"@<na<# ;öV>;²a;ï\°ñ¥Xbñ¥Xb»ZÌC» °»bˆý;}ñ¥Xb»D N¼\ÏÁ9¬”:Ž‹Ž»E?Š;[_¼¼‰¼wâ*:Äð½»Ójœ¼`»’k漤ð"¼y»¶¼Än¼š0Þ¼¼#»Žf¼¦ »íÑ);\åñ¥Xb¼ëK‹ºš¾º`+y¼áíϼ7gÃñ¥Xbñ¥Xbñ¥Xb¼ ¬:URÚ»þ/¼º‚Q»§ÊÈñ¥Xb»oÒݹ¾Œà»Ìã¼5»Îí;ñ¥Xbñ¥Xbñ¥Xb»ÑÝ*ñ¥Xbñ¥Xb¼(¼6°Þ»ÁxX»/ˆ¼µmm;Ðo¼jG¼ªix¼8é¼àX¼ éǹápÙº¾O»`¼’T›;GL°¼„§ñ¥Xb¼ ’E¼^•V¼%!­:þ [ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼™„»+Ü»:êSñ¥Xbñ¥Xb<^ðñ¥Xb<0p`ºHÛ¸:íåÝñ¥Xb:++-»Uv%» ž¼"œÑ»ÜbÊñ¥Xb¹@Éñ¥Xbñ¥Xbººæ|;ˆ ò;p–<¼=<¹ÿœïñ¥XbºXÝ<#fñ¥Xbñ¥Xbñ¥Xb;fS<2»a(u»e_Æñ¥Xbºæ½î¼NL»‹o»%õ:ñ2» 5¢8ô~Ç»vÕ»è-Ǽ#6:rÊ:rм¾ñ¥Xb»Òñ¥Xbñ¥Xbñ¥Xb»ÓÎK»ññ¹”í¼»Ãž$ñ¥Xb¼°Ï-¼\œ`ñ¥Xb»u3ñ¥Xbñ¥Xb¼š¼”ÂŒ¼êø»ó@¼ gñ¥Xbñ¥Xbºì“¦¼Oîñ¥Xb¼u¼VؽºL‚z»Â’÷¼ W¼4Á4»ê,Ùñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ì´ºúˆlñ¥Xb¼uŒ˜;!›E:Ɇ§»£„Òñ¥Xb¼3†.¼€b¼Ö—¼‡§°¼“³¼eñ¥Xb»îÃSºû]¼ùs¼}¼(¡¢»²dß¼8U3<r¼*¾ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ÒŒ9lÿ¤<Ýõz»™Å%;ëÖ:cõ†ñ¥Xbñ¥Xbº„-I¼ »'¼hÇ:˜JÄ»(kùº ‘»»Ó.þº¶‘€ºÙÑñ¥Xbñ¥Xb;ë`Ò;º;‚Mì9ä%2<%:›n;Û);&,Œñ¥Xbñ¥Xbñ¥Xbñ¥Xb› :G€ñ¥Xb»p|;k“;¨ùw<μ<†]ºE¬Èºìƒññ¥Xb¼R7¼Qf;@{ñ¥Xb¹F„ñ¥Xbñ¥Xb»¦¬Uñ¥Xb¹îßÀñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ñ¥Xbñ¥Xb¼7ð¼Á;”“Þñ¥Xb;±e;4º…l7ºíü“»ƒ‘ ºÍLøñ¥Xb»€Š"¼; K;‹d9»¹6e9œåȼLz̼\È ¼‘Ǽ(³ýñ¥Xbñ¥Xb;¤=‹¼Ÿ›Í¼#&Œ½á1<¶¾B¾ ý{"8ñ¥Xbñ¥Xbñ¥Xb=¤¾Ã<·Älñ¥Xb<ž~Š<†ÍW¼Ñ˜½·&½ µ½3<²¼ÇÖl<¨‘½=_Ñ9<,dï<§¯ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½(8+½>ŽÉ»:0=d²ò> è-=7‰5=ùã=Šfø=Ô©èñ¥Xb½‡<73ùñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼Ã?þ=ÉÍ<€”þñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=}šÆ=»{fñ¥Xbñ¥Xb=Ìã=aYXñ¥Xb¼ât ½w±K;³‡ò=Sò–¼2Ô<Wñ¥Xb¼(@>=Òa<“|<…5o¼n4„»Î´ë=‰Jµ=º„]ñ¥Xb¼àP1ñ¥Xb¼ò/ñ¥Xb=º?ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=™lˆñ¥Xb¼9Ü;&+Q=8>ñ¥Xbñ¥Xb=jT=ŽœP¼™÷v=Ñã>'"=òìñ¥Xb=Ár@<öO·=6Ú¼Ó!½€Ý«ñ¥Xb=—Á?=Àns=&êº=Á<0E7½HD;Éï»< t/=»¨Ä½X/¥ñ¥Xb½bš+ñ¥Xbñ¥Xb==b6¼.¡êñ¥Xbñ¥Xb=¾%¡=¼.{»ì;À±½_º¼XËI=ý¯=°½ñ¥Xb»‹¬Zñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Ï÷R;xgE=v=Ññ¥Xb¼mK=¤C¨½*^¼ïý³Ùˆ=†=‡jªñ¥Xb¼¯v*½I.–ñ¥Xbñ¥Xbñ¥Xbµ’>Õñ¥Xb=œÎ=§U·<íÞa¼}•º½BV=¥ïÙ=o¶yñ¥Xbñ¥XbºÈmí;÷%Š<1Cz<óX?¼Ðç<‹×\<=»È­=óí<™`ó¼Ë z=ã =—Cñ¥Xb<ßúÕñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ó(ñ¥Xbñ¥Xb;§,Ÿ¼ZK²ºp¼Tñ¥Xb=8==ŽÛ6¼€q½$$1=¼ ­>RX}>Y¼ Ž:;é ¤=bD=ÑÀ9¼òUñ¥Xb= ã©=¦:¼ñ¥Xb=ˆvì=# <љҼ¥xØ»ÓÁ<ŽŠÂ½—sèñ¥Xb=9[Ľ¨‰1ñ¥Xb¼¬æ˜=ĹC=/nÁñ¥Xb=Ëp·=âj8¼6þQ=f8³½&&´½‡I…<–þ¯;Ár=h\Óñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=$:¾=d-Ì= Àòñ¥Xb= »|=ܦà=ƒQ=Èf®=¦É,=ø}]=ƒë‹=M°®¼^aŸ=&Å=<çÙ=]"û=Š"…;©®=Õß\>e=¨k¬ñ¥Xb=Ta=©tx=`ír=ê'm=”„4<&¬®¼ŠPO=²¾¼›7B<ŒH‚ñ¥Xb=jÅ=C¸´>µ¸¼Åð¼=Jh¼=¬ ¼ú@=7ˆ‹¼Æ†6<Ì=c|ø=sÉ“ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¹”p>JHñ¥Xbñ¥Xbñ¥Xb<—/<œÊ=Sœ1¼Ívgñ¥Xb¼ƒÝ<„Õ»0wÌñ¥Xb=¤-÷;زƽq$Í=u89=¦5=P+õñ¥Xb;t'ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=·Ï=Äpw> Ä>èË=)¡M<Æg?=ÓQ×ñ¥Xb=ê6Ø=b†=A<ú¼¼ =ˆÀñ¥Xbñ¥Xb<··à=:Z‹=Oö—=Í­=u¢p=#y ½}ƽCÚï=g_€=0ß­=X´ñ¥Xb¼d·<ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Èÿæ=%©¯»Û‡¤<ÄÛÿñ¥Xbñ¥Xbñ¥Xb<¡õ;j z=“] ñ¥Xbñ¥Xb<ïÉ=´ƒƒ=zˆl3â>ŽÇ=™ ðŒo=prF=³ÑÝ=nãÒ ±"=@.=«µÆ>RG1>‡q=>L=Ž/Û=žÍ—=½Ä®=v,<㫺¼âöúñ¥Xb=ž¶=ï_>2 >Ñ<óË©=†[=B<:Ÿ¤'ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÁÉäñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½8âx=d£Uñ¥Xb='‘Ÿ=\»€ñ¥Xbñ¥Xb;õ¥ñ¥Xb¼ 2»Ï«ä<öñ¥Xbñ¥Xb¼¯³Ô=\(=ËïºüE=‚X>÷½<þQÁ<y\»Ž¶ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ñ‚ñ¥Xb=s™O=™ñ¥Xb=¨†¿½¤³>=š‚>=‰¡çñ¥Xb>¶×ñ¥XbZv=ƒÌ†> ºYñ¥Xb=uìû>„j=Bk=ˆ(E>U¾½=“Wõ=fk7=uÅ=\=ˆÐ=ˆ‰Z»÷7¼ÚÖë¼~ÓC=ÇŠk=Äwž>çú=âÉA=«,ñ¥Xbñ¥Xb=oÚV<°:%ñ¥Xbñ¥Xbñ¥Xb=ÅŽÄ=ò—0ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Y ý=$4=¦ñ½›²Ãñ¥Xb=}¶ñ¥Xb=}£^<»Êžñ¥Xb½O\‡=C­ü<øÇ9lxñ¥Xb=Š0U=q{p=–6¡ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ƒBñ¥Xb>DL›¼LÇ$;…ð¢ î‘>28@=Çq=‘bP<Ï9»><Ô×>I=5K½<­uȽ†ƒ¹=ˆU<™Ãæ=‹3=òš=ˆ¸•ñ¥Xbñ¥Xb> Ö¸=–¢o=Âœgñ¥Xb>5v,=Ât2=³Kàñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<â.¿ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbß<.ç²¼ÑBh½µ;Vž=ÞÇñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=gS¾ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÿvzñ¥Xbñ¥Xb=Ótñ¥Xbñ¥Xb> ÙÎ=®j¿ñ¥Xbñ¥Xb»Ú’Š¼µ,:Öµ»nW2¼ÌÐ38íP¼Í\#ñ¥Xbñ¥Xbñ¥Xb¼DÞ@»Ù‹9ñ¥Xb¼‰èy;7GÛ»Œ/6»Áìf;¬E<;€8“»Éžu»éjg9Íxv¼9~»B3±ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¹Lçõ<+R:¯ º¾n»–3Ã<½ûÂ<&ó¡»4·Ó»”¯ñ¥Xb»~á4¼¥_ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼9W™ö<Ç:Õ= ºÇéµ:Ždw;ÎZ-:òâ.;nØ€»ØaÏYºŸÛ»ò6ñ¥Xb¼’nb:λ©Øu;«µŒ;1Ë_»Le¼û¤¼aµô¼HU4¼™ääñ¥Xb¼0Ÿº+ÇÚ»µ€9˜Žg<-0A;Ž;8“ݼZµL;u‘_: ê6;¦þ¶;ÃAÜñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;”¸‹ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<`Í;µ.L<*zS<$º…»¬µ‡;3fñ¥Xb¼Ix=»…ñ:œb;³•Ž;²¼“ZE»˜Áþ»J‘;E½‰< cí\:‘žlñ¥Xb9’Jn;«â»»8ë=<=•Äñ¥Xb¼‡;ÚO;É/îñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Q’ñ¥Xb<¿Û½º¨ö;<[©º¼I‹ñ¥Xbñ¥Xb; ›†¼ Òþ<2¯;ÕMÉ<"R–;™¤$»:¿?ñ¥Xb»\\ðñ¥Xb9Ûúñ¥Xb;¼'*ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<;/*;Âñuñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<8™Åñ¥Xbñ¥Xb;:A\;æŠÐñ¥Xb»&>U¼ 'š<+9ü;ŽMr»\ÜGºû¬|¼aP»UïD¼nœÂ»Á¼‚Ï>5æÃô¼÷Ó¥ºn‡:º•Yñ¥Xbñ¥Xb»‡Æ伓 »ŠÇ²ñ¥Xb:ÿZ;ª!}»%Etñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;è„gñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<…’“ñ¥Xb;¼lÔ;Dö<Œ~Á<öñ¥Xbñ¥Xb» ~õñ¥Xbñ¥Xb<+Eñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:cÅÏ;ÀBhñ¥Xbñ¥Xb» V6ñ¥Xbñ¥Xbñ¥Xb:ÉóÕ;¸â‚:!éºØgP;*;Sñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<[ðWñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Ô8ñ¥Xbñ¥Xb¼ WYñ¥Xbñ¥Xb¼µ» Fgñ¥Xbñ¥Xb¼—˜¼yJ¼Ì·9¼M­'<_ø»è’y»éo¸ñ¥Xbñ¥Xbñ¥Xb¼,¼—ײñ¥Xb»~¬A;<Ô©;…ݼ(”“;I»T»ä®d»´æ;»9¨¼>ÊI¼µm:Fjnñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ Õ@¼1"æ¼$™¼f¸:ø´•¼ƒ0û9õ]»ûÒ>»¬ëMñ¥Xb¼“ØÎ<YÃñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼sº-¼=ïh¼ƒLžñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¹€îî;ÜqVñ¥Xbñ¥Xb;¬¡‘;]1ñ¥XbºaÃC»4Ê;Âêû;1~P:’œ³»•Óñ¥Xb;j=õ»—ƒ/“åñ¥Xb»½cÝñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;úÎñ¥Xb»ÏY¼Hô€;Œ7Ÿñ¥Xbñ¥Xb;ÿ³X»!ø¼,ÿ~;1W¼¼ñ¥Xb¼o ºåæ6;½æ9äYv¼þñ¥Xb¼ô)¼>H¬»êÿÊ»½aj;L³À¼§"¼H§n¼‚®h¼FÄu;®®æñ¥Xb¼™àÚñ¥Xbñ¥Xb¼‘lÿ¼œhdñ¥Xbñ¥Xb¼”w}º½³v<à“» ª•;qü绪X½¼L »ìÿAñ¥Xbº.;Qñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Áõþ¼“ö» ßöñ¥Xb»ÿ§P¼M$¼#‹»¡°E»>`»cïO¼>JAñ¥Xb¼‰pf»Ÿ¢ñ¥Xbñ¥Xbñ¥Xb¼vC‰¼ Àñ¥Xb¼&òH;Ýcäñ¥Xb»(‘Äñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:éÍ»à½;áõÀ:Ì0ñ¥Xb¼Žk&»¬š”:©?;莺¼ˆ“;¢îñ<ë¿ñ¥Xbñ¥Xb;DGK:„_»³X;÷—G;Oþß»Âû]:éò?;…·Ÿ»¼¹’;E O<;Æw»ýº£ÖÃñ¥Xb»»%wñ¥Xbñ¥Xbñ¥Xbñ¥Xb:Û'¿ñ¥Xbñ¥Xb»·h:Ð%Ñ:žmñ¥Xb¼.¢:Hªž»KG¼ˆk¼un¼6o=¼a©¼¤Sµ¼™':¼#A»”‡*»ÓÒ1ñ¥Xb¼§#5¹ñ0ñ¥Xb¼RØF¼kÃ;ñr¼;Ÿ¼pW¼BVa¼œó/ñ¥Xb¼],¼Ÿ)ñ¥Xb¼?<»ù·¼y ˆñ¥Xb¼Tg¼Â¯Û¼˜Ë¼H°Ø¼ŠTº»i!šº·C»ÌÓÚ»ø²>ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbº”YǼe»>åäñ¥Xb¼L°¨¼Àœ¼£@Š»V¸ê¼PD#ñ¥Xb¼»Mñ¥Xb¼…©ñ¥Xbñ¥Xb»¥*¼+\¥ºöUiñ¥Xb¼‡äñ¥Xbñ¥Xb¼ ñ¥Xbñ¥Xbñ¥Xb¼P¶Êñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Ì ຣ“i±;ØǸÁa);Ü<1¼;á;Ç’†<i;y™.;ÈJµñ¥Xb;=q5ñ¥Xb<#”?9æǼ;Íe¼r;Û–V»ÏzY»Î{S<9;ÓÔ;¾÷:(Õê:¦e ñ¥XbºI³>ñ¥Xbñ¥Xbñ¥Xbñ¥Xb:~»ï;Ñ#©ñ¥Xb;ˆÆJ»ho;Jç£<Öí<‘ö; œ; ~;ærº°—»‡ B¼¸˜¼Ãqºˆæj»ž[K¼rQÙ¼8þ¼a©Lºþ༽쀺҉Ÿñ¥XbºìÞú¼?º!¼­4.¼µ¼Ek½^.»v½¼‡„a¼g[\»9aÆñ¥Xb¼Nt<¼}I1»1¤§¼‚dd:ÿÔJ¼Y³»´ªÍ¼ Ñç¼^,¼B¼)ÆS¼¦îñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»÷ÏR¼ ñ¥Xbñ¥Xbñ¥Xb»+eú»òGÿ¼&ä¼'˜˜ñ¥Xb»ß>¼$äÁ¼¨îñ¥Xb¼˜Œ”¼‹¾Ø»‚ƒ¡¼Û?;Ns¼Ÿè‹ñ¥Xb¼R ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;’ú};¦dˆ;!,;Ò¦õ;€Wã»zÂÏ;¹ÕÁñ¥Xb;^И<ýi:G¬T;„Ýù<ë†ñ¥Xbñ¥Xb;Xmº÷GŽ»„v:ýÙ1ºî4ñ¥Xb;ÖE³ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;e;OE?¼P½s<ïÄñ¥Xbñ¥Xbñ¥Xb;§ëJ:ºÎ·;£B„ñ¥Xbñ¥Xb¼B™W»‚/c»ï1¦¼~T¼3|¼ ÎFñ¥Xb:®ô¼.…¼UÏ«»‡o¬¼Šȼ¦&ë¼XL)¼ŒêB¼g'¼´ Z¼±Ø¼cDk¼€¶ùñ¥Xb<«õ¼rž¼nÆ£¼‰†¥ºð³¼ï’‰¼pѼK6üñ¥Xb:öVñ¥Xb¼Ä·ž¼é¼U«”ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»RÖ×:¿Ÿê¼…mŸñ¥Xbñ¥Xbñ¥Xb:­X?¼€+O¼””J¼dÖ@¼]¤ö¼/á/ñ¥Xb»±p®½<¼"س¼=fè¼+G¼ ·<»^2ñ¥Xb;{P°ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼,çWñ¥Xbºhà »3˜ ¼OÃ~ñ¥Xb:uîñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºçéÓ»nfÊ;äv»0Èúñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»­¤K¼ ×:6’q¼X“»‘‚4»ÐîÚñ¥Xb:`#»¼»}ɼŸ¼Ú ¼lx: k¶¼rcŸ»Í5¼†y0¼'µ¼Ræ±¼×Àñ¥Xb»Ù™e¼Ëpž;¤…÷¼dÞ¼¹^n¼µó¼§lë»Ï !ñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ô>3ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼!Ý"»Ñ˜èñ¥Xb¼0@¼)+Ôñ¥Xbñ¥Xb¼ûžñ¥Xb¼? f¼OFµ¼;¶ñ¥Xbñ¥Xb»ãÎ_¼°@¼6a(¼²ä=¼WP»±&'¼ öºõ–a»[¸%ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;«ñ¥Xb<+íó;­ˆ)ñ¥Xbº—Å<)á©<#¸Ù;ƒ™ñ¥Xb»¡³¶ñ¥Xb;pŽñ¥Xb<@Á4<œ“„;†¿Óñ¥Xb<{Éñ¥Xb»]Ïå;Õõn;—²éñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<³°ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»©c5»EO:F,ñ¥Xb<6.Ò¼ŽÙô¼7<ºiÓ„;Æ1¼ €¼ˆ;¼<¼1jà:¿’Ǽ<L¼²Nl¼-?ƒ¼NaN»»{®¸¼×“w»[Öñ¥Xbñ¥Xb¼ŽbG;çjÝñ¥Xbñ¥Xbñ¥Xb»ËÉó»GÌ2ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼j+¨¼Jph¼Œi€¼V¶uñ¥Xb»ó+ñ¥Xb¼WjX¼pä¥ñ¥Xb¼.§z¼ß›É¼½í¼¼êñ¥Xb»8e»¾[“¼œÙîñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbVñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼$¿ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼[.yñ¥Xb¼†¸*¼ö»ë¼A\zñ¥Xbñ¥Xb» ñ¥Xbñ¥Xb¼9J%ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<@ÌYº£Èñ¥Xbñ¥Xb;À54ñ¥Xbñ¥Xbñ¥Xb;}=»¬¯Ô;©z¼,i»¯»;âz¢ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbº”ºjñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»…pñ¥Xbñ¥Xb<êÏñ¥Xbñ¥Xb<Œ;š/ˆ=Í÷=ç+A<­o%=EQ=¶^î¼qûgñ¥Xb=`ÐÁ=‰Œ6=ˆdüVë†ñ¥Xb<µ_ø>&Èê=åú§>?[H= …þ=S`œ> ±H>›Ž=ôÖºÈw>BÂ> ¢>=ߥN=ü‚E=sHÿ°=´çö¼;"l=¢£)>@tB>3*<¹l=È”¾ñ¥Xbñ¥Xb>Y¨å=ñ&=Ø<,=µý<ñ¥Xb=CÉñ¥Xbñ¥Xbñ¥Xbñ¥Xb<“2¸ñ¥Xb=çA-ñ¥Xb¼”*¢=:aoñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ª»ñ¥Xb=+k¸= #Ìñ¥Xbñ¥Xb>9Ø6=èÏÐñ¥Xb> F=Êd>+Áἆ@x½›®<›Ò¶=Á¼;w»›x˜=…Åýñ¥Xb=Ékñ¥Xb>1±>0¦µ=„^3=›nj><ÿ=ê.Âñ¥Xb=Iƒ°ñ¥Xbñ¥Xb>ZÕ¯> þ¬<• Î=÷àñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=­V²<̶½Á4c=À:øñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb> ÏÉñ¥Xb<@Ï=†³¼ñ¥Xbñ¥Xb>—,ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Á£<è­½2C»sú¼Ú(o=»®Z<Ë>ŽÙ>…J>³þ>gñ>Éø=t9=”Ýø>%m!=é-ºñ¥Xbñ¥Xb=ÿ ñ¥Xbñ¥Xb>zF=㊥ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<ßè¹{ š½2–ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=‹&æe¡>^H>1 Å=ø¯Ì=å:ü=äW>%pè=Ëߌñ¥Xbñ¥Xb>Ï ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>J†>{ññ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ù >»žñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb> ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>tÿ¤ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼8Ñ;—Åf¼„“6¼+3;äËe¼Œ‘ ¼SÅ»žë8cød¼#ÔÃñ¥Xbñ¥Xb¼;Q»þ†Ü< o~<Ê;¤“¼ ”w;'.'9™SÙ;ÉœP:¡ äñ¥Xbñ¥Xb»×);jïY»‹Qb»\Áñ¥Xb;þ.tñ¥Xbñ¥Xbñ¥Xbñ¥Xb:·.ñ¥Xb»VŒÔñ¥Xb:Ã\è<Wñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb“J;R$zñ¥Xb;„í½ñ¥Xbñ¥Xb;¥û½ºÉ;»4Ô»;,Xwñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;˜Â;š4<4§»Ä“ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<[!Âñ¥Xb»ñßúñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<»Øñ¥Xbñ¥Xbñ¥Xb<7uÁñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼qé¨ñ¥Xbñ¥Xbºß å»OÁ‘ñ¥Xb»¡Y‹:„¹¼»E‚仃hú¼TFz¼ ýX¼Óï–¼¾Gê¼rK¼¦7纔.,¼wj¬¼˜Hªñ¥Xbñ¥Xbº-iü¼„м;¢>¼gd»ïƒ»Žm¹€é/¼îü¼£§:"Sñ¥Xbñ¥Xb»Â’O»¼„A»¶'[¼ƒuñ¥Xb»Îùcñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼N^$ñ¥Xb»WË¥ñ¥Xb¼T»­–äñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼–f¦ñ¥Xb:§F:·Ühñ¥Xbñ¥Xb¼`‰29Ò`ñ¥Xb¼6Ÿ=¼K˜¼x¼\ȼMV ¼"Áƒ¼Žpþ¼Še«¼•L»Ó Øñ¥Xb<&ã"ñ¥Xb¼>M¼R`Á;„9̹¦ˆu¼K »ï˜ñ¥Xb<‘jñ¥Xbñ¥Xb¼KE¼•í.;¶Ý‡¼+íñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼@¾O»Æ瀼[R»ORñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»V©Dñ¥XbºC­»ºþýVñ¥Xbñ¥Xb»½ Wñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ƒt:Üþ¼¾6ð¼ãÙ»Äק¼Æ%å¼.;?ŠN»—,¢»¯{†¼¶.¼?»¹}(;>_d¼S ¨¼<ëçñ¥Xbñ¥Xb;mºÊñ¥Xbñ¥Xb:¶ ­¼UÇ ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼žGŒ¼"ù>¼Hsyñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼Mkñ¼*³Àñ¥Xbñ¥Xb¼…–»]ä¼?¼»®6¼ ±Ý¼‚Væ»…º6ÞÏ»‘¸»äµÔñ¥Xbñ¥Xb¼!Çñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»™¼ˆ8Šñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;~Ç;;¼äýñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼o?ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Äù¤ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>QOñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>gŒsñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ð)ïñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb= dÀ>![Ñ=ÛÈñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>íî=‚C ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½g ã;2º‘½9·ñ¥Xb½@h½Ñ¯Òñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<"¸»cHCñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>u = N`=cùN=¨‚>8ÚDñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=­†a=š¶¬=((ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ó¢x=g ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=¦ñ¥Xbñ¥Xbñ¥Xb½ŒÀÖ½®Hî=¿Ú=º0ý=®>ûñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=À¾Ç=ÊAk=À!ºõÈg=Àôñ¥Xbñ¥Xbñ¥Xbñ¥Xb;\£ˆ=²Ôùñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=µ’Á<¢º<ôH"<Àž¶ñ¥Xb>$)E=º @ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ÌOd=Ëw㼟"ã<’žØ=rqžñ¥Xbñ¥Xbñ¥Xb='5É=À¡ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=uUºñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=zH=jñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¨¹ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<«Q=àF½=£+±<ŽQÊ=¹Äñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½n³ñ¥Xbñ¥Xb½=z‚ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=(P}=Úm=È´yñ¥Xb=±BF>U‰Gñ¥Xbñ¥Xbñ¥Xb=¤¿=™}>³=55'½,1î<^j~=ËCñ¥Xb<ïŸD=Xš½<¿åñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Ú´ïñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<(Xñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<ï5ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºÞñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb9¿àÓ<Ï6º~¢âñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Ž?6<±è|ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<`f“;‰¾¸æÀ#ñ¥XbºAoa<86ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb; È`;°P&ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;§%ý<;v$»?˜•;ûM;¾h¦ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbº ÑÒk;€;v‘Ð<£h:é„«ñ¥Xb:àg¹:pe;ßÃ|ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ÜCñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<Í«ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<)]³ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<|Ýãñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb< ¬Î<\Bg<]Íñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<]Þ:C¸~ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ÒîH¼¡=;6®Rñ¥Xb¼´#¾¼Š8žñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»Lpï5g=½£ñ¥Xbñ¥Xbñ¥Xb½7Á$( ñ¥Xbñ¥Xb=²Ð>¨–=±ú> ›ñ¥XbC>-Z«ñ¥Xbñ¥Xbñ¥Xb=`%añ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ìÒt= •½7èñ¥Xb¼9¢Ý¼vZ¼!Ñ`¼Ä±ñ¥Xb>3ª=̉‚= tŒ<Û/뽄››½ä¾q¼ü¿È½±î¾ Ƚk½ø´´ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=7B½¼Ð½4wiñ¥Xb=šì­>&j‰=Ϥß=fG= „=æšl> ¹=ì°l=øï+<ýQlñ¥Xbñ¥Xb<€tH½Œjñ¥Xbñ¥Xbñ¥Xbñ¥Xb»¬$ ½‚+󽡨¥½šçß<É‹Ùñ¥Xbñ¥Xb½n2";`ì×ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=—9ë>9=÷2­=°wÌ=mUvñ¥Xb>ý=îV²ñ¥Xb=\¨ =d!f¼yì=1l×¼µäp=+ů=³Gæ=½Ž6=ÅÌñ¥Xb=·ŸQñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>;ð=Ü [=¶!ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ëß¼ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=«ÔÄ;™Ý,<Õ¼d=Dø½oc=,¯µ¼æŸñ¥Xbñ¥Xb=º—ý=J7þ=†$’<])¯¼°¥N9ä5å½±ÎR¾Û†ñ¥Xbñ¥Xb¾, {ñ¥Xbñ¥Xbñ¥Xbñ¥Xb½I2àñ¥Xb=¾ ñ¥Xbñ¥Xb¼ 8¾¼®è<þ›+;Ì1¿=*Ú=¢Ò>ùçñ¥Xb>m8>õÔ="_=\è=ÃÈŸ=ÐW¡¼aK=WWQñ¥Xb=˜®í==š6ñ¥Xbñ¥Xbñ¥Xbñ¥Xb<×cV½ÜX½øp¾*Ú»ábÃñ¥Xbñ¥Xb½Õ´a½GS{ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=õÓ=—c>6¡=<à<g;=ÛP=ÎE(>ï}qÇ=Vîñ¥Xbñ¥Xbñ¥Xb=[„Èñ¥Xb=þ•Bñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=ä‘ =^8=l¬²:Áiþ<ãÊ =8ow=¿Ÿ =Äj;fV5=Zì=>':7=‡[B<¬{p=@Ž7¼þ#é½4½-uŸ¾¢±½jL÷ñ¥Xb½ŽÌY½œ:çñ¥Xbñ¥Xb½• \¼ç±½™”½\°J½o¿¼ƒ£A½Ñ›»ÔgÞ¼¥¦=…i=ÒX¤=ûœô>U’Ýñ¥Xb>y=GKT=ëÈù=‹ëU=è»=Õéò<‚P›=P¢o=8z=œS#=³sý<…>¸ñ¥Xbñ¥Xb=XÀͽe+3½ï8ø½„Ëv¼p½ :ð;…‘¼¢“ịî^=Hé£=Õ€Ç=ƒæ=×yLñ¥Xbñ¥Xbñ¥Xb> €Ãñ¥Xb4Ð>zR·ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb:yªñ¥Xb=ôZ=¦fö<%*ñ¥Xb<ïV8=k¥Þ¼àõñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ò …=ÍÕ=@I<퇜<@5V=Ñ?ô=VLƒ=ª>>®õ=mÞv=AG<”Þx=ߛǼŠ?v½/~ö»¼ ˜½…]Š¾&ñ¥Xbñ¥Xbñ¥Xb½NÎñ¥Xb½Š-Ÿ2v=@¼Û=^FF¼‘×|=3 ¶=ìÉ=ìy£»(ù=³ñ¥Xb=ˆõB¼=‘'> ‰ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<2Gª=»ªèñ¥Xb=R!¤=l:)%Æñ¥Xb<à3ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>j½> Ü>6÷=7GŽ<‡¾<µ‚k=¤œ$<ë±=C­ãñ¥Xb=èûS¼Ü›`¼¥Á<’‘½ i <‚‘5½&þ½Õ×̾Dñ¥Xb<£Ã<¼¾íÁñ¥Xb½Ûù½<²Þ<È~H½/yå½_~±T=9e.ñ¥Xb>*i!=…p»¯Fþ= 0<7F=œÉ=YXj=†Úl=*t==Fñ¥Xbº`C¶=Ccß=b+h¼+9†¼6øñ¥Xbñ¥Xb=>ï=JVØñ¥Xbñ¥Xb;¢÷›<}Øâñ¥Xbñ¥Xb=ç¿Â=³ ñ¥Xb=Gë}<—ug<Œ"®;÷R‚¼îü¼óÀ&=A¯h»$Zš<:u£=<Ò<³ñ¥Xb;Iœ¼gÝ5½],Â=WG×fÅ; Æ=€<$Ø =Å ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb>LE=Ò+U=¼#=‚˜ =•°‹¼ÑwÍñ¥Xb>;„½HÎñ¥Xbñ¥Xb<Ö±nºúkÌ; sWñ¥Xb¼Ò_¡½Ib½IB¾Ñ:½LŠ×ñ¥Xbñ¥Xb=«Ùjñ¥Xbñ¥Xb=‹æ–=¥(==C“=Ê <¨„wû=4Ã>½›=<¶ø<ýýE;÷å̼ãæ=<»½VÀ—¼´Ø¯ñ¥Xb½A“­=/ =ñ¥Xb¼”§¼Þ ;:´f=¯»ñ¥Xb=ƒ ¯ñ¥Xb»Þl<ç›Ù<ï –½„»'ø<ÒfÙ;÷/j=¥õ(;ÌL =j“º{T=d¸´¼Ý‘½´ÞM½c€Ó=zã…=!°½ñ¥Xbñ¥Xbñ¥Xb¼­~\ñ¥Xb=nìñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥XbºÒÚš;!6.ºù3[»ÛV»¿Ù仑¼4NC¼ZÛ©;—½éºfòå:~’Æ;Àèt;À€»WHè¼ Ñ;’ÍÏñ¥Xbñ¥Xbñ¥Xb;N¿»YÊŠ9îŸX;ú„Šºï ;Šmˆñ¥Xb<%ëv;ÅQ—»Ù>mñ¥Xb<`:?ñ¥Xbñ¥Xb;ÜÝ;Ñ~zñ¥Xb<1ÙŽ:é<‹ä’<ݵ;‘2Ã<mñ¥Xb<¡-Añ¥Xb<(?'<«^7<†­;Æoøñ¥Xb»Q6Ïñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Ò*'<¾+ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;¬ZŽ<Ý+»¸G'ñ¥Xbñ¥Xbñ¥Xb<w>ñ¥Xb;®ùñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼Ò°:ä&_;öêkº'¬ï;\êØ:ˆ¨;{ö¿»~’» Ã;»ƒ4G;£¼»ºø®Ô:‹~hñ¥Xb»gÕH;¢ëöºƒ<ñ¥Xb¼ƒ¾Š;o"»ú“|ºˆX};Å8»÷XP¼«xñ¥Xb;–ä¼Ýòñ¥Xb»ŒÖμš7¼Z%»Å¹»sõñ¥Xb¼ `ºÅ溹øßɺï/}»×Ø—¼=X_» Cé¼H¤:güÜ»ü±ÿñ¥Xb»ý‘{»9Ð<~áµ;M<:!P[ñ¥Xbñ¥XbºÎ÷ð<>Äßñ¥Xbñ¥XbÝñ¥Xb;eçƒ;/E±¼Hø<^n;§ÁMñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;’½";]Ëà» ;»7À;†´»´R\ñ¥Xb;D§Ý;*[œñ¥Xbñ¥Xb<4;ûï¬:™<.Á]ñ¥Xb<*׆ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Žõh;š2}¼E}1ñ¥Xbñ¥Xbñ¥Xbñ¥Xbºãñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ ¥ó¼XO¼^´»IÆ»³ž¼,,¼J (ñ¥Xbñ¥Xb»–)³¼Úo»†F;Æu¼!§Ž¼Ó„¼ Œ¼:Þx,ñ¥Xbñ¥Xb:Œµõñ¥Xbñ¥Xbñ¥Xbñ¥Xb;1ñ¥Xb;ó+àñ¥Xbñ¥Xb;Ø‹ß:·»ÍÙí»Àìñ¥Xb»úˆÜ¼>†ºB«Š¼O-9¥Ë­¼#’»ˆ‹Îñ¥XbºIè}ñ¥Xbñ¥Xb»Êñ¥Xbñ¥Xbñ¥Xb»öŸk<s»ñ¥Xb<™Þ¾<^9<„êÿ<2ô<¬;ö¡P<D\<„ïp<3á;Ü2K<:zK<7¿ô¼ ©u<&i?;ºI_Añ¥Xb<«M¢<<ð[<·;»<[„^<ry<J;þl; ZÁ¦< è;Î¥²;jƒŒ»"Ûs;*ñ¥Xbñ¥Xbñ¥Xb;Èãñ¥Xb;ëÙöñ¥Xb</ã<ª=€¿<ŠtÛ<)è7ºO¼c“W»â*òºÈ*;ñ¥Xbñ¥Xbñ¥Xb:†QBñ¥Xb;Òy;‰mÒ;ÃEºiÕ:<(ó<DÚ<fÒ;/4»¡Ìå<€ò'¸q9<ïC±;ô+pñ¥Xb<<â`ñ¥Xb<¹Ý;âTì»2µU1ÙÝñ¥Xb=ôø=c´@=P£²¼…¨<œV/ñ¥Xb½¯[=EG=ÄOß=®_/=·=€| ½–»õ’<ðxº¼ îͽšª<1Ú½13ù»Õýr»æú½œøU;è˼¶]®<ü:‘=€Q4ñ¥Xbñ¥Xb<9=!bß½Žƒ):º¥[ñ¥Xb<´áàñ¥Xb=.ϼ YR=Ü&4=! <<ü³D< ®a¼v¼Ú½ÕìR¼£<˜ñ¥Xb=¢œ:ñ¥Xbñ¥Xb½Ñ=]´¨ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<´Y×ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb(¹·=ݦ1=ÚÈŒñ¥Xb=ÀSb<þq‹=zc†ñ¥Xbñ¥Xb¼êáD»±Ï½á–ñ¥Xb½ #g½*hͽŸÎ¨;ì7ªñ¥Xbñ¥Xbñ¥Xbñ¥Xb½÷­†½”ýú½´O½Â¥ ½ ½˜Q= Œ£ñ¥Xb=ËN<úDŒ>µX=Ê|=lsŽ> Ññ¥Xbñ¥Xb=³Eã^&™>ñ¥Xbñ¥Xb=ëUâ<Ì œ=ƒ¦=´c=x†=¯'8=ç$> ®Û=bOË=u‚ñ¥Xb=3ü…ñ¥Xb½”ƒ°ñ¥Xb½a:9½$²Ã½ß‚½*¹´½>K2ñ¥Xb»J¨‘ñ¥Xb½Ô†»½æN½ò|M½æòϾÿ½ðà'<<@ã¼ùÛ/ñ¥Xb=–çL=èöV=§Ôú>G!=­zÞ=à˜=£×Õñ¥Xbñ¥Xb=€ô!=Íäw<ÿ œñ¥Xb³‹½ þŽ½…Á½´™<Ëš‡<;-!½M8½Æi =†?©<…çB=í=yé ñ¥Xb=!‘ò;Át1ñ¥Xbñ¥Xb=“œN=›Ü„ñ¥Xb:ˆ‰›ñ¥Xb=¡%ç>ܽ½9¿=›~=Œaàñ¥Xb¾ hݽ•bÓ=‚˜-¼¢÷÷=3=fò©=Gcp<”J¾¼\㘽oRÄñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<=Å£;½ÆRÌñ¥Xb½“L½¸ˆ¤ñ¥Xbñ¥Xbñ¥Xbñ¥Xb½µÿÿ½ËA¾|{;VHÿ½Ÿ·K¼§êܽ§"{ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=G£…<Õç¡=W0=;…Â=óQK=ækX>8˜ä=eûi»¿Í—=µÖñ¥Xb=ÃMý=¢Kó=„Q=j°÷>%gÿñ¥Xb=i9c<™\^=Øê¼õ¶¼‡v¼½'Îhñ¥Xbñ¥Xb¼aÔä;ßKñ¥Xb<0ôº½az›½,\½³s·¾ü`½š ½Ce½áÒ†½õ-¼ÿ]Ú¼”t¼;Èo÷=¢Ÿ#=èÕ0=™YÃ=á~»= žÖ==þ!=<\ ½'²ñ¥Xbñ¥Xb=Ž–”ºØrñ¥Xbñ¥Xb¼sù.¼øoó=^ÉË< 9Ú @=| <Ÿå²<Ø.н‡ ⻀íÇ1Ä;йñ¥Xbñ¥Xb½ŸYÀ½šƒx½?Q%=Ië¿=“2={l*<ÇË`= †j¼· j½‰`Ëñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Q?i=Þšh½›\ö½CCÞ½·¢ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb½Kê)½ Ix½–ª$¾Úǽ]Qg¼0ö¼‚4 ñ¥Xb<—4Ü=î—‘ñ¥Xb=Nš<«zÿ=W>N=…Á½ñ¥Xbñ¥Xb=³ÚÙ<ÝÜ¡=Ð'Âñ¥Xb< J³=9¬=î¦ =X^>)LÀ> VLñ¥Xb;ü¬=€šd=u«:«`Ï=L'=špñ¥Xb½èK¼½³Òñ¥Xbñ¥Xb%­†=ƒÈñ¥Xb=¿ƒ=JM½YpÌ='ù4<Ú:ñ¥Xbñ¥Xb¼àÑû½;­ñ¥Xbñ¥Xb½b#ðñ¥Xb<ª @<Óœ=ºÐP“7½f›½Öà ½çk<û~.ñ¥Xb½ ËØ=´÷b=£Ÿ|ñ¥Xbñ¥Xb9Â>(¼6˜ =Öák=<¢<ñ¥Xb=“†ø=úåo=9¥¨=ò™Oñ¥Xb½O«²=ÿ=Sìñ¥Xb=£·ë=ì<7û=€$U<"‡7»¡©$=›Ð=ÚK= XÜñ¥Xb=çæñ¥Xb=ªÝ⺫¥]½øŽ<“¼k=¸ @= šA=¨;ñ¥Xbºº†;ñ¥Xb>#¢ñ¥Xbñ¥Xb>Ö$=^Q=œ•(=i×=å%=Ù"è<¿¶E=bˆ¨ñ¥Xb¼Ü"½d„Ϲ…c0=a=©;¨(`¼©ÏL»-ÿG½ÊTg¼Ðä{½aºª½2Ê⽗oyñ¥Xb¼vß=eXñ¥Xbñ¥Xb>ßÛñ¥Xb=€$Ç=‹m[=¢ÈÙ<µîâ»ÏH¤;•ÂÕ=!2W½–¼ø&j=Tæ§=¶Ñ(<ëµ/=ö°=Ûܪ=º>=Eæ >ÿl=¿3p:Îg~<ûïcñ¥Xb<~)ñ¥Xbñ¥Xb½b!ͽ«o-½¨‡=dƨ=ªoo=§®Ã> =ƒP¹¼©`=„Ï CŽ>1v=ò=gá>L\=ÚƒÄ=žl>×ìñ¥Xb=Ž._<( i=-7Rñ¥Xb½Õüñ¥Xbñ¥Xb¼Ýd×½® fñ¥Xb½‚Q½½¢=ˆ°I¼àX>= Úñ¥Xb<Ücý=»Úñ<6|Ê=QèÐ=-°7=î^¼¹]³¼šÆ;Üg<ÝßÄ<˜tR<Ì o=Atß<á‚Û>#­H=÷c =˜'á=ß™="?pñ¥Xb=Í|H¼¬¯Y<ê5A½¡Ì(¼‰ñ¥Xbñ¥Xb½·D`ñ¥Xb=›èz=Ä-°=”=$=’Ž?=›ôËñ¥XbºÕs¤=¨DË<ûj½=þ=• =Z)˜ñ¥Xb<Ùóñ¥Xbñ¥Xbñ¥Xbñ¥Xb=°ÔŒ<ø5„¼ìäí½˜'ܽëv½ð&ª½ s½îÆï¾oݽžX;þH¼¢1¢¼»KZ¼,Æ–=„ª=K‹lñ¥Xbñ¥Xbñ¥Xb:ÄF’:îšñ¥Xb;Ú¬ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»E²ñ¥Xbñ¥Xb;Ã.Ê:¡6a»P‹k»#Äñ¥Xb»- ·;™­Eñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbº¿ññ¥Xb9Yô´»~Íxñ¥Xbñ¥Xbº¤lë»Îõ£;²=Žñ¥Xb¸‹¥—:î]1ñ¥Xbñ¥Xb»¾*ÿ»ØI»Ú†»Ùvñ¥Xbñ¥Xb¶)àñ¥Xbñ¥Xb;aÏ’»?‘ñ¥Xb¼¤Ñ€;svŸ¼m{Ã;`q¤; ÒÙ;·Ö¼BP)ñ¥Xb¼]êc»“üÎñ¥Xb»<7¼M¤¼Y”a;ÒØ1¼#P­ñ¥Xb¼&â»F&“¼ &,¼-žÔ¼CK¡:¤Ï»´Êß;×iÁ:“Bÿ»\q»¦Ó–ºNpêí»’f»`¶º™f²ñ¥Xb» ø;0‚Z»™½é9¨(¼:÷XÑñ¥Xbñ¥Xb¼ ¯é:3W»ï¯M¼ mY<_Åmñ¥Xbñ¥Xbñ¥Xbñ¥Xb;Ó»2»‹Ä~ºäª‚ñ¥Xb;‘SGñ¥Xbô;c¯Æñ¥Xb»rañ¥Xb¼fIñ¥Xbñ¥Xb¼¤„gº¾^"»«MÕ;ÐMéºd°b“<Rñ¥Xb:çfcñ¥Xbñ¥Xb:sÕ;Uìñ¥Xb¹k‹ŒºÑîþ;qh:ÍʸºHñ¥Xb¼wTz;q¢»É®»{úy¼›o(»ƒëŠ;Vö1»Œ¨/;Cû¨:ÙH†¼ :g:rÔ¼L,л™».¹>¼!3y9¦ö†»©®Ö;ã9ñ¥Xbº›"©¼_¿'»ìMN»héºìþ ñ¥Xbñ¥Xb»Ö5Øñ¥Xb» IÕ<³–;°Gö<&ð;#›ñ¥Xb–Ì:ž…¿<Ä”<.c¡;| <+ÈÂ<’@}ºº¸m<…8ƒ<9ºì;'À;œ˜‘;亱»“K¼Äɼ|‰3ñ¥Xbñ¥Xbñ¥Xb;à—i»ùlfñ¥Xb6:xƒ»É¥ñ¥Xbñ¥Xb:‘Cƒñ¥Xb;o›< ^o;Ç„½»1êñ¥Xb;˜p)< ’Å<;S» lñ¥Xb9ÃM‡<w¾<`èÿ»ƒâ;ÞaÏÇ»Â`D»†tñ¥Xbñ¥Xbñ¥Xbñ¥XbºÎ;…ŸB<<±{ñ¥Xb;Ó›ñ¥Xb:í7†<o•»µ ;´L¢ñ¥Xbºó4Æñ¥Xbñ¥Xb8`)c»È1lñ¥Xbx>y=W/º=Ä =ϨG>a®=ùR>)õrñ¥Xbñ¥Xb¼¿L^ñ¥Xbñ¥Xb¼Ád…ñ¥Xb= ±?½@Q’:÷Qï=£%;y=/c= õÉ=–mñ=—î=&ˆš=[h¯=q×J=…oX½f±»Éš¼]Ú=£F+½,]Ö=B±ý=hÖ=oÖ=’„> 9=¤Ý=[;—=]•=(œºñ¥Xb<΃ìñ¥Xb=oⰼϬþ½›gñ¥Xb¾ç½â²¼ó‡!=¯]-9º=¯M$=5óJ½hü:1=¯=¤ñ¥Xbñ¥Xbñ¥Xb<ج<ö§Ê=C Q½‚FĽ•Ð̽¶¡½‚Á½Ê‡X½Ñz¡½Ã¼½Ã&ù¼­Šr¼ìš==¼ó»ö9»×(£<ŠËñ¥Xb=.*ñ¥Xbñ¥Xbñ¥Xbñ¥Xb½Y³½'ÆB½9ñ¼W»x½ My½8Hš½§v¾x?½©º ñ¥Xbñ¥Xb½³çg½j²Ö<›å½F0×<\Ié½›ýª»Ê\\ñ¥Xbñ¥Xb½Ð¼´ J¼N­ïñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb<ô+=ç7$ñ¥Xbñ¥Xb=V7=9ɳ=J ½>†üñ¥Xb=Iñ¥Xb> íÖ> î>0ƒ‹ñ¥Xb<öOª¼Ôç$ñ¥Xb½†v÷½sFôñ¥Xb½†**;à=¤Ès= ~¥<@¶r= 0­=Ý–‰=39`<—¼0=}‘>Á„=?·(½µÈ»RIÕ=ö=LŨ=Çh=^^Ö=¾A=Œî$='£²<ô(o=–zs=‚œ½=Ôþ=ñ¥Xb;%Ïóñ¥Xbñ¥Xb¼!â’;óñ¥Xb½Ü3/¾@óh¼ úø¼ÞØœñ¥Xb=u9{=í€U fÕ>7ÁÂñ¥Xbñ¥Xbñ¥Xb> "(=ÏÕ=¤*=Ø%¼“‹‰<ßN¼šˆ½¼ñjp½f…ǽþn½QÌ4ñ¥Xb½q÷=Sp¦¼BûƼk¦=¥_É<ØFïñ¥Xb=z÷=“!`=Öa¤ñ¥Xb¹¼N…<›•Á=Ž'¥=hZ=¾ yñ¥Xb=H£%¼nbž»žö;½‹ê¡=]®qñ¥Xb<ÈÕ_ñ¥Xbñ¥Xb>t=62½ñ¥Xbñ¥Xb¾ Z ½º§=C†’ñ¥Xb» ™è=Îë=Á5B=¢xà<·œñ¥Xb=ò—»/¼)¥;=°X@=•í=¯„Â=%í<`8ð<-Àù½᪽Ä'¼˜¯6<ƒ‹¼ è`½ .½,‹÷½V˜¼2üf.Þ>0L?=B%ñ¥Xb¼áà<åÄ0<9½i<²ñ¥Xb¼ƒûj¾滽µ`{½*"®½)™±¼tPO=›{=l§ñ¥Xbñ¥Xb=tð=Á¤†<ôgÀ=”ÿn½;÷Wñ¥Xb<—€Ç=³Ô=ðEñ¥Xbñ¥Xb©>tÓ<;Ý ß!ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=[Õzñ¥Xb½m'×=s%ñ¥Xb=«{=2 :¼èL¹»kbº=ˆÌÖñ¥Xbñ¥Xb=ÈðH>7“ì=¦®½ÞÙ¼¶sí½(6=9Óôñ¥Xb½7Õ<•€ª½"eN½ÁZŽ;*ùb;ì-t¼oÇÃ> ½<ü5=­«äñ¥Xb;Ý&2<­Ó=z=¼ž‰>ÿ=ËÕ0=W¸=$=79y=åÂœ=ÉRª=b¯ñ¥Xb<‰êr=Ž^ì¼øæ$½g¯½Aµ;Ñê¼`üмqÚb<ša¼¼æƒ=®ž[=r÷\<‘ž=Š»ÏY=€R?=mˆ=‹î´¼rVÏñ¥Xb¼iðì<óþ½0=´¸=œÇÁ=$á·=]lï=„ñ¥Xb=}’–½§Áñ¥Xb½mŽ•ñ¥Xbñ¥Xbñ¥Xb=ïk_> ý=m)î<¦Îc= é ;{¯©=¾H=°ê[;MC¢=Å»ñ¥Xb<ú´>½V€oñ¥Xb½‹e¾ñ¥Xb½ 8ñ¥Xbñ¥Xb¼èÑÕ¼‚?<™¡;Á5¼ñ¥Xb=[ê¿=*YW=·3`ñ¥Xbñ¥Xb=‹ûʺ»4ì=™<Îb|<¬U=( ‰ñ¥Xb=%¶Ý=|/Œ:‚£Ó½ç‘\½‰æZ¼4Ò½ uL½¹tñ¥Xb¼¢±K¼–ç<¼,½ß´ñ¥Xbñ¥Xb½_9<'×€½e9ê½Çqx½>ØŸ½™Éñ¥Xb=&Ï =Xt×½G+’<¸ÝO¼»Ã6º"„Ùñ¥Xb=˜â=>êsñ¥Xbñ¥Xb=–1j<I½„‹¶ñ¥Xbñ¥Xb=“D½H :<5f ;² N<Žº={››;ðÇ)¼Å]=(³¼³‘ô:@½·»Ù]½=.‡½Ý®½kz„½T/Õ¼sdC½Íñ¥Xb¼Ôh?=RØPñ¥Xb<¾ìY»Ön;îÉñ¥Xb=wš ñ¥Xbñ¥Xbñ¥Xb=(Ī<‚úÿ<ÐŒ§<ñ¥Xbñ¥Xbñ¥Xb½owc½%c<ëˆ=¹.U=]µ›<òf=+š=m«Œ=I¼Ôbâ¼êÍR½Êж½›ëñ¥Xbñ¥Xbñ¥Xb=N>>‡e=ؼý€Ð=œ»’:Ý ÄW=f Ì=£JÆ=…•-<¨Óö<òƒ¥=UÒ$=âI4»•”»½ªLë½×A1ñ¥Xb¼ìY¼º¨<™Ì~=F.ü¼„ʽC/F½y„çñ¥Xb½µª<Ì +¼ýo¼ÀÛ½Jû™½­L¼ñ¥Xbñ¥Xb<¿R‰=Cbn=é·Â=‹É> -›=¹„=Å5¢='ƒ“=gBñ¥Xbñ¥Xbñ¥Xb=kšn¼"ÂÎ< BDñ¥Xb½8N.<€Àe¼£š¼wÁ<1Ç‹¼"<&½Eòñ¥Xb¼ îñ; TÄ=°à£=ka½©ãþ@¾§›¼ìwï¼×«‰½²/Uñ¥Xbñ¥Xb¼Õ /ñ¥Xb¼§+Œ»Ár­= ƒE=tü<=þ5<}ñ¥Xb½fÕ=ÉËI»¢o²¼¹Añ¥Xbñ¥Xbñ¥Xb<‘g|½ÃN=Ÿß=@ô5=¹­£»œ·¼¸hź”‚m<û«ñ¥Xb;S ñ¥Xbñ¥Xb;¡¿r¹þ’;ˆÇ:¹cÐ;»·~;ªh¶;ká›;V'ñ¥Xb;ÑBù;¿?¼bXdñ¥Xbñ¥Xb»æ+ñ¥Xb;ô$;š[Öñ¥Xbñ¥Xbñ¥Xb:j5»‘=mñ¥Xb;Ÿ°ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»ízb;›º¼g "ñ¥Xb;¢j <¡˜«¼:Éô;­Qf;òpLñ¥Xbñ¥Xbñ¥Xb<€X¼[Œùº§Z˜ºË0¸»,:3<¦è;+tâ»ê4™»;‰¼¼ ´j¼KX-ñ¥Xb;)À†»¯»œ;±1¼•º ûQñ¥XbºuÐ}»¦R`º“\2ñ¥Xb»¦{»ù›¼Ô=`»Œ7¼\W»Ë¸Õñ¥Xb»ž©|º°Aλ®ÝÒ»Þ“ÿ;JŽñ¥Xb¼‘‡Bñ¥Xbñ¥Xb¼U»*ñ¥Xbñ¥XbºÂº§;ƒ}<žñ¥Xb;ÿs;óÉ< ¬<2> åøñ¥Xb»ÏÃ1¼DQÏ»ïðC¼6è~»‡á»~I;ŠÚH;š.Òñ¥XbºÂÛ*ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb</!º‘“ñ¥Xb;=lÜ»~Ây·ºLž: N.¼ ;p»Xâ<jŒ;g.a;UŸñ¥Xbñ¥Xbºu>õñ¥Xbñ¥Xb< =ñ¥Xb< Ç1º,K ñ¥Xbñ¥Xb»ùrºõ‹Î9‹Zíñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»³šºÂÑrñ¥Xbñ¥Xb9‹&ð<2i;u¼G¾ñ¥Xb»œŠïñ¥XbºÖ_<&í;;‚Ýoñ¥Xb»:ô¹L!ñ¥Xb;g@!<Â2ñ¥Xb»]nV;áäy;°­_<à%»Rw˜<³Ãñ¥Xbñ¥Xb;»g)Ï<(,±:3‘R¹¢Èœ»|K”»<-uÕñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;:T÷ñ¥Xbñ¥Xbñ¥Xbñ¥Xb:³™ºô2°:=¨Ü;‰æÛ:R¾œñ¥Xbº†þš9•¹“ç<:³C<ªª&<)>±lÉ<;rG:ÔÀñ¥Xb;〖º÷uK<_á0<ËÎ;Óøü¼­<ôݼ[b<˜Ø:BÓ¤< ÝÝ:PÞJñ¥Xb»šB¼ D໬0ã<;×»‡‰ñ;Ù´ñ¥Xb9¤ùµ»W–wºÊ²Z8ôO绕`S:­Óñ¥Xbñ¥Xbº@%Š»\u§ºªm­;lù;¦âK;í[ß»oö’;z;<"Æzñ¥Xbñ¥Xbñ¥Xb»ŸØ(<5ðE¼¨T»Ÿ&«ñ¥Xb;S#»ÌÔM»œ!J» ^õ<êz;8‹àñ¥Xb»KûHºàô„8˜gc;àŸ—:ðÒS<¤%;Çñ;ß <T ›ñ¥Xbñ¥Xb;TŒ¯=”HŸ={骼s®ñ¥Xbñ¥Xb íu=3”C=±1:³³=úY¢ñ¥Xbñ¥Xbñ¥Xb=¢e©ñ¥Xb½#ª»Ï1[½‹A¼¨n¿<Öëî½ø¼CßÚ=×;ªdú=*C*ñ¥Xb¼Qõ<ÁŠ<<²½ ¾âP½¨~¥¾(çû½ÚX3¼ “Ò½4ªñ¥Xb¼b«ñ¥Xbñ¥Xb½LÙA½KÔ(<¬=»c”ù=ïJ¤=¬“=È5e=¢ì¬<!f=iò–ñ¥Xbñ¥Xb»öO¸½u6w¼J4Ó=…TY=Oàå<³õÖ<Òà\;b§[¼8ò;‡T¼ŠbÍ=`T>¼Ô®á½>€ñ¥Xb¼%£@<e_¼~ûá=½fm½¬µ¸»Ú‘ÊÑ>öŽñ¥Xb>™ð>Q“=5¯<â^=$/ðñ¥Xb¼¹È<üÄ“=¦÷Ò<ùV¥¼ŽƒRñ¥Xb<ŸÆõ ~ñ¥Xbñ¥Xb<ãLñ¥Xbñ¥Xb=Kòþ½x|ñ¥Xbñ¥Xb:•§½\XP½Ûêñ½&yj¼gcô¼ ˜ª¼™Þ¼ë¦Ü½Z¬S»[˜µ¼Ús½×…k¾#b#½Ë û¼­á¼¬”†½µ\ž½ÀÈï¼mZ½¨Uؽ<"¼·²Ï»à.T=Š\<LJ‰=Ï=³ì=I’%»§FÂñ¥Xb=” <첇={’ñ¥Xbñ¥Xb=|–f=>~½sÿ¼Ÿ= !´ñ¥Xb¼§×¾½=;»Z0¼¤Ð›<±Óñ¥Xbñ¥Xb½mÕ=mÆÂñ¥Xb=§;/§½ ,`;³f½ŠoÓ½ypx<.u½„ó‹¼±|×;´P•:Ì9®:ïBñ¥Xb<˜½=€’õ=Í9Ã=ÛÐk=1àë=Çd×ñ¥Xbñ¥Xbñ¥Xbñ¥Xb=€uÍ=Mo<‘D§½å.¼Õâ$=¸õ¼k¿óñ¥Xb<ßâ½ ÷;ŽíŠ½ †m¼® 9<«3ܼŸ^Ž=ƒ/é=O»ÿ<¿d¬¼ÁŠ_=Ô_ ñ¥Xb¼Ú>Ƽ©vS<Õ€=;0½Rÿµ=ß-=§ÎC=€Èq=ƒ¼¢=Ø%={E=|ˆ‹ñ¥Xb:òù=ù=>ø-<ð—<ƒu;‰Oôñ¥Xbñ¥Xb½“²½ÆW½³•ñ¥Xb½£þÒ½’|q= [ø½ ½ø½Jв<’T‡½TTA½‘X½ÕÌÚ½##½RO);Gž½Æ©¼Ûˆ½Ÿ›½P¿«½aƒ=Å7=:ñ¥Xb=4sØ=੽r:Î=´•Iñ¥Xb<îew=ã–A=¥Š­ñ¥Xbñ¥Xbñ¥Xb=·B½('ñ¥Xbº;æ.¼ð™jñ¥Xb<]9·½xæñ¥Xbñ¥Xbñ¥Xbñ¥Xb½Ž]Ò=aûºãqã=‘–g=–-ʼ¦¼Ÿð½3¼KБ<§ÙÔ¼†p¡½Ÿ×½t†q¼¡ª¼‚lñ¥Xb==ÅW=ƒó^=Ž 7=ÛPé=ƒbf>G 7>$ú =È|Áñ¥Xb=® <Ý•p<§s­½ ʽ7/`¼Á— ¼W ½fñ¥Xb½9T½™Sõ½˜»½= vñ¥Xb=VÈ—<ë%Êñ¥Xb ªx=´g>C¼îlì=¢Çe=c)(;YtX>óé½>x½°µµ<÷ûM<7qº=Bæ½îÍñ¥Xb=½½‘¼»Õ}~¼v.ñ¥Xb½•s¼½8Þú½Aä<^MQ»ékºb6®¼MB½*·½Êvó½…„½ñ¼þá½"3t<_ ;¦o#:‡]o=ëÌ$=©‘l=ÍÞ`=pjþ>?Û=®aE=xT˜<àP˜½ì\ñ¥Xb=—‚Åñ¥Xb<»ûoäZ>ÙÀñ¥Xb>zâ=÷p•=…œß¼ëÝX¼ Œ»£°B<‘¯Ýñ¥Xb¼ðçxñ¥Xb½©ÃÁ½_ j:¡§>ñ¥Xb;„` ¼n}tñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb=Ah=…‹Æ<ïìã<ëfG=¦‰÷=ß·Ö=ÆA­<„™=¦ÑF=Ó]“ñ¥Xbñ¥Xb½>̼¼*;ª™9<¨Œ <™´(½ÇZh<¨“î¼¾*„ñ¥Xb¼Èï)¼í/½4 ½7™ ½Œ°¼%oc½<„p½Ÿ+åñ¥Xbñ¥Xbñ¥Xb½´¤½àÕž½ˆRùº65Y< ¬<¹Ð?=­‘»¼nCÕMñ¥Xbñ¥Xb=bÝ…=h@™=¤$¢=¢3ñ¥Xbñ¥Xb<{HÓ;L¢&=îJñ¥Xbñ¥Xbñ¥Xb=m ;iÉ =WÛ½^þ ½ãññ¥Xbñ¥Xb½µö¬ñ¥Xbñ¥Xb:Aòí;»Â¯ñ¥Xb½Ä9#½3klDÉ=ŸÏ½•Ï=Qi¯<{tõñ¥Xb<™;=yÌ:ñ¥Xbñ¥Xb=YZÁñ¥Xbñ¥Xb¼© »ãO`<îÄñ¥Xb=+Bm=œÓ)¼°lV=©!r=o@¯¼áµÅ¼ŸÌûñ¥Xb½%û<‘s=¬ó<ÅÞ½0ƒUñ¥Xb=„Òæ;Ä=¤ñ¥Xbñ¥Xb»¦SD½ú+8^®.ñ¥Xb½’!¼š¬=SÏ$½»G=CY*=%¹ ñ¥Xb=&g~<ýæÑñ¥Xbñ¥Xb>™Y> @>º2>Û©=W% ½? ª<±kÙ¼žZ㽓êR¾($ñ¥Xbñ¥Xb½¤>ññ¥Xb=òß<‹íñ¥Xbñ¥Xbñ¥Xb=Ãf…>#k=‚v/=(xL>û¡>D…À=Û6Ý=!tD½%Ư½ÌýŠܾ‹¾8»¢ñ¥Xbñ¥Xb¼©m•=I.=ÕJœ=†±ñ¥Xb<™„cñ¥Xb=W¼»ñ¥Xb=Š>=†Õù=•Q]="ö^ñ¥Xb=³(>å=ÕÂO=¸C¨=Rßo¼®ß ½BÃ\½ß½kÔ»V >ñ¥Xb<Ä<󩊽T›½½Ó½¼e^‰¼dÌñ¥Xb½3K¦½Zœ½Œ¾`¼+€=Í€;cy›½iÎê=Æ ='xb=Ɇ3ñ¥Xb<Èã½àñ¥Xb=?wN;ÕÊœ=\™·ñ¥Xb<´¨>º’=P+½;Ð6<×`<»ÿ¾õh¾óz¾;tª¾ùNñ¥Xb½KJK<ç`Ï=€ö=²dñ¥Xbñ¥Xb¼vëõ9‹y{ñ¥Xb¼.í^ñ¥Xbñ¥Xb»€u9;˜ »±ß»é ¼4m»7,ù¼X~»Àöâ¼K €¼Mð» Fôñ¥Xbñ¥Xb»€³†¼§_¼„"¼TéØ»´I]»e*ü»ž÷N»ùGC:¾ªæ»³ŠÎº³jf¼/Õ|:^ÿµ<Ÿñ¥Xb»kU¼<&7q;¿/ó<µÿ <€uW;‰²Ü<6r»< µÆñ¥Xbñ¥Xb< u½ýº×Aà»’p·»¤­›¹¶ª:˜ˆ;‰¢°;Á`’:hŸ:›&;A„«¼ÙX»­@@»gA÷:óûÕ¼ˆý¯»›D»;´×9§¶Eñ¥Xb¼>Öñ¥Xb»öcˆ¼Óͼ¯M»;ñ¦¼ʃ»¤KÅñ¥Xbñ¥Xb¼¹¼‹»úÃY»¨s·¾Lñ¥Xb;XdÕ;¿'´;oy‰<–ð­<‰Ý‡ñ¥Xbñ¥Xb;pŽl•ñ¥Xb¼?=»òî<ñ¥Xbñ¥Xb¼>'ü»Ì©¸³YØ»¥p¤»Õv9ã¡5¼7«»dóñ¥Xb»Íõ<\zºsœ.»º·Â;… -»’%q»‰¦¥»Æù­ñ¥Xbñ¥Xbñ¥Xb»ç–-»3úºã\ñ;„@¼».êݼ ª ;®XH¼œ§ñ¥Xbñ¥Xb¼ æ@»Å—¼Z?¼2[ž¼x e¼-»¬»Å¼Þ»›øuñ¥Xbñ¥Xbñ¥Xb¼´òEºnF>¼o°~»Ž£k;š¹†ñ¥Xbñ¥Xbñ¥Xbñ¥Xb;(ÙÊñ¥Xb,ñ¥Xbñ¥Xb;''u;ð;ðñ¥XbÝñ¥Xbñ¥Xb9ì#Êñ¥Xb:6½º€²µñ¥Xbñ¥Xbñ¥Xb»¡ëñ¥Xbñ¥Xb9S59°MÎñ¥Xbñ¥Xb»œŸ;¡ZA;…΀:µG7;tÆ;ê±–;ʘƒñ¥Xb;æl69øŽ×¸©-Æñ¥Xb»•—©:BÂ;1;uå#;k%1ñ¥Xb¼¤œ;šÔí<þ0”<<c<¿-#ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb;‰Ñü;ùèºç;ÃTü9ƒuÿ»“ÒC»5;t„·ðñ¥Xb»Ã}oñ¥Xbñ¥Xbñ¥Xb¼0"Â< ‚;p„ª».ɲÿ™ñ¥Xb»ùp;ÌMÛñ¥Xbñ¥Xb;«ç;Ī-ºSWÿ»4ìä:Ã×g¼¦Óñ¥Xb»Œ¢¸;¶ô­¼÷˜ñ¥Xb<\¥_ñ¥Xb;E‰:ˆ9§;óh;U;‚z¡»êÀGñ¥Xbñ¥XbºÙXó»$!¼9²»õ~;JBÑ<“yºBè;F¼ äÊ»£!ø<©Ùñ¥Xb;å,¶¼ 9绫ÕG»g³E¦;ßÂÛ;¿ 6ñ¥Xb9ñ©$;Ṏ:z<l0ñ¥Xbñ¥Xb< cØŠŽ½|àñ¥Xb½ÒÙQ¼Áyl=TAq=³É=w$9<‘¢&<™Iñ¥Xbñ¥Xb¼¸ ˆ=€Æñ¥Xbñ¥Xb<°òÚ½ƒÂh½•uÒ½9æzñ¥Xbñ¥Xbñ¥Xb½†Î <­çš¼¸Ñé=Ÿ <‚¡’=H\‘ñ¥Xb½ O©=š|”=øÙ<ÓÜ8†ÿ=¶Áú>=6> ßñ¥Xb=ÐWü=¸”Õ=Šà¼Øâľ5í½‹Å?¾->n½ ½N哽4Er½‘è="ÀË=IÊËñ¥Xbñ¥Xb=F„=Z¶8= ê=‘0å=Eö= ] =˜«X=Š=8>=–§„½œÒ½ë༚É»§µ<é¼:¤¼=R@6½vññ¥Xb:k¡¼‡ññ¥Xb¼$òŽ½%"}ñ¥Xb½‡Ã;<›pñ¥Xbñ¥Xb½•Åu½%~̼Jyƒ<¦ h=§=¨ü‰=:Hñ¥Xb½Z¼wÀ=E“Fñ¥Xb¼b_ø=.A< ÝD¼ë‹ñ¥Xbñ¥Xb½ŒÇB;ε¨=[;pñ¥Xb=c|<•ç<Ö§;ãsª=6=Z½©5Yñ¥Xb;lƾ<ƒæ¼óÊ;YoJ=Æ=ݬÈ=¤=Caš= nj>91ñ¥XbÈ=Œ<½=$ÃU=.Ô»=ÁÛ.=jÅ».Õ[¼ =WF½-½Ýe*½€’󾿻ܼ9¾Q½X?=@…=i…<µt¬=«Z=wè=bxìñ¥Xbñ¥Xb=S¥2¼ò€mñ¥Xb=.e¼Â\à½JM½5}3ñ¥Xbñ¥Xb<‰½Ÿák¼ÞÚ4=½^ñ¥Xb=G Œñ¥Xb¼›u‡<öÛ½D=ñ¥Xb¼¦Y¼ñ¥Xbñ¥Xb;¿Éòñ¥Xb=yÖ%ñ¥Xbñ¥Xb¹qY´ñ¥Xb¼À¼›½r‰§<F–<‚Ú=‚F¹é˜=9N“4<Õ&=vbÒ:Q*!ñ¥Xb=— çñ¥Xb»‘óKñ¥Xb<~î–ñ¥Xbñ¥Xb<7Éñ¥Xbñ¥Xb=Zw<’Á ;wÖ!=°ƒ=H:RYt=ypÏ=~hè½4&{=Áú/%ñ¥Xb;Áù=Ÿ˜ ñ¥Xb;ÿ1²ñ¥Xb=+®7ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼ «q¼l‹²¼6Û=å,=Âÿñ¥Xb¼mÀö½G½{½)g•=ºê“½"D3î½ñ¥Xbñ¥Xb<†×k­=øañ=ª Û<„Þj<‚š—=š·¼­·Œ<ÏIœ<àó°ÿ=ni=TÿÝ<Ï\x<ê†_=ja/ñ¥Xb¼Štñ¥XbM¢>²|=Ö™=ÕV9ÜÛô»ÿ¯{=~Çi=O à=²½=•\û:†%<¤«è<çPã=ºÒŒ½D½pb=f÷Úñ¥Xb=+3=>¥=;¶¼<=GÐ<ëX½kN½Š‡Êñ¥Xb½ Ävñ¥Xb½–+½9¨¼®e¼;êiñ¥Xbñ¥Xb½å·%½³¡$ñ¥Xb½e#çñ¥Xb½ãœñ¼ô®}½ªaà<”òñ¥Xb½_ðù=@bà> t‰=ýî@<þÛ¥ñ¥Xb=†5ñ¥Xbñ¥Xb=!ïÂ:$`·= À€<£ïÒ<øÞí½[Ç_hñ¥Xb=–·=ÛO»ÂÜ<èLéñ¥Xb½)›<Âz=_tñ¥Xb=¤¬½J—X½%Õg¼<ñ¥Xbñ¥Xb<麱=Bnñ¥Xbñ¥Xb;á°š;-ÿë½MF7ñ¥Xbñ¥Xbñ¥Xb½—^´¼üǽ·4ë½f@ñ¥Xb½³òI=Õmñ¥Xbñ¥Xb½x³½kè³½£Ð…½ŠÄ ñ¥Xbñ¥Xb>ó>­(<·R™=«Šñ¥Xb¼ o¼SõÜ=R¯ =ˆ‹Ú=ã¾T>ïμ…ëð»w{=¥¬=ŽÂÙñ¥Xbñ¥Xb=E1›9€Ïϼa¨¼|Šñ¥Xbñ¥Xb»«ü‡=%WÉ<⊠€6=x¹S:Þ´= °¯jã=Uv>-#G<› é=Bñ¥Xbñ¥Xb½v)ÿ¼Äx;=–«å<•‡Õ=a¨)=`.1=»£?¼×ÿñ¥Xbñ¥Xbñ¥Xb¼9<2ñ¥Xb½\øŠñ¥Xb=¤ò†=å_=¥—c>ƒe=g½ö<€%ñ¥Xb=2)Oñ¥Xb=mXs=<šá=T¤‰=’}=V[Ìñ¥Xb=21¼½žƒkñ¥Xbñ¥Xbñ¥Xb=ì=§³á=„­d=SU=`·r=#€ñ¥Xb=b¯L<¶Êã<Ñÿ=À‰n=R¥+¼2„È;ÿMñ¥Xbñ¥Xb=»â=¬ã 9K7–<ûK=o–Ž=•¡˜=ôõÀ=gòo<å<Ý õñ¥Xbñ¥Xb½co;½˜™h=ï#n;’Žâ;Q˜˜;™ƒ;¡Š;¤è[<A<4¡¼<->1ñ¥Xb<…þò;Å);¹'ý;·Çë;sŽ6l¼qj—»—~w¼Ì]»œžá;Áåa»]A¹´0œ»nk<œG<|„­¼/i<‹²ñ¥Xbñ¥Xb<ºÇƒñ¥Xb;Hïÿñ¥Xbñ¥Xb5˜<k§¼,Š»½Hk»€uù¼Ñœ;·å ;Ï?ý<.Û\< à :È ¶ñ¥Xb¼ËÖ»‹#»Ç ¯ñ¥Xbñ¥Xbº X£»Ø\d»Ï Z:v×þ<廲,ñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb»»“ñ¥Xbñ¥Xb¼’¦`:b伯ñ¥Xb¼ÌE;»Ýq湡J2:ë$«¹ÅöŸ¼ê‘¼dõ¼«L¼>Ø»¥î;Yº¯!‘»†Èð;ý<­;ès<ÍLPñ¥Xb<¥°ñ¥Xb:“§9ñ¥Xb<w!<¯ô<»<¡À|<ãT¹åg»yd4;Rئñ¥Xb» âܼé+ñ¥Xbñ¥Xbñ¥Xb<Ôn;£yߺ:Ü;gï »«ü;ÝÛ»,íÿ;?œNº”ìî9\8à»Ô+»ÚP»rfu¼„#tñ¥Xb¼ª¾»’Ú :›Q¼Ô©ºÛ Ú9òGñ¥Xb¼<0ñ¥Xb»Käñ¥Xb;_9s» ½Ð¼ kѼ]·÷º,OܼȖ׼±7z¼.ô&7Ur¼(lf¼EÒ¼„›Ôñ¥Xb»Æ]¦»È*Z»öL:»Ò¬¡»?fdñ¥Xb;0Ä\» ëº<ʲñ¥Xb<±p;•Ê¤: ×<ŒÑL»pQ ;!7ñ¥Xb;&38;Ú:éñ¥Xb<†ñp;»˜»–ì< úÈ;÷t#¼\»Žêæ<ñÌ;üU“¼Ø«ºœ³û»™þU;Ï´{:¯|È»À*åñ¥Xb: I::”¼Xªñ¥Xbñ¥Xbñ¥Xb;æcæñ¥Xb»˜G)»4M!»µ@ؼ]5ñ¥Xbñ¥Xb¼BƼ¬Í>¼š»ÛĽ¼rż1:»4{J;ób»¿ïμ(¿»§:j»“À¸¼a¢ºâBĺ®é»ÀE­8ºú,;›n§;æï;Ã7»ñ¥Xbñ¥Xbñ¥Xb¼|ëp;¿Òl:vU »jª,ñ¥Xb»ó¢;„ñ¥Xbñ¥Xbñ¥Xb¹–#™ñ¥Xbñ¥Xbñ¥Xb<%¹õ:ùgå,D;ši»%K…ñ¥Xb; ÌöŽ<ûñ¥Xb»Ìsñ¥Xbº‘?T»Œ+Ç»ÎÚ¼»ÚU©»ºò:¸7Eñ¥Xb»¬w+ñ¥Xb;çƒ[ñ¥Xbº>‘<VŽ<°d»Ú0<Êž:Þ)<&غS»C£Œ:Ί»ÞÎñ¥Xb¼‘h:Ïi»~F»¤Pô¼vÎ’ñ¥Xb»‰¼;æf±¼¯sñ¥Xb:ýÙË;ô5;…‘¯»{qh<.Uy¼œ/3;¨•½;`×’º×÷Õñ¥Xb:[Üñ¥Xb;1û·»îŒ^ñ¥Xb<(ÑQñ¥Xb»"˜¾<]3;¼«»^«;Ø/Dñ¥Xbâñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xbñ¥Xb¼k·;ÄŸ‹ñ¥Xbñ¥Xbñ¥Xb<?T®ñ¥Xbñ¥Xbñ¥Xb»®Z_;-æ{ñ¥Xb;¨¶v;¾Jñ<(Ê<ÈÎ;.»³›]¼!~h;Ñ"aº«Ðú¼>z´»êk»ÑáÚ¼NµÔºŠwûñ¥Xb;‘¶ºd6£;Ú ;ÄÆ<;(Ì;Jvûñ¥Xb<ž;?²¼7Z[ñ¥Xb»[oZ:·ƒh¼zÐü‘Ý9}+8̼°ñ¥Xbñ¥Xbñ¥Xb;.šñ¥Xb;Š›"ñ¥Xb¼4HN¼ÃŒß¸ßo¹½Sº ±;$äñ¥XbºwÉœñ¥Xb:›>8,šË¼(„÷;öì|:Çaãñ¥Xb;ùB¢;ŸÐŸñ¥Xbñ¥Xbñ¥Xb¼LY7»©69Áv‘8àøš8ǧ¥;ñ¥Xb<6x[;µŸï:÷ân¹¦7f;<•x;òqt;µÚeñ¥Xbñ¥Xb»ë¯Û»¥Ê;û<(²µ:1\Ø»Bã±»óØc;ß-c¬=ˆE=š¦=˜íƒ=lýÅ=\A<—“þ¤ë¼Ôºg½gÚ½ Sè¼ÕÈ(¼S×H;y <ª±Ÿ=L= <øÍâ<‹ãI;ò•µ<«¨<„½ <[p¡9‡,è¼ÁM»þí:´6Ü=ă=$.æ=%U=Û“<³~ž»ŒZî;‘RÚ;¡Ú纂׼ aƼsÇ?¼¸3ý¼ÿàâ½Wu½!gݽâ½i>½Œ×½*"0½2¸e½7¼ó×z¼æÕö½Ó½=½s0½yP½Jz¼ÔI¼+%@<Ó<ÓO»= ¿°=æå=2ö="ر=I=€=`æ9=a܃=P¡@=0¨æ<ÿLA8<:A<|o7¼©d™»ì¤ÅºLŒ÷ºÉ4ý»òLÞ¼qe¼±ô¸¼ð~½‹½;&½Gnð½<«L½$÷¸½ãè½gã½78½@Ñ*½"LŠ¼ùK¼é·¤½ %½Ó½ä4½½Ìö½à!¼™X9Î\ë<¥ c=E=ÚÉ=¦ü=.ž¤=]ñu=xp =v4o=kÅÑ=_úö=F6=¨<ƒµh»a-m¼UμLs:ãÀ1¼úËŒ¼˜ ¹¼háû¼|@¼ž_¼ÖrL½=î½9Ýx½Tæø½e̽p¨Ï½nׂ½P¾m½d¼ÂÀ]¼£çt¼ë³C½*vý>ml½(j<½ 4»½Ë“½ CŒ½ 0(½¹§½ì½)ºc½-J3½ !¼—šÖºuK[<Œ ç<ùçX=%2=2=m[ù=•¦´=›Bý=‡Äî=hac=\7n=UÁ =4bâ<âœ!<J£»ìæd¼U*'¼?9Ìù/<$)<~Et;Yq;À!ß;Ü‹B;™© :ùº³ºi­G:ßÅ8 +½ºÇr ºŽ7:8IA¾9‘h5¸ú¼º™Ÿë»G–»©õú»Á%ó»m•Ø¹ˆÏ ;&Cc;Ÿ1—;Þ+þ;æõ_;§Pß:ìr׺† ’ºàæU¹R\W:Ã)’:@áº[’ƒº®ñ¹ßLå¹2¯ºøºv£ÝºÁT»ô‰»`M±»ž[–»¯Cˆ»]ïå¹ý–;þ6;†¼g;ÊV1;øYÕ;ð9ž;³;$;2% ·’\µºÕǺ£Ù±:¦; Ï:ó9ʸ~CVº§ ŸºUѪ¹«ŠjºRº¼ ºå#·»[•»^Ô»$‚»Mš£»‡¢»—[»@w¦º"Ѷ;â;yö8;¶bæ;ôæ<u;÷8½;»é";fÚ:¦â…ºR/º®hiºñ:‘`ð;¡®;íà:‘®ˆº¡#º.<žºJ›ÓºÕ&\»27»7â».&ä»6¸è»Æ:»=&»3^ »\|„»r­»שº:l:ä;uõq;¬Ø´;è~Ÿ< {P<i¹;ú\L;Àaé;…Ê;:b®ï¹¾Uº58•G:œõ:;j ;}Í:vvº'…ºÂ ƺ£Ÿêº{OJºÁqž»`Ë»=hÉ»;õ»F¯Z»X´K»8¡¨» +Õ»ª»%9Š»+–»/7~ºÉ¶º7÷ø:¤¹Ê;d;ª»S;ßˤ< $ < <<•;øëÓ;À¤¶;Œ’é;Cî;X:ƒtE9ü¸?K²9ÀfÚ:yÜ°:½›†:ɵü:{Ç빊@Dº½”·ºç*lº¿ ºÀ<õ»í»EÎØ»TÚ»Dð.»I»gE6»\l»&M»€ú»,…Ú»"éõºùĺÓs¥º/ ¹î>Þ:Nó;:;;¢8t;ÛÊÄ<l<LQ<|N<Ý”;óT;½wF;‹Äé;M;!äõ;M‚:¬|º:E(>9ô%‹9è•z:"–M:Ya—:p:?‘›·®Ð®º¡<»fºÿ´Çºå@V»_b»7í»^P»\F#»=Áî»8ô3»]ƒd»ky»GH»1Ù(»Iî"»Uâå»&>º§Øºº.9²À9)ÍÚ:.¯‘; ¸#;Ñ;ÓE¾<_…<¸<'<ÉO< ž;;êÓ½;¸^1;‡C;Dq™;xì;Em;¢k:æ š:®ž:E:Š9Ùý+9Õ¶9ódV9ü ¡9ðQe8”ʺp3¯ºöœ³» 篻»» P³»0 »[5±»nY¹»\,q»1Ù» {Q»EO»dÝ»U|»FC·»_m›»n»}?+»-üºF¾9¿YÎ:¿u::“t­:‹¢:çY;fì†;¿ÖH;ÿ®ª<†Ý<n<aà<rm<î’;áV¾;³ƒt;ƒ=Þ;9µè;¦:øÀW:ðAþ;—;€Ê:Öiû:K²‰9¼BÕ9Ím 9êZÝ9ÇÄÝ9°Ýø8çíº1ÏrºØ}F» Ó8» ™»({»2™é»d·»€õc»ñã»`®»,w×»n^»/X”»V\ï»Q© »FS–»`?»‡WL»—üp»Ý»7X5¹°°C:¥h›;#ô¦;¿:î›$:ùÆ£;D„;§S;îç¦<1z<>N<ç5<Ž\<2!;ý®;ØØ;°ˆ\;‚–¾;4¦•;mž:Ìš:§¨—:ÌF“;ܹ;d:Ë)@: XE9¤,9: q:0^h:­¯9Õt‰9WJ~¹ðWº²ð$º÷ /ºüλœÀ»+ »ljŒ»‘5»—Ñö»ŽÒ»»tóÏ»;1¡»g”»+èf»R þ»M”H»9d »K㦻}É.»—¢T»ª›;»¢H2»Cs‹¸ft1;Ý2;Nm`;A·Û;)#—;ÌG;=Ç;’ùÀ;Ù‘ÿ<‡g<š=<) <°s<dÍ< ò»;óÒ>;Ñ¢¿;®—;ƒ¾«;3ƒ:ùƒ·:¯ h:V·Ë:Ho´:´šk;¤…;[E:œº9Èt¶9–f*:65Ü:s™í:DßÁ:²9º±¾¹Yº… vºÊñ&ºÛ?µºê"k»Š»_¡Ã»˜7,»°dÔ»²\»¥ê»sÿ»b“»7±»AØ»aƒœ»Y¥»4î2»3¼»]ÜW»Šл¤4g»»Xs»°e»O›7¤;‡”;N²];N€;Db¨;>lo;KÛq;ˆ) ;Å_<‚G<2Q<Ä¿<PÙ<Ü<þ<é;ë;É-“;ª ];‚“Æ;.:Ñ:ã4‰:–Äk:˜g9ˆ/:]H:œ(z:ßZï:ÆxS:E 29"ú 9† r:NÖ:‡Tï:Só":ßê9ó¬Ý8|º%[’ºM¬º§%º¿Ê¶»“O»G'Ž»}@»¸‡Å»Ì O»ÍN»ÃBù»®-»Á»pVÁ»j¡(»~³¹»u »GÖ».Gw»DD»uÒè»”M\»¯’±»Çf»·ôz»ZÏ£¹BÞ;šK;$–;3zÁ;@,;P‡¡;`B–;…\Ë;´O5;ñXý<ƒ£<Ò(<™ø<Xç<:Y<Zf<];ß(0;¼+à;Ÿ=J;v¥0;!‹c:Äü:xln9éG‡8Ãk9: ‘l:XÛ:šq:h€Š9˜2D¸•<9D'‹:A_Ä:nª:,œ49ý+ø9è-9ÞQ¹·i‚º*ŠuºAh ºtÈ"ºÆè“»'D¼»€×»°=¹»Ò«Å»á§L»åb»áT?»Ñ<Ä»µe»›Uê» „»‚»Š•ù»mbË»H™þ»EŠ¢»d?\»ˆ¬³»žN±»· »Ê&»·¢O»b tº#Í:ÊId:½[:ýë™;"É[;LüÜ;nÃÞ;‡ØÑ;§V÷;Û<µ0<<bX<4<¿t<«ñ< Qh;÷ÝV;Îw&;ªŽê;Žs;[Í»; !Y:¤6:Oæ9Â¥Å8©Xò9S{: œê:C—°:I(A:$»9ò¹,¡¹•è$8˜˜ß: ö:pò9»é'9Í9Ÿ—A8¶]d¹¦På¹ôÒŽ¹¡Ð…¹ÇrºF`ºí^Þ»TYY»±’»ÊK»å;`»ïþ=»õÑ»øöa»ðzE»Ùbå»ÀAX»­´;» wU»•Ïw»ˆ™ò»uBÉ»dç»iv»ƒ6n»•ïˆ»¦ù»¸Í^»Äÿ‘»¯âW»cNFº™ïr: ”)9­A:Š§Q:ó÷M;7AÖ;pˆ\;Œ±,; ¸G;Ä?;ö<û<.0<°S<˜\<G< Þ<Å ;ãI';»»);˜Â ;yŸÀ;>E¿:ðKq:ŠJy:GÔ’9ð}(9;ME9ÖSÝ:tŽ :™TI:wr]9ú17vÐ/¹¶Sº ÿ ¹êoÁ¸µA¯9K Ô9•Ô3I[8”'À9+ð‘¸žê º sìº3jι§æz8úÁE7¹AóºbZ»Ì廂‹7»·4ç»ÝÓ»ïÏ »õãß»ü³¼u¼H(»öç'»ãŠ »ÍÁþ»²™»›š—»[R»Œ b»‡Jw»€§f»‚“廑Ñ@»¡rû»«Ä»·,´»»I€»¢àa»\ô–ºávº8Œº3ž9«¦Ú:¤zû;,;;c\Y;°§; NÇ;³G;×<0<YÄ< <—E<^T<N< W|<®r;ì#;Ìûb;«»;Œ(;a¯/;, }:à€:ˆÖ0:q¬¬:KV9ï‚ô:-y:·E¯:ö6g:Ùš@:tgú8ëÃÕºC…ºOÈ˺IÛøºq蹧 Q¹{ÿ†¹¶.,¹¶.Q¸h_¹9ýϹ.ͺUºš‡¾ºa,™¹àÀ9›N¸ý¹—º¶æ:»Iõ»*¨»ÍCâ»éÛó»ò0t»òÙé»öä6¼¡æ¼‚}¼Ê¼îV»ð" »Ê;Ÿ»¢y»ß »Ü»’(È»zÜ»…¯»Œl»žïÇ»¬’G»±µØ»¶"ª»±…|»•j.»V£k»܆º¸›£º£Çï¹Z=3:H-:êta;J¸;ŒÙ;¡LÖ;ªU»¸p”»¹£»¸Û0»¬wÒ»§»Y•»/Öa» ‹ºð;º)UØ9Ï(¼:±‚»;,Îë;„+;žÎ÷;¤°­;®®;Ê»”;î—<Vè<…´<½<á<'d;ÿ(-;Ù"Q;¼ï;©¯a;˜éê;……‡;c+‚;E<¾;&sO; ?`;„;¼—:¿Ê:›×Ï:ïÚ;5S;Eì‚;"#ù:È ¢9ߢäº!y_ºš¿³º”À4ºn+gºpÛ¨º/¼º¿èº—4ÁºTÜñ¸LÓ-:ù9¢qŸº5ñEºåð6»§@»ŽDº³ÏºNÄrºp~Ö»EM»s‚ï»­Ó¶»Ö³W»ìR÷»ì³»âdŸ»Øz »Õªh»â¿¢¼W¼"~¼%¼ðO¼{×»ÃæÖ»ŒŠ*»c§f»gÏ»}Ïí»‚ýÈ»¯¨»‹?»¥?»¼È›»ÄU7»ÄXR»Á`Ö»¯Œ„»Zÿ»i¦^»PZ»3o» F(º–Ò9 :Ž×;n;s¼J;˜«`;žÑZ;£;»´n;àÂ<Œ;£õ»{u²;KçF»ƒË®;À\L;Cð‚»_FÚ»CS:‹Ûp:Ò0u»`/ºŒt7;Ì7;Íó©:êdA»P}»Pj‘ºÉ¾SºɃ:ɸž:1 $»‰á»Y®=:’6;Ú65;í©ÿ;§W€:Uku»_õ˜»ƒ& »$º¥ ´ºÌ¶‰7Ê‚6:‹y¸> ºîöq»ByºÜqÙ;)w;ãO;úbŸ;ϾT;y ñ¹ª»|g»¡ñê»S™zºœŽ?º¥êû¢ÖºÈ$à9E=9Jº=sºÎ¦u»¿» yã¹e A;c‹N;ã“w;ý¾Ð;Ü @;©Á^;'Aõº†¡»‰Þ<»¸b‘»›9¼» eºu¶ºÔcN»T<»E –º– ˆ¹ËI:ºiPSº­hYºÑ~€ºæWºÔ¦µº…´»:PbÝ;æœ;Ûh€;ù p;ܯ;¹[;‡–|:½Æ­ºäfn»Ž0»½Ÿ»½ X»‰ÞØ» ”Nº§B»Pu»…q›Ø»-ທùºž-¯ºá™:ºçÞãºá¡ºÓ\ͺ’þ¤º?°ó¸ÿÁ¯:ÄM1;…ËC;ÍëÎ;í›ñ;Ú¯ð;º±A; ®ì;T­: 5þ»-Y»‰Æ~»±(»Â滳Þn»yr»ÿî» §‰»OÅi»œÉx»°E·»‡5c»F­ºÅ/Z»²G»-\»6¨ºæýýºÓº¹ºf´€¹%¢6Âùt:.$; ²;‰ƒÀ;¿kÒ;ÝË@;ØÊ};¾V|;ªV°;Oô;Ôä¹Y ´»%‰»41»šDI»°G[»¼e¡»¯‡º»‡ÅÉ»N«g»L´»‚8»ªêw»Á »ªÓ»c¸» †»ƒ»-P»*f4ºûźÎr#ºË¯…º`Ù9€°­: s):,¾Ž:ÏïÛ;>°€;ŽÐJ;´‡Ÿ;Í.;Ôb;Çȼ;´án;¢ë;x°::Ú1ݺE[»+#ª»g’'»‚G»’ú5»¨ 0»¸þÈ»²{‚»˜*¹»„+G»ƒ·_»• »®Nð»¿ù:»¹Ì©»” ”»EõA»øf»3 »QÞÏ»-' ºÊ8†º•Nº§K`ºda79²’Õ:‡Ú§:‡xƒ:Η;4G;yrž;—‚:;°µ;ÀÑÞ;Ì ;Îöó;ÅTõ;±ú1;”Æî;EUü:vR¡º—»(‹Â»U,+»d#»s7Ñ»Š+µ»£lÿ»·¸Y»¸«»©C€»™,*»•ä뻞⻪ªà»³fw»µï^»§/»ƒÍ»FU0»?2§»f$»j$C»g“ºx`ï¹À²Ùº;óÞº9œÏ9—c4:¦ÍÍ:Èì:îpë;7¼ ;„‰¸;œÈ;¤Ô¦;´M3;¹]_;ÀK¼;ÌŠ·;Ó5¬;ÄJù;£zv;rJ0; 19²Ùfºª_y»$Ÿ7»N#»X£»Y|»iV껇+»Ÿ@ûµåC»¾¼z»²´¹» FG»›^|»¡Ç»¦E»¦>Œ»©°È»«÷`»Û•»‚Á¶»bÎÇ»rÛ»ˆ,Y»p H»æ¹’.…9ùžþ8ËYà¹_ |9Ùjâ:²Š·:÷' ;û;@X«;…MS;­E˜;½oò;¶à;¼AÏ;µ ;³éœ;ÁU-;×ï;ÖÁ;µ(;…:;.«Ä:ª¢]¸Ê÷uº¼Z5»%šv»S’»aj¿»Xþ »[9»nÁ»ƒœF»˜øé»´´s»À¦õ»°h(»šp »—`» Á»¥Ê» ››» x»ªSv»®zö»¡Ùs»ié»…4Š»ô »’›œ»c»ºÍŽ9±`ˆ:¨÷i:‹&½:)à :Ùá:ÛÌÄ; ¾p;*Í;Sõ¦;‚6#;¦á;Ð…;ÛÏ;Ë[£;ÄŽ>;²×k;©€‘;³Ë¼;Ò¿‰;äÑs;ÍL…;—Ù¯;Gâ:ïû]:Ayø¹âŒºÓO»-K¸»a&b»v3ß»i— »` »gÒ»jÔp»uìN»’¿‘»±p黹j·»£Éü»{»ãd»ž/k»¨]Ò»£ 點¬ »¨¨~»·¤†»ºÌr»¬ý8»™ö~»•¯£»-C»‘p»Hrº‹:Û:e/Â;ÃÁ;¥:ée«;H7;"°ç;1 ;?–…;e#H;…õ®;˜1È;¾t;ê^;ôJ »2ß»Kv²»|SÄ»‘¾½»“@x»…ñ–»t㻀 ç»—¶ »«5M»©OÔ»­[»Ÿ/‹»´©»ÏHã»ÛEã»Í‘Ø»³%¯»¥v>»§ä»ŸkÇ»v&¶»ßð¸‰%ë:ïù\;Q²i;€Ó;Œ —;˜ô`;¤w×;¡_q;“A;Š`•;-é;•óÌ;–²™;¨:H;ÕÆ <œ=<ú;ù 1;ਇ;½ÍÛ;¬_u;¯s;Ë=”;ö3<Ñì<¶m;Ô[;˜Mu;Wl;&:†ïY¹¬ÙhºÁgœ»HØ»>SÉ»c>q»~ßå»tQ§»Nò!»;‘»6Yr»#ð…»\÷»­»:Ðþ»]`»xŠ»‚Ô»€"»tbµ»}‘Ç»“H»¥æ9»£ÁB»“§ »ŽÔû£’»Æk»ß-Á»Ü"R»ÃD>»­Š»ª÷—»«¼ˆ»—4.»WRǺÐn[9¢™;žè;v(‚;›Êq;°Ó$;¿Áª;È91;Ãã5;´t·;¤m*;šNL;—0;“ 1;’rÙ;ª¢w;Ú3'< < Þß<u;ó€Ø;Ð";¹¼;·t;˱í;ïE‘<ã< % ;ÿ#;Ìò;š'.;d©…;‘¶:ᲺSÛ÷ºæ®»ÜW»7`£»OAï»`Íi»T¨õ»-Þ»šõ» €ÏºýJóºâœ«ºúÒ»é»0àê»B8]»XÞF»u–»Äl»|á»>Q»Žï»ä»™œ{»…$»q¤ »‰½ð»±,h»Ô8µ»Ü3$»Ê!£»²ÿ໫G»®Ù;»¥ä²»†X»3Smºž”¡: ZÌ;!­;‰H`;²-;Î0Û;Ýo;à-D;׺¬;É1Y;»Î;«jË;šÑÑ;Žk·;†u3;Œ@f;­â;Þ•ñ<@;< ¸@<Ù<Œº;æ§Ô;Èyä;½EP;È>å;ßúä;úŠy<š<.;öÏ;Êpò;o–;^1D:Ù踮ªóº¥ñÖºùêû»ýÄ»0w‘»?sÓ»FÚ»6—Z» ÛeºÞ™ºË¿ôº­ ¨º’Æ{º·–Ö»Rø» ÑG»*3´»0Z»I'»qR+»„•»‚’Û»€ŠI»ˆÈ>»“Oﻎ΂»p=»Jæ »`îл—aË»¿·ä»Ð9ë»ÆV&»²Š»§t»©\»¦ë»H;»W D» jºe}—:©¡;"|;Ž¼Š;¿,c;àÉ;ðÒÇ;î&³;Ýü;Ì Ç;ÁS=;¶“õ;¡C_;ˆÑ ;qéf;kÜ;‡;²É;äüæ<>i< A< XL< n ;önÉ;Ò’î;¾k9;Àj;ÌO;Úÿ°;ï—ö<À<v½;ìb;;Å2];“̇;0Aü:>)ºPÒcºË`ÚºúÀe»‰».X#»:õ»;gR»*äۻﺶ®‚º“ºpºR{κÔºK9õºÎ-v»UW»"ƒE» *t»$zJ»Ad»nDλ„uﻃ4õ»»ƒHX»‰¶»„õ»`9˜»6åü»?Ža»o€»ªl»¿ä¾»¼¯[»®‹-»£?%» ˆ»îÊ»Œl»W &»€Öº¶> ºÕÇ:kì;y%;ˆ {;¾2Æ;åÔø;úr„;ö³;Þ›m;Ã\;µÌb;²\;¤ ë;† %;SÏW;<æ(;N@q;‡ ý;ºw;ëàÅ<õr< Þ< ,<îØ;ùi);Ô];»#¥;·‡ñ;ºöç;½÷;ʨh;â@H;ôâ;õÒO;à€Ž;´¤;n"Ê:ÉoT¹ƒ½~º¤j*ºÐ™åºî+¶»WÍ».ª»<þ»<¿ »0 » 悺ºŸ*ºz‡ƒ¹î§#8³ª¡·g2„ºkYpºïG#»îd»*j»|e»|±»7ÿ°»c®w»|ÑZ»zþ·»rµ»u$B»{Þ¦»sË}»VÕ»4â»5£»iF5»™wË»±éÿ»³è/»ª›»£+»Nq»•ªö»ƒÒ »EÜ»{žºž ºAvt¹ºøÚ9·®Ü:ãË=;j¿N;°(;ß?6;ûa;ü}²;á 6;¹Œ1;¡¨A;Ÿõ+;ž ;‡e‰;Eå;¾G;~1;>û;‹Ûß;ÃðÂ;ï²Ô<lÇ<\V< ¯Ø<ª;ò²I;ÏÎ;·0P;²0;±ðy;­¶Ù;± ;ÄÜ»;Ýš;ìéZ;êLj;ÎÒ ;–ã¤;˜C9Ò©±ºiµº°ZŸººöѺր‹»‘˜»&Yð»6®=»8Øn»2LP»§nºÕк„eœ¹¥I€:¥ë:T 8­ÖKºˆÊŽºàfºô솺÷-MºúªT»ˆ»& V»Lª+»`]×»\âj»TI»UÈ¢»Z2»UjØ»Fñ‘»6»8¤»`ñÏ»zs»§yz»®–»¨Þa»¦~‹»¤÷¢»š8»ƒ\n»=äºÙ[ÛºQ®Þ¹ÅÃ{¹„йœ\?¸ Âg:†4—;5T9;™˜É;ÏË%;óêÛ;ý¹v;æË;¶¬;¶â;ˆ­;ƒK;‰<¤~<ËKÐ<ç©&<ãLP<·„<2I§»fÎç¼5Dm»Ó†; Tß;® »Ïk›¼€Fi¼¨G¼¹ó¼Ú’ò½É}½O`½„žá½™×•½¦k!½¤½…D½TŒ½‹¼Í`G¼³w$¼ÁPR¼ÈYŠ¼Õ4Ò½ ùó½F½x½o5½vƽjàD½cÈ?½[«u½65¼Ü`ʼ|ªº&u»¥„¼œ´€½ C½'c½zu½Ÿ½½/:W½0ÚÖ½&‡½*æ½=žX½BÀ½%!û¼ôTx¼¥{»ü¯H<(&=<áÚ‘=ªÎ=E}=´S=¡Ò=¨È’=”€=nŒ=HÊ–=>Ó^=2Ú²=£g<Ž.;km¼ ¢f¼c¿`¼†›»¼L¥‘»ðq»ÅÕÞ¼ ¼%ï+¼ÿ »‰¢´»‘þ°¼^¤¼EÉ&¼# N»ãåþ»ÿ6ܼ“»ÊSºgû;·ÊMNê=9\=.—Ä=¨A<—=—;º“I»­7˜¼„m¼Èe'¼Ê‡;¼±”¼«X¼µ伬¼¼„Ò¼0x¼B¼;‰n¼kب¼H·»½–×»1¡»œ¡Þ»¶])» Â;ξ<CÂ<•Èu<ά*<Û0_<Ü2<öGO=´=<ú·m<Ás‡<µ;¾ëÔ»ùa;¼”±è¼ˆÔ/»VÁ<ªJ<;f$;¹Pô9„ö»€k»½3¼]Wk¼Ê5§½?K½MÝŠ½ƒì(½–Œo½—@·½‡¬½Wëu½Û¼Ü:0¼««h¼»g ¼è¼øb ¼ìò佟a½0ÿµ½]Šü½g@½Qºh½5ÁϽ$×.½p`¼àuq¼Sr;:‰^ <R9<3VÊ;Œý ¼%å*¼É3)¼ö!ë¼ø=½â ½4‹½IxV½BÔá½5dÿ½:}½M‘µ½TE½D”‰½/À½ ©½¼ŸÐFºpˆ„<†x\<÷Ê«=7‹=|… =˜?w=´v=:º=rÉ.=IµÏ=7AÆ=6¼ =*w¿=k¢<Ÿ&Ÿ<žU»7M±¼·Cs½£ß½"F‚½^¼½·½>½UɼÒqë¼£Áq¼”A¬¼šäõ¼¡Í·¼‰( »ýFÞ:¢vÓ;G1H:0¹¦½¼:I¸;Tˆ¥<)Ö<§R<ÝO<ákü<àÈß=U[=Û=ï<ÄÞû½=¦B½1½Åo½aï½9+½Rdù½W{ ½XyZ½^M«½Wዽ0Öj¼Þƒ¼¼·;ïêê<Ôi‰=C…R=‰|=›q=”α=ƒi=bi¯=Gö§=6Ð=*“„=™f<àxÓ<`zR;d~»O4ð¼tâá½=‘p½n½â^½P½…ºù½u.%½Vܽ84R½,w½6â½?"ö½-õY½³¼¥N_»¬æ?;ÒÖ›<-™X<(åË<;º&þ;i¦¸;æ-<ƒy¹<Òo5<ó`k<ÝXl<Íém<úb=P)='Á =n­<Î<=¾"»þéÚ¼ìó/½/[q½.\¼íE'¼;$:·lè;û7.<š<tÛ;Ãdºôå¼-…E¼¤Ú‰¼è|j½%Èؽbཀf½h¸Ÿ½3¸Ü¼î‚#¼w¿’»½ ø»ˆ%ý¼%š¼¬÷½â±½'yÚ½>2Ú½OÛνYöe½QÓ…½9z¤½ p£½ gå¼åÏ¥¼µ"q¼rˆ»­dÍ;~¸?<0â÷½ªK½¦sF½šé½ˆ7ù½g–ؽV‘W½kûÙ½ƒ<½x‘—½@‹â¼û€ê¼‡ƒ”»‡Íæ;Çáá=xx¤=PSJ=3µî=)=$Ÿ=ƒ<½DÅ;Î#¼G ¼âÑ8½×L½Dœ½8V‹½k0½ŽÁL½ `‘½« ½®¡l½¨¼d½˜÷Q½‚Êýf`ϽnY½ƒØ'½€3v½K•½Gˆ¼šEÁ¼Ëg:òÀ—Ü;–çj;Žžp;†6Š;x÷;r+F;u,;q€A;i?X;PÄ5;´:¿£#:˾ï;': ;ZØ;QÖÝ;&Yæ:òÊN:| ¹|¨’º”TÛºœ¤ºfðéº} ºÃK<ºõ±Óºâa溠 ºfß9†ç:Ž}/:¥›–:?-º#3¼»‚{»P#æ»`EP»BýŻѢ» NÙ»M5Š»œX„»ÊÖ`»æ›»îP»äлÔÛ»År»·”»´ì$»Ê&¯»ó-m¼Èg¼Æüíñ¼ ã#»áÇ»¤CÇ»Vœ®»ä »»21v»Xõ$»pÄ»•; »¯çe»ÈÊÅ»Ö|b»Ýé»å@»ã)]»Ëò%»©Å¿»‘ld»Š4Ç»‚‡ »i(Kºì¿ë¸qHµ:›¦‘;š´;c.;ŠõV;Xþ;<ó;¤”{;ÖÝF<“Ã<ª_<"~œ»¹Ô8»¬1Z»«|š»Á¾T»æM¼¾(¼ v“¼ ••»ÿ®ý»ÝÆ »¬—á»g>k»ìS»s”»2Q)»in»[‡»ªË»Á%§»Ó´À»á9ä»î¬e»úT»öªN»ÝÊ뻺!»ŸKù»—©ƒ»’ŒŠ»€=»®ú¶&èÆ:Àò;)ï7;gJa;„Så;†a¢;…Cœ;˜ê;Í<Ní<¯²<'§V;´:;ž|¹;¾ ;‹Zè;‰Ç·;‡ÔÝ;‹½d;’±Ì;–3y;“•×;ƒ¢;A5—:Ünf:˜à":÷aþ;Gûõ;f]€;KÀž; nÈ:øç·:¥{œ9À«W¹Ëöº?¹~G¹›:¾ºwüºÛ¯¦ºíÇ麞†¹†á: æ:‰ú+:Èè÷;ZÖ; ¬:Òø8æ袺ùi»`Å»€2²»g|¢»4v{»!F“»\öÏ»¤Í»Ð»â %»à†»ÓŠQ»ÆPV»¾´ã»´C¾»¦+»¤yq»·&m»Ò"Ç»å3y»êUè»æ—ݻݞ½»Ëòù»«,Š»vø$»4ƒºßá°ºá2ê»Ë¥»FÁC»ƒ8» kỶX»Ç'ß»Ùy»ì¼„¼Z4¼Ik¼¿ý»êÜ+»ÅÊ•»¨D» X§»\¸»‰Î¸»¨„¶¨êX:Úƒù;8(®;i¤§;zи;v~ÿ;u¸#;ŒÉÿ;¾×><°º<’@<+ôÝ<1•x<5º™<6ª<,Û3<KŸ<Ìð;ë6È;Ì0…;¯äû;˜Rí;Œ4Ð;¶;’d°;–”¨;iw;£@;¤gª;¢DT;•“Œ;kÜ;ö.:°&Q:ÙÌÏ;3xÉ;^~;RE»;-‹g; Hí:Îe:u f9µS8ô79ÞK9Ì$ð7©+ȺHM.º²> º£u¹ï2 :qÞ:§AÑ:Љî:îNë;ý„;,±;%6:²*غ.õg»+„Œ»u½æ»Û»]€»0n»;»‡§¬»¸ùf»Ô@—»ÙlP»Ò¶~»Æò‰»¿&¶»»’»°>È»Ÿy‰»›‘±»¨¯r»¸ƒ8»¾¥»¼"λ¹¯˜»¸«¯»²Ó»žÂK»wÓÍ»*Géºô&ºß½Œ»»(%$»_ƒ»*»¤,¸»²ØλÂé“»Û@-»÷zļm.¼ ^¼Hä»î­»»ÊHA»­ª»¦±»¥Ò‚»“Nü»$H¹B”E:Ò%û;4bž;_ÐÆ;jÖ;c§w;eN;ƒ:;®¼ü;ðîs<›P<*¿“<2É[<6t<7št<3øÕ<(÷‚<Ë•< Ë0;òuû;Îß»;«È(;‘í ;Š~?;“I¿;Ÿ1;¨áS;±¥˜;µD±;´]þ;³W†;«âv;“>;;QÏð;§†:îp;)™;U½9;PÂU;0B_;|I:á &:šÞÏ:K©‹:>È:b:™¸w:îr9»4ß¹ÑᆺF/7¹×#!9è“P:±Y¦:øöð;;;…;å ;7W‹;B†¦;ð¥9ñ.ãºÏƒ¾»R{»†7‡»‡Ïb»hE»J){»l¦»ŸêÍ»À´Ö»ËË»Ê6Í»Å{Ó»¾¨£»ºË”»µÏ »¥$»’•Y»Žá¶»˜³à»Ÿí»-ü»—‹ »˜$Å»›¿Ô»˜žM»Š†8»bj|»(Tô»c ºöD¶»Õ3»Á¨»=ÀM»kì[»Œ)»š …»¤”°»¹Ë…»ÛÈz»þ¬¼ ^w¼ ˆ¼pS»êùs»Ëüa»´|»°8Ý»¯®S»›Þ»8äǺ‰5:› ¿;.õ;CŸ;T“-;UA;\P ;{C; j;ØÔ(< âó<#7Ë6<7Å·<2Õ<*†Ý<uÆ<L;þËâ;Óº{;©Í/;wO;¿;›e…;«;·»;À,‹;Ã'r;¹…;ÄŠf;ÂQ©;°ù[;Œ¦;EC{;Œ];5-;Yûr;W™|;2Â>; 9:Ý2o: G‹:j„A:€¾B:Ũ,;Jf;B‹:¼Jz:1¨û8/È긟۞9Ïï’:˜¡³:ñà; È;só;gx;¡H;3JÉ;A¶ ;#€g:”¹pº4hÔ» àó»~,»™/“»—‘л„a*»y‘+»ÁŒ»¬—¿»·ü;»¶^¯»µs滵a%»³9»¯Äx»¥O®»N,»Éλ¥M»‹õ÷»Ž/ø»†ð»€ì^»„ÿ“»Šey»„É»gÊ»9ÚA»ϱºó[ºûF» êٻĻ)óü»FŸ»i\ý»òV»ˆTo»”»²7¦»Üª¼¶%¼ì@¼Þº»û.³»èÕ¿»Óƪ»Ãz‰»À>»»Pd»¡ÿ„»Pù§º£³å9ÅX²:Æö;;ªÔ;3Ze;Dx2;V=È;vF…;•B;¿hù;÷‚<Äp<&õ°<0‹×<6ƒ<7ùê<5Ýö<2!Î<-·°<%Ù5<S9<RŠ;×2:;ª;1;‘ÒÀ;’Ù•;¢¥t;±í6;¼¨ ;Ä«0;È`t;Ë:;ш;ÒFµ;ÅÌì;¨‹Õ;à«;NuÜ;M¶•;fðA;h;@Õ; 9a:ǤS:ÁV:`^¶:€ $:Ñ¡"; Úí;;ŸŸ;$Xq:áíÄ:mÄ9ɺ«9Ù¸g:gâ¡:¿&:õ_µ;‚ ;e5; ·<;¾‹;'€o;/y¿;r6:§ú«¹KƒÌºé»[²Õ»™_»¯=ƒ»¨õµ»–5û‘³4»ž黥Ÿ½»žö„»—‰¤»˜uÙ»›¬»œ5»—Š»ˆÖ»j?#»\5T»qu»„仄OÚ»t¼ƒ»ioæ»s¾ »|ãì»gtÜ»8aí» )ºÅkˆº®ºÊÛºøW¼» ¥š»1ü»&³q»=Îô»W|»eˆK»p”>»‹mþ»²x®»ßÌK¼"¡¼Ôu¼¸ã»÷Ž»ðYÀ»å2»Ùt»Ò`3»Å4[»¦!@»p:c»%èºYÊt9²‘':¦Jð;D;'™«;G„;nN®;L@;¨øX;ÒôP<Ð<!Í<&r<.]H<2€&<2h)»Ëhº¡à)ºA ’ºábºSó뺡Ü|ºÕDºô: »o» ‡» R‰»8@»K•X»hÓ»‘‘f»»¡Æ»âÜ”»ú—‘»ÿØ×»ü+î»ü¶n»þîP»ùÑ»í/$»ßN»É®¼»ª+m»‹½s»\ôp»äMº˜Ðœ·IRU:‚m0:îq;%Z;V¥A;ƒ?Ü;– ;°ª{;ÙãU<šž<u‘< Íâ<&µì<(<%é†<$w <&ѳ<)žN<&Ž<õ.<òj;ÏFä;¨[;—Z³;›Oa;©6È;µT8;¼r;¾ï¼;ÀÕJ;ÆŽ{;Î0@;Í®r;ÂÓ&;²n;›2K;‚[“;fâF;dN;gdH;S›ø;1':Ãd‚:e8Þ:@ô‰:‚}¶:Þ¹; 2;=æ;_…w;Z¼;1K:çÞ¨:YR9¨M9Ù‰/:N>:Œ˜c:šw];Ün;´–`;edŒ:«~C¹³8øºþGºšbº—ß>º³Aͺ褗»iO» X» ï®»;» ÂéºÞ纕ñ[¹ÇìR:0ÆÖ:½ù­:œˆ8к[>㺜Ñʺ³FaºÊüºÓ‰ùºâ~9» Ù»'»q»0íâ»)K»#81»(¬Ú»0e¡»0n#». -»-Àò»9'y»`}»‹8»Ÿ\l»§»ˆ»¦½?»¨œH»¯±´»ªàx»’ »RӺ㕅ºÊH¸ƒ\9 W76cu¥¹ã*uºÈN9f²°:ú¥Ø;€á¡;ºÒÄ;ãf<;õƒu;ç9³;¸Öo;ˆ÷;mTQ;{ÕÔ;†-‹;se4;.(:Ú„ö:ºÙ1;¬i;Mì2;›Õ;Êëª;åÖ¡;ëÈ;ì‚/;ör;òS½;êžW;Ó©j;ÁîÏ;½Œb;»öï;µ8j;®\^;³à±;Æ¢*;Øp/;ßä#;Ú¯;ÃW¶;“4@;!X5: ¯­º1Þ¦º‹žjº€d=ºqþ5ºŒ§âº·D<ºçA˺÷c*ºç`›º×þøºÌȺ¸º”Çøº ˆ: `’:ØS;~:©@Ñ9‚¬4¹´£º-­ÕºÝ‰º´Ä(º²V.º³àºÕQnºï@ºäíºÍ°áºÑ‘ÿºóm­» '»†R»ö]»áL»/±»^-‹»ŠçR»šÞ »ŸD»ŸQ»£»»²"n»º+h»¨th»}´»ŸºZU”¸qq9qMÔ9ºt8c®?º4%غ‘.¹ïpX:£Á¾;XV;£Þå;ÊVÃ;à’U;ÝW¼;¸b;‡ž;[ĺ;`ˆõ;{];ƒ²^;fµ;%/Œ:ç¡:ÚÉñ;5±;Xû­;›9ú;ÃçŒ;ÙÉ;Û=;Úü=;çM;ë“›;ìoß;Üê;ΔË;É~÷;Å=Ù;½?½;µ/;µ™ª;Ã;‚;Ò÷”;×¼î;ÏŸ;½\;;Ÿ43;^˜÷:ÐÉW7£žºj"º“ºƒËBºj➺q1Aº’CQº®Ô¿º£Ibºj¸×º&õcºEqº8Œ?ºI ðºë`9•}-:¼C ;6 ;_‚:žL¬9ìB6½?ºŽÑº™þ1ºµºLº›×κ‹õóº“ÞPº‡Á)º>ÆœºÉ:º[€…º±.öºèLJºüúÞºþû% »ý×»T³»‹\‡»›¬}»™~©»“kø»”Öc»¤Ö§»¸ž=»¶ ª»“¨6»<Ó®º©û=¹Ÿ.Ã8rá99ˆÓ9ÏÝ´c@!ºi—¦º¹ÒåºO=,:vÖm;?„y;z=;­h¤;Áü3;ÇuÔ;°4ÿ;†´;V­‚;Rœ{;i”>;ƒ$y;†Å;j”±;1ßp;‹:ûÜ;f;Sêk;’P3;¶Ê×;ËF`;Ë«T;ʇ¸;Ù[¢;â5;êj&;àƒ;ÔÀz;ÎîI;ÇÍ[;¼Ó!;²ý€;°Ý;º4;ȤC;Í1ã;Â@ü;­ø;•\;o0p;C|:QÉ2ºÏº°íþºÍ,²º½¼-º £º‰±iº‰=躄ðº#ò·¦·19Ë>B9ó9ž?ß8•e7Liª9Á»ý:ž+0;Ê÷;ú:è)Û:„Ùã9íCL¹»ÇºzÐôºÈƒºÀ§-ºŒK¥ºVÚº1ßž¹²¦8×y93ܹÐ^žº˜áºä0Q»…üºþ`Öºò¬õ»â»B5㻈÷»žP»še»Š`’»€¹{»ˆìô»ŸÉØ»¬®˜»™¬Ö»T¢4ºÒfÒ¹ìå}·rê"8‚k9…p”9ÍêÝ·¿)¬ºi'¦º³ä=º<ÌI:lâ;8½ï;‚Tô;•^¯;£ë¡;­Š÷;£‚W;…9€;Wß;N®j;^†x;yëz;ŠŒ‰;ŠY§;o6ù;:¿º;’c:úJî; -d;=ñK;‚¬;¦]“;¼Ä;½Û%;»ö9;˲x;Ô1é;à;ÙW;Ís>;ÆÁ;¾£S;±·;¤ý˜;Ÿ`›;¥5;³y~;º©s;²j;]–;„ö¯;]~®;(h4:³Þ¹¸õœËº¾ZÛ» [»"»ºò뺸+Õº’ǺF.n¸Z:DÝx:¥G·:½ál:¼É+:«²:’óÆ:¹ô:ºÆÖ;/J;Æ;4Æ:±Kç:EßÚ8묺GèeºÑ⸺ôüKºÃºvź•À¹£N/9$²j:³‹:ÿ³¹q'ºŸ°ºúþS»¹f» Ñ»ë9ºýjl»+u»zû»šØ«»›É‡»‡vI»`Ý‚»Q˜5»mÀû»Še’»‰?»OP„ºÐ€V¹ö¨9—ò´9“t,9VRe9´Ð×9éÀ8Š²àº30ºŒMk¹Øt–:žÒ;=u;|¦7;ŠÎ;’µ;› Ú;›DÒ;ˆBF;c–á;T<š;\á€;pH²;…}H;P';…¬î;`ze;-‹;¤ï:Úýl:íiÚ;";c{ù;–Z;¯.Æ;±†=;®‚;»Ë€;¿x;Ì'Â;Ũî;¸@o;¯·u;¨^;œÄ;µŽ;†m²;†Ö©;’L;œ£Û;›[;Œ‡;p^;I¬x;"ª:Õ!9¦zº©ÁH».ÿ‰»a?»kù»S£4»"^ ºáù§º•­#¹õV«9ùœÊ:µ¨;8Q;l·;'ˆù;/ªÝ;(Å;À°;² ;’i; ¤‹; {†:Òi:‹¿9èH0¹ëï1º¾ÞÄ»[…»4íº¶âkºOzö¹ÌÒ|¸m69î¼t:X§ :_ǹ˜š\º­µÈ» ¾§»+B¹»0+•»K»œ¥»\»UúÏ»‹È°»”ö^»ƒõ~»L2™»Ð»©»97»KX+»-+?ºµÑ‹8k Z:pbU:ƒê:öÁ;D9£;@ÞS;+›ó;(D;Î;(ƒë;-Qó;'­µ;"^U;v­:ùŒO:xC‹¹õлìQ»wØ»žKûªÕg» FÖ»{Œ »!’Žº¶ücº2Ù!9s“:¤ c;-;I¬³;sܘ;ó;›q¸;œ$;–/H;‹î;€’@;ix;HûÂ;$O_;Ñ:ÊÕ:T¥Ú¹UJºžü¾ºú¸ù» ²hºêÌ[ºŸEKºÙ™¸…!9àT:`MÚ:d:#ã¹*׺™œØ»¦l»De»aò»Uõ}»$Oýºò’»þ©»5áw»Y5$»IWY»†@º¬ø`º\ãº_òhºçIº¢òvº€d¤¸Ú±:œíP;ÈW;,ù;V:ÑÌD:…[“:´s9tC ¹Gyæº) èºXL﹚ûê:ƒÎ»;(»U;y+;’Øv;œÏé;¦ô‘;³ÝŽ;¶Gí;§5;”;‹(Ÿ;‹‹;Œìü;ˆeö;zO;]õÇ;=|e;#î:í†:¾ía:ŸRX:“Ë:­Ë9:ö ÷;6>¶;});”äe;î;€¬;tÐw;KÐ9;L<.;<7C;"_;‰:è":ïÀž;á÷;(æ”;À¹:ñ=[:¼¦Œ:ÀÊŽ:Õ“8:à´:ïK€;ô;n4:­Åe8“7.ºÇ£K»O„ù»”ï»®8w»² É»›w»X]ºètñº\¸I¹Çú9 :±è~;&;;fôÿ;Í$;¢(ì;¬|Ø;«_;¢Ÿ:;—¨Þ;äX;„bß;p¤;RF÷;6G;oì:ÚN‚:4·¹¬Žqº—½+ºâÝgºýj ºÞJ€º”sŸ¹ò!ï9$´:7“l:Œì:Žœ‹:=”á8w¨kºcjjºü»>áý»i ·»hkµ»7C7ºùǺá»5S»;Àx»)¿œºÕк-}r¹mQ;¹¤›±º C_º]¥º]“ä¹ì;H9þ@]:è2s;5ÄÔ;C\G;!³r:ÛE:lÌZ9h»Û¹¢ çº*cUºg+ ºt.¹òQÕ:00ã; @;Xjû;ƒc¿;gê;Ÿ?;² ;»ú2;¯óÂ;š< ;îg;Ž›`;’5;ŒÊž;yN(;T¼<;8ø;û°;µf:Î[:¤É:€vÕ:lK:›ø:ïÓ©;7ÄH;{åd;ÜÁ;ˆTx;g&Ÿ;Lo^;ª;½):ùMe:Égt:‘1:Bµñ:IÊ:«Sè;~à;0:ÚÄ :tl:$²ó:5xO:Zew:‡§:µu‹:ã|:ÔSK:F{±º'd$»=E»nkû»•˜»³R»¯JλŒ˜»'䳺ŠP>¹Ë_ö¹xWÜ9Qzö:Ÿuø;%+ý;w0x;œó¯;² ð;¸zÈ;²yÐ;¥É±;—ø‰;Ìñ;ˆP;„ ë;yxÛ;gL¯;Qü;,‘4:ÞÁ¶:+ui¹[àºnœßºÂ¬iºä?wºÇ•Öºv ƹ†Aj9Äâ:tH:£pª:šî:XÙ§9‹ŠºÔ\¼/¤{¼áov½/œ½Q5½N÷½7"*½¢ ¼ßy<¼”ec¼>Т»õûÿ»¼ »Íæ8»©ÑÉ9„ž©;÷ªm¯=U‚w=70Õ=“}=¯e=Ä‹=, <²š;ªÌT¼a;¼ûª½#™c½( ì½*šÑ½?žÂ½[Û轂­Þ½žæa½·5½¿{½·Kó½¢v ½Œrl½ƒÆL½ƒZ½q|*½?­ ¼ùÒm¼yìH»…Ò;èD <ª¶<øBÆ<ò‰Ø<¾³ˆ<ªÆ¢<ÈLª<ôö=` =#Ÿ<Ï-ñ¼“ƒb¼ê“¼ú‹_¼Â¼gÓ¼ Õ.»âA‰»¸~ø»hD¾º” ™¹·dºe‡†¹Í^;e‹´<†@‰½ƒ€ ½¨ѽÀtӽľ4½¹'—½¤7e½‘{ʽˆ•”½‚n@½iûɽ4 å¼ÍZh»ü ;¥,ó<‘‚Ñ<ñ!‰=¾²<ÔýA<†Â°<£°®<§—ƒ<‰ª…<ˆ9˜b»@O»9·´˜;˜õ;ôi<å™;¢Ö¦:Ý—:ïðö<æm<Š<™£W<…‰Ç<êe3<áË×<Ò®r<µc<<‚§â;¸³¼Üí¼Ô’½=Q½Z½ôA½Ö¢½!ÌN½Rj½ëL½²ïå½Â´Ý½Àtн³/½¡R|½‘=*½ˆ5h½‚.½hmr½!bÛ¼„&¢;­»4È<ÜT<)ànZ»à#å»îŽ˜»²íF:±žŸ;î#î<¯;ûrÍ<$O´<+wè;z!k»ÚZ¼^æJ¼\ ¤»Þèþ;:gƒ< Å<Kõ;A.‘»‹»Ÿ»»Û »°Ÿ«»t¼l9,Ö;À>p<4²<`6eßû<;;¯‹N<\M<ÌWÉ<Ë*J½Ÿ›_½˜j ½Žì½&|½lû9½hÕ½[+˜½i·¼qj«;Ëf<ŒÑ<£ì;<¢Æœ< ÚÆ<‘3«½“›\½‰ìŽ5½uD2½bR·½Gë°½8͹½6ÿO½!}t¼Ár»6íRPÓº(c@º]¯§ºÃA)» [¥»i¼|»šM»¹gì»Ìyû»ØQë»áÅÛ»ê€Ó»öØ¡¼ïí¼­¿»ÿ)»í÷µ»ÕGt»¹~'»µ ø»²çÕ» ã¿»oµH» ¯ºX‰¤8¶Ìú:q/;‚©;B}Ò;j¨R;‡ßz;¨x÷;ÑeÍ;õb-<S< Ó<Ǩ<K<gþ<,Ë<ÿÛ<™_< ÅN;ó-º;Êb;¬1¶;ŸÒ&;¡Ïg;¨a;®°};²y@;±¸o;°°Á;´é•;·›;¯B’;¢¸§;™Ôm;‹ìe;hýx;@oô;3›;4òÜ;*;©ß:¼:Åò:¨ú:ìÿ;Oô;Å ;ï;)RÀ;1Á;ln:¸¤Ñ94Â>º+)Aº)Cò¸‰Gû:ìW:5¾M:6„;:Oö6:ƒþ:Ž•È:hì9Ø Z¹ŸiẨ(» p»<ßE»Rt.»w²>»œTË»½Ëÿ»Ë[G»¾û^»¥­µ»‹GÑ»fs»6¸¦»Mº¾ì€ºeº€2ºŽˆ{º¤`bºÃ÷Mºûž“»Ó»vÙºõ7œº·ôºŸ<—º¢ßÁº˜¼†ºTF‰¸«@>:Y[:µ‚:´ÈÎ:”a‰:b1: " 9—¹4¯¹­¡§¹š4ù¹¨6(ºJnøºâ5»F¿»ïŸ»³<Í»ÄG»É3»Î›»×2|»âç»ðE»ù~r»ú‘»òu»àå0»É෻ʼâ»Çn̻ʔ^»Ãšø»£¬D»^ýÀºûÙqºˆÁϺ·Î9•å½:ºx8;S;H<;yIÐ;¡$;ÈMÒ;èÜ;û“S<‹(< ýæ<L<-Ä<¸<FP< ìI;ý“‘;Ý"Ö;Â…f;³å;®>µ;ªÝw;¦Vo;¤’þ;£B#;¡C;¤FÍ;ªN¿;§š/;œD~;“ãn;‹vH;nqY;;";¬;"Ùí;+¢U;#p;%²:Ó8«:Ä|Ü:ôU;b ;ôÝ:öýA:ól#; -; U†:ÉÊ9±MºeÂ'º¸åtº‰k¹‚ÆR9Ždw9šû*9UD69¤¬a9ðç%9œ‘¹U»úºa’{ºÙ5»)4N»U‚Ô»b˜á»ok¯»à_»®ß)»ÆÏG»Å–=»®úq»‘Zx»ré„»W…Ù»<‰»õ€ºÉºŒÒ›ºŒ«º´´NºâW&»•™»Î껀º°ÿº®¹wks¹Ëëº ¹ÙÒh9tÍï:¡á°;ÍJ;üƒ:óRZ:­€+:[CÚ9îj9]#Ã7:1›¹*}¹˜ ɺü¢º°“ý»%G»›ä»¬¦>»Ä„ï»È\‰»ÇVï»Ë7‡»Òm|»Û°C»ã䊻è`·»êÚG»æÕž»Ø¸£»Ù8z»Ûv¯»×UŽ»¾ê»ŽÔ»-옺ØOº¶Ìº–j¹²+6:\:éoF;!/™;[ñ;•e¡;½jE;ÜŸï;ó¤‹< º<4w<y<iX< Üj< JÙ<e;ìÆ7;Üiœ;Ðëœ;ɇê;¾Gò;ªþ^;š=Ë;‘å;Ì6;é;–Û¢;šº´;“Õi;‹Vq;…äA;o$;;½Â;°';üÝ;,…;;ò?;6ßY;(~:öœD:õa§;í.; ’³:ؽÒ:ª‚‚:¹š!:×°::¹ëƒ9øJ`º`A¢ºõo»M꺱qjº Ú¹ªI%º U„ºIÙoºBºDìºlžJºÈÃF» ûÿ»9—x»c®‘»r²9»r<à»…‰ »¡bþ»¼%º»Â»4»°[n»øô»kF\»[~”»e¹A»Xy»%ˆ‘ºÜ:Ϻ¯âºØ†¥»BJ»(»)¢» ðº¢й…Æ^9Ù,™9Ëíç·ïqO¹&&,9§F$:³C;%Þ;K‰=;9¶;J:ŸÎ:$|E9Äð9U15åΨ¹Î‘º\”yºÄ'_» -×»rW»¦Xx»Ç†=»Ñ  »ÍÞ%»Ël>»ÍMf»Ð¯¶»Ó„â»Õ Ç»Ú^»»â\H»âÈö»Ük»ë‘¬»ì‡Í»æ«k»ÐŽæ»¥ ­»UÕºùéóºÐë\ºêÑXºÒѺ>óÛ9À}û:’2:è4­;9í;Š(i;¶G;Ù"d;ùyª< <¶< =<B-<+)<¬;ýH‚;ôˆ¯;ð³³;ï¼X;ëþû;Þ¼`;Átg;žEÀ;†SE;wv;sqÎ;€=;‡™;„É©;zÏ÷;tC—;f~˜;;Òø;|D;F»;&Œ;G¿C;XU#;IQH;:÷˜:üø!;Š:̼7:†­Œ:v}:—»û:–zê9ýu»ºM0±»ßP»51¶»&iƺáQ%ºŸm³ºÆ†I»eê» ¬ðºëYìºíÇ»?j»:T³»U£5»pþD»Û&»zœç»n»—T»°Ÿ#»ºÖ“»«ÍF»‹l»UÛ»=Ê»_˜­»›»l¸’»,BàºõFåºùÌ/»%.®»I«|»K»"J™º½.I¹¬ûM:Ày:`™Ì9í¹&8š¯„9˜ß‰:¡9U;*‹³;nå£;víH;E:òq’:išò9ãÒ 9¾ôŽ9B2e¹Âlíºö>º÷!p»8c»|éB»§#l»ÍtY»àJú»Þ/‚»Õ½‚»Ñ»ÏoF»Íµ#»Ë‘»Í@p»ÙH»æ0æ»ể»þ²Û»÷äå»á…í»º7¤»ƒ÷»‰ñºÃ±pºÚƒŽºÿ—òºÙÉcºW‹¸‚V9É8§:Ãa;†|;†\|;·6ª;ß *<< r<èì<*x;îèî;ìP ;ðí;÷ï<HJ<ç£;ÿ H;á2;²}ê;ˆœ;a,;;Sp‚;Z«;eAu;a³ö;Rfó;N"ö;QŒz;: ×; O:ç;i;<È|;]1s;`yª;8ŸY:ýíu:ËÎ:Ö{:Á¾:ƒ˜Ž:L¾:f›À:hç#9ÝåPº7¥¨» êÆ»Q;£»eæp»F$®»µ»wÈ»OuŽ»s¾¶»eð‹»L‘ü»TWY»px©»TÇ»…§×»ˆ‘»…T×»ƒY»‘"\»§¬ »³»¦Hл„ë»@ Ê»Qž»/ Á»võ|»Š·Æ»içÓ»);¯»m†»*§@»XÙ—»gû£»?‡ ºêÊɺ&q9Ðœƒ:€µ-:M©9ž©\9 S¶:‡^j;ø;rë ;Œ¢~;}:Ã;.»:²¦%:¦È9¸mË9˜(¹W8ºŽ¿ñ» -g»Rl‚»Œüc»±=»Ø 1»óD»õýè»é&±»Ûw°»Óe)»Î¯B»Êeó»Êtɻ՟®»èá»ö)J»üÇI¼Ǽ¼Oô»öZ»ÒGò»¡žv»NÐwºãµ º°Ì\ºÒåúä꛺·ª%º_”›ºDO¹’µ¯:4Þc;ûÕ;Œ_˜;¾r;çq:<†< õA;þ¦B;ßÛ[;Õ'å;ÞA6;ïy"< œ<E<,Î;ú‹s;Í—ì;˜R;c¬ÿ;E9v;D§À;IªC;? ;&Š.;t×;,M×;1÷Õ; ?þ:Á&;:Î’Œ;7î;?Ô;Pë³;:ì:ú&:˜2±:“:«úI:™L*:z<:q%ñ:O]×9ÂhâºÝ9ºÿ}ç»W+T»…U㻇b'»n^{»[»~db»Zl»§ëÇ»›‘y»‘º«»–_ƒ»œ®ý»šÉ»– »‘=Ï»Œˆ\»’e|»£Ï»¯W=»¤§Ï»‚€e»3)Áºñ>ºì¢Ë»;€?;Ý;7{:Ò ó:HÛ÷:SE:„K¢:¸¿´:¼?:¬°â:€ú9ÒËT¹°ø%ºÅœ~»@›»…Ó »šô¬»›ÒV»oÓ»‘Çź×öž»3¨O»hì»oR»B'»..ºáÍø»˜Ð»4…»ä º¥·^¸¥×ã9äCÀ9…›Ó¹CÔºvº!”º~S¸Í²p:Ub;¢/;;à;<2;ºÕ:½Ð|:YI¹€Ø©ºS·ªº±ÚºzBAº_}|¹ïm9Ù³:ÊyŒ;"Ú›;Gs;`Û‡;„C­; M;´>?;®q@;–Áù;…5 ;„Úó;‹åŠ;Š});s×7;Es¦;$­(;A;â&:æ=]:»S:†$e:.Ë:+Ú\:‘y:úÆú;@&6;{¸ë;‰Ñ>;k¬;RûÇ;-•$; u:á :²éÏ:‚%:’8’Þ¤¹^³28rÓ|:Z=:DZH:½À:2ßÙ8p¸P¸…J¿8„§N9œ|:9Ýp:¥Ì:ÕÍ¿:­91óº“(ã»&,»~{n»£¸»»²u»žZØ»UL¿ºÃ'¹ý$Q¹³ðj¹˜«_9´d:ÍÒê;IÕ¦;”T™;¶™;Ãsú;¿0;°XT;θ;ïÞ;†âN;†ÔÏ;…ÿ;‚%÷;y§ž;a›0;.œn:ÕþÆ::°n·ñ\!º?}›º©¡º¼º’­º}„8q;:04ó:š—1:«;ä:Œž¬:'ã¸O8¿º…eë» P´»Mf»lú(»VJŠ»QÒºín.»$@»-é„»)U}º¿ï•7švx:r÷Ù:s¡89á´6iô ¸Þ)Q¸A­6E²9©:ž:;wS;+Êy;°b:Ýwò:wWê8œ Õº9“/º‡ïкxSº=¶¹î_·]Øß:1v:²ÎH:å:M;Qí;!®;e ;˜D›;¦®);”ø~;tØ3;c”æ;tàÌ;¤æ;g€d;4Û(;`¯:îu:ìe*:啲:Ì¢Q:œ:6 ¨9å6W:F8L:Ë»y;&r–;aQ;€¶/;}x“;[aÙ;-D:ÎìÍ:“! :8Ç“9“![¹y€ºP—ݺ†"àº(ÿ§9a­:á19vµ“¹îWFº;Bº¢Œ¹”‡†9!q:Mß:¾}T:áí:Ÿ•p9 8ߺ•>(»#2?»ßt»£ð»©uþ»‰ ¿»'wHº¥„ºX;ºPËÙ¹ìU29ür:ú”À;l[};§ùe;Å6‚;ÊÅÐ;ÀL/;­-;™yW;Œxè;‰H;‡ia;ƒ_;~¶>;s´];SÍ;Bì:Åœ:CLD7V_úº*,º†7⺅¿}ºAT¹¦ 9kÞÂ:`áä:¢ª“:˜ø:P“•9,Ÿº@¾ˆºáòL»-ŸÅ»V去UÔø»+MEºù¸ ºës˜»Á»šœºØXù[TÑ:‡úV:©ô:ž‰A:Rw¡:?ç³:iÐ:U€¹:¬œ:Miþ:Î\É;ïÌ;gí:é1×:ªÛ¨:1èF¹ºº>õxº]É¢º"kÓ¹˜¶nL9 :1 w:_Ȥ:H¼€:ež«:ß×;Mãô;ŒÛÆ;Ž’{;gå;?Ä°;I5¦;`Úr;W!t;(¯¸:èxI:±C:³ž:Å·:ÉPÈ:´ÞØ:‚!b:¤:,kî:´iŒ;Åú;PàÅ;m<¹;nh_;Zt¤;5´a; @u:Ðy:‹ùø: Š19HÌ£¹ ÷™ºzUºÓߺùf"ºÆ¹çºW町),ˆº’_º¾:rº¢€ºP%ø¹˜Ó9»ŠÓ:–äü:ðFÒ:üÿW:¨ùˆ9k󊺄ä=» Ä ».U» Oy»œÃ@»v/¤»(ËÀºûa«ºÛ‚ºª9nº ñS:'vå;¹©;‚Q;°ù½;È4+;ÉÌÎ;¾ Þ;¬M;1;•oê;Ž!œ;F;lµp;`š;M¢—;)x1:ûÂ:¡@!:c¹K-5º„ƺ5R~º/—Òºöü¹‚•9¹¡:zÍ:’n:^¥F9²º"* ºÍ仉»5»=E)»(u»f£ºÏ`QºÚºíVº³Úæ¹¢ù:hÄs:àÌÇ:û6}:å2:çÊ;2U; €ô:Ä„:~…:§Ð>:úг; ³è:óC“:ÍCÒ:¥Cm:/羸~¥Dºé7ºw¹j&q8°˜€9Œòª9êÔž: ÿX9L¸”~9EOó:³”†;=^q;oÉK;VÏ;%´M;HX;<Á£;Fˆ:;#fA:Þ#i:•@å:…ý¶:š(û:®ìE:ºq•:²E:Š÷=:hŸ:­™Ë;SÃ;F8H;Z¯¦;TE;Ew;/€; Ï:…1(:Xd9\h˜¹…Ú ºf¡ºß9 »'­l»=«» <º÷w1ºÿÄ»âã» Nöº»gºB ¸™UÌ:9ÛP:Ж2;fb;<:¦«9 ɺ—Œ;».Lc»„V–»š”T»’請wöÅ»U!«»A‚» ÔîºÐJAº¨$:F;ý;„qí;­’Ö;ÀgH;ÁÞr;¸F8;¬i~;¦Ø;žIÕ;Š"W;b2Ï;@Ö;(æØ; _:æÎâ:©!y:&㪸¶ÂA¹ùO¹ê^9¹Ïø"ºlº£B¹/: ¤à:z·Z:cˆÇ9àÂ×¹Â)¯º°j‰»Ñ÷»Éç»7”»o·ºò…|ºÆ|ʺ£›¬ºŒLôº/Pà8Nù<:fAÐ:Ý—;;UÃ;(æ‡;5¥N;R<§;dmX;$Ò¹F­¹üè$ºbo8ˆåÞ:C|:qF©:/­8ÒÙEºR.’ºÌCºÞ‰‘º²õǺÙÿºŸFź°Z@º•?¯º+ÈG7]Í:?› :§«}:çSC;K3;I;i”;†Fõ;•Òg;‹¿=;A» :òõ);0–;*–6;0˼;n‘;´:çqM:¬ñ:/l}9?·Ê 7Žü)9=I`9áò¤:L¼¥:Wæ…9Źä *º§ß9$¯,:Šgv:Á¢:µôë:ª4í:ξÊ;ŒÁ; Å:ç*:¶AE:˜P¬:„E:qÎ/:ˆæÕ:ÅÓx;fÁ;¢O:ô(2;ÓT;û2;*ÁÔ;CØ:Þ~Ã:¸_:ª„:ŽÅ9HK;8Ï™¹ ý0º5⤺¾N»þ§»qœ¯»’Ry»Š~‡»mÀ†»h¿©»pÁ »M;»Ç&º…£¹¯FU9‘x„:Œ™¶:ã9ü:ã1Ü:‡hµ·£5ƒº‘Š¥»8Ç»`m»‹=ž»““ö»”O)»™‹8»™nÊ»‚¿\»0Êíº¶K>¹¯îï:VZÛ;8l;göj;‘Ts;£én;ª p;¨IA;©JS;¤ÃM;ŠÞ-;Cö:êk:Y\½9£9!×8ŽLƒ¹ÊñAºuRѺh&¹yº 9Q± · ü¹×b4¹}¶:Á§:†Jå:ò|:3RÎ8 ]îºMźŽf8º)$Í·¬|¸9ɺ..¡º„6º”p9­e\:°cs;XÒ;¦Ö;(â§;Up…;ƒ¿ª;šˆü;­° ;®À;Œ¬–;6Ýh;cw;9Þ;VÄý;AÆ^;˜/;Î:á¸k:›Ó]:/ËÄ9žPj8úÈ9$2œ9Óeä:i–b:§€õ:sý!8²l^¹Ì$)¹dzá9k/ü9è½#9ýÏ:?‰œ:•ŠË:ÅŠX:ÖÊ:ÅFd:¹Ò&:¸J»:¡e·:p0J:K=^:˜š];%ë;%‹ä; -9;ƒ;Vâ;œÜ:õ$™:˜8/:1`y:I©: µ9¾Bâ¹ ±À¹^÷=¹}X0º¶wº¯mO»Ÿý»a¼W»–£­»žu+»‰±ä»v,‰»|“£»oo–»2KºÌ]º; )¹€Ü|9p)T:[Ó:‘Y2:D÷Þ¸Š!^º|ºèÿZ»3Íã»wª»’»“ö»—h'»Ÿ±é»˜Ê)»l¸È» DFº4Ḙ¥ý:‚«;8ù;RH‰;†Á;›¶=;¡=ç;ž£w;žz;•"¨;jÉG; ˆ_:@é¹¢0äº.ôøº £ºÁÚºƒö¹º˜5jº ãÍ9ÊN’:2H½9sŽ¹x9²_\:¢¢:¯3<:žÒC:eÈ09EB¹³dƒ¸±¶µ:H À:Ÿ¨¨:Vñ¹Ýžº†i9£tÞ:Ù%i;-Ôô;E;;L>õ;dkJ;‰é4;¥Ë~;½ž»;Çl;³3ã;ƒñ;<]ª;Ah;jŒÓ;i(¥;>ª¾;ë9;¹_:Õ†º:˜`#:F_Þ9Ö¯M9—¾}9þ_F:}$y:Ïð:×Ûß:[]O7ôÇY¸ðVÛ8 >¡¸-%¹W!\9(lc:o¨4:®>I:¨=p:Âb:˜|@:¿¹þ:à Û:ŒD?::(Ë:ººW;¨¼;:cX;,o;g4;„ :î ‡:†Œ'9•ôU7º˜|8Jì8tϹï0ºhvº"†+º”»êY»L¥|»Ž‰ì»¤¬¯»–óJ»z…»m$™»ny¹»Jî»­aºŠ4¹ú-@¹‹Uý7ÆH9—09%¼Dba¼8^¼£Î»ëã7¼2‘¼¥"­¼Í²¼Êfg¼Î+Ž¼×.P¼ÕIŠ¼Ìà;¼·]¼ м€¼áÓó½-0e½n…õ½†ä½uZ*½D0_½=;½{S¼Ý(c¼‰°ß»—cé:ÅÉ9˜€ß¹¾ïÝ;Gk©;ôé‘<sÄ;»§.<k<§½ê<·ð<…#»·J»¸ño;áƒ|<‹bì<—ÓÈ<¬©<ÿšU=6*±=T|µ=D¿D=œd<êTl<7(g¯;”»Y<¯Õ½W2Ó½ƒpë½jl1½'P¼òˆÏ¼ºß¼:À«;¾„\<¦¾O<Ö!¦<èù<߶t<™÷Œ<.(è<5zà<ŒA?<¿-]<×òu<·Ñͼ÷ç½Ã9¼þ¹ñ¼¬Æ%¼f)¼iM1¼™Ûœ¼…ƒŠ¼®Ìнïy½uñ ½„פ½K½¼½ëv¼‹ o»Š£¯º²¿_¼Ϊ¼É;”Úxƒ¼H¸»#Xþ"¼Ê·¼J弄î-¼ D’¼S¼¶Þ¯½?F2½ƒæܽoë´½dø¼³io¼™?мh‚Dºâƒ¯ã< )<¯¬h<û|G='ÂÑ=>_¼=5)¬=Vä<ýè!<¡ë¹<7ÜÖ<-uC<4z¨:Á„E¼peQ¼¼ïô¼³À¼·©×¼õJ½!6þ½茼Φݼ ŠC:zÝ;uc»W»½µ7;AC<†ð<Ë¡Â<šŽ¤<)ôŽ¼ ±¼³O¼ôÇ[½H<¼ìEa¼lÌ ºþ­;”¨¯;¡v»µ~:¬ç»Ÿq;»š0œ»›ªá»¦Òº»±M»©Bz»ˆ8·»6¾Èºà麨WIºò6è»P“ »‚¡r»jõ»4Òé»›»6V°»`œ»dcf»(ëiº·ëj¹ð®“9ß::w©Ÿ:3ù²9ÍÂû:k}Ÿ;ª ;Q#;†Ÿ);-P;uÿr;*4“:®ëJ:«ø9vÃí8¢ߺÜ?ºÎ=`»4œŽ»‹xŸ»¼óø»ê:Œ¼ É:¼ õ¼ì¼ì™»írÓ»Ú“'»Ò i»Òµ?»Þ®?»ó)ú¼ãå¼ û?¼$·¼ë{¼ Kï¼òä»ä£€»ºû0»ˆtó»'°ºÄ‚溕υº–§xº™Ë¸ºjqº±Rxº¬ÅŸº :­:š|±;V!};ŸØA;ÁÉ2;Ý0;ç·L;Ø-Q;¿›f;³’·;»ên;Îäv;Þ¨¡;é…£;ííj;ãn;ÅÇý;œ£1;u¹§;UÙ;HQh;32¸;Ü):¦Î:—Ýï:à)²; Ï«:ØK:G|Q:M“:jb:©ø\:³…ê:{uˆ9“:»7¬à:Dh:ÃèÏ;åÃ;q™:É »ã¡ƒ»ÛÂ(»Ò¢Š»ÂgJ»±%p»¨/Q»¨¢‘»°,Þ»·ãô»²è»–8£»PκýÔ.º¥¿Õº¤ô» »UR¡»cË»8ª¢»,»»߻ƺi…¹y4:‹Â::,ù9¯%â:(Ä:ê(C;DD;}œ;ˆt³;zJ;CuÚ:ôtU:bAž9~8RV¨¹Áæܺ 'ü»ì»i©ô»¬p»âÈV¼ T/¼y³¼¹¼E¼ã»èx"»Øܶ»Ö »áÙk»÷lz¼Œ¯¼fú¼4[¼<.¼ fÚ»ý°â»ÜŽê»µâ÷»†3–»(j€ºÉ7º˜YZº›+Jº¨·8ººbüºÇZ¹º›ÕX5¤ÍÙ:ù²Ž;s“!;ž6';¶cM;ÉÙö;Ëêã;¾sI;®¿:;§;«Í”;´;¼c;Æð{;Ðn;Ìœ;·Ù/;š ’;¥;_Xæ;B)±;–f:¹õÔ:`Bv::ÚÕN:á‚:m:Ï82—ϸÂå49LåØ9¼ß9/‡‚¹š^D¹üé8r°?:¥Uº; âÓ;=Ýæ;\¶:§Ôm9Ss5¹àè º¡ïô»"½Ÿ»}¨»¦æw»¿U»À¸G»»»ÃýŽ»Þ–t»üþ’¼²¼£1»õ'Š»â ´»Ên仸ƒb»´‚ê»»N»ÂKž»¾ä컨Œ/»|1>»$¢ºÜ|^º¬°§ºÂ†»©J»@¡'».t^»Š·ºÿÐÅ»²‚»4å»5½,»?º¤ º+(F¶oo±9Ú$9,–Ù9%,¯:¢éÉ;.N;m¶:;„;yë’;OŠ(;‘>:¯wF: •ÿ8‡@ë¹jUº{† ºñÔÏ»@ƒ¦»”]N»Ï@ ¼-ÿ¼˜Ó¼"É€¼Ƽ ûƒ»øDR»ã9†»Ù…é»áβ»ø4˜¼«n¼4D¼Å•¼ó/¼}Ÿ¼pž¼fÿ»ó& »ÓÖú»²>ã»…Ÿ…»,3ºÜÕ º»CκǮRºÑþ5ºÑœCº»’º2ý¡:U°;(_=;|@{;•Ø;¨TÄ;´òç;µR;¯;¾;¢HÑ;”¿);Žƒµ;Žtô;˜wk;­¤;Á¥ˆ;Ç#};¹ép; ˜2;„w;VW[;1fÁ;öV:–¶:^†:”êj:»v{:Œ>18Œæýº.·Œº5ÜÁ¹øp¹õGrºD ­ºd½¹Àe4:VÏ;„ý;` ;\’é;ÚÆ:I¨»·°Í¥¹ìªº¯Ì<»2[)»Š†*»´é°»ËS™»ËÒÔ»ÉO»ÖÙ»ú‰¼E¢¼n-¼Ï'¼Š»í »ÑÕ¤»Âu»ÄK»Ì¿.»Ë0„»ºÅ»˜Ë»\U »¡Tºø9 ºÉü@ºÚj#»»ºó…ºÖ®ºïÎ!»„»F»UõºÃ¦îºˆîƺ0aŽ¹Y†ü¹6b¹É“¿9À¾ý; —;UÑ;}}œ;}&¢;YÆ•;)E :çæs:q%9‡i¿¹Qº0½ÂºË~»(ñI“»ºX»ó¼œ¼˜:¼!Id¼h¼åu¼Fˆ»í÷á»ÞÃ~»ßs’»ôܼJð¼=¢¼©¼á¼ }¼]»åº&»Êß »®I㻄x»3} »ñ&ºþN?»\FºôÝ}ºÐ»[ºŒ ¦8aü©:Ë}æ;=ÈK;tÏy;Œåd;œ+½;£p;¨ Î;¥‰ý;‘¿k;ttÜ;ZÉ;b!î;ˆ|z;ª´;ÅÚò;Í™Â;¾Öñ;žx;qž;@V§;&N}:õ+Â:˜ò8:l¶Y:|G¥:zè9§lÔº8Jºžó|º¨ ºaKôºk—Fºìýº™º9ä¾h:øQP;YvÛ;|ÒÓ;MŠÝ:Î"*9ʽR8åɹÒüÒºÉNÔ»J´Ú»—Á»À?þ»ÔàÁ»ØŒà»ÚÉ2»ñ_ö¼Ü¼#%Š¼#|Á¼a—¼ T/»ö’»Ù˜»Í”I»Ór»Õ¡ó»Éj»°f»`3»_¤ç»7F2» ½HºØ ‡ºÝLgºóÀ}ºÐrº°¹<ºÃ@ºß׺ì–ºâÊäºÁgjº£Ϻšhýº{-äº6\¦ºT‰)¹ü)c:,9;,Ý;lâ;~zÿ;gKe;89Ž;Ù:¦\":ï*9èb¹vVºŽ±@»ÁL»q9ž»­/c»àŽÀ¼ Iµ¼Æÿ¼>˼»¥¼ß»ó̓»åLƒ»ÝS»íNJ¼ T¼§d¼[¼¼;À¼¬¼Ñõ¼P»õˆ›»×»ï»Â…Š»©H»ƒÜk»Bú»$ÜÄ»'¹Û»ឺü{Ặ¬ÇºEB:3^è:ütà;@ÅE;p œ;‰ª9;‘);–îw;¡8á;™«b;yÖ¿;E|×;7”;Zbo;’;¹ ß;Ð~;ÐD7;¶;e;‰÷‰;G ;/¸¡;%k™:÷šÄ:™é3:8,º:ƒ9î}Š¹©ü®º¡üº½öº–ž ºfz6ºHØî¹ãŸ-9´»Ö:¿ A;4eé;n†k;fŽÁ;°=:dœ‘9’z9¹5º »»kî\»¥€²»Ì‘»ä]@»ìź»óý¼ òè¼&– ¼3%ë¼.h†¼!g̼ l»þ…2»áK¶»ÙлÛù?»Ô…H»ÂÍc»ª»‘Š»}Ãt»M{2»ó-ºÓ}kºÊöº®xtº‰Ö˜º˜Ѻ±vߺ¯q¥ºžu´º•5º›* º¸‘ºÎ ¶º¬pºAźuJ8ÛZ:òJ;R=;x¿·;rq;Gu™;©6:¦³:R89Ú=O9T¾‹¹Ð)íºÚP »\2µ»§d»Öˆa»ÿNT¼_Û¼aF¼Ân¼•»ôõ»ê‹Â»Þ+U»ã×ä¼K¼ Qf¼¶À¼¤Æ¼p¼Ž ¼ˆr¼Ùr»æÅü»Ë½»ºÙ€»¥?»†9Ì»XG9»JœÇ»GV÷»$°%ºìêºh2¸üMS:zOF;1˜;Cç;v ;…äX;…g³;¢;šÈ+;‹õ;^áB;<³d;H•¾;€úÅ;¨Äú;ǽ;Ñp˜;žï;š[¢;Qˆ;Ö;)§¶;%}å:î":mJ9Ÿpo9Ÿ;8ô[½ºCgƺ¾Û»ºº¶Úº‚;ƒºÿŸ¸½?Ä:âB:±ÿG;ÈR;@E‰;O _;(dg:­)[9èK9±Yõ8…ÀSºÒ»0Öž»ˆ¦#»µÑ‘»à>Ì»ýïu¼†‰¼ ªf¼".ä¼9X ¼>À×¼6¯¼&üt¼3¬¼»è#t»à •»Ü:Œ»ÐPè»À𽻯µ^»¡j¯»Œ'5»K¸™»tºÉ÷Zº¡ÑHºSNzºR“ɺ†$•º}½œº@A¾º%Ç~ºa´fº±¥º÷Wºöl}º²¸ºwÎṃ°:›™A;2O~;l\c;tr™;SI’;¨Å:ÕÊõ:wÙÜ:!†: )9»kWºJñ²»3Ø•» [ »ÔÈ…»ôª¼ñܼÆv¼C弪»õBx»íлâ§X»ÜÉö»ôȼ ¿¼Ž·¼X¼ À¼€ ¼T༠¼ß»ûá »Ù+D»ÂWO»µæˆ»¥Q¸»‹v×»pp»h€»Qô£»@šºÚ/\ºkðÌ6¼-:ôb; Š¤;Nå÷;xUï;u‹Ä;u#;Œr½;”ÇÏ;‡°;kÆÝ;bAU;{ûÏ;š©ó;¸åC;Æç};ÀéK;¤9á;eè2;{Ø;VÞ;'`f;¹¢:à ú9Ñ8 7š.9‚30¸†NNº€t'ºÆ×<º­³äº;‹ó8‚¬Y:lAB:Ò°õ; ;^;—¿;ÆÆ:À~ã:÷ö9µ—Ž9²å¹Ê ºü¦¹»cšŸ»œ'Æ»ËSš»ý„{¼'õ¼¦=¼ቼ6°i¼G J¼Fd¼:Ñh¼*r#¼fm¼`~»ì•,»ãj7»Û¡—»Òó»ÈÈÝ»¾.Ø»¯0»‹o…»6—Óºôz人›ÁºQß"ºÞ;º6œNº+Î)¹®F¦¹NŸ¹ÑÔºŽ§ºù_Ê»H ºÛQàºPŸS¸ "ˆ:†„;ï&;\µB;pÓ;Xæò;'Á–:è81:Ž:A·6:fì:€¢[9mwPºê¶»€T»Ò죻óß÷¼à ¼[<¼ Ñ#¼g»÷©g»ðãW»é¯ß»ÛлålŸ¼ýª¼ä¼ î1¼Ê`¼Õ¼!<\¼g¼ ÎÊ»îá^»Î-¡»½zõ»·J©»¨É1»Ð"»€¼N»tS¶»K]ô»ºÖ;éºkÁ ·äìÊ:;N';T ý;c¿‘;TM;hÇ°;Œjœ;–÷;”u×;;Œ~3;“Ä…;¦Û;µ;³¤ó;£Í6;~˜¦;é:Ãò:ûÞ˜;#€J; 48:m+*¸ZAZ8Gª9´to¹FNŒº—E€ºÏSwº Ïœ¹œ™Û:g1 :öªõ; ö;Gð:ÛÃG:¼‹î:è:(!þ9}?9ÃNÂ8Ljʺ¡¼ª»>³»ˆÃÒ»°8»»çgB¼µ¼9¿tg:’0û;kb:ù:?йEB9p Œ:Û‡k;Kpn;{µB;ƒ¯;†C;‘r;©Ù;Ƭ1;Ù+Ó;ÓF;®Ö;~‡v;R÷;iÐ;yû;YÇ;0P;);5°:ÔUU:¢$á:\³ë:¥=:7 ‡:–“:ä\Î; Ü{:ÛZú:"‰28¶Ò8íq·Š¢q¹ÊIœ¹YÀ :Kgþ:Æ—Ò:µWà:j%:IÏ“:žù:ε:ªuê:;H92šÐ:RL:Õ‹¬;-;Ce–;3I;!Võ;Ø^:½c 9ñ'¹Ѓ¹[M3¸ÀØ-¹P¹½\ºQ¥µºjdº‚£!ºØPs»2$л€®Â»Ÿyk»Ÿ¢»‚­‰»YÀ»R£¹»E4Ž»¿\º¸BìºE¹±B:¹¹É¹š¶ç¹Ñ+ºG”¦º¡°ºÍ´ ºë~©» æÝ»h[d»‹à»‰áœ»±¸»‡´»ˆÞé»Z4ºïýäºÑñ9ݽ‰:†> :½k;·Œ;Qk­;‘Ì;¡3ž;•z ;‹8 ;Šr‹;q7#;ZT9­`ñºl½ºÎŸdºŸaºWz“º]eºQ”¸T*}:ö\;y:Û)×:‘¸°:¤‹:ÛÇâ:Ýê :ÆO:«Ïz:kÕ@:4Zà:œjn; Á;0[Ç;Vd:F§‰9Ù³:Ë‚þ;UI\;’Q!;£QŠ;¦g};¥<½;®Ç¤;ÈlV;ãï3;í ;×&Ñ;¨Ô¸;|ÙA;d¬„;rŽ\;dÅ;;žµ;&ƒP;‰$;×ü:Ôa8:¥Øç:rH€:u)5:·ÁØ:þKé;³n;Í¡:¯Å>9³%v8·­–8½ûu¹BÜú¹n¾y:1þ@:ê^l:õº¯:“‡l: :@å£:¯æ:ºð:L··é8š¹g’}9üþ›:߇Ò;4˜×;IÑì;A§«;8í‹;V=:¤F9qfǹU5¸ß›i·º7º@$º£>Ⱥ˜Ð°º¤Í@» >ö»ZŽþ»‘¦G»žÜ#»‹¡X»W`¾»5Ø÷»*ÅÈ»œBºÖieºJæ¹¹|…'¹?¹ëfº 0íºzýº°ŒþºÑ‚VºÒLžºð{å»5 o»|ÊI»‰Ç«»v£»gÑ»zâf»oxU» p„º`Aõ9öU:£`ÿ:³ÞU:µ$µ; ÷<;vÆC;¥{T;§?Á;“O ;‹¿|;ˆÑ ;Q… :®’0ºRºÅœHº¾‹|ºaºº³åºÛ¹Jï–:c‡º;!V;(òÛ;v7:ç./:óÈ:ã‹):°é:‹å9:^XR:>–:’¥0;t±;8õ‚;>³Á;²:OŽ:Êe~;N ¿;šTÖ;¹¨;Ç•G;Å©K;¾ãÁ;È…ý;ä;ü©t;ú0=;Õw€; ×·;uÞä;e;`¡V;@È';'/;$^[;eÝ:ôç:ÆP:¢ :”¬S:ÊK; ŽŸ;%H³;(¶Ö;}\:KŒ©5ÃÛ¸q:·D¯7`Ò:/S:ú!¬;'V:Þ C:%^69ÇË:@&;:œ†X:q€¨8¬½ºÂ~ºÝO9Ìs":èõÏ;0·È|õ¹ÕÆ‘º±$åºÌÖѺ—%’º®bL»P'»t ³»“°ƒ»Q»gr».»—*»¹ƒºÖ´º… ”¹–»;¸Ñº ¹š]R¹ödÁºP"÷ºŸTYºÅ¡?ºÅ‡îº¼λ»NL&»„hÍ»€Ø»Zjh»]¡€»su»K·ÙºÎZ28æ‡:´l:ÜÁã:œ¬G:ªv;,;˜\£;¸Éy;«ÐN;—E;‘¿Å;‚mZ;ìÃ9ãÒ¦º…—º¸!ºs`f¹¤ O¸²“I¸:û—:³ì:÷æ†;Aè!;AÉœ;'ñù;Ž‰;Òj:£ÚŠ:#g"9®6Â9¸$û:Zƒ:âå¢;+Öˆ;N«D;>GÞ;LÇ:öº;CQú;•s;¿y;Û0I;æ%Î;ÛÈ@;ÐÅâ;Ýî;û‰?<™Ý;ýü±;Ë¢¢;“é';ip;\¶3;HfG;)kP; ¢w;õ.;o :ÍA´:³0<:¨m±:Çø;Ð;,á;-£q;Á^:­í 95Ðé¹®áì¹ õ9qþv:O:óðÄ;/Ø“;Ãÿ:„Îd¸!÷{¸¥R•:(ä:;|ß9ig꺌®ºƒ©ïº:wÚ9Ð]):þ2;G.;lì ;€+†;c‡º;"Í:t×9y¨ˆ9iÓ•9x#Ùº–ãºïÕ㺵^ºJ"$º +n»&à‡»u“M»†ãŽ»qeÇ»:¶y» ~ºæW®ºÃ¦Ÿº›Ì9ºÿŽ¸ðKð¸ê3¹[ˆÉ¹ÎDóºSb)ºœô»º±[º¡Ôº»*Š»ˆT»k›»‡uW»qjÌ»V·\»l`#»l] »!Àº4½: ^:ñçY:·:!œ :¥¤°;f[ ;¶Ì;ÄËb;®ç;B;‘á„;^¥ý:Ä?˜¹„à·º‰ÏºaRã¹l±9]³Ô9}i 9çQš:ŧ&;>¿C;d3Ù;YÑ®;L?Û;*? :ÊF»9îI¹Jzñ¹‡Ë¥9¢ª:²;©;ýg;F¿ ;VxÁ;?/;%D‹;E«D;‹%O;³ò“;Øx;õœ‹;ù·æ;åü;Ùh;ëê£<ÁI< }!;ô«;¸‘©;…´£;ew~;X·T;9Û=;"H÷;¼–;«~:É0˜:­Š¼:¯u:ÀªJ:ü¦Ì;!ô¿;)ÔK;–W:çaÀ:9Õü¹ÓѹÝz9kùj:”“:ïßÂ;,¾;*…¾:¾Ñw¸<ºTù|ºä8 ©Å7¿~¹òκ„ź¡ÿ ºO»k: ¶; /’;P$‚;}'(;>ô;H‰¿:ÞªÆ:'xË9˜<è9ŸšD¸ûµ©º`°Rºè/̺Ù\Œº%ˆ ¹8ˆ¢º„2Ö»!9{»^hÜ»a‘<»Aœv»ƒ-ºäG-º´áܺŸtº…§º á×¹DGQ¸“©·ã6ì¹’@º9ôdºˆrmº‘Óº”ºê”ï»FPÛ»† »‹aß»tœ­»o+Ù»~ †»Tá7ºÚ#9š:Á¸×:̾,:a…9/³:ø#;—çÕ;ËCi;Æ„¦;®‚";œ¯=;„Ç;% :2 v¹ø§äºçB¸¦¯09Û„µ:Óî9êM:š?;/Ð;tnh;~u;y˜ß;c‚Y;C×:etk¹l¶.º'ÊK¹vå:eáÿ;wZ;9ë§;Tœ;Y×8;Mö0;W¾Û;„ï¹;¢Õ÷;ÂÈe;êFZ<+×;ýB³;ßò;ØH™;õ¸î< Ïo<1);ÜÍÞ; &;}as;pȾ;ZIm;5·~;‡|;1~:ùQ:¢ïæ:©C¹:¼¯:Ûu‚;äk;»Ç; Ýv:û¾‰:¯M9£™¹ð„¦8ø¬:“Ð;¬:;%´o;)#·:ß¿A9 ù º¡µÄºÇEõº»”ºìº37ðº~ì/º­DºÀUYºKm:Jâ—; ‘;K=3;nÖ;Výp; ’m:|ç˜9«^†9€Ñ…¶‹SºÃhͺàDºIÃ79°Z.9»?»ºT¢n»|3»7 §»0N±»?ºí·Üº³È캓÷Ûº£–õºœö˺5¾¹V#½8î_9är¹Få9º,Sºnøòº„T€º¶Vµ»"H×»x¾]»—c˜»“xÓ»…¹±»…LC»xžš»(㬺_™:0s :¯!£:,ø¢¹¦°9Í[É;E=å;µ4½;ÎÅT;¾Vþ;§0;‘S;\,:ß·T9˜àF¹!‹9aW:5s:H –: h:Uâ{;ÙU;wjÓ;Œm;Œ{B;‰0«;^½W:ö†š9êPµ¹Ä?e¹Ó.9÷dŽ:ã¯;-‹;Kφ;]^k;eåÄ;nÇã;†S;˜ ‡;¨àÊ;Ɉ;õá˜< ¹;í Ç;ÌP ;ÓY];ù$7<È;ò¿I;¹ø…; ò;ƒV";€²¿;Zðß;2µ ; ðÖ:ÇŠ4:žT;:¢ªÐ:µ„×:ÉJÕ:ÛÊx:æn:âÎì:ã@(:ݶš:‡ŒÛ5Vïæ¸KVJ: Û;Þ;.‚%;"Œ¹:Þ©£9†ܺ±‰À»ˆ »ÎWºÀ¼0º¥Ýả➺·ºèx.ºéMº50@:UÉ:óþò;*è-;73ª; ñf:ŠŠ(9}¾8†ŒÒ·Ï¹jº$Cgº—‚UºÆ¹uºmO¸9°è :‰ãž:wyºAYºõŽ#» ŸSºÿ›¡ºÝŠÀº°Z²ºñº‘¸ÑºÒð'ºÁ¨èº6ˆ·fò9žö%9W¨¶¹ ¾åºøºp'ʺ™ì»ñ›»XÍn»–‡½»§Ùd»œjØ»Ž˜¸»…aj»U Zºçù† f:@:2gô¹•Ÿ¹ùX:«Ð>;…ð¼;¿7ƒ;Âó ;®] ;˜’;~¬®;/ž3:¢¿§9òx:&ï¢:’•Ö:œÛ:8¤!9ÿ¼6:Ïþ€;a…;”g;˜ê;•ÌÊ;‰?i;IÁ°:ØõZ: W8Æ09Üju:Áƒ;!-ˆ;E¹;Zîq;p“;Ìb;ŒnÉ;—Ýá;š§;¥Î—;ÍFX;÷Så;õÛª;Ìã;¶%;ÍgG;ñA˜;ñvE;Ç G;–m;†©6;Ž5Û;„H~;V°ì;'(`:æ0Æ:¤`:£šU:±Ô¿:¾¯˜:ÄVà:³§à: d‹:ªr™:ÔÕ6:Ñü¶:G…•9Eò¶:‚¨4;ÎÈ;FÇ(;- :Ù„9‡È¹º²+»+À½»="»ý6ºÿ@ºìo~ºäÿí»|È»$%V»q£º5!§9òº±:š¹õ:ÞO¾:ÐI:aV8±å¹ƒ«®¹6y¼¹ýÁDººŽŠ· ü¼9â ¸dfµº-ú9ÜØ;Ïx;—üt;¶ÐŠ;®“";™*«;…ö;\‹\;ðO:¦IÒ:—3”:ÙÒ:ñuŽ:¤²—9ún:TàN;'X2;Œ=;žæ¼;›¯û;“Ù;€ß­;@V5:úµX:™.:jIå:¹b)½3LݽÒ¼ÅÌ»üp:J²k;9¼¨;°bV;Më:Â_;ÜWö<Œ2<æa›=½…=á= œ<Òxh<ɼcþ¼ßNļô;üñ*ç¼óƼÁC¼»Ÿ6è<–&¢<ÏÕ><5¾Ä»±A‚¼B9Ÿ¼M64¼7 å¼Å}¼9_9¼GA»4ï·<|˜<ÙÌ$¼d9ž¼…´7¼¢!]¼´Ö˜¼˜8Õ¼4Ý »ˆJº–àpºôsR7îj®;Îå”<Ô;x<æVö<›ón»Óѽú½üw¼“è»ï,Þ¼Ž¡õ½0ؽ¯¼£™D;ñ6~=Õ?=71ÿ=Fp‰=/­Á=G×<ßcJ<ó;=% )=I=SM=YÇà=OE¸=Œz<˜g<Ô³=Oµk=A§K=1€<ªÆd<ýD<Ǭ<žàV=ðÅ=;y÷=R ¬=KÍ=4°=¥q¯<<ƒ ¬<½7<šCJ<¨–é<óx<¿Ð:<4øq»eû:»ÝL‹»(³ZºÝDº»ÎPô¼ ÷ó¼!Ž³¼ŽK»ÓÐÁºŽ9¥º’¿»?6ºã%¶º—T\ºÉ; á<D<#>p<þ<¾’;Úm ;Ù&J;Œa5»8îï»×™;Ë’…;ÚÝ»ÏMà¼= I<Šå=*×µ=€‰]=Z4=•R=–'-=#J=-T@<Õ¼B<½ÝI<çÄ–=E4=QÄI=n±=_c=%‰l<±F‹;gùºç)¼1(·¼•Ë¼çH;ö×N=Vð=4ö=2Ü«= 8¡<Ú <ÒH£<¼·m<= <„V«;óˆ99ëxx;Ñú[<”&¥<·&<®GÞ<ªˆX<Ëßî=6„<Þ+z<2M:Ú;{Ä;›µEº†ÝH¼F¼'h¼½=¼ æÆ»¡BØ» T»Q×~ºóC:÷]û;2’:• á;–8b;úX};àãa<;ÌÇn;yå÷:¢'ì:¨Û„ºZOì»ñvj»à³‰;ÔNã;©;#ã;ÅXm9vĈ¼VºF¼¾ܼ¬^»¡°q<–Ä#=ºâ=2œ)=I3=<íû<ù…³<  m<ÀOÆ=´µ=G=,¢=üò=5I=,Íh=@D=†Ê=ï<½À_<€Vi<Z<:¶&é;Šc“<“8ö<ØMÉ<É÷î<«Ï<­¿O<ð#ÿ=˜¹<Øte=^¹=yuŠ=b2j=Dé<| …< ¸Ó<_?h<˜K»<Ù>h=#«Ê=H‚Ð=+‰<ÃB ;ý»¬º¦D¾»ö“»1¶;#5;C«:ùr¸<´ü<–mL<›û;±y]»Õ¶“¼C^—»Àqô:¥"]ºp¿r¼"4ñ¼o·¼=eÁ¼B±¼Ïš¼K€2¼e£³¼5«Ö»‹í;_²V<[—<‘A <Ú² = Ð=x`<ïZ_=}[=&¢f=ªÅ<¡JºñG; ¾§;˜Êp<0ð‰<‹®<š5<‡‹,¼Î?¼ñļ0ÊQ¼FéÓ¼PJ ¼JãF¼=Ž¼+U¼ßú¼¯»ðb»èk´»ãó—»ÞÇX»Õ·»Éã±»®ìÊ»{ãž»#ŽËºô,{ºf¹òvX¹Þ¯¹ä¨ˆ72U!9¦åw8Æὺ5,Žºß“ »–¦» ºU™(9¾nS:´Œ;+ë;RüÚ;l¹Z;\õ;0Ö}:üù°:¥Vó:dÌ:†Ôå:µšB:”®º!šI»c·Á»Ç½Œ»õjļ4l¼¤*¼¬±¼G »ö´ˆ»òƒz»ð°a»á|è»Ú5c»õán¼ ü _¼¸y¼¼Ô¼ ¶•¼"br¼Ì̼ùM»âÚi»Èw™»Á^J»¾4¬»©ÿø»Ñ»‚|‚»o:лAÃË»½ºâ÷{ºï8ªè_:± é;);@æ,;9€r;9<¥;j­+;“  ;§Ì;¯¥.;¨Èæ;™&°;”œø;œP;” ;—€;†»;@¢^:ÍU·: 1;“i;l :ËæC9”Ãm¹DêÆ9—ßê9ò柹±ÏAº± ºØ꺇Ö9“É{:â ‰;&£L;µ:ÃDã:Y³·:?B¢:¶9`kf9{9TÖ¸º2øD»ÍÖ»x»›nŒ»Ç2&¼w¼ã²¼&®0¼-Óy¼A“¼R° ¼U²O¼Llô¼< +¼(§4¼¢ ¼Ó©»ù#c»÷uû»õ%a»ëé·»ÝÑ »ÈÝN» zƒ»\¨É»c•ºö¥€º{î¹Ñ Z¹²´W9Mno:Q[\:1¹¿¹-›º®Ä»z#»Kº‰ÿã9ÿß„:îCè;5Jô;[?5;mî±;e)";@’L;ÖÞ:Ĺø:ˆÏû:‘­¡:΂h:Û-:˜h»¦B»­ŸŸ»íÑ»¼+³»ûíÆ»÷^r»ôî»îé»íè»ò}Ý»éÛ¨»Öú»àv!¼讼 ‹ø¼Ž°¼Ùr¼¶¼$k¼ÚE¼Ê·»ûr˜»Û´T»Í8j»Íé »ÃXb»£º»ˆ\µ»{Ò »a¼4»>Žç» Z’ºðºfo9Ú6:Ʀl; lþ; );R;1æ€;x¡;¡| ;¿¦Þ;Å;ªÚ=;‰;|7#;~õž;Qð;iH;i&;¥:ŸŽ±:°¾b;6;3Ñ:oWø‡¼8yîc:2ºò: Tƺ ꯺Æf]ºÑº+Õ²:vq;7 ;+¨Ç:ä8B:'«Š9©»}9èË96 R·=ØÒ8–øI¹Í|âºîóH»b½æ»‘¤€»­Ü»äšæ¼mò¼* =¼/†:¼:6ª¼Mè¼Yl ¼VÏl¼IÞv¼6ôø¼"¿£¼˜¼ž¼¼žë¼ o¼ûðrP»Ú;Ó»º‹Ç»Œ¸*»I˜ »%ͺô@åºkS¹èýB9¥ý:”'Ñ:µi:àøº?¥Øºí¬—» vº¦‰ÿ9Ž†Ž:öÔ’;L68;r0;x©;qø;Y;0:ýÕ:ªòL:˜}@:ÏeT:üX.:®Q º`[÷»„Ý»Õ\&»÷‹»öD»ëƒ»åqö»â;»â§»êY»íxV»Ûg—»Ð‘@»ëä6¼+=¼ë »ø=¹¼d¼ŽÃ¼ÞB¼#¼‰É¼t®»ó4¡»ß-»Ý„Ù»Ú÷J»¿dл–ê»{°g»hõm»T,»AšÇ»&½ºæÛº0:Aíý:¬Ÿ›:Âb„:ˬ:øá;9 ¾;…ß ;³i ;Ðïà;¿÷;;Š‡;CŽª;5È;=Öo;Wlö;tœh;^{; {„:¢¦Ô:æã¸;à:Ö”Ì9ó™˜8Œ›8:$¤:¾ë: ºžº5™ºÆÖRº±…c¹C2?:¾Æ;;΋:SO¥9-ø9¿+Y9ªœ¹DÒœ¹œíú¹Üʳº¾‘o»MI从÷u»¤hÀ»Æ»M¼’£¼#¾½¼1ÐG¼6¶ ¼D¼TŸm¼Y¼\¼R¸#¼B”]¼.ã̼&ܼsH¼±á¼Ú¼ÊǼb»è³š»Ë"»¥Ì×»wr»D‰».¼Ìºõ·ñºxE°¹&;ž:æ‡;<®:Ã4+9þ º‘Š¹º×ntºœÑA8 ¿:̵;DèÎ;~S·;ƒ‚;{Ò³;q a;[ìé;/¥x:ïb¶:¬R:ÁðÈ:ú×:å'9’èÉ»#ït»«jÔ»ÜT»æÁ$»Þ¨¾»Õ¨K»Ò¬^»ÒàC»Ùë.»æ’Ì»á@D»Ì¬C»ÑçÏ»õÆ™¼z~»ø~å»óÅ˼«]¼ÿ§¼¤%¼’l¼8*»õüI»ðÑ»ñ ²»ÞÓµ»±'Ë»„øÊ»a»Q÷S»M|¡»E~»"ºXº¸£Â·è¿¦:9L*:;Ò:M4ˆ:—»:÷Wº;A ;ŽÄ¿;¾Ô‰;Èò^;•â;$-e:ÖÄl:å/¢;?É;Q¢t;~›;[ö;xô:Ï ;j¹;5w:ª±:½ƒ:2Lv:®ÅŸ:´á9ôpaº9HȺ¯•Rº‰"a98$:Ê£):ñ£:‚ä>9]"9€íÞ:Ǹ-º2{<ºBnº©4P»8z»5/»§P·»¼Ž»æÓF¼]¼.H´¼6µ¹¼;ûd¼Ic)¼SÛg¼S£b¼IÏ´¼9 ‰¼&Ѳ¼ÐT¼Öê¼RܼØê¼O,»ùjº»×̤»·5s»èT»^4[»GH‘»6W¨ºô°ãº?â :8ü;Ÿ ;•ñ:˜ÂD¹@„κió£ºCHù8âš:£Öô;$ Ü;k=;ƒŠÏ;~á¹;zÕê;€”Ë;nl6;3lÙ:êåB:Á­ˆ:æ2f:óGþ:ƒ lº;»líÞ»¯{¤»Æ?x»ÈÍ¿»Âõ€»¿d»Âu»Çë»ÖWó»áÒ»ÒÊ÷»ÄSÚ»Øt»øó‘»ýdw»ò¨[»ùøÿ¼ |¼„ö¼DT¼%ɼò7¼¶1¼êl¼@»ü//»Õ—Ô»œ„©»fÅ»D–E»CJ§»O »C Q»’ÿºn  9"ú€9Hê8 -ì9ßRL:“‘²:úG;Bã;’ýE;¸Í; ó«;*œ¾:`å÷:"£ã:ŽG;ÁÑ;aÜÜ;ƒöb;Iµq:ûu;¿M;8·ë;§«:±²:ŽR]:Èõ5:ø3:Ä9ýÈ º•»Tºg 9^«q:Ši:^ ú9<þr8Öî:.pî9ÌâLºA™Ýº›dº®d»!fu»‡|»¬…°»ÁŠ5»ÙØ`¼ú×¼"«¼4á%¼9ܼ>Q¯¼GÓ…¼L+“¼IxG¼?ˆ3¼0áÕ¼!9¼¼$13¼)23¼Ž¼U¶»ä­»Ã»•M6»£P»¨Él»¨c»¬»è»µdԻ¬Ի×a’»ÚA¼»Æ¿l»Ã½»Þàûø]ö»û(-»ø¥¼¹w¼ D¡¼Ï!¼V­¼Åb¼ ¡$¼ ì¼ È9»øß_»Á€v»†Ð*»G^ë»2êß»EÙ»»Rî/»9”lºñÝ¥ºd÷¹Dƒº;V¹—±9ÿwË:™:ì`h;=½‚;Œ¨—;š ò;I‚”:I0‡¹LW³8YP:QÃ;­=;n=ë;v‰X;* Ä;Ïõ;BÃ4;Oö; :öÃ:ÿŸÍ;Ÿm;Ž:Ô#V:(ep¹ØÒŸº–d\º§à¹/MÀ9U†ˆ7楷YšÈ:;:3êã¹Ù̺¿ewºÊKƒ» ë¿»sÄß»«'†»Éœ»ßù»öö¼¸’¼+QÞ¼7€¼8ܼ<.ȼ@T ¼AÙ¾¼?_÷¼8Y¼+ ¼ Cà¼%¼/hý¼+ù¼Bæ»øNÓ»Îo»®ô»‹ÖQ»Wöì»DÞ˜»HÅû·ñº5î):¢ðj;/~Þ;-U:Ékä:1ÌÆ:"ƒ:“<:áÄÐ;0ü;!¥ñ;GÉR;^F;_p;xâ„;™1 ; â¢;€c;.®Û;s2:ú+:Ô؆:-¼yºF“B»Kr»7 G»_Ö»‚±m»‹aý»‘{»ŸWc»®xï»ÅÃä»Ùß »Ñy‚»¾>ջő]»ä§»ü󞼆˜¼k¼ô¼v˜»ÿk2»ü„è¼ëh¼ 1Š¼iá¼uܼ : »çö’»©+»kˆ?»6ì»7jõ»Q§»Qxd»-Ñ“ºBºUÐÿºbç>¹F:)ä:ˆ®À:ÐT¨;-æ„;r[;Yâî:¬¿¤¹½vº0r¹‘/ð:8;1 ;`Óæ;H„¢;…w;6Zh;kkÓ;`ÁŸ;<9Ñ;,ó;/ºÐ;0æi;#3J:ô¡":P‰ºî#º¼5zº®€ºIŒƒ¹øŸ!¹YˆÑ9w:tM¸]㊺·dºëÓYºò‘D»HJ-»ö»È˜õ»æ»5»ø„ã¼ñ缯w¼/Ä#¼6õ#¼6•¼6E”¼7Èè¼9kU¼9/¼3ŽÚ¼'+’¼%R¼0,a¼3Ïw¼%×Ò¼ »Ø»ß軸«¼»—Þ»g:û»7w»5í<»(øº­&ý:B‚;®Þ;2×r;ç:Ö::„P•:Ë1É;¢;!Fv; S;1y¢;JÎ4;R¸™;^Lì;ÓÂ;¯%é;¦&Î;xJ–;8—;øž;;²:ššï8ä)‘º5—oº‘7-ºÕ2»!Ä#»O)i»d½3»‚½¥»—^w»®«Ú»ÌÚǻ׋.»Æ#Å»¹Aî»ËuV»ïM§¼ÂQ¼c®¼¥f»÷s¢»ñ‹+»ùb^¼?s¼—)¼l¼™|¼i±»Ï•G»•[B»]T,»=i»JwS»Yü»Qðz»,[¶ºÙÎöºš,¦ºªºF:™8Ù±:à :E:È:¨Í;·_;:lé:ÿŒf9/ƒgºUóºnà(º ÁØ:ˆ"; iu;8D3;UÌ;Äž;`[™; ;sÍ~;`>v;S¨Ü;Lææ;L°`;>ÝV; 8:;YºmKغñÃbºÜº›6Ѻ")º¸ZüÇ9Œ··àr¸º™Œ÷ºû½)ºé`»Ic»„qü»ºg»â…J»ýI@¼¤^¼ •ñ; ¿;A×;\O;y_‚;ŒM(;—"Í;Ÿ F;@”;’‡;Ÿÿ;Ì\*;éw.;Òk;¨eÐ;£Ù†;Ä)ó;Ùh›;Ã`–;–m‘;·C;Œéö;•kÅ;ÊÇ;LâA;;»:šæ:ªŸ:¶{N:¹y£:½›Q:©@]:~wS:oM:«Ê®:åÄd:ºýS:6¾¶:$`;CÑ;Z4w;IÍ÷:õ©Š9®HXº«!Ë»2¸°»a”f»OO>»)%E»aλ“<» ƒý»Iùd»XÏ»ݾºqx¹‘Pú9~lK:pß9 Á¹–úɺ$ó!¹ì(¯¹è¶·ºd´õºuiº=TË·&â^:O<É:žÏ-:„\û8¼Iºb<ºt?ºU¹ì7³¹È ¹kk{º;)éºë 0»“ºx¯W¸n³"9vl 9™M~98ï깯5º|èpº¶?—» ôü»_ö:»¡¨å»¸7?»¤cl»ƒ@„»Z×¢»0ºÙ§Iº*B@6–ó8/L¡¹ÿn$¹Ûåi:~œv;GÃ(;—ìó;¥u;–¬;Á;iJ­;Jˆ|;#e:ëK³;Y{;*® ; òß:‚ù´9Úƒð:´°Ž;Z=„;˜ÿ;!©;”"’;‰Ü;wÚÂ;L{p;^à:é5Ž:Ö(í;‰ƒ;>®;at8;‚Óš;˜XC;§;­gò;«eÇ;•9v;‚é;˜3;ÃÐf;Í`Ö;¨;a;‰L;•Ðƒ;²ˆ?;±r‚;ŽU!;dó`;yÖÖ;–X;•Aâ;y4ÿ;>g4;Óî:¿÷Î:½¨n:½ž:½Th:¹—:‘~Ë:a[¯:ãº:Ú²9:ë±ñ:¢Ë_:•ÓÚ; 0,;Z!;c”;!:2?ƒºˆ ¯»)û»oy»zF¾»SE»»7gŠ»3yh»<£[»g€Z»‹i»}äÜ»'6ºÔ³¥ºñ®ºW„˜º-g¨º]ð纊ñ¨ºVÞ º q7º8Ì º,lÕ¸^¶W: ñÏ:[S:b#{9òMR¹¬¾/º*a¸¸ä$9žd9_89¡W8˜ñæºzæºò´º¶¾¹Ïø·Ö†Ÿ8$!D90ÌT¸ «%ºDv&º´Š2ºò\ï»2d+»ˆó[»°ôC»©,»zt»4©»§+ºí®º…ÛʹÇy›°¹“¤£º;8‹j+:Ëáp;V@ì;Àè;‘Úh;yw;Zû;\QK;MRv;*´á;2‘Ô;WzJ;Ngz;W¹:;ù:¢ã:ü4Ô;w8D;•“Ó;äc;…QÑ;‚aµ;{n=;[e";0 k;þ¯;s×;/.â;`çú;ˆÌÊ;¤X³;º@ ;Àái;¾€†;¨‰4;Oê;aS_;¶J;´xŽ;©%;€Žû;eTj;‡+Ã;•q·;‚k;K8Š;OѤ;‡”7;›î;‘¥;lʹ;.a :ñÛ6:ÇŸ :Ä!=:Ã1:Îè>:ÅŒ:G^:œ³Å:ؤM;mù:Úá7:¶ÙY;Úp;N6ý;hÿû;5òö:ŸÑŒ¹÷ŸÎ»Yš»_/»‡!L»{Å-»SÈ»J?&»U»{<»žwŸ»¨ëb»ˆKø»A¢Ò»]?»¬~ºþÆÙºç㙺Ûeĺ¬ËºGw[º1‘2º`_‘ºcèü¹€Œ~9¾êD:’`9æH¹9¬6ì¸V¶‚¹âÏ0·¾;ˆ:Jv:}ó&:k<):Bú6©N”ºŽ:Áº±æº(ós¹w8(¹»B`¹†Ùʸ·:·º þpº´k•ºý%¡»lZ»aÕø»ð˜»§¯Ñ»s•¢»žæº¿°Œººp‰º‡mDºØý¹<‚‰¹Eï º1ͺ Ï9ÖQÌ:ðþn;Z³;†w;x˜m;J¬‹;Kiì;hi¹;aø•;XÅ;wRH;ƒZr;OGœ:Óïú:ú:CY;œQ;Ε;‡ý ;yG©;rQ£;€Ûä;zwÛ;VF;'ÉÆ;-l;-=;KN=;ˆd±;«´§;Êü9;Öûm;ÓNô;ÀšR;‘4â;AÀ*;C ¾;‹xÜ;ŸS-;‰u;?Í¢;BkÀ;f"Ê;cìw;;ê;3ç;hÒ4;”ª›;›ÿ;ŠÊt;\ ;½e:áì¸:ÅøS:Êv…:Þ™N:øÓ:ç.ý:ˤu:ëµÑ;G ;¼ë:ײ„;];EÌâ;eDù;AÛ[:Ùm9?û¨º£2ü»/7»}­±»ˆþ»p#+»[»)»hVÞ»„⬻¦Vÿ»ÃK »¶™»ÍÚ»ev»W?»RY‡»BM¶»(­»¦Uº£>ùºZÙ¿º{í»ºSîŸ7~ÈŠ9ü98T~·±é¸e…¹wŽ¸vb:Oƒx:´˜±:·Á:§ãl:Fßq¹0UºPÓº—¥¹’U ºn º]Ú¤ºjEºŒJº®„2» Š±»(Óÿ»MRÒ»ŠH7»¡y¢»yÍqº×®‘¹æ *º´yº4¹°j¸ªý¸×ÌI¹øµÞºY÷Ú¹ìD£:#:ä;ö";^éË;v#;Mב;6K•;^þ;‚Âã;‚Vû;ˆW<;”CF;‡üý;6 É:˜˜Þ9©ß¹:Ž££;:ÿó;v%t;ksÜ;Y/@;i&Š;zá;dçÆ;9ž«;rŠ:ÞvØ;‰;sü*;§ÓR;Ñ¡7;è”f;ç w;Ö s;ªb«;Pòÿ;*;9 ×;‡ !;‚Up;6Ác;µÃ;!¤;6_ñ;/±E;,ŽW;T–;ŠeÄ;œpÌ;—Á;€ÞZ;CØ‘;:Ë!â:Êè|:çµ ; wÌ;Vò;:L;F;Û€;ç#:ûNÎ;ÑÓ;AtÚ;h¬a;J"Æ:÷Ѻ:$¬×¹õP`ºÚ$»GÔ4»‚H¤»J»g\’»s/±»‹ëyU»Î>»×Øc»¸½Y»”ÈÇ»†^ö»‡·&»†0Ú»nÍ­»@g»˶º§/´º 3º«žºÒõíºG´¸Ÿ›¹Yÿȹ¹Q¦á¸À™­7ð?: :´KÁ:Ô˜¯:Ò¤:¨AÊ:¦¸7x¹KMà¸Ýù´º EÁºœ¤æº©qºˆÔcº³ìe»Ë»<“»U *»€½1»š¿+»†Ïªºçs!9‰E:¤ ¸sG ·óX9|I9&½q¹‰±¬ºjẉ½2¹­šé:z«L;)(;^ÖM;Y‰?;7T¥;JÂ;„¥¡;”~:;—-;^š;šjØ;wÖ"; $2:, 59±,¦:ÝäD;O×;cJ1;Mém;J;c´ˆ;aáZ;?å; ­X:²o‹:Ä&;8jß;“¸”;Ç0\;ìMw;ôë;åÎr;Àt;y•‹:èzŽ:ÇEb;Añ;tòÖ;<ű:òJ:ÛAÞ;c¸;¬;.4;XN;ˆ²°;›‚Ú;›u;ŒA@;caö;"ž:ÛÂ?:Ä!È:ê:; H;$û¬;8¥;òÙ;™~;)ìh;vm;üå;5úí;o8Ë;]³ø; ƒ¥:Yí7¸c¦*º\®»\„»Tî»sü»gË»p¸ð»»¬Ö\»ÐòM»é÷Q»Üµt»¸<È»ž²Ü»šÊS»žÚ6»–b¢»~jl»@&n» 9ºÚÊ ºì0ºé»hºS1¹ð½º' n¹×x²·n·89G¥à: '_:š,:˨ñ:Öôù:Ì2f:‰÷ :>¿9«ÓË9‰ù©¹r㹺—_ºâ+ºÙœº×9»K)»G\&»d÷Ø»FN»—]«»“Ë·»!Vz9ƒù3:¬àà:;9˜ST::&9 Aøº"Tÿº£ºº‚b8Á¯:¿¨÷;0z&;St;Ewž;E‹a;{ã;šø‹;¥È;¦É;¢IK; ž;H% :²÷9„Ož:Hl&;•ø;YÛJ;Tc£;?;;F¿/;Rû;> ;p:°Z;:gÖI:ãŸd;býD;ªXÛ;ÚÅC;ñê·;ì&Í;Ï(;’h³;›6:&\Ž:Å¡;EVè;?B:ë¿i:žHR:©Ô:ß²Ž; Ç;`Þ¿;±6;¡™º;žÒF;”;x(a;9è!:òÞø:¹¶:àk; J;"”Ú;$–w:ÿJ:íéÊ;¡Ç;#ne;ÿf; 0;;eŒ;s$£;'ý:‡ U8ØGº ] º¦wÍ»™»Qó,»X —»a_À»‰õ¿»­²¢»ÑL»ïf»ôò%»Ú•h»º»ª[=»«3ü»©1»˜,È»yͧ»:ƺ»v»¨®»Ž¨»,úêBºtºRv·º,㸙ÔÙ9¿¼˜:& 7:ˆúÇ:¶cE:ÂæÓ:Ê”O:²*f:uJÊ:B:0åü95áǺa–|ºèvûìл.@»p»F ª»kÕÙ»ƒ€»•Î{»îz»bœº½:Ä µ:¸WA: ¢:+‰œ:qUI:%B:¸°„ ºtߣº ¼º´#:?,À:øá;1ª;Cø;I:9;nñ;–¨;¬S¥;±b,;©½;–ä;m¡€;7ø0;ëŽ:Ø×=:RyL:~(E;2/;‚¤å;µqÖ;Úå;ãš';ÓgŽ;£º6;*û9¶íÙ8Ú‡%:àÂ#;(,Ø:ìoZ:uT:OLü:‘Óð:ü ;RðÔ;“¨à;«N°;¨C;”YV;€ÆÇ;Mq;ße:«x}:ÁÐ;ÛY;ôþ;à}:÷1l:¥Á½:ݽÓ;Œ8;i¤; QŒ;@è,;q };B×:²º=8§4ïºþ{º’å+º÷Ø»0Z²»E A»M}Ä»{îl»§(o»Ï¼»íwj»þUлõv^»Ø軽ç»´ «»°vÿ»¥|½»’W×»nÙÊ»?Ð]»7„à»=µ¾»*´NºÖힺ‚‘ƒºUð¹ )9¾ÛF:DF#:‡J¿:¨uh:°­é:µ:ºHÙ:£§2:‡s—:xº}:†ô¹ü·ºÓr±» ¾%»¯4» ’Ä»>I¦»dñ»=.»‘<»Ÿ¾Ð»#Ѻÿîˆ:TF4:á!Ç:{¼:A[:€;D:†g:Cü¹’\ºo½,º5Ä^9šÂÞ:«K‚;Tr;#¢+;;î;_c€;‹ ;¦fô;µ·;±U;œËä;I!;(ï:€Î-8ÇY:BY¯;( ;^ÝÔ;`÷ƒ;ED‹;6 a;0ª-;(8; V:£â:W5Ÿ;íߊ»0h» õÑ;o¯Ý;[àç»(0ü<(õÖ=1Sk=‹…=•:=Œ/Æ=‡ò={?h=D%"=íY<ì'S= ¸´=(¸ò=Jé=p)õ=t¢×=›;=?2á=NFÉ==l <ßÙ,<%u;>•;[sÉ<{ü=Á=&ä<Ð0°:ô£È9ñ8®;bH&<éä=i²Ž=‰«ý=‚?.=vÎã=oã#=O—H=Y©<÷ZG=æ=äê=3 =VŒ=q[à=W®Q= 4!ç='b=Ò2=ï=È\<Ë@å¯<ÛŽU<Ó¼ÈË[¼Ó:ἡ†²»Ðã’<3óÕ<´îù<Ù9Æ<æ‡Q<±ú§<'²ºò ¼NÇÓ¼M<È»‰ »=ôì¼ZW{¼¥Š÷¼/i¸g)‰»ªÆ¼g0À¼JÕ,ºðS<'Å<œû#<¤õS<ˆm7=,d‘=/Ѿ=1Ö«=m<ºALÀ=F=3Å=@=ä=6O=k= ~Š=&ŠD==õË=)t<ïìrüh=,:<úo‘<¨,³=)e<"Uï»å3»‰–Æ<¤ª<³ø¿<Ý("<¯Iµ}¢=6+ß=C'<Ëß<‘n<#.; ã»Dtº´tr;»µ¼< -”:ÚFk»Å ¼ú—¼Øf£¼{kÜ:Ï Œ<X÷<=ÊT<• ¦<û»?=1Šª=Fã®=FÜ;=%}³<¢1º»:O¼#@h:h´T<±u]= {Õ<ýo=+xæ=3*˜=1ô<ÈæR;И¶»ý!M¼yˆ;¼Ú£<²%<ÓÍ´<˜Ÿ^:Ñ,d¼BM¼Ä3;‰@;ÃÓK»|¼'ö ¼Gl̼ˆ®¼—ª¼7æ º‡¡:nX»‰ç†»² å=½Ã<åbâ<\„";úAu;È©.»Ž­¼yÙ »óbú<:•¹<“óR<‚§…<£¸’<æ}=õ»= »~=ªô<æK]<‹z<%ù<5¦Š<„?[<ƒU“¼mè ¼è[:½ %í¼”TÒº¾ûÇ9¿Õï»584º”*<6é <ê »=!=o¥<¶ð<-”µº5à¼z‚»äq¯;Çi_˜úºÔ¨;ÈûÑ»¬R¼‹Øϼ£ÿ·¼²f¦¼Âµ¼‰Û»3ÐT;qï; ù*9ºïÛ¼ÙѦ¼¶Oػ뇮;Ò©§< l;¹“æ<. <ô|<ï <°®;áµ»à;¼@_üFº¸Þæ<3l<¹ñ.=-¡= ž=&·ï¼[¼0üþ¼4mǼ1„μ0‘R¼2x¼5U¦¼6¨€¼/6¼&I¼-<ó¼6 ¼/öà¼Ãû»ü˜ »ÉÝ» «;»v@Ž»2eš»óy»Ž™ºÐè„8•fõ:îKÓ;'z·; r:¨;3:‹w™:ÖJÆ;!R;@,;:C®;9±ñ;M:p;YÖK;W»%;y]/;¦±í;¼Qi;¡Ú«;{KF;Tua;/ãÉ:éA!:Bõª9(ø£9'Ê8?ÖsºG­iºí‡#» B2»Cµ»vDð»“b/»³›K»Ï2ã»ÍdO»ºé0»ºu»ØRL¼*¼ ¦¼ú켉o»üÿg»ï…ñ»òþ,¼­¬¼ ‡¾¼M;¼FC¼ Z»ðÀð»ºb»¬»e•6»S)»[e»bÒÛ»`ys»8’ߺ÷c)ººÇœº™£¯ºŸ£8-T(9T e9Ï5:nþl:ãî];S :|RX¹´vºŒ¼º›%ºNF 9ñ8:êÒI; &ü;N;:L¨;z¢&;‡Må;ƒp;uá_;e¼0;iÅð;uNv;X«p;DŒ9žÿº»¥×»ºèä º–‚µ¹äíZ¹¨¹ËBº–ÔºúóUºîJ8ºìHÌ»IV_»¡^»Ðé¡»õ7™¼W-¼c6¼ ’¼!ò„¼0ñ¼0§$¼-¡¼.h0¼1ˆ¼4¦)¼3”ú¼*t0¼)ç#¼3¬?¼4–(¼'༻åœÈ»¯ó¦»‚ÞÇ»4źõTAºÕ庻J¹¨Š:»Ž^; O; ›½:®É³:y¸+:·áî;àØ;M ;YÌi;W‰,;i;{Ÿ;sÉ;p,S;”K|;»Ä“;½]…;Ÿq ;Œh\;y.;3T¬:ºKŽ:=X:lÊA:¦ê:_£¹“ù•º¢ºôºúNt»5Pq»j’g»‘û»¶#é»Ç{%»¿p|»µi*»Ä´‡»ëꮼ.{¼ p¬¼IE»ùH×»óúv¼`!¼ã—¼ ç¼# ¼ çJ¼ÝÀ»Þ)L»¯À»‘eÁ»yµ»fÅL»gßË»z“»| m»C¦ºôź®ƒº”âº3î'¹ÍXª¹€á(8 Ȫ:±H:¶::¹µ29å–º̺ œ3ºÉŒŸºøâ9ÀEž:à :빌;¼ ;R±;ƒ¥É;Šÿ{;…Jõ;u1%;wéë;ŒÛo;;`dÕ:ä&±¹˜þ´ºáS¾ºÿ⳺ÇÏ/ºbúºö‡ºvEºÈìÒ»'4ºú·ºÆ»»€õÆ»¸ ö»ßÿæ»ú‘ˆ»úã »÷q¼ ›‚¼&þ¼/z…¼,¸¼,°¼/Kö¼1¶&¼35¼-Ñ]¼(£Ï¼/ ¼4ÛR¼-홼yo¼ ¿»Ì‚…»‘’ù»=ñHºÚž¸ºˆ®æº{Œäº +n:q8ó;¢;r”:·¤•:h':ŽöÐ:ýÉÞ;?¼ñ;h7I;u@™;‡7±;—^Á;–ýc;ˆr";‹çÿ;­¢;Æ0­;º);©ì;;£õ2;†§}; Sû:¨-¡:¬ê‚;Sl; O:Ÿ"e9¬eº9÷»ºÙ”"»+©]»\B»Y »¯ÿÏ»¹1b»µ…»»Z»Ø6$»ü°¼†Z¼ê¼õ¼\ûýçC¼µ,¼««¼ yÚ¼ ļ Š¼ ¤»þÍõ»ÓW»°H2»˜ñ¸»„¿$»rW{»$Ç»‘45»ˆ`H»5]kºÆ¡º©Îÿº·ôºª¡ºyIîº$Èع€þÔ9öM :¢Oh:ŠÉÉ9(¹~ºM‚{ºÓZºò!œº~Êû:ñ:½ìÏ:ë F; À¹;cD(;†ÅU;‡”à;xï;t9‘;‘þÙ;©x›;š'Ê;Q#®:—Û`º>½bºÏ¥‰ºË2†º•Cºo‘¤º¾&1»çì»$¥R»dº¿E2ºÈ?j»A;6»œæ'»È$»å¦®»ñu»ç±p»ñÿ˼Ž¦¼)Ï*¼+‘¼*)>¼-ý}¼0g¶¼0Ü|¼. '¼(‘l¼+ ²¼2y¼0ÎN¼%re¼V²»ó:»¯CÞ»\̧ºâñº4“Š¹Þê+ºµ9ƒRG:ò;X;X`:Óy:zêÛ:v²Ú:ÊUð;"á;]+7;€{Á;’‘‡;¬Ó™;¸¶m;¨©,;—Lû;¢š¨;¿–;Çêà;¾J;ÀZ†;µ|Ñ;€·Ò; ’™:á=9;0h;8m¦;F:Â'ï:#P€¹ËغΑˆ»Ȇ»M-»Š6»¢x&»­ ໶ ڻ˱ »êp¶»ý¬û¼0¼”£¼”8¼\¼ ¸–¼ ÇÒ¼³Ê¼|Z¼ ÂE¼ úI»ú¥»Ï·»³KS»œ`໇„»€nt»”#Õ»£‰§»‚§À» ƒº¦>­ºÞa»Rkºïò꺵²ºbÃ[¹ jc:ý(:]T:RRö¸ôBº™Ü»˜ªºökº4):g.:Ï-:ø;0m;o—©;ƒ8’;s0;d_T;‰Ê;²¬â;¼Rã;•ëí;,t¼:«£ºIð~º›~©º•…غ"bºæqK»;³E»Y%ø»9™vºæÂÞºœ)» 9ˆ»¯%»´2O»Ñï»âzã»àNλÚÊ¥»þ@°¼N_¼(õ5¼&ʼ)TK¼.ÊZ¼/(Þ¼,Q#¼'‰¼'ñU¼/1!¼1b´¼)>¼›ž¼ ƒÁ»Ù–I»ˆ!»>º3$¸ 3¹u÷»¹ŸzÞ:x°Ì;@–:ý/Ø:—§¨:ƒŽ:´ÐV; q~;CÜÆ;vî;;’"r;²¯3;ϳ|;Ë©";±6z;¦ÛÈ;¶îQ;Éj¶;É»;ÍwÔ;Õi×;µQž;f¬°;á0;0Cê;W6“;Ró;(Zï:øö:„D¥¹µ‚ܺÀÞ»Ô»>t»}»•¡ù»ªK»ÂÛ»ß;Ù»ï¼æ»ñ®ê»úмqé¼5¼ Üμ d¼ gn¼ ܼH[¼ ay¼!2¼ N»õäš»Ìm.»±N±»™q7»‡Ò6»u=»¬»§7»TîºÄ¡4ºÍþ»¡{»/ ±»Ÿ^ºÌ3_ºgÃt¸Á½¤:`Ê:¼x:jüº9̺Õy»írº¼¤°9£{:ª%é:Ô/w;˜];A¿;or_;idû;Sœ);pm;¨-;̺Q;»uç;‚1‘:òîã9r,žº<Ǻ\qºŒ”Pºì’ûQ—㻆r»wvm»%Ùhº¯1»ºËÜÔ»Q»¢þ‚»Ä0»Ô¾.»Ú_»Ó“»áMY¼ &¡¼"ñ¼"›º¼! ©¼(áH¼-`¼*¿3¼%á×¼$Á:¼+†š¼0t}¼+ѼÅþ¼u5¼DÀ»¿}v»]ý›ºž»Vfé» ’*»!U²»…ƒÖ»¶¤»ÌÄB»ÔðÖ»Ö›Õ»×"v»éÜç¼ ¾¼¼¼ᔼÏ’¼„)¼#Æñ¼$Ǽ!°E¼#bz¼)öà¼)ˆ¼ú(¼Hï¼t¼o »Ø˜»†­ºÁ™…9!Õ³9£…vº fjº„š:€ «:ÖdH:©Ÿ:Å;‰¨;<(1;ZW«;vò;RÖ;ªYÿ;Ðxt;á¬Â;Òçì;ÄŸ”;ÚA;Ë­;Ô$¬;ß²ì;îö­;é¼@;Ç!º;§Ö±;«à;´;;Ÿ¸;ƒM<;s}Ä;Vs:ñ1©¸øJº”vº«ÁñºÛ x»%™›»z-⻳­ð»âæ»ò7 »Þã$»Í³Ó»ãf7¼*´¼¼¼ ?é¼Ñ ¼ ð¼®i¼"¦¼'á@¼ ¼ÄÖ»ÒK»±E¬»,X»™¦M»±ò̻Ƕ»¡°4»4¯´ºòÿ»(¡c»ftï#»>nWºÔĺ9\ ¸a>k9ìBó:Àþ8÷ÙÁº(‰Ýº¾Ž²º­Ú³¹¤bj:4e:DŠ:K™Æ:³÷;``;!e;*ßP;]Ø;•Hh;¸?;¸Ú&;Œ—T;E®: 4:tFå:F¹øì/»ªÛ»x²»¢ÍY»¨-»¬¦»R`ô»Ò:òv:zË:VÁÑ:áŽ=; d/:ó(«; œì;I‡;G°a:ÜÕ 9^AFº>rªº±‡þºþLä»%5»;µ;»B­"»cgX»šC»Ç®ï»çéë»ûI¼ªz»ò&»ÖRлÁŸÜ»µ†ø»©!Ä»œaO»‹Ú»foj»Pšß»Vͳ»OÂL»KUÒ»¢0º²Q%º`ítº ÓÉ8ñó(:8p :‡ T: %ô:§ùK:¥L:¬‰£:³Žÿ:¤ž):‹Ni:HÌ6¸õû‚º¶i$» ¢±» »#0ƒ»68¯»R‚Í»rsU»ˆ »—Ÿw»˜ü»W&º•<:±ûß:¢-:Vs:M/5:™VJ:€yO9ß2¹iËæ¹í]=9÷ :‚Æa:Ƭ±:ï9õ;¯;>;t‹0;–>A;«v»;²ö;£ÖD;†¬å;?xB:±ôö8¶6ñ8Ì :Ì‚;H8·;ht;;Uý•;:þÐ;/ÚÀ;-*¸;)À];d:£KË:¯.Ì; ­:;GÉß;†|3;¦"£;³¬¥;¬ó;£S:¶ø‡ºm®6ºŸ¡Á9<ù:_ö½9¥O®¹…ôQ¸½(::â·X;Wü@;›¢;­ù ;¡E›;‡å;a¿Š;!3W:˜~:p™:Gù:îò¢;(¶:ê° :…íâ9CU:[:äÞC:ÞÓ±:¾µy;P‰;(~è:è²¼9¯ÜWºC賺Îó°»¼ »4Ï*»E'@»J•Ë»YÀ»‹ý^»º¿ »ÞàŠ»ñ^Á»üä”»þ§»í#i»Õ(”»ÀVû«Šs»œ÷‡»”6~»‚²)»bÅÓ»bõ=»dÆ»7wÕºòcIº{Ϻb¹—» Q%»„Ø»8«»+”»<ÍÒ»WÒO»w‚B»‰¦T»“Ïý»…:F» Šé9*Ç:›è±:-`&:L:né:¤À:€–¤: p9‘09‡‚+:gQå:«“ý:°ç:Å@e;<µ;@H;|­;–;¬;¤Ã;£ü›;Ž½";VlA:æ'9c@¤¹µõš: ×û;ÝÆ;Yø¾;YÈ®;?*í;2À;3*ø;= ÿ;0k!;å:×åG;ç;!*;Lâ;ƒïð;™‚¿;¡¡;Ž²›;s¹‚ÔºçKÕº§¬}¹©v¹©2«ºa㾺oQĹtã:[™ ;ˆ;sÁÅ;™yN;šEÄ;ˆ‘©;gxµ;,Q:¡âK9¹â9›{ñ:›$ê:Ò2§:Ñ€Ø:£˜à9Õó*9d Ž:Ž±Ù:Å&:ˆRú:ƒ :ÔºU:Çé¢9Á×LºBçvºÔÔç»%»Ý»N­6»\üË»a±`»fî黄.N»«²³»Ò:»åCÝ»îÛí»ù²\»øÁN»èI5»Ò(л´§É»›ÿÔ»”­»‹8‡»q8Z»cï\»mùš»`²ú»Rí»qº§Ž0º Šv¹ŽR9Ù‡:?ÿZ:8ª:‘ѱ:’„=:,·:Ò‚:°:Ž,:À8ÒÒº^/»¾à»"@Ç»膻°Ì»&s{»7»Xt»w‚»†绉 @»XªæºžQ˜:và:Ibœ:Jn:pÓì:²þó:² Ù:•yÎ:[É:*Ì:n À:¨É:¡­::‡.?: çW:üœ);>_º;u¬‹;‹‹,;”çÁ;°Ê;pB£;´ì:¡_º—¹ƒ›¾:ª£A;2l ;IûU;5{;(#Ö;2üÎ;FÎß;PòÔ;0ún; O·;ëÄ;ã;2w;]5÷;…èŠ;“iP;“æÀ;XwG:ižÏº´:7»ÂäºÏº¨UºÈÖºãh-º¡Ýg¹*$ý:–Ÿ;'´;qÞÀ;…Ÿ;|”…;djÅ;4áñ:´pœ¸èì¹ä9Áíž:‰ }:ûŒ:¥žõ:c›Ì9váH:ó·:— €:kÄç9²:>:r?9§¼‹ºD¹ºÏOg»$.£»\Í\»u¾m»{Ê4».>»‡ŸQ» Lˆ»Ã—û»×ýs»ÞÁ·»èó4»ôR¼»ñÊлä/‰»ÆT¥»¡(ÿ»‘;»%°»{?5»`àî»kf»p’»=bºëÈ`º= U¹rëlµ^Éb:Œ:†e :d:¹ :|:¾:ep¹:dN:g¹ 9ø&U¸ˆ%ú,”ïºèh{»$;»3{»l» {¾»»2¹Z»[Gó»sõ•»€½s»vX »#“¹üJÓ:!…É:¨­:b :¸Õ›:Ó•:Ëâg:¸y=:šÆ“:’RÚ:¯ô‚:³9:„E±:Q1¼:“2:õ ,;9V;`®Ê;u>î;ƒ™ù;~•Ã;Dcô:¢îVºzöºjÔÕ92Ù¸:ä d;%O;Eø; ¡­;A;@( ;\¢é;TPŸ;-«ª;"‹;-Šû;9i;SÜï;|ºa;‹;‘nì;ÌT; Í¢¹Ÿ4"»lƒ»m»"»6‰»"p»座á08.ÁÍ:À.;.ÍM;V ;T÷Ñ;MO{;6a+:Í–[¸‹5ˆºt¹Þ¼F9ÞÌF:5|:p!à:‘ö :<£9±Ü}:9-ü:W,\9>¹1±9 T9¨Kº3ÿȺȑð»J…»UÒø»€8?»‡wš»$ »“rv»ž¹ú»·õ¦»Ë`»ÏþŠ»Õ†(»ãÝ&»í8˜»ì>÷»Ùï’»¯^ »‘Û »a^»²3»_/X»b=»x¶F»m»bˆA» cbºœý¹¯Ñe·´.à9À*ó:~“Â:žFM:{W•:LyÖ:'ãÒ9øŽ89ð®9‹ð¹€jˆº#º¯"B»F&»uºÚéºÍ>ºóvN» ‹Ô»8Úß»cˆ-»r²(»t€º»P6LºÑ°ÿ8¯ :8†L:wŠÄ:ÂÃ:ï1 :ó»ƒ:ëÙ/:ÙMo:ÂgÔ:Å»ê:Ñ›Ü:­ƒ:m½š:KˆS:“³ˆ:þå2;0©`;D¥Ö;UÛ?;mû×;eiK;¶ 9Ž¾º˜>HºT’O: él:ÓÛR:è&:ÆŽõ:ÙÞê;f$;M.Ó;_‹Ô;FYI;/-q;:JL;LÍá;cA‚;‚-¥;‹®à;Œó9;‰³á;MÆ:ƒȺ›€>»#qлGË»V”¦»S§r»F»»¡üº”qC9ÞÚ@:ïâ§;(¶£;,+;&_{;%² :ãêÔ8Û–º”£¼ºŠù¹4L=9f‚9ÄxŽ:bC:Žé#:-§Í9è v:):¤9¦éܹžÁ¹ÝYĹl4êº#‡º¸ƒÌ» ”a»@ó´»uÏ»Š-\»’¬»Ø§»§'ª»´Ï|»ÃSL»Ä»Ä¯ »Ïù?»Þ<»åç›»ãŠg»Âm×»˜›ï»Ž<˜»ˆ §»ebî»Y|é»y<É»‚]Ø»Mpºõ=Ǻ8ι `9† ¡:faŸ:²Œ[:–X:2äÛ9ÖP96¸K#‚¸òrK¹ßr.º-ª²ºhÀCºãø» n ºÃÕº†V‡º§Þ.ºÜ&Ô»´»M´[»oô"»o—»[µÁ»(º,Âœ:Rµ:Õÿ:ÐrÕ;­á; W=; ^;Ÿ:ôîÊ:ì§Ë:÷Ë°:èIÑ:´l :ŒNã:ƒ˜j:¸fS; ;'C;,¥#;BG¬;aÌ;MâÅ:¯ºOHVº¹ðº"­ø9øê:múB:O™¬:Sü4:¼û9;üq;Jš;M‘§;8Î;;æË;XmÁ;x5[;Œ'œ;“;‹{Ì;… Í;lð; e¿¸t£ºýµ{»Mº_»~s‘»ƒ»taL»T…´»¦Rº6¹m:Ž".; y–;ÑÙ;IØ;&$:á, 9ȯúŠ =º¸àº7?ǹŸ\¸áê*9ž…ä:~Š`:4:}›:‰e:ŽZ7Nƒ$¹óêwº üº¬º›‘ºüíó»*:û»[ØJ»ƒÊÀ»‘² » O»°ó_»»Y»ÃŠ»¿Ù»¸&M»¾g»Ì|h»Ö8y»Ü©~»ÏØ»¥n#»„»ŽêR»y)^»Y¡ô»u®™»ŠßB»‚–ß»th½»*|.º¦oC¹Îà¿8ª¢:Ž‚:ôŠû;Lë:Ù^t:¸qÝ:¸þ:!9¡ºBÕº¹@ºŠ-йò¢¹á;9¹…IÇ:G»:›p‰:ÿQ:7*:7àM:ÁG·¹Ø¹û×ùº" ׺yóòºÚ©s»•§»?6W»m –»ŠKg»›Ž»³>»ÆÕ»Ëõ»ÄQ廲mƒ»¯èó»¼Ñ»Å¹î»Ê剻ËÌ=»²#R»”.^»‘bö»ˆµò»hgø»sû默š»X»R¢eºû‘JºEKs¸ðœ:‘:¬]>:æó:©ŒM9Û5,¹~ÆÙº4“RºmeKºƒ§sºŠJAº;Ÿé¹Ý^º{ºŽ³÷¹é¹3õëº2 µº§ÉUºýo»M|¬»}K »mhº»>@{ºì ä¹^):Îl:éPæ;JÅ;/d¿;59„;,Q ;"Ý©;"ú¦;*pô;2Š!;(´Å;n/;Û€; {Ž; ºÝ;h$;(c;;µ;Ï=;4‘O;I_@:Ýn,º€dºà³ ºË>Qº–/hº‡hºVl^¹¾v+9§óN:¥W|; sõ;+€>;:RÜ;RÎ!<æv<^XƼ;! ;gÖº;¥ÊÊ;¢õ­;ÈÏi<9^;×5k»¨Ù¼>+Õ¼¶Xý¼Õ‘ϼIü>:Dƒ»k`°¼o…o¼–Q·»ýÒ<'Ð~<—Pˆÿ;¬’q<´ª:g¬¼,$¼‚⎼l@«¼%Îé»Á ‡:ð;ì¡°<]R<žo<|}K;ïB»í{g¼i'ê¼Ó®d¼øã=¼Õ“–¼«Z¼„LŠ¼3ýº#à<®;]‡{»×2–¼>»ë ª;ø_Ô<ê{=FS<Á~Ù;…eU»³[Ž»Ëç{»j?l;%³9©† ;ú¬¨<^ëÌ<¨ù <áªB<ö <Ü‘×<x;º¦C’»æ½ž¼;8§¼b›š»”Ü…;‚Ç»¡o¼šö̼´pf¼Y¦¶ºÐ Ÿ9„»ñL´¼o¾v¼OZ¼ ˜¼T3¼šX†¼³» ¼¡p«¼#È[»8Ôè»ÝȲ¼9—”»êò;»»‘³º¼ôz¼R¬Ì¼A¡¼‹ÚH¼N1;5$z<*0?<Š˜<¾n‹<ïÇÐ=®<ÕA,¥= é¼}W‰¼„Ýɼˆ½½¼„ᓼ„5¼;ß_;Æž£;Ã×ô;Ð-x;ÃOÒ;Ÿ'È;ˆ)Ž;zûÏ;7t+:pº`m9º¹‚亲iàºôâ»A»–sÈ»Ð÷¸»ô«´»ðm»ÑÎk»Ì¾q»ìò÷»òlѼ¬µ¼ç5¼  ¼¤¼ ¯¼$5Ú¼'[¼%fæ;q;„-?;‰Ãš;”ˆ—;©”h;ÁçS;Í"u;ʈR;Í@×;Ñ~h;Õ(h;ß» ;ï#S;òï;çr…;Ù/c;ÖiP;ä`;âç:;î;Ÿ’~;ŒLv;dàÀ:÷Aï¹/á*ºÂáºÅŠŸºÎÓ†»˜»už&»¶q3»é.»úì2»äfz»È•ø»Ó¹»ïƒ;»õî¼I¯¼ ç,¼jv¼&¶È¼%ÝO¼#Íö¼{ܼ 惻íl »Ì½»°•u»¤žn»´p6»Çd‰»«‰»ZÀ'»ýл4ñ»pïL»ƒ¼œ»JßæºÅ™yº+\Mº ]¹¸CÔ¸F驸aüºô<º‡ªTºc¸e¹]–}7þ—Y¹¦ò®¹žñz:-:½:ð`;0l;zË2;€Ë;”h-;Œ{[;Qµ:Ö]¦:‚ZO:Åñõ:»ËN8 pºù%ò»b™»‹ÊI»š·»¡L:»›í¼»ŸÀø»¹./»Ð¿»Ù­»ào&»ã²ó»ã£V»í d¼óŒ¼Ô•¼?¼ ²g¼ ¾+¼ùS¼Úv¼!’–¼#ö0¼" C¼íï¼UH¼ FD¼ \‡¼s»ï离¿@¥»l /º¥,]9ž~9ãf¹†õì8äB:† €:–{:ÁsÀ;&Ið;j'µ;†å°;ŒÖ ;’7@;¡X ;´;ÁŸu;Åéï;Í%;Ø£;Ü÷l;á®2;ï˜;ô(‚;ç€;ÝÓ;ßN^;î#‰;ö/;â À;¾°; ¦x;…W¨;3ñÅ:YSɺ‡U¡ºÝAïºÑ䆻 bò»R¼»š ‘»ÑZà»ôÝ‘»òûA»Ômn»ÆnÌ»Ûy‡»ÝÈò»çAy»ë’â¼®l¼®!¼%†Ú¼&Ù¼X½¼ݼìz¼»ówf»ÐüÊ»³Z˜»«êj»¾4×»¿ý†»“ö»>²U»'lÍ»Z·»†y“»{K»¹ØºW«îº)˜dºb€º~>¹5¹ŽðºJJ›º|òžº o<¹CÊRº òºq.5¹­#§:E–j:·‘ð; ô‹;c_o;ˆß3;…f;~Ë;aW;Gz: ï6:ÃÑ•;Y:šÀ­ºC(»&l»dÀQ»„À÷»œŠe»¯âj»¸ô»Çån»Øüj»Þ]I»áõb»ç÷»èL;»æ¢ª»óXf¼%ø¼­ù¼ pF¼’ê¼ Èy¼S¼„l¼#Ô¿¼!”o¼–‹¼×¼ ìC¼ÿñ¼ Ç[»ôñý»Ïý{»›/»-tMº.LX9ãõñ9hwÀ¸µÊ¦:ñá:ŒúË:§VŒ;#û;QöÑ;‚aó; £;ÒÙ;œZ£;­fý;¸~;¾×;Ço;Øoû;åV¡;èEw;ï0Ï;ôßq;å;Ö¥a;Üòm;îƒê;üê;òÇ;×öd;¹éÿ;™Ü—;ebã:÷^]¸Z=¦º¹¶oºÛ¿»¦»Cq{»…黳$£»ÝçP»ï/»ß½Ò»Åèÿ»ÈºÙ»ÛS±»Þ±»å± ¼Õ¼E¼#мªâ¼{,¼@0¼ ؼ m¬»ü(f»Ó›{»µpS»³ŸŸ»ÀìS»°™#»}æY»5û×»GỀ쬻‹PB»M{¢º¢^ܺgÕºó躕"Ǻ »¹‘šÉºm¢ºuý8ºS9þ¹ÖÞþºV˜º•â¿º‚Íq8•RO:ƒ†„:ܨ{;=×¾;u ;€;e;i;`¢8;>9d:÷«;:ÒÀ‹;ÿy; aå9ñàºÊ'"»7Óy»]C2»ˆÁ–»¯¦u»Ì‰Ó»Ú{Ë»å‹8»çò'»æ׻ꦻïF»é;U»ãÿE»òqN¼ ¼û+¼‡¼a|¼·…¼Æ¼$¡Ë¼!ìµ¼\g¼í¯¼ 9à¼敼9»þRq»Õ3Ë»­ÉÏ»wn»à*¹Ëç·9ŽÜã7¦Ä9Yÿq:a›Ð: ¥a:èG;3ôÓ;o|y;ˆ;§!;–‡;©Ï†;µƒ+;¸õ0;¿zT;Ï>c;ã„;íCü;ð]%;ô@ï;ä¨Ê;ÌM…;ÐŒy;æi‘;ø ¡;ôÐ;àç;Ì_L;¯Ë;‰WÛ;9Üæ:—.ºuƺ½>Pºùº»<¨±»|T;»šj’»¾,<»ÙßÖ»Û÷»Ç‹‰»»ÅŻʵ »Ë±†»×T€»Õ¥e»å*x¼”(¼£^¼QB¼“ϼª¼–¦¼O8¼gó»þvûÒFÇ»¸ »¹j»º¸$»›–3»]ë'»CÒ½»pÕÁ»Œþ»yíàºþﺹ×õººÙº°rƺ“¼º©x¹ý wº\Ô¢ºx¤Sº+ ‰ºî0º…¥àº§Y´¹èËÛ:7ÿ:º*;̳;eæ;{4;a!b;X°Y;X.%;2ÏR; kS;ã;1,:ÏRº¹äáZ» íf»?Tq»k£›» ÷D»Ò¯¤»í;»ô›»õt»ïÆ‘»ïj|»ôîÚ»óP¯»âOª»Ú¼»èJ­»ôC»üw¸¼¼Ì¼ %ü¼(¤j¼$¢ð¼µO¼0¼ ¼ Ÿ¤¼s‚¼Î,»Ý$E»³¶:»’ˆ»IHŽºÖÒ5¹é0¸­˜‘¸!1›:d:›r:á•@; £š;X¬‚;€"4;‡ô8;,¿;¤ á;¶¯(;¸-+;¸6Ç;ÂJ#;Ôiƒ;åÞ½;íþÖ;ñG$;åË®;Ū;½‡=;Ö‹¼;íY;íhi;Ú¯;Ía;½àß;B‰;kRÊ;L5:_mºOÒ~ºÎ›Ý»-« »yâ]»BÄ»¡°~»»i³»È¡Ó»À…®»±cÏ»¶s»Í)ã»Ñòv»ÎÐлæa꼸ϼ° ¼ 5›¼ ¼Ü¼~¼$>ƒ¼#$¼ã »øãлϣ»º·Î»¸K~»©yp»„g×»R‚©»c«b»‡•:»†>¡»/8 º1` ¸×ߺÐߺ¹>º^Ï¥º¿êºIŸº}AñºTtºÁ(ºCeº›”µºD>{9ítC:´Å¤;š ;AÊý;l©;b×Ü;WÜ;cpë;^±4;9Š7;-½r;E 0;!ùÙ:>s,ºœqö»#`í»VrÀ»è2»Ë-»ù“¼Ü"¼ëÚ»þ.·»úW”»ü3»þÈn»ï,d»Òý»Ì:®»Ø¬¬»è’¼u­¼0÷¼#:ó¼/x^¼+Ý¡¼‚€¼:L¼ Ú¼ Õe¼ûê¼ ÿ~»ì÷z»¹ˆÂ»–2»qž»1ßæºÒ罺>áX¹Ç\%9:ˆí:‹…É:ï˜û;!xÌ;M‹«;uL#;‚þQ;†Ãj;™Ó:;µ s;¼Í;µ&Ó;¶5æ;ÁR;Ñ,);à¦è;é¢@;åλ;ŸÅ;«·ž;¿%¼;ܸy;âƒF;Ïzt;¿j÷;¼ Ê;ªl;‡Wþ;F&:Üf<8÷€Åº‡Ô™»¦»o»6»’©s»Ÿø黯’o»°Ëm»¥ô!»¢BÊ»µc»¸¯»Í®¯»Ê¯w»Éž{»â C»ý<¼¹¼ ¼¿ï¼&P¼+æï¼"À¼t»ð…Ö»Í/ú»¹0»ªíC»Çí»fé¼»_'4»€g¥»…›»NS7ºžŸ 8ó_a¹—/Œºœ´ºŽ\9ºØܺ=zº}0fº_²»º¦ºçĺbYÞº]ƒW9. :¯t;Š:;-cj;Xz:;c^Ú;_ŸÂ;n2˜;z;f]r;IE”;O­i;G•ö:鵸–‡ºçôQ»Cdл†[µ»½U»øÏY¼ P$¼ ðO¼­¼<7¼•Ï¼ž¼M»ß 9»½Ÿy»¼«-»Ï²v»ñ¼ãÓ¼&l¢¼6k¼6~è¼$ÄÙ¼Ôè¼ É†¼ â¼ »˜¼ N›»û›»ÆæF»š…»|3»TµÞ»* ¤ºß>¯ºß˜¹™6Ï:Wè®:ý¼ô;2#~;UÈ&;wIw;ƒÖ;‚3Ô;Žv;­¥•;ÁY{;¸}ù;®K;±¨V;¹Å½;È%;ÚÕ;áÙ);ÌÂÁ;¥y ;¥RÁ;Æq¸;Õ…;Ä¡9;®^;«•j;ª¡;’”;aüŸ;ËO:„ý¹× ¬ºÖh3»S;P»‘»’¹Ô»ëò»šñ2» \»šÎ»»“ »›¬í»»Ôe»Ê²ä»Â( »Âê±»ÖÈi»íió¼F¬¼ã@¼%]D¼/ñݼ+Z¼pd¼OÒ»éí½»É?»®)4»’b”»p+D»^S™»såÆ»>§»[<_ºçj¼¸º>9zàøºâ躂ƒ'º&Þº#1¯º|…κjÅ“ºö¹³(ƺzº@2j¹"1 :ŠÂY;,’;+Ý–;Lƒ»;at:;izœ;~ˆå;‰m;„[£;gH;X·k;Yá@;'Áù:†Ùáº6Ñ)»¢»v¹»®;…»ë듼 q8¼˜¼ªÒ¼ xÁ¼ 1 ¼ êF¼ Æ‚»øŒ»ÅËì;|¡;•ë.; Ï;’/:;i {;Eõ;6°‡:è—ì¹îê»Ù»]3Í»‘ ¸»—.»Šè•»v¡î»:pÖºu¶l:®áþ;UÊ:Ü)Ì:we²:jÜ :'{ž¹±̺sºŠfϺ/t7º"z º-ò‘¸mÅÝ:{öÎ:ÐQÝ:´¸&:™< :’Ä©:5 8·‡Èeº öºQPíº²b¥»Ö»'+»Píþ»}%•»’Yv»¬…ß»ÊÇ»פz»Ïå“»¶sŽ»¥,£»®(ú»¸„»¸ã>»»"p»´“&»@ò»’–v»BÀ»|”¾»x)Ù»‘FØ»™83»ˆKS»jg »") ºš€U¹‹óÒ9ÈŸX:œÞ::öÔÒ:ñ>ø:z}¸MëYºJ´º¯ÔºœT0ºª‰ðº‰Eƹµu¹¢Vº8Pй«b³8¹60¹nðºy"yº¾¡¹»ɯ»i)J»|M¯»U:»†º]·:;Î*:çþx;•;5²;H̺;Hùé;Z;<*;<Ùb;8á;9EŒ;9®;*^Ó;$;˜B;(h­;ÖS:(\}º£BZºû"ºö¬ÔºøÛ¤ºÝEº†Bä¹ÑÑã9— Å:¡/; m9;4'V;Vw–;y•²;‘sM;ŸŸK;“ºy;cÄH;'ÕT;,3;:"ÝȺ›»™»,j‡»yÇ!»‘–£»‹ÚC»€pD»a2Õ»â59ÈAy; Šþ:ü;:?Ô979Í|p¸’ºæº,ð¶ºòº.»!ºiÎ¥º DÃ:Kï:ïê3;Þ¹; D:ùÞÆ:É*³:A“¹8aQº1þuºŽhžºÞý/»¡¸»:;w»g³è»ˆ» y¬»Åä»ßY¯»Ý?‰»Âλ¢S@»žT໫^»«›Â»§¢»©lÀ»£t»˜^*»‘—/»ƒBá»z²¹»]ë»+»²x»4B¡ºÎ!ø¹âÎê9¼Wö:˜åÌ;=4;øZ:ä‹6:µeº Òº•¢±º£V¡ººAyº»ïCºE³"¸ÑQa¹–v.¹s·J9_é¸87€º5 ºžÅ_ºÚÈ¡»2íØ»o¤º»m¦»3àhºÁè8UÄ:¼ô·;̓;2 Â;MÜò;ahX;\ñS;VüË;]¹…;eÊ;g¸|;_‰´;\!ª;e5©;hŠ";d…;Ubž;?™Á;»:Ò¥†:×è!; Ɉ:Âsœ¹š¼öºÕz¬» ?z»ª» ¿ºàoNº`}"¹ÄMV9¹þó:º¿ƒ; X;Y€¥;.8;ŽÔË;šïµ;“§s;c—ö;U¡:ífÉ:äŒ :ˆ œ¹ëý±ºðßô»A}þ»z½»^ø»r>»g)—»8±°ºPµÏ:Å‚;Ì:Nµƒ¹z<~¸ñ’Œ7Ã/q¹0·í¸×þÿ¸Ö—¹îðëºj„^ºdkö8ö£(:å)7;Jã™;\,À;E-ª;"Í:Ôý9ç`¹ý÷ºlùiºµe÷ºûƒ'»%yb»X~Ë»)†»”q¦»¶j »ÜºÀ»æò »Ñn?»©à„»‘Ž=»˜ÒÑ»Ÿ ¤»˜j»—K›»Q»žV»–aô»ƒ½î»p3»‰UÜ»›¸¡»‘-»oü»1[ƺäipº!ãÎ9µo™:‚Â;åF;*ß|;$%\:Ëòï9D@dºpຢ.sºµ³ËºÝ“º±bH¹âéÁ¸ž8¹×v9„î!9Žôœ¹ó祺”G›º¬¾ºè/C»8Š[»j«q»W0» ”3ºEÀ:>kÉ:ú#ë;'FË;C‘D;e»ß;x“ ;wfB;}¼´;€úù;}Œ¿;wð?;v. ;Á;…;†6i;z&ª;T¾÷;)åB:ákk:x:žÄS:·F9ÿźlv$ºæˆö»%»7¤<»~Pº¨%èº;jš¹¨áî:-…:ûÉû;N/;†¥;’÷+;—­j;”Ž¯;mh;8x:Ñà:ºhü:“Ññ9󺆻ڻB¥[»^[0»T«,»Q´R»JX¿ºð½}9ä¬:ç:|Ö1ºHغPK¹x‰N7ßW<9›™±:5€8> Zº(|zº~Œ†¹¹Ôs:¯=O;[óV;“ÛÐ;·#;kÁø;&S*:Ÿ†¸ÚßغNϺ“–°ºÍÖñ» ƒ€»FÆn»{xp»þ»¤±=»Íe«»çmr»ÜsU»·W¿»‰K»ƒ’u9»Š@t»…ó<»Æ„»š';»šÕ»»…´Ú»\“`»o÷-»‘ô!»ŽJn»gúºÖ½uº1zs9—¢:›q; Š;8˜Ì;Hë;'á:¦fª¹G?üº…€¿º¤wºßúºò; à¾;hÃD;÷9ø%Wºéº0º¢'®ºÛñ(»(6„»nI»‰G“»•û8»µ‰]»Úå»ßio»Ã7”»˜§é»ný¤»btv»m$»miï»wk{»Š"»”±A»‡+Æ»M_—»?ˆÝ»vK黄××»Z}y»"Wɺ¼±ºET9–Ð:Å­;w…;9 ;[´R;Y¶ ;È :tRÖ¹µÏôºx|lºÃȲ»ø³ºÚ+º!s7Â$9‚0j:-H+9ùÿ2º%º ºµpºšéºc¦]ºÌ­„»:!î»G¯»ǺQdé9ÑÁž:Ï *;œ;9­ˆ;f­;ˆ´ü;•í÷;¡nD;ü[;Ý–;‡×5;þ;–‡8;—Í^;•êJ;„Ü\;J¶¶; Í:˜r9Êžô8¸WÒ9}7•²º|GºÄ«ºÜ8Þ»'ø¡»9nºšì«ºVòƒº»Î9íLÆ:þiƒ;dý;—\—;›,³;”Ù‘;èÈ;]þŸ;¶Á:è–É:¼Õ:Xîä9ˆâĸÍDaºsié»6»1»c9» n´»-ﺺáuö¸BÛ:(…¹Á.¡ºÝz¶ºÊÍeº²/9‡›>:S2ä:d?´9!Sûº6uºJœë7–ÕB;M;—#„;ÍH‰;É¢;›;Có:Mû¹…U)ºbóVºƒ SºžTfºù6e»Mb"»‚Vò»Š‹ »œsP»À/D»Ö.ÿ»È´Ê»¥)1»w¡'»;ßÚ;à ¹;‡DT; ê9°|dº,j ºa÷)ºbÒº¿»µ}»dZ3»{9»…M» ‚è»À-Û»Å=f»®m&»ŠÝž»@Æþ» (;»aÍ»9€»Nxþ»WÙ\»W8λ3Eºëç ºã½™»ïÝ»!† ºúÞ꺬 ‰º0å9‚‹Û:“Ò:Ø4;sÑ;6³þ;h @;~ÿô;PЭ:ød¨:1Æ{¹¯h¢º­{¨ºôv´º®7*¹M™¦:Ð¥:Vuó:££È:—¹Š·º¯^–º‰E–¹f,¹ë/ÕºÜøÈ» ¯º­i¹Ùrê9æ®|:Ïm";&1;DïR;eKJ;†M4;œ;²Ú;°Óã;˜„Ÿ;>Ü;™ß‹;¡‰Å;œ'µ;’¾Ç;z@ß;6f:Úœ¸:3ÛÈ7…Þ¹ŽNî¹ Zq¹lŠ®¹üS¹îO‡º¿@» WL» Ǻ•:½ºAº h9ÛHu:í¯‚;Tªô;‰üž;‹lƒ;‰&í;ŽÎû;‚"k;\˧;Bm¥;ç‚:Ÿºq:tä:‚ß7æö+º»ÄºüŸºéRy»Ù¬» {ºüaÿºZ¬º&cþº®Ö »˜¸ºøæ7ºdŠÓ¸qM9¿ß9+èºÄǺlSrºVgî8d ‘;ø®;˜pX;Ø&Ô;ܵÍ;¯¡ô;Z_:¢˜Õ¹X×:º5‡Öº/×Ôº4¸º¼b«»1S¾»Wß7»[cÀ»¸»¡œ”»·à»²*µ»›-ï»lÉ»ÈgºÕÙ¦»§‰»6 ±»8Üî»*›k» !ºÇšº„º° ŠºÔæAº»£Gºœɹ?ºû:llK:×;¶ÿ;¡;:%;w2õ;~¦à;AÆa:åÿ:vTºP¯º¶‡€º¤ú²¹•mÒ:/þZ:ƒMh:¥æÌ:Õ6:ZÍýº5òﺡҹéý¹9&‘±ºk-º»¤²º£DÛ¹Ò.š9€tÞ:™Þü;!üÝ;VÄF;høj;|ïý;ŒÜK;¦‰«;¸;©üÔ;‘;ÿ;ŸiŸ; 'T;–b;†%x;Tñ; ‚T:ˆl™9O0ê¹o:w¹9ã$¸É·h¹éÖ'º ’åº*÷ºËþ »ÖmºçGºdϺ ul7€Ø:”e¿;±ö;`ï&;~„œ<ÕQ<+Š;Ʀ¿¼ø©½ Œ½EL¼×ú¼]f¼6‚–¼L=ó¼¹o»ÙÈY»‚àº'Ï/¹¦-»ªÝ¼ê¼ u£»Áˆç:Lñúk¼c¿þ¼ ¼C\ò¶ÁRç< ¶¦=Š_=D'³=wèÜ=“ëx=›Šƒ=“N>=|æ¡=P=}=>´æ=:`@=M<â@Ì<}!ü;¾ÛÜ;Ìö<3\<!é;Œú¸%ÒCº%˜;s°<)'n< Ì\»‡¼g|!¼Àî¼÷ÃJ½.½ùÕ¼þÇK¼®™µ¼zr»Œ;¹ݹÖ¼‹=¼Ú»î¼¾ é¼w »€Œþ9ì´·¼áy¼ž§«¼áM¼Íˆ¼bÿû:FÉx»—u;ôm<ˆÿo<–‹<ˆY;ÁÝ ¼Zݼ·f›¼B";Ry‡<؈;êÕºf»oÑ»¸3ï»Ä•Kºôzk:»ê›ºÊCÀ¼‹š¼šÙؼöÞ½!½0º½ƒ¦¼Ë&¼‹ì¢¼ѼP~¨¼Hß¼€'·¼êáæ½#d1½B†­½H O½¶x¼ËYu¼Ì-¼Ø â¼¼¼`/w»ŸÐÊ;1Ðv<^„¯<±wi<ÁKO<ŠÚº@¤¼„Y̼y »86h;ãÂ<M¶;³‡|<}Ô= ÀÁ=Få¸=Sõ=€°<¿”Ð<›wz< †<šÙò¼'­\¼—,¼)æ0¼z`¼¦òżÖ4½ ½%¼óËü¼´XP¼Ÿ¦Û¼¥c!¼ÎÀ¼ï6<¼ö燽ù…½8†æ½e >½‹ô×½™*Ó½†o½WˆÚ½=-½5ƒ¼¢u»šæ;;G‰ë<Ø<°óU= õR= 8Ô<£)±:ƒvž¼"¯O¼ ~»~S&:ðç;@ŽëºªîM;,ìZ<…p<îÒ_=ÈÚ<ýD.<·|š<­<Ç<«¼è<ˆGÐ<'y:åÿ»Ò‘Ù¼*»ü=!»!¤Óº·ã)¹ò3<+a;â8í»'{¼$y²»|â7<: T<‚Ñü;¥Z1¼@–|¼âT½h—½ö#½½-Äý½?8˜½iö|½™ãýª¯½XN½HpÔ½éå¼ÐÂ"¼\‘ö¼ Øf¼<1…¼s¼¡‰¼Í>E¼Ù-^¼ÌµÍ¼¨Sç¼ ÄO½I“@½qoŽgH½¥$ú½¢ÿ3½‹‡i½qðn½HH;¼øO?¼1-À:ƒªÜ;ö‰<•s=-Z="›Ö<íR<%ß »(껼蚻µû»€žÒºž9«»F®H»µGq;Dü<‡e<æ×ï<û2¦<Æ÷¼<«Ñ:<´zé<›Þ§.¼$ó&ºÙt;°ÙØ;Ô¿ú<ZO<[wÔ<:7!;—9V»Îù¼I‚Ñ»«Ao;Žò;Ší-»¶éÿ¼§¶ ½ ­î½—,½Æé½0ü½M¿½gÎÔ½íÚ½ªr½¢Œã½s 3½'Ÿ’¼íŠ¼w’|»]Aû» »ºÏR¼߆¼…¢¼Ï¦/¼úXž¼îÔV¼§Ð±»NÈ<‘ͼ<מ‘<¾;àR;®ÿÊ;i¬Ñ»D¼ M¼G€¼=è»°»Ä9¿«n<Y†<&‰»¤ô¼í… ½(B½ ~Ǽ“éG<"^=1w=ŒÌý=§G8=¶¥¡=¶¦n=#*=| W=^íž=<ŠÙ<õj.<©27<Áy<ÛLr<¾. <"¼7=…¼Œb†¼_Òó¼T«¼n¤¼„ܼ£ÃӼ˧s¼Þq¼êà½ʽŽË¼¹ŠC¼rl¼˜ý¼çi*½nx½? Þ½L3r½\r—½|毽“X\½¨$;½¯˜ç½¡l3½ŽÚ½y8½1z¼ª@.»Åâ;wט; “É;¿¬Þ;¿‡;¬¬ô;¦Íå;©A¸;®#¡;ÂÔ;×”¶;ÔMÙ;®±0;•nJ;«Ô:;ÄB’;º·­; ½ ;—ƒ;ž;•_;oh;3Š::Ùlü9@µÍº–®»,[»‰X»™79»Þž»Òr»”x}»“ž»ŒU껈í\»›7»œ§ñ»¼ØÞ»Ã\-»¸ §»ºw½»ÏDû»ïÞϼ Èú¼#!Ѽ1¼†¼/²*¼#Q¼‚¼P»äóT»¿ÚÀ»™ˆÒ»r&¼»Xñ»gei»x»ƒ»_Å»=lºAˆ9­9ó¶’¤ºà‘º ù¯¹çdæº_„¨º¥ºñ¹T=@¹R*Ĺøpî¹½C”:M:å¨ð;*üd;L};c;q—œ;†…3;•á‡;”y¯;‚HŒ;cZŸ;_{;F£}:ö)ý9Û”›º¤7_»F2»›¶ »ÖÐ!¼z(¼J¼,S¼ʼ£¢¼Œ®¼¹¼ÀL»áx»«• »Ÿƒ$»½¯¸»òò”¼¹ý¼84¼D‘¼9g¼ ¤h¼<¼ 7¿¼Ì»ú“»ô!»à;µ»³Í—»†»R"»==¤»3¿«»‰Âº°í¸j:âýû;U$W;†µh;“ôš;šÄ¨;•.ä;‰Ö;–¥;·qq;Ä«û;²_¨;¢Cq;¡7ë;ž";§ß¡;Åþ;Õ¦l;¿èÓ;˜¥R;–Yú;¯°;°-;—7b;‡ˆö;Ât;‘Ûæ;y˜ù;8WØ:ým(:-ŽºOPü» ^œ»qÈ3»š/ž»˜ùð»‘Ùt»Øa»ŽL軌:V»ƒ’Á»ƒ–»rÇ»¹+õ»·ìú»®Ÿy»¹Æ˜»Û¼¼ÃZ¼oy¼1±8¼3^¼(;A¼ºó¼ p(¼»Þø»°á×»ƒ°»U5Å»Y‹{»m‰Þ»bK»%z€º—`6!ï€9‚¶¹µ­¹’Iù]Ú²º/ºƒ `º8‡·¹!ÎÅ7°!¼¹)Q¹ª<9 5:šÏ„;E;KL;i…ñ;z€­;‰ê;ž¹;¥š;“Œ=;tŠ;_@Þ;UÌ; @î:¤Á¸¸©\qºïv»yÉ»»x»óg¼ `ž¼ß¼Þu¼“żßÛ¼Öͼ­-»ÿÀÝ»Ã5x»šm'»¥‰»Ô±¼Û‘¼*5¹¼?†2¼<øŠ¼'ÜV¼rK¼ ³ ¼êx»÷ƒ]»êBH»à?›»ÂÚñ»•/û»ZH»-e»#ó÷»¢NºÇϸ¹ÔÀ:·5;VY;’Ö~;¦ Â;­p—;¨Ö;™`;•Èã;®uà;Å~;»]³;¤ä£;Ÿ2ù;›4Ò;–ì;­Mx;Ì#;Ì]e;©Ž;5€;›Ë};¤Ëò;ò*;v Å;}„â;Šf;‚ž;@­ï:ÿ+¼:t­Jº³»ºîÄ™»Nœo»Zü»h»—²á»ÞÑ»ŠD÷»Š´U»‡§ž»tä¹»|&»t’»œv{»°QM»¬Y²»¯Ž»Íe¨»þ³á¼«•¼/Žæ¼5¼+÷i¼ ¡8¼ß¼ ô»þ‚·»ÖÌ‘» »iô»R‰Ž»`Á£»aÃV»6^ºØÀº Ü+8ê\ð9(ŠW8“¤e8šWN¹†OúºZݺbê|¹›Ôú8ç…Ð8ú ɸ0ó67û`::*PÓ:áÉ;9fq;i;$;ŠÁ³;žÚ‹;¯1;¦¸‡;‰½t;eq ;Y[‡;9³o:í:KÂHº \K»¤p»•b»Ð€a»ÿL ¼X£¼G¼º¼±¼úš¼›¼ »â?*»ªEò»™›*»¸“µ»ëjD¼®E¼/%ö¼7`d¼)Ê—¼l6¼l¼ õV»þµè»éÛÕ»Þç»Í×»¨ F»uôš»/H黉ºÿV™º¸BÚ¹ù:¤:†;JRó;—µâ;´";Á:£;¾Ë€;®6T; ¼N;«£Ÿ;ÂÝà;ÃMq;¬½I; ûP; Zn;–™;›ž;¹£+;Ë÷0;¸Û¿;—9Û;]ì;—î£;Šº;dÒ;a¹;€¡¥;…”R;Uæœ;ܳ:‚Z¹†ŠYºÖl»6; »€^q»—¬»˜»‘鉻†u滂Ì»‡“Ì»}ß»]Æ»qN2»˜Tw»¥Æ©»ª¸&»ÅW)»öôö¼Û.¼,‚‘¼5#ʼ.ż$T¤¼ý¼Üé¼ B½»ý¿p»Í Q»“P¸»dÌw»[-h»\g%»@ö»Áaºƒëk¹„¢t9\ü#9Ü ú9ó™9$åѹÿA~º`­:«{$9æv¾º} 3»H»§»Û|¼¥¼ ýô¼>¶¼Ý°¼Ì6¼íQ¼ üœ»÷:ˆ»Ã÷T»Ÿmˆ»¦Â£»Ë§%»ø押¡½¼(`d¼$á̼ÝŸ¼ –p¼ ⦼ï}»óc»ã½Ä»× 1»»T=»¢¼»HhÀ» úÚº˜Ô½¹ºÒe:u£;8Ní;•<»;¹rˆ;Ï*Q;ÔQm;Åß;±ê{;±.8;µ;É5;¶(è;¤Æ¹;¦@Q;¡a;˜:;¨u«;ÀÈ.;½(.;Ÿ0;Š?;‹cm;…ß°;[>;GÂ\;gÇb;ƒ:A;n*;MŒ:„[¸ÁCຼ6‡»)|ž»eþ»‰dλi껋•N»€»i7Y»t€j»÷ã»_¸k»I(Ü»= ÷»nú¸»’’/»¢„»¼zø»ï¨S¼•K¼*Oò¼48ȼ0—x¼&s¼ ,}¼7¼^¼ ³†»ü!†»Âˆ^»öh»l:s»Y¼0»@8v» NÛºŸ¤0ºÌÒ8¿%­:5Ø:~Ž :';(m:ÏÊ‹:`ãA¹-?»{¬»Œ£“»Á»ç”‚¼Q¼ æ%¼#¼Ýc¼ê»û·»Û„»»¢|»§·i»©*Æ»¹‰v»Ñh)»ôÚ(¼ ½a¼ôp»üŒR»ö:¤»ý’¼»üî߻󅨻頫»ÚÓŽ»¼,`»Ž²¸»<áǺâ8º|µš¹~–±:4á);7§;|¦^;­’Õ;Ê52;áŒï;êCì;Ú+Ç;Ê<Ì;Ï›µ;Ú9L;Í™«;±!M;¨e;³iƒ;°©·;§¢@;®DÊ;´,©;Ÿ½';{¸;]ÍB;`Á;NÑÊ;'];'4Ž;NÒy;có¡;ºˆº«ms»w$»É2º×èºMWh¹P‰”¹þ.º*-Gº·ôº“º.G[::î¬;Eµ;´Q#;Ý·«;Ímà;˜ôê;%9:"H^¹£Å†¹ÿÖÿ¹Ü»ºAÜðºí‹.»,»-u »<òF»|ƒC» q»®’$»¨©»’Pð»KHкÞÓkºÖO »-Z»':ú» éYºå]º¨åoº/%ZºItº=IºCPMºiú^ºm ¶ºJè9¹×:ÈÖ¦;|;fæ;a;Csu;³;v5ƒ;44!:Çùà9q>øºHð7ºpúê¹IÜq:L7.:ؾ: mô:Ò=:Ͳ9¥ÛWºX.غ2pÿ9CI­9¶¥¨¹är}ºdOá¹ a 9Ÿê:ZY; ú›;e_;ƒš§;„…;…FÖ;“ë ;®¥;´_;³;Šñ†;’Ÿê;ž>];š²;À;oæÐ;3N:Ò…:‚Ò¹#Ç–¹‚I˸þ:¹ŒRñº,a º,j庖%¨»Í»$/ŽºÀ¢Šº+Þ!¹ðŸ:;¡:í;.ê;Uç‘;fö†;xâ;‹OC;‘ç;’\T;…ó;B*Ž:òŒ›:ËF—:º"Ñ9jo?º¡U1ºÜuºÑG=ºöL»•R»:źÛO³ºÉM_ºñ+»³»›…ºÓg[ºx$º€ÁºG½ºœ(º±}캖2¹¤ˆ±:¼ý8;€m‡;Å­ç;׸;»*Î;‚@Ë:ö³£9â¤Ò¸àÔ0¹fKq¹¼Eøº‹£!ºúÖ»Ré»ÏQ»0¾/»V^»¡=8»®ƒS»«<2»‘K»6©¹ºÛÝò»h›»E@»ªcº¶Ì3º‡”Qºšv¹AwÚ¸z¿Í¸‡¨¹Èºw)ä¹ÕÀ„:‘iÙ;Õè;a:èÚš;‡;[8›;…av;j¾u;!”:oϸÖ0Ѻ†\7¿HA:u¡„:¹XY: YŠ:£‚¥:Ïiª:‹y ¸…éîºwº8)Ä:3¥h9î K¹qp¹/þ9êúk::š£:¿ ;Nxe;‰Z;”a-;‹˜½;‰`—;œÔ6;±°;¨Zf;Å;ƒ%Ò;Ä;˜?ñ;‘ÈM;ƒB;Zëc;4 :‰2w·Ù‡¹ÒS€¹CY¹ ¦ºj€ºV¢¼º‰aô»Y»?ÙO»Õ1ºœíU¹ºzä9ëwð:À¼ï;1ª;,˜ƒ;HÉÖ;c Ž;q;ŽÕz;š36;šN«;}L-;,¥Î:÷;-:Ø#‡:Póº6)ºÃ‘ºÃ`ÞºÍ&qºùO»oºïºå‰†ºðÐî» Â »‹0»oâºêÆuºÞºwÙϺ‘ú°¯éº²å¾ºsEÊ9‰Hµ;{r;œ‰é;Ìcœ;Êç³;¨ªø;]"Ÿ:Ñù:*9/‹G¹ £4º%²º®kºÅ «º¦&غԣ»9l_»‰}лªU»» 4»¸p»’°)»2Íð»øž»Êö»û˺­ º_ÈϺJÛ¹2¢9EI 9ìr9O¹sº2Rº˜¶ùº„Ç!9å ë; —N;;-®;­¶:ïP ;'Ü£;{î;…ÜW;X”Í;Ä[:%çò¸Ô½9SU?:Œ£:Ô<¨:«XŠ:] Z:†¤[:x³:ܺ·årÀ8·ñi:;‰©:‚›Û:)8° :²@:S£ :oEÕ;[^;ƒ¯…;ŸŽ„;™ð±;ŒšD;ðN;¥Z;ªÝ;”÷2;v§8;t=‹;‰ì‘;tí;Š·d;~Iþ;Påo:ú½ñ9¿îºžnººÜ¹†å\¹Û¦?ºM]º‹€ºâÜÚ»:ºl»Lƒi»¹Fºjù8¦Wf:”ï¸;Žž;‘a;*7Ê;MuU;p™(;†bQ;– Z;¤ÇY;˜d“;fp»;#Ø; Ê: Y¹Q¹tº¡ƒ÷º®dº©+ÞºÈ4ÖºâUкâDíºè¿Tº÷‘@»SZ»}f»'ê„»$Ä¢»[º²$üºˆ²•ºnŽº¥X˜º“tl¹Ã.^:•ÿš;^îB;²/Z;ɱ;»­¾;—Z¶;EÏx:Ûi":cÆs9aØ(¹Ýiwº…´”ºš‚>ºZŽºV趺ã‡/»TÑs»™P‹»¼í2»ÐJÖ»Æ ”»“Ï»>±&»λ sɺ¿‡ºf9ºúÕ¹d7p9ê:Z-:*>¹H}Fº˜™¹1RW:ë¿';^%\;l› ;52\;# Ì;aæî;‰é†;€lS;9˜²:½÷š9ÕÑj9¨ÉB:‹t.:ßñ´:¼äæ:é9˜¬Ô:Ü9öLž9™øG9§H1:5š:š^":‹ª9ýÅH:ÇÙ:r$:BÁG: ¡;8RU;’³€;¢m;—œ;Ž%;™Æ½;§Ì;šø·;y< ;SY=;dÞq;ƒóŽ;Š$;‰?;à;G$ù:£›¶¹ë”‹º±º-¬?¹ñº"Ûºs÷ºÂV„» Ö »VÉ»;UiºÝ&ýºÖô:ðû:ÛÎ&;l;Wî;8ôþ;aâ';~n;Œ*;¢Ã´;ª|X;_ð;Yþ;%…R:âÐå9¸{ĺw³oº˜ü3º‚_Xº•bÞº¶ˆªºÇlJºÛ¸ºø»‚»)¤»É‚»'v»>ر»5M»µŽº¦Ð:ºcø-ºnû-º{Õƺ:5i;dô;‘I²;º'˜;¼2;«En;Š×Ý;@H :òš¹:aŨ¹.SÓºw |º–+ôº6¥W¹½â¼ºi »X^» »°Ç°»Õ:=»äv»Ê˜ã»g»Nó¶»&)Õºê2¥º‘úNº9¹Gðn8‹N9ïøÒ:YèR9ÁJøºGÏÞºœ.¹Û±h:³ëž;jm;ž>;”ñ;oCQ;o–\;‹Cû;‹æš;dìÊ;'€:‹Ê9: l:st:ÏE :ÃIË:ܹ™<{¹Ÿµä¸êw8­èb9ƦÆ:.ûL:ø:¯ß:uH: ̇:s;œ:]ýŒ9ýC:¯‹Â;R_¯;”ã<;œZœ;“kZ;” 2; lC;ž:b;ƒUÆ;I‡;:ó";] ø;~ôT;‡Á½;Ž³ø;…½ˆ;(Èi9ÞOºœ¥ïºžUºB×Uº ¡ º)2¯º”„¼ºÿ»<ùn»LK»iIº°³¹÷*:‚¹–; ;;V‘;0/;SÅX;qL¬;Ü;•É;®f;¨k;Š¦;Z ; l€:¨¹ÿ+ûº‰Ü3ºC,Ÿºº'úº½Q@ºútîºóàºîèLºÑpœºMf:Q+Ü;;6sˆ;=Ñ®<ÿ‡U<ýuK<—0×»0îÿ¼…á¼…Tw¼`-t¼u.]¼†ì€¼™‘÷¼¿){¼ÛÚˆ¼â`¼÷w½˜¼ÜÖ&¼‹ƒ¼Šý¼Öþ¢½Ô½Dp´½bˆj½qBb½ƒ&5½“è ½§ ½²¿½½«½J½›w"½ŒÖÁ½_çȽXâ¼HÀÁºµ‡^;ó²Š<¡;Í=¾â= {­<Á÷Ï3<ÖÀ½9ß:û¼€èh¼“½s¼N—ç¼9>P¼hKC¼UÒ²¼Iºö¼E¥¼Ñt½á3½Ú“½ &¼ñsQ¼î.?½äø½ ~ß½ŽDh½z½ü½Ë’½•”š½Ÿp½š9 ½‡Ý½xÆŸ½T'™¼þ’:¼ $Ã;ºËw3»í¡,¼uyˆ¼ß&¼XN»^Ïš<7l,<¨E=<Å)þ<Í^7<ÁV¬<ÈÌ»<÷-…<ôÍK<žO<6è<°‰;Ó‘˜;ÙªGBì¼ ‹Ñ;âá„<±šø<°Èk‡<¤ÕN;Ͼz»Î(-¼Oün“ü¼05»:G?(<Ô†¬<úæg<üÉ¢<­ÀK;Ø~z»¨Ì=¼D8¼_Ù¸¼ƒm;2 a<8åü<{d¦½(.½,Øè½0¶›½r0¼Ø™%¼ês½°¾½!Ѧ½óW½ ìk¼ýg¼ŽÅŸ:Š-e<–Xþ<û7B=¿k=‰<ßÇ÷<ÙË~<ù"=ˆ½=O´= ÞŸ<©v;©ó}»Ø€G¼N±K¼I!»Ï6+;ÇÄ<„Š;Ž”:p/º½pX»pîF»³<†»Ï«»àC£»úÖѼ ïò¼Ik¼ äæ»õ ƒ»Ãa†»œ*´»dÉ»‡«»‚ž»‰Í»ŸÆ综˜Ó»Ò9{»Ì”ƒ»¶°»ªäd»¬¡»µq»Á—»Ènœ»ºH»Žµ/»Xíºw´9ÒÏß:'€U:nÇ:èúŽ;RÚž;˜ëž;¹DK;Ó $;íèc;ùÛ4;÷CÀ;üæL<¡ë;ø\;пs;¸äV;¿V!;¿„ë;¯Ë;ª+Š;«->;‘N;:šÄ:íMŽ:Üè:»ü:2#˜9¤À.:9Mã:S¦d9;ʺ湺r~¹µŽºUþp»Xœ»P’[»Qu»¼6º¾lºjŹºijºsE¸ºóðò»+û®ºú#é»/ƒA»s>»¥\»ã»ê¼"B¼ ©¤¼$¦\¼&•a¼%›“¼"T_¼!W‘¼#Ð]¼(ê ¼'ü°¼8n»á|K»¢ŽÝ»S‡ºÍv~¹ ½:ê:ˆ|m:ìèì;PÈ;‡‰B;…þÝ;jty;7Ñ:ÐÉá:® ¸ñhk¸8X(:ƒù;Ë;z:ÿ€U;‹;9öÝ;[HÝ;uE•;{;ˆ{¨;”îQ;• ?;†‘Y;þ—;„we;tRÌ;3é†:¥+>ºF¹£»HA­»§Hs»Ë9&»ÕhW»æb‰¼æÒ¼ f¡¼ ゼmÑ»Ùx» ¾k»{ÿ¡»fB~»Z±L»_Ž»„R¤»ŸÃ®»ºn`»ÇÅ»¹S»¡Ü»“®Ê»“G…»Ÿ‘»°µØ»´ü»™E‹»9‰Öº+^_:[-Ü:œC„:Q:¼‡ñ;&Ô ;‚¿J;«-;ɇ~;è(<•ò<+¿<Ù< µX<–ü;ñ°•;Ëù´;Á€:;ÃÔ(;³Ú;¤,Ì;¥·î;›š;]_l:îÿ :Á:f 9—¤M¹þÉF¹óÅ€¹q»šº<è庴>òº¦ º…š¹T‘ºpÙ4»3\»@ö»%ÒêºÒ×Cºlzj¹Ë·w¹ŒÔº})ºèÁ[ºñšºÖeqº¯Ôü»¢h»=žî»„a)»¸³»øÑ×¼2 ¼â˼!Ÿ¼&·œ¼&Ú¼%j„¼'ð$¼-ꮼ0ç/¼$´?¼Z »Áéa»„|¦»j¼º/ï7ä–¥:U.j:¾Î;)J¶;~Ô7;“О;“¾;ƒÍ#;;%t:·¯Ù9ï ·Á 9Už:–á]:ÜÂ…:ß ;6; ì ;?µ;aD";|z^;„²;‰V3;Šv7;zýs;_+¨;gë;;r¸¼;NÚA:øc#¸xN黌²»—ôè»Æ®8»Ó£<»ÙÀå»ðÄb¼(,¼ øì¼Ä»í¹ø»´½Y»wл?"Æ»0ⶻ3º»Z¦K»‹uÔ»¥½‰»»ˆ­»½çÊ»¨Rû»ª»xîØ»}3»ê‹»¡fh»š=<»W½JºŒ!é:qÒÀ:åB5:ζ:Âvâ;›T;cÙ";Ÿã;ñ¿;ä_< ¡< {u< k›<%D<rà<‚Ï;èÂ/;ÌZ;ÆÛë;»R•;£”è;›8;™l¬;yœ;ë:ÊA:-Å8jОºUÕQº cĺ‰Ãº²Ù8» Ýo»C–º¢„¹lܹ}˜º‡AH» 'p»"]ùºò~ϺŒ,þ¹ó%ê7«¨þ¹×Cºtø@º³o8º¤ ºs»l»I¿œ»‘ãW»Í…¼õ-¼(ò¼v¼#T¼)Gȼ*\j¼-R¡¼4™&¼:¼3…©¼z•»ê8”»¤M®»_§p» Àbº}!;9EV¶:…ºø:÷Þ ;MÏ@;ŠIü;‚;Ÿ…&;†j ;&Žë:¡Tº:}8|Õð9ÇŽº:›:±ëÍ:ÔWÊ;fÓ; Ì;;>¢c;eÇs;¾k;ƒœ®;y¢€;\+;6B;0Ko;KJB;G˲; ‡9þ¥Lºí®I»†Ô»¼_˜»Òr »Ön»ãMS»üyc¼{h¼Ø»ð„–»È&0»‰£»/4 » ‰»ƒa»5À{»xCC»˜q©»­Å»»¢Î»±ìŠ»”T¬»md#»Stt»cTÉ»…7„»Žl|»j$ëºÜk: Ä[:ÿ7W; È:íf; ¨;OJB;–ˆ€;Á̶;ä—)<kØ<â<Öv<î<hj<ÏG<h¨;àÍ;ÍM…;ÂîÍ;ª¨Þ;”EÃ;Œ¢‘;vA’;û:‚<79ƒ«I¹+\`º[ýº»ZÒº¼5?ºÎÊÄ»Xz»>Ÿ9»vɺcÃݸ(\æ¹kkqº–Œ »' ºü§àº£ýĺܳ69¸fȸ6PYº"ˆ®º5d¯º*ÍÖ¹ieºíÄ» j»c§¶»¦èƒ»âfì¼DÙ¼x·¼8K¼'ñX¼-9Ö¼2 ©¼:꿼C;ª¼@Â/¼-F¼ í»ÊÊﻑFw»WÌ°»G7ºe³69¾>×:¢>”;];_Eš;-Ÿ;£Ç‰; µ;qpj; §$: uR:ûp9@!Ú:?o:‚‹£:¨”:à™C;é;±f;>T~;m&F;€îŽ;k*q;>8\; ˆÈ:åèò; @;"ˆI:ý±î:!7€º± ‰»jëÚ»®Wq»ËB »ÓU>»Ü®¬»ð¾â»ÿ¢õ»ø_¶»ãòF»É¶K»™´¹»<žNºñ…$ºîˆ»}à»^/.»—9»¢6»°õ»³é»°ý»z ¸»JÒ»B»Yåå»vm>»gõo»-¹1Ù:Øú4;TŠ; €Ð;<«;B(;ŽL;Á K;ép<²%<.]<^B<öè<²ß<g#< fO;öì;Øù¡;ÉІ;µ‹o;—;€1•;Wíl;©â:mÍ ·Ô‘¹éR$º]üº¬Ý ºº€Tººxr» ðˆ»F¤¸»Bhºëó;º G¸™q¹Úz¬º¤õ°ºÝÜĺ­Šrº7S¸â/Á9ø0::™9I «7au¦8êÝ78ˆÌ溩ª©»6€»‹åp»Â Æ»ôÌœ¼ ÀP¼µ¼$¤æ¼-I·¼4Z ¼>rï¼I­t¼KÇÓ¼<Ù—¼±o»óÝ»´e»A»a°5»õ¯º‚÷: {:Àô%;!ÖU;cTú;'>;ž«y;Ž ;EÄ:ý#³:«˜%:,ø:Kþ:T£ :•Ò:¾Î:è‰a:þÂF;ÕR;Gñ;pû ;hÝ8;1À:ÜŠ:z‘›:‡Q:ÏßÕ:¹k9¡Ýº§æ8»RuX»¡)/»À#…»Ë@n»ÕÀûé^»ùˆR»òòç»Ø»½ñ»›é»Q·ºìÀNºÁ¹»ÒÕ»Fî=»†R;»š8n»¢ÚÞ»¨»ž6W»„…H»W€=»AN»FH°»Y‰F»Z,5»&mÀºpû:ù‡;çä;=Å;õ³;5V£;‚‡ø;¹Í;íTd<6k< ª<Ë<#ð5ás¼K={¼Rß¼H©Ô¼.Aì¼ ›X»Öšô»ª½»ÊK»\÷cºåÚŒ¹2ÎÜ:c!O:à³S;%ý½;Yºx;ƒAÎ;†¿ü;]‰ñ;G:ý§×:À¥£:‚ñ0:9W:’|8:®êà:×éŽ:êB?;(;$íu;R-;`–a;4°k:лt: r#9)#: éU:8rú¹PüºÔ7»N※˜ºV»·;»Àä´»ÉÊû»à*Ü»ö´‹»ö*°»ÚÞ3»¶|s»”†¹»W–»˜(J»WߺøåºnÁº;19œ;#¢É;?è;€¥j;—Q;œÙÄ;˜Óö;|áo; Ï99†Ž÷º6N°¹ÓÉ›7 ¹³:®ºˆÃ|ºÏû» ¿Ž»)š»3yþ»5:6»JY»rÿ»¬‘»Y¥w» Vººäz¹Ê‚:W+(;wj;<]0;b-R;j'‹;S„ž;Eû;eñ;‚‹S;o!á;4u«:®´¹¯¶º»†[ºÍ%AºŠ´ºd¦|ºÌm¡»BÝC»’ÝÁ»µ€‘»È[Á»É†+»¯¡»„\ÿ»Wl’»Fƒ»&^[ºÑ5¹ Ã3:RÐ:´’@:Í¥ :ÉÿÖ:¡C<:\\Z:j;õ;“Þæ;æí?<WØ»¸îÅ»¢©ÿ»s1'»9ªÐ»:!ì»=ì»oPºzŠ:K8:¿TÓ:ôß+:ü<š:åh¬:¹Ex:¶Y;iÕb;ÁÎ¥<'.<“m<"ç<…;ïe";µbo;}#ë;)¶:Ý•m:`Ê]9Åêr9ÉP»9Téæ¹Õ/„ºš@“º÷ÊY»^»© »I®ºùò º—›8áß™:€òÁ:l%þ9øNû7ݹðÕ¹âI:9¥ Ô:¾&3; .;$˜’;ýˆ;/; ø;({a;7:ê6w:ÄUÊ:Ïnœ:מ;Gœ;"Ÿý;.¬:>¶oº˜CºÒŒÈº1&’:+ž{:®°#:x{x8.àCºD*…ºMúº»o™ºèéíºðÙº‰9CÅ:¡Úø:áÉ—:Ëû:ŠÖN:ið<:ÁÈç;¿ö;H7÷;|ž¬;‰+P;[@:ÃtݹÂs=ºŸ$º¨ºV,ºa„cºÌ­»Èø» ‚•»ÓÈ»#[d»0Ïo»FÜ|»cr»r8#»hr»OnZ» Rº‚éâ:**ß;Ï!;)H…;& ;a:¸x0:Ã?L;#;Iò;;D5;ä¶:Ï=`9Íý`ºC÷vº¯ü˺¶ðºÊ0» „¦»I|Þ»„ñc» !»«„&»š$Š»a1&»½¼»‚‹»6BÇ»1oWºÚ f¸¢ß´:¤Öó:û¤¾; q‘; q4:ü¾?:Û6À;Êl;.B;”Î;ÝWÃ< ‰<¯ë<V‰<[Ë;Ó¹;›&·;PŸX;ª´:(ÿ9¿xú9‘ó9ßßP8ôâùº&PšºÅ,Á»Cí»'»R»* »(í'»`Gº~¢g9Ô²’:Z•@9ÒȸR¹»%¹Ú 7Ô,w:oãÝ:à#L:â¾ä:•::'T":B<:É¢Ý;Ö;Ñ:±„¬:– ÷:™¨¥:Ÿ³S:Á ":ÌíÂ:VPþºÓQº´\eºhÎ~9Ä_T:¸›:¿ªQ:-d¢¹sCκX캞úºÔìO»üºæjžºS]Ê9!ç°:0‹:2kí9ž©^8M¾-9ûÃY:£ ø:õη;3ôf;h´Ó;X/º:ð´K¸Ø]¾º¿ž½ºãặG§º¨^˜ºß ·» m » ¤½»‹Å»“ô»<9»//ª»M`C»d:»i¿°»cn2»J›»»Dº÷×:w¶`:ðm:ÿüp:¿™:S:'y:¦~‡;Nü;;Šo;,i ; ð:° 9‡sºC±ºœFvº¹§ºûKÌ»+"»W{\»ƒ }»˜·…»•×­»a¢Ó»ßtºÖ‚»iç»4 ‚»L”ºK):U ^:âÐd;Òr;{ ;ÍÏ;š:ú(ž;R&;¨°;ä)a<‘ò< —<å—;á|;³\;Úx;/¬[:ΟÜ:¯k9x@Ö:˦: ã79S(ºx€ˆºôT,»$×»4YÌ»9TÜ»6P¿»¿º 69ݾ—9°2¹ Ù¹¢ ­¹†ô'·+ý :?r:«:€:¯:|9ÏnDº‡ËºHE`8Gk":² µ:ÿ/Ç:Ãÿ:%:icZ:mªô:fB:Z2 9ïoà¹Ä–ºŠâýºhؤ8o~:’,=:ÉNô:‡_9Ç ºÐÖº€;VºÀ³™»Þ¦»àþºÞhIº` ¹à!†¹ß5Lº$€¾ºM—á¹Ð‰>9ÒÑ©:z1¶:Ñk¾;) T;=9ù:û9=¥µº½; »Ð8»>X»¡]» §Q»7»{†ºþRuºÕ*º×Ìó» ;»5ž2»VŒï»dð;»dH»Z¥†»3vöºÎý°¹Ih•:l‡®:©ø&:‡u­9âë$7¼µ*9—Aý:­Æe;¯ ;38£; 6Þ;+–:šáð8ùû º.1꺄Õ̺Äø »ß¹»4®™»O'ê»x½L»ŠèR»mлçhº´ˆºÞmJ»!# » ¨4º¹€S9@ï:µf:ÝL÷:ð½ ;A›;ûÒ;@R;³9;ƒ;;p¹:;¯^;Ø œ;ëzù;éΰ;Ù+7;¼4;—!;dEÇ;¦e:œQu9äÿv: H:b0—:#ö¹r亰S(»n»3íA»;}-»?¾4»1Ø9ºÞÙ¹ÞLÁ8{A±¹Q­¹© Ǹ½é9ªÞ9ÀžK:cÉ¥:’ ó9ZB‡º¡r»Š6ºÃ„s·ïÙ5:®rQ:˯í:ˆíl:Fþ:Qk™:FDÑ:¸‚8ÒÞÓ¹óºhFIºG Ù¸ïÒÛ:3íR:šlt: y9‰ ܹÐçNº\7dº®6­»/û»"Bc»€ZºæF‡º­ôDº¿×fºÜ=ʺÝrÔº¤~¹½RÆ9£¨:=w:ËÔ`;ÆS:ìí89ÑCź¿9»c»5‡•»6л4&í»3Pa»' ´» –6ºÖݘº¨ArºÅÔd»úÓ»F*æ»b²Œ»e9t»Yøz»?£» šSº‹2¶âCÅ:"ø]:%Ûs9…O(¹xïÕ¹Ý?è9U¥1:Æàg;$§/;+¨Ã;»ü:äÔ:k€¸„¾º qôºs¦€ºØ§»‰æ»)»=s»»fZ»kÆ»-û]ºÒ Ùº¿$» Êã»#NŠºùåÔºñ:h}É:®vÝ:žá{:Ï2I; é³;¤ú:üe;,çŸ;ƒ ;©€î;¿á½;Ç|;ÂîÔ;µ†Ñ;Ÿ°E;ˆ»;Zà4;s:ˆc-:0²4:uq`:¥@9¶ðÛº@ÌPºð.ê»/¿»AïN»@ùö»BvO»&úŽºÄ~µº@¹Îݺ¹Êý«·¨²89Ãzæ9ÂûB9ÎVŸ:2¯¶9vm·º¡í»"”»+ùºÃ”Æ9ARÃ:™™ :“6:J¶:æ6»"€P»}ðºÀ`žº ¦5ºá§»,Áì»]ˆJ»l»\](»<—ü»ÿ°º¼Ãº*—p7²Îÿ9€bK8ÿú¹O8º,ÂMº5‚‘9NÑ:Ý&U;‰r;,:ó£Þ:ªrÈ9ðLî¹Cgº)º‰‰(ºè“b» n×»ýV»*KŠ»Jr´»9ö/»#’ºÖ ‘»¹Ó»$ÂQ» \º~19‹Ó:‚”.:; :0â:·ç:;ôî:û:Ë':ª8íÓó8ÊJ7A*ºy‚廟»F€Ì»( <º“ÙF9ž3w:o)»:`Œ<::¾¥:C°ý:>Ú9ÞÌ#¸ò为±º#Àˆ¹G’J9I‰59†N·‚j&ºEº€Oº¦çJºÈ4¢»·r»/–ûX@Ž»Z.«»8¤Ž»+~»?糧J? »0Ù}ºïÖº_˜ª¹š–l8Э:6›\:ºÝ:4[Óº(ÂåºùªY»3Xå»XnW»lp…»kIø»WM»9TÌ»!±µ»ÃfºÐÖmºÌV†»Ù»P1´»qzc»gˆ[»?×g» Q{ºÁºw”l¹ã?”¹ Å1¸Î»Ž¹dM¹þ뺆ŒSº_ûh9¶|P:Ð s:ùã:Ï9:‰:&Cš¸9@w¹×òèº>Ťº¨ÎܺãZºè’3ºñ ‚»,£»'æ »Pºü‰M» _».ip»1¿}ºõc¹Öˆ¢:*x£:ð»¶Ñ‚9½«!:¦mÊ:ß›á:Ù]; |y;bœ;‡ßÿ;•`§;žè;¢J,;ž”Ê;™ñ;˜§°;×Ç;X¦‡;7ø:¯Œo:‚[š:"8|7• ºdYo» ÅØ»Z!ù»w’»oÎW»k”»\ðŒ»0“eºîO¶º”ÞºH9¬^K:6Ê^9%ë)¹î–Kº Kº[Ÿ;ºõa¨»8*‘»CtŠ»ÎöºWÌà9“t4:M¡W:Yš†:Dì :7î«:ߌ9¼ï¸…yC¹Ëܹ“ÜŽ·1ñ¸·ÕÇ!¹Ü3™ºˆÅºÎ'{ºóÃF»*»ž»<ŠØ»iÃh»€D»m®&»OnÍ»JˆÖ»O'»>6M½©ƒ½˜ê½Áï¼ùi¼´ï?¼‰65¼q³i¼ur¼Ÿp¼É ¼åÔô¼ÿ¹F½½(1.½/Ùp½,K¡½œ ¼¦ ‹¼[¼½žÐ¼ý¼üмîóv¼æ±Œ¼¬b,¼{A;Úfœ<§Ê<ùF<= [=É~<ù{= º=#"=3³«=-׌=Æ <‚èo8Ã#O¼#êϼUÕb¼E0`»ú»:™£¼Z ì¼^¼¨—¼·‘#¼æ™¼½…ÿ½.ù/½-K)½\Û¼¸—Z¼Hò¶¼[žt¼«ü¼Ïª2¼ÏH¼Å¦¹¼žÉt¼%óÔºº€<Ú<˜s<Ý%,<ýÚ¼=¤=CÝ=- ==ê^=9Ù6=U×<ÈuÕ;îšx»áu\¼SrƼl‡¼y«S¼,ë¸Ûij<êR<=ó5<5Ùr<3 8¼«êž¼›3"¼•™¼›«„¼¤`ô¼…ßл½ßú;Ž¡á;¼MÒ:Ùñ:×á<ô¦<¤&<ô©Y=#ÚÎ=CbÙ=:ÿã=®<ÛüS<Œ¬;;dk0¼k;¼˜µ¼¥?¼Îg_¼°ô•¼eP;­¸b<<)‰<,‰á;ÀžU;a÷„;QGÂ:²0c»9!»æ6λµ:8;' ¡<«É<5;Ã’†:׆´»šå ¼'+†¼uWʼµ£[¼ó²9½'d¼é(ï¼çЃ½%½_¼Ýâg¼«kѼ¶æŒ½úŽ½*Qʽ3³¹½è\½ݼðßè¼ç¾À¼Ð¼¼ªâ¼ )¼(àó»TH4;Š¥½j |½Gˆ½!ÁU¼å&üŽPB¼9úe¼`»GSw;VÞï;ËV—9Øò¼`2ý¼Ç§„¼ä6 ¼ö¨%½ä¼øTš¼ä»‹¼Â¼Ÿ|ƒ¼–¾$¼„Åã»Úœ7;ÓYQ<==Ÿ;¬Ñ»ôµº½çy<<¸(=më=@å„=E!^=ü¢<Åkç<†i;ü©y»’3ݼ^ߤ¼™Ya¼Éµ1¼ÖAB¼ƒ ¬ºiØ<ž5<(Za;«Ûz¹“ïAºè§&º§­?ºüª¹» Aé»âà̺ë*;ò0d<3¸<¾;±tº…O»ÿµ“¼>sâ¼7R#¼Y›©¼¹C8¼ú?¼à<‘¼žôK¼–%¼½»¼Ë–Ù¼²:!¼£ê¼Å—½Úƽ`í½°¼ãƒ¤¼×)¼ëh¼ùžæ¼à[·¼¨«¼NÚ»R;Õ9²¹dŒrº¹#ò» »:‚”»7ÌN»2Tƒ»9€õ»B ž»DX»Is»Nó¬»Jƒ »7Õ»E2ºÏµºG¬L9£D:ŸM:áF#;ÿJ;AÔ×;‰[;Å‘»<KM<±b< é<*Rœ<0Ò<)߇<V;õÆß;ÈI~; ”º;€ÈX;UlÊ;+ÿ|:Ûî9ÁV%º€+ƒºûâÅ»õq»7[m»9õõyº ™ÎºÅ»)~»´»§›Œ»À„É»Ï@;»ÏÒ“»ÇXü»ÈKÇ»ÙR»ë-?»òtI»ìt•»Ë–l»‡µºá3æ8ÉDi:&W^¹ Â|º³O[» [d»Rk»z.»E».Xw»5!»7.Þ»;>»3Œº»°ºüþ$ºÉ¸º™ì/ºÍì9ÃÑí: eK:ÿ$;.V;gM°; ¥‘;Øî¢<U<U‹<#±…<.`—<.|‚<…'<£ö;Ðïß;£'™;u²m;8çÝ;i4:Øeÿ:]¡¹v䶺­Ö§» W»9˜¨»]œÈ»]² »DS×»:•4»Qv:»kGz»Wƒ¤»Ç,º‡¼¹Ì•·¹¶Fk¹%cW:‡–:¯Aˆ:¹™Œ:G 55SS¹[gÛ9Áþ¦:¯T¬:ßLu:W“ »Pîd»±¯_»Ú_Ö»Öð'»À„¥»ºÔ„»Óæ»ý^`¼CÞ¼"P¼+ž¼1Ħ¼5+†¼-«“¼v¼ñ»ì‹»ÌÄÚ»œý/»PãϺñÉlºLÉ8‡r×:=îC:}6ó:¸F¡t¹‚P€966ü:¦;:ítÑ; Õ;&í; lö:µ‚:v¹Å:—_Ë:ü<;7ÿb;Uä ;:–:ï#j:“Ù:Ìg:v µ8ÝDqº”àÞ»ê»sé@»£4t»Àcu»ÑÚê»×·»Ñ“²»ÊÛo»Ì–x»Õr»Þ8ž»å‘Í»ÝÖU»¯½â»?Ù纚Œ:y3:€^ʸX:ߺ˜nºãÁjºø®>»Ná»*&»$ü‘»"Ó»#W´»@g»‰)º²{qº‡ º‡Û=ºƒ&!ºÒ9Æë:¶—†;›?;NNÈ;‡ýO;³Ùþ;á1¶<‚¾<H<%Œ<, ƒ<" ,< òu;Þ@#;®®2;‚Z„;4²à:÷-y:°·í:l …9qåº)¸öºÔ*¤»$Iò»^¾¤»| î»jF;»Q-»Y‰»s¦•»s(Ø»BºðC׺n¡ºæ¹æUS9m´‚:›€µ:Ðæ:“°9ŒA‚¹~"‰7†\÷:`ç:ºÝÝ:e—ݺ] »+@â»›N»Ê„'»Ó<»À—û°íØ»¹ ò»Ø¢‡¼L¼´¼3B¼"½'¼&dL¼$óÁ¼3÷¼þV»ûj»äl»¶§¹»s“¹» [º„a™¹€Ÿ»9Ø:U:>ª¼944¹¾#›¹kcº9èØc: ÆÞ:óæB;ì¿;OÉ:¸b©:Pé1:(Oé:–«; ›Á;C';H>;D©:”•ê:R»¸:k9ü¦º0“´»%W»`¶»šV»»rݻІ4»Øò#»Õ…h»Í| »ÆÀ'»ÁQ–»¿=»ÃÍf»ÉÌÏ»¸ÈÓ»fºÁÕ :©‚:ÈÊQ:–½·wìﺓ [ºån»u»2ó»º~» ;4»¥3» tº×wøºi·!¹·‚¹Ý¹£º^Áúº…ã º89øö€:Üèx;4fª;tO;(g;Àõú;ãB<¹Ö<4E<"C@<P>< æŸ;é  ;½ˆè;“K];M*Æ:ù-¬:Škè:¸79rÓ’¹¯ß¤ºžu» C&»HŸX»y¦Í»xÇ%»V6ûK˜R»c¶}»wH»h_»8è$ºú躜ÁǺG:l¸ÌO’:p:Í°}:°C :)ŸVq¸€Ò:cV:‹V :S÷¿ºeT»‚7»³¡S»Æ¢°»½Eô»¬†ô»¨D»¸+…»×t&»ù± ¼ çܼ¶Ù¼tѼÌi¼“}¼á»ÿc™»ñܻϗ<»’)É»%úJºžÏ†¹ã18ô®5:0:G¡š9Åö¹†#˹ù×Ó¸¡ :Š¹:¢¸Ÿ:Þí,:ñt“:ÍÒ:‰×:.ž–:<ªâ:®or;àˆ;5ñu;Ûõ:©âî:  ”9èrî9ª8¾¹üt.ºëfw»MÍ»Žù»±¿\»Ë …»ÖÞ³»Ô-»Ê|:»Á –»´d£»¤0¾»™òT»šý~»šg£»€~黹1Á—:±äI:é$:‡á¹ŸºÂþ» Wx»4k»Òbºíüº¾pnº³|¹º elºÓ•9Ïþ9˜b¨¹k+,ºj{jº–è¹ñ§ý:Fºù; q;ZŠo;’2å;±À;ÊÕ(;åÃE<îº<þ <Þ< 7;ìé ;Çî£;¤U;sj ;‹‘:†T¦9[¥¹b£^º›=ºšÙ»«Ô»5Só»d0Z»q¬M»Q4X»3üö»@C3»_l)»o4»f!Œ»En/»aº°!Ú¹É::C¨K:Í°ô:ÈLÕ:[Vg9D¤{8$kj9ÇgH:L¡¥:(œ¹»ÄŸ»ÇT»W"N»œ"é»·/$»·d1»© Ò»ž@u»žL™»®Pî»ËŸ'»ìŽq¼s‰¼ ¦¼ H¼o®¼»öÿ0»ï4‹»ÛÉλª ž»PˆºÐêLº;ÙH¹Kñ¨9ƒÐË:³9×v‚¹)?º(ÓBºxǸ@¨:#Âb:¡M:ÚË=:ê3´:ÍU.:6Á:q²:~]:¿%Ê;!; sb:¸ˆ 9àΰ¸Ì\1¹˜qæºQ¦´ºî»±»DÜž»…ÊL»¥Ms»¿ÿx»Ð¹­»Ñ)»ÅT»¸Ld»ªà{»•6Ž»xîØ»YÍ\»Pg™»@™3» †º?è÷:Hû:á'Ù:ÑÕá:¨Mº{‘m»h¬»«» -¬ºÉÚ ºq¹“º"ÆPº¾{¹…»9Æ¿a:D×9øe¹{øºbÑߺ_¢a·ò-\:ªæ];4Üz;‡–;¬j™;ÄT;Ô’q;êm<´ < ½Æ<EE;çËñ;É1;¬°•;‡òv;/ñ':›~7 àº4VXº‹¡àºÂ&©» ò»3šD»V$}»f1æ»O†R»(Ž¢» óŠ»:ÎM»W÷·»k›»nÑè»R¦J»Áèº]š:ö¶:Þõ:ôAÛ:œûô9àÇ9’9¸[:(›ý:žr¹‘ðuº×k »‡P`»§½å»±ó5»©Yr»š°”»Ž£·»ŒH˜»›¼b»¼ »à¶R»ú1j¼;P»ÿI»ö§{»ëp»â¨Ü»ØN¯»¸§ý»€àg»,=º¢ô®º:㺹•ôú8–¤8»ºe¹¦¼Éºa.̺‡uź.|7Òä:O-:Ã$´;\@; ¸:öù:Æ›^:–zd:ˆäZ:ª¾’:Ì|µ:¨qW9ìÝT¹×,~º71ºÄ”µ»§ »Q¾ú»ƒß£»›mE»±»H»Ä{»Ê¾Ú»À »¯ê» ÂÁ»±ü»bÚ»'3ȺüúÔºÑaº¦¹ º*TÂ9£™:¥F>»b7º­…‘º,ÒÕ¹Æ4· Çý:Æ•:(ê͹Ã>Aºäˆý».Öú»WÍû»y^»;ã»pXþ»PIó»:ëw»4¿¨» ¯»¿w»Àé»Dñÿ»o‹»qéí»Kà»TºÇ€@º´ºPJÚºcϹó‡t¹­ì̹î?ºWC&º²ß”º{y9tûÜ:ˆ¾:|­:+$W9ÎN¸˜Ùºó†ºM愺“oUºÁÖ¡ºÊ{Zº¹}aºÎe»z⻼6»¤»6»;ß5»N“ý»'ß¡º”vµ9Œ…j: ‚ð¹"#÷¹ÒŒ]9œík:”Úv:¾§n:Ûûõ;ÌM;EV9;{a;i ;šAò;£òC;¥^\;¢•?;£¦Â;£Ûa;‘Œs;U™;„o:“Ì£9Û§S¹‚ªº0 éºÒºí»H« »ˆo¿»ŽŠ)»‰û »†8»t¥o»B'„»Ý%º¹|É]: nÎ9¸^fºऺq3^ºz)‹º¹k»Hø»3í™». ºðø˜º2 y9­ÙÙ:e :sDÈ:@Ãs:Ü:ˆ!9ûkC8Þôʼn}§¹¬Ïa¹Ç±ºD4º½» ~»)»7À—»DÞR»[M“»ù®»Yˆ»ŽîÏ»€Ó´»cÝ6»MÊm»5B¨»² ºÄÕ)ºYùº ¬·¹Ýrž¸Ô!9—a¹c:êºÌôJ»2ÙG»^šþ»‚+ú»¾N»ˆ?y»mÉ»Rk}»T¬»Z;»H »<5<»PÝ»m¼S»sÆû»U»!1«ºæpˆº¸"溤öäºtùº„Uº_aâºEºý:ºž4áºÒäMº‹Ë€¹ ,…8ÿ>©¸ûs"¹ba"¹5©º V•º|‘xº¨±ºÉùºÏÃiº´<º¡åpº½•FºáƺðÊZ»!æ»=óC»dï&»SÑÞºü¹i§:'á9Nшºj=¹Ðœ9Ïô:?»:Âl[;/~G;mþ9 &¯¹†Òºp™Çºˆ{@ºŽ„oº¿=˜»™z»€¤»%®ºÙ™Óº „: nf:‰x:{…:çÑ9Þ-µ:ƒ›:Zp¸¢C«º)ñgºn ºœ¦’ºïc{»/±&»\7‰»tg »4⻇Å»’®m»Ÿ€e»£Ô »œ˜»‹K»hß»6 »¼dº»ÙnºK†™¹Ã-¹Ì½J¹èº—¹u)W¹¹›“º·»4œ»mY»‰Û»šAл›ßa»‹Å»r»lv廀[}»‚µc»ya†»wêÕ»}³,»u6–»Té»&y»|ºïç&ºú)³ºöŒëºçÜŠºÔázºœ‚òºD¹@ºoQIºÆĺÞ__º™r^º;t(º[NhºywûºEÅkº4ÛWº'7º¿dåºîªéºöºEºØ™¢º¯:÷º¥¸‹º¼U5ºÓíºü7–».œ°»gúæ»sðô»1£kºhÏI:ù:GþG7¬ï¹ô'A¹Í:,€U:®¥ß:ögH;#;[k[;‰“É;œÙL;¬z»;¹É¢;¿æ;½õ;ºƒ—;¸Ð7;«£‡;‡#é;"±:HŒººèº›OŽº®Lºö¤‚»U–»•³V»£Ý»¡»»•p»­-»HøË» ¥ùº“ù¹ƒ\ì¹4±gº'§¹ºkžµºaѺ^fùºŽs1ºÕ²Õ»¥»EºÆ¿t¹“‚“:Dü@:jX:G½ü9¨#X9£„²9î`ö7d'[ºcV ºÃC¨ºí²»»S9š»ˆµ2»œ…»¥Ž—»©°ò»­Ôƒ»´Éc»¹d»¶Kb»ª­,»’Ë:»^pL»À`º»™»º2¹q¸ÀŽ¯6„P¾¹®ÁºÙº>œrº¼¬f»1Š›»x³»’Yn»¥ »®.•»£ë#»Ž~¦»ƒH,»ŠÈ‹»”»á»•¿#»”7M»RD»‚ˆ»TÉB» ­é»Lb»7λ ¯ÿ»3u»/Õù»$¬@» ߺÂúZºŠº ±ºÔºÐ_º£úº¥±ºÂÍ·º«$úlYòºg¿¡º¹½»¦»Z»eºÝ‚wº¼RӺǦ~ºãÃù»®Š»V\k»}x™»ZdMºÚ©G9T¡:’‚:K£«8]”¹4J^9«kú:•É•:ñþh;HB;|8‚;•þC;§¸·;·³F;Ã×Å;Ç ';•ñ;½÷„;¸í;£l?;g4:Î7ÿ¹‡F庲ºÔBºà¶x»$Ô»{öø»šs=»Ÿ ª»šË®»•Wr»‰TL»fªø»6Ìлø¨º•¯+ºÚUº …º0ݺ5`cºݘ¹æךº5Dº¹|Á» k&»y‹ºªãä¸D·:F׿:Jñ­9”¦¸Œy²¸%w„¹‚óÁºŒü»S_»ûG»<Þ »vt»¡_x»¿0'»Ì §»Î*~»Í;»ÍŸ»Ð½»Ð`…»É4d»· #»”i—»N¤¸º÷ˆºa·0Ôk9Ϩº8À#jºüºÃøºãVd»5˜»{em»—F»¬8»»†»¸âY»¥¿ê»“[+»‘±q»šy@» 4w»¢éø»¡6Ù»‘h»d'e»øºå ߺìöb»!§€»OCû^á™»VÉ »C«§»Ó ºÜØº±*ƒºÃ­ºº±š”º­íáºÖ­9ºàˆº§8ºnŽŸºŸ»Þ)»%‹"»UÌ»ˆºÞźѱºÑ¼‹ºÝaó»Q»æB»]œÉ»ˆøG»²u»Úa­»î)»ïÊœ»éÑ›»å#‰»å³i»ç×»ãç–»ÕãÑ»º ª»ac»=aѺÈúo¹ÊPã9ÌÐÇ9ÕŒ)¹¤Ý红Ñ» K´»Hçó»Ár»˜Éz»­ëU»Áó»Æ¹ô»¹^F»¤}#»™”»š´»žRQ»£'˜»¦Ô𻚻¤A»,ZºÑ$¸º¯øxºù©)»8d »`ªý»g7 »\>j»DFý»ÇõºØ cº¨¤©º§‚º£7YºŸÃYºÈ„Þºõ$ºÞnºŸ!º—ËκïÈì»(ÏI»-Ô?»¸^ºì„íºÚऺÚæìºÝŠºù‘ò»#Žq»VR8»kw2»<›Ôº«;Ë9†Áû:…Á(:^ìF9ª)B9"s>: I¨:ÀŒˆ;¼L;;ö¦;["´;€p ;“q(;§;¹|G;ÄUÔ;Äè;Á–e;¿gx;®0V;~6P:æN­¹œÚ1ºÆ(€ºé“Uºôðy»#Ëv»dÚp»ˆ{º»Œ»‚®s»c¦‰»=u7»<¢»„ô»œ\ºæSº´òºŽX®º€áº~ ºE ¹ŸV/¹.:îº8¢9ºÔáé»´Oºøþº/¬¹¨]¹²² ºMtóº•ocº§Ü~ºÓR~»«G»LBâ»s01»’$¦»¹¬m»æú¼QÀ¼•Ø»ÿv»õÕ‰»óˆr»÷_À»÷cÁ»ë¯'»Ô!í»±Œª»…­x»,Šº¥} ¹5‚ö9Š‚d¹@>ǺŸ¬z»x»bžz»Œ‹P»‘‰»¬Û»Àö»ÌUâ»Æ,»³Ÿ»¡ê»™‡Û»— #»™U_»Ÿú»žŠï»Š·»E^ºàAº‡Zº”ùaºõÁ»,S»C7-»Cyº»:¾a»$ZºùuZº­—eº3ϺÐzº™¸ºÀÅÄ»» ñëºç5xº¾G—ºç^]»#Aó»6OÜ»ÿ)ºê±ªºÆð\ºÄ–ºÇ솺Ø=\»|»4 ~»SÝÆ»C+4ºùŠºïÀ9•É>9×—8¦šë¹g’9L>O:€|ñ:óã;!òí;*2ñ;Bø;]ØÓ;¯-;”A8;ªC;½6 ;ÆÄX;ÉKÖ;Ë%ú;ĺÞ;¤K—;N9•:{_oº:aKº¶}JºÉÛo»¯º»B$l»y¾«»†Õ²»RûWÂ7»%ܺþÓκãÕªºïΚºùÀººèÕ¤ºÍ ­ºÀ¿(ºÄT˜º±Ë·º\»9¹Ÿ¤¯¹—ÀÓºnºäØ» /·ºä ]ºsº]*̺‰Ágº±·ÏºÃPóºÙÔØ»7»FÜ^»yá\»—C¨»»¬»æÍ$¼Y¡¼ S¼y»þ˜4»øœp»üx¼8a»øRy»âjy»ÄÈ仢¥Ë»v¨J»qDº›\í¹Õ&ѹ؈ẙ·T»¥»n€…»—ÿ8»¨i»¯Ñð»»ð&»ÉᶻÊW|»»6M»¨ª­»šI»å+»‹º°»ù뻓Õ»‰S»Ví¢»4æºz¹ºA“ºi"ƺ¾Táºñ$ºýæþºþsºúTͺÚËYºáÁºb õºi‡ º˜&ºÒš»ŽS»,¤˜»#]#»?9»ò» ö,»9Ó»'˺ôý꺯Óº”hº}mº”ò+ºÀvš»÷»+@»-χ»ªtºŽ ¹Üx¹”ñVº¨Èº- ž¹¼Ìï9Ñ¡:¯®û; ±á;F„;^**;uÔ;‹},;¡ÇÕ;·Ð­;ÇoÏ;ÐÂ/;Ø<Ç;ÚÒ;Ædü;”Ül;"I&:ˆSºgºvvº´Ö»*”»] N»€Ù£»~»[>Ä»&·ºì ÁºÂ¢hºÒn1ºô›½ºÿð¾ºôغó‚>»Ë ºþ¥º¾ênº@Í#¹™]¹âêEºŠÀººá ºù²±ºÒ̺¦P<º›4lº¦ͺ­Ï³º¼ºù¢»59»ttx»™@»»…*»âî𼟤¼ )¡¼ °V¼ôv»ø“»ù)Ô»ÿ€ý»üª·»é»»Ìý »¯ëj»“Ï«»eÓa¼£Qå¼Ë‰è½l½:Þƒ½}a½–"ë½ î ½ ÄÓ½’Œ„½iÒ½"&z¼Ê&¼H¶ç9(8™<"ŸG<@;’;™Ö&¼Ôr¼Ì«Ê½(À ½Ri½\‘½S±½Aë½&X¼ðä5¼^oÑ;m <\èA<¤sû<ª®<Çë<·í<£\<™ÜÊ<±¾Y<ôÊ= Åö=2mB=º<ÉqÐw½l¥í½nÚ˽Bº+½Ÿù¼‘3»Ì’¦: ;Pxú;*7˜»݇¼:sǼœ¨~¼·®¨¼ÜóÙ½UO½^Ã轊Jã½›½Ÿ›3½’$g½gX•½ NÞ¼¹âÿ»Àá¦<èë <‹Ÿ <‰v<ƒƒ&<‡än<u<Œƒ!<‹0i<ŸóT<ÎéR<ð³><ã…¥<²£R<„LøÕ3<_Õ<Ì<þoV=wš=.÷=AÒ=+\h=,†=$gb<ò¡ô<¾ßˆ<²A<–Bo;Ÿ«¼“— ½&½IÆj½Z”d½fqg½[›Ä½.d¼õÉœ¼£Ñm»÷•ç;µjÈ<´h;¬í;8…;ù-aH;õ%1»Q« ¼¹À¼Ýî»…$ﻎʻ­Ø!¼0p6¼h‰¼Á‰½$½6öj½?ˆÇ½4x ½ ¢½·¼ÀŽÐ¼cHÅ»©¯¾ºd»)R¼U$¼aí¼‘ɼÜîá½-s½k°p½‡½…,ô½bƒ½)5š¼ÃK[ºÃnâ< „³<ݹ<ƒ¢&»§A«¼ÒE4½*½QòŒ½WÍÕ½; ½½CE¼ZS¡;¢<<‚ã<†ÓÜ<@ŽB<Áw<ð <7š@<;¦i<5á1i;=>IÄ=-Úl="<3=xº=6#<‘̺¼ñ)92zE<ŽÆ<'VÕ»äFê¼ó,½+;Á½.Ú…½"EE½…y¼ë7Ѽ™¼»°Õ´<Ž<…<Ÿ<•š²<œ4š<¸ô<Ö¯„<̹y:§¼)Sz¼£ž.¼±xŠ¼ŒÂ\¼W.¼ög„½5XO½D¸½q¼å~»Ö—º¼D¨¼Åd×¼êŒt¼Å]×¼œ; ¼>©¼ ªÿ;θºxݺi‘ºqìºrOYº´µåºÁo)º…í¢¹@Ef:Ky:×ÅÒ;m;ÜÐ;G:åmÐ:œDË:_ :e¦œ:zÍ~: X¹`.¦º•¥¥»]»7\-»l+λŠvº»™(黧I;»¶w »¾øP»¶â滣Ä»’·§»F…»L¡4»b*º‘ó•¹ð빑É9Â%:–K:”8Ô:žWÃ: ïnº0‚ºÅ‡Øºã™çºšs̹hýÃ:×@:m/[:fb:o“à:‘øô:žü§:’<:pí:6Áx:'ù:€9:ò#°;Mz;”™ß;ºzÁ;ЂŒ;غK;ߨ¶;èü);æ ä;й;¶‘;›¦¥;må{;äq9Ó|Àºbm}ºÑ1»v»êä»3 »Sn|»iºK»o··»]ÞÖ»=lÏ»(%¡»$Ð »+“»?²Ø»Y•#»P:¹»\À7DÖ:ù¥ö;:ö;"[=:±wð9ï¦ÿ9…=›9ЉE9‘gÖ¹å ºÖ,Í»B\|»„ŽÕ»™Ò¤» D»—Ý3»†„»c¨Y»PY»yC“»¬ƒºf?÷¸Æ„{:OÃN:­ÑÐ:º1t:´4ï:¿þ:ÌÁ:ÌÈj:Ó2¢:åÖ):ñ;::õ]µ; N:;;šÌ;‚ž;©CÞ;ÆP9;Ò+·;ÔX@;Øñ%;Ø>ì;ÇS;®2ê;‘v²;M—:²Ö ¹œ\Cº²ÂMºóøj» dß»!Õ»Ah³»cä)»}) »‚¥»sð†»Pù|».ÿ» h»iS»#æà»5'ä» a–¹¿ Z:åBY;Mì;MX;ñ0:V'Ç9œÙ9Œß8ȯ^º Ýк뉻Gb&»uþ¤»‰ø»Ž »‡°4»rèe»Oõ»I-»‚zß»¶íÔ»ßÂâ»ìiÌ»èí»à»×$Ի̡A»¼â+»¢ÃK»ƒ[¿»RnW»)B0»߇ºúdÛ» (Ê» ¹»þ¦º¹}i¹œí¬:h“×:ñÝ›;(N;¾à;³N:¹b:VHé9ðº 9¼È9‡Ϲ--aº„h>» ¾¥»Zf:»‹λ™÷*»ž¬ñ»¡Îf»£\×»›Þ»‡Í*»i&»»Ld}»)AºâÇDº½:{: Ô•:´´Ê:¦¬::…­w:9I¹3Ámº"0º êe8 5":b¶ë:¼ÛÜ:Ùaï:àa:ôõx;Õm; ¥¤;Šx;#|;? %;J†ß;DÕ;HÜv;n;•ø;µ`Ö;ÅçÌ;ÆÌ;Æ“;ÉrB;ÁF;­/7;ôj;@~:‡(žºº¹f ºçˆE»$E»"_h»JÉ»v »Œ’[»“7.»ˆ]µ»\di»ØóºæRjºÓ;Ǻ÷W•ºé­Ôº“Q:·t;J;h^æ;-Ð:ªc¨:›9‡=ä7gȺ1ºëÚ¯»@é³»Zg@»l »n©Ê»f¼Ô»Uã»C¨»R=á»9V»Âç@»áO»åÕ»á -»ÜbP»Øu»ÑÚG»Á¢»¦Ÿƒ»Š,»bY¦»4Â5»ò÷»[»$k¸»8Ѻ¯¬ª¹V&2:nÛ:ãÐR;õº;y¹:ÜÄÑ:ñŸ:M0e:È9çß9ŒÊJ¹2ê캇»Ž»aþ»Š_n»”Z»–Ÿ »•GJ»ŠÜ­»mi»HWš»1꘻=ñºáîº;ø9ìƒ":©yN:Ï|è:¿YU:„ïµ9šŠ¹Ák}ºT8OúÉ:e ±:Á <:Ü|s:è Á;FY;(À9;>íR;Bur;Ke;kÃÁ;†}Q;†ñG;x';tF;ŠS¡;¥Ot;·3œ;µ(d;°k°;¶)´;¹&;®žê;“ª,;B~â:ˆP1¹ÚWúºF2º¾¯ÔºõË%»!üÓ»Uc÷»†Á4»q»£Åa»³ø»S$I»(井éߺ‚îAº‹Äѹõu:Š>+;5];m—ö;K˜c:í:Vä9Úd8ØŠºεºØj»0ž>»;ú®»B‹»?½e»=Xd»:M6»;½»aÍß»Ð7»Éü»ÝjÁ»Þ5»ÛƒU»ÜÄ*»à»Û]¤»Æ{…»¨Ü½»Œ¤Ä»a†æ»1Ö»o»¾þ»q€º”a+¸MÅ:n¶ž:ÆsW:â ÿ:Û¾:Ágã:›Ð:~0_:[5:1‰À9ê·IïºrÓÄ»‹s»Y·q»í»†¥!»….f»uØQ»MwX»)W4»áï»ݺæ£tº}/¼8ÉhÇ:²Ã:¸Ü“:³¥¥:h¾ß8ÈÝκ¹¦ n:Ù:Á‘„:ñqe:ósa; »;7XH;g‚;{#_;y½1;ƒÝ£;–ëñ;¢þ¢;šl;‹©!;‹œþ;œ×<;¬!¡;§"Å;›Â; ²ü;¬õ ;¬yq;•E;E å:—ã)¸Üĺ2³º“¢¹ºáÎÜ»#3…»aû+»’ »©í»ª¹»‹À»5rFº´‹ºŒ¹Ú(¹"oá:WÖ~;ö;^¡;YÇ ;8¥:ŸŠ9:8Ì9´̹¶­Gº·±»„|» »è|»ÎV»€l»#¨¦»5Ð¥»oH+»¦¥ä»Ë\>»×»›»×Çü»Ù3f»àýO»çcü»Ý»Â'o»¤â»ˆ+†»T¤ »+•Ò»ëïºúTº‚Vž8”ÙJ:`;M: ç:­òÿ:·V„:º6¡:°v‰:¦~Ä:•Žã:nH:(\9ÍEºn'n»ƒ»R#¶»k~|»k!»Yóe»5ª9»Pª»{»<ºíúºžûÖ¹´±-9ìRn:i´c:t×Ø: ÀM¹‰+º »¤¸VLo:rJ;mx;R;ÕA;BM;’Â;•È¡;—cD;’yÓ;š·O;«×©;¯Ú#;¢©5;˜ ;¥¯;§úM;¡^;‘KY;‘ÞC; ýß;¥¾5;ëÉ;¹–Æ7F1n:e:äs³;=؈;SëÂ;'dÙ:ÑÂ:†¹˜:%F ¸¥œlº”Í&»2V»É>ºòšéºåžËºý|ß»˜»/uˆ»t"ú»¨"É»ÆÍf»Ð¸V»Ó Y»Ø&»â.„»âõ)»Ñp»· »ži»ƒßü»W‘»6…ž»Zº™à ¸AD:2ÇÑ:h4õ:uÅ×:™ a:¼Þ:Èôƒ:úl:¨<:‚Û–:;¼8š#®Ž»"`f»Sc»X¼Ç»GS »&^ñ»¼íºò¾yºÿÕEºò(9º¶DFº@ü¹"6ê9/³Ÿ9sÁ¶¶LŠ*¹Û# ¹ôu›9°]ù:Üõí;4L;RÇ;k|;Žg;©à;³†;©+à; Ê;¨í6;´â6;²ç;§Å†;¤;¨I7;£”;“­¿;É;ƒ; ]ø;ˆ$ ;+—º:†ü9,;¹£ÿ±º`ÆSºÔ°»(Ž}»lÄ»–J»–É¡»„TI»=ú¿ºÒÕ¨º.Ý0¹lÿ9CÂa:‡àª;  ;5N¿;&ð:ñº:¨;j:^±¾8ýn™ºs•æºèIäºâñ̺ÇKº¼V«ºÚ‘Ç»|»#Ù»jÁÅ» aJ»¼!»ÈI‚»Î»Óøú»ØÓ»Ñÿû»Áí»°sc»Ÿ†k»Œ{'»tE´»C[ºí_:º¨ 9ª»óìà»ùãA»øN¯»å˜»ÅÔ™»¨Êà»’õ3»väY»;cý»º,ºç_Rºÿü»0µ»|Žç»£»¶tð»¹×»ºB»»Ç»±{º»žmú»Œä¸»}2À»aä»Sè¹»WÍ,»V™$»=»eº²>çº ·õ¹hé¹hºo¹¬ÿ¹8Ž­8P²8²ÿ´¸Ê'*¹}àw¹Ÿ.ƒº" 麵‰e»ï»ZM­»{«/»qO¶»L%»3 Á»6DX»;¡Ù»#µ$ºèßqºøº•}¸h¦?8ÜŸZ¹’ º~&9ºµEºŸÇDº4¹‘ÌιÌ*ºcXYº±Bº7&.9h·:«aÿ;Ù;K½;•{Q;¡}';§nð;°£¾;¾)a;Ér;Õ¼;é;;ù±O;ðRÆ;ÅÅÚ;Š“\;&ÝG:®$:Á¹ÖÿóºØŽ»7/³»X׋»O~±»/ ³» &ºó-fºÿ†×»Éﻚè»ý.»€¬»"é» q ºÄ¨6ºFG¹Ã8̹çܸº@íºv{Uº~I~ºoc׺L¨{ºɃ¹òÆjºTf…ºïšÚ»Uúl»—è±»¾ÎÔ»ãâؼÁp¼!ؼ‹l¼Éw»÷¨»îF(»ñ˜"»ñ~´»ßfB»½ü軞Çb»ŒN»z‡f»P¯»)„¹»ÉA»®a»I![»†×»¥fé»´ T»¶;»»²ù»§ò,»’k$»x»[n“»D¯)»1S»+`¶»*Ê»ÿ8ºþ‰`º»fºc­½¹áeî¹µcb¹á& ¹o„8ì¸Á9¿X9”7sÕP¹«[ºs´,ºøvc»BV»xP«»„cˆ»m?@»@úL»+Žõ»1žŽ»1d™»ÓºÌj¥ºgC¹fV®9Ÿk,9–OĹ®gºvÑźwîg¹Ç†l9R²9b\0¹–à–ºÔ鸱]o:u8;Ì;I%.;€c;®®;»B?;À^Ñ;ÄQÅ;ÈHk;ÌÝ*;Ü*;÷R<BT;ôZ;ƽÔ;’;ö;G•Y:÷üÁ:]3r¹Âx¢ºØõû»$É»/+¹» g» ü¦»G™» ƫ»Mç» ·kº÷QDºÿóκó$º¨Eaº'»¯¹Ç°„¹÷© º=G¹Üs鹃Öñ¹TþÓ¹[·¶.9é¹:ùŸºŒ»-9лŽ:)»»bÖ»ßàZ»ÿ H¼ @?¼ €œ¼NP»ô~»æ»åŒ:»æ+¸»Ö«»´É»“m®»ºì»p¨»V¬»:H4»,â\»7¿¹»b•»Žù´»§h»²¹ª»²½i»¦…V»ù»^]Ó»5ùP»#t"»pù»AKº÷ò8ºäÌ?ºÇý̺«wwº†„^º5Bź$:º[f”ºX¥Î¹Ó×8l©9?RÒ¸…f¹º”º²Ý,»Q²»Tç »yl=»vZ±»L¦¹»én» È»%Nž»&`I»º»!ŒºGo=¸¾>ß9¤@¸" 7º;ãºyY¿¹Ð¿s9÷ÿ£:^˜j: „9ŒZ:L/:ñÅ;@´„;;F;™ä/;¾;Í þ;Óòž;Ó›^;ÏS};Ñ®¯;çˆv<7<Û7;ø.;Îu ;¡üA;n*;b:Œñ#¹b÷º¯Æ\ºê`ºëÝ–ºéORºõCÅ»;þ»?ì»!#8»Z½ºíyNºÚÖ̺ÁÛºy¤z¹ðÍѹ½í¹óê¹ f@9)16:zµ: :–9ÍÀ¹u)ðºÙ3]»hAº»ªùC»ÑÔ)»í†N»ÿR¼¸f»ôÀ8»áéä»ÔÈ’»Ò‰>»ÓH”»ÆÄK»¨»‡Z»jï»\4Ó»LRü»=°S»<áÑ»R×軀Ž]»›Vl»¯™ž»¸°‚»±¥»–/»_“¿»Ø@»`ºù7!ºØ‹dº§ÓVº…xʺrïº|®þºW½ºXR;ºTÇ º•êsº±«º‰‘§ºýS¹V´$¹·õSºj΃ºÛŸ¢»#Í»Mi»`'}»Mh]»öxºñ¤!ºþñ»B»2½ºù0º®‚<ºF/Ò¹gÞ¾¸ý±ïº‰~ºƒ¸uº$S§9Øð×: Ï):¥a:‘²ò:Ò‡r;,pÇ;oûv;“˜9;ª@);Á«;Ô¹B;ßv;݉ƒ;Õÿf;Û•À;÷½o< X4< };þè ;Ûh®;³#F;‡Å;0wç:£qß8,å÷ºÚYºV¥ºƒ|xº®KºÝ9滶E»˜#»lxºçºvº¶y¬º†/1ºrH¹ŠËù¬ô°¹ÊN+7æeA:>ú:rÙ:ŠOð:cÁm9窻º#HŸ»Å÷»‰Èf»µ¶m»Ïo»ÜP¯»ÚÍŒ»Ì£»½l*»¶B1»·&}»¹>Ñ»°Ai»—:Þ»v$»SÒê»D2b»:ÙÖ»<»NÎ÷»t,s»“›ÿ»¬” »¾à»Á]³»­X-»ƒ=Š»+ã&ºëûºÑ~fº¼z ºré4¹Ä/x¹R]¹×!—º:Á†ºT˜ùºaݺž LºÊ{ѺµÕ$ºi©ÒºǺ!§œº†šºß!á»”w»/Æ»5^©»T÷ºÞ”º¶å^ºàm» šÙ»•oºÝ º±Vºsäiº ÷!ºäOºc`º? ¯9RÖ‘:§o:àMè:æZ-;2Ö;N3;…xÌ;œ˜ ;®·á;»Í;Ò“0;á¦â;áW";Ü6÷;ènî<F<pé<Ì<§;æ§;½‹';Ž;8‰ö:Äs6:2¨Ù9šÑì¸nf/ºÔ˺‘µºÒÎÿ»ý»}ɺßÜCº“¸nºÙ¹AÙ¹[T¹³Þ9¹—ã•9®Õš:(±:´Bö:Ÿ:_ë9!(Rºš¬;»>ð+»л©S”»³"»®ÿy»ž>».O»úƒ»– 0»œ—™»—ýñ»…¶»`šÿ»CçA»3vô».ƒ»?!J»e°z»ŒQz»§b»½8»ÈùD»Áå­»¡ì»^s[»›šºÁvaº¦rbºN·µhÿÊ9òBû9’Q–¹‡¬Hº.šVº]i)º‘Yþº´„º¢«KºT²½º ˜tº'«Âº…Tͺ½gºé¶4»Œ»‘Oºà º¥ºaºÆJwºß›åº×<¹ºÔ,ºÌ@dº˜#Jº8‡^º †ºÿ9ç<:—âO:ñ%É; èT;'™H;^‰;ŠhX;¹;ª;°Ä9;ÈØ ;ÚÞ;Þ7x;ßHc;ó‹< ‰(<Zß<'§<m€;è‹;»ö-;‹'z; :‡´:âöm:ÛϽ:r(9mˆ¸¦¶½9 Æ3:Fÿƒ:³•=:¸Š¿:aÒ9Uf$¹|#&º Ósº^âSº’?ߺ ¡¾º™%Ǻ̺\7¦ºš«¶º÷âœ=?Üû=BÊ=9ÞÌ=5} =<¸Í=F7-=N‹…=K)š=*‡Ò<àõà<4ìÛ»¶ªŠ½ ‹—½Û¼ðØì¼rë¼(Ÿ8¼…‹¦¼¶P¤¼ºóE¼2¼j©¼ž×:ûÖ´<žM­=ñJ=&el=<ž=ò=!õ%=(-<Ü  º×<(±$;tפ;Â;Ìqr;;Ýþ»Â÷–¼«%½!½A½/`)½N_½6+½.aô½!¼i¼ÛJv¼IDѺÑ;úÊÎ< J<ç¦=ÿÂ=H†=d?J=dú=F =›“=-W<íâ<Æ_Q<‚hE;D¼IL½Š½3i½"Ïs¼Ã Ѽ*廎Ç纫3[ºC®4»šDß¼"E»Ç†×<7)^<õˆ¬=à=I,= /=§<ßyE<—ß<6½;š9£»¦–ã¼x±ì¼œ'¼ $¼½ Œ¼Òø>¼—Ê滇-ø;þná<¡œË<É 7<Î%â<¸!+<Ÿ:<} <8.¶<‹E;<À`þ=šX=0ìÇ=8h==°Z<„´¼» Ó¼‰"ù¼©ãw¼Ÿé̼¤ãݼ¦2½¼ Ó‰¼pë®»ÏsÙ¸W„¾º•B­º…¾~<1…<çôX=_<ú–„LÒ½-¶Œ¼à}¨»î€Û<^%0=zX=>£O=J9+=(Ù¡<É2£;†Çã¼@ïμÁ”¦½v}½Eð)½> »½ Ù̼° •¼|¿¼¼9×Ï9Ã<œŠ =¼ÚN.¼Ð‘‡¼”‰Ø¼K2—»Â°­<òk<Ö$=¯Ÿ<þø_<¶ˆ=<‘›¤<ˆ’‹<$+<¬<=*–= ˜<קÕ:þÒ¼Ž¯Å¼°Fß¼‚2t¼+’s8R´Í;ò6;ì™p<=× <\Ö<ž”<ðzÄ=`<¤>»ê!¼½9ù½÷*½E{¼áV»óìè<€Ñe==¦Å=0g<‰Œy;”¿Ô» »õù'¼‚š¼¸Ô ¼¯,º¼¢¦¼"_°:Så<Šú†<ç%0<Ýc±<™¢Ã†<ƒSÆ<šÆÊ<¬._<Ø]ý<÷©÷<ºD;pß¼‰£+¼ëû3¼ë°ñ¼‰ d;w€<¾™¹=›<à«<_“¹; [Z»æí¼5w̼¡[ɼÈŒ¼²,ݼ€W»ášÔ;åˆÏ<¢ªS<¸Ô<¡%;éÇ„8¿—?¹R^•< ÅY<”!<8þ;»p™¼$&¯»šP);{­9<}öø<œº°<¶Hë<È2f<ÚÌþ<òD<ÕÜ<<ǨºÞ¼I½#¼¾ÈW¼ï¼ÔË?¼•De¼’:ƒ ¦;ßL;>pc¼¥Ñ¼†í¼X)仌Lû,•Û»–£‰7ÜÕ¢<*™·<¥‡<ÈF<éhÐ=y¢=½€=TP< R8<*OI<%(Ç<€a_<šd Ï;o_W;áÒy;ii¼¾Ð¼§=•¼©Ž¼ Wc; Ï×»¢N“»²ñ-»¶ûÓ»ºqG»Àa»Å«‘»É¹»»Élù»Ág»«»ý»?»º}’k¹Ûw»¹…®ú9m§o:cë¿:ŒDã:; 9¥N¸9$ºw¹»vÖºÖL»:Þ`»D™j» ¨Èº–ß$º,ºf&uº¦w㺉úºi*ºhþ#ºž5ºµm¥º‹ù¹•)É:OÙï;¬;ƒƒÕ;ÁÔs;ñÁ<#È<aÙ< EÔ;þo;çåˆ;Ù W;Êî:;·É];¡žÍ;‘ÃÜ;Žî;š+N;«‹&;®Ùí;“Œ\;?Q:ºé˜:t­8õh<¹ÈNºy7ŸºÆbŒºð™qºê“²ºÞꤺêÕºîÜ`ºÛNkº« º#®Ý9o¿:ya:®#«:¥‰:U9’9’º$Drº˜!º_âmºS)hº^ßUº{×к†&º¹à»2»p°¸»–§#»£2ú»©çU»·Â6»Éø»×DÅ»Þ7Ÿ»Ù¶L»Æ)»Ÿ{»Rl_ºØPºY%º{¸Á#ç:Y¯:("ñ9m[p¹ꄹ’áLºoÄ»j/»)¥Í»­ºW•”¹%›u¹´±)ºgÉùº‚KNº:ìº7²º’Owº´@åºfîö9šu:×Ñc;K;¡¤E;âe"< ­¹<Ç< ØK<nK< ÜÚ<i;çlà;É‹;¥éš;‡H;vÄ ;†Š;œ«2;¨ ¦;˜¢;YAY; .:•Í`:.›9G—á¹³Žºk”+º¥ ɺ³ÍߺÈ0æºâ“ ºáãºÀO·ºzºT¹iµü:ø:ƒÍ$:ŒJ‘:+Žš7á<ƒº @ºNÖ-¹¨K©¹•Ý˹î0ͺ*ÆzºMØ´º¨&»%^»có»‰:$»•R继™²»Â„0»Û‡o»êá¹»éñó»Õx»®É&»s仟‰‹wº1Ž6¹¥â½97ÝÀ9‡Ù÷¹¥¹Ûå\º)·qº¨üºû-CºÖK º†9EÂh7Z+Lº-¿º{Ôº6ùþºÂɺl_躖—°¹ôtè:‹Û0;-r¶;†9;¾L;ú£™< š<( ]<-C˜<%Àç<Ã~<„Œ;䑺;µ…ã;†R;VkE;^Ô];†bl;™Wv;”m<;h¯;ç[:Ó¬ù:™sÂ:;V>8Äd7º.Û¢º¦”ºÏÓ,ºà!ݺÏ\/º¡¯áºN](¹i`ì9½K:J7:YiÞ9Þ¶†¹$öz¹õÆé¹ìBQ·B¿^8¨`¹=:ÿ¹ø¶2ºAŽ9º²…¬»ñ»W¦ç»}ŽN»’§Ó»±¨»Ò#»ê¢+»ïüê»Úüƒ»±¤»xW>» ¤ºŠbº/Çp¹î¯#¸ÊÎÏ·’Ü乤©³ºqƒºo~Vº°oÙº¨s/¹å9¨ƒ9º6?ºšê©º|Þ¹º"áº:ºÌºS”08uê:ôD;löã;¤ô;ÔTû<Oè<ϱ<.¡¢<2‚¨<(õú<¦ñ<g;ÍS;’‰¯;OTb;B/K;jƒ;Š–²;Œ©;fþ¶;$ò¢:óëÎ:ÀÎÇ:|P÷8Ç{Žº‚FJºíÂv»aºã.º†×§¹¼Öl9ã: å·:8`l:–Ó9´¨¹ïºYº-•¹È®J¹èq7u¢i¹kg´º Фºd.sºÉл¾»RG»Ê®»œ‰Í»¾^s»ÜSj»éQk»Ø"»¬FŒ»léD»Oƒºw&º ½Çº>ñ¹©Ðйs.©¹çñþºA.øº‡ã-ºŠË£¹ì¾9j—c¶Ä)€º€ÅºÙ2rºÄ)ºvÇéº,„ü¹õJâ:À¯;$YÌ;4Q;º¸š;áÉå<Ôe<Jœ<.À]è»0ºÀð¾ºp_Ѻw ºö»[’»–ce»¬ ¨»°ŒK»¡/þ»wìÜ»F0º (ºK…ºyÐ2º¤¼{º¦œ°º7ºh‹ºŒV,»Jý»s†¬»ˆÆ»ZÖ »¿º‚':¨I;a S;²oŠ;Öœ5;ìÖ1< Æ< º<rq;ïˆØ;ÈwX;¥ss;•Ÿ;ŽŸu;t¹;D‚;:O‚;?B;?ö:•#º3²ºgñ§¹†X:w&:f,9Ê}ͺ0ØbºÞ9Ó»ü§»–“»‹´»+º°h3º4ëºNºóâ)»[˜é»’ò*»£b»sÓ»€Ÿ&»,æäºÊ 6º‰¤dº›ˆº¿iº´âº“.Ôºœ"*» í»nói»‘¤à»{Ô»$¥ ºp4 :Áe;fK;¶•Ó;Úè‚;ñPÿ< <>q;öÓ1;Öv;¯æ¶;’½è;u™;R¾Ó;,;’;*ï;07I;.v:!ƒ«¹Ž„<¹ÉˆŸ¸[,‘9“Wn8C[ºaÿqºï5%»#b»Õ<»«ºÿ»º–{¹ÿ!ºÖfºÙ_Ú»H »„iÒ»ŒšW»w2ã»7êT»¹ºÍ9ÖºÖÀŸºã©ºÆ§º¶òq»о»`Ò­»“s»Šì»‹¾¢»…pû“ »Ÿ ©»’OÊ»ectº²Vã;#7‡;Û'Œ<‹¥< ÌŸ;Â…õ;GÑ:Œš :Š29ëTT¹Å4³ºôD»aŸ»™·‡»¦ù»Š)¹»7Æ&ºÊ6¹Ï :›âü;Å;B;9Kܺ»$»‰ ×»”•o»œgG»¬‰»¤,M»€øºÇ%;8P£;ñ†ü<†þ;îr7;»Y:±K.: ÑÜ9ÜLûº%ÖŸ»"kü»‹ÕÇ»¨p`»¥Ä»8 ‹º‹3: B;Žg;:DÑ:’Žºöºq»ƒ·»¡A»´](»·DûŒ¨Cº´I;fý<ç < à‡;ªN:ûód:/»Ò9ÃIº…%À»P+㻘仨‰»,ö°¹±:â\@;NQ­;mº  m»zû×»­Õ»ÄG~»šd”º‹Zh;ø…<Õ;×Ñ÷;5qÎ:Rfo8³ÌʺäàI»y{ú»„VÒ»¤Ú:²;>l«;:w¹ôŽt»~(½»À†¥»¬N3ºeÂ;©3,;ï8Z;€]z:hiÁºß`»5h»uÒ»1j:×ì„;h|9öÝÓ»‹¥»¿µº™)‘;·^;°…*:ƦºÖ¬š»g×»ëï;FKÀ:ô΃»¤Y»4;¹ù<;3,»D ë»Mé;‰U„»¤aÁ;›CL»„;í»`º¡ð¸æ†:ol:o„R:œ|Ù:Õ´;Hw;Abó;rô;‰*u;õÊ;’$ö;žÝ;ªö;·d;Ëê›;í¶<oÈ<‘f;ýè{;Ü'Ë;¸¹.;—¤ñ;i0;IV:Œý8Î}4º½Mº/7ºÅkº¿üǺrS)º£º˜²W»xB»;ºÏhG¹ð¾u8ã¥)8Ö»©8+Ò ¹’7`º¥•Å»"•»R_í»V㥻5Ìy»™x»™ª»7c÷»Ts…»]ìî»f`» ⻕-»¤Öw»°}v»ÀSg»ÑqU»ÑÎS»¸ÁÖ»’Û»Yø¾»¤º¸5l¹½dç:aÀK:ôÿÄ;QÈ:ëÒÐ:Š:#Á:J¸±:²Ýg:ÿë7;†/:¸•ù:%ùÖ8&–_¹¾qº3ï8ºk`“ºxAéºh~ʺVšPºýںЬ4»T¡º×ºI—9‡s: ³’:-š€:‹°¡:ã‰;"´Ž;R(L;v³é;‡Z;Š5ê;“ã†;ƒ;ªªÐ;³Þ;ä„q;þ;ý6Á;äñ;ĶI;©°d;‹(³;BÑ—:È!N9›î'ºÔ꺋<»º¾eºÅºœ€}º”$ºíã!».ä»/ØpºØ|Ÿ¹Ûê8ôÀÉ8ÏLʸÛºY´º×Nö»1R€»RoÑ»HU…»)VÙ»#»?ø•»]p»hs»uÚ3»`D»­¶å»Ä¸Ê»ÐC1»Û§ô»äŠT»×%»¯vs»þ¶»/Fºæ‹FºX49èÑd:åɲ;&¹Ã;&_Ý:ýÜÎ:´ f:­ñi:ãžô;Ì;¨:çìÊ:€åU9‹7Ú¹^¢¹æH|¹íNйÕëÙº„rºOî˺¯½wºûfUºõº‹ ¹|×;8P¡8Á/M9î‚l:¡Bf;d¬;4´Ð;Z$z;z;€ÉŠ;‰® ;‘Rb;Ÿ˜ú;¹Å;Úo†;í;ã:‹;Çô-;°#;šG;p†i;å3:aݧ¹Pó›ºh „º«á„ºÁQaº·ÌºÆk5» úr»:tÁ»-9ñº½ùŹWàÍ9Œæ96"ˆ¹+ Úºj”˜º÷†»*H»5ó»*»Þ».¿»PÝÏ»tt»à'»…¯Æ»Z»ÃÜ$»álλíI—»óÞI»ò¸·»Øw»¦‰5»e<»dŽº¬LV¹"£-:©‰8;#4];C<¬;0Pž;;ˆ:ã¦Æ:õ&; f-;h°:ü|õ:ž{Æ9ÚŠ?¸râÒ¸sÅ9Mij9wtü¹B¨ºo¬pºØŠ ºü[Xº½Yžº9ê-¹¸ ¹“€8KèR:gŸ¥:ò~i;&'„;E#y;d´A;i©;;{ÎÄ;„é};“n;®‚K;Ë¢j;Õ·(;ÅÊþ;®_;œk~;…ÇÖ;B¶¹:Ùú9õ˜x¹Ô8Wºx,‰º¤p®º¶ÎüºÐßû» o»-)»!Zºo¸‹Éý9œä38˜xѹï£/º™Â\ºæw"»¶‰»ÂÔ»!‘>»[Þ»ˆñ©»‘–»”=‚»ªÎJ»Õë@»øqÖ¼7¼SC»ù»ÕMJ»Ÿûr»V¡§»HŽº]Ew:_b;jÕ;AoG;KÓ¾;*:';—Ž:÷+Q;($; wÛ:ý :¦þ¡9û¢h9SX9ÿÝB:zú:W)·¶>HºŒ_ëºå κ٠‡ºŠhyº°‡¹²3=7„ÅS:V<§:ñ#8;%kÎ;9<^;N³Î;Lî‘;]¡Ì;jº;ƒî±;žÎ¿;·ˆÁ;»¥ø;ª×Þ;–SA;„ V;WMå;#œ:¢ÔÑ9¤ž&¹±e ºPg›º’/=º²±.ºé’»—ô»˜Íº‹qQ¹)m×80Ñ`¹žˆºWz/º—iqº•bນ¿óºôål»Tð¡»”¡à»¤S»¤„뻶„g»áÏc¼‰Z¼ø¼Ô…»÷pW»Ð •»›f|»LqĺÝx¹…>j:¤Ùì;$=´;Kl;=J ;°÷:ÿ¶;K¨;¤ :õUá:#²:Ð:&':ž>Q:₃:¤Ð57Ư·º—’"ºÓ|Kº¥ º(à¹!Q99¥¾9:…œ|:ýÆ;'‹;/³W;7Ú;+âc;7)¤;@£‚;`?¥;‹sÁ;¢2:;¤R‡;’Td;uW»;JRÒ;ÒŸ:à:|,"9ª€¹`jº,⮺|/º¯…ºêWºâJƒºˆ™ß¹ë†Ö¹×ƒœº?¦òºoEغ)u©¹ÍÞ°ºŒ½Ý»8|2»–tI»°â‡»²!»¿ ûç ѼN»¼ °¼>»ïtw»È™ä»•JW»9m3º—•I9ðJÚ:öå¹;7–;@ab;"Û; ·ü; ^¾; q:îá‘:‹¯:ä::…*I;Wf;U×:ÄB‹¶:1;º’¿º¥Ø0º- 8ÏLÕ:F‰“:´Pg;}•;!–¯; £?;{Y;A;I>;'';1ýû;n;Ž–T;äÞ;j  ;0bë;:×õ :žžö:A'b9v?S¹‰÷º| º}غ´ù{º¸µ_º…àº<•µºAÁºQUo¹íN8€T–¹·4—» Ì)»‹ú_»²:½»¹K{»Ä¦ñ»è`µ¼ Ô¼ ^·»ÿÐ »âàL»½k-»ˆ »¹¾e¶:¦V—;uä;<«;-Ú;}ø;¢ú;¾R:ëZ±:yXÇ:C³Ä:Ïj×;.ß ;2ô:Æï’¸!¼ÌºfÛ{º$Ã9€Ë«:’Ââ:ä%µ; _ ;Æò; …¬;iœ:ºš :§ª™:­.o;Lý;E–z;sÙÑ;cœ-;#¥å:Õ#Æ:žë :ƒ?¿:>hZ9°£ô¸ª Ž¹à³ ºGxlº‰l-ºŒ­ºj°¾ºBõdº$‚`¹¸¼9£Q÷9MeÓº¹?¨»póÊ»©$¬»¹¸F»È¡#»éû¼ G¼âí»òPb»ÒX[»«Ñ»`Npº¨G:-Æø; ÿz;:²;:’ý;-¿®;/#J;%[:å% :eœ:p=3;7ª;D‰°;3…¸:µål8X)¹¶Å9ï :¤;Z;¾;;,; P:åd:Å:U:«P:z¥:¦ M;z;@/Â; Ƭ:Ã[ÿ:`¿:#<9Û­{8ØËz¹nýwº:WºD¦@ºY²´ºGൺ'—è¹ß&î·¯…:«q:$.}º<#Q»C»›1»¶¤æ»Í¸»î‹ˆ¼ÏÙ¼ãn»âŸ »¼˜†»Œô÷»°¥7•¦Ì:ñæ;@;N};@Ⱦ;8O¹;$9j:×bÂ:UD:„9A; ö;A…!;#ʱ:©o9È“9ÑÄ:šè„;ºË;í±;ËQ:½Û«:ŒÛ9“_~¹35¨¹-Ž¿:$ó÷:Ù Œ;Yð:Ëþñ:c‘9ë;/9z¹dÑœººG("ºg VºHºšº2!¹¨nš9 5ÿ:D¢>:}N~¸å(绦ԻŒºF»³—€»Ó@@»öpÿ¼Ïô»üzV»Ñ”8»ŸªR»BÒʺ%‰:Í ¥;JY;m®;]#Ú;Bâ9;¹:È@9:LJ¬:‡õ¥; ¶;0mË;Ä :¶Ðà:i>ú:–]:õ:¦;HJ:÷HN:;ó:5“¹QÖ†º8—º:m5·Ò®:d#t:¡ :ƒY]:[x9ùÕ¹°­4º3"'ºvµ6ºŠ¨ºe–öºEô¸”Y:$ $:‰ ƒ9‹:ºäYP»`½»°õL»Ú &¼:ؼ;#»÷z㻿ªB»v¹º­Ùw:Õ;Sª;Š ¤;„é;\}‘;%] :Ëy:i®:–˜Y;"P;#Vå;ªY:Üû:»):åxê;—s:ÛÎ:i\ó9›÷‘º>e4º~º£ø˜º7¸³8ÜüÀ:,Z!:5w¢9²h‚¹&1º7׺dð…ºš ¦º”ϘºD¥¸¸#¾¥:#>é9¦ ɺ´É‹»h¢»¬“h»ÞH¼ç¼ ñx»õtÛ»¬ºî»"$:øµ;Nȯ;œT”;¡â7;†,â;@:òÒ‰:¦©':Æ(};Î~;(î;Û€;p:õtH:ó¬e:¬Qó9Ôhr¹w%º²g®ºèküºøþ¤º¼««¹ûU:9ªt1:xe9¢}¶8b­¹ø67º–7®º¼xœºÉ7¹±ò¹'d³º®‘«»W.©»¥¸ »ÝK˜¼P¼ 5»ô˜â»– ~ºÜ¹;#O<;£ ˆ;½¼;¥æ;o¬‰;b:û[ü; Ê–;-‘;>h©;4·ä;¥I:çݹ:bðt¹…»„ºvÕù»~h»†ý»)J »­Pº5âÊ9¬¢´:IR¢:UñS9cøºl‹†ºÑ¿wº´ÈýºxÁ¶ºÉÌ»N…»žÅF»Ø2u¼ ]›¼+û»ð†ò»q®:C;®‚;Ê\;À…ó;‘‡!;J Ó;,U;<Ïî;Rý;W¾X;;€É:ùJ:?ëºx’Ǻà[™».¤È»D›‘»F§ü»¢Ä¹ž{#:…½Õ:ÔÑ :Œ^¹×Þ@º½iºÃ—<ºáÉ»Ed·»™B!»Ó#‡¼ 5¼¬»ãJ »¸;-GV;½âÓ;Î);£ö;hVî;MW;b¨˜;oŠW;[Bê;…9½!ŽºÁZt»7p»JIM»YúP»@<º "<:oa^;‰H:ý9œ6ñºtõẾZâ»)v»òD»Ð4*¼„a¼mö»Æ#Ⱥ;Œñ,;ÇP¢;ª‚;rÐ;ZŒª;tL ;pU~;,ŒÝ: L ºÞms»6ãÊ»W¾À»U0»&ÿ9ÜJì;'ôó;0ÙH:”Å”¹‹%>ºÑd»xßr»Ë|v¼A©¼ »“Ú:ÃOn;¨=¢;¦¹ð;pLÑ;Z2K;oåè;EwY:zºÐ³€»BÊ8»Y±A»/ðë¹É÷;# !;Z¸;¦ë9¡1»$„ü»¼[…¼¨·»ñø.»,P;U®ó;›âY;nŸµ;W ü;Rå½:Ê\hºŸëe»Cýz»S=ºÂ„7;};zSä;*Ý1¹· -»˜/»ù-»Ã:95i‘;†ñ;wÆå;TlÇ;¢1º!ú»A»AÁ :& ;†œ7;8z»†»ãsR»Šp;"m©;…²Ó;H¿Q9°ÏË»>¤Ã»Îœ;ƒ!;‡m»¾à¼» ;Š­þ;x»6" :¤ð±»IÃ:÷0ºwyF././@LongLink0000000000000000000000000000015300000000000011214 Lustar 00000000000000healpy-1.8.1/healpy/test/data/cl_wmap_band_iqumap_r9_7yr_WVxspec_v4_udgraded32_II_lmax64_rmmono_3iter.fitshealpy-1.8.1/healpy/test/data/cl_wmap_band_iqumap_r9_7yr_WVxspec_v4_udgraded32_II_lmax64_rmmono_3ite0000654000175000017530000002640012276746731034111 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2014-01-14T19:01:01' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'TABLE ' / ASCII table extension BITPIX = 8 / 8-bit ASCII characters NAXIS = 2 / 2-dimensional ASCII table NAXIS1 = 15 / width of table in characters NAXIS2 = 65 / number of rows in table PCOUNT = 0 / no group parameters (required keyword) GCOUNT = 1 / one data group (required keyword) TFIELDS = 1 / number of fields in each row COMMENT ----------------------------------------------- COMMENT Map Analysis Specific Keywords COMMENT ----------------------------------------------- EXTNAME = 'ANALYSED CROSS POWER SPECTRUM' COMMENT CREATOR = 'ANAFAST ' / Software creating the FITS file VERSION = '3.11 ' / Version of the simulation software COMMENT MAX-LPOL= 64 / Maximum Legendre order L COMMENT POLAR = F / Polarisation included (True/False) BCROSS = F / Magnetic cross terms included (True/False) COMMENT NSIDE = 32 / Resolution Parameter of Input Map COORDSYS= 'unknown ' / Input Map Coordinate system COMMENT G = Galactic, E = ecliptic, C = celestial = equatorial COMMENT TBCOL1 = 1 / beginning column of field 1 TFORM1 = 'E15.7 ' TTYPE1 = 'TEMPERATURE' / Temperature C(l) TUNIT1 = '^2 ' / square of map units COMMENT CUT-SKY = 0.000000000000E+00 / [deg] Symmetric Cut Sky NITERALM= 3 / Number of iterations for a_lms extraction LREGRESS= 1 / Regression of low multipoles (0/1/2) NMAPS_IN= 2 / Number of maps (co-)analysed (1/2) COMMENT HISTORY Input Map1 = wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits HISTORY Input Map2 = wmap_band_iqumap_r9_7yr_V_v4_udgraded32_masked.fits END 3.8113821E-11 3.9654506E-06 4.5803368E-05 9.6292591E-05 1.1860339E-04 1.1168914E-04 4.4884171E-05 4.6054989E-05 3.0653522E-05 2.9247529E-05 1.6336451E-05 2.8232542E-05 1.5068387E-05 1.7006696E-05 1.7160228E-05 1.2958244E-05 1.2032266E-05 1.1709052E-05 6.1748001E-06 9.3632098E-06 5.5478167E-06 4.8620650E-06 3.9769957E-06 4.6241457E-06 5.6935928E-06 4.4905291E-06 4.9183400E-06 4.9639752E-06 4.5160127E-06 4.5209140E-06 3.6474119E-06 4.2834340E-06 5.3268277E-06 3.3172198E-06 3.6983699E-06 2.3960129E-06 3.4645136E-06 2.5494594E-06 3.4671673E-06 3.5282451E-06 3.3109943E-06 3.5375799E-06 3.5123887E-06 3.3512979E-06 2.2368963E-06 2.2496997E-06 2.3724469E-06 2.5460008E-06 1.7534456E-06 2.3832351E-06 2.0410664E-06 2.1037938E-06 2.1080539E-06 1.6286394E-06 1.9294610E-06 2.0597274E-06 1.6830304E-06 1.6431676E-06 1.6247285E-06 1.6202574E-06 1.7479871E-06 1.5648384E-06 1.5660847E-06 1.2259272E-06 1.1410553E-06 healpy-1.8.1/healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32.fits0000654000175000017530000045760012276746731027131 0ustar zoncaplanck00000000000000SIMPLE = T / conforms to FITS standard BITPIX = 8 / array data type NAXIS = 0 / number of array dimensions EXTEND = T END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / array data type NAXIS = 2 / number of array dimensions NAXIS1 = 12288 / length of dimension 1 NAXIS2 = 12 / length of dimension 2 PCOUNT = 0 / number of group parameters GCOUNT = 1 / number of groups TFIELDS = 3 / number of table fields TTYPE1 = 'I_STOKES' TFORM1 = '1024E ' TTYPE2 = 'Q_STOKES' TFORM2 = '1024E ' TTYPE3 = 'U_STOKES' TFORM3 = '1024E ' PIXTYPE = 'HEALPIX ' / HEALPIX pixelisation ORDERING= 'RING ' / Pixel ordering scheme, either RING or NESTED EXTNAME = 'xtension' / name of this binary table extension NSIDE = 32 / Resolution parameter of HEALPIX FIRSTPIX= 0 / First pixel # (0 based) LASTPIX = 12287 / Last pixel # (0 based) INDXSCHM= 'IMPLICIT' / Indexing: IMPLICIT or EXPLICIT END ¾ Žú¼íó¼Äl$né;Ïjf¼ŸSä<î‡3=¨¸6<¹ …=©Øç=7 ¡>íÑ<”þN¼Û? =VVr¼*b_=ag=<Öï<¤N&<¼±à=¢®,=rÓn¼œ™š=5Œ¶<ÔQP=àg½Ow:9ì=[±¬=¶­=à Ö<×eN=Å'•n>?š>MV×>:¬=´€1=Ôte=‚Ò=¸;¼FC=$êj=odë=¨ =05r<®}ýEL¡½k”€¼Ú„¦<É!»(;i<¸y½Gq<¡â-=´?';sšP;³;Bœ<ÀCU<*†³=.ÚÆ*ZO>Kf>:á=†Ë—=ù8=ycÿ=â·Ù<Ñ»È=œ*÷=YN"=ˆ"¸='_©½PŠÃ=`‚=UcÄ=s=½"O=Ìn¨–y=}Õ/>>x>-°=@‚ã=¤»=‡‰<&§=Hé¼=`nŸ=N'=æ¢='÷Á¼L(ª<´ŒR=XÉø;Evy<©´”¼“°›< $=Äê‡<²¨G=§·Â=c·<ÄÕÜ=r ¯;⽊=²÷F¼‹2·¼ÆBX=qY1°Á=¥g1="+º=)©=<üÕ»t¡P=µ–®=ss=Ÿ•»Ò²~<ý[=:ºŠ=¶ „=©¿ßº"èO=-ß7·=3’=w8=?cn=áï=´„=Í>½ZÂ=^o2=Œm-‰=¤ƒI=É»R=[o=š!=‘0<€°ä"™¸= Üo½ ý =<Èz=¯5=Š½b6<˜ãÊ=vZż”½;wÍ3<ÿw&»–ôê½cO>=xŒ®¼Ý¢ ¼wj=•=‘fS<¦bš=ŠÅ=“w%>7wˆ=Ìr2>/š=#'ì=âjˆ> ž2=.’»nãŽ:¼¨7=–Ƽàï<"v=pã=Xv=NOB>=´DÄ<’ö—<¾ç7<¢ˆ=‘Nºº0»Üú²<©ù<[ÜY½2м„€&>‚™=ý\=Êt= P=Á˜K=‰ä¶<þê@½¸ì½.€D¼UP¢»ŠŒq½Kb»×$Õ=Aó<¨ü<¢[ÿ=t¼³?½~´=€uG=AˆÑ=‡#ö=FFk=”4J=øàÓ=$ÅB=ø_=´]Î>r,=ƒë>>*Ì—=4N=(¤;WJa<Š¼E½9C.½Ù=*|=rn;=¥º9=‡Ót=…Ü=—.T=flÕ<Òù¯;†d_=  =:p=/ý»ð?m=Ô}= ¶½aï½ ½þ=nÒµ<† Ö=BX@=»Ï‘<ŒìE=-±ø¼‡Ì;‘kí¾Ç= è½(ð<ÂM½QQk½Ï»c5õ=>T\<¸õ==qìú¼òs$=\Û<ÆÍë=ã'I¼°b‘=©Em=ˆ§—<û‘€=„Ø<ªsŸ<\Ï5½ ¸„=a…Ê=ô==ðy=ÀŠP=uJ‚<§Öà;§ÕÅ=m%þ;¯™!¼ö‡,=êI»Æs¡=‘ZN=½âÒ<öav=NW=ûá=›U=$«=ˆ¹;š²Ê=».ò=·D=]Á‹='Wê<œùñ<Ó™W<,3E<À4=Zz = †î;­­K<ö2æ½P¼ó½ºk½ý¼õm=½‚\Ö;â|½% í½³š6» Ù:µ>ý<4íQ<äõk¼N†W¼IÓè½Aí:ÏTê=`i="å;Ÿ$R=K‹=Ìj‹=t€v=Ô¤ÿ=šLN<Å_IºYÞºW©­=ƒ[¯=¢¤=,—¤=±<Úå(=f–½”[¼’¼¯¿£<ÒP¼þ…¹=Rft<Êf;›æ=í ò<àl<:0 ¼¤Ïz=¡;¼¡ÒŸ==ε=&r¿¼‘ž?= ¿R=Þæ=£Ýi<ÎuÙ=~æ<ÏO²=e·×¼/ôŠ<7ó<=7E¼ùL«½v`½ø¶+½Ïl”½ªwß½tLµ½=ð¼ôë ¼‚²t½? j½Týõ ú;_|=ì<Ül6é=ž›c= ¬$<øÖE=“òè=j¿<ë¿8½b;½UÛ=ëÔ¤=¯Øm=¦<訽ºã=Óû«½\"½x§¼ìõ亄@&c»ÄÉü=‡ü=-þѼ}¼‚^;²Ã¢<†pO½ q½ Ñú=G©½ß£Ö¼ =ž;ž¼ ¡~=0á¼>u<<½ Þ«;kýñ= õv8;Ô=îÖ¼U£Ö½i_@=Ÿ·V=°åÁ=ŠL༮üü»Qºí½U=¼ É ¹UŒ3=äé½B»¼¶½ë('½_‘…½u¢¼C<³T=O—½>½<'“;¿iÔ½læ½$N ¼Ì]Š½*=€m ¼ úý»5¢,=™æ*=N¤!»âN=½•¯=jÁ==§=²¡<‹¨3=SÍ<Ûï%<Ԣ弯ZE<¬¯=.i =Nóë=’×=uª<a0=& »=rÁ> ˆJ½„ô¼ŠrU¼ÕlÌ=¡³þ¼Aìe½#Õ¼“Ï.ºà>=ã<ßAv;—àB=lÞ<“j<½…䊻%Ä<Ñw<µ3·<ôo»ù6`=M]=Ök„=…;‰=±‚ =GÞ½¤ãº½Ž;û•Ü:€ Ü<ÌrϽ‡àO½+íÍ=Â/<Û¹´=¢Îc;¨½+Þ¿¼ãÖE¼PŸ»1Þ¨=%¶8=p¯ö¼i=9m¶=ìÂ<ߧ½Ä8ª½ÇžÓ½Š½ø ½§Ëʽ WÙ¼µŒëºxC¹=·HV<5­k=áŸQ¼Õ"=–b¼;¨‘–=‘§¾=.èY>˜<Îû­;Zœ=¹­:àfÊ;À,þ=sä <å•h;Hì|=^&Ì=£qL:ê¼›=‘Í8½–ç8½Êý0÷¼5<%<Ú(ï=°œp;¸Ž}½äV}½TO`¼»¯É½³u=ÆJ€¼Ýû-¼'x¦¼Ææ`½›½yá#= ³*¼ùó³=3á/<°„Ü» à=„ ==Ja7½ ½‘§P<ýœ=@ï=À!Z¼h5m=^JR½—&=r« <ŒÆ= w»ŸŽ0=ÍËü“×–¼Å˜Ê=/gX<Þ3ï½D¥€½L×R½€»½ƒÂr½oø7;aéõ½…f½¤=Þ½KtŒ½Ð>½Ï…¼"³g;â¿ú=ö=·lC=îí=é¯Ê> j=‡ó@> Û=Æ–¥=¶"_=¹3Ö<ìmm=£Bq:N <Òk‹='Ûý=…tË<¤š=…($;©zÁ½Û¶=èa‘<­2‹=Šs<·ý<¤ó½ÿ<Ó†<þ`F=eÆ‚=Î=?•==èë±=3æ2¼ñd¯º¥½'º¼F™OÀ=²úW=˜­+¼)²ÿ;äÿ=%W½3¦¼Ü‹#½ì/½Å< âv=874=œ´á<õQ <¥º=ÝÐœ=¯Ÿù<¢ë÷½W9"=eÄ€=­.=7'= hº/ƒa»ò!ºV”< ²;8ø»é#•;VÂó<\Úa;½ò.ºp/~¼.=;qj¹#‡ñ;w£ñº” <',šºh]ä¼(/‡»’ÙƒºÁÓ;¡(O»Å2 <¥!:„KÇ;Òû¼‚‡E»Ó—¼°±»üØM;a–T;¬(¼:²‡3;Ò»ã?†æ;’ ¬»Ì,Ÿ»„ð¼»Â·2;³>¹:Œß’;×_²;¹Ò<,·;æ “;ßïÎ<%&„ºôñ<¼¨¾¼@v,¼ß¼+M”»‡» %;ËÇ—;àƒ$<˜ÛZ<‹å;q_ <¦®<3h9µ™;`ä:!;¥btºÆPŸº|`Ø»Gݺ fA:®Æμ%³;aûŠ<8à;¶^2;§*s;$¤?ºÀÕż Z;œe»áߢ8¹+Ë:»’ª;rí»ªžQ:Ä‹ª¹ºßøºLðºwż=©Z¼Z”; –Q¹Æ?e¼Ž›©»¼¼=»Ý–»êMÉ» cw»“*»ôì¼"¼;w€j<¦ÍÎ;M,1<5e·;ñÏ<,Ã÷<%M<ˆY;·f»–Ì&<0›Œ;Mú]»Q”:pùì¼VJã¼P‘|»òa¼ßn9…€V¼’î)¼—nU¼ÅͼU“滳„ô¼RƼ2ºÌ»CÉe»_ý¼ ü6Ó‡<«7¼'Å;Ž ¾»ë¯»6¦/<-½é;Þ <T<;L­;ǨǓ;ÂÒk:†¨ »ó¥L;ŸBŠ»‘Sr;EOÑ»¡9¢¼5&1¼tƒ¼+_»¾Iþ¼(/—¼†®&»ú,û¼Šà9»œôš¼s;n»ŒûŹڵ@<2>¼‚NÏ»M3–:'軃(‡:©ô¼Ì¼~’ ¼O »²ˆ¼tð_»EYG¼bS»ˆ ±»Ê \»Kö¯»åÙP¼³_'¼­¯|¼¶ëÀ9þϼ¬º]‹¼м+ô'»Ýô<@©< ˆ;Çÿt´:±ÙºßäÕ;ÅÄœ»®Šw:Õ5Á:‚Ÿ)<)ºâº»ÀZ»d×X¼ä>:ϼ’<4õ}<è ¹CN:;ùyb;–]¹;„Á£< ò<“»çõ;:Hä»Øb;ÑÅ&»Å;¶»¹8i»ôÊм4!Õ¼ܼ%l^ºô°¹[‘*»¯\=ºÑ8í;¯6f:Ãœ;ÁÅ<Îò;Tæ%;Þyh<'≻”€L:âéY¼ˆñ9&7»›ãZ»%¼†M»T’û»TÂ¥¼!˜º+^»ìøÇ9†Ú׺Œ2»Û_’;·ïÀ»Qžš»ªhI;n/¶;œ?»X¬Ž;ª|¹O×»¶?…¼ ÷c¼š ¼~D»¨˜4»Ö'¼Sþ1»,ÌM¼‡Óˆ;§+í<-âa<%¬¬»¤Rº;ôE‚;À%Cú:õö;ÜžQ;ø§Û;“ðš<®;·Ë©<‡ñ¹;èñv<6ctºÈôa;¨;;ûO¼zHU»Åc`º½éÒ»Ü?¾»5à;œôÙ;Vµ‚:‘à“º“èf»Ž¸¸öuº_!)»£[﹑“¼y{±:Î)–;_°»´†¼7+f»†Éò¼vξ»´Òh¼Aÿ#ºÊ¤&º«‰«;ʳ<²Â<8ª<uL»ñäIÂ<a »4Ÿn<¡l1¼UI»u]t;ÚÿR;îF#;µwy@9ðÇ»;›©»×?r;ÁîX»ŒÈñ»Ï“—»Hdõ»é»ºö»Ìàp»Ñ"dºÆq~:-ÏO;ö}´¼Lù¼Gà°¼<÷þ¼_n»©ž»MQ¼•i»ôÞÀ¼Ÿƒ£»Ù;»©9:ç1‰¼6L»ä5E»Hm±»4ë»Ñؤ9 £N»é„ 9`ÉͼB»|Õ;__x»~r¼LÜn¼Ë‘¼ 3•¼O[¸»:Ž»¡»í0;Ãs÷:Iæ<ŒV7;Èá <°g¸¼(:<Œþ;¬l¹»?¢9;Ò}=8•ùû;˜9‚¬‡:ÌD#<Fé;.á‡<o£;€—)¼/þ;¶½¼Y˜]ºîõS;y*×»§};ÂåŽ<£?¼ciS¼ +º:X–ºáEºz’ì¼;Þ:ŽWÔ:EâO<,›><µÞº7»ºGõ”¼ éÏ»‘E»©°M»Dâ@;ò\»¦f»lGQ»UàF¼V°Þ»Î#Y»âq*¼ %¡¼ WÌ»ìz8±G»¦ó»žÓ³<°c»kB96æ¡»‡£R¼7μÝb»Å“'¼pR¸»¡‡¼E)ÿ»ÕÒ»³K7¼[õ¼9¥!¼RÍ\»^:>¼”ÊL»LÕÃ<Šà.;ο&v»@%f¼–»cF;Ƙc;×/~;§p37<Ϩ<a̺b‘u;ý »–ò•;jõ<l": ¬^¼8+‹¼…¹ß»ÿs˜¼Œ9 <˜…;÷:.秼H;fåÕ;N¢_¼h©e¼qI;°•¼®ÀºÜÅ<»Ud¥¼9–#¼bZe;ý÷»1Õ»&?_;Yì»jþ滨;»HÛæ;JÎs¼>±»Ïñ\º)Îõ;3诼jZ¼mAPºâfÔ»~T¼øo»o S»Á%ê¼Â9b»âa½¼7hG»ïGºš$º½ ;»y÷ú7S=‘Òb=e  ½[8¼Ì9M½ I¼®iö»§by<=ªx¥=ØUl=_Ââ=dlP¼Ù׌s=åÞ=ËÕx=Ȫ^¼«“_=$¦O=¾qc=q¬‘=…ü= ^~<¦xwØ> •=8Y¸<ÅiW½x›L½ƒ„p½ À›½É‘½òk¤<‰iø;¼’=wî½``é<\¦="1ƒ¼>‘,½a¸½Hõ¾½¤—$½$Ã^½‚F<6Ù¿=€Ù%=:)=–ó³<æË<ùQ¼7Æ/½eš¼Ñg=+4O¼6‰Ú:à»ïD6¹‡ ÷¼&õ=aöK=E‹=Ñ’¹<>™§=ë»/=żÌ[k<€~Ö=mœ<ø;w<{^J¼zû:=¥®¼SÉJ»`)Ç:—NH¼0Àá½|‡½Ž„ò<莼¥³ý½•ÓöÏì=Ñ¢<÷I»°3=*ºT¼ËÔÛ<§ðÝ<Þ\ƽ2^½¿£Z¼bü=dÖ';h=‚»ú'ý¼›N%¼¸ÂK½oòD½º^¼ ‡n¼ó”3=­§…<št¼æã¼>îL=nĤ<ÕXÚ¼{«=[ò½4qÏ»øÄÞ½7s‡½¬ïª½Žf!½Kj½Í&½Û½,è »•Â@<­4í;•Ü£=^Æi=¬ð<)¤¯=oN½C6L=3=@‹À<ºx}=U±D¹ÿß4=—‚= )'»‚h#=¼iŠ=žË2¼À<ƉC½eÈs=ñ¿= AÞ¼¿‰;Á§¼†æ½w¼ï—b:™6é¼SAK<²t;å”n½„ǽ²½7ľ "g½Þb½F“è½lÌÌ;è-h½ôõ»{¦…<Ûq彈b6½Ú{…='`J»Îsß< ø–½ŸL¼µž!½ŽE„=S5n¼”ÉÛ;»èy=V¯~<—¢¸¼}?ª9áÝ3<‰‚˜=R¿n;(’f½5âá½H=ü=jØ=PÐK=«o==«Uµ=¨î="'n<µz¼èÝ«<†B=¿Ø¼ˆÐ㽧Ða<ƒ6Ü<¦,´¼ó½G½‚…Ì<øß=”ên=¦†<£t¼÷ý ½¬NÂ=>ʼ•Øöº£>v<?=8Q=”SÎ=GE‘=ÈèÐ=µÛ˜¼yZŽ½®Ô›¼+½??ñ¾Kø½ŸŽý=Á <;/=²> ¼ÂE§¼”:[<÷èâ<¾Y{=T›—=~K=K·=ÒÀw> &c=>µá=jÍ=´¬¼‚‘<ôwo=K/=KΘ=šZ¼y #½L«U<ê<ÁÀ¼š½€8„½Bä=½\Ú< ´¼šš&½Ùcï½]4˼í†{=šÑâ=†Ål= ˆ» •b=Dµ¡¼8/»ŽÆ—½©»L½J)Ï<¥~Ê<5ñ£=Îö=zl ¼?‘¼úí¡»ÈÿZ=!*½"²_½$¼Þ0F¼¼¼î÷<' œ=Šæp¼·ÀX¼ô埽gïÚ:A×;×´j½ÕÔ¼zó½ØK¼rxœ=ZåÈ<þõI½ŽÍ ;Í <õœ =øž§<·æ=>yª=ð²ú<¼ç¶';þJ“½Cû½Ží= _¿<5“r»ž±8=H=‘ªK<Ð^I½;Á‚¼¼`a¼¦!=¼t½.u¼ ú=â;=¼(˽2-<R!½™Ž= +¼=#[ì<ÌùG=[—-=—êÛ=§ ==öÿ]‰Ù=¡»¨=D ®¼©{^<%¶=ˆK=‚›½¡FÙ¼~½.w_½ÑR¯¼`‡½G€?¼uSŠ<»XJ<÷q¼º·2¼QP»)x=»â\±¹ªðÊ»tGË»¼’¦»{Í»Ä Õ¼v|»¥”»ØðÔ¼BìÜ9Ê7R»$ä:ƒ»Í;¼› λëjÈ9àO¼I5»›ï»‹(ɼŸQ¼!W ¼9½ˆ¼˜!"»ŽŠ¼^W»ÆŸB<:´ö¼fIó»¾¾z»uhÈ<Ítc;‡Dr»dlW< Mö9ç%‰¼‰2-<'<~’<€<à+;ÛYLºÌPÏ;Þ,÷¼T)»wµN¼—%º±™Ú¼%_º¼%Í©9µ¼y»Îe»¢ÙŠ¼¼‚™¼—£lºÉ¶ô¼™Aç»K!¼a_4¼@QÙ¼vÔ¼Œ(ì¼Cɼ}^?¼³Õ—»Š4»rD§º‚?¼Ž(ú»‡n»Z⼩Š%¼^~Þºk ½ºy³¼h½»[€ ;-ÎŽ<‘}>;áâ <.ë½ø;¼|.<È;7è:ȹ;n;©[^:œ÷ ; 7Ù;Þjà:ܹõ»ç$»;÷ÕP;Þ»#Ão:K™I»žÒö¼(.»‹à»7ã<:¥»®ië¼j‡»HÜ„»—/9»¨a~;­ˆJ»VÝË»Äßé<øü»½öÈ;A_;äã›;<:3:±7kºEy»£Gd¼¹Â¼L±¼”Z¼eðk¼-X¼)qè¼_p¯¼›¡¼0@q»:z-¼.¼1:¼œu»Øœ¼I<­¼\¸9¼μ©»7P®»ß-ß¼[d,¼-©¼5)»¿œ‘»ëû$¼&É»Áÿ»(i»ÀéP<ˆ¯:Ž*z;ÊæкËá<¦aV<" {<Ž‡f¼#W黪K„<{;î‹<&ìû<̇<‡UÃ<ŒFz;“½Ì<%ôø¹âP¹¼Qß’;î©Þ¼”¶¢;Í9®»Ž6¼„ %»ñ‹P¼;'†<ˆè‹<µÿ<ù߸;ê;‰M»¤§£»¹BÛ¼3‡¼nQ¤¼˜Ò ¼•&»×ȹ¢¼ò§¼ JR»”¢K¼¦1+¼YÁ¼+”r¼G¬|»æo|:‚Èϼ´³»›ÚD»7R>Ú»e¨³;ÅмFp´9!@å¼0y;ï›};º#;Ìð ºÈK<>ªp;’;튶»¡Ó¹îßÃ;yÿ¼H}¼9$Q»jÂ^»Ênó:.zÆ»°L¼ ñ™¼ ÕÁ¼6yJ»dS¼.î;—AC»•q:êÍH;æ¬N¼Vļ ý­:>mK;N38:Ùj¥»Ðó¼:¼¥¼‚Æ+;SÏƼ+¾=»ª>:£}:Wã|¼ƒv¼Œsk¼rz ½.Ú¼¢ ¼n¯ø»§ta»üM®¼Ñ<¼wa¼BÐÏ»¾:š¼F‘ú»ô>¹€™^»ñmo¼8mn»™\U¼NZͼ"A}:Ê`í;°—¼"@Ѽ ؼV@Ö¼DáBº»þG¼…ì¼:Ô{»3kd¼RW¼E©ã»hØs»ëú¾9z´m:…VE;žÏ=º¢¸£’å¼øpºj¶—¼"ðv¼H9â÷»æô»ÖS»b¶àº«1u¼ oD¼##á¼"5Ú¼ Š³»L+Š¼SQ6:Bÿr»¸';²ô»Xɾ<1^v;QcY<-´»Uцº/qˆ:Ó¾ì;!ðí;³Î<¼‰<Œƒ»`à¼G&T:ï-ñ»Èµ,;\ü.¼&’¼luŽ¼/³v»óIb¼7G“¼ŒÏû»q×»½R· í¾8¬“S:‰ÿ;¼î< Õv¼`&¢»÷U¼QP#»Šæ¼vº¸÷r»V:Ž¼³—»¨.ö»•‘»»ºR ;£Jx¼lŒS»š°¼Du;Åxlº¬m‘»„Û{:¯¼yÌ®» ?Í»¾Nz¼6~ö¼"¬Í¼FHE;—x¯¼†[»C ˜»¦M»}7¹»<{;2ðÓ»s;Çú;ÀqÖ¼’ƒM»þÏ»H­»Îò±»‚Iݼ-øÁ¼œ<–º»¸Â;&m ¼@oV¼<½»Äùé¼PÔº°'»ÏUC¼  Ú¼g­š¼-'¶»¹95»ÏoÀ¼Ñ»´Þ»qr¼^qÅ»À^»îp¼ó*»«ý.;Oḻ†ß»Þy»«£»òfN;Òº¼}w½¼yç°¼§Å$» ŠÐ¼`9»‹ð…») /ºA]ÿ»&JÇ»›˜?¼Rƒx¼«Žs»E©Êº×¯<{ò¼ 4ß¼É);Í~»ÉP¿:är]¼Ba»Â ß»º›;~ n» 3;žw»”Í@»y¼uÈÆ»‘@ã¼{•c»ɉ¼ X¹<&¿v»½üà:‹J:»ËÖ»Á¼…3¨9úÝ:oA¤:¢öÁ;»Š”»ØOF¼/¢·»Ç_»]â½¼²Æ»Œl¡¼´ª¼c»é¿¼Q` »Iȼ2vÔ¼_iš¼bè7»øZ–¼1*¼I—»šUµ¼@Þ>ºù»“cŽ¼{TW¼"> ;a.<ÐM²»¥ÛZ¸¼¯"<ˆ¸t;Ž!Á;£FÚº8…‡»Âçõ<]Óü<,ÐÃ;²ÞÍ9‡9“;¤ã\»?:ãÛk¼D[ »€†¼,䫼¨G¼Oâ »(‰2»×Lsº‚ A¼Ô7ºÊ F¼t!»iú;úO…»t/H»„²v:ãÄ“»%:¸òE;£k×»¨¾ï»j§»Ýçµ»•í¸a‚„¼" »°Ö²¼³ d¼–uú¼Í¼v b¼x/†¼S¸»¾½¼Žöy9¢Ï‘¼Uz¼Òuê;€þ¹¾}·»LؼŸ;øƒ°»T×À<ŽÎ~:P-<Ìo<Mº<ËT¡¸ÿ8:Î=ã< 8c<VŸçÛ:è1ê¼8< m);–²¼%t%¼';=Êa;a»cn;÷H8»Çƒ.¼R„»‚U2»Ü’9õ<ù»h£g;r»v: ( Cº×Šg¼B¯Q»òÉ»B«V»¿‰¹¢X9ÉÅ­» ¢­¼ZŠ ¼CÝN¼uŽ»®5­»)‚Ì»ŸÒ0º÷Oˆ¼rŽ ¼4v‘¼BîJ¼iS=8§¹ñ¼—’K»34z¼}†¼“#Ÿ¼>·¼¬,»ïÓT:Gt`;v-T»»íè$<|‹;ðLß;¸­N<ãå»' Q< %¦:!òù:ÿ9;ÂÞ•;^aÎ< º»~3ºi‘¼-O¼! ™;©BA¼xóQ»¥ ~;D$¼…6\¼I ÿ¼6; ñá:ÿ; ¼ù®¹UlÙ¼F+;»¹»L‡a¼tÈÜ:%}X;H ;ÙdŠº\^q¼^ô+»±p\»¥”A“k»¤¼c¼n¶Ç:§»È»»èü¼ç¿»ÜÄ:¼Ø|;’´Y»¦ŠÏ¼¬C·;KÑO»F.Š;€È»î®¡¼D ¼!Ak» ~“»ån6»ïmõ: öܼL¼(‚Q»-s;À ºÕûí¼î».·:‡_C»›žp»Xq{»©˜»^0i:¾Z»HÈz»3d廉·»€c¼`‚½»æ¯:S.ä¼`–ï»îo¥¼±Æ;»†ê̼5Ñ%¼„·¡=„ém=ÇV»1-]=™îø½;Tì½'ŠÉ<‰œ¹=âÓ½HÕ̽4}»;—J£½ró~¼ÔÙ½´ˆ$=¾º<Qó½‡ÙX½º~ì<Ø*7½v¼õ¾ –Ó½I½ŸL;¡ƒ½²Ó½®W=70õ<ÔQ0<µ®î¼‡|<L~»ihT<Òç±=7£=æ¬d=³T<ž*-½&$ñ:¥ <•£f¼ŒªÁ<Æ4=5€=“†<=IE´=¹$ß;ë«Í½m`´½œ»ž¼„Ë=nÑ̽~º+<Ýh²<ô<ý=wò‰¼¨½é¼UEÍ=—Ž9P½‚^Y¼î•›<‚O=#ùú<¿è:(\â=Ǽ¼=6ø»f*‹¼ ½*°¼ûíÖºO¹ƒ<x=l]&½ bì=˜-M=WØe=Øß=³å<=ÿÿ=;òê=èI£>Žæ=3¯ =¦ =$=m<Óª(=vŽÝ=&R÷½E1z½R÷;Å(ѽX±\½C¢‡=En<éËT=/ô½X󑽑Óe˜= Ôo=óÁf>=tqí<˽=>Ù‡»Ôe¼¬i±<|$o<„·p¼ð<>‚v½Ï1-½ªÚ= ¯m=hE¼ºÍ¼—4U½M¾ <ê“«"<.¤…=dN<.Aá=Ýd=ƒ[=Œ Û<5 ½<øð=3k¼!Ž¹º€×ø½H =_ö`;—°¼ñ^<õ@ˆ¼Å&6:50K½â¬h¼àlÓ=).û»¥Ã>½”H=,©h=“ZÆ=†h…=t˜Þ<Žf·={Z!>$m>Dõ=Ód»´ÆZ;)Ó=¥¾=Æ5Î<¬² ½b`î=Bu;2U½Eá»Äf<‚6”<ÕZ<âå”=¼œd<ɹ?<³9Ï;×Aë½9V·;u´’<çµ~½‘„e½«­;í³E<Û5‡¼*v¼ë†|¼’ª®<…ᑼÕÀ°;îš=ã=m[ä½yµ½•y¢½Þ3ؼÕí½‚ѽL® ;;=Ey‚;²oê½Çƒó½.ž=5³ð=ÎÀw=iWì=L$”=çØ"=ÓØ »ë•9QN=\%¼ ¡ö=™å=¨ã =L<Á¼¿*='f{æ0=ž¬}<¥ß¼Žº-<ó¿¼pg©»mÄE½_5n½¤dܽ; ½ro㽚'½în½_k=ž¿‹<5aI=ay½)£C½Ÿ³y¸œ;Ö¼¯«¼c>¼äH;Ž<¬œ¬=6ä=I€¼,ra<ÁSJ<)<{ô.<ñæ(=eeã<õ<½€$;ã^Ö¼AÊô;2!<òQX<¼æ<¯ëÀ=:b~=zÙ¼=- Ù=¦Ÿó=\L„<ûM²=p_‘¼"L=>¢=./Ͻ|WݽÎJ=Çn.=¿qQ¼ÚÕd=ˆ-n=rïÆ»EÿÕ=·.½³Ôð=g<Ò2Ù<ñ =„°f¼¾K:X½„¦½F-Ã< Sˆ<5²´=¨¾<¢æ½±]½I„ò¹å <¼õs;ïAô»Åˆ»æÔ…½¤¸»¼­’¼Ñ½¨½>‚< ¿…½ͼ¼u,Ž½Ƚ½\6=šûc<®¦¯½“Ú¼‚Hå=N­½µ“¢=Bá%<î =_v=JĪ> ƒ=ÿ̼‚Eº¼7Î=b&»ž^ˆ=6HZ»9=²½!_.½W¹¾;c‹;=f=SÆ»¼TL¼/€¾<ØQ²=b‹Ý=ÄJ=‰£¹=B[ ½tÐÅ<1P³=¿e1¼ÛJi=Q³ó;“å½g¿¼1…Ò¼ËAý=ÇÌÅ= 1°=€ï‘=Ã$<©Áw=zÛ“<Ðü½^p:;ûj+<ªÉˆ=rXÁ<éHH=ÿ¥=šc=—yx=¹á¥=73¼Ÿ ã½T™ <þÇ`= P­=^R)<¡ïżˑ~¼aÃ=£SU¼Ì•î=‚ºï7Ü= t<ÁFr»€m¼§%aÉH<€v¼[ç<é,@½ ¥F<Øt,½)³4½“vý¼¿Iï½–}‘½lø¼ãCͼ·‘<±D£½2½)Š½ h;ñ B¼ŽãN;"uݼ T=dó=q = ­±>$(=ƒ¨>¼y*È;á⡼¤“s¼Ù¶½Äfm;¶q¤¼é<£á;º‘G<÷[¥=jcp; ;Œ½¹ô <—"Æ<»]:ÀB=t¾¼¡†=,^=ûo= =K=2‹8= ”é<±ãË=!i‡=§1V=䃤=:ã©»¾5–>#ýŸ={=]îù<¶==º Œ=-ϼô…=ƒL.¼¨FS=fÆ£=NH´=ù©(=À–Ò;€…=s‰Cº [=oº=›ëd<…ù =œL="ùļlµ¼AL"<§^‰½Ñr}»là2=(V!:ÑÜö=†<ÐxŒ4»$ÿW=ƒ*ã=* ü<Âôá½Ö¬M¸ôѽ 1œ½Y<©à¼ª½Ì%æ½ËƬ½l¶5¼°|½ô½– ¥=^ =†q¼dS·;/¹=ƒ=Zs‹=ÏË;·÷h:Yõã=3"I½Î-=›Üe<µ§[=§é=…ìs»Á–꼅ѽ%><ï؆½U$<ƒ:¼¸2Y=,J¼ËGV=;-/½Ò`+=n=€ñؽT±½‰2‚½“Ýœ½*ø½‚QÓ½E=ôî½E>Û¼“Xî=“O;î•€=Õ1S=”„î¼£Ìe½¼T ¼I°¼P¿c<šh2½ÐÔ½nQ<|s=U­=¨´½:c‰Ç»±JÉ=<Î=A~Õ¼úÿA<¯øsº—˜È½x =Ç¡°<íwª< 0Ì=‚^å=n=KaºmB>>Lš>%Ë=¬àe=fZ > ¹ìg;=r8<ÿÝP¼BXþ»âÿ/º…’= óo=OŒ‘=ƒµÏ=Õy=œ½=ëÐ\=:<‚[=œÿ<˜ßÝ<©B³=H:=½=ŒMÙ=)b¿½n„=z+‰=+â ½ :=5í5=/¾¼»®·K¼¶è†<ÁÓë¼ïͽöP½×žœ;‚–4;8ƒz¼æh“º‚Zs:Ød=ŒR]¼bÀW»7Ã=Õ?Õ>z=P™¼)½yò<µ3½ŽÏ¹< ÒR=Kêg½óƒû½¤Ýú½ßÆŒ¼¡½Í½qg²¾7°½âÆ=aÕC½Ž‘¤:ª½•S‡½•É<ô݆º'Ù‹½?¯ñ¼™²=Y2|= f0=¢Žu=ŠÜϽY<¼)Ý=Zâš»_5;†Q½ÍÑk=$ =S+?=¥p=‡ #º>K\=®2D=1<¨ÓE½±ã¼/ð;e=`“Ó=,£F=ù¿ =Ãç¶=»ã;>1‡=†T=ÁY=ßUí=ÞÚ9[ä=2ÑÁ=Ååþ<£³ø»WCH<Ç­„¼Þ#&=Eó/¼ÓÚú½,#»êÈq=3!Ã<·Q ½„7ǽpÅ­¼•ýؼ–š½£N{½Á½¼¼ùÿ=BÀ:RZ<„€=^rÞ½H=¾½DŒ=Ÿ‡=ž¯d¼Ÿ.•½¬•:¤˜<˜Ïß½¯:/‰#<E‚½˜øƒ¾è½–Ó-½&q½‹4T½¿D»9;W=ÅTŠ=?Ö¬<‘Ú漤m»€{d»—°–»Š™P¼(€¼@Ö¼²’ò¼)W¼l{m¼¸»H…h¼Q|P¼B„s¼UÂë»ð2¼99»Úa5¼CF;ˆ ž»„¾ˆºOKê:±lÛ»>ƈ»êõi;Ä*Ð:^ÕL:¢7b;¾ ®»^Î@<x;Žú;œÜQ¼èg<”ÊY»±¯â: ³< y®»+ûúsÝ™»Æô#¼Çå»›b꼓»~§¼%zŸ¼]/A¼&¤³º³Ÿ»”;Ï»£ýü¼¤­¼cܼB¾»àK¼pS>¼‚µI»Û{C»Ð„,¼¨V`¼ld‹»Xhµ»¥­k¼\Z#<-±_:“Y9½Øœ;Ék<»Eú<¢Æ¡<òû‚Út<9À

_¼Ñ^L»ž¤¼‡>¼ÅÆ-»w‚Q¼ 2­¼ZO»Ö輚0“»m<Ó¼Gd"»§=:C6M¼”dè»öS»óȼ0i§¼8ã¼’¼ì«Èº¸ƒn¹<¯Ë¼‰a/< }9:N‡á»ïÏ—»°¢r<9[…<+‰<>Æ<;ô`a»Â¼ì6<¨{7» V:Ä‘;ÙÆú<¶F¦<`*$<5 Ê<Âm¸=½»Ó0‚Þ;¼;Vˆà;ú0¼mX;hî¼6~ <{œrº)‹n<'Gð¼4<¸på<ˆý²<,ö;•Vð»,b»ë%»òáÅ»…ðÏ<–ÿK»fúð;FÁy¸u˜:”¦;Ö=껸q”»Œfa;ëD»º 1:E4n»Çš;†7»öS*;$Ç»›9><7㤻ì‡9À¯]¼½8¥»R¯¢»’ÌR»Y‚Ï;tÂM:öUw»pR’»ÁÕà;§6ª»ͤ: õ‡< ò:ku“:z<b1»9Le¹5$ºf¯ßº×Vw¼Eë>»·H¼_nÔ¼dH¼œ² ¼÷6¼”Éø¼i:¼Ëa¼%e¼êð»ä~¼Ž¼[Ö«¼^§Ú¼¹¼÷n»$j¼Lz]¼€UT¼7ÖM¼’‘¼1Xg¼?ˆ¼\k‚¼^—e»²˜<|< §N»Äî¹<Ñ!eý<Ž~㸱³_¹öª#ºµ›Þ•;­Öœº°øw;N)i;h#¼¡#t¼œ¼`»‚ýJ¼º¸ë:òô\;Ç’ª:ò´‚<•^ß‚»¨—ἧìý¼$í;3Å»w渹ÃÀå¼Wˆ[»ØR*»|“ººˆ{x¼™7»]‡ ºlä5»›Q~º„s&ºÓ8¼U7À»•…‹»÷漑"¼I& »ú‡ü:BÖúÞ»»z€ß»Äý¼I[»–E;Ϥºg\9^£Û»cÛ¼%C»ü»Óe»L ñ¼¹—;Ö•:®K¶»ö°¹ô‚ò:Ý ‹;šáZ»¾é6;Å<©~:ÕÃ<\È» Õ ».SκsSz»Lçl;Lx‹:¢¶¼£÷¼†^Ƽ:úË»øЊ¼Ìo»õ³1»·.Ö¼¦q»äÙ¼ùõü;‚;"ºM¤·¼JñļrN¼àõ¼”L¬¼†ÿ¼Ÿªn¼¾¤S¼POù¼Ïw¼Ezv;˜ªë;¯Þkži¼|6'»‹Z˼¹p»åŽº¹&»¶Âß¼‰a0¼†>¼‡"2<[¼££”¼ÿ{X¼)¢¼Ê6¼Ø²¼I6ü¼`Ｇ#¼©2ô¼²t¼ƒM¼\ ;9‚v<‰¶ù<žÝÓ;âЛ;óœ¼4tݺò­¼’KÎ;;î;óâƒ; ^€|;Pñ8¸´— 92ÿ;<†»Ý;¼3&»›aͼøI:~+»¬¤¼(Žƒ¼XƼCÁ™;<¢S»Àݻ̴ºº¿¯Ö¼‰L°¼[D» ÚÒ;׈Ž¼at9<@j»ÿÞÊ:íä»°?z¼$)-»ù±¯¼/öºYÉ»Ù`»ªc»xÙ»{Õ½;n¦/»qn»ç”_;eÃ1¼%¼Bç¼9h»˜ö»ñ·„;Ùt¼t°¼6ëïºu÷ò»¹Ãñ¼Mnc¼'Œº|ï»y4b:@W0¼WÈ»·¤ú9o Œº.éy»`üº=QB:ÿ®¼'¼Á »ÃË:,»n¿»ñ—=»„}€»‘²>ºm`»¼“::Œ\:¼Qu_¼"L÷¼4ớĻ¾z—¹ó`»‹+C»„_:“€;P#¢¼&Ï »ÝÁh;—:ð¼GػЕY»@Ë:ŽU»Ì=e¼Á^¼•¼»jº· D¼‘ö¼•#,»“~ð¼L3¸¼™»< Ùõ¼‰T̼Ó[Ò¼4Pû¼hã¼´ì.¼2û¼ø ¡¼ñ‹¼:»œ»¸Ë‚»µô•ºçè|</Z:ÍÇÄ;Uð9ˆÃ;šE}º8š¹·«ž<ƒ‘†»š¬J:8Nôº´œ';á•I¼D;(⼘›þ»`ËÖ¼ó—¼HÛ»ÐFǼ¼Õ¼.—¢;—i±»ò0»ÌÅ8»¤ÆÕ:ds]¼€´»†¤9¼B»39ȯ¼º¹O¼Ï‘á;‚4f¼-»Sº>| ¼M|Þ;ºÚ?:å…p¸ßh´;è|ê;4Ïë;z¥ ¼‡š½¼”Œº>èT<€ã¦º@» ;vÀ(;Ó¿Ð:†4µ¹ ÁD»…A~¼ Š»òþ@»C·ˆ;+j»lPF»»0ó;’&‡¼2 »«#œ:“° »C_;Ƙõ»RÝ}9ÇÛª»f8–¼>¬G¼ }ź4캃°º¤—–»b:¨SÉ»ò»Ÿr»Û˜»ßXõ»{•B»þ&à:͆л_÷»‘Œ»C©h:œ„º»µÓ¾»*¤;ýÀa¹Ä,Ù»®²[»$uC:³‡?946º3=Ÿ:zvº !Ó¹ë¼*;§*(¼jK¼Mþ¼‚Þ¶8¹ 8»Ž…"¼I®¥¼r&f¼ÖI ¼Z ˜¼¶ëj¼X/Ѽå½ J3¼ˆ›A¼‘½7¼„%%¼[®¦¼½X“¼‡à¼Ðí~»¸}(¼…Ïè<†ÿμÌ)ò;ìÓ*<¶U¾;ÝYɼs(š¼k°«;µLü¼êȼÁ)±;dq®»ªv»jÃÿ;]7ü<,X:¯!÷;ƒU»Ó*<Ÿ»/åž»+Ñ »Ò8r»‘±ã»nÜ»>ñg»©–-»lï³»è¥c¼Ž¾ûº¬ì£¼gJ¼{õ¼kÞ®»ë®0¼Á@¸äa&<^î¼?}uº^“À¼Ž~¼ò¼ªeš¼™ì»èSÝ»8Îœ¼”„R»«½»§í»ß¹D;ìõ&ºÌ–'ºèÓ:ô`zº*\.º È.;¤qÄ<`#M9bW®:Ucé;/Z»BÓr;o:n;oCk<&‰»;j/§»3á:‚.êº Š ;Eõ»à»A!:ðŽ»­á¯»ßטº%“»¯»ºƒù;0¬Ê¹Ï™º`‰•:„9è»ñÓª;E/£»hÿH»ÕRAºAîS;̆:ÆF÷»T»e®a;¶b»=8þê=˜J=Q@<CB¼š@Ž<Íê>< ä¿½¾ÑŽ\Y>«ð<Ñ. ½lƼçÞ~<çMû=/h_»÷Æ{<“%ó= •6=‘œ=3b@:\èW=¥cc=uB½H:½ Z‚=#6ý=åú£;Z\½O¥=a¼–õ”=ED=Â.Š=’òR=n{µ=‡„g=ã<Œžß=€÷±=hÔÚ>Âw<¨HÎ=‘!=„¤>=ÇÆ3ºÆ[Ø<æ8C<‰½r¢b½mþ:G ;½˜»Ž¼ÔZÛ»¸ëØ=í׺ F=W„=/×k¼×½É¡½–P•½è½/“½‹P:X·= !;;+<›Ï=SêØ<•yh©=ÿß—<¶1þ=1öϽŸö=hÄ=%Èç½$Kž½¬Ý‰=;y¼a„½KÐ༲ãÜ= ”<Ñ%< 2†=û=QT=;°='ˆ)³=±ü€=„Ö÷=Ù2¼=Î7Ô=óâ¼^>:|×=íþÌ=Źû>W=°™±=r4ò>è=ÅlH=ÔÓù<—Jç>,û=^©X=`=¨ˆõ=9=K[=+\ø½s~„¼¿gÑ=\½F½E–ñ¼¶²ã;¿6¼«Üº¼“á0=)Ø:½>¢^»¾½á”M½ ¼:˜<½‘£<ײk=«­='ýн9{=º¤G=Nݹ=g™=—+‹=u=„õk=¡ø=«o"=Ϭ›=Çå‚=?`=õ¸2> õî=ቼ=U38=ã~š>Ý*=ÝÑ4=¨l½> \…=© /=•>q÷¹çˆ=DwM= ÎÆ=mÙ=C,¼AT¼<ó<µq%<Ý>D¼éC¯¼´eo½œ =Ž@Æ=§z²¾Ôé;¼0»Ø‘ý¼Wi«½¥<»¹=<5à¤:Ûq¥<ÿ ¿=A=Ïn1=)'=!S'=¾\³>s¼’Æ6=‡qƒ=Éî4> êq=ëc<Ùѯ<­`s»¸ÃF½‚ÍN;•ÓÁ½‡¢ì½W¥‹½–‡<L½ߟ¼j|¼éEd½•' =§Ùj=Ñqd>F?9=ÇOT=‚ ¯½„|I½lÌ–<Ä„<ñA¼þ}¥¼½ ž=ÿ}Ñ Š¼ÕÚÿºÍ é½Ñ%=áNÉ=´I=ªP>?w=ﮓ>e=›Ëf=ÜQ>)xá>Ñ>ú«=ÓoL=óç1=!H=‘Ìí=¦L\=kö¾>”Ø=ôX¡=½ßú<åKB½B«­<ÓÍè<’0λN‘¼Ébä½C¼­_×¼ ¹Õ<»î³½!¼Ð4³=ƒw3=¤ËA=št¼}WQ½žjƒ=¼çÖ=,éM½fDD¼ì€p¼èc…=§+=ky<'ú~=´Q<µ^㼆û1=¯Àx=š¸½À꠽Ϯñ¼Â{ ½1=á;î¨;;0¨R½tú¼•bŒ=pÛ>Y¶=­cm:«ý0<âÒ¼/¼ìno=ª0s=šé>î˜=Jê=neü½ƒða½´å˜<ú8¥½i‹«½Ç#î½п½~ã½OÄH½²_½NÏû½;•§½5í=Gä=vwG>HŒ=ƒ,h=lE½Æ#3º“`=ëy=Å(¿=|b ½5 æ¼Þ;ô¼Â>c<[+ʼÔÎÄ=& >!#ž=ÙÌ=W‚>·‹=\>=¾œ=€?껧5<ë²î=¤Ž=5¿ÿ=©ˆZ¼´ª-Üó=7ö¹=´+=QäÐ<›óð<&Å=Ɇ«=Ã,_>{mÄ>9=øšw>*ê;=4ƺ>&ðf=±Dæ=óÔõ=åP©>.%=çþ5=¯$><ïxê=çë7=Çô=ìc”=ݲš=¡§Æ=Ë0Aç=ºú5=”Æc;y=½LK“=zZ‰=—­¼†4U»|àä½°½Ùû½€ÆH½x(™½¶t=/Z<çå–>XÀ=¶=ÇÍ…¼;½³=4bß=Þ7G=Mõ=Tr§½ 1‚<}ýº½pê=Pƒ%oâ=ìC}=€aû=¸Òè=Á¿=9H$¼§•œ V¯»/Q<»E‚½ª&,½¯|o=È=GKÒ= éL¼á Lº;"¼w~/<ô›¦<›Äù> 5=›¸–=ˆÌ»=ž€U=i»ì>ð¶=µñ‘=ùü¢>K|î=£D>#2'=í>Q>IFø>:(>RçC>[Þ=ˆC =¦—*=;¦µ=GíM=µÆ = ‡Á=Æš=’ =¶L½’H=• ]<âØ8½¤…½°É¼›È›¼@ ƺ'z=å´<”Õ½!íÚ=BøŸ<ú7=Æê<–Î=j'<Î÷À=R¶;lÃ=i7¹=Ýø#¼Uœ:ï-Y=w²'=mœ»=üÚ×= P<°ç¤=üy=Ë­Ø}P=Ô «¼©dh¹Ö»*;yk¶Ú=Ôkë=@@Ú<÷k¼â/î=+{üD=ý¼í=²ÔÕ=åüͼ—„ô½fqó=“gË=™«v<¶ê¹=6‡=‡úû<´P»Øö×¼NªL<íRÄ â=úɼI$<ò[Å=K¢ý=G[=F€=‡›²=(D5>Eæ>{”>@æÀ>;.>,ݱ>'¥>4læ>‡ýÈ>ª <ˆ :=¦AV=û t=ýƒ=ÊGù=«™€>øA=³Š5=‡ï<¢ÓY;™î¼ºº½†ÈG¼Ž«#<Ï= ³½½Dlß;6,¼`ŠG¹<ì{<ŬÑ<”œŸ½<Á=Õ$<3 z<å¤4=¹;ž|t=ÞàD<À2b=°vœ=ÑÂX=°»(=Ýp~<ɱ‚<é}ß<‘õ±¼ÈT×=ˆð=^ËF=Z €½S¸¤½@ 5½4½/´=ôÊ=×µP<áæé=™½ž<Ñ[½qk=zp½Ì#;ZøŽ=V&Í> ˆÍ=’ìR>ñ|;ïù̼Î÷L¼ñV3»ƒV¥½V¬ ½HÚD½¥™½m]T½¶”½wÈÌ=û+‚=ö¿ <‚D$Ì»GW¤<°ÍP=39½XYÖ<‹«(½::#=V<½ð=½ÿ =mµÇ¹Í >"†;É44=Vv‰=Uæ6¼‰=«UÑ=¶4g>ò>j~=Ï94>’}=Ë Ï>ÿ€>?õ=´ ®=÷CÞ=^­Ô=ý=æª=ºG>Jh`=®§2<  ä¹Ú°±»¡8ñ¼6ja¼¢¡£<¬n=@ñRI¼Ø†í=©A =$2’=IØa¼º=úÄS»É (½XÌ<¼WîË=S+g<Ü›»Šô·=›K>òð=™›´;Ž3<àX¦¼¤í‘»ª-·;êµ;¼mÿ=‚ÎÕ=¥)ì>]Ÿ¼}„Xºñô¼¿ ¼OH̼=F2¼¥Ûg¼ØKɼ8\âºNcÔ:·V~º£ß©¼u=¼}CF»Q©·¼6œû¼\H?¼…óIºõÔ¼1廋»?U»œÈɼaM_»Ê¡};Ó—¼zId;¸Ca¼+ž ¼nÖ ¼…Œ{¼:4¼p›°¼²’l¼^e$¼À´s¼Ä,¼iåà»äw×¼I1¼!+Þ»üê»ýÊZ;Ÿ÷ñ»ÿI컄‹ö¼à¼)ɼž’»‰´;ø³»4–:ñ¼4?ºÍNžºÏºc¦»HåÓ;¸¾ºá¢á¹ÈðA»aä;‰VÓ;캻s<ñ¸í”F: –;Ekv9I²ºñò: ˆè».¶S¼*Æ/9,F;Ûž<—H;»”4G¼nv(¼¿á¤»#t™¹¼Òö¼Jgÿ»,®¼-¹öÀª¼Œù¼¼th¼u6 »úÜ :ŽL–»¡5U¼>,?¼–Ë(¼¼!Q¿»{¯›¼0x&ºÜŸê¼™,~¼DU¼›Ýj»¤úT»+e91•< Iá»Y»TM9¹¥­4<i¡¼(’¯_ºšh;èvŒ;À½:µvù;òý;Ï&;ØÝ;muH<]9Æ:Å÷õ<Wºü‘Á<"‰»–°;ÑbÅ»íÁ»xöFW»ƒ¶(»¥òŠ9™Aª<•Þ»æØ;Ú)X;Np;^¦ê;š ü»¦¬;ÂSò»‰aº÷5×<;º;¼½º:ÍñŠ;Õš»»q ¤¼@™;·øD»Íƒ,»N ²;ƒFü»—7Y;ºØl¼(D¼oÑ:Ûèn»ÐD¼Õÿ»¯à¾»ƒƒŸ»GÕæ¼Úg¼«šY¼±U¶»1¼/™=¼L°À¼ÑÖ;YŽ*;ÌÑÕ¼}µý¼t,.¼B«»8¤»Ž*/»hÞ¥:©àǺ[jŽ¼$…»q »ÇTp<h¼ 7;ÞT«;ð†_9ÈÕ2¹n»‚Ÿ:—ø=<’k‚9Ù©x;6Ü-<ö};îe< ⼺ֹӸ:…—;Íô?º¤Ö¼UçÉ;qÇð»²KïÝ»˜Áá»ðÊñ»@8»Ï(t8,£»Ç ´¼öQ¼$ª¸¼gE÷¼wëì¼G®¼ý2¼žQ*»Éæ}¼-ˆ„¼®Ç$¼F_¼7•2¼'Åp;o¼gYE»ù“Þ» ü›<7»À“È<»<ª–»º«Úº–Jºº1³;yûH<1…;$væ<#àºÕG:å;¹º|b¼nï¼-¼™Åκ^v¬»ˆþªº÷¹‹;#i;ܼش:)ô{»ªiD:ó)0¹çAŽ9ö­ö¼<…:pZ»¹2F»Œ[‚;¨…M; z_ºÅæ>;§s³;'Ö¯;ó®»0Þá¹fIm»Â±º˜‘<»·9¢:îîl¼%(>¹p;:PÅ%»];'.:ÌQ^ºí.ê9`>9þ…»íô•»F r»¹ H»Ba ¼–»«Þ4;ï-D¹9TÒ»4úÁ¼€»Ù<†»»_:ØFˆ»Ê¸7¼3±0¼bù¼¾+¼²VϼN7ƒ¼X[¼‘fü-e¼€Q;¼|Zy» o¼¯î÷¼½2i»ŸJºX,#»¸QƼz»¼•÷ʼÔi;½›¼?Úª;<^_;è’»Ó[C»»ýÖ;«Æš¼l”þ»ÐkC»ï}Òºg0<qﻥL¼p;`H§:2²•»êÎȹZ‰!»y廜Tº z¼fu:û6ø;<Þœ»”c"ºŸŠç<'‘0;ŗǹàT_;Ömu;”så»Þ0¼JÇ;„ê¡»X*;õëë;Öµ¡»Ã½ò»˜H·»ä&÷:¸ÀŠ»CCþ»|¶½º¢…s¼ k©8Ñ JºC æ»?L <,6 » ±¿9V^;9ìcw;"k:­BÌ:.†b;| »œ¦š;ïÜ~º´î¬¼'LŽ;fÿ8¼8%u¼‡ p»º®“ºÓ¦º†T¿¼Bþżj¹¼/½¼å¼eÝM»úmº´¤¼/UÚ¼E …»žjœ»Ç#P<(¬9»=„ô»Ë¬»FE‡;#ö¦;â;:¼Ÿ£¼¨_»÷Ÿô¼A¤ý» Ò”»¯Vù¸Ô¥=¼ã¡:ÛλÜl¥;­Éß<™µ¯»õu=»ïÚw»0ÐD»w ѻݖˆ»Ë^:nmÙ»ûÜ$¹lμ'ç;€Ô?¼*ò˜ºƉº°4»¦c»Üc¼F€@¼Q>¼Š46º=TºM#ý¼@ç´¼‚º¼ Ža¼BËá¼ %²»h¢¹¼-«ä¼yyU»·,¼‘ãH¼FÚ¥»€Nº‚;©»`RŒ¼=–o»Ùo¨¼†Ò¼з¼6”ºâ5;œè’ºª×v»§†¼†H7¼&ì:AÊ»É`ý»Šq™»5Q|:ÍðÝ;ÊyV»LÆ ;]“„»šú*»íÖ©»â&»x(»'¸º©»Ãjt;¡/Á;Î ë;>ÊÍ:âb躪öôº™7»â »ïÛ»õONº«ÞÝ»KÏ;Ïé¸8 †;“ã :Ñr©»¶¡;4i<#Æz»‚Ä»âWÌ;¨gºðžºû©Q;öl9»³C(»tÜáºa¼m»£R‚:vò}ºßš¼8Ë< ÎÊ:Ó7­¼nÏD:h˜ ¼Frû:ÄGÞ»bu9Åx:Šs¼+°®»ûDd¼ƒ½j¼0¯'»“F¼Œ{¼Œú¼c—š; ŸJ¼#…_»ì¼Õ¼麋­2»m²¼ƒht¼b¢¼b«»•æÔ¼_ P;¤Ð¼;N»‡ÈºûJ»ã;­98»´9é<kÞ¼\¨ç¼o¾ƒ»ƒß‘9š¶«;8ÍA»"廾¢A¼D»Ñµ<Ïå¼ ๥ºŠ»ä£·¸›w¼Ã[1»ô¦¹»ªM ¼qíx¼›5»»&L¼Dbx»ê¬{»ù'º¼J.º$‰¼¢ÿ»Ô I¼·ȼ~»{ ¼žMU¼HÁ¼ µÜ»É7õ¼•ñ» ƒ<-yS<(CÈ»°â»­¾Ó;ßK¹ôa1»ËëM<"NI»CFeºu¥"»Ê}>;†ùk;’g»!Œ~;)×­»mÌž;è¹hz(»ÛÚÒ»Jݺ­q›¸‹‚è:‹ñ¤¹ê;Ìd;mµº>*ì»iP»âÁ19º&æ¼.0™»tÞ¼eXɺqÿ» úî8–’‘:ho ;Â?;_ü;A¨{»ÒÒÙ;´;"@<na<# ;öV>;²a;ï\°»Ø]»ŒG»ZÌC» °»bˆý;}:“»!»D N¼\ÏÁ9¬”:Ž‹Ž»E?Š;[_¼¼‰¼wâ*:Äð½»Ójœ¼`»’k漤ð"¼y»¶¼Än¼š0Þ¼¼#»Žf¼¦ »íÑ);\å¼~é¼ëK‹ºš¾º`+y¼áíϼ7gü™fÍ» ÿ:TG¼ ¬:URÚ»þ/¼º‚Q»§ÊÈ»†öñ»oÒݹ¾Œà»Ìã¼5»Îí;<5e˜¼,³Á»òk »ÑÝ*»°±€»°1˜¼(¼6°Þ»ÁxX»/ˆ¼µmm;Ðo¼jG¼ªix¼8é¼àX¼ éǹápÙº¾O»`¼’T›;GL°¼„§»ÎdѼ ’E¼^•V¼%!­:þ [»gšý»’ª<?e5‚…ì¼8ºl\â¼Yº¼<)4–<,ö:;ˆÆl;âØÌ<\3o:סá;{‡·…†0¼,»òë¼™„»+Ü»:êS<^z:ËdÓ<^ð;|ƒ±<0p`ºHÛ¸:íåÝ› :G€;{Ϭ»p|;k“;¨ùw”ç»>$9ÓÖ¼¥t¼O»ô¢»\À4»¥èÙ¼,Ž:…Cµ¼9èêºÌù»2ˆÉ¼gØx¼‡‘¦¼ª˼r›¼ý}¼ñLŒ¼|ÿ$¼mx»Äa»žc¼Ä€¼o¢ºÚŽ9ºâ§|¼ý>ß»Ìã'»ÉK!<Žàºåɺ»¼|Ò';÷;~¼0tÚ»Æ%»Ž²¼O°»:œò;ˆ5:ÀC;ö<μ<†]ºE¬Èºìƒñ»L?ä¼R7¼Qf;@{»3Œ¹F„ºµdL»¤mo»¦¬Uº‘-¹îßÀ9€³<j»¹|åõ»ä9»9țƻ¸™Í¼7ð¼Á;”“Þº±ea;±e;4º…l7ºíü“»ƒ‘ ºÍLø:újJ»€Š"¼; K;‹d9»¹6e9œåȼLz̼\È ¼‘Ǽ(³ý=Îj=8kÕ;¤=‹¼Ÿ›Í¼#&Œ½á1<¶¾B¾ ý{"8½Ú8=[ëÇ=¦–=¤¾Ã<·Äl=Cm«<ž~Š<†ÍW¼Ñ˜½·&½ µ½3<²¼ÇÖl<¨‘½=_Ñ9<,dï<§¯=ÇÃÚ=*ùÞ½<齩=½à½5ˆ½(8+½>ŽÉ»:0=d²ò> è-=7‰5=ùã=Šfø=Ô©è<$º³½‡<73ù¼¿R1¼L=AïD½ Íe½â,¼Ã?þ=ÉÍ<€”þ=þb=¯#=‚Ë?>=­Ôo=…B}=Pü^;«ØW=/+à=› $>/+>T¤=¸ú­=À Y=…®c=¦ýo=¨Ùí=ÓWÁ>*=6=×m =}šÆ=»{f=ãý6=ÛØ=Ìã=aYX=«àò¼ât ½w±K;³‡ò=Sò–¼2Ô<W<—½*¼(@>=Òa<“|<…5o¼n4„»Î´ë=‰Jµ=º„]»¢ÛÖ¼àP1¼’̼ò/=‚>=º?=™ñG>¤ú>J¸==®ç<áä=™lˆ<œÊ¼9Ü;&+Q=8>½9ù˜:ôÔ‡=jT=ŽœP¼™÷v=Ñã>'"=ò컇Ð=Ár@<öO·=6Ú¼Ó!½€Ý«¼kÍf=—Á?=Àns=&êº=Á<0E7½HD;Éï»< t/=»¨Ä½X/¥½&ž†½bš+<”x¼ÅôR==b6¼.¡ê=‰¥Ÿ<ÙΠ=¾%¡=¼.{»ì;À±½_º¼XËI=ý¯=°½=¤¦ »‹¬Z=d <ñýyºö}ë¼™Ñ;Öµ<Ï÷R;xgE=v=Ѻ KP¼mK=¤C¨½*^¼ïý³Ùˆ=†=‡jª½ä‚ˆ¼¯v*½I.–=A¬@¼Wz<Ö(4Î=D= »‰‚D=1™½Zׂ=Å7=æ}Ñ=mÍS>$¸Å=£; =Ü·(=š Ø=Ü°Ý> ¡"=ÐdÃ=„A$=Éþ=×zû>µ’>Õ>mX=œÎ=§U·<íÞa¼}•º½BV=¥ïÙ=o¶y=Um`½ûºÈmí;÷%Š<1Cz<óX?¼Ðç<‹×\<=»È­=óí<™`ó¼Ë z=ã =—C=Õb@<ßúÕ=›Èg=Ók¼‡à=*¡§=ó(¼¡ÐRX}>Y¼ Ž:;é ¤=bD=ÑÀ9¼òU<4ˆ= ã©=¦:¼>0Ef=ˆvì=# <љҼ¥xØ»ÓÁ<ŽŠÂ½—sè<ÈÆd=9[Ľ¨‰1<$€¼¬æ˜=ĹC=/nÁ;Íá=Ëp·=âj8¼6þQ=f8³½&&´½‡I…<–þ¯;Ár=h\Ó¼4 ³=ÌŒ<å=,B;ÏlŒº¡”;‚q‚=©)c=$:¾=d-Ì= Àò=3Yn=.h=dwÛ=6k$=’ڽơ=Õé>)U¾;¾ã³=x=ëbŸ>j >ù¬=é³"=«7>§¨=†¦ù=îµB>þ=V¦p> =¥4Ú= ‹=¾±=ÔL> »|=ܦà=ƒQ=Èf®=¦É,=ø}]=ƒë‹=M°®¼^aŸ=&Å=<çÙ=]"û=Š"…;©®=Õß\>e=¨k¬>*L=Ta=©tx=`ír=ê'm=”„4<&¬®¼ŠPO=²¾¼›7B<ŒH‚¼ ão=jÅ=C¸´>µ¸¼Åð¼=Jh¼=¬ ¼ú@=7ˆ‹¼Æ†6<Ì=c|ø=sÉ“=Dé‚=«é˜¼dÐ<$¾v½%h<ì` =L€÷=‰{=,ò:=¹”p>JH<ñý²=’¹=ÏA<—/<œÊ=Sœ1¼Ívg½ò®¼ƒÝ<„Õ»0wÌ=„tW=¤-÷;زƽq$Í=u89=¦5=P+õ<“vÝ;t'=Ñ«}=˜Õ+=‹U=<È=,v>&ë¤=þTÊ>|Þ1=ŒE=›^ï=ùæ(=…¹*=›Úx=¬Ä¸>= =eº¥=„Ò=·Ï=Äpw> Ä>èË=)¡M<Æg?=ÓQ×= §Î=ê6Ø=b†=A<ú¼¼ =ˆÀ=Ö=mJ<··à=:Z‹=Oö—=Í­=u¢p=#y ½}ƽCÚï=g_€=0ß­=X´;& –¼d·<=åPç=Ó¨Õ>VÀ>A³=Èÿæ=%©¯»Û‡¤<ÄÛÿ=MÝ=Â&i=ÿ;<¡õ;j z=“] »Vr9;Ó—à<ïÉ=´ƒƒ=zˆl3â>ŽÇ=™ ðFø;æ}=kå<Ê^¼²œ”¼ž£d<‹å¼½híý<êèg¼L =uÙ•<«Ÿó<Ôz—<«Æ%=Σ=ë¾7=^#b=Œ——<Õg‹=´€¨=3{g=¸r <…´=ó:‹=óâ>9t>3 Ú=”6=ý8=UO„=—§ø>"üÀ>Ø>.[=òPÚ=ØäÊ=û3ª=¸f>A ì>Œo=prF=³ÑÝ=nãÒˆX>êX>zTö=û $ºŽö5=¹¾:=öÙ=…”‹=¯Q=›[ƒ=ŒMJ¼(H=A½g=^É=p5Ù=îØ÷=ÔaÖ=^1=¨æ5=€98=ñO9=¯£=2Š€> ±"=@.=«µÆ>RG1>‡q=>L=Ž/Û=žÍ—=½Ä®=v,<㫺¼âöú¼€Ô\=ž¶=ï_>2 >Ñ<óË©=†[=B<:Ÿ¤'·e=yÓi=ÁÉä=a›=¦–©=·†Þ=ÅG›=™ÝÞ=‡n¼Ö`·½8I½=%u}=-f,½8âx=d£U=’D\='‘Ÿ=\»€9c¸Ò»ÉB;õ¥¼{Ž¼ 2»Ï«ä<ö;“Dæ=wo¼¯³Ô=\(=ËïºüE=‚X>÷½<þQÁ<y\»Ž¶»Ño6=è=­X =—•È>Õa>ž­>3ƒ$>T=\=å¼=‹}M>äY=Ñ‚<ÞÏ=s™O=™¸ŠÁ=¨†¿½¤³>=š‚>=‰¡ç½ª=>¶×=ÙA) Á¤>#ºÛ<ë·<²4÷>n=ËÌ€=¯«è>Â*=ßè»®Gò=¹=ˆ=Æz¨=Úºy=±ÖF=îãñ>Zv=ƒÌ†> ºY=³Fù=uìû>„j=Bk=ˆ(E>U¾½=“Wõ=fk7=uÅ=\=ˆÐ=ˆ‰Z»÷7¼ÚÖë¼~ÓC=ÇŠk=Äwž>çú=âÉA=«,=­qa;hF¼=oÚV<°:%=x‹=­È¼>J–=ÅŽÄ=ò—0=0˜Ñ>(ÔŸ=Åò7=Ø6)=º{<™ÊÞ<þ[;ûlì<ª¸ô=qHy=·Ç`=‡#=Vð=Y ý=$4=¦ñ½›²Ã½(°=}¶=ŸdË=}£^<»Êž½²|½O\‡=C­ü<øÇ9lx=vfv=Š0U=q{p=–6¡¼R±«¼oÕ•=aî)=àm=tûÙ=eV”=Ÿ ×¼ñ±|¼Ë=<Ô¦=Ç2W={"C=ɹ’=þy„=qÐü>„>"6O>bwÓ>.‡>6ý=ôM#=ØûC>$Ô=^h =ƒB=;D¡>DL›¼LÇ$;…ð¢¾M=øJÅ=ý†Î=>í*=ÛH=›X¨=HŒ´=¬á•=_R¢=© h=Çà”=Ãd„=zdV=Ýô¡>*ÝÓ>2 ;<†§> Ê>Qpú>ãN=ÞÙÖ=ÚNx=ÂÔ î‘>28@=Çq=‘bP<Ï9»><Ô×>I=5K½<­uȽ†ƒ¹=ˆU<™Ãæ=‹3=òš=ˆ¸•=Â.=†l}> Ö¸=–¢o=ÂœgºY¨>5v,=Ât2=³Kà=Ûœ=§U>…=L!ì>6Pˆ=–B¶½p5ð<â.¿=?´Î¼ßÄ=µ2c<ÈÃÔ=Æë å>~#9úäh=¢h“=H p½^ë=t,Ì<ÏÈ=Šÿ;–ç¤<ßfL=÷›=Iƒ=¤š <¸k~=†õñ=Ü=Èÿÿ<èµÅ¼PùÞ½Zí½eÄ£=F}`=϶="¿=˜,>®ƒ> ³`>USN>fU>?¤–>Šÿƒ>Køu>ºß=PŸ>:%=¦ù=E\=PÊ=„ÏY¼³p>ë‘=Ç·f=#]é<|>ß<.ç²¼ÑBh½µ;Vž=ÞÇ=àä´=ôºN=ºnI¼ÙÚÊ=¾õo=Ø2=ây#=¨•Û>Þ7>*ó^>Lÿ=®@i=•3|=­ìî>…¬>&ßt>B =gS¾> =nœñ>:ce<€ ™>M”›>ëÿ>é=ÔÅZ> %>Y =¶X»=ÿvz>‚=Y¾=Ót½ƒw=Mh%> ÙÎ=®j¿»¡CD»… á»Ú’Š¼µ,:Öµ»nW2¼ÌÐ38íP¼Í\#¼’/3»ã>]¼ƒ f¼DÞ@»Ù‹9¼ ˆK¼‰èy;7GÛ»Œ/6»Áìf;¬E<;€8“»Éžu»éjg9Íxv¼9~»B3±¼#ó½¼IÎR<\Ñ;Êž¹¼j¼<]r¾¹Lçõ<+R:¯ º¾n»–3Ã<½ûÂ<&ó¡»4·Ó»”¯;2éÒ»~á4¼¥_;Ø|ð;}a¡ºûŒ;hñN»)ãÁ¼9W™¼y«5ºìÝä<1w™;…|g»,“¼Vžæ¼%ŒQ»Ã@˜»Çż\/¼D:É¿‘¼Æ ¼ ›l»é1»ˆ­š»ˆÙc¼cÖ³»–ßð¼ͼ¼Mê»9 ì;ÈÀ»’Ú¸Í/š;\ 3:Ũ;bq:#;¡Ñy;™Ÿ<¼Xö<Ç:Õ= ºÇéµ:Ždw;ÎZ-:òâ.;nØ€»ØaÏYºŸÛ»ò6¼Y»Ž¼’nb:λ©Øu;«µŒ;1Ë_»Le¼û¤¼aµô¼HU4¼™ää¼)â ¼0Ÿº+ÇÚ»µ€9˜Žg<-0A;Ž;8“ݼZµL;u‘_: ê6;¦þ¶;ÃAÜ»¸‘,¹V;`ï%;1CÃ< X˜:/Œä;ž0Ä;+Pî;¸‚×»™Ö2ºò±1º‘µº<Á8<}„<žâš¹*cºÿ§<ÚW»<à ¼dè»Pë½<´5;”¸‹;|=Ð;Ö§H<2ÛU:ÝÛÅ<Cf; <&_;¯W®<`Í;µ.L<*zS<$º…»¬µ‡;3f;dW¼Ix=»…ñ:œb;³•Ž;²¼“ZE»˜Áþ»J‘;E½‰< cí;¾ ã:³2E;ÓÕ—;m;æù¡<0E<­‹æ;µ|}<Ý$;°‘2<.L‰;6Ÿú;V«ó»¹~*»áK»É?:òÖ+¼’²»`¹„»,/g<Ú<&²<¦3<ç;Á8\:‘žl<:.E9’Jn;«â»»8ë=<=•Äº|oϼ‡;ÚO;É/î;ËÞî<"c™ºJ<z-:Lç;ò1Y9ŒÌ¼"gË;1”» &l;ëFm»I¼ô9?;Ò1±¼AdºE:_˜Q;ky;¾JÚ8UÈøx;ÆËU¼ 'š<+9ü;ŽMr»\ÜGºû¬|¼aP»UïD¼nœÂ»Á¼‚Ï>5æÃô¼÷Ó¥ºn‡:º•Y¼ZÞ»T»‡Æ伓 »ŠÇ²»?Ä:ÿZ;ª!}»%Et;Ø鬺õ…»W¬<›ø»€z»–Í);t¾;è„gÊI¼µm:Fjn»U놼÷{¼ ²bºñ€Å¼Bþp¹Ûr©¼ Õ@¼1"æ¼$™¼f¸:ø´•¼ƒ0û9õ]»ûÒ>»¬ëM¼ yd¼“ØÎ<Yüƒdf¼‰2á¼Áþ$¼³ìº¥¶¼sº-¼=ïh¼ƒLž¼ Ãl;¾ut;…¸}<à\¼:0b¼ƒ:´_rºƒdD;ópGº¼—g¼$‰<\±‡:·çæºÝ¨‚»à<ì»!Æt¼ŒNi: C»MSç¹€îî;ÜqV;]Ç?»UÀ;¬¡‘;]1º¸ä÷ºaÃC»4Ê;Âêû;1~P:’œ³»•Ó;–øŠ;j=õ»—ƒ/“åº}Ný»½cÝ»|«ö¼sT;Ùãß:4U;i_z;úÎ<&Ûü»ÏY¼Hô€;Œ7Ÿ¼2m–H¬»êÿÊ»½aj;L³À¼§"¼H§n¼‚®h¼FÄu;®®æ¼ÀO¬¼™àÚ¼]’;ªð¼‘lÿ¼œhd¼†)t»ÒѼ”w}º½³v<à“» ª•;qü绪X½¼L »ìÿAºšI&º.;Q»Ä_J¼—°¼\Zl»„}_¼U×»Áõþ¼“ö» ßö»ý㢻ÿ§P¼M$¼#‹»¡°E»>`»cïO¼>JA¼ð¼‰pf»Ÿ¢¼0œ…ºè¿¯¼D¼vC‰¼ À¼!¦;¼&òH;Ýcä¼oð¸»(‘ĺ—2@ºí¶;9Š¼~ 9:¥œ»¤*×¼§„Õ¼¥¼¼$°ƒ;p[æº}C3;„¶²¼"̹×èÚ»žó¼dZl¼ ÖH:éÍ»à½;áõÀ:Ì0;‰D¼Žk&»¬š”:©?;莺¼ˆ“;¢îñ<ë¿;Ø\ Í:Û'¿» ÙÅ: þK»·h:Ð%Ñ:žm»çpм.¢:Hªž»KG¼ˆk¼un¼6o=¼a©¼¤Sµ¼™':¼#A»”‡*»ÓÒ1¼]³¼§#5¹ñ0»÷cC¼RØF¼kÃ;ñr¼;Ÿ¼pW¼BVa¼œó/;8*-¼],¼Ÿ)¼rAļ?<»ù·¼y ˆ¼ "”¼Tg¼Â¯Û¼˜Ë¼H°Ø¼ŠTº»i!šº·C»ÌÓÚ»ø²>¼ +$;À÷Ÿ»ü$¶¼p.»¸¸¶»ÒI¼¹eº#eº”YǼe»>åä¼7oÓ¼L°¨¼Àœ¼£@Š»V¸ê¼PD#ºi÷ô¼»M¼¡_X¼…©¼yœc¼yyÇ»¥*¼+\¥ºöUi¼@)(¼‡ä»Ç;/»ˆ?¿¼ ¼‰ÿ|ºCŠ°;¸kK¼P¶Ê:\ÔK»¦z–»Bʉ»1vºfSª» M¿±;ØǸÁa);Ü<1¼;á;Ç’†<i;y™.;ÈJµ¼4µK;=q5;øú<#”?9æǼ;Íe¼r;Û–V»ÏzY»Î{S<9;ÓÔ;¾÷:(Õê:¦e ;NòºI³><CÕ:§¯k;²{Mºç 2:~»ï;Ñ#©» ;1;ˆÆJ»ho;Jç£<Öí<‘ö; œ; ~;ærº°—»‡ B¼¸˜¼Ãqºˆæj»ž[K¼rQÙ¼8þ¼a©Lºþ༽쀺҉Ÿ¼JÿºìÞú¼?º!¼­4.¼µ¼Ek½^.»v½¼‡„a¼g[\»9aÆ»Ï$÷¼Nt<¼}I1»1¤§¼‚dd:ÿÔJ¼Y³»´ªÍ¼ Ñç¼^,¼B¼)ÆS¼¦î;躙Èm¼EX»èJF:ŒÜW¼ «‘º@ºM»¾ ;XA»÷ÏR¼ ¼ ‚Æ»îÄœ¼XN»+eú»òGÿ¼&ä¼'˜˜»OÇ1»ß>¼$äÁ¼¨î¼[gR¼˜Œ”¼‹¾Ø»‚ƒ¡¼Û?;Ns¼Ÿè‹¼¶¼R ¼Žµ>¼¥ù:3Œº["5º–÷Ó»àÆý»3"3;WGÝ»ù2<Ì«¼Sa<&F;:üj¼»Œ×á¼pYû¼zF;’ú};¦dˆ;!,;Ò¦õ;€Wã»zÂÏ;¹ÕÁ<ü;^И<ýi:G¬T;„Ýù<ë†;CÜü;þ‰Ê;Xmº÷GŽ»„v:ýÙ1ºî4;eh†;ÖE³»‹\;3&(f‘»±p®½<¼"س¼=fè¼+G¼ ·<»^2¼h›;{P°»&ؼ¶v»lDˆ»ƒâ‘;t䧼£À*¹³g¼œJ ¼.ÉK»1ð£¼9%;£ð;…«Ð:óWj;©µÂ¼}¿¸¼¤¦;•¹lxœ¼,çW¼'·‡ºhà »3˜ ¼OÃ~;v p:uî;HÜÊ3ºÛH弉ڼ†/ ;§@N9¹#;»};Âæ)»„¥Ð;)[-»½ïH¼!Ý"»Ñ˜è¼fñ!¼0@¼)+Ô¼!s\»à ž¼ûž»C`¼? f¼OFµ¼;¶;H¼>ÉB»ãÎ_¼°@¼6a(¼²ä=¼WP»±&'¼ öºõ–a»[¸%ºAw»­fâ¼.#ˆ:QG-¼ ’ºß{]»RqY;°÷¾;ã)‰»¿T”;gBb»Uu…:Í?»á»¿4™»¸¢ç¼q_¼åo»šÙ,¼Þ¶;«»H4‡<+íó;­ˆ);¿¢Ïº—Å<)á©<#¸Ù;ƒ™9ßhõ»¡³¶;¼CÉ;pŽ;Y<@Á4<œ“„;†¿Óºå¤¿<{ɼÊ»]Ïå;Õõn;—²é;»!Á:êˆ(;ãÀÐ:4!æ»!y|;1rõ:pÏżOâ˜<ŠYo;¬Î<³°º|È;<9tºŽÕ²»mý»-ûVVºÂɳ½¥ß¼™¼^[Y» P¼Çã»N(`¼$¿»’»¢¹þ»Û‘뻾eʼ?ؼ[.y¼\ ³¼†¸*¼ö»ë¼A\z¼·‡Þ<³¦» »ƒD¼!˱¼9J%¼¿ã†¼ÚV»û#Q¼CIé»Q'q¼^µ„»ƒf´ºN)µ¼‹¼©[”;™ïK»Ò0#;›Ø<à<žyÑ;€à*»Í ¼?(ý¼ WW<³W;„™r<^(»Ø‚¾¼\~;Uw°:@ï¾;ã\n:Æ4…e;Î^8<\Œ†<Eë;Ñ3<今`ù»žnþ&Èê=åú§>?[H= …þ=S`œ> ±H>›Ž=ôÖº/Gª=¾h³=·(5<ëðÂ<…´—=J=ž¡=f¼=RÍ3=<9µ=&O=>yö=ð%g½ ½LÆ=lc®>%Á>%PS= KV>I<ŒÒ'= ‚c>/“²=vqÜ<…´×:öqÃ<ϲ=vúq=ˆ¥÷º‚á= d=Ïa’=¤Ä‡=—ä<¥¾8½ERÇ=©庌ˆ=²j¶=¥Íd>¾Ò=Ëãð=Ÿác>*Ć>0Z>šFa>O=K>‘ÖZ>—ã—>`;>4HŠ>¨ï=’ªe=¼ )=–ô=%›=L—ª¼Äè=ïIâ=齧=³Ï<̯<DZ¾½5Jç=ð@=;@~=×@->+qÊ=ž‚=ÈÓ*=Z¥¤1>Ϻ>[y0>fÈE=ܲ„>ÈF>D?=¼·u=ѯž=à›Í> 8=¿ÁJ>"¤Ü=€>…˜º>Cl¤> øÐ>n÷%>Lº6=Ó_Ä>E&©>\A>œH=Ä ›>Åj=Ö{=†«Èw>BÂ> ¢>=ߥN=ü‚E=sHÿ°=´çö¼;"l=¢£)>@tB>3*<¹l=È”¾=ܸ>G5^>Y¨å=ñ&=Ø<,=µý<=’W=CÉ> t‘=ùí>/Xˆ=±¿><“2¸<¡Uç=çA-=z¡¼”*¢=:ao>\>¹}>E%>?úõ=Ñ‹Ø=ám> ËŸ>è‹=Ü=_= Ye=(b;*¸=¥Ý”<òÕ„=yÑ=˜Ö=‰R|>;A=ÈB=Y½Ø<êí<¶?L¼\xK=ú1>¯T>$“…>3:Ú> Ð>_s>Ÿ¢k>|ϼ>Jo>¹í]>;g\>©U>ù>U¶=š6a¼¸x©¼^.ƒ=Ì#¬>º$=¥¼û<±©\=Y~½š×Ò=<Â<’­€=µÓ >1ï >kSÚ>.&=âZ³=¯‘¬=ºV>*”ß=ö;u>x=á¦s>]x>qd>Yt>") > ÐÛ>lp­=ø÷€>;¾l=ýÿ\=:—>xÇX=¯UŸ>0Mè> Oq>1YZ>­ê>Mé> ý>,²¥=ª»>ô=+k¸= #Ì=ÓØ>?}>9Ø6=èÏÐ=º¦†> F=Êd>+Áἆ@x½›®<›Ò¶=Á¼;w»›x˜=…Åý=à‹Ý=Ék=(Ÿ>1±>0¦µ=„^3=›nj><ÿ=ê.Â=­¼o=Iƒ°=¥ÃÞ>‡ù>ZÕ¯> þ¬<• Î=÷à<ŸRx;D%¾>9fÛ=Ìß> [=­V²<̶½Á4c=À:ø=F½v=)ìǼÆFG>. $>™ >.þô=âí·=â™=ä{W>ö^=ç²>Hk!=«=Ž&é=$©=Û8=û2=á“á=ž'z>KV„>¾;>Õ©=»À¯=ZŸJ=Asîp>%…g=œGY>Dà>Z‡@>„ªç>L÷ã>zIe>Ÿ N>¹Ž>>ojm>)¤Ë>S<>ï®= ì"=´,4<˺ =æ¿Ú=¨ø=9Ê~<à( ¼âþ=WPI=‚°=Ê°>Š+,>¹>äÉÞ>’a3>”c>\Z>ñÂ>”>2µ/>,âÒ=ûŸ~>ÔùÕ>»$’>{>r5÷?(1~>{J—>Ä >pÄ>mª=Ïîˆ>„©Ñ>òˆ>jÛ>5Ú£>Jm> b‹>\8>c&Ä>F§û> ÏÉ>“<@Ï=†³¼=ï¥X>¾v>—,>ž>$ÆÛ=þÍû=}Qþ=Á£<è­½2C»sú¼Ú(o=»®Z<Ë>ŽÙ>…J>³þ>gñ>Éø=t9=”Ýø>%m!=é-º>Ï=t΋=ÿ >Ï>&©C>zF=㊥>³9=ÚR”=¼‹Š=¢Í=û>)“Ã>…<ßè¹{ š½2–=10=}OÎ<œÜJ=À†">3™Ž> ©e>#”Ê>"™¢>1‡¦=ýÉô>+>Qÿà>/ƒ=Þ=r^=‹à=Ÿ(>½>+-5=ëòº>aO†>ñå>",T=’:5=6!K=´BÇ=ÝoÒ>wF>%>ÿ=ð/Ø> AÒ>ŽœR>ßv>uí]>ƒ\>ÎÔ>ÉÅÐ> A`>c§%>W®u>%]®=£6µ=›—=ÆŒ=Fl=Ö´Þ>=°;”<“+O;÷Ó=q$Ž=çxr>O|!>çV‰?8/C>¨ÄÏ>è Û>Ë>‹>Ò}„>ToG>F>³ÿ>-%&>~ÿ>è°L>ºç+>¦Þ»>ÿx?Òë>‰_>/C«>`^O>.?U>κ>A# >d“Å>uÆ>]©>pVÅ>„C>Š€+>9û=¬À>3c=’ÑÖ=«}â>¢ë>5Ò¡>5Qt> Äþ>+ÿ\>pàÐ=Öîö>%W=Zr“=‹&æe¡>^H>1 Å=ø¯Ì=å:ü=äW>%pè=Ëߌ>Z;¥=­¡ž>Ï >|Ë=Ê’^=Ê>>êW=ð¶‡=®se=áM}>$Ç>Q¼Ì>$+î>hå@=ë#Ï>;è¼Æ³p=—=§’J<Ò§s=¾*>+¤¨>)÷2>‰ >+wË=㬠>_\U>SðÃ>ÏC>DóÏ> it>xˆ<½ài=ÊŸ;>D«÷>^”B>_:‰>YZÒ>—ýa>@Š´=Ñê+=¿o[=Íb5=üƒ$>78>¨>>Ã>F&„>Jæ…>4‰ >›>×›>Õ?ë>¦á>šˆö?F#)>Öä>«í>žz>>Ñß8>Tã{=ÉË—>‘æ>b7ƒ>B:V>mÂs>Ÿ´>> Fì=ùþ>,¹W>3Ó¾?Ëô?½|—?‹¬?C0W>Òó™>ú¬p?@yÖ>»;->þe>¿>Â\­>ãA >ìD>íDT?F¸?t>îï?>À”ñ>mÅ>>\V >a/>j]ú>ŒÝ\>mI\>>™O>ž(™>«ª>o 2>Cg×=Ÿ8š>83>õn>U†9>FÝ/=ªÒ>K>¡ƒ>¨ >Ï…ß=ÒÙõ=Q©Ñ>êö<•c>"µ(>õ> Ô©>K„´>J†>{ñ=èï4>]Kº>&û>Ž£>Y@>63>sš=ù >»ž=Ä|A> ¥>(½ÿ=xÏ=¾Èt=ð“z>¨J>=Ì(>‰ú>S$p>;'>"ú =ö=ÝçÛ=ÏSü>v2=‘W=|„—>;YŒ>‹ ->‹Ë>gBF>‘i²>À•i>P@m>ýs>eZÕ>)aÄ>%@½> Ð>cAæ>™($> ¨¹>›í>éF4>ŠõÇ>°½>Ž·E>…P¯>º™…>•Å>øèh>™Ÿ2>½>¿!">Ð˺?]/?ãw>ÝêÖ>÷D?“ ??é=? ½?Éq?0©»>~>ˆT=>®Õ¨>©&>Ɖ>™“Û>¤­¬>±¯Á>K4>®Ã?H¢?S*?ÉKý@´¬?°Ó¶?N>îxÚ?J%í?9ýi>Øåb?Ø>õTæ?µ? ôî?-ó >Ú…Þ>ðI_>ò‡4>Û±G>´*>R|ã>Š>™>ßg>y]\>îu->Ð"Ý>±>Œ&˜>¯a>£%>Uíb>Y0¾> àÇ=÷Ëß>2 Ú>©4>μº>Î=̪]> >-ß1=Ò¿ò>sôô>E=…TŠ=(Mo>s®¦>É8>rK§>_-n>1ã’>.­ˆ> @R>1u¥>€n>F`5>w‰6>‰2®>…åe>¨ì>*·l>Ö­=%Z>"(>µX=øÜ“=Ȭ>ŠÃ²>Ç*¨>¦3M>T7Â>¶þ>LGE>(î¬=ùý:>1@ä>shg>u»K>vw>#þ>¶ _>«žè>²n>öß>è·È>Ò1Ì>´üæ>yü">†òæ>Í`>[ç>¯%,? •¢?î—>¹+Ê>®=è?8¶ñ?'vn?W>ÿþÒ?SðW? J>ùý/?á:?˜æs?fíN?u+á?†>?ˆY@ ñ ?©·ê?ÿ?¯Äd?‹uÕ?ÃÄ?ˆ q? ‰?“†œ?_á?2²°?*Ì ?Sk?±ï>ÒÜõ?EÖ?(òÂ?€³ü@RüÞ@?C£?‡È±>ó«Z>ýѱ?$‘>í>î(‚>Õ¨h?Ù ?_?k?*0">éè&>èŠS>ï0ñ>²_ì>±õG>mfô>±'Ö?–È›?'bP>í >û.m>Æß>Íö>ð>~Ï$>‘µw>t°X>;s—>JY>­?Ú>€gm>$àÐ=ÏG¢>=©=é\‚>”Ô¢>}Œ=®;ˆ=i®±>=ÍJ>¶‹$>®á‹>ZýÜ>U¤ù>Zý®>fh >€ø¾>’`>ŸÅ>"M>¿7ß>Ÿ`L>±í>`}8>C> =ð@ >.M‡>D!==ûzÛ>=T>Ñ/·? j'?TÎ>í¡½?ìá>ÏL²>é„>–y>¢Ø?›?ßü?“c>¼^\>Ø4°?aÚ?`3W?t¯?…ÿ‚?~ÿ]?¥¯ª?@y?9Ó­?g•r?3„ ?¨®?ïS?Á‰?ƒºk?…÷®?˜T:?šñg?÷?˜¶A@9œR?ÕIƒ?£d@Ê>N@#L_@7 l@5Ú@U˜Ó@,@AGç@“¥@ªÿ@2`Å@y8³@$«@.RŸ@1ëú?Ýÿˆ?ñóš?€Š@1pÞ?¸ G?‚8??fÑb?TN7?o¯>è³?râ?7‰Õ?W\]?ÔP@0²l?Ùñ?ûâ>Žô>Ï“÷?Ã>¹0>«Y ?i‘>à¬?3e?l"¬>Þ³>ܲ’>íVi>Ÿ ï>©ã=>y5t>  ?Aç/>òsì>µ¿Ë? ½M>ʵÜ?ìÁ?ƒ>Ån>Ÿß>ˆ É>6î>tÿ¤>@ž>œ ³>®î”>)l£>E%¼8Ñ;—Åf¼„“6¼+3;äËe¼Œ‘ ¼SÅ»žë8cød¼#Ôûiêý¼¼’¼;Q»þ†Ü< o~<Ê;¤“¼ ”w;'.'9™SÙ;ÉœP:¡ ä;‘Ü<t »×);jïY»‹Qb»\Á»þr;þ.t3;š‘»OÎÍ;…1{»iu×;éƒÇ< 9h¼2œ<ìp;Ì- ;Ð9!;ž–>;KP<˜Nº“çE;ØÁâºò§<–»‡ecº¦âq9éçV¹¢²U<[sÒ9&33;øÒ<²»Ý8¸º®0<¼Þ< ¨±¸ðÈ»è&»†v“J;R$z®è<Ôi<˜ÌB`œ;}£öúi;FG<*o<ïZ;´Ì&:úºæ¡T<BºGÿ›;ÝÙ¸;ùpV»éÏ<:‰º¤¼;Å=–<4èá;ÂîX<“}½¹ùŒ˜<‰èñ;_½n<Ôu»(:Ô‚‰;@Óé‚<ÏÀÙ<]¥<©;Ð<‘6b<ÝI<ßQz<~…n=Ô*<éœ =‘C<íŠ^=Óê;§Á<­dd<îÙÖ<„n<ù1<º&D<ì…È<ƒSi<‚ì5;·§™;õ¤Ä;-;[;â¯;ÿ½;ëJÏ<Ž%\:í¢‹»’]4<Œy;äí »]šÇ<œ—;'›Á;¿h ¼3ƒ;àë?;Žò; !£;„M5;Åt ;Hƒ@1¼_¼%çÒ¼›Þ»\]4¼Z¶>»ñßú¼‰z#¼§mP¼[¤¼‹¼zd¼kÄż `d¼/V¼¬eÔ¼Äãj;’þ•¼vËL¼[»!%<㩼-R: [ç;‰è«»w4Cõ<%O#;Ö,-<»Ø;›ÒYº-iü¼„м;¢>¼gd»ïƒ»Žm¹€é/¼îü¼£§:"S»ôÕ¼E›»Â’O»¼„A»¶'[¼ƒu¼!¹»Îùc¼KÍx»Ýœ7¼K÷j¼Rß÷¼N^$ºk§å»WË¥¼%º€¼T»­–ä»õV»÷ñ7¼Qò!»—ýK»F+M¼ Ëj¼•Ô¼?¼;¼£r±¼4Þ¼—j½ VS¹?¹»ôb<‡<Þed<>»—Ÿ<®E…»Îÿ컃+¶<cc»ê¤º¿µI;Qwµ¼,˜»l:Pº0dàºp®N<`}‰; ;i🻘Œg»jø;®ÃŽ<‰¿<%ía;¡­<°.³; ×l¹¶e$;ÜY;c8¨¼|;ó«Õ¼ ·;DÖ:ÏW<Ùt:;§<-SÈ;e :ÐB×; ×%;ZÖCM¼R`Á;„9̹¦ˆu¼K »d•À<‘j¼G2}»Ó£¼¼KE¼•í.;¶Ý‡¼+í¼'D£¼4@Šº¯´»]‡9»+Îy¼@¾O»Æ瀼[R»OR¼‚À¼¤2¼;ؼ›<‰¼w»:°ú¼N[(¼>5仆¡¼,ß+¼¹à#¼!¤O¼l켫²¼­¢"¼pʼ›,":ñ)™:äýú<L*;#U›;Ø8þ¼J; ¤í¼$ج¹ð.•»­Ð<»ƒü;ƺ»S»<ï3<É;<Û:¤´»äGp<݇< ¦_d¼S ¨¼<ëç:g ,¼+µ;mºÊ¼F˜»_d :¶ ­¼UÇ »”&š¼%†>¼›G»sò¼CV»}óô¼Dÿû¼žGŒ¼"ù>¼Hsy¼7~¼ Nø¼iÝì¼””D»>u³¼,g$»fŸH»²éœ:ÙÓT¼}õ¸ÀUë»>àV¼¹ÒؼQei¼pœ»êà;Å›ð»Áâ¼HõK¼ræ<p»;q³¼A´Î;™åø¼5›è¼-8`»UJ5ïã;Åð•<+ÄݼC6ðºÄÆ< ­Z»¿Uk»–/sºÈ¾>»J|ú»í½ºòÑq;Pyù;ª/G¼ “³¼Zµ¯º;F ˆ¼­~ý¼Mkñ¼*³À¼xϼ:è¼…–»]ä¼?¼»®6¼ ±Ý¼‚Væ»…º6ÞÏ»‘¸»äµÔ»,~»pû¼!ǼGÜÞ¼•¦ã:TK¼<{:o)Ð;‡P㻤ìT»¨λÒ{:…M¼™:²ÓF:â¬Æ;ÑË;hn<Xï;`°Ç;÷àâ<4b¬<>õù;œ­‘<<ù<‰1;ž#Ý<„×ܼTµ;~Ç;;¼äý¼Mâ»™˜ƒ:þº·»“<¼$š»ÞÖ(<Q1¼ôÚ»,¼`»÷ûñ¼¬ï4¼$'»”¿¼Yð¼ Ï»ÿ–8»„ºÒÊÈ»dÑ»‰P<»I¢5:‘¼}´¼òî¼ å›¼æ–Ö¼i»‚j‘¼C¼%¸Ê»Ëý;`È㻇ÅS;¨"º¸+ò¸è}g¼–](<NÀ»‚…ò;µ7Ž»Qƒš»¹Ç|<'Ó‡¼ŸpF»äH¯¹~8y¼MY¦;æ‚F¼8}9Í;Ï"Ÿ<ã©<<º <[»!;‹ ;Ec¨;ÌŒô;êÕ¨<w»˜Tš< -ºÛ‚ü»š|$;»˜<†Ÿ<”xA<>Œ;ž×ò<RZ¼ 0º<Ù;ˆÔ ;´þ<ÿ<Á“1»üߺ¤ÚX}X2>EF*>$]? é>ŠÑ(>M>’?>'§¹>šî#>ºßk>ˆ°Ö>uùz>>½‡>‘ÝF>ŠøU>ź­> Q >“Æ>Úš–>Ë>‚´|>ƒY>‡qj>’V>Lèû>9‚é>¼Ft>Ñ9?)/U?P= ?!yv?Sg7?1xŒ>ÕÒ(>¹éd>ªù‡?žFj?ÈPY@õV@‹ž?uc×?`3?Ðád?¸¥ä@3á6?Ò*4@?ÊP@cÅ@ =?é®?³ðO?Ñ¥¥@kþ5@Q‰ @š#Z@zFi@f\¤@:g,@*†T@¨@ ur@ŒÑž@09@ˆ}'@¿R?˜aî@P?³S ?Æô @B ?Äúü?ǘ ?ÆC‘?¡ë;?€ã?ç{:?ƒž?‹´(?ŠË•?jƒä?l\Þ?H ¨?Ll?4“µ>ݦb>ö·¥? ‡>Äp>˜ê‘?}y?ºû?Zè?ëg?¬‚Î?³„Ì>–­>ŽÒA>‡ä>ïæ>Kk©>e >»~ >µñä? 1ž?„½>Íõ§>ªÄÆ>µ€ä>­kÞ>.›}> >±kï>©±>¼Že>çsƒ>Ê‘n>ÓÌ>è…?²÷>‡ý.>»­Ö>G5Ç>QO>$ƒd>G š>›™ÿ>~Ú™>¢>F¶5>tcÇ>OÄ>‹€Î>w>˜YÁ>Ga>˜->,¯>Ç‘>ÓT—>Îù,>— >ûÕ>‰A¼>‘¬k?Ç4>ˆ‹>¬Êç>ž`>¿Œ›>šÄ>†:Ã>˜> YE>2ÝÊ>œ@#>‘ñ¿?Å?áG?"g?¿ÊG?“^Ÿ?(U>êáÆ>Ë›?¸ ó@4@D9.?аÔ?Á×ó?ÅR)?£ ?UÔÊ?œb?br¡?5æ?¢eˆ?B´ ?=?±7¥?PØ?¢Ø"?ŠpÕ?ÊÄt?¹Y½@ —è?îg?ª¢µ?™1?ç“?Ñ3¤?AÍ3?¡ù> ñç>çE^?0Ã?‚?èR?*Í?£>õ }>ö͵>ž‡>ÕW!>¸3Q?kÈ>‡i>œo£>’H0>“>5">™n³><ï¬>„Pô>Šº‹>‰8>—Éù>“I½>À >¾Ä?þ6?//ˆ?v>·KÓ>OÏÙ>ýk>mã>M6º=ã…>‡D~>‹$‹>”|i?_+Ì>Âè>§æ>xñ¿>‚üj>‚Ú=Ýé«>%I¾>ðF>lÅñ>¼)©>¬äL>Œ*ã>¹àÜ>Í0ü>‚§¬>m.^>‚ÒA>*þT>gŒs>®a>yz=>SÎ>Û=ð½4>v•>sš>AJÝ>1%v>zä¥>!|>Eó==^ó>iH ?ƒD>¨î}>EÕ>‹">´>zÂ>Ü“5>§p%>–ð>à,ï>}«Y>ºþ‚>’Ûõ>G:¼>¤ch>•Ð¹>¥ê¼>“…Ç>úc?Þ?UÁ? !?;!j?>q>µ€g>ÅÎ.>ÔQý?GaŠ>ÑpÔ? ¦?ö?Y‚?Vó>ÂûR>ÑÞ>Î?ï>Ïqú>²`Â>™#ä>PÕr>ž‹h>¢Ë@>P Ï>CÊä>{ >¿|$?T¥ã?4o¨?¯Ä?ì>Å&/>ô:P>ŸÉ>±i>ìq>~ý[>a¶™>€¡ƒ>†Z5>…ƒ>›`>Ö÷ÿ>®½_>ˆî&>kñO>_¥>|fî>9‹Ì=§êJ>P:t>FW5=ÚòW=ÜPm=šÎ >+zY>C=ý·œ>Åm>@]Å>XÎH>hO“>Y„t>Jðá>„Úþ>\Ú>aÃx>[ X>ŸÆ>‘‚>5>Á> mJ>(‘Ô>¶>ww>„k*>¬·Ý>À´>‹šL>Oó>ˆ‚> SY>KK=Ë…=Ùîˆ>P°c>ÀïP>{z¶>d>>Ž…Œ>/oâ>Jß’>„q…>4åV=àõr>D»>?ð=—9Þ=îs#=³(Ð<ùSN>KŒ¹=Î|>H<¦0˜>ôS=Šá=B4ê=rŒ¯>$m>€P>d(>–8>·½>fÃÚ>Lðb>§µ>Œ,1>sþ>£ýŒ>¤;r>‰*>‰#z>i¹@>©¾š>Á8>Š>ò>¤W;>ÈÑ.>ýÊ_>ôX>äñ>’ÂW>“›í>FÊ×>•ÍÂ>ÜI=Ù;¸>fW>xe×>¢êH>³Û>š/Q>œÍ >…+>>‰M›>!àŸ=ˆHŸ=¬dÄ>7â¨=„â#=@3ò<ª,³=ÖŽ=¯ºî>KJ>•)O>úåÒ>¾Y´>²$¶>´>B>%–7>' d>*gÝ=ö¼ý>ö{>CRŽ>e!ð>oS>’>~>ƒ±Þ=ò1j>{!>$âá=n}>à=š >#N=~tŒ=š»Òå=•.=¸ñ›>¢_=£¯½>#ZŒ=–˜>>«•>(›b>cwà>¯=‚f=[=q> >#·=Û¨>«>~Ô=ø¯Ë=åÑ÷>)œ>!¡á>“1d>]\@>ÿu>]|E> §(>÷ =Ü£õ=tP†=Ð)ï=éù‹>a—>{Ù3>gÚu>**x>Òß=Ã×> ‰>v¦e=æ?>ò >«™=wXN=â”ð=Q³=šÚ©=^Ù>¾R-=ÖˆŽ½¤³ ¼Ýݽö <7ÀÙ½ŸG<¼wiJ> •Ý>N¹´>">=äÚ>Q ƒ>[`4>k_e>†äÏ>V¤²>–——>•R¶>– >q¦þ>+;a>p£†>º’%>Ÿ²l>ŒÒÃ>„ø>¢0Ý>×^>–Ô>r¾>fñ>–{>7 (> [=X==zq>"õ®> _>oq>>f¼=ót#>$Çï>ijÒ>E¨¶> x½/ó´:UU=]˼Á‘»î×<\£„<Ý>=qîï=ºÎ*>JW!>t2Ü>I,C=Î.à=Æ/—>…é=ÖÃò=Õý–>8#5>2é>$¢o>%">¥#>"¤.=ì=Äÿ`=¡*»þQ;óô­<•Žx=ãJ> w= ¿~> dÀ>![Ñ=ÛÈ>-»>7>8™Î> Ô>÷ù=Ø#>>ï}>:N=~_ù=ÇH>íî=‚C >+¬e>l$9=YÒN=Ø*p=»Û£»QDÛ>fæ>JB =¹Ìç>—ì>yw©>2¦Ø=¢‡]=ÅLj=N¸5¼t¼?@ft½g ã;2º‘½9·½ˆW²½@h½Ñ¯Ò<`ÉÉ=Q´¢=ì‚c>9çX>3>‹ðâ>_‘>y8¬>ÉW>Mt©>‹Ñ>S×Ò>^‹¢>ö>òÏ>{®Ö>?÷–>¸¥>xîF>6>g¨¼>·Ý²>Œg>P«Æ>x=³9¡=Åñ<¼=/&|=8†>'•R>Þ¢>bUk=òNL>6=‹êæ>9ÿ|=ÿ'<4Q^½o¤‘¾'½€J’½•)½œ‹½T3佄ô¼>m>±Ì>º =pXA=`ï >,½=ÕPþ>$=ì=€Hu=ùè=|ï=ßú/=šõ:<åÝÞ="-1=2@+<"¸»cHC>è=ÿ[È=ö<ÿνTø=›Ð¥=ßkt¼£‚½ ™¼dz=]ªé¼Ä„@=»„=â©!=‘CH=¾“>u = N`=cùN=¨‚>8ÚD=Ãé>,d=×^à>8Þ¦=#fï> ¼m=ÀÄÐ=­†a=š¶¬=((>dë>¦T=Èݾ= 4÷=Ó¢x=g >8"> ÕM>PgT>>b×á>&•>eN=h'¼”sý½½±Î»qC“=¦=È+¼«TÇ»Vu$½ŒÀÖ½®Hî=¿Ú=º0ý=®>û>+¡>$Ã=Ùã>+]S>Œ>/‚†>jp$=øZÀ>y=òµë>*K®>Y¥®=¶{‘>h¨>{ì+>7w>JÇ>†(Ÿ>®[&>wåZ>/‡=ÒûØ=sÕ`=Xq—¹’zR=CE=}þ>"w=È»ú>~Æ=î !=܆=¸õß<èß{=Iq”½ ü°½ÏÄY½´r½½¬ ¾%(½1zǽء2½æÝ»äž,½mó= ß©=º¥Ð=°Í&=†8nºèëµ=ñ¬> v5>-<Èþ=ê>(iv=5å-=û¿ö=ÇÓÏ>ÇÈ=¨xë>'c¦> xn=Њ=÷°=_àG<7 =À¾Ç=ÊAk=À!ºõÈg=Àô=ÁÅï=\<š®ð¼#'o;\£ˆ=²Ôù<òF/½Œ¿=(cj½ nN¼¿wÔ=}‹Á=î£ <ûœu=E÷f=µ’Á<¢º<ôH"<Àž¶=Ó7u>$)E=º @=á&ÿ=—SÕ=á¼=ä,=ÌOd=Ëw㼟"ã<’žØ=rqž>/p‡>Á=>tÌ='5É=À¡> ë>‰uÉ>…̆>£‰>+\>Òz=ŒÌ=‡ÍÎ<ìõ¼Ãêá»mÂt=uUº<ö8"»)ž£»¿‘û=K°`½eE¡<¦h=zH=j=ëO->"¥ >"T>+>x>V–>9o/>¥Ï>Y•—>E«>{(=ιÂ=çG¸>/ù>xáT>„ù©=õ•m>7sÐ>ºç.>žÍo>ay´=Ïðõ=ôÔ<÷J½„a¶¼¸ž!<÷‹'; ˆ;ß$Â=&¼i=» «>etH=ý#F=#’ë;¨¹¼Ç¾Œ†¾&%±½hJ½øBþ½ÖCï½$‹½¾½Âjp¼yŠœ½>Ì¡;Äz¼:Æ=©ô<ÚWO=‹Š>‰i=Œ:=cŸ=5Å&>®D>):=ú¼=õžX<Áp>/êà>®> Ó> å=áÏ%¼°œ›<«Q=àF½=£+±<ŽQÊ=¹Ä=¯T”=‹‚Í=+a¼<ÏnYº¼÷~½n³¼ü‰²¼œÂž½=z‚½³Ð‡½Nýl¼GZ=ƒÆª=ÃT=pÖ=Éã=(P}=Úm=È´y=éßò=±BF>U‰G=Ôf= ;ù=ë¶p=¤¿=™}>³=55'½,1î<^j~=ËC=mϦ<ïŸD=Xš½<¿å=Ì3Þ>8î¥>Š ¤=ò K>Ñ›>*6=‚L=»4¹<*<#;@£´<ă<6ñe»œ‹²¼¾¶:ŒËk<&;&<OVóå;Ò°c»ñÍ<Vê<•>Ò=Å|<âJ<ÓH=5Ñ=MW<ðçy< ­¼;ú€â<#¸y<*]<àÛ<=4Ìï;Õü×;v0-:‘sÞ;qc`;é¢+¹Ô¸;¦® <*iD;òËNB¼O!<&Q<)éT;••à»m?1;ÎK'»VݼOwþ»å¦l:¨~»ÂEb;X¼ ¨Ñ»»iQ¼h–; È`;°P&»_>~Õ»0";”Ϫ:U« :ɼû“»Ä:Í¡…< «º×{Ÿ;Ž>þ¼€OºY’¼às;x.Ó:ýKÁ<8ãÂ<…,XºÑc@<ö¿:¶¤;Ž<0®I<1ª; ‡K;Ër¹€9Vì<70Ó:©²:<5Z‚;Í÷;ê’ù»Ìu™¼ ‹w¼˜ 0<<¡É<s3<[ª;¦¼<ƒì9î<4›î»‘˜»¢lQ:’ {»—Fº]˜V¼e8µ»•A¼.㻽èA»F~q»ÚΔ»e/Ì;b5]º¼„õ;hk;€;v‘Ð<£h:é„«<;vIc»;™6;÷q<Ð*¹ð ;ÙD_;f±»©Ÿ8™:½«ö;£ »Èv<_xt;ãøš<_õ»„¤¼:µæ1»ªe< +س<„È»þâ:cB<1ùœg;ÝLE< `Ë<3îê<“ö“<¼0<à <ª'Aô»<+c»y?<Õ»¸Y0:º¬pº­qÓ»œR):§gå»A}º©Ä¬»)x¼†'Ó¼iu< ËY<š»@!€¼’Ø…»Ð`9¼­ž¼O.}¹—ÿ뼌%¼ƒ¤¥¼)¢¼¹øß¼,É‚»ö±=¼<k¼ »‘¡w»FÐ.ºèW ¼AP¼(Ý»» ]:’T»»Ý}î»”¥Ý»ÚÍÚ9àû»Uò<6•ç<’Àµ;Õ$<F¹;ü»;è\t<‘°!;Ôr…<°öÙ<‘¼ú;CÜÃ;oÙ­»\k ºŽoÊ<{?7Ê<UÎ/;òÞ».G8¼µy¨9ë3 »ù,Þ¼64d<ÅI»5ð¼B˜ª¼¸Ž»}”ü»[X‘»õdª¼œ.ô»´¹á»®Œ‰¼+36:l9š»ëˆ< ò¶¼/饻¼'¼räc;ˆA5»Ò7¼¯†ë¼¢ç¼%Ûö;়Œ¨×»ì¾Ü4~»ºc?»¾{»‰sá¼%#;v÷|»¤AU;\$B»z÷» *˜¼ õ>¼É©»ÿx—8ÙcÙ»ÈW4»ÅŸxº}<6»L¤ª;DH|;3¼N<ÆZû<ÇÊ|Q¾:µà|¼@vºùSN»¯‚5¼ƒï¼®’¼$2 ;¤Yƒ»ÒÀÿ»3ÓJ»‰G»T û¹bü»†:—»³Üq¼NCË»¦«ç¼>¢þ;£X»¨¹Že¾»¬ }»¯Â¢ºÄzE:yÊJ»½ÔǼE˜;¼#K»CÞT»óÒl»ât¼9æô»¬T¼ÜS¹óV;öºñ ­·ÐaM»9›Ú¼1ð:Ƨ<7‰¨< »¶A<ô´¹<ÎùÆH;‡‡G<6k”:׊;ˆs~½nM³½w?=üû=wí=™G¼eSü:Í>öK> 5#>ù>^½Î>O¯=j.´><Ÿ±>-Ž=´¡Œ>K1*=Ö3I>IKr>H8Š>²¦;>*ÛS=Ë3v>^•ã>žÞ>u^#>.>=ã«Ð>5g=½£;ÒÐß=?2½ Ë;=«w¼R"¹¼(|ڽǿ1½Î'ª½OÚ/½ø"Ò¾*-½8JK½•0*½ á½ ß9=1‰ª½ä½•£B> Þ¼^ò¼¢ò<ƒŸv='Ç©;òS|;P½œ¼¹ì( >Óó=ÿ…=²Ð>¨–=±ú> ›>O+ hµ=äå²=Ч\=¶öÑ=Zi=ä0-<ؼ—Ía=ì§c=\šð<+d:Š‹z<ÀÌ=ŒµÂ><_L>A¹c=Xè–=sÕx>VW>«e=¢§~>  y½`_–< ¾‡=ZãÚ=¶\<ãkú¼×ž½~D ½Œx =a&-=•=öÇ9=›ß¢>Jow>ü->Yp=™Cg>C>-Z«=OQ=¶P¦=Û’’=`%a>±Â>ô&>"âZ>H ©>„Y{>‡Üä>G“r>¢Ø>ŠùJ>lo'>ï=“ßO=ìÒt= •½7è½È™¼9¢Ý¼vZ¼!Ñ`¼Ä±=Miî>3ª=̉‚= tŒ<Û/뽄››½ä¾q¼ü¿È½±î¾ Ƚk½ø´´½°i"½,ç~¼ÊËâ¼Üþc½ê6­<þx=‚M;¤FX<úlܽ°¾_=7B½¼Ð½4wi=舲=šì­>&j‰=Ϥß=fG= „=æšl> ¹=ì°l=øï+<ýQl»Ë€ê<Ø4<€tH½Œj½:,K;‘-7=\Åk;Þ[…»¬$ ½‚+󽡨¥½šçß<É‹Ù:ݘJ½A˽n2";`ì×<³q†»°^a=ØO=Jo=—9ë>9=÷2­=°wÌ=mUv>3pº>ý=îV²=³±*=\¨ =d!f¼yì=1l×¼µäp=+ů=³Gæ=½Ž6=Å̼ž2â=·ŸQ=¢l=>l ‰>R¥|=Om×=ݱ>7ÃJ>Ç]>âE;•Wõ=ªV¬=é’Œ=?âí½Ͳ=¯á'=ßpлÏ!#¼Ä=œÖ>Âô=·> ׊><ƒ’=˜>;ð=Ü [=¶!>D»ÄðV=`Ë=ºæ=ëß¼=ìЇ=þG>ZD;>gÆ}>Ry´>E f>CL²>‚à2>[°—=˜¥\=Gë=(Ð=«ÔÄ;™Ý,<Õ¼d=Dø½oc=,¯µ¼æŸ<îM<†d=º—ý=J7þ=†$’<])¯¼°¥N9ä5å½±ÎR¾Û†¾a ¼‰~é¾, {½›Ý½NܽôÌŽ½åŬ½I2à=®˜=¾ ;"ç°½)Í„¼ 8¾¼®è<þ›+;Ì1¿=*Ú=¢Ò>ùç>×m>m8>õÔ="_=\è=ÃÈŸ=ÐW¡¼aK=WWQ»§z¦=˜®í==š66¡=<à<g;=ÛP=ÎE(>ï}`Äò=ûÏ=µbÀ>L›ä=§Z€=rJ>–~=.ô±=ë^-»€ïÀ=¿t=_è=Ï<Ë=ŠsÔ=¼uL>UŒ=ÏÇ0>'c“>"Ø…>‚Ë;>f0>ö‚>Yä=¿=Â=j<²·<@1»K%v¼’3˜;;Ì ;%ä¼ ƒÄ¼ýʽ7#=½·˜;‡{s<ÊÅþ¼ë÷S;¦[À½EOV½–½¶ê(½· @½öõ%½Êx½›‘|½1 ½¥o¨½3Y$½UѽLXÞ»¿òw¼o½@ïç½ ù"¼¡÷j=‚~=•ßC=Â;=Ÿ§Â>~×>E.=^tà=Ä}ë=Ã(…=÷úÒ=… ¶=×h=!9y=u’Ð= ÀÛ=¶ ݼøõ¶=€¡¼–ãk¼^l»ýW¼úÏ»½!5_½9|3½ÂÌ…½˜ø^¼= ½5C“;:½<…”‹=rÆ=X“"=ŸÈ=é|x=]›ê>­¡=Ñ:×=9y’=©-=€Rä=…=˜=/º»È v¼ø‹½¼÷RH;:A¼Ü´è;Îd"<™ Œ=ç4@=%?¦>_/¼=ñG½.°Î»­€ç=„ÜÌ=í`í=£÷¼Ç…‚¼.(½¾üÀ=là=v*å>n>PÒ=¥Ý=™ÃN=›RAqÇ=Vî=e`Ì;ùŒñ=@˾=[„È;æðŠ=þ•B=".>eH->lw§>)ñ0>rù>Qø >‘a=®&j= )‹<¶+l=ä‘ =^8=l¬²:Áiþ<ãÊ =8ow=¿Ÿ =Äj;fV5=Zì=>':7=‡[B<¬{p=@Ž7¼þ#é½4½-uŸ¾¢±½jL÷½xiŽŽÌY½œ:罌ɟ½^Q½• \¼ç±½™”½\°J½o¿¼ƒ£A½Ñ›»ÔgÞ¼¥¦=…i=ÒX¤=ûœô>U’Ý>|>y=GKT=ëÈù=‹ëU=è»=Õéò<‚P›=P¢o=8z=œS#=³sý<…>¸ €Ã>IòK ´=¤s =ÐçÍ>4Ð>zR·>3wÊ>#hؽji£=¹Kô=À\Ö=«Ý”=ˆ;´½tÖŒ<Ë@%¼ÖN—=Sè>=6ãÄ=ø?¹>f¯>*×<ª=½:yª=Ñ:`=ôZ=¦fö<%*<îÓ7<ïV8=k¥Þ¼àõ<ØS>>C5\>*¯> Ý>#<>6y6=Ò’¯>S‘=²÷’=ë‘w=Ò …=ÍÕ=@I<퇜<@5V=Ñ?ô=VLƒ=ª>>®õ=mÞv=AG<”Þx=ߛǼŠ?v½/~ö»¼ ˜½…]Š¾&½´ìï¼’š.<|¦.½Nν†Ò½Š-Ÿ2v=@¼Û=^FF¼‘×|=3 ¶=ìÉ=ìy£»(ù=³=‡i=ˆõ$-a>Ý¡=ÝZ>,Γ<Ðf»ŠB÷=¤"¼<¬=Ÿ;Ó½p =ÎÝ;ˆfË=þq¼±³=|x< „;9=”ƒç=tK5>B¼=‘'> ‰=R(õ<°©q=Ç«o=¦™×=-à¿=ƒ³Ò¼IýŠ»ˆÑ«=!{<83Ü=™ú?æû>6=£‹=ˆ=Vr±=JzQ=úÔ<2Gª=»ªè<¿P=R!¤=l:)%Æ=¸v"<à3>7sð>eo=ú{O=—&=þÉ¿>s½É>. >(»Ý=ò¬>j½> Ü>6÷=7GŽ<‡¾<µ‚k=¤œ$<ë±=C­ã="„=èûS¼Ü›`¼¥Á<’‘½ i <‚‘5½&þ½Õ×̾D;:®<£Ã<¼¾íÁ½…9<½Ûù½<²Þ<È~H½/yå½_~±T=9e.½!ær>*i!=…p»¯Fþ= 0<7F=œÉ=YXj=†Úl=*t==F=4 Úº`C¶=Ccß=b+h¼+9†¼6ø½Tóu½Z¶œ=>ï=JVؼÀYU=Œáx;¢÷›<}Øâ=¿L^=Ø5:=ç¿Â=³ =žj!=Gë}<—ug<Œ"®;÷R‚¼îü¼óÀ&=A¯h»$Zš<:u£=<Ò<³¼ðûÝ;Iœ¼gÝ5½],Â=WG×*Î]>QE)¦=ÈS~> 4º–è<¿ÖÏ=ë"„<ðÚ=\ŸW=ÄeÚ»¾B*>fÅ; Æ=€<$Ø =Å =ÖÎ>Èy=½[è=Éêð>_ØÆ>KC>5 ›>á>LE=Ò+U=¼#=‚˜ =•°‹¼ÑwÍ=Iq*>;„½HÎ=›d0>7ü<Ö±nºúkÌ; sW½9À¼Ò_¡½Ib½IB¾Ñ:½LŠ×Z¾òa½± ν@H&=0K>¼–O=«Ùj=m5²=ô±Ÿ=‹æ–=¥(==C“=Ê <¨„wû=4Ã>½›=<¶ø<ýýE;÷å̼ãæ=<»½VÀ—¼´Ø¯½ öú½A“­=/ =¼¨v¼”§¼Þ ;:´f=¯»=S…f=ƒ ¯=ÉÓ»Þl<ç›Ù<ï –½„»'ø<ÒfÙ;÷/j=¥õ(;ÌL =j“º{T=d¸´¼Ý‘½´ÞM½c€Ó=zã…=!°½=©Ü)>‘j8=ÆòI¼­~\= c=nì»òö=š|L=„k»q¶:¾Pb;X/ë;Ÿþ$<|ñ¢ºÀY¼ú»¢‘':žÙ軋ø;îr¥<+t<ëÍ<§-;`‘@9@Œ;ÌÎ×;£;„k(f—:õí¶¼=§»À·Kº…Ûº_#; B~<3Ññ;úÖÓºW9'«ß»T'á»”©¥»–j»Øº1;ÇÆj;µ§[ µ<±û»È`;¨.¬;\uú<ݵ;ç½Ù»Þÿrº1|ºÉ-z»©:Ÿ{ýºËôZ;Bò<6G³;ÎÇþ»aÄ:âõl;÷_ã:¡ÃºÜAç<€/;– (9ö²»Á¢v:ŸzG;™ÈÜ»žI ;.F »ä£n<Ž};Éã<03‰ºü‘(;A¼ »~³:Ꮋ-æ°º¨à‡;ÛWµ»@ŸZºÄʹâȉ»>;!6.ºù3[»ÛV»¿Ù仑¼4NC¼ZÛ©;—½éºfòå:~’Æ;Àèt;À€»WHè¼ Ñ;’ÍÏ;×1»¬P‰<…œS;N¿»YÊŠ9îŸX;ú„Šºï ;Šmˆ»¤dk<%ëv;ÅQ—»Ù>m;xµÑ<`:?<>2–;üŸá;ÜÝ;Ñ~z<^HÇ<1ÙŽ:é<‹ä’<ݵ;‘2Ã<m»øh<¡-A<”>Ý<(?'<«^7<†­;Æoø9ö†å»Q6Ï»_™û;HJM»£tµ;t“E;ˆ½_;Ò*'<¾+»|ó»è9\¼Y=¹Oý;m»ô»+Æ;§ɼEî|»*GE;²~»× ;®ù:ä°ò¹½“ã»"WP;Ñ'T;2Ê;¬{;RˆÜ»²Ì½;ÔÙB¼ ôq¼Ò°:ä&_;öêkº'¬ï;\êØ:ˆ¨;{ö¿»~’» Ã;»ƒ4G;£¼»<â;ƒIɺø®Ô:‹~h;XH»gÕH;¢ëöºƒ<¼¹¼ƒ¾Š;o"»ú“|ºˆX};Å8»÷XP¼«x»âÀ„;–ä¼Ýòº.'ª»ŒÖμš7¼Z%»Å¹»sõ¼Hé]¼ `ºÅ溹øßɺï/}»×Ø—¼=X_» Cé¼H¤:güÜ»ü±ÿ;â»ý‘{»9Ð<~áµ;M<:!P[;8¨ó;gºÎ÷ð<>ÄßÝ»³¡;eçƒ;/E±¼Hø<^n;§ÁMºÛÿÆ»œV0ºÜO]¼ˆðE<cã;™ÜG:à„»~„<&#í<ÂEªv<‡"<Ò–D;CÛÜ;+.Y;›A-;›6;±%E»‡BÐ<=É°;â|ºo3ª<˜™ì;üã†:¡¢ë¹³œZ<(4º©~Ë;Ì|Cº‹ñé;Û\i<–R´<<‚ÊÖ<.Á];»L<*׆;ÅÅj;~ðš;úvñ»wŠ<é™<(ò”:N”¼e”‹ß:·»ÍÙí»Àì¼Ïév»úˆÜ¼>†ºB«Š¼O-9¥Ë­¼#’»ˆ‹ÎºÙ ƒºIè};÷Ó×»I¾I»Ê¼%ÂZº‹§~_A;’rƒ<«M¢<<ð[<·;»<[„^<ry<J;þl; ZÁ¦< è;Î¥²;jƒŒ»"Ûs;*;±Ü廳‚Œ<¯I;Èã<;ëÙöº´‹</ã<ª=€¿<ŠtÛ<)è7ºO¼c“W»â*òºÈ*;»‰ƒ¼Kq»¦þd:†QB»þª—;Òy;‰mÒ;ÃEºiÕ:<(ó<DÚ<fÒ;/4»¡Ìå<€ò'¸q9<ïC±;ô+p:õ”$‘Ÿ=M$d¼k=C=š¦n=œ™<ëyó<Ø ;ªßÀ<¹7Â<¦ ~¼VA<€´ò=ƱG=«ÿ6=«ê<ðn9>5$ä>{Ûj>aúå>B—N=m0Ó=š =VÁ=¹oy=ÙåO= h<²×¿=ºË×=T¸º$IÞ<ÃÌ=ûh<°Ü]<-$ͼøOú½Â;šÞž½“L÷½»/7¼[´M½JÜç;élÁ¼£L½ÅºÕ½ý‰½—hR¼îå;½‡[ð½ëʽ£¼ã X=(†Ê=Dòx»œ…)=ÊZ=-`§=—¥ó=Õ›`>1ÙÝ=Ã(o=ôø=c´@=P£²¼…¨<œV/½›È>½¯[=EG=ÄOß=®_/=·=€| ½–»õ’<ðxº¼ îͽšª<1Ú½13ù»Õýr»æú½œøU;è˼¶]®<ü:‘=€Q4>Œ0=}<9=!bß½Žƒ):º¥[»qï$<´áà»r÷=.ϼ YR=Ü&4=! <<ü³D< ®a¼v¼Ú½ÕìR¼£<˜<¼HÃ=¢œ:>0W³>1r¦½Ñ=]´¨:¥¤ËY7Ù=1ë=»É> ÎP>pîÝ>8×=º[z=?gk=ÔÄÍ=©>(¹·=ݦ1=ÚÈŒ>"9=ÀSb<þq‹=zc†=‡œ<ø=­¼êáD»±Ï½á–½å"½ #g½*hͽŸÎ¨;ì7ª¼Ì¼îý~½²h¬¼¡ÞQ½÷­†½”ýú½´O½Â¥ ½ ½˜Q= Œ£=c(•=ËN<úDŒ>µX=Ê|=lsŽ> Ñ=r]|=1hS=³Eã$Ò=cä=SR¼°vz¼×÷Ð=¥ƒ™=*º>@Ç=ö€Ã=•¨‰=Ž›¼Ñ¿ºk• ¾2>½Ñô/½uÞs½Âȹ<ÃÕ½mL½$¥U½ñ{Þ½„ݽ±A¼ºð±:É^9ºÅþ¿<ÜÄZ¼Ûï=4sB;Ð9=ho½ºžè¼Þ§e=º`n=¹_¨=w”û>Ž%>^&™>= ˜= *=ëUâ<Ì œ=ƒ¦=´c=x†=¯'8=ç$> ®Û=bOË=u‚¼ƒëÂ=3ü…¼µ¬_½”ƒ°½Šz3½a:9½$²Ã½ß‚½*¹´½>K2½Q玻J¨‘½ᬽԆ»½æN½ò|M½æòϾÿ½ðà'<<@ã¼ùÛ/=sO=–çL=èöV=§Ôú>G!=­zÞ=à˜=£×Õ¼…9= Y=€ô!=Íäw<ÿ œ;°w³‹½ þŽ½…Á½´™<Ëš‡<;-!½M8½Æi =†?©<…çB=í=yé =“…J=!‘ò;Át1=!$D<Ìáƒ=“œN=›Ü„=y¹Â:ˆ‰›ܽ½9¿=›~=Œaà½ê¾ hݽ•bÓ=‚˜-¼¢÷÷=3=fò©=Gcp<”J¾¼\㘽oRÄ=¨%>!èW>DÂ=J½õ<:sn<=Å£;½ÆR̾!Š¬½“L½¸ˆ¤¾ @®¼ÁÜѺÐÑú½ô€¬½µÿÿ½ËA¾|{;VHÿ½Ÿ·K¼§êܽ§"{½¦¶Ã½QÔ7=ˆAñ=ÊĤ=G£…<Õç¡=W0=;…Â=óQK=ækX>8˜ä=eûi»¿Í—=µÖ%gÿ> Ž×=i9c<™\^=Øê¼õ¶¼‡v¼½'Îh=,‚W¼;"¼aÔä;ßK¼®‡<0ôº½az›½,\½³s·¾ü`½š ½Ce½áÒ†½õ-¼ÿ]Ú¼”t¼;Èo÷=¢Ÿ#=èÕ0=™YÃ=á~»= žÖ==þ!=<\ ½'²¼½\Ë=+ù=Ž–”ºØr=†m/<‰ÎŒ¼sù.¼øoó=^ÉË< 9Ú @=| <Ÿå²<Ø.н‡ ⻀íÇ1Ä;й½¦3A½`ÔؽŸYÀ½šƒx½?Q%=Ië¿=“2={l*<ÇË`= †j¼· j½‰`Ë=Ë%s=Ãx=°]79Ø5=Q?i=Þšh½›\ö½CCÞ½·¢½lÖÚ½b€Ö¾Œ|¼ÌTP½–Ý~½„n{½Kê)½ Ix½–ª$¾Úǽ]Qg¼0ö¼‚4 =•¦<—4Ü=î—‘<—^”=Nš<«zÿ=W>N=…Á½=sQ8=Ç4=³ÚÙ<ÝÜ¡=Ð'Â=Á]«< J³=9¬=î¦ =X^>)LÀ> VL>"Ó;ü¬=€šd=u«:«`Ï=L'=šp='ï½èK¼½³Ò½:¡Õ;«3Г7½f›½Öà ½çk<û~.<‘Å«½ ËØ=´÷b=£Ÿ|=§G½ 9Â>(¼6˜ =Öák=<¢<=)€Š=“†ø=úåo=9¥¨=ò™O= ˜Û½O«²=ÿ=Sì=*R=£·ë=ì<7û=€$U<"‡7»¡©$=›Ð=ÚK= Xܽ$Ð=çæ=VmÐ=ªÝ⺫¥]½øŽ<“¼k=¸ @= šA=¨;=ü Wºº†;=FÊÞ>#¢=ÿ©ò;ºû>Ö$=^Q=œ•(=i×=å%=Ù"è<¿¶E=bˆ¨=-W¼Ü"½d„Ϲ…c0=a=©;¨(`¼©ÏL»-ÿG½ÊTg¼Ðä{½aºª½2Ê⽗oy»Yí¼vß=eX=©ƒÑ=‚/>ßÛ=ž+$=€$Ç=‹m[=¢ÈÙ<µîâ»ÏH¤;•ÂÕ=!2W½–¼ø&j=Tæ§=¶Ñ(<ëµ/=ö°=Ûܪ=º>=Eæ >ÿl=¿3p:Îg~<ûïc<Êû<~)¼1Îq½ºÐ½b!ͽ«o-½¨‡=dƨ=ªoo=§®Ã> =ƒP¹¼©`=„Ï CŽ>1v=ò=gá>L\=ÚƒÄ=žl>×ì=zÇ=Ž._<( i=-7R<ùt²½Õü¼Øâo½ƒú¼Ýd×½® f½V¢±½‚Q½½¢=ˆ°I¼àX>= Ú=jæÒ<Ücý=»Úñ<6|Ê=QèÐ=-°7=î^¼¹]³¼šÆ;Üg<ÝßÄ<˜tR<Ì o=Atß<á‚Û>#­H=÷c =˜'á=ß™="?p=£Ud=Í|H¼¬¯Y<ê5A½¡Ì(¼‰½!»©½³f½·D`½š¥=›èz=Ä-°=”=$=’Ž?=›ô˹­bþºÕs¤=¨DË<ûj½=þ=• =Z)˜<ÚƒE<Ùó½yî½OÒ½@ǘ=tÞ=°ÔŒ<ø5„¼ìäí½˜'ܽëv½ð&ª½ s½îÆï¾oݽžX;þH¼¢1¢¼»KZ¼,Æ–=„ª=K‹l;¨t³;ú7ï<ž¾:ÄF’:îš;óÍÌ;Ú¬<Œ8Å»Qgþº3Å;E´h;Á'[»¼Iy< ì¢;Øðå»E²;A9­wz;Ã.Ê:¡6a»P‹k»#ĻȂ»- ·;™­E»¹.¼jθ;¨t#¹1hú»Ò(ü<$£!<."U; °K¼ ¢º¿ñ;šqd9Yô´»~Íx»°û­»6Ÿ@º¤lë»Îõ£;²=Ž»ûø]¸‹¥—:î]1í»’f»`¶º™f²»“Ó8» ø;0‚Z»™½é9¨(¼:÷XÑ<†[»ØÐܼ ¯é:3W»ï¯M¼ mY<_Åmºe8;±:;×…#9Í;Ó»2»‹Ä~ºäª‚;¡2;‘SG»à¼ô;c¯Æ»––»raº~Ì*¼fI¼W:âNS¼¤„gº¾^"»«MÕ;ÐMéºd°b“<R;S°¢:çfc¼ ž8»k=¢:sÕ;Uì»?^o¹k‹ŒºÑîþ;qh:ÍʸºH<0[¼wTz;q¢»É®»{úy¼›o(»ƒëŠ;Vö1»Œ¨/;Cû¨:ÙH†¼ :g:rÔ¼L,л™».¹>¼!3y9¦ö†»©®Ö;ã9»z©º›"©¼_¿'»ìMN»héºìþ ºg|³–Ì:ž…¿<Ä”<.c¡;| <+ÈÂ<’@}ºº¸m<…8ƒ<9ºì;'À;œ˜‘;亱»“K¼Äɼ|‰3;³‡`<Dá̬9â ô»Vqc» ñR»©Š~¼ 5–:Ñ“P:Þ`î:·PúsPS;ª;¨ï»®æ¼ F,;ü<$Ç»Bλ˜R»Ó[»²;úè&¼-W¼!P'»:Õ,»V1›» ¾:£ú¼Á¸ºR»4cI;Ñ5n¼Gœ‘¼!á»1¢»¦˜¼™Ið;Ö=:ù!Ñ»ïJ»Ì"0;nØ;w»yn绨ÃL;ºs5ãº/¬»:ÿÄã<ç»÷ã:²=<Â_;e»QǺñ´Õ;e|;öØ/ºò(;ŸI;\¿:õdÕ»%T;ٰػ“«º§ðh¼$„æ»Çü;pöλæ¹)¸<Ÿ.»Ø31¼eR ;Æd“ºFoý»‚ó¹².Ç:?±«» 9;™ô¨ºz;C;…öº;5€yº–Jƒ¹?­F<7È< 4[6:xƒ»É¥z;†á»–劺œt»‚`î¼/o&»Mƺùy²» d×;ÈÉH¹Ãa¨;Dz$»J¸æ:‘CƒÏÇ»Â`D»†t»£éC:g¬£;wÎ;8±Û»ºÎ;…ŸB<<±{;ÎÏô;Ó›“,<<¡Q;üÕµ;?\»c*Q:-ÞYºo Ÿ;Æ¢»“ª;Î:ŽO;ØP»µ ;´L¢»¢"Xºó4Æ;Xó3xHŸ=Ì2ÿ<‘·=é¢>>y=W/º=Ä =ϨG>a®=ùR>)õr=–‰]9P漿L^=¸!½:NżÁd…½Ì = ±?½@Q’:÷Qï=£%;y=/c= õÉ=–mñ=—î=&ˆš=[h¯=q×J=…oX½f±»Éš¼]Ú=£F+½,]Ö=B±ý=hÖ=oÖ=’„> 9=¤Ý=[;—=]•=(œº=þΙ<΃ì<ÒI•=oⰼϬþ½›g½l‚Ǿç½â²¼ó‡!=¯]-9º=¯M$=5óJ½hü:1=¯=¤<ž‘±¼”B½VhÊ<ج<ö§Ê=C Q½‚FĽ•Ð̽¶¡½‚Á½Ê‡X½Ñz¡½Ã¼½Ã&ù¼­Šr¼ìš==¼ó»ö9»×(£<ŠË:ZÙ‹=.*=ü•T=mŠ½{š(½Ê+4½Y³½'ÆB½9ñ¼W»x½ My½8Hš½§v¾x?½©º ¼ÊÂS¾¹¶½³çg½j²Ö<›å½F0×<\Ié½›ýª»Ê\\=3Å;|³â½Ð¼´ J¼N­ï<ÛÈ×=„ä¡<õ)=²@=ÇÔ=P•ñ>“.º>.SÛ=:·<ô+=ç7$=Œ\=d_T=V7=9ɳ=J ½>†ü=’_¤=I=¡9> íÖ> î>0ƒ‹=’,ô<öOª¼Ôç$<Ðþཆv÷½sFô½u03½†**;à=¤Ès= ~¥<@¶r= 0­=Ý–‰=39`<—¼0=}‘>Á„=?·(½µÈ»RIÕ=ö=LŨ=Çh=^^Ö=¾A=Œî$='£²<ô(o=–zs=‚œ½=Ôþ==8=–;%Ïó¼¶þ¯<â-u¼!â’;ó½XB½Ü3/¾@óh¼ úø¼ÞØœ½0¤Ü=u9{=í€UCÎ>” %>qÍ=[Ò=ë+õ=Q:¥=9˼½PÈ@=D©&=°×T> fÕ>7ÁÂ=5w=:ÍÖ> œc> "(=ÏÕ=¤*=Ø%¼“‹‰<ßN¼šˆ½¼ñjp½f…ǽþn½QÌ4ºøm¢½q÷=Sp¦¼BûƼk¦=¥_É<ØFï½>kn=z÷=“!`=Öa¤¼Ï¿¹¼N…<›•Á=Ž'¥=hZ=¾ y=yù<=H£%¼nbž»žö;½‹ê¡=]®q=6vû<ÈÕ_<‰ Q¼ÏQ>t=62½¼|¥¸½Á¨*¾ Z ½º§=C†’½*‹£» ™è=Îë=Á5B=¢xà<·œ=Ì=ò—»/¼)¥;=°X@=•í=¯„Â=%í<`8ð<-Àù½᪽Ä'¼˜¯6<ƒ‹¼ è`½ .½,‹÷½V˜¼2üf/o_=˜1$=Š Ï>Gs=ø‡l=‡nt=Ü P;¾œÂ=Ul½†0]=¸c=B|`=µ =Må >g+;I¨=iE>.Þ>0L?=B%=,ûù¼áà<åÄ0<9½i<²½…;ó¼ƒûj¾滽µ`{½*"®½)™±¼tPO=›{=l§=9L<ÞNz=tð=Á¤†<ôgÀ=”ÿn½;÷W=˜ê<—€Ç=³Ô=ðE=ÎM‚=–/¦©>tÓ<;Ý ß!=½g=#˜<>£=ð^=³G=[Õz=_¾z½m'×=s%¼w§æ=«{=2 :¼èL¹»kbº=ˆÌÖ=®`ú=æc=ÈðH>7“ì=¦®½ÞÙ¼¶sí½(6=9Óô½GTW½7Õ<•€ª½"eN½ÁZŽ;*ùb;ì-t¼oÇÃ> ½<ü5=­«ä=d*w;Ý&2<­Ó=z=¼ž‰>ÿ=ËÕ0=W¸=$=79y=åÂœ=ÉRª=b¯>w”<‰êr=Ž^ ¤º‚é)=**A¾Yš½0´+¼þ#J½2aC½d«L¼×s½S;°½ŒI±»z»c½,Rݽ–[½Ž1Ï<ȵƒ¼¼¤û<ôŠ ¼Ü«½ÀZ<üÙr½à5®=•ž=m‚;$Ä©=s¼Æ= o¼vÝ)=‚«Õ<‰é=؇Ü=ë1l=/ ü<qu<[% ½<]Ì<ª›^=7²;Æõ£<ËPê<åèÛ»ífì¼øæ$½g¯½Aµ;Ñê¼`üмqÚb<ša¼¼æƒ=®ž[=r÷\<‘ž=Š»ÏY=€R?=mˆ=‹î´¼rVϻŗ¼iðì<óþ½0=´¸=œÇÁ=$á·=]lï=„>¬®=}’–½§Á½ü½mŽ•=:ÍV¼dX =àk=ïk_> ý=m)î<¦Îc= é ;{¯©=¾H=°ê[;MC¢=Å»¼9Ár<ú´>½V€o=‹[Ÿ½‹e¾½Å—ƒ½ 8½]e½§Â¼èÑÕ¼‚?<™¡;Á5¼¼ÀÕî=[ê¿=*YW=·3`»ÔŠ=±ÜW=‹ûʺ»4ì=™<Îb|<¬U=( ‰>p=%¶Ý=|/Œ:‚£Ó½ç‘\½‰æZ¼4Ò½ uL½¹t½.î¼¢±K¼–ç<¼,½ß´½bV»„ôQ½_9<'×€½e9ê½Çqx½>ØŸ½™É<–#=&Ï =Xt×½G+’<¸ÝO¼»Ã6º"„Ù=Ñ‘=˜â=>ês=±éØ<ÁR=–1j<I½„‹¶>‡e=ؼý€Ð=œ»’:Ý ÄW=f Ì=£JÆ=…•-<¨Óö<òƒ¥=UÒ$=âI4»•”»½ªLë½×A1<ýy¼ìY¼º¨<™Ì~=F.ü¼„ʽC/F½y„绘¯½µª<Ì +¼ýo¼ÀÛ½Jû™½­L¼¼Pˆ½¨ä¤<¿R‰=Cbn=é·Â=‹É> -›=¹„=Å5¢='ƒ“=gB=µüC=ªæ¹¼¨!_=kšn¼"ÂÎ< BD<ùÁ ½8N.<€Àe¼£š¼wÁ<1Ç‹¼"<&½Eòùÿ=É5?=ιÜ=¾è =c;öZ<[éô<9;i<|ÚZ<'ƒ¼aþ9;e3)—ºòˆ‰»ìÙ÷:v1)» ­»踻Ì5W»$¼\}:«Ê;ì&k;¬4›¼!üÏ»æ\ ;†¼LÌ!¼Xz꼄¿]¼ÆźÐ÷a»ðÍu»Úˆ»¹®3»Ž:L;Ý  ºò^ö<=PV;Ž“4¼í;©TK:¡èX;™!;n=;ajü< Kï;Ÿú–<Thź”‚m<û«»½!;S <œƒé»„÷ò;¡¿r¹þ’;ˆÇ:¹cÐ;»·~;ªh¶;ká›;V';Žñ;ÑBù;¿?¼bXd»“£îºtr»æ+: »p;ô$;š[Ö;[q¼Ñ;îVô:j5»‘=m¹ø_;Ÿ°:ª7È»îè»»'ú»‚3n»Z–z:}»ízb;›º¼g "<tˆ;¢j <¡˜«¼:Éô;­Qf;òpL¼ λ-?»oC´<€X¼[Œùº§Z˜ºË0¸»,:3<¦è;+tâ»ê4™»;‰¼¼ ´j¼KX-;ÏS[;)À†»¯»œ;±1¼•º ûQ»ž†ºuÐ}»¦R`º“\2¼J}p»¦{»ù›¼Ô=`»Œ7¼\W»Ë¸Õ¼G™»ž©|º°Aλ®ÝÒ»Þ“ÿ;JŽ9ký=¼‘‡B¹Ê@U¼¨¼U»*<Ÿš R;ß*æ<[Œ¼Sú<8k™;Œ™~»¾Ý»»À†»R}•¼fþ¼‰æ<I×¹ b¡»Â R»¼Ò£;ë:î¹ñâ7¼/k;—°Â»©g¼;λ¼#D»Ù¿1:˜é°; »ÂŒá;7ì<+ÏW;™*<-(&¸4D<f!;º—ß;°Ý×<Ÿ×¥<7;©V»vÃ;פ¯;•úÓ;ž/ ;뎟<û~åø¼`¥ƒ»ÏÃ1¼DQÏ»ïðC¼6è~»‡á»~I;ŠÚH;š.Ò;µ½ºÂÛ*¹ÙÈ»XÆ–»o›¹5¬ê»;È</!º‘“:\ˆ;=lÜ»~Ây·ºLž: N.¼ ;p»Xâ<jŒ;g.a;UŸ:¶W…ºɺu>õ;=P/;ìs< =»Uû< Ç1º,K <9^î<_P8»ùrºõ‹Î9‹Zí;4æm<3`;CU;áG+<ð‹ºo};u²š;ÚÁ;+ãz»³šºÂÑr¼iJ¸¾âÛ9‹&ð<2i;u¼G¾¼ oF»œŠï»«ç‡ºÖ_<&í;;‚Ýo»+,º»:ô¹L!;Ïûª;g@!<Â2:HŒg»]nV;áäy;°­_<à%»Rw˜<³Ô0<PÊû4QºÏØs;»g)Ï<(,±:3‘R¹¢Èœ»|K”»<-uÕ;=ç<:³C<ªª&<)>±;¢wÀ<(Í}<Ÿõ=»›(º¡<(yá;š€ ;7;_-C»vƒÝ¼RJ:‰¿#;¼.‚<[Ú<‚ÿïºû’;Âå<€’j;Éý»¡ ;\SÃ<¸n;2²3<6xŠ:ƒÄÞ»‚ά¼ÙA»úá6¼r{;¼Ò ºó¯Z;¯(:œº½;š¤’;i[»ÁØÚ;R‹q:§Ðg¹ÙËð9ªª\;ýX´<íï;˜Å›lÉ<;rG:ÔÀ¼#x®;〖º÷uK<_á0<ËÎ;Óøü¼­<ôݼ[b<˜Ø:BÓ¤< ÝÝ:PÞJ¼LÔ»šB¼ D໬0ã<;×»‡‰ñ;Ù´;Ú«ü9¤ùµ»W–wºÊ²Z8ôO绕`S:­Ó›<íXÑ;7¹;TŒ¯=”HŸ={骼s® íu=3”C=±1:³³=úY¢=àL¶<#N<æ5í=¢e©<²ïü½#ª»Ï1[½‹A¼¨n¿<Öëî½ø¼CßÚ=×;ªdú=*C*¼Î¡¼Qõ<ÁŠ<<²½ ¾âP½¨~¥¾(çû½ÚX3¼ “Ò½4ª½×²ù¼b«¼Úí}½ ~O½LÙA½KÔ(<¬=»c”ù=ïJ¤=¬“=È5e=¢ì¬<!f=iò–¼©_ˆ=Ø)»öO¸½u6w¼J4Ó=…TY=Oàå<³õÖ<Òà\;b§[¼8ò;‡T¼ŠbÍ=`T>¼Ô®á½>€¼sªÁ¼%£@<e_¼~ûá=½fm½¬µ¸»Ú‘ÊÑ>öŽ>,ß—>™ð>Q“=5¯<â^=$/ð=Á‰¼¹È<üÄ“=¦÷Ò<ùV¥¼ŽƒR<²v<ŸÆõ ~=ªØ3<ìø×<ãL¼ƒ0<}=Kòþ½x|=@¼=­5:•§½\XP½Ûêñ½&yj¼gcô¼ ˜ª¼™Þ¼ë¦Ü½Z¬S»[˜µ¼Ús½×…k¾#b#½Ë û¼­á¼¬”†½µ\ž½ÀÈï¼mZ½¨Uؽ<"¼·²Ï»à.T=Š\<LJ‰=Ï=³ì=I’%»§FÂ=ˆ-½=” <첇={’;Ö=4*=|–f=>~½sÿ¼Ÿ= !´¼Úý¼§×¾½=;»Z0¼¤Ð›<±Ó½@ò•½– ½mÕ=mƼ¥sÀ=§;/§½ ,`;³f½ŠoÓ½ypx<.u½„ó‹¼±|×;´P•:Ì9®:ïB½ºo<˜½=€’õ=Í9Ã=ÛÐk=1àë=Çd×>8¿*>Gº|>DÌ<ÌÃÿ=€uÍ=Mo<‘D§½å.¼Õâ$=¸õ¼k¿ó<ÜÅ<ßâ½ ÷;ŽíŠ½ †m¼® 9<«3ܼŸ^Ž=ƒ/é=O»ÿ<¿d¬¼ÁŠ_=Ô_ =Œ…Õ¼Ú>Ƽ©vS<Õ€=;0½Rÿµ=ß-=§ÎC=€Èq=ƒ¼¢=Ø%={E=|ˆ‹=±:©:òù=ù=>ø-<ð—<ƒu;‰Oô=¨7÷=\Z½“²½ÆW½³•½Øc½£þÒ½’|q= [ø½ ½ø½Jв<’T‡½TTA½‘X½ÕÌÚ½##½RO);Gž½Æ©¼Ûˆ½Ÿ›½P¿«½aƒ=Å7=:½ ÂT=4sØ=੽r:Î=´•I<Õ@ë<îew=ã–A=¥Š­½D±á=naW=‹^·=·B½('½("-º;æ.¼ð™j½®­<]9·½xæ½Qˆü½=¼K¼óç,½‘O-½Ž]Ò=aûºãqã=‘–g=–-ʼ¦¼Ÿð½3¼KБ<§ÙÔ¼†p¡½Ÿ×½t†q¼¡ª¼‚l<®ç==ÅW=ƒó^=Ž 7=ÛPé=ƒbf>G 7>$ú =È|Á=íÎ[=® <Ý•p<§s­½ ʽ7/`¼Á— ¼W ½f<4ɽ9T½™Sõ½˜»½= v<@bœ=VÈ—<ë%Ê=(Ƭ ªx=´g>C¼îlì=¢Çe=c)(;YtX>óé½>x½°µµ<÷ûM<7qº=Bæ½îÍ<ì$<=½½‘¼»Õ}~¼v.½O_½•s¼½8Þú½Aä<^MQ»ékºb6®¼MB½*·½Êvó½…„½ñ¼þá½"3t<_ ;¦o#:‡]o=ëÌ$=©‘l=ÍÞ`=pjþ>?Û=®aE=xT˜<àP˜½ì\½-ÿ=—‚Å=ú<»ûo=ü =9Êë<ôÊνQ½—z¼ÅC‰½ÍB{½L:-<ºO’»Rt½Ràã½ ˆA¾ž|=_:t½ ¹ÝV­=t4]=]?½p!T¼è-n» õÜ=W#½‘'¼iü¶½œ*4½D¶ä¼ d“<\ºÞ=†ëd<˜F(=Áb=œÊ•½n>äZ>ÙÀ=õ×z>zâ=÷p•=…œß¼ëÝX¼ Œ»£°B<‘¯Ý='‚¼ðçx;%2 ½©ÃÁ½_ j:¡§>=kUè;„` ¼n}t<†ôï<‘k=Ïß3<„NY<=ÄX=Ah=…‹Æ<ïìã<ëfG=¦‰÷=ß·Ö=ÆA­<„™=¦ÑF=Ó]“=MS=Ñ>½>̼¼*;ª™9<¨Œ <™´(½ÇZh<¨“î¼¾*„½eŒ¼Èï)¼í/½4 ½7™ ½Œ°¼%oc½<„p½Ÿ+彜$×¼‚bh½SÄŠ½´¤½àÕž½ˆRùº65Y< ¬<¹Ð?=­‘»¼nCÕ–Á=¶2z¼Ë×+=£³= {k=‡žÜ½1Þ¼£‹)<¡ŸS<-í\½ "è½ZÙw<=‚Ò½¡K<ìó=M =£¥=\ŒC=žEð=OŸ=ÛìäM=Öù=‡ü=bÝ…=h@™=¤$¢=¢3={ÆC=>†<{HÓ;L¢&=îJ<Âæ>+ã=Ò·ä=m ;iÉ =WÛ½^þ ½ãñ½€R½Ä9³½µö¬½%’ª=«4:Aòí;»Â¯<”˜½Ä9#½3klDÉ=ŸÏ½•Ï=Qi¯<{tõ=ˆî|<™;=yÌ:>b»³­ý=YZÁ=H%µ=sOŸ¼© »ãO`<îÄ=eª=+Bm=œÓ)¼°lV=©!r=o@¯¼áµÅ¼ŸÌû½/X•½%û<‘s=¬ó<ÅÞ½0ƒU=‡½Í=„Òæ;Ä=¤½a ´;¤œü»¦SD½ú+8^®.<¬z+½’!¼š¬=SÏ$½»G=CY*=%¹ <¥úù=&g~<ýæÑ=Ž÷ƒ=¿ Ò>™Y> @>º2>Û©=W% ½? ª<±kÙ¼žZ㽓êR¾($½ÒË=Wƒ½¤>ñ=‡„½=òß<‹í=÷À¿=²®=;=Ãf…>#k=‚v/=N=¾á½ÜƽW¬,=½íÑ= Ë<²ç¿<Š ˼H©(xL>û¡>D…À=Û6Ý=!tD½%Ư½ÌýŠܾ‹¾8»¢=vq»ÿs¼©m•=I.=ÕJœ=†±=Þþ<™„c=VS=W¼»=½Kˆ=Š>=†Õù=•Q]="ö^=Gƒ‹=³(>å=ÕÂO=¸C¨=Rßo¼®ß ½BÃ\½ß½kÔ»V >½t©2<Ä<󩊽T›½½Ó½¼e^‰¼dÌ==½3K¦½Zœ½Œ¾`¼+€=Í€;cy›½iÎê=Æ ='xb=Ɇ3=ÌÇ<Èã½à<_Ùº=?wN;ÕÊœ=\™·=KÙT<´¨>º’=P+½;Ð6<×`<»ÿ¾õh¾óz¾;tª¾ùN=”›½KJK<ç`Ï=€ö=²d=Úœ…=÷üvëõ9‹y{»9ó›¼.í^½ýº×Aà»’p·»¤­›¹¶ª:˜ˆ;‰¢°;Á`’:hŸ:›&;A„«¼ÙX»­@@»gA÷:óûÕ¼ˆý¯»›D»;´×9§¶E<žŒ¼>Ö¼òP»öcˆ¼Óͼ¯M»;ñ¦¼ʃ»¤Kż)þ¨»•›¼¹¼‹»úÃY»¨s·¾L:·àÑ;XdÕ;¿'´;oy‰<–ð­<‰Ý‡< Ä 94°—;pŽlã¼8-,:—s(<&#)ºôR˜<¦d˜»_0<(f;òÕ•<1P¼?=»òî<¸Xùʺ Ä‚¼>'ü»Ì©¸³YØ»¥p¤»Õv9ã¡5¼7«»dóºC»Íõ<\zºsœ.»º·Â;… -»’%q»‰¦¥»Æù­ºþo5:ÚCò:÷2R»ç–-»3úºã\ñ;„@¼».êݼ ª ;®XH¼œ§º…À뻤5é¼ æ@»Å—¼Z?¼2[ž¼x e¼-»¬»Å¼Þ»›øu¼`[)ºä¯ºµÏ¼´òEºnF>¼o°~»Ž£k;š¹†¼K»-¼»¢^<…X¥;(ÙʼV.,»”ŠÑ9bZy;''u;ð;ðºÙËŸÝ;o·S;è/à9ì#ʺ„5¿:6½º€²µ»h¬6»€ÔºìLD»¡ë;p*I<Ϫ9S59°MμU»;%[»œŸ;¡ZA;…΀:µG7;tÆ;ê±–;ʘƒ;‘Z <(f$;ˆJ“:†)Ð;cµ¼¹";£;í;Þ¯ø<:cf<.X´;æl69øŽ×¸©-ƼQ[>¼¤œ;šÔí<þ0”<<c<¿-#:gÓ<’\ƺ€ŸP;Åö”;!ç_;‰Ñü;ùèºç;ÃTü9ƒuÿ»“ÒC»5;t„·ð»v/–»Ã}»„(Ä»Öön¼&î»;Ò´£¼>oºÏƒð;èm<1í÷¼0"Â< ‚;p„ª».ɲz;®”<þ6ÿ™»‹þX»ùp;ÌMÛ;Ô|g¼¦Ó»Ç»Œ¢¸;¶ô­¼÷˜¼ ¹m<\¥_9¥Wk;E‰:ˆ9§;óh;U;‚z¡»êÀG¼žáä»Î•sºÙXó»$!¼9²»õ~;JBÑ<“yºBè;F¼ äÊ»£!ø<©Ù¼ýØ;å,¶¼ 9绫ÕG»g³E¦;ßÂÛ;¿ 6;ùýk9ñ©$;Ṏ:z<l0<‚¨Òº² —< cØŠŽ½|ຠγ½ÒÙQ¼Áyl=TAq=³É=w$9<‘¢&<™I¼-o¼å¼¸ ˆ=€Æ=ž†ÿ=¶Áú>=6> ß=Žxº=ÐWü=¸”Õ=Šà¼Øâľ5í½‹Å?¾->n½ ½N哽4Er½‘è="ÀË=IÊË=¶ÒÏ<´’?=F„=Z¶8= ê=‘0å=Eö= ] =˜«X=Š=8>=–§„½œÒ½ë༚É»§µ<é¼:¤¼=R@6½vñ<Ò-â:k¡¼‡ñ;àÆA¼$òŽ½%"};çÚܽ‡Ã;<›p»øôú½Ta¡½•Åu½%~̼Jyƒ<¦ h=§=¨ü‰=:H<ÇZ½Z¼wÀ=E“F;º¹ô¼b_ø=.A< ÝD¼ë‹½·¨<~¬]½ŒÇB;ε¨=[;p½C„=c|<•ç<Ö§;ãsª=6=Z½©5Y½,‹;lƾ<ƒæ¼óÊ;YoJ=Æ=ݬÈ=¤=Caš= nj>91=â %¾=ñçb=YwÜ= v=­†.=½¸Æ=h="Ç<€ª;=$H„¼tdT¼ÂÐ{½¡=â?¼Þ ¼‡ën½´ ½€é¼ò#ª¼Î'{¼-׳=M†ý¼Žm¼µÙ¼½3¦½:S#¼D[¼kéY:ç¤ :&½C†S»áœ=vî=׊>~;ê&μ=Œd=Xë¼'üs½&t°½U¬i8¤û|È=Œ<½=$ÃU=.Ô»=ÁÛ.=jÅ».Õ[¼ =WF½-½Ýe*½€’󾿻ܼ9¾Q½X?=@…=i…<µt¬=«Z=wè=bxìºýrg=Vä=S¥2¼ò€m;lž®=.e¼Â\à½JM½5}3<2S=Tõ<‰½Ÿák¼ÞÚ4=½^<ýÔj=G Œ=´÷D¼›u‡<öÛ½D=¼ú®Ü¼¦Y¼½P“ ½%Ð5;¿Éò<ñ,;=yÖ%<ì3=6ï|¹qY´<${¼À¼›½r‰§<F–<‚Ú=‚F¹é˜=9N“4<Õ&=vbÒ:Q*!<ƒôž=— ç<2 ‚»‘óK½ôÁ<~î–»Ù¹î¼+ß9<7É8<Ëw<ÎÊ/=Zw<’Á ;wÖ!=°ƒ=H:RYt=ypÏ=~hè½4&{=Áú/%<#ÇÐ;Áù=Ÿ˜ ¼Ëc;ÿ1²=ü>=+®7<­ŠÛ¼Ütû½˜­½{Êú¼›a¼ «q¼l‹²¼6Û=å,=Âÿ=­³¼mÀö½G½{½)g•=ºê“½"D3î½=,Ÿ¤<”b<†×k­=øañ=ª Û<„Þj<‚š—=š·¼­·Œ<ÏIœ<àó°ÿ=ni=TÿÝ<Ï\x<ê†_=ja/¼Ç/÷¼Št<»KCM¢>²|=Ö™=ÕV9ÜÛô»ÿ¯{=~Çi=O à=²½=•\û:†%<¤«è<çPã=ºÒŒ½D½pb=f÷Ú=ÚÃâ=+3=>¥=;¶¼<=GÐ<ëX½kN½Š‡Ê<ð‹½ Äv½öìû½–+½9¨¼®e¼;êi=zY@»þˆ½å·%½³¡$½— w½e#ç½»Ü7½ãœñ¼ô®}½ªaà<”ò=>椽_ðù=@bà> t‰=ýî@<þÛ¥=E”Ú=†5½8€¼(=!ïÂ:$`·= À€<£ïÒ<øÞí½[Ç_h=:æ4=–·=ÛO»ÂÜ<èLé=2"4½)›<Âz=_t=/Þ‘=¤¬½J—X½%Õg¼<=¤g<è‡Ö<麱=Bn¼²'½+ãë;á°š;-ÿë½MF7=T©U¼Æv½›Ó½—^´¼üǽ·4ë½f@½>>m½³òI=Õm½ž¾×¼^°B½x³½kè³½£Ð…½ŠÄ =Ãq¢<Ê…9ÖX=ïu´<¥žj<+€=z{ä<»âÉ=¨ì:ÝÀ¼h§=-ô=ôöB=Ö.Ç=h5ë=ùm©=HÛǼú:Üq¼VÕå=9Ñv=ŽÅõ<Û •=Ô†½ƒÍ= õ–¼}€*=’4ô»ïç=äÚi=,H½Œ= —>ó>­(<·R™=«Š=¼ o¼SõÜ=R¯ =ˆ‹Ú=ã¾T>ïμ…ëð»w{=¥¬=ŽÂÙ=%gý=”13=E1›9€Ïϼa¨¼|Š;;¿Þ;‰ Ï»«ü‡=%WÉ<⊠€6=x¹S:Þ´= °¯ ™Ô=6ð4=‹Cœ<._á;†¬_=F¥1½›”Ѽ\AG»¦•(<2¤c¼ÂZa½(÷ã=Uy=Guº¼»SὉè½…@=¹ =jq=4= Z=ñp=O¼ì6[½ZÐH:²/<—Q¤½éÓ½íàT¾~†=ò9øR}»\Å&=+šu<õ\X=5D=âNa¼*}¿=Mñ†;í[Þ=ŸÙ&<™€Æº'¥/<Áã<¥ý0=@ý=@§K=HÅ=—ã¯=GÌ”;¯”ù=‚gæ;±Õ¬½Ëø¾¤n½›(»òsó<`÷»ÕªÜ½eõ<`ؽŒCL½¹X=WÝq=¢õ¼ÊJ=Åœ‚=‡jt=ãþ ;M3e=õœ=Øl¼ç#<®¹;Ô÷Õ¼øš¸=_DL<wi=™HI=¥ò[=È=u=•븚<µ½@¶B¾ò0½ëŠ¾=+͆=³Z}<„ز<&½H"½ÚåM;\±Ò¼Žä=ˆs»ŽKÿ=8¦]»sz=r=z¢½­rk½HÎQ=e=>jã=Uv>-#G<› é=B¼œc?½i ½v)ÿ¼Äx;=–«å<•‡Õ=a¨)=`.1=»£?¼×ÿ;—{ä¼cvA½§T…¼9<2¼ì#½\øŠ¼šéÕ=¤ò†=å_=¥—c>ƒe=g½ö<€%½+‘õ=2)O¼ë6’=mXs=<šá=T¤‰=’}=V[Ì<ËÛ =21¼½žƒk½¯a¤¼©y=QÇx=ì=§³á=„­d=SU=`·r=#€=H®â=b¯L<¶Êã<Ñÿ=À‰n=R¥+¼2„È;ÿM<*=ê¸ã=»â=¬ã 9K7–<ûK=o–Ž=•¡˜=ôõÀ=gòo<å<Ý õ=a <ÄÆÒ½co;½˜™h=ï#n;’Žâ;Q˜˜;™ƒ;¡Š;¤è[<A<4¡¼<->1l¼qj—»—~w¼Ì]»œžá;Áåa»]A¹´0œ»nk<œG<|„­¼/i<‹²:v"5˜<k§¼,Š»½Hk»€uù¼Ñœ;·å ;Ï?ý<.Û\< à :È ¶»Á~ܼËÖ»‹#»Ç ¯»ëûÒ»™\éº X£»Ø\d»Ï Z:v×þ<廲,ºmÄfºA+»Žáºãþv» éD»»“»¤©»¦²‚¼’¦`:b伯»ÍÆ€¼ÌE;»Ýq湡J2:ë$«¹ÅöŸ¼ê‘¼dõ¼«L¼>Ø»¥î;Yº¯!‘»†Èð;ý<­;ès<ÍLPp;•Ê¤: ×<ŒÑL»pQ ;!7;á++;&38;Ú:é<'š³<†ñp;»˜»–ì< úÈ;÷t#¼\»Žêæ<ñÌ;üU“¼Ø«ºœ³û»™þU;Ï´{:¯|È»À*å;Š-T: I::”¼Xª¼ .:µP»`š;æcæ»Ýö2»˜G)»4M!»µ@ؼ]5¹‘½ïº¬œ¼¼BƼ¬Í>¼š»ÛĽ¼rż1:»4{J;ób»¿ïÎ;Ëài:%««»ó~c»Y)ñ»ý¢x¸J¡½<m»eÒ>¼(¿»§:j»“À¸¼a¢ºâBĺ®é»ÀE­8ºú,;›n§;æï;Ã7»;ðÁ;¿ø#;qo ¼|ëp;¿Òl:vU »jª,<;4C»ó¢;„¹.å»< ´2;=`¹–#™;¨íŒ¼Ï;ˆÐÒ±;jœ;„¸6‘ <‚̼*n;Âù=»–pU;f><%¹õ:ùgå,D;ši»%K…:±Xs; ÌöŽ<û;©,\»Ìs<fZº‘?T»Œ+Ç»ÎÚ¼»ÚU©»ºò:¸7E»™áV»¬w+¼v¨;çƒ[ºE;‰º>‘<VŽ<°d»Ú0<Êž:Þ)<&غS»C£Œ:Ί»ÞÎ;‘·Ù¼‘h:Ïi»~F»¤Pô¼vÎ’¼_a]»‰¼;æf±¼¯s;?F:ýÙË;ô5;…‘¯»{qh<.Uy¼œ/3;¨•½;`×’º×÷Õ:pìH:[Ü»¨ ñ;1û·»îŒ^ººø <(ÑQ<|@o»"˜¾<]3;¼«»^«;Ø/D<’P¼µ;K˜;;­n»V-!;/ù<ŸX»;í·ù9»<8Ú<~;¬©á<g(º…‡÷;i;æ_#¼ –:¨ý<ÙÙ;â:";écò<¤™<:Xþ;[By;&R;ºkê-»*;ÕBe<&8»*j;aªº¬ã»¼úè;Ê\|â:¯ 4<%ŽÄ;ŸiX9§°V;,‰9ËÁé¼k·;ÄŸ‹<{,;¸þÂ;«¥<?T®»P†ê»¹ó»ü É»®Z_;-æ{»ÿ÷;¨¶v;¾Jñ<(Ê<ÈÎ;.»³›]¼!~h;Ñ"aº«Ðú¼>z´»êk»ÑáÚ¼NµÔºŠwû;þéë;‘¶ºd6£;Ú ;ÄÆ<;(Ì;Jvû¼:¿<ž;?²¼7Z[¹ÀÙ¥»[oZ:·ƒh¼zÐü‘Ý9}+8G<<½;ˆÏ·¼)¯@;†Û¢;¼]‡»×9a»‚>̼°¼3zm»«ì¸»Š|;.š;èm|;Š›"ºè‡x¼4HN¼ÃŒß¸ßo¹½Sº ±;$ä<•ºwÉœºÎ­¹:›>8,šË¼(„÷;öì|:Ça㹚+ü;ùB¢;ŸÐŸ<]ºÖ¼ Pö»ÊŠ5¼LY7»©69Áv‘8àøš8ǧ¥;:Úº<6x[;µŸï:÷ân¹¦7f;<•x;òqt;µÚe;=–~»Ük#»ë¯Û»¥Ê;û<(²µ:1\Ø»Bã±»óØc;ß-c 1 pixel data (EXPLICIT) COMMENT GRAIN>1 : 1 pixel index -> data of GRAIN consecutive pixels (EXPLICIT) COMMENT POLAR = T / Polarisation included (True/False) DERIV = 0 / Derivative included (0, 1 or 2) COMMENT TTYPE1 = 'TEMPERATURE' / Temperature map TFORM1 = '1024E ' / data format of field: 4-byte REAL TUNIT1 = 'unknown ' / map unit COMMENT TTYPE2 = 'Q-POLARISATION' / Q Polarisation map TFORM2 = '1024E ' / data format of field: 4-byte REAL TUNIT2 = 'unknown ' / map unit COMMENT TTYPE3 = 'U-POLARISATION' / U Polarisation map TFORM3 = '1024E ' / data format of field: 4-byte REAL TUNIT3 = 'unknown ' / map unit COMMENT COMMENT COMMENT ************************* Input data ************************* COMMENT Input Map in wmap_band_iqumap_r9_7yr_W_v4_udgraded32.fits COMMENT *************************************************************** COMMENT END <¶¢T<Û1F<ΆÒ<ªÿ<³‰<Æ9}<îxŸ= ·!=AK<͹<¤º <¢?<¸Œ<<ƈF<Õ"<ÿÀ“= ª=/öK=" ù=;a<ËáÁ< ¥<•41<£ÿ›<¾l™<Ëéÿ<ÑøÂ<ÞŠ­=fÂ=-Yc=Nk,=V!ò=C'Ù=#nÉ=fj<É=<—®¯<…eÉ:;½z;ý‹<:ûH<ˆ;³<¸8<ãõÎ=d="€W=&¨¢=$Áâ=3 =Ô¼=eÅ<ÔË<<¤ÕÏ<• #<¯2H<ëÃŽ=¤¿=M¶©=væP=ŠZq=“DM=–áê=”åè= ‘=Ge=kÌ:=]G=U€F=Krœ=9¶="vÕ=’<<Ïþa<Œ§9<&8Ù;»’Ž;‹×Ó;¢ËX;ÛK˜<÷DÌ=>ÓÞ=?,¶=<ñÑ=7Ã=)×H=Ì<Ó‹<˜ìø<†÷‚<¡yè<ÝÌ‘=^™=BYh=fð$=ož=†WB=‰mR=‰¸ =† ={3Ú=d‡-=PüY=G÷ú=G¡ê=E =6íÃ=1ý=y<Ä~<…=¨<è®;‰ÿ¨:áàÙ:ïü˜;n0Ä;ºDþ;úAEtÅ<”½Ü<ÙÏ=l&=,›_=@Ò¿=Y=Y¨c=X";=ZÛ]=bËô=fßÁ=Z±“=9"=E¸<¯Û6<^²î<9x-sž¼b½Î¼rh¼yý*¼w«¼WóŽ¼ò»»Œ‘Ú¹Á/Û; —w;–Ö<XË<€5d<Ê28= üf=3ªm=Nþ;=\¤<=\¢Å=P =Cºø=Aež=N¡;=c¬š=nÔ¿=c6‹=@åï=¿<½+kǺø :ýyý;Ò ƒ‚Ê=§d<è´<¡£Y<ÁKµ<¨<|)<&Ö;³R9p»åKD¼v°ß¼±±˜¼Ë©¼ÇÿǼ´˜¼£z!¼¢ &¼µ\μֻ9¼õGY½@¼ïñ¼Ä¼‚«Í»Ïsô;p(݃Z=(fž=Ép= o¹=Èä=!6ª=5{,==Å==/ù€=%ä<ÖÒ*<™ªú²½6÷;½.»¦½†¼²$ø»¤#Ž?¼´¦¼¹ˆ¼T¼¾¼œ6X¼Þ£ ½Œ(½3»q½G¸½H(½/S£¼÷U ¼J?¹;öN”<Òcí="QÉ=G Â=Z=abô=cWÊ=dEv=d´$=`Ä‹=Sñ==—ª=ª= è=ÕG= Ò˜= {ª= V–= ö= èž=Ü*<ЬÄ<‚ê*;Çü®º 1ºÿp:óce< e£8Ìù#;ýMC<’©ò<æžg=Ðö=&—=#J= Ý|<ᤠ<¿á<»Uä<¸¿v<œƒÎ;ÐøO;„‚ºžâ»ÐK¼5¦¼N̵¼1'»øH »³»ÇÀ=¼#1<Š|;á§Ô;â);öÿ=;àjÒ;‚ÍߺWñ»Ï+›¼'Øþ¼.ì¼»÷º³˜ºî)’»¼ÞM¼P¢»¼±‰E½ón½'›…½E½ê½SÁ½K“‡½)z,¼ÛZ»õ/ûºÑG·ºd2¹ðD9ÐfZ:ä÷í:Ÿ|»µÚ»¨Jz»?e»;F(A;¼õA:ô†“ºÃ«¦º:¤:‚>9!À:¹Dƒº:(—Â:Ïl:JÓ'ºý1™»—ŽÙ»¦Õ³» ^;y;Ë …;¬ûj:‹Û±ºÀÒcºLˆT:f´ï:ŸBô9@úwºH¹¹o3ý:]™:¶gh9éÝàºäü–»…jD»­ »»˜€» Uè;»{;ÂËx;ä…µ;ŒÚA9ýjôº±æPºe•7:QÑD:ÿái:À-c8­·ãºdy3º]d„8lz:‹/:#¦8ñ§AºéÇÀ»w±•»¨O0»­¬$»ˆÙ³ºêƒ :çuj;µ¶u;ùÒ+;×üÛ;YŸÜ9'‡ºŠ,¶ºYóU:²\; qu;$à :¿r«¸µŸFº’l…º¨ì"º*è: :žÁÆ:su¹œM²»3»v$¥»¦ó¾»·sÔ»§Ë»t·£ºÁÉ¢:Ühs;ª*;þò<¤Ÿ;¼j@;)¢F8å,¹º•4ºtG9¶—ª:õ‹k;Btœ;3žŸ:­¨¹–?Ùº®SºÔ#:ºîL7Z:{q½:›ìÿ:ØZº\4$»P»s5»ªºå»Á-T»»ô»ž×»Y\Óº’’á:çƒÄ;¢ç6;û5<«|;÷J; ßj;Ƥ9˶V8ºþ2¹V—&9žð:Ì4³;>®Ý;cщ;4Ë:‘Ã-ºgåºÆ<.ºóéݺÀ’1¹îÂÝ:!¹:š{¯:w ü¸žÙkºÇy=»Cï»iZ»²Ó»Ëÿ»Î±£»¹g©»“—´»<[º/1\;m ;¡ w;ö¢Â<ö¿<û#;ß(;Ž­‘;T²:sÕ :IÊ9yr¬9Æ{¿:«¾{;+8´;lêŒ;q‹©;*o˜:c×»º5ç´ºÚG"»ŒºæÓ7ºeôo9_ˆ”:€Ü:“’Ø9ÿÆ ºT`‚»1Ï»pÒª»Þž»¾Êt»Ø( »à e»ÐÔÏ»±1¤»†ñp»Uw¸ëÇÕ;)Â;£•Ê;òÃñ<`†<Ü<?¾;ÉD4;‰æo;3N¦:Õ½T:¶]v:' •:$:–öÚ;Þ;^ûS;‚€V;nÕ;y:"»ºe¢9ºêÇ<» kï»ú­º¥¨¹‡ ":P§:ˆÀ­:`•¼¸ã…ýºÖ#‹»Q 껑}{»±ï‘»Î¨Û»æÓÖ»ñœ¸»æX6»É@ »¤²E»omEºé·:HQ;<>à;§ç;<D < `™<bR;ô—š;¼³Z;’& ;^5);úŽ:ö,+:s’ :ä®:†‚Ä;$ô;LÓ¦;}u(;„„a;`A;XB9Ë×_º†¯º÷m`»‘» šºÏ•1ºJH8Tâ“:-T:jüÝ9øåfºF‘e»!I×»„‘D»«(W»ÈTG»â p»ø屮¿²»ýH÷»àeû»»È_»–»Mƒº•ä:–œÖ;X81;ªâB;èmŒ<µ>·¹€1Ã9Äæ\9ÍY_ºH‡»÷ñ»„¬5»¸Cô»ß§ ¼›ã¼Þ&¼=Ù¼$}²¼&’°¼¹o¼ oå»ëŽš»Â—ü»\»dêºòYe8­çº;?:;pÓ;Ÿ›Î;Ä9v;ðíö<†YºÞÎ<» Ť»ÄÓ» 6á» »­È» ƺä≺‰@ã¹Gc¨9Ùwü9Ÿ’èº8HÛ»÷q»‡ »¸Çc»áŇ¼÷f¼õ€¼$(µ¼- ˆ¼0o˜¼,g.¼<¼ Ç„»êè"»Ã“3»šõ%»X×¾ºày­8^¦:÷ÿ_;e ë;™P;º)ò;àðq<ñ*<*< vô<i;ÿþE;à)á;Þ™;ïEû;ôjô;ÛË;;¬@\;r)¢; ì™:Ô¦:ˆÖÃ:kçý:ºë©;&_«;tü;’\ž;”ø*;‰õ;v€X;X2Ò;3O ;7: C9 ¶+ºF›¨ºÉì&»•»ÿ°»ÚŸ»Ú»0Ú»$é»×»ºëÒ„ºxž¸ˆWv9ÞŸå9,òYºg[»N“»ƒÅ»²o»Ü¼<¼.¼(»ú¼2¼™¼6äy¼5•°¼-‡•¼¯¼ ßÜ»ðLÏ»Æù¤»˜òi»PºÏºàÓì¹|:Ñfê;UÑ·;•)Ì;µÔñ;טq;þE <Fé<p“<–Y<%X;ë1$;ÞÄ¡;ëû;ýŒj;ú-;Ùpi;§›;l¬;+Êì;:ÎC¾:´ :ÛQ;'Ѷ;s ã;– Ï;žxq;•m‘;… “;i0Ì;H¹ß;"“:äæD:x¸+9É º/EʺºÝ»N»s¾»] »€#»"±»2f¿»3绺Þp~ºR6•·™RÜ9” ¸ò˜vº”s»!E_»zO¸»¦Ý»Ð}§»ýñ@¼D‘¼)rA¼5;h¼:Y¤¼:¸¬¼6µ ¼-Â3¼ Þ¼ñ€»ö³»Ç¯»”Ý›»I±ºé=ŹШÇ:§|ª;Gj¤;“çi;·®;Ö‘Q;õäÝ< ŒT<‰(<ú< ÙK;ø;åU6;éw”;û¦V<5;ùPý;Óoj;¡—\;iy];<g;#õÚ;UÊ;ø; ·à;3sü;r;.;•žN;¢’D;îØ;*;}D;^ è;<;~ :Åké:JB28Fº/¤;º¶-ƺÿœ»Ë+»&¿»ø•»$ »7!›»C³»:#O»Ú¦ºÐãdºJµq¹>nC¸É:]º½µºÄp»'Ï=»mﻚz¥»Â:»ð發A”¼&‚}¼4xi¼;Qž¼=?U¼;×*¼7Y¼/ ½¼"9ž¼Ô2»õ÷ü»Â‘,»¬3»@Þºí¢Fºû>:‡ªX;=/s;•&;¾+Y;ÜÃË;õ­=<«é< G˜< ‡·< “'<YP;;ìž;øƒ<_Ä<ê";óµg;Ì­ç;Ê_;l Ê;NM:;Dß×;@ ù;6s#;4‡‚;Jåè;x&u;“É};¡/; ò;”¿Ž;†÷};t,Œ;X‡;3?T;j:¦¤:Ž§¸²c‘ºC‹Zº¹ÉŠ»L¤»xM»‹v»«Á»$#;»7uz»K†»PNõ»>¸ó»$ºÕü|º|Ö7º—Hº:Uÿº£QÝ»³Î»5g-»gºÕ»]û»´ñ<»ãä¼ Á3¼ þ¼0Â˼9ñ.¼>¼>઼=<Ÿ¼8Ôó¼0S¼!ÿ~¼§»ímì»·¨»ƒéþ»4Öˆºæ =º%,î:sÒ;8ø„;˜ ¶;Æâ%;ç5?;û»8<ú<Å<€< 0<©K;ø–;ó²”;øÓ<—H<Œ~<=;ì{;Ç/j;œC–;rKT;_w;bn;j(x;gæ«;bì£;lkI;„v;”0Ò;¶ñ;œ¥;“²·;‰K¥;%6;qŠë;V\‹;,Èá:òWk:ˆÔ&9³ºy¹‚ºÍºZöº½Mø»{»»ß»!„á» SÉ»$F´»6Œ »P§ö»bf§»`u»HÌO»#:ˆºóGºº²Ù’ºŸjغÁŽ—»ÕC»*Bå»KÒ»lNû»‹××»¬Ÿ »Øün¼ÿz¼Æ¼+Ö¼6@H¼=@å¼@¨¦¼AOr¼?lâ¼9Œ|¼.¯¼"¼³E»ÝðÖ»©˜É»rò€»&ü ºÓ3:º mb:~X_;;’V;œ¯;Ïê“;ò¥]<Y-<P<çl;û ò;ùWÈ;ú ;úÕö;úQ|;ü|<A¦<x<cº;ùW0;äàV;Ãùé;œ¶t;z ;mŒ};y;†_;‰‚(;ˆ —;‰l&;¡;˜û”;œ=.;—ñd;Žlç;…4p;€‰c;}S%;qÐT;TcJ;%ŸS:Úªß:X—K9-›¹ÁDƺ^к¶Q9ºþ»N »%jÔ»$M%»%¨ »6h»T^#»pæÒ»}rc»t.]»X§l»3’7»õÛºô¸zºømz»{ »7»U°˜»k»~8@»I:»¬t?»ÖE&¼"™¼I¼%+³¼0Ù¼:/‚¼@¡o¼CîH¼DIs¼@â¼6ãæ¼'?¹¼ŽÛ»úþö»ËÉQ»œ)•»aཻj[º¾(¹ÆIæ:’¯S;E ï;¢Ž¦;Ø€8;ü—<«à<þä;þég;ñ7Ò;ìdk;ðá0;øFå;ýR”;ÿ[;ÿœý;þqU;ûÏ;÷ÎÏ;ðô;àoË;Ão;žæq;(;{­;…I ;’°;™^Ü;šlá;›J`;žÞ²;¡‘=;žÙM;•ð«;‰¢K;}ŠÜ9Xýÿ¹\ä]9ap¸ù’5ºÒ=j:ëü: V绦m»9¾(;~"©;€D»RÔºì´a9¢5¬9³Ïì:2r‘¹l©»0ê(»]Ž9¤ºÐ;©Ò;µ q7ÍÏ,»| ™ºëø¼9†£¸_«gº)Îz¸¿Ô9—{ƒºb£»;hÛ»dÇ?º¾Ø;¶};ÀVD;Ò,š;1D»6P»„¥ºíý59‚H?9ú˺…KºÉeºWÁ‚8R‘ ¸n½Òº»‚Ù»IߺUåé:ø†§;”i;ׄé;îE;¹·®:íòõ».á»’’ »€ˆž»z¹½º9õ,¹²ºãF»@ø¥»@¾¾»WFº[öò7k.é¸ÅôºM5»2+à»}¿Å»‡ÚO»_:,ºá,ž:!9<;G%¸;©ðŒ;àdJ;õñÔ;Ó;^j¼º'€»s4ä»–øg»s\ƻޤºmûë7ò¹l¸98º¡”»:<í»uÊÇ»gƨ»*pº²D©¹ŒÙí8sã%º$.c»ÚQ»b/»å»”Z»|˜ï»û§¹Áˆ0:û.x;ƒJÿ;½ìä;êÏå;ýI;ä_;;–1y:ƒ+ˆ»A_»‹GX»Ž¸º»bt¬»4ͺÆ)º$±€¹¨FhºDì»i¸»{òú»’u»‡†»Q>&»m2º@W–¸#¬Â¹šñɺ³€š»:µ½»‰`»¡~±»¡-»‹s»BCsº’+¤:Š›;Lsn; a·;Òšq;÷˜<‘;ñ;²ÍÅ;mRºz”»Y7Ù»‡Á[»~zù»Rvƒ»0É» á*º±å>ºd.ºw»üš»e–»š|л§ìÊ»šŽØ»{ºs»0²ãº·úc¹Ú_¹{ü+ºpµL»7ú»s–ž»¡Ú„»³o»­ÔJ»•â»[ˆËºÔx9õ³›;$kñ;Šƒè;»æì;çôl<èZ<¯;úÌî;Ç„L;cÈ9¾Ü»„l»aç»m}»[÷»G’{»E%»1»á>ºÃÏnº¿ìŠ»ƒ»NìX»’ »²[y»»?=»­Þ¯»“Ël»d-Ù»µºŽY ºâNºAÞvºØÍ»HÒ »–çæ»»¾»Æ8þ»»9 » K9»nè"ºþƒ¸9w3;«;}{/;ªiÂ;Õ ;üŸ< ‹Ž< Yt<ñ4;Ö:¿;Œ¾:½<»º—Uø»-`u»DÀ4»?è»?E»DÖ»\Wƒ»TWv»/`S»Âïº÷b»ü»HNŒ»†¡p»«4b»Å„w»Ì"㻨•¿»‹>˜»N¥Ó»qº’—IºlŽLº°Äµ»>Ÿ»ä¤»´ô7»ÔÜ%»Ùðê»ÉõX»«ç»&M»/à¸lã1; *P;|};£t*;Ä(‰;éÀS<æB<BV< …Ç<èï;ßÿ+; f3;ÿ¹¢*É»l»OÚ»?¹»K».¡p»K&†»sy>»r¨»O©þ»"™¿»k8»# »N º»,лŸ/»½È…»Ô»Úz»Ïg»º„Y»¡-«»ƒ0:»@› »Kõº¶=躵]e»¾—»Sù» x–»Ò¿›»í¶£»í8–»Ù¬»¹j»»U»%Õ¹›üe;w;ƒ§;¨> ;½K¸;Ö‰‹;÷Õm< J<õ°< Œ6<ÿ;å\G;®8Ê;@ø…9ÄÅ8ºÆ˜Ó» àÛºê#qºÆ;Vºõè{»,#`»XÊó»ƒQ¢»ƒG¼Ÿ»ñÌF»Ô鶻«V¿»dtõº©Ã:£PÏ;s9P;²¯7;ʦ;Í¿Å;ÔUž;æG;üó¨<Mù< *s<²û;þh;å‹$;¼"ò;{!T:Ãeº6̺þr.ºòè̺}‚ç¹À{-ºB2…ºôŠ»G!.»zŸ»‹4»…Óý»f Ý»-Võºû*rºï‘»#ƒ³»eYã»1ö»œŽŸ»¨áQ»» œ»Ó2Ø»èß»ð«m»ë »Ü#?»Ê’E»¹£ó»§û_»’%ö»o9B»;Ãù»ô¶»¡…»>é`»…”»¸VG»é }¼ ¨¼¬¼ÔÏ»ôî}»Ý×Ì»¹O黃ç(» Ö9ñ™ ;B¢ÿ;¤ßN;ÉÂœ;ÒJÒ;Ѳé;Ø4P;æ ;ö„;<ý<– <^7;÷å6;âX¶;½Óç;†$Q:ÿýÙ¹]\κã0k»ðº¤îâ¹c·ö…ÞºXR‹» ú“»[k»ƒ÷^»Š‹/»€ÂA»Y» +îºÕŠÞº¯ˆ–ºñm»<ëô»"¤»“2n»œ`»¦Æ‚»º7«»ÓëX»é»ó»óNK»ï•Ù»ã2»ÔĻŪ໷€¦»¦-#»Ž•-»e ð»6ÍT»"xJ»1D·»dME»š™¯»È×#»ï>˜¼x¼ »ûлð8ò»àîö»Ã3w»’ât»(Û¦¹Å p;yW;ˆ¹´;ºjô;ÏÐË;Ò•õ;Ó€ó;Ú{0;ä4 ;íºÙ;÷dÂ;þ=;ü…<;ñú€;Þ>|;¼ô];ŠÕ#;§`9šfº±˜»£ÃºÔàºiÐ9+¡©¸Y¦º—»(»oÛŸ»‰!1»‰Ùñ»wÄÌ»MBû»}-º¿}>ºƒù º¦ »0¯»WRÁ»…GﻜŽ»–½#»£$绹ß»ÕA\»ëC>»õCã»ó&ã»é4—»Ü¼»Ðæ\»ÅqF»·¥6»£’终a»W)»1o³»,Á»J”»ƒ“»©ü»»Ïâk»é¨»òiT»îÅ{»è…Ô»å~»Þ`¼»ÈÓ»„ˆ»IŸCº’¿x:³';J&H;Ë—;Àà“;έ¥;ÑÃý;ÕoK;Û®c;à¾ø;åv;í;ô¿3;õ”;ì¦8;Ù»X;º!];‹ÎM;&‘:>…gºdVºñrºïà[º„¹æ¸¶@ç9^¾(¹Îg/º×‚ˆ»Dš»ý»Ž»‹¸»uF*»J»`qºÆŽ*º~ µº‚cCºÛ/λ0‹H»j#»„0󻊻‘óÓ»£Ev»½hD»Ù-k»î 8»÷b{»õð˜»íÇÚ»ãËĻڧŻÑËù»ÇØ»¶¯»JT»|È»FäM».Ÿ™»8þ»a »¸»±ü»ÍcG»Ú(»ÚMG»Ô¹á»Òá»×»Øu»ÉMÁ»¤|ý»bª|ºârŠ8Ï`c;Ü-;t©¯;¦ï€;ÁÇž;Í=ú;Ñä’;ÖÉ”;Ûrž;Ýjé;ß±¹;æ,!;íÝ–;ï˜;çc†;Ô±³;µÒû;‰¯¹;*’u:ƒι㠺Â-3ºï77º´`’º Ô7ê`]¸å9ºzRh»g¤»a£5»ŒRƒ»”)u»‘æ»}ƒ»»Ràz»$ìùºë™yº¡çaº¢éºÆŇ»gH»P“˜»s<÷»€–q»†lƒ»“Ìn»ªgˆ»Æ"¶»à9ö»òL?»ù‘»÷{4»ðæ»çî~»á@ë»Û<»Ó4û»Æ¼©»±Hô»’{i»d³²»8îz».”²»Dm»r¼w»—(‚»³ O»Äã»ÇŸ»Á}»¼´»À3»Êà"»ÒÇ6»É±Ì»ª˜¯»yôá».Tº5>u:zA];*³¨;†iÅ;¬KŠ;Ã&§;Í0J;Ѿr;Ö";Ùµ;ÛÊ;Ýh;ây™;è›S;éjñ;àÿž;Îao;°!;…`Ž;&¿u:Ž‚¹){Nº•Û1ºÜ‰ÖºÏ³åºŽ­¹È1¹uûHº5¥sºÓò»5È»}ß»—@]»œû»šñ¶»‡œ„»e™»;VÀ»ºÜ,º¿Ç>ºÝü9»ôÏ»FuÑ»iê»wëÒ»€7»Š¼Q»žŽA»¸=¶»ÒÀ4»é g»ö£»úž;»öÌk»ïUM»èQ¹»ãpg»ßq»Ú#»Ò »ÁÑ㻦´ð»… »Nï4».ß÷»/å »M(¬»}½ñ»šH­»¯è˜»¸ëÛ»¶廯!š»­)P»µ8»ÄÉý»Ðó”»Ì¢é»³W™»‹Ü~»>£ºÅDȸBsm:À!;Ds;Òi;²ž•;Æ c;Í)–;ÏÂ4;Óg;×»;Ú-Ð;ÝC;àËí;ã³;;áÔ«;Ø4d;Å­R;¨—";·;Áº:„'b¸á —º}ÛvºÌt[ºßñdº³‰0º\ä<ºÖvºJÕº¶|d»/[»V™F»Œó»¢p#»¦®Ñ»¥“»’vÍ»{È »SÉ»+!Þ» =¸ºõý»Á!»!¶õ»I…»j¥H»zT&»™t»†ÞÊ»—êB»¯ö)»É5ä»ß×î»ð¯1»øé÷»øŸŠ»òÓm»ëWÄ»åIf»áŠ›»ÞÛy»Ûü±»×;»Ìqì»·l»˜á»oÿº»=†ñ»'ò»1Ñ»Rôò»‚"»›9»¬TÒ»±3»­.»¨[ »ª"j»µž<»Çi-»Õv€»Ô»Á:¯» Ù•»u9#»"³­º•´<96s:æÿÛ;XÓ ;šb;ºYõ;Èä÷;Ë©8;Ë”0;Î9w;Ô¦;Ú,K;Þ-Ž;ߟa;Þ9D;ØRc;ÌaH;¹¯D;žm‹;p);H‰:\ªö¹zÅ𺅴ˆºÑrtº÷Œ ºæQº®' º€Û#º…å–º½2Œ»»9E[»s#L»—•V»¬ÉR»°ù»®Ç»›t­»†Í»cêT»;\ò»—I» cÌ»+ö»+kƒ»NÌF»oúË»zZ»‘TQ¼8—Ÿ¼[Ǽ+¼*»";u:.< âä<>ó<Z&¹× ‡¼–K¼€R×¼ˆ…“¼C/æ»'1<¡<…oµ<™ì²<ƒU„<.åê;²p:ºL²ºèâY»’]»¿yN»“JI9$;ò–<„ûŠ<ÕU\=)=2ã3==§ž=.n= º‘<߬—<Áäž<¸‡<¦ëŒ<ôH<%Ä;Ù Œ;À«;ÕÈ·;ßl;¸ÈÚ;)ž»8 »ì¤¼&]˜¼Û¹»©Ã²¹iNª;S+n;gI78 Ä»ßv ¼‚š ¼Öw%½—‚½6t<½I*s½G„½-»¼ú¿²¼g”;šû<»09=X/=Ewˆ=_”¯=j•=hp=\ªè=Mpã=AKÞ=:JÐ=3í§='éÕ=Ê{<ñÖH<Ýu³<ØGÇ<Ú ]<ÝV|<Ü~T<Ô›B<ÄÕ`<°cÓ<—^/Åóº…šA¼S¡ ¼Æ¯‚½«½ ¼öËÒ¼´”#¼L¢»8µÑ;Õ}¬Ä<öNÎ=\=%sø=WÒ<û¹¸<µ®‰€»Œ/¸¼jZ꼜в¼Š»,¼d9Ïfa<qi; %/:¾gØ;¨Û;­È<YŠ¼ȼ3gʼZ-~¼o ò¼Z¾Õ¼N»sÚ~;B…†<.¼Ë𔼽‡¼ž¥ô¼ƒŒ‘¼\µÌ¼8í¼0¸1¼t ¼Ç¼½ë½1d'½1‰n½Ï¼´í[»øîÕ;ç«:ÕY;Nª;ð0Èaà¼/›œ¼8·¼nê»å1¿»»y"»’qY»XÏv»œ¼º²Y¹s†:­8z;T€¦;ª^;à‚&<Ê< ©@<Èê;ÿE ;í—ˆ;åf-;é~°;óèÚ;ü¾À<V;þÃ";ùý ;óóÞ;ïÊ;î.;ë¤-;ßâ“;ůÇ;£)Í;‡Qß;…ï¤;ŒK—;˜÷z;¢ –;¥;§Ûô;ªÇ;ªý;¤¹¥;˜=";ˆîþ;vdÒ;fpÑ;eÁ>;nt;pÔ;a÷3;?Ní; A&:¦‰È9ñü¸’‰¹¢xºÙjºh~,ºÄy» ‚»(Ò»1ëÏ»3»ß»@*¹»]"»€é4»f»—ÊU»”îL»‰O¿»qE»N±7»5 »0?Ï»Bñ~»f¬6»†¦»”èZ»œ T» Äò»«¨p»Ãë»èW¼Ï ¼ûƼ ¼'ËŒ¼/á¼8âø¼A¼G‡¼ID‘¼Dß?¼8e¼$’̼7o»ö‰T»Ò.y»¯vP»?λX#»ãqºµKP¹ Þ…:È ;g©å;³÷{;çDÃ<ð6< oº<T±<{;ï‹0;æ.5;è¦|;ònæ;û‰k;þÔ´;ü)Ž;õ¤;íŽj;ç]à;楧;êÄ“;ìÕ‰;ãnÄ;ÊÃf;ª z;³§;j;’0+;›t;£{;¨BY;¬m…;°»;±‚­;« D;´¸;X;z’¯;c¶²;Z5;\u ;bjb;` ;NL;,°:ú·6:Œ  9¯$L¸”˹‰‡¹?™º[5º”¸”ºûæ»'ƒ§»< ¥»B–»MI»eSK»ƒZQ»’󻜦»»·¥»–=ß»ˆŸ9»oð©»P7?»<{ð»>iÅ»XÚ»€8»•ü »¥¶ »­´;»²N«»¼EO»ÒÏ&»õfI¼ N‹¼‰‰¼#õ¼'ð»¼,§ç¼3M„¼;Y1¼COu¼Iè¼I›¼@+v¼.C[¼Üd¼„w»áur»ÃXš»§ Æ»ŠŒñ»[»!FͺÁŸ%¹M^:ár;zŽŠ;¼G^;꾚<þ<"î<²_< “;õ@;î<;ïÓš;÷0W;ý†_;ýëj;ø_;ïùk;çN ;àÒ¸;à+z;æË»;ðX;;ô+½;ê†ã;ÒjX;³ÅÂ;š¬Æ;˜›%;–_Ê;šXç;Ÿg;£d ;¨Ò¯;¯*;²²;®Ò÷;£Ð);”tv;„–­;n«;](ª;Ukš;TXÄ;S#7;JØq;7ø·;:ÛÝ:jüõ9ƒöÿ··> 8M^ì9À‹¸Ég…ºG£ºÚï»$Y@»FƒX»Tmø»]ª»oý»…ª»»“R®»œ j»Ÿk»šg…»(ò»‚Gu»e…¯»J>”»= D»F1»fi»‰ñ»¡s»±Ë»º(4»¾g»Ç%7»Û»X»ü–Õ¼ËμÃμ(U³¼+ÆK¼-RU¼/à±¼5Ö¼<Ò¼DêÔ¼IƒÑ¼F#¾¼8mŒ¼"ÏX¼ cŽ»îÌC»Ð,@»·<»Ÿnu»†už»YfQ»$¸QºÈçê¸ÀWB:ö<æ;„ á;Àx;çíº;ü…r<ÿè< </Ì;üŒ;ú¾;ý{<A{<k<S;öX9;ê'#;àë;Ùç_;ÚZÏ;ãdT;ñôÏ;þ(<_;ô!ç;Û¶;¾„;¦ ¹;`;—°;–S5;—™j;šR`;ŸÉ5;§t;­µ¢;®y\;¨Lê;œÁ;Žâ<;º¥;nk';_cë;Ua;Lå;CÏ ;6îB;#é$;x«:¾¾»:EÍž9_ T8dùŒ9p”‚9Ñ 9[õ¥¹ñº¾­»!Eñ»P(%»eâ[»n<ò»y÷廇EØ»’`»š~ö»œq»˜wË»B±»…S%»pŽ »U z»?Åò»:î»J_³»ol·»0x¼EØ?¼Gî°¼@X÷¼.ªŠ¼0R¼BŠ»Ü¬»Á.z»ªý'»”ͦ»zr»Kí»̯ºº²81 à;š[;†Xè;¼^);Üy-;êyý;ïÃÝ;ôI;ú2<…À<ñY<÷Þ<Ôð<2€<îë;ø·ê;çq;Ùs’;Ñĵ;Òi4;ݯJ;ñ¶t<ûé<Ž@<YN;þÊi;ä¹ã;Ç‚;­°Ó;šá!;’ZK;×w;ºG;‘c;•ñB;c·;¥_Ë;ªo;ª!u;¤;™äƒ;Ž5ì;ƒŠy;u^Ñ;eËn;V«*;G‘Ó;8r®;(gP;ÇÓ:òÚÌ:¨®ñ:.æÐ9iè:9Ú“9¾:÷99¿ï9¹¢5¢º°ù»!qW»Yjš»tÈË»{&»i»†…Û»3•»—‚&»˜ô»”„ú»Œ,»ƒ"»pÓ=»X‡±»A<ƒ»2Ò?»5*è»L$»uWG»“ÎD»ªJ»¹$®»¾SX»¿4é»Ä'æ»Ôjª»òž¼ #=¼æ¼-g‚¼5°å¼7ts¼4|‰¼1 v¼1“ͼ7@м?XÔ¼E ¼Cx"¼8 ‰¼$!š¼ ˜â»íÓ<»Ë÷»²lc»œ»„ò»Z õ»-K3»9}º‹²·9®ç ;%o;ƒk8;°zw;È“I;ÑL–;Õ¤m;ÞË*;ïµ<9Á< u<‘¥<,)<5y<ƒD;þós;éÃ<;Öñ3;ÊÝ«;È`$;Ò¨D;êE <Ây<Óq<k<uB<8€;ê·K;É¿6;­YW;J;‡–Í;‡h†;‰‹;Œò;³;•c¡;l;¤¯G;©”;©y²;£îI;šª";p;‡{à;~^?;lÊH;Yq¡;E¹ª;2ïE; a; Q_:àÖ¤:IÝ:-ÉÖ9™²B9|ž9áÇŠ:9¶L¹²´;º¶ô’»'L8»c˜»»€~˜»¨K»~«å»‚6›»Š¦ »’Þ…»•s/»‘2ø»ˆ¾`»~|¸»jõ»U#Ú»=ñ~»+â»$ Ï».RM»Kw+»w›¦»”m˜»¨÷Š»´²»·Žb»·¥»¼Hà»ËÞù»è!缟ˆ¼궼*Š–¼6!¤¼;a¼9E8¼4.&¼0íg¼2ª§¼8‡¼>Ö­¼A/ª¼<¼.m¼[7¼P»ÞÜQ»½iý»¢_»‰\»_p»+ûïºýŒÅº§Üo¹ä6Ê:QñÕ;Z½;yÇ©;žôþ;¯¹J;µ<;º(;ÈG;á á<0è< Ú<%¼<d <8< º•<€);ï;Ùk ;ÈY#;¿¿Ð;Ä5Œ;Ù’ª;ü*ô<7Ò<ND<W§<ÝÊ<.e;êíq;Ã÷;£%8;y²s;q£;|g;…üí;‹âÆ;Oh;’]â;—¥¥;Ÿš´;§ÑÙ;¬»ê;«ýã;¥Òk;œÂ&;“¢Ú;‹j¸;ƒO;sÚ;]¢À;GÞ ;2Ù@;îª;•h:ÜHV:¡AÚ:H´F9ßkð9®ÉE9ßUÔ9ïsC928ƺ ^ºÎø×»2Œ$»nÏ8»…},»ƒê»ydS»uÄœ»‹¥»‹L@»ÁлŽ€&»†O»xDB»d/i»O/°»8z»" #» €»E—»& 7»H—É»v¢»‘õợ=À»«÷3»®LÌ»°(A»·°»ÈËv»ãþ¼O¼ÏF¼%¼2#²¼9ù¼;P¼7¢¼3!™¼1Ÿv¼3ð¬¼8/B¼;Nû¼:Ji¼34¼%wV¼ß~»ûä »Ó:»¯Ž»Šl»fFG»+7 ºæ [º„`R¹°'r9á†\:º3;'Ça;k‰Î;ŒŸD;—‰”;›üÈ;¢áè;µ_;Õš;ý Ë<ñ{<Iï<‰8<¬^< dË<Äc;ò?;Ý;Ê<8;»ÀÃ;·¢û;ĉv;ä`õ<Ø£<Ë<ƒñ<5È<ÜŠ<Ôó;ãÀÃ;¶*Ž;‘&;SåÛ;T›Ë;lõP;…^m;§;”Gµ;”ž&;–f–;œÇ;¦G©;®œÀ;±ü€;¯*h;§¹©;ž±_;–DR;ŽŒ3;†cÅ;yå;;d€';M§¬;6R¬;Cc; >ü:ç Ô:¶[‡:Et:IÌ9ÖN­9¸ŠP9舸ó_ºZ¹ºðµú»?°@»x¨Û»ˆì†»„ÞÛ»r³í»e;`»lÌ»€àG»‰¬F»Šìr»„9»tNÌ»^;»IV´»2¶»5(»›ºýL»¤œ»Ù»Dµ¿»q…ỌþV»šÖŽ»¡èŽ»¦;^»­dV»ºü»Ï·ô»ê/`¼»e¼: ¼³ë¼+“ļ4ƒi¼8ÎE¼8U¼5js¼3ö¼2¡#¼3Åe¼5X¼5æ¼2­¼*ñë¼ X¼b»ô~·»Ê0»¢@»{cð»5åúºãò¡ºGñk8º“}:RpA:¾TV; Ÿ¥;9Ëb;aÖ#;|i.;…9;ŠU2;”.±;ª!Æ;Ï!8;û¦5<”<rN<²$<5<p;ü±3;í}Å;Ý¥ë;̃­;»Ò~;°ž¼;²ÌŽ;Èš;ï½[< ¶¼<áx<„"<tw<÷”<+G;Õ‘î;£ºå;yÆG;:>`;C3n;fE0;‡äÁ;—_;œ6£;š9ò;˜eÈ;œ`²;¥ÞÌ;°=;¶¾;·‰;±©³;©; "«;˜Y;‘|Ö;Š{¦;‚ ;nâ/;U‹G;:­^;"(ü;þ$:þ·Ñ:Øæ:¤¨:SdÅ9î÷o9n ¨·"r ¹ä Qº•v·»5È»Ii•»|âù»‰]®»„ Í»l6ò»VðÒ»Wy©»jÌ»€€ »…wD»íq»pÝ£»Yå6»C§F».Nê»l|»ßlºäÎáºÛݺõ3Ä»F»AÍ»kWÍ»†ù»’Ly»™Ú»£ ‡»²Mn»Çõ4»ƒô(»‡y°»”I廪5‡»ÂŽ®»Ø0{»é?ª»ó½¦»ö ñ»ñÌ:»êÛ»ät½»à ¸»Ý{/»Û.…»ØÜï»Öº»Ï¼I»Áfø»©Y¼»Š“»XÙà»/­»!“+»0ŽÍ»V/ »„%"»›á»«$•»° ñ»®ç†»®„þ»´ Ç»ÁuÏ»ÓF»áJ„»â¹ »Ôì²»¼h»œí8»q»weº‹ˆb9É]=;ƒk;pd­;¦[l;ÁŒ;ÉéÌ;È";Ŷò;Èy;ÐÓ(;Ùÿù;ÞÃ;ÝÓ÷;Ø»;ÍZ{;½ïe;ªOÓ;‘"Æ;]A;¬Ä:*w8¹ù쥺¦›ºóc‚»ÙM»µ:ºü7˜ºÄVóº²SºÓ¶m» è».mê»Wtò»…?F» ÝÙ»´ºl»¸Ð»±T»žÕ»‰÷ù»h8 »=‰»zŸ» Ž´»ÁÈ»(‰µ»J§ö»n·»ƒ¦â»ˆŽ’»ŠŠŽ»’»¤rþ»»aœ»Ðbê»à¬y»ë¯š»ïÇ$»ì‹œ»å`5»ÞÛ‚»ÛGŒ»Ú3|»Ù‰é»×i»Ô<»ÐÚò»ÌY<»Ã»²^&»™¦l»x»AŽn»8æ»®)»-Ë»VŠ»…»œ¬ê»¬Á»µ&™»¹ÌÖ»¿7’»È|ͻ֛6»ç7N»ô*n»öæ¾»í™/»Ûk»Ã"»¤(»| û&fYº”ïÅ9î c;Ƽ;†…;±™Ô;Åø;È ®;Ÿ\;¾¹;Â?Ü;Ía;ØŠŽ;Ý©ú;ÚÞ};Ñ] ;Áè;®™;˜uŒ; ;FÌI:ð¨Æ9û—6º?`­ºÕèÞ»ÏÄ»7 »BÖ»24R»š ºðêsºô´»ýÈ».V»L&²»o( »Žy—»§Q»¸À»»´‚»¬gÆ»š(»… Û»]»»/òž» ¡Öºõ:±ºÿꦻ¾Ÿ»8}I»^•I»Ký»ˆü[»Œ„ÿ»‘w»ž?–»±àð»ÅÞ4»Õ—±»àƒø»æò»äŒ»ÜÛ »Ô3Œ»Ï¨•»Ðfv»Ô»ÖЧ»Õª3»ÐÑY»Êàƒ»Åý»½©Ø»²Ri» ¢¬»‡¦þ»V 8»%?» «î» hØ»%µº»S»„.»œ“r»¯x»½¾M»Éõ#»Õó»âé»ñ¦ ¼…€¼qZ¼ ,¼Ü»ûÍe»è… »Î½:»­à»…Q»2‡ºž:$ÎÙ;0<;“øÐ;¹mö;ÆLµ;ÃXÚ;»d*;·¥;»áž;ȤÁ;ÕBü;Úa;Övì;ÊXœ;¶¢';ž¦;…£å;^^B;,âÉ:Ô¶9¸cºs‹»ŸÕ»9”»c¢×»{'È»s‹{»O–<»'·>»W2»yä»0³õ»GÍP»`ÛÈ»€_Y»•»ªg«»·þó»¸5Z»ŸÜ¡»ŒGk»nÚ»Bg½»W£ºæe̺Ű-ºÏY̺ù—»ëλCþß»j›Ã»ƒo²»Š¶¢»f†»˜»§Æ»¸»ÇE»ÑÍž»Øš{»Úë»ÔE»É»À¸0»¾þy»Ä6»ÍoɻԦ˜»ÕÓW»Ð$g»Æ½;»½)ê»´LÕ»ªÜ£»ž/¼»Šó˜»aÖ»+k¬»“Ûºâînºôñ©»Õn»Kr»€êm»š†L»±g3»ÆÚ»Ûv‹»îU»ÿ+_¼ƒÄ¼Ö¼¯‘¼¼¼¯¼ iϼ®µ»òè?»ÖØ»²¿p»ŠË»:‡=º“Ü:ºY;NAº;ž¾ž;¼:—;„;¼!u;³w;¯‡ò;µõ;ú;Ð7É;ÔÈi;ÐI;Â>¨;«>ö;Žª—;f”Ð;:9¼;JÌ:·989‰AºˆÐ»¤»XH6»‡ÏÓ»špÉ»41»”¶»iÿ»A®9»3¾»7ú´»CÞ[»Tøù»l_¶»…¥ »˜`»©Þ»²«µ»®‹'»Jw»n"¢»CT»(¿ºç]º¬Ùº•i²º¢ŸìºÊ?„»»'#Û»P €»s˜ö»…Ng»‹ØÅ»’˜›»jÇ»«)‡»·º»Àø€»ÇÆ»Ì3€»Ë=ˆ»Â¼þ»¶v!»®D»¯HÓ»¸³ »Åûu»ÑzY»ÕÝ»ÐÅ »ÄÀ»¶ÝÁ»ª`À»Ÿ‘»”vº»…M:»^¶?»*?ºöZº»!…º¯K3ºÓ'{»›S»BD…»xл—A7»²|]»ÏSç»ì‘¼¼?¼ ¼Ûx¼Ÿn¼#\õ¼%:Þ¼"Xy¼…”¼3œ¼6λôõ¢»×ð»´2Þ»‹Ø¹»4ºR-«:½²#;h§;¤ã;ºw;¼ o;³á’;«#;©7«;±w;¾’ï;ɇ|;Ì©Ø;ÆéÐ;·¤y;ž“«;â;D]];Ñ8:êk«:–œ¶98‹º L»?4»t>r»•ã»´âX»×ü%»ûjW¼ ô[¼î¼"¬¼*íƼ0Ù½¼2¶¯¼/Šò¼'äð¼Tϼ‚?¼Iß»ðT%»ÒL»®Kö»ƒ#?»Ñò¹“¦ˆ:÷è;uÜ+;£ñ;´œÆ;´ã¬;¬¸;¥6¶;¤û<;­. ;¸Ói;Àï…;Á’C;¹Ø…;©o;6½;_Ϲ;$X­:ïE5:±F:_}8%º–²¸»%;j»{Y_»£>G»ÁJN»Ò·8»Ñ˜á»¾»£—f»Œ…ï»xìû»^q´»H¾»B}ƒ»O²»h‰»ƒ;黓F»Ÿe´»Ÿ´î»ù»Jì_» à'º·¹Þºb¸>º쿹ý“‹º&¹ºx¾Qº­N“ºß» r»,ˆ¯»Q³ »råx»…8µ»ŒÿE»“ñ»›ÆE»£‹»§‚¨»©·»«ù?»°w‡»´”Ï»²×n»© )»œÈÅ»–놻›kË»§²ú»·I»ÅYñ»Í¸×»ËÑQ»¿Q¡»¬Àç»™‰½»ˆf»r=»Tªâ»1ú½» õº¾ß‰ºweº*¹ìº'ûnºtœšºÄ5L»˜»H†ÿ»}•Ð»š˜Ž»»‚M»â#¼¤*¼_@¼"z¼- r¼5½™¼;Õ¼=©¼:ƒ8¼2”i¼'=£¼†¢¼Á¼hä»æ!@»Ãñ»œ^d»\EºÛuÙ9r©Ž; ºH;rhN;œÇ¥;­÷„;¯}ö;¨³û;¢s;¢”Í;©1;±‡€;µç¨;³S;¨XT;•Ä(;xt6;=\­;‡:°¯:hé9õ©¹Ymº¨´¦»,Q»ÉÇ»§ÕŽ»Æé»Ü/§»â—»Ø^~»ÃKÆ»¬û¡»™Ýz»†ƒ`»aß»@­»7ád»F™¦»^|»»yñÏ»Œ1Š»—r廕‘/»‚ðS»2„…ºÞn.º^a³¹ž° ¸Ø!¹g|rºýÛº…?\ºÀlºôR†»#g»-ò»LÏF»mLj»„Ž»}T»”ÿ»›(p»¡U»£Ó<»£»¡Yw»¢ˆ »§«»­ú»¬u»¢ÍK»—T©»’À³»˜6Y»¤ÿ»±Ž4»½”g»ÄàɻÀ“»¸»¥ÉÏ»‘s»|L»Y3»7SR»GºÝÒvº•Ìº8½¼¹è’N¹Ó°º"ù,º’ íºñ¤»03»h‡Ð»ŽÆ»¨6˜»Çíлî—¼ –w¼¥¼)7À¼4Zq¼=H~¼CWÁ¼EŽ'¼C-L¼< ¼1AX¼$ ‚¼«¼ *Ú»ø›»Ò²8»¨©î»zÃr»!òøº‡”½9øð«; +;]•;“W;¨á;­¼8vª¼AmʼG¡¶¼J¾¬¼J,—¼EFJ¼<ŒV<žZî<º*G<×ë<íf<öyž<îø"<ÖC"<®kó<€­<4<$<Ôì<Ã<wV<,šø<Òµ<<·rd<±h%<¾#N<Òd<ä"5<îÇC<ñ­<<æ[Ã<ÕQÈ<¸w<”z[;gÝS< ß¼µ(¼˜;%¼nØ’¼<¡Y¼2ŸU¼cÖß¼¢„ѼΥz¼Ó&š¼£YW¼%$’¸€$M;õiˆ<>z<4â<ñ<©ƒ)<©§<ŸÊ <¢Ç<¸}è<Û"<þ@ = ã«=´‰=ÌŠ=!Z<ÉîÓŽ»Òø»qË»,§|¹¸$N;ww³<æw<9%IMx=!d=?YÄ=9v=>Ï&=HU=Q“¹=^%k=qZ=„)3=‹¥4=Šx‘=€Ú¥=f•=MSr=:“Ë=,aÙ=åù=òþ<Å3Œ<…ij<)ê7;ã h;ÅÌr;÷§l<)`?=™Vx=ŒÌ“=xé$=W¯&=:™= ñ=›£<ÂÐ˼“­¼5?λ¨i%¸Ñýi;¿ŠÖ§¼‘ؼÜä¼%¨ù¼-z!¼2í^¼53Y¼5t¼4%¼3I¼2y÷¼1yÿ¼0#ö¼.1}¼+$¼%_x¼”ܼ Vë»ð~Š»Ãv »–„¯»W­…»&Zº[+¨9¦wî:¬‘J;Ÿ;%‡„;:«Q;M•7;^ïÈ;l"e;v{¶;‚;hº;¨¶Ë;ÐTË;þ®0<»ý<£¬<Õ–<´Ä;ú¾@;éñÌ;Þª@;Õ,";É×®;»»ñ;®%Ô;¨oH;²à¨;ÐMh;øŠ< ãÊ<VŒ<µü<uÎ< †;ò:ˆ;£;‘†k;YÎU;;‚…;9p²;XêÃ;„9¶;™U¤;£ƒ–;¢ Ø;œ~À;œ5;£ûÐ;¯ö;¹ð’;¾Æ;»‚ ;³Æ¸;©ó”; î;šß;•)à;;ˆw;v‰¬;VS;6Â%;Óæ;Òd; »u:ïÚ¢:®ª&:GÏÆ9˜ù*,¹íKº‡úðFã»4'º»i/¯»ƒœ€»ƒü»lñ’»P¸»EÍ»R%÷»jOû»|6ñ»}»nÆ»V¤Æ»> ») Ö»»#7ºáʺÆ÷%ºÉÄþºóŽ »yn»I;L»oˆR»…¾ª»–»œ®þ»°û0»Íô»ëÝ<¼¹3¼_¼è_¼¦ú¼!.¼&ô¼, ¼/€¼1M£¼2_£¼3 ì¼2ÌǼ1)U¼.tó¼+{_¼(ÛN¼&Gi¼!çK¼Û*¼ Eº»çºæ»¶]»ƒu»#;[º‚õA9ü‘$:ô2;>§i;a)ö;fhÂ;`÷;_a;cÐL;l:€;zÞ;‹;£†Î;Éìa;ùu<a<?<Ý<ãÊ;è\%;Ò¢ ;È,Ð;Ãÿ“;¿;¶Ë;«@Ì;£b£;§Ë–;½—U;à€£<fš< –Ü< ¶ < Þ…<Tk;ï³`;ÈžN;šÄÁ;gP;E=;Zm´;‚„;™<Ì;§t‘;¨“;¡ˆT;;¡åi;®.¸;»;Ãü;Ä=;¾Iö;´q;©H; ¯';œeY;šáó;—Ç;t;;x2—;O¨A;.®Ç;¬ö;h;ñP:ú:¤´,:rX7Û¶5¹Ï™}ºeSºÉ ¹»è‚»Ktî»nþ»vû+»g.f»LyC»:’»>]B»T2ã»k73»sæD»jž¼»UE·»<[Í»'„»`» °ºôò~ºÎ,¾º¶<ºÃ’ʺúÆ-»&’»OíN»rša»‡!â»–­¥»®˜P»Ð:Ù»õK¼ ˜±¼‰~¼¡¸¼ò ¼!ýA¼%Õ$¼))¼+˪¼,–¼-m ¼/B‰¼14O¼1£¥¼/ÙI¼,^¼(…2¼%Œo¼#E0¼K;¼;¼(»ß^û»ªÒ»býºÝ…¢8ýs :üù;b²…;>­;Ñ;‚ó;lA“;dk.;i¹;wÄc;‰E³; ›Ø;Å>;ô»U<„ñ< Þ<„<ÍG;ÜGæ;¾Ï;°/;®w;¯)þ;¬Ÿ±;¥–o;Ÿ@^;¡€};±Ôà;Ά!;í ¶<<Zµ;ûi,;ðŸO;ßì±;Ä9; *ç;{ÿ{;O®;[ú~;jId;…`à;™M;§ô×;«‚0;¥%;ú«;Ÿ5];ª&;¸°X;ĸ;É w;Æ°\;½È0;±SV;¦Ÿ; ò; G(;¢ þ»X~W»h!»f*”»U»=—‰»(7»Ò»ˆ» ºïªºÁy›ºª»/ºÁ‹»€»+´»Tˆ»xB9»^S»ª]±»Ð]»ú˜À¼Åè¼â1¼!Œ¼#rż%+h¼(™}¼,hF¼-έ¼+ñ¼)6¼(àð¼+•Š¼/¼0쫼/¼™¼+Õ˼&î¾¼#¼ Pþ¼FμF¼Õ»×}7»žp–»>žžº\’û:±;`Åp;Ÿ ;ªŒâ;™‚ ;‚+ÿ;jòy;iÃî;v±²;‡¥ ;œé^;¾è;;í<_<u<¬P<ƒ°<Î/;ܦˆ;´ss;žýf;š\î;fð;Ÿ §;œIØ;˜õŽ;œ2;ªE$;¬æ;Ý7Ë;îÖ;îa¿;Ⲍ;Ô¹ß;ƶ¿;³°Ç;š¤~;‚Kl;d›ó;|Ö•;‹iº;š„˜;¦½f;ªœ©;¥‹í;½1;›é9;¤+;²oó;¿ýe;È>8;ÉÅç;Ä*%;¸}ë;ªâN;¡{a; šÚ;¦(›;©5; (;ŠI;]Å,;1ŒA;vD;#ô6;( w;T—:ÌRG:@‘Ù8¬Ã ¹Ã'ºTfź±ñ<»Ç¬»"@L»4Ìy»6“‹»,»_š»y"»&œ|»A”F»Y&»^û”»SÅL»@ž»,k¦» &\»Ø.»ûxqºê´‰º³=vºŸ{Ǻ¾mi»ÙŠ»,HM»WŽÈ»ƒJI»¢8»ËYI»ú±¼dk¼ .{¼&{¼&ë ¼'š<¼+}÷¼1…¼4è¼2 h¼*˜­¼$U ¼#¥ê¼(Ö¼-Öh¼1Ž’¼0íú¼+æý¼% %¼©9¼…·¼Àú¼ ?»ÿ-5»Îm໑pµ»[n8ü…™;.É;œ¹;»÷’;±ôu;“À™;yy;m\Ø;wYî;†T;˜?Ì;µòÿ;á#ƒ< E²<³b<l<ƒ;êi4;º¦;œ’;§;Á};’†;‘N];Ç1;” ;¢LÈ;¹ä;Ñ6K;àõÔ;à~j;Ñ4ë;½*H;«Æ&;›^Ú;‰o¥;tR;fÄï;k{M;€Ò÷;Vý;›ì²;¤ñ&;§3­;¢SË;šâ_;—›¶;œâg;©eh;·A>;Á9—;Ňû;ÃÌ';»b;®xÄ;¢PX;ž85;¤Bâ;­c;¬wì;œ/;€cN;GÍ;#ç;Ýí;'Qá;$³˜;n:¤œb:~@·›J¹Þviºe»sº·Cºôq6» -»!j» ³½»ËÈ»–!» aØ»#¡²»Auà»Q‹ »N-S»?È»/ñI»%QL»$Á²»*Ÿ®»(gˆ»k0ºÝ>yº¢Nº”Z­º¸¢zºþo@»*èù»_sÔ»’H»¿ê-»ôY3¼ë¼",›¼(î6¼)R¼(Eó¼+಼4©ü¼<èã¼=+G¼3ŸC¼&c>¼Ÿ¼ž3¼%ŠW¼.e¼3Q¼2 ˆ¼*Œ¼!=ï¼ë"¼$á¼Ñí¼ Ô³»ôÇû»Áy{»€…ºÉ [:v¼;}ê‹;¹Ü;›º;§°h;ˆð_;wwÇ;|JS;‡&;”ÌŠ;¬lW;ÑÒß<Ón<~ó<om<X<¿;Î<;©>€;•¼Í;*Ä;Œ†,;ˆŸ ;…˜§;‰)0;–àO;¬ö;Ä“è;ÔÓf;Ö/é;Æìø;®>;–];‚¼V;cÊÈ;M9¦;M.#;cƒ;ŠØÜ;™A;¡E†;¢Ik;œ„Š;”Ë;‘(ƒ;”ád;ŸS†;¬+!;¶5g;»8·;»§Ð;·m“;­û ;¢&Ç;›Fq;ŸaÙ;«R>;²Æ ;ªÐ:;’ÿÈ;h'Å;4Ca;ºÂ; H ;(';ûë:æƒ$:ƒ£Ì9Í4͸9йëcZºl¤º­›`ºÑº|ºÜúùºØgcºÐ›‘ºÍÕº×ñ³ºÿ‘Ä»^ð»9”¡»@™â»8¢X»-—”»&LÞ»&ªû»/o[»6¤V»,Rˆ» ý_ºÇÜ¿º‘§·º‹!(º°ºóø·»+S"»s%⻫F»åc¼˼!p~¼*Oܼ*µ•¼(.+¼)Õó¼3üA*î¼Hc¸¼Aõ©¼0Ì?¼©b¼Ïâ¼ßY¼$¾|¼/q‰¼4¿-¼0íá¼&(J¼D¼j6¼aÿ¼•)¼‘»ä>]»®»2»S¼Bº!G;f;œ‡ñ;Áî;¶Ô;—µ ;„oV;ƒ£u;‹"‘;•%ü;¥Í7;Ã'œ;퇓< lv<ú½<§©< q*;è2+;ÁVJ;¨R¤;šÀH;‘*ª;†ÅÕ;|,Â;z¿;ˆ;œ_<;³¦ø;Åt;Ê¡T;¿…u;¦Ý;‰Ë.;`9Ï;7>;z;5Ø;>ý;l›Ø;t>¿;¦·;˜rj;šèD;•BR;Œ_ö;‡Á”;‹ ;”΢; ëÂ;ªn;®¦Ý;®©;¬,•;¦û0;ž¾;—ß-;™Ò(;¦HÛ;³Úr;µJ;¤\²;‡]t;QäS;(‚›;Wà;%„;%£`; yö:ÃÐ:XiV9§"ظÅ2ôºû›ºlË-º˜Ì º¢áºœCº”Ö>º•'º½%º·J;ºì»t>»'É »( >»!¡»X+» †û»)o»5Š»7~»#}6ºû©Ýº°Úܺ†O º„Nwº¤à ºêç»4Ï:»ŒEû»ËO¼4¼à(¼)Y7¼+·à¼(Œ=¼'H²¼.ïY¼?U6¼N‡*¼P3·¼Ad¼)ó¼(¼ÝÙ¼ž¼%Šø¼0ß¼3ت¼, ʼ¯c¼å¼ä¼ Rœ¼t»õhL»Í-»•ûÖ»@]9Ü-t;U/»;©û¡;·òë;£W‹;ŽnŠ;‹w;’1;š,[;¤™Ô;¹í;Û3O<²&<F³<Ê'<¶;ýõÐ;Úâ;ÀÈŒ;¯ Õ; zÑ;Ž«¦;zÈ;hîJ;q˜5;ˆ…U;´+;°J;ºa;µ¼P;¢K·;„¨í;KÙX;-Ë:è,:ÕΘ;—Á;<ü§;oš,;‡¥¥;Ž˜=;Œ> ;ƒP¢;x¼¦;|¤s;ˆ¢;•Ø;Ÿïø;£}Ò;¡‡š;Á¹;šNÈ;–S;’ha;”ñ;Ÿ×V;±=;ºªÿ;²âª;›O6;y¸ç;DA;'cè;$ºu;)Ã0;X:úÛÝ:£:+¥39DÐ}¹w¤º"ï=ºgÃ)ºzÜâºdyºFjþº@cð;Œ;uô*;PE;ª®;¦Æˆ;›Û§;’¹§;ŽÖ6;ŒÙ´;†0¢;mÉî;A;•;»:ÆY:]Õú98eº …º’ÚºËkð»馻6/Ø»xÙ»ŠÉ»¶Nã»ÆQ=»ÑÇ}»Úñ«»àßb»âÆ#»áà¿»ßMV»Øˆø»Ç‘3»©Š@»†Tè»Z¶½»Mþ{»XpÙ»`õÞ»a6ò»f3»wໄ>»ƒ†"»jL›»^U»/¸'ºíg8º‚üFºˆº1‚ ºž@áºòÁ»Ñk»40ö»DJp»O¡;»Zº»i÷,»~ã…»‹:.»•{㻜Œ »¡,h»¤<¹»£í »š”»’˜·»ˆ¶°»…Ôw»‹ÚJ»–ùÔ»žÂC»œnZ»’N‹»ŠP4»‹³»”I"»œ‘Ì»Ÿði»žìœ»›E»•Š»‹ëâ»t»`°»;I¤»¸zºÑ…ʺLû¹ã¥á¸³€¤¶/‚¹-@º\zºoÃÞº¿UV»>»Vd!»•Ú"»À_»ß>¹»ðX÷»útZ¼䨼f¼ð¼)$Š¼5\S¼?.k¼FÔ¼M˜Ù¼SÑF¼Wˆî¼V‘…¼Qc"¼Jr|¼BQ'¼5N²¼&»÷‰ï»¨r2»FQAºß8º¨šº¾ç ºÕjqºž"e8(£Ä:î7;fr;–dn; {¢;˜ST;Šôü;‚wä;$$;uØš;Z—ä;,¹:ïYu:ŒÒµ9ÎûÁ¹¢ñºŒËÚºêÈ÷»ã»84»`×|»8`»«BÖ»À¬t»Ë}Ò»Ñb&»×hØ»Ýܯ»âç®»åéM»ç@ø»å]»ÛÆ»Ãx»¢q»„­»pÓ–»v¦1»L¨»y–P»nì»oê·»|p›»‚iÊ»{‘ »U.©»,¶—ºõк¤¾º‘Õ€ºÃÓ?» ³‚».‚1»Dí»Oå»T}†»X=M»`a’»p »ƒ绎tW»–Öλ›u»ßq»žCš»™ã¼»v»ƒ¥»wPB»zÀr»‡Lû»’ò(»—s뻑A<»†µü»‚ »†Àú»ŽúW»“$‰»‘W‹»ŒŠ8»‡e“»‚ »vÏx»bá;»Eç9» ¾Úºí{º–9º >(¸»¯ 8ˆLí¸ÕŸºìkºðɺŮW» ¯¬»Cà/»‹#»¼6»é ¬¼i=¼¦h¼ °¦¼z~¼Ǽ$›.¼1E¼;Ñ9¼CÖ†¼K «¼SMÔ¼[jȼ_°Ü¼^PG¼Yi¼T+L¼L\ʼ;¬ÿ¼èr»äλ»Œ¹?».뺰RÚºÃí» OÔ»%ù„»Ÿéº}:¾—m;OdÚ;†\Ó;‰ï.;|éå;gµ;`g¬;]i;Iþ);±S:Íײ:Fg‹80V•º1ÿáºÄQ|»¶n»Hh»l »ˆ©å»¡ñ»½Àb»ÑZè»ØN »Ø¸¤»ÚŒ»àûæ!»ëÈ»í*r»ì†Ó»æ±V»Öû¶»¼^仟ϻŽ»Œï»y»Ä½»„Lû»zÌ»y8[»}ô»|.¶»nüþ»]*­»H ø»%‰ëºûÁ¸ºÏÔ2ºåLh»hË»9ÿ»PúÀ»XOi»U|j»P.c»O¥ã»Xÿ»kIõ»x¯»‹²Š»‘ŽÏ»“¦»“ÄD»û3»ˆÝ8»yµ«»eê »aKú»n4È»‚¥ï»‹¾f»‹‰ß»‚²7»sÄG»rÍ»~|¦»„³Ð»ƒó7»|ôf»q½M»jìÚ»f^&»^]»LÌ»/7}» 9µºÁZ›ºYœ ¹–nNµ]Ȥ¸“´Ã¹ï½VºƒÅbºËMG»Ò»/¯s»pß}»¨o»ÝúZ¼¼l¼ϲ¼%m¼çï¼ Ѽ"b^¼.ëh¼:$ò¼BeG¼HÚŒ¼P{U¼Z:…¼b–Ù¼e‘¼aø^¼]pP¼Y}ͼQRB¼<¯1¼»»Ól»x?£»æMºÖÎü»+»KF»_²», ‚ºpð:ŽÆå;,l;VC¾;PJ›;< ;6¯Ò;<9ñ;5>};®‹:´.’:»¹V†[ºnÉ7ºäb,»/ÍÁ»iQJ»‹J²»Ÿj»¶šß»Ñ¥A»æ t»ìo»èk¦»å£F»èØG»ïs»ô|Æ»õ@»òF»ì•Œ»âe–»Ðš€»¹»¥u»ã»ž•»œ$Ë»’Oü»‡Iû»‘»|³¿»uœæ»j³®»Dл3Õe»»'ºÿH »ò¨»:p»S=ª»Zõv»S–¨»EŒê»:è½»:õ­»GÉû»]äJ»uE컂ÕÈ»†R»†ú»ƒ¨8»{A‘»g9лSq.»J¬i»Qý»c/»vîÜ»õS»w‹-»e»[;»_á»jÄ®»m_,»cÝX»V»§»O&»N ‚»M? »Dꃻ1ÐN»0RºéÍKºžÙlº)À ¹€S¹"~¹Û½äºu\ƒºÆñQ» »! ð»L²Þ»‹½É»ÀŽy»÷T¼?)¼gš¼‹ö¼œÆ¼"& ¼-êB¼9ÔX¼BÊg¼H™½¼Nô¼V†¼_ª´¼eP6¼c¸ ¼^DZ¼Z¸¼XêB¼PÙz¼9Àú¼½ã»É™˜»vFØ» _W»SW»Q˜Ú»ƒÅ½»…²»Fìùº›ðk:5 °:õŒV; ÷æ;W…:ú®é; FÏ;L>:üù:•˜ 9Š8£¹ìú*»ºð#Ä»6*»w ì»—¢'»®ù†»Ç% »âÈR»ú`U¼ÌÒ»ÿ³»ø ¤»÷ÄO»ýPÿ¼4r¼Ó‘»ú§‘»ñ1)»çó»Ý±»Í¶U»¼뻯 L»©xe»¤¸»›[9»DÇ»ˆ`´»‚ˆ£»tÏ«»`»OVE»-mä»&kõ»Ak» ‡\»XÞ»Êè»2Z°»KJ¹»U‚»NÞ»:›»&±»Ê»!r…»2Æò»J_»^¤°»j$Ï»l»g˜È»]q›»M"Þ»;è–»3»6Ø-»D)¢»TÖð»a »aoS»V T»I<ç»Ful»M™K»S÷»MyÞ»?çÒ»4Ì»1¸|»2-».¯”»!æU»@lºôŸfºÃ_’ºˆï9º$Ð ¹ÕV¹þÈغ_jºµÓÖºû0»»Ê»5J»e¹^»œÒ »Ó È¼ž÷¼,x¼–M¼ î¼"• ¼-!¼9fò¼CŒ‹¼IÅk¼Ms0¼R5¼YŽË¼`%¼`3¼YP¸¼RñH¼RŽ‰¼TG£¼MR‰¼5Ò¿¼ŸÌ»Ê»¦¯»=»Œf»w׺æZÓºÐu̺ÀòSº¨ß0º…ÚpºNï*º=8ºd£Ùº¡Ÿzºá|j»~”»(å>»GÏ»“›»¬O»à›b¼ƼÕ¼ÚT¼!¿T¼+<¶¼7}¡¼BÁg¼JC¼MÓº¼Oá¼S–™¼Xz7¼YJ¼QļGm•¼C¦^¼Iù¼Nû½¼I‰“¼2ðL¼£»Ðá_»–øô»*»ˆbÄ»žÇ»©HË»•*»G1Ϻ®ê3¹’%˸ÏÖ¹~´¹7ß 9ŠÅí:²ò9eýnºÄNº±…ººì)é» »Ï»1ßv»i02»“ïÛ»²+»Ð×»ñ>¢¼þM¼ôK¼UG¼÷T¼!¼tƼâ>¼cš¼ *¼ÑÈ»ôdÙ»êÏõ»æÓ=»àÓH»ÓÕÀ»Â¤»°Æ»  1»“k»*X»‹Œ¬»†­»kg¢»=1j»îºé¿:ºÝ)ºëæ»t »ï^»&%w»8¬t»A3Æ»;*Ù»%¦ª»SºÚisºÂÏúÊ:nºæ§i»ÐO»Ý<» û€» ùT»=» adºøÒMºí)xºü”W»ªÐ»>0»(‚I»-~»»-R»(’ »"¢Ý» %»!S^» ì»ÔD» jº÷㹺æ$º՛º¸ﺓ‡Ûºcûº‹¢kºž)jº¢Ë4º™söºŽ¦?ºŒQ\º›"׺à ·ºÿe»”M»:¸i»_0„»»¸˜»c7V»‹âX»©8ˆ»Èéi»ì6¼¡À¼Ž¼ ï—¼ ­ï¼„€¼Á̼d‰¼¯þ¼'ê¼ ý̼Íè»ô¯8»ñõ»ï|g»æáB»Ô2»¼D=»¥ˆ»”Ri»‹A컊້QÖ»|¿X»Lœa»@庮½Éº³€ðºÔBî»'Q»A»5:Í»>ê»7;À»Êºúu–º·àº‘K¥º| º¡D£º¾ºÜm‹ºóýºø/xºè«VºÌµ˜º°ä‰º¥Sº¹(fºå!»jé» ß»û»À_»Ž»jõ»퀻 Rл´ë»±ëºë„/ºÈÚ¾º©P_ºŽϺTü¹ðBù¹n:¹³áº@ØѺ•oƺµY“º¿qkº¹wݺ­{šº°×ñº×b6» “*»1“ï»S»{7»š:^»À¸»éd¼Zf¼ ›¼ "¼,Èó¼9nؼCs»¼IUÏ<ŸÌ< ÿM:¾GºÐ|¸º«ûµ8Wœ´¸¬!Y» â[»`DºH™Ð;à.˼†Ñ¼À‘å¼Ó6¼Øq¡¼îÂê½ ~½U¸½ ZP¼Ó(c¼dr=º½rs<6t<½^Þ=Òß=(ø»=F‡0=^¤?=f¶‚=U=)2<Ù§-<J=U(i=]µò=W€°=E¤Ô=/g=Ã=i2=¹‘=½Û= °V<Æ\Ÿn;›ãf<<À2<Ôý =5Ü=nLT=}–•=pËc=gg=nÂk=€C£=‹v„=œD¢=µ¨=Òð=êݱ=öst=øTZ=ú¨Z=ú³ª=ü ¤=ù) =í§C=Üd6=Ìqâ=ó=Ãë=ÈS~=Ë°&=ÃGÍ=©¡ð=„&Ö=;]?<îÛ7<§< ¥;òú ;Þ{u;Ñì];ÆY“;²¹;•¢‘;q¶;PŒ¥;Mx•;^Èõ;y6‰;‰Uñ;ôù;w;~¾(;F,J;ª:¦]1:FÄA:*¦:Œ„±:ø$~;$º;GØD;_,;bÖs;S´`;Eú™;OáÖ;q”V;‹>;”1w;’2ý;‰éû;É;|ˆ;~ü;„‹a;¹ë;¤mP;¹ò;Âê;»Ð;§–ž;Ž.®;lò;L“¢;>”›;6ìt;#ÞÉ:þjÅ:£ø,:¹­8ᨹÉ­º;¶OºbV3ºP0ºÁ)¹¡Ä¹¸¹¹Oá¹–cª¹ÖÊ´º(‚ºi0º‚ý*ºˆ%Šº—T㺭.¦º½ùhºÌ2ºÙ1ºÚ¬ºÉñº²&4º£‹º™y‹º‰Kк|Šº­ð—»&ªû»”5ó»Ú¼O¾¼ÕÙ¼ vh¼!:¼ ­`¼%ä\¼6h¼MÀ{¼\צ¼X* ¼AÙ¸¼'˜¼Úf¼ 2¼¼)¼±¿¼'œ¼&-Ò¼xÙ¼ p»þŠ»ïÆ=»ãR »ÓEƒ»¼™à»u»c,ºÐ™†:?ü;¨;‘qõ;’m;›°C;©ÂÝ;²é‰;¸ëï;Åyx;ÜzL;÷°k<_Ë< „°<Ö¸;ñc¦;Ýá;Ò5Ð;̼ ;ÁU;§ïP;†Ð1;WÈð;?EÞ;?>š;L);_}#;qL;zx[;ow/;G9k; rx:¬èq:C’09ìòT: }ø:‰¡n:ëÚò:ܶv;Ы;:G÷;Os‹;K°;7ÃÔ;0Ø;;J4L;vX,;‹mT;Ž!‚;†âX;z µ;l¤E;kpH;wÃ;ˆCÞ;œ;Ú;³;\;Êh;ÄìÁ;¸á;¤;Ž¬ü;w%ø;\)í;JOú;58§;ë¨:Ë„:Zǯ9T‰e¹¨tmº;òhºv´ºz¥1ºD¹Æq@¸:¯8šm88‚|·4 ¸µZ¹eÚj¹Ÿ_¹­!_¹â,¹º#ɺIv²ºUȺ^ñíºlŠºr›áºxtIº‰53º«Zº¥ …º“¢gºçgºÛkлNo»¨"ä»ã{¼‡ò¼»¼й;’:£j:D7û8YÁNº q·ºxƒºœ>º¥IÞºŒÌTºM8‹ð¢: @:)Ä :9~:P Z:sãb:‘eÆ:*0:ŠŽi:N¢ö:-ëu:I`ç:se¹:}Åí:Yô9ö×)¸ü ºYžeº´ž¦ºÇ4ðº¼gÚºßVK».(D»„©»°ô>»Ô@h»ïjB¼ß;¼ ¶¼Ô¼Ó¿¼.kÛ¼BžÄ¼MvŸ¼HÑÁ¼9v­¼(d˜¼g¼»¼i˜¼e ¼0¼ ]»ô! »Ï«`»°Ÿ»›9»£Ã»ŠÔÖ»€aô»Vç*»{•º4‘Î:• ¦;5‘Õ;x_’;Œƒ¿;˜Þ ;¦ e;¯…;¶À;Ã@=;ÛáÇ;ôÜH;þ;ó’_;ÝÛ¦;Å;¯Þj;¦ðf;¬rn;³ð;¬z€;’%ì;bµ;/Ör;Sä;ä;€”;Ø;:y;#;‡#;‹:”°:˜_¥:z„¹:Mb½:Dþ:|2â;[U;0N;V#I;]êÊ;=>7;‰±;Î9;*:é;[¤};vF;yÝw;uF;oC<;mUË;wÞX;Š:â;Ÿ×~;¶cÎ;Æ{8;Ë’Ì;Ç !;¿Uk;·ù®;­³I;œéb;†Zþ;Z ø;($):óÞ:™[%9ï v¹gêߺFµ>º’µ}º®Õº±gº„;K¹”ƒ^9úIá:r:Ï:h”:žK:¶©ì:ÜA:þÛL;;$:ÝXÏ:»6c:¾[W:ß»:ü0:ú>4:Ñç}:€>«8¾¤º_èîºÄŸ4ºÚZ{ºÞ]–» Vè»H»ˆe»ª-â»Ç§»ßʘ»ô\¼ù¼ X¼¦T¼-¹‘¼>ÃŒ¼Dëļ>ט¼2›D¼%½%¼»½¼ù¥¼ü×¼ S¼=»ñe)»Ë‘¸»¦t »ˆwÈ»p»h;Ü»d:…»Pç¹»%äÞº»%K9Šï:ôÁ÷;V”+;…â“;”[; ‚¿;ªJÕ;¯¥Š;·îl;ÌÝa;éŽ3;ú‹);óJÇ;Û'Ö;¿îº;¨r';šZÝ;œí;¨ À;¬`w;œs;zZR;Ž ;5š;-é:´ ã9t Qºk®!ºÓºïêûËÿ»%¯Ç»Y»ˆC»£;3»¼•%»Óoç»ç”“»úiü;¼¸Œ¼*&n¼8ͼ;ß5¼7%Ò¼.^i¼#—¼¤ä¼¡í¼ 4±¼dX»ë…һNj‡» ¾Ÿ»x„Ö»Ebc»4)R»7f»5Uœ»!úìºì¶›º-a :p³=;&Ò/;tnø;®;ë;§fp;¬˜ö;°'ö;½èë;Ù°.;ó\µ;õhç;ÞNÄ;¿]c;¥aÖ;“Ê×;×/;šÙ‚;§Ã;¢ˆ®;‰ŒŒ;O¾;´ÿ;VS:úh:þŠð:üz;‘; ºË;x;è¬;pã:î¥Ó:Ó‹:À":Åp7:çñW;PÙ½;wÌX;ˆ£î;ƒ­Y;S1m;—:ÿI;º;Kà;iŒÔ;yÏy;ƒ†;†Ê‘;‰/r;¶Ø;ž;°»e;À»ë;É݆;Ë Ã;È^ü;Å6;õR;½r;«Lz;Ä@;YÍ};$;†:þ¡£:¼¹:Q¤¡8ª'ºVZº|D0º¨²Ûº¸t º‡}ʸƒÑk:•O:óM£;µ;©%;*ˆ¨;EÉ;_Ù¿;f7ª;Stj;=©è;?+ï;Y§;tÆ;z));e~;7:áš™9´}ºwx¤ºß°»&X»¿m»;Éæ»d.ù»ˆñ»ŸB1¼Kˆz¼Kä×¼L,ò¼K3º¼Dq̼6’¼'pȼ$4¼/?+¼@Y§¼JŒi¼E8¼.¦¨¼ Þ»×U!»¬=»ŸÙn»¨ÓÔ»°âo»¢€=»t,L»RºØÇ­ºóV&»HŽ»Ѻ÷5QºÐowºù»- ü»RLr»[˜»[…ç»jö»‡Y»»Ÿ[y»¼jØ»ßëï¼&¼7~¼$¤W¼) R¼&º¼"Á¼ /¼¼Fn¼‰^¼w¼ G¼¥Õ»ý±¢»ý‹»ù»é C»Î¾3»²l›»›†ý»O;»ˆµ»‡Ô9»ƒâ»b6»'õºáƒ`º Ú>º`\º—PÒºÌ/Ï» °-»+×-»>Ÿ»:Òæ»"aºô>1ºŸTÁºIÓº'õGºDUºv³ º”‚Ѻ©:º°íÔº£§º…~ÿºOþSº7Qº_×›º¥&ûºâuÑ»9(»ò»“ »ÿ» ‹*»lºï'Cºà¯sºÓ6kº¾6—º›Ð½ºd"ºX¤¹ƒ|É9” :²:»Å8+¨!º.}º©´ÜºÜ_rºéˆxºÕSøº¶þº¶C·ºê\ » ŸB»L»pç »‹Þ»£`î»Ãüå»é? ¼˼*J¼#H¼1 ‹¼†»±(»Ð·c»ø»†¼ie¼"ߢ¼,£Ô¼. ¨¼*Ò¼&ݵ¼#)j¼Ƽ~0¼î)¼ ²À¼Þd¼-u¼ØY»ýM»ähü»ÅP¤»©ë£»–滋£»†ò»‚»o‘»?Àʻ墺Unº:Ø=ºƒÛ1ºÌº³»è»6KÚ»@L$»,‰î»ທ皺UD¹R“¹[—¹å"tº%κKˆoº]8iºE¯åºÙ¹„¹ ©!¹ïóº8³Gº©.õºë²» »Ñ›»g»<ºëÒfºÍº²ß ºžñ2ºŒF»º^gʺP¸ïîF9‹‰:.¼8:ŽY:¦è:sÔÿ8×Q°ºa­®ºÕ×x»œ€»¤®ºÔeº©½Äº·¸Ò»‹Ö»<å»lŠá»‡Aƒ»•N×»¨ãô»Æôí»ë[®¼.û¼l¼&5®¼3¢ì¼<˜[¼@aò¼AJˆ¼B3?¼C#s¼@?ϼ5Gl¼#ƒÂ¼UͼÛá¼!¾¼6P¼G,ɼK]-¼>!;¼!y{»þËë»Ç󥻬V:»¨º|»«ã»Ÿ:ö»€®»@mN»+oF»LZ»yxW»ƒá»»vä»gê«»y»ªØ»›v/»™£»’õ»’K»›ôu»«îÓ»Ä#…»çyE¼´¼Z~¼*z‰¼0Â5¼03¼-J¼(°á¼#|ƒ¼…f¼…ê¼Dˆ¼Bk¼UR¼ vC¼;v»ø¥9»Ù÷+»¼3滦x|»–ö㻊¥»€'Ä»o»Q2]»§º»ƒxºyÑ¡¹ó*çºÚ<ºr3RºÖE>»öí»=ì»9Ü»*_º© ¹ÀÜ9H9˜NÝ8éC»¸õ‹R¹–Y·¹Âªa¹¡§î¸}‰9›–9Ú9§è‡¸»0¶º?󹺵x‘ºöo‚»T÷»^»y¬ºãº‡º³ŠºŠüKº[9Cº3/*ºä-¹b/B9f”*:3Ÿ³:‘îñ:ÈÑë:ñt×:á¬w:eh¹w¥º¦L(»A»„ºú³Kº³ŒUº’2ŠºÄ‘@»ãÝ»_6L»‡‡»“»œ£»­Úu»Ìs±»ðSü …¼R¼(ë=¼4Ûr¼:rõ¼;2‘¼;ŠÈ¼=Ö¼>Öj¼8šÄ¼)rY¼õQ¼¹²¼Œž¼*æ¼?!™¼K]„¼IJž¼6$¼—†»ëÚš»½F黩¶À»¨»¥&‹»“¸é»p®Í»L™H»Y»ƒcf»”îA»•Žˆ»Ž¸»ŽÛ7»œBÖ»ªu»«É»£öỞ껣$à»­ü[»¾¤Ä»ÙÀ|»þø!¼}¼#uS¼-ú©¼2+¼1ï¼.ļ)\Ù¼#óm¼ Sf¼~0¼_¦¼SÔ¼ä¼)½¼:á»ëß,»Í¬»¶ú5»§N»–8»ƒÍ»kí»U¬v»3]oºóÌ6º dŒ¹IÑ6¹Ç~tº€ÙºñŽâ»-ˆÚ»B1‰»)ïºÔ{Ó¹ò‚9ã :MÝÈ:4OÖ9ßw9RÞ„8¦¯68Ú²Æ9­Û^:2¶S:s5}:lª%:’u¸aŒ ºM­¢º¼¾ÝºÿaD»>»Eºé&&º¦4¢ºWð2ºr¹ª®K¹PÓ27H%%9רf:uÔ…:¼Îí:ô"œ;q;gX:é»]:6Òqº&ã ºæq»Ý» 1IºÉë:º¿zºƒ%£ºèÚ¦»A™â»‚ì뻕ÄA»›¸[»¢ma»¶»ÕUÜ»ö½^¼ ”E¼hà¼+·Ú¼4ɼ6€ ¼5g—¼6ü¼:ü7¼:ÛÞ¼12š¼ ­]¼Ž¼ðç¼"”|¼6¾¡¼FñT¼LÕß¼Cºq¼+S/¼ ½ˆ»ÙÉk»´|º»§È^»¦_6»Ÿé²»ŽìÌ»y$E»pÈc»‡Z»›$»¤æ»¢Î » +±»¦×´»³C»¸gM»²þY»«ê»»¬² »µ×»Á X»Óµ»ðºN¼ ¶b¼èμ&Ž¼.¨ˆ¼2·N¼3aƒ¼0Tœ¼+:v¼'Àù¼&{’¼$¹·¼!¨¼¬=¼B ¼ ½»ùë»ÛU«»Ä»µ¡Ä»¦])»l »pmC»T&“»@„¡»•}ºµ¿ÚºuÙ¹Tn±¸œ3™¹ö%`º¦1~»q„»AUJ»?ûŠ» ˆ¬ºVEŒ9Þv²:”¯_: Yu:~Af:2—ÿ:0J9ÿÝf:2C•:‰^Ó:´ã`:¾¶‰:Ÿè:7¯_¶ÀÄVºC!·º¹Œ$ºþà» ¶{ºñõùܺ0$¹„²·–p28¸ž 9PÐ 9ÿ„7:‚€9:Îþ«;S];5;)h´;„J:ÂvH9¨kº bV» Ú»cœºßSêºxðººXºã¸»gD»l`©»•‚s»¡Ó)»¤!²»¬•»Âj§»ßsš»ýfž¼¼ ±W¼.-ò¼3é¼1iT¼0€¼4“¼9›¼7~²¼+›Ö¼­¼2¼ºJ¼/+ˆ¼@œ˜¼K+±¼J^ì¼;#“¼¡»ÿ“»Ë†ë»¯Añ»§ew»¥ß»ŸŸµ»“íb»‹d¦»A^»kí»ªj»¯±»®O:»°Žª»¸œ»¿#i»¼ì[»¶IV»µkô»½(/»Èx§»Öž»ênù¼Õ¼Éñ¼μ&ü½¼.®¼4d¼5͵¼3ŠX¼0®¼/ýü¼/H¾¼+d/¼$¾¼sö¼Ëd¼5§»å*ö»ÌÀ¯»¾â(»´É»Ÿ:y»‚`è»X†E»Eê»3Á»áẠéW¸[-í¹Z¸@ºaºòÒ3»9M»S$»1UººBV8ÎÇ“:¡R:ÖC:Àê¼:”f¥:gñ:XúÐ:üY:²2ß:ç::ÿðI:ð]§:¿e:e |9(:PºU4º©îĺêþºé*÷º§&º5X¸Šèæ9t}o9³±Œ9Äp…:…°:oŠÛ:Æ<”; €;$ë;1n—;,yŠ;!$:r5#º¾üºÝ§®» xGºéº}¯‚¹­Øë¹â{SººÌi»?‡œ»Œm/»¦Ž»­\‚»¯øÝ»»)N»ÏçE»èŠÇ¼Ÿ¦¼M‘¼%lB¼/‚¼/[%¼,\I¼-·¼4‹ù¼9¢ó¼5¼(ò›¼c‡¼ëv¼(Ç„¼9#"¼Eö¼Jè¾¼D–.¼1Yk¼Äw»îFr»ÂˆÊ»­Á×»©3—»©0G»¦ŸB»¡J㻞Çu»£U°»«ëŒ»³件~c»¸`,»¼uï»Áˆô»Á€Ü»¼gí»» ˜»Ã ¸»Ðwˆ»Ý«»ìšh¼¼¼   ¼xÚ¼Î~¼'Š¼/ó‘¼6ýð¼9ôV¼9íø¼:7±¼:FÁ¼6]ܼ-i/¼!Oã¼»Û¼RÉ»í1»»Ó_•»Ã®@»»zP»¬·f»é»h²ƒ»K¸¦»C4»'«›ºÏ Àº“çh¹˜I˜¹/Bº*ŒÚºÍ)¼».óü»a×»YJ »eöºr½:ÿ:ð Ú:øl!:Ë¢ : g:‘I¨:¤è}:ÕÑ¢;Ó(;;];ò; e:ãMá:—l9éÀš¹®Ÿº‰ÕÙº¸›ºš/ºu©8xGŽ9â¿ð:€:\€:í¨:Qû8:¬&;2;"h’;3#6;2Ók;4Ô:Ê¢»9‹d庉´¦ºíæ ºàJlº|ý¹ €L8伞º7»ââ»oª¼»¡K»µoÊ»ºþ»¿W»ÊŽÁ»Ûo»ðÞs¼ñh¼i¼(¤¼-9¼*¡é¼(ÙL¼-ɼ6ゼ;O²¼5n1¼)8ä¼!ZB¼% Ƽ1Ga¼>¼Fbj¼G5¼={·¼(_¼ ,r»â}O»¾\|»¯dû»®\¡»²& »´@»²v¹»°Kr»°m¦»³s»¸YﻼO%»¾¥Î»ÁÊ»ÁrT»¾ È»¼½¿»Åú»Õk–»åö3»ô@̼s%¼Æà¼Q9¼ Y¼||¼(Žb¼3%ͼ;›_¼@”œ¼C¿b¼Ega¼Bù¼7ßì¼)=þ¼sô¼ ãí»õ«Í»Ú±–»Çò¹»¾~)»´!¸»ÃŸ»€ƒ»W›»LŒZ»C)»š–º>Õù’¨´º뺳â»$2»h÷»}ÕÔ»LRíºÄ–r9¶È¾:ß¾*;íË;«Í:ÌRP:±i:ÁŽ;:õ7~;È‚;5ˆ;;Â;1¹C;!T;Œ¤:ÆáÄ:OŸù¶¶O‡º)™UºS|Źßú9)7”:Ž…:GAÖ:AvV:/Ð]:Dø:’»:âøc; &;1Ú¼;4wF;$íÆ:þäv:y„=¹™™<º¦>ºÁºj’‡·óÛ`:ʧ9„¨¿ºvšã»0žE»97»´y»Äð»Ê~»Îáò»Ö/ú»ã¨»ú+¼+¼:¼(™”¼)>Ý=få¥=ä$<§‘‹<–79Ų ¼ F¼Íc¼ºåO¼¤Û´»ááK=zß=q«D=p§l=|úr=„ß=‡îñ=’º¾=«qS=Ís–=ê–±=÷ä˜=ø·=íùð=íX=ﹿ=ñó*=ï“ì=çÏ$=Ý%=ÔÉ=Ò±Y=Öý§=Ù®¿=Ð+ë=µöº=‘±É=Z€j=)¬<¼¾M=‹[w=Œ=–“=ª¼3=Ãî=Ó[=×½ý=Ñÿ=ØGV=ãÁÊ=ô5>i> Nü> ¡Ç> AÊ>PØ>õ™>Ú =æÿ =âò=¡M=¡û=FTý=éP=1Ë= N†=FC= qe<Ý5Å<š3ÿá>Ár>³Ü>dÓ>(>,Ü>Ó%>Ž=ì¸õ=ÇC=¥2Ô=„¨ =L¢€='i=%¾=3 C=4 Ž=;à<ìai<¦|›<¥Ü²=üã=]¢/=–m§=¨ž =¡âj=á®=yë=mŸQ=sÔò=…üñ=žRÏ=ÀÛ=ã…†=ùŠ=øÇ=ãtÃ=É[£=¶N=¨KO=J5=–A=’y=&à=Ÿ¸=˜Òw=£Û!=¯¶}=¿çU=ÐV`=Ó_ =ÅT=°V-=œ|=‹º[={Dd=~‚©=—»®=»FÌ=Ðç}=Ê$—=¯æï=”e®=|"=K(ž= /‡<¨¼äì> Ù`>cÅ>.oG>6ÀÚ>7°è>5‘ >0Ú>%Í»>aÖ=üf =Õ}ï=±.u=8ÿ=b5Z=N~Ì=Y“C=c…þ=Tî=.'@<ýÐÀ<Ë•ç=JÌ=d&®=¯Ø°=ß²y=ìJ=×U‚=·æ»=£Þ=Ÿs‰=¥„B=µ¿Ì=Ѷ¶=óÖñ>Ü>Ýy> !==þ‡$=ë)=ÛñF=Ì0É=¾Ú=µ¬í=²=²Ò˜=º²=Å°^=Ð|=Ùû™=æññ=ïà«=é‰ä=Õü„=¿_9=¨Ï?=“"¥=ˆ%@=“ó‰=´ù=Ó#=Û¿=ʹ=±†=›Î=ƒhT=F» =¤L<®uµ<°u¹<ö=/QÛ=g€™=‹°5=šÊ«= ¤8=ž¹»=–Ž?=Ž‹=ŽôM=˜âÔ=Ÿ·U=žG=ž3·=§2=±ýâ=²WÃ=¢;„=…«ß=OñÏ=.õ›=7qu=\oß=€Ìù=ˆLÿ=ÂÆ=gÙù=P)L=;}“=ÑŽ= _P=Ë9=O³\=|å“=†~-=ƒÕ=€:¦=a=…²1=†ò=„‹=ƒÅ<=‰ˆ=‘)=–ª =›Õm=¥Óe=µš%=Ãù"=ÈÒÊ=Ä \=½P5=¼Ì=Ä =χ =Ü-S>—> ÆÎ>DŸ>*Ç>,á\>D`>UÅ>\N>[MF>WN>NFÂ><»±>%WØ>"=ñtM=ƉL=ŸÈ†=‰ëY=‰"=‡=Fµ=wTu=Aµ±=^d=E[=lyý=ä¤> Ò>& Ñ>$º>4¡=ïÃ4=Ù?…=Õíš=ÝÄê=ð~S>šå>\Š>"¢>$n%>÷a>z3>Ñ>º=òoÙ=à=«=×üÃ=Ø-æ=ß0M=ëˆü=÷o‡=þ’E>ÂU>&Ÿ>qî=ÿ»”=æ¯T=Ë1ú=¯[=™üˆ=˜rB=¯Éw=Ñlƒ=å:×=à—]=Íh=¸½=¢?Ò=ƒAC=82?<õZ<Ö·ü=4„=8<š=n…=½o=¤m#=°$=´%4=°PJ=§‚ù=¤X«=­æÉ=º4Ú=»~h=µŒ¹=¶žã=Á^$=É™=Âæc=«áÌ=êŠ=o9Â=i0=„Á=™!²=¤âÆ=Ÿ‰h=NZ=w©+=f%š=Y,¥=H£z=Mò=}aW= éë=¸ÂŠ=¿(ª=»ø =¹N|=»‹=¼R·=¶±‘=¬¿À=§ÂQ=¬c°=¸Ø=Æ]=Ô*=äB=õZ=ÿ¹„=üïœ=ðX>=åE=äf=íÕÑ=ýr²>1=]>2¸V>6‘>Eœ¤>`\“>|-Â>† >‡.Ž>…jÓ>‚ù>uiã>]in>B„>(õ>=éO=ÃéÃ=·@=» =»U=¬2=§‚=bÚê=J±|=‚›h=Ó°L>$uÑ>Zn>nÖ6>[¹6>6Šç>õ> íŸ> 4ç>0D>È>'ÚÑ>6£Ž>@Ñ>@ _>:B·>3íÃ>*©ì>ŠÁ> —º>Ìñ=ÿåŽ>À> ‹|>—<>›÷>îP>U>Ü¢>DÌ> üé=óßñ=Ò'Æ=´du=¦»ä=²Î[=Ñ$2=ë~|=ñe뻵×λʋ׻Ý»î¢ ¼­å¼ò¼$„0¼0n3¼4ó¼1¢„¼*‘o¼=3¼Š¼!¬»ü£0»â[»Á a»›Ú<»jÿ|»(”"»—­»Þž» i>»Gºê‘º‘×]8Á¥Y:ÜCÍ;NÃO;‡ZØ;™í;¦¢¯;­xa;®s[;³ïÑ;ÉL;濉;õPb;æÂ;¾É;LJ\;ÊÎ…;Éï;Ç©;ÇL¦;Å¥x;¹ºÓ;Ÿ,^;wÙo;8™;T+:ì­j:¬­8:(ì¸QYɺ zºƒ˜Zº¥_Kº”/©¹©±:Œ¹; S;34ƒ;BxU;M—Æ;aý­;·[;Š²;ˆ{;y>Ô;kŸè;{ðB;ŽÅº;™Ëx;—±;ˆ®H;[[;/Ü9Þîк~ª’ºçx» ».4»Lù»mm.»‰°Æ»žJ-»±èS»Âëš»ÐÖ^»ß°C»÷Ó"¼ +Ö¼ ¸¼).¼-м,’Ƽ$•Á¼ü¼Å»ô‡ß»Ø€»·ï*»”Ü»`XÊ»‹éºÆÔ«º¥T-º®}›º¹Ú³º¸xoº˜ë-¹í9¶:[pe;½K;qa_;”µ;¦0;°Þ;;²¨k;±è,;¼íþ;×N,;ïMZ;íí&;ÒYl;±.£;˜íM;‹J—;‹:;—ÊN;£>&;??;ƒf÷;@–1;Êà:×fV:ß©É:ú¸;Æí; í;ã‚;6t;CŒ‹;9&¬;"ª;W ;e~;{·;@—;ŒJ;™ô;…¯;‘÷Î;k£Ê;2Ív;"a;=šþ;b£€;|Öú;‰jQ;”Œ;›}œ;ž?³;£Ü$;¯äÌ;¼ÿõ;Å1;Èw½;É«Ë;Éõ;Èó‹;Éuœ;ÃE;®êK;ŒÓ³;Q½§;èµ;×+:á‚¡:—Ö9é`¹EÍ-º*Û„º~0}ºƒM®¹×¸2:bÚÏ;\;T”;n ;w{;Ø“;âÓ;œ——;£ŽÎ;9Â;’ö;’©W;¡'_;±lÁ;¶È{;¯ÛÍ;žó ;~×];ûƒ9ý{ïºw›]ºë-»»>/»Y4Ø»uÝÉ»ŒbQ»ž˜»®"A»¸ë9»ÀÂ#»Î¢P»êZî¼]d¼¤l¼"±–¼'쀼%½–¼±Q¼ Ю»ðÿ¡»Ð0v»®7Ñ»‹¨s»Rf» ¾ùº˜º/)ðº sxº5Ÿ¨ºOwòº`Dº$œ“9Cƒ:ÌR8;F¦J;ˆÊÜ;¢Éb;´+‚;ºoâ;·•ï;¹­;ÊL©;ãà|;ï«—;àEå;Á;¥4Å;“;‹ë^;’+;Ÿ­;¡Î•;tÄ;`Hé;H0:ÝY:Ïõâ:ó¯Ü; ;R4;'ùb;A) ;YJ;Y†G;=Tø;#£;d ;¾Ø;FÂA;t‚ ;€;S€;kà¬;um';]¹D;.Z¤; #‚;·;:D¿;pÓ;•;œC”;Ô&;”Ã;¤—;c…à;cˆÉ;|~j;Šé);”";ž¦µ;©©;­‚õ;«E;­Û;µÜ;¾o±;ÂEE;Åý;Èô°;ËXŸ;ÌÍ;Ëq¨;Ãdx;¬ø£;Š”;QE:;&ùÐ;ë ;…o:¶Ô¸:0ÊW8ߺƒ¹i¬Ã¹®ë™¸Cë:yhä;%ô;…;£—‹;­‹R;¯%,;±é;»£K;Ëö¾;ÙŠ;Û5Ù;Ôòb;Õ Æ;á-;î+s;ðÜ%;ë­À;â«-;Ì2ø;›,ô;.¾ :J!®º%|›ºánÀ»%¾»Fv»_a»|=뻊÷»˜‚M»š»—rR»œF»²ÓûÕCI»÷̼ …Þ¼ñ\¼@½¼.»øX­»Íÿs»£mí»uÊ».,ƺØ‹º# î9\Æ+:é:Vƒ:Ò†9ÉÆá8u'¸ã!Æ9«¹:¿j+;>ý(;‹®Ñ;¯K;Æö;Íþ×;ÈÔk;Æ,Ž;ÏC;ÞÄ;æöa;Þd;É|!;²ôå; SO;–Cg;˜¨U;Ÿü;Ì—;‹œŸ;[ü;Wÿ:ïs_:ú#;Ó;A´ù;\öº;qõ@;‚rŽ;‡—b;}®X;K°Ü;Ú*;¡=;"‡¿;[Ó6;†Ð ;‹”`;“‰ª;˜jó;˜8Ð;ŽØ;‚‚ß;$;ˆHg;“§È;›¼&;¤?G;¯q;´ŠÚ;°D¾;«ò ;°;¹ˆd;¿%Ì;ÂÀU;È2ƒ;Íš;ÎR;Í|%;Ȫ‹;¸ê";œ;u/K;B¦';+”;`:üV°:žPÍ: L9_à9Zþ9à §:ž‰³;1_g;;’;¸g“;ÉV0;Ëôé;Ë–g;Ð2 ;Þ}:;òmÂ<v<–\;ýÖ‡<]ý<î“< )R<˜v<%q;ûÌý;Ý]Ì;£W9;=oä:Žœ¹ÈwÞºÎô »§»çX;u;Î;‰¶6;Ò;•Ï];– ;®;Œª;’b?;œ>ä;£“Ë;ª4ã;³ÚT;º´­;¶[‘;¬ÈÖ;«½æ;´b;¼?¿;Á–È;Ècì;ÏØ“;Òô`;Ñ™Ê;ÍŽ´;±;¬9³;Ž„;gd;;JÕ¢;>àš;)¾w:ý¨4:ž :Iá:7_÷:u»Å:×Íô;DAW;š˜¹;Ët;å…;컎;ë³3;ëÙ;õ%a<ý<ìè<š,<Äî<=¹<#o<aÎ<]n<ûN<ì±<R²;éW:;«a;SËü:¿Ž¸Ö²–º­Çú» r »)‡M»G»eQï»y˘»xU²»gÜ»f€‹»„*š»Ÿoî»»!û»×"€»ò’4¼÷I»ù^»Út»­»tÓ…»§hº‘ô¸Úª:i‹:ÒÙR:뛵:Þ¯ã:ÒM:µ'Ä:gðz9Þ:Ð:ð:¾€;<«¼;a‹;¼ R;Ø°°;á$ø;Ûv;Ó6™;Ð+;ÒÍX;×Nµ;ØNg;С;Á Q;®Y; ®Ï;ž#-;Ÿo;—‹F;…ô;]®;5Ûg;,ð¡;K–2;|Á²;”Pð;¤Ó¼;®í;­E¤;¡o;‰c‹;PrA;³.; ?ù;);;[Šn;€Ó,;ƒŸ”;‰_Ü;’1ç;š;ší¶;˜Ô|;›ïƒ;¤0T;«AW;°“×;¸vY;¿ü];½¼;°]B;¨ûë;¯;¹ú»;Â)¼;Ê}½;Ô‰q;ÚÔî;Ú'Z;Õiá;Ìîá;»ñ~;¢k/;‰;•;t2O;j²æ;`Z';?#; º–:ÎÆF:¼Á(:ÝK´;‰:;cʪ;§=¥;Ü#$<¶<Ð’<íU<!< Ì<5É< Oš<-DÍ<2§½<1Ð|<1`<2kÖ;N@{;søÿ;Šì;“^l;Ÿr’;¦E½;¥Úü;¥úU;«Ñ;³e;¸:»;¾K^;ÅTj;ÄRÍ;¶è¹;©Úâ;«¯ã;¸”3;ÄÇÎ;Ï;S;Û‘†;æü;èk‹;ãqÎ;Û;ÍŽ;¸ÁW;¡ži;’¨;e„;ø¸;‡¦I;dSà;5:ú; :;-Åè;TP‡;ŠÄÿ;¹ÞÛ;îK< RÎ<Ãe<‹C<áæ<Ùº<"×q£d¼7­¼+t©¼&]€¼+>j¼5 Ó¼> ‡¼Cj9¼BG¼7 c¼!.¼Ã÷»Úøß»½|]»´ ’»¸5™»À€ »Äá»Â[G»»ôq»¶½»·]ü»»óT»¾‹D»¾t?»½°à»»Ž©»ºË$»Ã »ÕÀ|»ë%»üÅ{¼p›¼ ú»¼›¼ Ÿ¼Ù༠¿ð¼,ñ¼7怼Aü|¼IÝݼO¼NݼC䦼2òÿ¼ wr¼gò»ÿéÙ»äB6»Îà?»Á¶Â»· 廥)»Šk‚»ep»RQ½»Pfn»7™cºëýcº¥W¤º—lº´ºšÑõ»12»e·D»‹½&»‚U»*‹"º'ÀÈ:š;õˆ;ñ–;UD:Ö­×:Ü£r;ßñ;-ìÙ;LŒT;WžÙ;PÒƒ;ET;8a; ö´:öî(:—1õ9Ò߸Á­2¸¯s9¨u:C[Ã:v×7:qª²:Uæ :P»Y:…ýÏ:Èç²;á‡;/';7ù;)Øí; ¨÷:¾þî9ìVºÈcº‰–º<ä8®p³:OÑ:l º8ßÓeºÄ¡,»^ø»£ø]»Ä™j»Ódb»×ó»Øâï»Ü¼:²¼?bo¼=ý¼1츼,˜¼d»Õ~Ë»¿b»¼½—»ÆËR»Ñ›—»Ôo-»Ís„»ÁL(»¹R »¹û‡»¼‹7»ºñ»·°ê»µ•x»µÑ »½ã»ÑÖÙ»ëżJu¼ Ëk¼$¼̺¼F¼¼Àżɼ$ÂJ¼0Ñw¼=¼ú¼J='¼T¯T¼X› ¼Qï¼?@•¼)Å%¼Z|¼1(»ða–»Ù.¤»ÈKB»¹þ.»§–v»q‘»oÞ•»T«»PZE»G¸D»7AºXÖ]ºóϺuøºûtÿ»Sžî»Žèu»—㺦ƒº3ö”º»’§»/Úã»…4»Ÿ õ»’w»B—lºgð:“;f;7¤ö;(‰Ï;ã;,Ä;T¬´;~ÓÛ;Šv;‡ãÒ;{uì;l;fm;[Zá;C;«;!­«:÷Ö:¶ù:š24:¥;(:µ}+:°Üë:œRå:3:—ŒÔ:Ä"5;õâ;,êÖ;DÕ;@A±;%G;Ë:ÄÕ:^ÄÙ9jûg7üº‰9æ^ì:’S :Õ%:Øsç:k©íº2ƒë»0¸Ž»•öF»ÂgT»Úz³»á²»ÜUU»Ö¸»Ü+»ðœ¼Ò®¼’ü¼^¼ÿ¼!Á²¼)ܘ¼85Y¼G­w¼NY§¼H$i¼:ñ¼/Ip¼(ÉQ¼'#ð¼*f¡¼21f¼9cò¼6øc¼&…¼ ì»èSŸ»Í×Ø»ËMÆ»Ø1»ç«D»íÊ<»æ’»Ó‘H»Ã9n»¼ËỸtú»¯šÇ»§t»¦GL»®xâ»ÂÍi»â6×¼c¼g ¼EÔ¼.¼¸˜¼=¼nZ¼h*¼$ ¼-’¼;ð¼LƒM¼]¬¼el˜¼\Ëq¼F½1¼-(®¼ ª¼l§»öÆ»ÞÉå»ÈK'»­»m=»eW»Bå*»1Û »-UA»$· »‰Fº9!ź÷CºmŽSºü× »\Š#»–"ﻄ{»yQÇ»N9'9;iŽ;Ak—;KÃs;AM“;H®è;lß@;_–;›ï˜;›fo;ŽÛ…;€Ú¿;sq;mc£;`u;JÑ€;0ãÓ;£^:ö@t:ã ª:â’š:زñ:¿=:¨®û:¬«Þ:Õ`Û; ¾Ž;3Î;Oên;S[;:åˆ;—:ííŒ:±`y:`ßÔ:›w:@óŒ:§_:ë=c;åê:æI‹:,‘Aº˜É¸»SŠî»£Ë'»Ê*â»ÛX »Û0»Ò#ƒ»Íˆ»ÖÁ »ê‘»þg¼÷¼|²¼‚n¼#ɼ/Ú¼@µs¼N»y¼Q‡¼G‹²¼95í¼,˜Â¼$q¼  )¼$¶¼.¿˜¼6^å¼0qö¼:¬¼ö»Û :»Îª»ÕÇi»æW–»ó%2»ô“¤»ç2B»Òö»Äˆ»½°»²¶Ó»¦`·» žå»¦m»¹É¸»Ú40»ÿL(¼¾;¼â—¼<"¼ ÷0¼”G¼¼뙼!‡Î¼',µ¼0×£¼@’¼Tà ¼e~[¼gw¼WÒ_¼>`м%Û!¼ˆé¼ ™»îk¡»Ò¤»²¿Y»Œ”E»T¯»+V»É-» ™F» ‘¸ºølšº­É.ºEØ3¹ÂÚh¹æ0Ⱥ¹k»àu»xÞý»•ôλ‡ð»0woº= ,:¦ÄP;6–À;d]Ž;iò;mÞº;…M€;œI…;®;°ìJ;¤‘<;‘ñ;œÐ;tê;;k±Š;^@Ð;OßÀ;?KŠ;)Íö;Þ•;Ë;:íÚ&:Ϊ]:ÈÜ¥:í(†;î;?–Ÿ;^¼T;i~j;W4ø;17é; c:áŠ:±(ð:Šów:òõ:À®›:ýª¨;ü-;Cf:àŒQ9¡q ºÛKE»rså»­c’»Ë’»Ôz»ÍËÖ»ÂÏÆ»Á(þ»ÌÖ»Ûws»ìj€¼“¼+'¼ME¼'q¼6Æ$¼H:y¼RÝ̼PÙµ¼EƼ60¼(5+¼P4¼áø¼áß¼+M"¼0Ѽ%*G¼ ²Ç»êß»Ò`#»Ñʻ߬‘»ï–‚»ùL»ö= »å>»ÑÙ˜»Æ®»» Ÿ»¬f»¡ k»¡zù»±GÒ»ÐËj»ùe¼@ż±¼ œ¿¼$5õ¼# ¡¼!á¼ T¼!|¼#£©¼(ˆ¼3)¼FgM¼\_í¼i¬N¼e¼PÞo¼7b„¼!³ç¼/H¼N»ßñ>»º™»è±»Eê» ðSºëˆºÓjÖºÌaºÉ1uº¥Õ¹Pò«·°-ò¹¨ã/º¡ŒB»+V½»w¸Î»€Èñ»@o຤“ :-;è ;l‚;…ÿ;‹%R;–|;«Ø&;À á;ƽö;¼ú€;§ÑJ;¼;€Z;o¬©;c)œ;Ziò;V~ì;Má!;>k;0£E;$¨ ;·;úƒ:ïÿ;¢;(¦×;Q½ä;rm;€ýÈ;w›þ;Tÿ;(n,;gA:ßE„:¾ƒe:¸Ï:Ûvk;—ò;šš;)S;çÁ:Æt†¹¥h»઻†h_»²=¬»Æý»Ç¼M»¼ 󻱎 »²ªŽ»»í»Ç×»Üh}»þ c¼áQ¼Ùº¼,_ݼ=y°¼Mm¼SÌã¼N~ö¼Aµö¼23ż"3“¼‹e¼p¼¬Ê¼&“±¼&È"¼Š»ùlԻ׵ݻÎLI»Ö¥Œ»åþ»óv·»úÁ»»ó°Ì»á~c»ÑÄè»Æ6®»·â»© ƒ»¢ª¡»«°>»Æùï»ð9!¼ ¤d¼G†¼!@`¼%DÒ¼&Å6¼%{b¼#ÑI¼#$Û¼"¯¼#Pà¼(ƒÞ¼6"üL¼atŸ¼i¨—¼_Î6¼J)‹¼2Õ2¼—1¼ è»òÙ3»Ä¦/»‘û±»<Êjºã.*º¡˜PºŠ:šºM꺈Xº‚º'ù^8Õƒ9ñ°9àV ¸îŸoº f»%õ»On»/zº­ã9ÈÊ‚; ú&;idJ;Ô‘;&i;§ùî;»v;Ð{Ò;Û x;Õ5 ;©;§ÉÎ;Ž—c;zºs;eÅ;Z\þ;[ÛÀ;aš{;]¹´;R/;E2Å;4ù; Qæ;Eí;DA;:¾&;hØ;†&‹;ŽÿV;ŒÙÐ;|®þ;N·;"p;½Ã:â—¼:Ö€`:ïÉ°;Ff;&ë;4þ¦;8CÀ;ó:–s!º4Q¼-t}¼ÍÁ¼ ï/¼~¼ëʼìH¼­Ž¼q4»ÝH½»Ëßf»Î…»Ù »æHÜ»ó^—»øbP»îܻݯº»Ñϻĩ¡»µ´3»ªƒr»«{ª»¾ôÜ»å.>¼ G¹¼\F¼"I ¼%iå¼'¬¼(LH¼'a·¼%м#‘¼!¼!™¼'Ñå¼8Âü¼P~4¼c;̼f[†¼Y§m¼DÊP¼/Ù ¼sU¼üv»Õ§š»š»»»>”)º¼áº8O ºÑb¹øDº'¢º&fœ¹Ï:¡°:¥ÖB:€p²9ZmÁº}/Bºý¾‘ºÿŸðº{wˆ:=N; R$;hæ;–êx;ª…ê;·1É;È'„;Ý´Þ;ì4k;êØ;Û¼™;æý;¦’/;Œ&Å;s*R;] 1;Yðè;g†\;rs¹;oÛb;eY;U†P;Ba;1Þ2;2p';OB};€";•·á;ŸÝy;žÉ*;“vG;|Šj;IBŽ;·´;ª•:ëI:ùd¨;V©;/œ;?–;H‰™;>; ‘³:'òhº§^ß»Pë»—>Æ»¯ýÊ»´w¨»©¥»›µ)»•­q»•û»›,Þ»°-Ç»Û8=å¢=Ô_>=Áá=¦}—={À"=+´¹=|p=Aó=G/=}:=˜9@=®^^=¾¸„=È£=ËÑ=Å{È=¿" =Ä` =ÓNé=Ú°T=Ó=Ë|B=Ï~F=Úžò=Ý…Ò=Ï©=¶`ú=Ÿ=˜ =¥I·=¼/¾=ÌÎu=Ê‹#=µ/y=›vñ=Žú1=8:=‘ÝÙ=“+=£˜%=Çt¹=íKÈ>°>l>ÄÙ>»2>e>û[=ñòs=áh=Ü\•=é¡í>²Ö>ä>>#\Ã>*Zª>+R>$áü>éà>[ˆ>¬@>!J’>*ë>ok¥>o+~>kî>pö³>„©â>–x8>¤•£>©-h>§Ž:>¤ªl>ŸaÖ>”“”>…ˆ”>k¤>L)S>+œ›>½o>°Å=û¬h=úÀ„=ìÄÑ=Ï’=ªÁÓ=‘½$=çP=åûP>6–>„¡4(>¢Ÿ>‹,>`Üz>@@#>3äÉ>1Lc>4¦2>>T±>MË>\®>cåZ>bÔq>^m>V))>EÚ‘>/XÁ>ÞH>‹v>›É> Ç$>)HÙ>.£]>/u/>/„>/ü“>-½ë>#/à>Å=ûì¹=ÖÇJ=¾¼N=¿`î=Öë_=òˆ=ÿ&”=úx‡=îb›=àÑ·=ËDZ=¦XŸ=oÓŸ=0ÑÙ=/#ö=\œ=‹hC=¥†¹=»åÎ=ÎUR=Ü/õ=äÝ$=åº.=à?\=àYÈ=íiÏ=ú’ =÷„]=é9 =â5 =èã½=ñ|Î=íÌ =ܱ«=Ê>D=Ä‹º=Ñ´?=ë{ª>þ%>‡>=ï'P=ÌÕô=·Ü=»{ý=ÌÍf=Ø¢=ãÔ!=þÜ·>q>&´Q>1>f>5R>7 >7ÞÆ>5’>+˜$>(¥>0Û>Ýi>*iã>AÙÚ>U<á>a½é>i˜>lLÄ>g;I>\ó¤>Uˆj>Uà†>\°¹>g>¥v÷>ŸÉ°>›å\>¢ÿÁ>µ¶´>Ê3H>Ô¨¹>ÔÛ>Ð!>Ì5=>Ä>µB>£+Ü>b8>xç«>R•“>8.«>-Qe>)Xt>!>>"h=ø9=ÓOÁ=̆>Ïë>Csa>”á>Ç—>ÝVD>˸U>¥r>„„°>gÛ¬>[/å>W&à>Z@W>e¦0>wG>ƒ\k>†kÎ>…b>‚$r>u9`>[Œ>?-)>.€Y>-”c>7­>B'Á>I‚³>K¼>I ‡>GÆ·>F;„>=þ>,¹Å>r˜>L =ßKq=Õ;¶=ä×=þyÞ>Íê>YÒ>V =ü’õ=ïù8=Òñ±=£÷}=p¹0=SÔ!=xGS=œè<=ºŠÛ=ÐÓS=âhæ=ñ =ýk/>©é>³Æ>Ì&>d> Îí>ǯ>h=þü¤=ú²Þ>ïZ>ߘ=þ=òÀ(=ò—q>¤>ܨ>"S“>'õ°>{¡> éÉ=ðö =ðµy>Ž[> æ>#Y>+“Ë>:îd>O½F>bi>nOÒ>uÄË>yã>xÛ¦>o?U>^/¤>N/»>KL>]]Æ>Z~>¨>›¸ >¡>¢¢í> ‰>›6è>–‡5>–L>™ö>Ÿ‹ô>¤ùb>â9Ë>Û€«>Ð4F>Î?w>Ý>õå?Ë?‡3?¨_?3O>úÆ,>îgb>Û`½>ŵ>®Pm>•óÃ>‚ >n">cðD>Xv«>Ew>-ð> >>å·>Nwt>œƒ >àþ? ɱ? öW>ë°¨>·òR>•×r>†p>™Ê>zÂç>Ùp>‡å">’z¢>š ‹>› >™>’z>…r´>hQ…>Le@>Bÿ>KG>Z}>déÒ>hkø>eõà>bZ#>_Ù0>Y]µ>I]>2 >– >z¥=ò{=ùÎn>Eo>>©> ÏÚ> ƒD>} =þJ1=Ö”ž=¤T=…W-=Œêº=¯Â=Õ3=îÎõ=þ}ž>(k> #¦>SG>Há>s>Š>ª">$Ún> »>"e> 3™> G4> J> "à> K“>ªÚ>„7>2˜‰>H¥¤>TÛ>Näc>8¹Á>ÿ=>(­>,õÊ>MNY>dU!>lÐÊ>s ’>€¸M>‹>•C’>o>£>¤þ#>¡FV>—í>Œ„‡>†—g>­>¡4á>ºÿF>Ïë>Ù(>Û—L>ÙL‹>Ó]¥>Í]‹>Ì>ÑbY>Ø=Ó>ß?®?@F? [f?Àç?xT?“ÿ?£à?$‘Õ?!v²?2 ?€? ? ? ?€>è°u>ËôÍ>±*ù>Ÿ<Ö>•àÊ>Á&>ÿö>fÆ>IC >39”>3Q>[6Ø>¸“>éÞ?sw?-0?l>ûrÍ>Âo>£R>•hd>Ž«Ô>$ª>’xÅ>¼@>©‰]>¯pú>®Pµ>¨T>œxƒ>Š3Ð>nû1>YÌ >\%h>mR>}ºö>‚…¥>Ú³>~Œ?>z$¡>tDD>fi‹>O%£>3lt>#º> ‡> }Ú>+¯>y>’>Ìš>øž>×b>Ô>/h=×ä¿=«2G=¡±’=À¼=îk…> ë>Ê“>f¸>÷ >÷Ì>& ¢>*«[>-†à>3=g>:%Œ>9{f>-ÿ¸>™î>Íœ>ªà>‘>ÙA> ÷Æ>3C>PHÜ>o–ä>‚lb>ƒ @>q{j>R3s>@ÏÕ>QMp>~%z>•8Y>Ÿš¨> ;½> ô®>§±6>³$>¿’ª>ÊÚ>Ð[Ñ>Ïš„>Æ™Ô>¸Óü>­ûs>¯”>ÂaÖ>ãHô?¯”? Œ ?Î? ÄP? .‰?V?’§?Z? b?¥@? ©?7ø ?1Â?%Üø?!¿2?*0¯?9La?BþÃ?A«P?;U¡?6ó]?3ˆ?,†¤? ûI?ã–?>å–~>Ìó>½.Ø>²Œ€>¤„`>’áú>Ù>da>Vº`>k†ÿ>›K™>â&x?g?Bß?D?$b‹>ùÊX>ÄN>ª¿ß>žöì>™4/>š—>¤3m>²xÆ>½žÄ>¿ýy>º±o>¯Ìˆ>ž„>‰~¬>r9Ö>iÈG>xè}>‡Š¯>Žnx>{>Œìq>‰ÉR>†¡>€˜n>kig>Ný¤>2Ž™>®>°>ô[>':/>'›>œî>šõ>·`>Ñi>J>ÞD=Ù Ô=¼X=Ì.Ë=þ0ö>ê>&m§>)`J>)8q>,U•>4><®ê>B„4>GÈN>NÙK>R=>J‚>9“×>+Î>%/[>%ê¹>(Т>0H,>DBÆ>gWØ>ˆv >™:'>ŸyÈ>˜©>†‘Â>o1V>t8©>’v‚>³¢Š>Ê0‚>Ζ>É¡è>È[„>Ïü.>ÝÍ >ìÒÔ>øo >üê>öU¬>ç£Í>ØN*>Òœh>à8É?}’?¸?'Ù°?/ÇË?0V?,i7?&´¨?#[?$÷¸?*Í¿?0õq?6a[?TÚ«?HÐ?>²??±M?Ma’?[HD?^c?W8?OùÃ?Kßú?F¼=?<¾?.«?7J? Dy>ø,>â˳>Õi„>Ʋ>‡>ŠÁ\>|Ûf>~­Š>—Ù>>Ñm0??ß?Eü?[t?GöŽ?9}>êô>¿:V>¬¿>¢ab>Ÿxl>¥˜5>³´L>Ã,Ú>Ëõ>È?>½ét>®ï>™]>…=ü>uJ8>|+<>ŠF]>•®>™mð>˜5u>”»•>‘à>‹¾_>ùé>h{U>JÂ4>1ÀÁ>$÷ù>'`ç>0ÒË>2ðÞ>)fj>¹¢>ïÝ>"f>$Ž4>›(>±s=Ûа=Ö)š=ÿâ¢>£J>7/æ>>_¤>;ÁÎ>:*á>?m >J _>T 1>[ O>aÜ>>gdh>d[†>U¸>Bý›>6‹½>3y½>6B>=ƒ>PŽ3>ujÜ>“x(>ªÇ?>¸I'>¶xx>¥ò1>‘kÄ>ŠìÞ>žÎŠ>Æ—1>ëÀß>ûŒ{>öÇL>íÎ>ëÛø>õîõ?7G? T—?=…?œ¶?  >ÿê$>ójË>ø×? Ô\?#ë?:¼P?I½)?NˆÀ?KÎe?E9?>§u?=º%?C>9?Jåw?R?Wjå?mÁ?eö?VÓn?P¸?Y.»?h†?pŒ·?kç_?bc?[î?W}?OÔú?CN?2þ÷? ¾Á?~â?D>ð&Ž>áä>Ìo±>´ÝÕ>Ÿ»K>ˆ">ˆ±>”gt>¼í?Ž?6¹¼?]PA?]·À?8­'? 3>Óq@>´Ä)>¦êŸ> V'>¢!ò>­¹>¾Ñü>ÌŸ¨>ÎòÛ>Æ;à>·^œ>¤J!>Q>#½>yVY>†”>”7»>œßr>ž­ >œ$<>˜FO>“Xå>Šé>|¨ >_Å>Dùú>3 ¼>/ˆ>6ñ˜>;®>3™¼>%I>Ø>!¿s>(]è>&wq>î=ûù’=à§|=õÆ«>›Œ><…Þ>N&‰>MûÓ>HYÛ>H»E>Rî>_e/>j¤>q…>wäP>y=€>oTT>\Yô>J®Ó>B_'>Bì >IZ‹>Yiç>{:ï>—Œ·>³ëU>Ée>ÏÜ>Ã9>«âÌ>›€ >¤Äf>Êéú>û·? gŽ?UŽ?´é? ±?³·? 6%?=?\H? z?7?ð??žÙ? ÿñ?#U@??J?U’1?aJ?b-[?\"Í?S›Â?N»?QŠ0?Yn5?aÑ+?iÍ[?rI–?fÐ?Zq#?[}?hW?tHd?tEƒ?jÖ?a®(?\Cg?V‹4?LQn?=­¶?,Wj?Ï6? ¢¾>ýø1>ïq>ÜŽ7>Äß>­Ýô>›H >L>sÕ>¨b>ß©h?d,?I*_?]ˆ)?I&è?.r>ç&T>¹”Z>¥Ý“>œ“>šg•>¡¼>±œ>Ã:`>ÌY>Ç÷Å>ºdß>¨Ü€>•(&>ƒõ>s¡>|N¡>‹b—>—Åó>ßH>žT>šàV>–Lc>1B>„C™>nB>Tˆd>@$î>7 X>:4r>?Ù,>:êœ>*ôß>²<»É÷»ä\»"‚b»¡š»)Ä».-;—éÐ;ňç;ão;îâ;è¾;Ûƒz;Ìû³;ÃM;ÃØ;ʹ¦;Í™;Å s;¶ö>;¬)k;¨’Ú;¤;^;—Û§;‰—;€¹;‚ëG;”fÏ;²‰Q;ÏŸï;ã‡y;ð¼;ðÃÈ;Þ|ª;¼ã;–(g;hb";@šÛ;>è;X1 ;y5Ú;†bÖ;™Au;Ÿ)¥;«âX;¶x;·BÊ;³U@;´‡e;»xä;ÁùD;Ç8–;ÌËr;̽Ÿ;À\„;¯É;«Á1;¸VÂ;É/;ÖÜ';åF•;óò);ûØ»;ùQf;ð`…;äm½;Ó@0;¾Px;¯0;¬žô;²@;³%¡;¦Qa;;zû;}$;‚í;­ç$;ÕþÁ<‡þ<Y\<(*K<1S<5 °<5»R<7ìÐî<4”<,d‘<|<d¿;Îؽ;Ž¯ò;&‘2:—ƒ¯9ˆV¹¥·ºS2;º¦âfºÊì_ºÆººkºØ/ð» ñ®» ê»5»aÎλ½ »§6»¤Ï}»†âª»&ólºB§‡:Qà¯:ýÒ;=m;oÙ;}Éf;jj;Qmã;>\‹; (a:âñü:£4Z:Çî ;*²;…iå;µQ8;Ú=;îÍ;ò~&;èT»;Ö8Ï;Ä „;»";¾šN;Åòi;ÆåŽ;¿óA;·˜/;³Ý¥;°ò‡;¦[¥;—ì–;’ÆÉ;œ<3;³L;ÕpD;÷¸y<o<< êî<M<,×;å»/;·è³;‘>ì;t£„;jáp;|»>;ŒZJ;•ï‰;¹IQ;ÃÍC;ϸ«;Ðõ­;Çé™;Á*w;IJX;Í9f;Óúæ;Øu¬;Ø y;ÌÛ…;º®f;±Un;º‹k;Î ô;à„;ñ‹¸<áU< $< ò|<0¶<Ù;ó&;àɲ;Ñq;ÍI+;ÔÅÙ;ÝH;Ü/D;Ì :;·0;¯a€;½\;Ù::;üœ<CÙ<&<6q˜+”<5,m<$‘R< îÜ;×~9;—è>;De.:ògÊ:•x:&l]9È¥¹’'1¹æ»ñ¹Ö0'º·º€&º­}º½Çhºæ¶»'»eU‰»‚Çûoe»!ÛâºB‰±:ƒzÀ;êa;]Žï;Š\;˜pn;’À;ü?;h‚À;Oª;&LJ:ñ¶‡:Ûx¹; U;pG¬;§,;Îe³;ékB;÷c±;öLœ;æ§;Ϙs;¼h6;¶ ;ºûÚ;Á‚ˆ;ÃAý;ÁÏÏ;ÁÈš;Â7;º²;«ýÂ;¦D;´Óa;Ô10;ü‰<`µ< ±ô<(4V<*†<".=< ª;åå—;·À;œSÇ;•Ü;œCY;©pï;³–i;¶Žê;áÀ…;è€S;óá6;õKÌ;çP;Õg;Ð>;ØAK;⇻;è=í;çO¹;Ü•›;ÊJ¸;½8ú;ÁN‹;Ô7¦;êlg;ÿM< 0M<~^<£ö<¯J<Ï< )y</í;ùK;òŒK;ø•!<3»<#:<ñú;÷ü;è¡î;î)<S<$Ô<&rU<6Ê"ó<@nåú¹ý<7l¡<3·ä<3g<5^<5Ǫ<6|H<9ÌG<¬ -y<@u~<@.4<<šR<;õ´<@‰¼_¼};»ìñ»ü‰¾¼þ’¼3»äùí»Éc»ÁRy»Å+w»Ê™»Ñ˜v»àLL»ìdJ»éE»Ý5:»ÒôÒ»É~°»¿1þ»¸3b»»ˆ»ÑWÚ»û¼Cæ¼$Ôò¼(Ô1¼'¸Û¼(K¼*¼*®Æ¼(¼"à¼9ø¼Ò¼"¼'¼=ɼSà'¼_ÿ¼[”s¼MK¼:á¼#n–¼ñֻÖ¸»q^ʺ֎m¹qÐ9™KŒ9› "960·ïÈÕ8ÍJ:Eú;Xud;cƒG;E—þ;Qb:¯È¦:3 :8;³:Ù:X;@û;‡Æ;¦Ñ;¼9;Êq…;×®Œ;éLq;ü"Q<ÜT<Ã;;ôÁÈ;áŽÛ;Å`T;¥7 ;‰èê;qÆŒ;oBP;ƒºé;qr;‘Îù;‹ê;½–;r+;n€ø;€ž;–ó•;µG1;É{r;ÊZž;¾H;­w¤;–¤-;tÂ`;>¨Ž;™©;¢š;Sò;0è ;Qf;e¡_;jƒÄ;Wi’;"Ç’:˜Òûºyþ»\»}:#»¦f»«¯»©¬¢»Ÿ㻕;I»ëM»,¦» ?Ú»Í9¼ÃZ¼à4¼!¦¼-*9¼;]‹¼Gì>¼Mí¼Lÿ¼B x¼,è¼Lø»ë€¶»âÌø»ô8¤»ùAý»ã†»Ç«9»¼*×»¾ÔÛ»Á ©»ÂðI»ÌŒk»ÝP.»äqx»ÜŽ»Ñám»ÉðÇ»Â}’»¼Áº»½k3»ËÜ<»îtx¼ož¼#ÎP¼+ß%¼*[R¼'Ô>¼(ªM¼*²"¼)º¼$’A¼:œ¼4æ¼£œ¼Œ2¼(Y¼?-¼S1ž¼Zƒ¼TL·¼Dê`¼0Wϼ#8»â×»“G »1ºdð9º2Ü: 9Ò0%9hýÔ94RË:a:>;;†1ª;ûí;“{%;xã;Dùg;‡ò:ûÓL;!¿&;iç;™·;µCç;ÆCY;ÐÀV;Ú|ù;èÂ;ùuó<€#<Ë^<»>;ø´2;å=;ÆÑÏ;¦uº;ñ;‚&k;‰Ò;™¢²;¢^ ;ŸC£;“¶ê;‡õó;„ó€;!/;¡`Þ;À«{;Ü–<;ãÍs;×b ;ÄX;¯–±;•ß;q¶ô;@=‡;!Æ©;Fæ;/Ãü;TƒÖ;sßl;€dÀ;u­;L ;M:[mº–ˆl»8nœ»…Þ»¡”¦»®¿©»­Ëx»¥@»šš»’;„»—Z»¶´Ý»ê¯¼ ‘ô¼Æ–¼$§¼.¼Ó¼<Ѷ¼H}ø¼LÙ¼Hæî¼:ÒƼ¡»ÿžg»Û„`»Ý†»æ£3»Ü©Ì»Å/"»·#ù»¹í»¼Þe»ºo™»»æA»Ê+9»ØÂ5»×Õ»ÌÖ5»Ãòa»¾£»º˜¤»¼+ »Çƒ}»ã‚K¼m¼þ=¼-}’¼.U×¼)º¢¼'`ͼ(¸Ñ¼)‹´¼&è¼!q¼M¼ ¼(‘¼§ ¼*€¼@áe¼Pȱ¼S†¼J¹¼9;¹¼"\¼ú…»µS½»Lÿº•Žv8–^ï9önY:3T9è ‡9¿ê:f%ž;»P;Á_2;Ãê‹;¬”y;“›;yQP;XÏ;`ËX;Š2C;«gê;Å3V;ÒV;×[Œ;ÛæÁ;ä‹š;ò <%<J§<ĉ<r²;þ1Ž;è\(;Ȭ=;©ë;•§Ï;”Ÿ;£Éž;²ä?;µ0è;©´ü;˜Ëñ;à•;˜fK;«’S;ÈòU;éØq;úþõ;òº>;Ý1;ÇaÁ;±f;–s";wÕ¹;OŠ>;9";;;X«;x;Œ/x;Šaf;rhó;7¼C:Ð6æ7ýþKºÚÛ6»Nrj»ŒÀÒ»¨ e»¶lÈ»·$4»®\…»¡Û»œ`»«Û»ÔÀϼÝô¼[’¼£<¼$䔼0{l¼?! ¼I3¼J€R¼B£¼.¯¸¼¹»çÈ »ÒêʻՊ.»ÑÀ‚²»±üŸ»²Ÿd»¹/!»·m^»²Ë»¸²©»ÉÆ»Ï{Æ»Æ"p»º00»³%,»°œ÷»´':»À^V»ÙAS¼$#¼²¼,ó¼1T}¼-2¼'Ž¿¼%õ¦¼&úT¼%Êp¼ žÓ¼1º¼:¼ •ú¼ bÿ¼z¼,03¼@ß¼K-j¼HŸ?¼<ƒO¼*m”¼{/»Úo§»‹¥õ» PºXu93’e9Ú¥@:è:* ö:Òw;"_;‘JV;Ó«';ëÿì;Ú;;¾É};©½;™¨\;”DE;¡N;» P;Òüí;ÞSw;Þ³ ;Ýn ;à±A;é5î;ôð;;ÿ³™<[<±Ÿ<uÍ<;êb»;ËXª;°û-;¥Î­;¯9l;ÁêÔ;˘7;ò7;®œ÷;©'; ¤Þ;´D-;ÏëI;ñ<š<]/;øj;à K;ËÜ;´ÆE;œ”¢;‡¥ ;o«Š;]þ©;gu;…`À;—nµ;›²u;·Ó;eOj;ò|:Árºbì» ÈÊ»` »”¼»°›»À#o»ÀD»µ—“»©Äu»«¾‹»ÅZQ»òi¼½\¼³G¼(`¼&+ÿ¼4¸¼BgʼH¥@¼E³¼7š­¼kº¼2æ»ØBÈ»Ìï»Ç®Ý»º¯»¬F»«ò»´hG»¶ðÏ»¯BP»­$N»¹š®»Å黿¤µ»°gZ»¤Ïù» U»¤Jü»²Î¸»ÌœT»ó=ë¼¾I¼'¼1ÿ¼/rV¼(¬Ö¼#•ø¼"ž¼"¸ÿ¼ 4¼ðܼ·¨¼ h©¼SÖ¼ _B¼ ª¼-¼<½}¼@Ñ…¼9ÐL¼,ÅA¼¾»ü=M»´\\»V'ºÀñŠ¹Òdº8ôÆ: Ž¶:o;Õ:§ëo;áw;ÒÆ<ù <_;äÒ[;Íòœ;ÀLã;¸‰’;»C½;ÊmV;ÝoL;çɘ;å¿Ê;߯ý;Þ8;áí ;éqÖ;ò÷;üì™<“ç<bT< l-<¯@;뎓;Ð/ë;½Àä;¾ã;Ï.a;ßir;Þ–!;ɨî;¯g;§u¤;¹L¸;Õäê;õ,< €]<ÿ< ¶y;úÏm;å/ï;ÒZ;¾…¿;¬ta;_;Žcà;†¦¹; à;¡ëT;­ò;¤Q+;Š©Ÿ;Sðî;³:Ìfº„Ò¦»›»mH·»šŸƒ»·ëÕ»ÆÑó»Äºß»¸í¬»²V»¼Ù€»Üiu¼fŸ¼*Ƽ{¼ª–¼*8¼9çμDì7¼DÂq¼:ôC¼(˜¼ >˜»é*‰»Îî=»ÂöÁ»´¤»¦D[»£ºÞ»­ªÜ»µÈ»°ä¤»¨Ú»­í»ºy+»º+C»©À»— »nG»ŽWà»\É»º´»áÄæ¼¢z¼)/¼,¼J¼.m©¼(w¼!CP¼Y™¼í×¼°Û¼ŽH¼l¼“ÿ¼:ê¼=­¼ #&¼Q¼*rǼ3Î÷¼1÷#¼)2r¼úŠ¼ õx»ÚFz»• ã»)vMºœ¾¹ÊO99•Tä:‡ø:Úxý;$Åò;‹_ ;Õ£X<²M< ZÞ<|¹;êè;Ý6­;×tó;Ö á;Û^;æNR;î&¾;ë_#;â}8;ÝW†;Ýë¦;áuØ;çot;ðŒh;ý"<ñî< ‰Ê< Ê <y;íÖš;Ù†7;ÑäŠ;Ü—ª;ï3j;ö4O;æeP;Æ~×;°Ø©;ºj;Ø£Q;ø'w< Ÿ‹<âà<h< Ë€<3Q;ï¤n;ßÚa;ÑåX;ÆÃØ;¸–¼;§Û";¢¥;­ýî;½$u;»©¿;¥ T;„uÚ;Bz¥:Ú <8Ú<ºµ¬K»*Év»s)9»M$»¹¾5»Åñq»Áл¸îQ»¹»Él6»ê ¼é&¼.Ù¼r’¼"ë*¼1[ù¼?û¸¼Dw¼<©¼,Œr¼ã»þ˜»Úû†»ÆÎ&»´b廢<Å»›ÞÔ»¤öñ»±æ2»³V"»ªY{»¨Ñ»±±(»µÎt»§n»³é»zÅ»mKÀ»Å÷»Ÿ«b»ÊØûüv¼I]¼$ò6¼)EG¼$Õ ¼9„¼'μ}¼¶¼¼¦ ¼¾¼©å¼ .¼?!¼9¼ ¼ ¼#¼&#¥¼!.¼n«¼mâ»õç›»¼a»x”[» ½~ºˆƒ¹0U:p ;Q;>F_;Œ¶;Й³<ÂÖ<‘ê<vT;ò 5;í—Ã;í@;í’£;ð"þ;ó³;ï •;å¿S;Þtf;݇W;Þň;àâ0;æ&;ñä—<$R< d~< `¿< ZØ<}i;ô~;ésg;ì¯B;üm<2L;ÿîö;àù*;¿Ã|;º¼Ë;ÖÛ;ù_< Ú<£< <×ú< k–<\?<,!;õ–Û;ïM‡;æÕ;ÔZ[;ÁÆz;¿üD;ÌQû;Ñ€{;Àá0; Ó°;|¯};1Nr:¥¡~¹‘2©ºÌ^t»)‡4»l÷ß»™%»³&»¼š »¹d¤»µˆi»¹â+»ËŸ>5L>$Ý¡>(¸·>ªq> H`=ëM”=æ…Æ> Ù>1¨l>PÁH>Z7ä>Tâ:>PMs>UrŽ>c¸>q“>{’Z>1i>ƒ1š>X>r„>^»E>QZ¹>NL>SÑ>`!Ï>{²>•Š7>³ª„>Îâü>Ýbù>Øé>Ãn<>«ƒg>¦ñr>Šî>ô·o?-?‡Û?aP? ¥ ? Ò? }J?ã˜?o?›C?âZ?ß,? ¹÷?_j?o?ë×?3ã›?O5F?aó+?iGò?f¹b?^6+?Uôß?THs?Z¦?b—­?k†c?sOœ?kÝõ?f½?YÀ?T:É?[„r?h$}?m5x?f¼ö?\R¡?TúT?Oäž?Hjj?üí>í&á>ÝþB>Éh>²Å£>Ÿ?¶>­á>Šžç>”ó­>·ß;>øp-?&€Ê?Fãú?Fqž?%Aô>öoå>»—¿>ŸÐœ>”¶>2>’'¼>ž`Ø>°d>¿=Ü>Á¶>·ê>§cÆ>•ŽY>ƒ®T>lÎr>gðÄ>yüü>ŠVY>”oœ>˜§á>—ј>”k>Ž ¯>„ÿ>s~r>]2/>Iø>=Ä_><"L>@K×>> >/hà>]™>2ê>³ú>"ÐÉ>ï4>ŠQ=òè=×…ä=ë°•>*>@üÒ>Y4ë>[\X>U-£>UAÆ>_òE>p(ë>}¾ >‚þ¡>…‹ý>…’Q>€–t>nó°>^Fí>W…G>Zžo>d­0>y/ã>Á$>«£>Éq¢>Þðµ>ãM'>Ó»>¹#|>§àè>³&Š>Ü'?Ѥ?’s?~?’? Wp?æ;? Ä'?Á?[?è ?ú>?ô?,²>ûÇL?Ñi?íÛ>Ü€1>ÏÝû>À_É>­K>š””>‹~‰>˜ú>‚P³>”à=>¾¥ê>ÿ;ª?!F†?/äb?ÌK>ù´_>º&S>–lö>‡‘Ä>U>€î®>ˆ”Á>—àÉ>©(>²¡:>®‚ž> ûÎ>ÛÝ>€£²>d^^>Tª®>Yê@>nÿ¼>ƒ?±>‹oÒ>Ž[O>Œ…¦>‡ „>€A—>n.»>\„>MŸ>B>f>=‡ð>>þö>=õ>1¯ >TY>Ô>Ú:>¡ª>ç> @r=ð‡È=É»q=Âݤ=îÉS> €—>F#P>V$Ë>T«V>QäÔ>X >fг>võ€>€õÁ>ƒëÇ>…~>‚Ú>wãt>fÇL>\tå>]V>e­á>u3>ˆ£)>Ÿ8>»\>ÔÌ>àË@>Ù‚z>Á‰æ>¨_Þ>¢×2>»¡‰>èù@? 9`? ?”3?.?¬>ÿ¡û? y? y? ¾¿?Î>û»€>è"~>ÜvE>àÚW>û»é?¨˜?-à??Øë?I^˜?IìU<>ÓŸÝ>Ála>µ®{>ªÛ>^>Ð >€ –>iü*>_á®>m¾¹>Ž‘ã>¸ëo>ï8«? ë? ?>ê W>±ù™>ŠÄF>qfè>cº>_>g>fqÔ>|BP>Ž#½>›þª>ŸŽ>–l >ˆi™>tm>XÝ>CÖð>=*R>GZð>[DÞ>or>}$‰>€”>y¬>m’ô>^åÖ>QÓ!>HÏ>B‹>=³Þ>=5ú><+ð>2A`>èË> SJ>7<>#?> Zê>'=æ\=»”y=¡ƒ=¯îæ=ï[È>"¢ï>Aq>K5‘>Jz¡>M+Ô>XI>hWæ>v >}ø>€jÎ>á‚>woê>hÓ„>\†>Z4±>a>nÈ7>‘¾>‘ö…>¨ûw>ÁÀ˜>Ó§>ÔC>ÂuŽ>§m_>•I‰>›e¸>º&±>á_þ>ü-Ñ?kè>õÅú>èU§>áÒ3>ã÷U>êQ<>í£ã>èE¼>Ù >Åfa>µÈb>°éF>¼µ¡>Û†2?¤º?cå?$Dµ?)ìk?'G? æ—?½?¦Á?ŠV?%«ó?./?O? NÚ? Æd? Áµ?‚f?O?ª?úÃ?uÌ?ïÝ>ÿm>ñ€x>Þ,Æ>È>²Žñ>¡1Ø>•—>mô>„Ìi>u N>_–ü>K4Ô>;·]>:z>P¨Û>€Ø¡>¥4A>Ê(·>Ù€>ÆÖì>Ÿ~³>x^€>QÌa>C)å>>Ji>@i>Mo`>f>qV>Š>m>ˆƒ>{ 5>aÞŽ>IÉð>4M7>&HP>%ˆ>0Z>Aï>Sô>^”8>]¦Á>T>S>H>>Õ>;ÿ>;"ì>:âg>:±5>9˧>2Æ>kÒ>M>=ìÐÃ=èÊ=ôS„=ò4#=ÖxA=¬°¦=ˆzÓ=}‡X=¡ÌA=íù¯>,>6¦>=oƒ>@ù>GyÖ>TêÂ>c‚K>m@²>q=\>q­¡>mƒ´>c2>>WMK>RS{>WÙ>dlŒ>uI>†n>–¬$>«eu>¾"o>Å–¥>»›ô>£˜J>‹>Ï+>Ž¼->«[>ÆžO>Ô!n>Ñô>ÈLï>ÀJd>¾+ì>ÀŽå>Â7û>½¼b>°½y>ë >ŒN`>ü¾>‚ò>“>°™¡>Ò÷P>ðÿ\?:?ýa?êð>ú:E>õ…>÷×>þäŽ?‚^? úJ>ÖÛE>Ù)Ì>Õ•B>ÖGb>ß?›>ê.>ì΢>å4$>Ú«>Ñe>ʳƒ>ÁÇé>³¼½>¡íg>Ýi>€ÿ>k3>\°™>QÍZ>F•š>9f>)Ìê>|>\‰>¶1>-€Z>Wõñ>…Ù|>˜©>—G‹>‚ù>RƒÎ>19>#šj>ù > qØ>'$¸>7?o>Od>e@^>l¤ë>a‰>Mu>8P>$£[>)Ð> ò> ’>s~>'"g>6÷X>=¼>7Ä1>-Oœ>%N>%Án>,®>39>65<>6|‰>1Qu>!Ê> 0=â©!=Ëi¡=Îö-=Ôa‹=ëB=ž©=m‘=;Øq=LÚ=›ƒ =ìXÌ>˜L>*4>0ŽÎ>6D5>@>M2¾>X`>]¡A>^8Ô>\Ò>Uð$>L˜Þ>Fc$>IŠ>U‚É>e—³>wÆ«>‡2,>–;>¦²ä>±¥¡>®¶ >œb >ƒþ>`·î>[g¤>vr>ùÖ> ' >¥dˆ>¡ùõ>œe3>™l,>™–>™ >•%Z>‰–F>oì>JÞž>/£>$^>.RN>P;o>Lh>›ÉÓ>±Îq>¾¶'>ÀÙ`>¼& >·[þ>¶nƒ>¹3U>¿õÈ>ËÁÓ>šÞv>œB8>\Þ>£‡ð>­@8>³•ß>±‘$>©Í >¢#>œ­ñ>—x>šH>•º>a\>F§>2î£>%šJ>ì>5›>ší>‘ë=õ«4=Ù4Ý=͇’=ßê>ì>$…Æ>A²õ>M+>?D>$‰>|/>—>­~>4'> w>a7>#ß->7õ>FD>E·>8qP>&oÌ>¸>‘‡=ïÆÉ=âí¸=æN´=û[–> Æé>äÔ>Tä> &> ¡> «>”‡>%±,>.p&>1F^>/á>#ò(> ýè=å›j=»Í0=®Ò§=³ñÏ=®´=’²û=WŒ{=o½=Ó=9O=Ÿ^P=í{> ¥>F>%Ž{>,r{>6Z >Aß>G·T>HÈ>FP>B›‡>< g>7û>8@H>BÜ£>Slx>dû·>v>„Õ$>‘ C>œ=f>žx3>’†ó>x:à>K0&>1R>1C>Eg>^…Ú>oL*>s=Ù>p(ë>m >n™¼>nb+>f>Q$ >0ŠÀ> :Ì=×´ò=±‰]=¨µÆ=ÄPE>5#>)­>P›>oÏŠ>€ò>[.>„Ç>}È…>$B>‚X>‰`ƒ>“¯æ>L>V¨æ>]§>h ÿ>yhý>„ªå>†ä×>‚Ê >yOe>p!y>hüœ>]œE>I‘>/¹>ÃS>pF=õoÙ=å 5=Ü"æ=Ù4†=ÓKƒ=ÁE=¤b=Šê=…—X=˜=¹±x=ÞO/=öiÅ=õñ =ãí™=Ô…=ÑY=ØK=á •=é-=ô¥®>lq>ãÈ>!t >(X\>#4&>”&>O=ì~M=Ñ›F=½_†=³Œ±=¹>4=Б°=í[$=ú%°=ðÃ=áÃÊ=âÄ’=üù>•=>"„M>)|•>*þ>#øK>d÷=òŠ=¼­œ=œ"ô=—¢=˜^=ˆ«=M‘=«:<·EU<ÔÅ=H0=®0=ò]Ë> Z¾>7™>>f>!}˜>)ô¨>1`>2Ž>/™ë>+þt>(oÈ>$á2>%7‹>.'>>•%>Q•²>b#¸>pˆ>ŠÓ>ˆ¶Ó>>‡Yµ>k>>}->(>5>rñ>ø©> >)%§>,º¸>/@D>3š>6–‹>1E\>s;>û)=»ç–=pNª=Qz<³÷†<µQ$=ŒÊ=€SC=½f=ö¤>œÁ>¦[> -U>#(®>%ˆÊ>'´ü>.4> È > s> ¿>0Ú7>B–ã>M I>Kˆz>B•Ù>:`>5v“>/ƒ~>"…›> —{=îYQ=Í›=¸Ö=ª<Ø=ŸåS=@é=êè=•Èý=|‚-==Æ¢= =[Å=1Õ=]8„=€f=‡àQ=ˆx=Œ§O=™‹a=«KT=»óÆ=ȯ=ÓJ^=à#ò=ñÒ>ŽV> c÷> Ïê>Øh=ðA=Ò¤=·¯õ=¡,:=°Ê=ŠmY=”Ùl=­“˜= =ÁÖ…=´LO=°ãh=Ès'=öÈ<>?Ç>éE>"RZ> Nl>m6>m–=Ê´m=šŒü;ØcÙ;Ö³Ñ;éE;÷.h;é0L;ÇTÈ;« C; îg;¥@V;¯ÍŸ;µPo;¯‘C;¨·;;¬d;¹ZG;ÌAå;ãa;ù†™<b¸<¸Ÿ;÷˜;ÝLs;ʳ¼;ÄK;¿/);²9;§ÉŠ;³d;ÒÒ¸;ð#ò;ÿð< 9õ<Jz<%“<<_C;Ú©A;³X§;©ØX;¾#À;âh<ëÏ<Ex<³<˜ê<¹Q<-|<5uŒ9 Œ<è < S< Õ;ᯱ;¥AD;{wª;e”;qh¢;ì;€À;…—Ä;™;¹¢A;Ø(b;çŒÃ;ð‘g<A<8´<*ý·<:›;Èê%;¶cÕ;¸ `;É„n;ÞÕ¼;èѾ;çO;ᇔ;Ø¢É;Ò™`;Øý;æyY;ô{Y;øH£;ìðQ;ÚB•;ίL;Ð ";Ô‰›;Íò¯;¿Ë;»ÐZ;Ì™;ã«ì;õ½J<—Ë<Þ<ñç<þá;÷ƒ;»¯‰;–º;•õç;²Òa;Û §<lÑ<ÎÐ<¶ò<Å<.¨<-Gx^< ;º<k<(A5<&—<TÚ<¹Ô<€h<@<(1ñ<'x“<š<F<е<) S<7eq)<@ƒ…<9=D<14<( –;Ð$ï;årã;è§;ÕÃ;±u;–*ü;’ä“;¡8÷;³~‚;¾]8;¾'t;¸ï¹;¸:%;¿¤ü;ƃf;¿H[;ªm;˜O”;–—i;¦4 ;¿¾v;ÙÒß;ék×;à*Ä;¸q®;ƒnÜ;<‘”;5žä;i ;™J;¼î¢;ÞŽ—;÷H;ÿLµ;ýAm<Ç< .n<1< ƒ<" <—»<{¤<ò;ýÈÃ;ÿ—±<8<þ<Ç™;ò¿;Øò{;½ßµ;¡Lè;}èm:íœ8I&ιí]ˆº”G ºúçO»*¤^»FMµ»L:»:œ»„`ºJdñ:P®•; Ýw;<ßL;<¸;+Ø ;7Á±;ii¢;“_\;ª²Ì;´Ýš;³J/;®£;²É;Åå;ÞÚ;îs¢;í0@;ãçn;æ6;ü7< óI<­<<ˆ€< £M< Ä]<„3<8z<t{<}0v»5Sñ» @r» 2»»G>Ù»šdN»Ö™d¼"ʼ io¼ ¬ô¼¦»ò1²»ç r»ä—»ë;ë»úF…¼I¼ …÷¼øƒ»û}лè »Þh´»à1‹»ë‚»ö S»ùÃ%»õ£?»î¼Î»â)œ»È²»Ÿ:þ»Zö8ºúù ¹þc":®sO;^&;©ÖÏ;ÜÏu<M¤<<‰<"b+<ž–<‡J<Áà<ÿ–< ¸©<øð<¾ó;ÿä¨;÷ô¥;ñ:;îú«;ñ)Í;ðXq;ëZ‘;éóB;ñ‚;ÿÜ<â&< ¹Ú< :< ¦< Æê<u<çW<qœ<å<;;øìC;ÓÀx;ÆRç;Ü”Ÿ<’<²´<Ÿ <¬[<"9®<$=ó<&ÆO<'|<&Ž<( F<*Ô<#Ó0< ç<é`<mR<qí;ùI;Ù0};¶Ù¥;˜Å;h;ŸO:~ˆ8Ñnyº ¿º¤[q»ž<»P§å»{sI»†¥@»„@»xh¢»€v»¢¼Á»ÜÖܼ 7Ù¼!€¼2þj¼=ê2¼;NS¼*å¼`¼ ¾`¼x­»ôu»ÝyÈ»¹ñà»™…â»R»šMo»©Mr»®K,»¬M/»®MŠ»±;®»¦F»ˆü%»JÑ#»¸ºë’»p¤»i;þ»±l»æ®¼$‚¼ǧ»òßĻݺù»Ï Í»ÊT»Ïg»Ý»‘»ôA ¼®F¼©˜¼È¸»ëI»ØJ»ÎË»ÎÞ°»Ù ¢»âÝ»ãÁN»ÝB¦»Óx»ÃŒ¦»¨mj»~4—»–кyW:K§ã;AÒ©;§‰!;â…±< Òä<Žø<"[d< < ¢< –\< "¢< OÝ< zc<¶<X#;ü¶K;ûf(;ý¨;üt–;õë ;ð*Í;ó&Â;ÿ-&<‹< Ak<8h< Qú<öÔ<"<%(<YJ<*É<@9<Ó¾;àÈ2;ÉE¦;ÑSª;ó€=< õ¡<½,<R<"“Ù<&©Ô<+ïZ<0-~<1 ý<2<5«<4õ´<)–P<2<F<‰<< %;÷€(;ÔÆ’;¶Š6;™û_;lL;»u:µ¡:5È8æ'º3²ºßÙ»,ù¸»S†#»\¸»I¿Ç»4ÉS»Qe7»œ„»ã<æ¼_»¼&:€¼4û¼9ÛÚ¼0V¼“μ ̵¼Â’¼^»ô¾[»ÖÌê»®¦U»“ ¦»œ¿»»j»¨Ñ«»«"Ø»¬gÕ»°‘!»¬{5»–Wi»i³8»*¡g»nºøªu»0ä_»Œ?ʻĸ}»é´L»òxûå‘»Ï{ˆ»¼¸‚»´0‡»µò»Á¹…»Ø@»ô#¬¼½O¼ÿ»òæm»Û‹Ÿ»ÈË»½ g»¿{Þ»Ëu»Ò{ý»Î&»Á©O»³X»¢ :»…"{»6anº¯w9œlþ;7;™ÆÇ;Þ³?< 6ã<HI<;â<£_<É¡< ¹<½Ü<“<íé<;ø}Ä;öÄ.<!ä<À<÷V<·š<ªz<•´<±ï<Îc<k"<ñ$<tF< *a;íV;ÏØÓ;Ë£>;âü‹<j;<5U<H<ú<·h<a’< ÅJ<E<?Ÿ<{ÿ<Ä<fç<$<%±<²<—Ë<+&<>¡<N<bý<Ýk< ¡;ázç;Î+Z;Ñ };åH±<®ò< µV<<%;<'Ð<0ÇÓ<9ÒJ<>y«<@Ïe »Wúõ»E#»9‰»>«Ò»lNç»›ÿ€»º%‡»ÂÖ»»D¼»­o »ŸüU»—\‡»•O˜»›I>»®ÿ»Î¸6»ò “¼–»ÿ3»è[†»Ì/»±o©»¢óS»¥õÍ»­èþ»¨ P»wR»g’ »=(#» ººôà¹ç:ªž;?c‡;Gâ;௼<Ðö<,<6\< ùó<¨€<6V<†(<U< º<Yv<hý<”O<ý<à÷<ëõ< i<Òl<Ý<êB<K<ðÏ<Å<Ú±< ÒJ< çå<<~<¾Ï<`²<;<&f;ê¿‹;Òw ;΂;ÛZ";ñ ›<Žƒ<3I<â< U1<*„<5rO<<å¸<@ ÓÙ!<5Ú<-¿¸<"wÙ<ƒ><¦;ëm¿;Þþ»;Ò;¿¦;¦¥—;ˆÌ;N_5; éŽ:†K72=Oº=ÈMºtïÒº –»8©Ôº=…µ=„ T={j´=Iß=U<ž2Ì<ƒ³õ<ô\~=y0ç=Æ…Õ=ûž¥> Ö]> a>y>÷>§>}>D„>G2>>b>Ã>:Ï>'äÚ>O\Ô>f‘^>r:Æ>|I—>x@Ã>^¨ì>7'>ö?=ækŸ=Ç‹=ÀÕ³=Ì/æ=Ü•ú=é³å=õ&->à> š˜> Ûl=ú /=ÇLî=„½§=A;xO¼pÞž¼¾^®¼ ¾å»šd¢<„"Æ=?«=lÎ=’}ò=¥l=µ’a=ÂÇâ=É€{=Ï «=Þä«=ù“—=£Ú^=¼“;=×"=ù->µ·>µf>#G\>ì>ûJ>GC>tC>p×=ð*=ÇK:=¤õ=‘v–=…ù=vÃê=iÌO=jŠ=f5Å=FÁ= ƒ<”æ·<"K”<7Ž<’»¨<Êm=<í==¨Ñ=Õ =KÚ@=Y=št¢=®Y=¼Qñ=Ç›c=Òeí=Ýã==ê?ê=òEû=í 0=ظ+=¼«à=¡(‚=‰ñØ=nõ\=V;k=U(j=t%¯=oO=—=¯=”ä=…ʶ=–ˆç=ÄwÈ=üSñ>€B>sÆ>èK>Ы>a0=ÞB7=§Z=í =m•=h±{=IÇ—=•<¤z´,¤>Ý—>ÿ„>L=>ý<> Ñ>E>ï =øe¯=õä?=ø¥ >S(>M¥>%HS>;™>KH>T1Ú>[bâ>c4>c¼Ã>S8=>2ˆÜ> 2½=ÚR»=«J/=¸=†¼Ä=D=˜ø]=¥»­=¶K9=Ëb=׌\=ËŒº=£Àh=RD <Ÿ Ǽpí½·[½?G£½R ½6J¼ù9P¼i¨¿:€Áþ<^u©<ÂK= ë;=55ž=QÚ3=^è¡=pAÓ=ŠÓÚ=b¥Ü=mÊ=¯[=×2=ûØ>È>$ã=ÿaÍ=ó—=îKû=èiP=ÕÙ=²ç9=Ì0=tŸÈ=boº=Rôë=@Õ‰=7Ö=4{==!œ<ßzP<(½»xô4¼6»È±·{ìÀ;¨cN<Ï<„Pì<éøs=6Ä=u¹=•R=©æ!=¸Y=Á2À=Æo=ÉŠÃ=Îî=΋=Â…'=ªdj=Ž–™=lÌw=GBI=+I0=ݤ=*=KuH=bî…=Y^í=DžÜ=Tóƒ=’n=ÎÆî><8> 'm>+)>6W>e=îT=»Ž=‹ïì=gÿ=]p=K©=M`<»â” |=÷š#=ëŸ:=êÉò=ïO\=ìÝš=ßí=Ò7‡=ÍÈ=Ïφ=Ú=ñ~> «Ó>$†û>8…&>D,´>J?n>O¹(>R[A>I">/ݹ>ZÁ=Ý8œ=©;Ï=w=RUê=DÁË=P=dîž=€R-=”eŸ=¨F±=ªM;=ñL=>Zà<%;¼5£z½Åk½^#½…$“½…FÁ½dìè½2uJ½Ö缿UǼ|œô»ÊY;°¹‚A>Æç>JZ>—9=óB=Ì–ä=ø=vR==\èb=Nþc=)ãâ<Ü’ï/S=÷½=Û¥v=Í—"=ÍÀ=ÍÏQ=í]=³©=©Ãz=ª6 =²i=ÄÈ=çC³> ¥1>#8æ>3">;>@ (>CÝ>@™>.Bp>—}=ç*K=³¾b=ˆÿR=O®Ø=*uú=$A=0°t=D/¹=a–ð=„–—=Rp=ƒÉÝ=<•MÊ<æþ6=5U}=€¡=¨1=ËEü=ݲ[=Ú K=Èê|=ºÓ=´\e=¯¿=Ÿ>­=ƒ¨=R …=;íH=<±«=9u]=(w1= õ= Á<ÉÛ«<:”&»¿~ú¼ª‘¼åд¼ÛÚw¼¨?`¼Xí"»Í¼Œ;1H<‚A›=7w=Gt=ƒ æ=œ©=­7ô=²×ž=­3=¡óƒ=š ‰=”ê_=‰E›=g…B=6W=“«<ëL,<Éη<¼s)<Ì3ù<é†G<è4]<»f_< ’_<í¾4=^—¹=±÷W=ãõ!=õÁ=ó)=ðã=êØÓ=ÓÜ‘=­Ý=ˆ%¢=hdO=Wü=9”‘=Ç»<ƒ„“;Â<s=Yô=–Í=ìoS> ¾¾>0=Ù·”=¸™·=®j =¯'ï=ª}=›v”=Õ!=Š%S=¤¬=w=·ÚJ=ã'¼> Ù0><'>*¼€>1@>6|3>7‚‡>,å?>Õ=ô?T=¶…=™‚Á=lÏ=8ãÍ=!™="™=.ûE=@á=[Æ°=xb=tÑÄ=@š<Ôa":ÿ˜ò¼¯èR½.LÕ½vL꽑pö½’0A½óž½ajˆ½Q®€½OÀ½I§Ú½0òؽËç¼¾œƒ¼‚:y¼§Ð:– ã¼…—ò¼äܼÿ̼߅t¼Ÿµ¼:E»ZðÝ;á>Á<§{à="=Vðì=Š_= ŽS=ªá¨=§S˜=˜Ë"=‰Y¬=€(Ü=oͧ=P¶ã=%Ô<þ©S<Íô<°“i<¡m<¡VÁ<¬ï<¥´\:> ËL=å[µ=¯Ô=“.é=X==…Ð_=oÇì=`°=eHŠ=xFj=Žþ6=±P=á,q> g>æ-> Ï>(Ñ>-’>*R:>éÔ>A==Òe–=«<^=Š[=](Å=8ÔO=.E|=4Žñ==›À=J"Ø=]Ï=dâv=D×r<ý†<}¼C$½k½M-ÝA½r)½ƒ³2½e=è½T¶½[òŸ½hy½cbнH91½#rª½S¼Á¼OÐÖ:¨1a<Îß–=/[˜=wRÁ=žPñ=ºHt=Æäô=¿g»=ªÛ=˜@×=NA=ˆÁŽ=sTh=FHS=%6=$iê=8Z£=CP=6µH=ƒ<û`²<¬#ï;ø}ż”P¼µÃ¼õ;Û¼õüö¼Äc¼|5»ï°:#Àø<1É"<Ư=#ÆÜ=fST=Û=Ÿ-ß= ?6=“J=~‚ü=`7`=N½{=9á^=Ôþ<ë*<ºÕ<<££-<˜1<‘á&<2<|(+<RŽ9Ù»™º7¡¢<[îS=,Ër=™gÉ=Ŭ5=ÎR=Ãá =¼œ‹=¸ß÷=®¦=š'=†i†=rñ·=Z®ˆ=.ü<Ñ£k;ïö0»gúºiuL<ÈòÆ=Žï!=íû> f”=õˆ=±:=~4”=]Þ=`P=\Ò=HD=6˜¹=5±‹=CœI=]Ì•=‡ 4=®Fe=Ý;Ú>)¥>_w>rq> …¸>$x|>™>îÎ=áo–=º®ø=œ’þ=ƒi=]à“=IuŒ=Ia=O=QÃ=Uªü=Z4=G‡´=<ˆÏ»Jè%¼³ÈÚ½ ¢ê½\éê½€K:½}n±½_ѽJ–Z½Rkn½k° ½{½¥½sUž½Xà^½:¢€½EÀ¼Ó<í¼$ŠÁ;÷¾á<•|=‡þ=^¡¨=éÉ=«^3=»Ú=ºÌ:=¨õ›=’&ã=ƒ/…=w×Õ=cC5=>ï=9w=è=(žT=BèL=GH =3Xÿ=ÍA<ÜŒÁ<{!ë:|ƒ¼Z[ѼÅ'¹¼é(ѼÕ"z¼š0å¼0o%»ƒù‹;LNÓ~<§Â =X#Ø=¤ =º3*=², =¤C=ã„=šß¨=“í?=‰¢s=ò•=jv¹=C¦\=‚Ó<@µQ»È*J¼SB)¹]'=ñ´=¬ï£=÷Èó=ø•>=¹Ê‘=h²¾="×=Ô =!'q=ÊÌ=WT= ž»=eÒ=-©í=NÌ©=ƒhŒ=«fÛ=ÔÕ>=óµ³>Ë>èÚ>£#>Ï)> lñ==Ç8N=©îI=“Åx=ã=jÐO=dè¼=iŸ£=hŠ[=`\%=Y^Ö=JSh=!c<¾eL;¥Æ¼N<¼ì`½1!Ľ\Ô½gTrH½<Æd½?å½]*½~Bû½…9ý~á­½h‘½KAâ½å¼³Tµºï=Ä=íÕ=L ˜=…ÿ>= T=±^=´¦ =¦û»=`=u)=_ÿÿ=Pzç=4ût=>É=Ú=ÏQ=4ýý=KÅ´=Fk«=+¼ß=ûb<»oæ<*ÄG»SN<¼zÏ̼½ Ê¼Ì ¼«ï¼hT¼‚*»Qío;yñt=‡ƒ”=„(å=gÁ=>Ü =!¬w=B =åÇ<á…<´£©<›&{<—!³<—sz<ÞA;š€;•‚;„_ß;o -;dN;hl×;~ßê;ŽÊÕ;›d3;š­Ÿ;Ó³;9t*;‚4;ëø;J¡; 7;“!É;—PV;‘™R;Špí;‰¯;ŒŒæ;†œó;a7G;*m_;+;7?V;qyd;ˆ°Ï;ƒZà;^§;)t:þI:æTQ; oj;5éì;kt;“é;¯â ;¿„ ;¾,†;´­;«ÂL;¥;õ:;“[ö;„O¤;hçÜ;[-œ;l8;†¥O;‘R™;‰Ù;„WI;]<8;+iñ;0d:¤E•9MþºŒiÜ»ÑT»LË3»kGß»zç⻃§í»Ž £»›á㻨O»ªC »“3Ü»;^÷:J;@:ÇùN:®öu:Zž7¼}T8êQ:;£:Áb; ;5Ö;;UEP;rwé;‰j¶;š„³;©î[;µŠ¦;¾]¼;ÈéD;Ù^;ñ_4<aŒ< ë5<Õì;òVª;å@(;êSˆ;÷l<„ <ä.< µƒ<h<xå<Êú<%è?<3+<<“ý!ƒ;Q·:øx:Úw*:å Ê; ®S;4EJ;h'q;Á;¦Ö¹;¬Ð¾;¥ì;˜bõ;‹œ¬;€ ;j ¿;P«¬;37ê;íC;*þ|;O&\;mUx;p£à;YÍü;/1Á:÷uh:¡¥1:<Ž¸%n纜-õ»MCü»r0í»ƒ p»ˆ0t»Ç}»œzÙ»ªøv»´é‡»¬3þ»ƒK»ŒÐ¸£º:Š ‰:š™ú:¼<¹¶-‡º1^X¹­Â½9Ó):¡"Y;k;/v¡;Tì/;viJ;Š2o;—w;¤8O;±É®;ÁZã;ÒöQ;çEh;þßY<|<Ã=;ûã†;éOí;æî·;ðRÍ;ùw¦<Èç<i«< PP<Ù<ÄO<‘ÿ<*Ž~<4—²<:8[<:x<2Q<  < c»;èr£;ÁY0; „‡;Šïƒ;†‰;†1¹;dEa:ô˜¹½½»Ûd»3Ij»ź-": )s:×þ€;)Th;[F;t_;xîË;w=‹;o{u;_Ù±;L[};=éÔ;?¤u;F3º;/¨œ:öÚw:ª|Q:»: ;Ë|;J;pà;y)°;i³";PŒÉ;AAú;DO;E_¼;'œ´:ßš :™Â:ÄUå; :;,¤;­®;^r:ÞZ :Ï7':Γ‰:ßµQ;kß;0;d~ã;‹Vk;˜ÓÛ;—;‹§-;xÔ_;Y¢;=g;$:Æ; ìú:欂:êŸ;º;=Ò;JUq;6Âx; à:¯Gg:‹9$«•¹œ–º—˜H»U·»>µ±»fãt»€°»‡HB»ŽŽ©»š¸¸»©¼´»·b¢»º@ð»¡Nc»P:$º“8<9¼$o:^“Û9ÑW«º }~ºž"íº›½Eº‰&9¨¡a:¢óú;Óš;5Àð;[ø˜;zGG;ˆ¾{;” ã;¢ì;¶õ»;ÍÁS;ã,¡;÷²<f<ùÐ<ÿ;ó;ëq˜;ñëÕ;úe << â< 0Í</<(«<ÄÂ<%CÊ68;`º;xR;…ñ’;“oÖ;¨Œ°;ÄPç;ß~‡;ôº¼<ç<A³<L;ýD);óz¹;ø= <ù<RÖ<!5< Ýž<q˜<!ð<ª<"¤d<+@!<1ð&<4?Ž<0 <"<Ï< øQ;íæÝ;ÇÝ9;¥×½;†.;`?;XÈ;awà;I²Ë:ÛìD¹ô¼N»b»=Þ»””º!ý€: Ò:•Ÿ:ꦙ;(¼J;[NÐ;}¿ò;†ïê;„€:;j.Z;4^ö:úÛŠ:Ì2 :âÚô:ð°:Áöu:ŠLa:‘jm:á,; ä„;;ÿ±;<\´;+¸F;Ð3:þ›:ûH«;ºY:æs :ŒH]:/ :AÕ>:­‰í:Æ“:Ë:o×:v€á:‘„ù:—Íå:“^:©CŸ:ë@ß;#¤Z;N.•;fóï;iìÌ;Z£ƒ;;ð ;²:Û2Ë:ŸE—:[(:¡³:Pº/:¸}¥;æX;f˜:Ƈ':?v¹umºR^̺úẪºò}P»*í»8 »Uõ»nÿ|»„ü»“>²»¤ö»´€=»¿Dl»¿&ß»¥±ø»`=}ºÕ !º¹É“iº†#ѺþÓÙ»%Pš»BºÊŸ ¹Õ-i:<‰ª:Ø^Á;;AëO;]Àœ;r—;…,M;˜J;´É.;Ö 1;ñ Õ<;u<{p< ó<`3;û³ ;ÿ½¸<3< Îð< ¥g<¸<+<´¯<[æ<"5Ê<(*¤<.½É<2„F<1Mâ<'‡â<p';û··;Ó¯¼;±qå;!Ñ;d¼¤;FÄ;L9I;Rcð;'Ã:pEº_q»òλV¶º”÷9&+:vÉþ:µ`•;©§;:¾¼;m˲;†Ãt;ŠÉ ;€‰J;M|ý;©‚:¥ºÁ:˜á:Ĭf:Ï“:¨:ž:Ë:µ˜;ä4; Ç_;% ;MÜ;Y1:Üÿø:ÅÁ:Î!ß:Î%’:–úå: T•9¹mŸ:J¶:”´:záÉ:Z³9ö¹Ï:-;:R‚:CË:?Cg:‡zi:ÕÑ;$d;7ø‘;I¨k;J4;7¿z;±:Ì5ß:€Ñ: Âð9zò9}÷Ý:5à:«õ±:Ðè:ª\~:"åÙ¹i‚Kº‚Cº·ßrºÅ#Lºä€»=¼»7³Q»UB‹»uô¸»a­»¡¤Á»²Ýv»½`»Á!µ»´â»Ž…]»0ß溺-ºŠYºÅ»oH»Iߣ»PÎë»%Šúº±,¸“Œ:„É¡:î”è;Ž ;?l¿;Xȱ;q1¿;ˆ´;¡ÄU;Äqë;æ´õ;ýL< 7<Ѻ<àU<¶<*“< 7<¹<ÀC<?<~"<\ù<"¨Ô<#F¶<%Ëx<+Ž<0«<2 {<-j<ïC< …°;èx;ÃIÆ; «³;{æQ;G;8I(;Eì_;Cè©; º’9ØŸ?º¤Î̺þ º³  ¹0Ö:S«´:§ƒ:Ù+†;¿Þ;R´];€RS;‹K9;‡n ;f6};!mh:´´ƒ:b€Á:Ž˜œ:Ã#]:Ço:­H:³Vù:è½;;#;ù:îUV:É¿·:ª¦³:¤LD:®:˜§ù:'…R9f.9¿¤=:J)£:ME>9ÃÄ“8™=f9Ÿ9°Ör9±s9orò9®Ý„:KZÍ:·*×;†¼;öZ;0³8;/^;ìo:ÓCS:oSï9ÄV6ÁJ¹ak8ù¸:.š:¤:‹”è:½ž¹#\£ºvºÃ¾‹º×˾ºÜbºþ‹q»w»f˜»6J»]m»…% »œ¶.»°˜$»»­\»¿¶»¹Ùq»¢RB»n1»2Oºé×·»lÞ»:w»lbS»€MË»cn„»Åvºv|f9ªŠW:£À´:÷ÐŒ;n;;8u;Xß*;x=b;Ç;­ùª;Òë@;ñ(L<Gá<Æv<á¢<{›<‰F<N<Ç­<à<Š_<8¨u»r~»”Á»¬M{»¹aB»»Ë&»¸Ý»ªÏ%»)¾»O°Ý»#݇».\™»\{»†¸É»”’V»Œþ»Y3Xºóý¹Ö7W:2rP:´!:ôQå;Sý;=Z›;bÒ";ƒ!;™8;¹qý;ÛëÚ;ò¥Ï;û¦;ÿ Ÿ<¢<€“<hì<Xñ<&"<&ŽE<#…<#Äâ<&W<&-Ö<#P&<"–~<&€m<-w‡<3ž®<3*[<(hT<Ïœ<´ò;×¹Ò;­»;‚›y;?V1;"N†;.šœ;@ÓÙ;.:Óú9—H¹ÿ‹™¹‹~º8‘Ý0ºŒ¹÷»FK­»¢Æì»ÑàÚ»õ4¼ 9¼#t¼ 1J¼Q‡»úû»ù‰ö»øŽ“»åx»»â\»‘PZ»vn»tïb»ƒ„¹»Œyë»’úŸ»•«ð»Žª5»{©l»]䜻Sqæ»NΖ»H¦´»Xân»‡W¥»¦Œ»µ~»³³»ª$î» Ì’»™võ»•‰ã»–kл Ðí»º£ »ßýò»ÿ—¼:ù»ö”e»ÛË»¾Ô»¨bÝ»¢»§aº»¥™»ÐÍ»a8ë»)k»ÒAº¢¿¹²€: Ì@;,ß¼;ˆd-;Á­´<óF<æi<2N<0¯x<$°µ<á«<×\<"Ö<½Ö<É¢<E%<è£<ã´<Ð<Õn<¤P<Gz<Ëß<áà<Œª< Wª<Úé<#b<ã1< ù}< ,i<C<,©<b <6£<KX;ñÈM;×Pþ;Ìû·;Ô©¹;äú;øBt<ç<ªM<$v2;ä‹Ð;Û(É;Ë| ;²‹;Ï";R¿;8:d— ¸{9ººc~¹ýÏ8àg¶:µñ9]$Xº‹kl»6Êu»ŽÃ »·KN»ÜZ»ü˜s¼¶¼ a»ò­x»êǸ»ìn‰»èS8»ÌŸƒ»Ÿþû»wsƒ»[YÀ»b¼¤»vÔÒ»ƒ’»‡K®»ƒÆ²»nÌ»R”Q»KJ»Q0E»N¥ »Mpž»k4­»‘»¥R߼»£º»žw©»šÁH»—ùN»–Ÿ<»šMÏ»ªµ&»ËX}»ð³¼½»ÿÏû»é_»ÍS\»³¥`»¥|0»¥I»¤Á+»“çc»g"°»$¦Úºç^º²¹Ce:“y; Ü';uI;§… ;Ýú< o<'»<Y;ûmA;û‡ô;ýÛ;óF8;Û§&;Ë\×;Î;Û X;êÉ;úDü<Ë< pé<<"È}<0E<8˜r<<áñá¢<1¢<8{< ÎË;ùà;íGI;ëUd;í§r;ì¹Â;ߥ;¿­I;’ØK;Dc4:Ö¸:`̸J·& :ÐL:ŠmW:–Ä :#?U¹ë%ºãµ.»D⻌¨*»¸]@»Ö ˜»Ùåz»Ì‰*»Âk »Åø^»Ê 3»¸ì“»’Rž»WŒÅ»-Ò¯»+à»>¡7»Lð»Jä»8|2»jK» ïô»²Š»%R€»&æ»%µ@»Aû»r¤•»Ší»ŽÈh»æ±»Ó »“„»•w廕1¿»—+‡»¤—¬»Âf&»åC2»÷Œþ»ðàl»ÜÑ®»ÇJ»´û}»«'|»¨:w»Ò »Á‰»7ïñºîtFº‘ ŹÅÑs:&ÓG:øè';NØ];Š?µ;©É4;ÐUd<°‚<5<`Ù<F<´<žç<&|<*BÒ<&Ó<" < ŸÓ<fe<º< 9¼<wá<%4<+ñ<J< Ú‡<˜›<ß%< ¿-;û–™;ézq;åL¹;á½Ç;Ûˆß;Ûj›;ßá×;Ù´Œ;ÇgA;¼ÏU;ÄÐá;ÓÓ¤;Þ§ñ;æØÔ;ï¢E;ûmú<ž <Â<%ˆ<.¸O<3ü<<•Ç!$<.Rˆ<ž¡<ž1;î¢k;áŽ;ãR¥;ïµ};ý„Á;þì[;éÆ.;¿Æj;‹¸n;1v:¹Àµ:,s:0ì:wYû:Áô :òÍ:çG:ŒRÁ·ŠýÒº•»ç»t‘»kíY»—vß» Àá»–u£»Ž¢»—E»¥?H»¡ê¬»†5}»AS» k¨ºò.G»Š#» ÇZºþŠºÈ>þº‹^º[¸º‡%º®Uvºµ º·õxºñ‚•»*õ{»R,±»b¥»jR»wz»ƒ©»‡g—»‡‰»‡Ì»‘ŠÂ»ªA»Ç™Ü»ÖI»ÐH»Â¾c»¶¼]»¬äò»¦¾_» Ý{»ŽàÊ»WÙl» 庞<3º!-Ü8Iôz:… É;u0;gËZ;–õs;°É;Çu^;å'-<õ¼<Qx< 9<\ <"¯å<-¢<._<)–h<$ûî< Ý°<²< ±û<C€;üÛI<Rö<¬5<< ¿Ù<Ÿ{< ¯£;ñó*;̸â;½ƒ¿;Ân;Ç;ÄÉ;Âôú;ÃWš;»oq;«“;¥ãj;²G‘;Ât1;ÊΔ;Ï$r;ÕË;ßØ;óhZ<¿:<¸j<n#<"éI<**³<64µ^K»SuÞ»a@²»cô7»a»Û»k»|»‡K·»µ£»©r]»§#ë» çó»›~/»”æK»Ž5ß»….,»a!˜»Ⱥ­ª5ºõb¹@e9ÎЦ:¡ˆÖ;ÓK;{cP;§;Ás;Íb;×al;äû^;óùJ< [¾<8<'î™<.Eñ<,ã~<(´<"ØZ<`P<ó“<ë„;÷95;ôöÍ;ü3¨<H<Vq<bN<Ô;ó ú;Æ÷};ŸÕò;”ë‡;¡k;®¥è;°;«,6;¤Ý~;™‚l;Œ™;Œ…V;›å‡;«”u;²a;¶ñ,;¾áb;Ëi;ÜÕ¤;ñpã<×ñ<Ç:<ª< Ý\<tÀ<k€<(†@ ®‰>q;> tÎ=÷Åd=ѱ=²’‹=ž\=Cx=„z=€7é=‚QI=ƒ.ë=y—=eÍý=QM=/ÕH<ò–šÎ=i’=KŒâ=<¹&=)­ü= [›<ñ=À<ýRp=2=B–=O˜)=@ºÍ=!¸©<÷uÍ<ž…;â&C»­Sļvܼ¨„‚¼«„d¼‹Ð(¼Ib¼N»ŽÛ„;êÝ<–;6=WU=J)q=n`=rȯ=\-Œ=7tÝ=Ùú==E=ä<è¾$<Á¯þ< %¹<“æÎ<••¦<‘Ö©Ç<>)e=ù|=×A=·û=¢ìä=–NT=Ž0=‹L=)S=‰ÿ=ŒRs=~™|=`c=?}ê=H<³p•;ÞTy¼P>¼°`ô½5b½"“E½&t8½;ù½Vg½)"Z½V:½$ｌÌV½aŠ½‡’½q–~½9g¼Ä:wsq=!ð=l¸N=‘YŠ=¢yc=¨Õç=¡y…=Œ"¢=b_P=:Ë”=(å¦=[½=3<çÜÃ<ä£= Y»=1=M=Nùè=9zG=î<ã×<ˆ¡};¢»·! ¼_V2¼”¼—s¼…%]¼eÒ¼;ó)»¥‘Ä;ïo<Á$= ·N=L¸=[qH=Ow=2þ=Ã=oã<þÍë<õ­Ž<ÙÁ<±!1<“àÕ<‹"ƒ<ŠE«<{ e<'>E¹é>6¼ž¼ä£¼ç-n¼a†3<(BM= VÐ=Iì2=OÔR=4´p=“.=¬v=.™s=Q„h=k˜E=iº•=E˜B=î< ÀŠ¼sYn½ êb½&Íϼäm;ã=å:=Vöh="°7<@ˆ¥¼Áj¼yÀ¼:,b»«2â:?R\;ó©!<€ˆÃ<ÊMç=Á=$BO=F!†=sF©=’¢¶=ª>=Ãz=ß`L=ò‰=ïj˜=×Ó.=ºè=¤ñö=˜s1=’¸Ò=‘#Ð=“·ü=™ Õ=™˜s=ŽÙ=xK²=Sf=,Ë¥<ý@q<“ð;ü_¼–ļ§é6¼ê”ð½Ï¼úU¼ò䢽 .8½6>½hÿ™½‡EŽ½ŽÚk½uŽ„½[^w½ ?¼w`<‡8¹=µ­=WÃÞ=Š 2=œ’D=¤á=Ÿt=‹ûÇ=_–n=.ew=Àä= —=Á<äFÀ<Ûz<û†M= 6^=D%²=UCÁ=M%Ì=4§à=Ò <Öç2ê<Þq×=¤R=%ì£=@Vx=d?1=†s=œcâ=¶,6=Ï=Ùêä=ÐE~=º‚i=¥åž=˜÷“=“´=“:`=–Q=œo= ÀÌ=›Í=Šn=kÔ^=Fô;="îí<óWÎ<•pp;Ãi´»ÁçÔ¼z9ͼ¥Å¶¼­I¼¯™Ì¼Ñ¦û½1¢½Fžm½uþ½‰z½½ˆ% ½oIǽ-ùb¼ð0;éÓê=<#U=€1›=•gR=ž×1=œX=Œ§°=aâ©=(A*=Gê<õ›·<íp$<ßB8<Û<ôZ=M3È=3áÒ=¾?<ÎjîÃ=÷Û=m=ƒ= ¿= ð‹<õë‘<½HO<ƒ Ä=˜x =Œö=h`S=*8C<ö<Ò¥ï<Ò †<Ôf9<ÛRü<öÓ=ßÝ=5h=S©û=cz—=`A!=OƒÄ=5 Ò=Å<Ɖq<],°;M’u¼*%¼™¶¼Þ¢¼ÿO¼ðS¶¼¤d×»i͹<ƒhé=<Õ³<Ñt³<Ò6³<çÈ= µ=39=`ä=„B¸=î2=—“˜=œõ~=£,`=§S®=¥°=3¸=•Î.=‘Ù7=ŒæX=ƒ×Ø=w@Ç=t!ø=y‡i=xy‚=j!z=Tº=>ìD=-”.=Ò‡<÷­<’–Ð:ç¨x¼y¼ùÃ9½.ç ½Oªƒ½YÝ»½H¸½i1¼¨E¹5ûà<¨½æ=9°²=cUû=wè=zyØ=nSD=KÛª= æ<À<ñ<Œb<”Ú<½s]<õ==üÿ=:x™=RµJ=bx=i?x=iZõ=dê2=["=E£Í=!Ì<ë]–<‰É«;¹¼‚À½ ¾;½?®]½BVs½ ùD¼CvŠ<^r?= 4=4j|=5ÊÐ=&µH=n^= ýÆ=&Ø=)¿ =+³J=%áò= Uu<»ŽÅ< d¦»F¤&»û—»ÛÀ»ÌBš¼F*¼ËH½ ¼×½JC½Xcê½NSŠ½0ß7½«¼»þ À¸•>Å;¢© <6\<©! =_+:$«³:¾é:í7ù:ÿ)˜;CÓ;H«¡;x€Š;‡ö|;`;TÀ6;£L:Ÿçã:LiØ:„ð:Ö:ä:íá;eà;0‡;>s;  :ä3ž:»¿¦:¤83:–°:˜4|:Ÿ=»:†~:~8ÀÔÀ9/¨{9â9Ÿ“¹[Æ\ºŸº)2Úºf¶º,_ ºS9 ºDԹϱ93$‰:VØ:¼þÑ:ý…; :î³:˜øä9ó.O¸o[¹Â3¿¹Ô2¤¹(;9c§9ö”Ø9ál¥8æJ¹ÐKqº{Z¹º­ðjº²ƒŒº©J‰º¸ˆiºãäOºØ¶Ò»¿·»R»ˆÈ;bÊ;1Ë_;Bc±;(—p:ÊÚå9ÿ’¤8æ!Â: d:Á)q;T×; !D; ÕÝ;)F ;Yíf;…;…(à;j–5;/t :ÚòÉ:‚}:sß:«$:߃á:ý̧; Qz;„Ü;%”u;9:þÚí:ÉÁÏ:­h8:£T):¥ô¾:±ã4:ªÕ :el9“oÛ8)ÐQ9bü9Ž…¹ÍVº8Ý2º:¦ºƒD º‰Ÿgº G̺­¸ýº™)Ⱥ>‹×¸¥ ö:+½û:®ÛÁ:èâ:ç¾â:¬qê:+"8‹V¹á‰¹×å}¹Ü?5öÜ9s79–åì9!¹!pDº·œºs°îº†òºrf’ºp(ĺ™ úêç»-Ö†»no»–e?»­g»´hi»¯!2»¦ þ»›E—»Š¶R»s\Þ»o:»‰Z^»¡à—»² w»³õ`»ŸåU»jàEºÿ‘…ºy°9óÀý:}ÃU:ª•h:îæl;-$ë;dµ;„tÄ;’ï;¨å+;ÄCê;Ù°~;æš ;ò«K<B<¯^<É¿<,ú8<7%Ç<8*Õ<2i¤<,šˆ<)`<$†â<«€< ø< Š­<+†¯<7µB<=H0<7õ¤<)n<Rö;ü8”;Ég;“Ø®;I‹Ó;ž;°~;;/¯;ED‰;"p¥:Âz¦:6‡x:3mè:´N; ;ïÄ;Vv;1à;7x;jyÀ;„Ôo;8Ð;Pb;Æ‘:µ ä:‡< :š9:ÊŠƒ:ø*õ;*®;!¸;.†í;*.å;Ã:åÆ":¾a¾:²…A:¸¬:ÉÆ:Òz:®£:4à=9HW8zº962͸` Lº( (º–O]º¯7”º·[]ºËOºäUŠºè+’ºÅJúºsá'¹ Û:/46:«ÿ):Îøg:´’+:^Ãê9Ž¢"¹lë¹¥ØX¹„/”¸gä38óY90P8ÜR¸I Ò¹™­ãº½Šº3gVºA,¹ù“º'(…ºÐmºª´#» Ë»GŠ×»ƒtö»žâ‚»­bA»«Ù€»¡éZ»˜´¾»dT»‡Y»…›A»““¾»ª½É»¼‹U»Às »±â»}‡»2ƈº—|ò·Æ":·:a·(:£b;-;J†š;H;\;™OÜ;­™ý;Ĩº;×V3;çšb;û¿< F<r[<*„<7D<=Ê <;_ <3åx<-&<'“ø< ôk<?j<u<$¸<2>{<>S;‰?:°5:dqü:ž);v);%e’;#}9à/0:4X:°];;"&{;k r;Š³®;“†;žåN;²2M;ÈS€;ÝŠ‰;óÅL<<Ím<$£<2*1<Ñ<'K'<Šy;ïìU;µ{G;yÒž;2®¸;))Ë;C*;R®“;9h#:þå:—‰":‹hq:ÞÊ; Ÿ;2M–;#Å;Ñ;1C¿;ez ;‡5W;‡T;f w;+õ:ïvP:¹¯È:±¿:É„:øд;À;-t@;4ÎQ;)È ;.@:ë3:ÍŸi:ÍY”:áóÏ;Õ;û':é“:†ß9¦2æ7ì¸|¸ˆþX¹Ø…⺈{þºÑCUºõ¾û» l»:e»X»!,»RIºÂ9Kºr9·*º:˜€:¡šf:Žq8:9]-9 èh8Ot ¶áþÌ8œ»Ô9%×9j7|.o¹ ÷͹ŒÜg¹Ñ¹ôY7¹¶ N¸Ê ·f-•¹©Íºº{|þºÆ:»Öª»:À=»km»ŽÛ⻟ës»¡ Ý»—ÈÈ»‘¡]»”Lh»œy‰»¨ÍÈ»¹šD»É;<»ÏÒn»É?»³‘»ŠØö»0亮t¥¹òà_8ÚFÒ:ë:Õ?_;CE²;ƒI-;‘ý²;˜ñ±;¥ÍQ;»^;Ôð½;î|M<ž<WÙ<l¾<*IM<4é?<<´~<>G<9áÉ<3ê±<.`ÿ<'æ»>À;Ecª;Tk‡;|>%;UÕ;“˜E;…oý;YªD;)$;/C:Ýí0:× ƒ:úðÓ;Ó×;)/¼;*T¿;Õ^;Ë¿:ã¿*:ÎŒ¶:ÓÏ©:î#C; í³;œg;¥ì:Ÿòª9ä ¸+¨L¹Å&LºeÝ­ºÆ(5»‡«»¿7»m»"z»,— »)zU» 5Ѻ§XÓ¹§Þ`9ï Ö:qM :‹rF:wô:5¶ 9ëÔÊ9£69‘hò9Œ­È9[8$8–…ϹÉ…¹è¶UºDêغ* º„ȇºFÌǹکH¹ÅϺRãºÁId» »ë»#Rv»3bd»Q@»x»™ˆ3»¢ãZ»Ÿgj»Ÿﻫ3­»¾u»ÏµR»Ú€ú»ÝIv»×ࣻÊ1•»±Àß»jm»HËî»ЛºÆM$º­€3º•ºfK:HÉN;:¬;sx;‘b ;œËO;«2r;Ä×È;å©Ÿ<ñN< k`<ûE<*[<  <&(<-Ë™<5YÒ<:3<<3Y<Y<5ש<-–š<*„»<-±y<4Hš<:²È<=?H<8î‚<-û7<=< ˆh;ë`‹;Êÿß;¸Áª;¬7n;™%Q;t`/;+E :ðåŒ:óý¸;ËB;ö]:úÏe:”>^9Ê+¹IÂ`º^±™ºÏûi»€–ºú0Jºë¬s»­7»Cu=»q§ »yll»Pô» ‚\ºyBº@Ò׺  ¹œPÃ7¾ÇE9°¶_:¹Q:Îg9Vr7°>8c®¦¸—/º÷ýº—/KºÔb*ºøðV» 3»)í»?É°»L ò»L©Å»K°8»ZãV»}ã­»×»“­7»¾y»Œòy»†öÕ»}=[»kç4»O‡X»Íº·˜¥º ÌŸ¹ È-9‹óš:e·…:òŸÍ;Ríd;›gö;Â7|;Ó׸;Ø—;Üö?;è4`;úmd<'¶<L©<#ž½<+¼ò<,)><(m <#Ïó< p<aˆ< âZ;þN;ô`I;ö^o;ùBG;÷Ò‡;ù®;üG`;ðhî;ËÌ;žÞ#;†'%;Še‹;šûÓ;£p7; *©;˜²ï;ŽÐÝ;‚w¡;{AÐ;ˆŠ;™Õ*;¤);©ç;°¢…;¼ßÏ;Ë®;Úò@;è.Ë;ð&‡;ñþ¬;ôh?;ÿ[Ã< =<4<u<'«È<&X°<•<éþ;ò7-;àcù;Üš‡;é,;<»R<²±<iÛ< èˆ;ù;Ð];¥4N;wuO;8x;~;öL;E);#ô¯;ûÔ:ÎV?:`ëL9µG¸ÆîѺ+÷º‘.º˜”†º‡_”º£ò+»-y»v;6;)Ç;©ª:·=‹:`«ý9ûA$8š)ý¹³&7ºïÿ¹ÏÁ¹óxzº‡Òïºüå°»3š»L>\»:"±ºþY¿ºd”‰¸“›9ï:dL^:˜=:¦ÙÎ:¢Ÿ:Š5:I#:$Q :=+º:DÂ9ïü´˜ÿW¹µíNº!Eúºƒ@–ºÇnÁ»¡)»`>»#[»!Xé»%BB»8gl»Nç»Y±9»YÝ»Rjl»?uÔ»%ê©»YÛºç·Pº º+/²¹lK8ÇÕì9út¸:ŒYX;?;d9‘;ªîÏ;ÙQE;î«£;ðúc;ðÙ°;ø{<¡<â¬<*<%AÁ<(©<'^<%î<"€t<)u<N< T<Øú;õpÍ;ï®^;èúã;ßzÇ;ÚÊF;Úü;͘;­RE;‡ž;c˜Û;cóÑ;x<£;€Ñ ;yCk;j+È;Yn;Kèž;QP×;m×;†@•;Ž›¬;•&X;¡I ;±Â›;¿Œë;ÅÅ;Âuï;¼N;¶H«;·<[;Ä{z;Üæ;úzA< fà<h‚<Zñ<Þñ;ùT¨;ëi';ê š;óVk< Ú<(w< Ôl<#<šÄ<¨ë;ಞ;¾÷ ;ŸjŒ;„Ï%;g›;WÏ;QÐ;F„™;,“Ä;Äù:Ĩ:‹¦e:4­ÿ9£yu8µÆ8üÀ59!ê¹Vlº~µÔºð&»$IÄ»3*5»ýZº¦Rã¹d:W:˜Ç.:Ðο:èw8:áË,:Èó-:£øÀ:† ¢:‡¡£:˜Œ :ë :Eâ#9âˆr9Jº¹‹¢º4uº©f™ºëŠM» º@»l» ;æ»Üû»&¶»5È»:ñÔ»7{»'(¶» ÿwºàäÀº° ºu3¿º ¾¹ož6h29­æ:a9:Ù¥Ž;=†¨;•ßè;͸­;òWð;þÖ¸< :<Øv<w¶<¨-<"—f<&Ç/<&¶f<%hS<$w É;3µÈ;5 Q;L1«;lT‡;€ã®;‡p;’-¤;£y‘;´·d;¼¯;·»à;«;žûæ;š¼£;¤§J;¾¤;ß—x;ÿ8­< Ls< cÀ<h?;õÿ/;ê;ì_¤;ùe<Ö¾<18<$†ð<,TA<%*V<Ù—;ù¢ÿ;Øbq;½ ;£Ýý;0Õ;Fö;rB(;dò÷;P²Û;3Žþ;:è¡:¯9Å:s =:%™Ó:‰¸:!>9îžç¸Ã2¤ºaZ»ºÕ)•»áo»™²ºÖWºV[9õco:¦† :÷€²;ÚÂ;ê7; p:óa%:Ï4F:ÀœB:Í'Ÿ:Ô $:¼ém:šìž:(:9ßm9DTÿ¹ý’äº}(ºÌKºëfoºñìlº÷wj»‚»~Ó»÷Ù»õƒ»þºõ^«º¹~ ºƒë/º%#3¹šˆ¸ËÕ´´<9c\Ø:8€Ø:½Ö°;#¦ø;‚2Ï;»(I;êâa<0<JY<L!< ý9<Iê<ö< t‡<$Ý6<&²<%¢O<%Îþ<%-[< ÜŒ<jN< W<ƒ;îŠ;ÞÙ;ÐIo;¸F;¼Qu;»ÄÊ;³”„;›¾C;z>;K4ß;5*‰;/ðà;-Ç;'$ò; ;à/;h;)dë;Hˆ%;b]„;q<;¤|;’;¦z°;´¤;³1L;£(•;_F;ƒm‰;‡çñ; ¿Ï;Ç!;íf“<7<sÂ<9Í;ï¼—;ã¸h;ç¥m;ø²¦<C<¤¹<&…p<2c<0¼*< v;< "ý;ï;Õ¶»;¿»·;ª†r;˜=;‰ýñ;h5;lJ;VÁ—;?lA;%¡r;Ác:Ц:8:‚èQ:Ý®:rC4:!Õ$8°)º" gº°ÔºóS ºã‰ºo¿™9EêØ:›Î;w€;)Ÿ½;;7+;7yû;(’>;Dë;!í;.%; ‚ÿ;Òõ:÷?::äÜÎ:˦–:Î9Éö¹«ËMºhÍ’º¥¥üº¾~UºÊçOºÝêºöA»;g»£¤»Î?ºÝ籺¦/׺Wµß¹ÖJ¸,i´9,MT9999r’Ù: Ò:®E;);i«é;¨ ø;ÚÈà;þV¸<å¹< <¸‡<9ì<"\<"<$é]<%¨=<&›i<'zŸ<%©µ<W[<ÜÓ<­J;ôZ¬;Ý–,;Ë*å;»Y<;±ªØ;±ð;°’Ø;£Ue;ˆ£;Vtú;(Ï.;J£;å¾:þ{:û/A:öa:óµ›;îl; b;.;1¿F;FÕk;ŒN;Ä™ý;òn<~h;ýþ;éØ·;ÖìÑ;Ñ­€;ß‚;üS7< ~<"‹½<2ÓÉ<;]<55ï<"\< s¢;üÔÝ;ê¼;×™›;¿zß;¤*;‹¾F;t‰";_\I;U›;Tê;P‹Ÿ;@2¯;$œ;t:âµJ:È/ë:¸|õ:ªÙv:”ÂÎ:Cç²8Gðº/º]d£¹ŽË<:?Ø :è‚&;0Úé;`ã„;|dŸ;E€;{pL;lÐó;[/8;Nb;H‹Ô;E”x;Eéé;GŸ”;;4L; h:º{¤:2ÉÔ9$t>¹p«‚º ¦ºf(,º›¿Bº·omº¿gº»Z6º°— º— ܺQö¥¹­p-9Zö†:8¡l:x¿:mŠ•:k'¬:¬tì;UK;[¾Þ;”T;ºX´;܆®;öYX<>A< [µ<~<Ø<=< jõ<$0·<&üA<)'K<)×à<'kä< m0<oB<Õ°;éwt;ÍáQ;¸eÞ;©†;¤Bø;¨ ;ªd$;žŸÎ;‚þÈ;>ù:î¨:‚¯: ¦:…Z:A4:WÇ/:fœÈ:Œ–E:¹ß–:ä];<;;ìP;3 ú;eÀ¿;Ž8F;šm”;‹ZÖ;R{¯;f²; ¿¯;M{;¡ÕV;ݾb;ÿx@<]\;íøb;×Ï;Ëa;Ï–;;æN[<Z<œ—<,»<9 ß<8vc<)ê <]<15;ø;èÀá;Ðè+;¯§r; £;dE¢=‘$=Ö›<¿fé;(«ó¼°B½.qõ½eó½xŸÕ½t®Ø½l›½nÄ&½¨“½‰€3½ŽT½Š½~H½T°®½±ð¼æWºMºP<.(è<‹¤È<Ÿç<«³<•b@<›Ã<¿w=Š=.à÷=^{»=‚îø=¦¢=›P@=¦ Y=¯!8=¯üÉ=¥ÒD=–™ =ŠÉ¼=ƒ•=yÆ’=mçÄ=m”ì=z,?=ƒ¼“ím½¸c½/mɽGW:½D°Ç½$e¼Ò.Z»ò›Úû<6 F<2,dÅï=&˜q=UB<¦ÖH;œa¼~»2½þ9½O—¦½P[[½¯ù¼*Uª<‹ïÞ=‰=E?Ë=B‰3=0@º=(Õ[=/@´=6f»=6«i=1b>=$¨=­È<©ô~;§˜Ÿ¼wû¼†r¼ŽíÓ¼†~ö¼š"K¼ÚMV½ô½9ùh½F<ü½:˽ƈ¼ÑAi¼L CºRÇF;öÅc=[% =oæ_={0=€Æ==…Àž=‹º}=‹HÇ=xÖ=8)Ô<Ê­7;Ÿž·¼E…}¼Õøw½r4½2â:½2ˆ‚½D´¼Àáï»óA<~ô<Ï—<äz=p=.Õ2=6“Ø=8êç=1€d=-ó<Ý <™;_<‰ <²#E<ÿ8=(¤@=E'{=L“ç=Bv=1­L='©+=)²=2Õx=7âô=.¾ã=|ê<ãye-<=N’=>¢i=-Ë=- h=5G=8ž_=3¢j='Õí=GF<Ñ£‰<:]û†×Ú¼… ›¼´j]¼¸7¥¼´ëù¼ÌuĽTB½Þ®½.ÊP½'÷½ ?f¼·Í™¼LM;8 &ꪻC¼28¨­¹ùÀ»+1»[Ø4º¾™·;¥ñ<€Ú<çI ='}]=Vÿx=ÎF=‘©i=¢Éi=±Ûª=·,±=«c#=‘=gQi=9ö®=¥‘=y=ðî=/›n=E¡’=V…9=bî=pô=øm=ˆQ=‚NZ=U9 = 2<_¡Y»v§¼ŸJ½½½'•ê½5!ê½'h÷½×#¼‘Œ »û‰=ICñ=5ø = ù=TÝ=!‚ü=$ms=©•= ×ó<ßʆ<•1u;×Î9»Ò(p¼–Zn¼Ù>¼ódy¼ò±ò¼îÜ°¼ôϼü8x¼ð\¼¾¸e¼L2Á:²#<|“<ᥕ=òR=1+•=@©`=Hrú=LÎs=Oض=NŽŠ=AÉ="AZ<Ù§<^u¼á<¼ËÙ¯½ |â½y\½#jm½*ßƽ.‹½)R—½êy½(D¼ù£­¼ÆùA¼ƒåd¼ 5¶»Ÿ²–»¾á—¼É(¼Ll­¼JU}»ìi•;<æ<€ï‚<ê9ž=#õ„=Lx‚=o? =†Ý¿=”Ø3=Ÿƒ<= lÉ=’-?=n¨ª=2žÿ= %<Éäµ<´µU<»Ì<ÏÓ_<æ8¬<ù—¬=Ç=÷Y=-Î_=;ź=4ƒ¡=®Š<¬—L;›G:¼5ì8¼ÑáȽV‘½<~D½Ez;½6‚!½º¶¼ÊÃf¼4Û;aœ<[n<§þ¬<ÏÔ<ôñ= ³=…p= u÷<ð[ <ËF <Ãù<ÜÅ0=Gï=—‰=‚N<õ÷š<Ǩ<°Í <À‡9<ë(= ‘«=jÚ=Åî==V<¿ìš<,,»Õ?O¼Á~½ Mœ½ J¼¼ºí»9Ñ<žÊ¸=¨=5N=,H=BÄ=œ^=•= Gº= ZM<ù·æ<ÉD <‹Òá<jºê'¼LzP¼´º¦¼èDļúMJ¼õqª¼êK¼ÝÛ¼Ç~J¼–·Ä¼}ò;¾Fò<«Qû=}•=<ù¢=_y=t”õ={nu=vz/=k»=]~s=MR5=5úB=Jä<·By;Æg¶¼&䕼¶Å¼ë/¼ÿ=º½R{½ܽ)™¼ê=d¼Ì ̼®$e¼Œ¡C¼C˜?»Õt‰»\ù0”¼ ʼS*ë¼n8ÿ¼4ä[»7Ö<,F”<Á­½=–¦=8˜¡=YƲ=uKà=†…2=B=“î=‹ÙŸ=m¬a=5¿&=Xå<¸2Ä<‘WI<‡<ŒÁ£<•d›<šÛ~<¡nõ<²mr<ÐB)<îùˆ<øjç<Ù¶D­<íu=¾¼=[M=$å= ò<éÁÕ<á`9<ëe6<öëˆ<ðŽî<Ò.<©¿‰<‘z¦<›Âa<ÄÙD<öR= -=ç!=p<ÛÅæ<ŒXô;W(¼KÂ3¼Ï_”¼ù>¼Ñ<—¼@!N;Þ½Î<Åè= fJ=d<÷‰c<Ï£z<ÈT<ØÂÌ<ã'<Ó>=<©§{ï;[6];3Þ§;öw;¹&;Å_;Œ²;£;HÕ:íx:ÒZ:ÈŠõ:Îîÿ:ÙÀ:Ü9Ì:Áy:r{±9^˜¹ÉCºaоº·C"»q»·ì»#Â;»"W»"5U»#­»ORºäºþº_.U¸ðÅ9Æc9ìÏä9âÛÌ9äÅt9áÕ˜9Ì­ú9¦oe9YVH8¡Z<·<ˆ¸$˜"¹råºx º ÓFºþ‹­»tj»A¤»¨~ºìØ·»Áb»%¼:»G¶ß»:*»:ñÓ»_»B¨»¬lß»¼½´»Æ¨Ã»Õ®Ò»êv»ùåx»ý®•»õE/»äÌš»Ð®Ó»»Ä»§i“»•2¤»‡ïr»KË»|§»nâ»F½}ºíŽû¸6$ô:ô»ÿ;_Á1;Ž%;§Žü;Ág;á׬< 3< K,< Œ<š¿<0f< <Dþ<Óç<"5o<3å2'<6<.¬½<+÷Æ»=ÞÞ»`Ø»ŽÛ¹»®„E»ÇUлڔM»ìX‚»û‡Ç¼šp¼\Õ»õGy»ãÑl»ÐX'»¿ï|»¶¢é»´šâ»µà»´´g»¬)9»™jV»uß@»§<º>‹ë:Ž¢Õ;.È£;{I);šè?;¶üù;Ô¶ƒ;ñ„ë<ŠÂ< ;:< ±_<Ïâ;øK;õ­ñ<ŠÅ<uö<'éP<7Ø-¹œ»7ô»2J§»0íO»)³õ»e`º¼&º6Çt¹¿Ïº¢wºOíºcóغ6'"¹è%ÿ¹—àB¹žò`¹ÑZž¹Í¤ ¹N'¶ðæ ¹40Úº\[0ºêŸ »,ç»K—»Tx6»W“Ü»_º£»hoˆ»dËt»Y×e»B‡É»9¢E»M[»}#’»áÙ»»ü»Ôú‡»é»ø»ÿºL»ÿ:»÷®M»êñd»Û\3»Í&7»Ål »Æ(D»Ëq)»ÍYz»Ä廯æ仌ûR… ºéÔ¹=æ„:·Æ¡;4­Å;|¡–;íÊ;¼FÄ;ÙAÚ;ó<'<Ü[<ª;ùÁÑ;ñδ;ùŽÆ< 6'<­]<+›<8-V<@­Lß2»;ñ´».=*» ´Àº¾A3ºs}‚º]”fºŽg¯º¨ìûºŸ´{ºt0õº&S¼ºˆ‘ºmºÿŸ¹´¾%¸« V·ìç¹ë 麨.!»°´»?Pã»Z;K»hm»q"ä»uNz»n'»C‡»7^—»B ½»eêлŽYÝ»­p"»Êén»ã7.»óí»ûÈÒ»ûÃU»ö–ò»îz§»ä†­»ÚÑæ»Õo%»×q‡»Þ¶ò»ãqÇ»ÜËM»Ç¹»¥Žý»}ûr»-aŸº¯®•8=µ•:º–;1uä;~Àb;¢×¥;¨c;Þmü;õJ<|¾<S@;üÂS;ôú ;÷b–<<òº±w4ºÙµÜ»®»&q»H t»]ꊻb í»Zâ#»S5¤»O› »Ií[»7’Ý»…Rºà)ºµ`•ººÁºÔ*ºÛC¦º¿ººŽëPºL°¥º([NºQt¹ýa¹Á)¸­ø¹’ªºmû‰ºç»Û»(ûOæI»i ÿ»wkó»z•ß»pHŠ»Z‹3»;¿º»1™¦»;Ø»Xë#»ƒáY» ñÿ»¿ïG»Ü»ðb»ùî-»úT»õhý»ïâ »êèE»æÚ[»åƒA»é6ð»ñ(»÷Må»òó}»Þ¬Ë»¼Ì‡»•§»`á*» ëº§ ߸#E¹:¬ø½;2Ë;…iÌ;¬h¯;ÌÝz;æÂ;øºÒ<G;ýÎY;ø©É;ù»×<ê•< ã_<*ã<'·<2ù<;" ºÃ]©ºêÉ»ˆè»=þ»a9,»sX’»sì»lšu»f×x»c‡Å»[»G‘ÿ»)7» C"ºý¬K»‡å»ÆºÿSŒºÒÕÒºœ7ùºgœº<˺o¹Þç#¹H„¹³¶·ºJÿuºÁ¹H»Öå»=»Ö»]x¶»p¾»u/í»izÓ»RyI»'»3¦$»R,í»}Ú[»™žÑ»·§Š»Õ¥h»í̯»úùx»üÐ8»ø(E»óF»ð‰½»ð㸻óñ‰»ú@ô¼{ò¼Θ¼ˆ»õ‹,»ÕÕµ»¯rÒ»‹•Ø»[¬Ì»$#ºÄ{¹Yè¿:®²x;A¼;’&¬;»8«;ÚéŽ;ðÉ,;û· ;ü•K;ù7‘;ú¬<4j< ÐÜ<¬»<#Rû<-^‰<6»<>;Ì Ø:UT‘:¨íÓ:ºFœ:°Éé:Æ/Ú;cÒ;Z“c;“z–;´7¢;Ψ;ヂ;ôƈ<‰< *<½<‚æ<‡t<Œ¸<"j×<&«ý<)sÆ<*hp<(§<"òI<IŒ< U–;ñÿù;Õ';¾jV;­Ä¯;¥A(;¦ÀÀ;«ÓM;§.­;‘-L;Z[¿;ŒÏ:f€Ö8îÒQ¸üiI¶Ûyè9%Œ÷9‚ŸÅ9Än7:%Ÿ:p×:”æ:¯B2:Þìd;rÉ;Y¥;†Z‡;‡‰n;W»±; r :ÇÍ;¼¦;l&X;ºF¬;íZ;ýÌÄ;ò ¤;Üuû;ËSð;ÆT*;Ñ”t;íÑ < C4;»;\ƒº;‰;›Ý‰;¥â;¨ùú;©;;¡Ö˜;‘–©;|gQ;d”Ò;ih;ƒ2;’ë;”‹æ;†çå;dË;@=;$˜;.:³:RŒ9Œ¶¹Ÿ¦õº º!Sžº/@ºVU¹Eã79ñ®P:ŸtÉ:÷Ûr; ;÷ó;!,|;=4¿;}Û];¦ûW;ņÔ;Ò¸ß;Ôh›;Õçt;Þ+Ð;ìS;üRm<¨g<ô8<WÞ<$ÞŠ<(H‡<'uÞ<"ÀC<ü[< Ê;ù®Ð;Ý5u;ËÓ¿;Äk ;À°;»wœ;¹û;¸¡«;²´­;ž€—;r¤; cT9÷îwº}ïºñ“8» vÛ»†*ºø€ºÚÇöº¹N‹ºŸk¨º—6 º—x†º†ìºº49ªÓ:¶ë«;ø:óãg:…ûŒ9‹ Ê9›:´E;N)Ž;îH;½™;Äex;Âr^;Â';Â;;;¿ÃH;Áœ;Ó§È;÷¥n<Eä<ð<ë‘<–]< ÄW<²’<„“<·S;æ9â;±Íã;iÍÄ;°]:kÀ9·œz9¾»U:j¼":Ò¥‰;í§;1Œ:ä§S:¿‡g:ºÓE:è£M;x;AM;D~8;'Ýä;ª;èì;Ø3;Uœû;‡r;›Ä;¦0 ;ª(;ªàE;¦»;™ -;ƒƒ1;`×;Va‹;nPt;ŒC;šÎ¦;™Žy;Šé;qÔ‚;Rªà;4ú;ÿT:ÏÝ6:jd(9“H–¹6f¹Ð äº"º™·¹¶@ 9Q‹:ns‘:Ñ¡; ÅJ;T;^V;-ÑW;\~´;“É!;¸y~;Îd ;Ôl®;Óü;ÖÎI;ßû;í>˜;üò<ÿ—< 89<7”<;<"T”<"æá<:‡<w5< P2;÷ê;Ù½b;ÆûB;Á¸i;Ã4;Ã|;ÁÀx;¿¤ú;ºY;ªm‰;Š4„;3Úv:€æº>4 »{ô»*3á»2L¯»* `»pU» ¥ÅºóþWºæ縺ëóºî3œºÏ¯ÉºuÿA89q:uºÏ:Ÿä:LØ8œï¹^‰?9¹ž¸:߬ü;XA;;“ZA;¦ ®;­Ú;´8c;¼ä;½2Ð;·æÊ;¹\>;ͽå;ò+Ý< žú<ÛÑ<*h<ÝÃ< T¢< €R< ²Ó<[ª;à•;¨ê;Y£7:ìí&:@ó·9DµJ9uŒm:>jj:¤U1:™:·o‰: ø:™q :¸¸|;ÝÔ;,ºë;G¼…;CÊœ;,;÷;j;'/F;NØ;âš;˜±;¥¶;ªjÑ;«‹Ë;©p¸;ŸBá;ŠÄh;eÆ‘;Ix;S4Ä;}å»;—2;;£Ÿæ;ŸV_;n6;~¾;\M>;9‡Ë;~O:Ó«!:}—­9ÑÉK·õbñ¹±k‚º{¹çµ¸Xªq:í::žo¸:åDØ; 8‘;Ãy;¶ú;9¦r;vV;; ¢;¾­Ÿ;Í­y;Ñt‡;Òç;×Ø;àçV;í>ö;ý¨Í<T<’Ò<»Y<Ùs<ë <‘<Ò';ó_Ã;Õ^º;¿ãm;¹0;½·>;ÄrŸ;Ç©¹;ÆõÇ;ÁÎæ;³½D;—„;RéC:¼–½¹ØáçºýRƒ»:]/»O˜ì»MOå»A_»1A»!ð»‘^»9´»Q©»-Àºý\µº–ý×¹Ó39©Ñ9±x¹` ºÖ¹Öâý:Ÿñ:ö6&;N?;‚=Ã;‘IT;ž,Õ;¬nä;´¡5;°;¨2;«üo;Ã¥Î;çxø<~P<þ¼<|j<Ù¬< <c|<Ø<,¼;Ývõ;¥Ÿ;Z£B:óöð:M9€]¤9ŽÇ´:"-):rÒ3:†ÍÒ:ƒBÍ:ƒxÓ:˜ï.:΄;½å;5?~;I»;EãC;9‘¢;8Í”;Opé;yaÏ;“Å;¢íb;ª6©;¬“Ó;¬)‡;¥‘u;”uŽ;vðË;Kð€;AË+;a)É;ŒW‰;¤B`;¬±+;¤þ3;“ëÞ;ó¨;X„¸;3/¿;ÍÝ:ÒzÜ:†D:¼8fôC¹Šzã¹ÃÑ–¹@ÅÊ9‹õY:VÂ#:­MN:Þ5±:úÓò;Ä;˜;E{B;ƒŸ;£Öü;ºâÖ;ÆJß;Ë—;Ï'¨;ÕA<;ÞW;êÀå;üHð;öjˆ<„×< b< €Ñ< V‹<ûœ<Ç-;ì­8;Ð÷ï;¹s•;®ÔÑ;²8È;¼ÏÂ;ÆsÀ;ÊÅ;Çê¥;ºü–;ŸÁc;g¡Õ:çM¹'„·ºñ8±»ARr»`œÆ»cnã»ZP»NtK»BÀ:»:/λ8£–»<ý˜»=ˆ».gu»œøº©fº#Û¹ÖÈiº-)Ûº†žàº‰jb¹ój:%n¼:ô};;ìš;hg;…1;– ;¢ïE;£v¾;™Â;‘Òr;›8;µx;×i;õ¦«<)B< Lt<z¨<Bã<55<×Â<Z;Û x;¥|ñ;_yú;íI:{ï©9úBÐ9ò‡:,›S:[%:vìÞ:‡ë*:œ:Ÿ:Àjµ:ù¤Í; ½€;A ?;R ø;U ;SãØ;]¨Å;x‡];ŽÀ;ŸD‡;©|M;®f©;°0†;­Æ; £ý;Š;aÓÃ;D~~;OYì; R;;±‘;³­2;¦Ñ#;‘IJ;så;I|);&¡J;®›:Ð5¬:Ž2ü: Ã9>^\¸¨<•¸Ë‘ô90: gw:uû :§ÓŠ:È¢ž:à“9:þøï;M;Nü;„4;ž;¯Ôá;º à;ÀdÏ;Æ!š;Í$é;× Ú;å&2;ê};ôàæ;ú^0;ûîƒ;ùõ­;ò²O;ã™Ü;Í?×;µûÉ;¦ü§;¥{¸;¯è;¼†];ÆÁ³;ÈÄ;¾Ž:;¤“;r€Ø:ýL×·Úˆ)ºêóV»Eº »jÇC»ob»g= »^þw»ZtÕ»X³»Y³ð»]FÆ»^ƒF»Tá»79‡» ‰>ºÁf^º”%ºßÞºÅeøºØP1º­–¹ù2f:1“:ë2Ê;.úk;YYé;|2;‹32;ŽEÝ;… ;sú';rKå;ˆ`Â;¢—;À',;Ý ;÷~,<Ó<C<$3<ž< æ<Õ;ÕFä;¢~=wl«=L /=&Ì[=1ä<¹<@¯c:ë±¼ z¼j9¼‹Œc¼’áE¼Œn‘¼iÞ¬¼oŽ»ŒÍ/:»d;‹í&;æ)ž< Û¯;ýžº;‡m£ºÌ'»Ý]}¼†»s;—NP<‡ m<鶨=Ð=A¥Û=YðÀ=jê=tÛü=z‹Ž=uÀÑ=_˜”=8~= ^ý<ÂÍw<ˆ£lü<Ë=<û;= ´×=hú=,å<Ù„Ä<ŠO=;Ž0¼O7¼ ”¼È{¼¿mH¼‹ÿ`¼ƒÑ»3M±º~žt»­ »H¿¹Üé_;–g< }5<H®;g:ì»=@´¼ wþ¼B3Š¼h¶Ù¼‰Ä0¼¡dÀ¼¯>‘¼¦–Ÿ¼ƒ^¼ >˜:Ì ¢â½2ƨ½X N½qUž½w…½mñ½X˜½;l ½#ª¼ßà›¼–'Û»ªíê=%yL=OkV=bp=]`Â=F 2=#³<ù1<¶á¬<£ž<…_<›Š‹<Ç>E<ø b=¼½=r‰=—Š<öNã<ª\`<ô»°¼“¼Ž2|¼Ìµ«¼Ûíö¼ÀH¼-¼J¬¼%g¼9‹¼š»sç~:ðZU;¨¿5;‚z云è»ò¸|¼Hsͼsmü†¾¼”éì¼ øH¼ª¨¼€P¼ ßç:Õÿ°;÷«;”»ªám¼`~¼²õÖ¼åü-½:½ œ«½€‰½ Èô½ùT½Š½0m³½M™¾½e“¶½p½l{0½]Ð/½Ez½#ª–¼ôh¼#*»iúÁ-<`Ä‘; ¼ ™¼ŒÐd¼Á!ý¼ÒX_¼³›î¼QÑ(ºƒ9<*Ú<¡h+<Ù4J<þ¹ =ób= ¿X=-¹=~=N:="É=F;à€º”sk¼*p¼ ^l¼ÞÀ/½¬9½€½!ýª½* •½.-½/N½3?ë½=s½I"i½R1Š½UCE½P:k½?|Ò½ \]¼éfϼhÔ¹Ã,Ë<ë_€=ò3=5æ=DKß=M=TÞÎ=^àU=j%Å=qûÊ=pLË=c‡K=Q{š=@çY=1bÚ=O±=„·<Éú<‘ ¦<-o¢;Þ²»ïj¼ŠMt¼ËŽ¦¼øC]½ †,½_¦½!§k½)¿û½-7ž½/O½2Ïx½8Æ,½>–@½A÷â½?ÓL½2ÒÕ½¼“¼ÙÏX¼_¨ ºTú„<[%s<åGw=' S=HÈ=O¾x=;ß!=­<ç-<¹Üµ<­é<º=7<Òöb<í,‹<ûÒ«<ñ^a<Ç´<‚ûü;­.‡»Úº²¼“˹¼Ôšÿ¼åÀ1¼ÇMŽ¼7ž¼/N»Ig;Û;£Ìž;œœç:Ø!ï»*åí»Æ~¼+ú¼³E¼5ç%¼F½¼* £»‰û;Óå<£–= À=<î=feU=†•=™„û=¬Ë8=ºçÞ=½»M=±Iã=•]ü=Yï#<ó\;¦m„¼“ý—Õ½HS½Q ƒ½/Ûð¼â.ö¼C;ôFö<¹Cè=žh=7õ±=Quû=`@›=jD=r³™=z‘=|”æ=u|þ=dE=ON„==¯Õ=.ü'=­k=<Å.É<‡Û;×Cù»MÎļS[í¼®^¼Ý–~¼÷Án½CÙ½ k[½*½’½ @Ó½!¢‰½#òŽ½'l×½*øº½+bŽ"–½ Xg¼Ìtg¼j0»;¨<,HX<ËéÓ=ZF=:ƒ¢==+ =$¨<ÿ·L<Â6Û<¤hM<£Q<±RŸ<ÃU°<Íøµ<ÅŠK<£ð½óW½TR½¬½ Áº½}á½ôϽ#÷¼ÿǼñ¬¼‚æ»Äzr;Ú¦<¬x-= =)+º='ƒõ= ­<ÒÅÄ<¡—˜<ý<‘<™»+<ž,¿<•4ä< 1ì;¶(è:û幇²º†#=»™[»S“»°{m»z|›;,×»½¼(çݼˆ?¼ªV[¼¹M";¾‚ò;Ë7×;Ö c;Þ—á;ãm;㈧;ÞƒË;Ô·ó;É ;À§é;¾ÿ;Âs‹;Ä¡G;¾íÑ;°CP;ñT;Ý´;€š¹;dt~;?Ls;¸²:ÇÓg:`Z9‘!¢¹dE¤º)‰^ºz±º+€º¬Tƺ¢kºõ註$¡¸»SR»uýý»‚ŠL»‚[»³‚»|¬»yË»p®•»]fÔ»CŸ#»-ô»#q»!œ›» » ]ÿºÜÂñº¡Õܺo º;-kºU¹ú*Pº§ºbo\º¹u¿»ø•».•È»Nœb»c‚›»iŸ»]Ô»EGN».Þñ»#2x»==ä»g7»ŒÀF»¨ür»Çl»äˆ»ùí…¼…¨¼Ïc»üe:»ùŒÍ»û6T¼_ª¼œ‚¼ ‹²¼ & ¼ A^¼@Ä»êq»ÅWû¢ý™»ˆRœ»b˜Ñ»(Ûº©$9ÕI©;Îó;†LÏ;·";Û•;ðõÎ;ùc;÷xa;ôÜ&;úw<O<­< <'ø<0òe<8ˆš<>â8;Ãçú;Ö°æ;æÞQ;ñ§Ü;öR¶;ô­ˆ;ìÿö;àO¤;Ñ<ÿ;Ä11;½8Š;½~;¿uù;¾â;µÏ;§G;˜¿ý;‰M=;j:Œ;5¿:÷®’:‹WÂ9Ã?ç¹:˺!´ºuàߺ‘]/º–>‰ºžÚGºÉw»L'»G¥“»v້¡»Ž˜5»‘lR»” h»•ß»’Q»Š¤ »€sÅ»m†ß»^?»M!»1dá» @[º»ZAºiüºGĺ¥=ºM1º£“FºïtÄ»3»=eлV‘¤»d$¦»`2ì»K »0ëo»$j»O”x»sš¿»‘†»«¤…»Ç*Ê»ã>†»ü™u¼F•¼ º¼¼ g ¼éɼ¼'”¼þ ¼û%¼3¼Œ•¼ ´e»õ[‰»ÕÙ2»½¡u»«¿»”.ô»[™'ºÍâ:,Vn;>ôÁ;ÄÙ;ÈšŸ;Ýß•;áêŽ;ßy5;âì ;óù<ûã<fÏ<$=<.iÿ<4vª<6éí<60<1Æ<(Ê5<ñÊ<L]<(;÷Z;íÁÓ;æ3Ë;Þ^k;Ö?v;Ï–\;Êéà;ÅÛ­;¾÷`;ºf7;¾êÈ;ÍÇÞ;àÐÿ;ðx ;øþ];úKº;õ®;ìz¥;àã;Òé#;È<Æ;™ù;ÁœÆ;Á)F;¼!3;±¶;¢‘–;‘Ì;x•;Af;;B:šÅÓ: (7t:y¹Ù«UºL܆º†”`º“n£ºTúÂ^4» s¼»>ù»o&Ý»‡;Á»Nÿ»—oê»Áª» Þˆ»žŒ)»–ã‘»ŒJ}»˜ê»m¯“»P¬6»%¶UºáŠ2º{+ò¹é\µ¹¢¡ëº…º˜†\ºö.»'8»K¡D»g?í»v‚+»sÊM»`5´»Iç»@?ô»~m*»¦ô» Ä»¶¤É»Î±Ë»è?í¼ˆA¼ õм´¼|÷¼Eݼ!,¼#à´¼%7¼$|é¼æ¾¼ÞV¼8|»ïB:»ÕÑ»ÂÍ»»®»‹½Ï»(ʹ³;;h;…¬;²•P;ÇÑæ;ÌžÕ;Î2;Ø- ;î£<â<ÖG<%û÷<.óh<21Ñ<1+<-®f<('å< -)<u < ÿG<"©;üìœ;ï‰ö;áTJ;Ô ;ÍW;Ënø;Ë„·;ÈÒÂ;Åi7;È–W;Õ‘c;æëÓ;ô;;ùFf;÷0;ð\;çâ8;Þ+Î;Ô±»;Í1I;Èà;ƹJ;Ã;ºý;¬Ç,;šï;ƒÌV;L~ú; ³:¨Öº:3ø!9‰`¹†4º ɬºl»º’¸º¤÷üºÇm»Á»6|<»c²ù»‚œâ»†»›û_»§P»¬áÜ»ª©»¡i:»”´Å»‡1`»n¨T»Aîò»QJºŒØ{¹žOú8uà¹/Œ~ºX“ ºà*ð»(ÄB»WÝo»{ÁW»ˆù“»Šç*»„[f»w66»qPj»™™Ä»¡m?»¬¨™»»‹x»Î–ý»æ‹¼›k¼¶[¼Àê¼&v¾¼-Þ²¼1gX¼1w ¼/Y¼*C¼!B_¼æ ¼,»žK$»œ¿ü»—îÙ»–ø»±&“»±dË»³wA»ºQi»Èx_»ßüÿ¼'¼C1¼'`ã¼6>“¼>i~¼?¥¼;é[¼5º¼,¬7¼ 2)¼‚Á¼ñõ»éL-»Õµ!»¼È(»‘Œã»fb8v¦;ÏM;xÁ©;“–;;ž¹Ø;­Y;Åòñ;æàò<þ<Ê<$db<(¼€<&_<";à<‘\<Æ<!N<0<Ó4< û;þ,s;æþk;×|D;Ôh:;Øq÷;ÙðÔ;Öht;Ô½Ù;Ú®º;ä†G;éå«;ç*w;ß_;;×S\;Ñ•v;Î`g;Í ™;ÌÊh;Ì8S;ÈÅk;¿·ø;¯¶;—ùë;oäo;&µ:Éí¶:u-ø:1"¶9õñò8¨:3¹òöº øº°rºÚ…»Jò»'Hl»H¡»jÝ7»Š»¢V»·•…»Àìt»º¿+»©€‚»”$™»x‹W»;ޣ̹üÇ÷9Û¶3:3ƒ9_˜ÄºWúC»û»W3S»‹J/»¡ÐÙ»®eÇ»²I•»±ÌŠ»±"a»Á T»ºèÍ»´þô»µ*»Àº9»ÛË°¼P©¼&«¼5>¡¼EËš¼L ¼IRÖ¼A…ϼ7Œ©¼+8p¼¸Ñ¼ è»ú Ä»åyû»Ð*_»«3»YI_º\ :Åu/;Iùž;{½;Œæ; AK;¾Œ;ãC¡<+<½Ý?ƺM3Úº§ɺÚ\Ñ»L•»!­»=€»`ò»‡¼P»¤+é»»±Ç»ÃR„»¸T满㑻‡ú›»Uúí»3ÁºoÉy9HŽ:F©ß:àš¹ºƒ±ºÛô´»G·è»‰ü;»¥äÀ»· »¿ »Âê~»Ã¡4»ÇDG»½™»²àr»°™»½,„»ß®¼ Ô¼)˜¶¼CÀ¼R“¼S«»¼L ó¼@¹À¼3Ïм$·J¼ð¼Õ¢»ó¼»àŽl»À…ü»…ÑŽºÑ!«:aV;%ÞÄ;Z—;{+E;•w3;¸/ ;àÈÚ<ù"<â<3¢<¼¢<ŽM<¸Þ<èã<,;<n<˜< Ÿ=<3f;êÝ×;Þ`;ÜUþ;Û‹Ö;Ö³/;ÑÊu;Ѥ;Ó©ë;ÑoA;È«p;¼­é;²ƒ;®ö;°’´;¸N ;ÀQ¬;Ã;¼©l;«¸`;µ5;TfÕ;È:š–Ä:Yh:GñX:k 8IJfº 沺‘ ºÏ¼V»Aj»ýï»7š}»Z°Õ»†©Ë»¤=²»ºÿ»¼Ó¹»«øo»‘J™»iH»)¥º¾Sß¹ T9ý2:‰)¸¡ˆíºªn\»28“»ƒ'w»¢Úò»·=`»Âª³»È¿Ÿ»Êå»ÅU¶»»C¾»°dY»¯™»Ã Z»ïšÐ¼k¼7Å=¼N÷\¼Wn=¼Rí¼F‘š¼8Ɖ¼*E¼ Ñ¼ Æg¼kt»î;Þ»Ñî»™oh»ÝÇ9¹Þ; PÂ;C9 ;eÖp;&“;³ô;áŒ<DÔ<®î<#€<ß~<<â<Q»<©<@«<Pô<hu;óñu;∮;Û ;ÖuÎ;ÏÂí;ɘ»;Ç4;LJ;Âg;·Ú0;ªF„;ŸfÌ;œ~z;£^¼;°»;ºÏë;¼WO;±}Ñ;™êr;nâ;Ç‚:·"f:ksy:R×m:9Ph9­‘¹Š@–ºh+}º½%dºþ0 »/Z»8ˆú»\]»†ò©»¡»2»±Èý»­63»–炙th“»:¡Nºù·¬;_*; |ë:¤0¼:e¯:^…:€Çw:—Pl:¯j:ÉŠ‘:çö;L[; ©;?»;[–;m•1;tþ•;z¥I;„XW;·[;žÑ;ª=Ã;±»­;¶'à;¶|Á;®ñ~;Ÿ;„O(;^\Û;RwE;nI¸;’Yû;¬Ð;¹æ4;´ý0;¡¨W;‡© ;]<§;5õ~;t™;†æ:ЬH:™:Cxc9ÒæÚ9k¤9‚b9߶œ:/õœ:q?¢:—ì:³då:Òê;(†;"¥#;Nô;|ú¢;’!d; l%;ªr;±%¸;¸6û;Á;l;Íx;ÜAã;Ö ;Üè0;ß–p;ಾ;à¡Æ;ÜC];ÏÝl;¼0¨;¨Pç;&°;žÃÁ;ª{;·Ë_;¿Æ ;ºé;£ä¯;q°ž:ôá&¹.ëÆ»ò»Tq»wQ»vÐa»jʯ»d,Š»go»p‰8»zFg»€hs»"°»nÀB»MTw»"‚Ùºýª¿ºãmĺøâj»K-»ôdºÜÍÔº8¶ ::Õ i;#“v;K ®;c‹;i‘?;ZA‹;AªS;7@H;H¥ª;oµÅ;t;ªæ;É"Ì;ègË<ÔŒ< ŸA<sÞ<|»<ÝÃ;áôŸ;²d;G¿;0v«:ónö:Àå:ºêm:ͽB:ëór;,ì;éÆ;'TØ;82Ž;NõY;k‹›;ƒpy;Œ›é;‘Aì;•Wó;œ’+;¦º@;°ìa;¹F;¿bC;Á ¤;¼=Ò;¬l;;”§K;|k;h‹Ç;{4â;•‡h;®á÷;¼;¶²o;¡sœ;„ú™;Tèl;.=;;b];Ÿ”:ÝOJ:®á::€ ƒ:6y‹:Ãô:w:B–:,xe:VÕ·:‰:é:®ûÈ:ÝC©; é#;,&;Oèû;rºÑ;ˆ1.;“NE;›²‰;£ó0;®qí;»Û^;ÊM*;Ĺ—;É>¶;ÊÎB;ÌìØ;Ïšÿ;Î^;Äm†;²Û;Ÿó,;•{P;–Áß; ô;ª´ô;«È_;›RÝ;j9:컃¹„{w» ²Š»a©»‚¥»Øn»nè7»fÔï»o\»TP»‹¬»‘èÈ»’m»…Ƚ»f½»<\ »;x»ÒG»(«»6¯E».ew»Ò«ºe¾q9ÔM%:Çðg;Ñ©;1±Z;6´#;([à;¬Ÿ;; ];+Ìn;R %;} ”;™w;º.;Ûz¾;÷nÏ<#u<ø“<Öš;ä´ç;¹BN;‹à™;LÑñ;ü‘; ·; f;¥;,xÆ;A?¹;Sq­;b¯#;rï;„¡{;’‚¦;ŸF;§} ;«à;°å;¶;I;½¢;ÄÖ˜;Ë;Î…;Ëò;½–x;§¬;SÉ;¨Ø;…³Æ;˜ù$;¯”µ;»¬‘;µ©;Ÿ›¥;‚tí;OΞ;*j–;t;ª?:ááJ:º R:”<œ:m­:@úô:áò:f :…:A¼:‹ê¤:ÁpÌ:øÄ^;ç¨;1r|;M˜;i`Î;€LÌ;‰c;’lœ;ž€;¬wm;ºªí;·Äá;»aV;½1;Áè<;Ç}Ÿ;È®;¿„Ë;­9;˜Êä;‹{È;ˆÑè;Qi;;c;‡*†;Tw:àD…¹{ÁÔ» o$»hÜ㻈‰­»‡S»yÚ‘»mSà»uDÍ»‡·»—ý»¢+§»¢([»–Sß»‚°i»^j»FP@»ET¸»SiU»\:H»Iù%»öº‚9¨W”:¯À¥:ù/Ÿ;Rô:óòÖ:Ëod:±(¤:¿çè:õkf;¢=;?Jë;h…Œ;Rº;®é‡;Î)Ê;è†R;øFÓ;ö=k;ßd#;¹“Ê;±;;_nx;8sw;,—;5i§;J6±;bÕ$;y‚;…åø;];–{×;¢™';°’};¼UÌ;Çj;Ǫ;Ëcž;Ï‚E;Ó·ø;×ìò;ÚÜh;ØÎF;Í›;¸Åƒ; b¤;\é;Ž];œ§;¯³v;ºf;³  ;ž$ñ;‚#!;Qa°;,Œ;ªe:ÿ h:×Þ×:³¦*:–“:{ :CiÑ: Så9јj9ÿš[:TÊE:¨×t:é­;4;%)4;;ªx;T\;k8ý;}Êc;ˆ§;“´Ž;¡ãŒ;¯(D;¯/s;²·;¶²‹;½Ð;Å«¢;Ç]C;¼ò`;§N^;ŽU ;v;bl6;[;N•ª;)8:½j¹]]«»\l»g@A»©»¡š»‡ è»|S»~®¡»ŒÍ7» Ê5»°½œ»´Ö»©10»–N|»„k4»u »tÄ¡»~Èž»Xw»b h» kºíO9!9Þ:{œ8:£æ:›q©:4:a@G:€H:³g%:ø[;•;<ò¾;b8¤;ˆŠö;¤@u;ÁtŸ;ÙBv;á`Õ;Ó± ;´ÜL;‘g×;jH;Kñƒ;Hs·;Y€;u¼;ˆ„;“ì;œžÐ;¤²m;¯{;¼ÑŠ;Ë?©;ÖŠè;Ý‚¹;áƒ;ã‹ò;äŒ;äG;ä8¾;âCÞ;Ùt¹;Ç/À;¯gç;œDG;—0ó; âm;°ð;¸M;±Õæ;ž;„¤ª;Y²ã;369;:Õ:ìŽU:»ÇÝ:›d':‡ù2:eKH:%û“9Ó µ9¾Ã‘:"ï-:”'g:áÍØ; ;*GË;? 3;U;j—;|b¦;†ŠÙ;á-;)ƒ;¨=6;©áò;­Ÿ;³ÂÀ;½Oä;ÆJ;ÆM¼;¸5z;!Z;z[×;CÄ;Å;½±:ÏŠI:\ç[¹¿Èüºûï<»`aλß$»›"r»”æn»ŠU~»‡Wó»’—Ù»¨ç»¾»ÅÎM»½“Œ»¬«-»œùÅ»”`Ñ»“I滕Œ»d»wÚp»,"<º¥ u¹,á'9Ê%x:rÜ9æ¾Ì9é‹Å:$˜Z:†Oè:ÍáS; d);)®´;B‹N;]|;èO;œB–;·±\;Ç®x;Âû;¬7;Jâ;p8};Z'x;^|ÿ;wÃ;‹Ô);še;¤Ô ;¬•;µÐ;ÁR­;ÐÂ3;ßÕ;ëKš;òR";ôÙ–;òÁÆ;íÂj;é ;åu¾;ÞÒ,;ÐmÇ;»GR;§öÕ; 8d;¥ýY;±f$;·$4;°¢ƒ;Ÿ@÷;‰€;eE-;9Î2; Þ:ʸ:‘Hû:s5q:dtÁ:Dn#: ²9ÖO¾:ë+:‡Îw:ßFµ;>k;;P;S£ ;i4;|vç;…î«;Œ‘W;”K›;š¸ä\ºi›&»e¬»_Rd»”lH»¦1Ü»¤ÚÏ»™ìc»’Ô4»šŒ»±{лÊß»»×.<»Ñìî»ÃJ»µÛ‹»®oœ»¬5x»ªyj» š}»†DY»9EžºÅ|kºaN¹x’t¹y¬7¨9xR:>5Ë:§t÷:÷Í“;Í|;4êQ;B.ƒ;Va;}-ÿ;˜œà;¬r ;®÷^; “ ;‹V;tSx;gYÔ;sK^;ˆØÅ;šF¥;§Çs;°R;¶‹µ;¿–ˆ;ÍbÍ;ÝüÈ;íf‹;øÈl;þX_;üb™;ó¹”;élÒ;âGî;ÜùŒ;Óƒ&;ÃMM;².;©li;¬½;³µÀ;¶¯¹;¯Î~; žÏ;Bp;n~¾;:z;;)p:š#Æ:EMû:6H#:D…:6]:„¶:)n:‡@Æ:ß&,;!ý‹;N>3;o[n;ƒµœ;Œk¿;’. ;–A;š¡Ì;Ÿ¦;£Ì7;¤é“;©s;²‹­;½"‰;Áò-;¹;žCi;g’£;†:ís¹ûòºœÍºêÜ»(Ë·»pPs»œrÖ»³"Û»¶Ó»«O½» Í»¤å›»»j»×Êz»ç§ »äœ»×¡Û»ÌMa»Æ’»ÄJ»¿Wç»°»ÜY»G:ºëy̺ˆ¬–º7s¹æ"¸¤ë09Ä—:n5Ï:ÉO­; z;)fì;4;M;<‚e;Ufþ;Û2;“lÍ;šP;“Š;†·ˆ;yƒ;wy/;…‹T;–}%;§;±±;· :;¼P=;Åæ@;Ô˜©;åA;óõ×;ýtf;þ?î;ôå;æ1;Ú‘J;Õ&Y;Р;Ç ;º]S;²_¹;²â;· u;·!×;¯?š;¡O§;~Y;p,«;1ü:Ó ::JPt9ñ:óå:BÜž:MÇ:Y¯Í:‘U:ßGi;$hó;YêÅ;‚¿¤;‘­Z;šK[;ž€;Ÿ_v; r9;¢=;£Ti;¤Šç;©àç;³Zg;¼$•;¼*;¬$;ˆ–K;)sÉ:Nnuº^d.»™Ü»6ò_»`M»‹Vx»«f»ÃJ9»È€¹»½pþ»° z»°ûG»ÆŸ »äÅ–»öÛy»ôÂp»èdÞ»ÞÞP»Û•!»Ùí­»Ò•W»½r7»—8 »QcŒ»Ç溪•ºdC<¹ø"›¸¬¾9åäü:…Á§:Þw‰;}<;&õP;.Š“;? ®;_G;€k;ˆjÑ;‡ÿ;‚óØ;€õõ;†(“;“‚”;¤.;²Ñ;¸©Y;»=µ;¿È ;É×ò;ØcÑ;縆;óå¥;øcÆ;ñKU;àü};ÑJW;Ê%„;É/‰;ÆÑ;¿Ê;ºM/;º;»Á½;¸ìM;¯Iµ;¡B;Ž¢=;gÖÁ;>\:œíŒ9ܬ9 %A:„·:cOý:„Þ: o:ÝÀ;Mó;WôÇ;…ãŸ;˜• ;¢¨Ý;¥½;¥¨;£Ó1;£0;£6;¥ƒ;«Úf;µ;ºÎÛ;´é;›ƒÅ;[»ô:À„̺fO»m»fo;±,;º²>;½÷;½À~;Âuq;̲ë;Ú¥;æ›;íÛ;êO;Û˜Ò;É~Š;¿s;¿™â;ÂkU; ‰;À|ï;Á'š;Á ;¼rZ;°_Ñ;Ÿú¯;Š±Z;V™Í;ýh:Päò9OX9¢x²:@ݧ:Œú¡¼¼O¼¾„¼Â–w¼Ç;6¼Êˆ¼Î#¼Öõ­¼åS0¼óè¼÷Û<¼æ͆¼¾r¹¼‘f¼÷;"µ<‰£š<ñíŒ=W”=iH<è Î<«Å;<…¾,¼@vm¼¹¦»‡ *¹âÔ:ɦ:!›» «»`sð»âc:ÂÔU;£Ñô;ûï7<,o °¹ÓSÊ»†È³¼ 襼[+¼*Ÿ¼§7|¼¥‚󼋻<¼ýp:þ½r<-'@=ca_=N¶=$Xà<ÅËÜ;dïæ¼–½Ú¬½'Hý½‡¼|.!;ï3<êú =4„°=Sù@=ZœW=U\=L +=@»=0 Ñ= ô<÷;,<¾ùd<4\B;F'°»ûÞÕ¼\½Â¼–ż›á¼Kš¼;âö»fç;-”¸;³Š$;»»“;•ÃL;yÛº–!:»›qè»ø0]¼ˆã¼BT¸¼nw¼Šêª¼’û¼Š±ã¼wI̼b€Ü¼`ú¼e`­¼MáL»ög:ƒ?Ä8¼ n»ŸÎñ»2·ÅºÉ¿×ºÉ¿³»]%C»ÙBǼ#÷J¼S0¼€¯~¼šš·¼²¨Ä¼ÀB~¼Àƒ}¼¹XÕ¼²<‘¼«{D¼›¼a‹Ú»®<è <¦âÞ<ùß= ‹=)¶=3í×=;`z=?Æ=?YÆ=:À=/ë³=R=}<¥Wj;È×È»ëF’¼b¨¼ãk;¿ <Ó´Æ=1x:=YœO=_Øã=P˜=:Òþ=&—=¬q<ý¹Þ<ÐÑ<©m`< <…•œ<~Úœ<]'=<$Ê@<€¸<…æ<Ø{<Ÿ^¿<05 ;3ß:AW»¡Ë¼ ó¼EV€¼X‡j¼Gº¬¼8+мKn¥¼‚B„¼©1š¼Î}¼æ|†¼éÏ­¼ÕÝa¼¨Û{¼<Ýí:͹¤<’€ =R=J½©=qÿ5=€§@=z÷)=dÍ=BþÃ=f<ûq‡<Ã^Ø<œæ{<•¼†<¼IŸ==.ÉÓ=D-#=<ÝN=©S<ôg5<²vŠ<ˆ·¶ð7=Y=[ës=I¹=%ÞŠ<õÙû<¦Ù„<§Î:<3÷«;¨ ;˜rž<à à=+c=°º<³žþ=&${=Ãö<ÌÌÃ<]v-;¿÷:®°;·}‚1í<°<0R@<À‚ª<¿¬<«DÆ<‡û£<‡f|<±Šƒ=8m=Rn=“o<¯_¨<‹±ó<­HY<ËGo<Íj«<¹"¤<•SC<§q´<á€þ=€ô<Ð<²Äô<ÉÙ¨<É;.<«C®<ÇÙU<Úzû<Ç$‘<À³ ºi¢¸*FÏ9ce¸ˆ¡ÉºŠËª» A»pÔ¦»™Û£»° \»½#`»ÄÚK»È[´»¿Aû»¸û±›õ»·ød»Õt3¼³b¼&ùM¼Cö+¼Smk¼Rý1¼GÃA¼9Re¼+¼=`¼Xz¼ro»ù¾J»Ý:»§|Ò»-Á`¸Hv:î)O;3®;WÈá;ˆ;!;³iå;ånù< „Ò<õN<Ø@<Ð<ž<-<<<8;<¹±< l;ûé¶;授;Øÿ:;Ï'Þ;Å ´;¼×;¹4;·Wx;±ÔO;¦}l;˜i;ŽTÝ;ŽÏu;š×þ;«b};µÆ ;²Ç; Õ ;Íí;5Ó3:Û”×:…N:Zãé:M¯]:ÌB·Ýcº)Pšº¨4–º÷¹`»àŒ»@¾L»dØT»ˆKg»œ¢P»£ÖÚ»—d¼»zì„»B|\» Â6º±¯¤º*¹*2Þ¹‘âº~» \L»W‹«»ŒÓô»£öp»²KI»»:#»À5‹»¹|{»·õ£»¹Ìô»Êñ!»ó$‚¼b¼5s’¼IÁõ¼M莼Dl»¼5³a¼(£E¼]ã¼v¼ ò2¼s»æ»°ôâ»D=¹ÌI°:Ë¡,;'öÉ;Qq ;ˆ­;¸9];îé¡<·V<¤è< —Q<@<]ü<Ì¿<8—<Tt< G£<nR;ë&Q;××@;dz³;¸ˆ‘;¬÷Y;§„ô;¥7²; 9;•¯Ð;ˆÎñ;ˆÖ;†ÁÛ;—#Ê;¨/;­ö±;¢÷ß;ˆœ§;HÑ:ÿD3:™h+:eÑe:Xò“:*³9QÅ×¹æ6gº—–€º÷Ï¡»(«R»OA;»r˜A»Šob»–}»“ty»€9;»I®þ»ÚºÓÑ÷º…eººbк‡ÿ–º÷%Z»=ËÆ»{Jc»•E§»¥7Á»¯ß»¶õÝ»¶Ù/»½"»ÉËš»æÓZ¼ ‚X¼'Úâ¼>=ϼF ¼>•¼/®™¼"Ê…¼kò¼Ãh¼ØU¼%Z»í¦Š»·Æý»V@_º:v—:©Ò‰; =ó;SGÑ;õ…;ÃlI;ýŠÃ<my< Û ;•~ß;“R;þ…;‡»;{«D;u¤|;„_:;•ÖÜ;¢W;Ÿ¡;Š;€;RÌA; à :ªm”:nÉÐ:Z¦Ì:<Š9¯­¯¹¡a>ºþv»Øv»6Ì»aµÇ»Žd»$¤»¼¢»„#,»X(»!ÊAºè½Èº£>%ºh=åºTDȺøܺâI³»%­ã»[È4»……6»—«»¥»¯fo»· “»Ç-»ß@x¼=…¼ˆ?¼3f+¼>)™¼9¼*)¼…R¼Ï-¼¡N¼ÿp¼ ”A»ö컾Su»g+ŽºˆÕY:…1;H;\‘Ð;™Æ;ÔÁp<$<·G<$2Y< ôˆ<‘B<ô< í< š°<Ù¯;õ@;ÛüÍ;ÀÇ;¥òd;‘=P;‡<Œ;…cè;„I~;~zV;r©;t¯P;…M4;’‘m;•L™;†‚~;Rø•;­u:°É/:k…Y:Mˆ»:7ûK9À¿¹”6&º—[A» «´»E×B»t•»‰“[»ÛA»Šwú»o”z»9f§»¹)º¹?º…âòºl4ÕºaíºÍÞí»ö»=ÂB»k¤»ŠCÆ»›I<»©úR»º:»Òä”»õeÛ¼rõ¼(”¥¼6¶$¼5\]¼'Ö¼®Å¼´Ø¼}Ó¼I×¼Ql¼D~»Æ¡n»yïóº¸PÐ:7×;R¿;jŬ;©þÈ;ê/F<Dñ<# Ü<%Ç<§I<eë< <<Á+;öáÓ;ß«Ù;‘Q;£ý?;‹·W;§Ê;| `;~šÄ;zã;uú ;{$Ó;…i;ˆ¸s;}`ÿ;Kw¼; ü:ªOL:UpB:-°ú:ú9”ú¹ÂŽ®º©x»R'»Tµþ»çλ”Ì»‘s»…¿;»[͹»!âAºÜäZº• ºj€º‚¢Öº´UºøSª»#v»N`l»zœÂ»‘û}»¥™<»»Ér»ÜÔè¼sƼå{¼-,„¼1Ú(¼'ñ¼êU¼;¼š¼Êœ¼ €¼­¹»ÑÈŠ»ˆ'“ºìC9¹š; æG;z;»¯G<k<)5<&…ä<"d<¿ä<ßS<ÃÄ;ûœd;óþ;áš;Ř(;¦F;Œ>Á;~öQ;|ŠF;€¡;€Æg; ;H;}«9;kš‘;@.3;‚¹:›Dê:/›9ú÷%9Ìþ38ÖÁPº3äºÁ©¥»#.»^·ß»…ûN»’*€»˜»€´»H—&» ʾº²ª(ºln–º[Àº”wºÑác» C·»4ï»bŸ²»ˆÕæ» ï »ºç&»áÛ¬¼ýô¼¼*•¨¼(LI¼PɼD¼ A¼ÌÓ¼H¥¼ Ú»ßØÓ»•c•»St·L·’;jº;ƒg;ËoI<ÿÆ< À[<%ÅÖ<™< gº;û[¥;ïûØ;êCT;Þ>Ú;Ç‹;©<“;Ù×;ƒLÇ;‚MÂ;„ݘ;„âK;’q;v´ý;__;5ó±:ú]Ï:‹*:|î9‰µ 9-¹¢ñºDþ9º×Xc»)º»`Ô8»…À»ä@»Œš »o‹¿»1?êºãôº„Ý:º8ÙÞº_­º©toºïÿ‰»¼˜»Mµ)»€ú»›F»¶°^»à¼ë¼èf¼¯¼#Ч¼Z¼£ý¼m²¼p¼!ž@¼í»ð®»¤Žn»-g½¹Ã«(:ðl¢;‡5;Ö…ñ<h¤¥¼$¢k¼V¼´?»µq1»JN„º<Å5:×Èz;ˆð;Û¹;<¿•<ÒÜ<©<Í8;îǪ;Ûé;а@;ÀsÆ;¨Qí;‘¹Ò;…ýô;ƒ¢/;‚ø;vPk;ZÕ;/Ðz:ô-É:Ã+9’Òz¸øö¶¹¡T4ºëPº‡WCºß)A»ý½»K‘N»v »…êš»wH»9ŸÌºÙÀæº>V¹³íº¾ÍºöA»%hœ»Vœ»h…q»;˜˜ºÄš«¹‚wü9Ž=¸]ÞºZPÖºé÷ž»2Î|»oô»Ül»Àc»ôí/¼åÁ¼¼Õ¼#Sy¼#*ؼ†Ð»íý»—Òdºðõ›:|ë|;y_²;ÒÅ­<^< ·]<=È;ãG‰;¿®Ä;œµã;wÛ9;F¥;$ª;¾e:Å~2:„,Y:d˜·îÅ›º Å)ºphŽºšC‹º³ÆºÚy»Ãg»G#²»O1È»cNº+ à9ï¸Ù:¹‘¸‡¶¥ºOл<ž»S滄ïp»¼P»÷8¼i^¼¡Œ¼!€¼«S»ý³–»«/û¦º:;OÑ;ql;Ïž<Ln<õ¦;õqÐ;Ì3t; fó;m Ž;'ж:çi:“Y°:+÷»9½u€8o°¹Ñ 4ºk~º¢/ີ"ªºÎì» }л7½:». ôº²+9r–“:ˆó:Hø½¹a>Bº»}8»/a©»tÇ »»ÖÑ»üá ¼¼ýù¼’¼ÍÁ»¾(c»2ºÕ:aù;p°;Ð à<¯°<ˆ—;Ý*Ñ;«Ð;m@â;ÉÇ:ˆt»9_и‡¯?¸ûMÔ¹¢Ë¤ºOœº¥ã­ºÁ¶ºÖ8R» â»' »:é¹ã,:‰Ùb:½:A:qºK˜»§š»`JE»½¾ ¼ý:¼ŽÔ¼æ/¼ ow»Ïš‹»LY9ëÑT;{h¶;Ôo<;û;ì13;»i¦;{c:ÿ+þ9Û8õ¹ò-Rº Ó?º¤ôº:ëmº£tºÓܺëz4» Æ8»Eº¢B»: C:áÃY:Ï’9Ð_‘º®õæ»LÀ»Á»¼à4¼fӼ˻ßK»`T•:·;‰±º;Û{d;ðÜ¥;θ;ŠæD:ø%ñ¸‡îĺ‡Hº„¥¼ºcÀ³º¡áƒºãUa»©» Z~ºè)“¹˜1Å:ÃÊÊ; Ã:«Hºßò»<b»É ¼ 鼫7»íä²»o\á:] ;›Áæ;â)1;Ýz…;zZ;dµ¹Òªåº¾hº²g“º¶:Aºôy» •Þ»íºŠƒ·:b&›;Tú; 4À9#k\»2½»Õ÷‚¼ of»û«»}TM:«±;²&#;áó´;³†.;®º%ä_ºíÁÒºðuÊ»†t»`qºÝÞi8³°;`‹;6œ:oÁ%»4Ϊ»é|¯¼ˆ›»ˆQ~:üØ7;É9Ò;Ê5v;7¯ºb¤»Ì2»%æá»ø_º‰Ÿô:ÏSm;Yr²:áP‡»Nu³»ønI»™ g;5Û‰;Ô‘;gv[º©Ðâ»N…g»1–7!&¬;b~d;.Cô»Š*(»¶åÁ;…BL;™Þ»¼»d}0:ê_›;~§»ËO ;À𠻘Ղ;Ÿ$:«Ö:Ù—;~9;GÇ;~7{;•"¾;¢KÑ;¦üJ;¦‹Ê;¤ªÄ;£^Ö;£Cz;§E ;®ŽÖ;¶é-;¸’u;ª|ä;†íª;þ9g8ºþQ»pR»S,»¶æP»ÎÁ»ãÜ»éP_»Þ;À:;Åx—;Ïa5;Ú‡6;âÐO;âù’;׆¥;ÅQ);¸*z;¶Ç¿;¼t÷;ÁŠæ;Īý;Ç´5;ÈO;Át÷;²r;žSö;„a¤;@#:Ð á:!49 1j9ä|:sñ:¨p•:Îàs;œú;-Ÿí;_ÄÈ;‡rC;˜;¡\ì;£íÜ;£š¥;£ ;£Å¢;¨ŸÐ;°„;·Kj;³©Ä;œ.;YQò:¢¯º‘»T&ö»œ²ä»¼¶=»ÓÕ.»æj¢»î1»æF‰»Ø9í»ÕÑ)»éQ¼”¼;†¼g%¼Z‚¼&h¼•¼Ýt»ít»ÀV^»†¡¦»"=ýº¯?ºMŸº-20º$/^¹å™9Õ©°:¡þ :ü×Z;#’ï;DŸ«;\Æ2;i‹•;t 8;ƒÏŽ;“Á;§F;·þ ;Ár÷;Ãæ;ÁÂQ;Ã[[;É”Š;Ò[k;Ú-;Ü›­;Õ;Ù;Å$ž;µïd;±E&;¶Õ;¿|¿;Ç;Í5{;ÎÇç;Æ´¬;´…%;›ÂK;xÓ;'Ñ#:¡vR9ª—*9Dòo: Ñ:74:¹£Ô:ã±;ÐÉ;8)e;eù;†Ê;•_M;kå; ¯;¡øi;£èf;¨×;¯îE;´;©Ç;‡™;Gi¸C#绽³»Œo»³œ‹»ÊÿÙ»Û“Y»å6»ã\z»ÛÄx»Ý1»ñö÷¼ \6¼ø¼F•¼Bm¼ !*¼Å6¼îÙ»åÓ»®ÿœ»`#ºí‡ººdÐÀº%´#ºH 7ºA„³¹kk¿:%PD:Äm;ªX;=n‹;Z$X;h'²;rç`;„5[;– j;ª˜â;ºõµ;Âý*;Ä‚';Å q;È…û;ζÂ;ÔýY;×þ ;Óã;ÇS';¸"_;°7»;³;½hv;ÈB%;Ñs;Ógi;Ê"ä;´ÒÐ;—\å;eó8;ÑÓ:x˪9ƒ›Ü9“)s::,²:“Õä:¼w':ç¾;{—;6Ó;`·Å;„?²;’Û6;› å;žöI;¢O{;¤¥;«o;ªùŒ;—¼;R¬>:‹Ÿ&º³b_»d‡» ¬»·Ü¹»Å1¡»Ï¬»Ô^í»Özûß"»÷( ¼ Úp¼%F¼//¼Ä-¼Aß¼ ¤K¼¾“»Õn,»•)»&îHº@6º@¹º{ºYÛº(–á8•œc:ƒ¸:ù 0;.R;P•‰;ai¾;l½ê;/¹;“Sõ;¨ü;¸nS;Á³Ö;ÆF@;Ê)¯;Îé¯;ÓJt;Õ/¼;ÒXf;É%õ;¼À;²±I;³; ;¼k);ÈY;ÒdÔ;Ô€å;ɦÑ;±…;§;O{¬:ï¿Ã:;%ó9\ƒA9°‡$:?­: :µ¡?:ß|º; $®;38-;`¯H;„;‘ÌŸ;˜¾Ë;¨;œB; ûÛ;šâÁ;{\¤;¾H¹wù™»$+»»†ÞY» ™·»ªA—»±æ8»¼Q»ÉG»ÛT»øŽÌ¼à÷¼ò¼"Ÿ“¼j¼Nå¼ ,¼»÷]€»½äûjÒºÑBU¹Ü:˹R+éº Zfº6š¹—MI:³¿:ÄÌ;« ;>ñ ;Ršº;_;tsŒ;‹ûþ; ª›;²¦¢;¿Õs;ÉR‘;Ð<é;Ô7Ò;Ôi%;ÐŒl;ÈÉ.;¾uY;¶ª;µ˜;¼¦ï;ÈŠ;Ðä-;Ñ(;ÄK;©žR;…(;4ÕÝ:¾[Ñ:è9%úb9±«:8ÄY:‰zS:°æ*:Ü•;A×;:Œ6;h§ ;…dã;;•xÈ;v.;‘Ñ/;„wÖ;;4Æ:hÌ4º´ »Qúl»ˆYè»åÞ»”Ô¡» âJ»¶N »Òÿ»öèB¼¶÷¼ ×ü¼(ú¼$ˆ¼Ë༠Yx»è­˜»¡¤:»&=•º0UD9+˜‘8–ùž ¶¹’´Ì9žV†:™ Œ;ôU;)Þ;>¤â;L;A;aæˆ;‚“&;—ýÍ;­;¿p_;ÍTÖ;Ôãý;Õ9ì;Ï„p;Æ Â;½”‰;·—9Ø›p:Œ-ˆ:ì«&;½{;,ÇÀ;:×;QUÿ;uýŒ;’"j;ªÔ;ÁCJ;Г0;Õ8p;Ï­ƒ;Ęt;º9Ï;´Ó;µ¢Ë;»š~;ºB;Ål;¾Do;¬dž;Žï¹;N…µ:í4:2M 8¬žI8„ÙÇ9Ù»Z:iRs:­˜V:àÀ²;²;6…y;Y›n;pbŒ;}ð|;lVg;\;(:Œ6ìºK‰Ê»U9»D <»Ol‡»cq!»ŽOè»»Aý»îY‡¼©š¼#Í?¼/"b¼.G(¼!;³¼Ùv»Âó»KlÒºèb:b)î:œøy:GÝ:vzW:¬:õ{¾;çB;%Zš;1Ù;J'O;q½Æ;’¦;­ƒ;Ä0»;Ш­;ÏhW;Ãüá;¶ÒZ;¯¢ý;°~g;¶F#;»{é;ºš~;°ÚX;§Ü;?;-Êç:¬‘89¡v¸¶át8̬¿:"F:Ÿç:àüU;B`;.ˆ5;LU;_ó’;j(;Z¼ó;D?; "X:*Óâºt `» »$Í»=ïÁ»wÚC»­š»çJî¼Óï¼$,p¼0EG¼/´W¼ ÕO¼Áè»­;´»Ÿ£9Gã!:ÄqË:ëÃÌ:å½b:ø†7;&’;&;.9$;8{;Q€_;{ë;˜ø;²OU;ůÕ;˸°;ÃÙX;µ9L;ª-z;¨#;¬*Æ;¯lŽ;¬T>;¡f®;Ž~¤;`äV; ¼:Tü¸‹‚C¹mLQ9d34:ym:ÙùO;¼J;08Ò;I0œ;Xg¸;^l;U¼G;<£g;E:%n=º?uWºÙ‚½»¾ »Sº¼»œêK»ÜÓм £¼#i]¼/¦¯¼.‹C¼½Ä»÷Ú5»—ÝXºÇm[:fPp; …õ;%4 ;.oõ;;z³;Eý°;Htg;OD;h4;‰[Œ;¡·¿;·¹;Âû;ÁZ+;´ÕÑ;¦˜;Ÿr;žy;ž~Ù;™ÈÔ;z ;|çJ;ADQ:Ò7Ü9‰®ð¹ðóq¹¬>9ßt$:´¾;s;3á#;L×T;Y¨Ç;\DE;^¼ü;F£; ²:`Ur¹ò—ºÈ9»,>\»ŠC»ÍÞª¼Bÿ¼!1¼-V9¼+4Ǽ†Ï»çôB»ƒ-vº^Ÿm:Ç$^;6ñ£;XæŒ;h”ù;p6;p®;ta;…9å;—Ñk;ª„ˆ;·MŸ;ºJT;²î;¤†Õ;—Ô ;):;ŠœC;ƒžt;uY;XzN;œ°:}á¹½ º`­D¹¼)Þ:>(:ñÙí;/ux;Pÿ€;aÓ;d• ;s…;\Õ„;!·˜:Œ*[¹àºõ¾»hÿ×»º.-¼8õ¼²!¼)®e¼&˜«¼?»×Qj»^v”¹[bY; !;bøÍ;„ÿ;Œòk;Ž–á;R´;˜‘9;¤âb;­è;°+;«s"; °;’s?;„2Ú;nm ;X,®;G ú;-¿‰:ßL—9VE;º†íÛº› ¹„/˜:”CÒ;ªõ;NN¿;iø¿;tvn;†y¨;v>;1Ë:ˆoκT—»3!»¡Þ»ï ¼}¬¼%H·¼!ϼ ìô»Æ—@»5ËŠ9ëØ;7)±;†©Þ;›ò;£!b;¦=k;©ü ;¬I[;¨©Ø; È¯;—ª;‹ß;v€š;O$ù;,òè; ä:úƒL:iº'3ºÖѪº¬XA8‡[*:ÚS;>¶;o#·;ƒ§;“ ¦;„ìx;1àí:-^°ºÔud»ƒÜ»ÖÄÔ¼®¼ ¼¼¢¼ì7»´¤?»¼P:šÐÉ;c„ò;œC÷;°Ùn;·Ê#;µÔ®;«$ ;š¿;Šý’;€c;e¡ª;9t¿; )Ù:×Ô:”^±6£º¾9b»«º“3­:,gv;s;kY¤;‹÷1;,ù;‰Ðc;!U¸7Ç»8ûž»¸¾¼WL¼Cw¼#S»ÿ$j»ž‡§ºœšÖ;¸•;‹Ì„;³áD;Áñ;¹ÛC; Ê9;ƒÿø;d`•;NßG;)M¥:è{4:Ž²€9Ä$¶º_Ùü»Sm»í7º9:ÐÐæ;[A‹;‘@·;¤ª ;‰‰˜:üÀ5º˜‰Æ»‘Ÿ»ó«p¼ƒ@¼œ;»î¥Å»€Jú¸5ò‹;Oƒ’;ª!;Ãcý;µÞ};;;Uà‰;3rê;²ì:È“Ã:&—鹬‰*ºÑf¹»Þ’ºÉÍÕ:#·;>Œw;“ x;ª o;„i:ŠŠ»6nU»ÔÏf¼”0¼æ6»Öa¼»+%:Â…x;’Ý´;¼ì;«ñR;t9;&}é;¡:©K69gŒñº‚RÕ» ­»‡O¹Ì(»;Gƒ;’6;°<;laý¹ê˜t»§çg¼ A̼ 矻±»kºKŒG;\eä;±Û;Ÿ×Ú;JÜú:ó¤':„¤¹ªºÛHö»!èRº²]:ÌW7;ã;´S®;* »FŸ&»úP»¼Á³»sX«:ߧƒ;¢C3;•s4;!ús:__ŽºU ù»jô»qá:ë;‹Ÿ;²Ê˜9vU»Õîy»ä/Fº€q;ý;ûn:ºGº¶ÏÀ»LöȺ‡‚‰;¾;œhr»–FJ»²–';Z £;€ë\ºÌsL»dòí;Aòµ:?Vêºz÷q:‘wºpQhealpy-1.8.1/healpy/test/data/smoothing_3_11_config_test_smoothing_masked.par0000654000175000017530000000031512276746731030040 0ustar zoncaplanck00000000000000infile = wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits outfile = !wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked_smoothed10deg_fortran.fits simul_type = 2 fwhm_arcmin = 600 nlmax = 64 iter_order = 3 ././@LongLink0000000000000000000000000000015000000000000011211 Lustar 00000000000000healpy-1.8.1/healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked_smoothed10deg_fortran.fitshealpy-1.8.1/healpy/test/data/wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked_smoothed10deg_fortran.f0000654000175000017530000046530012276746731034207 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2014-01-14T19:18:09' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 12288 / width of table in bytes NAXIS2 = 12 / 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 COMMENT COMMENT ----------------------------------------------- COMMENT Sky Map Pixelisation Specific Keywords COMMENT ----------------------------------------------- PIXTYPE = 'HEALPIX ' / HEALPIX Pixelisation ORDERING= 'RING ' / Pixel ordering scheme, either RING or NESTED NSIDE = 32 / Resolution parameter for HEALPIX FIRSTPIX= 0 / First pixel # (0 based) LASTPIX = 12287 / Last pixel # (0 based) COORDSYS= 'unknown ' / Pixelisation coordinate system COMMENT G = Galactic, E = ecliptic, C = celestial = equatorial BAD_DATA= -1.637500000000E+30 / Sentinel value given to bad pixels COMMENT COMMENT ----------------------------------------------- COMMENT Planck Simulation Specific Keywords COMMENT ----------------------------------------------- EXTNAME = 'SMOOTHED DATA' CREATOR = 'SMOOTHING' / Software creating the FITS file VERSION = '3.11 ' / Version of the simulation software COMMENT MAX-LPOL= 64 / Maximum Legendre order L POLCCONV= 'COSMO ' / Coord. convention for polarisation (COSMO/IAU) FWHM = 1.000000000000E+01 / [deg] FWHM of gaussian symmetric beam COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT Full sky data OBJECT = 'FULLSKY ' INDXSCHM= 'IMPLICIT' / Indexing : IMPLICIT or EXPLICIT GRAIN = 0 / Grain of pixel indexing COMMENT GRAIN=0 : no indexing of pixel data (IMPLICIT) COMMENT GRAIN=1 : 1 pixel index -> 1 pixel data (EXPLICIT) COMMENT GRAIN>1 : 1 pixel index -> data of GRAIN consecutive pixels (EXPLICIT) COMMENT POLAR = T / Polarisation included (True/False) DERIV = 0 / Derivative included (0, 1 or 2) COMMENT TTYPE1 = 'TEMPERATURE' / Temperature map TFORM1 = '1024E ' / data format of field: 4-byte REAL TUNIT1 = 'unknown ' / map unit COMMENT TTYPE2 = 'Q-POLARISATION' / Q Polarisation map TFORM2 = '1024E ' / data format of field: 4-byte REAL TUNIT2 = 'unknown ' / map unit COMMENT TTYPE3 = 'U-POLARISATION' / U Polarisation map TFORM3 = '1024E ' / data format of field: 4-byte REAL TUNIT3 = 'unknown ' / map unit COMMENT COMMENT COMMENT ************************* Input data ************************* COMMENT Input Map in wmap_band_iqumap_r9_7yr_W_v4_udgraded32_masked.fits COMMENT *************************************************************** COMMENT END <ħÕ<æ2|<Öø<¸þç<º-™<Ê”<ózR= ü˜<þ„<Ê£›<«ÄT<­ž|<µPû<¼¥Ú<ÌØÚ<üO_=ýQ=&7ë=Ûø<ñ•<»™/<›vI<™P4<§ë<°P]<´vÆ<·$<Ê]/=«Æ=&ÕÍ=A!{=AÊ=,p= »¸<ßA<©ø<…ó><~â<Žš?<£L<«>º<¬t<©XM<«ê<ß±="=-U¯=S”'=cQÇ=Zl¶=@¤x= ¸+=Á<ÍÀ&<–$=CG`=+€ë=4ê=©€<Ò–><“ŸÙ<~Ï<¥Ç½<èÕ*=Aí=M©ö=w¶K=Šá =‘½==r=‡*ñ=t4í=Y¢8=CãJ=1ûì=Âs= Ѫ<êù_<³A‡l=³?=sA=(n=*ú=,ÛÂ=.y=-¿ó=$u_= æÿ<Òß.<Œo<¥Ö<ôÒ¡=Ü·=-™È=3B¨=+¹]=$fC=ö¬= üo=.lü=@J1=Fõ¡=7Ú=Zƒ<Ô8%<‚¨U< ';šsX;„’;ÔY=*Ų=&=J3=Œ¿<ýá=‘Ç=è=0>=2Ea=ö€<ü\2<·pÌ;[â<"_z<„gÈ<´gœ<äp= „%=ÄÖ=+ñ÷=+e= 6¥=Jþ<øF<ì~Å<éÇØ<÷Yt= ¤p=ý*="r=]õ<ï <°`­<~·ò<>ŸX<M÷;ôÃF;¨3¯:ù÷¤¹È‹:S²;ÈOY<^™í<£g<¸?”<¨…<ƒwi<:S<L¦;Ä»n;ç÷ ;Ͳ¹Ê;nº™e—º÷ô”»r¿ä»Ó#ì¼W$¼%.[¼¹ñ¼Õ!»ì+:7ºÒS·»{ÞV»†D6»n’;·ì;³%; ¾::ì,ºˆ²º§™9§a|9É£¼¹ü*¹Ó]°¸Ñ¹:5¯f:”â9Í‚º½q»[®ô»ˆ»g/Óº×9:dz;£µ;ËÔú;„„ó::C ¡¸˜Íº›‚Ì» ;»l p»’µX»žÕ¤»—wD»/´»Ga²»Þº5O³:X@ý;4; ð»;Ò¤;Óÿô;«TÁ;jŠ; _Í:“N :‚×`9ùf\9ë#G:‰É–;d/;-9;-<£:ïÎ:‰ûºG\ãºÓæ…»æ-ºä”ºf?998qŒ:g †:€v*9è“«º ºàx¥»>ßó»„»¡¥Ô»°Í9»­rd»˜Ú§»x\»7úõºØÕ¹¯r÷:†å;+A‚;“øç;ÉâY;Ú¼Z;Áãk;—%Õ;`QÚ;"T]:Þ Û:Æ’:V²o:ÂU:|\æ:ê¢S;*²;;Eí;4Ð÷:èl"9Çe ºnÕ ºç¡¬» `-»-Xº¡ ¹gÅ@:NÛ:‚=±:W%\8~º‰ 1»©Ì»`Z뻕j«»³ø“»ÆEÓ»Ç$»´ ³»•¼»j®»&X4º¥Ò›9¡":¶v ;0K²;a;ë;à·û;Ôl;° W;Žã?;ojæ;DÊë;··:üXÈ:‘>#:5i¢:uAR:ÚM;!¹f;FžI;Os;1Åæ:ØeØ9„e:º‡e3ºõÑ3»ý^»š€ºÅÜ~º*;,90H:>«5:r g:V¹§ 异 N»37»€å_»§¤ »È¦M»Þ!e»ãR‹»Óm廲±»b‡»YÞ»GºZ÷:(é¬:óu;?;Š;ŠÚÅ;¿?š;æÉ;è¤Ý;ÈãÓ;¦$O;“gú;‡ “;jj;7an;cQ:¬™Â:Q¢Ý:uŽJ:Ò½p;}4;Ao;R§ö;M Ú;(‚ :Å€m9vvºJ–ºü›ñ»NÔ» ‹)ºßÊ£º‰®Ó¹¿µä9d¡-:/ F:TM9½°º/R†ºþ»Pz+»Æ»º ß»Þa®»ö²}»ÿƒª»ôq6»ÔE»ª&=»„ùr»JH<ºû©q¹ÕT:–>;*½;RÙ>;‹ À;ºI;érî;ûºj;å`6;¾d;¦Ë;¡¤u;šfî;…%6;O;Vu:½ü.:g,:v Y:ÏdW; ;BÂÐ;RÆä;S~©;Dlj;¬Á:´ºB8Њfº¦ºù&ñ»¹» >†ºï¼|º´mújÁé¹Ú¸³8á<:Ÿ:>y!93œrº|.>»¶È»i#T»žÈð»ËZâ»ófú¼ .¼ HÚ¼åð»÷/ø»Í$Ó»¡êÓ»~EO»> ʺÙÒ¸¢y:DZ;;3[§;fOn;Œ+æ;³vh;åQ‡<´d<”ì;ÛhQ;¹´í;±' ;´:*;ª‹Ž;Žîx;ZE;78:ÊZ:~:x– :Ë“;‡;K¤Q;\?–;Y¸†;OX‚;;UÒ;Fl:¦ï,8ÑÝlº‚‰Äºév·» ˆX» zsºøŽ¼ºÓ1º¯£ºˆ>IºI8/«:!¿K:4 7o}¡º(3»')Y»{ç?»©¾ˆ»Ùz¬¼»¼/*¼9¾¼pg¼ cv»ð7»ÅØ廞Žr»zÑþ»6ªÚºÃÁ·8©UÀ:ß6Z;Cª#;vMí;Ô‰;«†8;Úr<~Š< øÍ;øÆy;ÐÃJ;½";Ábß;Å.;´,;‘Hs;Y{á;*•:Ùj°:’½r:„Áa:ÈÛ;Ñr;U]‰;mzå;ißK;Zœü;Int;1uí;j7:™‰ê9 –ºZ£˜ºÎß:»¹¾»À^ºý¸ºçúκٴ½ºÊ%º¤–º1ãê8ÈŒ :1û:&¦ò¹è+º·E+»3cv»ƒçy»°¢ë»âÊE¼ ?>¼åh¼MA¼M¼À~¼¡â»éPÄ»ÅÑ»¡ƒŒ»}í¾»3ê躿K8(~ :Ù´š;HTQ;€ž;Pm;¤¨;ÊÝ;úõ< ß@<úô;éMk;Ë|€;ÇßÍ;Ò&;ϲÂ;µ7;2í;Q1};q÷:ñÒG:µ³:œð‰:Ëé;Æ;Y=§;|zZ;0ñ;m’a;Wo{;AÈø;%º´:öȪ:‰+v9+7Öº+亯ºìq«»Ü»³º÷ºôׄºö°¶ºçU£º±±Çº#ýÙ9PQ›:3>ð:sƹÁ÷gºÐ#)»;-»†[k»²üÇ»æ:è¼ HG¼Y¼!›Ž¼§f¼#)¼ \Ô¼–B»éù»Ëˆ^»§ûœ»P;»3̾ºÈ˜¹#¦Ü:½!Y;B£;ƒ]®;“ÓD;¡ à;¼"*;æh< ]< F;ü);ÛõŠ;Î…Û;Õÿ ;ÝÉÖ;ÑŸ;¯m<;…j²;F¨•;;n; o5:錄:ÊŒ:á:Ô;ôÌ;V¯q;€Ÿš;†ï ;€ª#;iÀ&;Q]¢;80s;‹c:׈V:g²Ó9 }ºŽZº’#èºÓä­ºü$»×~»6’»\»Ds» JºõMAº®.žº Ø9[Uä:S9:Aº5kKºëž¤»?àÞ»…Ü*»±ã»ãµ;¼ vƼâ3¼#R¼ä¼nù¼âC¼Gʼ¿»ñôg»Ôt\»¬ò^»ƒÒ»2«ºÕü¹Õ{':•éï;67;ƒ…];—ó;¡²‘;±Þ ;Ñs;õlå<â´<ùÍ;éB;Ö×=;×È ;áí~;á®;Ì Ÿ;¥ô»;zg“;>U×;$žÆ;^¯;ëÈ;ÍÜ;-;$…ã;S½;|Ÿ;‡|í;…I›;xÔ;bÃd;Jó·;.¹;H:µdQ:3QÕ8¦¹³¹ê°pº}Ò,ºÁx ºõEš»$k»¹%» ‰S»Ž»%»X[ºøIÒº©ã)ºüp7ò8ïè,¹©î*º“ç8»ƒ¯»D!ໃ±‚»¬'»Ü;G¼]¼8 ¼!K ¼E*¼tn¼Pé¼*Ó¼ó¼LR»úOª»Ø·¾»«Ú»zP1»,1ºÚü了:d”;&ül;€(;›Ì½;¦‡;­þ;¿—ù;Ú©é;òD¨;øCq;ì1;ÜÜY;ÙJ>;á[;ç4;Ý™ñ;žB;œÈq;n9M;:;*¶N;/¾;1Èê;*–Ã;'š¢;7ö2;X`/;vÿ†;ƒ!M;‚²Z;{F½;n½;^6ô;G=#;%¦ :ôƒ:“ËX9òk¸S+c¹ô˺mg%º·T$ºòè» U»fí»ã»¾»ÏO»! &»ïºÿb'ºµAºN¹Þ4ªº`|º#—ºÙ²a»{i»K ò»ÑÚ»¦þ»Ñ÷x»ÿè5¼Èï¼Ö¼¨à¼ |¼Ð\»ýf|¼Ê¼ Ó¼»û»úÎ[»Ó'(»¢`®»f5Æ»nLºÎáäº)Ìn:7ŸF;Àe;|†@;žµï;¬Šè;°A¢;µS;ÂeW;Ôk“;á:B;âN;Û"L;׶;ÝI;åM€;äaq;ÕDY;¹õ;—X;hË“;9l;.B;9–$;GwÙ;K†O;Ké?;U\;h•G;yZ¡;~,¸;x®Û;p£;k»È;hʬ;_#Â;FÛ+;OÛ:Û†:jâÿ9ê~¹LK̺BºhØ׺²“%ºñ» ä»-”»ío»‡«»%—è».«O»..Ò»" » //ºÔÂ8º›3ºƒõ±º—ѺÜôÕ»˜Î»5|P»WÊ;»‚~T»¡·»È»ïøg¼ w¼>¼d*¼ *¼»n»ù ¼<ˆ¼ ¼ =f¼W»îÍ߻‰»‘ Û»HL »@ɺ²okºi±:.k•;ò;w…;¡n;³ì?;·n;²Ëÿ;±+f;·¡ù;Ã];Ëí{;βg;Ïc>;Ô ¶;Üo?;áH•;ÜZ%;ÍTã;µ¼”;–z«;jŠï;;rÄ;/ñž;;§;Q ;a];k%Ñ;upk;€´ü;ƒYÀ;P&;o¹2;aì,;]Ïè;cçä;jp+;c¦;FÛ÷;|:Æx :8P8§4빘§º —Xº^ Öº¬yϺîc(» &ͻۻz™» ».»;Ôu;×À|;Ô¬;ÉâÜ;·™;šþº;sDþ;@À”;3f‚;9Ý;Op{;h·æ;}á‘;‡me;@T;0ä;…UÁ;qeÄ;ZD6;O2t8ˆ`{¸°ï8ͬ|6<€ºØžN:˜?Ý:¡Ñ»-÷»$Ô;YÖ=;hÍ¢»;^hºòä/8×·): ÇH:^i¢¸Vù»m7»?\9î£;Ž“v;žËã8ô1 »e$¯ºð‘x¸ú›þ6ÿÏŠ¸&¹M9˜/9²ŸÖº1)œ»ˆà»C‚ºâî;ˆÈ;š÷S;±\c;!» †µ»q6ȺïC,¹=P·2º9ºvvº(¹ƒî39<®·=–Dz»'#k»GM»ºúøÛ9Ê°;9:ƒ;Ê;¶­Â;~墸™ë5»]p’»qICºöX¢¹²³ê8ªY¯ºÍbº™ÚºŸ¶çºLFë¹¼à9À¹ã‹CºÚÚ4»:/˜»Rûûºx–:½Û™;TùÌ;š#·;³Ñ‹;—¸Œ:ÖO»è.»»S»i»å»¢º,†27'Tê¹¢‚“ºœŽÁºðµºïúĺ¯cǺ¬‡8‹j\¸•Œ¢º…£»’˜»Tu,»f5 »:,º°°ä9ÿxÁ; Ÿ/;e¸Á;–FÅ;¬Ï ;¡(;8Â5¹ç"7»L}Ü»„*»]!»åºsu¹˜*K¹fäAºwôš»7»( '»$ì»cºŒàj¹7ÿ8¬Ù ºÈOºà= »= ”»qD»}W»V÷]»žÇ¹‰<:¶©”;3oÅ;vVX;”M;¥^V;¡ïb;hc :h|[ºôEi»elλw8»No¥»ö ºÏQ\ºFû¶¹Á²º@ÎNºá8¶»6R»\[î»VÉ»04ºàÈzºÀ8棹n⺛×!»oë»buﻆ†»Šl?»qÿ^»$Áºi¨°:TÓ';îL;Yd$;†v‡;—(Î; Í•;Ÿ˜=;„³:õ° º*Í»%°N»ZnF»ZŒ´»@î»)%q»òº©¼¹º<ºBíº½ß»(ÇŽ»nÑ»ˆü®»…%©»b‚Q»!|•º¡%<¹Ž´È¸÷LKºFZþºò­D»FA »?¶»’m+»”ÿÏ»…Æ»AÊMº³>Ù9ÕvH;E ;Jþ;¯ì;–W;Ÿ’‡;¡mL;ž1;‰$å;(S¬9¨Ž"ºÎ¶œ»'ÈJ»;Wm»<Ó~»7ƒH»8&Ž»#Á#ºí]Gº–Õ`º{wغ³XQ»ù»a¹»‘ùỢHi»ž»ŠE¸»U€»w”º[JF¹˜wܺ ?}º¯½»"^»jêd»Vº»œð󻞠d»æ»Z`«ºã9ýÔ:÷¢;L=m;W7;˜«ô;©¸§;­…º;§Ö;ŸÌ;Že•;H7:Š{vº` ºù»$-»Ûo»%.–»3ýƒ»G‰»;ýý»^ȺÌ{º¤ÕܺÃä°» ÚG»K¶»‰–o»¨ÒV»¸,廳ڱ» £»ƒ0X»9D-ºÐ:dºDìKºÆIº…xźúÎ »IÕ;»‡|g»+u»§J=»¨%»šŠe»qŠÒ»d®¸]e«:ýŒy;\ï;ˆc$;›2Ç;° š;¿>†;¾æI;²ž;¤GÄ;’kÈ;_î:Ôݹ«SºÈV³ºä”ºÖg®ºðGT»®»6t »S­f»Mü »(Q/ºò½´ºÃôHºÜ+œ»ÐÛ»@’A»y¥N»¥ »ºß3»É|\»Å»²Uú»—KÈ»jú»ÖJº¸ÝÚºrûYºõ`ºÆ&»$”ñ»t«Å»šÅœ»«ã•»²7¬»² N»¥ Š»„î »çµ¹ª¿J:ø-´;oÓ;–x>;£6;±p;Å$c;Ó*_;Ð0z;¾ïc;ª û;”ÞŠ;lUh;¡/8ïº2º¯vgºÛ&6º¨°;º’ºËdÞ»Ú@»=0»[E »W‰ü»3žü»”}ºÍ÷®ºå·»¼»C Ÿ»k  »Ž,Ö»¬=â»Èh»Õ¢=»ÐŽF»¾5;»¥ƒÙ»ˆ»L÷» ?º½É¼ºœ‘eº³H»µ)»Püb»‘仯»ºë¦»½ ¬»»¸»°Ó—»‘ål»9ëÙº<ÿ¯:ÓÂÊ;qº;;¢“;°{¿;µ_;ÁÃx;Õ?;áè¶;ÝÎÞ;ÉÒo;¯f ;•aî;pO;ø:¥gº–ž\ºë® º²áíº?Ÿ}ºG=‰ºÂ]e»)»DRB»[Ÿ®»WG»4±Í»’ º¿ÙºÑm»YÇ»FE»jeﻄA»™JÈ»µôg»Ðy»ÜZø»ÖŒ»Ãüú»­¶¬»”òÔ»pòé»5ZË»ûŒºÍ ½º¿ÅBºêÂi».N»0 »©ÐR»ÂT»ÇĻś»ÃgT»ºµ³»žß»VÉþºž]:³;X€Ó;¡|À;¹»^;½J÷;ÀL;ÌÖp;ÞGË;éa¬;å–;Ñl†;³’Œ;”©6;lÝu;!ʈ:c»¦ºb Iºõ®òºÛúqºP«Ò¹‹xÒº' ºÐŽŠ»#yU»I »Tãß»N_»->"ºó Ùº¡ÿ‡º£äºýÒÓ»;Ëò»i%±»€q­»‹EÀ»ŸSI»»ÎR»Ô ü»Ý¯é»Õ‹â»Ä.»°½µ»œÁy»…­ »W§»%zH»È+ºÝ`$ºæÇ»Íá»\$L»™²W»¾Kb»Ï‰Õ»Îû&»ÉB>»Ç »ÁT»©.S»q¥Tºß`L9õÐ;)©M;(‡;³çf;ÀïÉ;Â3Õ;Æê/;Òñ¾;àÉc;é×£;çzl;Õs;¶Ü^;”[ó;g¶Ã;#ØY:–Q¹ýü ºåÇ5ºÿûº–¨ï¹c 9¸òºBï ºí…»-N0»Iò1»J2!»?£{»!M ºàýº…zºaÕº¼¹.» zj»[»»yÛ‹»ƒ#»Œíœ»¢~M»¿&g»Õ2«»ÚEã»ÏÙ!»¿N‹»¯Ì满)Ô»c’»qñI»Aß;»Γºþ2þºò‘œ» "»=!Ë»„Ÿ&»­®â»Êç»ÓðÇ»ÍØ!»Æ2”»Åe»Ãš»¯¨ù»ƒ'¿» DH¹Š:èˆ;b‡‡;œ›];¶¼¡;À¶f;įó;Ë™>;Õ:;Þ‚ ;å‡7;åR;Ö¦ÿ;¹ßù;–ê;f0¸;$\g:±Çž¸•é캺Iô»aˆºÈDàºR~9U†¸´¶º‡@<»÷À»6©Ê»H‡\»@­p»18G»Ü“ºÕJººs‹‚º!ØTºÕåºû6ý»?.)»ih_»x·Ë»€Ì»2¡»¥´M»ÁÅ™»Ó›i»Ó£G»Æx”»· »¬4»£,»—Šš»„ë8»\5»/„»åûüû»­ð»(¡_»bHX»–hu»¸äô»ÌŽ;»Í£»Ãø§»¼•p»½Ù軿›¬»°ÿ²»‰"»&Uº€Á:‹fo;#";vÁä;Ùl;´‘ƒ;¿îŸ;Ç ;Î;Ôê ;Ú Ñ;ß]ã;àŒï;ÕÞc;¼¢ ;™ç…;k>»;'ËH:ǃï9¤ ݺ{ŠÈºêÒܺâFºm ܸ)_v9<ö¹ÕK º¼±¼»På»AEæ»HÍ©»=_ÿ»'ãç»áºØ—‰ºˆ5º)ecºPîºÆÉ» ªô»Qð»gªƒ»nû'»}GË»§@»«Ás»Å•2»ÑÍI»Ì‘»»¬°»­&»¦¿È»¤Õ»Ÿd»ôm»wÙ;»I.g»!(K» ÎN»°»X»CKb»~ »Ÿ«É»¹7ã»Ã[8»¾Šé»´Û»®Ô,»²ô*»·ÙS»­˜ï»‹†»,žºtzÍ:°Ù:ÞL;5s;{ÒŽ;ž ™;´/ª;À^;Ȥ×;Ï]!;Ó›;Õ²Š;Ù§ó;ÛQ+;Ó]„;¾4‹;ž§Ê;u¾‹;/¾Ì:Ú˵:#€|¹ý‡–ºµóºÙ¼Ùº›·¹Ç…¥8ÇJœ¸ü!îºo„ºúŒ÷»3ûC»OñH»Nùä»C–»&™¦» åºçƘºªïtºtµîºsÕغ·¥» qb»;Ÿ»V)O»_Æm»jVλ‚î´»šnŸ»¶"Ù»ËÇ­»Ñm`»Å˜&»±÷œ»£Ì±»¡#€»¥»¥™Å»œö»‹cÍ»hù2»:Ó·»C·» çÇ»•»+V»U3Ç»…Hø»ŸPh»°7ﻳO7»«ã»¢ùf» ö8»§nY»®%»§Yg»Š£©»8[º¥`x8‡B±:Œ :ý½…;>¹à;ƒA:;¢›;¶>;¿ó;ÇIl;Íjk;аy;Ò¸);Õl½;ÕúU;Îê<;½+n;¡Þã;€•Ê;:|t:ìý·:\ê¸Àþºr뿺µ]Mº¢\éº+QF¹ ç2¸é÷”º*~ºÅJ$»œä»MN »d5»]&ƒ»Q2C»-B¿»á<ºú´4ºÒK˺®æº¨>ÓºÎ:x» Z^»1ø/»KëÖ»VOµ»^¦º»u´a»ëÊ»ª‘»Ä8»Óô»ÒÖ“»Áq»«M¿»7»œÂ»¤k%»ª ‚»§.»šÓ<»†Ô—»]¼è»1P»R®» ³™» 8»3§V»Zm»ƒÂÙ»—Ö®»¢ý7»£ ûœWF»–†¢»—R»ž´D»¥Ž»¡+¯»ŠÈ³»IrºÞê3¹ôtn9öÐÚ:¡Nù; 9;Rs;Žå;ª Ü;¶Æ ;¼2Þ;Â3M;É4Ñ;ÎZ¾;ÑM‰;Ò™A;Ð’Ù;Èd£;¸„¯;¡R«;ƒôñ;D:üì3:è9+“غ Wº…fþºxoºEì+¹£Ú‡¹GBº级|‡» (l»=)î»hcÊ»|ãR»r Ÿ»cÅ™»8Þ’» K»ôºíºÙ,º×?ºóU»¥u»3Ùã»KÇŒ»Vð»[&Õ»l  »‰•I»£‡š»½ª¿»Ò€ú»ÛÐî»Ô ö»¿«Ñ»¨H໚¦†»šû»£À¨»«ßS»­µ»§¬»˜`|»‚¿{»TÏ=»+z»¦¨»T5»C}»20•»S¼Ž»ztg»ŽN»—è »˜ä>»•?¥»’½À»•o»›Ë»¡"K»žG¾»ŽS”»c¸»s庞yý¹ŽÃ99ýXe:«¬<;ñ;tò;n½;¯¼;³¤>;´„1;º=ô;ÃÍš;ÌU/;ÐÚ¿;К¢;Ë/K;ÀLî;°XE;›ýÒ;‚ç–;HT3;¹}:ˆF#9’%W¹›hº9ðZºdÉݺ;Îe¹Ë-8¹n›¢ºL º”ĺ÷”»+º}»Z>Ì»{³»‹+廄²Ô»um»DŠ»ü1»ÜdºñzºæœŠºíî»ùT»¿‹»8fi»P&»\‚e¼+¼Z˜}¼_Ê ¼#·[»€k£;.ÕS<@™<&|Q;üs‡:³QÆ»Á‰ë¼2.9¼^;§5r:¦ºÁ1»{Å»±SÏ»ž'§º‚ ;ÀÞÌøÂ;/%ƒ:«ï,º˜Y¬»€ Ë»²×0»—*mºÕð|;ìK;˜1@;š„8:ÒŸí»‹a!¼Aº¦¼¤™Ž¼å#Ž½ Æ˽»¨½ óмàq¾¼˜_Ѽ¶¾;s>ƒ<w<׺= ëó="i¢=0nu=4ÞT=/ª=%™ˆ=)U=2=]ˆ=5<ÞE²<¥¦è<‰F¨<‚æ§< A<=-<¨Ñò<§Î<”ÅÆ@» I»Mó’»­Ëo»è˜ô»ÔØa»Ã/;“ñr™¼&₼\R»þtz»êÕ »Õu»ª­°»'Ì ;;ú<Èp<–ãØ<Þ¯å=µ= 1Q<÷Å„<À<„å<1 Ë<½< À<*j< ós;ƒ0jº•c»£‡»Üíç»Þ »Ãˆ»žÏ¬»~É×»€(ß»»I ¼Ž¯¼2à¼Ã»‡°M;žŸ<]Ä:<©4&<Åé<¹ä<¤P<\Ó ;—û+»¸Ìœ¼Am¼¾¯¼ÐXr¼¯3ƒ¼Z*㻜ÓB:ø-ß;Îó<ÂY<"<)µÆ<@0F<{¿l<¯J3<ç/ô=bó=2= cÖ<üeö<êeð<ãEÚ<ßz<Î Z<¤ü¯<7Gi;¦>Î:xÕ9º«Îµ»ùyºÝ¡²:"}-;°æ;èT<<'GøP¼µ\¼ Õ켙ڻ筮»D&9ÿ)ó;úp<ƒz›<ÁÍ¿<è…m<ﾎ<Ú;1<°ÓM<€#º<1O˜<+8<“å<-“<)æ;€ªˆ»&Q¥¼Â¼+>¼+j*¼oJ»ü_¬»Ðú»ºüª»à)_¼)¿œ¼rÙE¼ŒèɼtÙì»üP+;'œgZ¶¹»2½»UAN»Fª5ºw µ;7)²;ï ÿd=<=Ø<Õ <>r< a˜ºn¸š¼øE¼ƒ­¼Ÿ\*¼¢°¼”±¯¼}K`¼KäÀ¼@{¼ÛÈ»ñ°.¼w2¼ ªò¼ âæ»àm~»xõº•ÍAº‹ôB»ö›¼#Ô¼z<ë¼—À6¼†¹¼’¢š¼{Æ(¼Mû"¼+樼D¼#σ¼(X¼ô§»Ñö㺭¾˜;³iµ¬¼Ðw¼¿¾L¼ÑF¼²:[¼M—«º>®%<&Ö<Ž+<¤Ýg< ˜û<è»ìb¼R¼d¾5¼T »íS9öé«;ï´,Y%¼=»M£Ü;<}Ô< Ár{<%BS<Ù<"Â}<=œØ<@8è<ôÓ;PÈó» K»£Üq»Mÿú;¸u<§W”â»(Å»Žž»šÃ»s¸»!·»CHk»apU»u¥¯»ƒd»š »¥ÀÙ»Àx˜»ÚÔQ»ðWO»ÿ¡Ï¼ŽÍ¼>»ú¯;»ôKÉ»úÁñ¼Ü(¼ 야 ­¼Äλá滸b»|ý»Jä» fºº÷ºr ´¹o“ð:ls;ñf;€Ò;©Ñ™;ø ;Ê(è;¾;© Ø;–ºI;”„;•ã™;Ÿâ ;¨Ã#;¯by;¶k€;¿Œ´;È‚;ÎT¢;ÐS^;Ìù‹;¿);£Êç;Œ>;K¬,;<‚£;6ÕÎ;Fæ»;bÒj;€dá;%n;•:;•¥Ô;­;|lç;^>;J›;FAâ;RAÌ;cè˜;j¨f;[»g;8Œª; s:£ò:í7zr¹$6í¹sèÁ¹ýT”º‚qžºÒÅ8»”S»»†q»)!×»@"ƒ»V¡)»c‚…»eÞ »aJ»WNË»F»0?¶»J»­V»™À»=©ž»c÷z»žì»‹G»‘Ñ!»›ú»­20»ÃÁ¥»ÙæÜ»êý™»ö{Ò»üµ~»ü-ž»õË»ðÞS»öù¼õ›¼ òõ¼ GϼëÔ»ç°;»ÀƒÈ»™»hÀ}»)#kºñ *º°#Ⱥk~¹±:´p;-!;‰B;²”;ˆ²;Ò‹´;Ç3;¯5•;–dk;‡Ð;…ø;‹¾¾;’û;˜­[;ì¿;¥à;±€Ó;¾¨²;Êòè;ÔU;Öhc;ÊÃü;¯¥<;ŒîÞ;^:™;Kµø;8 K;Z»<|‡»'Fò»$Þ»T»:­»eKÕ»‰.N»™¤ƒ»¡ø/»¥©V»ª²Í»¶8ý»Éºw»á|ð»÷±¼ùí¼¼­»ÿœ×»õµ»ó÷»úU ¼Í/¼¿d¼¹»ù k»ÖäS»°Fˆ»ŒÁô»_åÆ»3”»aøº÷5¼ºÔ!º—¥¢¹*–:¹Ü;S²M;+í;¿~";Ðyƒ;Óóá;Í1;¾ °;ªH·;˜ß¬;Ž¼æ;ŠAï;†œG;x¡;x"ž;sÔ¢;~êˆ;}_;©–;ÇÇ;áõ£;ò”¼;ô5ø;åŠù;É·;§ûà;‡Õ‡;dìÀ;;šð;(©O;.».;H@ ;hâÊ;‚C‰;Š\Ê;ŒXb;‰#Ü;ï¦;péŠ;^€Æ;P÷!;I‡;DšÏ;?Î[;6ø«;)%;È;°e:ƪ!:~%_: ÈÊ9ËG]: ™:Ù9Ûã¹áYºxÙ_ºçx²»{U»5±½»Gã»\Lûq¡5»~~?»}T]»r/»dÝ»ZÒ»P±€»Bu»/·»«C»~»%9»Fw@»té<»ñ¹» »¦v»¦ß„»©ý»²¡»Æº6»âÖ&¼_¼ ‹6¼¸¼Ý:¼ ©ê¼üÜ»üT»ûñؼnC¼±j¼¦²¼¾Š»çF»Ã¢…»ŸvÇ»€Š6»QœÇ»-λ¾ ºÿÖ.ºÞTRºšÁÞ¸¾ ¶:ÍC;]Ÿ;Ÿ=O;¼@û;ÇŽD;ÈbV;Åð;¿&¦;µeÏ;©°Š; x,;š¹û;” ;‹ ;~8Ò;ià.;c¸—;uÓ5;’mA;µ¦=;ÛËÐ;ù_><c«<tÐ;ðBÌ;Òñ\;°­î;*;;^‰Ÿ;3SÀ;.-;d;3 ~;PR:;j¯ã;|€C;ƒ9;…XQ;„iÈ;}£;pÐP;b¢;VC|;Ktý;>;.¢±;ô; Êû:þ†::ßGê:°~:k¶?:vj9÷ :·=:;¡‹:Ä·‡C¡º`ë˺殮»# Y»@ ß»P5Ö»_s|»q„»~_&»}O»oO »]Žý»P\P»H.o»?KŸ»1Ál»"1¥»§÷»˜­»-Åü;VöB;h Ë;t¦B;ÿ«;„{ß;…)¶;€ÖH;s„;fë;Yåh;Jœ#;5lü;[; T:éÔ%:×ç:Ãô:Ÿ¡.:a˜ :ä>:ã©:$Á :9Úg:´Ž¸PXºkªºòN±»,¡»Jý»U>ô»\³Ë»ià®»wRò»y&Ÿ»ko»Uò»Cès»9ù»3çw»+U“»_H»èh»õ»£»4i»[Êo»„t¥»–ïõ»Ÿè »Ÿd»›{5»›7¢»¥BÞ»¼ÀĻ߽­¼öX¼Ì¿¼$³:¼*Y¼'„©¼‰(¼¼ ±¼1H¼Ùž¼}û¼,¼¨­»ñ‡è»Õ¯‡»´ »”æ»s¼»F>|»]iºöS±º¾@º‰Ð¹ç_1:R:üÄ=;W„D;Œ×8;7¦;ŸÛ ;žs;¢Ph;°Ù;¿›4;ÆÊ;ÂGÉ;»¯ú;·JÙ;²o;§"»;–·H;…"Ü;r[;sÝã;ì ;µTá;æh´<ã <ýä<é<g›;ô²;ÏêÌ;¦ýS;¿;#ïæ;É :ù!T; ;¥;6!/;M;\é~;i_m;w‚5;ƒ‰;ˆµ¸;‡ó;ÌB;t{g;gü§;[KÝ;H7ä;,Ó›; Ð×:ç|9:ɹõ:¾:³ãð:šœÛ:i ±:&Ñ:©":§(: 9ÌÅ=¹32%º†Æª»ªl»7'»RÛ »W‹ã»U±¾»\.o»i®Ñ»p›Y»g0ß»Q×»:"»+4;»#è»á'»9m» /Ï»ïG» jd»î^»7ár»^q,»ƒ n»’ë »™&@»—íN»•WR»˜Vw»¥æt»¿})»âqy¼¶#¼jA¼&¨H¼/£Ì¼0›m¼*ÊÛ¼!óž¼L6¼ØѼ ä¼Bâ¼'¼m¼S/»òøí»Öù»»´ßö»“²»jA»6*»Õº¯ù\ºH̹ƒìÕ9º®ò:œNš;íb;Pû;~œ;‰‹‘;‰Î;ˆGK;Ã>;¥|;¿™b;Ïzd;Íù;ÃÆ";¼Ï;º×«;·K;­¾;;‹ôÌ;‡;†d|; E};Ì©v;ý‰7<²<pS<£ç<„¢;êâh;Á®¯;”â¯;[¶;æý:ןƒ:×¢±:÷};Ë;4nè;LM;[`9;gÂ;tâ;ƒ,;ŠóD;;‰G;€çt;s; ;i#I;]gà;H¯`;)ÂØ;K‹:×ÃO:¼kR:·A:´½P:¤iè:„4X:CS:ÌK: Þ9ö]9\I$¹µlŽºšF¬» ær»>K2»Wøl»W{Z»MXö»LYø»XDo»dy»b}ü»Oàw»6cˆ»!k»a» Îq»à>ºþ­èºôΞº÷±‘» ¯»Œ»4Æê»Xö»zÝÖ»‰Âr»$E»ŒE»“¯)»‚˜»°j¥»ËÂb»ì5¿¼Ó‰¼’¼$33¼.¾¼2i¶¼1 ¿¼+Óm¼$õ²¼]¶¼}¼º4¼ Äu¼ ˜Â¼ô«¼Œe»ùLe»ÛY »µÅ®»”°»Y·y»^Mº»Çºau9B:R¦:±Á:ý•À;(²$;Ozñ;iî¤;sÙW;qB0;o¨Ÿ;ª|;›ñÎ;¾Žb;Öfî;×;Ç‚ð;¹Jƒ;µÏ¨;¸rf;·ñà;¯¢; åæ;‘™-;Š…i;”‚¾;³n@;à¬ú<µ*<šE<ù< R ;ûœH;ÙX;­q";~¢¡;1µ4:Ò^´:¶ÓŽ:Ãg|:í±;¾u;6:Ñ;O«¬;_ç;k~“;xD;„J°;Œ²v;‘•Z;´Â;‡å5;~ Y;s@;mž;dìo;P€;/oÖ; Ý:Ùø7:¾õ„:½þ·:Äœ:»ˆq:ž¸á:n$Ó:*öÓ:4š9¯Að81šºÕþº¦» ã »=³Ÿ»V8«»Sû½»ERØ»>)…»FôлV¢4»\Íš»Q&ö»8ö»žì» °o»õòºòà$ºæ¦×ºÜÇìºÙ¶‹ºâÏ›ºúj»lI»*I%»HgÅ»dê»zn»„TZ»Œ'»˜„º»«d“»_¹»i’j»„mÕ»nA»¸Œ»Îj7»Ý÷»ßñi»Ô<»½Ù»§Î»›Ûq»œ`X»¤8»«Ã8»¯nÄ»­¨«»¤ð!»”_4»{—O»KÖz»%*»oq» Ù]»€A»'>7»EÑ©»k¨@»‡¥»“oƒ»˜ —»˜nO»˜šD»› ‘»Ÿ”(»£(ó»¡xD»—”»„}»Q´»Ôĺ¥¼[¹êÛš9Òõq:ɬ¬;Bc;8ß;¨Ñ;°];¬" ;ªC5;±0í;¾B;Êuç;Ї_;ÎåÍ;Æ$ë;·¶û;¥Ò;’]Ü;y¤};D c;•:‰ö9Ïh¹}¡ºSºAϺ/˜Å¹ÞÙR¹vR†¹Ç±°ºtªºÝ§ »i¥»Iç»sË»'»–ú»ŽÇ»9Ø»K+컜†ºþFiºÞ…ºÔ§ºßšâ»0»Íh»5¾»O~ª»`üd»fÖ7»k*t»{軕»¯™Q»ÇV»×­Ã»àY»ÝS»Î¶V»¹©»§z_»žñ0» *v»¦ô»«Sˆ»®(ê»®Aõ»ª×»Ÿ2›»jÙ»m̼»@*»ß~»†ˆºþqF»ú»»6›Ü»aŠó»†K»–Õ»Ÿf¡»£Â»¥Ð7»§ è»ª,»¬‡î»¬rE»§ë³».k»ŠL4»_@Z»#1ëºÒRAº5•9ôÞ;8n;iK;›á®;¬¯;ªo­;¡Ô£;Ÿ˜-;¨Ì,;¹OÍ;ÈvÀ;ϧÜ;Í ;Á¶5;¯¥;š{;…óg;e_;8ÔÏ;jö:ƒÕ 9Hl¹»¿Åº2VºXÆÕºN gº ÿ¹®U¹§—º8 º·¸Ì»M¿»:<Ù»aWc»„’'»–š»=\»”ÖÝ»~Õ›»Hî»Í]ºçµlº½_纭}Mº¶ã0ºØzê»ß»$¬+»C[ú»[²»h?»l´»w›È»ŠôL»¢@·»¹Ì•»Ë¯»Ö´ü»ÙÙú»Ó–»Ãa¬»±jŸ»¤É.»¡9»¤G¥»©¶»«Óñ»¬Þ»«}»¨P£»¡‡Q»•'컃²»ZE¸».xŸ» {‡ºé÷κծàºÜ° »2w»*ƒ!»]ÎW»ˆ‡;»#»ªåW»²¢]»¶‰»·{)»¹iÄ»¼‡»¿Nỿ{黺®Í»®8¦»˜úµ»zïs»?9VºÿzºIV:E¸;"¾Î;ƒLË;¡E);¨qÜ; Ã3;—#8;–…O;¢fê;µzî;Æ4;Í̉;ʦF;½€³;¨>x;Oê;p¹š;KHp;&ÚÈ:ï˜:tðç8†©º@º‚„«ºœÉ̺›ø–º€¬*º0IÚ¹ù"ÿºFκh¯ºí¿¢»&%,»OHã»t‘»Œ® »›ž¤»Ÿù’»•¥»s<\»Ó}»—•ºäêÔº¶}꺡Ⱥ¯-ºçJ»#wf»^x컌]9»¤µ»¶*ü»Àf÷»ÄÞ»Ç(»Ê¢s»Ñ  »Ød£»ÜÞ"»ÛxK»Ò/»À4맶¾»Šþö»U1»·—ºi1:–á+;<P;ˆS±;Cˆ;žö–;–6b;ŽX;†Å;žÓ„;²ÿï;ÈÞ;Êy;Æžr;¸3Ž; |!;„>Q;U4æ;/\);JÀ:ØM:^‚¸…Nº`ÝZººòcºèSgºö%’ºá º²!̺‚ º\ƒ}º†‚‘ºÄ?»» õ »5°ó»]B»€²»‘g¬»fó»žip»‘Zâ»^Ä—»'M~ºî”ªº¥?ñºg ãº5Ëåº9,˜ºl²1º¢â¹ºÝê »r•»3ž*»NG@»^/D»gÅÌ»t…6»…¬»”ä »£R‡»®NO»¶˜*»»ß:»º•ý»°ª’»¢8•»—0Ë»”ý\»›Ë»¤©W»¬©»­à.»ªÙ»£Jﻜ<»• à»b»ƒH »j[»Dÿë»Úšºæv5º¦„ñºxw_º`yWº£ºÖ×;»"VJ»a§ö»í»ª×»¾µ§»ÊDt»Ïœ›»ÓÑ »Û˜Ì»çÈ™»ôÇ»ýJö»ýxA»ô) »âà‡»ÌO×»±¹D»’:)»X{¹ºù¹†yÌ:ÁLŸ;D†;„y;“ÝÀ;”¼;å,;‰&™;ŽU÷;žh;±qÐ;¿ê;ÄãÔ;¿œú;¯æ ;–;p;9žº; ?:óàI:¼ 0:Eoæ¹3 }ºòvºòo¡»½”»0†Z»/¤#»°¿ºømκÆËBºµz™ºÅÀ ºï}Ž» ‡»=#ö»c6õ»‚Ì»‘б»›VÝ»™N컉0¦»F˜» ÕîºÁ‘º€!æº+ËкÂ>º ø2º=ø(º†$º¹B¨ºø($»Õ»;½5»Pl;»^œ»jú»|‚»ˆYû‘ºÏ»˜MG»Î!»¤˜ñ»ª–­»ª'» šÔ»“{»ŠÏ»Š—³»“‚ໟˆd»© ‡»¬B»¨8®»Ÿ5M»•a»‹Ý뻃Aº»s„»[Êå»<ð¯»ånºã;ºž ºPÒ'ºtIº#f<ºƒj|ºÝ`f»(â»ha»“¥ò»¯«A»ÄKÉ»ÏÜ¡»Õþ»Ý‹”»ë@M»þW輪h¼¿Œ¼5è¼ ãï¼…š»êŠÝ»ÑcÏ»³8œ»Ž&o»E<ºÇ\ 8y`L:ÎëË;:¤T;urh;Šˆ;Ëo;Šo;ˆZÉ;”Í;žêÉ;¯…>;ºUà;¼;´SK;¢èR;ˆÆ;T{ß;ÖÔ:ì«·:ÁØ:›.Í:#¹Ø¹ÓQº©ÅJ»»»=æ„»_s³»mô9»dü»GÑy»'Ê»ƒÃ» »Ö»Új»3:»=Ü‹»`õ2»û3»y뻕’k»‘–Y»}Ø»/pAºî °º˜~¥ºAuʺ“¼¹ä¥º ¼bºBðvº† º²XNºçÅ»·€».»E ?»Uk†»d¨ê»uÿE»ƒ²f»‰m»Šá»Š‘»ŒT¼»“廜/P»†L»”ý¿»ˆÒ»¨%»a»‹:5»˜0<»¢è\»§Px»£Ž>»™Sî»ɻⱻoÖß»[¬»C|H»(ˆ»Ñ+ºÐyϺ’á'º<êw¹ìf…¹ÑUGº([-º›Ì{»S{»9Þ»u¸®»™…»´U¬»Çî·»Ò‹»Ù²M»åy¿»ù³¼ ¿¼ßU¼€4¼[¼‡ù¼W ¼’Ž»ëçq»Í¸^»¨ ´»zHð»!ˆº‘zÑ9Nñô:»3c;&“Ç;cì;…EÐ;ŒMJ;‹SÈ;‹‚.;’¦c;ŸKþ;«‚Þ;±Âõ;¯k|;¤$ç;Š@;lÅ;2%Œ:ùä :¯Eô:‰tÈ:_> 9Ù—¹ßð%ºÃkÙ»!‘ÿ»Tk »}ÞY»”˜»‘X›»‰SH»uÏJ»Yì»B²Ó»-M»l…»!ü»'%»;O »Xµ°»rx»„ý¨»Œ«Œ»ˆAŠ»i/_»!¦ºÖ!,ºƒÓBº#tã¹ó约º0¨–ºvá'º¢OϺɞ#ºô¨»#ï»*ÔW»?š»P,Ø»`Kä»s²ô»ƒÚûŠü»‰)R»‚Dß»x /»z¾Ï»‡÷»’»•H‚»¦Œ»€ù5»q… »tCj»ƒwc»ÐP»šQF»Ÿ â»›¢s»‘„»ƒ¹¤»nâ »Xý®»Aÿ‡»'üî» øѺ߹Bº«EºxÏqº)Ww¹Ü¢U¹´¤òº/-º{d+ºØBq» Õ—»V y»…à» °L»¹N»ÊŽ}»Ô2»Ý»íb¦¼²®¼D̼!o¼*nF¼,3¼&pˆ¼-Ǽ4ó¼5‘»æw»½’‘»#œ»DÝXºð”˜º^qß8šÛÏ:Œ “;4«;Vµ6;…²;ôE;ÀÛ;¡Y;”ÿ;Z;¤*a;¥Àu;žì’;®;rÕ;>Ñ›;ÐU:¯¿T:Qߨ: ëš9Ò‹¼8”Ÿº6-"ºæ>ì»43V»e"»†ng»˜mλ¤l𻥹‚»Ï*»’E»†x»q^8»M¸»(Ïl»Dq»# H»:Ä™»O<»`*»t.'»ã*»}DR»XÆs»!Nšºß“‡º‹¤º;Iºñ4º7¡º|Îú¨ì²ºÒt¨º÷[P» »›»0>»A »O#Ô»]†_»p¥à»ƒèY»Nj»Žë†»†'»rcZ»`,K»d)Ù»{Ç »Šõn»——»ˆŒ»wÁl»f»gª»w¡T»†€¡»ªv»“ø2»‘ ½»‡Fá»t£¢»[ì³»EPÜ»,µq»À¹ºá6º§Gºqüùº1nàº,ß¹Øáž¹Í*Òº ¾gºlA2ºÉ9Ó»÷»Lcá»z¦ß»“-»©v»½à̻̄һÖ=•»áÞ4»ö3’¼ š¼\Þ¼+ʼ5ŸY¼8‘ù¼4t¼*Í6¼— ¼Ìżå'»Õ¼ˆ»ŸˆÁ»X9» E]º²òºdóι©V|:¥w:ðãÜ;OÁé;‡Î§;•â•;–úî;”BÊ;“á¸;–±¯;™X;–Æ#;‹}Ž;o¨c;>Š ; L:²] :1O€9*ìc¸ÈG¹I‚e¹è0>º“ž8» ÷»Ló»x7»‹1¤»šü»«z»µ<»¶j»±=6»©{»@今m»b¼¼»7ô»&¾»1+»@ê»HÉ“»Ol(»^Ut»n=ñ»l²?»PQλ.œ—»5=º½\3º‡–ÛºlºcºŠPUºµG-ºåIï»ÁÙ»mà»%9(»0P»:ß„»Fù»PÂ&»\‹»k÷»+Ú»  »“¸z»µL»8»_÷»»L ¸»Sú»mfo»„³ä»‰óQ»ƒ:»lîÑ»Z… »YC»e¼M»v󯻂ۻ»†6»„¼*»zˆ4»eEð»O|ç»9Ö‡» r»Õ\ººûÞºrøºQ<¹º­°¹§oï¹Äö¹ùk?º' ºwð­ºÂó»‘»J°›»{˜»d•» ÅJ»±Nc»Á Æ»Íè»ÙGÏ»èCx»ÿWÈ<Ë]<î¢O<÷¿<ëÔ"<ÖÕ <º‡?<Ûœ<³º¨o+¼S!œ¼·¼ÞÕ¡¼Ýh¼Á ¼Ÿâ¤¼ƒºØ¼Y|ý¼CW¼jM˼²¡ð½q½.Ìv½AÛ\½6פ½ž ¼³Ý¼WM;=F'< B¢<Ù;êñb;ÉáŠ<ù§<7T“­<±âÍ<ó:±= ¾5=€¢= ÇÐ<öf‘<Æ`å<‚Ï;©dè»æ`ò¼–Ò¨¼×ϼã<¼Åܼ¦g@¼†ó¼UWú¼I&*¼‹Ž¼Þø»½Rg½?ìl½C¾e½)¡N¼òö)¼~Í».W;Ùx<î1<F¾;´Î€;µËÝ<R;.0<2<‡/Ü<Ô²“=  =ñ3=Ò=×<ÿ›"<¼PbUÜ Þ=6=+¡:=”»=Ô‰<Ζ¸<¥,¾<„|ì;¦»¶;žH–;’A¨;ÙdI¼’!¼Ž›¼‡: ¼p™i¼6£[»÷K~¼ö±¼oï¼Ëx¢½¸½\¨½J¼Æ°P¼Y+÷ºd²;îý;:ê¼:är;¢A=<)—=ó5=!Åô=§”=æp<ÿ¦4<Þ ™<»…á<™•¹<~#ÉÅy;4®D:ˆQ:·• ;T!ä;¼®í;ù½Ò;è †;>y_»†öŒ¼9t¼ƒ%¼‹m¼kÝú¼»‘5Ž9á¿;êù<ñ{¼)*¼õ¼ )b¼‡“»Ûßž»«—É»sª½»–(ºb×:l):ôUg;;b;[…¦;_Ÿ;Z¯e;Z7;]e±;]\<;X u;T@å;aëç;‰-¶;±²6;صg;æu¨;Óp‚;°°o;—l5;“G&;²;©s;¬Š;¥+±;šê;”8;œ’î;µÉû;Ù$”;ø -<°&;ÿ“…;îµt;ØØ];¼ñß;™8”;cV¤;L:ÑGn:Ê24:áå;Šz;&fI;E¯õ;^Ý;n«B;{ B;„L7;‹˜¤;“I;˜²;—œ®;‘1;…Žk;€bð;‚ ¸;…{;‚Om;fùi;7×ä; >ð:ØÇ…:Î*:â†l:óµ:ãò:°çÄ:e\/:™9XÎĸçxºl'º¡ óºÿxa»&Ä$»9„X»6€Ö»*7i»&h€»38‹»Gœ”»Q¾`»Gý!»/Îü»ÅºýÉFºã·»ºÛ(OºÚÙºÓžŽºÅòxº¼ŒÏºÂʺÖ˺öˆ®» å»'.Ï»B »f ?»JN»¯»Òì]»ó`÷¼ï¼é¼lš¼Ôç¼ëz¼!M]¼#‚¼%üE¼(ݹ¼+’ ¼,™~¼*[ݼ$ys¼`ȼû,¼CT¼³‚¼”f¼ ûç¼?Š»Ô_:»ŸR»OˆDºÃõ†9a—:þÀ-;_œb;ŠRj;‹Òž;ƒC;j@;b­z;aï;\Çá;WjÆ;]WV;€ƒ¯;¥?þ;Ñ ý;êµ±;àjõ;º];’‘g;€&Ó;„óB;”ç;ŸY²;Ÿùï;˜ªn;’—0;—o5;«2A;ÉI ;å°Z;óYj;îÝ;Ü×Í;ÈQð;±ˆ;•¦|;k62;. y;a&:ñÔ:媘:ô®|; P ;#Ac;>ö;Wa;id<;vÓc;K²;‡Ÿn;MÞ;—eI;›Þ&;˜¨D;Î;†J?;„ù.;Š©þ;);ˆ¯ö;h[Ó;0Lu:ÿ O:Δ‘:Ô8:ôUŠ;Ť:幦:¥…:Dø¸9Æ€Ý8³³ª¹‹T4ºE›öº°áºüÎ\»v»» ;Ý»Tã»ñ»ñà»4Só»H|$»J#$»8%»×»E5ºîënºçÄ€ºïòºðlºÜÎ'º¾ƒpºªC’º©¾2º¸­'ºÓd¾ºû+ë»nï»Bý»~è컧sƒ»Ñ§L»õÔ¼x¥¼Þ¼y¼Ö\¼”*¼ ¤¯¼ tV¼ Iʼ!v¯¼$‚F¼(_¼+jª¼*Æd¼%r¼ÿ¼¼'¼=ȼI8¼ ŸÏ»úò»Éþ³»Óì»)<:º+Rˆ:¹Xö;^Ýí;œP;¦Ä•;–ºˆ;rÜ;kàH;féj;esÑ;a• ;büè;z ;›kJ;Æñu;ê\ú;í’};Ìž~;ó;v5r;f­ü;}s°;v4;“èú;Áÿ;‹Ði;——;¡Em;¼ãñ;סÓ;åL£;ßû£;Í @;¶ÙN;¡¼Š;‹jz;e¹U;6Ÿ;Ô::õÒ‹;’°;Šµ;#±Ô;8øu;N)†;`Û;m@ñ;wEý;€›`;‡hà;Æ¢;™ù~;x$;˜*i;Ž ê;ˆî;‹G;“ƒè;•¥;ˆÆÎ;[ç¹;?§:áŠ:ÂP²:Ú^:ÿñ;3Ò:×(~:‘Í:'v\9¡z7ki¹µÐ‹ºQyº¨f ºÞï'ºý‚»°[ºû)»5|»Ñÿ»5 W»D,N»<»%{» fºûÑ‚ºõ¬»’¡» Û(»GºÛ§Öº¬‡Ùº‘Ÿº‹Ssº”ª6º®$$ºß2» »Zbn»™× »Ê?лòûE¼€ã¼x(¼µj¼ÚR¼ 6¤¼"’r¼!Ö¼ó}¼\ݼU5¼À‹¼%iH¼*W ¼+¼%/©¼oz¼¦r¼ E¢¼~x¼:¼ b[»ï˜ø»¼N»€ºUºþî(9•+˜;/X¦;™{F;·¸Ö;® Í;’4=;z½®;mö ;n§Í;nš¥;o>;~(Û;•ã.;¼ÿ¬;å®Ê;÷X;ã.8;µ";ˆJâ;c¤;e4;| †;†›;…ã…;s;ƒôä;”f†;¯Ã4;Ë;;Ú£;Öú;ÁÙ7;¨OK;‘Y™;yµÄ;R5;.F";Xù;z%:ì·ç:úp; DŽ; ¨Õ;2÷;Cɼ;SZ,;_ók;hƒ”;oJ¬;yb­;…„N;‘©;šŒè;œ·;•ø;Œo‚;Šæ¹;’RÅ;š,Å;–b?;æé;DÓ‡;v±:ÄŽ:»ˆE:à¹Ô;·:÷8U:ÀÎg:~å:y9£·³±·¹¹­=º<üѺsrº°ÐѺÀN™ºÀá´ºÇ{2ºë$O»~¯»2¤»8’Ý»(ži»§É»Uºûä»íK»l»\,»–ˆºÉ Öº’®rºj7¨ºTƒ6º^g‡ºŽOXº×’»-a„»†»½E‰»ì[P¼zŽ¼ Ã@¼å÷¼†¼$d¼#Ÿ¼%Aм!ì¼÷A¼-¼“Q¼n¼"Éy¼)˜è¼*k¼"P¼Œ¼ ¦æ¼ µ¼ [X¼ KÙ¼Ÿ=»ßÙ»ªÉ»\½ºŸv:«¸Ô;{\B;´Í+;½ªZ;¤n;ˆu+;x†5;x~>;|l¹;~¥¾;„F®;”§o;´ÞÃ;ݘm;ú[;ö ‰;Ó»;¤9¼;Á…;k Ø;q”é;{Þ›;y'd;må);m!b;ƒùö;žý;»Ê;Íï?;Í^è;ºqž;ž_Ë;ƒ®á;[qÒ;6@Ð;´';>:óYÇ:ØD‰:ø¦ƒ;q5;&¹§;5å…;B–;N\#;W#U;\f€;b±Ç;pSˆ;ƒX7;£ˆ;—o×;–ºž;Ö±;‹9¶;;™c§;DX;‘–ß;mkU;+ 1:çI0:²Ù–:½È%:暥:û¤g:ã3²:¬1:gNÜ: x>9w¨è¸ ª¹Ç@º‡¼ºS Zº|o'º„Ç;ºˆ ¡º  ôºÙš1»Êb»(úü»%Ϥ»0á»S~ºõ”ª»2D»×»#ã»®ºòVຫ±âºr º5~ºv"º ºzø)ºò³>»Z“a»©ÌÙ»á{'¼'¼ Ùk¼…!¼µ¼Xm¼!ˆz¼'aŽ¼&¾¼Ü¼î¼ÕÁ¼Ë¢¼#ç¼ ô·¼(d¼'~Ѽ‘¼qÒ¼„¨¼Y¼ ‡}¼z‘»ô–q»ÉÚd»–n»1é¹Åd…;µb;˜×¼;»±7;±#f;”Ëf;ƒuÍ;ë;…uË;‡³{;‹ZÓ;–ËŸ;¯Rè;Óp³;õ]»<€„;íF1;Åb3;ž«¤;‡žç;€(};|;q¿;_¾];U´;eý;‰Nî;¦ÍÎ;½ü;Áþ;³zº;—å8;t5;Bž;un:ú–§:Ù©»:ÌÀ:ËXþ:§_:°:ï&©;°¼;!HR;,«»;7,>;Až•;IA;Np;W¤¤;iŠ;€~;Š£4;ú';Ž‰;ŠêJ;Œø>;–¢Æ;Ÿµ;œÕÂ;‰«|;VCÍ;Fá:Љ$:±ÛË:ÇÊ·:éþ«:ïFí:ÎÇ:š"–:M¸°9ê$94Îì¸ê+¹d­¼¹ÎµÇº ³nº!¢êº(Ë/º@-­º‡¬ßºÎ¨Ö» ¯<»j›» š½ºöWºãûºïlÄ» I»p» ­»¯ºËÞŸºPúJ–º=w¹ªfî¹ÖØUº‰|•»㻎;»Ï†Ô»þ®a¼ Út¼Küϼ ¼©¼&Õ¼*.€¼%°'¼¸¼¼ 5¼¼ íѼv ¼i¼%tb¼ Á_¼O¼šê¼R¡¼©v¼Kê»û`ÿ»Úß»°U »~þ»1?: ;O¶;£–;¯§;œ ;‰í£;‡ J;Œl/;G;“V<;›TÅ;¬ê;ÉZ?;ê5ì;ÿÄ·;üq;àÖ»;½Ä·;¢¢;’¦;ˆq;z[G;]í;;GÑY;Gòs;f|@;g.;¦¤;±;©K ;‘ãŽ;g‚;/ÿÎ;H:ÈP:¤±Þ:šh:œ®:‡5À:¬De:Þ!Ô;•f;hf;˜µ;&4Œ;2áÜ;<Â;EL;PèX;a¨Ž;t1d;‚ ;†Nº;‡3v;Š^;“d;Ÿ¥.;¤UÑ;™î;ˆü;D¨í; Ì:Î":¾ÅŸ:Ô¦&:è/:݈œ:¶<—:ƒ Z:!²f9ž›ê8ÂL´¸gÙ¹Y£¹„'b¹«V[¹½¸¡¹Ó(¥ºV%ºtäºÂû&ºú Ô»ˆ{ºä1ŽºÊ|YºÊ›bºå ’»–»þs»™ºÜ]íº¤¾Pºwèº.Þ=¹¹ôã¹ÑǹØæáºÀU$»YF»³íÛ»ï!e¼sÓ¼g²¼!j×¼2‹N¼?ļD=¼Aeo¼9¹a¼0)¡¼$ƶ¼8h»öÓ¯»·½ÿ»p¡“»¯^º¹h¼º¡q^º¢Þ“ºv¶]5Èýõ:Ãî;Hgn;‰¡;™ 6;˜ß;;’Jn;Dd;ŒNN;‹ó¿;…û&;mn;>2ƒ;í±:ª¾ú:N©¸p¶º¦º\Hôºr(/º“ºâÚ?»1Hl»nÆ»‰ô›»’Óó»œ^Ë»«2ÿ»ºŠÛ»Ä?»Æ†É»ÃÒ6»¼pç»­¯Ž»•±W»s~]»KH.»AAλJ"»N—j»H»C®ß»LÉ»\|µ»aBî»PÊ»Nk»3ò»ÿкÙ=㺲h0º¹[ºãû ¦™»#-»2šÀ»;§\»@J@»C±»HÜ}»Pri»YÔÈ»fp%»yš»ˆbô»’Kº»“‰–»ˆBŒ»i?j»Fž¬»;-»J[î»hP©»€]º»[b»n8œ»Tm»G$­»Jn=»VÔY»céõ»m.лp ‚»k)ƒ»_Š/»P_»>õ'»'X»®ðº½#ºYæ8¹µ›¸ÊIœ¸Ó‡Ñ¹–ªæºc­ºQ/ùºŽyYºÈäÿ»û¦»KdÌ»S±»– Å»¤§»¯G»ºàÀ»Ç:Á»Ô‰¸»äƒX»ù¡[¼ ż ¼/(‘¼@§Î¼KܼNä¼IüAC§¼8€¼+œó¼RÊ»èT»›X»/£Õº¼ˆº˜\íºÈº¢ºøþ™ºÔë¹å P:°™;Hµc;ˆÄ°;”…º;,U;…6î;X>;}‡J;v«);\Ž/;-Æ1:é„T:s;§9Mºz÷ºš˜žºÎ!NºàÏ)ºïE/»‡»M^ »†¹ »šÜ» 2»¡÷M»«»»$»Ê}һӄͻտn»Ò$a»ÇŠö»³¯‡»˜‘\»Ý»gB»fÔU»g’5»Y†Î»E;c»=a°»G!»V®»ZÁ¶»R¬%»:ÞD»õpºø”øºé|»ýÜ» ÂÍ»9X,»H0»M[ »K‘»Gmê»Ežv»I©î»R¶}»^E»m”—»€xZ»Šã»ÅÕ»ŠŠ»rB»H«g»-ê»,¾»B@B»_‰Þ»p¶.»id(»P‹”»9âñ»2‚Í»8^Ú»B„Ë»KX»QÑJ»UŸ?»Uü[»R”ú»J–»8œ'»·Yºâ·:º†ã¹ÏeÛ¶Õ Û8}¹)ßlº [ºp Óº ¾òºÌ¡Â» +–»=—B»z`»–åm»§À»±@»¸0â»ÀÜ~»ÍÂM»ß'A»ó׼Ѽ[ϼ&žœ¼;Z¼L•¼UG¼S‘…¼L«<¼Ew-¼=0Ò¼-™o¼K»ÓŸ»€¯H»T—ºš{ º»K»~]»0?»YOºHqJ:*é;>ˆÙ;|U;‚~ß;rÒ;`þ™;^o;_ì;N:A;$Q:Ô-m::‡§¹èºn:Àº×Nà»d@»"™º»)ÖU»= »mt¸»—2ù»®þ¬»´¶»°Ša»±†ž»½;»Î}_»Û»áaC»ßåô»Ø7ܻɕл³Úûœ2»‹bi»…Ú/»ƒÒ+»v‰<»X’•»?ôñ»:„T»Eg½»SÝf»Zny»Xk§»Qû9¿›»B» ¶E»›Ü»)mñ»C¤ª»Sx–»V“…»OÆù»D)»:°5»9­õ»B]*»PjÒ»_‚­»oº»'ð»…p,»„¥»oƒc»Hnâ»%Íu»)ª»}=»7‡»PMe»XD·»IŽ¡»1Œ»!R»mT»%¦a»,mË»2° »:Ž‚»D"x»L¾»P#µ»IÕ»2ò¸» ²¦º¼œWº9ªr¹!óJ8šé¸zÿɹïÞºsÄmº«‰ºÏ\¥ºûôÏ»%¦õ»_B컎;T»¦»³Ÿ=»¹‰Y»¾‡»Ç‡Ó»Ø©€»îCl¼ù‚¼ Cx¼ñª¼/Ã!¼EHù¼T•x¼WìA¼Q²\¼I¥ ¼CÚÕ¼<ë¼*,u¼ »ÀÕ »b1ºó]AºÂ¼‹» c;»Hvû»`b»0I4º‚yË:‚ÀF;$.;MvÀ;Gßë;6§3;4?;=²";; (;C :Ès«:1¹~žºŠ-lºõþ©»+9†»J ¥»XÃd»g⤻‡rf»¦èZ»Ã3»ÍH'»Çó»Àu«»Å)»Ó¡–»âH§»éšõ»è[-»àõô»Õ|j»Æ5û³ç¯»£λ˜ñ1»“Ê»‰.:»q j»N»:1b»8È»BHÙ»P>ã»M7»D8e»,៻±„»B×»&ò¼»?’€»Pµ»T6»JÆï»:^»)Éc»"c»(YV»8Žb»K;»[1»gλphk»o㯻^ÿœ»>_-»†a»6»(å»<³»(´»:ù»9>±»'ø#»Z»)»(°»W°»÷ø»©9»+YÖ»;‹»HⶻLt+»A6(»%ͺùÛ¿ºšÑëº û¸ñª’¸‹÷n¹¹ùźY1º§-ºÍõºè²Ó» ³â»: í»y5»›%„»°ýé»»Žñ»¿5‰»Ä°‘»Ó»é:°»ÿ–0¼ ˼@D¼"Ìμ8 ¼L2¼U ¼QZ®¼Fåv¼?™°¼<­Í¼6oM¼$&ó¼·Ë»·»aþ»~™»'»ErC»}aŸ»êø»A¤Vº”¬¯:;âa:ó ; Þ#:ûC:ô×»; ì;Œ°; ¹Î:·ÞÈ:<¹¨ÅAºÁIºø‘µ»3Ù>»aG»|a`»‡]Ì»—‘»´•¸»Ô“‘»åÓs»âtï»ÖÌe»Òéx»ÛL»è_Š»ð3»îAû»å.×»Ù•Í»Î`|»Ã»¶†Ë»ªf{»Ÿ¬L»’Ò1»5»\îà»@œ^»1êe»/Øÿ»8GÝ»EÆÖ»25y»6™\»+ç(»BN»Ön»â»2I»AÀg»E€À»<7Ì»)·~»‘H»±q» ¸g»Ó~».¯à»BPA»OUY»UT»S<»E#‚»;Š$»+Ÿ»p}ºÓX$ºdç¹ûN›¹|}%¹«@º0ð互)Þº¾í#º×ÕTºòë—»Ip»N »ˆ›»¥ì+»¹œ»Àþm»Å7“»Ïøï»å¡»ýšV¼E˼P'¼$I¼)çë¼>¼Mž¼LÒd¼@Ñ(¼4é1¼1{¼3M«¼0Õ¼iD¼Ÿ»¹/Þ»w¤Ü»;ðÌ»G0»»{W‹»’tS»‹]»Dóº™ ç9µ^Ñ:~â8:l,:P&„:ŠÁŒ:ÄÐè:Òΰ:“àÓ9žeʺg`º–‹ºðâ5».nf»d¬ò»‡v»•L}»¥+7»¿r»á1Ó»údO»þ>L»ñ÷è»æDf»åÞ`»îœ»ôój»òä»è0»ÚtػϓλÉ"¸»Ã³»¹ »ª©|»˜Æü»„3ø»aÇ»C3»/»!î½»ìè»%”»A'»è&»b»Ñ)»¢ÿ»$–F»/ i»0'»&p×»6Uºþìͺà~/ºÚlºð.» R»#Ëv»3ÑU»:F»6ÉO»(Á滓ºåº¼™º²¿îº¿Ó¼ºÔѺë,}ºÿ„u»39ºùKwºî`ºìÔ+ºïežºì·Åºè¹£ºñcˆ»b黉â»"³»"vS»^» ×”ºèÁ)º°aòºjLKºö™¹ë‰ºÌSºjì`º¢©ºÂC¢ºØoª») »(ê@»eKž»“½µ»®¿¨»¾lù»Å½ú»Îžf»áhÒ»û«®¼ ;†¼ðh¼c–¼¸6¼0~ó¼@¥Î¼E<¼:#›¼)rM¼ Ñœ¼$Y;¼,ͼ,H6¼T¼ë%»À‰˜»Štî»fÌö»vèj»‘‚»œç;»Š¨R»5ûƺ”£¹%帘Z0¹œ•ò¹?¡9±‡Œ:H^:"ñö¸1ÒºQA¬º³Çüºõ{»%ŒQ»Zƒ»†¨S»šÝL»­v9»ÆUûèz¼ðs¼ 쮼$|»þ»óêU»óøþ»÷”Á»õÉq»ëWT»Ü#ù»ÏA»É©Æ»Èô0»ÄWD»µß–»žÛ˜»„hÓ»Z 9»:™&»'»2¨»¨ »–³» /Àºàßrºó0غù;N»•£» 1λR»!„»­}»ƒÆºù ºÐ oº²àcºªº¹ ¿ºÛå«»{»sÊ»2y»c–» >fºêܺ²ÎoºŠ+º„Öﺚ¡!º²q‚ºÁÕ—ºÍ³`ºÕkÛºÔÎ@ºÑÞÒºÔ–ºØñºÕ*}ºËíºÈAº×Âüºó*»PDºþ¹wºèàÿºÕ?պȩ|º·WÕº™Ô^ºo]wº;âº)ôºB¢dº€ º£ôºÀÃâºã×ý»3/»B¨`»€.»ž˜»´¿É»Â»Ì(c»ÜÄŒ»÷$á¼ hʼié¼»¼‚(¼&:‘¼4EN¼;¨ç¼3ò3¼ ÷μr¼­ÿ¼–¼)…¼,c ¼o¼-2»Åv‹»”çλƒ>»Œ »œL´»œ‘s»~U«»ÂÛº—vº_Ý?º›ÂÓº³ñºÙ¹Ã¯¹ùEº ˜(º‚3ºäo«»øº»#¶¸»M¤,»€J»˜^»®bº»Ç²©»èv=¼6#¼é¼‡¼ Ùܼóe»ûžw»ø‚¶»õܾ»íÅû»à”»Ñå;»Ê »Ê«I»Ëçû»ÁÙÀ»¨àü»‡“V»Qk™»)³»þ»v½ºé@tºÍvºÌœ•º¬D0º¾{̺Òàºõçi»ü×»3d»ÅÓºüi<ºÏqsº¤‰Ëº†ñǺ ’º6庩‰ ºÍ?šºî·ž»t»‹‘ºæÒHº¸éªº‚¡iº2‹\º(»°ºfÀbº™Vɺ²Áº´ uº³4;º²<®º¶Éº½6öº»cðº®Á红û!º¦Ëº¹ÃiºÇ-…º¹ê躕͔ºo¯`ºm"Šºˆõ|º–Ñzº”¹Sº…ÄѺcF½ºFyšºM¼º}QǺ£!ºÎÙ »3K».Ël»aîI»ŒU»¥d§»¸M5»Åâ¡»Õrß»î*缚¼Eà¼KÉH;—À<¹Çý1»Cj—»l(‹»1þº½ð;;À;Þ–ô<`+;ÑÌØ9g-Ï»ÌF ¼)_Á¼<©[¼Š™»®‚®¹IžU;‹¿-<Vê<3®€X:ÿÕ;È<ë8<Ÿu<ÒWA= "=gÌ=ëû<Ô]:<®& <¢i¤<§¶`<­p<ª!<š¶7=>(=ŸT<±œ<<"Ÿ;€Â;R×;bE8;' ï:8™uº´Ÿº»£³º<¢ ;zÍ<"ñ%<Ô<¬{<ÓD<öR=³(= Ø=Û¸=ÿ$<ôcÞ<äÒ<ÔU5<ÃÙ7<¨i`´=;=Ôz<úè›<ôÙ÷<ëB<ÜxU<Ä"½<•š <¯[:Šq»ˆ »£‡u»Maº#ÖÎ;;õûr<ˆb7<æe1=¾ø=d\= P<ËŽ Ò< ž;èÖ ;å;éäm;Øór;¥ŽC;Gͦ:e²ò:¢x:;'y~;—Ýê;êo&;}';„Ò·;P¶;Àÿ;¨fF;¦z;•é6;v¼š;;âÈ; R:Üh³:ѲK:ÜZ/:Ü}h:ÃÆ:•˜ò:Aàé9ÆîŽ9)æ7D4̸fŽ#¸í?ð¹(Y¹GÓb¹f g¹’. ¹ð†º_º®ƺÏf›ºÄè–ºª·Qº @Ûº­duºÊ—κæSÁºèäþºËv庣´ôº‡ºÏºdº&™¹}Ãï¸ûœ›º9¹ »&»±Î»ÔÁ¼að¼ Pÿ¼8¼¥^¼¢è¼Ƈ¼%J>¼+ z¼&ÛZ¼Ûü¼ Aɼø¼Ø~¼#¼Øq¼Ð¥¼KG¼ 4»ú–¬»ò »ò-q»íÕ »ÜÍe»ÀÃ^» &Ô»wk^»Gå¹]µD;¤œ;ní;ˆÂ;ƒM';ƒÛ;Ž|ê;š);¡q;¦¶\;±Z;¿Í©;Ñ¥¦;äöØ;òª;ïŽY;Þ4¿;ÈŒÆ;¶n‰;§q°;–„:;€½Q;Tê;4)};+{È;;–C;\þ‘;}l";„ÅÉ;xñ*;Ošm;x:ÕQ³:‹~ä:7Á0:‹ì: ^v:b9ûÔâ:4„8:V:££µ:·EÅ:Èÿ1:ìÂ;„;+‡N;;\1;Aãï;Dŵ;IG*;T|;dÙ”;yÐ;‰ŠÙ;š­;©;®m;¥çó;’­;pÌB;<` ;¶î:ñ[±:ÞÓ×:ÖŽ«:Ãhª:®o:U‚A9ÞW[9Y†·Uýà¸ie¸à¯¸ûzò¸û/‰¹ @¹*Ô¹Xcí¹Á9º:yºˆnº’…‘º+ºe;¶ºi[Tº‚p º”;Oºžº”׺}óâºjEĺr кd¼(ô¼äݼƒ5¼Jí»úÕ7»þ[r¼¼ ¯\¼ ¤¼ »óúÚ»æþB»ãM{»ßf"»Ó j»½^(»¢™:»…¢õ»CMغ¹xÊ:$;I;V+Ü;cØ;jwå;ƒˆÛ;•ãa;¡åÔ;©]M;³’¢;Àí”;Í”;×úP;âw;äÁR;ÚêÙ;ÉÍ2;ºë;­ŠN;Ÿ²®;Œ- ;h¶â;>f„;%q¶;!A;/V#;Gu®;Y,;VÆY;<½{;ë:ÈÓ/:|¬¡:µÁ9ÆêT9®VR9¹`í9Ì1•9‡Òâ9¾È7:œÆ:Qèm:|§ :ŒÔì:ªd:å”;Œ/;5Š;@ç­;?îÆ;<:¤;>Þ“;M?;dÐA;èá;”Šå;¦ÃÎ;±¨m;°#£;£/¤;’J;qæõ;Cºæ;¼ :ÿÒ:ÛÌ:À :Ÿ‡“:bÝb9ôÈ9f ¸LýB¹‡¹>Vù¹C=&¹!¸ø®¹K¿¸ñµ†¸Ò—¹\o¹éRTºAºA¤¹ölS¹öO]ºI´º„°º9ƒ¹÷¹Ù…[¹íFº/EsºpYøºq†º!X®¹Ç—<ºTßg» ½»…Æ?»Á⧻í ú¼:ó¼ ‚(¼ ;a¼pA¼Y¼Ü ¼&NV¼#NŒ¼i¼í»úÀ¯»öV»ý ¡¼ª¼Ç«»ý§˜»ê-å»ÚõŒ»ÓÇ»Î<†»Ãµ@»³Pn»Ÿ ¶»ˆz¹»Zõ^»Y±º%?:…x(;Æî;2"¦;AIK;`Š;;‡Ç;›.(;¦Ø;²=Z;Á6Û;ÍŒ¤;Ò‡ ;ÔP;ÔùJ;Îøz;Á ñ;²p;¨1;žÜ ;‘HO;zµj;NÇõ;+ñ ;6J;‰J;#Î;*ƒ;/à;#ç¯; #:¾Øæ:p‚’: ÃY9Ÿ+9dÚc9`Ô¶9n¼'994_9•·9ì±Â:8f:8Û:`zä:£°6:ùfí;(7=;@àÐ;CøÅ;<‘;7A½;=²;R—ð;s#;;ß±;¢‡R;±?F;´Ùs;­`l;Ÿ•Á;=;xT¨;L‡¯; öº:úb:Çp%:¢S:s£:^9Hø4;k¹2#¹‡Ý2¹Ÿ×‘¹‹|ȹճ÷§™8éf·h…[¸‹¿m7'u9,¥«9“6Z9«‰9€Úœ¸™òyººiȺ„tºCÎLºCp¡ºÅÖâ»CÄ÷»˜é5»Æõ(»ç•Š»üü¼Ì!¼üļ„I¼ॼ‚Þ¼"`H¼Ä¼ ¶»ÿ±»óóm»ô®H»ú–,»üK3»ò*»ßa»ÎW»Ä°h»¼ËØ»±)“»¢Ø»”~°»…D »d¼.ʼðؼ$’œ¼+†9¼*—Þ¼ªI¼«6»éYûí^%¼æͼ n¶¼0Ѽ0a¼!_»ôc›»¸-»–sñ» æ»–r໕R»}u»2/²ºùüù»Aw»1ß»Jz#»5lR» dºåöºþ©‰» •»3x#»<‘»I,¦»fŸ»ˆ‹¾» 3”»º$2»ØbL»ü Ò¼•¦¼Ž)¼P¼3›¼ ð»ÿgÍ»ðYm»êл粲»â¥û»Ù“m»Ò‰Ê»Òð$»Óãj»Å÷ñ»¢Ð}»i U»ÓºÔ–¯º®HVº•dºjµº9¯ƒº6 Öºy<ºEŽ8º‡{Wº¾sÒºñ\òºþL]ºÝŸ¬º¥jºXÍt¹ýå ¹®–_¹Û½®º)1ïºfVºŠÊ$º™¢˜ºšÄùº‡G´º>°¹¶í¸!HÈ81ii¹W:/º/ziºŒðGº¥†º¦9™ºœ£ºN=º}Ö>ºrcºo‚Sº]÷lº;«öº h¥º#¹$º9ÌÔº+Ç8¹–D 9•7x:,·†:Àõ¸4 þº9].ºNLºµqຣºpTºº-㲺:ªLº‘A ºäXƒ»"Ca»OSL»s!ý»‰G»šñ£»­£»¾~ò»ÐþλìŽv¼ãͼ¢P¼¼Ðo¼ÿœ¼%”o¼'„è¼C ¼„û»ä¢`»× Ÿ»ïG:¼çQ¼(hx¼5)¼,û¼g„»Þ_;»ª,‹»’V»¯ó»‘o(»‡BÉ»X¾x»Ø»V»9e»f˜—»jƒ¹»Dç廣d»ô§»!Ú—»:@»GðÉ»P›€»cÍ »ƒN»˜Ú:»°Æ6»Ì|»ìé½¼Ÿ9¼ ¼!Ô¼âÀ¼¶=¼„n»ð\É»äyλæg»êÔ[»èƒ‘»ßdu»Ø˜™»×]÷»Ð<»´“ˆ»†>‘»+JºÌ#óº‰VNºVœÿº κ¹Þ†j¹¼s§¹äZ§¹’o¹Ú Çº#Ž?º~GTºµ >ºÖWºÊº›¬/ºEuݹ·߸¶¸RÚƹƒÛÒº*òº:YººW ºXCº5³¹Óµ¸)b¯9‡­ô9¹ç·9&‹¹¥(ÖºTK'º“uº¡dÒºž‘⺎ ;ºh%/º;‹º%š‘º-º¹öÎw¹¸zf¹žÑŹºÓê¹ÂÅ«¸ßWè: :’XÙ:¦Ðœ:OÔ̸7 ºk亻H€ºÅ¹º›^ºBÇ^º ŠÛºPCк¿Ï†» E»O ´»tmH»…'«»ZÙ» ‚¼»±è•»Â»×Ä»øÓN¼|n¼Ô6¼ ´¼»)¼aȼ#³O¼X»îÞÀ»ÑÁֻخ»ÿ a¼!ü/Þ¼5ð¼#ìj¼VA»Æ'$»PV»ú×»‹õ†»ˆrÝ»sU»E¾ð»)Ùý»<Þ¾»k°~»‚6²»n”©»?Iû»¿»$M»/ Q»DÛ«»T)`»eTd»> »”¹¡»ª,$»Âa»ÞŒÓ»þ¦¹¼¥¼y¼*'¼ì¼ »ôè—»ßôk»ß¶+»íOc»ö—ó»ñ‚W»äo¦»ÚÚç»ÓÀ¸»À½h»˜âú»K(GºæO2º|òº>`¹Ð¢Ô¹fB»¹ AŠ¹0 c¹Eïa¹©†‡º‘Ϻk-ɺ¹3º¦Î‹º‹™Aº90乞‘ä8Ÿeø9á9AÙ¸ ™Ê¹©s*¹ö¡Ðº¹À^¸º@¦9ŽäÛ:çë:1 :¤·8ÐL¹ÙH­ºWº‰5tº”ïܺŽ¨?ºf¤[º½"¹ÍŽ¹›Qÿ¹qóð¹5}¸– ¸ž¼ì¹$ôµô²c9þ¥Ö:žíx:ÞWS:ÆHÒ:6z¹¾ŸDº¢\5ºÔ£øº½ ºqü1¹ü eº꣺éh»tz»I1?»yÿ4»ˆI±»¾õ»—Ö²»§Om»¶@+»ÆD”»àÑ°¼/¼ ß¼h¼º³¼†m¼;r¼ žé¼§¯¼ J»ÝB»Ðw »æŽ†¼ ‚Ù¼#Îμ3}¯¼/4 ¼ »èx£»±²»” l»‰¼¦»†ol»€˜ù»h ï»LîÆ»KO™»j5-»„nk»Š »X›i»(Vï»n½»o»/õŸ»JÊ?»cã⻀Ãû“W黧@–»¼!.»ÓÎK»î|Ÿ¼ØݼaÙ¼¨#¼˜f¼ »ü_t»ß9Ä»×kT»è?ü»þ'…¼Òh»öK»âñ»Ôuµ»Ä­»¥â»mTî» XºúºO¹˜µ[¸ß•¢64Š µÖ¶¸°uç¸`¹ìñ¹Ž4ƒºÅºG˺pöýºaæ\º$º‰¹šŠ8ôÇ,9þ,‰:Þ9ÓR{8õM¸Ó+¹8×#¸•œ9\zÿ:ýŽ:o“>:‡ :kUÑ:€‡8±ìâ¹·“’º-©ºdú}érºa^QºÌŠ¹mÖ‰¸6¤¶7M¶8-8œœ8Î8†ˆ]8£9I9Ãñ:†h…:àµ>:ún1:²ga9˜vZºYغÊ-™ºÑ“º’¡º€´¹„ÓFº)gݺӂڻ86»z“»ŽµŸ»“a¡»— *»¡\Û»®@/»ºg»Í< »î ˆ¼ –ý¼]¼x±¼N—¼†ü¼W¼m{¼g¸»õýO»ÙÏc»ÛŒ»úÍj¼·_¼)ä0¼1™í¼$-¸¼˜»Ï!黤!Ê»Žtä»…Úp»‚ N»~Ê»»r/s»hm»qïÖ»‚ꎻƒ;¿»dÞw»0É}»É›ºù’p»Èò»1Û»Wdx»}ƒ¨»’¤#»¦‹È»¹!»Íal»ã0D»ú\¼ 4¸¼CR¼…¾¼¯¬¼|ê»â­ˆ»Ñ1à»Ý·»üX¼½/¼xÍ»ðØ߻׶»ÃeŸ»ªr|»ƒ8„»'«äº±‡º)ôB¹ŸŸÄ¸Èì¢8518¥«@7à¾Z¸/âk¸é©Ã¹sK¡¹×9º°6º ¼º®<¹Œá8³°q:S:gÍ¡:c}:©9›TÏ9+9>†9ôA:iÎÞ:¦óï:»%E:«Ùp:„å…:%‚Ñ9{‰ß¸Î¾¹Ì±Ñº&{º:yºÍ3¹7b9(-û9„øˆ9k39?»~98E9(2£9 >E9…žè:; :¸ÿl:ùÄU:åHÈ:k®d¹’…ñº¤ ÇºÑº£]0ºT7¸¢·Á¹]ŠwºŠ°º»§|»mB»’°Ž»PA»žá£»¢¼w»ªøÞ»³Ñ"»ÀQ<»Ù»»þzÚ¼.¼Ò¼Yn¼S¼夼þ—¼z¼ Ëö»ò¼å»àÕܻ뾢¼›a¼†¼+9`¼*Õ:¼èå»ò‰\»¾sý»œÔ÷»Šø ‹»„³»‡ ô»†<»„Ž»„š?»“m»f{»4z'»û2ºÏ º×Á» ôá»;ïs»o3ô»µÁ»¥vV»¸T†»ÉðF»ÜF9»îï3¼Ð¼ !Ѽ †¼ µz¼¾]»è.Ø»Ïç8»Ó ¡»òȼ¸ß¼ p•¼’i»àSÊ»ÂÈ»¨ø€»ˆÉˆ»=®ªºÙ ÚºX›Ë¹Õ'j¹6 ¶^±â8®ªå8™¢7‹î6;ö¾¸[€¸ÀÂ"¹D½Ú¹ž½E¹Ãôí¹¸Ít¹rŸ£8÷æ:%V:„ ‰:¢¯¹:FÎ:>£¦9è$9ÎÈP:+(:”uÂ:Ó?Œ:ò4W:æî:À:—l¢:a{ :Ý89ˆKœ¸¢r`¹µÓ¹µŠt¸FC=9¢|9ù¥Œ9ãÕÙ9¡y,9ahJ99tß9ä@9)si9Øéî:}g:ÎB:é¬:ª­M9–*%ºRrùº¹Ú&º§¬Èº €ˆ8'ž&96 ¹íD;ºß Ì»O‚‰»#黤ÖÔ»ªù3»«žŒ»­´{»±™ì»¸ß»Êÿ¶»ë]*¼­Ñ¼åؼ å¼ Bм¬¼ 4¼$£½¼Tˆ¼ ·¥»öìÑ»ì%3»úWܼ ·f¼¼(žû¼!}×¼ ËO»àe–»µˆ »˜ÍL»‰TT»‡/»Žw²»”ÌÌ»“Q@»Œ_?»÷c»b”Œ»3Aš»`“ºµÀüº Ñ~ºÊåM»ø»Rx@»‡vß»¡GлµìÊ»Ç ï»×yŒ»çŒ}»öUó¼Æu¼Gr¼¿@¼¥š»ìÈ»ÓPg»ÌüI»åмx¼M6¼X¾»ìp×»ÆÐT»¦Úø»ˆë »Jq†ºûw[º†$ˆºmÙ¹Œü¸ðÞ=7¸ŒÎ8ŒÕf85,ʶžÐñ·û E¸˜hF¹5’¹Mäɹaäñ¹3ŸÔ·ˆ#f9»µH:wó´:¼µÅ:ÅáA:œÐ±:Q[[:G÷:IÃ,:§O+:õ—Ï;ô¬;¢:új:Òq7:¸Oz: m:P:$ªÇ9zÄ5Ð,^8Óøá9ß#“:-Æþ:+‘³9ù_Ý9“90j58òˆ•8¼ð9Gû&:$::ÄëÏ:¹Ø:>]﹡Ѻ‹¥º›¢çº'Yb8Ø7K9÷® 9(Ôº}W>»"‚»f »£˜»³ò»·¥ý»¶h»³œÆ»´À-»ÀEd»ÚÕ@»ý!¼ §e¼ pÉ=2Ô<çÚE<† w< ¬\;—Ê» ²¢¼?â˼{ò´¼L±ººô<,þ=1o=,r¯=1 1=!AÏ=:£<ÐV4<‰é<-G<•Ø<.C<]…×<# :«$D»F·Æ»0{®¹€ž/;~ç;šNÈ< Èå<¡r„=¬=<Ñ= e<Õr‹<‚O< ºŸ;Žër;/bI;©·; $œ;Ü:Ònù:†®:/Q9GEB9¯9œù÷:0äµ:¸qÿ;VX[< B£<Ÿú =³û=Xj=‚{=†¦¨=tðÄ=I®'=uO<ÍSá<ˆ¹w<5E<<ªâ;ëŒß;œ6Œ;†¯;‡Ìâ;œ¡é;çZ<¥¯þ<“Ö<…4É={% =l‰==Oº¶=,¨þ=ÿ<<°Ò£D<V<£—<OÛ>=0Ë(="äŸ=·—="%=H»À=„\@= 'à=¥@=“-ø=u¶À=P¢²=1ä©=‰<©”é19”µJ:­v:;šzj5<Xo’â=,êð=%4ç=Ï=Õ<ò©é<¾¦<šc <Š.Y<€Ë„<0ݺ;ô‚D;·‚¼;å7×r< ?û;Èÿü;±¡g;³6x;¸Ñõ;ûœõ<_'Á<µÈ <÷Š©=¿“=#[Ê=#$=Ç•=ÏR=,jó=_´O=‘–'=§"=¤Pž=“e-=ƒÀ=m"=Cè:=V£<¨ÿß<ˆ£”<²¶Ê=YÓ=/Å8=X=Œ=uæ¶=„Zg=‰ÌN=‰sÍ=)F=m¶å=e %=cF=Vð=8mÉ=[J<ß^1<Èô?<Ðb'<Эê<·‰<Š@S<1WÁ;Ö¯I;¾ºÐ<éXš;,1:ß#7:¼Þ%:£is:‘Ü/:wƒ :>g:xö9þ£Ý9à ”9¢PH91q¦8šé&8M´7ƒ0Ö6ë”7^ã7Ž=7üš|8b[©9ý9Õß:Ù:ëÎJ;(7à;J »;^};ku=;w ;ƒ”A;‘&Ç;¢‡º;¯£;®Í ;¢ Ñ;|#;…ͽ;‰æp;•³v;–[ú;€²";9Ÿ¥:÷ßÛ:À0|:µZß:¤v:zNÇ:-9Ž ¸ÑMó¹ì麅\ºvó¹@ö|9‡i:]G:À£›:ÿ¦Ä;“Ô;(Ò;(¢; ˜•:ÀÖ:±Xé:òƒh;*Ë;O;^4b;T÷;-¨‹:Ç«8¥Uʺ–ÍWºô€–»Œ•»7"»PÛÕ»býÆ»w-w»‹K»Ÿ„ç»´aλő=»Óì»ãü»ô¢º»ýCÜ»ú•Ò»ó(¡»ì›˜»æ>ß»ÛÕœ»Èfñ»¬3«»H‹»{Š»e;6»GÜ»剺Þ;!ºº#º¼ŒèºÃ&º¹*™º”‹•º4^T¹o*]9~9ánU:kX\:á6x;3Ë;fûd;‚±¢;’Ê›;«Þ ;Âwm;Áû§;§D—;„cÍ;P{v;+3j;ad;¹b;$œ¡;,q;+ä¾;¿z;¸®:âiS:¿lu:¦GØ:•‰´:„[:Eì:äæ9ôáB9ó»p9Óu9†Ñi8÷ìì822â7u·6WDS6³]™74ü†7³ëý8|;Ù9XÄê:Æë:§I°;]Ç;4È;RŠì;i&m;zõ.;…Z;¤ª;ÝN;ª4Ð;«ƒæ;ŸW¸;‹¾G;vÎð;r²;†tG;’Íx;‹q;\jß;¥ü:ÕbŠ:¾œä:ºgU: x:eô:Nz9 — ¹ô?ºïKº úE¹¦)8·ˆ:/Qœ:´}Æ;½;B‰;1È;9ãz;%Sw:ñ%—:±#O:ÅûZ;’ß;=pý;]†°;kXF;b/­;5Ÿ":¾þ#¸ÿ6Sº¯ê’»wã»*%ð»E}_»T¦ì»_4ý»r»‰Þñ»pp»­c×»¸™»Ãy»Ôj»ä"8»ëóÿ»í»ëÁâ»ç:E»Ü@»Èù¼»«Î”»‹Ë!»fâ»J1»2G » n%ºÃo躊ïñºyÛsº€óøº„dAºvÜOº:]عÂ!R¸&"Š9x O:!Ý:›ù; ÀÎ;Dµº;jÃ;‚ r;•eœ;®ÎÔ;½`“;±©Ì;’9;b½á;2Ó.;ª;œ;ˆQ;%$;+í;$úš;½ï:èáä:½x::£º:—z:Šç:^Aó:á9å¢ 9çt>9éóÊ9³;G9?ì8‘(<7ª6Ć®6 ÙT5Û,+6_0¥6ú¥ë7Ãu³8Ä|•9¨Åø:VÎÍ:ʶ#;Iþ;:åÈ;XÃQ;r<¸;ƒ*É;Œ€;— Ü;¢…;¥.Ô;šõ ;‡C9;fØ—;TÑ ;e«|;„on;Šßó;sÛ‚;2ì:óû:À´5:ºåø:¯ê?:‹uD:4Ëk9¤­‹¸i¹ÁYžºÅ¹Ï'þ¸¬”9Ýî:’…e:ò%œ;Jé;2uØ;? ×;5Ù$;Cu:ÀÉu:£q£:Ø#@;nY;BÌ­;a9º;r};jx@;4ú¤:¤Öɹ±$º¿>*»ž´»1Ʋ»F˜»O$»YÊ8»r#’»Š´Ð»š˜»¡åo»¦Ü廲pb»ÄzN»Óý»Ý½Q»äbò»æ)¸»ÞQ»Ë’ï»®໋"ø»X¡¤»0œ»öºóŽ—º§!øºOÙºýìºÌÿºöbº$@bº(¹ÕÍû¹ ²8÷c…9Ê“Q:SŒ»:ȧy;”Ï;LaÑ;hÄ;‚ãz;˜aW;­µ§;²bÖ;ŸT;~϶;E§;K\;øV;E;l—;&êË;(3;ã¢:÷k­:½Í:š Ú:û’:Ö§:y‰m:1È+9è#19É¥9Ü‘˜9É29Ŷ8ämN8 ܱ7L‹5?×Ï5t|ë6Då7À8Î9!²e9õË¢:‡ü»:ã8ð;W#;;ã;;Zº×;uAù;„˜;uP;–oC;š¨};“„t;žž;Y‡ ;=•ó;@h?;`z²;~ß9;x\:;H¯è; Ç:ÆÕ:®1†:©#o:’©È:OÎï9ßÜ=8ªZ1¹ino¹Öû²¹Óž¹Sšš9<Š:IrÀ:Ä«|; éæ;)4;:>g;:³>;«:Ùc:”f+:›Ë:Þƒ2;$±;=Ãó;_r;uö;jÁË;(ÈÇ:€Ê¹öÔþº¾2“» 膻,þ(»<1»D­½»Uù»t®ë»Š!v»‘±Ä»‘‘"»• »£[q»¶ /»Å°¥»ÓT«»Ýü•»ÞÝ»Ï F»²åL»Ž§»U컊™ºø©PºÀÕ¨º}ñ\º#㹌»õ¹bNйjÒš¹™F¹Æ¹¼¨N¹UÝË7øº(9’Þ:To:ŽH:ðk˜;)›ü;L•*;h ¼;„­\;˜ˆé;¦àÃ;£7;Œ™;^é ;. y;ж;–ã;£Ä;CS;$¶;MF;R:ÅRq:‘ö‘:C]:ƒèä:‚:Nå:¿f9³7%9µô—9¾àŠ9”UÓ9$¼8aƒ7aΔ60K‡5DÞJ4”§A5¢6[}7YD8†ßÈ9vvC:!°„:›ÿ:êƒr;;7*;V4¦;o;€jP;‡4;‹å+;ˆ7;s.’;K±˜;+&;" ™;75;YíÐ;h‡£;Pr;]ó:ÕáU:¡©™:“¬d:‡]þ:QÜ9úM9'ì¸ð¸å¹¡è¼¹½ñT¹…¶º5 žI9ât”:Š :â ¦;Ÿ;*¥í;4a’;$W¢:ñ§[:—‡:iIç:“þ :Ôi½; ä‡;4 );[Rd;s‡;_Sp;–Õ:E§ƒ¹í˜>º«Å‰»z»G×»+Nô»:ˆ»T\Ô»tÓ‡»„cể69»~‹ô»…¤L»–ƒõ»¨v`»¹d/»Ë »ÕõQ»Ïò¾»¸qC»•…º»\ÿ»#ºÐVºŽvUº™‘¹>8Æ»ƒ8ôB8œ¢¶E#H¹ì0¹†‡~¹m;ª¸b‹9I è9íö«:NÝ.:®;ëz;+ú‹;K‹{;i?à;„"1;“1;šºÍ;‘Û$;ul`;@I;eX;¸:ÿ¸; 3d;,;ï¯;Ü•:ЫÒ:.ï:[üù:]™á:r]:[þú:49³|Î9û¿9šÿ9Ž3v96èE8ž˜7¸6ü6•…ã4CÕÁ4@V5®x6€©á7ÁH+8Õ`i9§€(:=–<:¡D;:ßÛÙ; W;,ž;IœÕ;^®á;ltÞ;t½;pèC;\º4;;)Å;X ; á;]K;0Ú_;I®;E×Ñ;#+_:ç¹_:ž+F:yS:_mb:9èæ9õTä9N^?¸9-¥¹jO¹žU¹†pì¸Ñ¤Å9<±t:%(:žŒ:ç;Ä";"L‘; •;à¿:£þï:Gö2:? :†|:½{ò;ä;)€ý;T#G;gÎZ;I@ü:ûÅ:0#﹘2º‹ÖºÜô˻۠»ÝH»1­\»QŸh»kࣻoËý»a’¿»\º&»r1!»Š³»š¼-»®+(»Â »Éf»»7»]ž»n.»O󺾯³ºOn¹Œbs9cç:9 :=ß9Ë ²9„ò‰8˜( ¹³²¹cÑ/¹ ɽ8³¦9¹I¶:!HC:{s–:ÁX;‡½;+€H;K¤;f$;|ç;ˆ;ŠÆõ;}Äö;OÊï; ÿ:ý,Ž:àëË:ç$:ÿ¶;ž;e:Ô7B:““:Dâ:-ù:FÑ@:OÙm:$Nÿ9Å"19n\W9]n9eš{92rò8»¿Å8Ö¾6øúŠ5¤y[4•´93G ž4 25ˆI6ëW8°N9$ñ9ȇÇ:Eý:–ê®:ÈŒa:þÖA;–»;5(;E 0;M“;LiÍ;?Þ;&¾É; ;r:ê f:ë¾; »§;$aË;-c;8-:ïÅ :¢ø:[˜:,ç:â9Òð 9RF6F ¹!s@¹z$S¹pÀ^¹L7ú›9£”Ù:@Pï:Ÿ“ä:ÙÏò;&;³l;";:²4{:H!Í:Ë{:¶Ô:cç:¢7:ågÏ;‡+;G;Rÿ‘;/o:Ýœ:DVñ¸B;²ºKÔȺ± 7ºå¿n» o|»*þ»HRs»V‘»Kט»;}”»@D.»Z|ã»wÖÉ»Œdv»¢Ó–»µÔ»¶N»¢NZ» »2:2ºÉVº).q·µE:•¥:l-z:~ñ:L‰Î: šÚ9˜–k7¬?Y¹9¤Ÿ¹R{¸(é¢9o’¯:Ê:>(:‰Ð:ÇœÒ;Ä5;+®Ô;Gý/;W‹ü;cÇ{;qea;p #;SÈ;&„:ú ‚:È4+:ºE):Èâq:Þ']:áp¶:Ç&’:“„<:;?:zý:Ö~:+w$:$è9Ôa/9f¡õ9039xÑ9ën8»8 766>6 pc3VG2ÜÙ;4]ù¤5ðܵ7E8±8bƒ963±9Òz:6KÔ:î{:«¼ü:Ý¢ ;¦w;nY;$¸;&#;ϯ;=ˆ:íûj:ÅŸä:º”:Ôâ:ÿŽš; ÄB; ú:äÈb:£Ó¦:Pÿs:õN9Ï9B95±96D8D¸ÅªÚ¹9%H¹GFì¹,¸(Ó8ú89ÇoS:@em:’"ÿ:ÃK.:ëÜ:ìùt:¸)Û:Xs%9ä‰ê9»¬9ûyú:8)â:ˆü}:ÍqD;ɪ;5Xl;:/;–:ÔÏö:p¥9H÷麜Vº‹FÙºÃøߺÿ@X¼ μ sb¼3/¼'}¼+Bݼ LÛ¼ ”{»ýÖc»öNÕ¼áӼߜ¼Øh¼#Áš¼)›¼ï@»ÕçL»¯ö/»•‡x»‹U»û»/»¡5»˜S.»†þê»a÷3»0'eºü‡Õºªð¸º€ÁÔºŽ)kºØ’Z»)äò»p-œ»—–Ó»°3»ÂjD»ÒN=»á€„»îа»ù¡É¼¢Ë¼ÌŽ»þ=F»î±“»Ø‰É»Ì½»ÜÁ ¼~Ô¼ Ÿu¼ UÖ»÷ê9»Ïß»¨oÝ»‡Ãä»OgJ» .…º9xº/Ô¹ß̹„Ã帳±Ö7–”8 =#7šúÜ6´߶äyÇ·ÆQU¸[j︹ˆ¸ïÙæ¸ëóŠ¸9aÌ9T×ò:A:¸ Ü:éïŠ:Ù¯:¡'î:aïš:b†:¬Þ7;ô;'I¦;-;V;8¬;[¦:ìN:åSG:Ô†ç:°Ù,:ywI:I9ÐR¥:T:U+4:a„_:1P9Ò—09IZC8»Ù³8 Ûç8Wk©9wÅ:%47:Œñ:£éû:v©9Rèòºuùºyνº"yC8äø:,v:z¸¹s¡{ºÖÎ;»S­‡»–8»²¹W»¿*»¿Ÿm»¸ýÀ»²Üš»·š»ËXb»ëpL¼<¼ š¼ Ÿ¼ ˜Ë¼Ù:¼$3Œ¼2Dã¼2/¼#,ؼvE¼ÁB»ü‡6¼YZ¼M¼««¼¼qæ»ø¯»Íép»©V°»“-»‘÷°»ŸzŽ»©÷»¤Hû® »h%Å»/ŽÀºú,Lº©ÁRºl€žºWQº–ÂÓºüGÞ»E;ˆ»‡­»¤ë »º›»ËAì»Úbã»çë÷»òl‚»ùdº»ûÖ³»ø–g»íÛ»ÜIJ»ÏLf»Ø=/»ø ¼ 3¼¼ ã»×õó»®#Ó»‰Ñ»Q¦#»Sšº°:1ºGZº>á¹Ã»¹\b¸‚"57º$7Œµ^4³Àõ¶Î©9·ŽG;¸ ú¶¸\§>¸‰º9¸YÈ~8™¾å9óÖ:–E9:ë]÷;î@:ÞÔÉ:¡Nã:„»÷:«2²;?é;2°C;D\À;3†±;Ò ;Ð;%);à·:ÿ+›:Ö»á:Ÿ¥…:bÍ›:Q#:z •:‡¾:fÉÍ:9ŽÆ‚8Îé(7c!·/8X ò9–íª:)‚½:t‡Ë:o;Ñ:~·¹^.ººaJ8”Ê•:9a[:i>9È„2ºK]ä»N»z•>»£éÉ»»>(»Ãbj»¾»²z0»­ô»ºËÏ»×'»ö¿¼B¼«,¼ œ¼|¼´8¼1Ç'¼:Ó9l«8¹Gò¹¦ŠS8 òt:&÷}:‚‚ì:O‘N¸‡º°+»9˜¥»ˆÈv»©1\»»F±»½0½»±k໥5»»¨œ–»¿ï»Ý^Ì»ö  ¼´¼¸æ¼ ;¤¼ôó¼+Ï~¼=·¼C ¼¼7²Ž¼"Éd¼8»¼(¢¼F„¼¤¨¼IV¼ºC¼×t¼©»Ýð »³(„»™Nq»™û»©}_»°û» x»€ÌË»<{p»I%º¼êºŽ>ºdÓúºU󱺇ºÙ4©».ú³»z9:»Úñ»µÂ¸»Æéì»Õé»á<ô»êÝ»î »ì@»»å‡»ØÔ¨»Ìg»Íe3»å ü¼=+¼ G‰¼‘»âOš»¹X¢»’þß»_¼»@ºÎPîºmšº ïB¹á˼¹¾ ¹q¯ø¸ÆQ3·«rø5 M4(²ªµ‚ƒ¶LȶîEô·}ð·øxP¸;8R›9Í¿¯:Š}:ꆄ;Iœ;ž:×+Ù:½VÄ:êGõ;(vo;Ul;Z´§;:#è;Yi; ܼ;îÌ;õ ;±];OŒ:úÞ¼:ÌÌÉ:²¤@:­Vð: •:u :àw9|z›8¦Â|7Úö¸E3¶ö¿#8üÍù9§ú9þ{s:”9É¢9—v¸NX8•: 0:r^:|d¤9÷ºµºë»LÅ»‹Pû»¥¤Ñ»±yn»«îô»œ¡œ»–$ﻣ黻¿t»Ùô9»ï.•¼‡O¼ß¼¼"ÿѼ7¾¼E]£¼Dk¼4«¢¼`:¼ gŸ¼dó»ÿlz¼9–¼ |¼¼´É¼ £ž»ôþä»È†»¢‡Å»–Ô»¢LQ»­¾‰»¤U®»†s(»EÀQ» )™ºÏùº¨nzºlº~¨Áºzòóº¢ÍË»ês»G×»ˆI¦»¦I»».»Éµ»Õ|»Þ¨¡»ã§í»â²»Û¯î»ÐX{»Ã|Š»Àí»Ò‡­»ô¦#¼ ¼F|»â’ﻹ˜)»•;»gÀ»'2sºÜK*º€”àºËa¹Êw•¹¶~×¹Œ“¹ÝP¸J¤Î·Л³–ųµŠ$´\Šµ>Šu¶ ]¶Àù]·…“ ¸L·Ô[ì9 £:8Š:¨˜÷:ûµÙ; ¶P:ÿMª:ØÍ`:àg­;ãÙ;Iä-;`.);H®;ô;j¿;Õ7;T˜;_©;Ç;>¯:ø©R:Ó[e:¿+F:¯œó:Ž­÷::"Ç9¸Ö9’98ZÈt6³ñ^·ŸÉP7Ížž9Þ9‘³9¾Üý9ÂÆ59ŸÞŠ9HðŽ90µÄ9Ër*:Bå:qÿ0::Ä¿8§`hºj”Ø»Õç»N¯„»…¬}»š©»ž–F»’ܪ»…i"»ˆuB»Yœ»·»Îp»å6°»ýô’¼ 鼎d¼+¼>À¼G7^¼@’ñ¼.ÌÛ¼ý˼ Ò¶»ÿÞλø~›¼P3¼0m¼ _@¼»Û„Ö»¯|s»–¨Â»™eH»¦TB»£Èû‰éà»LÒD»ºãß•ºÆ˜º·º¥Œº‘Á6º·žº¾ƒÊ»x»»^Àþ»’Ô »­-š»½µ“»È“á»Ð¹ »Õ»»Õ;W»Î7ò»ÂÔö»µŸ^»­”­»¸Gf»×§e»õÊ=»ù̻ݺW»µ{T»‘›”»gt »-·ºéu”ºŠô´ºk›¹±e¹—Ê©¹†V§¹0c븚„[·ª¿¶M´¤³gjÛ´t µß„µøXl¶èˆo·±âX¸$yùµÍÕ­9nò:Cù:¹8N:úåÑ;Ë™:ð­ü:à+Ì;"7;2š;V;O¹Ö;%AÀ:ýå:íÓ–;wæ; ê÷; (; ®ö;Ý:éL£:ÌíN:¹Ã:œš¤:^¦Ü9÷%&9Uè—8»ˆ®8A 7É!´Èb›8L˜9*F9b:X9Ž„9£ÍÚ9¦ØN9–0ç9±Uœ:ø¥:Dƒú:>¶œ9ʘ!¹†¾4º“P°»÷»Bü»t>»ˆf×»…¹¬»nÇ»`¦@»w‚Ÿ»‘¯á»§€`»¿ e»Ü¯$»ûrð¼ ¼T¼¹¤¼/b…¼?®a¼C4A¼8ßɼ',¼䊼?Ÿ»ó‡»é_·»ñVË»ÿ®X¼€í»è{»½Óú»š¿k»‘Øø»›“»ž”»Š¦Ë»P¡Î»÷ºðwøºá “ºÞz¼ºÓ#ʺ¸ì¹ºœœºœ‘ºÚ{8»+ž#»wSD»œ g»°žã»»5Ü»Á4i»ÄÒ{»ÄM滽4 »±ñ»£\t»˜/Å»šˆ»±©½»Ò?»à×ã»Ð„i»¬ŒØ»ˆò@»[»§»+eNºñ`'º” üºÞò¹£§*¹h˾¹Yä¹*>ª¸¸Ë¸ßE¶ìꄵná$´^ ¡²Ö0î³ÒÍ$µK:¶$ª·'ܼ·èK<¸ PË8!Z;9«:^–8:»ù:ë×C:ñ”:àš¥:è¶Ë;ðÐ;=eŽ;I¼Þ;*©Ú:ûá:ÏòŽ:Ùñý:î&:òïƒ:ó…ú:ô÷N:çàó:Ï7d:¹l’:¡j^:w$í:ÕB9’Ñ-8ÿÌ!8–2ª8+ÿŸ7?±Œ7u ^8kŒM8æWï9(<»9p~Û9¤@ò9µê9±hm9ÑØ3: *R:»9òà8ËfZ¹øO–º›"¹ºþ)A»/(»W1»g-»Vm»<|«»=hý»[’½»€Á¹»•H`»±ï’»ÕIž»öW¼ ðϼÁ¼/@@¼;ƒÃ¼:u@¼.Ú¤¼/ð¼ÂE»úɨ»Ý’'»Ô¹½»áià»ðzÕ»ê\3»Éjû¢d»Êu»-»•[P»ˆª»Q]ª»–åºï!mºî šºýöºýhȺåkSº»¼ðº™Ãº¦~Ǻû;»Dvý»‡3$»¡B†»­XM»±Ö»±îõ»°…$»©®5»œÖ»Ž'"»] »x¬Í»‰&Þ»¥£Ë»»÷X»¸“»L»xrT»Eì»n“ºì©­º˜¯‡º':o¹¢K<¹5-¹ÜR¹ xp¸µo⸠Á6·9ÿ|¶Ï\³oD²D‘Y³Ö òµ>³Ý¶y±·hx¸E*·àfï8¹³µ9Ò¯î:fê:°uÛ:Ò¶È:ÓÈ+:ÎhH:ì”\;}ü;3ØÜ;'ƒƒ:üšD:»>:°(µ:¿¼H:Äù:ÂH^:ÇõJ:Ëž×:À?:­ïŠ:šÜ:|—Á:,œ®9º9%}°8®¨[8w2Ã8yC7T7´À8M!R8¨§O9 ŒV9n½$9§,o9¯Yr9¨Z9¿FÔ9àÎ9Ònõ9m]]¸Ò#ຠŸº‘Ãxºàí—»}#»8Ú$»;©á»$YS»d‡»Æ»;`w»\mˆ»…•f»§‡=”rÖ=…bÍ=rÕ”=T"=ý<ËWí<Š¦1<™m-<Þp…=y=Fs'=l>=„wÄ=Ž>s=’nM=Ü™=ƒSÆ=y"÷=w{Y=pÉ=UÎÔ=,¦=¸‰<Þ‚<åk<óû2<åœ÷<¸~=‹–U=‚[*=I={Ÿp=hI3=C¯â=_w<ò¶Ž<ê×=Ò„=~<ßc:<¢`s“;ƒì0;!it;At;‹tX;õÎ<% ;ívÙ;„”;SX;I‚Û;x{%;†Ï;W–;€ô:†oÒ:±<9ù.ÿ:.†–:—ô¿:ú r;@ö ;‹+Ñ;©÷;Ÿ};_)$;ã/:¬³y:‹Ó:}4M:ªR;;(ê;¨YI<ø,<Ò¦¾=.–=@–>=j§>=„¬=Š:ÿ=‡®_=}Œ‹=m¼¦=g=_MJ=Kº=-,r= .¸<ä*Ó<à<õƒî<ó‚˜<ÊÒW<Ž><'Š†;®/;[uS;€ðË;²Û;ǵ;ÇaÌ;ÛÝ];ä7;¯p[;]—Ä;6PÂ;1ç¾;ù‚:Š‡ƒ9„ç¹”ZŽ8ŒOX:q'È:ë€1;6òÍ;ƒ„±;œ,Ž;Œð;@— :Äj:ÞY9+ H8\B8*‚®8š)7Ð9M74M6Jb·5 ±õ4D*d5IÿÊ6Gs¨7"m8pt9Þ•9δ®:sÏ:à[;,Åÿ;oÀ;ž;Æ­•;åŽ(;ß¾È;«³6;L$:â!à:Ì(Ï;°Z;C:;KÑw;-Ý:«:ï€w;~•H;·zù;±Œà;}8\;ý:ê;¨;S;*_;(µj; Ì:¬Q :jyS:-j®:£ä:<ý/:†H :Ès;Hí;T­;k«Ÿ;EÔ‘;¹:µÚ3:‰™€:S¸ß::K°:[;SB;—]<¤9e77-9œ6¨4Á6™eg6Mh5w´à€ÙµIGf5Æ}Š6âx67ªƒi8EÊI8©,ä8ñ 598õÔ9 åy:‚a:NËf:”—:Ï ›; Ã.;.#;4Sl;_X:ÃT:oîâ:IÕ:tð4:›¤Š:¡@–:g¥Ú9ýkï:)D^:¸ZÞ;ë:û¥A:«O:Cn»: D:4ß$:­2:ÓÎ; ½U;'Ýó;&™Â; ܪ:ç¹|:Ť:¦=©:Œ{j:‘ev:ºÆV:èë; [;IÄ; ¶; ‡:È{q:qóN:4þÃ:‡Ò†;ù=;œë<Løá¶P(µÞgfµ•Tö7³U8 S8§¾T9 ¡9`5¾9š9“Û9Å: H:5Ÿ:ju:šX&:ÌXÅ:ù´B;*T:â§:®ô:…ÛŸ:dEô:Y†5:SÞÐ:+ø9¿Þ¹9ˆæÆ:’˜:ƒÏÍ:” Ä:a:Ô9”‹9¥1©:&&ó:° ×;$bD;x&;‘ݹ;‰­l;g7v;BRÑ;!¸Y:ñX):§áº:’~—:¶k2;ë;6Ì4;l&ù;x‰{;J|Á;cï:–è:p4Ø:¹H…;:2;»ÃÀ<0ð<ôM<±Ñ<¥_ˆ;#G;—ïÏ<ŸË<…£y<ÁÖÒ<òžü=›=Ÿ<í´<Ø0<É!Ö<¾#Ô<°{:<£ <™"±<†LÑ;9ïu_9’Gf9Lô91y8,U4¸@¼à¸óu¤¹Œž¸úÒÛ¸€Ê^7Î6¦9-—­9É&,:,E\:|éQ:¨æÈ: M:­ßÂ:eû£9êŠõ9ƒ9+9†Ö°9¿ÊÅ:ÿ¢:h®P:¶Ü;óN; ¢Ð;#»‰; Ð::ÚåG:Œ ’9µò﹫þ º]ïýºª*Nºæ®ç» Ó»úJ» 6ɺö‘]ºöä½» ž%»’f»5Ð@»aÝ»ˆ Š»’9/»ˆÝ»\Ë »àtº€]Ù7Ò D:'!9áG¢9g£8ùï 8˜bœ8 u·KH¸…M:¸Æ ³¸½R“¸pê;·.ü$8vH®96ù9±ü:ñÕ:TIE:‹Ï:‘{2:`­N9ý“˜9t&9'*ð9E‘a9›(9é_Ø:F,: Ù:ç{£;¹;ËÀ; ,‚:ãmô:’nê9É8¹p”º6žÌº“lϺÇdÒºè>ºå¼aºÇ"0º³ £ºÂÑ¢ºß㯺gú:ºb=º7ź1º,7ïºJæLºbÙxº–^™ºäܯ»‘¡»/»%¥ºý¡†ºƒª·à):<[Á:¡5d:Ð- :ä7R:ÔÒ`:¥ç:A¼ 9qñ“¸ä¹kèn¹) <¶Ï9%9ˆ²£9¡mB9ÓS:+/¯:…Õ²:©6Ü:¥Âñ:ˆ":lg2:w â:}³:Wît: 9»3û9€+Ø9o”Š9‰ëŠ9”¬Ö9ˆï9Q É9Ü8•úÀ8ÐT8¾h8Æ Ä8’˜„8š7„b÷776øHž6¸TÏ69}j5]r§3'Dƒ´Pѵ8‹µBC¨µgjµ• ©µ¡Dʳ”a6mD7‰)”8˜8„¥8ÖÊ@9*z˜9}}c9ª89ÊM<9Ô,9ÌóÌ9¯O9²¡9˜Ò·9‘ƒU9°-K9ÚN¯9æú9ÒVw9°›r9‡¥…9+°´8›¿Ã7˜”l¶xȶ†µµÉÏ4Sl6žø7”Rç8 1ß80²Ñ8AOÝ8fËJ8›c8âì95Ž#9ð9½XG9¾—9ž89…ßE9| 69_>9'Î38ÿ7X9­ú9‰ :B™:nµ:¼ÃL;Í÷;³Ï;Õa:¦{¯:8J9 ýœ¹*5¹³h‘ºبº“˜¹ï˹¹®Ÿ¹«r¹Û£r¹ýzº"eºz¼(ºÈŸ»ê» ôºóF º R¹¹Íú¶9¼dA:k21:¦ »:ij:Èå*:¯«:t“ 9äµY8ò¹)yG¹6i/¸¡•68W 9 ×S9Säü9}Ê9Ã6«:&Ø:nZ€:‚‘À:\‘²:( t:¡I:$8Ç:ÐF9ïC9–Ç~97a[9 =ê9Í 9.Z±9*ÌR9 ž¯8À^8\-K8Á 8A[U8eþ^8F 7ñW¹7Xç-6¸ÃÐ6uŽ½6A|5Øbo4Ð\´Ç/µ T¶„ȶ±N¶2+¶dI5¶~âÞ¶B½¿3Ë Þ6˵•7Š%º8ã68‡3c8ã0P9'„9Wßú9qs9qïÉ9n89k9?9U˜—9;V9J—ƒ9x£9•^–9ýá9w7k9Fz§9 ~Z8š×˜7Ýò!6;èz¶ª5[|Š7w›7¸ÕO8JÊ·8¤q]8Åwb8Áì98µñ8¯:ô8±Šó8Îh”9o9\ì”9ŠÙ•9˜ï9­TK9ËÅ9Ðœ²9©"9X¦º9Jc9[9…M“:j›:w :Ìbˆ; «¯;Ó:Ý‘ :n°H9¹*H8žÙ¸¶4÷¹a R¹‘'¬¹{(0¹'†¸Ôܹ¹)­'¹p=๋Øî¹áZ—ºWEÙº§(çºË« ºÊÕbº ÿº&·£7‚Ñö:ê:nî:—œ¡:§òY:£™:ƒX‰:ì9H ¸ˆ%¹ð¨¸Ö ·iœñ8’êð8þ5I9ë”9QÝÓ9¸rÊ:+:5CJb´œh2µŒiçµÒ†fµúóY¶¦m¶­NV¶ÇeE¶ú@V·Ô÷·(L¶·*!Š·:Vl·@˜/¶¸¥-7@"8"Il8•¬ª8Õñ 8üá9 79™M9]m9• 9ÏÒ8ô )9 ó999I˜M9ã`9/Û-9‹:9¾8ãÇH8ÕrÊ9÷9FÀ‰919ÐƳ:© :1¦H:' i9ïé9‡=Š9ÁÖ9+Y:9—‹*:Ö :Žì:é5Ä;Ýs;¥é:§_X:„[9T°c8Tì^¸®ž¸¦Sò¸aÁe7Á ò8¾w7ÜÃq¸MI…¸¡W~¹Ô”¹¬…“º/’­º~yºÆغ…@iº6!¹nRú9qªÇ:ù :TM:{JÆ:…·:shÔ:-úÆ9¤þ®8(ju¸¸Qñ¸Åÿâ¸3ƒ7‘Ã~8ˆ­8®¯¾8Ûа99T¥9§‘¬9ôƒ»:#Î9ÔDä9g9c~©9k¼w9i?™9:&Š8÷ÎÎ8¦nù8’^w8£(8¬ÓÇ8–8az8 %¯7èŠ7¾œú7· z7¬zµ7…”q7{á6’û6´»5Øa5ÍPµ4¶':ç¶qò’¶™Í·J­·XªŽ·€ˆ§·žŸÊ·¹ û·Ç€m·éÀ¸Sq¸1º¢¸I˜¶º½u7Ú#†8^û8ŒÏ 8‡ªP8!é8Ÿ[Œ8ÒÕ8Ú8·T¡8²µ8èQ92S9,ùê9( 9 .8Í×’8ˆÔ´8'ZU7ÎÓ?7šUê7¤œ8eë8½tm9@j¶9‘iÌ9¨(9£?ö9”1G9›g9PMç9Á#9øl9'8z9ŠÎO9ï…£:AÆñ:…)§:ßr:qa:LJ9£8aŸí8MõY8˜x7ÓË#7¡U¾7”@m7ߎ³8…Ë9)å9)†/9Ë$9UÑ9 ð9ñ™8Κp8¤Ê¸ƒ^o¹T:8¹ÖÁܺA©°ºšÐ ºÇB5ºÅѺ è´º‡ º‹$óº¦#ºÙ´S»‚t»MMf»`⻕†ì»¯Í¦»ÑE»ïÏà»ÿ”ƒ»þ»ðÕ»Ú#¬»¶–L»)»|“œ»‰Æ»›‡»›_!»…â'»^Gk»Jb»A´»)Ôðºùóƺâغqк›eKºÛ—»¶ïºø€ºÍ캖OBºPjžº?ÞﺖL»mÉ»;n·»X»Qâs»:«‹»% λ€Ì»EúºÑiº¤þ ºˆé;º`£º”QJº¸MºÎ‡‚ºÂu ºœôºkõ º:ȺŒ¹éѹŽåN¹ I¸X‹··†¨·‚I·^B”·g’¶ypµ†ø³ãr4­À­4ÀÚÁ5 -5Q5-{3µ’íÙ¶¾¡· ¶û6Uð8seÇ93Yu9¬™î9úùt:¬Ó:oÉ:1Ò¡:jÖê:‹p©:Lû:7Ï:ù9òýÚ9íùÎ9ÇN½9£ù9«ÏÂ9ÉŠ‹9×W{9Ó[Ô9ÂN9ž‘ 9XŽB8ö“p8‘I8…8™´æ8—_±8sŽÔ80ú¤8é7ÊÅ98ú8†šU8ÔE8íÓ 8ß9Ò8ã­‘8ôØØ8Ûæ8Š"±7i¸ƒâ¡¹0v ¹¹ù­º1ÖºŠŸþº¤ôº–xœºmƒ<ºJáòºW8·ºˆÜüºÁ” » ˜˜»4el»X.N»|³¼»—͸»µÕлÍs»ÖJŒ»Ñ»Â¦¥»ª*u»ˆ™»^J»[á‹»{¤ô»†e>»tæ{»J3S»/— »%»Ô»Û!ºã1õºŽiÞº4=ºJªºôºÐÁÓºÚ˜»º¾L;ºÀUºCäº º6"ͺ¤æy»ÊH»*îè»/¬ú»“軳pºá$ºÃ⮺  ‡ºs9+º:ѺæEº&&ýºL5‹ºtƒ~ºy¤ÏºUû]º"¶¹õóá¹Ê¹¹¥Ÿ¹aýÝ¸ðˆ¼¸GÀŽ·Þm· d¶áN/¶¨c¥¶)‘Ôµ5DÈ3îÃ'4£D†5‰Ð 5ˆ‹–5¦Ò66?`ô6L¸V5Ï/е¶óHµ7Er7‡Çô8†Ï 9ã«9†%Œ9²è9Äð_9ÛÆ:k9:=Vï:IàÕ:!ªs9Ú˜ñ9¬®9§S 9“  9]Ö=9@å^9^Ã49€U9„üX9€2¯9aº¡9+Å8Ý8•Ä,8¤u‚8êS99?i9c]8Övú8œ¦ê8\ÿw8±œ8(6*8{×_8ª@8ñÑ8°žK8¼8¿ºp9'¦™9t?;9‡ÆÞ9oìb99 }978¹aÇ8u™õ8T­‘8‡Þ>8Å£_9ñ9]»À9†eù9u—ƒ9%ÐØ8§ö7ØÇR·“‹B¸ÑÌÿ¹•´fºCFºQ€«º[•º5$pº;â¹ä¬º DººS’;ºœSúºÍ„ºòÿF» ´ö»)ûÅ»PUþ»sö»»ƒu㻂\ä»sxÏ»Uuº».[<»Û™»b;»&6Á»*Ÿ »¾XºòáºÔ£ºÅa¡º¥›º_hŽ¹êî͹‰¶¹ÉǺ65¾ºv˜¶º|Õ ºR–*ºà ¹Ä$[¹‘ ¹ÅViº>¬Îºž'ººÈÅIºÇRκ¤ºº{L[ºFÝ(º$ñxº”6¹¸Þ¹ƒ_¸¹Vø¹\ä×¹…t¹›¯¹›Q®¹ƒ`‹¹G+ª¹jÙ¸ôu¸¸ÃšÂ¸ƒDé¸/#·Ró]¶„hµ¡¥7´NDØ5^"6vÊ67›g6NÄó6No¤7“Z7)7ê¥7]ÚÎ7 Ì»7ï¯7Ïa7Ù9ù7õíÂ8p—8YT8è“8àQ9Æ99Ê_9|[9½ÙÕ:ì¡:œê9îªÈ9—›p9Dݵ9(Ãè9!Å9 î!8íæ¯8ÙØm8Ìjƒ8¿8´¢÷8¢e8…_ï8vœå8Ê9Ukô9¸æÇ9ïá<9ï°ƒ9Ç>¿9˜z9\ue9%þ8¹xŠ8¢™x8ä`°9B ø9Ÿ:9Ú¼Ú9çÜé9¸:"9aƒ8ìÓÃ8„*8`¸Yx¹€†òºåPº84kº7к %÷¹½Í¹«çŹñx(º=½,º†ûFº§ÕlºÂcˆºä®» Íž»%ãÞ»>»H"“»AøM»01Ê»ÁDº÷äÈ=ºô^ß»!¯ºî6ºÁt亟‡º’'ºJ˜º;b´¹Ëw¹0й,Ìó¹¹K º„º0öº£ ¹ïF$¹ù¹L¥ô¹Lò¹¾Ruº3Óºƒ_Yº‘ÈÒº€Ϻ@ËǺ ›«¹âd¹ºaö¹*>¹Gw¹î¹ †¹õ¶¹,ü²¹3ɹ# d¹˜¸Ñ]¸Ÿ¯°¸mí´¸!DJ·³Ö÷·q#¶<ÿç´]N5·ä¦6V®]6²ô6ï´7 {l7 àÂ7¡uà7£­ý7ÖP8=g8N¥s8g›Ì8uk°8‡š8ši8°Ü8Á™˜8ήÈ8éºì9ÒC9_œu9³n;:Na:+U»:#7·9äÜ_9?9%»Ÿ9 :u9169/öÁ9øÖ8ß ª8¤l8‡Œ8xëV8c8Ø8bž8ÃÊÏ9mÉ¡9ó,ò:8™è:S&5:A50:_9ì›E9§ÁO9W©¬9¢9!¹9#ð9Û:#ÔÙ:DŽG:4ÓE:V9–Ül95›9,[8ò&ß7¿K¹W€í¹øç~º$ ºTž¹Ä|¹|Õb¹…ýá¹Õ=Bº'dá<%”k<?>;÷T³;Ä þ;€M :×Sœ9[xA:7Aò;v}ø<ÁÛmƒ<.¬9+ž<áb<< ¢<É;·5e;7qO:‘už9ÐȬ9(8Ýå‚9)Š³:|‡:ö—t;±Ó‘<6gÂ<ƒ¶<…{Â9b¬$9WÜe9+uû8û [8´Ê8‚¦n8Gm·8)bà8Lˆ8Óÿ^9i½Ä9Éf:@l: $:4õ9ë9Æõ‰9•öl9T»ò9E«Œ9•Rú:^õ:k::±ß¸:ÛQ]:ÓuŸ:œ“ :6œå9Çð 9œæ9¼ÍU: Èm:p":Ì„ï;¦Í:ò/8:”w69ü5Õ9.H8ŸÊÀ8›É,9‡ü9Ž>Ú9ʲn9ø9‚4:9Á³9»²9!Í 8ˆ¥©¸®Îû¹_¢Å¹¡ð?¹¶Y¹’òR¸é¤l8ÆÍ9Ž™´9ÏÊÈ9ý¬€: ßé: Z,9˺h9H 8ݸt ¸ï·Œ¯6ÒM7 +&7ßb8šƒ8˜Xj9öï9k¬9ˆ½ø9mý™9'Î8ïL 8ßMf8û)-9{¹9Ķ9 ,9EÚ9%1g9¬¤8ï‘8ªðH8‘D*8È8yç8?ÉQ8 ç­7ÇŒ 7z‹Î7v?6ØOo6««4A¾Â¶ú+|·iq·¡õ2·ÌZš¸jÀ”¸t¡¸Š„t¸££´¸»WB¸ÌB¸ö¾4¹( ¹Føó¹(Y•¸¨&&6ï^[8ŽVp8¬~?8XªF7±ce8 W8°Ö”8ÕúÏ8®­¿8¢<9¼™9aŠ29¢^9´–9„/9q96#ª9 ¾=8ß\¯8·s¥8¨§M8ôyÜ9Al9÷g\:6:SÛ:R7w:D#:.„: –R9Í7Â9œâ½9·•F:ê-:ˆB.:ÙI ;/;!8B; ,ó:¸­f:OÇV:Ã[9õß5: “j:9ªË:“ì®:Ü :ðhh:²E¸:1ìÛ9}r#8µOÄ8–l¦9€€9Ÿ r:6í:vÛ9æ×59jÝ9k$a9ˆÌÎ9„I´9:1‚8áíc8,°á¸e›¹²}¸ó«·¸øl8Ù°x9^ª!9˜Ä9»‚Ž9ÐÐÓ9»¥¯9pŸz8¼,<6§L6·¯çÊ·„ŶFT²6Ù’œ7G‡š7Š–m8Ñì8™³¥9Nº9_hÕ9zج9[úÁ9%"e9ùN99)›Z9GpO9[Že9sí¢9†ïy9†Óq9_ä9!lñ9až8û§Ñ8ñbô8Ä=8—Ø8T8c8Ò7µò¡7maÕ7F-±6¾T]· D·ÀÌ+¸V|¸?}µ¸bÀ¸áWÕ¸ä·å¸ô’¹ üõ¹ £Ò¹1йHF湃i¬¹«›¹®8î¹l´ƒ¸Œ%88’%Ø9•]9že8qç×7ÃÆé8uõð8Ú68Ù…8¼eè9&Ð9ƒœ9Ûwž: éS: ¨X9àë?9¬}e9ˆò˜9a<%9<Ï<9 N 9&.^9‹}š: ÎH:b>«:‘l@:›]P:–¦\:‹Q®:q—1:<¦¹: 77:²u:6ûx:š¦Ï:ú>W;3@;YXG;TL);#To:Ë:nHt:5ÃÁ:7ïÔ:@ý :e˜¦:¤-£:ÏJÈ:º‚ü:aÔÁ9¹N8ëN„8só8ÞË#9ŒMl: ›/:<Õb:.-w9èR;9¯‰9§.Ô9À09¶˜9©D³9¤øV9|ˆ‚8Äðg·â`÷¸sdë¶Þ» 8©bå9&€=9mA”9šxÊ9ªë9‹€9)"8KÀi5{ܤ·j¡¶’U5•ØŠ6˜6èi17b{I8-8Ãî©9= Ü9‰s9™|9ˆ»÷9Wð!9>l9a!9Í%9©f9¾RÁ9ÓÁ¬9ÜŠ(9Å¡Ý9•ž9`ÔK9PêÙ9Sc„9:™9 ÁÇ8Ô j8¡dƒ8Z²ô8+7É 7á,¶TþÚ¸f|¸l£¸¢Ia¸ÍDÓ¹MعP䈹bs8¹€cå¹—1¹žÞ´¹Á>⺠ú ¾º-l¹ø7@k9J®O9&ò91=8rÿý7ðV´8œ®08Þ™ 8Ö§9åQ9‡:–¡:EIþ:\‡í:BòÒ: $9ô|ç9Ζ9³?9™³D9‡ÉÍ9£ý¨::l:©:µN :ÑþÙ:Õ¿^:Ìb :º>¨:œøW:r“d:F›M:dS:¯-I; {Â;LùÚ;„ŠÎ;h;|“;1–­:ך¸:Žu(:|ž:xWI:hÖ9:} ™:Ÿö|:©wµ:{ŒÐ9ûÑ9/¾«8o}u8Žé!9JC39òYá:IVÐ:`Æ*:,Od9Ø|9·=9Ú-9ì+9ëØA9þ[H9üA 9³D:9$ó·Œt¸†d·%›8‚¶¶9b«9l£ð9¢%¸9¨Ž€9vÝk8õ%ê8¤Ù6„> ¶ð´Õ4x5¶•Þ6(¬e6°Çþ7˜iu8{þU9`r9‘š9È£>9×m$9½™ü9›æò9œ=@9Ä 9ò¢<: õæ:Çy:'²ð:ñR:g¿9¿bo9£s¯9¦šô9Ÿ~k9€ò¨9B"¾9›Ò8è“o8—và8H:õ8ƒÔ7GyÒ¸Χ¸¯h¸ý^l¹'G͹EíU¹¬Ÿ¹­¹²Æ\¹ÃY¹Ûd[¹ò—ʺ U~º3êºf/nºfxŸº¼S¹9» 9=]¾9Äð9¹™9>Ïù8 a7WÉ8…GD8»õJ9Þ¤9 j:Q:uIG:›™ð:™M:|¡n:J+Á:-°:³”: à\9ï/9ãó¡:¤Ú:†T:Î.];ðÍ; B‘; ÿ ;^ß:ëˆ:Ãœ:Òv:˜‡·:É÷ü;=è;`æg;–WS;°'!;¬¤õ;‰ea;5úÂ:å”:¯f~:¤¨:“Žƒ:w²:w}:‰ç£:w#:§í9…Ç8¬ðŠ8BPô8õ9°wù:3¬¶:u9:`Äå:Éö9ÉÀÆ9ÖÕÇ9ýÜ$:e‘:¿ª:"fÇ:™#9±\É8ËQи~8’¸Ác·ÎX38–“39;|;9¡äŒ9ÒD;9Â9y—Ì8Þ7,8í6Èãï51þ 4Øp5%0¾5±Â¼6í:O8 â¿8êŒ.9ˆÆ9èF:EÎ:´:Qs9ä»Â9ÿÀB: ¬Á:?£ž:Y¡l:m~ü:m—p:M«:Ī9ö-g9ïŸÉ9ó0 9Ô«Š9£¸9±õ9U 9K8È?588"Ç ·Ö˜¸ä·‘¹8B¦¹xa—¹œ­!º¸"ºáDº+šº÷wº/¶ºBàºlNº›^º±"7º“vغ4+7·¿g9äd*:N9Ô]9X,¸ Ÿ•¸f;7¹ 88´=9x÷÷:á:‡âÇ:Âw@:ÖïË:¿¡o:›Î :…Q':vëE:gm:M¤A:3²È:=é :Š•j:Ù×;ß–;*y^;0?õ;+Òw; û';I7:ò -:׿<:òé ;(|h;q¬Q;¢é ;ÇOj;Ô{ü;¼öÕ;Šýá;4ß:ù¯:Ô6i:Á':™z:içÇ:]÷ß:^Ë×:.³Õ9Á˜s9c8_«î8‰÷:9Wùà:4“:`Áú:z£‚:>ðŒ9ëí/9Ä•õ9ëtk:ÆÔ:ff:(|S:0£×: Dv9‡Õx7cçv¸ÿÂ6¸æ5J¶Žu€9¯N9ž ”9ûnZ:1P9áæ˜9|öŸ8Éï²7éÌj6ÍÑ5œõN2Ó ¶µ!Ú4ìãR7W`Z8‹ õ9V}9ãr:0¡‚:RÀw:Iô¥:,-ß:%ê#:F-ë:rùþ:6:œË_:¢í0:•ñi:n˜u:4Ѳ:!`€:&*·:9>9ý¬÷9Æh?9©Ú9ŠÓ19@Yn8ü8h8£¿Ø6.€ì¸þŽL¹xú¹«Ùe¹à¬º@1ºIÇêºIÎúºKúyºWÆzºnFź„•,º˜C­ºÁ.µºî¤~ºéѺœß¹¿89±¹T:;:1y9¬„R·¬Âܹ$ƒñ¸øgõ· ‘9nV9þ¡ª:†–:Ø?½;\ý;ö°:߇•:¾~:²ýk:¯¥›:¤÷©:‘V:„<½:˜ïý:ÜÉV;K™;@R;Póe;Rq@;KqF;?;,=x;¦•; à;=)õ;€ä;¬!‚;Ö)‚;ðòê;ê` ;¿`;……(;2™Ä; â:ðØH:ÈÛÃ:®:PÓ:H>î:=Ex:ø39‹÷f8Ù­8[¹8èz 9¨qy:,²:kí:W\C: Jw9¶Ì­9¿$â9çÝU:/R:k:/Ÿ]:$OD9Ú Z9™ù¸­°f¹1¡V¸Êó 8x¡<9‹w·:lÎ:9Y:1ëÈ9ò«=9nuh8¬êÍ7ÂÜ6¸&95FïåµÇ¼¶`õµÔ™†7Äš 8ÿU®9´Ü÷:.…×:yÈ:‰ÐÎ:z1Î:[}!:iìé:ŽéÓ:ª@Î:Áå:Ï#Û:É/_:ªs:,:R26:OÖ:O`Í:3p: ع9ìÚ„9Ôf9¦M¡9]³l9 Å8D“ò¸çHH¹™¹áYrº_>º8¸ºûºŒf*º Dºšî“º¬¢ ºÁômºçÆ6»je» *Ý»5Cº…©ò´²›ý:5]§:hú[:/8¬·Ç¹‹u¹ªKɹ[V¶‹=µ9±ï:lŠ©:× ;íb;#¼ì;!:þ2j:î™$:ó[„:òé4:ߘç:ľ:¾NJ:æ î;:ù;JƒŠ;h;r×P;q ;j|f;`u;Q¢Y;Itÿ;\¶/;Š‰À;³É¼;ßeÖ< R<À—;îK;µp;y­;0ÖÇ;òµ:ù-W:¹²:tƈ:F>>:L¢Ý:8Ýù9ôíú9k!8¹ÂX8Žg"ºdºŒ:Cº¥œºÁ†ºà´»ð3»¦q»9…»á7»š‹ºÚ º¼0hº¶²º» Þº² Nº”(«ºj]ºKÏ1º:Àìº㓹°ËY¹C¸‡Ô^¹ÔT¹œæW¹Ù½ð¹Û§,¹¯ª ¹n»–¹ŸM¸âl¹/:¹¶Ôº3ºGs ºB_‰ºÑ۹؈¹¤J¹·Ö¹u ¹AÙ´¹¹«(¹‘¹ ¨¹ù¸ùóø¸åÔç¸Ìëû¸¢cë¸Rq۷ܬ·D‚ⶒÛêµ~lI5fÒî6HBô6Ú°V7=Hw7†Ê97¤!ø7±ª7®H8BÔÉ86x28LéÙ8Ž„µ8ÄÂ8êmÙ8û(Œ9÷e9Ç 9*3•93Ð9,£Ñ9ji9*íJ9u"G9Êl×:!Ne:].«:p]]:C]¸9ëÒ‡9y•Ú9A$ 9m›9úÂ9‡cà9Jµ!9Jó8ªgR8(Œ8ˆoâ8ˆ:V8ÃE9k®z: —À:vlä:¢Õ0:§Å:62:ejƒ:-h9ðPÓ9 f×9ˆ|T9´ a:–ì:c‘M:•~{:œ :}È:'*Ÿ9̆9“ô69at9€T8Ç 9¹?ó¹ë-wº £W¹Òó¹nã¹!ñs¹\w>¹½ÝGº¸…ºL§„º„$TºJ{º«Í7º½9nºÞòZºÿ&{».Qºï¥‹ºÏÖ º¯y‰º—§/º‹,캀"¬ºX–oº(v/º U"¹úU!¹Ø‘D¹•}÷¹íO¸D߸DÚ(¹àq¹e幆wÁ¹l+T¹(ÐÙ¸Óü¸ˆ¦¸Ÿð¸¹-Ž¾¹¯ã]ºKºîHºM¹¿0#¹Ž2H¹€Yï¹ð³¹vº¬¹VYõ¹@kk¹>F?¹:Å-¹(òè¹÷Ϲ ¹¹€Ó¹ÿ—¸±L¸ LW·Ε5«tÁ65$ý6GŽ6®íœ7:À7­>C8Þ8/|P8IO;8Nä8Èþ¶8ÇaZ8÷£œ9+žw9XÖD9o©†9>98Ð99©=89§*…9”ƒ…9†§9Ÿ“–9ö—:G E:^¿:­2):¡M9:_×á9ñÛ…9‘l‹9ž`ø9ÓôÛ9ê·Š9ÆêÉ9…~k9"xZ8èg08Ú¥è8ÛùM8ñ«49_›S: |~:Ž¬K:Û :ÿ¿”:ñÙs:Ê”Ö: Äc:oõg:'Yï9ý‰]:Î:C5Ú:•Ñf:ÏÃ¥:ï{e:ÜyÃ:£}é:SÝ+:—h9÷¶9ù?9Ò:V9"„¹:8°¹Ïí*¹Êeƹvb¸òtB¸ØI–¹?s€¹­Qµº éɺW€úº‡Ùº ƒåºŸº®QyºÖà÷ºõ¼ÿºóêºÛC4º¼»ºš\nºsѽºB3¡º¯Ý¹íŠ¹¸Ý¹¡Wʹ”H’¹sNþ¹"*븦?θ!R¸Våö¸Ï¦l¹—·¹ÔV¸Üjü¸ŽYï¸,å¸(S¸§L¹Lx¹½ª™º?ºQX¹Ò‚¹¢“¹•.¹¥È¶¹µµµ¹°& ¹¡”t¹Äg¹ Ÿ¹~¥¹wǹadê¹g¹fYw¹7ªî¸Æ ·Ù ï6ŒÜ‚7L7,7Xä7¹h8 zî8l¨j8§´8Íá~8ßì8Ú­Ü9Rïè9Câ9U M9ŒÝ9·Êa9Ô«c9âK9õ#ø:ST:jŒ:{: Éy9õ¦Q9ðUÐ:`+:s%G:µ:éü°:ó~G:Â%l:jÓ­:V9Ù>o:|•:4jS:04Ž:ü9©Ÿ19]´³9>~99B›\9Aª9o ì9ýNG:L ;f\;,+O;5±;#¿;Gä:Ö0Ð:Ÿ´:m­Î:WhÞ:„³:¿c;ä ;&w.;)æ³; 1â:ÇZ):†áƒ:P±Þ:F5í:@è: šÜ98˜o¹*ä&¹˜)·¹`q+¸Çüü¸K1¸¤ÊA¹1Ô¹°Ý¯º$ຄ7#º¦eʺ£o¥º›~º¸¯ºê?’»ì]ºöÚºÜû꺸†¸ºˆë"º7U¹ñ¹¨‹V¹Áñ¹XM¹Iô²¹Bǹ4¶&¹ÙÛ¸ÂWQ¸d©7¸O=|¸‡ï´¸˜|…¸‚™O¸3·Ø”/·©Û´¸1p´¹p`¹—ùb¹û¡º¼8º †Ð¹é7h¹Ò²¹é3zº¯Qºm‚ºÏغ¤º¡†¹üÇò¹Üª¹ÁY¹¿)!¹Åƹ±’“¹j8¸»t\·‘7Šó7‘^C7SÔ7ÚÖ‹8S×8»Ø~9S^9=ä9Zªu9`÷û9¼?9¸Äg9ÛëY:(Ô:.®:=eÂ:I':]7:rhÐ: ì:yy2:^|%:F>é:VÊ;:“¯ :Ù½ÿ;;&Ñ9;îN:Ξë:in„:å›:9!:w@–:‰X:mß¡:&ÒÁ9×>ã9¥ˆÈ9¥D9§t†9¤QÞ9íÇ›:‚¬À;´ù;KwZ;rÏ;n;P(±;,µ; ø:Ó@:±gæ:»}ñ:ób;'MÐ;UþÔ;lÒ;XÚ¨;(ø:íh™:®¤=:–z¡:‘{¾:‹Þ: Ch9/Í…¸à!!¹Q¸laY¶ü~·¡´È¸–J&¹>Ù͹Ü# ºZ‚?º¥ †º´ßZº ®Tº£Œ\ºÕ»'Ö» ÃÉ»®8ºäž.º°ìµºb÷¹ù¬à¹‰‹Í¹=å¹$‰œ¹¼¹$Ñ´¹FgŠ¹býù¹K¿«¹9¸„ŠF¸ɦ¸Ï׸»·ÍJ ·€ü'·?·ÍÅ׸¸,;¹‚žŸºŠ¼º=êºM³‘º8¤²º#éäº)ú’ºFÛߺ^²/º\ødºPMOºN§åºN&6º€9+ø¥5»VË7¼$8[Mµ8a·k+ ¸«>ú¹|ãºϲº%²º»Øº±Vºœvº¸]gº÷uŒ»E޻ѻ-7ºáLªº›Š‚º)õƒ¹™ ¹)#2¹:¹ò¹!&‡¹XD·¹˜f¹«C‚¹ˆ¹R¹-¼¸cçc·©ü/·j&F·E¹Þ· %¶Ï%á·pëø€ò>¹[pŽº5ºb²gºкŽ¾¤º€õüºz*Tº‹!cºŸ[º¦Víºž\㺘åöº”¹~º„ ºp?wºq­ºso¬ºQKºd]¹VvÜ·±WB879“8pþ8Š\8ͱß96Åò9š>Ý9æíˆ:«:1ÖÁ:7wd:†w—:ƒoX:—I-:¼€I:Û(b:èv¶:ôß0;S±; ‰;;æ;P;½–:í‹S:ó{±;t*;D¥;u¶+;ƒ Q;aÞÏ;!_:¾´¥:˜Õâ:¸qä:ëVw;±Š:æOÒ:«û3:p:œ:G»N:P`Ý:S¢¾:@Ûn:\ÛÑ:ÊÇh;B͆;–‰W;·Ä¦;»Yr;«Ä;–Ø;ãõ;[ z;HŸ`;P¿è;uh7;—¿[;³œ›;½¦ü;­ƒ|;‹é™;TŠó;&9; • ;¢|:Ù¥¯:‘‚Á: Å9S³|96~9ÆÇ8׿ä8ƒ·Áû¸ô§±¹¼t ºV¶wº©±kº¹`\ºžm¸º›»ºÏEj»W»a<»˜E»©YºÉ‰™ºtóú¹ëCä¹U£0¹HW¹&Qʹ6D&¹n«P¹¸sr¹óɹé∹™«P¹ȯ·þõ¶e×Ͷçw¶7äÙ¶5û]·GH¸(哹)è¹ñ— ºsènº³:aºÊ%ºÁfVºµÛcº½?oºÕjïºç¦ñºã~fº×{}ºÖ×'ŸºÇtº³WVº®Dõº±á^º¤ÒAºrm*¹ú+ ¹ f8µ\8µ 8Þr:9¥9k—°9ÈZ:Üe:Y÷«:‡€¸:”­g:‘ÈÙ:Õ±h:Èc}:ÒÞ,:üÂ;œá;#›ò;)Œñ;5 ½;C;R;J¿C;IŠv;>¤ç;.Uz;&rK;4ý;[îí;‰¾;™Üq;„;ZÙ; W:Ëœý:Ø,;ã ; ]¾;C;õÖ:Â_r:”è¶:‘S:›™:’ñ,:…À˜:°›n;#Ê;ŒdÕ;Àá~;ØÆ&;Ô³$;”;­LN;šD£;Ú ;‹è¤;–Ôt;®ÑÉ;̉ì;ßa=;ØùK;º•—;”É;hž®;?!Á;&‚;žÐ:Ú«Î:€G`9ö%9ššý9‘ÊS9cl8ß#K7¯“¯¸9LB¹@iüº𒺂ºªõºžæº†À¥ºh„ºÙ< »ý» ø»³-ºç”&º¡,=º1{}¹©G5¹H(¼¹DJ½¹Zm¹†=í¹Ïc£ºµMº*«‘ºšb¹‰h%¸›6{5yeo7'ú6‰˜ø5!™«¶Q~y·Æ†¸ídù¹ÅPôºh°¸ºÆ¢~ºÿ[ »5=ºýê'ºûMQ»ÚB»«·»ð¢»;<» Ý‚»Í» Bºþ¬ƒºð:µºóqºíJºÁò-ºnaÀ¹¿©Ü¸'hÇ8ÒNl9%~9OÆ9–t9õ²u:B¿j:‚ü:ºE<Çh™<°ÿ€<Ž7À<|H¨<$÷<’Rö<;¨Ö;)ë:‰l: Áé9í±::%¿}:­v;o„<6K<”oy<Ð1»<ÕÊÝ<©b´pð=VžN=Vß=P5±=Pé =Wë¸=W}»=C„¤=" â=j–=Ðï=ù²=p\<΃<èR<0Œ; ç`»,zÿ¼QÔ¼¶³¼Ô.'¼³ ¼fÙ×¼s3»”DQº¼q§;Aù;ú l_=f¥=mYµ=eÑ•=aȵ=XR7=9!´= I<Óå¼<½<¿Á˜<¿Ë¯<·ê{<¶Õ¬<¾hª<µd–<‘ï<â’#<†Ç$:çìȼ`8E¼ê5q½)/½Caš½6뛽tº¼×Áʼ¡Z±¼‚®ê¼}?Ƽ‹,ù¼’}r¼‰û”¼mÖª¼=ã»ÿ†»2èÉ:ÀO<5‰¯<¶8=(B=G™=o7–=yÞš=qSš=imv=k=oÁd=dÍ·=Dñf= æÃ=h1=Î=…Ò=.º<ÆE<„G‹<‡ð:ÿwô¼WÁ¼£m°¼ä‰+¼âªü¼§Mp¼As»Å¬W»k:ñ«Ê;ãX¸ôŸ;0P;ÇW;ͮȯÑ=(nþ=Ff<Á¹-<£¾<›Ó˜<–!<þM<’ˆ•<”ÀU|;¥ç;<–$=°}=>šÄ=wn+=ŽÃ˜=‘Ú=‰VR=€=zk¾=zÄ =m¬P=KÚ ='?=¨¹=# £=.yÖ="úƒ=·ñ<¶åôü:oœ<;ŸCM<ÃܼâF‰¼Ç¯ª¼ ×»é UºÉ¦ñ;ñC;ÃÞ†<2Èp<‚÷T<°óŸ<ðhr=î5=2Ðé=-,u= Í=Œq= Û.<ÿ)Ú<ʦ<›7/<‰<‹á<‹‡<…šŸ‹:ù<Á:à<8:°ß‹:‡“l:rø:uoX:c~:6%Ñ:É : üÊ9÷õx9¶L>9f­r8ÛÃ1¸œ,­¹©Jzº mº75ºi>:ºˆƒÔº·Òº¸¹‹ºº_²ºÃUŠºÖçÁºñG>» Õ¢»&æÚ»CY»9éº÷ÿº"î–9ÚP÷:r ù:T/+9€P:½ËÛ:´J:Ÿª£:¦ó:ÉlJ:ï{Õ;;½;¡H:ähé:­½:‹óð:…Cü:€¤6:X±":+}á:[Ò:®:2­9³[Ù9=f°·¥è›¹¦É@º"í¥º[UNº‰°²º¨Rfºäظºç.-ºïp*»Pc»‡»#w»;²»\ý»fE…»9(·ºÁ3Ð:8³I:a6ª9ÅÓ¹¸[¨ºY+źd(žºö·¹OÐz9¿Þ:•š¦;9ð;8Aî;GO®;8Âv;*â;2Š;FÞÌ;Q/“;G^;2¯;;$y:;)Äk;G,ü;pŒ¦;‰5ª;‘wÀ;“†ä;–Wa;›ÁR;Ÿ%R;¡pJ;¬=æ;Æ{\;ëP’<Åo<{Í<½%< è;ʳå;‘oé;TU4;(æ,; ¯9:ÇÊl:‡&À:tQ:ŽÆà:Ž‰8:Ož9ܺË98´"8±>ù8ÿè§9VŸ9í@ÿ:› 9»Æ90GD8·18þê†9GÛà9‹çm9¹F!9Ïü9³ê=9_Zâ7ËE&¹!u¹@Ú· ·9©œå:D@‰:“v :¢`²:…П:'–„9£¬©9 38NÙ°7”)ʶZi¡·«vb¸ Éú¸=>Ÿ¯†8Ë(9è:{¸ :¸y;:È°":µW:¬D9:Ƙ¸:ñlu; »ç;À];@; •“:Øc¿:£>‹:Š ‹:ƒk.:gÜS:6Ô:ÔE:$n:"GÒ9û¹É9’·Í8Rø¹Äžº.`Cº|ƒº›¬ º¿”ºÜ ü»„n»x9» %„»qá»(ª»=Í÷»SN¹»n‡—»½»m; »_غt!9anÔ:.®v9Ã|¹ÏFߺ¤º­/º|º#ëT·î0t:?w:Ùòg;(^þ;IŸ$;H‚;:À‡;@GÓ;\æÀ;y /;}Ý¢;lŽ©;U~ˆ;Gw;LÒ;iÑL;ˆg;–0á;œ1‘; e>;©öç;µ³û;½Jš;Äh;Õ¹;ñåƒ< (ê<@y<ßp<H;ì’A;°¬¨;€þˆ;E«º»W6¼»m“ˆ»€¥»Š)»‡Æ»W‹ºðEm¹þsO9xiî96—9ºíº³)ºîÝDºÞ÷#º›…ÁºT9†Ož:˜Pò; iÏ;:­¥;I“;ASÝ;C6/;aOþ;†š…;“þ&;’1 ;‡%;tèÔ;dH—;jð;„9;–3Ê;¡¹‡;§NC;°ë*;ÁО;ѤK;Ûs*;æ%6;úÛ< Qw<“Ð<xå<¯²<\à;Îÿ;š*’;iƒ;7·Ô;Š:É)O:’1G:œ5þ:É$Â:Òî:¢i5::u‘9§!$9|08¹þ9+m×9‰Ëæ9•‹J9A(¥8òñ¸fʸñƒ8 Â8Ú9#§94±‹9~ó8ØÙõ7àÎܸqP ·öć9W0:lÝ:†’¿:ª.~:ªi:‰us:6ý&9Ïã•9`œY9ô¼8†<´Í<¾¸b¬O¸ž‹W¸±%¸áI)¸›—p9.·:(›“:“WL:¬¦:¡xë: :¢:Á:ñ¢;Ç;©;~;²¯:࣮:Ÿòp:m^:A9Ë:ÕÔ9Û¯š9Ðg':Î¥:Ø9îÊþ9iŸ1¸Õé º%*ºˆaòº´½øºÓ9§º÷á» ‚»ƒ»"Å¢»7ˆJ»P¥q»m@7»ƒ±¸»‹›»k¢»I»}¿Ö»/W뺩 빼Ϳ¹PÉàºF.ƒºÙ…­»øH»¶ËºöÀãºÆ ¹Šoˆ:$_Ž:Îú;IB;;H;=‚r;=”;V‘g;„¾V;b;¦¬6;¡x;”ùª;†§;{Ÿò;‚¹o;“Äe;¤Ý®;­êÆ;µg‘;ÅLB;Úvb;ê¢9;ôë»<\< <ón<óÇ<ô$<õ0;ëÜÛ;µf;Š³¸;Y…3;)µ\:õrÀ:§@=:–7»:Åd:ñÒ':ß*ö:˜ð~: $Ï9„Í¡8Þ®‚8åRM9FX=9„ç9bÇÉ8»Cu¸†c¸ð%·¡J8?¨˜8¹Ëm8×»~8ºJ8‹ÀÇ8XA8‚8„tt9‚ýë:!6:†:¨È:ª–™:o:Ty: ‚Ê9²µ9w€B9*¥8Š¿m¸#&ѸÎøÐAm¸Þ‡C¹o°¸òá9'ÐŽ: þû:zÛ:ƒ…„:{©…:‘Äö:¿ÒE:ñO™; àê;™;Ua:û#:´È :n^”:"ó:9ä¢09’DÀ9fb$9¢Í'9㊮9á“q9Ž½¼5nÞ¹Ômåºq¤Âº±çºÓ9iºï»’»´=»,¶»6>“»YB—»}6¹»Ž‹q»—1+»—¦‡»”Ž»ˆu}»X}ˆ»™7º‡šº1zкŒµÝ»0,»7¥…»J˜“»/0qºìËìºZ¾w8Ñ˸:…dË:õ1C;!)K;.Ùh;1_ó;Có;rPk;˜0™;®bí;³«ÿ;¬•[;žã¤;Ú;‰\];“ ­;¦‚F;µQÓ;¼nÕ;ƶ;Ú<;îƒ;üz<-E< lÊ<ͯ<ƒÖ< …»<TN<P);Ò†L;¤C;‚n;NE;Ø:˾€:•‚¶:¯ë^:ñËÖ;Ü:Ù†N:†›î9ÿ2Œ9BíÐ8Õ~¦9÷Î9xï9‡÷ 9=rô8{“¶Ê{²7BcJ8v{8¯LŸ8«˜8‰ó8±§8'Ž8¬l®9-­ù9·M :4»™:U:°ŠÁ:® ³:A5:Xu$:ˆ`9ì™9Ä*9¦":9YBï8+=Š¸Ï”¹ S+¸Ó=¹ ï<¹l ¹L;8ª$l9æó-:!ÕÝ: Ö:0Óï:yX:°O:ãZ;^â;Vã;óv:ÊV9:|:~ÿ9Ÿ‹”9_å8~Ûª8ô*§9øÝ9¡+û9|ÿ*8ˆ«7¹yòXº8óºœæºÇ‚ºßEº÷kê»»»[!»$~Ê»RFò»X»•o黡,ú» P–»—Jþ»‹,5»o–»0¨jºßºœ;aº¹¡©»Œš»O«»ržŽ»cvd»)w/º¿ N¹ÓÆ7:›ˆ:­7>:ÿh‚;e;±Ô;,2þ;QœX;ˆ ;§™²;¹}V;»Ê†;³ö£;¦¸;™9;˜Ýš;¨³{;¼§ó;Ǹô;ÍS;ØB;êÓ;ùÃ)<ÿ¯<Sý<ù<Lç<Øß<ú<ü\;óŽ; —;œ¤Ø;}²;;B{’;0R:¨5Î:˜Êò:Ö«;; kÃ; í:Åúá:[$ç9µ½ 9 KÅ9 £v9rˆ®9 G±9”¹î9Káø9 =9Ð7995¬93)¥9 $š8´Í`8Oõc8'6o8ÈØ9s¿9ï ¼:PÔÝ:É5:Á§:¼˜6:•E:R\):…E:Ø:à:h‹9äƒD9oº»·¥0ǹ K¹ç縮Ð+¹D°P¹µf§¹ªê©¸Âö«99Bm²9OŸe9¾: :9ݧ:–:Ïâb:úMÄ;t(:Øs§:‘g£:Sÿ9oðç7á¸pP·¬.\8³Gs9!lÝ9 Þ‡8OI®¸ñÝ,¹è'aºn Òº« ¢ºÆ=½ºÕ˜<ºçº» »9(»u㻕Ó'»¦ðÈ»¨¡Y»œo#»‹Ío»vá»J·*»¯VºàÒºå¶C»ྻ^TT»‡nÖ»ˆXN»\㪻 AºiÑQ8ÊÆŽ:a S:»¤õ:ìå»;ÆÍ;U;/ë ;euF;•X;²U;¿É ;ÀÜB;¹š5;­È‰;¦¦ï;®‡<;Âÿç;Ôµ»;Úß;ÝiM;åÊb;ñÕò;ûN-<“8<„X<j³<«²;» ç;›Hà;x©;2»:Ûõ[:”µ:±\ˆ;Y×;Pí;q‡:¦³T:9_Q¹Žóº)UÀº†Òpº‘¹§ºp¢fºbÔ_º™7¹ºÍ­Zºì)Qºõ¿ùºè!²º¸VÙºmߺS§¹™´=¹|åö¹„U¹˜\Ó¹Þ+iº-rºZñºG€¹õdd¹-!Š¶_C¹8Ä7ž-"6æ]c5§,q·=|Ó¸”¹ ½ºE¥ºÂ•»æe»%fÊ»%¥Í»!Gh»&€×»5HÕ»?y-»:bB»0ØZ»0ùû»2â÷»*軤»w“»ÿ2» ;ºÄLúºEÿ¹]ê8dZ9RÑ÷9jÓ9À—:\Ä:f²:ªÈ:èŸ\;N±;ã;D£;Lö;C{;M8;mLë;‡Úe;w;’ T;™nŸ;¡åÓ;£…e;ŸIÝ;˜B";äq;ww;’Y ;¢Òª;¹ì;À÷Á;ª4Ð;{Ž•;/41;L>;)â_;Kö;d1u;dG¿;G1·;æd:ûôï:ÿW|; —À;Hv:âÿ[:öÿ;?~Ô;šØë;Õç;÷Mv;ÿG;ø:;íÃ";çc;åÐ<;çI;ì¼;úöF<+Î< \<¨¥;㾊;»ZT;™æM;€¥:;Yn»;3Q ;Æ:¡íÁ:<¹D:Ò£:é 9Ñí°9H¦U8Mf·¿Ë)¹H·¹¸æº3ǘºi/©ºQ>óº$)Uº:K˜ºˆbº¯Ö̺ÅÅpºÊË5ºµQxº‡(-º0âf¹é„°¹´™¹¨Pú¹¯”˜¹ço¨º6¾º}'ݺ‚ùºº öº©x+»j»7úk»F;à»Dy»Dê'»PSï»_fa»a”ý»V, »Oû¥»Tc»S.=»G÷!»B0f»D[»9 »7pº©Æ­ºÈz¸,Å´9X;z9·øÖ9ó³ò:,E:ƒE:ÁpS;Tó;-ÀË;KÓ;T ;|dÊ;} x;‹ú; Ž;­©Ú;°\Ô;´z;¼åú;ÀÎÏ;¼Q;´lf;­ío;ªw|;«„›;´+Ã;ÅŽö;ÒC;ĵx;šÉÙ;[Rí;0;;:^L;\ ~;yH1;‚zW;vZ±;MM¬;"cn;»²;$Ð;)z€;‡;’¬;!úÍ;xáC;·T¢;èŠ<¾$<‚<SR<šñ<8Œ<¹è< ‡e< S@<ŒO<°û< 1<¿;ØÌj;³ä6;—$Ó;};T4;%”F:á"0:ˆÛZ:F‡:=RW:"—«9Ë9Ýl7ª%z¸;©¹*‹`¹ÊFº¡º&nJ¹ô0î¹Â²º —ÙºWvɺ‰²ŽºšJŠº™k3º‚åºH€ÞºÃºB„¹æÁg¹Ö蔹òšûº5ù/º†jkºššhº}ªáºD¸˜Ž˜9îÝ9Œ©8ˆ-"7×sC7*Qª·O°¸Ö€¹Éô¼º„?ºü›Œ»7“ù»W»Ó»_dì»_ž»e)-»tpT»VA»x㪻l‡´»lÜé»rî-»n>»ež»eÉ)»aÇ2»@6л`ºx?…¹‚b!9è69ÌxZ:p¼:GŒ¨:‘ÅD:ÕÆ;D‡;A[];lO/;‚k ;ƒº;™Q®;—¼c;ŸÕ$;³v|;Æ×;͆×;Í—;ÓC;ØØ4;ÔÝ÷;Êö*;ÃÅ;ÁJð;ÂÚ;Ç}¼;Ò—X;ßò–;Û‰¥;¸Â;†.â;Lÿ;I$¡;i§Ê;„ôB;$;Œ-;zÁþ;Ká;,€É;3™¬;Ey;>r§;$Þå;‹;Jײ;”[;ÈtÎ;ï4s<ø< F< <Ù<²Ï<O/<ít< N<PŽ< A<ÌÙ< îy;ðd;ÈÔh;©š;Ûô;t‘Q;F±.;dÌ:Â]Q:…“È:p‹5:d>p:&~å9¤þ8Çl´6Vy¸€¹@’¹ºØ¹ê‰>¹¶Iù/ð¹(¹®2›º*¼ºG÷nº^êѺW¯÷º>Ø•º.íǺ*,º ì º‰Kºˆ«º0­ÿº„ºLº¦·½º˜öšº7ÎV¹ k9CSZ9~Xë9 0Ä8Œ=¨7õ·Š7-­t¸8îí¹q`º8ºÉ`i»$é»U3ä»jº?»o:ó»qú”»}@¢»†Ås»ˆëÅ»‚û%»~滂p_»„蜻ÎB»ËY»¬‡»iëØ».ᠺĹòºÇ+6ÓÏI9½Òÿ:#é:`p:žym:åšê;s;L²ˆ;~uŠ;’ßè;šÌk;­ò%;²û;;Â…ñ;Øg;åÅ;åO‡;å)’;é¶;çì0;ÜŒA;Ñ’R;ÎjË;Ñãk;×/¡;Þ¯­;êR$;íj”;Ô š;¡éK;lá ;UH“;q´;‹pÏ;•¾¤;—C;Õý;qG;E5¼;;êü;Q@3;[ä­;I8 ;1«»;82U;n“a;£i¤;ÎÙ;î¤<¼–< æ<yÄ<<<%@Ü<%Äá<#‹l<"~C<a³<‚<ÜM;Ú";·¯Ø;ž v;‰‚;hŽ˜;9»/;Ñ:¼Q—:œ:—Å’:€¾Ú:Å9…Ɖ8’¦e¶SJ¨¸ª•¹9h…¹’<¹…` ¸œSµ8ƨ8‚0±¹`M¹ÁN^ºÄüºˆBºº$F1º> ºO•5ºEĺ,„Qº2ïêºx1ƒº¥s)º§j¡ºd Y¹„îÏ9vÂó9Ñ`}9Ÿ¯$9 ­8 —8ÎP6F|w¸é•#¹áá º,¸»BG»?\%»bþ »pè@»tËy»{§»…a¶»Œà黋Éç»…›Ý»…†Ã»ŠÄ⻋–K»ˆ†Ç»‡³»‚\ò»Wi» 'Öº}"Š¹Vó$9ˆ™–:—^:l…@:¦?Ü:ñ?c;&¸˜;UIð;‚°;™³;¨º˜;­yX;¼k;Â\á;ÎK°;ᔟ;ót~;ø—,;õÒ;ô¦Ó;ó¼ä;él";Úéô;Ó‚ ;ÖFd;Ý«A;åeu;ïИ;øTâ;ë~©;¿¢T;‹{Ì;bW;qŠZ;þs;œd;ž„D;—èˆ;†­´;]e;B‚;N¬g;f~;e•;N<9;?2;P-;„I;ªe;Î;êk<²ç< I§<‚ <$ê<)´‹<(ÌÖ<&ü<<$<³<^A< Tþ;ê>š;Ãò-;¨÷;–Fx;…&9;cÌ[;5Ý;}S:ÕÆ:Çž:¹6F:ˆØ/:A&9h[/8‘{6f済ٹG¹=IÓ¸iÉ´9>tø9¦ó²9dÑÜ·HùS¹Z¡u¹©‹¹Í|IºqÚº3.èºizߺZÒºhZIºL ³ºfô¼º˜ Àº¦¸}º|ÏŽ¹¶-w9…ü1:5ò:ýË9Ÿ(k9è8£x~8RA·¬š^¹dȼº1dòº¿Aê» a»IL—»bfv»l=a»p’‰»{ Ê»‡()»軉·§»…«ñ»‰]ú»þW»Œ*»ˆË\»…Ó™»o »-x|ººóZ¹ûœw8Ô®{:û^:d4:¥z:ó:•;-jm;_H>;…9);š&»;¬+5;¶÷;Ê›%;Ö†c;ærI;ø±ˆ<ñÇ<O;ý9ç;ùˆ;ðþË;á»|;ÕJ¾;ÓfÐ;Ùù;âÚù;íŒM;ùö‚;ùÉö;Ú×K;¥;£;wcÇ;l) ;Š;«;ž0%;¤|;ž&`;Yf;pêM;HÓ;E ;^Êê;o;e; ;RjN;Lí{;cÀ˜;‹²[;«¡á;Éèy;äq’;ýSã< 7a<Û<#ß<&&<&Š9<%íï< *=<æ;úý;ÑW8;²|é; ^å;”/;‡Úy;lü_;@;V;5e;€O:ýC):ÕL5:‹©i: ‹9lßÀ8Ã]Š7¸qV¸VÕ:¸é‹ë¸ƒ¥<9&¼€9Ü^”9üŒ 9Ÿý8Žë>¸Ð‚¹Vÿ¹©ìQºˆ¢º``~º‘ø(º–É^ºÀÀºi‰º…u+º– mºxð»¹Îý9†>v:4ø¼:C=': 9‰qÕ9"›8áÅ8wO¸zãѹ²'<ºjîAºÝçÖ»!Ç)»E Ê»XF»_¦»e=˜»t¯»…𻈖¿»„ŠÂ»„–»‰N"»Š¸»„·…»€·»p/»B³ºòrƺQ¸ËyB9¾±<:E;À:—êº:æý…;-l;i™;Š};š¤ ;©¤!;¶‰;À³Æ;ÊE¢;Ù~ï;èÚZ;øÒ‹<kQ<²K<æí;ý›6;ôE¢;æJ¼;×Pù;Ï\Å;Ðƽ;×±‚;âè;ðÁ;ûD•;í(2;¿¸;Œgä;j¢õ;€ø%;˜ò;¥Ì ;¢C;”$ú;}¢µ;P8;;Àª;L„r;fÔt;mM¿;bïY;Xw;Z{†;re;W*;©¼&;ìQ;ÛÊ;ô8ù<>ï<á<ø£<Vû¼®Ö=¼ž¢¼+,öºà>µ;'qŒ<?};ìÞÉ;Cq9•¸È:¦V;)oý;ªò;•¡ž:»%y»ÉØ,¼…õ¼ÇÏþ¼ÚW+¼¿¼l¼•—ÿ¼}Hu¼Ž¾F¼¿õt¼ó÷›½œ®¼í7;¼¶ZŠ¼m6j»Ê„,;<?¼VNL¼^Yx¼<²>»”ÒW;ñ`ß<¨žJ<ö/‹=þH=*—<çrX<Ð*š<ÃXb<À‚&<»ÅÊ<©P<7m¼Æ:U¼o¯'»·ÏJº—&¹Åü»Z»_:šm;ª;ïM3;À¶ ¹0Xß¼4Ž¼Ä˜ä½ ýB½&U½ Ì…¼ïeó¼Ùv¼ð¬Ä½Ë ½/ ô½5M:½$eŠ½W­¼Àì¼X²å»Ǿ<‹Ê<¸õ<·!l<»¤Ö<°Pá<«R<·-'<Ô²T=p§=ŠS=/pÅ=5Ê“=.’j=#5=35=$2`=6Ï=M*¯=a]š=mÅ =jó–=ZœÓ=I |=@QÔ=8Éþ='q=ž<»†Ó®=PŸø=x5Ï=…¯=ƒl=e I=*9è<à¡F<£åP<Ÿ82<®!B<¿+&<Ý‹=‘¢=))`=HXH=Z‘Ð=WëË=EB–=,•-=Ñž<Ù¢m˜Þ»¢‰Ó¼›pº½ 1_½5 ½>öû½2cª½À¨¼áÓX¼†…I»êdû»;0>»/df»%É…9Ú†Ú;©Cì< ìÖ< ïÇ;tlv»Å;’¼ž|U½{Ž$øŽ½(|½æq½<•½/½÷½:ê;½GQ–½;ª½#Š¼÷'¼§!¼:ù~>º*;ëÉâ<ÕßC=úf=/ˆ¶=!à= ÿC=Û)=Ð=d„=šƒ<ï•Z<Í9¥<ž­£½,*^½Jün½OL½?Y¸½Ì'¼àuI¼|uü»à•»W€»Zø9šÝ?;¤´Q<Ü#<6<Ýɹ¢/¼O@,¼Úڽ鵽3$Ž.Úˆ½+Œ½L¢½(ݽB†ý½Sc(½Lî½25ˆ½59¼Ö÷¼„<»¬²Û;§Ðê3<Ü^Ÿ=MÉ=9¤=$V=sŒ= žt<ö!ð<ôê= SR= ÔE=9Uµ=K[]=P¿é=M¡›=OB=Z%*=c—>=[“ž=@˜=bJ= "=yÉ<ü <Ñ"˜=b™==ø=Y_®=fòµ=c6=F%l=¸¯<ºAg<„Ëà<Šmì<®p:<ÛåU=øW=#Ã==r,=P÷\=YC¸=Sš;=D(µ=0Vh=Íb<ò4¦<­ñ3/»“؈º±ZŠ:”Å;®F$<(Õ91W9elª9²ô9ÆÅ9­h›9žé9¸©&9×É9Ë'9—qŸ9BÒÁ8õC[8±—¬8ó=69ˆg: xM:i¥:«üù:Ôþj:ÓüA:¦‚w:XsU:ˆÞ:1::9V:?Ãí:˜9Rˆæ¸ÂDº¹$9*¸‰cO¸¬Á¹Ÿ•Êºü¢º ¹º÷€¹Œ|:¹‘йl]š7 %¹9à”>:zÝ:¾Ã):ãб:Ø_½:ŸÕš:/V„9o%·÷ꮹ‰¸¼”7>5r8*(7» ¨¸‹Ä¸·îÿ¹uÑ*º÷º~ :º¡yIº®˜üº¶žºÍgGº¿Æ4»2à»Vȵ»i»¥‘?»­“³»¢ñk»Ž@ »vf»Vg»2×»&» ×Ñ»)Tý»cËỎ=绘15»…Kù»7v⺵ž:¹‚Ñm:¬I:„1R:¬º:Éëš:뤞;žL;;a;{k…; 1H;¸Ç°;Ä;ÅÙú;Àà#;¹…8;¹ì+;É(!;ß4œ;ì6Ö;ìg;êZJ;ì¯g;ñ8;õP€;ü@ñ<G¹<cz<pÞ;œ:P;pú;]8:¸|r:šÕ:Ûæp; ;ir:â—®:y`V9»@•9í9Cö€9¸“9ífq9éõå9è×ù:³¹:;±Í:B´:ßÞ9ÔŸK9ŠB„9G£î9<…Š9’ÁÝ:2u:uÁå:´²ž:âž¹:êœR:ÀQ:w: Ô9á¨Â:A·:]‹:‡€":} û:½9â5¹ÞÞ¸®ë 6×Ìæ¹Ôoºº>_ºA 6º2Žº8 áºD¡º-l¡¹±È9^1/:_~):²t:Çø:¦“ö:JΛ9—M·ä·Ô¹þ|¸ãy€7W·8‘ ·]Š¸ûPá¹$¹,º¹™/̺ƒäºh…vº„Âغ‡'¾º‘1¡ºÏä}»*¦+»uÌ𻚡6»«¢%»¨ž»“ºæ»yw¶»Z|F»DþŽ»/o»$”þ»6 »d­»ŽµÈ»ŸîÓ»–§}»b¶ºúÒ¤ºÀ9“FÌ:=¥´:n/¿:ˆqö:¨[:Üf;Ž•;LQ];‰'?;©`h;¾Å3;Êý;μ;Ì©;Éœ;Ðþ;å;;ùìl<iÊ;ú±w;òAŽ;í\;êþ ;ëV«;òŸ¿<m›<wl<•O<ÿ¸<²;ÿÐÄ;Ûä´;¾”;œzÕ;bxI; è :®•U:¿Ý;y€;ˆØ; ¤:³*÷:§ 9(Íž9uä9«jã: ': ê§:´º:6Ð:‚†:˜ˆ/:‹Z":OÊø: >¨9É;s9¤[9°Íü: óò:q~Z:µyë:çü:ø[:ت:“Àˆ:!U[9̹g:¿:fZ:¥:·³B:”UY:Ô~8u$ɸ§©³8ýÿ7¾f ¹f!º::–ºtÎíº€bíº‡,º—6ºŸ–Rº‰eåºkÇ9'A\:`£ :¥Úì:¢Òl:bÓ»9É;È7º`‰¹ 4ʸδù8K¼<9]8”‹|¸ð©¹e¢½¹>1ª¹,_Š¹¦Å·º¥º9Š´º>º@ZϺzXº‹½‡ºû´á»Eëe»†^4»  W»§£Æ»šME»‚TA»_ž»PS»IW<»CÌ»Kº»ir=»Œký» ßa»¡P¼»„J»#¸íº€ÅÈ8RNd: p:'+:#:EP:“ûv:ÞâM;!‘¾;cW;•4å;³c;ÇÒ€;Ôà«;Ú«;Ú!;ÛAý;è/ì;ÿ(²<WÄ<Šü<=Î;õÔ);ê|;â¹S;àƒ#;éÒ<_<T<#W<|¸<.F;üc?;ßk; ;› ý;TT;j\:Ë…ø:ÿr¤;!Ö;!F@:î:p29ŠgB8ÅXë9Z¹:è:%Dæ:%Ù:F°|:•Q©:Èå):Ò§µ:°¯·:³h:;X“:è9úé:±@:aO):­_ú:âýn:ú–µ:çYm:¬T^:IÓ%9Ü=9æ¹q:T(:¯|Í:ãcî:Þ»¨:˜õ‡9ð£^8·A8ÿº9ѸÀÀºmuºqssº’·¨º¡¨º¸4/ºÒͺÓ@ºº£ïDº >9šA:r1€:•$:sˆÚ:À¸8âÒ„¸½•Ï¸›÷8±Fô9sy9XõoµÝ«n¹_†!¹…õ¹Cœ¹SñS¹·#ø¹þIɺ3Úº§lº zUººA¬»h2»Z’¤»‹H»žj€»¼ñ»‹>î»l¬?»Z±»^Å»dÈz»jçd»zw»Œ¢í»žÖù»¦ »“|0»MqlºÇv¹’ò¿9²ñ†9íÙS9ª o9˜oÃ:/:‘Úv:ò½Æ;6ˆb;~­;¢í&;Ày+;Ö™;äZH;è…ü;çõ;êß”;ü{ë< aÅ<,F<Yé<d;÷ZX;ç_;Úç);Ö+;àâ’;üÌý<{<ó<IA< gŒ;ýóñ;äôm;ÅÜÜ;™·;N-Û; Èô;°l;$©1;2V; Û:±Å×9ÿþÑ8Úç^9gD: 8X:?:L:CQ:R6î:˜òñ:ãÿy; ?;fí:ÒúÚ: A“:wÄ:Fƒ:05Î:UT:àÌ:Ö¥r:õ%:ìbÚ:¾ë§:{=: y39×’Ä:2«Æ:¤„=:ôXî; N©:ï¤:‰êæ9¯ñÿ8Ž²Ž9 €8ËÚÞƺ@1þº“׺§‘ºÄiºê©4»pêºê ¼º–$l¹† Ô:K:‡î:{š:$)i9q¼·ƒ9„¸# 8ãTh9”^¡9© ï9%âw¸ßÓ4¹i ¹‘%H¹Ý¹¤È…¹Ø”ѹägv¹Ö`<¹÷(•ºLãFºžºôÕÿ»-¸»eF.»ŒGS»™Í⻓ »F†»j@`»o¶R»£M»ˆê#»Xû»“öù»Ÿu»§ŠÏ»ž¼»»w¢»É•ºQ7ËÜ¥9‚\8Ýòƒ¸…è8?2è:¡u:¡å; q;R¤;¡£;´)¦;ÓLh;é½»;ô©;óÿ;ïh¥;öy@<L%<šN<Yð<<È<»Ã;ùV;ä®+;Ô6;;Î ;Ú¬ô;ú_<uõ<ÃW<”q< A<;ìv;ɆO;™o³;Xš`;-Þ(;4J2;CIS;3 U:øÙ©:g 9|£9[%¹:£:^—³:ql:mÎÙ:—³q:èÙ ;îW;(ã;Š0:÷Nå:ÆC:Ÿ‚ø:D:h¡:ŽüÒ:ÂÁS:èÏB:ê£ã:Ên:•’Y:=œ—9ûp::¶:‹ˆ]:ç(ª;@Ä;³þ:à}~:UGD9d³Ï8Óá—96•¸D‚¹õJ$ºiÂûº›Óº¼wùºê U» ½6» ÖºÓ xº>¼¶93«:Jv\:wÛ’:D 9ÊàŠ8Ѷ7˜µÙ9h£9š'L9ÃU(9’h‘869¹Uøê¹°¹ÃŒ8¹á÷'ºuGº عýIäºùѺCyºãO>»Òú»:%Í»kN{»%S»–Žã»­™»€ÂC»€ë»ŽCº»œ;þ»¢¶É»£Ãû»¥®P»©¦¶»¦% »ŽX‘»D(ºÇª8ºº¿¸µ¹¹I湵ѹNjz¸N³: Ü3:Ää;&ö;t›Ó;¢Ô¼;É€™;é4²;û¯;þR¡;ö»”;òl—;þ¡< %Å<i<<÷Ü< Ã;û×a;ã+æ;Î…Ê;Ǥ5;ÖõÏ;øST< H<”L<C <å´<Ú­;ôh¼;ÍÆY;žõ¦;v¤;\5ù;]tQ;Ri·;$¾D:¾Í¨:Î9¢æõ:C:ë{:—:‘Ê:Ÿ5:ã;#¸˜;Cÿ};B\o;+P_;â‡:ò½e:ÄN¨:›4L:ÁÌ:®Zf:Õ>ú:âl#:Ïݹ:©^:w; :*â^:²:eÆ4:Å]+;ôó;(†7;B%:²ýx:(58Ì&8‹Ê‹7­Q¹‚PKº'R纀3¹º¦ êºÕ¸Í»œú»="ºúU溎᤹ðÚ:Þ:cy«:VµN:ä9…h8ëÇ%9ô£9’I²9ºÂ‚9¤;©9 ãQ¸¨‰Ë¹¡T.¹øbº ¢KºAt*ºJǧº:ݹº8þºiÚ*º¦;ºõj¯»‰¸»"D»CUW»u˜Ÿ»‘ )»–…»Ž‚³»‹°8»˜n!»¬+»¸u5»¹=~»³ñ¦»¯½»«ZF»œÌ»u=»4¿º Ûnº Ê‹ºäRº)2GºAœ“º u27¯™Õ:aùh:÷³;HÊ;n3;¸7ó;ßØÉ;ü*Ë<DÆ<Ç;óÛ;ñ‚Ê<D(<®w<Ù¥<*<H@< ½Ù;þÝÀ;áøJ;Ê«<;ÄàÃ;ÖýÂ;ùæu<„ª<Ê<–t<Z^< ;ûC;ÓÕ;ªÈ; =;„VS;w)6;O°`; æÚ:”Yd:\²:=ho:–ãs:¹j:·6:´yˆ:âum;"‹õ;Që4;caB;W£”;@©–;){I;{:åš:´[!:ªæ:À1Í:Òa:Íæ:µgƒ:•Ž:gmÜ::}:O©º: Å×:øˆç;!#–;"Ë:î1°:^ß9&ÒJ¸cg{¸|Rí¹.À5¹áÑ°ºA߈º‡†úºµèŸºñvO»±»Yߺ°ÆĹÖ@F9³ã:=ýH:M¬M:%õ„9Ó’ã9{KË9[x9‰¸79›R¶9ˆ“ 93^Ì7¼XÞ¹W›f¹ûÂóºEÊxº‚iº‘²ãºŒ4º„®éº–qºÃ0Ô»—›» aé»,†y»Q¹»„»—f“»™ð¼»—Œ´»¡!»¶´¨»Éȹ»Î÷å»Ç»ºß»°›<»¤gл69»SR¼» ŒÑº®Ñ½ºˆ0Mºˆ¾FºM0º|ìºÄS9‡ü¿:¤^;'¸;l ; ¿ù;ÌBù;ñý<{á<%®;úÛU;ìÿ½;î–p< <ÉV<T"<û¤<c›<Þ<²É;â‚;ʹÌ;ÇM2;Ûû5<~É<O#< < ×4<ä<<²<^Š;Û†;¹b;£&;’ò{;}†;@,Ð:óiY:Be:íŒ9if¬9½U8†?†8åµ”9²%:&÷:?Ž :<´9¨Á9EQ·+o8¹>È6¹ütºsÜUº³¹ºÅ–òº§6õºy ߺJFºt¹X‘9½z{:aÎf:ŽÊB:|þÏ:#4-9´†Ã9‹\Þ9÷9dQû8Ú!¸Ž‚s¹Ø麊•º×FZ»’"»*Àl»7o™»Õ;e~0;zWå;“;˜î;•ï‹;ƒ u;Y ;3Ár;)Yá;µÐ«Ú: 1:‚³Ž:¡,:•s‹:RÎ?9õ’_9¹H9цB9Ò£9žó9L£ñ8/ßN¹£ü¹ºfL—ºÄCA»]h»ªq»%Œä»+}"»<çë»S->»\Jj»Zb’»Y˧»Qáe»75¨»3ã» sºâ]º¢ô]º.cy¹= o9I¶: ±:}¼Z:æÞ/;IIÐ;”';³Äá;ºµ°;µ};³°Â;¼×;ܨ‹;óã±<1<ˆ< r=< Ê7<á;øÞ;åÙÕ;ÖaÍ;Ȧñ;ºçs;¯Ÿ[;­ýƒ;» Ý;Ï<» ¹»»é»Ft»1…q»Bõ»FÌà»DS´»<Äî»#¹±ºú㺾½$ºŽ¾ºzጺ$R¹•v,7ÇM³9¯6*:9×V:²'¹;'ß;‰¤;µü¥;È{;Âøv;¹@,;¹Ü;ÆZ;ÓÐ>;ìþM<›P<¡¦< M¿<.ÿ< ÿÏ<o#;ôŽE;àúÉ;Ð6!;¾Of;«;Wˆ™;_îÖ;{¥c;”½;¯¼[;Çñ);ÖüH;Ù§M;Ów;˪ ;ËCÓ;ÕŸ[;ë«…<ë*<»‡<è< )/;ìçu;Þ;ª(½;™˜;†ÂW;^}>;+WI:ùÙ:¹ÿT:Ÿô:šÍã:›P::  :¤`Ô:›U9:à:FQú:Ë9éë9¬æŸ8¨Õ¹Þ>ñºˆ‚º­ê‹º‡²¤¹ÓU9yRá:`›ï:ÃiH:ýÆC:þôã:Éû®:‚-^:&A‚:0P¤:€Š>:›1—:’Â:}y:oµ:S‘u9í±¤¸î ùº<>ûºž]ïºÃ’wºÔ©ïºê@X»ìx»"ý» 1»ù»yºÇ»§º_bg¹«Ì?¸nÔ7L6¶ Å5 ã«8ëÃ9ÌÀ:^G­:Ù¿Á;G6’;œ[?;ÊF;Û³§;Ô­»;Ǹ:;ò“;Íý;ÚÚa;ód•<Q=<„Î<Ðú<ðz<7®<§É<§ ;ñŒ[;×T;»D;ž?;‰MÉ;† ;”åº;¥­â;§!];”ØR;vÑ?;S\o;I0¢;NÇ|;Q.ò;C-Ô;&Ö¥; ª:òÛŽ:ÿT:;l; ¡“;+o;?7;\ƒò;rÄ°;t†Æ;es;Q‡;@;5½¹;6j%;L„–;y;;;—¬è;®h`;»É¹;Àcñ;¿©¶;¾ð€;ÄL¢;Óx ;íD<g\<É<#˜:<Ë@< Y;æ\Å;À‹2;¬k;žœœ;Œ½b;hcç;0‘É;ss:ÏWb:Àµw:¿T:¿FÖ:¿÷¾:ºÑ²:§_:ˆµ8:UÄI:0<“:!a:  9nýÖ¹¸#(ºgÝÞºu»¹þ?g9pI:I®:½¸n;t";ºÔ;ýI:µµõ:býË:FL$:‹f<:»?[:Å* :°u­:Ÿo:”]š:g…×9ÎÊ0¹G ¾º7o{ºˆ*üºŸo]º³Ö|ºÔ?uºö¤»»ÇóºðL2º¼ýâºWË@¹Oƒe9k»<9×09ÒS9“aÃ9f á9Âsi:H"J:¼¦Š;( ;‡§ò;»—;Ùÿ²;Þ0";Óª];Ê´³;ÌH·;èº^<Û< Ø<]<ï<ï×<Þž<i°<!{;ì€P;Ìs:;«w;Ž™;7&;„ z;•kˆ; °;™áÿ;„|;[R‚;<ýÕ;1Ûd;2h;/½{;{f;êb:ÝZ!:Õ´ :ðt–;øú;¨û;!6‘;;XK;X;ç;fÜá;_UÆ;HR«;.`–;|Ô;þß;%k°;SŽ;‡U*;Ÿdì;ªQ¾;«G’;ªð;¬°;µh;Èé;åá\<è4<òe<)Œ‹<,Ç<Óö<';ÙX.;»®z;­_'; Ìx;Œ¤½;`Tï;%€H:ùG:Ø ð:ÒÄÿ:ÓHm:Ô’%:Õ3‚:Ì;ç:³‘^:’@:n˜=:^Á!:jRŽ:Zã©9í»ñ¹º ž£¹Ñ¤ò8£Ø¬:)–`:ª¤Æ;±;%á<;"ˆ½:ü :¥x:tƒJ:‘@ñ:Êí–:í—J:ä•¿:ÌUA:º£ˆ:ŸÞì:R´´9„蹆LºÎ*ºS)œºz‹0º›Ä ºÀðïºÙs$ºÝƒ©ºÑ‘º°ò¡ºe2}¹ˆI—9›D:/ H:U‰ :?vä:Å: Ði:Q=²:´|Ÿ;iŒ;kø];¦Æ;ÌÝê;Ý)Ù;ÚÖð;ÒÏ—;ÏŠ“;ÖG0;áï;ö’q<}E<#<< e!Êøö=+V=)_!=-v;= •º<ì°<^c<»Þ»¼€‚¤¼ØP„½ ~_½!þ/½#¬4½ sg¼²÷»Ï®Õ<ÁÐ<¼º‹<ép´=}u==8‰=N$‡=SÙ%=G÷¸=#"Ì<ß K<‘nR<~:<žÖ½<ÓúR=HÄ= .E=4ç=C^?=Jqü=HVM=>x=0Ë’=µ»=˜<×Åi<—­<ņ» Ô!¼ƒQŠ¼ð1I½¢:¼üû¼\(œ<&4‘=È=:¾=FŒ=3ÜØ=†á=Ê6=ÈX=Çû=SP=g×<焲<¯Ç=Mt=`^(=^ïL=KZw=9<=9k8=GR=IKa=*bÈ<Ù<<¥ »É*¼”‚¼áf½ èɽW½O­¼Ûw¿¼X–¿:ëó{<‚B\=R}=!ý;=4A8=>Ë=>¶€=,2'= —<°N<‚#<ŽÖ«<ÂÍÔ=•¿=ÔO=+s6=3Ü=4Τ=2;=,\ë=%Gy=ÞÞ=Šò<ö)Ì<Áfl<€œ;¤úA¼ô¼Ççµ½¤J½ዼÈMºçÐ÷<½;=,ÿÐ=O=H†.=0H¬=!Z›=!-Ñ=# ==¯=hl<Ñ ³<Šæñ;ÑØ®»:лþ¼ üÕ¼ Ò¤¼Q$X¼¶UÕ½ $½3ƒÚ½DV½;Qq½u ¼â•ó¼€Õ4»°q:Ô—;¿â<효 ½)ö½ Œ$¼ã ‚¼±ˆŠ¼|œ!¼íÆ»¸â»jSÉ»5ä »qQºò«;È<B1<ƒß<Á;–<ñ‰=iY=Î<åξ<¸cI<’‘<‚<<Œý<¨ßÅ<æ‘<ϳÔ<Ðø<Úçð<üW¤=2='œv=(æ=º•=÷©=,…»=Fв=OFS=0û<ãIn<&³» 7A¼‰‚¼ØÅN½ UÛ½ëû½ü¼æ®Ü¼„Q»—¼Àq³¼rI[»]Xq;þü<‡%<·)O<Ø<òª=r=–Ë<þÞÞ<Ü£9<­Ö²<åâÔ<è1÷<Îø¯<§6ò<ˆFý<ƒ°P<›Ì•<Ãœ®<æ­ã<õaC<ërp<Ê…2<‘F/;ð_q»ÀA¼›´¼à5Ó¼Úȼ}‹8;ZWE<Æ;ž=%á£=AÇŽ=6Ûˆ=˜K=l¦<üßq<÷ Š<ãÔ¥<Á{9<˜•q+A¼\¦Ø¼nÚb¼|Ü󼃷¼|ó[¼K}0»Ã>´;x4|=CµA=GSH=>|=)²= ³î<Ú#<£"Ô<]zI;¼-O»Šżl´ ¼²En¼ËŽü¼Íy¼ÄSa¼³<¼”m‚¼R¡æ»êp»á¬:h:ó;7:P¾å»'z¨»çö¼.eO¼4E»ÞêR:Ç×;?©<¤ÿ@<êp=ùA=Ãç=¯Ç= ÊF<þBß<æqz<ÍM<¬U»<…Ù<ÌÓ:<­Ð®<|Í;ëou»8Ð¥¼I«i¼“Ïy¼Ž¹ó¼!Ø ;3)<ˆ¨<Ýš·<ûv<âx<³G<’¥=<ŠÍ<‹Q<~­ý9;Ëýn<Š•ë<äé°===8Àû=Oqt=_ÿ=eŽW=^Ü=IÞË:®¥C:Ú‚¡:ßMT:Ó°s:ëM;´ú;V;röô;Z5T;3M;(ù:Ô)©:»Èh:³R½:¬Ê:¥“»:M:²/:z»¼:€FÃ:£CÂ:Û¾4;…:øD’: JT9­rÿ¹™1"ºä¢¹ö8¹îr–º Œº0ªºn‡½º§¦ØºàÏ­ºþŽºÖ¼º^¹M¸Pì³9¼HÓ9Ò*G9³5û9¬ß9´¤^9·&r9 Ñg9F†8 ­.¸_¬k·ÍE'·aþZ¹^þãº*Õkº›ùߺ×3´ºòÓºïºnºîã» ?»H·»C`»6øW»3¾W»N¶ÿ»0$»˜q »¤.n»¬µ÷»¾.J»Ö”˜»çð‰»çž»Öß^»¿–黫*r»›q黋°»p†»H%X»)Œh»®»ÆAºë'‹º¶pºKh38Çš½:•Jx;¨­;X+ã;‘);¹dT;àTa;üYÖ<„­;ú>Æ;çP;Ýr~;櫘;þõ¥< ’î<Øü<K<®X<|ê<ßÅ;ì‘;؃;Øœh;ñþv< øü|;-O;Qkb;…Íz;—f;šú;”Ô—;ï¿;„Êþ;imV;:}î; eÄ:Ö Â:³ä:£% :3¯:œæþ:—ÅÊ:‰ø.:€(“:Š¢ :ª :ÊÕ‡:Ê÷:Ž‡9Ÿßó¹ÖôÁºE™ôºM Vº9ìþº.´òº5+­ºT—DºŒ3,º½ç×ºæ £ºÛ°ºWñ¹Ÿ[9&wZ92«¢7·‰G6¿t909–w·9¨´–9JIž¸#h+¹UÞ`¹1µ°·ï(s¸h§‹¹ÜS¯º‡íºØÕÁ»áÜ»g»Ä»œ»-ÿÀ»AÝC»S|ø»HŸ»:r÷»AŒã»eïO»‹V»ž©»ªó »»fS»ÒÏ¥»ç•8»íF3»à<Ö»ÇZD»­ØÒ»›oP»9*»‡%<*6J<%_j<-º< ¿˜;ÿ‚~;çÝ;Ì ¼;«þ_;ˆŒ;Náª;!];‹Ä;j©;%Û; ¨k;(u;4ø;J›~;…a˜;ž|o;¨Dª;¥ü ;ŸnÈ;—º>;‹«´;näì;:ô•; ò4:ÒËu:¬S}:›Vu:˜~G:—¶2:Ž*¤:~d4:qãJ:‚F×:‘Ñ:‘¤õ:Rëó92Tº ‹Iº‚[ º“‘ߺŒ~rº€Óºlñ@ºiš±º‚ÑOº¤Kк˦’ºÖÒ³º© ¡º$öÚ¸ã¸:ó(¹‘§2¹×[Û¹‹vÊ7½B9kˆ¡9LW/¸9¶R¹š‡\¹«§Ì¹Gh7¾/¹3ZºBÔlºÀòˆ»Ò¸»€]»#¹»(qw»8²)»LÚ»S™ê»DÙL»?ËÍ»RSA»xá<»‘4Û»³Äi»Ê/»à[_»êÿ¸»ãaѻ̣G»°û†»›4©»¡7»Žèn»[ž»ŒªÝ»„Àd»mr~»F»ìbºÜîºy}¸¨™:fpè:ê';*ñ ;c|;”6J;¼6g;á s;öxÆ;ö@ó;æõv;×¹x;Ôfö;ßž&;öL„< <Ã<²É<àÜ<±ß<í< /;ùa2;ã$p;å í<…><«¶Å;|·Þ;Ÿ»;¶Õ;¾n;¹4};¯ó¢;¦-;šÝ;‰»@;fZì;5øØ; g:å:Ç´ :¶>7:¢(Ÿ:„]ü:Dôq:oè9Ý×G9¤F8éÙ⹆_,ºF]úº¢ØKºÎ®Mºä±&ºì!.ºèUTºØüNºÃmŸºµCºº¹g¸ºÉ’úºÍ×wº±W9ºz¸º2½ŽºF纉Š“º„6º‚À(º™z¹/º¸Ÿ+깄ÝÖ¹ç}/¹Ë£X¹`7ʳ9¹hŽ†º`¢qºÖÉ;»JB»2l˜»>®»DjÊ»M>­»Tíš»ADS»>D»DWæ»VEc»qï0»‰Ëû»U»³Há»Ê J»Ú:û»ÜZ0»Îª»·»ŸáA»“rb»–BH»¤t¡»³ßµ»º »±?Ç»š$ƒ»vK;»:(» #üº»a º8U8ךr:j=â:Ø,;"¹Ã;gª;dc;Æ|(;ãˆ+;íP;ç©Ã;Ü!;Óyž;Ó#š;ÞÄ_;ö—·< ?ž<éϖʺ-¢º´ác» '»+Òô»>:лDLt»F"3»G”c»F;Š».Q…»1Hc»<õB»P»ú»j¶»„'Ý»–YÖ»«â£»ÂRÀ»Ó¢»Øùè»Ï›Õ»»z>»¥Ì×»˜õä»›a3»«…N»¿ý†»Ì”»ÈÔù»³Óô»” »g1”»3ÐÚ» Áٺ˸غ[D¼·»Çò:Vdþ:ß ÿ;2â;€ö½;« ;Τ;ãhŒ;çõW;â.”;Ù‡ã;Ó‡³;ÕŽ;äeg;ÿ>æ<aÐ<<$ô‡<#P<„ö<ýš;â“z;Ï_Õ;Ó ;ä±G;öŽ ;ÿ[~;üÁñ;ñò;äW;Ô½;Á&t;¦ûr;Š—R;j?X;X¸¸;Z~;\šÝ;VÑ);R>X;`u“;„ .;žþ•;¶ L;Â-á;¿óL;µ?·;¨ø ;ž¶f;– U;Œ;|Þº;[Ú;=FŒ;'‚ö;/›;§Ä:ج«:”¬:A%9%)6¹’¹º_Wº}êºbq º—ô¹º¼“œºáÀ[»6ˆ»%Ø»*Óž»*Ù0»Š» ‡i»¨»ôœ»¦»Ä¥ºìm²ºÖWøºÖ¹eºëþpºø[κݗÀºœüIº0¤Ö¹Êœb¹ÃQ&¹å¯º¹Ïh¹’蹤 ªº*”(º¢ÇƒºùžU»! S»8ÕÆ»@ÂÄ»=Ð:»7!|»1EC»+ã»0†b»KÇa»jS$»„õÿ»–ƒÂ»ªûŒ»À¤G»ÒX”»ÙöÕ»ÔNc»Ã¹°»¯È¹»¢V?»¢îª»²0Ü»ÈK‰»Øº|»Ù=S»Ç@»¨«3»ˆ+¾»]1¨»:r­»‹ºé.ºLT¸ ¸é:ªŒ;Þ;Tª‚;“ë;¸(Ä;Ò’œ;ß7ö;àÚh;ÜÞé;׬ê;Õ¼Œ;Ý>;ñ‰€<Љ<gT<# ;<&õ§< ®><Ú”;ùd;Ø f;Èøß;ËxÛ;Ö˜Î;ਹ;ãâû;Þ÷k;Ô4Ë;ÆÕ™;·lj;¤3Í;é@;u(‚;b§¨;fšV;tCy:ÎÍ:´šÿ:¶÷z:ÂI:Òæï:æ|:ðF:âåa:À¦î:£¡:¦J€:ÊŸš:è«:Ò<’:ŠŸÿ:Ò‡9íÆÂ:1“§:‡¡:ä5š;$„;Gý9;EÅ=; •–:ç:¸dé:Êý:ÿ S;.,;Îá;4:ëÄB:¾.:yNß9ß–?8Žå¹<¢)¹’1\¹Ùcjº0·ûºzLݺ—rºŽ—Lº†eºi~º³¸”T,:@Õ:”ùÅ:È<:ÐG€:¹Ž:®¥¼:Ô\+;[Î;Q¶û;‰rŒ;¨w‡;À.ç;ÍSƒ;Òo";ÔšM;×—;ߣ;éà¦;úsø<`!<6L<{Ð<üD< 8Î<@<*©<hâ;àÁ;¾ÿ;¡u!;‹’Ý;„7Â;Œ8Ý;—²;;–V\;ƒ‘;K™¾;-:Æu‹:˜mŸ:—Õ: Im:‘‚í:Z©¯:%gœ:&©}:FŸ©:enû:ƒ,:ŸE:ÍêÒ;";1Â; —Ê:ÙiE:Œƒå:T ò:ŸPh;¤1;}p™;¡Ú^;¨LË;™ZW;ˆ*P;›;ˆ¢±;ž¹*;Åâ;ú4<¹³<*â·:Ýÿ—;ø";Lg;\ij;G´;Óì:éÔH:ÔÞ :ôÆ;s¤;Å;צ;ôp:èOj:©lb:D8Æ9}8ý¸› ¹"¤¹³@º"9ºWºÜºcêºZšÁºQggº/깩/9„H_:x}:Îæ—:ý­:ûô:è³’:õ¨Ë;ðu;TaÚ;†ú;Ÿs;±áx;¾Ñ‘;Ç‚(;άß;Õ¸_;Ýä~;ôqn<¬w<™Y<ŽK<a’<Ã_<ÂÂ<Þ<+Ì;èf;ÊÅ•;±!;š³Œ;Œ@±;‹‡ñ;”wÌ;—î;Š#i;[G€;.ý:» K:P²ó:¯:â´:!Ñä9ê|L9j™9‰C9Vð{9œ6S9¿ø!9öú::[j:–Ô:Öƒ:ó½:Ð <:€`q9ûfÖ:TÒ:ÂAn;Gn›;“ñ‡;©¢(;¡­D;ŒÈS;y÷ ;soF;„÷‘;¢%-;Ѽ<%Ô<AÄ<(Ÿv<"·˜<[Z;ê;;Á‡t;©Xe;šƒ¯;ˆb2;V•v;ºî:¤Gô:IèÇ:3È:PVe:€•Ä:Ÿ|©:Áø§:Ü:Ýkt:ÆGª:³G:ÊDr;ëÞ;'£®;*¬b; CC:ÑH:«C$:³“:å{|;\Ø;LüÓ;jeX;e";A¼-;ìh:ó&¦:îªÍ;œ±;Z;;òÆ; ,K:Ýêå:•/—:#6î9Œpß8ÃË7›Ãz¸ÅṦÎ'ºG8º0½ºº2g¸º4ÌWº4y5ºÒX¸˜ýF:Õi:±¨x;|;7Œ; ¦¶; 7);$B;U̼;†ê; ;«dº;´y;»±Š;Ãëq;Íù¬;Ù+$;åÔ!;ì±4;ûf< í<ƨ< =<ô½< ²<<¯Ÿ;èž;Îf`;º…;¨8Ç;˜µ;Ž ;’3P;—"ì;ÆY;n}c;)Æ–:Çþ˜:)B8ùu^·Ú€Ð¶Ì˜²¸?¹ƒ§¹Á`i¹´Ùý¹‹?†¹o‹|¹b—z¸ç8u9pÛ·:R›‘:®':º$G:ûó9Ëe9 ?:/Ò;XN;py5;h;£|_;’Ýà;|‰Á;cöø;cèƒ;ìF;¦@;ÚíÈ<©»<ØÆ<<úÐ;ðiÂ;Å·!;©˜ƒ;™Æá;‹-à;fïb;#t :¿:G^ÿ9ÿ¿„:[:#ƒ,:V¦:Š%ö:©°=:¼:¸Ç­:ªÝ:µõ¨:ñóÑ;$ *;>‚;5X;ËŸ:êxÿ:×H˜:õT¥;(A;Mí«;r2å;y´Ú;b‘;8à‹;D:ûk::ý_H; f;ÚÁ;$H¡;!Íã;*\:Øaæ:$Ú:©è9¡úö91ò¿8²#z¸Œ¼ù¹š‰Á¹û£hºŸ©ºÅñº-Ô£º&Ôh¹¹áº9^Â:z ¬:ÝC%;Ä;Ÿ;zÅ;%(Š;O4;„N};œ±ò;«á;±nE;´ìù;¹Ç};ÂQ‚;ÎjÏ;Üö­;ïÿ;úÍ<Óä<çõ<‹¤< š<“;ûNþ;âñ;Êvð;ºPè;®ßø;¢u;–«n;’n–;•#ü;’ï;Ã;Aol:ê¾:9ºt¸Í&~ºº!cRº--ùºLȺk] ºkˆæºVžÍºKëºUK!ºX¡Kº&,œ¸øØ:}V:†K:t’'9ଋ·—|8Ð/:‡Ãí;'tç;à;—yž;’7|;û;^‡í;M?X;Sž9;}Œ;¨ ;ÝÀ<ª²<qm< ,¯;óå;ËÚ­;­¨J;œÀÅ;‘±ž;Œˆ;MN_; &G:£yt:9ÅÙ9ú±9â)l:_‡:%&:VO«:ƒœt:Å´:öÏ:™)":ÆÔ;|;7ÉÉ;F›Ô;5š;U;œÆ;ý*;!…¨;M¦[;u¦ñ;ƒ;y];WbŸ;.ÉÂ;/W:ýÅM;uT;ˆÜ;$xš;2uy;.Ú?;4Y:áG:”¢y:0g9ËÜ<9ƒêD9‚#¸繃Fݹխ0º£¦ºòíº1Yœºrr¹ .v:S:¢Gq:ót;j0;‚.;é;? ˆ;v£;—â;©ß;²¤;³ýÆ;´uó;·•[;¿Ò*;ÍgL;Þx_;ÛŠ ;ê®±;òóÿ;ö®Î;úAJ;ý¨;ù¬«;ì';ÖÇ;ÁT½;³F|;¬ü;¦Fõ;œ¶º;”Ýb;“»;“Ð÷;‰ç;[ÿ;,x:yS{¸Àx&ºI်ŒØpº›c’º©y³º¹¤º½^ÿº´2麫¸º¯²{º¹·>º²„'º¨¹ 9ÅÀ®:+R¦9ÚY5·ÿa¹T›j9¤Ø:»º6;9Nî;z†q;…ÿÅ;y:>;[U¯;BŠÏ;6d»;Bp;tDî;¤ÿ;Õ;÷ë'<K;ï.<;З^;´»â;£ÝÙ;›‹r;’â·;ƾ;N?!;´¬:ÀPý:r ‚:3K9Ò2W9º«z9Û4O:Ùz::‚é:W@:rI”:›(¯:ár7;׈;>ôê;CÇô;0à;;»Í;$F{;JkV;s›;…Œ^;ƒÈ;;n'";IÐ;%];; Z›:þjý;*;zš;8p–;I}Ý;C 0;%ÂË:ø»Z:¥Ëp:J{è9ýÐv9³´D9_H7±ªX¹B€¹¸˜Kº\äº"²º ™K¹ºí¯99Û:INÖ:µ„¼:ñ¹Ê;ô;A\;(mÌ;Ws´;‰ ;¡R1;¯%7;³» ;²Î;°¨W;±ô;ºæ;ÉDá;Ó£—;ßÒ©;äîÒ;æ”;çaÃ;äÆÞ;Ú @;É Ø;µÈ;¨==;£B;¡’ú;>è;–©h;“d¾;“”;ŽÇ;s?E;+Ãð:«Ð-8»²ÅºT9$º¬ѺÉãºÝ+ܺñǺý{`ºûJ‹ºò mºòWºû4ºýû"ºß¥¯º”˜M¹Í®E9V-9eÀ¸”œ¹¸¾¹q|:GÝ:ØqÔ;5;^`Æ;c™Ò;SÌ;=ìä;)$a;†a;.ŸÒ;d_I;š·õ;ÂSh;ÙöŠ;ÛUº;Ì;l;¹A§;¬Q;§"„;¤fí;œ›;‹Xµ;d3•;,?·:ïü|:˜OE:.¥(9ÀfÆ9‚Áã9’ôÊ9ÙE/:Úä:CÀ8:}˜:²úÔ;_–;(7a;?ô{;@KÆ;1±w;%€;+`;Fza;lE;„$×;†°Ä;};`Aò;??; Û; ¤Â;q ;Ö•;5N];Wº#;h“Ð;]‡þ;:0¢; 7©:¶›Ä:c­;::ý9ì°ì9£ñ8ö;¸´ad¹¯¹àß”ºø9¹Ò±ü¸¡ýØ9ÑøÒ:rÊC:¶É:à™f:úõÉ;“…;3û÷;iI;bà;£ $;­A7;¯-&;«~;§9 ;¨ÿ;±o`;•;¸ö«;ÈÐ;ЖG;ÓC¦;ÓKQ;Ñs;ɧb;»»ñ;ª¼Ú;œÿù;–Ëc;–ƒ(;–˜Y;”E;’>Ù;’Œÿ;òq;à;CqD:܇]9¾ =º3Ù¼º¯pCºÛ¤ïº÷xR»  Ã»¸»&¼»ÌC»ºr»¾Õ»¼»w ºëƺ‘ä¹ôòê¹$c¹z¡º¥þºø¦¹c: Óè:Ù%1;$Ë ;AŠT;Ek¤;:c;%w¸; í›;Ý.;wÇ;L3E;‰,B;§;¶’;¸S;²ì;¯Qµ;°1!;²óJ;²B—;©Šà;—vÍ;|/ä;B¬;ÆÊ:©Ó:?4N9Õ 9ŸMN9ÂrV:$ :Cõ´:~B:¦šÒ:áö;š¤;4Æ#;EõG;E¾s;<ÇÀ;9ű;G¤F;d Û;Ö#;…þO;‚®;r6);Xò_;=ŒV;$¨¯;oÅ;_î;1ÕÛ;ZS®;~‰;…˜ú;x};KÔ6;Jý:À ½:ysL:9ºÄ:ß›9ð¼è9”cÎ8Éθ¢Çg¹Xj7¹k¥¸ª.+9[?:k/:€4ë:¬Ï›:έ :ðu^;o;=wz;nÞ;“ß;n;¤5;£}§;ó6;™£8;œx~;¨.;° ;» †;À);Á;¿¨ ;ºêN;°Ú•;¢œë;”ÃÍ;ŒN;‰—;Š®Ü;‹ÿQ;6˜;x;ŽHý;ƒ;P3+:ÿˆ_:!ɪº º tºÔ¦ºö±@» >d» ¡ø»0,»86»:b¿»:æý»9 F».Ê­»£ºÜºº‡Juº(º´òº4díº`­;-J:×~/:ÆŒf:÷x;-´?;e7­;ˆD;”ý^;@9;¥½ ;°ú;¹Íõ;¿7&;¼ßç;±A–;œê;éÇ=*By=Ìâ<Ì]<”øþ<ù"=J[=5ˆ=?eÂ=;eé=,j=iA<ù.Æ<Å û<™ûü¼*X‰ºÂ`< ÑH<¢œE<ú˜É=¢Ë=,ñ‡=,#U=Â9= ±7<ì°Í<¼äb™¼Y¼fåh¼Yý¼-§Ä»ÂO :Lɨ<£á<£uG<ü‘H='OÆ=If=cÔÀ=uäž=|€D=síB=[¾ =8*=1¾<Õ¶¦<—bú<@j;“µS»bè1¼/s'¼€•é¼”k¼•Í弃f¼8?—»¨;?o<»Ö= Í=-ó=>#„=<ý =-µ=<è[D<«”½=e½Gºå½IÑè½C 0½1⽡޼á)¼ˆ»q ì<-C¼<Ë›=/À=7Û=DÒf=>cX='0= <©C<‹/U=Ž´=…5:=d#…=-^<Û G<4s»{Îy¼ˆá†¼ÙuŒ½ÒĽv!¼Ñw|¼€©p» þ;ž œ=v4<í²µ<¸Hõ<„w<åÊ:<…¼E̼—>˜¼Í3¼ì€$¼ÿda½ CI½½e½_½ƒœ½¦9½å3½ +½  ½`½ƒ¿½æ½ z¼ÊÜ,¼J³º…iÙ<-Ýý<°à6<ø(=…`=%Ž<ù&A<¿ÚŽ<Špº.»þq»„yïºV“:¯l;X"è;ˆ‰D;]2û:R˺©q»Uþ»Ÿ·Ä»Þ\ë¼ ö ¼»[Gä;³ð^<ˆ §<ßió=C=,À=FÁ=cú=‚Zµ=‘°!=š¬=—Ò‡=…²#=Igé<ãÖ;Œ‹¼” ½–E½A¥¬½Ihü½-Q¼ó?æ¼xmKºÍQï<@›<Ôú<¹9o<Þú =Â= O=9›æ=NG =[Ÿ%=]¹Ù=SFV=B+A=2_ë=$Ðù=äc<÷ƒR<»™…;Ë{õ;Ìù%;ÈÐe;¾Ø†;±ƒ©;£@;”:/;„‰Q;oÓº;h·;v¤Ò;‡àÿ;’Ö$;š£;£k°;°8Ó;¾$;Æt&;ÄO§;¸£;¨ü&;šÆq;4;ˆ¼ì;‚^ ;u™*;c{Ê;S+ê;GÊâ;;ñ:;%¨;•:¤rø:ÄÁ8-G¹¨øº¢ëºY¥Šº‡?$ºš¸º±=šºÝŒ(»Ét»:äp»V\Ø»[ž#»PÚr»ENÛ»B‰•»FB„»HQ»C7л8л0§M».ãp»+Ü­»g²ºæ8º‹Þ?ºÂE¹»÷¹Ä¶sºµâº9ÐÔºˆãºÂ‘.»àì»T»4Ô«»>Du»7&¿»$g&»(ë» NT»%sÚ»I»ujÌ»¦Št»»uûЪ»àƒL»çïä»ãý»ÖJ8»ÆZ—»½d»À隻Хœ»á€»å¾D»Ö‡ö»¸üj»š<õ»…†¥»xB»iå$»Kj‡»ð_º‰Ù 9œ¿ù:ÙÛ%;A6´;…Þ¢;£ƒ0;·òI;Ä Ç;Ìï ;ÓH;ÙWÊ;âó3;ôô¿<´h<¬º<›â:n¹>9²ÿ›¸°sF¹Ý·Æº=Ýÿº|Œƒº‘»¡º¤Ó­ºÏ!U»¼»<8"»_e»lRâ»iZ»eŽ¿»h»nK»o·»gžB»[–>»QÚ[»JÞq»;ÖÓ»,ºËZ;ºOrѹ¨Ö’¹\©¾¹Ãweº:Ökº˜$<º×—f» ä®»%Æ»;]Ñ»FÉØ»A}»-yh»šd»“¢»E©]»hôλŠ\y» MÒ»´Ü»ÈŽ»ÚÍ)»èUV»íBÈ»èVú»Ü¡|»ÑL»Í -»Õ€Ù»âƒÐ»ç©“»Û9^»¿xA»¡\j»ßƒ»‡Z„»„t»qB»;éúַֹK&ù:¤1ð;&äá;lJ·;zÛ;£÷Ù;³²»;Â';ÏF~;Ü3X;ì-¯< ×< —i<°@<…6< k< a¨<j ;ê"¼;ÛÔ[;ÔUµ;Î Í;ij;¶ôó;¥Go;’5Ì;‚f;rd&;kç—;nL;|9;sŸ;£.\;¸¾X;Èî0;ÒÙ;מ;Ô³õ;ÊØ?;»œu;«ƒƒ;œe;‘Í×;‡æ;y¥ó;fQ;Tì;H ì;? «;2°Œ;':ñ Û:¤\Œ:=¢Í9Žñǹ#ǺiAºg(ºŽ£Ãº¢µ*ºÉÔQ» :ˆ»9›Ž»`® »tn)»{6Ñ»^»†¹Ø»‹+»ŠÑú»…Y.»{vM»m b»]I`»=á!» º”¯@¹ºïù7i縥ý¹úMºŠÇHºØÆK»8<»+WO»E3лVÛ¨»X%»Ih¦»7ü9»4/¨»t»‡ÏK»˜þq»ª“”»»Y–»Ë¤»Û@+»çÕ¨»îó»ì6"»äày»Þf¹»ß &»æe¸»ë#Ì»â5E»ÉÈ#»¬‡»˜“€»’·E»’œ|»ŠçF»fÔ<»¼º_ :,È;iz;CìÔ;ugí;}h;¤OÌ;¹{×;Í:;ßDÂ;ó*a<¾<Š›<5,<É*<sÁ;ûºG;ê“1;â)/;àk;Ý;ÓSQ;Ám;©æ;´Š;zÃ-;hè¶;ië};u±;…;–S;­aJ;ÄàS;Õ´};Ý‚;Û©Ú;ÒÇã;Ĺ‚;µnA;¨:N;‚;‘žt;…JŽ;qúB;[¸f;Iï_;=;0D2;ñç;½n:Ç•:Rè:1L9\Ÿ¹ â˜ºK>źŽÏñº©š;fšw;„»%;¸#;•Ax;’ål;Ž ü;b;“¯0;¡ þ;£æ¹;­ß;±º;±š4;¯ö';«¼;¡LŸ;”5ù;‡Ûj;ò;zéÌ;}lŸ;‚Ï;†!;‡‹;~gJ;N%A;4‚:+S ¹í}‡º—õˆºÉTåºìž » ÚT»%q»<“£»Lè»Sd¾»Sý¡»Mê»;3»æºæÃlº›«æºdȺeGк‹Ãºœ¸4º†YѹäÀô9ú :¼iÄ; §;$ Ÿ; Ë;ud:¿à+:‰âÜ:ŽÈL:Ï°;¢;?ÀÖ;aê˜;IÞ;“ÚÇ;§•l;¸Mt;ÁÆ/;Á‡¥;·)€;£Ú¾;‰Î;X};j :äHí:­9Þ:™Xi: È:¶¯“:Ôdè:õŸ; ã?;$Áç;?;XÚ/;kË ;roŸ;n V;gí½;j e;uU&;€ö[;„‰;…Mn;„,;€^¨;rKc;_?¼;P—^;Rë@;lð;‹-2;œæd; »ë;‘ê®;há<;%ÍA:á ­:¥â­:a{:‰½U:á :jU…:Kn):*hâ: „9܆‰9Ç›q9î:+ÎZ:w°é:¥ùÕ:Ò×;^A;Lï;“;i É;A¾å:÷ Î:#£Ã¹ëH®º’Æýº¿£ ºá„½»û!»%8}»Avª»Vñº»c&$»dÄk»Z.¶»B_»pBºñIjº³)º˜¿º£¬ªº¿.´ºÊÍݺ¨É¨ºF9Ò¡Û:´zœ;3;.¸:ý=:°y:M:Ùz:h»Y:Àw_;­Ä;+Ð;Pv×;}…A;—;«à…;¸z£;º}ì;±ÙU; Cˆ;ˆ”Ú;\ñT;,ËÐ; `€:î…ë:éü=:ú; Ú»;ç/;*¦;?ĉ;W]È;o(š; w;‡#‡;†è;¸;{E°;{ A;€¹X;„ñû;‰ž?;Žcä;ë ;ŽV;…}ñ;väŽ;oXä;–q;‘“ ;¢¹";§ ‡;˜¤Ò;v=;3¸g; Õ:Ç÷:³“î:¬Ë^:¥f¯:š»:O1:uÐ:?˜H:’Š9¿Cw9Õ׊:)ki:ƒbi:´¸þ:áHt;ÙÃ;­¬;5b`;RJ&;iÕ;tâ;wó˜;~Ê¥;‡r¾;’ß;œ&K; s ; Ô7;žÝ›;›`";•s7;‹Üè;~J;b¿¥;LÖR;AØ€;BžË;H«w;E¨c;)sú:ÝÏÊ:s¹ü„º•„̺ÁÚüºãÐu» f¬»&¶»»CY§»[]»jë:»oæ»cóß»J9q»'¼è»ŽÍºÚ­©ºËT"ºÚÃéºóùŽºöT4ºÄº•º2ôÂ9¼¼H:¥:âÿÊ:Û¿:?È:#x9¥b²9ýºå:„€Q:ÔÀ;ª;1JÍ;Z ô;ƒS^;—]·;¤ïž;©e0;£çj;•À;‚ ;Z! ;5Ä{;D¿;±w;G;(sÝ;6);E]¢;X`³;nð–;‚òb;ŒÝŽ;“d;”–;Of;‰¯Ë;„ÝÚ;ƒµp;†!û;Œ@¯;•n:;ç; ú;™5Þ;&z;„Û;‡ú-;•ðH;¥5;¨ï+;›ß;~vŒ;ANç;ž×:ð›`:×W;:ÇŠ:¸g:«³:®:„Ѐ: 6;MÒf;\’–;l&ð;p~;Šm(;”—;›0ù;žMG;œnþ;–Ð;´w;Š®±;‰U;…;—ÎT;¤Bœ;«+é;§¾;š‘~;M;Ž„;˜Ûî;¥XŒ;¨Ô;›9È;‚¾Ž;Q:ç;(äD;:ó³±:Ïf:²(²:¡©œ:“y­:lÃI:w9ŠÿÝ9oW3:ïê:|ép:¹Óð:ä7`;e!;˜S;1_A;RÏ;lÜ€;~ø&;†ù9;5;—Pr;¤d;r;™¤™;“™;‹s±;i’;i-;G÷¹;" ð; :Ó¾z:¼ÌÍ:£Ôµ:XµR8èøº=™åºº–Áºù¦ë»Šu».xŸ»E02»VG°»eü]»x$±»ƒ𻂴»tí=»]œe»H>»»8qç»/ýÆ»/&­».°„»CúëÂÿºfÖ‰·§Ø[9÷ Ø: H9šÁ›8·st9<4³:,ëJ:´J­;uš;+Æ;B¤;Q9>;]+Ÿ;iõ½;u™W;yÞê;rê>;c8-;Qd;C;Æ;?‡-;H¹¶;[Ú;n8;~÷;†ŽÍ;Ž×Í;–ö};€R;¡Å5;¢ÿ€; œ2;›Uz;”Üb;ˆ4;Žùé;–DZ;£<‘;­{`;¬ëÆ;¡ñ(;•ÿ€;“"í;šÅÜ;¤«=;¦1ø;šÈë;† ¢;cQ;@4; ¼":ÿe:¿–A:•Ô<:†MÍ:v|:;žq9Òr¬9uY~9ËÕc:XK}:°§À:èó;Ël;rï;:*;\? ;z};‡ÚB;_‡;•Óÿ;›[;};›.;–¾Ë;c;„Œé;olœ;O•ú;'l:ñÛ®:žC :EÉP9ìÐÁ9¾Ÿ¹Æg캊o6ºåDË»…õ»7l»QÄO»d>´»mtR»v…”»„(»Ž;Æ»’$»¸º»…T³»z!¹»jù¸»]®…»T&†»I[×»0Í»N«º‘µ¹ÜœË¸©ä·ÂÂ|¸‘8çVr:kÍ:£éï;Ä_;.d;D…;I};;G'ƒ;HBj;O[N;V½ƒ;X§;;TÑg;N¤Ê;JßÀ;OS;_r±;wW;†Š;Ž`{;”*g;™ƒ;)–; ƒŸ;£t;¥)³;¤7 ;Ÿ± ;˜cI;’Wú;“^&;œÙ;;§Ý–;ª°Ö;¢û[;˜®Æ;•µÞ;›Ôó;£™ï;¤/;šJ|;Š”:;tlq;S-³;*l~:óM:œÖ:]õ¾:PÐÜ:Hþ:)c9È’›9Ú {:J›ô:­÷:ó’X;D°;/åÒ;MX¢;n|¥;†;jp;–¬;š£0;œáé;šé¸;™% ;•/;Œ¹Ö;€<;_©|;6¬;‡e:–Ý;9Éÿ}¹@Æ/ºòº‡ÀºÏýð»Â»<ô»aî»|%+»…»…çõ»‡v»7®»?컥0»£óó»°Ë»–¸F»Žö\»…þ=»yô#»dŒ~»Aäp» ©º¸¢ÃºW㿹ý¹‰½¶Ìý9Ô/„:…Èó:éž;#ª;?´^;Ecê;={y;6¿r;8Î;>QY;DºÖ;IûJ;N°3;U;bAg;yh3;Š£±;•Õ;›í—;ž?ÿ;ž¿“;ŸW; õa;¤Æ€;¨f5;¨Qx;¢>i;˜yã;’43;•Ç;³;¢¥R;žå;—Ôj;–KZ;œø;¢nÁ;¢y;™ÈÎ;;€<;\;&õ:Ð:ì:^¿::ñ®:-$\:7Žt:’7:3:Sbe:¬uµ:ûAÓ;!â\;Aþ/;aM€;€ì;'N;•®<;™á½;›u’;›¦ï;—@‡;—t_;•"™;);}þ;SÃV;-:ºÜj9Ó9¹ÿ_º˜ó’ºßk»®Ÿ»;2ß»g'»‡:ô»”¡/»™.“»–Ü4»–§»žáN»®Zz»¹\»¹éÝ»´z»­E¿»¥nÁ»›/Ë»ŽÝŠ»~”»SZz»“ˆºØ¥¡ºŠK¹ºˆ¹Ylá9NÌÙ:6>…:°Aì;Yÿ;,I;;Tˆ;8;2ö;0z;3Ðë;:…˜;Dî6;Rxg;c#;y‘+;‹“Ð;š7«;£…Ú;¦æ;¤«;¡`; ;£F;©0;­±;«SÐ;¡' ;•'›;·;“”&;˜qE;—üÃ;”:;•74;›‡+;¡eŒ; £×;™;‹;ŽÒÁ;~n;W±×;*û:ŸÓH:‹L9öÞ+:/È+:J˜É:I¦Ï:m¼¿:¬{R:ù¯;%Oš;JªÞ;lDK;„Ÿ;w›;•žm;—¦!;—„Ç;—±;’I7;•îä;–œ¶;›Æ;}n‹;Ha<;´f:Mã¹ÑèQº·[L»ö·»9ªÞ»c¬Ü»‡þ®»œ^㻩们tK»§Þÿ»¥ª¤»® j»¿Ý=»Ìƻ͛£»ÆŽ »¾°†»¶âþ»¬mé»À…»‰³»_‚7»%½ãºßõ꺆k¹ýø^¸¬ 9¦æ:Q»I:½•é; °†;%æÿ;0p€;2Éu;4wk;6žÝ;;y‘;GD;Z¿N;tU³;‰Î€;šœU;§ºU;¬òt;ªôÀ;¥÷Ý;¢R;£#ã;©[;°pá;²Ï;«kÌ;;;‘ ó;·ú;î°;ú;;ac;“};šoÆ; ¢‚;Ÿï&;˜™|;¿6;{ÓÐ;F…Þ:øfó:^ý‹9È®¢:mG:Sºæ:yˆ¼¾@¼Ã·ô¼ÊY¼Ë¢Ï¼Ä.™¼¸O¼°ùv¼µ8„¼Âuà¼Ê3Z¼¼³÷¼–Ót¼;Ù»§¼J;]äDô¢:ÅJ„9åॺ+Dâ»!Ð@»«ßŠ¼_ʼ 4ë»×bs»*oç:ÛÀú;¤2C;ßPÛ;è,;Ô³ù;Ĥõ;Àsâ;¯ÉË;vg:Ó4Y:`XÄ;o>Z<2Ö<¯-â=D=/š=Oëþ=k=‚gC=Œ·R=¥ø=‰=dï½="o<æ>;öl˜9ê·ð»›´!¼Å&¼G³¼h愼lxœ¼YŠ<¼?F¼(¡~¼H¼ Ƽ3Y¼O W¼fc=¼kM¼Y…·¼z]»ã±½º…¾;;Ú¼¥»{»¤¢Ï»°H/»Mï"·…Ó;;7È;jÍ:`p±º’¤§»O¹$»«­»íIÓ»ï~v¼Ñл¸£º×F:¨à:ûQ:„Ü[º V»0,»´Ä_¼ë.¼™¼6¤¼$0û¼0e{¼=䓼B¦œ¼=Õؼ8fà¼8 é¼6â¾¼'j7»öÆõ»2 8;n(Ù<(»Ó<…Ô&<¯Ñ"<Ô0%<÷xk=Û›="ù =4~ =?œ=?±ª=5W@=ä<öË–<¾ :ÅÇé¼qÕ ¼Ñ0 ¼Óaš¼ocV;ˆûä<ÃÂ6=.˜=8~=:Ey=//î=qc= öè<÷^&<Ó†<±”<“€$<‹öN<–q<ž‘<Œ³êT<Î5±<±ÔÛ<ˆ+Ò;J<'íî¼CM»þ¬´»ü3˜»ñò»ØM~»¨}Ä»F“ƒº;Ñ:˜Šý;á£;M›‹;Â;žæÀ;»ô^;Ô3D;ä‰;éÌí;ã~+;׸×;Ðæk;Ôï±;ÞŽf;âN;Ùh€;ÈÔË;·už;¨ ê;›@=;“,¶;â¬;‘qT;2%;†Q;pçŸ;_‚­;iŽÇ;†É;˜&Ð;Ÿl±;—*Ì;€¨Ù;Að›;qi:¤É™:jùÜ::vÞ9ñüR8˜¹Õ@ºxPhºÉÀ» 0k»2fE»YÒ»€iÀ»ŒŒ„»ˆP»gsÆ»2Æ?»h'º¶ðǺQ÷¼¹Ìõÿ¹ÉfºUþ¨ºÈ§(»Ðù»A3N»]Òá»lp»píö»q^•»WFâ»g…i»„Ö⻢<ÿ»Ê'@»ò›*¼gp¼ ni¼ d˜¼r ¼CǼἆ¼å\»ùšX»Þ®»­»Pnݺ^ó-:‘­”;ð;Rו;„'Q;£šD;ª ;ÚYh;æ²;ä!;×`;É¡Ÿ;Åþ ;ÎZˆ;Ø˹;Ú C;ÏЗ;¾‰s;ªŸ;•ð“;‡,;€·>;€#;{×;j;b;R «;J8;bC’;‡‹n;˜ÐÀ;™Ö;†ŽÝ;O; GÎ:ªß:_ød:0:£9CéÓ¹ÛHº`pºÈ¥D»Ö}»>¸»eF»€5»ƒ_F»mwº»>g» kzºÍP·ºŽáº?’º+@ÞºsJ8º½ÿÞ»}»(øu»B »Næw»QÊž»Qú·»KÄ»igлÐQ»·µã»åüÁp¼ Á?¼ ½/¼n»ýŒa»üf·¼g–¼‹»ýø»á*E»¯Šl»Xº„i:ƒAé;Ô­;Z6´;Š§õ;¬m@;˧;ß5S;âߥ;Ø7;ÆŽ…;ºú;½Üí;ÊÂs;Ô”Y;Ò_;ÃÄó;¬M•;‘ÑZ;yž;e½«;cv;a±;QÒ^;?0.;AËk;d;ˆ/.;‘÷†;†Šu;TWµ;*°:­Ø:UNÈ:  9ýÉÃ9`­½¹‚Kïºck9ºÒ0-»˜D»Lò»p-†»€E»w€w»SS»"fºì£º©‘*ºv–dºU¸Çº€—Zº±ÛŸºìû¸a»(•»6ÝÛ»<>ê»?±†»M¬‚»x÷»ŸH]»ÍÒß»û#¸¼ ZÙ¼ ›9¼uõ»ü5Ï»ø¶ »ÿòh¼Oò»ÿ »â¯»°“ƒ»^Ønºœâ{:Uë;ˆ;a)©;“E_;·³3;ÔÛÅ;á.;ÚÝÚ;È~;¶DÛ;°Ø<;ºÚæ;ɲÒ;ϳf;Æ[;®à;ø;m·²;Tú©;RÝÿ;Rñº;Gm°;;`»;EÇ+;h÷;ƒU,;€d ;R*·;Ò:ª5U:CAQ:è¬9ÑN³94ƒ¹¨Ötº}Aúâž»&2x»VÑR»x)`»€I»l»AVL»¯½ºÎ‚/º’¢ºi4ÔºwǺŸeºË‡ºøXd»»$ã»/?å»9-W»Vî<»…©»»®7H»ßļä)¼ c¼¨{¼{C»ù»ýÄ®¼K•»þ Ù»ážÑ»°ú³»eRZº¹Z:Y†;‰G;döq;›ì*;Âà·;Ü 4;ßYƒ;Ïò1;¹ˆž;ªÜ=;­ª;»y;Çœ";Å4;°Ûô;‘çE;l5;Q ;OµÉ;RB;J};;CMð;N[;e±;j¹;I}2; Âr:¡¬à:(I9ʧF9†%!6“R¹õ¦¨º‘):ºñ<»+à:»[ª»zÒû}yœ»bB»3Çâ»­º³@oº{¬º_ oº„Gº¨]ºÐb˜ºýuz»Œ¸»(AI»:»`œ »}»¸Gú»çåǼ)å¼ º¼—8»þå;»ÿm¦¼†»ýœD»áÄ7»² >»l˺Ø/í9„:ÿ0ƒ;d5š;¢²è;Ë~©;ß„;ÚVî;IJË;®w²;¥Æ›;­Äý;»‰;¿Zä;°Ä¥;”ac;qÉ™;Vxø;Uíª;Yé.;Tš;M=ª;P‰-;R‡®;;Þ;m~:˜H^: Éf9ue_8®bù8Ǻ'¤-º¡þŒºø8»*ûþ»Y:ú»w\V»vb)»Uæ »#åcºáƒºɺIºI]Ÿº€Èxº©&HºÛÓ'» uh»$­¼»= õ»eÿd»‘±»¼d»é5Ò¼_¼‹È¼ÓD¼áâ¼éC¼O¶»å:2»¶8r»wÜ4ºùƸ—ñ¨:Ü&¹;_~Ã;¦¨8;Ð;…;ß,ú;Ó©Û;»§â;¨µë;¥¥÷;¯;¶)Ö;­´9;•ëK;xß÷;^x-;]œç;`´$;YOâ;Mj;A²Þ;, €;2T:=<9ÝÊà8²ö$¸³¬Õ¹¶`ŒºN Gº«€÷ºó7ú»#6»PZ»n]Q»j ]»C±» tº­âEºDûº a…º)x¨º}«¯º»>F» »"Pß»@JT»fÔ»Ö©»»†Q»ç`¼Åó¼Lϼ)¼§G¼!’»î?»¿“Š»…Kh»Øî¹Ñ:¹82;XÈ&;¨4;Ñ}~;ÜlÇ;Ͳ¾;¶p!;§ˆ ;§;¬MS;¨j;•3–;|hq;bi;^vd;]):;P];:IÒ;òa:ï$:‰)h9¸ Û¸*[º¹sÀ;¹þ)÷ºg\Àº¬C ºä)6»’\»CI±»`»WR»(v_ºÕÑ•ºTœ¹¯í\¹—Güºnº•ŠOºìöw»øý»@S»bµá»T]»»œ»çôؼꪼ ¶¼ ܘ¼ v>»ûÈh»Ï's»”4#»*㙺A¨:™1¢;RE;¨V;Ñ;Ù­;ÊE;´”Y;§õ^;¥Šp;¡qÖ;’µ;y¨Æ;] ;S;IlÒ;3ŒÄ;:ÛÔ±:Lq9¤R=¹¥¹¹Œjºõºv'öº§†×ºÐv»E¦»44%»NŒû»;Ƴ»b“º~ /¹\cÐ8ƒÇ¹!4³ºH•µºÎ´» Ÿ»=*,»_=´»¿¡»¾Ð/»îY¼œ¼Kj¼‚„¼Â[»ãgœ»¨ÞJ»MQº’ø:w4g;L„å;§ÜÏ;м˜;Ø>É;È&);²ò,;¥B?;œ)½;8;pŒ;Nh¢;:Y;%,\;J°:Âƪ:h¼˜9š¹0eQ¹è2º3¡º‰ º£r‹º¿f‘ºö®¨»$#j»6y»5½º¢Â=¹Tç9Lj²9°”0¹xaºžžF» ÓÈ»6ä»^ »”&¯»È-»ùîb¼ \d¼P¢¼ ~°»øá»ÁDØ»wØúºË8:=Úy;HðÄ;¨³P;Ñn˜;ÖíÜ;ÄI;¬ãö;š£p;ˆRÓ;c&ž;8,;h·:ê4: Ò:7 9vKì¹0¸¹ûëÚºG*ÀºŠ”ÿº¥×Yº·9¸ºã›Ž» »X¥ºËÔ›¹Á#Y:Ò­:Vºˆ9¥ú8º7äNºêäù»,…»_Á±»œ~E»Õ‘‹¼Xh¼èS¼J?¼û»Ù›»“[Ø»':@«;H¸b;«2€;Ò û;Òi;ºh ;ž­ ;…ve;U V;4ß:Ùèý:€gã9Ün8mâ¹Oß¹ôººPpùº•…Qº± º»FºØÓ»a‚ºà¶´º3®g: ÏÉ:›e™:tƒq¸œñ“º¯ÞлÆð»b±Ö»¦Ã±»ã)*¼Îs¼«o¼ -"»íº„»©ÏU»$Ê9Á¨š;N:W;¯e;Еœ;Ç};¨_p;†×K;J ^;þc:†“ö9dœ¥¹wñx¹¿ˆ‡¹öȺKCغ©ØºÂvìºÊ"ºÔíµºÖ\cº„]9‘»:«â¹:¿b:ãºP©$» VC»d}»°Ù»ìð%¼ ¼ ´Í»ú»¼ ”»=fÜ9®P;[ÙÏ;´';ʈˆ;µ;ó ;H4?:á[ò9ñ'%¹Ø„¢º3Pïº"_ƺFY‚ºŸsIºÔM÷ºß@ºÓ·º£Ϲ^§Z:“y:é‚Ö:¡¸£¹J!ºï×—»aþ»¶E=»ð½Œ¼;x»þ“Å»Èe»MYˆ9ð;ru²;¹-€;¾yî;š¦;Q8Ì:Èãc6àóðºfOÔº|W_ºeŠºŸœèºâEºó4ýºÊþaº?† :,¦B:îõá:ç––9é‘ɺ»‡»Y »¹W»îá%»øÙ¶»Íâ»»SL:GHÖ;ˆOR;ºìÆ;ª>;;gÇñ:į¹«kºŸM.ºŸ´Æº­¬Õºí™Ÿ»oûº²}a·èÉm:Ì^Š; «g:“Ÿ¥ºv}â»Nà€»»Î»æû »ÏÈ»RÇ¡: ã;™l;µpÖ;†m:×OѺ—ºÊJ ºÙ+4»%i»Ëaº™‡:q"³;i?:õ®è¹®æu»Hº»À¨»Ìõ»S>4:î?É;©Lo;>Í;ÝÛº`xí»n«»:T»}0¹¬!; WI;.ëñ9Þ¶F»QlŸ»ÂC[»`à;(Í ;­™2;(ܺ­Œ9»:ý»Úi:)L;S¾j:·›_»{´»…‰9;n«';kر»*»>hÏ; aò;3w¿»¥¤; ªí»†ù;‰ÏR:‰9.:­Iu:î#;L¡;EJ);hXú;‚På;‹Ç;%Å;Ž|;‹;ºB;Œ¹;“Ê*;—èÌ;‘ǘ;{L3;7¹:Àý¯8=к¥¦4»1í»Q!;»€vm»—4»«ª/»¹? »¼»·a»´ÕV»¾aA»Ðä»ÞÔ»Þß»Õ7©»Ë"»Ââl»¸dP»§~Ò4»`k»vºÈSEºV‹¹²»„¸bŸ9{‹¸:A¿):¹ë;ç#; !A;1gì;<Ÿù;AÀ;E0z;O×Z;f#è;ƒ3};•êñ;¦µH;°1;°Ñ;ªžµ;¥™h;¤ôò;©÷y;²|ì;¸¤8;µÕ-;¨Ûy;˜ÈÇ;Ž›ô;Œ ò;ŒFj;Œòµ;éY;™Ñ; ;Ÿ³A;—¡ ;ŠJ¼;kÅ@;,]¤:¾½;:t 9¿~:.•è:‚š:˜T™:¯T:Ý;;"r;2õA;U7‰;qË;‚qq;†ƒà;†Y_;…#@;†‹;„ÔÔ;A.;—C€;ü·;p[Ò;0X:P-ºQX » Ù/»T7»…ò»œâ»»±KM»¿ÒP»Ä¶ñ»Â1•»Áòb»Ìùõ»à½9»ïi×»îY¯»áoˆ»Ô¹»Ê;»¾¢»ªzü»ŒtB»Pÿî» Ÿdºœõ˜º!J¹¾eö¹îÉ8e\Ø:,<:¶Rj;ð;(;@¶¢;M‰;Q=m;Yëã;py';Š%H;ž-;¬°š;°ø¿;¬¢%;¦Å‘;¥vî;ªp#;³Á};¼š);¾‡&;µ£˜;¥Dß;–+5;Ž ;‹m©;‹››;Œ;—ÍD;ŸLé;Ÿ5;•¹¿;„…!;U@ã;-¼:Š9Õ J9çyà:Y_:•Ñ¹:­[‰:Êà:ù!o; U;7|“;T \;i¼ª;t¢B;u¥Ø;sèÔ;y„;z#a;‹8;“ù;‹A²;XYI:æí¸-¡>ºÞãò»D¬*»0Š»˜vf»«ñ”»»uï»Ä!¢»Æ¶<»ÊÕƻؔ<»íô»ý¡ »ûÿ8»ì1ž»Û¸»ÎN›»¿í»¦6m»úH»3óºÕJ+ºdç?ºiwº_º h¸…Þx:3R:Å+Ù;Šy;:B/;P:ó;WÒ;^ÈÍ;t ;Œ?,;ŸoH;ª®º;ª•ÿ;¤Û…;¢€";§½?;²Šš;½ÉÙ;í¬;¿Áá;²MÜ;¡žV;•Ý;Ž¼; 5;¬ñ;–Æ>;×Z;y ;’ g;y!¯;;‡:àIÝ:>îY9ªP3:U:n«O:›ºà:µQ#:Ô±:üÂ;aÈ;19-;J);YìÆ;^r¼;^cÚ;euß;jÍË;„q;Œ1Õ;²U;2­„:xý¿ºxÝ<»%Sp»k𻌸­»ðŠ»­oÆ»º/‹»ÃnŠ»Í«Ï»ß"(»öo¼ÇŒ¼GB»õhÑ»á5˜»Ð|仼M»›ƒ%»ab» \þº”ˆÖº._©º1¦øºT ´º%os¶­t1:eP:èíc;&·á;FÎ;Qäv;XþE;l¿Ž;‡Ó+;™.“;¡H±;Ÿzž;œŠÔ; û¦;­) ;»Ó;ÄC`;ÄK;»_E;¬oK;ž6+;•D;ë¦;‘@w;•×;›D;™¤;ŒD ;euM;{Ê:©žð9ø÷-9ŠJ : ²:eVc:”ª+:°‘þ:Íús:ñ\t;q;*”p;?ˆ¬;H­ø;K";SÞ~;\5‡;xî÷;n‚;^šd;í:8£½bºç2 »I¹»z“+»‹ò¡»™Ù»©u滹CG»Ê)q»ß¨Ì»øÁ…¼¿š¼CL»üo,»æó€»ÑÓÌ»µº»Œ,²»6qºÁ«¹º9+!º)ÔºR̺n?κ e•9„PÙ:žxÇ;™;/8;?Z;Gm ;Z-Ê;{Ô;";“úÀ;”R\;—ÜH;£òQ;´8j;ÀoÔ;ðï;½÷Î;²_©;¥˜;›²9;•ÍE;“c…;”d;–‘ú;“O;„;O1;´ô:u .9ŽÁ9=Ì®9éÓM:IeÃ:ˆOf:¦tM:Ä f:ëƒì;õB;(` ;5Ìb;:õ;Dèi;Mø—;f>”;g”;6í:¡˺4ðÏ»¸†»Tú|»rÙ°»…NU»•î8»ªÙ)»ÁÚûÛ§»õ›¼É5¼Ø8¼Ž!»ìrF»ÒíÀ»­ž|»t›?»ì ºcre¹¿zºE&ºRSgºH{K¹[Æñ:0Vî:ÍöÝ;& ;$°¯;.cè;AE;a‹;^’;ˆ/;Ž;™O@;ª\Ð;¹>Ê;¾Áò;ºµb;±—;;§ÂŠ;Ÿ–?;™_";”„ ;‘Û;öÄ;Š¯¾;tkÞ;7üÛ:Ø<°:&Vò8Ï=Õ8¥Êd9´·…:1²:Ù:£¦©:É\5:ûby;dž;'€;.o€;8q-;?®V;Q{ã;I†þ;:Ý»ºœXS»!xJ»K^4»cð~»‚¹Ä»›-»·,ë»Óü­»ïW/¼%ö¼,—»ñä»ÓÚ—»¤~&»Od=ººÔ‹¹°‰¸XŸ¹·`Yº²¹½ÇÍ9¦¨Ý:–ƒå:ëô; ¶M;=);*œú;K£#;l¿ ;‚íF;oÜ; ;°P&;·àm;´S‡;«bÉ;£u½;ž;™%ž;’ÕÉ;Œ@.;‡DÊ;€s;_ ·;!].:¬m9Èéä¸EAš¶äê†9š™¨:2'<:ˆ÷:¶Ž:é,…;„;b—;&));.*û;2d•;=sI;.d:Ý]ö9T[º²Û »&Ó»<Ÿ‹»a ˜»‹I—»«ò¡»Ì·Q»é©»ÿw„¼ܼÛ!»÷PƻԂ»š‹»+˺YñC8óÅ‚9f—¸|‡œ¹ Éd9ˆE:vU:Éë3:õ8F;t;8r;C¯”;jQf;†=1;—(;§‰ ;°¨Ã;­˜Ý;£ ^;š9…;–h¸;“nA;Œå¶;ƒìx;yLs;j«9;I}{; ¾Ô:„C9'‚O¹/–¸$Ù9¶gú:WPI:¨Œ#:äg†; —¼;On;"ée;&š$;)Uà;/%;®s:¸„·rÎǺ©¬&» »;P³»v¶» {œ»ÆW»æ¢‘»þ#¼¼ªé¼1š»üN»ÒØ,»³C» “¹¥›:*:79Ïý:©æ:ƒ;I:È€k:ôTÎ; p;$ÅN;M{Œ;y þ;Ý; +¦;©ÿû;§í¼;›­ï;v”;Š==;ˆ,a;‚&H;pt~;`l;S%k;3•ö:ë“):6븨u¹ˆ Æ6öÖm: C:•ÑÚ:ãOÖ;t;#ç;%§A;#©´;(Ø÷;+¦;bü:¯ ¤6ªUº!~»Ü“»S¹ß»“Å!»¿üá»æÛ¼„"¼ ¼ 6¼j»Ïh’»„~ºÒù 9qú:m‹ë:õo:ƒrô:ª e:å ž; –Å;Ýž;;+,;fay;‰5;š°;¤·;£#w;–I;†¤;z8;r§#;f´Q;RÒD;CÅ“;9O;4š:¹Xj9´[幚๡`£9/´Y:jŽ/:ÚC;£ð;.`5;/1;(¾;3ÙØ;4Û;´¤:´‘\6¶Œ‘º¬­»*<껄V€»·…)»åŽç¼$£¼ Õ¼ i¼ï»É´»omÀº˜$Ó:I‡:©é—:Ö!:à<; D;#åÒ;;ÅZ;\‹;‚ÜÙ;”§Œ;žq ;ž&$;’Ò7;€ëä;d„;T¥Z;Ebÿ;0úG;#Sx;E—:ú—®:vn™¸×Áº¥¹†9: $:Àºü;9j;:’H;>å‹;5èž;Is;G_W;'É:±wÛ¹_ÓXºëý»a‚*»ª°ô»áÆ‹¼E1¼’ò¼"µ¼ºÐ»ÂT»Uwãº=šV:yO:ß‚a;œ<;"Çé;ANP;^¦;Œu;–;™k÷;˜€ü;Ž'Ö;zŒ;VøF;=±;&›»;¹ ;Î:ïš:¯°¶9¿˜:º€Iº)D¨¶R€:ý/;!€;D4";R“{;L?;dqš;[[f;*ý¹:ãºFð‡».`»—Ìa»×Ù§¼9¼æ¼ß²»þÆ"»¸$«»8­¹ˆ:²YÖ;½õ;49ª;Z;}i;c#;•÷;“©§;ˆ ;oòª;Môh;.À ;“:áÖ :¹Žm:ŸSf:.p𹉇.º`ìĺ2¯:QT:ýÕ;Fv˜;e“ƒ;fð¼;}fû;h a; ;»:4›ºÓø•»z¹f»Æ ¼ØA¼ä¼9g»ù*|»ª„>»ér9–©î:ó½;7Kz;hØ¡;ˆšº;“êî;’É;ƒ…;b%¸;BŸ^;%ß;Q:¶æ&:r»Û:i͸côº[Hºš¸Îîø:¼›¨;=*;rSs;µ7;‡©;gɇ;#L¹„Æ¿»2ûx»«\ß»õ”¼X?¼ªÎ»îÉ"»–71º$·º¨Êº§r¸dG:ýðá;iE;Œ8G;‰À”;@9ñYë».p»½³¼™¼Á»À»Ö»— :l~[;I³¨;†æ,;Ii;>¿ž;PX:ЉO:tÕ–¹ÔOºšj*º×õPºh:“=è;Q(½;‹Ø–;‡wç;måºT€/»“v=»îdØ»òÓl»˜> º-æs;#“Y;‚^d;q€%;p:Â¥F::ìïº5;ºâ«ÿºâ@Ó8P”3;*M˜;‰# ;„Ö@:½»Ü»7Ê÷»Òã)»×À£»@}œ:ÁìÇ;},;göµ:þŠ:‚¯ºŒÒ»¬@º®ê:×Ú¡;„ÿ;kX¹Ë¼»²q±»¶öº ;qT²;c2Ê:„ºÑ4T»4e·DäV;yõŠ;Wµ¶»ƒ‡"»‡ù¬;Gê•;Mn™ºç‰"»4š÷;J%·%!̹—âÛ9øC¹ºªhealpy-1.8.1/healpy/test/test_visufunc.py0000644000175000017500000000177212346125412020774 0ustar zoncazonca00000000000000import unittest import numpy as np import healpy as hp from ..visufunc import * from ..zoomtool import mollzoom class TestNoCrash(unittest.TestCase): def setUp(self): self.nside = 1 self.m = np.arange(hp.nside2npix(self.nside), dtype=np.double) self.ma = self.m.copy() self.ma[3] = hp.UNSEEN self.ma = hp.ma(self.ma) def test_cartview_nocrash(self): cartview(self.m) def test_mollview_nocrash(self): mollview(self.m) def test_gnomview_nocrash(self): gnomview(self.m) def test_orthview_nocrash(self): orthview(self.m) def test_mollzoom_nocrash(self): mollzoom(self.m) def test_cartview_ma_nocrash(self): cartview(self.ma) def test_mollview_ma_nocrash(self): mollview(self.ma) def test_gnomview_ma_nocrash(self): gnomview(self.ma) def test_orthview_ma_nocrash(self): orthview(self.ma) def test_mollzoom_ma_nocrash(self): mollzoom(self.ma) healpy-1.8.1/healpy/test/test_doctest_cython.py0000644000175000017500000000100012346125412022143 0ustar zoncazonca00000000000000import unittest import doctest from .. import _query_disc from .. import _pixelfunc # FIXME: I can't get py.test to recognize test suites returned with # doctest.DocTestSuite. class TestDoctestCython(unittest.TestCase): def test_query_disc(self): failed, passed = doctest.testmod(_query_disc) self.assertEqual(failed, 0) def test_pixelfunc(self): failed, passed = doctest.testmod(_pixelfunc) self.assertEqual(failed, 0) if __name__ == '__main__': unittest.main() healpy-1.8.1/healpy/test/test_fitsfunc.py0000644000175000017500000000657312346125412020757 0ustar zoncazonca00000000000000import os import pyfits import unittest import numpy as np import healpy from ..fitsfunc import * from ..sphtfunc import * class TestFitsFunc(unittest.TestCase): def setUp(self): self.nside = 512 self.m = np.arange(healpy.nside2npix(self.nside)) self.filename = 'testmap.fits' def test_write_map_IDL(self): write_map(self.filename, self.m, fits_IDL=True) read_m = pyfits.open(self.filename)[1].data.field(0) self.assertEqual(read_m.ndim, 2) self.assertEqual(read_m.shape[1], 1024) self.assertTrue(np.all(self.m == read_m.flatten())) def test_write_map_C(self): write_map(self.filename, self.m, fits_IDL=False) read_m = pyfits.open(self.filename)[1].data.field(0) self.assertEqual(read_m.ndim, 1) self.assertTrue(np.all(self.m == read_m)) def test_write_map_C_3comp(self): write_map(self.filename, [self.m, self.m, self.m], fits_IDL=False) read_m = pyfits.open(self.filename)[1].data for comp in range(3): self.assertTrue(np.all(self.m == read_m.field(comp))) def tearDown(self): os.remove(self.filename) class TestReadWriteAlm(unittest.TestCase): def setUp(self): s=Alm.getsize(256) self.alms = np.arange(s, dtype=np.complex128) def test_write_alm(self): write_alm('testalm_128.fits',self.alms,lmax=128,mmax=128) a0 = read_alm('testalm_128.fits') # Sanity check of the file self.assertEqual(Alm.getlmax(len(a0)),128) # Check the written data a0 = read_alm('testalm_128.fits') l0,m0 = Alm.getlm(128) # We extract 0 <= l <= 128 and 0 <= m <= 128 from self.alms idx = Alm.getidx(256,l0,m0) np.testing.assert_array_almost_equal(self.alms[idx],a0) def test_write_alm_256_128(self): write_alm('testalm_256_128.fits',self.alms,lmax=256,mmax=128) a0,mmax = read_alm('testalm_256_128.fits',return_mmax=True) self.assertEqual(mmax, 128) self.assertEqual(Alm.getlmax(len(a0),mmax=mmax),256) # Check the written data a0 = read_alm('testalm_256_128.fits') l0,m0 = Alm.getlm(256) idx = Alm.getidx(256, l0, m0) # Extract 0 <= l <= 256 and 0 <= m <= 128 idx_mmax = np.where(m0 <= mmax) idx = idx[idx_mmax] np.testing.assert_array_almost_equal(self.alms[idx], a0) class TestReadWriteCl(unittest.TestCase): def tearDown(self): os.remove("test_cl.fits") def test_write_read_cl_II(self): cl = np.arange(1025, dtype=np.double) write_cl("test_cl.fits", cl) cl_read = read_cl("test_cl.fits") np.testing.assert_array_almost_equal(cl, cl_read) def test_write_read_cl_4comp(self): cl = [np.arange(1025, dtype=np.double) for n in range(4)] write_cl("test_cl.fits", cl) cl_read = read_cl("test_cl.fits") for cl_column, cl_read_column in zip(cl, cl_read): np.testing.assert_array_almost_equal(cl_column, cl_read_column) def test_write_read_cl_6comp(self): cl = [np.arange(1025, dtype=np.double) for n in range(6)] write_cl("test_cl.fits", cl) cl_read = read_cl("test_cl.fits") for cl_column, cl_read_column in zip(cl, cl_read): np.testing.assert_array_almost_equal(cl_column, cl_read_column) if __name__ == '__main__': unittest.main() healpy-1.8.1/healpy/data/0000755000175000017500000000000012351601662015446 5ustar zoncazonca00000000000000healpy-1.8.1/healpy/data/pixel_window_n0008.fits0000650000175000017530000002070011705033043022021 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 33 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 8 / Resolution parameter for HEALPIX MAX-LPOL= 32 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 8 COMMENT for multipoles in range [0, 32] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð ?ïôQú’q?ïÜbÖ@˜¹?ïô` åƒ?ï¸æ>Ò ?ïÐd@ä?ï‰Çí07ç?ï¡QçkŒ?ïO2Ì4L?ïf˜åìíª?ï \ »M©?ï —[08?Ûò P?îÏŒš‰¢á?î\ðèk?îsÁ£cßË?íöõɤ?î ˆ¼|­¶?í†îèXÅ ?í='õÔ?í >±,Y'?í#Ad?ìŠP4v¡²?ì εçÑ?ëþ•Å~V?ìò4G«?ëjˆc·II?ë‰b®^Y?êΧ'oï?êãG°dͳ?ê+vq–µÚ?ê?±ã9Ä?é¢ì¥?é•QŒô°&?èÑPf?èä´_Ukª?èxª§V?è.k…ËÄN?ç`ܳ^?çs ú¾ë²?æ¡"ü‘4{?æ³(à¾_ä?åÝÑä‡x?åï\ÞÝ~*?å1úš’‹?å(?‚ N´?äMÛÊ·î?ä^i¥˜ÆÀ?ã‚g ã™Ä?ã’sâäÆ?âµmgg¡?âÄö Ís?áç‚??áö†µýÍ°?á;ò¨&ñ?á'ºÅÇ^?àK,¾±­?àY%a]¥?ÞûÉóGC?߬ hÇ?Ýcäÿpª2?Ý}¸ä°b ?ÛÏÁ:$Äæ?Ûè†ÿã7healpy-1.8.1/healpy/data/pixel_window_n8192.fits0000650000175000017530000202050011705033043022035 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:12 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 32769 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 8192 / Resolution parameter for HEALPIX MAX-LPOL= 32768 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 8192 COMMENT for multipoles in range [0,32768] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð?ïÿÿÿžÃ?ðšš?ïÿÿÿ8¶š?ðóõ?ïÿÿýìi‚?ïÿÿüÜÒn?ïÿÿöáQÕ?ïÿÿýbâ?ïÿÿ÷gb?ïÿÿ÷‘?ïÿÿñp?ïÿÿô->N?ïÿÿî1½·?ïÿÿñøLõ?ïÿÿëüÌ^?ïÿÿëgûŽ?ïÿÿålzù?ïÿÿäˆÔÙ?ïÿÿÞTE?ïÿÿà.„?ïÿÿÚ#­ñ?ïÿÿÜ_4V?ïÿÿÖc³Ä?ïÿÿÔwœã?ïÿÿÎ|R?ïÿÿΪv@?ïÿÿÈ®õ°?ïÿÿȆ(?ïÿÿŠž™?ïÿÿÀê?ïÿÿº#›]?ïÿÿ»g-?ïÿÿµk¬?ïÿÿ³™ŸÌ?ïÿÿ­žA?ïÿÿ©²?ïÿÿ£ —)?ïÿÿ¡,„Î?ïÿÿ›1F?ïÿÿ•õl¿?ïÿÿùì:?ïÿÿ‹Ÿ Ã?ïÿÿ…£‰@?ïÿÿØð)?ïÿÿyÝo¨?ïÿÿsz{U?ïÿÿm~ú×?ïÿÿfŽj?ïÿÿ`’é?ïÿÿYÛ0?ïÿÿS"Z¶?ïÿÿK0œÈ?ïÿÿE5Q?ïÿÿ<(I…?ïÿÿ6,É?ïÿÿ-XÊ?ïÿÿ']I?ïÿÿâC??ïÿÿæÂÑ?ïÿÿ ¨?ïÿÿ‡=?ïÿþüWà?ïÿþö×w?ïÿþê])?ïÿþäÜÄ?ïÿþÖ};9?ïÿþк×?ïÿþÃDû?ïÿþ½Iz¸?ïÿþ¯:-w?ïÿþ©>­?ïÿþ™ØË ?ïÿþ“ÝJ³?ïÿþ„@Û6?ïÿþ~EZä?ïÿþmêÖ†?ïÿþgïV8?ïÿþTÄ?ïÿþNÈÎ?ïÿþ;{|Ò?ïÿþ5ü?ïÿþ"m*?ïÿþìë?ïÿþýˆ)?ïÿþî?ïÿýìOÍô?ïÿýæTM¾?ïÿýÐ×ó?ïÿýÊ WÃ?ïÿý²«7E?ïÿý¬¯·?ïÿý”¿ôp?ïÿýŽÄtK?ïÿýuÌX“?ïÿýoÐØt?ïÿýU[ßì?ïÿýO`_Ó?ïÿý4iãô?ïÿý.ncá?ïÿýÑÛ?ïÿý QÎ?ïÿüî=|`?ïÿüèAüZ?ïÿüÊìÔ?ïÿüÄñT?ïÿü¤ÚOš?ïÿüžÞÏ¢?ïÿü}sCˆ?ïÿüww×?ïÿüU¦°P?ïÿüO«0f?ïÿü-ü?ïÿü'|.?ïÿü43?ïÿûü8³(?ïÿû× Ò?ïÿûÑR3?ïÿû©É}ì?ïÿû£Íþ"?ïÿû{Æ(_?ïÿûuʨž?ïÿûM­?ïÿûG -L?ïÿû@õ?ïÿûEuh?ïÿúéíM´?ïÿúãñÎ?ïÿú·]Š?ïÿú±b d?ïÿú‚p]Ú?ïÿú|tÞG?ïÿúL ¯ ?ïÿúF/„?ïÿúå :?ïÿú錼?ïÿùÝ'Å?ïÿùרQ?ïÿù¢i-?ïÿùœm…Å?ïÿùg¨ê&?ïÿùa­jÈ?ïÿù*T¸Ý?ïÿù$Y9‹?ïÿøíÃÛ?ïÿøçÈ[È?ïÿø¯½?ïÿø©š‚?ïÿøn\Ç#?ïÿøhaGô?ïÿø+?P?ïÿø%¡À.?ïÿ÷éN|?ïÿ÷ãRüñ?ïÿ÷¤¥q?ïÿ÷ž©ˆh?ïÿ÷_E&T?ïÿ÷YI§X?ïÿ÷š#}?ïÿ÷ž¤Ž?ïÿöÐéV*?ïÿöÊí×H?ïÿö‡7p/?ïÿö;ñ[?ïÿö<ŒÍÙ?ïÿö6‘O?ïÿõðXê?ïÿõê“Ú3?ïÿõ£Iˆ¼?ïÿõN ?ïÿõTdÂâ?ïÿõNiDH?ïÿõíÁ/?ïÿôýòB¤?ïÿô²±š?ïÿô¬µ‘?ïÿô`·‘K?ïÿôZ¼ß?ïÿô M`W?ïÿôQáú?ïÿó¸Ç¥?ïÿó²„IX?ïÿób\<ƒ?ïÿó\`¾F?ïÿó ”'‚?ïÿó˜©U?ïÿò²Iö:?ïÿò¬Nx?ïÿòY‡0?ïÿòS‹‡$?ïÿñýß\j?ïÿñ÷ãÞo?ïÿñ¢5êŒ?ïÿñœ:l£?ïÿñEáDé?ïÿñ?åÇ?ïÿðè>z?ïÿðâBüH?ïÿð‰^?ïÿðƒc_?ïÿð)þˆã?ïÿð$ @?ïÿïÈæ>?ïÿï†h­?ïÿïfR`J?ïÿï`VâÌ?ïÿï%wØ?ïÿîþ)úl?ïÿî iËÚ?ïÿîšnN€?ïÿî;Ù”??ïÿî5Þø?ïÿíÖ×yÂ?ïÿíÐÛüŽ?ïÿíq#žq?ïÿík(!P?ïÿí ‚C?ïÿ톑5?ïÿì£ðÈD?ïÿìõKJ?ïÿì<—'t?ïÿì6›ª?ïÿëÔŠý?ïÿë΀/?ïÿëlÁ•&?ïÿëfÆe?ïÿëغÐ?ïÿêýÝ>#?ïÿê›G…?ïÿê•Êì?ïÿê2r. ?ïÿê,v±‡?ïÿéÈû˜Î?ïÿéÃ\?ïÿé_Q·N?ïÿéYV:ð?ïÿèõÏÐ?ïÿèïÓœ†?ïÿèŒD/ ?ïÿè†H²Õ?ïÿè"…÷Ò?ïÿèŠ{¯?ïÿç¸ï-Û?ïÿç²ó±Ì?ïÿçOäÞ?ïÿçIhã?ïÿææTß4?ïÿæàYcL?ïÿæ}ûF ?ïÿæwÿÊÌ?ïÿæªO?ïÿæ®ÓU?ïÿå­º‰Ÿ?ïÿ姿 ò?ïÿåFª˜?ïÿå@„.þ?ïÿäàYV?ïÿäÚÝÏ?ïÿäy¨ ”?ïÿäs¬‘!?ïÿä­Y?ïÿä²ø?ïÿã¯ö5ª?ïÿã©úº\?ïÿãLÙgv?ïÿãFÝì;?ïÿâë:¨?ïÿâå¿?ïÿâ‰ÅŽ:?ïÿâƒÊ#?ïÿâ)xò?ïÿâ#|“í?ïÿáÊñÈI?ïÿáÄöMU?ïÿám¿q–?ïÿágÃöµ?ïÿáþcÚ?ïÿá é ?ïÿà·õDÐ?ïÿà±ùÊ?ïÿà_”Ìæ?ïÿàY™R7?ïÿà¬O?ïÿà°Ôs?ïÿß´e¸^?ïÿß®j=Î?ïÿßb¶”?ïÿß\<?ïÿß(¹ü?ïÿß -?‹?ïÿÞÂü I?ïÿÞ½ç?ïÿÞwBÔ?ïÿÞqÈ€?ïÿÞ-Cš?ïÿÞ'H¾?ïÿÝæKâw?ïÿÝàPh>?ïÿÝ¡·”a?ïÿÝ›¼5?ïÿÝ_{?ïÿÝY“ˆ[?ïÿÝ Š³.?ïÿÝ9?ïÿÜä,iJ?ïÿÜÞ0ïA?ïÿܪٸ ?ïÿܤÞ>?ïÿÜt‚¾?ïÿÜn††Ê?ïÿÜAWr?ïÿÜ;[ø3?ïÿÛÕÌM?ïÿÛÏRw?ïÿÛUpf?ïÿÛOtìI?ïÿÚÔ•ýÃ?ïÿÚΚ„?ïÿÚSIÒ?ïÿÚMNXŽ?ïÿÙÑ5s‰?ïÿÙË9ú?ïÿÙMÖág?ïÿÙGÛh ?ïÿØÉe{Ê?ïÿØÃj…?ïÿØDÌvP?ïÿØ>Ðý%?ïÿ׿\ö?ïÿ×¹a}~?ïÿ×8™U?ïÿ×2Ü ?ïÿֱÛ?ïÿÖ«Ç•º?ïÿÖ)ª…¹?ïÿÖ#¯ ó?ïÿÕ¡ ä@?ïÿÕ›k“?ïÿÕ車?ïÿÕíBö?ïÿÔ¡Ú®?ïÿÔ‡¦b5?ïÿÔ–:í?ïÿÓüšÂ?ïÿÓw¤E»?ïÿÓq¨Íu?ïÿÒëÓ,D?ïÿÒå×´?ïÿÒ_-V?ïÿÒY1Ýð?ïÿÑÒ:>'?ïÿÑÌ>Æ0?ïÿÑD®ÞÕ?ïÿÑ>³fø?ïÿж”ÎÜ?ïÿа™W?ïÿÐ(ip?ïÿÐ""ñÉ?ïÿϘ²´V?ïÿÏ’·<Ê?ïÿÏþ¡?ïÿÏ)¬?ïÿÎy2µV?ïÿÎs7>?ïÿÍéÒ³?ïÿÍã [w?ïÿÍXXÈ?ïÿÍRá¨?ïÿÌÆú,Ò?ïÿÌÀþµÌ?ïÿÌ5¡¥Ú?ïÿÌ/¦.ð?ïÿË£ìr*?ïÿËðû[?ïÿË /j?ïÿË ¸¶?ïÿÊ€-%¬?ïÿÊz1¯?ïÿÉí|†:?ïÿÉç½?ïÿÉ[ ¥?ïÿÉU.®?ïÿÈÈ&?”?ïÿÈÂ*ÉN?ïÿÈ5'y¬?ïÿÈ/,‚?ïÿÇ¢;úú?ïÿÇœ@„ê?ïÿÇ&ò]?ïÿÇ +|i?ïÿÆ{ôg0?ïÿÆuøñW?ïÿÅé€: ?ïÿÅã„ÄO?ïÿÅV›{Ë?ïÿÅP )?ïÿÄÃwf‚?ïÿĽ{ðü?ïÿÄ0Éú&?ïÿÄ*΄¼?ïÿÞ8tö?ïÿØ<ÿ§?ïÿà ® ?ïÿò§Ù?ïÿÂy™r>?ïÿÂsý%?ïÿÁç¤&?ïÿÁᨪ)?ïÿÁUûŸ?ïÿÁOÿ‘½?ïÿÀÄèÔJ?ïÿÀ¾í_ƒ?ïÿÀ3û¤h?ïÿÀ./¼?ïÿ¿£`X~?ïÿ¿dãí?ïÿ¿~’?ïÿ¿ ƒ¤?ïÿ¾ƒèþ¬?ïÿ¾}íŠQ?ïÿ½ô™h?ïÿ½î•%'?ïÿ½f2¹?ïÿ½`7Dñ?ïÿ¼Ø,W{?ïÿ¼Ò0ãp?ïÿ¼J©#-?ïÿ¼D­¯=?ïÿ»¾&„æ?ïÿ»¸+?ïÿ»2[×}?ïÿ»,`cÁ?ïÿº§>0?ïÿº¡ ÊŽ?ïÿº¸3î?ïÿº¼Àe?ïÿ¹“0ÍÏ?ïÿ¹5Za?ïÿ¹ }8-?ïÿ¹ÄØ?ïÿ¸‚÷–˜?ïÿ¸|ü#\?ïÿ·Ý Cð?ïÿ·×ÐÓ?ïÿ·/qI,?ïÿ·)uÖ0?ïÿ¶~¦k?ïÿ¶{ƒ3?ïÿµÒ·U=?ïÿµÌ»â‚?ïÿµ#1ð?ïÿµ¿V?ïÿ´rÀSI?ïÿ´lÄàÐ?ïÿ³ÁºÇŠ?ïÿ³»¿U2?ïÿ³·¿Ã?ïÿ³ ¼MŒ?ïÿ²\ûˆÓ?ïÿ²W¾?ïÿ±©‹ŸB?ïÿ±£-N?ïÿ°õNÎÛ?ïÿ°ïS]?ïÿ°@ÅF/?ïÿ°:ÉÔ?ïÿ¯‹<Á«?ïÿ¯…AP?ïÿ®Ô¼?ïÿ®ÎÀ§¬?ïÿ®àÇ?ïÿ®åUº?ïÿ­f7”:?ïÿ­`<#?ïÿ¬® qØ?ïÿ¬¨%Ó?ïÿ«õ‚Öz?ïÿ«ï‡e˜?ïÿ«;î=%?ïÿ«5òÌe?ïÿªß‘„?ïÿª{ä ç?ïÿ©Ç\r¨?ïÿ©Áa-?ïÿ© 0[(?ïÿ©4êÑ?ïÿ¨PDìT?ïÿ¨JI|?ïÿ§”1û?ïÿ§Ž5•ê?ïÿ¦×M´8?ïÿ¦ÑRDJ?ïÿ¦÷Ýè?ïÿ¦ün?ïÿ¥\Š‘+?ïÿ¥V!„?ïÿ¤žaªh?ïÿ¤˜f:ä?ïÿ£ß„¼?ïÿ£Ù‰L°?ïÿ£ j±z?ïÿ£oB>?ïÿ¢`Æ;x?ïÿ¢ZÊÌ_?ïÿ¡ žü?ïÿ¡š£?ïÿ àL¶®?ïÿ ÚQGÞ?ïÿ …p?ïÿ ‰˜Ã?ïÿŸ^N¡å?ïÿŸXS3]?ïÿžœæs?ïÿž–ë?ïÿÛPj?ïÿÕ!â*?ïÿúq?ïÿÿè?ïÿœV?ïÿœPó¿?ïÿ›”Gpã?ïÿ›ŽL?ïÿšÑv}?ïÿšËz™Î?ïÿššíâ?ïÿšŸ€X?ïÿ™K‚?ïÿ™E ?ïÿ˜‡H7­?ïÿ˜LÊm?ïÿ—Ãà#²?ïÿ—½ä¶•?ïÿ–ÿ¦Ã%?ïÿ–ù«V-?ïÿ–;¡ ü?ïÿ–5¥´)?ïÿ•wíÔ“?ïÿ•qògå?ïÿ”³´S?ïÿ”­¸©É?ïÿ“ïxGR?ïÿ“é|Úí?ïÿ“+Z­?ïÿ“%^œm?ïÿ’fçpÀ?ïÿ’`ì¥?ïÿ‘¢‰É~?ïÿ‘œŽ]‡?ïÿÞ`-þ?ïÿØdÂ+?ïÿÌ*3?ïÿо…?ïÿUÂŒ@?ïÿOÇ ·?ïÿŽ‘½î?ïÿŽ‹Á™Š?ïÿÍ~Éó?ïÿǃ^³?ïÿ ›0˜?ïÿŸÅ}?ïÿŒFýÆ?ïÿŒ@’Ð?ïÿ‹‚wÜË?ïÿ‹||qú?ïÿŠ¿1…C?ïÿŠ¹6•?ïÿ‰üMDH?ïÿ‰öQÙ¿?ïÿ‰9d™"?ïÿ‰3i.¾?ïÿˆoFÌÓ?ïÿˆiKb•?ïÿ‡“Õ?y?ïÿ‡ÙÕc?ïÿ†·j$ž?ïÿ†±nº±?ïÿ…Úƒ€+?ïÿ…Ôˆh?ïÿ„üÛþ?ïÿ„öà”m?ïÿ„Gm?ïÿ„L•?ïÿƒ>úuU?ïÿƒ8ÿ ?ïÿ‚_)¡?ïÿ‚Y-«…?ïÿ~G¢Q?ïÿxL9_?ïÿ€œÒ*K?ïÿ€–ÖÁ‚?ïÿºÌ„D?ïÿ´Ñ¦?ïÿ~×ó°¸?ïÿ~ÑøHD?ïÿ}ô’æ±?ïÿ}î—~h?ïÿ}®?ïÿ} ²™ü?ïÿ|+¼¾K?ïÿ|%ÁVW?ïÿ{F!Ü?ïÿ{@&6?ïÿz_ø5ø?ïÿzYüÎZ?ïÿyy-”l?ïÿys2,ù?ïÿx‘¯"Ì?ïÿx‹³»…?ïÿw©‘š?ïÿw£†*~?ïÿvÀ©“¨?ïÿvº®,¸?ïÿu׆Ðu?ïÿuÑ‹i±?ïÿtí• À?ïÿt癣'?ïÿtŸZ?ïÿsý 8í?ïÿsàL1?ïÿsäåð?ïÿr,ií¸?ïÿr&n‡¢?ïÿq?õ*?ïÿq9ùÄ6?ïÿpS#z¢?ïÿpM(å?ïÿoeÌá?ïÿo_Ñ|?ïÿnwà! ?ïÿnq仨?ïÿm‰¤ò?ïÿmƒ¨ º?ïÿlšÛQ@?ïÿl”ßì5?ïÿk«_þ?ïÿk¥d9 ?ïÿj»¢½-?ïÿjµ§X|?ïÿiË}ÕØ?ïÿiÅ‚qT?ïÿhÚÊз?ïÿhÔÏl_?ïÿgéœ?ïÿg㓪r?ïÿfø$úz?ïÿfò)–}?ïÿfÛK?ïÿfw{?ïÿeÄÿ‘?ïÿe É›ï?ïÿd!?ïÿdžš?ïÿc-éCä?ïÿc'íà?ïÿb:Ž–d?ïÿb4“3J?ïÿaFÏ~(?ïÿa@ÔAÙQº?ïÿ>;ÝõZ?ïÿ=-‰.û?ïÿ='ÒÎ?ïÿ<¨ú®?ïÿ<­žµ?ïÿ;<#?ïÿ:ý@¥^?ïÿ9íÌo?ïÿ9ç$pÞ?ïÿ8Ö2_V?ïÿ8Ð7ø?ïÿ7¾DI?ïÿ7¸¡é ?ïÿ6¦vÚ?ïÿ6 {¨?ïÿ5¯ûÈ?ïÿ5‡´¡?ïÿ4tLU?ïÿ4nPúˆ?ïÿ3Zb?ïÿ3TfÁ«?ïÿ2?½kˆ?ïÿ29Âf?ïÿ1$t¸º?ïÿ1y^Í?ïÿ0Âîø?ïÿ0Ç•@?ïÿ.ìOõd?ïÿ.æT›á?ïÿ-Ï{.*?ïÿ-ÉÔÜ?ïÿ,²r?ïþôe·¾ˆ?ïþô_¼o÷?ïþó"aIG?ïþóeúò?ïþñÞ‰vó?ïþñØŽ(Ú?ïþð™òŸ§?ïþð“÷QË?ïþïTÙª?ïþïN”Œ ?ïþî¤SG?ïþî©å?ïþìÈ"Úc?ïþìÂ'>?ïþë€îc?ïþëzó4{?ïþê9 i"?ïþê3w?ïþèðy³‚?ïþèê~g?ïþç§OIö?ïþç¡SýÆ?ïþæ]~t4?ïþæWƒ(B?ïþå)¸ä?ïþå .m0?ïþãÈ% X?ïþãÂ)¾á?ïþâ|ƒJå?ïþâv‡ÿ¬?ïþá0f›?ïþá*kw ?ïþßãu8 ?ïþßÝyíM?ïþÞ–6J?ïþÞëÍ?ïþÝH7¥¤?ïþÝB<[e?ïþÛù•®?ïþÛó™Ê­?ïþÚªwò@?ïþÚ¤|¨~?ïþÙZò˜$?ïþÙT÷N ?ïþØ »¡?ïþØÀXØÒ ?ïþš8Ý”i?ïþ˜ÊJžÒ?ïþ˜ÄOa`?ïþ—U#WN?ïþ—O("?ïþ•ßI±.?ïþ•ÙNtH?ïþ”hÀM©?ïþ”bÅ ?ïþ’ñ‰Î¬?ïþ’뎒S?ïþ‘y¨Öã?ïþ‘s­šÐ?ïþ ¤?ïþû$Í×?ïþŽˆ vH?ïþŽ‚:Á?ïþ<ÚÆ?ïþAŸ†?ïþ‹“ç¢ú?ïþ‹ìh?ïþŠçl ?ïþŠì1X?ïþˆ>ôÚ?ïþˆ—Cºo?ïþ‡! ‚?ïþ‡Ý^?ïþ…¤CÞo?ïþ…žH¤’?ïþ„&ÍøX?ïþ„ Ò¾Ã?ïþ‚¨È(à?ïþ‚¢Ìï’?ïþ*B†\?ïþ$GMU?ïþªü­?ïþ¥tG?ïþ~+b½?ïþ~%*F?ïþ|ªÜ{?ïþ|¤áC`?ïþ{)ìäH?ïþ{#ñ¬a?ïþy¨c3?ïþy¢gûð?ïþx&iù`?ïþx nÂ?ïþv£Ïl?ïþvÓÉ]?ïþu ¯–¼?ïþu´_õ?ïþs„„?ïþs—N?ïþrî’ˆ?ïþró\R?ïþp”+Vô?ïþpŽ0!?ïþoü ?ïþo Ôb?ïþm‰p]&?ïþmƒu'Ë?ïþl0"°?ïþký4íž?ïþj|¦?ïþjvªêP?ïþhõ”PŠ?ïþhï™ ?ïþgmð؉?ïþggõ¤R?ïþeåò'¬?ïþeßöó¾?ïþd]tŠÏ?ïþdWyW+?ïþbÔaz¬?ïþbÎfGQ?ïþaK”`?ïþaE aO?ïþ_Á9¦Ž?ïþ_»>sÆ?ïþ^6Ñ´á?ïþ^0Ö‚c?ïþ\¬9 Õ?ïþ\¦=î¡?ïþ[!@?ïþ[DÖ?ïþY•·Z?ïþY»áº?ïþX ìÅÒ?ïþXñ”{?ïþV}±ÚÝ?ïþVw¶©Ñ?ïþTðüý8?ïþTëÌv?ïþSdŒv?ïþS^[þ?ïþQÑåì?ïþQËê»Û?ïþP9„»±?ïþP3‰‹Ð?ïþN Ëß?ïþNš’œK?ïþMÌ6?ïþM¢œï?ïþKké¯Â?ïþKeî€Ç?ïþIЙp3?ïþIÊžA…?ïþH4|±v?ïþH.ƒ?ïþF—®Íç?ïþF‘³ŸÓ?ïþDú%Wj?ïþDô*)¤?ïþC[âzº?ïþCUçMA?ïþA¼Âð|?ïþA¶ÇÃQ?ïþ@áå?ïþ@µ?ïþ>|¾f?ïþ>vÃ:?ïþ<Û†‰?ïþ<Õ‹\Æ?ïþ;9Å}?ïþ;3ÊQ?ïþ9—?fu?ïþ9‘D:Ð?ïþ7óêB§?ïþ7íïP?ïþ6Pbå?ïþ6J7Ü?ïþ4«ˆ“©?ïþ4¥hð?ïþ3BÓî?ïþ3G©ƒ?ïþ1`Czò?ïþ1ZHPÖ?ïþ/¹±‹M?ïþ/³¶a?ïþ.‚òü?ïþ. ‡É~?ïþ,j¡Œ®?ïþ,d¦c?ïþ*‹†?ïþ*¼b¦?ïþ)ÃœR?ïþ)ÈsÂ?ïþ'nü:¨?ïþ'ih?ïþ%Ägä?ïþ%¾këô?ïþ$BþŠ?ïþ$GÖé?ïþ"m’12?ïþ"g— á?ïþ Á&ßÊ?ïþ »+¸Ê?ïþ‚2?ïþ [?ïþf–R?ïþ`›,0?ïþ¸u¬Ë?ïþ²z†»?ïþ °?ïþ´âQ?ïþZkyø?ïþTpT‰?ïþªzÐø?ïþ¤«Û?ïþùÈê¸?ïþóÍÅë?ïþH«l?ïþB¯ñð?ïþ—%?ïþ‘×?ïþäƒñ!?ïþÞˆÍH?ïþ1ÑÌ?ïþ+Ö¨?ïþ ~‚:Æ?ïþ x‡?ïþ Êt½T?ïþ Äyšo?ïþ  S?ïþ 0†?ïþ`ð¿¦?ïþZõd?ïþ«g¹%?ïþ¥l—4?ïþõBAs?ïþïGÕ?ïþ>Ž…×?ïþ8“d‹?ïþ‡OC?ïþSòH?ïýþÏ´xK?ïýþɹW£?ïýýp 3?ïýýuÝ?ïýû^´!?ïýûX¹ ?ïýù¥˜O,?ïýùŸ/{?ïý÷첬?ïý÷æ “N?ïýö1ñÓ?ïýö+õéÇ?ïýôwuÿÛ?ïýôqzá"?ïýò¼ƒ\ˆ?ïýò¶ˆ>!?ïýñî‚H?ïýðúód5?ïýïEx§?ïýï?Zç?ïý툴 6?ïý킸ïÉ?ïýëËÛ1ê?ïýëÅàÐ?ïýê®Ê?ïýê³?ïýèQ Ä?ïýèK§‘?ïýæ­Ê ?ïý扲­é?ïýäÇé—Ž?ïýäÁî{Ã?ïýâÿVŸ|?ïýâù[„?ïýá5ëŠ?ïýá/ðnä?ïýßk׆5?ïýßeÜkl?ïýÝ¡Ö/?ïýÝ› »»?ïýÛÕxd?ïýÛÏ}Iþ?ïýÚ iEå?ïýÚn,?ïýØ?ïýˇ}c+?ïýɺÿ7Ò?ïýɵ!?ïýÇç³/â?ïýÇá¸~?ïýÆ–Œ?ïýÆ ›uõ?ïýÄ>íž?ïýÄ8òié?ïýÂiêi?ïýÂc’Õ ?ïýÀ“cêŽ?ïýÀhÕ‰?ïý¾¼³\D?ïý¾¶¸G–?ïý¼åR[v?ïý¼ßWG!?ïý» Böò?ïý»Gâõ?ïý¹4’!ð?ïý¹.—L?ïý·[,U?ïý·U1 ?ïýµ'?ïýµ{û4?ïý³¦6Þ?ïý³ „$C?ïý±Ë<^Ž?ïý±ÅALL?ïý¯ïL¥ˆ?ïý¯éQ“Ÿ?ïý®Ǹ„?ïý® ̦ô?ïý¬5„–¿?ïý¬/‰…‰?ïýªW»+³?ïýªQÀÕ?ïý¨yMGp?ïý¨sR6ì?ïý¦šRp?ïý¦”W_ô?ïý¤º—J_?ïý¤´œ:Ž?ïý¢Ú^e?ïý¢Ôcî?ïý ù“ÿ?ïý ó˜râ?ïýŸ/z?ïýŸ3ø·?ïý6GûH?ïý0Lìß?ïý›S¶6?ïý›M»'?ïý™pf§?ïý™jkqò?ïý—Œºm?ïý—†¿_ª?ïý•¨_—y?ïý•¢dŠz?ïý“ÃmQq?ïý“½rDÌ?ïý‘Þ1å?ïý‘Ø%›?ïýø}²?ïýòqÂ?ïýŽ’Çj?ïýŽ —»Õ?ïýŒ*Œ½K?ïýŒ$‘²?ïýŠBÚó†?ïýŠ<ßè¨?ïýˆZ¾6?ïýˆTó?ïý†r V?ïý†l/?ïý„ˆî#ô?ïý„‚ó(?ïý‚Ÿ5=L?ïý‚™:3Ü?ïý€µƒË?ïý€¯z¶?ïý~ÊKµŠ?ïý~ÄP¬Ñ?ïý|ß>??ïý|Ù5á?ïýzónI?ïýzísA?ïýyD•Ÿ?ïýyIù?ïýw† ð?ïýw‹§?ïýu-göƒ?ïýu'lï–?ïýs?¹­?ïýs9¾¦ð?ïýqQ‘àÝ?ïýqK–Ú¨?ïýo`åÝÀ?ïýoZê×è?ïými¼7×?ïýmcÁ2^?ïýkq¾›Ç?ïýkkÖ¬?ïýiy¾$?ïýis¹g?ïýg e‘?ïýgy¥a2?ïýe…EûÇ?ïýeJ÷È?ïýcŠp3º?ïýc„u0?ïýaŽ°­“?ïýaˆµªQ?ïý_’<å?ïý_ŒA?ïý]•U¥?ïý]#S!?ïý[—Në”?ïý[‘Sép?ïýY˜±Eµ?ïýY’¶Cð?ïýW™y°}?ïýW“~¯?ïýU™m^!?ïýU“r]?ïýS˜¶q…?ïýS’»pß?ïýQ—L™²?ïýQ‘Q™l?ïýO•;¢ú?ïýO@£?ïýM’S:Â?ïýMŒX;=?ïýKŽÛMX?ïýKˆàN2?ïýIŠ­“J?ïýI„²”…?ïýG…·òª?ïýG¼ôF?ïýE€Aø±?ïýEzFú®?ïýCz·d?ïýCt ¹Â?ïýAs(Úx?ïýAm-Ý6?ïý?k§*N?ïý?e¬-n?ïý=cz2?ïý=]³?ïý;Z‘”?ïý;T–v?ïý9QwÓ?ïý9K|?ïý7FÔN?ïý7@ÙR¨?ïý5;úÿ?ïý55ÿÈÆ?ïý30u»¾?ïý3*zÁ'?ïý1$Z­ ?ïý1_²Õ?ïý/—Öª?ïý/œÜ×?ïý- 8Þ)?ïý-=ä¹?ïý*ü5Ý‹?ïý*ö:ä|?ïý(í†ÿ–?ïý(çŒê?ïý&ÞKUÚ?ïý&ØP]‘?ïý$Î]ç$?ïý$Èbï>?ïý"½À±˜?ïý"·Åº?ïý ¬¦Y?ïý ¦« 9?ïýšéN?ïý”î ?ïýˆ•K?ïý‚šT½?ïýu¿øÆ?ïýoÅÎ?ïýb:ßÀ?ïý\?ê,?ïýN$Éâ?ïýH)Ô±?ïý9v–?ïý3{É?ïý$:.\?ïý?9ó?ïý`Ï?ïýe Ê?ïý ø™?ïý ò¥x?ïý áÇ`?ïý ÛÔ"?ïý É…Û?ïý Ê'?ïý±~t£?ïý«ƒ‚.?ïý˜Ùé³?ïý’Þ÷¢?ïý¬f1?ïýy±t„?ïýe÷á!?ïý_üïÙ?ïüÿK¾QÖ?ïüÿEÃ`ò?ïüý0îìL?ïüý*óûÎ?ïüûž}?ïüû£Œû?ïüøùÅ£?ïüøóʳf?ïüöÝS¹¥?ïüö×XÊU?ïüôÀ‚ĉ?ïüôº‡Õž?ïüò£ˆ?ïüò!Ý?ïüð…IR?ïüðN!1?ïüîfí± ?ïüî`òÃP?ïüìF© ü?ïüì@® §?ïüêßÞ¡?ïüêäñ³?ïüçøvŸ?ïüçò{²Š?ïüåÐIhË?ïüåÊN|«?ïüã§Pæ?ïüã¡U”.?ïüá}²¿¿?ïüáw·Ôn?ïüßSLsŠ?ïüßMQˆ ?ïüÝ(<?ïüÝ"$Q…?ïüÚü?D@?ïüÚöDZ'?ïüØϤØ6?ïüØÉ©î…?ïüÖ¢Q¹?ïüÖœV¦p?ïüÔt=ÇÀ?ïüÔnBÞß?ïüÒEÊ?ïüÒ?•R?ïüЯ?ïüÐ,Ÿ?ïüÍåë¶ø?ïüÍßðÏQ?ïüË´ø…6?ïüË®ýø?ïüɃVz?ïüÉ}[8¤?ïüÇQn?ïüÇK‡•?ïüÅC,?ïüÅ])?ïüÂêQwÇ?ïüÂäV’-?ïüÀ¶Lº?ïüÀ°gŠ?ïü¾€ð£0?ïü¾zõ¾j?ïü¼K9x?ïü¼E>“¨?ïüºÌ@ ?ïüºÑ\?ïü·Ýªªø?ïü·×¯Ço?ïüµ¥ÖhÀ?ïüµŸÛ…¡?ïü³mlE*?ïü³gqbv?ïü±4RÁ?ïü±.WÞÌ?ïü®úyˆ}?ïü®ô~¦ž?ïü¬À!Z?ïü¬º&x¡?ïüª…×k¿?ïüm_å1Î?ïümYê\2?ïük­P?ïükØ"?ïühÇÀ#?ïühÁÅ:d?ïüfzáT¾?ïüftæ€l?ïüd-c6™?ïüd'hbµ?ïüaßrc2?ïüaÙw½?ïü_öøŸ?ïü_Šü%˜?ïü]@ýü,?ïü];)”?ïüZêÙO?ïüZäÞ}Y?ïüX“áa;?ïüXæƒ?ïüV<(Þø?ïüV6. °?ïüSãÂ`Œ?ïüSÝÇ´?ïüQŠ•—«?ïüQ„šÇC?ïüO0›qù?ïüO* ¢?ïüLÖ'?ïüLÐX ?ïüJzškâ?ïüJtŸœÌ?ïüHtGë?ïüHyyF?ïüEÁ¨¾&?ïüE»­ïó?ïüCd4?ïüC^fO?ïüAÉ«?ïü@ÿÎÝ·?ïü>¦Ò“^?ïü> ×Æ~?ïü†eç?ïûº½Qb›?ïûº·V®e?ïû¸5e:-?ïû¸/j†p?ïûµ¬®7?ïûµ¦³fó?ïû³#M‰?ïû³R_¿?ïû°™#Åâ?ïû°“)‘?ïû®3—V?ïû®8å?ïû«‚•–©?ïû«|šåK?ïû¨ö;Nh?ïû¨ð@„?ïû¦i;¸?ïû¦c#‹O?ïû£ÛWY‘?ïû£Õ\©¢?ïû¡LØAX?ïû¡FÝ‘ã?ïûž½’Ÿ¿?ïûž·—ðÅ?ïûœ-§7Ý?ïûœ'¬‰]?ïû™œø ?ïû™–ý]?ïû— –'¼?ïû—›z2?ïû”yŠºZ?ïû”s K?ïû‘æÏM©?ïû‘àÔ¡?ïûSMâ?ïûMS6x?ïûŒ¿.ÒT?ïûŒ¹4&·?ïûŠ*TYD?ïûŠ$Y®"?ïû‡”ǧd?ïû‡ŽÌü¾?ïû„þ™£b?ïû„øžù8?ïû‚g´l ?ïû‚a¹Âq?ïûÐo®?ïûÊÆ|?ïû}7áFì?ïû}1æž6?ïûzžîp¶?ïûz˜óÈ}?ïûxQË ?ïûwÿW#O?ïûuk ½ƒ?ïûueB?ïûrÐ ¯ã?ïûrÊ& ?ïûp4‡]z?ïûp.Œ·3?ïûm˜B5È?ïûm’Gþ?ïûjûZPN?ïûjõ_«?ïûh]ÁÊô?ïûhWÇ&%?ïûe¿‰bò?ïûe¹Ž¾ ?ïûc ªàÒ?ïûc°<ý?ïû`'µ?ïû`{-Ä?ïû]áP?ïû]Û­¥?ïû[@)ñë?ïû[:/O?ïûXžª¯Ô?ïûX˜° ö?ïûUü›¿'?ïûUö¡Ç?ïûSYï_c?ïûSSô¾?ïûP¶—ä?ïûP°C£?ïûNµP?ïûN º`j?ïûKn"dÄ?ïûKh'Å]?ïûHÈð©T?ïûHÂö k?ïûF#(Í?ïûF..¯?ïûC|ÄÀ?ïûCvÊ"#?ïû@Õ¾|g?ïû@ÏÃÞû?ïû>.-ý?ïû>(3`-?ïû;…þ?ïû&/ü?ïû&)‡c«?ïû#‚!®y?ïû#|'ˆ?ïû Ô"c¬?ïû Î'Ì?ïú_û–%Ú?ïú]›;ª?ïú] ÈÑ?ïúZ2Ú7a?ïúZ,ßÅ?ïúWJNÁ,?ïúWDTOi?ïúTaƒO?ïúT["?ïúQwI2?ïúQq ؇?ïúNŒ`ï‚?ïúN†fb?ïúK¡=i?ïúK›ÍÕ?ïúH´Ú1?ïúH®ß°(?ïúEÇí«F?ïúEÁó<É?ïúBÚS£Þ?ïúBÔY5î?ïú?ìW*?ïú?æ éÆ?ïú<üùDí?ïú<öþØ?ïú: B‡?ïú:G³;?ïú7ÆÄ}?ïú7ÌX¿?ïú4+œá ?ïú4%¢uÛ?ïú19Å¡(?ïú13Ë6ƒ?ïú.G-ÊÇ?ïú.A3`°?ïú+Sä0]?ïú+MéÆÒ?ïú(_ê¿?ïú(YïšÁ?ïú%k9¯º?ïú%e?GJ?ïú"uáöÂ?ïú"oçŽà?ïúÝB?ïúyâÚ¿?ïú‰@¬?ïúƒ$Ùå?ïú‘¯ð ?ïú‹µ‰Ô?ïú™ž–?ïú“£žë?ïú ÏºÆ?ïúšÕUª?ïú§FV8?ïú¡Kñª?ïú ­+mì?ïú §1 í?ïú ²WÜt?ïú ¬]y?ïú¶ÓšÂ?ïú°Ù7à?ïúº´ˆ?ïú´¹ž4?ïú½ØÆ@?ïú·Þd|?ïùþÀP”¢?ïùþºV3m?ïùûÂ*¼?ïùû¼/¥?ïùøÃXö“?ïùø½^–|?ïùõÃ×üî?ïùõ½Ýg?ïùòÃÂýn?ïùò½Èžv?ïùïÂóC"?ïùï¼øäº?ïùìÁ~ "?ïù컃­J?ïùé¿qÚ ?ïùé¹w|Â?ïù漨"…?ïù涭ÅÍ?ïùã¹Iò‰?ïùã³O–a?ïùàµXh?ïùà¯^#Ñ?ïùÝ°º“t?ïùݪÀ8n?ïùÚ«qz¼?ïùÚ¥w E?ïù×¥Ÿtœ?ïùן¥¶?ïùÔŸ(?ïùÔ™®Ó?ïùÑ—õ™¦?ïùÑ‘û@â?ïùÎ4¶?ïùΊ9Áƒ?ïùˇÇE½?ïùËÌî?ïùÈ~Ñ4`?ïùÈxÖÝP?ïùÅuLl?ïùÅoR9ì?ïùÂk nï?ïùÂe&?ïù¿`[2â?ïù¿Z`݆?ïù¼U?ïù#W5Â?ïù# \ýŸ?ïùàø„?ïùÚýÙú?ïù­÷X ?ïù§ý!?ïùzI¾=?ïùtO‡å?ïùEüéÌ?ïù@´ ?ïùé?ïù ÏÃ?ïùÛw™4?ïùÕ}d¨?ïù ¥G¯¢?ïù ŸM{¯?ïù n};Ž?ïù hƒ5?ïù7¥H?ïù1r‰?ïùþå¸W?ïùøë†3?ïøÿÆFYÇ?ïøÿÀL(=?ïøüŒåñŒ?ïøü†ëÀ?ïøùR÷e?ïøùLüí?ïøötÛY?ïøöz«ž?ïøòÝA•Æ?ïøò×Gf¦?ïøní?ïø@g?ïøìe5j8?ïøì_;aö?ï÷€Cà|Ø?ï÷€=æ“?ï÷|´í…¬?ï÷|®óœ?ï÷y%9$t?ï÷y?;ñ?ï÷u”æ c?ï÷uŽì%‹?ï÷rõAG?ï÷qýûZ?ï÷nrKËð?ï÷nlQåm?ï÷jà°v?ï÷jÚ Êž?ï÷gMœ¼?ï÷gG·?ï÷c¹e?ï÷c³k)•?ï÷`% ô_?ï÷`'‰?ï÷\?À?ï÷\ŠEÜî?ï÷Xú¦¨Ê?ï÷Xô¬ÆK?ï÷Ud}«t?ï÷U^ƒÉ ?ï÷Qͯ’?ï÷Qǵ°Ø?ï÷N62R¼?ï÷N08r@?ï÷Jž,?ï÷J˜#L¯?ï÷Gf.?ï÷Fÿl4 ?ï÷ClB?ï÷Cf &Ê?ï÷?Ò 2!?ï÷?ÌTU?ï÷<7i‹¾?ï÷<1o®Ÿ?ï÷8œ*/²?ï÷8–0S@?ï÷5H©Ö?ï÷4úNÎ?ï÷1cÜó?ï÷1]â5Ú?ï÷-ÆÄhñ?ï÷-ÀÊŽ†?ï÷*)JÑ?ï÷*#q?ï÷&Š¹D?ï÷&„¿k~?ï÷"è)]?ï÷"âPù?ï÷DR§?ï÷>XÏd?ï÷ŸÞ¯"?ï÷™äØ?ï÷ú¨+Û?ï÷ô®U‚?ï÷TÆ–?ï÷NÌ+ì?ï÷®£¥?ï÷¨#Ϊ?ï÷ µI?ï÷ »ªý?ï÷ ^™w\?ï÷ XŸ£¾?ï÷µ¿‚?ï÷¯Å¯#?ï÷ #?ï÷)DP?ïöþaЖ?ïöþ[ÖC?ïöú¶ÌÝ\?ïöú°Ó |?ïö÷ ü*?ïö÷+ú?ïöó^Öú?ïöóX”y?ïöï±Y]3?ïöï«_Žb?ïöì]+†?ïöëýc]e?ïöèT¯û?ïöèN¶-–?ïöä¥cî?ïöäŸi7.?ïöàõQ)º?ïöàïW]«?ïöÝD‹«´?ïöÝ>‘àU?ïöÙ“å?ïöÙW?ïöÕàÞ°?ïöÕÚäæ?ïöÒ-ù*?ïöÒ'ÿMÞ?ïöÎzXÐ?ïöÎt_f?ïöÊÆ8a?ïöÊÀ pw?ïöÇ©¨?ïöÇ âp?ïöÃ[RY?ïöÃUXMÒ?ïö¿¤æ?ž?ïö¿žìyÊ?ïö»íÏL’?ïö»çÕ‡o?ïö¸6+ý?ïö¸0gŒ?ïö´}ŽP?ïö´w”ŒG?ïö°Ä[tž?ïö°¾a±‘?ïö­ Œ”?ïöžRRÌ?ïöžX“?ïöK@‡Ê#?ïöK:Ž?ïöGtýL÷?ïöGoš?ïöC¨Â½?ïöC¢ÈU?ïö?Ûëè;?ïö?Õò:J?ïö<†m ?ïö<Œ¿Ò?ïö8@s3Ð?ïö8:y‡K?ïö4nU=p?ïö4h[‘¢?ïö0›#õæ?ïö0•*JÏ?ïö,Ç!z>?ïö,Á'ÏÞ?ïö(òsK?ïö(ìy¡k?ïö%Yá?ïö% °ð?ïö!FÎm?ïö!@Ôp4?ïöoãJM?ïöié¢Ì?ïö˜K?ïö’QZF?ïö¿Ün‹?ïö¹âÈz?ïöæ·»(?ïöà¾Ï?ïö è+‚?ïöî†á?ïö 2Omí?ïö ,UÊ?ïöWaž?ïöQ¾n?ïö{ ƒX?ïöuàá?ïõþžIX6?ïõþ˜O¶x?ïõúÀØQØ?ïõúºÞ°Ó?ïõöâ§Éò?ïõöÜ®)¦?ïõó½Ôö?ïõòýÄ5c?ïõï$*Øe?ïõï19‹?ïõëCÛ ä?ïõë=álÃ?ïõçbÊ-+?ïõç\ÐÄ?ïõã É>?ïõã{,‘?ïõßžœr[?ïõߘ¢Öh?ïõÛ»lÄ$?ïõÛµs(ë?ïõ××”GùÜ?ïõ> N|?ïõ:ÀJº?ïõ: ÆÍ»?ïõ6 ]?ïõ6 àÛ?ïõ2 ‡ºO?ïõ2Ž>Ð?ïõ.T.b?ïõ-ÿZ³£?ïõ*S£˜?ïõ)úZ)™?ïõ%úŸÙî?ïõ%ô¦`°?ïõ!ô4¨þ?ïõ!î;0€?ïõíü*?ïõç „m?ïõå?ïõß&‘?ïõÜsc?ïõÖyíU?ïõÓì?ïõÍ ¤r?ïõ Èþ·|?ïõ ÃBÄ?ïõ ¾+ÿ;?ïõ ¸2‹D?ïõ²˜ã?ïõ¬ŸoÓ?ïõ¦P"A?ïõ V¯Í?ïôý™\tØ?ïôý“c&?ïôù‹¡?ïôù…§?ïôõ}7zÌ?ïôõw> ž?ïôñnÄá?ïôñhUu?ïôí^:£?ïôíXA4k?ïôéM©û?ïôéG¯§?ïôåt?ïô+avô?ïô'3« è?ïô'-²WL?ïô"ÿ/H†?ïô"ù5ÿ³?ïôÊ¿¾?ïôÄw´?ïô” Ë!?ïôŽƒà?ïô][û:?ïôWb´Â?ïô%õœ?ïôüVb?ïô íÍ=?ïô çÓø9?ïô ´ã¯~?ïô ®êkd?ïô{Qq ?ïôuX.Q?ïô@úã–?ïô;¡?ïóýïÞ?ïóüÿõÇ#?ïóøÊ.­º?ïóøÄ5lË?ïóô§»3?ïóô‡®{?ïóðPwWÇ?ïóðJ~m?ïóì‹nT?ïóì ’/Å?ïóçÓàJ?ïóçÍæ܆?ïó㔉Ž?ïóãŽÈ–?ïóßTxÜž?ïóßN q?ïóÛ«½´?ïóÛ ²‚S?ïóÖÒ'0,?ïóÖÌ-õ–?ïóÒõiô?ïóÒ‰ü0*?ïóÎM $½?ïóÎGë¿?ïóÊ gå€?ïóÊn­N?ïóÅÅÝ8?ïóÅ¿"¥Ò?ïóÁ€͉?ïóÁz–ð?ïó½:\‹t?ïó½4cU¦?ïó¸óï˜Æ?ïó¸íöcÅ?ïó´¬ÑÈ ?ïó´¦Ø“Õ?ïó°eëÓ?ïó°_ ¸l?ïó¬†ÖÒ?ïó¬¤8?ïó§ÓR 0?ïó§ÍX×c?ïó£‰xü›?ïó£ƒË›?ïóŸ>îˆ?ïóŸ8õWé?ïóšó¥,?ïóší¬]Ç?ï󖧶&T?ïó–¡¼÷½?ïó’[?ïó’U#QN?ïóŽ Ë~p?ïóŽÒQt?ïó‰¿Ñèþ?ïó‰¹Ø¼Ñ?ïó…q54^?ïó…k<ÿ?ïó!Ñ%»?ïó×û*?ïó|ÑÔè”?ïó|ËÛ¾Ò?ïóx**?ïóx{1?ïót/È…F?ïót)Ï] ?ïóoÝÇî(?ïóo×ÎÆÑ?ïók‹^Œ?ïók…"8?ïóg7¿D?ïóg1Åí‹?ïóbã½­?ïóbÝÃùÃ?ïó^Œ'?ïó^‰&h ?ïóZ9Â`š?ïóZ3É=O?ïóUãƯ:?ïóUÝÍŒ¿?ïóQ„¿?ïóQ‡&c?ïóM5ÒT'?ïóM/Ù3K?ïóHÝßöõ?ïóH×æÖé?ïóD…MÛä?ïóDT¼¨?ïó@, ˆæ?ïó@&jz?ïó;Ò l?ïó;Ì&èÐ?ïó7w“Ã`?ïó7qš¦•?ïó3f™¢?ïó3m}§?ïó.ÀAª?ïó.º—&€?ïó*d*ž?ïó*^D?ïó&ô¢F?ïó&ûˆ½?ïó!¦yð?ïó! €×å?ïóDÀB?ïó>Ç]?ïóâ@†+?ïóÜGo?ïóm?ïóy +?ïó–?ïó€¯?ïó ¶]¾b?ïó °d©Å?ïóPîÇ–?ïóJõ³Ë?ïóêÂvQ?ïóäÉcY?ïòþƒÙD?ïòþ}à}?ïòú0L©?ïòú7;V?ïòõ³ÕÖ?ïòõ­ÜV?ïòñJ±õ>?ïòñD¸å’?ïòìàÙàƒ?ïòìÚàÑ©?ïòèvM—H?ïòèpT‰B?ïòä Ï?ïòä Áä?ïòߟOg?ïòß™C?ïòÛ2RóÝ?ïòÛ,YèQ?ïòÖÄâa8?ïòÖ¾éV?ïòÒV¸jÅ?ïòÒP¿`á?ïòÍçã`:?ïòÍáêW+?ïòÉxDu6?ïòÉrKlû?ïòŃ´?ïòÅ|M?ïòÀ—Hÿ?ïòÀ‘ Bm?ïò¼%I?ïò¼PÓ?ïò·²à(?ïò·¬ç??ïò³?¾¾b?ïò³9źO?ïò®Ëá?«?ïò®Åè›ÿ%?ïò>–6Ô?ïò:nm`?ïò:uó?ïò5.` ?ïò5Š5sx?ïò1 Mý?ïò1TB?ïò,Â\±?ïò,{ÉqÎ?ïò'ùŠÓW?ïò'ó‘éM?ïò#p«¡ ?ïò#j²·Ù?ïòç2ÁÐ?ïòá9Ùx?ïò]LÝ?ïòW e^?ïòÒ9ÊÏ?ïòÌ@ä*?ïòFÕ¤á?ïò@Ü¿?ïò ºÀÆ€?ïò ´ÇáŽ?ïò. '"?ïò(C ?ïòžS?ïò˜%oÞ?ïñÿ Õür?ïñÿÝ?ïñúzÛ*v?ïñútâHî?ïñõè*2¤?ïñõâ1Qö?ïññT¶¯¹?ïññN½Ïç?ïñìÀŠÆ?ïñ캑<Î?ïñè+œu‚?ïñè%£—f?ïñã•òׇ?ïñãùúF?ïñÞÿ’Y?ïñÞù™}8?ïñÚhrþü?ïñÚbz#r?ïñÕБ+3?ïñÕʘP…?ïñÑ7ÿÏ?ïñÑ2+þ?ïñÌž°;G?ïñ̘·bQ?ïñÈ¥‰Ú?ïñÇþ¬±Á?ïñÃi߯à?ïñÃcæØ£?ïñ¾Îc©?ïñ¾ÈjìH?ïñº2.(J?ïñº,5RÆ?ïñµ•?Ÿ>?ïñµFÊ—?ïñ°÷¥äa?ïñ°ñ­–?ïñ¬YG·œ?ïñ¬SNä¯?ïñ§º7+]?ïñ§´>YM?ïñ£tü3?ïñ£|+?ïñžyðŸQ?ïñžs÷Îü?ïñ™ØÀoÃ?ïñ™ÒÇ K?ïñ•6Ø6à?ïñ•0ßhF?ïñ”0t?ïñŽ7H¸?ïñ‹ðÚâ?ïñ‹êáC?ïñ‡LÎC ?ïñ‡FÕw ?ïñ‚¨ ü?ïñ‚¢BÚ?ïñ~©’z?ïñ}ü°È7?ïñy\Þ‘?ïñyV•,?ïñtµ¶Ï­?ïñt¯¾'?ïñp-Àä?ïñp4ù=?ïñke÷½­?ïñk_þöå?ïñf½ª4?ïñf·äK?ïñbn%¼?ïñb u`²?ïñ]i `™?ïñ]c'œn?ïñX¾ Ô?ïñX¸'[ˆ?ïñTn$?ïñT ub$?ïñOf{l?ïñO`¹ß?ïñJ¹ º?ïñJ³à ?ïñF Jà½?ïñFR ð?ïñA\â1¬?ïñAVér¿?ïñ<­Ã¢?ïñ<§ÊY–?ïñ7þ¤_?ïñ7ø ç3?ïñ3M“‘¦?ïñ3GšÕZ?ïñ.œs¦H?ïñ.–zêÜ?ïñ)ꤩ?ïñ)ä«î?ïñ%84Š?ïñ%2;cà?ïñ …Ë‘?ïñ È?ïñÑF÷ ?ïñËN?8?ïñÐ(…?ïñ×q?ïñg©ë?ïña±4à?ïñ ±åô”?ïñ «í?P?ïñûtB?ïñõ{gà?ïñDPñý?ïñ>X>|?ïðÿŒz‚?ïðÿ†ˆÇã?ïðúÔ˜K?ïðúÎ"æŽ?ïðö† ?ïðö Õ1?ïðñaGì´?ïðñ[O<»?ïðì¦ðÇ–?ïðì ø?ïðçëäš×?ïðçåëì¢?ïðã09=M?ïðã*@û?ïðÞsç -?ïðÞmî`½?ïðÙ´TÈ?ïðÙ®†©Dø?ïð {pŒ°?ïð uwëÖ?ïð›±íà?ïð›«ôßì?ïð–ç½ ?ïð–áÄjó?ïð’ÆÕ ?ïð’Î6á?ïðQó#?ïðKUß?ïðˆ„±›?ïðˆ~¸ÿ/?ïðƒ·”v?ïðƒ±›gþ?ïð~éÀ .?ïð~ãÇq›?ïðz:”f?ïðzAú¹?ïðuK÷Ù?ïðuEÿ@¸?ïðp| ï?ïðpv s?ïðk«Vj6?ïðk¥]Óñ£?ïï†8ù7?ïïJb¿L?ïïDjT$?ïï|UØK?ïï|On?ïïw_æ?ïïwY |Í?ïïrh?e?ïïrbFü¶?ïïmp¸ÿ.?ïïmjÀ—¼?ïïhxxqx?ïïhr€ ô?ïïc†t&?ïïcyŽ?ïï^…Ïœf?ïï^×7½?ïïY‹d¬û?ïïY…lI@?ïïTFR?ïïTŠMïÁ?ïïO”e/ü?ïïOŽlÎ?ïïJ—ÒÍ?ïïJ‘ÙŸß?ïïEš‰p‘?ïïE”‘‘?ïï@œ€,2?ïï@–‡Í!?ïï;Æçí?ïï;—ΉË?ïï6žZQX?ïï6˜aô%?ïï1ž/?ïï1˜6¾Î?ïï,Qóñ?ïï,—Y˜?ïï'›Çˆh?ïï'•Ï.?ïï"™x˜T?ïï"“€>à?ïï–}Åœ?ïï…m?ïï’ÓÁÖ?ïïŒÛjA?ïïŽgU?ïïˆnþs?ïï‰Q@?ïïƒXÀŒ?ïï ƒ…ÅZ?ïï }p–?ïï}r?ïïw Áž?ïîÿuÖ²?ïîÿoÞ_;?ïîúmøL›?ïîúgÿú©?ïîõec§°?ïîõ_kV¯?ïîð\o?ïîðV%?ïîëR*L"?ïîëL1ý?ïîæG{¨?ïîæA‚Ìz?ïîá< fÁ?ïîá6(…?ïîÜ0ù°?ïîÜ*­e?ïî×#SˆÏ?ïî×[=v?ïîÒê¯N?ïîÒòdç?ïîÍÑ:X?ïîÍØðã?ïîÇùíÈ?ïîÇó ¥E?ïîÂéT?ïîÂã— ‰?ïî½Ùl>]?ïî½Ós÷¾?ïî¸È—r|?ïî¸ÂŸ,Ð?ïî³·—.?ïî³±Rt?ïó-«?ïúéä?ïî©’e?ïî©Œ"=?ïî¤~œö?ïî¤x˜[?ïîŸje‰X?ïîŸdmHj?ïîšU‰b?ïîšOÚg?ïî•@à‹?ïî•: ¡ƒ?ïî)Ö‘á?ïî#ÞSÍ?ïî‹ýúm?ïî‹ ½L?ïî…ûzÒ:?ïî…õ‚– ?ïî€ãU£?ïî€Ý]gÈ?ïî{Ê{˜U¢Nè?ïî>Oª ?ïî90â¹?ïî9*ê‹.?ïî4 hV?ïî4oðz?ïî.å+`>?ïî.ß34Y?ïî)¾4î"?ïî)¸<Ã3?ïî$–‰Nš?ïî$‘$£?ïîn!gÕ?ïîh)>Ô?ïîDýâì?ïî?ºâ?ïî'&1?ïî.ÿ?ïîð’=a?ïîêšE?ïî ÅC°ä?ïî ¿K‹¿?ïî™@ß?ïî“Gâ³?ïîl€.`?ïîfˆ +?ïíû? ‰í?ïíû9g°?ïíöåÁ:?ïíö íŸô?ïíðâì]?ïíðÜÌ?ïíë²flE?ïíë¬nLð?ïíæ‚Ãî?ïíæ|"¥‘?ïíáQ¹?ïíáKóT?ïíÜW°J?ïíÜ_“ß?ïíÖìí$?ïíÖæõ“?ïíѹȎž?ïíѳÐt$?ïíÌ…îsß?ïíÌöZ^?ïíÇQcUQ?ïíÇKk<É?ïí 2?ïíÂ(‡?ïí¼æ)Œd?ïí¼à1uÎ?ïí·¯‡¸\?ïí·©¢À?ïí²x(<?ïí²r0'|?ïí­@AÚ?ïí­:.2?ïí¨]^?ïí¨e¯?ïí¢Íîød?ïí¢Çöæ°?ïí“͉ ?ïíÕxå?ïí˜Xù{Ê?ïí˜Sl ?ïí“wLÒ?ïí“> ?ïíáG¨Î?ïíÛO›?ï툤glá?ï툞o`?ïíƒf×F÷?ïíƒ`ß;!?ïí~(”4?ïí~"œ Y?ïíxé¦'Ö?ïíxã®÷?ïísª X„?ïís¤OŸ?ïíni¹¿4?ïíncÁ·K?ïíi(Èþ?ïíi"Ð?ïícç"âP?ïícá*Ü^?ïí^¤ÎÍ8?ïí^žÖÈA?ïíYaÐA~?ïíY[Ø=ƒ?ïíT$$Q?ïíT,!S?ïíNÙÎîe?ïíNÓÖìc?ïíI”ÑN(?ïíIŽÙM!?ïíDO ›â?ïíDI(›Ø?ïí?Åý?ïí?Íï?ïí9ÁÇãª?ïìHýG›?ïìC˜òù¨?ïìC’û)œ?ïì>.ås?ïì>( k?ïì8ÂZ½?ïì8¼b¸?ïì3VQž?ïì3P „œ?ïì-èþÏ ?ïì-ã?ïì({J°?ïì(uRå?ïì# Ý—û?ïì#åÎ?ïìÃ4ã?ïì—Ëkñ?ïì-ÿØÊ?ïì(Ü?ï콌ԥ?ïì·• »?ïì Ln{?ïì Fvµ1?ïìÚ¡Ê*?ïìÔªI?ïìh'j×?ïìb/¦û?ïëüôü]ù?ïëüï›"?ïë÷(f?ïë÷{0Û”?ïëò ¬Ð‰?ïëòµ¼?ïëì—…øf?ïëì‘Ž8ž?ïëç!±7?ïëç¹Yu?ïëá«.ÚÓ?ïëá¥7?ïëÜ3ÿë?ïëÜ..g?ïëÖ¼3…4?ïëÖ¶;É‚?ïëÑC°ÓA?ïëÑ=¹•?ïëËʇ?ïëËÄX]?ïëÆPºŒ?ïëÆJÂÔì?ïëÀÖ=eB?ïëÀÐE­¨?ïë»Y#c ?ïë»S+¬z?ïëµÚ¸&?ïëµÔÀpz?ïë°[ˆ¬?ïë°UË'?ïëªÛœQ?ïëªÕ¤Š?ïë¥Z÷Õì?ïë¥U#v?ïëŸÙ”eÏ?ïëŸÓœ´`?ïëšWv=?ïëšQ~Œ©?ïë”ÔöV?ïë”ΦFö?ïëQí¢?ïëK ?K?ïë‰Ì²þN?ïë‰Æ»Pþ?ïë„G¨Ã?ïë„A±Õ?ïë~ÁÛýT?ïë~»äR?ïëy;X$I?ïëy5`z?ïës´!o«?ïës®)Æ}?ïën,*…?ïën&2__?ïëh£yÂö?ïëh‚Ú?ïëc>{?ïëc˜g?ïë]éàâ?ïë]‰ò;Ø?ïëX³"?ïëWÿ!?ïëRy…?ïëRsx$?ïëLí6ée?ïëLç?Gv?ïëG`7"”?ïëGZ?°?ïëA҂Ɇ?ïëAÌ‹)«?ïë—?ïë6´å°€‰¼?ïéÞ8‰,[?ïéØa”.?ïéØ{j7à?ïéÒËö×?ïéÒ½”››?ïéÍJ:?ïéÌÿð?ïéÇE¿&Ú?ïéÇ?ÇÍÄ?ïéÁ…Ŭ±?ïéÁÎT¯?ïé»Åu¾?ï黿Ï?ï鶳 e?ïéµý»µ‰?ïé°A—ŸR?ïé°; JŠ?ïéª~Í1>?ïéªxÕÝŠ?ï餻Mkø?ï餵VW?ïéž÷_€?ïéžñ% ô?ïé™2:¤¦?ïé™,CT.?ïé“l›á?ïé“f£±}?ïé¦HoÜ?ïé Q!Œ?ïé‡ßJsÄ?ïé‡ÙS&‰?ïé‚bô?ïé‚™Î?ïé|O%4ú?ïé|I-éè?ïév† öÌ?ïév€¬Ï?ïép¼=ël?ïép¶F¢„?ïéjñ¼!¾?ïéjëÄÙë?ïée&’‰?ïée ›BG?ïé_Z­T?ïé_TµÏ¬?ïéYŽ—´?ïéYˆ&S!?ïéSÀá9²?ïéSºéö5?ïéMòêÙG?ïéMìó–ß?ïéH$L@u?ïéHTÿ$?ïéBTÿ, ?ïéBOëå?ïé<„ý\ö?ïé<Ñ?ïé6´U'L?ïé6®]é=?ïé0âüÞ?ïé0Ý¡&?ïé+îF‚?ïé+ ÷ ¡?ïé%>;„?ïé%8Cá¹?ïéjÖL?ïédße?ïé–Ãß‚?ïé̦å?ïé I“?ïé¼ ?ïé ì¦Qu?ïé æ¯?ïé’+§?ïéšöP?ïé?ÖI¯?ïé9ßo?ïèühlw?ïèübuCí?ïèöNƒE?ïèöŠWQ4?ïèð·‘~A?ïèð±šMH?ïèêÞ+Ì‘?ïèêØ4œ¯?ïèåL§Q?ïèäüUxˆ?ïèß%sx?ïèß#EÇ?ïèÙG-;'?ïèÙA6?ïèÓh{Yá?ïèÓb„.c?ïè͉–L?ïè̓kæ?ïèǨñKÿ?ïèÇ¢ú"³?ïèÁÈ §“?ïèÁÂ`?ïè»ælm(?ïè»àuF?ï趒?ïèµþl‘?ïè° û{X?ïè°Vr?ïèª=(‚Ð?ïèª71_?ïè¤X£á?ïè¤R«Þ/?ïèžsZ–?ïèžmct€?ïè˜]ah?ï蘇f@ê?ïè’¦«òò?ïè’ ´Ó?ï茿5ó??ï茹>Ô÷?ïè†× Þ?ïè†ÑÁQ?ïè€î'"ú?ïè€è0ç?ïè{ˆµ?ïèzþ‘š"?ïèu2'Î?ïèu; ñ?ïèo/*̸?ïèo)3³ö?ïèiC^úÈ?ïèi=gã"?ïècVã?ïècPìjŠ?ïè]i®Õô?ïè]c·À„?ïèW{ÁÓ?ïèWuÊy?ïèQšJ?ïèQ‡(‡?ïèKÉŽ‚?ïèK—Ò|f?ïèE­¹E!?ïèE§Â4!?ïè?¼ö ´?ïè?¶þûÑ?ïè9Ë€u|?ïè9ʼnfµ?ïè3ÙOè?ïè3ÓW÷>?ïè-æl`Ñ?ïè-àuTC?ïè'òÙ–?ïè'ìâ%?ïè!þ‹¾²?ïè!ø”´^?ïè …Z?ïèŠ|$?ïèÕÏe?ïè ÞÇL?ïèk*?ïèt .?ïè &Kép?ïè Tã’?ïè. V?ïè(ˆ›•?ïçþ6t?ïçþ0 Ñ?ïçø<Ç@ü?ïçø6Ð>w?ïçòBã[?ïçò<ìô?ïçìHMOî?ïçìBVO¥?ïçæLü·j?ïçæG¸??ïçàQ~,?ïçàK €?ïçÚTXO?ïçÚNa’b?ïçÔVõ…ž?ïçÔPþ‰Ï?ïçÎXíðd?ïçÎRöõ³?ïçÈZ1Ã?ïçÈT:É?ïçÂZÈ<7?ïçÂTÑCÅ?ïç¼Z® 2?ïç¼T·¨Þ?ïç¶Yì*o?ïç¶Sõ4;?ïç°Xw|“?ïç°R€‡~?ïçªVaÄ?ïçªPjÐ?ïç¤S—±h?ïç¤M ¾“?ïçžP°?ïçžJû?ïç˜Kì8Û?ïç˜EõHF?ïç’G’Ò?ïç’A%£\?ïçŒAšøà?ïçŒ;¤ ‹?ïç†;u>w?ïç†5~QC?ïç€4›tÜ?ïç€.¤ˆÈ?ïçz- ë1?ïçz'>?ïçt$è‹Ñ?ïçtñ¡þ?ïçnên?ïçn¼?ïçhÖÙ?ïçh ßñÿ?ïçbR B?ïçaþ[$Ò?ïç[öüø?ïç[ñ0ª?ïçUèó8·?ïçUâüTŠ?ïçOÚ.c?ïçOÔ76Y?ïçIÊ°\?ïçIĹ­t?ïçCºmúÅ?ïçC´wÿ?ïç=©}óÇ?ïç=£‡#?ïç7—ÍF_?ïç7‘ÖgÞ?ïç1…UîY?ïç1_ú?ïç+r,3‰?ïç+l5WM?ïç%^FÅß?ïç%XOêÆ?ïçIœZ3?ïçC¥€=?ïç4Dxö?ïç.M $?ïç2*?ïç;µz?ïç `–~?ïç i¿ò?ïçïÜ?Â?ïçéåjY?ïçטûp?ïçÑ¢'+?ïæú¾å€?ïæú¸§_?ïæô¤õ\ ?ïæôžþŠ?ïæÁb?ïæî„Žð‰?ïæèo\»õ?ïæèieì@?ïæâS‡ë¯?ïæâM‘?ïæÜ6þ ?ïæÜ1B4?ïæÖ²¨r?ïæÖ»Ü*?ïæÏû¹ÚÏ?ïæÏõí?ïæÉÝ(D?ïæÉ×^G?ïæý”6?ïæ÷Ô^?ïæ½|Úh?ïæ½—†µ?ïæ·|¬áb?ïæ·v¶Ô?ïæ±["?ïæ±U+<š?ïæ«8à¾?ïæ«2éJz?ïæ¥êØn?ïæ¥ôQ?ïæžòBî¨?ïæžìL,°?ïæ˜Íì F?ïæ˜Çõ_t?ïæ’¨Ý?B?ïæ’¢æ–?ï挃 "˜?ïæŒ}d?ïæ†\–P?ïæ†VŸ’´?ïæ€5o›?ïæ€/xÞË?ïæz Û¼?ïæz™ ª?ïæså[þ?ïæsß ¢?ïæm»ÁoU?ïæmµÊ¶?ïæg‘Ê/?ïæg‹Ówi?ïæag)»?ïæaa2fE?ïæ[;Õá?ïæ[5Þ`’?ïæUÈ7 ?ïæU уx?ïæNãtu?ïæNÝÁt?ïæHµ°8¾?ïæH¯¹†æ?ïæB‡’Þä?ïæBœ.3?ïæ&?ïæ Ä.—â?ïæ•G)?ïæPƒÿ?ïåþ_¸Mx?ïåþYÁ©…?ïåø)v R?ïåø#i‰?ïåñò‘X?ïåñìš^¸?ïåëºù¸2?ïåëµ¼?ïå傰ʹ?ïåå|º+l?ïåßH%Šy?ïåßB.ìW?ïåÙ G0?ïåÙPh7?ïåÒϨñ?ïåÒɲU8?ïåÌ’Rct?ï嚌öL?ï嚆ÿ?ïå”IV/?ïå”C Æ?ïåŽVêŠ?ïåþ`[™?ï凾êûW?ï凸ôm’?ïåxÆpH?ïårÏã¯?ïå{1í3?ïå{+ötÇ?ïåtêL"ô?ïåtäU˜´?ïån¢ü>?ïånœ s+?ïåhXõØ‘?ïåhRÿPª?ïåb4É8?ïåb >B~?ïå[Äį?ïå[¾Î)Ž?ïåUy–8?ïåUsŸ³¯?ïåO-°Fù?ïåO'¹ÃÇ?ïåHáfb?ïåHÛä]?ïåB“¼ö‘?ïåBÆuº?ïå#¤?ï䊟­Â?ï䊙·c¢?ïä„=qkH?ïä„7{?ïä}Ú†LŽ?ïä}Ôð?ïäwvìô÷?ïäwpöš?ïäq©ø?ïäq ²·L?ïäj­®º…?ïäj§¸b ?ïädH…¨?ïädB$.`?ïä]áÊÄ=?ïä]ÛÔn(?ïäWzÏ–h?ïäWtÙA…?ïäQ9s?ïäQ BÀÂ?ïäJ©U,Þ?ïäJ£^Ú`?ïäD>©?ïäD8#W¼?ïä=Ò,>?ïä=Ì5¿&?ïä7e}X”?ïä7_‡ °?ïä0ø?Â?ïä0òò?ïä*‰÷|«?ïä*„0.?ïä$Û?ïä$Ï?ïä«sc›?ïä¥}‡?ïä;²Î?ïä5)iî?ïäÊc?ïäÄÑ·?ïä X>Ò†?ïä RHŒ?ïäå¸Þ?ïäß™L?ïãýrpIð¿?ïãÖ¯ŸlÔ?ïãÖ©©0?ïãÐ7GŸ=?ïãÐ1Qc£?ïãɾ:¢?ïãɸDh?ïãÃDxû?ïãÃ>‚ÂR?ïã¼ÉöÞ¶?ïã¼Ä¦¾?ïã¶NÄ8?ïã¶HÎ[?ïã¯ÒÕ>?ïã¯Ìß?ïã©V-‹è?ïã©P7W“?ïã¢ØÙóO?ïã¢ÒãÀ0?ïãœZÅw6?ïãœTÏEO?ïã•ÛöÆ?ïã•Ö•R?ïã\}¿Ä?ïãV‡J?ïãˆÜQ³ã?ïãˆÖ[… ?ïã‚[cÔŽ?ïã‚Um§ƒ?ïã{ÙÊ ¤?ïã{ÓÓôÐ?ïãuWxÛô?ïãuQ‚±X?ïãnÔv®k?ïãn΀…?ïãhPÇ-¼?ïãhJÑ?ïãaÌUv^?ïãaÆ_Oi?ïã[G1^[?ïã[A;8ž?ïãTÁd—þ?ïãT»nsy?ïãN:àb$?ïãN4ê>×?ïãG³¢9?ïãG­¬?ïãA+¹é‹?ïãA%ÃÈ°?ïã:£Ò?ïã:(²ì?ïã4ÈW¸?ïã4Ò9N?ïã-Ã5P?ïã-‰Í?ïã'þÀ?ïã&ÿâÈ?ïã y©-?ïã s²çn?ïãí‘÷?ïãç›Þ?ïã`Ë\$?ïãZÕCØ?ïã ÓO¤€?ïã ÍYn?ïãE.Œø?ïã?8w ?ïâÿ¶\uh?ïâÿ°f`É?ïâù&Íä?ïâù ×°??ïâò–›Ký?ïâò¥9Ò?ïâì¹rÜ?ïâëÿÃaì?ïâåt%º‚?ïâån/ªÌ?ïâÞá潊?ïâÞÛð¯?ïâØNöö¤?ïâØIéc?ïâÑ»Pã?ïâѵZׇ?ïâË'La?ïâË!A–?ïâÄ’}À?ïâÄŒ$t0?ïâ½üs &?ïâ½ö}Ñ?ïâ·f Œ?ïâ·`*„è?ïâ°Ï,™Ö?ïâ°É6“ø?ïâª5õ«W?ïâª/ÿ¦´?ï⣛xl>?ï⣕‚h×?ïâCªÃ?ïâœúM¨˜?ïâ–dBÄý?ïâ–^LÄ?ïâÇšsM?ïâÁ¤sœ?ïâ‰*-Ã?ïâ‰$7 N?ïâ‚‹ûÍ?ï₆•?ïâ{í,?ïâ{ç!0?ïâuMxwŠ?ïâuG‚|Ë?ïân­ÝÍ?ïân§&äL?ïâh ¼É?ïâhÄ…?ïâaj9Žg?ïâadC—`?ïâZǬְ?ïâZÁ¶àç?ïâT$kŠ?ïâTu$ÿ?ïâM€eÒ\?ïâMzoß?ïâFÛ¦‡F?ïâFÕ°•7?ïâ@69ºu?ïâ@0CÉ£?ïâ9 êà?ïâ9ŠûL?ïâ2éœÊ?ïâ2ã'®u?ïâ,A„N–?ïâ,;Ža?ïâ%™-…O?ïâ%“7™w?ïâðÃ3?ïâê&Øš?ïâFX‡8?ïâ@bÞ?ïâ›ÞTr?ïâ•èlW?ïâ 𮬶?ïâ ê¸ÅÚ?ïâDÍì?ïâ>×)O?ïáý˜%?ïáý’/.µ?ïáöêÃ2´?ïáöäÍO—?ïáð<¹ÙÝ?ïáð6Ã÷ÿ?ïáéô¤Æ?ïáé‡þÄ(?ïáâÞwØ?ïáâØ4y?ïáÜ.M—?ïáÜ(W¸ñ?ïáÕ}fΫ?ïáÕwpñÍ?ïáÎËÉ5t?ïáÎÅÓYÖ?ïáÈ~=f?ïáȈc ?ïáÁftŽ?ïáÁ`~´ø?ïẲµš“?ïẬ¿Â¸?ïá³þS¼‚?ïá³ø]åç?ïá­I1¼x?ïá­C;ç?ïᦓY Œ?ïá¦c7s?ïáŸÜÓ®?ïáŸÖÝC×?ïá™% `(?ïᙪŽ’?ïá’mµ­?ïá’g¿½X?ïድ!÷Ê?ïዯ,(·?ïá„ûÎl"?ïá„õØžQ?ïá~AÍ9?ïá~;×l‡?ïáw‡ìY?ïáw&! ?ïáp˽ÿä?ïápÅÈ5Ù?ïáj¨"ì?ïáj ²Z$?ïácRæ°?ïácLðèŒ?ïá\•nYj?ïá\x“'?ïáU×EŽÈ?ïáUÑOÉÈ?ïáOu°ì?ïáOí.?ïáHXðÌ?ïáHRú¿Q?ïáA˜³–I?ïáA’½Õ?ïá:×Üñ¡?ïá:Ñç1­?ïá4I¶ö?ïá4SøE?ïá-T ò?ïá-N_„?ïá&‘$¨j?ïá&‹.ì@?ïáÍûÅ?ïáǘ@Þ?ïá ?ËZ?ïáJ·?ïáDFcl?ïá>P« ?ïá ~ŸYÑ?ïá x©¢·?ïá¸HE½?ïá²Rç?ïàýïÕ>¸?ïàýéߊ&?ïà÷&ó?ïà÷ N¦?ïàð[”ô?ïàðUŸB?ïàéXá¬?ïàéŠc0é?ïàâÄd5?ïàâ¾nf·?ïàÛ÷®@ð?ïàÛñ¸’¸?ïàÕ*Cš?ïàÕ$Mí?ïàÎ\!­á?ïàÎV,4?ïàÇ=@í?ïàLJG–†?ïàÀ½¢ˆw?ïàÀ·¬ßV?ïà¹íOó?ïà¹çYk?ïà³4¼é?ïà³?T?ïà¬JkkÁ?ïà¬DuÆs?ïà¥wß$?ïà¥qéþ?ïàž¤–=û?ïàžž ›:?ïà—ЙúÑ?ïà—ʤYW?ïàûçë?ïàõòJå?ïàŠ&qõ2?ïàŠ |VF?ïàƒPM•?ïàƒJWfð?ïà|ye,?ïà|so2?ïàu¡É€L?ïàu›Óå6?ïànÉz|¦?ïànÄâØ?ïàgðlùz?ïàgêw`ó?ïàaª2_?ïàa´› ?ïàZ<5Í?ïàZ6?÷Ö?ïàSaÿ\?ïàS[ j­?ïàL…¥?ïàL%ý>?ïàE¨…¾ž?ïàE¢,€?ïà>Ë1Û?ïà>Å;ñ?ïà7í"CE?ïà7ç,³¸?ïà1ië¤?ïà1t]`?ïà*.úvŽ?ïà*)é“?ïà#N˲$?ïà#HÖ&r?ïàmì¬?ïàg÷B?ïàŒZÑ÷?ïà†eH×?ïàª/?ïà¤|Y?ïàÇ~Î?ïàÁøA?ïàãeÜ°?ïàÝpWm?ïßùÿž ?ïßùù ?ïßóé_b?ïßóóܳ?ïßì4 h·?ïßì.*çR?ïßåM¢sB?ïßåG¬ó'?ïßÞfx¨f?ïßÞ`ƒ)–?ïß×~’8H?ïß×xœºÂ?ïßЕøMR?ïßÐÑ?ïßɬ®J¡?ïßɦ¸Ï±?ïß·‘þ?ïß¼ÂY?ïß»Øà¼?ïß»Òhb?ïß´ì·™ ?ïß´æÂ!þ?ïß®¯[?ïß­ú¹å@?ïߧðçü?ïߧ ûsƒ?ïß &‚‚ò?ïß  Ä?ïß™8gŒÚ?ïß™2rù?ïß’I§9?ïß’C¨6¤?ïß‹Z"tä?ïß‹T-š?ïß„iöxz?ïß„d |?ïß}y»?ïß}s'¦ ?ïßv‡™£?ïßv¤7«?ïßo•dì?ïßon§Ó?ïßh¢|âü?ïßhœ‡z0?ïßa®òéÚ?ïßa¨ý‚Z?ïßZº²žB?ïßZ´½8?ïßSÅÂ>0?ïßS¿ÌÙJ?ïßLÐ-¼?ïßLÊ8X÷?ïßEØÅ´?ïßEÒŠci?ïß>ß}ò|?ïß>Ùˆ‘~?ïß7åÈïS?ïß7ßÓ¤?ïß0ëP?ïß0åZ¯»?ïß)ðÊf?ïß)êmS?ïß"ô(šè?ïß"î3?#?ïß÷€° ?ïßñ‹V)?ïßú«4?ïßô$R ?ïß üFr?ïß ö î™?ïßýy]?ïß÷)"Ò?ïÞÿý…Œú?ïÞÿ÷7¾?ïÞøý7ùM?ïÞø÷B¥`?ïÞñü-¬?ïÞñö8Yÿ?ïÞêúaq,?ïÞêôlÞ?ïÞã÷áû’?ïÞãñì«“?ïÞÜô§<ì?ïÞÜî±î=?ïÞÕð®ØÄ?ïÞÕ깋e?ïÞÎì§,?ïÞÎæ[?ïÞÇæÅV?ïÞÇà¨z–?ïÞÀà€\ ?ïÞÀÚ‹ž?ïÞ¹Ù²‘¦?ïÞ¹Ó½I‡?ïÞ²Ò#Ûu?ïÞ²Ì.”¦?ïÞ«ÉÔ·H?ïÞ«ÃßqÊ?ïÞ¤ÀÖ¢;?ïÞ¤ºá^?ïÞ·Á?ïÞ±)~*?ïÞ–¬­·?ïÞ–¦¸N,?ïÞ¡Œ8?ïÞ›–Æþ?ïÞˆ•¯Pö?ïÞˆº ?ïÞ‰‘T?ïÞƒ(S¼?ïÞz{ß½–?ïÞzuêO?ïÞsmßµ×?ïÞsgêzâ?ïÞl_,°?ïÞlY6Þ ?ïÞeOÈ0Ñ?ïÞeIÒø€?ïÞ^?¦a?ïÞ^9±*?ïÞW.Òn±?ïÞW(Ý9?ïÞPRx ?ïÞP]C°?ïÞI >\?ïÞI T?ïÞAø …0?ïÞAò+Sz?ïÞ:ä}™x?ïÞ:Þˆi?ïÞ3Ð%V$?ïÞ3Ê0'?ïÞ,»8Œ?ïÞ,µ# Ï?ïÞ%¥aü“?ïÞ%ŸlÐ)?ïÞŽ÷Þž?ïÞ‰³‡?ïÞwÔ¾ ?ïÞqß”H?ïÞ_þ·•?ïÞZ %?ïÞ GvH®?ïÞ A!‘?ïÞ.9 Á?ïÞ(Cúù?ïÝûP'ˆ?ïÝû[?ïÝóù¹ =?ïÝóóÃè?ïÝìÞfFÉ?ïÝìØq$ü?ïÝåÂi(y?ïÝå¼t?ïÝÞ¥¶ùø?ïÝÞŸÁÚÔ?ïÝ׈Sû?ïÝׂ]é+?ïÝÐjKÉ?ïÝÐdV­?ïÝÉKŽ*–?ïÝÉE™p?ïÝÂ, A?ïÝÂ&+'E?ïÝ» V´?ïÝ»>8?ïݳë=é,?ïݳåHÒ?ïݬɿLô?ïݬÃÊ7"?ïÝ¥§—õ®?ïÝ¥¡¢á2?ïÝž„ÂÌÓ?ïÝž~͹¬?ïÝ—a@Q-?ïÝ—[K?\?ïÝ=Êœ?ïÝ7º ?ï݉2“û?ï݉=„Ö?ïÝñE5ß?ïÝëP(?ïÝzÉxW?ïÝzÃkÞ?ïÝs  ?ïÝsš*ôÞ?ïÝlvqC?ïÝlp|95?ïÝeL G­?ïÝeF?9?ïÝ^ ãc?ïÝ^î\a?ïÝVôüÕê?ïÝVïÐ$?ïÝOÈ`k¢?ïÝOÂkg4?ïÝH›™1?ïÝH•–?ïÝAl÷+¢?ïÝAg)â?ïÝ:>.ç?ïÝ:89?ïÝ3¨Œ´?ïÝ3³¤?ïÝ+Þdh™?ïÝ+Øojá?ïÝ$­dÚ-?ïÝ$§oÝÍ?ïÝ{­ã?ïÝu¸"Ü?ïÝI8 „?ïÝCC&Õ?ïÝl~?ïÝt'?ïÝâ.eˆ?ïÝÜ9nŠ?ïÝ­ƒí?ïݧšŽH?ïÜùx@N­?ïÜùrKZa?ïÜòB-âê?ïÜò<8ï÷?ïÜë cÇþ?ïÜënÖe?ïÜãÓå82?ïÜãÍðGò?ïÜÜ›²ª,?ïÜÜ•½»F?ïÜÕbÁ‹¼?ïÜÕ\Ìž/?ïÜÎ) ®?ïÜÎ#+4{?ïÜÆîÌ4?ïÜÆè×2[?ïÜ¿³¸1^?ïÜ¿­ÃGß?ïܸwøš?ïܸr7u?ïܱ;{Ør?ïܱ5†ñ§?ïÜ©þA¼?ïÜ©øL0L?ïÜ¢ÀXÓ¬?ïÜ¢ºcï–?ïÜ›¸ˆ¿?ïÜ›{æ?ïÜ”Bcn?ïÜ” ê?ïÜw84÷?ïÜoû4ù?ïÜoõ@€?ïÜh·¤¬D?ïÜh±¯Ó?ïÜashYm?ïÜams?ïÜZ.rŇ?ïÜZ(}ï?ïÜRèÄl ?ïÜRâÏ–á?ïÜK¢n4??ïÜKœy`s?ïÜD[`*X?ïÜDUkWè?ïÜ=…ð?ïÜ= ¨´Ü?ïÜ5Ë1°®?ïÜ5Å<à÷?ïÜ.‚ —?ïÜ.|3=?ïÜ'84Õ?ïÜ'2?Ð×?ïÜí¬ˆ­?ïÜç·½ ?ïÜ¢t÷t?ïÜœ€-0?ïÜVˆï?ïÜP”&§?ïÜ öŽ†?ïÜ Æý?ïܼ°«Q?ïܶ»å&?ïÛûnµG?ïÛûhÀCy?ïÛô m?ïÛôBý?ïÛìй­Q?ïÛìÊÄë??ïÛ倰é?ïÛåz»F5?ïÛÞ/ú¸‰?ïÛÞ*ù3?ïÛÖÞ—„^?ïÛÖØ¢Æf?ïÛÏŒ| ?ïÛφ‡Jr?ïÛÈ9»Â?ïÚ™D¹À¬?ïÚ™>Å>?ïÚ‘Ñÿö9?ïÚ‘Ì u?ïÚŠ^'0?ïÚŠX˜§b?ïÚ‚êiΤ?ïÚ‚äuP:?ïÚ{u‘ ?ïÚ{oœŽ?ïÚt¨w?ïÚsú ,×?ïÚl‰Á_?ïÚlƒÌ¥$?ïÚeÕä?ïÚe á?ïÚ]›3ÅX?ïÚ]•?Mç?ïÚV"Ü7Ã?ïÚVçÁ¸?ïÚN©Ú@?ïÚN£å‘š?ïÚG0¬˜?ïÚG*)9Y?ïÚ?µ²Ij?ïÚ?¯½×‘?ïÚ8:•ª+?ïÚ84¡9·?ïÚ0¾ÅŠ?ïÚ0¸Ñ.}?ïÚ)BJ”Á?ïÚ)?ïÙ¸•Ë§?ïÙ±?Y§?ïÙ± Kx?ïÙ©ˆIY?ïÙ©‚ ó“?ïÙ¡ý°ù?ïÙ¡÷\œ?ïÙšqXHÓ?ïÙškcõß?ïÙ’äì8ì?ïÙ’Þ÷çb?ïÙ‹WÂN·?ïÙ‹QÍþ–?ïÙƒÉàA»?ïÙƒÃëó?ïÙ|;F÷?ïÙ|5R4©?ïÙt«ð:g?ïÙt¥ûîƒ?ïÙmåÃP?ïÙmñxÖ?ïÙe‹À'?ïÙe…#w?ïÙ]ùŽŠ?ïÙ]óšBa?ïÙVgRvá?ïÙVa^0¥?ïÙNÔaTÒ?ïÙNÎm?ïÙG@®om?ïÙG:º,?ïÙ?¬Iþ¤?ïÙ?¦U¼¨?ïÙ8)ðL?ïÙ85¯»?ïÙ0N¶ð?ïÙ0{ZwË?ïÙ(êÀ¤«?ïÙ(äÌfñ?ïÙ!SxJð?ïÙ!M„¡?ïÙ»x»ª?ïÙµ„€Æ?ïÙ"σü?ïÙÛJ„?ïÙ ‰bÝÐ?ïÙ ƒn¥Ã?ïÙï;š?ïÙéFãù?ïØûTeÅ"?ïØûNqî?ïØó¸Ó˜ô?ïØó²ße+?ïØìŒã’?ïØ옱5?ïØä’î?ïØäyåþ?ïØÜáã¥?ïØÜÛïu€?ïØÕCz)?ïØÕ=…úé?ïØͤh_ü?ïØÍžt3R?ïØƙՌ?ïØÅþ¥ªO?ïؾd›?ïؾ^qH?ïضÂßÌQ?ïض¼ë£î?ïد újz?ïدC„?ïا~TßÊ?ïاx`ºB?ïØŸÛÖ?ïØŸÕò»?ïؘ7Þˆ?ïؘ1 »Û?ïØ’E«k?ïØŒQŠ,?ï؈ìÝ[8?ï؈æé;f?ïØFÁ‘L?ïØ@Íré?ïØyŸêô@?ïØy™ö×J?ïØqønÆ&?ïØqòzªŸ?ïØjP8­,?ïØjJD“?ïØb§NQ€?ïØb¡Z8Ö?ïØZýºŠŽ?ïØZ÷ÆsS?ïØSSshbS?ï×àÇV?ï×ßûÓUÛ?ï×ØJ—[?ï×ØD£?ï×Ð’±}Ð?ï×ÐŒ½€u?ï×ÈÚM?ï×ÈÔQ?ï×Á ©/|?ï×Áµ5?ï×¹f Ô?ï×¹`›Ï?ï×±«¶ÿR?ï×±¥Ã¿?ïשð&Ÿ?ïשê2¨á?ï×¢3ÛÄÊ?ï×¢-çÐ?ïךvÖÞg?ïךpâë*?ï×’¹4Ž?ï×’³BÃ?ï׊ú›ž?ï׊ô§G?ï׃;eãÆ?ï׃5qôá?ï×{{wóâ?ï×{u„p?ï×sº×@Ø?ï×s´ãTÙ?ï×kùj?ï×kó‹)Þ?ï×d7e˜e?ï×d1q¯L?ï×\t•€Ä?ï×\n¡™?ï×T±;m?ï×T«UBÎj?ï×z÷uu?ï×ušå?ï×°û¼E?ï׫ã*?ï×æCïþ?ï×àPW?ïÖÿßÔ??ïÖÿëþ?ïÖ÷NÅŸ®?ïÖ÷HÑÊñ?ïÖïð§t?ïÖï{üÔ-?ïÖç´k¼?ïÖç®w¾ê?ïÖßæ/#€?ïÖßà;S$?ïÖØ6·>?ïÖØBèX?ïÖÐG{)?ïÖÐA›­¸?ïÖÈw9Ý|?ïÖÈqF‚?ïÖÀ¦$zd?ïÖÀ 0¯à?ïÖ¸Ôf¬¾?ïÖ¸Îrã°?ïÖ±ïÄ?ïÖ°ûûK,?ïÖ©.Ã4†?ïÖ©(Ïne?ïÖ¡Zè˜ ?ïÖ¡TôÓb?ïÖ™†X ?ïÖ™€dIÞ?ïÖ‘±zÒ?ïÖ‘«¹?ïÖ‰Û{H?ïÖ‰Õ%»?ïÖ‚qj=?ïÖþ}«n?ïÖz-¥…?ïÖz'è.?ïÖrUÄ ?ïÖrO??ïÖj|Išz?ïÖjvUà?ïÖb¢Ör?ïÖbœâX?ïÖZÈ·½?ïÖZÂÄ?ïÖRíçt?ïÖRçó¾?ïÖKe§þ?ïÖK qóu?ïÖC6:aŒ?ïÖC0F®{?ïÖ;YVã’?ïÖ;Sc1ù?ïÖ3{Ã7x?ïÖ3uχX?ïÖ+‚UÍ?ïÖ+—Ž§&?ïÖ#¾”?ïÖ#¸™ne?ïÖÞéÌ?ïÖØõ]?ïÖþž!–?ïÖøªwY?ïÖ ¢½ã?ïÖ ¯?ïÖ;ôÊœ?ïÖ6#Q?ïÕüXeÍ.?ïÕüRr'\?ïÕôs˜À`?ïÕôm¥?ïÕìŽ?ïÕìˆc;?ïÕä§Â¯´?ïÕä¡ÏQ?ïÕÜÀ¿Œ7?ïÕܺËìN?ïÕÔØþ$?ïÕÔÓ hµ?ïÕÌðˆö?ïÕÌê•?ïÕÅN‰?ïÕÅZ€?ïÕ½XýŸ?ïÕ½ec ?ïÕµ2³¾8?ïÕµ,À%³?ïÕ­GO° ?ïÕ­A\?ïÕ¥[(8Ò?ïÕ¥U4£D?ïÕnO[Â?ïÕh[ǯ?ïÕ•€»vU?ïÕ•zÇã¾?ïÕ’gï?ïÕŒt]ë?ïÕ…£_”CÌ?ïÕ> Á‹?ïÕ6%RÍ¥?ïÕ6_Lâ?ïÕ..^I®?ïÕ.(jÊg?ïÕ&6´£ž?ïÕ&0Á%Õ?ïÕ>VGX?ïÕ8bË ?ïÕE>¢Ö?ïÕ?K(?ïÕKs ó?ïÕE§£?ïÕPï0ª?ïÕJû¸×?ïÔþUºº,?ïÔþOÇC×?ïÔöYÓª¾?ïÔöSà5è?ïÔî]+{®?ïÔîW8V?ïÔæ_Ï?ïÔæYÛŸ8?ïÔÞaÃÒO?ïÔÞ[Ðaô?ïÔÖc³Š?ïÔÖ]D­?ïÔÎc‰¥~?ïÔÎ]–8 ?ïÔÆc`Œ*?ïÔÆ]m L?ïÔ¾b€^®?ïÔ¾\ŒôN?ïÔ¶`çB?ïÔ¶Zó¦a?ïÔ®^žü^?ïÔ®X«”ü?ïÔ¦[¡[?ïÔ¦U­¹y?ïÔžWòÝV?ïÔžQÿxô?ïÔ–S—^?ïÔ–M£»{?ïÔŽN†Þ?ïÔŽH“|£?ïÔ†HÀ?ïÔ†BÌ°4?ïÔ~BJ’ð?ïÔ~?ïÔ Ÿ4‹ä?ïÔ ™AB?ïÔŽgFP?ïÔˆsþ}?ïÓý{Ê6?ïÓýuÖï¶?ïÓõgâdÂ?ïÓõaïõ?ïÓíS@­…?ïÓíMMj:?ïÓå=Þ›?ïÓå7êÒÔ?ïÓÝ'ÇR ?ïÓÝ!ÔÇ?ïÓÕ÷à?ïÓÕ ¡X?ïÓÌùk:Ð?ïÓÌówý’?ïÓÄáà?ïÓÄÛ)¤V?ïӼȄ$?ïÓ¼Â&Ií?ïÓ´®Z.Õ?ïÓ´¨fö!?ïÓ¬“ßHþ?ïÓ¬ìÏ?ïÓ¤x®$…?ïÓ¤rºîÙ?ïÓœ\ºãl?ïÓœVǯE?ïÓ”@Àñ?ïÓ”:ŽN?ïÓŒ"² ?ïÓŒ¾Ûå?ïÓ„‘'?ïÓƒþÕŒ?ïÓ{å´o:?ïÓ{ßÁA$?ïÓsÆ+gß?ïÓsÀ8;N?ïÓk¥å0?ïÓkŸò ?ïÓc„ä¤õ?ïÓc~ñ{n?ïÓ[c3ú?ïÓ[]@Ò?ïÓS@Âv®?ïÓS:ÏP2?ïÓK•jœ?ïÓK¢E¥?ïÓBù´•ª?ïÓBóÁr8?ïÓ:Õ}"?ïÓ:Ï([6?ïÓ2¯ÊŠÌ?ïÓ2©×jf?ïÓ*‰Ä™?ïÓ*ƒÑz¯?ïÓ"c Ž?ïÓ"]õ4?ïÓ;–}¨?ïÓ5£aÔ?ïÓo&:?ïÓ | í?ïÓ ê•?ïÓ äœ|P?ïÓÀú¤Â?ïÓ»?ïÒù–°¿-?ïÒù½©s?ïÒñk²N=?ïÒñe¿: ?ïÒé?øn?ïÒé:[p?ïÒáµû?ïÒá œ¤×?ïÒØældn?ïÒØàyTÑ?ïÒи“°?ïÒв ´›?ïÒÈŠ  ?ïÒÈ„ ’?ïÒÀZÉ ?ïÒÀTÖ š?ïÒ¸*Ó?ïÒ¸$ßù–?ïÒ¯ú0”7?ïÒ¯ô=ŒA?ïÒ§ÈÎÆP?ïÒ§ÂÛ¿â?ïÒŸ–¼–Ð?ïÒŸÉ‘ê?ïÒ—cúoÍ?ïÒ—^lp?ïÒ0ƒáø?ïÒ*à#?ïÒ†üYXÔ?ïÒ†öfXˆ?ïÒ~Ç}¬:?ïÒ~ÁŠ­v?ïÒv‘ö?ïÒvŒ!Û?ïÒn[´”?ïÒnUÁ˜f?ïÒf$Êiô?ïÒf×oÌ?ïÒ]í$®Â?ïÒ]ç1¶#?ïÒU´Í}\?ïÒU®Ú†F?ïÒM{ǬQ?ïÒMuÔ¶Ä?ïÒEB;ô?ïÒE<Gñ?ïÒ=¨-‡?ïÒ=µ;?ïÒ4Ì––6?ïÒ4Æ£¥G?ïÒ,ÐÍÜ?ïÒ,ŠÝÞw?ïÒ$TY«P?ïÒ$Nf½u?ïÒ4‹?ïÒA;?ïÒÙ]Ü ?ïÒÓjñE?ïÒ šÚY?ïÒ ”ç?ïÒ[¨òD?ïÒU¶ “?ïÑûÃÎî?ïÑûÐèÈ?ïÑòÚpm?ïÑòÔ‹Ó?ïÑê—%?ïÑê‘,Aù?ïÑâSoa ?ïÑâM|€?ïÑÚ]Y?ïÑÚ }a?ïÑÑÉÞ}¦?ïÑÑÃëŸ9?ïÑɃþ(?ïÑÉ~ K&?ïÑÁ=^ó?ïÑÁ7l«?ïѸöù?ïѸð:1?ïÑ°­óð?ïÑ°¨E?ïѨe&‡K?ïѨ_3°›?ïÑ ž>“?ïÑ «ip?ïÑ—Ñ[|š?ïÑ—Ëh©?ïцYÛ:?ïÑ€g 1?ïч:ª‹ù?ïч4·»}?ïÑ~î8]ê?ïÑ~èEŽû?ïÑv¡ ê¥?ïÑv›C?ïÑnS'cØ?ïÑnM4˜?ïÑf‰dñ?ïÑeþ–š«?ïÑ]µ1Tú?ïÑ]¯>ŒA?ïÑUe&É ?ïÑU_4à?ïÑMe]D?ïÑMr—§?ïÑDÂãç?ïÑD¼ñ#?ïÑ=\?ïÐù¿K‡R?ïÐñlŸ%?ïÐñf¬`«?ïÐéI¼?ïÐé ViÑ?ïÐà¹:Zt?ïÐà³G©?ïÐØ^u˜I?ïÐØX‚è~?ïÐÐýŸ`?ïÐÏý ñ%?ïÐǦ˴,?ïÐÇ Ù?ïпIåv?ïпCòV[?ïжìLOÂ?ïжæY¦7?ïЮýEÕ?ïЮˆ Û?ïЦ.ÿl ?ïЦ) Æ6?ïÐÏGK™?ïÐÉT¦À?ïЕnÞËV?ïЕhì(?ïÐ Ãóß?ïÐÑR(?ïЄ«÷-L?ïЄ¦&?ïÐ|IqÂÒ?ïÐ|C$=?ïÐsæ=™”?ïÐsàJü‘?ïÐk‚XºŠ?ïÐk|f?ïÐc¾Ñ@?ïÐcÌ7`?ïÐZ¸r¥O?ïÐZ²€ ?ïÐRRtŸ–?ïÐRL‚Ú?ïÐIëÅ(ø?ïÐIåÒ“Î?ïÐA„dª\?ïÐA~rÄ?ïÐ9NÒB?ïÐ9\@=?ïÐ0³­ï?ïÐ0­|?ïÐ(J1²?ïÐ(D¢Ñ?ïÐß昕?ïÐÙô H?ïÐu ©`»?ïλº†Õ¸?ïλ´”‹?ïγ0çÞ?ïγ*ž¾?ïΪ¤Õž?ïΪžãV?ï΢îf.?ï΢ü @?ïΙŒN§?ïΙ†\b¬?ïÎÿˆ?ïÎù ÐÍ?ïΈp÷q§?ïΈk0…?ïÎâ9Î?ïÎÜGŽˆ?ïÎwRΆ9?ïÎwLÜHJ?ïÎn¯¶?ïÎn¼¼Ëa?ïÎf1Û¸ª?ïÎf+é}ï?ïÎ] R­?ïÎ]š`t^?ïÎUAÐ?ïÎU) I?ïÎL{% Þ?ïÎLu3jò?ïÎCç‰_Ô?ïÎCá—+‚?ïÎ;S6«?ïÎ;MDxJ?ïÎ2¾+™0?ïÎ2¸9h?ïÎ*(vuË?ïÎ*"„FI?ïÎ!’ —?ïÎ!Œå°?ïÎúï*B?ïÎôüýö?ïÎc)`d?ïÎ]75´?ïÎʪì?ïÎĸÃ{?ïÍÿ1}uš?ïÍÿ+‹N!?ïÍö—£±+?ïÍö‘±‹M?ïÍíýÒ?ïÍí÷$ó?ïÍåaØ:?ïÍå[åî”?ïÍÜÅë¢`?ïÍÜ¿ùV?ïÍÔ)OãD?ïÍÔ#]ÃÖ?ïÍËŒžŒ?ï͈€º?ïÍÂîØŸ?ïÍÂè¼j?ïͺNCâI?ïͺHQDZ?ïͱ­Jo©?ïͱ§XV®?ïÍ© –ªß?ïÍ©¤“€?ïÍ i+B3?ïÍ c9,r?ïÍ—ÅøwÒ?ïÍ—Àc®?ïÍ"fþ?ïÍ!Tx?ï͆}s:–?ï͆w)®?ïÍ}غI?ïÍ}Ò!ªþ?ïÍu1ü.„?ïÍu, ×?ïÍl‹(_/?ïÍl…6S ?ïÍcãšú‚?ïÍcݨð?ïÍ[;V­é?ïÍ[5d¥?ïÍR’Tö»?ïÍRŒbï‡?ïÍIèšÎÖ?ïÍIâ¨ÉA?ïÍA>*ã?ïÍA88ß&?ïÍ8’úD?ïÍ8í?ïÍ/çUN?ïÍ/á"T–?ïÍ':|9ò?ïÍ'4Š:Ù?ïÍ$j¼?ï͇2mB?ïÍßuL?ïÍÙ$yq?ïÍ 0Ppê?ïÍ *^v¯?ïÍ€Õ Æ?ïÍzã*?ïÌûЙ0R?ïÌûʧ9V?ïÌó­L|?ïÌó»W ?ïÌênOŽ?ïÌêh[Ò?ïÌỢS²?ïÌáµ°a—?ïÌÙ* ?ïÌÙ›9‘?ïÌÐT¢?ïÌÐNг)?ïÌÇ 4 ?ïË<þgmm?ïË<øuÉú?ïË4'èEÂ?ïË4!ö£ö?ïË+P®Ah?ïË+J¼¡C?ïË"x·€œ?ïË"rÅâ?ïË  !„?ïËš„­?ïËÆžGX?ïËÀ¬¬)?ïËìx5?ïËæ†v­?ïÊÿŸ˜?ïÊÿ ®!?ïÊö6 BÇ?ïÊö0¬?ïÊíYÂí†?ïÊíSÑX÷?ïÊä|Á¹f?ïÊävÐ&?ïÊÛŸŠ]?ïÊÛ™ù?ïÊÒÀ‹Áo?ïÊÒºš1Ø?ïÊÉá^x??ïÊÉÛlêQ?ïÊÁx“h?ïÊÀû‡#?ïʸ Þí¶?ïʸíc?ïʯ?‹/”?ïʯ9™¦¡?ïʦ]öÝ?ïʦWŽo“?ïÊz¿à¦?ïÊtÎ[?ïÊ”—I…?ïÊ”‘WŒŽ?ïÊ‹³n›?ïÊ‹­%ìM?ïÊ‚Î-˜ž?ïÊ‚È<ù?ïÊyè—Å?ïÊy⥛Ë?ïÊqI)@?ïÊpüW«ï?ïÊhAéÊ?ïÊhPn$?ïÊ_3ˆoÞ?ïÊ_-–õâ?ïÊVK¥q?ïÊVE'-?ïÊMaòë¼?ïÊM\u?ïÊDxL?ïÊDr*¤P?ïÊ;ÞÐ?ïÊ;‡œk~?ïÊ2¢D)—?ïÊ2œR·ð?ïÊ)¶J ?ïÊ)°Y ?ïÊ ÉŸg?ïÊ Ã­—?ïÊÜ96¡?ïÊÖGÉû?ïÊî$•F?ïÊè3*K?ïÊÿ_H5?ïÊùmÞæ?ïÉýàËÂ?ïÉý ïd?ïÉô°-Â?ïÉô¾ÇÊ?ïÉë.ÍÏœ?ïÉë(ÜkQ?ïÉâ=7Ú&?ïÉâ7Fw†?ïÉÙJðç¸?ïÉÙDÿ†Ä?ïÉÐWû‘Þ?ïÉÐR 2—?ïÉÇdOY¨?ïÉÇ^]ü?ïɾoõJ?ïɾj%[?ïɵzéú†?ïɵtø D?ïɬ…(¸¬?ïɬ7`?ïÉ£Ž¸Ä„?ïÉ£ˆÇm?ïÉš—“Ú—?ïÉš‘¢…]?ïÉ‘Ÿ¾Ë¼?ïÉ‘™Íx.?ïɈ§<0¬?ïɈ¡JÞÌ?ïÉ®‘V?ïɨA#?ïÉv´ `¤?ïÉv®/?ïÉm¹Ž“‘?ïÉm³Fº?ïÉd¾J £?ïÉd¸XÕz?ïÉ[ÂNÿø?ïÉ[¼]¶}?ïÉRÄ­y|?ïÉR¾¼1¯?ïÉIÅÊq?ïÉI¿ÙGR?ïÉ@Æ0»¬?ïÉ@À?wL?ïȹt¯ˆ?ïȹn½ée?ïÈ°ir× ?ïÈ°c®-?ïȧ]HÌ?ïȧWŽ! ?ïÈžPÒ“‡?ïÈžJámv?ïÈ•Cs«ç?ïÈ•=‚‡‡?ïÈŒ5Wõ©?ïÈŒ/fÒú?ïȃ&„3N?ïȃ “Q?ïÈzúôz?ïÈz Õ/?ïÈq¸4z?ïÈqÇá?ïÈgõÂå8?ïÈgïÑÉP?ïÈ^ä3?ïÈ^Þ(Ó?ïÈUÑ´é¶?ïÈUËÃÑ3?ïÈL¾–h«?ïÈL¸¥QÚ?ïÈCªÆЄ?ïÈC¤Õ»e?ïÈ:–?î,?ïÈ:NÚÀ?ïÈ1 Œ?ïÈ1{Ó?ïÈ(köN?ïÈ(eæH?ïÈTgžK?ïÈNv÷?ïÈ= wu?ïÈ7jÕ?ïÈ $øò?ïÈ ?ïÈ -96?ïÈ?ïÇñØ‚¸?ïÇñÒ‘Šæ?ïÇ轜ð4?ïÇè·«ì?ïÇߢŒ¡?ïÇßœŠ6?ïÇÖ…µ!¾?ïÇÖÄ!?ïÇÍhµà)?ïÇÍbÄá'?ïÇÄJùBy?ïÇÄEE*?ïÇ»,‘¦?ïÇ»&  ?ïDz rׂ?ïDzÝ?ïǨížåA?ïǨç­í?ïÇŸÍ'?ïÇŸÇ+0…?ïÇ–«èÎœ?ïÇ–¥÷ÙÕ?ïÇŠâ?ïÇ„îò?ïÇ„gdÁ‰?ïÇ„asÐ,?ïÇ{DR?ïÇ{>*bq?ïÇr šK?ïÇr/¬Y?ïÇhûw%½?ïÇhõ†9?ïÇ_Öy]?ïÇ_Ð#ŽÖ?ïÇV°Ð?ïÇVªç¿?ïÇM‰?¸?ïÇMƒN!?ïÇDaÏ//?ïÇD[ÞIÊ?ïÇ;9¥vG?ïÇ;3´’™?ïÇ2ÕÁ4?ïÇ2 äßk?ïÆÍíÆž?ïÆÍü÷‡?ïÆÃã=-?ïÆÃÝ"oÎ?ïƺ¯u¯u?ïƺ©„ãÏ?ïƱ{ô¿?ïƱu+*Ñ?ïƨF ?ïƨ@BZ?ïÆŸBYw?ïÆŸ Q’û?ïÆ•Ù¾Þ«?ïÆ•ÓÎç?ïÆŒ¢‡ÿ?ïÆŒœ–Yô?ïƃj’Ð?ïƃd¢Ã?ïÆz1à,þ?ïÆz+ïmf?ïÆpøx.+?ïÆpò‡pM?ïÆg¾Yr?ïÆg¸hKM?ïÆ^ƒ€í`?ïÆ^}2õ?ïÆUGö°|?ïÆUB÷Ê?ïÆL ¯ê?ïÆL¿3 ?ïÆBαDC?ïÆBÈÀ?ïÆ9û ?ïÆ9‹ g?ïÆ0RÊÖ?ïÆ0L ?ïÆ'ec¤?ïÆ' t³–?ïÆÓŠÙË?ïÆÍš+w?ïÆ’ú=??ïÆ ¦?ïÆ Q«T˜?ïÆ Kº©»?ïƯ§è?ïÆ ¾þÅ?ïÅøÌøü?ïÅøÇæ•?ïÅÓ:?ïÅ-Ž?ïÅæEj¯1?ïÅæ?z @?ïÅÝ’~¥?ïÅÜú¡Üp?ïÅÓ»z?ïÅÓµÙ–?ïÅÊt¿G?ïÅÊnΨV?ïÅÁ-ÉAú?ïÅÁ'ؤø?ïÅ·æ7Ý?ïÅ·à'œ˜?ïÅ®»€Š?ïÅ®—Êç?ïÅ¥T¦¢?ïÅ¥N¶ F?ïÅœ ××?ïÅœçA?ïÅ’À\P¥?ïÅ’ºk¼R?ïʼnu+Þe?ïʼno;KÎ?ïÅ€)B˜G?ïÅ€#Rm?ïÅvÜ­¬/?ïÅvÖ½?ïÅm`§*?ïÅm‰pÊ?ïÅdAYÅ‘?ïÅd;i9ï?ïÅZòªv¬?ïÅZì¹ìÇ?ïÅQ£D(d?ïÅQS =?ïÅHS'9T?ïÅHM6²ë?ïÅ?Zl?ïÅ>üiçá?ïÅ5°Þ?ïÅ5ªíœ!?ïÅ,^®k¡?ïÅ,X½êq?ïÅ# Ég?ïÅ#Ùö?ïŸ4*’?ïŲC¬ß?ïÅcîšÄ?ïÅ]þÏ?ïÅû^?ïÅ ãÊ?ïÄý¹Vâ?ïÄý³fk?ïÄôbþq…?ïÄô] úÍ?ïÄë õ~†?ïÄë ?ïÄá´>5Ë?ïÄá®M‘?ïÄØ[Ò–k?ïÄØUâ$ð?ïÄÏ·>j?ïÄÎüÆί?ïÄŨî«)?ïÄÅ¢þ=-?ïļM‚æ?ïļG’yÔ?ïIJðàŽM?ïIJêð#Ñ?ïÄ©“„Ÿ?ïÄ©“®ä?ïÄ 5g~l?ïÄ /wq?ïÄ–Ö—Ôï?ïĖЧo´?ïÄw+?ïÄq9±?ïÄ„ºŒë?ïÄ„Ê+1?ïÄzµ¶·?ïÄz¯Å»¿?ïÄqSûÀk?ïÄqN b3?ïÄgñ>l?ïÄgëáõ?ïÄ^ŽQ„Ó?ïÄ^ˆa*?ïÄU*dv0?ïÄU$tÏ?ïë¨}‹&?ïë¢Qã?ïâ6ã«Þ?ïâ0ót_?ïØęԕ?ïؾ©žÚ?ïÃQœ*²?ïÃK«öº?ïÃ…Ýèî¶?ïÃ…×ø¼ƒ?ïÃ|i€{V?ïÃ|cJè?ïÃrôeDº?ïÃrîu?ïÃi~' ?ïÃixœú%?ïÃ` Gt?ïÃ`T?ïÃVËP˜?ïÃVŠÛ'=?ïÃMÕ·~?ïÃMåè?ïÃC 3R¦?ïÃCšC,Ö?ïÃ:&Úˆ?ïÃ: éÝ}?ïÃ0¬Ê ?ïÃ0¦Ùý½?ïÃ'29þ?ïÃ',~?ïö’’y?ïð¢s¿?ïÃ:i„Ü?ïÃ4ygè?ïà ½„ ?ïà ·ŸhÜ?ïÃ?ü‘?ïÃ: t)?ïÂ÷Á·Cæ?ïÂ÷»Ç,D?ïÂîBÄ0t?ïÂî<Ôš?ïÂäÃR\?ïÂä½+>H?ïÂÛB¿Â?ïÂÛ<Ï u?ïÂÑÁ²?ïÂÑ»Áñ’?ïÂÈ?ô]â?ïÂÈ:O"?ï¾½€I0?ï¾·<7?ïµ:^xê?ïµ4nm¹?﫶2J?ï«°(à?ï¢2zX?ï¢,rµ?Í~?Üþ¤?ïÂ&å?ï õî?ïÂ… M ù?ïÂ…š] ®?ïÂ|Zl?ïÂ|Yè?ïÂr‘ ã?ïÂr‹(?ïÂia¨Ñ?ïÂiq«Þ?ïÂ_~ ú ?ïÂ_x0þá?ïÂUò§šé?ïÂUì·¡ˆ?ïÂLfr˜i?ïÂL`‚ Ñ?ïÂBÙˆ†ª?ïÂBÓ˜Û?ïÂ9KÝC.?ïÂ9EíO(?ïÂ/½uN¯?ïÂ/·…\r?ïÂ&.YP*?ïÂ&(i_·?ïž{q?%Ç?ï åV!?ïÂõiB?ï |˜l:?ï v¨$?ïÁÿꇈ?ïÁÿä žj?ïÁìÄYxæ?ïÁì¾i“.?ïÁã0&Øy?ïÁã*6ôŒ?ïÁÙ›8Š?ïÁÆiFÔ±?ïÁ¼Ø‘É?ïÁ¼Ò+µ?ïÁ³@LY?ïÁ³:\~Š?ïÁ©§ÇOß?ïÁ©¡×v³?ïÁ †˜?ïÁ –À²?ïÁ–t’Ðw?ïÁ–n¢úã?ïÁŒÙè-è?ïÁŒÓøZ?ïÁƒ>€Õ”?ïÁƒ8‘—?ïÁy¢edd?ïÁyœu”3?ïÁp?ïÁoÿ 1©?ïÁfh"¸?ïÁfbV?ïÁ\ÉÅ$’?ïÁ\ÃÕYÆ?ïÁS*Ê-P?ïÁS$ÚdP?ïÁI‹Ƥ?ïÁI…*ÿq?ïÁ?ê·HÉ?ïÁ?äǃc?ïÁ6I›ì¢?ïÁ6C¬)?ïÁ,§É h?ïÁ,¡ÙI›?ïÁ#C?ïÁ"ÿS]?ïÁb[|?ïÁ\J?ïÁ¾ç?ïÁ¸E‚?ïÁg´â?ïÁwúK?ïÀüt  &?ïÀünç\?ïÀòÍú+ˆ?ïÀòÈ tŒ?ïÀé'4¡€?ïÀé!DìR?ïÀ߸M+?ïÀßyÈ™Ë?ïÀÕ׉¤r?ïÀÕÑ™òà?ïÀÌ.©4?ïÀÌ(¹Pp?ïÀÂ…á?ïÀÂ"ïì?ïÀ¸ÚÊòn?ïÀ¸ÔÛFG?ïÀ¯/Ì.œ?ïÀ¯)Ü„D?ïÀ¥„Ôv?ïÀ¥~-+í?ïÀ›×µ®?ïÀ›ÑÅaó?ïÀ’*£€f?ïÀ’$³Û{?ïÀˆ|Ø-G?ïÀˆvèŠ+?ïÀ~Î[œø?ïÀ~Èkû«?ïÀu.(ñ?ïÀu>‰t?ïÀkoP*¨?ïÀki`Œû?ïÀa¾»×h?ïÀa¸Ì;Š?ïÀX w­Þ?ïÀXˆÐ?ïÀN[ð?ïÀNUWÒ?ïÀD¨×?ïÀD¢çm¨?ïÀ:õOZ?ïÀ:ﺽ?ïÀ1Auê?ïÀ1;…‚?ïÀ'Œ¶¤@?ïÀ'†ÇD?ïÀ×L„?ïÀÑ\ôâ?ïÀ!0í+?ïÀA_Ð?ïÀ j`$ü?ïÀ dp™r?ïÀ²â°Æ?ïÀ¬ó' ?ï¿öùÓ¤?ï¿öó㎼?ï¿í?ˆÌØ?ï¿í9™FÂ?ï¿ã„‹4?ï¿ã~œï?ï¿ÙÈÍ”Þ?ï¿ÙÂÞk?ï¿Ð U(œ?ï¿Ðe§ü?ï¿ÆO$·Ï?ï¿ÆI59?‘:þ?‹K?￲Ҕ÷[?￲̥|1?ï¿©6SJ?ï¿© FÙò?ï¿ŸSå+?ï¿ŸM+m¦?ï¿•’E š?ï¿•ŒU–è?ￋй1\?ï¿‹Êɽ|?ï¿‚qŽ§?ï¿‚‚š?ï¿xKpƒ¨?ï¿xEo?ï¿n‡¸nß?ï¿nÉy?ï¿dÃGÙ?ï¿d½X1G?ï¿ZþfÄ?ï¿Zø.ü?ï¿Q8?'º?ï¿Q2O¾Ï?ï¿Gq¦' ?ï¿Gk¶¿ö?ï¿=ªO¬A?ï¿=¤`Fþ?ï¿3âH;‰?ï¿3ÜXØ?ï¿*†j?ï¿*–£Ï?ï¿ P h6?ï¿ Jp?ï¿…غ¯?ï¿é\½?ï¿ ºðZ^?ï¿ µþA?ï¿ïP–÷?ï¿éa<¯?ï¾ù"ûͲ?ï¾ù u??ï¾ïUîHI?ï¾ïOþñ«?ï¾åˆ*d&?ï¾å‚;]?ï¾Û¹°x ?ï¾Û³Á%,?ï¾Ñê‚àà?ï¾Ñä“Â?ï¾Èéh?ï¾È®š?ï¾¾Iÿãƒ?ï¾¾D–?ï¾´x¯7?ï¾´r¿ë{?ﾪ¦¤%º?ﾪ ´Ûó?ï¾ Óé þ?ï¾ ÍùÙ ?ï¾—xp'?ï¾–ú‰* ?ï¾,PeÕ?ï¾&a!?ﾃWyl@?ﾃQŠ)Ó?ï¾yåºb?ï¾y{öyË?ï¾o«Ÿ¾é?ï¾o¥°€)?ï¾eÔ§ÐÉ?ï¾eθ“ß?ï¾[üú? ?ï¾[÷ û?ï¾R$™ep?ï¾Rª,5?ï¾HK‰¢°?ï¾HEškL?ï¾>qÃ?f?ï¾>kÔ Ú?ï¾4—D°?ï¾4‘U\û?ï¾*¼ÿH?ï¾*¶(Ík?ï¾ à7ؼ?ï¾ ÚH¨·?ﾤu?ï¾ýµFÛ?ï¾ &b1‘?ï¾ s?ï½ïŠekÙ?ï½ï„vE ?ï½åªTü?ï½å¤e× ?ï½ÛÉ•ak?ï½Ûæ>P?ï½Ñè"ð6?ï½Ñâ3Îõ?ï½Èþô?ï½Èá‹?ï½¾#(í¢?ï½¾9Ð?ï½´?¢ ?ï½´9²ñ`?ｪ[k¹?ｪU|Ÿ'?ï½ v€F»?ï½ p‘.·?ï½–èì?ï½–ŠøüÂ?ｌª¡t§?ｌ¤²`W?ｂÂƧÐ?ｂ¼×•Z?ï½xÙ½N$?ï½xÓÎ=ˆ?ï½nï÷r}?ï½nêc¼?ï½eui(?ï½dÿ†\B?ï½[=†Ö?ï½[N{Ê?ï½Q.DŠ?ï½Q(UY?ï½GA“…?ï½G;¤}Ç?ï½=T. «?ï½=N?0?ï½3f }?ï½3` Þ?ï½)w+Ø–?ï½)q<ÖÒ?ｇ—ÁÌ?ｨÁã?ï½—HN?ｑY!A?ï½ ¦9H?ï½  JKÞ?ï½´y‰U?ï½®ŠŽÿ?ï¼÷Áû?:?ï¼÷¼ FÁ?ï¼íμ|?ï¼íÈÓÅß?ï¼ãÚÚM¥?ï¼ãÔëXä?ï¼Ùæ6P;?ï¼ÙàG]W?ï¼ÏðÙš?ï¼Ïêê&’?ï¼ÅúÂø¯?ï¼ÅôÔ „?ï¼¼öF?ï¼»þXÊ?ï¼² m[”?ï¼²~p#?Ｈ2‚?ＨC˜‡?＞@s?＞Q-¼?ï¼”!”mj?ï¼”¥‡‘?＊'1Ül?＊!Bøq?ï¼€,´A?ï¼€&+Ò#?ï¼v0KP?ï¼v*\oÚ?ï¼l3Çþv?ï¼l-Ù ?ï¼b6&?ï¼b0ž>¡?ï¼X8šû¦?ï¼X2¬!?ï¼N9óñ€?ï¼N4¸?ï¼D:˜Q¿?ï¼D4©zÖ?ï¼::„yî?ï¼:4•¤ã?ï¼09¼·?ïº$(¶*?ïº$"Ǫ÷?ïº$?ïºû´Ç?ïºا@w?ïºÒ¸Ó?ﺯŽô˜?ﺩ ‰?ï¹û…¼  ?ï¹ûÎ7?ï¹ñ[8f*?ï¹ñUIþw?ï¹ç/ø×z?ï¹ç* q®?ï¹Ý"b?ï¹Üþ¾}?ï¹Ò×\?ï¹ÒÑn+?ï¹È©þ„â?ï¹È¤$Ê?ï¹¾{æx:?ï¹¾uø ?ï¹´Mx5?ï¹´G0ì?﹪Ÿ ã?﹪°³‚?﹟íf›D?﹟çxBÊ?﹕¼}=;?﹕¶Žæ©?﹋ŠÝpø?﹋„ïN?ï¹Xƒ§.?ï¹R•Tk?ï¹w%{Þº?ï¹wà?ï¹lñ¼²º?ï¹lëÎcÉ?ï¹b½LKæ?ï¹b·]þÝ?ï¹Xˆ) r?ï¹X‚:ÁR?ï¹NRSH?ï±ñïŠU?ï±ç;oÖ~?ï±ç5‚ï?ï±Ü€·~?ï±Üzʨ‘?ï±ÑÅGO¨?ï±Ñ¿Zl½?ï±Ç #`?ï±Ç6?ï°Žh@Á?ï°ƒ´ÿÙÕ?ï°ƒ¯5^?ï°xáò‚?ï°xÜ ?ï°n*Dƒ?ï°n=¤?ï°c9¨€Ï?ï°c3»âk?ï°XdmÃÉ?ï°X^'k?ï°MŽx…Ó?ï°Mˆ‹ë|?ï°B·ÊçŒ?ï°B±ÞO;?ï°7àg ?ï°7ÚzrÌ?ï°-Dk?ï°-W€(?ï°"/i¥f?ï°")}+?ï°UÖ5?ï°Oé¤å?ï° {‹ãŠ?ï° uŸU]?ï° Šý.?ï°šžq?ï¯öÄÐ(}?ï¯ö¾ãž_?ï¯ëèYßÕ?ï¯ëâmW¿?ï¯á ,E?ï¯á?7?ï¯Ö-J½Ø?ï¯Ö'^9Ò?ï¯ËN°«>?ï¯ËHÄ)A?ï¯Ào\Y[?ï¯ÀioÙe?ﯵU^´?ﯵ‰hàÇ?ﯪ®’ìò?ﯪ¨¦q?ﯟÍö?ﯟÇ,|3?ﯔêïª?ﯔå–×?﯊ôÕ?﯊ ?ï¯$jV?ï¯}›•?ï¯t@«?ï¯t:,9_?ï¯i[ ¡?ï¯iU!1T?ï¯^uP„ ?ï¯^odh?ï¯SŽÝþ˜?ï¯Sˆñ’þ?ï¯H§²¼?ï¯H¡ÆR†?ï¯=¿ÐÛz?ï¯=¹äsó?ï¯2×:{0?ï¯2ÑN³?ï¯'íî ?ï¯'è´—?ï¯ëÿÆ?ï¯ýÿž^?ï¯8 Ì?ï¯KÁn?ï¯-ÍWŽ?ï¯'àú;?ï®üA­ÂC?ï®ü;Áfú?ï®ñTÙ®¼?ï®ñNíU~?ï®ægOšô?ï®æacCÁ?ï®Ûyt|?ï®Ûs'T?ï®ÐŠ!é¤?ï®Ð„5–‡?ï®Åš}?ï®Å”Ç?﮺ª#~T?﮺¤7/O?ﮯ¹Ø%?ﮯ³.‹,?ﮤÇX˜R?ﮤÁlMd?ï®™ÔäIð?ï®™Îø?ﮎáÀ ª?ﮎÛÓÂÔ?ﮃíæ¸ÿ?ﮃçút6?ï®xùX¦˜?ï®xólcÛ?ï®nZÄ?ï®mþ1?ï®c,?ï­.÷õ©–?ï­.ò ¤‹?ï­#ì>Çh?ï­#æRÄm?ï­ßÒç?ï«â]( `?ï«×BÕ:?ï«×?ï«~Aæ?ï«rùòtÀ?ï«rô¶?ï«gÑÿ³'?ï«gÌ3?ï«\©ZõP?ï«\£oGr?ï«Q€ï?ï«Qzh'?ï«FV ¸?ï«FPa?ï«;+I'F?ï«;%]«?ï«/ÿãO?ï«/ù÷aÊ?ï«$Óʧ§?ï«$Íß9?﫧Uó?ï«¡´œ?ï«xË_?ï«rß¿×?ï«Ih5?ï«C|z ?ïªøKÝ"?ïªø`B?ïªìè|Hê?ïªìâ¯ð?ïªá¶ðËŠ?ïªá±4¨?ïªÖ„¦&%?ïªÖ~º‘Z?ïªËQ©þ?ïªËK½pL?ïªÀïŠ?ïªÀð?華é}æ(?華ã’W§?睊´T X?睊®h|ï?爵~sˆ?爵x‡ýÁ?望GÓØ–?望AèP^?愈 Ÿ?愈 –€?ïª|ØtVè?ïª|ÒˆÒâ?ïªqŸ¯Í7?ïªq™ÄKJ?ïªff4M’?ïªf`H;?ïª[,!ü?ïª[&¤B?ïªOñÑU?ïªOë,U´?ïªDµwi?ïªD¯‹ïŠ?ïª9ypN?ïª9s3øß?ïª.<n¨?ïª.6"ùS?ïª"þIöö?ïª"ø^ƒ»?謹ÇÀ?調ÜR_?ïª €’®Þ?ïª z§?Ù?ïª@©@{?ïª:½Ó?ï©ö¹ˆ?ï©õúN¸?ï©ê¾¬mø?ï©ê¸ÁB?ï©ß| §ê?ï©ßvµAO?ï©Ô9Úª?ï©Ô3ïE„?ï©ÈöaÆÒ?ï©Èðvdm?墳²1•?墳¬E£K?全mJm?全g_×?逸'®N?逸!Âññ?ï©›áb5@?ï©›ÛvÛH?ï©š]¦Æ?ï©”rNê?ï©…R¢¯5?ï©…L·Yt?ï©z 3Z½?ï©zH?ï©nÁôG?ï©n»$¢¿?ï©cw7 ?ï©cqK¶ ?ï©X,®?ï©X&ÂÏ·?ï©Lán¦?ï©LÛƒ6s?ï©A•xŽ?ï©A6x?ï©6HÑ£?ï©6Bæ\?ï©*ûv¶Œ?ï©*õ‹q¯?ï©­d…m?逸yB­?ï©^¥ÚÔ?ï©Xºš2?ï© 0‚H?ï© ECÃ?ï¨ý¿‡r?ï¨ý¹K ?ï¨òn-t†?ï¨òhB:Ì-Ü?ï¨åkN”?ï¨߀<•?洞gi:?ï¨|Y[?ï¨$«Ú6?ï¨ÀÌx?ï§øÃ5ož?ï§ø½Jd?ï§íaì^?ï§í[ââ?ï§áþ#˜À?ï§áø8‘e?ï§Öš…C“?ï§Ö”š>Y?ï§Ë6-5Ö?ï§Ë0B2½?刺Ñu ?刺Ë2t?林kVIà?林ekK ?里Ô„g?裡þ釳?梨„?輪²§ò?戮5®tt?戮/Ã|?阮ÍCA?阮ÇLò?ï§{cªÅ?ï§{]¿˜?ï§où•s?ï§oóª€ü?ï§dŽÉª?ï§dˆÞº&?ï§Y#EFt?ï§YZX®?ï§M· M?ï§M±aa?ï§BJK?ï§BD,b ?ï§6Üq¼ó?ï§6Ö†Õ–?ï§+ný|?ï§+h(B?ï§þûVô?ï§ùsÝ?ï§1þ_?柳Gk?ï§ °Ql?ï§ Årœ?ï¦ý­z?ï¦ý§2d?ï¦ò;Åú?ï¦ò5¢ër?ï¦æÈêQ?ï¦æÂÿ,ì?ï¦ÛU’‹^?ï¦ÛO§µ?ï¦Ïá…ç1?ï¦ÏÛ›?ï¦ÄlÆL?ï¦ÄfÛJT?隸÷JÒn?隸ñ`›?玲 hâ?玲{5›3?廉 Aû5?廉W/ª?練’ª¦P?練Œ¿Üê?曆aš?曆vÓ>?說eg¨?鍊z¢?ï¦t'²äö?ï¦t!È!ÿ?ï¦h­O‡ð?ï¦h§dÇ?ï¦]26nè?ï¦],K°ÊŒ?ï¦/8ßÕû?ï¦#À3rî?ï¦#ºH¿?ï¦@æ¡ò?ï¦:ûð*?ï¦ ÀäcÅ?ï¦ ºù´#?ï¦@3ãH?ï¦:I5Í?ï¥õ¾ÎŠ ?ï¥õ¸ãÞ¶?ï¥ê<¶Z–?ï¥ê6˱h?ï¥Þ¹ï¦?ï¥Þ´gŸ?ï¥Ó6pZ?ï¥Ó0…µ$?ï¥Ç²Cj?ï¥Ç¬Xz±?良-b|{?良'wÛê?殺§Óç¬?殺¡éIB?便!”:s?便©ž0?陵š£¿5?陵”¹%?漏ÿR–?漏 º£?壟Š§?²?壟„¼©ç?ï¥w¤b÷?ï¥vû¹ÏT?ï¥kw쾄?ï¥kr- ?ï¥_ìÌ Å?ï¥_æá|r?ï¥T`‹²?ï¥TZ wˆ?ï¥HÓ/…?ï¥HÍ¥¤„?ï¥=EÚO?ï¥=?ï”w?ï¥1·n8+?ï¥1±ƒ±|?ï¥&(Eî“?ï¥&"[j ?菱dôf?勒zr ?ï¥Îü¡?ï¥ä|n?ï¥vz ¨?ï¥pŸ?ï¤÷äp«Ì?ï¤÷Þ†/ì?ï¤ìQ®A?ï¤ìKÉ‹?ï¤à¾0¤[?ï¤à¸F,Ð?ï¤Õ)ýöö?ï¤Õ$•?ï¤É•B ?ï¤É+Îé?綠ÿt­¼?綠ùŠ<°?爐iÞ?爐c/ü?ï¤¦Ò %?臘̸^?亂:Cu?亂4Y x?嵐À›˜?亂Ö37?滑Šh?滑 Ý?ï¤xn¸È?ï¤xh³T½?ï¤lÓõ¸¤?ï¤lÎ VÄ?ï¤a8œéu?ï¤a2²‰Á?ï¤UœŒÁÌ?ï¤U–¢dC?ï¤IÿʼnÆ?ï¤IùÛ.i?ï¤>bI=_?ï¤>\^ä.?ï¤2Äpª?ï¤2¾,¥?ï¤'%+¸6?ï¤'Ac]?串*‚?拉×Ö?ï¤å9Ú\?ï¤ßO‰Ü?ï¤D/Þ?ï¤>EÃ?ï£ø¢pÊX?ï£øœ†~1?ï£ìÿû4I?ï£ìúêO?ï£á\Ñ_?ï£áVæÏ’?ï£Õ¸ò»Ò?ï£Õ³v2?ï£Ê^·?ï£Êts§?of?i,à ?É9n?Ã/úV?"hžÅ?~aÛ?zÿj?uÝ­?ï£Òæj{?ï£Ìü1í?*Æ`?$/ÿ?ï£x€—¾?ï£xz­ŽŒ?ï£lÖ`¨ˆ?ï£lÐvv„?ï£a+vrh?ï£a%ŒB’?ï£UÛŸ?ï£Uyðìø?ï£IÓ7ñ?ï£IÍ£ y?ï£>&‰°:?ï£> Ÿ†ð?ï£2xÔ/^?ï£2rêC?ï£&Ên¯)?ï£&Ä„Š=?ï£TdÅ?ï£jB ?ï£k‡Jx?ï£e)ê? Z?;½?ï¢ø ×zè?ï¢øí^º?ï¢ìWó¦Ø?ï¢ìR ŒÚ?ï¢à¥a‡ô?ï¢àŸwp&?ï¢ÔòUn?ï¢Ôì2?Ð?ï¢É>"¨b?ï¢É88”ó?‰yÛ?ƒÉÅ?ï¢±Ô †?Î6v÷?B…?+5§?gZ ½?aoÿ?¯ëÅU?ª¼Ù?÷Ìn­?ñâhb?ï¢w>M0s?ï¢w8c,Y?ï¢kƒª1x?ï¢k}À/?ï¢_ÈL#·?ï¢_Âb#ÿ?ï¢T 4üå?ï¢TJÿ_?ï¢HOf²P?ï¢HI|¶ü?ï¢<‘Þ+~?ï¢<‹ô2\?ï¢0ÓŸ á?ï¢0͵ñ?ï¢%¦>k?ï¢%¼I­?ï¢Tô?ï¢O ?ï¢ ”ŠZd?ï¢ Ž j ?ï¢Óf"æ?ï¢Í|4¿?ï¡ö‹Ê?ï¡ö ¡Ö?ï¡êNúñ’?ï¡êIÑ?ï¡Þ‹±'D?ï¡Þ…Ç?¶?ï¡Òǯ™Ñ?ï¡ÒÁÅ´v?ï¡Çö¶?ï¡Æý ¬?ï¡»=‡ý\?ï¡»7žh?w`ÍG?qvî†?ï¡£°‚óþ?ï¡£ª™q?ï¡—èî¸?ï¡—ãÝ®?ï¡Œ ŸWT?ï¡Œµ.?ï¡€W›Ï?ï¡€Q±ù?ï¡täeR?ï¡t‡ú‘”?ï¡hÃr«¦?ï¡h½ˆÚ?ï¡\øMÚ?ï¡\òcÎ…?ï¡Q,r(6?ï¡Q&ˆ[?ï¡E_Þä»?ï¡EYõÐ?ï¡9’•Ç]?ï¡9Œ«þ¦?ï¡-Ä—?ï¡-¾­P€?ï¡!õã”?ï¡!ïùVH?ï¡&{Åg?ï¡ ’P?ï¡ VZ¬¼?ï¡ PpìÚ?ï þ…†Éb?ï þ µ?ï ò³þµÐ?ï ò®úY?ï æá¿`ó?ï æÛÕ§±?ï ÛÌj.?ï Ûâ³#?ï Ï;)p ?ï Ï5?»7?ï Ãf̲»?ï Ã`ã?ï ·‘»}8?ï ·‹ÑÌÏ?ï «»÷ÂK?ï «¶?ï Ÿå~r/?ï Ÿß”Æ4?ï ”QÉ?ï ”gÖ?ï ˆ6tˆ¸?ï ˆ0Šá*?ï |]á'y?ï |W÷‚"?ï p„šùç?ï p~±VÇ?ï dª£ò-?ï d¤ºQD?ï XÏõ¬n?ï XÊ ¼?ï Lô•pÐ?ï Lî«ÔV?ï Aƒ†´?ï A™ìq?ï 5;¾‹ ?ï 55Ôó?ï )^HoÔ?ï )X^Ú?ï €!|p?ï z7èÕ?ï ¡COú?ï ›Y¾—?ï Á¸.ç?Ο¼?ïŸùáxµ?ïŸùÛŽÂ?ïŸî„á€?ïŸíú›VÆ?ïŸââB£?ïŸâøº!?ïŸÖ?ïŸÊY‡~€?ïŸÊSúp?uÑ’|?oè¥?‘j?‹€c?¬M¿î?¦dBŠ?Ƃ?À˜—Ú?à <±?Ú"ÃÀ?ø2 ?òH•S?ïŸw5Í?ïŸw LY?ïŸk%ƒìT?ïŸkšz?ïŸ_;a?ïŸ_5*ñy?ïŸSOîò?ïŸSJ§$?ïŸGdK5?ïŸG^'ß¡?ïŸ;wuÿZ?ïŸ;qŒ–?ïŸ/Š$ÀŠ?ïŸ/„;Yl?ïŸ#œÓX?ïŸ#–4nu?\„e?s!¼?ïŸ ½æä?ïŸ ·ü°v?ïžÿÍ·má?ïžÿÇί?ïžóÜÍ‘:?ïžóÖä5C?ïžçë,ù?ïžçåB¶??ïžÛøÖ~P?ïžÛòí&Ñ?ïžÐÄÜ?ïžÏÿÛ†Å?ïžÄZò?ïžÄ ë?‡Iã?ù?(PQë?"g]?ïž 2düX?ïž ,{°?ïž”;ÅŽ'?ïž”5ÜD?DmX?>„??ïž|L^F½?ïž|Fu!?ïžpS›ìÎ?ïžpM²©o?ïždZO?ïždT5 ø?ïžX_ìM’?ïžXZ®?ïžLeÓÂ?ïžL_—?ïž@ihè?ïž@c­ª?ïž4mi4?ïž4g-1?ïž(pBk?ïž(j) |?ïžrT{µ?ïžlkH?ïžsâLÔ?ïžmùa?ïžt½¡?ïžnÔqÛ?ïøtà'Ð?ïønöúÚ?ïìtP½L?ïìng’•?ïàsš?ïàm$Ù ?ïÔq¥º?ïÔk(?ïÈneÏ ?ïÈh|«$?ï¼kÓþ?ï¼e²A?ï°fðU|?ï°a5ÿ?ï¤b(ã†?ï¤\?ÆG?ï˜\®1?ï˜VÅ2?ïŒV}q?ïŒP“ì±?ï€O™%å?ï€I°e?ïtHV?ïtBû?ïh?º-Ä?ïh9ÑÄ?ï\6º´ô?ï\0Ñ¥4?ïP- ×n?ïP'#Éî?ïD"¨§?ïD¿›Æ?ï8”ú?ï8«ñ?ï, ÎÏ ?ï,åÈN?ïÿTÈ­?ïùkÄ/?ïò(ÑI?ïì?Ï ?ïäK/T?ïÞb/W?ïœûÕ·?\?ïœûÏÎA ?ïœïÆsÕš?ïœïÀŠÚ?ïœã¶„~i?ïœã°›…/?ïœ×¥Þ k?ïœ×Ÿõt?ïœË”ˆïÈ?ïœËŽŸû?‚‚/&?|™<±?oÊW?iá$?\byÀ?Vy‹Ï?HHoþ?B_„O?ïœ3 J?ïœ-˜6Þ?Vò?m È?ïœwt1?ïœw&I?ïœjîS9?ïœjè'p•?ïœ^ÕWFœ?ïœ^Ïnf:?ïœR»âðb?ïœRµúC?ïœF¡¶Ø§?ïœF›ÍüÌ?ïœ:†Ôä÷?ïœ:€ì _?ïœ.k>úp?ïœ.eV#?ïœ"NîÕÐ?ïœ"I¿?ïœ1áxt?ïœ+ø¥¦?ïœ $2}?ïœ ;aô?ï›ýõ¦ù€?ï›ýï¾+:?ï›ñÖr9 ?ï›ñЉm ?ï›å¶Œ¹›?ï›å°£ïÞ?ï›Ù•è?ï›ÙÿMš?ï›ÍtŽVi?ï›Ín¥‘5?ï›ÁRƒ?ï›ÁLš@?/¹X‡?)ЗÜ? ;`?R¡¹?èž?â`~?ï›ÃG®?ï›lPy?ï›lJ1Åö?ï›`(YŸ²?ï›`"pîí?ï›SÿãS?ï›SùúfÔ?ï›GÖ³ÞÌ?ï›GÐË2’?ï›;¬Ñ :?ï›;¦èvG?ï›/‚<½b?ï›/|Tµ?ï›#VëÂ?ï›#Qø\?ï›*ëh?ï›%_I?ï› þ3…?ï› øJq«?ïšþÐŲ^?ïšþÊÝË?ïšò¢¡‡¸?ïšòœ¸ël?ïšæsÍS’?ïšæm乎?ïšÚDA?|?ïšÚ>X§¿?ïšÎªÂ?ïšÎL?ïšÁã^¤?ïšÁÝ+Ëv?ïšµ±l°?ïšµ«ƒpÊ?ïš©P?ïš©y'‡±?ïšL?ïšF‘Ç?ïš‘= x?ïš‘Th?ïš„ãÈ?ïš„Ý߈T?ïšx® ›Î?ïšx¨¸P?ïšlxÀy•?ïšlr×ö_?ïš`B1¢»?ïš`?ï™Ù»ê7‘?ï™Ù¶ÏÉ?ï™Í},O?ï™ÍwÆÒ?ï™Á=lz?ï™Á7„Û?ï™´ýôš?ï™´÷4“±?¼ŒØ?¶7.:?zt‡Æ?tŒ+r?ï™8U÷?ï™2.ûí?õ=\?ïåž?ï™w°¤b$?ï™wª¼ ±?ï™kk ?ï™ke/Éâ?ï™_$ÕJÈ?ï™_ìùì?ï™RÝá?ï™R×ø²v?ï™F–+lV?ï™FC ?ï™:MÆ€„?ï™:GÞ6Š?ï™.¨ÙÆ?ï™-þÀ’?ï™!ºÏ„8?ï™!´ç>Ö?ï™p:Ã\?ï™jR€G?ï™ $ï¬A?ï™ kx?ï˜üØëK[?ï˜üÓ ß?ï˜ðŒ-ãÝ?ï˜ð†E§®?ï˜ä>Âõ\?ï˜ä8Ú»y?ï˜×ð”Iµ?ï˜×ê¬?ï˜Ë¡·l?ï˜Ë›ÎÌ$?R #¶?L7ðº?ÎY˜?ûæ(ê?°Ë…k?ªãW ?_€?Y)Sð? žòj?¶È¤?wTn?,÷?ï˜ueŸ·%?ï˜u_·‘ü?ï˜i¿s?ï˜i œ—?ï˜\»»,?ï˜\µÒúŸ?ï˜Pe¾¦Æ?ï˜P_Öˆ‡?ï˜D×–?ï˜D »¦?ï˜7·™%&?ï˜7±± …?ï˜+_{Ò7?ï˜+Y“ºå?‰t?tp?[?-Hi?ï˜RÖVE?ï˜LîEß?ï—ù÷ÛŽ\?ï—ùñó€E?ï—íœ5A®?ï—í–M5ç?ï—á?ÕRs?ï—á9íHû?ï—ÔâÀÏ?ï—ÔÜØÈY?ï—È„ù•$?ï—ÈL?ï—¼&K?ï—¼ ™|Ã?ï—¯ÇM¥Ú?ï—¯Áe¥¢?ï—£goÙî?ï—£a‡Ü?ï——Ý3 ?ï——õ8?ï—Š¥þ?ï—ŠŸ¦Ø?ï—~CŒ??ï—~=¤I?ï—qàÚÚ°?ï—qÚòæ ?ï—e}tD?ï—ewŒQ¼?ï—YXº?ï—YpŸ·?ï—L´“'©?ï—L®«9÷?ï—@Obh?ï—@I,w?ï—3èâã?ï—3âúú?ï—'‚ƒ?ï—'|5Å?ï—hÆr?ï—€â?ï—² ±9?ï—¬8Ï?ï—I(‰7?ï—C@©o?ï–õßz6J?ï–õÙ’XÔ?ï–éu†µ?ï–éo7«?ï–Ý ˽?ï–Ý(òë?ï–ОL³]?ï–ИdÜÞ?ï–Ä1ØFW?ï–Ä+ðr*?ĸŒ=?ï–·¾Ðºc?ï–«V⫉?ï–«PúÜ?ï–žèXÓ?ï–žâp²Ÿ?ï–’y%i|?ï–’s=ž›?ï–† <ú®?ï–†U2!?ï–y˜¤:·?ï–y’¼t|?ï–m']ò?ï–m!u@ ?ï–`´¾'À?ï–`®Öf-?ï–TAŽq?ï–T;Ï2?ï–GÌŒÁœ?ï–GÆ¥±?ï–;W\«Ù?ï–;QtñB?ï–.áuP.?ï–.Û—ë?ï–"jÚ ?ï–"dòe?ï–óƒbŒ?ï–í›®ó?ï– {rþP?ï– u‹M ?ï•ý¬ZÌ?ï•üüÄ«Ü?ï•ð‰/¹‰?ï•ðƒH î?ï•äø?ï•ä òÑ?ï•×” ›p?ï•×Ž%ó€?ï•Ëh¢¥?ï•Ë€ý ?œ †?–%{@?ûPê?¯ú?ï•¥¡0R©?ï•¥›H´?ï•™"­ú’?ï•™Æ^N?ï•Œ£w³x?ï•ŒŠ?ï•€#‰??ï•€¡j¨?ï•s¢åQš?ï•sœý¼X?ï•g!Žww?ï•g¦äŒ?ï•ZŸ?ï•Z™™üû?ï•N»®W?ï•NÔ ?ï•A™@D?ï•A“X¸1?ï•5 ýT?ï•5&sÅ?ï•()×??ï•(ŠBP?ï• Œ2?­;?ï•„6ä\?ï•~OaÒ?ï•ý0}ê?ï•÷Hý¸?ï”öuv?ï”öoŽœ.?ï”éígà?ï”éçì]?ï”Ýcàò?ï”Ý]øÇ?ï”ÐÚÜ?ï”ÐÔ ?ï”ÄOu\v?ï”ÄIçû?ï”·Ä3 ¬?ï”·¾K˜Š?8<·C?2UGz?«º?¥¨I?ï”’.Ì ?ï”’G`ò?ï”…q?ï”…Š5Y?ï”yOCÉ?ï”xûgÝb?ï”lqÔ3?ï”lkìµ%?ï”_á¦|ð?ï”_Û¿,“¿?ï“>&«ã4?ï“1Š¯Ùƒ?ï“1„È°U?ï“$è ØÅ?ï“$â$±ó?ï“Dµ[Ü?ï“>Î7h?ï“  ©ƒ2?ï“ šÂa?ï’þûß1ä?ï’þõø)?ï’òV`K?ï’òPxèî?ï’å°*±A?ï’åªC–A?ï’Ù 7§?ï’ÙPŽm?ï’Ìa„l?ï’Ì[©n(?ï’¿¹2ks?ï’¿³KWŒ?ï’³œè?ï’³ 6‹_?ï’¦fUwJ?ï’¦`nh?ï’™»Òpí?ï’™µëd ?ï’”Ël?ï’ ­Àþ?ï’€d£É?ï’€^»ú¹?ï’s·þåÿ?ï’s²àN?ï’g  íF?ï’g¹éô?ï’Z\Šè‘?ï’ZV£çž?ï’M­¾§t?ï’M§×¨à?ï’@þ=ù'?ï’@øVüò?ï’4N ¬ˆ?ï’4H#²²?ï’' XF?ï’'—9`Ï?ï’ë}¯ò?ï’å–ºÛ?ï’9"õ.?ï’3<v?ï’†ª?ï’€."R?ï‘ôÒNõ?ï‘ôÌg$ý?ï‘èÙh?ï‘èò*Ð?ï‘Ûh®š?ï‘ÛbÇ°Ú?ï‘βȪ(?ï‘άáÃP?ï‘Áü2e®?ï‘ÁöK7?Dèòþ??è?Œæ_+?†ÿu?ï‘›Ô2­ ?ï‘›ÎKÏË?ï‘Ë?ï‘ä)%?ï‘‚`®Ì?ï‘‚ZÇ@9?ï‘u¥Ü,î?ï‘uŸõV¼?ï‘hêX›f?ï‘häqÇ–?ï‘\.ÿú?ï‘\(8.Œ?ï‘Oq/œ²?ï‘OkHÍ¥?ï‘B³’q?ï‘B­«¤X?ï‘5õ>ts?ï‘5ïWª*?ï‘)67†?ï‘)0P9Ÿ?ï‘vr ?ï‘p˜¬„?ïc?ï‘°.,@?ï‘ô÷»\?ï‘ïú›?ïö3+/8?ïö-DpÚ?ïép¡£|?ïéjºç?ïÜ­lZä?ïܧ…¡L?ïÏéƒÜä?ïÏã%®?ïÃ$åTÜ?ïÃþ  ?ï¶_˜½Ì?ï¶Y² ]?ï©™›BŸ?ï©“´’“?ïœÒæøÞ?ïœÍK5?ï ˆ{d?ï¡Ð?ïƒCu>¨?ïƒ=Ž•Ç?ïvz°šù?ïvtÉô|?ïi±9GÄ?ïi«R£«?ï\ç±ë?ï\á/5?ïP;Q?ïPT±Ì?ïCP²¾?ïCJËÒ?ï6„wB?ï6~§†?ï)·‹w?ï)±¤kS?ïéí£u?ïä ¶?ï ?ï {²?ïJþ¾K?ïE-W?ïözCùt?ïöt]jä?ïé¨ÏM”?ïé¢èÁj?ïÜÖ úŸ?ïÜкpÛ?ïпgx?ïÏýØà?ïÃ0#"Ê?ïÃ*<Ò?ï¶[Ïõ?ï¶Uèýc?渚ľ¦?ï©€Þ>z?•:?s?ïÚƒ1?ïÔœµ¶?ïƒV`?ï‚ýo£f?ïv+oÕ±?ïv%‰_?ïiRÍ‹H?ïiLç?ï\yu¡±?ï\s/ì?ïOŸhX§?ïO™éI?ïBÄ¥ïð?ïB¾¿‚ú?ï5é-¢?ï5ãF´?ï) 5ì?ï)ÍÅ?ï0Sb?ï*5í¢?ïRƒPÅ?ïLœím?ït3]@?ïnLüP?ïŽõ•+0ö?ïŽõDÒm?ïŽèµo¤Ý?ïŽè¯‰H¼?ïŽÛÔÿp¶?ïŽÛÏÿ?ïŽÎóÙL¨?ïŽÎíòõY?ïŽÂýy?ïŽÂ $ ?/oE¸?)ˆó9?L%Ä‚?F?tl?h*dV?bDª?ƒ~ìŒ?}˜¡H?Ú ?/‘1?ïŽt·û©Z?ïŽt²bé?ïŽgÑ,ª?ïŽgËEÀ¢?ïŽZéª:æ?ïŽZãÃùH?ïŽNs~?ïŽMû>æ?ïŽA‹Þ?ïŽA¤à?ïŽ4.é´ü?ïŽ4)zœ?ïŽ'D›¾0?ïŽ'>µ†:?ïŽY›]?ïŽSµ'ƒ?ïŽ má1 ?ïŽ gúýê?ïŽrp?ïŽ{‹Þ¸?ïó”TRê?ïóŽn$ž?ï榃¨b?ïæ |€?ïÙ·ýD?ïÙ²¡?ïÌÈÉ ?ïÌÂâß?ï¿Øáò?ï¿ÒúñQ?ï²èE´Æ?ï²â_’‘?ï¥ö÷#”?ï¥ñÊ?ï™ò—È?ï˜ÿ zj?ïŒ>i¾?ïŒ XNÌ?ïßjÊ?ïùRC?ïr*Åä?ïr$ßÉ?ïe5ûñ*?ïe0Ý|?ïX@‚ŸÄ?ïX:œŽ?ïKJSU}?ïKDmF§?ï>SthÔ?ï>MŽ\j?ï1[é$º?ï1V½?ï$cª0Œ?ï$]Ä(û?ïj¼\—?ïdÖWs?ï qdÚ?ï k8b$?ïŒývÍ?ïŒýp瀺?ïŒð{Éòµ?ïŒðuãôÙ?ïŒã€‰-?ïŒãz2¾?ïŒÖƒòU?ïŒÖ}4ùS?ïŒÉ…Xq?ïŒÉ aÝ?†7ùæ?€RÀ?†­ ?€ÇW?†nêŸ?€ˆûV?…yD"?“WG?ƒÇÌ3?}ááÇ?ïŒ{bV?ïŒ{{|n ?ïŒn~G›ö?ïŒnxa¶g?ïŒaztÔå?ïŒatŽñÅ?ïŒTuëÃ?ïŒTpâÎ?ïŒGp©ŸJ?ïŒGjÃÁ?ïŒ:j®§†?ïŒ:dÈ˳?ïŒ-cÿ¥À?ïŒ-^Ì]?ïŒ \›U?ïŒ Vµ~"?ïŒT}j‰?ïŒN—–?ïŒK©+õ?ïŒEÃYá?ï‹ùB!Þ†?ï‹ù<<â?ï‹ì7ã7È?ï‹ì1ýj“?ï‹ß,ívý?ï‹ß'¬9?ï‹Ò!Fæ¾?ï‹Òak?ï‹Åã¯n?ï‹Åýé‹?Σê?èàw?ú»?ô"Aº?ï‹ë†û›?ï‹å¡= ?ï‹ÜNÓb?ï‹ÖiB?ÌdP?Æ~–â?ï‹v»Á©?ï‹vµÛñÝ?ï‹iªn§~?ï‹i¤ˆò²?ï‹\˜e‚$?ï‹\’ÏÊ?ï‹O…©|?ï‹OÃ̧?ï‹Br9Sü?ï‹BlS¦…?ï‹5^KR?ï‹5X2 M?ï‹(I<ž?ï‹(CVm ?ï‹3¬{Š?ï‹-ÆÕi?ï‹i¼{?ï‹„Í?ï‹o“Š?òN?ïŠóîÇHè?ïŠóèáª?ïŠæÖk4?ïŠæÐ…yÝ?ïŠÙ½[;?ïŠÙ·u¡2?ïŠÌ£–v'?ïŠÌ°Þ¶?‰!ŠL?ƒ;õN?mò0b?h Ø?R0µ?L0 ž?5„Å?/Ÿ7í?B±?]%å?ïŠ}úK± ?ïŠ}ôf(Q?ïŠpÛ©z?ïŠpÕÂ2?ïŠc¼Mr¨?ïŠc¶gîÔ?ïŠVœC²ž?ïŠV–^1>?ïŠI{†Ä?ïŠIu ‡Ø?3?ï‰O„)SP?ï‰O~D ?ï‰BTw» ?ï‰BN’mT?ï‰5$ïH?ï‰5+¤?ï‰'òò0­?ï‰'í çâ?ï‰Á>æ?4ø’?ï‰ ŽŒT²?ï‰ ˆ§×?ï‰[E³}?ï‰U`r?ïˆó'I•±?ïˆó!dVÅ?ïˆåò˜9?ïˆåì²ü ?ïˆØ½-a²?ïˆØ·H'·?ïˆË‡ I¸?ïˆË'5?P3±r?JN|g?£×&?¾¤“?àbïi?Ú}¿O?§oº?¡ŠŒa?m¾‰Z?gÙ^2?ïˆ|3Z 0?ïˆ|-tá?ïˆnøC÷Š?ïˆnò^ÑT?ïˆa¼s &?ïˆa¶Ž|j?ïˆTð´X?ïˆTz “?ïˆGB¼îõ?ïˆG<×Ð,?ïˆ:Ë)’?ïˆ9þæ B?ïˆ,Æ)G?ïˆ,ÀCír?ÖŦ?ñ®J?ïˆF˶?ïˆ@æ¡ž?ïˆ ?ïˆ(ø¸?ï‡÷Ä™ŒD?ï‡÷¾´|X?ï‡ê‚oõ*?ï‡ê|Šç¸?ï‡Ý?•ùT?ï‡Ý9°î]?ï‡Ïüb?ï‡Ïö"Y…?ï‡Â·¿ù}?ï‡Â±Úó{?rÈçh?lããâ?- í¬?';ì ?æÀß?àÛàŒ?­n€?Èrl?WèV/?R\•?ï‡smaÄ?ï‡s ˆj¦?ï‡eÆAC?ï‡eÀ\N`?ï‡X|d8V?ï‡XvF1?ï‡K1Ò?ï‡K+ír?ï‡=æ’kæ?ï‡=à­~¹?ï‡0šž'²?ï‡0”¹=?ï‡#MöûÔ?ï‡#H ?H?ï‡ú»7‘?–Ô¨?±ñl?ï†ûcØk;?ï†û]óŠ|?ï†îiÉ?ï†î„²ˆ?ï†àÄKþº?ï†à¾g"ö?ï†Óswü?ï†Óm’:µ?ï†Æ!õj ?ï†Æ“W?ÏÂÐ?ÉÝûÓ?|Ù› ?vôÉÒ?)Bê2?#^â?ï†ÔþúR?ï†Ï-€?€. ?z c¶?ï†v*^¡`?ï†v$yÙŠ?ï†hÔ ñ?ï†hÎ%S™?ï†[|ú‹?ï†[wÈ=?ï†N%Cg‰?ï†N^§.?ï†@ÌD³ô?ï†@Æ_ö?ï†3r+ô,?ï†3lG8Ð?ï†&^—Ô?ï†&yÞö?Øn¢?ó¸D?ï† _˜<)?ï† Y³ˆJ?ï…þ¢©Ã?ï…ýü½øc?ï…ð¤ùm;?ï…ðŸ¾\?ï…ãF–Þ?ï…ã@²1¼?ï…ÕçyÀ?ï…Õá•°?ï…ȇ¬¡P?ï…ÈÇùð?ï…»'#ô¤?ï…»!?OÅ?ï…­ÅçT£?ï…­À²D?ï… cò“ˆ?ï… ^ ó©?ï…“GgR?ï…’ûbÉô?ï……æ ?ï……˜r8?ï…x9ÎÁä?ï…x3ê)ˆ?ï…jÕJb?ï…jÏ´†?ï…]o}Ôœ?ï…]i™AA?ï…P Gl?ï…Pc “?ï…B¢Yy?ï…Bœtê·?ï…5:¶•Z?ï…54Ò „?ï…'Ò`§r?ï…'Ì|?ï…iS„V?ï…cnýƒ?ï… ÿñÁ?ï… ù©mp?ï„ÿ•”ð?ï„ÿ0!?ï„ò)æ3M?ï„ò$´?ï„ä¾ 7?ï„ä¸m?ï„×QkW?ï„×K†ÜÎ?ï„ÉähX?ï„ÉÞ7ð“?vÐÌ?p9[Š?iïê?…}+?ï„¡—ÿŒ?ï„¡’à?ï„”'ãH°?ï„”!þÚ÷?·ëÌ?±/€–?ï„yEMè?ï„y?¨å5?ï„kÓUˆ¾?ï„kÍq"?ï„^`nPK?ï„^Z‰ì ?ï„Pìʵ?ï„PææSÝ?ï„Cx{?ï„Cr–°r?ï„6sæ„?ï„5ýŠd?ï„(»S¦?ï„(‡Öú ?ï„P‡?ï„kÆp?ï„  5n~?ï„ šQë?ï„(_Ñö?ï„"{è?ïƒò¯Û8B?ïƒò©öè¸?ïƒå6§Þ ?ïƒå0Ñ›?ïƒ×¼»Èq?ïƒ×¶×}ñ?ïƒÊBø?ïƒÊ<;°?ÆÓ5%?Àîï¯?JÕ½r?Dñz‚?Î&Y?ÈB¥?PÅEÿ?Já?ұLÆ?ÌÍg?ïƒySì! ?ïƒyNè2?ïƒkÔz`Æ?ïƒkΖ*r?ïƒ^TO*+?ïƒ^Njö]?ïƒPÓtðÃ?ïƒPÍ¿|?ïƒCQígj?ïƒCL 8ª?ïƒ5ϱ‚¾?ïƒ5ÉÍV„?ïƒ(LÊ>ð?ïƒ(Fæ=?ïƒÉ0‘8?ïƒÃLj ?ïƒ DãCl?ïƒ >ÿÆ?ï‚ÿ¿å}ž?ï‚ÿº[?ï‚ò:8ò³?ï‚ò4TÓ?ï‚ä³J­u?ï‚ä­fe?ï‚×+F¾?ï‚×%b£{?ï‚É¢ïœ?ï‚Éœ«×›?ñâ?3Üi?ï‚®ŽïR?ï‚®‰ îa?ï‚¡ˆ?ï‚ þ+w«?ï‚“xue°?ï‚“r‘WÐ?ï‚…ì#¾Ï?ï‚…æ?³w?ï‚x_·q?ï‚xY9®¡?ï‚jÑ\Gá?ï‚jËxAš?ï‚]Bæïë?ï‚]=ì-?ï‚O³½ë5?ï‚O­Ùê?ï‚B#Û¦ä?ï‚B÷¨8?ï‚4“F-Ç?ï‚4b1¤?ï‚'÷í¨?ï‚&üô?ï‚oöð²?ï‚jù¢?ï‚ Ý?®?ï‚ ×[$'?ïþIÒ8?ïþCî#;?ïðµ«É?ïð¯ÇÙ‘?ïã Ó°U?ïãïÃl?ïÕ‹G Ü?ïÕ…c6~?ïÇõpø?ïÇï‰#?ïº^j~?ïºX#…4?ï¬Æ]m–?ï¬ÀyŠÖ?ïŸ-ú !?ïŸ(?ì?ï‘”à¤w?ï‘ŽüÆÍ?ïƒûŽÌ?ïƒõ1³¬?ïv`–6:?ïvZ²]¦?ïhÅadà?ïh¿}Ž×?ï[)z;ø?ï[#–h{?ïMŒÜ¡,?ïM†øÐ9?ï?ï'À?ï?é©YY?ï2Q‰'æ?ï2K¥\ ?ï$²Ìˆy?ï$¬è¿*?ï]Nd?ï y‡¡?ï s>™¹?ï mZÕ‚?ï€ûÒgü>?ï€ûÌ„:“?ï€î0àë‡?ï€î*ý,h?ï€àŽ¨2N?ï€àˆÄu¼?ï€Òë»*&?ï€Òå×p!?ï€ÅHòÒ?ï€ÅB9;Y?£ÌWˆ?袜?þƲœ?øã=?Y#—?S+sÆ?²¥ç;?¬Â9÷?ï€ †ç`?<©?ï€sc¶´=?ï€s]Ó ?ï€e»5Š˜?ï€eµQäü?ï€XýäH?ï€X A:?ï€Jh±?ï€Jb6s1?ï€<½‡s¼?ï€<·£ÕÊ?ï€/:¼ü?ï€/ W!™?ï€!fA!¶?ï€!`]ˆá?—ý”?´gM?ï€ 6ëÙ?ï€SX!?ïø^)¬>?ïøXF?ïê¯jº´?ïꩇ,?ïÜÿúTŒ?ïÜúÈ?ïÏOÚ' ?ïÏIöŽ?ïÁŸ Nþ?ïÁ™)È?ï³í‹j\?ï³ç§åþ?ï¦;Zuû?ï¦5vô-?|’?˜ŸS?ïŠÔêâà?ïŠÏf1?ï} (?ï}8­ù?ïoj6J¿?ïodRÓ0?ïa³•4&?ïa­±¿(?ïSü;þš?ïSöXŒ,?ïFD0¢H?ïF>M2j?ï8‹l- ?ï8…ˆÀS?ï*Ñô˜l?ï*Ì-°?ïÂò#?ï߉ø?ï\Øåj?ïVõÐ?ï¡:ú>?ï›W—6?ï~óäêÚ'?ï~óßy¯?ï~æ'á–6?ï~æ!þ8P?ï~Øj"GX?ï~Ød>ì?ï~Ê«±tk?ï~ʥΩ?ï~¼ì‚uÓ?ï~¼æŸ£?ï~¯,¢i®?ï~¯&¿?ï~¡l ÑM?ï~¡f(€A?ï~“ª¼ ¹?ï~“¤Ø½??ï~…èº{¬?ï~…â×/Ä?ï~x&Í?ï~x !6x?ï~jb—wf?ï~j\´0¤?ï~\žr0L?ï~\˜Žì?ï~NÙžç[?ï~NÓ»¥¾?ï~AÖ—?ï~A0—Ž?ï~3MÏÌP?ï~3GìÚ?ï~%†Þqž?ï~%€û7¼?ï~¿1¹”?ï~¹N‚D?ï~ öÕL‚?ï~ ðòÆ?ï}ü-Å"?ï}ü'áêú?ï}îcÿù»?ï}î^Ê'?ï}à™‡‹H?ï}à“¤^H?ï}ÒÎ^çœ?ï}ÒÈ{½1?ï}Å}»‚?ï}Äüš“«?ï}·5èŠb?ï}·0e?ï}©h¢iÞ?ï}©b¿G0?ï}›š¤u.?ï}›”ÁU?ï}Ëô›Õ?ï}Æ~Q?ï}ü”†?ï}ö±k!?ï}r,}PP?ï}r&š7ö?ï}d[¶U¦?ï}dUÓ?á?ï}VŠ<ø”?ï}V„Yåd?ï}H¸ W.?ï}H²'F“?ï}:å,é>?ï}:ßIÛ9?ï}-œ`;?ï}- ¹TÌ?ï}=V ?ï}7s-?ï}hbíl?ï}bç(?ï}’¹×?ï}ŒÖ )?ï|õ¼[›à?ï|õ¶xšÉ?ï|çåQèä?ï|çßnêc?ï|Ú “«±?ï|Ú°¯Ç?ï|Ì5µ;?ï|Ì/<»ç?ï|¾\3W?ï|¾V<š?ï|°‚,Ü=?ï|°|Iè?ï|¢§¥ì‰?ï|¢¡Âúú?ï|”ÌoâÚ?ï|”ÆŒóâ?ï|†ðŒfX?ï|†ê©yø?ï|yôšÏ?ï|y±?ï|k6ª(2?ï|k0ÇA?ï|]X±Œ4?ï|]RΧš?ï|OzÁî?ï|Ot#ßì?ï|Aš®Fš?ï|A”Ëg/?ï|3º¦ëc?ï|3´Ä‘?ï|%ÙéÖè?ï|%Ôü®?ï|ø0ð?ï|òžYO?ï| Ù}’?ï| ö¨‰?ï{ü2Â?ï{ü,9>R?ï{îMªÜ¶?ï{îGÈ Þ?ï{àh†?ï{àb£MØ?ï{Ò‚¢²Ì?ï{Ò|¿è&?ï{Äœ Ç-?ï{Ä–'ÿ!?ï{¶´¾’?ï{¶®Û̧?ï{¨Ì·:ã?ï{¨ÆÔx ?ï{šãú¤³?ï{šÞät?ï{ŒúG–?ï{Œôª‰ð?ï{d Ý?ï{ RÑ?ï{q%„Ú ?ï{q¢!œ?ï{c9òº?ï{c4)?ï{UM«J?ï{UGÈa ?ï{G`®#M?ï{GZËr«?ï{9rú·æ?ï{9m Þ?ï{+„£@?ï{+~¬÷Ó?ï{•rÅ¥?ï{Ó?ï{¥ *?ï{Ÿ½vó?ï{µ{8?ï{¯3ל?ïzóÃØìò?ïzó½öKñ?ïzåÑê~Õ?ïzåÌào?ïz×ßEÆí?ïz×Ùc+#?ïzÉëæÅh?ïzÉæ,:?ïz»÷ד˜?ïz»ñôý?ïz®Ž8?ïz­ý+úB?ïz  ’ü4?ïz °jÚ?ïz’gé4?ïz’…Zv?ïz„ ƒ³„?ïz„¡'b?ïzv(í ö?ïzv# q?ïzh0¤ƒ ?ïzh*Áü·?ïzZ7§-à?ïzZ1Ä©”?ïzL=ôrl?ïzL8ð½?ïz>C’,ö?ïz>=¯­ä?ïz0Hyi?ïz0B—ô?ïz"L¯ ?ïz"FÌ“D?ïzP1xÜ?ïzJO¡?ïzRþ=é?ïzMÉL?ïyøU6²?ïyøO8IJ?ïyêV‡6?ïyêP¤Æ¥?ïyÜW;p–?ïyÜQYÓ?ïyÎW=À[?ïyÎQ[V5?ïyÀV‘/4?ïyÀP®Ç¬?ïy²U-‹Z?ïy²OK&p?ïy¤S­ì?ïy¤M6K¡?ïy–PU R?ïy–Js@¦?ïyˆLÜ2%?ïyˆFùÕ?ïyzHµ Ä?ïyzBÒ¯U?ïylCÝ“°?ïyl=û;à?ïy^>Po;?ïy^8n ?ïyP8?"?ïyP2,ì?ïyB1!@ñ?ïyB+>ðÿ?ïy4)l?ïy4#žÇ?ïy&!-Ži?ïy&KCµ?ïy0¸l?ïyNpY?ïy |Ëà?ïy š†l?ïxükƒ?ïxûþ8(°?ïxíùŸm?ïxíó#_9?ïxßí>£R?ïxßç\e¿?ïxÑàÉåh?ïxÑÚçªu?ïxÃÓ§ »?ïxÃÍÅhi?ïxµÅϬF?ïxµ¿ív”?ïx§·J¨?ïx§±htý?ïx™¨’?ïx™¢2m!?ïx‹— Ê”?ïx‹‘¾œÅ?ïx}†ÒR?ïx}€:§$?ïxosåU3?ïxon,¦?ïxa`ðÄ„?ïxa[ž™?ïxSMI!¡?ïxSGfþW?ïxE8ð ã?ïxE3 ê?ïw9)"w³?ïw+ xØæ?ïw+–ìÿ?ïwé<_t?ïwãZv2?ïwÅH?Ý?ïw¿fY??ïw  à?ïwš¾ü?ïvò{J¤õ?ïvòuhâ?ïväU<2?ïväOZ/„?ïvÖ.x ?ïvÖ(–A—?ïvÈÆ ?ïvÈ&ì¨?ïv¹Þà]Þ?ïv¹Øþ‡ ?ïv«¶t-?ïv«°% ?ïvŒ{|?ïv†™ª”?ïvb9é?ïv\XE?ïv7DXñ?ïv1bŒÊ?ïvs Ì?ïvs¼?ïvdßBSW?ïvdÙ`Œ|?ïvV²6R?ïvV¬TÓ?ïvH„|Ǩ?ïvH~›?ïv:V :S?ïv:P*{l?ïv,&é ?ïv,!PÕ?ïv÷?t?ïvñ4…Û?ïvÆã¾?ïvÀ®,Ì?ïv•Z[â?ïvx§˜?ïuócsú?ïuó]‘kW?ïuå0Ö:h?ïuå*ô‹m?ïuÖý‰x-?ïuÖ÷§ËÙ?ïuÈÉŽr’?ïuÈìÈæ?ïuº”Ýî?ïuºŽûoê?ïu¬_{(—?ïu¬Y™„:?ïuž)k¥Î?ïuž#Š?ïuò©A?ïuìÇ¡ô?ïu»5–Î?ïuµSúk?ïusƒ¥B?ïus}2 ˆ?ïueJ>è?ïueD\ˆÖ?ïuWºÈ!?ïuW Ù3¸?ïuHÖ‡?ïuHÐ¥ƒS?ïu:›£A_?ïu:•Á²H?ïu,`&I?ïu,Z,™Û?ïu#Ì"}?ïu꘸?ïuæÖŠ)?ïuàõ?ïu¨«H£?ïu¢ÉÄ2?ïtóiq0t?ïtóc®¬?ïtå)xÊ»?ïtå#—K?ïtÖèÐ1?ïtÖâîž½?ïtȧoÙ?ïtÈ¡š?ïtºeS+à?ïtº_q´À?ït¬"†B ?ït¬¤Í˜?ïtߪ¤?ïtÙ 8Ú?ïtšÆÿ&?ït”å?ïtU×ØÙ?ïtOöle?ïts3¯?ïts Q¥æ?ïtdÉØÜZ?ïtdÃ÷u–?ïq—‡]Ž?ïq‰"êŠ?ïq‰ 74?ïqz¸Cª?ïqz²bÎ`?ïqlLj ´?ïqlF‰2Ã?ïq]ß}j ?ïq]Ùœ“Ê?ïqOqÛ ?ïqOkú5Œ?ïqA„}?ïq@ý£¬(?ïq2”s//?ïq2Ž’a?ïq$$®%Æ?ïq$ÍZR?ïq´5˜5?ïq®TÏt?ïqCðÿ?ïq="*ñ?ïpøÑÙ?ïpøË;Ã?ïpê^€ˆ:?ïpêXŸÇ“?ïpÛë+Æ?ïpÛåK!?ïpÍw!Þè?ïpÍqA#¨?ïp¿g?ïp¾ü†e’?ïp°Œó”^?ïp°‡Þ†?ïp¢Ìèö?ïp¢ì5Ò?ïp“ŸóS˜?ïp“š£(?ïp…(^æ˜?ïp…"~8Ý?ïpv°ÿß?ïpvª7TØ?ïph7{³?ïph1<Óa?ïpY½n6£?ïpY·‘?ïpKC²C?ïpK='[?ïp<Çï“÷?ïp<ÂóÄ?ïp.L" ?ïp.FAd?ïpÏ é?ïpÉ¿õ ?ïpRn+º?ïpL“§?ïpÔ¶?ïpΠûX?ïoôUåÎð?ïoôP ?ïn|”Ë›?ïnv´’¨?ïnæY´Ê?ïnày~‘?ïm÷OpnF?ïm÷I:Ç?ïmè·Õ'Ô?ïmè±ô÷?ïmÚŠËR?ïmÚªI?ïmˆ @†?ïmË€*7?ïm¼ë~½j?ïm¼åž”Ö?ïm®P=À?ïm®J]š,?ïmŸ´Bý?ïmŸ®aûà?ïm‘ô?ïm‘¯ù’?ïm‚z.Ÿ–?ïm‚tNï?ïmsÜÖØ?ïmsÖ5»í?ïme=DŸ9?ïme7d‡ ?ïmV½ß®?ïmV—ÝÊ:?ïmGýÏF?ïmG÷¡¼Ž?ïm9\õö?ïm9V­åú?ïm*ºçéJ?ïm*µÜ ?ïm‹Ùž?ïm«Ï?ïm uyþE?ïm o™ö~?ïlþѳåÜ?ïlþËÓàÓ?ïlð-8pE?ïlð'Xmø?ïlሠ+þ?ïlá‚),n?ïlÒâ&P(?ïlÒÜFSU?ïlÄ;ŒÊ?ïlÄ5¬µ?ïlµ”;öž?ïlµŽ[ÿF?ïl¦ì:CØ?ïl¦æZO=?ïl˜CÒ?ïl˜=¡àA?ïl‰šá·?ïl‰”:ò˜?ïlzïþ÷À?ïlzê ^?ïllE,õ*?ïll?M †?ïl]™§¾Ò?ïl]“Ç×ì?ïlNíoŒ?ïlNç§ð?ïl@@ƒ=í?ïl@:£\ƒ?ïl1’áµ?ïl1Öå?ïl"ä-œ?ïl"Þ¯Q¯?ïl5….8?ïl/¥U ?ïl…ÊžE?ïlêÇÖ?ïköÕ^^â?ïköÏ~‹3?ïkè$?Qt?ïkè_€ƒ?ïkÙrlW§?ïkÙlŒ‰v?ïkÊ¿ë¼?ïkʺ 5J?ïk¼ °ÕX?ïk¼Ñ ¦?ïk­XÇf4?ïk­Rç A?ïkž¤-”Ü?ïkžžMÑ©?ïkîß—ö?ïkèÿׄ?ïk8á¨?ïk3êg?ïkr‚3üµ?ïkr|TAÃ?ïkcÊÍwˆ?ïkcÄí¿U?ïkU¸ûö?ïkU ÙF„?ïkFYô¸?ïkFTd?ïk7 yªÃ?ïk7š™úÒ?ïk(æPš?ïk(àpìê?ïk+sÈ?ïk%”–?ïk oäÁÄ?ïk j?ïjü³¥S?ïjü­Åof?ïjíö¸ö ?ïjíðÙSß?ïjß9¡š?ïjß390?ïjÐzÆøê?ïjÐtç\B?ïjÁ»Åˆ¨?ïjÁµåîÂ?ïj²ü40?ïj²ö3 ?ïj¤;°3˜?ïj¤5П5?ïj•z¢©?ïj•t ?ïj†¸á?ïj†³y¯?ïjwömSÍ?ïjwðDZ?ïji3L{È?ïji-lòo?ïjZoyg£?ïjZi™á ?ïjKªõ£õ?ïjK¥ !?ïj<åÄ?ïj<ßä?ïj.â??ïj.ÀÊ?ïjXÑñÓ?ïjRòvI?ïjµ:Å?ïjŠÕÁþ?ïjÇßPË?ïjÁÿÚÇ?ïiòþS?ïiòøsžÙ?ïiä4´û?ïiä.1D?ïiÕiÃb?ïiÕc:Uª?ïiÆnsi?ïiÆ—v?ïi·Ñ ­H?ïi·Ë*E?ïi©ðõ’?ïi¨þ'?ïiš6!Û·?ïiš0By?ïi‹g¡ã[?ïi‹aƒy?ïi|˜gûÂ?ïi|’ˆž¥?ïimÈy¨¦?ïimšNN?ïi^÷Øsm?ïi^ñùÚ?ïiP&}ó5?ïiP žžg?ïiATs£½?ïiAN”Qµ?ïi2´oJ?ïi2{Õ ?ïi#®?9˜?ïi#¨_í?ïiÚ1¦?ïiÔ8çî?ïi>:ò?ïiÿ^ô?ïh÷/©œ0?ïh÷)ÊX?ïhèYcÎÆ?ïhèS„`?ïhÙ‚k¶e?ïhÙ|ŒwÅ?ïhʪ¼?Î?ïhʤÝõ?ïh»Ò]?ïhqý=?ïhqˆç?ïhb±gú¾?ïhb«ˆÒT?ïhSÔ"Xâ?ïhSÎC3@?ïhDö'F¶?ïhDðH#Û?ïh6|Bh?ïh6"U?ïh'8!‚d?ïh'2Be?ïhXSv?ïhR08ó?ïh wK3d?ïh ql©?ïgú•Öª„?ïgú÷•?ïgë³°ž?ïgë­Ñ‹ã?ïgÜÐÖ¢.?ïgÜÊ÷’Ì?ïgÍíN3>?ïgÍço&¥?ïg¿ þ?ïg¿-ô7?ïg°$r˜?ïg°=k?ïg¡>{v€?ïg¡8œrA?ïg’X(ï¢?ïg’RIî,?ïgƒq&eü?ïgƒkGgO?ïgt‰r¿?ïgtƒ“ë?ïge¡ð8?ïge›)÷?ïgV·ïÇ?ïgV²Í7?ïgGÎ(Á?ïgGÈI͉?ïg8ã®Ý?ïg8ÝÏìS?ïg)øƒŸ–?ïg)ò¤±£?ïg ©àÛ?ïgÊõ³?ïg EÄ?ïg <]f?ïfý2Þ—å?ïfý,ÿ²Q?ïfîDõ^n?ïfî?{¤?ïfßVVž¨?ïfßPw¾©?ïfÐg q‚?ïfÐa+”M?ïfÁwmÇ?ïfÁq/“^?ïf²†bÊÇ?ïf²€ƒó)?ïf£•oê?ïf£'›?ïf”¢ü4r?ïf”bj?ïf…°@`?ïf…ªaâ?ïfv¼×Ú?ïfv¶øMi?ïfgÈ>û)?ïfgÂ`1„?ïfXÒ—¼}?ïfX̸õ¤?ïfIÜ;‡¾?ïfIÖ\ñ?ïf:å*’N?ïf:ßKÑ?ïf+í_Ó¥?ïf+ç1?ïfôä­Ì?ïfïò$?ïf û²È×?ïf õÔû?ïeÿÇ»ø?ïeþûéê?ïeð.7?ïeðOƒÖ?ïeá á27?ïeáÂ?ïeÒÚWO?ïeÒ û©§?ïeÃÕ?ïeà @mû?ïe´¯¬`?ïe´ÑS?ïe¥Šø¨?ïe¥¬Si?ïe–²‚O?ïe–ÓßÝ?ïe‡%0.?ïe‡FŠ?ïexåÕv?ïex8 ?ïeiîl?ïei„d?ïeZB-,?ïeZc•ó?ïeKàé?ïeKT›?ïe<ÏÁÀ?ïe< ñ0$?ïe- ³?ïe-+$H?ïeŽó?ïe°g?ïebT?ï^¨‘ M\?ï^™DV‰Ú?ï^™>y5Õ?ï^‰ðù²?ï^‰ë±‹?ï^zœé×?ï^z— Ê?ï^kH#*?ï^kBEß?ï^[ò¦$ì?ï^[ìÈÜ]?ï^LœvÍ?ï^L–˜Ì?ï^=E‘Þ?ï^=?´›K?ï^-íù¾ ?ï^-è~?ï^•«Wþ?ï^Îè?ï^<­B—?ï^6Ð`?ï]ÿâõ{n?ï]ÿÝD?ï]ðˆŠ™?ï]ð‚­d–?ï]á-o\ô?ï]á'’+Y?ï]ÑÑ› ì?ï]Ñ˽Þ0?ï]Âu˧?ï]Âo9ŸÊ?ï]³Þù¡?ï]³Ф?ï]£¹î±±?ï]£´‹“?ï]”[MÎæ?ï]”Up«¨?ï]„ûùøÅ?ï]„öØg?ï]u›ð×J?ï]u–¹Ì?ï]f;7·Ç?ï]f5Z(?ï]VÙÌB?ï]VÓï*]?ï]Gw­d¬?ï]GqÐOÎ?ï]8Ú!?ï]8üü#?ï](±S¹!?ï](«vª?ï]Mà?ï]G>Óß?ï] è2·?ï] âU®%?ï\ú‚˜s¶?ï\ú|»m;?ï\ëFì÷?ï\ëié]?ï\ÛµD´†?ï\Û¯g³Í?ï\ÌM‘þÏ?ï\ÌGµ÷?ï\¼å)êp?ï\¼ßLïz?ï\­|’Z?ï\­v8šE?ï\žLE?ï\ž oOë?ï\Ž§ÓM?ï\Ž¡öZ¯?ï\<¥Éž?ï\6ÈÚ/?ï\oÐÊIä?ï\oÊí]W?ï\`d9c?ï\`^\yò?ï\PöúêH?ï\Pñ?ï\A‰ þY?ï\Aƒ-r?ï\2i^ ?ï\2Œ}œ?ï\"«qF?ï\"¥8“$?ï\;~˜?ï\56£Z?ï\Ê]c‡?ï\Ä€‹,?ï[ôX÷#l?ï[ôSMô?ï[äæàó$?ï[äá ?ï[Õt9ú?ï[Õn:jH?ï[ÆŸ?/?ï[ÅúÂr`?ï[¶Œ{À»‚?ïZqXb.b?ïZaÚ…|?ïZaÔ#ûB?ïZRU Ü?ïZRO/ŽŠ?ïZBÏf¬i?ïZBÉŠ'þ?ïZ3I -£?ïZ3C-¬?ïZ#Áýå?ïZ#¼ H?ïZ:=$´?ïZ4`¨þ?ïZ±Æ³V?ïZ«ê:ˆ?ïYõ(œ2?ïYõ"À K?ïYåžÁG4?ïYå˜äÔ4?ïYÖ.ëå?ïYÖR{Í?ïYƈéjÿ?ïYƃ ýÐ?ïY¶üò:§?ïY¶÷Ð`?ïY§pHKü?ïY§jkäœ?ïY—âè ¾?ïY—Ý §G?ïYˆTÚ}þ?ïYˆNþo?ïYxÆÄ?ïYxÀ9ev?ïYi6 ]A?ïYi0Ä„?ïYY¦z|ì?ïYY ž$?ïYJœÊ”?ïYJÀt©?ïY:„ Äž?ïY:~1qœ?ïY*ñÌ\Þ?ïY*ëð Å?ïY^×…l?ïYXû8S?ïXž¨kr?ïX'?ïX7ô?ïX{/¨?ïXuSxv?ïXoàº5?ïXoÚÁ?ïX`EUÈ ?ïX`?y×?ïXP©`Î2?ïXP£„¦è?ïXA ¹üP?ïXAÝ×ñ?ïX1obǤ?ïX1i†¦1?ïX!Ñ]æ?ïX!Ëdž?ïX2¦ˆ?ïX,Êl‚?ïX“;¡£?ïX_ˆñ?ïWòó!)T?ïWòíE?ïWãRX“ú?ïWãL|!?ïWÓ°àÔþ?ïWÓ«Å?ïWÄ·Ÿ?ïWÄÛ’?ïW´kÝ(8?ïW´f#?ïW¤ÈRãß?ïW¤ÂvÜ·?ïW•$‡?ïW•?ƒC?ïW…3†X?ïW…yW… ?ïWuÙ•S?ïWuÓÁ–ñ?ïWf3X¨„?ïWf-|­?ïWVŒc´7?ïWV†‡»¯?ïWF佬÷?ïWFÞá·\?ïW7?Â?ïW86UÝ?ïVø’,Ze?ïVøŒPso?ïVèå‘b&?ïVèßµ~?ïVÙ8A‰Ó?ïVÙ2e¨¹?ïVÉŠ@Âò?ïVÉ„däÇ?ïV¹Û‡Â?ïV¹Õ«ça?ïVª,zŽ?ïVª&>¢@?ïVš{ù“?ïVšvH4?ïVŠË#Þ~?ïVŠÅH ?ïV{˜q|?ïV{¼¡ú?ïVkg\±?ïVka€:?ïV[´iÓÚ?ïV[®Ž 7?ïVLÄŠ^?ïVKúèë?ïV?ïRÈ~Óz?ïRÈx÷ÿñ?ïR¸¢(_?ïR¸œLôÌ?ïR¨ÄÇé?ïR¨¾ìÐf?ïR˜æ²Ú´?ïR˜à×Å?ïR‰ëŽð?ïR‰|D?ïRy(oÀ©?ïRy"”°õ?ïRiH@Ý©?ïRiBeÐí?ïRYg]Ü°?ïRYa‚Òë?ïRI…Æð?ïRIëéG?ïR9£|J.?ïR9¡FY?ïR)ÀÏ?ïR)º¦Î*?ïRÜÐMc?ïRÖõO?ïR øk©€?ïR ò®•?ïQúUPÄ?ïQú zXÒ?ïQê-Šÿ]?ïQê'° c?ïQÚG˜§?ïQÚA5¦¦?ïQÊ_åÂ?ïQÊZ $»?ïQºx·“?ïQºr(Ë…?ïQªq¢?ïQª‰–¸ù?ïQš¦/f?ïQš TJ?ïQŠ¼4³æ?ïQŠ¶YÐÅ?ïQzщÄ?ïQzË®%?ïQjæ,-b?ïQjàQP4?ïQZús4?ïQZô>™?ïQK XhÜ?ïQK}‘¢?ïQ;æË¢?ïQ; ÷b?ïQ+1¿äº?ïQ++åu?ïQBëD¯?ïQ=ve?ïQ Sbú¤?ïQ Mˆ/T?ïPûc'9~?ïPû]Lq)?ïPër;âh?ïPëla?ïPÛ€ŸíÄ?ïPÛzÅ+e?ïPËŽOàG?ïPˈu ã?ïP»›R?ïP»•wR&?ïP«§¢ýO?ïP«¡ÈCâ?ïP›³BßP?ïP›­h(Þ?ïP‹¾3!?ïP‹¸Xmš?ïP{Èu.Ð?ïP{š~V?ïPkÒT’?ïPkÌ)§?ïP[Úáÿ?ïP[ÕT„?ïPK㚘?ïPKÝ4ó?ïP;êŒ ©?ïP;ä±| ?ïP+ñWÄ,?ïP+ë}"Ÿ?ïP÷u*¼?ïPñšŒ,?ïP üß¡ì?ïP ÷X?ïOü{?ïOûûÂâ~?ïOì¬v\?ïOëÿÑàÂ?ïOÜ Q?ïOÜ.ˆµ?ïOÌ ¶V?ïOÌÛ¶?ïO¼ ·0P?ïO¼Ü£®?ïO¬ ú?ïO¬ .|V?ïOœ¨Ä?ïOœ Í’?ïOŒ›ðô?ïOŒ ÁmK?ïO|ßÞ?ïO| ]g?ïOl uKû?ïOlšÎN?ïO\ \m°?ïO\ó?ïOL”=ž?ïOL¹Åî?ïO<¶|?ïO;ÿAAÉ?ïO,‚S?ïO+ú§¡Ÿ?ïOúâã(?ïOõts?ïO ôf?ïO îµ®°?ïNûí‡y¯?ïNûç­ø?ïNëåÉ2®?ïNëßîÌö?ïNÛÝWç}?ïNÛ×}„Å?ïNËÔ3Év?ïNËÎYi½?ïN»ÊYa–?ïN»ÄÝ?ïN«¿ÊÄ?ïN«¹ïÀ ?ïN›´‡[¬?ïN›®­ó?ïN‹¨ à?ïN‹¢µÍ'?ïN{›ç Ö?ïN{– º?ïNkŽ‰Û>?ïNkˆ¯…?ïN[€xÃÇ?ïN[zžy?ïNKq·H?ïNKkÝU?ïN;b@‚¦?ïN;\f=ï?ïN+R$?ïN+L;Óm?ïNA8†n?ïN;^G¸?ïN /«®µ?ïN )Ñs?ïMûiª?ïMûqM?ïMë u?ïMëšãk?ïMÚöÎ-Â?ïMÚðóû?ïMÊâr«#?ïMÊܘ{s?ïMºÍfhë?ïMºÇŒ<=?ïMª·¥ó4?ïMª±ËɈ?ïMš¡5!X?ïMš›Zú®?ïMŠŠ¶Ð?ïMŠ„7“(?ïMzr=€?ïMzlbûÚ?ïMjYµN?ïMjSÚøª?ïMZ@{ '?ïMZ: ò†?ïMJ&‘ •?ïMJ ·ˆ÷?ïM: ô'(?ïM:Œ?ïM)ð¤ Ñ?ïM)êÉø9?ïMÔ£çñ?ïMÎÉÙ[?ïM ·ò¼´?ïM ²±!?ïLùšƒ?ïLù”µzð?ïLé|znj?ïLév hÞ?ïLÙ]³¯?ïLÙWÙ­?ïLÉ><¯e?ïLÉ8b¯à?ïL¹BÂ?ïL¹?FA?ïL¨ý?é#?ïL¨÷eï¦?ïL˜Û¶ä@?ïL˜ÕÜíÇ?ïLˆ¹}/í?ïLˆ³£Ä?ïK5L6oø?ïK5F\»÷?ïK%us‹?ïK%›Â‘?ïK糞«?ïKáÙð¹?ïK´@Ï?ïK®g$4?ïJô€?ïJôz9ç7?ïJäK4R?ïJäEZÜw?ïJÔ¥ ý?ïJÔËi)?ïJÃß^ ×?ïJÃÙ„‚ ?ïJ³¨dÆv?ïJ³¢‹*²?ïJ£p·ø?ïJ£jÞ_U?ïJ“8U}ª?ïJ“2{ç÷?ïJ‚ÿ=ˆw?ïJ‚ùcõÌ?ïJrÅu?ïJr¿›‹b?ïJbŠøÉ?ïJb…1ÑÒ?ïHÜ8XŽ0?ïHËòRí ?ïHËìy¬w?ïH»¥Á‰8?ïH»ŸèK®?ïH«X€=Ž?ïH«R§?ïH› n?ïH›·6¡?ïHŠ»ñ>?ïHŠ¶äÙ?ïHzlžØˆ?ïHzfŧ0?ïHj›R?ïHjÁâ?ïHYËê¼D?ïHYÆ‘?ïHIzˆ?ïHIt®èë?ïH9(v×à?ïH9"²»?ïH(Õ¶ˆ?ïH(ÏÜíp?ïH‚A r?ïH|hh?ïH.j$?ïH(FN'?ïG÷ÙM‡F?ïG÷ÓtnW?ïGçƒË©„?ïGç}ò“£?ïG×-œfª?ïG×'ÃSÖ?ïGÆÖ¾¾ ?ïGÆÐå®E?ïG¶,çn?ïG¶ySÚ¶?ïG¦&ñÖ8?ïG¦!Ì?ïG•Î,Œ?ïG•È+%ñ?ïG…tg±ó?ïG…nŽ®f?ïGuff?ïGuBeè?ïGd¿!ß?ïGd¹Há¨?ïGTcxêS?ïGT]Ÿïó?ïGD$N§?ïGDKWV?ïG3ªwi?ïG3¤Fƒ'?ïG#Lj–§?ïG#F‘¥t?ïGí˜T?ïGç¿eõ?ïGª„?ïG‡é¿q?ïFò-8ø?ïFò'_µô?ïFáËüÁE?ïFáÆ#ÜQ?ïFÑj"?ïFÑd51>?ïFÁi0?ïFÁQK?ïF°¤Ü/?ïF°ž9l?ïF @d?ïF :.=±?ïFÛGÝú?ïFÕoX?ïFuÓ2h?ïFoú_Ö?ïFo¯8Ù?ïFo ÖiX?ïF^¨Ö,Î?ïF^¢ý`^?ïFNAH>æ?ïFN;ou‡?ïF=Ù bº?ïF=Ó1œm?ïF-pÔÄ?ïF-j>ˆ?ïFqW½?ïF˜—’?ïF œëV?ïF –@.=?ïEü1 €?ïEü+3Õx?ïEëÅPH?ïEë¿wOS?ïEÛXâOc?ïEÛS ›€?ïEÊë¾Ù«?ïEÊåæ(Ù?ïEº}ê—Q?ïEºxé’?ïEªdˆh?ïEª ‹Ý¼?ïE™ ,Ýf?ïE™šT5Ì?ïE‰0CÆÆ?ïE‰*k"??ïEx¿¨Dì?ïEx¹Ï£w?ïEhNX(d?ïEhHŠ?ïEWÜW2"?ïEWÖ~–Ô?ïEGi©"p?ïEGcЊ4?ïE6öEÚ&?ïE6ðmDþ?ïE&‚3yŒ?ïE&|Zçw?ïE oÑj?ïE—Bi?ïE—öSˆ?ïE’Ç›?ïDõ!ÎO9?ïDõõÆ`?ïDäªöÅ5?ïDä¥?o?ïDÔ3lWV?ïDÔ-“Ô¥?ïDû3ôš?ïDõ[tý?ïD³BI—?ïD³?ïB¥N?ïB ‰ó†ú?ïB „‰%?ïAüóOÿÇ?ïAüíx ?ïAì[ø‹=?ïAìV “›?ïAÛÃ?ïAÛ¾’?ïAË+0ôl?ïAË%Yÿ?ïAº‘Àò?ïAº‹èŸ?ïA©÷Ÿo?ïA©ñǃ×?ïA™\Ê®œ?ïA™VòÆ?ïAˆÁC ª?ïAˆ»k;¨?ïAx% {º?ïAx4™Ò?ïAgˆ#i ?ïAg‚KŠ>?ïAVꈫ?ïAVä°<ú?ïAFL;çF?ïAFFd°?ïA5­?È?ïA5§g/N?ïA% Gð?ïA%·u‘?ïAm. |?ïAgV>9?ïA̱ë?ïAÆDåÄ?ï@ó*Y R?ï@ó$CG?ï@â‡çþR?ï@â‚8c?ï@ÑäÃÚ?ï@ÑÞì/?ï@Á@íü?ï@Á;þõįí?ï>þïíDe?ï>î>À†2?ï>î8éÊ?ï>݇a?ï>Ý8¶?ï>ÌÎD®m?ï>ÌÈmLF?ï>¼vÂy?ï>¼Ÿcr?ï>«Y÷0?ï>«TÔ(?ï>šž½ü"?ï>š˜æ£\?ï>‰âÔª†?ï>‰ÜýTá?ï>y&;iØ?ï>y dU?ï>hhëj_?ï>hcý?ï>WªèZ®?ï>W¥m?ï>Fì4¾t?ï>Fæ]uT?ï>6,ÊñJ?ï>6&ó«L?ï>%l¯Ë~?ï>%f؈¡?ï>«âQâ?ï>¦ '?ï>ê^ ä†Î£?ï=ó(+Mz?ï=ó"T?ï=âeFÉX?ï=â_o“?ï=Ñ¡®Z?ï=Ñ›×&á?ï=ÀÝe¬º?ï=À׎|ª?ï=°irÍ?ï=°’Eà?ï=ŸR¼/A?ï=ŸLåv?ï=ŽŒ\ç…?ï=Ž†…ÀÞ?ï=}ÅLô…?ï=}¿uÑ?ï=lý‰?ï=l÷±è.?ï=\5|Ã?ï=\/;_„?ï=Kkìý&?ï=Kfã ?ï=:¢¿ë?ï=:œ:¨ó?ï=)ׇíp?ï=)Ñ°Ùœ?ï= Maû?ï=vQJ?ï=@_ú@?ï=:ˆì´?ï<÷sÃaš?ï<÷mìW2?ï<æ¦utÊ?ï<æ žm†?ï<ÕØrçÐ?ï<ÕÒ›ã°?ï<Å Á¸ ?ï<Åê·%?ï<´:`ëÎ?ï<´4‰í÷?ï<£jN`2?ï<£dwe€?ï<’™ŠDë?ï<’“³M^?ï<Èò~?ï<Â>þ?ï{eJ?ï<>uŽ&w?ï<-¦~ö‡?ï<- ¨Ø?ï<Ðêím?ï<Ë ä?ï< ú¦ÑB?ï< ôÏòß?ï;û#³ú'?ï;ûÝê?ï;êL—Ÿ?ï;êF;¿ˆ?ï;Ùs¾7ª?ï;Ùmçbº?ï;Èš»«¯?ï;È”äÙå?ï;·Á úð?ï;·»3,M?ï;¦æ§¤?ï;¦àÐ9'?ï;– –qD?ï;–¿¨î?ï;…/×H9?ï;…*ƒ ?ï;tSh‘?ï;tM‘Ï?ï;cvK£Ï?ï;cptäî?ï;R˜‡ÿ?ï;R’¨ÌE?ï;Aºm…?ï;A´-´ò?ï;0ÚÝûÈ?ï;0ÕF]?ï;ûêÂ?ï;õ28~?ï;ƒÈ?ï;¬k¬?ï:þ9P3?ï:þ3y‡'?ï:íWlì€?ï:íQ–C³?ï:ÜtÚžµ?ï:Üoù?ï:Ë‘›ÈÔ?ï:Ë‹Å&X?ï:º­¯s?ï:º§ØÓ¿?ï:©ÉÍP?ï:©Ã?1%?ï:˜ãd5?ï:˜Ýk2?ï:‡ü³/?ï:‡öÜ{U?ï:wI¶S?ï:ws#£?ï:f--ç/?ï:f'WW¨?ï:UD`ù\?ï:U>Šlþ?ï:DZÞ~Q?ï:DUõ?ï:3p«Ap?ï:3jÔ»e?ï:"…ÆIÙ?ï:"ïÆ÷?ï:š,PÔ?ï:”UÑ?ï:­â!$?ï:¨ ¤–?ï9ïÀät3?ï9ï» úÏ?ï9ÞÓ2QÙ?ï9ÞÍ[Û ?ï9ÍäÎ6?ï9ÍÞ÷À?ï9¼õ»Å8?ï9¼ïåUS?ï9¬ñö?ï9¬‰\?ï9›y5?ï9›¢¦?ï9Š$LŒO?ï9Šv%ê?ï9y2l´??ï9y,–Q?ï9h?ÞGþ?ï9h:çï?ï9WLœÛà?ï9WFÆ~ý?ï9FX©Å3?ï9FRÓkz?ï95d I?ï95^-µ¼?ï9$n¯Rþ?ï9$hØÿ?ï9x¦V?ï9rϸ ?ï9ëÎ.?ï9|%?ï8ñŠƒ”?ï8ñ„¬Õ·?ï8à’g’y?ï8àŒ‘KÈ?ï8Ï™›¢?ï8Ï“Å^ƒ?ï8¾  £?ï8¾šJb¨?ï8­¥ñ?ï8­ Èñ?ï8œ«’d?ï8œ¥;Xd?ï8‹¯ƒœn?ï8‹©­e›?ï8z³@oé?ï8z­jêN?ï4ÐO=}®?ï4ÐIgùw?ï4¿+´v?ï4¿%ßs?ï4®yÿ_?ï4®¤‘?ï4œâѽ?ï4œÜ¸W#?ï4‹¼ôÎy?ï4‹·W?ï4z–§/S?ï4zÑ»#?ï4io«óã?ï4iiÖ‚ç?ï4XGÿáÆ?ï4XB*sÿ?ï4G¢˜?ï4GÌš?ï45ö”Ð$?ï45ð¿hÈ?ï4$Ì×Oú?ï4$ÇëÔ?ï4¢fJÄ?ï4œéÓ?ï4wFyU?ï4qqš?ï3ñKvçb?ï3ñE¡ŒÝ?ï3àøå¯?ï3à#Ž`?ï3ÎñË€ ?ï3Îëö+ó?ï3½Ãí†?ï3½¾q£?ï3¬•^¹V?ï3¬‰kª?ï3›f ×?ï3›`K?ï3Š65m³?ï3Š0`&s?ï3y˜!†?ï3xÿÂÝ}?ï3gÔL‡ÿ?ï3gÎwG-?ï3V¢RÏ?ï3Vœ}‘ä?ï3Eo¦žˆ?ï3EiÑd$?ï34z?ï1Ê_’Jò?ï1¹"NêN?ï1¹yú?ï1§Þ‚¾¶?ï1§Ø­Ñ¢?ï1–š ?ï1–”/ .?ï1…TÒù®?ï1…Nþ?ï1tîšn?ï1t · ?ï1bÈZ{»?ï1bÂ…›’?ï1Q‰“?ï1Q{?¬¥?ï1@9oC?ï1@3C•?ï1.ðký>?ï1.ê—&Ç?ï1§@\?ï1¡9m?ï1 \ÿf?ï1 W*–?ï0û>{v?ï0û i®±?ï0éÆË®'?ï0éÀöä?ï0Øz©l4?ï0ØtÔ¥æ?ï0Ç-Ô‚Z?ï0Ç'ÿ¿H?ï0µàP~Ä?ï0µÚ{¾ï?ï0¤’c?ï0¤ŒDQÉ?ï0“C0Ÿ4?ï0“=[å×?ï0ó—^Ï?ï0í¨¯?ï0p£MzÕ?ï0pxÇñ?ï0_RPá?ï0_L|1j?ï0N£ÿ#?ï0MúÏR¸?ï0<®G¦?ï0<¨rYx?ï0+[;8ú?ï0+Uf“ ?ï0€Ïš?ï0¬,ç?ï0³u\?ï0­>Õæ?ï/÷]õ—Œ?ï/÷X ûT?ï/æ)£ ?ï/æU ?ï/Ô±ª'È?ï/Ô«Õ’ ?ï/ÃZ{ÑÔ?ï/ÃT§?U?ï/²Ÿî?ï'E|VÕ?ï'?©g?ï&ï”P„.?ï&ïŽ}˜'?ï&ÝâxŸD?ï&ÝÜ¥¶‹?ï&Ì/ïUÁ?ï&Ì*pX?ï&º|·5?ï&ºvä%?ï&¨ÈÏàW?ï&¨ÂýŒ?ï&—7Û‚?ï&—e?ï&…^òq"?ï&…Y˜ö?ï&s¨þ´²?ï&s£+ßÖ?ï&aòZ Ü?ï&aì‡ÏO?ï&P; ­œ?ï&P56ß_?ï&>ƒ Õ¦?ï&>}7 ¹?ï&,ÊY?ï&,ĆLi?ï&ûùY?ï& )5 ?ï& VïgÅ?ï& Q¦É?ï%÷œ5½Ü?ï%÷–c0?ï%åàΠ?ï%åÚûUE?ï%Ô$¹¢¤?ï%Ôæëš?ï%Âgörc?ï%Âb#¾ª?ï%°ª†Ý?ï%°¤´,¨?ï%žìhÞZ?ï%žæ–1C?ï%-œ£L?ï%'Éù†?ï%{n"Xí?ï%{hO²y?ï%i­ýuv?ï%i¨*ÒS?ï%Wí'“s?ï%WçTó¢?ï%F+§r$?ï%F%ÔÕ¤?ï%4iyõl?ï%4c§\??ï%"¦ê?ï%" Ê„?ï%ã=E?ï%Ý@ª¼?ï$ÿݤ¨?ï$ÿ q?ï$íY•©^?ï$íSÃz?ï$Û“TUÍ?ï$ÛÍ;?ï$ÉÌ`¥:?ï$MBl7B?ï$;{»zM?ï$;ué©?ï$)®ˆŽ?ï$)¨µ¡>?ï$à£d0?ï$ÚÑ4?ï$ ¹ ?ï$ ;Xe?ï#ôBÈJ?ï#ô<õí.?ï#ârÑr?ï#âlþ»t?ï#Т'.|?ï#ÐœT×Ò?ï#¾ÐÐ6}?ï#¾Êýã(?ï#¬þÅÍ.?ï#¬øó}.?ï#›, MS?ï#›&8¨?ï#‰X `?ï#‰RÍÈ ?ï#w„‚èx?ï#w~°¢w?ï#e¯¶D7?ï#e©äŒ?ï#SÚ:P†?ï#SÔh0?ï#B Ý:?ï#Aþ8¡:?ï#0--‰ž?ï#0'[Pó?ï#U¢x?ï#OÐL#?ï# }d~$?ï# w’L%?ï"ú¤uÙÁ?ï"úž£«?ï"èÊØî?ï"èÅÂÄ?ï"ÖðŒÐH?ï"Ö꺨L?ï"Å‘¬f?ï"Å¿‡Á?ï"³9æ—Ú?ï"³4v‹?ï"¡]Š¨2?ï"¡W¸Š:?ï"€Mu?ï"z¯2Õ?ï"}¢É ?ï"}œ÷…Â?ï"kÄ`›?ï"k¾Žk¨?ï"YåIdä?ï"YßwTH?ï"Hƒb?ï"Gÿ±UL?ï"6% x0?ï"6:nD?ï"$Cé+b?ï"$>$Í?ï"b{—?ï"\ExZ?ï"•h ?ï"yÃh»?ï!îœeKJ?ï!î–“N¾?ï!ܸ†9°?ï!ܲ´@|?ï!ÊÓùv6?ï!ÊÎ'€Y?ï!¸îÀC?ï!¸èîP›?ï!§׊”?ï!§›i?ï!•"?y?ï!•mD?ï!ƒ:úfä?ï!ƒ5(~j?ï!qS€8?ï!qM6›?ï!_jf¯ð?ï!_d”Î(?ï!My©?ï!M{G›;?ï!;—Þ?ï!;‘M?ï!)¬sÈ¥?ï!)¦¡ðê?ï!Áç¼?ï!»M[?ï!Õ&£?ï!ÏKU›?ï óèl†½?ï óâš¹?ï áû 4¬?ï áõ;jX?ï Ð X?ï Ð0Ö^?ï ¾G‚*?ï ¾u¾Š?ï ¬.ã¥V?ï ¬)å?ï š>Òݶ?ï š9 Ë?ï ˆN-]?ï ˆHAsÍ?ï v\C¯X?ï vVqù#?ï di{¼‚?ï dcª ¨?ï Rvî?ï Rp0on?ï @Ôק?ï @|+ƒ?ï .Œøf^?ï .‡&½•?ï —i·?ï ‘˜–?ï ¡* ê?ï ›XgÙ?ïøª9ŠJ?ïø¤gë•?ï沕$Æ?ïæ¬Ã‰l?ïÔºAXL?ïÔ´oÀN?ïÂÁ<&f?ï»j‘Ä?ï°Ç„¥¶?ï°Á³p?ïžÍ¾?ïžÇIsÕ?ïŒÒ£ö?ïŒÌ1i?ïzÖ9Ž??ïzÐh?ïhÙ¾×p?ïhÓíS?ïVÜ•è’?ïVÖÄh?ïDÞºšè?ïDØéÏ?ï2à/Bð?ï2Ú]É4?ï àñãK?ï Û lì?ïáÐK?ïÛ3]K?ïüàh5V?ïüږų?ïêßT?ïêÙH©?ïØÝ؈?ïØ×Lo ?ïÆÚqæ?ïÆÔ \?ï´×(Ø?ï´ÑBƬ?ï¢Ó!/?ï¢Í6Âa?ïÎKn@?ïÈzÑ?ï~ÈßOº?ï~à ÷©?ïlÂÃñ#?ïl¼òœq?ïZ»ú‘î?ïZ¶)@š?ïH´€!ø?ïH®®Ô?ï6¬TÍ?ï6¦ƒ‚{?ï$£~!Ò?ï$¬Ú›?ï™öèÖ?ï”%¤ÿ?ï¿Mí?ï‰î u?ïî„Ù¤(?ïîg?ïÜyF?ïÜstÝa?ïÊm—²?ïÊg0aY?ï¸`Œd?ï¸Z>Yl?ï¦Rp ¾?ï¦Lžñ%?ï”D F?ï”>Oæ?ï‚5$uè?ï‚/SM?ïp%y¡ž?ïp¨|&?ï^![?ï^OæD?ïLÂœ?ïKþH£å?ï9òcü8?ï9ì’àâ?ï'àô*?ï'Ú/Ü4?ïÌíœè?ïLjT?ï¹.n¸?ï³]]…?ïñ¤Áo4?ïñžðab?ïߨð?ï߉×å­?ïÍyàÑh?ïÍtÊY?ï»ckdò?ï»]šaE?ï©LIée?ï©Fxé?ï—4{w¶?ï—.ªzÌ?ï…ÿ)?ï…./‡?ïsÖ<?ïrýEð?ï`èþ·g?ï`ã-Ä¥?ïNÎ{þì?ïNÈ«‹?ï<³LL?ï<­{-N?ï*—n ?ï*‘7l?ïzâ?C?ïuZ ?ï]¬ìÌ?ïWÜ ö?ïô?h.å?ïô9—Pr?ïâ )¶?ïâXÚù?ïÐ:ÉÓ?ïÏúiò'?ï½ßš‚™?ï½ÙÉ®Q?﫾I ?﫸x:1?FŽ?ï™–uÀ…?ï‡y“6'?ï‡sÂl ?ïuV+÷ì?ïuP[14?ïc2XÂ?ïc,E•n?ïQ N;?ïQ}{*?ï>çÓÉî?ï>â c?ï,Áªf?ï,»Ù¬ì?ïšÐ[?ï”ÿ`™?ïsAÐ.?ïmqÑ?ïöKM)?ïöE7ž1?ïä";L?ïäK¹?ïÑø~×m?ïÑò®/??ï¿Î1^D?ï¿È`¹{?ï­£6ì?ï­e|‰?ï›w‡é,?ï›q·K.?ï‰K*æ?ï‰EY…O?ïwþ?ïwMgN?ïdð_ió?ïdêŽÖ'?ïRÁòÓ,?ïR¼"BÆ?ï@’Ô€?ï@’?ï.c®1?ï.]6$˜?ï2‹»l?ï,»5:?ï _-?ï ûŽªF?ï÷Ï„aü?ï÷ɳâ˜?ïåœúsô?ïå—)÷ö?ïÓiŸ ?ïÓcò&‰?ïÁ5ØÊ4?ïÁ0U?ï¯Ad®?ï®ûpòæ?ïœËü™y?ïœÆ,+?q®?ïŠ8µ?ïx_ez?ïxY”°è?ïf(Éç?ïf"Ce½?ïSðp?ïSêB.®?ïA·b¥*?ïA±’GÐ?ï/~h`?ï/x7n?ïCùH?ï>)8¿?ï ?©J?ï oV)?ïøÍ×À7?ïøÈp?ï摾ͯ?ïæ‹î_?ïÔTúO´?ïÔO*Í?ï‰`Ë?ï¹N?ï¯Ùgêt?ï¯Ó—¨_?ïššY¯?ï”Ê?ï‹[ Ù˜?ï‹UPžU?ïyõ3®?ïy$ûÕ?ïfÚõ$?ïfÔMÀµ?ïT˜š8ä?ïT’ÊÞ?ïBVh å?ïBP—ÜI?ï0‰³Ð?ï0 ¹‰Ÿ?ïÏþQÙ?ïÊ.+?ï ‹ÃïV?ï …óËø?ïùFÝçÍ?ïùA ÇÚ?ïçKV?ïæû{:?ïÔ» G7?ïÔµ:.?ïÂté?ïÂnMÿ6?ï°,†êß?ï°&¶Ø–?ïä@µi?ïÞp¦‹?ï‹›NÏZ?ï‹•~Ãè?ïyQ²s½?ïyKâk¶?ïgü?ïg5÷õ?ïT»cÚg?ïTµ“Ù7?ïBoF¿?ïBi?Hû?ï0" {z?ï09"?ïÔUÑK?ïÎ…Ú_?ï …ï$é?ï €1i?ïù6׿¡?ïù1Ï?ïæç¼`?ïæá>Ϲ?ïÔ–•TÜ?ïÔÅk¡?ïÂEk³V?ïÂ?›Íˆ?ï¯óòß?ï¯íÁ}?ï¡=ß?ï›5^ê?ï‹MǯŸ?ï‹G÷Ô?ïxùÙº?ïxô ©Ÿ?ïf¥> º?ïfŸn7 ?ïTOï¨?ïTJLh?ïAùò-?ïAô"_H?ï/£FUJ?ï/vŠå?ïKè“ê?ïFÌó?ï óÜ@!?ï î |™?ïø›Wß?ïø•N—Ä?ïæA¯Ô?ïæ;ßI'?ïÓ瓾(?ïÓáÄé?ïÁŒÉ~ò?ïÁ†ùÉ"?ï¯1L8-?ï¯+|…Ì?ïœÕ!] ?ïœÏQ®­?ïŠxFüŽ?ïŠrwQ ?ïx»"?ïxëz{?ïe¼ƒBª?ïe¶³ž?ïS]›Mr?ïSWˬI?ï_×o5?ïMa#¶~?ïM[T¥ú?ï:äT­?ï:Þ…Ÿó?ï(fØ®É?ï(a ¥.?ï謿½?ïâݹ˜?ïiÍäG?ïcþá—?ïðê@xD?ïðäqy ?ïÞj¥l?ïÞd5©§?ïËéK`?ïËãES?ï¹gvê§?ï¹a§õÍ?ï¦å)ˆ?ï¦ßZ–¯?ï”b+A[?ï”\\Sm?ïÞ}L½?ïØ®bE?ïoZ!ìr?ïoTSp?ï\ÕõŒ?ï\ÏC?ïJOX ?ïJI‰+?ï7Èí`?ï7Ã%Â?ï%AÑœ?ï%<,t?ïºn­?ï´9˜ü?ï1C¨?ï+Áqn?ïí¨h®£?ïí¢™ßá?ïÛ’å?ïÛÄ6?ïÈ”x?ïÈŽ?>£?ï¶×‚?ï¶T%?ï£|ó€f?ï£w$¿?ïðaPÆ?ïê’“Y?ï~c¨#?ï~]Pî.?ïkÕ/¼@?ïkÏaÃ?ïYF“Î5?ïY@Å0?ïF·FΘ?ïF±x ?ï4'MŒ?ï4!~ix?ï!–¤¶M?ï!Ö °?ïKÄm?ïÿ}J?ïüsG¢Þ?ïümy4?ïéà—p9?ïéÚÈÒ?ï×M6|?ï×GgƒÃ?ïĹ&ù½?ïijXb~?ï²$lB|?ï²®µ?ïŸöf?3f?ïŒøéK?ïŒó¾3?ïzb'¡²?ïz\YY?ïgʵׂ?ïgÄçQ£?ïU2–,ê?ïU,Ǫ„?ïB™Ëìæ?ïB“ýmú?ï0S*?ï/ú„š¸?ïf.ó’?ï``{›?ï Ë]™È?ï Å%K?ïø/Þ(z?ïø*·x?ï哳ê%?ïåå|?ïÒöÛé?ïÒñ  ?ïÀYVOØ?ïÀS‡éE?ï­»#Hé?ï­µTåÒ?ï›G(Ç?ï›xÉ+?ïˆ|»ÚÌ?ïˆví~«?ïuÜ„¨ô?ïuÖ¶PO?ïc;£Ò]?ïc5Õ}3?ïPšMŸ?ïP”Eûñ?ï=÷ÙdR?ï=ò ?ï+T–c€?ï+NÈÉ?ï°\??ïª÷×?ï pý?F?ï óe×å?ï ó` ¤Ó?ï à¿‹íÁ?ï ๽°ü?ï Î^Ç?ï ÎÂ%?ï »päW_?ï »k!”?ï ¨È…ìé?ï ¨Â·ºš?ï –yp¿?ï –«Aî?ï ƒu»îH?ï ƒoíÂô?ï pËL…%?ï pÅ~]N?ï ^ .|^?ï ^`X?ï Kt`ók?ï Kn’Ò?ï 8Çã è?ï 8ÂìŠ?ï &´éR?ï &æÏr?ï l×ÄË?ï g ®i?ï ¾GŸ@?ï ¸yŒ\?ï î ï?ï î >߯?ï Û_ šz?ï ÛYRŽ“?ï È®„Þ"?ï Ȩ¶Õ¹?ï µý:í?ï µ÷lè?ï £K@ݤ?ï £ErÜ9?ï ˜–Ù«?ï ’ÈÛ¾?ï }å>?ï }ßp”?ï k17¿x?ï k+iȉ?ï X|àp?ï Xv±í?ï EÇÎÎ?ï EÁMÞÞ?ï 3 ª¦?ï 3 <¾6?ï ZGoÈ?ï Ty†×?ï ¢Ø~¨?ï ™7?ï úê¹Üb?ï úäëúp?ï è1ê©Á?ï è,ËP?ï Õxn+~?ï Õr P?ï ¾D‹?ï ¸v³«?ï °kà`?ï ¯ýž p?ï GçoŒ?ï BŸ?ï Š‹³>à?ï Š…åqñ?ï wÎÐ?ï wÉ·”?ï e@hd?ï e r¢w?ï RS ?ï RM4Sž?ï ?”«?ï ?ŽFì-?ï ,Ô{k2?ï ,έ¯È?ï 5wQ?ï g¿i?ï S>×(?ï Mq"Á?ï ô‘›Öª?ï ô‹Î%Ä?ï áÏM§í?ï áÉú‰?ï Ï Rc¸?ï Ï„¹Ö?ï ¼H©+ƒ?ï ¼BÛ…$?ï ©„S1‚?ï ©~…Ž¥?ï –¿NŽü?ï –¹€ï¡?ï ƒùž†?ï ƒóÐêÄ?ï q3B9ä?ï q-t¡?ï ^l6ºB?ï ^fi%n?ï K¤ZH?ï Kž³È÷?ï 8Ü+_?ï 8ÖQ‘?ï &W}?ï & BÍ2?ï IWq?ï C‰‘©?ï ~ïxE?ï y!õ?ï í³Ú©?ï í® )A?ï Úèì9?ï ÚâNoû?ï ȲcÎ?ï Èäë?ï µN›"N?ï µHÍ­?ï ¢€ØaU?ï ¢{ ï¤?ï ²kR?ï ¬äR?ï |âòU5?ï |Ý$êŒ?ï j†!i?ï j ¸ºD?ï WAiø ?ï W;œ”l?ï Doœú^?ï DiÏšB?ï 1 X¾?ï 1—Rü'?ï ÉõCi?ï Ä'êW?ï ö¶ƒ?ï ðH`ö?ïù!ˆ°?ïùºµ¨?ïæLJPî?ïæF}l?ïÓv\»#?ïÓpp&?ïÀŸ¿o4?ïÀ™ò'¼?ï­ÈsG?ï­Â¦YV?ïšðuQe?ïšê¨ù?ïˆÇÊE?ïˆú_?ïu>k0Ê?ïu8÷k?ïbd_­à?ïb^’x?ïO‰£\h?ïOƒÖ*?ï<®8s{?ï<¨kD®?ï)Ò*?ï)ÌOâå?ïõScb?ïï†;£?ïÜ¢ê?ï~±?ïñ9³Óƒ?ïñ3æ²Ò?ïÞZÝ9¤?ïÞUy?ïË{Zø?ïËuŒëU?︛%<Ü?︕X&Á?梁D+ö?若wb?ï’سçA?ï’ÒæØ5?ïöužz?ïð¨’õ?ïmˆt,?ïm »l/?ïZ/ì‘?ïZ* ?ïGK À?ïGEÓÓ?ï4f¨A_?ï4`ÛCû?ï!9t?ï!{6?™?p?ï”ß?ïû³§ëj?ïû­ÚøŸ?ïèËø¯?ïèÆ+.m?ïÕ㘫d?ïÕÝË¿¬?ïÂúŒÐt?ïÂô¿èD?ï°Ó¯Î?ï° Ë'?ï&ll”?ï Ÿ‹w?ïŠ;X6?ïŠ5‹XŠ?ïwO™A ?ïwIÌg–?ïdc)”J?ïd]\½É?ïQv o{?ïQp@œ„?ï>ˆBð¦?ï>‚v!9?ï+™ÎX–?ï+”Œ³?窱¾Ü?ï¤ßöƒ?ïºÝG ?﵂>?ïòÊa P?ïòÄ”_ ?ïßÙ6h¢?ïßÓiªé?ïÌç`Z}?ïÌá“ N?ï¹ôÜT?ï¹ïW°?燐Éz?ï¦ûâa?ï” Ó™\?ï”éÎ?ïJ§Ž?ï}û‹?ïn$3^?ïnKŠæ?ï[.9U½?ï[(l°Ñ?ïH7­2Æ?ïH1à‘e?ï5@uþ°?ï5:©`Û?ï"H“âÓ?ï"BÇHŠ?ïPîd?ïJ5W¦?ïüVÈtÝ?ïüPûá¬?ïé\â…{?ïéWõÖ?ïÖbQNö?ïÖ\„ÂÝ?ïÃf¹’à?ïÃ`í T?ï°j.f9?ï°daá9?ïlò[º?ïg%ÚH?ïŠo Ó?ïŠi:"í?ïwpk]Ú?ïwjžã?ïdq±V?ïdkR:‹?ïQq"Í’?ïQkVZT?ï>pvÖ?ï>jªfc?ï+oéÂ?ï+iL}Ÿ?ïm DC?ïg@Û®?ïjRn?ïd…Ÿf?ïòfæN ?ïòaì”?ïßbÌR÷?ïß\ÿõ ?ïÌ^6ï?ïÌX6Ü’?ï¹X‰S?ï¹R¼Â„?ï¦R`+Þ?ï¦L“Øž?ï“K‰›€?ï“E½KÎ?ï€Dzq?ï€>4.N?ïm;Ê–?ïm5ý¿?ïZ2åfî?ïZ-!é?ïG)Q¼ª?ïG#…{4?ï41^?ï4Bów?ï!í§?ï!Q³O?ï}ì?ï°ß$?ïúü.Û6?ïúöb§þ?ïçï2aå?ïçéf2`±?ïb{rIú?ïOnÑ™Æ?ïOi† ?ï<[¸?ïæA?ï÷¯uHM?ï÷©©uk?ïä3Ú?ïäŠh @?ïÑpC“f?ïÑjwǪ?ï¾O§¤ì?ï¾IÛÜÃ?ï«.b=Þ?ï«(–yI?ï˜ nx?·?ï„éЉp?ï„äÌ?ïqƇ–¥?ïqÀ»ÜÌ?ï^¢‘Â?ï^œÆ =?ïK}î6u?ïKx"ƒÄ?ï8X¤+?ï8RØ|b?ï%2ª³O?ï%,ßÇ?ï d?ï;\p?îÿþä`û?îÿþÞ”tœ?îÿë»Äb?îÿëµøà˜?îÿØ’y,ô?îÿØŒ­¿?îÿÅh~C”?îÿÅb²©ô?îÿ²=Òê½?îÿ²8T³?îÿŸwJu?îÿŸ «¸?îÿ‹æl?îÿ‹à þ??îÿx¹±ØR?îÿx³æM?îÿeŒHV]?îÿe†|Ω?îÿR^0/(?îÿRXd« ?îÿ?/f„?îÿ?)›}?îÿ+ÿï…Þ?îÿ+ú$ì?îÿÏÈV!?îÿÉüÜÅ?îÿžðß?îÿ™$¥?îþòmjƒ?îþògžT?îþß;64ö?îþß5jÆ^?îþÌRÖ6?îþ̇k5?îþ¸ÔÀp?îþ¸Îô§?îþ¥ € ?îþ¥š´¥¼?îþ’kŽè?îþ’eÇÞ?îþ5ðÙ»?îþ0%}?îþkÿ¦\?îþkùÚ­O?îþXȪ?îþXÂß9‹?îþE‘¡ ?îþE‹6OC?îþ2X­h?îþ2RâÖ?îþ¥þÖ?îþÚ´(?îþ åñ—ˆ?îþ à&Ps?îýø«Z@?îýø¥ÅÃ?îýåpm?îýåj¶-ª?îýÒ4Ãø-?îýÒ.ø»à?îý¾øY#Î?îý¾òë?îý«»?â?îý«µsàÇ?îý˜}wù~?îý˜w¬Çü?îý…?ø&?îý…99ÊmÞ?îý88¡çZ?îý$ü–Û’?îý$öË¿¨?îýººd?îý´H¢?îüþvãË ?îüþq¶ê?îüë36š?îüë-;%~?îü×î}%¦?îü×è²$?îüÄ©F¿(?îüÄ£{µ@?îü±cd,l?îü±]™&?îüžÕ•Å?îüž “?îüŠÕ— T?îüŠÏÌ!;?îüw­ø²?îüw‡âý4?îüdEFX?îüd?NNu?îüPûÖ/‘?îüPö ;I?îü=±çÞö?îü=¬îI?îü*gN|Ü?îü*aƒÊ?îü 1?îü>G’?îüÐ#g?îüÊL=?îûðƒz}„?îûð}¯›E?îûÝ61fÏ?îûÝ0fˆ,?îûÉè=B?îûÉâr-:?îû¶™ŠQ?îû¶“Ò²æ?îû£JR#?îû£D‡AT?îûúYÐù?îûôÆ?îû|©¹çÌ?îû|£ï5?îûiXm€¨?îûiR¢·®?îûVuÄj?îûVªÿ ?îûB³ÒÛª?îûB®é?îû/`)î?îû/Z_/ß?îû â?îûÅe\?îû¶H¯ÿ?îû°}ù?îúõ`MÅŠ?îúõZƒ>?îúâ ¦ˆ=?îúâÛØŽ?îúβO„?îúά„st?îú»ZG²ý?îú»T} Š?îú¨j=?îú§ûÅÅh?îú”¨*l´?îú”¢_Ë}?îúNâ‡?îúHHDï?îúmóNòF?îúmí„XK?îúZ—ÜÃÊ?îúZ’-n?îúG;º??îúG5ïì?îú3ÞêKŸ?îú3Ù¼€?îú jQ??îú {ŸÅÀ?îú #9¸G?îú o0f?îùùÄ^¥¯?îùù¾”!m?îùædÔC8?îùæ_ –?îùÓ˜¹¾?îùÒþÎ<º?îù¿£±.©–ÒÍ?î÷>£ÌÑ>?î÷+1´Ôž?î÷++êÖ³?î÷¹%Od?î÷³[U?î÷?ëer?î÷:!nÎ?îöðÆ :ª?îöðÀ?G«?îöÝKzü?îöÝE°¡?îöÉÐ=à­?îöÉÊsôö?îö¶TXùx?îö¶Nf?îö¢×Ç{Ö?îö¢Ñý—h?îöZŠÕ?îöTÀ­ ?îö{Ü¥PÛ?îö{ÖÛs·?îöh^ü»?îöhXG#?îó•A”õ?îó… k|?îóBÞ?îómë]ù…?îómå”®‘?îóZQ±e?îóZK;j?îóFµþ¾F?îóF°5z¦?îó3MCÅ?îó3„Ï?îó}îpü?îóx%4±?îó àåaÌ?îó Û)+?îòøC-Q$?îòø=d.?îòä¤ÉZå?îòäŸ)š?îòÑ»ž€?îòÐÿòpá?îò½fO^?îò½`8%j?îò©Å™™,?îò©¿Ðrã?îò–$‡—M?îîïÜâ?îîé=}{?îîn(ÝDP?îîn#èœ?îîZb)_?îîZ\;Ñ^?îîFš‚‚$?îîF”º-Õ?îî2ÒS”N?îî2Ì‹C²?îî w‡?îî¯:?îî ?òhT?îî :*?îí÷uÁqè?îí÷où,e?îíãªãÑ/?îíã¥_?îíÏßY­S?îíÏÙ‘o6?îí¼% ¦?îí¼ \æ=?îí¨FCe„?îí¨@{.Ï?îí”x¶–0?îí”rîc.?î퀪Ó2?î퀤·£å?îílÛœW…Ž?îì’ËÎÚ?îì’Æ×»?îì~ô“È?îì~îËÉ?îìkl,?îìk¤Â?îìWC•Ü?îìW=ÍäÛ?îìCjŽª?îìCdGš«?îì/Ý!H?îì/Š1?îì´ùÞD?îì¯1ñ²?îìÙfäæ?îìÓžü ?îëóý&M ?îëó÷^gç?îëà 8<å?îëàp[w?îëÌB™ð’?îëÌ<ÒÚ?îë¸dNx?îë¸^†ž€?î뤅UE?îë¤+û?î륫Ã?îëŸãðo?îë|ÅVÃX?îë|¿Žô|?îëhäS?Ü?îëhÞ‹t¸?îëU¢Wk?îëTüÚÿ?îëA @NŸ?îëAxŠê?îë-=5E?îë-7mOH?îëYxüo?îëS±@*?îëu?îëoHeŒ?îêñúš‰?îêñŠ2å´?îêݪ6§•?îêݤnöx?îêÉÃÆ\'?îêɽþ®Ã?îêµÜ§î4?îêµÖàDˆ?îê¡ôÜ|c?îê¡ïÖp?îêŽ c5?îꎛ’Ê?îêz#=6­?îêzu˜,?îêf9j§Æ?îêf3£ þ?îêRN즶?îêRI%§?îê>cÀqð?îê>]øÞš?îê*wå8+?îê*r¨Ž?îê‹_÷Œ?îê…˜k©?îêž.æš?îê˜g^p?îéî°NL‚?îéÈ?îéÚÁÂ/3?îéÚ»ú®~?îéÆÒŠµ?îéÆÌÃ8!?îé²â¥“?îé²ÜݤR?îéžòmü?îéžìMøu?îé‹ØåÆ?îéŠûsù?îéwî´?îéw 'Eó?îéc\ÌÃ?îéc•bl?îéO)€?îéO#Wô?îé;51˜?îé;/i¬¶?îé'@šm†?îé':Ó`?îéKVã?îéE‡›?îèÿUh… ?îèÿO¡-ð?îèë^΄„?îèëY0?îè×gˆ?îè×aÀ¾Ö?îèÃo–CL?îèÃiÎöÏ?îè¯vú??îè¯q2öX?îè›}³1Ô?îè›wëìÎ?î臃ÀJþ?îè‡}ù ´?îès‰"¨?îèsƒ[jò?îè_Ûh?îè_ˆ.C?îèK‘æÔ?îèKŒž?îè7•Gø•?îè7€Æ=?îè#—þü8?îè#’7Í?îèš Ç?îè”Bìè?îçû›k_ø?îçû•¤8×?îççœ#òQ?îçç–\Îì?îçÓœ.,m?îçÓ–g Æ?îç¿›þB?îç¿•ÈâX?îç«šJ…%?îç«”ƒlø?îç—˜W(‚?îç—’?î烕g]Š?î烠LÙ?îço‘Ššv?îço‹Ãƒ?îç[ŒüªÆ?îç[‡5¡‘?îçG‡À˜\?îçGù’å?îç3Ö‰?îç3|‡O?îç{;¾ñ?îçutÀ÷?îç sóC²?îç n,Iv?îæ÷kÿ)þ?îæ÷f83?îæãc[½´?îæã]”Êö?îæÏZ $Ñ?îæÏTB5Ò?îæ»P U?îæ»JEiÛ?îæ§E\Ë+?îæ§?•ãª?îæ“:s?îæ“49\?îæ-ù_F?îæ(2D?îæk!Aïæ?îæk{£?îæWß?îæWAœ?îæCÌ4å?îæC`"?îæ.÷ R®?îæ.ñDª?îæçŸ{¬?îæáØ®h?îæ×…ó{?îæÑ¿)÷?îåòƽê?îåòÀ÷$S?îåÞµJg†?îåÞ¯ƒ¥ƒ?îåÊ£(¯Í?îåÊañ‹?îå¶Wó"?î嶊‘8¡?îå¢|Ý% ?îå¢wnK?îåŽhµ‰É?îåŽbîÖÉ?îåzSáGZ?îåzN˜?îåf>`ƒÆ?îåf8™ØH?îåR(2oZ?îåR"kÇŸ?îå>TO(?îå> «.?îå)ùÍ/?îå)ô`ö?îåáš¿ç?îåÛÔ#p?îåȸå\?îåÂòL§?îäí¯-YB?îäí©fÄO?îäÙ”õ`â?îäÙ.Ï°?îäÅz"b?îäÅtJ”ó?îä±^~Ù?îä±X¸OX?îäBCv%?îä<|ð;?îä‰%[J?î䉔Çö?îäuÅ…à?îäuÿ|?îä`é‡8?îä`ãÀŸ–?îäLÊ›b´?îäLÄÔëÕ?îä8«…®?îä8¥<“?îä$ŠÀ~A?îä$„úè?îäiÑÂ?îäd 2,?îãüH6ÿ«?îãüBp—Ú?îãè%ò´h?îãè ,PZ?îãÔ÷î?îãÓý<—£?îã¿ßhå€?îã¿Ù¢ˆù?îã«»"¹V?î㫵\`“?îã—–2ƒ¬?îã—l.®?îãƒp–€ß?îãƒjÐ/¤?îãoJPÁ?îãoDŠs’?îã[#_€ª?îã[™6ø?îãFûÁñV?îãFõû«i?îã2Ó}S?îã2Ͷ¿*?î㪋B?îã¤ÄÛß?îã €ï@Æ?îã {)'?îâöV©›'?îâöPãdN?îââ+¹[?îââ%ó'ú?îâΦÛ?îâÍúXwŒ?îâ¹ÓÙ¤ó?îâ¹Îyj?î⥦ëp9?î⥡%Hu?îâ‘yT.ô?îâ‘sŽ ö?îâ}JÀ¡?îâ}Dú€Ù?îâi<º?îâiuëH?îâTë #?îâTåE Z?îâ@º-#Ã?îâ@´gÝ?îâ,ˆŸRG?îâ,‚ÙA(?îâVc¼Â?îâP¯j?îâ#|q?îâ¶g‡?îáïïäÏg?îáïêÉœ?îáÛ»žåÃ?îáÛµØã¿?îádž«ÍÓ?îáÇ€åÏ–?îá³Q ­?îá³KE²‹?î៽´›?îáŸ÷½í?îáŠãÃò@?îáŠÝýÿY?îáv¬Ó,?îáv¦Rä ?îábsÂ5)?îábmüIÑ?îáN:¾U ?îáN4øn?îá: ~c?îá9ûDš›?îá%Æ«˜Ÿ?îá%À帟?îá‹Ÿáõ?îá…Ú½?îàýOæŒ!?îàýJ ³²?îà逰„?îàé ºÛÝ?îàÔÖm€í?îàÔЧ°?îàÀ˜­"÷?îàÀ’çUâ?îà¬Z@¯ó?îà¬Tzæ¦?îà˜'YÁ?îà˜a”=?îàƒÛb9ž?îàƒÕœwä?îàošïô?îào•)Ð?îà[YÑcŠ?îà[T ©c?îàGq?îàG?O?îà2ÕŽgT?îà2ÏÈ´¿?îà’l»4?îàŒ§ i?îà NLw?îà Hסw?îßö !4J?îßö[?îßáÄú?îßá¿4Û£?îßÍ&x|?îßÍy`ØÙ?îß¹8¦9ª?îß¹2àÑ?îߤñ{ÎÀ?îߤë¶6²?îß©£ž?îߣÝü[?îß|a!qÀ?îß|[[áG?îßhó±€?îßh.$Ó?îßS΂?îßSÈSù¬?îß?ƒ“ýÓ?îß?}Îx»?îß+8e/ ?îß+2Ÿ­½?îßìŠbÞ?îßæÄå]?îß ÙT?îßš<_Ÿ?îÞîRÒ\»?îÞîM æÑ?îÞÚõnk?îÞÙÿ/üN?îÞŶn ô?îÞÅ°¨ž¢?îÞ±g<^?îÞ±avóŽ?îÞ_”Ô?îÞš.?îÞˆÆ××?îÞˆÁt$?îÞtu¦=V?îÞtoàÞ5?îÞ`#É$?îÞ`¬Ð?îÞKÑBB«?îÞKË|ë#?îÞ7~-Š?îÞ7xJÙÏ?îÞ#*1ü2?îÞ#$l¬C?îÞÕ«žÁ?îÞÏæR ?îÝú€|Hk?îÝúz·?îÝæ* U7?îÝæ$Û°?îÝÑÔ™Ä?îÝÑÎXY ?îݽ|ðr'?îݽw+5;?îÝ©%¸?îÝ©Qæ™?îݔ̕‘Ú?îÝ”ÆÐ\‰?îÝ€sjü?îÝ€m¥Ê?îÝlCH1?îÝl~{?îÝW¾.¸?îÝW¸hðÑ?îÝCbm£?îÝC\¨|í?îÝ/þ=>?îÝ/9ô?îݨày?îÝ£ïþ?îÝK?îÝEP÷n?îÜñìšÀ¬?îÜñæÕ©Î?îÜÝsë¯?îÜ݇®Ø ?îÜÉ-¡·ù?îÜÉ'ܨ¹?îÜ´Íž±?îÜ´ÇY“@?îÜ kï~Õ?îÜ f*w4?îÜŒ ™?îÜŒM•¾?îÜw§‰â?îÜw¡Äà?îÜcDQ÷?îÜc>ŒúÏ?îÜNànƒÕ?îÜNÚ©‹s?îÜ:{Û s?îÜ:vá?îÜ&œhØ?îÜ&×x?îÜ°°à™?îܪëó§?îÛýJ–Ú?îÛýDS­¸?îÛèâÒ¿'?îÛèÝ ÙÖ?îÛÔzâSu?îÛÔuqô?îÛÀAÏ}?îÛÀ |ñÍ?îÛ«¨÷Ñ?îÛ«£2'ò?îÛ—?ê?îÛ—9\Ôs?îÚ;ÎÀŒR?îÚ;Èû÷8?îÚ'X¶Aæ?îÚ'Rñ°Ÿ?îÚáýÿ2?îÚÜ9q¿?îÙþjž^?îÙþdÙõ¾?îÙéò“3¤?îÙéìέØ?îÙÕyÛPÎ?îÙÕtÎÕ?îÙÁyÎt?îÙÀúµPP?îÙ¬†nÑæ?îÙ¬€ªW•?îÙ˜ ·®”?îÙ˜ó8?îÙƒTŠ?îÙƒŠk?îÙoIL,?îÙo„ÝX?îÙZ—“H€?îÙZ‘ÎÝ?îÙF3• ?îÙFo-ß?îÙ1œ)f½?îÙ1–eg?îÙtã?îÙ°ƒ—?îÙž/œ?îÙ˜QÓð?îØôb?îØôJ E?îØßZÏ?îØß—–{?îØËý|Æ?îØË9,š?îض™øq%?îض”4$Î?îØ¢G ‚?îØ¢‚Ø?îØ“ì)?îØŽ(<}?îØyê˜Ý?îØy &X?îØd‹=ÌŠ?îØd…y‹?îØP•äQ?îØOÿÑ«(?îØ;ôC?îØ;y@¾ñ?îØ&÷Äß?îØ&ñÿäb?îØoÖ=ô?îØjN?î×ýç;‘?î×ýáwgA?î×é]òSí?î×éX.-õ?î×ÔÓú«L?î×ÔÎ6‰+?î×ÀIV›¤?î×ÀC’}Z?î׫¾iâ?î׫¸@Oo?î×—2*•?î×—,Aú?îׂ¥Yò!?îׂŸ•ß]?î×n¬?î×n<öÀ?î×Y‰ûy§?î×Y„7n“?î×DûIr¾?î×Dõ…k?î×0kê%þ?î×0f&"™?î×ÛÞ§À?î×Ö¨3?î×K&-#?î×Eb1o?îÖò¹¿ëp?îÖò³ûó”?îÖÞ'®Õï?îÖÞ!êáë?îÖÉ”ðBâ?îÖÉ,R·?îÖµ‚xT?îÖ´û¾Œ?îÖ ml&ý?îÖ g¨>„?î֋ا×/?îÖ‹Òãò?îÖwC7Œ†?îÖw=s«¿?îÖb­[ ?îÖb§X~?îÖNS™¶?îÖNÀ¡?îÖ9~Ým?îÖ9y˜F?îÖ$æ¼Èî?îÖ$àø÷?îÖMñв?îÖH.*?îÕû´xí?îÕû®µ#Z?îÕçT!.?îÕç[Z?îÕÒ†_*?îÕÒyÂ0?îÕ½ä B‚?îÕ½ÞE„b?îÕ©GähM?îÕ©B ®?îÕ”«JV?îÕ”¥O“ë?îÕ€ – ?îÕ€Ò[ ?îÕkomÅú?îÕkiªE?îÕVК˜Z?îÕVÊÖí?îÕB1Ì?îÕB+W%?îÕ-ñR`?îÕ-‹-¯ ;?îÔ!21F?îÔ!,mŸM?îÔ ˆµ)å?îÔ ‚ñ¼Ê?îÓ÷Þã¬?îÓ÷ØÌzn?îÓã3Áb ?îÓã-ýý??îÓΈGïc?îÓ΂„ß?îÓ¹Ü%‹?îÓ¹Öb-Ú?îÓ¥/Z[ÿ?îÓ¥)—6?îÓ㻘?îÓ| e­?îÓ{ÓŇâ?îÓ{Î5Ô?îÓg$þ ·?îÓg:»‡?îÓRu‹Š??îÓRoÈ?í?îÓ=Åqæ¥?îÓ=¿® 1?îÓ)^16?îÓ)šî¡?îÓb_P0?îÓ\œy?îÒÿ¯³`Ë?îÒÿ©ð%ò?îÒêüZ‡:?îÒêö—P@?îÒÖHSùâ?îÒÖBÆÇ?îÒÁ“ŸÝ ?îÒÁÜ­Í?îÒ¬Þ?BÀ?îÒ¬Ø|c?îÒ˜(/†?îÒ˜"l^’?îÒƒqr¦Ù?îÒƒk¯ƒ;?îÒnº ’^?îÒn´HrŸ?îÒZö¶&?îÒYü3šG?îÒEI3I?îÒECp1?îÒ0Å%«?îÒ0Š‹?îÒÕ©§ª?îÒÏæ—j?îÒáàã?îÒÔ„?îÑò_mõª?îÑòYªí+?îÑÝ£L/p?îÑ݉*Ñ?îÑÈæzç?îÑÈà¼z)?îÑ´)42?îÑ´#B7T?îÑŸjàGÌ?îÑŸeNÏ?îÑŠ¬ ?îÑŠ¦Kñ?îÑu줼?îÑuæ̳?îÑa,fz?îÑa&£$ ?îÑLkŽµ?îÑLeËË?îÑ7ª {|?îÑ7¤I•ä?îÑ"çÝ®æ?îÑ"âÍ0?îÑ%;?îÑB]>?îÐùa€}?îÐù[½£?îÐäO™`?îÐä—ŒÃP?îÐÏØr´Š?îÐÏÒ¯â[?îлêà ?îл (¿?îЦL·Sa?îЦFôˆ÷?îБ…Ùö?îБ€Yn?îÐ|¾Pj8?îÐ|¸§“?îÐgö?îÐgðWÑZ?îÐS-c±AL?îÐ>]îŠO?îÐ)™{O4?îÐ)“¸œ?îÐΛ‘F?îÐÈØâ?îÐ+ð?îÏÿýO€œ?îÏë6Ýj`?îÏë1Âð?îÏÖiýq=?îÏÖd:Í°?îÏÁœsQ±?îÏÁ–°²?îϬÎ>CÅ?îϬÈ{¨?îÏ—ÿ]ž?îÏ—ùšç¼?îσ/ÔÛÎ?îσ*GÐ?îÏn_ Êû?îÏnYÞ:á?îÏYŽÃJ¦?îÏY‰¾q?îÏD½:¦¦?îÏD·xU?îÏ/ë¸?îÏ/åDK?îÏ*_1?îÏgÞ©?îÏD¤Ý ?îÏ>â`ý?îÎñpsÞÞ?îÎñj±f?îÎÜ›šLY?îÎÜ•××?îÎÇÆJ¢?îÎÇÀUÙ®?îβïë9á?îβê(ÌÒ?îΞ8?îΞSš?îΉA–ó?îΉ;ÔÏ?îÎtin.9?îÎtc«ÌÚ?îÎ_›Ùg?îÎ_ŠÙ{î?îÎJ·!ñM?îÎJ±_—º?îÎ5ÜýÖ«?îÎ5×;€þ?îÎ!0šH?îÎ ünH€?îÎ &¼8?îÎ ùê¼?îÍ÷JLò„?îÍ÷DŠ¨‰?îÍâlõî{?îÍâg3¨g?îÍÍŽðÿL?îÍ͉.½?î͸°=],?î͸ª{æ?îÍ£ÐÝïO?îͣ˴ï?îÍŽðÒÙr?îÍŽë¢ú?îÍz³?îÍz V^"?îÍe.²çº?îÍe(ð¹?îÍPL¡¯?îÍPFÞëì?îÍ;iájG?îÍ;dCl?îÍ&†uÝ£?îÍ&€³º°?îÍ¢]©?îÍœ›Š?îÌü½˜ð§?îÌü·ÖÕ„?îÌçØ&ìÅ?îÌçÒdÕŠ?îÌÒò ˜R?îÌÒìG„ÿ?î̾ >U?î̾|E£?îÌ©#È #?îÌ©ý¡?îÌ”;¥í?îÌ”5ãåƒ?îÌRÙ7?îÌM †?îÌji^Ô—?îÌjcœÔÏ?îÌU: ?îÌUyx$#?îÌ@”hTÎ?îÌ@Ž¦\Ø?îÌ+¨ê‚K?îÌ+£(Ž??î̼Á·£?î̶ÿÇ€?îÌÏìB¦?îÌÊ*Vl?îËìâmó¦?îËìܬ V?îË×ôAlZ?îË×î‡ó?îËÃkh?îËÂÿ©‡ƒ?îË®éI¤?îË®'m?îË™%½ö)?îË™ü€?îË„4äû ?îË„/#&M?îËoCb( ?îËo= W6?îËZQ2à¨?îËZKq¾?îËE^YÂ?îËEX—UÃ?îË0jÕb?îË0eAM?îËv¥Ðè?îËpä¿?îËÍwÞ?îË| ºŸ?îÊñŒHt ?îÊñ††»M?îÊÜ–«i?îÊÜWö?îÊÇŸ?k"?îÊÇ™}¹¥?îʲ§½‚G?îʲ¡ûÔ¶?îʯj¥?îÊ©ÎÀÿ?îʈ¶¸H€?îʈ°ö¢Æ?îÊs½5@"?îÊs·sžS?îÊ^Ã`ÿ™?îÈ”}¸?îÈ{FÔi?îÈ{Š…Ü?îÈf…¡­?îÈfßÖ?îÈQzP£ë?îÈQth9Š?îÇ?©ðn1?îÇ?¤/e³?îÇ*•6v?îÇ*ué?îÇΖ?îÇz •|?îÇi»Ý"?îÇcúàw?îÆëRþúJ?îÆëM>‘?îÆÖ;•Uè?îÆÖ5Ôa ?îÆÁ#‚·â?îÆÁÁÇ ?îƬ Åq­?îƬ„È?îÆ–ñY?îÆ–ë˜1?îÆ×CJ¼?îÆÑ‚e»?îÆl¼‚Un?îÆl¶Át_?îÆW¡]Ú?îÆW›U€½?îÆB„ÿ‡¸?îÆB>®?îÆ-h>ß?îÆ-b~ U?îÆJÒ·n?îÆEæ(?îÆ,»3.?îÆ&úeÛ?îÅî û0¸?îÅî:gX?îÅØî’?îÅØèÏT%?îÅÃÎy(æ?îÅÃȸgk?îÅ®­º%?îÅ®§ùg‹?îÅ™ŒOL?îÅ™†ŽÕ¸?îÅ„j9‹€?îÅ„dxÕà?îÅoGz¢?îÅoA¹\õ?îÅZ$ø?îÃÝ5lvu?îÃÝ/¬ó?îÃÈs~á?îÃÇÿ³U?îòÔÐ_&?îòÏ‘?îã… ?îÃÄ°f?îÈq‘¦o?îÈkÑOÅ?îÃs>©æõ?îÃs8é”C?îÃ^ ØòQ?îÃ^£–?îÃHÖ\éê?îÃHÐœŸ%?îÃ3¡4!a?îÃ3›sÚ“?îÃk\ë?îÃe›Â?îà 4Û G?îà /Îg?îÂóý«,?îÂó÷êÍD?îÂÞÅÍè&?îÂÞÀ ±5?îÂÉGnˆ?îÂɇ‡;Ž?î´T»?î´NTع?îŸ5?îŸtÜü?î‰ߪI?î‰Ùê!ñ?îÂt¤tb?îÂtž³ãH?îÂ_h­‰u?î»sÖµ…?î»^gç1Ý?î»^b(að?î»Hòç`?î»Hí(”?î»3}>R?î»3wŠ4?î»è˜g?î»)Ôƒ?î»éèÀ?+(ß?îºóCJ¶?îºó„ŽÙ?îºÝŸò3l?îºÝš3{“?îºÈ&öÆ?îºÈ!82?­R ,?§“ZZ?îº3^?îº-F[?¸ 3??²N‹u?îºrÁ–?î¹…Àö¯²?î¹…»88"?î¹p=l?î¹p7­¦…?î¹Z¹8Ÿ‚?î¹Z³z/ý?î¹E4\cF?î¹E.÷Ç?î¹/®Ûm?î¹/©°ô?î¹(­Âw?î¹"ï_?ÚÀ>?`Ñ?î¸ï^¥K?î¸ï Iä?î¸Ù’;\ž?î¸ÙŒ}>?î¸Ä "é?î¸Äd•Ä?&õ¼?yh¦j?ô|q?î¾%Ë?i&)?cgáÂ?î¸mÝ&V?î¸m×gÄ?î¸XPyƒD?î¸XJ»D?î¸BÃ"†“?î¸B½dKe?î¸-5 Où?î¸-/bÓ?q:¶?³—?î¸0|?î¸Ye?î·ì‡p-?î·ìSE?î·Öö_8Ï?î·Öð¡È?î·Áesâ?î·Á_DPã?î·«Òú`d?î·«ÍXV ?îµæ8šŒu?îµÐª‘Ê?îµÐ—ìË«?üU{ù?ö—¹å?îµ¥ZV„?îµ¥T˜Ñ|?îµ·­ v?îµ±ïRy?îµzYø@?îµzœBN?îµdp`h?îµdj¢k‚?îµN˹lY?îµNÅû¾?îµ9&jtÞ?îµ9 ¬Ë?îµ#€uœ?îµ#z·xÚ?îµ ÙÕš?îµ Ô}ä?î´ø2B?î´ø,Ϥq?î´âŠœÆN?î´â„ß,±?î´Ìâ'Å?î´ÌÜC’5?î´·8½0?î´·2ÿŸ ?î´¡ŽÑ`?î´¡‰ué?î´‹ä<Âõ?î´‹Þ9‹?î´v8ÿ¯Â?î´v3B*e?î´`ÎÐ?î´`‡]M€?î´Jà‹œc?î³)í‹q?î³$0Fö?î³rô4i?î³m6óý?î²ï»Q+?î²ïµ“îº?î²Ú¯£?î²ÙýFwW?î²ÄJ]Y?î²ÄDK)?î²®c¾Ò?î²®Š¦Ž¥?ÖQ?ÐV$þ?û?Zïî?î²m_qSô?î²mY´/÷?î²W£ êG?î²WcÊZ?î²Aæ#vò?î²Aàf[?î²,({À¼?î²,"¾¨ð?î²j*Ë,?î²dm·q?.?î²¥q[?î±ê놞ô?î±êåÉ“Z?î±Õ+4Ž%?î±Õ%w†œ?j7"r?dzú?¨@¼?¢ÓAV?æ>H’?àM?î°å¶ Qx?î°ÏózóÊ?î°Ïí¾?î°º*…Üm?î°º$É Ì?î°¤`èV?î°¤[+9È?î°Ž–ž÷?î°Žâ,‹?î°xˬŒ°?î°xÅïÆI?î°cÌx?î°búU #?î°M3Í÷À?î°M.9~?î°7fàP?î°7a#•Ú?î°!™J¹5?î°!“Ž?î° Ë ³N?î° ÅNF?î¯õü#â?î¯õöfTî?î¯à,Gz?î¯à&Óš?î¯Ê\V&4?î¯ÊV™€i?‹rp?…µ}¹?¹å6>?´(˜›?ç±N?áô´ˆ?î¯sÓ!?î¯sq¦?î¯]AM%`?î¯];“ú?î¯Gm :?î¯Gga|é?î¯1˜EØ(?î¯1’‰Në?î¯ÂÆrq? íI?î¯ìŸûb?î¯æãzP?î®ðÏôF?î®ðwI?î®Ú>Zè?î®Ú8ˆ?î®Äf:Âh?î®Ä`~M•?î®®r[T?î®®‡µê—?´®³?®FB ?Ùêþ¶?Ô.–$?î®lÿ+mÞ?î®lùo c?î®W#ÄþÇ?î®Wžb?î®AG·ÓØ?î®AAûw‰?î®+k0?î®+eD6÷?³Ä?ç_¢?î­ÿ¯ ƒá?î­ÿ©ä3Õ?î­éЩý»?î­éÊí±Æ?î­ÓðÐ=??î­Óëõa?î­¾K‰Ö?î­¾ F?î­¨/et?î­¨)]%Ä?î­’M<‘­?î­’G€V?î­|j¶ïæ?î­|dú¸e?î­f‡…"P?î­fÈîæ?î­P£¦jÿ?î­Pê;¬?î­:¿ *}?î­:¹cÿC?î­$ÙíCÈ?î­$Ô1¥?î­ô˜>?î­îSu4?î¬ù ˆ)Q?î¬ùÌ _?î¬ã&UYg?î¬ã ™>?î¬Í>wJ[?î¬Í8»3š?Uñœc?P5‰º?l¿3ª?g%?‚áÂ?}%J?î¬u˜ZÖœ?î¬u’žÐ>?î¬_­)%ô?î¬_§m#®?î¬IÁM.?î¬I»‘?î¬3ÔÇi?î¬3Ï o|?î¬ç—¡€?î¬áÛ«†?î¬ù¼ë…?î¬ôù¤?î«ò 9(7?î«ò}:p?î«Ü y^?î«ÜP±?î«Æ,6!‚?î«Æ&z;ï?î«°;·!º?î«°5û@A?î«šJ‹?Î?î«šDÏbo?î«„X·Ù?î«„Rûÿ¼?î«nf:q–?î«n`~œl?î«Xs+Š?î«XmWZz?î«BCá?î«By‡:ì?î«,ŠÊ(€?î«,…_¦?î«•§ÐD?î«ì …?î«ŸÛB?î«šy?îªê©g= ?îªê£«€?îªÔ²Gˆ?îªÔ¬‹Ï°?º€ #?´ÄëÐ?Âé"?¼U8ë?Èø…?Ã<Øö?îª|Ï5ØH?îª|Éz0H?îªfÔË¡L?îªfÏýh?îªPÙ¸Dy?îªPÓü¤±?îª:Ýý¡V?îª:ØBª?îª$á™=«?îª$Ûݦ?îªäŒø÷?îªÞÑe„?î©øæØõ3?î©øáeÜ?î©âè}T]?î©ââÁÉ#?î©Ìév¾?î©Ìã»6õ?éÊŒ?ä ?î© éueã?î© ã¹æÿ?î©ŠèxLT?î©Šâ¼ÑŽ?î©tæÓaj?î©táêÁ?î©^䈄?î©^ÞÍ?î©Há’ŸÒ?î©HÛ×1c?î©2Ýö.è?î©2Ø:Ä—?î©Ù³SV?î©Ó÷í"?î©ÔÇ”"?î©Ï 2 ?î¨ðÏ5®m?î¨ðÉzPu?î¨ÚÈü¬?î¨ÚÃ@­Ó?î¨ÄÂ'\?î¨Ä¼\Ñ¡?ºŽ†é?´Ó5L?²_HT?¬£úÕ?©‡?£ËË¥?î¨lŸÀÆE?î¨lš?î¨V•ïî?î¨V[®Ì?î¨@‰ÁOU?î¨@„Q?î¨*}¿'è?î¨*xï?î¨q5?î¦ÉcžJ?î¦É][§j?KÄØ8?F åx?î¦3Ê¡?î¦.²t?'<À?lRC?î¦qÙï@?î¦püå?î¦ZçâÚ?î¦Zâ'÷æ?î¦DÍBüX?î¦DLj@?î¦.±÷ß>?î¦.¬=I?_B?î¦H‰o?î¦ygX–?î¦s¬†å?î¥ì\ wp?î¥ìVe©á?î¥Ö>1u\?î¥Ö8v«ð?î¥À˜¹Z?î¥ÀÝô?Ve ?ú›£å?àlTz?ڱ—v?î¥}¿ØîÎ?î¥}º5í?î¥gžœU²?î¥g˜á õ?î¥Q|·‡à?î¥Qvü×F?î¥;Z*¦î?î¥;Toúv?î¥%6ó=O?î¥%18”û?î¥á?î¥ Y_±?î¤øî0?î¤øèÒ|$?î¤âÉ\ü?î¤âáu?î¤Ì£„wÃ?î¤ÌÉßÿ?}•?wK}?UÝÐå?P#Ai?. LÛ?(RÁƒ?î¤t–Á&?î¤sÿÜ9ó?î¤]Üw¸ò?î¤]Ö½5ä?î¤G²°Uþ?î¤G¬õ×?î¤1ˆA–Â?î¤1‚‡ý?î¤])Ú?î¤Wn:?î¤1i^*?î¤+®ë¯?î£ï¾[?î£îÿHP?î£Ø×ôl‚?î£ØÒ:Q?î£Âª>Š_?î£Â¤„$T?{â=?v'´W?LÝxÀ?G#?1°@?wV¦?î£iìÞ?î£iç#¬’?î£S»ãl[?î£S¶) ?î£=ŠBþ?î£=„‡ÃÖ?î£'Wú±?î£'R?È°?î£% ;?î£QK`?î¢úñv®]?î¢úë¼m¨?î¢ä¼ñ!?î¢ä·6Ù“?î¢Î‡‰c–?î¢ÎÏ+/?Quîö?K»º¶?»&{?öb?ãS%?ݘùŸ?î¢u«A~+?î¢u¥‡Va?î¢_r„™?î¢_lÊub?î¢I9Oq?î¢I3d/ö?î¢2ÿ æa?î¢2ùSË?î¢ÄQÆË?—¯ ?ëÉö?1¶ó?î¡ðLÜò?î¡ðG"?î¡Ú!àÝ?î¡Ú gÖ*?î¡ÃÒ½Zà?î¡ÃÍTV?î¡­”¯|?î¡­Žõy¤?î¡—Uøeb?î¡—P>g)?î¡–€Z?î¡܆I?î¡jÖŠÉù?î¡jÐÐÔ?î¡T•×þ?î¡T)??î¡>Ty?î¡>N¿ˆ?î¡(qyT?î¡( ·è?î¡ÏÀ¤È?î¡Ê¿…?î ûŒd ?î û†ª0‡?î åH`+‚?î åB¦N“?î Ï³\,?î Îýùƒf?î ¸¾\é4?î ¸¸£˜?î ¢x\óÚ?î ¢r£#h?î Œ1µTq?î Œ+ûˆ)?î uêb¾ ?î uä¨õë?î _¢h¿ô?î _œ®ü?î IYÆŸÒ?î IT à ?î 3{£g?î 3 ÁçÈ?î Ƈ?î ÀÍY?î {ê¿`?î v1 ?îŸð0£c¬?îŸð*é´Ž?îŸÙä´Œ+?îŸÙÞúá8?îŸÃ˜Z?îŸÃ’d³G?Jß8?E%•g?ü÷G`?÷=¨ï?®g„®?¨­êi?îŸj_/6 ?îŸjYuŸð?îŸTOWê?îŸT •Åü?îŸ=¾Ç0z?îŸ=¹ ¢¸?îŸ'm–á?îŸ'gÝW?‹??îžúÉ@àÒ?îžúÇ_•?îžäv¼†?îžäp`?u?îžÎ"Jõ˜?îžÎ‘|´?îž·ÍÕˆV?îž·Èž?îž¡x·K?îž¡rý”À?îž‹"ò ?îž‹8²C?îžt̆¾?îžtÆ̲Ž?îž^uqeb?îž^o¸_?îžH¶°k?îžHýP•?îž1ÅSŒÜ?îž1¿š13?îžlIÑ°?îžfz5?Å?îž ßrC?îî¸Adš?î{?îØ]Bß?îØWˆÏî?î›ä†?îÁûâÂ?î«¥Nã?î«Ÿ• k?î•H[7Â?î•B¡ù[?î~êÁÞÅ?î~夌?îhŒ€iå?îh†Ç3Û?îR-PÍC?îR'—›h?î;Í@}î?î;LJPB?î%l†(ñ?î%fÌÿs?î :)?îgÛ?îœø©a?îœø£X@q?îœâFX ?îœâ@žî ?îœËâó}?îœËÝ:dS?~æg]?y-RÌ?/5ø?v%—?´Í/o?¯#>?îœrNÁNÒ?îœrIFÑ?îœ[è ?îœ[âS‹D?îœE€­\“?îœEzô\ò?îœ/£Ø-?îœ/êܼ?ò± ?9¹Ê?îœF•Åb?îœ@ÜÒS?î›ëÜ‘x|?î›ëÖ؉?î›Õqä6ä?î›Õl+L7?‹“n?Ҭñ?šŠ<þ?”ÑZ²?î›’-á.J?î›’((P0?î›{À h?î›{ºÔF?î›eRè?î›eL×f?î›Nãê€!?î›NÞ1®›?î›8tš{Ä?î›8ná®o?î›"¢‰l?î›!þéÀI?î› ”£¨?î› ŽJÞ¸?îšõ"º„4?îšõÃv?îšÞ°Èÿ‰?îšÞ«Bü?îšÈ>0,?îšÈ8wWÒ?îš±ÊíIö?îš±Å4•Ï?îš›W§Š?îš›QH÷•?îš„ân#y?ܵw·?îšnm2?îšngy]‚?îšW÷NFÊ?îšWñ•£m?îšA€Â0?îšA{ Ù?îš+ 5?îš+Ôm??îš‘±|Ç?îš‹øæ?î™þ-"=?î™þt®?î™ç œ?î™çšG‹@?î™Ñ&,6±?î™Ñ s¬‰?«¯ç«?¥÷a·?05?*Ô~u?î™´ÁR?—Æ?î™w8Mú¬?î™w2•T?î™`»2÷ú?î™`µz‚Ö?î™J=p.G?î™J7·½W?î™3¿J(?î™3¹OÝm?î™?öU„?î™:=ìý?î™À=Ö$?…qÓ?î˜ð?Þìý?î˜ð:&Œá?î˜Ù¾Øæ?î˜Ù¹¬ÿ?î˜Ã=*$?î˜Ã7qÌ\?ºÖ8~?µå?7ÙÜ@?2!Œø?6âv?~—d?î˜i/ï?î˜i*6×&?î˜RªþsN?î˜R¥F0§?î˜<%hg"?î˜<°(±?î˜%Ÿ+hÉ?î˜%™s.?î˜G™d?î˜c_?î—ø½òâ?î—ø‹Á?î—â½?î—âÕö?î—Ë·?î—Ëyþñ/?î—´õòHî?î—´ð:#Ã?î—žkNÿY?î—že–Þe?î—‡àÚÎ?î—‡ÚH¾?î—qTÔf?î—qNP»à?î—ZÇgå"?î—ZÁ¯ÐÓ?î—D:|%?î—D4dl ?î—-¬&¹é?î—-¦n® ?î—‡—k?î—ÏÂ?î—Ž=„?î—ˆ…€ ?î–éþJQ\?î–éø’R#?î–Óm®¬?î–Ógö$«?î–¼Üif?î–¼Ö±?î–¦Jx·Æ?î–¦DÀÅ5?î–·ás8?î–b´€ª?î–bŠüšÃ?î–Kü ÄO?î–Köhâ ?î–5fã;ƒ?î–5a+^ ?î–Ðüß ?î–ËEÏ?î–:n§˜?î–4¶Ò”?î•ñ£5Tá?î•ñ}„?î•Û U@T?î•ÛsÃ?î•ÄrÌÚ?î•Äm°?î•­Ù™º:?î•­Óáö?î•—?À9è?î•—:z?î•€¥fS?îŒú¦ˆB”?îŒãѶ¢?îŒãÌ£)?îŒÌöˆ ±?îŒÌðÒ~?´K¶?þ4È?>:ŽÂ?8„|?aß–?[eÑ5?îŒqƒX^?îŒq}¢Tu?îŒZ¤¨K?îŒZžòE??îŒCÅñ?îŒC¿cc?îŒ,äá–b?îŒ,ß+™?îŒ5¶?îŒþJ<¶?î‹ÿ"uÂ?î‹ÿ¿# ?î‹è@A1l?î‹è:‹@ú?î‹Ñ]d¢w?î‹ÑW®¶M?yÞµˆ?t(Í¥?î‹£•¯Šx?î‹£ù¦Ý?î‹Œ°Öl?î‹Œ« Œ¼?î‹uËU$0?î‹uÅŸI$?î‹^å*ý›?î‹^ßu&Ø?î‹GþX'?î‹Gø¢E«?î‹1Ü“£?î‹1&Åp?î‹.¸â?î‹)Å÷?î‹EëWÛ?î‹@5’8?îŠì\u x?îŠìV¿J?îŠÕrVŸg?îŠÕl âV?‡Ž‰ö?ØÑ-?œ!Í?–k^M? 1ô?T½?îŠyÃJi?îŠy½”[|?îŠbÕã1?îŠbÐ-‰y?îŠKçÔú3?îŠKâVØ?îŠ4ù¦?îŠ4óge•?îŠ ¾ÂÜ?îŠ (?Öê?îŠ@l?î‰ð)ŒI?î‰ð#Qú?î‰Ù7°€†?î‰Ù1úòœ?î‰ÂE±*†?î‰Â?û æ?S S(?MUÍÒ?_½qj?Zð_?î‰}kÈy®?î‰}füí?î‰fw*ã"?î‰fquj¬?î‰Oå¢2?î‰O|0.?î‰8‹ûSÅ?î‰8†Eãå?î‰!•gò4?î‰!²†Ÿ?î‰ ž+§?î‰ ˜v6]?îˆó¦LCÝ?îˆó –àÞ?îˆÜ­Å :?îˆÜ¨¬†?îˆÅ´”kt?îˆÅ®ß ?º¾©‰?µ Sl?ÀAhð?ºŒ?Åõ¤?¿f¨ ?îˆiÉR”%?îˆiÃJì?îˆRÌâ ?îˆRÇ,Ï?îˆ;ÏÉÁb?îˆ;Ê€Á?îˆ$Ò dT?îˆ$ÌV(?îˆ Ó§Û?îˆ ÍñäÓ?î‡öÔ›c?î‡öÎæ/a?î‡ßÔéÿ?î‡ßÏ4Ï¡?î‡ÈÔ“µ?î‡ÈÎÝå“?Ӕ<~?Íß©?Ñð$?Ì:û?ϦÚ?Éðã ?î‡lÌ´`.?î‡lÆÿFA?î‡UÉ|?î‡UÃjfv?î‡>Ää&ˆ?î‡>¿/6?î‡'À«ÿ?î‡'ºLžú?{{e?Ær¯?î†ù´O9»?î†ù®š5R?î†â­{_ô?î†â§Æ_Ù?î†Ë¦è?î†Ë P?æ|„?˜1…?ޥr?î†)²C?Šú¯?…EÀ.?î†o€l½Ã?î†oz·Ó1?î†Xu5Ä?î†Xo€ÞL?î†AiUâí?î†Ac¡ù?î†*\Ìdá?î†*W‡;?î†O˜–?î†Iã½:?î…üA¿‹É?î…ü< ¶Â?î…å3;œN?î…å-†Ë—?î…Î$ »$?î…ÎXî½?î…·:ûž?î…·†3†?î… ½¶?î…ŸþòI?î…ˆò–Ýf?î…ˆìâî?î…qàÉÞ?î…qÛ"ì?î…ZÎSŠ¬?î…ZÈžÓÔ?î…C»3/¦?î…Cµ~}?î…,§m Z?î…,¡¸^#?î…’ýó§?î…IIÀ?î„þ}æØF?î„þx22°?î„çh(¬Ë?î„çbt †?î„ÐQÁê ?î„ÐL M¬?:±Þh?4ýEÅ?î„¢"û ½?î„¢FŒk?î„‹ œþ"?î„‹èn"?î„sñ•f?î„sëà‘·?î„\×ç¼Ä?î„\Ò35g?î„E½’ƒ?î„E·Ýÿú?î„.¢“ê ?î„.œßkf?ð/é?î„;µ?î„j¤(¡?î„dﲋ?îƒéM°Æ½?îƒéGüTù?îƒÒ0ü›?îƒÒ*b*?ÕD]? Û>?òêë ?í6†=?Ó[[?ͦúŽ?îƒu³%Ž?îƒu­p²g?îƒ^’E­p?îƒ^Œ‘Uœ?îƒGpÂG?îƒGk ó?îƒ0N– X?îƒ0Há¼*?îƒ+¿`?îƒ&t…?îƒJúM?³Å?î‚êä*¿??î‚êÞv} ?î‚Ó¿c„?î‚Ó¹®Â¤?™÷'”?”Bî?î‚¥sâe‘?î‚¥n.0Y?î‚ŽM(ö??î‚ŽGtÅ[?î‚w%Êù.?î‚w Ì?î‚_ýÆý?î‚_øîÂ?î‚HÕ,?î‚HÏeyE?î‚1«È"d?î‚1¦Ñ?î‚Ð!Ñ?î‚|’?î‚W0Õ?î‚Q{ÿì?îì+ìZ<ß?î€8¦?î€?î€ÿ;Ò ?îíÊÛÛ?îíÅ'Q°?îÖqV?îÖŠjƒ?î¿T»‘M?î¿OæÓ?=›?î¨û—x?îÛü #?îÖHhX?îyž¢?îy˜îx“?îb`Ÿ õ?îbZërÛ?îK!ò9Ø?îK>¥?î3âŸÖ,?î3ÜìEÃ?‹Ï?îœñÿ¿?îb¨ª?î\O ó?î~î ¸î¾?î~îk_?î~ÖÞÇ«î?î~ÖÙ,è?î~¿œ-\ï?î~¿–yâC?î~¨Xíf2?î~¨S9ïß?î~‘D\?î~‘RÒc?î~yÐvtM?î~yÊí?î~b‹AZ)?î~b…ðã?î~KEcÐj?î~K?°k~?î~3þÝö„?î~3ù*•ò?î~·´Ò~?î~²vF?î~oâËÄ?î~j/sæ?î}î'i£ò?î}î!¶Po?î}ÖÞJKh?î}ÖØ–ü??î}¿”ƒ?n?î}¿ŽÏô ?î}¨JŸn?î}¨DaXú?î}ÿpŠ?î}ùP.q?î}y³IJU?î}y­– —?î}bfæLj?î}ba3?î}KàLp?î}K-h?î}3Ì1³Œ?î}3Æ~‚ß?î}}ÝË?î}x)çy?î}.⌅?î})/d?î|íßAlU?î|íÙŽH»?î|ÖŽùÒ¤?î|Ö‰F³f?î|¿>Q ?î|¿8[6&?î|§ìzóH?î|§æÇÜÁ?î|š@© ?î|”—v?î|yGc¦Ã?î|yA°˜õ?î|aóßöÅ?î|aî,íS?î|JŸ´è’?î|Jšã|?î|3Jæ®?î|3E3­Ø?î|õr%Î?î|ï¿)r?î|ŸVT?î|™£¥U?î{íH–¦(?î{íB㲆?î{Õñ12?î{Õë~Ÿí?î{¾™%× ?î{¾“rì!?î{§@vx?î{§:Ã'î?î{çãÁ?î{ám”?î{x#vv?î{x‡p˜§?î{a2„÷Ô?î{a,Òb?î{I×@u’?î{IÑ ?î{2{VG?î{2u£>‘?î{É%‹?î{Y3?î{ÁS–?î{» Î–?îzìbÿžï?îzì]LÛT?îzÕïé?îzÔþR0¬?îz½¤bØ?îz½ž°%?îz¦DeO?îz¦>b®Ð?îzŽã"g¸?îzŽÝoµ˜?îzw…ík?îzw{Ó?©?îz`@åy?îz`Ž<?îzH¼UÕ?îzH¶¢iÒ?îz1XÁ¸B?îz1Sž?îzôƒÀ¨?îzîÑ$d?îz &ì?îz‰í?îyë*™ì?îyë$bg?îyÓÃàh­?îyÓ¾-Ùˆ?îy¼]Qï?îy¼WRÇ*?îy¤õú?îy¤ïÎ~–?îyU@„?îy‡¢¾?îyv$ƒÃ?îyvÑEo?îy^» <?îy^µWÂØ?îyGPèÊ”?îyGK6U±?îy/æ!üª?îy/àoŒ(?îyz±â¦?îytÿv…?îy› ¬?îyè¢ë?îxé¡ÞcR?îxéœ+ÿó?îxÒ4wýP?îxÒ.ÅžR?îxºÆk6F?îxºÀ¸Û©?îx£W¹ÌD?îx£Rv ?îx‹è_ÐP?îx‹â­~v?îxtx_ ?îxtr¬³(?îx]¸K®?îx]˜?îxE–j1v?îxE·ìÂ?îx.$u ?îx.Ã`-?îx±Ú·È?îx¬({Ø?îwÿ>™–O?îwÿ8ç^Á?îwçʯìþ?îwçÄý¹Ó?îwÐV"·?îwÐPpˆP?îw¸àîÕ?îw¸Û;Üo?îw¡kÊ ?îw¡e`¤?îw‰ô“\?îw‰îám»?îwr}k˜r?îwrw¹{5?îw[œ£ž?îwZÿêŠÄ?îwC*Ûý?îwC‡xdž?îw,…X?îw,_uE?îwšQŽ ?îw”Ÿ‚]?îvýîQ¼?îvý?îuœ À‡Ø?îu…!¹ è?îu…_ç?îumœZµä?îum–¨ùI?îuVY—b?îuV§ß,?îu>± ¦?îu>‰ÿX×?îu'!e?îu'o¶&?îu¹{Ï?îuzÐÌ?ît÷ö¨hì?ît÷ðöÂO?îtàlí}?îtàg;ÚÍ?îtÈâ­ã?îtÈÜÜ?ît±W„Bß?ît±QÒ©v?ît™ËÒ÷œ?ît™Æ!bš?ît‚?z¹"?ît‚9É(†?îtj²y:©?îtj¬Ç®u?îtS$Ð7´?îtS¯è?ît;–€4?ît;ÏÎ?ît$ˆìû?ît$×mý?ît wèwX?ît r6üÂ?îsôç£by?îsôáñìK?îsÝV´÷"?îsÝQ…[?îsÅÅðš?îsÅ¿mƒ;?îs®2ã ô?îs®-1 ý?îs–Ÿþ÷?îs–šM’?îs rÖÏ?îsÁv¨?îsgxA20?îsgrÖr?îsOãh‹„?îsOÝ·4/?îs8MçeE?îs8H6Y?îs ·Áä?îs ²– ?îs óS—?îs B }?îrñ‰ L?îrñƒÍÛ?îrÙñe$??îrÙë³â÷?îrÂX£Y ?îrÂRòA?îrª¿9ÆÀ?îrª¹ˆŽK?îr“%-_c?îr“|+W?îr{ŠwÒN?îr{„Æ¢¬?îrcï¨ ?îrcéj|Ò?îrLSÍ&?îrLMh¦X?îr4¶s. ?îr4°Â ¼?îr#Î?îrqøÔ?îr{/F’?îru~-?îqíÜ”¤ö?îqíÖãÑ?îqÖ=SPÎ?îqÖ7¢@?îq¾mÑ÷?îq¾—¼Å¦?îq¦üàB¸?îq¦÷/:Ò?îq[­*î?îqUü't?îqw¹ÖDŽ?îqw´%E?îq`YEo?îq`¨JË?îqHt3ã°?îqHn‚íw?îq0Ðlª£?îq0Ê»¸Õ?îq+þ'?îq&M,Å?îq†éª?îq85´?îpéá1 î?îpéÛ€(c?îpÒ:ÒÍÆ?îpÒ5!í§?îpº“΀?îpºŽ¤e?îp¢ì&ªñ?îp¢æuÓª?îp‹CÙæ?îp‹>(2 ?îpsšäß„?îps•4?îp[ñN\P?îp[ë’N?îpDG—u?îpDA`Ñß?îp,œ/}-?îp,–~¼?îpð©ÆÔ?îpêù ?îoýD}^V?îoý>̦?îoå—«ý?îoå‘ûI7?îoÍê7\R?îoÍ䆬Þ?îo¶<Í£?îo¶6n"œ?îož`‡?îož‡¯aí?îo†Ýþ`_?îo†ØM¾3?îoo-÷Œ½?îoo(Fîÿ?îoW}K¬ž?îoWw›M?îo?˽f3?îo?Æ ÑQ?îo(SN?îo(¢¾ ?îof>rX?îo`æR?înø²†$Ï?înø¬Õ7?înàþ#Or?înàørÌH?înÉIww?înÉCgø¼?în±“i»‘?în±¹AE?în™Ý?în™×_&?în‚&uŽ?în‚ _ ?înjnh(m?înjh·»m?înR¶<Ø?înR°iÔH?în:ý#jÐ?în:÷s¯?în#C†6ö?în#=Õ×E?în ‰AòÏ?în ƒ‘—?îmóÎV¼®?îmóȦeÜ?îmÜÅ‹?îmÜ -)?îmÄVŒÀ]?îmÄPÜrk?îm¬™«Ðó?îm¬“û‡q?îm”Ü&Ρ?îm”Öv‰?îm}ùؽ?îm}I˜?îme_% ½?îmeYtÑŒ?îmMŸ¬Š™?îmM™üRØ?îm5ߊ ˜?îm5ÙÙÖH?îmÀÛ:?îm¬[?îm]Sƒ*?îmW£X¼?îlî›>íô?îlî•ŽÇ÷?îlÖØ‚m±?îlÖÒÒL%?îl¿"®?îl¿r”?îl§Qº?îl§Kk¡r?îlŒlùq?îl†¼å:?îlwÇÄþ?îlwÁjµ8?îl`!=¢?îl_ûq2N?îlH:€ì?îlH4Ð{ ?îl0s;á6?îl0m‹ÞÆ?îl«PI ?îl¥ K ?îlâ¿p>?îlÝv²?îké‰u8?îkéÙ€?îkÑO¬Þ(?îkÑIüí?îk¹…*•°?îk¹z©|?îk¡º†T?îk¡´Sž“?îk‰î7r?îk‰è‡#?îkr!Å(‚?îkrI¦?îkZT­K?îkZNýp?îkB†ðTx?îkB@~ƒ?îk*¸—f?îk*²ÝÅä?îkéˆaþ?îkãØ”ï?îjûÜ×?îjû-{?îjãIŠIp?îjãCÚ…I?îjËx–j•?îjËræªá?îj³¦úú;?îj³¡K>ü?îj›Ôºz€?îj›Ï õ?îj„×m:?îjƒü'ºã?îjl.Mö?îjl(žH.?îjTZÿl?îjTToUý?îj<…M û?îj<f?îj$¯ÖŸÒ?îj$ª&ÿM?îj Ù¹y–?îj Ô Ý…?îiõûHU?îiôýK°º?îiÝ+˜0d?îiÝ%è=?îiÅSŽ¹C?îiÅMß*’?îi­zâ/Þ?îi­u2¥¢?îi•¡‘ç-?îi•›âag?îi}Ç2B?îi}Áí°ð?îieíû5?îieçU~Z?îiNˆ¥†?îiN Ù- ?îi650÷J?îi6/ƒZ?îiX4á>?îiR…qÅ?îiz¼Ê?îitàQÆ?îhîœBsm?îhî–“ à?îhÖ½N¹Ò?îhÖ·ŸW¼?îh¾Ý³O?îh¾Ø¹¯?îh¦ýo©ë?îh¦÷ÀPÂ?îh†&8?îhÖц?îhw:õÞà?îhw5FŽ¤?îh_X½[v?îh_S±?îhGußæÕ?îhGp0Ÿˆ?îh/’Y§?îh/Œªd.?îh®,P€?îh¨}!?îgÿÉZb¦?îgÿë(¿?îgçãáš ?îgçÞ2d?îgÏýÀ~¤?îgÏøM¬?îg¸úZÀ?îg¸K.@?îg /¶E?îg )ÞŽ>?îgˆGyäG?îgˆAÊÀ¸?îgp^¿ÍÛ?îgpY®Ã?îgXu_‘?îgXo°vq?îg@‹W¶!?îg@…¨Ÿú?îg( «†Î?îg(šüu ?îgµXÀm?îg¯©³8?îføÉ]ëj?îføîâ®?îfàÜÁ|œ?îfà×xY?îfÈï};X?îfÈéÎ;Ž?îf±‘Eé?îf°ûâJ˜?îf™å?îf™ Qîµ?îf#ÉØ?îfå½?îfi3ív?îfi.>‘?îfQCl$?îfQ=½:±?îf9RDï?îf9L– &?îf!`w…š?îf!ZÈ¥$?îf n0D?îf hXTH?îeñzðâ®?îeñuB ,?îeÙ‡3%ü?îeÙ„Rô?îeÁ’Òר?îeÁ$ ?îe©Ì!"?îe©˜W?îe‘¨ ®?îe‘¢p[?îey±Ïe?îey¬ ]G?îeaºØD$?îeaµ)‡?îeIÃØá?î^Ø¢?î^‰[_Ô?î^…h¸?î^…bÓ¥n?î^mAXZ?î^m;ªê=?î^UŠq?î^Uܘ/?î^<ñü´?î^<ëi•ö?î^$Ȇ$?î^$ÂU#ë?î^ žGAž?î^ ˜™ãé?î]ôsé8 ?î]ôn;ÞÚ?î]ÜHè‡L?î]ÜC;2 ?î]ÄBóÔ?î]Ä•£­?î]«ðùd4?î]«ëL‘?î]“Ä ‡Q?î]“¾`@4?î]{–}!Ô?î]{Ïß?î]cb›Ü+?î]K95iÐ?î]K3ˆ0C?î]3 GM.?î]3š&?î]ر?î]Ó_•?î]§yØ?î]¡ËÕÜ?î\êu–´ö?î\êoé?î\ÒC è?î\Ò=_üø?î\ºß?î\º 2b¨?î\¡Ü Di?î\¡Ö\*…?î\‰§Œà?î\‰¡ßʹ?î\qrlØ?î\ql¾ñ?î\Y<£¦^?î\Y6öš?î\A4³W?î\A‡«Ž?î\(Ï V?î\(És ?î\—e ®?î\‘¸ ó?î[ø_ËØ?î[øYVѤ?î[à%ýù]?î[à Q°?î[ÇìOʘ?î[Çæ¢Ùs?î[¯±ûµ!?î[¯¬NÈ„?î[—w.O?î[—qWF8?î[;fû ?î[5º?î[fÿ!ò?î[fùt;ë?î[NÂ8!.?î[N¼‹F¯?î[6„© 1?î[6~ü6:?î[Fs1±?î[@Æ`C?î[™Î†?î[í ?îZíȨ²?îZíÂmàU?îZÕ‡õÝÂ?îZÕ‚Ií?îZ½G-º?îZ½A€[n?îZ¥½^,?îZ¥£i?îZŒÃ¨U*?îZŒ½ûžð?îZt€ï¬˜?îZt{Búè?îZ\=‘*ò?îZ\7ä}Ë?îZCùŒíÛ?îZCóàE=?îZ+´åi¶?îZ+¯8Å¡?îZo˜e>?îZiëų?îYû)¥þ?îYû#ùc?îYâãàÚ?îYâÝcJb?îYÊ›Õc™?îYÊ–(Ѭ?îY²Sõè?îY²NH‡„?îYš qhÑ?îYšÄß÷?îYÂH&’?îY¼›¢B?îYixyk×?îYirÌì?îYQ.¬x?îYQ([1>?îY8âñw>?îY8ÝEŽ?îY —6éÌ?îY ‘Šw§?îYJÙ°^?îYE-BÄ?îXïý×’œ?îXïø+)?îX×°/¬?îXת‚»(?îX¿aå Û?îX¿\8Àã?îX§ö–·?îX§ J;J?îXŽÃb×Á?îXŽ½¶€à?îXvs-å?îXvm“G?îX^"Sùõ?îX^§¬*?îXEÐÔk|?îXEË(">?îX-~´•?îX-y½â?îX+îùW?îX&B¹1?îWü؆4’?îWüÒÙøø?îWä„{`?îWä~Ï(ú?îWÌ/Ë}L?îWÌ*JÊ?îW³Úwq,?îW³ÔËC7?îW›„®Q?îW›~Õ„é?îWƒ-çý€?îWƒ(;Ø¥?îWjÖª|?îWjÐþ\3?îWR~ÊÖá?îWRy» ?îW:& aP?îW: _J?îW!Ìqó?îW!ÆÅà\?îW r4Àb?îW lˆ²I?îVñO=?îVñ£3ö?îVػĢÈ?îVضÊ?îVÀ_”Fz?îVÀYèF ?îV¨¼¸8?îV§ý¼V?îV¥>Û÷?îVŸ’ä£?îVwGÎ×?îVwAnÜ?îV^èP® ?îV^⤿Õ?îVFˆßÐ?îVFƒ3æk?îV.(Ël¡?îV.#‡‡?îVÈ¿²?îVÂcß'?îUýf¬ ?îUýaD ?îUå¦ßX?îUäþûê?îUÌ¡ú¬Î?îUÌœNÙï?îU´>§¥º?îU´8û×k?îU›Ú±K?îU›Õ7‹?îUƒv¾?îUƒpgý?îUkÏ@í?îUk #€L?îURªè?®?îUR¥<ƒ?îU:DZ5ª?îU:>®~)?îU!Ý&•?îU!×zS¤?îU uO¯r?îU o¤?îTñ Ò§T?îTñ&ýƒ?îTØ£°˜0?îTØžòï?îTÀ9êe†?îTÀ4>ÄÕ?îT§Ï~ ?îT§ÉÓæ?îTdkØŽ?îT^À@þ?îTvø¸^?îTvó Ë ?îT^Œ^@?îT^†²Ò?îTF\j:?îTF°à]?îT-±¹–š?îT-¬N?îTCqßÈ?îT=Æ_ ?îSüÔ„?îSüÎÙ Ý?îSädówÒ?îSä_H:?îSËô½Ç`?îSËïTZ?îS³ƒââü?îS³~7t‡?îS›eÿú?îS› º–?îS‚ B—°?îS‚š—2`?îSj-{s?îSj'ϸµ?îSQº.d?îSQ´eÒ7?îS9F¢ ?îS9@WJn?îS ÑO‘Â?îS ˤ>»?îS[ù¦ž?îSVNX)?îRïåþ¬h?îRïàSb…?îR×o_†_?îR×i´A?îR¾øÝt?îR¾òrœ·?îR¦€7}£?îR¦zŒAy?îRŽ­J?îRŽ…?îRuŽ€%ô?îRuˆÔòñ?îR]°.}?îR] ?îRDš;õº?îRD”ËÞ?îR,#™?îR,xsÓ?îR£hÁQ?îR½ œ?îQû' ?îQû!^ä`?îQ⪠ÄÎ?îQâ¤^­A?îQÊ,eS?îQÊ&ºZ?îQ±®š›?îQ±¨rŒ6?îQ™/47Œ?îQ™)‰-¼?îQ€¯§~?îQ€©üyE?îQh/vǃ?îQh)ËÆÜ?îQO®¤€]?îQO¨ù„J?îQ7--°É?îQ7'‚¹K?îQªÖê‰?îQ¥+÷¡?îQ'«=Ç?îQ"Os?îPí£Ø©g?îPíž-¿©?îPÕ^…?îPÕ³ŸÛ?îP¼š@Ê?îP¼”•"6?îP¤{´ä?îP¤ÐØæ?îP‹Žhg?îP‹ˆdÿ?îPsžÿ?îPsUÌ-?îPZJÐ?îPZyŸB“?îPAöî*r?îPAñC`Ì?îP)mî“?îP)hCÎ?îPäFÈ•?îPÞœ?îOøYúÁ«?îOøTPÈ?îOßÏ ›"?îOßÉ_ãÕ?îOÇCs]{?îOÇ=ȪÅ?îO®·6¯Ü?îO®±Œ½?îO–*Ut8?îO–$ªÊ°?îO}œÎ=f?îO}—#˜u?îOe¡(j?îOeöˆ?îOLÏÜ#?îOLz%@a?îO3ðZut?îO3ê¯ÞI?îO`=ý‘?îOZ“jþ?îOÏ}¥*?îOÉÓ/?îNê>‰?îNê8nÿ³?îNѬ î?îNѦci4?îN¹`RÒ?îN¹µÒž?îN † üN?îN €b€³?îN‡òÌL?îN‡ìjUI?îNo]yi@?îNoWÎöÕ?îNVÈ9fš?îNVÂŽøÈ?îN>2SWö?îN>,¨î¼?îN%›Êm&?îN%– …?îN 9¸?îN þòÙ±?îMôlË ?îMôg º›?îMÛÔVm?îMÛά+?îMÃ;;„?îMÃ5‘2P?îMª¡|?îMª›Ñµ]?îM’”?îM’pΊ?îMyl?îMyfjÄ?îM`Ði.l?îM`ʾî–?îMH4AX?îMH.r?îM/—*‡Ö?îM/‘€Q4?îMù“Zž?îMóé(–?îLþ[Yè~?îLþU¯»?îLå¼|ŧ?îLå¶ÒœÓ?îLÍûJÌ?îLÍQ&“?îL´|ئd?îL´w.†Å?îL›Üä?îL›ÖgÉ?îLƒ:¥˜h?îLƒ4ûÿ?îLj˜˜z>?îLj’îho?îLQõæÑE?îLQð<Ä?îL9R‘~ä?îL9LçvL?îL ®›±?îL ¨ñ­ ?îL ëˆ?îLVì&?îKïdÂÓ?îKï_ ?îKÖ¾âKš?îKÖ¹8Uo?îK¾]çO?îK¾³õÁ?îK¥q6ˆd?îK¥kŒ›q?îKŒÉmÔ?îKŒÃÃëÀ?îKt!#b?îKtY?§?îK[wóƒN?îK[rI¤0?îKBÎC© ?îKBÈ™Î?îK*#ð¡í?îK*FÌ?îKxùÆÿ?îKsOõ¶?îJøÍ%ÞA?îJøÇ|”?îJà zfš?îJàО‹?îJÇs(Ã"?îJÇm~ÿ°?îJ®Å3\?îJ®¿‰1?îJ––z„?îJ–ìÀL?îJ}gT†Ë?îJ}aªÑ1?îJd·na6?îJd±Ä°9?îJLá$?îJL7jÄ?îJ3U®LÙ?îJ3P¥?îJ£Øj?îJž.Æú?îJñZõ&?îJë±V¡?îIé>8UÌ?îIé8Ž»ä?îIЊr0?îIЄȚ¶?îI·Öø?îI·Ð]ˆM?îIŸ õ¦?îIŸL ?îI†kAx?îI†e—{ ?îIm´æÿæ?îIm¯=}?îITýæ3û?îITø<µË?îIò?îBŒ®\?îBsÎåm™?îBsÉ=8ª?îBZé_­%?îBZã·|Ý?îBB8¥¢?îBAýz?îB)l©Ð?îB)Ä‚Ø?îB4ü˜?îB/TuÃ?îA÷LèŒà?îA÷G@o7?îAÞd0¤ª?îAÞ^ˆ‹©?îAÅzÔ:?îAÅu,%Â?îA¬Õ¯?îA¬‹-ŸY?îA“¦2Úˆ?îA“ ŠÏ?îAzºìšÖ?îAzµD”w?îAaÏ l?îAaÉ[ ¶?îAHâvK¼?îAHÜÎN°?îA/õE³”?îA/ï»0?îArã¼?îAÊð?î@þû³Ä?î@þSIJ?î@å)áÜ?î@å$9t?î@Ì:$mª?î@Ì4|‡ë?î@³IÃÎñ?î@³DíÜ?î@šXÀÅT?î@šSèè?î@g«Ì?î@arÔ ?î@htÑžÙ?î@ho)ËÁ?î@Oäù‘?î@O|=+$?î@6ŽWÞI?î@6ˆ°…?î@š&¢F?î@”~Ý,?î@¥Qb.?î@Ÿ©¡¿?î?ë¯Ü?î?ëª4E¼?î?Ò¹ÂÕÛ?î?Ò´Á?î?¹Ãûä?î?¹½^Iu?î? Ë©VÌ?î? Æ©?î?‡Ó¨{2?î?‡ÎÒ?î?nÛZ?î?nÕ]cì?î?UáÀT?î?UÜý‘?î?<çØQ¼?î?<â0¶¥?î?#íMı?î?#ç¦.E?î? ò$r?î? ì|…²?î>ñöVX?î>ñð®‘C?î>Øùæ9…?î>Øô>±?î>¿üÖÊ?î>¿÷.„ ?î>¦ÿ#bc?î>¦ù{ãR?î>Ž’•¶?î>úëQ?î>u.R?î>tû†žš?î>\%•ý?î>[û~$ñ?î>Cv2¬?î>BúÎÆM?î>)ÿ# €?î>)ù{¢Î?î>ý+x|?î>÷„v?î=÷úŒ”ã?î=÷ôå6Š?î=Þ÷Ky?î=Þñ£§Í?î=Åód—z?î=Åí½B|?î=¬îز?î=¬é1aÄ?î=“é©°?î=“ädb?î=zãÖ+“?î=zÞ.ä?î=aÝ[þm?î=a×´¼%?î=HÖ@ŠT?î=HЙL¹?î=/Î~¥Î?î=/È×lâ?î=Æî˜?î=ÀpºZ?î<ý½ƒ¸?î<ý·hT(?î<ä³a½ž?î<ä­º’¼?î<Ë©¸~?î<Ë£g’K?î<²žÒ„?î<²˜q°þ?î<™’~¦y?î<™Œ×‰¢?î<€†@P‚?î<€€™8Z?îH(è?î28£Ç?î1ùíXXÆ?î1ùç³8a?î1à›”Ùý?î1à•ï¾S?î1ÇI-@—?î1ÇCˆ)©?î1­ö éé?î1­ð{×·?î1”¢p¯²?î1”œË¢j?î(ïšú`?î(Ö6|,?î(Ö“5?î(¼ŠŒ‰Ð?î(¼„é#¡?î(¢ý@®f?î(¢÷Lþ?î(‰oSÁ’?î(‰i°dð?î(oàÁu?î(oÛ??î(VQ‘Ö?î(VKê>Â?î(<Á·vì?î(<¼( ?î(#1>ƒ˜?î(#+›:?î(  %Õ?î( šÃ?î'ðjbÎ?î'ðÇ"Ù?î'Ö| 7š?î'Öviül?î'¼é å¦?î'¼ãi¯A?î'£Ukž?î'£OÇÏ?î'‰Á'£ö?î'‰»„w!?î'p,B/?î'p&Ÿ?î'V–»yo?î'V‘V+?î'=’&~?î'<úï?î'#iÈ…¸?î'#d%l?î' Ò_nr?î' ̼Yˆ?î&ð:R”\?î&ð4¯„:?î&Ö¡¤Fæ?î&Öœ;Ž?î&½VÕ/?î&½³Î ?î&£nf¯7?î&£hír?î&‰ÓÓð™?î&‰Î0óœ?î&p8£ä?î&p3#±?î&VœÎmè?î&V—+z?î&=Y­L?î&<ú¶¾¬?î&#cC}ý?î&#] ”'?î& Å‹ûƒ?î& ¿éw?î%ð'3An?î%ð!a,?î%Öˆ9kP?î%Ö‚–Ù?î%¼è  ?î%¼âý5a?î%£HeÇÈ?î%£BÂõå?î%‰§Œ1O?î%‰¡éd6?î%pº?î%plñ¶?î%VcñôÑ?î%V^O1O?î%<Àþ+?î%<»[lK?î%#8/‚?î%#•u•?î% xÍúÏ?î% s+E®?î$ïÓ¾ìx?î$ïÎ<"?î$Ö. ¤?î$Ö(kb?î$¼‡º??î$¼‚[€?î$¢àÁn_?î$¢ÛÌl?î$‰9%(ž?î$‰3‚‹v?î$oåL?î$o‹B³´?î$Uèj?î$Uâ`×?î$<>~(Q?î$<8Û™Ž?î$"”V[È?î$"Ž³ÑÑ?î$éŒô?î$ãéšÉ?î#ï>çL?î#ï8yfî?î#Õ’ 0â?î#ÕŒgµP?î#»åV\f?î#»ß³å¡?î#¢7þS ?î#¢2[á(?î#ˆŠëy?î#ˆ„`~N?î#nÛfr8?î#nÕÄ Ú?î#U,&ÐÂ?î#U&„m2?î#;|D"=?î#;v¡Ãz?î#!Ë¿ø?î#!Æž ?î#˜÷?î#ö¡ê?î"îhаŠ?î"îc.`0?î"Ô¶f„n?î"Ô°Ä8â?î"»X\¤?î"ºý¶æ?î"¡O§|?î"¡JÍŒ?î"‡›Té:?î"‡•²¬?î"mæ`Žá?î"mà¾V?î"T0È¥¤?î"T+&r?î":z4œ?î":tîå?î" ÷VË?î" ¾,â?î" 9Ÿ?î"— Ÿ?î!íT¹?î!íNz˜Æ?î!Ó›[ê…?î!Ó•¹Ï ?î!¹áø0L?î!¹ÜVŸ?î! 'öÁv?î! "T¯™?î!†mPlÀ?î!†g®_³?î!l²}ÿ?î!l¬euÁ?î!Rö¶Q?î!Rð}²â?î!99”Ð*?î!93òÑ‹?î!|i?î!vÇB?î!¾›ëx?î!¸ùöy?î ì.#A?î ëúŒ3?î ÒAdB?î Ò;|xä?î ¸n??î ¸{ÌXu?î žÁžÎ?î ž»y½?î …(2?î „ú†7E?î k>“º`?î k8ñâC?î Q|]ñü?î Qv¼°?î 7¹‡Ú?î 7³åÂ_?î öl¶?î ðo£ ?î 1ùq6?î ,W¬]?îêm@t&?îêgž´?îЧèÀ0?îТGú?î¶áðA?î¶ÜNŠµ?îTâë?î³1X?îƒTe?îƒNx¸M?îiŒ?mð?îi†Æ?îOÃÁéÇ?îO¾ Fª?î5ú¥—²?î5õùf?î0é5?î+G„¼?îf‹ÞO?î`êI¨?î蛎­š?îè•íÅ?îÎϹÊ?îÎÊ??îµÌ¥?î´ýrFu?î›5ÌoH?î›0*íì?îgáž?îb@!Š?îg™P‹?îg“¯d?îMÊ"­?îMÄ}¯Ê?î3úIܬ?î3ô¨nœ?î)ÑŽ?î$0$Ù?îX¶Q³?îSíK?îæ†÷ˆB?îæV(­?îÌ´–®?îÌ®ô«í?î²á’¡Î?î²ÛñKá?î™ ìW?î™J¯>?î9¡ƒ.?î46é?îed¶-!?îe_å±?îK'ë?îK‰†¨g?î1¸õcÚ?î1³T&?îâ#È?îÜ‚ ?îþ ®Ö¬?îþ ¢Ž?îä2˜?îä,öïC?îÊYߺl?îÊT>ø?î°€‚ÝÏ?î°zá¸0?î–¦„Šú?î– ãj0?î|Ëå–†?î|ÆDz‘?îb𤧩?îbëŠ?îI¾8Š?îI&@?î/88ëØ?î/2—Þd?î[ÈH?îUn¿ª?îû}D\G?îûw£X?îážÛ¶?îá™:Ã?îÇ¿ÎW ?îǺ-\ð?î­àl²?î­Ú|wm?î“ÿÌÇ?î“ú+(X?îzÙ¼‡?îz8Ðî?î`=DF"?î`7£_`?îF[)â?îFUoGö?î,x9âá?î,r™Í?_ž?î‡a?îø°¨³†?îø«à ?îÞË?îÞÆMëù?îÄæ’I4?îÄàñ}?î«—¨?îªúöTÈ?î‘ù§±?î‘Xç¨?îw2»?îw-Åæ?î]JÜÀÌ?î]E< s?îCb]½?îC\¼Ðç??~ÿ?îƒ?îiÌð²?îi,÷˜?îORY¶?îNþ²ex?î54«?î4ü”»¢?îÿxRX?îùØgÔ?îü%?îöy1~?îæø)?îæòw3_?îÌóuþO?îÌíÖ"b?î²î0,?î²èUŽ?î˜èJ j?î˜âª:8?î~áÂG|?î~Ü"z(?îdÚši2?îdÔú »?îJÒÐc?îJÍ0Ÿ{?î0Êe'?î0ÄÅIl?îÁWºÊ?í?îü·§%(?îü²p)?îâ­Y$,?î⧹t ?îÈ¢hÈ„?îÈœÉB?î®–Ö,ø?6†”?¥½„?î”…ÿ?îz}ÑÓ ?îzx26z?î`p\±2?î`j½k?îFbG*•?îF\§—¬?î,S’?î,Mò„ ?îD;Yõ?î>›ÐË?îø4CÕ?îø.¤PÑ?îÞ#ªæ4?îÞ fÈ?îÄoïø?îÄ Ðul?`?î©úøŸ´?îîØÜ?îè€h?îuÛ-9?îuÕeÁM?î[ÇMí?î[Á®…ó?îA²óI?îA­S¡?î'øÚ’?î'˜Y}F?î ˆ^Õ¢?î ‚¿}7?îór"ç“?îólƒ”?îÙ[H ¸?îÙU¨¼?î¿CÎY¼?î¿>/ò?î¥+´¦?î¥&:¾?î‹øoâ?î‹ Y/Ú?îpùŸKË?îpô¥?îVߤßn?îVÚ©(?î<Å µ#?î<¿kƒ¿?î"©ÓÞ?î"¤3â[?îû(p?îˆ\Ï?îîqƒ·?îîkãùø?îÔT4a?îÔN•C8?îº6fq?îº0xMu?î UK}?î ¶7d?î…÷ó/ò?î…òT º?îk×ìàj?îkÒMÖ?îQ·F &?îQ±§´?î7•ü©­?î7]©?ît‡Ù?înrŒ,?îQ„ t?îKåª?îé.UI?îé(¶b?îÏ ‚f@?îÏãy;?î´æ ¼©?î´ànÔ‡?îšÀ÷ Ý?îš»X=Ÿ?>­.?ŸÎÓ?îftãÄ’?îfoDë?îLMçð'?îLHI”?î2&J’Ø?î2 «Ã(?îþé´?îøjè?îýÕ(É·?îýÏŠÏ?î㫦¸‘?îã¦÷?îÉ€ªÜ?îÉ{áî¼?î¯V»½Ú?î¯QŸ?î•+Tw™?î•%µÅB?îzÿJ;Z?îzù«è?î`Ò ·ˆ?î`Íú?îF¥U)¶?îFŸ¶† ?î,wi›?î,qÊ{×?îHÞÎ?îC?xï?îø°™?îø ?îÝéßYž?îÝä@ɉ?îùpÞ¾?îóÒS?^?î©‚¿•Ô?îV¬-?îQ ¬)?îu$YV?îuº‹Ø?îZñdÆí?îZëÆOU?î@½Ð:º?î@¸1È?î&‰›~"?î&ƒýV?î TÅ=µ?î O&ÔÐ?î òOÂ?î ò°Ã?î ×é8ä±?î ×ãš…˜?î ½²“)?î ½¬ã8ö?î £{)'´?î £uŠÒi?î ‰C2˜?î ‰=”Gµ?î o ›#n?î oü×ð?î TÑb-p?î TËÃæÙ?î :—‰>6?î :‘êü†?î ]¹x?î Wq|¯?î !õÿ?î VË?î ëæ:¢È?î ëàœoÎ?î Ñ©ßü˜?î ѤAΆ?î ·låáž?î ·gG¸t?î /M"ò?î )®þ¯?î ‚ñ|?î ‚ëtá"?î h²9¸°?î h¬›ž>?î NrÁf?î Nm#Pu?î 42©lT?î 4- [²?î ññ/¢?î ìS#è?î ÿ°›¤•?î ÿªýÄ?î ån¥U?î åiS?î Ë, î›?î Ë&nñœ?î °èØö@?î °ã:þ*?î –¥‰?î –Ÿf•é?î |`ŽTí?î |Zðf©?î b{qM?î b݇ò?î GÕ”~ó?î GÏöš?î -ŽÜÈš?î -‰>é?î G…•Ø?î Aç»9?î øÿŠº?î øùìäÙ?î Þ¶ìPç?î Þ±N€?î Äm®‰?î Äh6¨?î ª#Ë£º?î ª-ÜÄ?î ÙHÝ÷?î Ó«ë?î uŽ%Ë9?î uˆˆ?î [Ba?î [<Ã`Í?î @õùu ?î @ð[Á½?î &¨ñþ?î &£Smœ?î [EOJ?î U§¥Ó?î ò ÷•l?î òYðà?î ×¾ *ã?î ׸l‹B?î ½n{S?î ½hÝl?î £IŽÓ?î £«ù ?î ˆÍyiÖ?î ˆÇÛØ÷?î n|ú?î nvgv?î T)ïÿ®?î T$Rx§?î 9×<Ÿ?î 9ÑŸæ?î ƒæ¶?î ~I8Ó?î /î^ï?î *Pæ¬?îêÛUä?îêÕ·¬?îІ]?îЀ|î°?î¶0>æª?î¶*¡}+?î›ÙÄBr?î›Ô&Ýà?hè?î} C?îg*êŒ?îg%L­Ó?îLÒŽ4h?îLÌðÞœ?î2yìj?î2sð›‹?îí´?îPAÂ?îýÅ­è*?îýÀ¡%?îãjÌô°?îãe/²˜?îÉJÍ|?îÉ ­R?*c¢?î®­+e?î”Vi°?î”PÌ|Å?îyù¬?îyói}°?î_›þ"?î_•gÔ¯?îEYô?îw¡?K?îö¼§d?îö‘ª?îÛ»™Aó?îÛµü1'?îÁYÖdŽ?îÁT9X±?î¦÷u”d?î¦ñØv?s`'?Ö^'?îr0Óm~?îr+6pn?îWÌàh?îWÆóèF?î=g°ê?î=b ·?î#0lº?î"ü“~w?M?î–s°ù?îî5QlO?îî/´‡ë?îÓÍôgª?îÓÈWˆ6?î¹eöê?î¹`YAe?îžýYx®?îž÷¼£?î„”ââ?î„Ž=?îj*CtÅ?îj$¦©?îO¿È(á?îOº+b?î5T®îƒ?î5O,¯?îèõ ?îãXN.?î|m¶?îwµÃ?îæ¦!?îæ ^?îË¢/#?îËœt?î±3¥â?î±. 8ç?î–Äp‡0?î–¾Óã?î|T˜ ?î|NûmË?îaäØe?îaÞ>?îGsA?îGmc¬B?î-AÙ#?î,û¥Hº?îŽâ"ï?î‰E—x?îøàƒÓ?îøCýM?îݨ=ʦ?îÝ¢¡I?îÃ3ù\F?îÃ.\ߤ?¼q?xDÂ?îŽIæ*?îŽCñsl?îsÓd>s?îsÍÇШ?îY\›g¶?îYVþþÞ?î>å0¨3?î>ß”DM?î$m$Ϋ?î$gˆo¸?î ôzy?î îݹy?îï{*éæ?îïuŽ”Ù?îÕ;¨Ê?îÔûŸX°?®ˆC?îº=?î  e}?î ãJ?î…®Zw?î…Š7?îk<ê˜?îk  ®L?îP–+/»?îPŽøc?î6x?î6Ü\·?îš&‹ì?^{?î2m?î–E?î曜Mä?îæ–*\?îÌiëÖ?îÌÍÍB?•Ñ?î±”øî1?î—%?î—ƒ[?î|— Æ„?î|‘m¶Í?îbTQ¦?îb¸Fä?îGþà`?îG‹bÚ”?î- õŠ?î-nô³?îˆu$º?î‚Ù(Ø?îø>ðå?î÷ý¢ùø?îÝ}iÜÜ?îÝwÍêä?îÂöô™¸?îÂñX¬µ?î¨oÝض?î¨jAðª?îè)î?î⎠ú?îs_Ô5?îsZ8'?îXÖàr0?îXÑD™?î>MMæG²?î#Ãõæ?î#½}&§?î 8E@±?î 2©vh?íÿî¬Ó”Ç?íÿî§7Ït?íÿÔ À†ô?íÿÔ$Æ™?íÿ¹”j?íÿ¹Žt¯+?íÿŸÁ<ä?íÿŸ%†u?íÿ„xÐûx?íÿ„s5J?íÿiêB‘?íÿiä¦ä?íÿO[û?íÿOUxS‰?íÿ4ËFä?íÿ4ŪeR?íÿ:Øу?íÿ5=3è?íþÿ©ÏB7?íþÿ¤3©”?íþå%ï¡?íþåŠ[õ?íþÊ…Ü?Õ?íþÊ€@±!?íþ¯òõ?íþ¯íY“E?íþ•_n…"?íþ•YÓ^?íþzËG*e?íþzÅ«ª˜?íþ`6„Æ”?íþ`0éKÀ?íþE¡#;å?íþE›‡Æ ?íþ+ "¤q?íþ+‡3Ž?íþtQ$?íþnµœ9?íýõÜ°¾—?íýõ×W¥?íýÛDnªV?íýÛ>ÓH]?íýÀ«‹˜Ù?íýÀ¥ð;Ø?íý¦£¬?íý¦ lK¤?íý‹wá|È?íý‹rF)º?íýpÝÀÁ?íýp×r¬?íýVA³êæ?íýV<¡Ê?íý;¥«K{?íý; Y?íý! àä?íý!e¡¼?íýk¶ßß?íýf¥°?íüëÍÉ+Ø?íüëÈ-ö£?íüÑ/<ÈM?íüÑ)¡˜?íü¶?íü¶ŠsÔÝ?íü›ð?9S?íü›ê¤ ?íüOÐ\?íüJ5:Ï?íüf®ÁË?íüf©%þy?íüL À·?íüLs©`?íü1j¾P’?íü1e#>6?íüÇͲ?íüÂ2Q?íûü$:v=?íûüŸm×?íûဠYí?íûáznV‚?íûÆÛ4ñð?íûÆÕ™ó€?íû¬5ÀÙu?íû¬0%ßÿ?íû‘¯Dg?íû‘ŠOí?íûvèü¸?íûvãa(9?íû\A¨ ž?íû\< 6?íûA™µ’ò?íûA”­k?íû&ñ"n6?íû&뇪?íû Gì²!?íû BQÖ‘?íúñž¬€?íúñ˜}Õí?íúÖó¥S?íúÖî >½?íú¼H‘÷A?íú¼B÷*§?íú¡œÞǶ?íú¡—D?íú†ð‹›n?íú†êðØÍ?íúlC™?b?íúl=þ½?íúQ– 3¡?íúQnzù?íú6çØÅ?íú6â>Y?íú9 T?íú3m^¥?íú‰˜Œ¨?íúƒýâ÷?íùæÙˆCM?íùæÓíž™?íùÌ(رR?íùÌ#>œ?íù±w‹V¤?íù±qð»ë?íù–Åž3¨?íù–Àí?íù|I?íù| t¸K?íùa_äHõ?íùaZI½5?íùF¬€ç?íùF¦ú%?íù+÷¯ñ¤?íù+òoá?íùB¦Íþ?íù= Q9?íøöŒþ|»?íøö‡dô?íøÛÖ¶d»?íøÛÑñó?íøÁÑk|?íøÁ6ý²?íø¦hL,'?íø¦b±Ã\?íø‹°(ÙG?íø‹ªŽuz?íøp÷fÙ¸?íøpñÌzê?íøV>¬ö?íøV8mS'?íø;„ˆõ?íø;~l4%?íø ÉiÐú?íø ÃÏ*?íø. ­?íø“ÕÜ?í÷ëRS‘ì?í÷ëL¹L?í÷Еۤ ?í÷ÐAc:?í÷µØÃ¥å?í÷µÓ)j?í÷› É?í÷›s’º?í÷€\¼@×?í÷€W"?í÷e•ó·?í÷e—ûÆä?í÷Jݤ:?í÷JØ ïh?í÷0$Ì?í÷0yú?í÷[߸‹?í÷VEš¹?íöúš Q&?íöú”q8U?íöß×–ú?íößÑûô)?íöÅ€¨÷?íöÅæš(?íöªPÉèS?íöªK/Þ…?íöŒs÷?íö†ÙòB?íötÇ{qí?íötÁár!?íöZãY¤°?íó†8À14?íókgEÚÇ?íóka¬lO?íóP’y??íóP‰ùÍ?íó5·>ç»?íó5±¥ƒM?íóÞMU‚?íóسö?íó½* ?íòÿÿ#ϼ?íòå*^?íòå$óÅÿ?íòÊOÀ )?íòÊJ&¹Ð?íò¯tQäþ?íò¯n¸™ª?íò”˜DÚö?íò”’«”§?íòy»ši*?íòy¶'à?íò^ÞQE‚?íò^ظ ??íòDj;H?íòCúÑ ?íò)!ä²>?íò)K€?íòBÀ?íðËœÕðÄ?íðË—<ÿä?íð°µv©Z?íð°¯Ý½‚?íð•ÍLÑ=?íð•Ç³êl?íðzä¥?íðzÞè Ü?íð_û¹ž?íð_õ{ÜÝ?íðE]å?íðE n†,?íð*&[Å?íð* ÂJ?íð; ˜|?íð5sÊÔ?íïôOþX?íïôI…5¸?íïÙbÊ?íïÙ\ø€?íï¾uažE?íï¾oÈ߶?í”»Ô?íï£üN?í%bí?íŒ®q?íïmªqÙ?íïm¤}Âf?íïRºid.?íïR´Ð¹Ã?íï7Êz€?íï7Ä€Õ?íïÙ+¦†?íïÓ“.?íïçí¾?íïâRp?íîæõo?íîæïÖpÉ?íîÌŸ Å?íîËýzŠ?íî±0({?íî± —œJ?íî–!Å=?íî–‰>?íî{&sû8?íî{ Ûy?íî`1(E´?íî`+È¡?íîE;:—’?íîE5¢Š?íî*D¬l=?íî*?ù??íîMR?íîGèä ?ííôUµìö?ííôP„ ?ííÙ]Kd?ííÙW²£†?íí¾dAkr?íí¾^© ž?íí£j™2R?íí£eØŠ?ííˆpQh?ííˆj¸¾«?íímuj‰¼?íímoÒ: ?ííRyäý ?ííRtL²ù?íí7}½Äò?íí7x%W?íí€ù!?íí{`Ý’?í탗"C?íí}þæÀ?íìæ…”v?íìæü@?íìˆó÷}?íìË[Æ?íì°‡³«ü?íì°‚œ?í앇Ô^!?íì•‚<6Í?íìz‡V'6?íìz¾î?íì_†;2ž?íì_€£c?íìD„€ÖÀ?íìD~è¾’?íì)‚',ù?íì)|×?íì/¯ë?íìy—¡Ö?íëó{—¶T?íëóuÿ­L?íëØwd-á?íëØqÌ)æ?íë½r‘¼¼?íë½lù½Î?íë¢m?íë¢g‡!:?íë‡g6H?íë‡ayAt?íël`d´®?íëlZÌÄè?íëQYž&?íëQS³n?íë6Q/?íë6K—ªq?íëH§ÐT?íëCï·?íë?€xK?íë9蜼?íêå5½Ä ?íêå0%í‹?íêÊ+]»u?íêÊ%Åê?íê¯ ^f©?íê¯ÆšD?íê”ÃPü?íê”+‰¦?íêy‰Ò.?íêyòæ?íê]û²ª?íê]öFq?íêBî;þÔ?íêBè¤Fª?íê'à(d?íê'ÚÚI?íê Ñwk?íê Ëßj^?íéñÁõê~?íéñ¼^A?íéÖ±ªv©?íéÖ¬Ò»?íé» ¾VÂ?íé»›&·ã?íé 3'?íé ‰›jW?íé…}7I?íé…wo¢‰?íéjj8ø‰?íéjd¡hÙ?íéOVÎ’z?íéOQ7Ú?íé4BÁìl?íé4=*fÜ?íé./×?íé(}¯V?íèþʆ?íèþ3 “?íèãÞ—@?íèâýG á?íèÇìQ|?íèÇæº M?íè¬Õ%_L?íè¬Ïó ?í葽[¸B?íè‘·ÄQ?íèv¤ð€,?íèvŸY?íè[‹åà!?íè[†Nƒ?íè@r;ñ?íè@l¤™?íè%WòËø?íè%R[y?íè = ‰¶?íè 7s;Ý?íçï!3?íçïéê¸?íçÔXB8?íçÓÿÀþ?íç¸è‘Þ?íç¸âúŸè?íçË*?íçŒȇ?íç‚­#…p?í炧ŒPï?íçgŽ~|?íçgˆçR ?íçLo9¯?íçLi¢…3?íç1OW8?íç1IÀÏ?íç.Ö„4?íç)?cü?íæû ¶MJ?íæû2$?íæßëö¬p?íæßæ_–]?íæÄÉ™?íæÄÄ ?í橦œOÖ?íæ©¡Cè?í掂ÿ·?íæŽ}h°)?íæs^Æ'^?íæsY/%–?íæX9ìK”?íæX4UNß?íæ=tK°?íæ=ÝT?íæ!î^ðH?íæ!èÇý¹?íæÇ©“ò?íæ¦w?íåë U®ý?íå뚾ƕ?íåÐxd¹Ž?íåÐrÍÖ:?íåµOÔs?íåµJ=02?íåš&¥%Þ?íåš!L±?íå~üÙwÙ?íå~÷B£Á?íåcÒoç?íåcÌØ?ã?íåH§f ?íåH¡Ï:0?íå-{¾p ?íå-v'«Ä?íåO{+0?íåIäkh?íä÷"—€á?íä÷Æ/?íäÛõV¬?íäÛï¡?íäÀÆúX™?íäÀÁc¨?í䥘=ŸÖ?í䥒¦ôa?íäŠhåØ?íäŠcN\y?íäo8ì~¶?íäo3UÝl?íäTW™,?íäTÀü÷?íä8×% ¬?íä8ÑŽu?íä¥TC ?í䟽±?íärä¦8?íämNC?íãç?Új¸?íãç:CâÚ?íãÌ 3›×?íãÌ?íã°×í•æ?íã°ÒW4?íã•£ ¨?íã•t ?íãzmŠr7?íãzgóþ±?íã_7m†­?íã_1×=?íãD²wð?íãCû—?íã(É(ó?íã(Ѷ°?íã Ôpñ?íã ‹>Å?íâòWà=?íâòRI¨(?íâ×M£Ç?íâ×·NÉ?íâ»äõ?íâ»Þƒ³?íâ ©Eçœ?íâ £¯œÌ?íâ…mÓwn?íâ…h=1µ?íâj1À&?íâj,)Î…?íâNõ2R?íâNïxöÉ?íâ3·½ŽÔ?íâ3²'Xb?íâyË={?íât5 !?íáý;:cÃ?íáý5¤7?íááü kr?íááötDG?íáƼ:„?íáƶ£ír?íá«{ÌÒü?íá«v6¶?íá:ÀÁè?íá5*ª?íátùŠþ?íátó|x5?íáY¶Ç½w?íáY±1¯Ç?íá>sÛª„?íá>nE¡í?íá#0RƒŠ?íá#*¼€ ?íáì(÷z?íáæ’ù?íàì§a+W?íàì¡Ë2 ?íàÑaùÚl?íàÑ\cæ8?íà¶óÌ8?íà¶]Ý?íàšÕO|?íàšÏ¹/{?íàŽ Úú?íàˆuö?íàdF*Ø ?íàd@”ø>?íàHýªÌ6?íàHøñ‚?íà-´‹ÐI?íà-®õú®?íàjΫ ?íàe8Û ?íß÷ svü?íß÷Ý«–?íßÛÕxî?íßÛÏã'Ç?íßÀ‰à†Ä?íßÀ„JÅ’?íߥ=©«T?íߥ8ï=?í߉ðÔt?í߉ë>½“?íßn£`LÖ?íßnÊšô?íßSUOXL?íßSO¹«…?íß8žG”?íß8Ÿè?íß·Qør?íß±¼Uà?íßgg”?íßaÑ~?íÞæÛ¾½?íÞæF&c?íÞÊÅ´ ?íÞÊÀ}Ë?íÞ¯sï|Ú?íÞ¯nYî¶?íÞ”!‹a®?íÞ”õئ?íÞxΊ‘®?íÞxÈõ Á?íÞ]zëÉ ?íÞ]uVJ9?íÞB&¯ £?íÞB!¦ï?íÞ&Ñ×jE?íÞ&ÌAõ­?íÞ |_û?íÞ vÊ‹•?íÝð&Iš@?íÝð ´/à?íÝÔϗDz?íÝÔÊbn?íݹxGãt?íݹr²ƒM?íÝž Zr?íݞīg?íÝ‚ÇÑ?íÝ‚Â;¬'?íÝgn©ˆŠ?íÝgi7¹?íÝLã²Æ?íÝLNg?íÝ0º‚R?íÝ0´í w?íÝ_„Ñ?íÝYï™?íÜúç4o?íÜùþQø?íÜÞ§®Wd?íÜÞ¢ %?íÜÃJÙ¤°?íÜÃEDr?íܧíeÏB?íܧçТ>?íÜŒVUø?íÜŒ‰Á.?íÜq0©õÀ?íÜq+Òø?íÜUÑ.°\?íÜUË™’²?íÜ:pêe¤?íÜ:kUM?íÜõ%?íÜ rá¸?íÜ®„Ó?íܨï„?íÛèLb9Ÿ?íÛèFÍ0o?íÛÌé¡)5?íÛÌä %#?íÛ±†?b?íÛ±€ªžo?íÛ–"@eö?íÛ–«l"?íÛz½¡‘ñ?íÛz¸ m!c?íÒ«ÌG2?íÒ¦8ý?íÒuù ?íÒu f[?íÒYy‰ì ?íÒYsö¬H?íÒ=ß|—@?íÒ=Ùé\©?íÒ"DÑ Ë?íÒ"?=Ø]?íÒ©‡h ?íÒ£ô7Å?íÑë ¡Âú?íÑë—Ý?íÑÏq2N?íÑÏk‹ [?íѳÓü"@?íѳÎiw?íј6>[Ø?íј0«@8?íÑ|—ᚪ?íÑ|’N„4?íÑ`øæ£S?íÑ`óS’?íÑEYO’’?íÑES¼†p?íÑ)¹Ô–?íÑ)³ˆÍž?íÑJÕ¦?íÑ·ÓÙ?íÐòvÝZ7?íÐòqJ]•?íÐÖÔÒΕ?íÐÖÏ?×?íл2)G%?íл,–TØ?íПŽãŒc?íП‰PŸ@?íЃëbž?íЃåoz¦?íÐhFƒÞE?íÐh@ðûx?íÐL¡io©?íÐL›Ö’?íÐ0û±×L?íÐ0öþÖ?íÐU]Ùƒ?íÐOË8?íÏù®lâÒ?íÏù¨Ú²?íÏÞß ®?íÏÞLB¹?íÏÂ^³Õ?íÏÂY Q ?íϦµëÆ%?íϦ°Yˆ?íÏ‹ ˆŒ#?íÏ‹õÒ²?íÏob†Ð ?íÏo\ôÆ?íÏS·ë\á?íÏS²X­È?íÏ8 ²ð?íÏ8 F,?íÏ`Üöx?íÏ[JQ·?íÏ´l7f?íϮٗÑ?íÎå_sÚ?íÎåÌÙr?íÎÉY´Á3?íÎÉT"+ø?íέ«o’`?íέ¥ÝR?íΑü\K(?íΑöÉÀG?íÎvL‚P?íÎvFð›?íÎZœ nÁ?íÎZ–wî:?íÎ>êó[æ?íÎ>å`àŒ?íÎ#9=lÊ?íÎ#3ªöž?íΆée ?íÎVô ?íÍëÓõZ?íÍëÎbî=?íÍÐ b»?íÍÐÐT_?íÍ´l3¢Š?íÍ´f¡A?í͘·f& ?í͘±ÓÉÁ?íÍ}ù›?íÍ|üf¯‚?íÍaKða.?íÍaF^C?íÍE•Fò?íÍE´¥R?íÍ)Ýÿ8?íÍ)Øm7ª?íÍ&uQ?íÍ ‡2ñ?íÌòm—™þ?íÌòh\Í?íÌÖ´vñ?íÌÖ®ãÈï?í̺ú·oÊ?í̺õ%<ö?íÌŸ@X¥Ø?íÌŸ:Æx4?í̃…]¿O?í̃Ë–Ú?íÌgÉÄ&ë?íÌgÄ2¥?íÌL Kh?íÌLû-R?íÌ0P·îL?íÌ0K%Õe?íÌ“Gÿ?í̵lH?íËøÕ6¾?íËøϤ°?íË݉Ŗ?íËÝ÷¼>?íËÁW>«{?íËÁQ¬§S?íË¥—Uˆk?íË¥‘Ét?íˉÖÏÊâ?íˉÑ=Ñ?íËn¬4£?íËn@ ?íËRSêÝÜ?íËRNXîu?íË6‘Œ‰Ì?íË6‹úŸ–?íËÎ’¦Ã?íËÉÁ½?íÊÿ ú v?íÊÿhÀ¡?íÊãFÅ:%?íÊãA3_?íÊÇó7 ?íÊÇ|aa–?íÊ«¼„¯>?íÊ«¶òÞý?íÊövcÖ?íÊðä˜Æ?íÊt/Îp?íÊt*<ª9?íÊXhˆê?íÊXb÷)g?íÊ< £é)?íÊ<›-­?íÊ Ø$2>?íÊ Ò’{ô?íʆÀ?íÊ tÕ¨?íÉéELTÂ?íÉé?º¨Û?íÉÍz÷µ?íÉÍufZ?íɱ°¾x?íɱªsõ?íÉ•äu‰Ü?íÉ•ÞãíŒ?íÉzK… ?íÉz¹íì?íÉ^K‚g?íÉ^EðŠ{?íÉB~è?íÉBxŒ‡0?íÉ&°.?íÉ&ªŒ¦‹?íÉ áØI?íÉ ÛðUö?íÈïG*?íÈï µ­o?íÈÓBq’Ý?íÈÓ<àð?íÈ·qÿ)4?íÈ·lm¶y?íÈ› ñ[6?íÈ››_í°?íÈÏFë¸?íÈɵƒe?íÈcý ?íÈc÷o:€?íÈH*3Ê?íÈH$ÕÞ?íÈ,V¢Ã?íÈ,Qà ?íÈ‚ˆŒ?íÈ|öÅ?íÇô­Ò—¡?íÇô¨AIP?íÇØت?íÇØÒｎ?íǽ”Òÿ?íǼý?íÇ¡+ÜêŽ?íÇ¡&K«Û?íÇ…T^Ìœ?íÇ…NÍ“?íÇi|?†Y?íÇiv®R?íÇM£ƒ.µ?íÇMñÿŸ?íÇ1Ê)Ýj?íÇ1Ę³‰?íÇð2UK?íÇê¡0Ÿ?íÆúš®æ?íÆú o?íÆÞ:hU…?íÆÞ4×;C?íÆÂ^–·õ?íÆÂY¢è?íƦ‚$™f?íƦ|“‰?íÆŠ¥ ?íÆŠŸ…j?íÆnÇiÞò?íÆnÁØÙ†?íÆRé í?íÆRã¶?íÆ7 8äÒ?íÆ7§éÒ?íÆ*³¡,?íÆ%"«a?íÅÿJÀ–?íÅÿDþÐ?íÅãiÏYÈ?íÅãd>nj?íÅLjq0?íÅÇ‚àIæ?íÅ«¦t±?íÅ« ãÐ?íÅÃÛó]?ížK¢?íÅsࣚ?íÅsÛ;?íÅWüÎË?íÅW÷=ùÄ?íÅ<]9 ?íÅ<Ìlö?íÅ 3Ltü?íÅ -»®?íÅMž•L?íÅH Ó¤?íÄègU°,?íÄèaÄó»?íÄÌ€màÔ?íÄÌzÝ)›?íÄ°˜é=„?íÄ°“X‹?íÄ”°ÇÞ?íÄ”«71P?íÄxÈ Úz?íÄxÂy2ç?íÄ\Þ® „?íÄ\Ùþ)?íÄ@ô·œ&?íÄ@ï&ÿ?íÄ% "çA?íÄ%’OV?íÄ ïïà?íÄ _]-?íÃí3"ɶ?íÃí-’<;?íÃÑF¶æþ?íÃÑA&^¼?íõY¯t?íõT„j?íÙl ìâ?íÙf{o?íÃ}}Ê]·?íÃ}x9å?íÃaŽíÃZ?íÃa‰]Oû?íÃEŸsŽ>?íÃE™ã ?íÃ)¯[,›?íÃ)©Êî?íà ¾§]Ä?íà ¹ú?íÂñÍY0?íÂñÇÉ.µ?íÂÕÛo+Œ?íÂÕÕÞÒK?í¹èå©Ð?í¹ãUUÈ?íÂõÂn?íÂð2K?í‚?‘?íÂüqõý?íÂf ¥ßô?íÂf›™?íÂJ®º¢?íÂJ{?íÂ.#=Î?íÂ.Œç?íÂ,ì„v?íÂ'\OÊ?íÁö6 ùñ?íÁö0Ê€?íÁÚ>º_Þ?íÁÚ9*5§?íÁ¾F·zø?íÁ¾A'Uû?íÁ¢N Þ?íÁ¢Hˆí?íÁ†TÝÚk?íÁ†OM¿ã?íÁj[NÏ?íÁjUw9ƒ?íÁN`•‚?íÁN[qò?íÁ2e‡9?íÁ2_÷.*?íÁiÜ‹ß?íÁdL†D?íÀúm˜â?íÀúhá·?íÀÞp¹­¤?íÀÞk)²€?íÀÂs>]?íÀÂm®g6?íÀ¦tø`?íÀ¦ohoj?íÀŠuíÀT?íÀŠp]Ôã?íÀnvC1Õ?íÀnp³K ?íÀRuüC?íÀRpl:J?íÀ6uEP?íÀ6o…i“?íÀs‘m#?íÀn–£?í¿þqqS¡?í¿þká‚]?í¿ân±Á»?í¿âi!õ³?í¿ÆkV¯?í¿ÆeÆVå?í¿ªg[0š?í¿ªaËo ?í¿ŽbÅ Õ?í¿Ž]5M„?í¿r]É\?í¿rXH?í¿VW¾+Ú?í¿VR.z?í¿:QM¤ ?í¿:K½÷s?í¿J?œ?í¿D¯ô»?í¿B–''?í¿=… ?í¾æ:MeÐ?í¾æ4½Èï?í¾Ê1h½–?í¾Ê+Ù%ó?í¾®'çœè?í¾®"X ‚?í¾’ÉrG?í¾’9å ?í¾v /?í¾v }{F?í¾Z³y?í¾Z#Î?í¾=û»±Ø?í¾=ö,4k?í¾!ï'¨?í¾!é˜/â?í¾á÷³Ê?í¾Üh@Ú?í½éÔ)H£?í½éΙÚò?í½Ížya?í½ÍÀ/ï?í½±¶·]¬?í½±±'úx?í½•§ .?í½•¡„¯9?í½y–ÔŸ?í½y‘EFÛ?í½]…ù,|?í½]€iÙ?í½AtÐé?í½Anð‚³?í½%bjŸJ?í½%\ÛVR?í½ O¸]?í½ J)×?í¼í?í¹iTD›?í¹iŠÅ®U?í¹Mh™5K?í¹Mc ¤H?í¹1@@C—?í¹1:±·Ø?í¹K¹?í¹¼ù=?í¸øí¸`?í¸øè)ÞÐ?í¸ÜǤ9?í¸Ü½ù(E?í¸À˜¼¬Ä?í¸À“.6?í¸¤mSŸ»?í¸¤gÅ.P?í¸ˆAIóê?í¸ˆ;»‡Ã?í¸l¦ú»?í¸l“Ù?í¸Oçf2U?í¸Oá×з?í¸3¹…Ä?í¸3³öµk?í¸‹ñˆ?í¸…zšs?í·û[ñ@×?í·ûVbï?í·ß,;vÀ?í·ß&­*5?í·Âûêó?í·Âö\«Ñ?í·¦Êü„ñ?í·¦ÅnBð?í·Š™nóÖ?í·Š“à·?í·ngEŸl?í·na·gö?í·R4G?í·R.óä?í·6bD?í·5û‘5Z?í·Í!Xo?í·Ç“0Ê?í¶ý˜…ñ*?í¶ý’÷ÎË?í¶ácMëë?í¶á]¿ÎÒ?í¶Å-z¯ü?í¶Å'ì˜)?í¶¨÷ TÀ?í¶¨ñ~B3?í¶Œ¿þZŒ?í¶ŒºpMF?í¶pˆUp?í¶p‚Çh?í¶TP] ?í¶TJ‚ZR?í¶8.‘&?í¶8 “´?í¶ݲR?í¶Ø$#'?íµÿ£—Ì ?íµÿž Ù%?íµãhãÆ?íµãcU(?íµÇ-’„k?íµÇ(œ?íµªñ¥Ã½?íµªìà®?íµŽµ‡Ú?íµŽ¯ª?íµrw÷Ö”?íµrriþ?íµV:7€Ü?íµV4©­¤?íµ9ûÚžJ?íµ9öLÐX?íµ¼ã=d?íµ·Utº?íµ}PÍü?íµwà š?í´å=!p¼?í´å7“²£?í´ÈüVŒv?í´ÈöÈÓ¥?í´¬ºð8¶?í´¬µb…-?í´xï4“?í´sa†S?í´t6Rð?í´t0ÅG ?í´WóÛ ?í´Wí7[?í´;¯Fe½?í´;©¸ÇV?í´jØE¹?í´eJ¬›?í´%ÍM ?í´ ?¹7?í³æà'‰È?í³æÚ™û?í²¯´“gÞ?í²“m ÎD?í²“g~.?í²w4?í²w¦»6?í²Zм½?í²ZË/xœ?í²>¨ªÓ?í²>|k?í²"1øŒ†?í²",kR›?í²á©5o?í²ÜÐ?í±é¼²n?í±é‹/ƒ?í±Í?4i?í±Í9§>ú?í±°íÉ3?í±°ç‚¤v?í±”šLôÖ?í±””¿Õd?í±xF?í±xAa…y?í±[òòD_?í±[íe/„?í±?žYïœ?í±?˜Ìà ?í±#I%u?í±#C˜2?í±óU2?í±íÈ ;?í°êœæ¼é?í°ê—Y½??í°ÎEÞî?í°Î@Q!?í°±î7Yz?í°±èªdh?í°••òŒð?í°•e+?í°y=^E?í°y7‡sÍ?í°\ã˜úú?í°\Þ Ï?í°@‰È,?í°@ƒôèM?í°$.Î62?í°$)A[¡?í°Ó~\V?í°Íñ‡?í¯ëw‘«?í¯ërÛ ?í¯Ï .?í¯Ï}cd?í¯²½åa]?í¯²¸Xœ?í¯–`$©ë?í¯–Z—éÜ?í¯zÇx6?í¯yü:½t?í¯]¢Ð~ª?í¯]CÉ7?í¯AC;E?í¯A=®”ô?í¯$ã r.?í¯$ÝÇW?í¯‚@Ûh?í¯|´5ß?í®ì ؘ)?í®ìK÷î?í®Ï¾×§ø?í®Ï¹K ?í®³\7Ÿ%?í®³V« ‡?í®–øü}6?í®–óoìæ?í®z•)š®?í®z­?í®^0¹2î?í®^+,­?í¥“"IK?í¥w _Ý?í¥wÔCB?í¥Zwx1¢?í¥Zqí[_?í¥=àö‰Î?í¥=Ûk¸ã?í¥!IÛ‰?í¥!DP½ƒ?í¥²%Và?í¥¬š¦?í¤èÔ¯§?í¤èIîÅ?í¤Ë€ì?p?í¤Ë{aƒç?í¤®çhãQ?í¤®áÞ- ?í¤’MKW´?í¤’GÀ¦Ü?í¤u²“³Í?í¤u­ O?í¤Yºb?í¤YŠ=?í¤¯(?í£9$¼¸?í£›¸•¿?í£–./Ñ?í¢äø$‘?í¢äòš0p?í¢ÈSöi_?í¢ÈNl&?í¢«¯+¡ê?í¢«©¡L ?í¢ Äöm?í¢:¥é?í¢rcÃÇ~?í¢r^9|V?í¢U½$óŸ?í¢U·š­Ò?í¢9ìnÕ?í¢9b.d?í¢n¸?í¢hŒÜ¢?í¡ÿŦó©?í¡ÿÀ½ï?í¡ã›t§?í¡ãDH?í¡ÆrõVW?í¡Æmk+T?í¡©È³f?í¡©Ã)@]?í¡Ôq?í¡JPÏ?í¡pr[Æ3?í¡plÑ«D?í¡SÆH2¨?í¡SÀ¾?í¡7—ßF?í¡7 Ï?í¡lN¿?í¡fÄ´:?í ý¾i±}?í ý¸ß«ÿ?í áér?í á _qö?í Ä`ÎÌ?í Ä[D?í §±^?í §«Žh¶?í ‹Ç·L?í Šû=ÇB?í nO݃h?í nJS˜»?í QžWë‘?í Q˜ÎA?í 4ì6b,?í 4欂9?í 9|4Þ?í 3òZI?íŸû†&CÚ?íŸû€œn£?íŸÞÒ5Jœ?íŸÞÌ«zÂ?íŸÂ©`?íŸÂ•ž?ퟥhƒ?º?ퟥbùzœ?퟈²Ãf?퟈­9@¦?íŸküh¸þ?íŸköÞþœ?íŸOEsÜ?íŸO?ê'?íŸ2ãÜ ?íŸ2ˆZ,e?íŸÕ»aˆ?íŸÐ1·A?ížù÷ñÞ?ížùnLö?ížÜcšHd?ížÜ^¨Û?íž¿©¢| ?íž¿¤áá?힢ïH?힢釳N?힆3ä2B?힆.Z¢Õ?ížixÏ?ížir–E?ížL»¿¸ð?ížL¶64B?íž/þÆ–v?íž/ù='?ížA2’X?íž;©h?íöƒ ?íö}{—|?íÙÄ?bì?íÙ¾µó¼?í½Þxæ?í¼ÿU?í Då™é?í ?\5y?탄O»›?íƒ~Æ\Œ?ífÃ#^Ž?íf½šß?íJ[x’?íIûÒ$C?í->ÍØe?í-9D‰v?í{~G?íuô»¹?íœó·“}¾?íœó² 9?íœÖó $?íœÖíå3?휺-èC?휺(_ ™?íœh(a0?íœbŸ-%?휀¡Î%A?휀œDö—?íœcÚØ]¹?íœcÕO4p?íœGEÙ??íœG ¼µX?íœ*Köq?íœ*EŽ×ë?íœ ‚N'ù?íœ |ÅÕ?í›ð¸è„y?í›ð³_p·?í›Óîç"˜?í›Óé^7?í›·$K`Ì?í›·ÂWÎ?훚Yi÷?훚SŠfZ?í›}?ø°?í›}‡¶úu?í›`ÀÑÇn?í›`»HΖ?í›CóÈìÏ?í›Cî?ùY?í›'&"LX?í›' ™^D?í› Wâwv?í› RYŽÆ?íší‰õŒ?íšíƒ~>?íšÐ¹ÝH?íšÐ´ÿ]?íš³é€x ?íš³ã÷Ÿ˜?íš—Ó¾¦?íš—Jë?íšzGŒV?íšzBˆÍ?íš]u¬A ?íš]p#yA?íš@£0cå?íš@§ ê?íš#ÐŒË?íš#ÊŽÏ3?íšüe©?íšöÜðÝ?í™ê(ä\?í™ê"1‹?í™ÍS1øü?í™ÍM©K?í™°}¯¶c?í™°x'[?홓§’Öà?홓¢ 4kÒ?í–ÞÚ¶J²?í–Áû‘|?í–Áõ‘uÃ?í–¥\hÌ?í–¥ÔRz?í–ˆ/Â#?í–ˆ)}±8?í–kH'Á?í–kB‹>?í–N`‰&w?í–N[ [?í–1xeH?í–1rÝGÊ?í–¨êÚ?í–Š ï?í•÷¦'"Z?í•÷ Ÿ,u?í•Ú»ã]c?í•Ú¶[lå?핽ÑÕ¦?핽Ëzê?í• åŠÚ?í• à1,?핃ùtÂ?핃óìáË?í•g ÂJÀ?í•g:oâ?í•JuSj?í•Jí}õ?í•-1ò`?í•-,"S?í•C A?í•=Dž?í”óSë5+?í”óNcoð?í”Öd0¨Þ?í”Ö^¨é ?픹sÚƱ?픹nS H?픜‚ì0¡?픜}d{¢?픑`ˆÙ?픋ØÙB?í”bŸ9+¤?í”b™±w?í”E¬x?í”E¦ðs–2?í“—é·é?í“zøAÌl?í“zòºMŽ?í“^«\Ò?í“]û#ã^?í“Ayu®?í“Aò¤?í“$®“?í“$ &¦ô?í“E‚î?퓾¹?í’êDéš?í’ê½…Ð?í’Í!©Õ]?í’Í"vþ?í’°&rtØ?í’° ëä?í’“*¢®N?í’“%ZÅ?í’v.8 ¼?í’v(°¿Ÿ?í’Y13L:?í’Y+¬ˆ?í’<3•"Ø?í’<. ß’?í’5]¨?í’/Öj)?í’6‹­$?í’1tµ?í‘å7HÄ?í‘å1˜Á?í‘È7‘k?í‘È1‘cÓ?í‘«6w¡?í‘«0ðuv?í‘Ž5? Å?í‘Ž/·ë?í‘q3kËú?í‘q-䮧?í‘T0ýLh?í‘T+v4?í‘7-õŒæ?í‘7(nzk?í‘*S_2?í‘$ÌR$?íý&cZ?íý ’[¹?íà!Eȱ?íà¾Æ}?íÃØ¥¼?íÃQ¨õ?í¦ÐÌ`?í¦IÕ?í‰0:,?í‰ ©H??ílõÁ?ílnÔ‡?íO"Æ?íNú›2³?í1÷µZù?í1ò.yT?íî°=f?íé)a/?í÷åNš?í÷߉wÑ?íÚÚ׋è?íÚÕPº?í½Ð Ü?í½Ê?ï?í Äš ›?í ¿Ú?탸—GJ?탳†8?íf«ût>?íf¦t¸›?íIžÅW•?íI™>¡`?í,øÔ¶?í,‹r#ð?í‚ñ-?í} EÕ?íŽòs‘H?íŽòn ê_?íŽÕcûj•?íŽÕ^tÊ?편SžA¤?편N¦™?펛B€–?펛<úg?íŽ~0ÇëŠ?íŽ~+A[]?íŽatús?íŽaîoµ?íŽD „ à?íŽDý‡’?íŽ&÷û?íŽ&òu EãªÓ?í>@]Vu?í!,èÃ…?í!'bt˜?íS\Y?í ÍÝ?íŒæù"éÃ?íŒæ󜥷?íŒÉÞZ 9?íŒÉØÓÊž?팬Âôd_?팬½n+6?팦õ:s?팡o»?íŒrŠ[ÿì?íŒr„ÕÑ¥?íŒUm'‡?íŒUg¡^º?íŒ8OX‰h?íŒ8IÒf?íŒ0ñÝ?íŒ+jâê?í‹þï?í‹þ iƒ?í‹àòQ¶Î?í‹àìË£¿?í‹ÃÒJ8?í‹ÃÌ—<›?틦±MƒÎ?틦«Ç{£?틉âyù?틉Š\w@?í‹lmÞÉ…?í‹lhXÌ??í‹OK@F?í‹OEº r?í‹2(X?í‹2"‚,ö?í‹8z?í‹þ²*?íŠ÷ßËzÄ?íŠ÷ÚE“G?íŠÚºÅ?íŠÚµ??튽•'©r?튽¡ÌÛ?튠nïf?튠iiHB?튃H]Ú?튃B—Œ*?íŠf ³‹?íŠf-PN?íŠHø­Jw?íŠHó'ƒ®?íŠ+Ð%C?íŠ+ʉcí?튦׀X?튡QÄv?í‰ñ}´×?í‰ñwþi?í‰ÔRSp?í‰ÔM¢u?퉷'šø ?퉷"L†?퉙ûþ3€?퉙öxm?í‰|ÏǽŒ?í‰|ÊBí?í‰_¢ù‹?í‰_sõa?í‰Buœ.?í‰Bp y?í‰%Ge?í‰%B #?í‰÷‰%?í‰qþX?íˆêéÄp®?íˆêä>ëV?íˆÍ¹ùop?íˆÍ´sï?툰‰–›¶?툰„!G?툓X˜å¸?툓Sp¿?íˆv'‰ö?íˆv!~r?íˆXôÕ\[?íˆXïOòM?íˆ;Âr?íˆ;¼‰¯Ù?툎®C÷?툉(äÓ?íˆZ¸ ‚?íˆU2°Ô?í‡ä&(`?í‡ä ¢Â(?í‡Æðþ~?í‡Æëy/E?퇩»<š'?퇩µ·PÛ?퇌„ã"'?퇌]ÞQ?í‡oMÄ8û?í‡oH>ú›?í‡RæB?í‡Ra -?í‡4Ýl†'?í‡4×çR´?퇤XþP?퇞ÓÐT?í†új«À„?í†úe&—þ?í†Ý0bÿÇ?í†Ý*Ýܸ?톿õs%?톿ïúU?톢ºÑŸ?톢´|¹~?톅}ê15?톅xe‹?í†hA8ü?í†h;²ùÉ?í†KìªÎ?í†Jþg£?í†-Ư?í†-À€¬Ê?톇ƒ)ã?í†þ-?í…óHhU¸?í…óBã^d?í…Ö²Å?í…Ö-Ó=?í…¸ÈaíG?í…¸ÂÝâ?í…›‡w&?í…›ò??í…~Eó&.?í…~@nD¹?í…aÔÂ*?í…`þOæ-?í…CÁ°Ú?í…C»—ÚV?í…&}Ë©?í…&xF×ý?í… 9ßÞ~?í… 4[ë?í„ëõZ¨Ò?í„ëïÕâ¸?í„ΰ;}V?í„Ϊ¶¼µ?턱j‚r(?턱dý·?í„”$0>?í„”«ˆS?í„vÝDöö?í„v×ÀFÀ?í„Y•¾Ñ ?í„Y:&c?í„vØ?íƒQ÷¨¢?íƒQñŒ/.?íƒ4©ÚR?íƒ4¤ fX?íƒ[qÁ$?íƒUíR¥?í‚ú º‘×?í‚ú6(Ò?í‚ܽl%Q?í‚Ü·çÁÈ?í‚¿m…P½?í‚¿hò®?í‚¢Hö?í‚¢ðb?í‚„Ëë`?í‚„Æf²G?í‚gz8[S?í‚gt´ µ?í‚J'ì`ý?í‚J"hÛ?í‚,Õm;?í‚,Ï„*”?í‚‹U|?í‚|Q?íò-uÐ7ýH?í} 8´¬H?í}Ð:û?í}Ê”ï{?í|åa^(Î?í|å[ÚâÏ?í|Çò ܼ?í|Ç솜>?í|ª‚K˜?í|ª|šš?í|—ë ?í| ¶$?í|o x“‘?í|ošõc–?í|R.Á8?í|R)> ›?í|4¼qO~?í|4¶î*…?í|IˆP"?í|D0ª?í{ùÖïz?í{ùЃՄ?í{Üaíâä?í{Ü\jÎp?í{¾í8ãÚ?í{¾çµÔè?í{¡wí£¹?í{¡rjšH?í{„ ?í{ƒü†?í{f‹‹_¯?í{f†aB?í{IuÆ•?í{Iòͪ?í{+œÈe”?í{+—Er,?í{$‚Í?í{ÿ%ç?íz𫣆•?íz𦠞2?ízÓ2,4„?ízÓ,©Q¤?ízµ¸Òê?ízµ²™õŒ?íz˜=v?íz˜7ó?3?ízzÂ6Ø.?ízz¼´Ö?íz]F]í°?íz]@Û Û?íz?ÉîŠ?íz?Äk¿?íz"Lå¦Ì?íz"Gbäý?ízÏE7¼?ízÉÂ{q?íyçQ u?íyçKˆ¾P?íyÉÒ:Rš?íyÉÌ·¡V?íy¬RÑæ5?íy¬MO:u?íyŽÒѦ¤?íyŽÍOh?íyqR:I?íyqL·¨U?íySÑ f¿?íySˆˊ?íy6OCoÚ?íy6IÀÚ*?íyÌã?íyÇ`ðò?íxûIíkd?íxûDjà¼?íxÝÆ^È,?íxÝÀÜC ?íxÀBf?íxÀ<‹æÿ?íx¢¼þ·T?íx¢·|=;?íx…7UvÜ?íx…1ÓH?íxg±Å?íxg«¬¶?íxJ*5ZÀ?íxJ$²ñ6?íx,¢¿Ih?íx,<åb?íx®¿\?íx,`Ü?íwñ’K?íwñŒ‚·P?íwÔÂQÌ?íwÔ?þW?íw¶~ä¼¥?íw¶ybn¶?íw˜ônCd?íw˜îëúû?íw{i^\·?íw{cÜÔ?íw]ݳàu?íw]Ø1£?íw@Qnäd?íw@Kì¬?íw"Ä“Öf?íw"¿¤?íw7sÜ?íw1œG?ívç©q`?ívç£J?ívÊfä¤?ívÊäÂæ?ív¬‹$ã`?ív¬…¢Ç)?ívŽûJ"?ívŽõÈ `?ívqjÖ¶_?ívqeT¥6?ívSÙÊ,?ívSÔH Š?ív6H"}ë?ív6B wÐ?ívµäö]?ív°bõÉ?íuû#|W?íuûŒK?íuÝè$?íuÝŠòŸ?íu¿û“î@?íu¿öþC?íu¢fð¤h?íu¢an¹ó?íu„Ñ´ `?íu„Ì2;r?íug;àSÒ?íug6^tl?íuI¥t?íuIŸò==?íu,oé?íu,í«”?íuvÒV?íuqP6‰?ítðÞœ[»?ítðÙ’w?ítÓEÍ[ ?ítÓ@K—ä?ítµ¬fWî?ítµ¦ä™º?ít˜eŠ¸?ít˜ ãÒ?ítzwÌåh?ítzrK2F?ít\Üœ}±?ít\×Ð?ít?@ÓÊÆ?ít?;R"¶?ít!¤râd?ít!žñ?Ý?ítyÚH?ítø=K?ísæiéf¨?ísædgÏ4?ísÈË¿Áâ?ísÈÆ>/÷?ís«,þÝ?ís«'}P±?ís¦/‚?ísˆ$¨ª?ísoíµ0ˆ?ísoè3¯:?ísRM,”R?ísRG«Ž?ís4¬ Ò@?ís4¦Š\?ís RaÂ?ísÐñ?írùh•V?írùb€*1?írÛÅ! ?írÛ¿˜»o?ír¾!šÝö?ír¾}å?ír }ƒáã?ír x‡^?ír‚ØÕB™?ír‚ÓSíž?íre3Ùd?íre. ‰ô?írG°5?írGˆ.ë-?ír)ç:­?ír)á¹LR?ír @-?ír :«Ã9?íqyŠ?íqî“@G?íqÐðNЋ?íqÐêÍœÒ?íq³G{à‚?íq³Aú²U?íq•ž™¼?íq•˜‘q?íqwô™r?íqwîv\?íqZIM½ä?íqZCÌ Z?íq<ÍžŒ?íq<˜L†Ž?íqñ´cþ?íqì3QŒ?íqDÿ«U?íq?~žp?íp㗳ܜ?ípã’2ÕB?ípÅéÍöâ?ípÅäLõ?íp¨;N§?íp¨5Íg?ípŠŒ5x{?ípŠ†´Ç?íplÜ‚lÈ?ípl×{¡?ípO,6>?ípO&µR}?íp1{RÛÉ?íp1uÑõ¼?ípÉÔ§s?ípÄSÆô?íoö½ˆ?íoö<µ•?íoØe ?íoØ_Œ9*?íoº±ÅÈ?íoº¬D@ð?íoœýâ—?íoœøaÌÎ?íoIjC?íoCéC†?íoa”W(…?íoaŽÖiV?íoCÞª«L?íoCÙ)ñ«?ío&(f°?ío&"åË?íoqŠE?íol nÀ?ínêºÀ?ínê´“$?ín͹^?ínÌü„ö?ín¯I]?ín¯CÜ€µ?ín‘@º?ín‘Š¨o?ínsÖE¾N?ínsÐÅ+‘?ínVÖ#Î?ínVU– ?ín8`ÍÉ?ín8[Lˆ*?ín¥,pô?ínŸ«îä?ímüèó¿?ímüãsB˜?ímß,!6¯?ímß& ¿¾?ímÁn¸ª?ímÁi7H?ím£°µ!9?ím£«4µf?ím…òƒè?ím…욤?ímh2è?8?ímh-gÞ…?ímJsË?ímJmoê?ím,²»<ü?ím,­:çh?ímñÁå®?ímìA•ª?ílñ0/dh?ílñ*¯ô?ílÓnÎÎ?ílÓhƒ‰ê?ílµ«BN?ílµ¥ÂÈ?íl—çé:?íl—âhåw?ílz#÷º7?ílzw†?íl\_nÒ'?íl\Y?íl>šMß ?íl>”Ͷ?íl Ô“»Ö?íl ϘW?ílD.Œ?ílÄ?íkåG\×?íkåAܾ§?íkÇÜ ?íkÇz\}??ík©·Ç?ík©²Ga?ík‹ïêì?ík‹é˜ãB?íkn%Ô}?íkn Tzú?íkP[ùN=?íkPVyQ·?ík2‘…›ú?ík2Œ¥?íkÆzK?íkÀú'è?íjöúÙPÿ?íjöõYe.?íjÙ. F'?íjÙ) _è?íj»aÐHø?íj»\PhL?íj”hÑÊ?íjŽèö¯?íjÆj“z?íjÀê½ò?íja÷Õ££?íjaòUÓ­?íjD(«ïy?íjD#,%?íj&Xé@?íj&Si{J?íjˆ ?íjƒ`Ä?íiê·we?íiê±÷J»?íiÌå ÐÂ?íiÌà!«?íi¯0»¸?íi¯ ± 5?íi‘@'wÀ?íi‘:§ÎÏ?íisl…·8?íisgÛ?íiU˜I¸?íiU’ÊN?íi7Ãw>4?íi7½÷¥ÿ?íiî °F?íi苤?íhü]Í?íhü…п?íhÞAg\?íhÞ;çÔ?íhÀj0À@?íhÀd±>[?íh¢’_ÈÀ?íh¢ŒàLo?íh„¹÷›ß?íh„´x%#?íhfàöwâ?íhfÛw¹?íhI[Õ'?íhIÜi“?íh+-)Ÿâ?íh+'ª9ã?íh R^³w?íh LßS ?ígïvûÂ?ígïq|gF?ígÑ›á?ígÑ•‹Ú?íg³¾mˆÚ?íg³¸î9/?íg•á?ø?íg•ÛÀ­ú?ígx{ñP?ígwýü¬Ð?ígZ%r?ígZŸ×‡?íg‡?íaÁÝMŽ?ía¼_&c?íacÅ$?íac¿‡ü•?íaEÇ–*l?íaEÂx?ía'É[·?ía'ÄE^?ía Êïòæ?ía Åqâ)?í`ë˶Í?í`ëÆ8Áí?í`ÍËèC…?í`ÍÆj=ÿ?í`¯Ë€'2?í`¯Æ'H?í`‘Ê)P?í`‘Å/?í`sÈæ–û?í`sÃh¢I?í`Uƶ…O?í`UÁ8–9?í`7Ã왜?í`7¾n°"?í`ÀÈ?í`»ä³?í_û¼•ã·?í_û·w?í_ݸdg?í_ݲ†‹Ã?í_¿²Ý-?í_¿­_4&?í_¡­ n?í_¡§ @?í_ƒ¦Æðv?í_ƒ¡I(©?í_eŸØý ?í_eš[:ð?í_G˜SÞ?í_G’ÕTK?í_)2Ñ ?í_)Šµª?í_ ‡}Îç?í_ ‚?í^í~2JR?í^íx´ž—?í^ÏtL²c?í^ÏnÏ F?í^±iÑút?í^±dTYô?í^“^¿,Ø?í^“YA‘ö?í^uS^Ê?í^uM–Ɇ?í^WFÓxž?í^WAUèù?í^99ú¼\?í^94}2U?í^,Š?8?í^' ºÏ?í]ýƒMÀ?í]ýÎõ?í]ßåar?í]ß gèF?í]Á°x?í]Àû3ê?í]¢ðæ$:?í]¢ëh¶L?í]„à‚5?í]„Û&å?í]fψT?í]fÊ ñm?í]H½ø#°?í]H¸zÆž?í]*«ÐÛò?í]*¦S„€?í] ™ö?í] “”¤½?í\î…½öë?í\î€@ª·?í\ÐqÑM?í\ÐlTo?í\²]N|3?í\²WÑ;>?í\”H65"?í\”B¸ùÍ?í\v2†ºˆ?í\v- „Ó?í\X@!¦?í\XÂñ‘?í\:dR?í\9ÿç'¡?í\íòʼn?í\èu ´?í[ýÕé#ˆ?í[ýÐlS?í[ß½KÁ0?í[߷Χœ?í[Á¤D?í[Áž™ûP?í[£ŠLYË?í[£„ÏKw?í[…oë¶?í[…jn­N?í[gTôm?í[gOvÿ[?í[I9g&R?í[I3ê(á?í[+DC?í[+Çs?í[ Š¥?í[ û ³P?íZîã3í?íZîÝ”G`?íZÐÄÜÑÛ?íZп_êï?íZ²¦,?íZ² “.â?íZ”†ªh?íZ”-Œæ?íZvf­Á¤?íZva0ë?íZXF• ?íZX@œÄ¤?íZ:$ëŠØ?íZ:nÀ?íZ&À?íZý©úá?íYýàÈܲ?íYýÛL3?íYß½Ñõç?íY߸U< ?íYÁšD/?íYÁ”ÇØõ?íY£v?íY£p¢Ò†?íY…QaJ?íY…KälU?íYg,7?íYg&‘”-?íYI"#Î?íYI¥†?íY*ßœï@?íY*Ú W4?íY ¸?íY ³ˆª?íXîÎ! ?íXî‹Q”Z?íXÐh‚E>?íXÐc¾?íX²? £?íX²:$"?íX”'À?íX”«å?íXuì?íXu昧Ê?íXWÁm5$?íXW»ðÄ?íX9–,8H?íX9¯ÍW?íXjUC0?íXdØÝã?íWý=æ™ö?íWý8j:N?íWßàQš?íWß c÷–?íWÀãB?íWÀÝÆ*¼?íW¢µ¢ù?íW¢¯“T>?íW„†D˸?íW„€È‚¡?íWfVâb?íWfQeÊð?íWH&éPƒ?íWH!m¶?íW)öYq\?íW)ðÝ94?íW Å1PR?íW ¿µÏ?íVí“sm¤?íVí÷@Æ?íVÏa¨ª?íVÏ[¢q?íV±.3±*?íV±(·–?íV’ú²œ?íV’õ6€#?íVtÆ™l?íVtÁý#?íVV‘ê1ì?íVVŒn!H?íV8\¤?íT9Q 0?íT3Õgì?íSùøç:?íSùókšõ?íSÛ·åŽÌ?íSÛ²iôØ?íS½vO#?íS½pÓŽÂ?íSŸ4#qó?íSŸ.§ãP?íS€ñaö"?íS€ëæm&?íSb­âq“?íSb¨fî@?íSDi¨½®?íSDd-@?íS&$Ö_?íS&[]?íSßm?íSÙñ¶?íRé™j…‡?íRé“ï×?íRËRϾä?íRËMTWÜ?íR­ ž¿?íR­#.a?íRŽÃÕØ5?íRŽ¾Z|€?íRp{tx?íRpuù"ƒ?íRR2|î?íRR-ž?íR3èìK¥?íR3ãqì?íRžÅ§Ò?íR™JbÃ?íQ÷T®ö?íQ÷N‹o‘?íQÙ°ª6?íQÙ5pz?íQº¼Âyÿ?íQº·GEî?íQœp>›²?íQœjÃmK?íQ~#"!W?íQ~¦øš?íQ_Õoˆ8?íQ_Ïôe%?íQA‡%¾?íQA©ùV?íQ#8C{Î?íQ#2Èd?íQèËfB?íQãPT/?íP昻ª?íPæ“@B?íPÈH¶?íPÈBš¯V?íP©ö׫?íP©ñ\©î?íP‹¥¬e?íP‹Ÿ‰°þ?íPmRšfí?íPmMq0?íPNÿ—!r?íPNú1a?íP0«þŒ¼?íP0¦ƒ¢V?íPWω?íPRT¤Ó?íOôøÊ?íOóýŽ¼?íOÕ­¬½?íOÕ¨1ã¶?íO·W¹·\?íO·R>ã¥?íO™/üh?íO˜ûµ.^?íOzª:ð?íOz¤•r’?íO\RYSù?íO\LÞ‘G?íO=ú \a?íO=ôŸ[?íO¡(Ðb?íO›®?íOG®Ãƒ?íOB4Ö?íNâíŸ?íNâè$l?íNÄ’ùI,?íNÄ~¢Ø?íN¦7¼Ñ´?íN¦2B1 ?íN‡ÛéÆ?íN‡Öo+–?íNi€Ö^?íNizA?íNK"‚ì?íNK†L?íN,ÄíR?íN,¿rv_?íNfÃwˆ?íNaHóC?íMðÒ?íMðˆ:?íMѨª÷Ê?íMÑ£0~ß?íM³H¾‘X?íM³CD?íM”è<×›?íM”âÂj ?íMv‡#xÓ?íMv©ò?íMX%uŠ?íMXû'å?íM9Ã3¹Ï?íM9½¹]J?íM`Yé‚?íMZß’¬?íLüüìaJ?íLü÷r"?íLÞ˜èÏœ?íLÞ“n„"?íLÀ4N¯Í?íLÀ.Ôj?íL¡ÏIã?íL¡É¥ Ç?íLƒiZ0?íLƒcßÞÃ?íLeÿ!?íLdý†Êb?íLFœCü?íLF–˜í?íL(4ü¨?íL(/ÓH?íL Ìt>?íL ÆúV?íKëcÇ‚Í?íKë^MdÌ?íKÌú[-Â?íKÌôáp?íK®45s?íK®Šº"Ñ?íK%w‡2?íKýz??íKqº"8k?íKq´¨1(?íKSN4÷%?íKSHºõ’?íK4á± ¼?íK4Ü7Ù?íKt•îT?íKoø!?íJøã(?íJøi,¥?íJÙ˜›#?íJÙ“!&Q?íJ»)»yk?íJ»$A”I?íJœºC8?íJœ´ÉX”?íJ~J4ÆÆ?íJ~Dºí?íJ_Ù¢?íJ_Ô3“?íJAhR5?íJAbØ@×?íJ"ö$–?íJ"ñ[è?íJ„)Ð?íJ~›fÔ?íIæ?íIæ ™CÇ?íIÇ{½ ?íIǘo?íI©)N?Î?íI©#Ôæ?íIŠ´ˆÒl?íIŠ¯&5?íIl?.‡\?íIl9´à×?íIMÉ;Ü6?íIMÃÂ;c?íI/R³J:?íI/M9¯?íIÛ”åù?íIÖPŠ?íHòcÞø°?íHò^ehó?íHÓë‘— ?íHÓæ ?íHµr°l,?íHµm6çÔ?íH–ù6*ø?íH–ó¼¬R?íHx'°˜?íHxy®7¥?íHZ{T?íHYÿ?íH;‰Fõ?íH;ƒÌ–h?íH tÆ ?íHû^2?íGþ‘ =/?íGþ‹“Û?íGàå ?íGà•ˆ”?íGÁ–yÒJ?íGÁ‘{‰?íG£P}e?íG£×,W?íG„™eF?íG„”ì?íGf9›I?íGfÀU¢?íGGšN(?íGG”ÔÂ5?íG)̤?íG)RÛe?íG ˜´ƒI?íG “;N¾?íFìø–?íFìŽÉ¿?íF͔Ŀš?íFÍK–w?íF¯ì·‰?íF¯ s”?íFŽ~ÃZ?íF‰¥ ?íFr z÷¸?íFrß²?íFS…â?íFS€hïË?íF5³÷$?íF4û:ê‡?íFzðR²?íFuwKÊ?íE÷ô–´?íE÷ï?íEÙm¨?íEÙh/”–?íEºæ$›>?íEºà«¥u?íEœ^ Æê?íEœX‘Ö×?íE}Õ\Y0?íE}ÏãnÒ?íE_L5Z?íE_FŸP±?íE@Â?È?íE@¼Æ)Õ?íE"7Òp?íE"2Y@2?íE¬Ï`?íE§VEÙ?íDå!6Z?íDå½Oˆ?íDÆ• ò?íDÆ;Ö?íD¨Fþ?íD¨ÍU˜?íD‰zîŸl?íD‰uuâ½?íDjí®æ?íDjç‰÷í?íDL^‰?íDLY F?íD-ÏCÛ„?íD-ÉË/÷?íD?Nq}?íD9Õ˨?íCð®ÀÀ2?íCð©H ?íCÒœ ?íCÒ#r¸?íC³‹áŸ?íC³†iî?íC”ùU ?íC”ôÆ?íCvf§Ý?íCva.›?íCWÓ'ÀÞ?íCWͯ=S?íC9?6Ž?íC99˜¸º?íCªd$À?íC¤ë¬¤?íBü ŸÙ?íBü¨-t?íBÝF#Ù?íBÝyÍ·,?íB¾èÔ,Í?íB¾ã[ÅØ?íB QËÿß?íB LSž¢?íBº.â%?íB´¶† ?íBc!ùUò?íBc&?íBD‰.ib?íBDƒ¶N?íB%ïÍ4?íB%êTµØ?íBUÔ–ˆ?íBP\Qå?íAè»G «?íAèµÎÊÀ?íAÊ "¥*?íAʪkù?íA«„h¼?íA«~ïâC?íAŒè8z?íAŒâ¡ º?íAnK2h?íAnEºhb?íAO­µbv?íAO¨=@(?íA1¢ó?íA1 *Öë?íApú'†?íAk‚¬?í@óÑ»«*?í@óÌCš ?í@Õ1é[J?í@Õ,qOã?í@¶‘»d?í@¶Œµ·?í@—ðx%?í@—ëx2?í@yNè¦ ?í@yIp«Ð?í@Z¬¾R?í@Z§F]ˆ?í@< ûÏÏ?í@<ƒá ?í@f¦Œ?í@a.£‚?í?þºt,?í?þ½BÜ?í?à7›:?í?࿽¤?í?Áy!V?í?Ás©6z?í?¢ÓuÖ?í?¢ÍýGµ?í?„-1r7?í?„'¹¥Ñ?í?e†Zëê?í?e€ã%??í?FÞî£f?í?FÙvâv?í?(6ì:?í?(1tZ?í? ŽUµ±?í? ˆÞ8?í>êå)9v?í>êß±‰¹?í>Ì;gLÿ?í>Ì5ï¢ý?í>­‘4”?í>­‹™N?í>Žæ$¥?í>Žà­”?í>p:£zÃ?í>p5+áô?í>QŽÉü?í>Q‰6é?í>2ááß¼?í>2ÜjRe?í>4¡˜?í>/*s?í=õ†ÍŸ6?í=õVX?í=ÖØdB9?í=ÖÒìÆ?í=¸)dýÝ?í=¸#í‡w?í=™yÒ݉?í=™t[là?í=zɪþØ?í=zÄ3“ì?í=\ív`?í=\v0?í==gž~Æ?í==b'S?í=µ¸?Ö°?í6&pBVx?í6&jÌJT?í6›¥XR?í6–/Qò?í5èÆsƒÁ?í5èÀýƒ$?í5Éð­ƒý?í5Éë7‰$?í5«SmW?í5«ÝxC?í5ŒCd&y?í5Œ=î7)?í5mkáˆ=?í5mfkž±?í5N“Ì=¿?í5NŽVY÷?í5/»!i;?í5/µ«‹7?í5ááµð?í5ÜkÝ°?í4ò*?í4òšW¢?í4Ó-|"?í4Ó( ¯k?í4´R;‹—?í4´LÅÄ¥?í4•va²Ë?í4•pëñŸ?í4v™ïæ•?í4v”z+-?í4W¼çh?í4W·q²ê?í48ßJ§…?í48ÙÔ÷§?í4óe?í4û¢IL?í3û"Mœ:?í3û×÷è?í3ÜBî§f?í3Ü=yÙ?í3½bùe?í3½]ƒÌ:?í3ž‚mR|?í3ž|÷¿{?í3¡N ?í3›Ø~a?í3`¿—†?í3`º!þ ?í3AÝJl®?í3A×Ôêÿ?í3"úiÄS?í3"ôôHi?í3òž?í3|£z?í2å2ä­Ñ?í2å-o=t?í2ÆNB+„?í2ÆHÌÀî?í2§i ¦À?í2§c•Að?í2ˆƒ=?í2ˆ}ǧ‡?í2iœÚŒ ?í2i—e2Ê?í2Jµàñ\?í2J°ká?í2+ÎR?í2+ÈÜÀ]?í2 æ0P?í2 à»?í1íýxD‰?í1íøc?í1Ï+,¡?í1ϵðC?í1°*JI/?í1°$Õ˜?í1‘?ÓTŸ?í1‘:^#Ð?í1rTÆùz?í1rOQÎr?í1Si%Kâ?í1Sc°&£?í14|?í14wzm+?í1$ È?í1Š®ó?í0ö¢ÃvÈ?í0öNbá?í0×´Îu?í0ׯYfó?í0¸ÆCï!?í0¸ÀÎæÊ?í0™×&R;?í0™Ñ±O­?í0zçrà ?í0záýÆF?í0[÷+®Â?í0[ñ¶·Å?í0=Oüô?í0=Û À?í0ß+~?í0j@?í/ÿ"ظX?í/ÿcÒ¶?í/à0>zF?í/à*Éšm?í/Á=Xþ?í/Á7š~î?í/¢IKþÕ?í/¢C×*Ž?í/ƒTõ?í/ƒO€G‘?í/d`ðL?í/dZ”'™?í/EjˆÎ?í/Ee ?í/&tuYq?í/&oœQ?í/}ÌN²ë²?í,>­w€ ?í,®+©?í,¨›ÿa?í,¨¡`?í,£,îå?í+ᢛ–E?í+á'u—?í+›ÿÂP?í+–‹§o?í+£”ÎØÞ?í+£ZÃÉ?í+„ ??í+„‡– ø?í+e„®ªÇ?í+e:¡M?í+F{¾bu?í+FvJ^È?í+'r9T2?í+'lÅVR?í+h )~?í+b¬1l?í*é]pŸ ?í*éWü­\?í*ÊR-¶¸?í*ÊL¹ÊA?í*«FU,?í*«@áEt?í*Œ9ç©X?í*Œ4sÈ}?í*m,ä¬À?í*m'pѳ?í*NLJG?í*NØu ?í*/•ß?í*/ ªÆo?í*^3?í*üêÅ’?í)ðó ^_?í)ðí•šŒ?í)ÑãìH?í)Ñݪ.D?í)²ÒŸÍü?í)²Í,Æ?í)“Á‹–W?í)“¼ãð?í)t¯ãÇ?í)tªom/?í)U¦l:?í)U˜2Åq?í)6ŠÕ %?í)6…ak+?í)wo¢è?í)qü½?í(øcu®ü?í(ø^¡?í(ÙNçÙÂ?í(ÙItJ7?í(º9Å¡¸?í(º4Rü?í(›$°3?í(›œ,G?í(| Äî]?í(|Qp@?í(\öæŒ?í(\ñr??í(=ßsŸ?í(=Ú,’?í(Çl¤?í(Áù7q?í'ÿ®Ñ¾ ?í'ÿ©^W.?í'à•¢kv?í'à/ k?í'Á{ÞÀ_?í'Ávke#?í'¢a†ÐÂ?í'¢\{W?í'ƒF›E×?í'ƒA'ö=?í'd+ÈÔ?í'd%© ?í'Eƒv?í'E •?}?í'%òb "?í'%ìîÊû?í'Õ(CR?í'ϵ ü?í&ç·Z°Â?í&ç±ç~2?í&k:_ö«?í&k4ìÛl?í&L¯eØ?í&L©¹ ?í TÁ@œ?í TOHÛ?í 4ÈÔh,?í 4ÃbvC?í ŠT­*?í „âÁ?íöK?Ñœ?íöEÍëb?í× ˜;?í×&Z®?í·Ë\Ôx?í·Åêùì?혊ŽÚg?혅´?íyI-Ì:?íyC»ý^?íZ9½·?íZÇô³?í:ıœ?í:¿?Bq?í– $?í|$KÐ?íü=èG´?íü8v9?íÜù¥ƒÞ?íÜô3Ò;?í½´Ð·?í½¯_ 8?ížoiôâ?ížiøNð?í)nkâ?í#üËÉ?í_âá2?í_Ýozò?í@›¿³›?í@–N4?í!T ®?í!Nš‰?í ÆU/?íTÌz?íâÂì/?íâ½z¬??íÃy€ ?íÃt?í¤/eÊ?í¤*î¡?í„äÈ‘À?í„ßW q?íe™[¼?íe“êPŠ?íFMY>×?íFGçÙ;?í'ÁÁû?í&ûPb9?í³•Xþ?í®#ÿ?íèeÕÓª?íè`dœ?íɉ5?íÉ;?í©È–Ðõ?í©Ã%ˆœ?íŠy6ç?íŠs§ôh?ík)ê>?ík#”­š?íKØ^ºº?íKÒíƒñ?í,‡#»Ð?í,²Šâ?í 5SÙ?í /â­ó?ííâíýù?ííÝ|ØÀ?íÎõ"-?íΊ„Ð?í¯GRÄ?íQ8ÖJÕ?í1èi¸?í1âø¤?í‘ö`?팅“(?íó:ïÖK?íó5~ßï?íÓãTý?íÓÝä ‘?í´‹&« ?í´…µÀ|?í•2cÌP?í•,òçˆ?íuÙ ?íuÓœ)-?íV#Ö?íVy²,Ç?í7$¤±‚?í73ÞP?íÉ’²|?íÄ!å&?íømîCé?íøh}|p?íÙµ¾?íÙ Düd?í¹´è ™?í¹¯wäÚ?íšWˆ&Ù?íšRp÷?ízù“<â?ízô"ŒÝ?í[› Š?í[•™ßç?í<;ñx?í<6€`.?íÜCIp?íÖÒ«?íý|Øò?íýv@c?íÞ,P?íÞ»‚Ÿ?í¾¹Ä~l?í¾´Sñ™?íŸWÈlø?íŸRWæ?íõ9¯~?íïÉ.g?í`’žÂ?í`Œ¦#‰?íA.a 6?íA(ð“Ü?í!ÊÛJ?í!ħkÎ?íe?íâÕ^aþ?íà /$4?íÃÂ#ã?í£eÒ?í£_“p?탩>Õ¬?탣Ñá8?ícìé<[?ícç|MÖ?íD0 ±?íD*”%?í$r…Ë ?í$mèy?í´uÓ?í¯öJ?íäõÒí?íäðfV?íÅ6,y?íÅ10[Ÿ?í¥vÒïŽ?í¥qf$¤?í…¶w²‡?í…± í?íeõ‡à?íeðÎÖ?íF4I2?íF.—?í&qï«ø?í&l‚øÍ?í¯FñÛ?í©ÚD ?íæì ¿v?íææž,?íÇ(v?í-Û3?í,ûo¨>?í +èG¬?í &|X«?ìÿíVbºè?ìÿíPöÑÛ?ìÿÍ€Jy ?ìÿÍzÞ•ï?ìÿ­©¢ûJ?ìÿ­¤7#?ìÿÒg̼?ìÿÌûõŠ?ìÿmúš³’?ìÿmõ.âT?ìÿN"<ää?ìÿNÑš?ìÿ.IMâÖ?ìÿ.Câ€?ìÿoÍ/š?ìÿjap8?ìþî•»oC?ìþîOµÕ?ìþλ“!?ìþε«ß©?ìþ®ßãò?ìþ®ÚxD~?ìþìH?ìþŽþ³D¹?ìþo'È•?ìþo"\ó€?ìþOJànÉ?ìþOEtÓ#?ìþ/mh??ìþ/gü©d?ìþ^f?ìþ‰òÖÑ?ìýï°žÐ?ìýï«2ö ?ìýÏÑ-Í¡?ìýÏËÂIÐ?ìý¯ñ(e?ìý¯ë¼çµ?ìý ü?ìý $•?ìýp/eøP?ìýp)ú†`?ìýPM§÷J?ìýPH<‹P?ìý0kW>^?ìý0eëØZ?ìýˆtq-?ìýƒ  ?ìüð¤ý_Ÿ?ìü💇?ìüÐÀò³?ìüл†È’?ìü°ÜVš?ìü°ÖêÑo?ìü÷'8X?ìüñ»ð#?ìüqf €?ìüq úÈB?ìüQ+G?ìüQ%¦Ûÿ?ìü1D,@?ìü1>ÀÎð?ìü\±?ìüWEà»?ìûñt¥ÓÙ?ìûño:©v?ìûÑŒl?ìûц›G˜?ìû±¢Ôže?ìû±iñ?ìû‘¹~?ìû‘³¥ö?ìûqκ®?ìûqÉO›‚?ìûQãÐÿ`?ìûQÞeòÒ?ìû1øVèH?ìû1òëá²?ìû I¨Õ?ìûÞ¨7?ìúò«˜?ìúò@ ò?ìúÒ2z€ë?ìúÒ-Œ†?ìùò¦'Q?ìùò ¼´n?ìùÒ´f¥:?ìùÒ®ûàP?ìù²Â“þ?ìù²¼©Õ ?ìù’Ï/?ìù’ÉÄd ?ìùrÛ¸”Ð?ìùrÖMáÐ?ìùR籞¥?ìùRâFñž?ìù2ó{¨?ìù2í¬Ô›?ìùýì€8?ìùøß$?ìøó/ž–?ìøóÅ|?ìøÓáz?ìøÓ väð?ìø³t±?ìø³•å‹?ìø“#rî?ìø“$éÂ?ìøs+g?ìøs&"ãç?ìøS2ø³a?ìøS-Ž6)?ìø39Ó‰?ìø34h¤K?ìø@"G?ìø:±±?ì÷óEÒ)ï?ì÷ó@g¾¥?ì÷ÓJùÇ8?ì÷ÓEaé?ì÷³O’?ì÷³J$¼>?ì÷“S“ê•?ì÷“N)‘3ô?ìñÕ?ìððï× š?ìððênÅ?ìðÐÔß ú?ìðÐÏv %?ìð°¹U¸`?ìð°³ì¨Œ?ìð:ù›?ìð—ÑïÈ?ìðp€¥â?ìðp{'¢?ìðPcU±?ìðP]ì³3?ìð0E‰ê?ìð0@ ?ìð'+aÛ?ìð!Âp ?ìïð<-A?ìïðÓAs?ìïÏè½2$?ìïÏãTLW?ìï¯È­d‚?ìï¯ÃD„·?ìï¨ fŒ?ìŒÂ?ìïo†Ûœò?ìïorÉ*?ìïOe©ñ?ìïO_¯Ü+?ìï/BÇm?ìï/=^¥O?ìïä À?ìï{Ký?ìîîüo½„?ìîî÷Ä?ìîÎØl=?ìîÎÓ‡]?ì×ñn?ìî®®oA³?ì±?€?ìH•Ç?ìînhû•Û?ìînc’ò$?ìîNB·:?ìîN=Ni‡?ìî.àÚ-?ìî.xB|?ìî ô{^‡?ìî ïÌÙ?ìííÌaB ?ìííÆø¶]?ìíÍ£•ðÄ?ìíÍž-k?ìí­z8à ?ìí­tÐ`d?ìíPHtÚ?ìíJßû8?ìím%Åà3?ìím ]l•?ìíLú²â?ìíLõJt?ìí,Ï 2.?ìí,ɣʗ?ìí ¢ÔŸ?ìí k¾ ?ìììv -Ù?ìììp¡ÒJ?ììÌH®oo?ììÌCFã?ìì¬ÀgÚ?ìì¬XS?ìì‹ìAÖî?ìì‹æÙk?ììk½/tÊ?ììk·Ç1L?ììKŒi?ììKˆ#áï?ìì+]WZF?ìì+Wï"Ð?ìì ,¨ë?ìì '(wz?ìëêû8¬ø?ìëêõЋ?ìëÊÉOxý?ìëÊÃçS–?ì몖Ô’?ì몑kâ/?ìëŠcÅÊ`?ìëŠ^]±?ìëj0(?Ü?ìëj*À,„?ìëIûø©¼?ìëIöœi?ìë)Ç6‹®?ìë)Á΄a?ìë ‘äÃ?ìë Œ|Áº?ìêé\&‘?ìêéV™+N?ìêÉ%‹:?ìêÉ #D×?ìê¨î„.?ìê¨é>Ê?ìꈶí2°?ìꈱ…I?ìêh~Ã{?ìêhy[O?ìêHF >?ìêH@¡)?ìê( ¾5Í?ìê(V^®?ìêÒá…?ìêÍy´?ìéç˜uB?ìéç“ w ?ìéÇ]wD?ìéÇX?ìé§!è,’?ì駀m?ìé†åÈ?ìé†à`U?ìéf©ûf?ìéf£¯Hn?ìéFkÓZÈ?ìéFfk­Ø?ìé&.—t?ìé&(˜ð‹?ìé?ìéê4è#?ìèå°¨_˜?ìèå«@Ľ?ìèÅq#Ÿ?ìèÅk¼ ;?ìè¥1è¼?ìè¥+§Yð?ìè„ðg…Ô?ìè„êÿý?ìèd¯0á?ìèd©É^a?ìèDmhÒŠ?ìèDhUÕ?ìè$+Š?ìè$%©g?ìèè)7ž?ìèâÁÆø?ìç㤰³D?ìçãŸIH§?ìçÃ`§žP?ìçÃ[@9»?ì磚?ì磧;y?ìç‚Öä›Þ?ìç‚Ñ}CZ?ìçb‘)¶Œ?ìçb‹Âd?ìçBJàņ?ìçBEyy?ìç"¡)?ìç!þ Z¿?ìç¼??ìç·5þ®?ìæát£ì?ìæáo<±­?ìæÁ,¢?ìæÁ&³iR?ìæ ãI‘?ìæ Ý™J?ì怙V‡?ì怓î÷J?ìæ`O£¶?ìæ`I´ƒ?ìæ@QwB?ìæ?þê[?ìæ¸ø;G?ì泑%'?ìåÿmåŠ?ìåÿg§Õs?ìåß q¡ù?ìåß —ì?ìå¾Ó$Y•?ìå¾Í½U’?ìåž…E½?ìåžÞÄ?ìå~6Ô†??ìå~1mŽQ?ìå]çÓ<Ý?ìå]âlJù?ìå=˜@–?ìå=’ÙÖ¼?ìåHb?ìåB³|??ìäü÷cƒÝ?ìäüñü¤?ìäܦµ?ìäÜ ´Cû?ìä¼T@³°?ìä¼NÙà?ìäœÕtà?ìä›ün§;?ìä{®ØW?ìä{©qx?ìä[[Il¹?ìä[Uâ«+?ìä;)äÓ?ìä;Ã)P?ìä²yC€?ìä­Ž?ìãú]7 ï?ìãúWÐ]ƒ?ìãÚdp?ìãÚýÆ¥?ìã¹°þ¸?ì㹫˜É?ìã™Z0Ž?ìã™T¡“D?ìãy‚–L?ìãxýÿ?ìãXªk4Î?ìãX¥£œ?ìã8QÁi?ìã8L[C?ìãø‡f?ìãó àù?ìâ÷ž¼È5?ìâ÷™VI(?ìâ×Da;?ìâ×>úÂ?ìâ¶éuís?ìâ¶äz~?ìâ–ø+?ìâ–ˆ‘¾5?ìâv1é"Ö?ìâv,‚»û?ìâUÕJB?ìâUÏã¢t?ìâ5xP¶?ìâ5r³õô?ìâZ¬?ìâóÈø?ìáô¼ ˜£?ìáô¶¤Iü?ìáÔ]) á?ìáÔWÂÅG?ìá³ý¶«ø?ìá³øPil?ìᓵ/d?ìᓘNòå?ìás="r–?ìás7¼<%?ìáRÛÿ?ìáRÖ˜å£?ìá2zKº,?ìá2tåÖ?ìáã†?ìá¡¿>?ìàñµ3›?ìàñ¯Ìøa?ìàÑQÍe÷?ìàÑLgMË?ìà°íÙÁ?ìà°ès £?ìà‰T½?ìàƒî®?ìàp$>ëV?ìàpØåU?ìàO¾šEæ?ìàO¹4Eó?ìà/Xco?ìà/Rýu¬?ìàñž[æ?ìàì8h?ìßîŠHåì?ìßî„âø&?ìßÎ"c (?ìßÎý8q?ìß­¹îÆŽ?ìß­´ˆäå?ìßPé&…?ìßKƒJë?ìßlçSûþ?ìßláî&t?ìßL}.˲?ìßLwÈü7?ìß,y¨"?ìß, Þ·?ìß §4?ìß ¡ÎR¶?ìÞë;`ì¾?ìÞë5û/r?ìÞÊÎýyä?ìÞÊɗ¨?ìÞªb´£?ìÞª\£w?ìÞ‰ô††?ìÞ‰ï äj?ìÞi†tXr?ìÞi³e?ìÞIÑ ?ìÞIkg£?ìÞ(¨žãR?ìÞ(£9Jf?ìÞ8Þ?ìÞ3xn'?ìÝçÈŒÉC?ìÝçÃ'?ìÜ£>s¢?ìÜ‚Í AÒ?ìÜ‚Ç¥÷Ä?ìÜbU­±?ìÜbPHm!?ìÜAݾ©â?ìÜAØYkø?ìÜ!e?Yb?ìÜ!_Ú!‰?ìÜì.¶é?ìÜæÉ…#?ìÛàrŽ}"?ìÛàm)Qn?ìÛ¿ø\ˆ?ìÛ¿ò÷bÝ?ìÛŸ}˜]ì?ìÛŸx3>]?ìÛDÒÜ?ìÛ~üß¹`?ìÛ^†`Þ°?ìÛ^€ûËF?ìÛ> ëxê?ìÛ>†k“?ìÛŒæ[ÿ?ìÛ‡T»?ìÚýPr?ìÚý ë~A?ìÚÜ‘)h8?ìÚÜ‹Äm?ìÚ¼rЭ?ìÚ¼ Û¢?ìÚ›“+°`?ìÚ›ÆÁh?ìÚ{T¦?ìÚ{ ï0Á?ìÚZ’ì¬?ìÚZ‡ÉC?ìÚ:óÒ?ìÚ: ŽõV?ìÚkEÖ?ìÚ‹o-?ìÙùRŒ]?ìÙùí»Ç?ìÙØ‹©*¶?ìÙ؆D`5?ìÙ¸o36?ìÙ¸ nÈ?ìÙ—„§z\?ìÙ—B¼?ìÙwM¨?ìÙvúèðH?ìÙV{ez?ìÙVvmJ?ìÙ5õë¼–?ìÙ5ð‡y?ìÙoá’F?ìÙj|ì>?ìØôéHçŒ?ìØôãäG™?ìØÔb ´W?ìØÔ\¼y?ìسÚgð¨?ìسÕ\Þ?ìØ“R®à?ìØ“Lº!+?ìØrÉF›?ìØrÃá“ü?ìØR?Ý.î?ìØR:x­c?ìØ1µå¢|?ìØ1°'?ìØ+]áM?ìØ%ùkí?ì×ð Ep­?ì×ðšác?ì×О—;?ì×Ð:.?ìׯˆhÚ2?ìׯƒw?ì׎û£1Ì?ì׎ö>ÔÃ?ì×nnN=f?ì×nhéæs?ì×Màj[?ì×MÛ¾~?ì×-Qö,ÿ?ì×-L‘â8?ì× Âò¨±?ì× ½Žd?ìÖì3`®¼?ìÖì-üp"?ìÖË£>ªŒ?ìÖËÚr?ìÖ«Èo?ìÖ« )–?ìÖŠN´?ìÖŠ{éî]?ìÖiï~ ð?ìÖiêæ°?ìÖI]XJ?ìÖIW»8!?ìÖ(Ê2?ìÖ(ÄÍõ?ìÖ6µ¶Ä?ìÖ1Q¢É?ìÕ碩Gó?ìÕçE:?ìÕÇ{©?ìÕǪsÝ?ìÕ¦xÂ:.?ìÕ¦s^8y?ìÕ…âÆ¢7?ìÕ…Ýb¦š?ìÕeL:Ù‘?ìÕeFÖä ?ìÕDµex?ìÕD¯ºv ?ìÕ$p>h?ìÕ$ U?ìÕ…36†?ìÕÏSG?ìÔâìd?ìÔâç5ô?ìÔÂSŒ©?ìÔÂM µš?ìÔ¡¹µI?ìÔ¡³°äS?ìÔ“…˜?ìÔ/ºº?ìÔ`ƒ‚µî?ìÔ`~ñ*?ìÔ?çáË¢?ìÔ?â~ ö?ìÔK°L?ìÔFL“…?ìÓþ®ì¦?ìÓþ©ˆd+?ìÓÞ˜‰®?ìÓÞ 4ÝL?ìÓ½sµ*Ž?ìÓ½nQ„E?ìÓœÕ@ò?ìÓœÏÝQÞ?ìÓ|6<~þ?ìÓ|0Øäç?ìÓ[–¨üÀ?ìÓ[‘EhÃ?ìÓ:öƒ¾G?ìÓ:ñ 0d?ìÓUÏ>?ìÓPk€t?ìÒù´Šì¿?ìÒù¯'k?ìÒÙµØ?ìÒÙ R\~?ìÒ¸pQ‚5?ìÒ¸jî ¸?ìÒ—Í[Êí?ìÒ—Çø[Š?ìÒw)Öj(?ìÒw$sß?ìÒV…Áqü?ìÒV€^Í?ìÒ5áh ?ìÒ5Û¹ õ?ìÒ;çêô?ìÒ6„“ú?ìÑô–$ à?ìÑôÀ¼?ìÑÓïÐSo?ìÑÓêmª?ìѳHìDJ?ìѳCˆÿ ?ìÑ’¡y— ?ìÑ’œXz?ìÑqùv+õ?ìÑqôó?ìÑQP⡶?ìÑQKo\?ìÑ0§À¯Ä?ìÑ0¢]ƒ…?ìÑþ6Ž?ìÑø«k?ìÐïSÌí€?ìÐïNiÍx?ìÐΨûÍò?ìÐΣ˜´?ìЭýšê?ìЭø7ÖE?ìÐQ©Ç¶?ìÐLFº?ìÐl¥+6Ú?ìÐlŸÈ/@?ìÐKø‹Ó?ìÐKò¹ŠV?ìÐ+J~e/?ìÐ+EiÍ?ìÐ œQan?ìÐ –îl)?ìÏéí•n?ìÏéè2D?ìÏÉ>IfV?ìÏÉ8æ}I?ìϨŽo«ì?ìϨ‰ Èû?ìχÞŸª?ìχءÂÖ?ìÏg- r?ìÏg'¨Æ»?ìÏF{„·d?ìÏFv!æÉ?ìÏ%Él¶/?ìÏ%Ä ë±?ìÏÅÝ?ìÏc¬?ìÎäc‘Vœ?ìÎä^.˜X?ìÎïÍ'?ìÎêjL?ì΢ûx÷ó?ì΢öEé?ì΂F˜ ?ì΂A5U3?ìÎa‘(F?ìÎa‹Åçw?ìÎ@Û)–@?ìÎ@ÕÆöŽ?ìÎ $^ä?ìÎ :ÅP?ìÍÿmÈÅ?ìÍÿh5O?ìÍÞµÖZ ?ìÍÞ°sÌ´?ìͽýžm?ìͽø;æb?ìÍDÖ@ë?ìÍ?s¿Î?ìÍ|‹]Õ¨?ìÍ|…ûZª?ìÍ[Ñ7Çv?ìÍ[ËÕR–?ìÍ;€ÂÒ?ìÍ;T?ìÍ[8Ù±?ìÍUÖq?ìÌùŸaÂ/?ìÌù™ÿ_ª?ìÌØâùê?ìÌØÝ—¶?ì̸&cs?ì̸ Ÿ ,?ìÌ—hyä/?ìÌ—c”?ìÌvªaÚ>?ìÌv¤ÿ5?ìÌUë¹Wš?ìÌUæW°?ìÌ5,€ú4?ìÌ5'¼j?ìÌl·¼?ìÌgU„q?ìËó¬]#b?ìËó¦úñ×?ìËÒëu¡‚?ìËÒæv?ì˲)üèî?ì˲$šÃ¢?ìË‘gó ²?ìË‘bì†?ìËp¥ZKp?ìËpŸø2c?ìËOâ1¢L?ìËOÜÏ_?ìË/x–c?ìË/‰–?ìËZ1i)?ìËTÏb}?ìÊí•Xåj?ìÊíöäÞ?ìÊÌÏðÀ¼?ìÊÌÊŽÆP?ìʬ ù˜ë?ìʬ—¤ ?ìÊ‹CqÜ?ìÊ‹>îT?ìÊj|Zµ?ìÊjvøÍ?ìÊI´µØ?ìÊI¯Sö&?ìÊ(ì(,?ìÊ(çLd?ìÊ#»(?ìÊY>?ìÉçZg€a?ìÉçU°Û?ìÉÆ„OÀ?ìÉÆ‹"†[?ìÉ¥Æñ"?ìÉ¥À®-Þ?ìÉ„û ¥z?ìÉ„õªèX?ìÉd/yó?ìÉd*<?ìÉCcYH?ìÉC]÷Ri?ìÉ"–©\b?ìÉ"‘G±¥?ìÉÉiù?ìÉÄTm?ìÈàû›vê?ìÈàö9Øq?ìÈÀ->ÿT?ìÈÀ'Ýfý?ìÈŸ^SP?ìÈŸXño?ìÈ~Ž×Žî?ìÈ~‰vÛ?ìÈ]¾Ìº6?ìÈ]¹k4E?ìÈ<î3¬d?ìÈ<èÒ,—?ìÈ Ô²?ìÈ©[?ìÇûKRÐÈ?ìÇûEñ]??ìÇÚy ÉÉ?ìÇÚs«\d?ìǹ¦7º›?ìǹ ÖSX?ìǘÒÔ@Î?ìǘÍr߯?ìÇwþáâã?ìÇwù€‡æ?ìÇW*a>`?ìÇW$ÿé‡?ìÇ6UQÙÊ?ìÇ6Oð‹?ìÇ´Þ(?ìÇzS•–?ìÆô©‡“?ìÆô¤%Ö$?ìÆÓÒËà?ìÆÓÍj£·?ìƲû‚ºü?ìƲö!„Ô?ìÆ’#ª¤ž?ìÆ’It›?ìÆqKDÅ×?ìÆqEã›÷?ìÆPrOŽh?ìÆPlîj­?ìÆ/˜Ëp?ìÆ/“iòØ?ìƾ»-Á?ìƹZN?ìÅíäÒ?ìÅíÞºƒ?ìÅÍìüH?ìÅÍ‹ñ?ìŬ-0ÿ*?ìŬ'Ïú$?ìÅ‹Pç·Û?ìÅ‹K†¸ù?ìÅjt!±?ìÅjn¯(õ?ìÅI–ˆôY?ìÅI‘(Â?ìÅ(¸S¥H?ìÅ(²ò¸Õ?ìÅÙŽ= ?ìÅÔ-WS?ìÄæú9Z|?ìÄæôØzT?ìÄÆSkÐ?ìÄÆò‘Î?ìÄ¥9Þ°Š?ìÄ¥4}ܬ?ìÄ„XÚ#å?ìÄ„SyV-?ìÄcwELs?ìÄcqä„á?ìÄB•°Ö?ìÄB¾ïj?ìÄ!²kÉ?ìÄ!­ Ô‚?ìÄÏ'Yj?ìÄÉƤI?ìÃßëT5ö?ìÃßåó†ü?ìÿñ¬?ìÿ‘/?ìÞ!ÿB5?ìÞžŸˆ?ìÃ}<}•Š?ìÃ}7ù?ìÃ\Vl·Ô?ìÃ\Q !t?ìÃ;oˤš?ìÃ;jk_?ìÈšm¾?ìÃ9ãª?ìÂù ÚÆs?ìÂù›zB†?ìÂظŠ”?ìÂس*U?ì·ϫ‰à?ì·ÊKA?ì–æ?åÖ?ì–àßt^?ìÂuüCì>?ìÂuöã€î?ìÂU·¯?ìÂU WIÙ?ìÂ4&œV?ìÂ4!;÷?ìÂ:ó l?ìÂ5’°’?ìÁòN¹#§?ìÁòIXÐõ?ìÁÑañøÀ?ìÁÑ\‘¬5?ìÁ°t›n~?ìÁ°o;(?ìÁ†´€Î?ìÁT@“?ìÁn˜?øm?ìÁn’ß¾Z?ìÁM©m6¾¢?ì¿>gÖíI?ì¿t½ V?ì¿o]>&?ì¾ü{³Ë˜?ì¾üvT“?ì¾Û‚·Ž?ì¾Û|¼ø³?쾺‡÷ß?쾺‚˜&a?ì¾™DÉP?ì¾™‡åÊ?ì¾x’rÉ?ì¾xŒ¢Æm?ì¾W–3-?ì¾WÓqü?ì¾6™Õµú?ì¾6”vó?쾜éÓn?ì¾—Š9’?ì½ôŸp—¼?ì½ôš ?ì½Ó¡hÿ?ì½Óœ qû?ì½²¢Ó©?ì½²s•N?콑£±¶/?콑žR4ÿ?ì½p¤(Ñ?ì½pž¢­Í?ì½O£ÃqX?ì½Ožcü?ì½.¢øá2?ì½.™r…?ì½ ¡~Ôl?ì½ œkê?ì¼ìŸWÇý?ì¼ì™øe§?ì¼Ëœ ói?ì¼Ë—A—??켪™Zh^?켪“û`?켉•„8‰?켉$è·?ì¼h‘ ?ì¼h‹ÀËt?ì¼GŒ+å¥?ì¼G†Ì¢+?ì¼&†¨Ð×?ì¼&I“Š?ì¼€–]Ú?ì¼{7&¹?ì»äyõ(Í?ì»ät•÷Ù?ì»ÃrÉ?ì»ÃmcîÂ?컢kk’?컢e£F÷?ì»b²´?ì»]RýF?ì»`YÒ;Ÿ?ì»`Ts#^?ì»?Pd|;?ì»?Kj(?ì»FfÅ’?ì»A¹«?ìºý;ÚÈ?ìºý6{ÂÈ?ìºÜ0À–­?ìºÜ+a—!?캻%,þ?캻¸3 ?캚Üþ#?캚~ ó?ìºy ä;?ìºy¶÷8?ìºWþÀÜ/?ìºWùaõZ?ìº6ðÚ¹Ê?ìº6ë{Ù#?ìºâgá>?ìºÝ Å?ì¹ôÓe&e?ì¹ôÎR?ì¹ÓÃÔ9Ø?ì¹Ó¾uk¼?ì¹²³´º?ì¹²®UPÌ?칑£ÔÄ?칑¦?ì¹p‘Ç”,?ì¹pŒhØ›?ì¹OüòÒ?ì¹Ozž=o?ì¹.m¢Ù?ì¹.hD*M?ì¹ Z¹ä+?ì¹ U[;&?ì¸ìGD×~?ì¸ìAæ4¨?ì¸Ë3?s¡?ì¸Ë-àÖú?츪«ó ?츪M\”?츉 ‹{Â?츉,ëz?ì¸góÛöÔ?ì¸gî}l»?ì¸FÝž"?ì¸FØ?|9?ì¸%ÆÒ½¤?ì¸%Át?ë?츯y,Ê?츪µA?ì·ã—K"?ì·ã’1ÙÉ?ì·ÂRÈ?ì·Ây»çž?ì·¡fA@?ì·¡`·ÜF?ì·€Lƒž6?ì·€G%?l?ì·_2d£š?ì·_-K?ì·>¶&Ö?ì·>WÔm?ì·üzaÕ?ì·÷?ì¶ûà°ÜF?ì¶ûÛR–>?ì¶ÚÄY§à?ì¶Ú¾ûh ?춹§sÂa?춹¢ˆº?춘ŠÛ†?춘„¢¨?ì¶wl{?ì¶wf¢M¾?ì¶VMqž¨?ì¶VHw”?ì¶5.V€?ì¶5(ø_$?춭 ?ì¶ NîZ?ìµòîv_Z?ìµòéJÚ?ìµÑͳ?ìµÑÈU??ìµ°¬aº¨?ìµ°§²‹?쵊»?ìµ…#¹¤?ìµnhZ•?ìµnb·^Ü?ìµME‹?ìµM?¾*?ìµ,!”~œ?ìµ,6G?ìµ ý€'?ìµ ø"=ú?ì´éØÞ ö?ì´éÓ€¾?ì´È³U¢?ì´È®1xã?ì´§“Ÿ…?ì´§ˆ5Èù?ì´†gpe?ì´†aª  ?ì´e?îc‘?ì´e:™j?ì´DFž?ì´DèÚ"?ì´"ð T?ì´"ê±L’?ì´ÇG0 ?ì´Áéx’?ì³àòå;?ì³à˜•3ß?쳿t í2?쳿n°B ?쳞Iš€…?쳞D<Û‘?ì³}™:d?ì³};›£?ì³[ó„?ì³[íªlö?ì³:ÆèÜ?ì³:ÁŠt?쳚:cB?ì³”Ü×?ì²ølý;?ì²øg  H?ì²×?2¯?ì²×9Õ/Þ?첶ÙLD?첶 {Ò¹?ì²”áò\?첔ܔ?ì²s²z¶ì?ì²s­IÊ?ì²R‚u§ú?ì²R}A ?ì²1QáÑà?ì²1L„q&?ì² ¿Ï³?ì²bu.?ì±îï<˜?ì±îé²èH?ì±Í¼Òç?ì±Í·tÈÌ?챬Š]#?챬„§È?쬜Þ9?쬜«ˆ°?ì¬zÓÿüÌ?ì¬zΣ­|?ì¬YŠLÌ©?ì¬Y„ðƒ“?ì¬8@ ƒk?ì¬8:¯@Ž?ì¬õ; T?ì¬ïÞã°?ì«õ©Û´Ç?ì«õ¤~]?ì«Ô]íR+?ì«ÔX‘!ú?쫳qé?쫳 ññ?ì«‘ÄfW?ì«‘¿ íš?ì«pvÍUÑ?ì«pqq8M?ì«O(¦q²?ì«O#JZi?ì«-ÙñvX?ì«-Ô•eH?ì« Š®u?ì« …RjH?ìªë:ÞN?ìªë5‚³?ìªÉê~†?ìªÉå"%?쪨™`þ?쪨”4hØ?쪇Hlø?쪇B¹{ ?ìªeö ¦R?ìªe𮺡?ìªD£q0I?ìªDžJÒ?ìª#PK?Ç?ìª#Jï`Œ?ìªü–¨?ìª÷:é¨?ì©à¨TS/?ì©à¢ø€j?ì©¿S…m?ì©¿N)Gã?ì©þ&k•?ì©øÊ¥F?ì©|¨:d?ì©|¢ÞÍQ?ì©[QÁl?ì©[LeH•?ì©9úºdÖ?ì©9õ^±:?ì©£%´l?ì©Ê ?ì¨÷K‹b?ì¨÷E§ä=?ì¨ÕòSrZ?ì¨Õì÷Ñq?쨴™z¾?쨴“¹à?쨓?JÇn?쨓9ï2þ?ì¨qäñÏ ?ì¨qß–Al?ì¨PŠ ¶0?ì¨P„°.8?ì¨/.˜Œ?ì¨/)= Æ?ì¨ Ò˜cö?ì¨ Í<èw?ì§ìv ³è?ì§ìp®>¦?ì§Ëî°{?ì§Ë“Av?짩»EHr?짩µéߪ?질] D?질W²*¹?ì§fþI²ó?ì§føîV¤?ì§Ežø0ý?ì§E™œÚì?ì§$?*?ì§$9¾Ú:?ì§Þ¯&ê?ì§ÙSÝT?ì¦á}·8þ?ì¦áx[õ¥?ì¦À1é"?ì¦ÀÖ¬?즞º âx?즞´Å«›?ì¦}W ?ì¦}R%Òm?ì¦[ôT~‘?ì¦[îùT/?ì¦:›fp?ì¦:‹@BL?ì¦,UÌ?ì¦&ú®,?ì¥÷Ç‚¯à?ì¥÷Â'˜8?ì¥Öb#4R?ì¥Ö\È"è?쥴ü7jÎ?쥴öÜ_£?쥓•¾SÎ?쥓cNá?ì¥r.º"£?ì¥r)_#õ?ì¥PÇ'µó?ì¥PÁ̽„?ì¥/_¸œ?ì¥/Y­Æk?ì¥ ö]Äy?ì¥ ñ؇?ì¤ì%Ú ?ì¤ì‡Êôn?ì¤Ë#a ?ì¤Ë+˜?줩¹à?줩³¶(¬?줈N2º?줈H×ÊÆ?ì¤fâÈ£?ì¤fÝmDî?ì¤EvÑ÷f?ì¤Eqw0ð?ì¤$ .Í?ì¤$Ô Z?줜àåM?줗†+W?ì£á/Çû?ì£á)¬E?죿ÀTÒ?죿»B§\?죞Q¥%m?죞LJ~7?ì£|â l5?ì£|ÜÅË??ì£[r æ?ì£[l±ö0?ì£:jµY?ì£9ü ä?ì£:êÃ?죊à\Ž?ì¢÷}Êž?ì¢÷#Bª?ì¢Õ¬2Ýà?ì¢Õ¦Ø\-?좴9Z5Á?좴3ÿºO?좒Åóã}?좒À™nK?ì¢qQþçè?ì¢qL¤xø?ì¢OÝ}u ?ì¢OØ# [?ì¢.hn„?ì¢.c¡?ì¢ òФœ?ì¢ ívHp?ì¡ë|¥i’?ì¡ëwK§?ì¡ÊìëÉ?ì¡Ê’œ?졨Ž¥¤?졨‰KZ²?졇ÒÔ‹?졇x‘e?ì¡ežqå°?ì¡e™¨Ì?ì¡D%ƒpñ?ì¡D ):N?ì¡"¬—¸?ì¡"¦®gX?ì¡2[ ?ì¡,¦0ì?ì ß·i¼?ì ß²˜5?ì ¾?ì ¾6ìF¤?ì œÀ”Ì°?ì œ»:µY?ì {DW&Õ?ì {>ýÀ?ì YÇŒsÐ?ì YÂ2hÿ?ì 8J4Äå?ì 8DÚÀV?ì ÌOX?ì Æõ ?ìŸõMܘn?ìŸõH‚ e?ìŸÓÎÜÅr?ìŸÓÉ‚Ó¬?쟲OQKŠ?쟲I÷`?ìŸÏ7”(?ìŸÉÝ®è?ìŸoN‘Ðe?ìŸoI7ñi?ìŸMÍ^y´?ìŸMÈ ü?ìŸ,KŸ9?ìŸ,FEf©?ìŸ ÉS—ø?ìŸ ÃùËÇ?ìžéFz—¶?ìžéA ÑÉ?ìžÇÃYl?ìžÇ½»™Â?잦?"V½?잦9ÈX?ìž„º£8•?ìž„µI…t?ìžc5—ˆ]?ìžc0=Û€?ìžA¯ÿWU?ìžAª¥°¼?ìž )Ú¶Ì?ìž $x?ìþ£)¸?ìþÐõ?ìÝëä|?ìÝ’P±?ì»”!M~?컎ǿø?ìš Ë›´?ìšrr?ìx‚éI?ìx}È?ìVùzf¹?ìVô ì?ì5o~~m?ì5j% û?ìäö°ç?ìßBº?ìœòYâ?ìœòTˆ˜?ìœÐÎB2?ìœÐÈè²?윯BïP?윯<¼“ô?융]ý?윰Åç?ìœl(?”?ìœl"¿ðÂ?ìœJšH×T?ìœJ”ïŽÈ?ìœ) 튋?ìœ)”HE?ìœ}Kä?ìœw¬ä?ì›åí‘ã?ì›åè8ê?ì›Ä]q@Ù?ì›ÄXf?웢̨%?웢ÇNûò?ì›;Puæ?ì›5÷S?ì›_©jËæ?ì›_¤¯G?ì›>øÎï?ì›>Ÿ¸—?웃÷bž?ì›~žR?ìšúði=è?ìšúë4?ìšÙ\NqÖ?ìšÙVõnR?욷Ǧ`?ìš·ÂM$?ìš–2oúœ?ìš–-§?ìštœ¬ù%?ìšt—Tw?ìšSZï?ìšS¨?ìš1o}o?ìš1j$6Q?ìšØõÞ?ìšÒ¹?ì™î@ ú?ì™î:À3k?ì™Ì§’òX?ì™Ì¢:!?왫½?왫 &ò?왉tß|2?왉o†·{?ì™gÚ±¹r?ì™gÕXû?ì™F?ø#?ì™F:Ÿcü?ì™$¤±?ì™$ŸXmA?ì™ÜÓ‚?완'ì?ì˜ál{ÑÎ?ì˜ág#,€?옿ϣº?옿Ê5¶?옞2Ó ?옞,¹:P?ì˜|” ž?ì˜|Ž²ƒ+?ì˜Zõv×É?ì˜ZðKŸ?ì˜9VT£a?ì˜9Pü€?옶§. ?옱N®‰?ì—ölkÛ?ì—öò?ì—Ôu¤m¹?ì—ÔpKú´?ì—²ÔPÚ´?ì—²Îømù?ì—‘2o¦Ì?ì—‘-@Z?ì—oã/?ì—oŠ¨ƒ?ì—MíE@?ì—Mç®ëb?ì—,IHP?ì—,D(ô¼?ì— ¥ný?ì—  °5?ì–éÐuì?ì–èûx.ì?ì–Ç[¥;‚?ì–ÇVLúÌ?ì–¥µíæ”?ì–¥°•¬)?ì–„ªˆB?ì–„ RT!?ì–bhÚª~?ì–bc‚|¨?ì–@Á}×I?ì–@¼%¯¾?ì–•µ;?ì–=“ú?ì•ýq 8å?ì•ýkÈï?ì•ÛÈÔ?ì•ÛÂÆô(?앺’½D?앺:®ä?았tyÑý?았o!Éè?ì•vÉÕfZ?ì•vÄ}d?ì•U¤}P?ì•ULÒ?ì•3rè6-?ì•3m@ú?ì•ÆŸ“ô?ì•ÁG¥ ?ì”ðʧÑ?ì”ðr¿5?ì”Îlk?ì”Îg5´?씬¾~R’?씬¹&vŽ?씋„·?씋 ®®ÿ?ì”ia¿?ì”i[«ð$?ì”G±søL?ì”G¬/,?ì”&Y\ ?ì”%ü™9?ì”P³ûä?ì”K\?]?ì“âŸF=?ì“âš)?ì“ÀíÄuñ?ì“ÀèlÆ?ì“Ÿ;{€e?ì“Ÿ6#ÖÄ?ì“}ˆ§„ ?ì“}ƒOáK?ì“[Õ(79?ì“[ÏК2?ì“: ÿF³?ì“:§¯ù?ì“lH“’?ì“fñ%?ì’ö·JB?ì’ö±®À"?ì’Õ6`+?ì’ÔûÞÜX?ì’³JØæC?ì’³Eh½?ì’‘“îû0?ì’‘Ž—ƒø?ì’oÜw¢.?ì’o× 1C?ì’N$ss?ì’Nh?ì’,ká÷Ö?ì’,fŠ“‡?ì’ ²ÃÈf?ì’ ­lje?ì‘èùnÔ?ì‘èóÁ!?ì‘Ç>ái?ì‘Ç9Š??ì‘¥„"ö?ì‘¥~Å×ß?쑃ÈÊ°À?쑃Ãskù?ì‘b ìe»?ì‘b•'B?ì‘@P€¾¡?ì‘@K)†w?ì‘“ˆS$?ì‘Ž1!H?ìüÖA¥?ìüЭ?ìÛó¦?ìÛœhh?ì¹YUÁj?ì¹Sþ¢z?ì—š,ô?ì—”ÕiS?ìuÚuŇ?ìuÕ³6?ìT2#Î?ìTÛÍ?ì2Yb4h?ì2T .¶?옉?ì’°&?ìîÖ°j?ìîÐÆ·V?ìͪJî?ìÍSX+?ì«P©Î^?ì«KRáê?ì‰ÒT?쉇Åì0?ìgÉgÍ?ìgì‡ú?ìF^&R?ìEÿLÏ?ì$?+‹8?ì$9Ô¸?ìymÁ«?ìtôÈ?ìŽà³%a?ìŽà­ÎšŒ?쎾ìOÙæ?쎾æù¤?ìŽ$îÐŒ?쎘›?ìŽ{]I ?ìŽ{Wª•l?ìŽY”‡Tn?ìŽY0§?ìŽ7Ë‚—?ìŽ7Æ+ð?ìŽò?ìŽü›tV?ìô7ÕXÊ?ìô2~¾n?ìÒm,ùÔ?ìÒgÖeÉ?ì°¡ùŒ?ì°œ£Ñ?ìŽÖ9@?ìŽÐâ‰×?ìm î0?ìm—®ë?ìK=i“?ìK7ÀîÎ?ì)o´H–?ì)j]Ô"?ì¡Æq/?ìœp ?ìŒåÓMmõ?ìŒåÍ÷%?ìŒÄHC2?ìŒÃþñá´?쌢4·ò?쌢/`¦Ç?쌀dšÇå?쌀_Ds ?ìŒ^“ò?ìŒ^Ž›Ä‘?ìŒ<ÂÀh?ìŒ<½iÒ3?ìŒñB±?ìŒë«Ï?ì‹ù·¶*?ì‹ùaz›?ì‹×Kä ?ì‹×FÖÔ?싵xƒ¶?싵s-‡)?ì‹“¤—ÑÇ?ì‹“ŸA©1?ì‹qÐ"‰#?ì‹qÊÌfß?ì‹Oû!M÷?ì‹OõË2?ì‹.%”·Š?ì‹. >¡í?ì‹ O}]?ì‹ J'MÏ?ìŠêx¼U ?ìŠêsfL*?ìŠÈ¡Q®Ð?ìŠÈ›û¬.?슦É[¦’?슦ĪD?슄ðØ4}?슄ë‚>‚?ìŠcÇï‹?ìŠcqÿä?ìŠA>+ôÏ?ìŠA8Ö |?ìŠd§?ìŠ^¬ß¨?ì‰ý‰Lð?ì‰ýƒ÷Y?ì‰Û® Í?ì‰Û¨µ=w?쉹Ò;&j?쉹ÌåVh?쉗õß×(?쉗ðŠ {?ì‰vù6Ä?ì‰v£sk?ì‰T;…=¼?ì‰T6/€¸?ì‰2]… ?ì‰2X/RZ?ì‰~ø©r?ì‰y¢ù?ìˆîŸß©Â?ìˆîš‰ÿ½?ìˆÌÀ: Î?ìˆÌºäý?숪à %e?숪ڴˆ ?숈ÿMl÷’?ì>g¢Û‚?ìm|Ë?ìh(—P?ì€úmvh ?ì€úh":²?ì€Ølãwö?ì€ØgP÷?쀶kÆ Ù?쀶fr6?쀔jãH?쀔dÈÉ?ì€rgçJž?ì€rb“6³?ì€Pe&r(?ì€P_Òd˜?ì€.aØU\?ì€.\„N'?ì€ ]þ?ì€ Xª¸?ìêY™AN?ìêTEFÒ?ìÈT¨kb?ìÈOTwB?ì¦O,#Ã?ì¦IØ5ÿ?ì„I${?ì„CГ³?ìbBw™?ìb=<–Ž?ì@;r>â?ì@6d4?ì3Ç̵?ì.søc?ì~ü+’<2?ì~ü&>n=?ì~Ú"Ðt?ì~Ú|FÜ?ì~¸„ø~?ì~¸17C?ì~–­ëØ?ì~– Z0ú?ì~tJù8?ì~sÿ÷D·?ì~Qú];¨?ì~Qõ „?ì~/î㹊?ì~/éÃ?ì~ âÝþz?ì~ ÝŠ]?ì}ëÖN´Ì?ì}ëÐûÀ?ì}ÉÉ3ج?ì}ÉÃàCþ?ì}§»ÿï?ì}§¶:q ?ì}…­]ÀX?ì}…¨ 8f?ì}cž¡N?ì}c™M”º?ì}AZ«à?ì}AŠ0ª?ì}‰Ž?ì}z5¶?ì|ýo,°?ì|ýiÙA ?ì|Û^D6 ?ì|ÛXðÎ?ì|¹LÒ>{?ì|¹G~ܾ?ì|—:ÕÏÍ?ì|—5‚to?ì|u(MkÊ?ì|u"úË?ì|S;7*?ì|Sçè‰?ì|1ž½™?ì|0üKuW?ì|ív€è?ì|è#??ì{ìØÅ*¡?ì{ìÓqï?ì{ÊÈ·Ÿ?ì{ʾ5‚{?ì{¨­À.Ë?ì{¨¨m?ì{†—n¾s?ì{†’–?ì{d€‘YÈ?ì{d{>7Â?ì{Bi) J?ì{BcÖ„£?ì{ Q8'’?ì{ KåK?ìzþ8¼{r?ìzþ3il‹?ìzܶ¬ž?ìzÜc¤?ìzº'Pª?ìzºÔNƒ?ìz—ì é¾?ìz—æ¹í÷?ìzuÑgÑ?ìzuÌj?ìzS¶8GÇ?ìzS°åXÁ?ìz1š€Ax?ìz1•-XÒ?ìz~<îe?ìzxê ?ìyíaQ~?ìyí[þ8™?ìyËC¾Ár?ìyË>këí?ìy©% ã?ìy© M5À?ìy‡õøÝ?ìy‡£0?ìydç¿£?ìydâl]B?ìyBÇü“C?ìyB©×B?ìy §®èö?ìy ¢\3W?ìxþ†Õ¬†?ìxþ‚ýH?ìxÜepiÁ?ìxÜ`Àå?ìxºCµä?ìxº>-j?ìx˜!&!?ìx˜±Š?ìxuýüÁœ?ìxuøª+å?ìxSÚj¢6?ìxSÕà?ìx1¶LJt?ìx1°ùÁ?ìx‘¢OŽ?ìxŒOÌý?ìwílmF®?ìwígÊ?ìwËF¬»¿?ìwËAZEò?ìw© `:ª?ìw© Ë@?ìw†ùŠk?ìw†ô8ú?ìwdÒ(A¬?ìwdÌÕß?ìwBª:Øl?ìwB¤è|*?ìw ÂÄZ?ìw |pnz?ìvþX¿ Û?ìvþSl½^?ìvÜ//Š?ìvÜ)Ýyp?ìvºƒ‰?ìv¹ÿÄ@Ò?ìv—ÚqÒÆ?ìv—Õ–s?ìvu¯BÉØ?ìvu©ð“ç?ìvSƒˆôÃ?ìvS~6Å6?ìv1WBÖ™?ìv1Qð­p?ìv*r h?ìv%ê¢?ìuìý.4?ìuì÷ÅÒ?ìuÊÏ1@•?ìuÊÉß*–?ìu¨ ÀÙŽ?ìu¨›nÉó?ìu†qÆ §?ìu†ltp?ìudB?T&?ìud<íQS?ìuB.Vî?ìuB ÜZ€?ìuá“"|?ìuÜA,r?ìtý°l¾œ?ìtý«Î÷?ìtÛ~»ÀF?ìtÛyi×?ìt¹L€¼d?ìt¹G.Ùˆ?ìt—»Ã„?ìt—iç ?ìttækÝz?ìttág?ìtR²‘Ÿ8?ìtR­?ÏŠ?ìt0~.!î?ìt0xÜX¥?ìtI>à‘?ìtCí­?ìsìÅüþ?ìsìt@€?ìsÉÝÃp?ìsÉØqMW?ìs§§4ûê?ìs§¡ãL6?ìs…p?ìs…jÌ^Ñ?ìsc8|«Ç?ìsc3+Þ?ìsAOîþ?ìs@úþR{?ìsÇšw–?ìsÂHáx?ìrüŽYÀñ?ìrü‰1:?ìrÚTŽ_ï?ìrÚO<Öž?ìr¸:uü?ìr¸èó?ìr•ß\‡?ìr•Ú ?ìrs£ôr?ìrsž¢©S?ìrQhÜf?ìrQb±l®?ìr/+†½Â?ìr/&5Tq?ìr î€XV?ìr é.õk?ìqê°òQo?ìqê« ôë?ìqÈrÙ ?ìqÈm‡Æ‚?ìq¦46Vó?ìq¦.å=?ìqƒõ ú?ìqƒï¸Ç«?ìqaµ5Ô{?ìqa¯ä‘“?ìq?tºšV?ìq?oi]Õ?ìq3µJº?ìq.d¡?ìpúò#å°?ìpúìÒµþ?ìpØ°ƒÅ?ìpت¶Z{?ìp¶m_±C?ìp¶hŽ`?ìp”*-œ?ìp”$Ûæ!?ìpqæo%?ìpqáî?ìpO¢%ÆB?ìpOœÔ¶—?ìp-]QYZ?ìp-XP?ìp ñÍË?ìp  Êð?ìoèÒ;õ?ìoèÌ·?‚?ìoÆ‹’¤F?ìoƆA®ï?ìb¿ÈÙƒ6?ìb¿ÃŠüœ?ìbMOÕ?ìbHTõ?ìbzÑ;—k?ìbzËíµ?ìbXTàH?ìbXOOm?ìb5×wBï?ìb5Ò(Ö?ìbYÈR†?ìbTyì)?ìaðÛÒ?ìaðÖ@³ç?ìaÎ\Í¢¤?ìaÎWI,?ìa«Ý‚Ò?ìa«Ø3°Í?ìa‰]­ÐF?ìa‰X_ƒ´?ìafÝP•n?ìafØOO?ìaD\kiŒúîƒ?ì_>‡­¥?ì_Cƒž?ì_ýõ«6?ì^ùyòX?ì^ùsµ e?ì^Öî7@/?ì^Öèét±?ì^´bàÿ÷?ì^´]“:î?ì^‘×ɦ?ì^‘Ñ´ ?ì^oJ˜%?ì^oEJma?ì^L½£¡ ?ì^L¸Uïd?ì^*0&VÑ?ì^**Ø«Ÿ?ì^¢Qµ?ì^œÑ¬ø?ì]圴?ì]å?þm?ì]„sR-?ì]Â%º\?ì]ŸôÎx?ì]Ÿï€æ©?ì]}dž›ç?ì]}_Q?ì]ZÓæZ—?ì]ZΘÖ(?ì]8B¤<œ?ì]8=V¾¤?ì]°×M?ì]«‰Õ›?ì\ó‚(¾?ì\ó4·³?ì\Ћ¢S+?ì\ІTè–?ì\­ø8á~?ì\­òë}`?ì\‹dFèÊ?ì\‹^ù‹#?ì\hÏËt ®?ìY¡ˆO?ìYœ;RÞ?ìXäÿ!õ2?ìXäùÕF;?ìXÂ\2“¹?ìXÂVåë?ìX}º/?ìX}m““?ìXZp0Ê6?ìXZjä5&?ìX7Ë[ý?ìX7ÅÒÍh?ìX%†øÍ?ìX :p±?ìWòd¤0?ìWòz"?ìWÏغvÀ?ìWÏÓmû™?ìW­1ˆ€¨?ìW­,< ü?ìWŠ‰°9‘?ìWŠ„cË`?ìWgá4)?ìWgÛç˜q?ìWE8-ë7?ìWE2á‰ú?ìW"ŽžŒ¿?ìW"‰R1ý?ìVÿäƒì–?ìVÿß7˜P?ìVÝ9à¤Ý?ìVÝ4”W?ìVºŽ²½y?ìVº‰fv)?ìV—âúÈn?ìV—Ý®‡š?ìVu6ºÝ©?ìVu1n£P?ìVR‰ðƒ.?ìVR„¤OQ?ìV/Ü›G?ìV/×O®?ìV .½A(?ìV )qB?ìUê€Vd?ìUê{ `ù?ìUÇÑdŽ ?ìUÇÌt?ìU¥!êÕ?ìU¥íc?ìU‚qååØ?ìU‚l™Øâ?ìU_ÁYPÞ?ìU_¼ Jd?ìU=BJG?ìU= öJI?ìU^¡åæ?ìUYUìe?ìT÷¬xµ”?ìT÷§,Â?ìTÔùÅÅ’?ìTÔôyÙ ?ìT²Fˆ¤ ?ìT²A<½ÿ?ìT’Ãhd?ìTwˆÕ?ìTlÞuå?ìTlÙ)EÓ?ìTJ)žYY?ìTJ$R†Ä?ìT't<ž³?ìT'nðÒ›?ìT¾S Ô?ìT¹D:?ìSâà%J?ìSâ”f-?ìS¿Pä?ìS¿K˜H|?ìSœ™_°Ö?ìSœ”þ´?ìSyáQ=k?ìSyÜ‘Æ?ìSW(¹ºh?ìSW#nA?ìS4oš½?ìS4jO]?ìSµòNL?ìS°¦¶!?ìRîûÀ~E?ìRîötì—?ìRÌA`h?ìRÌ;ºÕ9?ìR©…Âú?ìR©€wþI?ìR†Éöò¨?ìR†Ä«tu?ìRd ¢Æ0?ìRdWN|?ìRAPÆ 1?ìRAKz˜ü?ìR“_Ëi?ìRŽ`²?ìQûÕr r?ìQûÐ&¼:?ìQÙû”a?ìQÙ°6¨?ìQ¶Wü7@?ìQ¶R°à?ìQ“˜tš²?ìQ““)I÷?ìQpØdM#?ìQpÓç?ìQNË^ž?ìQN€á?ìQ+VªâR?ìQ+Q_¥?ìQ•å?ìQ¶®\?ìPåÒÎòU?ìPå̓Â?ìPäò?ìPà Ê{3?ìP LÒ‚$?ìP G‡^å?ìP}‰!¥?ìP}ƒ½æ?ìPZĵæ?ìPZ¿iø¦?ìP7ÿÛ_ú?ìP7úP;?ìP:yÞ?ìP5.ž?ìOòt^”?ìOòoD[Õ?ìOÏ®)??ìOϨÑ-?ìO¬ç!a?ìO¬áÖ£?ìOŠž-?ìOŠS=Ä?ìOgW“†*?ìOgRHm?ìOD.ã?ìOD‰¶L§?ìO!Åç74?ìO!Àœ[x?ìNþüE-¾?ìNþöúXƒ?ìNÜ1ýÝ?ìNÜ,³ä?ìN¹g™?ìN¹aÈÐß?ìN–› 7„?ìN––UuÍ?ìNsÏ¡AÛ?ìNsÊV†¥?ìNQÒõ?ìNPýÐ@?ìN.6 õ$?ìN.0ÀFñ?ìN hq6î?ìN c&=?ìMèšO­…?ìMè• V?ìMÅË¢ßl?ìMÅÆXD¾?ìM¢ümäw?ìM¢÷#PK?ìM€,°K$?ìM€'e½z?ìM]\i ª?ìM]W™ƒ?ìM:‹˜ö9?ìM:†Nu”?ìMº@\ê?ìM´õâÇ?ìLôè]_„?ìLôãëã?ìLÒñ‘¸?ìLÒ§$š?ìL¯Bý„š?ìL¯=³ÿ?ìLŒoC?ìLŒj4âö?ìLi›xáç?ìLi–.ˆR?ìLFÆén‡?ìLFÁŸu?ìL#ñÑz?ìL#ì‡-s?ìL0Ì?ìLåËÀ?ìKÞFÉW?ìKÞ@¼‰Î?ìK»oU/F?ìK»j öA?ìK˜˜NÒ?ìK˜’ÏP?ìKuÀU½­?ìKu» ‘¯?ìKRè ‘'?ìJË Ü?ìJſݵ?ìJ^ïéÐ?ìJ^é¶ññ?ìJ<pÕ}?ìJ< &ä#?ìJ5WªÄ?ìJ0 ¿î?ìIöW¶ü¬?ìIöRm[?ìIÓyWø?ìIÓtCz+?ìI°šÜOœ?ìI°•’xU?ìI»¢ñm?ìI¶Y «?ìIjÛáÎR?ìIjÖ˜?ìIGû—ô.?ìIGöN0v?ìI%Äñö?ìI%{4Ã?ìI9k\k?ìI4!¥¾?ìHßW‰??ìHßR?e?ìH¼u*X?ìH¼oÔ€µ?ìH™’,±c?ìH™ŒãF?ìHv®³a»?ìHv©iÅ$?ìHSÊ°ÈŠ?ìHSÅg2y?ìH0æ'zG?ìH0àÝê»?ìH?ìH ûÌ{?ìGë{õ?ìGë2r›?ìGÈ5ZßÅ?ìGÈ0cÌ?ìG¥N±ÒH?ìG¥Ih\Ö?ìG‚g€[²?ìG‚b6ìÆ?ìG_ÈM?ìG_z&ç?ìG<—‰{H?ìG<’@i?ìG®Â-ã?ìG©xÒ‹?ìFöÅs7ß?ìFöÀ)ã ?ìFÓÛœ©&?ìFÓÖSZÛ?ìF°ñ?“2?ìF°ëöKn?ìFŽZÈ?ìFŽÁŒ?ìFkí j?ìFk£Îµ?ìFH.ù7½?ìFH)°?ìF%Ba&c?ìF%=ø¼?ìFU%™H?ìFOÜr)?ìEßga«B?ìEßbŠ«?ìE¼ykÿ?ìE¼sÌQð?ìE™Š?éº?ìE™„öÖ2?ìEvšá´é?ìEv•˜§é?ìESªúÝ:?ìES¥±ÖÃ?ìE0ºŠñ¸?ìE0µAñÉ?ìE É’?ìE ÄI´?ìDêØ ?ìDêÒÇ+A?ìDÇæU…?ìDÇà¼i/?ìD¤ór¹B?ìD¤î)Óu?ìD‚WØd?ìDûù?ìD_ ³@Ï?ìD_jh?ìD<†x?ìD<=1E?ìD#Ñ1P?ìDˆe¥?ìCö.“X:?ìCö)J“?ìCÓ8͉%?ìCÓ3„Ê?ìC°BS.?ìC°=6›?ìCK¨Eƒ?ìCF_“ý?ìCjTHoê?ìCjNÿÄî?ìCG\bdÀ?ìCGWÀN?ìC$có0?ìC$^ª’¥?ìCjùâ?ìCe±J³?ìBÞqyŒ ?ìBÞl0ûK?ìB»wq=k?ìB»r(³ ?ìB˜|à¶?ìB˜w—€õ?ìBuÆò»?ìBu|~u„?ìBR†%–¼?ìBR€Ý ?ìB/‰üw?ìB/„³T?ìB JÀ?ìB ˆV†?ìAédþ?ìAéŠÉð?ìAÆ’OþÖ?ìAÆ¢S?ìA£”Ê?ìA£Ž¾ÇÒ?ìA€•5ÐÌ?ìA€í_?ìA]•Ý(f?ìA]”ß„?ìA:•ý´°?ìA:µrY?ìA•”ƒ*?ìALG^?ì@ô”£¥?ì@ô[oß?ì@Ñ“+ª¥?ì@Ñã{ð?ì@®‘,#?ì@®‹ãúñ?ì@‹Ž¥ž•?ì@‹‰]|÷?ì@h‹—,*?ì@h†O?ì@EˆÛ ?ì@E‚¸Ç?ì@"ƒá¼%?ì@"~™®*?ì?ÿ<^ü?ì?ÿyôW?ì?ÜzÒ½?ì?ÜtÆÑÚ?ì?¹tY§t?ì?¹o­?ì?–ním?ì?–hÕù£?ì?sg[´Z?ì?sbÇ?ì?P`ŠË?ì?PZȤ?ì?-X>}?ì?-Rö¡X?ì? Oå¨1?ì? JΘ?ì>çG=?ì>çA½;1?ì>Ä=ÃÊ?ì>Ä8U÷K?ì>¡3®Ø@?ì>¡.gN?ì>~)9[¼?ì>~#ñœW?ì>[=^?ì>[õ¥(?ì>8¸î.?ì>8 q;ã?ì>­œŒ?ì>eðÏ?ì=ñúù?ì=ñôÔSÑ?ì=Îí ?ì=Îç»tf?ì=«ßbzX?ì=«ÚâD?ì=ˆÑ;¿ ?ì=ˆËô-…?ì=eÂqÈ?ì=e½*=?ì=B³ÏC?ì=B­½JØ?ì=£/F?ì=ȱi?ì<ü’’wi?ì<üK?ì<ÙŒ·e?ì<Ù|EF¥?ì<¶oÿ~Ñ?ì<¶j¸Ÿ?ì<“]é]?ì<“X¡ù{?ì?ì;Ààï ó?ì;Ðf†?ì;ËZÊ?ì;zº×e?ì;z´Ç¨8?ì;W£/Ax?ì;WèÛ?ì;4‹Æ^Œ?ì;4†<~?ì;sÖ½å?ì;n¢g?ì:î[^ïK?ì:îVÚ\?ì:ËB^‚z?ì:Ë=t?ì:¨(׺?ì:¨#þë?ì:…Ç ü?ì:… € ½?ì:aô.¡Þ?ì:aîç§/?ì:>Ù×r?ì:>ÓÈãS?ì:½h=?ì:¸!Ou?ì9ø¡8áê?ì9ø›ñúì?ì9Õ„‚Õb?ì9Õ;ôô?ì9²gD§Š?ì9²aýÍ­?ì9I~h?ì9D7”¸?ì9l+1¥Ö?ì9l%êÙ?ì9I \ñ,?ì9I+?ì9%ìÿÙæ?ì9%ç¹L?ì9Íîƒ?ì9ÇÖ5z?ì8߬±?ù?ì8ߧj?ì8¼‹¾];?ì8¼†w±T?ì8™jEÕ?ì8™dÿ/Á?ì8vHD8ø?ì8vBýš4?ì8S%»Á?ì8S t?ì80«€|?ì8/ýdîÛ?ì8 ߃T?ì8 ÙÍøE?ì7éºõ°=?ì7鵯+À?ì7Æ–P•è?ì7Æ‘ ý?ì7£q$D?ì7£kÝÍ7?ì7€Kỏ?ì7€F)[Â?ì7]%5»·?ì7]ïQƒ?ì79þt# ?ì79ù-¿~?ì7×+j?ì7ÑäµY?ì6ó¯\?ì6óªÁ”?ì6ЇF?ì6нö%?ì6­^%ª~?ì6­Xßa%?ì6Š4ÁT&?ì6Š/{`?ì6g ÕÓä?ì6g—±?ì6Càb:>?ì6CÛž?ì6 µj“V?ì6 °$dI?ì5ý‰ëq×?ì5ý„¥I^?ì5Ú]ãfÜ?ì5ÚXDö?ì5·1VýÙ?ì5·,â†?ì5”BJ8?ì5“þü5y?ì5pÖ§Y¼?ì5pÑaK‘?ì5M¨†;ý?ì5M£@4f?ì5*yß ?ì5*t˜ÿœ?ì5J±7È?ì5Ek=X?ì4äüñ?ì4ä¶ý??ì4ÀêÁ¼Î?ì4Àå{φ?ì4¹ãNË?ì4´h?ì4zˆdÔ­?ì4zƒô?ì4WV]ì^?ì4WQÔ?ì44#Î¥]?ì44ˆÒg?ì4ð¸U?ì4ërÀó?ì3í½¶?ì3í·ÓðJ?ì3ʈò/#?ì3ʃ¬oë?ì3§TD„Ø?ì3§NþÌ5?ì3„É?ì3„É?ì3`éPŒ?ì3`ä à•?ì3=³ \…?ì3=­Ä·¢?ì3|?ì/†1¸«2?ì/†,s¸0?ì/bì§?ì/bçb?ì/?§ µä?ì/?¡ÈÐ?ì/`ï?ˆ?ì/[ª`O?ì.ùJ7A?ì.ù^ ?ì.ÕÓ-ˆ?ì.ÕÍÙ[€?ì.²‹l/ä?ì.²†'dt?ì.C2ÐÈ?ì.=î ñ?ì.kúsœ¹?ì.kõ.Þ{?ì.H±,§>?ì.H«çï™?ì.%g`zÈ?ì.%bÉ»?ì. «ï?ì.È{?ì-ÞÒ3Å?ì-ÞÌï!-?ì-»†ÓZÎ?ì-»Ž½?ì-˜:íxˆ?ì-˜5¨áà?ì-tî/×?ì-té<ŸÈ?ì-Q¡’d?ì-QœIî?ì-.T­”?ì-.NÏ*¸?ì-  ”?ì- БR?ì,ç·Gd?ì,ç²JѼ?ì,ÄhƒhX?ì,Äc>ùJ?ì,¡ñ?ì,¡¬˜?ì,}ÈØ!?ì,}Ó¿A?ì,Zx:T…?ì,ZrõùE?ì,7'­?ì,7!ÒXp?ì,Õl<¯?ì,Ð'î£?ì+ðƒ;Û?ì+ð}öËi?ì+Í0i*ä?ì+Í+$ê ?ì+©Ü÷+¢?ì+©×²ñe?ì+†ˆûøÉ?ì+†ƒ·Å'?ì+c4yœá?ì+c/5oÚ?ì+?ßp¥ø?ì+?Ú,Œ?ì+‰à%Ò?ì+„œ?ì*ù3È+Å?ì*ù.„?ì*ÕÝ)Eâ?ì*Õ×å3H?ì*²†ˆ‹?ì*²€½|?ì*.Tz3?ì*)tÐ?ì*kÖ1Ñ?ì*kÐÛ3 ?ì*H}b=|?ì*HxEP?ì*%$§L?ì*%Ûµ¼?ì*ÊT†r?ì*Å›}?ì)Þpç«?ì)Þj¾S?ì)»)Ôó?ì)»å÷7?ì)—¹Êbó?ì)—´†‹Ó?ì)t]⣿?ì)tXžÓ;?ì)Quá?ì)Pü1Uù?ì)-¤€jÅ?ì)-Ÿ<§z?ì) G*?ì) AÀX|?ì(æé+¥?ì(æã½u“?ì(Êw½‡?ì(Ã…4?ì( +f^k?ì( &"µ“?ì(|ËÏø?ì(|Æ‹u½?ì(Yk°üb?ì(Yfm`Ä?ì(6 Ÿ\?ì(6Ç [?ì(©ß?ì(¤›y,?ì'ïH,J"?ì'ïBèÂ[?ì'Ëåós€?ì'Ëà¯òW?ì'¨ƒ3•ø?ì'¨}ðl?ì'…îWÎa†?ì'>RŠúÔ?ì'òôûì?ì'í±›Ø?ì&÷“ßV?ì&÷ˆP…à?ì&Ô'­“c?ì&Ô"j@Š?ì&°Á@¬?ì&°»ý_Ø?ì&ZM8Ä?ì&U ó(?ì&iòÔE¬?ì&i푯?ì&FŠÔfã?ì&F…‘.„?ì&#"N*8?ì&# øx?ì%ÿ¹AŸ?ì%ÿ³þsä?ì%ÜO®VN?ì%ÜJk1Ë?ì%¸å•\1?ì%¸àR>N?ì%•z÷¼Á?ì%•u´¥|?ì%rÒ‘+?ì%r €†?ì%N¤(`˜?ì%NžåV‘?ì%+7÷A?ì%+2´=¡?ì%Ë?À;?ì%ÅüÃs?ì$ä^kâ?ì$äX¿uº?ì$Àð@O÷?ì$Àêý`o?ì$øè?ì$|µÿ?ì$z* f?ì$z ç*?ì$V£Ö‡?ì$Vž“'Þ?ì$33üsö?ì$3.¹žì?ì$Ãm ?ì$¾Zž£?ì#ìR¸þ(?ì#ìMv6_?ì#ÈáN:4?ì#ÈÜ y ?ì#¥o]0?ì#¥jv?ì#üæo?ì#÷£»?ì#^‰ë-?ì#^„¨Sæ?ì#;hý¶?ì#;&W?ì#¢bêñ?ì# Jë?ì"ô-º+?ì"ô(w…Æ?ì"иq®Ü?ì"г/?ì"­B¤4¤?ì"­=a¨?ì"‰ÌNÊ»?ì"‰Ç E:?ì"fUq€e?ì"fP/…?ì"BÞ ß;?ì"BØËfü?ì"f"ú.?ì"`àˆ?ì!ûí±Ü¯?ì!ûèoq³?ì!ØtºÊ?ì!Øow³p?ì!´û:¾‰?ì!´õø`Ñ?ì!‘4ÜO?ì!‘{ò…9?ì!n¨€K?ì!nf/×?ì!J‹”?ˆ?ì!J†Qõ¶?ì!'ú!s?ì!' ·ÞC?ì!“Ú5:?ì!Ž—ø¬?ì à3ó?ì àðÚ?ì ¼šBØ?ì ¼”Â?ì ™OÕ2?ì ™ ¬Œ?ì užÚ*?ì u˜Ò¸&?ì RS`ú?ì RE™?ì .  úà?ì .šÈæ"?ì =0ú?ì û"ß?ìçŸçœ±?ì皥•9?ìÄ Ã?ìÄÊÂ.?ì ª»^?ì ˜hÁ,?ì}Ââ?ì}€T?ìY™TЪ?ìY”ãÀ?ì6`2?ì6)ë?ì’åØm?ì£øÊ?ìïå<À?ìï £cÀ?ìËŠ^ÊN?ìË…÷ò?ì¨Q°?ì¨Jø?섾(œ?ì„z|cˆ?ì`ù¥“?ì`ôcU#?ì=sæÍ?ì=mÄ/?ìëá/]?ìæŸ~6?ìöd6Ô?ìö^ôVR?ìÒÜãà?ìÒÖÄ@?ì¯SOì?ì¯NNÝ?ì‹Êªë?ì‹ÄÒW?ìh@Q­h?ìh;x?ìD¶ …?ìD°Çû·?ì!+;@þ?ì!%ù¾X?ìýŸçì?ìýš¦p?ìÚÓ?ìÚÍ¢x?춇¯×ê?춂ni4?ì’úË´Ò?ì’õŠLÁ?ìomaÂR?ìoh `ç?ìKßr`?ìKÚ12š?ì(Pþ%6?ì(K¼Ñ?ì¶?ì¼ÂP%?쮼Ô?쮶ÂU?ì‹ÄÒ$?ì‹„*û?ìg‚ÿoµ?ìg}¾Ï4?ìCåµÛ$?ìCàuAL?ì Gå2û?ì B¤ŸÌ?ìü©Žþ‹?ìü¤Nr?ìÙ ²Ï~?ìÙrI ?ìµkO<Æ?ìµf½‘?ì‘Ëeͦ?ì‘Æ%U?ìn*÷‹é?ìn%·?ìJŠ‘0?ìJ„Â%ö?ì&è‡iò?ì&ãGb?ìF‡F?ìAG?_?ìߤJI?ìßž¿ó ?ì¼óò±?ì»û³¢?ì˜]b(A?ì˜X!ÞW?ìt¹I‚.?ìt´ >í?ìQ«‡p?ìQkJÙ?ì-oˆÄh?ì-jHŽ{?ì ÉßS?ì ÄŸ#Ï?ìæ#°ºS?ìæp‘º?ìÂ|üŒ?ìÂw¼j?ìžÕÂ×;?ìžÐ‚»÷?ì{.«?ì{(Öz?ìW…¿¡?ìW€²?ì3Üó±i?ì3׳ª%?ì3£ü‹?ì.cûò?ìì‰Î‡?ìì„Ž•˜?ìÈßsö¨?ìÈÚ4d?ì¥4“F²?ì¥/SZ?ì‰.@?ìƒî R?ì]ÝBÌø?ì]Øíµ?ì:0Ó!d?ì:+“HÍ?ìƒÝ›8?ì~ÉL?ìòÖcCÒ?ìòÑ#x’?ìÏ(c0?ìÏ##k‚?ì«yßcˆ?ì«tŸ¥Ÿ?ì‡ÊÔþ´?ì‡Å•Gw?ìdF?ìdTƒ?ì@k3Ò?ì@eóXí?캚×?ìµZì?ìù |»D?ìù=·?ìÕWÚI?ìÕRš{h?ì±¥²¡?ì± sÏ?ìóüŽ?ìíÆt?ìj?Õ- ?ìj:•«2?ìFŒGž?ìF†ßÌo?ì"×äØ]?ì"Ò¥cÜ?ìÿ#%qp?ìÿæ›?ìÛmážò?ìÛh¢7Ê?ì·¸ù"?췲ؘ§?ì”Êÿî?ì“ü‹¦ ?ìpJøQ´?ìpE¸þ”?ìL“¡ñ\?ìLŽb¤é?ì(Û«Å*?ì(Öld?ì#ÕŽ?ì×–v?ìáiüÂÚ?ìád½Šo?ì½°\%B?콫ó†?ì™ö6…?ì™ðöÚv?ìv;ˆûï?ìv6I׎?ìR€VŽ?ìR{pd?ì.ÄžN ?ì.¿_7 ?ì `Çœ?ì !·E?ìçKœX?ìçF] °?ìÃŽR<“?ìÉ9š?ìŸÐ‚Ìi?ìŸËCÐ?ì|,Û,?ì| íå?ìXSQî@?ìXNÿR?ì4“ðž4?ì4Ž±µõ?ìÔ ó“?ìÎË?ìíÊ?ìí^(é?ìÉRªZ”?ìÉMk†c?쥑3ùå?쥋õ,c?ìÏ7ý§?ìÉù6Ô?ì^ ´ì?ì^uÁÉ?ì:I­{‚?ì:DnÂ?ì† ?ì€áZ>?ì ò Â,?ì ò¼Î?ì Îýuœ¸?ì Îø6÷S?ì «8W¿z?ì «3 Æ?ì ‡r´¯z?ì ‡mvv?ì c¬Œ{²?ì c§Mê]?ì ?åß3?ì ?à ¨v?ì ¬h?ì mä?ì øVõŸM?ì øQ·" ?ì ÔŽ¸xÆ?ì Ô‰z3?ì °ÅöyP?ì °À¸ m?ì Œü¯3H?ì Œ÷pÊ?ì i2⵪?ì i-¤S)?ì Eh‘p?ì EcR³ ?ì !¼Aä?ì !˜}ìÅ?ì ýÒap„?ì ýÍ#"?ì Ú£x?ì ÚC[»?ì ¶:éº?ì ¶4Þ¨¯?ì ’m3RF?ì ’gõì?ì nŸÄo–?ì nš†;î?ì JÑÑÆ4?ì JÌ“™=?ì 'Ys ?ì &þLÆ?ì 4\ ?ì /â ?ì ßdÛrì?ì ß_Z ?ì »”Õãê?ì »—Ñ»?ì —ÄJj³?ì —¿ _6?ì só< ?ì síýüB?ì P!©@Œ?ì PkBs?ì ,OÂÚ?ì ,JRËs?ì |õ*?ì w·v?ì ä©Ô$¼?ì 䤖:º?ì ÀÖ-´5?ì ÀÐïÐæ?ì 0 ?ì œüÆT?ì y-U:ø?ì y(e?ì UX"Wn?ì URäˆ8?ì 1‚k ?ì 1}-P?ì ¬0†E?ì ¦òÄu?ìéÕp½ë?ìéÐ3Î?ìÅþ.Î?ìN‘G?ì*ªGä˜?ì*¥ <„?콆3"?ì¸I‘Å?ìâÐ@1.?ìâË–‰?ì¾âuíš?ì¾Ý9Y¬?ìšô&ûP?ìšîên?ìwTÜî?ìwVp?ìSý5À?ìSÀµú?ì/&!ˆ_?ì/ åQ?ì 5Â_„?ì 0…í-?ìçDßN"?ìç?¢âƒ?ìÃSvs¤?ìÃN:¾?ìŸaŠÆ?ìŸ\Ngè?ì{oà¾?ì{iÞ‰I?ìW|%ÚÒ?ìWvéŠ?ì3ˆ®ª-?ì3ƒr`)?ì”±úå?ìu·š?ìë 1Ë"?ìëšõŽ?ìÇ«.)¹?ìÇ¥ñóß?죵¥6i?죰iH?쿘ï4?ìº\ÆÌ?ì[É bø?ì[ÃÍAI?ì7Ñõ© ?ì7̹Ž?ìÚ^L ?ìÕ"7Ð?ëÿïâBß?ëÿïÝÑœ?ëÿËé£ìæ?ëÿËägæ?ëÿ§ð€?ëÿ§ëD?ëÿƒöÚ@â?ëÿƒñžGŒ?ëÿ_ü±ú?ëÿ_÷u%^?ëÿ<錿?ëÿ;ü­ Ý?ëÿ…Ø?ëÿI+±?ëþô š_ç?ëþô^z?ëþÐ+òþ?ëþÐðK?ëþ¬8án?ëþ¬ ýu?ëþˆ¿KS?ëþˆƒ?ëþdÁ.?ëþd…j|?ëþ@>˜ ?ëþ@ÛV?ëþ7˜a?ëþûâR?ëýøªO?ëýønŸ±?ëýÔ˜¹6?ëýÔ]?ëý°j ?ëý°ÆÈ.?ëýŒçp9?ëýŒ«Õ?ëýhHÑ“?ëýh =,?ëýD$®†?ëýD é Ú?ëý {Ö?ëý ?Žæ?ëüü M O?ëüü?ëüØ š£­?ëüØ_*4?ëü´cç ?ëü´(tã?ëü¨çØ?ëüûm{Ö?ëükûi7Š?ëükö-ÒE?ëüGõ£îv?ëüGðhì?ëü#ï[ M?ëü#ê±?ëûÿèŸÌ?ëûÿãRN»?ëûÛá:NJ?ëûÛÛÿõ?ëû·Ùdƒº?ëû·Ô)@!?ëû“Ñ `ü?ëû“ËÏ$ ?ëûoÈ+yT?ëûoÂðC4?ëûK¾ÈÒX?ëûK¹¢õ?ëû'´á„?ëû'¯¥ßÞ?ëûªu!h?ëû¥9ÿ~?ëúߟ…§!?ëúßšJ‹õ?ëú»”± ?ëú»ŽÖ0?ëú—ˆË?ëú—‚Þ½N?ëús{†?ëúsvb¨?ëúOnnŽ?ëúOibnW?ëú+a8?ëú+[Þ¾?ëúSƒ?ëúMÖF?ëùãD…Q ?ëùã?Je¢?ëù¿5tÚ?ëù¿09«™?ëù›%á<²?ëù› ¦^/?ëùwÈûO?ëùwŽ#Š?ëùS,Ò?ëùRÿò ?ëù.ôA—?ëù.îÓwO?ëù âkkh?ëù Ý0§Ý?ëøæÐDÙ’?ëøæË Æ?ëø½š?ëø¸_i‚?ëøžªlB¤?ëøž¥1“U?ëøz–¹ßÏ?ëøz‘7>?ëøV‚„w‹?ëøV}IÕ¸?ëø2mË"!?ëø2h‡?ëøXîO?ëøSSYû?ë÷êBÎ\v?ë÷ê=“Îá?ë÷Æ,‹ ´?ë÷Æ'P‚Ý?ë÷¢ÄË?ë÷¢‰„´?ë÷}þyר?ë÷}ù?^P?ë÷Yæ«š¼?ë÷Yáq($?ë÷5ÎZÎ>?ë÷5É be?ë÷µ†Šž?ë÷°L%…?ëöíœ.c~?ëöí–ô$?ëöÉ‚RâÈ?ëöÉ}‹.?ëö¥gõˆ’?ëö¥b»7¸?ëöMò;?ëöGÚ¨!?ëö]1°³r?ëö],vp?ëö9¯|i?ëö9u?Ï?ëöù¿?ëöó׉'?ëõðÛîó¤?ëõðÖ´Ä‹?ëõ̾Hš?ëõ̹q¿?ëõ¨ Ô¯?ëõ¨šâ³?ëõ„l¨ ?ëõ„|2I?ëõ`b8ž?ëõ`\þ‰ë?ëõ?ëó®¾6-8?ëóŠƒÇ¬?ëóŠ˜J h?ëófw§?ëófqÚ]&?ëóBP dß?ëóBJæ¶ ?ëó(¨R?ëó#nª ?ëòú¬Þ{?ëòùûs=@?ëòÕØ-#?ëòÕÒóˆŸ?ëò±¯*$)?ëò±©ðs?ëò…¢é?ëò€hw÷?ëòi[—´ú?ëòiV^.Ê?ëòE1ç"?ëòE+Îgµ?ëò!ô?ëò!º¡×?ëñüÚ^Hë?ëñüÕ$×?ëñØ®C "?ëñØ© 4þ?ëñ´¥Ÿ&?ëñ´|l:Å?ëñTƒÙÎ?ëñOJ|0?ëñl&ÞÙt?ëñl!¥‚›?ëñGøµ·1?ëñGó|g?ëñ#Ê ñä?ëñ#ÄШ‘?ëðÿšÚ'â?ëðÿ• åT?ëðÛk']J?ëðÛeî!?ëð·:ñ ¬?ëð·5¸k¥?ëð“ 7?ëð“þb>?ëðnØù;q?ëðnÓÀò?ëðJ§8šì?ëðJ¡ÿz2?ëð&tôÈ ?ëð&o»®*?ëðB,ÜT?ëð<óÉ"?ëïÞãK|?ëïÞ ª??ëï¹ÛÉ•?ëï¹ÕÛÃì?ëÃOæ?ëï•¡ŠQ?ëïqqïâM?ëïql¶ê.?ëïM<˜*9?ëïM7_8ß?ëï)¾ Ò?ëï)…6=?ëïÐaZ?ëïË(v>?ëîà™iò?ëîà”HŒç?ëî¼biô?ëî¼\䓯?ëî˜*7ͤ?ëî˜$þþ$?ëîsñιJ?ëîsì•ð?ëîO¸áÁ?ëîO³¨ÿ ?ëî+rݪ?ëî+z:"z?ëîE€®8?ëî@GùÏ?ëíã »à?ëíãÓ?ëé~íÈUÁ?ëéZ§çÊ%?ëéZ¢¯õq?ëé6\Lv|?ëé6W¨‘?ëé-Ê‚?ëé ö`?ëèíËԳ?ëèí¾TZ?ëèÉvf)\?ëèÉq.oÌ?ëè¥(¾¿º?ëè¥#‡ ô?ëè€Ú“½‚?ëè€Õ\…?ëè\‹å14?ëè\†­Œ?ëè8<³£€?ëè87|?ëèìÿ"Û?ëèçÇ‹ÃëÒ0?ëä>¾´ñÿ?ëäeÔ"e?ëä`I?ëãö#-?ëãöìK•?ëãѧíâ€?ëãÑ¢·µ?ëã­H4}½?ëã­Bý¸¾?ëãˆçøå©?ëãˆâÂ'x?ëãd‡8ÇT?ëãd‚ï?ëã@%õžŸ?ëã@ ¾î?ëãÄ/yÞ?ëã¾øÐ?ëâ÷aås¿?ëâ÷\®ÐÂ?ëâÒÿm?ëâÒùáx>?ëâ®›Çj??ëâ®–ÔÝ?ëâŠ7óýT?ëâŠ2½nÀ?ëâeÓœèq?ëâeÎf`«?ëâAn³´?ëâAiŒ2»?ëâ dyô?ëâ-ÿÉ?ëáø£‚ÃN?ëáøžLOñ?ëáÔ= `?ëáÔ7èžÑ?ëá¯Ö7ó:?ëá¯Ñy?ëá‹n͉;?ëá‹i—*I?ëágßÛÁ?ëág©ƒ?ëáBžorÚ?ëáB™9!„?ëá5zïÈ?ëá0D¥A?ëàùÌÁa?ëàùÆÎ}©?ëàÕb ;?ëàÕ\ÔÒQ?ëà°÷Ža]?ëà°òX+B?ëàŒŒŽÆ,?ëàŒ‡X–à?ëàh! Å£?ëàhÖ&?ëàCµ å?ëàC¯Ïì8?ëàH~Ö?ëàCGå÷?ëßúÛrÆA?ëßúÖ<²2?ëßÖmäl€?ëßÖh®_@?ëß±ÿÔèf?ëß±úžáö?ëß‘AèA?ëߌ è ?ëßi",m¤?ëßiötÓ?ëßD²” T?ëßD­^S?ëß BzBf?ëß =DW5?ëÞûÑÛÈD?ëÞûÌ¥ãã?ëÞ×`»†±?ëÞ×[…© ?ëÞ²ïw?ëÞ²éã;¶?ëÞŽ|ó†à?ëÞŽw½¶ï?ëÞj Kåc?ëÞjB?ëÞE—!ÂÓ?ëÞE‘ìƒ?ëÞ!#v ’?ëÞ!@e?ëÝü¯H“r?ëÝüªÞÃ?ëÝØ:—Cã?ëÝØ5a–?ëݳÅdŸµ?ëݳÀ.ø¨?ëÝO¯HÔ?ëÝJy¨˜?ëÝjÙwM°?ëÝjÔA´E?ëÝFb½6?ëÝF]‡£|?ëÝ!ë‚L?ëÝ!æLwƒ?ëÜýsÃd?ëÜýnߊ?ëÜØûƒMÓ?ëÜØöMÏ­?ëÜ´‚ÁT1?ëÜ´}‹ÜÜ?ëÜ } –?ëÜGœ?ëÜk¶…j?ëÜkŠ¹?ëÜGnFo?ëÜG8ã?ëÜ"š£äª?ëÜ"•nˆ?ëÛþXa6?ëÛþ# û?ëÛÙ£Š^]?ëÛÙžUó?ëÛµ':cå?ëÛµ"N?ëÛªhÝ?ëÛ¥2Æ?ëÛl-´O?ëÛl'àz]?ëÛG¯@¢¢?ëÛGª o‚?ëÛ#0èàF?ëÛ#+³³ù?ëÚþ±÷Òê?ëÚþ¬Â­o?ëÚÚ2lhx?ëÚÚ-7IÐ?ëÚµ²]l2?ëÚµ­(T\?ëÚ‘1ËÞá?ëÚ‘,–Íß?ëÚl°¶bì?ëÚl«X½?ëÚH/rZ?ëÚH)énþ?ëÚ#­\?ëÚ#§ÏÔ?ëÙÿ*fj?ëÙÿ%1 µ?ëÙÚ§E"A?ëÙÚ¢3`?ëÙ¶#¡?ëÙ¶l§?ëÙ‘ŸzÛå?ëÙ‘šEúª?ëÙmÑð?ëÙmœ<‰?ëÙH•¤Ç¥?ëÙHoô?ëÙ$õƒ ?ëÙ$ À¶L?ëØÿ‰ÃW[?ëØÿ„Ž‘p?ëØÛÌ?ëØÚýÚ ë?ëض{ØhU?ëضv£°?ëØ‘ôÜÐ?ëØ‘îé+b?ëØmká•m?ëØmf¬êÓ?ëØHã"4ý?ëØHÝí‘8?ëØ$YßÉÀ?ëØ$T«,Ï?ë×ÿÐT1?ë×ÿÊæ¾?ë×ÛEÔâƒ?ë×Û@ S;?ë׶» Á?ë׶µ×O?ë×’/¿m'?ë×’*Šë‰?ë×m£ññ4?ë×mž½vk?ë×I ÍÄ?ë×IlYÑ?ë×$ŠÍõZ?ë×$…™ˆ?ëÔ’M ¼=?ëÔ’G×Ê.?ëÔm¶’L?ëÔm±^?ëÔI–¾@?ëÔIbÙß?ëÔ$ˆw5?ëÔ$‚晫?ëÓÿðÐÕ?ëÓÿêçú#?ëÓÛWšÙk?ëÓÛRg ?ëÓ¶¾™‚›?ëÓ¶¹e¹˜?ëÓ’%÷I?ëÓ’â5?ëÓm‹¾“?ëÓm…Ý??ëÓHðŠØX?ëÓHëW#Ü?ëÓ$U‚èm?ëÓ$PO:É?ëÒÿ¹øý ?ëÒÿ´ÅVT?ëÒÛîJ?ëÒÛºvV?ëÒ¶bB'?ëÒ¶|.© ?ëÒ‘äT$¯?ëÒ‘ß ’l?ëÒmFů3?ëÒmA’#È?ëÒH¨µþp?ëÒH£‚yÞ?ëÒ$ $/4?ëÒ$ð±z?ëÑÿk2±?ëÑÿeÞ»Ð?ëÑÚËdù!?ëÑÚÆ1‰?ëѶ+>ë?ëѶ%êÕ»?ëÑ‘ŠU$?ëÑ‘…!¬Í?ëÑlé wè?ëÑlãÖj?ëÑHG;Ÿ?ëÑHB¹û?ëÑ#¤êÒ½?ëÑ#Ÿ·„ò?ëÐÿá?ëÐþüäš?ëÐÚ^ÁÎá?ëÐÚYŽŽÉ?ëеºên?ë嵶Û/?ëБÎr?ëБ\œ ?ëÐlq²’o?ëÐllfä?ëÐGÌTPù?ëÐGÇ!,H?ëÐ#&s5®?ëÐ#!@×?ëÏþ€N±?ëÏþzÜ7³?ëÏÙÙ*è?ëÏÙÓ÷Å?ëϵ1Â)¨?ëϵ, _?ëω×%?ëÏ„¤#?ëÏkáj÷Ù?ëÏkÜ7üE?ëÏG8|E?ëÏG3IP_?ëÏ" ¢Õ?ëÏ"‰×´ö?ëÎýåyå?ëÎýßå’à?ëÎÙ:¢Œ¤?ëÎÙ5o¬{?ëδ«CÚ?ëδŠxj‹?ëÎä2­ ?ëÎÞÿÛ,?ëÎk87ç?ëÎk3m?ëÎF‹ºþ0?ëÎF†ˆ9s?ëÎ!Þ¼ò7?ëÎ!ÙŠ4U?ëÍý1;ïJ?ëÍý, 8C?ëÍ؃8ôŠ?ëÍØ~D^?ëͳԵö?ëͳςW§?ëÍ%¯1È?ëÍ |T?ëÍjv'®?ëÍjpô?ëÍEÆ9?ëÍEÀë¤[?ëÍ!“¤B?ëÍ!ab?ëÌüd†óå?ëÌü_Tlà?ëÌײø6*?ëÌ׭Ŷ?ë̳èâ^?ë̲û¶i?ëÌŽNV4U?ëÌŽI#Áå?ëÌi›C„Ú?ëÌi–F?ëÌD箈.?ëÌDâ|#w?ëÌ 3˜µ?ëÌ .fW³?ëËû?ëËûyÏÄ?ëËÖÉèåv?ëËÖĶ•V?ë˲O|˜?ë˲3T?ëË^4…‘?ëËYC*?ëËh§—–=?ëËh¢eZ´?ëËCðy­]?ëËCëGx°?ëË8Ú`É?ëË3¨2ú?ëÊú€¹¾¥?ëÊú{‡—´?ëÊÕÈÅ ?ëÊÕÂ楋?ëʱö ?ëʱ ÄÕ?ëÊŒURES?ëÊŒP 2ú?ëÊg›,Ú_?ëÊg•úÎã?ëÊBà‡ÉF?ëÊBÛUĨ?ëÊ%`Æþ?ëÊ .É>?ëÉùi¸Ò%?ëÉùd†ÛD?ëÉÔ­øá?ëÉÔ¨^Þ?ëɯðåÑ#?ëɯë³çý?ëÉ‹3ºáG?ëÉ‹.ˆÿ?ëÉfv7p?ëÉfpÝ\?ëÉA·âi˜?ëÉA²°•?ëÉù4þ?ëÉô0g?ëÈø:óQ?ëÈø4Ö,„?ëÈÓzX†Ž?ëÈÓu&Æ ?ëÈ®º°;?ëÈ®´Ý÷,?ëȉù/›“?ëȉóýéc?ëÈe7ÌÁÿ?ëÈe2›®?ëÈ@uç©£?ëÈ@p¶1?ëȳ€`?ëÈ®NÂí?ëÇöð—l£?ëÇöëeÕð?ëÇÒ-+sÌ?ëÇÒ'ùãù?ëÇ­i>dJ?ëÇ­d ÛV?ëLj¤Ï[ò?ëLjŸÙÞ?ëÇcßÝð±?ëÇcÚ¬u}?ëÇ?k˜«?ëÇ?:$V?ëÇTv¯?ëÇOE:?ëÆõŽ™ß?ëÆõˆÏ3J?ëÆÐÇÿ%?ëÆÐÁןq?ëÆ«ÿßr?ëÆ«ú\†ž?ëƇ7‘(Þ?ëƇ2_Öê?ëÆboÙ`?ëÆbiâŽL?ëÆ=¦ú?ëÆ= âÚÇ?ëÆÜ’¯?ëÆ×aB\?ëÅô‘aS?ëÅô `*á?ëÅÏH $?ëÅÏBÛâ“?ëŪ}?ëŪwÕgk?ëÅ…±É?ëÅ…¬N§2?ëÅ`åwbü?ëÅ`àFH?ëÅ<íl?ëÅ<¼X?ëÅKáò;?ëÅF°å?ëÄò~U{h?ëÄòy$u?ëÄÍ°F­ã?ëÄÍ«®{?ëĨá¶ÿc?ëĨ܆Ü?ëÄ„¦?ëÄ„ u\?ëÄ_Cà?ëÄ_=áõD?ëÄ:rÿzï?ëÄ:mΗ ?ëÄ¢jF?ëÄ9(F?ëÃðÑTlw?ëÃðÌ#–Y?ëÃËÿ¼ß#?ëÃËúŒç?ëç-¤ÒÏ?ëç(t v?ëÂ[ î?ëÂUÚ,?ëÃ]‡ñ•Ø?ëÃ]‚ÀÛC?ëÃ8´V:?ëÃ8¯%͈?ëÃà9Fp?ëÃÛ™ ?ëÂï œJp?ëÂïk¤‚?ëÂÊ6}¼?ëÂÊ1M?ëÂ¥`Þ!>?ëÂ¥[­‰?뀊½ÿ£?뀅n_?ëÂ[´íˆ?ëÂ[®ìc&?ëÂ6Üûp²?ëÂ6×Êí3?ëÂYe?ëÂ(¢Ê?ëÁí-58?ëÁí(¢€?ëÁÈTX¬?ëÁÈO_éØ?ëÁ£{lUØ?ëÁ£v;íç?ëÁ~¡Ç¶ž?ëÁ~œ—U‘?ëÁYÇ¡!þ?ëÁYÂpÇÔ?ëÁ4ìúüf?ëÁ4çÊ©!?ëÁÔd€?ëÁ ¤?ëÀë6,X?ëÀë0û»Ú?ëÀÆZ7@?ëÀÆTÓø¦?ëÀ¡}\$è?ëÀ¡x+í3?ëÀ| 2qy?ëÀ|›@¨?ëÀW‰ €?ëÀW½Xß“?ëÀ2ä_ Ä?ëÀ2ß.è¼?ëÀ´º?ëÀƒò–?ë¿é&‰‡0?ë¿é!Yqñ?ë¿ÄFÞ”?ë¿ÄA®…¦?ë¿Ÿf´2V?ë¿Ÿa„*à?ë¿z…ðÎÛ?ë¿z€ÀÎK?ë¿U¤•œ?ë¿UŸe¢d?ë¿0·Ìá?ë¿0½‡Ú?ë¿ àYM_?ë¿ Û)a~?ë¾æýxMB?ë¾æøHhG?ë¾ÂÉ{?ë¾Âåëd?ë¾62Gn?ë¾1p=?ë¾xQÌåñ?ë¾xL¦?ë¾Slå²é?ë¾Sgµé„?ë¾.‡}«/?ë¾.‚Mè¯?ë¾ ¡”e$?ë¾ œd©Š?ë½ä»)w,?ë½äµùÂx?뽿Ô>UŒ?뽿ϧ¿?뽚ìѧ¹?뽚ç¢Ò?ë½v⌾?ë½uÿ²ì½?ë½Qsg§?ë½QCÎŒ?ë½,3‚à?ë½,.SMÔ?ë½Jð?ë½Dà‰¢?ë¼â`ñî?ë¼âZím‡?ë¼½u¨¦?ë¼½px¡&?뼘Š² f?뼘…‚©Í?ë¼sŸ;óÒ?ë¼sš „ ?ë¼N³D@¥?ë¼N®×Ú?ë¼)ÆËÉ?ë¼)Á›²å?ë¼ÙÑä1?ë¼Ô¢‰5?ë»ßìWV®?ë»ßç(™?뻺þ\hÔ?뻺ù-¦?ë»–à±)?ë»– ±jã?ë»q ãÆD?ë»q´†æ?ë»L1e¶?ë»L,6}‘?ë»'Ag®?ë»'<7Ô?ë»Pè:\?ë»K¹µ?ëºÝ_çü?ëºÝZ¸Ø[?뺸nfÐ?뺸i7³G?뺓|dÄN?뺓w5®_?ëºn‰áæ’?ëºn„²×‹?ëºI–Þ¼?ëºI‘¯³ñ?ëº$£[R¦?ëº$ž,Qp?ë¹ÿ¯WA?ë¹ÿª(F²?ë¹ÚºÓƒl?ë¹Úµ¤?ë¹µÅÎÂ,?ë¹µÀŸÕ°?ë¹ÐI‚`?ë¹ËœÍ?ë¹kÚDI?ë¹kÕjr?ë¹Fã¾­?ë¹FÞÕR?ë¹!ì·Í×?ë¹!çˆüþ?ë¸üõ1Ö?ë¸üðTç?ë¸×ý*6È?ë¸×÷ûsÂ?븳£#“?븲ÿtgw?븎 ›ó?븎m=é?ë¸i<-?ë¸i åä?ë¸D ±?ë¸DÝeR?븄×ä?ë¸V7n?ë·ú"|X$?ë·úM¾™?ë·Õ&ô®?ë·Õ!Ån ?ë·°*ëhR?ë·°%¼Üš?ë·‹.c‹ ?ë·‹)5S?ë·f1[È?ë·f,,“å?ë·A3Óob?ë·A.¤øi?ë·5Ì:Æ?ë·0ʸ?ë¶÷7C.¨?ë¶÷2Å„?ë¶Ò8<D?ë¶Ò3 ¯ ?붭8´&O?붭3…Ë?불8¬iÇ?불3~c?ë¶c8&N•?ë¶c2ø?ë¶>7©ô?ë¶>1Øcf?ë¶5O”?ë¶0!Tw?ëµô3åq?ëµô-鬹?ëµÏ0_4À?ëµÏ+1ô?뵪-$¡Ù?뵪'övø?ëµ…)jT?ëµ…$;ò_?ëµ`%.²?ëµ` ”÷?ëµ; p¦é?ëµ;BË?ëµ3CX?ëµ4%?ë´ñtBh?ë´ñF:"?ë´Ì4(Í?ë´Ì 'r?ë´§sJ?ë´§E Û?ë´‚1Y‹?ë´üf ?ë´\ùo6I?ë´\ôAI³?ë´7ñ,1f?ë´7ëþK¼?ë´èhÏ…?ë´ã:ðÇ?ë³íß#¹Ö?ë³íÙõâ?ë³ÈÕ^Ù†?ë³ÈÐ1¢?ë³£ËÅx?ë³£Åëû€?ë³~ÀT•?ë³~»&QŠ?ë³Yµ Ô¢?ë³Y¯à„?ë³4©Fœ—?ë³4¤çg?볜þz!P?ë°*8óä¦?ë°'Tn8?ë°"'Q}?ë¯à˜?ë¯à ÛyÌ?믺ø<Œþ?믺ó~!?믕ßðt:?믕ÚÃlL?ë¯pÇ%@>?ë¯pÁø?@?ë¯K­Ù›?ë¯K¨¬¡ ?ë¯&”öJ?ë¯&Žâ+?ë¯yÄé?ë¯t—üÖ?ë®Ü^ú“ú?ë®ÜYÍ®»?ë®·C±hš?ë®·>„ŠK?ë®’'臒?ë®’"»°3?ë®m Ÿˆ0?ë®mr·Á?ë®Gî×eI?ë®G骛Ê?ë®"Ñ,¡?ë®"Ìcj?ë­ý³Éuƒ?ë­ý®œ¹ä?ë­Ø•‚×??ë­ØV"‘?ë­³v½Ã?ë­³q‘T?ë­ŽWwök?ë­ŽRKOž?ë­i7³Xú?ë­i2†¹?ë­Doøƒ?ë­DC_˜?ë­ö¬€?ë­ñí…?ë¬ùÕQFu?ë¬ùÐ$»l?ë¬Ô³_oy?ë¬Ô®2ëa?묯횥?묯‹Á~?묊múèÄ?묊hÎrŽ?ë¬eJˆTH?ë¬eE[å?ë¬@&”þ?ë¬@!h•±?ë¬ }F?ë¬üôå?ë«õÝ+Ìo?ë«õ×ÿr?ë«Ð··o|?ë«Ð²‹ÿ?ë««‘Áš¨?ë««Œ•N?뫆kL4ü?뫆fïc?ë«aDV_i?ë«a?* Á?ë«<à'”?ë«<³ïÞ?ë«ôé›+?ë«ï½jh?ëªñÌrÇÊ?ëªñÇFù?ëªÌ£zΆ?ëªÌžN«¨?몧z ~?몧t×ð’?몂P ?â?몂Jà*é?ëª]%“ì¦?ëª] gÞ ?ëª7ú›–¾?ëª7õoª?ëªÏ# ?ëªÉ÷Áí?ë©í£+´?ë©íÿ–†?ë©Èv´p?ë©Èqˆ}Ø?ë©£I¼—Ø?ë©£D¬‘?ë©~DŠò?ë©~¦ž?ë©XîMCr?ë©Xé!f?ë©3¿Õâ”?ë©3ºª '?ë©ÝÿÏ?ë©‹²0V?ë¨éag a?ë¨é\;BÛ?ë¨Ä1o:4?ë¨Ä,Cx¢?먟÷†Z?먞ûËË»?ë¨yÐéÂ?ë¨yÊÕ6?ë¨TžŠ¤?ë¨T™^bî?ë¨/l“{Î?ë¨/ggÖ ?ë¨ :² ?ë¨ 4ò??ë§å'ÓÃ?ë§åü;ê?맿ӱî¤?맿Ά]¿?맚Ÿ½r­?맚š‘è¼?ë§ukI 2?ë§ufˆ6?ë§P6U;ü?ë§P1)¿ô?ë§+âˆÀ?ë§*û·­?ë§Êïœö?ë§ÅÄ.Ù?ë¦à”|†O?ë¦àQ'?릻]Š´¨?릻X_Tt?릖&¿–?릖 îfX?ë¦pî)´Ç?ë¦pèþb~?ë¦Kµº¡Ý?ë¦K°VŠ?ë¦&|˨}?ë¦&w d?ë¦C\Ö[?ë¦>1˜ò?ë¥Ü o›*?ë¥ÜDd·?륶ÏŽ?륶É×é?륑”æA?륑Žë½º?ë¥lX«ýä?ë¥lS€ÜS?ë¥GÁ÷*?ë¥G–Ü?ë¥!àXiÌ?ë¥!Û-V'?ë¤ü£pO`?ë¤üžEB±?ë¤×f µ?ë¤×`Þ¯×?뤲(#¾&?뤲"ø¿c?뤌é¾vÙ?뤌ä“ ?ë¤gªÚÙ+?ë¤g¥¯èU?ë¤Bkxö?ë¤BfM?ë¤+–ù¶?ë¤&lÎ?ë£÷ë6]n?ë£÷æ |?ë£ÒªW+”?ë£Ò¥,V™?룭háþ/?룭c·0+?룈&Öâ?룈!«PÕ?ë£bäJVß?ë£bß–Ê?ë£=¡?>?ë£=œ…a?ë£]³z¿?ë£XˆÈ˜?ë¢ó¨Ô?ë¢ó}Y¦?ë¢ÍÕþŸ?ë¢ÍÏñZh?뢨ë€?뢨ŠåNA?뢃Jƒc0?뢃EXÌé?ë¢^xJg?ë¢]ÿM»?ë¢8½ì×{?ë¢8¸ÂO#?ë¢và¢3?ë¢q¶ Ó?ë¡î/U4?ë¡î*+Ì?ë¡ÈçJJ²?ë¡Èâ×C?ë¡£ž¾â@?ë¡£™”uÉ?ë¡~U´Äœ?ë¡~PŠ_?ë¡Y *(\?ë¡YÿÉÖ?ë¡3ÂÌ?ë¡3¼õ9>?ë¡w–l˜?ë¡rl?ë é,ÝÔ?ë é'c”8?ë Ãá£?ë ÃÛÚÄ?ë ž”üjL?ë žÒ.¢?ë yHu°?ë yCJÍ?ë SûmyT?ë SöCK?ë .­çµj?ë .¨½Ž«?ë  _áw,?ë  Z·Wh?ëŸä[AÚ?ëŸä 1)?럾ÂVƒê?럾½,r?럙rÑéÿ?럙m§ß'?ëŸt"Í÷F?ëŸt£óh?ëŸNÒK.è?ëŸNÍ!2?ëŸ)H³7?ëŸ)|½M?ëŸ/Ç|ö?ëŸ*Ž?ëžÞÝÆ®|?ëžÞ؜Ɔ?ëž¹‹FU`?ëž¹†td?ëž”8Gßà?ëž”3ß?ëžnäÉ…H?ëžnߟ²A?ëžIÌ>@?ëžI‹¢r3?ëž$…œ?ëiŽqŽ¨?ëi‰Gì}?ëD6ûuü?ëD1ÑÚË?ëßgÒ?ëÙÜÓ?ëœù†’ç-?ëœùiYó?ëœÔ- Œ$?ëœÔ(wå?뜮Ô/dF?뜮Ïå?뜉z?²?뜉uj?ëœdÏùp?ëœd¦ˆ$?ëœ>Äã1æ?ëœ>¿¹Ç–?ëœiw^T?ëœdMû?ë›ô ŒŒX?ë›ôc0?ë›Î±$)µ?ë›Î«úÔY?뛩T<ãÃ?뛩O•c?뛃öÖR¶?뛃ñ­ S?ë›^˜ñnæ?ë›^“È.~?ë›9:0 ?ë›95e÷5?ë›Û­Ïø?ë›Ö„Š?ëšî|MÏá?ëšîw$¤p?ëšÉp( ?ëšÉG+?뚣¼‡À?뚣¶êjH?ëš~[8å|?ëš~VÏ?ëšXùÈ2R?ëšXôŸ"Ô?ëš3— >?ëš3’™½?ëš5=c?ëš0ß?ë™èÒ8B?ë™èÍ»?ë™Ãn³N”?ë™ÃiŠ[ ?뙞 ¯öQ?뙞‡ Å?ë™x¦,0È?ë™x¡K:?ë™SA)k3?ë™S<Œ£?ë™-Û§=º?ë™-Ö~f(?ë™u¥@†?ë™p|oñ?ë˜ã# ?ë˜ã ú·v?똽¨#ld?똽¢ú©Ë?똘@¤%|?똘;{iá?ë˜rؤZ+?ë˜rÓ{¥Ž?ë˜Mp&aÚ?ë˜Mjý´?ë“.ék> ?ë“ tB;?ë“ o‰x?ë’ãùsã[?ë’ãôL8À?ë’¾~'Ä?ë’¾xÿp+?ë’™\N£?ë’˜ý4² ?ë’s†‹?ë’s€ìõƒ?ë’N N,?ë’N&t™?ë’(Œ 96?ë’(†á±¦?ë’G$K?ë’ £½?ë‘Ýsj?ë‘ÝŠÞùß?둸H’z?둸 !ñ?ë‘’’ 0€?ë‘’ŒäÄú?ë‘mQÏÂ?ë‘m *k>?ë‘G’}º?ë‘GŒò 9?ë‘"bÓ?ë‘" ;|™?ëüëd?ëüŠï›é?ë×7F?ë× ýŒ?뱋Ø~?뱆±=?ëŒú-Ž?ëŒÒó?ëf…ž3B?ëf€vÿÓ?ëAÃ>½?ë@üœR?ë}hsà?ëxANy?ëõø>?ëõóh»?ëÐs6Á_?ëÐn©ÿ?ëªí_ ó?ëªè7ú—?ë…g †?ë…aâ-?ë_à3„_?ë_Û ‚ ?ë:XßÎÐ?ë:S¸Ó€?ëÑ Õ?ëËæ ‰?ëŽïH»c»?ëŽïC”vs?ëŽÉ¿êT8?ëŽÉºÃmõ?뎤6œ¯\?뎤1uÐ?ëŽ~¬ÎÝu?ëŽ~§¨:?ëŽY"‚Iµ?ëŽY[x?ëŽ3—·l?ëŽ3’7;?ëŽ m†Š?ëŽFÃ^?ë耤ý(?ëè{~A?ëÂô_Dí?ëÂï8Ë?ëgš$D?ëbsv'?ëwÚV?ëwÕ/uþ?ëRL”šd?ëRGmúQ?ë,¾TÀZ?ë,¹.'M?ë/”Ê*?ë*n8"?ëŒá Wôè?ëŒá›1iæ?댼dÈ?댼 vàÌ?댖€cU?댖{<Ø?ëŒpï«¥?ëŒpê…/*?ëŒK^uy>?ëŒKYO T?ëŒ%ÌÀjT?ëŒ%Çšp?ëŒ:ŽW›?ëŒ5gö½?ë‹Ú§Ý||?ë‹Ú¢·"£?답­æR?답‡“€?ë‹ÿÐ?ë‹{Ú´?ë‹iìÕíb?ë‹i篨?ë‹DX+Ó~?ë‹DS•À?ë‹Ãz ?닽ßCU?ëŠù-a¤?ëŠù(:ìó?ëŠÓ—=ßË?ëŠÓ’·!?늮¢w?늭ûw€Ô?늈i~,?늈dXd?ëŠbÑá[V?ëŠbÌ»GÁ?ëŠ=9ÆÉd?ëŠ=4 ¼Ö?늡.ƒ~?늜}÷?ë‰ò–ù?ë‰òò˜z?ë‰Ìn…+?ë‰Ìi_´?뉦Ôsÿh?뉦ÏNø?ë‰9äú¬?ë‰4¿D?ë‰[žØT?ë‰[™²-ó?ë‰6Nª§?ë‰5þ(ÏN?ë‰gF‘l?ë‰b ½?ëˆêÊÁ.è?ëˆêÅ›aŸ?ëˆÅ-¾p?ëˆÅ(˜Ê/?눟>O?눟‹Ö?ëˆyò@x?ëˆyí¿ï?ëˆTSÅø?ëˆTNŸgÑ?ëˆ.´ËÊ´?ëˆ.¯¦ •?ëˆ Vßè?ëˆ 1<Ò?ë‡ãuc81?ë‡ãp=œ#?뇽Ôò±ß?뇽ÏÍÚ?뇘3íK³?뇘.ǽ·?ë‡r’Uen?ë‡r/Þ{?ë‡Lð> ?ë‡Lë‰?ë‡'M¨ J?ë‡'Hƒ'j?뇪”Ä6?뇥oR_?ë†Ü%r?ë†ÜÛº¤?놶bï¡ï?놶]Ê>+?놾_Ò©?놹:uî?ë†kQP¯?ë†k+úþ?ë†EsÅw?ë†EnŸÂÏ?ë†ͺ® ?ë†È•fp?ë…ú'1Kd?ë…ú" Ð?ë…Ô€)Þë?ë…Ô{¥b?녮ؤuÕ?ë…®ÓCU?ë…‰0 5 ?ë…‰+{ «?ë…cˆž?ë…c‚øy°?ë…=ß2?ë…=Ùø²?ë…5ž ?ë…0xÿ´?ë„ò‹¡³u?ë„ò†|¤*?ë„Ìá&»M?ë„Ìܳ ?넧6,ÆÀ?넧1ÅŠ?ë„Šµ³6?ë„…¹ ?ë„[ÞÀ¥Ê?ë„[Ù›²©?ë„62M7¦?ë„6-(K‘?ë„…[ê ?ë„€7?ëƒê×ìV)?ëƒêÒÇx*?ëƒÅ)þ‰;?ëƒÅ$Ù²H?냟{“xt?냟vn¨‹?ëƒyÌ«1?ëƒydžh%?ëƒTDØ?ëƒT K?ëƒ.m`{?ëƒ.h;À’Zý?ë‚&c>¶?ë‚&‹>µE?ë‚Ü‘¨?ë‚×lC?ëÛ(AS\?ëÛ#Ø?ëµstþÉ?ëµnPŠ}?ë¾*O¢?ë¹âc?ëjc"œ?ëj>¼j?ëDR0?ëDLú> ?ë›[äà?ë–7ŒÈ?ë€øäbv?ë€øÞøj?ë€Ó,^Ǧ?ë€Ó':}¨?뀭t$}(?뀭o:7?뀇»l¨?뀇¶Hl«?ë€b8²|?ë€aý}¦?ë€?ë~+èEæ¼ú?ëyä>¾Î?ëy¾sÐ>r?ëy¾n­GW?ëy˜£äYR?ëy˜žÁiI?ëyrÓ|†?ëyrÎY?ëyM•éë?ëyLýs?ëy'11¬›©Ñ?ëxD9xùl?ëxiÍí„?ëxd«D1?ëwø”‚t?ëwø_ÑÖ?ëwÒ¾¹J°?ëwÒ¹–¯ƒ?ëw¬ètK²?ëw¬ãQ·—?ëw‡±C¬?ëw‡ Ž¶¤?ëwa:q™ª?ëwa5O¶?ëw;bµÎ ?ëw;]“O(?ëwŠ}Z?ëw…ZŒ?ëvï±ÇR¶?ëvﬤáû?ëvÉØ–?ëvÉÓs­Z?ëv£þç!?ëv£ùľ|?ëv~$»d‚?ëv~™ ?ëvXJa¹?ëvXDñ M?ëv2nï%É?ëv2iÌØp?ëv “M×_?ëv Ž+‘?ëuæ·/öÖ?ëuæ² ·¥?ëuÀÚ–~?ëuÀÕsÌa?ëušý' ?ëušø\ö?ëuuìÅ5?ëuuÊ›@?ëuOAÝ’‚?ëuO<»o¡?ëu)cRC?ëu)^/ów?ëu„JH–?ëu(3ß?ëtݤÅØu?ëtÝŸ£ÊÒ?ët·Ä®% ?ët·¿Œ’?ët‘ä–O?ët‘Þâ–Õ?ëtlÞ"?ëtký¼½?ëtF!8Ó?ëtFáÆ?ët ?¸œ?ët 9ôÎa?ësú\wÍ¥?ësúWUê?ësÔyZRÌ?ësÔt8v¼?ës®•¿®Q?ës®ÙV?ësˆ±§z?ësˆ¬…¬5?ësbÍÃ!?ësbÇïüQ?ës<çÿï?ës<âÞ/Ö?ësoZ?ësýM¡b?ërñah±?ërñ?·"?ërË5Ö›?ërË0´ñ?ër¥NÎÿ›?ër¥I­\8?ërgI»Á?ërb(t?ërYGÃ?ërYz&-Î?ër3–È<[?ër3‘¦®:?ër ­ÌÃ?ër ¨ª“¹?ëqçÄRø1?ëqç¿1x=?ëqÁÚ[û´?ëqÁÕ:‚×?ëq›ïè:?ëq›êƦt?ëqv÷͸?ëquÿÖc ?ëqPŠ¶(?ëqPiR?ëq*-Ÿø¬?ëq*(~œ*?ëqA8ˆ ?ëq<2µ?ëpÞTSþ–?ëpÞO2°C?ëp¸fòÛõ?ëp¸aÑ”¹?ëp’y-8?ëp’sóí?ëplŠºŒr?ëpl…™Sd?ëpF›ã¢?ëpF–ÁÔ«?ëp ¬Ž5è?ëp §m ?ëoú¼½ ?ëoú·›é>?ëoÔÌo&?ëoÔÇN f?ëo®Û¤Ž?ëo®Öƒx„?ëoˆê]R?ëoˆåªWÁ?ënYN «æ?ënYIÖ)?ën3XùŒ?ën3SØ?ç?ën bÔÜT?ën ]´È?ëmçl5Æ?ëmçgGS?ëmÁu+?ëmÁoøq¼?ëm›}û?ëm›x_HÎ?ëmu…jÜî?ëmu€J1Æ?ëmOŒÙݯ?ëmO‡¹9¡?ëm)“˲,?ëm)Ž«7?ëmšB¤ý?ëm•""?ëlÝ <øD?ëlÝ›i‚?ël·¥»žm?ël· ›Å?ël‘ª½Li?ël‘¥œËÚ?ëlk¯CgJ?ëlkª"íÕ?ëlE³Mº?ëlE®,¤_?ël¶Û¿´?ël±»Ts?ëkù¹í¤œ?ëkù´Í@u?ëkÓ¼ƒE"?ëkÓ·bè?ëk­¾žxÑ?ëk­¹~"ß?ëk‡À<œÞ?ëk‡»N?ëkaÁ_4?ëka¼>Îw?ëk;Áðnò?ëk;¼Ð.N?ëkÁïWŽ?ëk¼Ï?ëjïÁqdŽ?ëjï¼Q2!?ëjÉÀv¢Ï?ëjÉ»Vw|?ëj£¾þ¬”?ëj£¹Þˆ\?ëj}½ ŽÂ?ëj}·éq¥?ëjWº˜;T?ëjWµx%S?ëj1·©gy?ëj1²‰X’?ëj ´>+?ëj ¯ý`?ëiå°U<3?ëiå«5;ƒ?ëi¿«ï‹ý?ëi¿¦Ï’i?ëi™§ j?ëi™¡íñ?ëis¡®Ž[?ëisœŽ¢þ?ëiM›Òè%?ëiM–³ä?ëi'•z«?ëi'Z>†?ëiŽ¤¨P?ëi‰„ÒG?ëhÛ‡S n?ëhÛ‚3>€?ëhµ„t?ëhµzd8¢?ëhw9Êš?ëhr å?ëhinqW€?ëhiiQç?ëhCe-bÉ?ëhC` °M?ëh[mk?ëhVMi ?ëg÷Q0Î?ëg÷Lb‹?ëgÑFvFß?ëgÑAV©¸?ëg«;@Sä?ëg«6 ½Ú?ëg…/Ž:À?ëg…*n«Ò?ëg_#_#ƒ?ëg_?›²?ëg9³ÿÞ?ëg9”*?ëg ŒjN?ëglð¸?ëfìûèoµ?ëfìöÈý›?ëa‘Î%Y#?ëa‘Éç?ëak®qÁ?ëak©SV?ëaEŽAè)?ëaE‰#„I?ëam”‡?ëahu´È?ë`ùLkhÂ?ë`ùGM$?ë`Ó*ÅÀ]?ë`Ó%§qà?ë`­£%%?ë`­„ÝÉ?ë`†æùð?ë`†àæ¹µ?ë``Âêgo?ë``½Ì.U?ë`:ŸR–j?ë`:š4dr?ë`{>é¥?ë`v ¾Î?ë_îV®ûç?ë_îQØ2?ë_È1¢Ùî?ë_È,„½Z?ë_¢ ˆ?ë_¢ü ?ë_{æºj?ë_{à÷¬?ë_U¿”dw?ë_Uºv]H?ë_/˜—P?ë_/“yC?ë_ q²?ë_ lÇ?ë^ãI)r¥?ë^ãD €Ü?ë^½ ¹H|?ë^½›]Ö?ë^–÷Ìla?ë^–ò®ˆÝ?ë^pÎbë!?ë^pÉE¿?ë^J¤~'3?ë^JŸ`Qô?ë^$zI’?ë^$tÿ{u?ë]þO?í&?ë]þJ"&,?ë]Ø#çv?ë]ØÉBŸ?ë]±ø–H?ë]±òôÝ“?ë]‹ËÂC|?ë]‹Æ¤‘ê?ë]ežöˆ¶?ë]e™ØÞH?ë]?q¯â?ë]?l‘]—?ë]CêcJ?ë]>ÌÇ"?ë\óª„ ?ë\óŒï?ë\Ìæïoì?ë\ÌáÑâ ?ë\¦··Þ@?ë\¦²šW‚?ë\€ˆÕ?ë\€‚è•;?ë\ZW×u¤?ë\ZR¹ý-?ë\4'-Ô¤?ë\4"cQ?ë\ öÌÔ?ë\ ðëb¥?ë[çÄhjð?ë[ç¿Kå?ë[Á’KØD?ë[Á.|]?ë[›_´vÞ?ë[›Z—"?ë[u, Œˆ?ë[u'ƒ>ê?ë[Nùí?ë[Nóô¦…?ë[(Å¥?ë[(¿ëe¹?ë[„Oµ?ë[‹gƒ?ëZÜ[‚Á5?ëZÜVe(?ëZ¶&”?ëZ¶ êj?ëZð?ëZêóëK?ëZi¹žÊ{?ëZi´®Ü?ëZC‚±G¾?ëZC}”3D?ëZKIO?ëZF+öú?ëY÷e)¡?ëY÷H#q?ëYÐÛ§Ò?ëYÐÕé¨Ç?ëYª¢,6¹?ëYª>Ô?ëY„hÖTÍ?ëY„c¹d ?ëY^/Õ]?ëY^)éëÂ?ëY7ô»þ¨?ëY7ïŸ3?ëY¹öO?ëY´ÙsÎ?ëXë~¶E?ëXëy™pñ?ëXÅBú' ?ëXÅ=ÝZ?ëXŸÂäñ?ëXŸ¦?ëXxÊnÁ?ëXxÄô° ?ëXRŒå_®?ëXR‡È¨?ëX,O(f¸?ëX,J ¶L?ëXÛc¹?ëX ¾ºt?ëWßÒy?ëWßÌõû[?ëW¹’Í=Š?ëW¹°¢’?ëW“S ¸?ëW“Mð‚æ?ëWmÐoˆ?ëWm ³âÝ?ëWFÒã!?ëWFÌú]œ?ëW ã'??ëW ‹Æ¨â?ëVúO2-ü?ëVúJ¶Æ?ëVÔ X‡?ëVÔèèw?ëV­Ê^ø?ëV­ÅAŸ?ëV‡‡:Š?ëV‡‚¯É?ëVaC™|?ëVa>|µâ?ëV:ÿ~+´?ëV:úaØA?ëVºç8…?ëVµÊì:?ëUîuÔC ?ëUîp·þ}?ëUÈ0EË ?ëUÈ+)$?ëU¡ê:øÑ?ëU¡åÁý?ëU{£µ-¨?ëU{ž˜ýü?ëUU\´v@?ëUUW˜M»?ëU/7‹?ëU/i²?ëUÍ>ê&?ëUÈ"Ïò?ëTâ„Ê 5?ëTâ®*?ëT¼;Ú¹è?ëT¼6¾®?ëT•òp&¡?ëT•íT!æ?ëTo¨Šª?ëTo£n„?ëTI^(ô÷?ëTIY þ?ëT#K6?ëT#/õ?ëSüÇó«?ëSüÂ×Ã?ëSÖ|•ø?ëSÖwµ?ëS°/Юx?ëS°*´Ô±?ëS‰ãî?ëS‰Ýê½P?ëSc•Â)¤?ëSc¦^/?ëS=Hàv?ëS=Bå*?ëSùÅÚ!?ëSôªÿ?ëRð«ìã?ëRð¥ó6ê?ëRÊ[Ýô?ëRÊVÁY%?ëR¤ 08?ëR¤^?ëR}¼úü?ëR}¶íZ€?ëRWke˜†?ëRWfIÿ4?ëR1GâP?ëR1,P'?ëR ȯsÂ?ëR ÓèÃ?ëQäv›w?ëQäqóG?ëQ¾$ jB?ëQ¾ðí—?ëQ—ÑË?ëQ—ËçUœ?ëQq}~5?ëQqxbÆÇ?ëQK)—X?ëQK$d0,?ëQ$Õªæ?ëQ$ÏêJå?ëPþ€||?ëPþzõ#¦?ëPØ*¡Ýr?ëPØ%†‹Å?ëP±Ô·3}?ëP±Ï›èû?ëP‹~ROñ?ëP‹y7 š?ëPe's?t?ëPe"XI?ëP>Ð,o?ëP>Êý÷n?ëPxD#•?ëPs(õ¿?ëOòõö ?ëOòÚÏa?ëOËÇ,ì?ëOËẨ?ëO¥mè¡"?ëO¥h͈Î?ëO*A?ëOó?ëOX¹ð°ÿ?ëOX´Õ§?ëO2_<´?ëO2Z!±>?ëO üG?ëO þô¡?ëNå¨g–F?ëNå£L¡Ì?ëN¿LE¬£?ëN¿G*¿U?ëN˜ï“?ëN˜êx¶á?ëNr’R@•?ëNr7aŸ?ëNL4”Èc?ëNL/yðš?ëN%Ö\” ?ëN%ÑAÃo?ëMÿw©??ëMÿrŽu¡?ëMÙy‚ü?ëMÙ^À·?ëM²¸ÎN`?ëM²³³“H?ëMŒX¨¼?ëMŒSÛÐ?ëMeø´?ëMeòëâõ?ëM?–ê¸?ëM?‘Ïy&?ëM5Qöl?ëM07X?ëLòÓ>”U?ëLòÎ#ý?ëLÌp°ý?ëLÌk•tó?ëL¦ ¦Tö?ëL¦‹Ì?ëLª!Ö?ëL¥ž&?ëLYF ã#?ëLYAh ?ëL2ᥫf?ëL2Ü‹8?ëL |®£\?ëL w”74?ëKæ<¹g?ëKæ"Tl?ëK¿±Oú?ëK¿¬5œE?ëK™Jè?ëK™Eͪh?ëKräK¸?ëKrÞêüG?ëKL|§æ¬?ëKLwži?ëK&Îü¿?ëK&´»ª?ëJÿ¬{í ?ëJÿ§a³%?ëJÙC­q•?ëJÙ>“>Ü?ëJ²ÚdÈ?ëJ²ÕIÜ=?ëJŒpŸK`?ëJŒk…'?ëJfa 4?ëJfFï?ëJ?›§"¿?ëJ?– À?ëJ0ríü?ëJ+Xß,?ëIòÄÃ(?ëIò¿© {?ëIÌX™0?ëIÌS/Ÿ?ëI¥ëô¡œ?ëI¥æÚ¨X?ëI~ÕŒ?ëIy»&x?ëIY;‚ö?ëIY !˜?ëI2£&›(?ëI2ž ·r?ëI 4—O7?ëI /}r±?ëHåÅ:õ?ëHåÀsež?ëH¿V ½#?ëH¿Pïîû?ëH˜æ ?ëH˜àñÉ&?ëHru‘ß?ëHrpxK?ëHLžyk?ëHKÿ„ÀÒ?ëH%“0û?ëH%ŽI—?ëGÿ!HŽþ?ëGÿ.äÅ?ëGØ®æ” ?ëGØ©Ìñ?ëG²< Ä©?ëG²6ð(Ð?ëG‹È²-t?ëG‹Ã˜˜Ì?ëGeTá,ü?ëGeOÇŸ„?ëG>à•}×?ëG>Û{÷?ëGkλý?ëGfµ<æ?ëFñöp?ëFññvŠ?ëFË€Ö[P?ëFË{¼êš?ëF¥ ¡ÁøýѵÂ?ë>øø¹»k?ë>Ònš2?ë>Òi‚$?ë>«Þç÷ˆ?ë>«ÙÐ œ?ë>…N»Óp?ë>…I£îº?ë>^¾—»?ë>^¸þº;?ë>8,÷p„?ë>8'ßš9?ë>›]ú?ë>–F+?ë=ë J±"?ë=ë2éC?ë=Äv¾‚[?ë=Äq¦Á²?ë=ã¸)Î?ë=Þ p[?ë=wP8$?ë=wK qÙ?ë=P¼>}®?ë=P·&Ò§?ë=*'ÊÒï?ë=*"³/ ?ë=’Þ?ë=Æsô?ë<ÜýwÒà?ë<Üø`=}?ë<¶g—F4?ë<¶b¸?ë<Ñ>§r?ë<Ì' }?ëjÞ?ë9>eÇ+Û?ë9Éeq³?ë9ÄNÂ?ë8ñ'sP>?ë8ñ"\v‡?ë8Ê…Ü5?ë8Êð ¶?ë8£â ‘Ð?ë8£Ý ÆŠ?ë8}>À}f?ë8}9©¹Z?ë8Všæ«L?ë8V•Ïîy?ë8/ö’H%?ë8/ñ{’‹?ë8 QÄ@?ë8 L­‘¢?ë7â¬{¿Š?ë7â§ec?ë7¼¹²Ë?ë7¼£Þ?ë7•`}¶D?ë7•[g‘?ë7n¹ÇÖQ?ë7n´±D×?ë7H—¯~?ë7H %>?ë7!jï X?ë7!eØŠS?ë6úÂÌ=?ë6ú½µÁ;?ë6Ô.Û?ë6Ôf?ë6­qCV?ë6­lÕÿ?ë6†ÇˆB?ë6†Âq¬&?ë6`}äv?ë6`g…”?ë69rû?ë69mä½ç?ë6Çþb¤?ë6Âè7?ë5ì‡h^?ë5ìq,?ë5Åp—ò?ë5Åk° ?ë5žÄ.¼´?ë5ž¿ø?ë5xJõr?ë5x4Áñ?ë5Qiî× ?ë5QdتÙ?ë5*¼¯H?ë5*·Šµ?ë2Kv)p?ë2$Ãò=à?ë2$¾Ü©†?ë1þ -0Ž?ë1þ£r?ë1×Sîºc?ë1×NÙ4„?ë1°›"ËÖ?ë1°– M4?ë1‰áÊ+?ë1‰Ü´³ž?ë1c'ö”C?ë1c"á$?ë1?ë(s æËÞ?ë(sÓz?ë(L6¯_]?ë(L1›¢0?ë%.Ã?ë$õSt–?ë$õMûWG?ë$ÎqÍ?ë$Îlºxú?ë$§s?ë$§‹ù®?ë$€­áí ?ë$€¨ÎåŠ?ë$YË6k@?ë$YÆ#k?ë$2èþ?ë$2âÿ?ë$ t±ª?ë$ ÿa¿ù?ë#å _õ?ë#åLŠ?ë#¾;Ђ?ë#¾6½7\?ë#—VÈè?ë#—Q¶ -?ë#pqH˜(?ë#pl5Ã?ë#I‹Pˆ?ë#I†=G3?ë#"¤ßiJ?ë#"ŸÌ£:?ë"û½ôç?ë"û¸â(Å?ë"ÔÖ’V†?ë"ÔÑŸ?ë"­î·S?ë"­é¤£R?ë"‡dY?ë"‡Q°˜?ë"`—¹À?ë"`…?ë"94Tœ?ë"9/A~1?ë"J—X´?ë"E„Å?ë!ë`aôè?ë!ë[Oi ?ë!Äu´ÖÀ?ë!Äp¢R(?ë!Šàú?ë!…{c¨?ë!vžïI*?ë!v™ÜÓ ?ë!O²Ø¬Â?ë!O­Æ=þ?ë!(ÆI©@?ë!(Á7AÂ?ë!ÙBJÌ?ë!Ô/ê–?ë ÚëÂ?ë Úæ°D¡?ë ³ýÊ­´?ë ³ø¸\ ?ë Z‡b?ë H=?ë f r6Á?ë f_ó¨?ë ?1Çü?ë ?+ÿŒ*?ë A9G6?ë <'¬?ëñPé/6?ëñK×ó?ëÊ`!„?ëÊ[÷‰?ë£nàA"?ë£iÎ"n?ë|}(`Š?ë|xI?ëUŠ÷Í™?ëU…å½u?ë.˜Oqž?ë.“=hÃ?ë¥/ÇL?ë Ÿ?ëà±—&?ëଅ”Û?ë¹½‡Cç?빸uPã?ë’É=M?ë’ÃîQ’?ëkÔÍg?ëkÎîèõ?ëDÞtzØ?ëDÙb®?ëè]KG?ëãKuf?ëöñÍæˆ?ëöì¼ð?ëÏúÅ !?ëÏõ³EÑ?ë©C9¡?ë¨þ1y›?ë‚ Hæ„?ë‚7-Ç?ë[ÕBå?ë[ Ñp?ë4èÉG?ë4×?ë ƒ…³?ë qâÑ?ëæ&¥Á?ëæ!“z)?ë¿,O?8?ë¿'=ªé?ë˜1w†?ë˜,mê€?ëq67„p?ëq1%þ´?ëJ:wqö?ëJ5eó„?ë#>>ç?ë#9,‰¾?ëüAŒ"?ëül@)?ëÚ9[6_?ë³:«ì$?ë³5šé¥?ëŒ6u-Ô?ëŒ1d2Ÿ?ëe1ÅéÝ?ëe,´õô?ë>,žš?ë>'­ò?ë&þݼ?ë!íøk?ëð ç-®?ëðÖO¨?ëÉW(4?ëÉFQz?ë¢P$ ?ë¢?Tœ?ë{ ÐâŽ?ë{Àl?ëTÙ–?ëSþÈ@À?ë,ûii ?ë,öX°?ëò‚&º?ëíqt|?ëÞé"Ö¸?ëÞä+Æ?ë·ßK…¯?ë·Ú:â ?ëÔü­Ø?ëÏì?ëiÊ5í?ëiÅ%X?ëB¾÷Op?ëB¹æÁ°?ë³A½I?ë®16Ö?ëô§Š?ëô¢ í?ëÍšn O?ëÍ•]”u?ë¦Páã?릈@qV?뻨Ä?ëz«?…?ëXq¯I<Áª?ë'üÖã?ë"íA…?ëë 5p,?ëë%â?ëÃïõÈ>?ëÃêæA?ëœÓ>Xò?ëœÎ.Ùƒ?ëu¶Rt?ëu°þÚU?ëN˜g V?ëN“W™‡?ë'zH¤?ë'u8µ%?ë[°¿?ëV¡]o?ëÙ<¡Ôâ?ëÙ7’z?ë²ü’?ë² ©?ëŠýÔÊ?ëŠø ˆ?ëcÜ¥²ò?ëc×–n?ë<»¸5&?ë<¶¨÷Š?ëšR‹¶?ë•CUk?ëîxu0j?ëîsfp?ëÇV /0?ëÇQ†?ë 3TÁ?ë .Dái?ëyj¿?ëy Q¸?ëQìS¿l?ëQçD­µ?ë*È 02?ë*Ã%Í?ë£vD?ëžg0?ëÜ~SLÚ?ëÜyDQ?ëµX¹¢â?ëµSª®r?ëŽ2© D?ëŽ-š3%?ëg ‡Ê?ëg¡ý?ë?å!œ>?ë?à½Ã?뽪E?븛mç?ë ñ•»×P?ë ñ­y?ë ÊmUƒ‘?ë ÊhF» ?ë £DxžÒ?ë £?iÝž?ë |$ÇU?ë | t?ë TñY-º?ë TìJ{+?ë -ǹH?ë - ?ë œ]uê?ë —NÒ?ë ßq-ö?ë ßle_?ë ¸E…iZ?ë ¸@vÔ?ë ‘fJp?ë ‘W¼~?ë iìÐÐ?ë içÁ˜1?ë B¿ÃÍž?ë BºµNR?ë ’@ý?ë 1¢?ë ôdEè?ë ô_6ŸB?ë Í5Ó–‚?ë Í0Å-0?ë ¦ë¹¹?ë ¦ÝWº?ë ~׋a¦?ë ~Ò}ú?ë W§µ™=?ë W¢§Eå?ë 0wh¶-?ë 0rZj(?ë F£é[?ë A•¤ª?ë âibt?ë â[%?ë ºã£Ò?ë ºÞ•œ“?ë “±TUê?ë “¬F'4?ë l~ŒW²?ë ly~0P?ë EKM,[?ë EF? N?ë •)­?ë ‡ô?ë öãf?ë öÞXmœ?ë Ï®¿ï«?ë Ï©±åš?ë ¨y¡?ë ¨t“H?ë D RR?ë >ýVê?ë Z üîŠ?ë Zîúw?ë 2×vÕv?ë 2Òhè¸?ë  yíÈ?ë ›l^?ëäi–?ëäcö¯?ë½1 ?ë½, 2B?ë•ø´kß?ë•ó¦œt?ën¿Øç+?ënºË?ëG†…†½?ëGwÅü?ë L»1>?ë G­wÓ?ëùy…?ëù kÓ?ëÑ׿F?ëÑÒ±›A?몜Ž5V?몗€‘ë?ëƒ`å„,?ëƒ[×è?ë\$Å«º?ë\¸û?ë4è/%0?ë4ã!—Æ?ë «!!¬?ë ¦›™?ëæm›?®?ëæhÀð?ë¿/øm?ë¿*?ë—ñ)Å?ë—ìU?ëp²>±t?ëp­1H¹?ëIrÛîÈ?ëImÎd?ë"3c†?ë"-õ x?ëúò°Ó¢?ëúí£€ë?ëÓ±émf?ëÓ¬Ü"?ë¬pª@?ë¬kœÖ6?ë….ô-ß?ë…)æñ,?ë]ìÇ´?ë]çº~¸?ë6ª#Þ/?ë6¥°)?ëg¸?ëaû‘f?ëè#vº×?ëèi›€?ëÀßm…?ëÀÚ`m?뙚íý$?뙕àì{?ërUø.Ï?ërPë%~?ëK‹K€?ëK ~I†?ë#ʦ„­?ë#Å™Š ?ëü„K›?ëü>§º?ëÕ=z-$?ëÕ8mA1?ë­ö2Fç?ë­ñ%bL?놮sÎ?놩f<‹?ë_f=Œ ?ë_a0¶?ë8‘©r?ë8„Úß?ëÔo¸?ëÏbI}?ëéŠÖ:Ú?ëé…Ézø?ëÂ@ÆYl?ëÂ;¹ â?ëšö@¿®?ëšñ4|?ës«D2?ës¦7ˆ??ëL_м†?ëLZÄ?ë%çE?ë%Ú©î?ëýLJjx?ëýÂzÖ©?ëÖz°^f?ëÖu£Ñð?ë¯-cá?ë¯(W[õ?ë‡ß J?ë‡Ú“Ì??ë`‘f0?ë`ŒY›Å?ë9B¶ù®?ë9=ªŠœ?ëó~?ëî„L?ëê£ß>ã?ëêžÒÞ„?ëÃS¦m?ëÃN™­h?ëœõ6 ?ë›ýèäô?ët±ÌÛ??ët¬Àí?ëM`,“?ëM[ P ?ë&¬?ë& â?êÿþ»‡Òõ?êÿþ¶{ž±?êÿ×h‚˜˜?êÿ×cvk®?êÿ° P?êÿ°ùçÀ?êÿˆÁ<Ý?êÿˆ¼§?êÿal§2û?êÿag› ?êÿ:Äûf?êÿ:¸ëå?êÿÂk¡Þ?êÿ½_™¸?êþël›Ÿ?êþëgžB?êþÄT‘À?êþÄH˜N?êþœ¿–Â?êþœºŠ&«?êþuha®?êþucU.ñ?êþN´Æe?êþN ¨ã?êþ&¸‘—’?êþ&³…»‹?êýÿ_øÖ?êýÿZì1+?êýØçC"?êýØÛuÒ?êý°­^r?êý°¨R»~?êý‰S_ìò?êý‰NT.Y?êýaøê·—?êýaóßY?êý:þ€??êý:˜òÐ]?êýB›Rª?êý=ª#?êüëæÁ§t?êüëá¶I?êüÄŠq€?êüÄ…eƒ°?êü-ªš4?êü(ŸÀ?êüuÐmO¤?êüuËaÄ?êüNr¸Ü¾?êüNm­Y?êü'Ž&æ?êü'‚ª‡?êûÿµìÍ ?êûÿ°áX?êûØVÔn?êûØQÉv?êû°÷F\>?êû°ò:õó?êû‰—A\Î?êû‰’5ýà?êûb6Å{’?êûb1º$?êû:ÕÓÓ?êû:ÐÈMž?êûtkÏK?êûo`†s?êúìŒÕx?êúì “ý?êúÄ°7•ž?êúÄ«,[€?êúMlˆ4?êúHaUr?êúuê*ß‚?êúuå´?êúN†s?êúNgïü?êú'"Dľ?êú'9¨?êùÿ½Ÿý{?êùÿ¸”è.?êùØX…6ª?êùØSz(»?êù°òôè»?êù°íéâ)?êù‰ŒíÙ\?êù‰‡âÚ'?êùb&qÇ?êùb!fÏ0?êù:¿ À?êù:ºtG?êùX× ?êùS íð?êøëð5Ó?êøëë*áÖ?êøćà–%?êøÄ‚Õ»Æ?êøíá?êø à?êøuµÓ¯Î?êøu°Èä+?êøNL{ ?êøNG¶Å?êø&áîî¸?êø&Üä1Ò?ê÷ÿwL\r?ê÷ÿrA¦ë?ê÷Ø 3Š%?ê÷Ø(Ûü?ê÷° ¤ƒ–?ê÷°›™ÜÌ?ê÷‰4¡à?ê÷‰/–gt?ê÷aÈ&'±?ê÷aÃ¥?ê÷:[6}C?ê÷:V+ì•?ê÷í¾r€?ê÷è³é1?êöë¼…?êöëz±•?êöÄB°P?êöÄ 85¿?êöœ¢Sâ¬?êöœIo{?êöu2í£†?êöu-ã7´?êöMÃþ†?êöM¾š?êö&R¼±e?êö&M²TR?êõþáò‚5?êõþÜè,‚?êõ×p±|˜?êõ×k§.E?êõ¯þù¬2?êõ¯ùïe>?êõˆŒË‰*?êõˆ‡ÁI–?êõa%Ù©?êõa¡u?êõ9§ [G?êõ9¢*s?êõ3x@¦?êõ.n2?êôê¿o•t?êôêºesa?êôÃJðeQ?êôÃEæJ?êô›Õû(R?êô›Ðñÿ?êôt`}¤?êôt[…q²?êôLê­pì?êôLå£lZ?êô%tU Ï?êô%oK?êóýý…µ?êóýø{$ä?êóÖ†@-¹?êóÖ6?I?ê󯄠Þ?êó¯ z¹Ï?êó‡–RÈ?êó‡‘H ?êó`ª®â?êó` Ö•?êó8¤ŒÍi?êó8Ÿ‚ü}?êó*øJ?êó%îDÀ?êòé°íÂ@?êòé«ä?êòÂ6l¯Ú?êòÂ1bõ?êòš»uO#?êòš¶k›½?êòs@„h?êòs:þØc?êòKÄ%‚ž?êòK¿Ýû?êò$GËé?êò$BÂKÛ?êñüÊüœ0?êñüÅóQ?êñÕM·;)?êñÕH­¬¬?êñ­Ïûee?êñ­ÊñÞJ?êñ†QÊkm?êñ†LÀë´?êñ^Ó#?êñ^Λ®?êñ7T×?êñ7Nüf)?êñÔs,¢?êñÏiÃ?êðèTjG®?êðèO`å~?êðÀÓë 0?êðÀÎâEc?êð™R÷®?êð™MîZ›?êðqѤ\?êðqÌ„XT?êðJO­" ?êðJJ£Ýû?êð"ÍXQŸ?êð"ÈO]?êïûJŒ?êïûE„V1?êïÓÇLqn?êïÓÂCBñ?êï¬C–Qþ?êï¬>*å?êï„¿j`ü?êaAF?êï]:ÉD?êï]5¿ýñ?êï5µ²}{?êï5°©lŒ?êï0%]À?êï+T4?êîæª#H?êîæ¥ ?êî¿#«ñÚ?êî¿¢÷?êî—œ¾xƒ?êî——µ…"?êîp[=?êîpR“@?êîHƒ}Ñ?êîHˆz™7?êî!6ì?êî!.Ï?êíù|t$ý?êíùwkO,?êíÑó=Pù?êíÑî4‚Œ?êíªi_?êíªd‡˜?êí‚ßnŸG…?êí 9ž?êìä±ð=z?êìä¬ç›h?êì½%ZÄ?êì½ R)n?ê았O—6?êì•“Gí?êìn ÎÂK?êìnÆ6h?êìF|× ¿?êìFwΈA?êìîiZ6?êìé`Ý?êë÷_…¶5?êë÷Z}@?êëÏÐ,,C?êëÏË#½ô?êë¨@[ïæ?êë¨;Sˆü?ê뀰äª?ê뀫 …'?êëYZ?êëYQ½ü?êë1Ž'KÇ?êë1‰û?êë ü­)?êë ÷wcÖ?êêâja•Þ?êêâeYSñ?êêº×Í}h?êêºÒÅBá?êê“DÃd?êê“?ºÐC?êêk±Cw3?êêk¬;Kx?êêDM Š?êêDE|5?êêˆâbÒ?êêƒÚEä?êéôô]¦?êéôîùH?êéÍ^ªœ?êéÍY¢Žn?êé¥ÈÝ¿0?êé¥ÃÕ¸u?êé~2›=?êé~-“=¬?êéV›âµ£?êéV–Ú½µ?êé/µ o?êé.ÿ­è?êému'?êéh Œ?êèßÔøg8?êèßÏð…?êè¸u‚Ä?êæ>pî?êæÔ½~?êæϵº?êåï3îê?êåï.æ¹å?êåÇ’© ?êåÇ¢R‚?êåŸðïÕ¬?êåŸëèy?êåxNÁ’?êåxIºSÆ?êåP¬ é?êåP§Óˆ?êå) JI?êå)þP?êåexŸN?êå`qv¾?êäÙÁvÒv?êäÙ¼o±P?êä²ÿƒœ?êä²øiß?êäŠx•¶?êäŠs ƒb?êäbÒ³E?êäbͬ [?êä;,Ý3Œ?êä;'Ö0 ?ê䆓­²?ê䌱›?êãëßÔk?êãëÚ;?êãÄ8 iu?êãÄ3™|2?êãœø?ê㜋ñC?êãtèÙ¤?êãtãÒŪ?êãM@3Ï?êãM;,ø ?êã%—õþ?êã%’&b?êâýíeé?êâýè^R·?êâÖCL÷«?êâÖ>F6ã?ê⮘¿,?ê⮓¸r½?êâ†í»Ã¤?êâ†èµ²?êâ_BB^,?êâ_=;³¥?êâ7–SÞ@?êâ7‘M;#?êâéï ¥?êâäèpó?êáè=Ëê?êáè87£?êáÀÅ“?êáÀŠ¿,?êá˜â*Ñ?êá˜Üù¥`?êáq3Å E?êáq.¾Œ??êáI…à?êáI€E?êá!Õî9ƒ?êá!ÐçÊS?êàú&S «?êàú!L£ç?êàÒvBSH?êàÒq;òï?êàªÅ¼‡E?êàªÀ¶.W?êàƒÀp¤?êàƒº"?êà[cP47?êà[^Iê ?êà3±j›?êà3¬dXZ?êà ÿE?êà ú È?êßäL?š?êßäG8àÇ?êß¼˜øÒÝ?êß¼“ò¦v?êß”å>9?êß”à8 ?êßm14?êßm,ò¦?êßE|gøx?êßEwaâV?êßÇLÔ ?êßÂFÅj?êÞö½ðÌ?êÞö ·éƒ?êÞÎ[¸Õ†?êÞÎV²Õ©?êÞ¦¥?¦¾?êÞ¦ 9®N?êÞ~îPÂT?êÞ~éJÑQ?êÞW6íuß?êÞW1çŒI?êÞ/_?êÞ/z=5?êÞÆÆã?êÞÁÁX?êÝàŠ\?êÝàþ· ?êݸTÍŒ?êݸOÇÀ!?êÝ›!Ó?êÝ–X^?êÝhàÿ³–?êÝhÛùöŽ?êÝA&i[Ã?êÝA!c¦)?êÝk^÷p?êÝfYIC?êÜñ¯ßP?êÜñªÙ©Z?êÜÉóêqB?êÜÉîäÑð?êÜ¢7<ó?êÜ¢2{¥?êÜzz£¾œ?êÜzuž.&?êÜR½Q+"?êÜR¸K¢?êÜ*ÿŠÏÊ?êÜ*ú…N0?êÜANŸ²?êÜÍW˜?êÛ<ƒP¼P?êÛ<~KgK?êÛÂZ &?êÛ½T½?êÚíï9?êÚìûéÑ?êÚÅ?ëý?êÚÅ: ­E?êÚ|¼”æ?êÚw·]œ?êÚu¹óÛØ?êÚu´î«ý?êÚMö·y ?êÚMñ²P¡?êÚ&3 Ç?êÚ&.ëÊ?êÙþnáÌ%?êÙþiܲ˜?êÙÖªI?êÙÖ¥Cñÿ?êÙ®å ž$?êÕ¤9 Tã?êÕ|l‡(¶?êÕ|g‚æç?êÕTšŒT?êÕT•‡Ô÷?êÕ,È]X?êÕ,Ã*m?êÕõ8?êÕð3ò¢?êÔÝ!à2Ó?êÔÝÜÌ?êÔµNû"?êÔµIÞ?êÔyÑX@?êÔtÍC?êÔe¥êš?êÔe Üé?êÔ=Ïð(z?êÔ=Êì";?êÔúQòý?êÔõMô1?êÓî$>? ?êÓî:G°?êÓÆM·.f?êÓÆH³>?êÓžv» ì?êÓžq·8w?êÓvŸJ!ÿ?êÓvšF@þ?êÓNÇeèf?êÓNÂbØ?êÓ&ï Ô?êÓ&ê ÷?êÒÿ>ðf?êÒÿ;%½?êÒ×<ýô?êÒ×7ú0Ý?êÒ¯cIÀ?êÒ¯^EXý?êÒ‡‰Z?êÒ‡„i ?êÒ_®Y¯?êÒ_©}¬Ô?êÒ7ÓojL?êÒ7ÎkÄä?êÒ÷éZŽ?êÒòå¼™?êÑèð `?êÑèìtß?êÑÀ?Üú?êÑÀ:~Mí?êјbŸ°M?êј]œ(´?êÑp…I·?êÑp€F‘?êÑH§ôQ?êÑH¢|{Ÿ?êÑ ÉBù?êÑ Ä>Ÿ¼?êÐøêò ?êÐø匈A?êÐÑ j ¤?êÐÑf«O?êЩ+ÑD”?êЩ&Íé´?êÐKÄb?êÐFÁ—?êÐYkCqR?êÐYf@%Z?êÐ1ŠN0?êÐ1…Jέ?êÐ ¨å(e?êÐ £áëV?êÏáÇ &ú?êÏáÂñ`?êϹä¹Dê?êϹ߶Å?êÏ’õ‘?êÏ‘üòfá?êÏj«³?êÏj¨“Õ?êÏB:ÛÙH?êÏB5ØÁ‚?êÏV—*ª?êÏQ”Y?êÎòqÝGÑ?êÎòlÚ>ö?êÎÊŒ¯H?êÎʇ¬â?ê΢§ ’N?ê΢¢ ˜^?êÎzÀõk{?êÎz»òy?êÎRÚi¨?êÎRÕf½ ?êÎ*ói½é?êÎ*îfÚY?êÎ ôxp?êÎñœV?êÍÛ$ "º?êÍÛN?êͳ;­]j?êͳ6ª}h?êÁ„øt%^?êÁ„ósŸ&?êÁ\ì4AY?êÁ\ç3ž?êÁ4߀¨N?êÁ4Ú€1?êÁ ÒZ9h?êÁ ÍYɧ?êÀäÄÀ•Ë?êÀä¿À-†?êÀ¼¶²ô¢?êÀ¼±²“Û?êÀ”¨2Ÿ?êÀ”£2EÅ?êÀl™>Ìzo?êÀD‰Ö³h?êÀD„Öi?êÀyûª?êÀtûZ×?ê¿ôi­,/?ê¿ôd¬ðÚ?ê¿ÌXë0?ê¿ÌSêÌY?꿤G¶Ìž?꿤B¶ D?ê¿|6Šë?ê¿|1f?ê¿T#ò°6?ê¿Tò’×?ê¿,d†?ê¿, d¥?ê¿þb,?ê¿ùaõÉ?ê¾Ûêìß>?ê¾ÛåìØY?ê¾³×ä?ê¾³Òä³?꾋¨[œ?꾋½¨c³?ê¾c­Ù}(?ê¾c¨ÙŒ¾?ê¾;˜—½É?ê¾;“—ÔÝ?꾂㒅?ê¾}ã±?ê½ël¼2Ê?ê½ëg¼XÛ?ê½ÃV"œ?ê½ÃQ"A+?ê½›?lu?ê½›:¡ƒ?ê½s'“²\?ê½s"“îé?ê½K Ä(?ê½K ¡3?ê½"÷:o†?ê½"ò:»?ê¼úÞa“F?ê¼úÙaæP?ê¼ÒÅfò?ê¼ÒÀÁz?꼪«VÉW?꼪¦W+_?꼂‘%Åœ?꼂Œ&/#?ê¼Zv“V?ê¼Zq‚]?ê¼2[j§|?ê¼2Vk ?ê¼ ?á ;?ê¼ :á@?ê»â#äeü?ê»âäí?껺ur?껺vw?껑ê“Z„?껑å“ñ ?ê»iÍ,´??ê»iÈ-RC?ê»A¯A¸°?ê»AªB^4?ê»â̧?껋ãy¬?êºñrdð?êºñmu?êºÉRÊŒ˜?êºÉMËH?꺡3ä÷?꺡.¨}?êºyãâÒ?êºy ä­Ø?êºPòC‘2?êºPíDc¸?êº(Ñ/û)?êº(Ì0Õ/?꺯©+Á?꺪ª H?ê¹Ø®Z­?ê¹Øˆ¯Cµ?ê¹°k?)W?ê¹°f@à?깈H]I€?깈C^AŠ?ê¹`%\ˆ?ê¹` \?ê¹8?š1?ê¹7ü@¡=?ê¹Ý´?ê¹Ø¨?ê¸ç¸VÀ?ê¸ç³W$Î?긿“3K™?긿Ž4i(?긗mž9?긗hŸAJ?ê¸oG•NÍ?ê¸oB–{_?ê¸G!X ?ê¸GŒ?ê¸ú*¬•?ê¸õ+è*?ê·öÒÈíÞ?ê·öÍÊ0õ?ê·ÎªòêA?ê·Î¥ô4Ú?ê·¦‚ªS ?ê·¦}«¥t?ê­H=ÞÂ(?ê­H8â{?ê­÷p@3?ê­òsŠ ?ê¬÷°Ä?ê¬÷«“z?ê¬Ïi<ï¬?ê¬Ïd@H–?꬧!x ?꬧|‡?ê¬~ÙA;ö?ê¬~ÔD£ð?ê¬V—7b?ê¬V‹š¦ä?ê¬.G{d?ê¬.B~}n?ê¬ýìJä?ê¬øïÉu?ê«Ý³ëxî?ê«Ý®îÿ?ꫵix2n?ꫵd{À?ê«’ëd?ê«–€Ž?ê«dÓ<Ð?ê«dÎ?´ƒ?ê«<‡rðš?ê«<‚v”Ö?ê«;7À?ê«6:Ä?êªëî‰j=?êªëéŠ?êªÃ¡i!?êªÃœlÛå?ꪛSÖ°2?ꪛNÚr‘?êªsÒ‹›?êªsÖUƒ?êªJ·[ìO?êªJ²_½À?êª"hs¯’ÛÑ"?ê¨>à?ê¨>+Â?ê¨9/ºº?ê§íé ÁY?ê§íäÜ?ê§Å“v Ü?ê§ÅŽzêé?ê§=r’ ?ê§8vã·?ê§tæûü¸?ê§tâUÚ?ê§Lγ?ê§L‹/_?ê§$8„ƒ?ê§$3ˆëÇ?ê¦ûà”ø?ê¦ûÛ™gÖ?ê¦Óˆ37?ê¦Óƒ7®h?ꦫ/^yà?ꦫ*bø·?ꦂÖ4?ꦂѺw?ê¦Z|]Ñ?ê¦Zwa•¿?ê¦2"0ш?ê¦25g?ê¦ Ç’3Q?ê¦ Â–ÐV?ê¥ál€f{?ê¥ág… ?ꥹýÄ?ꥹ -ß?ꥵìö?ꥰ  ?ê¥hX ²?ê¥hS¤Öå?ê¥?ûÆÕ?ê¥?öÊÛ“?꥞y†‡?꥙~PÒ?ê¤ï@ºØ_?ê¤ï;¿ª5?ê¤ÆâŠA?ê¤ÆÝŽò£?ꤞƒæëP?ꤞ~ëÌ>?ê¤v$ÑYt?ê¤vÖAî?ê¤MÅI×?ê¤%`UÏÑ?ê£ýäÄŽ?ê£üÿéî?ê£Ô¤IÔ?ê£ÔŸ P€?꣬B·¡‘?꣬=¼¯Ê?ꣃàõÖ¢?ꣃÛúìg?ê£[~ÂÅ>?ê£[yÇâ?ê£3Õž?ê£3!ú|?ê£ ¹²?ê£ ´ ??ê¢âUz)ò?ê¢âP]ê?ꢹñ~½•?ꢹìƒù?ꢑ2?ꢑˆJD?ê¢i(1zV?ê¢i#6Äö?ê¢@Âß¹@?ê¢@½å m?ê¢]7t?ê¢X!‘/?ê¡ïöçhe?ê¡ïñìÉ®?ê¡Ç@…É?ê¡Ç‹EîŸ?ê¡Ÿ)'š?ê¡Ÿ$- å?ê¡vÁë.?ê¡v¼£c?ê¡NY¢Hð?ê¡NT§Èo?ê¡%ñ5'>?ê¡%ì:®K?ê ýˆVù…?ê ýƒ\ˆ?ê Õù?ê Õ '"?ê ¬µCøˆ?ê ¬°I–??ê „K +?ê „F±p?ê [àk?H?ê [Ûpì?ê 3uTË°?ê 3pZ€?ê  Ì¼E?ê  Òx5?êŸâÒ³p?êŸâ˜Øvï?ꟺ1g?ꟺ,mX ?ꟑĊëŽ?ꟑ¿¾+?êŸiW=BI?êŸiRCt?êŸ@é}b¬?êŸ@äƒDf?êŸ{Mb?êŸvSKK?êžð «©F?êžð±š?êžÇ˜«Ò?êžÇ˜ž¤:?ꞟ.t‰?ꞟ)t?êžv¾¥à?êžv¹$­e?êžNM·J¾?êžNH½YÓ?êž%Üß>å?êž%×åUŠ?êýk–$Æ?êýfœBú?êÔùÜD?êÔôâ-?꬇±Y«?ꬂ·†ÿ?ê„í£?ê„"‡?ê[¢6~?ê[ rñ?ê3.wUd?ê3)}™g?ê ºdˆ)?ê µjÓ¼?êœâEßæÄ?êœâ@æ9ç?ꜹÐé{ô?ꜹËïÖ§?꜑[R€?꜑V‡´Ä?êœh妤{?êœhà­O?êœ@oZµ¸?êœ@ja'?êœøœÀJ?êœó£9??ê›ïlf©?ê›ï|rç/?ê›Ç ɳŸ?ê›ÇÐ;¶?ꛞ‘µ‚ž?ꛞŒ¼F?ê›v/v?ê›v6 S?ê›M 8iy?ê›M›?B?ê›%&Ï.?ê›%!ÕÔê?êšü¬ô8z?êšü§úæe?êšÔ2§’?êšÔ-®G}?êš«·éEë?êš«²ðú?ꚃ<¹^ÿ?ꚃ7À#Ÿ?êšZÁPH?êšZ¼z?êš2EëÆ?êš2@ ¿‰?êš È¤ˆ?êš Ã†Ü?ê™áKˆíœ?ê™áFЂ?ꙸΠÑÆ?ꙸÉ'¼>?ê™PF‹\?ê™KM}f?ê™gÑû]Ò?ê™gÍWn?ê™?S>ƒƒ?ê™?NE„±?ê™ÔŸ?ê™Ï§Ä?ê˜îTp[ð?ê˜îOwlB?ê˜ÅÔ_ô¢?ê˜ÅÏg ‡?ê˜SÝ£‚?ê˜NäÂù?ê˜tÒéÛŒ?ê˜tÍñ–?ê˜LQ„§Œ?ê˜LL‹Ö(?ê˜#Ï®zw?ê˜#ʵ°¦?ê—ûMgÇ;?ê—ûHoý?ê—ÒÊ®÷ý?ê—ÒŶ=Q?ê—ªG…P?ê—ªBŒœé?ê—Ãê Ê?ê—¾ñ^E?ê—Y?Þf?ê—Y:å\s?ê—0»`nY?ê—0¶gÑù?ê—6qÆ”?ê—1y1È?ê–ß±«À?ê–߬‡?ê–·+@øæ?ê–·&Hs@?ê–Ž¤ÿP¯?ê–Ž Ò?ê–fLUÌ?ê–fSßM?ê–=—({%?ê–=’0 ;?ê–”3’?ê– ›Ì;?ê•ì‡ŽQ¥?ê•ì‚•ñá?ê•Ãÿ^?ê•ÃúÀ/?ê•›v1*t?ê•›q8ÙØ?ê•rìÙ*¡?ê•rçàáš?ê•Jc#¸?ê•J^âE?ê•!ØÖˆˆ?ê•!ÓÞN©?ê”ùN+“Ô?ê”ùI3a‰?ê”ÐÃPh?ê”о%²?ꔨ7ƒi$?ꔨ2‹F?ꔫ…àÁ?ꔦÅ4?ê”Wb?ê”W N?ê”.’9¿à?ê”.A³|?ê”êÔõ?ê”ÿòÐ&?ê“Ýw+D?ê“Ýr3Fã?ê“´èû€?ê“´äŠx?ê“ŒZZÃÑ?ê“ŒUbÕÁ?ê“cËH²?ê“cÆPËš?ê“;;Ç]y?ê“;6Ï~“?ê“«Ä ?ꓦÌ:Ð?ê’ê>r¼?ê’êF£?ê’ÁŠGÑÕ?ê’Á…P ¯?ê’˜øßjA?ê’˜ó穱?ê’pg®ž?ê’pb õ£?ê’GÔº©˜?ê’GÏÂø3?ê’Aý–?ê’=ìC?ê‘ö®ÏN?ê‘ö©×¬S?ê‘Î0Eœ?ê‘Î8ªù?ê‘¥‡¶#?ê‘¥‚(#?ê‘|òBø?ê‘|í¥·‚?ê‘T]©ÆŒ?ê‘TX²B«?ê‘+ÈDã±?ê‘+ÃMgg?ê‘2n¥?ê‘-w0i?êÚœ'å,?êÚ—0x?ê²oÞá?ê²xyZ?ê‰nFœè?ê‰iO>ø?ê`Ö¬ùš?ê`ѵ£@?ê8>¡`]?ê89ªš?ê¦$«‡?ê¡-d[?êç 7Mš?êç@?ê¾sײ?ê¾nàz?ê•Úê¨?ê•ÕºA?êm?ÆÊ ?êm:Ï¡Ñ?êD¥Ä{?êD £C?ê òJ±?êû1?êŽón^0¡?êŽóig˜?êŽÊÒYPŠ?êŽÊÍbF?ꎢ5ãM\?ꎢ0ìJ?êŽy˜ýI?êŽy”?êŽPû¦@?êŽPö¯•?êŽ(]Þ4?êŽ(Xç.!?êÿ¿¥,à?êÿº®He?ê× ûQó?ê×u?ê®ác?ê®|êŽB?ê…âW¤?ê…Ý`6ñ?ê]B[pŠ?ê]=dªp?ê4¡ï¢?ê4œø[ ?ê rR?ê ü»h?êŒã_Ř?êŒãZÎnG?ꌺ¾&,?ꌺ¹~t?ꌒØþj?ꌒâ^J?êŒiy:IX?êŒitC°Ñ?êŒ@Ö*ª?êŒ@Ñ4?êŒ2ªúp?êŒ-´q?ê‹ïŽºÝ¥?ê‹ï‰Ä[é?ê‹ÆêYö¸?ê‹Æåc|•?ê‹žE‰‡:?ê‹ž@“±?ê‹u Gûd?ê‹u›Qt?ê‹Lú•Å?ê‹LõŸb6?ê‹$Tt'6?ê‹$O}Ëx?êŠû­áŒ¬?êŠû¨ë8ˆ?êŠÓß7j?êŠÓèêß?ꊪ_lb÷?ꊪZv?ꊷ‰™?ꊲ“DB?êŠY66x?êŠY @»?êŠ0fróÒ?êŠ0a|Å®?ꊽ?\Ï?ꊸI6F?ê‰ßœK?êƒ1¨%bá?êƒðqEÈ?êƒë|n ?ê‚à3W‘?ê‚à.bÀá?ê‚·uÎdB?ê‚·pÙ›¿?ê‚Ž·Ôû¨?ê‚Ž²à:Ã?ê‚eùkaÔ?ê‚eôv¨?ê‚=:‘¡b?ê‚=5œï¹?ê‚{H,$?ê‚vS‚?ê뻎¥€?ê붚?êÂûeD?êÂöpäu?êš:Ì\Û?êš5×É«?êqyÃHá?êqtνP?êH¸JMò?êH³UÉþ?êöaÝÖ?êñma?ê€÷4 "?ê€÷/Žl?ê€ÎqA+Ù?ê€ÎlL¾Â?ꀥ® 4¢?ꀥ©Ï*?ê€|êbV?ê€|åmø=?ê€T&JÐ>?ê€T!Vz?ê€+aí½?ê€+\Ï_"?ꀜÍ`C?ꀗÙG?êÙ×f½?êÙÒr}À?걑kR?ê± 3•?êˆKKÙ?êˆFW¨ù?ê_„—FR?ê_£Ô?ê6½rïp?ê6¸~Α?ê õÞß?ê ðêÅÓ?ê~å-Ûíú?ê~å(çÜ[?ê~¼eX7ñ?ê~¼`d-ò?ê~“œT&þ?ê~“—`$Ÿ?ê~jÒßà?ê~jÍë!?ê~BúGC?ê~BT$?ê~>¥[–?ê~9±p?ê}ðsßH?ê}ðnë¬i?ê}Ǩ©½ï?ê}Ç£µá±?ê}žÝˆ?ê}žØ³d?ê}vì’?ê}v øÅ ?ê}MDeM„?ê}M?qˆ'?ê}$wn’ö?ê}$rzÕ:?ê|ûª7á?ê|û¥Æ?ê|ÒÜ0Æ?ê|Ò×p?êy¢f‹(˜?êyy”yk?êyy†6?êyP½B?êyP¸¯?êy'å¥q?êy'à+¦?êxÿ ÊþÐ?êxÿ؃?êxÖ4-Ô?êxÖ/>*?êx­ZÒ¥á?êx­Uß½Ù?êx„/£Ü?êx„|<Ãx?êx[§d¶?êx[¢)‹õ?êx2Ìš'P?êx2ǧV3?êx ñ¨ö0?êx ì¶,µ?êwáG§~?êwáTå§?êw¸:wR?êw¸5„Y?êw^7ªî?êwYDø^?êwf‡ÝÕ?êwf|•2é?êw=¤hêÏ?êw=ŸvG†?êwÆÚÜ`?êwÁè@»?êvëèÞ#À?êvëãë¿?êvà qþ?êvÃq¦?êvš+—C?êvš&¤¾]?êvqLK•??êvqGY*?êvHl‘Íú?êvHgŸXŠ?êvŒi‘?êv‡w#C?êuö«ÐçŽ?êuö¦Þf?êuÍÊÉÝn?êuÍÅ×~ê?êu¤éTƒ?êu¤äa¿¤?êu|nÏø?êu||€½?êuS%zþ?êuS (3h?êu*BWˆÅ?êu*=eHÔ?êu_$i:?êuZ20î?êtØ{ƒ(?êtØv÷w?êt¯—siP?êt¯’@N?êt†²ã?êt†­ðóÁ?êt]ÍÓÅX?êt]Èá« ?êt4èUD?êt4ãbÿ2?êt ehÞ?êt ýs^p?êsãpþ?êsãn6?êsº57fß?êsº0Ek½?ês‘Mø»ƒ?ês‘IÈ?êshfJ¿?êshaX&è?ês?~+Ý‘?ês?y9ù`?ês•ž&g?ês¬IÜ?êrí¬ *…?êrí§®U ?êrÄÃ3( ?êrľAZË?êr›ÙU(£?êr›Ôcc ?êrrïý?êrrêà ?êrJM+ô?êrIÿ[u§?êr!!BÔ?êr!/”.?êqø-†‡ ?êqø(”à?êqÏA|œ½?êqÏ<Šýc?êq¦UŒ?êq¦PõÙ?êq}hË?êq}c&:ú?êqTz¾ù?êqTuÍp­?êq+Œõî§?êq+ˆmè?êqž½ƒ,?êq™Ì ?êpÙ°ôt?êpÙ«%ƒ?êp°ÁLŒ?êp°¼âÃ?êp‡ÑzbÒ?êp‡Ì‰¯?êp^ᆜ?êp^Ü”´ ?êp5ñ óž?êp5ì/ Ê?êp L¶?êp û[jí?êoä Ææ?êoä ƒ`?êo»WÉü?êo»fŽ?êo’+5üò?êo’&Dȼ?êoi8¥x?êoi3´pé?êo@E¦OŠ?êo@@µ*£?êoR6êf?êoMEÍ'?ênî^Y?ênîYgüw?ênÅj È?ênÅeÙ?ênœuOË"?ênœp^ÄÜ?êns€$×È?êns{3Ù*?ênJŠŠgÊ?ênJ…™pÔ?ên!”RR?ên!c?êmøž ¡Ê?êmø™º%?êmϧ"“ê?êmÏ¢1³í?êm¦¯ÌÿÔ?êm¦ªÜ'€?êm}¸#F?êm}³R›?êmT¿Ô²?êmTºã?¯?êm+Ç1‡0?êm+Â@Å×?êmÎ ©"?êmÉ/ïr?êlÙÔ F?êlÙϯ”?êl°Ú²˜?êl°ÕÁW9?êl‡àT³D?êl‡ÛdŽ?êl^åˆËÍ?êl^à˜0Á?êl5êN»å?êl5å^(ƒ?êl î¦'²?êl éµ›ù?êkãòæÕ?êkãíbÅ?êkºöœÏ?êkºñ h?êk‘ùíÆ?êk‘ô"y ?êkhû®K4?êkhö½Þ!?êk?ýÛ¾Á?êk?øëYX?êkÿšìœ?êkúªŽÝ?êjîëxó?êjíûû"Þ?êjÅÍn=?êjÄüÝÒ?êjœA£N?êj›ýQ\Ž?êjsGV+?êjrýW?êjJÍÔè?êjIüÝ|?êj!Õ{?êj ûåQº?êi÷ÿmaÇ?êi÷ú}9°?êiÎý–²ª?êiÎø¦’=?êi¥ûQD?êi¥ö`ÿ‚?êi|ø›jj?êi|ó«YS?êiSõv¦?êiSð†:?êi*ñâÈà?êi*ìòÇ?êiíß‹?êièï#t?êhØélºŽ?êhØä|È#?êh¯ä‹ª>?êh¯ß›¿}?êh†ß:Ĉ?êh†ÚJás?êh]Ùzà?êh]Ô‹œ?êh4ÓM9Z?êh4Î]eœ?êh ̯v4?êh Ç¿ª!?êgâÅ¢Ó¥ó'?êg> *Mo?êg›â¿Ð?êg–ó!Ã?êfì’<‚?êfìLˆ"?êfÈ'K¼?êfÃ7½?êfš}¢S–?êfšx²ÌŽ?êfqr¯¤«?êfqmÀ%O?êfHgN}1?êfHb_?êf[|ég?êfVyd?êeöO=½Ê?êeöJNUt?êeÍBžž?êeÍ=¡=ô?êe¤5s˜6?êe¤0„?9?êe{'è²ä?êe{"ùa”?êeRîÇ?êeRÿ}b?êe) …xý?êe)–7?êdÿü®?êdÿ÷¾ÊÈ?êdÖíhÛ‡?êdÖèy¨ê?êd­Ý´nÖ?êd­ØÅCç?êd„Í‘û8?êd„È¢×ö?êd[½% ?êd[¸ x?êd2¬*Æ?êd2§Þ?êd š“®|?êd •¤¢B?êcàˆ¶¼Þ?êcàƒÇ¸R?êc·vk, ?êc·q|/B?êcŽc²8Z?êcŽ^ÃC)?êcePŠº"?êceK›ÌŸ?êc<<ôUå?êc<8p?êc(ïáÌ?êc$¥?êbê}h(?êbꎑ¯?êbÀÿœ'“?êbÀú­XÉ?êb—êLö ?êb—å^/?êbnÔÞ#?êbnÏ¡´?êbE¾d??êbE¹uf?êb§ÊòU?êb¢ÜBC?êaóÃþß?êaó‹ÕV|?êaÊyN‚ƒ?êaÊt_áÏ?êa¡aj!Ë?êa¡\{ˆÆ?êaxIä2?êaxD*RÛ?êaO0XÖî?êaO+jMF?êa&*Ïÿ?êa&t0?ê_Ý9%/±?ê_´ æƒç?ê_´øG?ê_‹Kô?ê_Šþ\ËÕ?ê_aå@Ù?ê_aàRbj?ê_8ÆÈJ?ê_8ÁÙà‹?ê_§à=T?ê_¢òE?ê^戉¤ð?ê^惛Ž‘?ê^½hÅÊ?ê^½c×?ê^”H’+d?ê^”C¤$e?ê^k'ïb-?ê^k#bÞ?ê^BÞX5?ê^Bð`–?ê^å_}i?ê^àq|?ê]ïÃqªð?ê]ﾃ³?ê]Æ¡ë?ê]Æœ' †?ê]~I­»?ê]y[Ôß?ê]t[bÒ?ê]tV"‘§?ê]K7h®ä?ê]K2zåj?ê]"Rœ:?ê]"dÚq?ê\øîÍÏe?ê\øéàM?ê\ÏÉÛð?ê\ÏÄík‰?ê\¦¤yÆÏ?ê\¦ŸŒ?ê\}~ª9è?ê\}y¼–ä?ê\TXk¶;?ê\TS~è?ê\+1¿Ü}?ê\+,ÒHÛ?ê\ ¤ºâ?ê\·.ò?ê[Øãò?ê[ØÞ.m×?ê[¯»$Á ?ê[¯¶7D“?ê[†’¿2G?ê[†Ñ½l?ê[]iëµ\?ê[]dþH3?ê[4@ªº,?ê[4;½Tµ?ê[ ú´°?ê[  Vë?êZáìÝEp?êZáçïï^?êZ¸ÂR ?êZ¸½d«?êZ—XV²?êZ’k?êZfkðëº?êZfg¬¾?êZ=@tÔ?êZ=;.=Š?êZ×1>?êZê§?êYêç&&Æ?êYêâ8þá?êYÁº/#?êYÁµò?êY˜Œy‰‘?êY˜‡Œq?êYo^~ÖQ?êYoY‘Å…?êYF0T¡?êYF+)Kˆ?êY?CÎ?êYüRBg?êXóÑúy?êXóÍ ]?êXÊ¢Hd?êXÊ[r?êX¡r'ÞÏ?êX¡m:ô‚?êXxAš#Ì?êXx<­A2?êXOŸ=J?êXO ²bd?êX%ß5:T?êX%ÚHg"?êWü­^…Ô?êWü¨qºU?êWÓ{ùµ?êWÓv-5ê?êWªHg ;?êWªCzä#?êWGé?êW[4²?êWWá»Cæ?êWWÜΗ6?êW.­À%M?êW.¨Ó€Q?êWyWÇÉ?êWtk*?êVÜD‚šó?êVÜ?–_?êV³?xå?êV³ Rë?êV‰ÙŽÑE?êV‰Ô¢K?êV`£qy ?êV`ž„ú•?êV7læJd?êV7gùÓ¢?êV5íO’?êV1àƒ?êUäþ‡Ââ?êUäù›[ˆ?êU»Æ£Z ?êU»Á¶úh?êU’ŽBj?êU’‰V?êUiUs>Ï?êUiP†î”?êU@5ì?êU@HÏf?êU≔É?êUÝSø?êTí¨pZ7?êTí£„!?êTÄmçwÜ?êTÄhûFu?êT›2ñ¼ô?êT›.“B?êTq÷ž|?êTqò¡|€?êTH»»&œ?êTH¶Ï V?êT{*?êTzt?êSöBÍMš?êSö=áB¾?êSÍ°k¶?êSÍÄh?êS£È%¾P?êS£Ã9Âà?êSzŠ. ?êSz…B&P?êSQKÇô ?êSQFÜ ?êS( ó»Â?êS(×s?êRþͱàŒ?êRþÈÆó?êRÕŽ¢?êRÕ‰Í9?êR¬Mä:J?êR¬Høm?êRƒ XèÇ?êRƒm#Q?êRYÌ^íZ?êRYÇs/›?êR0Š÷•?êR0† fŒ?êRI"°3?êRD7á?êQÞÞî ?êQÞóGn?êQ´Ä/ ¸?êQ´¿CjÓ?êQ‹~?êQ‹|%|P?êQb=…Š?êQb8™†?êQ8ùŒIz?êQ8ô Áº?êQµ$¿¸?êQ°9?¯?êPæpP|&?êPækeÔ?êP½+¾£?êP½&#N?êP“å_‘T?êP“àt(p?êPjŸB4$?êPjšVÒø?êPAX·{€?êPASÌ" ?êP¿q‹?êP ÔÍ?êOîÊY»T?êOîÅnqN?êOÅ‚†c ?êOÅ}› »?êOœ:F¢?êOœ5[g?êOrñ˜îF?êOrì­»g?êOI¨}QÈ?êOI£’&¡?êO ^õ?êO Z â“?êN÷ÿJô?êN÷/=?êNÍʛž?êNÍÅ°±¿?êN¤ÌyÈ?êN¤zám‚?êN{4ŽHÚ?êN{/£DL?êNQèã6]?êNQãø9‡?êN(œË±x?êN(—à¼Z?êMÿPEË:?êMÿKZÝÕ?êMÖS†ç?êMÕþh¡;?êM¬µôîŸ?êM¬± «?êMƒh(†?êMƒc==K?êMZî“È?êMZÅF?êM0ËH”?êM0Æ]MË?êM|4;?êMwI|?êLÞ,³vk?êLÞ'È¿?êL´ÜÆ5Â?êL´×Û†%?êL‹ŒkTW?êL‹‡€¬s?êLb;¤ :?êLb6¹k?êL8êpd?êL8å…Ì?êL˜ÎÖµ?êL“äEý?êKæFÀÿ¢?êKæAÖv£?êK¼ôGNd?êK¼ï\Í?êK“¡_ §?êK“œt‘?êKjMú×ÿ?êKjIf-?êK@úC?êK@õ/Øú?êK¥Ë …?êK à§(?êJîQd)?êJîL$ …?êJÄûä] ?êJÄöú ?êJ›¦KÏŽ?êJ›¡a„_?êJrPEôr?êJrK[°þ?êJHùÓŸ‚?êJHôécÈ?êJ¢òân?êJž®n?êIöK¤õç?êIöFºÉ¢?êIÌóé?êIÌîÿZ’?êI£›À#I?êI£–Öy?êIzC)Q[?êIz>?æÝ?êG79+>?êG ß²â?êG Ú.È?êFä­E?êFäzë½?êF»ÕBà?êF»ë±>?êF‘¿¿?êF‘º¦õÚ?êFh^Þ¡ ?êFhYõâ?êF>ý¾çl?êF>øÕlÿ?êFœ2ïÒ?êF—I}"?êEì::ÄB?êEì5QYO?êEÂ×Ôª?êEÂÒê¯t?êE™uAB?êE™påÈ?êEpÂZ?êEp ÙS?êEF®oÍ?êEF©,#Í?êEIü:?êEEÚ÷?êDóåv À?êDóàŒÑ9?êDÊ€‚àÊ?êDÊ{™¬?êD¡#?êD¡9Ú?êDwµWSï?êDw°n. ?êDNOÚF?êDNJ4¼µ?êD$èwÒ?êD$㎼B?êCûf¥?êCû|}Ž?êCÒæ>\?êCÒý8?êC¨±úÆø?êC¨­È]?êCI£Mã?êCDºW?êCUàÝæD?êCUÛô÷%?êC,w¬‘?êC,réº?êCXy?êC &xÖ?êBÙ¤´&?êBÙŸÜ@?êB°9w\?êB°4¤§4?êB†ÎªÃ?êB†ÉÁHY?êB]cZŠh?êB]^qɽ?êB3÷ž‰Î?êB3òµÐá?êB ‹v}”?êB †Ìf?êAáàÝ°?êAáø4@?êA·±ßªÜ?êA·¬÷ +?êAŽDr&?êAŽ?‰Œ+?êAdÖ—õ?êAdѯbÑ?êA;hQê­?êA;ci`8?êAù:?êAô§•„?ê@èŠQ>˜?ê@è…há?ê@¿¥MÅ?ê@¿¼Ú?ê@•ª­?ê@•¥¤­4?ê@l:^?ê@l5³¤?ê@BÉA?ê@BÄ,%H?ê@Wµ`I?ê@RÍ ?ê?ïåè, ?ê?ïàÿà%?ê?Æs®‚?ê?ÆnÆ=V?ê? ?ê?œüÉ$?ê?só•}?ê?s‰ `A?ê?Js”º?ê?J‹g>?ê? ¦†¨?ê? ¡ñë?ê>÷2+(O?ê>÷-C S?ê>ͽc5?ê>͸{Ø?ê>¤H/Á?ê>¤CGE?ê>zÒ˜?ê>zÍ¥‘^?ê>Q\é?ê>QW—ží?ê>'æ,$?ê>'á4é?ê=þoèd?ê=þj5øê?ê=Ô÷ÉxG?ê=Ôòá?ê=«€ w=?ê=«{!—C?ê=‚Ûùr?ê=‚ô!:?ê=XAÑ™?ê=XŠZ!?ê=/;Ò`?ê=/T ©?ê=œÈtb?ê=—à³l?ê<Ü"è%ö?ê<ÜlÁ?ê<²¨›Uq?ê<²£³£ý?ê<‰-â Î?ê<‰(úc?ê<_²¼ºR?ê<_­Õa?ê<67*;?ê<62B à?ê< »+Åî?ê< ¶D3?ê;ã>ÀœO?ê;ã9Ù¢?ê;¹Áé,x?ê;¹½©Œ?ê;D¥?ê;?½ ô?ê;fÆôÙ„?ê;f f?ê;=HØ e?ê;=Cðž¾?ê;ÊN¸¸?ê;ÅgTÔ?ê:êKYRÂ?ê:êFqöŸ?ê:ÀË÷âz?ê:ÀÇŽ?ê:—L)E$?ê:—GAø†?ê:mËï³?ê:mÇÐÖ?ê:DKH1n?ê:DF`ôT?ê:Ê5jÍ?ê:ÅN5u?ê9ñH¶gŒ?ê9ñCÏ9÷?ê9ÇÆËú?ê9ÇÁäÔ>?ê9žDt7Z?ê9ž?J?ê9tÁ±‚?ê9t¼ÊlB?ê9K>‚Tê?ê9K9›F`?ê9!ºæ¸f?ê9!µÿ±ž?ê8ø6ß6?ê8ø1ø1?ê8βk‡U?ê8έ„?ê8¥-Œ¿?ê8¥(¥@?ê8{¨@£m?ê8{£Y»²?ê8R"‰Ë†?ê8R¢ë?ê8(œf\“?ê8(—„^?ê7ÿ×?ê7ÿð¼?ê7ÕŽÝ©?ê7Õ‰ö9û?ê7¬uÿC?ê7¬>Y?ê7‚£U?ê7‚z¼›í?ê7X÷e?ê7Xò~\´?ê7/nºl?ê7/iÓÂr?ê7å¤A9?ê7ཟ]?ê6Ü\"—ˆ?ê6ÜW;ýp?ê6²Ò%KÔ?ê6²Í>¹?ê6‰G¬­y?ê6‰BÆ"é?ê6_¼Èo?ê6_·áš¤?ê661vyg?ê66,þ`?ê6 ¥¸/Y?ê6  Ñ¼?ê5ãŽA?ê5㧥Â?ê5¹Œö˜Ð?ê5¹ˆ5?ê5ÿò˜ ?ê5û <?ê5fr‚|Ü?ê5fmœ(¬?ê5<䥉?ê5<ß¿<°?ê5V\ò»?ê5Qv®?ê4éǧ—?ê4éÂÁZ­?ê4À8……?ê4À3ŸLh?ê4–¨÷‚€?ê4–¤U(?ê4mý¤d?ê4m~Ò?ê4Cˆ–Å?ê4Cƒ°§L?ê4÷ÃRŒ?ê4òÝ<„?ê3ðf„‚‹?ê3ðažtH?ê3ÆÔØÏ?ê3ÆÏòÈœ?ê3BÀ¦?ê3=Ú§[?ê3s°==B?ê3s«WFP?ê3JLFÓ?ê3JfW§?ê3 ‰ïÀk?ê3 … Ù?ê2öö(Ú?ê2öñB8:?ê2Íaòÿl?ê2Í] '‘?ê2£ÍRؘ?ê2£Èmƒ?ê2z8Fåf?ê2z3a?ê2P¢Î?ê2PèCw?ê2' éj ?ê2'±H?ê1ýv™é0?ê1ýq´84?ê1ÓßÜÐ?ê1ÓÚ÷&ã?ê1ªH´"?ê1ªCÎz³?ê1€± ; ?ê1€¬:¡a?ê1W ?ê1W:y9?ê1-€³ú?ê1-{Îoý?ê1çÜuÂ?ê1âöón?ê0ÚN—øš?ê0ÚI²~ ?ê0°´èÇ?ê0°° ?ê0‡ÍMx?ê0‡çây?ê0]€FÂ?ê0]{`¤Š?ê03åS€2?ê03àn$Á?ê0 Iôù ?ê0 E¥`?ê/à®*ßþ?ê/à©E”?ê/·õ>ø?ê/· úÝ?ê/uTƒ¨?ê/poGT?ê/cØG(Ä?ê/cÓaô9?ê/::ÎÇb?ê/:5éšž?ê/œëž?ê/˜à¢?ê.æþšÂ?ê.æùµ¤Ó?ê.½_ß1á?ê.½Zút?ê.“À¹&Ž?ê.“»Ôê?ê.j!&Sn?ê.jAM’?ê.@)è?ê.@|DÔ?ê.à¿ñç?ê.ÛÚû›?ê-í?ëL?ê-í;]?ê-Þ«1V?ê-ÙÆJ›?ê-™ýL?ê-™ø0Y?ê-pZé(p?ê-pVQE?ê-F¸gN?ê-F³‚~´?ê-z&k?ê-•^Ò?ê,ór!»[?ê,óm<ûŠ?ê,ÉÎ^Ì?ê,ÉÉy^Å?ê, *0 ÿ?ê, %KYÁ?ê,v…•¬{?ê,v€±?ê,Là€ý2?ê,LÛœ\†?ê,#:òH?ê,#6 ¯#?ê+ù”ömØ?ê+ùܾ?ê+Ïî?ê+Ïéª}Å?ê+¦G¼‰?ê+¦Bל?ê+| |?ê+|›˜Y?ê+RøÐÌ3?ê+RóìZ??ê+)P¹¢ï?ê+)KÕ8Ä?ê*ÿ¨5ó:?ê*ÿ£QÚ?ê*ÕÿGU\?ê*ÕúbúÅ?ê*¬Uí à?ê*¬Q¹?ê*‚¬&Yf?ê*‚§Bc?ê*Yôî?ê*Xý˵?ê*/WUo?ê*/Rq3°?ê*¬KJñ?ê*§gM?ê)ÜÕH¢?ê)ÛûñÈ?ê)²Tô9 ?ê)²P?ê)ˆ¨¦—ü?ê)ˆ£Â{¶?ê)^ûí6$?ê)^÷ !©?ê)5NÉH?ê)5Iå;]?ê) ¡8º?ê) œTÕ?ê(áó<|À?ê(áîX¥?ê(¸DÔÝÈ?ê(¸?ðèx?ê(Ž–¯.?ê(Ž‘Á¨?ê(dæ—>?ê(dáÞ±„?ê(;7ÊM?ê(;24ì^?ê(‡`¦?ê(‚Š‚?ê'çÖ€ò?ê'çÑ#Æ?ê'¾%”ˆ€?ê'¾ °Áó?ê'”t<$?ê'”oXDb?ê'jÂx2Õ?ê'j½”{ß?ê'AI„Ø?ê'A eÕ­?ê']®Ø˜?ê'XË18?ê&íª¨þÖ?ê&í¥Å_B?ê&Ã÷8dÎ?ê&ÃòTÍ?ê&šC[éø?ê&š>xYü?ê&pû ?ê&pŠ0sp?ê&FÚaÍÚ?ê&FÕ~Mv?ê&%Cè?ê& _Q?ê%óo¹Î¼?ê%ójÖ]ð?ê%ɹÆ?ê%É´â™?ê% f ?ê%Ÿþƒ.m?ê%vL›?ê%vG¸'¶?ê%L•f ’?ê%L‚¸÷?ê%"ÝĨC?ê%"Øá^u?ê$ù%¸ñŠ?ê$ù Õ¯‰?ê$ÏmB)r?ê$Ïh^ï>?ê$¥´_/µ?ê$¥¯{ýN?ê${ûþü?ê${ö.Ôb?ê$RAZ=³?ê$R ?ê!¶h˜?ê!Œ«ü$•?ê!Œ§†o?ê!bê¢;À?ê!bå¿¥i?ê!9(Üc‹?ê!9#ùÕ?ê!f«Ïb?ê!aÉH¨?ê 备?ê åŸ-Cœ?ê »á€I?ê »Ü% -?ê ’”Ÿ•lq?ê >Šh?ê зšª?ê ËÕBÉ?êë —é?êëµ™?êÁF <€?êÁA)ô=?ê—€e ?ê—{3$—?êm¹³Ï“?êm´Ñ–ï?êCòå– ?êCîe7?ê+­"?ê&Êì?êðd ó\?êð_'Ò&?êÆ›ú­ë?êÆ—”…?êœÓ€Û?êœÎžÉ}?ês œ„‰?êsºzÂ?êIALŠ¦?êI¾?êN€§1?êN{Å]î?ê$´jLN?ê$¯ˆ?êúçÞj?êúâáÚõ?êѱAÁ?êÑφ?ê§M4,?ê§HRRX?ê}L»?ê}zk{?êS°úBP?êS¬ž?ê)â=g?ê)Ý[k?êw€?ê3âð?êÖC­@?êÖ>  ?ê¬s„ƒ?ê¬n¢”?ê‚£†ú?ê‚ž; Ý?êXÒIOX?êXÍgÚ ?ê/ `?ê.ü*"æ?ê/c¶Ä?ê*‚Q?êÛ]P£L?êÛXoEt?걊Ó%¯?ê±…ñÏ©?ꇷëG¤?ꇳ ùo?ê]䘯ë?ê]ß·i‰?ê4Ü.2?ê4 úï¡?ê <µB?ê 7Óσ?êàh#AÚ?êàcBí?궓&êº?궎Eß?ꌽÀÐx?ꌸ߱/?êbçïÔ?êbã¼?ê9´Äô?ê9 ÓµO?ê;­?ê6.¥.?êåcÿm,?êå_m-?껌…7í?껇¤?À?ê‘´¡ÜÃ?ꑯÀìi?êgÜSvô?êg×rŽl?ê>šÖ?ê=þ¹õL?ê*xf‰?ê%—§?êêPë ª?êêL 8›?êÀvô·s?êÀrî7?ê–œ“î*?ê–—³,Â?êlÁ¸µÓ?êl¼×ü=?êBæeAß?êBá„?ê ¦‡Š?êÅÝ›?êï.|€?êï)›îd?êÅQèñ«?êÅMWc?ê›técÂ?ê›pÑN?êq—ß?êq’žŽ=?êG¹©·Ö?êG´É5?êÛjr´?êÖ‰÷º?êóü¿Çé?êó÷ßTÄ?êʪ#ç?êÊɸ•?ê >*Uã?ê 9Iòe?êv^??*?êvY^ã€?êL}éL+?êLyøV?ê")®Ò?ê"˜IbÐ?êø»þ‚ó?êø·>Æ?êÎÚh—¾?êÎÕˆ[e?ê¤øi ?ê¤óˆêˆ?ê{þ4Ï?ê{ ?êQ3) á?êQ.Hæ?ê'OéH)?ê'K +#?êýl>0â?êýg^°?êÓˆ)¼A?êÓƒI®ä?ê©£ªi?ê©žÊc†?ê¾À@÷?ê¹àCD?êUÙl?êUÔŒ%?ê+ó­èÎ?ê+îÍúÆ?ê „£ô?ꤽÁ?êØ&ð°Ð?êØ"Òs?ê®?óA?ê®;jz?ê„XŠpâ?ê„Sª¢0?êZp¸š?êZkØÓ'?ê0ˆ|;n?ê0ƒœ|g?êŸÔ™~?êšôâM?êܶÂåÌ?êܱã6p?ê²ÍGŒ˜?ê²Ègå?êˆãao¬?êˆÞÏü?ê^ù#?ê^ô2‹E?ê5Xˆ¾?ê5 xøº?ê #4ª.?ê U"?êá7¦‘?êá2ÇÁ?ê·K®©¶?ê·FÏ15?ê_KÕð?êZleE?êcr©¿?êcm @ë?ê9…J.Á?ê9€jÍÃ?ê—©äU?ê’Ê‹.?êå©ŸûÔ?êå¤Àª„?ê»»,~Þ?껶M5e?ê‘ÌN²?ê‘Çop^?êgÝn?êgØ'Ç£?ê=íUvÍ?ê=èvDØ?êý9¹>?êøZ ?êê ´—p?êêÕu*?êÀŸ„?êÀæž?ê–*la?ê–%Nˆ?êl8ª$ç?êl3Ë'?êBF~H€?êBAŸE—?êSès?êO wþ?ê î`è®B?ê î\ » ?ê Äm¿?ê Äh ]?ê šy«¹?ê štÌ7/?ê p…n†³?ê p€«?ê FÈŒb?ê F‹é¸ˆ?ê ›¸p€?ê –Ù¤~?ê ò¦0VC?ê ò¡Q’?ê È°0,?ê È«Q`Û?ê ž¹Äõ²?ê ž´æA9?ê tÂîée?ê t¾<Å?ê J˯‹…?ê JÆÐæ½?ê Ô[ò?ê Ï&¿?ê öÛðd@?ê ö×Ï)?ê ÌãqÕ3?ê ÌÞ“Gõ?ê ¢ê‡Ì]?ê ¢å©F÷?ê xñ4?K?ê xìUÁ¾?ê N÷vr»?ê Nò—ý?ê $ýM«‚?ê $øo=¨?ê û»|­?ê úýÝ«?ê Ñ¿ïÂ?ê Ñá‘š?ê § Y"?ê §zÌ0?ê }ˆE’?ê } ©÷?ê SN'0?ê Soà“?ê )©©ß?ê )Ëk?ê ÿš×5?ê ÿ¼ K?ê Õ"ߺ?ê ÕD°ª?ê «@C¬?ê «bv?ê óÑC?ê ±æ?ê W"=/Á?ê W_>?ê -#h?ê -=ö¿?ê #‘çú?ê ³à+?êÙ#ž{±?êÙÀ{½?ê¯#@Aø?ê¯bIÝ?ê…"xö?ê…š¶?ê[!FžÄ?ê[h¶^?ê1ª!ž?ê1ÌA?꤆f?êÆ­µ?êÝ5Ö¤?êÝXÍ?ê³\’ë?ê³~Éï?ê‰ë„?ê‰<*b?ê_mê?ê_ 0º?ê5 Wq=?éù;Æ#)—?éù£n¬¢?éùž“ŸÝ?éøç{v4Å?éøçv›/â?éø½SAÏ?éø½N:DÎ?éø“*L>ã?éø“%qIÃ?éøi®Ù?éøhü>Áœ?éø>×!Í?éø>Ò¤?éô :– ?éóö ~?éóö3ê/?éóËÖCÿ?éóËÑiî—?éó¡¡ü²?éó¡œ6ô*?éówkt£y?éówfš¢Õ?éóM5p!/?éóM0–(p?éó"ÿ1?éó"ú)ŽV?éòøÈ-A ?éòøÃSX?éòÎ?éòÎŒ³u?éò¤YGƒ?éò¤Tm©Õ?éòz!7S?éòz]¾?éòOè¾ÐÛ?éòOãåw?éò%¯ÞÜ?éò%«D]?éñûv”š?éñûqºàk?éñÑ<â–¼?éñÑ8å?éñ§ÈfÎ?éñ¦ýî¼ý?éñ|ÈE²5?éñ|ÃlI?éñRZã¾?éñRˆI¸?éñ(RB?éñ(M-¯á?éðþJ©?éðþp‰m?éðÓÚ%ªg?éðÓÕL(?éð©˜ëv?é𩘿q?éð`£à>?éð[Êm²?éðU#F0Ä?éðUlÆ?éð*å „?éð*১Ã?éð§R ?éð¢y5E?éïÖh»ï ?éïÖcâœ?éï¬)½óV?éï¬$ä¨F?éïêV^i?éïå}??éïWª‡âô?éïW¥®§°?éï-jQf^?éï-ex3?éï)±lÒ?éï$ØA[?éîØè©æD?éîØãг?é:zÊ?éa_?éî„ebq3?éî„`‰]o?éîZ#"•~?éîZI‰ ?éî/àzñ ?éî/Û¡í?éîk+ü?é/ì?éíÛYó°ù?éíÛU¼Ï?éí±("?éí±;;ß?éí†ÑÌšà?éí†Ìó¶ƒ?éí\îW?éí\ˆ6á?éí2GÛ[6?éí2C†¨?éí>;£?éíýenü?éìݼ8¼¥?éìÝ·_÷å?éì³uÊç‡?éì³pò*®?éì‰.ô'?éì‰*N6?éì^ç´ÛA?éì^âÜ.7?éì4  ¶¹?éì4›4–?éì Wü?éì S#bÜ?éëà‚À¨?éëà ª+U?éëµÆ  Œ?éëµÁÈ ?éë‹}U©?éë‹x}#–?éëa3¢¥ø?éëa.Ê(\?éë6é†Þ?éë6ä®hg?éë Ÿ¼?éë š*N7?éêâTHú?éêâO=ã?éê¸ÁŽP?éê¸é0U?éê½qé?éê¸+Ö?éêcpÞCê?éêclõ¾?éê9$Pê2?éê9x£ï?éê×Yé’?éêÒ«8?ééä‰û0ÿ?ééä…"úŽ?ééº<4h£?ééº7\:?ééîd?ééé+îÄ?ééeŸlèL?ééeš”É”?éé;Pl¤?éé;K”D?ééuO?ééü,fi?éèæ±4V?éÛ¨”hw!?éÛ~(~B†?éÛ~#¨½@?éÛS·W5?éÛS²·Â?éÛ)EÈ$'?éÛ)@ò®À?éÚþÓÒûÊ?éÚþÎýŽR?éÚÔaw?éÚÔ\¡žŒ?éÚ©î³$?éÚ©éÝÆ÷?éÚ{ˆ'?éÚv²Ñô?éÚUöw?éÚU!)G?éÚ*“ü™Ï?éÚ*'T?éÚœ{õ?éÚÇ>?éÙÕªÕÆ ?éÙÕ¦6?éÙ«5§_ø?éÙ«0Ò1þ?éÙ€À³F?éÙ€»<=?éÙVJŠK?éÙVE@l1?éÙ+Ó²-Ì?éØÖàã8„?éجn|ø?éجiJ~ ?éØö Íw?éØñK×?éØW}»Ù?éØWxæê?éØ-à™ô?éØ- ³n?éØ‹Äÿ?é؆»æi?é×ØÚJÂ?é×Ø t?é×­—ºñ¯?é×­’æ"û?é׃4¥)?é׃_Þg?é×X¢G â?é×XrO?é×.&ñ³?é×."\Ó?é׫4Az?éצ_’Š?éÖÙ/?î?éÖÙ*;˜ð?éÖ®²ƒ–Ž?éÖ®­®÷‚?éÖ„5ø?éÖ„0»ùÝ?éÖY¸5¶­?éÖY³a'„?éÖ/:sÝ?éÖ/5ž‰¥?éÖ¼IÉÒ?éÖ·uJŒ?éÕÚ=¹)ï?éÕÚ8ä²›?éÕ¯¾Ày™?éÕ¯¹ì 6?éÕ…?`ã?éÕ…:Œ{©?éÕZ¿šoŒ?éÕZºÆ?éÕ0?l?éÕ0:—¯{?éÕ¾Ö?éÕºÃw?éÔÛ=Ù½Û?éÔÛ9v3?éÔ°¼u(?éÔ°·¡Or?éÔ†:©ðz?éÔ†5Õ¸¶?éÔ[¸w«¢?éÔ[³£{Ñ?éÔ15Þ ?éÔ11 á=?éÔ²Ý?éÔ®ò#?éÓÜ/u/ø?éÓÜ*¡þ?éÓ±«¦kö?éÓ±¦Ò[ï?éÓ‡'pnä?éÓ‡"œfÐ?éÓ\¢Ó¢4?éÓ\ÿ¢?éÓ2Îî3?éÓ2úö?éÓ˜cÝ*?éÓ“ìï?éÒÝ’ó?éÒÝ ¾/«?éÒ²ŒYGp?éÒ²‡…g?éÒˆ¹Õ?éÒˆåü§?éÒ]~³Éâ?éÒ]yßùs?éÒ2÷E®#?éÒ2òqå¨?éÒoql3?éÒj«¬?éÑÝç6¬ô?éÑÝâbô`?éѳ^“ø¡?éѳYÀH?éшՋ9ˆ?éшзÜ?éÑ^L¸Z?éÑ^GH¢?éÑ3ÂE?éÑ3½q…D?éÑ 84&?éÑ 34£V?éÐÞ­eÒ?éÐÞ¨‘zö?éд"Zn?é䆔†?éЉ–éS?éЉ’Ú#?éÐ_ E:?éÐ_=Ô9?éÐ4~ÒµV?éÐ4yÿLJ?éÐ ò-¬”?éÐ íZK|?éÏße!Óó?éÏß`NzÐ?éϴׯ”À?éÏ´ÒÜC‘?éÏŠI×XG?éÏŠE ?éÏ_»˜>?éÏ_¶ÄÅø?éÏ5,òk?éÏ5(1Æ?éÏ æŒ÷?éÏ ™[œ?éÎàsµÅ?éÎà  Œ_?éε~šNÉ?éεyÇ-X?éΊî[!i?éΊéˆí?éÎ`]µÖ¤?éÎ`XâÅ?éÎ5Ì©·s?éÎ5ÇÖ­á?éÎ ;6Í?éÎ 6cËc?éÍà©]à¡?éÍऊæù?éͶ›k?éͶK©¹?éÍ‹„keî?éÍ‹˜|1?éÍ`ñD"?éÍ`ìq.[?éÍ6]´‚Þ?éÍ6Xá© ?éÍ É¾§Ž?éÍ ÄëÕ³?éÌá5b'+?éÌá0]E?é̶ žJª?é̶›Ëˆº?éÌŒ s{/?éÌŒ Á5?éÌauâ!Î?éÌaqoË?éÌ6ßé'ƒ?éÌ6Û}v?éÌ I‰Ur?éÌ D¶³[?éËá²Ãt²?éËá­ðÚ‘?éË·•®@?éË·Ã?éËŒ„+:?éËŒ.¡?éËaìT³?éËaç3Òu?éË7S£³¾?éË7NÑ9w?éË ºÛ‘`?éË ¶ ?éÊâ!¬»?éÊâÙ¬a?éÊ·ˆ Ô?éÊ·ƒCªq?éÊŒîÅ?éÊŒéFÂX?éÊbSµ¯œ?éÊbNã]'?éÊ7¸ê®†?éÊ7´d?éÊ ¹By?éÊ æÿò?éÉâ‚"4j?éÉâ}OùÚ?éÉ·æ#­«?éÉ·áQ{?éÉI¾×&?éÉD쬄?éÉb¬óYÿ?éÉb¨!7U?éÉ8ÁŸ/?éÉ8 ï„|?éÉ r(ïô?éÉ mVÝ:?éÈâÔ*5?éÈâÏX r?éȸ5ÃøM?éȸ0ñõ?éÈ–÷b ?éÈ’%gL?éÈb÷Å{j?éÈbòóˆŽ?éÈ8X, æ?éÈ8SZ#?éÈ ¸,¢6?éÈ ³Z¿J?éÇãÇAb?éÇãõfn?éǸvúÔæ?éǸr)ê?éÇÕÈ%Ž?éÇÐöZ‹?éÇc4/ü%?éÇc/^9?éÇ8’0‚u?éÇ8^Çc?éÇ ïË@ú?éÇ êùà?éÆãM@½?éÆãH.•œ?éƸ©Î €?éƸ¤ühW?éÆŽ5j?éÆŽcÎÓ?éÆcb7„Î?éÆc]eñ–?éÆ8½Òåª?éÆ8¹Zk?éÆ ê?éÆ7‘¤?éÅãsØœa?éÅão!?éŸÎAäô?éŸÉpq ?éÅŽ(EW€?éÅŽ#sì%?éÅcâý?éÅc}™µ?éÅ8Û¿s?éÅ8ÖHd ?éÅ3êÇ?éÅ/s’?éÄãŒVÜV?éÄ㇅á?éĸä[j,?éĸߊ&°?éÄŽ;ú¸)?éÄŽ7)|¦?éÄc“4Ü?éÄcŽbÜS?éÄ8ê™?éÄ8å5ï ?éÄ@uª?éÄ;£Ý?éÃã–} §?éÃã‘«ð ?éøì%x?éøçMÖ?éÃŽAZõ=?éÃŽ<‰é•?éÃc–1E¸?éÃc‘`B ?éÃ8꡸?éÃ8åЄ?éÃ>¬kµ?éÃ9Ûwü?éÂã’D=œ?éÂãsQÝ?é¸åg£ò?é¸à–À.?éÂŽ8%1?éÂŽ3T$h?éÂcŠ{û£?éÂc…«'Ô?éÂ8Ükßí?éÂ8×›?éÂ-õÕ?éÂ)%7?éÁãä?éÁãzI('?éÁ¸ÏÖöÌ?éÁ¸ËBè?éÁŽ -v?éÁŽ\Ê,?éÁcp*?éÁckM†0?éÁ8¿§=¼?éÁ8ºÖ¡É?éÁËWX?éÁ úÃ`?éÀã]ˆ¡È?éÀãX¸Ë?éÀ¸«ß&?éÀ¸§¢?éÀùϬi?éÀôÿ0c?éÀcGZh?éÀcBŠ)^?éÀ8”~ã:?éÀ8®w+?éÀ á<æx?éÀ Ül‚e?é¿ã-•´?é¿ã(ij?鿸y‡W?鿸t¶´;?é¿Å:?é¿ÀAÎ?é¿c8,4?é¿c gè?é¿8Z÷Èü?é¿8V'ŒÓ?é¿ ¥Pù”?é¿  €Åg?é¾âïEE,?é¾âêuü?龸8Òwx?龸4SD?é¾ú¤?é¾})ûl?é¾bÊ»Ï ?é¾bÅëºä?é¾8Gd?é¾8G;%?é¾ [ èû?é¾ V<ä¸?é½â¢œ¼Ú?é½âÌÀ”?é½·éÆ þ?é½·äöµ?é½0‰¡l?é½+¹µ ?é½bvçâŸ?é½brþP?é½7¼ß»?é½7¸ÞÃ?é½ qòÎ?é½ ý¢x?é¼âGžò;?é¼âBÏ%â?é¼·ŒeDv?é¼·‡•€?鼌Ðűu?鼌Ëõõ?é¼bÁ`”?é¼bñ¬2?é¼7XV}†?é¼7S†Ñ#?é¼ ›†/ª?é¼ –¶‹D?é»áÞPßh?é»áÙBÿ?é»· µþ?é»·僓?黌b´¼?黌]ätN?é»a¤M¢š?é»aŸ~)?é»6åG¿?é»6à±ËM?é» &O·þ?é» !€CŠ?éºáf¸œî?éºáaé0w?麶¦»ÿŠ?麶¡ì›?麋æYèÒ?麋ኌX?éºa%“ ˆ?éºa ÃÌ ?éº6deÒº?éº6_–†WˆF?é°i±ÙX?é°dätù?é¯ØÚ«7?é¯Ø‹ NÛ?鯭µžV ?鯭°ÑÇ?鯂Úüâþ?鯂Ö/–¨?é¯Wÿö¹À?é¯Wû)un?é¯-$‹„P?é¯-¾H?é¯H»K—?é¯CîK?é®×l‡5s?é®×gº *?鮬íî?鮬‹ì©?鮲îbà?é®®!Fž?é®VÕ‹“%?é®Vо~ç?é®+÷Ãì´?é®+òöàx?é®—x|?é®ÊtD?é­Ö;žZ?é­Ö69¢&?é­«\C?é­«WD?é­€|¨á ?é­€wÛôÝ?é­UœÏm~?é­U˜‰U?é­*¼' ?é­*·ÃK{?é¬ÿÛëÖ?é¬ÿ×û?é¬Ôúâàª?é¬Ôö?鬪su™?鬪¦±‚?é¬7žºy?é¬2Ñþf?é¬TUeuä?é¬TP˜ÁÕ?é¬)rÅÖ??é¬)mù*5?é«þÁ_ï?é«þŠô»é?é«Ó¬W¼â?é«Ó§‹ á?髨Ȉõð?髨üaó?é«}äTµ ?é«}߈)?é«Rÿ¼£?é«Rúï›°?é«(½dC?é«(ðèT?éªý5Z)?éªý0“@?éªÒO‘²M?éªÒJÅFi?骧id³?骧d—«Ô?éª|‚ÑåÖ?éª|~‰ü?éªQ›Úà?éªQ—, ?éª&´}‡Þ?éª&¯±<?é©û̼#?é©ûÇïßJ?é©Ðä•œ²?é©ÐßÉ`î?é©¥ü ý™?é©¥÷=ÉÚ?é©{­d?é©{M«?é©P)Ä´æ?é©P$ø‘3?é©%@ Ÿ?é©%;=äò?é¨úUêµ½?é¨úQ¢?é¨ÏkfÝ?é¨ÏfšÑp?騤€}Áê?騤{±¾O?é¨y•/Ëä?é¨ycÐO?é¨N©}ÁQ?é¨N¤±ÍÁ?é¨#½f0 ?é¨#¸šD‚?é§øÐê›Þ?é§ø̸[?é§Íä ®Ú?é§Íß>Ó]?駢öĘ:?駢ñøÄÃ?é§x ™.?é§xNÍ¿?é§M ý?é§M@9­?é§",˜n?é§"'̲°?é¦÷=ÀS²?é¦÷8ô W?é¦ÌN„x?é¦ÌI¸j#?馡^â (?馡ZüÛ?é¦vnÝ©?é¦vj}b?é¦K~s‡È?é¦Ky§ô‰?é¦ ¤{®?é¦ ˆØðu?é¥õœqÖˆ?é¥õ—¦SV?é¥ÊªÚãÑ?é¥Ê¦h§?饟¸Þl?饟´I?é¥tÆ~_Ì?é¥tÁ²ô±?é¥IÓ¹w?é¥IÎî:c?é¥àó§?é¥ÛĘ›?é¤óíåº?é¤óè7’µ?é¤Èù`š?é¤ÈôF?餞ºQH?é¤ÿïS?é¤sÿøP?é¤s 4½c?é¤Há¡H?é¤Hnb?é¤%^94?é¤ “W?é£ò/vä¾?é£ò*«Áè?é£Ç9,iâ?é£Ç4aO?飜B|øƒ?飜=±å½?é£qKhø?é£qFíW?é£FSñ.–?é£FO&+â?é£\ç²?é£WIí?é¢ðcÔŠÙ?é¢ð_ ˜6?é¢Åk#‰3?é¢ÅfXž˜?颚rŽ?颚m5«s?é¢oxxÇ°?é¢os­í'?é¢D~Œ€?é¢DyÁÊÿ?预:üž?é¢p2&?é¡î‰…gå?é¡î„º¥w?é¡ÃŽjmþ?é¡Ã‰Ÿ³˜?願’êÔ¸?願Ž "[?é¡m—FQ?é¡m’;›þ?é¡Bš½* ?é¡B•ò‡À?é¡žˆ¨?é¡™Dîg?é ì ýÉb?é ìœ37+?é Á£‡–z?é Áž½ L?é –¥«~É?é – àü¤?é k§kcy?é k¢ é^?é @¨ÇMB?é @£üÛ1?é ©½Ë ?é ¤óa?éŸêªPü?éŸê¥…žþ?響ª}÷Ð?響¥³Ü?韔ªGYÚ?韔¥}ñ?éŸi©¬/Ø?éŸi¤áåù?éŸ>¨¬‚?éŸ>£â@º?韧GüT?韢}‰?éžè¥Á.?éžè µm?éž½£S?éž½žˆóL?éž’ Â•?éž’›÷öé?éžg̼¦?éžg™£?éž<šsú?éž<•©c?éž–µ!N?éž‘ëÁ?éæ’’•?éæÈ“„?黎 2¤?黉B9-?é‰!F)?é„WT½?éeƒÒ•?ée«´?é:~ÉÈ?é:yUèr?éxŽ©?és>µ^?éœäqJÕ?éœälÃy•?霹j® ?霹eä=Ù?霎cjd?霎^ N;?éœc[‡¢?éœcVø΄?éœ8S·x€?éœ8NíÇn?éœ KG'?éœ F}j ?é›âBs7ò?é›â=©–÷?é›·9;‘Q?é›·4qøb?雌/Ÿkh?雌*ÕÚ„?é›a%Ÿ‹˜?é›a ÖÀ?é›6‡Š2?é–*-Ý?é–*(V˜?é•ÿˆsý?é•ÿ¿ìÆ?é•ÓÿŽðí?é•ÓúÆqÄ?镨è1±4?镨ãi:?é•}Ðo£8?é•}˧4,?é•R¸Iéõ?é•R³‚÷?é•'ŸÀŽ?é•'šø/ ?é”ü†Òæ?é”ü‚ É?é”Ñm€ €?é”Ñh·Ñ¯?锦SÊö?锦O¯Í?é”{9±?é”{4éQÝ?é”P4UB?é”Pl?é”%SMP?é”$ÿ‹º?é“ùé#b?é“ùäEüÛ?é“ÎÍe>,?é“ÎÈ´?é“£±Yf?é“£¬íþ?é“x”èd¦?é“x VL?é“Mxß±?é“MsLÙg?é“"ZÞ *?é“"V!ï?é’÷=Aú´?é’÷8z‰?é’ÌC ?é’Ì{í?é’¡à<Ö?é’ üVÊ?é’uâ›Ì?é’uÝQ½Ð?é’JÂï“?é’J¾'·§?é’£bÖÌ?é’ž›ï?é‘ôƒqª@?é‘ô~©äs?é‘ÉcÌ•?é‘É^UÙ?é‘žBe`[?é‘ž=ª®?é‘s!I:~?é‘sŒâ?é‘GÿÊ—g?é‘GûñÚ?é‘Ýèeä?é‘Ù Èh?éñ»¢Pº?éñ¶Ú»O?éƘùr?éÆ”1?é›uìsÏ?é›q$î…?épR|”?épM´„Z?éE.¨è)?éE)árÿ?é r„?骩l?éîå×ó>?éîáŽ7?éÃÀÚ‡?éü* ?阛z8]?阖²ãw?émuµöZ?émpî©…?éBOŽ…o?éBJÇ@«?é)á?é$=Ë.?éŽì±?éŽëýP|b?éŽÀÚÇE@?éŽÀÖ°?鎕³ÍD?鎕®L¨Å?éŽjŠü86?éŽj†5É?éŽ?b‚d?éŽ?]»O¤?éŽ9¥œ?éŽ4Þ‘R?éée2?éé ž-Ö?é½æÂC‚?é½áûG[?é’¼¼|Ï?é’·õˆº?ég’S+?égŒ??é¢?é‡Èþm??é‡T•HNb?é‡T‚…?é‡)\i¤ ?é‡)W£ãf?é†þ#(§‰?é†þbîd?é†Òé„Fð?é†Ò侕à?醧¯|-Þ?醧ª¶„ã?é†|u8×?é†|pL—ñ?é†Q:DœŽ?é†Q5¼?é†%ÿ×ê?é†%úOG-?é…ú•ë?é…ú¾½ D?é…χŒ f?é…Ï‚ÆŠÔ?é…¤K3ÏÚ?é…¤FnW]?é…yxu¦?é…y ³>?é…MÑZb÷?é…MÌ”ú¥?é…"“ÙBÚ?é…"â?é„÷Uö”?é„÷Q1;Ý?é„Ì°-î?é„ÌêÝÝ?é„ ÙÔ=?é„ ÔAŒA?é„u™û¨?é„u•6h/?é„JZŒÞ†?é„JUǦ¶?é„»˜³?é„öhø?éƒóÚˆ<®?éƒóÕà ?éƒÈ™ò?éƒÈ•,ø‰?éƒXù‘?éƒT4y‹?éƒrž° ?éƒrÙ ª?éƒFÕàÂÙ?éƒFÑ»?郓À/ƒ?郎û0M?é‚ðQ>ÿ?é‚ðLyà?é‚ÅXQ3?é‚Å “b*?邙˹ó?é‚™ÆKÓ?é‚n‡YÇ_?é‚n‚”èƒ?é‚CC3—©?é‚C>nÀä?é‚þªŠŸ?é‚ùå»ñ?éì¹¾¨À?éì´ùâ(?éÁtnâY?éÁoª#Ù?é–.¼X+?é–)÷¡Á?éj觼?éjãâdj?é?¢._Ä?é?i¹ˆ?é[S_ø?éVŽÁÔ?é€é¯?é€éPm¢?逽Ìrö?逽Ǯh?递„nWÒ?递©Ñó?é€g<1k?é€g7B³¤?é€;ó<Ч?é€;îxZ÷?逪›n?逥K-Ö?éå`<è?éå[º×i?麌ú?éºǽ’?éŽÌ6›~?éŽÇrF.?éc}®÷?éc|¹a¾?é86buì?é81ž0Ì?é êãàæ?é æ£Þ?é~áŸm¸?é~áš?8È?é~¶R¾õ?é~¶MúÈ(?é~‹¯&?é~‹TŠg?é~_¹G\?é~_´L*µ?é~4k¤Pö?é~4fà#ù>?é|Ùòg,8?é|Ùí£Xp?é|®¡ƒü?é|®œÀ0`?é|ƒP>M,?é|ƒKz‰•?é|Wþ–â‰?é|WùÓ' ?é|,¬‹òˆ?é|,§È?$?é|ZWÒ?é|U[¬ˆ?é{ÖP`z?é{ÖŒ½H?é{ª´Z˜?é{ª¯Z¿€?é{`‹ Ä?é{[ÇÆ?é{T ”ér?é{TÑ^Ž?é{(¸<l?é{(³x—¢?ézýcÓÂ?ézý^¾Y?ézÒem?ézÒ ¡“Ö?éz¦¸æ?éz¦´"­¢?éz{cW ?éz{^@ô§?ézP ÁŠ?ézPþCA?éz$¶Å&?éz$±Xr÷?éyù_À?éyùZPF¬?éyΩÃ)?éyÎæ/?éy¢¯ÝMw?éy¢«—?éywW¯Ož?éywRìÙ?éyKÿÚ?éyKú[î/?éy ¦,®·?éy ¡i'?éxõLؼ?éxõHG?éxÉó"Å?éxÉî_pj?éxž™ ·°?éxž”F®o?éxs>˜Š?éxs9Ì—d?éxGã³r¨?éxGÞðy?éxˆtñ{?éxƒ²‹?éwñ,Ôz¢?éwñ(‘Í?éwÅÐÓ-Ü?éwÅÌM#?éwštb6 ?éwšoŸ^?éwoƒ%?éwoÀTœ?éwCºB4\?éwCµkõ?éw\ø‹?éwWÛ8@?évìþ—4B?évìùÔ|?évÁ .Lý?évÁ›kœé?év–Ab‘?év–<Ÿé?évjâ4f?évjÝqÆ4?év?‚£Ô]?év?}á<›?év"°‡g?éví÷Á?éuèÂ[A¬?éu轘º"?éu½a£®™?éu½\á/,?éu’‰y?éu‘ûÇL?éufŸ /?éufšJ˜ú?éu;=.Ã?éu;8kžª?éuÚì×Í?éuÖ*xÐ?étäxI)¾?étäs†ÒÞ?ét¹Ca?ét¹E?ét±Û)$?ét­â}?étbNç?étbIN¨ô?ét6éå{?ét6å"Ë ?ét …U®Æ?ét €“€u?ésà e%Œ?ésà¢ÿX?és´»Wd?és´¶P9M?és‰U\ïÔ?és‰PšÙÙ?és]ïE±,?és]ꃣO?és2ˆÌFô?és2„ A4?és!ð¹ž?és.»û?érÛº³nˆ?érÛµñy?ér°Sn ?ér°NR€¸?ér„ëª#?ér„æPÄØ?érY‚¯A¼?érY}ídŽ?ér.ê=Z?ér.(hJ?ér°Â1æ?ér¬dó?éq×G8ø=?éq×Bw3i?éq«ÝMß?éq«ØŒ"W?éq€s5?éq€n>€{?éqUQY?éqUlÞ?éq)@7t?éq)˜~“?épþ1Í—Ö?épþ- û–?épÒÅøæ?épÒÁ7Q÷?ép§YÃA7?ép§Uµ4?ép{í*áp?ép{èi]Œ?épP€1B’?épP{oÆË?ép%Ö7?ép%œ?éoù¥HÅ?énÉ•}?énž)t“4?énž$³h¡?énr¸HˆT?énr³‡eà?énGF»£¦?énGAú‰Q?énÔÍØ?énÐ ~£?émðb}B?émð]¼8?émÄïËym?émÄë wv?ém™|¸ø°?ém™w÷þÙ?émn DUk?émnƒc³?émB•o ü?émB®!d?ém!8Å?émwã?él묟¼›?élë§ÞãB?élÀ7™ ]?élÀ2ØÏ$?él”Â&-G?él”½ed.?éliLP ?éliGF?él=Ö¨Ì?él=ÑWïó?él_ß?élZ¾T&?ékæè‚Æï?ékæãÂV?ék»q$°Ã?ék»ldK?ékùe'_?ékô¤?ékdC'?ékd|‚Œï?ék9¿SË?ék9þË´?ék ÚŒú?ék ‹ ?éjâ“^v?éjâÒæ ?éj¶œê‰ê?éj¶˜*5?éj‹"ß»?éj‹S?éj_¨sV÷?éj_£²÷„?éj4-¥ N?éj4(ä±û?éj²u7?éj­´çè?éiÝ6âÒä?éiÝ2"‹Ó?éi±ºïW…?éi±¶/–?éi†>šÍM?éi†9Ú–?éiZÁãm£?éiZ½#>ö?éi/DËã?éi/@ éW?éiÇQ_Ñ?éi‘Ag?éhØIu¬¢?éhØDµ–Y?éh¬Ë8[M?éh¬ÆxM&?éhLšæs?éhGÚàn?éhUÍšqì?éhUÈÚt ?éh*N8Ôð?éh*Ixß-?égþÎvÖ?égþɶ*5?égÓNPÐÐ?égÓIëQ?ég§ÍÊÖù?ég§É ùœ?ég|Lãy™?ég|H#¤_?égPËšdˆ?égPÆÚ—p?ég%IðY4?ég%E0”>?éfùÇåu?éfùÃ%F¡?éfÎEw²¥?éfÎ@·ýô?éf¢Â©„¬?éf¢½éØ?éfw?yÈè?éfw:º$|?éfK»èä8?éfK·)Gî?éf 7ö‚?éf 36îX?éeô³£e?éeô®ãÙ?éeÉ.îÛ`?éeÉ*/W~?ée©ØíÄ?ée¥r?éer$b]Ž?éer¢éò?éeFž‰ÁF?éeF™ÊUÍ?éeP“#?ée‘/Í?éd"š?édïŒöÇg?édÄ ºx ?édÄû$ü?éd˜ƒ]›Ú?éd˜~žPí?édlû OB?édlöá x?édAs…Y?édAnÂJ³?édë¢í?édæBpk?écêb!i0?écê]b>Ñ?éc¾Øßt?éc¾Ôð9?éc“O<Ñ?éc“J}·x?écgÅ9™¢?écgÀz‡®?éc<:Õ¯?éc<6 ß?éc°Q?éc«POh?ébå$é ü?ébå *t?éb¹™a‘?éb¹”¢Ÿœ?ébŽ y§C?ébŽº¾?ébb0ø¿?ébb|r£?éb6ô‡1?éb6ïÈX‡?éb g|¶:?éb b½åg?éaßÚþ?éaßÕFÅO?éa´L!“?éa´GbW ?éaˆ½Û¡œ?éaˆ¹é6?éa]/4{º?éa]*uËy?éa1 +Qæ?éa1›l©Ê?éaÀå?éa E$?é`Ú€õ= ?é`Ú|6¥Í?é`®ðÈcÁ?é`®ì Ô?é`ƒ`:_Ê?é`ƒ[{ØA?é`WÏK–P?é`WÊì?é`,=úžp?é`,9<'2?é`¬Hñ¦?é`§Š‚Œ?é_Õ5ß©?é_Õwx´?é_©‡Á‚?é_©ƒµ³?é_}ôëQ ?é_}ð,ú`?é_Ra´?é_R\öO?é_&ÎIÐ?é_&É^r?é^û:#¨?é^û5dØo?é^촃 Z?é^Ï¡ ÖG?é^¤ |?é^¤ Nð?é^x{ðÆP?é^xw2 ˆ?é^Lær÷o?é^Lá´ÙÍ?é^!P”`?é^!KÖä?é]õºT+o?é]õµ–?é]Ê#³÷V?é]Êõò&?é]žŒ±µX?é]ž‡ó¸O?é]rõO:Æ?é]rð‘Eã?é]G]‹×?é]GXÍêÅ?é]Åg7«?é]À©S?é\ð,ác?é\ð(#‡ ?é\Ä“ûx ?é\Ä=£À?é\˜ú³°~?é\˜õõä\?é\ma >F?é\m\NzJ?é\AǸû?é\AÂEý&?é\,™ÌÆ?é\'Ü?é[ê‘Ï:F?é[ꎿ?é[¾ö¥6?é[¾ñçzÕ?é[“[C–?é[“VZ¨\?é[g¿+“Ú?é[gºnÈ?é[<"Þà?é[< wô?é[†/<Û?é[qº?éZäé º‘?éZääc?ô?éZ¹K±oò?éZ¹Fóý}?éZ­á 0?éZ©#žâ?éZb°¢ê?éZb ó@Ã?éZ6q6?éZ6lb37?éZ Ò-Ðb?éZ Íp~‹?éYß2Û§?éYß.Î÷?éY³“(‚’?éY³ŽkA ?éY‡ó/?éY‡îWÈÐ?éY\R¡´?éY\Mä‚Ë?éY0±Íè7?éY0­¿'?éY˜îø?éY ÛÎ?éXÙoäÆ?éXÙjFÌ?éX­ÍÑã?éX­ÈQÁL?éX‚*¸ª€?éX‚%û¢?éXVˆç?éXVƒEæÉ?éX*äì×Ê?éX*à/ß«?éWÿAv(ö?éWÿ<¹9?éWÓŸšê?éWÓ˜â³?éW§ùh!é?éW§ô«BE?éW|TÐ~H?éW|P¦Í?éWP¯Ø¸R?éWP«èÿ?éW% €ØT?éW%Ä*?éVùd¼Tï?éVù_ÿ•î?éV;‹Ÿw?éV͹ÎèŸ?éV¢ú*C?éV¢={”?éVvqE–?éVvlJŸ?éVJɳ±¤?éVJÄ÷G?éV!ÿv?éVBàj?éUóyê@Ì?éUóu-²Â?éUÇÑtt\?éUÇÌ·î|?éUœ(žur?éUœ#á÷»?éUpf܈?éUpzªfû?éUDÕÎÅ«?éUDÑXH?éU+Ö”ü?éU'/Â?éTí|‡?éTí|À*?éTÁÖÂo×?éTÁÒñ?éT–+§Ÿ™?éT–&ëRÝ?éTj€,œ?éTj{oÚ ?éT>ÔOõ?éT>Ï“¸¯?éT(ã ?éT#W®Ï?éSç{v&?éSçvºU?éS»Îxh?éS»É¼k~?éS!ÍÉ?éS^² ?éSds[Õ?éSdnŸÁq?éS8Å<Àð?éS8À€µ…?éS ¼â?éS ÞÑ?éRágÜ@š?éRác E†?éRµ¸›@¨?éRµ³ßM¾?éRŠúFJ?éRŠ>[‹?éR^Xø¢ ?éR^T<¿v?éR2¨—Í?éR2£Û9d?éR÷ÕGò?éRóu³?éQÛF²3@?éQÛAöi,?éQ¯•/© ?éQ¯sç$?éQƒãMU¶?éQƒÞ‘›ù?éQX1 . ?éQX,N|z?éQ,~f–?éQ,yªì±?éQËb–?éQƦôÚ?éPÕþ’ ?éPÕBøý?éP©d:íú?éP©_]?éP}°ž¼?éP}«[?éPQû’d"?éPQöÖã•?éP&F­êš?éP&Aòr:?éOú‘iñæ?éOúŒ®±?éOÎÛÅnõ?éOÎ× ì?éO£%ÀÅÊ?éO£!eí?éOwo\¶?éOwj¡^`?éOK¸—Ù?éOK³Ü‰’?éO sJI?éOü¸ð?éNôIïÜ?éNôE3Ò¯?éNÈ’ €˜?éNÈOI—?éNœÙÅúu?éNœÕ Ë¢?éNq!!‡¦?éNqf`ÿ?éNEhÔ¹?éNEca¶>?éN®¸üø?éN©ýæª?éMíôôõŽ?éMíð9çm?éMÂ:Ðk?éMÂ6e ?éM–€Lxž?éM–{‘z×?éMjÅi&™?éMjÀ®0þ?éM? %j(?éM?j|º?éMN‚^ˆ?éMIÇyG?éLç’°D?éLçÄÓ0?éL»Ö ð?éL»Ñb7 ?éLZÕk?éL ²?éLd\9p”?éLdW~¬?éL8ž·w?éL8™üºµ?éL àÊQ¥?éL Üt?éKá"r?éKá·gŒ?éKµc¸øæ?éKµ^þU?éK‰¤ °?éK‰Ÿå?éK]å&t8?éK]àkà¾?éK2%L°?éK2 ‘|c?éKeM¡?éK`WÊ‚?éJÚ¤x;e?éJÚŸ½Àt?éJ®ã}!ú?éJ®Þ¯7?éJƒ""Ót?éJƒhhß?éJW`h É?éJW[®>c?éJ+žM#×?éJ+™’Éž?éIÿÛÒ.£?éIÿ×Ü™?éIÔ÷-?éIÔ<ÈQ?éI¨U»ÖŸ?éI¨Q”ò?éI|’Í ?éI|e“‹?éIPÎ$ÇL?éIPÉj•ü?éI% ȨO?éI%-?éHùE o?éHù@S||?éHÍòœ6?éHÍ{8ƒr?éH¡ºvš@?éH¡µ¼‰«?éHuô›iM?éHuïá`ç?éHJ.`Zw?éHJ)¦Z@?éHgľã?éHc ÆÛ?éGò Ê ¾?éGòœæ?éGÆÙnÞ-?éGÆÔ´öƒ?éG›³–Ú?éG› ù·`?éGoI˜õè?éGoDßœ?éGCL€?éGC|d}d?éG¸DY¾?éG³Š’Ò?éFëï c?éFëêPT§?éFÀ%p“ø?éFÀ ¶Ýk?éF”[vÑB?éF”V½"å?éFh‘ŠR?éFhŒcä%?éF<ÆdÇR?éF<Á«)T?éFûL4ò?éFö’Ÿ$?éEå/Ô6Ë?éEå+©.?éE¹cüÕ?éE¹_CO“?éE—Å`à?éE“ ã¢?éEaË.>?éEaÆtÈó?éE5þ7Ïï?éE5ù~c?éE 0áÃl?éE ,(^À?éDÞc,  ?éDÞ^rÄ#?éD²•K?éD²]öÈ?éD†Æ¢ïˆ?éD†Áé£m?éDZ÷κÄ?éDZóvÚ?éD/(›k´?éD/#â/ú?éDY¯?éDTO{?éC׉1À?éCׄ]g?éC«¸Åi??éC«´ F?éCè”ð?éCã[yù?éCTY?éCTK”?éC(E• ­?éC(@Ü?éBüsÅ´X?éBüo ±õ?éBС—Ý:?éBÐœÞã ?éB¤Ï ~n?éB¤ÊQŒn?éBxü %?éBx÷d¶V?éBM(Ñ¥×?éBM$Ä:?éB!U'NF?éB!PntÙ?éAõ4[?éAõ|dc ?éAɬ³»Ž?éAɧúò…?éA×ëýé?éAÓ3=?éArÄ;?éAqþ ‚t?éAF-=+?éAF(„Ü·?éAWLËü?éAR”#º?é@î€ï‰è?é@î|6éØ?é@ª3qÊ?é@Â¥zÙì?é@–Óyä?é@–Î^ê9?é@jûšóÊ?é@jöâlQ?é@?#À ?é@?‹Ñ?é@K„ÿ›?é@F̈†?é?çrê4ª?é?çn1ÅÉ?é?»™ï²]?é?»•7K®?é?À•Ûü?é?»Ý}€?é?cæÛ§÷?é?câ#Q­?é?8 ‹A?é?8 =*?é? 2I×|?é? -‘‘˜?é>àWq9Œ?é>àR¸ûÚ?é>´|9Ë?é>´w•Ÿ?é>ˆ ¢‚®?é>ˆ›êUb?é>\Ä« ?é>\¿òè?é>0èTßL?é>0ãœÂg?é> Ÿ¦?é>ç‘`?é=Ù.‰üÒ?é=Ù)ÑðS?é=­Q³|?é=­L]¯0?é=sBÏ?é=nŠ·?é=U•‡‹?é=UV“§?é=)¶{µ?é=)±ÃÉi?é<ý׊bÖ?é<ýÒÒY?é<Ñø9,B?é<ÑóPø?é<¦ˆÏ¶?é<¦Ðü ?é?2?é9¼ôñÞ?é9¼=ªC?é9• ?é9ÝÊ¥?é9d7Ö•®?é9d3^}?é98P¸0¾?é98LÂ?é9 i;ªu?é9 d„ƒ®?é8à`¯Ö?é8à|©‘E?é8´™%Üî?é8´”nÆ’?é8ˆ°ß?é8ˆ«Õò¹?é8\Ç•m´?é8\ÂÞgÃ?é80Þ>Ð…?é80Ù‡ÒÊ?é8ô‰ç^?é8ïÒñØ?é7Ù vºO?é7Ù¿Ìÿ?é7­ å†?é7­Ml?é752Üû?é70|?é7UJMÉ?é7UELy?é7)^tŠ?é7)Y½½¢?é6ýr†ôü?é6ýmÐ0¹?é6ц;Li?é6Ñ„]?é6¥™âŠ?é6¥”Ú.´?é6y¬ˆuX?é6y§Ñɸ?é6M¿!W?é6Mºj³—?é6!ÑOñ?é6!̘~¾?é5õã9+?é5õÞ\¦/?é5ÉôxbÛ?é5ÉïÁØ?é5ž}é+?é5žÇfœ?é5r$äÚ?é5rnj?é5F&lM2?é5F!µÛ?é56T…?é51ž4?é4îEÝïƒ?é4îA'Ï?é4ÂU9|?é4ÂPQßÿ?é4–cÒµO?é4–_d ?é4jr>Ö€?é4jmˆq?é4>€LJ(?é4>{– P?é4ù¬Ù?é4‰Ct9?é3æ›I‚™?é3æ–“R0?é3º¨: ?é3º£ƒäë?é3Ž´Êù‘?é3Ž°Ù—?é3bÀý»Y?é3b¼G£–?é36ÌÐï?é36Èߎ?é3 ØD÷²?é3 ÓŽð_?é2ÞãZí™?é2ÞÞ¤î~?é2²î}ø?é2²é\‡?é2†øjE”?é2†ó´Vè?é2[c·ª?é2Zý­Ñ6?é2/ þÜ7?é2/Hýû?é2:P?é2„z ?é1×+š?é1×a]Î?é1«&•Ñž?é1«!à ?é1.µ”Œ?é1)ÿ×1?é1S6v×(?é1S1Á"?é1'=Ùü=?é1'9$OS?é0ûDÝûv?é0û@(VÃ?é0ÏKƒ7¢?é0ÏFÍ›(?é0£QÊnA?é0£MÚ?é0wW²—?é0wRý ?é0K]<â?é0KX†‘?é0bgJd?é0]±ÎÎ?é/óg3/m?é/ób}¼?é/Çk¡‘ ?é/Çfì&|?é/›o±?é/›jû«0?é/osb–?é/on¬¬ä?é/Cv´†?é/Cqÿ3š?é/y©¡²?é/tôWr?é.ë|?B:?é.ëwŠ3?é.¿~v%?é.¿yÀëL?é.“€O½?é.“{š‹?é.gÉò ?é.g}ȳ?é.;‚æì?é.;~1Êú?é.ƒ¥£0?é.~ðŠI?é-ã„T?é-ãOþ§?é-·„X„?é-·RP?é-‹ƒ«?é-‹~öÜ?é-_‚ðo?é-_~;o?é-3×2?é-3}"B¹?é-€`¥C?é-{«½·?é,Û~‹WÕ?é,ÛyÖx„?é,¯|W¬ß?é,¯w¢ÕÈ?é,ƒyÆþ?é,ƒu8"?é,WvÖš?é,Wr!Lø?é,+sˆ5N?é,+nÓvæ?é+ÿoÜt?é+ÿk'½ñ?é+ÓkÒ}j?é+ÓgÏw?é+§gki?é+§b¶h±?é+{b¥Ô}?é+{]ñ6ÿ?é+O]Çì?é+OXÍ2ª?é+#WôÁÏ?é+#S@4Ç?é*÷Qþtù?é*÷MIð,?é*ËK¨¸C?é*ËFô;±?é*ŸDôýá?é*Ÿ@@‰Š?é*s=âó1?é*s9.‡?é*G6qx?é*G1½,˜?é*.¡íN?é*)í‘©?é)ï&s·?é)ï!¿c¬?é)ÃæõÂ?é)Ã2ª“?é)—û±=?é)—GnJ?é)k ²L?é)kþJ?é)? cè?é)>ýU1l?é)øù?é)óNõ¹?é(æížÓ?é(æèê±?é(ºâÛÐ1?é(ºÞ'¶i?é(Ž×ºy²?é(ŽÓh%?é(bÌ:׎?é(bdžÎ=?é(6À\<»?é(6»¨;§?é( ´À?é( ¯kÇÄ?é'Þ§„¶.?é'Þ¢ÐÅ‘?é'²š‹Õ?é'²•×—u?é'†4%†?é'†ˆ€Eb?é'Z š?é'ZzË1²?é'.qk$ª?é'.l·Tÿ?é'bù3‰?é'^El?é&ÖT)˜š?é&ÖOuÙh?é&ªDúò ?é&ª@G;?é&~5n±?é&~0»È?é&R%„„ƒ?é&R ÐÞ?é&&;¾*?é&&ˆë?é%ú•7?é%ùÿá…6?é%Íó£š?é%ÍîÝÕ?é%¡â.×?é%¡ÝzO?é%uÐm¡E?é%u˺#ú?é%I¾NÌ?é%I¹›Vú?é%«Ñçz?é%§zª?é$ñ˜÷°D?é$ñ”DK±?é$Å…¿Óø?é$Å w£?é$™r(ñ?é$™muœí?é$m^4Ó7?é$mY‡]?é$AIã(?é$AE/ä{?é$53Bà?é$0€?é#é %+†?é#éqød?é#½ ¹žª?é#½sÇ?é#ôïïˆ?é#ð<Ìâ?é#dÞÈÚ½?é#dÚÀU?é#8ÈDh4?é#8ÑV ?é# ±aä?é# ¬®†ø?é"àš!b?é"à•nµ?é"´‚‚ñ?é"´}Ïø-?é"ˆj‡9„?é"ˆeÔHS?é"\R-ñ?é"\M{?é"09w ?é"04Ä?T?é" bð?é"¯A{?é!Øïõˆ?é!Ø=%Q?é!«í `o?é!«èm˜w?é!Òò®?é!Î?îV?é!S¸gõ!?é!S³µ=¦?é!'€=’?é!'˜ÍŽV?é û‚9Ì?é û}‡% ?é Ïf–k¸?é ÏaãÌù?é £J–~Ì?é £EãèM?é w.7ï½?é w)…a}?é K|ãé?é K Ê]é?é ôX‡]?é ï¦ ›?éòÖÊ‹v?éòÒô?éƸßw?éÆ´- M?éšš•ê©?éš•ã…¥?én{îFØ?énw;ê?éB\èî,?éBX6™¨?é=†B²?é8Óön?éêÅ=¬?éêù¨?é½ý¥æþ?é½øó«9?é‘Ý)U?é‘Øw!‹?ée¼N2?ée·œUí?é9›sH?é9–cPC?é y~ç‚?é tÌ̽?éáWŠ‹–?éáRØy?éµ58gZ?éµ0†]?鉈‚®?é‰ Ö€©?é\ïz1*?é\êÈ7f?é0Ìã5?é0Ç\ñ²?é¨FF‡?飔]D?éØ„T”?éØms’?é¬_šod?é¬Zè–£?é€:¸S ?é€6‚Œ?éTxS0?éTÆŠð?é'ïÛ+â?é'ë)kâ?éûÉàŠÞ?éûÅ.Ó?éÏ£‡i»?éÏžÕº=?é£|ÐÞ¤?é£x7g?éwU¼ñp?éwQ Rt?éK.KOê?éK)™¹0?é|¶?éË'˜?éòÞPÑ®?éòÙŸKv?éƵÆBZ?éƱÄd?隌ß,X?隈-¶£?éncš/F?én^èÁÒ?éB9ø?éB5F¡æ?éøa¤?é G´?ééå› Ê?ééàêL?齺á\?齶/Ëï?é‘É„B?é‘‹@?éedT’R?ée_£Vj?é98‚¤j?é93ÑpÄ?é Sd?é ¡ã?éàßÆŒ?éàÛhü?é´²Üv?é´®*ü–?鈅”ÆG?鈀㳩?é\Wðúd?é\S?ð?é0)îùÂ?é0%=÷¨?éû4*?éöß:T?é×ÌÔW|?é×È#eè?é«»œ?é«™ (K?énEW?éi”=H?éS>qÑœ?éS9ÀøÐ?é'A3K?é' bÁ?éúÝ´Y?éúÙÎ?éάÊ<ü?éΨ|ù?é¢{‚æã?é¢vÒ/#?évIÞ^¨?évE-¯+?éJÝ?éJ,^Ù?éå~å?éàÎF ?éñ²ÄM?éñ®l™?éÅ«µ?éÅzû&?é™L6[å?é™G…Õ¹?émcÿ×?ém³î?é@ä5¶`?é@ß…@º?鯞xé?éªî ‡?éèzŸ¸Ã?éèuïS¥?é¼EC¾C?é¼@“ai?é‰)¹?é ØÕ"?écÙqÄI?écÔÁw÷?é7¢ý•·?é7žMQ¨?é l+˜;?é g{\p?éß4ûÓ£?éß0K ?é²ýo]A?é²ø¿1ÿ?é†Å„Õ‡?é†ÀÔ²‰?éZ=«—?éZˆÝ?é.T™3‰?é.Oé!?é–Á?éæ·]?éÕâ7jà?éÕ݇hô?驨{7J?é©£Ë=£?é}n`Ç[?é}i°Õø?éQ3éãè?éQ/9úÉ?é$ù”¯?é$ôf³Ö?éø½äÆÀ?éø¹4î+?éÌ‚VBÓ?éÌ}¦r„?é Fj¶ð?é Aºîå?ét !Ñ?étrR?éGÍ{™?éGÈËá—?éy}Ä?é‹ÉΉ?éïS˜?éïNik¢?éÃ\ &?éìv?é–×BTv?é–Ò’¾ ?éj˜Ë]˜?éj”Ïs?é>Y÷ ?é>UH*?éÆÀä?éCJ?éåÛ8Ðî?éåÖ‰[š?é¹›Nˆd?é¹–ŸU?é[áä?éVW}?éab>ø?éa²âu?é4Ùa?é4Ô±¬Ý?é˜0?é“Sä?éÜVH P?éÜQ˜ÜŸ?é°0æ¤?é°«9?éƒÑ¼}Î?éƒÍ J©?éWŽëGG?éWŠ<i?é+K¼ñ1?é+G Ι?é ÿ2V?é ÿƒv?é ÒÄJl0?é Ò¿›Z%?é ¦€¦~?é ¦{Wœº?é z;f:?é z6·8’?é MöhÕ?é Mñ¹ÛÑ?é !±ØÙ?é !¬_çé?é õkYŽ?é õfªä?é É%E:/?é É –YÌ?é œÞÖå?é œÚ'(Ê?é p˜ õú?é p“[&&?é DPàÇ¢?é DL2?é  [Šz?é ¬Ë4?é ëÁyì°?é ë¼Ë5±?é ¿y;œu?é ¿tŒí¾?é “0 û-?é “+òT½?é f窟?é fâûrv?é :žV1n?é :™§›?é T¦r!?é O÷ä‡?é â š€è?é âëû–?é µÀ2e?é µ»ƒèƒ?é ‰umÎK?é ‰p¿Yˆ?é ]*Mz?é ]%ž¯ÿ?é 0ÞÏþV?é 0Ú!š#?é ’êúÃ?é Ž<žØ?é ØFŸ&f?é ØAðÒÄ?é «ùõõ?é «õG©º?é ¬ïÈ?é ¨A…?é S_Z)?é SZß`?é 'ÍLö?é ' t?éúñC?éú¿ä ?éÎu8¥Â?éÎpŠƒÑ?é¢&b+?é¢!³èƒ?éu×.ê¼?éuÒ€Ù\?éI‡ŸÀ¢?éI‚ñ·‹?é7³$?é3~V?éðçj-ù?éðâ¼5t?éĖćÑ?éÄ’—•?é˜EÁáp?é˜Aù}?ékôbœ?ékï´¼^?é?¢§Ê?é?ùAi?éPŽS ?éKàƒô?éæþ¸T?éæùkñ…?麫Hv?麦šÞð?éŽXWI?éŽSl¡ ?ébùÓ?éaÿâKà?é5°©3`?é5«û¶?é \dÿ`?é W·b?éÝÄËD?éÝ6.?鰲Ȟ¸?é°®ì?é„]ou>?é„XÁð¼?éXº _?éX '?é+±¨bÒ?é+¬úîã?éÿ[:/é?éÿVŒÄD?éÓoѾ?éÒÿÂnc?馭IP ?馨›ôù?ézUÅÿÇ?ézQ­?éMýæ›k?éMù9Pï?é!¥ªwô?é! ý5Â?éõM©,?éõHeoE?éÈô„?éÈïqR{?霚În?霖 ç?épA!¯>?ép‡cf?èú9Ü}?èùæѵã?èùæÌU]I?èùºcj`?èùº^s?èùôà/s?èùð4çu?èùa†F Ê?èùašÍ?èù5Pc?èù5¥+¯?èù§þ‡à?èù£SXÏ?èøÜ8Q4ì?èøÜ3¦)?èø¯ÈHÊÚ?èø¯Ã¬f?èøƒWãíH?èøƒS8×#?èøVç#®â?èøVâx¡ ?èø*vpI?èø*q]jÁ?è÷þ|-?è÷ýÿå~ô?è÷Ñ’½ð%?è÷ÑŽû?è÷Ã3k‘?èöóTAžŒ?èöóO–Ó/?èöÆàIˆÜ?èöÆÛžÅÏ?èöškö·¹?èöšgKüû?èöm÷GÎÿ?èömò‘?èöA‚=/I?èöA}’…*?èö ØCø?èö-¢)?èõè—X?èõè’l¾‰?èõ¼ û$þ?èõ¼P“Ï?èõªƒY’?èõ¥Øг?èõc3°VW?èõc/ÕÈ?èõ6¼‚"ó?èõ6·×ª´?èõ Døn#?èõ @Mþ4?èôÝ͘u?èôÝÈi0×?èô±TÒ÷Æ?èô±P(˜x?èô„Ü8P,?èô„×ù/?èôXcAìÝ?èôX^—ž/?èô+éð.e?èô+åEè?èóÿpD'?èóÿk™èö?èóÒö0ì?èóÒñ†¶a?èó¦{·åÒ?èó¦w ¸f?èózä}?èóyü9Þb?èóM…³s?èóM s©?èó! (P€?èó!~<?èòôŽA@±?èòô‰—4Š?èòÈý^ ?èòÈ SZJ?èò›•^lŒ?èò›´q?èòod°?èòoº'|?èòB› e±?èòB–czÎ?èò[¸e?èò±ÕÔ?èñéŸNh¿?èñ隤Ž?èñ½ å%‡?èñ½;S˜?èñ¢ §î?èñvÞQ?èñd#÷‚?èñdW66?èñ7£…?èñ7žÛX‡?èñ #®`?èñ ¯ô?èðÞ£{â?èðÞžÒ9¿?èð²"íöF?èð²DVB?èð…¢¤À?èð…[ ?èðY ¿õ?èðYe¾?èð,Ÿ–3?èð,šv$?èð$A?èðzÂQ?èïӚͤ‡?èïÓ–$.?è臨?èï§q¨ž?èïz• ©l?èïzdC¦?èïN¥d2?èïN ü¾?èï!àë¼?èï!‰7–š?èîõ ÁQÊ?èîõü?èîÈ…Fò?èîÈ€Yv?èîœp?èî›ûÇBæ?èîo{>ü¼?èîov•Èå?èîBõ²Ïð?èîBñ ¤l?èîoËNØ?èîk"+§?èíéé‰2f?èíéäàˆ?èí½bëx?èí½^B í?èíÛò'®?èí×Iv?èídTùð?èídOôø ?èí7Ìï§Ê?èí7ÈF®8?èí Då}†?èí @<ŒH?èìÞ¼€4 ?èìÞ·×K?èì²3À+‘?èì²/Jù?èì…ª¥ ?èì…¥ü:Å?èìY!.ò?èìY†"?èì,—^a?èì,’µ¹Ä?èì 2 „?èì‰N:?èëÓ‚«Y,?èëÓ~¢6?èë¦÷ɺª?èë¦ó! ?èëzlŒàö?èëzgä:¨?èëMàõ„Ú?èëMÜLæà?èë!UUR?èë!PZ¿¬?èêôȵ¨Â?èêôÄ o?èêÈ< é?èêÈ7ed?èꛯ ÅX?èꛪcH®?èêo!®;L?èêoÆö?èêB“ö¸?èêBM—¶?èêã&+?èê:Â~?èééwuQ­?èéérÌöT?èé¼è­>ð?èé¼äëì?èéYŠDi?èéTáù¹?èécÊ i¯?èécÅd'T?èé7:4â?èé75‹ÔÛ?èé ª”?èé ¥Ybl?èèÞtOß?èèÞÌ&‚?è豈‘a?è豃ÙpY?èè„÷)´5?èè„ò›‚?èèXev|z?èèX`Îl?èè+ÓhJ7?èè+ÎÀB/?èçÿ@ÿ$î?èçÿ9"?è×AæxÒz?è×AáÓóí?è×1´aT?è×-‹"?èÖè|–, ?èÖèwñ^6?èÖ»Ç: ?èÖ»Âyt?èÖKâÎ?èÖ §%°?èÖb[ݽ?èÖbV{(û?èÖ5¤šâ:?èÖ5Ÿö5Ô?èÖíºçà?èÖéCÖ?èÕÜ6V?èÕÜ1ܺR?èÕ¯~î4?èÕ¯zI ¼?èՂljv?èÕ‚Â\þ?èÕVº­Ã?èÕV +)?èÕ)VXJ?èÕ)QuÞ ?èÔü 8ˆ?èÔü˜{Ƨ?èÔÏãÌUò?èÔÏß'ìn?èÔ£*·ø?èÔ£%zVÐ?èÔvpf ?èÔvks ??èÔIµ¶¯?èÔI±¿@?èÔúûl0?èÔöW$?èÓð?ç+?èÓð;Bë[?èÓÄz?èÓÃÕÌ5?èӖȲõ]?èÓ–ÄÆb?èÓj ‘°?èÓjí‰z?èÓ=Pêõ?èÓ=KrÌ´?èÓ“C])?èÓŽŸGE?èÒãÖ®š?èÒãÑq¡?èÒ·Žî]?èÒ·êé4?èÒŠZ¯#Þ?èÒŠV '?èÒ]œj‡"?èÒ]—Æ’³?èÒ0ÝÂw’?èÒ0Ù‹?èÒÀx³?èÒ”ÿ?èÑ×_d: ?èÑ×ZÀ^·?èѪŸ®Ù?èѪ› Gá?èÑ}ßžzL?èÑ}Úú¯±?èÑQ4m?èÑQ>0?èÑ$^o¼"?èÑ$YÌC?èÐ÷Q´Ê?èÐ÷˜®H?èÐÊÛÙ™ð?èÐÊ×5ðÌ?èО"–?èОdÑ?èÐqWÜþF?èÐqS9eß?èÐD•W„Ê?èÐD³ôÁ?èÐÒw½ƒ?èÐÍÔ5Ø?èÏë?ý?èÏë ›±?èϾK¬!p?èϾGª‚?èÏ‘‡¿«Ë?èÏ‘ƒ=;?èÏdÃyµm?èÏd¾ÖOe?èÏ7ú5à’?èÏ 9ßUh?èÏ 5;ÿô?èÎÞtŒY‘?èÎÞoé |?èα®ÞCµ?èαª:þÿ?è΄è׃?è΄ä4E+?èÎX"w?èÎXÓß?èÎ+[¼ÿ¿?èÎ+WÔ%?èÍþ”©Nò?èÍþ+·?èÍÑÍ<?èÍÑȘí+?èÍ¥u2[?èÍ¥Òß?èÍx=TÕP?èÍx8±Ë3?èÍKtÚ ‘?èÍKp7žÓ?èͬJæ?èͧdQ‡?èÌñâÚ,J?èÌñÞ7;K?èÌÅS£Ì?èÌÅ°»,?è̘Os¸Î?è̘JÐØŽ?èÌk…:þ?èÌk€—C?èÌ>º§ØÊ?èÌ>¶ I?èÌﻚÔ?èÌëÓ³?èËå$vÙ?èËåÓY?è˸X×®á?è˸T4ø€?èË‹Œß·ö?èË‹ˆ= õ?èË^ÀŽ:z?èË^»ë”Ù?èË1óã•t?èË1ï@ø3?èË&ßxœ?èË"<ã»?èÊØY‚Bú?èÊØT߶y?èÊ«‹ÌS‡?èÊ«‡)Ïf?èÊ~½¼ªÁ?èÊ~¹/?èÊQïSÿH?èÊQ걋è?èÊ% ’Ü?èÊ%ï•Ý?èÉøQv¶Ý?èÉøLÔT>?èÉË‚€H?èÉË}`& ?èÉž²4µD?èÉž­’cf?èÉqâ ´Î?èÉqÝkkQ?èÉEŽ5x?èÉE ëô[?èÉ@µæÿ?èÉ<®D?èÈëoƒÊ?èÈëjᙪ?èȾøì©?èȾ™VÄ°?èÈ‘ÌVI?èÈ‘Çs6±?èÈdùØ‹?èÈdõ5ðT?èÈ8'Bf?èÈ8" WB?èÈ TSrœ?èÈ O±l'?èÇÞ 4x?èÇÞ|i6d?èDZ­jb'?èDZ¨Èlu?èÇ„Ùq?èÇ„ÔÏ´?èÇXÎ?èÇX|2ß?èÇ+0hbB?èÇ++Æ…´?èÆþ[P8`?èÆþV®d4?èÆÑ…ÝŸª?èÆÑ;Óà?èƤ°U ?èƤ«p‘¤?èÆwÙíÈ?èÆwÕKFÁ?èÆKn³°?èÆJþÍ ?èÆ,–k“?èÆ'ôÁQ?èÅñUe7B?èÅñPÕb?èÅÄ}Úo ?èÅÄy8ÕŒ?èÅ—¥öq¹?èÅ—¡Tàœ?èÅj͹ž?èÅjÉ^?èÅ=õ#L|?èÅ=ðÌ$?èÅ3„6?èÅ’ @?èÄäBêL™?èÄä>HÝ?èÄ·iG¬ô?èÄ·d¦EÄ?èÄŠL[€?èÄŠŠªü²?èÄ]´÷° ?èÄ]°VZ4?èÄ0ÚI\0?èÄ0Õ¨(?èÄÿBk?èÄú ÎÅ?èÃ×#âs?èÃ×AR0?èêH(È?èêC‡“#?èÃ}lz‹?èÃ}guN?èÃP«®W?èÃP‹ Š=?èÃ#²ç ?èÃ#®EñR?èÂöÕÉLÉ?èÂöÑ(9u?èÂÉøRtä?èÂÉó±iô?è‚ä?èÂáá?èÂpÉE?èÁ¼»ð©?èÁàYoÒ?èÁÛ¸Ÿš?èÁc9.?èÁbûzqY?èÁ6ƒÕH?èÁ6ã×?èÁ >“¢Î?èÁ 9òëÁ?èÀÜ]KWÀ?èÀÜXª©?èÀ¯{©õZ?èÀ¯w O?èÀ‚™¯‚ñ?èÀ‚•å?èÀU·\_*?èÀU²»É­?èÀ(Ô°è¢?èÀ(Ð[Š?è¿ûñ¬ ²?è¿ûí ›ý?è¿ÏN½I?è¿Ï ®@ù?è¿¢*™ ?è¿¢%ø©?è¿uFŠAP?è¿uAéÕÉ?è¿Hb"à?è¿H]‚|æ?è¿}cWÊ?è¿xÂý ?è¾î˜JR¸?è¾î“ª_?è¾Á²ÙŒ’?è¾Á®9B?è¾”ÍÉ?è¾”ÈoÅ9?è¾gæíȬ?è¾gâM?è¾;rÙˆ?è¾:ûÒ¨Â?辟@®?è¾ÿM?è½á2s³ô?è½á-Ó“ø?è½´Jï4Ú?è½´FOC?轇cy4?轇^rj?è½ZzÝ1?è½Zv=*E?è½-’Oc»?è½-¯eS?轩ioÁ?轤Éy¿?è¼ÓÀ*­õ?è¼Ó»ŠÀY?輦֓Ô?輦Ñóîæ?è¼y줒L?è¼yèµz?è¼M\ïÎ?è¼Lý½b?è¼ ½K'?è¼ !?è»ó,»+—?è»ó(gö?è»ÆAUßÀ?è»Æ<¶$…?è»™U˜o?è»™PøUš?è»li¬Õ?è»ldâg?è»?}Φ?è»?xr,?è»I#€?軋©‰Ý?èºå£( Ë?èºåžˆx?躸µ­Úm?躸±Q—?躋ÇÛJø?躋Ã;ʇ?èº^Ù° ~?èº^Õ“t?èº1ë+tî?èº1æŒK?èºüNë ?èº÷¯ƒã?è¹Ø oà?è¹Øz ?蹫Š³H?蹫ë\Ù?è¹~-¤pE?è¹~)";?è¹Q=dúd?è¹Q8Å´Á?è¹$LÍ,?è¹$H-Éð?è¸÷[ÜF¸?è¸÷W=ã?è¸Êj“`?è¸Êeóêò?è¸xñ)J?è¸tRC?è¸p†öÚÌ?è¸p‚W¿-?è¸C”£Ü ?è¸CÈÑ?踡ø4B?è¸Y)q?è·é®óê´?è·éªTèJ?è·¼»˜ Ú?è·¼¶ù×?è·ÇâëŠ?è·ÃCùî?è·bÓÕíO?è·bÏ7?è·5ßp/?è·5ÚÑ2b?è·ê²‰?è·æ:$?è¶Ûõ›D?è¶Ûðüt?趯-c?趮ûŽ›ú?趂 e¾Š?趂Æÿ\?è¶UFg?è¶U§°:?è¶(ζ?è¶(0°?èµû&þ[ð?èµû"_µú?èµÎ/Ödô?èµÎ+7Çe?赡8V*J?赡3·•$?èµt@}(?èµt;Þxj?èµGHKªÐ?èµGC­&{?èµOÃ'Š?èµK$«?è´íVáx„?è´íRCÿ?è´À]¨?è´ÀY •å?è´“dÈ9?è´“_xe…?è´fj,yv?è´feŽ*?è´9oê î?è´9kKÏ ?è´ uPÊÈ?è´ p²M?è³ßz^td?è³ßuÀ3R?è³²Òú?è³²zušQ?è³…ƒrIš?è³…~ÔZ?è³X‡wÕ¿?è³X‚Ù­è?è³+‹%Úx?è³+†‡» ?è²þŽ| ?è²þ‰Ýñ?è²Ñ‘zÇ?è²ÑŒÜ+?貤”õå?貤ï²?è²w–nÉm?è²w‘Ðˤ?è²J˜dÝö?è²J“Æè–?貚?ˆ?貕eR‘?è±ð›IõZ?è±ð–¬Ì?è±Ãœ8¯¿?è±Ã—šÓ›?è±–œÏ?è±–˜1KU?è±i¦"?è±i˜pÚÑ?è±<œõð—?è±<˜X-°?豜…³u?è±—çø÷?è°â›½Ÿ?è°â—í?è°µš“^ ?è°µ•õ´w?è°ˆ™C*?è°ˆ”i¡ê?è°[—"ÉŒ?è°[’…0·?è°.”æOR?è°.H¾ç?è°’Q„É?è°³üÈ?è¯ÔeÔ?è¯ÔŠÇŸ=?诧ŒÉ3?诧‡‚R?è¯zˆ‚8È?è¯zƒäÊ?è¯M„ŒË™?è¯MïeA?è¯ €>Û$?è¯ {¡}7?è®ó{™??è®óvûƼ?è®Ævšèo?è®Æqý›W?è®™qDFá?è®™l§3?è®lk–C8?è®lfùõ?è®?eà*?è®?`ò¬R?è®_0Î?è®Z“¢¯?è­åXzÆ8?è­åSÝ£5?è­¸Qlty?è­¸LÏYâ?è­‹J‰>?è­‹Ehw?è­^BG½ª?è­^=ª³é?è­1:1fô?è­15”ež?è­1ÂŒQ?è­-%“g?è¬×(ü9@?è¬×$_HÀ?謪Þtç?謪AŒÓ?è¬}gëh?è¬}Ë ¿?è¬P ™þø?è¬Pý'»?è¬#t_þ?è¬"ýב,?è«õ÷öh+?è«õóY¡Æ?è«Èí!"â?è«Èè„dè?è«›áóéÔ?è«›ÝW4F?è«nÖnÄ2?è«nÑÒ?è«AÊ’Þ?è«AÅõk(?諾]Ô?諹Á7¹?èªç±Ñj^?èªç­4Ö€?誺¤í‡‡?誺 Pü?誗±Ûô?誓Xî?èª`Š#?èª`…ˆ?èª3|3GR?èª3w–Õ$?èªmðÃK?èªiTYŠ?è©Ù_V<‰?è©ÙZ¹Û4?詬Pd¾D?詬KÈe[?è©AKœ?è©<~û?è©R1zBm?è©R,Ýú]?è©%!‚Š?è©%åÀç?è¨ø1‰$?è¨ø •Qí?è¨Ë‰»?è¨Êûíaò?è¨ïŠ{?è¨êíø?è¨pÞ32?è¨pÙ—rB?è¨CÌ…–c?è¨CÇé€à?診€8?è§bjdÊÞ?è§5[EÊ?è§5V©ç?è§G4Q®?è§B˜w(?è¦Û2ËP’?è¦Û./~z?覮 ÍÚ?覮o.?è¦ó'K?è¦Wf ?è¦Só„d?è¦Sîè«>?è¦&ݽÞ,?è¦&Ù"-Ê?è¥ùÇ ÷?è¥ùÃO ?è¥Ì±,²bT?è› Íˆ™$?è› ÈîüF?èšÞ¡â”2?èšÞHÿÅ?èš±uæV'?èš±qLÊ,?èš„I’!?èš„Dù ™?èšWè™8?èšWO!?èš)ïÞÁ?èš)ëENs?è™üÂrøg?è™ü½ÙŽ5?è™Ï”±-˜?è™ÏËØ?虢f˜»:?虢aÿaì?è™u8(Ou?è™u3Žþš?è™H aJ5?è™HÈÌ?è™ÚB¯å?è™Õ©oî?è˜íªÍ3ø?è˜í¦3üt?è˜À{3§?è˜Àvh•?蘓Jݳj?蘓FDŒË?è˜fcz?è˜fÉòN?è˜8é‘Qå?è˜8äø<,?è˜ ¸i+?è˜ ³ÐÍ?è—ކ頄?è—Þ‚P›°?è—±Up?è—±Pz?è—„"æ`?è—„Mr?è—Vða¢N?è–tî¶d˜?è–tê£^?è–Gº)I'?è–Gµa?è–…EfŒ?è–€¬¶9?è•íP ÃÖ?è•íKr÷?è•Àyh ?è•ÀàÈ¡?è•’ä‘Z9?è•’ßøÃA?è•e®R÷~?è•e©ºhú?è•8w½š²?è•8s%¢?è• @ÑJå?è• <8ÍI?è”Þ b?è”Þöœ:?è”°ÑõFÄ?è”°Í\Ú?蔃š ?蔃•m³•?è“Gþ~ ?è“GfTû?è“ÎZ>e?è“ÉÂÉ?è’ì“_¶D?è’ìŽÇž?è’¿Xìª?è’¿SvÜ÷?è’’g<ž?è’’Ï5`?è’dàj8?è’dÛÒn?è’7¤Kt?è’7Ÿ~U?è’ glY?è’ bÔ(z?è‘Ý*kõ?è‘Ý%Ó1‹?葯í¬O?葯è|ÏY?è‘‚¯g/u?è‘‚ªÏZõ?è‘Uqcÿh?è‘UlÌ3]?è‘(3 Ë@?è‘(.r«?èúôY›ü?èúïÁàÜ?è͵Sx ?èÍ°»Åõ?è u÷h6?è q_¾?ès6Doà?ès1¬Î!?èEö;î?èEñ¤U8?èµÜéC?è±EXn?èëu(?èëpŠµ?è¾4Ç?è¾/…G3?èò¼1?èî$–¿?èc±—¢?èc¬m(¦?è6n÷U?è6j_¯Ï?è ,“çA?è 'ü‰0?èŽÛéÐÇk?èŽÛå9qÐ?莮¦­®œ?莮¢ax?èŽc5?èŽ^ÍU?èŽTdõ#?èŽT͸ì?èŽ&Û> Ï?èŽ&Ö¦×?èù–Á[­?èù’*0c?èÌQíí?èÌMVÊ2?èŸ ÃÅØ?èŸ,«{?èqÇCîÀ?èq¬ÜÚ?èDlÁU?èD|Õ·å?è;?F1?è6¨E8?èŒéô»Ú(?èŒéð$á¥?茼­â.Y?茼©K>M?èŒf±ž?èŒb¶o?èŒb+1²?èŒb”R”?èŒ4×MîÕ?èŒ4Ò·.?茈?茊ƒ¹à?è‹ÚF‘e?è‹ÚAú>­?苬ý°¿?苬ùÛ?è‹´zÀ¬?苯ä â?è‹Rjîdk?è‹RfW¸?è‹%! ±N?è‹%u t?èŠ÷ÖÓ!?èŠ÷Ò?èy› ­•Ð?èym£×ˆ?èymŸDn—?èy@8¸y?èy@3†m?èyÌ…©?èyÇsB´?èxå_ž†K?èxå[ KÔ?èx·òá²?èx·îMäº?èxŠ…ÎèZ?èxŠ;¾à?èx]h0?èx]Ôá4?èx/ª£n?èx/¦÷ï?èx<³7?èx7ì£7?èwÔÎʸ?èwÔÉsÃ6?èw§_8]Í?èw§Z¥^É?èwyðsO?èwyë|Ê?èwL€œß?èwL| #Ø?èwÎ@Š?èw ;[?èvñ ª°é?èvñœÓà?èvÄ01iÛ?èvÄ+ž•P?èv–¿cqò?èv–ºÐ¥æ?èviN?%Ö?èviI¬bI?èv;ÜÆ‹Ë?èv;Ø3н?èvjøU¸?èvfe£)?èuàøÔß²?èuàôB5¢?èu³†\Û?èu³Ê9o?èu†NÒ?èu†üµÀ?èuX lìo?èuX›Ú[Ü?èu+,õD?èu+(bˆ0?ètý¹(k?ètý´•ëù?ètÐEZÂ?ètÐ@sã­?èt¢Ð?èt¢Ëý ˆ?ètu[úA?ètuW1T,?ètGæ¢8®?ètGâÛ?ètq,Æ?ètl™»°?èsìûaIZ?èsìöÎüÃ?ès¿…@”ž?ès¿€®P‡?ès’Êøç?ès’ 8½P?èsd˜Ò4?èsd“nŸ?ès7 á}?ès7ORx?ès ©mUv?ès ¤Û3_?èrÜ1¤b@?èrÜ-H©?èr®¹…ÿþ?èr®´óîç?èrA4ð?èr<,Y?èrSÈLé?èrSúÒ?èr&O/+C?èr&J3­?èqøÕ½úT?èqøÑ, >?èqË[ø&Î?èqËWf@9?èqáÝ W?èqÝK/B?èqpgm´?èqpbÛÞ?èqBì©ÌÀ?èqBèÿ­?èqq´?èqlþïs?èpçö"ÅÑ?èpçñ‘ ¾?èpºz`³&?èpºuÎÿ”?èpŒþIØ´?èpŒù¸-¤?èp_Ýè:?èp_}LEª?èp2’º?èp2‹ø«?èpˆ‰ø?èpƒvøj?èo× Ÿ)Ü?èo×  Ð?èo©Œá$*?èo©ˆO£ž?èo|ÍÕ¥?èo| <]š?èoNf™T?èoN‹Õ)Ë?èo!«!?èo! ¹ø?ènó’š^?ènóŽÀØ?ènÆ5™q?ènƤCm?èn˜“{ìò?èn˜ŽêŸo?ènkmÊÆ?ènkÜ…Ä?èn=“ ŽÅ?èn=ŽzRE?ènU?Â?èn Ä Ä?èmâ‘Iå?èm⌸º?èmµê1 ?èmµ Y?èm‡Ž6Ó?èm‡‰¥¸‡?èmZ .)W?èmZa?èm,‰ÑŽÙ?èm,…@…d?èlÿ! \?èlÿ j?èlÑ„j|?èlÑr ?èl¤¦Mo?èl£ü]‚?èlv|åu ?èlvxTž?èlHøÏ>6?èlHô>_L?èltd®’?èloÓØ+?èkíï¦!Ø?èkíëSó?èkÀj’K?èkÀf…Ÿ?èk’å)Ú½?èk’à™Þ?èke_l‚â?èkeZÛΆ?èk7ÙZJ=?èk7ÔÉžc?èk Ró7—?èk Nb”@?èjÜÌ8Pv?èjÜǧµ¢?èj¯E'ž%?èj¯@— Ô?èj½ÂÏþ?èj¹2F/?èjT6 —à?èjT1y•?èj&­ûRÀ?èj&©jÙø?èiù%˜±9?èiù!@ô?èiËœáº?èi˘QRM?èižÕÊ>?èižEjÿ?èipŠu’Z?èip…å;Ÿ?èiCÁ%?èiBü0Êí?èiv·fÌ?èir'!?èhçìYÕ‘?èhççɘa?èhºa¨W?èhº]âª?èhŒÖ¡4W?èhŒÒ.?èh_KF1æ?èh_F¶A?èh1¿—k¨?èh1»P†?èh3“@%?èh/-‡?ègÖ§;^]?ègÖ¢«TD?èg©#h?èg©ÿ!Ò?èg{ŽA>?èg{ˆþH,?ègN9hI?ègMû©w¼?èg rŸJ?èg n·@?èfòä’™Î?èfòàºI?èfÅV@±Ú?èfÅQ°ÚÙ?èf—Çšî0?èf—à ³?èfj8 W3?èfj4‘;?èf<©Qò?èf<¤Â4œ?èf¯p¿?èf»Ð?èeቸ…>?èeá…(ØÓ?èe³ùm6Y?èe³ôÝ’s?èe†hΉ'?èe†d>íÆ?èeX×ÚÜ“?èeXÓKI·?èe+F“Šy?èe+B!?èdý´øDØ?èdý°hÃ?èdÐ#½·?èdÐyDi?èd¢ÅP?èd¢Œ5ßÔ?èdtþ.L?èdtùžœ ?èdGkB6?èdGf²ÖW?èdØêò?èdÓs“¸?ècìDo+z?ècì?ßÜÆ?èc¾°‡S/?èc¾«ø ?èc‘K½Ž?èc‘¼å?ècc‡½Í?èccƒ-å©?èc5òÙug?èc5îJHÉ?èc]¢&ÿ?ècYæ?èbÚÈ‹ ?èbÚÈox?èb­28ª8?èb­-©—*?èbœ4³?èb—w*+?èbRÜŠ?èbRðÚˆ?èb$n¤ÿ/?èb$j³?èaö×v¡t?èaöÒç°~?èaÉ?ôÊ?èaÉ;eá©?èa›¨+:?èa›£KP?èanì^³?èan ]‡O?èa@w]ý?èa@rÎ2?èaÞy “?èaÙêF†?è]UY+@?è]'gÊ™@?è]'c<Ž‚?è\ùÇY÷Ø?è\ùÂËõ¡?è\Ì&•µŒ?è\Ì"»Ý?è\ž…}„‹?è\ž€ï“c?è\päi!?è\pß„€‚?è\CBRÃa?è\C=ÄãJ?è\ ?C?è\›±k„?è[çýØ—ó?è[çùJÈë?è[º[".?è[ºV[®?è[Œ¸?è[Œ³€Ñ ?è[_¬¤?è[_Û5?è[1pöÙJ?è[1li,c?è[Ìío«?è[È_ËL?èZÖ(?èZÖ$j-?èZ¨ƒßL?èZ¨Q¸³?èZzÞÛHW?èZzÚM½’?èZM9ƒXÊ?èZM4õÖ?èZ“ׄ?èZJ c?èYñíØyÝ?èYñéK²?èYÄG†@Ó?èYÄBøØ1?èY– à6Â?èY–œRÖ¨?èYhùæbj?èYhõY Ú?èY;R™sc?èY;N $[?èY ªùì?èY ¦kÕm?èXàbÁ?èXßþx$Ì?èX²Z½ú'?èX²V0Ä»?èX„²"èÚ?èX„­•»ö?èXW 52Í?èXW¨s?èX)_óáx?èX)[fŧ?èWû¶_O÷?èWû±Ò<¯?èWÎ w…?èWÎêzF?èW b<‡O?èW ]¯…?èWr·­`f?èWr³ f¼?èWE Ëh?èWE>wo?èWa–R?èW] i…?èVé¶ Ïa?èVé±€ïS?èV¼ 2;s?èV¼¥cï?èVŽ^H©?èVŽYvy¯?èV`±R?èV`¬ô‹©?èV3¬²Ï?èV3ôé?èVW{|ç?èVRîÇ‹?èUשíöß?èU×¥aJ?èU©ü ¦¢?èU©÷€Z?èU|MØ;ˆ?èU|IKŸË?èUNŸOjâ?èUNšÂׯ?èU ðsŒ©?èU ëç?èTóADS1?èTó<·Ñ?èTÅ‘ÀÈ'?èTÅ4N”?èT—áêC?èT—Ý]Òx?èTj1À#:?èTj-3º¼?èT*Ò¸?èR¡9ž¿¦?èRsŠje·?èRs…Þ[1?èREÖW6?èREÑÊÿ}?èQ3’oÈ?èQà²Ùp?èQÜ'F?èPØ*]Ø?èPØ%y :?èPªs&?èPªnyq|?èP|»±=”?èP|·%‘?èPO R?èPNÿ~® ?èP!Lj~?èP!G„Ï?èOó“ÂåJ?èOó7Rh?èOÅÛ"qn?èOÅÖ–ç?èO˜"/i¾?èO˜£çõ?èOjhèØX?èOjd]_?èO<¯OÀg?èO<ªÄO¶?èOõc€8?èOðØ?èNá;#v"?èNá6˜Š?èN³€ùs?èN³|¢h?èN…ŬÆ?èN…Á ÂH?èNX sÆT?èNXè€b?èN*Nè Ä?èN*J\ã_?èMü“ #(?èMüŽ~îP?èMÎÖÙ+ß?èMÎÒMÿ”?èM¡UAŽ?èM¡ÊÐ?èMs]~¾ü?èMsXó£Ë?èME U?èME›Éïë?èMâØg?èMÞM\ù?èLê% GB?èLê ~E¸?èL¼fç’?èL¼b\•?èLŽ¨qð¿?èLŽ£çO?èL`éªÃ¡?èL`åÛ¿?èL3*0?èL3&Q*?èLk#:C?èLf˜c|?èK׫cç’?èKצÙX?èK©ëQ–ä?èK©æÆÑ7?èK|*ì¢ö?èK|&aå×?èKNj4¾`?èKNeª Ï?èK ©*—ã?èK ¤Ÿëà?èJòçÍŽ?èJòãBê’?èJÅ&£ž?èJÅ!”¶?èJ—dcû?èJ—_ˆÑ¡?èJi¡¬¼b?èJi"2–?èJ;Þó½/?èJ;Úi;ñ?èJæÈÌ?èJ\P?èIàX‡5ó?èIàSüÅÒ?èI²”Ô·4?èI²JO¡?èI„ÐΫ?èI„ÌDL?èIW vM?èIWë½×?èI)GÊ¥_?èI)C@Ww?èHû‚Ìà?èHû~Aˇ?èHͽz]p?èH͸ð ¥?èHŸ÷Ö9¢?èHŸóLf?èHr1ß?èHr-TØ`?èHDk”ÃL?èHDg  -?èH¤ø%í?èH n ]?èGèÞâš?èGèÙ}Й?èG»ÅOÔ?èG»;Fb?èGO0 5?èGJ¦R?èG_‡G^t?èG_‚½f ?èG1¿ a?èG1º‚q;?èGö~†?èGñôŸK?èFÖ-Õ’?èFÖ)öë?èF¨djTÌ?èF¨_à~´?èFzšä²¡?èFz–Zå?èFLÑ ¥î?èFLÌàö?èFà1?èFVt­?èEñ‹=ó?èDÞv§9ü?èDÞr¹?èD°©æ}Õ?èD°¥]ê?èD‚ÜÓ@ê?èD‚ØIÑ?èDUn…p?èDU å¥?èD'A¶Z»?èD'=,ü€?èCùs¬à?èCùo"Á5?èCË¥Ol•?èCË Æ{?èCÖŸºº?èCÒv0?èCp¯¡?èCps§?èCB8JMf?èCB3Áý?èCh££ˆ?èCdx¯?èB昪´,?èBæ”!‘ä?èB¸È_Ù¸?èB¸ÃÖÀ?èBŠ÷Âs?èBŠó9aó?èB]&Ò†ç?èB]"I~Q?èB/UÃZ?èB/QÃT?èBƒü3•?èBsögìF?è>öccàL?è>È;,?è>È‹öÝñ?è>š¸À§?è>š´8Rq?è>là¯A?è>lÜ&õh?è>?Kå?è>?ÂÍa?è>/”ÃD?è>+ ˆQ?è=ãVŒ_!?è=ãR,Á?è=µ}1C˜?è=µx©Ê?è=‡£ƒw4?è=‡žûUù?è=YɃ§à?è=YÄû7?è=+ï0f?è=+ê¨}O?è<þŒ$f?è<þâ?è<Ð9•Ì ?è<Ð5 Í?è<¢^LÎ?è<¢YÄ™o?è—4í?è: :¶š?è9ò^}2ª?è9òYõ¼ê?è9Ä~}?è9ÄyŠ–Q?è9–T³ ?è9–˜ÍNˆ?è9h¼EH?è9h·½ì?è9:Úä„?è9:Ö\É?è9 ù0ãT?è9 ô©˜w?è8ß+O|?è8ߤ 3?è8±4Ô©?è8±0LÔõ?è8ƒR+zò?è8ƒM¤IÑ?è8Uo0L™?è8Uj©$ ?è8'‹ã„Õ?è8'‡\dÝ?è7ù¨E}¸?è7ù£¾fT?è7ËÄUC?è7Ë¿Î4L?è7à/?è7ÛŒ(Û?è7oû›¼?è7oöøž?è7B™Aj?è7BLW?è71atÐ?è7,ÚˆR?è6æKØð?è6æGQ¬?è6¸eýžÃ?è6¸avÃn?è6ŠÐûQ?è6Š{J(‘?è6\™R¬!?è6\”Ëáõ?è6.²‚·º?è6.­ûö#?è6Ë`Ñ"?è6ÆÚ ?è5Òãí¥Ü?è5Òßfõo?è5¤ü(•q?è5¤÷¡íš?è5w¦j?è5w‹'?è5I+©†D?è5I'"ï–?è5Bï”?è5>iw?è4íYä~¿?è4íU]ùc\?è0Ÿÿ.¬?è0Ÿyw9?è0q.èÝb?è0q*c.†?è0C=€â¢?è0C8û<]?è0KÇDä?è0GA§5?è/çY¼ Ÿ?è/çU6u‡?è/¹g_:I?è/¹bÙ­È?è/‹t°Ú\?è/‹p+Vr?è/]±DŸ?è/]}+ÉL?è//Ž_…’?è//‰Ú×?è/š¼ðõ?è/–7†Ñ?è.Ó¦Èæ–?è.Ó¢C… ?è.¥²‚ÆU?è.¥­ým_?è.w½ë?è.w¹f@1?è.IÉ¥&?è.IÄ}]_?è.ÓÈ ?è.ÏBËa?è-íÞe I?è+˜I>{r?è+˜D¹´“?è+jO@’?è+jJ»Ô8?è+?è+?è%NY—(X?è% XöúÅ?è% Tsiy?è$òS€û`?è$òNýr¯?è$ÄMºi¸?è$ÄI6é¢?è$–G¢ù&?è$–Cª?è$hA:]?è$h<¶î'?è$::€îÌ?è$:5ýˆ…?è$ 3wà?è$ .óª5?è#Þ,b?è#Þ'˜ €?è#°$nþX?è#°ë±â?è#‚r4Ÿ?è#‚îðÅ?è#T#¿¿?è#T „€?è#& „ò+?è#&¿†?è"ø•F?è"÷þU=?è"ÉùT!x?è"ÉôÑ ?è"›ïÂÑ"?è"›ë?¸O?è"måàî¬?è"má]Þu?è"?Û­‡‡?è"?×*ë?è"Ñ)›?è"̦œ?è!ãÆTܱ?è!ãÁÑæL?è!µ»/RÒ?è!µ¶¬e ?è!‡¯¹Û?è!‡«6®?è!Y£ñö2?è!YŸo¡?è!+—Ú0>?è!+“W\H?è ý‹r V?è ý†ï?ü?è Ï~¹:ï?è Ïz6x1?è ¡q¯Ål?è ¡m- J?è sdU±6?è s_Òÿ°?è EVª±Æ?è ER(Ü?è H¯ o?è D,€!?èé:b°¯?èé5àý?è»+ÆÁ?è»'C¬?èØHM?èUÁÔ?è_ ›C?è_ „g?è0þ ÷j?è0ùŠ‚*?èî..&?èé«Á‚?èÔÝþÿÆ?èÔÙ|›¿?è¦Ír®?è¦ÈýD?èx¼¯:`?èx¸,ç’?èJ«Ž]I?èJ§ ?蚇Š?è•›Eö?èîˆ\É?èîƒÙàÒ?èÀvJmN?èÀqÈ<ó?è’cèÛS?è’_f³•?èdQ6ÄŠ?èdL´¥i?è6>3Ü~?è69±Åú?è*á"#?è&_=?èÚ=£T?èÚ»ž ?è¬A´?è«þ¿·r?è}îíAç?è}êkMÙ?èOÚH@Ê?èOÕÆUY?è!ÅR?è!ÀÐ.­?èó° `?è󫉅Ï?èÅšsßÛ?èÅ•òB?è—„‹D–?è—€ {›?èinRŒò?èiiÐÌ•?è;WÉ­?è;SGaî?è @îñ?è ?è‚õúáö?èTâ` Ì?èTÝÞ"?è&Éò¸?è&Åq3ú?èø±5z’?èø¬³ÿ$?èʘ'´:?èÊ“¦Ak?èœ~ÈÅÙ?èœzG[¨?èneË?èn`˜Ÿ9?è@KÅã?è@F™lï?è0ÊȺ?è,Ixd?èä*bg?èä©°?èµû:>»?èµö¸ÿ¢?è‡ßù?è‡Ûwâ ?èYÄgW?èY¿æo|?è+¨…ÑÊ?è+¤¬Ž?èýŒS¼Æ?èý‡Ò (?èÏoÑd¤?èÏkPP¥?è¡Rþ}?è¡N}q¤?ès5Û^ø?ès1Z\7?èEg¾?èEæÃû?èú¤F5?èö#T²?èèܲÓ?èèØÉï?躾+§¼?躹ªÇw?茟w…è?茚ö®B?è^€sS¨?è^{ò„¢?è0aÄ­?è0\þG?èAz„ž?è<ùÆ×?èÔ!…O.?èÔš?è¦@uX?è¥ü¿ÈÐ?èwà«X#?èwÜ*´;?èI¿Å«C?èI»Eú?èž¿Ÿ?èš,ö?èí} Pþ?èíxŠÆõ?è¿[5eº?è¿V´äQ?è‘9N°?è‘4Õæ?èc›N?ècª%?è4óÕÎî?è4ïUge?èÐÀÅ„?èÌ@fš?èØ­[±É?èبÛ[€?誉¦Gy?誅%ùÐ?è|e¡2?è|a í?èNALx?èN<Ì;§?è §zr?è 'Fª?èñ÷²’7?èñó2g?èÃÒnG?èÃÍíõÀ?蕬Úõ?蕨Yù?èg†õãr?èg‚uÒ-?è9`Áâ§?è9\AÚ?è :=Ä\?è 5½ÄW?èÝj4?èÝê<£?è®ìG7ô?è®çÇI1?è€ÄÔ1g?è€ÀTKE?èRy@?èR˜‘›¿?è$töÜÒ?è$pwó?èöL„H¬?èöH|m?èÈ#Á”?èÈAÐã?è™ú®Æ–?è™ö/ š?èkÑK’±?èkÌËàU?è=§˜Q ?è=£§æ?è}•\.?èy»?èáSAnž?èáNÁÖ'?è³(Ù;?è³$Ie?è„ýª¢L?è„ù+?èVÒfØ ?èVÍçZ ?è(¦Óyö?è(¢T?èúzïçž?èúvpzP?èÌN¼'à?èÌJ<Ã3?èž"8“ƒ?èž¹7x?èoõeƒ@?èoðæ/Ö?èAÈA³†?èAÃÂh¿?èšÎÆì?è–O„Æ?è åm Ì?è åhŒåI?è ·>øÊ?è ·:y™3?è ‰–Ú?è ‰ ð›?è Záãl}?è ZÝdLá?è ,²àËM?è ,®a´R?è þƒŽ;?è þ-5?è ÐSìºÒ?è ÐOmµ?è ¢#ú`Ò?è ¢{c¿?è só¸}ˆ?è sï9‰?è EÃ'¼?è E¾¨ÐB?è ’F†›?è Ç£p?è éaˆK?è é\–­Ã?è »/•l1?è »+šL?è ŒýÄîþ?è ŒùF%»?è ^ˤ»È?è ^Ç%û(?è 0™5Ïú?è 0”·ý?è fv•ñ?è a÷æ—?è Ô3g¸¸?è Ô.é?è ¦ ø?è ¥ûŠòå?è wÌ\$ñ?è wÇÝ?è I˜^Ö2?è I“àId?è dOº?è _“Ë?è í/uó?è í*÷w”?è ¾ú‰Æœ?è ¾ö S¹?è ÅNÇ‘?è ÀÐ]Q?è bÃ`Š?è b‹Dþî?è 4Yèá+?è 4Ujˆ3?è #¿O¶?è @ÿb?è×íE»z?è×èÇsÉ?詶}!¶?話þâ¨?è{e6Z?è{zæÿð?èMGý­a?èMC›?èG1¯?è É Ž?èðØA$ê?èðÓÃm?èŸëߨ?è›mËÎ?è”gGè?è”bÉ ²?èf.S 8?èf)Õ§?è7õÜ?è7ð’ ï?è »}wÖ?è ¶ÿ†?èÛœ#÷?èÛ};S?è­Gk´?è­Bí8´?è ëß?èm)„?èPÒâ½?èPÍž?è"–ý ?è"’Yý?èô[c¤?èôW¦6?èÆÒ³º?èÆTþñ?è—㾪)?è—ß@þ?èi§S„ð?èi¢Õáp?è;j˜ÿz?è;fdŸ?è -Ž)M?è )—?èÞð4Q?èÞë¶Çÿ?è°²‹,@?è°® «U?è‚t’%?è‚p¢ß?èT6Iv²?èT1Ì?è%÷±—V?è%ó40Z?è÷¸ÊƒG?è÷´M$ð?èÉy“œU?èÉuF¤?è›: ßS?è›5’G?èlú8 ·?èlõºÅQ?è>ºÆ?è>µ•ŠW?èyŸ:?èu!Þ?èâ8ÛC?èâ4]ÙÍ?è³÷Çî"?è³óJÌR?è…¶e‚ã?è…±èi¹?èWt³v–?èWp6f?è)2²! ?è).5Á?èúðb.‚?èúëå/J?ḙ̀¶?èÌ©E$?èžjÓQ4?èžfVcH?èp'•¼?èp#ÖÂ?èAä«#?èAߋ΃?è ,$Á?蛯PÇ?èå\@?èåWƒµì?è·…ÆÒ?è· $?èˆÒ»©•?èˆÎ>ïŽ?èZ£&?èZ‰&t´?è,H:ú?è,C¾Q]?çÿþ„"(?çÿýþ‚?çÿϼ~H?çÿϸhÛ?çÿ¡v(š¸?çÿ¡q¬ ñ?çÿs/„IÀ?çÿs+á?çÿDè‘e­?çÿDäè5?çÿ¡Nþ|?çÿœÒ‰ª?çþèY½¾ˆ?çþèUAR]?çþºݬ ?çþº aHˆ?çþ‹É®)?çþ‹Å1ÎB?çþ]/à?çþ]|³ä?çþ/8b×0?çþ/3æ¡?çþïFp€?çþêÊ/˜?çýÒ¥ÛV^?çýÒ¡_?çý¤\!á?çý¤W¥±n?çýv “?çýv œù¡?çýGÇÁ@?çýGÃDüõ?çý}qg?çýxŸ[Å?çüë2&?çüë-ª‚?çü¼æâÌ™?çü¼âfÈE?çüŽ›P0?çüŽ–Ô4q?çü`On¿Ú?çü`JòÌÖ?çü2?&?çü1þÃ;±?çü¶À ç?çü²D?3?çûÕiòZ¥?çûÕev˜?çû§Ö+z?çû§Z[?çûxÏkGŸ?çûxÊïã?çûJ±µJ?çûJ}5ö5?çû3©z³?çû/-ÄF?çúíåRð?çúíà×BB?çú¿–­%™?çú¿’1€}?çú‘G¹?çú‘C={?çúbøvËú?çúbóû8/?çú4¨å¥I?çú4¤j&?çúXýÿñ?çúT‚}w?çùØÀÙ?çùØDŸ?çù©¸2™™?çù©³·(p?çù{gV,??çù{bÚþ?çùM+(Þ?çùM¯É?çùÄ°ñÈ?çùÀ5š™?çøðrçß?çøðnlŠ?çø К·?çøÂUTÚ?çø“Îi?j?çø“Éî5?çøe{³lä?çøew88Y?çø7(¯)J?çø7$3ýg?çøÕ[Öô?çøÐà³»?ç÷Ú¹|?ç÷Ú}>a„?ç÷¬-Èp·?ç÷¬)M^Ð?ç÷}Ùˆi"?ç÷}Õ _ä?ç÷O„ù½^?ç÷O€~¼Ê?ç÷!0X?ç÷!+¢m?çöòÚð‘ø?çöòÖu¢¶?çöÄ…uzç?çöÄ€ú”O?çö–/¬**?çö–+1L;?çögÙ“°S?çögÕÛ?çö9ƒ- ?çö9~²<ƒ?çö ,wèÙ?çö 'ý$è?çõÜÕs`!?çõÜÐø¤Ú?çõ®~ j­?çõ®y¥¸?çõ€& ?çõ€"d¬?çõQÎN?çõQÊ_?çõ#vPEã?çõ#qÕ­C?çôõÉ*?çôõHù5?çôÆÄçÚÖ?çôÆÀmSŠ?çô˜k½A?çô˜gBÂr?çôjD·x?çôj ÊA?çô;¸}NÂ?çô;´áu?çô ^g°´?çô YíL?çóß5>?çóÞÿ‰ÙG?çó°©QI“?çó°¤ÖöE?çó‚NPŒÐ?çó‚IÖB-?çóSóa‰?çóS?çó%—c| ?çó%’éBÒ?çò÷;vâÂ?çò÷6ü²?çòÈß<ã?çòÈÚÂhë?çòš‚³—^?çòš~9x?çòl%ÜN"?çòl!b7?çò=È·^Ô?çò=Ä=PÝ?çòkBå?çòfÈßÒ?çñá #d?çñá &Â?çñ²¯q*Œ?çñ²ª÷6–?çñ„Q ‘?çñ„L˜ F?çñUòeˆ?çñUíë0è?çñ'“i¥%?çñ'ŽïË1?çðù4 j?çðù/¦˜¸?çðÊÔˆÄÓ?çðÊÐü5?çðœt£°æ?çðœp)ðô?çðno›Ò?çðnõä‹?çð?³íÒ–?çð?¯t#û?çðS[V?çðN¤µf?çïâñÿõp?çïâí†X,?çï´“íÓ?çï´ŒY;?çï†.Ùøö?çï†*`m ?çïWÌÑy¢?çïWÈWöb?çï)j{Z?çï)fžÆ?çîûך?çîû^²?çî̤äÎŒ?çîÌ keO?çîžA¤ž¨?çîž=+>?çîoÞÈñ?çîoÙ•q ?çîAz"”Z?çîAu©E"?çîèyz?çîo2î?çíä±_Û?çíä¬æ=?çí¶Lˆm¸?çí¶H8…?çí‡çc,R?çí‡âéÿË?çíYïy¿?çíY}vUå?çí+-\?çí+´@ð?çìü¶+ ?çìü±¤Ÿ?çìÎO¿>?çìÎKF4­?çìŸéUè?çìŸä™TÁ?çìq‚l>?çìq}žsÄ?çìCÎ6?çìCUF:?çì³62?ç쮽/?çëæKO¶?çëæFÖב?çë·ã¾Í?çë·Þ¢é?çë‰z™AÝ?çë‰v tÃ?çë[Èèy?çë[ P$ ?çë,¨ªg(?çë,¤1«i?çêþ?=Ä?çêþ:Åñ?çêÏÕƒV³?çêÏÑ ¬N?çê¡kz‚2?çê¡gàz?çês#L?çêrüª³“?çêD–~°´?çêD’ W?çê+Œv?çê'‰Ç?çéçÀJÑé?çéç»ÒRç?çé¹T»›_?çæu¦o?çæuŒ.+Z?çæGPfp?çæGØ• ?çæ­¬Uæ?çæ©4/?çåê;»´?çåê7C_¬?çå»É|x~?çå»ÅÁ$?çåVïr?çåRwÃd?çå^䩪?çå^ßž¯?çå0píß­?çå0lvBa?çåýxk¢?çåù×?çäÓ‰µS ?çäÓ…=DZ?ç䥤ï(?çä¥-ké?çäv¡Fòë?çävœÏx[?çäH,›e?çäH(#ó?çä·¢îJ?çä³+…?çãëB\OJ?çãë=äîÈ?çã¼ÌÈÓ­?çã¼ÈQ{Û?çãŽVè0?çãŽRpàý?çã_à¹%9?çã_ÜAÞÆ?çã1j<þ–?çã1eÅÀÒ?çãósÂL?çãîü9?çâÔ|U2?çâÔwÝçÎ?çâ¦á/=?çâ¦j ‰?çâw{p?çâwˆ¨`l?çâI­ƒ?çâI˜›/?ç✲n1?çâ˜;d?çáì$Ã…?çáì‘?çὫÙ?çὦ˜–?çá1È­‘?çá-Q½þ?çá`¸4Ÿ·?çá`³½¸Ô?çá2>Rœ?çá29Û½Ð?çáÄ#K&?çῬu£?çàÕI¦a×?çàÕE/•?çà¦ÎÛCƒ?çà¦Êda?çàxSÂG‰?çàxOKŒ?çàIØ\Œ?çàIÓåcÌ?çà\¨?çàX1ió?çßìà¦èˆ?çßìÜ0G)?çß¾dXHÝ?çß¾_á°/?çßç»éÀ?çßãEYÃ?çßajÒ"Š?çßaf[›>?çß2횧ø?çß2é$)\?çßp€?çßkŸ 2?çÞÕòCD?çÞÕíÌ• ?çÞ§t#4x?çÞ§o¬Ïð?çÞxõµË€?çÞxñ?o©?çÞJvúÍi?çÞJr„zC?çÞ÷ò‘|?çÞó|G?çÝíxœ*?çÝít%èK?çݾøù3X?çݾô‚úF?çÝy è?çÝt’à‡?çÝaøÊÕ?çÝaôT­i?çÝ3x?y¦?çÝ3sÉZ¨?çÝ÷gš?çÝòðîN?çÜÖvA*Â?çÜÖqË(?çܧôÍò.?çܧðWíE?çÜys ²?çÜyn—µâ?çÜJðÿÎ"?çÜJì‰Ú?çÜn¤îÀ?çÜj/í?çÛíëýö?çÛíç‡7Õ?çÛ¿i?çÛ¿d‘7¡?çÛåÄÁ7?çÛáNðz?çÛbb5<ä?çÛb]¿tÚ?çÛ3ÞXŠ!?çÛ3ÙâÊÈ?çÛZ.]Ê?çÛU¸§$?çÚÖÕ·`D?çÚÖÑA²P?çÚ¨PóFi?çÚ¨L}¡(?çÚyËâD?çÚyÇlyµ?çÚKF„'?çÚKB“(?çÚÀØ‹B?çÚ¼c?çÙî:ßëQ?çÙî6jhÙ?çÙ¿´šM>?çÙ¿°$Óy?çÙ‘.eî?çÙ‘)‘ôÜ?çÙb§'ݯ?çÙb¢²uP?çÙ4ûº†?çÙ4†ZÙ?çÙ˜‚?çÙ” ¸%?çØ×»ÔÝ?çØ× F†–?çبˆ©Æ?çب„3Ì2?çØzH‡v?çØyûÓJ–?çØKw›€a?çØKs&L3?çØw?çØê,…ü?ç×îeZϦ?ç×î`å¬ß?ç׿Ûǃ&?ç׿×Ri?çבQç/Ò?çבMrq?ç×bǹ۵?ç×bÃDÓ?ç×4=7ë ?ç×48Âë?çײaèß?ç×­ìñ˜?çÖ×'>.¨?çÖ×"É@?çÖ¨›Íd†?çÖ¨—X~§?çÖzw?çÖz š³K?çÖK„¸r?çÖKãú?çÖ÷¬@[?çÖó7t—?çÕîkÐI?çÕîf’ 8?çÕ¿Þn9?çÕ¿ÙŸ³Ü?çÕ‘PÔÏ?çÕ‘L`p?çÕbÃHIí?çÕb¾Ó ø?çÕ45n“­?çÕ40ùól?çÕ§G²S?çÕ¢ÓÆ?çÔ×Ó«ß?çÔ×_?çÔ¨Š†J?çÔ¨…ž&?çÔyûG”?çÔyöÊ$?çÔKk©F·?çÔKg4Ñü?çÔ܉¯?çÔר?çÓîL tz?çÓîG˜(?çÓ¿»Ë ?çÓ¿·V¥l?çÓ‘+;îi?çÓ‘&Çœ€?çÓbš`‰„?çÓb•ì@O?çÓ4 85Z?çÓ4ÃôÚ?çÓwÂUü?çÓsN1?çÒÖæ5D?çÒÖáŒ-?çÒ¨Sñ7>?çÒ¨O}Ü?çÒyÁ•ì?çÒy½ ó??çÒK.ëÈR?çÒK*w³Z?çÒ›öQ?çÒ—ù?çÑî³|ñ?çÑî?yc?çÑ¿u$5*?çÑ¿p°:Q?çÑáH3û?çÑÜÔA×?çÑbMÝ~?çÑbHªô?çÑ3¸©*€?çÑ3´5IÆ?çÑ#çqß?çÑs™Û?çÐÖŽØuç?çÐÖŠd¦˜?çЧù|?çЧõÆè?çÐycÔ±e?çÐy_`ó‚?çÐJÍßS?çÐJÉkÔ?çÐ7»ò?çÐ3*z?çÏí¡ò-?çÏ휜Nj?çÏ¿ 5Yâ?çÏ¿Á¾Õ?çÏsIî?çÏnš·–?çÏaÛšwn?çÏa×&íÍ?çÏ3CÙ—z?çÏ3?f?çÏ«Ìó?çϧY{[?çÎÖsïä?çÎÖ€e?çΧzÍð¹?çΧvZ‰ï?çÎxáÛÂ?çÎxÝh?®?çÎJHœüø?çÎJD)§›?çίÃ?çΪžvØ?çÍí9÷L?çÍíƳ[?ç;{ï6?ç;v¢³ü?çÍै?çÍÜ1Ý?çÍaEçÿë?çÍaAtÖ?çÍ2ªß*?çÍ2¦kö?ç͉¹’?çÍ ¡2?çÌÕsçí!?çÌÕotÝx?ç̦×ú¡?ç̦Ӈ®?çÌx;¾ÎÍ?çÌx7KБ?çÌIŸ8*~?çÌIšÅ4ø?çÌe€?çÌýò“:?çËìeEã?çËì`Òþí?ç˽ÇÚKÍ?ç˽Ãgpl?çË*<?çË%¨iY?çË`Œ©‚?çË`‡”ß?çË1í¨ ?çË1é5GÄ?çËNû¾×?çËJ‰S?çÊÔ°€3?çÊÔ«Ðf?çʦ¼£Ã?çʦ Iü­?çÊwq*Ðþ?çÊwl¸2 ?çÊHÑLˆ?çÊHÌÙ…á?çÊ1 Ú ?çÊ,®M?çÉë©?çÉëŒ6ŽH?çɼïäÊÈ?çɼërOH?çÉŽNÔ×?çÉŽJa–?çÉ_­vÒš?çÉ_©h‰?çÉ1 ÌŒ„?çÉ1Z++?çÉiÖp?çÉed&Ï?çÈÓÇ“¿?çÈÓÃ!o4?çÈ¥%¢3?çÈ¥ ’[?çÈv‚).š?çÈv}¶ð!?çÈGßj@?çÈGÚ4~?çÈ;Œ¹¬?çÈ7Œ£?çÇê—Ìâ?çÇê“Yð?çÇ»ó¿Ò€?çÇ»ïM¶ç?çÇOfdþ?çÇJôR?çÇ^ªÀÄW?çÇ^¦Nº/?çÇ0ÏG&?çÇ0]E¶?çÇ`‘Qþ?çÇ\YG?çÆÒ»êÊ?çÆÒ¶”úË?çƤ0h$?çƤ¾€Þ?çÆuo K?çÆuj› ½?çÆFÈž†Ú?çÆFÄ,±?çÆ!ㄸ?çÆq·›?çÅézÜ.*?çÅévjiÆ?çźӈÙÀ?çźÏ?çÅŒ+éj?çÅŒ'wÚx?çÅ]ƒýþm?çÅ]ŒT4?çÅ.ÛÆ2¶?çÅ.×T‘6?çÅ3B04?çÅ.Зm?çÄÑŠrMp?çÄц½b?çÄ¢áV?¸?çÄ¢Üä¸c?çÄt7î]˜?çÄt3|Þü?çÄEŽ:\V?çÄE‰Èæs?çÄä:Aç?çÄßÈÔ¾?çÃè9îµf?çÃè5}Pö?çùVzX?çùŠå¢?çÊär7à?çÊàää?çÃ\9BD~?çÃ\4Ðú:?çÃ-Ʀ?çÃ-‰Ud?çÂþáþÁx?çÂþ݈§?çÂÐ5ëŽ>?çÂÐ1z^'?硉‹z?ç¡…X?çÂrÜà-ñ?çÂrØoN?çÂD/éNù?çÂD+x9?ç‚¥¦D?çÂ~4™?çÁæÕ̆?çÁæÐ¥È?çÁ¸'!?羞n?羞i®7?ç¾oºÁö›?ç¾o¶Q—þ?ç¾A7eÏ?ç¾AÇí?ç¾Sa ø?ç¾Nð¼Ò?ç½ãŸ>èõ?ç½ãšÎ¤Š?ç½´êи.?ç½´æ`|~?罆6nØ?罆1§;ã?ç½W!x?ç½W|¡÷>?ç½(ËÀ5?ç½(ÇP’?ç¼ú" Ï?ç¼ú²ˆ ?ç¼Ë`9j’?ç¼Ë[ÉZ‹?缜ªGÌ?缜¥”@?ç¼móƒß)?ç¼mïà™?ç¼?<·EL?ç¼?8GOx?ç¼…ž€?ç¼.“?ç»áÎ:†¢?ç»áÉÊ¢F?绳‹]?绳2½?组^̾?组ZùÚ?ç»U¦HwA?ç»U¡Ø­?ç»&í¶ñ?ç»&éFC„?çºø4×:?çºø0gl?çºÉ{­ É?çºÉw=]Ô?纚Â7Ö5?纚½È.ý?çºlvW¼?çºl¹@?çº=Ni8ü?çº=Iù£3?ç´éeÀ?ç´äö™$?ç³Ù$ýÁŠ?ç³Ù ]¬?糪`Jì¾?糪[Ü‘ž?ç³{›LÝ_?ç³{–ÞŠþ?ç³LÖI ?ç³LÑ”ÿg?ç³n…¼?ç³ DØ?ç²ïJŽI?ç²ïF ó?ç²À„bHÀ?ç²ÀôY?粑½ë*Þ?粑¹}6?ç²b÷(õF?ç²bòº×\?ç²40 i?ç²4+¬ø>?ç²hÂp?ç²dT ?ç±Ö¡)?ç±Öœ°|?籧Ù.3è?籧ÔÀ8ù?ç±yóMø?ç±y …[É?ç±JHms&?ç±JCÿ‰µ?籜ñ?ç±{.(@?ç°ì¶eV?ç°ì²d?ç°½íŽ?簽詾ë?ç°#d‰?ç°ö«?ç°`Yf\?ç°`Tøžj?ç°1]?ç°1Š¯¨?ç°Ĉ¡h?ç°Àõ2?ç¯Óù©om?ç¯Óõ;Ëö?篥.,¬?篥*‘ö?ç¯vc ŽÛ?ç¯v^›üä?ç¯G—Hëå?ç¯G’Ûb®?ç¯Ë=Iš?ç¯ÆÏÉ"?ç®éþæ ™?ç®éúx•à?ç®»2D-ø?ç®»-Ö¿?箌eW°€?箌`êJG?ç®]˜úÕ?ç®]“²]?ç®.ÊË?ç®.Æ/¾?ç­ÿüÏžN?ç­ÿøbRV?ç­Ñ.·?ç­Ñ*I¿×?ç­¢`S–ì?ç­¢[æ\t?ç­s‘¥_®?ç­s8-õ?ç­D¬c&?ç­D¾?:.?ç­óh?ç­îúæÐ?ç¬ç#Ù‘R?ç¬çlyÛ?笸Sÿwœ?笸O’hå?笉ƒÚ¯Ñ?笉m©Û?ç¬Z³kÈ?ç¬Z®þ’‘?ç¬+â°Ý1?ç¬+ÞCè¼?ç«ý«Ýö?ç«ý >òB?ç«Î@[÷Ø?ç«Î;ïä?ç«ŸnÁ€¨?ç«ŸjT¦u?ç«pœÜ.1?ç«p˜o\¾?ç«Aʬ¦B?ç«AÆ?Ý?ç«ø1®¦?ç«óÄîµ?çªä%l=-?çªä ÿ…ý?窵R\W£?窵Mï©4?窆cÜ?窆z”¾.?çªW«[· ?çªW¦ï³?çª(×lH°?çª(Òÿ´…?ç©ú1Üè?ç©ùþÅQ}?ç©Ë.¬Ê?ç©Ë*@Gm?ç©œYÝeù?ç©œUpì?ç©m„ÂÆ‚?ç©m€VU[?ç©>¯]á[?ç©>ªñxö?ç©Ù®l^?ç©ÕB º?ç¨á´½M?ç¨àÿHfk?稲-p: ?稲)ëì?稃VÚª‘?稃Rne2?ç¨TóŒ?ç¨T{†Èï?ç¨%¨À|n?ç¨%¤TH“?ç§öÑCô?ç§öÌÖéÛ?ç§Çùz„ù?ç§Çõb¡?秙!gr?秙ûX~?ç§jI 1ç?ç§jDž!?ç§;paŠ“?ç§;kõ‚‚?ç§ —nq“?ç§ “rC?ç¦Ý¾0L×?ç¦Ý¹ÄVI?禮ä§r?禮à;„=?禀 Óæè?禀hß?ç¦Q0¶?ç¦Q,J$Ñ?ç¦"VL†Ó?ç¦"Qà³N?ç¥ó{˜½]?ç¥ów,ò›?ç¥Ä šªz?ç¥Äœ.è{?祕ÅQdH?祕Àå« ?ç¥fé½J?ç¥fåQßÏ?ç¥8 ß„?ç¥8 sÜ_?ç¥ 1¶Uâ?ç¥ -J¶í?ç¤ÚUBúø?ç¤ÚP×dÆ?礫x„Ùf?礫tK÷?ç¤|›{öï?ç¤|—rC?ç¤M¾(ù?ç¤M¹½}?ç¤à‹E®?ç¤ÜÒ‡?ç£ð¢C?ç£ïþ6Ø®?ç£Á$o†?ç£Á $m?磒EòÄŒ?磒A‡k®?ç£cg*Å?ç£cb¿tì?ç£4ˆÌ€?ç£4ƒ­…)?磨¼æ?磤QRR?ç¢ÖÉx\?ç¢ÖĪBŒ?碧é$(@?碧ä¸û3?ç¢yè¦P?ç¢y}‚?ç¢J(bX´?ç¢J#÷=-?ç¢G‘äÂ?ç¢C&Ñÿ?ç¡ìfwP9?ç¡ìb F:?硽…J?硽€§?ç¡Ž£b??ç¡Žž÷¤Ç?ç¡_Ái)Ú?ç¡_¼þ:&?ç¡0ß$½Š?ç¡0Ú¹Öš?ç¡ü–"?ç¡ø+¾ö?ç Ó¾~—?ç ÓS©/?ç ¤6›xj?ç ¤20«Æ?ç uS.›?ç uNû»?ç FowJ(?ç Fk ?ç ‹uŽ?ç ‡ Û¾?çŸè§*@Z?çŸè¢¿–Æ?矹”Ç4?矹¾*&d?矊ݴخ?矊ÙJ@£?çŸ[ø‹i°?çŸ[ô Úi?çŸ-Ï?çŸ-­ L?çžþ-Y£ƒ?çžþ(ï%Å?çžÏGQ§Š?çžÏBç2‘?çž aB?çž \•ÕÔ?çžqzcš?çžquù7?çžB“}•?çžB:Y?瞬M—È?瞧ãEâ?çäÄÓXæ?çäÀiÄ?çµÝ}?çµØ¥="?ç†õZô?ç†ð˜#\?çX ªþ?çX?ê+?ç)$ü ?ç)Õþ?çœú;©/?çœú6²‹ç?çœËQ߆—?çœËMur?眜hQ¸ã?眜cç­%?çœm~y·?çœmz´¤?çœ>”W8Ô?çœ>í> ?眩ê‘à?眥€ q?ç›à¿3Èt?ç›àºÉßË?ç›±Ô2Bû?ç›±ÏÈc?盂èçE²?盂ä}n”?ç›SýQ—Ã?ç›SøçÉj?ç›%qÞ&?ç›% “?çšö%HŠ?çšö Þa½?çšÇ8Ô®:?çšÇ4jú3?皘L¤?皘G¬øØ?çši_¥ ?çšiZ¥Ž?çš:q¼g*?çš:mRÍt?çš „ ?Â?çš ¶®Ò?ç™Ü–9äí?ç™Ü‘Ð\Ã?ç™­¨ «ô?ç™­£ ,?ç™~¹Žû]?ç™~µ%„À?ç™OÊÊx?ç™OÆa 0?ç™ Û»Ø?ç™ ×Rrü?ç˜ñìc!'?ç˜ñçùÄÜ?ç˜ÂüÀø ?ç˜ÂøW¤›?瘔 Õ?瘔kÈY?ç˜ež‰?ç˜e5G$?ç˜6,ž ?ç˜6'µdÛ?ç˜;U?ç˜6ë×¥?ç—ØJ@Ž®?ç—ØE×g ?ç—©XãÕ?ç—©Tyõø?ç—zg;b?ç—zbÒKù?ç—KuIË™?ç—Kpà¾I?ç—ƒW$?ç—~¥R›?ç–í‰ `?ç–íŒ ?ç–¾¹›~?ç–¾™P¨ƒ?ç–ª þ¶?ç–¦8?ç–`·>ê3?ç–`²ÖÅ?ç–1Ã’%¥?ç–1¿)Lÿ?ç–Ïœ“¼?ç–Ë3ÃÜ?ç•ÓÛ\ü*?ç•ÓÖô5?畤æÓ´"?畤âjõÑ?ç•uò"Z?ç•uí—lÐ?ç•FüãŠt?ç•Føzݲ?ç•|´6?ç•;?ç”éÌ“¾?ç”é cø‹?町Òß@?町jLÔ?甋%Lú?甋!&ÃV?ç”\/†?ç”\*š©?ç”-8,‚?ç”-3Ä {?ç“þA gp?ç“þ<£ø#?ç“ÏI¢Ô»?ç“ÏE:n6?ç“ Q?ç“ M‡"ô?ç“qYòÀy?ç“qUŠk„?ç“Ba¬™¹?ç“B]DM‹?ç“ia”?ç“dµ/?ç’äpD/o?ç’äkÛôÑ?ç’µw!÷A?ç’µr¹Ål?ç’†}¶â?ç’†yMöÔ?ç’W„¯?ç’W˜Ž¾?ç’(Šù¼?ç’(…™â??ç‘ùº¾?ç‘ù‹Q÷ ?ç‘Ê•(9ì?ç‘ÊÀ4?ç‘›šM:Ã?ç‘›•å=Ÿ?ç‘lŸ)]P?ç‘lšÁhõ?ç‘=£¼€?ç‘=ŸTí?瑧þLã?ç‘£–j?çß«ð_\?çߧˆ…[?ç°¯—þí?ç°«0-´?ç²ö¾?箎õ®?çR¶ ´n?çR±£ôÆ?ç#¸Öç‡?ç#´o0©?çô»X]?çô¶ð®ù?çŽj?çŹ(Ä´?ç–¿~uP?ç–»ØÍ?çgÁ#Â?çg¼¼.G?ç8ÂW?ç8¾f?ç Ã}û?ç ¿(ûÓ?çŽÚÄXGé?çŽÚ¿ð΋?玫Ä×g?玫Ào©Ñ?çŽ|Å ?çŽ|À¤¥T?çŽMÄ÷u?çŽMÀ ?çŽÄ™§"?çŽÀ2Pè?çïÃò c?çï¿Š¼ó?çÀÃóÃ?çÀ¾™¯?ç‘ÁÇ}?瑽_Ë¡?çbÀC?çb»ÛÚñ?ç3¾uúâ?ç3ºЙ?ç¼_Ó±?ç·ø²2?çŒÕ¹ÿÿ†?çŒÕµ˜æÑ?猦·W"”?猦²ð¨?çŒw´dT©?çŒw¯ýM‡?çŒH±(9ú?çŒH¬Á;¢?猭£v­?猩< ?ç‹ê©ÔÓX?ç‹ê¥mæ•?ç‹»¥½Cg?ç‹»¡V_m?ç‹Œ¡\-÷?ç‹ŒœõRÈ?ç‹]œ²7-?ç‹]˜KdÈ?ç‹.—¾'²?ç‹.“W^?çŠÿ’‘^?çŠÿŽÐŽ?çŠÐŒü*’?çŠÐˆ•rŒ?犡‡,¼?犡‚Æ Ê?çŠrˆH?çŠr|­á×?çŠCz³E¼?çŠCvL¨?çŠtªÐ?çŠo¢õ?ç‰åm[”?ç‰åh®Ï„?牶eÙl?牶ar‹&?片^RÛf?片Yì`ë?ç‰XV„T$?ç‰XRâs?ç‰)Nlßß?ç‰)Jvù?çˆúF åÙ?çˆúA¥…¾?çˆË=b ?çˆË8û²Ä?爜4o?爜0´€?çˆm+3%|?çˆm&ÌßÃ?çˆ>!®'í?çˆ>Gêÿ?çˆà_&?çˆz+?ç‡à ÉÐÆ?ç‡à c¥o?燱j3G?燰ÿ»?ç‡øÁŒI?ç‡ô[rˆ?ç‡RíÏár?ç‡RéiÐ}?ç‡#â•Ö®?ç‡#Þ/΄?ç†ô×ÓN?ç†ôÒ¬Óð?ç†ÅËF>´?ç†ÅÆàH"?熖¿1[ ?熖ºËmF?ç†g²Ô-ó?ç†g®nHø?ç†8¦-€†?ç†8¡Ç¤W?ç† ™>”è?ç† ”ØÁ„?ç…ÚŒÒx?ç…Ú‡¡à?ç…«~…ï¾?ç…«z -ò?ç…|p¼Az?ç…|lVˆz?ç…Mb£C"?ç…M^=’î?ç…T:;‰?ç…OÔ”!?ç„ïEˆ«Q?ç„ïA# µ?ç„À6ŽHó?ç„À2(³#?ç„‘'Iݯ?ç„‘"äP¬?ç„b¼«t?ç„bW'=?ç„3æ·Ö?ç„3?çš ®Ú?çk5{ô?çkÐå]?ç;ð±/æ?ç;ìL¢?ç ØãѺ?ç ÔL¾?ç~ÝÀÎó?ç~ݼiˆÆ?ç~®¨pm?ç~®¤ ù¥?ç~ÉÓ¸?ç~‹ei&?ç~PvÚ–?ç~Prv+Ó?ç~!]¢ 3?ç~!Y>G>?ç}òD"`?ç}ò?¾ì?ç}Ã*YƒÚ?ç}Ã%õ<‚?ç}”H` ?ç}” ä!?ç}dõî\`?ç}dñŠ&£?ç}5ÛLD?ç}5ÖçïV?ç}Àa¥J?ç}»ý+?ç|×¥._4?ç|× ÊCã?ç|¨‰²íd?ç|¨…NÚâ?ç|ymïUl?ç|yi‹K¸?ç|JQãMû?ç|JMM?ç|5ŽÜ£?ç|1*ä?ç{ìòUÙ?ç{ìŽf‘?ç{¼ü Ò?ç{¼÷¨ì?ç{ÞßDú?ç{Ú{gP?ç{^Ái²¨?ç{^½ÝÍ?ç{/£«ÒR?ç{/ŸHF?ç{…¥Z®?ç{A—p?çzÑgW=à?çzÑbóƒr?çz¢H¿÷5?çz¢D\E–?çzs)á†?çzs%}m¶?çzD ºRˆ?çzDV²‡?çzëK?çzæç{è?çyåË“¬©?çyåÇ0G?çy¶«“Õ÷?çy¶§0Pe?çy‡‹Et›?çy‡†á÷Ø?çyXj¨m)?çyXfDù6?çy)IÂLã?çy)E^á¿?çxú(“h!?çxú$0Í?çxË°Ü?çx˹WW?çx›å]Žû?çx›àú>F?çxlÃU¹5?çxl¾òqO?çx=¡5?çx=œ¡ö?çx~l¥½?çxz ow?çwß[‹s?çwßW(E¤?çw°8a¢·?çw°3þ~?çwð&q?çw ›?çwQñ5+'?çwQìÒ"?çw"Í2ÝÌ?çw"ÈÏÓ–?çvó¨èÏ?çvó¤…j?çvÄ„T±¹?çvÄñ¹#?çv•_xÞ?çv•[îL?çvf:U£?çvf5ò˜®?çv7é`ï?çv7†‚Ë?çvï4‡?çvêѲ-?çuØÉ83Ý?çuØÄÕgY?çu©¢òáÑ?çu©ž?çuz|eÑÚ?çuzxø?çuKUl?çuKQ-¹ô?çu.rµÛ?çu* š?çtí ™?çtíªc)?çt½ß_ZÇ?çt½ÚüÃ'?çtŽ·i#|?çtŽ³”®?çt_+Oa?çt_ŠÈÉd?çt0f¥ãõ?çt0bCfÈ?çt=×]@?çt9tèä?çsÒÁJJ?çsÒ^ÞÀ?çs¢ëc/?çs¢ç°u?çssÁ¼½z?çss½Zc’?çsD—Î]?çsD“lLF?çsm™?çsi6¾Ã?çræCv¤?çræ>¸7/?çr·Sݾ?çr·ñ§?çr‡íEß2?çr‡èã±a?çrXÁïEÚ?çrX½ Ú?çr)–QQä?çr)‘ï5µ?çqújkk?çqúf X"?çqË>=˜5?çqË9Ûª?çqœÇ݈?çqœ eÛÏ?çqlå £?çqlਖ»?çq=¸È$?çq=³¢Ø?çqŠ·xv?çq†U‘2?çpß]"¦?çpßXÀÇ©?çp°/Ej¼?çp°*ã•?çp ·¹?çp€ü¾êê?çpQÒ´Cü?çpQÎR€?çp"£ÿwÏ?çp"Ÿ¼¥?çoóu“(?çoóp¡àÐ?çoÄEÀLí?çoÄA^£h?ço•4p?çYüÇçX?çYÍ{Á²?çYÍwd#ª?çYž*ø4\?çYž&š®ß?çYnÙç‘x?çYnÕŠÓ?çY?ˆÔ?çY?„2©?çY6òx?çY2• ?çXàå ¾2?çXàà°\?çX±’âß?çX±Ž……À?çX‚@qC´?çX‚<óK?çXRí¸ñ¸?çXRé[ª'?çX#šº<€?çX#–\ýÈ?çWôGu)x?çWôCó™?çWÄóé!ì?çWÄï‹ôç?çW• Ç^?çW•›¹£1?çWfKþ6?çWfG¡â?çW6÷žàÐ?çW6óAÎV?çW¢øÃ?çWž›¹ï?çVØN û?çVØI°3?çV¨øÙÖP?çV¨ô|Þa?çVy£`Ã?çVyŸÔ?çVJM¡4­?çVJIDNr?çV÷•8?çVó84Ö?çUë¡?çSTË`Š?çSTÇ1ò?çS%pã³ ?çS%l‡cH?çRö [}?çRöÄ”?çRÆ»×*?çRƶº™?çR—_Æ”?çR—[jZ`?çRh0%ó?çRgÿÓù™?çR8¨SÊ?çR8£öàK?çR L/|`?çR GÓa¼?çQÙïÅ•?çQÙëiƒH?çQª“V?çQªŽ¸üg?çQ{6nS?çQ{1Ân??çQKØᇀ?çQKÔ…G?çQ{^V?çQwø?çPí”D?çPí8^?çP½¿„ï?çP½»(±G?çPŽa-³Ê?çPŽ\Ñßý?çP_ò}?çP^þ5'‹?çP/£®Oh?çP/ŸRQ?çPD„æD?çP@)-?çOÐåX.?çOÐ๧Í?çO¡…_ª|?çO¡÷?çOr%c”µ?çOr!ö ?çOBÅ!j ?çOBÀÅÔ;?çOd™/×?çO`=¢ä?çNäÊëv?çNãÿog^?çN´¢¶Tj?çN´žZÙ.?çN…A[½æ?çN…=K…?çNUߺßm?çNUÛ_uè?çN&}Ô 4?çN&yx«Š?çM÷¦û½?çM÷K£ï?çMǹ3e•?çMÇ´Ø£?çM˜Vyê¼?çM˜R¤¥?çMhózŠ?çMhïSP?çM95Œ?çM9‹ÙÚ.?çM ,ª¶?çM (NÚ4?çLÚÈØD.?çLÚÄ}!ˆ?çL«dÀ¸¶?çL«`ežì?çL|ch©?çL{üW»?çLL›À –?çLL—e„?çL6Ö¦Ö?çL2{§¡?çKíѧŒ?çKíÍL—3?çK¾l2)…?çK¾g×<?çKwim?çK„Ì?çK_ viM?çK_œ‰?çK0:/Ê?çK05Ô÷ ?çKÓ¢õv?çKÏH+k?çJÑlÐ>°?çJÑhu}‚?çJ¢¸F‘?çJ¢]Ž??çJržYÛv?çJr™ÿ,?çJC6¯šO?çJC2Tó¶?çJιz?çJÊ^z¿?çIäf|?çIäb!ˆ¯?çI´ýù˜?çI´ùŸ ?çI…•0VM?çI…ÕÓ(?çIV,!Fß?çIV'Æ̘?çI&ÂËÓ ?çI&¾qb6?çH÷Y0H?çH÷TÖ4º?çHÇïO©$?çHÇêõIs?çH˜…(a?çH˜€Î F?çHiºÊz?çHi`|„?çH9°8J?çH9«¬ó1?çH E ¯Ø?çH @³s?çGÚÙ΄!?çGÚÕtPÄ?çG«nI?çG«iîô•?çG|~!`?çG{þ#ÿ¾?çGL–mBž?çGL’)Ù?çG*ìÌ?çG%»Üå?çFí½xÀ?çFí¹¹†?çF¾P–^‡?çF¾L<`[?çFŽãm•^?çFŽß ?çF_uÿ´?çF_q¥D?çF0J´Õ?çF0ðÑC?çFšP È?çF•ö2?çEÑ,ûÍ?çEÑ'¶)÷?çE¡½Š9…?çE¡¹0p?çErN¾}¡?çErJd½‡?çEB߬Íp?çEBÛS4?çEpUÉ€?çEkü"?çDä¸ÛÛ?çDãü_6\?çD´Ö Ú?çD´Œ|m9?çD… ­¦a?çD…TŸ?çDU°?‡?çDU«å£?çD&?‹ Ô?çD&;1‡Ï?çCöΑv”?çCöÊ7ým?çCÇ]R|?çCÇXø©4?çC—ëÍEn?çC—çsÞ?çChzÿº?çChu©¡.?çC9ó?çC9™ªi?çC •™d?çC ‘DL–?çBÚ#Ðî?çBÚ©Œÿ?çBª°!u½?çBª«È:¬?çB{<ûø?çB{8¡ÞÇ?çBKÉZX?çBKÅ61?çBUÞW&?çBQ…6³?çAìáç¿$?çAìÝŽ§?çA½m«J?çA½iR;]?çAù)˜V?çAôÐ’?çA^„ba°?çA^€ d¹?çA/U«q?çA/ ü·Z?ç@ÿšzã?ç@ÿ•ª«?ç@Ð$lp_?ç@Ð Ž?ç@ ®¨¢?ç@ ª6Ï(?ç@q8mvx?ç@q4¥Þ?ç@AÂ,¹?ç@A½­dþ?ç@KYƒ(?ç@GÄM?ç?âÔg?ç?âÐÉ?ç?³]/ØG?ç?³X×++?ç?ƒå³|Ž?ç?ƒáZØR?ç?Tmñˆ¸?ç?Ti˜í\?ç?$õê?ç?$ñ‘o•?ç>õ}Ö_?ç>õyELÃ?ç>Æ ‡~?ç>ƳÁ?ç>–Œ46?ç>–‡Û‹Z?ç>g²|?ç>g¹C€?ç>7™£¬?ç>7•K)?ç>ð2w?ç>—Õ;?ç=Ø¥ö·¼?ç=Ø¡žca?ç=©+¸ ?ç=©'_Á£?ç=y±3œø?ç=y¬ÛZ]?ç=J6jo?ç=J2Í´?ç=»Z¶ß?ç=·†?ç<ë@Ko?ç<ë;®#u?ç<»Äl/z?ç<»Àa?ç<ŒHŒµ¶?ç<ŒD4Ÿ}?ç<\Ìgãc?ç<\ÈÖ ?ç<-OýpT?ç<-K¥kÜ?ç;ýÓM¯8?ç;ýÎõ³¡?ç;ÎVX¥R?ç;ÎR²›?ç;žÙWÝ?ç;žÔÆn?ç;o[ž1M?ç;oWFPX?ç;?ÝÙ?ç;?ÙG?ç;_ÎÙ?ç;[w ê?ç:àá1?ç:àÝ'Pß?ç:±béÞ˜?ç:±^’!'?ç:ä÷?ç:ß·Íh?ç:Rdð?ç:R`˜Zß?ç:"å‹$:?ç:"á3l?ç9óeá-ž?ç9óa‰“²?ç9Ãåñ??ç9Ãá™ü4?ç9”e¼ã?ç9”aeZî?ç9dåCÂ?ç9dàìz?ç95d„†n?ç95`-?ç9】?ç9ß)#Œ?ç8Öb7Y“?ç8Ö]ßôï?ç8¦à©2‰?ç8¦ÜQÖÇ?ç8w^Õ†ˆ?ç8wZ~3¨?ç8GܽBÐ?ç8GØeøÒ?ç8Z_Ñø?ç8VÜ?ç7è×½9>?ç7èÓf?ç7¹TÕ}å?ç7¹P~NŒ?ç7‰Ñ¨¥*?ç7‰ÍQ~³?ç7ZN6g?ç7ZIßIk?ç7*Êýè?ç7*Æ(é5?ç6ûF„9Þ?ç6ûB-. ?ç6ËÂCºÀ?ç6˽ì·Ñ?ç6œ=¾…Í?ç6œ9g‹À?ç6l¸ók?ç6l´œyê?ç6=3ä?š?ç6=/WR?ç6 ® º?ç6 ª9AT?ç5Þ(öÆn?ç5Þ$Ÿïë?ç5®£5ø?ç5®žÁhW?ç5õ\k?ç5ž—­?ç5O–¤x?ç5O’6èœ?ç5 àÆ?ç5 Š?ç4ðˆïa?ç4ð„˜¶ü?ç4Á¹-c?ç4ÀýbŒ/?ç4‘z>0J?ç4‘uç—ù?ç4aò~¼B?ç4aî(,Ô?ç42jy¡?ç42f#?ç4â0p?ç4ÝÙœÇ?ç3ÓY¢yX?ç3ÓUL’?ç3£ÐÏA[?ç3£ÌxÕx?ç3tG·¬§?ç3tCaI§?ç3D¾[s=?ç3Dº ?ç34ºç–?ç30d–\?ç2åªÕtz?ç2å¦,$?ç2¶ «¹˜?ç2¶Uz%?ç2†–6j4?ç2†‘à3¤?ç2W v£?ç2W oö?ç2'€r8E?ç2'|{?ç1÷õ( ‰?ç1÷ðÑî£?ç1Èi™››?ç1ÈeCˆ˜?ç1˜ÝÆVJ?ç1˜ÙpL+?ç1iQ­¥l?ç1iMW¤0?ç19ÅP(–?ç19Àú0??ç1 8®2'?ç1 4XB³?ç0Ú«Æ’¡?ç0Ú§p¬?ç0«šÑ?ç0«Dóc?ç0{‘*XR?ç0{ŒÔƒ‰?ç0Ltàq?ç0KÿŒ?ç0uz»Ç?ç0q$øÆ?ç/ìç;¢d?ç/ìâåèG?ç/½X·æ ?ç/½Tb5g?ç/Éîód?ç/Å™K?ç/^:áµS?ç/^6Œâ?ç/.«J3?ç/.§9³¦?ç.ÿøžŸ?ç.ÿ£÷?ç.ÏŒj¦?ç.χÇåâ?ç.Ÿûýf]?ç.Ÿ÷§ê}?ç.pk˜–ù?ç.pgC#þ?ç.@ÚïNÄ?ç.@Ö™ä­?ç.J«¢?ç.E«Jp?ç-á¸Î4P?ç-á´xÜ?ç-²'W¬?ç-²#·C?ç-‚•šÚÔ?ç-‚‘E”O?ç-SšP*?ç-RÿE‹?ç-#qU¸ö?ç-#m„;?ç,óÞÌ3%?ç,óÚwO?ç,ÄKýÃï?ç,ÄG¨ ý?ç,”¸ëWÀ?ç,”´–=´?ç,e%” “?ç,e!>ûk?ç,5‘øÀ?ç,5£y}?ç,þ"P?ç,ùÃ"ó?ç+Öió@’?ç+ÖežJ?ç+¦ÕŠ.¾?ç+¦Ñ5A*?ç+w@Üò?ç+w<ˆ W?ç+G«ê¨z?ç+G§•Ì±?ç+´‹v?ç+_¸’?ç*è:S ?ç*è|å‰!?ç*¸ëzІ?ç*¸ç&m?ç*‰UwŠ?ç*‰Q"ÑÔ?ç*Y¿/êÁ?ç*YºÛ;s?ç**(£]ß?ç**$N·w?ç)ú‘ÒÏ¡?ç)ú~2?ç)Êú¾’8?ç)Êöiý›?ç)›ceÃÌ?ç)›_8?ç)kËÈ?ç)kÇs™¾?ç)<3æÕ¸?ç)ì?ç'¿fð 0?ç'ÐýŽ$?ç'Ì©dO?ç'`6rŠ±?ç'`2iÁ?ç'0›£†¸?ç'0—On¯?ç'‡i?ç'üÃ?ç&¡É˜[W?ç&¡ÅD^?ç&r-­Æ?ç&r)YW?ç&B‘}7‡?ç&B)Kþ?ç&õ ±?ç&ðµ9?ç%ãXPw|?ç%ãSüÁ?ç%³»SP?ç%³¶ÿ=?ç%„Dn?ç%„¾|€?ç%T€Œ¿ß?ç%T|9Ø?ç%$âÂÇŽ?ç%$Þon?ç$õDµGY?ç$õ@aš ?ç$ŦcÆ?ç$Å¢lt?ç$–Ì(þ?ç$–x“?ç$fhñȾ?ç$fdž6:?ç$6ÉÒÁ—?ç$6Å7ú?ç$*oe—?ç$&äâ?ç#׊ÈÂ?ç#׆tŽó?ç#§êÜ÷?ç#§æ‰ˆ8?ç#xJ­U2?ç#xFYï2?ç#Hª9s?ç#H¥æì?ç# ¢”?ç#.Nd?ç"éh…œ/?ç"éd2På?ç"¹ÇE±Ô?ç"¹Âòor?ç"Š%Á›Ì?ç"Š!nbQ?ç"Zƒù_=?ç"Z¦.ª?ç"*áíN$?ç"*Ýš&y?ç!û?œÓû?ç!û;Iµ7?ç!Ë•?ç!˘µyº?ç!›ú09È?烴0õÍ?çT“$1?çT @ä ?ç$f_&U?ç$b ï-?çô¼çãÌ?çô¸•µŒ?çÅ,ÈG?çÅÚ¢ð?ç•i-Øê?ç•dÛ¼}?çe¾ë´J?çeº™ Æ?ç6eyb?ç6nÈ?çiœ`/?çeJ^~?çÖ¾‡³?çÖº=Žê?ç§>õ?ç§í3?çwgªú#?çwcY.?çG»Óœ?çG·½ü?縓1?ç f¾?çècZ1t?çè_e?çy8±à?çyèÙ?çIKÍe?çIG}•,?çˆð?ç‹ÏÁú?çéÔ.‰º?çéÏÞ˱?çºú¸ò?纫Õ?çŠ[„©?çŠW4oy?çZžÊ?çZšzzÛ?ç*áÍ^A?ç*Ý}Ãê?çû$á"?çû >O¹?çËg>?çËb¶Á?盩4ã,?盤åcœ?çkë ”;?çkæј?ç<,É@D?ç<(yÒŽ?ç n.ìW?ç i߇Ž?ç ܯQQ?ç Ü«õ8?ç ¬ð0sŠ?ç ¬ëá ›?ç }0ÌXÆ?ç },}Ä?ç Mq%ž˜?ç MlÖ]„?ç ±;‚?ç ¬ëà[?ç íñ ý?ç íì¾ÍÜ?ç ¾0žþ?ç ¾,NÞ²?ç Žo꜄?ç Žk›%?ç ^®ôaq?ç ^ª¥M?ç .í»XÏ?ç .élMK?ç ÿ,?;N?ç ÿ'ð8·?ç ÏjÁž?ç Ïf0Çõ?ç Ÿ¨}‰{?ç Ÿ¤.˜¿?ç oæ7ÿD?ç oáéw?ç @#¯À²?ç @`áÒ?ç `å#?ç \–I1?ç àÖîJ?ç à™ˆ!F?ç °Ú†4?ç °Ö7T?ç ò¡ä?ç £æ¼?ç QS«r?ç QNÌù7?ç !k0?ç !Š³Áä?ç ñʦM?ç ñÆW­#?ç  #?ç ¸s³?ç ’A%A½?ç ’<Ö³;?ç b|ª ?ç bw²$z?ç 2¶˜üÎ?ç 2²J€(?ç ðî×¢?ç ì cë?çÓ+??çÓ&³ÔÆ?ç£dÒ¡?ç£`„?5?çsž`™¹?çsš@Í?çC׫– ?çCÓ]F ?ç³NÈ?ç e¹?çäIx­Ï?çäE*o¯?ç´üf?ç´}­Ï5?焺<&?焵íúJ?çTò9±Î?çTíëŽ{?ç%)ô÷v?ç%%¦Ý?çõamÐ?çõ]Z?çŘ¢°`?çÅ”T§Ù?ç•Ï–s?ç•ËHÛ?çfFª?çfø³ç?ç6<µ:?ç68g(€?çrá>?çn“)s?ç֨ɲø?çÖ¤{×?ç¦Þp:Y?ç¦Ú"gm?çwÔõ›?çw‡+ž?çGHöl´?çGD¨«¦?ç}ÕÕˆ?çyˆj?çç²rèå?çç®%9¶?ç·æÌÇ>?ç·â þ?çˆä¦h?爗 ?çXNº‹f?çXJl÷?ç(‚MJ?ç(}ÿ¿?çøµže®?çø±Pã-?çÈè¬ýh?çÈä_ƒ×?ç™yµ?ç™+¦?çiNÌ?çiIµ›?ç9€JƵ?ç9{ýgó?ç ²PK?ç ®Åy?çÙä Nœ?çÙßÀº?窂Žj?çª5Jx?çzF´ÇV?çzBgŒT?çJw¥.ò?çJsWüà?ç¨R™©?ç¤p‡?çêؽX ?çêÔp8n?ç»åpÔ?绘Y“?ç‹8ˉ?ç‹4~q7?ç[hnñu?ç[d!ì?ç+—ÏË™?ç+“‚Ï)?çûÆî_?çû¡k“?çËõÊ¢?çËñ}.?çœ$c•?çœ ³â?çlR»&Æ?çlNnN?ç<€Ï¡?ç<|‚ÑH?ç ®¡¡r?ç ªTÚ¥?æÿÜÜ1y?æÿÜ×ä»B?æÿ­ - ?æÿ­2x?æÿ}6Š*?æÿ}2=~ ?æÿMcSYJ?æÿM_¶@?æÿÙ†?æÿ‹Œõm?æþí¼?æþí·Ñpß?æþ½èÑ?æþ½ãÓIY?æþŽßO.?æþŽ’Ïé?æþ^?\ß?æþ^; Š?æþ.j—´´?æþ.fKGP?æýþ•{?æýþ‘Cª ?æýÎÀFv]?æýλúÜ?æýžêºñQ?æýžænžÁ?æýoí8K?æýo î­?æý?>Ý:?æý?:Ã?æýhŠò0?æýd>ºu?æüß‘öo?æüߪ@Q?æü¯»Ëø?æü¯¶Ó¦ ?æüäYÒ?æüß»<ë?æüP ¬…’?æüP`q?æü 5 ??æü 0Õ;?æûð]0®Ó?æûðXä¬Á?æûÀ…jH?æûÀ€Ãq(?æû¬¬ož?æû¨`p?æû`Ô+Î?æû`Ï»D’?æû0û ;Ô?æû0öÔ]Š?æû!÷ ¬?æû«7T?æúÑHŒ‡J?æúÑD@ºä?æú¡nß4½?æú¡j“qI?æúq”ðIî?æúq¤l?æúAº¿ËÕ?æúA¶tE?æúàL?æúÜæï?æùâ—}ü?æùâKÞQ?æù²* è?æù²&UQY?æù‚Oh†Ò?æù‚Kù ?æùRsî_6?æùRo¢Úb?æù"˜2*D?æù"“æ®b?æøò¼3¡ ?æøò·è.?æøÂßó¬[?æøÂÛ¨B_?æø“q¹L?æø’ÿ&XC?æøc&®d´?æøc"c ?æø3I¨ÏÅ?æø3E]€¡?æøla—X?æøhQ'?æ÷ÓŽØtz?æ÷ÓŠ7;?æ÷£± ¸?æ÷£¬ÂƒÂ?æ÷sÓ(?æ÷sεïÏ?æ÷Cô²îª?æ÷CðgÌD?æ÷#7?æ÷Ø?æöä7L\´?æöä3L3?æö´X-§¸?æö´Sâ +?æö„xÌÒ)?æö„tÓ?æöT™*xº?æöT”߃?æö$¹E¼·?æö$´úÐ?æõôÙ†²?æõôÔÔ¢ò?æõÄø·CÜ?æõÄôli?æõ• aj?æõ•Á?æõe7 _¦?æõe2Õ–À?æõ5Uò?æõ5Q§T?æõt‚4?æõp7d5?æôÕ’Ð.H?æôÕŽ…€ó^?æó†_¿fÖ?æó†[t÷u?æóV{þÖ¼?æóVw´pO?æó&—üÊÎ?æó&“²mU?æòö³¸ü'?æòö¯n§£?æòÆÏ3oº?æòÆÊé$*?æò–êlvA?æò–æ"3¤?æògcÈá?æòg8?æò7 Ôï?æò7Τ;?æò:Œ‚À?æò6B[?æñ×T¿nØ?æñ×PuP ?æñ§n¯×e?æñ§jeÁŽ?æñwˆ^Xò?æñw„L?æñG¡Ëþ?æñGŒ?æñº÷5®?æñ¶­:´?æðçÓá.?æðçÏ—)?æð·ì‰àº?æð·è?÷ª?æðˆðïñ?æðˆ§Õ?æðX‹?æðX̪e?æð(4úšt?æð(0°ÌB?æïøL?š?æïøHSz\?æïÈcþ*,?æïÈ_´mä?æï˜{ªÝ?æï˜vÓ÷Š?æïh‘ûzÚ?æïh±Ð|?æï8¨˜6Œ?æï8¤N•#?æï¾óâÞ?æﺪJi?æîØÕ ¡’?æîØÐÄ?æî¨êæZÀ?æî¨æœÔ6?æîy}Çž?æîxü4J ?æîIÓ¡b?æîIŠ,Ã?æî*èÙ?æî&ž§/?æíé?»’|?æíé;r/Ç?æí¹TMgø?æí¹P8?æí‰hãò?æí‰dT“(?æíY|­W?æíYxd1?æí){.Â?æí)Œ1ïä?æìù¤»Ä?æìùŸ¾…Û?æìÉ·SšX?æìɳ md?æì™Ê]zÜ?æì™ÆVÞ?æìiÝ&ñ?æìiØÝuè?æì9ï®J.?æì9ëe8?æì ô«ƒ?æì ý«¢f?æëÚú…?æëÚ±^?æëª%¾]"?æëª!ueñ?æëz7A·D?æëz2øÉ ?æëJHƒó?æëJD; À?æëY„É­?æëU;í^?æêêj?,E?æêêeöXì?æêºz²°j?æêºviæ?æꊊäø7?æꊆœ6Ê?æêZšÕ—?æêZ–ŒÞ¢?æê*ª„Ýœ?æê*¦<.?æéú¹óB ?æéúµª›‚?æéÊÉÀ ?æéÊÄ×#?æéšØ N?æéšÓ†±?æéjæµVó?æéjâlËM?æé:õá??æé:ðÕ^?æé E0{?æé þü¶Â?æèÛ+•%?æèÛ ã$c?æè«Ð|ï?æ諈$?æè{,4‡?æè{'ë³³?æèK9VÌ2?æèK5vT?æèF8©?æèAïÊÂ?æçëRØ–?æçëNÛ¦?æç»_7ª?æç»ZîÓ±?æç‹kTÃü?æç‹g ‘ú?æç[w1Do?æç[réc?æç+‚̺²?æç+~„šž?ææûŽ&à?ææû‰ÞÈø?ææË™@ ?ææË”÷öã?æ曤T8?æ曟ÐO ?ææk®¯;h?æækªg?1?ææ;¹0Ð?ææ;´½=?ææ Ã_?ææ ¾ÒtÏ?æåÛÌíœû?æåÛÈ¥»ª?æå«Ö€´“?æå«Ò8Ü:?æå{ßÒ¢_?æå{ÛŠÒý?æåKèãÁ?æåKä›YW?æåñ²¢ä?æåíjåq?æäëúAVn?æäëõù¡ò?æ伎Íú?æä»þG"v?æäŒ ›Ë/?æäŒT(£?æä\hi?æä\ mÕ?æä,òÊÏ?æä,«:3?æãü!<×?æãüõO\?æãÌ(F0Û?æãÌ#þ²/?æãœ/·‚?æãœ*ÇAÎ?æãl5•þ ?æãl1N‘ã?æã<;ÜÇÊ?æã<7•d?æã Aâ5q?æã =šÚ¥?æâÜG§.æ?æâÜC_Ý?æâ¬M+“J?æâ¬HäJo?æâ|RnöJ?æâ|N'¶f?æâLWq¨@?æâLS*qU?æâ\3ÓÄ?æâWì¥Ñ?æáì`´æÔ?æáì\mÁÚ?æá¼dõ}0?æá¼`®a/?æáŒhõPN?æáŒd®=D?æá\l´e?æá\hmZ÷?æá,p2åû?æá,këäã?æàüsp²N?æàüo)º.?æàÌvmÎä?æàÌr&ß½?æàœy*å?æàœtã4·?æàl{¦ V?æàlw_/!?æà<}á=?æàà ?æÚ<:šë?æÚ 8¼\.?æÚ 4v° ?æÙÜ2Wë ?æÙÜ.HŒ?æÙ¬+³-„?æÙ¬'m“k?æÙ|$Í+?æÙ| ‡ÿ ?æÙL§Ô–?æÙLbLr?æÙAŽ´?æÙüŠ?æØìš·?æØì U'ˆ?æؼ³w]?æؼn )?æØ‹þŒk¶?æØ‹úG}?æØ[ö$x8?æØ[ñßú?æØ+í|ƒv?æØ+é712?æ×ûä”G?æ×ûàNý»?æ×ËÛk|z?æ×Ë×&<,?æ×›Ò™‰?æכͽb6?æ×kÈYÈŸ?æ×kÄšH?æ×;¾px?æ×;º+R¾?æ× ´F¬Ö?æ× °u?æÖ۩ܶÚ?æÖÛ¥—£t?æÖ«Ÿ2OË?æÖ«šíE`?æÖ{”H^?æÖ{\¦?æÖK‰*Š?æÖK„Ù2?æÖ}³#˜?æÖyn4?æÕër/®?æÕëmÃI0?æÕ»fžÎ?æÕ»aØÁL?æÕ‹Yòn¢?æÕ‹U­š?æÕ[M‡_ô?æÕ[IB”i?æÕ+@Üw—?æÕ+<—µ?æÔû3ðþn?æÔû/¬DÚ?æÔË&ŵ8?æÔË"¡?æÔ›ZÆa?æÔ›Å?æÔk ¯/¨?æÔkj‘?æÔ:ýÃüñ?æÔ:ùgL?æÔ ï˜ÂP?æÔ ëT5¨?æÓÚá-9r?æÓÚÜèµÆ?æÓªÒ×è?æÓªÎ=]7?æÓzÖ¢€?æÓz¿R0Ë?æÓJ´jâ5?æÓJ°&y}?æÓ¤ÿÈh?æÓ »h¬?æÒê•O”‡?æÒê‘ =Æ?æÒº…Y¶ã?æÒºi?æÒŠu#Èö?æÒŠpß„.?æÒZd­©ý?æÒZ`in1?æÒ*Söî?æÒ*O²»B?æÑúC0¼i?æÑÊ1ÉšÐ?æÑÊ-…yú?æÑš Rœ`?æÑš„‡?æÑj›9¼?æÑj W*ß?æÑ9ü¤ Ü?æÑ9ø`û?æÑ êlaÎ?æÑ æ(dê?æÐÙ×ôö?æÐÙÓ±/?æЩÅ=„f?æЩÀù™|?æÐy²EÆp?æÐy®äƒ?æÐIŸW)?æÐIšÊ~8?æЋ—Ì?æЇSEÙ?æÏéwßKw?æÏés›„€?æϹcç“?æϹ_£Õ?æωO°ô?æωKla÷?æÏY;8EÃ?æÏY6ô™Ã?æÏ)&€ßð?æÏ)"=<î?æÎù‰Ÿ0?æÎù F*?æÎÈüR=A?æÎÈø¬9?æΘæÚ¾í?æΘâ—6â?æÎhÑ#¿?æÎhÌà@?æÎ8»,Ñå?æÎ8¶é[Õ?æΤõ±-?æΠ²D?æÍØŽ@?æÍØŠ;¹+?æͨwÈ9Õ?æͨs„Þ¾?æÍx`ÑÇB?æÍx\Žu(?æÍHI›ÊM?æÍHEX1?æÍ2%A4?æÍ-â?æÌèo§Ì?æÌè,p«?æ̸z!Ó?æÌ·þ6ó¯?æ̇êDŽ˜?æ̇æis?æÌWÑÏ_?æÌWÍ‹ü7?æÌ'¹ò?æÌ'´ÖûÈ?æË÷ %œ’?æË÷›â’f?æËdžñ{ ?æËÇ‚®yÝ?æË—m}¯"?æË—i:¶ñ?æËgSÉò§?æËgO‡u?æË79Ö•\?æË75“¯(?æË£vŒ?æË`™V?æÊ×0šþ?æÊ×íÆÇ?æʦê~h?æʦæ;Ò.?æÊvÏŒìž?æÊvËJ*c?æÊF´[?æÊF°cÅ?æʘê2?æÊ”§cô?æÉæ}9fˆ?æÉæxö¿H?æɶaIÎ?æɶ]zŒ?æɆEUB?æɆ@Ö¿ÿ?æÉV(ªk—?æÉV$gßR?æÉ& ûÊ·?æÉ&¹Gq?æÈõï ÂV?æÈõêËH?æÈÅÑàW:?æÈÅÍåñ?æÈ•´røS?æÈ•°0 ?æÈe–Æe¶?æÈe’„l?æÈ5xÚY>?æÈ5t˜ò?æÈZ®×¯?æÈVlŠb?æÇÕRç?æÆ„`O­Ö?æÆ„\ ¨?æÆT?Þ¢?æÆT;œ¥º?æÆ$-ýÌ?æÆ$ì v?æÅóþ>§?æÅóùü&Q?æÅÃÝ”?æÅÃØ̳*?æÅ“»ŸC:?æÅ“·]jã?æÅc™ñ'Š?æÅc•¯X2?æÅ3xõY?æÅ3sÁ/?æÅUÕG?æÅQ“‰Â?æÄÓ3h!‰?æÄÓ/&m0?æÄ£»‰_?æÄ£ yÞ?æÄríϨÄ?æÄréŽk?æÄBʤ_?æÄBÆbÅ­?æħ9f?æÄ¢÷Õ½?æÃ⃎è?æÃâM`¼?æò_¥¤Ë?æò[d&q?æÂ;|u®?æÂ7;U?æÃRªP?æÃRÒ=ö?æÃ!òk’=?æÃ!î*.ã?æÂñÍ„ È?æÂñÉB²o?æÂÁ¨]ŽÞ?æÂÁ¤=…?æ‘‚÷Òn?æ‘~¶Š?æÂa]Rl?æÂaY,«?æÂ17mõï?æÂ13,¿–?æÂJtë?æ G“?æÁÐêç ^?æÁÐæ¥é?æÁ ÄD¤V?æÁ Àˆÿ?æÁpccî?æÁp™"Q˜?æÁ@vBp˜?æÁ@rgB?æÁNâd–?æÁJ¡dA?æÀà'C@?æÀà#'ì?æÀ¯ÿdÊ°?æÀ¯û#Ü]?æÀ×Gk¤?æÀÓ†P?æÀO®ê¼?æÀOª©ßÂ?æÀ†NÀÀ?æÀ‚ ín?æ¿ï]sÉ?æ¿ïY2þË?æ¿¿4Y´†?æ¿¿0ó6?æ¿ =?æ¿¿„±?æ¿^áh"?æ¿^Ý'rÄ?æ¿.·Ó?æ¿.³P,·?æ¾þz/8?æ¾þ‰9‘í?æ¾Îc$ö0?æ¾Î^äaæ?澞8—8?澞4P ï?æ¾n ½-?æ¼¼|ýßó?漌Sõ²?漌O´Ûy?æ¼\&my?æ¼\"-YË?æ¼+ø¦à€?æ¼+ôfÊK?æ»ûÊ¡®å?æ»ûÆa¡²?æ»Ëœ]ž??æ»Ë˜š?æ»›mÚ³K?æ»›iš¸?æ»k?òÀ?æ»k:Ù’?æ»;†ª?æ»; Ø~?æ» àÙÏ?æ» Ü™#¥?æºÚ±U¹ü?æºÚ­âÔ?溪ŽÔ«?溪}O†?æºzQˆ•'?æºzMHÐ?æºJ!Cº¨?æºJþˆ?æºð¿Ùñ?æºì€&Ó?æ¹é¿ü­?æ¹é»½þ?æ¹¹Žú¨»?æ¹¹Š»¢?湉]¹Ñ„?湉Yz9m?æ¹Y,9–ð?æ¹Y'úÛ?æ¹(úz¸1?æ¹(ö;2?æ¸øÈ|ï[?æ¸øÄ=rL?æ¸È–?ÑB?æ¸È’]6?渘cÄ?渘_„±ý?æ¸h1 ×Z?æ¸h,ÊuS?æ¸7þJx?æ¸7ùÐñs?æ¸ÊØ5€?æ¸Ƙå~?æ·×—a-H?æ·×“!æJ?æ·§c«6?æ·§_køƒ?æ·w/¶UÕ?æ·w+w Ü?æ·FûƒJ[?æ·F÷De?æ·ÇÉB?æ·ÂѦO?æ¶æ’_Ü*?æ¶æŽ Â;?涶]p=1?涶Y1,E?涆(A¦€?涆$ž—?æ¶UòÔ±Ö?æ¶Uð?æ¶%½(ÎÐ?æ¶%¸éØí?æµõ‡>'b?æµõ‚ÿ:ƒ?æµÅQå|?æµÅLÖ ?浕­XT?浕n}{?æµdä¥ ?æµdßÇÓ4?æµ4­!Š•?æµ4¨âÁÄ?æµuþ £?æµq¿MÕ?æ´Ô>›Þ?æ´Ô:\ç?æ´¤úŠx?æ´¤»Ü²?æ´sÏ"?æ´sÊÜ}Ú?æ´C–ý {?æ´C’¾„»?æ´^ ˆÂ?æ´Zaö?æ³ã&…\?æ³ã!Æû¤?æ³²í+Ð{?æ³²èíOÇ?泂´¹K?泂¯ÕA›?æ³Rz¼ùü?æ³Rv~‹P?æ³"A'—@?æ³"<é1˜?æ²òTx?æ²ò¨Ô?æ²ÁÍB$?æ²ÁÉÐt?沑’ñbÔ?沑Ž³8?æ²aXb¥È?æ²aT$d0?æ²1•\°?æ²1W$?æ²â‰Ö°?æ²ÞK§!?æ±Ð§?^Z?æ±Ð£7Ð?æ± k¶×¬?æ± gxº&?æ±p/ïüã?æ±p+±èa?æ±?óêˆ@?æ±?ï¬|Ã?æ±·§K?æ±³iÒ?æ°ß{%3 ?æ°ßvç9–?æ°¯>e6˜?æ°¯:'F)?æ°fýh?æ°~ý)ý?æ°NÄ*Œ?æ°N¿ì>&?æ°†¯P?æ°‚q2î?æ¯îHö4÷?æ¯îD¸h›?毾 þ¢È?毾Àßp?æ¯ÌÉZÒ?æ¯È‹ ?æ¯]ŽU§Ä?æ¯]Šöv?æ¯-O£ŽO?æ¯-Keæ?æ®ý³‚±?æ®ý uãm?æ®ÌÑ€¡n?æ®ÌÍC /?殜’ b?殜̄(?æ®lRU¥?æ®lN~p?æ®<aÄ3?æ®<$I?æ® Ò0U?æ® Íòž+?æ­Û‘¿ë®?æ­Û‚‚‰?æ­«Q€ ?æ­«LÔë?æ­{$b?æ­{ ç u?æ­JÎùQ¹?æ­Jʼ¤?æ­â¤?æ­‰R•?æ¬êKçôÌ?æ¬êGª¸Â?欺 üT?欺ÄÉP?欉Çݳˆ?欉à‰‰?æ¬Y…zŠc?æ¬Y=ij?æ¬)BÙd‡?æ¬)>œL“?æ«øÿú!j?æ«øû½}?æ«È¼Ü1 ?æ«È¸Ÿ+%?櫘y€,³?櫘uC/Ñ?æ«h5æcP?æ«h1©ot?æ«7ò ú˜?æ«7íÑÂ?æ«­÷Ö?æ«©ºôF?æª×i£eÑ?æª×ef?檧%‰G?檧 Ó¹ƒ?æªvà?Ù±?æªvÜô?æªF›1d?æªF–ôS¬?æªUãÅ™?æªQ§è?æ©æX€?æ©æ ãÕ?橵Ês¼?橵ÆRÑ?æ©…„ˆ‚?æ©…€Kmä?æ©U>B™¾?æ©U: %?æ©$÷¿T1?æ©$ó‚ÌŸ?æ¨ô°þX?æ¨ô¬Á—Í?æ¨Äiþ¿µ?æ¨ÄeÂJ0?樔"ÁŸ+?樔…2­?æ¨cÛEÚœ?æ¨c× w%?æ¨3“ŒŸ¨?æ¨3PE7?æ¨K•^n?æ¨GY ?æ§Ó`•?æ§Òÿ#Ó2?槢ºìÛ¼?槢¶°œ_?æ§rr;íº?æ§rmÿ·d?æ§B)Lœª?æ§B%o[?æ§à¦¶?æ§Ûã‚o?æ¦á–´ëb?æ¦á’xÐ!?榱M ÿþ?榱HÏíÄ?æ¦%}˜?榀þéte?æ¦P¹C±?æ¦P´ÅC…?æ¦ nžç¡?æ¦ jbð|?æ¥ð#ÿLœ?æ¥ðÃ^?楿Ù!âà?楿ÔåýÊ?楎?Ä?楉Êcµ?æ¥_B­!`?æ¥_>qNX?æ¥.÷g²,?梊»z'Y?梊·>ÛÅ?æ¢Zl<}¯?æ¢Zh;#?æ¢*Àz#?æ¢*…@Ÿ?æ¡ùÍÿ¢?æ¡ùÈËÏ&?æ¡É}È­?æ¡ÉxÔ¡:?æ¡™,Ú´Æ?æ¡™(Ÿ–[?æ¡hÜgȈ?æ¡hØ,³&?æ¡8‹·-’?æ¡8‡|!8?æ¡:Èžh?æ¡6›?æ ×霳Ë?æ ×åa¹?æ §˜31?æ §“øð?æ wF‹¶8?æ wBPÍÿ?æ Fô¦¬l?æ FðkÍ?最XëÃ?æœPKüm?æœPÚû?朮@¢?朩ã(:?æ›ïV±1r?æ›ïRw"?曾ÿÓr?曾úÍÍ?曎§!+5?曎¢ç-ê?æ›^NýbN?æ›^JÃn ?æ›-öœ3S?æ›-òbH?æšýþÎ?æšý™Ä/ ?æšÍE!ÿq?æšÍ@è&L?æšœìÞ¶?æšœçÏ›?æšl’²´4?æšlŽxí$?æš<9Ë•?æš<4å ?æš ßMâV?æš Û-Z?æ™Û…?ý?æ™ÛQ?晫*ôŒR?晫&ºéj?æ™zÐl¿?æ™zÌ2iá?æ™Ju¦ÖÂ?æ™JqmEî?晣â3?æ™jZi?æ˜é¿c¾†?æ˜é»*?Ç?昹cæß0?昹_­i|?昉,k?昉òþV?æ˜X¬5iB?æ˜X§ü¢?æ˜(Po£?æ˜(KÈ ?æ—÷óÉô?æ—÷ïVxi?æ—Ç–á5Ž?æ—Ç’§í?æ——9öé?æ——5¼Át?æ—fÜÍœÊ?æ—fØ”f_?æ—6h2·?æ—6{/W?æ—!Åì7?æ—ŒÇá?æ–ÕÃæƒó?æ–Õ¿­h©?æ–¥eÅD“?æ–¥aŒ2S?æ–ub3È?æ–u)*“?æ–D¨ÁÁŸ?æ–D¤ˆÁu?æ–Iä‘?æ–E« r?æ•ãêÉ>?æ•ãæ'*?敳‹pš??敳‡7µ6?敃+Úõ?敃'¢?æ•R̽½?æ•RÇÏêË?æ•"kùo?æ•"gÀQˆ?æ”ò ¬7Ž?æ”òsv²?æ”Á«"ªU?æ”Á¦éò„?攑J[¿¯?攑F#ê?æ”`éW|,?æ”`åÖr?æ”0ˆœæ?æ”0ƒÞ7?æ”&—ÿ?æ”"_ku?æ“ÏÄÜóƒ?æ“ÏÀ¤hë?æ“Ÿbä¡5?æ“Ÿ^¬©?æ“o¯ ¾?æ“nüv”=?æ“>ž<ÎD?æ“>š^Ï?æ“; ƒ?æ“7U:?æ’ÝØ ôb?æ’ÝÔh—?æ’­uwb ?æ’­q? »?æ’}7Ô?æ’} ØìŽ?æ’L®mœà?æ’Lª5Z§?æ’J—þ?æ’FU^Ð?æ‘ëæpš$?æ‘ëâ8j?æ‘»‚^?æ‘»}Þ6ù?æ‘‹2?æ‘‹G ?æ‘Z¸«?¡?æ‘Z´s*£?æ‘*SšfV?æ‘*ObZe?æùîLª¿?æùê§Ù?æɈÂe?æÉ„ŠŒ?æ™"úè‘?æ™Â÷Ä?æh¼öÆ'?æh¸¾Þf?æ8Vµ®´?æ8R}Ð?æð7ð|?æìÔ?æ׉}FJ?æ×…Ey¯?æ§"†m?æ§N©s?æv»Rg?æv·¬?æFS᧞?æFO©ö(?æì4|ç?æçüÔ}?æŽå„J3&?æŽå€“Ê?掵#ž?掵ë‚N?掄³¿ÅF?掄¯ˆ8?æŽTKª2?æŽTFè%ü?æŽ#âC¤?æŽ#Þ š{?æóy* ?æótòš?æÃÓþÄ?æà œ•µ?æ’¦A;Î?æ’¢ ÛË?æb|?æ‹®y…fÏ?æ‹®uNaQ?æ‹~ Yõ?æ‹~ "„?æ‹M ðŽQ?æ‹Mœ¹šî?æ‹4Kžë?æ‹0´•?æŠìÇiÊÓ?æŠìÃ2é‹?押ZKó?押VF?抋ìíUg?抋趆:?æŠ[Lôd?æŠ[{.F?æŠ+p,ï?æŠ+ 9oÞ?æ‰ú£V¹å?æ‰úŸ â?æ‰Ê5V%?æ‰Ê0É«/?扙Æm™k?扙Â6÷„?æ‰iWžˆ2?æ‰iSgïY?æ‰8è’%V?æ‰8ä[•Š?æ‰yIv÷?æ‰uð:?æˆØ Ä?æˆØŽá?戧š‘ž?戧•Ìý?æˆw*c¡?æˆw%Íø?æˆF¹Éü?æˆFµ“™Œ?æˆIR§p?æˆEMù?æ‡åØž³Ù?æ‡åÔhcq?懵g®”$?懵cxLË?懄ö¹¨?懄òK{\?æ‡T…¼?æ‡T€â†É?æ‡$sV)?æ‡$=)û?æ†ó¡‘Bý?æ†ó[Ý?æ†Ã/s>è?æ†Ã+=$×?憒½à?憒¸âÏ?æ†bJ—Æ?æ†bFKÒ?æ†1×®l ?æ†1Óxm$?æ†džÎ5?æ†`hØ_?æ…ÐñRç?æ…ÐíúÆ?æ… }Ê—Æ?æ… y”´ ?æ…p ,è?æ…pÐR>?æ…?–_?æ…?‘ÏFÄ?æ…!Çñ²?æ…’)&?æ„Þ­NsÚ?æ„Þ©´]?æ„®8˜~”?æ„®4bÈ&?æ„}æ©^?æ„}¿pûÿ?æ„MNxe±?æ„MJBÁb?æ„Ù ÜÊ?æ„ÔØAŠ?æƒìcfîb?æƒì_1\1?惻í„V½?惻éNÍ›?惋we‡M?惋s0;?æƒ[ ©N?æƒZüÕ2K?æƒ*ŠsÁSI?æ‚ú eV?æ‚úkq?æ‚Éœãš?æ‚ɘ[‡Å?æ‚™%E@~?æ‚™!í¹?æ‚h­½[Æ?æ‚h©ˆ?æ‚85ùƒb?æ‚81ÄB¼?悽úD?悹ÄÍ®?æ×E¾Rø?æ×A‰$q?æ¦ÍF•¶?æ¦Ép??ævT’Ñô?ævP]µ?æEÛ£ 4?æE×møÝ?æbwHè?æ^B>¡?æ€äé±M?æ€ääÚ°?怴okÛ¬?怴k6ã…?怃õŒ:ª?怃ñWK“?æ€S{p÷|?æ€Sw<u?æ€#ƒº?æ€"üä¦Ã?æò††-O?æò‚QYh?æ ·B ?æ‚wI?摫ű?æ‘Œwë?æadâ%?æa0)o?æ0™â #?æ0•­Y}?æ#q?æîsÜ?æ~Ï¢(­]?æ~ÏôØ?æ~Ÿ%ò|ï?æ~Ÿ!½è{?æ~n©{I?æ~n¥F¾?æ~>,Ä>?æ~>(»È?æ~ ¯ÐèÛ?æ~ «œo™?æ}Ý2¡—”?æ}Ý.m'b?æ}¬µ6*?æ}¬±Âæ?æ}|7´?æ}|3Z´¤?æ}K¹«yò?æ}Kµw$ó?æ};Œ@L?æ}7Wô]?æ|ê½1 Ó?æ|ê¸üÝõ?æ|º>™E?æ|º:eSx?æ|‰¿ÆÇ?æ|‰»‘ì ?æ|Y@·AÑ?æ|Y<ƒ&?æ|(ÁkÛo?æ|(½7¼Õ?æ{øAä¥s?æ{ø=°ê?æ{ÇÂ!Èõ?æ{ǽí¼}?æ{—B"Üg?æ{—=îÙ?æ{fÁèvß?æ{f½´|Š?æ{6Ar (?æ{6=>ä?æ{À¿v ?æ{¼‹Ø?æzÕ?ÑQž?æzÕ;r|?æz¤¾§|¡?æz¤ºs¦‘?æzt=A’?æzt9 À“?æzC»ŸöØ?æzC·l2ë?æz9¼â?æz5?æyâ·©v.?æyâ³uÄc?æy²5Tpx?æy²1 ÇÀ?æy²ÃÔÖ?æy®50?æyQ/÷ƒ?æyQ+Ãì}?æy ¬ï¤??æy ¨¼¼?æxð)¬<Ì?æxð%x¸Z?æx¿¦,¾›?æx¿¡ùC;?æx"qÀ©?æx>N[?æx^ž{l?æx^šHÌ?æx.HĶ?æx.dŒ?æwý•ÛØ?æwý‘§ÁÀ?æwÍ1þó?æwÍ þ°í?æwœŒLÄQ?æwœˆ]?æwl,mÈ?æwlù1æ?æw;Бã?æw;}_?æw ü8Ç6?æw øy?ævÚve€?ævÚr2_c?æv©ðVåt?æv©ì#ÍÛ?ævyj ×"W?ællOÕŒÚ?ællK¤__?æl;½Ü?æl;¸Îòv?æl )ïúé?æl %¾ß˜?ækÚ–¤ôZ?ækÚ’sâ?ækª¾?æk©þíµg?ækyo]Ëp?ækyk,Ë]?ækHÛaÖ\?ækH×0ß^?ækG*š·?ækBù¬Î?æj粸®â?æj箇Ê?æj· ÎB?æj·Úò‚?æj†‰#´>?æj†„òá”?æjUôÒ®?æjUïÐ ?æj%^£›t?æj%ZrÚô?æiôÉ }?æiôÄÚ\?æiÄ37ˆ,?æiÄ/Ù×?æi“)Ò?æi“˜øê’?æicàSå?æic¯·º?æi2p\j¾?æi2l+ש?æiÙغ?æiÕmN»?æhÑB¤YB?æhÑ>sØX?æh «p:?æh §?e?æhpYî?æhpÐë.?æh?|Wui?æh?x'¿?æhärÙr?æhàB|Þ?ægÞLS®æ?ægÞH#[g?æg­³ùÕ¬?æg­¯É‹D?æg}däÄ?æg}4£r?ægL‚•ßË?ægL~e§Ž?æg鋧p?ægå[xI?æfëPG?L?æfëL;?æfº¶ÇÑ?æfº²—´?æfŠ òÅ?æfŠÝÞà?æfYƒ`?æfY~éU??æf(èåáh?æf(äµß¯?æeøNrê[?æeøJBñ¸?æedzÅ#?æeǯ•—?æe—Ü|?æe—¬•Š?æef}¸èó?æefy‰ “?æe5âZ˜8?æe5Þ*Ãî?æeFÁi¸?æeB‘ž„?ædÔªí=X?ædÔ¦½{;?æd¤Þ`Y?æd¤ ®§R?ædsr”×?ædsne'?ædBÖ¥Ò?ædBÑàþø?æd9Qõj?æd5"W§?æcáœX¥¼?æcá˜)?æc°ÿ$û?æc°úôye?æc€aµ†?æc€]…”?æcOÄ Lù?æcO¿ÛÓ?æc&&Ñ?æc!÷`Ê?æbÝ?æbîƒØ¢?æb½é­¯l?æb½å~QG?æbKI?æbFé½;?æb\¬Iø£?æb\¨¬­?æb, @‹8?æb, HY?æaûmü<¼?æaûiÍô?æaÊÎ}5ð?æaÊÊN>?æaš.Ãèd?æaš*”ÀÊ?æaiŽÏë6?æaiŠ Ì³?æa8î¡Ô^?æa8êr¾ò?æaN8ò.?æaJ åÚ?æ`×­•mb?æ`שfj%?æ`§ ·Ûí?æ`§ˆáÇ?æ`vkŸŒ&?æ`vgp›?æ`EÊLË0?æ`EÆã9?æ`(¿xÿ?æ`$š?æ_ä†÷â¯?æ_ä‚É ç?æ_³äõÃÔ?æ_³àÆ÷$?æ_ƒB¸ü^?æ_ƒ>Š8Å?æ_R B"1?æ_Rœg¯?æ_!ý¨?æ_!ùaö°?æ^ñZ¤Û4?æ^ñVv2â?æ^À·~ä8?æ^À³PDþ?æ^5ö?æ^ïŸÓ?æ^_pƒ¯?æ^_lU!ý?æ^.Ì®â?æ^.È€ï?æ]þ(ŸÞ?æ]þ$pŒ?æ]Í„UÌ?æ]Í€' ?æ]œßÑè¦?æ]œÛ£û?æ]l;´@?æ]l6åT®?æ];– X?æ];‘ì´Þ?æ] ð胸?æ] ìº6V?æ\ÚK{kã?æ\ÚGM'˜?æ\©¥ÔY ?æ\©¡¦m?æ\xÿóQF?æ\xûÅ,?æ\HYס]?æ\HU©x[?æ\³ß®?æ\¯S¿Ä?æ[ç ò4ä?æ[çÄ?æ[¶f(î?æ[¶aú5?æ[…¿$‡?æ[…ºö ç?æ[Uæª?æ[U¸"?æ[$pmJ?æ[$l?ŽÛ?æZóÈ»v?æZóÄ5?æZà Îì‚?æZá D?æZ’x§ñb?æZ’tz=?æZaÐGxx?æZa̪k?æZ1'¬ô½?æZ1#/É?æZ~Ó×p?æZz¦•?æYÏÕ¼J3?æYÏÑŽ—q?æYŸ,jx§?æYŸ(<Îÿ?æYn‚Þ¯Â?æYn~±3?æY=Ù>.?æY=Ôꦷ?æY /•1?æY *êÓ?æXÜ„ÜÝn?æXÜ€¯X)?æX«Úh/?æX«Ö:Ÿ?æX{/¹R¾?æX{+‹ß¬?æXJ„Ï÷"?æXJ€¢)?æXÙ¬yž?æXÕ¾?æWé.O'?æWé*!ÏW?æW¸‚·N^?æW¸~‰ÿ°?æW‡Öå͈?æW‡Ò¸‡ô?æWW*Ùó[?æWW&¬¶á?æW&~”1?æW&zfý°?æVõÒ?æVõÍæóÀ?æVÅ%ZOÅ?æVÅ!-.—?æV”xeðÄ?æV”t8د?æVcË7–‰?æVcÇ ‡Ž?æV3Ïò?æV3¢ˆ?æVp-Š?æVlÃ?æUÑÂP†È?æUѾ#“?æU¡:³"?æU¡ ÈŽ?æUpeêŒÙ?æUpa½«_?æU?·`…?æU?³3¬³?æUœ{Ø?æUo¬‘?æTÞYžur?æTÞUq¯F?æT­ªf¾¼?æT­¦:ª?æT|úõo?æT|öÈ_w?æTLKIS?æTLG¨±?æT›cð??æT—7N{?æSêëDÉ‚?æSêç0Ù?æSº:ëvÎ?æSº6¾ç??æS‰ŠX±Ì?æS‰†,+W?æSXÙŒõ?æSXÕ_”š?æS((….Ê?æS($Xº‰?æR÷wD¤?æR÷s2~?æRÆÅʇ?æRÆÁž%?æR–:?æR–éá?æReb(”u?æRe]üDž?æR4°R?æR4«Õ K?æRý .Ž?æRùsðì?æQÓKR”?æQÓFÙ ?æQ¢˜0Âb?æQ¢”–ö?æQqå!ñH?æQqàõÎö?æQA1Ú‹?æQA-­ìT?æQ~Xºð?æQz,ªÓ?æPßÊ`?æPßÆqYŒ?æP¯¨‹¡?æP¯|»?æP~bz;?æP~^N'o?æPM®Î&?æPM©åâv?æPùp6¤?æPõDT?æOìD•5¾?æOì@i\C?æO»€c?æO»‹T’©?æOŠÚ1ÂÏ?æOŠÖû‹?æOZ$ª2¼?æOZ ~t“?æO)nè¹?æO)j½r?æNø¸í£Ö?æNø´Á÷ä?æNȹb¶?æNÇþ¿Þ?æN—LKiƒ?æN—HÏÇ?æNf•¤ù?æNf‘xtY?æN5Þæ?æN5Ú˜€?æN'©/2?æN#}°É?æMÔpQ%%?æMÔl%¯×?æM£¸»D´?æM£´Ø‚?æMsë\?æMrü¿ùx?æMBHâJ5?æMBD¶ð:?æMŸ\á?æMŒt ?æLàØ"á7?æLàÓ÷™s?æL°lÿ°?æL°AÁ?æLf}t#?æLbR>—?æLN­Súl?æLN©(Íü?æLóñ'•?æLïÆA?æKí:T·}?æKí6)E?æK¼€~eÿ?æK¼|STã?æK‹ÆnìU?æK‹ÂCäT?æK[ %™È?æK[úšä?æK*Q£'‹?æK*Mx1Ã?æJù–ç-M?æJù’¼@¡?æJÈÛñÓ{?æJÈ×Æïë?æJ˜ ±Ì?æJ˜—×Y?æJgeZ]9?æJga/‹â?æJ6©¸‘¤?æJ6¥Éi?æJíÝ ó?æJé²KÔ?æIÕ1È‚H?æIÕ-ÌF?æI¤uz[?æI¤qOâu?æIs¸ó6j?æIs´È’¡?æIBü2WŠ?æIBø¼Ý?æI?8‡¤?æI; ö?æHá‚ÍÐ?æHá}ÚE\?æH°Ä—ã"?æH°ÀmcË?æH€ñ§®?æH€Ç1u?æHOI³?æHODç²–?æHŠùsš?æH†Ïš?æGí̧;&?æGíÈ|àB?æG½Âè?æG½ ñq"?æGŒOW3F?æGŒK,êœ?æG[Y´¤?æG[Œ/u?æG*Ñ"–~?æG*Ìø`?æFú²m®?æFú ˆ@[?æFÉR L?æFÉMÞö?æF˜’&4(?æF˜ü?æFgÒ t8?æFgÍàb=?æF7µ–p?æF7 ‹‘?æFQ'„?æFLýÃ?æEÕ`É?æEÕŒ6 &?æE¤Ï_ãî?æE¤Ë5ög?æEt&pî?æEt üŒ…?æECL³Ñ,?æECH‰õá?æE‹-?æE†ÞZÖ?æDáÉ#d—?æDáÄù›‡?æD±Ä`?æD±Ün?æD€D¯,|?æD€@…u§?æDO‚Xê?æDO}õ«2?æD¿V–(?æD»,ñŽ?æCíüTèp?æCíø+Lô?æC½9ç§?æC½4ðUI?æCŒu¦Lž?æCŒq|Ã^?æC[±ù¯ZJ?æ?[q"Ê?æ?[lÝb#?æ?*¨kð?æ?*¤C8ˆ?æ>ùߘüO?æ>ùÛpMæ?æ>ÉK¹?æ>Éd¦n?æ>˜MHvN?æ>˜IÚ"?æ>gƒÊìu?æ>g¢Yh?æ>6º²_?æ>6µì(r?æ>ð%<?æ>ëü»8?æ=Õ%üÕ¸?æ=Õ!Ô^ ?æ=¤[œ7ö?æ=¤WsÉe?æ=s‘jŽ?æ=sŒÚ?æ=BÆ/¹Ì?æ=BÂ]z?æ=û$–?æ=öüBß?æ<á/àOM?æ<á+¸9?æ<°dcUÚ?æ<°`;æ?æ<˜­Ñø?æ<”…š#?æ>?æ:fÅjÅ?æ:5úåCÐ?æ:5ö½yv?æ:,Oed?æ:('¤*?æ9Ô]€Ë4?æ9ÔYY?æ9£ŽyÁ|?æ9£ŠR‚?æ9r¿:f?æ9r»^Œ?æ9AïÂ.?æ9Aëšgt?æ9 ¡?æ9ê k?æ8àP(O ?æ8àLÄ‘?æ8¯€Æ„?æ8¯{ßE+?æ8~¯­/ ?æ8~«…·g?æ8Mß’†?æ8MÚó#m?æ8Oïs?æ8 (‰{?æ7ì=LÞŽ?æ7ì9%¶?æ7»lø?æ7»gé¤X?æ7Šš)?æ7Š–uÍ’?æ7YÈð×?æ7YÄÉ•‘?æ7(÷ ðâ?æ7(ò丌?æ6ø$î±æ?æ6ø Ç‚°?æ6ÇR™BB?æ6ÇNr-?æ6–€ 6?æ6–{ãùA?æ6e­E-×?æ6e©?æ64ÚFýe?æ64Öò±?æ6?æ6é‹?æ5Ó3 Ù+?æ5Ó/yà¹?æ5¢_ùé¤?æ5¢[ÒúR?æ5qŒÕ?æ5q‡ï¤?æ5@·õãä?æ5@³ÏÔ?æ5ã™m?æ5ßvÅ~?æ4ß QÇ?æ4ß å†ú?æ4®:C é?æ4®6K=?æ4}eAc ?æ4}aª?æ4Lìx?æ4L‹à=?æ4º”=?æ4¶mrô?æ3êäét?æ3êàÂtL?æ3ºmk?æ3º ÞÙd?æ3‰8é'?æ3‰4ÃA?æ3Xb•€Ü?æ3X^nÿ?æ3'ŒÔÉ?æ3'‡â\&?æ2öµCÁ ?æ2ö±QŠ?æ2ÅÞFµ¤?æ2ÅÚ OD?æ2•&ó?æ2•êÉ´?æ2d/£a?æ2d+} ä?æ23WýD ?æ23SÖù?æ2€Ô/?æ2{ø’U?æ1Ѩ?æ1Ñ£áÜå?æ1 Ï¹xL?æ1 Ë“Hµ?æ1o÷2p¤?æ1oó J/?æ1?sJ©?æ1?M-V?æ1E| ƒ?æ1AUöR?æ0ÝlLH?æ0Ýh&=?æ0¬’ätÁ?æ0¬Ž¾rÓ?æ0{¹D“=?æ0{µšq?æ0Jßl{?æ0JÛF(Ò?æ0[à(?æ05ù¡?æ/é+ʆ?æ/é&íí!?æ/¸P“oò?æ/¸Lm›®?æ/‡uÚÔ–?æ/‡qµ u?æ/VšêhW?æ/V–ĦX?æ/%¿ÁŸ¶?æ/%»›æÙ?æ.ôä`Æ­?æ.ôà;ò?æ.ÄÈL?æ.Ä¢^´?æ.“,öóþ?æ.“(ÑVˆ?æ.bPíÞ¾?æ.bLÈJj?æ.1t­5k?æ.1p‡ª:?æ.˜4lˆ?æ.”êz?æ-Ï»ƒ¬$?æ-Ï·^38?æ-žÞšÔ‚?æ-žÚud¸?æ-nyÅÞ?æ-mýT_7?æ-=$!7Þ?æ-=ûÚZ?æ- FÂú?æ- Bkn˜?æ,ÛhÇÿ£?æ,Ûd¢´e?æ,ªŠÇ¥|?æ,ª†¢c`?æ,y¬”Â?æ,y¨j[È?æ,HÎB?æ,HÉú8?æ,ïwA?æ,ëR_?æ+ç—¹Ø?æ+ç rœG?æ+¶1€ ø?æ+¶-[ ‹?æ+…R0ž€?æ+…N “5?æ+Tr©¢0?æ+Tn„ ?æ+#’ê ²?æ+#ŽÅ§®?æ*ò²ó ?æ*ò®ÎÒ(?æ*ÁÒÅR?æ*ÁΠk]?æ*ò_ J?æ*î:/¯?æ*`À÷Ã?æ*` œ#K?æ*/0ë¥?æ*/,ÆÙÈ?æ)þOÞBK?æ)þK¹€?æ)Ín™? ?æ)Íjt…þ?æ)œÃ^?æ)œˆøt?æ)k«h ?æ)k§CyT?æ):Éx§?æ):ÅSz?æ) çLC¯?æ) ã'¯/?æ(Ùè[?æ(ÙÃÏ´?æ(¨"Laë?æ(¨'ß²?æ(w?yœ?æ(w;T–‡?æ(F\m´ÿ?æ(FXIE?æ(y*z ?æ(u=?æ'䕯ª?æ'ä‘‹Lã?æ'³±üs“?æ'³­Ø ?æ'‚ÎŒt?æ'‚ÉíA?æ'Qé?æ'QåËFi?æ'!•)¹?æ'!pðŸ?æ&ð!&ø?æ&ðÞ÷?æ&¿<9Ì0?æ&¿8¥^?æ&ŽW8" ?æ&ŽSñ?æ&]qÿM?æ&]mÛ8‰?æ&,ŒŽœz?æ&,ˆj‘?æ%û¦åñ!?æ%û¢Áîß?æ%ÊÁÞr?æ%ʼáåT?æ%™Úíý ?æ%™ÖÊ ?æ%hôžQ?æ%hðzj=?æ%8mè?æ%8 ó7?æ%'Xì-?æ%#5¡?æ$Ö@b¬1?æ$Ö<>àÉ?æ$¥Y4Õà?æ$¥U?æ$tqÏmS?æ$tm«´4?æ$CŠ2v«?æ$C†Ʊ?æ$¢]®b?æ$ž:Œ?æ#áºQËœ?æ#á¶.-ë?æ#°Òq?æ#°ÍêŠä?æ#é’õ•?æ#åoj-?æ#Oàuò?æ#Nü¼ó¯?æ#öm?æ#ÒœO?æ"í.ÔgY?æ"í*°÷`?æ"¼E{·c?æ"¼AXPŽ?æ"‹[ë?æ"‹WDZh?æ"Zr#%Š?æ"ZmÿÑ?æ")ˆ#þÒ?æ")„³l?æ!øí3¬?æ!ø™Éñl?æ!dz3”?æ!ǯ[úy?æ!–ÈÙÞÖ?æ!–Ķ®ß?æ!eÝüñþ?æ!eÙÙË-?æ!4òè”î?æ!4îÅwC?æ!Zá?æ!zFZ?æ ÓqB?æ Ó÷eá?æ ¢0`Gƒ?æ ¢,=EF?æ qDná½?æ q@Kè¦?æ @XF C?æ @T#0R?æ kæN¼?æ gÃgñ?æÞOMz?æÞ{,oÓ?æ­’€µJ?æ­Ž]àÉ?æ|¥zõ“?æ|¡X*8?æK¸=Êê?æK´´?æÊɤ±?æƦë¡?æéÝc=?æéØû³S?æ¸ï< §?æ¸ëcâ?æˆ"W†?æ‡üÿ¹ç?æWÑq¶?æW®Ý=?æ&$I ?æ& &õº?æõ5Šeê?æõ1gã¼?æÄF”$`?æÄBq«Y?æ“WfäK?æ“SDtj?æbhbF?æbcßû‹?æ1xg1a?æ1tDÓË?æˆÂ½?æ„nnN?æϘ~÷è?æÏ”\¬Ÿ?枨5ßW?枤4?æm·µÄŽ?æm³“‹‘?æ<Æþ´?æ<ÂÛìÝ?æ Öž?æ ÑíwÏ?æÚäé¿?æÚàÇ¡Š?æ©óŒ¦@?æ©ïj‘Ý?æyø4^?æxýÖ) ?æH- ?æH ?æ*O»?æVË?ææ+ðyï?ææ'Ί&?æµ9Æ…?æµ5]ßâ?æ„F׆í?æ„Bµ©q?æSSø*e?æSOÖV?æ"`áüj?æ"\À1;?æñm”*Ç?æñirh¿?æÀzÑ?æÀuíÖð?æ†T à?æ‚2\&?æ^’a7é?æ^Ž?‘V?æ-ž7;±?æ-šžE?æü©ÖÍÊ?æü¥µ9„?æ˵>Ô¦?æ˱I‡?æšÀp*‹?æš¼N¨“?æiËjho?æiÇHïž?æ8Ö-'N?æ8Ò ·¤?æ่È?æܘ"E?æÖë"?æÖæí¤Ç?æ¥õ-P ?æ¥ñ û×?ætÿ½ö?ætúóré?æDÅOñ?æD¤ ?æ>æ\?æ­?æâ̤?æâ` ?æ±$¿}?æ± l™ ?æ€-bæž?æ€)AÉV?æO6þÃ?æO1ßê¢?æ>hw?æ:Gl?æíF˜è^?æíBwæŒ?æ¼N’z™?æ¼Jqï?æ‹VUœÂ?æ‹R4­@?æZ]á ?æZYÀº4?æ)e6õ?æ)aß?æølUÂ?æøh4í÷?æÇs= n?æÇoÕ‹?æ–yîÛº?æ–uÎÿ?æe€i0¡?æe|Hx?æ4†­.?æ4‚Œ^Ã?挺1?戙ŠÙ?æÒ’yÒ?æÒŽoÜ·?桘03­?æ¡”Ÿº?æp™p?æp™x¥?æ?¢Ë|u?æ?žªúÒ?æ§Ç~?棦›?æݬŒs-?æݨlÚ?欱íZ?欬ú‡/?æ{µr©²?æ{±RL°?æJ¹”7?æJµsÃ]?æ½L?æ¹^Ëš?æèÁ3@?æè½þŒ?æ·Ä±?æ·ÀË-?æ†Çøˆ`?æ†ÃØY(?æUËüÎ?æUÆèÖ¿?æ$Íã:±?æ$ÉÃÊ?æóЇF?æóÌg2V?æÂÒð¥:?æÂÎК¤?æ‘Õ ?æ‘Ðÿ³?æ`×÷ÿ?æ`Ò÷ÿ»?æ/ØÙ[¿?æ/Ô¹l£?æþÚdF?æþÖD5S?æÍÛ¸Ô?æÍט¥ ?æœÜÖ÷?æœØ¶1V?ækݼïñ?ækÙ%y?æ:Þm±?æ:ÚMðN?æ ÞçTº?æ ÚÇœ”?æØß*ÖŽ?æØÛ '‘?æ§ß7¬´?æ§Ûà?ævß ·”?ævÚîê?æEÞ­Ó?æEÚ‹R?æÞQA?æÙöÆé?æ ãÝH ä?æ ãÙ)µ?æ ²ÜD %?æ ²Ø%(?æ Û Ú?æ Öêœý?æ PÙ˜è?æ PÕy‚S?æ ×ñ\G?æ ÓÑÿ¾?æ îÖl¤?æ îÑôD?æ ½Óþù†?æ ½Ï߯O?æ ŒÑ´N ?æ ŒÍ• ?æ [Ï3ns?æ [Ë6?æ *Ì{¬œ?æ *È\}â?æ ùɾŠ?æ ùÅn˜ú?æ ÈÆia?æ ÈÂJD­?æ —Ãü?æ —¾ïïÀ?æ f¿}öd?æ f»^ìQ?æ 5»¶†v?æ 5·—…?æ ·¸þ]?æ ³š?æ Ó³„ÓÔ?æ Ó¯eå??æ ¢¯™'?æ ¢ªû³¼?æ qªz 2?æ q¦[.ð?æ @¥£u?æ @¡„¢?æ  –“Î?æ œwÉá?æ Þ›SG°?æ Þ—4†í?æ ­•Ù”Ñ?æ ­‘ºÝ8?æ |*0ú?æ |Œ ‚Œ?æ KŠD'H?æ K†%‚?æ „'æj?æ € JO?æé}Õ•ò?æéy·?æ¸wLÏ=?æ¸s.Ew?æ‡pŽk˜?æ‡loêü?æVi™½F?æVe{EÕ?æ%bnÈO?æ%^PZ ?æô[Ü?æôVï¹À?æÃSw=?æÃOX·K?æ’Kª?æ’G‹ÁN?æaC¦ÞQ?æa?ˆ”´?æ0;mà?æ07O ?æÿ2þI ?æÿ.àY?æÎ*XÏ.?æÎ&:¡?æ!}u¤?åù2¤­›Ç?åùþ.*?åùŒâ”z?åøÐxý‘E?åøÐtâÃ?åøŸ`ÇQ?åøŸ\¬ü?åønH\s ?åønD@ôå?åø=/¸V‹?åø=+œá‘?åø Úø†?åø ¿Œº?å÷ÚýÈOä?å÷Úù¬íF?å÷©ä€`•?å÷©àe%?å÷xË}–?å÷xÆç-T?å÷G±O[Ê?å÷G­4¶?å÷—f”ô?å÷“KW?åöå}HsÊ?åöåy-??åö´bôØÚ?åö´^Ù­P?åöƒHlÑ?åöƒDPìu?åöR-­¯~?åöR)’–P?åö!ºŽ?åö!žõŽ?åõï÷‘ñ?åõïóv ?åõ¾Ü2¾2?åõ¾ØÀ?åõÀžáæ?åõ¼ƒíp?åõ\¤Õʶ?åõ\ ºßo?åõ+ˆ×5Ö?åõ+„¼S½?åôúl£‘K?åôúhˆ¸a?åôÉP:á?åôÉL E?åô˜3œ›s?åô˜/Ôæ?åôgÉR?åôg®”¡?åô5ùÀå:?åô5õ¦1 ?åôÜ‚îû?åôØhCù?åóÓ¿ÝD?åóÓºõ;q?åó¢¡g´?åó¢M\?åóqƒ‰Æ]?åóqo6ç?åó@ew3?åó@a\¬Ñ?åóG/” ?åóCñ?åòÞ(²á)?åߪ,<Ç’?åߪ(%êµ?åßxøì ?åßxôÕ4b?åßGÅfÌ^?åßGÁPç?åß‘­;„?åß–z??åÞå]¿ÂÔ?åÞåY© Ã?åÞ´)“1?åÞ´%†äR?åÞ‚õG`;?åÞ‚ñ0ºŽ?åÞQÀ½-Î?åÞQ¼¦‘U?åÞ ‹þs ?åÞ ‡çßÙ?åÝïW €?åÝïRõm?åݾ!äÓê?åݾÎS ?å݌쉠?åÝŒèsó?åÝ[¶úÂ?åÝ[²ã¦H?åÝ*6R?åÝ*} + ?åÜùK>àÿ?åÜùG(„ë?åÜÈt ?åÜÈý!)?åÜ–Þ³zy?åÜ–Ú0Ì?åÜe¨F?åÜe¤ÚÌ?åÜ4qW-?åÜ4m@õÓ?åÜ:[?åÜ6DÖ?åÛÒ*ÇH?åÛÑÿ¢h?åÛ ËÆWS?åÛ Ç°;¦?åÛo”.D—?åÛo2?åÛ>\aãH?åÛ>XKÚ?åÛ $a}?åÛ K}n?åÚÛì-?åÚÛè 3?åÚª³Ä³Ö?åÚª¯®Æ,?åÚy{(W¢?åÚyws,?åÚHBX)j?åÚH>BN'?åÚ Sî?åÚ=ñŸ?åÙåÐp~?åÙå̧£?åÙ´–¯?åÙ´’™Ý_?åÙƒ]WT?åÙƒXù à?åÙR#;RÌ?åÙR%¥?åÙ é3“E?åÙ åï9?åØï®÷ùt?åØïªâ^œ?åؾtˆ‰2?åؾpr÷?åØ9å#:?åØ5ÏšÊ?åØ[ÿ ¨N?åØ[úø)?åØ*Ä…Š?åØ*¿í‚?å×ùˆÃáÚ?å×ù„®u?å×ÈMQ4¶?å×ÈI;Ñ?å×—ªë8?å×— •Í?å×eÕÐÃ?å×eÑ»qÑ?å×4™ÂV·?å×4•­µ?å×]€åå?å×Yk§?åÖÒ! Äô?åÖÒö[?åÖ äbŽ}?åÖ àMb?åÖo§…Œ}?åÖo£piM?åÖ>juO?åÖ>f`5!?åÖ -1¶?åÖ )öï?åÕÛï¹#Z?åÕÛë¤È?åÕª² Èï?åÕª­øÊ’?åÕyt.“?åÕypé?åÕH6¨¬?åÕH2¼¸?åÕ÷Õ0¡?åÕóÀMâ?åÔå¹Zè¦?åÔåµF?åÔ´z¬÷ž?åÔ´v˜'H?åÔƒ;Ëí ?åÔƒ7·&?åÔQü¶ü?åÔQø¢>0?åÔ ½nm ?åÔ ¹Y¸T?åÓï}òÐy?åÓïyÞ$÷?åÓ¾>CWâ?åÓ¾:.µ”?åÓŒþ`“S?åÓŒúKú;?åÓ[¾F’œ?åÓ[º2¹?åÓ*}õ|?åÓ*yàŽÎ?åÒù=pˆ€?åÒù9\ ?åÒÇü·×?åÒÇø£bÑ?åÒ–»ËK ?åÒ–·¶à?åÒez«tœ?åÒev—Â?åÒ49Wî2?åÒ45C•Ž?åÒ÷И¨?åÒó¼I:?åÑѶàç?åÑѲš®?åÑ t'§°?åÑ pj­?åÑo2‡³?åÑo-ñSå?åÑ=ï°ä?åÑ=ë›æK?åÑ ­'$?åÑ © ?åÐÛjj8À?åÐÛfV “?åЪ'yß?åЪ#eÐ ?åÐxäV`«?åÐxàBZé?åÐG þïS?åÐGœêòÇ?åÐ]s÷ã?åÐY`?åÏåµÄ.?åÏå¡Ú?åϳÕÃîò?åϳѰ?åÏ‚‘žå?åÏ‚‹ Q?åÏQMF$?åÏQI2O¥?åÏ ¹Á!?åÏ ¥ûØ?åÎîÃúÍ?åÎî¿æ[º?åνò?åνzóP?åÎŒ9àcW?åÎŒ5̹¯?åÎZô†_Ê?åÎZðr¿X?åÎ)®ùB?åÎ)ªåªà?åÍøi8¥?åÍøe% ?åÍÇ#DÒr?åÍÇ1M£?åÍ•Ýe?åÍ•Ù év?åÍd–¦²?åÍd’¯4P?åÍ3P4›(?åÍ3L!1ü?åÍ si6?åÍ` @?åÌШ?åÌоk½é?åÌŸ{W~I?åÌŸwD0À?åÌn3ücê?åÌn/é˜?åÌ<ìnN?åÌ<èZÔ2?åÌ ¤¬§??åÌ  ™uZ?åËÚ\·Æ?åËÚX¤á?åË©·?åË©|—?åËwÌ4|l?åËwÈ!f*?åËFƒ¦`|?åËF“Sq?åË:ä•%?åË6Ñ‘P?åÊãñïÍ?åÊãíÜÒw?åʲ¨È ?åʲ¤µ¬?åÊ_lÊ?åÊ[YáÕ?åÊPÞ¹’?åÊPËÚ™?åÊ̘?åÊÈ ÂÍ?åÉí‚)$Ú?åÉí~XO?åɼ8b;?åɼ3îžç?åÉŠí¦àX?åÉŠé”&;?åÉY£:?åÉYŸ‰2?åÉ(XX¹,?åÉ(TF}?åÈ÷ dø€?åÈ÷ RZ?åÈÅÂ=ûÝ?åÈž+fœ?åÈ”vä ô?åÈ”rÑ€ë?åÈc+Wu{?åÈc'Dò©?åÈ1ß—­d?åÈ1Û…3É?åÈ“¥DI?åÈ’Óå?åÇÏGÕ?åÇÏCmmé?åÇû&×Î?åÇ÷yÙ?åÇl®›gË?åÇlª‰?åÇ;aÝý?åÇ;]ÊÔw?åÇ èFð?åÇ Ö¡?åÆØǽˆ?åÆØêÌq?åƧz^p?åƧvLm?åÆv,Íj?åÆv(ºëÂ?åÆDßEM?åÆDÚö'Ý?åÆ‘¢¡?åÆŒþŽh?åÅâBåÅa?åÅâ>Óº`?åÅ°ôˆ?åÅ°ðvP?åÅ¥÷¤‚?åÅ¡å«ð?åÅNW3Ü°?åÅNS!íV?åÅ=R?åÅ+kó?åÄ빟®?åÄëµÂÅ?åĺi¶ì(?åĺe¥w?åĉ'Z?åĉMá?åÄWÊdÆ?åÄWÆRÏ„?åÄ&znðn?åÄ&v]8d?åÃõ*F;?åÃõ&4ŒA?åÃÃÙêºI?åÃÃÕÙ¯?åÃ’‰\qÑ?åÃ’…JÕo?åÃa8›eh?åÃa4‰Ò??åÃ/ç§S?åÃ/ã•É?åÂþ–€aF?åÂþ’nàŽ?åÂÍE&q?åÂÍAù?å›ó™îÐ?å›ˆ?åÂj¡ÚR²?åÂjÈí¢?åÂ9Oè, ?åÂ9KÖÐ4?åÂýÃ[²?åÂù² ?åÁÖ«k6õ?åÁÖ§Yí?åÁ¥Xàp ?åÁ¥TÏ/Þ?åÁt# ®?åÁtÓ¹?åÁB³2¡ü?åÁB¯!t@?åÁ`è?åÁ[þ×?åÀà ºUE?åÀà©9ú?åÀ®¹1§v?åÀ®µ •d?åÀ}evÖ?åÀ}ae‡ý?åÀLˆò@?åÀL wòŸ?åÀ½hCö?åÀ¹WMŽ?å¿éi}Ô?å¿ée¥?忸ÒZ?忸~îd?忆¿×h(?忆»Æk?å¿UjìeÞ?å¿UfÛ”Z?å¿$Îò?å¿$¾)Ì?å¾òÀ~í³?å¾ò¼n.¡?å¾Ájü\p?å¾Áf릗?å¾G4?å¾6r”?å¾^¿_Ý?å¾^»Nsv?å¾-iDÒž?å¾-e48q?å½ü÷ÊÆ?å½üç9Ò?å½Ê¼xHÈ?å½Ê¸gÁ ?å½™eÆ-Š?å½™aµ¯?å½h៥?å½h Ñ*]?å½6·Êű?å½6³ºY¢?å½`]¶?å½\púá?å¼Ô ±(?å¼ÔõWŒ?å¼¢±Vò¬?å¼¢­F¢J?å¼qYv_¢?å¼qUfy?å¼@c*³?å¼?ýRìÃ?弩W ?å¼¥ "ë?å»ÝP¥/Ô?å»ÝL•X?廫÷úü¸?廫óêÚv?å»zŸ6±?å»z›©?å»IFJ?å»IAÿ:1?å»ìÍÑà?å»è½ËK?åºæ“Yôã?åºæI÷ˆ?庵9°R´?庵5 ^“?広ßÑ?åªãä¶÷Ì?åªãà©ø²?媲zɪ?媲v¼"Í?媩éU?åª œü´?åªO¦YJÆ?åªO¢Lgb?åª;ÖØ?åª7Éþv?å©ìÑ"¹1?å©ìÍèH?å©»f=Ü?å©»b0K/?婉û%£í?婉÷å~?å©Xܵi?å©X‹Ð7?å©'$bJø?å©' UŸ?å¨õ¸¶"ë?å¨õ´©€4?å¨ÄLØcš?å¨ÄHËÊ?娒àÈî?娒ܼ]É?å¨atˆ +?å¨ap{„+?å¨0œ ?å¨0 I?å§þ›q¤M?å§þ—e/È?å§Í.œJD?å§Í*Þü?姛Á•LJ?姛½ˆê@?å§jT]ü?å§jPP½0?å§8æóC?å§8âæó?å§yWùÔ?å§uK³ƒ?å¦Ö ‹`™?å¦Ö#…?妤Œðr?妤™€¼œ?å¦s/]ZB?å¦s+Q/ª?å¦AÀü¡²?å¦A¼ð€X?å¦Rj?Õ?å¦N^'¹?å¥Þã¦Âæ?å¥Þßš´?奭t±éD?奭p¥ã£?å¥|‹qR?å¥|tï?å¥J–3Ƥ?å¥J’'Ó?å¥&ª„û?å¥"ž›?å¤ç¶ï°?å¤ç²ãÏX?夶Gø„?夶Bø!?处Öçé?处ÒÛN¼?å¤Sf˜s¸?å¤SbŒ®É?å¤!öÐU?å¤!ò ¤?å£ð…gñ0?å£ð\>½?壿…”ª?壿yëu?壣r®?壟fc¸?å£\2-©¿?å£\."?å£*À·˜2?å£*¼¬ ¸?å¢ùO¢^?å¢ùK#?å¢ÇÝ8©L?å¢ÇÙ-.O?墖k/&4?墖g#´v?å¢døôÉÈ?å¢dôéaH?å¢3†‰Rz?å¢3‚}ó9?å¢é@‘?å¢ÝêŽ?å¡Ð¡ß´?å¡Ð ’ð?å¡Ÿ.‰?å¡Ÿ*Õ?å¡mºØE?å¡m¶ÌÖý?å¡îó@?å›>ê†àá?å› u …?å› püf?åšÛûJZÜ?åšÛ÷@Zý?嚪]¥Ñ?嚪}S¯1?åšy?Ëx?åšy5Þ?åšGŒñ7?åšGˆçRî?åšr·?åšh3×?å™ä—Áîy?å™ä“¸Ú?噳àüx?噳×4?噡Ï^Ü?å™ÅŸ½?å™P&Œö¹?å™P"ƒ@Ú?噫Ǭ?噧 ?å˜í/u÷Ú?å˜í+lT{?嘻³¡#P?嘻¯—‰2?嘊7›µ;?嘊3’$]?å˜X»eÓ½?å˜X·\L?å˜'>þÕÝ?å˜':õW?å—õÂg>?å—õ¾]!?å—ÄEžì’?å—ÄA•€µ?嗒Ȧd?å—’Äœ¥È?å—aK|}Ö?å—aGs$z?å—/Î"s?å—/Ê"ê?å–þP—É ?å–þLŽ‚/?å–ÌÒÜ>‚?å–ÌÎÓé?å–›Tð¦?å–›Pçq·?å–iÖÓïG?å–iÒÊÄ.?å–8X†ìË?å–8T}Êó?å–Ú :´?å–Ö"?å•Õ[Zº"?å•ÕWQªÌ?å•£ÜxÍ7?å•£ØoÇ"?å•r]bð•?å•rYYóÀ?å•@Þ…$?å•@Ú‘?å•^¥Iƒ?å•Zœ_1?å”ÝÞýAC?å”ÝÚô`1?唬_$×w?唬[ÿ¦?å”zߨ6?å”zÛÙ¦?å”I^á·?å”IZØñÐ?å”Þw*>?å”Únn0?å“æ]ÜJ!?å“æYÓ—T?å“´Ýp?å“´Ùæå?哃\#>?哃X ‚ô?å“QÚç(š?å“QÖÞ‘‘?å“ Y‰¤?å“ UR?å’î×û™P?å’îÓóÊ?å’½V= Ò?å’½R4?å’‹ÔMÿ6?å’‹ÐE2?å’ZR.®?å’ZN%¦ì?å’(ÏÝí?å’(ËÕž?å‘÷M]3¹?å‘÷ITÝz?å‘Åʬ ˆ?å‘ÅÆ£¼‹?å‘”GÊO®?å‘”C ò?å‘bĸN£?å‘bÀ°(?å‘1Au¢¤?å‘1=mql?åÿ¾”,?åÿ¹úl5?åÎ:_I@?åÎ6W*‹?圶‹€“?圲ƒk ?åk2‡=´?åk.1‚?å9®R„:?å9ªJK?å)íW¼?å%å^?åÖ¥WÞ?厭Ø&^?åŽ{ÿøŒl?åŽ{ûðÜÎ?åŽJyà] ?åŽJuض²?åŽó˜Þ?åŽïcÅ?åçmÀJ?åçi,s?åµævÐY?åµâoEÄ?å„_yv?å„[•ø#?åRØ”¾?åRÔ®?å!QZýf?å!MSŽ˜?åŒïÉñx?åŒïÅêŒ?匾BW¼?匾>P`G?匌º«ú?匌¶†Xô?åŒ[2“±$?åŒ[.Œg`?åŒ)ªiŠÎ?åŒ)¦bJM?å‹ø"^ð?å‹ø'±?å‹Æ™…¸?å‹Æ•}à½?å‹•ÊÀ?å‹• Ûe?å‹c‡à?å‹cƒØô?å‹1þŬp?å‹1ú¾šc?凄©åÜ*?å‡S! –$?å‡S=/?å‡!“ù25?å‡!òâƒ?å†ð·¯ ?å†ð±h›?冾yEíÏ?冾u?°¥?册ë¤Ý?册çžiö?å†[]Ó[ª?å†[YÍ1?å†)ÏÒd?å†)ËËç?å…øA Éð?å…ø=š±Ô?å…Ƴ?£Ú?å…Ư9•?å…•$®™ª?å…• ¨”?å…c•í®í?å…c‘粜?å…2ý ƒ?å…2÷v?å…wÜ#’?å…sÖ9É?å„Îè‹EZ?å„Îä…dÕ?å„Y Ùj?å„U(?å„kÉZÀô?å„kÅTòö?å„:9zºÒ?å„:5tö?å„©k1’?å„¥ev?åƒ×+Ÿb?åƒ×%í1?僥ˆ¼*#?僥„¶6?åƒsø?åƒsôz^?åƒBgN ž?åƒBcHu9?åƒÖO$Â?åƒÒI—¡?å‚ßE ­¦?å‚ßA)Ê?å‚­³Â‡?å‚­¯½ é?å‚|"4Ø)?å‚|/fÕ?å‚Jw<2?å‚JŒqÔ#?å‚þ‰·&?å‚ú„X[?åçll³‚?åçhg]û?åµÚð,?åµÖ£ê?å„G£“?å„CžP?åR´÷Ÿ„?åR°òeË?å!"B?å!èÎ?å€ïœÐ?å€ï‹ u ?倽ûÕû”?倽÷Ðݨ?倌hkŒ?倌dfxå?å€ZÔÑšÞ?å€ZÐÌ|?å€)Aâr?å€)=àU?å÷­ñ ?å÷© ø2?åÆæª?åÆá/?唄ŽZ?唀‰4 ?åbðÅT?åbìèJ?å1[O¼:?å1WJèu?å~ÿÆiG,?å~ÿÂd|¬?å~Î1S%?å~Î-Ncß?å~œœ {Ú?å~œ˜Ãä?å~k˜“…?å~k“äÔ?å~9pôMY?å~9lï§í?å~Û #¹?å~ׇ’?å}ÖE (?å}ÖAwF?å}¤®ê{ ?å}¤ªåñp?å}sˆ5Z?å}sƒµ?å}Aö£u?å}A}ò,c?å}ë5¦—?å}ç18Ê?å|ÞTB]ã?å|ÞP=ù\?å|¬½® ?å|¬¹RÊ?å|{%DZþ?å|{!Ã`?å|IŽBÁâ?å|IŠ>y+?å|öŽŒŽ?å|òŠM?å{æ^«‡?å{æZ¦ß[?å{´Æ—×3?å{´Â“ªL?å{ƒ.T÷e?å{ƒ*PÓÄ?å{Q•âà^?å{Q‘ÞÆ?å{ýAQ?å{ù=@?åzîdp‘š?åzî`l‰Ê?åz¼Ëp>ž?åz¼Çl@?åz‹2@9c?åz‹.ßZ?åya“;!¹?åy/üÃÄõ?åy/øÀš?åxþbK?åxþ^ò6?åxÌÇ?À©?åxÌÃ<Ú?åx›,6»ƒ?åx›(3"ú?åxiþo?åxiŒúßÛ?åx7õ–¼»?åx7ñ“6¾?åxYÿìR?åxUüo›?åwÔ¾9¼ê?åwÔº6Iy?åw£"Dvx?åw£A N?åwq† >´?åwq‚ÝÐ?åw?éÌÔ¨?åw?åÉ} ?åwMIÕ%?åwIF†Î?åvÜ°—ª[?åvܬ”eJ?åv«¶¾n?åv«³‚¤?åvyv¦G‰?åvyr£?åvGÙg~?åvGÕcíA?åv;øƒ²?åv7õc»?åuäžZ×?åuäšWÀd?åu³Ïµ?åu²üŠÂK?åub’"?åu^ÿ?åuOÄgÊ?åuOÀdî?åu& #Î?åu" 28?åt쇄*t?åtìƒB%?åtºèÌ,8?åtºäÉM0?åt‰Iäè6?åt‰Eâu?åtWªÎê²?åtW¦Ì8?åt& ‰òÊ?åt&‡/–?åsôlö?åsôhJ ?åsÂÌs!´?åsÂÈpq?ås‘,¡O‚?ås‘(ž¨#?ås_Œ nª?ås_ˆÐ’?ås-ìpé‚A‰?åq= Ö{?åq=œ}žs?åq þL‰®?åq úJZí?åpÚ[êÂ?åpÚW蜜?åp¨¹Y¶(?åp¨µW™ö?åpw—AÎ?åpw•.ä?åpEs¢Ác?åpEo ·Á?åpÐ`ˆ?åpÌ}`-?åoâ--„?åoâ)+ q?åo°‰«Æú?åo°…©Ù.?åo~åûÙˆ?åo~áùõ?åoMB÷M?åoM>?åožŠ9?åoš ¸E?ånéùÒÈÙ?ånéõÑ-?ån¸Ug?>?ån¸QeÚ?ån†°Í5'?ån†¬Ë ?ånU á(?ånU4S?ån#g ÏM?ån#c +À?åmñÁåGV?åmñ½ã­?åmÀÄ$?åmÀŽ3'?åmŽw s?åmŽs ¾?åm\ÑX¦»?åm\ÍW(N?åm++wo?åm+'užJ?ålù…f’¿?ålùe&â?ålÇß'Ž…?ålÇÛ&+ñ?ål–8¹Åö?ål–4¸lª?åld’<‚?åldŽì~?ål2ëR9â?ål2çPó&?ålDX[&?ål@W³?åkÏ/è?åkÏ™.³Þ?åkõÙ(7?åkñ×ýU?åklNStˆ?åklJRRî?åk:¦žÐv?åk:¢¸$?åkþ»ê ?åkúºÛ?åj×Vª˜`é¨?åd>”až?åd éõqÔ?åd åõ±?åcÛ;X‹ü?åcÛ7XÔ†?åc©Œ–m?åc©ˆè@?åcwÝ” W?åcwÙ”gt?åcF.l;?åcF*lw¢?åcò˜?åc{`H?åbâÏ‘Ïç?åbâË’Fâ?åb±ßW?åb±ß„›?åboþ_—?åbkþé&?åbM¿ï~ó?åbM»ðÌ?åb²!¿?åb ²½â?åaê_Fmp?åaê[GÝ?åa¸®­¤?åa¸ª­¾[?åa†ýå‚?åa†ùåÕƒ?åaULï?åaUHïÁÚ?åa#›Ê¼8?åa#—ˆÎ?å`ñêxSæ?å`ñæy'Å?å`À8÷í ?å`À4øÊ5?å`Ž‡I‹?å`ŽƒJq†?å`\ÕlËN?å`\Ñm» ?å`+#aõ8?å`+bîA?å_ùq) ;?å_ùm*?å_ǾÁñº?å_ǺÂýX?å_– ,©!?å_–-¾ ?å_dYiWá?å_dUjv?å_2¦wß\?å_2¢yÚ?å_óXË ?å_ïYûÕ?å^Ï@ ¸O?å^Ï< òb?å^ŒfŠ?å^ˆ‘©ç?å^kØæû'?å^kÔèGÏ?å^:%›”?å^:!ñ‡?å^q ):?å^m ˆx?å]Ö¼ÖɃ?å]Ö¸Ø2 ?å]¥uÃ×?å]¥w5ª?å]sSæqž?å]sOçì½?å]AŸ)^D?å]A›*â­?å]ê>'2?å]æ?´æ?å\Þ5%WÊ?å\Þ1&îÉ?å\¬Þ~?å\¬{à-È?å\zÊjSª?å\zÆký??å\IÇÇ?å\IÉP§?å\^÷¡,?å\Zù]X?å[å¨ùsP?å[å¤û8Æ?å[³òÍ9œ?å[³îÏ^?å[‚]~?åYÂÇ@‰1?åY‘?åY‘=?åY_ZÉñ¶?åY_VÌ0?åY-¢KÃ?åY-žMeY?åXûéŸ?åXûå¡h`?åXÊ0ʼn?åXÊ,Çp¶?åX˜w½b:?åX˜s¿Å³?åXf¾ˆAà?åXfºŠ®¤?åX5%?åX5'…&?åXK”ºü?åXG—:X?åWÑ‘Öã?åWÑÙkº?åWŸ×è1ð?åWŸÓêÃä?åWnÉ"?åWnË°b?åW+C©À?åI>'Hëÿ?åI dß1?åI ` *¿?åHÚœšÕr?åHÚ˜ *N?åH¨Õ!?åH¨ÑuK?åHw > L?åHw C‡Å?åHEELY½?åHEAQÊ„?åH}-ÆÊ?åHy3@à?åGá´â'$?åGá°çªˆ?åG¯ìiÁÅ?åG¯èoNx?åG~#ÄV^?åG~Éì`?åGLZò ?åGLV÷©g?åG‘òzÖ?åGø#u?åFèÈÆvÌ?åFèÄÌ(¹?åF¶ÿmz?åF¶ûs5N?åF…5ç©Ë?åF…1ínV?åFSl4ç~?åFSh:µX?åF!¢U6ƒ?åF!ž[ «?åEïØHÝÃ?åEïÔN¾:?åE¾{0?åE¾ dö?åEŒC©U½?åEŒ?¯HÒ?åEZyp¶?åEZum?åE(®V­ª?åE(ª\³^?åDöãjê?åDößpí?åDÅPÞa?åDÅVö³?åD“M ·?åD“Iب?åDa˜$R?åDa}žOB?åD/µø¢s?åD/±þÖ²?åCýê,»à?åCýæ2ùn?åCÌ3‡v?åCÌ9ÎS?åCšRÈ?åCšNfô?åCh…»Ä>?åChº?åC6¹<øŠ?åC6µC[V?åCì‘Q¦?åCè—½Á?åBÓ¹88?åBÓ¿­¢?åB¡R´JD?åB¡NºÈý?åBo…‚Ω?åBo‰V²?åB=¸$ȸ?åB=´+Z?åB êš;Å?åB æ Öm?åAÚã+ ?åAÚéÏ?åA¨Nÿ4Ö?åA¨Kâ?åAv€îŸÁ?åAv|õVX?åAD²±ö?å?¶6©£?å?„j»W~?å?„fÂk3?å?RšÁ·;?å?R–ÈÔ@?å? Ê›~P?å? Æ¢¤¥?å>îúHó†?å>îöP#+?å>½)ÇÑ.?å>½%Ï #?å>‹Yïß?å>‹U2$?å>Yˆ9½w?å>Y„A ?å>'·/Ø?å>'³7,÷?å=õåù†r?å=õâä¨?å=Ä–ª)?å=Äž¯?å=’Ch>?å=’?Ù?å=`qK^Î?å=`mRØõ?å=.Ÿc?å=.›j›…?å<üÍNuŽ?å<üÉVU?å<Êû p?å<Ê÷«‡?å<™(Ÿ£š?å<™$§C?å?å6^{š¢?å6,§p˜?å6,£xèq?å5úÏ#)k?å5úË,–?å5Èö©Ô?å5Èò²º ?å5—š?å5— ±h?å5eE3³?å5eA<«¡?å53l6ªŒ?å53h?«ý?å5“ «?å5µË?å4Ϲ¸–‘?å4ϵÁª¦?å4à7’?å4Ü@¯ƒ?å4lŠÂ”?å4l“éL?å4:,²+D?å4:(»[O?å4R­HØ?å4N¶‚4?å3Öx|¥4?å3Öt…çã?å3¤ž Cž?å3¤š)ž?å3r×ä?å3r¿¡9e?å3@èãÍ%?å3@äí+É?å3àv?å3 Hl?å2Ý2÷ÿ¬?å2Ý/pô?å2«WÀO´?å2«SÉÊN?å2y|\õr?å2yxfy_?å2G Ê®ù?å2GœÔ<7?å2Å N‹?å2Áå?å1ãéàŽ?å1ãå'€q?å1² «ˆ?å1² T½?å1€0Á²·?å1€,Ëe>?å1NTQ¶ ?å1NP[qú?å1wµ—d?å1s¿\?å0êší{e?å0ê–÷Iä?å0¸½ù¨§?å0¸º€x?å0†àÚÊ?å0†Üãáí?å0UŽ‡ ?å0Tÿ˜qƒ?å0#&î?å0#"!u¶?å/ñHt*þ?å/ñD~(?å/¿j¥O/?å/¿f¯Uœ?å/ŒªÐ"?å/ˆ´ßâ?å/[®„mà?å/[ªŽ†ò?å/)Ð2 ?å/)Ì<,v?å.÷ñ´Oú?å.÷í¾{³?å.Æ W¨?å.ÆŒ³?å.”45Œ?å.”0?Mê?å.bU4?å.bQ>]Ê?å.0v Ì?å.0rZÐ?å-þ–®tC?å-þ’¸Î™?å-Ì·*‘?å-̳4y:?å-š×z4#?å-šÓ„¡?å-h÷žLÞ?å-hó¨Ã-?å-7— ù?å-7¡Š›?å-7d é?å-3n•Þ?å,ÓWw‰?å,ÓS Ñ?å,¡v{N?å,¡r…éµ?å,o•ÅP¬?å,o‘Ïõš?å,=´ä×?å,=°î·?å, Ó×6°?å, ÏáîE?å+ÙòžšN?å+Ùî©[6?å+¨:Xˆ?å+¨ E"Ã?å+v/ªÙR?å+v+µ¬à?å+DMï»6?å+DIú˜?å+lßá?å+hÆ?å*à‰öÐÚ?å*à†Àb?å*®§¹N;?å*®£ÄG?å*|ÅOö’?å*|ÁZøÂ?å*Jâ»Sb?å*JÞÆ^ä?å*ÿûFW?å*ü[-?å)çn?å)çŒ.?å)µ9øut?å)µ6œñ?å)ƒVµû6?å)ƒRÁ,?å)QsHE§?å)QoSÌ?å)¯X?å)‹º›~?å(í«êl>?å(í§õ¹ ?å(»Çúpj?å(»ÄÆŠ?å(‰ãß$³?å(‰ßê„'?å(Wÿ˜I;?å(Wû£²?å(&&Ï?å(&1tê?å'ô6ˆv8?å'ô2“ñ§?å'ÂQ¿¦³?å'ÂMË+v?å'lËTk?å'hÖâ?å'^‡¬Ä?å'^ƒ· /?å',¢aN?å',žlÀ ?å&ú¼ëBñ?å&ú¸öí?å&È×IðË?å&ÈÓU¤2?å&–ñ},?å&–íˆèÖ?å&e …ŸÁ?å&e‘eÐ?å&3%bÈÞ?å&3!n˜A?å&?g£?å&; @Z?å%ÏX˜WÁ?å%ÏT¤9Ì?å%qî¡ù?å%múY?å%k‹BÃ?å%k‡%7w?å%9¤äô?å%9 $âü?å%¼íH¸?å%¸ùP?å$ÕÕ– ¹?å$ÕÑ¢j?å$£î˜¾?å$£ê²Ä?å$reÎw?å$rqñÐ?å$@Œ± ?å$@˜ÝÎ?å$6ˆ†÷?å$2”¼ú?å#ÜNY1¬?å#ÜJeq?å#ªeþ’ö?å#ªb Û¢?å#x}xk ?å#xy„½ ?å#F”ÇC"?å#FÓžw?å#«êÛy?å#§÷@"?å"âÂã7B?å"â¾ï¥@?å"°Ù°{5?å"°Õ¼òˆ?å"~ðR‰?å"~ì_ °?å"MÉcò?å"MÕíî?å"R)?å"!åz?å!é35òe?å!é/B ?å!·I+¬Z?å!·E8RU?å!…^ö@??å!…[ï?å!St•Ò?å!Sp¢Hw?å!!Š ¿Ä?å!!†¾?å ïŸS7¾?å ï›` ?å ½´qu ?å ½°~I¬?å ‹ÉdYa?å ‹Åq7Z?å YÞ,Lj?å YÚ93¸?å 'òÉrØ?å 'îÖc{?åö;I÷?åöHCï?åÄ‚|\?åĪ?å’/ž¨Ò?å’+«µu?å`C±?å`?œÇ ?å.WUÛH?å.Sbú•?åüjðÆ??åüfýîá?åÊ~`û ?åÊzn-?嘑¦[j?嘳–·?åf¤ÀÉ?åf Î º?å4·°GO?å4³½•G?åÊtÙ>?åÆ‚0‹?åÐÝ`ª?åÐÙÁM?åžï}#°?åžëŠ©?åmÁ%†?ålýΘÔ?å;ÚGê?å;çÄŽ?å %ȯ‚?å !Ö5|?å×7Œ¢?å×3™«ñ?å¥I$³ì?å¥E2L‘?åsZ’š ?åsV <?åAkÕmÞ?åAgã.?å|í¸^?åxûm?åÝÛ9Ø?å݉è÷Ó?å«žžû?å«š«ÞL?åy¯5Í.?åy«CÕ?åG¿¢åo?åG»°¿l?åÏå¥Ì?åËó‰?åãßýjM?åãÜ Vö?å±ïêy?å±ëøo?åÿ¬³¸?åûº³ ?åNDå?åN RŠ?层u?å¿”v?åê-ôà?åê*87?å¸= έ?å¸9óZ?å†KøÿO?å†H-R?åTZ¹1?åTVÇLŠ?å"iLU?å"eZZ?åðw´;L?åðsÂ…S?å¾…ñâ…?徂5â?匔k?åŒÇË?åZ¡ìŸïR?å¾:¯Á?åŒEåJÀ?åŒAõ&b?åZM ø?åZIññ?å(Sð¾ˆ?å(P¬Ù?åöZ·b›?åöVÇZD?åÄaS˜P?åÄ]c™Q?å’gÅÆÙ?å’cÕÑ1?å`n Ð ?å`jãº?å.t+t`?å.p;‘h?åüz?åüv/Ah?åÊè¥Ô?åÊ{øÕŒ?嘅‡ö™?嘘/©?åfŠýt€?åf‡ ¶ç?å4H¾±?å4ŒY q?å•i·?å‘z ?å КaH?å Жqe·?å žŸ-ê¯?å ž›>Rv?å l£Ð§ ?å lŸá,?å :¨I`×?å :¤YÛO?å ¬˜w$?å °ÏOk?å ~Õe7s?å ~Ñv4À?å L×aý˜?å LÓs>?å Ù4̸?å ÕEܶ?å èÚ݆­?å èÖî ?å ¶Ü\q,?å ¶Øm“Ü?å „Ý±n?å „Ùš?å RÞÜ€u?å RÚíµÖ?å ßÝŠ:?å ÛîÈô?åîà´m6?åîÜŵI?å¼áaj?å¼ÝráÖ?åŠáäÕ«?åŠÝö0p?åXâ=ý?åXÞOa¬?å&âmS?å&Þ~ýÊ?åôârê¸?åôÞ„a‡?åÂâN¶A?åÂÞ`6i?åâpö?åÞúx?å^ሣ?å^Ýš5è?å,àæʘ?å,ÜøfÌ?åúàê¶?åúÜ,C?åÈß%I?åÈÛ6÷û?å–ÞèÕ?å–Ú¡?ådܼŠŽ?ådØÎL&?å2ÛI¶r?å2×[d?åÙ­ Ö?åÕ¾à!?åÎ×æÞ?åÎÓøkƒ?åœÕö?ª?åœÒ&§?åjÓ܈?åjÏîxt?å8јÄ?å8ͪ½Ê?åÏ+{¾?åË=~Ç?åÔÌ”²*?åÔȦ¾?å¢ÉÔ¾?å¢Åæz?åpÆéÝ?åpÂû¼ó?å>ÃÕ½(?å>¿çå˜?å À—â¾?å ¼ªˆ?åÚ½0·û?åÚ¹Bó?娹Ÿý…?娵²B?åvµå1„?åv±÷Z?åD²Ü?åD®3=?å­óH?åª`Ò?åà©»¡I?åà¥Î ,?宥ZÂ5?审m5r?å| ÐDð?å|œâÁ†?åJœM×?åJ˜.ÓÈ?å—>?å“Q,Ù?åæ’7šî?åæŽJ3“?å´å_?å´‰‡]?傇¬ã²?傃¿ ?åP‚)º;?åP~û§?äÿ*:²$è?äÿ*6Å@z?äþø37õÂ?äþø/K¯?äþÆ+”=æ?äþÆ'§l.?äþ”#Ç!œ?äþ”ÚY>?äþbЂÏ?äþbãÃË?äþ0°"3?äþ0Ãl‰?äýþ fÊ ?äýþz»?äýÌóø¨?äýËÿU´?äý™úWÒX?äý™ök8¾?äýgñ’Î?äýgí¥‡?äý5è£/¸?äý5䶨Ó?äýߊ˜l?äýÛžâ?äüÑÖHÙÂ?äüÑÒ\e“?äüŸÌÝr?äüŸÈñD?äümÃI o?äüm¿\¨ö?äü;¹‹!)?äü;µžÉ ?äü ¯¤à?äü «·Î?äû×¥“*?äûס§WÁ?äû¥›Y¥?äû¥—mi?äûsöz2?äûs G?äûA†jv?äûA‚}ö?äû{´U´?äûwÈ5¶?äúÝpÕ¤©?äúÝléŽ?äú«eÍŠÂ?äú«aá}z?äúyZœ ?äúyV°.?äúGOA­p?äúGKU²ß?äúC½Œ¹?äú?Ñ›‚?äùã8”+?äùã4$¬P?äù±,:cd?äù±(N„ä?äù :».?äùNæ ?äùMDd?äùM&x›?äùÁ?äùÕ?¯?äøèûFQ©?äøè÷Z˜—?äø¶î¢xr?äø¶ê¶Èº?äø„áÕ»×?äø„Ýê{?äøRÔßy5?äøRÐóÜ5?äø Ç¿õð?äø ÃÔbK?ä÷îºwÚÕ?ä÷P‹?ä÷¼­d?ä÷¼©ã0?ä÷ŠŸk×/?ä÷Š›€_œ?ä÷X‘¨X>?ä÷X¼ê?ä÷&ƒ»É??ä÷&Ðdd?äöôu¦-H?äöôqºÑÈ?äöÂggê×?äöÂc|˜²?äöY?äöUÔH?äö^JoÐ?äö^F„±?äö,;¶£ª?äö,7Ëm™?äõú,ÔI?äõú(èé“?äõÈÈз?äõÈÝ­]?äõ–”“È?äõ– ©yÊ?äõcÿ7b?äõcûLQî?äõ1ï±?äõ1ëÆ¿?äôÿà~?äôÿÜ”?äôÍÐ)ж?äôÍÌ>Ü(?äô›À)/p?äô›¼>D>?äôi¯ÿg?äôi¬…>?äô7Ÿ¬Þ?äô7›Â–?äô1—v?äô‹FÈX?äóÓ~‹ è?äóÓz D&?äó¡m¹??äó¡iÎaÙ?äóo\¾zš?äóoXÓÇ?äó=Kš¾¾?äó=G°?äó :N/ï?äó 6c?äòÙ(Ø?äòÙ$íø?äò§:Bb?äò§O´É?äòurÈ®?äòuˆDq?äòBó‚ˆD?äòBï˜ c?äòáic?äòÝ~ñ™?äñÞÏ&øþ?äñÞË<Ö?äñ¬¼¼†?äñ¬¸Ñ´»?äñzª(R?äñz¦=ý?äñH—kû"?äñH“¯?äñ„†Œ)?äñ€œIs?äðäqxŒø?äðämŽSŸ?äð²^A|F?äð²ZWLI?äð€Jâ?äð€F÷Ûï?äðN7YžŒ?äðN3oI?äð#¨&?äð½ý@?äïêÎDö?äïê ä:k?äï·ûËÙÎ?äï·÷áØ ?äï…ç o†?äï…ã¶wµ?äïSÓL*>?äïSÏb;Ê?äï!¾Ïp:?äï!ºå‹#?äîïª)ÀB?äîï¦?äˆ?ä[¼?äqð_?äî‹€döp?äî‹|{-p?äîYkE^m?äîYg[žÊ?äî'UýÒ?äî'Rh‹?äíõ@Œ[¿?äíõ<¢®Õ?äíÃ*òµ?äíÃ' ‚?äí‘0ô,?äí‘GYü?äí^ÿF4¼?äí^û\£é?äí,é2»ì?äí,åI4v?äìúÒöÎä?äìúÏ PÌ?äìȼ’‘¿?äìȸ©?äì–¦ƒU?äì–¢÷?äìdOèÎ?äìd‹f†Í?äì2xrN?äì2tˆ®«?äìak]²?äì]‚l?äëÎJçÏD?äç²:ÿN ?äç€$@¦Â?äç€ X.å?äçN næ(?äçN†w©?äçîr¸¶?äçêŠS–?äæéÓN·?äæéÏe³õ?äæ·¸î6?äæ·´›Ò?äæ…œ‹™5?äæ…˜£P/?äæS€íò¼?äæS}³?äæ!e'ýÓ?äæ!a?lj?äåïI9{€?äåïEQN”?äå½-#Ã?äå½):ð5?äå‹ä$§?äå‹ ü w?äåXô|±8?äåXð” g?äå&×í@n?äå&Ô8û?ääô»5r[?ääô·MtF?ääžU‹ù?ääšm—B?ääMoS?ää}eƒû?ää^dþr?ää^`5y?ää,FÄ~O?ää,BÜ¥´?äãú)CÐû?äãú%\¿?äãÈ šùs?äãȳ3•?äã•íÉÙÈ?äã•éâI?äãcÏÐ×æ?äãcËé$Å?äã1±¯rñ?äã1­ÇÉ/?äâÿ“fØ?äâÿ~pt?äâÍtôr­?äâÍq Û¨?äâ›VZÝf?äâ›RsOÀ?äâi7™3 ?äâi3±®Æ?äâ7¯v©?äâ7ÇûÀ?äâùiP?äâõµ÷Æ?äáÒÚcOô?äáÒÖ{çÉ?äá »{?äá ·1®?äán›wG.?äán—ñÀ?äá<{Å<Ø?äá?äÖD”~ ?äÖD0??äÖk„Ú?äÖgŸ¤U?äÕàBÍ Î?äÕà>çôq?äÕ®í#?äÕ®m'?äÕ{ðæÏ\?äÕ{íµÁ?äÕIǸ~Û?äÕIÃÓn ?äÕžb¡ ?äÕš}šÆ?äÔåtå|X?äÔåq~ß?äÔ³K@¯l?äÔ³G[»S?äÔ!t^´?äÔsü?äÔN÷€ï¸?äÔNóœa?äÔÍfã?äÔÉ*í?äÓê£#zU?äÓêŸ>«À?äÓ¸x¹š¿?äÓ¸tÔÕ‹?äÓ†N(¨Æ?äÓ†JCìó?äÓT#p$?äÓT‹q•?äÓ!ø0P?äÓ!ô«‡??äÒï͉N?äÒïɤr?äÒ½¢Zjr?äÒ½žuÔ#?äÒ‹w}d?äÒ‹sðv?äÒYK‡nó?äÒYG¢ëf?äÒ'ãl?äÒ'þ†@?äÑôôUž?äÑôð2äÓ?äÑÂÈ$³*?äÑÂÄ@KÀ?äÑœ W?äј%ù?äÑ^oÉ @?äÑ^kä´™?äÑ,C`j8?äÑ,?|ò?äÐúÐ\ ?äÐúì?äÊ´3Ò ?äÊ´/îôU?äÊ‚3‡À?äÊþP{v?äÊOÐn;?äÊOÌ‹8©?äÊž‚ž?äÊšŸ?äÉëlnŒŽ?äÉëh‹œk?äɹ:4‘ç?äɹ6Q«'?äɇÓ¸P?äɇðÚò?äÉTÕKÁ4?äÉTÑhí9?äÉ"¢œÐF?äÉ"žº­?äÈðoÇJÁ?äÈðk䉊?äȾ<ÊNC?äȾ8ç–o?äÈŒ ¦Ã?äȌĞ?äÈYÖ\j?äÈYÒyÅ€?äÈ'¢ë2?äÈ'Ÿj†?äÇõoRû.?äÇõkphä?äÇÃ;”+­?äÇÃ7±¢Æ?äÇ‘®Y$?äÇ‘ËÙ ?äÇ^Ó¡èÀ?äÇ^Ï¿rž?äÇ,Ÿn›õ?äÇ,›Œ/6?äÆúku°?äÆúg2T?äÆÈ6“º`?äÆÈ2±`f?äÆ–ì ¼?äÆ•þ º%?äÆcÍŠl?äÆcÉ;C9?äÆ1˜(¿Z?äÆ1”F‰?äÅÿc Ä?äÅÿ_*ÔV?äÅÍ-ÊŠT?äÅÍ)è_I?äÅšøaFþ?äÅšô%V?äÅhÂÑ£à?äÅh¾ï‹›?äÅ6 ü?äÅ6‰9?äÅW>¹?äÅS[ý9?äÄÒ!:L ?äÄÒXOí?äÄŸë¾`?äÄŸç-˧?äÄm´¾ž(?äÄm°Ü´Ó?äÄ;~G/½?äÄ;zeOÊ?äÄ G¨±¼?äÄ CÆÛ-?äÃ×ãëc?äÃ× 7?ääÙø}|?ääÖ¹³?äÃr¢æ)†?äÃrŸo ?äÃ@k­–?äÃ@gËå?äÃ4NcÁ?äÃ0l¼"?äÂÛüÈ•«?äÂÛøæ÷o?ä©ÅOd?ä©Á:ºŒ?äÂwIÕF?äÂw‰hIÑ?äÂEUP†±?äÂEQo ?äÂ0ém?äÂOp¿?äÁàäê¾ý?äÁàá O²?äÁ®¬|È?äÁ®¨š¹á?äÁ|så ?äÁ|pº‡?äÁJ;'i?äÁJ7Fð?äÁBø?äÁþa®[?äÀåÉ8)?äÀåÅVèÂ?äÀ³ÞU?äÀ³Œ%§`?äÀV®ÙL?äÀRÍ«º?äÀO0~ü?äÀOOZÎ?äÀ㋱š?äÀߪ–Ð?ä¿ê©¿ñR?ä¿ê¥Þßì?俸oÎ(?俸kìý&?俆5µý?俆1Ô^?ä¿Sûvn?ä¿S÷•xÊ?ä¿!Á :?ä¿!½0c?ä¾ï†…DÍ?ä¾ï‚¤bZ?ä¾½KÒÿþ?ä¾½Gò&ð?例ú_d?例 ¹?ä¾XÕûeã?ä¾XÒŸœ?ä¾&šÕ´`?ä¾&–ô÷}?ä½ô_‰¯Ì?ä½ô[¨üM?ä½Â$[?ä½Â 6°í?ä½è~˜P?ä½ä÷š?ä½]¬¿«ê?ä½]¨ß—?ä½+pÚx ?ä½+lùê?ä¼ù4Ξ?ä¼ù0î?ä¼Æøœ?ä¼Æô¼g?ä¼”¼DG`?ä¼”¸cÕŸ?ä¼bÅÑ\?ä¼b{åhÿ?ä¼0C!º?ä¼0?@¢Á?ä»þUü ?ä»þu¦v?ä»ËÉdÃ8?ä»ËÅ„w?ä»™ŒM9€?ä»™ˆlö´?ä»gO‚n?ä»gK/I?ä»5«_ ?ä»5 Ë/?ä»Ô!V?ä»ÐA/ò?äºÐ–pç’?äºÐ’ÊX?亞XšVÕ?亞TºC?äºlÇä?äºl½½s?äº9Üzü\?äº9ØšûO?亞1÷$?亚Qÿ|?ä¹Õ_ÂÛÆ?ä¹Õ[âíƒ?ä¹£!-­(?ä¹£MÈJ?ä¹pârMŒ?ä¹pÞ’r?ä¹>£Ÿ8?ä¹>Ÿ°Í#?ä¹ d‰ø?ä¹ `©>H?ä¸Ú%[%Ï?ä¸Ú!{f„?丧æ@?丧â'iZ?ä¸u¦Ö?ä¸u¢­jU?ä¸Cfí0?ä¸Cc Œö?ä¸'',œ?ä¸#G’ä?ä·Þç;P™?ä·Þã[ÀF?ä·¬§(ûÔ?ä·¬£Itæ?ä·zfñƒ?ä·zc—ú?ä·H&“?ä·H"³©ñ?ä·æ÷×?ä·â/?ä¶ã¥dÆD?ä¶ã¡…dê?䶱d•¹?䶱`µ¶Ä?ä¶#Ÿk?䶿ÁÛ?ä¶Lâƒ|?ä¶LÞ£ÊQ?䶡A/l?ä¶aó¦?äµè_Ù1ç?äµè[ùÿ‡?䵶K¼Û?䵶l“à?䵃ܘŠ?䵃ظïô?äµQš¾n?äµQ–ßWá?äµX¼ßg?äµTÝÒœ?ä´í“o?ä´í´k´?ä´ºÔD ?ä´ºÐe ?ä´ˆ‘ΰw?ä´ˆï¿Ü?ä´VO3GG?ä´VKT`?ä´$ rˆ?ä´$“>¸?ä³ñÉŠñé?ä³ñŬ~?䳿†~, ?䳿‚Ÿa?ä³CKl?ä³?lªn?ä³Zÿò´Î?ä³Züü”?ä³(¼t)À?ä³(¸•zë?ä²öxÏŒ—?ä²ötðç(?ä²Ä5Aø?ä²Ä1&¥ï?䲑ñ ?䲑í6xì?ä²_¬þ˱?ä²_© Bs?ä²-hÂÆ^?ä²-däF†?ä±û$a?ä±û ‚¨•?ä±ÈßÙvØ?ä±ÈÛû Ë?ä±–›+ñ>?ä±–—M—?ä±dVXÒ=?ä±dRzwû?ä±2_ºü?ä±2 j!?ä°ÿÌ@Îî?ä°ÿÈb‡y?ä°Í†ü1€?ä°Íƒóq?ä°›A‘å’?ä°›=³°é?ä°hüî?ä°hø#¿?ä°6¶Ln?ä¦2 ª×?ä¥ÿÃ1!l?ä¥ÿ¿Tèm?ä¥Íu¶š«?ä¥ÍqÚk?䥛(Â?䥛$:à’?ä¥hÚR?ä¥hÖuêP?ä¥6Œgßv?ä¥6ˆ‹Ì?ä¥>X³,?ä¥:|©2?ä¤Ñð$# ?ä¤ÑìH#?䤟¡Êtž?䤟î}s?ä¤mSKÉn?ä¤mOoÛ«?ä¤;§ãô?ä¤;Ëÿ™?䤵Þç~?䤲 Š?ä£Öfð¶i?ä£ÖcäÝ?䣤Üò*?䣤*?ä£qȤ€Ì?ä£qÄÈÂ?ä£?yG$9?ä£?uknä?ä£ )Ä]o?ä£ %豂?ä¢ÚÚ£?ä¢ÚÖ@î?䢨ŠOÀ¨?䢨†t'‹?ä¢v:]ðR?ä¢v6‚`?ä¢CêFÁ?ä¢Cæk:É?䢚 ø…?䢖/{ ?ä¡ßI©Ö¹?ä¡ßEÎc;?䡬ù$Ä?䡬õH–¯?ä¡z¨y ?ä¡z¤·s?ä¡HW¨¾V?ä¡HSÍg?䡳ù»?ä¡Ø«Þ?ä ãµšK^?ä ã±¿é?ä ±d[4V?ä ±`ùJ?ä ÷š~?ä hÚ?ä LÁnÞƒ?ä L½“¶G?ä oÁ6?ä kåäb?äŸèî"?äŸèw¶?䟵Ë÷>@?䟵È2®?ä–geo?ä•áçï?ä•á?²m?ä•®¸Î™·?ä•®´õmž?ä•|__¥Õ?ä•|[†ƒ&?ä•JÌOÀ?ä•Jó6{?䕬ºŸ?䕨;ªÃ?ä”åR8¨ˆ?ä”åN_¢?䔲ø8J?䔲ô_B?䔀ž9?䔀š:Eh?ä”NCÉá*?ä”N?ðöõ?ä”é\7Þ?ä”åƒW?ä“éŽÊ?ä?ä“éŠñh„?ä“·4Û³?ä“·0; ¼?ä“„Ù9NÁ?ä“„Õ`Š5?ä“R~:›Ò?ä“Rzaà¯?ä“ #d¸?ä“ >³?ä’íÇÐ 2?ä’íÃ÷dä?ä’»ld¾?ä’»h‹wÙ?ä’‰ÓÄÎ?ä’‰ û/T?ä’Vµ›w?ä’V±Gf?ä’$YFÛ’?ä’$UnXì?ä‘ñýJ)~?ä‘ñùq°B?ä‘¿¡)Á?ä‘¿P–ï?ä‘Dã¶È?ä‘A Pa?ä‘Zèz?ä‘Zä¡¿ ?ä‘(‹ìš:?ä‘(ˆF§?äö/:’™?äö+bHq?äÃÒdhÞ?äÃÎŒ( ?ä‘uiÿ~?ä‘q‘È*?ä_K™â?ä_skù?ä,»¹š?ä,·0•?äú]¡â¤?äúYÉÇ?äÈÌ?äÇü?"?ä•¢h8?ä•žø?äcD“ ?äc@»!È?ä0æ˜O?ä0âÀå?äŽþˆxáÓ?äŽþ„ õÒ?äŽÌ*5̃?äŽÌ&]éí?䎙ËΖ‰?䎙Çö½^?äŽgmBÁ?äŽgijñÁ?äŽ5’ñ¡?äŽ5 »+K?䎯¿)­?䎫çlÂ?äÐPÇ Œ?äÐLïX ?äñªÚ“?äíÓ0}?äk’j¹Ì?äkŽ“!?ä93‹²?ä9/.ôr?äÓ~v?äϦ„¡?äŒÔsÑÑþ?äŒÔoúM”?䌢+¥?䌢)°¦?äŒo´ Ã?äŒo°5Qù?äŒ=Sô[ò?äŒ=PóÈ?äŒ ó··?äŒ ïàXE?ä‹Ø“W8X?ä‹Øã?䋦2Ò¢*?䋦.ûVA?ä‹sÒ*|?ä‹sÎRÔþ?ä‹Aq]zÍ?ä‹Am†A»?ä‹lï$?ä‹ •¿}?äŠÜ¯X6¾?äŠÜ«?䊪NÕf?䊪JH¸•?äŠwìÃ,’?äŠwèì,?äŠE‹BŸÌ?äŠE‡k•Ò?äŠ)žR?äŠ%ÇQ†?ä‰àÇÖ±?ä‰àÃÿ?䉮eé½\?䉮bÏ£?ä‰|Ù¼[?ä‰|Ø?ä‰I¡¥å,?ä‰IÏ J?ä‰?N:”?ä‰;wi?äˆäÜÒŸ?äˆäØû×?䈲z3Uã?䈲v\—C?䈀p?䈀™KÜ?äˆM´ˆÃ•?äˆM°²Ë?äˆQ}à´?äˆM§>V?ä‡èîO®?ä‡èêx¼?䇶Šü´À?䇶‡&%:?䇄'†‘l?䇄#° Q?ä‡QÃìrü?ä‡QÀöL?ä‡`.œ¤?ä‡\X)`?ä†ìüM1f?ä†ìøvÇŽ?䆺˜G³?䆺”qR¦?䆈4¥T?䆈0HNS?ä†UÏÒ+(?ä†UËûÝ“?ä†#kaæœ?ä†#g‹¢r?ä…ñÍú«?ä…ñ÷¿í?ä…¾¢)¤?ä…¾ž?øR?ä…Œ=:Öí?ä…Œ9d¯?ä…YØ;å?ä…YÔeƘ?ä…'s6—?ä…'oC!‰?ä„õ ÒÎ@?ä„õ üÂ?䄨hï6?䄤’ìÿ?ä„BÛœÎ{Ì?äœ:ùX?äi×Z?äiÓ.÷ý?ä7oÖ¦?ä7kA~ ?ä’?ä0Åc?ä€ÒžÑUf?ä€Òšü¤?䀠6y<Ì?䀠2¤v?ä€mÍýí¦?ä€mÊ(º½?ä€;e^ÉÈ?ä€;a‰ K?ä€üœI?ä€øÆô9?äÖ“¶Pš?äÖá9÷?ä¤*¬ 5?ä¤&×’þ?äqÁÆà?äq½ªÃ?ä?X/fÓ?ä?TZlv?ä î»Ã?ä êæÒ)?ä~Ú…$ž?ä~ÚO¶•?ä~¨jµ?ä~¨•?ä{NýÃc?ä{”·kŠ?ä{ã7?äzê(^«?äzê$Š€?äz·»â¢?äz·¸€ë?äz…OC´Ú?äz…Koœ´?äzRâdX?äzRÞ­UŸ?äz u›Ó×?äz qÇ΋?äyî“FJ?äyî¿Jl?äy»›g~-?äy»—“‹¼?äy‰.Þ”?äy‰*Dõ?äyVÀ§)ô?äyV¼ÓJ_?äy$Sc?äy$O>ŒÛ?äxñåZl\?äxñᆟ¡?äx¿wH±?äx¿s«…d?äx €úº?äx­@Ú?äxZ›_Åo?äxZ—Œý?äx(-‹b?äx()Gä]?äwõ¾´/1?äwõºà‘š?äwÃP*4?äwÃLVŸÚ?äwá|Ûà?äwÝ©Q$?äw^r¬©ñ?äw^nÙ(£?äw,¹`´?äw+ÿåèÓ?ävù”£ƒN?ävùÐÛ?ävÇ%jsê?ävÇ!—å?äv”¶ut?äv”²;Ý?ävbFªº?ävbB¼X‘?äv/Öì?äv/Ó»Y?äuýg#ï,?äuýcP¯ß?äuÊ÷8úÔ?äuÊóeÄô?äu˜‡*Ém?äu˜ƒWœû?äufù}Ç?äuf&ZÃ?äu3¦¥šò?äu3¢Ò\?äu6."ß?äu2[·?ätÎÅ”ÿ?ätÎÁÁF?ätœT×¼?ätœQ"q?ätiã÷¬?ätià$%Ï?ät7rôI°?ät7o!_@?ätÎÒŒ?ätýûñŠ?äsÒ†ƒ?äsÒŒ³>ï?äs ˜ž?äs GÊy?äsm­Œ;v?äsm©¹vÀ?äs;;ÚÁ“?äs;8K?äsÊmÑ?äsÆ3»÷?ärÖXÃ+?ärÖT=¿?är£åõãÇ?är£â#DÉ?ärqs¹2”?ärqoæ?är?YÒP?är>ý‡F.?är Ž×Ū?är ‹Bø?äqÚ2¯?äqÚ`5Ú?äq§©jÑ~?äq§¥˜a¨?äqu6€j?äqu2­©?äqBÃrËÅ?äqB¿ nÌ?äqPB©?äqLpU}?äpÝÜï©ç?äpÝÙ_Ë?äp«iz/?äp«e§Ð‚?äpxõâš?äpxòÊ[?äpF‚'°?äpF~Tïß?äpIˆ*?äp wcÉ?äoášIC¹?äoá–w(Æ?äo¯&&ð?äo¯"Tl?äo|±àx¶?äo|®p ?äoJ=xW¦?äoJ9¦Xÿ?äoÈírY?äoÅ}!?änåT?Ë~?änåPmßµ?än²ßoÅå?än²ÛãŠ?än€j}?än€f«+0?änMõg¨Ú?änMñ•Ù^?än€/¶Î?än|]ðÀ?ämé ÕP±?ämé”?äm¶•Xy.?äm¶‘†Åþ?äm„¹2ò?äm„ç‰0?ämQ©÷Š?ämQ¦%`8?äm4dÄ?äm0@Íá?älì¾ bP?älìº9ÔÜ?älºGáÛÐ?älºDWÌ?äl‡Ñ•³í?äl‡ÍÄ9W?älU['Mf?älUWUÜ??äl"ä–*Ó?äl"àÄÃ?äkðmânå?äkðj?äk½÷ |[?äk½ó;'‚?äk‹€õÐ?äk‹|Bªf?äkYù>?äkY'ü ?äk&‘¼•?äk&êß ?äjô\…3?äjô‹V?äjÁ¢Ú‰ˆ?äjÁŸ cÛ?äj+6'D?äj'e ?äj\³oA?äj\¯ž.@?äj*;…ù–?äj*7´ð7?äi÷Ãz“Ž?äi÷¿©“ž?äiÅKLÑ?äiÅG{Û?äi’Òúò—?äi’Ï*†?äi`Z…$B?äi`V´@¡?äi-á짛?äi-ÞÍj?ähûi1ÿR?ähûea.?ähÈðTî?ähÈì„&²?äh–wUvc?äh–s„¸€?ähcþ3»?ähcúc?äh1„ïÞ²?äh13®?ägÿ ‰c÷?ägÿ¸Âc?ägÌ’­€?ägÌŽ0\?ägšUø?ägš…C?äggžˆX?äggš·Ò¾?äg5$˜¾H?äg5 ÈBs?ägª†óp?äg¦¶ ?äfÐ0Rº&?äfÐ,‚Q1?äfµü?äf²+µ?äfk;ƒfÓ?äfk7³¾?äf8Àè2?äf8½åv?äfF*¹?äfBZvZ?äeÓËKÎ?äeÓÇzæ?äe¡PIG€?äe¡Ly*?äenÕ%SH?äenÑU,b?äeï6?äbÞˆ/?äbÞ„_jÍ?äb¬ -Rd?äb¬]¯¡?äbyŽ ™?äbyŠ:=?äbGÃï,?äbG ô_I?äb“[ö?äbŒo‘?äaâÒ–?äaâ“”?äa¯˜&!”?äa¯”V®?äa}XK”?äa}ˆás?äaJœh±,?äaJ˜™P|?äaW?äa‡½Þ?ä`å #Z?ä`åœT L?ä`³!Í®?ä`³þ~P?ä`€£V1‹?ä`€Ÿ†ö?ä`N$¼é0?ä`N í·²?ä`¦¬g?ä`¢2„Z?ä_é'$Á?ä_é#U%?ä_¶¨%`?ä_¶¤VJï?ä_„)•¸?ä_„%5‰ý?ä_Q©Á¡ ?ä_Q¥òŸV?ä_*]&?ä_&Ž-9?ä^ìªÖf+?ä^ì§vÃ?ä^º+.*?ä^º'_2?ä^‡«cƒ?ä^‡§”¦~?ä^U+w¤â?ä^U'¨ÑÌ?ä^"«iÌÎ?ä^"§›*?ä]ð+:Y?ä]ð'k]%?ä]½ªè¹ ?ä]½§J?ä]‹*u¢?ä]‹&¦õ>?ä]X©à¼œ?ä]X¦»?ä]&)*)¶?ä]&%[F?ä\ó¨Pù?ä\ó¤…ú?ä\Á'R²m?ä\Á#„*ß?ä\Ž¦3oh?ä\Ž¢dñL?ä\\$ò°A?ä\\!$;•?ä\)£¸.?ä\)ŸÁLô?ä[÷" )M?ä[÷<Ç„?ä[Ä e@?ä[Äœ–­è?ä[’œÒ ?ä[’΃#?ä[_œ³â?ä[_˜äÉm?ä[-§_´?ä[-Ù#°?äZú˜yÇ%?äZú”«”’?äZÈ*§{?äZÈ\~Z?äZ•“¹ãv?äZ•ëÃÆ?äZc'=è?äZc Y'©?äZ0Žs?äZ0Š¥ N?äYþ w©?äYþÏtM?äYˈ¥üŠ?äYË„Ø ?äY™Œê"?äY™¾ù©?äYf‚Rbì?äYf~„{å?äY3þõÊ#?äY3û'ì?äY{wáª?äYwª †?äXÎ÷Ø º?äXÎô B?äXœt·?äXœpHÌv?äXið3¦ù?äXiìeï*?äX7l/;=?äX7haŒß?äXè M$?äXä;¨8?äWÒcÁŸ‰?äWÒ_ô?äWŸßXÔ_?äWŸÛ‹BV?äWmZÍï\?äWmWfÅ?äW:Ö!Ò$?äW:ÒTRþ?äWQT?ž?äWM†Éë?äVÕÌe†?äVÕÈ—®E?äV£GTez?äV£C‡ª?äVpÂ"bÎ?äVp¾U p?äV><εŽ?äV>9e¢?äV ·Y  ?äV ³ŒY‘?äUÙ1Ãd–?äUÙ-ö'Ž?äU¦¬ &Ô?äU¦¨=ó>?äUt&1è2?äUt"d¾?äUA 7K¼?äUAœj+ ?äU^?äUMý?äTÜ“Ý„c?äTÜv•?äTª ~¾A?äTª ±¹æ?äTw†þ„á?äTwƒ1‰÷?äTE\» ?äTDüÉ’?äTy™Âà?äTuÌÚÛ?äSßòµž?äSßîèA ?äS­k¯S>?äS­gâ~?äSzäˆ@?äSzà»tÓ?äSH]?Ê/?äSHYsò?äSÕÖº?äSÒ Yð?äRãNK\c?äRãJ~­ ?äR°ÆŸ*t?äR°ÂÒ„Ž?äR~>ÑŸ]?äR~;ê?äRK¶ã0?äRK³Š/?äR.Ó'??äR+°?äQ榡ÿÇ?äQæ¢Õ«?äQ´OÉ7?äQ´ƒRŽ?äQ•Ûç?äQ’yÙ?äQO Fû?äQO z—@?äQ„çß?äQ€Ä?äPéû¹h?äPé÷í?‰?äP·rÁV¨?äP·nõ;?äP„é¨l?äP„åÛßr?äPR`kà/?äPR\Ÿ«¨?äP× í ?äPÓ@ ?äOíMŒÉá?äOíIÀ¨>?äOºÃëY?äKÇäV½ ?äK•[Éßr?äK•Wþ±?äKbÏPrP?äKbË…*?äK0B¶ú?äK0>êÔ?äJýµúÃý?äJý²/Ž–?äJË)§¼?äJË%S{Ç?äJ˜œ! ü?äJ˜˜V~{?äJf²T?äJf 8™G?äJ3ÄžÓ?äJ3}ù9?äJôeÛ?äJðšµ?äIÎfäpô?äIÎct@?äI›ÙBüp?äI›Õx 0?äIiK€¬ç?äIiGµÃ?äI6½%¨?äI6¹ÒEO?äI/™'Ë?äI+ÎPæ?äHÑ¡t6á?äHÑ©ip?äHŸ.U€?äHŸc‘‚?äHl„Ç¥ö?äHl€üëk?äH9ö@Jš?äH9òu™ƒ?äHg˜&ñ;<2Ž?ä>ñ7s=Ì?ä>¾¦•Ï-?ä>¾¢Ìãà?ä>ŒΦ¾?ä>ŒÄæ?ä>Y|ç:„?ä>Yyb!?ä>&çßÌ_?ä>&äýp?ä=ôR·à,?ä=ôNï²?ä=Á½oxv?ä=Á¹¦¼q?ä=(öÇ?ä=$>D7?ä=\’}¿U?ä=\Žµ:?ä=)üÔ’®?ä=)ù ó?ä<÷g ô¬?ä<÷cB^{?ä<ÄÑ È:?ä<ÄÍX;~?ä<’;®*?ä<’7N*ã?ä<_¤ìi·?ä<_¡#ïå?ä<-¡~Ç?ä<- Ùj?ä;úx6Í?ä;útnf—?ä;Ç᫺?ä;ÇÝã\¬?ä;•K'?ä;•G7Ó’?ä;b´4ÖA?ä;b°l‹¸?ä;0I Ò?ä;0€É¾?ä:ý†<ç}?ä:ý‚t¯Þ?ä:Êï þ?ä:ÊëHÞÔ?ä:˜WÄÿJ?ä:˜SüÚ—?ä:eÀX¡J?ä:e¼† ?ä:3(Ì)?ä:3%`?ä:‘}?ä:WtÁ?ä9ÍùRÛ˜?ä9ÍõŠÜº?ä9›aeÔT?ä9›]Þë?ä9hÉYù?ä9hÅ‘?ä961+Úì?ä96-cøn?ä9˜ß-?ä9•T?ä8Ñr ?ä8Ðüª4y?ä8žgä¡‚?ä8ždÛd?ä8kÏ7GL?ä8kËoŠ£?ä896jVÔ?ä892¢£¢?ä8|õ>?ä8™µK?ä7Ôoƒõ?ä7Ô§ã®?ä7¡kB%!?ä7¡gzŽO?ä7nÑôÛL?ä7nÎ-Mð?ä7<8‡‰Y?ä7<4Àr?ä7 žù$#?ä7 ›1©²?ä6×HýK?ä6׌O?ä6¤kx¾ö?ä6¤g±Wq?ä6qшªä?ä6qÍÁLÔ?ä6?7x„Z?ä6?3±/À?ä6 H?ä6 ™Aø?ä5Úøˆp?ä5Ùÿ1FÁ?ä5§hˆ9¥?ä5§dÁl?ä5tÍø!¯?ä5tÊ0òì?ä5B3H#s?ä5B/€þ&?ä5˜xAs?ä5”±%œ?ä4Üýˆ^Ÿ?ä4ÜùÁL>?ä4ªbx}t?ä4ª^±t‰?ä4wÇHÀ?ä4wÃÀ?ä4E+ù(ú?ä4E(22û?ä4‰{€?ä4ŒÂŽö?ä3ßôúñ?ä3ßñ35Þ?ä3­YKÎ?ä3­U„*1?ä3z½{À;?ä3z¹´ð?ä3H!Œ¯‚?ä3HÅèÑ?ä3…}´?ä3¶÷T?ä2âéO?ä2âåˆ]M?ä2°Mˆa?ä2°I9Þ?ä2}°‘ýk?ä2}¬Ë\“?ä2Kñ?ä2K=Y¡?ä2wUÇÊ?ä2s9Þ?ä1åÚˆ‘?ä1åÖÁ~?ä1³=š„B?ä1³9Ô C?ä1€ Oe?ä1€œÆÝÝ?ä1N`fx?ä1Mÿ™þf?ä1f¬k?ä1bMMÏ?ä0èȧCS?ä0èÄàî.?ä0¶+!?ä0¶'TÂr?ä0ƒoNv?ä0ƒ‰© =?ä0P”?ä0PëÝOÒ?ä0Q¸\Î?ä0Mò-‚?ä/ë³­Ž†?ä/ë¯çh±?ä/¹‚á?ä/¹¼Ä¼?ä/†w8µ¾?ä/†sr¢Ö?ä/SØΰC?ä/SÕ¦Ñ?ä/!:Dò¾?ä/!6~òÄ?ä.î››ÞX?ä.î—ÕçÔ?ä.»üÓ6v?ä.»ù Ih?ä.‰]êžð?ä.‰Z$»Y?ä.V¾â˜z?ä.V»¾Z?ä.$»%›?ä.$õTò?ä-ñ€sê'?ä-ñ|®"ô?ä-¾á fÕ?ä-¾ÝG©?ä-ŒA‡?~?ä-Œ=Á‹9?ä-Y¡á?ä-Yžm4?ä-'ïsÌh?ä"«:° Ì?ä"x˜Àj?ä"x”NF?ä"Eñ§Z?ä"Eíͯ?ä"Jðd>?ä"G,Õ ?ä!à¤1Wî?ä!à mÒ3?ä!­ýSEô?ä!­ùɱ?ä!{VVY?ä!{R’žŽ?ä!H¯9ûz?ä!H«v’'?ä!ÿ&A?ä!;Æf?ä ã`¤öè?ä ã\á †?ä °¹, (?ä °µhÀ>?ä ~”kq?ä ~ Ñ'ÿ?ä Kiݵå?ä Kf{ë?ä ÂÏ?ä ¾DŸ?äæX?äæP1?ä³qÿ´Î?ä³n<—>?ä€ÉÍFn?ä€Æ 2V?äN!{ð?äN¸åa?äy ´?äuH²Û?äèÐ|´V?äè̹¼¨?ä¶'Ïà?ä¶$ $ª?äƒsÍ?äƒ{??äPÖp?äPÒT=+?ä- ãÐ?ä)J?äëƒã¸ø?äë€ ð¤?ä¸Úšgá?ä¸Öש?ä†11 ?ä†-nj¼?äS‡¨Ô4?äSƒæ(K?ä ÞÅp?ä Ú?"ÿ?äî4<¯?äî0y|·?今W*M?仆”šÍ?äˆàSÂ:?äˆÜ‘<3?äV61bA?äV2nå³?ä#‹ð,A?ä#ˆ-¹,?äðáa|?äðÝÍ÷ß?ä¾7Å’?ä¾3Oen?ä‹Œtz^?䋈²#³?äXá¸C€?äXÝõöN?ä&6ݧ?ä&3=î?äó‹ã¹ ?äóˆ!`?äÀàËŠä?äÀÝ Z?äŽ5”Ø€?äŽ1Ò±2?ä[Š?'F?ä[†} q?ä(ÞÊ×Ú?ä(ÛÃ~?äö37ÍL?äö/uÂi?äÇ…ê©?äÃÃé??äÛµŽ?ä×ó˜?ä^/Æ¢?ä^,³?ä+ƒ¹'?ä+÷(?äø׌һ?äøÓÊ÷6?äÆ+B9?äÆ'€D-?ä“~ØE?ä“{Dz?ä`ÒP‚?ä`ÎŽÃ?ä.%©î2?ä.!è8‘?äûxä·Œ?äûu# d?äÈÌ?äÈÈ?]S?ä–þÊ?ä–=0Ð?äcqÞÿ?äcnˆC?ä0Äžìf?ä0ÀÝf$?äþA è?äþŽ?äËiÄ´´?äËfAe?䘼* ?䘸h¡Ç?äfp³ò?äf ¯S•?ä3`™@?ä3\×·]?ä²¢¾Ú?ä®áqq?äÎŽE­?äÎͽ?ä›V[G ?ä›Rš •?äh¨ ¦?äh¤Hu ?ä5ù™âƒ?ä5õØ»?äK  Ú?äGJ‚Ñ?äÐœ^ã}?äИÎí?äí“ë?äéÒàz?äk>ª]r?äk:é[Ö?ä8¢Zî?ä8‹ábË?äà|D?äÜ»UØ?äÓ17Ÿ1?äÓ-vº?ä ÔË}?ä ~ïÇ?ämÒS?ämÎ’ºâ?ä;"³Ç,?ä;òþi?ärõÚ?äo5Ö?äÕÃç¼?äÕ¿Y1î?ä£u?ä£^ȼ?äpc£è?äp_F ?ä=²ÏÔ´?ä=¯;S?ä zŒ„?ä þ¹ü?äØR w?äØNF† ?䥡u•¥?䥵²?ärðÅ­#?ärí9«?ä@?÷” ?ä@<7*?ä 'N?ä ‹IÆÉ?äÚÝý8Æ?äÚÚ<á¼?ä¨,Ñí?ä¨)ŸŒ?äu{ˆf?äuwÈ!÷?äBÊ ¦?äBÆ`ki?䚯l?äÚ~I?äÝföÃP?äÝc6›¨?䪵4(/?䪱t ?äxS} ?äwÿ“hY?äEQTÄQ?äEM”¹?äŸ7¢v?ä›w ·?äßìüXƒ?äßé<`>?ä­:£1?ä­6ãf?äzˆ+³ð?äz„kΠ?äGÕ–>Ò?äGÑÖbü?ä"âÊ?ä"ø4?ä âpû¥?ä âlQ2Ä?ä ¯½!?ä ¯¹aS³?ä } 2ª?ä }S|¾?ä JVæþÌ?ä JS'R[?ä £œ÷&?ä ŸÝT.?ä äð4þÍ?ä äìueP?ä ²<®šú?ä ²8ï ø?ä ‰ j•?ä …Jä?ä LÕH1l?ä Lш´_?ä !gÒ?ä ¨_ ?ä çmi®p?ä çiªDX?ä ´¹Mˆ·?ä ´µŽ(?ä ‚%F?ä ‚SÎ#?ä OP»°?ä OLû¶?ä œDçÅ?ä ˜…£˜?ä éç°Óï?ä éãñ™=?ä ·2þÊ–?ä ·/?™^?ä „~/ ®?ä „zoäñ?ä QÉA>?ä QÅáü?ä 5$Ä?ä vý?ä ì_ ]i?ä ì[LR?ä ¹©ÃËÖ?ä ¹¦Ê?ä †ô^S.?ä †ðŸZ×?ä T>Û?ä T;&>?ä !‰9–î?ä !…z±?äîÓzwm?äîÏ»›‡?伸ú?ä¼Þæ?ä‰g¢Á§?ä‰cãø·?äV±Ší?äV­ËQx?ä#ûSÈw?ä#÷•}?äñDÿNU?äñA@¡Ö?侎Ê?侊ÎÜÇ?ä‹×ýÂê?ä‹Ô?)a?äY!OúÛ?äY‘jÍ?ä&j„ÆM?ä&fÆ?»?äó³›é"?äó¯Ýl ?äÀü•'>?äÀøÖ³¢?äŽEp¢H?äŽA²8(?ä[Ž.\¦?ä[Šoü?ä(ÖΗ®£?ä]ø&b?ä]ôh0Ö?ä+@2G¾?ä+€?äÈ1€š²?ä•|Z¬q?ä•xœÐ‹?äbÃYfÍ?äb¿›”b?ä0 :4ž?ä0|k¯?äýPýuñ?äýM?¶~?äÊ—£-)?äÊ“åw1?ä—Þ+4?ä—Úmq¸?äe$•‰é?äe ×æé?ä2jâ‘Ü?ä2g$øX?äÿ±ùÿ?äÿ­Tiö?äÌ÷#ãé?äÌóf]\?äš=j?äš9[X?äg‚ïF—?äg1Ó?ä4ȨÄ?ä4ÄëZ?äD­®?ä ‡M?äÏSÂæ€?äÏP^?䜙#Α?䜕f€ë?äiÞg Ÿ?äiÚ©Æu?ä7#Œú®?ä7ÏÀ?äh•ä?ädØP±?ãÿÑ­€d;?ãÿÑ©Ã<…?ãÿžòMâz?ãÿžîÄ@?ãÿl6ýÿ?ãÿl3@êB?ãÿ9{Ûb?ãÿ9wÓÐ ?ãÿÀZÊ?ãÿ¼IY?ãþÔ^A2?ãþÔ¡Hè?ãþ¡H˜Ïa?ãþ¡DÛà’?ãþnŒµè€?ãþnˆù-?ãþ;еÍW?ãþ;Ìøñ€?ãþ ˜AÞ?ãþ Ûoƒ?ãýÖX])G?ãýÖT `i?ãý£œã€?ãý£˜H$?ãýpß’?ãýpÛÒÜ2?ãý>"üÙÞ?ãý>@-t?ãý fL½0?ãý bC?ãüØ©]ž?ãüØ¥ÂÄ-?ãü¥ì”žX?ãü¥èØc?ãüs/Œb?ãüs+ÏÜ?ãü@rg)V?ãü@nª¬Z?ãü µ$x[?ãü ±hÛ?ãûÚ÷į?ãûÚôE|?ãû¨:GÑ ?ãû¨6‹p™?ãûu|­¡D?ãûuxñJ9?ãûB¾ö"K?ãûB»9Ô½?ãû!”æ?ãûýePÔ?ãúÝC/ûv?ãúÝ?sÀá?ãúª…!?ãúªdèè?ãúwÆõ?ãúwÃ8ês?ãúE«ˆ?ãúEïja?ãúJE:±?ãúF‰&?ãùß‹ÁÍ{?ãù߈ÂT?ãù¬Í!ï?ãù¬ÉeE?ãùzc` ?ãùz §gÝ?ãùGOˆ¢Ö?ãùGKÌ´%?ãù‘g?ãùŒÔ¬3?ãøáÑ{‹Ž?ãøáÍ¿¯×?ãø¯I“¤?ãø¯Ái?ãø|RúŒã?ãø|O>Ä%?ãøI“ŽZ?ãøIÒ›>?ãøÔü?ãøÐIh8?ã÷ä^Ùº?ã÷ä£-s?ã÷±TšdÜ?ã÷±PÞÂ?ã÷~”·ïñ?ã÷~üV¤?ã÷KÔ·êà?ã÷KÐü[?ã÷šóµ?ã÷ßma?ãöæTa+î?ãöæP¥¯?ãö³” 8x?ãö³NÅ?ãö€Ó–Yô?ãö€ÏÚð?ãöN’¶?ãöNJ2V?ãöRWh”?ãöNœ±?ãõè‘Œ·Ð?ãõèÑjj?ãõµÐ¤Çõ?ãõµÌé„ ?ãõƒŸº†?ãõƒ ä€?ãõPN}Ð?ãõPJŸ'?ãõ? ?ãõ‰ƒã?ãôêËâñ?ãôêÈ'Ó(?ãô¸ j^ž?ãô¸¯J'?ãô…HÔºB?ãô…E¯H?ãôR‡"%€?ãôRƒg$?ãôÅRƒ?ãôÁ—‹?ãóíf4%?ãóìÿ«E¢?ãóºA\½?ãóº=¡Ø?ãó‡6N?ãó‡{{ÁÅ?ãóT¼ó˜Ê?ãóT¹8Æ¿?ãó!ú“’Ò?ãó!öØÊE?ãòï8Ëò?ãòï4\ â?ãò¼u}„À?ãò¼qÂÏ-?ãò‰²ÆåÉ?ãò‰¯ 9´?ãòVïóê@?ãòVì9G¨?ãò$-?ãò$)I~ù?ãññi÷R}?ãññf<Âß?ãñ¾¦Íºð?ãñ¾£4Ð?ãñ‹ã‡SÃ?ãñ‹ßÌ×!?ãñY $L?ãñYi¬'?ãñ&\¤å?ãñ&Xé¶>?ãðó™µ(?ãðó•MTþ?ãðÀÕNEö?ãðÀÑ“ïJ?ãðŽxQ?ãðŽ ¾Õ?ãð[M…šw?ãð[IËVÆ?ãð(‰v$©?ãð(…»êv?ãïõÅJ?ãïõÁàN?ãïÃBÆ?ãïÂýGŽ?ãï<›¼L?ãï8áž’?ãï]x¾?ãï]t_©Ñ?ãï*³zÎ?ãï*¯ÀÃU?ãî÷î¿Kð?ãî÷ëJ¯?ãîÅ)ç9õ?ãîÅ&-B2?ãî’dò\V?ãî’a8n?ãî_ŸàóŒ?ãî_œ'Ä?ãî,Ú²âÜ?ãî,Öù’?ãíúhjÀ?ãíú®˜ó?ãíÇPOe?ãíÇLG‡?ã픊}ÑG?ã픆Äw?ãíaÄÝÓ£?ãíaÁ$Q?ãí.ÿ!´?ãí.ûgnß?ãìü9GÇÚ?ãìü5Ž%ƒ?ãìÉsR?ãìÉo˜‚¸?ãì–­?ºó?ãì–©†+™?ãìcçæ}?ãìcãW` ?ãì1 ÅÞ ?ãì1 bA?ãëþZ]ÌH?ãëþV¤Yg?ãëË“Ù‹/?ãëË !Í?ãë˜Í8ߌ?ãë˜É¨?ãëf{n?ãëfÂ'?ãë3?¡ôÔ?ãë3;è§ì?ãëx«ö?ãëtñÔ?ãêͱ–N„?ãêÍ­Ý™?ãêšêe3?ãêšæ¬­?ãêh#ç?ãêh^À ?ãê5[­“d?ãê5Wôuó?ãê”'º?ãêmÿÈ?ãéÏÌ„ @?ãéÏÈËÌ?ãéÄ¡Q?ãé  [?ãéj<èÒÿ?ãæÖ ©aÅ?ãæÖðåº?ãæ£C@¼6?ãæ£?ˆI©?ãæpy»õ+?ãæpvŒ?ãæ=°Ðì?ãæ=¬bq]?ãæ æ]pÌ?ãæ ⥻?ãå؃ö?ãåØË©Œ?ãå¥RŽD*?ãå¥NÖ?ãårˆ|:?ãår„ÃÆ¥?ãå?¾Mǧ?ãå?º•—‘?ãå ô}¾?ãå ðKW'?ãäÚ)È?ãäÚ%äè°?ãä§_C?ãä§[b/~?ãät”{7ö?ãätÃ-Ü?ãäAÉÀ¶?ãäAÆ?ãäþ认?ãäû0·‡?ããÜ3õT?ããÜ0=fp?ãã©håÙ??ãã©e-õ ?ããvº!Œ?ããvšFì?ããCÒrŒ9?ããCκ»?ããŸ?ããV×û?ãâÞ;ŽÙü?ãâÞ7×Ù?ãâ«oòàª?ãâ«l;,?ãâx¤:µø?ãâx ƒ Ó?ãâEØfš*?ãâEÔ®ø„?ãâ v?ãâ¾÷i?ãáà@j?ãáà<²Ú?ãá­tB4?ãá­pŠ— ?ãáz§ýö?ãáz¤Fz[?ãáGÛË>?ãáG×æY?ãá!ž.?ãá j5ƒ?ãàâB‰?ãàâ>Ò0ð?ãà¯uÕ„X?ãà¯r.¬?ãà|©^6?ãà|¥N?ãàIÜ›ç?ãàIØbY9?ãàÃÕ?ãà ZŠ¦?ãßäAíØJ?ãßä>6¨š?ãß±t®8z?ãß±p÷J?ãß~§R¨Æ?ãß~£›Œ?ãßKÙÛ }?ãßKÖ#ùL?ãß G£Þ?ãßš,?ãÞæ>˜q3?ãÞæ:áq?ãÞ³pÍvÅ?ãÞ³m€?ãÞ€¢æx÷?ãÞ€Ÿ/‹Ã?ãÞMÔâgÞ?ãÞMÑ+„*?ãÞÁ“¢?ãÞ ¹n?ãÝè8„±?ãÝè4ÍàÛ?ãݵj,Ú?ãݵfu:¥?ãÝ‚›·gÐ?ãÝ‚˜ª?ãÝOÍ'#§?ãÝOÉpoq?ãÝþzù¸?ãÝúÄO?ãÜê/²ìR?ãÜê+üK?ãÜ·`Ï;›?ãÜ·]£ä?ãÜ„‘Ï ?ãÜ„ŽþÒ?ãÜQ´ Ç?ãÜQ¾ýœ?ãÜó} ?ãÜïÆœÓ?ãÛì$)Úi?ãÛì sh±?ãÛ¹T»Ý?ãÛ¹Qœ¤?ãÛ†…0[Ì?ãÛ†yý?ãÛSµŠ\?ãÛS±ÓÊ#?ãÛ åÇõ ?ãÛ â©O?ãÚîê÷?ãÚî3Ú¾?ãÚ»Eðz|?ãÚ»B:AÂ?ãÚˆuÛM¼?ãÚˆr%‚?ãÚU¥ªz?ãÚU¡ôTX?ãÚ"Õ]âÖ?ãÚ"ѧƜ?ãÙðõk]?ãÙð?X£?ãÙ½4qSÐ?ãÙ½0»J•?ãÙŠcÑžo?ãÙŠ`žµ?ãÙW“.˜?ãÙW`8]?ãÙ$Â??ãÙ$¾‰Ö?ãØññLG‰?ãØñí–dO?ãØ¿ >³?ãØ¿ˆ8ù?ãØŒOKj?ãØŒK^{0?ãØY}ζ?ãØYzïe?ãØ&¬m±Õ?ãØ&¨·ô›?ã×óÚñ@Ñ?ã×ó×;?ã×Á YŸ?ã×Á£^e?ã׎7¥IT?ã׎3福?ã×[eÖ8?ã×[b mÿ?ã×(“ë¨?ã×(5‘ï?ãÖõÁä|?ãÖõ¾.÷É?ãÖÂï˜'?ãÖÂì o?ãÖ…8’?ãÖÏÇZ?ãÖ]K,_„?ãÖ]Gv÷Í?ãÖ*x¸.&?ãÖ*uÏî?ãÕ÷¦(J?ãÕ÷¢rõY?ãÕÄÓ|óP?ãÕÄÏǨ?ãÕ’¶K?ãÕ‘ý \?ãÕ_-ÓØ?ãÕ_*ŸÍ?ãÕ,ZÖ?ãÕ,W éL?ãÔù‡¼îg?ãÔù„É2?ãÔÆ´ˆ]z?ãÔÆ°ÓAÅ?ãÔ“á8†f?ãԓ݃t1?ãÔa Í- ?ãÔa $ì?ãÔ.:F6–?ãÔ.6‘7b?ãÓûf¤ ?ãÓûbï)X?ãÓÈ’æ«…?ãÓÈ1¿R?ãÓ•¿  „?ãÓ•»X½Ò?ãÓbë\î?ãÓbçdƒ¾?ãÓ0 è?ãÓ0U28?ãÒýBß5?ãÒý?*næ?ãÒÊn™–?ãÒÊjäZç?ãÒ—š7Ê?ãÒ—–ƒa?ãÒdźó¨?ãÒdÂIú?ãÒ1ñ#/~?ãÒ1ínQ?ãÑÿoÇ?ãÑÿ»0o?ãÑÌG¡W?ãÑÌCìÉñ?ãÑ™r¶3?ãÑ™oû‰?ãÑf¯R ?ãÑf™ú×à?ãÑ3Ȍս?ãÑ3ÄØe?ãÑóO ˆ?ãÑ`?ãÐÎö‹?ãÐÎA¹ä?ãЛHÚ%?ãЛDÍ…þ?ãÐhròV™?ãÐho> ó?ãÐ5G®?ãÐ5™“lÜ?ãÐǤã?ãÐÃÍm??ãÏÏñ {:?ãÏÏíìM?ãϤc?ãÏïïÁ?ãÏjEŒSÍ?ãÏjAØ8¬?ãÏ7oY;±?ãÏ7k¥*?ãÏ™ *Ü?ãÏ•W"½?ãÎÑ¡åÚ?ãÎѾíç=?ãΞìÄ?ãΞèi˜§?ãÎl~$Ó?ãÎlÊ98?ãÎ9>ÃŽt?ãÎ9;¬Z?ãÎgí® ?ãÎd9Õp?ãÍÓüÄ?ãÍÓHôl?ãÍ ¹ðtž?ãÍ ¶<¯?ãÍmâÉ>î?ãÍmß‚Ø?ãÍ; ‡$²?ãÍ;Ór?ãÍ4)¬Ò?ãÍ0v¾?ãÌÕ\±8?ãÌÕXýw¦?ãÌ¢…£Ê?ãÌ¢j ¹?ãÌo­nøI?ãÌo©»k¹?ãÌ<Õ¥’C?ãÌ<Ñò5?ãÌ ýÁ6J?ãÌ ú ¼½?ãË×%Á¨ú?ãË×"8î?ãˤM§*4?ãˤIóê?ãËquqÛ?ãËqq¾}ý?ãË>!#—?ãË>™mÐ?ãË Äµ ?ãÄ}£óé?ãÄ} A€?ãÄJÇöž[?ãÄJÄD—‘?ãÄëÞ£?ãÄè,¥Ð?ãÃå¬d?ãÃå ú(Ÿ?ãò3_+;?ãò/­@÷?ãÃV÷VÈ?ãÃSEv?ãÃLzuI?ãÃLvÃE ?ãÃØí?ãÚ&51?ãÂæÁ Jt?ãÂæ½n†9?ã³äMõ?ã³àœ:X?ãÂa#½?ã¯r‡?ãÂN*Y›+?ãÂN&§óx?ãÂM7¹Õ?ãÂI†¤?ãÁèoûò?ãÁèlIrC?ãÁµ’£ÿ³?ãÁµŽòt‡?ãÁ‚µ2J?ãÁ‚±€Èj?ãÁOצD‡?ãÁOÓôÌ`?ãÁùÿW†?ãÁöMèà?ãÀê>?ãÀꌹã?ãÀ·>b~x?ãÀ·:±"Ø?ãÀ„`ký?ãÀ„\º«?ãÀQ‚Zùj?ãÀQ~©°Ï?ãÀ¤/ÑÃ?ãÀ ~’ª?ã¿ëÅéî´?ã¿ëÂ8¹?㿸牮¤?㿸ãØ‚?㿆 2†?㿆^õ?ã¿S*yâæ?ã¿S&ÈÉ×?ã¿ KÊ<æ?ã¿ H-Z?ã¾ím€0?ã¾íiOz&?㾺ŽV?㾺ŠkÏ?㾇¯<?㾇«lHþ?ã¾TÐ!?ã¾TÌS+ ?ã¾!ðÐÁ¢?ã¾!íá£?ã½ï‚ç?ã½ï Ò?ã½¼2åB?ã½¼.jI?㽉R˜B?㽉Nç~ž?ã½Vrû=©?ã½VoJƒ¶?ã½#“CÚ6?ã½#“)Å?ã¼ð³rò?ã¼ð¯Ás?ã¼½Ó†Ä?ã¼½ÏÕ€Y?㼊óçæ?㼊ïÏSþ?ã¼X_c?ã¼X®“þ?ã¼%3$]?ã¼%/sÜ ?ã»òRÏIÔ?ã»òOÒt?㻿r_©¢?㻿n¯;Å?㻌‘Ö,?㻌Ž%³Ò?ã»Y±2;…?ã»Y­à®?ã»&Ðs÷.?ã»&ÌÃ¥Ú?ãºóï›È)?ãºóëë€X?ãºÁ©sA?ãºÁ ù4ó?㺎-œà?㺎)ìK?ãº[Lu‰¸?ãº[HÅ^p?ãº(k4’ù?ãº(g„q4?ã¹õ‰Ù`s?ã¹õ†)H1?ã¹Â¨d?ã¹Â¤´P?ã¹ÆÔ¬ø?ã¹Ã$§½?ã¹\å*ó?ã¹\áz÷M?ã¹*gCw?ã¹)ÿ·QB?ã¸÷!‰Dv?ã¸÷Ù[Ä?ã¸Ä?‘T??ã¸Ä;áu?㸑]ý?㸑YÏCQ?ã¸^{Rðç?ã¸^w£$¿?ã¸+™ ²ï?ã¸+•[ðJ?ã·ø¶©r’?ã·ø²ù¹q?ã·ÅÔ-:?ã·ÅÐ}nœ?ã·’ñ–z»?ã·’íæÔ ?ã·`æô?ã·` 6h]?ã·-, k?ã·-(l V?ã¶úI6Ôœ?ã¶úE‡K ?ã¶Çf7ÿº?ã¶Çbˆ¬?㶔ƒ#ö?㶔o­l?ã¶aŸì$Ô?ã¶aœ<·Í?ã¶.¼Ÿ#+?ã¶.¸ï¿¨?ãµûÙ8?ãµûÕˆ¨‚?ãµÈõ·\?ãµÈò±à?ãµ–ç’?ãµ–l š?ãµc.gO?ãµc*·ÒÚ?ãµ0J˜?ãµ0FèÐ-?ã´ýf¯€?ã´ýbÿØ?ã´Ê‚¬,F?ã´Ê~ý [?ã´—ž'¯?ã´—šàH?ã´dºXRÖ?ã´d¶©Dó?ã´1Ör£?ã´1ÒXnC?ã³þñœå5?ã³þííêY?ã³Ì oj?ã³Ì i~?ã³™(yôÊ?ã³™$Ë ö?ã³fCÁ´Ò?ã³f@Ö?ã³3^ïU½?ã³3[@€ð?ã³zTL?ã³vT‰?ã²Í”ý8?ã²Í‘NvX?㲚¯ÝœŽ?㲚¬.äM?ã²gʤ'â?ã²gÆõy%?ã²4åPa·?ã²4᡼}?ã²ÿã?ã²ü4h\?ã±Ï\?ã±Ï­~é?㱜4»z?㱜1 ‡Ì?ã±iO`>?ã±iKQá?ã±6i+ãñ?ã±6e}nK?㱃=$?ã±?ã°Ð5q@?ã°Ð™‡¢?ã°·Ò?ã°³eD¸?ã°jÐØ ?ã°jÍ)·v?ã°7ê‚ìQ?ã°7æÔ¦??ã°”?ã°eÖ?ã¯Ò‹>Â?ã¯ÒÝ ¸?㯟6葤?㯟3:h?ã¯lP,Å ?ã¯lL~¥?ã¯9iW ?ã¯9e¨î?㯂gÓ?ã¯~¹ƒÚ?ã®Ó›^‰:?ã®Ó—°…Å?ã® ´;³3?ã® °¹B?ã®mÌÿ/Œ?ã®mÉQ??ã®:å©?ã®:áû8?ã®þ9e7?ã®ú‹‡Ó?ã­Õ°H?ã­Õ0h?ã­¢/ þ?ã­¢+_R¢?ã­oGPtN?ã­oC¢³v?ã­<_zIœ?ã­<[Ì’I?ã­ wŠŸ?ã­ sÜñB?ã¬Ö9¥?ã¬Ö‹Ó•Z?㬣§^wN?㬣£°Üˆ?ã¬p¿";?ã¬p»tª[?ã¬=ÖÌK?ã¬=ÓÃÏ?㬠î\Çâ?㬠ê¯I©?ã«ØÓïô?ã«Ø&{??ã«¥1j(?ã«¥ƒþø?ã«r4tÐÞ?ã«r0Ço2?ã«?K€ƒ?ã«?Gð(\?ã« b¬Ö1?ã« ^ÿ‡Ž?ãªÙy¢xO?ãªÙuõ31?㪦~ÄÆ?㪦ŒÑ‰,?ãªs§A€“?ãªs£”N~?ãª@½êë?ãª@º=Âu?㪠Ôzç­?㪠ÐÍÈ¡?ã©ÚêñZ ?ã©ÚçDD™?㩨N%î?㩧ý¡ì?ã©u‘æ#?ã©uäã¥?ã©B-»ån?ã©B*ìu?ã©C̾Õ?ã©@Ïa?ã¨ÜYÄÈ?ã¨ÜV2Ø?㨩o¡õl?㨩kõ?ã¨v…f8W?ã¨v¹eq?ã¨C›]ö?ã¨C—d””?㨰¢î*?㨬ö.M?ã§ÝÆ(:?ã§ÝÂnqâ?㧪Ûz,Ý?㧪×Í€ ?ã§wð¿Á?ã§wíÊ?ã§Eëç?ã§E?MG?ã§þüš?ã§RlV?ã¦ß/øk?ã¦ß,KäR?㦬DØ®Ö?㦬A,1›?ã¦yYŸ«~?ã¦yUó7È?ã¦FnMD ?ã¦Fj Úo?㦂áØ ?ã¦5w`?ã¥à—]*Ê?ã¥à“°Ó£?㥭«¿è?㥭¨´F?ã¥zÀ»/?ã¥z¼[w?ã¥GÔ7XÅ?ã¥GЋ.?ã¥èM*?ã¥ä¡P?ã¤áüJsš?ã¤áøžL ?㤯.PÆ?㤯 ‚2¾?ã¤|#øüH?ã¤| LçÅ?ã¤I7ª;0?ã¤I3þ02?ã¤KBk@?ã¤G–iÈ?ã£ã^Áp?ã£ã[x?㣰r'KÐ?㣰n{]b?ã£}…t\.?ã£}ÈwE?ã£J˜§Í›?ã£J”ûò7?㣫Âwô?㣨¦?ã¢ä¾Ãã:?ã¢ä»à?㢱Ѭ0 ?㢱ÎqL?ã¢~ä{H?ã¢~àÏÉù?ã¢K÷1´V?ã¢Kó†?㢠ÎÑh?ã¢#/$?ã¡æR››?ã¡æ§Ü?㡳.½ê´?㡳+[z?ã¡€AÌ°?ã¡€=dFû?ã¡MSHÜJ?ã¡MO`?ã¡ehÀ?ã¡a½Mm?ã çwo[·?ã çsÃò“?ã ´‰]+_?ã ´…±ËÁ?ã ›21/?ã —†Û?ã N¬î¿?ã N©BÇ,?ã ¾ó¸?㠺尫?ãŸèÐ>?ãŸèÌoÖ¶?㟵á‹Òë?㟵Ýà¢è?㟂òãÖo?㟂ï8¯ò?ãŸP"þc?ãŸPwák?ãŸILð?㟞9?ãžê&V‡2?ãžê"«}F?ãž·7J4I?ãž·3Ÿ3â?ãž„H#±š?ãž„Dxº¹?ãžQXä«ê?ãžQU9¾?ãžiŒŒØ?ãžeá©?ãëz“€?ãëvp¹0?㸊‘…?㸆æ´=?ã…šî¿?ã…—C÷Á?ãR«3¡?ãR§ˆHã?ã»^?v?ã·³‹>?ãœìËq?ãœìÇÆYf?㜹ÛjŸ¹?㜹׿þŒ?㜆ëKŽf?㜆ç ö¿?ãœSû³Â?ãœS÷i%¡?ãœ! ˜?ãœ!h?ã›îY1?ã›î®¶?ã›»)Ö«Ê?ã›»&,::?㛈9;„?㛈5‘?ã›UH‡·?ã›UDÝ?4?ã›"Wº½Á?ã›"ThÄ?ãšïfÕAÈ?ãšïc*öP?ãš¼uÖîò?ãš¼r,­?㚉„ÀS?㚉Ëè?ãšV“ '?ãšVåÛB?ãš#¢G]ó?ãš#ž8“?ã™ð°æ]8?ã™ð­Y?ã–ÁŠºä?ã–Žš¶:?ã–Ž— À?ã–[§™èŸ?ã–[£ðx7?ã–(´dñ?ã–(°»Š"?ã•õÁUH?ã•õ½m÷ì?ã•Âͱ¯¸?ã•ÂÊ[ä?ã•Ú3KÏ?ã•ÖŠ?ã•\æœJ?ã•\âó T?ã•)òìé–?ã•)ïC²U?ã”öÿ%,W?ã”öû{þœ?ã”Ä Dö?ã”Ä›ÑÚ?㔑L*h?㔑£º?ã”^#:˃?ã”^‘º\?ã”+/U+?ã”++hM‹?ã“ø:Ïn5?ã“ø7&p?ã“ÅFt½x?ã“ÅBËÈå?ã“’RÝ,?ã“’NXò?ã“_]v’–?ã“_Yͱ?ã“,hÒßË?ã“,e*Ì?ã’ùt")?ã’ùpnS±?ã’ÆB¥M?ã’Æ{™à[?ã’“ŠV!Ë?ã’“†­f`?ã’`•PãH?ã’`‘¨1d?ã’- 3¢S?ã’-œŠùõ?ã‘úªýR?ã‘ú§T}|?ã‘ǵ­f?ã‘DzÐÉ?ã‘”ÀEj?ã‘”¼œÞ?ãýš2J?ãý ñò¸?ãÊW‡b?ãʯQX?ã—$üÉÞ?ã—!T[?ãd.‰‚J?ãd*á_N?ã17þJ®?ã14V19?ãŽþAZ«Ž?ãŽþ=²› ?ãŽËJžãÉ?ãŽËFöÝb?㎘SËÚ?㎘P#ú?ãŽe\ÞÄH?ãŽeY6Ðð?ãŽ2eÚ3õ?ãŽ2b2J$?ãÿn½üÚ?ãÿk?ãÌw‰-ÿ?ãÌsáWÃŒ ?ãƒ>¿æ,i?ムÇK|¶?ム娑?ã‚ØÊós•?ã‚ØÇM¨ø?ゥ΃ðÆ?ã‚¥ÊÞ/²?ã‚rÑü}?ã‚rÎVÅ?ã‚?Õ]u•?ã‚?Ñ·Ç‘?゠ئÜ8?ã‚ Õ7¼?ãÙÛس?ãÙØ3#?ã¦Þòü?ãûCûÀ?ã~ݺô?ã~Üý þ?ã~ªst?ã~©þÎ?ã~w|Ê?ã~wpƒä?ã~D Œ?ã~Dû./?ã~U‚?ã~no­?ã}ÞoDú?ã}ÞÊh®?ã}« ³±{?ã}«Þ¸?ã}x à~Ð?ã}x;µ•?ã}E õëˆ?ã}EQ+Ö?ã} óù´?ã} OC‹?ã|ß ÚÉž?ã|ß 6þ?ã|¬ª]Z?ã|¬ ºC?ã|yb\!?ã|y ½Â’?ã|F"Î?ã|F ^’È?ã|Œ³h?ã| è,ê?ã{àþÓz?ã{à ZV…?ã{­YßÒ?ã{­ µlf?ã{zC6?ã{z øÙS?ã{GÉ–ö?ã{G%6œ?ã{Þ ž?ã{:IÌ?ãzáÜb7?ãzá8î?ãz®Âü ?ãz®¸L?ãz{’3©?ãz{ íùr?ãzHJ)[?ãzH ¥ø­?ãzêýi?ãz FÖC?ãyât“ž?ãyâ Ðv?ãy¯ç E?ãy¯ Bø2?ãy|B,ï?ãy| ž"d?ãyI†R[?ãyI âQY?ãy ³B?ãy J¡?ãxã Èßû?ãxã $ò ?ãx° Ljº?ãx°#¤T?ãx} ®Þ?ãx} 6?ãxJ |¬[?ãxJØÛ?ãx4/?ãxgJ?ãwäÔ¹U?ãwä0û?ãw±^©?ãw±º[ð?ãw~Ð7?ãw~,‹ì?ãwK+k"?ãwJþ‡É{?ãwoT?ãwüË»ÿ?ãväþ›ô?ãväúøe}?ãv±ü±§±?ãv±ù"¥?ãv~ú°[?ãv~÷ šÙ?ãvKø—ºï?ãvKôôHö?ãvöh<Ô?ãvòÄÔd?ãuåô!Ô?ãuåð~ í?ãu²ñÃÂj?ãu²î m ?ãuïO$Ì?ãuë«Øø?ãuLìÃl—?ãuLé *L?ãuê º?ãuæ}D?ãtæçgK„?ãtæãÄL?ãt³ä–mä?ãt³àóH5?ãt€á®º+?ãt€Þ ž?ãtMÞ°2_?ãtMÛ Ã?ãtÛš}ð?ãt×÷tÝ?ãsçØm½?ãsçÔʽŒ?ãs´Õ*.6?ãs´Ñ‡87?ãsÑϵ*?ãsÎ,È´?ãsNÎ^5Â?ãsNÊ»RÕ?ãsÊÖ*Ê?ãsÇ3Qg?ãrèÇ6Âí?ãrèÓó?ãrµÃ€—)?ãrµ¿ÝÐÙ?ãr‚¿³©?ãr‚¼ì¹?ãrO»Ï¡e?ãrO¸,î(?ãr·Ô½B?ãr´2Ž?ãqé³ÃF?ãqé° }?ãq¶¯šhî?ãq¶«÷ÒN?ãqƒ«ZüÆ?ãqƒ§¸o¯?ãqP§Ú×?ãqP£bWJ?ãq¢—ª˜?ãqžõ0•?ãpꞪj?ãpêšq9ð?ãp·™y6Ù?ãp·•ÖÏé?ãp„”Ç»?ãp„‘%] ?ãpQÿW(?ãpQŒ]L?ãp‹ ¤?ãp‡~YÉ?ãoë†*д?ão낈ë?ão¸F?ão¸}{ä?ão…{úàa?ão…xX²¬?ãoRvÀå®?ãoRsÁ‚?ãoqp-0?ãomÎŽ?ãnìl×?ãnìhfÅü?ãn¹fŠÇ6?ãn¹b迨?ãn†`õÿ˜?ãn†]T“?ãnS[J¾?ãnSW¨Ê?ãn UˆoV?ãn Qæ„f?ãmíO¯ª·?ãmíL ÉQ?ãmºIÀTŒ?ãmºF|¯?ãm‡Cºf?ãm‡@F?ãmT=Fº?ãmT9ûò?ãm!7j ´?ãm!3ÈPv?ãlî1 Þ?ãlî-~Y)?ãl»*¿FE?ãl»'ž?ãlˆ$HV¡?ãlˆ ¦¸?ãlUº‰?ãlUóþ?ãl"ì?ãl"t_?ãkï[My?ãkï ¹Ëv?ãk¼ ˆßj?ãk¼çfò?ãk‰Ÿ`y?ãkˆþýñ‹?ãkUûŸ™’?ãkU÷þ4.?ãk"ôˆ×á?ãk"ðç|?ãjïí[´?ãjïéºaÅ?ãj¼æ0+?ãj¼âvçf?ãj‰Þ½Õ™?ãj‰Û–^?ãjV×Mê?ãjVÓ«é9?ãj#ÏÅï÷?ãj#Ì$ÃÐ?ãiðÈ'ð]?ãiðĆÍÀ?ãi½Às|?ãi½¼Òco?ãiŠ¸¨Òž?ãiŠµÃ?ãiW°Ç^?ãiW­&X?ãi$¨Ï™b?ãi$¥.œî?ãhñ Áhd?ãhñ u{?ãh¾˜œÛ?ãh¾”û§|?ãh‹aQ ?ãh‹ŒÀq7?ãhXˆç!?ãhX„oØ?ãh%§Ü¬?ãh%|ì?ãgòw)Ž?ãgòsˆÊÌ?ãg¿n”Àå?ãg¿jô:?ãgŒeéY8?ãgŒbH©?ãgY]'Ñi?ãgYY‡*Ô?ãg&TOïA?ãg&P¯R6?ãfóKa–?ãfóGÁ?ãfÀB]µ?ãfÀ>¼{¿?ãf9BN?ãf5¡â?ãfZ0Ži?ãfZ,pˆ?ãf'&Èè6?ãf'#(zà?ãeôjó—?ãeôÊË?ãeÁö”t?ãeÁV:2?ãeŽ l÷?ãeŽ˸@?ãe[Ë5 ?ãeZý*íß?ãe'÷ü?ãe'ós¾î?ãdôíF™?ãdôé¦K‚?ãdÁãbÞB?ãdÁß³¶?ãdŽÙhÞR?ãdŽÕȽQ?ãd[ÏX½ø?ãd[˸¦?ãd(Å2a?ãd(Á’S+?ãcõºõçÃ?ãcõ·Uãb?ãc°£Î?ãc­ø?ãc¦:/[?ãc¢š>?ãc\›ºôD?ãc\˜ ƒ?ãc)‘%†’?ãc)…¨\?ãbö†z[?ãbö‚Ú1¯?ãbÃ{¸9r?ãbÃxnQ?ãbpà]ø?ãbm@œb?ãb]eòuì?ãb]bR½á?ãb*Zî)?ãb*WNz?ãa÷OÓÓ˜?ãa÷L4.£?ãaÄD£•?ãaÄAú&?ãa‘9]À?ãa‘5½„á?ãa^.³V?ãa^*a+?ãa+"Ž?ãa+î”S?ã`øV?ã`øeàÞ?ã`Å fºt?ã`ÅÇNÁ?ã`‘ÿ±çí?ã`‘ü…Å?ã`^óç¦?ã`^ðGÄ ?ã`+è<ƒ?ã`+äfíq?ã_øÜg•?ã_øØp"?ã_ÅПÔ?ã_ÅÌccØ?ã_’Ãß«?ã_’À@x¯?ã__·¦Ç?ã__´ž¨?ã_,«WÙ ?ã_,§¸¹¯?ã^ùžò~î?ã^ù›Si?ã^Æ’vu®?ã^ÆŽ×ij?ã^“…ä?=?ã^“‚E<„?ã^`y<7¼?ã^`u>Ž?ã^-l~a?ã^-hßqz?ã]ú_ªc8?ã]ú\ }!?ã]ÇRÀš&?ã]ÇO!½š?ã]”EÀËÅ?ã]”B!øÄ?ã]a8ªú?ã]a5 0Ÿ?ã].+E ?ã].'à… ?ã\û=®§?ã\ûžøH?ã\Èæ×?ã\È Gn?ã\•x©–?ã\”ÿÚM?ã\aõõ\à?ã\aòVÃ#?ã\.è\Ÿ?ã\.佈m?ã[ûÚ¬ü×?ã[û×v1?ã[ÈÌèGŠ?ã[ÈÉIÊo?ã[•¿ d‰?ã[•»nðù?ã[b±Íê?ã[b­~cæ?ã[/£…¡?ã[/Ÿx%(?ãZü”ú3’?ãZü‘[Ü¥?ãZɆÈ3Å?ãZɃ)æc?ãZ–x€j+?ãZ–tâ&U?ãZcj"º¶?ãZcf„€l?ãZ0[¯cd?ãZ0X2¥?ãYýM&*#?ãYýIˆð?ãYÊ>‡.ë?ãYÊ:éC?ãY—/Òs´?ãY—,4_˜?ãYd!y?ãYdj é?ãY1'ã%?ãY1‰â ?ãXþ1ó³?ãXýÿ“ü:?ãXÊô&ˆ?ãXÊðˆš/?ãX—å L?ãX—ág'ê?ãXdÕÎ6B?ãXdÒ0[l?ãX1Æð?ãX1Â㾦?ãWþ·J?ãWþ³S‹?ãW˧§B?ãWˤ X?ãW˜˜‚Ô?ãW˜”{Î-?ãWeˆv&ò?ãWe„Ø{×?ãW2x½@Ž?ãW2užþ?ãVÿhîÑŸ?ãVÿeQ9›?ãVÌY ‚?ãVÌUló£?ãV™I­÷?ãV™Es) ?ãVf9u ?ãVf5cùÀ?ãV3(Ü–?ãV3%? Á?ãV¢)@?ãVÀ÷?ãUÍR8?ãUÍ´Ù^?ãU™÷ì®?ãU™ôOXé?ãUfçqo8?ãUfãÔ#“?ãU3ÖàõR?ãU3ÓC³9?ãUÆ:¬{?ãUÂsî?ãT͵~ð“?ãTͱáÁ’?ãTš¤­ÿ‚?ãTš¡Ú ?ãTg“ÇE[?ãTg*)r?ãT4‚Ëþ?ãT4. ¡?ãTq¹mf?ãTnd•?ãSÎ`’S?ãSÎ\õTë–?ãSh:fÿi?ãS5,œeˆ?ãS5(ÿ‚ç?ãS}ö?ãS‚¤á?ãRÏ 6×?ãRÏðgN?ãR›÷åV/?ãR›ôH2?ãRhæ(UÈ?ãRhâ‹™W?ãR5ÔUI¨?ãR5и–Ã?ãRÂlHÙ?ãR¾ÏŸ€?ãQÏ°mèÂ?ãQϬÑHõ?ãQœžZ+Q?ãQœš½•?ãQiŒ0¸š?ãQiˆ”+æ?ãQ6yòFE?ãQ6vUÃ?ãQgž^t?ãQdäÙ?ãPÐU5! ?ãPÐQ˜°ú?ãPB¶T ?ãP?í‹?ãPj0"q>?ãPj,†H?ãP7y½?ãP7ܯS?ãP ºF_?ãPü?ãOÐ÷æ\ ?ãOÐôJ¸?ãOäý Á?ãOá`Òü?ãOjÑþom?ãOjÎbB4?ãO7¾ê¬í?ãO7»N‰A?ãO«ÁˆJ?ãO¨%n*?ãNјƒ!d?ãNÑ”çÐ?ãNž…/¶?ãNž“¯?ãNkqÆÐt?ãNkn*Òù?ãN8^HÌT?ãN8Z¬Øf?ãNJµo¾?ãNG…]?ãMÒ7 ø?ãMÒ3qª?ãMŸ#OJ˜?ãMŸ³sP?ãMl|…á?ãMl à¸%?ãM8û”pp?ãM8÷ø¬A?ãMç—*!?ãMãûo~?ãLÒÓ„ÒÍ?ãLÒÏé!¶?ãLŸ¿]Nw?ãLŸ»Á¦í?ãLl« Ÿ?ãLl§…?ãL9–ÏR?ãL9“3mâ?ãL‚gä?ãL~ÌYº?ãKÓmëû`?ãKÓjPz ?ãK YZÐØ?ãK U¿Y?ãKmD´„â?ãKmA¤?ãK:/ùk?ãK:,]´º?ãK(Ì2?ãKq ?ãJÔCEj?ãJÔ§óÒ?ãJ ñHÂÐ?ãJ í­zÅ?ãJmÜ9d:?ãJmØž%¼?ãJ:dzö?ãJ:Ãy?ãJ±Û+?ãJ®@)?ãIÔœŒ‘ ?ãIÔ˜ñoH?ãI¡‡(æš?ãI¡ƒÎO?ãInq°-ë?ãInn-?ãI;\"¤Ê?ãI;X‡Ÿ˜?ãIFóp?ãIBä÷Ì?ãHÕ0Èu?ãHÕ--ƒh?ãH¢ûñ?ãH¢a‰?ãHo†?ãHo§?ãH;ï$R?ãH;ë‰Bá?ãHÙå¶?ãHÕ~Ò?ãGÕÂøxŒ?ãGÕ¿]¶5?ãG¢¬ÃJO?ãG¢©(‘†?ãGo–yzÏ?ãGo’ÞË“?ãG<€v…?ãG<|ÐÕ?ãG i¦¶ë?ãG f È?ãFÖS$?ãFÖOƒoŽ?ãF£<€Z#?ãF£8åÑ?ãFp%Íü“?ãFp"3}?ãF=Í|?ãF= lWŽ?ãF ø*“ ?ãF ô&¨?ãEÖá9¨È?ãEÖÝŸEô?ãE£Ê4£?ãE£Æ™·\?ãEp³ég?ãEp¯~™­?ãE=›è¤0?ãE=˜N^?ãE „£rI?ãE 5ª?ãD×mIU›?ãD×i¯"‰?ãD¤UÚP?ãD¤R@&‹?ãDq>VÛ?ãDq:¼»?ãD>&¾€ï?ãD>#$j„?ãD C³?ãD w6Ö?ãC×÷O~Õ?ãC×óµ{…?ãC¤ßxžå?ãC¤ÛÞ¥"?ãCqÇ;!?ãCqÃóJë?ãC>¯ŒûØ?ãC>«ó/?ãC —x<‡?ãC “Þ_l?ãBØNÃ^?ãBØ{´ïÑ?ãB¥gth?ãB¥cvªh?ãBrN½B?ãBrK#ÌÏ?ãB?6U¶G?ãB?2»ÿa?ãB Ù†ž?ãB ?ÙF?ãAÙHjð?ãAÙ®Ç&?ãA¥ì¢ Ô?ãA¥é —?ãArÓèeæ?ãArÐNÕ6?ãA?»b?ãA?·Û_?ãA ¢5ò?ãA žœtƒ?ã@Ù‰=ø²?ã@Ù…¤„«?ã@¦p1´?ã@¦l—´:?ã@sWÝb?ã@sSv|u?ã@@=Ùúô?ã@@:@£–?ã@ $yP?ã@ ö+?ã?Ú 0x3?ã?Ú—3ï?ã?¦ñ¼½Ø?ã?¦î#ƒ"?ã?sØ4‡Ï?ã?sÔ›V§?ã?@¾—õÕ?ã?@ºþÎ;?ã? ¤æ°P?ã? ¡M’C?ã>Ú‹ ôÐ?ã>Ú‡‡àP?ã>§qF§h?ã>§m­œw?ã>tWX ?ã>tS¿A=TÕ¾?ã>A9»Ýè?ã>#= ?ã>¤+W?ã=Û ,¬?ã=ÛxGò?ã=§îÐ{£?ã=§ë7 v?ã=tÔ{aæ?ã=tÐâG?ã=Aºÿ,?ã=A¶y7?ã=Ÿ“Þ?ã=›û‘?ã<Û…•™?ã<Ûhà£?ã<¨jZëú?ã<¨fÂ@’?ãX?ã;’FüÊ?ã;Ž®Ñ?ã:Üvé ?ã:ÜsP­4?ã:©[v~¨?ã:©WÞ2Ë?ã:v?ïÌ1?ã:vW.?ã7ª²¦š¤?ã7w™‡®?ã7w•ïh³?ã7D|»Ç¯?ã7Dy$B?ã7_Ü?G?ã7\DŸg?ã6ÞBèf‘?ã6Þ?PÐ??ã6«%à˜À?ã6«"I ý?ã6xÄœ*?ã6x-õ?ã6Dë”Tæ?ã6DçüÛ??ã6ÎPb?ã6ʸJ?ã5Þ°÷ |?ã5Þ­`9ò?ã5«“‹R?ã5«ó¼V?ã5xv l½?ã5xrsP?ã5EXuœ¥?ã5ETÞRÆ?ã5:Ìæk?ã575¦?ã4ß.0?ã4ßx÷n?ã4«ÿ?„?ã4«û§ïP?ã4xáZ*X?ã4xÝò?ã4EÃaY†?ã4E¿Ê?p?ã4¥TR©?ã4¡½B!?ã3߇35c?ã3߃œ.i?ã3¬hþ\Ô?ã3¬eg_i?ã3yJµSÙ?ã3yG_ü?ã3F,XWÒ?ã3F(Ám„?ã3 çLÜ?ã3 Pl?ã2ßïbR™?ã2ßëË{h?ã2¬ÐÉM&?ã2¬Í2„?ã2y²yá?ã2y®…µÍ?ã2F“[Ÿ+?ã2FÄä¥?ã2t†Ü ?ã2pð+©?ã1àUž4?ã1àRŒ²?ã1­6¡‰Â?ã1­3 ëè?ã1zý-?ã1zúhâ?ã1Føl­û?ã1FôÖ#>?ã1Ù4DÐ?ã1Õã?ã0à¹èÁ?ã0à¶Q¥"?ã0­šˆ7ª?ã0­–ñÉ™?ã0z{>:?ã0zw}Ù¹?ã0G[ŒmÂ?ã0GWöÏ?ã0;ñ“?ã08Z².?ã/áA¨_?ã/á«`Š?ã/­ü~™u?ã/­øè[.?ã/zܧA?ã/zÙhŠ?ã/G¼¼µ?ã/G¹&Št?ã/œ¾Ü?ã/™'þA?ã.á|«ÝÛ?ã.áyÅÐ?ã.®\…˜L?ã.®Xï‰Ï?ã.{A ¿?ã)°Ã̘?ã)°.­?ã)|ýÄ?ã)|ú® ?ã)IÛdé?ã)I×σ?ã)¹?ã)µ‚ª?ã(ã–¶”ô?ã(ã“!›¬?ã(°tBzm?ã(°p­Šµ?ã(}Qºçr?ã(}N&H?ã(J/ûˆ?ã(J+‹î?ã( q},?ã(ܪ!?ã'ãé¯PŠ?ã'ãæ‡?ã'°ÆÙî+?ã'°ÃE.??ã'}£ðá8?ã'} \*Ü?ã'J€ô¢8?ã'J}_õk?ã']äÙü?ã'ZP6¿?ã&ä:ÁŠ_?ã&ä7,ð°?ã&±Šð?ã&±ö`p?ã&}ô@ð·?ã&}ð¬j'?ã&JÐão?ã&JÍNò?ã&­r¨¡?ã&©Þ50?ã%ä‰î¾?ã%ä†ZÜ?ã%±fVÞ…?ã%±bÂ~3?ã%~B«Þz?ã%~?‡·?ã%Kí¾À?ã%KYq?ã%û ?ã%÷‡Æì?ã$ä×7»?ã$äÓ¢â§?ã$±³>÷?ã$±¯ªÆŽ?ã$~3}Å?ã$~‹ŸVÑ?ã$Kk²¬?ã$Kg€•G?ã$Fâ—ž?ã$CNƒÉ?ã#å".r?ã#å $,?ã#±þDxþ?ã#±ú°xH?ã#~ÙØ–»?ã#~ÖDŸ”?ã#KµYkÜ?ã#K±Å~E?ã#ÇÚ?ã#33Ó?ã"ål!~ç?ã"åh¤p?ã"²Gh…:?ã"²CÔ´R?ã""œgê?ã" ’?ã"Ký½(Î?ã"Kú)k?ã"Øʬ?ã"Õ6÷á?ã!å³ÅD?ã!å°1f›?ã!²Ž¬Z"?ã!²‹¹ ?ã!i€MI?ã!e쵿?ã!LDA'Ì?ã!L@­™Ó?ã!îÍâ?ã!x?ã åù‰Ad?ã åõõÆŠ?ã ²Ô¡Â?ã ²Ð}0w?ã ®…q?ã ªñ¦·?ã Lˆæ0j?ã L…RÒ??ã c4b\?ã _¡ Â?ãæ=oˆ?ãæ9Ü=u?ã³—ik?ã³'ð?ãñ¬B1?ãî G?ãLË®2A?ãLÈæ?㥜wØ?㢠S ?ãæwg ?ãæ{äKÎ?ã³Y?N‚?ã³U¬<×?ã€2óôã?ã€/`ìÈ?ãM •´Ê?ãM ¶??ãæ$rt?ãâ‘}y?ãæ¿ ?ãæ¼ &¥?ã³™³?㳕uÑ8?ã€r^tà?ã€nËœ•?ãMK¡?ãMHOb?ã$ÐÎ,?ã!> ?ãæýí†æ?ãæúZËL?ã³Ö÷,~?ã³Ódzs?〯íûø?〬[S~?ãMˆÑÙ?ãM…?:¤?ãa¢Ç?ã^1·?ãç:`ÆL?ãç6Î:ƒ?ã´ ö±?ã´ytw?ã€ë¤ê«j?ãèÁô,?ãè0'¨?ã´ðôÙÈ?ã´ícÕ?ãÈù?ãă?ž?ãNŸ"S¤?ãN›£Ò?ãv ?ãr‹bÏ?ãèM?ãèIs~c?ãµ#ÚPc?ãµ H½C?ãút?ã÷ yä?ãNÑM6?ãNÍ»¶?ã§ê‘l?ã¤Yý?ãè~uRd?ãèzãå…?ãµTízÌ?ãµQ\~?ã‚+Rîá?ã‚'Á•$?ãO¥Î?ãNþ}Ó?ã×æ7†?ãÔTðê?ãè®Ôš?ã誂—?㵄.â!?ãµ€®¦?ã‚Z7u?ã‚V¦U‹?ãO0-sP?ãO,œRö?ã?ã€U?ãèÛâ ?ãèØQ Ó?ãµ± qå?ãµ®n>?ょLH?ゃ»Mî?ãO\å¸Á?ãOYTÈ@‘?ã\ø¾?ãYh}?ãé2áá?ãé.4Q?㶧ä?㶄å?ã‚Üôì?ã‚ØvZ~?ãO°æÊÁ?ãO­V9ä?ã…´+,?ã‚#£à?ãéZoS?ãéVÞÕH?ã¶/Íÿ?ã¶+‡YÔ?ヮù?ラ`?ãOØ1ë³?ãOÔ¡Š«?㬣9q?ã©áù?ãé:?ãé}qì"?ã¶UO À?ã¶Q¾Èk?ãƒ)‰=^?ãƒ%ù™?ãOý±&.?ãOú ôû?ãÑÆæy?ãÎ6¾×?ãé¥Ê ?ãé¢9ëõ?ã¶y»¦?ã¶v*ô&?ãƒM™Æ™?ãƒJ »ª?ãP!f(,?ãPÖ&Î?ãõ /*?ãñ7]?ã éÈÇú×?ã éÅ8 ›?ã ¶œ]Œÿ?ã ¶˜Í¨T?ã ƒoàçj?ã ƒlQ P?ã PCQîd?ã P?ÂÜ?ã °Á.?ã  ù7?ã ééýD?ã éæm…²?ã ¶½7–e?ã ¶¹§á?ã ƒ_¹à?ã ƒŒÐ?ã Pcu’Ô?ã P_åñ!?ã 6y^?ã 2éÅß?ã ê jÿ°?ã êÛq ?ã ¶ÜJ>·?㠶غ¹¸?ã ƒ¯uL?ã ƒ«‡ùÞ?ã PÒ‡À?ã P~Cä?ã T{Z^?ã Pëò?ã ê' h?ã ê#‚­®?ã ¶ù–½?ã ¶ögõ?ã ƒÌ Ü?ã ƒÈyÊE?ã PžipØ?ã PšÚ.Ó?ã p·ÏØ?ã m(—d?ã êBóÜ6?ã ê?d­S?ã · ž?ã ·ŽèM?ã ƒç6 n?ã ƒã¦ñ®?ã P¹;úç?ã Pµ¬è¸?ã ‹0¹?ã ‡¡ ?ãê]Ã^?ãêY‚ÄS?ã·.á¡ê?ã·+R¬p?ã„Ÿ’¯?ãƒý¦Æ?ãPÒK??ãPμ\»?ã£å;?ã V(v?ãêulÚñ?ãêqÞ ½?ã·Fâ°„?ã·CSêá?ã„Fƒº?ã„·Ç©?ãPé˜VW?ãPæ £Ø?ãºØG?ã·Iž¯?ãêŒ;Ø?ãêˆwœ|?ã·]"RA?ã·Y“¼w?ã„.,4L?ã„*¨?ãPÿ$vó?ãPû•ôK?ãÐ ¦7?ãÌ|-!?ãê ÞÃá?ãêPT]?ã·q¡G{?ã·ná‰?ã„BQƒu?ã„>Ã'?ãQï‘?ãQa>¾?ãã{¬ð?ãßíc³?ãê³õôÏ?ãê°gµ$?ã·„^M|?ã·€Ðb?ã„T´Ö-?ã„Q&©¥?ãQ$ùs3?ãQ!kP=?ãõ,CÀ?ãñž*\?ãêÅM,*?ãêÁ¿X?ã·•\i ?ã·‘ÎbË?ã„eYÁS?ã„aËĤ?ãQ5Eq˜?ãQ1·~{?ã@Á?ã‘W6?ãêÔçMÿ?ãêÑYn?ã·¤}ª?ã·¡§B?ã„tB ]?ã„p´?‡?ãQCÔ£’?ãQ@FàN?ãUº»?ãÈ ?ãêâÄÝï?ãêß7-Î?ã·²"IÅ?ã·®”£6?ã„mÿþ?ã„}àc?ãQP¨Ç?ãQMŒ]?ãÐR£?ãBÈË?ãêîçû?ãêëY´?ã·½ìº?ã·º^¨?ã„Œßc=?ㄉQö?ãQ[Á7|?ãQX3Óì?ã*‘Dÿ?ã'ë?âÿêùOªñ?âÿêõÂZ„?âÿ·ÇüMª?âÿ·ÄoÏ?âÿ„–—‡%?âÿ„“ IÜ?âÿQe ã‚?âÿQa“¯Ì?âÿ3˜Ú?âÿ0 ¯ù?âþëÿ1î?âþêþr\?âþ·ÐSÏJ?âþ·ÌƸJ?âþ„ž— &?âþ„› þ¸?âþQlȯw?âþQi;«›?âþ:èš?âþ7[£Q?âýë÷0y?âýëj?Â?âý·Öô/?âý·ÓgGê?âý„¤ß›?âý„¡R½‹?âýQr¹v`?âýQo,¢_?âý@ý`?âý<õ2ñ?âüë8÷?âüë ¬6?âûQuïTô?âûF•¬ù?âûC BA?âúëžê?âúë³Ä?âú·à•Zç?âú·Ý T?âú„­{ 8?âú„©î½7?âúQzObY?âúQvÃë?âúGb?âúC†'*?âùëÃî¥?âùë7½\?âù·àd'K?âù·Ü×ÿ”?âù„¬ó+?âù„©g ô?âùQypÁ?âùQuä¬?âùEÜê÷?âùBPß÷?âøë8—?âøë¬*?âø·ÞdH?âø·Úõln?âø„ª¹*;?âø„§-;ó?âøQv߆?âøQsS¡Y?âøBô–Ò?âø?h»¯?â÷ëø{ ?â÷ë lª?â÷·ÚëÛ?â÷·×_PÝ?â÷„¦ÌRæ?â÷„£@”{?â÷Qrœf(?â÷Qo±O?â÷>[T^?â÷:Ï©?âöë ÇB?âöë}%?âö·Õ¥5ç?âö·ÒÇ?âö„¡0g^?âö„¤ØÏ?âöQlª]`?âöQiØd?âö8¤?âö4‡ž;?âõëjí?âõêÿß,?âõ·Î°ëð?âõ·Ë%ƒ¬?âõ„™æ@?âõ„–Záf?âõQe al?âõQa N?âõ0?âõ,‘Ëz?âôêûõB?âôê÷“³J?âô·Æˆ?âô·Â„P+?âô„ï J?âô„cÞv?âôQ[½gÝ?âôQX2Bœ?âô&z·R?âô"?âóêñ&à?âóêí›Íú?âó·»Â.?âó·¸6ø¦?âó„†LW?âó„‚Áb?âóQPÅþ?âóQM: œ?âó- '?âó¢!X?âòêåƒæ??âòêáù?âò·¯ÉÀO?âò·¬>ç¦?âò„yþ?âò„vsÍú?âòQD"~:?âòQ@—¸·?âò5*ì?âò ªnû?âñêØ6üÊ?âñêÔ¬Jl?âñ·¢'Ø@?âñ·ž/u?âñ„l„f?âñ„h|å.?âñQ5ÖZæ?âñQ2KÅA?âñÿ”@*?âñü ´?âðêÉA5æ?âðêŶ³g?âð·’Ý=Ö?âð·RÄê?âð„\hY´?âð„XÝê[?âðQ%â‹5?âðQ"X%o?âðïKÔ?âðëÁwá?âï긤6?âïêµãh?âï·ëx4?âï·~a/'?âï„K"?âï„G—Ò?âïQGÉ?âïQ½“!?âïÝ\ƒ@?âïÙÒVí?âîê¦`_(?âîê¢ÖÞ?âã¶7?âã¶3–õ‚?âã‚üp+Š?âã‚øè*ž?âãOÁ±.ä?âãO¾)7Œ?âã†á´?âãƒYÆS?ââéL÷H?ââéHz?ââ¶4Ž?âⶠŠYò?ââ‚Ö¾\?ââ‚Ò‰íT?ââO›(k?ââO—y`÷?ââ_àW;?ââ\X™[?âáé$¯/C?âáé!'z÷?âáµém²8?âáµåæ€?âá‚®1?âႪ”{ ?âáOrºC?âáOo2³?âá7Gü»?âá3Àn¾?âàèûű?âàèø>,«?âàµÀ2ûš?âർ«€Å?âà‚„5–?âà‚ÄU?âàOHÝ`´?âàOEUù?âà '?âà ’Èû?âßèÑFá÷?âßèÍ¿r?âßµ•cuÜ?âßµ‘Ü*ë?âß‚YoÇD?âß‚Uè…ç?âßOkõ?âßOä½F?âßáWã¨?âßÝеt?âÞè¥3V?âÞ衬1ý?âÞµhþ§*?âÞµewŒ?âÞ‚,¹×?âÞ‚)2ň?âÞNðeù?âÞNìÝý?âÞ³ÿøh?âÞ°xú?âÝèwŠíT?âÝètø˜?âݵ;È?âÙ´oô «?âÙ5¥ÓÄ?âÙ2±Æ?âÙM÷Á=‰?âÙMô;%?âÙ¹ÌÐê?âÙ¶FÂ?âØç{ÈUG?âØçxBP?âØ´=´œ?âØ´:. ð?âØ€ÿ Ô?âØ€ü .¼?âØMÁ\é?âØM½Ö+f?â؃8ò?âØ’Z?â×çDÄËâ?â×çA>ö‡?â×´aYÖ?â×´ÛŽ?â×€Çî¼?â×€Äh\‹?â×M‰kC?â×M…åc¦?â×JØT?â×GR¥ ?âÖç 5ÇÓ?âÖç°"_?âֳ̓y4?âÖ³ÉýÝU?âÖ€ŽÁ†ÿ?âÖ€‹;ô´?âÖMO︚?âÖMLj/ã?âÖg?âÖ ˆçó?âÕæÒr?âÕæΗŒå?âÕ³“?âÕ³–² ?âÕ€T d ?âÕ€P†§?âÕMë-™?âÕMeÔÊ?âÕÕ»Ø?âÕÒ5¸?âÔæ–{†?âÔæ’ö@b?âÔ³W,5[?âÔ³S¦ùJ?âÔ€Í4˜?âÔ€H?âÔLØ^¢‰?âÔLÔÙy¡?âÔ˜àFš?âÔ•['G?âÓæYR\®?âÓæUÍFï?âÓ³µŒ?âÓ³/÷b?âÓÚÈj?âÓÖ‚ÅÖ?âÓLšK!c?âÓL–Æ(c?âÓZ~¸Í?âÓVùÉb?âÒæ¢Êˆ?âÒæä±?âÒ²Ú·X:?âÒ²×2{ø?âÒš¼Ft?âÒ—7sÇ?âÒLZ±‚¿?âÒLW,¹§?âÒ— Œ?âÒL ?âÑåÚlöš?âÑåÖè@¬?âѲš3E?âѲ–®™3?âÑYê#?âÑVet^?âÑL‘Oë?âÑL ¶»?âÑÙ)+º?âÑÕ¤œ?âÐ嘱!?âÐå•- ?âвX*^¬?âвT¥â;?âГœ?âÐ)$?âÐKÖí‚ò?âÐKÓiª?âЖ7Úÿ?âÐ’³{L?âÏåUrÂÜ?âÏåQîl¿?âϲžYE?âϲ ¼?âÏ~Óº‚Ì?âÏ~Ð6?Ø?âÏK’Çî?âÏKBÍ?âÏQÄ>Š?âÏN@À?âÎå²+H?âÎå .?âαÏZ|?âÎ±Ì =Ü?âÎ~Ž__1?âÎ~ŠÛL&?âÎKMô?âÎKI›~?âÎ Ï^D?âÎK^c?âÍäÊp[ï?âÍäÆìe¤?âͱ‰û‚?âͱ…~Ì?âÍ~G„!–?âÍ~D>t?âÍK÷ î?âÍKs0a?âÍÄZ™?âÍÀÖÉ$?âÌä‚®–¨?âÌä*ÐF?â̱@ó•‰?â̱=oؼ?âÌ}ÿ)]@?âÌ}û¥ª?âÌJ½OµP?âÌJ¹Ì ­?âÌ{fÙ~?âÌwã9q?âËä9n‘O?âËä5êú×?âË°÷fûx?âË°óãn•?âË}µP6©?âË}±Ì³[?âËJs*DŠ?âËJo¦ÊÑ?âË0õ ¬?âË-q™‰?âÊãî°ÁÐ?âÊãë-[B?âÊ°¬]4~?âÊ°¨Ù×…?âÊ}iú)>?âÊ}fvÕÚ?âÊJ'ˆì?âÊJ$Ì?âÊåß?âÊპß?âÉã¢vi^?âÉãžó2º?âÉ°_Öðy?âÉ°\SÃj?âÉ}(;ð?âÉ}¥v?âÉIÚj0`?âÉIÖç|?âÉ—&‹?âÉ”ɧ?âÃ{1OSc?âÃ{-ÍOm?âÃGìÎÃÔ?âÃGéLÉs?âè?d%?âä½s[?âÂác¡5ö?âÂá`NÁ?â®ô:å?â®r]F?âÂzÚ8:?âÂzÖ¶f‡?âÂG•m•?âÂG‘ëÃ!?âÂP“Þ•?âÂM·?âÁá «i(?âÁá)±ß?âÁ­Æ´Kï?âÁ­Ã2ž=?âÁz®1‹?âÁz~,n?âÁG<™U—?âÁG9»?âÁ÷uÖ¬?âÁóôE»?âÀà²C|q?âÀà®Áõ?âÀ­me|?âÀ­i€ç¶?âÀz'²“m?âÀz$1=?âÀFâSêå?âÀFÞÒ€K?âÀœæŠ?âÀ™e){?â¿àWjÒ?â¿àSé9c?â¿­ßÅ‚?â¿­^wª?â¿yÌFG,?â¿yÈÅé?â¿F†ž4d?â¿Fƒù·?â¿@ç7Ü?â¿=fÅ?â¾ßû!ª?â¾ß÷ ‚š?⾬µM©·?⾬±Ì‹Ë?â¾yoj§r?â¾yké“?â¾F)yÌ?â¾F%ø ?â¾ãxÿ\?â¾ß÷þ2?â½ßj"Ö?â½ß™é+C?⽬WL¾Â?⽬SËÐÄ?â½y Ô¼?â½y ŸðT?â½EÊæ{?â½EÇe4ª?⽄œª?â½ÙQ?â¼ß>Dþl?â¼ß:Ä6Æ?⼫÷Þ{è?⼫ô]½Ù?â¼x±i{?â¼x­èÇ?â¼EjåþË?â¼EgeSç?â¼$Sêt?â¼ ÓI'?â»Þݳ@?â»ÞÚ2¨Z?⻫—gs?âºwí¸¾Ô?âºwê8j7?âºD¦¤.×?âºD£#ãÐ?âº_L?âº\ÕÛ?â¹ÞO³­?â¹ÞÏ{Ò?⹪Ñ˵?⹪Íq?â¹w‰Á`ý?â¹w†Aä°×?â¹úù}}?â¹÷ykû?â¸Ý³êú?â¸Ý¯ÿã?⸪k÷Ùä?⸪hwÛŽ?â¸w$a,Ï?â¸w á8?â¸Cܼ!j?â¸CÙ<6A?⸕Ö>?⸑ˆôª?â·ÝMFö?â·ÝIÇ?â·ªvÙT?â·ª÷ í?â·v½˜?â·vº¼¾?â·Cu«¶‰?â·Cr+ûO?â·-°–Å?â·*0å!?â¶Üå§@Â?â¶Üâ'˜µ?ⶩ|F?ⶩšÝÏ?â¶vUigÒ?â¶vQéÒñ?â¶C 5!ê?â¶C µ– ?â¶ÄòUd?â¶ÁrÓ°?âµÜ|¡”l?âµÜy"N?⵩4Blò?⵩0Âþk?âµuëÕ^?âµuèUµm?âµB£Ydu?âµBŸÚ ?âµZφ¤?âµWP4à?â´Ü7H¬?â´Ü¸~?⴨ɑá?â´¨ÆÄJ?â´u€Ü}?â´u}]H?â´B8Õ›?â´B4šª0?â´ïHñO?â´ëÉÏ{?â³Û¦j ˆ?â³Û¢êóJ?⳨]|Ï&?⳨YýÀ?â³uZ¦?â³uU•?â³AËẇ?â³AÇøÑ ?Ⳃ_ì”?â³~àú°?â²Û9:/ø?â²Û5»G«?ⲧð$´?ⲧì‡Eþ?â²t¦Ä# ?â²t£EMë?â²A]sòÎ?â²AYõ'D?â²²v?â²–ðƒ?â±ÚÊ©c•?â±ÚÇ*«8?Ⱨ.Íþ?Ⱨ}°8?â±t7¦Iï?â±t4'¤À?â±@îŸ:?â±@ê‘¡?â± ¤jìS?â±  ìZQ?â°ÚZ¸O¶?â°ÚW9ÇJ?â°§÷‘1?â°§ y\?â°sÇ(Ïö³ß?â¬q÷+»?â¬qôvC?â¬>¬œ ?â¬>©s??⬠a›ÿ?⬠^rµ?â«ØŒ2D?â«Ø™‘?⫤Ëovð?⫤ÇñçÔ?â«q€Dúñ?â«q|Çul?â«>5 ¢ÿ?â«>1'?â« éÆ…?â« æI.?âª×žr¼?âª×šõSR?⪤S0:?⪤O“Ñ?âªq¡Îµ?âªq$y"?âª=¼$ÒÁ?âª=¸§†Å?⪠p™çk?⪠m¥?â©×%dÉ?â©×!„+û?â©£Ù[¾?â©£ÕÝã‡?â©p¦òÜ?â©pŠ)Íh€?â© ößÿ?â© ò˜Í?â¨Öª8ÓP?â¨Ö¦»Êu?⨣^Nß?⨣ZÑ›?â¨pU»@?â¨pØÅ“?â¨<ÆO³?â¨<ÂÒÆê?⨠z<°?⨠v¿"1?â§Ö.±à?â§Ö*Øø?⧢áëŸM?⧢ÞnÏü?â§o•¯0?â§o’2Bw?â§þ?â—šfuo?â—gŽ¢B?â—gÛß?â—3É!6¦?â—3ŧyÛ?â—x¦ý°?â—u-J|?â–Í(¿~?â–Í$¦â?▙׋¶þ?â–™Ôû?â–f†ëp?â–fƒql?â–36=0†?â–32ã²?â•ÿå‚ÒQ?â•ÿâ O?â•Ì”»vƒ?â•Ì‘Aüß?â•™CçX?â•™@mè?â•eóxz?â•eï?â•2¢¼–?â•2žŸ_º?â”ÿQBž?â”ÿM¤ïZ?â”Ìïh?â”Ëü¥¼?┘¯ýà?┘«‰½Ë?â”e]â6$?â”eZhÿ¨?â”2 ´™¾?â”2 ;lÚ?â“þ»z€I?â“þ¸\ý?â“Ëj3x…?â“Ëfº^Ñ?ⓘß ¨?ⓘfŒ?â“dÇPN?â“dÄIÊ?â“1v:?â“1r™M?â’þ$˜J?â’þ!V°?â’ÊÓí.?â’ÊÏ™r?â’—~Çá?â’—~ç½?â’d/ÞÛ¢?â’d,f?â’0Þ2zß?â’0Ú¹­ë?â‘ýŒyP˜?â‘ý‰?âƒÁf˜ ?âƒÁbœ}ö?⃎â¸Ö?⃎ l¨Z?âƒZ»¦õ—?âƒZ¸0î´?âƒ'f_lY?âƒ'béo?â‚ô ¬D?â‚ô •¸“?â‚À»¬ •?â‚À¸6"|?â‚f@ŽÈ?â‚bÊ®H?â‚ZÉÁ?â‚Z S@Ú?â‚&»EŒi?â‚&·Ï¿?âóe¶`‘?âób@œÜ?âÀ#^?âÀ ¥iB?⌺sòá?⌶þB]?âYdÁ À?âYaKbÕ?â&÷(?â& ŒYÖ?â€ò¹7.á?â€òµÁ›'?‿c`•Ò?‿_ë ²?‌ }ôT?‌ sÍ?â€X·¡”?â€X´*¦?â€%a•eî?â€%^ø˜?âò BÛ?âòß?â¾µ}Vj?â¾²üG?â‹__¢?â‹[êQˆ?âX 6'Q?âXÀà_?â$³Ë?â$¯‹·?â~ñ\¿äz?â~ñYJ°»?â~¾sÉ?â~¾ýØ¢?â~Š°}&?â~Š¬¥\˜?â~WY¶î?â~WVAù?â~$Eý,?â~#ÿÐïÐ?â}ð¬ÊÊ?â}ð©U?â}½VBŒî?â}½RÍ’Ä?â}‰ÿ¯!Ú?â}‰ü:1I?â}V©8:?â}V¥›QB?â}#Re{è?â}#Nðž‰?â|ïû¯ å?â|ïø:7?â|¼¤ìæ°?â|¼¡xƒ?â|‰N-G?â|‰Jªl³?â|U÷E§?â|UóÐð?â|" `Ž¤?â|"œëáC?â{ïIoåp?â{ïEûA§?â{»òsWT?â{»îþ½$?â{ˆ›kWï?â{ˆ—öÇY?â{UDW¯ª?â{U@ã(­?â{!í8_ü?â{!éÃâ˜?âzî– £q?âzî’™/¦?âz»>×Bm?âz»;bØ;?âz‡ç•>p?âz‡ä Ý×?âzTGµs?âzTŒÓ^s?âz!8îoä?âz!5z"~?âyíá‰ÄÒ?âyíÞ?âyºŠ|¦?âyº†¥Br?ây‡2µb?ây‡/)„Ç?âySÛSõ?âyS×¢,ó?ây ƒƒv^?ây €Xö?âxí+å‘?âxí(píÁ?âx¹Ô;Ž?âx¹ÐÇ X?âx†|…¹G?âx†y¸ª?âxS$ÄôÝ?âxS!PýÚ?âxÌøŸ±?âxÉ„²F?âwìu!Ã?âwìq­,ò?âw¹=óú?âw¹ÊÂ?âw…ÅOgW?âw…ÁÛ–¹?âwRmU3C?âwRiál=?âwOËE?âwÜ Ù?âvë½>ÛI?âvë¹Ë'v?âv¸e"G?âv¸a®×?âv… úÛ6?âv… ‡:–?âvQ´Ç•?âvQ±Sþ?âv\‰"6?âvY”É?âuë?K6?âuëËÇb?âu·«éôù?âu·¨vz¾?âu„S‰v{?âu„PÙ?âuPû{¬?âuP÷ª¤?âu¢¦?âuŸ2¨”?âtêJ#Oõ?âtêF¯ü ?ât¶ñ•wt?ât¶î"-8?âtƒ˜ü(z?âtƒ•ˆç×?âtP@Wy?âtP<äfp?âtç§×ã?âtä4ªt?âséŽì 2?âsé‹y|[?âs¶6&0Ú?âs¶2³?âs‚ÝT‹J?âs‚Ùáz§?âsO„wwÿ?âsOpõ?âs+1h?âs(3÷?ârèÒ›Õu?ârèÏ(áž?ârµy,ž?ârµv*B`?âr‚ “8[?âr‚ W·?ârNÇ~3?ârNÄ \ ?ârn]ÈÒ?ârjêûa?âqè2Ps?âqè¿Œ›?âq´»û®ò?âq´¸ˆô´?âqb¹ÉI?âq_G¥?âqN l½d?âqNúY?âq°©3?âq¬¢ Á?âpçV±U6?âpçS>Á^?âp³ýBßU?âp³ùÐU?âp€£É,’?âp€ V«î?âpMJDwL?âpMFÒ@?âpð´¤~?âpíB7 ?âoæ—µŸ?âo擧QÇ?âo³=s¦?âo³:5h?âoãÂPƒ?âoàOÿÞ?âoLŠ2’?âoL†“ë†?âo0>Ål?âo,̇ú?ânåÖl|`?ânåÒúHˆ?ân²|ï?ân²yõ±?ân"¦•?ân4tv?ânKȳ>?ânKÅ@ÿ2?ânn´¤Í?ânkB—[?âmå« O?âmå9w?âm±º–~ ?âm±·$ƒâ?âm~`vè>?âm~]÷š?âmKLI?âmKÚb?âm¬¾œ?âm¨¤á+?âläQÖJ4?âläNdv]?âl°÷ŠíS?âl°ô#?âl}4Œû?âl}™ÂÌW?âlJBÓ*š?âlJ?as?âlèfä?âläõ6§?âkãïºâ?âkãŠ~ ?âk°3m§™?âk°/ü \?âk|ØàÉP?âk|Õo8­?âkI~HñK?âkIz×jB?âk#¦YÝ?âk 4Üm?âjâÈøË–?âjâŇWÀ?âj¯n@dS?âj¯jÎú?âj|}Að?âj| áN?âjH¸®ô&?âjHµ=?âj]Õî?âjZd ­?âiâòM®?âiáÿ Ù?âi®¨¢•?âi®¤’hZ?âi{M '?âi{I˜ö|?âiGòŠ?âiGî”îƒ?âi–öýœ?âi“…à/?âhá;ÝRq?âhá8l>?âh­à¸À2?âh­ÝGµø?âhz…‰HS?âhz‚G³?âhG*O]ë?âhG&Þfå?âhÏ tS?âhË™†ç?âgàsºÅÐ?âgàpIáþ?âg­`p9?âg­ï–?âgy¼û‘f?âgy¹ŠÀÇ?âgFa‹œ¶?âgF^Õ±?âg!¦?âg d(?â`@úÇ4?â` j>’ ?â` fÏ$¯?â_Ú H¯?â_Ú ÙK^?â_¦°H^?â_¦¬Ùõ?â_sS=¼Ã?â_sOÎl8?â_?ö(̆?â_?ò¹…•?â_ ™ rp?â_ •š5?â^Ù;߈?â^Ù8p—É?â^¥Þ«÷L?â^¥Û<Í*?â^rm¿?â^r}þž‡?â^?$%@“?â^? ¶)¥?â^ ÆÒ}E?â^ Ãcoò?â]Øiu’â?â]Øf)?â]¥ -Ç?â]¥Ÿ3©?â]q®œˆ?â]q«-—?â]>Q £+?â]>M±¼@?â] óšd ?â] ð+†Ð?â\×– !e?â\×’›M¯?â\¤8o£¯?â\¤5Ù”?â\pÚÊ—b?â\p×[Öá?â\=}‹›?â\=y¬Ôµ?â\ bI?â\ ó›Ç?â[ÖÁžÑ3?â[Ö¾0-‚?â[£cÑ%b?â[£`b‹J?â[pùc]?â[pŠÒà?â[<¨Sã?â[<¤¨Í?â[ J+1?â[ F¼³½?âZÕì4ü+?âZÕèƈ}?âZ¢Ž4~?âZ¢ŠÆ?âZo0)ðË?âZo,»R?âZ;Òr?âZ;Χ4?âZsö‘ý?âZpˆD¹?âYÕÍŠž?âYÕ_Fõ?âY¡·š–?âY¡´,[ð?âYnY]`?âYnUï0?âY:û$`?âY:÷§ý…?âYœÄÆ‚?âY™V©B?âXÔ>id®?âXÔ:ûQ?âX àJ?âX Ü•ö??âXm”~m?âXm~&}ü?âX:#üÏ?âX:­ù?âXÄ—`…?âXÁ)sJ?âWÓf ÇH?âWÓb›ã§?âW r2|?âW Xv?âWl¨Ð£†?âWl¥bÓ?âW9J%Ð?âW9F·Tþ?âWëoœ¾?âWè߇?âVÒŒ° f?âVÒ‰BWÉ?âVŸ-æ¡Ð?âVŸ*x÷Î?âVkÏ(¿?âVkË¥ˆX?âV8p5Ú8?âV8lÈCk?âVN?âV àñÔ?âUѲ]4Ü?âUÑ®ï±E?âUžSaý!?âUžOôƒ$?âUjô]Ï?âUjðï¡m?âU7•MæÒ?âU7‘à€ ?âU64îÀ?âU2Ç‘“?âTÐ×*þ?âTÐÓ¤×k?âTw倥?âTtx6­?âTj®ñ?âTjA°»?âT6¹n}À?âT6¶Fý?âTZ$DL?âTV·$?âSÏúÐ Š?âSÏ÷béü?âSœ›rL ?âSœ˜2?âSi< s½?âSi8ce?âS5ܘÚç?âS5Ù+Ô*?âS}Ÿ2?âSy°¢?âRϘm*?âRÏ+y¢?âR›¾ ~Æ?âR›ºœ”Ù?âRh^pñ°?âRh[^?âR4þÎ9é?âR4ûac1?âRŸ"%õ?âR›µXØ?âQÎ?lHf?âQÎ;ÿ„ã?âQšß¬ÓÉ?âQšÜ@á?âQgãô?âQg|và§?âQ4 ¹Ö?âQ4¤#?âQÀ3úþ?âQ¼Ç]æ?âPÍ`MÆå?âPÍ\á3h?âPš]Ê?âP™üñ@=?âPf d?âPfœ÷…Ç?âP3@`|?âP3<ôi?âOÿàS‚a?âOÿÜçO?âOÌ€<©E?âOÌ|ÐEÎ?âO™ c-?âO™° Q?âOe¿ò\º?âOe¼† y?âO2_¾³†?âO2\Rlà?âNþÿhû?âNþü+ð?âNËŸ:š´?âNË›ÎgD?âN˜>ê™?âN˜;}çÃ?âNdÞëF?âNdÛ#Ë ?âN1~,a¡?âN1zÀK?âMþ¿!F?âMþSA?âMʽHGÚ?âMʹÜDo?âM—\È;?âM—Y\k?âMcü>$ ?âMcøÒ3Õ?âM0›ªÀ+?âM0˜>Ù‘?âLý; Ⱦ?âLý7¡ë¿?âLÉÚg?!?âLÉÖûk½?âL–y·@ø?âL–vKw/?âLcýÏŸ?âLc’q?âL/¸:Ð:?âL/´Ï¦?âKüWnD+?âKüT—2?âKÈö˜eK?âKÈó,Áí?âK••¸ü?âK•’Mb¼?âKb4Ð (?âKb1d{?âK.ÓÝ’¬?âK.Ðr ?âJûrá°¢?âJûov3°?âJÈÜ‚£?âJÈqL?âJ”°ÍíØ?âJ”­b„?âJaOµ×d?âJaLJwC?âJ-î”@¦?âJ-ë(ê ?âIúi®?âIú‰þ2Ã?âIÇ,5$ò?âIÇ(Éá¢?âI“Ê÷†€?âI“ÇŒLË?âI`i°¥´?âI`fEuš?âI-`/I?âI-õË?âHù§] ?âHù£›@'?âHÆE£LŽ?âHÆB89F?âH’ä6ÆÊ?âH’à˽?âH_‚Á‰?âH_Vw?âH,!Aíñ?âH,Ö÷z?âGø¿¹b?âGø¼N”†?âGÅ^'Ýq?âGÅZ¼ú0?âG‘ü~?âG‘ù")Ø?âG^šèØ®?âG^—~£?âG+9;^d?âG+5Зô?âF÷ׄ•û?âF÷ÔÙ&?âFÄuÄ€Ò?âFÄrYÍ™?âF‘û<€?âF‘’â?âF]²(®)?âF]®¾&?âF*PL×0?âF*Lâ@È?âEöîgÕ&?âEöêýHY?âEÃŒy©i?âEÉ&7?âE*‚9?âE'¿ˆ?âE\È…®?âE\Ų?âE)fwô?âE)c ¡?âDöeOà?âDöúó?âD¢I‹q?âDžß8G?âD@$¨?âD<º^€?âD[ÝöŠè?âD[ÚŒJô?âD({¿Q?âD(xU)?âCõo?âCõì²?âCÁ·5«§?âCÁ³Ëˆ…?âCŽTã ˆ?âCŽQxð?âCZò‡lÍ?âCZï\á?âC'"žr?âC'Œ¸˜"?âBô-´Ø-?âBô*JÛx?âBÀË=ÿ0?âBÀÇÔ ?âBh¾Ò?âBeT+S?âBZ5s?âBZË:?âB&££g?âB& 9;?âAóAÞä?âAó=ž7?âA¿ÞcØÆ?âA¿Úú´?âAŒ{¶ä÷Ú?â@‹Îu²?â@‹ŠdìD?â@X*ë^?â@X'Þ3?â@$Çÿ}–?â@$Ä–_?â?ñe 5?â?ña¡™?â?¾ ¢–?â?½þ£?•?â?ŠŸã?â?Š›œ‰¯?â?W;ö'Ü?â?W8ŒØ?â?#ØÝŽr?â?#ÕtHC?â>ðu¼4X?â>ðrR÷Å?â>½‘Æp?â>½(“x?â>‰¯^š‹?â>‰«õq.?â>VL"]‹?â>VH¹=Ê?â>"èÝeB?â>"åtO?â=ï…³?â=ï‚&¦y?â=¼"8ó¼?â=¼ÏðÍ?â=ˆ¾Ù}3?â=ˆ»pƒß?â=U[qy?â=UX(À?â=!÷ÿã ?â=!ô–üï?â<î”…Â ?â<î‘åž?â<»1'ž?â<»-šT¸?â<‡Íwˆ,?â<‡Ê¾á?âñ{)?â;º;ˆØL?â;†Û: Å?â;†×Ñs„?â;Swy½©?â;St.?â; °ã”?â; H]Š?â:ì¯ß+z?â:ì¬v¯ ?â:¹LÎû?â:¹Hœ\(?â:…è!Ïd?â:…ä¹f,?â:R„5õ×?â:R€Í–;?â: A{ç?â:Ù%æ?â9ë¼DFÌ?â9ë¸Ûúg?â9¸X>?â9¸TÖMU?â9„ô0Ø?â9„ðÇ˪?â9QìŸ?â9QŒ°½ ?â9+ù,ª?â9(‘³?â8êÇÐÆQ?â8êÄh©õ?â8·cŸÈû?â8·`7¶;?â8ƒÿf5ÿ?â8ƒûþ,Ú?â8P›$ ?â7O¡òuÀ?â7@å?â7=}:3?â6èÜgA?â6èØÿ„Ì?â6µwá Š?â6µtyVÞ?â6‚R~?â6‚ê]n?â6N®º·¾?â6N«SI?â6Jôw?â6F³^ž?â5çår“Ö?â5çâ ™?â5´€ÁÁV?â5´}Z>´?â5~L?â5¡F?â5M·F¡è?â5M³ß2}?â5R|e¯?â5Oÿà?â4æí©Êù?â4æêBnÆ?â4³ˆÎÅ?â4³…grp?â4€#ë+?â4€ ƒâ?â4L¾ÿD¢?â4L»˜A?â4Z Úâ?â4V£¥?â3åõF?â3åñ¦í?â3² +?â3²Œ¡ìž?â3*ûw²?â3'”^Á?â3KÅå~M?â3KÂ~nø?â3`Ç@h?â3]`:®?â2äû •3?â2äø9™?â2±–q¨ ?â2±“ µž?â2~1:^u?â2~-ÓuŽ?â2JËúc?â2JÈ“°?â2f²tf?â2cKž·?â1äb*æ?â1ãýû^Ò?â1°œ Š?â1°˜¢Ç?â1}6¨…A?â1}3AÌf?â1IÑ?cì?â1IÍØ´­?â1kÍÓ.?â1hg-Š?â0ãT „?â0ãíp|?â0¯ Ò9?â0¯k~Í?â0|;G¸?â0|7á/¼?â0HÕµ-è?â0HÒN®³?â0pŽ¯?â0l´?â/â wyü?â/â ÿ?â/®¤ÌEP?â/®¡eâî?â/{??â/{;²§>?â/GÙ]I9?â/GÕöú?â/s™„r?â/p3>å?â.á Í–õ?â.á g[?â.­§ùIô?â.­¤“ž?â.zBþ?â.z>¶æD?â.FÜ8¡A?â.FØÒ‚#?â.vL ?â.råì‰?â-àW2²?â-à ñ&Ë?â-¬ªZl¢?â-¬¦ôjW?â-yDU@÷?â-y@ïHH?â-EÞH/¨?â*Ý6ì?â*ÝÑpC?â*©¬Á¯"?â*©©\<û?â*vFDx ?â*vBß~?â*Bß¿H ?â*BÜYé?â*y2 s?â*uÌË ?â)Ü”?â)Ü7¶Ü?â)¨«ÿýÂ?â)¨¨š»¦?â)uEZ÷??â)uAõ¾¿?â)AÞ­þb?â)AÛHÏ~?â)wù0?â)t” 8?â(Û<Žà?â(Û ×s5?â(§ªwâÍ?â(§§о?â(tC«Wœ?â(t@FO)?â(@Ü× ?â(@Ùr Æ?â( uú·?â( r•ÁÛ?â'ÚˆX?â'Ú ±œ¹?â'¦¨*›·?â'¦¤Å¹´?â'sA6ºz?â's=Ñâ?â'?Ú;ô?â'?ÖÖ3*?â' s7q?â' oÒÊC?â&Ù ,:=?â&ÙÇ~«?â&¥¥-¨?â&¥¡´{²?â&r=þA?â&r:™˜¦?â&>ÖÛu?â&>ÓvÖÑ?â& o°ö¦?â& lLa„?â%Ø~·?â%Ø, ?â%¤¡Dœ?â%¤à ³?â%q:Ô?â%q6ž[Ë?â%=Ò¹@N?â%=ÏTÑ?â% kgñŽ?â% hŒy?â$×é"?â$ת©?â$£œ®6W?â$£™Iäz?â$p5E¾|?â$p1áv;?â$<ÍÕÝ?â$<ÊqR8?â$ f]®Æ?â$ bùy¾?â#ÕþÞ†?â#Õûyî?â#¢—Vîb?â#¢“òÌ’?â#o/È®?â#o,cúz?â#;È1yµ?â#;ÄÍk?â#`“N¾?â#]/IÂ?â"Ôøí…?â"Ôõ‰‰¸?â"¡‘?ô?â"¡ÜS?â"n)Šâö?â"n&&úÏ?â":ÁÎ7?â":¾jXƒ?â"Z Õª?â"V¦¼?â!Óò=ê?â!ÓîÚ½?â! ŠjgŒ?â! ‡¥Ö?â!m"]h?â!m+¥N?â!9º¬°÷?â!9·Iy?â!RÂ~?â!O^Ú?â ÒêЮN?â Òçm ?â Ÿ‚×L®?â Ÿs»?â lÖwæ?â lrïÙ?â 8²ÎH?â 8¯jˆØ?â J¾?â GZ£D?âÑâ¦Ç™?âÑßC\a?âžz‡ß*?âžw$}?âka|?âkþ$ ?â7ª3Ÿ€?â7¦ÐQ?âAþ<ã?â>šø?âÐÙÁct?âÐÖ^(J?âq}r?ân@r?âj 2(W?âjÏf?â6 ß§£?â6|‰N?â8…«G?â5"–Ž?âÏÐ$—?âÏÌÁ {?âœg»D¼?âœdXC†è?â[;&`ë?â'ÔBþ¥?â'Ðâ?âôiø/?âôf—»$?âÀÿ¦–n?âÀüF,?â•N_Ó?â‘íÿ!?âZ*ïFÓ?âZ'Žï¾?â&À‰v€?â&½))?âóVþ?âóR¼º)?â¿ë©¦ï?â¿èIl¯?âŒ/¸%?âŒ}χƒ?âY¯ ?âYNâ?â%¬';?â%¨ÇaÒ?â òA™ak?â ò>9Mž?⠾ו?â ¾Ó¤Šá?â ‹lhñ¦?â ‹iñ?â Xƾ ?â WþfÇ?â $—í–?â $“¾3?âN(×Æ?âN%y€?â½ ¸?â¹®{=?âçQ;X×?âçMÝ%®?â³åcÆ?â³âœt?â€y†¼?â€v'àÍ?âM ¡î€?âM CØ.?â¡·º6?âžY­?âæ5ÇW/?âæ2iT?â²ÉиÉ?â²Ær¿O?â]Óà>?âZuð`?âKñÐøt?âKîs3?â…ǽ7?â‚ià“?â布?âåZ°?â±­£Û?ⱪE)° ?âJÕe¶!?âJÒÿñ?âi=Ø7?âeà+¥?âãýÊ?âãù²' ?â°ÛŒÂ?â°}ói?â}$¡u?â}!CåD?âI¸aã?âIµŽÅ?âL¥/?âH½(®?áÿâßÎPÆ?áÿâÜpÝâ?áÿ¯s{·³?áÿ¯pNl?áÿ|#»?áÿ|ų?áÿHšÄŒº?áÿH—g6­?áÿ._á„?áÿ+•?áþáÁõ;ú?áþá¾—ù'?áþ®U„s?áþ®R'V>?áþzé ë ?áþzå°»q?áþG|‘47?áþGy4i›2?áüE; ÕZ?áüÑ«V¶?áüÎNš{?áûÞdçSã?áûÞaŠ¡E?áûªø\u?áûªôÀ³t?áûw‹Mq©?áûw‡ðÒF?áûDw¾R?áûD(Œ?áû±œC¨?áû®?·?áúÝDºËl?áúÝA^Hà?áú©×Ór’?áú©Ôvù¤?áúvjæcð?áúvg‰ôŸ?áúBýó[f?áúBú–õ²?áúú­^?áúžQH?áùÜ#ü¾?áùÜ ŸÃD?áù¨¶÷£ ?áù¨³›ZÃ?áùuIíf?áùuF‘&Ô?áùAÜÝl4?áùAÙ6’?áùoÇœ?áùlka—?áøÛ¬¸?áøÚÿOüP?áø§•ŠÛh?áø§’.Â?áøt(cà¦?áøt%Ñy?áø@»7ê?áø@·ÛZ?áø NÍ0?áø J¨Ñ=?á÷ÙàÍ/e?á÷ÙÝq=?á÷¦säU?á÷¦p3û?á÷sLû?á÷sñú?á÷?™Y"?á÷?•¨ƒ¤?á÷ +¶f?á÷ (ZO†?áöؾbC?áöØ»€Ù?áö¥QŒ.?áö¥M¬Óˆ?áöqã©XÖ?áöqàM©Í?áö>vDdû?áö>rè¿?áö ÙÛj?áö ~?œ?áõ×›i¯{?áõטJ?áõ¤-óþ?áõ¤*˜uƒ?áõpÀx‘?áõp½?áõ=R÷“"?áõ=OœÉ?áõ åq`?áõ ⧤?áôÖwäÛ›?áôÖt‰y}?áô£ S2H?áô£÷ÙÇ?áôoœ»ï ?áôo™` (?áô£?ááóÞæÈÑ?ááÀrÉï?ááÀorr?ááP…Œ?ááŒÿø¾~?ááY“ÒYÈ?ááYzœW?áá&$Oˆ”?áá& ÷ÔÁ?áàò´ÇÛñ?áàò±p1¼?áà¿E;§Ê?áà¿Aä3?áà‹ÕªÑ·?áà‹ÒS:½?áàXf#¼?áàXb½–`?áà$özñÂ?áà$ó#n?áßñ†Ü–?áßñƒ„™u?áß¾8|ž?áß¾á ?áߊ§.?áߊ¤8Ç?áßW7ãmÝ?áßW4Œ•?áß#È1ê§?áß#ÄÚ–ý?áÞðX{Ü®?áÞðU$’¢?áÞ¼èÁ)Œ?áÞ¼åié?áÞ‰yà5?áÞ‰uª©e?áÞV >sâ?áÞVçF¯?áÞ"™vÞö?áÞ"–»`?áÝï)ª¡ø?áÝï&Sˆ?áÝ»¹Ùçi?áÝ»¶‚×?á݈J¾:?á݈F­·~?áÝTÚ*ðw?áÝTÖÓóY?áÝ!jL¨ ?áÝ!fõµ?áÜíúiõ¨?áÜí÷ Å?áܺŠ‚“Ô?áܺ‡+³?á܇–Ö÷?á܇@P?áÜSª¦¤±?áÜS§Oק?áÜ :±ÔÒ?áÜ 7[g?áÛìʸ­f?áÛìÇaó˜?áÛ¹Z»D?áÛ¹WdV?áÛ…ê¸î[?áÛ…çbGÉ?áÛRz²fÖ?áÛRw[Éá?áÛ §pÜ?áÛPÝ…?áÚ뚘^?áÚë—A‘¥?áÚ¸*„>0?áÚ¸'-¾?áÚ„ºl]?áÚ„·¨ß?áÚQJOmi?áÚQFùŠ?áÚÚ.nX?áÚÖØ ?áÙêj ?áÙêf²»ë?áÙ¶ùßd4?áÙ¶ö‰.?áÙƒ‰±2&?áÙƒ†Zë½?áÙP~àé?áÙP(¤?áÙ©H‚?áÙ¥ñÐU?áØé9 û|?áØé5¶Ñí?áصÈÍ’è?áصÅwrö?áØ‚X‰Ø¶?áØ‚U3Âc?áØNèA²ˆ?áØNäë¥Ò?áØwõt?áØtŸq?á×褾=?á×èNÄÃ?á×´—OÉ#?á×´“ùÙG?á×&ö£¼?á×# ½}?á×M¶™?á×M³C;~?á×F7^„?á×Bá‹?áÖæÕÑx ?áÖæÒ{®§?áÖ³eg.Ü?áÖ³bo?áÖôøÈà?áÖñ£·?áÖL„†þ?áÖL0qs?áÖ=?áÖ¹š1?áÕ壔'f?áÕå >Ž?áÕ²3ù‚?áÕ²/¿iÑ?áÕ~‘oÑ?áÕ~¿;é½?áÕKR Þ?áÕKN´aŒ?áÕá~÷?áÕÞ(©?áÔäpîX?áÔäm˜¦?áÔ±Yþ?áÔ°ýžq?áÔ}Á²>?áÔ}Œl\@?áÔJ%H?áÔJÏü/?áÔ®„´h?áÔ«/q¥?áÓã=ào?áÓã:ŠÙJ?áÓ¯Í7cË?áÓ¯Éâ4D?áÓ|\ŠŽ!?áÓ|Y5h7?áÓHëÙ®?áÓHè„‘Ð?áÓ{$Û?áÓwÏ{.?áÒâ ke‰?áÒâ\y?áÒ®™®D ?áÒ®–YD˜?áÒ{(ìó‡?áÒ{%—ý³?áÒG¸'¹ß?áÒG´Òͪ?áÒG^Š{?áÒD §ã?áÑàÖ‘ ?áÑàÓ<;?áÑ­e¿·ä?áÑ­bjèˆ?áÑyôê¸Ç?áÑyñ•ó ?áÑF„Z?áÑF€½c:?áÑ5œ…?áÑàê?áÐߢU1m?áÐߟˆ‰?áЬ1pµü?áЬ.µ?áÐxÀˆbK?áÐx½3Ì£?áÐEOœ?áÐELGú?áÐÞ«»?áÐÛW8ª?áÏÞm·…R?áÏÞjc „?áϪü¿n$?áϪùjþó?áÏw‹ÃMs?áÏwˆnçá?áÏDÃi?áÏDo #?áÏ©¿´s?áϦkb?áÎÝ8¸4?áÎÝ5cÌ|?áΩǬ~Â?áΩÄX?§?áÎvVr?áÎvSHåõ?áÎBå‰Ã5?áÎBâ5—V?áÎtr e?áÎq~$?áÍÜW¦b?áÍÜ¿?áͨ’8È—?áͨŽä¹’?áÍu!1^?áÍuÂ+÷?áÍA¯ïÆ^?áÍA¬›Ê–?áÍ>ňº?áÍ;q–?áÌÚÍ—‡N?áÌÚÊCžÁ?á̧\eÐü?á̧Yò ?áÌsë0/ø?áÌsçÜZ§?áÌ@yöÜP?áÌ@v£?áÌ ¹Én?áÌ fY?áËÙ—xøq?áËÙ”%?ú?á˦&4j|?á˦"໤?áËr´ì ²?áËr±˜{w?áË?C Ã?áË?@Le&?áË ÒPB´?áË Îü°µ?áÊØ`üÌ6?áÊØ]©CÕ?áʤ若?áʤìRñ?áÊq~JÈ0?áÊqz÷S ?áÊ> ì<è?áÊ> ˜Ña?áÊ ›Š s?áÊ ˜6©Š?áÉ×*$B¨?áÉ×&Ðê]?áÉ£¸ºÈ8?áÉ£µgy‹?áÉpGM?áÉpCúJ?áÉ<Õܵ7?áÉ<Ò‰yÆ?áÉ dhH?áÉ aB?áÈÕòð ?áÈÕïœ÷å?áÈ¢tg‘?áÈ¢~!Hú?áÈoõ-R?áÈo ¢Y?áÈ;žr;ž?áÈ;›0D?áÈ,ë¼Ã?áÈ)˜»?áÇÔ»a¤%?áÇÔ¸¬?áÇ¡IÔ?áÇ¡F?áÇmØB·Þ?áÇmÔïÒü?áÇ:f®á?áÇ:c[&?áÇõ¶¨?áÇñÂå?áÆÓƒy×P?áÆÓ€'H?áÆ Ú€e?áÆ ‡Áû?áÆl 7—ž?áÆlœäâÒ?áÆ9.‘?áÆ9+>rí?áƼç>?áƹ”œ‰?áÅÒK9ÝR?áÅÒGçE`?áÅžÙˆï.?áÅžÖ6`Û?áÅkgÔ‚„?áÅkdýÏ?áÅ7ö˜u?áÅ7òÊ^?áÅ„a?Ò?áÅÎY?áÄÑ¢‡s?áÄÑP˜?áÄ àªã?áÄŽL¦?áÄj/÷Î?áÄj+É£/?áÄ6½Sá§?áÄ6º–¦?áÄKˆ[Ù?áÄH6w?áÃÏÙ¹u5?áÃÏÖg=p?áÃœgçŽL?á¾ý*r\|?á¾ý'! Š?á¾É¸Q´4?á¾Éµlá?á¾–F-ºb?á¾–BÜ|­?á¾bÔ™2?á¾bеe?á¾/aÜm?á¾/^‹B¦?á½ûï¯6?á½ûì]í[?á½È}~‹A?á½Èz-t?ὕ K¾?ὕùó ?á½a™9 ?á½a•Ã5 ?á½.&Ú‡Y?á½.#‰Œ÷?á¼ú´¶?á¼ú±LÅJ?á¼ÇB]¸”?á¼Ç? Ño?ἓÐ ?ἓÌɲ‚?á¼`]Ôt>?á¼`Zƒ V?á¼,ë‹/œ?á¼,è:eQ?á»ùy>ùð?á»ùuî9C?á»Æïƪ?á»ÆŸœ?á»’”mÛ?á»’‘LÀk?á»_"H û?á»_÷h)?á»+¯ïË,?á»+¬Ÿ0ø?áºø=”h&?áºø:C×?áºÄË6º?áºÄÇå“Ã?ẑXÔãþ?ẑU„f¥?áº]æp€²?áº]ã ÷?áº*t 6O?áº*p¸Ì3?á¹÷žê•?á¹öþNŠ?á¹Ã1¬M?á¹Ã‹áUm?á¹Á|?á¹q/N?á¹\ªNj$?á¹\¦þ&€?á¹)7ØM!?á¹)4ˆ?á¸õÅ_A÷?á¸õÂ?á¸ÂRãWn?á¸ÂO“0¥?Ḏàd€ò?ḎÝcÇ?á¸[mâ¿Ÿ?á¸[j’¬?á¸'û^=?á¸'ø3Ÿ?á·ôˆÖ·„?á·ô…†·4?á·ÁLÜÙ?á·Áüæ(?á·£ÀŽ+?á· p¡?á·Z11|â?á·Z-á™l?á·&¾Ÿ·Ä?á·&»OÝí?á¶óL ç?á¶óH»F®?ᶿÙsri?ᶿÖ#«Ï?ᶌfÙ+?ᶌc‰n ?á¶Xô<Ú?á¶Xðìe|?á¶%œ/S?á¶%~L…“?áµòùŠØ?áµò ©ê¶?áµ¾œT:.?áµ¾™£«?ᵋ)¬É?ᵋ&\zä?áµW·9 ?áµW³±µÅ?áµ$DSŠ¿?áµ$A?á´ðÑ£4¤?á´ðÎSÄš?á´½^ð|?á´½[ ¶?á´‰ì:^²?á´‰èëä?á´VyÓa?á´Vv2€1?á´#Ƥœ?á´#w[ ?á³ï”Óy?á³ï¹“†?á³¼!HE¿?á³¼ùk?᳈®…Ô?᳈«5ë?á³U;¿JÓ?á³U8p'¼?á³!Èö¶Ø?á³!ŧ_?á²îV+¡@?á²îRÜ‘d?Ჺã]ïÒ?Ჺàé•?ᲇpˆX?ᲇm>‹¹?á²Sýºkê?á²Súkxê?á² ŠäÒ5?á² ‡•èÓ?á±í “b?á±í½³ž?á±¹¥1ËÏ?á±¹¡âõª?᱆2Tnî?᱆/¢g?á±R¿tb‹?á±R¼%Ÿ£?á±L‘ÞQ?á±IC%?á°ëÙ¬Õ±?á°ëÖ^&?á°¸fÅ<?á°¸cv– ?á°„óÛ¤?á°„ðŒv4?á°Q€îh ?á°Q}ŸÕ9?á° ÿ/¼?á° °¦‰?á¯ê› jÎ?á¯ê—¾ë9?᯷(CH?᯷$ÊÍR?ᯃµ"v?ᯃ±Ô ¯?á¯PB)j?á¯P>Ú¼±?á¯Ï-ip?á¯ËßU?á®é\/,G?á®éXàÜÉ?᮵é.Ÿ?᮵åàY±?ᮂv+›u?ᮂrÝ_4?á®O%ø"?á®Nÿ×Å€?á®úÞ?ᮌÏÑÚ?á­è—?á­èÅw´?á­´ª² ?á­´¦¸œÙ?á­6÷wv?á­3©kM?á­MÃåæ©?á­MÀ—ä?á­PÑØm?á­Mƒß?á¬æÝ»[r?á¬æÚml%?ᬳj¢™¹?ᬳgT´ ?á¬÷‡km?á¬ô9\?á¬L„ißG?á¬L Õ?á¬Jú?ᬠü;&?á«åž'¿X?á«åšÚ"?᫲+;\?᫲'µ…Ä?á«~·ÜP1?á«~´Ž¤7?á«KD³ “?á«KAej8?á«чq‘?á«Î9ØÔ?áªä^Z&æ?áªä[ —È?᪰ë+&?᪰çÝz¦?áª}wù¨M?áª}t¬,l?áªJÆÌ?áªJx ‰?᪑3?᪎BÊw?á©ãXç?á©ã ¸á?ᩯ«ÂF?ᩯ§ÐlÞ?á©|7á%§?á©|4“ÙÞ?á©HÄ¢‡>?á©HÁUE?á©Qa–[?á©N]Î?á¨áÞa´?á¨áÚÑ2Æ?ᨮjÙ Ú?ᨮg‹ûŠ?á¨z÷‘ž^?á¨zôD‚­?á¨G„GöŽ?á¨G€úä{?á¨ü*‚?ᨠ¯"?á§à®;H?á§àša¼&!,?á¡>¸Ú_Á?á¡ H”;«?á¡ EHƒÞ?á ×Õ ?á ×Ñ´ÒÝ?á ¤ak Ž?á ¤^hþ?á píÓ«à?á pêˆï?á =z:x@?á =vîæí?á  ŸŽî?á  T9?áŸÖ“È/?áŸÖ·J?៣d%?៣°™?áŸo«ÃÁØ?áŸo¨xVÿ?áŸ<8!vÂ?áŸ<4Öˆ?áŸÄ}ˆÞ?áŸÁ21C?ážÕP×Ðn?ážÕMŒ‚q?áž¡Ý0N?áž¡Ùå "?ážni‡»?ážnf;Öû?áž:õÜ(Å?áž:ò÷£?áž‚/ï¹?áž~äÈ6?áÔ‚ŒY?áÔ 7nt?á šÓzˆ?á —ˆfB?ám'"»X?ám#×°°?á9³pOÓ?á9°%NÉ?á?¼9?áË?ᙛѬï?á™›Œ‡Y ?á™h@C?á™h¶õý?á™4¨/<8?á™4¤äû?á™4[Ê?á™1“…?á˜ÍÀ†ÞÀ?á˜Í½<±U?ᘚL°^²?ᘚIf:å?á˜fØØt&?á˜fÕŽYø?á˜3dÿ-¼?á˜3aµ,?á—ÿñ$cÃ?á—ÿíÚ\Ò?á—Ì}H$Þ?á—Ìyþ'‹?á—™ j7?á—™ ™‚?á—e•‹g’?á—e’A}|?á—2!ªëC?á—2a Ë?á–þ­Èþ/?á–þª'V?á–Ë9å“Ñ?á–Ë6›Æ–?á–—Æñ?ᖗ·-l?á–dRÓ ?á–dNÑ ?á–0Þ3Hq?á–0Úé˜?á•ýjJzú?á•ýgÔ:?á•Éö`k®?á•ÉóÎŒ?á•–‚t×Ç?á•–+DD?á•c‡èþ?á•c >_?á•/š™Ö?á•/—PVW?á”ü&ªPN?á”ü#`Ù¦?á”Ȳ¹r;?á”ȯp2?ᔕ>ÇX?ᔕ;}õ"?á”aÊÓÛž?á”aÇŠÑ?á”.Vß2¸?á”.S•âŠ?á“úâé64?á“úߟï¤?á“Çnò9?á“Çk¨ÅH?á““úù|²?á““÷°I`?á“`†ÿÏW?á“`ƒ¶¥¤?á“-·e?á“-»—P?á’ùŸl!?á’ù›¿Uª?á’Æ+ î•?á’Æ'Áá½?á’’· 2:?á’’³Ã/?á’_C E¥?á’_?ÃL ?á’+Ï É?á’+ËÂÌ?á‘ø[·R?á‘øW¿Ðô?á‘Äç%0?á‘Äã¼Hp?á‘‘sfø?á‘‘o·“Ö?á‘]þú}³?á‘]û±´0?á‘*Šóô1?á‘*‡«4M?á÷ìÕx?á÷¤3?áâä¤ê?áß›øC?á.ÛUÿ?á+’²÷?á\ºÐéÃ?á\·ˆPY?á)FÅnÆ?á)C|Þû?áõÒ¸ó—?áõÏpmj?áÂ^«C?áÂ[bÆ?áŽêœ†Ý?áŽçTí?á[vŒÍ’?á[sDd@?á(|0?á'ÿ3¸}?áŽôŽj??áŽô‹!é ?áŽÁWPð?áŽÁ{?ᎦC„Ö?ᎢûAÿ?áŽZ2.}?áŽZ.æCÏ?áŽ&¾™^?áŽ&ºÐiÄ?áóJ¿Ã?áóF¹™Ç?á¿ÕéÖ+?á¿Ò¡¹Î?áŒaÐø²?áŒ^ˆåó?áXí·5å?áXêo,Å?á%yœX ?á%vTY?áŒò€˜?áŒò8¢5?ጾ‘cçÀ?ጾŽû|?ጋFV-?ጋþs‡?áŒW©'ÖÛ?áŒW¥ßýÔ?áŒ$5]D?áŒ$1ÀÛ?á‹ðÀçêm?á‹ð½ $£?ዽLƧø?ዽI~ëÌ?ዉؤ‰a?ዉÕ\ÖÔ?á‹Vd‚&?á‹Va9Ù7?á‹"ð]…À?á‹"íæo?áŠï|8½Ð?áŠïxñ(?ኼÃ?ኼËv°?ኈ“ì~4?ኈ¤ûÀ?áŠUÅ#Ÿ?áŠU}ªÉ?áŠ!«œØÿ?áŠ!¨UiÈ?á‰î7sâú?á‰î4,}a?ቺÃJ x?ቺÀ°~?ቇOV{?ቇKØ?á‰SÚóø(?á‰S׬¯j?በfǼf?በc€}H?áˆìòš±¾?áˆìïS|>?ሹ~lÙ6?ሹ{%­U?ሆ >Nâ?ሆ÷,Ÿ?áˆR–ë-?áˆR’ÇÒ‰?áˆ!Þ¼§?ሗ­¡?á‡ë­­ß`?á‡ëªfÙø?ᇸ9|FÑ?ᇸ65K?ᇄÅIô?ᇄÂØ?á‡QQçø?á‡QMÏÿm?á‡Üã#±?á‡ÙœDÄ?á†êh®¨6?á†êegÒè?ᆶôy¬ž?ᆶñ2àî?ᆃ€CÅÀ?ᆃ|ý¯?á†P 8>?á†PÆË?ᆗÖ?ᆔcÈ?á…é#ž-P?á…é Wˆ?á…µ¯e¿r?á…µ¬#Û?á…‚;,“ï?á…‚7æ÷?á…NÆòáÞ?á…NìY„?á…R¸t3?á…Oqõx?á„çÞ}‚?á„çÛ7e?á„´jAþ½?á„´fû“??á„€öÂè?á„€ò¿a?á„MÉ¢®?á„M~ƒJl?á„ eþ?á„ G[?áƒæ™P—»?áƒæ– R·?ჳ%Sì?ჳ!͇?ჰÕe‡?ჭ3À?áƒL<—?áƒL9Pèô?áƒÈXJ)?áƒÅ+Ÿ?á‚åTÛ¡?á‚åPÒƶ?ႱßÙ ?ႱܒþÌ?á‚~k˜®?á‚~hR¬V?á‚J÷Wãm?á‚Jôë^?ႃN?á‚СÝ?áäÔÞ,?áä ŽùZ?á°š’³?á°—L×Ñ?á}&PÜ?á}# >G?áI² ³?áI®ÇH¼?á=É€„?á:ƒÂ+?á€âÉ…£Ö?á€âÆ?ï?ုUA`ª?ုQûµ?á€{àü·û?á€{Ý·?á€Hl·ªÎ?á€Hirð?á€ør?á€õ,ß?áá„,>p?áá€æ¹Ï?á®åüA?á®  ??áz›Ÿg?áz˜Yõ°?áG'Xæ?áG$ ?á³:8?á¯ËÜ?á~à>É— ?á~à;„B„?á~¬Ê²Y?á~¬Ç?á}D™<­«?á}(7|m?á}$ò~x?á|ݳìð?á|Ý°§ûÀ?á|ª?¢,6?á|ª<]A~?á|vËWLÄ?á|vÈk«?á|CW L?á|CSÇ7Ñ?á|âÀªÀ?á|ß{Üå?á{Ünu #?á{Ük0[æ?á{¨ú):~?á{¨öäß?á{u…Ý>??á{u‚˜??á{B‘,b?á{BL…?á{DÏ÷?á{š24?ázÛ(øDõ?ázÛ%³°Ð?áz§´«§O?áz§±gÉ?ázt@^Ï’?ázt=N«?áz@Ìç0?áz@ÈÍoè?áz WÄá¨?áz T€sþ?áyÙãw—‡?áyÙà33{?áy¦o*?¹?áy¦kååL?áyrúÜÍÀ?áyr÷˜|ñ?áy?†Bœ?áy?ƒJûl?áy AŸF?áy ýaµ?áxØóäÀ?áxØš¯°Î?áx¥)¦?áx¥&aé°?áxqµX;Œ?áxq²Ö?áx>A NÛ?áx>=Æ7Ä?áx ̼Ar?áx Éx3ù?áw×Xn/G?áw×U*+m?áw£ä &Ì?áw£àÜ,?áwpoÒ¾O?áwplŽÍ³?áw<û…æÏ?áw<øAÿÑ?áw ‡9Î?áw ƒõ:o?ávÖì7R?ávÖ¨c‘?áv¢žŸaI?áv¢›[—&?ávo*R¤'?ávo'ã£?áv;¶ê?áv;²ÂJ?ávA¹]œ?áv>u°V?áuÔÍlã¢?áuÔÊ)?ú?áu¡Y kŽ?áu¡UÜÑ…?áumäÔK?áumá€à?áu:p‡ÕÕ?áu:mDO ?áuü;º'?áuøø<ù?átÓ‡ï¤I?átÓ„¬0¹?át £½¤?át `S³?átlŸWìB?átlœ‹ð?át9+ L ?át9'ÈõY?át¶Àëp?át³}ž[?ásÒBuˆ?ásÒ?2D£?ásžÎ*sÌ?ásžÊç9ô?áskYߢ ?áskVœqÔ?ás7å”Ýø?ás7âQ·]?ásqJPí?ásn3ð?árÐýÖ?árÐù½y?árˆµúÐ?ár…rñ?árjl M?árj) -?ár6 "d4?ár6œßm²?ár+ØÞ?ár(•ñ:?áqÏ·¢d?áqÏ´L¿?áqœCF¿v?áqœ@åÐ?áqhÎþz?áqhË»0s?áq5Zµœ@?áq5WrÕ×?áqæm†H?áqã*É~?ápÎr%¤¤?ápÎnâñx?ápšýÞ8?ápšú›i«?ápg‰–û\?ápg†T[m?áp4OÿÖ?áp4 i†?áp¡ Wv?ápÆÊÄ?áoÍ,ä?áoÍ)€’?áo™¸}ë?áo™µ:¥w?áofD7uÌ?áof@õö?áo2Ïò>?áo2̯Øf?ánÿ[­Dˆ?ánÿXjçï?ánËçh°â?ánËä&]è?án˜s$’?án˜oâHº?ándþàÀÄ?ándûž?án1ŠXÉ?án1‡["«?ámþZh?ámþ<?ámÊ¢»I?ámÊžÕ˜h?ám—-Õ¢ž?ám—*“‰[?ámc¹”ž?ámc¶Qôú?ám0ER¹ê?ám0B³ä?álüÑÞc?álüÍÏáü?álÉ\Ñ€o?álÉY¦?ál•è‘“˜?ál•åOªo?álbtRÔ?álbq9I?ál/Œ?ál.üÑHŸ?ákû‹Ô}e?ákûˆ’±?ákÈ–yŒ?ákÈT¶Ü?ák”£YŠ?ák” My?áka/ s?áka+Ú[?ák-ºß†>?ák-·àj?ájúF££4?ájúCbÿ?ájÆÒh?ájÆÏ&Œˆ?áj“^-Ù?áj“ZìP ?áj_éôÝY?áj_æ³]ÿ?áj,u¼ZŸ?áj,rzää?áiù„‡‹?áiøþCn?áiÅMJ3?áiÅŠ çµ?ái’£“?ái’ÕJ³?ái^¤à”š?ái^¡ŸEZ?ái+0«9"?ái+-ió€?áh÷¼v„¯?áh÷¹5H¬?áhÄHB][?áhÄE*ö?áhÔD?áhÐÍÞ}?áh]_Ü2Ê?áh]\›¢?áh)ëª1w?áh)èií?ágöwxÛ÷?ágöt7Ð ?ágÃH3>?ágÃ0ñ?ágS?ág‹×Zr?ág\éC?ág\¨%4?ág(¦º…?ág(£yŸŸ?áfõ2Œ™?áfõ/K½>?áfÁ¾_†ç?áfÁ»´³?áfŽJ3'H?áfŽFò^³?áfZÖ–?áfZÒÆ× ?áf'aÜÔ?áf'^œ°?áeóí²Çt?áeóêrº?áeÀy‰~ª?áeÀvHÜ?áea"ã?áe Šg?áeY‘9^?áeYøð€?áe&½^?áe&Ò8?ádò¨ìµ‰?ádò¥¬9è?ád¿4ÇhÙ?ád¿1†ö×?ád‹À£\?ád‹½b²ø?ádXLŠî?ádXI?,)?ád$Ø\Åì?ád$ÕpÅ?ácñd:è"?ácñ`úœš?ác½ðÿï?ác½ìÙ¾?ácŠ{ùØœ?ácŠx¹ Q?ácWÚ›\?ácWšl°?ác#“¼V?ác#|1?ábðžÕy?ábð^º ?áb¼«‚\(?áb¼¨BJW?áb‰7fµæ?áb‰4&­´?ábUÃL â?ábUÀ N?áb"O26Õ?áb"KòAß?áaîÛmU?áaî×Ùÿ?áa»gzµ?áa»cÁ˜ý?áa‡òꕉ?áa‡ïª½p?áaT~Ô‰ ?áaT{”º¥?áa! ¿~¬?áa!¹Ð?á`í–«w?á`í“k»Ý?á`º"˜eú?á`ºX´Z?á`†®†Y¥?á`†«F±¤?á`S:uS?á`S75´«?á`ÆeS%?á`Ã%¾a?á_ìRV@?á_ìO´ë?á_¸ÞHPa?á_¸ÛÎÛ?á_…j;\Ó?á_…fûäë?á_Qö/fW?á_Qòïø?á_‚$ˆ±?á_~å$?á^ë·i?á^ë Û\\?á^·šÛ?á^·–Ò¯m?á^„& K*?á^„"ËZ?á^P²²?á^P®Äså?á^=þCø?á^:¿e?á]éÉùÙŒ?á]éƺ®˜?á]¶U÷I¿?á]¶R¸(i?á]‚áökÑ?á]‚Þ·T?á]Omö¹;?á]Oj·«#?á]ùøM¼?á]ö¹IB?á\è…úô«?á\è‚»ùÐ?á\µþä?á\µ¿óR?á\žö+?á\šÅ?á\N* 7Ð?á\N&ËYÐ?á\¶ªp?á\²ÒÖ?á[çBNþ?á[ç>Û„;?á[³Î$A4?á[³Êå€?á[€Z/‚?á[€VðÊ|?á[Læ;ÜÅ?á[Lâý.Ý?á[rI•b?á[o ñ?áZåþXŸg?áZåû½?áZ²Šhàù?áZ²‡*Oî?áZz[ ?áZ;Óœ?áZK¢ê?áZKŸNž?áZ.¡?X?áZ+bË(?áY亶«v?áYä·x@ä?áY±FÍa7?áY±CD?áY}Òå|L?áY}ϧ$÷?áYJ^þââ?áYJ[À•,?áYë•é?áYçÛQÑ?áXãw5¾w?áXãs÷ƒý?áX°S'ò?áX°÷?áX|qî?áX|Œ3ÆÑ?áXI’¸?áXISô?áX§³†~?áX¤ur~?áWâ3Ö>?áWâ0˜…Þ?áW®¿úúV?áW®¼¼ù”?áW{L ªö?áW{Hâ³Ò?áWGØGË4?áWGÕ Ý¯?áWdp„ ?áWa2 9?áVàðškž?áVàí\‘V?áV­|Åí¦?áV­yˆü?áVzòÕ¢?áVzµ—?áVF•!$‚?áVF‘ãg?áV!QX?áVO‰?áUß­‚XN?áUߪD®?áU¬9µð?áU¬6wv^?áUxÅéM?áUx«¶?áUER {?áUENá}&?áUÞV3ß?áUÛ°)?áTÞj+?áTÞgQ†?áTªöÉbë?áTªó‹òq?áTwƒ4ì?áTwÇÎ?áTDB„~?áTD 'A?áT›_î?áT˜D Q?áSÝ'ÁÈ)?áSÝ$„~*?áS©´Ë|?áS©°Æ‹?áSv@Gx2?áSv= Ap?áSBÌŒ™¼?áSBÉOl˜?áSXÓKÆ?áSU–(A?áRÛå©ü?áRÛáÞ?áR¨qešŽ?áR¨n(ŠF?áRtý±9?áRtút2u?áRA‰þyG?áRA†Á|?áM¢#ž¿?áMn³RÁš?áMn°«i?áM;?Í"J?áM;<‘·?áMÌIa‡?áMÉ ^“?áLÔXÇší?áLÔU‹¡—?áL åGŒ¦?áL â œï?áLmqÉz]?áLmn”D?áL9þMW¢?áL9û{'?áLŠÓ ¬?áL‡—7Ð?áKÓZ¼r?áKÓó4?áKŸ£ämÚ?áKŸ ¨®;?áKl0oêm?áKl-44l?áK8¼ýuÐ?áK8¹ÁÉn?áKIŒÛ‰?áKFQ8Å?áJÑÖQæ?áJÑÒâ¸À?áJžb±¿?áJž_v/–?áJjïGº?áJjì Ñ?áJ7{Þ½?áJ7x£s?áJwæP?áJŒ?áH†å6ˆ?áHƒª$ ?áGΕ?áGÎZ %?áGš Fùü?áGš ú½?áGg,û& ?áGg)À0k?áG3¹±K?áG3¶v_?áGFi’?áGC.¯¡?áFÌÓ$ ?áFÌÏé0Q?áF™_à–…?áF™\¥Ç^?áFeìŸH?áFeédƒ?áF2y`:È?áF2v%~Þ?áEÿ#Sm?áEÿè¡!?áEË’è“b?áEË­êµ?áE˜°=?áE˜uw.?áEd¬y§’?áEd©?"?áE19Ebì?áE16 ×?áDýÆcã?áDýÂØá®?áDÊRãƒ\?áDÊO© Æ?áD–ßµê??áD–Ü{{G?áDclŠŒ?áDciP&Ã?áD/ùa\…?áD/ö'Ê?áCü†;/U?áCüƒÝ9?áCÉõ?áCÉݼw?áC•Ÿ÷#Þ?áC•œ¼äþ?áCb,ØŸ?áCb)žJ^?áC.¹¼Ng?áC.¶‚"Ä?áBûF¢N‚?áBûCh,~?áBÇÓŠ›|?áBÇÐPƒ?áB”`u^-?áB”];Oe?áB`íbTä?áB`ê(O»?áB-zQ¨}?áB-w¬ò?áAúCt~?áAú ‚’?áAÆ”7¬~?áAÆýÄ0?áA“!.)j?áA“ôJº?áA_®'?áA_ªí? ?áA,;"`.?áA,7蔺?á@øÈ Ð?á@øÄæYû?á@ÅU Gé?á@ÅQæ²?á@‘â"Ø ?á@‘Þé)r?á@^o'Í?á@^kî(#?á@*ü/]F?á@*øõÁê?á?÷‰99‡?á?÷…ÿ§Ê?á?ÄEŠ¶?á?Ä —?á?£TlZ?á? íÚ?á?]0eœÅ?á?]-,'ã?á?)½yz ?á?)º@Ç?á>öJƒ?á>öGV`Ý?á>Âר‘°?á>ÂÔo9¨?á>dÃÀ„?á>aŠr?á>[ñá­?á>[î¨hK?á>(íÊ?á>({Ȳ?á=õ $Óa?á=õë¡Ó?á=Á™JD?á=Á–/?á=Ž&r3ž?á=Ž#9M?á=Z³œ¢»?á=Z°cŽ?á='@ÉÇ™?á='=¼„?á<óÍù`”?á<óÊÀ_?á<À[+±?á<ÀWò¹9?á<Œè`„Â?á<Œå'–ˆ?áAD?á.¯ê¯?á.{ ?Æt?á.{ y}?á.H.Dœî?á.H+Y•?á.¼LÈ?á.¹d ?á-áJW×!?á-áG!§?á-­ØfIÖ?á-­Õ0#X?á-zfx?á-zcB¯?á-FôŒùT?á-FñVæ?á-‚¥7Õ?á-o.1?á,àÀͯ?á,à ŠÍª?á,¬žß“ô?á,¬›©Œ?á,y-¦ ?á,y)˹??á,E»'È?á,E·ñ!?á,IO£Ï?á,FÊB?á+Þ×{‘:?á+ÞÔEÁJ?á+«eªèl?á+«bu"?á+wóÝu8?á+w𧸅?á+D‚S?á+D~ÝŸí?á+LÄç?á+ p?á*Ýž‰T~?á*Ý›S´¥?á*ª,Él«?á*ª)“Öq?á*v» ¾Á?á*v·×2$?á*CITBú?á*CF¿ü?á*ןà1?á*ÔjfÑ?á)Üeï‚?á)Üb¹—À?á)¨ôAw„?á)¨ñ `?á)u‚—f?á)ub ?á)BðáO?á)B »Žg?á)ŸMÂO?á)œy?á(Û-®$l?á(Û*xäÀ?á(§¼Ã?á(§¸Ü߶?á(tJyTñ?á(tGD(?á(@Øä%?á(@Õ¯=?á( gRy¶?á( d`ƒ?á'ÙõÄF‚?á'Ùò6ì?á'¦„9™?á'¦“˜?á's²Ž4?á's}‘Û?á'?¡.ý?á'?ú Õ?á' /¯ù?á' ,zÜ?á&ؾ2ŸH?á&غý¿É?á&¥L¹¸Ý?á&¥I„âü?á&qÛDk?á&qØžË?á&>iÒ¶µ?á&>fô?á& ød‚0?á& õ/É)?á%׆ùèÕ?á%׃Å9l?á%¤“ú?á%¤^`/?á%p¤/˜C?á%p úü?á%=2Ïý7?á%=/›j¨?á% Ásó?á% ¾?j?á$ÖP{÷?á$ÖLæü¥?á$¢ÞƱí?á$¢Û’<8?á$omu‰?á$ojAì?á$;ü(†?á$;øóº ?á$ŠÞRÝ?á$‡©ú?á#Õ˜GS?á#Õcø?á#¡¨UÓ?á#¡¥!q?á#n7 ?á#n3ââŸ?á#:ÅÜ¢?á#:§ë@?á#T¤Ðî?á#Qp¨)?á"ÓãqF—?á"Óà='p?á" rAe?á" o Oz?á"m:A?á"lýá.V?á"9ìá¢?á"9Œ¸ßU?á"ÈNÅ?á"”V?á!Ò­§ZÎ?á!Òªsk½?á!Ÿ<Š;ˆ?á!Ÿ9VV?á!kËpþý?á!kÈ=#(?á!8Z[‹•?á!8W'¹^?á!éIÔì?á!æ S?á Ñx;öP?á Ñu7U?á ž1ã_?á žþ.?á j–+œî?á j’÷ñ/?á 7%) ?á 7!õt?á ´*k¾?á °öÓ:?áÐC/ªX?áÐ?üs?áœÒ8Æ ?áœÏ@Å?áiaE²}?ái^6Ó?á5ðV}·?á5í# ¬?ák(’?á|7À$?áσ³ç?áÏ PU?á›  Œ?ᛚlË[?áh,À‰Ê?áh)>6?á4»äÈÏ?á4¸±†Ú?áK øâ?áGÙÀŠ?áÍÚ9 ¥?áÍ×Þë?ášiiê?ášf5âÎ?áføÊ.?áfõj®°?á3‡×;Ø?á3„¤)÷?á¡2?áá˜ð?á̦VH?áÌ£# ¤?á™5›Œ_?á™2h—Y?áeÄåÜ?áeÁ²(t?á2T2…+?á2Pÿ£`?áþã„0h?áþàQX~x?á"× ¾?áïjªF?áïgy *?á»ûA?á»÷éã ?ላv?ለ^¾•?áU–z?áUØL7?á!¬†³ ?á!©Vrû?á î= wã?á î9Ù@Û?á ºÍÖé?á ºÊ`©?á ‡^ù?á ‡ZìÕ9?á Sî­Ä²?á Së}ªƒ?á C:»?á |**?á íÝi?á í ­b+?á ¹ |6V?á ¹L9?á †1½†?á †-ïÉÎ?á RÁÈ ©?á R¾˜"?á Rtý?á OE’?á ëã&·?á ëßöà)?á ¸sÝ.8?á ¸p­`÷?á …˜p™?á …h¬õ?á Q•X~ø?á Q’(Äò?á &?Ó?á "ík?á ê¶æÎN?á ê³·'ƒ?á ·Gµ?á ·D…€Û?á ƒØˆJ(?á ƒÕX¶™?á Pi`,?á Pf0¢?á ú<ù?á ÷ x²?á é‹—³?á é‡ï ü?á ¶Ö?á ¶Õ›½?á ‚¬ð@?á ‚©ÀÜš?á O=àKh?á O:°ñŠ?á ÎÕ+ž?á Ë¥Û^?áè_Îî¬?áè\Ÿ¨ ?á´ðÍ•b?á´ížX]?áÑ Ž?á~¡í&?áNÙƒÔ?áNªZ ?á£æÍ-?á ·­?áç4øýg?áç1ÉæØ?á³Æ%?á³Âàû3?á€W,†?á€Sý3?áLèLÿX?áLå¢?áyrÓ?ávCã?áæ žë?áæn¸o?á²›Íc“?Იž†¶?á-”?á)Ó4T?áK¾;ÀX?áK» öµ?áOzg5?áLK§0?áäà½üþ?áäÝF—?á±rž?á±n×âÔ?á~Tì?á~%|À?áJ”¦»×?áJ‘x"H?á%þIÛ?á"Ϲé?áã·Zå?áã´,^Ç?á°H¼4?á°EŽ~?á|Ú#Fk?á|ÖôÓR?áIkŽóÌ?áIh`ŠP?áüÿ¾½?áùÑ^à?áâŽu¨?áâ‹GQÇ?á¯ñLx?á¯ÂÿÕ?á{±rÖ>?á{®D“9?áHBùš(?áH?Ë`À?áÔ…dq?áÑW4¦?ááfjw?áábèDK?á­÷¬Ÿß?á­ô~ƒP?áz‰GÞ?áz†Ë?áGèZL?áGºP÷?ᬎ{?á©`Ä?áà>8ÛÌ?áà; å²?á¬ÏèÕ{?á¬Ìºèÿ?áyaž*º?áy^pGÜ?áEóX€?áEð*´??á…Mk?áê}Ç?áßÝ6¸?á߯p²?᫨§qŸ?á«¥yµ6?áx:v×€?áx7I$µ?áDÌKƒh?áDÉÚ:?á^%v(?áZ÷Ö˜?àÿÝð‰?àÿÝìÖó,?àÿªé å?àÿª~»?àÿwÒ°z?àÿw¥-Â?àÿC¥Á¬0?àÿC¢”3?àÿ7¶ ð?àÿ4ˆr?àþÜɯŸ?àþÜÆ‚9#?àþ©[®¤Ö?àþ©XH”?àþuí³ñ?àþuê…²L?àþB¼²ü?àþB|iô?àþ˯À?àþžpV?àýÛ£ßü ?àýÛ ²Æ>?àý¨5ù¥Ç?àý¨2Ìy—?àýtÈ­º?àýtÄë‹'?àýAZ=.ð?àýAWû?àý ìfè”?àý é9Ù?àû £2wé?àû  È·?àúØ5˜”?àúØ2kmÿ?àú¤È%˜?àú¤ÄÖ‰ ?àúqZs®¿?àúqWGe?àú=ìé¯Î?àú=é½'?àú eV?àú |86?àù×æ—?àù×¹?àù£¤lŠW?àù£¡@r?àùp6ø$?àùp3Ì*Ü?àù<ÉŠ&?àù<Æ]ÍU?àù \!H—?àù XôùŠ?àøÕî½è”?àøÕë‘£$?àø¢`.?àø¢~3òC?àøoòŽ?àøoÛÀX?àø;¦µ^?àø;£‰5‚?àø9hWI?àø6<8N?à÷ÔÌ Þá?à÷ÔÈôɃ?à÷¡^ßä?à÷¡[³$?à÷mñ¢ÃÆ?à÷mîvÁ£?à÷:„l"¢?à÷:@*?à÷;ë?à÷?àöÓª… ?àöÓ¦äŸÁ?àö <ìa²?àö 9À†?àölÏÍëÝ?àölÌ¢Ì?àö9bµ$W?àö9_‰[ã?àöõ¢?àöòvZ+?àõÒˆ”ÊŸ?àõÒ…if?àõŸ9ø?àõŸaŽ\?àõk®‹gÒ?àõk«_ÅÓ?àõ8AGÜ?àõ8>c¯{?àõÔ˜çð?àõÑmY,?àôÑg¨c?àôÑd|Ýë?àôú½x|?àô÷‘üó?àôjØw–?àôjŠ­©?àô7 ù9×?àô7Íч?àô´Í?àô°ônh?àóÐGL%?àóÐD Ïþ?àóœÚ~Oœ?àóœ×S$?àóim¶3J?àóijŠño?àó6óø,?àó5ýÈ¿î?àó”7Ÿ ?àó‘ pj?àòÏ'u?àòÏ$Uér?àò›ºÐaf?àò›·¥F?àòhN%˜ž?àòhJú†Õ?àò4ယ¸?àò4ÞU’Œ?àòtáhu?àòq¶iæ?àñÎHD?àñÎO"?àñš›´ßÈ?àñš˜‰ôs?àñg/'}Ñ?àñg+üœ?àñ3 ¿?àñ3¿u,¥?àñV[,?àñRóŒ¯?àðÌ颶:?àðÌæwñZ?àð™},ïe?àð™z4"?àðf½Š?àðf ’bä?àð2¤S3‡?àð2¡(‹~?àïÿ7ïM?àïÿ4Ä®²?àïËË‘b?àïËÈfÍD?àï˜_9Xü?àï˜\ÍË?àïdòçYæ?àïdï¼ØQ?àï1†›Kb?àï1ƒpÓj?àîþUHd?àîþ*Ú ?àîÊ®Dš?àîʪêßÝ?àî—AÛ3®?àî—>°ØŽ?àîcÕ§0–?àîcÒ|ß?àî0iy!ä?àî0fNÙþ?àíüýQx?àíüú&×/?àíÉ‘/&:?àíÉŽñŽ?àí–%GÞ?àí–!éÏ?àíb¸ýn?àíbµÓL?àí/LíŒ|?àí/IÃt§?àìûàãòd?àìûݹä,?àìÈtà_%?àìÈq¶ZŠ?àì•âà”?à앸å—?àìaœëwv?àìa™Á†?àì.0ú$?àì.-Ð<Ë?àëúÅÛŒ?àëúÁäýe?àëÇY)Ñ?àëÇUÿüø?àë“íJÒâ?àë“ê!ö?àë`r­?àë`~HF]?àë-ŸVy?àë-užÆ?àêù©ÒÀ?àêù¦©û?àêÆ> RC?àêÆ:â­Ë?àê’ÒL5?àê’Ï"š3?àê_f’'×?àê_ch–˜?àê+úÞR–?àê+÷´Êô?àéø1‚?àéøŒ}?àéÅ#‹ÈL?àéÅ bSä?àé‘·ì;?àé‘´ÂÐ;?àé^LS£?àé^I)¡u?àé*àÀÄ?àé*Ý–®3?àè÷u3R;?àè÷r G?àèÄ ­î?àèă¾—?àèž,äV?à蛩œ?àè]2³Y?àè]/‰à?àç(«4<Î?àæõCã ?àæõ?æõ7?àæÁ×ÈÖf?àæÁÔŸò0?àæŽlˆ6G?àæŽi_[®?àæ[MéJ?àæZþ%N?àæ'–ýB?àæ'’ñ5ã?àåô*ìý?àåô'ÃÂ:?àåÀ¿Åe,?àåÀ¼œ±?àåT¤­’?àåQ| ?àåYéŠ?àåYæaà-?àå&~v¬E?àå&{Nö?àäóid?àäó@Öb?à俨bu ?àä¿¥9ðö?àäŒ=aú?àäŒ:9Ž?àäXÒgóÃ?àäXÏ?‚ç?àä%gt}"?àä%dLã?àãñü‡‰Ñ?àãñù_,/?à㾑¡v?à㾎x¬q?àã‹&Àûé?àã‹#˜±?àãW»ç—?àãW¸¿V;?àã$Q„A?àã$MìM?àâðæH¢?àâðãå?àâ½{‚5Þ?àâ½xZé?à⊺~?à⊠š &?àâV¦ Õy?àâV¢áĽ?àâ#;W¡¤?àâ#8/š…?àáïЫëŒ?àáï̓î ?àá¼fÎ ?àá¼bÞÚ%?àáˆûhIÜ?àáˆø@_“?àáUÐE§?àáU¨dû?àá"&>Ï8?àá"#ø)?ààî»´q?àà@ÿ?àà»Q/Ïâ?àà»N ?àà‡æ²._?àà‡ãŠt&?ààT|;DÁ?ààTy”%?àà!Êìž?àà!£Ež?àßí§aZæ?àßí¤9½„?àߺ<þi4?àߺ9ÖÕn?à߆Ң ?àÞRUP?àÞRQÜÿ‰?àÞêÖÔŠ?àÞ篩?àÝ뀰Õ?àÝë}ˆÜ’?àݸ?àݸhÒé?àÝ„¬vµ‘?àÝ„©O‹‡?àÝQBd4˜?àÝQ?=*?àÝØY.?àÝÕ2>?àÜênUÍ.?àÜêk.¿ù?àÜ·YX¯?àÜ·2U?à܃šcª8?à܃—<°=?àÜP0tÏ?àÜP-Mß/?àÜÆŒÉi?àÜÃeâ§?àÛé\«˜Ž?àÛéY„»h?àÛµòÑ=±?àÛµïªj)?àÛ‚ˆýàª?àÛ‚…×¾?àÛO1N?àÛO Ç?àÛµk À?àÛ²Dê ?àÚèK¬æk?àÚèH†9U?àÚ´áõÄ?àÚ´ÞÎbK?àÚxD”?àÚu·?àÚNš"›?àÚN s’[?àÚ¤öú|?àÚ¡ÐsØ?àÙç;ZÖ?àÙç84Y?àÙ³ÑÅŽü?àٳΟ‘?àÙ€h7M?àÙ€eãD?àÙLþ°?àÙLû‰£Ö?àÙ•/šˆ?àÙ’ Có?àØæ+¶+[?àØæ(Þb?àزÂC·A?àز¿så?àØXØXþ?àØU²??àØKïsÝ4?àØKìM­?à؆x¹?àØ‚ðR3?à×åÀ=?à×åšS?à×±³p·t?à×±°J¤'?à×~J(O?à×~GEl?à×Jàç?à×JÝÁ ï?à×w¬³Ä?à×t†½M?àÖäyu5?àÖä SˆZ?àÖ°¥MS ?àÖ°¢'oÊ?àÖ}<(&ò?àÖ}9MP?àÖIÓ %º?àÖIÏäU´?àÖióC?àÖfÍ|¯?àÕããrÀ?àÕâý½µó?àÕ¯—Úµl?àÕ¯”µ°XÞ?à̦;ŒV)?àÌrÖùŽw?àÌrÓÕ•_?àÌ?oJ:S?àÌ?l&J×?àÌ ¢w'?àÌ ~‘G?àËØ E©?àËØœÞie?àË¥8i™?àË¥5EÆé?àËqÐØ€’?àËqÍ´·‡?àË>iO]?àË>f+Uî?àË Í ¹?àË þ©Tæ?àÊךR¼G?àÊ×—/?àʤ2àÆ?àʤ/¼a+?àÊpËtÇó?àÊpÈQ.ô?àÊ=d0z?àÊ=`í¡?àÊ üµK ?àÊ ù‘ÅD?àÉÖ•`äl?àÉÖ’=hB?àÉ£.>=?àÉ£*ð˯?àÉoÆÏ?=?àÉoëÖK?àÉ<_‘Î*?àÉ<\nnÔ?àÉø\¬?àÉõ8¼ò?àÈÕ‘.{?àÈÕŽ ´]?àÈ¢*˜O?àÈ¢&äUÍ?àÈnÂèçÖ?àÈn¿Å®ñ?àÈ;[ÑÕÎ?àÈ;X®¦…?àÈôÂoì?àÈñŸJ??àÇÔºÝÍ?àÇÔŠ—Á¼?àÇ¡&ºìB?àÇ¡#—ÙÍ?àÇm¿ÂÂì?àÇm¼Ÿº?àÇ:XÒH‹?àÇ:U¯IN?àÇñéŠÐ?àÇîÆ•/?àÆÓ‹py?àÆÓ‡å„t?àÆ $/.#?àÆ ! K»?àÆl½]·‹?àÆlº:Þ¿?àÆ9V“óm?àÆ9Sq$=?àÆïÑïz?àÆì¯)æ?àÅÒ‰ÆX?àÅÒ…õ `?àÅŸ"e^È?àÅŸB¬l?àÅk»º¹‚?àÅk¸˜Á?àÅ8Uä/?àÅ8QõE ?àÅî|߃?àÅëZIú?àÄчé¬2?àÄÑ„Ç F?àÄž!^Jò?àÄž;È¢?àÄjºÚ¼t?àÄj·¸CÀ?àÄ7T_(T?àÄ7Q<¹Û?à¹Æ«°Ãj?๓Jè?๓Fä?à¹_åA&??à¹_â ¾?à¹,€……’?à¹,}e&õ?à¸ùÒGn?à¸ù±òl?à¸Å·'_–?à¸Å´0?ฒR„Û¥?ฒOd™Ú?à¸^íê¼K?à¸^êÊ„?à¸+‰Y8?à¸+†8Ó¥?à·ø$Ï»?à·ø!¯–?à·ÄÀNÀž?à·Ä½.¥B?à·‘[Ö-…?à·‘X¶Ä?à·]÷fo?à·]ôEúJ?à·*’þ3?à·*Þ4?à¶÷.žÍ%?à¶÷+~Ø7?à¶ÃÊGø?à¶ÃÇ( ´?à¶eú]Ü?à¶bÚ|%?à¶]¶*Î?à¶\þ–R²?à¶)zWä?à¶)šZ‰d?àµö9G •?àµö6'G°?àµÂÕck?àµÂÑü¨#?àµpú6L?àµmÚ„Ÿ?àµ\ à…ä?àµ\ ÀÝÓ?àµ(¨Ïl»?àµ(¥¯ÎE?à´õDÆøm?à´õA§c“?à´ÁàÆõò?à´Áݧj³?à´Ž|ÏŒ¾?à´Žy° ?à´[à°’?à´[Á8Š?à´'´úb?à´'±Úó°?à³ôQÕº?à³ôMýpé?à³ÀíGåR?à³Àê(Š?೉{jÑ?ೆ\7?à³Z%·¤?à³Z"˜E¦?à³&Áü[g?à³&¾Ý?à²ó^IÇÚ?à²ó[*“?ಿúŸà“?ಿ÷€µg?ಌ–þ³-?ಌ“ß‘œ?à²Y3eÿ¼?à²Y0FçÇ?à²%ÏÖl?à²%Ì·?à±òlNØ?à±òi/ÓZ?౿ÐKj?౿±PG?ో¥Zo ?ో¢;}„?à±XAíC­?à±X>Î[Á?à±$ÞˆÖä?à±$Ûiø“?à°ñ{-ž?à°ñx-ê?à°¾Ùû.?à°¾»0?à°Š´›?à°Š±pÌ?à°WQMû?à°WN/C?à­î©È¼¤?à­»J¼Æ?à­»FùÇ?à­‡çQ6?à­‡ä3ª?à­T„“¡Z?à­Tuy‘?à­!!Þؤ?à­!Àºw?à¬í¿2éy?à¬í¼Ôç?଺\án?଺YqÖw?ଆùõÎ?ଆö×Ì·?à¬S—d‰`?à¬S”F‘ ?ଠ4ÜG™?ଠ1¾Yt?à«ìÒ\ÕÌ?à«ìÏ>ñB?ૹoæNt?ૹlÈs…?૆ x˜m?૆ ZÇ?à«R«­?à«R§öFõ?à«H¸W’?à«Eš™u?àªëæe§_?àªëãGòÝ?સ„ñØ?સ€þFñ?અ!Û?અ½bÅ?àªQ¿£G?àªQ¼…z—?àª]t*?àªZV›ù?à©êûN?(?à©êø0º®?à©·™23L?à©·–¸m?à©„7 -?à©„4§ê?à©PÕ …?à©PÑù¤Ý?à©s'Ç?à©oùɺ?à¨ê QÒ?à¨êý`?ਸ਼¯2˜6?ਸ਼¬M_?ਃMMáÑ?ਃJ0 •?à¨OërbÝ?à¨OèU+«?ॳöŒ›·?ॳóoà÷?ी•1u?ी’Ãâ?à¥M3ßuÞ?à¥M0ÂÎT?à¥Ò–«Ã?à¥Ïz Ô?à¤æqW1"?à¤æn:œÎ?ळ ùÀ?ळ o?मóìƒ?फ×ke?à¤LMÐò?à¤LJ³Ÿo?à¤ìµ [?à¤é™2s?à£å‹¤o¡?à£åˆˆ T?ࣲ*œ…j?ࣲ'€*¸?à£~Éü ?à£~Æ« ?à£Kh¨ è?à£KeŒYl?ࣼ§ê?࣠j ?à¢ä¦Ùë,?à¢ä£½¶æ?ࢱFx6?ࢱBäMŠ?à¢}å0ip?à¢}âH_?à¢J„i¿~?à¢JM¨?à¢#¬aH?ࢠSm?à¡ãÂøv?à¡ã¿ÜqÓ?à¡°bMäÇ?à¡°_1ê"?à¡}¬® ?à¡|þ¼þ?à¡I¡ßc?à¡Iø÷ó?à¡@††S?à¡=j¨~?à âàp ?à âÜå›Ð?à ¯…Ý…?à ¯|jæ?à |¨Î?à |÷çÊ?à H¾ªÒŒ?à H»#?à ^KhF?à [/ºx?àŸáýõ„W?àŸáúÙà$?àŸ®©Ò?àŸ®šf:?àŸ{=eø?àŸ{:Jg?àŸGÝ,w¥?àŸGÚðB?àŸ|ü?Ò?àŸyà ?àžáÕžt?àžáº*G?àž­¼¸‡R?àž­¹À?àžz\¤áV?àžzY‰€_?àžFüšÆâ?àžFùo†?àžœš?àž™~Ä??àà<¢éò?àà9‡¥Ê?à¬ÜµB~?à¬Ùšñ?ày|Ñ6?àyy¶?àFö«e?àFÛ„?à½%£T?ຠ…—?àœß]_?àœßZDà?àœ«ý£Ê?àœ«úˆC?àœxð³(?àœxšÕ²Gôä?àœE;,ý“?àœÞ¨½í?àœÛÐ6?à›ÞBQ?à›Þ{ø^5?à›«‡uÜ?à›«l›[?à›wÀ2¡?à›w¼êa»?à›D`Œ¬®?à›D]qåb?à›ñ‚?à›þ3Ñ?àšÝ¡¸Á}?àšÝžž g?àšªB]]…?àšª?B³ ?àšvã Ÿ°?àšvßðþÎ?àšCƒÃ¯/?àšC€©è?àš$…f?àš!jØn?à™ÜÅPëŸ?à™ÜÂ6g?à™©f&Ö?à™©c Ÿ_?à™ví?à™vê§?à™B§íÌ×?à™B¤Óe•?à™HàF?à™EÅèj?à˜ÛéÜ‘?à˜ÛæÂ=?à˜¨Šâ”Ñ?à˜¨‡ÈJ`?à˜u+ò^È?à˜u(Øñ?à˜AÍ âÁ?à˜AÉñ«…?à˜n/TÀ?à˜k'?à—Û\‚?à—Û B^?à—§°“„ë?à—§­yj~?à—tQÔwº?à—tNºfç?à—@ó ?à—@ðÕ?à— ”sˆº?à— ‘Y‹?à–Ú5Ñõ$?à•Ù]= Î?à•ÙZ#ÜÐ?à•¥þ×E2?à•¥û½ŠÏ?à•r zÆ(?à•ra^?à•?B($V?à•??}'?à• ã߆á?à• àÅéL?à”Ø… »?à”Ø‚‡'?à”¥'kè ?à”¥$R]«?à”qÉA›?à”qÆ'€Ö?à”>k `?à”>h‘6?à” üþ?à” ïn?à“×®ü–?à“׫⢡?à“¤Pøåž?à“¤Mß‹C?à“pòÿçº?à“pïæ–ù?à“=•Ú2?à“=‘÷“ ?à“ 7+½«?à“ 4€?à’ÖÙP¬l?à’ÖÖ7xz?à’£{§?à’£xf|Ã?à’p¸‡Õ?à’pŸg?à’<¿û‚’?à’<¼âko?à’ bH~H?à’ _/pÀ?à‘ÖŸ•B?à‘Ö†‘T?à‘¢§¡¢?à‘¢£ç§O?à‘oIkä-?à‘oFRós?à‘;ëá_?à‘;èÈ6@?à‘Ž`tW?à‘‹G–Ò?àÕ0éÐ ?àÕ-Ðü!?à¡Ó}=ó?à¡Ðds£?ànvË~?àns È?à;ÂyO?à;©Â4?à»u0—?à¸\ƒ?àÔ^3Á?àÔ[`Ú?à¡û ·?à ýâoj?àm£Í3A?àm ´¢Ž?à:F©ŽÔ?à:C‘¼?àé6µ?àæw¹7?àŽÓŒ ?àŽÓ‰h‘%?àŽ /|?àŽ ,c©Ì?àŽlÒ~?àŽlÏin?àŽ9uö×?àŽ9rxŸÂ?àŽª²$?àŽ’d©?àһΣ×?àÒ¸¶_ö?àŸ^üæ/?àŸ[ä«è?àl5lü?àkÿÛ?à‹jd¡Õ?à‹jaŠZ?à‹7Kè÷?à‹74!ë?à‹¬U ?à‹¨è˜-?àŠÐO¿58?àŠÐL§_?àŠœóˆU?àŠœðpªÝ?àŠi—[Ü^?àŠi”D;¹?àŠ6;9Ë—?àŠ68"4?àŠß"05?àŠÜ ¢Å?à‰Ïƒñ:?à‰Ïýmd?à‰œ'5«?à‰œ#ú»n?à‰hËÊð?à‰hÈZM?à‰5o+Ø?à‰5lq?à‰HD ?à‰0æœ?àˆÎ·oB¸?àˆÎ´Wîä?àˆ›[ ®K?àˆ›X‰d?àˆgÿÜ ú?àˆgüÅ`Y?àˆ4¤"è0?àˆ4¡ ±)?àˆHsĈ?àˆE\—?à‡ÍìÏ)Ô?à‡Íé¸?à‡š‘4ÿ?à‡šŽäâ?à‡g5¥Q¿?à‡g2ŽA!?à‡3Ú //?à‡3× (*?à‡~¥¤Ò?à‡{Ž§g?à†Í#5Œà?à†Í ™?à†™ÇÐŽ?à†™Ä¹W?à†flu|?à†fi^"ß?à†3$“B?à†3 ¼??à…ÿµÞ×à?à…ÿ²È w?à…ÌZ£xb?à…ÌWŒ´’?à…˜ÿrÂ(?à…˜ü\ò?à…e¤Lœ:?à…e¡5ëž?à…2I1ÿ?à…2Flþ?à„þî z?à„þë s?à„Ë“Åw?à„Ë1©?à„˜8e?à„˜5v1?à„dÝ,õ ?à„dÚto?à„1‚F—5?à„10 5?àƒþ'j´Y?àƒþ$TFó?àƒÊÌ™ ?àƒÊɃ)??àƒ—qÓN?àƒ—n¼®?àƒd&º?àƒdÖ!?àƒ0¼fî©?àƒ0¹P§©?à‚ýaÂg ?à‚ý^¬)º?à‚Ê(“v?à‚Ê_ª?à‚–¬™Ö?à‚–©ƒc¤?à‚cRJ?à‚cNÿ)|?à‚/÷›¯7?à‚/ô…˜8?àü,ýË?àüšðf?àÉBÈöy?àÉ?²ò®?à•èoÍ?à•åYÒÑ?àbŽ![¦?àb‹ k?à/3ÝÉY?à/0Çâ[?à€ûÙ¤ý$?à€ûÖÀ?à€Èw2?à€È|a=h?à€•%SùX?à€•">/'?à€aË;¶+?à€aÈ%õ“?à€.q.;€?à€.n„‚?àû+£‚?àûö?àǽ3â?àǺ>8?à”cG`?à”`1j0?àa e 9?àaOz¢?à-¯ê^?à-¬xc`?à~úUÁ¯0?à~úR¬1Ì?à~Æüg?à~ÆøêóD?à~“¢Iì@?à~“Ÿ4‚?à~`Hžry?à~`E‰â?à~,îýúR?à~,ëè£T?à}ù•h^?à}ù’S¬?à}Æ;Ý·Ü?à}Æ8Èt?à}’â^N?à}’ßHÎ?à}_ˆé6p?à}_…ÔÙ?à},/u÷?à},,jNù?à|øÖ ­ì?à|øÓ ˆ?à|Å|ÌÒ%?à|Åy·¾[?à|’#ƒã>?à|’ nÙ?à|^ÊEûV?à|^Ç0ú¾?à|+q?à|+mþ$ ?à{øë)b?à{øÖ;þ?à{ľÎML?à{Ä»¹i?à{‘e¼zš?à{‘b§ h?à{^ µ¥?à{^  Ô†?à{*³¹æü?à{*°¥ý?àz÷ZÉ4?àz÷W´v¡?àzÄã€?àzÃþÎÌD?àz©ò?àz¥ôGÎ?àz]P9pä?àz]M$ÐK?àz)÷tð“?àz)ô`Y”?àyöž»—î?àyö›§ ˆ?àyÃF gŽ?àyÃBøãÁ?àyíj9Á?àyêU¿Ž?ày\”Ò5h?ày\‘½ÄÎ?ày)ÞÊT?àrŠêÛgð?àrŠçÈ=°?àrW“Ð8S?àrW½­?àr$<Љj?àr$9½r]?àqðåÜ(Ñ?àqðâÉ^?àq½ŽóVÐ?àq½‹àRõ?àqŠ8?àqŠ5¾?àqVáD-ü?àqVÞ1=T?àq#Š}ØR?àq#‡jñC?àpð3Ó?àpð0°6?àp¼Ý­`?àp¼ÚÙƒ?àp‰†oÙD?àp‰ƒ]?àpV/×~V?àpV,Ľª?àp"ÙJ¶¨?àp"Ö7ÿ•?àoï‚Év?àoï¶È—?ào¼,SÉß?ào¼)A%ÿ?àoˆÕéŒr?àoˆÒÖò*?àoUŠñR?àoU|x`¤?ào")7ìS?ào"&%e>?ànîÒðd”?ànîÏÝç?àn»|´€Ý?àn»y¢ ù?ànˆ&„5?ànˆ#qÊ»?ànTÐ_ ?ànTÍM ï?àn!zFsü?àn!w4ã?àmî$8ÿó?àmî!&²s?àmºÎ7 ¡?àmºË$Ⱥ?àm‡x@ÚB?àm‡u.Ÿô?àmT"VOó?àmTD>?àm Ìwa‹?àm Ée:o?àlív¤¢?àlís‘ò?àlº Ü€ö?àlºÊm ?àl†Ë ƒ2?àl†Èxà?àlSupIÔ?àlSr^I?àl ˯@?àl ¹¸ ?àkìÊ2Íz?àkìÇ ßó?àk¹t¥˜_?àk¹q“´q?àk†$;?àk†Bå?àkRÉ®6q?àkRÆœe´?àktD$8?àkq2]?àjìåͯ?àjìÔ#?àj¸É“&¬?àj¸Ærº?àj…tLUï?àj…q:«–?àjRB˜?àjRÿ¡Ø?àjÉáí:?àjÆÐV?àiët¾Vg?àiëq¬ÈØ?ài¸¦‹h?ài¸•r?ài„Ê›Œ–?ài„ÇŠ8?àiQuU?àiQr‹ä??ài ªí–?ài™†j?àhêËÄc—?àhêȳ?àh·véÄT?àh·sØpY?àh„"¢?àh„ ¹@?àhPÍX.Ê?àhPÊFî?àhx¡,ô?àhuõÃ?àgê#ö$Ò?àgê ä÷:?àg¶ÏW B?àg¶ÌEæB?àgƒzÃÑ?àgƒw²¶´?àgP&ä ž?àbæîv²?àbæëeÕÿ?àb³›T?àb³—ó v?àb€Gœ«?àb€DŒ€–?àbLôBÔ?àbLñ1öë?àb ó´Á?àbãp?àaæM±‚h?àaæJ¡t¯?àa²ú{gô?àa²÷kcÔ?àa§Qeø?àa¤Akq?àaLT3£?àaLQ#²&?àa"z?àaþ#?à`宄?à`å« ¦D?à`²[#[º?à`²X‡”?à`6Aþ?à`&wp?à`KµUj,?à`K²E©6?à`b€®¸?à`_p÷[?à_å¸6H?à_å ¨ˆƒ?à_±¼ûôº?à_±¹ìP?à_~jLþ?à_~g?à_K˜­“?à_ű­?à_Â*I?à^är…j˜?à^äouìÍ?à^± ],?à^±öèø?à^}Í“‰ù?à^}Ê„^?à^J{-Ÿ?à^Jx¶œ?à^(Òùú?à^%â?à]ãÖ…8?à]ãÓuÊf?à]°„C˜÷?à]°4T¼?à]}2=V?à]}.ÿ´?à]IßåR?à]IÜÖ ÷?à]Ⱦ)?à]Š¹–·?à\ã;¸hù?à\ã8©K ?à\¯éµV?à\¯æ¦AÆ?à\|—¿Ìê?à\|”°ÂA?à\IEÖ“¨?à\IBÇ’—?à\óùꆷ?àZ{fÔµ?àZ{cÅný?àZHgsÍ?àZHXÒ­?àZÄc6?àZÀøË®?àYár³µÈ?àYáo¥'Ø?àY®!lžÄ?àY®^l?àYzÐ2¹?àYzÍ#£ù?àYG{?àYG{õ’S?àY-âŒû?àY*Ô%k?àXàÜÍ»Â?àXàÙ¿]Ê?àX­‹ÅPü?àX­ˆ¶üœ?àXz:És@?àXz7»(x?àXFéÚ?àVß´°1c?àVß±¢3[?àV¬d%Ó‚?àV¬aß?àVy¨ ?àVyšG?àVEÃ6Üp?àVEÀ(û/?àVrÒjX?àVoÄ’¯?àUß"z²]?àUßläK?àU«Ò/‚d?àU«Ï!½ë?àUxñH?àUx~ã_g?àUE1¿aC?àUE.±¯ù?àUášK4?àUÞŒ£‚?àTÞ‘åR?àTÞŽtG8?àT«AvI|?àT«>h´ú?àTwñwR‡?àMÚº·ð(?àM§o|ø:?àM§lp³s?àMt!B¸[?àMt6}+?àM@Ól?àM@Ð MÔ?àM „õZœ?àM é2›?àLÚ6âW?àLÚ3Ö8±?àL¦èÜO}?àL¦åÐ:«?àLsšãvâ?àLs—×k§?àL@L÷´ƒ?àL@Ië²ß?àL ÿ?àL ü ƒ?àKÙ±Gê?àKÙ®;Ÿu?àK¦cƒ*À?àK¦`wEã?àKsËÓN?àKs¿ø?àK?È!¡d?àK?Å϶?àK z„®Ò?àK wxæ»?àJÙ,ôÉ’?àJÙ)é ?àJ¥ßr?àJ¥Üfc)?àJr‘üš?àJrŽðÖI?àJ?D”,?àJ?AˆŠÕ?àJ ÷8æõ?àJ ô-NÓ?àIØ©êãÜ?àIئßUP?àI¥\©ýá?àI¥Yžxí?àIrv[v?àIr jà?àI>ÂPd?àI>¿D¤Ÿ?àI u6ãc?àI r+{4?àHØ(*õ‡?àHØ%–ð?àH¤Û,4 ?àH¤Ø ß ?àHqŽ:¸Â?àHq‹/mZ?àH>AVjë?àH>>K)?àH ôpî?àH ñt8´?àGקµ¾µ?àGפª?àG¤ZùTÃ?àG¤Wî/¸?àGqJ@??àGq ?$Ê?àG=Á¨hq?àG=¾V”?àG uÍÙ?àG rÅ“?àF×(ŒŠE?àF×%‹–?àF£Ü‘–?àF£Ùœ~?àFp¥äS?àFpŒšøÓ?àF=CFœD?àF=@;ºZ?àF öô” ?àF ó黹?àEÖª¯ås?àEÖ§¥·?àE£^x›?àE£[mØv?àEpNÉ­?àEpD ?àE<Æ2DK?àE<Ã'’T?àE z# þ?àE weŸ?àDÖ.!3ë?àDÖ+•"?àD¢â,Ã5?àD¢ß".?àDo–E¼a?àDo“;0Ç?àD¢?à?©¯:?à?¥ø&‰?à>Ó^˜"t?à>Ó[Ž£[?à>  2ÎÊ?à>lÉî.~?à>lÆä‘?à>9­¯"?à>9|¤LÍ?à>5zßñ?à>2q‡2?à=ÒëUÚž?à=ÒèL‹v?à=Ÿ¡>†|?à=Ÿž5@ë?à=lW4ð¦?à=lT+´«?à=9 9 ?à=9 /Ú ?à=ÃKç?à=ÀAÙ?à<Òyjj?à<Òva~4?à<Ÿ/—ùD?à<Ÿ,Žã¤?àä–j?à.2üµ(?à.2ù QÊ?à-ÿ¶B´?à-ÿ³ ?à(—oÀ?à(—lÈÃ?à(d*ÒcÄ?à(d'Í]?à(0æ¬E?à(0㧮?à'ý¢”Åm?à'ýŸ‹1?à'Ê^‹ð—?à'Ê[†¿ð?à'—‘Óÿ?à'—Œ¬î?à'cÖ¦p$?à'cÓ¡R©?à'0’ɸö?à'0Ä¥?à&ýNûÈ?à&ýKö½´?à&Ê <„µ?à&Ê7ƒú?à&–Ç‹ü?à&–ćë?à&cƒê;?à&c€åM…?à&0@W¥?à&0=R8ª?à%üüÒßí?à%üùΈ?à%ɹ]F³?à%ɶXuã?à%–uöw?à%–rñ¯Ù?à%c2ždú?à%c/™§U?à%/ïU6„?à%/ìP‚u?à$ü¬º?à$ü©‡?à$Éhï"?à$Éeê/?à$–%ÒV"?à$–";Ò?à$bâÄJ?à$bß¿¼e?à$/ŸÅ$?à$/œÀŸú?à#ü\Ôˉ?à#üYÐPú?à#Éó@×?à#ÉîÏÝ?à#•× ˜?à#•Ô64?à#b”\É0?à#b‘Xka?à#/Q§·”?à#/N£cZ?à"ü´p?à"ü ýiË?à"ÈÌju?à"ÈÉf3ù?à"•‰âr?à"•†Ýçø?à"bGh§ž?à"bDdy¹?à"/þ'?à"/úÅ?à!û¢l4?à!û¿žQy?à!È€U¶?à!È}Q¤ô?à!•>ߦ?à!•;Ø?à!aûèÜÌ?à!aøäÞÑ?à!.¹Èà$?à!.¶Äë¾?à ûw·ÝŸ?à ût³òÏ?à È5µÉ.?à È2±çó?à ”ó–Ä?à ”ð¾¿?à a±Þxõ?à a®Úªä?à .p J¤?à .m†(?àû.BÿÇ?àû+?Dá?àÇ싱â?àÇ鈑?à”ªãzz?à”§ßÒ¾?àaiJ@ù?àafF¢Ò?à.'ÀÚ?à.$¼qH?àúæDÉ”?àúãA>—?àǤؙ(?àÇ¡ÕÀ?à”c{Ž?à”`xB?àa"-vÀ?àa*‚?à-àîl­?à-Ýë?àúŸ¾cÌ?àúœ»¸?àÇ^u ?àÇ[š$!?à”‹‰š?à”ˆA°?à`܈ÒA?à`Ù…“ì?à-›•z?à-˜‘Ü»?àúZ°mF?àúW­B?àÇÚÿ(?àÇ×Ý’?à“ÙŽN?à“ÖvM?à`˜`cR?à`•]Tæ?à-Wº€Q?à-T·{y?àú#³´?àú ¸r?àÆÖœ0?àÆÓ™>X?à“–#Ü°?à““ ô˜?à`Uº­ª?à`R·Ï&?à-`Èó?à-]ô?àùÕ/?àùÒcª?àƔںÆ?àÆ‘×ù?à“T®…¾?à“Q«ÍŽ?à`‘©b?à`ŽúÇ?à,Ô„£?à,Ñ[œ?àù”…¤ý?àù‘ƒ ‹?àÆT––æ?àÆQ” ?à“¶±O?à“´)?à_Ôæ&¸?à_Ñã¨?à,•$ë?à,’"uó?àùUs W?àùRpŸÍ?àÆÐ{|?àÆΆ?à’Ö=;ö?à’Ó:ã–?à_–¹Y¼?à_“· ð?à,WDÈÈ?à,TBƒ‘?àùߢŒ?àùÝfê?àÅ؉Áþ?àÅÕ‡ð?à’™C@–?à’–A?à_Z 7Ê?à_W å?à,äiŒ?à,âT=?àøÛÌÙ?àøØÊ ?àÅœÃ:?àÅ™Á7ù?à’]ɧÚ?à’ZǯH?à_߃ý?à_Ý”ÿ?à+àÎý?à+Ýé”?àø¡9|Ï?àøž7 û?àÅb}šk?àÅ_{È,?à’#Ñ4Ã?à’ Ïl?à^å43N?à^â2t8?à+¦¦£?à+£¤í‚?àøh(©Î?àøe&ýà?àÅ)º ²?àÅ&¸gY?à‘ëZèš?à‘èYOÕ?à^­ Fü?à^ª ·Ì?à+nËÓ?à+kÉ“8?àø0šk ?àø-˜ï?àÄòyJ›?àÄïwØ(?à‘´gÄv?à‘±f[˜?à^ve§?à^sdGÍ?à+8sm?à+5q·?à÷ú p?à÷÷ŽÀO?àļ¼?àĹ»M„?à‘~ø£Â?à‘{÷jÊ?à^ADTv?à^>C%?à+Ÿ–$?à+žpU?à÷Æ \Å?à÷à @Š?àĈ„ÁÆ?àÄ…ƒ¯?à‘KŘ?à‘H ¼…?à^ ¨h±?à^ §i2?à*ÐQ†?à*ÍP(?à÷“ P?à÷ cÉ?àÄUÒºË?àÄRÑØ ?à‘ªÓ ?à‘©ùÝ?à]Û’ŒÓ?à]Ø‘½:?à*ž‰è™?à*›‰"•?à÷aæÏ?à÷^*_?àÄ$¨í?àÄ!§Ý?àçÑ¿?àäÐjw?à]« L ?à]¨¬V?à*nQE¿?à*kP¯Ÿ?à÷1© É?à÷.¨=?àÃõ,?àÃòü5?งØÁ?േ_^?à]|õ†?à]y…·?à*?¥½?à*<¥VÈ?à ÷LU?à ÷Køk?à ÃÇÊ¡?à ÃÄwŽ?à ŠÈø¸?à ‡È¯9?à ]NŸ3?à ]KžÅH?à *„ðŠ?à *„º3?à öÖz¢5?à öÓzur?à Ú€@?à ×€é?à ^•±±?à [•˜?à ]"ºêù?à ]ºÚó?à )æðU?à )ãïþã?à ö«5 °?à ö¨5Ò?à Ão‰ß?à Ãl‰ëÉ?à 3îŸV?à 0îµ ?à \øc[g?à \õc{E?à )¼çáÓ?à )¹è E?à ö|?Œ?à ö~|r’?à ÃF ¦Û?à ÃC ãu?à ÔÿF?à ÕEs?à \Ï™<Ä?à \Ì™Œ…?à )”mx»?à )‘mÒ?à öYQ§ ?à öVR ?à ÃEÈd?à ÃF4á?à ãIÄ?à àJ:!?à \¨]Ìl?à \¥^L?à )mÈý?à )j‚R5?àö2µß™?àö/¶re?àÂ÷ùÞ×?àÂôú{8?à½Mà?àºN†?à\‚±×J?à\²†Ò?à)H%Ñb?à)E&Š~?àö ©Û@?àö ªð?àÂÓ=èä?àÂÐ>µ'?à˜áúº?à•âБ?à\^–* ?à\[— ‹?à)$Zk?à)![T?àõê.¥?àõç/—¤?à° h?à­Ž?àvi±?àsok?à\< ÜE?à\9 ë’?à) o ?à(ÿ!‡î?àõÈE"u?àõÅFDé?àÂŽyêy?à‹{?àT¾»?àQ¿ð´?à\º?à\ùJ?à(áxçô?à(Þz0·?àõ§î8ž?àõ¤ïŠô?àÂns ?àÂktü?à5 +A?à2 ¿?à[û®ç?à[ø°V?à(ÂdÇM?à(¿f?ò?àõ‰*å€?àõ†,g¸?àÂP)$?àÂM´ð?àç«?àé@ì?à[ÝÞGÓ?à[ÚßæÆ?à(¤åH?à(¡æ¿Î?àõký1m?àõhþã‡?àÂ3&­e?àÂ0(i?àŽú`n¸?àŽ÷b3ù?à[ÁªŽ¶?à[¾¬]Š?à(‰Ü?à(†´n?àõPo|p?àõMq^k?àÂê‰D?àÂìtÒ?àŽßuÝš?àŽÜwÒ¼?à[§†U?à[¤… ?à(n½U?à(k¿˜?àõ6yã%?àõ3{õ?àÁþF˜?àÁûH³…?àŽÆ#¼ ?àŽÃ%á ?à[ŽB÷?à[‹q?à(V-T?à(Se}?ßÿê<:Þ4?ßÿê6?a­?ßÿƒÌxq?ßÿƒÆ|¨?ßÿ\ÖX¾?ßÿVÛ„?ßþ¶íUQt?ßþ¶çZ`?ßþP}õ.-?ßþPwùþ??ßýêµïË?ßýêºÓ?ßýƒŸ——$?ßýƒ™œƒ?ßý0š :?ßý*ŸÀ?ßü¶Á½š‚?ßü¶»Â·.?ßüPSÆ~?ßüPMöQ?ßûéäg ]?ßûéÞlPV?ßûƒuí%j?ßûƒoò{Š?ßû”A5?ßû™ª{?ßú¶™\aœ?ßú¶“aÞ?ßúP+E‡x?ßúP%K ?ßùé½OÌ~?ßùé·Uo7?ßùƒOzÿÎ?ßùƒI€µ¬?ßùáÇT?ßùÛÍ?ßø¶t4±?ßø¶n:>?ßøPÂÿ?ßøPÈîS?ß÷é™rW…?ß÷é“xYü?ß÷ƒ,BÔM?ß÷ƒ&Héê?ß÷¿4?ß÷¹:·Ö?ßö¶RGVø?ßö¶LM’â?ßöOå{>?ßöOßßM?ßõéxЦ§?ßõér×Ü?ßõƒ Få–?ßõƒMZñ?ßõŸÞ—?ßõ™å?ßô¶3—?ßô¶-­Å?ßôOÇpè’?ßôOÁw—_?ßóé[lNP?ßóéUsC?ßó‚"?ßó‚é„;?ßóƒÆVh?ßó}Í>¦?ßò¶%Dü?ßò¶,@`?ßòO¬¥{¶?ßòO¦¬Š@?ßñéAG-?ßñé;NNÊ?ßñ‚Ö y?ßñ‚ÐDO?ßñjî<ˆ?ßñdõ„„?ßðµÿóÿ¡?ßðµùûZÁ?ßðO•?ßðO"}X?ßïé*cRä?ßïé$jÔP?ßï‚¿Ìý“?ßԒ%?ßïUXZ?ßïO`7?ßîµëîM?ßîµå ©)?ßîO€ÓU?ßîOzÚÒW?ßíéÂr?ßíéÊ~š?ß킬ÓÓL?ß킦ÛÇ™?ßíCCd?ßí=J×?ßìµÙZj¾?ßìµÓb…V?ßìOoÒ?ßìOiÚ.Ó?ßëémÞ?ßëéuÀÁ?ßë‚*Úi?ßë‚—3.q?ßë4 ®F?ßë.t?ßêµË _”?ßêµÅÙæ?ßêOb,½„?ßêO\5Jü?ßéèùpá½?ßéèóy‚Z?ßé‚ÖÍ?ß邊߀Õ?ßé(^€]?ßé"gGE?ßèµÀã¡?ß赺½®?ßèOWÓB'?ßèOQÜ/Y?ßçèïÀk?ßçèéÉks?ß炇ÏF‰?ßç‚ØZ?ßç ²?ßç FS?ß浸R÷l?ßæµ²\12?ßæOPÇ„?ßæOJÐÑ?ßåèé^?ßåèãgq?ßå‚‚m^?ßå‚|à“?ßåð²Æ?ßåú9 ?ßäµ³í²?ßäµ­ö­2?ßäOM _V?ßäOG ú?ßãèæK}º?ßãèàU=ƒ?ßã‚­º?ßã‚y·?ßã2H?ßã;û[?ßâµ²ØE¯?ß⵬â>æ?ßâOL }¿?ßâOFªŠ?ßáèæŠ×?ßáèà”ö—?ßá‚€— î?ßá‚z¡S”?ßáÅ¿L?ßáÐ?ß൵hœ?ß൯ Á‹?ßàOO‰à?ßàOI“pô?ßßèêø$?ßßèä(w\?ßß‚„Ôà?ßß‚~ßra?ßß­îð?ß߸”r?ßÞµº©WF?ßÞµ´´ì?ßÞOUÆèF?ßÞOOÑ´?ßÝèñ‰ø?ßÝèëhç?ßÝ‚ŒhnÆ?ßÝ‚†s`Ù?ßÝ'ì°A?ßÝ!÷µy?ßܵÓè?ßܵ½žE?ßÜO_[Ÿ?ßÜOYfÊ›?ßÛèûF˜p?ßÛèõQ×?ßÛ‚—SÀ.?ßÛ‚‘_ø?ßÛ3ƒH¯?ßÛ-Ž­?ßÚµÏÕK?ßÚµÉàß?ßÚOlI˜ ?ßÚOfU#B?ßÙéà0?ßÙéë´Š?ßÙ‚¥™&?ßÙ‚Ÿ¤Â¥?ßÙBt‰¶?ßÙ<€NZ?ßصßrO(?ßصÙ~&ï?ßØO|’{?ßØOvžeü?ß×éÕ'?ß×éá%?ßׂ·:"J?ßׂ±F3~?ß×TÁ·ü?ß×NÍÜT?ßÖµòk·b?ßÖµìwîÞ?ßÖO8Œ?ßÖOŠDS,?ßÕé.'V?ßÕé(3m?ßÕ‚Ì8‚E?ßÕ‚ÆDó-?ßÕjl“¬?ßÕdy¸?ßÔ¶ÃDW?ßÔ¶ÏÛ†?ßÔO§¤?ßÃÁKç?ß·k½é?ß·eÍÝy?ßÂQcõp?ßÂQ süø?ßÁêµ-}:?ßÁê¯=—å?ßÁ„ZOÉ?ßÁ„T*}–?ßÁÿ*¸ ?ßÁù:øû?ßÀ·¤^ž?ßÀ·žnò#?ßÀQIµÑ6?ßÀQCÆ8l?ß¿êï0ƒ²?ß¿êé@þ ?ß¿„”ÎÏ?ß¿„Žß\?ß¿:‚~?ß¿4¡#?ß¾·àužð?ß¾·Ú†R°?ß¾Q†~VŽ?ß¾Q€q?ß½ë,ªÂÎ?ß½ë&»œÓ?ß½„Òú³?ß½„Í  6?ß½ynd?ß½s®?ß¼¸  ?ß¼¸m?ß¼QÆ¿¼\?ß¼QÀÐâë?ß»ëmõ×?ß»ëg¯/ˆ?ß»…Ÿè›?ß»…±5n?ß»»Å|¿?ß»µÖÜ´?ߺ¸cšU?ߺ¸] l?ߺR {Œ>?ߺRx?ß¹ë² $?߹묢€?ß¹…YÀ[ç?ß¹…SÒf?ß¹šw©?ß¹û¬7I?߸¸©š¥2?߸¸£¬wô?߸RQ¾´ã?߸RKКÈ?ß·ëúÀ)?ß·ëô¹0?ß·…¢r¯?ß·…œ„»E?ß·K‚‰?ß·E¡Ô?߶¸ó¶SÝ?߶¸íȆJ?߶RœŽ<’?߶R– ‚ ?ßµìE‰óW?ßµì?œL?ßµ…î©Ã?ßµ…è¼.Ù?ßµ—퓳?ßµ’§?ß´¹AUMw?ß´¹;gß?ß´Rêá;?ß´RäóàP?߳씑,?߳쎣äa?ß³†>eU?ß³†8wÓÑ?ß³è]3…?ß³âp"?ß²¹’ydK?ß²¹ŒŒV ?ß²S<¹ÌÆ?ß²S6Ìѧ?ß±ìçU ?ß±ìá1m?ß±†‘¦å3?ß±†‹ºW?ß± ??ߥï Ð]9?ߥïå³!?ߥˆÏœb8?ߥˆÉ±ËA?ߥ"~Ú?ߥ"x¢~?ߤ¼-¢U€?ߤ¼'·äÊ?ߤUÜÜ,Ÿ?ߤUÖñÏ ?ߣïŒ:Ñì?ߣï†P‡x?ߣ‰;¾Ó?ߣ‰5ÓÝ€?ߣ"ëf½?ߣ"å{ê‹?ߢ¼›2Àj?ߢ¼•H¯X?ߢVK$*‘?ߢVE:,Ÿ?ß¡ïû:5S?ß¡ïõPJ‚?ß¡‰«u¸?ß¡‰¥‹;?ß¡#[ÔÜ?ß¡#Uëˆ?ß ½ Y/«?ß ½o~?ß“ócñÑ?ß“+?:?ß“Dí?ß“&Ô£®?ß“&μ†Ö?ß’ÀŠAþ?ß’À„Z{ð?ß’Z@åæ?ß’Z:ä÷?ß‘óõí°v?ß‘óð§?ß‘«ü ?ß‘¦.V?ß‘'b/Ë\?ß‘'\IÌ?ßÁ‰)l?ßÁ¢tû?ßZÏ¢?ßZÉ!vQ?ßô…¬~"?ßôÅïð?ߎ?ß‹õªFëD?ß‹ho)”?ß‹b‰m¹?ß‹) ×2k?ß‹)ñ‰¯?ߊÂÙe¦?ߊÂÓq ?ߊ\’³ô?߉)·0õÓ?߈Ãva y?߈Ãp{Ôw?߈]/Ñ¥ž?߈])ì‚»?߇öéh6?߇öãƒ&A?߇£$r¤?߇?uÿ?߇*]¾x?߇*W!Ôò?߆ÄÜÌ?߆Ä*e?߆]Ñ<Ú£?߆]ËX[?ß…÷‹’ñy?ß…÷…®AO?ß…‘F^Ï?ß…‘@,ÁÄ?ß…+µÑ?ß…*úÑG?ß„Ä»€a[?߄ĵ›êŒ?ß„^vq)?ß„^pŒÅo?߃ø1‡÷Û?߃ø+£§J?߃‘ìÄó%?߃‘æ൲?߃+¨(4­?ß,üZ‰?ß~Æ¿F £?ß~ƹb±?ß~`|te"?ß~`v‘ 9?ß}ú9È÷ ?ß}ú3åÅA?ß}“÷Cñ(?ß}“ñ`Ò|?ß}-´å`q?ß}-¯Tã?ß|Çr­- ?ß|ÇlÊ4?ß|a0›p:?ß|a*¸Šè?ß{úî°*«?ß{úèÍXw?ß{”¬ë8F?ß{”§y0?ß{.kL×?ß{.ej+?ßzÈ)Ôï8?ßzÈ#òV^?ßzaèƒu*?ßzaâ ïn?ßyû§XŽf?ßyû¡vÈ?ßy•fT#?ßy•`qÓ?ßy/%v3ã?ßy/“ç€?ßxÈä¾æX?ßxÈÞÜ­?ßxb¤."˜?ßxbžKüq?ßwücÃéW?ßwü]áÖN?ßw–#€Gˆ?ßw–žGœ?ßw/ãcVf?ßw/Ýi˜?ßvÉ£lþ?ßvÉ‹$g?ßvccK“?ßvc]»…?ßuý#ôX?ßuý¤š?ßu–äqó1?ßu–ÞRÙ?ßu0¥N·?ßu0Ÿ4Á|?ßtÊeáF†?ßtÊ_ÿÌi?ßtd&Ó Z?ßtd ñ¥[?ßsýçëˆa?ßsýâ 4?ßs—©*Ç…?ßs—£I†À?ßs1j¾“ê~?ßhi û%D?ßhiû«?ßhϪs{?ßhÉË\þ?ßgœ•+?ßgœ¢'§?ßg6[4 ?ßg6U CÊ?ßfÐ!¤§À?ßfÐÅÊ™?ßfiçñnK?ßfiâ¤@?ßf®e”š?ßf¨†Ý«?ßeuZ?ßeo"wˆ?ße7;Ä'ð?ße75å—;?ßdÑ®–J?ßdÐüа?ßdjÉÀsY?ßdjÃâÜ?ßdùØ8?ßd‹€Ø?ßcžXZ­?ßcžR|hÚ?ßc8ã :?ßc8Ú?ßbÑç’ó&?ßbÑá´Õ?ßbk¯j@ä?ßbk©Œ5ô?ßbwi2H?ßbq‹:t?ßaŸ?»À?ßaŸ9±×?ßa9ÝÅ?ßa9ÿóæ?ß`ÒÐS\p?ß`ÒÊuð?ß`l˜ð¥ê?ß`l“ú‡?ß`aµer?ß`[×Í*?ß_ *¡ØÜ?ß_ $ÄS±?ß_9ó¶ ?ß_9íØšû?ß^Ó¼ñÅ~?ß^Ó·fŠ?ß^m†U@?ß^m€wô7?ß^Oàq#?ß^J8g?ß]¡“Yj?ß]¡¶3Ê?ß]:ãnÃ?ß]:Ýó>?ß\Ô­p^f?ß\Ô§“^þ?ß\nwšcþ?ß\nq½w±?ß\Aì;Þ?ß\<b­?ß[¢ eòî?ß[¢‰,Ø?ß[;×e"?ß[;Ñ*²(?ßZաПf?ßZÕ›óÿ‡?ßZolÁ®”?ßZofå!Ñ?ßZ 7Ú‡?ßZ 1þ v?ßY£N\?ßY¢ý>çÐ?ßY<΄(?ßY<ȧ½·?ßXÖš“?ßXÖ”8RÁ?ßXpeͨ?ßXp_ðØn?ßX 1­ú?ßX +ÑgÜ?ßW£ýµ×Ö?ßW£÷ÙÐÓ?ßW=Éæ Q?ßW=Ä ,j?ßV×–>\?ßV×b{F?ßVqb¾‹Á?ßVq\â¾?ßV /f¼??ßV )‹©?ßU¤ü6î0?ßU¤ö[F¶?ßU>É/?ßU>ÃS¤?ßTØ–OLÕ?ßTØsË’?ßTrc—«´?ßTr]¼=‹?ßT 1k?ßT +,§^?ßS¥þ j?ßS¥øÅ" ?ßS?Ì`ï‡?ßS?Æ…º°?ßRÙšKÇø?ßRÙ”p¦W?ßPÚ¢I´-?ßPÚœnñ÷?ßPtq(šÍ?ßPtkMë³?ßP@/ìÐ?ßP:UPÐ?ßO¨_ž¨?ßO¨ …Ã?ßOAÞ·ŒT?ßOAØÝŠ?ßNÛ®7ÿÆ?ßNÛ¨]?ßNu}àá*?ßNux‘–?ßNM²Â?ßNG×ÜH?ßM©«ËÔ?ßM©Ñ¢t?ßMBíÍîÊ?ßMBçóØ…?ßLܾŽ…?ßLܸ>‹Z?ßLvŽ‹·Ü?ßLvˆ±ÇÍ?ßL_'S?ßLYMv?ßKª/ëlâ?ßKª*£?ßKDØ*®?ßKCúþsî?ßJÝÑít¦?ßJÝÌÑ?ßJw£+&Ï?ßJwQ–D?ßJt‘~Ù?ßJn¸h?ßI«F q,?ßI«@GÕ?ßIE×þn?ßIEþ§2?ßHÞé¸?§?ßHÞãÞû…?ßHx»Á´?ßHxµçÓ¬?ßHòfž?ßHˆH±?ßG¬`LŠ˜?ßG¬ZsÅ?ßGF2ÏXê?ßGF,öa0?ßFàzÞb?ßFßÿ¡ùÃ?ßFyØOª?ßFyÒvJ%?ßF«L)Â?ßF¥skW?ßE­~q؈?ßE­x™-8?ßEGQÀYa?ßEGKçÁ*?ßDá%7 Ê?ßDá_­?ßDzø×£$?ßDzòÿ1"?ßDÌ mJ?ßDÆÈa?ßC® ’F?ßC®š¹Ìw?ßCHt¬€?ßCHnÔGg?ßBâHïÖ@?ßBâC°¥?ßB|\á?ßB|ƒð_?ßBññ®?ßBìF?ßA¯Æ¯Ò?ßA¯Àׄ?ßAI›•ß^?ßAI•¾*?ß@ãp¥©X?ß@ãjÍã=?ß@}EÞe`?ß@}@²_?ß@@?ß@ht.?ß?°ðÊ©æ?ß?°êó?ß?JÆ~3¥?ß?JÀ¦¹ñ?ß>äœZâ·?ß>ä–ƒ|?ß>~r`zÆ?ß>~l‰'E?ß>HÔ?ß>B·Ôm?ß=²æ½µ?ß=²g?ß=Kõgv?ß=Kï[Í?ß<åÌ>_?ß<åÆ:7D?ß<¢ä/Ì?ß< ;Ê?ß<yà&?ß<t 9=?ß;³Q"œ?ß;³K.TÌ?ß;M(Sn`?ß;M"|³©?ß:æÿÊÍP?ß:æùô%³?ß:€×kL3?ß:€Ñ”·°?ß:¯4÷ç?ß:©^v|?ß9´‡'Ðú?ß9´Qb¨?ß9N_F(Æ?ß9NYoÍ?ß8è7·?ß8è1¹Ñ˜?ß8‚j?ß8‚ -5?ß8è “?ß8âÉø¦?ß7µÁf7ì?ß7µ»)?ß7OšUÂÄ?ß7O”Ç ?ß6ésn¯‰?ß6ém˜Æç?ß6ƒL±/“?ß6ƒFÛZ ?ß6&ún?ß6 G7þ?ß5¶ÿ²Mœ?ß5¶ùÜžD?ß5PÙqŒ?ß5PÓ›M?ß4ê³YjÝ?ß4ê­ƒá·?ß4„kN„?ß4„‡•Øw?ß4g¦°Å?ß4aÑMÑ?ß3¸B ’C?ß3¸<6Bg?ß3Rš$H?ß3RÄç…?ß2ë÷RO?ß2ëñ}%n?ß2…Ò3úü?ß2…Ì^äj?ß2­?@â?ß2§j=h?ß1¹ˆtEò?ß1¹‚ŸU‘?ß1ScÒÍä?ß1S]ýðœ?ß0í?[9?ß0í9†L ?ß0‡ îØ?ß0‡87Á?ß0 öè‰?ß0 ñå?ß/ºÒíÍ"?ß/ºÍ<Ïåâ?ß-¼!z*D?ß-¼¥ø×?ß-Uþyü ?ß-Uø¥ÝÌ?ß,ïÛ£ ˜?ß,ïÕÏ•\?ß,‰¸÷ "?ß,‰³#þ?ß,#–tK~?ß,# fr?ß+½tkr?ß+½nG™~?ß+WQìH?ß+WL‰??ß*ñ/ç+?ß*ñ*L?ß*‹ äD?ß*‹8K˜?ß*$ìZtP?ß*$æ†î¼?ß)¾ÊÓ v?ß)¾Äÿ™ú?ß)X©uˆÒ?ß)X£¢)n?ß(òˆAö%?ß(ò‚n©Ø?ß(Œg8U?ß(ŒaeÙ?ß(&FXÊœ?ß(&@…¤?ß'À%£&Î?ß'ÀÐÉ?ß'ZŽ°?ß'YÿDŽÂ?ß&óäµêˆ?ß&óÞâý²?ß&Ä~k˜?ß&¾«‘Ú?ß&'¤pú&?ß&'žž3€?ß%Á„Š ?ß%Á~º×?ß%[dÔB?ß%[_¡¥?ß$õEEÜ?ß$õ?r{|?ß$%ßßz?ß$ e2?ß$)¤÷6?ß$)Ò?ß#Âç”,(?ß#ÂáÁØ?ß#\È­‹ ?ß#\ÂÛJ ?ß"ö©ña?ß"ö¤Úw?ß"‹^°Ø?ß"…Œ–?ß"*löc?ß"*g$•¨?ß!ÄN¸Âj?ß!ÄHæÍÆ?ß!^0¥ „?ß!^*Ó>÷?ß ø»Äs?ß ø éõþ?ß ‘ôü–‚?ß ‘ï*Û$?ß +×gÇß?ß +Ñ–˜?ߏÿ|½?ßÅ´-ç?ß_œÃô?ß_–òrv?ßù²Ùf?ßùyáje?ß“bÌD/?ß“\úèE?ß-F)P?ß-@>à}?ßÇ)~‰h?ßÇ#­S«?ßa q0?ßaFNŠ?ßúðÚá;?ßúë Ѭ?ß”ÔÈæI?ß”Î÷éÑ?ß.¸átÊ?ß.³‹i?ßÈ$Z?ßÈ—S·?ßb’<©?ßb{Áyv?ßüf*³è?ßü`ZÌ?ß–JíªÏ?ß–E Ê?ß0/ÛFb?ß0* ¼s?ßÊó“\?ßÊ#ƒ?ßcú6†(?ßcôf"f?ßýߤd?ßýÙÓι?ß—Å<.?ß—¿lRš?ß1ªÿœk?ß1¥/qí?ßËíuC?ßË‹]Ü?ßewü?ßeq5þ¬?ßÿ]IRR?ßÿWya?ß™C·|?ß™=çø?ß3*PtÖ?ß3$€©È?ßÍ$Â?ßÍ DlË?ßfø¤À?ßfò2ÿß?ß߈?ßÙLo¾?ßšÆ`;¬?ßšÀ¼ø?ß4­ÏS¾?ß4§ÿè ?ßΕi>6?ßΙå®?ßh}.ä?ßhw^Îs?ßeÕ`?ß_N£?ßœM8w?ßœGiW×?ß65~Ë?ß6/®ùœ?ßÐîŽ"?ßЕ ?ßjŠ(þ?ßj»Bû?ßïP²‚?ßéß•?ßØB+F?ßÒsko?ß7Á^Ä`?ß7»Ÿ?ßѪ¦Mæ?ßѤ״;?ßk”ìÃ?ßkŽJf.?ß}¶¡?ßwè.?ߟgT–?ߟa°ô,?ß9Qs*Î?ß9K¤Ýz?ß Ó;’$Î?ß Ó5Ãê?ß m%Ü6þ?ß m Ö?ß Qaö?ß  ƒMä?ß  úñʨ?ß  õ#É«?ß :å½A!?ß :ßïS:?ß Ôгöu?ß ÔÊæ¤?ß n»Õß?ß n¶W?ß §"ïu?ß ¡U:Î?ß ¢’›4=?ß ¢ŒÍ’¬?ß <~>º#?ß ù`?ß>,1p?ßØ µ‹?ßØÓ™?ßqôs7e?ßqî¦.?ß áq/\?ß Û¤9‹?ߥΚ‘Ü?ߥÈͯ ?ß?»ñ†…?ß?¶$¶ß?ßÙ©vMD?ßÙ£©²?ßs—&¤»?ßs‘Yû??ß …r?ß 5÷ ?ߧs ý?ߧm=„ª?ßAa=-$?ßA[p¼ç?ßÛO›å&<ð?ßu8YòÜ?ß,ÜY*?ß'"+?ß©½ýè?ß©ñÙÿ?ßC ËhF?ßCÿWq?ßÜú€–?ßÜô8‚Ö?ßvéi/4?ßvãDˆ?ßØù¥?ßÓ-͆?ߪȵîü?ߪÂê*z?ßD¸Üï?ßD²Ò+?ÞÿÞ¨±Ÿô?ÞÿÞ¢æ›?Þÿx˜ñ `?Þÿx“%•?Þÿ‰\jÞ?Þÿƒò®?Þþ¬yó€?Þþ¬t(å?ÞþFj¶lf?ÞþFdë_?Þýà[¥i?ÞýàUÙÙw?ÞýzL¿¨ò?ÞýzFô}?Þý>?Þý8;¶?Þü®/xao?Þü®)­[»?ÞüH!®Ö?ÞüHK¼5?ÞûâàÖÖ?Þûâ ÷J?Þû|ÖÙü?Þû{ÿ „?ÞûöøÑ?Þûñ.¡?Þú¯éF¼?Þú¯ã|2?ÞúIÛÀµ0?ÞúIÕö!õ?ÞùãÎf¯†?ÞùãÈœ/`?Þù}Á8“Ö?Þù}»n&Ã?Þù´6nÊ?Þù®lÌ?Þø±§`qT?Þø±¡–*i?ÞøKš¶ƒÌ?ÞøK”ìOö?Þ÷åŽ8ŽŠ?Þ÷åˆnmÇ?Þ÷æ¶h?Þ÷|¨º?Þ÷uÁ?Þ÷o÷ h?Þö³iÇ_¤?Þö³cýx?ÞöM]ùÉê?ÞöMX/õw?ÞõçRXk®?ÞõçLŽªO?ÞõFã?ÞõAfÉ?Þõ;š$?Þõ5Ðgí?Þôµ0}7?Þôµ*³–?ÞôO%ŒZ¾?ÞôOÂå®?ÞóéÇÝ?Þóéþ{“?Þóƒ/›?Þóƒ fL-?ÞóÇÎ?ÞóÿúKù?Þò¶ûƒ¼g?Þò¶õº“¦?ÞòPñp9q?ÞòPë§#Ã?ÞñêçˆóZ?Þñêá¿ðÀ?Þñ„ÝÍöÌ?Þñ„ØE?ÞñÔ?\r?ÞñÎvÿ?Þð¸Êݘ?Þð¸Å78?ÞðRÁ§ ?ÞðR»ÞQ¾?Þïì¸['?Þïì²Ô·î?ÞÀ†?Þ÷va?Þï §"é?Þï ¡F¥Ö?ÞŠ¤·?ÞÂ:·?ÞîT–2Œ~?ÞîTj5’?ÞíîŽÚÇ?Þíîˆ>–î?Þ툆¨F?Þ툀?w?Þí"~4él?Þí"xl˹?Þì¼vùx?Þì¼pÈîØ?ÞìVoèx?ÞìViSðì?ÞëðgÓ}{?Þëðb ™?ÞëŠ`·¬ý?ÞëŠZïÛ—?Þë$YÈ›Â?Þë$TÝn?Þê¾S>=?Þê¾M>’ü?ÞêXLpˆß?ÞêXF¨ð±?ÞéòF”a?Þéò@@F?ÞéŒ?ËI?ÞéŒ:×?Þé&9»ËË?Þé&3ôlÖ?ÞèÀ3Ù?ÞèÀ.Ñ"?ÞèZ.#%)?ÞèZ([ìY?Þçô(™üÛ?Þçô"Ò×?ÞçŽ#=¤ª?ÞçŽv‘ÿ?Þç(?Þç(G‚?Þæ rÇ?ÞæÂD†B?Þæ\5š&?Þæ\nÀ´?ÞåöŒŸÌ?Þåö ÅÙl?Þå x2?ÞåIÄä?Þå*ÁH?Þå*ú§Ù?ÞäÄž÷Ò?ÞäÃüØj©?Þä]þ©¬0?Þä]øã2?Þã÷úáYš?Þã÷õò–?Þã‘÷Eèw?Þã‘ñ”†?Þã+ó×qm?Þã+î0Ž?ÞâÅð•õ?ÞâÅêÏÇ5?Þâ_íÑ?Þâ_ç»e?Þáùê™ú8?ÞáùäÓò?Þá“çß•?Þá“â o?Þá-åR,‡?Þá-ߌK?ÞàÇâñÙh?ÞàÇÝ, ö?Þàaྜ-?ÞàaÚøàÍ?ÞßûÞ¸]8?ÞßûØò´ê?Þß•ÜßAB?Þߕ׬?Þß/Û3`ó?Þß/ÕmÞÉ?ÞÞÉÙ´€r?ÞÞÉÓïZ?ÞÞcØbÜž?ÞÞcÒ€—?ÞÝý×>iñ?ÞÝýÑy ý?ÞÝ—ÖGÂ?ÞÝ—ÐÚà?ÞÝ1Õ|é¸?ÞÝ1Ï·Æç?ÞÜËÔàp?ÞÜËÏñ±?ÞÜeÔpLW?ÞÜeΫOª?ÞÛÿÔ-Öü?ÞÛÿÎhía?ÞÛ™Ô¡ë?ÞÛ™ÎSËa?ÞÛ3Ô0­¢?ÞÛ3Îkê*?ÞÚÍÔuî™?ÞÚÍα>3?ÞÚgÔè‰|?ÞÚgÏ#ì'?ÞÚÕˆ~Ö?ÞÚÏÃô“?ÞÙ›ÖU·?ÞٛБ?Ñ?ÞÙ5×P>˜?ÞÙ5Ñ‹Úw?ÞØÏØx.6?ÞØÏÒ³Ý'?ÞØiÙÍn@?ÞØiÔ 0C?ÞØÛP/z?ÞØÕŒŽ?Þ×ÝB$?Þ××<*I?Þ×7ÞݾÝ?Þ×7Ùº?ÞÖÑàè²=?ÞÖÑÛ$À…?ÞÖkã!²?ÞÖkÝ]2 ?ÞÖå†Ú»?ÞÖßÃ%?ÞÕŸèA?ÞÕŸâVˆ‘?ÞÕ9êÛý?ÞÕ9åb‰?ÞÔÓíÉ`)?ÞÔÓèÍÆ?ÞÔmðå2?ÞÔmë!²¯?ÞÔô.Š?ÞÔîkÑ?ÞÓ¡÷¥hÞ?ÞÓ¡ñâ¯?ÞÓ;ûL,ž?ÞÓ;õˆæ€?ÞÒÕÿ"Ùß?ÞÒÕù_¦Ò?ÞÒp'du?ÞÒoýdDy?ÞÒ Y´Î?ÞÒ –§â?ÞѤ ¹§D?ÞѤö­i?ÞÑ>Gx’?ÞÑ> „‘É?ÞÐØ?ÞÐØ@1]?ÞÐrìY\?ÞÐr)˜´?ÞÐ š ?ÞÐ @ìu?ÞϦ$H¯?ÞϦ† ?ÞÏ@)»š_?ÞÏ@#ùé?ÞÎÚ/\[?ÞÎÚ)™æž?ÞÎt5*þ?ÞÎt/hœ¯?ÞÎ;'wÕ?ÞÎ5e)?ÞͨAR3?Þͨ;Éÿ?ÞÍBGªja?ÞÍBAèB>?ÞÌÜN0³ë?ÞÌÜHnžØ?ÞÌvTår?ÞÌvO#p?ÞÌ[Ç>O?ÞÌVO]?Þ˪b×€.?Þ˪]¤L?ÞËDj´n?ÞËDdSë?ÞÊÞqÿ³?ÞÊÞkÀIò?ÞÊxy>W?ÞÊxsZ›¦?ÞÊ€äˆô?ÞÊ{"ùS?ÞɬˆÚì?Þɬƒo~?ÞÉFÿP?ÞÉF‹=æ’?ÞÈà™QÍŽ?ÞÈà“w?ÞÈz¡Ò}?ÞÈzœ9¹?ÞȪG!?ÞȤÀÑ?ÞÇ®³^ ?ÞÇ®­Ï?ÞÇH¼i8Ž?ÞÇH¶¨.^?ÞÆâÅ¢m?ÞÆâ¿áuà?ÞÆ|Ï Éâ?ÞÆ|ÉHåÑ?ÞÆØŸgÕ?ÞÆÒÞ–Ô?ÞÅ°âc/5?ÞÅ°Ü¢qD?ÞÅJìU~?ÞÅJæ”i?ÞÄäöuHN?ÞÄäð´°}?ÞÄÿ?ÞÄ~û:Y?ÞÄ @…f?ÞÄ€´?Þóëƒ?Þó+$û?ÞÃM ÄÞ\?ÞÃM’Ê?ÞÂç+Ìqú?ÞÂç& 9w?ÞÂ7c?ÞÂ1B=¤?ÞÂBf¦ ?ÞÂ<¦“½?ÞÁµMùGœ?ÞÁµH9HH?ÞÁOYºH?ÞÁOSú[À?ÞÀée©›Ï?ÞÀé_éš?ÞÀƒqÇsš?ÞÀƒl­u?ÞÀ~«Â?ÞÀxSø«?Þ¿·ŠŽDÈ?Þ¿·„ΤÀ?Þ¿Q—7W4?Þ¿Q‘wÊ‹G?Þ¼‡ôì/–?Þ¼‡ï-( ?Þ¼" BŒ?Þ¼!ýJN ?Þ»¼UP?Þ»¼ –!à?Þ»VÏZQ?Þ»V‹ð?Þºð.x<?Þºð(¹€®?ÞºŠ=OÀå?ÞºŠ7‘¢?Þº$LUÑn?Þº$F—<:?Þ¹¾[ŒÚ¨?Þ¹¾UÎXƒ?Þ¹XjõÑ?Þ¹Xe6¢»?Þ¸òzŒ+9?Þ¸òtÍÏ1?Þ¸ŒŠRJ?Þ¸Œ„“ºQ?Þ¸&šF²‹?Þ¸&”ˆ|¡?Þ·ÀªjEw?Þ·À¤¬"›?Þ·Zº¼¼†?Þ·Z´þ¬¹?Þ¶ôË>/?Þ¶ôÅ€q?Þ¶ŽÛîLü?Þ¶ŽÖ0cL?Þ¶(ìÍZ?Þ¶(稸?ÞµÂýÛ£Ì?ÞµÂøà9?Þµ]ÆÄ?Þµ] [@?Þ´÷ „м?Þ´÷Ç3F?Þ´‘2Ú1?Þ´‘,bOÉ?Þ´+Céãœ?Þ´+>,lB?Þ³ÅUâÕn?Þ³ÅP%q#?Þ³_h ì.?Þ³_bMšñ?Þ²ùzbN?Þ²ùt¤Æ ?Þ²“Œè*I?Þ²“‡*ÿ(?Þ²-Ÿj—?Þ²-™àR…?ޱDzŲ?ޱǬÄÀ®?Þ±aÅ•0 ?Þ±a¿Ø>?Þ°ûØמ"?Þ°ûÓ¿:?Þ°•ìIXs?Þ°•æŒŒ™?Þ°/ÿê#j?Þ°/ú-jž?ޯʹÿ‚?Þ¯Ê ýYÄ?Þ¯d'¹)8?Þ¯d!ü–ˆ?Þ®þ;ç}?Þ®þ6*ýb?Þ®˜PEX?Þ®˜JˆšÄ?Þ®2dÑȯ?Þ®2_o)?Þ­ÌyÁ{?Þ­ÌsÑ{?Þ­fŽxþ;?Þ­fˆ¼ÊÐ?Þ­£“^?Þ­×_?Þ¬š¸ÝE[?Þ¬š³!8 ?Þ¬4ÎVh¯?Þ¬4Èšnm?Þ«ÎãþÑÊ?Þ«ÎÞBê–?Þ«hùÖi"?Þ«hô”ü?Þ«Ýw.?Þ« !¶?Þª&Øf?Þª X*Z?Þª7?Þ©ÑS¢)?Þ©ÑMS8?Þ©kiÓ¢?Þ©kd¢¿?Þ©€Æî?Þ©{ ŒD?Þ¨Ÿ—ê2?Þ¨Ÿ’.㢬—F?Þ¤>œò?ޣؼ (?ޣضO½ä?Þ£rÕ—\-?Þ£rÏÝ?Þ£ ïT(?Þ£ é™ä?Þ¢§ @Œ??Þ¢§†[;?Þ¢A#\¹ ?Þ¢A¢›?Þ¡Û=¨g?Þ¡Û7î\?Þ¡uX#ê„?Þ¡uRiò¥?Þ¡rÏ?Þ¡m/?Þš±1-3?ÞšKU?ÞšKO^q?Þ™ås&_$?Þ™åmmÑ1?Þ™‘eÇg?Þ™‹­L?Þ™¯ÕWÎ?Þ™ªïó?Þ˜³Îu´?Þ˜³È¼Çä?Þ˜MíDæ¯?Þ˜M猤ì?Þ—è Dþ ?Þ—èŒÏU?Þ—‚+u?F?Þ—‚%½#™?Þ—JÕªÖ?Þ—E¢6?Þ–¶jfY?Þ–¶d®c…?Þ–PŠ'>„?Þ–P„o[û?Þ•êª[’?Þ•ê¤`Œ?Þ•„Ê9à?Þ•„Ä‚$?Þ•ꋵý?Þ•äÔ —?Þ”¹ ¸X?Þ”¹V!þ?Þ”S+Àþ?Þ”S&”¯?Þ“íL¢áT?Þ“íFëq?Þ“‡mµäà?Þ“‡gþ‡¨?Þ“!ŽùG?Þ“!‰AüÚ?Þ’»°m.?Þ’»ªµÑ ?Þ’UÒ4Â?Þ’UÌZ¬?Þ‘ïóåÁ6?Þ‘ïî.°,?Þ‘ŠêÑæ?Þ‘Š3Óç?Þ‘$8 CR?Þ‘$2iX^?Þ¾Z†-ß?Þ¾TÏU÷?ÞX}…ü?ÞXweÁ?ÞòŸãX?Þòš,¦C?ÞŒÂÚ¤•?ÞŒ½$Î?Þ&æƒÜ?Þ&àKø ?ÞŽÁ ZÞi?ÞŽÁ¤e¹?ÞŽ[,ãÀš?ÞŽ['-Zô?ÞõP6Ü?ÞõJæäA?Þt‡A˜?ÞnÑ ?Þ)˜¡ÕF?Þ)’ë¨Á?ތüí8?ތ÷6ü¾?ÞŒ]áhìì?ÞŒ]Û²æ}?Þ‹øYÍ?Þ‹ø_fi?Þ‹’*ò0?Þ‹’%< Ö?Þ‹,P3¨?Þ‹,JJfY?ÞŠÆu>•€?ÞŠÆoˆÛ͹û?Þz9X?Þy«lP>?Þy«f¶€?ÞyEš â?ÞyE”Q¬Q?ÞxßÇé’‚?ÞxßÂ70û?Þxyö‡j?ÞxyðN8ì?Þx$Hè&?Þx–¬±?Þw®RÂÌþ?Þw®M¤‘?ÞwHnN8?ÞwH{¼8Ô?Þvâ°KHj?Þv⪙F?Þv|ßYÓÛ?Þv|Ù§ä‰?Þv™üè?Þvè Ÿ?Þu±> Ãò?Þu±8Yú±?ÞuKm¯o?ÞuKgýg7?Þtå„-–?Þtå—ÒŠg?ÞtÍŠ¹&?ÞtÇÙ)?ÞtýÂð9?Þtøs?Þs´.,Ó;?Þs´({i&?ÞsN^Èb?ÞsNY „?Þr蕶~?Þrè‰ärz?Þr‚À”·?Þr‚ºã†’?ÞrñÅf ?ÞrìH-?Þq·#'Î?Þq·vã?ÞqQT¼ ?ÞqQO 5?Þpë†òY?Þpë€Ñ €?Þp…¸y¢”?Þp…²ÈÐÃ?Þpê£2?Þpäòs??Þoºþ•-?ÞoºMél?ÞoTO‹´Œ?ÞoTIÛÔ?Þnî‚JÌ/?Þnî|šF?Þnˆµ;¬¿?Þnˆ¯‹:?Þn"è^b˜?Þn"â®ø?Þm½³ò?Þm½¹Z?ÞmWO;çq?ÞmWI‹­á?Þlñ‚ù1©?Þlñ}I !?Þl‹¶è„H?Þl‹±8pÈ?Þl%ë ÷ƒ?Þl%åY÷ ?ÞkÀ]Ø?ÞkÀ­’h?ÞkZSã¬?ÞkZN3CD?ÞjôˆšÝM?Þjô‚ëì?ÞjŽ½„¿ ?ÞjŽ·Õ Ç?Þj(ò ó=?Þj(ìñQë?ÞiÃ'ï2~?ÞiÃ"?¤4?Þi]]o¡ ?Þi]WÀ%É?Þh÷“"?E?Þh÷r× ?Þh‘É}?Þh‘ÃWÄJ?Þh+ÿ0?Þh+ùníí?ÞgÆ5gƒ}?ÞgÆ/¸TZ?Þg`kã?Þg`f3÷é?Þfú¢‘à?ÞfúœáüÌ?Þf”Ùq5ª?Þf”ÓÂ??Þf/ƒ»š?Þf/ ÔØ”?ÞeÉGÈtV?ÞeÉB¤W?Þec?§À?ÞecyêÉ?Þdý¶é&“?Þdý±:|£?Þd—îÅ ?Þd—ér?Þd2&ÓgH?Þd2!$ãg?ÞcÌ_/?ÞcÌYe•U?Þcf—‡Æ?Þcf‘Ø·ó?ÞcÐ,~œ?ÞcÊ~3Ï?Þb› p²?Þb›V8í?Þb5BÔŸ?Þb5<`¯á?ÞaÏ{K¶«?ÞaÏu¤ô?Þai´ºó~?Þai¯ ôÎ?Þaî\Ç?Þaè®Û\?Þ`ž(1 è?Þ`ž"ƒ5E?Þ`8b7ì@?Þ`8\Š&¤?Þ_Òœqbo?Þ_ҖïÚ?Þ_lÖÝY?Þ_lÑ/¹y?Þ_{Ðf?Þ_ ÎCß?Þ^¡LLà¼?Þ^¡FŸg;?Þ^;‡PŠp?Þ^;£#ö?Þ]Õ†ÍÞ?Þ]Õ¼Ùzj?Þ]oýï·T?Þ]oøBvç?Þ] 9‹S?Þ] 3Þ%¨?Þ\¤uY¡{?Þ\¤o¬‡?Þ\>±Z‹?Þ\>«­ƒÂ?Þ[ØíŽ(,?Þ[Øçá3Ù?Þ[s)ôm?Þ[s$G‹Ð?Þ[ f~?Þ[ `à¯Ç?ÞZ§£YC?ÞZ§¬ˆA?ÞZAàW±ø?ÞZAÚ« ¾?ÞY܈íˆ?ÞYÜÜXU?ÞYvZìöŽ?ÞYvU@t`?ÞY˜ƒÍf?ÞY’×^??ÞXªÖMfŒ?ÞXªÐ¡ k?ÞXEIÎF?ÞXE…*?ÞWßRyÒ?ÞWßLÌÚ½?ÞWyÛ"²?ÞWy‹.ÿ£?ÞWÏp'ï?ÞWÉÄæ?ÞV®7ñV?ÞV®‹ôR?ÞVHM2º¼?ÞVHG†Ð¿?ÞUâŒ`xš?ÞU↴¡£?ÞU|ËÀû½?ÞU|Æ7Ë?ÞU Tù?ÞU¨Ï ?ÞT±Káü?ÞT±EoD?ÞTK‹Q½?ÞTK…hÆÜ?ÞSåËC G?ÞSåÅ—’l?ÞS€ §No?ÞS€ûéš?ÞSL>£‚?ÞSF“Q²?ÞR´ -Ž?ÞR´‡]îÄ?ÞRNÎøÔ?ÞRNÈ[Í?ÞQé7â?ÞQé ŒÉB?ÞQƒPœ ?ÞQƒJñS?ÞQ’3’g?ÞQŒˆŸ³?ÞP·Óþ6ª?ÞP·ÎSVû?ÞPRü?ÞPRQEn?ÞOìX-Hµ?ÞOìR‚?ÞO†š‘Îþ?ÞO†”ç(_?ÞO Ý)¥?ÞO ×~î ?ÞN»ô¨[?ÞN»J'Æ?ÞNUbòü)?ÞNU]HŽš?ÞMï¦$¸Ü?ÞMï z^Q?ÞM‰é‰Òì?ÞM‰ãß‹g?ÞM$-"J·?ÞM$'x7?ÞL¾pî,x?ÞL¾kD ý?ÞLX´í„t?ÞLX¯Cuþ?ÞKòù ;;?ÞKòóv?É?ÞK=†hù?ÞK7Ü€?ÞK'‚ ?ÞK'|v,®?ÞJÁÆíù?ÞJÁÁCD–?ÞJ\ íwý?ÞJ\CÈŸ?ÞIöQ!y'?ÞIöKwÜÎ?ÞI–ˆþã?ÞIßu?ÞI*Ü$|?ÞI*ÖzŸ,?ÞHÅ!ò±e?ÞHÅIN?ÞH_gôÇ?ÞH_bKvÏ?ÞGù®*n®?ÞGù¨1l?ÞG“ô“ÀM?ÞG“îê–?ÞG.;0ŒÂ?ÞG.5‡u‰?ÞFÈ‚ø?ÞFÈ|Wóâ?ÞFbÉs?ÞFbÃ\C?ÞEý<¸„?ÞEý “ÚX?ÞE—W¨8?ÞE—QÿO?ÞE1ŸG0?ÞE1™žd ?ÞDËçÊ ?ÞDËáq%?ÞDf/ 1Å?ÞDf)wŸª?ÞDwZ]Ö?ÞDq±Þ¿?ÞCš¿È+?ÞCšº¿|?ÞC5iÊÊ?ÞC5Áq¼?ÞBÏQ?Ö4µžï?Þ>Ö/ ?Þ>pÅ+&?Þ>pz¶F?Þ> Ë¥?Þ> ÅaC:?Þ=¥€ ?Þ=¥ؾ;?Þ=?b+{:?Þ=?\„?d?Þ<Ù® ãþ?Þ<Ù¨c»+?Þ?Þ5³&Í“ã?Þ5³!'ÁH?Þ5Mv‘·?Þ5Mpë÷è?Þ4çÆŠUs?Þ4çÀä¨Þ?Þ4‚·b:?Þ4‚Ȩ?Þ4gÞ$?Þ4asW”?Þ3¶·®Õe?Þ3¶² aØ?Þ3Qy0ž?Þ3QÓÐ?Þ2ëYwûû?Þ2ëSÒ®s?Þ2…ª«gB?Þ2…¥,¼?Þ2ü[?Þ2ön3Œ?Þ1ºM¯ËÚ?Þ1ºH ·Y?Þ1TŸ€¹þ?Þ1T™Û¸€?Þ0îñ†=?Þ0îëáO?Þ0‰CÀV·?Þ0‰>{>?Þ0#–/ö?Þ0#Š=?Þ/½èÒ?´?Þ/½ã-Š??Þ/X;ª"?Þ/X6m¯?Þ.òŽ¶O?Þ.ò‰ÿÞ?Þ.Œá÷½?Þ.ŒÜSA?Þ.'5m:?Þ.'/É%Í?Þ-Á‰¦?Þ-Áƒsº;?Þ-[Ü÷B?Þ-[×Rþ±?Þ,ö1 #ç?Þ,ö+fó€?Þ,…SÂ=?Þ,¯¤Ø?Þ,*ÙÑ?Þ,*Ô--?Þ+Å.ƒ)ê?Þ+Å(ß2‰?Þ+_ƒj ™?Þ+_}Æ'9?Þ*ùØ…«?Þ*ùÒáÙÀ?Þ*”-Õüð?Þ*”(2>”?Þ*.ƒ[$æ?Þ*.}·y‹?Þ)ÈÙ/1?Þ)ÈÓq–Ù?Þ)c/øš?Þ)c)`sC?Þ(ý…'™'?Þ(ý„&Ò?Þ(—Û€(Î?Þ(—ÕÜÉz?Þ(22 =?Þ(2,jCê?Þ'̈ÏϽ?Þ'̃,–l?Þ'fßÇ ,?Þ'fÚ#äÜ?Þ'6óV?Þ'1P ?Þ&›ŽT;æ?Þ&›ˆ±;™?Þ&5åê1Ñ?Þ&5àGD†?Þ%Ð=µ$ï?Þ%Ð8J¥?Þ%j•µ’?Þ%jNI?Þ%íêÞ?Þ%èG[–?Þ$ŸFSüy?Þ$Ÿ@±[2?Þ$9žòçŒ?Þ$9™PYF?Þ#Ó÷Æé?Þ#Óò$mÏ?Þ#nPÏÝÛ?Þ#nK-u—?Þ#ª õ‹?Þ#¤k H?Þ"£Íb?Þcå T?Þ þO™á?Þ þIûzÁ?Þ ˜´*ÿj?Þ ˜®Œ¬"?Þ 3ò?Þ 3SÜ»?Þ Í}ïQÄ?Þ ÍxQ$y?Þ gã"†N?Þ gÝ„l?Þ H‹ÒŽ?Þ BíËA?Þ œ®+4?Þ œ¨*æ?Þ 7xU?Þ 7b—?Þ Ñz x?Þ Ñtn?'?Þ kàM£à?Þ kÚ¯èŽ?Þ FÅk ?Þ A'µ?Þ  ­sWu?Þ  §ÕÂ?Þ ;W]Ÿ?Þ ;¹ÛH?ÞÕ{q­?ÞÕuÔ=¯?Þoâ»?ÞoÝ$º`?Þ JH› ?Þ D«Q¯?Þ¤²µ÷?Þ¤¬j™?Þ?ÿ«Y?Þ?b‡ù?ÞÙ‚-ùõ?ÞÙ|é“?Þsê’¹¶?Þsäõ¼S?ÞS-ö­?ÞM‘ H?Þ¨»ÿÈ?Þ¨¶b¶a?ÞC%¢«?ÞCjÞB?ÞÝŽF)Ø?Þ݈©xm?Þw÷»/g?Þwòú?Þaf¿i?Þ[Ê3ú?Þ¬ËHÂ’?ެŬJ!?ÞG5aDö?ÞG/Äß‚?Þ៰R¬?Þáš6?Þ| 5ëú?Þ|™¬‚?Þtòñ?ÞoUðw?Þ°ßäÚ?Þ°ÚHÀ˜?ÞKK;A?ÞKEr4Â?Þå¶n@¿?Þå°ÒM>?Þ€"ß ?Þ€hþ†?ÞÒ"4?Þˆ6T®?Ýÿ´ùÕòø?Ýÿ´ô:8o?ÝÿOftô?ÝÿO`tÍh?ÝþéÒ´@?ÝþéÌæ²?Ýþ„?)¥T?Ýþ„9Ž#Ã?Ýþ¬H€?Ýþ¦lÙí?Ýý¹µ”?Ýý¹‚Yþ?ÝýS†i½¸?ÝýS€Îu?Ýüíóì„?ÝüíîQNô?Ýüˆa¦-»?Ýüˆ\ ?Ýü"Ï–Š^?Ýü"Éûz½?Ýû½=½¾ ?Ýû½8"Á{?ÝûW¬½v?ÝûW¦€ÓÏ?Ýúò°ˆª?Ýúò²?ÝúŒ‰|C]?ÝúŒƒá°?Ýú&ø~íØ?Ýú&òä=(?ÝùÁg¸Y9?ÝùÁb»…?Ýù[×(´é?Ýù[ÑŽ*3?ÝøöFÏé¦?ÝøöA5qì?Ýø¶­ëâ?Ýø±‡%?Ýø+&Âë ?Ýø+!(™K?Ý÷Å—þö?Ý÷Å‘tÀ3?Ý÷`‘ìü?Ý÷`÷Á5?ÝöúxKؾ?Ýöúr±¿ô?Ýö”é<ÎF?Ýö”ã¢Èx?Ýö/Zd¶N?Ýö/TÊÃ}?ÝõÉËè¨?ÝõÉÆ)ÈÓ?Ýõd=Y™Ó?Ýõd7¿Ìú?Ýôþ¯&•Ö?Ýôþ©ŒÛú?Ýô™!*œû?Ýô™ö?Ýô3“e»L?Ýô3Ì'i?ÝóÎ×åG?ÝóÎ>d_?Ýóhx>~?ÝóhrçГ?Ýóëa£í?ÝóåÈHþ?Ýò^y!š?ÝòXßÙ¨?Ýò7ÑÇÏP?Ýò7Ì.šY?ÝñÒEM­Y?ÝñÒ?´‹^?Ýñl¹ ¤j?Ýñl³q•l?Ýñ,þãâ?Ýñ'eçß?Ýð¡¡*H®?Ýð¡›‘_¨?Ýð<Œêœ?Ýð<ô‘?ÝïÖŠ&Éö?ÝïÖ„Žç?Ýïpþ÷æø?Ýïpù_6å?Ýï t6'?Ýï ng™?Ýî¥é?ÏL?Ýî¥ã§E1?Ýî@^¹]?Ýî@Y ¡=?ÝíÚÔl27?ÝíÚÎÓÎ?ÝíuJVÔ¥?ÝíuD¾ƒ}?ÝíÀxô'?Ýíºàµú?Ýìª6Òyv?Ýìª1:ND?ÝìD­c“è?ÝìD§Ë{²?Ýëß$,CÀ?Ýëß”>†?Ýëy›,eô?Ýëy•”sµ?Ýëd?Ýë Ì>Ñ?ÝꮉÓx%?Ýꮄ;«Ý?ÝêIz\å?ÝêHû⣘?ÝéãyXØZ?ÝéãsÁ2 ?Ýé}ñoH?Ýé}ë×nñ?Ýéi¼·­?Ýéd%7Q?Ýè²âBS?Ýè²Üª¢ó?ÝèMZÿ??ÝèMUg½Ú?ÝççÓóϪ?ÝççÎ\ˆ@?Ýç‚M +?Ýç‚Gˆö®?ÝçÆ„B\?ÝçÀí è?Ýæ·@ è?Ýæ·:ˆûo?ÝæQ¹óþ?ÝæQ´\†?Ýåì3þÎ2?Ýåì.gå®?Ý冮AËl?Ý冨ªõä?Ýå!(¼‘ƒ?Ýå!#%Îõ?Ý代o,n?Ýä»Ø|Û?ÝäVY„ò?ÝäVÂèY?Ýãð™{¾’?Ýãð“å4ô?Ýã‹Õ¶H?Ýã‹??¥?Ýã%g›\?Ýã%ŠÑ7³?ÝâÀ 1V?ÝâÀ›ß?ÝâZˆ2óà?ÝâZ‚œ¶,?ÝáõlsŒ?ÝáôþÖHÓ?Ýá€ÝÊ?Ýá{G²Y?Ýá)ý‡?Ýá)÷ñA?ÝàÄzhCP?ÝàÄtÒQ†?Ýà^÷f{?Ýà^ñ뇫?ÝßùtÒ„Ã?Ýßùo<¸î?Ýß“ò[žm?Ýß“ìÅå’?Ýß.p³²?Ýß.j‡ Ñ?ÝÞÈîÜW?ÝÞÈè€Ip?ÝÞclFõX?ÝÞcf±uk?ÝÝýê°"6?ÝÝýåµB?ÝݘiQWl?Ýݘc»ýs?ÝÝ2è*•>?ÝÝ2â•N??ÝÜÍg;ç¨?ÝÜÍa¦³£?ÝÜgæ…Nç?ÝÜgàð-Ü?ÝÜfÖü?ÝÜ`qÈê?ÝÛœåÀ€"?ÝÛœà+… ?ÝÛ7e²>Þ?ÝÛ7`VÀ?ÝÚÑåÜ6¢?ÝÚÑàGa}?ÝÚlf>Dw?ÝÚl`©‚M?ÝÚæØ—‘?ÝÚáCè`?ÝÙ¡g«´?ÝÙ¡b|}?ÝÙ;èµÓØ?ÝÙ;ã!Jš?ÝØÖiø±Â?ÝØÖdd;~?ÝØpësÊ*?ÝØpåßfß?ÝØ m'4Ê?ÝØ g’äx?Ý×¥ïæ"?Ý×¥é~¨Ê?Ý×@q6Æï?Ý×@k¢œ?ÝÖÚó’ú­?ÝÖÚíþãG?ÝÖuv'•?ÝÖup“}(?ÝÖøôP(?ÝÖó`^µ?ÝÕª{ù~?ÝÕªveŸ¡?ÝÕDÿ6ÿï?ÝÕDù£4n?ÝÔß‚¯1M?ÝÔß}xÅ?ÝÔzbbh?ÝÔzμÙ?ÝÔŠN??ÝÔ„º‡©?ÝÓ¯rdÇ?ÝÓ¯Þå+?ÝÓI’ÏMþ?ÝÓI;á[?ÝÒäd¾¨?ÝÒäÑdþ?ÝÒ~œ2¼?ÝÒ~–Ÿ| ?ÝÒ!9}°?ÝÒ¦I÷?Ýѳ¦xØA?Ýѳ å·€?ÝÑN+ðÆô?ÝÑN&]¹,?ÝÐ象a|?ÝÐè¬f¬?ÝЃ7Š¨?ÝЃ1÷À=?Ýн¬¦¶?ÝиÑØ?ÝϸD]Ÿ?Ýϸ>t›¹?ÝÏRÊšµ‘?ÝÏRŤ?ÝÎíQfÑþ?ÝÎíKÔ6 ?Ý·Øk§`?Ý·ÒÙd?ÝÎ"_©A°?ÝÎ"Zˬ?Ýͼç¡-?Ýͼá>"?ÝÍWnÎÆ?ÝÍWi”%?ÝÊ+´F[þ?ÝÊ+®´£¬?ÝÉÆ=õC1?ÝÉÆ8c×?ÝÉ`ÇÝ,·?ÝÉ`ÂKšU?ÝÈûQýõž?ÝÈûLlv4?ÝÈ•ÜWµ?ÝÈ•ÖÆI?ÝÈ0fêlË?ÝÈ0aYQ?ÝÇÊñ¶€?ÝÇÊì$Ôü?ÝÇe|ºÙf?ÝÇew)¥Ú?ÝÇø=?ÝÇgn©?ÝÆš“oT´?ÝÆšÞG?ÝÆ5*?ÝÆ5Ž/\?ÝÅÏ«¢?ÝÅÏ¥wõ?ÝÅj7)í?ÝÅj1™Ú?ÝÅÄÿl?ÝŽô=­?ÝÄŸP"?ÝÄŸJˆs>?ÝÄ9ÜæaJ?ÝÄ9×UÅ{?ÝÃÔiìÔá?ÝÃÔd\L ?ÝÃn÷,e’?ÝÃnñ›ï±?Ýà „¥œ?Ýà °²?ݤVöž?ݤ Ʀ«?ÝÂ> BÔ?ÝÂ>š±ÑÙ?ÝÁÙ.fP½?ÝÁÙ(Ö&¸?ÝÁs¼ÃÈH?ÝÁs·3±:?ÝÁKZ?ÝÁEʉ?ÝÀ¨Ú*Ÿp?ÝÀ¨Ôš®Q?ÝÀCi3è?ÝÀCc¤ å?Ý¿Ýøvrã?Ý¿Ýò槱?Ý¿x‡ò@%?Ý¿x‚b‡ê?Ý¿§s3?Ý¿Íï?ݾ­§•é?ݾ­¢VÌ?ݾH7½¹?ݾH2.:*?ݽâÈÍ3?ݽâÂ`Ó?ݽ}X¹S>?ݽ}S)ùÕ?ݽé@#?ݽãýù°?ݼ²zš”?ݼ²u `š?ݼM á[?ݼMR:?Ý»ça}¹?Ý»ç—Òp*?Ý»‚/|F?Ý»‚)Ž­?Ý»ÁxT?Ý»»†²?ݺ·SF÷L?ݺ·M¸" ?ݺQå²3ç?ݺQà#r1?ݹìxW D?ݹìrÈ\…?ݹ‡ 5‰Q?ݹ‡¦í‡?ݹ!žM¹ð?ݹ!˜¿1?ݸ¼1Ÿ©?ݸ¼,37?ݸVÅ+?ƒ?ݸV¿œÜœ?Ý·ñXð”â?Ý·ñSbDñ?Ý·‹ìï©`?Ý·‹çalf?Ý·&(eÕ?Ý·&{š;Ð?ݶÁšù@?ݶÁ â1?ݶ[ªGLi?ݶ[¤¹HP?ݵö?-_–?ݵö9Ÿns?ݵÔMJS?ݵοl&?ݵ+i¦õ{?ݵ+d*C?Ý´Åÿ:„X?Ý´Åù¬Ì?Ý´`•÷?Ý´`zQÎ?ݳû+BJ?ݳû%¯ó?ݳ•ÁPf?ݳ•»Âæº?ݳ0WËnr?ݳ0R>?ݲÊî€rê?ݲÊèót?ݲe…oDð?ݲeáþo?ݲ˜3?ݲ ë¨?ݱš³úÇk?ݱš®m¦Õ?ݱ5K—xG?ݱ5F j§?Ý°Ïãn”?Ý°ÏÝáè?Ý°j{~Åó?Ý°juñÞ=?Ý°Éz‘?Ý°<¥Ð?ݯŸ¬NŽ?ݯŸ¦ÁSÂ?ݯ:E èô?ݯ:?€:?Ý®ÔÞ—p?Ý®ÔØxûŽ?Ý®ow8g^?Ý®oq«Þq?Ý® ¥d?Ý® î¥?Ý­¤ªL`¤?Ý­¤¤¿ý¡?Ý­?D-~²?Ý­?>¡.¤?ݬÙÞH¾ú?ݬÙؼá?ݬtxž!³?ݬts÷?ݬ-›Z?ݬ ¡„*?Ý«©­÷O3?Ý«©¨kJù?Ý«DHûg?Ý«DCo)!?ݪÞä9+ã?ݪÞÞ­M’?ݪy±lt?ݪyz%¡?ݪcè?ݪØ/ ?Ý©®·P¶(?Ý©®±Å´?Ý©ISw³ô?Ý©IMì!t?ݨãïØá©?ݨãêMb?ݨ~Œtb€?ݨ~†èõé?ݨ)J*ø?ݨ#¾ÑV?ݧ³ÆZ;F?ݧ³ÀÎô˜?ݧNc¤¶ª?ݧN^‚ð?ݦé)…ò?ݦèûže-?ݦƒžè©V?ݦƒ™]›…?ݦ<â,­?ݦ7W1Ð?Ý¥¸Û0?Ý¥¸Õ‹(G?Ý¥Sy„<®?Ý¥Ssùg¹?ݤî,ìÀ?ݤî¢*¿?ݤˆ· 8?ݤˆ±…Z+?ݤ#V-’L?ݤ#P¢ö3?Ý£½õ…ˆ%?Ý£½ïúÿ?Ý£X•?Ý£X—Ï?Ý¢ó4äõW?Ý¢ó/Z’?Ý¢ÔìU³?Ý¢Ïbi?Ý¢(u0¤?Ý¢(o¦g7?ݡò—?Ý¡Ã'å4?Ý¡]¶n2'?Ý¡]°ä¸?Ý øWeÂ?Ý øQÚüG?Ý ’ø–{?Ý ’ó Š?Ý -š®z?Ý -”xÏæ?ÝŸÈ;©±?ÝŸÈ6å`?ÝŸbÝ‹w²?ÝŸbØ¿?Ýžý§÷?ÝžýzQN?Ýž˜!ÿR5?Ýž˜u¿o?Ýž2Ä‘r ?Ýž2¿òM?ÝÍg^n=?ÝÍaÕ]?Ýh f/s?ÝhÜÕ†?Ý­¨ÍA?ݨ†G?ÝœQ&SŠ?ÝœKƒ?Ýœ7ôÞŸn?Ýœ7ïU~Z?ݛҘÑë‚?ݛғHÝb?Ý›m= –?Ý›m7w%h?Ý›ái>Þ?Ý›ÛàV£?Ýš¢† :Ù?Ýš¢€„e‘?Ýš=*ì7º?Ýš=%cue?Ý™×ÐW?Ý™×Ê}nõ?Ý™ru[7?Ý™roÒiÈ?Ý™ êï‰?Ý™ bf ?ݘ§Àµæ"?ݘ§»-o˜?ݘBf»Ç6?ݘBa3cŸ?Ý—Ý üÁ?Ý—Ýtpë?Ý—w³x¾?Ý—w­ð€f?Ý—Z/ÔH?Ý—T§©ˆ?Ý–­!ø¦?Ý–¬û™àØ?Ý–G¨O+`?Ý–G¢Ç&…?Ý•âO·ƒö?Ý•âJ/’?Ý•|÷Zöì?Ý•|ñÓö?Ý•Ÿ9?Ý•™±Ä?Ý”²GSO ?Ý”²AË–Ž?Ý”Lï¨5¼?Ý”Lê œ?Ý“ç˜8N??Ý“ç’°»?Ý“‚A™R?Ý“‚;|?Ý“ê $?Ý“ä‚©Ú?Ý’·“Kß0?Ý’·Ä„Ù?Ý’R<ÈÃ?Ý’R7A{¡?Ý‘ìæ€ño?Ý‘ìàù¼ü?Ý‘‡tj–?Ý‘‡ŠíI?Ý‘":£#?Ý‘"5s?ݼå &†?ݼ߆*è?ÝW²€ö?ÝWŠ+˜J?Ýò:“0?Ýò5 Ev?ÝŒå¯ ©?ÝŒà(Ià?Ý'‘x‡?Ý'‹È°?ÝŽÂ<™?ÝŽÂ7|"?ÝŽ\èg(š?ÝŽ\âàž¦?Ý÷”p³?Ý÷Žê<?Ý’@µ¡L?Ý’;/=;?Ý,í5çË?Ý,篖«?݌ǙñµT?݌ǔkw&?ÝŒbFèÛw?ÝŒbAb°;?Ý‹üôˆü?Ý‹üî•p±?Ý‹—¡‰²a?Ý‹—œ­?Ý‹2O3c{?Ý‹2I­q?ÝŠÌýÌ?ÝŠÌ÷’±U?ÝŠg«9F$?ÝŠg¥³yž?ÝŠY•x ?ÝŠT¾t?݉-=í?݉§—H?݉7·£¢?݉7±{î?݈ÒfåS?݈Ò`Œd?݈ma_ ?݈mÛñÎ?݈Ä쬉?݈¿gQ¨?݇¢t³´ë?݇¢o.lú?݇=$¶„˜?݇=1O˜?݆×Ôõ¼?݆×Ïoù­?݆r…o†"?݆rêw?݆ 6%Ï›?݆ 0 Óm?Ý…§çì«?Ý…§á“n?Ý…B˜EÑØ?Ý…B’ÀûŒ?Ý„ÝI¯¢:?Ý„ÝD*ÞÞ?Ý„wûU]ü?Ý„wõЭ‘?Ý„­6íú?Ý„§²P?݃­_T€ñ?݃­YÏöf?݃H­ÿ¿?݃H )ˆ$?Ý‚âÄCj–?݂⾿ì?Ý‚}wÍ4?Ý‚}q{z?Ý‚*",?Ý‚$Ýb?ݲÝknè?ݲ×çC?ÝMð¹î?ÝM‹l¡?Ý€èD²ª?Ý€è?.±?Ý€‚ø¯K?Ý€‚ó+ŒA?Ý€¬èîN?Ý€§e4?ݸa^„È?ݸ[Ú·ž?ÝSW?ÝSŒZ?Ý~íÊý´d?Ý~íÅz ?Ý~ˆ€'pÀ?Ý~ˆz£Üg?Ý~#5I?Ý~#0 È%?Ý}½ë/V:?Ý}½å«ç¿?Ý}X¡ ‹N?Ý}X›Š/Ã?Ý|óW'ÝH?Ý|óQ¤”­?Ý|Ž ~c–?Ý|Žû-ë?Ý|(Ä`?Ý|(¾û¤?Ý{Ãzà.?Ý{Ãu\òa?Ý{^1ë&d?Ý{^,h)‡?Ýzøé2‹.?Ýzø㯡A?Ýz“ ¶% ?Ýz“›3N ?Ýz.XuÿÅ?Ýz.Ró;¶?ÝyÉr'(?ÝyÉ ïv?ÝycȪ„?ÝycÃ'åè?Ýxþ9•?Ýxþ{œ®S?Ýx™9ÐGÑ?Ýx™4MÏ?Ýx3ò½®è?Ýx3í;I…?ÝwΫçz¢?ÝwΦe(.?ÝwieM“è?Ýwi_ËTc?Ýwð¼?Ýwmñ&?ÝvžØÎõh?ÝvžÓLÛÁ?Ýv9’êIŒ?Ýv9hBÓ?ÝuÔMB?ÝuÔGÀI?ÝuoÖ" ?ÝuoTAE?Ýu ¦²s?Ýu ½$ä‡?Ýt¤}³¨’?Ýt¤x1í”?Ýt?8ý'ˆ?Ýt?3{y?ÝsÙôƒ/r?ÝsÙïšR?Ýst°E©9?ÝstªÄ'?ÝslD¬A?ÝsfÃ<þ?Ýrª(€8¬?Ýrª"þÜX?ÝrDäøNž?ÝrDßw8?Ýqß¡­u?Ýqßœ+Îþ?Ýqz^žQº?ÝqzY.0?ÝqÌ3”?ÝqK"ù?Ýp¯Ù6«!?Ýp¯Óµ­u?ÝpJ–ݸ‰?ÝpJ‘\ÍÊ?ÝoåTÁs'?ÝoåO@›W?Ýo€ä#À?Ýo€ c^Ý?ÝoÑF'%?ÝoËÅu1?Ýnµäþç?ÝnµŠd_á?ÝnPNÀ«'?ÝnPI@?Ýmë Ù7­?ÝmëX¾ƒ?Ým…Í.™?Ým…Ç®2Å?Ým ŒÀò?Ým ‡@žÈ?Ýl»L =?Ýl»GßÝ?ÝlV œ:Ú?ÝlV g?ÝkðÌåB?ÝkðÇe'‚?Ýk‹kM#?Ýk‹‡ëE‹?Ýk&N.E?Ýk&H®Ps?ÝjÁ.AM?ÝjÁ ®_?Ýj[Ðk*Ÿ?Ýj[Êë[Ð?Ýiö‘åq?ÝiöŒe\?Ýi‘S›ÿD?Ýi‘NVP?Ýi,?Ýi,l ?ÝhÆ×Àþ,?ÝhÆÒA{?Ýhaš/ è?Ýha”¯š¼?Ýgü\Ú4 ?ÝgüWZÖÎ?Ýg—Ây±?Ýg—C/_?Ýg1âç¹4?Ýg1ÝhÐ?Ýf̦JCã?ÝfÌ Ël?ÝfgiéÔJ?ÝfgdjÂÀ?Ýf-ÆZ?Ýf(GŽ½?ÝeœñàzÎ?Ýeœìa?Ýe7¶7…–?Ýe7°¸¬Ó?ÝdÒzËÜ:?ÝdÒuMe?Ýdm?\ ?Ýdm:©"?Ýd¬.?Ýdÿ-e1?Ýc¢É÷îø?Ýc¢Äyaé?Ýc= ï?Ýc=Š“Ì?ÝbØUG…?ÝbØOÉÎ?ÝbsK1†?ÝbsÌÝ=?Ýb áŒ8?Ýb Ü ÝÛ?Ýa¨¨ YÊ?Ýa¨¢Œ+Z?ÝaCnÅád?ÝaCiGÅà?Ý`Þ5¾ÍV?Ý`Þ0@Ä¿?Ý`xüôúõ?Ý`x÷wJ?Ý`Äh.?Ý`¾êªo?Ý_®Œ¸?Ý_®†›¿æ?Ý_ITßì?Ý_INŠ#?Ý^ä3¬F?Ý^ä¶L?Ý^~äœéR?Ý^~ßRE?Ý^­Cú?Ý^§ÅûÙ?Ý]´v'‡œ?Ý]´pªg?Ý]O?Ix?Ý]O9˹/?Ý\ê¨ í?Ý\ê*Á?Ý\„ÒD–t?Ý\„ÌÇ^?Ý\œ‘l?Ý\–¡kç?Ý[ºf5ýð?Ý[º`¸ëW?Ý[U0‹ ~?Ý[U+ Ð?ÝZïû«œ?ÝZïõ ¾Û?ÝZŠÅíÊ:?ÝZŠÀpðd?ÝZ%û}¨?ÝZ%‹~¶½?ÝYÀ\FÑ–?ÝYÀVʘ?ÝY['ÏÆ(?ÝY["S%?ÝXõó–[x?ÝXõîÍP?ÝX¿šzw?ÝXºÿ;?ÝX+‹ÜF ?ÝX+†_Ý»?ÝWÆX[²¶?ÝWÆRß]Q?ÝWa%×Ä?ÝWaœ•J?ÝVûò©¾?ÝVûì—z/?ÝV–¿L-?ÝV–¹ÐŠ?ÝV1ŒÄÁ?ÝV1‡H·]?ÝUÌZ}Ä(?ÝUÌUÍ[?ÝUg(t¦ü?ÝUg"øÃ?ÝUö©€Ú?ÝUñ-¯ã?ÝTœÅ/ ?ÝTœ¿ q?ÝT7“ÌàD?ÝT7ŽQ5$?ÝSÒb»}4?ÝSÒ]?äÿ?ÝSm1è?ÝSm,l€È?ÝSR’)?ÝSû×É?ÝR¢Ðû-%?ÝR¢Ëͱ?ÝR= á´i?ÝR=›fgß?ÝQØqVd?ÝQØk‹Å?ÝQsAhü ?ÝQs;íÕX?ÝQ ¥|?ÝQ Ž‘²?ÝP¨âèiü?ÝP¨Ými?ÝPC´U=?ÝPC®ŠgI?ÝOÞ…`-u?ÝOÞåRk?ÝOyVùCÐ?ÝOyQ~{±?ÝO(Ðu¬?ÝO#UÀw?ÝN®úåι?ÝN®õk,n?ÝNIÍ9O?ÝNIǾ¿º?ÝMäŸËz?ÝMäšP†?ÝMršÑÌ?ÝMm h@?ÝME¨ÔW?ÝM@.}µ?ÝLµõÆ?ÝLµzÒ?ÝLO슨?ÝLOçYÛ?ÝKêÀHJ8?ÝKêºÎ,U?ÝK…”OI?ÝK…ŽÕ> ?ÝK h”‡$?ÝK c?ÝJ»=¸?ÝJ»7ž“?ÝJVÙäŒ?ÝJV `Q?ÝIðæÚ›?ÝIðá`PJ?ÝI‹¼zl?ÝI‹¶žÎ?ÝI&‘•Se?ÝI&Œ¹ç?ÝHÁgPƒz?ÝHÁaÖüæ?ÝH\=J Å?ÝH\7З?ÝG÷‚†?ÝG÷ŸÅ?ÝG‘éø6’?ÝG‘ä~è»?ÝG,À¬æÞ?ÝG,»3«ð?ÝFÇ—  ?ÝFÇ’&õ?ÝFbnѪø?ÝFbiX•Ý?ÝEýFA¾ý?ÝEý@ȼË?ÝE˜ðB?ÝE˜wRÑ?ÝE2õÝK~?ÝE2ðdo?ÝDÍÎÄ/?ÝDÍÈú¹?ÝDh¦rÎî?ÝDh úb?ÝDI)?ÝDy¢¥†?ÝCžXa;?ÝCžR‰Ð?ÝC91("Æ?ÝC9+¯¤õ?ÝBÔ Œ<ý?ÝBÔÒ?ÝBnä/þ?ÝBnÞ¶¿ÿ?ÝB ¾z?ÝB ¸˜5?ÝA¤˜0nù?ÝA¤’¸<Ì?ÝA?r_?ÝA?mú?Ý@ÚM,mØ?Ý@ÚG´a|?Ý@u(`é?Ý@u"gv?Ý@"ç"?Ý@ý«˜?Ý?ªÞ|:`?Ý?ªÙf¾?Ý?Eº8?Ý?E´œwX?Ý>à•êëÜ?Ý>às> ?Ý>{rUÖ?Ý>{lˆºî?Ý>NT«?Ý>HÜù¬?Ý=±*çop?Ý=±%oúY?Ý=L¹«?Ý=LA±|?Ý<æäËò]?Ý<æßT£?Ý< :j?Ý<¼¨þ ?Ý<Ÿ³w/?Ý<š?Ý*V’ M°?Ý*VŒ™vÝ?Ý)ñ{[¬?Ý)ñuŒ—À?Ý)Œd2ø|?Ý)Œ^¿Gu?Ý)'M¥RJ?Ý)'H1´*?Ý(Â7WF”?Ý(Â1ã»Y?Ý(]!I‘?Ý(]Õ‹ª?Ý"Ö³2?Ý"ÖAl?Ý"pôglA?Ý"pîõ_?Ý" â[^œ?Ý" Üé ?Ý!¦ÐdF?Ý!¦Ë-/?Ý!A¿qÛ?Ý!A¹‘Mª?Ý Ü­·©ò?Ý Ü¨E˜¥?Ý wœ¬&?Ý w—:¾?Ý ‹àwz?Ý †n‹÷?Ý­{U…?Ý­uã(ç?ÝHk ¶`?ÝHe—ð§?ÝãZþ¸ª?ÝãUÖ?Ý~K3ÎÛ?Ý~EÂ.ë?Ý;©š?Ý67Ž?Ý´,^žõ?Ý´&í$Ï?ÝOToÿ?ÝOã½?ÝêŠwÈ?Ýê #k?Ý…ªß?Ý„úif?Ýñ·Bæ?ÝìFR?ݺã®X?ݺÞ<ê©?ÝUÕå.Ù?ÝUÐt&?ÝðÈ\°ú?ÝðÂë»?Ý‹»j§c>?Ý49“äç?Ý44#Ñ°?ÝÏ/P½m?ÝÏ)à½?Ýj%N¶?ÝjÞ+F?ÝŒP?Ý'Å?Ý  t’?Ý  š¬ê?Ý;Éu>?Ý;YÀy?ÝÕÿÉ 2?ÝÕúYhQ?Ýp÷ -²?Ýpñ™žµ?Ý î‰öÓ?Ý éz¹?ݦæKZ?ݦàÛðå?ÝAÞM]h?ÝAØÞ?ÝÜÖv?ÝÜÑ Ã?ÝwÏf ?Ýwɤ6?ÝÇ×U®?ÝÂh8?Ý­ÀÜ .?Ý­»mg?ÝHº!j±?ÝH´²rÍ?Ý㳧‚?Ýã®8š?Ý~­nQn?Ý~§ÿP?ݧuà†?Ý¢!L?Ý´¡¾,Ò?Ý´œO€z?ÝOœGG¡?ÝO–Ø®,?Ý ê—+@?Ý ê‘¢¤®?Ý …’Ñÿ?Ý …Œ­^O?Ý gX ?Ý ‡ø÷Ó?Ý »ˆó­ú?Ý »ƒ…`?Ý V„À×Ô?Ý VRœÌ?Ý ñ€ÎÛû?Ý ñ{`³Õ?Ý Œ}Åû?Ý Œw¯°¹?Ý 'y­Š_?Ý 't?‡ÿ?Ý Âv~4¸?Ý ÂqE;?Ý ]s’,Í?Ý ]n$P2?Ý øpé­¡?Ý øk{ãè?Ý “n‚Rj?Ý “i›“?Ý .l\ ?Ý .fîf?ÝÉjvßï?ÝÉe NÝ?ÝdhÒß¹?Ýdcea‰?Ýÿgp u?Ýÿbž'?ÝšfNQ¨?Ýš`àù¤€?Ý{Ò²Ñ?Üÿ¶…7K?Üÿ¶ËlF?ÜÿQ‰qV?ÜÿQ„Š?Üþììí~?Üþìˆ4r?Üþ‡’©ú¤?Üþ‡>Ty?Üþ"—¨ˆö?Üþ"’<õ¬?Üý½œè£ø?Üý½—}#?ÜýX¢jK°?ÜýXœþÞ(?Üüó¨-t²?Üüó¢Â ?ÜüŽ®20ÛZ?Üö¤!Ô®·?Üö?1^ S?Üö?+ô†?ÜõÚ;À, ?ÜõÚ6V%'?ÜõuFc~‚?Üõu@ùŠ?ÜõQH®°?ÜõKÞÍŒ?Üô«\oÂ`?Üô«Wô?ÜôFgØ¢ ?ÜôFbnç?ÜãRBJ>?Üâí^ƒâT?ÜâíYe1?Üâˆu™ãþ?Üâˆp3y¹?Üâ#Œò‘„?Üâ#‡Œ:?Üᾤßz?Üᾟ'šð?ÜáY¼kß?ÜáY·­a?ÜàôÔŒ¡m?ÜàôÏ&‚?Üàìðq?ÜàçŠ ?Üà+–F?Üà+0M{?ÜßÆ@7?ÜßÆZ?Üßa7ªü¸?Üßa2E)]?ÜÞüQ|?ÜÞüK³»˜?ÜÞ—jÊÕ0?ÜÞ—ee'?ÜÞ2„¾öä?ÜÞ2Y\ ?ÜÝÍžõæä?ÜÝÍ™^ý?ÜÝh¹o¶d?ÜÝh´ AZ?ÜÝÔ,Y÷?ÜÝÎÆ÷Ê?ÜÜžï+â¾?ÜÜžéÆ“m?ÜÜ: nV{?ÜÜ: ?ÜÛÕ%ó¤?ÜÛÕ Žzm?ÜÛpA»Ü„?ÜÛpÖ?ÜÅÄÊ55?ÜÅ_ù÷8¦?ÜÅ_ô–Aß?ÜÄû$É @?ÜÄûh(S?ÜÄ–OÞÅ ?ÜÄ–J}óõ?ÜÄ1{8bþ?ÜÄ1uפÄ?ÜÃ̦Õæ?ÜÃÌ¡u:½?ÜÃgÒ·YÇ?ÜÃgÍVÁA?ÜÃþܽü?ÜÃù|8O?Üž+F ?Üž%å«M?ÜÂ9WónÈ?ÜÂ9R“Î?ÜÁÔ„ä»V?ÜÁÔ„n6?ÜÁo² v?ÜÁo¬¹Ï/?ÜÁ ß“^â?ÜÁ Ú37t?ÜÀ¦ PµØ?ÜÀ¦ð¡C?ÜÀA;RÂ?ÜÀA5ò?Ü¿Üi—–?Ü¿Üd7§?Ü¿w˜!r?Ü¿w’Á=i?Ü¿Æî¯y?Ü¿ÁŽæI?ܾ­öËg?ܾ­ð£?ܾI%]x?ܾIýùú?ܽäTü´i?ܽäO#Ã?ܽ„à!Z?ܽ€£?ܽµØÜ?ܽ¯¨mè?ܼµåsì?ܼµà“í?ܼQ$I½?ܼQÅ{?Ü»ìGý_?Ü»ìA¹Êõ?Ü»‡xR¼?Ü»‡ròþ+?Ü»"©Ï“ú?Ü»"¤p‡B?ܺ½Û‘k‚?ܺ½Ö2q¢?ܺY —©ý?ܺY8Âö?ܹô?âf;?ܹô:ƒ’ ?ܹrq‰a?ܹmÈ ?ܹ*¥EÝ?ܹ*Ÿæp_?ܸÅØ]2?ܸÅÒþ–[?ܸa ¹½?ܸa[4P?Ü·ü?ZÀ.?Ü·ü9üJ8?Ü·—s@@Ü?Ü·—máݾ?Ü·2§jJ‹?Ü·2¢ úF?ܶÍÛØâë?ܶÍÖz¥}?ܶiŒQ?ܶi -ê»?ܶEƒÅF?ܶ@%­ˆ?ܵŸzÀ8?ܵŸub S?ܵ:°@ó(?ܵ:ªã?Ü´ÕækW?Ü´Õ਌!?Ü´qˆÚ?Ü´q²¼|?Ü´ R_K¨?Ü´ M’!?ܳ§ˆò¨Z?ܳ§ƒ•«?ܳB¿Êµ°?ܳBºm!Ù?ܲÝöçs¡?ܲÝñ‰ò ?ܲy.HÜx?ܲy(ënO?ܲeîûŽ?ܲ`‘ =?ܱ¯ÙÖ“?ܱ¯˜|Ž?ܱJÖ gÌ?ܱJЬ2)?Ü°æ}ÀF?Ü°æ z?Ü°G6ÚH?Ü°AÙÊT?Ü°€4µÊ?Ü°z׸­?ܯ·¹w^*?ܯ·´sä?ܯRòþÙ?ܯRí¢Ÿ?Ü®î,Ë À?Ü®î'n\'?Ü®‰fÜ:è?Ü®‰a‰'?Ü®$¡2>H?Ü®$›ÕŸ^?Ü­¿ÛÍY?Ü­¿Öp‚E?Ü­[¬Ç?Ü­[PNS?ܬöQÑd2?ܬöLtýÌ?ܬ‘:éä?ܬ‘‡Þ–U?ܬ,ÈéX¡?ܬ,Ãè?Ü«ÈÜ»¿?Ü«Çÿ€Ý?Ü«cA*?Ü«c;¸ç?ܪþ}’HD?ܪþx6@?ܪ™ºTˆW?ܪ™´ø’ù?ܪ4÷[È ?ܪ4ñÿåƒ?Ü©Ð4¨Y?Ü©Ð/L7¨?Ü©kr9F3?Ü©kl݉X?Ü©°ò?Ü©ª³åí?ܨ¡î*ä?ܨ¡èÏMa?ܨ=,‹I°?ܨ='/ÅX?ܧØk0¿H?ܧØeÕMÅ?ܧsªP±?ܧs¤¿ò?ܧéJýß?ܧãï²?ܦª(¿»j?ܦª#d‚i?ܦEhy¥µ?ܦEcŠ?Ü¥à¨x¼º?ܥࣩe?Ü¥{è¿W?Ü¥{ãdV‘?Ü¥)M»ë?Ü¥#òÎA?ܤ²j!z?ܤ²dÆŸ4?ܤM«:‘S?ܤM¥ßÉU?Ü£èì™Í?Ü£èç>L¤?Ü£„.<ÖË?Ü£„(â4x?Ü£p&@?Ü£jË€Â?Ü¢º²T¹„?Ü¢º¬ú<Ü?Ü¢UôÈÌÛ?Ü¢Uïnc?Ü¡ñ7‚JB?Ü¡ñ2'óD?Ü¡Œz= ?Ü¡Œu&øã?Ü¡'½Å¥%?Ü¡'¸ksÒ?Ü ÃOˆ@?Ü ÂûõiÂ?Ü ^Eñ¬?Ü ^?Äæ?ÜŸù‰3á`?ÜŸùƒÙèŒ?ÜŸ”ÍŽKñ?ÜŸ”È4eò?ÜŸ0.Bc?ÜŸ0 Ôo:?ÜžËWħ?ÜžËQºR?Üžfœ>Ò¿?Üžf–å%??Üžá¯}¡?ÜžÜUâö?Ü'eÅG?Ü" =q?Ü8ma£ó?Ü8h.ñ?ܜӳ£*ª?ܜӮIÈ~?Üœnú*N?ÜœnôÐþ­?Üœ @÷¡?Üœ ;×?Ü›¥ˆ Œ…?Ü›¥‚°bÖ?Ü›@Ïa¸¤?Ü›@Ê¡Ê?ÜšÜÿ†â?ܚܦ‚Ü?Üšw^ã ?ÜšwYŠ"n?Üš§ Y"?Üš¡³zÄ?Ü™­ï{Q¯?Ü™­ê"†&?Ü™I80 ?Ü™I2×`ë?ܘä*Ÿá?ܘä{Ñúhealpy-1.8.1/healpy/data/weight_ring_n00128.fits0000650000175000017530000004160011705033043021704 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:04:27' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 256 / 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 NSIDE = 128 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 454 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 1.770797556810E-01 / maximum value of T weights MINVAL1 = -9.340929615201E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 1.770797556810E-01 / maximum value of Q weights MINVAL2 = -9.340929615201E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 1.770797556810E-01 / maximum value of U weights MINVAL3 = -9.340929615201E-02 / minimum value of U weights COMMENT END ?ƪŒ§·~h?ƪŒ§·~h?ƪŒ§·~h¿·é«ðÚ¿·é«ðÚ¿·é«ðÚ?¯ '¾€?¯ '¾€?¯ '¾€¿¥çn~ĵ¿¥çn~ĵ¿¥çn~ĵ?  Ȩ÷v?  Ȩ÷v?  Ȩ÷v¿—ÖålÆl¿—ÖålÆl¿—ÖålÆl?‘© ­êò±?‘© ­êò±?‘© ­êò±¿‰¾]VÛ+q¿‰¾]VÛ+q¿‰¾]VÛ+q?‚,ê^A1³?‚,ê^A1³?‚,ê^A1³¿xK«¤ŠT¿xK«¤ŠT¿xK«¤ŠT?mkÎsÜcŸ?mkÎsÜcŸ?mkÎsÜcŸ¿\­Ì7ª±¿\­Ì7ª±¿\­Ì7ª±?5¡Ã L€?5¡Ã L€?5¡Ã L€?GõQ1sà?GõQ1sà?GõQ1sà¿XW:&ˆ?p¿XW:&ˆ?p¿XW:&ˆ?p?`6Ø¿$M“?`6Ø¿$M“?`6Ø¿$M“¿bv¥ì9Ü¿bv¥ì9Ü¿bv¥ì9Ü?c9~Ébž[?c9~Ébž[?c9~Ébž[¿bËS²W²¿bËS²W²¿bËS²W²?apP:W &?apP:W &?apP:W &¿^ÏÑ”8¿^ÏÑ”8¿^ÏÑ”8?YÔfbáî†?YÔfbáî†?YÔfbáTVLÍ;L¿TVLÍ;L¿TVLÍ;L?MZªþ.û?MZªþ.û?MZªþ.û¿BH²r¿BH²r¿BH²r?/Â}%Ž•é?/Â}%Ž•é?/Â}%Ž•é?ò 1÷8?ò 1÷8?ò 1÷8¿2eqP5T;¿2eqP5T;¿2eqP5T;??Ë,Ä¥A??Ë,Ä¥A??Ë,Ä¥A¿DQ] ›f¿DQ] ›f¿DQ] ›f?Gy=½²…ß?Gy=½²…ß?Gy=½²…ß¿I#ô `G¿I#ô `G¿I#ô `G?IQ‚놌?IQ‚놌?IQ‚놌¿HMÜœLVq¿HMÜœLVq¿HMÜœLVq?FAŠÔ45?FAŠÔ45?FAŠÔ45¿Cd‘zXy¤¿Cd‘zXy¤¿Cd‘zXy¤??áƒû•Þ??áƒû•Þ??áƒû•Þ¿8>1¦J"¿8>1¦J"¿8>1¦J"?0KãM—G?0KãM—G?0KãM—G¿ Ô ~à»ò¿ Ô ~à»ò¿ Ô ~à»ò>îvÝ×W>îvÝ×W>îvÝ×W?gk*d0r?gk*d0r?gk*d0r¿'}9°ÝY)¿'}9°ÝY)¿'}9°ÝY)?0–2E;D?0–2E;D?0–2E;D¿4Höþô _¿4Höþô _¿4Höþô _?6Íùß XÎ?6Íùß XÎ?6Íùß Xο8)‘G¯²Y¿8)‘G¯²Y¿8)‘G¯²Y?8k“ÄH\?8k“ÄH\?8k“ÄH\¿7­Rý “9¿7­Rý “9¿7­Rý “9?6uárü?6uárü?6uárü¿3·Ì¤¶š5¿3·Ì¤¶š5¿3·Ì¤¶š5?0Ï5ùí,?0Ï5ùí,?0Ï5ùí,¿*ÿRY!· ¿*ÿRY!· ¿*ÿRY!· ?#äéA€}t?#äéA€}t?#äéA€}t¿:ïû:?Í¿:ïû:?Í¿:ïû:?Í?ÁéŸØo?ÁéŸØo?ÁéŸØo>æ4vK—ù>æ4vK—ù>æ4vK—ù¿£œ‡†º¿£œ‡†º¿£œ‡†º?lÃnǘL?lÃnǘL?lÃnǘL¿!ì–ODà\¿!ì–ODà\¿!ì–ODà\?%·34oS?%·34oS?%·34oS¿(Œ,¹…ÿ(Œ,¹…ÿ(Œ,¹…Ã?*jƒn=¡?*jƒn=¡?*jƒn=¡¿+Y×:å æ¿+Y×:å æ¿+Y×:å æ?+ht@¤f?+ht@¤f?+ht@¤f¿*ªQ•ï†ê¿*ªQ•ï†ê¿*ªQ•ï†ê?)7¡rz?Þ?)7¡rz?Þ?)7¡rz?Þ¿'+{—RÑ¿'+{—RÑ¿'+{—RÑ?$¢›ð_/B?$¢›ð_/B?$¢›ð_/B¿!º>sŸ¬p¿!º>sŸ¬p¿!º>sŸ¬p?=‡©c?=‡©c?=‡©c¿y?t÷µ„¿y?t÷µ„¿y?t÷µ„?psKÏ¡?psKÏ¡?psKÏ¡¿–…ã¿–…ã¿–…ã>ä–Ú€ll>ä–Ú€ll>ä–Ú€ll>ìB„P> E>ìB„P> E>ìB„P> E¿Z‡›ª2¿Z‡›ª2¿Z‡›ª2? ŽŠ_ 3 ? ŽŠ_ 3 ? ŽŠ_ 3 ¿Ç–¾æjÉ¿Ç–¾æjÉ¿Ç–¾æjÉ?¥%ßÐuA?¥%ßÐuA?¥%ßÐuA¿Ü‘•ÞÔ¿Ü‘•ÞÔ¿Ü‘•ÞÔ?lÎ`D®;?lÎ`D®;?lÎ`D®;¿\bn¶P¿\bn¶P¿\bn¶P?±R¬ÿ¿Z?±R¬ÿ¿Z?±R¬ÿ¿Z¿ ;‚G÷‘¿ ;‚G÷‘¿ ;‚G÷‘? \¡æ¤Äÿ? \¡æ¤Äÿ? \¡æ¤Äÿ¿ BÇíŠÙ+¿ BÇíŠÙ+¿ BÇíŠÙ+?ê1,m¤?ê1,m¤?ê1,m¤¿õ¿~½ŸH¿õ¿~½ŸH¿õ¿~½ŸH?¶¹D>Lw?¶¹D>Lw?¶¹D>Lw¿;,\,¿;,\,¿;,\,?p¿`2Ã?p¿`2Ã?p¿`2ÿÂñk g¿Âñk g¿Âñk g?Þ"q?Þ"q?Þ"q¿ëÞ»Júã¿ëÞ»Júã¿ëÞ»Júã?õl/®Qˆ?õl/®Qˆ?õl/®Qˆ¿gÁJD"¿gÁJD"¿gÁJD"?2§$ëÐ?2§$ëÐ?2§$ëп GŒd¿ GŒd¿ GŒd?òŠzCM?òŠzCM?òŠzCM¿“Ý! ¿“Ý! ¿“Ý! ?fÆé ÀÃ?fÆé ÀÃ?fÆé ÀþúÞVöžH9¾úÞVöžH9¾úÞVöžH9>õ\•ÈYgõ>õ\•ÈYgõ>õ\•ÈYgõ¾ðHàÞ[˜¾ðHàÞ[˜¾ðHàÞ[˜>çCLh7ôk>çCLh7ôk>çCLh7ôk¾ÝŽ!èI ù¾ÝŽ!èI ù¾ÝŽ!èI ù>ÌM‚Û<Œ>ÌM‚Û<Œ>ÌM‚Û<Œ¾k¥i)¾k¥i)¾k¥i)¾È¹÷Ð"¾È¹÷Ð"¾È¹÷Ð">×µOsú˜>×µOsú˜>×µOsú˜¾àû„»Nj¾àû„»Nj¾àû„»Nj>å¤f|R*>å¤f|R*>å¤f|R*¾éë”/ÆìM¾éë”/ÆìM¾éë”/ÆìM>íé&<è$>íé&<è$>íé&<è$¾ðÜò•´¾ðÜò•´¾ðÜò•´>òÀ[àkL>òÀ[àkL>òÀ[àkL¾ôµY 5–½¾ôµY 5–½¾ôµY 5–½>öÛ ’C7>öÛ ’C7>öÛ ’C7¾ù_¬Ùª”õ¾ù_¬Ùª”õ¾ù_¬Ùª”õ>ü—‹žY?>ü—‹žY?>ü—‹žY?¿skÒ°‰%¿skÒ°‰%¿skÒ°‰%?²í¬@2?²í¬@2?²í¬@2¿ ÜNŒ<˜¿ ÜNŒ<˜¿ ÜNŒ<˜?žE!;?žE!;?žE!;¿-Íä´D…¿-Íä´D…¿-Íä´D…?0,^@þ~íî¿æ>þ~íî¿æ>þ~íî¿æ¾öv‡yì³¾öv‡yì³¾öv‡yì³>ç¹îP?Š>ç¹îP?Š>ç¹îP?Š¾›h"ªÄz¾›h"ªÄz¾›h"ªÄz¾çk¯u†Ñd¾çk¯u†Ñd¾çk¯u†Ñd>÷½s¿``Æ>÷½s¿``Æ>÷½s¿``Æ¿TÍ Ãô¿TÍ Ãô¿TÍ Ãô?¯f½ X¿?¯f½ X¿?¯f½ X¿¿aâ{¾À¿aâ{¾À¿aâ{¾À?ô3GÝZÃ?ô3GÝZÃ?ô3GÝZÿé(%É~¿é(%É~¿é(%É~?¤¾Øž?¤¾Øž?¤¾Øž¾øi¸ÛAys¾øi¸ÛAys¾øi¸ÛAys>à-núDj;>à-núDj;>à-núDj;>ã.îýöP>ã.îýöP>ã.îýöP¾úLc¹Ùv¾úLc¹Ùv¾úLc¹Ùv?ÄX“4ô+?ÄX“4ô+?ÄX“4ô+¿„£\g5Ñ¿„£\g5Ñ¿„£\g5Ñ?œÕ –ZU?œÕ –ZU?œÕ –ZU¿Î,M¬F¿Î,M¬F¿Î,M¬F>ù £{Ú„ž>ù £{Ú„ž>ù £{Ú„ž¾×?ãôM ¾×?ãôM ¾×?ãôM ¾íq·‹]¹¾íq·‹]¹¾íq·‹]¹?IëVJ ?IëVJ ?IëVJ ¿ýƒú¿ýƒú¿ýƒú?ŒÎPÀ«?ŒÎPÀ«?ŒÎPÀ«¿4²EKëÏ¿4²EKëÏ¿4²EKëÏ>õä >½D->õä >½D->õä >½D-¾…WÿË8|ÿ¾…WÿË8|ÿ¾…WÿË8|ÿ¾õ»žkéǾõ»žkéǾõ»žkéÇ?1¢bá?1¢bá?1¢b`xàv±¿¯xàv±¿¯xàv±?BLÁs??BLÁs??BLÁs?¾øÃ&èQMÿ¾øÃ&èQMÿ¾øÃ&èQMÿ>Àç›>5{ê>Àç›>5{ê>Àç›>5{ê>õ9xyf´>õ9xyf´>õ9xyf´¿@¥·Çð¿@¥·Çð¿@¥·Çð?7È̉àp?7È̉àp?7È̉àp¿u…(+8¿u…(+8¿u…(+8>ññ(X€ºˆ>ññ(X€ºˆ>ññ(X€ºˆ>Û NFP¶ð>Û NFP¶ð>Û NFP¶ð¾ýXß‹Våj¾ýXß‹Våj¾ýXß‹Våj?(´Å׫û?(´Å׫û?(´Å׫û¿Ëô¨u¿Ëô¨u¿Ëô¨u>ùÕ5&FûÉ>ùÕ5&FûÉ>ùÕ5&Fûɾ¸‚[Ö®_^¾¸‚[Ö®_^¾¸‚[Ö®_^¾÷Zsƒ¯z0¾÷Zsƒ¯z0¾÷Zsƒ¯z0?íÆB¹A?íÆB¹A?íÆB¹A¿ãxljÍH¿ãxljÍH¿ãxljÍH>ü$ìŽSŒ>ü$ìŽSŒ>ü$ìŽSŒ¾Îˆ÷{…X¾Îˆ÷{…X¾Îˆ÷{…X¾õôYŽ¾Ó¾õôYŽ¾Ó¾õôYŽ¾Ó?œ”Á¯˜V?œ”Á¯˜V?œ”Á¯˜V¿&áÙ†¿&áÙ†¿&áÙ†>ú]ÞOÄ™ >ú]ÞOÄ™ >ú]ÞOÄ™ ¾°$¬îtξ°$¬îtξ°$¬îtξøǃÑg%¿¾øǃÑg%¿¾øǃÑg%¿?![ t›²?![ t›²?![ t›²¿c i·u¿c i·u¿c i·u>ô¾3ž4·<>ô¾3ž4·<>ô¾3ž4·<>ØüÖ♪M>ØüÖ♪M>ØüÖ♪M¾þ„£©ö­j¾þ„£©ö­j¾þ„£©ö­j?ª;ƒ“‹¼?ª;ƒ“‹¼?ª;ƒ“‹¼¿ÛŒ Lüy¿ÛŒ Lüy¿ÛŒ Lüy>åÒÇ1ånÆ>åÒÇ1ånÆ>åÒÇ1ånÆ>ðÛËFËPÆ>ðÛËFËPÆ>ðÛËFËPÆ¿quaµš¿quaµš¿quaµš?çã:/ô&?çã:/ô&?çã:/ô&¾ø°€j±¾ø°€j±¾ø°€j±¾ÇÇ_Lh‡>¾ÇÇ_Lh‡>¾ÇÇ_Lh‡>>ü£*p¼˜w>ü£*p¼˜w>ü£*p¼˜w¿Fíu|ž¿Fíu|ž¿Fíu|ž?ln™îá‡?ln™îá‡?ln™îᇾâ?Žó8Ôy¾â?Žó8Ôy¾â?Žó8Ôy¾óô^âê°¾óô^âê°¾óô^âê°?êÁ.EN:?êÁ.EN:?êÁ.EN:¿ݘ.óªD¿ݘ.óªD¿ݘ.óªD>ò²Ã/&>ò²Ã/&>ò²Ã/&>㎻¢wÆå>㎻¢wÆå>㎻¢wÆå¿£g€ë Æ¿£g€ë Æ¿£g€ë Æ?à˜ÎŠM?à˜ÎŠM?à˜ÎŠM¾ùÅ~RÛ™~¾ùÅ~RÛ™~¾ùÅ~RÛ™~¾¸ %È»N¾¸ %È»N¾¸ %È»N>ü ÞÓ%¤T>ü ÞÓ%¤T>ü ÞÓ%¤T¿Wq„¿Wq„¿Wq„>þ¼%žå¥%>þ¼%žå¥%>þ¼%žå¥%¾Õr‚Ý×Ö¾Õr‚Ý×Ö¾Õr‚Ý×Ö¾öÚ<{C¾öÚ<{C¾öÚ<{C?o³Ý¼?o³Ý¼?o³Ý¼¿äD(Ià¿äD(Ià¿äD(Ià>åâÁ×é3j>åâÁ×é3j>åâÁ×é3j>ò–ùµ>ò–ùµ>ò–ùµ¿§u"륿§u"륿§u"ë¥?ð™OÊ?ð™OÊ?ð™Oʾîºì?™Ä¾îºì?™Ä¾îºì?™Ä¾ëÑé´³¼M¾ëÑé´³¼M¾ëÑé´³¼M?ı!ö4Â?ı!ö4Â?ı!ö4¿É)7Æh;¿É)7Æh;¿É)7Æh;>òÕ½«œ£Ã>òÕ½«œ£Ã>òÕ½«œ£Ã>ä¯k“Ç–s>ä¯k“Ç–s>ä¯k“Ç–s¿â¥Jo5Ý¿â¥Jo5Ý¿â¥Jo5Ý?0„a†§Û?0„a†§Û?0„a†§Û¾õ‹Ž*Lm¾õ‹Ž*Lm¾õ‹Ž*Lm¾Ýp1ó§1z¾Ýp1ó§1z¾Ýp1ó§1z?q‡åW?q‡åW?q‡åW¿k?û×ê¿k?û×ê¿k?û×ê>÷›ˆj}ßÃ>÷›ˆj}ßÃ>÷›ˆj}ßÃ>Ô®r81´>Ô®r81´>Ô®r81´¾þÙWǾþÙWǾþÙWÇ?ˆØƒ4 ;?ˆØƒ4 ;?ˆØƒ4 ;¾ø£0nú² ¾ø£0nú² ¾ø£0nú² ¾Ó?NQ×B+¾Ó?NQ×B+¾Ó?NQ×B+?’ýŸ&¦æ?’ýŸ&¦æ?’ýŸ&¦æ¿]‹ä (¿]‹ä (¿]‹ä (healpy-1.8.1/healpy/data/pixel_window_n0128.fits0000650000175000017530000003410011705033043022023 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 513 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 128 / Resolution parameter for HEALPIX MAX-LPOL= 512 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 128 COMMENT for multipoles in range [0, 512] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð?ïÿôÏ4(?ïÿÜ5xµT?ïÿôÑS¯?ïÿ¸kµ•?ïÿÐGU!ï?ïÿˆ²¾»?ïÿ ŽãT1?ïÿM ¨w2?ïÿdè¨Mý?ïÿyË?ïÿTÛ‹J?ïþ±øõr?ïþÉÓ¿ ?ïþRŠ=»ž?ïþje¢8*?ïýç/º-I?ïýÿ ܈?ïýoèù#Ò?ïý‡ÃÑó?ïüì¶iŽø?ïýð#Z?ïü]˜…t?ïüur³GB?ïûÂÑìî?ïûÚiŸšÿ?ïûœß'Õ?ïû3vEM?ïúhÀHf ?ïú€™?žê?ïù©ú³û??ïùÁÓ4äÛ?ïøßLÓL{?ïø÷$Ö„P?ïø·bÏ4?ïø Žàó ?ï÷&;*?ï÷>¶Y?ïö7ØûŠ&?ïöO¯Yaƒ?ïõ=‘´õ?ïõUgw”ç?ïô7f>ôv?ïôO;^ü“?ïó%W>(?ïó=,Nè?ïòfžß?ïò:cKQ?ïðÝ”|³?ïðõgˆ¸¯?ïï§â.ô?ïèén ?ïé<+5?ïçl”4¨h?ïç„ae¡ß?ïåãã—?ïåû¯@?ïäO[äŽø?ïäg''”?ïâ¯RC ?ïâÆÊ’ˆÙ?ïáÑÎYË?ïá› ¿?ïßJÑæj’?ïßbš 3˜?ï݇2ûÙ?ïÝžÉ@‡»?ïÛ·dW€X?ïÛÏ*E{Ø?ïÙÛúTó?ïÙó¾ÉmÌ?ï×ôÄì¾?ïØ ˆ…£?ïÖÆÚåu?ïÖ‰>FS?ïÔ›×?ïÔÂÂd³?ïÑøw ~Ø?ïÒ6ëë5?ïÏâ)¦?ïÏù矤3?ïÍÀˆð?ïÍ×ÖÍ4U?ïW!'Knv?ïW8šôi ?ïS0ð BQ?ïSHaAfê?ïO5j†Y%?ïOLÙDŸ~?ïK.šjH??ïKF¨ªÖÇ^?ï>íô\?ï:¢º¿Šj?ï:º¸Ic?ï6c® 9?ï6{ bl(?ï2m•°Ú?ï20ÊA³?ï-ÃýL=š?ï-ÛWGnŠ?ï)ca+‡Ç?ï)z¸nóU?ï$÷8à ?ï%ñ½”t?ï €µƒ§?ï ˜B‡?ïþ®$Ò‘?ïýLö?ïq‹?Ѻ?ïˆ×^Íò?ïÙQœ®?ïðšF2¥?ï6¡$?ïMJn?ï ‡§_3+?ï žêÚN?ïÎ@†j?ïåu+?ï Ók7\?ï!T‰?îû:dkÑè?îûQŸ%‘?îö_÷ð2¶?îöw/…ãÇ?îñz’j5?îñ‘ÆõFc?îìŠ8TΣ?îì¡iκ?îçŽî5ŒÄ?î禗ZB?î∸› ú?îâŸãÝë ?îÝwœ©‰?îÝŽÄ:Òe?îØ[_j ?îØrÂP—?îÓ4Á ÞÃ?îÓKâÉ>©?îÎ Ø)?îÎ*[}¶?îÈÆ‚‚ñ¡?îÈÝÅz*?îÃ)Ôa?îÖAÏ_ã?î¾-ž¨?î¾DJÔ¢?î¸Ð»5§?î¸ç/ðÓ?î³ht1? 8â?î­öŠô:?î® $–?î¨xò"Ú?î¨ùSO´?î¢ñ#Ø:G?î£'™¾?î^¨µB÷?îu¨ÿŸô?î—Á…Í?î—Ø‚šZ—?î’À<?î’0¹…«B?îŒg]( ³?îŒ~RçC“?a¿Ä??î†ÁSîÜ?î€âÓ;Ug?î€ùÁÒé?î{¶ÛíË?î{'¡Ôw[?îu4ëÚ?îuJù?¦n?îoLé¾}³?îocÍfúU?îi[C°FÃ?îir#¦å¯?îc_%&«:?îcvdàÿ?î]X“?î]olc?îWG”d ø?îW^iÙ??îQ,-"ÉO?îQBþŸ?îKcU™p?îK0pù"?îDÖ<Žš—?îDíÑn?î>›¾hÃ4?î>²ƒËÇ?î8Vî‡Ù)?î8m°þg?î2Ò˜iÒ?î2)>ú?î+®pOÂ?î+Å)íÙ?î%JÍkæR?î%aƒÔI?îÜﳊ)?îó¡Xç½?îdÜö’?î{Š•qÉ?îâ› [œ?îùDžoÈ?î V/Ô%?î lÕTv+?î¿¡9QÇ?îÖB §Õ?íþõ,º\?íþ5’t®#?í÷t1¨qÁ?í÷ŠÊÊ°?íð¿\¯‡?íðÕñ¥Kå?íê|K Y?íê Š¤?íã7–‘‰Õ?íãN#Û¸?íÜd±œ•°?íÜ{9é w?íÕ‡Óß|?íÕžW˜6 ?íΡšÍé?íη‚VȦ?íÇ°Dï #?íÇÆÀYo'?íÀµ ÊwZ?íÀÌÝa?í¹±r)á?í¹Ç&ÄG?í²¢¾3^™?í²¹,ƒËW?í«ŠŒcr ?í« öI…Õ?í¤h_ן?í¤~òÕjÜ?í<ÇŽí?íS(Œÿ²?í–A[¤¤?í–ÝÎÈ?íŽÈ>¼?íŽÞY=^Û?í‡ ²Ú‚?퇕a)*?í€,m?Sž?í€B¼&”¢?íxÐ&pÂ÷?íxæpÂäu?íqj?ÜBÑ?íq€…“7Œ?íiúÀ¼X?íj4zó?íb­Üß?íb—êKaó?íZÿÃô?í[G„\š?íSrì…„?íS‰“Ž–?íKÝJßðt?íKóy4Æ?íD>1•Ç”?íDT[+rm?í<•§r ¾?í<«ÌBšÆ?í4ã³GQ£?í4ùÓLÔÃ?í-([ï­?í->w$;C?í%c¨L±Â?í%y¾ªdú?í•ŸGdz?í«°ÈZ§?í¾GÐ3!?íÔTnŽ/?í ݨÞê§?í ó°”У?íóÉr®?í Ì:Hÿ?ìþ°‘ìp?ìþ®ejw?ìöeJWœ?ìö^#êç?ìíþî°Úw?ìî⊹d?ìåðSá9?ìæBµô/?ìÝØ›ÿµÝ?ìÝî…Èß[?ìÕ·Î5ªS?ìÕͲíÛ?ìÍñ´ÚÞ?ìÍ£ÑVYÈ?ìÅ[ µ¾0?ìÅpè:ÖM?ì½)wɵ?ì½4þÚÊ:?ì´ÚLAgÐ?ì´ð|¤*?쬌}_í¹?쬢Hm½—?ì¤5Ä'‘û?ì¤KŠQC?ì›Ö'óbJ?ì›ëè•q?ì“m°%9š?쓃kˆü}?ìŠüd%¶{?ì‹E–?ì‚‚Kd0€?ì‚—ü:™¼?ìyÿmV®æ?ìzÞ?ìqsÑyÝú?ìq‰w¬²Ù?ìhßQ€?ìhõ )Äü?ì`B~eþR?ì`Xß&®?ìWœÖI(W?ìW²l]Ì¡É?ì=Ä´q?ì4°F yê?ì4ÅÆV®Ç?ì+ßÌNé??ì+õGÙ?ì#ÙG¤‰?ì#NŠìz?ì%t´  ?ì:älá¶?ì;¦Yu?ìQ€æä?ìIuþ)k?ì^ÚUE?ëÿNësd?ëÿdJj¦¦?ëöLŽ™?ëöagåkl?ëí@ç+7?ëíV:Ü?©?ëä-}*h?ëäBË0ÁU?ëÛØtI?ëÛ' Ê…G?ëÑîö(„?ëÒC— a?ëÈÁþ£e¬?ëÈ×;‰½•?ë¿Ùu7ð?ë¿£›ÑÆ?ë¶Q™j£Û?ë¶fÊÌS?ë­ FˆpÀ?ë­"r z?ë£ÀèÙT?ë£Ö¡…O?ëšlˆlÚ?뚨`ì?ë‘-YtR?ë‘%Gt?뇫ߺV™?ë‡Àóöw ?ë~?§°wý?ë~T¶ ï?ëtËbS"?ëtà•Ò>¦?ëkO˜ûÛˆ?ëkd›~B?ëaËÒ®r´?ëaàÏ> ?ëX@B°Ýà?ëXU9HÎî?ëN¬ñ?:õ?ëNÁáÚŠƒ?ëEæšö?ëE&Ñ4¯±?ë;o+ ¾ù?ë;„òÒ?ë1ÄÆÚ}å?ë1Ù¥bA?ë(Â[IR?ë('šÒµ?ëY%ã[?ëmøE?ë—ùΚ?ë¬Æ$—?ë ÏF{¨ý?ë ä ¤Û?ëÿQ¨›?ëÔWÌ?ê÷'kº_ò?ê÷<%—Cð?êíHU%3?êí]Ô¤—?êãaÙý(?êãv†ƒmJ?êÙsÿÖ•?êÙˆ§¦³?êÏ~Ò):?êÏ“s&o?êÅ‚X?ÔB?êÅ–ó „{?ê»~šã^/?껓/i=?ê±s¢‰¾?ê!õ¸ ?ê" ìWdÍ?ê‚XXˆ?ê–†PŸ?ê HÈ´Í?ê oþ3?ꇒ)©µ?꛲Èýà?éø=S´Œ?éøWX‹x?éírS#ˆS?éí†f‰“Ò?éâÝÜyªŽ?éâñé<¡?éØBâ:hŽ?éØVèV×?éÍ¡mMÌm?é͵l½Òÿ?éÂù†Ÿ’Ý7•Ë?é ?*tÆ?é .ÃÊF?èÿ]Ê™?èÿÛqéÑ?èó鶭fk?èóý-X]b?èèÈRÿŒ?èèÛªU`?èÝ¡;ð†Ç?èÝ´¤—S„?èÒtz²•?èÒ‡ÜQœ?èÇBz®ô?èÇUs*Ê?è¼ €vz?è¼r¨D?è°Ì•þ1…?è°ßâo_?襉ˆ0¼â?襜͋16?èš@þW©?èšT<—ŒÜ?èŽó´jÀ?è8Öb%?胟›‹Ùã?胲ˌú?èxFÕ$g?ç‘&|{†¹?ç‘9‘í?ç…e>Ü71?ç…w΄õ^?çyŸo$½Þ?çy±÷]{í?çmÕÈ1c?çmç—Æs?çb?;€?çb¸Š_Û?çV2ñó[?çVEcÉ8@?çJ[8hA–?çJm¢ÁšG?ç>`ü?ç>‘~ì!?ç2ž¦k•[?ç2±­í?ç&¹àîö³?ç&Ì4À^?çÐÕÏ?çã!a€¡?çãŒf¢?çõÑ#Œ?æ)øªT?æ*Õu7G?æÛyÆ~8?æí}‰?æš^U?æ«úC?åøUá1¸€?åøguT®v?åì éíØ?åì˜?NV?åßÂè mA?åßÔl¹ë?åÓt$?åÓ…ûÖ× ?åÇ"ÚÁïz?åÇ4OŸ­¾?åºÎs 7?åºßqyY/?å®vÅX?宇jòÿ?å¢èG§ç?å¢,E—Ü^?啼µ‡uÂ?å•Î ù C?å‰[wv?å‰lÄ£«F?å|÷6xs ?å}|%¿‡?åpýE~?åp¡; *œ?åd%ÕäC?åd7 ç¥l?åW¸ÇM&ô?åWÉõB¶Ö!•À?å>ç?¯þ?å2`œ±rn?å2q²Ú÷º?å%èX„E?å%ùfºq>?åm^˜Êo?å~dÙïØ?å ï¸{XS?å ¶ÅÞ?åoo¶Ô¤?å€fù ?äóìÕë×?äóý|*_å?äçgbÈ~?äçx¹rí?äÚß$ç ›?äÚð=×#?äÎT°ë¿!?äÎe‡@žp?äÁÇÉùW_?äÁؘJ? ?äµ8y— Ÿ?äµI?â‹}?䨦ÉM»»?䨷‡©R?䜢½?äœ#xÛ Š?ä|oZa?äG_ê?ä‚ãØ;v?ä‚ô~Zš»?ävI‰ƒŒ?ävY¥˜Ú®?äi¬‡È–?äi¼œ…ju?ä] Þ¸­?ä]l¢¶Õ?äPk™²Õ?äP|rFy?äCÈ@·mo?äCؾt±æ?ä7"Ý…zf?ä73S)›Œ?ä*{y†yQ?ä*‹ç§Ë?äÒ8 ?ä⃤u?ä&Õ¥9?ä72d“å?äy§Ôa?ä‰üË?ã÷ÊŸGéç?ã÷ÚìS•¢?ãëÅŽô?ãë* v?ãÞg#èkÑ?ãÞw`ªø?ãѲÃͲÎ?ãÑÂøi(³?ãÄü®³†o?ãÅ Û&=:?ã¸Dî;&?ã¸UVŽà?ã«‹‹PÚÅ?ã«›§m,D?ãžÐí>?ãžà£ÛÒ?ã’SaM?ã’$ãÎ?ã…Uôò¥7?ã…eødp?ãx–h8¦?ãx¦c”ï_?ãkÕh‘x?ãkå[¹±%?ã_ÿg!§?ã_"êZ`?ãRO6#Ðt?ãR_à7j?ãEŠ.ÖI?ãE™ð²ëÚ?ã8èîYá?ã8Ó{8©D?ã+û÷Æða?ã, ÁÖ v?ã3 –°?ãBÍî þ?ãhïMªÇ?ãx¨âq?㪼äâ?ã­\è¤?âøÑGÇQ?âøàðÛŒ5?âìÏÉHo?âìp›b ?âß5Lk??âßDä¬À?âÒeÆ™Ô?âÒuVfwY?âÅ•Gî½?âŤÏ!ºØ?â¸ÃØv¸B?â¸ÓX3,)?â«ñƒzrE?â¬úîKž?âŸQzÀ?âŸ-À¤Á?â’JKÇfu?â’Y²¦UØ?â…u{®E„?â…„Ú@în?âxŸê{RÔ?âx¯@À„ç?âkÉ¡x“”?âkØïo"í?â^ò©îÆ?â_ï”ÛÚ?âR !ï^?âR*JwÇ,?âEBÔX.õ?âER [úÎ?â8jÒßÂ?â8y5ƒ…i?â+³Ñÿp?â+ŸØ.hû?â¶Þ“y€?âÅúš•s?âÜ’S" ?âë¦ã1?âØJ°D?â㤠Î?áø&¹±¹?áø5¼²®á?áëK?½«ç?áëZ:e8Ü?áÞos¡ÉP?áÞ~eîñù?áÑ“^"?áÑ¢H€ï¸.?á·éWvö¦?áªýÅWô?á« –2í?áž è(a°?áž/°£f?á‘CïÕÓ?á‘R¯ðäÎ?á„fåƒÎ?á„u>e?áw‰ÒS…ÿ?áw˜¬?áj¬¿cÖ’?áj»fYèœ?á]ϵÑBi?á]ÞTdt?áPò¾µìô?áQTäˆû?áDã)–¦?áD$póFÅ?á79,A˜þ?á7G±¥—b?á*\£â²?á*k m“?á€P§ó¬?áŽÅ>MA?á¤>Ù]?ᲪCGâ?áÈtc+?áÖØ(ø¹?àöìüœC?àöûWø2?àêßÆ &?àê 2¸…y?àÝ7&åYQ?àÝEqm) ?àÐ\ÚûŒ6?àÐk T?àø#?àÑ>¸Dt?ඩ®g?භßJb4?à©ÐÞñ•W?à©ßÈdã?àœø À¯)?àÁ)¼k?à ühT?à/cEq?àƒIúÛr¶?àƒX gF¥?àvs¥ ?àv¬%mê?àižÞ`³?ài¬ŠÍý?à\É EéŠ?à\×Û×?àOõ'u0?àPðòla?àC!µh2?àC/šÁ²?à6O?ê«ò?à6]Ò;?à)}«ŽÅ)?à)‹€î?à­1¹w?àºÍ4 ?àÝI®²?àë =&x?àÛÊ‘?àH÷'?ßì­ õ?ßìn’|?ßÒèY:”û?ßÓ­ -P?ß¹Q1¦ïÙ?ß¹lu"Ô?ߟ¼Gÿ`?ߟ×z×V?߆)­ØÈk?߆DÏ Ÿ?ßl™t¢â?ßl´…}0×?ßS ®Fþ°?ßS&®?ß9€kê~?ß9›ZË‘‘?ß÷¿,W ?ß ÆÉ?ßq¹†Mi?ߌ†‹‰Œ?Þìîll¶t?Þí (ƒ5J?ÞÓméNuË?ÞÓˆ”u´ ?Þ¹ðA”ý!?Þº ÛÌ~!?Þ u†¤L$?Þ ë™’?Þ†ýÉÚï÷?Þ‡B1™õ?Þm‰’å?Þm£ƒ÷ Ó?ÞT1G?ÞT1æ‘]ä?Þ:©5Ê°~?Þ:Ã{M¹?Þ!>ãI—?Þ!XSs„†?ÞÖ\ªU£?Þð€H‰?Ýîr]À ?ÝîŒÆ+?ÝÕ6l?ÝÕ+î ç?Ý»³¾fCè?ݻͯ+?Ý¢Yû ?Ý¢sÚíb?݉âå0?݉±]w×?Ýo±…´x—?ÝoËCž.´?ÝVbõ×`H?ÝV|¢Í??Ý=DŦ?Ý=1àQ?Ý#ÑCyz?Ý#ë PÃ?Ý Ž¾¬÷©?Ý ¨8Åè?ÜñP Ek?Üñiviñ ?ÜØ~²‘?ÜØ.Ö?ÂD?ܾß" e?ܾøiD÷ò?Ü¥­ *×?Ü¥Æ@qëâ?ÜŒGg?ÜŒ˜l¹ºVhealpy-1.8.1/healpy/data/weight_ring_n00256.fits0000650000175000017530000005500011705033043021705 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:04:38' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 512 / 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 NSIDE = 256 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 768 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 1.636298040653E-01 / maximum value of T weights MINVAL1 = -6.857585732208E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 1.636298040653E-01 / maximum value of Q weights MINVAL2 = -6.857585732208E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 1.636298040653E-01 / maximum value of U weights MINVAL3 = -6.857585732208E-02 / minimum value of U weights COMMENT END ?ÄñÒHŽE]?ÄñÒHŽE]?ÄñÒHŽE]¿±Ž/ø~VH¿±Ž/ø~VH¿±Ž/ø~VH?œÀPÓ,LŸ?œÀPÓ,LŸ?œÀPÓ,LŸ¿|ÕH°9ýA¿|ÕH°9ýA¿|ÕH°9ýA¿jÈ Ãp¿jÈ Ãp¿jÈ Ãp?zͼpó(?zͼpó(?zͼpó(¿w¶Z,ì3¿w¶Z,ì3¿w¶Z,ì3?ißb¶W>?ißb¶W>?ißb¶W>¿6å÷<¦¿6å÷<¦¿6å÷<¦¿Y÷A›aò¿Y÷A›aò¿Y÷A›aò?b}*RuÀc?b}*RuÀc?b}*RuÀc¿]ö`@×O¿]ö`@×O¿]ö`@×O?Iìj<èzB?Iìj<èzB?Iìj<èzB?2ÿØö·?2ÿØö·?2ÿØö·¿P"ø7 G¿P"ø7 G¿P"ø7 G?RG@¼x±@?RG@¼x±@?RG@¼x±@¿Hí|ÿFÇw¿Hí|ÿFÇw¿Hí|ÿFÇw?%ì7S?%ì7S?%ì7S?8·K¢)}?8·K¢)}?8·K¢)}¿E°$ˆ9ö¿E°$ˆ9ö¿E°$ˆ9ö?DMžÄâ?DMžÄâ?DMžÄâ¿5]¡‚ä”s¿5]¡‚ä”s¿5]¡‚ä”s¿ Ó¢ßZc¿ Ó¢ßZc¿ Ó¢ßZc?7!D4âÕ?7!D4âÕ?7!D4âÕ¿=äYwØ¿=äYwØ¿=äYwØ?7-±ègü?7-±ègü?7-±ègü¿ß Ñ㶿ß Ñ㶿ß Ñ㶿"MVÀEØ¿"MVÀEØ¿"MVÀEØ?3¯V÷Â?3¯V÷Â?3¯V÷¿4‚ÀÔ1¿4‚ÀÔ1¿4‚ÀÔ1?)™\ø3”?)™\ø3”?)™\ø3”¾Ã°•—7۾ð•—7۾ð•—7Û¿%¦ˆ%±u¿%¦ˆ%±u¿%¦ˆ%±u?/á!Êho?/á!Êho?/á!Êho¿+^TÝÖÌò¿+^TÝÖÌò¿+^TÝÖÌò?KªQ[î«?KªQ[î«?KªQ[î«? ¤†q›•? ¤†q›•? ¤†q›•¿%[€˜Ï_]¿%[€˜Ï_]¿%[€˜Ï_]?(Ç7^Àt?(Ç7^Àt?(Ç7^Àt¿!AHÕß¿!AHÕß¿!AHÕß>øaߘ÷ >øaߘ÷ >øaߘ÷ ?OXà~?OXà~?OXà~¿#K¸_ áS¿#K¸_ áS¿#K¸_ áS?"qéFAN‡?"qéFAN‡?"qéFAN‡¿ƒê7_ò¿ƒê7_ò¿ƒê7_ò¾ó5'lŽ{¾ó5'lŽ{¾ó5'lŽ{?0ÏŒ`ç?0ÏŒ`ç?0ÏŒ`ç¿ qÙõ‚׿ qÙõ‚׿ qÙõ‚×?³TDL?³TDL?³TDL¿éjz:¸¿éjz:¸¿éjz:¸¿¢ä Þ¿¢ä Þ¿¢ä Þ?Ê™gÌð?Ê™gÌð?Ê™gÌð¿°7m£4¿°7m£4¿°7m£4?Iª ?Iª ?Iª ¾ÇMS:{…¾ÇMS:{…¾ÇMS:{…¿ |srY½¿ |srY½¿ |srY½?ÚŽZïcT?ÚŽZïcT?ÚŽZïcT¿¥î$Åÿ¿¥î$Åÿ¿¥î$Åÿ?€†ì3»?€†ì3»?€†ì3»>òp¶¥vF“>òp¶¥vF“>òp¶¥vF“¿Ä·•Ç¿Ä·•Ç¿Ä·•Ç?ýT¶l,?ýT¶l,?ýT¶l,¿ð^~Ë%?>ð^~Ë%?>ð^~Ë%?? Vn3? Vn3? Vn3¿Q¿¿Q¿¿Q¿?»ànj¥?»ànj¥?»ànj¥¿—}—a’¿—}—a’¿—}—a’¾¤, QÓó¾¤, QÓó¾¤, QÓó?ñÜ]zâ?ñÜ]zâ?ñÜ]zâ¿ œŽoj¿ œŽoj¿ œŽoj? â«øžöh? â«øžöh? â«øžöh¾ùý*eêí¾ùý*eêí¾ùý*eêí¾é¬ä_:ç¾é¬ä_:ç¾é¬ä_:ç?ªy-f'¥?ªy-f'¥?ªy-f'¥¿ BLX=¿ BLX=¿ BLX=?¯ÁÆј¼?¯ÁÆј¼?¯ÁÆј¼¾çßIèóO ¾çßIèóO ¾çßIèóO ¾õGز¾õGز¾õGز?ÙcåÿfP?ÙcåÿfP?ÙcåÿfP¿qñ¸7ب¿qñ¸7ب¿qñ¸7ب>þFOÒ@$ä>þFOÒ@$ä>þFOÒ@$ä¾»ÞÏXJ‘B¾»ÞÏXJ‘B¾»ÞÏXJ‘B¾ú:ÿéÓÞ¾ú:ÿéÓÞ¾ú:ÿéÓÞ?ÿÛñ‡£>?ÿÛñ‡£>?ÿÛñ‡£>¿ÆÁÒ¡ O¿ÆÁÒ¡ O¿ÆÁÒ¡ O>ô¼&ROÒ>ô¼&ROÒ>ô¼&ROÒ>×›ow¢T>×›ow¢T>×›ow¢T¾üõñ¨Ï¾üõñ¨Ï¾üõñ¨Ï?„BÌƸk?„BÌƸk?„BÌƸk¿Bµ„"i¿Bµ„"i¿Bµ„"i>é¤|‰Qoç>é¤|‰Qoç>é¤|‰Qoç>æÂl1>æÂl1>æÂl1¾ýìé(ýìé(ýìé(î€?´š!…Ù?´š!…Ù?´š!…Ù¾ú 7ç‡ñG¾ú 7ç‡ñG¾ú 7ç‡ñG>Ùãê‚„8û>Ùãê‚„8û>Ùãê‚„8û>î,(74>î,(74>î,(74¾ý©[Ît݈¾ý©[Ît݈¾ý©[Ît݈>ÿ”3p³>ÿ”3p³>ÿ”3p³¾ô‹Ò¯à]T¾ô‹Ò¯à]T¾ô‹Ò¯à]T>¸Ë×’Q¶˜>¸Ë×’Q¶˜>¸Ë×’Q¶˜>ñe'ͤ•>ñe'ͤ•>ñe'ͤ•¾üœ=¨É›Ç¾üœ=¨É›Ç¾üœ=¨É›Ç>ûØ£¼ØXU>ûØ£¼ØXU>ûØ£¼ØXU¾ï´uˆýÝ£¾ï´uˆýÝ£¾ï´uˆýÝ£¾Á€‚÷»¾Á€‚÷»¾Á€‚÷»>ò£˜#ƒò>ò£˜#ƒò>ò£˜#ƒò¾û* §wê¾û* §wê¾û* §wê>øjýH·?>øjýH·?>øjýH·?¾èôùú'ž¾èôùú'ž¾èôùú'ž¾ÒüV[4þ3¾ÒüV[4þ3¾ÒüV[4þ3>óDÖ¦üw>óDÖ¦üw>óDÖ¦üw¾ùfœl˜•p¾ùfœl˜•p¾ùfœl˜•p>õi¶3˜œ\>õi¶3˜œ\>õi¶3˜œ\¾â¡œ}o¾â¡œ}o¾â¡œ}o¾ÙúhbƒÕø¾ÙúhbƒÕø¾ÙúhbƒÕø>ó ™*ÜÄ>ó ™*ÜÄ>ó ™*Üľ÷¬9œçp¶¾÷¬9œçp¶¾÷¬9œçp¶>òã´8¹6>òã´8¹6>òã´8¹6¾Û\µ>“â˾Û\µ>“â˾Û\µ>“â˾Þ#tŒ-b9¾Þ#tŒ-b9¾Þ#tŒ-b9>òŽmŒïýÔ>òŽmŒïýÔ>òŽmŒïýÔ¾ö à$\‡¾ö à$\‡¾ö à$\‡>ðÜÀLxŸ¾>ðÜÀLxŸ¾>ðÜÀLxŸ¾¾Õ,£ÙI>¾Õ,£ÙI>¾Õ,£ÙI>¾à,—7#¾à,—7#¾à,—7#>ñÚ„üºU>ñÚ„üºU>ñÚ„üºU¾ô‘˜Ì„{ò¾ô‘˜Ì„{ò¾ô‘˜Ì„{ò>î¢BJüos>î¢BJüos>î¢BJüos¾ÑZ² Mº¶¾ÑZ² Mº¶¾ÑZ² Mº¶¾àüêò…¾àüêò…¾àüêò…>ðþ; L¿>ðþ; L¿>ðþ; L¿¾óJFŒ”¯‹¾óJFŒ”¯‹¾óJFŒ”¯‹>ìpdý²ç>ìpdý²ç>ìpdý²ç¾Ï3ß¼¨¾¾Ï3ß¼¨¾¾Ï3ß¼¨¾¾Þ‹c@™X¾Þ‹c@™X¾Þ‹c@™X>ð¿ÚI&>ð¿ÚI&>ð¿ÚI&¾ò3\R¥¾ò3\R¥¾ò3\R¥>ë 4äúo>ë 4äúo>ë 4äúo¾ÏNhX •ˆ¾ÏNhX •ˆ¾ÏNhX •ˆ¾Û¸Ô¯S¾Û¸Ô¯S¾Û¸Ô¯S>íé®,"=>íé®,"=>íé®,"=¾ñEÿªË…¾ñEÿªË…¾ñEÿªË…>êX5ß >êX5ß >êX5ß ¾ÑHH"ö ¾ÑHH"ö ¾ÑHH"ö ¾×°åz °¾×°åz °¾×°åz °>ë7ï¹>ë7ï¹>ë7ï¹¾ðt®¥@Œ ¾ðt®¥@Œ ¾ðt®¥@Œ >ê2ψø >ê2ψø >ê2ψø ¾ÔH'Õ#NÁ¾ÔH'Õ#NÁ¾ÔH'Õ#NÁ¾ÒŸù¬¾ÒŸù¬¾ÒŸù¬>èìu<Š>èìu<Š>èìu<Š¾ïZ!~„[¾ïZ!~„[¾ïZ!~„[>ês ßZù>ês ßZù>ês ßZù¾ØpˆÉqP¾ØpˆÉqP¾ØpˆÉqP¾ÈQ$68²K¾ÈQ$68²K¾ÈQ$68²K>åâ¦?è„_>åâ¦?è„_>åâ¦?è„_¾í®—|ß‹"¾í®—|ß‹"¾í®—|ß‹">êç}!½>êç}!½>êç}!½¾Ý€Á ¨W¾Ý€Á ¨W¾Ý€Á ¨W¾²³ÁÍF#…¾²³ÁÍF#…¾²³ÁÍF#…>âQ¦å°…h>âQ¦å°…h>âQ¦å°…h¾ë­ÄzÂiz¾ë­ÄzÂiz¾ë­ÄzÂiz>ëRa2PæÙ>ëRa2PæÙ>ëRa2PæÙ¾á‘+˜ì„¾á‘+˜ì„¾á‘+˜ì„>¯{Œˆ Z>¯{Œˆ Z>¯{Œˆ Z>Ü0¯r‚üï>Ü0¯r‚üï>Ü0¯r‚üï¾é§Å‰a¾é§Å‰a¾é§Å‰a>ëhP×h>ëhP×h>ëhP×h¾än%¿o¾än%¿o¾än%¿o>ʶÛg9Ž>ʶÛg9Ž>ʶÛg9Ž>Ò;\Òøý>Ò;\Òøý>Ò;\Òøý¾å¥G¢Ë½¾å¥G¢Ë½¾å¥G¢Ë½>êÍ«+ܱ|>êÍ«+ܱ|>êÍ«+ܱ|¾ç³€ìU‰¾ç³€ìU‰¾ç³€ìU‰>×X´kT>×X´kT>×X´kT>ºáâÿ<$Â>ºáâÿ<$Â>ºáâÿ<$¾á›Nò$ü¾á›Nò$ü¾á›Nò$ü>éøó Š>éøó Š>éøó Š¾èßyu¾èßyu¾èßyu>à— dwfÎ>à— dwfÎ>à— dwfξ¸t[¦Mc¾¸t[¦Mc¾¸t[¦Mc¾Ö¡å‰Ý¾Ö¡å‰Ý¾Ö¡å‰Ý>åí¯¥39I>åí¯¥39I>åí¯¥39I¾éx œ·É¾éx œ·É¾éx œ·É>äêˆçR$>äêˆçR$>äêˆçR$¾Ó ŸèúC9¾Ó ŸèúC9¾Ó ŸèúC9¾Á"Óµ€–¾Á"Óµ€–¾Á"Óµ€–>àé, Ëv>àé, Ëv>àé, Ëv¾è2ñ`ñô¾è2ñ`ñô¾è2ñ`ñô>çðß+n¥l>çðß+n¥l>çðß+n¥l¾àPbþƒ—¾àPbþƒ—¾àPbþƒ—>½Þ^¨¤¨M>½Þ^¨¤¨M>½Þ^¨¤¨M>ÓÓˆE¥±9>ÓÓˆE¥±9>ÓÓˆE¥±9¾äzú'žäzú'žäzú'Å>èÍ"ðSç>èÍ"ðSç>èÍ"ðSç¾å¥¼•òb¾å¥¼•òb¾å¥¼•òb>Ø 1„u >Ø 1„u >Ø 1„u >¢[q:%Ê>¢[q:%Ê>¢[q:%ʾÛä„Í°|¾Ûä„Í°|¾Ûä„Í°|>æ›l³ä…>æ›l³ä…>æ›l³ä…¾èŸnC8w¾èŸnC8w¾èŸnC8w>ãrçõá¬>ãrçõá¬>ãrçõᬾÑ@ÏXGî¾Ñ@ÏXGî¾Ñ@ÏXGî¾ÂÇÇ9`Ø]¾ÂÇÇ9`Ø]¾ÂÇÇ9`Ø]>à¯jÛáêá>à¯jÛáêá>à¯jÛáêá¾çíÿE8õ¦¾çíÿE8õ¦¾çíÿE8õ¦>ècŠf¨>ècŠf¨>ècŠf¨¾áó(Žžùª¾áó(Žžùª¾áó(Žžùª>ɸüÞ" >ɸüÞ" >ɸüÞ" >ËÍž=F â>ËÍž=F â>ËÍž=F â¾â{„f,“ ¾â{„f,“ ¾â{„f,“ >èûp#èל>èûp#èל>èûp#èל¾è¨‘áœÖ¾è¨‘áœÖ¾è¨‘áœÖ>á”´E4{>á”´E4{>á”´E4{¾Æ‘¿Ú¯š¦¾Æ‘¿Ú¯š¦¾Æ‘¿Ú¯š¦¾ÏÚãÜ@ D¾ÏÚãÜ@ D¾ÏÚãÜ@ D>ãšRøö)>ãšRøö)>ãšRøö)¾ê)`äm|/¾ê)`äm|/¾ê)`äm|/>éÜpºµÁä>éÜpºµÁä>éÜpºµÁä¾â¶]D:ó³¾â¶]D:ó³¾â¶]D:ó³>ʃ°[>ʃ°[>ʃ°[>Λ / R>Λ / R>Λ / R¾ä"w٣韾ä"w٣韾ä"wÙ£éŸ>ë¶É~þ0>ë¶É~þ0>ë¶É~þ0¾ì^G¶Q,Ò¾ì^G¶Q,Ò¾ì^G¶Q,Ò>åÊ„ãËØ°>åÊ„ãËØ°>åÊ„ãËØ°¾Òò²hŸñؾÒò²hŸñؾÒò²hŸñؾƗ¢ 2 ¾Æ—¢ 2 ¾Æ—¢ 2 >ãæêƒ7,>ãæêƒ7,>ãæêƒ7,¾í¼ö1›€¾í¼ö1›€¾í¼ö1›€>ðN3dΠ>ðN3dΠ>ðN3dΠ¾ëŽîCÑP–¾ëŽîCÑP–¾ëŽîCÑP–>Þ÷‘›>—ê>Þ÷‘›>—ê>Þ÷‘›>—ê> †ßŸ> †ßŸ> †ßŸ¾âG÷ìf¾âG÷ìf¾âG÷ìf>ð”êÅ>ð”êÅ>ð”êžó°‹_Ðün¾ó°‹_Ðün¾ó°‹_Ðün>òÓŒO³8Í>òÓŒO³8Í>òÓŒO³8;êÇÂRmþ¾êÇÂRmþ¾êÇÂRmþ>Ñr\õK>Ñr\õK>Ñr\õK>Ûió-N´>Ûió-N´>Ûió-N´¾ñ tfsÐ̾ñ tfsÐ̾ñ tfsÐÌ>ù mjÿƒT>ù mjÿƒT>ù mjÿƒT¾ü·¸ùž<í¾ü·¸ùž<í¾ü·¸ùž<í>ùy —îGˆ>ùy —îGˆ>ùy —îGˆ¾îëœGz4¾îëœGz4¾îëœGz4¾¤ºà’…Q¾¤ºà’…Q¾¤ºà’…Q>ôû¹"ÆD¦>ôû¹"ÆD¦>ôû¹"ÆD¦¿hi™ìn¿hi™ìn¿hi™ìn?,à9ló²?,à9ló²?,à9l󲿎Wi d¿ŽWi d¿ŽWi d?ûÖ TÊ?ûÖ TÊ?ûÖ TʾەágmP†¾Û•ágmP†¾Û•ágmP†¿8'6@O ¿8'6@O ¿8'6@O ¾Ð NØÇþ¾Ð NØÇþ¾Ð NØÇþ?ýYTTÆ?ýYTTÆ?ýYTTÆ¿5þ@dÏ¿5þ@dÏ¿5þ@dÏ? ‚pî‘.A? ‚pî‘.A? ‚pî‘.A¿í-—ß{ò¿í-—ß{ò¿í-—ß{ò>ëèø~º7–>ëèø~º7–>ëèø~º7–>ÈhuÚÛ…>ÈhuÚÛ…>ÈhuÚÛ…¾ížËÆ}¾ížËÆ}¾ížËÆ}>ô=Õµ¡‘>ô=Õµ¡‘>ô=Õµ¡‘¾óŽ^J ¡¾óŽ^J ¡¾óŽ^J ¡>ì7Lyæp>ì7Lyæp>ì7Lyæp¾Ø+¹hñ«¾Ø+¹hñ«¾Ø+¹hñ«¾Á¯¤(Š«¾Á¯¤(Š«¾Á¯¤(Š«>àÿ3§ZÐ&>àÿ3§ZÐ&>àÿ3§ZÐ&¾æÚ¼xo¾æÚ¼xo¾æÚ¼xo>åG:Ý›n>åG:Ý›n>åG:Ý›n¾ÛU´æÐb¾ÛU´æÐb¾ÛU´æÐb>·Å¶ÁëŒ>·Å¶ÁëŒ>·Å¶ÁëŒ>Ìû :þ¿>Ìû :þ¿>Ìû :þ¿¾ÛÈ¥R2L¾ÛÈ¥R2L¾ÛÈ¥R2L>Þ…üõ”>Þ…üõ”>Þ…üõ”¾ÖÛ¢²tqL¾ÖÛ¢²tqL¾ÖÛ¢²tqL>ÀËótăD>ÀËótăD>ÀËótăD>½[D»#ÑÍ>½[D»#ÑÍ>½[D»#Ñ;ÒÏ}1uع¾ÒÏ}1uع¾ÒÏ}1uع>Ö^7ögU£>Ö^7ögU£>Ö^7ögU£¾Ño£c{Ü€¾Ño£c{Ü€¾Ño£c{Ü€>º4¢—;ë«>º4¢—;ë«>º4¢—;ë«>¶ë=Jýwå>¶ë=Jýwå>¶ë=Jýwå¾ÍEšªó,ñ¾ÍEšªó,ñ¾ÍEšªó,ñ>ÑN¨æÔŸ>ÑN¨æÔŸ>ÑN¨æÔŸ¾ÈÚgQì)¾ÈÚgQì)¾ÈÚgQì)>ª&:?¾">ª&:?¾">ª&:?¾">¹¢`»¸Ð >¹¢`»¸Ð >¹¢`»¸Ð ¾É*µ}W‡|¾É*µ}W‡|¾É*µ}W‡|>ÉÞ®UM! >ÉÞ®UM! >ÉÞ®UM! ¾¾ò¤Evc@¾¾ò¤Evc@¾¾ò¤Evc@¾x<$çmSò¾x<$çmSò¾x<$çmSò>¾«jIq³¼>¾«jIq³¼>¾«jIq³¼¾Åí/š¤«L¾Åí/š¤«L¾Åí/š¤«L>‰Èe"©>‰Èe"©>‰Èe"©¾©U1tÙã ¾©U1tÙã ¾©U1tÙã ¾­ö¼‡x쪾­ö¼‡x쪾­ö¼‡xìª>ÀÈñâ#ÀÈñâ#ÀÈñâ#³e¿¥>³e¿¥>³e¿¥>‘ʈ&4eê>‘ʈ&4eê>‘ʈ&4e꾸`…WÓþ¾¸`…WÓþ¾¸`…WÓþ>¿Àõdž>¿Àõdž>¿Àõdž¾µ—•ŸÂq¾µ—•ŸÂq¾µ—•ŸÂq>{á®Ó¿Ç>{á®Ó¿Ç>{á®Ó¿Ç>±Î…±dyb>±Î…±dyb>±Î…±dyb¾º÷×±V¾º÷×±V¾º÷×±V>µqÀ8QE>µqÀ8QE>µqÀ8QE¾“Oq•)H¾“Oq•)H¾“Oq•)H¾«ÿÆ\䨾«ÿÆ\䨾«ÿÆ\ä¨>·I=c?†>·I=c?†>·I=c?†¾´EÙáƾ´EÙáƾ´EÙáÆ>—TnNÄ¿>—TnNÄ¿>—TnNÄ¿>¦ˆ%ü >¦ˆ%ü >¦ˆ%ü ¾µJL5†%¾µJL5†%¾µJL5†%>²»6n#ð{>²»6n#ð{>²»6n#ð{¾•Ÿ |ã!¾¾•Ÿ |ã!¾¾•Ÿ |ã!¾¾¥N$Ómä=¾¥N$Ómä=¾¥N$Ómä=>³ê[ÐúÊ>³ê[ÐúÊ>³ê[Ðúʾ°ýÙ¥C*¾°ýÙ¥C*¾°ýÙ¥C*>ŽÖŸqÇÂÃ>ŽÖŸqÇÂÃ>ŽÖŸqÇÂÃ>¦­tZ!41>¦­tZ!41>¦­tZ!41¾³3b7\Éq¾³3b7\Éq¾³3b7\Éq>­Ð\ju®é>­Ð\ju®é>­Ð\ju®é¾t#¼èåÝß¾t#¼èåÝß¾t#¼èåÝß¾©ÿ*ü+<¾©ÿ*ü+<¾©ÿ*ü+<>²¯]CE>²¯]CE>²¯]CE¾¨<•N¾ ¾¨<•N¾ ¾¨<•N¾ ¾ƒbeyž5¾ƒbeyž5¾ƒbeyž5>®cO¸‘]Ñ>®cO¸‘]Ñ>®cO¸‘]Ѿ±¶@`uuv¾±¶@`uuv¾±¶@`uuv> ]õ â> ]õ â> ]õ â>›Áù[ð+>›Áù[ð+>›Áù[ð+¾±;^¦ãw¾±;^¦ãw¾±;^¦ãw>®ïK®@>®ïK®@>®ïK®@¾†:[Në7¾†:[Në7¾†:[Në7¾§Ô¦c¬ [¾§Ô¦c¬ [¾§Ô¦c¬ [>²7¢j×>>²7¢j×>>²7¢j×>¾¦O*ѳ’Ž¾¦O*ѳ’Ž¾¦O*ѳ’Ž¾¼$`©¾¼$`©¾¼$`©>°<è7æ½>°<è7æ½>°<è7æ½¾°~×Ñò­.¾°~×Ñò­.¾°~×Ñò­.>‘„Y’h5¿>‘„Y’h5¿>‘„Y’h5¿>¦B’£^þË>¦B’£^þË>¦B’£^þ˾²DR!”‚?¾²DR!”‚?¾²DR!”‚?>¦Ûà‹û>¦Ûà‹û>¦Ûà‹û>‘;!bèe >‘;!bèe >‘;!bèe ¾°ÐkäªÐ¾°ÐkäªÐ¾°ÐkäªÐ>°8’fi>°8’fi>°8’fi¾†b¥ùšÔ¾†b¥ùšÔ¾†b¥ùšÔ¾©ð1x,ÿɾ©ð1x,ÿɾ©ð1x,ÿÉ>²z¢§TT >²z¢§TT >²z¢§TT ¾¢@ƒ¿%¬u¾¢@ƒ¿%¬u¾¢@ƒ¿%¬u¾žå1Ue׳¾žå1Ue׳¾žå1Ue׳>²iˆ¶!™>²iˆ¶!™>²iˆ¶!™¾¬xálÒ¾¬xálÒ¾¬xálÒ¾©âNÙÐi¾©âNÙÐi¾©âNÙÐi>°õa@ÓÏ>°õa@ÓÏ>°õa@ÓϾ±W.j‚pe¾±W.j‚pe¾±W.j‚pe>Œâ¥Üo>Œâ¥Üo>Œâ¥Üo>ª²¤hõ+>ª²¤hõ+>ª²¤hõ+¾³ {”¤»¾³ {”¤»¾³ {”¤»> ñþîü²> ñþîü²> ñþîü²>¢ûû”ÆÂw>¢ûû”ÆÂw>¢ûû”ÆÂw¾³d‡Ä’Š¾³d‡Ä’Š¾³d‡Ä’Š>¨ý+Ôâj8>¨ý+Ôâj8>¨ý+Ôâj8>•–ìÌ•–ìÌ•–ì̯&ë39 2>¯&ë39 2>¯&ë39 2>vsîYÖ >vsîYÖ >vsîYÖ ¾±D»~µ±¾±D»~µ±¾±D»~µ±>±Æ@çÐy>±Æ@çÐy>±Æ@çÐy¾‚'¤ÍÀœä¾‚'¤ÍÀœä¾‚'¤ÍÀœä¾®Òo¬ü¾®Òo¬ü¾®Òo¬ü>³7T’^ü>³7T’^ü>³7T’^ü¾•ÿ"óÙDʾ•ÿ"óÙDʾ•ÿ"óÙDʾªº%ˆýÞŸ¾ªº%ˆýÞŸ¾ªº%ˆýÞŸ>´ Æ’?R«>´ Æ’?R«>´ Æ’?R«¾ z¨ÖˆAȾ z¨ÖˆAȾ z¨ÖˆAȾ¦ zùÿIs¾¦ zùÿIs¾¦ zùÿIs>´sÚ|%z>´sÚ|%z>´sÚ|%z¾¤ýh;ŒÛb¾¤ýh;ŒÛb¾¤ýh;ŒÛb¾¢ÊȬ¡Ç¾¢ÊȬ¡Ç¾¢ÊȬ¡Ç>´Œ|Â¥Ë>´Œ|Â¥Ë>´Œ|¥˾¨™‡Žä¬d¾¨™‡Žä¬d¾¨™‡Žä¬d¾žÐ)„á~ò¾žÐ)„á~ò¾žÐ)„á~ò>´z'ˆ J>´z'ˆ J>´z'ˆ J¾«hª‹Ž¾«hª‹Ž¾«hª‹Ž¾™,&Á§¾™,&Á§¾™,&Á§>´U[¹Ma>´U[¹Ma>´U[¹Ma¾­ƒRe&6¾­ƒRe&6¾­ƒRe&6¾”Ë»º˜ ¾”Ë»º˜ ¾”Ë»º˜ >´1ÿ™Ù6¿>´1ÿ™Ù6¿>´1ÿ™Ù6¿¾¯Fü¾¯Fü¾¯Fü¾‘¿íOM²‰¾‘¿íOM²‰¾‘¿íOM²‰>´…|NL€>´…|NL€>´…|NL€¾¯úæ`HØ®¾¯úæ`HØ®¾¯úæ`HØ®¾¨É0¾¨É0¾¨É0>´ Aª]×>´ Aª]×>´ Aª]×¾°;“Äí÷˜¾°;“Äí÷˜¾°;“Äí÷˜¾mÅŸEM¯¾mÅŸEM¯¾mÅŸEM¯>´=Û‚Zc>´=Û‚Zc>´=Û‚Zc¾°?J˜TGƾ°?J˜TGƾ°?J˜TGƾ²ÿn_x¾²ÿn_x¾²ÿn_x>´uËH®‡O>´uËH®‡O>´uËH®‡O¾°Éñ0‚²¾°Éñ0‚²¾°Éñ0‚²¾’ù¡/Äh¾’ù¡/Äh¾’ù¡/Äh>´Ã»ü~"Ž>´Ã»ü~"Ž>´Ã»ü~"Ž¾¯+tô•ï¾¯+tô•ï¾¯+tô•ï¾–}B:|i¾–}B:|i¾–}B:|i>µÕ8mÚ >µÕ8mÚ >µÕ8mÚ ¾­Á²§4kݾ­Á²§4kݾ­Á²§4kݾ›*Ðõ#´›¾›*Ðõ#´›¾›*Ðõ#´›>µ~ù:Î&>µ~ù:Î&>µ~ù:Î&¾«É D{fi¾«É D{fi¾«É D{fi¾ sÏT† ¾ sÏT† ¾ sÏT† >µÓ²Ç*->µÓ²Ç*->µÓ²Ç*-¾©3Œóæ¾¾©3Œóæ¾¾©3Œóæ¾¾£Çvv|ξ£Çvv|ξ£Çvv|Î>¶ -ÙYܧ>¶ -ÙYܧ>¶ -ÙYܧ¾¥ôs‘†¦º¾¥ôs‘†¦º¾¥ôs‘†¦º¾§w¶ã0÷™¾§w¶ã0÷™¾§w¶ã0÷™>¶yK=T>¶yK=T>¶yK=T¾¢"èÇC±¾¢"èÇC±¾¢"èÇC±¾«d‰«ÿNû¾«d‰«ÿNû¾«d‰«ÿNû>µÚ7ùJ²>µÚ7ùJ²>µÚ7ùJ²¾š±?ø¡N¨¾š±?ø¡N¨¾š±?ø¡N¨¾¯eÉàÈA¾¯eÉàÈA¾¯eÉàÈA>µHf[xÏ>µHf[xÏ>µHf[xϾð³]‘››¾ð³]‘››¾ð³]‘››¾±¥‚³’IF¾±¥‚³’IF¾±¥‚³’IF>´J1.D)<>´J1.D)<>´J1.D)<¾o¼Y÷ë0¾o¼Y÷ë0¾o¼Y÷ë0¾³n Îê.¾³n Îê.¾³n Îê.>²ÎSe¿^(>²ÎSe¿^(>²ÎSe¿^(>‚2Ü Ö8>‚2Ü Ö8>‚2Ü Ö8¾´íBä½æ”¾´íBä½æ”¾´íBä½æ”>°Ç‚ÑØ>°Ç‚ÑØ>°Ç‚ÑØ>–å÷‡./•>–å÷‡./•>–å÷‡./•¾¶,ð5}÷¾¶,ð5}÷¾¶,ð5}÷>¬]RÇ—³”>¬]RÇ—³”>¬]RÇ—³”>¢}­Ì”6>¢}­Ì”6>¢}­Ì”6¾¶‹¿`ÿݾ¶‹¿`ÿݾ¶‹¿`ÿÝ>¦ ¢R™’ñ>¦ ¢R™’ñ>¦ ¢R™’ñ>©dý "Æ>>©dý "Æ>>©dý "Æ>¾¶kF6ô_¾¶kF6ô_¾¶kF6ô_>S^§hÝÀ>S^§hÝÀ>S^§hÝÀ>¯ÔºD7ïU>¯ÔºD7ïU>¯ÔºD7ïU¾µ‡‚ !€¾µ‡‚ !€¾µ‡‚ !€>‰¥o”>‰¥o”>‰¥o”>²¸@ã9?>²¸@ã9?>²¸@ã9?¾³Í¥¾‘Q¾³Í¥¾‘Q¾³Í¥¾‘Q¾s¡ŒH Pê¾s¡ŒH Pê¾s¡ŒH Pê>´ëZ9=4M>´ëZ9=4M>´ëZ9=4M¾±8$žkz]¾±8$žkz]¾±8$žkz]¾—*†Ë4¢¾—*†Ë4¢¾—*†Ë4¢>¶VË`>¶VË`>¶VË`¾«š½j›}¾«š½j›}¾«š½j›}¾¤Œyך®C¾¤Œyך®C¾¤Œyך®C>¶Ï†h»/>¶Ï†h»/>¶Ï†h»/¾£Fâت•¾£Fâت•¾£Fâت•¾¬Þ=lо¬Þ=lо¬Þ=lÐ>¶9 niò >¶9 niò >¶9 niò ¾“‚ŸEY7±¾“‚ŸEY7±¾“‚ŸEY7±¾²›úàËY¾²›úàËY¾²›úàËY>´‚GnœŽD>´‚GnœŽD>´‚GnœŽD>Q?½»tö>Q?½»tö>Q?½»tö¾´Ã÷ÁÇ™¾´Ã÷ÁÇ™¾´Ã÷ÁÇ™>±«÷˸Q>±«÷˸Q>±«÷˸Q>–']ù@BÅ>–']ù@BÅ>–']ù@Bž¶v¸2e뾶v¸2e뾶v¸2eë>«–hÖל@>«–hÖל@>«–hÖל@>¥@?° 7>¥@?° 7>¥@?° 7¾¶îÑùàÁ’¾¶îÑùàÁ’¾¶îÑùàÁ’>¢¢¢®j´E é>®j´E é>®j´E 龶ÌÀl“\¾¶ÌÀl“\¾¶ÌÀl“\>42·j¶P>42·j¶P>42·j¶P>²÷þ•Y›>²÷þ•Y›>²÷þ•Y›¾³×—ï¡:¾³×—ï¡:¾³×—ï¡:¾€}Á÷‘ÄB¾€}Á÷‘ÄB¾€}Á÷‘ÄB>µœoÄ¿if>µœoÄ¿if>µœoÄ¿if¾°Tëö¬¿£¾°Tëö¬¿£¾°Tëö¬¿£¾žò®^‹y¼¾žò®^‹y¼¾žò®^‹y¼>¶ê®97>¶ê®97>¶ê®97¾§mèjõL˾§mèjõL˾§mèjõL˾©üM fý¾©üM fý¾©üM fý>¶¼:ýì8>¶¼:ýì8>¶¼:ýì8¾™Ŧª#¾™Ŧª#¾™Ŧª#¾±sz„ø†:¾±sz„ø†:¾±sz„ø†:>µm6³{¤>µm6³{¤>µm6³{¤¾S°'›F²é¾S°'›F²é¾S°'›F²é¾´Å‚ѽßw¾´Å‚ѽßw¾´Å‚ѽßw>±× ©S7>±× ©S7>±× ©S7>–îïûRÝ@>–îïûRÝ@>–îïûRÝ@¾¶®0ìájÿ¾¶®0ìájÿ¾¶®0ìájÿ>ª¼5 :ñ >ª¼5 :ñ >ª¼5 :ñ >¦àìT)Hí>¦àìT)Hí>¦àìT)Hí¾¶þaäÓؾ¶þaäÓؾ¶þaäÓØ>Ÿ€^ÏrÜ>Ÿ€^ÏrÜ>Ÿ€^ÏrÜ>°eªüLÛ>°eªüLÛ>°eªüLÛ¾µŸ³;Ô›Õ¾µŸ³;Ô›Õ¾µŸ³;Ô›Õ>{;NO>{;NO>{;NO>´;WD>´;WD>´;WD¾²ˆûîŽFž¾²ˆûîŽFž¾²ˆûîŽFž¾“µ÷ ˜é¾“µ÷ ˜é¾“µ÷ ˜é>¶¨²Äßò>¶¨²Äßò>¶¨²Äßò¾ªf’j½V¾ªf’j½V¾ªf’j½V¾«eœ©è;¾«eœ©è;¾«eœ©è;>¼/9GüX>¼/9GüX>¼/9GüXhealpy-1.8.1/healpy/data/pixel_window_n4096.fits0000650000175000017530000102060011705033043022034 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:12 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 16385 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 4096 / Resolution parameter for HEALPIX MAX-LPOL= 16384 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 4096 COMMENT for multipoles in range [0,16384] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð?ïÿÿþB%b?ïÿÿúÃÄì?ïÿÿý–ç?ïÿÿö(‚ƒ?ïÿÿøiT}?ïÿÿíÎx’?ïÿÿðJŒ?ïÿÿæ/ƒ?ïÿÿèoè}?ïÿÿÚOçÅ?ïÿÿܹ¾?ïÿÿÎ7ôq?ïÿÿÐxÆi?ïÿÿ¿™ñò?ïÿÿÁÚÃé?ïÿÿ®¨¸y?ïÿÿ°éŠo?ïÿÿ›²?ïÿÿX„?ïÿÿ…¿¿?ïÿÿˆ‘?ïÿÿn2Àï?ïÿÿps’à?ïÿÿSÀÙž?ïÿÿV«Ž?ïÿÿ7erŽ?ïÿÿ9¦D{?ïÿÿÐ<š?ïÿÿ…?ïÿþõ±š?ïÿþ÷Hƒ‚?ïÿþϘÂ9?ïÿþÑÙ”?ïÿþ¦Y8ó?ïÿþ¨š Ö?ïÿþyÐeX?ïÿþ|78?ïÿþJ´?ïÿþLôêê?ïÿþcD€?ïÿþ¤Y?ïÿýàUã?ïÿýâ–µd?ïÿý¥öý)?ïÿý¨7Îú?ïÿýg;-p?ïÿýi{ÿ?ïÿÝ„¾È?ïÿ݃ŎU?ïÿݪ?ïÿÝBÓ.?ïÿÜ3-‰?ïÿÜ’sý?ïÿÜÑ»)?ïÿÜŠ?ïÿÛLa¿?ïÿÛ1!?ïÿÚ}ï?ïÿÚ¾¾l?ïÿÙzd?ïÿÙBI¢?ïÿØ[E?ïÿØ›áo?ïÿÖ÷?ïÿÖùÝЧ?ïÿÕçÜWž?ïÿÕê&£?ïÿÔÕ\,†?ïÿÔלûw?ïÿÓÀJÅÏ?ïÿÓ‹”­?ïÿÒ¨Zº?ïÿÒªšÏ„?ïÿÑŽ{F¤?ïÿѼZ?ïÿÐrd¼H?ïÿÐt¥Šê?ïÿÏT%öƒ?ïÿÏVfÅ?ïÿÎ4!Õ¥?ïÿÎ6b¤?ïÿÍô§Ô?ïÿÍ5v9?ïÿËðXò?ïÿËòX'C?ïÿÊÌP¶‹?ïÿÊΑ„È?ïÿɧ§›?ïÿÉ©èi>?ïÿÈ‚(––?ïÿÈ„id©?ïÿÇ\PcÚ?ïÿÇ^‘1Ù?ïÿÆ6e ã?ïÿÆ8¥ÚÍ?ïÿÅj#(?ïÿŪðý?ïÿÃêߎ?ïÿÃíáN?ïÿÂÆ¢-?ïÿÂÈPoÙ?ïÿÁ¢ s°?ïÿÁ¤JAG?ïÿÀNJW?ïÿÀÙ?ïÿ¿^>ƒÓ?ïÿ¿`QA?ïÿ¾>Ó®?ïÿ¾AÜ?ïÿ½!»Çü?ïÿ½#ü•B?ïÿ¼Ïh?ïÿ¼ Uœš?ïÿºïEš¯?ïÿºñ†gÍ?ïÿ¹Ú·²?ïÿ¹Ü΄½?ïÿ¸Éd‚?ïÿ¸Ë¤Òy?ïÿ·‰ù»Û?ïÿ·Œ:ˆ¼?ïÿ¶-ÔÑø?ïÿ¶0žÁ?ïÿ´Î™Úb?ïÿ´ÐÚ§?ïÿ³l4¦>?ïÿ³nurÕ?ïÿ²àŸž?ïÿ² !l?ïÿ°žªÿN?ïÿ° ë˲?ïÿ¯3±~A?ïÿ¯5òJŒ?ïÿ­Æ¢Õ?ïÿ­ÈDo?ïÿ¬UÁ.§?ïÿ¬Xú¾?ïÿªâíM ?ïÿªå.?ïÿ©mÇ[0?ïÿ©p'?ïÿ§öqˆ$?ïÿ§ø²Sí?ïÿ¦|ÇJ?ïÿ¦hø?ïÿ¥D;ê?ïÿ¥…}?ïÿ£ƒï­¨?ïÿ£†0y ?ïÿ¢Æ…Y?ïÿ¢P·?ïÿ ƒþF?ïÿ †?Jˆ?ïÿŸ² »?ïÿŸókâ?ïÿ~÷¾?ïÿ€ZÂÊ?ïÿ›ù?ïÿ›û]Ï?ïÿšsPÇ¿?ïÿšu‘’”?ïÿ˜ì…ø”?ïÿ˜îÆÃN?ïÿ—d÷¸º?ïÿ—g8ƒX?ïÿ•Ý+ð±?ïÿ•ßl»4?ïÿ”TǧÑ?ïÿ”Wr7?ïÿ’Ì-´µ?ïÿ’În?ïÿ‘CÊÔ¬?ïÿ‘F žÛ?ïÿ»Am¢?ïÿ½‚7¶?ïÿŽ3 EV?ïÿŽ5NN?ïÿŒ«Òú?ïÿŒ­Ðœ×?ïÿ‹$ÞÖ?ïÿ‹'h—?ïÿ‰ž²’É?ïÿ‰ ó\o?ïÿˆL$?ïÿˆŒí˜?ïÿ†NA?ïÿ†PAØ«?ïÿ„’“‹à?ïÿ„”ÔU*?ïÿ‚ÔTru?ïÿ‚Ö•; ?ïÿìÚ²?ïÿ-£¾?ïÿN¢æµ?ïÿP㯡?ïÿ}‡Çk?ïÿ}ŠV7?ïÿ{¾Þr?ïÿ{À_§?ïÿyñ†è ?ïÿyóÇ°”?ïÿx"—Vï?ïÿx$ØZ?ïÿvQ#|?ïÿvScãÅ?ïÿt}8*G?ïÿtxòp?ïÿr§ã,?ïÿr©G«4?ïÿpÎ’ÿz?ïÿpÐÓÇa?ïÿnóám´?ïÿnö"5y?ïÿm9×?ïÿmzž»?ïÿk8—-?ïÿk:×æ¯?ïÿiWõÂŒ?ïÿiZ6‰ì?ïÿgu³–¦?ïÿgwô]ä?ïÿe‘¸²_?ïÿe“ùy{?ïÿc¬8­¢?ïÿc®ytœ?ïÿaÅ\}¹?ïÿaÇD?ïÿ_Ýlˆ?ïÿ_ßF3=?ïÿ]ó}Q?ïÿ]õ½äã?ïÿ\ø„?ïÿ\ 8Êô?ïÿZP§æ?ïÿZ‘n3?ïÿX0Ç_ƒ?ïÿX3%®?ïÿVCˆG?ïÿVEÉ %?ïÿTU˜ñ?ïÿTWÙ¶ô?ïÿRg9é£?ïÿRiz¯e?ïÿPx{À?ïÿPz¼…­?ïÿN‰pLû?ïÿN‹±w?ïÿL‘â³?ïÿL”#xx?ïÿJ|4 N?ïÿJ~tÑ‚?ïÿHc†d?ïÿHeÀKr?ïÿFGÌ,?ïÿFJ Í?ïÿD)*³B?ïÿD+kx?ïÿB K?ïÿB ÐÍæ?ïÿ?ã!xë?ïÿ?åb=`?ïÿ=¼ Ó?ïÿ=¾N—`?ïÿ;’7Á4?ïÿ;”x…[?ïÿ9e»ßZ?ïÿ9gü£Y?ïÿ76­ƒ®?ïÿ78îG†?ïÿ5 T¼?ïÿ5am?ïÿ2ÑÐ~?ïÿ2ÓV”?ïÿ0š´ô›?ïÿ0œõ·ü?ïÿ.bY¥?ïÿ.dSÞ?ïÿ,''½d?ïÿ,)h€t?ïÿ)êä:?ïÿ)ìT§"?ïÿ'ªãÇ ?ïÿ'­$Š_?ïÿ%i¤ñŠ?ïÿ%kå´!?ïÿ#&wP?ïÿ#(·Þ¾?ïÿ ázÉ?ïÿ ãº×?ïÿšªû?ïÿœë½1?ïÿR3²?ïÿTsà¥?ïÿÔ!?ïÿ Q•ë?ïÿ¼eÌ?ïÿ¾¦Am?ïÿoR– ?ïÿq“X?ïÿ àƒä?ïÿ#!E1?ïÿÑ ÕÒ?ïÿÓa–ö?ïÿ€FŸh?ïÿ‚‡`b?ïÿ .C!?ïÿ 0ƒáâ?ïÿ ÛAõ¸?ïÿ Ý‚¶_?ïÿ‡vŠZ?ïÿ‰·JÖ?ïÿ/i•?ïÿ1ªU`?ïÿ»ªU?ïÿ½ëµ?ïÿDïM­?ïÿG0 ¦?ïþýË5õ;?ïþýÍvµ?ïþûN„€1?ïþûPÅ?Ñ?ïþøÏ% ?ïþøÑBä~?ïþöL¥"0?ïþöNåáv?ïþóÇl~k?ïþóÉ­=ƒ?ïþñ?ˆ»?ïþñAÈÁ¦?ïþî´çX?ïþî·'Ô?ïþì'©´ã?ïþì)êsr?ïþé—ØÇ?ïþéšÇ(?ïþçr½Ý?ïþç³|?ïþäp’‹?ïþärÓI ?ïþáÙ_Æß?ïþáÛ „´?ïþß?ÌNv?ïþßB ?ïþÜ£Ò™¯?ïþܦW&?ïþÚ«q?ïþÚëÙ¹?ïþ×e_ûñ?ïþ×g ¹ ?ïþÔÂå¦?ïþÔÅ%Ë?ïþÒcò?ïþÒ ¤€k?ïþÏwßÖ¸?ïþÏz “B?ïþÌÏeN?ïþÌѥè?ïþÊ%Ed?ïþÊ'OŽ?ïþÇxï4Ê?ïþÇ{/ðÄ?ïþÄ˳U?ïþÄÍ\o?ïþ —?ïþÂáRš?ïþ¿j‹ ?ïþ¿lËÙv?ïþ¼·áÅ?ïþ¼º"€I?ïþºä–?ïþº%Q?ïþ·No²T?ïþ·P°m*?ïþ´—µC1?ïþ´™õý×?ïþ±Þì¡æ?ïþ±á-\[?ïþ¯ ÍÞt?ïþ¯˜¶?ïþ¬7¤e*?ïþ¬9å9?ïþ©_™ ?ïþ©aÙº{?ïþ¦„† 6?ïþ¦†ÆÃÞ?ïþ£¦”§g?ïþ£¨Õ`Û?ïþ ÅØ‹Ã?ïþ ÈE?ïþâ;dÄ?ïþä|Ñ?ïþšûÊ?ïþšþ Eê?ïþ˜½< ?ïþ˜ýô®?ïþ•&÷¢?ïþ•)7É?ïþ’8ŒÈ6?ïþ’:Í€p?ïþGš?ïþIÚ¾?ïþŒT ’t?ïþŒVKJC?ïþ‰]úŽ>?ïþ‰`;EØ?ïþ†eAô?ïþ†g¿ùY?ïþƒj™ÐF?ïþƒlÚ‡u?ïþ€m_ßÀ?ïþ€o –¹?ïþ}màvé?ïþ}p!-¬?ïþzl œó?ïþznJS€?ïþwh‘Ò?ïþwjFH(?ïþtaê‡â?ïþtd+>?ïþqY ûÓ?ïþq[á±½?ïþnOLäÈ?ïþnQšz?ïþkCðò?ïþkE_¦n?ïþh4Ùå®?ïþh7šó?ïþe$Û÷y?ïþe'¬†?ïþbü*r?ïþb<ßH?ïþ^ÿR>T?ïþ_’òó?ïþ[êäN?ïþ[ìI˜µ?ïþXÓù?ïþXÕ_B(?ïþUºž¸@?ïþU¼ßl8?ïþR §ÇÅ?ïþR¢è{…?ïþOp~°9?ïþOr¿c¿?ïþL<±6°?ïþL>ñéü?ïþI÷Ÿm?ïþI8R€?ïþEÌC‘?ïþE΄Cô?ïþB²æ?ïþB‘ó˜¤?ïþ?P=ÿ¶?ïþ?R~²?ïþ<9M?ïþ<Oëu?ïþ8ÉY6?ïþ8ËA #?ïþ5)„,?ïþ5ƒj5ß?ïþ26µ.?ïþ28õß‹?ïþ.éx ?ïþ.븼P?ïþ+™œÝ@?ïþ+›ÝŽ@?ïþ(G5׆?ïþ(IvˆJ?ïþ$ò$ýÆ?ïþ$ôe®O?ïþ!š­-ô?ïþ!œíÞ@?ïþ@ÂÏ=?ïþCL?ïþäTÚk?ïþæ•Š>?ïþ…‚U”?ïþ‡Ã*?ïþ$^M¼?ïþ&žý?ïþÀõöâ?ïþÃ6¥þ?ïþ [Eè?ïþ ]…ÅÇ?ïþ óe‚?ïþ õ¥µ$?ïþ‰L;?ïþ‹Œéf?ïþ%²ª?ïþf`Ñ?ïýÿ®â…ï?ïýÿ±#3Ø?ïýü>‘l?ïýü@ÑÁ?ïýøÌPõô?ïýøΑ£a?ïýõX6Aw?ïýõZvî¥?ïýñâ’þ?ïýñä]?î?ïýîj4ñJ?ïýîluü?ïýêð“é?ïýêòÔ•?ïýçu'?ïýçwg»K?ïýãç|·?ïýãéF(ª?ïýàTuÙO?ïýàV¶…?ïýܾì!7?ïýÜÁ,̪?ïýÙ&w¢O?ïýÙ(¸M?ïýÕ‹'°ü?ïýÕh[í?ïýÑìïÎp?ïýÑï0y?ïýÎKÚq?ïýÎNÁß?ïýʧûÓ@?ïýʪ<}m?ïýÇN«¡?ïýÇUŒ?ïýÃW핧?ïýÃZ.?P?ïý¿«Ø,?ïý¿®¯“?ïý»ý(&?ïý»ÿSÑK?ïý¸Kº?ïý¸Mú»ü?ïý´—¶ýq?ïý´™÷¦?ïý°á«±?ïý°ãPT ?ïý­'úw ?ïý­*;8?ïý©llç~?ïý©n­S?ïý¥®\ï¶?ïý©³ÜØ?ïý‚ËÓ³?ïý… q‹?ïý[¸¨û?ïý]ùFˆ?ïý2eæµ?ïý4¦ƒö?ïýÆ=È?ïý Ú¿?ïý ØцP?ïý Û"ü?ïý¨¥¾†?ïýªæZæ?ïývMá¸?ïýxŽ}Ì?ïüþAËžÃ?ïüþD :‹?ïüú 3ö?ïüú t+r?ïüõÒ~O¼?ïüõÔ¾êì?ïüñ—¼Š?ïüñ™ü£n?ïüí[)ù?ïüí]FÄ?ïüéÄÓ?ïüém`?ïüä¿ZTù?ïüäÁšîö?ïüàlüõ?ïüànF–¤?ïüܸt?ïüÜù í?ïü×¼~s“?ïü×¾¿ ¥?ïüÓ`iRD?ïüÓb©ë?ïüÏwýŠ?ïüϸ•þ?ïüÊŸ¤øç?ïüÊ¡å‘ ?ïüÆ;#‘?ïüÆ=T»h?ïüÁÓ¶ý?ïüÁÕ÷”Ÿ?ïü½iŒûV?ïü½kÍ’?ïü¸üµxæ?ïü¸þöÍ?ïü´&õB?ïü´g‹Ù?ïü°á:?ïü°!ÐH?ïü«¦-?ïü«¨HÃ?ïü§.’«è?ïü§0ÓAŽ?ïü¢´wÛÐ?ïü¢¶¸q&?ïüž7à#Ý?ïüž: ¸â?ïü™¸¾Yº?ïü™ºþîn?ïü•7Éì?ïü•9\^O?ïü³<Š?ïüµFÐœ?ïüŒ,‡?ïüŒ.Ç«Ä?ïü‡£‘çì?ïü‡¥Ò{Z?ïüƒFF]?ïüƒ†Ùy?ïü~Š­Ð%?ïü~Œîbï?ïüyúÀÓv?ïüyýeî?ïüuhÚ?ïüujÎ"?ïüpÔ"I#?ïüpÖbÚö?ïül=|Â?ïül?¼¢B?ïüg¤±ñ]?ïüg¦ò‚Š?ïüc Å|™?ïüc  s?ïü^l¼µ·?ïü^nýF>?ïüYŸ˜v?ïüYÄà(©?ïüU@fÊ?ïüU€ö©?ïüP`ßeK?ïüPcôÕ?ïüK«•›?ïüK­Õ’Ð?ïüFó` 2?ïüFõ œ?ïüB8;4.?ïüB:{¹?ïü=z:ÀF?ïü=|{N{?ïü8¹ju#?ïü8»«?ïü3õÁ V?ïü3ø™à?ïü//N® ?ïü/1;T?ïü*f ?ïü*h[§}?ïü%š%Åæ?ïü%œfRm?ïü Ëzɬ?ïü Í»UÜ?ïüúóÀ?ïüü^™?ïü& âj?ïü(Kmì?ïüOZT9?ïüQšßd?ïü v - ?ïü xL¸t?ïüš y ?ïüœaˆ?ïü»°]?ïü½ðŠ‚?ïûþÚºæ¬?ïûþÜûpx?ïûù÷=a’?ïûùù}ë?ïûõ@ @?ïûõ€”\?ïûð(Ó©"?ïûð+1æ?ïûë=ü×›?ïûë@=`?ïûæPÈ^6?ïûæSæH?ïûáa2óg?ïûács{ ?ïûÜoI‰?ïûÜqŠ{?ïû×{›?ïû×}Uœ¡?ïûÒ„’©ˆ?ïûÒ†Ó06?ïûÍ‹×`²?ïûÍŽç?ïûÈèi%?ïûÈ“(ï?ïûÃ“Ë 3?ïûÖ ‘Ó?ïû¾Š¸ÁŒ?ïû¾ŒùFÑ?ïû¹|LfD?ïû¹~Œë.?ïû´jé‚¥?ïû´m*4?ïû¯V’àR?ïû¯XÓd…?ïûª?OOõ?ïûªAÓÌ?ïû¥%-Œ?ïû¥'n?ïû  Ó?ïû  aV¯?ïûšè8z?ïûšêx‰L?ïúÊejx?ïúÊgª‚?ïúÄÐR†?ïúÄÒ’õ6?ïú¿8‰º|?ïú¿:Ê-Ç?ïú¹ž!qÈ?ïú¹ aä®?ïú´ì?ïú´]Šm?ïú®aqÿð?ïú®c²r ?ïú¨¿@,¾?ïú¨Á€žs?ïú£€˜|?ïú£Á Ì?ïús3v†?ïúusçp?ïú—Ég%±?ïú—˧–5?ïú’)þö?ïú’jo?ïúŒnnYð?ïúŒp®É§?ïú†½I² ?ïú†¿Š!]?ïú ¼ˆà?ïú ü÷Ê?ïú{SÎn”?ïú{VÝ?ïúu›ƒ‡ñ?ïúuÃö ?ïúoàæ÷?ïúoã'dµ?ïúj#öø?ïúj&6„E?ïúd\ÒÐ?ïúd_…µ?ïú^?,D?ïú^’˜À?ïúXÀ³˜?ïúXÂó„¬?ïúRî3»­?ïúRðt'X?ïúMÍÛç?ïúMG)?ïúG@y¨þ?ïúGBºÖ?ïúAeD'?ïúAg„j–?ïú;‡2å»?ïú;‰sOÀ?ïú5¦E—R?ïú5¨†í?ïú/‰;?ïú/ÄÉml?ïú)Ûÿé8?ïú)Þ@Qÿ?ïú#ò¢ëÓ?ïú#ôãT/?ïú…ßÆ?ïúÆG·?ïú¨JÚ?ïúè²`?ïú&…¹?ïú(PìÔ?ïú 1Á—b?ïú 4þ?ïú:Áñš?ïú=Wß?ïúAg”?ïúC[Íl?ïùúDÃËç?ïùúG1T?ïùôEÜcâ?ïùôHÈã?ïùîDTsV?ïùîF”×ê?ïùè@2­Ü?ïùèBs?ïùâ9ŽXØ?ïùâ;μ”?ïùÜ0]¡?ïùÜ2žW?ïùÖ$ Â`?ïùÖ&á%B?ïùÐu œ?ïùж?ïùÊÈÍ”?ïùÊ /›?ïùÃò§Ó6?ïùÃôè4Ð?ïù½Ý#yZ?ïù½ßcÚ†?ïù·Å+ï&?ïù·ÇlOä?ïù±ªÕ[?ïù±­»S?ïù«Ž-T&?ïù«m´?ïù¥gçÚ>?ïù¥j(9°?ïùŸ<=d9?ïùŸ>}Ã=?ïù™ ¢c?ïù™âÂ?ïù’Ü k?ïù’ÞL~?ïùŒ§€/™?ïùŒ©ÀN?ïù†p¼?ïù†r[V?ïù€5Ñ5Ï?ïù€8’¤?ïùyøœjÑ?ïùyúÜÇ5?ïùs¸›»³?ïùsºÜ§?ïùmu¾iÀ?ïùmwþÅB?ïùg0£0?ïùg2PþB?ïù`ç•@?ïù`éÕ^á?ïùZœN88?ïùZžŽ’g?ïùTNEQ_?ïùTP…«?ïùMý‰¸à?ïùMÿÊ+?ïùGªãò?ïùG¬E<Ë?ïùASÒüú?ïùAVUa?ïù:úöÝj?ïù:ý75^?ïù4ŸfÞ^?ïù4¡§5à?ïù.A2”&?ïù.Crë5?ïù'à`&P?ïù'â |ì?ïù!|ï‡)?ïù!/ÝR?ïùí4?ïù-‰Ê?ïù®_n¨?ïù°ŸÃê?ïùCC3?ïùEƒ‡ç?ïùÕ¡û?ïù×âOë?ïùe÷?ïùg¿jÝ?ïøúòä š?ïøúõ$a ?ïøô}Çõ«?ïøô€H©?ïøîFãÜ?ïøî‡6e?ïøçŒTö?ïø玕H–?ïøáøÒñ?ïøá9$‘?ïøÚŠŸ8Œ?ïøڌ߉¶?ïøÓÿÛ7Q?ïøÔˆ?ïøÍró$?ïøÍt\Cc?ïøÆárÑ\?ïøÆã³!$?ïøÀMáîü?ïøÀP">M?ïø¹·\Cù?ïø¹¹œ’Ó?ïø³ùYA?ïø³ 9§¥?ïø¬µ\m?ïø¬ƒõªY?ïø¥â™x?ïø¥äÏæí?ïøŸ@™‰y?ïøŸBÙÖw?ïø˜›Ì~Î?ïø˜ž ËT?ïø‘ô*îÎ?ïø‘ök:Ü?ïø‹IÆ\z?ïø‹L¨?ïø„œ¡BS?ïø„žáp?ïø}ì¬9?ïø}î샥?ïøw: ¼¸?ïøw®½?ïø ¬~ñD?ïøÅÀ•?ïøÈa ?ï÷üÛòe?ï÷üÞ2¦ ?ï÷õï10?ï÷õñq_B?ï÷îÿr»r?ï÷ï²ü?ï÷è Í~?ï÷è ¾-?ï÷á=­d?ï÷á}ìþ?ï÷Ú¿¦ˆ?ï÷Ú ÿå¤?ï÷Ó#l…õ?ï÷Ó%¬Ä“?ï÷Ì%,§v?ï÷Ì'lå–?ï÷Å$Sƒ?ï÷Å&V‘%?ï÷¾ 1y6?ï÷¾"q¶Y?ï÷·tõ€?ï÷·µ2%?ï÷°ë©+?ï÷°+åQ?ï÷© q–?ï÷©à­=?ï÷¡ô‡‚N?ï÷¡öǽu?ï÷šâ±w˜?ï÷šäñ²@?ï÷“Î&iT?ï÷“Ðf£}?ï÷Œ¶à\e?ï÷Œ¹ –?ï÷…œáà?ï÷…Ÿ"=?ï÷~€>eÂ?ï÷~‚~žj?ï÷w`íIQ?ï÷wc-y?ï÷p>îj®?ï÷pA.¢U?ï÷iUD-?ï÷i•{T?ï÷aó!¼ÿ?ï÷aõaó¥?ï÷ZÉV•~?ï÷ZË–Ë£?ï÷Sœü',?ï÷SŸ<\Ï?ï÷Ln¸]?ï÷LpOí?ï÷E<–ñ¾?ï÷E>×&^?ï÷>ŸÊ¦?ï÷> ßþÄ?ï÷6Ò¤ù?ï÷6Ô\Ø•?ï÷/™&’?ï÷/›fÀ­?ï÷(]À~[?ï÷(`°ó?ï÷!(#?ï÷!hH8?ï÷Ñ?ãê?ï÷Ó€|?ï÷…h_!?ï÷‡¨/?ï÷ 6›+Ê?ï÷ 8Û\U?ï÷äÜõŸ?ï÷ç%¥?ïöü=Ys?ïöü’}ˆõ?ïöõ8°§»?ïöõ:ðÖ¹?ïöíÞ>]±?ïöíà~Œ+?ïöæ€ð±d?ïöæƒ0ßX?ïöß Ìiz?ïöß# –é?ïö×½Ë~m?ïö×À «X?ïöÐWø8˜?ïöÐZ8dý?ïöÈïZ*|?ïöÈñšV\?ïöÁƒè¾Œ?ïöÁ†(éæ?ïöº¹=?ïöºù<?ïö²¤Â¡P?ïö²§Ëž?ïö«1 qh?ïö«3J›/?ïö£ºšä??ïö£¼Û €?ïöœAsª6?ïöœC³Òñ?ïö”Å—-À?ïö”Ç×Uó?ïöGÝ?ïöIX°?ïö…Ååˆú?ïö…È%°?ïö~B µ?ïö~DJÜ-?ïöv»—/m?ïöv½×Uƒ?ïöo2‚ë“?ïöo4Ã"?ïög¦ÕÒY?ïög©÷`?ïö`šp ?ïö`Ú”‰?ïöX‡ÆC®?ïöXŠg£?ïöPôcïk?ïöPö¤Ø?ïöI^€±?ïöI`ÀÓú?ïöAƪ?ïöAÈ\Ì_?ïö:+5n¼?ïö:-u?ïö2ˆ…CÎ?ïö2ŠÅe?ïö*à“à?ïö*âÔÖ?ïö#5¯?ïö#7ï86?ïö‡Ø³?ïöŠÒ«?ïö× N@?ïöÙMm_?ïö #V•5?ïö %–³Ê?ïöl»˜«?ïönû¶µ?ïõü³;¦V?ïõüµ{ÃÔ?ïõôöدm?ïõôùÌ`?ïõí7¡–•?ïõí9á²ü?ïõåu‹n,?ïõåwËŠ?ïõÝ°¢?ïõݲâªf?ïõÕèî'ú?ïõÕë.B½?ïõÎk&v?ïõÎ «@¬?ïõÆQŠ.?ïõÆSV£×?ïõ¾õö?ïõ¾ƒG?ïõ¶®1Å×?ïõ¶°qÞh?ïõ®Ø›¿ ?ïõ®ÚÛ×?ïõ§NÃ?ïõ§ŽÚŒ?ïõŸ%Oœ?ïõŸ'²ë?ïõ—G–k?ïõ—IÖr?ïõg7F•?ïõiw\b?ïõ‡„,él?ïõ‡†lþª?ïõžy·\?ïõ ¹Ì ?ïõw¶*2?ïõw¸jF7?ïõoË98]?ïõoÍyKð?ïõgÝ°Ñ?ïõgßðä?ïõ_í•ü;?ïõ_ïÖ¯?ïõWúë??ïõWý+Q?ïõP®)'?ïõPî:}?ïõH ëT(?ïõH+dî?ïõ@¥\t?ïõ@ålª?ïõ8ØFP?ïõ8Uö?ïõ0 à0¾?ïõ0 ?Ô?ïõ(ñu?ïõ(1ù?ïõôïÒ?ïõöNýÅ?ïõä@§7?ïõ怴™?ïõÑ…mÔ?ïõÓÅz¤?ïõ»ß ?ïõ¾½?ïôÿ£Y9â?ïôÿ¥™EŽ?ïô÷‡õÃ?ïô÷Š5Î!?ïôïi±”è?ïôïkñŸp?ïôçH‘ %?ïôçJÑ?ïôß$sj?ïôß&Ý|Ì?ïôÖýÖDŒ?ïô×M\?ïôÎÔDÐr?ïôÎքد?ïôƧã»l?ïôƪ#Ã?ïô¾x·€Ú?ïô¾z÷‡ð?ïô¶FÎ`B?ïô¶IfÄ?ïô®:Æ?ïô®^@´?ïô¥Ú®~?ïô¥ÜîØ?ïô ‰´”?ïô¢É¹Y?ïô•c¬ ?ïô•eìN?ïô$ƒ?ïô&\# ?ïô„áå΄?ïô„ä%ÑŒ?ïô|Ú?ïô|ŸDM?ïôtUy3?ïôtW¹4í?ïôl Q4?ïôl ‘|?ïôc¾‹±ñ?ïôcÀ˲£?ïô[o(ê¹?ïô[qhêÖ?ïôS2VÜ?ïôSrVc?ïôJȪ[$?ïôJÊêZ?ïôBq‘?ïôBsÑi?ïô:òM§?ïô:2Kk?ïô1·ÓÜ?ïô1¹TÑ ?ïô)QÉ?ïô)SSŒ^?ïô è&?ïô êf?ïô|=kõ?ïô~}g[?ïô d­?ïô¤¨]?ïô›«ÁX?ïôë»?ïóÿ'bp?ïóÿ)A\ ?ïóö¯pÄN?ïóö±°½S?ïóî5¹ ?ïóî7B±‹?ïóå·¹§?ïóå¹øøz?ïóÝ7‹û@?ïóÝ9Ëòz?ïóÔ´ñÛ?ïóÔ¶Íè{?ïóÌ.¾\X?ïóÌ0þR^?ïóæa?ïóèSVs?ïó»¡¢–?ïó»á—i?ïó²ŒdZ?ï󲎣÷“?ïó©ûaX?ïó©ý¡ö?ïó¡g?î?ïó¡iÝ2ò?ïó˜Ñû?ïó˜Ó^ød?ïó7ÜÕ%?ïó:Æó?ïó‡›æ§ˆ?ïó‡ž&˜º?ïó~ý<8H?ïó~ÿ|(ß?ïóv[Úþº?ïóv^î¶?ïóm·×’Û?ïómº‚;?ïóe&9G?ïóef( ?ïó\gËm\?ïó\j [„?ïóS»Íû ?ïóS¾ è•?ïóK 4¯d?ïóKtœS?ïóB[ÿz!?ïóB^?fs?ïó9¨9Å ?ïó9ªy°Â?ïó0ñÜ°Ü?ïó0ô›õ?ïó(8ìÚ#?ïó(;,Äž?ïóyâ±?ïó{GÌŽ?ïó´ kô?ïó¶KU4?ïó ìÆE?ïó î\®æ?ïó!;4Ö?ïó#{Ù?ïòüSjÂ?ïòüUªw&?ïòó‚§åÖ?ïòó„çÌ›?ïòê¯-F?ïòê±@l?ïòáØpŽ?ïòáÚ°e?ïòØÿz?ïòÙCua?ïòÐ"¸Çß?ïòÐ$ø¬&?ïòÇCWt?ïòÇEÍ;?ïò¾a‡}¨?ïò¾cÇ`°?ïòµ|­yî?ïòµ~í\U?ïò¬•f?ïò¬—@ò,?ïò£ªˆ‡H?ïò£¬Èhn?ïòš½E¬¯?ïòš¿…4?ïò‘Í:V?ïò‘Ïz5è?ïòˆÚcê?ïòˆÜ£É\?ïòäÓéd?ïòçÈ?ïòvìƒMæ?ïòvîÃ+å?ïòmñxy{?ïòmó¸VÙ?ïòdó³'—?ïòdõóR?ïò[ó>1Z?ïò[õ~ s?ïòRðï ?ïòRòTʃ?ïòIêB?à?ïòIì‚´?ïò@áÁh?ïò@äg™?ïò7ÖŸð¶?ïò7ØßÊD?ïò.ÈØâJ?ïò.Ë»4?ïò%¸wK?ïò%º·#Z?ïò¥v´ê?ïò§¶ŒŽ?ïòä?o?ïò’$o?ïò w»ƒu?ïò yûYÑ?ïòXÊ‹?ïò[ èB?ïñø4Ö í?ïñø7à?ïñï ðßT?ïñï0³Â?ïñåäX?ïñåæPó!?ïñÜ·G“&?ïñܹ‡fI?ïñÓ‡•»?ïñÓ‰Õœ?ïñÊTômŽ?ïñÊW4?f?ïñÁp;?ïñÁ!¯ën?ïñ·çýí?ïñ·éEÎx?ïñ®«¼ ?ïñ®­ûÙô?ïñ¥m˜0ö?ïñ¥oØ5?ïñœ,™ì4?ïñœ.ÙºÌ?ïñ’è¾—"?ïñ’êþe?ïñ‰¢ù¼?ïñ‰¤VÇ?ïñ€XžN‚?ïñ€ZÞ%?ïñw VPf?ïñw–a?ïñm½ITã?ïñm¿‰ 6?ïñdkr¯ ?ïñdm²yË?ïñ[Ô,:?ïñ[ö=?ïñQ¿zMÒ?ïñQÁº-?ïñHedÁ¦?ïñHg¤ŠX?ïñ?ŒÛb?ïñ? Ì£k?ïñ5©‡°?ïñ5«EO?ïñ,FÊD¿?ïñ,I v?ïñ"áÜý–?ïñ"ää?ïñzH_?ïñ|‡âÃ?ïñ;9?ïñFÿô?ïñ£T?ïñ¥\‘?ïðý3˜2*?ïðý5×õ‘?ïðóÁp+?ïðóïîY?ïðêL¬ x?ïðêNìb‰?ïðàÕQº˜?ïðàב{ÿ?ïð×WfÀn?ïð×Y¦*?ïðÍÔ~}µ?ïðÍÖ¾=Æ?ïðÄN¦ Ñ?ïðÄPåÌ6?ïðºÅÚ£°?ïðºÈbi?ïð±:³g?ïð±<]qt?ïð§«{'?ï𧭺ä€?ïðžçë5?ïðž'§é?ïð”…mÜ®?ï𔇭˜¶?ïðŠîÔ?ïðŠðVs?ïðSÜe?ïðV¼?ïðw¶Ã€?ïðw¹Ö€?ïðnÑÞ7?ïðn—Š?ïðdtȤ?ïðdvGJ?ïðZÎdfÐ?ïðZФÇ?ïðQ%õÄÚ?ïðQ(5|#?ïðGz·PŠ?ïðG|÷%?ïð=̪µn?ïð=Îêk[?ïð4×ÒÈ?ïð4ˆ?ïð*h@Zœ?ïð*j€*?ïð ±áé™?ïð ´!y?ïðøȃò?ïðû7"?ïð <ïÃ?ïð ?/u–?ïð~_•j?ïð€ŸG ;Ô?ïï>"{wÿ?ïï4!Z§?ïï4#š3ß?ïï*¤`H?ïï*!äË?ïï ÌÀ?ïï VnŽ?ïï³e ?ïïóº?ïï ¶ä?ïï ÁWI?ïïüƒV?ïïþÂõ¾?ïî÷ì¹Þe?ïî÷îù}_?ïîíÚ*ç ?ïîíÜj…O?ïîãÄØ ?ïîãÇ°¯?ïî٬à ’?ïîÙ¯¨k?ïîÏ‘ójŠ?ïîÏ”3­?ïîÅtfíë?ïîÅv¦‰W?ïî»TVN?ïî»V\ñ?ïî±1$/z?ïî±3cÉy?ïî§ wPE?ïî§ ¶éŽ?ïîœãtæ?ïîœåZ w?ïî’¸g’?ïî’ºNÿl?ï_Ë>?ïŸb`?ïî~Z † ?ïî~\Iu?ïît'JT?ïît)Sà?ïîiñ|º?ïîi󻬵?ïî_µ®`¢?ïî_·íôä?ïîUtþ¼?ïîUw=ªF?ïîK1Yq¼?ïîK3™?ïî@ê¿Ï4?ïî@ìÿaK?ïî6¡>+W?ïî6£}¼µ?ïî,TÊ4º?ïî,W Å^?ïî"m –?ïî"¬›?ïî³+íº?ïîµk|ê?ïî ^p?ïî `AþŽ?ïîõÚŽ?ïî5hJ?ïíø« cP?ïíø­LðR?ïíîMD°þ?ïíîO„=D?ïíãì¤íp?ïíãîäxû?ïíÙ‰3fî?ïíÙ‹rñ¾?ïíÏ"çý—?ïíÏ%'‡«?ïíĹËâ¦?ïíļ kÿ?ïíºMâ…)?ïíºP" Æ?ïí¯ß+„ ?ïí¯ák ?ïí¥m¬A?ïí¥oëÈ>?ïíšùjg?ïíšû©¤Ï?ïí‚dÇ´?ï턤M_?ï톚 $?ïí† ÙŽ?ïí{Œíü?ïí{ŽVr.?ïíq ×bz?ïíqåï?ïífŠÝ­?ïíf’d?ïí\8Ë?ïí\xM ?ïíQ~Þük?ïíQ}§?ïíFôÕ"´?ïíF÷£2?ïí¦?ïê¸è¤¿n?ïê¸êäÞ?ïê­¨Þ ¬?ïê­«òQ?ïê¢fbý?ïê¢h¡c×?ïê—!'Èü?ïê—#g ?ïê‹Ù?v…?ïê‹Û~ÅÈ?ïꀎ§"3?ïê€æp«?ïêuAb$?ïêuC¡q­?ïêiñr9?ïêió±a?ïê^žØÞ?ïê^¡Ûò?ïêSFr®-?ïêSH±ùu?ïêGéPÒÒ?ïêGëM?ïê<‰;we?ïê<‹zÁ?ïê1&3Ƕ?ïê1(s—?ïê%À<´%?ïê%Â{ü8?ïêWZïV?ïêYš6›?ïêëŠoÌ?ïêíɶD?ïê|Õ,ð?ïêrš?ïéø ?ïèl;¼_?ïèl=ûˆ~?ïè`bÁ¢ë?ïè`eË?ïèT†ê5x?ïèT‰)\Ê?ïèH¨9?ïèHªx-?ïè<Ʋ·t?ïè<ÈñÝ?ïè0âU2,?ïè0ä”Vû?ïè$û%q?ïè$ýdAi?ïè%s¶?ïèd–×?ïè $Rö?ïè &‘¤A?ïè4¹Qš?ïè6øs?ïçõBY‹@?ïçõD˜«Ý?ïçéM-݈?ïçéOlýM?ïçÝU?ýÖ?ïçÝWÃ?ïçÑZ’õà?ïçÑ\Òõ?ïçÅ]$ÕÊ?ïçÅ_có?ïç¹\ýª|?ïç¹_<Æà?ïç­ZÜ>?ïç­\]÷Ê?ïç¡Tçª?ïç¡V¿^?ïç•L4wö?ïç•Ns‘Ñ?ïç‰A7^Ê?ïç‰CvwË?ïç}3ˆlî?ïç}5Ç…?ïçq#*Åk?ïçq%iܺ?ïçe =“ø?ïçe|ªm?ïçXò¥ºý?ïçXôäИ?ïçLÕ”õ?ïçL×\©¶?ïç@´¤’°?ïç@¶ã¦–?ïç4‘;Ï2?ïç4“zâ=?ïç(jç±ë?ïç(m&Ä?ïçA¬¢×?ïçCë´,?ïçî>?ïçÀþ·?ïçæt6Œ?ïçè³F*?ïæ÷´†F>?ïæ÷¶ÅU?ïæë²¾ˆ?ïæëñÌn?ïæßHZ ?ïæßJ@g?ïæÓ v°?ïæÓµ™Ý?ïæÆÐ%\?ïæÆÒG0­?ïæºÉGø?ï溒Rk?ïæ®L´ª“?ïæ®Nó´*?ïæ¢Ë‹ô?ïæ¢ ”®?ï敾 @?ïæ•ÀL—?ïæ‰rŠ“!?ïæ‰tÉš?ïæ}$3¦?ïæ}&r¬1?ïæpÓFP?ïæpÕYK’?ïæd2ÍØ?ïædqÒè=?ïå”ZTs?ïå–™@4?ïäùê Z^?ïäùì_E:?ïäí=¹¾?ïäí?]£¶?ïäàPdö?ïäàN ?ïäÓÚ»S²?ïäÓÜú;à?ïäÇ%bZ?ïäÇ'¡A[?ïäºmC›¬?ïäºo‚‚?ïä­²`cÌ?ïä­´ŸIK?ïä ôÃaÂ?ïä ÷F[?ïä”4d‚ô?ïä”6£f§?ïä‡qKZ±?ïä‡sŠ=~?ïäz«yž?ïäz­¾[…?ïämâúk;?ïämå9L;?ïäa¿%?ïäaýû??ïäTIØ;¦?ïäTLÙ?ïäGvíŸ?ïäGxÎËë?ïä:ž±ñ?ïä: ðÎh?ïä-Ãà<ñ?ïä-Æn?ïä æ ?ïä è_Z›?ïäp¥ç?ï䯀”?ïä!ÔÖš?ïä$°^?ïãú;L“”?ïãú=‹lp?ïãíQß¼?ïãíTô¯?ïãàeŠm¶?ïãàgÉDÀ?ïãÓvR²Ù?ïãÓx‘ˆú?ïãÆ„<ð?ïãƆzî(?ïã¹CÜ?ï㹑ð*?ï㬗kîÊ?ï㬙ªÂ.?ï㟜¼N{?ï㟞û õ?ïã’Ÿ6å*?ïã’¡u¶º?ïã…žÒ¯?ïã…¡ìU?ïãx››a*?ïãxÚ0å?ïãk•–î\?ïãk—Õ½,?ïã^Œ»:´?ïã^Žú™?ïãQ,r?ïãQƒRùl?ïãDr¦?ïãDtäÎ-?ïã7agBÒ?ïã7c¦ ö?ïã*MeZö?ïã*O¤%.?ïã6ŸýT?ïã8ÞÆ ?ïãÍ*?ïãO•‰?ïãƺÉ?ïã‚Ì?ïâè¿öCƒ?ïâèÂ5 ?ïâÛ›{…?ïâÛºI»?ïâÎtIuõ?ïâÎvˆ9µ?ïâÁJ^^b?ïâÁL!5?ïâ´Ã}?ïâ´ àb?ïâ¦ëàl ?ïâ¦î-?ï♵md÷?ïâ™·¬%?ïâŒ| Ý?ïâŒ~Jœœ?ïâ?»O÷?ïâAú#?ïârx8¯?ïâr¶õì?ïâd¾L£Ž?ïâdÀ‹_Ý?ïâWy6’Ì?ïâW{uN+?ïâJ14†?ïâJ3rÈö?ïâ<æL$%?ïâ<èŠÝ¥?ïâ/˜‡^P?ïâ/šÆá?ïâ"GÙO?ïâ"J®?ïâôI 2?ïâö‡¿â?ïâã—[?ïâ "M?ïáúDŸ—¤?ïáúFÞLs?ïáìè„$?ïáìêÂÑ?ïá߉•=¬?ïáß‹Óð™?ïáÒ'Ë&P?ïáÒ* ØL?ïáÄÃ,ï ?ïáÄÅk ª?ïá·[À3`?ïá·]þãy?ïá©ñ„™ô?ïá©óÃI?ïᜄ{L?ïᜆ¹úQ?ïá«cl?ïáê¯?ïᢠ(†?ïá¤KÔ×?ïát,¬*à?ïát.êÖ>?ïáf´‹9?ïáf¶É¿¤?ïáY9¢>?ïáY;àç{?ïáK»úAš?ïáK¾8ê ?ïá>;—L²?ïá>=ÕôD?ïá0¸y!t?ïá0º·È?ïá#2¢wø?ïá#4á£?ï᪠?ïá¬T®Ð?ïáÓ£À?ïá!Gƒ?ïàúŽ]»®?ïàúœ^|?ïàìùhn…?ïàìû§^?ïàßazà?ïàßc¹?ïàÑÆ¡Ãý?ïàÑÈàcì?ïàÄ(Ü™­?ïàÄ+8¦?ïඈ&É?ïඊeÍ?ïà¨äŒ.?ïà¨æÊË*?ïà›>Ãò?ïà›@G` ?ïà”š[§?ïà–ØöÈ?ïàèGÑÛ?ïàê†l?ïàr9uÇ?ïàr;Xü?ïàd‡À6?ïàd‰@Xs?ïàVÒ©"?ïàVÔS@h?ïàIIZ?ïàI‡¤©?ïà;_¥Ð,?ïà;aäeƒ?ïà-¢'¦’?ïà-¤f:ò?ïàáÖç?ïàäz‡?ïà°OØ?ïà îâH?ïàX¶nn?ïàZôÿæ?ïßöñ™¬?ïßö’0*,?ïßèÄ[µœ?ïßèÆšE#?ïßÚõûª¡?ïßÚø:9.?ïßÍ$Öî ?ïßÍ'{¢?ïß¿PäŽã?ïß¿S#?ïß±z/ËS?ïß±|nVõ?ïߣ ¹Ì5?ïߣ¢øVÝ?ïß•Ä€Þ_?ïß•Æ¿h?ï߇å‹ï’?ï߇çÊxG?ïßzÜ/Ø?ïßz·’?ïßlk©y?ïßl!ª08?ïß^8HwŠ?ïß^:†ýO?ïßPNpóy?ïßPP¯xC?ïßB_w%ž?ïßBaµ©m?ïß4lÉ?ïß4nDœ?ïß&u Å?ïß&wßGg?ïß|HG”?ïß~†Èp?ïß €˜?ïß ‚E„x?ïÞü€Ø;¢?ïÞüƒº…?ïÞî~Á(?ïÞî€ÿ¦i?ïÞàyÁVÊ?ïÞà{ÿÓµ?ïÞÒqßoË?ïÞÒtë¹?ïÞÄgP?ïÞÄiPúA?ïÞ¶Yd |?ïÞ¶[¢„o?ïÞ¨H×ç{?ïÞ¨K`p?ïÞš5lCª?ïÞš7ª»¢?ïÞŒ$ù§?ïÞŒ!cp¡?ïÞ~zÎ?ïÞ~BðÊ?ïÞoê gS?ïÞoìHÜP?ïÞaË<Ç?ïÞaÍz{Æ?ïÞS©›ÒY?ïÞS«ÚEY?ïÞE…(Œ?ïÞE‡fwŽ?ïÞ7]ä…»?ïÞ7`"ö½?ïÞ)3Ñ2?ïÞ)6p5?ïÞïõW?ïÞ .dZ?ïÞ ×HÔ?ïÞ Ù†ŠØ?ïÝþ¤Ú¥?ïÝþ§ý©?ïÝðo¥ ~?ïÝðqä ?ïÝâ7©º?ïÝâ9çr¾?ïÝÓüîOz?ïÝÓÿ,¹}?ïÝÅ¿sÏ'?ïÝÅÁ²8)?ïÝ·<ˆ?ïÝ·z{‰?ïÝ©ˆ ?ïÝšö™’æ?ïÝšø×øå?ïÝŒ®6ºâ?ïÝŒ°uß?ïÝ~`ÇL]?ïÝ~c°Y?ïÝpæc?ïÝp$r\?ïÝaº6y?ïÝa¼P˜p?ïÝSbOrn?ïÝSdÓc?ïÝEž­æ?ïÝE Ý Ø?ïÝ6ª9$?ïÝ6¬@˜?ïÝ(I€Ž'?ïÝ(K¾ì?ïÝæ¯ ?ïÝèR ?ïÝ ¿U«?ïÝ ý±?ïÜýˆ?ïÜýÆø~?ïÜîªp}[?ïÜ×8?ïÜà;u+v?ïÜà=³„O?ïÜÑÉ)S?ïÜÑËÛ(?ïÜÃTèü?ïÜÃW&iÌ?ïÜ´ÝY©†?ïÜ´ß—ÿQ?ïܦbõ®\?ïܦe4"?ïÜ—å¹R?ïÜ—ç÷X?ï܉e§qþ?ï܉gåĺ?ïÜzâÇ|¬?ïÜzåÎb?ïÜl]4Ê?ïÜl_M…{?ïÜ]ÔŠ ¾?ïÜ]ÖÈðh?ïÜOI>èœ?ïÜOK}7@?ïÜ@» Ëa?ïÜ@½_þ?ïÜ2*? :?ïÜ2,}VÑ?ïÜ#–•A*?ïÜ#˜ÓŒ»?ïÜ#+?ïÜau¤?ïÜfómŒ?ïÜi1·?ïÛ÷Ë ?ïÛ÷ÍASˆ?ïÛé,Ph§?ïÛé.Ž°?ïÛÚŠäÐ)?ïÛÚ#•?ïÛËæÀc?ïÛËèþJÇ?ïÛ½?áÐ ?ïÛ½B i?ïÛ®”œ?ïÛ®–DIï?ïÛŸãÂE?ïÛŸæ‡S?ïÛ‘0‹B?ïÛ‘2É^ƒ?ïÛ‚zfÝ?ïÛ‚|¥¹?ïÛsÁZwÃ?ïÛsضó?ïÛe]Xï?ïÛe›—?ïÛVFyàÔ?ïÛVH¸ð?ïÛG„®D½?ïÛG†ì€Ï?ïÛ8¿ö L?ïÛ8Â4GS?ïÛ)ø^J5?ïÛ)úœ„2?ïÛ-æ“>?ïÛ0$Ì1?ïÛ `‹Ï?ïÛ bÊ?ïÚýRûô?ïÚý’‘2Ñ?ïÚî½Bnþ?ïÚî¿€¤Ð?ïÚßçPa?ïÚß鎕Þ?ïÚÑ…Ü=?ïÚÑÄ÷?ïÚÂ2ëæK?ïÚÂ5*ù?ïÚ³TvÉ?ïÚ³V´Gk?ïÚ¤s.Ì$?ïÚ¤ulüº?ïÚ•¶Ü?ïÚ•‘Wæf?ïÚ†¨1*¯?ïÚ†ªoY,?ïÚw¾~2?ïÚwÀ¼_v?ïÚhÑü~?ïÚhÔ:ªv?ïÚYâµV?ïÚYäóD¬?ïÚJð¢f?ïÚJòàJ?ïÚ;ûÍoŽ?ïÚ;þ ˜É?ïÚ-0ŸO?ïÚ-nÇ|?ïÚ Õ»?ïÚ (Û?ïÚ ºUÇ?ïÚø{Ø?ïÚ äX"?ïÚ"}%?ïÙñ P&?ïÙñ ŽJ„?ïÙâzþ?ïÙâCä?ïÙÒú̪¥?ïÙÒý Ì{?ïÙÃì4é?ïÙÃîr(±?ïÙ´Ú­Øk?ïÙ´Üëø"?ïÙ¥Æ5®]?ïÙ¥ÈsÍ?ïÙ–®Ð_?ïÙ–±|š?ïÙ‡”m]?ïÙ‡–¿‰ä?ïÙxwGÄ?ïÙxy…3;?ïÙiW'†ü?ïÙiYe¡c?ïÙZ4"No?ïÙZ6`gÅ?ïÙK8Um?ïÙKvm±?ïÙ;åj…Â?ïÙ;稜õ?ïÙ,¹¿ T?ïÙ,»ý!v?ïÙ‹0CH?ïÙnXX?ïÙYÈKP?ïÙ\_N?ïØÿ%†Ã ?ïØÿ'ÄÕö?ïØïîiþ¼?ïØïð¨–?ïØà´x.Ò?ïØබ?™?ïØÑw®]š?ïØÑyìmO?ïØÂ8½‚?ïØÂ:PÌ#?ïزõ¦Gè?ïز÷äUw?ïØ£°kF8?ïØ£²©R´?ïØ”h^Î?ïØ”jœÙ€?ïØ…‡ò?ïØ…Å F?ïØuÏêRV?ïØuÒ([–?ïØf}ÓÛ?ïØf»Ü?ïØW,NRï?ïØW.ŒZ?ïØGÖ\ÕX?ïØGØšÛ\?ïØ8}¦€R?ïØ8ä…A?ïØ)".÷Ì?ïØ)$lû§?ïØÃüvP?ïØÆ:y?ïØ c ’Â?ïØ eG”r?ï×úÿ[@«?ï×û™AE?ï×ë–Ö_?ï×ë™^œ?ï×Ü)öïö?ï×Ü,4îe?ï×̺'Ɔ?ï×̼eÃß?ï×½Gi¸Ä?ï×½I§µ?ï׭Ѿèš?ï×­ÓüãÅ?ïמY)yN?ïמ[gsc?ï׎ݫg?ï׎ßéˆe?ï×_D¾ÿ?ï×a‚¶æ?ï×oÝøye?ï×oà6p3?ï×`YÊ01?ï×`\%é?ï×PÒ¸4Î?ï×PÔö)m?ï×AHÈŒý?ïÓ¨Œ—ñ°?ïÓ˜RzFU?ïÓ˜T·÷â?ïÓˆµ–ï?ïÓˆóGY?ïÓwÚ É>?ïÓwÜIx‚?ïÓg™{?e?ïÓg›¸í…?ïÓWV ¶:?ïÓWXGc5?ïÓG¹>K?ïÓGöê ?ïÓ6Ɖx?ïÓ6ÈÇ"¸?ïÓ&z}°8?ïÓ&|»YÁ?ïÓ+—û´?ïÓ-Õ¤?ïÓÙÕ–?ïÓÜ7Ô?ïÒõ…:ø\?ïÒõ‡xžs?ïÒå-Ì»Ü?ïÒå0 `Ì?ïÒÔÓˆ?ïÒÔÕÅ»Z?ïÒÄvq—(?ïÒÄx¯9Ë?ïÒ´‹X ?ïÒ´Èù‡?ïÒ£³ÖB8?ïÒ£¶âŒ?ïÒ“NPÓ?ïÒ“PŽr=?ïÒ‚æs*?ïÒ‚èB/?ïÒrzêÉý?ïÒr}(fÚ?ïÒb i¿?ïÒbFt?ïÒQœcs?ïÒQž ´?ïÒA(õ¿¡?ïÒA+3Y?ïÒ0²ÈX?ïÒ0µ(”?ïÒ 9ÛK?ïÒ <â?ïÒ¾,}—?ïÒÀj€?ïÑÿ?Áó³?ïÑÿAÿˆs?ïÑú?ïÑî¾ã¦?ïÑÞ5Fêk?ïÑÞ7„|Ø?ïÑͪùBÐ?ïÑÍ­6Ô?ïѽ½â?ïѽûr?ïѬ”\m?ïѬÑëZ?ïÑ›úA?ïÑ›ü¾¤?ïÑ‹d‡@ ?ïÑ‹fÄÌ¡?ïÑzË¥?}?ïÑzÍâÊé?ïÑj/Ý»?ïÑj2Ÿü?ïÑY‘4\?ïÑY“qå*?ïÑHï§\?ïÑHñä¡F?ïÑ8K9·>?ïÑ8Mw=ü?ïÑ'£ðžÇ?ïÑ'¦.$X?ïÑùÇÞ&?ïÑüb‹?ïÑLÆDL?ïÑOÇ…?ïÐõœëw•?ïÐõŸ(ù¡?ïÐäê7!R?ïÐäìt¢1?ïÐÔ4­°?ïÐÔ6ë/·?ïÐÃ|RaB?ïÐÃ~ßÇ?ïвÁ !Ê?ïвÃ]Ÿ!?ïТô ?ïТ\p6?ïБBMY‚?ïБDŠÔ}?ïЀ~¬6k?ïЀ€é°8?ïÐo¸A.$?ïÐoº~¦Â?ïÐ^ï &V?ïÐ^ñJÅ?ïÐN# Ka?ïÐN%IÁ¢?ïÐ=THþ?ïÐ=V†s‘?ïÐ,‚ÁÌ?ïÐ,„ÿ?ê?ïЮrçÃ?ïа°Zw?ïÐ ×f²h?ïÐ Ù¤#ì?ïÏùý›¾b?ïÏùÿÙ.·?ïÏé! n?ïÏé#Jˆ’?ïÏØ?Þ‚?ïÏØBíu?ïÏÇZuÎ!?ïÏÇ\³:å?ï϶rD©?ï϶tW° ?ï΄-š+Þ?ï΄/×ß?ïÎs¼§k?ïÎsùü8?ïÎaí‰N?ïÎaïNÜç?ïÎPÈœŸ?ïÎPÊÙT?ïÎ?¡YvG?ïÎ?£–Çv?ïÎ.wOk•?ïÎ.yŒ»Ž?ïÎJ|t?ïÎL¹ÂË?ïÎ ãÅ#?ïÎ !±?ïÍú舔²?ïÍúêÅá ?ïÍé³hS—?ïÍéµ¥ž¹?ïÍØ{ŠØ%?ïÍØ}È"?ïÍÇ@í–ƒ?ïÍÇC*ß8?ïͶ¸Þs?ïͶö%ñ?ïͤ¾NJ?ïͤÀ‹a?ïÍ“w÷ò?ïÍ“z4V?ïÍ‚.°{y?ïÍ‚0í¿P?ïÍpâ?ïÍpä¾Jº?ïÍ_“iu?ïÍ_•¦¶i?ïÍNAi\k?ïÍNC¦œš?ïÍ<ìƒËþ?ïÍ<îÁ õ?ïÍ+”º¬F?ïÍ+–÷ê?ïÍ: ,¶?ïÍÕø?ïÊÅw{èx?ïʳ´*?ïʳ¶D;`?ïÊ¡ïðò(?ïÊ¡ò.(?ïÊ)n@?ïÊ+>}?ïÊ~_:ƒ‹?ïÊ~aw‘ ?ïÊl’–H*?ïÊl”ÓTh?ïÊZÃuö?ïÊZÅ[€ó?ïÊHðÒºc?ïÊHóÄ?ïÊ7°‹2?ïÊ7퓬?ïÊ%C¾IÄ?ïÊ%EûPý?ïÊhýâb?ïÊk:èY?ïÊ‹j–þ?ïʧ›³?ïÉï« ç,?ïÉï­Hêž?ïÉÝÇäÞø?ïÉÝÊ!á(?ïÉËáïªÔ?ïÉËä,«Á?ïɹù2¯>?ïɹûo®è?ïɨ ³3 ?ïɨð1r?ïÉ–l…?ïÉ–!©‚C?ïÉ„.bÓ¯?ïÉ„0ŸÏ?ïÉr:™1`?ïÉr<Ö+ý?ïÉ`D -?ïÉ`FI ‡?ïÉNHþéú?ïÉNK;â?ïÉ3y"ƒ?ïÆ>5µãc?ïÆ+¶™K9?ïÆ+¸Ö Ì?ïÆ6ß®?ïÆ9Ýó?ïÆ´K[è?ïƶˆà?ïÅô.Ý«?ïÅô1fÈ?ïÅᦗß^?ïÅá¨Ô™º?ïÅÏ|ݶ?ïÅϹ–Ã?ïż‹CÌ?ïżÇû‹?ïÅ©üÈ°?ïÅ©ÿÓ ?ïÅ—i2ì?ïÅ—kn¾ ?ïÅ„ÒÉÎÚ?ïÅ„Õ‚­?ïÅr9•Œf?ïÅr;Ò>é?ïÅ_“æx?ïÅ_ŸÐ—¬?ïÅLþÄ•á?ïÅMEÅ?ïÅ:]+˜b?ïÅ:_hFö?ïÅ'¸É¹Ð?ïÅ'»g?ïÅ ×ó?ïÅ݃ç?ïÅg°±8?ïÅií[Ü?ïÄïºþV&?ïÄï½:ÿy?ïÄÝ ‡g­?ïÄÝ Ä¯?ïÄÊYP÷Ÿ?ïÄÊ[žP?ïÄ·¢­²æî¹!?ïÃ>é+Cú?ïÃ+òϪ^?ïÃ+õ 3á?ïÃûàý5?ïÃþ…c?ïÃ%Œ ?ïÃbx?ïÂó 3Ä?ïÂóܹE?ïÂàMŠ?ïÂàŠ3?ïÂÍ2„[?ïÂÍo/?ï¹ÿOê“?ﺌl?ï¦÷§ê?ï¦ùä?ï“í:A×?ï“ïvÀ¦?ï€à ÓØ?ï€âFQP?ïÂmÐ ¼?ïÂmÒR…Ü?ïÂZ»À÷?ïÂZ½ýqä?ïÂG£Wþð?ïÂG¥”x`?ïÂ4ˆ˜~?ïÂ4Š>–?ïÂ!iÀ´?ïÂ!küös?ïÂH˜z[?ïÂJÔïÁ?ïÁû$‡ä?ïÁû&Èñ?ïÁçý Å?ïÁçÿË€y?ïÁÔÓ´,È?ïÁÔÕðž"?ïÁÁ¦öO?ïÁÁ©2…P?ïÁ®wUu¸?ïÁ®y‘ä_?ïÁ›DÖÔ?ïÁ›G…!?ïÁˆu’?ïÁˆ±ý÷?ïÁt×9ÀÌ?ïÁtÙv+d?ïÁaœ =†?ïÁaž\¦Ä?ïÁN^,Õ?ïÁN`i<÷?ïÁ;aD.?ïÁ;ªµ?ïÁ'Ù¾@²?ïÁ'Ûú¥ß?ïÁ“Brþ?ïÁ•~ÖÏ?ïÁIñªû?ïÁL. q?ïÀíýпL?ïÀî e?ïÀÚ®Ú?:?ïÀÚ±žø?ïÀÇ]§?ïÀÇ_Rw?ïÀ´„Ö?ïÀ´ À]Û?ïÀ ± ›?ïÀ ³\÷7?ïÀVñÊ?ïÀY.$^?ïÀyùúY>?ïÀyü6²,?ïÀfš7÷å?ïÀfœtOv?ïÀS7¯|?ïÀS9ëׯ?ïÀ?Ò_®?ïÀ?Ôœì?ïÀ,jIC®?ïÀ,l…—&?ïÀÿqF?ïÀ­q`?ïÀ‘׫?ïÀ”Sg?ï¿òâ–Ð?ï¿ò"æ.?ï¿Þ©Þ‘Y?ï¿Þ¬ßW?ï¿Ë0ñqw?ï¿Ë3-¾?ï¿·µÂc?ï¿··S £?￤6UF?￤8‘ÿ?ï¿´®¦X?￶êîÙ?ï¿}0x5?ï¿}2[¿V?ï¿i¨­yº?ï¿iªé¿{?ï¿VZWk?ï¿V –›Í?ï¿B‘"«¶?ï¿B“^î·?ï¿/ 9??ï¿/Izß?ï¿n«?ï¿pVëÁ?ï¿ØI¨È?ï¿Ú…ç¦?ï¾ô?›ãŠ?ï¾ôAØ!?ï¾à¤ ?ï¾à¦RT&?ï¾Í³çæ?ï¾Íð" ?ï¾¹d|Õ?ï¾¹f¸P-?ï¾¥ÀmR ?ﾥ©Š?ï¾’ˆN ?ï¾’Ä„´?ï¾~oÐÇÈ?ï¾~r üù?ï¾jÃIy6?ï¾jÅ…­?ï¾Wì ²?ï¾W(>?ï¾CaÄMº?ï¾Cd~Ã?ï¾/¬Íîö?ï¾/¯ œ?ï¾õ ¬9?ï¾÷FÚ{?ï¾:|C?ï¾<¸oþ?ï½ô}%s9?ï½ôaž´?ï½à½÷…?ï½à¿@!œ?ï½Ìú•t?ï½ÌüZ¾'?ï½¹4t ?ï½¹6°2b?ï½¥l ?ï½¥n@?‰?ｑ Ô†N?ｑ£ªÒ?ï½}ÑSOc?ï½}Órƒ?ï½iýÅ©?ï½jÊÖ?ï½V'NH?ï½V)Š1œ?ï½BMð'L?ï½BP,F;?ï½.q§Œ˜?ï½.sãª!?ï½’yâk?ï½”µþŽ?ï½°gËl?ï½²£æ(?ï¼òËqë ?ï¼òÍ®ö?ï¼Þã–êB?ï¼ÞåÓ0?ï¼ÊøÝh©?ï¼Êû1?ï¼· CÒ?ï¼· %ó?ＣɊ|?ï¼£ž5?ï¼'t{$?ï¼)°v?ï¼{1CŽ~?ï¼{3Ÿh?ï¼g88nž?ï¼g:t~?ï¼SÔy?ï¼?=˜E¢?ï¼??ÔRS?ï¼+<•,?ï¼+>B t?ï¼7¡b0?ï¼9Ýl?ï¼0fdð?ï¼2¢mg?ï»ï&\@a?ï»ï(˜Go?ï»Û€¯?ï»Û¼´½?ï»Ç ÔeÑ?ï»Ç j ?ﻲ÷\ é?ﻲù˜º?ﻞâ``?ﻞäSaÇ?ﻊʶ?ﻊÌA²?ï»v¯*çŽ?ï»v±fæ ?ï»b‘‰|Ú?ï»b“Åz?ï»Nq¡¾?ï»NsZ{?ï»:MðúÀ?ï»:P,õ?ï»&(Gá?ï»&*<@È?ï»ÿKO‰?ﻇG?ïºýÒOôŸ?ïºýÔ‹ê®?ïºé¡O,¬?ïºé£‹!P?ïºÕmaªj?ïºÕo¡?ïºÁ6‹øO?ïºÁ8Çê?ﺬüѤÍ?ﺬÿ •,?ﺘÀ/aü?ﺘÂkPí?ﺄ€¨À?ﺄ‚ä®?ïºp>?[~?ïºp@{G–?ïº[øñß–?ïº[û-Ê@?ïºG°ÆÎ?ïºG³·R?ïº3e¼Õ?ïº3gø¼ç?ïºÓŸ8?ﺅ™?ïº Ç ÒÏ?ïº ÉG·Á?ï¹ösj÷ü?ï¹öu¦Û€?ï¹âíÏf?ï¹â)±{?ï¹ÍØè‰?ï¹ÍÅÔÉ0?ï¹¹gnßh?ï¹¹iª¾ ?ï¹¥lyˆ?ï¹¥ ¨WQ?﹦–GÈ?﹨Ò$!?ï¹|AìöÆ?ï¹|D(ѯ?ï¹gÚoC'?ï¹gÜ« ?ï¹Sp#°/?ï¹Sr_ˆ8?ï¹?¤?ï¹?CÚ=?ï¹*“׸?ï¹*•[¬á?ï¹ gý­?ï¹"£Ñe?﹪çñ¬?ï¹­#Ãô?ï¸í2œ‡~?ï¸í4ØXT?ï¸Ø·ŠS¶?ï¸Ø¹Æ#?ï¸Ä9² é?ï¸Ä;íÙÝ?︯¹o±?︯»O<4?︛5±&1?︛7ìñA?︆¯‹è”?︆±Ç²3?ï¸r%'9a?ï¸r'cŽ?ï¸]–ÁøÞ?ï¸]˜ý¿˜?ï¸Is?ï¸I®ÜK?ï¸4q:6•?ï¸4suúi?ï¸ÚÃ?ï¸ÜX…c?ï¸ @VŒ?ï¸ BWz?ï·ö£4 a?ï·ö¥p_Û?ï·âi>&?ï·â¤ü,?ï·Í`Àˆ)?ï·ÍbüD¼?ï·¸»3mŽ?ï·¸½o(¬?ï·¤ÉG¤?ï·¤N?ï·gÁ2?ï·i½yg?ï·z¹[‘~?ï·z»—H>?ï·f\&¦?ï·f —Ûñ?ï·QTƒ.Þ?ï·QV¾â´?ï·<ÐZ0?ï·<  ‘?ï·'äH"p?ï·'æƒÓ\?ï·'ë-ã?ï·*&ÝX?ï¶þh¸;?ï¶þjóé?ï¶é¦±Üz?ï¶é¨í‰?ï¶ÔáÙ°f?ï¶Ôä[y?ï¶À1Uî?ï¶Àlÿ‹?ﶫO¹xò?ﶫQõ!?ﶖ‚t®4?ﶖ„°Tã?ﶲb¯£?ﶴžTÚ?ï¶lß„,”?ï¶lá¿ÐT?ï¶X Ý£?ï¶X Ec?ï¶C1mÜû?ï¶C3©}Ì?ï¶.V6¡?ï¶.Xrú?ï¶x< ?ï¶zw§í?ﶗzq?ﶙ¶ o?ïµï³÷(?ïµï¶2à ?ïµÚÌ<ûÿ?ïµÚÎx•v?ïµÅà‡ç†?ïµÅâÄ?ïµ°ñèbë?ïµ°ô#ùp?ﵜd²P?ﵜ G[?﵇ öÌŠ?﵇2`?ïµr¦Úé?ïµrâm?ïµ]rŸ†?ïµ]®0$?ïµH[¦?ïµH—5=?ïµ3c{?ïµ3Ÿ¼?﵌œù?ïµÈ)'?ïµ ÕÅZ?ïµ P ?ï´ô BeÒ?ï´ô}ï ?ï´ßÒ+Š?ï´ß ³F?ï´Éò‡˜?ï´ÉôÃ]?ï´´ád<‡?ï´´ãŸÁL?ï´ŸÍh¹Ü?ﴟϤ=%?ï´Š¶”Á÷?ï´Š¸ÐCÄ?ï´uœìº(?ï´uŸ(:x?ï´`€oeš?ï´`‚ªän?ï´Kaiô?ï´KcXçL?ï´6>û-Ê?ï´6A6©¤?ï´! W–?ï´!DÑó?ï´ òGŸr?ï´ ôƒR?ï³öǹ}H?ï³öÉôôª?ï³áš_š€?ï³áœ›d?ï³Ìj7Ô?ï³ÌlsHg?ï³·7G‚t?ï³·9‚õ]?ï³¢A%?ï³¢˲?ﳌÉá?ﳌËJqÍ?ï³wÉ0?ï³wŒ?ï³bOÁ"q?ï³bQü_?ï³Môó?ï³M0^t?ï³7Éø;Ü?ï³7Ì3¥Ë?ï³")é?ï³"ƒ@’Y?ï³ 5)©g?ï³ 7eW?ï²÷æfMT?ï²÷衲Ä?ï²â”¿a[?ï²â–úÅK?ï²Í@2°?ï²ÍBns?ï²·èÄ…ô?ï²·êÿæâ?ï²¢Žsò?ï²¢®ý`?ï²1@À?ï²3{í¬?ï²wÑ0–p?ï²wÓkòÛ?ï²bnA‚ã?ï²bp|ÝÌ?ï²MtÜš?ï²M °6?ï²7ŸÍ–?ï²7¢p}?ï²"4L¬?ï²"6ˆd?ï² ÅñmI?ï² È,Â+?ï±÷T¿¬¹?ï±÷Vû?ï±áà¶/Ú?ï±áâñ¶?ï±ÌiÔª¢?ï±Ìlúû?ﱶð"3?ﱶò]ö?ﱡs‘¤?ﱡuØÞ÷?ﱋôC¹5?ﱋö?ï±vrÀV?ï±vtW ¢?ï±`í&J]?ï±`ïa“%?ï±Kea9¶?ï±Kgœ€ú?ï±5ÚÏ÷?ï±5Ý <Ô?ï± Mtÿ´?ï± O°Cï?ï± ½O$ö?ï± ¿Šg­?ï°õ*`åï?ï°õ,œ' ?ï°ß”­¬œ?ï°ß–èìH?ï°Éü2xc?ï°Éþm¶‹?ï°´`óŸµ?ï°´c.ÜW?ï°žÂñÎÅ?ï°žÅ- á?ï°‰ Çe„?ï°‰#Ÿ?ï°szª"E?ï°s|åZU?ï°]ѧHÁ?ï°]ÓâJ?ï°H%»À;?ï°H'öõ>?ï°2vì«e?ï°2y'Þá?ï°Å9±z?ï°Çtão?ï°¢{[?ï°Ý«É?ï¯ñY,,&?ï¯ñ[g[ ?ï¯ÛžÔ›/?ï¯Û¡È?ï¯Åáœ]ö?ï¯Åã׉Í?ﯰ!‡¯V?ﯰ#ÂÙ¥?ﯚ^˜…?ﯚ`Ó7L?﯄˜ËX6?﯄›t?ï¯nÐ$ßÂ?ï¯nÒ`w?ï¯Y§¤?ï¯Yâ3Ñ?ï¯C6P°Æ?ï¯C8‹Ói?ï¯-e#G"?ï¯-g^h=?﯑#Ô?ﯓ^/d?ﯺK6¼?ﯼ†TÃ?ï®ëࢲº?ï®ëâÝÏ8?ï®Ö): ?ï®ÖdU?ï®À$Þ„œ?ï®À'ž?ﮪBÅŽ?ﮪEl?ï®”]àò÷?ï®”` J?ï®~v/Yà?ï®~xjn©?ï®h‹²©e?ï®hí¼£?ï®RžmSÀ?ï®R ¨es?ï®<®]Hà?ï®<°˜Y?ï®&»‡±~?ï®&½ÂÀ?ï®Åëf|?ï®È&sŒ?ï­ú͉î?ï­úÏÄr?ï­äÒdðš?ï­äÔŸú‘?ï­ÎÓ Â`?ï­ÎÕ[ÊË?ï­¸Ïîï¨?ï­¸Ò)ö†?ï­¢ÉÖ«à?ﭢ̱2?ï­ŒÀÙiª?ï­ŒÃmn?ï­v´ôö?ï­v·/!,?ï­`¦.‰®?ï­`¨iŠV?ï­J”…¡‚?ï­J–À ?ï­4úܨ?ï­4‚5Ú5?ï­h‘|½?ï­jÌx¼?ï­NJ@?ï­P… °?ï¬ò1%2È?ï¬ò3`+ª?ï¬Ü$T ?ï¬Ü_K]?ï¬ÅîHðb?ï¬Åðƒæ&?אָȓ?אָÊΑ7?﬙ ¹„?﬙¢A¬)?ffit¡Œ?ffivÜ¡?ï¬mFe w?ï¬mHŸûü?ï¬WS=*?ï¬WŽ+ ?ï¬@áoÐP?ï¬@㪼¶?ï¬*ª¹—Š?ï¬*¬ô‚`?ï¬q1.\?ï¬sl¡?ï«þ4ÚÀ–?ï«þ7¨J?ï«çõ´?…?ï«ç÷ï%¨?ï«Ñ³ÀÃ?ï«ÑµúõU?ï«»oš ?ï«»q;} ?ï«¥'vz©?ï«¥)±\?ï«ŽÝ"S?ï«Žß]2Ý?ï«xŠ±?ï«x’Ahû?ï«b@!ýË?ï«bB\Ú„?ï«Kíwøx?ï«Kï²Óž?ï«5˜ ãÚ?ï«5šE½n?ï«?Ùžþ?ï«Bvÿ?ï«㎾É?ï«åÉ•7?ïªòƒ\*?ïªò…–ÿi?ïªÜ AmÙ?ïªÜ"|A ?ïªÅºA¹ð?ïªÅ¼|‹£?絛Qa!É?絛S›ñè?滛å›Æ?滛çÖ”©?廒vó÷Î?廒y.ÄÅ?ïªllé˜?ïªl§´ú?ïªU‘eç?ïªU“@/µ?ïª?¿¿?ïª?ú‡R?ïª(ŸžGž?ïª(¡ÙA?ïª"žëì?ïª$Ù°ú?ï©û¢Ç„ö?ï©û¥Hn?ï©å Â÷?ï©å"R„Ú?ï©ÎšŽvÏ?ï©ÎœÉ7?喝-öv?喝hµ-?ï©¡†÷·[?ï©¡‰2t{?ï©ŠøìO ?ï©Šû' “?ï©thõH?ï©tjI¯;?ï©]Ô_`s?ï©]ÖšÏ?ï©G=ÝHi?ï©G@ÿ.?ï©0¤¦ä?ï©0¦È\?ï©p4¼?ï© ªèR?ï©iƒÌ‹?ï©k¾~‰?ï¨ìÇÊɺ?ï¨ìÊz ?ï¨Ö#Hg^?ï¨Ö%ƒ,?憎{ú£€?憎~5Pµ?﨨ÑæyZ?﨨Ô!$÷?晴% §‰?晴'FQ?ï¨{uiî@?ï¨{w¤–«?ï¨dË'?ï¨dÅ?1ú?ï¨N ÚaA?ï¨Ny?ï¨7Tž?ï¨7VÙ3£?ï¨ —~2¨?ï¨ ™¸Ô­?ï¨ ×x[‹?ï¨ Ù²û÷?ï§ó‘Ù?ï§óÈ0ª?ï§ÜNÀ~?ï§ÜPú·µ?ï§Å†ŸÀ?ï§ÅˆJ;\?燐º}‰¨?燐¼¸#©?輪ì Úû?輪îHs`?茶„8?ï§ù?ï§jFïƒ?ï§jHË„²?ï§So‡eJ?ï§SqÁøÝ?ï§<•£P€?ï§<—Ýâw?ï§%¸ã„Q?ï§%»¬?ï§ÙLãD?ï§Û‡r?ï¦÷öÞB?ï¦÷ùÏ+?ï¦á—TX?ï¦áÑßÞ?ï¦Ê)| x?ï¦Ê+¶ªa?靈>8P?靈@ÇÀœ?列PÊR?列SØ¿?礪`5»]?礪bp@n?ï¦nlÐåv?ï¦no hê?ï¦Wv›‰S?ï¦WxÖ )?ï¦@}š‹J?ï¦@Õ ‚?ï¦)ÌÉ?ï¦)„G­?旅0FH?礪jÃB?ï¥ûÉè¨?ï¥û„d?ï¥ä}›%F?ï¥äÕŸ?ï¥Ív£º]?ï¥ÍxÞ2{?略låú|?略o pú?寧`bW?寧bœö6?賂QY|?賂SQÌ»?ï¥q? ­?ï¥qAE’M?ï¥Z(ô/?ï¥Z+..?ï¥Cüb’?ï¥C6Ðñ?ï¥+ò?Î?ï¥+ôY¬Œ?ï¥Ò^ãb?ï¥Ô™N€?ï¤ý¯¼­-?ï¤ý±÷ª?ï¤æŠ6’Ì?ï¤æŒpú¨?ï¤ÏaÒ;r?ï¤Ïd ¡¬?露6ŒÃô?露8Ç(Œ?嵐jÓ?嵐 ¤É?契×jÔÌ?契٥6 ?ï¤r£Œá(?ï¤r¥Ç@Ú?ï¤[lÕëÔ?ï¤[oIä?ï¤D3FŒ?ï¤D5€Ûù?ï¤,öÜš¦?ï¤,ùõp?路›Wú?魯ձ"?ï£þu…Ò ?ï£þwÀ)?ï£ç0š 8?ï£ç2Ô`?ï£ÏèÛZ?ï£Ïëp—?žJq~? „Ä?PæçÐ?S!8Å?²Ãƒ?íÔ?ï£r­±!Ö?ï£r¯ëo‚?ï£[Wß2 ?ï£[Z~?ï£CÿAÄr?ï£D|Õ?ï£,£Ø”¥?ï£,¦Ýc?ï£E¤8'?ï£GÞ??ï¢ýä¦ö:?ï¢ýæá;­?ï¢æ€áeÂ?ï¢æƒ©?ï¢ÏTöÂ?ï¢Ï8é?±×?³=ZY?Dî?G(Ví?ÖÛr?ØO§?ï¢qc4Ô*?ï¢qeo¸?ï¢Yì{]?ï¢Yîµ—…?ï¢BrÜv‡?ï¢Bu®Ç?ï¢*öZP-?ï¢*ø”†Æ?ï¢vöD‡?ï¢y0yy?ï¡ûô°Öé?ï¡ûöë 3?ï¡äoŒ9Ý?ï¡äqÆk?ï¡Ìç‰É?ï¡ÌéÃøû?\¨[Æ?^âŠ?ï¡Îê&¢?ï¡Ñ$SK?>P‡‚?@Š²‚?ï¡nªÜ=?ï¡n­/“?ï¡WŽ"?ï¡WÈ)Ð?ï¡?{h±p?ï¡?}¢×t?ï¡'ßlò?ï¡'á¦ÂL?ï¡@›( ?ï¡BÕKQ?ï øžôÜà?ï ø¡.ýç?ï àúyq+?ï àü³ˆ?ï ÉS+ô¼?ï ÉUfo?ï ±©v?ï ±«I’ˆ?ï ™ü"O?ï ™þ\¬?ï ‚Ld*Ì?ï ‚NžC~?ï j™Ú¨·?ï jœ¿¾?ï Räƒ?ï Ræ½¢y?ï ;,`?,?ï ;.šRÜ?ï #quzî?ï #s¯Œò?ï  ³¿©t?ï  µù¹Í?ïŸóóA ?ïŸóõ{¸?ïŸÜ/þVv?ïŸÜ28cv?ïŸÄióþ¨?ïŸÄl. û?¡%"?£_É?Փ6?×Í/?ïŸ}:–?ïŸ}<@â?ïŸe2™ÿ?ïŸe4Ô±?ïŸM\O¦f?ïŸM^‰©X?ïŸ5ƒ!3 ?ïŸ5…[4N?ͬ?JÍB?ïŸÈ!rí?ïŸÊ[pÔ?ïžíæS£Í?ïžíè ?ïžÖ£¿É?ïžÖݺS?ïž¾?ïž¾T‡ø?/´r©?1îiÕ?Brƒ?D¬¸?ïžvRWªž?ïžvT‘žk?ïž^_c°¨?ïž^a¢Å?ïžFi–ˆ6?ïžFkÐx¤?ïž.põªè?ïž.s/™¥?ïžu'+?ïžw¹9?ïþw2³?ïþylžm?ïævÈ”?ïæxO²@?ïÎr$¢?ïÎt]é?ï¶ka3ø?ï¶m›B?ïžaÑ4™?ïžd 1?ï†UqEÿ?ï†W«(æ?ïnFC™ø?ïnH}{.?ïV4K4y?ïV6…ü?ï>†-°?ï>!À ‚?ï&õd?ï& .ñƒ?ï íž8F?ï ïز?ïœõÐ~ßl?ïœõÒ¸¸&?ïœÝ°—œ„?ïœÝ²Ñs‹?ïœÅî»ö?ïœÅ(‘J?h%?j¸éÆ?@K³(?B……?ïœ}â¦?ïœ}X²à?ïœdä!€Œ?ïœdæ[O?ïœL±?S?ïœL³yN$?ïœ4{|¥ì?ïœ4}¶q ?ïœBÖùH?ïœE±?ïœOË?ïœ ‰’Â?ï›ëÈîH?ï›ëË'åG?ï›Ó‡­‘d?ï›Ó‰çU®?ï›»CBï?ï›»Eʃ?ü—…N?þÑF-?²Äªi?´þi‘?ï›rf­?ï›rhR ?ï›Z•?ï›ZÎÒÔ?ï›AÄ9e?ï›AÆs–?ï›)otà?ï›)q@-0?¤?ï›;_=?ïšø¼'wö?ïšø¾a,Ø?ïšà^y9†?ïšà`²ì±?ïšÇýý ”?ïšÈ6Ò?š¯§–?œéWQ?ïš—4ˆ„?ïš—6Ê6‡?ïš~ˤXÔ?ïš~ÍÞ ?ïšf_èfˆ?ïšfb"?ïšMñ_©î?ïšMó™RÉ?ïš5€V?ïš5‚Iý*?ïš õO?ïš.ôp?ïš•¿®?ïš—Jc^?ï™ìh ‰?ï™ì¡®€?ï™ÓžõP?ï™Ó¡.ðV?ï™»¼S¯?ï™»!õò4?Äj?Ÿýµ4?¼Ç?@WØ?ï™qUäc?ï™q’}º?ï™Y×ì•?ï™Y„1?ï™@tuS*?ï™@v®é ?ï™'â2—ü?ï™'äl,"?ï™MÑ?ï™OKcm?ï˜öµCG?ï˜ö·IÓö?ï˜Þ.kð?ï˜Þgúä?ï˜Å|s3j?ï˜Å~¬À£?Ûج›?Þ8?8d%î?:¯¯?ï˜{’QJ?ï˜{”NÙN?ï˜bèí{¦?ï˜bë'í?ï˜J<î¿V?ï˜J?(Cá?ï˜1ŽÐ?ï˜1RS^?ï˜Üp0˜?ï˜Þ©±©?ï˜'ïÉU?ï˜*)H¨?ï—çpœéÑ?ï—çrÖgg?ï—ζwI\?ï—θ°Å5?ï—µùlÀ?ï—µû¸æÚ?ï—9¹Ö^?ï—;óN»?ï—„w$§1?ï—„y^Ï?ï—k±Á2?ï—k³ú¦ð?ï—Ré‘–?ï—RëË =?ï—:“÷ê?ï—: ÍiL?ï—!PͦØ?ï—!S{?ï—€@ª?ï—‚z0Ž?ï–ï¬éÛ?ï–ï¯#GC?ï–ÖÖÇäâ?ï–ÖÙOF?ï–½ýä(n?ï–¾‘?ï–¥"8×?ï–¥$r=ö?ï–ŒCÊuÃ?ï–ŒFÚç?ï–sb›'‡?ï–sdÔŠë?ï–Z}{»?ï–Zµ½?ï–A”_y?ï–A–È¿[?ï–(¨ÆH£?ï–(ªÿ¦Ä?ï–ºÍG?ï–¼S)¦?ï•öÈñ?ï•öÊÉK¤?ï•ÝÔ&Ì?ï•ÝÖ_[¨?ï•ÄÜÞÜU?ï•Äß3n?ï•«âºøW?ï•«äôM®?ï•’å½û?ï•’ç÷N™?ï•yåã£=?ï•yèõ?ï•`ã1*¨?ï•`åjz¸?ï•GݧØ*?ï•Gßá&v?ï•.ÕEËô?ï•.×~?ï•Ê Ný?ï•ÌE™Ã?ï”ü¼dE?ï”ü¾:­H?ï”ã« Ñ„?ï”ã­ZÃ?ï”Ê—lªÑ?ï”Ê™¥ðK?ï”±€åq¾?ï”±ƒµu?gŽÍ?iÈ€?ï”Kfö?ï”MŸ\#?ï”f,ròM?ï”f.¬0¶?ï”M ¯‹–?ï”M èÈ9?ï”3æÇí?ï”3èXË?ÅáM?ï”Àÿf?ï””¡qD?ï”–Ú¨˜?ï“èg±þÜ?ï“èië4i?ï“Ï7ý?ï“Ï:6Àâ?€¸þ?¹êÿ?ï“œÐ>d\?ï“œÒw”–?˜7àh?šqÜ?ï“j]l&¢?ï“j_¥SO?ï“QÝR?ï“Q"|ö?ï“7ÞgßU?ï“7à¡u?ï“™,µ ?ï“›eÜd?ï“Q £‚?ï“SFÉ?ï’ì?ï’ìH+Ï?ï’Ò¸2è%?ï’Òºl %?ï’¹gxó?ï’¹i²J?ï’ á ™?ï’ ¿?ï’†½o¿??ï’†¿¨Ûå?ï’mdã›?ï’mfXþx?ï’TûÈ?ï’T 4/Ü?ï’:¨û™8?ï’:«4°ƒ?ï’!G!ª?ï’!IZ5,?ï’ât² ?ï’ä­ÅØ?ï‘îzïµ?ï‘î}(£?ï‘Õ– +?ï‘ÕÏO?ï‘»£k?ï‘»¥¤x?ï‘¢3lÎ?ï‘¢5¥)]?Àš–â?ÂÓ¡¦?ï‘oJú T?ï‘oM3M?ï‘UÒŠ9†?ï‘UÔÃ@´? —?ï‚ØÒ2?ï‚ÅN?ïéî“&]?ïéðË?ïÎÃtµ”?ïÎŬ¤Ý?ﳕƒD?ï³—ºï£?ï˜d½Âò?ï˜fõ®g?ï}1%hj?ï}3]Qõ?ïaú»Ör?ïaüó¾?ïFÁS£?ïF÷9Y?ï+…r~?ï+‡ªaà?ïFšX?ïHÒ7?ï€õòR?ï€õ*1ö?ï€ÙÀ~p¢?ï€Ù¶Nª?y>5ø?{v?/2Ïí?1jª?â]lÕ?ä•E?ï€l’¿óÖ?ï€l”÷Ê/?ï€Q@X²~?ï€QB†ë?ï€5ë+Ì?ï€5íbÔL?8´?oâG?ïÿ8¢X?ïÿ:·pþ?ïãÛ,ò?ïãÝ9ùª?ïÈzÄzþ?ïÈ|üEÈ?ï­Ãns?ï­û7P?:?ï~ ¯F`?ï~ æùù?ï~cƒ×oú?ï~c†!¢?ï~Gú(s²?ï~Gü`#i?ï~,mª›˜?ï~,oâI`?ï~ÞW1Æ?ï~àŽÝœ?ï}õL2î€?ï}õNj˜f?ï}Ù·AÒQ?ï}Ù¹yzE?ï}¾O?ï}¾!¶õ?ï}¢„ëÖ"?ï}¢‡#z4?ï}†çŽùJ?ï}†éÆ›i?ï}kGd-P?ï}kI›Í}?ï}O¤l›T?ï}O¦¤9?ï}3þªÙ?ï}4âu]?ï}V!| ?ï}XY_?ï|üªÍiî?ï|ü­Q?ï|àü³[>?ï|àþêñ¯?ï|ÅKÒY?ï|ÅN í}?ï|©˜*#@?ï|©šaµÊ?ï|á¿r?ï|ã÷?ï|r(æ‡?ï|r*Çu*?ï|Vlaî?ï|VnÔî?ï|:­ëçŒ?ï|:°#rG?ï|ìxd7?ï|î¯ìý?ï|'=žS?ï|)u%%?ï{ç^Y…]?ï{ç`‘ ;?ï{Ë’›µ’?ï{Ë”Ó8z?ï{¯ÄW?ï{¯Æ7Ør?ï{“ò‹]?ï{“ôÂÛÿ?ï{x=.‘?ï{x t«™?ï{\GŸ?ï{\IO?ï{@mÂ?ï{@oRÞ?ï{$HÖ?ï{$’yü?ï{°Ÿœ?ï{²ÖôË?ïzìÎ$Ëd?ïzìÐ\>œ?ïzÐèÔÊã?ïzÐë <%?ïzµ²¼d?ïzµê+¯?ïz™Áݪ?ïz™ùJþ?ïz}'þa°?ïz}*5Í ?ïza7k‡o?ïza9¢ðÓ?ïzED %.?ïzEFBŒš?ïz)MÚÙR?ïz)P>Æ?ïz TÞ—p?ïz Wúí?ïyñYÏ?ïyñ[N0†?ïyÕZ„¤?ïyÕ\¼?ïy¹Y%¸Q?ïy¹[]ã?ïyUβ?ïyW8*K?ïyN"Î?ïyPI|n?ïyeD\õb?ïyeF”M ?ïyI7ãî?ïyI:u›?ïy-(¤b?ïy-*Ûµ»?ïyŸÎ?ïyÖg‡?ïxõØ–—?ïxõæV?ïxØêNŒQ?ïxØì…Ú?ïx¼Ðâ?ïx¼Ò9k­?ïx ²÷ù4?ïx µ/C?ïx„’+œØ?ïx„”bä¬?ïxhm·É?ïxhoïõ?ïxLFiS²?ïxLH —?ïx0?<Ð?ïx0v~²?ïxï>Í?ïxñuZ´?ïw÷¿e¡$?ïw÷Áœß?ïwÛŒµ„J?ïwÛŽìÀ8?ïw¿W-y¥?ïw¿Yd³—?ïw£Ò½?ïw£! O²?ïw†ãžæð?ïw†åÖç?ïwj¥˜~e?ïwj§Ï²`?ïwNdÀ«Ú?ïwNf÷Ý×?ïw2!‹?ïw2#O»?ïwÚ –?ïwÜÔ:˜?ïvù‘T+H?ïvù“‹WM?ïvÝE:'J?ïvÝGqQP?ïvÀöRæ?ïvÀøŠ?ïv¤¤Ÿ…’?ïv¤¦Ö«œ?ïvˆP¬?ïvˆRTЊ?ïvkøÑò0?ïvkû u?ïqõ0öž?ïqõ2VÈ3?ïqØdu=\?ïqØf¬ ê?ïq»–8u?ïq»˜>û?ïqžÄÝ)?ïqžÇõ?ïqðð>?ïqó&̵?ïqeK±j?ïqe‚xÙ?ïqH> Ÿž?ïqH@@e?ïq+_ëÑ ?ïq+b"”~?ïq~ô³?ïq+te?ïpñ›'`Z?ïpñ^¨?ïpÔ´‚ß´?ïpÔ¶¹œù?ïp·Ëð‹?ïp·Í?«Ç?ïpšÞ»R\?ïpšàò Ž?ïp}ï˜`?ïp}ñÏ*?ïp`ý¡,{?ïp`ÿ×áš?ïpDØÓð?ïpD ‡?ïp'?»ë?ïp'vlõ?ïp Ôï¨?ïp  ž©?ïoíšÞˆ?ïoíÑ‹}?ïoБBl?ïoÐÇíW?ïo³»å¤?ïo³òŽ„?ïo–‚¡?ïo–Q)v?ïoy¬Ô¸?ïoy ãy?ïo[ýr˜*?ïo[ÿ©:è?ïo>ïo—ú?ïo>ñ¦8¬?ïo!Þ¢7!?ïo!àØÕÈ?ïoË :J?ïoÍBÖä?ïnç´°å?ïnç¶æ­s?ïnÊ›ŽØÑ?ïnÊÅqS?ïn­¥˜?ïn­Ü/?ïn`úÐW?ïnc1d¿?ïns?Š4Ñ?ïnsAÀÇ,?ïnVV9V?ïnVŒÉ¤?ïn8ôaQ?ïn8ö—ßD?ïnʬ–>?ïnÌã"p?ïmþž4n_?ïmþ jøƒ?ïmánÿV÷?ïmáq5ß ?ïmÄ<³Ñ?ïmÄ>N9Ù?ïm§‘ôë?ïm§Èxå?ïm‰Ì4M[?ïm‰ÎjÏF?ïmlýŃ?ïml’4E^?ïmOPð4?ïmOS&”?ïm2û™?ïm2EwV?ïmÊW|>?ïmÌõë?ïl÷‚ʦ\?ïl÷…ú?ïlÚ8lâ@?ïlÚ:£WÎ?ïl¼ë;äf?ïl¼írWä?ïlŸ›8›?ïlŸn‚?ïl‚Hfz»?ïl‚Jœê?ïldòÂ,.?ïldôø™z?ïlGšP9B?ïlGœ†¤|?ïl*?²$?ïl*AHN?ïl áû?ïl ã;b&?ïkï€+д?ïkï‚b5»?ïkÒ‡DØ?ïkÒ½§Í?ïk´¶j?ïhïʉ6?ïhÒóo?ïhÒ)œq?ïh´i3lä?ïh´ki—®?ïh–µ¥^n?ïh–·Û‡ ?ïhxÿI§º?ïhyÎU?ïh[F!þÎ?ïh[HX#Q?ïh=Š.Çú?ïh=Œdêf?ïhËo¿_?ïh߲ͥ?ïh è–j?ïh ´¥?ïgäE˜a?ïgäGÎ}4?ïgÆ~€.D?ïgÆ€¶HN?ïg¨´¡ @?ïg¨¶×%0?ïgŠçûe ?ïgŠê1z÷?ïgmœ?ïgműZ?ïgOFah®?ïgOH—zS?ïg1qmäæ?ïg1s£ôp?ïg™¸ÄÃ?ïg›îÒ3?ïfõ¿C„?ïfõÁy$Û?ïf×â Tq?ïf×äA]­?ïfºà9?ïfºGç[?ïfœ]‘?ïfœ!“˜?ïf~9èµ}?ïf~<¸i?ïf`PÈ t?ïf`RþE?ïfBdp‚?ïfBfHo7?ïf$t…¶Þ?ïf$v»³x?ïf‚!•ö?ïf„Wt?ïeèŒë°?ïeè ù?ïeʔ߇?ïeÊ—Í?ïe¬™ýv¦?ïe¬œ3jÐ?ïeŽœKÓ€?ïeŽžÅ?ïep›É4×?ïepÿ$Ç?ïeR˜t«‰?ïeRšª™\?ïe4’OæP?ïe4”…Ò?ïe‰[E´?ïe‹‘/M?ïdø}™Ç ?ïdøÏ®†?ïdÚo Ë>?ïdÚqA°›?ïd¼]¯¿?ïd¼_å¢C?ïdžI‡ù›?ïdžK½Ú¼?ïd€2”ݪ?ïd€4ʼ­?ïdbØ ?ïdbŸ„?ïdCüR¾a?ïdCþˆ™&?ïd%Ý(ï?ïd%ß;–?ïdºïi?ïd½$ïð?ïcé–ŽÞ?ïcé˜IcF?ïcËnrîB?ïcËp¨ÀŠ?ïc­DC|?ïc­FD¥?ïcä©?ïcϲ?ïcpæ÷Îï?ïcpé-šØ?ïcR´IkÝ?ïcR¶5¥?ïc4~Ù?ö?ïc4ž?ïcFªKS?ïcHàÚ?ïbø º^?ïbø ð!u?ïbÙÎ ‡E?ïbÙÐ@H‰?ïb»Ÿ¹M?ïb»Õxp?ïbIŒç?ïbK¤?ïbåùª?ïb´‰?ïb`·j@Ð?ïb`¹ŸùŽ?ïbBjÌT?ïbBlN‚ð?ïb$ò´?ïb$(R-?ïbÆú©?ïbÉ/´?ïaçq.¯?ïaçsd_Q?ïaÉ‘¨~?ïaÉÇV?ïaª½%;?ïaª¿Zæý?ïaŒ^æŠ8?ïaŒa4?ïamýÙ.¨?ïanÖO?ïaO™ÿv6?ïaOœ5¹?ïa13W+Z?ïa15ŒÎ¹?ïaÉà ?ïa̪B?ï`ô]žò*?ï`ô_Ô‘@?ï`ÕP?ï`ÕðÇPA?ï`·|¹Rr?ï`·~îí??ï`™h®?ï`™ OV?ï`z°iL?ï`z’åÿÏ?ï`\Hò?ï`\¶ÝO?ï`=™‹ ¿?ï`=›À²ö?ï`ÐA ?ï`Ñ2?ï`—OÄj?ï`™…RV?ï_â ûœ?ï_âA‡b?ï_Ê:?ï_ÃŒ9‹Ù?ï_¤ÿ8áo?ï_¥nhè?ï_†q®3C?ï_†s㸕?ï_gáaÌd?ï_gã—O?ï_INU[$?ï_IPŠÜ(?ï_*¸‹ÕÂ?ï_*ºÁTŸ?ï_ o)?ï_ "7ëÞ?ï^턼Â9?ï^í†ò<Ç?ï^ÎåÔ…?ï^Îè ýj?ï^°C\4ë?ï^°E‘«)?ï^‘ž à??ï^‘ BTU?ï^rõì¡©?ï^rø"–?ï^TJ÷Y¢?ï^TM,Éf?ï^5/MŸ?ï^5Ÿd»:?ï^ì”Ø¥?ï^îÊD?ï]ø9)œÿ?ï]ø;_G?ï]Ù‚íör?ï]Ù…#]‘?ï]ºÉä*ù?ï]ºÌî?ï]œ P’?ï]œ@³]?ï]}Oc![?ï]}Q˜û?ï]^ñ?ï]^&r?ï]?É°l’?ï]?ËåÈÝ?ï]!¥ÿ²?ï]!ÛYÒ?ï]8Ðåœ?ï];=’?ï\ãl2à ?ï\ãnhë?ï\ÄœËTø?ï\ÄŸ¨˜?ï\¥ÊœãG?ï\¥ÌÒ4»?ï\†õ¨pÒ?ï\†÷ÝÀ?ï\hìv€?ï\h !Ãœ?ï\ICl‚Z?ï\IE¡ÍI?ï\*f'°Î?ï\*h\ù’?ï\ †d?ï\ ˆSªŸ?ï[ì£T̉?ï[쥊ó?ï[ͽÈ!T?ï[Í¿ýc‘?ï[®Õ{NÂ?ï[®×°ŽÒ?ï[êoüz?ï[ì¥:]?ï[pü£cò?ï[pþØŸ§?ï[R .?ï[RNM¶?ï[3ÒµÇ?ï[3í ?ï["ÌâŽ?ï[%º?ïZõ)*q\?ïZõ+_¤Y?ïZÖ+ûÝw?ïZÖ.1E?ïZ·+÷â4?ïZ·.-Ô?ïZ˜) e?ïZ˜+UGÖ?ïZy#tá¿?ïZy%ª ?ïZZ÷Ñ‹?ïZZ,ù?ïZ;¨¢¾?ïZ;ÝÈ¡?ïZ‹wä?ïZÀ›—?ïYüðž%5?ïYüòÓF¸?ïYÝÜâéb?ïYÝßµ?ïY¾ÆZÀv?ïY¾ÈÝ™?ïYŸ­"+?ïYŸ¯9=?ïY€áï.?ïY€“ï?ïYaqöf³?ïYat+}C?ïYBP?`ç?ïYBRtuF?ïY#+½Ü ?ïY#-òî8?ïYt¹B?ïY©É>?ïXäÚcµB?ïXäܘà ?ïXÅ­Š‘?ïXů¿™)?ïX¦}ìÄ~?ïX¦€!Íä?ïX‡KŠ?ïX‡M¿7?ïXh`e>?ïXh•j??ïXHÞu±*?ïXHળù?ïX)£ÇÙˆ?ïX)¥üÚ$?ïX fUþ[?ïX hŠüÃ?ïWë&&$?ïWë([ G?ïWËã4I|?ïWËåiC~?ïW¬q'?ïW¬Ÿ¶hõ?ïWU¾?ïWWF´)?ïWn 㳬?ïWn §?ïWN»øSÆ?ïWN¾-D÷?ïW/kS",?ïW/mˆ)?ïWÞ?ïWEËf?ïVð¿E²8?ïVðÁzœË?ïVÑd¨-?ïVÑfÝx‹?ïV²8J?ïV² mus?ïV’¦ôÇ[?ïV’©)«N?ïVsCáN?ïVsF/Ü?ïVSÝýÛ~?ïVSà2»?ïV4uIˆ«?ïV4w~eü?ïV Èk\?ïV ýFw?ïUõ›yX?ïUõ®v=?ïUÖ*^W?ïUÖ,’î?ïU¶¶wq ?ïU¶¸¬F?ïU—?ÄǶ?ïU—Aù™ö?ïUwÆGŽ?ïUwÈ{ã—?ïUXIÿîz?ïUXL4¼K?ïU8Êï³Î?ïU8Í$g?ïUIýR?ïUKLƳ?ïTùÄzd×?ïTùƯ,?ïTÚ=,R?ïTÚ?HñC?ïTº²è,„?ïTºµïº(?ïSÝžj5Ý?ïSÝ žé?ïS½þ1®?ïS¾f^í?ïSž[9/¬?ïSž]mÞ_?ïS~µ…o¶?ïS~·º.?ïS_ ’?ïS_J<Ì?ïS?aé[Â?ïS?dÅ?ïS³&jƒ?ïSµ[J?ïSÝ·2?ïSZ¿?ïRàKÁyÙ?ïRàMö*?ïRÀ“ÕQ?ïRÀ– ¼f?ïR Ùu?ïR ÛKN?ïRˆmž?ïR½;?ïRa[,yT?ïRa]a´?ïRA˜½?ïRAš6SÁ?ïR!Ò¸Ý?ïR!Ô;LÄ?ïR @¯~?ïR uA(?ïQâ=®½á?ïQâ?ãMN?ïQÂoQ<5?ïQÂq…Ée?ïQ¢ž)½Þ?ïQ¢ ^HÑ?ïQ‚Ê7þf?ïQ‚Ìl‡?ïQbó~/?ïQbõ²µŠ?ïQCúÑß?ïQC/V?ïQ#=±ð?ïQ#?ær?ïQ^¢ –?ïQ`ÖŒR?ïPã|̼l?ïPã9é?ïPØ2÷Ì?ïPÚgs ?ïP£°ÓC™?ïP£³¼˜?ïPƒÆ±©p?ïPƒÈæ 0?ïPcÙÎ…i?ïPcÜùé?ïPCê)—^?ïPCì^ ž?ïP#÷ÃÙF?ïP#ùøIF?ïPžEV?ïPÒ³?ïOä ¹Ö?ïOä îA’?ïOÄ¿8?ïOÄM(x?ïO¤¹‰Ñ?ïO¤íðÑ?ïO„œ•/?ïO„Ðùî?ïOdIJj?ïOdùè?ïOD 2A+?ïOD f¡h?ïO$ ›k?ïO$?ùf?ïOôc€x?ïOö—Ü2?ïNãäç†Î?ïNãçàE?ïNÃÒœG%?ïNÃÔОZ?ïN£½y$?ïN£¿µÎ?ïNƒ¥–97?ïNƒ§Ê‹ç?ïNcŠÛxi?ïNcÈÖ?ïNCmVjÛ?ïNCoŠ¹?ïN#M†ÿ?ïN#O6Òç?ïN)áZÀ?ïN,¤e?ïMã÷~^?ïMã+Å¿?ïMÂÛB=Ð?ïMÂÝv‚í?ïM¢¯Â‹ê?ïM¢±öÎÃ?ïM‚{.J?ïM‚ƒ¯nß?ïMbPkàô?ïMbR E?ïMB“ÅJ?ïMBÈV?ïM!åö<Ú?ïM!è*v¢?ïM¬‘΀?ïM®Æ?ïLápi@¬?ïLárué?ïLÁ1|Qª?ïLÁ3°„£?ïL ïÌ‘Î?ïL òÂ?ïL€«Y%L?ïL€­S¹?ïL`d'? ?ïL`f[kH?ïL@2ý?ïL@g&ô?ïLÍ}Uú?ïLϱ}•?ïKÿ~ áÎ?ïKÿ€?#?ïKß+Øöd?ïKß. s?ïK¾Öé&?ïK¾ÙFÝ?ïKž>8’?ïKžrW?ïK~$Ö»?ïK~' ×@?ïK]dz¥ó?ïK]Éç¿å?ïK=g×'?ïK=j >°?ïKjÔ?ïKž37?ïJü|5y?ïJüŸ°H”?ïJÜ3¿‡­?ïJÜ5ó˜?ïJ»Ç2—S?ïJ»Éf¥Ý?ïJ›WÕ·(?ïJ›Z Ãi?ïJzå«Þ?ïJzçßÖ?ïJZp²ß«?ïJZræç[?ïJ9øî)F?ïJ9û".¬?ïJ~]Ó¶?ïJ€‘ÖÓ?ïIù3R?ïIù64%?ïIØ€Úi?ïI؃g©?ïI·ýêÿ˜?ïI¸û×?ïI—x2~`?ïI—zfxU?ïIvï°ù?ïIvñãÿ£?ïIVdg(?ïIVf›‚ˆ?ïI5ÖXÊ–?ïI5ØŒ½«?ïIEƒ}ž?ïIG·nh?ïHô±êcØ?ïHô´RW?ïHÔŒR?ïHÔ¿ô†?ïH³‚k(ü?ïH³„Ÿã?ïH’æˆ?ïH’è¼²?ïHrGã@L?ïHrJ%›?ïHQ¦|èÐ?ïHQ¨°ËÔ?ïH1WÖ?ïH1‹¶¹?ïH[qüê?ïH]¥ÛU?ïGï±Îq?ïGï´ø?ïGÏm(?ïGÏ¡å?ïG®VOz¢?ïG®XƒR&?ïG¤tÖƒ?ïG¦¨«º?ïGlïßû?ïGlòÍñ?ïGL8«/?ïGL:Ä{Ë?ïG+~‡Ci?ïG+€»¶?ïG Àò®?ïG Ã&z?ïFéÿß–h?ïFê`?ïFÉ;ýUž?ïFÉ>1?ïF¨uNý?ïF¨wË?ïF‡«ÎeL?ïF‡®(?ïFf߀Žõ?ïFfá´Oj?ïFFgÎò?ïFF›?ïF%>‚®?ïF%@¶ié?ïFiÒ\?ïFlÐâ?ïEã’X¾´?ïE㔌uë?ïE¸–\?ïEºHKB?ïE¡Ûº ?ïE¡Ý;m5?ïE€û3¯ ?ïE€ýg_æ?ïE`—™‚?ïE`ËGv?ïE?33͸2?ïA=ÿì û?ïA>po?ïAÀŒÝ&?ïAÂÀ>B?ï@û~h½?ï@û€œÌ?ï@Ú9‚Y,?ï@Ú;µµ™?ï@¸ñØÙ0?ï@¸ô 3E?ï@—§ke’?ï@—©ž½O?ï@vZ<« ?ï@v\p?ï@U M–~?ï@U €éŠ?ï@3·œ$"?ï@3¹ÏtÕ?ï@b,Ãõ?ï@d`P?ï?ñ þ š?ï?ñ 1Vœ?ï?ϯ¥Ü?ï?ϱEï…?ï?®QjVË?ï?®Sž?ï?ŒñI†?ï?Œó7Ž{?ï?kã,w?ï?ko?ï?J(W–?ï?J*:—×?ï?(¿q¸Ì?ï?(Á¤ö³?ï?T#>A?ï?VVyÎ?ï>åæA?ï>åèOz:?ï>Ät‘ƒ¶?ï>ÄvĺŽ?ï>¢ÿŒÖÿ?ï>£À {?ï>‡¼å?ï>‰ð£?ï>` }?ï>`Q­c?ï>>´B–?ï>>‘çp?ï>~ƒ?ï>±®?ï=ûŒ|ù?ï=ûŽ°!²?ï=Ú²H ?ï=Úåna?ï=¸~*Ã?ï=¸€QN½?ï=–òÁ†&?ï=–ôô§Ã?ï=udœÏ?ï=ufÏ5?ï=SÓ°}Ð?ï=SÕãš³?ï=2?þzS?ï=2B1”Ø?ï=©†ñ|?ï=«º ¤?ï<ïJɬ?ï<ï}ßv?ï<ÍtK~?ï<Ív~‘?ï<«ÕˆÌi?ï<«×»Ýx?ï<Š4„?ï<Š664?ïìa°?ï<%AiE?ï<’e¤?ï<”˜ Ú?ï;áãú@?ï;áåOý?ï;À1ô?ï;À3Kôz?ï;ž|X5e?ï;ž~‹3}?ï;|ÄÙW¶?ï;|Ç Sn?ï;[ Ÿ•0?ï;[ ÒŽˆ?ï;9M«×¾?ï;9OÞε?ï;ýMî?ï;0B†?ï:õË•v~?ï:õÍÈhµ?ï:Ôt¨¢?ï:Ô§˜x?ï:²>œ÷2?ï:²@Ïä¨?ï:sD<Æ?ï:uw'Ú?ï:n¤wÓV?ï:n¦ª¼?ï:LÒÝg8?ï:LÕM‰?ï:*þw?ï:+©ä?ï: 'Dêð?ï: )wÌ}?ï9çMH¸?ï9çOzçã?ï9Åpƒˆ#?ï9År¶dì?ï9£ôÕô?ï9£“'°Z?ï9®›­„?ï9°Î…‡?ï9_É|ø?ï9_˯͠?ï9=á–#ð?ï9=ãÈ÷-?ï9öè§I?ï9ùx#?ï8ú v‹#?ï8ú ©Y™?ï8Ø?ŒE?ï8ØrXW?ï8¶&DŽ?ï8¶(wWÂ?ï8”0†t4?ï8”2¹;~?ï8r8üÄ?ï8r:7Áª?ï8P<Âı?ï8P>õ‡2?ï8.>À°4?ï8.@ópP?ï8 =ýë?ï8 @0©D?ï7ê:z6Œ?ï7ê<¬ñß?ï7È48Áj?ï7È6kzW?ï7¦+9Þè?ï7¦-l•o?ï7„}â>?ï7„!°–`?ï7b?ï7b7ÐÑ?ï7?ÿÑ Ê?ï7@P ?ï7ëâW?ï7î±G?ï6ûÕ8è?ï6û×k’?ï6Ù»×2ô?ï6Ù¾ Û?ï6·Ÿ¼Î?ï6·¡î»‰?ï6•€éœø?ï6•ƒ@L?ï6s_aB‘?ï6sa“ã?ï6Q:Y`8?ï6Q<‹þ¾?ï6/á¤B?ï6/@`?ï6 æ3–?ï6 èÏÍL?ï5긎¡Ÿ?ï5êºÁ8î?ï5ȇ´„$?ï5ȉç ?ï5¦TK6?ï5¦VBݳ?ï5„¤Š€?ï5„×”?ï5aäoÙ?ï5aæ¢fÃ?ï5?¨s§›?ï5?ª¦2Þ?ï5i°Cc?ï5kâÌ=?ï4û('¯?ï4û*Z5x?ï4ØãÙ2?ï4Øæ ™8?ï4¶œÅçc?ï4¶žøhÿ?ï4”Rï¶?ï4”U!„è?ï4rUP}?ï4r‡ÍE?ï4O¶ø…™?ï4O¹*ÿ÷?ï4-dÚl?ï4-g _?ï4 úUì?ï4 ,Ëu?ï3è¸[E?ï3躸1?ï3Æ]ýÆf?ï3Æ`07?ï3¤àw:?ï3¤å€?ï3¡Ë4?ï3£77?ï3_>nz?ï3_@ ãu?ï3<ÙÞ9?ï3<ÛLE7?ï2)N‹‘Ó?ï2ÍÂý=?ï2ÏõNk?ï1äK½Ñ?ï1äMðÚ?ï1ÁÆïwq?ï1ÁÉ!ÃÃ?ï1Ÿ?Uh?ï1ŸA‡±æ?ï1|´ñR?ï1|·#UÇ?ï1Z'Æ?ï1Z)ø\?ï17—Ñû™?ï17š>0?ï1—¾?ï1G×æ?ï0òo•(x?ï0òqÇf1?ï0Ï×M˜?ï0ÏÙÓÙ?ï0­<@äØ?ï0­>s±?ï0Šžoéî?ï0Š ¢ W?ï0gýÜ©?ï0hH¢?ï0EZ…"1?ï0E\·Sº?ï0"´kð?ï0"¶ž?ï0 Ëþ?ï0 Âø¦?ï/Ý_ô„?ï/Ýb&.»?ï/º±˜',?ï/º³ÊNñ?ï/˜}‚‰?ï/˜¯§Ý?ï/uL£Fp?ï/uNÕiS?ï/R– á?ï/R˜>!R?ï//ܸp?ï//Þêo?ï/ ¦y6?ï/ "Ø”Ã?ï.êaÙg,?ï.êd €G?ï.Ç RÊ*?ï.Ç¢„àÒ?ï.¤ÜÔD?ï.¤ÞCèy?ï.‚õn?ï.‚J0?ï._Kd`Î?ï._M–p?ï.<~ù,?ï.<+#?ï.¯Ø¤V?ï.² ®¾?ï-öÞî?ï-öà2 ã?ï-Ô qÁ„?ï-Ô £Ç?ï-±1n! ?ï-±3 $?ï-ŽUþ+ ?ï-ŽX0+¤?ï-kwÂäV?ï-kyôâz?ï-H–À~&?ï-H˜òyÕ?ï-%²ôw?ï-%µ&pN?ï-Ì`Å'?ï-Î’»ì?ï,ßãÏ?ï,ßå8Ãà?ï,¼öåÂÜ?ï,¼ù´·?ï,šýé?ï,š /Ù?ï,wRæD?ï,w„Ó3?ï,T!âÉH?ï,T$³Á?ï,1*®l¦?ï,1,àT©?ï,0¸Uî?ï,2ê;z?ï+ë4Bh?ï+ë62%}?ï+È4…ïô?ï+È6·Ð“?ï+¥2J9¥?ï+¥4|Ì?ï+‚-O¥|?ï+‚/-?ï+_%•ò4?ï+_'ÇËm?ï+<®?ï+<Pîo?ï+ êG(?ï+q?ï*õýö²³?ï*ö(„„?ï*ÒëH‹.?ï*ÒízZˆ?ï*¯Õßñ?ï*¯ØÏÒ?ï*Œ½¹Û?ï*Œ¿ë¥w?ï*i¢Û ¢?ï*i¥ Ô‘?ï*F…AË”?ï*F‡s‘ ?ï*#dðg?ï*#g!Ôd?ï*Aèe/?ï*D%³?ï)Ý(R£?ï)ÝZ­?ï)¹ó°¸’?ï)¹õât"?ï)–ȆU?ï)–ʸ%?ï)sš¥ œ?ï)sœÖÃ9?ï)PiPТ?ï)Pk‚„Ä?ï)-4•Šx?ï)-6Ç<?ï) ýQ?ï) ÿAL}?ï(æÂÀkî?ï(æÄò ?ï(Ã…«?ï(ÇܫK?ï( EΊ?ï( H1Ù?ï(}+ÜÒ?ï(}]‚?ï(Y½ÃÏ0?ï(Y¿õqô?ï(6u—7}?ï(6wÈ×Å?ï(*¥Dæ?ï(,Öâ²?ï'ïÜó6Ó?ï'ïß$Ò"?ï'ÌŒ|îŠ?ï'ÌŽ®‡\?ï'©9DêŽ?ï'©;v€ä?ï'…ãLV?ï'…å}–/?ï'bŠ’€¾?ï'bŒÄ?ï'?/±?ï'?1J?â?ï'Ðà…?ï'Ó}?ï&øoêÕ\?ï&ør_??ï&Õ 6G´?ï&ÕgÏ?ï&±¥Åçø?ï&±§÷lß?ï&Ž<˜éy?ï&Ž>Êkâ?ï&jЯ™X?ï&jÒáB?ï&Gb Š?ï&Gd>€ö?ï&#ð¯Ïÿ?ï&#òáJì?ï&|˜Ù2?ï&~ÊQ ?ï%ÝɆ,?ï%Ýúü?ï%¹ŒB±°?ï%¹Žt%?ï%–@?ï%–5/?ï%r‘Ø'?ï%r“BF—?ï%OfýÉ?ï%O˜i¹?ï%+‹k??ï%+8Ô®?ï%ô þ?ï%&í?ï$äyqÌI?ï$ä{£0·?ï$Àëˆ1?ï$Àí¹“ ?ï$Z×Ûª?ï$] ;?ï$yÇ_úE?ï$yÉ‘W0?ï$V1!_…?ï$V3R¹ï?ï$2˜Þ@?ï$2šN6(?ï$üSI?ï$þ„žå?ï#ë]ÃÑa?ï#ë_õ$D?ï#Ǽsu?ï#Ǿ¤kÖ?ï#¤^µ"?ï#¤?ï#€q‡r”?ï#€s¸½ð?ï#\ÇïÊÇ?ï#\Ê!¡?ï#9•Ø„?ï#9ÇÛ?ï#l{‡Â?ï#n¬Ë•?ï"ñº¢ÄV?ï"ñ¼Ô¦?ï"Î Á0?ï"Î;ÿý?ï"ªN´ß8?ï"ªPæ?ï"†”¡ô?ï"†–Ó-á?ï"b×Ñ4%?ï"bÚkf?ï"?EX?ï"?vL?ï"Uýèî?ï"X/%?ï!÷ûin?ï!÷“,™!?ï!ÓÉ>û?ï!ÓËp(?ï].TÛ?ï8ž=f?ï8ŸÎÏs?ï)…•?ï+¶$–?ïï²³ˆ ?ïï´äö?ïË9)øZ?ïË;Z‚²?寮è§D?樂/ ?ï‚=ðfæ?ï‚@ ì?ï]¼Av?ï]¾r?ï97ÝÙ®?ï9:Y¾?ï°Å2!?ï²õ¯Ÿ?ïð&ùmÈ?ïð))è´?ïËšzOÏ?ïËœªÈ'?ï§ H#Î?ï§ x™”?ï‚yeÜß?ï‚{–P?ï]äàé?ï]æLQˆ?ï9Kt\d?ï9M¤Êo?ï°ã²?ï²9O)?ïðÙ1É?ï𠚬?ïËpå#?ïËshr?ï¦Í.¶´?ï¦Ï_o?ï‚&µƒç?ï‚(åå ?ï]}z¼Ò?ï]«c?ï8Ñ€< ?ï8Ó°˜ ?ï"įŽ?ï$õõ?ïïqIk?ïïsyÁã?ïʽÂQ?ïÊ¿@?ï¦ú?ï¦HL%?ïLbY.?ïN’¨>?ï\ð2¹?ï\’ 3?ï7ÐÂTT?ï7Òòž8?ïØ}5?ïÄ‚?ïîJ5—‚?ïîLeÜ8?ïÉ‚×Í®?ïÉ…Í?露¿g"?鷺寧?ïëð\D?ïî ™5?ï[hØÃ?ï[™?ï6J)«¢?ï6LYãc?ïu4±¾?ïwdæç?ïìŠ3x?ï쟺f ?ïÇÃ)l$?ïÇÅYœ?ï¢æ¿æ?ï¢èDíG?ï~Lwÿ?ï~|¢Æ?ïY#ÐW{?ïY&ª?ï4>£IC?ï4@ÓnÙ?ïVÃ})?ïXó &?ïêl2Jâ?ïênbkF?ïÅ~>«€?ïÅ€nÉJ?ï ŒïÅ?ï à0?ï{˜ÛÝ›?ï{› ö1?ïV¢Öå?ïV¤5ìà?ï1¨mò?ï1ªžð?ï ¬f8?ï ®Cvþ?ïç¬øP?ïç¯(›{?ï«ž ?ï­L©°?ï¦ÛÎ?隷äÂ?ïxŸ&4X?ïx¡V:±?ïS• @™?ïS—r ?ï ¶€X€?ï ¸¯ë`?ï ë3=w¶?ï ë5mò?ï Å­Dó4?ï ůt€Í?ï  $˜~?ï  &Ǥr?ï z™89 ?ï z›gÁo?ï U %˜’?ï U U?ïZïk‘?ïZñšÏ ?ï5ØÕ?ï5S?ï5“V¢?ï7ÂG?ïéT™Ñú?ïéVÉô?ïÃpí?ïÃsBm?ïŠd?”Á?ïw¡È?ïw£°3Á?ïQµÁE ?ïQ·ðpW?ï+ÇSr?ï+É‚›"?ïÖ5É¿?ïØdïµ?ïßâi?ïßä˜7a?ï¹ëCÄ?ï¹ír"a?ï“ðÉ°%?ï“òøÎ?ïmóŽì¬?ïmõ¾ð?ïGó•ô?ïGõÄš‹?ï!ðÜ'(?ï!ó =?ïûëc¢?ïûí’°ß?ïÕã.-Ã?ïÕå]>R?ï¯Ø: Ÿ?ï¯Úi€?ï‰Ê‰Ä?ï‰Ì¸÷?ïcºXÄ?ïc¼LaI?ï=¦õÆ?ï=©$ËØ?ï‘?ï“B-?ïñxvu ?ïñz¥v?ïË] =˜?ïË_O;b?ï¥?) ?ï¥A@$'?ïIyW?ï xqÃ?ïXúÊõÜ?ïXüùë™?ï2Ԕܕ?ï2ÖÃÏ¢?ï «©w?ï ­Øgk?ï怂?ïæ‚6oÁ?ïÀQ°Cù?ïÀSß.ö?ïš ¥„È?ïš"Ôm?ïsìè ?ïsïî®?ïM¶u‹ï?ïM¸¤nÚ?ï'}Rß©?ï'¿ã?ïA~Ã?ïC­ Š?ïÛ÷õŠ?ïÛ&Ða?ï´ÁÂǶ?ï´ÃñŸÜ?ïŽ}Üu-? J¡?ïh7GH¬?ïh9vn?ïAî‰ö?ïAð3Z?ï¢{¨?ï¤BI?îÿõRÊòj?îÿõTù½?îÿÏ3Á]?îÿÏb‰U?îÿ¨ªÜù?îÿ¨­ Ù??îÿ‚RÆ­„?îÿ‚Tõp?îÿ[÷òÉ?îÿ[ú!ˆä?îÿ5š`¤P?îÿ5œa{?îÿ:­?îÿ<@»$?îþè×>?îþèÙ4Ò?îþÂq>²ž?îþÂsmg­?îþœ»‡•?îþœ ê9ð?îþu~ÛÔ?îþuŸ­‹z?îþO/ˆmŠ?îþO1·|?îþ(¾Ù}Í?îþ(Á( ?îþKqJ¨?îþMŸò0?îýÛÕQ¶?îýÛ׺‰?îýµ\z š?îýµ^¨Â·?îýŽàì«°?îýŽãK?îýhb©xB?îýhdØô?îýAá°F¬?îýAãÞà§?îý^[€?îý`2òÅ?îüô×¢ôÀ?îüôÙщN?îüÎNUd?îüÎP»çÝ?îû™¥Fš?îû™§/¶?îûs¼qp?îûsêêÔ?îûL_˽?îûLaù{i?îû%¸„t?îû%º²è?îúÿ ñ¼?îúÿ -X?îúØ` w?îúØbÎåƒ?îú±°‘`ê?îú±²¿Ì±?îúŠýĶN?îúŠÿó[?îúdH;³¨?îúdJjü?îú=÷•?îú=’%ù?îúÔöð?îú×$zÏ?îùð;ü†?îùðjZ¬?îùÉVÇûV?îùÉXöVÁ?îù¢“™Tæ?îù¢•Ç­–?îù{ͲF*?îù{Ïàœ?îùU “?îùUB_Í?îù.9½gä?îù.;ë¸c?îùk°•4?îùmÞâ÷?îøàšìÔˆ?îøà?îø¹Çsd:?îø¹É¡¬†?îø’ñE‚®?îø’ósÈ>?îølbpã?îøl³·?îøE<Ëm¼?îøE>ù­Ó?îø^ƒµD?îø`±òž?î÷÷}ˆŒ?î÷÷¶Æ¥?î÷ЙڲC?î÷Ðœê#?î÷©³}ãX?î÷©µ¬{?î÷‚Ênæ*?î÷‚Ì?î÷[Þ°x?î÷[àÞ§¶?î÷4ðCØÇ?î÷4òr²?î÷ ÿ'Í ?î÷U÷9?îöç ^9?îöç Œ;§?îöÀèm†?îöÀ’7?îö™Åž«?îö™óÀ?îöröèt?îör"%¨?îöK ÖÕ?îöK#ñ„?îö$lã?îö$ š*—?îõýD$ö?îõýr;ë?îõÖ`IÙ?îõÖŽ^?îõ¯¿½m?îõ¯íÎã?îõ‡ùc:?îõ‡û‘HÓ?îõ`éLwº?îõ`ëzƒ°?îõ9Özµ?îõ9ب¾N?îõÀï+Ö?îõÃ2K?îô먫Œ?îôëªÙA?îôį-j?îôÄÝ.^?îôoû1ð?îôr)0#?îôvOÛ¨?îôvQ¾×?îôO,ok5?îôO.cå?îô(˜"?îô(Æ?îôÞ §®?îôà9šÚ?îóÙ²ÊÍP?îóÙ´ø½º?îó²„ÕÊn?î󲇸?îó‹T-[ø?îó‹V[FÞ?îód Ò½?îód#¥??îó<êÅ®Ð?îó<ìó”1?îó²êº?îó´5ÍW?îòîv˜´M?îòîxÆ”'?îòÇ8yG‚?îòÇ:§$™?îòŸ÷«^H?îòŸùÙ8›?îòx´.ºÑ?îòx¶\’a?îòQnÑ?îòQp0ô?îò*%*ÅŽ?îò*'X—•?îòÙ¥o?îòÛÓ>Z?îñÛ‹s]»?îñÛ¡*:?îñ´:–L7?îñ´<Äñ?îñŒç þy?îñŒé;Ån?îñe6Ä?îñe’cÓô?îñ>6к?îñ>8E’$?îñÙ<ˤ?îñÛjŠH?îðïy¥¸P?îðï{Ót/?îðÈTI·?îðÈ‚Ð?îð ²H<Û?îð ´uó.?îðyJO0?îðyL¯½?îðQà)Æ?îðQâ0Ú?îð*rËV?îð*tøÅU?îðÚˬ?îðvå?îïÛ4w½?îïÛ’b /?îï´×Ùö?îï´ ?îÄ4?îñÖø?îïe'û·o?îïe*)WŠ?îï=ª~ ?îï=¬¬=á?îï*M,L?îï,zÆ×?îîî§g—×?îîî©•/š?îîÇ!ÐÄ?îîÇ#ý©¿?î…i|?î²û®?îîx‰ÇÊ?îîx·W3?îîP€ÛöÛ?îîPƒ ƒ|?îî(ð~(·?îî(ò«²?îî]q•t?îî_Ÿ‚?îíÙǵ.?îíÙÉâ‰r?îí²/I°”?îí²1w2?î튔2F?î튖_Å@?îíbölú?îíbø™•á?îí;Uù]v?îí;X&Ö’?îí²ÛJ!?îíµÀs?îìì œ‡?îìì@?îìÄdž4?îìÄfËñ?î윹€?î윻­rö?îìu qè?îìu BÝ?îìMYfè3š?îè‘…kX§?îèiŽì{?îèi0¸?îèA–Aö?îèA˜Hab?î蛈iê?î赆…?îçñžL¥?îçñ y/p?îçÉžfÂ?îçÉ “»?îç¡›ÖP?îç¡žy?îçy•þg?îçy˜+'¾?îçQŒã†b?îçQ”è?îç)[^?îç)ƒ;g?îçr€º?îçt­Ão?îæÙa9å®?îæÙcfë¾?îæ±M; Ä?îæ±Oh?îæ‰6ƒêo?îæ‰8°êÙ?îæa§:?îæaC¤Ò?îæ9ñŽú?îæ9‰¿?îæâ8™?îæäE0Š?îåèÀ‰çt?îåè¶ܒ?îåÀœEd“?îåÀžrVÝ?îå˜uNÁ¼?îå˜w{±3?îåpK£Òz?îåpMп?îåHF¼ô?îåH!s¦Â?îåð7»Ò?îåòd¢Ì?îä÷¾w ?îä÷À£î+?îäÏŠØI?îäÏŒ2¹š?îä§RãçG?îä§UÅÂ?îäh?îä?C»?îäVÜ’.?îäVÞ¾éÿ?îä.c™ Ì?îãšjÌì?îâìC±žF?îâìEÞ]?îâÃì~ó®?îâÃî«°!?îâ›’¢ñ?î⛔Ϫ²?îâs5€”F?îâs7­K ?îâJÕÆ)?îâJ×Lz?îâ"r+/?îâ"t1ÜB?îáú 1îî?îáú^*?îáÑ£§=?îáÑ¥Óèc?îá©8eLñ?îá©:‘õ{?îá€ÊmJ™?îá€Ì™ðK?îáXY¿çÜ?îáX[슴?îá/æ[ï?îá/èˆ ?îápBŒ¹?îáro)à?îàÞ÷vÔà?îàÞù£o,?îà¶{÷²?îà¶~#°%?îàýÄ ,?îàÿðŸÅ?îàe|ßS?îàe äÅ?îà<ùI)¡?îà<ûu¸†?îàs¼?îàu/H?îßëê PÊ?îßëì7Ùú?îßÃ^c›¸?îßÃ`" ?îߚРPò?îßšÒ8Ôk?îßr?Æ?îßrA3˜d?îßI«T*â?îßI­€¨¥?îß!óKÀ?îß!Ƨ?îÞø{æ"?îÞø~š"?îÞÏà,oÖ?îÞÏâXå?îÞ§AÆê!?îÞ§Có\u?îÞ~ ¸+ ?îÞ~¢ä›?îÞUüþŠÔ?îÞUÿ*÷o?îÞ-VšD-?îÞ-XÆ­ê?îÞ­ò›?îÞ¯ºY{?îÝÜÙYr?îÝܽv?îݳS|µœ?îݳU©Â?îÝŠ¢x½w?îÝŠ¤¥À?îÝaî1Ü?îÝað^7n?îÝ96­SÍ?îÝ98Ù¬Z?îÝ|r%?îÝ~žz±?îÜç¿’?îÜçÁ«mc?îܾÿÕÕø?îÜ¿%ê?îÜ–=v»?îÜ–?¢ÚÎ?îÜmxax´?îÜmzÂé?îÜD°—¿¾?îÜD²Ä?îÜæé?îÜèFW_?îÛóé"i?îÛócÿ?îÛÊI%Ö?îÛÊK1d?îÛ¡voFŒ?îÛ¡x›‚c?îÛx¡&Ë?îÛx£S?îÛOÉ,d°?îÛOËXšÆ?îÛ&î‚.r?îÛ&ð®a¨?îÚþ'o¼?îÚþS ?îÚÕ1R¾?îÚÕ3I€3?îÚ¬Neò¶?îÚ¬P’J?îÚƒhÿ.,?îÚƒk+Uß?îÚZ€ë Î?îÚZƒE ?îÚ1–*õ(?îÚ1˜W?îÚ¨½{Ú?îÚªéšé?îÙ߸¤Ð´?îÙߺÐìà?îÙ¶Åá¦R?îÙ¶È ¿œ?îÙÐsFš?îÙÒŸ]?îÙdØZdÁ?îÙdÚ†xG?îÙ;Ý™Ô?îÙ;ßÅ-w?îÙà/1ª?îÙâ[?j?îØéàÞ¸?îØéâHé•?îØÀÝcOñ?îØÀßWë?îØ—ØI?îØ—Ú.N,?îØnÏûn€?îØnÒ'p²?îØEĵ K?îØEÆá ™?îض3¥Ö?îظ_¢A?î×ó¤ûi?î×ó§'bˆ?î×Ê‘ ðä?î×Ê“9ç…?îסzjúÛ?îס|–î™?î×xaD¸?î×xc>5?î×OEãÓ?î×OG1ÑÆ?î×&&F…ä?î×&(rpò?îÖýÓq?îÖýÿY¸?îÖÓà¯4?îÖÓâÛH?îÖª¹Øœ?îÖª¼~ú?îÖOâW?îÖ’{ÁÎ?îÖXdð?îÖXfB÷‚?îÖ/5.}•?îÖ/7ZW@?îÖ•Ê%?îÖÁ ê?îÕÜÏNŸ ?îÕÜÑzrç?îÕ³˜Y«Ž?îÕ³š…|…?îÕŠ^µÁZ?îÕŠ`áj?îÕa"en?îÕa$‘9C?îÕ7ãhê7?îÕ7唲x?îÕ¡¿öø?îÕ£ë¼Q?îÔå]l3j?îÔå_—õÛ?îÔ¼mØ?îÔ¼™˜?îÔ’ÌÄ1>?îÔ’Îïíß?îÔi€qË`?îÔi‚…?îÔ@1và?îÔ@3¢—`?îÔßÓª­?îÔáÿ^”?îÓ틈Û?îÓí´Œ?îÓÄ4–4ä?îÓÄ6Áâù?îÓšÚýX+?îÓšÝ)W?îÓq~¿m¢?îÓq€ëä?îÓHÛÂ(?îÓH"g€?îÓ½ºír?îÓ¿æá?îÒõXb(Á?îÒõZÈE?îÒËðT4£?îÒËòÑ=?îÒ¢…Îv?îÒ¢‡¼h%?îÒy+?îÒyEœï?îÒO§ï"®?îÒOª¶‡?îÒ&5½D?îÒ&7=N2?îÑü¿m?îÑüÁ¬«p?îÑÓG>ܺ?îÑÓIjgÑ?îÑ©ÌJ¹ò?îÑ©ÎvB?îÑ€N¦NÅ?îÑ€PÑÔ?îÑVÎQÑ?îÑVÐ}SV?îÑ-KMíS?îÑ-Mylº?îÑÅ›P?îÑÇÆÌü?îÐÚ=9º€?îÐÚ?e4?îа²)Øž?îа´UO@?îЇ$m»š?îЇ&™/O?îÐ]”­Š?îÐ]–0R?îÐ4ïÒ?îÐ4@j?îÐ k/Øv?îÐ m[Cb?îÏàÒÄöå?îÏàÔð^ä?îÏ·7®ï„?îÏ·9ÚT”?îÏ™ðÀ ?îÏœ"-?îÏcùˆÇ¯?îÏcû´&ã?îÏ:VwµE?îÏ:X£‹?îÏ°À[?îϲëi²?îÎç`¯F?îÎç Œ®?îν]YËD?îν_…½?îΓ¯­ì?îΓ±Ù<Œ?îÎiÿ\ÔÐ?îÎjˆ"j?îÎ@Le]v?îÎ@N¨!?îΖÊù¾?îΘöAy?îÍìÝõKˆ?îÍìà S?îÍÃ!ê9ä?îÍÃ${¿?îÍ™c+˜²?îÍ™eVל?îÍo¡¹›'?îÍo£ä× ?îÍEÝ“i?îÍEß¾Lq?îÍ»mÆ?îÍæ£Ý?îÌòM1 ?îÌòO\:2?îÌÈ€õêI?îÌȃ!~?îÌž² ÁV?îÌž´5î™?îÌtàn_Ã?îÌt♊?îÌK !p?îÌKL—w?îÌ!5'^W?îÌ!7R‚Ä?îË÷[~¤?îË÷]©5?îËÍ&:ú?îËÍQY‚?îË£ !ßÝ?îË£¢Lûr?îËy¾pÂm?îËyÀ›Û?îËOÚd?îËOÜ??îË%ó cl?îË%õ6v(?îÊü X“?îÊü ƒ[?îÊÒúR?îÊÒ%''?îʨ-òÈî?îʨ0ÒÎ?îÊ~mM-?îÊTGèT2?îÊTJX*?îÊ*Pæþì?îÊ*Sÿð?îÊW>}Ì?îÊYi{Ü?îÉÖZïz?îÉÖ]”?îɬ[ùÁ?îɬ^$¹,?îÉ‚Z]€\?îÉ‚\ˆuŒ?îÉXVÈ?îÉXXGºM?îÉ.O8E~?îÉ.Qc4Ã?îÉE¯GS?îÉGÚ3£?îÈÚ9ƒeJ?îÈÚ;®N¤?îÈ°* Uª?îÈ°,K<?îȆ‰íç?îȆ´ÑT?îÈ\@.å?îÈ\k[?îÈ1êD©€?îÈ1ìo†ÿ?îÈÏ–¦®?îÈÑÁ7?îÇݲ7BÝ?îÇÝ´bo?îdz’'šp?îdz”Ro ?îljohU.?îljq“&Ñ?îÇ_I÷Óá?îÇ_L"¢Œ?îÇ5!Ùzž?îÇ5$FQ?îÇ ÷ C?îÇ ù6çþ?îÆàÉ‘Sƒ?îÆà˼F?îƶ™i¿ð?îƶ›”‚»?îÆŒf•$W?îÆŒh¿ä(?îÆb1µ\?îÆb3>r5?îÆ7øçy~?îÆ7û3]?îÆ ¾1*?îÆ À:è?îÅ『ˆ?îÅジÅv?îŹ@b8¤?îŹBŒé˜?îÅŽýŒÜ?îÅŽÿ·‰ú?îÅd¸Ž?îÅdº:9?îÅ:oéœZ?îÅ:rD`?îÅ% ¢?îÅ'G²­?îÄåר»£?îÄåÙÓ]´?îÄ»‡Ž9h?îÄ»‰¸Ø?îÄ‘4ÍI‚?îÄ‘6÷å?îÄfßgó0?îÄfá’ŒP?îÄ<‡^mZ?îÄ<‰‰?îÄ,°ï6?îÄ.Û‚`?îÃçÏ^ÈP?îÃçщX}?îýojè"?îýq•uT?îÓ Ô*ž?îÓþ´Ô?îÃh§yY?îÃh©3“?îÃ>> A?îÃ>@7ÅX?îÃÒ`B¦?îÃÔŠÃç?îÂéd;¶?îÂéf+¹ú?î¾òò-*?î¾õ¨q?î”2aY?î”\Ù¢?îÂjÂ~,?îÂj ìóx?îÂ?¤øC?îÂ?‘Ïj’?îÂØ3]??îÁê•\Õä?îÁê—‡B7?îÁÀ5È/?îÁÀ`1„?îÁ•`ûU?îÁ•’‹a«?îÁk ߉Ä?îÁk í?îÁ@€³èT?îÁ@‚ÞH¬?îÁôÜð ?îÁ÷Me?îÀëf[H1?îÀëh…¢Œ?îÀÀÕ0 Š?îÀÀ×Zbå?îÀ–AZúä?îÀ–C…O@?îÀkªÝ1T?îÀk­‚°?îÀA¸°€?îÀAâþÜ?îÀuëßæ?îÀx+C?î¿ë×vô¤?î¿ëÙ¡=?î¿Á6]JP?î¿Á8‡«?î¿–’œc?î¿–”Æ¥`?î¿kì6´$?î¿kî`ó~?î¿AC,sE?î¿AEV¯Ÿ?î¿—}c>?î¿™§œ–?î¾ëé+V?î¾ëëUI­?î¾Á85¹Æ?î¾Á:_í?î¾–„ÿû?î¾–†È0N?î¾kÎd‘?î¾kÐŽ¼ã?î¾AŠ…?î¾A´¯n?î¾Y~(!?î¾[¨On?î½ëšCÅ€?î½ëœméË?î½ÀØY%=?î½ÀÚƒF…?î½–¾?î½–è#_?î½kLr–?î½kNœ±G?î½@‚z,0?î½@„¤Dn?î½µÒHE?î½·ü]€?î¼êæ|æ?î¼êè¦ø¹?î¼Àz8a?î¼À¤G”??Êo¨?Aô{Ø?î¼jhn0î?î¼jj˜:?î¼?Žgü?î¼?‘ #?î¼±´®|?î¼³Þ±ž?î»éÒVê|?î»éÔ€êš?ðQ ø?ò{ ?î»”  œø?î»” Ê— ?î»i$H¯?î»i&qý½?î»>:G~>?î»>?î¯Ü ·Å?î®å,B<´?î®å.kR(?|¶i?~+ÈÊ?î®É#?ª?î®ËLN÷?î®b¥\?î«ý¡W?î«ýÉýe?î«Ñ&DÜÂ?î«Ñ(mºº?î«¥EAÙ?î«¥Gj³õ?î«ya™ò?î«ycÂg¼?î«M{KR(?î«M}t&Ú?î«!’W¿Š?î«!”€‘%?îªõ¦¿x?îªõ¨èF•?îªÉ¸ƒÔ?îªÉº«ç??îªÇ¢l2?îªÉË4†?îªqÔy?îªqÖG>S?îªEÝøÁÖ?îªEà!ƒù?îªå/ºC?îªçXyM?î©íéÆ0?î©íëîëó?î©Áë»v?î©Áíä.ß?î©•ë-…?î©•í8ãD?î©içÅg?î©iéîª?î©=áÜ3?î©=äâš?î©ÙS>?î©Û{³°?î¨åÎ-w?î¨åÐV8Ï?ÀjAº?’çø?áë?1…?î¨aœ€ñã?î¨až©‘í?î¨5…Õ?î¨5‡ý® ?î¨ l}u’?î¨ n¦f?î§ÝPz»i?î§ÝR£R"?1Íü?3õ£™?uÅ? G?î§Xìt¤?î§Xî1k?î§,ÅÊ>õ?î§,ÇòÉ??wÊ? QG?î¦Ôp}Ç?î¦Ôr¥ˆÙ?AÛi·?Dê­?î¦|’¸¢?î¦|»6{?î¦OÜ£Žþ?î¦OÞÌ »?î¦#¦g»?î¦#¨7ßZ?î¥÷lÔ·/?î¥÷ný+±?î¥Ë0öDŒ?î¥Ë3µñ?òt??ôœ­O?î¥r±Má?î¥r³u‡ ?î¥Fm„Ú?î¥Fo¬xæ?î¥' ?î¥)@g?î¤íÞ Žb?î¤íà1ð2?î¤Á’ZŸÀ?î¤Á”‚þr?D ‰¥?F2å7?î¤hóë?î¤hõBC?î¤<ŸŠ@?î¤<¡²•d?î¤IZÜ£?î¤Kƒ.Ø?î£ãðŒÎ«?î£ãòµÁ?• µ·?—I­?7Ÿ¸?9?è?î£^ÖpáÉ?î£^Ø™'€?î£2s-øh?î£2uV:þ?î£ Oƒ?î£wTù?î¢Ù¤K“Á?î¢Ù¦sÐ?8&Á ?:Nú@?ÉXÌ?ˀ:á?î¢TWÞA?î¢TZt?î¢'㼤À?î¢'åäÔ‘?î¡ûlðÈ=?î¡ûoôí?î¡Îó|„?î¡Îõ¤º?î¡¢watg?î¡¢y‰šÓ?î¡uøžÅ?î¡uúÆè`?î¡Iw5Ø?î¡Iy]>?î¡ó%‡ó?î¡õM¤ù?î ðlp1?î ðn˜Jê?î Ãã´¼?î Ãå=Ë|?î —W¦?î —Y?0C?î jÈs»_?î jÊ›ËÙ?î >7-ˆ?î >9Uß?î £C L?î ¥kª€?îŸå ·±P?îŸå߸`?s‰Ø?u±Ü?׻Ô?Ùãœ?îŸ_9JÙˆ?îŸ_;r×+?îŸ2˜:€L?îŸ2šbzË?îŸô‹ø¬?îŸö³ð?îžÙN=N¨?îžÙPeBÞ?¥Oúª?§wëº?îžùÅ”?îžûìõ?îžSK›]Z?îžSMÃH ?îž&šÔâ ?îž&œüÉ«?îùçs{†?îùé›`?îÍ1u¤ö?îÍ3†J?î xÛ\?î {mŠ?îs½§Ž2?îs¿Ïi:?îFÿQC1?îGy?î=ܨ•?î@}O?îœíy¾¤«?îœí{æv??îœÀ²÷c?îœÀµ1r?é‡é¥?믴ê?îœgrÈ?îœg™àæ?îœ:N³úØ?îœ:PÛ¿Ï?îœ }OÝo?îœ wŸ>?î›à©EìÅ?î›à«m«k?ҖUR?ԾÐ?ùACÃ?ûhü?î›ZH+Î?î›Zoàû?î›->«:\?î›-@Òìa?î›]k p?î›_’¸K?îšÓy‡ÆX?îšÓ{¯r ?“å ?•*’?îšy©Û¹}?îšy¬^Ü?îšL¾K?îšLÀ:íP?îšϪ4œ?îšÑÑÓ§?î™òÞ ¤&?î™òàÈ@?î™Åê÷¡r?î™Åí:)?ô¯Ç’?ö×]?î™kûÈkå?î™kýïþG?î™?Dµˆ?î™?lDÀ?î™"GÅ?î™IÓÑ?î˜åcp¤?î˜åŠù…?þ_\?/å?øC\?ú8Åç?î˜]ï~¸À?î˜]ñ¦8?î˜0äQ[Ì?î˜0æx×þ?î˜ÖŠ5;?î˜ر®A?î—ÖÆ)À?î—ÖÈP~š?î—©²©Â?î—©´Ñp?î—|œ Ú?î—|ž4uZ?î—O‚ÈiÈ?î—O„ïÖ?î—"fܼÐ?î—"i%ö?î–õHI½?î–õJq#x?î–È'oY?î–È)7Ò$?î–›1i¶?î–›XÉT?î–mܬ×á?î–mÞÔ4R?î–@³ƒQ?î–@µªªÏ?î–‡¶²Ì?î–‰Þà?î•æYEâþ?î•æ[m5ã?(1zB?*XÉù?î•‹ôzèÝ?î•‹ö¢5e?î•^¾"[?î•^ÀI¤\?î•1…'‘,?î•1‡N×V?î•I‹ûä?î•K³>Þ?î”× P3Ð?î”× ws›?ÊsŽ?̚ʩ?î”|†÷çL?î”|‰ ·?î”O@Ýl¶?î”OC¢ñ?î”!ø#V?î”!úJ;b?î“ô¬Í¸?î“ô®ôM’?î“Ç^Ø|>?î“Ç`ÿ¨è?î“šGñ?î“šn*j?î“l»E–?î“l½@kÞ?î“?eOä?î“?gw)?î“ ëvg?î“–M?î’ä±ì+ ?î’ä´GÔ?î’·TRœ”?î’·Vy¶?î’‰ôe8?î’‰öF{ˆ?î’\‘Sö¨?î’\“{ Æ?î’/+ï¨ø?î’/.¸ä?î’Ãnpà?î’Å•}š?î‘ÔWÓ?î‘ÔYúž?é‘Ëß?ë¸Ò3?î‘yx©å1?î‘yzÐèR?î‘LÎD?î‘LCÎ1?î‘ŽêEá?î‘‘B›?îñM?îñ:F™?îÚ˜yš?îÃœ¿oí?î–yö#?î– éA?îh›·‚H?îhÞr3?î;Sa7?î;zMì?î ’MRÃ?î ”tÍ,?î²@óã?îƒãí?îƒå<Ћ?îU„ÊÒ?îU†ð²I?î'#éË€?î'&¨l?î€øÀrÊæ?î€ø˜¤?î€ÊYè6H?î€Ê\ «?ðJO?òp"=?î€m„ aq?î€m†/1K?î€?&f€?î€?L3?¢W”?î€¥È ä?îâ/|!ù?îâ1¡è?µæ?ÛSª?î…?Oæ?î…Au]e?îVÃHÎ4?îVÅnŠm?î(D£¾–?î(FÉw‰?î~ùÃ_]l?î~ùÅ…?î~Ë?|<4?î~ËA¡îš?î~œ¸üŽö?î~œ»">?î~n/ß­L?î~n2Y%?î~?¤%WÔ?î~?¦Kf?î~Îñž?î~ô–é?î}â„Ý  ?î}⇮£?î}³ñOÒl?î}³óuq(?î}…[(¦2?î}…]NA¦?î}VÂfàÙ?î}VÄŒy?î}(' í?î}()0©Ñ?î|ù‰=?î|ù‹;Ï?î|ÊèˆíE?î|Êê®{˜?î|œEc·?î|œG‰B?î|mŸ¦Åy?î|m¡ÌM;?î|>÷Sä~?î|>ùyh÷?î|Li5–?î|NŽ¶Å?î{ážéUy?î{á¡Ó_?î{²îÓžØ?î{²ðùt?î{„<(=2?î{„>M´„?î{U†è”¥?î{U‰®?î{&Ï ¸·?îw [càç?îvñdtd?îvñf™´E?îvÂmùç?îvÂo9y?îv“sS?îv“uAqF?îvdvb¸?îvdx´}­?îv5wmºx?îv5y’Ò?îvuµæÁ?îvwÚû?îu×qj~–?îu×s?îu¨jŒÄ?îu¨l±!{?îuyaÌ(?îuyc=Ö?îuJU>Ì?îuJW8Eä?îuEþþ/?îuH$ö?îtì3Üp·?îtì6q-?ît½ ž?ît½!?Ä?îtŽ·îØ?îtŽ Üè­?ît^í¶F†?ît^ïÛ= ?ît/Ñ^?ît/Ó:ø?ît±Ø‡5?ît³ýw?îsÑü½?îsÑ’!©ž?îs¢k„?îs¢m¨ìL?îssDoN&?îssF”4?îsD½?îsDâr¨?îsîpŒ(?îsð•kp?îr忈®?îråÁ¬Þ£?îr¶Žé ?îr¶)Á¯?îr‡Yè4±?îr‡\ ?îrX#1¦P?îrX%VxL?îr(éáeÐ?îr(ì4z?îqù­ù6½?îqù°?îqÊoxsr?îqÊq;u?îq›._«?îq›0„oÇ?îqkê°¡`?îqkìÕbº?îq<¤k~°?îq<¦<¶?îq [ŽÐ°?îq ]³‹b?îpÞÂ?îpÞAyv?îp®Â¯ò?îp®Ä;cû?îpqz[,?îpsŸ à?îpPJU>?îpP o?îp ȇû^?îp ʬ¥g?îoñp0¨¾?îoñrUOr?îoÂG»þ?îoÂl_\?îo’·ÍÅX?îo’¹òe`?îocWÀ!?îocYä½µ?îo3ô¦õò?îo3öËO?îoŽ‚ð’?îo§†˜?înÕ%¿?înÕ'ã”Ì?în¥º]P#?în¥¼ß|?învL^fT?învN‚òV?înFÛÀÐ’?înFÝåY?înj¬‘?îmçò±ÑE?îmçôÖSA?îm¸z?€O?îm¸|cþó?îmˆÿ2³õ?îm‰W/B?îmYŠÅÆ?îmYƒ¯=»?îm*GÜ+?îm*lPÇ?îlú~k¶”?îlú€'×?îlÊøöW?îlÊûƒB?îl›pçD?îl›s ‰Ö?îlkæ?Çœ?îlkèd.Õ?îlr?îeUÁ;›?îeUÃ_‚‚?îe%м ?îe%Òàs¼?îdõݪŽ?îdõßÎnÖ?îdÅèX´?îdÅê)6?îd•ïÎF`?îd•ñò [?îdeõ~¾?îde÷)UW?îd5÷ªÄ“?îd5ùΗË?îd÷¿Ô?îdùã£ð?îcÕõE:Q?îcÕ÷iÇ?îc¥ð:Uh?îc¥ò^|?îcuè á°?îcuêħc?îcEÞ ?îcEà#àq?îcÐW®F?îcÒ{m5?îbåÀˆ?îbåÂ7CŸ?îbµ­44?îbµ¯WìC?îb…—¹ t?îb…™ÜÁ;?îbU£È–?îbUÇyú?îb%dôŒ‡?îb%g:ˆ?îaõG«Ê?îaõIÎÂh?îaÅ'É!ã?îaÅ)ìÉ?îa•NÊ?îa•q© ?îadà:±µ?îadâ^R(?îa4¸Jv?îa4º²ç…?îaŽM‡°?îaq!Z?î`Ôas—6?î`Ôc—-|?î`¤2^¼?î`¤4'ñž?î`sÿÿžã?î`t#._?î`CËd´ ?î`C͈@!?î`”5V?î`–XÞÐ?î_ãZrV?î_ã\•”£?î_³<š?î_³ =¾‚?î_‚ß/•î?î_‚áSp?î_R²Al?î_RŸÕ¼ˆ?î_"Y¢ú?î_"[Åx±?î^òÿ_?î^ò"ÓÝ?î^ÁÉÌy£?î^ÁËïêŒ?î^‘~äp?î^‘€+Qó?î^a/²óë?î^a1Ö^?î^0ÞÏ`=?î^0àòÆò?î^‹[Zý?î^~¾K?î]Ð5Xœž?î]Ð7{ü…?î]ŸÜÈô?î]ŸÞëqt?î]o¨¾Ù?î]oƒÌð?î]?#„WÚ?î]?%§­Š?î]Â\[Ë?î]Ä®?î\Þ^˜?î\Þ`»Ûø?î\­ø;ƒ?î\­ú^Nû?î\}Câ?î\}‘g*,?î\M#²è?î\M%Ö,À?î\µ‰É?î\·­ [?î[ìDÉ Ÿ?î[ìFìJs?î[»ÑoF5?î[»Ó’€ ?î[‹[~¿?î[‹]¡ÄÀ?î[Zâ÷?î[Zå:±?î[*gØro?î[*iû¢?îZùê$Â?îZùìGL…?îZÉiÛ_?îZÉkþˆZ?îZ˜æüa??îZ˜é‡.?îZha‰>t?îZhc¬`÷?îZ7Ù‚ââ?îZ7Û¦û?îZNçä:?îZQ ÿè?îYÖÁº¾6?îYÖÃÝÖx?îY¦1úÎX?îY¦4ã/?îYuŸ¨9ü?îYu¡ËKh?îYE ĵ^?îYE çÃ_?îYsPM?îYus á?îXãÙIâÖ?îXãÛléþ?îX³<´Ò›?îX³>×ÖW?îX‚Ì™?îX‚Ÿ²Ìè?îXQûÛZ‡?îXQýþWj?îX!W˜i¿?îX!Y»c5?îWð°Ç„?îWð²êz"?îWÀh ?îWÀ Šû©?îW[|t4?îW]Ÿcb?îW^­ˆ¬?îW^¯'tm?îW-ûˆ3V?îW-ý«©?îVýG ˆÕ?îVýI.mº?îVÌõ¥Ù?îVÌ’‡P?îV›ÖFIS?îV›Øi'\?îVkþ¿Á?îVk!š\?îV:[?îV:]Bf,?îV ™¨?îV ›ÊæÜ?îUØÕ™ü"?îUØ×¼Ìp?îU¨ö3l?îU¨K?îUwE¼y?îUwGÞÞé?îUFyëÅŽ?îUF|‹Ž?îU«†óÑ?îU­©¶a?îTäÚŒš4?îTäܯYU?îT´þhø?îT´ !$¨?îTƒ0ÝJ?îTƒ3??îTRX(šå?îTRZKO´?îT!|àâÅ?îT!”#?îSðŸ4ø?îSð¡*âæ?îS¿¾œ€?îS¿À¾ªü?îSŽÛŸð?îSŽÝÂ(û?îS]özª?îS]ø5D?îS- õre¤t?îN”@‡ñ¿?îNc-—‡?îNcOá\?îN1édw:?îN1놽™?îN»{?îN½*¾?îMÏŠvÜ?îMÏŒ>¶N?îMžV Ø?îMžXÂÉÓ?îMm “¼â?îMm"µõf?îM;ç÷°Ó?îM;êåà?îM ¬Ìï¶?îM ®ï!L?îLÙovÿ?îLÙq4¥?îL¨.ÊUØ?îL¨0ì€~?îLvëõÖÚ?îLvîþ?îLE¦’Ñ–?îLE¨´õL?îL^£·]?îL`Å×›?îKã)Ô?îKãK+™?îK±Ç"8š?îK±ÉDQç?îK€wÆ?îK€y²•š?îKO%tkY?îKO'–}´?îKÐÍ\…?îKÒïkf?îJìy(ãõ?îJì{Jï]?îJ»ˆ"B?îJ» ª*0?îJ‰ÁOÈe?îJ‰ÃqÌÚ?îJXa~ú?îJXc£õ?îJ&ÿ*¸?îJ'@(8?îIõš%(ò?îIõœG"ø?îIÄ2—À|?îIÄ4¹·?îI’Èv¨?îI’ʘ¹?îIa[¿ß4?îIa]áÎÊ?îI/ìw’b?îI/î™~|?îHþzœì?îHþ|¾Ô§?îHÍ.‡ ?îHÍPlC?îH›. ¦?îH›‘OîO?îHjœÃÂ?îHj¾¡ï?îH8™z V?îH8››æ?îHÆÉ?îHè L?îGÕ™„DX?îGÕ›¦?îG¤±zÚ?îG¤ÓK?îGrO´1?îGr‘q€ð?îGA_ÖE?îGAŸ‡?îGzàߎ?îG}¥S?îFÝìÔÚ¸?îFÝîö?îF¬\;‰?îF¬^]HI?îFzÉP?îFzË6Êœ?îFI3ch?îFI5„Í7?îF›$üŠ?îFF°Ú?îEæZè?îEæ|™a?îE´c‚Þ?îE´e(02?îE‚Ã(P¶?îE‚ÅIúŒ?îEQ ¿RK?îEQ"àø¢?îE{Íóµ?îE}ï–?îDíÔS÷í?îDíÖu—F?îD¼)Ý"ë?îD¼+þ¾Å?îDŠ|lÀ>?îDŠ~ŽX˜?îDXÌgCÃ?îDXΈØ?îD'Ìly?îD'íýÔ?îCõd~=?îCõf¿ ?îCìۼÐ?îCîýG+?îC‘ò…þ?îC‘ô¦ˆØ?îC`5œH?îC`7½™¢?îC.v!Ü~?îC.xC\W?îBü´/"?îBü¶5«z?îBÊïuÖ˜?îBÊñ—Oo?îB™(Fóï?îB™*hiE?îBg^†…s?îBg`§÷G?îB5’6‘t?îB5”WÿÆ?îBÃVØ{?îBÅxCL?îAÑñæºn?îAÑô!½?îA é`S?îA  Ä ?îAnG^*?îAnIŠg?îAåz‡I‹?î>å|¨|&?î>³€dïÈ?î>³‚†Þ?î>ƒJp ?î>…k›?î>Oƒ70‘?î>O…XX?î>€ê?î>‚²¦?î=ë{Vû5?î=ë}x6?î=¹s‰ãâ?î=¹u«]?î=‡i*å7?î=‡kKÿ+?î=U\:ó?î=U^[5a?î=#L¶ðP?î=#NØ9?î<ñ:£[N?î<ñ<Äj°?î<¿%ÿà`?î<¿( ì;?î<ˆ?î<ì&Ú?îŽÀ?î)È´^DË?î)•¤Z*v?î)•¦yÜè?î)b“én ?î)b– æ?î)/€î­Y?î)/ƒXš?î(ükgѼ?î(üm‡yd?î(ÉSWS?î(ÉUw1b?î(–8¾»?î(–:Þ[Š?î(cœP?î(c»ž,?î(/ûð÷ž?î(/þá?î'üÙ¾*?î'üÛÝ°Ó?î'ɵVÞ?î'É· èí?î'–½º¾?î'–ÝI3?î'ccó9?î'cf“?î'07¡^ü?î'09Àæ=?î&ýÊ´³?î&ý ê8Y?î&É×nË?î&ÉÙŽK*?î&–£dH?î&–¥¬à¹?î&cm&Bp?î&coE»E?î&04;¹J?î&06[.„?î%üøÌÏv?î%üúìA?î%ɺÚa1?î%ɼùÏ4?î%–zfd/?î%–|…Ζ?î%c7nÆ ?î%c9Ž,ë?î%/ñ‰^?î%/ó¨g?î$ü¨´)œ?î$üªÓ‰.?î$É]Pê¥?î$É_pF›?î$–`Â?î$–x?î$b¾âþú?î$bÁS¶?î$/kØéÐ?î$/mø:ï?î#üB¸Á?î#übB?î#Ⱦ +h?î#ÈÀ?uL?î#•cq_:?î#•e¥€?î#b8£c?î#bWæ ?î#.¦vO?î#.¨•TY?î"ûD'¡K?î"ûFFÜ·?î"ÇßP¯:?î"Çáoç?î"”wðDV?î"”zx…?î"a9²?î"a&jB?î"-¡– ê?î"-£µ7Û?î!ú2œÖ¶ß?î@Õ Ã?îц†¡?îѤ°³?îœùÔk¤?îœûò’ ?îhÓ¢·?îhÕÀ>q?î4ªìÔß?î4­ óì?î·”õ?îÕ°W?îÌRyú?îÌT ‘¯?î˜!ÌêK?î˜#êþS?îcïsâ?îcñ6„=?î/¹å5!?î/¼AÏ?îû‚3L”?îû„QU•?îÇGš&ì?îÇI¸,??î“ \Ò?î“ 8^w?î^Ê ”?î^Ì. Œ?î*‡}t»?î*‰›o?îöBaD$?îöD:À?îÁú¼¨(?îÁüÚ›?î°»ø?î²­«6?îYcÜ ¤?îYeùõ4?î% õ ?î%¾Ý?îðÂ߬â?îðÄý‘?î¼n˜Lq?î¼p¶,ó?îˆÉ?îˆç]ï?îS¾vCš?îSÀ”¾?îbø–?îd»Î ?îëA¨?îë^ék?`€?}æ”?î‚?ü…\?î‚BOÀ?îMÚž–?îMÜ1eI?îq©o?îsÇ2?î å¾&?î åÛÒx?î °™O'R?î °›lâò?î |)^í?î |+|¥ ?î G¶î8?î G¹ ì]?î Aû\y?î D ?î Þʈöê?î Þ̦£Å?î ªP—æ?î ªRµ)?î uÔ&^ ?î uÖD?î AU6 ?î AWS«Þ?î ÓÈÅF?î ÕæcX?î ØOÛÓ?î ØQùmc?î £Ér+(?î £ËÁÕ?î o@‹ëg?î oB©~`?î :´¾ÁÜ?î :¶ÜQ"?î & ¯P?î (+:â?î Ñ”Ôü?î Ñ–òƒú?î Uá?î 0Ú ?î hjËTã?î hlèÕZ?î 3Ñü?î 3Ô~à?î ÿ6¦.U?î ÿ8çd?î ʘʪ@?î Êšèš?î •øi5Š?î •ú†§0?î aU?î aWžþ?î ,°@÷?î ,²2«3?îø&*?îø C—?îÃ]±é£?îÃ_ÏLu?»®?ØvË?îZ@¾¬?îZ^?î%OBú1?î%Q`Qâ?îðšÄ*?îðœá[%?î»ãÂð’?î»åà@×?î‡*?ÒF?î‡,]Ô?îRn;غ?îRpY!’?z·?î±Ô¿Ø?îèî³/?îèðÐp…?î´+/Ç¢?î´-MT?îe,« ?îgIå?îJœªPœ?îJžÇ†à?îѪš^?îÓÇÌê?îá,:&?îáIhû?î¬40·l?î¬6Mâˆ?îwa·Ôb?îwcÔûÇ?îBŒÃs?îBŽà–Æ?î µQë?î ·n°ß?îØÛdj¨?îØ݆ã?î£þ•ù‡? ?îoã ¿?îo!5ˆ?î:<©½:?î:>ÆÎJ?îWê‡?îZªÝ?îÐp¤ËÌ?îÐrÁÕi?Ùq\?öw??îfšŠÆÄ?îfœ§Èì?î1«¶lÍ?î1­Ók;?îüº^A¾?îü¼{jñ?î]×?+±?î]Ù\6?î(ÛÚá[?î(Ý÷Í%?îóÝò•n?îóà}|?î¾ÝŠD?î¾ß§(f?î‰Ú žÐ?î‰Ü½g?îTÕ5f\?îT×RC7?îÍJxÿ?îÏgR?îêÂß=^?îêÄüÂ?îµµóÎÆ? m?Še±?§3œ?îK”¢ö?îK–¾Ù$?î€:1ì?î‚Vø]?íÿáiVoŒ?íÿáks2@?íÿ¬Oõ Ø?íÿ¬RßÐ?íÿw4­”?íÿw62hÎ?íÿB»S?íÿB×¹Ï?íÿ ôãÒØ?íÿ ÷†–?íþ×Ñ;`?íþ×Ó¬ëa?íþ¢«ÁÀO?íþ¢­Þl’?íþmƒx}ú?íþm…•&?íþ8X´6ñ?íþ8ZÐÛ·?íþ+>?íþ--¦F?íýÍúÙ?íýÍüªvP?íý˜Ç„~e?íý˜É¡ï?íýc‘öÏã?íýc”e®?íý.Yå@Y?íý.\Òd?íüùNÛT?íüù!ki ?íüÃâ5!‹?íüÃäQ¬?íüŽ¢™9¼?íüŽ¤µÀˆ?íüY`y|K?íüYb•ÿW?íü$×J?íü$ó–?íûîÔ³Ð1?íûîÖÐK½?íû¹‹Èm?íû¹+@8?íû„>ç¹:?íû„A-E?íûNð@}.?íûNò\íw?íûŸ!I?íû¡4Ñ?íúäKpÙÌ?íúäMB“?íú®õK?íú®÷g…?íúyœ¥ðÉ?íúyžÂR?íúDA‚*q?íúDCž‡ó?íúãàîÉ?íúåýHŠ?íùÙƒÀ˜¦?íùÙ…Üî¥?íù¤!$Z?íù¤#@a—?íùn¼ ?íùn¾'b“?íù9Tt[á?íù9V¦˜?íùêbÜ?íùì~aÑ?íøÎ}Ôŧ?íøÎñØ?íø™Ëk+?íø™窙?íøcGæ?íøcŸd!¾?íø.)J«3?íø.+fã?í÷ø²Ó#L?í÷ø´ïWp?í÷Ã9áÃŽ?í÷Ã;ýóí?í÷¾w³ã?í÷À“à~?í÷X@/ª¡?í÷XBKÓx?í÷"¿ ž6?í÷"Á&ÃI?íöí;aÔ—?íöí=}õå?íö·µ5 Ø?íö··Q*a?íö‚,†É?íö‚.¢7?íöL¡UÓ?íöL£q5Ó?íö¡ð?íö½2*?íõáƒkB”?íõá…‡Q?íõ«ðµ^…?íõ«òÑi3?íõv[|ÃB?íõv]˜Ê+?íõ@ÃÄSC?íõ@ÅàVf?íõ )Œ ?íõ +©‹g?íôÕŒÕ ˜?íôÕŽñ.?íôŸížfn?íôŸïº^>?íôjKéµÒ?íôjN©Û?íô4§¶?íô4©ÑøX?íóÿÛ?íóÿ Ç?íóÉWÕ–v?íóÉYñ)?íó“¬(­4?íó“®D’ ?íó]ýÿD8?íó^%\?íó(MZ't?íó(OvÐ?íòòš9?íòòœTñ˜?íò¼äœ07?íò¼æ¸?íò‡,„<>?íò‡. B?íòQqòa.?íòQt/j?íò´æÈ?íò·Ò;?íñåõ_üj?íñå÷{Ã?íñ°3`?íñ°5{Ãê?íñznç“Ç?íñzqRà?íñD§÷(O?íñDªã?íñÞÏY?íñ੆ß?íðÙ®j?íðÙÊÓ?íð£Cò©:?íð£FY,?íðmr\â?íðmtwÌ ?íð7žBÝ–?íð7 ^…ó?íðÇ©&?íðÉIJ¹?íïËîf ?íïËð©h?íï–ðW¤?íï– ô¢?íï`4Òª…?íï`6îC¸?íï*T4Ì?íï*VO´3?íîôqÖ?íîôs1h+?íy¤à?í2°?í]Ž¿?íyÄ?íîR¸Ãì?íîRºÞ•%?íî˪–}?íîÍÆé?ííæÜ>*?ííæÞ/¼Ê?íí°êwB?íí°ìò?íízõpd?ííz÷‹Û?ííDþb»º?ííE~.õ?ííØùB?ííôh¯?íìÙÓæ ?íìÙ ïRA?íì£ S?íì£ oë?íìm X6?íìm sš?íì7ã„É?íì7þå?íìÿôAj?íìÕ?íëÊ÷Œ?9?íëÊù§—Õ?íë”ìª6Í?íë”îÅ‹›?íë^ßO£:?íë^ájô:?íë(Ï|žx?íë(Ñ—ë©?íêò½1ó?íêò¿M<|?í꼨py?í꼪‹Y ?íꆑ7Ü?íꆓR[¡?íêPwˆ)%?íêPy£g?íê[aû+?íê]}5R?íéä~ÿ~?í鮋÷¨?í鮧*/?íéwö3tv?íéwøN£-?íéAÏZ®Å?íéAÑuÙ¬?íé ¦Åû?íé ¨í?íèÕz*q"?íèÕ|E”h?íèŸKÓå?íèŸMîŸ[?íèiþ ¶?íèi%Z?íè2ç©v6?íè2éÄŽ ?íçü±ØDú?íçü³óXý?íçÆy‰-Õ?íçÆ{¤>?íç>¼HÇ?íç@×U'?íçZs Š?íçZŽ?íç#Á®›Ú?íç#ÃÉ –?íæímTf?íæíˆUP?íæ·:°¯ ?íæ·<ˬ#?íæ€óy˧?íæ€õ”Äì?íæJ©Ç Œ?íæJ«âÿ?íæ]›EÞ?íæ_¶7?íåÞõ‹Æ?íåÞy“?í姽՞V?í姿ðˆP?íåqj=MA?íåqlX3h?íå;,Y±?íå;G<?í廢ܾ?íå½½»>?íäÎ`¢¦?íäÎb½€»?íä˜*ÇÂ?íä˜Ežš?íäa£< Œ?íäa¥VÝ?íä+@׎Ä?íä+Bò]ó?íãôÛün?íãôÞÚÉ?íã¾t«\M?íã¾vÆ#Ô?í㈠åæŸ?í㈠ªQ?íãQž«p ?íãQ Æ0|?íã/šx?íã1µ=€?íâä½³#ë?íâä¿ÍÜ?íâ®IL»ž?íâ®Kgoû?íâwÒf°?íâwÔ`ž?íâAY‚?íâA[Ë3?íâ Ý {h?íâ ß;$B?íáÔ^À×(?íáÔ`Û|,?íáÝäNü?íáßþð*?íágZŠùÛ?íág\¥—2?íá0ÔµF@?íá0ÖÏßÀ?íàúLbœ©?íàúN}2S?íàÃÁ–&–?íàÃð¸h?íà4M—ä?íà6h%ß?íàV¤Šej?íàV¦¤ï?íà Lþ?íà g„N?íßé}”ÊÌ?íßé¯M@?íß²æc—í?íß²è~‰?íß|L¹}.?íß|NÓ÷ò?íßE°–;G?íßE²°²2?íßú˜º?íß Í?íÞØpè b?íÞØsyœ?íÞ¡Í\ô’?íÞ¡Ïw_ó?íÞk'ZÌW?íÞk)u3ß?íÞ4~âB?íÞ4€üdð?íÝýÓóZ ?íÝýÖ ¹â?íÝÇ&F[?íÝÇ(©¢W?íÝvµÞÛ?íÝxÐ6ý?íÝYÄfŽ?íÓér‘b?íÓ²M¥Ñ+E"?íÐ>ÓD­/?íЄð…?íІ›T­?íÏÐ5e’?íÏÐ7~ýÕ?íϘã×e™?íϘåðÁ÷?íÏa׶?íÏa‘ñ˜?íÏ*9f¦Û?íÏ*;ûo?íÎòà„¥y?íÎòâö&?íλ…2¾?íλ‡Kl†?í΄'œ’?í΄)(åt?íÎLÆJ ?íÎLÈ7?íÎb³a¼?íÎdÌ¢Ñ?íÍÝüÍö¼?íÍÝþç3ë?íͦ”n?íͦ–‡WJ?íÍo)•™I?íÍo+®Îª?íÍ7¼BÐè?íÍ7¾\b?íÍLx‡Ä?íÍN‘µV?íÌÈÚ5|3?íÌÈÜN¥Þ?íÌ‘eznì?íÌ‘g“”¯?íÌYîHvI?íÌYða˜$?íÌ"tŸýW?íÌ"v¹K?íËêømŠ?íËêú˜‡–?í˳yéß?í˳|õ7?íË{øÞ@?íË{ú÷#{?íËDu\Å?íËDwuÓf?íË ïfƒ?íË ñì?íÊÕfû 2?íÊÕi²?íÊÜÈ3?íÊÞ4ÊÉ?íÊfNÉ ¶?íÊfPâ d?íÊ.¿•€?íÊ.ÁD?íÉ÷,É&é?íÉ÷.âÃ?íÉ¿˜+Ö?íÉ¿š6Æ?íɈþº×?íɈ©Ý?íÉPgn@?íÉPi‡+#?íÉËl|ê?íÉÍ…d?íÈá,úˆn?íÈá/kµ?íÈ©Œ#ü?íÈ©Ž0X?íÈqèÄf²?íÈqêÝB$?íÈ:C¼è?íÈ:E”n?íÈšÎ=ý?íÈœç˜?íÇÊð-è?íÇÊòEИ?íÇ“B¾Þ.?íÇ“Dשò?íÇ[’‚œ£?íÇ[”›d|?íÇ#ßÎNS?íÇ#áç??íÆì*¡¥?íÆì,¹Ç¥?íÆ´rûÜ~?íÆ´u˜’?íÆ|¸ÞŒ?íÆ|º÷D,?íÆDüIÕ?íÆDþb‰A?íÆ ==vì?íÆ ?V':?íÅÕ{º…È?íÅÕ}Ó2)?íŷŸ?íŹھ?íÅeñSú?íÅeól5€?íÅ.(n·­?íÅ.*‡XF?íÄö]GD?íÄö_.ãï?íľHX?íľ‘`š?íĆ¿¤X?íĆÁ9'?íÄNìOšv?íÄNîh+V?íÄ%ù?íÄ>…ö?íÃß?ˆ€|?íÃßA¡ €?íçey™ ?íçg’5?íÃoˆ÷Ö?íÃo‹†ü?íÃ7ª…?íÃ7¬I?íÂÿÈœÖm?íÂÿʵOµ?íÂÇäƵ?íÂÇæÞ… ?íÂþ~FÞ?í–¸G?íÂXÆå`?íÂXßRØ?í *žY?í ,¶Â§?íÁè= .?íÁè?oÇ?íÁ°M`?íÁ°Or?íÁxZŠÕK?íÁx\£3?íÁ@e§Ä?íÁ@gÀà?íÁnVIÕ?íÁpnŸ«?íÀÐt–Ñî?íÀÐv¯#Ó?íÀ˜x Ö†?íÀ˜z%$z?íÀ`x¹a&?íÀ`zÑ«)?íÀ(ví¹¶?íÀ(yÿÇ?í¿ðr«›0?í¿ðtÃÝO?í¿¸kòJ?í¿¸n Yx?í¿€bÂKÉ?í¿€dÚ†?í¿HWé¼?í¿HY5 ?í¿I ?í¿K;k?í¾Ø8qiJ?í¾Ø:‰—®?í¾ %lÅZ?í¾ '„ïË?í¾hóˆX?í¾h ®Ö?í¾/ør ?í¾/ú”˜?í½÷ݤæŒ?í½÷ß½$?í½¿ÀÐü´?í½¿ÂéY?í½‡¡‰t¤?í½‡£¡‹T?í½OÏ´ö?í½Oçdz?í½[¤Ï¯?í½]¼Þx?í¼ß53l?í¼ß7>@?í¼§ øï­?í¼§ö?í¼nàz\?í¼nâ’H?í¼6²Šq,?í¼6´¢p$?í»þ‚+ g?í»þ„Cj?í»ÆO\Ÿð?í»ÆQt–þ?í»Žû×?í»Ž4îð?í»UâoÒ?í»Uä‡ÁB?í»¨TŽ?í»ªlz»?íºåkÉø¦?íºåmáßÞ?íº­,ÑÈŠ?íº­.é«Ì?íºtël½x?íºtí„œÄ?íº<§š™?íº<©²t^?íºa\¡?íºcsñ?í¹Ì²¥ý?í¹ÌÊye?í¹“Í@_[?í¹“ÏX.Í?í¹[>?í¹[ ~?í¹#.W o?í¹#0nÔó?í¸êÛ0“Ê?í¸êÝHWW?í¸²…–-i?í¸²‡­ìÿ?í¸z-‡™D?í¸z/ŸTâ?í¸AÓFF?í¸AÕýë?í¸ v ”T?í¸ x#H?í·Ñ –Ö?í·Ñ¸FŒ?í·˜´ÁeE?í·˜¶Ù?í·`Pp_f?í·`Rˆ+?í·'é¬ðÚ?í·'ëÄ”¦?í¶ï€v1Ž?í¶ï‚Ña?í¶·Î-H?í¶·åÉ"?í¶~¦´¤?í¶~¨Ì;è?í¶F6*ùŒ?í¶F8Bt?í¶ Ã0F7?í¶ ÅGÖ%?íµÕMÆ•œ?íµÕOÞ!‘?íµœÕìX?íµœØà˜?íµd[£Fø?íµd]ºÊø?íµ+Þë!J?íµ+á¡P?í´ó_Ãü1?í´óaÛx=?í´ºÞ.“ÿ?í´ºàF ?í´‚Z, Z?í´‚\Dq?í´IÓ¼“%?í´IÕÔ@?í´Jß|¢?í´LöèÂ?í³Ø¿•Å”?í³ØÁ­-¹?í³ 1ß/b?í³ 3ö“Œ?í³g¡¾&?í³g£ÕyU?í³/1IG?í³/H¥y?í²öz9(Ü?í²ö|P?í²½âÖt ?í²½äíÈÚ?í²…H­å†?í²…JÅ5Å?í²L«À?í²L­×[a?í² ]Oõ?í²t˜:?í±Ûj‡\v?í±Ûlž ¾?í±¢Æ=Lm?í±¢ÈTŒ¸?í±j€-9?í±j!—i‡?í±1vP¸™?í±1xgðê?í°øÊ­_Í?í°øÌÄ”!?í°À˜ÑÞ?í°À°4?í°‡l!«?í°‡n*N?í°N¹gÔ?í°N»2.?í°³XÓ?í°Ê}/?í¯ÝKÛÖ?í¯ÝMò(3?í¯¤‘’4º?í¯¤“©Q?í¯kÔÙF`?í¯kÖð^À?í¯3±ñ0?í¯3É‘?í®úT§×?í®úV1¸8?í®Ár.?í®Á’,~‘?í®ˆÉ¢ˆ?í®ˆË¹ë?í®PÀCn?í®P×GÒ?í®5q¿R?í®7ˆ¿¶?í­Þgµñ’?í­ÞiÌíö?í­¥—ŒîR?í­¥™£æ¶?í­lÄ÷Â?í­lÇ·æ?í­3ïø%„?í­3òè?í¬û‹â?í¬û¢Îi?í¬Â>µ§&?í¬Â@̈?í¬‰bt<…?í¬‰d‹ å?í¬PƒÈ]$?í¬P…ß=„?í¬¢²pÙ?í¬¤ÉM7?í«Þ¿2ß‹?í«ÞÁI·è?í«¥ÙJ·e?í«¥Ûa‹Á?í«lðŸMÉ?í«lò¶"?í«4/Ú?í«4F¦o?íªûMA%?íªûd z?íªÂ&ù‡,?íªÂ)K?íª‰44jû?íª‰6K+K?íªP>û¹†?íªPAuÔ?íªGSi2?íªIj!}?í©ÞM9í?í©ÞOP¡a?í©¥P¯ª?í©¥RÆZâ?í©lQµ­ ?í©lSÌYN?í©3PLYÄ?í©3Rc?í¨úLrw«?í¨úN‰å?í¨ÁF* ü?í¨ÁH@«2?í¨ˆ=syH?í¨ˆ?Šz?í¨O2MÜÄ?í¨O4dtò?í¨$»9?í¨&ÑͶ?í§ÝºüÝ?í§ÝÑ?í§¤MŒ£?í§¤dÃ?í§jísNÜ?í§jï‰Ö÷?í§1Ö-O(?í§1ØCÓ>?í¦ø¼zû>?í¦ø¾‘{O?í¦¿ ] ?í¦¿¢sˆ'?í¦†Óè?í¦†ƒê`?í¦M`àGô?í¦Mbö»ô?í¦=‚äø?í¦?™Tò?í¥Û»€?í¥ÛÑëü?í¥¡ïŠ-?í¥¡ñ ”ï?í¥hÄï¥!?í¥hÇ ?í¥/—졬?í¥/š?í¤öh€ä?í¤öj—?é?í¤½6­%±?í¤½8Ã}ƒ?í¤„rrŽ?í¤„ˆÆZ?í¤JËw`?í¤Jͯâ?í¤‘º Ä?í¤“Ðl?í£ØUŒ)?í£ØW¢dÞ?í£Ÿí¹?í£ŸüÌ?í£eÕß?í£e×õEµ?í£,’`gü?í£,”v£™?í¢óLqK”?í¢óN‡ƒ)?í¢ºº?í¢º(íŽ?í¢€¹Eiö?í¢€»[™y?í¢Gl ¿´?í¢Gnë.?í¢`Ä_?í¢vëÐ?í¡ÔÊI’²?í¡ÔÌ_¶?í¡›uÄ>?í¡›wÚ®œ?í¡bÓ«?í¡b é1?í¡(ÅuŠ‚?í¡(Ç‹¡Í?í ïi« ?í ïkÁU?í ¶ tí ?í ¶ ŠüW?í |ªÓí¶?í |¬éøã?í CGÆ/¶?í CIÜ6Ø?í  âNª\?í  äd­t?íŸÐzlËÊ?íŸÐ|‚Ê×?ퟗ ù?ퟗ6ô?íŸ]£j ¶?íŸ]¥€—­?íŸ$4KÂþ?íŸ$6aµê?ížêÂÃΑ?ížêÄÙ½q?íž±NÔB?íž±Pê ?ížwØ|#ð?ížwÚ’ ¹?íž>_»Ù?íž>aÑ€–?ížä”;?ížæªÁ?íËg³6?íËiÛ?í‘ç#…?í‘é'ú?íXd·•ä?íXfÍho?íߟ.Z?íá´üÙ?íœåWÈ þ?íœåYÝÔo?휫Í0Ï?휫ϖ÷3?íœr@Ë©£?íœrBákú?íœ8±¦á\?íœ8³¼Ÿ¥?í›ÿ Þê?í›ÿ")™%?í›ÅŒN?í›ÅŽ(»|?훋õ£ÁÊ?훋÷¹sê?í›R\Æw?í›R^Ü%¯?í›Á}Çf?í›Óqi?íšß#Ç×?íšß%Ý|ø?횥ƒ¥ÿ|?횥…»¡b?íškáö ?íškã.“â?íš2<3?íš2>4ÌÐ?í™ø”»?í™ø–КÕ?홾êì}ò?홾í›?í™…>³ Ñ?í™…@È™k?í™KÖ?í™K’%‘`?í™ß'|?í™á¬ö?í˜Ø+ä?í˜Ø-£e~?혞u¯:U?혞wÄ·®?í˜d½h?ÿ?í—}ÆS©?í—Cÿó)ž?í—DŽ“?í— 9AÆ ?í— ;W'ƒ?í–Ðp)ØL?í–Ðr?5?í––¤­[?í––¦Â³Ö?í–\Ö˾É?í–\Øáv?í–#…h?í–#š¸?í•é3ƒ²â?í•é5˜ÿk?핯]ƈ?핯_ÛIÿ?í•u…™¥™?í•u‡®éý?í•;«Fè?í•;­‡9?í•Íù¤H?í•Ðà†?í”Çî…|³?í”Çðš´Þ?픎 ¥Él?픎ºýƒ?í”T(Y¦¨?í”T*nÖ¬?í”A¡Çò?í”C¶óâ?í“àX}ìª?í“àZ“†?퓦l：?퓦oàc?í“l~ö¥Ý?í“l Å‘?í“2Ž“­„?í“2¨É$?í’ø›Æä˜?í’øÛü#?í’¾¦¹?í’¾¨¤Í?í’„®ïƒ?í’„±’~?í’J´æôô?í’J¶ü@?í’¸u}î?í’ºŠ…%?í‘Ö¹?í‘Ö»²6?í‘œ¸]/R?í‘œºr.^?í‘b´´äž?í‘b¶Éß•?í‘(®¦Òq?í‘(°»ÉQ?íî¦2¹8?íî¨G¬?í´›W·=?í´l¥ñ?ízŽÒ?íz+¼¤?í@~qþ?í@€…õ…?ílf/?ín{ƒ?íÌWõóY?íÌZ Ѳ?í’A"T²?í’C7.ô?íX'ê! ?íX)þ÷7?í O3?ícÒF?íŽãîPbx?íŽãðe0t?펩͘Øl?펩ϭ¢Q?íŽoª&Äq?íŽo¬;Š>?íŽ5„IB?íŽ5†^Ñ?íû[ÿ(?íû^ÚÄ?íÁ1IX`?íÁ3^ä?í‡(ö†?í‡=«ñ?íLÔ°?íLÖ±Æ?í¢§Wœ?í¤¼Õ?íŒØnGÏT?íŒØp\xt?팞7}H|?팞9‘íƒ?íŒcþI¸¾?íŒd^Y«?íŒ)­0l?íŒ)ÄÁÍ??í‹ï„¨a¦?í‹ï†¼ú_?틵D; ?틵FO ­?í‹{f2³?í‹{zÃ8?í‹@¼)Dž?í‹@¾=Ñ ?í‹t…æ„?í‹všnÔ?íŠÌ*{Ø]?íŠÌ,\“?íŠ‘Þ ‰’?튑à ­?íŠW3žà?íŠW‘Hà?íŠ=÷yú?íŠ@ ñÞ?í‰âêT˜~?í‰âìi H?퉨”M‘D?퉨–bñ?í‰n;â$Ô?í‰n=öf?í‰3ádˆ?í‰3ã&Ëþ?íˆùƒß?íˆù…ófq?툿$IÜ?툿&]c?툄ÂNåV?툄Äc@w?íˆJ]òœ×?íˆJ`óÜ?íˆ÷3ë~?íˆùH>f?í‡ÕŽ„D?í‡Õ'Ó?퇛"‡i?퇛$¤Ò?í‡`´XIO?í‡`¶lß?í‡&Cg>}?í‡&E{€ñ?í†ëÐ ö?í†ëÒ_L?톱ZE’d?톱\YÌœ?í†vâ°?í†vä)æª?í†ß?í„-«ÃüX?í„-­Ø =?íƒó½?íƒó2ÅÇ?탸„ü¡?탸†(G?íƒ}ì£Ë|?íƒ}î·Ì?íƒCRÏzè?íƒCTãwM?탶•ÚZ?탸©ÒŸ?í‚ÎøÛ²?í‚Î ÏÖ?í‚“vø?3á?íb&ªOÛi?íaê´„¡?ía궖$ð?ía®¾hð?ía®Ày½?íarÅêM¿?íarÇûèœ?ía6Ë kÌ?ía6Íp?í`úÍË6Ý?í`úÏÜÉG?í`¾Î*WÚ?í`¾Ð;æ ?í`‚Ì)w¶?í`‚Î;­?í`FÇÈUq?í`FÉÙÛ/?í` ÁL"?í` Ãͦ?í_ηçRØ?í_ιøÐ!?í_’¬gŒö?í_’®y?í_Vž‰Ûg?í_V ›P;?í_ŽMý?í__n*?í^Þ{´Ü?í^Þ}Åm;?í^¢f¼@¾?í^¢hͨâ?í^fOg´c?í^fQyK?í^*5¶‘?í^*7Ç{>?í]T?í]îºÆ?í]±û>·ó?í]±ýP)?í]uÚyV’?í]uÜŠ©?í]9·X ?í]9¹iX@?í\ý‘Üc¦?í\ý“í®(?í\Áj×?í\ÁlÇ?í\…?Õ¶?í\…AæPÀ?í\IIÉÂ?í\I[Ž?í\ äeMÔ?í\ æv‡d?í[г'© ?íLt8¤ î?íLt:´Á\?íL7jÆV?íL7lÖ›{?íKúš“ü?íKúœ£¨Ù?íK½Ç¼À?íK½ÉÌÓ´?íK€òA››?íK€ôQªç?íKDhð¸?íKDxû¼?íK@3cî?íKBCj©?íJÊc¡M?íJÊe±Oy?íJ„²j˜?íJ†ÂhÁ?íJP£gž?íJP¥w}?íJ¿ÀètÛ’«¬²?í>Û”ºØ ?í>ž=ý¿z?í>ž@ æ?í>`æü?í>`é 7Ê?í>#¦mŒ?í>#µ‹ï?í=æ1ý î?í=æ4 ;?í=¨ÔÓ/?í=¨Öèî?í=ks±Dª?í=kuÀV?í=.±)?í=.¾D?í<ð¬Ù"?í<ð®*áê?í<³DÕÉ?í<³Fä̓?íR?í8ÛˆÝo_?í8ÛŠì.?í8ù6ož?í8ûE*y?í8`g:?í8`iH¹‰?í8"Òéj?í8"Ô÷É™?í7åS”?í7§£LL+?í7§¥Zõ­?í7j‚ß?í7j ( ?í7,jaJ ?í7,loêâ?í6îÊna ?í6îÌ|þ?í6±()å?í6±*8}·?í6sƒ“•Ê?í6s…¢)›?í65ܪ›z?í65Þ¹*ó?í5ø3o™H?í5ø5~$j?í5º‡ä"?í5º‰òšì?í5|ÚÌQ?í5|ÜNÃ?í5?)ÚÍ«?í5?+éKÅ?í5w^G?í5yl€ ?í4ÃÂDÀ÷?í4ÃÄS6a?í4† ô?í4† ›ÿ?í4HP~d?í4HRŒÐÏ?í4 ”Ló?í4 –%µS?í3ÌÕXŽ?í3Ì×g•?í3Bªó?í3Q ¡?í3QPÔè\?í3QRãC°?í3‹º?í3 ý?í2ÕÂ÷üŸ?í2ÕÅO@?í2—ø‡º=?í2—ú–„?í2Z+ÁÞ¹?í2Z-Ð(§?í2\§ ¥?í2^µP8?í1Þ‹7“\?í1ÞEÔ•?í1 ·r¡†?í1 ¹€Þe?í1báZMÔ?í1bãh†X?í1%íÁ ?í1% ûõ4?í0ç.-PÐ?í0ç0;€ž?í0©Q`?í0©S(ªÓ?í0kq³”p?í0ksÁ»ˆ?í0-úó¸?í0-’ t?í/ï«ð”?í/ï­þ/õ?í/±Å’­·?í/±Ç Ç¼?í/sÜã´??í/sÞñÉç?í/5ñä??í/5óò"Œ?í.ø’£h?í.ø °X?í.ºð¢?í.ºþª”?í.|"ÿÚ6?í.|% Þm?í.>.½þô?í.>0ËþÎ?í.8,ÝŽ?í.::Ù ?í-Â?M­"?í-ÂA[¤B?í-„D·?í-„F,©á?í-FF¡2Í?í-FH¯!3?í-FŠ]H?í-H˜GQ?í,ÊC×Hn?í,ÊEå.?í,Œ>Îlt?í,Œ@ÜMÁ?í,N7o‡‚?í,N9}dp?í,-¹w:?í,/ÇOÊ?í+Ò!®Q*?í+Ò#¼%\?í+”MÓ°?í+”[£ƒ?í+V˜9?í+V¥Ó®?í+ïØÀ?í+ñ›ŸÖ?í*ÙÚ/äe?í*ÙÜ=§?í*›Â~4¬?í*›Ä‹ó?í*]¨x= ?í*]ª…÷˜?í*Œ t?í*Ž-Ê ?í)ámsl¶?í)áoî?í)£Ltñ'?í)£N‚ÿ?í)e)$«‘?í)e+2T ?í)'Å°?í)'iÉ?í(èÛ¿$?í(èÝ›^Û?í(ª±Hì¥?í(ª³V‡ü?í(l„³ š?í(l†À¤‘?í(.UËá?í(.WÙt%?í'ð$–¾?í'ð&£ ó?í'±ñ †?í'±ó•Y?í's»8K–?í's½EÑ?í'5ƒrŸ?í'5…ó¯?í&÷Hœõò?í&÷Jªr¡?í&¹ ÙêK?í&¹ çb˜?í&zÌÈzx?í&zÎÕîc?í&<‹h±3?í&·G?í"•šx €?í"•œ…N3?í"W3m}þ?í"W5z§M?í"Ê;Š?í"Ì`t?í!Ú^dîÖ?í!Ú`r[?í!›ðgóØ?í!›òu÷?í!]€ ?í!]‚(!W?í! }ZÎ?í!Šn"?í à˜dm?í àšs\?í ¢!UÑ?í ¢#bY?í c§É¦,?í c©Ö¬N?í %+ïñ¾?í %-üóz?íæ­ÈÙì?íæ¯Õ×A?í¨-RõŠ?í¨/_îy?íiªwa?íi¬œké?í+%ÜJ?í+'ŒÌk?íìž"»l?íì /§%?í®x³I?í®…š›?íoˆ‚¬?íoŠk?í0ú@g+?í0üME¯?íòi²Ëõ?íòk¿¦?í³ÖÚ/O?í³Øç?íuAkßb?íuCx°­?í6©g~¶?í6«tKš?íø+Y?íøóÔ?í¹reW?í¹tqÓj?ízÓhƒD?ízÕuBî?í<2±B?í<4&lƒ?íýŽx¡´?íý…X‹?í¾è…ñ ?í¾ê’£{?í€@Bϲ?í€BO}·?íA•­ÔN?íA—º}ê?íèÈÃG?íêÕhy?íÄ9“ï(?íÄ; ï?í…ˆ´?í…Š³?íFÔ:Œ¤?íFÖG$—?íí?í #&?íÉe¤Œb?íÉg±€?튪ä¦?튬ðZ?íKíÔΰ?íKïáTø?í .wÎ(?í 0„P?íÎlÍW ?íÎnÙÔ{?í¨Õ¼Q?íªâ5X?íPâ½z?íPä2?íœ?í ŽË?íÓO#Ÿ6?íÓQ0 ù?í”ù×ì?프?C?íU²…j?íU´‘Í?íàÅËÆ?íâÒ*F?íØ º¼Ô?íØÇæ?í™6e$&?í™8qyÌ?íZ]ÅèŽ?íZ_Ò9Ç?í‚Ü€o?í„èÍ;?íÜ¥©‰?íܧµÑb?íÅãîy?íÇð2k?í^㉑ ?í^å•Ð?íþÞí?í ë(¦?íá⛆?íáîÒ.?í¢.•š?í¢0¡±Ô?ícB÷¡¦?ícEÏr?í$U æJ?í$W§?íådÌŸ ?íåfØÃû?í¦r?ÓÞ?í¦tKô_?íg}dì?ígp;þ?í(†9AÌ?í(ˆEYo?íéŒÀA?íéŽÌ1u?íªùÿ?íª“Ä?ík’äQ?ík”ð¦?í,’œ?í,”$?ííÒ?íí‘Þ†?í®ŠÕ†Õ?í®ŒáƒÛ?íoƒŒå´?ío…˜ÞJ?í0y÷òÉ?í0|æï?íñn0?íñp"ïå?í²_êòÎ?í²aöÞ?ísOr÷@?ísQ~Þ?í4<¯ò‹?í4>»Ôí?íõ'¢€Q?íõ)®^B?í¶K…ƒ?í¶W_?ívöªxl?ívø¶M{?í7Ú¿ôÄ?í7ÜËÅa?íø¼‹º`?íø¾—†‹?í¹œ÷§?í¹ž¿`?ízyIÿ?íz{UÂY?í;T§ÂF??í >©ÍóI?í ÿv¬«?í ÿx·¼B?í ÀCF•@?í ÀER9d?í ’‹?í »?íT¶2¸?íTÁQ?핽ui?í—ÈH?íÕxA?íÕƒ¨?하å]?í•šðn~?íVW?íV‹Í?í’Ú(?í”å0?í× cè?í×nl?í—ƒ X?í—…«b?íWø‘ݦ?íWúœØ7?ík8è²?ímCÞÉ?íØÛ”žr?íØÝŸ?í™I¦q˜?í™K±^¼?íYµn Ö?íY·y €?íëk?í öO>?íÚ† ‡?íÚˆ*ë?ìþžôD8^?ìþžöNÝÎ?ìþ_;–â‹?ìþ_=¡ƒ?ìþ€¤Àª?ìþ‚¯]!?ìýßÃ'Ë7?ìýßÅ2c1?ìý ‰§?ìý (#?ìý`@Ç!£?ìý`BÑ°¢?ìý |$áÖ?ìý ~/lX?ìüàµ6Ш?ìüà·AV¬?ìü ëþò?ìü î—x?ìüa zoÊ?ìüa"„ìÒ?ìü!R«äÅ?ìü!T¶]O?ìûá‚“ ?ìûá„€*?ìû¡°1Uý?ìû¡²;Å‹?ìûaÛ„Îü?ìûaÝ: ?ìû"À6?ìû"š&Æ?ìúâ+R0`?ìúâ-\’q?ìú¢OËZ?ìú¢QÕbì?ìúbqû¯X?ìúbtk?ìú"‘ä}’?ìú"“îÒ&?ìù⯅.Ü?ìùâ±~ð?ìù¢Êß3S?ìù¢Ìé~ç?ìùbãò³?ìùbåüHÈ?ìù"ú¾1?ìù"üÈt$?ìøãCÊ.?ìøãNB?ìø£!ƒóz?ìø£#Ž- ?ìøc1}”@?ìøc3‡ÉT?ìø#?2dÀ?ìø#A<•R?ì÷ãJ¡Ü3?ì÷ãL¬E?ì÷£SÌÚr?ì÷£U×?ì÷cZ²Öí?ì÷c\¼ùü?ì÷#_Tù¤?ì÷#a_3?ìöãa³JH?ìöãc½dU?ìö£aΰ?ìö£cØ.;?ìöc_¥ü»?ìöca° Ä?ìö#[:þN?ìö#]E Õ?ìõãTF¬k?ìõãVP´q?ìõ£JÇò ?ìõ£LÑõŽ?ìõc>ýí‹?ìõcAì‹?ìõ#0êä¡?ìõ#2ôß?ìôã ŽM)?ìôã"˜C$?ìô£ ç [?ìô£ðþÓ?ìôbø÷²½?ìôbûŸ²?ìô"á¿k‡?ìô"ãÉSù?ìóâÈ>=ã?ìóâÊH!Ñ?ìó¢¬ußd?ìó¢®¾Ï?ìóbŽe6®?ìóbo•?ìó"n ÙÕ?ìó"p°8?ìòâKm?ìòâMvè÷?ìò¢&‡C?ìò¢(áž?ìòaÿY¸n?ìòbcD?ìò!ÕæqJ?ìò!×ð5œ?ìñáª-0?ìñá¬7Lþ?ìñ¡|.;Z?ìñ¡~7ö£?ìñaKê1@?ìñaMóè?ìñ!a-Ë?ìñ!jà ?ìðàä“7Ç?ìðàæœå?ìð ­€Ù?ì𠯊G ?ìð`t*Í–?ìð`v4rC?ìð 8gK?ìð :šs?ìïßú²Øž?ìïßü¼t??ì’·ú?ìœO?ìï_x/}?ìï_z9³?ìï3‰¾•?ìï5“L£?ìîÞì¢Z—?ìîÞî«ä?ìyÀ?ì‚•Á?ìî^Xw°?ìî^Zø*?ìî b–Ì?ìî l¿?ìíݺ/³“?ìíݼ9*ÿ?ìíguAä?ìíi~´È?ìí]qÄ?ìí]{2`?ìí»&?ìí½/ì?ììÜa’…!?ììÜc›ên?ì윷^1?ììœÀ¾ö?ìì[§”î[?ìì[©žJ˜?ììG*ó½?ììI4Kq?ìëÚä{!?ìëÚæ„tG?ìëš„^?ì뚬¿?ìëZG‡?ìëZPÑ*?ìë®Å0¸?ìë°ÎvI?ìêÙBüÒ?ìêÙE?ìê˜ÔïGj?ìê˜Öøƒè?ìêXdm?ìêXf¦¥ ?ìêòrÚ?ìêô¦E?ìé×}+|}?ìé×4«_?ìé— ð?ìé—IH?ìéVŒªÑš?ìéVŽ³÷g?ìépê?ìé’-?ìèÕ“J‰?ìèÕ•&gB?ìè•ñÖ*?ìè•úîW?ìèT„ÆG?ìèT’Ùé?ìè ÕKa?ìè ÞZx?ìçÓ„ãú§?ìçÓ†í4?ìç’û±°ž?ìç’ýº¶Ÿ?ìçRp=åT?ìçRrFæÉ?ìç≼ ?ìçä’¹Š?ìæÑR•=:?ìæÑTž5™?ìæÀ`ür?ìæÂiðD?ìæP+í?ìæP-õðd?ìæ•9à•?ìæ—BËP?ìåÎüMÃ?ìåÎþ 3ñ?ìåŽ`D˜Ë?ìåŽbMzl?ìåMÂ@T•?ìåMÄI1ª?ìå !õ>Ý?ìå #þd?ìäÌc£Ý?ìäÌlw×?ìä‹ÚŒ¥??ìä‹Ü•t¬?ìäK3p6?ìäK5yZ?ìä Š‘…?ìä ŒW×?ìãÉÞgÍæ?ìãÉàpª?ìã‰0}ã?ìã‰2…Ü?ìãH€M&V?ìãH‚UÞÿ?ìãÍÙ?ìãÏáº?ìâÇ!ß ?ìâÇ*,?ìâ†b&U\?ìâ†d/Z?ìâE¨è?ìâEªð½ƒ?ìâígq\?ìâïp^¸G?ìÝ5UŠ ö?ìÝ5W’V?ìÜôlxÂI?ìÜônÞ?ìܳ#gc?ìܳƒ+©f?ìÜr“‰¸?ìÜr•‘õ?ìÜ1£¬Ô?ìÜ1¥µ ø?ìÛð±Œ2?ìÛð³”fÚ?ìÛ¯½'‘–?ìÛ¯¿/ÁO?ìÛnÆ€Wœ?ìÛnȈ‚Â?ìÛ-Í–‰|?ìÛ-Ïž°?ìÚìÒj¹„?ìÚìÔrÛƒ?ìÚ«Ôý3O?ìÚ«×Pº?ìÚjÕMûà?ìÚj×V¸?ìÚ)Ó]T?ìÚ)Õe,˜?ìÙèÏ+¨_?ìÙèÑ3¸?ì٧ȹjƒ?ìÙ§ÊÁuŸ?ìÙfÀd?ìÙfÂj?ìÙ%µû:?ìÙ%·ý-?ìØä§áîÎ?ìØä©éì-?ìØ£˜oý–?ìØ£šwö`?ìØb†¿GO?ìØbˆÇ;…?ìØ!rÐö?ìØ!tØ–?ì×à\¡Zý?ì×à^©F?ìןD5¾?ìןF<ê4?ì×^)ŠÑN?ì×^+’³.?ì× ¢Ÿ?ìÖY¨{?ìÖYªƒO?ìÖ‚ 6ð?ìÖ„¨â?ìÕ×Z‰#‹?ìÕ×\éç?ìÕ–/ò\¼?ìÕ–1ú?ìÕUÚµ˜?ìÕUârÆ?ìÕÓþ?ìÕÕ‡·?ìÔÒ¡â;}?ìÔÒ£éï|?ìÔ‘n·?ìÔ‘p f?ìÔP7ß4?ìÔP9æ­?ìÔÿyÚ²?ìÔ€ì?ìÓÍÄÓ^@?ìÓÍÆÚÿâ?ìÓŒ‡ëJÔ?ìÓŒ‰òçÞ?ìÓKHÁë"?ìÓKJɃ”?ìÓ X\×?ìÓ _ð°?ìÒÈî¤\?ìÒÈŶ3œ?ìÒ‡}Ä9Ÿ?ìÒ‡ËÄH?ìÒF5š€Ÿ?ìÒF7¢®?ìÒë0ñj?ìÒí8rá?ìÑÞ‡Öø?ìÑàSÕ?ìÑ‚O Ä?ìÑ‚Q§?ìÑ@þyÑÆ?ìÑAEq?ìÐÿ«d7?ìÐÿ­ÓH?ìоUq$ ?ìоWxŽ„?ìÐ|ýèÃ?ìÐ|ÿ˜N¡?ìÐ;£s*ç?ìÐ;¥zŒ+?ìÏúGï’?ìÏúIL?ìÃð_U^?ìÃða[™?ìî–Žë?ìj?ìÃlË‹ Á?ìÃlÍ‘‡&?ìÃ*þI8x?ìÃ+O®;?ìÂé.Éq¦?ìÂé0ÏâÇ?ì§] —?ì§_„?ìÂe‰];?ìÂe‹Å?ìÂ#²ÜÑK?ìÂ#´ã4„?ìÁáÚjÓ?ìÁáÜq1˜?ìÁŸÿ»Å?ìÁ Â?ìÁ^"ÑLJ?ìÁ^$ס™?ìÁC«±ð?ìÁE²œ?ìÀÚbJ´m?ìÀÚdQu?ìÀ˜~¯( ?ìÀ˜€µoq?ìÀV˜Ù›¦?ìÀVšßÞg?ìÀ°ÉÍÈ?ìÀ²Ð ä?ì¿ÒÆÂ?ì¿ÒÈ…ü ?ì¿Ùü“Æ?ì¿ÜÈ›?ì¿Në@(?ì¿NíF0X?ì¿ úJ ü?ì¿ üP7‡?ì¾Ëd?ì¾Ë "=J?쾉µS ?쾉»uâ?ì¾GÝv?ì¾Gû?ì¾ @-­?ì¾"FF¤?ì½Ã$2£`?ì½Ã&8·²?ì½%ís$?ì½'ó‚Ð?ì½?%qü?ì½?'x?ì¼ý"~?ì¼ý$„ g?ì¼»K>?ì¼»Lø?ì¼ye&€?ì¼yk#•?ì¼7 {ÞË?ì¼7 ×9?ì»ôÿV[š?ì»õ\Ob?컲ðó`?컲òøï?ì»pàRŸ½?ì»pâXŠ7?ì».ÍvQ€?ì».Ï|7S?ìºì¸^]È?ìºìºd>ó?캪¡ ‚p?캪£^ô?ìºh‡{’?ìºh‰ií?ìº&k±J¢?ìº&m·×?ì¹äM«ôƒ?ì¹äO±Ã?ì¹¢-lìœ?ì¹¢/r¶?ì¹` ó!®?ì¹` øæë?ì¹æ?fp?ì¹èE'?ì¸Û¿R?ì¸ÛÁXI|?츙–+Ë4?츙˜1‚x?ì¸WjÌ78?ì¸WlÑéÓ?ì¸=4_ë?ìµ~ûVZp?ìµ~ý[ÙÁ?ìµ<µbÖã?ìµ<·hQ‰?ì´úm9ïz?ì´úo?eu?ì´¸"œ }?ì´¸$¡~Î?ì´uÕ…Èf?ì´u׋5 ?ì´3†3ðÚ?ì´3ˆ9XÔ?ì³ñ4¦DC?ì³ñ6«§‘?ì³®àÜ€(?ì³®âáÞË?ì³lŠ×ÿF?ì³lŒÝY=?ì³*2™M¸?ì³*4ž£?ì²çØZ¦?ì²çÚ$«E?ì²¥{kŘ?ì²¥}q‹?ì²c~‘?ì²cƒØb?ì² »V¬¨?ì² ½[ïB?ì±ÞWöAR?ì±ÞYû??ì±›ò\ƒx?ì±›ôa¼¸?ì±YŠ‰ÿt?ì±YŒ4?ì± †`?ì±"„¶G?ì°Ô´=?ì°Ô¶BFP?ì°’EÂ{Ñ?ì°’GÇ¢\?ì°OÕ¾p?ì°O×àN?ì° b'\”?ì° d,yÄ?ì¯Êí'p?ì¯Êï ?ò?쯈u°«€?쯈wµ¿T?ì¯Eü$0˜?ì¯Eþ)?½?쯀a0¤?쯂f;?ì®Áh|ä?ì®Ám‚­?ì®~‚:æ™?ì®~„?ç³?ì®;ÿ×^ž?ì®<Ü[ ?ì­ù{?„?ì­ù}D{Ú?ì­¶ôsZˆ?ì­¶öxM•?ì­tkr Ì?ì­tmw*?ì­1à>(C?ì­1âCò?ì¬ïRÖ9?ì¬ïTÛ?쬬Ã:Öò?쬬Å?·@?ì¬j1+ÿ—?ì¬j30Û5?ì¬'œ¨(ª?ì¬'ž¬ÿ™?ì«åê|?ì«åïNE?ì«¢lòrŒ?ì«¢n÷@?ì«_ÑÁ©&?ì«_ÓÆr?ì«4V†Þ?ì«6[K ?ìªÚ”²¨±?ìªÚ–·h-?쪗òÖU?쪗ôÛç?ìªUNÁŽB?ìªUPÆD[?쪨u#œ?쪪yÕ?ì©ÏÿðJ?ì©ÐôöÎ?ì©U4´?ì©W8½¹?ì©J¨AUï?ì©JªEùB?ì©ùÈ°?ì©ûgP?ì¨ÅG¶ç¨?ì¨ÅI»–?쨂” 4?쨂–$ p?ì¨?ÞS5Ì?ì¨?àWÆU?ì§ý&Pj?ì§ý(TõÝ?짺l3-?짺nºQ?ì§w¯«Œ?ì§w±¯žý?ì§4ñ 6?ì§4ó ô?ì¦ò01Ò.?ì¦ò26K9?즯m'‚?즯o+ök?ì¦l§è]R?ì¦l©ìÌõ?ì¦)àvx?ì¦)âzkh?ì¥çÐnp?ì¥çÔÔ¬?쥤J÷ª4?쥤Lü ¼?ì¥a|ëû ?ì¥a~ðWá?쥬®¹-?쥮³M?ì¤ÛÚ>’˜?ì¤ÛÜBæ?줙#½?줙¡rs?ì¤V.Ê+˜?ì¤V0Îuš?ì¤U…Åß?ì¤WŠ ,?ì£ÐyÏtß?ì£Ð{Óµw?죛àÀ?ì£äûù?ì£J»¸Ü ?ì£J½½Ì?ì£ÙZ1?ì¡3lÆ€¹?ì ðv¯à?ì ðx³ìÔ?ì ­€htò?ì ­‚l|ÿ?ì j‡ì·è?ì j‰ð»>?ì '<"é?ì '@!ˆ?ìŸäW@?ìŸä’[9ý?쟡‘?ej?쟡“CZš?ìŸ^òý9?ìŸ^‘öí±?쟌s¡‡?쟎wG?ìžØ†Á¤?ìžØˆÄ÷¬?ìž•~ܲ?ìž•€ßû?ìžRtÄx?ìžRvÈU®?ìžhzüý?ìžj~ÕÛ?ìÌYÿeï?ìÌ\:?ì‰IQù\?ì‰KUÈÉ?ìF6sÉT?ìF8w”?ì!d”ˆ?ì#hZ‚?ìœÀ $Ë?ìœÀ 'Û ?ìœ|ð´6½?ìœ|ò·óE?ìœ9ÕW ?ìœ9×Ù?ì›ö·C?ì›ö¹FÇ•?웳—¸M?웳™f§?ì›ptU]*?ì›pvYÊ?ì›-Op°?ì›-Qs¾–?ìšê(TîÖ?ìšê*X?욦ÿe?욧­Ö?ìšcÓ{Ø[?ìšcÕo?ìš ¥¿É^?ìš §Ã[Y?ì™ÝuÎm?ì™ÝwѨ­?왚C¨"y?왚E«ªþ?ì™WMª?ì™WP˜s?ì™ؾEî?ì™ÚÁÄü?ì˜ÐŸûsõ?ì˜Ð¡þîG?ì˜ekA?ì˜gà×?ì˜J'Ü-J?ì˜J)ßž$?ì˜èÿG?ì˜êƒke?ì—æðâÎ?ì—èôJ/?ì—€c/0?ì—€e2Õ?ì—=:óÌ?ì—=>Qµ?ì–ùÕAš?ì–ùךÆ?ì–¶Š¿¶O?ì–¶ŒÃ ½?ì–s>7SÌ?ì–s@:£~?ì–/ï~±o?ì–/ñüc?ì•ìž•f?ì•ì ˜Lœ?ì•©K{^?ì•©M~`Ø?ì•eö0þY?ì•eø4;?ì•"ž·,z?ì•" ºdw?ì”ßE «à?ì”ßGß ?ì”›é5Ð@?ì”›ë8þÁ?ì”X‹.J@?ì”X1t?ì”*øô’?ì”,ü—?ì“ÑÈ•ø?ì“Ñʘ®>?ì“ŽdNf?ì“Žfií?ì“Jý0?ì“JÿFç?ì““™YÇ?ì“•œkÐ?ì’Ä'øy—*?실|@¦?실’~͈?ì‹`çƒx?ì‹`é“ –?ì‹{?ìŠÙŽöd]?ìŠÙøâô?ìŠ•ß :H?ìŠ•á ´?ìŠR,é/K?ìŠR.ë¤Z?ìŠx–C¤?ìŠz˜³î?ì‰ÊÂ@Ç?ì‰ÊĬM?쉇 Zj?쉇 \ÐÄ?ì‰CNq¿»?ì‰CPt!·?ìˆÿ‘X ^?ìˆÿ“Zh•?ìˆ»Ò Z?숻ÔèÌ?ìˆx‘É%?ìˆx”Ò?ìˆ4LåÂG?ìˆ4Nè.?ì‡ð‡ |O?ì‡ð‰ Æp?쇬¾ý:Í?쇬Àÿ€(?ì‡hôÀþv?ì‡höÃ? ?ì‡%(Vœ–?ì‡%*XØf?ì†áY¼„>?ì†á[¾»H?솈óÁü?솊õô??ì†Yµü™‰?ì†Y·þÇ?ì†à×N®?ì†âÙwd?ì…Ò ƒâ\?ì…Ò †K?ì…Ž00?ì…Ž2=X?ì…JTT:™?ì…JVVTú?ì…vyO…?ì…x{e?ì„–qR¢?섘sct?ì„~´<‡ô?ì„~¶>“þ?ì„:ÏÜ>Î?ì„:ÑÞF?ìƒöéPxZ?ìƒöëRzÔ?샳˜m|?샳šk.?ìƒoµmŠ?ìƒo·ft?ìƒ+(§7?ìƒ+*©+6?ì‚ç9nQ?ì‚ç;p@o?ì‚£H ½?ì‚£J §˜?ì‚_T@q‘?ì‚_VBWY?ì‚^ L„?ì‚`-‚?ì×e©%~?ì×g«³?ì“kÄq?ì“m›Ý?ìOnOa?ìOpQ3¸?ì oZ!?ì q[Óù?ì€Çn58Ý?ì€Çp7ì?쀃jà¶?쀃lâzÔ?ì€?e]G&œ?ìv B±Ñh?ìv D²Úp?ìuÛçû€h?ìuÛéü„Ÿ?ìu—‹%°?ìu—%?ìuS,  ?ìuS.y£?ìuÊ×Ä?ìuÌØ‹?ìtÊgv³¨?ìtÊiw¤ž?ìt†ëÈ~?ìt†ì´£?ìtAš7?ìtAœ8U?ìsý0YÀ ?ìsý2Z¢Ž?ìs¸ÄR£:?ìs¸ÆS€ë?ìstV#Uº?ìstX$.š?ìs/åÊÏZ?ìs/çË£h?ìrësJ?ìrëuJèB?ìr¦þ¡ùt?ìr§¢ÃÞ?ìrb‡Ò.þ?ìrb‰Òô–?ìrÚü’nF?ìp>ƒ“ H?ìoùöÓÊn?ìoùøÔdœ?ìoµièÒ9?ìoµkég“?ìopÚÒJ¾?ìopÜÒÛE?ìo,I·?ìo,K‘BÐ?ìnç¶#Ô?ìnç¸$[o?ìn£ ‹äY?ìn£"Œfc?ìn^ˆÉi¬?ìn^ŠÉæâ?ìnîÜ!ý?ìnðÜš^?ìmÕRÄÒz?ìmÕTÅF?ìm´„@J?ìm¶„¯?ìmL¥4?ìmL?ìmq…Æx?ìms†+…?ìlÂÌÉiB?ìlÂÎÉÉz?ìl~%ä q?ìl~'ädÔ?ìl9|Ö*p?ìl9~Ö€ý?ìkôÑ ‘s?ìkôÓ ã*?ìk°$BxÂ?ìk°&BÅ£?ìkkt½î±?ìkkv¾6¼?ìk&Ãh5?ìk&Å«j?ìjâ=ª¢?ìjâ=é?ìjYC½?ìj[Cö?ìjX¡#]?ìjX£#’@?ìjæÜŒ@?ìjèܼ?ìiÏ*pk?ìiÏ,p9o?ìiŠkÝä+?ìiŠmÞ X?ìiE«&ÒÐ?ìiE­&ô%?ìièJÚ?ìiêJöþ?ìh¼#Bä?ìh¼%ZŠ?ìhw[q¡P?ìhw]q´?ìh2‘¨q°?ìh2“¨¦?ìgíÅ´¹T?ìgíÇ´Âr?ìg¨÷•±Ô?ìg¨ù•¶?ìgd'LãÓ?ìgd)Lã@?ìgTÙÊ­?ìgVÙÅB?ìfÚ€<#‰?ìfÚ‚<E?ìf•©u5^?ìf•«u&A?ìfPЄþù?ìfPÒ„ë?ìf õk;?ìf ÷kfk?ìeÇ)yÜ?ìeÇ)\3?ìe‚8¾¬:?ìe‚:¾‰¸?ìe=W+˜~?ìe=Y+q#?ìdøsqCî?ìdøuq¹?ìd³*|?ìd³Žùm?ìdn¥…ÎX?ìdn§…˜o?ìd)»Tí/?ìd)½T²l?ìcäÎýÍÎ?ìcäÐýŽ0?ìcŸàij?ìcŸâ$ñ?ìcZïÛÙ?ìcZñÚ½†?ìcý(b?ìcÿÚ4?ìbÑ!ó?ìbÑ µê?ìbŒ ­Ü?ìbŒ U÷?ìbGÑ™|?ìbGÑ<½?ìbrHd?ìbqæÉ?ìa½î¿ê?ìa½ îYs?ìaxF¾,?ìax!FRÙ?ìa3zŦ?ìa3zUx?ì`îŠÖ?ì`îŠ`ü?ì`©wô•?ì`©wz¯?ì`d AŠ?ì`d @œÈ?ì`­su?ì`¬ïÖ?ì_ÙóºN©?ì_Ùõ¹Æ-?ì_”ä_É?ì_”æœÒq?ì_OÓWªo?ì_OÕW9?ì_ ¿é,Â?ì_ Á蕯?ì^ŪQå ?ì^ŬQI?ì^€’’•‹?ì^€”‘ô¾?ì^;x«e+«?ì]±@d|D?ì]l4€?ì]l €;?ì]&ûñˆ?ì]&ý8e?ì\áÖÖfS?ì\áØÕ¨R?ì\œ°è?ì\œ²Q ?ì\W‡ óú?ì\W‰ ,;?ì\[?ì\]î¿î?ì[Í.¬ÜF?ì[Í0¬ Ê?ì[‡ÿD_?ì[ˆC‰1?ì[BÍ·ð?ì[B϶>µ?ìZýšŒ™?ìZýœ¬?ìZ¸d.±Â?ìZ¸f-ÌÈ?ìZs,4‘?ìZs.3§Ã?ìZ-ò&}?ìZ-ô7Ä?ìYèµÓñ¹?ìYè·Òþ ?ìY£wnµ¸?ìY£ym½??ìY^6æóÀ?ìY^8åöf?ìYô;ç¢?ìYö:åh?ìXÓ¯nÖ?ìXÓ±mÎê?ìXŽh|ü?ìXŽj~q?ìXImÛÚ?ìXI!lÊý?ìXÔ:ö ?ìXÖ9àb?ìW¾†çM6?ìW¾ˆæ2˜?ìWy78VÙ?ìWy977Y?ìW3å,©j?ìW3ç+…?ìVîù0W?ìVî’ø?ìV©:ž*p?ìV©<œüK?ìVc♈?ìVcäf€?ìV‡sù€?ìV‰rÁ—?ìUÙ*¥ 0?ìUÙ,£Îe?ìU“˯̎?ìU“Í®Šà?ìUNj”½€?ìUNl“vï?ìU SÜ?ìU Rš?ìTáî*?ìTãìÙ²?ìT~:cd’?ìT~Þ†?ìQÇ»=Xf?ìQ‚:.Ô ?ìQ‚<-I?ìQ<¸ý.’?ìQ<ºûž¨?ìP÷5ª-„?ìP÷7¨˜µ?ìP±°5Ï?ìP±²45Ù?ìPl(¡v?ìPl*ŸwÝ?ìP&žë>³?ìP& é›4?ìOáË•?ìOá#1?ìO›…¸ò?ìO›‡ ¨?ìOUõ Çé?ìOU÷¹?ìObÔ¹‡?ìOdÓp?ìNÊÎG‘?ìNÊÐEa”?ìN…7_[?ìN…9]Ex?ìN?žQ[”?ìN? O•Ë?ìMú›ó?ìMúÑB?ìM´eÆC‘?ìM´gÄsú?ìMnÆIë?ìMnÈG=m?ìM)$§Æn?ìM)&¥í ?ìLã€áœ¾?ìLã‚ß¾r?ìLÚ÷T[?ìLÜõq'?ìLX2ê-ô?ìLX4èEÙ?ìLˆ¹$¿?ìLŠ·7¼?ìKÌÜe8Ö?ìKÌÞcFë?ìK‡-îgô?ìK‡/ìq ?ìKA}Tðt?ìKARô¹?ìJûʘÐ0?ìJûÌ–ÏŒ?ìJ¶»ˆP?ìJ¶¹‚Ä?ìJp^»Óþ?ìJp`¹É‰?ìJ*¥š³X?ìJ*§˜£ú?ìIäêXdà?ìIäìVPš?ìIŸ,ôæ›?ìIŸ.òÍl?ìIYmq8œ?ìIYooƒ?ìI«ÍXî?ìI­Ë5ì?ìHÍè„O?ìHÍê\c?ìHˆ"$;Ê?ìHˆ$"õ?ìHBZ =?ìHB\ _?ìGüüÇ ?ìGü‘ú_?ìG¶ÃºÙ’?ìG¶Å¸þ?ìGpõZs?ìGp÷X2ˆ?ìG+$ÚЈ?ìG+&Ø‹?ìFåR<ò:?ìFåT:§ç?ìFŸ}—½?ìFŸH?ìFY¦¨(?ìFY¨¦*ÿ?ìFÍyÏ?ìFÏvµ»?ìEÍññ—ˆ?ìEÍóï9‰?ìEˆF|¹?ìEˆDÏ?ìEB4w»f?ìEB6uS?ìDüR…ÑA?ìDüTƒd€?ìD¶nq<?ìD¶pnÊZ?ìDpˆ9øÑ?ìDpŠ7‚8?ìD*Ÿà…a?ìD*¡Þ Û?ìCäµe.?ìCä·bž¼?ìCžÈÇÃw?ìCžÊÅ>?ìCXÚð ?ìCXÜeÁ?ìCé(¢>?ìCë&?ìBÌö'Wò?ìBÌø$ÃÍ?ìB‡z?ìB‡vh?ìBA Ä„?ìBA Ág…?ìAûawË?ìAû^Ôß?ìAµß$|?ìAµÜ|¢?ìAo= !?ìAo:\Z?ìA){ãä?ìA)y2/?ì@ã›r3?ì@㘻?ì@œ2?ì@™vƒ?ì@W ~¡?ì@W {á?ì@B~2?ì@?¸Å?ì?ÊøèF?ì?Êúå{Â?ì?„ìp÷¢?ì?„în(X?ì?>ÝÜT?ì?>ßÙ<?ì>øÍ*T?ì>øÏ'5,?ì>²º[/ª?ì>²¼XQ’?ì>l¥oò?ì>l§mx?ì>&Žg”œ?ì>&d¬¦?ì=àuC”ƒ?ì=àw@§ž?ì=šZðF?ì=š\þp?ì=Tlëø?ì=†ºâ?ì=ƒ¿-?ì<Çú{Øœ?ì<Çüx×÷?ì<ÖNø‚?ì<ØKòì?ì<;°×J?ì<;±ýÌÄ?ì;õ‡’q?ì;õ‰b&?ì;¯]„>?ì;¯^ÿoÖ?ì;i0RËÐ?ì;i2O²w?ì;#ƒE?ì;#€&É?ì:ÜÐ’­?ì:ÜÒ‰Ü?ì:–ƒ€E?ì:–Ÿ€X?ì:PhT;×?ì:PjQ¹?ì: 1v?ì: 3êf?ì9Ã÷™_?ì9Ãù–'þ?ì9}¼€?ì9}¾ Ä?ì97~cþ ?ì97€`½%?ì8ñ>œTN?ì8ñ@™v?ì8ªü·@D?ì8ªþ³õz?ì8d¸³¿ª?ì8dº°oí?ì8r“ŽÈ?ì8t:?ì7Ø*Vjü?ì7Ø,SY?ì7‘ßü‘s?ì7‘áù2Ý?ì7K“†#?ì7K•ƒš?ì7Dô1o?ì7FðÈò?ì6¾ôFe/?ì6¾öB÷À?ì6x¡|˜;?ì6x£y%Ø?ì62L—Ç=?ì62N”Oæ?ì5ëõ—ï¼?ì5ë÷”sq?ì5¥œ}L?ì5¥žyŽ ?ì5_AGâÐ?ì5_CD\?ì5ãø§®?ì5åõ‡?ì4Ò„×?ì4Ò†‹‹»?ì4Œ"Õ '?ì4Œ$Ñw?ì4E¾ÇG8?ì4EÀí2?ì3ÿX™jv?ì3ÿZ•Ë|?ì3¸ðLpé?ì3¸òHÌù?ì3r…àVÁ?ì3r‡Ü­Ü?ì3,T˜ö?ì3,Pë?ì2媪2’?ì2嬦Â?ì2Ÿ9áŸ;?ì2Ÿ;Ýçu?ì2XÆú›³?ì2XÈöÞø?ì2Qõd?ì2Sñ¢d?ì1ËÚÒ³À?ì1ËÜÎí?ì1…a’Gœ?ì1…cŽ{þ?ì1>æ4Û ?ì1>è1 w?ì0øhºª@?ì0øj¶Ôµ?ì0±é#±Ú?ì0±ë×X?ì0kgp.?ì0kilN¡?ì0$ã [W?ì0$åœvç?ì/Þ]´µg?ì/Þ_°Ëÿ?ì/—Õ­÷¾?ì/—ת _?ì/QK‹`ˆ?ì/QM‡m2?ì/ ¿NiÔ?ì/ ÁJq†?ì.Ä0ö‘t?ì.Ä2ò”.?ì.} ƒÔ`?ì.}¢Ò#?ì.7 öî?ì.7òæá?ì-ðyPZ’?ì-ð{LNd?ì-©â×f?ì-©ä‹Æ??ì-cIµàž?ì-cK±Ê?ì-®Ã1´?ì-°¿?ì,Ö· ~?ì,Ö²ém?ì,r’bú?ì,tŽ=ð?ì,HÑU;f?ì,HÓQc?ì,.µ?ì,/ü^¹?ì+»ˆ\|Z?ì+»ŠXHe?ì+tàh|?ì+tâdV?ì+.6V'A?ì+.8QéX?ì*çŠ%¾P?ì*çŒ!{m?ì* Ûؤ?ì* ÝÓÆÇ?ì*Z+m’Þ?ì*Z-iF?ì*xåÈ:?ì*závh?ì)ÌÄA¨?ì)ÌÆ=QE?ì)† .h?ì)†|Ò¡?ì)?T¤–š?ì)?V 5Ø?ì(ø™¬[f?ì(ø›§õª?ì(±Ü˜9œ?ì(±Þ“Îä?ì(ki*–?ì(kdºã?ì($\*€?ì($^µÒ?ì'ݘ¹öZ?ì'Ýšµ|°?ì'–Ó:H;?ì'–Õ5É•?ì'P  Ú0?ì'P œV?ì' AíiQ?ì' Cèà´?ì&Âv 1@?ì&Âx£§?ì&{¨9ì?ì&{ª5Yz?ì&4Ø9™l?ì&4Ú5Ú?ì%î qá?ì%îÕS?ì%§1ïn¶?ì%§3êÍ*?ì%`[¥Â?ì%`] é9?ì%ƒC.?ì%…>ã©?ì$Ò¨Êf??ì$Ҫŵ½?ì$‹Ì8Õë?ì$‹Î4 k?ì$Dí”ì?ì$Dï‹Úo?ì#þ Ñ!½?ì#þÌbB?ì#·)ú¸T?ì#·+õóÛ?ì#pE ÓÈ?ì#pG Q?ì#)^ ¬m?ì#)`Ýø?ì"ât¼9$?ì"âv·e²?ì"›‰€¾?ì"›‹¨L?ì"T›dßÁ?ì"T`R?ì" «Q£?ì" ­Šo5?ì!ƹžò?ì!Æ»™)„?ì!Å’Tm?ì!Çh?ì!8Ïkt?ì!8Ñf* ?ì ñ×)Ã?ì ñÙ$(X?ì ªÜÌØ?ì ªÞÇÜ—?ì càVÙ?ì câQo?ì áÆVþ?ì ãÁQ•?ìÕá’&?ìÕㇼ?ìŽÞYn?ìŽàT^¬?ìGÙ|æ¢?ìGÛwÒ9?ìÒ‡óz?ìÔ‚Ú?ì¹ÉyÓª?ì¹Ëtµ@?ìr¾S½Ö?ìrÀNšk?ì+±+Â?ì+³W?ìä¡ÀÄ?ì䣺ðW?ìRÊw?ì’M˜ ?ìV|ÎlÎ?ìV~É5_?ìg2Â?ìi-…˜?ìÈO€ÁÈ?ìÈQ{€V?ì5¸h8?ì7³!Å?ì:Ù3å?ì:Óèp?ìòûä[T?ìòýß Ý?ì«ÛÙÚÎ?ì«ÝÔ…U?ìd¹¹íx?ìd»´’ý?ì•… Z?ì—­Ü?ìÖo;´m?ìÖq6Oí?ìFÝ V?ìHØ6Ó?ìHk ]?ìHe×?ìï®w:?ìñ©±?ì¹À¥«r?ì¹Â 2æ?ìrƒÝ?ìr‘}†N?ì+\Fù?ì+^Avs?ìä&ð‹?ìä(ë?ìœï-ž?ìœñ{¡?ìUµø?ìU·ó t?ìzWh?ì|Q|Æ?ìÇ—¬Q?ìüËt·?ìþÅÔ ?ì8ºá”ù?ì8¼ÛïK?ìñvßâÈ?ìñxÚ8?ìª0ÆÖÞ?ìª2Á'&?ìbè–«P?ìbêö“?ìžOØÚ?ì J?ìÔQò[?ìÔSì]“?ì}°?ìwìÙ«“?ìù@Ò†â?ì±\ çV?ì±^½•?ìiw)i†?ìiy":µ?ì!8©?ì!’1u9?ìÙ§8?ìÙ©0ä?쑼'‚€?쑾 D?ìIÏÌ`?ìIщO?ìßØõÖ?ìáÑ­´?ëÿ¹î›uã?ëÿ¹ð”(°?ëÿqûNŽF?ëÿqýG<?ëÿ*¿ÕË?ëÿ*¸~u?ëþâ ë¡÷?ëþâäE?ëþšÌC?ëþšüjË?ëþRÒö?ëþRlm?ëþ ÷íã?ëþ ð‚H?ëýÂÔTæ?ëýÂÌä9?ëýzù;?ëýz–ƒ|?ëý2T—+?ëý2MZ?ëüê ø¤d?ëüêñ$€?ëü¢Š–”?ëü¢ƒŸ?ëüYú ìf?ëüYüb]?ëüíw—?ëüïp?ëûÉÞÓó?ëûÉàËüÅ?ëûÎö?ëûÐxµ?ëû9»Wì?ëû9½Oñ˜?ëúñ¦€1?ëúñ¨xaÉ?ëú©—©ç?ëú©‘l?ëúavŸ¬ê?ëúax—ÿ[?ëú[–ÔJ?ëú]!§?ëùÑ>~Nð?ëùÑ@v—:?ëù‰UÙ½?ëù‰!Nò?ëù@þ£ˆ?ëùAá©?ëøøÚ×íü?ëøøÜÐ' ?ëø°µƒ%ˆ?ëø°·{Y€?ëøhŽNS?ëøh}7?ëø d¬ Ä?ëø f¤Ê“?ë÷Ø9,K¦?ë÷Ø;$pa?ë÷ ž‡J?ë÷ –¦ð?ë÷GÜÓ[?ë÷GÝúíë?ëöÿªZ^”?ëöÿ¬Rt?ëö·v¤¨®?ëö·xœ¹?ëöo@â'»?ëöoBÚ3 ?ëö'߉0?ëö' ×j?ëõÞΚ•C?ëõÞÐ’–g?ëõ–’C7w?ëõ–”;3…?ëõNSÚ!÷?ëõNUÒî?ëõ_N\?ëõW@=?ëô½ÐÒ¶P?ëô½ÒÊ£?ëôuŒ5 ÿ?ëôuŽ,ó³?ëô-E††?ëô-G~i:?ëóäüÇè?ëóäþ¾ýo?ëóœ±÷,?ëóœ³îç›?ëóTeD?ëóTg^?ëó '?ëó Î@?ëòÃÅ'ë?ëòÃÇ´*?ëò{r >?ëò{tÍP?ëò3úT¸?ëò3ò±?ëñêÅÌú?ëñêÇÄ´`?ëñ¢lô–?ëñ¢nˆ©_?ëñZFzq?ëñZ>*"?ëñ³íÊ?ëñµån#?ëðÉT‡‚?ëðÉV'?ëð€ó5˜?ëð€õ Õÿ?ëð8‘D?ëð8‘‰+“?ëïð*?ëïð+ú¯—§?ëë±@¦áT?ëëh·é†ã?ëëh¹àËt?ëë /¿?ëë 1 þ„?ëêפ0ü[?ëêצ(6µ?ëê>ï¸?ëê6$÷?ëêFˆ>K?ëêFŠ5Hn?ëéý÷/¡R?ëéýù&ÌX?ëéµd ?ëéµf /ó?ëélÎé}¢?ëélÐàžp?ëé$7²{q?ëé$9©—#?ëèÛžnwR?ëèÛ eç?ë蓨?ë蓹~?ëèJeÀ¾€?ëèJg·ÊÜ?ëèÆW:L?ëèÈNAŠ?ëç¹$áÌk?ëç¹&ØÎŒ?ëçp`«´?ëçpƒW¨¸?ëç'ÛÓÑü?ëç'ÝÊÉâ?ëæß4;³:?ëæß62¦?ëæ–Š˜Ãh?ëæ–Œ±?ëæMÞêüi?ëæMàáäö?ëæ12Ò@?ëæ3)µ¯?ëå¼p¸ì?ë弃g—7¦N?ëá0k_‡a?ëá0mVº?ëàç˜qCò?ëàçšgË+?ëàžÃw°½?ëàžÅn2Õ?ëàUìru?ëàUîhl?ëà aŒp?ëà XF?ëßÄ8Eá?ëßÄ:?ëÚZsG,_?ëÚmÅ?ëÚoÂ?ëÙÈfÙÊ?ëÙÈhÏÐï?ëÙ^‹ø?ëÙ`ùÐ?ëÙ6T3lI?ëÙ6V)hÙ?ëØíGÏin?ëØíIÅ`Ø?ëؤ9`ÚŽ?ëؤ;VÌÓ?ëØ[(ç{Ã?ëØ[*Ýhã?ëØc¾ñ?ëØY¦í?ë×ÉÕÙf?ë×É˼yŒ?ë×í4W=?ë×6Ò˜0?ë×6Ô“p»?ëÖí·òµ%?ëÖí¹èˆŠ?ëÖ¤›>÷ð?ëÖ¤4Æ0?ëÖ[|‚Yv?ëÖ[~x"?ëÖ[¼Ò°?ëÖ]²–¤?ëÕÉ8ïN•?ëÕÉ:å a?ëÕ€˜?ëÕ€¼>?ëÕ6íâ?ëÓÙuŽs?ëÓÛk$?ëÓ6¤h]©?ëÓ6¦]î?ëÒímUG|?ëÒíoJÒÂ?ëÒ¤4<¾ ?ëÒ¤62D+?ëÒZù÷?ëÒZûx ?ëÒ»û¯«?ëÒ½ñ+y?ëÑÈ|¢ea?ëÑÈ~—Ü?ëÑ;g-?ëÑ=ت?ëÑ5÷sû?ëÑ5ùigg?ëÐì±ÍÎ1?ëÐì³Ã5]?ëУjØ°?ëУl:³?ëÐZ cÖx?ëÐZ"Y3Q?ëÐÔ tº?ëÐÖ•Ìk?ëÏdžÔ$Q?ëÏLjÉvØ?ëÏ~6þ¡C?ëÏ~8óî¡?ëÏ4å!M?ëÏ4çY?ëÎë‘;l¼?ëÎë“0¯Æ?ë΢;M3q?ë΢=BqR?ëÎXãWNà?ëÎXåL‡–?ëΉY??ë΋Nrš?ëÍÆ-TeÛ?ëÍÆ/I”à?ëÉxØ2ð¶?ëÉ/Yäµ2?ëÉ/[ÙÛ?ëÈåÛˆ?ëÈåÝ}c|?ëÈœZøk~?ëÈœ\í<Í?ëÈRØ1Ük?ëÈRÚ&¨?ëÈ Scc‡?ëÈ UX*{?ëÇ¿ÌŒ€„?ëÇ¿ÎBK?ëÇvC­£L?ëÇvE¢_æ?ëÇ,¸ÆÿÂ?ëÇ,º»·.?ëÆã+Ù}Ø?ëÆã-Î0?ëÆ™œäÙp?ëÆ™žÙ†?ëÆP éFv?ëÆP ÝîY?ëÆxçpã?ëÆzÜ—?ëżãÞœº?ëżåÓ:??ëÅsLÐ)í?ëÅsNÄÂD?ëÅ)³»˜?ëÅ)µ°+¸?ëÄࡾ?ëÄà•ª¸?ëÄ–{bn?ëÄ–}uë9?ëÄLÜ\¼?ëÄLÞQ!X?ëÄ;2Šê?ëÄ=' W?ëù˜ã?ëù™ø‹ ?ëÃoòÑfÊ?ëÃoôÅÚ×?ëÃ&K™Î??ëÃ&MŽ=?ëÂÜ¢^ã×?ëÂܤSM…?ëÂ’÷ cú?ëÂ’ùÈx?ëÂIIÞG ?ëÂIKÒ¦Z?ëÁÿš˜ý;?ëÁÿœWY?ëÁµéQ2€?ëÁµëE‡n?ëÁl6+È?ëÁl7ú{…?ëÁ"€¹H¤?ëÁ"‚­“0?ëÀØÉj í?ëÀØË^OI?ëÀh8?ëÀ ¨c?ëÀETÅKi?ëÀEV¹†c?ë¿û—q_~?ë¿û™e•F?뿱Ø6[?뿱Úfò?ë¿h“Éî?ë¿h‡õT?ë¿RÙYµ?ë¿TÍé?ë¾Ô–?ë¾Ô ¾™?뾊ÅP¦Ù?뾊ÇD©?ë¾@ûƒ}ì?ë¾@ýw”Š?ë½÷/°‘Ð?ë½÷1¤£WO"?ë¼<@KA^?ë»òdd:?ë»òfX'?뻨ˆmsâ?뻨Ša[·?ë»^ªrôd?ë»^¬f×?ë»Êu*¶?ë»Ìi$?ëºÊètý>?ëºÊêhÕx?ëºq9¬?ëºe ³?ëº7kyR?ëº7 _G%?ë¹í6c´?ë¹í8W|°?ë¹£LY¦H?ë¹£NMi±?ë¹Y`N6V?ë¹YbAô‹?ë¹rA\:?ë¹t5:?ë¸Å‚2Ôp?ë¸Å„&ˆ;?ë¸{#Àð?ë¸{’o†?ë¸1œÊ?ë¸1žÃ,?ë·ç¦›–?ë·ç§÷?Â?ë·­ó,°?ë·¯æ˧?ë·S³â‰Å?ë·SµÖ#‡?ë· ·Ñæš?ë· ¹Å{&?붿¹Áî?붿»µ}^?ë¶u¹²ÓÔ?ë¶u»¦]ô?ë¶+·t¬è?ë¶+¹h1Ó?ëµá³A?ëµá´øÁD?ëµ—¬‘w?ëµ—®„ò?ëµM¤½?ëµM¦ 2_?ëµ™ž€?ëµ›‘ð?ë´¹|?ë´¹æâ?ë´o~œlï?ë´o€Ò’?ë´%n®”?ë´%p ?ë³Û[Ž8'?ë³Û]“[?병GŠ?병Hõà?ë³G0t‰`?ë³G2gÚ&?ë²ýä¤!?ë²ý×ï¯?ë²²ýRZè?ë²²ÿE¡??ë²hà¾Î ?ë²hâ²+?ë²Â)¹Ž?ë²Äõt?ë±Ô¡“PC?ë±Ô£††ò?뱊~ü`?뱊€ï1Ö?ë±@Zd8?ë±@\WdR?ë°ö3˳’?ë°ö5¾Ú—?ë°¬ 3WÂ?ë°¬ &yŽ?ë°aàšàà?ë°aâýs?ë°´F˜?ë°µõ]ò?ë¯Í…j2ƒ?ë¯Í‡]D¤?믃TÓ‰z?믃VÆ–b?ë¯9"=À?ë¯9$0"o?ë®îí¨}?ë®î?뮤·lì?뮤¹j&?ë®Z~ƒ¦×?ë®Z€vžØ?ë®Cô¶?ë®Eç}?ë­ÆfÚ¡?ë­Æ YÈ.?ë­{ÈÜ:¶?ë­{ÊÏ#?ë­1ˆSì®?ë­1ŠFÏÇ?ë¬çEžÁd?ë¬çG‘ŸA?묻3*?묮 Í?ë¬R¹Õ´4?ë¬R»È‡œ?ë¬pî?ë¬ràÎ1?뫾&Ò8?뫾'ö›*?ë«sÙI‚?ë«sÛ 8?ë«)Š+—Ù?ë«)ŒVT?ëªß9==Ì?ëªß;/÷ ?몔æNYø?몔èA ü?ëªJ‘^¨'?ëªJ“QVï?ëª:nZk?ëª.ø˜?ë f£-:=?ë f¥6½?ë 08?ë  'w?ëŸÑkºÀ?ëŸÑm¬¾?ëŸ†Ì Zï?럆ÍüG¬?ëŸ<+ò¾?ëŸ<,õÚ:?ëžñˆîŒ?ëžñ‰òÐÆ?랦ã P?랦äòçI?ëž\<w¬?ëž\=öOc?ëž“ £ ?ëž”ýu?ëÆèƒU?ëÆêP‰?ë|;%úz?ë|=Âl?ë1Œ9Ä«?ë1Ž+‡[?ëœæÛR ?ëœæÝCÑ ?뜜(oŽŒ?뜜*aF·?ëœQs’g,?ëœQu„?뜼º”Ž?뜾¬B3?뛼èH€?뛼Ùðâ?ë›qI*7?ë›qK ÍV?ë›&ŒUö(?ë›&ŽG”?ëšÛÍ–SŒ?ëšÛχì%?ëš‘ Ý9™?ëš‘ÎÌî?ëšFIüvg?ëšFKîy?ë™û„òc?ë™û†ã—1?ë™°½èߘ?ë™°¿Úc"?ë™eôá?ë™eöÓI?ë™)ÜÅ’?ë™+Î>”?ë˜Ð\Ú$?ë˜Ð^Ëtá?똅Ùè²?똅ËW+?ë˜:¼Ý".?ë˜:¾Î‹b?ë—ïéã£À?ë—ïëÕ°?ë—¥ìîy?ë—¥ÞM#?ë—Z=ù¨[?ë—Z?ëÁ?ë—e ì€?ë—fü@ ?ë–ÄŠÆð?ë–ÄŒË?ë–y­9;?ë–y¯*aÑ?ë–.ÎVÖ½?ë–.ÐH ?ë•ãíymê?ë•ãïj¬õ?ë•™  Ô4?ë•™ ’ ø?ë•N%Î$•?ë•N'¿Y?ë•?1?ë•@ñ`;?딸V8O?딸X)xò?ë”mkvu?ë”mmg™À?ë”"~º_V?ë”"€«~»?ë“×îH?ë“בöf?ë“ŒŸVm?ë“Œ¡G¢E?ë“A¬®„?ë“A®Ÿ“ ?ë’ö¸'?ë’ö¹ÿ1Ù?ë’«Átù¼?ë’«Ãeþ¾?ë’`Èã+Å?ë’`ÊÔ+€?ë’ÎYc·?ë’ÐJ^*?ë‘ÊÑØ )?ë‘ÊÓÉU?ë‘Ó^ä…?ë‘ÕOÔi?ë‘4ÒîUo?ë‘4Ôß@ ?ëéÐXªð?ëéÒID?ëžË›u?ëžÍŒU?ëSÄâ ~?ëSÆÒæA?ë¼,Ø–?ë¾®?ë½±{—¼?ë½³lgí?ër¤Îy?ër¦¿Cø?ë'–&– ?ë'˜[ª?ëŽÜ…ƒ5v?ëŽÜ‡sõÍ?뎑rå6~?뎑tÕñ‹?ëŽF^LÉB?ëŽF`=?ëûG¹o?ëûIª’?ë°/+ÌÔ?ë°1x?ëe¤‡G?ëe•-.?ëø#â?ëúÀ€?ëŒÎÙ¨¯þ?ëŒÎÛ™KQ?댃¹4ó`?댃»%‰i?ëŒ8–ÈTž?ëŒ8˜¸å]?ë‹írbÉË?ë‹ítSU??ë‹¢L½‰?ë‹¢MõC³?ë‹W#®šn?ë‹W%ŸM?ë‹ ù`s?ë‹ ûP˜?ëŠÀÍ\×?ëŠÀÏ Ó ?ëŠužÜi?ëŠu ÌÚ ?ëŠ*n§”„?ëŠ*p˜7?ë‰ß<{›T?ë‰ß>l»?뉔X9¨?뉔 HšÃ?ë‰HÒ>ý?ë‰HÔ/XÖ?ëˆýš/-P?ëˆýœƒÔ?눲`(Àõ?눲b,?ëˆg$,Ñ ?ëˆg& ?ëˆæ;Ž\?ëˆè+Ôû?ë‡Ð¦T@Î?ë‡Ð¨D‚!?뇅dJ#Â?뇅f:_É?ë‡: v˜?ë‡:" ­Q?ë†îÙò¬x?ë†îÛâÝå?놣‘ϺÂ?놣“¿æâ?ë†XG³E?ë†XI£kè?ë† ûœÌº?ë† ýŒî@?ë…Á­Œõ^?ë…Á¯}–?ë…v]„(•?ë…v_t?€?ë…+ ‚[Þ?ë…+ rm{?ë„ß·ˆ¦î?ë„ß¹x³=?ë„”a•Ý'?ë„”c…ä(?ë„I «L?ë„I ›ÿ?ëƒý¯ÈGð?ëƒý±¸DT?냲Sî¿?냲UÞ Õ?ëƒfö;c?ëƒfø -+?냖S\‡?냘CI?ë‚Ð4“nà?ë‚Ð6ƒV ?ë‚„ÐÝ?ë‚„ÒÌ÷õ?ë‚9k/Ô?ë‚9m°š?ë^?ëî|]›?뢙ò¯?뢛â€ô?ëW.cŸ?ëW0Sl?ë Àß´?ë ÂÎÛ?ë€ÀQdÅ?ë€ÀSTOÄ?ë€tßõ_"?ë€táåÑ?ë€)l‘·Ÿ?ë€)nnþ?ëÝ÷8¥¯?ëÝù(W½?ë’ë´”?ë’ÛaR?ëGª t?ëGšGâ?ë~û‹u™G?ë~ûe;d?ë~°L[W?ë~°;ø$?ë~d07ä?ë~d‘Ï`?ë~ óO€?ë~âá«?ë}ÍŠ”U…?ë}ÍŒƒâ^?ë}‚<ÚÌ?ë}‚,bT?ë}6}í>?ë}6Üu?ë|êô¥Ì'?ë|êö•I ?ë|Ÿig},?ë|ŸkVô¿?ë|SÜ1¢Ë?ë|SÞ! ?ë|M¥Â?ë|Nô±?ë{¼»àîÈ?ë{¼½ÐVe?ë{q(Æs ?ë{q*µÕX?ë{%“¶Ò?ë{%•¥kÊ?ëzÙü¯ ?ëzÙþža¼?ëzŽc±Í¤?ëzŽe¡÷?ëzBÈ¿ox?ëzBÊ®¼y?ëy÷+Ø?ëy÷-ÇfˆV?ëv„-ŠÀ?ëuÓÊñ?ëuÓËò?ëuˆÖ²?ëuˆÄûr?ëu÷?ëiø³^€¦?ëiøµL¨?ëi¬ª“¯™?ëi¬¬Ñž?ëi`ŸÕZA?ëi`¡Ãvì?ëi“$Z?ëi•qj?ëhÈ„€£œ?ëhȆnµ‘?ëh|séò?ëh|u×þ®?ëh0aaX7?ëh0cO_v?ëgäLæí?ëgäNÔ Ð?ëg˜6yXà?ëg˜8gUh?ëgLm?ëgL d@?ëgˤ–?ëg¹–f?ëf³çŠŸ®?ëf³éxŒ#?ëfgÉXÅh?ëfgËF¬€?ëf©6 †?ëf«#ìB?ëeχ"Ö?ëeω²~?ëeƒc Ž?ëeƒe Ø‘?ëe7=,cð?ëe7?5—?ëdëI‚?ëdë7N\?ëdžëw¬?ëdžídÞ™?ëdR¿µR¿?ëdRÁ£O?ëd’aY?ëd“ò‹?ëcºbdqˆ?ëcºdR(^?ëcn0Ö#?ëcn2ÃÕ?ëc!ýYld?ëc!ÿG~?ëbÕÇZ?ëUô+B¬?ëTÏaV?ëTÏcB¹?ëT‚Îáe?ëT‚Ðl…î?ëT69¼6ì?ëT6;¨Ö?ëSé£ ­ ?ëSé¤øG`?ëS mÈ0?ëS Z\‹?ëSPoâëü?ëSPqÏzó?ëSÓk~^?ëSÕXð?ëR·5ä²?ëR·6ôhÞ?ëRj”·Úr?ëRj–¤Y:?ëRò{ý£?ëRôhw?ëQÑNT{ ?ëQÑP@ï?ëQ„¨AFÜ?ëQ„ª-µs?ëQ8BÆ…?ëQ8//¶?ëPëVY˜?ëPëXEûÐ?ëPžª…â?ëPž¬qdH?ëPQüÆWà?ëPQþ²°ß?ëPMI·?ëPO O?ëO¸›‰ÏÄ?ëO¸vö?ëOkè ˆ?ëOkéøÐÛ?ëO2¥Ø?ëO4’w?ëNÒ{UC%?ëNÒ}A#?ëN…Áðš/?ëN…ÃÜÒÆ?ëN9v{?ëN9bR«?ëMìI ‚K?ëMìJù°?ëMŸ‰·_?ëMŸ‹£‡ã?ëMRÈsã?ëMRÊ`ú?ëMC0?ëM/Â?ëL¹@%Sö?ëL¹Bl ?ëLly`Ü?ëLl{sž?ëL°"ÃÍ?ëL²Ñ'?ëKÒå?§?ëKÒç+!™?ëK†oŽe?ëK†[î?ëK9I³lL?ëK9KŸil?ëJìy Á'?ëJìz÷¸ß?ëJŸ¦xñd?ëJŸ¨dã´?ëJRÑú ?ëJRÓåûó?ëJûÑ?ëJý|¸Œ?ëI¹#<ºK?ëI¹%(œ_?ëIlHý† ?ëIlJébË?ëIlÔz™?ëInÀQÛ?ëHÒŽÁ¼?ëHÒ¬ì”?ëH…®ÃË?ëH…°¯—‚?ëH8ÌÜð,?ëH8ÎÈ·0?ëGëé ¶8?ëGëêøwÒ?ëGŸRØÄ?ëGŸ>”ô?ëGR°-?ëGR›ãØ?ëG2$ß_?ëG4º?ëF¸F°ã£?ëF¸Hœ”?ëFkYT-Ý?ëFk[?Ôd?ëFjË“?ëFkûl¯?ëEÑxãx~?ëEÑzÏ/?ëE„…Ï(³?ëE„‡º¾ø?ëE7Óé¨?ëE7’¿z‚?ëDê™Æ®Ù?ëD꛲:H?ëD ¦d?ëD¢‘ê#?ëDP¥™Þù?ëDP§…_‘?ëD¨¡óu?ëDªn¡?ëC¶©¾”¤?ëC¶«ª e?ëCi¨ð&?ëCiªÛ–e?ëC¦6b¥?ëC¨!Í?ëBÏ¡‘®?ëBÏ£}}?ëB‚›k¶?ëB‚œíËÆ?ëB5’ˆÿ`?ëB5”tZ?ëAèˆ%”h?ëAèŠéŸ?ëA›{ØV4?ëA›}Ã¥þ?ëANm Ç¿?ëANoŒ?ëA]€e}?ëA_kªl?ë@´Kv²l?ë@´Mañî?ë@g7ƒÚ?ë@g9o#?ë@!¨x5?ë@#“¬Ü?ë?Í äH ?ë?Í ÏwY?ë?ð7åž?ë?ò#i?ë?2Ô£D(?ë?2ÖŽh†?ë>å·'7 ?ë>å¹V?ë>˜—ÃCR?ë>˜™®\Ô?ë>KvwÊú?ë>Kxbß?ë=þSDú?ë=d*Þ‡?ë=d âO?ë=ÞD"ö?ë=à/!O?ë<ɳvõÌ?ë<ɵaî¶?ë<|†ÃºÎ?ë<|ˆ®®I?ëïEî?ë5>Ù¶Ô?ë4ð·PÌ?ë4ð¹:ë@?ë4£XÌB@?ë4£Z¶¨B?ë4Uøb¸V?ë4UúMå?ë4–´”?ë4—ÿ°?ë3»1Ạ?ë3»3ÌI?ë3mËÉõ˜?ë3mÍ´EÎ?ë3 cÎoÎ?ë3 e¸º?ë2Òùî¬ü?ë2ÒûØòK?ë2…Ž+Gâ?ë2…‡¾?ë28 ƒü?ë28"n6„?ë1ê°ùdf?ë1ê²ã™Z?ë1?bi?ë1AL3é?ë1O˼o?ë1Oͦº{?ë1V/±?ë1X3I?ë0´ÞºÒ?ë0´à¤7õ?ë0ge^¹?ë0ggH*h?ë0ê±?ë0ìÅW?ë/Ìlð“¡?ë/ÌnÚ¢f?ë/~íà0?ë/~ïÊ#€?ë/1lèÇì?ë/1nÒËÇ?ë.ãê 6|?ë.ãëõ4â?ë.–eGÿ€?ë.–g1øp?ë.HÞžÝâ?ë.HàˆÑ]?ë-ûV3›?ë-ûWú!¡?ë-­Ëœb ?ë-­Í†K1?ë-`?BîX?ë-`A,Ñs?ë-±¨?ë-²î…µ?ë,Å áñÅ?ë,Å"ËÉó?ë,wŽÚ†”?ë,wÄYL?ë,)úï#?ë,)üØÍd?ë+ÜeˆÛ?ë+Üg P¦?ë+ŽÍl‚¾?ë+ŽÏVE?ë+A3Õ© ?ë+A5¿eê?ë*ó˜[•m?ë*óšELÓ?ë*¥úþ4?ë*¥üçµ$?ë*X[½Œ?ë*X]§8?ë* ºšÉ‹?ë* ¼„pŒ?ë)½•?”?ë)½~á?ë)or­¿V?ë)ot—[h?ë)!ËäsY?ë)!ÍÎ ô?ë(Ô#8ߘ?ë(Ô%"pº?ë(†x¬ Ë?ë(†z•˜u?ë(8Ì=î?ë(8Î't2?ë'ëÅxü?ë'ë®ù¶?ë'mA*ÿ?ë'o*¦A?ë'Oº×ñ?ë'O¼Àˆº?ë'‡‘Þ?ë'q.?ë&´PR™ï?ë&´R<Ç?ë&f˜8ñ?ë&fš")?ë&Þ:N?ë&à#a3?ë%Ë"W"Å?ë%Ë$@}2?ë%}d«j?ë%}fy^?ë%/¤ãü[?ë%/¦ÍKÔ?ë$áãT®"?ë$áå=ø"?ë$”á³ ?ë$”!Ê÷“?ë$FZŠÅü?ë$F\t ?ë#ø“P¶ò?ë#ø•9ð„?ë#ªÊ3¯®?ë#ªÌãÆ?ë#\ÿ3¢–?ë#]Ñ4?ë#2Q_–?ë#4:ˆº?ë"ÁcŒ¡¶?ë"ÁeuÅ_?ë"s’å$?ë"s”ÎBI?ë"%À[î ?ë"%ÂE¿?ë!×ëñ˜?ë!×íÚ«K?ë!Š¤ÿú?ë!ŠŽ ¸?ë!<=wd\?ë!ož?ë]»' ?ëÀËv±?ë´!±?ëÁÆvŒ9?ëÁÈ_1»?ësÊ?jï?ësÌ( ó?ë%Ì&s(?ë%Î ®?ë×Ì+Î?ë×Îc?ë‰ÊOÛä?ë‰Ì8ko?ë;Æ’ý ?ë;È{‡?ëíÀôìb?ëíÂÝpï?럹vxˆ?럻^÷—?ëQ°î.?ëQ±ÿg¿?ë¤×S?릿Ç+?ëµ—·bN?ëµ™ŸÐà?ëgˆ·³P?ëgŠ d?ëwØ8E?ëyÀ›Ú?ëËe¿È?ëËgÞ?ë}P{_´?ë}Rc¸J?ë/9þTÔ?ë/;æ§ê?ëá!¢Èr?ëá#‹?ë“h®?ë“ POÅ?ëDëOO8?ëDí7‘Ï?ëöÍXÈn?ëöÏA…?먭ƒ÷”?먯l/*?ëZ‹Ñt0?ëZ¹¦F?ë hAžº?ë j)ËP?ë¾BÓûš?ë¾D¼"¯?ëpau?ëpI–²?ë!ñèS?ë!óÐo.?ëÓÆŒý?ëÓÈu¥?ë…™Påq?ë…›8ö‚?ë7j3Æ®?ë7lÒ>?ëé95ÉI?ëé;ÏW?ë›WÇ?ë›?T?ëLј ¢?ëLÓ€­?ëþšøe‚?ëþœà[ ?ë°bx¹Ü?ë°d`©ã?ëb(Ÿ ?ëb*‰¥?ëëÚÐ?ëíµ?ëÅ­½ã?ëů¤ùc?ëwm¿É°?ëwo§£®?ë)+ãã³?ë)-˸.?ëÚè)"À?ëÚêñ¹?댢J?댤wæ¿?ë>[Ž8?ë>]R+?ëðà ?ëðªÊo?ë¡Æö0?ë¡Èw¯?ëSyÈ?ëS{f»1?ë*iŽ?ë,xs?ë ¶ÙÅ ?ë ¶Û¬È?ë h‡®:?ë h‰Q?ë 2—«Î?ë 4I(?ë ËÜ6 X?ë ËÞ¢.?ë }ƒ÷»Ú?ë }…ßN,?ë /)ÝÄg?ë /+ÅQ4?ë àÍçß3?ë àÏÏf{?ë ’pkè?ë ’qýí¬?ë Di\?ë DPØÝ?ë õ®á~†?ë õ°Èõ@?ë §KV=?ë §M=®K?ë XåƼa?ë Xç®(?ë ~X!?ë €?xL?ë ¼ Â?ë ¼ñ"¦?ë m©ÜÎà?ë m«Ä*?ë <Ñ)õ?ë >¸?ëÐÍæû,?ëÐÏÎKA?ë‚]3Í?ë‚_~[?ë3êwŸò?ë3ì^äû?ëåuòÃ}?ëåwÚÿ?ë–ÿjŒ?ë—w¤ˆ?ëH‡Q*z?ëH‰8^ï?ëú 3ãE?ëú3?ë«‘:;©?ë«“!e?ë]c?ë]J¤ð?ë“°:?ë•—0”?ëÀ Mê?ëÀf½?ëqŽ´É|?ëq›ÜÈ?ë# l›î?ë# S©²?ëÔ‚H‘P?ëÔ„/™?ë…ùI¬:?ë…û0®ï?ë7nnÍ2?ë7pUÊ`?ëèá¹d?ëèã [¬?ëšS)+³?ëšUÑ?ëK½¨¶?ëKĤ•K?ëý0x3?ëý2^û@?뮜X)C?뮞? Ç?ë`^+?ë`Dì'?ënŠ^Q?ëpq4Ä?ëÂÔÝr†?ëÂÖÄCp?ët9V-â?ët;<ùD?ë%›öm?ë%Ý2Ù?ëÖü–w§?ëÖþ}7÷?ëˆ[4+?ëˆ]åÜ?ë9·ôÜŒ?ë9¹Û‘É?êÿëØFe?êÿë¾ö?êÿœkÞÆ‚?êÿœmÅp«?êÿMúÁ?êÿMÄï_a?êþÿV€ü?êþÿ= ?êþ°kÇÓ¯?êþ°m®m:?êþa½]G6?êþa¿CÛ6?êþ ̉?êþý[?êýÄZôø?êýÄ\Û€ñ?êýu¦÷º®?êýu¨Þ>?êý&ñ™?êý&óƒo?êüØ9k6µ?êüØ;Q¯?êü‰ÜuŽ?êü‰ÂèN?êü:Äsù¸?êü:ÆZfî?êûì0¤F?êûì  ð?êûH@?êûIù¢#?êûN‡aH?êûN‰½Û?êúÿÄKŒ€?êúÿÆ1ã‡?êú°ÿ¡V ?êú±‡§…?êúb9R7?êúb;ž&?êúpÁ˜ä?êúr§ßG?êùĦŒ+%?êùĨrkü?êùuÚ~fú?êùuÜd¢E?êù' ˜a?êù'~=?êøØ<Ùjd?êøØ>¿š•?êø‰kBî ?êø‰m)®?êø:—Ôƒ½?êø:™º¨Õ?ê÷ëÂŽ¿Ù?ê÷ëÄtßd?ê÷œëqÊ?ê÷œíWä?ê÷N}]«?ê÷Ncr?êöÿ7‹¬M?êöÿ9q»0?êö°Zš”ò?êö°\€žG?êöa{Íù–?êöa}³ý^?êö›&?êö ÿG?êõø£«6?êõú‰£â?êõtÔF²Z?êõtÖ,¥w?êõ%îsš?êõ%ïõa*?êô×þL?êô×ä4 ?êôˆ¿Ú?êôˆø¢M?êô90MÎØ?êô923«½?êóêB¯i°?êóêD•A?êó›S7Jê?êó›U±?êóLaæ¨s?êóLcÌt«?êòýn½¤?êòýp¢ÍL?êò®yºVN?êò®{ g?êò_‚ßÍH?êò_„ňÒ?êòŠ,ð?êòŒ¦?êñÁ¢È?êñÁ‘‡Ì3?êñr“? 5?êñr•$¶?êñ#•‡Ð?êñ#–ê-?êðÔ”ò‚†?êðÔ–Ø"A?êð…“ Ž¦?êð…”ï(Ð?êð6IÓ@?êð6‘/gÚ?êï牳AN?êï狘ÐY?êEÉØ?ê+SR?êïIylb?êïIzçðK?êîúméò?êîúoΘJ?êî«`ù„?êî«bßK?êî\R4€?êî\T¶?êî Aš?êî C¦?êí¾/* .?êí¾1qB?êíoå[?êíoÊeÝ?êí ¤ýN?êí ŠZ??êìÐìh Ý?êìÐîMe¥K)?êàØóýx?êàÚØp?êßÐsRŸ ?êßÐu7 ?êß Ür ?êß ÀÙt?êß1¢‘œ[?êß1¤uþ-?êÞâ7qØu?êÞâ9V4¯?êÞ’Ê~Žp?êÞ’Ìbå?êÞC[¶¢?êÞC]šó?êÝóëE•?êÝóìÿ‘?êݤx¬iT?êݤz¯/?êÝUiýŒ?êÝUN=Ï?êÝŽT(8?êÝ8bã?êܶkDü?êܶOz?êÜfœ¯¯{?êÜfž“Þõ?êÜ!!²?êÜ#·“?êÛÇ£Ápä?êÛÇ¥¥•,?êÛx$ŽÞ8?êÛx&rüç?êÛ(£Šfù?êÛ(¥n€?êÚÙ ´14?êÚÙ"˜D°?êÚ‰œ ˜“?êÚ‰ð¦v?êÚ:“Wþ?êÚ:w`H?êÙêIÂ?êÙê-r?êÙ›-î‰?êÙ›ë ?êÙKw»è?êÙKy³d?êØûéMy?êØûê÷?[?êجY5T?êج[îœ?êØ\Çÿ«?êØ\ÉeæY?êØ 3û P?êØ 5Þìd?ê×½žŸtS?ê×½ ƒOÌ?ê×noË?ê×n S ã?ê×nlj*?ê×pP:m?êÖÎÓ•w?êÖÎÕyA©?êÖ6ëÒ?êÖ8ÎÛà?êÖ/˜mÙá?êÖ/šQ™S?êÕßøz|?êÕßú4T?êÕUúSq?êÕWÞ¬?êÕ@²¿?êÕ@³èn-?êÔñ <®°?êÔñ W´?êÔ¡d¢F4?êÔ¡f…é?êÔQ»6b?êÔQ½´.?êÔøD?êÔÛÜÎ?êÓ²bèÀÕ?êÓ²dÌSj?êÓb´P¼?êÓbµëÝ´?êÓVyv?êÓ:Ò?êÒÃPÓËL?êÒÃR·M ?êÒsœ€k®?êÒsžcçÐ?êÒ#æ\€?êÒ#è?ö›?êÑÔ.h-þ?êÑÔ0Kžæ?êÑ„t¤; ?êÑ„v‡¦U?êÑ4¹aò?êÑ4ºóÇ ?êÐäû¬’Ý?êÐäýòí?êЕ\¸…?êÐE{v~j?êÐE}YÓ@?êÏõ¸¥$6?êÏõºˆsm?êÏ¥ô?¤?êÏ¥õè‰>?êÏV-pÿn?êÏV/TCj?êÏdçŠ1?êÏfÊÈ?êζš‹©G?êζœnâ?êÎfÎ]´?êÎfÐ@IÕ?êÎ[ÁÛ?êÎ>ï^?êÍÇ0ˆÙò?êÍÇ2lÖ?êÍw^ããÃ?êÍw`Ç?êÍ'‹mn˜?êÍ'P‹??êÌ׶%iá?êÌ׸€è?êÌ‡ß ú^?ê̇àï Æ?êÌ8!z?êÌ8…Ü?êËè+f Ê?êËè-Iô?ê˘NÚDÄ?ê˘P½EN?êËHp~‰?êËHra s?êÊøQ%r?êÊø’4¼?êʨ®TÑ?êʨ°7|?êÊXʇwê?êÊXÌjaõ?êÊäë2Z?êÊæÎÄ?êɸý¢0?êɸÿb€ú?êÉiDìJ?êÉi'Ås?êÉ);5ˆ?êÉ+ ?êÈÉE;Š?êÈyM»#â?êÈyOì*?êÈ)]E}0?êÈ)_(?×?êÇÙkiX?êÇÙlä&]?êljvï¬Ä?êljxÒd(?êÇ9?êÇ9‚ò³Ü?êÆé‰bÃ}?êÆé‹EoŸ?êÆ™è€+?êÆ™‘Ë&«?êÆI”¡(?êÆI–ƒÈÞ?êÅù—ŒuÃ?êÅù™oÿ?êÅ©˜«bö?êÅ©šø?êÅY—Ù':?êÅY™»·2?êÅ •A?êÅ –õËV?êĹ}#´?êĹ’_¨h?êÄiŠ¾Y?êÄi‹ù=j?êÄà?êăÂyp?êÃÉwÙvÿ?êÃÉy»êÊ?êÃyle?êÃymå€?êÃ)^]+q?êÃ)`?“÷?êÂÙNçæ]?êÂÙPÊI??ê‰=£Ñj?ê‰?†.©?êÂ9*q´?êÂ9,rÉO?êÁé®UŒ?êÁ駄?êÁ˜þýÖ5?êÁ™à"‰?êÁHæ~­ì?êÁHè`ô?êÀøÌ1 ?êÀøÎá?êÀ¨°f¹?êÀ¨±ø¢!?êÀX’-Å\?êÀX”û!?êÀrwv@?êÀtY¦`?꿸PóÒ¶?꿸RÕý2?ê¿h-¢ÿ?ê¿h/…#ë?ê¿…´?ê¿ g>ç?ê¾Çáš÷Ô?ê¾Çã}b?ê¾w¸äAé?ê¾wºÆUÒ?ê¾'Ž`¸z?ê¾'Bƾ?ê½×b½ˆ?ê½×cóÆ'?꽇3öÖ²?꽇5ØÙ«?ê½7¾’?ê½7ñ»æ?ê¼æÒ]×?ê¼æÔ?ÎÂ?ê¼–žà;?ê¼– ÁùD?ê¼Fi—G?ê¼Fky3?ê»ö2ƒð?ê»ö4eÖÙ?껥ù¥¼è?껥û‡ž?ê»U¾Ù ¢?ê»UÀºü?껂í?껃ýÛ¸?꺵CCD?꺵Erh?êºe61 ?êºeûž?êºÁ\Ñ?êºÂð!¨?ê¹Ä}Kr?ê¹Ä~ú ¢?ê¹t7Tô?ê¹t96­Œ?ê¹#ïÄ~?ê¹#ñ¥Ä`?ê¸Ó¦eùd?ê¸Ó¨G§Ÿ?긃[:Òd?긃]z÷?ê¸3B¿1?ê¸3$b?ê·â¿~M?ê·âÁ_ê]?ê·’ní6:?ê·’pÎÍ×?ê·Bè?ê·Bq™Ý?ê¶ñÈf±?ê¶ñÊH=f?궡rqŠ]?궡tS?ê¶Q°ì2?ê¶Q’m/?ê¶Á$Å¢?ê¶Ã@÷?êµ°eÍ£ú?êµ°g¯¦?êµ`««?êµ` ?굩¾+§?굫Ÿ–?ê´¿I†?ê´¿JçêÐ?ê´næ„©~?ê´nèf†?ê´‚8„ð?ê´„ÞO?ê³Î"q?ê³Îļ?ê³}´B‘£?ê³}¶#ß°?ê³-J˜Õÿ?ê³-Lzb?ê²Üß&?ê²ÜáBÏ?게qê3Ë?게sËpÛ?ê²<ä÷?ê²<Æ.t?ê±ë’u%?ê±ë“ø¦á?ê±›V?ê±›!bÉh?ê±JªþØ?ê±J¬ßþç?ê°ú4Žƒõ?ê°ú6o¤²?ê°©¼Q¯?ê°©¾2Ê)?ê°YBH}?ê°YD)’h?ê°Æs®©?ê°ÈT¾f?꯸HÓ2Œ?꯸J´<ž?ê¯gÉg+Æ?ê¯gËH0.?ê¯H/½€?ê¯J¼Ý¿?ꩽ¡Å«È?ꩽ£¦J?ê©me ?ê©mF9-?ê©]>;v?ê©_Îg?ê¨Ë¸O6ù?ê¨Ëº/Ä;?ê¨{™i?ê¨{y¦ÿ?ê¨*i?ê¨*jýõ?ê§Ù¾Ùr?ê§ÙÀ¹’«?꧉Ï7u?꧉¯®?ê§8dÛº?ê§8f¼*ä?ê¦ç´üXµ?ê¦ç¶ÜÃã?ꦗSÍ?ꦗ3fL?ê¦FOßÔÜ?ê¦FQÀ4­?ê¥õš¢Ã?ê¥õœƒ6?ꥤã›î?ꥤå|B„?ê¥T*ÌŽ?ê¥T,¬dR?ê¥p2¿?ê¥r%?ꤲ³Ðuó?ꤲµ°¹X?ê¤aõ¥‘8?ê¤a÷…Îï?ê¤5±ÿ.?ê¤7’75?ê£ÀsöK/?ê£ÀuÖ}†?ê£o°rcŠ?ê£o²R1?ê£ë&jø?ê£í‘ï?ê¢Î$OÞ?ê¢Î%òq%?ê¢}[7:‡?ê¢}]V?ê¢,”|p?ê¢,’t’W?ê¡ÛÄ*Õ:?ê¡ÛÆ åp?ê¡Šõùÿ?ê¡Š÷Ú –?ê¡:&…L?ê¡:'âŠ!?ê éTD¾ø?ê éV$¾?ê ˜€À2 ?ê ˜‚ +€?ê G«už(?ê G­U‘ê?êŸöÔe&?êŸöÖE)?꟥ûŽì°?꟥ýnÕ?êŸU òàŠ?êŸU"ÒÃ8?êŸD‘Œþ?êŸFqiú?êž³fk}Y?êž³hKT£?êžb†€’?êžbˆ_Õ+?ꞤÏß=?Ꞧ¯«$?êÀÁ[gp?êÀÃ;-¥?êoÜ"ŠÜ?êoÞK_?êõ„`?êöâ?0?êœÎ ùyT?êœÎ Ù.r?êœ}!())?êœ}#Ø•?êœ,4Rt?êœ,6nü,?ê›ÛF.zÈ?ê›ÛHÎ?ꛊVÉ?ꛊWægV?ê›9dŽ¡?ê›9e÷'A?êšèpaV?êšèr@èô?êš—zãÙ?êš—|ÃfN?êšFƒ r²?êšF…ú8?ê™õŠ–¨œ?ê™õŒv*n?ꙤÆ4¼?Ꙥ‘¥°Û?ê™S“/Õœ?ê™S•L?ê™”Ó­f?ê™–³?꘱”²a?꘱–‘}d?ê˜`’ÊŠ~?ê˜`”©ïÌ?ê˜<^?ê˜ý›ø?ê—¾‰¬®?ê—¾‹Œæ?ê—m‚vÒ?ê—m„Uò?ê—y{ú?ê—{[H~?ê–Ën¼°Â?ê–Ëp›ù‰?ê–zb9h?ê–zd[{?ê–)Sñ‡K?ê–)UÐÄ©?ê•ØCæ´?ê•ØEÅW]?ꕇ2ó?ꕇ3ö5æ?ê•6„¾d?ê•6 cê¢?ê”å .¡K?ê”å ÇÓ?ꔓò?ꔓóõ'é?ê”BÙ:v?ê”BÛ‘2?ê“ñ¾›Ü®?ê“ñÀzò?ê“ ¢;-5?ê“ ¤<å?ê“O„V?ê“O…÷` ?ê’þdŽG?ê’þeï’‹?ê’­B"™$?ê’­D—±?ê’\nÚ|?ê’\ MÓS?ê’ øõ õ?ê’ úÓÿ?ꑹѵêü?ꑹӔØe?ê‘h¨±™?ê‘hª€Ð?ê‘}è?ê‘Ææ?êÆQY9?êÆS8]}?êu#š&?êu$åp³?ê#òîÔ²?ê#ôÍ¥‡?êÒÁ"!?êÒÂñí??êsp'?êR5?ê0X¬Š?ê0Yîl8?êŽß è`¸?êŽß"Ç®?êŽçýz~?êŽéÜ.¼?êŽ<­OŽ?êŽ<¯-Ê?êëpÝÍX?êër¼v%?êš2©±Ž?êš4ˆT£?êHò²‚8?êHô‘”?êŒ÷°ù0v?êŒ÷²×È?ꌦm}B€?ꌦo[Ôk?êŒU(?AÄ?êŒU*Íö?êŒá?ƒØ?êŒã Q?ꋲ˜}ö³?ꋲš\ws?ê‹aMúˆV?ê‹aOÙ\?ꋶ]?ê‹”ÒÜ?ꊾ³±0?ꊾµ #?êŠmcêï`?êŠmeÉY9?êŠd#j?êŠB‡‰?ê‰Ê¿º¿?ê‰ÊÀû$?ê‰yj£z?ê‰ykòü&?ê‰(LΉ?ê‰(+!z?êˆÖº¢ÖÀ?êˆÖ¼#÷?ꈅ`~?ꈅaòÅŽ?êˆ4ÂÐ"?êˆ4¡å?ê‡â¥­†~?ê‡â§‹Â†?ꇑEÔŽ€?ꇑG²ÄÍ?ê‡?ä8Ø?ê‡?æ°?ê†î€ÙéB?ê†î‚¸?ꆸ~&?ꆖ£A?ê†K´ÔÉ?ê†K¶²<)?ê…úL-è¿?ê…úN d?ê…¨áÅh?ê…¨ã£{ÿ?ê…Wušï›?ê…WwxýÈ?ê…®Ô%?ê… ŒÜ—?ê„´˜Ï„?ê„´™ÞÒ9?ê„c&‘ÑŠ?ê„c(o΃?ꄳa”?ꄵ?‹O?êƒÀ>pkô?êƒÀ@N]u?êƒnǾ®?êƒnÉœ™Å?êƒOL0?êƒQ)ú8?ê‚ËÕ&ü?ê‚ËÖ÷H?ê‚zY&;>?ê‚z[Í?ê‚(Ûsr3?ê‚(ÝQG?ê×\RN?ê×]Þ!c?ê…ÚÍËB?ê…Ü«”™?ê4WÛþP?ê4Y¹Áê?ê€âÓ+ Â?ê€âÕÊŸ?ꀑL»Kw?ꀑN™—?ê€?ÄŒ¨,?ê€?ÆjZŽ?êî:ŸD8?êî<|ðÜ?Ꜯót‚?ꜰÑh?êK!‰î?êK#g/?ê~ù’aå`?ê~ù”?€Ê?ê~¨Zy?ê~¨7§$?ê~Vnq?m?ê~VpNÏ[?ê~Ùƃt?ê~Û¤ £?ê}³CZe*?ê}³E7éš?ê}a«-8š?ê}a­ ·K?ê}?S?ê}—E?ê|¾u6ë?ê|¾wmª?ê|lØ! ë?ê|lÙþw_?ê|8ñPô?ê|:θ©?ê{ɘ,¦?ê{əގ›?ê{wõQ‹€?ê{w÷.ç¶?ê{&PáY[?ê{&R¾¯Ñ?êzÔª²?êzÔ¬oÇ?êzƒÃ/z?êzƒ zp?êz1YE”?êz1ZòŠÊ?êyß­¨N˜?êy߯…Ž?êyŽ|ž¢?êyŽYØX?êy?êq‘àë«?êq@\°?êq@9T”?êpî'ìýá?êpî)Éœ!?êpœI¿Ö?êpœKœn?êpJiÔòá?êpJk±…™?êoøˆ-t?êoøŠ …?êo¦¤Èá¦?êo¦¦¥hÖ?êoT¿§ZT?êoTÁƒÛÀ?êoØÉþÎ?êoÚ¦zv?ên°ð/ïJ?ên°ò e.?ên_ÚÂ?ên_¶ˆá?ên È›h?ên ¥Â?êm»+úÊÌ?êm»-×/a?êmiMò³?êmK-è?êmM oô?êlÅX-t$?êlÅZ Çk?êlscs2'?êlseO¨?êl!lþ ò?êl!nÚR­?êkÏtÎQø?êkÏvª“î?êk}zä'ˆ?êk}|Àc¸?êk+@ET?êk+{¾?êjÙâ2R?êjÙƒ¾bö?êj‡‚ÊAþ?êj‡„¦lÜ?êj5ØÑ?êj5ƒ´&ê?êiã ;Š?êiã€åZÜ?êi‘z|¸?êi‘|XÒ?êi?t3d¿?êi?vx„?êhíl-’¾?êhín  ½?êh›bj•Ô?êh›dFž ?êhIVëó?êhIXÇõr?êg÷I°dy?êg÷KŒa#?êg¥:¹ ?êg¥<”ÿú?êgS*3}?êgS+â$˜?êg—"?êgrïv?êf¯l™Ê?êf¯HV?êf\í‡?êf\ïbóá?êf Õæ,µ?êf ײ?êe¸¼ŠiH?êe¸¾f=}?êef¡tO{?êef£Pè?êe„£3?êe†~û«?êdÂf™ž?êdÂgó\z?êdpEÒÔÐ?êdpG®‘ä?êd#ÓŸ|?êd%¯VÈ?êcÌg?êcÌõÊê?êcyÚ§Ç ?êcy܃rÄ?êc'³{üH?êc'µW¢9?êbÕŠ–Øè?êbÕŒry?êbƒ_ùƒ?êbƒaÔ¯â?êb13¢9?êb15}Í¥?êaß’–H?êaßn%?êaŒÕˬ?êaŒ×¦¡°?êa:¤K\?êa:¦&—–?ê`èqAç?ê`èrî¿W?ê`–<#Ž;?ê`–=ÿá?ê`D|L?ê`DW½î?ê_ñÌüœì?ê_ñÎØþ?ê_Ÿ’£K˜?ê_Ÿ”~±à?ê_MVŽ–Ã?ê_MXi÷@?ê^û¾ÐZ?ê^ûš+ ?ê^¨Ù5¾?ê^¨Ûj¦?ê^V—ðºŠ?ê^V™Ì ¨?ê^TñÝÛ?ê^VÍ'.?ê]²8Ѩ?ê]²0?ê]_ÉÆ´?ê]_Ë¡Xq?ê] ™rw?ê] ƒtªi?ê\»7³…?ê\»9ŽÂ¬?ê\hì.d?ê\híïZ¿?ê\ž»k;?ê\ –‘Ê?ê[ÄOªd2?ê[ÄQ…„ö?ê[qþà:w?ê[r»Uo?ê[¬]¥˜?ê[®8ºÅ?êZÍX"÷Š?êZÍYþê?êZ{0µ?êZ{ &I?êZ(ª„ÎÎ?êZ(¬_Ò–?êYÖQ"*Ú?êYÖRý(Õ?êYƒö·Ð?êYƒ÷â¯ÿ?êY1™5”ò?êY1›‡U?êXß:¬¬{?êXß<‡™?êXŒÚlR¸?êXŒÜG9?êX:xu?%?êX:zP ?êWèÈ)*?êWè£Y?êW•¯cÍ?êW•±>¢y?êWCHIz|?êWCJ$J?êVðßyP¦?êVðáTl?êVžtónä?êVžvÎ2Ý?êVL·)Ò?êVL ‘çý?êUùšÆŽ?êUùœ »ë?êU§*þå!?êU§,Ù—°?êUT¹`ha?êUT»;"?êUF ?œ?êUGãæ?êT¯Ðù$?êT¯ÒÓÅ9?êT]Z0ÌR?êT]\ g¨?êT á°Vä?êT ãŠìl?êS¸gw}#?êS¸iR Û?êSeë†Q?êSeía;?êSmÞFä?êSo¸Êÿ?êRÀî~'§?êRÀðX¥ó?êRnmfƒà?êRno@ü]?êRê˜ý?êRìr„«?êQÉf¾?êQÉgí*í?êQvßÖA’?êQvá°¨ ?êQ$Wã…Œ?êQ$Y½æË?êPÑÎ:v?êPÑÐу?êPBÚÿM?êPDµTí?êP,µÅ¥?êP,·Ÿôß?êOÚ&úS„?êOÚ(Ôƒ?êO‡–y[ô?êO‡˜S #?êO5C¥?êO5N?êNâpWZ?êNâr1Åè?êNÚ¶óÐ?êNÜ‘&?êN=CaÆÛ?êN=E;óÈ?êMêªWÀ2?êMê¬1çM?êM˜˜þ¨?êM˜só?êMEs&8Œ?êMEuT?êLòÔÿZ,?êLòÖÙoÕ?êL 5$OÜ?êL 6þ_³?êLM“•Ïè?êLM•oÙí?êKúðSù ?êKúò-ýS?êK¨K^Rø?êK¨M8QZ?êKU¤•¹Ø?êKU¦o²h?êKûød‰?êKýÒWG?êJ°Q¤¶?êJ°S~¢?êJ]¥™…Ç?êJ]§slá?êJ ÷ØÏÐ?êJ ù²±?êI¸HaI:?êI¸J;$¯?êIe—4q?êIe™F»?êIäQÎG?êIæ+ž?êHÀ/¹?êHÀ1’ä?êHmylí?êHm{EÊ?êHÁhêP?êHÃB¨§?êGÈ°án?êGÈ Š™ò?êGuLDn2?êGuN ã?êG"#J?êG"üöß?êFÏÐM“?êFÏÒ': ?êF}ÃÌZ?êF}m?êF*M…á¬?êF*O_}?êE׉”Uó?êE׋më‚?êE„Ãï?êE„ÅȤÌ?êE1ü–=F?êE1þoÇ,?êDß3‰ìØ?êDß5cpê?êDŒhË Q?êDŒj¤‰Ž?êD9œXí­?êD9ž2f?êCæÎ4Ú?êCæÐ ‰n?êC“þ\×p?êC”6D0?êCA,ÓM¸?êCA.¬´¢?êBîY—)?êBî[pb>?êB›„©Ô¢?êB›†ƒ/â?êBH® !ñ?êBH¯ãw]?êAõÕ¹Ð?êAõ×’Rf?êA¢û¶ÇÚ?êA¢ý›?êAP ]#?êAP!Ü¡?ê@ýB~Îz?ê@ýDX ?ê@ªc(PB?ê@ªeˆ?ê@W‚PW?ê@Wƒö‚À?ê@Ÿ]ìQ?ê@¡7å?ê?±ºê¦@?ê?±¼ÃÌý?ê?^ÔÃ?ê?^Öœ&?ê? ìçŠý?ê? îÀ¦?ê>¹YR?ê>¹23Œ?ê>fñ?ê>fð#T?ê>+!‰Š?ê>,ú“?ê=ÀRi>?ê=mL/ ?ê=mM÷,ê?ê=Zh$?ê=[é`+?ê<ÇfP’Ñ?ê<Çh)…?ê%^^g?ê+>'6}?ê*êÔX`?ê&KQ‚?ê&Lð©­?ê%´ß0jˆ?ê%´á¼Ô?ê%aq›Wê?ê%asr¤U?ê%Y¡\?ê%0çè?ê$º‘k•n?ê$º“BÖ?ê$gÑåÿ?ê$g © Ê?ê$ªŒÞ?ê$¬cOÉ?ê#À4š‚ž?ê#À6q±©?ê#l¼ýÏ?ê#l¾Ôø=?ê#Cµ¹Î?ê#EŒÝ?ê"ÅÈÂ.?ê"ÅÊ™Kw?ê"rL$@÷?ê"rMûX?ê"ÍÛ;?ê"ϲ(â?ê!ËMÈüª?ê!ËO p?ê!wËìcI?ê!wÍÃi-?ê!$Ha‰–?ê!$J8‰˜?ê ÐÃ(½f?ê ÐÄÿ·‡?ê }Õ?ê )³¯|´?ê )µ†k?êÖ)nz=?êÖ+Eb¹?ê‚¡?ê‚ŸX;?ê/æ‘.?ê/½mæ?êÛ€ŸNN?êÛ‚v%$?ê‡ï¬9|?ê‡ñƒ p?ê4] Ež?ê4^ã¯?êàÈÀ#£?êàÊ–èÑ?ê2È„x?ê4ŸCÄ?ê9›%!H?ê9œûÚ±?êæÖGç?êæ¬ûm?ê’fÜž?ê’h²ÂA?ê>Ê6£¾?ê>Ì K}?êë+æ™?êë-¼³u?ê—‹êÝŠ?ê—Áyƒ?êCêEU`?êCìëu?êðFõô?êðHË‘&?꜡ú‘"?ꜣÑp?êHûVS·?êHý,Ø"?êõSШ?êõTÞO/?ê¡©M%?ꡪæÅÈ?êMýnîNP?êÿ@$«@?ê«Š`8(?ê«Œ6o?êWÔ«ª3?êWÖù•?ê.TÔ?êžR?ê°d§?ê°eÜU??ê\©2I?ê\«Bû?êì²K{?êH?êµ.‡öò?êµ0^(Ú?êan²]Ô?êapˆ‰Ö?ê ­1þ¬?ê ¯$É?ê¹êWù?ê¹ëÝx/?êf%1ñ\?êf' ­?ê^²?ê`ˆ,n?ê¾–ˆÞ|?꾘^í?êj̵› ?êj΋£¾?ê88i?ê;!?êÃ4—…?êÃ5ç”V?êoeAô?êogß?ê”DZ-?ê–¢0?êÇÂ¥ËQ?êÇÄ{¶n?êsîÚåB?êsð°Êx?ê gâ?ê <ú1?êÌBKò?êÌD õY?êxi‡5›?êxk] ?ê$L?ê$ðZå?êгÉ+?êдÜÛ?ê|ÕJ¬/?ê|× mø?ê(õç[?ê(÷¼Ó¾›?ê >s!Ø?ê ê€Éè?ê êV'¸?êQÁMŠ:?êQÃ"”¸?êý®jü§?êý°@:?ê©™âܺ?ê©›·Ûb?êUƒµvú?êU…Šo¶?êkãH÷?êm¸;Ç?ê­Rln&?ê­TA[ ?êY7Qù?êY9%èñ?ê‘ð?êfü?ê°ü,ã†?ê°þ¾¥?ê\ܯ?ê\ÝÛ„O?êºðË?ê»òÀ?ê´–¾®?ê´˜bˆ?ê`qV–?ê`s*Æ?ê JwýK?ê LLºÌ?ê¸!ó6˜?ê¸#Çî,?êc÷ÇgV?êcùœü?êËõŸD?êÍÊJý?éÿ»ž}È1?éÿ» Rmý?éÿgo_j?éÿgq4 î?éÿ>›c˜?éÿ@oýˆ?éþ¿ 1m¶?éþ¿¹?éþjØ!ÔE?éþjÙöbZ?éþ¢mDô?éþ¤AÍ?éýÂk©®?éýÂlè+ç?éýn2ìf?éýn3éh±?éý÷qºÈ?éýùF1%?éüÅ»)Íä?éüżþ>R?éüq}=qŠ?éüqÜ ?éü=¬ñ’?éü?V#?éûÈüxhç?éûÈþLlj?éût¹ŸÁ•?éût»tH?éû u#©9?éû v÷ûý?éúÌ/ â?éúÌ0ØV¸?éúwç@þˆ?éúwéEo?éú#ÛÞ?éú#Ÿ¯DÕ?éùÏRÒ?éùÏT¦??éù{%é?éù{ú+?éù&·×ÂW?éù&¹«ñ€?éøÒgæ¶?éøÒiºßÅ?éø~S¤?éø~'Çf?éø)ÃÖÓ?éø)Äòô+?é÷Õn*Øø?é÷Õoþð`?é÷u“?é÷I¤÷?é÷,¿äˆ?é÷,Àïð?éöØeSì?éöØfñY„?éö„ yšv?éö„ Mš?éö/¬1Æn?éö/®À$?éõÛME/ ?éõÛO"Ñ?éõ†ì´P@?éõ†îˆ>?éõ2ŠÖ·?éõ2ŒS¾š?éôÞ&§J„?éôÞ({,v?éô‰Á+XV?éô‰Âÿ4V?éô5Z éÅ?éô5[ß¿Ô?éóàñIIÿ?éóàó?éóŒ†ãb§?é󌈷,Ó?éó8Û?éó8®ÕY?éòã­/|&?éòã¯:o?éò=á©?éò?´×ÿ?éò:Ìñ:f?éò:ÎÄìÊ?éñæZ^‘Æ?éñæ\2>8?éñ‘æ)q?éñ‘çý‡?éñ=pSÎ?éñ=r&·[?éðèøÚÚÌ?éðèú®ug?éð”Á8Ù?éð””Í?éð@Kv?éð@ÙÚ,?éï눩üw?éïëŠ}…9?éï— ¬— ?éï— €Ý?éïB‹Ç·?éïBŒâD”?éîî ÐxP?éîî £ï9?éñb?éÄÓ?éîEr1z?éîEEœ|?éíð|S1¶?éíð~&–Å?éí›ô“ëm?éí›ögJˆ?éíGk•’?éíGlëî¹?éìòßÞëm?éìòá²> ?éìžSTÙ?éìžTÕ¢?éìIăP?éìIÆVc›?éëõ4aŒL?éëõ64Í£?éë ¢,ê?éë ¤phL?éëL7 ?éëL @s?éê÷z.ßV?éê÷|Ï?éê¢ã„ôY?éê¢åXÝ?éêNK9”Š?éêNM ¸?ééù±Lx¸?ééù³–R?é饾ò?é饑3—?ééPxŽÈ¹?ééPzaÚi?éèûÙ¾˜ý?éèûÛ‘¤¸?éè§9M¦µ?éè§; ¬z?éèR—<<_?éèR™¹?éàa¯a?éà ²mœ?éà ´?lK?éß·åõ…b?éß·çÇê?éßcßÜ?éßc±rš?éßH)5q?éßIûŽ6?éÞ¹vÔdZ?éÞ¹x¦·&?éÞd£áÉ?éÞd¥³gœ?éÞÏOAæ?éÞÑ!ˆÀ?éݺù’Œ?éݺúðÓm?éÝf!Px”?éÝf#"³|?éÝGãëŠ?éÝI¶ x?éܼlÙe£?éܼn«”—?éÜg1‘^?éÜg’ºY?éܱì'¤?éܳ¾J¥?éÛ½Ò rV?éÛ½ÓÛ]?éÛhð‰»L?éÛhò[ÒY?éÛ m?éÛ?-0?éÚ¿(³~?éÚ¿*…‰3?éÚjB]»î?éÚjD/Á ?éÚZk^b?éÚ\=]†?éÙÀpܯ\?éÙÀr®¨…?éÙk…²Y:?éÙk‡„Lh?é٘봛?éÙš½¡Î?éØÁª‰kà?éØÁ¬[S?éØlºŒ)b?éØl¼^  ?éØÈÖí-?éØʨÈo?é×ÂÕhÊ¥?é×Â×:Ÿì?é×mà\X™?é×mâ.'å?é×é±O˜?é×ëƒé?éÖÃñhY@?éÖÃó:•?éÖn÷¾Á?éÖnùS|?éÖûýhà?éÖýÏ =?éÕÄþÛF?éÕŬÁ§?éÕp:?éÕpíÊŸ?éÕÿ¿¬?éÕ‘3?éÔÅýÅÕ?éÔÅÿ—tn?éÔpú/Îì?éÔpüh\?éÔôüÓÊ?éÔöÎg>?éÓÆî,ü®?éÓÆïþŠ%?éÓqåÁƒ?éÓqç“ ?éÓÛ¹À?éÓÝ‹>?éÒÇК?éÒÇÑç?éÒrÂÖS–?éÒrħÉ?éÒ³û;d?éҵ̪ê?éÑÈ£„ž>?éÑÈ¥VÆ?éÑs‘s%’?éÑs“D‰?éÑ}Æ*?éÑ—‡›?éÐÉh~% ?éÐÉjO|š?éÐtQ›¿î?éÐtSm€?éÐ9³¨?éÐ:ïÿê?éÌ!—'BŽ?éËÌgÉ?éËÌiš ¸?éËw8 L@?éËw:qCå?éË"Ü¡ü?éË" ­“¢?éÊÌÕ}—×?éÊÌ×Nƒ}?éÊw¡ƒÖ]?éÊw£T¼?éÊ"kï'?éÊ"m¿õÍ?éÉÍ4¿ŸË?éÉÍ6yq?éÉwûöK¹?éÉwýÇ`?éÉ"Á’Ç?éÉ"Ãbàm?éÈÍ…“Íh?éÈ͇d• ?éÈxGûÄ.?éÈxIÌ…Ó?éÈ#Ê?¤?éÈ# šûH?éÇÍÇþ˜®?éÇÍÉÏNQ?éÇx…šˆ?éÇx‡j·*?éÇ#Aœ ?éÇ#Cl¾«?éÆÍü Í?éÆÍýÕ­n?éÆx´Õ^H?éÆx¶¥ûç?éÆ#l ËW?éÆ#mÝbõ?éÅÎ!«i¬?éÅÎ#{ûH?éÅxÕ²qR?éÅxׂüí?éÅ#ˆ! z?éÅ#‰ñ‘?éÄÎ8÷€Ä?éÄÎ:È\?éÄxè5éä?éÄxêcz?éÄ#•Üï2?éÄ#—­bÆ?éÃÎAìI§?éÃÎC¼·9?éÃxìd¡?éÃxî5 ?éÃ#•EßÍ?éÃ#—A[?éÂÎDû½?éÂxáïÊ?éÂxãÀŸ?éÂ#…З?éÂ#‡ æˆ?éÁÎ(~¾?éÁÎ)çÈA?éÁxÈÅX¥?éÁxÊ•œ%?éÁ#gÙ}‡?éÁ#i©»?éÀÎT5V?éÀÎ$lÐ?éÀx¡6'š?éÀx£Y?éÀ#;~Ý?éÀ#=O{?é¿ÍÔ.mÈ?é¿ÍÕþ“8?é¿xkFº?é¿xm0&?é¿#ÅNž?é¿#•h?é¾Í”¬×?é¾Í–|#t€?éº!3¥?é¹Ë€N}?é¹Ë‚6-?é¹uúÉ™zS?éªC ò?é©»pñ/N?é©»r¿Æâ?é©eŸ$ž?é©e Þ¶'?é©Ë›qŠ?é©Íiý?騹ö“\¾?騹øaâ1?é¨dø,ä?é¨d!ƬL?é¨GÉùB?é¨I˜rŸ?駸n©Ê?駸o×?é§b’´ãâ?é§b”ƒQ'?é§ µÎp?é§ ·œh©?馶×T×6?馶Ù#8d?é¦`÷I«Ú?é¦`ùü?é¦ ¬g\?é¦ z¼q?饵2|ñÀ?饵4K@É?é¥_M¼²?é¥_OŠh¯?é¥ giz’?é¥ i7½ƒ?餳…xc?餳SµG?é¤]–¾o?é¤]—ÞõG?餫 ¦Ý?餬Øר?飱¾sxb?飱ÀA£ ?é£[ÐL?é£[Ò,>?é£à” )?é£âb+Í?颯ï1½?颯ðÿ8T?é¢Yü!ýæ?é¢Yýðo?颸?é¢ MÄ’?é¡®J5Ñ?é¡®<@?é¡Xì`?é¡XOìÁ?é¡ &ÃQ?é¡!ô½¥?é ¬%9¯?é ¬'ôõ?é V(¹À?é V*‡÷?é *¦ÆÙ?é ,t¯?韪+N ?韪,Ð0&?éŸT)ÌSÎ?éŸT+š/Û?éžþ'aN?éžþ(Ò7L?鞨"ª¼œ?鞨$xŒŒ?éžRÀ ,?éžRÔ ?éüD1œ?éüõo?é¦ 7š?é¦Ø^?éP™˜À?éPgPu?éœùõkd‰?éœù÷9/?霣ç¬6‚?霣éyâ?éœMØ\â:?éœMÚ*‡Â?é›÷Ç}~“?é›÷ÉK ?雡µ Ä$?雡¶Û]Œ?é›K¡µ’?é›K¢ÜHë?éšõ‹­/?éšõM:x?隟t`Áê?隟v.I#?éšI[²ö_?éšI]€wˆ?é™óAuÔ?é™óCCO,?é™%©Ð4?é™'wE=?é™GO0Ñ?é™G ŸÊ?é˜ðée®ž?é˜ðë3‡?阚Èí¾Ë?阚ʻ!£?é˜D¦çÖ}?é˜D¨µ3D?é—îƒ9Q&?é—î…§Ý?é—˜]àïÍ?é—˜_®@s?é—B6÷ÔÄ?é—B8ÅX?é–ì}¸:?é–ìJü¾?é–•äs©?é–•æ@M?é–?¸×îp?é–?º¥&Ñ?é•é‹¬>Ü?é•éyq,?é•“\ðtp?é•“^½ ®?é•=,¥™?é•=.r)Æ?é”æúÉuš?é”æü–•µ?é”Ç^m÷?é”É+ˆ?é”:’d?é”:”1?é“ä[ÚH?é“ä]§*-?é“Ž#Àÿ?é“Ž%Žá?é“7êÔ?é“7ëæ!•?é’á®âeþ?é’á°¯a­?é’‹rþ?é’‹sê š?é’53ɧ:?é’55––Ã?é‘ÞóçÏ(?é‘Þõ´¸Ÿ?鑈²wvB?鑈´DY¦?é‘2oyá?é‘2qF{2?éÜ*í •?éÜ,ºwÓ?é…äÓòÊ?é…æ Ãõ?é/-7Ù?é/žúð?éÙSù(L?éÙUÅíP?éƒ 8 –?éƒ Ȇ?é,¼ê!"?é,¾¶Ùÿ?éŽÖo…n?éŽÖpÜ87?鎀¨?鎀!tÊÆ?éŽ)δŽO?éŽ)Ð4ð?éÓ|4_î?éÓ~|?é}((67?é})ôа?é&ÒvK_?é&ÔBßÅ?éŒÐ{Ö,?éŒÐ|éd}?éŒz"4¬á?éŒz$5?éŒ#ǾC,?éŒ#ÉŠÅT?é‹Ík¸óp?é‹Ím…oƒ?é‹w%%?é‹wò#?é‹ ¯,5?é‹ °Ðœ?éŠÊNU>L?éŠÊP!¨!?éŠsìNÃ?éŠsí䲂?銈N.ú?銊Œ¤?é‰Ç"ö9‚?é‰Ç$‘?é‰p¼â ?é‰p½Ý3Š?é‰SŸ(´?é‰Ukt?éˆÃé 9N?éˆÃël~£?éˆm~)Ý?éˆmài?éˆû˪?éˆÈÒ?é‡À¢Wß?é‡À¤#8ñ?é‡j2%î?é‡j3ò}?é‡Ài'ù?é‡Â5Nß?醽M j®?醽Nì‹~?é†fØK̨?é†fÚça?é†aëÁƒ?é†c·Ö&?é…¹ê_H?é…¹ëÌmÔ?é…cp‰8?é…crU•®?é… õˆK:?é… ÷TM™?鄶xûÅ…?鄶zÇÁÌ?é„_úä@ñ?é„_ü°7"?é„ {BŽ“?é„ }~¬?郲úfý?郲ûâPÿ?éƒ\w_±‰?éƒ\y+•t?éƒómú?éƒôëKÍ?邯mUTé?邯o!,¥?é‚Xåç®?é‚Xç³”R?é‚\Õ}8?é‚^¡HÄ?é«Ò6à’?é«Ô¦?éUF ¤Ñ?éUG×d-?é€þ¸TšF?é€þº SŠ?逨)y ?逨*Ý,5?é€Q˜B'ó?é€Qš Õ?éûçÔœ?éû³{–?é¤rÙÐ?é¤sÍz²?éMÜq?éMÞ[¹:?é~÷E“Ð?é~÷G_d¶?é~ ­ Iq?é~ ®×Ø?é~JùÎí?é~JÅWk?é}ów\ÓK?é}óy(U°?é}œÚ5=~?é}œÜ¹Ê?é}F;ƒ€X?é}F=Nö‹?é|ï›G‚Ì?é|ïòå?é|˜ùZn?é|˜ûLÄm?é|BV1z?é|BWüÝù?é{ë±X%ì?é{ë³#ƒ¸?é{• õs?é{• ÀËB?é{>c c?é{>dÔlû?éz繓¾Î?ézç»_ L?éz‘•sp?éz‘`¸Ô?éz:b R?éz:cÙ_œ?éyã³þ8>?éyãµÉql?éyf-õ?éy1a ?éy6SE.M?éy6U[G?éxß œÃd?éxߢgêC?éxˆìkëŠ?éxˆî7 N?éx26³H?éx28~bº?éwÛsK¶?éwÛ>`D?éw„Æ’£?éw„È]±?éw. \‡?éw. Údß?év×PCw?év×QÍE³?év€’jáh?év€”5݈?év)ÓIyø?év)Õoý?éuÓžÜ@?éuÓiÌ)?éu|Pj4Ð?éu|R5?éu%Œ¬RÈ?éu%Žw6y?étÎÇeK9?étÎÉ0(Î?étx•3@?étx` ¸?ét!8;”Œ?ét!:eé?ésÊnZ&‡?ésÊp$ñÇ?éss¢ï\ ?éss¤º!0?ésÕü‡?és×ÇN?érƧž?érÆ L`ˆ?éro7~¹s?éro9Il@?éreóN×?érg½ûˆ?éqÁ’à“Ÿ?éqÁ”«:2?éqj¾F ?éqjÀ²?éqè$:â?éqéîÕ;?ép½{i?ép½F¥?épf7K@°?épf9ÎÎ?ép\”G–?ép^^Ï–?éo¸€V«F?éo¸‚!-)?éoa¢’RŒ?éoa¤\ÎP?éo ÃG$:?éo Å™á?én³âvzD?én³ä@éÌ?én]%%?én]éŽ?énB"?én …P?ém¯6ß´r?ém¯8ª ?émXO÷83?émXQÁB?émg‰M?émiSžŽ?élª}}|'?élªGÆù?élS‘ÑÕH?élS“œü?ékü¤ž 5?ékü¦h^É?ék¥µâÎ>?ék¥·­³?ékNÅ "b?ékNÇjT¸?éj÷ÓÕI£?éj÷ÕŸuÛ?éj àƒœø?éj âMÃ?éjI몦?éjIítÆ ?éiòõJ§õ?éiò÷ÁÎ?éi›ýcå?éi›ÿ-ùV?éiEö¢?éiEÀ¯¡?éhî Ãœ?éhî ÌË?éh— ˆT?éh—RŽ®?éh@ˆB6?éh@R=o?égéöô?égéËì ?ég’ õÀH?ég’¿¯A?ég; dt?ég; -øL?éfäLÊð?éfä ­¨?éf°5º?éfzQ?éf5úŽd’?éf5üX;?éeÞñçšx?éeÞó±jÎ?ée‡ç¼H¢?ée‡é†×?ée0Ü Êæ?ée0ÝÕŽú?édÙÎÖ’†?édÙРPx?éd‚À›b?éd‚ÁçS3?éd+¯àA\?éd+±©ó ?écÔžÇy?écÔŸès?éc}ŠÙžê?éc}Œ£DW?éc&vÜx?éc&wÚ{Ã?ébÏ_Äf¿?ébÏaÿé?ébxGôÝ ?ébxI¾p(?éb!.¡Éà?éb!0kVÆ?éaʳ0ý?éaÊ|·Á?éar÷'±·?éarøñ2X?éaÙ?éaÚß‹›?é`Ĺ?é`Ä»Hk?é`m˜bæÇ?é`mš,U?é`uÁW^?é`wŠ¿u?é_¿Qš°@?é_¿Sd5?é_h+ïaï?é_h-¸½Á?é_¿$l?é_ˆz?é^¹Ü : ?é^¹ÝÓ‰«?é^b±Ñ?é^b³š\ø?é^ †Äÿ?é^ ‡ÝC?é]´XÒ4ž?é]´Z›q¿?é]]* ?é]]+Ö8?é]ùÄd?é]ûA>?é\®Ç÷á?é\®ÉÀE—?é\W”§IK?é\W–pmÞ?é\_Ó›x?é\aœ¹ç?é[©)} ?é[©+F$k?é[Qñ£Ý¤?é[QólïÊ?éZú¸Gš&?éZúº¦(?éZ£}h²?éZ£1·ü?éZLA•þ?éZLBЕ·?éYõ$,?éYõí%¦?éYþˆ´?éYŇ|$?éYF‚×x`?éYF„ e¬?éXï@nWT?éXïB7>z?éX—üƒg÷?éX—þLHø?éX@·»?éX@¸ßõ—?éWép)±þ?éWéqò†µ?éW’'»"?éW’)ƒâ´?éW:Ý˃‹?éW:ß”K÷?éVã’BÇï?éVã” Š6?éVŒEƒF?éVŒFè?g?éV4öy3?éV4øAÎ.?éUݦNâ¢?éUݨ’w?éU†T¡€X?éU†Vj*?éU/q½?éU/:`‘?éT׬¾ô§?éT×®‡’ ?éT€V‰i ?éT€XRE?éT(þщí?éT)š?éSÑ¥—=B?éSѧ_È2?éSzJÚÄÎ?éSzL£I—?éS"îœì0?éS"ðejÓ?éRËܳ©?éRË’¥,$?éRt1šæØ?éRt3cY-?éRÐ×õr?éRÒ a ?éQÅn“i–?éQÅp[Ï?éQn ÍW5?éQn •·?éQ¥†··?éQ§Oo?éP¿>¾çl?éP¿@‡:ý?éPgÖvƒë?éPgØ>ÑT?éPl­Îþ?éPnv@?éO¹d®°?éO¹,ïÊ?éOa”›6ñ?éOa–cqã?éO &RF?éO (:?éN²¶ˆÑæ?éN²¸Q‡?éN[E?°Å?éN[GÙ??éNÒw›?éNÔ?½i?éM¬^/¿?éM¬_÷Û¹?éMTèhÝ?éMTê0£Þ?éLýq"uŸ?éLýrê…v?éL¥ø]ŠÊ?éL¥ú%”y?éLN~³Œ?éLNá·?éK÷?Ž•?éK÷‹ò?éKŸ„Í7,?éKŸ†•.`?éKHÙÇW?éKH¡¸b?éJð…e€N?éJð‡-k/?éJ™pã?éJ™7þ›?éJAú0â?éJAÂp?éIéû4H?éIéüÌ ­?éI’tRœ?éI’vU$×?éI:ì•Í?éI:î]™1?éHãc÷¦?éHãd潎?éH‹Ø(È?éH‹ÙïÀ…?éH4K±W„?éH4My?éGܽ»N?éGÜ¿‚¸?éG….E—?éG…0 D^?éG-Py2?éG-Ÿ G?éFÖ Ü­µ?éFÖ ¤NŸ?éF~vé¾î?éF~x±Y­?éF&áwî?éF&ã?‚¬?éEÏJˆ3A?éEÏLOÁª?éEw²aì?éEw³àê+?éE ,r+?éE óô??éDÈ|Á¥.?éDÈ~‰!?éDpßس?éDpá (Ñ?éDAqÝ?éDC9Lª?éCÁ¡’?éCÁ£Tû‚?éCj+å¥?éCjóHà?éC]Lè?éC_ì÷?éBº¸ðˆÇ?éBºº·ßª?éBcˆu?éBcÞÙ-?éB kÁG/?éB mˆ‘º?éA³Âî¼Í?éA³Ä¶,?éA\ŸÏ4?éA\g g?éAl¼²Ê?éAnƒêÑ?é@¬¿DjH?é@¬Á œ"?é@ULµú?é@Uá¨?é?ý_Ö ?é?ýa²Š?é?¥­âq?é?¥¯©!Æ?é?Múnû”?é?Mü6¼?é>öE}]ã?é>öGDpÝ?é>ž j?é>žÕ-8?é>F× ŸÆ?é>FØç¦f?é=ïµ¢?é=ï|?é=—bÌ`\?é=—d“Z¡?é=?¦f"Û?é=?¨-ó?é<çè‚I”?é<çêI7~?é<)!ä?é<*è…¡?é<8hDD?é<8j æÓ?é;à¥é7§?é;ৰ?é;ˆâ+ë?é;ˆãÙ?é;1¾lw?é;1…;|?é:ÙUî9ô?é:ÙWµË?é:¢]—?é:i ??é:)ÃÚaÝ?é:)Å¡W?é9Ñø–,\?é9Ñú\â¨?é9z+ÖXÂ?é9z-Þ?é9"]šú*?é9"_a¤?é8Êä~¹?é8Ê«"x?é8r¼²ž„?é8r¾y<?é8êõ*?é8ëÌŒ‹?é7ÃÞ:Ð?é7äÌ?é7k@;°?é7kB;?é7iÃ?é7jåGð?é6»‡‡?é6»’N¤?é6c¶uál?é6c¸»Dý?é5@¤²?é4¬]¥Ï?é4¬^ÕÿS?é4Tyè?é4T{®fX?é3ü•DqË?é3ü— ¾ï?é3¤¯%0?é3¤°ëI$?é3LljÖÕ?é3LÉP˜?é2ôÞs/Æ?é2ôà9jX?é2œóáM ?é2œõ§n?é2EÔn´?é2E šœå?é1íLyø?é1í¡ø?é1•+IT?é1•-uê?é1=:Ë—ü?é1=<‘³™?é0åHÓ*×?é0åJ™@C?é0U`L¿?é0W&[ú?é05`sk ?é05b9t)?é/Ýj kA?é/ÝkÒn?é/…r+2?é/…sñ‰Ø?é/-xÑø?é/-z—m?é.Õ}ü®–?é.ÕžÙ?é.}¯Ç?é.}ƒtêØ?é.%ƒè=?é.%…­þ?é-Í„¨ ®?é-͆mëZ?é-uƒï ?é-u…´òš?é-½UN?é-ƒƒ&•?é,Å~Îò?é,ÅØš?é,mxïÈ?é,mzµŒø?é,rT®?é,tlÁ?é+½jA9?é+½lñ?é+e`µ¨ú?é+eb{[D?é+ U›Í?é+ Wa+ä?é*µHðµI?é*µJ¶[,?é*]:˺f?é*]<‘Z?é*+,Δ?é*,òh?é)­|=?é)­Ù‡?é)U€Š£?é)U F¹?é(üót ý?é(üõ9’ß?é(¤Ýí·þ?é(¤ß³8­?é(LÆíûf?é(Lȳuá?é'ô®u©?é'ô°:‰ð?é'œ”‚ëÊ?é'œ–HYÝ?é'Dy½D?é'DzÝ%"?é&ì\4$?é&ì]ù…­?é&”=Ø?é&”?`y?é&<rˆ?é&<ÈÇÉ?é%ãü¶Q¡?é%ãþ{ ®?é%‹ÙðáÊ?é%‹Û¶*¢?é%3µ³¼â?é%3·xÿ…?é$ÛþšÆ?é$Û‘Ã×5?é$ƒhÒQ?é$ƒj—KŠ?é$+@-·>?é$+AòçB?é#Ótº?é#Óמ‰?é#zê؆?é#zìDü ?é#"½uôó?é#"¿;W?é"ÊŽõô?é"ʺ¨#?é"r^þd‚?é"r`Ãu{?é"-TÏ?é"/U_’?é!Áú¬(½?é!Áüq-J?é!iÆQÅy?é!iÈÃÐ?é!=X?é!’F5z?é ¹Y:ÏÏ?é ¹ZÿÁº?é a ~éo?é a"CÕ$?é æ6GÑ?é çû-P?é°ª`O1?é°¬%.z?éXmC?éXnÖôU?é.KÆ?é0c¡?é§î £?é§ïÒo¦?éO¬X –?éO®Ð?é÷i+l?é÷jïâ?éŸ$‡)ˆ?éŸ&Kã‡?éFÞk¬d?éFà0`,?éî–ÙR?éî˜ÿ®?é–MÐY”?é–O•í?é>Pzˆ?é>ª?éå·YóÝ?é幎Ç?éií^“?ék±óF?é5 Ÿv?é5Ï-ð?éÜʱÈ`?éÜÌvP£?é„xã;?é„z§šF?é,%žÍä?é,'cI¶?éÓÐäÎ:?éÓÒ©CÕ?é{zµ…&?é{|yôˆ?é##„?é#$Õm®?éÊÉ÷^þ?é îmi²E?é îo- V?é •Ôºž?é •ÕÛ r?é =9Qæ®?é =;1E?éä'D?éäžÜkž?é‹ÿlÚ]?éŒ0y?é3`M—D?é3bÏ#?éÚ¿»nú?éÚÁ~ ›?邶ø¼?é‚z$ ?é)z?eê?é)|‹?éÐÕV£?éÐ׋?éx.ùÍž?éx0¼æH?é‡+½~?éˆîÏê?éÆÝë´š?éÆß®ÀÈ?én39Ä?én4üÉò?é‡üÆ?éˆØüw?é¼Ù"¼?é¼ÛD/?éd*zÀæ?éd,=´?é zA±?é {Æ.¦?é²ÈŽ?é²ÉÝöE?éZÁµŠ?éZ„–?é_÷ʾ?éaº¤ö?騩½ì?騫Úæ?éOòZ~?éOóÕ(8?é÷8÷#ä?é÷:¹ë_?éž~l&×?鞀.è?éEÂpÁà?éEÄ3|Ý?éíåO?éíÈš ?é”F+¢+Hc?èþØvL?èþØx\?èþ®ªy?èþ°mv?èþ&å–ùé?èþ&çY|¦?èýÎ\Ù?èýÎÔÙU?èýuOóz?èýuPßiµ?èý¶¡Ü?èýƒy×?èüòßÑÅ?èüô¢;?èüj☓Ù?èüjäZ÷Q?èüá%K?èü£‚ƒ?èû¹=¹=¥?èû¹?{”›?èû`i!ÌP?èû`jä?èû“µb?èû”ÜÿÖ?èú®»£°n?èú®½eô ?èúUâ½S»?èúU䑬?èùýgVâ?èùý )Ž’?èù¤,¢#¤?èù¤.dU?èùKOn#·?èùKQ0Nã?èøòpË;=?èøòr`'?èø™¹Nj?èø™’{m?èø@¯8Æô?èø@°úßZ?è÷çÌJˆ?è÷çÎ ¬?è÷Žçì°_?è÷Žé®¼@?è÷6!È?è÷6ã͹?èöÝè´z?èöݪ³Ö?èö„2A†8?èö„4R?èö+H-,j?èö+IïA?èõÒ\«ä?èõÒ^lòx?èõyo»OÞ?èõyq}6/?èõ ^ n?èõ ƒ €|?èôÇ‘•L?èôÇ“Vâ?èôn ^kÅ?èôn¢ ?L?èô­»`ã?èô¯}.'?è󼹕ùu?èó¼»WÀv?èócÃì—±?èócÅ®Xo?èó ÌÔª+?èó Ζd¥?èò±ÔN«?èò±ÖÈá?èòXÚXŽŸ?èòXÜ<‘?èñÿÞôÙâ?èñÿà¶?èñ¦â"­ë?èñ¦ãäOU?èñMãâsÂ?èñMå¤è?èðôä4”l?èðôåö)M?èð›ãn¡?èð›äÙý??èðBàŽ—Í?èðBâP &?èïéÜ—xõ?èïéÞXû ?èï×2É›?èïØôEk?èï7Ð`Æj?èï7Ò";õ?èîÞÈ"1?èîÞÉã Z?èî…¾vhv?èî…À7Ñx?èî,³]|Ù?èî,µß•?èíÓ¦Ø\J?èíÓ¨™¸Á?èíz˜æ¾`?èízš¨’?èí!‰ˆßº?èí!‹J/¦?èìÈx¾üø?èìÈz€FŸ?èìofˆÍÉ?èìohJ*?èìRæ»?èìT§ø:?èë½=ÙZ:?èë½?š‘?èëd'`6}?èëd)!g ?èë {`A?èë <Š‹?èê±ö+ÅV?èê±÷ìéZ?èêXÛpñ+?èêXÝ2é?èéÿ¿K e?èéÿÁ 7Ü?è馡º ?è馣{ Ñ?èéM‚¿O:?èéM„€Z$?èèôbYÈ?èèôdÌ´?èè›@t€{?èè›B5~Ø?èèB ?èèBÏ7?èçèø:Þ`?èçèùûÐ/?èçÑû¾?èçÓ¼©™?èç6ªP ?èç6¬íL?èæÝ8$¬?èæÝ‚ù¦?èæ„V´P?èæ„Xu(»?èæ+*Ä™þ?èæ+,…lj?èåÑýhæ6?èåÑÿ)²Z?èåxΡõo?èåxÐb»L?èåžo?èå 0>®?èäÆlÑ¿N?èäÆn’x›?èäm9ÉJˆ?èäm;‰ý?èäUß?èä,œ?èãºÏvÇ¢?èãºÑ7n?èãa˜-Š?èãa™î*@?èã_y×?èãa:q?èâ¯%[¾ ?èâ¯'Rfõ‹?èà>hµó,?èßå!Š{®?èßå#JÝ?èß‹Ú¶F=?èß‹Üv¡J?èß2’y«®?èß2”:q?èÞÙHÔ s?èÞÙJ”Yí?èÞýÅùà?èÞÿ†B?èÞ&±O†ç?èÞ&³ÈÎ?èÝÍcq³?èÝÍe1VP?èÝtþ¤?èÝtÕ3÷?èÝÃ:ü?èÝÄû+ ?èÜÁpöm?èÜÁr¶•Ñ?èÜhG¹B?èÜhÛ·?èÜÈ/)?èÜÉï8T?èÛµq¬¥G?èÛµsl»'?èÛ\Àd?èÛ\€s¥?èÛÀjÀ"?èÛÂ*Ém?èÚ©e«œé?èÚ©gkŸê?èÚP ƒ ä?èÚP C™?èÙö«ñš¶?èÙö­±‘ ?èÙL÷2Ð?èÙN·"ð?èÙC쓉¡?èÙCîSsv?èØêŠÇŠÜ?èØꌇnf?èØ‘'“ð?èØ‘)R÷/?èØ7Âö`?èØ7ĵñS?è×Þ\ñKÀ?è×Þ^±h?èׄõ„eˆ?èׄ÷D/ä?è×+Œ¯KB?è×+ŽoS?èÖÒ"rv?èÖÒ$2N;?èÖx¶ÎD¯?èÖx¸ü(?èÖIÂKt?èÖKü¡?èÕÅÛO@?èÕÅÝ;!?èÕlkuF°?èÕlm4ëE?èÕú4.:?èÕûó̃?èÔ¹‡Œ‚b?èÔ¹‰L^?èÔ`}úÂ?èÔ`=Œr?èÔžÒã?èÔŸÈ^F?èÓ­'-r@?èÓ­(ì÷V?èÓS®ë¼r?èÓS°«;;?èÒú5C• ?èÒú7 ?èÒ º5çŒ?èÒ »õY¼?èÒG=­p‚?èÒG?lÜe?èÑí¿©—?èÑíÁh…-?èÑ”@<èÂ?èÑ”AüH ?èÑ:¿h¯.?èÑ:Á()?èÐá=,­à?èÐá>ì?èЇ¹‰K½?èЇ»H˜?èÐ.4~k÷?èÐ.6=² ?èÏÔ® ¬?èÏÔ¯Ë]p?èÏ{&3€?èÏ{'òX÷?èÏ!œòüæ?èÏ!ž²0?èÎÈKÄþ?èÎÈ ñØ?èÎn†> ?èÎn‡ý1?èÎøʆ?èÎú‰(Ä?èÍ»iïJs?èÍ»k®dc?èÍaÙ®ºÄ?èÍaÛmÎe?èÍHÜ?èÍIÇ/?èÌ®´û2?èÌ®¶º 6?èÌU ˆ(?èÌU"GÞ?èËûŠ°9.?èËûŒo3•?èË¡ór™?èË¡õ11?èËHZÏ® ?èËH\Ž›Ô?èÊîÀÇÞÎ?èÊî†ÆH?èÊ•%Z·?èÊ•'˜B?èÊ;ˆˆ´?èÊ;ŠGx?èÉáêR%™›?è¶>›X‰Ÿ?èµä«úõ÷?èµä­¸b1?赊¼ùcˆ?赊¾¶Ém?èµ0Ì—s3?èµ0ÎTÒÃ?è´ÖÚÔ°Ô?è´ÖÜ’ ?è´|ç±*Ò?è´|én}·?è´"ó-Œ?è´"ôêê?è³ÈýIÀk?è³Èÿ¥?è³oh?è³oÂ_L?è³ `ùJ?è³2Ù?è²»\®?è²»áÈ?è²aøÐ?è²aµü÷?è²5Ã$?è²òé±?è±­Î?è±­Ð4?è±S‘'f?è±SNAF?è°ù°7Ð?è°ùmKZ?è°Ÿ\V,?è°Ÿc_?è°E”#[?è°EQ*8?è¯ëjÏ;?è¯ë'ÏÁ?译 ྕ?译 ¸Ä?è¯7õ}!?è¯7²pú?è®Üù©Æ…?è®Üûf´?讂îýQæ?讂ðº9?è®(âðXª?è®(ä­9}?è­ÎÕƒÁÊ?è­Î×@œF?è­tƶ–Ø?è­tÈsjý?è­¶‰“q?è­¸Fa>?è¬À¤ýL?è¬À¦¹ãÂ?è¬f’½C?è¬f“Í~a?è¬ }ÄÛ?è¬ •à?諲h¯.?諲iÖcœ?è«XQG‚?è«XRËõ˜?èªþ8¥Ýq?èªþ:b…0?誤ݪX?誤 šK¾?èªJ¶¼8?èªJsWF?è©ïç0õÀ?è©ïèíŠv?è©•ÉLæü?è©•Ë uY?è©;ª î?è©;«Ç%ó?è¨á‰j(›?è¨á‹&ªH?訇gkÀ`?訇i(;´?è¨-Dž”?è¨-EÌ?è§ÓUÑ:?è§Ó!?Ü?è§xù>fb?è§xúúΫ?è§ÑÉl?è§Ó…Î?è¦Ä¨÷°?è¦Äª³wG?è¦j~È!?è¦j€„Z^?è¦S;´?è¦Tøt?襶&Rc^?襶(«è?è¥[÷ù?e?è¥[ùµ–?è¥È.1?è¥ÉêP?褧—ü’?褧˜À2?è¤Md{‡ê?è¤Mf7·?è£ó0”B ?è£ó2PjÕ?裘ûNºV?裘ý ÜÆ?è£>Ä«)?è£>ÆgE²?è¢äŒ©G?è¢äŽe\¿?袊SI¡Ü?袊U±=?è¢0ŒGÃ?è¢0HPÉ?è¡ÕÜq?è¡ÕÞ-Ä?è¡{žø«+?è¡{ ´§|?è¡!`"Úa?è¡!aÞÐX?è Çïá?è Ç!«Ñ)?è lÞ_ÎQ?è là·’?è ›s¸?è .ç?蟸W)½•?蟸Xåš ?èŸ^ƒ°"?èŸ^?†R?èŸÊ7?èŸÌ<å ?èž©‚"PÚ?èž©ƒÞS?èžO8gT?èžO:"Ýq?èôíOÕª?èôï ’l?èš Ü»®?蚢˜r?è@S Ú?è@TÉŠ?èœæã¿Ü?èœæŸiŠ?蜋³^$}?蜋µÇÐ?èœ1a}kå?èœ1c9Û?è›×Ax˜?è›×ý2?è›|¹ªƒg?è›|»f¥?è›"c¸Å#?è›"etO?èšÈ lv˜?èšÈ'ú?èšm³ÅO5?èšmµ€Ì^?èšY°>k?èš[kµ6?虸þ,l”?虸ÿçÝ?è™^¡L?è™^£r'?è™C)?è™DÊß?蘩ãv=X?蘩å1š±?è˜O‚rÚ?è˜O„<ÉÕ?è—õ 0Jª?è—õ!ë›H?è—š¼ƒÔ„?è—š¾?Ä?è—@W{FD?è—@Y6Š'?è–åñYw?è–åòÒ–ý?è–‹‰XœŽ?è–‹‹Ó¶?è–1 >p€?è–1!ù¡J?è•ÖµÉ8²?è•Ö·„c?è•|IùX€?è•|K´|Ž?è•!Ü·?è•!Þ‰¤Ã?è”ÇnHÑ®?è”Çpé?è”lþiÎ?è”m$-Ã?è”/ ?蔎ê*6?蓸š‘X?蓸U•?è“]¦¬Vf?è“]¨gT??è“1d%þ?è“3y?è’¨ºÂ n?è’¨¼|þŠ?è’NBÆÆ?è’ND°Å?è‘óÉr ?è‘óË,ëk?è‘™NÄÅ?è‘™P~æÄ?è‘>Ҽ؂?è‘>Ôw°#?èäU\X’?èäW)Ô?è‰Ö£9?è‰Ø]â?è/V‘¢³?è/XLg6?èÔÕ'\b?èÔÖâ†?èzRd|“?èzT4W?èÎI¼r?èÐmÖ?èŽÅHâ{?èŽÅJ~M€?èŽjÁÐØË?èŽjË}p?èŽ9„%£?èŽ;>Ãç?赯Ý ?èµ±—¬î?è[$Ü4³?è[&–Æ7?è˜çV?èš ?è…솳S§?è…ìˆm_3?è…‘Þt?è…‘ßØ$ž?è…742ï?è…75ì·?è„܈﫴?è„ÜŠ©¤?è„ÜW\ ?è„ÞN#?è„'.hŽä?è„'0"z…?èƒÌ#Ñc?èƒÌ€Ý¶¡?èƒqÎv˜C?èƒqÐ0w?èƒ_;?èƒ?肼hïÀ ?肼j©’¶?è‚a´)6?è‚aµãÎ?è‚þ Ò?è‚ÿÄ—e?è¬F”Ëß?è¬HNŠË?èQÇÛ?èQ“˜?è€öÓ£¶?è€öÕ]hÃ?耜(k ?耜âÎ?è€A[V/¦?è€A]Õ?èæ-fp?èæžçk?è‹Ý­ñ2?è‹ßg‰É?è1Ø1ì?è1‘Ä?è~ÖZ¬5(?è~Ö\eÀ÷?è~{—*i?è~{˜ãŒÕ?è~ ÒQßö?è~ Ô ^ý?è}Æ #ËV?è}Æ ÝCù?è}kD +†?è}kFYÄ?è}{Ç7Â?è}}€£œ?è|µ±˜|t?è|µ³Qáé?è|Zæ°ú?è|ZçÎ ?è|;áä?è|õ:?è{¥Kº?è{¥LÇn?è{J{‹@]?è{J}DŒ??èz華1Æ?èzï¬mwD?èz”؈QÊ?èz”ÚAâ?èz:¬ÿ?èz:Àå²?èyß03%S?èyß1ìW¡?èy„Z qþ?èy„[Ãæ?èy)‚Ÿ–?èy)„FÅ?èxΩ½eJ?èxΫv„g?èxsÏ™z^?èxsÑR“?èxôêž?èxõÇüï?èw¾;Š?èw¾ÖGv?èwc8Ö ?èwc:œ?èwY9ef?èwZòd†?èv­xG«Þ?èv­z¤˜?èvR–À?èvR—¹²W?èu÷²d­þ?èu÷´™ë?èuœÍt,h?èuœÏ-ï?èuAç.Ç?èuAè禯?ètæÿ”àÕ?ètçM¹?ètŒ¦„`?ètŒ_V³?èt1,cèô?èt1.´à?èsÖ@Íoå?èsÖB†5j?ès{SâúÅ?ès{U›¹ã?ès e¤ÀR?ès g]y ?èrÅvw˜?èrÅwË)è?èrj…-š?èrj†å­‚?èr’ô?ð?èr”¬åq?èq´Ÿh:?èq´¡ ³T?èqYª‰ P?èqY¬A£?èpþ´WÒ?èpþ¶–?èp£¼Ñ·à?èp£¾ŠCÃ?èpHÃú1ä?èpHŲ·_?èoíÉÐ(û?èoíˈ¨?èo’ÎS~Ò?èo’Ð ÷}?èo7Ñ„¿.?èo7Ó=1q?ènÜÓcöA?ènÜÕb?ènÓðÛ>?ènÕ©@°?èn&Ó,yd?èn&ÔäØn?èmËÑ2ß?èmËÒ΋?èmpÍ®>k?èmpÏf¤?èmÈõ'¼?èmÊ­sŒ?èlºÂØ‘i?èlºÄÖÑ?èl_»V¯b?èl_½îa?èl²àö?èl´:Œ?èk©¨Zr?èk©ª9Ÿ?èkNœß&?èkNž—/ê?èjó·.?èjó‘É܈?èj˜ñ‚}?èj˜ƒ©¡n?èj=r~œS?èj=t6´Û?èiâa¹ºH?èiâcqÌf?èi‡O¢hÒ?èi‡QZt‡?èi,<9¢?èi,=ñ í?èhÑ'}Ïò?èhÑ)5ÎÔ?èhvpÊŽ?èhv(Ã?èhú.µ?èhûÊ Ã?èg¿áb4?èg¿ãó×?ègdÇ`bà?ègdÉH?èg ¬ ŸX?èg ­Å~'?èf®ióÖ?èf®‘!Ì:?èfSquAÄ?èfSs-¾?èeøR/”ø?èeøSç`‡?èe1™N?èe3Q5?èeB²£@?èeBjaú?èdæì{Kž?èdæî3í?èd‹Çóü~?èd‹É«®c?èd0¢lü?èd0£Ôu?ècÕzôý¬?ècÕ|¬¢º?èczR~?èczT5­º?èc(·X^?èc*nð•?èbÃý¡¶?èbÃÿX¡‚?èbhÑ;•®?èbhÒó!?èb £†Ë¿?èb ¥>Pµ?èa²t‚½Ï?èa²v:g§?è` àõÒî?è`EªÕsÏ?è`E¬ŒØª?è_êuãæ?è_êvÓBU?è_>í¤?è_?ÉE¦?è_4·œy?è_4nî?è^ØÌ &$?è^ØÍÄqM?è^}‘À^?è^}’Ê?è^"TÈLM?è^"VŠ?è]Ç.~‡?è]Çå¶k?è]kØD¹\?è]kÙûêÓ?è]˜ ±_?è]™ÂÜi?è\µVƒu?è\µX:B?è\Z«] ?è\Zb{Ð?è[þÏ„ÑÖ?è[þÑ;é™?è[£Š1 ?è[£‹ÆBb?è[HCJ°÷?è[HE»ß?èZìû7ÛÌ?èZìüîàG?èZ‘±Öh…?èZ‘³f“?èZ6g&ŒØ?èZ6hÝ„w?èYÛ(¨¶?èYÛß™è?èYÍÜs%?èYÏ“]ê?èY$B!Ø?èY$€ù/?èXÉ/Zi0?èXÉ1G?èXmÞ%2?èXmßÛ×­?èX‹¡ò[?èXXÃg?èW·7ÑÉÇ?èW·9ˆ”e?èW[â´g¾?èW[äk+î?èWŒJë?èWŽ¿¬?èV¥4’£Ò?èV¥6I[%?èVIÛŽXð?èVIÝE Ô?èUî+od?èUî‚âÚ?èU“%i;?èU“'ÃA?èU7ÈX%?èK“ ‘øÕ?èK“ Gè™?èK7Š"¢?èK7‹Ø‹ï?èJÜhÚ|?èJÜ ½]?èJ€ƒRÚ5?èJ€…¶¤?èJ$ýß܃?èJ$ÿ•²€?èIÉw ŒC?èIÉxÖ[Î?èImïô1?èImðʽJ?èIe½Ç?èIgs‰µ?èH¶Û»Ž?èH¶ÜÐwÃ?èH[O+Üt?èH[Pá’7?èGÿÁñ^u?èGÿç Å?èG¤3kÊI?èG¤5!s'?èGH£š¬¶?èGH¥PO"?èFí~Žn?èFí4*g?èF‘€Î?èF‘Íc ?èF5ìe¤£?èF5î3·?èEÚWiBŒ?èEÚYË-?èE~Á"4°?èE~Â׶Þ?èE#)Ù¹?èE#+FUt?èDǵt?èDÇ’j‡¼?èDkögu?èDkøDÖJ?èD[¹’?èD\Õ!ó?èC´¾e¿®?èC´À!œ?èCY bV:?èCY"±µ?èBý^?èBý‚ʳ ?èB¡à~áÚ?èB¡â40m?èBF>Ÿj:?èBF@T²Y?èAê›v„-?èAê+ÅÙ?èAŽ÷ŽK?èAŽø¹Éƒ?èA3QIç,?èA3Rÿð?è@תFo±?è@׫ûž?è@|ú¾?è@|¯0š?è@ Xe¸r?è@ ZÙÙ?è?Ä­‰ ç?è?į>&Ú?è?icä ?è?iøŒ?è? Såa—?è? Ušo¡?è>±¥ DE?è>±¦ÁKÚ?è>Uôèûr?è>Uöü“?è=úC|8ì?è=úE13˜?è=žÆ?è=ž’zûF?è=BÜÆFd?è=BÞ{4&?è<ç'}+(?è<ç)2u?è<‹pêé’?è<‹rŸÊj?è·?è9­Ž§‰?è9­ÒT´?è9QËþ¢~?è9QͳI3?è8ö—Ùù?è8ö Lz7?è8šCé«ò?è8šEžE»?è8>}óù?è8>¨ŒV?è7ⶶ˜?è7â¸kXx?è7†î2±?è7†ïç?è7+$fÒ&?è7+&R?è6ÏYTD³?è6Ï[¾,?è6sŒúãÃ?è6sŽ¯VÅ?è6¿Z¹Ã?è6Á&N?è5»ðsÑ%?è5»ò(79?è5` F±”?è5`!û1?è5NÓ;¾?è5P‡”ä?è4¨|£Í?è4¨}Íö|?è4L¨G¨?è4L©Î“ß?è3ðÒÔ´’?è3ðÔˆúR?è3”ü8Iƒ?è3”ýìˆÌ?è39$DÃ?è39%øU”?è2ÝK3?è2ÝL¼AŒ?è2p„~E?è2r8ª'?è2%”¹ñ!?è2%–n‹?è1É·¨j?è1ɹ\=\?è1mÙO9Ú?è1mÛRT?è1ù¯Ê‹?è1ûcÜ?è0¶É3Ë?è0¶}?U?è0Z6œ&b?è0Z8P+t?è/þS(Ö?è/þTÜÔ¡?è/¢no#?è/¢p#7?è/Fˆo¢?è/FŠ# J?è.ê¡) ?è.ê¢Üü:?è.Ž¸C?è.ŽºQ'¼?è.2ÎËö?è.2Ðl5?è-Öã´O=?è-Öåh'?è-z÷WºŠ?è-zù ‹×?è- µ]?è- i'Ú?è,ÃÍçN?è,ë¨?è,g*¡?è,g,UJð?è, 90?è, :㼆?è+¯FyÖj?è+¯H-‡X?è+SR ?è+ST2µx?è*÷]?¬ü?è*÷^óP÷?è*›f¼ž?è*›ho· ?è*?nóÞ2?è*?p§u:?è)ãuç«4?è)ãw›;Â?è)‡{—Ýà?è)‡}Kgô?è)+€-?è)+·°·?è(σ,£?è(Ï„à &?è(s…œÙ?è(s†Å?è(…¢ ?è(‡U8?è'»„Üï-?è'»†XÝ?è'_‚Ò×+?è'_„†:a?è'ƒ© ?è'7Û?è&§zïnÂ?è&§|¢Å?è&Ku„×?è&KvÉÔ?è%ïmøõ?è%ïo¬>a?è%“e–Ÿ¤?è%“gIât?è%7[ð4Z?è%7]£p°?è$ÛQ@S?è$ÛR¸v.?è$DÖ R?è$F‰O°?è$#7c1?è$#9Yý?è#Ç(¬|T?è#Ç*_ž¼?è#k±¸¼?è#kdÔ©?è#s–?è# &«?è"²ôñôz?è"²ö¥p?è"Vá,ݽ?è"Vâßæ7?è!úÌ%…?è!úÍ؃?è!žµÙí?è!ž·Œè“?è!BžKÓ˜?è!BŸþÈž?è æ…{Ç?è æ‡.P?è Škg±X?è Šm™f?è .P¼?è .QÄ™?èÒ3y·ò?èÒ5,“?èvŸ[ä?èvR0}?èö‚Û?èø5©/?è½Ö$»?è½×׃0?èa´„aR?èa¶7"t?è‘¢Rn?è“U ?è©mí?è©o1É?èMH Ô?èMI̺€?èñ!sÀ1?èñ#&g_?è”ù|ù?è”û.©«?è8Ð1]l?è8Ñã÷¡?èÜ¥£S²?èܧUçi?è€yÓû?è€{…¤4?è$LÀ ?è$Nr‘Å?èÈjbš?èÈ âØ?èkîÒ£8?èkð…ù?è½øƒv?迪ö¹?賋܈Ø?賎õ?èWX~¼¶?èWZ1"ý?èû#ÞÕ­?èû%‘5v?èžíýY??èžï¯²Š?èB¶ÚPÄ?èB¸Œ£?èæ~uîù?èæ€(;H?èŠDÐ=??èŠF‚ƒ?è. éDô?è. ›„E?èÑÍÁ´Ü?èÑÏsí®?èuYN?èu’ L¢?èQ¯ÑX?èSaý.?è½Åã^?è½x´?è`Лƒ?è`ÒM¡ì?èŽ1 „?èã$Ü?è¨J†6h?è¨L8HA?èL›\Ì?èLMh'?èï¿pÛ¬?èïÁ"à‡?è“x“?è“y¸‘y?è7/\c;?è71[?èÚås#ä?èÚç%A?è~šJ9P?è~›ü$,?è"Mâ(Ç?è"O” $?èÆ;$ø?èÆíÕ?èi±U þ?èi³å\?è a§ð?è bÑxÍ?豚Œ?è±KÛé?èT¼Ó~C?èT¾…B ?èøhÌî¥?èøj~¬?蜆Bs?èœ7ùO?è?¼ÿò?è?¾°·N?èãe8b?èãfé½=?è‡ 1G†?è‡ âêá?è*±êƒ+?è*³œ ?è ÎVcø”?è ÎXŽî?è qùž¨"?è qûP7ú?è ›™zL?è K¤?è ¹ŸÎ?è \ÛÑëœ?è \݃gñ?è zÆ ?è {Á;Ý?è ¤µJ?è ¤À$œ?è G²Ï>?è G´€¦Ñ?è ëMQÌ?è ëOy?è Žæ”qð?è ŽèE;?è 2~™¦?è 2€JÖò?è Ö`x(?è ÖÆó?è yªé‡®?è y¬šÏ÷?è ?4âm?è @æ$4?èÀÒB‘l?èÀÓó̱?èddt•?èdeéX?èô¤çF?èöV‡?諃úDÚ?è«…«l˜?èOD?èOÃeP?èòžíio?èò ž„(?è–*‹”Ö?è–,<© ?è9´ìÏZ?è9¶Ý?èÝ>ï²?èÝ?Âöã?è€ÅéÖ?è€Çš×>?è$Ls÷È?è$N$ñô?èÇÑÀD‹?èÇÓq84?èkUÎJ2?èkW7W?èØž:Œ?èÚO!/?è²Z0¦?è²[á¢Å?èUÚ…™?èUÜ6rž?èùYœ3?èù[MpL?èœ×v|I?èœÙ'HÞ?è@TìÄ?è@UòÖ?èãÏrI?èãÑ# ?è‡I”Ä@?è‡KE}J?è*Âz<£?è*Ä*ï(?èÎ:"äl?èÎ;Ón?èq°?~?èq²?äü?è%¿f?è'o£_?çÿ¸™²dî?çÿ¸›býc?çÿ\ i»Û?çÿ\MÌ?çþÿ}äèÚ?çþÿ•tG?çþ¢î#ôœ?çþ¢ïÔy„?çþF]'bù?çþF^×á]?çýéÊï<›?çýéÌŸ´z?çý7{a8?çý9+Ò“?çý0¢ÌT’?çý0¤|¿g?çüÔ â^?çüÔ’ƒ®?çüwu¼¡O?çüwwlÿ?çüÝ\^$?çüß µj?çû¾CÁ ?çû¾Eq]Q?çûa¨êÞR?çûaª›(Ž?çû ÚW?çûŠšÐ?çú¨oVŸ?çú¨q?“Ð?çúKÑ œ?çúKÒºEH?çùï1:ä?çùï2ë·?çù’ /ö?çù’‘ÐY–?çù5íɨÊ?çù5ïyËä?çøÙJ7€S?çøÙKçœç?çø|¥i•ö?çø|§¬?çøÿ`C÷?çø S€?ç÷ÃXä‘?ç÷ÃYËí“?ç÷f¯›ÜY?ç÷f±KÞÖ?ç÷ à×p?ç÷ Óf?çö­Zë?çö­\šüŽ?çöP®ºœª?çöP°j‹“?çõôON”?çõôÿ6÷?çõ—R©Ÿÿ?çõ—TYÛ?çõ:¢ÉGr?çõ:¤y"Ç?çôÝñ®ðó?çôÝó^ÅÁ?çô?Z{í?çôA J5?çô$‹ËðÄ?çô${¸„?çóÇ×WÚ?çóÇس?çók!49?çók"°îë?çóiÅe_?çókuŠ?çò±±PŠ?çò±²ÿÊ.?çòT÷¡³ß?çòTùQZû?çñø<º Ø?çñø>i«m?çñ›€™R»?çñ›‚HìÈ?çñ>Ã?¼Á?çñ>ÄïPG?çðâ­QN?çðâ\ÞK?çð…DâÆ?çð…F‘Ÿ?çäÝ{D?çä0òu±Ä?çä0ô$Yû?çãÔèÿü?çãÔ —¡¨?çãw&_C?çãwÔúe?çã/.Q¶?çã0ÜæL?çâ½@ñ?çâ½BŸž)?çâ`Qm›Ë?çâ`S#K?çâ`³á?çâba“Ö?çá¦nÁ} ?çá¦po÷s?çáI{˜áþ?çáI}GUÜ?çàì‡9š½?çàìˆè?çà‘£®ô?çà“R»?çà2š×&Y?çà2œ…†”?çßÕ¢ÔYì?çßÕ¤‚³›?çßx©›QV?çßx«I¤y?ç߯,<ô?çß°Ú‰‹?çÞ¾³†ûÔ?çÞ¾µ5Aß?çÞa¶¬Œ?çÞa¸ZO ?çÞ¸›.?çÞºIgƒ?çݧ¹U?çݧ»5x?çÝJ¸ÙC†?çÝJº‡o`?çÜí·( >?çÜí¸ÖE‹?çÜ´Aò*?çܵðë?çÜ3°&oÈ?çÜ3±Ô‡ü?çÛÖªÖC4?çÛÖ¬„TÛ?çÛy¤QK†?çÛy¥ÿV ?çÛœ—z?çÛžE•?çÚ¿“©È?çÚ¿•WÈ?çÚb‰†‘v?çÚb‹4ˆé?çÚ~/…ƒ?çÚÝvj?çÙ¨q¤NË?çÙ¨sR9#?çÙKcåF.?çÙKe“)ù?çØîTòsY?çØîV P—?çØ‘DËÞ ?çØ‘Fy´º?çØ43qø?çØ45^?ç×× äƒ?ç××"‘Î?ç×z "§8?ç×zÐj@?ç×ø. ?ç×ùÌêƒ?çÖ¿á×û?çÖ¿ã…±?çÖbÊ\F?çÖbÌ Ì¤?çÖ±«Äz?çÖ³YmJ?çÕ¨—Æ~?çÕ¨™t Â?çÕK|¬ÌD?çÕK~Zg÷?çÔî`_)?çÔîb ›N?çÔ‘BÜâˆ?çÔ‘DŠq?çÔ4$&¹Æ?çÔ4%ÔAÍ?çÓ×<ä:?çÓ×êe³?çÓyãH?çÓyäÌ“2?çÓÀÍ…Î?çÓÂzú*?çÒ¿HÖ?çÒ¿žöCê?çÒbx—?çÒbz=þ[?çÒR¤ø­?çÒTRY\?çѨ+†S$?çѨ-3­C?çÑK4­Ú?çÑKâk?çÐíÙ°8?çÐíÛ]]9?çЮøÒˆ?çа¦ú?çÐ3ƒü*?çÐ3„¼< ?çÏÖUòl?çÏÖWŸ¥e?çÏy'¤J?çÏy)QO ?çÏø#Iþ?çÏùÐv2?çξÇp%?çξÉJª?çÎa•‹§\?çÎa—8Æo?çÎbuH~?纲>5¸?纲 éñô?çºT«»”5?çºT­gIÝ?ç¹÷7 ²?ç¹÷8¶.Ä?ç¹™Á+OG?ç¹™ÂÖ÷Å?ç¹?ç°ÕSÁH?ç°w¾°W"?ç°wÀ[[?ç°*¶$?ç°+ȳk?篼”^Ùµ?篼– Ðe?ç¯^ýs ,?ç¯^ÿE?ç¯e[çè?ç¯gÑk?箣ÌŒ?箣ÍÃbw?ç®F1¨ÍT?ç®F3S©¨?ç­è– wÑ?ç­è—¸MŽ?ç­ŠùF5^?ç­Šúñƒ?ç­-[S¬€?ç­-\þu ?ç¬Ï¼5kŒ?ç¬Ï½à-‚?ç¬rì?ç¬r–Ôb?ç¬zwkG?ç¬|" ?競××àÊ?競قŽù?ç«Y4 Wó?ç«Y5·ÿŠ?çªûÿ2?çªû 1?çªè÷´ô?çªê¢OZ?çª@A¬÷ ?çª@CW‹n?ç©â™7õ¢?ç©âšâ‚Ø?ç©„ï˜d?ç©„ñC?ç©'DÏ=F?ç©'Fy½L?ç¨É˜Û“Æ?ç¨Éš† 3?ç¨k믲ƒ?ç¨kíZ%W?ç¨=J©‘?ç¨>õÍ?称º5?称dšº?ç§RÜþ[)?ç§RÞ¨º3?ç¦õ+™¸?ç¦õ,Áò*?禗x¦ð?禗y¯øÈ?ç¦9ÃÈ°Ý?ç¦9Årü?ç¥Üa5c?ç¥Ü z ?ç¥~WÎê¹?ç¥~Yy(Æ?ç¥  &Ö?ç¥ ¡¼^I?ç¤Âç+·?ç¤ÂèÕH‘?ç¤e-s ?ç¤e.Ãà?ç¤qÝàR?ç¤sˆù?磩µx;ý?磩·"Y ?ç£K÷èÜ…?ç£Kù’òù?ç¢î9/ ?ç¢î:Ù¯ó?ç¢yM‹?ç¢z÷ Ë?ç¢2¸@˜8?ç¢2¹êšÞ?ç¡Ôö Øð?ç¡Ô÷´Ôü?ç¡w2¬Œ?ç¡w4Vþ?ç¡n$i!?ç¡oÎWø?ç »¨sM(?ç »ª5e?ç ]á™–?ç ]ãCw¼?ç –Òy?ç @­‚?矢Pk§Ò?矢R|@?çŸD†>?çŸD‡Áê?çžæºœ5×?çžæ¼Eý?瞈íø"?瞈ï¡ã.?çž+ +À¯?çž+!Õz²?çÍQ7Ô?çÍRáA?ç™ eþ´À?瘫…ë?瘫†¹ØÑ?ç˜M¤£Ûª?ç˜M¦M+ó?ç—ïÃjF?ç—ïĸ³ô?ç—‘àSÒ˜?ç—‘áý©?ç—3üp£?ç—3þ߇?ç–Öf1 ?ç–Öfã?ç–x14Z„?ç–x2݉À?ç–IÛtË?ç–K„j?畼a[Õ'?畼c÷)?ç•^wµ©?ç•^y^Ä?ç•Œè1?ç•Ž‘“ù?產 ôü,?產¢ž W?ç”D³Úþ?ç”Dµ„¥?ç“æÅš²p?ç“æÇC³a?瓈Ö4FÂ?瓈×ÝA?ç“*å§èŠ?ç“*çPÜA?ç’Ìóõìø?ç’ÌõžÚ?ç’oâº?ç’oÆÉ6?ç’ nj?ç’ÉNH?瑳ýn?瑳¦G_?ç‘U!´ç£?ç‘U#]ºE?ç÷*9kN?ç÷+â7S?ç™1‰çn?ç™32¬Õ?ç;7³7+?ç;9[õô?çÝ<¶uµ?çÝ>_-à?ç@“ Ê?çB;»W?ç!CIH;?ç!Dñó)?çŽÃDÙ­v?çŽÃF‚QÆ?çŽeEC L?çŽeFì=þ?çŽD‡0?çŽF04D?ç©B¥øá?ç©DN‰V?çK?ž‘,?çKAG?çŒí;qkŽ?çŒí=îÅ?çŒ6, ?çŒ7Ǩ¡?çŒ1/§°k?çŒ11P&d?ç‹Ó( ®é?ç‹Ó)³D?ç‹uHó?ç‹u ñ[Ø?ç‹b3?çŠZþ&3ø?çŠZÿΈ×?ç‰üðÑN¼?ç‰üòyœû?牞âWÊŠ?牞ä)?ç‰@Òºr×?ç‰@Ôb³×?çˆâÁø®µ?çˆâàé?爄°ÒÎ?爄±»?çˆ& 3È?çˆ&ž±`é?ç‡ÈˆÛ¯?ç‡ÈŠƒÖ?ç‡jsŠš ?ç‡ju2º‚?ç‡ ]úš?ç‡ ^¾Û?熮E~$ ?熮G&6¬?ç†P,Â¥¹?ç†P.j±º?ç…òäJð?ç…òŒPQ?ç…“÷âÊ ?ç…“ùŠÈÍ?ç…5Û°šÐ?ç…5ÝX’ð?ç„×¾MLÖ?ç„׿õ>V?ç„yŸÅ8U?ç„y¡m#5?ç„€Ù?ç„À½U?烽_Hª×?烽`ðˆu?çƒ_=Tc®?çƒ_>ü:«?烠?çs‹VÌ°p?çs‹Xsj?çs-ïë€?çs-–žŠ?çrέó4S?çrί™àº?çrpWÖÁ?çrpY}5ƒ?çršQL?çr@ði?çq³¨>}É?çq³©åB?çqUNÃ?çqUPi«ä?çpöô(RR?çpöõÎÝ?çp˜˜nz?çp˜šþŒ?çp:;•n­?çp:=;ì“?çoÛÝ\x?çoÛßCÓ¸?ço}~†–Ø?ço}€-s?çoPÔ?ço÷>?çnÀ¼ü¶%?çnÀ¾£u?çnbZŠ¥?çnb\0wP?çnöø·Ü?çnøŸ â?çm¥’<6Q?çm¥“â…²?çmG,S??çmG-ù‡»?çlèÅJ¯Ù?çlèÆðñî?çlŠ]"´¥?çlŠ^Èð?çl+óÛQê?çl+õ†³?çk͉tŒ2?çkÍ‹ºV?çkoîÝÇ?çko•D?çk±Iü³?çk²ð‹?çj²C†¾?çj²E,.ð?çjSÔ£Çd?çjSÖIÚð?çiõd¢£z?çiõfH°_?çi–ó‚ÔÇ?çi–õ(Û?çi8Dü·?çi8‚êüO?çhÚ èÑc?çhÚŽÊU?çh{™nWT?çh{›IŸ?çh#Ö¹?çh%{ô]?çg¾­ê?çg¾®ÅÏ?çg`5KØÊ?çg`6ñ·!?çg¼Zv"?çg¾MÒ?çf£BKxD?çf£CñIM?çfDÇã¼?çfDÈÄ®?çeæJÕ2©?çeæLzöd?çe‡ÍnÀ?çe‡ÏMÓ?çe)Nê´-?çe)Pj™?çdÊÏIïÚ?çdÊÐ?çdlNŒ–§?çdlP2?Ä?çd ̲…ò?çd ÎX(h?çc¯I¼œ?çc¯Ka¬j?çcPÅ©;*?çcPÇNÐQ?çbò@y»á?çbòBJ`?çb“º.[ ?çb“»Óâã?çb52Æö?çb54lw>?çaÖª6¦i?çaÖ«Ü ð?çax |Ü?çax""º?ça•¥0$?ça—J[?ç`» °‘|?ç`» Uø ?ç`\|Ÿ+{?ç`\~D‹a?ç_ýîp´?ç_ýð Y?ç_Ÿ_%}Ø?ç_Ÿ`ÊÐm?ç_@ν´?ç_@Ðbÿõ?ç^â=93É?ç^â>Þy ?ç^ƒª˜O?ç^ƒ¬=Ž*?ç^%ÛYÃ?ç^%€‘µ?ç]Æ‚/Š?ç]ƃ§`Ô?ç]gì ü1?ç]gí²&Ñ?ç] Tü%?ç] V¡6?ç\ª¼Ï'q?ç\ª¾tD¿?ç\L#†µ”?ç\L%+Ì9?ç[í‰"çÔ?ç[íŠÇ÷Ð?ç[Ží£tM?ç[ŽïH}Ÿ?ç[0Q†L?ç[0R­ˆõ?çZѳRå^?çZÑ´÷á]?çZs‚ Ž?çZs'ä?çZt–<?çZv;*Æ?çYµÓÿ|?çYµÕ4ç?çYW1nÒ¾?çYW3´?çXøŽ3:?çXø×âé?çX™éÜò:?çX™ëÆ??çX;Dl”ü?çX;FbW?çWÜâÃ?çWÜŸ†ât?çW}ö=±Ï?çW}÷âqÕ?çWM4X?çWO#í´?çVÀ£¦§¢?çVÀ¥KZT?çVaø´Òõ?çVaúY~ü?çVLœhÁ?çVNA?çU¤Ÿ\»?çU¤¡,m?çUEñá?çUEò¦y?çTçAŒ´£?çTçC1F?çTˆü—j?çTˆ’¡"?çT)ßRPB?çT)àöÔI?çSË,G*?çSË.1Ć?çSlx®ö?çSlzR’¦?çS ôҔ?çS ÅYBš?çR¯ ¡•ë?çR¯EÿE?çRPVtù?çRPX~¨?çQñž-+|?çQñŸÑ‡?çQ’äÌzt?çQ’æpÏÌ?çQ4*R Ð?çQ4+ö[|?çPÕn¾©.øN?çN>0œgg?çMßjÈ&?çMßlAÚÇ?çM€¥+2.?çM€¦Ï>#?çM!Þ BN?çM!àDG—?çLÃýJC?çLáHß?çLdNBtâ?çLdOælÑ?çL„oŸ5?çL†w?çK¦¹…AÚ?çK¦»),p?çKGíƒ9Ù?çKGï'Â?çJé i²?çJé" B?çJŠR8®S?çJŠSÜ„ã?çJ+‚ãÿm?çJ+„‡ÏP?çI̲j¦?çIÌ´oH?çImàØšw?çImâ|]?çI.{¯?çIÒ7Š?çH°:kØÂ?çH°<ð?çHQeÜ4?çHQg4Š´?çGòžKà?çGò‘Aó³?çG“¸“¶Õ?çG“º7Wú?çG4àqGŽ?çG4ââ?çFÖ7(ˆ?çFÖÚ¼R?çFw,å„/?çFw.‰L?çFQ|^*?çFSä™?çE¹tüÀ?çE¹vŸ‡?çEZ—d„Š?çEZ™ý?çDû¸µþÿ?çDûºYqc?çDœØðz½?çDœÚ“æt?çD=øI?çD=ù·® ?çCß!Ö?çCßÄ~0?çC€3ž ?çC€4ºõµ?çC!N÷ v?çC!Pšñs?çBÂiÁ*º?çBÂkdu?çBcƒt´Ó?çBc…øs?çBœôÒ?çBµ1Ã?çA¥³™b¬?çA¥µ<˜î?çAFÊ ÛB?çAFË® Õ?ç@çßfÖ€?ç@çá ÿd?ç@ˆó­ €?ç@ˆõP,µ?ç@*Ýï-?ç@* ³?ç?Ëùˆ%?ç?Ëœœü?ç?l)ÿ²M?ç?l+¢Àt?ç? 9ðå…?ç? ;“ìý?ç>®HÍ%p?ç>®Jp&9?ç>OV‡Û|?ç>OX*Õ•?ç=ðc ¸?ç=ðdÃs#?ç=‘n¢ÿ‚?ç=‘pEì=?ç=2y^2?ç=2z²D=?ç<Ó‚eì‹?ç<Ó„Ëæ?çý?ç8¾¡›K”?ç8¾£=á\?ç8_ôÏ?ç8_Ÿ—ç?ç8™9!Û?ç8šÛªA?ç7¡“iɹ?ç7¡• Ko?ç7BŒ†V?ç7BŽ(Ñ?ç6ã„Žðæ?ç6ã†1e;?ç6„{ƒvá?ç6„}%ä„?ç6%qd¬“?ç6%s…?ç5Æf2!b?ç5ÆgÔ¢?ç5gYëÿJ?ç5g[ŽXÙ?ç5L’½†?ç5N5d?ç4©>&(?ç4©?È^T?ç4J.¦'(?ç4J0Hl£?ç3ëM?ç3뵋å?ç3Œ m­÷?ç3Œæ?ç3,ùµ&r?ç3,ûWWØ?ç2Íåê-´?ç2ÍçŒXh?ç2nÑ`ð?ç2nÒ¢„ó?ç2ºö l?ç2¼˜½¼?ç1°£ÙiR?ç1°¥{ñ?ç1Q‹¨˜?ç1QJ¨?ç0òrd $?ç0òt^?ç0“X €s?ç0“Y®‚û?ç04<¡@?ç04>C;ô?ç/Õ "åŠ?ç/Õ!ÄÚ­?ç/v‘ÀÙ?ç/v3¯I?ç/ãía_?ç/åI?ç.·Ä6N?ç.·Å×øY?ç.X£læ?ç.X¥Z>?ç-ùø?ç-ùƒ1מ?ç-š^¡@Ã?ç-š`C µ?ç-;: Ã?ç-;aÔ?ç$­Øßê?ç$N™ˆûô?ç$N›*!U?ç#ïZ‡_?ç#ï\c¦ ?ç#ëz,?ç#Œ’$?ç#0Úý‚?ç#0Û¥Å?ç"ј í²?ç"Ñ™¬ø@?ç"rUšS?ç"rV¤ž+?ç"ë,Ž?ç"Œ)±?ç!³ËÂZL?ç!³ÍcPº?ç!T…‰¿ø?ç!T‡*¯±?ç õ>A`K?ç õ?âIN?ç •õèñ2?ç •÷‰Ó€?ç 6¬?ç 6®!ê¦?ç×b âÿ?ç×cª·â?çxƒ"ö?çx#ñ#?çÉí}?çËåó?ç¹|Gþ¶?ç¹}è¿w?çZ-“ì½?çZ/4¦È?çúÝÐÄô?çúßqxI?盌ÿ#•?盎ŸÐ4?ç<;¾ž?ç<<¿d‡?çÜè/¿/?çÜéÐ^b?ç}”2Nc?ç}•Òæß?ç?&nû?ç@ÇÀ?ç¾é –Ä?ç¾ê­!Ô?ç_‘äÈy?ç_“…LÒ?ç9®à?ç;O^!?ç à_UC?ç áÿÌ.?çA…õ€`?çA‡•ð”?çâ*|IË?çâ,³H?ç‚Íô¤?ç‚Ï”ck?ç#p]@ª?ç#qýœ¹?çÄ·¿©?çÄX?çd²̶?çd³¤X?çQACó?çRá‹Ý?ç¥ïpšÀ?ç¥ñÛò?çFŒ‘†÷?çFŽ1Ár?çç(¤¤:?çç*D×þ?ç‡Ã©‚?ç‡ÅI¯)?ç(] I^?ç(_@o²?çÈö‰â,?çÈø*É?çiŽeŒ?çi¨q?ç %3ÆÊ?ç &ÓØø?窺ôŠW?窼”•Ì?çKO¨O{?çKQHT8?çëãN¥Ø?çëäî£Þ?çŒuè(ô?çŒwˆ A?ç-tÛdN?ç 5‘PÐ?ç 5’ðU•?ç ÖöT‘?ç Ö•Òß?ç v³#?ç v‘/*¸?ç  ˜?ç ¼…s?ç ·‰ž¡H?ç ·‹> i?ç X5.?ç X³˜–?ç ø~Dó?ç ø¡¡?ç ˜ø܆o?ç ˜ú{Üb?ç 9q/H?ç 9rΗV?ç ÙèvŒ(?ç ÙêÔ¨?ç z^²Ç0?ç z`Rö?ç ÓãÕ6?ç ÕƒA?ç»H ¸d?ç»I¨ì¶?ç[»$¿.?ç[¼ÃìÅ?çü-58?çü.Ô^Ý?眞:Ø¿?真Ùøà?ç=6ü?ç=Õ/c?çÝ}&˶?çÝ~ÅÞc?ç}ë ü"?ç}ì¬?çWéAá?çYˆG?ç¾Ã»RÜ?ç¾ÅZQX?ç_.ƒ}v?ç_0"u8?çÿ˜Aéø?çÿ™àÚþ?ç öš‚?ç •„Í?ç@h¡·Z?ç@j@šê?çàÏChÂ?çàÐâE—?ç4Û°à?ç6z†ù?ç!™jÞ ?ç!› ­i?çÁüå~?çÁþ„F°?çb_J£ñ?çb`éeØ?çÀ¥q%?çÂD,P?ç£ öY½?ç£"•-?çC€<íg?çCÛ›?çãÞyz%?çãà!?ç„;¬t?ç„=K??ç$—Õ¶Ï?ç$™tPP?æÿÄòõ]?æÿÄô“±!?æÿeM jÆ?æÿeN©öÎ?æÿ¦+Í?æÿ§¶±?æþ¥þ‰X?æþ¥ÿºç?æþFU÷b?æþFV´o5?æýæ«wÌ?æý欥èã?æý†ÿïæh?æý‡ŽPÃ?æý'SÏ‘*?æý'UmôÈ?æüǦ¦ë÷?æüǨEHØ?æügøu`¢?æügú¶Æ?æüI;¯?æüJÙþ€?æû¨˜ùg2?æû¨š—¯Ý?æûHç¯"Ö?æûHéMdÄ?æúé5\ãÝ?æúé6û?æú‰‚¬(?æú‰ƒ àœ?æú)Í Wš?æú)Ï>…Q?æùÊ6€?æùÊÔ¦ÿ?æùjaÅ'F?æùjccGƒ?æù ªL)C?æù «êBÂ?æøªñËùÆ?æøªój ˆ?æøK8Dt·?æøK9※?æ÷ë}µçá?æ÷ëSí'?æ÷‹Â U$?æ÷‹Ã¾S­?æ÷,ƒ˜m?æ÷,!8?æöÌGÕ–?æöÌIrù£?æöl‰»œ?æölŠ±¥ë?æö ÉJ£Ë?æö Êè‡\?æõ­yœÈ?æõ­ yœ?æõMF Î?æõMH>¤3?æôíƒÀ«,?æôí…^zƒ?æô¿ØÃÀ?æôÁvŒY?æô-úé×?æô-ü‡˜ì?æóÎ4óšÚ?æóÎ6‘Uö?æónmö6¢?æóno“ë?æó¥ñÑç?æó§†?æò®Üæº?æò®Þ„`ï?æòOÔ¤ä?æòOrE?æñïG¼+’?æñïIYÄö?æñ{ê?æñ}:–?æñ/®w{I?æñ/°.?æðÏàKß ?æðÏáéd1?æðp¿?æðp·=†?æð@á´¤?æðB,L?æï°o£ç ?æï°qAWö?æïP`2?æïPžýœ:?æîðÊ—I?æîð˳ú´?æîõǯÀ?æî÷e l?æî1 s1P?æî1"‡?æÉn6ê‘ý?æÉn8…QC?æÉ ý¾?æÉ ÿ'Ñ>?æÈ­Ã1‰î?æÈ­ÄÌ;§?æÈM‡Ø|!?æÈM‰s'?æÇíK¥*?æÇíMIV?æÇ-?æÇǵæ?æÇ,ÏÛ4ƒ?æÇ,ÑuË"?æÆÌy?æÆÌ’ì?æÆlPõ?æÆlQ¹~?æÆ ¾-ñ?æÆ X°;?æÅ«Ì_5˜?æÅ«Íù±?æÅK‰ú/?æÅKŠœnê?æÄëD¦´W?æÄëFA"K?æÄŠÿMdˆ?æÄ‹ç˵?æÄ*¸öC]?æÄ*º£Ã?æÃÊq¡œ?æÃÊs;õ·?æÃj)O$h?æÃj*éw>?æà ßÿ'•?æà á™s£?æ©•±ðÚ?æ©—L6!?æÂIJg5ï?æÂILtn?æÁèþz'?æÁèÿ¹±Þ?æÁˆ°Ú«F?æÁˆ²tÜ6?æÁ(b™Ü?æÁ(d3,?æÀÈZ‘?æÀÈô´g?æÀgÃYH?æÀgĹuß?æÀqç€s?æÀs–B?濧³,`?濧!M;f?æ¿FÌ‚•Ž?æ¿FÎÌ?æ¾æxU¼v?æ¾æyï½ì?澆#,¡Œ?澆$Æœ9?æ¾%͵Z?æ¾%Ρ©??æ½ÅuæÀP?æ½Åw€­l?æ½eÉè>?æ½ecΑ?æ½ıÂò?æ½ÆK¢}?漤jÎ7?漤l7¦ú?æ¼DŽz†?æ¼D(L?æ»ã³ƒí¥?æ»ãµ¸Õ?滃V~¸?滃XÇ?æ»"ø}Þ?æ»"úÂ|?æºÂ™vÛ?æºÂ›‘Û?æºb9j„Ú?æºb;4æ?æºØbFl?æºÙûï¯?湡v]ú?湡w÷?æ¹A]ì;?æ¹A÷‡ê?æ¸à¯bÔ?æ¸à°ûº?渀Jj›0?渀L)M?æ¸äwÈÎ?æ¸æP!?æ·¿}‰9?æ·¿"ÿÂ?æ·_ .{?æ·_9¨;?æ¶þ¬»žÚ?æ¶þ®UÐ?涞BÜr?涞Dutž?æ¶=صþ?æ¶=Ù›`?æµÝl,• ?æµÝmÅó¤?æµ|ÿ\“.?æµ}õêü?浑’ \?浓+q_?æ´¼"ÍOh?æ´¼$f™¡?æ´[³ â?æ´[´§QQ?æ³ûBT¦z?æ³ûCíã?泚С+ý?泚Ò:a×?æ³:]óŒ?æ³:_Œ»?æ²ÙêL#Ê?æ²ÙëåL?æ²yu«+e?æ²ywDLß?æ²3O?沩Mþ?汸‰{õÜ?汸‹ Á?æ±Xî;`?æ±X‡Hz?æ°÷™g®?æ°÷›ý?æ°—ç 0?æ°—!€ ´?æ°6¥m˪?æ°6§Äc?æ¯Ö)û“?æ¯Ö+”…?æ¯u­˜{?æ¯u¯)ƒ?æ¯0,¤5?æ¯1ňŒ?æ®´±Æ ?æ®´³^ó—?æ®T2\U?æ®T3ôÚ?æ­ó±øKc?æ­ó³‘X?æ­“0šî!?æ­“23·J?æ­2®D[?æ­2¯Ýb?æ¬Ò*ôG¡?æ¬Ò,3?æ¬q¦ªþA?æ«P‘Þ£?æªï‹Ì}?æªïe¦?檦ôò?æª?‡¼?æª.xˆð?æª.z!|?æ©Íír“¥?æ©Íï ×?æ©macÌâ?æ©mbüKG?æ© Ô\Ór?æ© ÕõK ?樬F]Ìc?樬Gö=0?æ¨K·fÊ2?æ¨K¸ÿ42?æ§ë'wñå?æ§ë)U?槊–‘ 4?槊˜)ü›?æ§*³ŠÎ?æ§*Kàh?æ¦ÉqÝÖº?æ¦Ésv%‡?æ¦hÞ»Ž?æ¦hß©Ž?æ¦IL^P?æ¦J䟄?楧³¾è?楧µ(ùO?æ¥GÞ9þ?æ¥Gvm—?æ¤æ…4Ïz?æ¤æ†ÌüF?椅ì”H?椅î,¥G?æ¤%Rý€í?æ¤%T• ?æ£Ä¸oùk?æ£ÄºÏ?æ£dë±?æ£dƒÂ¥?检q)‚?棂 4L?梢âön’?梢äŽr?æ¢BDz½©?æ¢BFº×?æ¡á¥Ì?æ¡á¦  -?æ¡žx?æ¡5ñ ?æ¡ c<Ðq?æ¡ dÔ¹6?æ ¿Àä·ô?æ ¿Â|™ë?æ _–º?æ _-Üã?æŸþyPcX?æŸþzè7³?æŸÔK?æŸÕ¬?æŸ=-ᧂ?æŸ=/ynA?æžÜ†¸vÛ?æžÜˆP6Ì?æž{Þ™(S?æž{à0áu?æž5ƒ»“?æž7mç?溋xº?æºÉ@?æYàv˜{?æYâ=2?æœù4u~?æœù6g?朘‡’je?朘‰*?æœ7Ù° Ø?æœ7ÛG›#?æ›×*Øú?æ›×,o¨v?æ›v{ ¦v?æ›v|¢)$?æ›ÊH"h?æ›ËßžG?æšµZø?æšµ'Ð?æšTeã‡F?æšTgzõ†?æ™ó²AËò?æ™ó³Ù3c?æ™’ý«Mœ?æ™’ÿB®>?æ™2H a?æ™2I·x4?æ˜Ñ‘ bà?æ˜Ñ“7µä?æ˜pÚ,R.?æ˜pÛÞb?æ˜!ô}?æ˜#Zùâ?æ—¯hføP?æ—¯iþ6æ?æ—N®åá?æ—N¯­§?æ–íòÐÙ1?æ–íôh '?æ–6ŽUÃ?æ–8%ê?æ–,yM?†?æ–,zäbÝ?æ•Ë»[?æ•Ë¼®9â?æ•jûìoé?æ•jýƒ… ?æ• ;Í£?æ• =d Š?攩z¹c?攩|Pz?æ”H¸°ÓÙ?æ”HºGÕ ?æ“çõ´?æ“ç÷K{?擇1ÃO?擇3ZB¬?æ“&lÞSY?æ“&nu@/?æ’ŧ[¸?æ’ŨœA¾?æ’dà8yø?æ’dáÏY-?æ’w¿ô?æ’˜X?æ‘£OÃd`?æ‘£QZ5ô?æ‘B†‹ƒ?æ‘B‡²VF?æỀG.?æá½ ?æ€ïñ–Ã?æ€ñˆSå?æ #oŒ?æ %Bg?æ¿Uú§–?æ¿W‘W?æ^‡’ÃÄ?æ^‰)ls?æŽý¸7Í?æŽý¹Îon?掜çê2ö?掜é€Î?æŽ<©àå?æŽ<@u!?æÛDvé,?æÛF v–?æzqQ¹º?æzrè@S?æ:-?æžÐ¬Ú?挸È00*?挸ÉÆ© ?æŒWò4h+?æŒWóÊÚP?æ‹÷Feð?æ‹÷ÜÑC?æ‹–Cf©Ã?æ‹–DýD?æ‹5j•.?æ‹5l+kÞ?æŠÔÑî ?æŠÔ’hE~?æŠs¶(?æŠs·©Ý4?æŠÚYd&?æŠÛï­`?扱ý¬Îó?扱ÿC[?æ‰Q •x?æ‰Q!£Ñ?æˆðA|J ?æˆðC~Ï?æˆaø´•?æˆcŽâ‡?æˆ.ƒ m?æˆ.ƒ2Œ?æ‡Í —??æ‡Í¡±·?æ‡l½Â2e?æ‡l¿XKà?æ‡ Úw%Œ?æ‡ Ü 84?憪ö:”›?憪÷Рq?æ†J ~¬?æ†J¢ƒ¯?æ…é*ìâà?æ…é,‚á?æ…ˆCÜ Ý?æ…ˆEr;?æ…'[Úˆ?æ…']p?æ„ÆræÓ×?æ„Æt|½?æ„e‰Ðô?æ„eŠ˜³Ú?æ„ž-ÖÔ?感òæ?惣²h¹?惣³ýðø?æƒBűÕß?æƒBÇG¤K?æ‚áØ ò?æ‚áÙ ¹›?æ‚€és“ü?æ‚€ë TÁ?æ‚ùì;|?æ‚ûõo?æ¿ t°„?æ¿ c£?æ^ Ís?æ^¢y¾?æ€ý%µó?æ€ý'J·k?怜2mjÂ?怜4 g?æ€;>6?æ€;?Ë¥ß?æÚI2?æÚJ¤Âÿ?æyRø±?æyTŽ;0?æ[òøR?æ]ˆ{§?æ~·cýô¢?æ~·e“q$?æ~Vk^{?æ~Vl¥Ô(?æ}õq)i‘?æ}õr¾Øk?æ}”vREô?æ}”wç­ù?æ}3z‹;ä?æ}3| ?æ|Ò}ÔÝ?æ|Òi[:?æ|q€-]v?æ|q°þ?æ|–â‚?æ|ƒ,/6?æ{¯‚ÅÞ?æ{¯ƒ¦ ½?æ{N›O¼?æ{Nƒ0ŽÇ?æzí€6~ô?æzíË·+?æzŒ}âR`?æzŒwƒÂ?æz+zŸ$‚?æz+|4O?æyÊvláÚ?æyÊx’?æyiqK›œ?æyir฀?æyk;¬:?æylÐÂH?æx§d<íì?æx§eÑý&?æxF\O¨Î?æxF]ä±3?æwåSt$ü?æwåU &Œ?æw„Iª*^?æw„K?%?æw#>ñ¥?æw#@†™f?ævÂ3K'·?ævÂ4àÇ?æva&¶Â(?æva(K¨b?æv4<¾?ævÉ#?æuŸ Äy?æuŸ Xï?æu=ûfD?æu=üúèþ?ætÜëb”?ætÜì¯-x?æt{ÙáwZ?æt{Ûv;i?ætÇ»„?ætÉOÚ½?æs¹´§x€?æs¹¶<.â?æsX ¦«Á?æsX¢;[N?ær÷‹¸Èf?ær÷Mq?ær–uÞ$?ær–wr¦?ær5_ 1?ær5`¡Ì˜?æqÔGE¾?æqÔHÚRI?æqs.x(?æqs0%†?æqí•9?æq‚Á?æp°ú]à?æp°ûñ“’?æpOÞß)‹?æpOàs¢f?æoîÂsù`?æoîÄke?æo¥¦„?æo¦°³?æo,†Ö/Š?æo,ˆj“â?ænËg¤®?ænËi8^/?ænjG„˜ ?ænjIïK?æn &x¬ª?æn ( ü~?æm¨€Ž?æm¨M‹?æmFášçô?æmFã/*?ælå½É0ï?ælå¿]l>?æl„™ K¥?æl„šŸ€?æl#sa$?æl#tõ?Ä?ækÂLʹÊ?ækÂN^à”?æka%HŠ0?æka&ܪ"?æjÿüÚ”)?æjÿþn­C?æjžÓ€Ä ?æjžÕÖL?æj=©;ac?æj=ªÏlÏ?æiÜ~ XŽ?æiÜž]"?æi{Qíº`?æi{S¸?æi$åòß?æi&yéÄ?æh¸öó£?æh¸ø†ð°?æhWÈâ:?æhWɨËp?ægö˜K¨x?ægö™ßŠÕ?æg•g—šâ?æg•i+vh?æg45ø¥Ò?æg47Œz€?æfÓo5=?æfÓ?æfqÏû5y?æfqÑŽüv?æf›“nc?æf'.ˆ?æe¯f7áö?æe¯gË›C?æeN/ð´Õ?æeN1„gI?ædìø¾þ?ædìúQÇ›?æd‹À §?æd‹Â4LT?æd*‡˜1?æd*‰+½?æcÉM¤“p?æcÉO8*ƒ?æchÆ]²?æchYíì?æcÖýj?æcØó|?æb¥šIÉ/?æb¥›ÝK¸?æbD\«ÔQ?æbD^?P?æaã#S6?æaã¶È?æaÞ°zÐ?æaàCèÏ?æa žS¤x?æa Ÿç ž?æ`¿] Î?æ`¿^ .Ë?æ`^Û÷6?æ`^oP©?æ_ü×Áe¾?æ_üÙT¸W?æ_›“½4?æ_›•PQõ?æ_:NÎûR?æ_:Pb@9?æ^Ù÷gË?æ^Ù Š¥Ù?æ^wÂ6’·?æ^wÃÉÉì?æ^zŒV?æ^|†\?æ]µ1ù ?æ]µ3ŒF¡?æ]Sè|Ô/?æ]SêöÖ?æ\òž0Ê?æ\òŸªL˜?æ\‘RÉ n?æ\‘T\ b?æ\0’„?æ\0%Ÿ?æ[ιrl?æ[λsW?æ[mkj[Ë?æ[mlý\1?æ[ yÔñ?æ[  Î~?æZªÌ Õà?æZªÎ3È’?æZI{ßÉæ?æZI}rµ¾?æYè*-¶Æ?æYè+À›Ä?æY†×‰ë?æY†ÙÉ1?æY%ƒýrj?æY%…I³?æXÄ/‡ËÉ?æXÄ1œ8?æXbÚ)b8?æXbÛ¼+Ì?æXƒâ|m?æX…u?&?æW ,³P?æW .EÂ/?æW>Ô›?æW>Ö-Å ?æVÝ{šò¤?æVÝ}- Í?æV|!²uŠ?æV|#EÙ?æVÆáÍS?æVÈtmÇ?æU¹k)@¦?æU¹l»Ú??æUXˆ»r?æUXN0?æTö±r3?æTö²’þ?æT•R™h?æT•T#o?æT3ó9?æT3ôË›,?æSÒ’úC•?æSÒ”Œºæ?æSq1Ô 5?æSq3f{ª?æSÏƨ^?æSÑYù?æR®lÑâ¸?æR®ndEw?æRMö[~?æRM ˆ·a?æQë¤3È>?æQë¥ÆF?æQŠ>ŠKH?æQŠ@™t?æQ(×ú=H?æQ(ÙŒ„™?æPÇpƒœT?æPÇrÜÉ?æPf&x’?æPf ¸²+?æPžâôR?æP u'?æO£4¹V?æO£6Kù?æOAÉ©e™?æOAË;ŠŸ?æNà]³iZ?æNà_E‡ƒ?æN~ð׃Ÿ?æN~òišì?æNƒ _?æN„§°Ï?æM¼e{?æM¼÷‹?æMZ¤ÆÜ?æMZ¦X ”?æLù4@ Ö?æLù5Ò²?æL—ÂÓЫ?æL—ÄeŪ?æL6P+%?æL6RG?æKÔÝHÿ?æKÔÞÚE?æKsi)  ?æKsjºî ?æKô#Ç?æKõµ¡?æJ°~8}å?æJ°ÊP•?æJOgvÒ?æJOùB¥?æIí°ž?æIí‘Bc?æIŒ9Æ?æIŒ¥÷ß?æI*’YÜ?æI*Ÿ$?æHÉ#*ü?æHÉ$¼¬}?æHg§ÞŠÝ?æHg©p4_?æH+¬ñÎ?æH->”s?æG¤®–¬?æG¤°'¸t?æGC0šQ™?æGC2+æ‚?æFᱹĚ?æFá³KR¦?æF€1ôah?æF€3…è—?æF±J%×?æF²Û¦(?æE½/»Ä`?æE½1M=Ô?æE[­H¼[?æE[®Ú.ñ?æDú)ñeè?æDú+‚Ñ ?æD˜¥µÐä?æD˜§G5¾?æD7 •û?æD7"'Y?æCÕš’*¡?æCÕœ#À?æCtª·„?æCt<Å?æC‹ßi`?æCp²Ã?æB±0P?æB±Á’š?æBOy±¥?æBO{.íL?æAíï'ã?æAíð¸Ò¬?æAŒcÅ”Ã?æAŒeV­?æA*×w ?æA*ÙG©?æ@ÉJDW1?æ@ÉKÕw^?æ@g¼-~A?æ@g½¾—?æ@-2·o?æ@.ÃÉß?æ?¤TT?æ?¤žåå?æ?C ‘žŽ?æ?C"£A?æ>ázë¡Ê?æ>á||Ÿž?æ>èaã…?æ>éòÚz?æ>Tô©k?æ>V…™?æ=¼À¤9.?æ=¼Â5"e?æ=[+p¢_?æ=[-„·?æ<ù•Y¬{?æ<ù–ê‡ô?æ<—þ_Ó:?æ<—ÿð§Ô?æ<6f‚ð!?æ<6h½Ý?æ;ÔÍÃZÚ?æ;ÔÏT!¶?æ;s4!î?æ;s5±Ðê?æ;™œ3ö?æ;›,í?æ:¯þ4Á~?æ:¯ÿÅs»?æ:Naë#)?æ:Nc{·?æ9ìÄ¿t?æ9ìÆO²ó?æ9‹&°¶÷?æ9‹(AT—?æ9)‡ÀtH?æ9)‰Q ?æ8ÇçîCñ?æ8Çé~ÓÐ?æ8fG:#~?æ8fHʬ~?æ8¥¤X€?æ8§4Ú ?æ7£,à~?æ7£½[¾?æ7A_ÓË?æ7Aad?d?æ6ß»™]ž?æ6ß½)Ë?æ6~}•Ñ?æ6~ üq?æ6p€§'?æ6rç?æ5ºÉ¢¡!?æ5ºË2ú?æ5Y!Û.?æ5Y#k€?æ4÷y)ÚÂ?æ4÷zº%á?æ4•Ï–¦x?æ4•Ñ&ê·?æ44%!Äo?æ44&²Í?æ3ÒyË1î?æ3Ò{[hl?æ3pÍ“">?æ3pÏ#QÛ?æ3 y’­?æ3" »i?æ2­r~Èp?æ2­têK?æ2KâäÊ?æ2KÅ2ÿÅ?æ1êåå ?æ1êuù#?æ1ˆcGüc?æ1ˆdØ œ?æ1&±É^?æ1&³Ydf?æ0Äÿiãi?æ0Åùâà?æ0cL)›¹?æ0cM¹”O?æ0˜Þ!?æ0™˜ÏÖ?æ/ŸãËÔ?æ/Ÿä—¶¨?æ/>-&,B?æ/>.¶4?æ.Üvdzl?æ.ÜwôW}?æ.z¾ÂÅ’?æ.zÀR›Á?æ.@Õ"?æ.Фo?æ-·Lß6 ?æ-·Nnþw?æ-U’‹Ñ?æ-U”-M[?æ,ó×|Ql?æ,óÙ ?æ,’{¨?æ,’ [Ï?æ,0^›i?æ,0`+ë?æ+Π۵œ?æ+΢k[ ?æ+lâ<äÅ?æ+lã̃ç?æ+ "¾Ïë?æ+ $Nh+?æ*©ba¼?æ*©cñMx?æ*G¡%¸ˆ?æ*G¢µC?æ)åß æ^?æ)åàšiø?æ)„Bè?æ)„ ¿Ÿ?æ)"X0ûé?æ)"YÀq½?æ(À“iŽ?æ(À”ø€?æ(^ÍÁ´C?æ(^ÏQS?æ'ý;ï?æ'ýÊf?æ'›?Õ6o?æ'›Ad»?æ'9w3Ù?æ'9y‡A?æ&×®lAô?æ&ׯûŽz?æ&uäiž?æ&uåøÇA?æ&‡Ì?æ& Õ?æ%²MÇwô?æ%²OV¯Ñ?æ%P(pf?æ%P‚·¡`?æ$Äf?æ$îµ9î~?æ$ŒåO>?æ$ŒæÞ#s?æ$+ý/?æ$+¤€?æ#ÉEüÊ*?æ#ÉG‹ß™?æ#guˆ ?æ#gv•–•?æ#£2EÅ?æ#¤ÁMm?æ"£Ð€N?æ"£Ò?æ"Aüðgù?æ"AþaÛ?æ!à(‚êT?æ!à*ÝR?æ!~S8Ê?æ!~TÆíä?æ!}«f?æ!~žœ?æ º¦ ö?æ º§˜Ôh?æ XÎ'ª?æ XϵÚ?æöõfñù?æööõÂ…?æ•Ê’?æ•XÒ:?æ3AP¼?æ3BÞâ€?æÑeùXC?æÑgˆ#?æo‰Æ—?æo‹T½“?æ ¬¶à?æ ®DÉø?æ«ÎÉÖ¨?æ«ÐX}Ü?æIð5ó?æIñÖC?æèTš?æèâ­?æ†/Â%Š?æ†1P¸?æ$NS>b?æ$OáÊ?æÂlZó?æÂm•ß²?æ`ˆÞ­¢?æ`Šm+|?æþ¤Ù‡?æþ¦g†|?朿öèž?æœÁ…X¯?æ:Ú8G’?æ:ÛÆ°¾?æØóLæ?æØõ+¯.?æw %õk?æw ´PÍ?æ#Òa£?æ%`¶!?æ³:¢ 8?æ³<0íÑ?æQP–Ñ«?æQR%_?æïe¯]â?æïg=±?æyì ?æ{zE?æ+M Š?æ+ŽÛR?æÉŸÒ†?æÉ¡`±;?æg±|]T?æg³ Ž?æÂJØ‚?æÃØõ×?æ£Ò>;È?æ£ÓÌR7?æAáV`J?æAâäoÔ?æßï“xN?æßñ!€ò?æ}üõ¤N?æ}þƒ¦ ?æ }¼?æ ÿ–?æº)º?溷­ü?æXûöw?æX!‰ã…?æö)óY?æö+g?æ”3Œó?æ”4žl5?æ2;So'?æ2<áGƒ?æÐB¼$¾?æÐDIö4?ænIJ†ß?ænJØQp?æ Nþý>?æ PŒÀè?æªSÑ®?æªU_kC?æHWÁùþ?æHYO¯Ü?ææZ×À?ææ\eo ?æ„]ë„?æ„^ “•?æ"^sŠª?æ"`+Ô?æÀ^ùáS?æÀ`‡{—?æ^^¦¨?æ^`3£?æ ü]wîŸ?æ ü_{?æ š[oå”?æ š\ýk$?æ 8XßJ?æ 8Z]ô?æ ÖTÑûè?æ ÖV_s«?æ tPïßÔ?æ ì5gBµ?æ ì6ô—ö?æ Š,’žM?æ Š.ì¦?æ ("äý¶?æ ($rE(?æ Æ^K»?æ ÆëŒF?æ d þïŒ?æ dŒ)/?æ Æ°b?æ Sã?æŸóµ®Z?æŸõBÚ.?æ=åÌ Œ?æ=çY.z?æÛ× )$?æÛØ—G*?æyÇp «?æyÈý É?æ¶ýr\?渊‚’?æµ¥²Ê^?浧?Ó¬?æS“=?æS•¤?æñ€•oÈ?æñ‚"kG?ælÂýR?ænOñé?æ-XÅ"?æ-Y¥²Ñ?æËB–Õƒ?æËD#¼J?æi,5ÄÑ?æi-¤°?æôã_?æ¼U?æ¤üÛ£?æ¤þhu"?æBãêG>?æBåwd?æàÊ Ì5?æàË­s?æ~¯c…?æ~± Û?æ”,ÿ?æ•’ãl?æºwµ3?æºyA¸?æXZŒk+?æX\Ç?æö<Œ16?æö>Òé?æ”´…?æ”Aè?æ1þc2?æ1ÿ‘÷?åÿÏÝg`?åÿÏß ôY?åÿm¼"Ñ?åÿm½®—á?åÿ ™í” ?åÿ ›z3?åþ©vâx0?åþ©xnðn?åþGSP0?åþGTŒÁ…?åýå.G‚¶?åýå/Óí"?åýƒ¸/€?åýƒ D“?åý âR/l?åý ãÞŒ?åü¾»Å©?åü¾¼¢Y?åü\“G?åü\”•á?åûúji/?åûúk¦± ?åû˜@[o?åû˜Aç°?åû6Æ­›?åû6Rç¦?åúÓê[ë÷?åúÓëè?åúq¾mF?åúq¿§™~?åú‘t¦?åú’‘™ô?åù­c·?åù­d¥Õô?åùK4XŠ×?åùK5ä¢Q?åøéÁüt?åøéN ?åø†ÔV=Ð?åø†ÕâGw?åø$£ Ær?åø$¤™É/?å÷Âpçéƒ?å÷ÂrsåU?å÷`=ìJ…?å÷`?x?n?åöþ žÈ?åöþ ¦ŒÇ?åö›Õs¤þ?åö›ÖÿŒ?åö9Ÿöï?åö9¡‚Ï8?åõ×i¤Ñ‚?åõ×k0ªÂ?åõu2}Z?åõu4 ,o?åõú€„æ?åõü PQ?åô°Á®q^?åô°Ã:5Þ?åôNˆ…¤?åôN‰“C9?åóìM‹ˆ¿?åóìO?j?åóŠ:š?åóŠÆIÞ?åó'Ö4?åó'× · ?åòÅ™½´?åòÅš¦_ž?åòc[Ký?åòc\ט?åò¨ë¨?åò4½?åñžÝ1sä?åñžÞ½?åñ<œåÆÒ?åñ<žqM?åðÚ[Åà‚?åðÚ]Q_Ö?åðxÒ¨?åðx]|?åð× ?åðØ•z„?åﳓnyë?åï³”ùä}?åïQNÿ@¾?åïQPŠ¤e?åîï ¼6å?åÒàœÌÿF?åÒàžVbF?åÒ~ôh·?åÒ~}ÄÇ?åÒ˜M/®?åÒ™Ö„Î?åѹוŸ?åѹ`ãÏ?åÑV“„[?åÑV’Ëœ?åÐô Æ?åÐô I?åБ… ‡Q?åБ‡)À±?åÐ.þñÆÌ?åÐ/zù=?åÏÌwtå—?åÏÌxþ?åÏiï*k"?åÏið³³?åÏf ¼?åÏg›*]?åΤÜ+ÅÀ?åΤݴÜq?åÎBQwúŽ?åÎBS O?åÍßÅöÉ€?åÍßÇÒP?åÍ}9¨k?åÍ};1K?åͬŒ4ª?åÍ®/™?å̸£ ”?å̸ ,“?åÌUì³þ?åÌU‘u¡ ?åËóiiÇzq?åÃ@OÀà?å´œÁE?å´œÂ?åÂQø” z?åÂQúÙ?åÁïTJGˆ?åÁïUÒy"?åÁŒ¯4Âù?åÁŒ°¼í ?åÁ* Te$?åÁ* ܈Ú?åÀÇb©°?åÀÇd14s?åÀd»3?åÀd¼»1P?åÀò7V?åÀzF4?å¿Ÿiæ¬?å¿Ÿkn´?å¿<À©!?å¿<Á˜ª?å¾Úp;?å¾Úø5?å¾wj\â?å¾wkOö?å¾½Ðr^?徿X^?彲љl?å½²Y~š?å½Oc˜Þ?å½Odw?å¼ì´u±€?å¼ìµýˆÊ?弊B?弊 Ñ˜?å¼'Tòƒ<$?宧O?宧P›Ö!?å®D‚¥‡?å®D„+âœ?å­áµg1+?å­á¶íùK?å­~çaŸï?å­~èèa?å­”Ÿê?å­Z!?嬹I_Î?嬹J‡?å¬Vx¤ÚE?å¬Vz+†‘?å«ó§øž?å«ó©õ?å«Õ˜@H?å«×Þ©?å«.çwÞ?å«.nJ?åªË/oßh?åªË0öoß?åªh[1‚å?åªh\¸ f?媆,\ú?媇²ß†?å©¢°`ÐV?å©¢±çKì?å©?ÙÎèî?å©?ÛU]?å¨Ývmk?å¨ÝüÛ?å¨z*WÀp?å¨z+Þ'%?å¨Qríö?å¨RùMµ?姴wÈ$ž?姴yN}g?å§QWM¶?å§QžÝŸŠ?å¦î —Þ?å¦îæâ¼?妋æ$1°?妋çªu˜?å¦) b|?å¦) èAn?å¥Æ+Ú„$?å¥Æ-`º ?å¥cMeþ?å¥cO•?å¥nzé÷?å¥p?夎£a??å¤)‚X?å¤:®£Õ?å¤:¯Œ½ø?å£×̤› ?å£×Î*®8?å£tê}ÝP?å£tìé†?壒1N?å£ 6Ž?墯#á¢ú?墯%g¡C?å¢L?l¦?å¢L@òf?å¡éZ,Xí?å¡é[²II?塆t ›?塆u¦„m?å¡#O±¹?å¡#ŽÕ”'?å À¥¹º ?å À§?•‚?å ]½^Ðý?å ]¾ä¥}?åŸúÔ?˜?åŸúÕÄá"?埗êZY°?埗ëà C?åŸ4ÿ°ô/?åŸ56³Ë?åžÒCE4?åžÒÈýÙ?åžo(ð¾?åžo)–¢l?åž ;Ì?åž <Ÿ¾ƒ?å©M_}?å©Nä´?劶(T·h?åŠSÔa?åŠSŸ‘?å‰ïþ¥Kq?å‰ð)‹§?剌éoÈ™?剌êôÕ?å‰)ÓtÈ?å‰)ÔøN ?åˆÆ¼²á?åˆÆ¾6C(?åˆc¥/˜^?åˆc¦³¼«?刌칟?刎pÖò?å‡séܺ?å‡umó?å‡:Z&ÙF?å‡:[ªè¥?å†×?£©>?å†×A'±¢?å†t$`Ð ?å†t%äÑv?å†^%L?å† â»?六뛢ó?å…­í–g?å…JΘÞ?å…JÏ…X?å„ç¯Ø+?å„ç±[÷ª?å„„×Ô?å„„’ZçY?å„!q»}?å„!rš“?僾P—$?僾Rô«?åƒ[/X’|?åƒ[0Ü\?å‚ø Zïe?å‚øÞ±ÿ?å‚”êžhM?å‚”ì"#ì?å‚1Ç"÷"?å‚1Ȧ«Æ?å΢èüÔ?åΤlª|?åk}ðˆ?åksÄ5?åX8í?åY¼O?倥1ÃD´?倥3FÝk?å€B aX?å€B ó?åÞâ2?åÞä ¥ò?å{¹ìä@?å{»ph?å~qÚ?å’î£?å~µfR†?å~µgÕxT?å~R;g÷?å~R<ëeç?å}ïÀâ?å}ïCl¹?å}‹ãZjp?å}‹äÝËJ?å}(¶7f:?å}(·ºÀ?å|ňP¹?å|Å‰Ô ?å|bY¦?å|b[)aû?å{ÿ*=‹?å{ÿ+ÀÐ ?å{›úý?å{›ûšOì?å{8É2¤u?å{8ʵÛi?åzÕ—ÅN?åzÕ™õF?åzre1:à?åzrf´cÜ?åz2þî?åz3— í?åy«þ9qö?åy«ÿ¼Œú?åyHÉ¡²?åyHË$¡¹?åxå”Ln$?åxå•Ï{/?åx‚^:Q{?åx‚_½W‰?åx'k [?åx(îm?åw»ïÞö¸?åw»ñaîÎ?åwX·–#å?åwX¹þ?åvõ~n>?åvõ€XZ?åv’DÎú?åv’FP÷?åv/ OB"?åv/ ÒE?åuËÏÐ8?åuËЖ¥_?åuh“ …?åuh”žÛ¯?åuVh'?åuWêîÚ˳ˆ?åt>ÜNl»?åsۛ㑜?åsÛfCÒ?åsx\?ª‚?åsx]ÂU»?åsßæÕ?åsb‹?år±ÚĦÝ?år±ÜGD?årN˜íÂ!?årNšpXc?åqëV[Cr?åqëWÝÒ·?åqˆ œ#?åqˆ$j?åq$Ï?åq$ЇÚ?åpÁŠ@Bß?åpÁ‹Â½+?åp^D»l?åp^F=¼?åoúþth.?åoúÿöÔ€?åo—·r1?åo—¸ô|…?åo4o´eI?åo4q6à?ånÑ';)Õ?ånÑ(½.?ånmÞ€„?ånm߈Ðß?ån ”¸:?ån •™˜?åm§IkÛ?åm§Jîî?åmCþÒô?åmCÿˆV?ålà±äþW?ålà³g2»?ål}e 5 ?ål}f‹b†?ålrÆ?ålôì‡?åk¶É!»î?åk¶Ê£ÛX?åkSz ?åkS{˜(t?åjð*Oï'?åjð+Ò•?åjŒÙÏtä?åjŒÛQT?åj)ˆ”ß?åj)Šâq?åiÆ6ŸóÌ?åiÆ8!ð??åibãñ$0?åibås¤?åhÿˆ6?åhÿ’ $÷?åhœQ?å]½ã¿t?å]Zyóî?å]Zz¡|?å\÷Iß ?å\÷Êõ.?å\“¤¼@c?å\“¦=Nñ?å\09w|?å\0:ø ?å[ÌÍzh6?å[ÌÎûhÄ?å[i`Æ©Ç?å[ibG£T?å[ó[«v?å[ôÜž?åZ¢…9ˆ‹?åZ¢†ºt?åZ?`\B?åZ?á@Ï?åYÛ¦ÐAÚ?åYÛ¨Qg?åYx6‰e‰?åYx8 <?åYÅ‹Ñ’?åYÇ ¡?åX±S×Ã#?åX±UX‹®?åXMálï—?åXMâí±!?åWênKÇ?åWêoÌ‘?åW†ún—n?åW†ûïJ÷?åW#…Õø?åW#‡UÇ€?åVÀ„³Õ?åVÀY]?åV\š}žû?åV\›þ=‚?åUù#¿Õ?åUù%@m?åU•¬K”V?åU•­Ì$Ú?åU24 Ô—?åU25¡^?åTλ? H?åTμÀ"Ê?åTkA¨VK?åTkC(ÑÍ?åTÇZÍÂ?åTÈÛBC?åS¤LWº?åS¤M×~9?åS@Ðm?åS@ÒÓ?åRÝT-ìÉ?åRÝU®LF?åRy×™ì?åRy؈òg?åRY-ÂN?åRZ®È?åQ²Ú=?åQ²Ü‡?åQO[W%B?åQO\×h¹?åPëÛ[·¨?åPëÜÛô?åPˆZªíX?åPˆ\+"Ì?åP$ÙDò:?åP$ÚÅ ¬?åOÁW)ò0?åOÁXª ?åO]ÔYÄd?åO]ÕÙäÒ?åNúPÔ¥«?åNúRT¿?åN–ÌšÒÐ?åN–Îå¤@û2ô?å>¤Bz%è?å>@Ÿ@~?å>@ ¿j?å=ÜüÓ?å=ÜþRþ?å=yY´ªd?å=y[3ˆM?å=µä¯?å=·bë”?å<²a¢ ?å<²àqé?åɈià?å7>Ëׂ?å6Û¦€%?å6Û$æÂ?å6wk€j?å6wl’à?å6ºÒRx?å6¼P« ?å5° ßÞ?å5° ^/ª?å5LX=‘À?å5LY»ÜI?å4è¥ëvÙ?å4è§iº]?å4„òédZ?å4„ôg Ù?å4!?7·×?å4!@µíP?å3½ŠÖiê?å3½ŒT˜^?å3YÕÅ”Ô?å3Y×C¼C?å2ö RÕ?å2ö!ƒs>?å2’i•ßÍ?å2’kù1?å2.²qÏŒ?å2.³ïáë?å1Êú˜ô:?å1Êüÿ“?å1gB?å1gCŽ“Z?å1ˆØvÀ?å1ŠVt?å0ŸÎðç?å0ŸÐnÝ`?å0<YØz?å0<×ǽ?å/ØY¨0?å/ØZ‘n?å/t:?å/tž›ýr?å/ày¢«?å/á÷|Ü?å.­#&Q?å.­$£å}?å.Ie#…4?å.If¡QZ?å-å¦rGÀ?å-å§ð à?å-çü?å-èÞ?å-'I†?å-(š?å,ºfEï,?å,ºgß:?å,V¤Ú*ì?å,V¦WÓô?å+òâÀÄ?å+òä=¸Æ?å+÷« ?å+!uF?å++\4Z?å++]þÈO?å*ǘ\‰D?å*Ç™Ú3?å*cÓŠ?å*cÕŒè?å* ¥ô?å*‡$Ö?å)œGÛ^ˆ?å)œIXÖc?å)8€ÿ[z?å)8‚|ÌO?å(Ô¹uÇŠ?å(Ôºó1X?å(pñ>›?å(pò»ýá?å( (Z38?å( )׎ù?å'©^ÈUö?å'©`Eª°?å'E”‰O•?å'E–H?å&áÉ}?å&áË_)?å&}þì?å&}ÿ+Ã?å&1½Âá?å&3:û€?å%¶dŦ@?å%¶fB××?å%R—'¡?å%R˜˜R1?å$îÈÃEÆ?å$îÊ@iO?å$Šù¾]t?å$Šû;y÷?å$'* Ed?å$'+‰Zß?å#ÃY­Ž?å#Ã[*?å#_ˆ¡t?å#_Šà?å"û¶èD‹?å"û¸eDñ?å"—䂱Ê?å"—åÿ«(?å"4p€«?å"4ís?å!Ð=±©c?å!Ð?.”²?å!liFg'?å!ljÃKo?å!”.äg?å!•«Á§?å ¤¾jç?å ¤¿ç½U?å @çúËõ?å @éw›&?åÝÞ¬›?åÝ[tÅ?åy9¢¾?åy:“cß?å`¢•Ó?åbOì?屇‚ó4?屈ÿ¦F?åM­·‘˜?åM¯4=¢?åéÓ@Š¨?åéÔ½/ª?å…ø*>?å…ùšÈ8?å"Pê?å"Ì«Ü?å¾?ÖȬ?å¾ASX–?åZb²=²?åZd.Æ”?åö„â¢?åö†_{?å’¦gâÔ?å’§ä]¦?å.ÇBgœ?å.ȾÛf?åÊçqò¾?åÊèî_?ågöÖ?ågs?å%ÐÖ?å'M4Ã?åŸDr3?åŸE|ÉÛ?å;a€Z?å;büª±?å×~P§B?å×ÌðÙ?åsšuä?ås›ò'?åµð]\?å·l˜â?å«ÐÀ;ñ?å«Ò?å õÀµU?å õÂ0{¸?å ‘Æûuç?å ‘ÈvÐ??å -Ì™ƒï?å -Î×>?å ÉÑ<>?å ÉÓ ˆƒ?å eÕÜÙ;?å e×Xu?å Ù‚R²?å Úýâ?å Üó¨?å Ýû*Î?å 9ÞÕ£G?å 9àPÓb?åÕàƒ›ë?åÕáþÄü?åqá‰æ?åqã ?å áè‰ý?å ãc¤ù?å©áŸ ì?å©ã´Ý?åEà¯uÅ?åEâ*‚«?åáßï³?åáà’õ?å}ÜÙ'¼?å}ÞT&?åÙóG’?åÛn?X?åµÖfW ?åµ×áH\?åQÒ2Oª?åQÓ­9[?åíÍW‹=?åíÎÒmã?å‰ÇÖ¼?å‰ÉPîW?å%Á­Ýð?å%Ã(²?åÁºß'?åÁ¼Yô?å]³iÕ\?å]´ä›Ö?åù«ND8?åù¬É¦?å•¢Œkp?啤#Ó?å1™$2*?å1šžã‚?åÍÒ?åÍ|ê?åi„a¨9?åi…ÜK{?åy‰‡?åz‚%½?å¡m~ä?å¡n‚?å=`]ÿ?å=aד?äÿÙSÅG?äÿÙT‚L[?äÿuE <ã?äÿuF†¼ë?äÿ6jן?äÿ7åPœ?äþ­'#[D?äþ­(Í5?äþI6Ø?äþI°l½?äýå£Q?äýåi*?äý€õjL°?äý€öä©~?äýã‹ð¼?äýåF~?äü¸Ñ ÕPŒ?äù˜%®¥k?äù˜'(»Á?äù4 ]?äù4לO?äøÏôgá‘?äøÏõáéÎ?äøkÚÍ«0?äøkÜG¬a?äøÀ-?äø R?ä÷£¥¬BÎ?ä÷£§&5æ?ä÷?Š%1©?ä÷?‹Ÿ´?äöÛmú* ?äöÛot?äöwQ+ž?äöwR¤à?äö3·äj?äö51»O?äõ¯¡ R?äõ¯Ù*?äõJöæhã?äõJø`1¯?äôæ׈Ë?äôæÙÝ‹?äô‚·†KE?äô‚¹÷?äô–á ƒ?äô˜ZÔ)?äóºu“å‚?äóºw ’?äóVSžV£?äóVUü/?äòò1[?äòò2~¡Ù?äòŽ È*?äòŽA››?äò)éçqŽ?äò)ëaò?äñÅÅcSv?äñÅÆÜÜÍ?äña ;Òì?äña¡µU7?äðýzq: ?äðý{êµI?äð™T>?äð™U|²8?äð5,ò(ø?äð5.k–?äïÑ>X?äïÑ·yn?äïlÜç6©?äïlÞ`•±?äï³íH*?äïµf $?äPÀ?äÊm?äî@`…?äî@aŠÙe?äíÜ5/£˜?äíÜ6¨æi?äíx «ZH?äíx $– ?äíÝ„Ü…?äíÞþ7¯R?äÜ>¯´“?äÛÙÖjO?äÛÙ×âME?äÛuþ+?äÛuv"5?äÛDó*?äÛFk?äÚ¬ûEH³?äÚ¬ü½1´?äÚH°ôM?äÚH²kè??äÙäfÄ¿?äÙäg{Ÿ¢?äÙ€t¼É?äÙ€ì›?äÙÎFÔø?äÙϾ¡º?äØ·z%,?äØ·‚ñêÞ?äØS4ö–?äØS5†µ9?ä×îæâ?ä×îç|Æu?ä׊—\Ø"?ä׊˜Ôˆ¤?ä×&Hj'?ä×&IŽ™?äÖÁø1›?äÖÁù©=t?äÖ]§®‚º?äÖ]©& ?äÕùVz°?äÕùXñ?äÕ•Îyñ?äÕ•F"?äÕ0²q‡Þ?äÕ0³é ÿ?äÔÌ_v¼N?äÔÌ`î;^?äÔh Þ/?äÔh U§?äÔ·§ç?äÔ¹X?äÓŸbÔO¶?äÓŸdK¹•?äÓ; c-3?äÓ;Ú?äÒÖ·T¨’s?äΆݵ w?äÎ"~Ò²Î?äÎ"€I¹Á?ä; Æ#ñ?ä;"=#Ó?äÍYÂç¨?äÍYÓàx?äÌõb×F²?äÌõdN8q?äÌ‘õ?äÌ‘l¾?äÌ,¢v¡†?äÌ,£í…"?äËÈA[¼?äËÈBÒ˜ž?äËcߤà¢?äËcá¶?äÊÿ}Qõ?äÊÿ~ÈÃ÷?äÊ›c ?äÊ›ÙÉa?äÊ6¶Ø.?äÊ6¸NîI?äÉÒR±‘?äÉÒT(J5?äÉmíïRö?äÉmïf?äÉ ˆ‘jŸ?äÉ Š®?äÈ¥"—ÿè?äÈ¥$£ç?äÈ@¼ù7?äÈ@½y–$?äÇÜTÒÐR?äÇÜVIf,?äÇwík˜?äÇwî}ú`?äÇ„ ±p?ädž9'?äƯŸ+õ?äƯ¬š?äÆJ²€ ?äÆJ³xùŸ?äÅæGÊÕ’?äÅæIAH?äÅÜøu"?äÅÞnà‘?äÅq‹Uz?äÅs¹×?äĹƒžq?äĹùû»?äÄT˜áwÜ?äÄTšWÎ?äÃð+¤È?äÃð-E?ä˽Í×Ã?äË¿D×?äÃ'O\­á?äÃ'PÒîâ?äÂÂàQQ?äÂÂáÇ‹~?äÂ^p«Éè?äÂ^r!üÅ?äÁúloÆ?äÁúâ›?äÁ•Žú˜?äÁ•‘O?äÁ1@P?äÁ1‰]õ?äÀÌ«ýU²?äÀÌ­slE?äÀh9MA±?äÀh:ÃQ1?äÀÆúä?äÀÇyQ?ä¿ŸRú ?ä¿ŸS”ûú?ä¿:Ý¡Ì?ä¿:ß?ä¾Öh‰5 ?ä¾Öiÿ(Õ?ä¾qò×À?ä¾qôM¬??ä¾ |Œœv?ä¾ ~…?佩¨ñ?佩ðí?ä½DŽ**s?ä½D \?ä¼àúw?äµÏ>lè?äµÏ?áf`?äµj»Åÿ?äµj¼zc?äµ7íÝ?äµ8w0.?ä´¡²cUY?ä´¡³Ø–?ä´=-,²3?ä´=.¡æ\?ä³Ø§^}1?ä³Ø¨ÓªF?ä³t øœi?ä³t"mÂj?ä³™û??ä³›p%,?䲫f#!?䲫Û:ú?ä²FŠ9Ù&?ä²F‹®éë?ä±âv°?ä±âë(`?ä±}x\%?ä±}y^Á?ä±î)F¾?ä±ïžBF?ä°´c 6–?ä°´e+ ?ä°OØ€2Q?ä°OÙõ°?ä¯ëLÉa&?ä¯ëN>Gq?䯆À{¹z?䯆Áð˜±?ä¯"3—r¿?ä¯"5 Já?䮽¦s?䮽§‘D!?ä®Y z?ä®YÜs?ä­ô‰cGJ?ä­ôŠØ .?ä­ú%,?ä­û™Óü?ä­+jP¬J?ä­+kÅa?ä¬ÆÙæ;?ä¬ÆÛZè¸?ä¬bHåšU?ä¬bJZ@æ?ä«ý·Nñ>?ä«ý¸Ã»?ä«™%"w0?ä«™&—˜?ä«4’`C?ä«4“ÔÔa?äªÏÿ[t?äªÐ|å²?äªkkç~?äªklj§?äªÖ—þ ?äªØ z?ä©¢Atì?ä©¢Bóéë?ä©=«ÑÄ„?ä©=­F2n?ä¨ÙŽ²e?ä¨Ù9?ä¨t~²„)?ä¨t€&ãè?ä¨ç=Dç?ä¨豑?䧫O2L?䧫P¦§?ä§F¶’Õ?ä§F¸\U?ä¦â\¬Ý?ä¦âÐðH?ä¦}ƒ’ ?ä¦}…?u?ä¦é2;…?ä¦ê¦pÅ?䥴N=l¹?䥴O±šã?ä¥O²³Íã?ä¥O´'ôø?ä¤ë•4¶?ä¤ë Tµ?䤆yâ ?䤆{V!í?ä¤!ÜšN?ä¤!Þ""?䣽>½qs?䣽@1|1?ä£X L„?ä£X¡À‡©?ä¢ôG x?ä¢ô» ?ä¢a­4²?ä¢c!*.?ä¢*Áq¬?ä¢*Âó`?ä¡Æ ½Hû?ä¡Æ"10L?ä¡ag"]?ä¡a€Û˜?ä üÝ}n?ä üÞðí“?ä ˜:ÿ ?ä ˜?äœEt˜?äœEø²?ä›àp'i\?ä›àqšæ`?ä›{Æ'„¶?ä›{Çšú£?ä›”“?ä›ë?äš²pnš¨?äš²qâh?äšMĵ±Ú?äšMÆ)ƒ?ä™éiï ?ä™éÝH ?䙄k‹xÑ?䙄lþËM?䙾UZ?䙿 ¿?䘻ÛÀ?䘻Š ?ä˜Va€±?ä˜VbóîR?ä—ñ²X<­?ä—ñ³ËrÎ?ä—„©?ä—³³?ä—(RP4?ä—(S÷'?ä–áqb~?ä–âäƒY?ä–^ðeÂ?ä–^ñs‡?ä•ú=ýND?ä•ú?p`ò?ä••‹hRµ?ä••ŒÛ^K?ä•0ØAÚF?ä•0Ù´ÞÅ?ä”Ì$‰ªh?ä”Ì%ü§Ð?ä”gp?ÉE?ä”gq²¿–?ä”»dž?䔼×5?ä‘A¹ƒX?ä‘AºõÐí?äÝ(?äÝ‘»¦?äxF*e6?äxGœ?ä‹¥Q?äÁ ?ä®ÐGá?ä®Òé?äJåaP?äJWûo?äŽåX§$ ?äŽåZ·?䎀›Ø*?䎀J›?äŽÞx™¥?äŽßë|?ä· ˆXr?ä·!úÖ1?äRbâÌ?äRczYt?äŒí¢÷7?äŒí¤i}Æ?䌈ãUðÍ?䌈äÈYE?äŒ$#$°Á?äŒ$$— ?ä‹¿bc3¿?ä‹¿cÕŽ?ä‹Z¡Ðh?ä‹Z¢„#–?äŠõß0|‚?äŠõà¢È˜?䊑¿N$?䊑1“"?äŠ,Y¾kv?äŠ,[0©\?ä‰Ç–-Úd?ä‰Ç— 2?ä‰bÒ Á$?ä‰bÓðÚ?äˆþ ^5´?äˆþÐ^Q?䈙H-å?䈙I‘Oj?äˆ4‚QX?äˆ4ƒÃ*Ä?ä‡Ï»ó²–?ä‡Ï½eÅê?ä‡jõ*¢?ä‡jöy6Ý?ä‡-‹ž¦?ä‡.ý£È?䆡e$š?䆡fó"¤?ä†<œç¢1?ä†<žY™"?ä…×Ó¿ž2?ä…×Õ1Ž ?ä…s ½Ð?ä…s z¦?ä…?Ãg˜?ä…A5I>?ä„©tï‘N?ä„©vakÜ?ä„D©Pî?ä„Dªÿ$b?äƒßÝœœ5?äƒßßh‘?äƒ{©Z?äƒ{n?äƒDžh?äƒE‚\’?䂱vqè¤?䂱w㟵?ä‚L¨A™2?ä‚L©³I*?äçÙ‚Â=?äçÚôk?äƒ 5©æ?äƒ §K«?ä:Z†*?ä;Ì Ö?䀹iñ,w?䀹kbÀ ?ä€T˜ùòú?ä€Tšks?äïÇt¿:?äïÈæD›?äŠõaÇ0?äŠöÓEw?ä&"ÁŒ?ä&$2‡º?ä~ÁO’ño?ä~ÁQa„?ä~\{×/2?ä~\}H˜-?ä}÷§ŽØ?ä}÷¨ÿq¹?ä}’Ò·™?ä}’Ô(óÚ?ä}-ýSÀz?ä}-þÅ(?ä|É'bÌ?ä|É(Ô£?ä|dPä±d?ä|dRUöß?ä{ÿyÙv,?ä{ÿ{J´?ä{š¢APL?ä{š£²‡”?ä{5Êuœ?ä{5Ë¥Ê?äzÐñj˪?äzÐòÛô¾?äzl,ˆN?äzlªI?äz>a±.?äz?ÒÌ?äy¢d l?äy¢e{Ú?äy=‰&®‘?äy=Š—»>?äxØ­¶Ž_?äxد'“ò?äxsѺ1@?äxsÓ+/¸?äxõ1¬é?äxö¢¤G?äwª7 ?äwªŽ'd?äwE:|Å|?äwE;í®¦?ävà\Pm®?ävà]ÁO¾?äv{}˜Ul?äv{ 0a?ävžQÑ?ävŸÁê¬?äu±¾zd¾?äu±¿ë1~?äuLÞåÿ?äuL߈«¥?ätçý)ù?ätçþš>…?ätƒ¯H3?ätƒÿ¤?ät9©„S?ät;4ª?äs¹W °?äs¹Xˆ²í?äsTsû ã?äsTuk°?ärïR¶y?ärï‘ÃQ€?ärŠ¬èÐ?ärŠ­|¼?är%Ç_ú‘?är%ÈЇc?äqÀâá"?äqÀã†fÙ?äq[ü@ ?äq[ý±@¥?äp÷àr¢?äp÷Pê$?äp’.õx™?äp’0eé?äp-G©L?äp-Hð˜?äoÈ_~ú!?äoÈ`ï\R?äocvó°£?äocxd º?änþÝâH?änþN6C?än™¤=„r?än™¥­ÑR?än4ºì®?än4»ƒ2s?ämÏÏ^\?ämÏÐÎO?ämjäÔà?ämjå o?ämøU¶?ämùÅ°*?äl¡ &J?äl¡ rO¢?äl<$î?äl< •E?äk×1½ÌV?äk×3-çx?äkrCÌöŸ?äkrE= ¦?äk URbI?äk VÂo5?äj¨fNDº?äj¨g¾JŠ?äjCvÀ³V?äjCx0² ?äiÞ†©“‚?äiÞˆ‹?äiy–Û»?äiy—uÌ9?äi¤ÕQ$?äi¦E:‡?äh¯³z?äh¯´‹Á?ähJÀ×xý?ähJÂGT(?ägåÎ uæ?ägåÏzIõ?äg€Ú³úz?äg€Ü#Çn?ägæÔkí?ägèD1Å?äf¶òk¿v?äf¶óÛ~3?äfQýyêV?äfQþé¡ö?äeíÿ1¹?äeí nâ>?äeˆûŠà?äeˆk4H?äe#oø?äe#Þ½E?äd¾$Z.?äd¾%É¢^?ädY,¼T¼?ädY.+èÑ?äcô4–Ð?äcô6¥É?äc;çh™?äc=Vîv?äc*B°YD?äc*DØ?äbÅHðð?äbÅJ`g«?äb`N©aý?äb`PÒ†?äaûSÙÄT?äaûUI-À?äa–X‚ @?äa–Yñn?äa1\¢~Ó?äa1^Ú?ä`Ì`;!:?ä`ÌaªuQ?ä`gcKè«?ä`gd»5¥?ä`eÕ*&?ä`gDp?ä_gÖêÔ?ä_iF)–?ä_8iPÿü?ä_8jÀ7¡?ä^ÓjC¾—?ä^Ók²ï ?ä^nj¯Ú?ä^nlEF?ä^ j“LÊ?ä^ lo?ä]¤iðf…?ä]¤k_¸?ä]?hÆ~ ?ä]?j5’6?ä\ÚgFI?ä\ÚhSC?ä\udÓÖ?ä\ufBÛð?ä\bÚ?ä\c}š?ä[«^Á¨?ä[«`0K?ä[FZí38?ä[F\\#¿?äZáV’\Ž?äZáXEø?äZ|Q° ª?äZ|S‚÷?äZLHDQ?äZM·?äY²FY®?äY²GÇðÁ?äYM?ãN ?äYMAR–?äXè8ç>Æ?äXè:Vž?äXƒ1d¢l?äXƒ2Óa'?äX)[¾G?äX*Êuå?äW¹ ̧H?äW¹";WÉ?äWT·ba?äWT& Å?äVïz?äVÁ?äVŠú²g?äVŠiM?äV$ùSq"?äV$úÂ.?äU¿î&ev?äU¿ï”òd?äUZâs¤F?äUZãâ*?äTõÖ;2„?äTõש±7?äTÉ}5?äTÊ묖?äT+¼9 ½?äT+½¨6?äSÆ®pÊH?äSƯß3£?äSa "†Î?äSa¡é ?äRü‘O*Ñ?äRü’½…ñ?äR—ö«W?äR—ƒdÿY?äR2rýd?äR2s‡JH?äQÍa¶¥0?äQÍc$êö?äQhPÏ(]?äQhR=g?äQ?bëJ?äQ@Ñ"Ö?äPž-r´?äPž.àC"?äP9ù|û?äP9g¦J?äOÔù†?äOÔ g%·?äOnôsÚ?äOnõáõ%?äO àiÕ¯?äO á×é¥?äN¤ËÛõ?äN¤ÍI'Ì?äN?¶ÇÞZ?äN?¸5ä?äMÚ¡0$§?äMÚ¢ž#B?äMu‹{?äMuŒùø?äMts¬S?äMuᜲ?äL«]O?äL«^½D?äLFE¦GT?äLFG)w?äKá-y‘?äKá.ç\•?äK|Ȫ³?äK|6~™?äKû”?äKýÓÏ?äJ±áÛ›H?äJ±ãI`ñ?äJLÇŸ\R?äJLÉ Ü?äIç¬ßžJ?äIç®MU¶?äI‚‘œF(?äI‚“ öu?äIuÕxh?äIwC!—?äH¸Y‹I¢?äH¸Zøë³?äHS<½î0?äHS>+‰"?äGîmjÈ?äGî Úþ›?äG‰™´@?äG‰@ô?äG#ãBï?äG#ä°t¨?äF¾ÄiO‡?äF¾ÅÖÍþ?äFY¥ ê4?äFY¦za?äEô…-³ê?äEô†›$#?äEdËÁ×ð´Ô?ä>×ñ‹¤Ü?ä>rÆ•?ä>rÇý~?ä> œ€ý¤?ä> íßn?ä=¨qðŽ?ä=¨s\í8?ä=CFÞß?ä=CHJÛi?ä<ÞJ¢Ã?ä<Þ·o-?ä ?ä7U…Þ¦·?ä6ðQTÇZ?ä6ðRÁ(æ?ä6‹´ƒw?ä6‹ Ýâ?ä6%é”!T?ä6%ëtŸ?ä5À´ó¥F?ä5À¶_ñq?ä5[Ób¡?ä5[?§«?ä4öJ3]±?ä4öKŸ››?ä4‘{0?ä4‘±ù?ä4+Ýsþ ?ä4+Þà.I?ä3ƦTÜ‚?ä3ƧÁ ?ä3an¶h?ä3ap"‰ƒ?ä2ü6˜f‹?ä2ü8€Ó?ä2–ýûJ?ä2–ÿg.q?ä21ÄÞª8?ä21ÆJ¶??ä1Ì‹C'f?ä1ÌŒ¯,K?ä1gQ(‡R?ä1gR”…?ä1ŽÎD?ä1úÄè?ä0œÛvOr?ä0œÜâ>õ?ä07ŸÞïŠ?ä07¡J×ì?ä/ÒcÈñú?ä/Òe4Ó?ä%‰ñX?ä%$S) ¾?ä%$T”-}?ä$¿ O@^?ä$¿ ºYû?ä$Y¾ø¿t?ä$YÀcÑï?ä#ôt%­‡?ä#ôu¸à?ä#(Ö.?ä#*A2N?ä#)Ý Tñ?ä#)ÞuR?ä"ÄÂE‘?ä"Ä’-;„?ä"_CýôF?ä"_Ehã?ä!ùö½¤?ä!ùø(‹²?ä!”©9Z?ä!”ªlç?ä!/ZÉõ?ä!/\3à`?ä Ê ?ä Ê Óe?ä d¼å?ä d¾OçB?äÿm9‹ ?äÿn¤O%?äšq ?äš}.ƒ?ä4Ìo´,?ä4ÍÚií?äÏ{Qµ?äÏ|¼c²?äj)¸I-?äj+"ð©?ä×£³X?äÙS±?䟅Mw?䟆{æ®?ä:2Ùè?ä:3kkü?äÔÞug?äÔßßY?äoŠnE?äo‹Øž?ä 5ëÕð?ä 7VR?ä¤àîˆ?ä¤âXý¥?ä?‹vT ?ä?ŒàÂs?äÚ5ƒ-ç?äÚ6í•,?ätß)=?ätà‰`?äˆ,ˆ°?䉖á°?äª0ÉP?äª23c-?äDØër?äDÚU`,?ä߀’È?äßý —?äz'¿ÞX?äz)*Ì?äÎr›?äÏÜÐj?ä¯t«Pƒ?ä¯v~²?äJi³ú?äJÓÛ?ää¿­øf?ääÁO?ädx`P?äeây?äÈÐ,?ä 2áÏ?ä´¬Ÿk*?ä´® uª?äOOüTt?äOQfWÑ?äéòߟƒ?äéôI›¼?ä„•I0Ì?ä„–³%â?ä79j*?ä8£X?ä¹Ø°0 ?ä¹ÚÝ?äTy­¥œ?äT{…H?äï1ÞI?äÒ?䉺<ý1?䉻¦Î—?ä$YÎöv?ä$[8À¹?ä¾øçüÜ?ä¾úQ¿û?äY—ˆ#Ô?äY˜ñßÐ?äô5¬þ²?äô7³‹?äŽÓVQñ?äŽÔ¿ÿ¥?ä)p†­î?ä)qðT?äÄ >M?äħµ»?ä^©|ÍV?ä^ªæeŸ?äùEBÇ?äùF¬X-?ä“à¨?ä“áù ª?ä.{dþ}?ä.|Î\?ä ÉÁS/?ä É*Îê?ä c¯¥( ?ä c±œ ?ä þIÎé?ä þJz<\?ä ˜âKo?ä ˜ãm±¾?ä 3z¡Þ ?äæT§ƒ‡?ä€ß'qò?ä€àH?äj™çn?äl~ ?äµõ–Q€?äµöþá?äP€ÒÈ?äP…[±?ãÿë -x?ãÿë –;?ãÿ…“È•Á?ãÿ…•1`?ãÿ ííÒ?ãÿ VaK?ãþº¥™x?ãþº§Í?ãþU-×Êà?ãþU/@0?ãýﵜ•?ãýï·ó ?ãýŠ<ëë¤?ãýŠ>TB‰?ãý$ÃÆ ?ãý$Å.oà?ãü¿J+¤?ãü¿K“_??ãüYÐê?ãüYуR`?ãûôU•Óô?ãûôVþE?ãûŽÚ›ßÎ?ãûŽÜù?ãû)_-§?ãû)`•D®?ãúÃãIrC?ãúÃä±—$?ãú^fñ'?ãú^hY,ã?ãùøê$!l?ãùøëŒ8?ãù“lâ¬f?ãù“nJ»×?ãù-ï,Ò‘?ãù-ð”ÚÜ?ãøÈq—G?ãøÈrj˜l?ãøbòdÿ?ãøbóÌÿ?ã÷ýsQ†3?ã÷ýt¹y ?ã÷—óÈj‚?ã÷—õ0V8?ã÷2sÈ¢8?ã÷2u0†Ç?ãöÌóTÉ?ãöÌô¼¦ê?ãögrlÓþ?ãögsÔªB?ãöñµR?ãöòx„q?ãõœo@Ÿb?ãõœp¨g[?ãõ6ìüÄ?ãõ6îd„ã?ãôÑjEp?ãôÑk¬Á?ãôkç]!?ãôkè¨?ãôcz5@?ãôdáà¡?ãó ßgƒk?ãó àÏ'§?ãó;ZáZ[?ãó;\H÷q?ãòÕÕçÜ\?ãòÕ×OrL?ãòpPzý ?ãòpQâ‹Õ?ãò Êš¿‘?ãò ÌG5?ãñ¥DG„j?ãñ¥E¯è?ãñ?½/¤?ãñ?¾è¨ü?ãðÚ6GÄd?ãðÚ7¯6–?ãðt®›““?ãðt°þž?ãð&|Æ?ãð'ãô«?ãï©ê¿$?ãï©ŸRã?ãïDæPq?ãïDM¦ ?ãîÞ‹oGÑ?ãîތ֖C?ãîy…Ç|?ãîyíÈ?ãîw)â?ãîx‘"@?ãí­ì[ªZ?ãí­íÂãY?ãíHaBf?ãíHb‚t??ãìâÕh­b?ãìâÖÏØ?ãì}ID {?ãì}J«1?ãì¼­VE?ãì¾rª?ãë²/¤¹t?ãë²1 γ?ãëL¢*h¶?ãëL£‘vÏ?ãêç<Ì?ãê磿?ãê…Ùˆ‰?ãê‡@ˆT?ãê÷ ?ãêøl³?ãé¶g¾ö}?ãé¶i%çû?ãéPØ%>?ãéPÙn•?ãèëGݧÖ?ãèëID‹?ãè…·BÂ?ãè…¸©lÌ?ãè &60?ãè 's?ã纔¸z´?ã纖Hp?ãçUÉb£?ãçU0)8?ãæïpi8á?ãæïqÏøO?ãæ‰Ý—ÑÜ?ãæ‰ÞþŠ#?ãæ$JU_?ãæ$K¼3?ã徶¢û?ã徸»õ?ãåY"}Þ ?ãåY#ä€Ü?ãäóèÕ¯?ãäóOq[?ãäøã9Þ?ãäúIÎb?ãä(clþ ?ãä(dÓ‹h?ããÂ͆!?ããÂÎìŒW?ãã]7.Á?ãã]8•@?ãâ÷ fõC?ãâ÷¡Ím+?ãâ’ .ñ¨?ãâ’ •bi?ãâ,q†Ø¥?ãâ,ríB>?ãáÆÙnŽ#?ãáÆÚÔð•?ãáa@æ$Ž?ãáaBLÙ?ãàû§íÍJ?ãàû©T!n?ãà–…š·?ãà–ëç³?ãà0t­¿?ãà0vÕ“?ãßÊÚeí8?ãßÊÛÌ+å?ãße?®— ?ãßeAÎ’?ãÞÿ¤‡¯?ãÞÿ¥íßy?ãÞšñGÄ?ãÞš Wpû?ãÞ4léI–?ãÞ4nOk¥?ãÝÎÐo p?ãÝÎÑÕ»W?ãÝi3†iz?ãÝi4ì}9?ãÝ–.X?ãÝ—”ð?ãÜøf&k?ãÜùÌ+Ü?ãÜ8Z/è?ãÜ8[”ÿ1?ãÛÒ»ˆãå?ãÛÒ¼îÛ?ãÛms”H?ãÛmÙ„B?ãÛ|ï3Ã?ãÛ~U”?ãÚ¡Üûó{?ãÚ¡ÞaÕ$?ãÚ<<™Ö2?ãÚ<=ÿ°´?ãÙÖ›Èý‘?ãÙÖ.Ðê?ãÙpú‰{Ï?ãÙpûïH?ãÙ XÛS¦?ãÙ ZA¯?ãØ¥¶¾Åª?ãØ¥¸$ƒŒ?ãØ@3µª?ãØ@™ld?ã×Úq:d5?ã×Úr Æ?ã×tÍÒµ?ã×tÏ8]‚?ã×)üèà?ã×+bŠ!?ãÖ©…¸ã[?ãÖ©‡}t?ãÖCáå ?ãÖCâlwý?ãÕÞ;ç?ãÕÞ=LªÉ?ãÕx–YF²?ãÕx—¾ËR?ãÕð]Úc?ãÕñÃWÛ?ãÔ­IôŸ?ãÔ­KZU?ãÔG£äy?ãÔG¤ƒS¡?ãÓáûÙ?ãÓáý>ç?ãÓ|T'¯m?ãÓ|UD?ãÓ¬‡‚?ãÓ­má1?ãÒ±|(è?ãÒ±á{n?ãÒKZ‚–N?ãÒK[çá«?ãÑå±Ò`?ãÑ岕?ãÑ€FØ?ãÑ€«Xä?ãÑ]ê?ãÑ^f9Í?ãд²NÜÒ?ãд³´ ?ãÐO/© ?ãÐO”в?ãÏé[£zÏ?ãÏé]›9?ãσ¯ª‚°?ãσ±›ñ?ãÏDÃU?ãÏ©Õn?ãθVr/Ö?ãθW×:Æ?ãÎR©2é?ãÎRª—íd?ãÍìû‡@J?ãÍìüì<è?ã͇Mo?ã͇NÔ ?ãÍ!žê`?ãÍ! Oo¬?ãÌ»ïù®?ãÌ»ñ^vÑ?ãÌV@œTh?ãÌVB4b?ãËðÓ¾?ãËð’7è?ãËŠà´Æ?ãËŠâ†o?ãË%/üUo?ãË%1aï?ãÊ¿~ï ?ãÊ¿€SÖc?ãÊYÍvW?ãÊYÎÚÚ„?ãÉô‘Zþ?ãÉôö?ãÉŽi@Ë‚?ãÉŽj¥y]?ãÉ(¶„¿i?ãÉ(·éf?ãÈÃ])Ç?ãÈÃÁÉP?ãÈ]OÊ ?ãÈ]Q.¥z?ãÇ÷›Ëש?ãÇ÷0hß?ãÇ‘çb>ï?ãÇ‘èÆÈý?ãÇ,2sœ?ãÇ,3ñö€?ãÆÆ}Mµ´?ãÆÆ~²1n?ãÆ`Ç¢Ùˆ?ãÆ`ÉN?ãÅû.ƒ?ãÅûñ›ê?ãÅ•[ ˆì?ãÅ•\pï*?ãÅ/¤!i?ãÅ/¥…x}?ãÄÉìÉu?ãÄÉî-``?ãÄd5U2?ãÄd6h¥ô?ãÃþ|ÔÝ?ãÃþ~9'?ãØÄ:”T?ãØŞÖÃ?ãÃ3 5Èð?ãÃ3 š5?ãÂÍQÆnJ?ãÂÍS*¢e?ãÂg—ì¥x?ãÂg™PÒi?ãÂݨ€2?ãÂß ¥ú?ãÁœ"ú+?ãÁœ$^.É?ãÁ6gág?ãÁ6iE~?ãÀЬ^µj?ãÀЭÂŵ?ãÀjðqýp?ãÀjñÖ‘?ãÀ42?ãÀ54?ã¿ŸwZ¢™?ã¿Ÿx¾f?ã¿9º0AÓ?ã¿9»”5v?ã¾Óüœ0Ö?ã¾ÓþP?ã¾n>žª?ã¾n@uù?ã¾€7T8?ã¾›2]?ã½¢Áf/?ã½¢ÂÊd*?ã½=,\Ž?ã½=,`?ã¼×Bˆò´?ã¼×Cì»[?ã¼q‚|aD?ã¼qƒà"Á?㼠›&?ã¼ ÃjUy?㻦'ÁY?㻦‹t?ã»@?ßôÚ?ã»@AC Ù?ãºÚ~/Vœ?ãºÚ’ûp?ãºt¼ºÖ?ãºt½yX€?ãºù“p?ãºú÷?㹩6¨˜µ?㹩8 ( ?ã¹CsU&1?ã¹Ct¸®\?ã¸Ý¯™E?ã¸Ý°üœF?ã¸wëtÖ=?ã¸wìØP?ã¸&æJ¡?ã¸(I½M?ã·¬aíy|?ã·¬cPäý?ã·FœŒ8‚?ã·FïœÙ?ã¶àÖ‰Û?ã¶àØ%ç?ã¶{­?ã¶{ô?ã¶Iö³l?ã¶KZC?㵯‚ô®?㵯„Wö9?ãµI»Š‘1?ãµI¼íѳ?ã´ãó¸‹t?ã´ãõÄÌ?ã´~+~®Ç?ã´~,áàô?ã´bÝ œ?ã´d@7ž?ã³²™ÓÕ?ã³²›6øÝ?ã³LÐbúÑ?ã³LÑÆ}?ã²çŠd?ã²çí¤æ?ã²Jè?ã„W-ž?ãƒñ4ª7Ú?ãƒñ6 þÞ?ニ<·k ?ニ>*÷?ãƒ%Deõ-?ãƒ%EÅ­Ö?ã‚¿Kµ¹?ã‚¿Mj~?ã‚YR§Ø?ã‚YT½$?ãóY9ÇW?ãóZ™jv?ã_nj?ã`Í°[?ã'eD ?ã'f£®b?ã€Áj»É ?ã€ÁlV³?ã€[oÕoë?ã€[q4öP?ãõtáÓ?ãõuða ?ãxî>m?ãzM¶v?ã)|íÒ®?ã)~MCˆ?ã~À•?ã~ÃîëA?ã~]ƒÓj¦?ã~]…2Í$?ã}÷†¹)?ã}÷ˆêx?ã}‘‰B,å?ã}‘Š¡?ã}+‹m²?ã}+ŒÌd¤?ã|Å:a?ã|ÅŽ™Ó%?ã|_Žª­h?ã|_ ëý?ã{ù½y?ã{ù‘°o?ã{“sß?ã{“‘ÒO?ã{-Ëé?ã{-’*ªó?ãzÇÆþ?ãzÇ’&ù?ãzaevw?ãza‘Ä‘$?ãyû§ j?ãyû‘è?ãy•Ž‹¬?ãy•ê¸f?ãy/·d?ãy/Žr¼„?ãxÉ‹>áö?ãxÉŒßè?ãxc‰ ?ãxcŠk`?ãwý†{\h?ãwý‡ÚKü?ãw—ƒÞ–?ãw—„ìÆû?ãw1€CÞ³?ãw1¢¿é?ãvË|]Ý?ãvË}ü7å?ãvexšŠ€?ãveyù]Y?ãuÿt;e¹?ãuÿuš1b?ãu™o€ì?ãu™pÞâg?ãu3jh¥?ãu3kÇbh?ãtÍdõ v?ãtÍfSÁ“?ãtg_%Ž|?ãtg`„=j?ãtXú '?ãtZXÇæ?ãs›RrФ?ãs›SÑq4?ãs5KÎR?ãs5Lîg³?ãrÏDQ +?ãrÏE¯]?ãri<¶Ó¹?ãri>^»?ãr4Á8%?ãr6»ø?ãq,oî?ãq-Îjª?ãq7#Ã`?ãq7%!Õ„?ãpÑ»žd?ãpÑ ª?ãpkXšü?ãpk·?ãpšu ?ãpøÔó?ãožýKÎ?ãožþߤ…?ão8ó J?ão8ôkqÒ?ãnÒè> ?ãnÒéœLù?ãnlÝ???ãnlÞr‚h?ãnѹ?ãnÒíôþ?ãm Å°€ ?ãm Ç´Ô?ãm:¹v³}?ãm:ºÔá?ãlÔ¬âcv?ãlÔ®@‰á?ãlnŸó¾1?ãln¡QÝm?ãl’ªÄ±?ãl”ܾ?ãk¢…!?ãk¢†d1ó?ãk+¼·²?ãi>-q?ãhØ /6?ãhØþ Å?ãhr )ä[?ãhr ‡»»?ãh úY¹ë?ãh û·Š?ãg¥é/ü?ãg¥êÅ?ãg?׬ºÆ?ãg?Ù |–?ãfÙÅÐí?ãfÙÇ-ÀŽ?ãfs³™Þj?ãfs´÷‘Û?ãf ¡ P?ãf ¢h-‘?ãe§Ž!ÂW?ãe§gg?ãeAzßψ?ãeA|=mh?ãdÛgDÖÚ?ãdÛh¢mŠ?ãduSPè:?ãduT®wº?ãd?€?ãd@aŒÑ?ãc©*^Y¨?ãc©+»ÚÈ?ãcC_Ù€?ãcC½Sp?ãbÝ¢ô?ãbÝf´?ãbvêXãù?ãbvë¶O‰?ãbÔPŽW?ãbÕ­ò·?ãaª½ï±ò?ãaª¿M"?ãaD§6‹Â?ãaD¨“áÁ?ã`Þ% Ž?ã`Þ‘‚\]?ã`xx»V9?ã`xzØ?ã``ù“®?ã`bVÔ?ã_¬Hߨ¬?ã_¬J<áê?ã_F0mÃ?ã_F1Êõ%?ã^à¢Ïâ?ã^àÿú¿?ã^yþ~‘œ?ã^yÿÛµI?ã^å_¨?ã^æ_|%?ã]­Ë.gÎ?ã]­Ì‹}?ã]G±ªÁ?ã]G²_¸Ý?ã\á–8>?ã\á—Ü?)?ã\{{¤M ?ã\{}LÄ?ã\`qËÎ?ã\aÎÄY?ã[¯DçÄ??ã[¯FDµ™?ã[I)s!?ã[I*c]K?ãZã Íè$?ãZã*Ë?ãZ|ð>ö?ãZ|ñšð¾?ãZÓW'K?ãZÔ³ûã?ãY°¶=Ô?ãY°·v ;?ãYJ˜„;$~í?ãT%|?ãTì?ãTù- ¢?ãTú‰t\?ãS´ÖÞÆ?ãS´Ø;'?ãSN´:í?ãSNµ–èF?ãRè‘@ÌÙ?ãRè’ ?ãR‚mñVs?ãR‚oM¢i?ãRJJÿó?ãRK§D¹?ãQ¶&N¼?ãQ¶'ªCP?ãQPûn?ãQPW¤j?ãPéÝSWJ?ãPéÞ¯†|?ãPƒ¸Ußý?ãPƒ¹²þ?ãP“Ÿ?ãP”_8o?ãO·m[ ¦?ãO·n·'D?ãOQG]àŠ?ãOQH¹òö?ãNë! Æ?ãNë"gœ?ãN„údKÅ?ãN„ûÀOÏ?ãNÓh û?ãNÔÄÓ?ãM¸¬ã?ãM¸­sŠ?ãMR„q*ò?ãMR…Íh?ãLì\v«~?ãLì]Ò’Â?ãL†4'„ ?ãL†5ƒd ?ãL ƒÄ ?ãL ßœì?ãK¹â‹˜Ò?ãK¹ãçj‚?ãKS¹>óç?ãKSºš¾e?ãJíó©?ãJíù¶ö?ãJ‡e¨Ån?ãJ‡gŠ?ãJ!;_xœ?ãJ!<»-†?ãI» ¨?ãI»»`?ãITåбá?ãITç,Xh?ãHe³?ãHî»ç?ãHˆŽò8‰?ãHˆMЭ?ãH"cW§?ãH"d`è™?ãG¼6Ä´ˆ?ãG¼8 >H?ãGV 0m‚?ãGV ‹ð?ãFïÝH¾Æ?ãFïÞ¤:#?ãF‰° ŠÞ?ãF‰±hÿ?ãF#‚~ð?ãF#ƒÚ]?ãE½T ¿?ãE½Uør…?ãEW&fÚ?ãEW'Â8­?ãDð÷Üôçòd?ã>ôBÝØ?ã>ã3Yn?ã>äŽ=¯?ã>'¯,ÀÊ?ã>'°‡Ú?ã=ÁzÔ7¦?ã=Á|/ ƒ?ã=[F)ùê?ã=[G„È•?ã<õ-ê?ã<õˆ±|?ã<ŽÛà&?ã<ŽÝ:æN?ã<(¦@øº?ã<(§›±Î?ã;ÂpP5¨?ã;Âqªç‰?ã;\: úÙ?ã;\;h¥ˆ?ã:özuC?ã:öÕ¿?ã:Ì•¥"?ã:ÍðAl?ã:)•_Š¯?ã:)–ºÆ?ã9Ã]ØRÙ?ã9Ã_2à¾?ã9]&*‹?ã9]'Z±=?ã8öíÖô4?ã8öï1s´?ã8µ[ê‡?ã8¶¶bÔ?ã8*|ŽäÐ?ã8*}éUê?ã7ÄCq h?ã7ÄDËtP?ã7^ ˆ?ã7^ \êÊ?ã6÷ÐC1K?ã6÷ÑŒÎ?ã6‘–32Ü?ã6‘—‡,?ã6+[Ò¹†?ã6+]-£?ã5Å!!Ål?ã5Å"| V?ã5^æ GÄ?ã5^çz†|?ã4øªÎ™ø?ã4ø¬(Ñ}?ã4’o,­C?ã4’p†Ý•?ã4,3:Ÿ{?ã4,4”È›?ã3Åöøš?ã3ÅøR¡‡?ã3_ºfM¹?ã3_»Àhs?ã2ù}„Ñ?ã2ù~Þ,X?ã2“@R —?ã2“A¬ë?ã2-Ð;?ã2-*@!?ã1ÆÄþ¯þ?ã1ÆÆX­ì?ã1`†Ý™=?ã1`ˆ7ø?ã0úHlöÖ?ã0úIÆæ]?ã0” ¬ÈÔ?ã0” ±)?ã0-Ê;ã?ã0-Ë÷?ã/Ç‹>P?ã/ÇŒ˜)þ?ã/aK2?ã/aLêÂ?ã.û ’ð®?ã.û ì¼7?ã.”ËFŒ?ã.”Ì Pc?ã..Š«!ð?ã..Œß?ã-ÈIÀÞñ?ã-ÈK”à?ã-b‡¥a?ã-b áT?ã,ûÆÿ°¹?ã,ûÈYXB?ã,•…)Ö?ã,•†‚°+?ã,/C³ê?ã,/D]M ?ã+ÉŽì?ã+Éè}î?ã+b½Ê®ì?ã+b¿$9§?ã*üz·ã?ã*ü|f?ã*–7V—?ã*–8°n?ã*/ó§v?ã*/õ{—?ã)ɯ©1?ã)ɱžó?ã)ck]¸?ã)cl¶}r?ã(ý&Âãþ?ã(ý(C…?ã(–áÚ§Ÿ?ã(–ã3ÿó?ã(0œ¤pZ?ã(0ýÁz?ã'ÊW Lé?ã'ÊXy–Ö?ã'dNZê?ã'd§£?ã&ýË.š>?ã&ý̇ÕÃ?ã&—„ÁF$?ã&—†zu?ã&1>^?ã&1?_‹Ÿ?ã%ÊöýÔf?ã%ÊøVúP?ã%d¯§ñÚ?ã%d±‘?ã$þh™?ã$þi]°¡?ã$˜ /?ã$˜!m$~?ã$1×ÖEK?ã$1Ù/Ng?ã#ËKXÌ?ã#ˤZµ?ã#eFsN?ã#eGÌIE?ã"þýNaÀ?ã"þþ§UA?ã"˜³Üƒe?ã"˜µ5o²?ã"2jÑ?ã"2kv¶?ã!Ì Y@?ã!Ì!k7&?ã!eÕº9ž?ã!e×O?ã ÿ‹€Å?ã ÿŒnPB?ã ™@$L.?ã ™A}x?ã 2ôæ›±?ã 2ö?\Ç?ãÌ©\}ô?ã̪µ7Ö?ãf]†??ãf^ÞÑí?ãbÅ ?ã»p‚?ã™Äò;?ã™ÆJßÅ?ã3x5&?ã3yŽ-7?ãÍ+,Ñ„?ãÍ,…gb?ãfÝØ'?ãfß0œÑ?ã7cg?ã‘êÝ?ãšBJßË?ãšC£` ?ã3ôtD?ã3õjíQ?ãÍ¥Žj‰?ãͦæÜb?ãgV¾³‰?ãgX.?ã£{^?ãûÞÏ?㚸<ÐŒ?ãš¹•,È?ã4hŠ•2?ã4iâê:?ãÎ!Æ?ãÎåoš?ãgÈDg4?ãgÉœ­Ô?ãw°‚Â?ãyÂ.?ã›&Ñt%?ã›()¬]?ã4Õ§v0?ã4Öÿ§4?ã΄2yÐ?ãÎ…Š£Ÿ?ãh2rœD?ãh3ʾß?ãàgúÊ?ãáÀ0?㛎£Ú?ã›j¸ ?ã5;r— ?ã5<ʤ?ãÎ舠?ãÎéài?ãh•RîÍ?ãh–ªía?ãAÓaP?ãC+X°?ã›î „'?ã›ïatR?ã5™õtƒ?ã5›M]y?ãÏE—#I?ãÏFï ?ãhðî¼n?ãhòF–ü?ã›ü] ?ãT0y?ãœFÀ ?ãœHÑ.?ã5ñ8þ­?ã5òÃ?ãÏ›gS+?ãÏœ¿æ?ãiEKÁ?ãiF£w‹?ãîæ‘•?ãð>@ç?㜘7¦æ?㜙O?ã6A? ?ã6B–¾ò?ãÏéý?ãÏëT­Â?ãi’q—D?ãi“É)Ã?ã:œµó?ã;ôA=?ãœâ~›ê?ãœãÖÿ?ã6ŠH±?ã6‹nÅ‘?ã Ð1f­ ?ã Ð2¾"·?ã iØmF?ã iÙÄ€¼?ã *† ?ã €íâ?ã %Ÿ ¢?ã &öi®?ã 6ËÊ©Œ?ã 6Í"d?ã Ðq­’ ?ã ÐsãÃ?ã jGÂÜ?ã jŸ J?ã ¼™g|?ã ½ðªµ?ã a¢b?ã bùž?ã 7bûª?ã 7º0x?ã ЪÛB¤?ã Ь2p=?ã jO '³?ã jPbN?ã òòÖ‡?ã ôIõ¶?ã–’l?ã—é„?ã79éÙ?ã7;@éá?ãÐÜùIG?ãÐÞPR×?ãjÀÙ„?ãjÛß?ã"@zŽ?ã#—u³?ãÄxX?ãÅÏKÿ?ã7fh¥?ã7g¿Ša?ãÑ-V?ãÑ hÜ?ãj©qs÷?ãjªÈRH?ãJ‰™É?ãKàpä?ãëZ;?ãì± ÷?ã7‹ãeç?ã7:.˜?ãÑ,%EÏ?ãÑ-|K?ãjÌËv?ãjÍv…¼?ãkÓ"Z?ãm)Õk?ãž ?„®?ãž –0‰?ã7ªdŪ?ã7«»jO?ãÑIC?ãÑJ™Ÿˆ?ãjçÚt"?ãjé1 ]?ã†+"?㇪(?ãž$5%?ãž%‹Œõ?ã7Áø@0?ã7ÃNÀË?âÿÑ_té ?âÿÑ`Ëbn?âÿjü« ²?âÿjþá?âÿ™šÊæ?âÿšñ5ß?âþž6D.«?âþž7š’o?âþ7Ò§G?âþ7Óý£•?âýÑnÄ?\?âýÑp”´?âýk ›N?âýk ñVq?âý¦+¾‹?âý§‚y?âüžAv~É?âüžB̾?âü7Ü{Vþ?âü7ÝÑ€?âûÑw:U.?âûÑx†z?âûk³¤²?âûk ÎÈ?âû«çDÕ?âû­=g¶?âúžEÕCŒ?âúžG+_7?âú7ß}Ì0?âú7àÓà¥?âùÑxàì¶?âùÑz6ùö?âùkþ‡ ?âùkT?âùª×3?âù¬-?âøžCi‘ë?âøžD¿‰‰?âø7Û¶Ež?âø7Ý 6?â÷Ñs½à ?â÷ÑuÉR?â÷k €oO?â÷k ÖQK?â÷¢þ?â÷¤SÛÌ?âöž:6£"?âöž;Œv²?âö7Ñ*r$?âö7Ò€>~?âõÑgÙ{ç?âõÑi/A ?âõjþCÎ>?âõjÿ™Œ,?âõ”iw?âõ•¿-¼?âôž*J° ?âôž+ _Œ?âô7¿ç["?âô7Á=m?âóÑU?²?âóÑV•S4?âójêS¥y?âójë©?X?âó#`Y?âó€xó?âòž®ÿ.?âòžŠ¡?âò7§ö$?âò7©La?âñÑ;ùóþ?âñÑ=Oq?âñjϹt4?âñjÑê?âñc5‹?âñdŠ~$?âðölÿÂ?âð÷Âg&?âð7‰a?âð7Š¶x3?âïÑ’?âïÑfêÿ?âïj®~Š?âîÒñ˜?âîÓã4ì?âî7d0¶Õ?âî7e…òó?âíÐõù?âíÐöåHà?âíj†¬QS?âíjˆ?âí…|œ?âíÚ£?â쨔ë?âì©p´.?âì78n§ú?âì79ÃÀ?âëÐÈ~f-?âëÐÉÓw?âëjXJ±¦?âëjYŸ»G?âëçÔ,„?âëé).î?âêwó?âêxoîD?âê7K?âê7søG?âéДà‹?âéЖ5wÚ?âéj#_•?âéj$´z?â鱜!6?âé²ðÿ?âè?–=(?âè@ëJ?âè6ÍN1?âè6Σì?âçÐZÃí?âçÐ\µÑ?âçiç÷aÖ?âçiéL#T?âçtèôx?âçv=®À?â昆Æ?âæí9×?âæ6Ž²?âæ6ZÃŒ?âåÐ1à¬?âåІ…O?âåi¦ýâ?âåi§p›N?âå1ÄQ?âå3çE?â䜽+œ?â䜾¢›?âä6HPS?âä6I¤ÚÞ?âãÏÓ3ÿÒ?âãÏÔˆ€c?âãi]Öpi?âãi_*éÃ?âãè7w÷?âãé‹ê?ââœrWA>?ââœs«¬*?ââ5ü5öû?ââ5ýŠZ°?âáÏ…Ó‰ƒ?âáχ'æ?âái0#‹?âái„xÒ?âá˜KÒœ?âá™  ­?âàœ!&• ?âàœ"zÜy?âà5©Àˆ´?âà5«ÈW?âßÏ2å?âßÏ3nŠ?âßhº2~?âßh»†¯8?âßB ¿?âßC^1¼?âޛɠ¯4?âÞ›ÊôÑú?âÞ5Pö×ù?âÞ5RJó‰?âÝÎØ €à?âÝÎÙ`•8?âÝh^âF?âÝh`6 g?âÝåw)5?âÝæË/?âÜ›kÌ&B?âÜ›m $ô?âÜ4ñáj?âÜ4ó5 å?âÛÎwµïv?âÛÎy ߺ?âÛgýJÇÌ?âÛgþž°Ù?âÛ‚Ÿòµ?âÛƒóÔŠ?âÚ›µ4ª?âÚ› H?âÚ4ŒŠ©œ?âÚ4Þ}?âÙÎ ™8?âÙÎteh?âÙg•vå"?âÙg–ʪ?âÙ©G?âÙág?âØše'?âØšž¸Æ±?âØ4 ý ó?âØ4"P¹F?â×ͤUÁ&?â×Í¥©iA?â×g'o`Àr?âÔ™·’.Ñ?âÔ37a`Ú?âÔ38´È?âÓ̸Eo~?âÓ̹˜Ïn?âÓf8ë¾?âÓf:>ow?âÒÿ¹RFÐ?âÒÿº¥˜Q?âÒ™9{8›?âÒ™:΂å?âÒ2¹e‡9?âÒ2º¸ÊK?âÑÌ9&Õ?âÑÌ:db¯?âÑe¸~Ά?âÑe¹Ò)?âÐÿ7®QR?âÐÿ9~½?âИ¶ŸÙz?âИ·òÿ­?âÐ25Se¨?âÐ26¦„¤?âÏ˳É.¦?âÏ˵Fi?âÏe23?âÏe3TC£?âÎþ¯ûq?âÎþ±Nzñ?âΘ-¸"ü?âΘ/ %?âÎ1«77Q?âÎ1¬Š25?âÍË(xõà?âÍË)Ëé?âÍd¥}@7?âÍd¦Ð,¬?âÌþ"D#x?âÌþ#—µ?âÌ—žÍØh?âÌ—  ¶n?âÌ1]š?âÌ1m4g?âËÊ—)ζ?âËʘ|žK?âËdü8ß?âËdO=?âÊýŽ‘·¹?âÊýäxÞ?âÊ— ê;U?âÊ— <õC?âÊ0… æ?âÊ0†X½œ?âÉÉÿå%?âÉÊ7Ð?âÉcz‡ˆ>?âÉc{Ú,ƒ?âÈüôí^º?âÈüö?ûÇ?âÈ–oµ?âÈ–piKb?âÈ/é¨R?âÈ/êV6ð?âÇÉb´5˜?âÇÉd¼þ?âÇbÜ(xù?âÇbÝzù'?âÆüU`Ž?âÆüV³ý?âÆ•Î\sS?âÆ•Ï®å?âÆ/GDm?âÆ/Hn®ñ?âÅÈ¿ +k?âÅÈÀòŽ·?âÅb7çä?âÅb9:@+?âÄû¯óUË?âÄû±Eª¨?âÄ•'Âù·?âÄ•)G\?âÄ.ŸVëW?âÄ. ©1Ã?âÃȯ7ž?âÃÈvÒ?âÃaËë…?âÃa#?âÂû­?âÂûÿDÆ?â”{RÛ ?â”|¥•?âÂ-ñ½??âÂ-óa`?âÁÇgìiý?âÁÇi>…?âÁ`ÝàZH?âÁ`ß2n*?âÀúS™a?âÀúTë ?âÀ“ÉÍ-?âÀ“ÊhÒž?âÀ->Y†?âÀ-?«„Ö?â¿Æ³aG ?â¿Æ´³> ?â¿`(.:?â¿`)€)Þ?â¾ùœÀjç?â¾ùžSw?⾓æü?⾓iÈS?â¾,…4»;?â¾,††•Z?â½Åù?â½ÅúhÕî?â½_l¾ËB?â½_n–ï?â¼øà,=Å?â¼øá~:?â¼’S_Xõ?â¼’T±1?â¼+ÆX8-?â¼+Ç©î1?â»Å9öÅ?â»Å:h¥?â»^«›„§?â»^¬í,:?âºøæ  ?âºø7«û?⺑ö§ ?⺑‘H@,?âº+ÍU@?âº+ç)?â¹Äsj1˜?â¹Ät»¼H?â¹]äÍeÔ?â¹]æéL?â¸÷UöáÝ?â¸÷WH^?â¸ÆæÝ?â¸È7öã?â¸*7œw$?â¸*8íäò?â·Ã¨Ò(?â·Ã©j8½?â·][¼œ?â·]­ù?â¶öˆe}?â¶ö‰¶Õ3?â¶ø5ær?â¶ù‡7]?â¶)gÍ}?â¶)iO/?âµÂ×+/6?âµÂØ|q¯?âµ\FPDú?âµ\G¡€;?â´õµ?ⲎKnF»?â²'·|»Æ?â²'¸Í½@?â±Á$£à,?â±Á%ôÚm?â±Z‘’·â?â±Z’ãªê?â°óþI^ ?â°óÿšIÛ?â°jÇÐÞ?â°lµt?â°&×+u?â°&Ø_Ñ?â¯ÀC—]?â¯ÀDmm€?â¯Y®òõï?â¯Y°CÄÙ?â®ó‘›þ?â®óâc°?⮌…ø\t?⮌‡Iì?â®%ñ'}¯?â®%òx6î?â­¿\ïu?â­¿]o¡{?â­XÆÞÛF?â­XÈ/†?â¬ò1g?R?â¬ò2·âæ?⬋›¸Sƒ?⬋ïÝ?â¬%Òš?â¬%"œ¼?⫾o´:ç?⫾qÈÏ?â«WÙ_Ê?â«WÚ¯˜y?âªñBÒÓY?âªñD#RÏ?⪊¬}²?⪊­_õî?âª$ó?âª$e÷?⩽}ã¾ã?⩽4(­?â©Væ{¨w?â©VçÌ ?â¨ðNÜ»\?â¨ðP-´?⨉· æ?⨉¸Wu?â¨#úô?â¨# K@í?⧼†¸þ?⧼ˆ[ª?â§Uî>Ìô?â§Uï f?â¦ïUþ?â¦ïVßN7?⦈¼©–?⦈½ù0•?â¦"#ŒÁr?â¦"$Üê8?⥻Š::Ö?⥻‹Š\c?â¥Tð±¤r?â¥Tò¾Å?â¤îVòüU?â¤îXCo?⤇¼þNø?⤇¾NZÙ?â¤!"ÓÅ?â¤!$#ÊD?⣺ˆs{ ?⣺‰Ãx?â£SíÝPÀ?â£Sï-Fô?â¢íS~?â¢íTam?⢆¸?⢆¹`Ø?⢠Ù J?⢠)Ñ?⡹l¼X?⡹‚¼•¥?â¡RåË ?â¡Rçß ?â ìIóåF?â ìKC° ?â …­çŠþ?â …¯7NŸ?â ¦ ž?â õÇ?⟸u/pŒ?⟸v%º?âŸQ؃É0?âŸQÙÓw$?âžë;£!õ?âžë<òÈ°?âž„žuŽ?âž„ŸÝ?âžBù«?âž’‘ò?â·cÃ×`?â·ehm?âPÆïÞ?âPÇ_y²?âœê('l4?âœê)vîÎ?✃Š g?✃‹Yât?âœë¸ìÉ?âœí`ï?⛶M3 ¡?⛶N‚v?â›O®xæ¨?â›O¯ÈL[?âšéŠÂ?âšéÙà;?âš‚pgõž?âš‚q·LÝ?âšÑk:?âšÒ`»??♵1†ÃÅ?♵2Ö ?â™N‘È(>?â™N“iÐ?â˜çñÕÁ¤?â˜çó$ûü?â˜Q¯?â˜Rþ²Ÿ?☱UŠÏ?☲¤¶³?â—´È „?â—´1.?â—Mp×n?â—MqUôÞ?â–æφ?â–æÐa*¼?â–€-éû?â–€/9 ?â–ŒŽ‰?â–ÝÊ?╲êÿ¼.?╲ìN¼¶?â•LI=½|?â•LJŒ¶Ê?â”å§H™(?â”娗‹;?â“KÅg?â’äz‚‡š?â’ä{ÑU‹?â’}×\’?â’}تæJ?â’4Ù?â’5QÇW?â‘°wgÀ?â‘°‘Æ ?â‘Iì¹8Ì?â‘IîéÖ?âãHÈ£É?âãJM˜?â|¤¥´Ò?â|¥ôWg?âPx?âŸ\?â¯[É?â¯]ª7?âH·ŒØ?âH¸^¾?âŽâ$?âŽârŠ°?âŽ{mn?âŽ{nTìx?âŽǶþî?âŽÉv&?â®"5§'?â®#„$?âG|‚i?âG}Ðø,?âŒàÖÃÆ?âŒà×ì%O?âŒz0‡^œ?âŒz1Õ¸ë?⌊?]¨?⌋°½?⋬ãÅ÷í?⋬åCÇ?â‹F=+"?â‹F>ioÁ?âŠß–?Q?âŠß—@¶?âŠxï1©'?âŠxðßR?âŠGó ?âŠIA:÷?≫ ƒFD?≫¡Ñmú?â‰DøâŽÞ?â‰Dú0¯Y?âˆÞQã€?âˆÞR^üÁ?âˆw©P-?âˆwª\b3?âˆÚÒ™?âˆ(Ýe?⇪Xv¡¯?⇪YÄ¥@?â‡C¯áÉo?â‡C±/ÅÆ?â†Ýd$?â†ÝjYA?â†v^&ox?â†v_t][?↴ÿ÷i?↶MÞ?â…© ©2Û?â…© ÷H?â…Bb" [?â…BcoáŽ?â„Û¸j²?â„Û¹¸‚ù?â„uƒ@s?â„uÑ 1?â„dk²V?â„e¹tÙ?⃧º$†?⃧»qÎÎ?âƒA¬Œ‚?âƒAú@?â‚Úeß?â‚ÚfRdz?â‚sº-ØÉ?â‚s»{~b?â‚ &Ò&?â‚ tp„?â¦cð/`?â¦e=ƃ?â?¸‰î?â?¹×}û?â€Ù ô6¥?â€ÙA¿S?â€ra/®?â€rb|ˆ"?†µ:xR?†¶‡òŠ?⥠¥­?⥠dª?â>\ÃŒS?â>^ø?â~×°AF\?â~×±Žªä?â~qíë?â~qÝK9?â~ V¯?â~ Wüó(?â}£© C#?â}£ªí‘û?â}<üb3D?â}<ý¯zá?â|ÖNõ1ê?â|ÖPBrL?â|o¡Yƒü?â|o¢¦½#?â|ó5E?â|ôÜg2?â{¢E–_Ù?â{¢F㊊?â{;—nòô?â{;˜¼k?âzÔé%4?âzÔêfAp?âzn:”ô?âzn;â ?âz‹ây¯?âz/‡u?ây ÝÞD?ây ÞNäÏ?ây:-ó?ây:/@a?âxÓ~¶,%?âxÓ€$:?âxlÏKnÿ?âxlИ_Ù?âx²ÊÉ?âx ÿ´h?âwŸoìP×?âwŸq93;?âw8¿ø?âw8ÁDöC?âvÒÖ5B?âvÒ# 0?âvk_†œ¸?âvk`Óil?âv¯ kq?âv°V0é?âuþ^É’?âuÿ«‡Ï?âu7M†´Œ?âu7NÓkŽ?âtÐœbÅ?âtÐÎŒ?âtiëNÃc?âtiì›kï?ât9îâ?ât;;ƒ_?âsœˆaõ)?âsœ‰®??âs5Ö§ëÛ?âs5×ô~¶?ârÏ$ÀîA?ârÏ& yá?ârhr­@?ârhsùš¤?ârÀla2?ârÁ¸Þ[?âq› þÚ½?âq›KPª?âq4[dªô?âq4\±¦?âpͨÝz?âpÍ©êDò?âpfõªoª?âpfööÏç?âpBŠ¦?âpCÖÿ?âo™>a?âo™Š³U?âo2ÛÅÊ5?âo2ÝÀ?ânÌ( ùØ?ânÌ)m='?ânetOü ?âneuœ8?âmþÀR¿ì?âmþÁžôÅ?âm˜ )‰ú?âm˜ u·—?âm1WÔW‰?âm1Y }ì?âlÊ£SBb?âlʤŸa‰?âlcî¦dP?âlcïò|¯R?âjÉŠªP?âjbd¸ È?âjbfýŠ?âiû¯—?âiû°R ?âi”ù(Ë•?âi”út°á?âi.C ;ª?âi.Dlº?âhÇŒìyL?âhÇŽ8P ?âh`Ö¬X?âh`×Ù{ò?âgú àF?âgú!O¨¤?âg“iOP?âg“jšÓs?âg,²ojR?âg,³»$9?âfÅûdåŠ?âfÅü°˜5?âf_D/«Í?âf_E{W=?âeøŒÏÈ‹?âeøŽl¿?âe‘ÕEG.?âe‘Öä'?âe+]¾?âe+Ûó{?âdÄe°ÞÔ?âdÄfümV?âd]­§«?âd]®ò•ñ?âcöõrø¡?âcöö¾x¬?âc=™ò?âc>`Á?âc)„Œ 2?âc)…×}Å?âbÂËÙhô?âbÂÍ$ÓL?âb\üØ?âb\H;?âaõYö:&?âaõ[A–?âaŽ ÅÅT?âaŽ¢ø?âa'çk„è?âa'è¶ÒQ?â`Á-ç„E?â`Á/2Ês?â`Zt9Üò?â`Zu…ã?â_óºbšL?â_ó»­Ò?â_aÕÝ?â_­X?â_&F7šü?â_&G‚Ä;?â^¿‹äI=?â^¿/k@?â^XÑgÔå?â^XÒ²ï¬?â]òÂ.Á?â]ò BM?â]‹[ób?â]‹]>no?â]$ ûˆl?â]$¢F€?â\½åÚ¬ï?â\½ç%ªÇ?â\W*é?â\W+Ûß²?â[ðo9ô?â[ðpi)U?â[‰³‚ã|?â[‰´ÍË¡?â["÷¾Æg?â["ù §P?âZ¼;Òv?âZ¼=ò#?âZU¼È’?âZU›?âYîÃ~ð ?âYîÄÉ»U?âYˆ¶«?âYˆcz¤?âY!JŠ5—?âY!KÔòT?âXºÓM£?âXº%?âXSÐô4€?âXSÒ>âÆ?âWíí‰?âWí7ª“?âW†V½Åö?âW†XeÄ?âW™f†ô?âWš±†?âV¸Ûçn?âV¸Ý1ÿ^?âVR@j?âVRŠô+?âUë`q”i?âUëa¼G?âU„¢{Š?âU„£Å,?âUä\õž?âUå§j?âT·&4®?âT·'a¡×?âTPgªU?âTPhômC?âSé©xº?âSéª_×l?âS‚êYwº?âS‚ë£Ï0?âS+v9î?âS,ÀŠ(?âRµlk¼R?âRµm¶P?âRN­:2?âRN®„Yó?âQçíá¼Ë?âQçï+÷Q?âQ.bŸÞ?âQ/¬Ó(?âQn¼¢c?âQpÎp?âP³®ïÝ‹?âP³°:\?âPLîüNE?âPLðFkÛ?âOæ.âã?âOæ0,2x ·R?â@>yT³y?â?ײ!Ô(?â?׳jÉ?â?pì3?â?pí] ¿?â? %âÞä?â? '+ÅV?â>£_Ž ¨?â>£`ÖëÞ?â><™¹?â><š^‘ ?â=ÕÒyàæ?â=ÕÓ±¢?â=o º« ?â=o t‰?â=DØ0b?â=F ò¥?â<¡}Òm£?â<¡(©?â<:¶©‰µ?â<:·ò=?â;Óï]b?â;Óð¦;ï?â;m'î‰o?â;m)7.¿?â;`\ž¿?â;a¥<Ó?â:Ÿ˜§Ì?â:Ÿ™ðbÞ?â:8ÐÐ ö?â:8Ò?â9ÒÕµŸ?â9Ò =ý?â9k@¸£?â9kB$°?â9xxþ¤?â9yÁxˆ?â8°Ñš?â8±_DA?â86ç’£?â86èÛ†?â7Ðìyÿ?â7Ð 4Þ-?â7iV$ -?â7iWlg?â79lb?â7ŽÂ?â6›Ä,«E?â6›Åtù¼?â64úýíœ?â64üF4Ö?â5Î1­è?â5Î2õSæ?â5gh:Yø?â5gi‚’º?â5ž¥Ñ}?â5Ÿî?â4™Ôï…?â4™Ö7¯^?â43 †p?â43 _©{?â3ÌAç.?â3ÌBfü?â3ew¸÷?â3exJ͈?â2þ¬Æl?â2þ®À?â2—âgè6?â2—ã¯îM?â21èoö?â210nÐ?â1ÊMG¯H?â1ÊN¦å?â1c‚…¾Ö?â1cƒÍ¯7?â0ü·¢·>?â0ü¸ê b?â0•ìž€?â0•íæaë?â0/!yiê?â0/"ÁD”?â/ÈV3cr?â/ÈW{6ß?â/aŠÌi)?â/aŒ5Y?â.ú¿D¶¾?â.úÀŒ{²?â.“óœVÂ?â.“ôäx?â.-'Ó>»?â.-)õ4?â-Æ[éœI?â-Æ]1K†?â-_ßyø?â-_‘'!÷?â,øôÛV?â,øÄü|?â,‘÷iæø?â,‘ø±€}?â,+*þ®k?â,+,F@³?â+Ä^s57?â+Ä_ºÀB?â+]‘Èà?â+]“›®?â*öÄýe¶?â*öÆDâH?â*ø¼Œ?â*ùZ1à?â*)+-Û?â*),O›ò?â)Â]ÝË?â)Â_%1÷?â)[“³Ì?â)[‘Ûi?â(ôÃ)ò]?â(ôÄqJ½?â(õ ƒA?â(öçÔd?â(''÷Œñ?â(')>Ö×?â'ÀZ/.Þ?â'À[vq‡?â'YŒGlz?â'YŽ§å?â&ò¾@I/?â&ò¿‡}^?â&‹ðëp?â&‹ñaa?â&%!Ôk¨?â&%#‘\?â%¾So¿C?â%¾T¶Ýº?â%W„ì ª?â%W†3#ä?â$ð¶IeE?â$ð·uB?â$‰ç‡Å|?â$‰èÎÎ;?â$#§Z´?â$#î\6?â#¼I¨6P?â#¼Jï0•?â#UzŠM¹?â#U{Ñ@À?â"î«MÜF?â"È?â"‡Ûò×`?â"‡Ý9»î?â"! yW_?â"! À4°?â!º<ám¨?â!º>(C»?â!Sm+$“?â!Snqói?â ìV”|?â ìž\?â …ÍcÕ¹?â …Îª–?â ýRù£?â þ™²Á?â¸-$‘?â¸.jµr?âQ\×Ù?âQ^Ä}?âêŒl?Í?âê²ã4?⃻äŽ?⃽*®¶?âë>©Î?âì…>¹?â¶{›?â¶Â)=?âOI›?âOJᆆ?âèxœèž?âèyãgÒ?â§fm?â¨ÇÞd?âÖHnÍ?â׎߅?â´ò<æ?â´8¦a?âM3~Æ?âM4Å(B?âæaî)X?âæc4„Y?â@?⑆ÒÛ?â¾uÈ?⿼?â±ìŽÓ?â±íÔb?âK‰£'?âKÏá2?âäHhKÊ?âäI®‚˜?â}v*<â?â}wpls?â£Ï€¥?⥨ø?â¯ÑX!G?â¯ÒžB]?âHþÄ6ò?âI PÊ?ââ,çÀ?ââ-Yú[?â{YG=ä?â{ZIA?â†^5–?⇤9¶?â­³Xíö?â­´žêØ?âFà7&?âFá}tË?âà ùå\?âà?ÓÃ?ây9 M§?ây:æ4Ñ?âf*»2?âgp›?â«’™?"?â«“ßÑ?âD¾ëñ“?âDÀ1Ã?âÝë"ã?âÝìh­Ð?âw>t?âwƒÛj?âC=½?âDƒxË?â©o"a?â©ph’?âBšì‹?âBœ1ÊÉ?âÛÆšœ¸?âÛÇàB¸?âtò-Åá?âtósd£?â¥Ìà?âëdd?â§IŸï?â§JH07?â@tDræ?â@u‰ûð?âÙŸk:ñ?âÙ °¼½?ârÊw+ç?âr˼¦u?â õh3ö?â ö­§F?â ¥ >d%?â ¥!ƒÐ9?â >JùðD?â >L?U?â ×ušÍz?â ×và+?â p !°?â p¡fq ?â ÊŒèâ?â ËÒ7ÿ?â ¢ôÞP?â ¢ö#—ß?â <E0?â < Z…Ñ?â ÕI1õ@?â ÕJw.¤?â ns4q(?â nty£N?â ´þ?â žaßæ?â  Æêæ•?â  È0 @?â 9ðŸÞ?â 9ñä3K?âÓ9OÜ?âÓ~e ?âlC¹·V?âlDþÅH?âm Bq?âneI%?âž–mû?âž—²q?â7¿ >Í?â7Àå7?âÐè¹Ñé?âÐéþÂã?âj¹ÌQ?âjþ¶?â: h¤?â;åK#?âœcm•?âœd²pF?â5Œ!w6?â5fK:?âδ¼³ø?âζ€½?âgÝ?l›?âgÞ„2#?â©R?âíÑœ?âš-ùÔ¿?âš/>‹Ì?â3V1¥é?â3WvU·?âÌ~P¬w?âÌ•U?âe¦VòN?âe§›“¡?âþÎDzU?âþωj?â—öq$?â—÷^û?â1ÕÒ±?â1^K?âÊEy¶¸?âÊF¾;?âcm'?âcnI¤8?áÿü”x^=?áÿü•¼Ô?áÿ•»Ó5d?áÿ•½¤?áÿ.ãÒ*?áÿ.äZ9Ž?áþÈ @a?áþÈ „ÁÆv?áüÅÌ­g?áüÅÍñ£ ?áü^óHŒ¼?áü^ôŒÁo?áûøÌí?áûø2b?áû‘@7õ7?áû‘A|n?áû*fŒ`p?áû*gÐi?áúÃŒÉ^??áúÃŽ uú?áú\²îñ~?áú\´3û?áùõØýM‹?áùõÚAVÊ?áùŽþôY~?áù8[?áù($Ô:Ö?áù(&5™?áøÁJ"?áøÁKá§?áøZpNÎT?áøZq’º›?á÷ó•êJÄ?á÷ó—./Í?á÷Œ»oµã?á÷Œ¼³“®?á÷%àÞX#?á÷%â".±?áö¿6Oþ?áö¿zM?áöX+wµ?áöX,»}?áõñP¢Ü?áõñQæQ¯?áõŠu¶û?áõŠvú´§?áõ#š´ýT?áõ#›ø¯«?áô¼¿œ¯'?áô¼ÀàZ@?áôUän1?áôUå±¾ ?áóï )cÑ?áóï mn?áóˆ-·Õ?áóˆ/4?áó!R]–Î?áó!S¡$î?áòºvÖ½?áòºxCâ?áòS›9è_?áòSœ}h?áñ쿇7R?áñìÀʯ¹?áñ…ã¾Üþ?áñ…åN'?áñàÀm?áñ $*X?áð¸+íè?áð¸-0i•?áðQOãÀú?áðQQ'h?áïêsÄø@?áïêuLp?áÄ,?áÔ?áï»G5B?á＊zö?áîµÞè\?áîµà+šy?áîOtB ?áîO·yE?áíè%ë ž?áíè'.<˜?áíIL¾_?áíJç?áíl™n»?áímÜ8?áì³Ñ.,?á쳑Hk?áìL²ô?áìL´7'?áëåÖ0þ?áëå×E<Á?áë~øûœ:?áë~ú> ¿?áëáN?áë$”?áê±>²­Õ?áê±?õ£Ý?áêJaoðý?áêJb²ßÆ?áéã„Æ?áéã…[®?áé|¦­S¬?áé|§ð3ù?áéÉ-¯¦?áéÊpˆµ?áè®ë™Ö&?áè®ìܧö?áèH ñå^?áèH4¯ñ?áçá06n?áçá1xÅÃ?áçzRf+?áçzS¨×B?áçt‚MÈ?áçuÅ ?á欖Š±‡?á欗Í_!?áæE¸Oß?áæE¹Áö;?áåÞÚ`Fþ?áåÞÛ¢æ?áåwü-§:?áåwýp??áåçz?áå* §?áäª?ϸ?áäª@ÐY?áäCa Í^?áäCbcO‚?áãÜ‚ g¯?áã܃ââ•?áãu¤ µè?áãu¥O)?áãÅeãñ?áãƨP[?áâ§æ«æ†?áâ§çîK±?áâAÞÔÛ?áâA !2È?ááÚ(þÍ?ááÚ*A#·?áásJ ß\?áásKN.Ì?áá kp?áá lHO¢?áोíq&?áà¥/²?áà>¬Â?áà>®QÊ?áß×Í„(?áß×ÎÆZ‘?áßpî3£®?áßpïuÎç?áß Іj?áß ªd?áÞ£/[ í?áÞ£0&©?áÞO?áÒû™À?áÒ”ßÃÑ+?áÒ”á–?áÒ-þ9#Ž?áÒ-ÿz_»?áÑÇžOk?áÑÇß„Y?áÑ`:ô=h?áÑ`<5k?áÐùY;½?áÐùZ|A.?áÐ’wr"ð?áÐ’x³B"?áÐ+•™X??áÐ+–Úp4?áÏij°ßE?áÏÄ´ñïû?áÏ]ѸÁ?áÏ]ÒùÊ•?áÎöï± È?áÎöðò?áÎ ™Õ?á®ÕrŒ?á®ÖC"°?á­šîêžI?á­šð)G.?á­4Ç&ò?á­4 È™?á¬Í"š0p?á¬Í#ØÊØ?á¬fŠ?á©üל¦:?á©•ïé†Ü?á©•ñ'çM?á©/ kóB?á©/ ªLt?á¨È"åŒR?á¨È$#ÞE?á¨a€?á¥î½V}?á¥*­ ð?á¥*ë®?á¤ÃÒ±ù?á¤Ã!»x?á¤\8ðdî?á¤\:.g.?á£õRì?á£õSDî?ᣎká?ᣎlQÔÐ?á£'„Ý>?á£'…WÉÁ?á¢Àü?á¢ÀžUú@?á¢Y¶¥-?á¢Y·Lƒ2?á¡òÎý€?á¡òÐ;fG?á¡‹çä÷§?á¡‹é"Ç/?á¡%ÄßP?á¡%§™?á ¾cV?á ¾Û$`?á W2n~œ?á W3¬8g?áŸðK8TË?áŸðLvX?៉cúõ%?៉e8 s?áŸ"|¶nê?áŸ"}ôù?áž»•jÑY?áž»–¨n(?ážT®2|?ážT¯UÈ ?áíÆ¿¦3?áíÇý4…?á†ßa^e?á†àžåx?á÷üx?áù9÷í?᜹ôí?᜹Îm‚?áœR)Öy?áœR*\GÏ?á›ëA¦G?á›ëBã±,?ᛄZ'HX?ᛄ[d«0?á›r¡ð;?á›sßKÕ?ᚶ‹[y?ᚶŒS¯Ô?ášO£„„Ü?ášO¤ÁÑø?á™è»ì{?á™è½)Ám?á™ÔNp¦?á™Õ‹¯D?á™ìªX ?á™íç?ᘴNµ?ᘴ=~Õ?á˜MPjM?á˜M“.?á—æ5šº ?á—æ6×Û¬?á—MßM ?á—Ogm?á—f$Û?á—g[7ÿ?á–±~Wdô?á–±”pÙ?á–J–‹n?á–J—È!?á•ã®¹Zf?á•ã¯öWÍ?á•|Æâ;ƒ?á•|È1«?á•ßº…?á•àB©n?á”®÷$ ?á”®ø`éJ?á”H=Ê?á”Hyå5?á“á'Pà§?á“á(¹Ó?á“z?_¸Ÿ?á“z@œŠŒ?á“WiŽ3?á“X¦Xâ?á’¬onpt?á’¬p«3ä?á’E‡n‚Ã?á’Eˆ«>ô?á‘ÞŸi¹?á‘Þ ¦n?á‘w·`=ˆ?á‘w¸œë;?á‘ÏS"]?á‘ÐÈÑ?á©çB®ì?á©èN!?áBÿ-Ëk?áCjca?áÜ”j?áÜQ%!?áu.÷ã?áu03¢[?áFÕgÑ?áHê ?Ꭷ^¯¸?Ꭷ_ì²?áŽ@v…ÂÎ?áŽ@wÂ6‰?áÙŽWØ€?áÙ”Dü?ár¦&Õ?ár§bn?á ½ðbÆ?á ¿,ÀÄ?ጤնàô?ጤÖó7³?áŒ=íy´+?áŒ=?á‹×8ÝÒ?á‹×u&?á‹pôXŒ?á‹p0™Ž?á‹ 4¬b¦?á‹ 5èœi?ኢL`é6?ኢMº?áŠ;dr?áŠ;eN:·?á‰Ô{¿ë ?á‰Ô|ü?á‰m“j„$?á‰m”¦ ë?ቫé¤?ቬMÿ,?ሟ¶#°?ሟÃò1ù?áˆ8ÚWUv?áˆ8Û“\€?á‡ÑñõÚ?á‡Ñó1¥?á‡k Ôú?á‡k Ì͇?á‡!)@x?á‡"e1Æ?á†8¾ß8?á†9úÉG?á†6PQÆÖ?á†6Q©¦?á…Ïgâ3?á…ÏiáÄ?á…ho¬'?á…h€«€y?á…–úÀÌ?á…˜6ß?á„š®ƒtÇ?á„š¯¿:›?á„3Æ ß>?á„3ÇFÓ?áƒÌÝ‘AÝ?áƒÌÞÌù3?áƒeõÆ?áƒeöQ/Ý?á‚ÿ —§È?á‚ÿ ÓP ?႘$Üñ?႘%S~Š?á‚1;– …?á‚1<Ѻß?áÊSˆ?áÊTN.?ácj=^?áckÈÉ:?á€ü‚-n?á€üƒA² ?ပ™}t‚?ပš¸ñà?á€.°ó.â?á€.².¥?áÇÈgW ?áÇÉ¢Åê?á`ßÚ >?á`ápß?á~ù÷Ka¼?á~ùø†Â?á~“»h‚?á~“öÁ¥?á~,&*9Ê?á~,'e‹®?á}Å=—Ð?á}Å>Ó³?á}^UGŠ?á}^V?Šð?á|÷lo¨5?á|÷mªä]?á|ƒÚÄ?á|…P­?á|)›C£j?á|)œ~Ñ?á{²¬Mß?á{³çtJ?á{[Ê7Q?á{[ËOV}?ázôá{g´?ázôⶠ?ázøáí¸?ázúþe?áz'Gå†?áz'‚îô?áyÀ'­W?áyÀ(èY??áyY?Q?áyY@MKó?áxòVvüü?áxòW±ð­?áx‹mÛA6?áx‹o-¨?áx$…?GN?áx$†z,?áw½œ£+k?áw½Þ _?áwV´ë?áwVµBí ?ávïËnEÇ?ávïÌ©=?ávˆâÔ?ávˆäe9?áv!ú;1ó?áv!ûuòë?áu»¢6?áu»ÜÌï?áuT) H£?áuT*Cû?átí@pû¾?átíA«¦ù?át†WÙ&î?át†YÊë?átoAæ:?átp|‚ø?ás¸†«Ay?ás¸‡åÖø?ásQžG=?ásQŸOÕ}?árêµ€H?ár궺¡I?árƒÌ뻲?árƒÎ&;t?áräX@Â?árå’¹E?áqµûŸ?áqµý)G?áqO46¾?áqOn Ã?ápè*£Ò2?ápè+Þ4ø?ápB˜é?ápCNôo?ápY†’²?ápZÀæù?áo³pùÔÆ?áo³r4!Î?áoLˆnˆ–?áoL‰¨Î_?ánåŸä”D?ánå¡ÒÎ?án~·\ƒ?án~¸–QÎ?ánÎÕD¹?ánÐtÅ?ám°æOù ?ám°çŠ!×?ámIýÌg‘?ámIÿ‰?álãJ˜?álㄲa?ál|,Ê™ ?ál|.¬?álDLxð?álE†„Á?ák®[ÐS¬?ák®] X>?ákGsV0ÿ?ákGt.R?ájàŠÞ\?ájàŒq?ájy¢i{»?ájy££j‘?áj¹øh9?áj»2OÐ?ái«Ñ‰Ëá?ái«Òì9?áiDéµ?áiDêWŽ2?áhÞ´$Ù?áhÞíö³?áhwM0E?áhw†úà?áh/éœ?áh1"Ãø?ág©G‡‰b?ág©HÁE?ágB_(ó×?ágB`b¨µ?áfÛvÍ::?áfÛxçÙ?áftŽtŒx?áft®2Ø?áf ¦×b?áf §Xvƒ?áe¦½ÌJä?áe¦¿âÆ?áe?Õ|Ú‚?áe?Ö¶k%?ádØí0¨´?ádØîj2?ádrçÑF?ádr!Sk?ád ¢U?ád ÛÐ?ác¤4`B—?ác¤5™¶>?ác=L!®º?ác=M["?ábÖcæ§Ü?ábÖe ?ábo{¯I¶?ábo|觠?áb“{©U?áb”µ?áa¡«Kº.?áa¡¬… š?áa:Þ´?áa:ÄXæá?á`ÓÚ÷r?á`ÓÜ0³‹?á`lòÓ0?á`lô iÃ?á` ²òÑ?á` ì%A?á_Ÿ"–Ý6?á_Ÿ#Ðg?á_8:~ér?á_8;¸ d?á^ÑRk,?á^ÑS¤I2?á^jj[È»?á^jk”Þ0?á^‚P¿?á^ƒ‰Í=?á]œšK\j?á]œ›„ca?á]5²KìO?á]5³„ì?á\ÎÊQ) ?á\ÎËŠ!ƒ?á\gâ[4í?á\gã”&'?á\újz?á\û£u?á[š}Þè?á[š¶Á¤?á[3*–¦Ð?á[3+Ï‚M?áZÌB´„?áZÌCíXT?áZeZ×j'?áZe\7&?áYþrÿˆ§?áYþt8Ng?áY—‹,íË?áY—Œe¬L?áY0£_“¦?áY0¤˜Jè?áXÉ»—£.?áXɼÐS2?áXbÓÕ,?áXbÕ Åñ?áWûì*?áWûíP¾°?áW•`£î?áW•™>5?áW.®Úe?áW.çmm?áVÇ5È?áVÇ6;SÎ?áV`M\fÜ?áV`N”ëf?áUùe»óå?áUùfôq0?áU’~![Ð?áU’YÑÛ?áU+–Œ¬»?áU+—ň?áTÄ®þé?áTÄ°6„w?áT]Çu¦f?áT]È®µ?áSößóPŸ?áSöá+©¯?áSøw=½?áSù¯Ž?áS){Ü?áS)9Æn?áRÂ)’?áRÂ*ÊHZ?áR[B)"?áR[CaR7?áQôZÆ›Ñ?áQô[þЧ?áQsjªÝ?áQt¢Øt?áQ&Œ^¶?áQ&M…?áP¿¤ÈÓ?áP¿¦4ì?áPX½ƒÝ?áPX¾»·?áOñÖDúP?áOñ×} ì?áOŠï ò€?áOŠðEûÝ?áO$Ýÿ!?áO$ >?áN½ µHí?áN½!íCË?áNV9“Ð?áNV:ËÄ.?áMïRy–¬?áMïS±ƒ ?áMˆkfÞµ?áMˆlžÃ×?áM!„[‡ê?áM!…“eÍ?áLºWÁ©?áLºž˜M?áLS¶[…è?áLS·“UM?áKìÏfö®?áKìО¾Õ?áK…èz ð?áK…é±ÎØ?áK”û?áKÌ´ª?áJ¸·±.?áJ¸ïc—?áJQ3âY?áJQ5C?áIêMú?áIêNLú?áIƒfO¯Y?áIƒg‡L?áI’y”?áI€Ê?áHµ˜Ýf´?áHµšôä?áHN²0ŸR?áHN³h&C?áGçËŒ´?áGçÌÖe?áG€äïõr?áG€æ'må?áGþ\<%?áGÿ“­Y?áF³Ðø¶?áF³b«?áFL1NSº?áFL2…¶p?áEåJÔMÆ?áEåL ©>?áE~dbûl?áE~ešO¥?áE}úwâ?áE1ÄÛ?áD°—š¶i?áD°˜Ñü$?áDI±C߉?áDI²{?áCâÊ÷\5?áCâÌ.“r?áC{äµ_?áC{åì?áCþ|“ž?áCÿ³¼^?áB®M6A?áB®„WÁ?áBG2':.?áBG3^Tp?áAàL ¦—?áAàMA¹š?áAye÷C?áAyg.©?áAî%d?áA%)ê?á@«™îSr?á@«›%P¸?á@D³øI2?á@Dµ/?:?á?ÝÎ ~?á?ÝÏBïG?á?vè)€y?á?vé`h?á?Pþã?á?‡ß/?á>©‚h:?á>©¹AF?á>B6½äë?á>B7ô¶¹?á=ÛQ‚¼?á=ÛR:MK?á=tkSOu?á=tlŠÆ?á= …­R4?á= †äF?á<¦ ¦ ?á<¦¡HZÜ?áÑV?á+^:tN ?á*÷U±Uˆ?á*÷VæË”?á*r1N?á*sf½L?á*)ŽÀ,/?á*)õ“½?á)«^)ä?á)¬“Š4?á)[È ò3?á)[É?KD?á(ôäË÷?á(ôåøÝÊ?á(Ž‹è?á(ŽÀ\{?á('`¥]?á('•è²?á'À;DFˆ?á'À?á'YYk1?á&òu5îr?á&òvk ?á&‹’D?á&‹“y6s?á&$¯`‰?á&$°•¨5?á%½Ì‹`I?á%½ÍÀx'?á%VéÄ©´?á%VêùºS?á$ð yd?á$ðA‚Ä?á$‰$bÜ¿?á$‰%—Þà?á$"AÇÓû?á$"BüÎÞ?á#»_;†õ?á#»`pz™?á#T|¾ ±?á#T}òö?á"íšOU¼?á"후:ã?á"†·ïŒT?á"†¹$j=?á"Õž´A?á"ÖÓŠë?á!¸ó\îº?á!¸ô‘¾&?á!R*.ª?á!R^ö×?á ë/¯À?á ë0;p¯?á „Lò^D?á „N'ô?á jíN6?á l"¨?ᶈ÷ Ä?ᶊ,K÷?áO§\¬?áO¨F ?áèÅ:ˆ«?áèÆo%a?áãsS%?áä§èœ?á»Â×?áðQ?ᴠʢ?á´!HQ?áM>}Î?áM?±ŸŠ?áæ\÷Öð?áæ^,On?á{‚—$?á|·c?ᚈ'?á›Qò(?ᱸȜÑ?á±¹üÿ“?áJ׃ï¢?áJظK%?áãöO¡±?áã÷ƒõ÷?á}+¬r?á}_ùy?á4(?á5Lbð?á¯S(¸?á¯TIgB?áHr"»_?áHsVòª?áá‘@è÷?áá’u?áz°oÒŒ?áz±£û[?áϯx,?áÐ㙼?á¬ït?á¬ð4Å?áFag×?áF•zë?áß-ÓÌZ?áß/Ø/?áxMW/?áxN‹3™?álëªí.{;?á>îb!¦?áØ §é?áØÚ®?áq.3+Ñ?áq/fÃÀ?á NÓï?á P’Ÿ?á£o….ˆ?á£p¸·ú?áïU?á žºx•t?á ž»«Öw?á 7Ûø‹+?á 7Ý+Äð?á Ðý‹Ž±?á Ðþ¾Á8?á j1ÀÐ?á j dì?á @ë(?á BL ?á œb·×Þ?á œcêô©?á 5„—Ýv?á 5…Êó?áΦ‹YŽ?áΧ¾gÝ?ágÈ’L?ágÉÅS?áꬻ@?áëß»?áš ÚÕ4?áš ÍÈ?á3/ M?á30O‘£?áÌQr?àþ\6$¯… 2?àõ…cD@?àõ…duÎé?àõ‰KÍ’?àõŠ}xþ?àô·¯j‡£?àô·°œ+Ñ?àôPÕ ]À?àôPÖÑú¯?àóéûí\¥?àóéýòW?àóƒ"Qƒð?àóƒ#ƒd?àóHÍ©?àóIþŽß?àòµo_ÓÊ?àòµp‘SÂ?àòN– û”?àòN—;tO?àñç¼Ë¹–?àñç½ý+?àñ€ã¤ùÃ?àñ€äÖd?àñ •ÈÒ?àñ Ç+Ò?àð³1žT-?àð³2ϯð?àðLX¾‡Í?àðLYïÜR?àïåö„?àïå'ÑI?àï~§Fi?àï~¨w¯%?àïή6²?àïÏßu}?àî°ö-ùp?àî°÷_0ý?àîJÅÑž?àîJ÷í?àíãEuÅ`?àíãF¦îr?àí|m=áW?àí|no*?àí•Rã?àí–Omy?à쮽ÿg?à쮾H¿?àìGå(1?àéx…›?àé)..é?àé*_?àèªR!Fí?àèªSRÛ?àèC{-™T?àèC|^]?àçܤS%Ÿ?àçÜ¥ƒâ?àçuÍ’ ?àçuÎÂÎA?àçöês?àçø! ?àæ¨ \FÏ?àæ¨!Œí‰?àæAIçšD?àæAK9À?àåÚsŒ‡ ?àåÚt½H?àåsK&¼?àåsž{·¼?àå Ç#_?àå ÈT !?àä¥ñ£û?àä¥òF&€?àä?!§Ÿ?àä?R"æ?àãØEGƒ>?àãØFw÷G?àãqo‡cÿ?àãqp·ÐË?àã ™áO×?àã ›µf?àâ£ÄUYÔ?àâ£Å…¸%?àâ<îãŽt?àâ<ðå‡?àáÖŒ»?àáÖ¼P‘?àáoDN½)?àáoEÁ?àáo+Ö¼?àáp\?àà¡š#`x?àà¡›Sš”?àà:Å5fÖ?àà:Æe™´?àßÓðaüÔ?àßÓñ’(v?àßm©.é?àßmÙSM?àßG ?àßH;-5?àÞŸr‡¹Æ?àÞŸs·Ï®?àÞ8ž1ü?àÞ8ŸO@§?àÝÑÉÑ‹§?àÝÑË“?àÝjõžÌµ?àÝjöÎÌå?àÝ!ˆ°B?àÝ"¸©4?àÜMw ?àÜN¿h¾?àÜ6y±Ÿ~?àÜ6zá‰õ?àÛÏ¥ï)?àÛϧ ×?àÙÍ…ïýÞ?àÙf±£ˆ.?àÙf²Ó?÷?àØÿÞ¢£R?àØÿßÒSÞ?àØ™ ½¶±?àØ™ í_ÿ?àØ28ôÈ!?àØ2:$j2?à×ËfGÐv?à×ËgwkI?à×d“¶ü–?à×d”æ,?àÖýÁBXÚ?àÖýÂqå2?àÖ–îéë?àÖ–ðp1?àÖ0­Æ#?àÖ0ÝD?àÕÉJü×?àÕÉK½sw?àÕbxŠ›†?àÕbyº é?àÔû¦£ÈŠ?àÔû§Ó0¯?àÔ”ÔÙoª?àÔ”ÖБ?àÔ.+·=?àÔ.[ç?àÓÇ1š«’?àÓÇ2Éýÿ?àÓ``&_t?àÓ`aUª£?àÒùŽÎß0?àÒùþ#"?àÒ’½”=”?àÒ’¾ÃzI?àÒ+ìvj?àÒ+í¥Ââ?àÑÅuÚø?àÑÅ¥ 3?àÑ^J’,?àÑ^KÁS?àÐ÷y˦Õ?àÐ÷zúÆ”?àЩ"J´?àЪQc6?àÐ)Ø—Û)?àÐ)ÙÆìn?àÏÃ,¦È?àÏà [°Ð?àÏ\7ß 6?àÏ\9 ?àÎõg¯³?àÎõhÞ@?àÎŽ—œÐv?àÎŽ˜ËÄÆ?àÎ'ǨT9?àÎ'È×AL?àÍÀ÷ÑŸ´?àÍÀù…‰?àÍZ(ßš?àÍZ)G¾2?àÌóX~ ¢?àÌóY¬ãý?àÌŒ‰Lü?àÌŒŠ0?àÌ%¹¢¬Ø?àÌ%ºÑu¸?à˾êb+o?à˾ëí?àËX?èh?àËXn¢Î?àÊñL;ïö?àÊñMj£?àÊŠ}V:Ç?àÊŠ~„æ³?àÊ#®~?àÊ#¯½§-?àɼßæ9K?àɼáÖ¼?àÉV[þÕ?àÉVŠ• ?àÈïBð_@?àÈïDî6?àȈt£m4?àȈuÑôî?àÈ!¦u'Ý?àÈ!§£¨Z?àǺØeÂL?àǺٔ;‹?àÇT u5.?àÇT £§1?àÆí<£Œ¥?àÆí=Ñ÷j?àƆnðáÍ?àƆpEU?àÆ¡]@Å?àÆ¢‹?àŸÓ赫?àŸÕ ¹?àÅR“`?àÅRÁ­ä?àÄë9]8¤?àÄë:‹8?àÄ„lFr]?àÄ„mt±³?àÄŸOë?àÄ }>?àöÒwÛ?àöӥ6·?àÃPÀ7‚?àÃPîa"?àÂé9*ê2?àÂé:Y •?à‚lµd?à‚mãC?à _¾D?à¡Ò-?àÁ´Ô*,?àÁ´ÕX$×?àÁN„[?àÁN B‰Ê?àÀç<ôð?àÀç=Ló"?àÀ€pIã?àÀ€qw†Ø?àÀ¤”Z¿?àÀ¥ÂJw?࿲Øÿ{{?࿲Ú-cö?à¿L Šñ#?à¿L¸Òa?à¾åB6ÁI?à¾åCd›J?à¾~wÔ?à¾~x0ä˜?ྫïîÊ?ྭºR?཰àýW8?཰â+‚?à½J+d?à½JY!?à¼ãKz4Ä?à¼ãL§ê”?à¼|€éÎÓ?à¼|‚}g?༶z7Â?༷§ß?à»®ì+Ž÷?à»®íY/?à»H!ýæè?à»H#+Å?àºáWñ8 ?àºáYÉÀ?àºzŽ¨|?àºz32à?àºÄ;=z?àºÅhÀ¡?๬ú’v?๬û¿’`?à¹F1 2v?à¹F27§#?à¸ßg£ª\?à¸ßhÑÌ?à¸xž^Š?à¸xŸ‹ðM?à¸Õ:ê?à¸ÖhI„?à·« 8Ñ2?à·« f(ì?à·DCXPl?à·DD… é?à¶Ýz™‡Š?à¶Ý{ÆÐÊ?à¶v±þ* ?à¶v³+l?à¶醔÷?à¶ê³Ï¾?൩!1 ?൩"^Fª?àµBXý¶æ?àµBZ*ã3?à´Ûì:?à´Û’¤K?à´tÈýžÉ?à´tÊ*¼?à´1?à´^$¦?೧9†Øé?೧:³èD?à³@qÿš?à³@s,&¸?à²Ùª™ñu?à²Ù«ÆòV?à²rãWIñ?à²rä„C–?ಠ7MÂ?ಠd@*?à±¥U:¿?à±¥Vfóë?à±>Ž_€K?à±>Œd:?à°×ǧÍ*?à°×ÈÔ©Ü?à°qû-?à°q?Т?à° :¡)Š?à° ;Í÷Ã?௣tRd?௣u+ ?à¯<®&£5?à¯<¯Sbõ?à®Õè?à®ÕéJË”?à®o"8²ˆ?à®o#ecÏ?à®\všR?à®]£D\?à­¡–×ܯ?à­¡˜}?à­:Ñ\‹Ý?à­:Ò‰'n?à¬Ô ¦À?à¬Ô 1;?à¬mFÐF ?à¬mGüÓ"?ି‚g?ଂìC?à«Ÿ¼Òa)?à«Ÿ½þßÈ?à«8øôŒ?à«8ù5kï?àªÒ3c[«?àªÒ4ËÑ?àªkná›Õ?àªkp¿?પƒºZ?ફ°?à©æK¦.?à©çxŸ?à©7"9î?à©7#eã#?à¨Ð^KÇ9?à¨Ð_x2?à¨iš‚d±?à¨i›®©m?à¨ÖÝm˜?à¨Ø «?ড়\úŠ?ড়‰0Í?à§5P=?à§5Q-FD?à¦ÎŒÉÕÖ?à¦Îõý ?à¦gÉ·B ?à¦gÊãb›?à¦Ézã?à¦õ”5?ग़Dx´?ग़E,ŠÉ?à¥3\Zˆ?à¥3‚ˆea?à¤Ì¾Ý8ë?à¤ÌÀ <‡?à¤eüƒ©?à¤eý¯ ?à£ÿ:MùÞ?à£ÿ;yï?ࣘx> ˆ?ࣘyiûo?à£1¶SLn?à£1·3?à¢ÊôÏ?à¢Êõ¹®ˆ?à¢d2í§Ÿ?à¢d4Ò?à¡ýqrè?à¡ýrž¹?à¡–°œ#?à¡–±IeÞ?à¡/îíÕ×?à¡/ð˜U?à É-ã Õ?à É/\?à blÿ½?à bn*¼Ã?àŸû¬@,|?àŸû­kÙF?àŸ”ë§ Ò?àŸ”ìÒ°_?àŸ.+3¼:?àŸ.,_ZŒ?àžÇjæY.?àžÇlðC?àž`ª¾àh?àž`«êpA?àùê½jb?àùëèòþ?à“*â?à“, ñ?à,k,Û‡?à,lXU¬?àœÅ«Ÿ« ?àœÅ¬Ëó?àœ^ì:ÉD?àœ^íf4ð?à›ø,üj?à›ø.'Ï?à›‘mä­ë?à›‘o ?à›*®ó¥,?à›*°û$?àšÃð)O?àšÃñTÍ?àš]1…Êo?àš]2±ï?à™ös "Î?à™öt4c?à™´³p?à™µÞ©˜?à™(ö„¿??à™(÷¯ñ ?à˜Â8}'5?à˜Â9¨QÅ?à˜[zœ ¸?à˜[{ÇÄ ?à—ô¼ãD ?à—ô¾`8?à—ÿQ)Ë?à—Ž|>§?à—'Aæc¥?à—'CqE?à–À„¢ðV?à–À…Íöº?à–Ydžûx?à–Yȱú¡?à•ó ’}H?à•ó ½u5?à•ŒMŇª?à•ŒNðx[?à•%‘ F5?à•%’K/ª?à”¾Ô¢¤J?à”¾Õ͆ƒ?à”XLÇ ?à”Xw¢ ?à“ñ\À`?à“ñ]I”!?à“Š ˆ{?à“Š¡CU?à“#ä:QP?à“#åe™?à’½(„ ¬?à’½)®Ê¹?à’Vlõߨ?à’Vn –z?à‘ï±ÏM?à‘ﲺ~ã?à‘ˆöQóß?à‘ˆ÷|œ9?à‘";<_6?à‘"I?à…æ„â?à…OøÁÚ?à…Q"‘7?à…™ÁŽŽ?à…šëV°?à„±ã´Ï¨?à„±äÞ?à„K-Òƒ?à„K.ü=H?àƒäxÈè?àƒäyD{X?àƒ}Âþ?àƒ}÷I2?àƒ -6?àƒV²/?à‚°WùF(?à‚°Y"âå?à‚I¢ð„³?à‚I¤6?àâîáß?àâï·¹?à|«Ïgçý?à|EÂÓ(?à|Eëü1?à{Þirû^?à{Þjœ,?à{w·O.Â?à{w¸xIT?à{W‘þ?à{€¥U?àzªSŒ)Ø?àzªTµ5ô?àzC¡ít?àzC£U?àyÜðz7?àyÜñ£4¿?àyv?3Ï„?àyv@\Åï?àyŽÜ&‹?àu ¬Àö?àu ­è¨Ø?àt¥ý—üd?àt¥þÀœ ?àt?Neÿ?àt?OÅþk?àsØŸÐIÜ?àsØ øÛ ?àsqñ0Æ%?àsqòYP?às B¾Ù)?às Cç[ä?àr¤”zš®?àr¤•£/?àr=æd(Þ?àr=çŒ#?àq×8{‚?àq×9£ï ?àqpŠÀ½Ü?àqp‹é#¬?àq Ý3çt?àq Þ\F ?àp£/ÕŽ?àp£0ýmè?àp<‚¤V*?àp<ƒÌ¦J?àoÕÕ¡±K?àoÕÖÉú/?àoo(ÍLj?àoo)õŽ?ào|'n?ào}OYÝ?àn¡Ï¯B?àn¡Ð×uD?àn;#eÌ?àn;$ø?àmÔwJ»—?àmÔxràV?àmmË^5/?àmm̆R³?àm =k?àm ÈS´?àl tå¢?àl u8ô±?àl9È°?%?àl9ÉØFù?àkÓ~N?àkÓ¦O)?àklr{+?àkls£$ï?àkǦçv?àkÈÎÙš?àjŸ J?àjŸ)‹3?àj8r‹G‹?àj8s³+9?àiÑÈDS?àiÑÉkêÇ?àik-Ú²?àikU¯ì?àitHú“?àiupÈ’?àhÊ“‘¬?àhË»Xp?àh7! ·?àh7"5w&?àgÐw·pñ?àgÐxß)A?àgiÎáÿ?àgiϸ“?àg%šð?àg&Á²Ê?àfœ|Ò÷ ?àfœ}ú™«?àf5Ô;Л?àf5Õcl?àeÏ+Ôš&?àeÏ,ü.Q?àehƒQØ?àeh„ÄÞÈ?àeÛ–Ÿ?àeܽ›U?àd›3¾ö¶?àd›4æu1?àd4Œù ?àd4?pá?àcÍä¡Hù?àcÍåȸÿ?àcg=ZÏÙ?àcg>‚8¥?àc–D¸ß?àc—lq?àb™ï_Ý?àb™ð†i5?àb3H©Ü°?àb3IÑ/Í?àaÌ¢%3„?àaÌ£Lg?àaeûÑ16?àaeüøuß?à`ÿU­Ç;?à`ÿVÕª?à`˜¯»n?à`˜°âI¢?à`2 ù:?à`2 hù?à_Ëdh,b?à_ËeT!?à_d¿Â?à_dÀ//G?à^þØòG?à^þ ’?à^—tÚÕ ?à^—vç?à^0Ð Û;?à^0Ñ4æ?à]Ê+rï?à]Ê,™‹?à]c‡cž?à]cˆ.`?à\üâÎ?à\üãôýÈ ?à\–?îðú?à\/šõ–k?à\/œ}?à[È÷TÒR?à[Èø{±Ë?à[bSåÚá?à[bU ³!?àZû°¨´?àZû±Ï…†?àZ• |ò?àZ•ÄF½?àZ.jÄ2C?àZ.kêôÔ?àYÇÈëá?àYÇÉC§8?àYa%§´…?àYa&Îh¡?àXúƒd©ê?àXú„‹VÍ?àX“áSÝ ?àX“âz‚È?àX-?uL4?àX-@›ê£?àWÆÉ‚?àWƞ亮?àW_üO5?àW_ýuÅ?àVù[ʨ?àVù\.Si?àV’¹òóÁ?àMÁª¡‘?àMÁЄ ?àMZx6 e?àMZy[è»?àLóÛõ¼Q?àLóÝm?àL?é¿9?àLAŒ?àL&¤ ¯?àL&¥7æX?àKÀn÷ç?àKÀ ”¶W?àKYmíÓ^?à>í÷ç¢?à>†mJÿ?à>†n@ ?à>ØšC?à>Ù¿ T?à=¹DPå?à=¹EtÒ~?à=R°<Ê%?à=R±a„…?à<ì`sZ?à<ì…&?à<…ˆ»#|?à<…‰ßÏk?à<õLñ†?à<öq–?à8ƒÑIïó?à8>á{Ê?à8@ØG?à7¶­Õ-l?à7¶®ù‚°?à7P«t?à7P$ù~?à6éŒd È?à6éˆSš?à6‚ûÿ[»?à6‚ý#›T?à6kÔ·%?à6løï…?à5µÛäi#?à5µÝšK?à5OL,nz?à5OMP˜h?à4輬ê™?à4è½Ñ O?à4‚-eçÊ?à4‚.ŠH?à4žWv?à4Ÿ{Šâ?à3µ§¡?à3µ¥´­?à3N€ä~Ò?à3N‚„¥?à2çò€P?à2çó¤ë?à2dT{?à2exrv?à2Öa´¨?à2×…¤Ò?à1´H§Üá?à1´IËÅÒ?à1M»'D?à1M¼Jåü?à0ç-ß5?à0ç/?à0€ ÐŒX?à0€¡ô_Ÿ?à0û?à0Ú ?à/³‡^Äx?à/³ˆ‚‰N?à/LúûÀ ?à/Lü}§?à.ænÒ*h?à.æoõàÍ?à.âáúð?à.äª?à.W+;Ù?à.XNãÎ?à-²Ë® -?à-²ÌѪé?à-L@jp?à-LAŽ ¡?à,åµ`wß?à,嶄 *?à,*D¾?à,+³ÏÑ?à,ŸùÔ[?à,¡X5?à+²=r?à+²Àº?à+K‹z?à+KŒžp?à*å‘ð²?à*åµ^ã?à*~wã<\?à*~y£U?à*în©?à*ï’ M?à)±e4<&?à)±fW”¯?à)JÜ6~?à)JÝYcÎ?à(äStwL?à(äT—Ád?à(}Êít?à(}̶ó?à(B¡5?à(CÄTÜ?à'°ºw ?à'°»²«?à'J2¸‘«?à'J3Û¾â?à&ã«…Æ?à&ã¬?«Å?à&}#»]?à&}$Þ|W?à&œ•/¯?à&¸G>?à%°©ÿû?à%°ÍR?à%IŽùñ¡?à%IúÀ?à$ã„õ¦?à$ã §÷?à$|‚K/4?à$|ƒn)ã?à$üL´î?à$ýo¨e?à#¯v‰~?à#¯w¬jY?à#Hñºg?à#Hò$Ÿm?à"âkµa?à"âlØ>é?à"{椈Ï?à"{çÇ_e?à"aÏAØ?à"bò6?à!®Ý5¢Î?à!®ÞXjô?à!HX×µÀ?à!HYúv®?à áÔµ~v?à áÕØ8-?à {PÏ ?à {QñÒ†?à Í$ž@?à ÎGI‡?à®I¶ð?à®Jعÿ?àGƃ„š?àGǦ!q?àáCË?àáD¯–j?àzÀÒ”ˆ?àzÁõ"ï?à>T\ ?à?vãÐ?à­¼c?à­½4ã ?àG: ±ê?àG;/*ª?àà¸C_£?àà¹eÑ+?àz6¸–m?àz7Û¾?àµlŽË?ඎñä?à­4]R—?à­5®x?àF³ŠþŠ?àF´­S3?àà2õ$?àà4Ý•?ày²Ü?ày³¿d?à2¾.?à3£ý0?ଲ£n’?ଳŦ]?àF3^€?àF4$?àß³ž~í?àß´À¨I?ày4wæL?ày5šp?ൎ«?ධÅü?à¬6â×,?à¬8êá?àE¸tzÐ?àE¹–‡M?àß:C¬j?àß;e±°?àx¼Puê?àx½rsù?à>šá>?à?¼Ø?à«Á#Ì?à«ÂDôl?àECèðÂ?àEE Ù*?àÞÆì»…?àÞÈœ¶?àxJ.nþ?àxKPH÷?àÍ®T?àÎÏî?à«Qk½ë?à«R‰v?àDÕgå?àDÖ‰D8?àÞY¡^¨?àÞZÃÄ?àwÞvÏ?àwß;,´?àbÏÒ>?àcñ€ë?àªçÄzÓ?àªèæ"I?àDl÷'?àDn-f?àÝòi?àÝóŠ¬?àwx¾?àwy:®?àþ³ø?àÿ)>‘?઄7Æ?અX˜(?àD §r?àD Èî;?àÝ‘VÏé?àÝ’xDÜ?àwE8&?àwf¥â?àŸrÓÍ?à ”:R?à ª&ß :?à ª(ÿˆ?à C®‹¡?à C¯¬ù?à Ý6vøä?à Ý7˜IÃ?à v¾¡±·?à v¿Âû`?à G á¿?à H-$1?à ©ÏµŒ?à ©ÐÖÇË?à CXžÈk?à CY¿ün?à ÜáÇ¥\?à ÜâèÒ)?à vk0-*?à vlQRÀ?à ôØoÛ?à õùŽ:?à ©~À&?à ©á§N?à Cè…?à C • ?àÜ“P^À?àÜ”qgz?àvøEÿ?àvG‚?à¨à8$?àª2p?à©4>ñ?à©5)2?àB¿ppŸ?àBÀ‘\~?àÜKÖê?àÜL9»’?àu׈ ?àuØ"e{?àc* h?àdKv¢?à¨ï”?à¨ð´æ?àB|=ûþ?àB}^ÃË?àÜ (~>?àÜ I>Ô?àu–SŽ¨?àu—tH?à#¿I?à$ßûÆ?਱k¿?ਲŒj?àB?Xø°?àB@yœl?àÛ͉$ý?àÛΩÁ‚?àu[ü–”?àu]+â?àê±9Q?àëÑÇi?à¨y§#S?à¨zǪ4?àBÞj¼?àB þêg?àÛ˜W?àÛ™w‹v?àu(8{?àu)1©¸?ภäÒ?à¹-NÙ?ßÿP”OØ?ßÿP’Õy?ßþƒ±’Þ?ßþƒ³ÒÎ?ßý¶ÓWX?ßý¶ÕT?ßüéõ$—?ßüé÷X¾ñ?ßü ‘ß?ßüáÍ?ßûP:¬Ë\?ßûP<íHÝ?ßúƒ^<ðÈ?ßúƒ`}_Ü?ßù¶‚Q`?ßù¶„‘v?ßøé¦éLh?ßøé©)ž£?ßøÌÚÚ?ßøÎF¨?ß÷Oñ¦»?ß÷Oóæðy?ßöƒÌ%¦?ßöƒ L›?ßõ¶>v:"?ßõ¶@¶Rª?ßôée¤ÿb?ßôégå ~?ßôX­Ö?ßô˜©†?ßóOµ‘X±?ßóO·ÑEô?ßò‚ÞO»?ßò‚àŽå‘?ßñ¶’ >?ßñ¶ ÑÙ¨?ßðé1Zfî?ßðé3š(ì?ßð[¨2û?ßð]çæ?ßïO†{²9?ßïOˆ»W^?ßÔÒƒ?ßî‚´i?ß²†e¯ï°?ß±¹¸=Q?ß±¹ºx ?ß°í – „?ß°íÑá#?ß° c€·ù?ß° e»ê0?߯S¹ûŽ?߯S¼6Á[?ß®‡•?ß®‡Bªk?ß­ºh¤˜?ß­ºjߟ?߬íÀÒÑê?߬íà Ê{?߬!’† ?߬!ÍpI?ß«Trã¢#?ß«Tu}ã?ߪ‡ÌÆDª?ߪ‡Ï?ß©»':¥ ?ß©»)ucú?ߨî‚@Õ¨?ߨî„{†.?ߨ!ÝØè×?ߨ!àŠô?ߧU:"9?ߧU<=µí?ߦˆ–¿‡Ó?ߦˆ˜ú ?ߥ»ô8F?ߥ»öH¯(?ߤïQïR:?ߤïT)º³?ߤ"°c î?ߤ"²fÿ?ߣViU¸?ߣV£¡a?ߢ‰op+?ߢ‰q<­k?ß¡¼Ï.‡+?ß¡¼Ñh¶?ß ð/í”^?ß ð2'´Í?ß #‘?ÛF?ß #“yíL?ߟVó)¹½?ߟVõc½[?ßžŠU«ØÊ?ßžŠWåÎ?ß½¸Â ¸?ß½ºûó†?ßœñlgÃ?ßœñ¦@(?ßœ$€«¿?ßœ$‚äÞ¼?ß›Wå~20?ß›Wç·íÅ?ßš‹JåÒJ?ßš‹Mv?ß™¾°â‘?ß™¾³²V?ߘòs9j?ߘò¬ÉÇ?ߘ%~™1?ߘ%€Ò³?ß—XæT%`?ß—Xè˜í?ß–ŒN¤MQ?ß–ŒPݲv?ß•¿·‰¢€?ß•¿¹Âù=?ß”ó![î?ß”ó#=¤C?ß”&‹¤[?ß”&MÞI?ß“Yõº{t?ß“Y÷ó¦ù?ß’`öÂ?ß’c/"à?ß‘ÀÌÇzF?ß‘Àψý?ßô9.ë?ßô;gël?ß'¦,d-?ß'¨eV?ß[À"ž?ß[ù?ߎŽê2O?ߎŽ„#g?ßÁðª«z?ßÁòãr*?ߌõ`ÑT?ߌõb:‰ž?ߌ(ÏïP?ߌ(Ò(G2?ß‹\@t@3?ß‹\B¬Û®?ߊ±Ëÿ?ߊ³ÈY?߉Ã#BkJ?߉Ã%zéö?߈ö•Œ)ö?߈ö—Äš;?߈*mD÷?߈* ¥¦Õ?߇]{åÂ?߇]~~?߆ïõ¿k?߆ò.z?ß…Äd¡à÷?ß…ÄfÚŸ?ß„÷Ùê«Ñ?ß„÷Ü"Ô?ß„+OËñ?ß„+R ï?߃^ÆEÈÑ?߃^È}ÔD?ß‚’=XK ?ß‚’?H-?ßŵ–3?ßÅ·;„Ù?߀ù-GÔ‹?߀ù/´Ê?߀,¦%,?߀,¨\ð?ß`›‘H?ß`!ÓTº?ß~“™«L ?ß~“›ã?ß}ÇTl™?ß}ÇŒ=?ß|ú—?ß|ú‘Ω\?ß|. s]Ü?ß|. ªç´?ß{a‡éd¬?ß{aŠ à?ßz•ùC´?ßz•0°¿?ßyÈ‚£7µ?ßyÈ„Ú–X?ßxüç@ ?ßxü]?ßx/Ån?ßx/üÏE?ßwbÿ>7•?ßwcuk?ßv–QV‚?ßv–ˆ{Œ?ßuÉÿÿ†?ßuÊ6+*?ßtýG¬?ßtýƒ~—ë?ßt1*ßâ?ßt1aÙº?ßsd…©ì?ßsd‡à^?ßr˜Âwˆ?ßr˜ ùT”?ßqËŒvû?ßqËŽ­É«?ßpÿÆѹ?ßpÿý‘ù?ßp2•²Æ?ßp2—èÑ¡?ßof8ý?ßofo v?ßn™¡[{(?ßn™£’7?ßmÍ(Ш?ßmÍ*PWQ?ßm¯tY?ßm±ªœ?ßl47nÄ1?ßl49¥.?ßkgÀ  ?ßkgÂ@û÷?ßj›ICAi?ßj›KyŽ|?ßiÎÓÝc?ßiÎÕO?ßi]‹’S?ßi_Áš?ßh5è›kÀ?ßh5êÑ¢?ßgitH™æ?ßgiv~­b?ßf“4“?ßfÉ9ª?ßeÐ{Yš?ßeбPK?ße ¾?ße7 ?ßd7©$Æm?ßd7«Z T?ßck7æP ?ßck:‹?ßbžÇEÏ"?ßbžÉ{Œ??ßaÒWC†N?ßaÒYy5?ßaçßzÐ?ßaê#?ß`9yÄd?ß`9{OVR?ß_m ò¥‚?ß_m () ?ß^ j?ßDGÞ|{?ßDG௳´?ßC{†_.Ž?ßC{ˆ’ºc?ßB¯.妄?ßB¯1#ö?ßAâØ’˜?ßAâÚC§?ßAÝ3?ßA„pß?ß@J,NO?ß@J.¡W?ß?}×c`_?ß?}Ù–¤D?ß>±ƒ[j?ß>±…Oì?ß=å/yiÌ?ß=å1¬ë?ß=Üz®ú?ß=ޭǶ?ß?Þ﹯ÚÒÒ?Þï¹²xá?Þîížxß„?Þîí ¦w5?Þî!Èy?Þî!öË?ÞíU}Éó?ÞíU÷mô?Þì‰nÙQ?Þì‰p¯Eæ?Þë½_ðÞº?Þë½b<ñ?ÞêñR‹â?ÞêñT?Û»?Þê%Dæý5?Þê%G>°?ÞéY8na5?ÞéY:›”Q?Þè,¨Â1?Þè.Õæð?ÞçÁ!–N¥?ÞçÁ#Ãe?Þæõ7å?Þæõd$è?Þæ) ‹CL?Þæ)¸<ñ?Þå]’ö]?Þå]¿á¤?ÞäüNLd?Þäþ{)M?ÞãÄô½I“?ÞãÄöê?Þâøíà.t?Þâøð î¢?Þâ,ç· L?Þâ,éã½?Þá`âAðQ?Þá`än“Ä?Þà”Ý?Þà”ß­­?ÞßÈÙtŒŽ?ÞßÈÛ¡E?ÞÞüÖpF?ÞÞüØHè ?ÞÞ0Óxñˆ?ÞÞ0Õ¥[„?ÞÝdÑŠr?ÞÝdÓ¶p?ÞܘÐPZ?ÞܘÒ|Nœ?ÞÛÌÏÊà?ÞÛÌÑ÷t?ÞÛÏúÈ:?ÞÛÒ&øÁ?ÞÚ4ÐßÔŸ?ÞÚ4Ó öÉ?ÞÙhÒz-û?ÞÙhÔ¦AÈ?ÞØœÔÉð‰?ÞØœÖõõù?Þ×Ð×ÏP?Þ×ÐÙûc?Þ×Û‰ñ´?Þ×ݵÚj?ÞÖ8ßú€È?ÞÖ8â&[!?ÞÕlå õÓ?ÞÕlçLÁÐ?ÞÔ êýfñ?ÞÔ í)$‘?ÞÓÔñê;?ÞÓÔó»™~?ÞÓøÝ<Î?ÞÓûÝ´?ÞÒ=æÇ?ÞÒ=¬P?ÞÑq ¥ðò?ÞÑq Ñu?ÞÐ¥ê}?ÞÐ¥H`M?ÞÏÙK.—?ÞÏÙv– ?ÞÏ (0ÓQ?ÞÏ *\,h?ÞÎA3ÍôÄ?ÞÎA5ù??ÞÍu@"µ ?ÞÍuBMñk?ÞÌ©M/0B?ÞÌ©OZ^D?ÞËÝZóˆv?ÞËÝ]¨?ÞËioͲ?ÞËkšÞü?ÞÊEx¤. ?ÞÊEzÏ0ö?ÞÉyˆ¿ˆ?ÞÉyŠ»´?ÞÈ­™5¤?Þ¬ÔÇÎ?Þ¬Öïõ4?Þ«6vI|?Þ«6Ÿ‡?Þªj,â×2?Þªj/ ›ã?Þ©žZ äœ?Þ©ž\5šó?Þ¨Ò‡ô‡g?Þ¨ÒŠ/d?Þ¨¶™á?ÞO¹w Ú/?ÞNíúÓŠ?ÞNíü9'(?ÞN"€wU?ÞN"‚5¼Ÿ?ÞMWÝxS?ÞMWÿ¯I?ÞL‹Žuå?ÞL‹—7‡?ÞKÀÚCã?ÞKÀü^1?ÞJô  7Ú?ÞJô¢/CÕ?ÞJ)*P?ÞJ),0÷?ÞI]´Üêß?ÞI]¶þÚ3?ÞH’@yÍ\?ÞH’B›®]?ÞGÆÌäüè?ÞGÆÏÏ•?ÞFûZ‚T?ÞFû\@F®?ÞF/è&lH?ÞF/êH"N?ÞEdvüó?ÞEdyšÈ?ÞD™¢%^?ÞD™þ¾?ÞCÍ—/Œ?ÞCÍ™7º™?ÞC(Y&4?ÞC*z¢ï?ÞB6ºk#Þ?ÞB6¼Œ’F?ÞAkMLC?ÞAkOm£%?Þ@Ÿàü°?Þ@Ÿãá?Þ?Ôu|š?Þ?Ôwà ?Þ? ËÆ?Þ? ìû0?Þ>= êµÆ?Þ>=£ Ü?Þ=r7Ùc4?Þ=r9ú{«?Þ<¦Ï—âï?Þ<¦Ñ¸í?Þ;Ûh&[E?Þ;ÛjGW?Þ;„ò„?Þ;¥à?Þ:D›¸wf?Þ:DÙV“?Þ9y6Á¢?Þ9y8ârÝ?Þ8­Ò›Òˆ?Þ8­Ô¼•?Þ7âoG#q?Þ7âqgר?Þ7 û?Þ7ä`ä?Þ6K«­¾?Þ6K­2EP?Þ5€J1!æ?Þ5€LQ«%?Þ4´ê"7Í?Þ4´ìB²»?Þ3éŠåñ?Þ3ép?Þ3,yšÄ?Þ3.™ù?Þ2RÎà:8?Þ2RÑŠ0?Þ1‡rÙ?Þ1‡t9¼?Þ0¼#¯_?Þ0¼Câ´?Þ/ð»Ñ€?Þ/ð½ ö„?Þ/%`°_¸?Þ/%bÐvj?Þ.Z2€:?Þ.Z Rˆš?Þ-Ž®‡ML?Þ-Ž°§GZ?Þ,ÃV®áF?Þ,ÃXÎÍ?Þ+÷ÿ©Jš?Þ+øÉ(?Þ+,©vÁ6?Þ+,«–P?Þ*aTM?Þ*aV7Y?Þ)•ÿ‹Ì?Þ)–ªÈE?Þ(Ê«ÒKÜ?Þ(Ê­ñð?Þ'ÿXìþ(?Þ'ÿ[ “þ?Þ'4Û5,?Þ'4ú¼²?Þ&hµ.¦?Þ&h·¼§Ú?Þ%e2í$?Þ%gRX?Þ$Òœ–²?Þ$Ò»óE?Þ$ÆÚWE?Þ$Èù¥‡?Þ#;xì=>?Þ#;{ }/?Þ"p+Òn˜?Þ"p-ñ 8?Þ!¤ß r?Þ!¤á¬.Â?Þ Ù” æS?Þ Ù–?ûR?Þ IŽ·³?Þ K­¾b?ÞBÿÑá:?ÞCðÙ™?Þw¶ê‚÷?Þw¹ m?Þ¬nر-?Þ¬p÷Œë?Þá'œ°?Þá)»k?Þá6Pà?ÞãUþ?ÞJ›¥ð´?ÞJÄ¡‚?ÞVë8?ÞY ?¶?Þ´p„?Þ´&²?ÞèÏùŠœ?ÞèÒz?Þ Œ?Þàƒ?ÞRLav?ÞRNp´?Þ‡ Ö¤B?Þ‡ ôÿ0?Þ»Ì"ü?Þ»ÎAH¢?ÞðF.°?Þðdlÿ?Þ%O@Po?Þ%Q^€n?ÞZž¶?ÞZ/Àf?ÞŽÕº 8?ÞŽ×ؘ?ÞÚ9Ðl?ÞÃœWÕ}?Þø_‘ N?Þøa¯?Þ-%¿É?Þ-'ݱ…?ÞaìÆ/ˆ?Þaîä ¬?Þ–´¤dz?Þ–¶Â0N?Þ Ë}Z{ö?Þ Ëx9{?Þ F衪?Þ IPà?Þ 5Nã¸?Þ 5l„Ÿ?Þ iÜmÎ?Þ iÞ«f?Þ ž¨¤H"?Þ žªÁÌk?Þ Óu“¤8?Þ Ów±3?Þ C[8?Þ Ex÷ã?Þ=ü+è?Þ=…E?ÞqázjÔ?Þqã—µâ?Þ¦±Öô#?Þ¦³ô0ã?ÞÛƒ u?ÞÛ…*Gæ?ÞU H?ÞW:,k?ÞE(ÚÆ?ÞE*#ìš?ÞyûʪŒ?Þyýç®?Þ®Ðh›f?Þ®Ò…ž?Þã¥àÍ?Þã§ý´?Þ|3S’?Þ~P,.?ÞMS`T„?ÞMU}Ñ?Ýÿ‚+gé¶?Ýÿ‚-„¥µ?Ýþ·J-?Ýþ·fÚ´?ÝýëÞOÑ?Ýýëà#ï5?Ýý ¸ŸT^?Ýý º»ås?ÝüU”`>?ÝüU–.ã?ÝûŠp`¤Ì?ÝûŠr}F?Ýú¿MŠT?Ýú¿O¦„?Ýùô+Žþ>?Ýùô-«V?Ýù) od ?Ýù) ‹­²?Ýø]ê+iÈ?Ýø]ìG¥ ?Ý÷’ÊÃ#?Ý÷’ÌßOû?ÝöǬ6Ìð?ÝöÇ®Rë™?ÝõüŽ†cÐ?Ýõü¢t,?Ýõ1q²î?Ýõ1sÎý?ÝôfU¹ôL?ÝôfWÕè ?Ýó›:ž',?Ýó›<º ¡?ÝòÐ ^Å_?ÝòÐ"zœ‡?Ýòü?Ýò È÷?Ýñ9îuÙ~?Ýñ9ð‘” ?ÝðnÖÌ|Ý?ÝðnØè)?Ýï£À Â?Ýï£Â§µ?Ýîت“å?Ýîج,#Œ?Ýî • ?Ýî —n?ÝíB€Ø¯?ÝíB‚ó’½?Ýìwm‹.0?Ýìwo¦’ò?Ýë¬[Ep?Ýë¬]7›ä?ÝêáI‹½?ÝêáK¦Øå?Ýê8Ù)´?Ýê:ôc?ÝéK)$ ?ÝéK+ Oœ?Ý耰ï?Ýè€*Î2?Ýçµ øéæ?ÝçµøÝ?ÝæéþÀâ³?ÝæêÛã^?ÝæògÀ¦?Ýæô‚³?ÝåSæí—m?ÝåSé{€?ÝäˆÜR’;?ÝäˆÞmh?Ýã½Ò–ʘ?Ýã½Ô±’?ÝâòɺZ?ÝâòËÕB?Ýâ'Á½` ?Ýâ'ÃØ ð?Ýá\ºŸö ?Ýá\¼º’¥?Ýà‘´b;x?Ýà‘¶|ÉÄ?ÝßƯIÌ?ÝßƱÉÍ?ÝÞûª†R?ÝÞû¬ Ã¹?ÝÞ0¦ègÀ?ÝÞ0©Ë)?ÝÝe¤*˜´?ÝÝe¦DíÒ?ÝÜš¢M¹?ÝÜš¤gb‹?ÝÛÏ¡Oþ?ÝÛÏ£j7?ÝÛ¡3`W?ÝÛ£MŠ“?ÝÚ9¡÷Z°?ÝÚ9¤v¡?ÝÙn£œ¶?ÝÙn¥¶ \?ÝØ£¦!­•?ÝØ£¨;¬ð?Ý×Ø©ˆ8ï?Ý×Ø«¢)ÿ?Ý× ­ÏÙê?Ý× ¯é¼¯?ÝÖB²ø©é?ÝÖBµ~d?ÝÕw¹Î ?ÝÕw»”:?ÝÔ¬¿ó.-?ÝԬ æ?ÝÓáÇÊr)?ÝÓáÉäÄ?ÝÓЃû¼?ÝÓÒ— ?ÝÒKÚäD?ÝÒKÜ9qI?ÝÑ€äžE"?ÝÑ€æ·ÃÝ?ÝеïÿIN?Ýеò¹¾?ÝÏêüC>?ÝÏêþ\fd?ÝÏ iN?ÝÏ ‚ã*?ÝÎUsŒ?ÝÎUŒU?ÝÍŠ&_¤(?ÝÍŠ(xÛo?ÝÌ¿6/Z¶?ÝÌ¿8Hƒ³?ÝËôFâiÕ?ÝËôHû„‰?ÝË)Xxäú?ÝË)Z‘ñc?ÝÊ^jòÙª?ÝÊ^m ×É?ÝÉ“~P„^?ÝÉ“€it3?ÝÈÈ’‘á?ÝÈÈ”ªÂ”?ÝÇý§·,?ÝÇý©ÏÿX?ÝÇ2½Às?ÝÇ2¿Ù8?ÝÆgÔ­Ï*?ÝÆgÖÆ…Ù?ÝÅœì_‡?ÝÅœî˜ì?ÝÄÒ5TÊ?ÝÄÒMîæ?ÝÄ϶?ÝÄ èBb?ÝÃ<9N¯¦?ÝÃ<;g-/?ÝÂqT²Mƒ?ÝÂqVʼÃ?ÝÁ¦púÆž?ÝÁ¦s'”?ÝÀÛŽ(·?ÝÀÛ@od?ÝÀ¬:zˆ?ÝÀ®R¾í?Ý¿EË1ÿ?Ý¿EÍJ5.?ݾzë½ ?ݾzí&år?ݽ° Ðì ?ݽ° é)?ݼå-x“ž?ݼå/žÞ?ݼPÑŒ?ݼR΄?Ý»Os}¢r?Ý»Ou•‘!?ݺ„—à—?ݺ„™øwl?ݹ¹½*%#?ݹ¹¿A÷A?ݸîãZkÂ?ݸîår/˜?ݸ$ qlž?ݸ$ ‰"+?Ý·Y2oL|?Ý·Y4†óÁ?ݶŽ[T0.?ݶŽ]kÉ*?ݵÅ ?Ývl3E>.?Ýu¡¥ácÔ?Ýu¡§ôj?Ýtׂ]‘?ÝtוUû?Ýt ’@N?Ýt ”(*v?ÝsB šž?ÝsB ¬úƒ?Ýrw‚¨?Ýrw„#äJ?Ýq¬ûzLt?Ýq¬ý Ó?ÝpâuÕØX?Ýpâwè‰t?Ýpñ#Ø}?Ýpó6{W?ÝoMmiHÝ?ÝoMo{Ýu?Ýn‚ê¦ÌŠ?Ýn‚ì¹Rß?Ým¸h׿§?Ým¸jê7»?Ýlíçü.ò?Ýlíê˜Ã?Ýl#h>j?Ýl#j&™ù?ÝkXé 0?ÝkXë2Y|?ÝjŽk¼7?ÝjŽm1ûA?ÝiÃîa?ÝiÃð%‘Ë?Ýhùqûz?Ýhùt A?Ýh.ö×’?Ýh.øé,×?Ýgd|§V?Ýgd~¹\"?Ýfšl {?Ýfš~=?ÝeÏ‹%N?ÝeÏ77˜?ÝeÓD£?Ýeåá?Ýd:uöõ?Ýd:Ÿ‡Ãñ?Ýcp( Ž¸?Ýcp*Ms?Ýb¥³š)ô?Ýb¥µ«Ún?ÝaÛ@æ¶?ÝaÛB-ˆï?ÝaÍ’âþ?ÝaϤvõ?Ý`F[ÿ<Ï?Ý`F^Â…?Ý_{ëaÂ?Ý_{írx7?Ý^±{¸d?Ý^±}ÉÍD?Ý]ç sE?Ý]çÎ8?Ý]ŸHW÷?Ý]¡Y¤©?Ý\R2$‚?Ý\R4’bó?Ý[‡Æ°@?Ý[‡ÈÁ8q?ÝZ½[Õ ò?ÝZ½]æ+â?ÝYòñðMV?ÝYòôa?ÝY(‰ö?ÝY(‹û?ÝX^! i?ÝX^#—?ÝW“ºé¿?ÝW“¼Ò­?ÝVÉSþdÉ?ÝVÉV?v?ÝUþîï–y?ÝUþñbæ?ÝU4ŠÝ-¡?ÝU4ŒíëÍ?ÝTj'Âg]?ÝTj)ÓJ?ÝSŸÅŸrò?ÝSŸÇ°Ÿ?ÝRÕdtb¬?ÝRÕf„ö?ÝR AZ:?ÝR Qßg?ÝQ@¥kë?ÝQ@§âØ?ÝPvFÃÁ.?ÝPvHÔ)Ú?ÝO«éy}¤?ÝO«ë‰Ø?ÝNá'¹b?ÝNá8?ÝN1΀Ü?ÝN3Þ¾É?ÝML×mýy?ÝMLÙ~-'?ÝL‚~M ?ÝL‚€n|?ÝK¸%—i?ÝK¸'§ ˜?ÝJíÎ!ÜP?ÝJíÐ1á@?ÝJ#w¥QÈ?ÝJ#yµHy?ÝIY""ô?ÝIY$2f?ÝHŽÍ˜Dt?ÝHŽÏ¨§?ÝGÄzæ ?ÝGÄ|±ü?ÝFú'q+?ÝFú)€è»?ÝF/ÕÔ1)?ÝF/×ãàŸ?ÝEe…1Ð?ÝEe‡@¦?ÝD›5‡æi?ÝD›7—ya?ÝCÐæØÐò?ÝCÐèèU«?ÝC™#çð?ÝC›3^j?ÝBHÛsƒ?Ý>HÝ‚/‡?Ý=~”˜ÃØ?Ý=~–§Öž?Ý<´N¾s©?Ý<´PÍx0?Ý;ê 付?Ý;ê ó±â?Ý;Æÿk?Ý;Èçw?Ý:Uƒ%Kn?Ý:U…4%;?Ý9‹A?½B?Ý9‹CNˆÒ?Ý8ÁVxN?Ý8Áe5¡?Ý7öÀiš6?Ý7öÂxIK?Ý7,yL?Ý7,ƒ‡ìñ?Ý6bC…šD?Ý6bE”,Ý?Ý5˜Ž¢I?Ý5˜&¥?Ý4ÍÊ”‡‚?Ý4ÍÌ¢ý¡?Ý4—s ?Ý4‘¥Úì?Ý39U—k_?Ý39W¥Å?Ý2o”ŸV?Ý2o¢ê½?Ý1¤ä(?Ý1¤æXQ?Ý0Ú­‡ ´?Ý0Ú¯•< ?Ý0w|ˆî?Ý0yŠ©?Ý/FBo°#?Ý/FD}•?Ý.|`› ?Ý.|nŸB?Ý-±ÛOg?Ý-±Ý]]?Ý,ç©<=f?Ý,ç«J%#?Ý,x'$M?Ý,z4ýÌ?Ý+SH??Ý+SJ I?Ý*‰÷Çß?Ý*‰„å?Ý)¾êÝ¿p?Ý)¾ìën;?Ý(ô½ÂHð?Ý(ô¿Ïé~?Ý(*‘¥Æ?Ý(*“³?Ý'`f‡‡b?Ý'`h• w?Ý&–uç=?Ý%ÌHny?Ý%ÌUÖ?Ý%ë'Š¾?Ý%í4ä ?Ý$7Äã?Ý$7Æ.µ?Ý#mè}ç?Ý#mŸõºÑ?Ý"£xÐ?Ý"£zÝ1Ã?Ý!ÙT·¸t?Ý!ÙVÄØæ?Ý!1ŸÁ*?Ý!3¬Ó`?Ý Eˆ@]?Ý E•DW?ÝzîqGß?Ýzð~=ž?Ý°ÎZõ?Ý°ÐgÜ—?Ýæ¯EpÒ?Ýæ±RJ?Ý‘0Ç1?Ý“=’>?ÝRt,†?ÝRv)éX?݈X ²¨?݈Za??ݾ<ùkY?ݾ? µ?Ýô"éy¬?Ýô$ö Í?Ý* Û 2?Ý* ç?Ý_ñÎ)(?Ý_óÚžÓ?Ý•ÚÂÿ ?Ý•ÜÏf?ÝËĹ¥“?ÝËÆÅþÈ?ݯ².C?ݱ¾y=?Ý7›¬Ê–?Ý7¹V?Ýmˆ©†?ÝmŠµµ?Ý£v¨‚?Ý£x´¢f?ÝÙe©ã0?ܸ. ¶hx?ܸ.¢¼4?Ü·eOÄ?Ü·e †ñN?ܶ›q^[?ܶ›scî[?ܵÑÛM£ª?ܵÑÝS(Ñ?ܵFO:£?ܵHT±˜?Ü´>²cMT?Ü´>´h¶?ܳu‰òT?ܳu!Læ?ܲ«Ã=T?ܲ«È‰´?ܱáý[¸?ܱáÿ™ç?ܱmna3?ܱos‘1?Ü°NÞàg*?Ü°Nàåˆö?ܯ…Qešð?ܯ…Sj®‹?Ü®»Äþª?Ü®»Ç ?Ü­ò9©Ò?Ü­ò;®ÉW?Ü­(¯iO?Ü­(±nX?ܬ_&;óÊ?ܬ_(@΢?Ü«•ž"€–?Ü«• 'M=?ܪÌäg?ܪÌ!¢Ý?ܪ‘+8‘?ܪ“/è×?Ü©9 M¶?Ü©9R2Ì?ܨoˆ„4?ܨoŠˆ«?ܧ¦ÎÜÐ?ܧ¦Ób„?ܦ܄. ?ܦ܆2€”?ܦ¡µ4?ܦ¦ˆ?Ü¥I„.Ú»?Ü¥I†35ß?ܤ€Ö%õ?ܤ€Úré?Ü£¶ˆ’ä?Ü£¶Š—"â?Ü¢í e1k?Ü¢íiaþ?Ü¢#‘M,Ç?Ü¢#“QO+?Ü¡ZJï†?Ü¡ZO»?Ü ž^˜•?Ü  bžš?ÜŸÇ&ˆD?ÜŸÇ(Œ;ê?Üžý¯Èô?Üžý±Ëúš?Üž4:F?Üž4?Ü›nVè?Ü›pZŠÇ?ÜšDþÖ?ÜšE!jš?Ü™{Žû²d?Ü™{ÿ8À?ܘ² ð“b?ܘ²"ô Žhealpy-1.8.1/healpy/data/weight_ring_n00016.fits0000650000175000017530000002640011705033043021701 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:03:57' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 32 / 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 NSIDE = 16 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 48 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 1.657766897421E-01 / maximum value of T weights MINVAL1 = -7.241365388457E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 1.657766897421E-01 / maximum value of Q weights MINVAL2 = -7.241365388457E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 1.657766897421E-01 / maximum value of U weights MINVAL3 = -7.241365388457E-02 / minimum value of U weights COMMENT END ?Å8+ªpÎ?Å8+ªpÎ?Å8+ªpﲉ³ƒ7Ôf¿²‰³ƒ7Ôf¿²‰³ƒ7Ôf? Êë P'? Êë P'? Êë P'¿‡æ”Q—:¾¿‡æ”Q—:¾¿‡æ”Q—:¾?=(õ›k.ö?=(õ›k.ö?=(õ›k.ö?r“¤ÜH?r“¤ÜH?r“¤ÜH¿vô=›ôÚ_¿vô=›ôÚ_¿vô=›ôÚ_?r•£ýß…+?r•£ýß…+?r•£ýß…+¿eäwOÕ8¿eäwOÕ8¿eäwOÕ8?M}£ Ä™?M}£ Ä™?M}£ Ä™?4á  6Ì?4á  6Ì?4á  6Ì¿LÁÑ3’Ë¿LÁÑ3’Ë¿LÁÑ3’Ë?NMÈ}©¾?NMÈ}©¾?NMÈ}©¾¿Jˆ›ÇN¿Jˆ›ÇN¿Jˆ›ÇN?T –òŒ+?T –òŒ+?T –òŒ+¿zHx´Ü ¿zHx´Ü ¿zHx´Ü ¿=à²{Å"L¿=à²{Å"L¿=à²{Å"L?a¤Ñh‘ ?a¤Ñh‘ ?a¤Ñh‘ ¿dDÔ¯\£¿dDÔ¯\£¿dDÔ¯\£?[¾‚f|®ï?[¾‚f|®ï?[¾‚f|®ï¿&R©[Pm¿&R©[Pm¿&R©[Pm¿TÃYÝ×p$¿TÃYÝ×p$¿TÃYÝ×p$?[¥|ÅËæ?[¥|ÅËæ?[¥|ÅËæ¿I˜]>f¿I˜]>f¿I˜]>f¿G}žÉ‘î¿G}žÉ‘î¿G}žÉ‘î?XC甀P?XC甀P?XC甀P¿KŠ7樠̿KŠ7樠̿KŠ7樠̿DqIׇÆA¿DqIׇÆA¿DqIׇÆA?W,á-²°?W,á-²°?W,á-²°¿F/±FRÅ¿F/±FRÅ¿F/±FRÅ¿Lî_Ì’Uï¿Lî_Ì’Uï¿Lî_Ì’Uï?[uBIezx?[uBIezx?[uBIezxhealpy-1.8.1/healpy/data/totcls.dat0000650000175000017530000040566311737162617017635 0ustar zoncaplanck00000000000000 0 0.00000E+00 0.00000E+00 0.00000E+00 0.00000E+00 1 0.00000E+00 0.00000E+00 0.00000E+00 0.00000E+00 2 0.17261E+04 0.67367E-01 0.27107E-01 0.36347E+01 3 0.15364E+04 0.10453E+00 0.31381E-01 0.36945E+01 4 0.14360E+04 0.11664E+00 0.30865E-01 0.35829E+01 5 0.13686E+04 0.10460E+00 0.27188E-01 0.32291E+01 6 0.13225E+04 0.79333E-01 0.22020E-01 0.27779E+01 7 0.12930E+04 0.52648E-01 0.16767E-01 0.23139E+01 8 0.12745E+04 0.32182E-01 0.12342E-01 0.18617E+01 9 0.12631E+04 0.19942E-01 0.90690E-02 0.14629E+01 10 0.12579E+04 0.14374E-01 0.69485E-02 0.11590E+01 11 0.12577E+04 0.12453E-01 0.58401E-02 0.95013E+00 12 0.12607E+04 0.12156E-01 0.55031E-02 0.82618E+00 13 0.12650E+04 0.12104E-01 0.56960E-02 0.77466E+00 14 0.12706E+04 0.12161E-01 0.62552E-02 0.77381E+00 15 0.12780E+04 0.12501E-01 0.70366E-02 0.79957E+00 16 0.12873E+04 0.13259E-01 0.79184E-02 0.83150E+00 17 0.12985E+04 0.14406E-01 0.88676E-02 0.86375E+00 18 0.13108E+04 0.15870E-01 0.98735E-02 0.89415E+00 19 0.13240E+04 0.17582E-01 0.10925E-01 0.92050E+00 20 0.13374E+04 0.19469E-01 0.12013E-01 0.94061E+00 21 0.13509E+04 0.21477E-01 0.13126E-01 0.95269E+00 22 0.13642E+04 0.23605E-01 0.14264E-01 0.95661E+00 23 0.13775E+04 0.25871E-01 0.15424E-01 0.95262E+00 24 0.13907E+04 0.28288E-01 0.16606E-01 0.94099E+00 25 0.14039E+04 0.30873E-01 0.17809E-01 0.92198E+00 26 0.14171E+04 0.33641E-01 0.19032E-01 0.89586E+00 27 0.14304E+04 0.36608E-01 0.20275E-01 0.86288E+00 28 0.14437E+04 0.39789E-01 0.21535E-01 0.82332E+00 29 0.14571E+04 0.43200E-01 0.22813E-01 0.77743E+00 30 0.14707E+04 0.46856E-01 0.24107E-01 0.72548E+00 31 0.14845E+04 0.50770E-01 0.25416E-01 0.66762E+00 32 0.14983E+04 0.54945E-01 0.26739E-01 0.60360E+00 33 0.15124E+04 0.59381E-01 0.28073E-01 0.53306E+00 34 0.15265E+04 0.64077E-01 0.29417E-01 0.45562E+00 35 0.15408E+04 0.69035E-01 0.30768E-01 0.37092E+00 36 0.15552E+04 0.74252E-01 0.32125E-01 0.27860E+00 37 0.15696E+04 0.79731E-01 0.33484E-01 0.17829E+00 38 0.15841E+04 0.85470E-01 0.34845E-01 0.69630E-01 39 0.15987E+04 0.91469E-01 0.36206E-01 -0.47747E-01 40 0.16134E+04 0.97729E-01 0.37563E-01 -0.17421E+00 41 0.16280E+04 0.10425E+00 0.38916E-01 -0.31011E+00 42 0.16428E+04 0.11103E+00 0.40263E-01 -0.45583E+00 43 0.16575E+04 0.11808E+00 0.41602E-01 -0.61172E+00 44 0.16724E+04 0.12539E+00 0.42931E-01 -0.77815E+00 45 0.16873E+04 0.13297E+00 0.44249E-01 -0.95549E+00 46 0.17023E+04 0.14082E+00 0.45554E-01 -0.11441E+01 47 0.17174E+04 0.14894E+00 0.46845E-01 -0.13443E+01 48 0.17326E+04 0.15734E+00 0.48119E-01 -0.15566E+01 49 0.17479E+04 0.16601E+00 0.49376E-01 -0.17812E+01 50 0.17634E+04 0.17496E+00 0.50614E-01 -0.20185E+01 51 0.17790E+04 0.18418E+00 0.51831E-01 -0.22688E+01 52 0.17947E+04 0.19368E+00 0.53026E-01 -0.25318E+01 53 0.18106E+04 0.20346E+00 0.54198E-01 -0.28073E+01 54 0.18266E+04 0.21351E+00 0.55346E-01 -0.30948E+01 55 0.18428E+04 0.22384E+00 0.56468E-01 -0.33939E+01 56 0.18591E+04 0.23443E+00 0.57565E-01 -0.37045E+01 57 0.18756E+04 0.24529E+00 0.58634E-01 -0.40260E+01 58 0.18923E+04 0.25642E+00 0.59675E-01 -0.43582E+01 59 0.19091E+04 0.26781E+00 0.60687E-01 -0.47007E+01 60 0.19262E+04 0.27946E+00 0.61668E-01 -0.50531E+01 61 0.19434E+04 0.29138E+00 0.62617E-01 -0.54153E+01 62 0.19608E+04 0.30355E+00 0.63535E-01 -0.57870E+01 63 0.19784E+04 0.31598E+00 0.64420E-01 -0.61684E+01 64 0.19962E+04 0.32866E+00 0.65271E-01 -0.65595E+01 65 0.20142E+04 0.34158E+00 0.66088E-01 -0.69603E+01 66 0.20324E+04 0.35475E+00 0.66871E-01 -0.73708E+01 67 0.20509E+04 0.36816E+00 0.67618E-01 -0.77910E+01 68 0.20696E+04 0.38181E+00 0.68330E-01 -0.82210E+01 69 0.20885E+04 0.39569E+00 0.69005E-01 -0.86608E+01 70 0.21077E+04 0.40981E+00 0.69643E-01 -0.91104E+01 71 0.21271E+04 0.42414E+00 0.70243E-01 -0.95698E+01 72 0.21468E+04 0.43870E+00 0.70806E-01 -0.10039E+02 73 0.21667E+04 0.45345E+00 0.71331E-01 -0.10517E+02 74 0.21870E+04 0.46839E+00 0.71818E-01 -0.11005E+02 75 0.22074E+04 0.48351E+00 0.72267E-01 -0.11502E+02 76 0.22282E+04 0.49879E+00 0.72679E-01 -0.12007E+02 77 0.22492E+04 0.51423E+00 0.73053E-01 -0.12522E+02 78 0.22705E+04 0.52980E+00 0.73389E-01 -0.13044E+02 79 0.22920E+04 0.54549E+00 0.73688E-01 -0.13576E+02 80 0.23139E+04 0.56130E+00 0.73949E-01 -0.14115E+02 81 0.23360E+04 0.57720E+00 0.74172E-01 -0.14662E+02 82 0.23585E+04 0.59319E+00 0.74357E-01 -0.15216E+02 83 0.23812E+04 0.60923E+00 0.74506E-01 -0.15777E+02 84 0.24042E+04 0.62532E+00 0.74617E-01 -0.16345E+02 85 0.24275E+04 0.64143E+00 0.74692E-01 -0.16918E+02 86 0.24511E+04 0.65755E+00 0.74730E-01 -0.17496E+02 87 0.24750E+04 0.67365E+00 0.74731E-01 -0.18079E+02 88 0.24992E+04 0.68971E+00 0.74697E-01 -0.18667E+02 89 0.25237E+04 0.70572E+00 0.74627E-01 -0.19257E+02 90 0.25484E+04 0.72166E+00 0.74522E-01 -0.19851E+02 91 0.25736E+04 0.73751E+00 0.74381E-01 -0.20447E+02 92 0.25990E+04 0.75325E+00 0.74206E-01 -0.21045E+02 93 0.26247E+04 0.76888E+00 0.73998E-01 -0.21645E+02 94 0.26507E+04 0.78439E+00 0.73756E-01 -0.22247E+02 95 0.26770E+04 0.79976E+00 0.73483E-01 -0.22850E+02 96 0.27036E+04 0.81498E+00 0.73178E-01 -0.23453E+02 97 0.27304E+04 0.83005E+00 0.72843E-01 -0.24058E+02 98 0.27576E+04 0.84494E+00 0.72479E-01 -0.24662E+02 99 0.27850E+04 0.85966E+00 0.72086E-01 -0.25266E+02 100 0.28127E+04 0.87418E+00 0.71665E-01 -0.25870E+02 101 0.28407E+04 0.88850E+00 0.71217E-01 -0.26473E+02 102 0.28690E+04 0.90260E+00 0.70743E-01 -0.27075E+02 103 0.28975E+04 0.91648E+00 0.70244E-01 -0.27675E+02 104 0.29263E+04 0.93013E+00 0.69720E-01 -0.28274E+02 105 0.29553E+04 0.94352E+00 0.69172E-01 -0.28871E+02 106 0.29847E+04 0.95666E+00 0.68601E-01 -0.29466E+02 107 0.30142E+04 0.96953E+00 0.68009E-01 -0.30057E+02 108 0.30440E+04 0.98212E+00 0.67394E-01 -0.30646E+02 109 0.30741E+04 0.99442E+00 0.66760E-01 -0.31231E+02 110 0.31044E+04 0.10064E+01 0.66106E-01 -0.31813E+02 111 0.31350E+04 0.10181E+01 0.65433E-01 -0.32391E+02 112 0.31657E+04 0.10294E+01 0.64742E-01 -0.32964E+02 113 0.31968E+04 0.10405E+01 0.64035E-01 -0.33532E+02 114 0.32280E+04 0.10511E+01 0.63311E-01 -0.34095E+02 115 0.32594E+04 0.10615E+01 0.62573E-01 -0.34651E+02 116 0.32910E+04 0.10714E+01 0.61821E-01 -0.35200E+02 117 0.33228E+04 0.10810E+01 0.61055E-01 -0.35742E+02 118 0.33548E+04 0.10902E+01 0.60278E-01 -0.36276E+02 119 0.33869E+04 0.10990E+01 0.59490E-01 -0.36801E+02 120 0.34192E+04 0.11074E+01 0.58692E-01 -0.37318E+02 121 0.34516E+04 0.11154E+01 0.57885E-01 -0.37824E+02 122 0.34842E+04 0.11230E+01 0.57070E-01 -0.38321E+02 123 0.35168E+04 0.11301E+01 0.56247E-01 -0.38806E+02 124 0.35496E+04 0.11368E+01 0.55419E-01 -0.39281E+02 125 0.35825E+04 0.11430E+01 0.54586E-01 -0.39743E+02 126 0.36155E+04 0.11488E+01 0.53748E-01 -0.40193E+02 127 0.36486E+04 0.11541E+01 0.52907E-01 -0.40629E+02 128 0.36817E+04 0.11589E+01 0.52065E-01 -0.41052E+02 129 0.37149E+04 0.11632E+01 0.51220E-01 -0.41461E+02 130 0.37482E+04 0.11670E+01 0.50376E-01 -0.41855E+02 131 0.37815E+04 0.11703E+01 0.49532E-01 -0.42233E+02 132 0.38148E+04 0.11731E+01 0.48690E-01 -0.42596E+02 133 0.38482E+04 0.11753E+01 0.47850E-01 -0.42942E+02 134 0.38816E+04 0.11771E+01 0.47013E-01 -0.43272E+02 135 0.39149E+04 0.11783E+01 0.46179E-01 -0.43585E+02 136 0.39483E+04 0.11791E+01 0.45349E-01 -0.43881E+02 137 0.39817E+04 0.11793E+01 0.44523E-01 -0.44158E+02 138 0.40150E+04 0.11791E+01 0.43703E-01 -0.44418E+02 139 0.40483E+04 0.11784E+01 0.42889E-01 -0.44659E+02 140 0.40816E+04 0.11771E+01 0.42081E-01 -0.44880E+02 141 0.41148E+04 0.11754E+01 0.41281E-01 -0.45083E+02 142 0.41479E+04 0.11732E+01 0.40489E-01 -0.45265E+02 143 0.41809E+04 0.11705E+01 0.39705E-01 -0.45427E+02 144 0.42139E+04 0.11673E+01 0.38930E-01 -0.45569E+02 145 0.42468E+04 0.11637E+01 0.38166E-01 -0.45689E+02 146 0.42796E+04 0.11595E+01 0.37411E-01 -0.45788E+02 147 0.43123E+04 0.11549E+01 0.36668E-01 -0.45865E+02 148 0.43448E+04 0.11499E+01 0.35937E-01 -0.45919E+02 149 0.43772E+04 0.11443E+01 0.35218E-01 -0.45951E+02 150 0.44095E+04 0.11383E+01 0.34512E-01 -0.45960E+02 151 0.44416E+04 0.11318E+01 0.33820E-01 -0.45945E+02 152 0.44736E+04 0.11249E+01 0.33142E-01 -0.45907E+02 153 0.45054E+04 0.11175E+01 0.32478E-01 -0.45845E+02 154 0.45370E+04 0.11098E+01 0.31828E-01 -0.45759E+02 155 0.45684E+04 0.11016E+01 0.31192E-01 -0.45649E+02 156 0.45996E+04 0.10931E+01 0.30571E-01 -0.45515E+02 157 0.46306E+04 0.10842E+01 0.29965E-01 -0.45356E+02 158 0.46614E+04 0.10750E+01 0.29373E-01 -0.45173E+02 159 0.46919E+04 0.10655E+01 0.28796E-01 -0.44966E+02 160 0.47222E+04 0.10557E+01 0.28234E-01 -0.44733E+02 161 0.47523E+04 0.10456E+01 0.27687E-01 -0.44476E+02 162 0.47821E+04 0.10352E+01 0.27156E-01 -0.44194E+02 163 0.48116E+04 0.10246E+01 0.26640E-01 -0.43887E+02 164 0.48408E+04 0.10138E+01 0.26139E-01 -0.43555E+02 165 0.48697E+04 0.10028E+01 0.25655E-01 -0.43197E+02 166 0.48984E+04 0.99156E+00 0.25186E-01 -0.42814E+02 167 0.49267E+04 0.98019E+00 0.24733E-01 -0.42405E+02 168 0.49547E+04 0.96868E+00 0.24297E-01 -0.41970E+02 169 0.49823E+04 0.95704E+00 0.23877E-01 -0.41510E+02 170 0.50097E+04 0.94529E+00 0.23473E-01 -0.41024E+02 171 0.50366E+04 0.93345E+00 0.23086E-01 -0.40511E+02 172 0.50632E+04 0.92154E+00 0.22715E-01 -0.39972E+02 173 0.50894E+04 0.90958E+00 0.22362E-01 -0.39407E+02 174 0.51153E+04 0.89758E+00 0.22025E-01 -0.38815E+02 175 0.51407E+04 0.88557E+00 0.21706E-01 -0.38197E+02 176 0.51658E+04 0.87356E+00 0.21404E-01 -0.37552E+02 177 0.51904E+04 0.86160E+00 0.21119E-01 -0.36880E+02 178 0.52146E+04 0.84971E+00 0.20850E-01 -0.36182E+02 179 0.52384E+04 0.83793E+00 0.20597E-01 -0.35457E+02 180 0.52617E+04 0.82630E+00 0.20361E-01 -0.34706E+02 181 0.52846E+04 0.81485E+00 0.20139E-01 -0.33929E+02 182 0.53070E+04 0.80361E+00 0.19933E-01 -0.33126E+02 183 0.53289E+04 0.79263E+00 0.19741E-01 -0.32297E+02 184 0.53504E+04 0.78194E+00 0.19563E-01 -0.31443E+02 185 0.53714E+04 0.77157E+00 0.19398E-01 -0.30562E+02 186 0.53919E+04 0.76156E+00 0.19248E-01 -0.29656E+02 187 0.54119E+04 0.75194E+00 0.19110E-01 -0.28725E+02 188 0.54314E+04 0.74275E+00 0.18985E-01 -0.27768E+02 189 0.54503E+04 0.73403E+00 0.18871E-01 -0.26787E+02 190 0.54688E+04 0.72581E+00 0.18770E-01 -0.25780E+02 191 0.54867E+04 0.71813E+00 0.18680E-01 -0.24748E+02 192 0.55040E+04 0.71101E+00 0.18601E-01 -0.23692E+02 193 0.55208E+04 0.70451E+00 0.18532E-01 -0.22611E+02 194 0.55370E+04 0.69865E+00 0.18474E-01 -0.21505E+02 195 0.55527E+04 0.69346E+00 0.18426E-01 -0.20376E+02 196 0.55677E+04 0.68900E+00 0.18386E-01 -0.19221E+02 197 0.55822E+04 0.68528E+00 0.18356E-01 -0.18043E+02 198 0.55961E+04 0.68234E+00 0.18335E-01 -0.16841E+02 199 0.56093E+04 0.68023E+00 0.18321E-01 -0.15615E+02 200 0.56220E+04 0.67897E+00 0.18316E-01 -0.14365E+02 201 0.56340E+04 0.67860E+00 0.18317E-01 -0.13091E+02 202 0.56454E+04 0.67916E+00 0.18326E-01 -0.11795E+02 203 0.56561E+04 0.68067E+00 0.18342E-01 -0.10476E+02 204 0.56663E+04 0.68316E+00 0.18364E-01 -0.91356E+01 205 0.56758E+04 0.68667E+00 0.18393E-01 -0.77743E+01 206 0.56847E+04 0.69123E+00 0.18427E-01 -0.63926E+01 207 0.56929E+04 0.69686E+00 0.18467E-01 -0.49914E+01 208 0.57006E+04 0.70361E+00 0.18512E-01 -0.35712E+01 209 0.57076E+04 0.71149E+00 0.18563E-01 -0.21328E+01 210 0.57140E+04 0.72055E+00 0.18618E-01 -0.67670E+00 211 0.57198E+04 0.73081E+00 0.18678E-01 0.79631E+00 212 0.57250E+04 0.74231E+00 0.18741E-01 0.22856E+01 213 0.57295E+04 0.75507E+00 0.18809E-01 0.37905E+01 214 0.57335E+04 0.76913E+00 0.18880E-01 0.53103E+01 215 0.57368E+04 0.78452E+00 0.18955E-01 0.68444E+01 216 0.57395E+04 0.80126E+00 0.19033E-01 0.83921E+01 217 0.57416E+04 0.81940E+00 0.19113E-01 0.99527E+01 218 0.57431E+04 0.83895E+00 0.19195E-01 0.11526E+02 219 0.57440E+04 0.85996E+00 0.19280E-01 0.13110E+02 220 0.57443E+04 0.88246E+00 0.19367E-01 0.14705E+02 221 0.57439E+04 0.90647E+00 0.19455E-01 0.16311E+02 222 0.57430E+04 0.93202E+00 0.19545E-01 0.17926E+02 223 0.57414E+04 0.95915E+00 0.19635E-01 0.19550E+02 224 0.57392E+04 0.98789E+00 0.19726E-01 0.21183E+02 225 0.57365E+04 0.10183E+01 0.19817E-01 0.22823E+02 226 0.57331E+04 0.10503E+01 0.19909E-01 0.24469E+02 227 0.57291E+04 0.10841E+01 0.20000E-01 0.26122E+02 228 0.57246E+04 0.11196E+01 0.20091E-01 0.27781E+02 229 0.57194E+04 0.11568E+01 0.20181E-01 0.29445E+02 230 0.57136E+04 0.11959E+01 0.20270E-01 0.31112E+02 231 0.57072E+04 0.12367E+01 0.20357E-01 0.32784E+02 232 0.57003E+04 0.12795E+01 0.20443E-01 0.34458E+02 233 0.56927E+04 0.13241E+01 0.20527E-01 0.36134E+02 234 0.56845E+04 0.13706E+01 0.20608E-01 0.37812E+02 235 0.56758E+04 0.14191E+01 0.20687E-01 0.39491E+02 236 0.56664E+04 0.14696E+01 0.20763E-01 0.41170E+02 237 0.56565E+04 0.15221E+01 0.20836E-01 0.42849E+02 238 0.56459E+04 0.15766E+01 0.20906E-01 0.44527E+02 239 0.56348E+04 0.16332E+01 0.20971E-01 0.46202E+02 240 0.56231E+04 0.16919E+01 0.21033E-01 0.47876E+02 241 0.56108E+04 0.17528E+01 0.21091E-01 0.49546E+02 242 0.55979E+04 0.18158E+01 0.21143E-01 0.51212E+02 243 0.55844E+04 0.18810E+01 0.21191E-01 0.52874E+02 244 0.55703E+04 0.19485E+01 0.21234E-01 0.54531E+02 245 0.55557E+04 0.20182E+01 0.21271E-01 0.56182E+02 246 0.55404E+04 0.20902E+01 0.21303E-01 0.57826E+02 247 0.55246E+04 0.21646E+01 0.21328E-01 0.59463E+02 248 0.55082E+04 0.22413E+01 0.21347E-01 0.61093E+02 249 0.54912E+04 0.23204E+01 0.21359E-01 0.62714E+02 250 0.54736E+04 0.24019E+01 0.21365E-01 0.64326E+02 251 0.54555E+04 0.24858E+01 0.21363E-01 0.65928E+02 252 0.54368E+04 0.25722E+01 0.21354E-01 0.67519E+02 253 0.54175E+04 0.26610E+01 0.21338E-01 0.69100E+02 254 0.53977E+04 0.27521E+01 0.21316E-01 0.70669E+02 255 0.53773E+04 0.28456E+01 0.21286E-01 0.72225E+02 256 0.53564E+04 0.29415E+01 0.21251E-01 0.73769E+02 257 0.53350E+04 0.30396E+01 0.21209E-01 0.75300E+02 258 0.53131E+04 0.31401E+01 0.21161E-01 0.76816E+02 259 0.52907E+04 0.32428E+01 0.21107E-01 0.78317E+02 260 0.52678E+04 0.33478E+01 0.21048E-01 0.79803E+02 261 0.52444E+04 0.34550E+01 0.20983E-01 0.81274E+02 262 0.52206E+04 0.35644E+01 0.20912E-01 0.82727E+02 263 0.51963E+04 0.36759E+01 0.20836E-01 0.84164E+02 264 0.51715E+04 0.37896E+01 0.20755E-01 0.85583E+02 265 0.51464E+04 0.39055E+01 0.20669E-01 0.86983E+02 266 0.51207E+04 0.40234E+01 0.20579E-01 0.88365E+02 267 0.50947E+04 0.41434E+01 0.20484E-01 0.89727E+02 268 0.50683E+04 0.42655E+01 0.20384E-01 0.91069E+02 269 0.50415E+04 0.43897E+01 0.20280E-01 0.92390E+02 270 0.50143E+04 0.45158E+01 0.20172E-01 0.93689E+02 271 0.49867E+04 0.46439E+01 0.20060E-01 0.94967E+02 272 0.49588E+04 0.47740E+01 0.19945E-01 0.96221E+02 273 0.49305E+04 0.49061E+01 0.19825E-01 0.97453E+02 274 0.49018E+04 0.50401E+01 0.19703E-01 0.98661E+02 275 0.48729E+04 0.51759E+01 0.19577E-01 0.99844E+02 276 0.48436E+04 0.53137E+01 0.19448E-01 0.10100E+03 277 0.48140E+04 0.54533E+01 0.19316E-01 0.10213E+03 278 0.47841E+04 0.55947E+01 0.19181E-01 0.10324E+03 279 0.47539E+04 0.57380E+01 0.19044E-01 0.10432E+03 280 0.47234E+04 0.58830E+01 0.18904E-01 0.10537E+03 281 0.46927E+04 0.60298E+01 0.18762E-01 0.10640E+03 282 0.46617E+04 0.61783E+01 0.18618E-01 0.10739E+03 283 0.46304E+04 0.63286E+01 0.18472E-01 0.10836E+03 284 0.45989E+04 0.64805E+01 0.18325E-01 0.10929E+03 285 0.45672E+04 0.66341E+01 0.18175E-01 0.11020E+03 286 0.45353E+04 0.67894E+01 0.18025E-01 0.11107E+03 287 0.45031E+04 0.69462E+01 0.17873E-01 0.11191E+03 288 0.44708E+04 0.71047E+01 0.17719E-01 0.11272E+03 289 0.44382E+04 0.72648E+01 0.17565E-01 0.11350E+03 290 0.44055E+04 0.74264E+01 0.17411E-01 0.11424E+03 291 0.43726E+04 0.75895E+01 0.17255E-01 0.11495E+03 292 0.43396E+04 0.77542E+01 0.17099E-01 0.11563E+03 293 0.43064E+04 0.79204E+01 0.16943E-01 0.11626E+03 294 0.42731E+04 0.80880E+01 0.16787E-01 0.11687E+03 295 0.42396E+04 0.82570E+01 0.16631E-01 0.11743E+03 296 0.42061E+04 0.84275E+01 0.16475E-01 0.11796E+03 297 0.41724E+04 0.85994E+01 0.16320E-01 0.11845E+03 298 0.41386E+04 0.87726E+01 0.16165E-01 0.11890E+03 299 0.41048E+04 0.89472E+01 0.16011E-01 0.11932E+03 300 0.40709E+04 0.91231E+01 0.15857E-01 0.11969E+03 301 0.40369E+04 0.93003E+01 0.15705E-01 0.12002E+03 302 0.40028E+04 0.94787E+01 0.15554E-01 0.12032E+03 303 0.39687E+04 0.96583E+01 0.15404E-01 0.12057E+03 304 0.39346E+04 0.98390E+01 0.15255E-01 0.12078E+03 305 0.39005E+04 0.10021E+02 0.15108E-01 0.12096E+03 306 0.38663E+04 0.10203E+02 0.14962E-01 0.12109E+03 307 0.38321E+04 0.10387E+02 0.14817E-01 0.12119E+03 308 0.37979E+04 0.10571E+02 0.14674E-01 0.12124E+03 309 0.37637E+04 0.10756E+02 0.14532E-01 0.12126E+03 310 0.37296E+04 0.10942E+02 0.14391E-01 0.12124E+03 311 0.36955E+04 0.11128E+02 0.14253E-01 0.12118E+03 312 0.36614E+04 0.11314E+02 0.14115E-01 0.12109E+03 313 0.36273E+04 0.11502E+02 0.13980E-01 0.12095E+03 314 0.35933E+04 0.11689E+02 0.13846E-01 0.12078E+03 315 0.35594E+04 0.11877E+02 0.13714E-01 0.12057E+03 316 0.35255E+04 0.12064E+02 0.13583E-01 0.12032E+03 317 0.34918E+04 0.12252E+02 0.13455E-01 0.12004E+03 318 0.34581E+04 0.12440E+02 0.13328E-01 0.11971E+03 319 0.34245E+04 0.12628E+02 0.13203E-01 0.11936E+03 320 0.33910E+04 0.12816E+02 0.13081E-01 0.11896E+03 321 0.33577E+04 0.13004E+02 0.12960E-01 0.11853E+03 322 0.33245E+04 0.13192E+02 0.12842E-01 0.11806E+03 323 0.32914E+04 0.13379E+02 0.12725E-01 0.11756E+03 324 0.32584E+04 0.13565E+02 0.12611E-01 0.11702E+03 325 0.32257E+04 0.13752E+02 0.12499E-01 0.11645E+03 326 0.31930E+04 0.13937E+02 0.12389E-01 0.11584E+03 327 0.31606E+04 0.14123E+02 0.12282E-01 0.11519E+03 328 0.31283E+04 0.14307E+02 0.12177E-01 0.11451E+03 329 0.30963E+04 0.14491E+02 0.12074E-01 0.11380E+03 330 0.30644E+04 0.14673E+02 0.11974E-01 0.11305E+03 331 0.30327E+04 0.14855E+02 0.11876E-01 0.11227E+03 332 0.30013E+04 0.15036E+02 0.11781E-01 0.11145E+03 333 0.29701E+04 0.15216E+02 0.11689E-01 0.11060E+03 334 0.29391E+04 0.15394E+02 0.11599E-01 0.10971E+03 335 0.29084E+04 0.15572E+02 0.11512E-01 0.10879E+03 336 0.28779E+04 0.15748E+02 0.11428E-01 0.10784E+03 337 0.28477E+04 0.15923E+02 0.11347E-01 0.10686E+03 338 0.28178E+04 0.16096E+02 0.11268E-01 0.10584E+03 339 0.27882E+04 0.16268E+02 0.11192E-01 0.10479E+03 340 0.27588E+04 0.16438E+02 0.11120E-01 0.10371E+03 341 0.27298E+04 0.16607E+02 0.11050E-01 0.10259E+03 342 0.27010E+04 0.16774E+02 0.10983E-01 0.10144E+03 343 0.26726E+04 0.16939E+02 0.10920E-01 0.10026E+03 344 0.26445E+04 0.17102E+02 0.10860E-01 0.99053E+02 345 0.26168E+04 0.17263E+02 0.10802E-01 0.97811E+02 346 0.25894E+04 0.17422E+02 0.10748E-01 0.96538E+02 347 0.25624E+04 0.17579E+02 0.10698E-01 0.95233E+02 348 0.25357E+04 0.17734E+02 0.10651E-01 0.93897E+02 349 0.25094E+04 0.17887E+02 0.10607E-01 0.92531E+02 350 0.24835E+04 0.18037E+02 0.10566E-01 0.91134E+02 351 0.24580E+04 0.18185E+02 0.10529E-01 0.89707E+02 352 0.24329E+04 0.18330E+02 0.10496E-01 0.88251E+02 353 0.24081E+04 0.18473E+02 0.10466E-01 0.86766E+02 354 0.23838E+04 0.18614E+02 0.10438E-01 0.85253E+02 355 0.23599E+04 0.18752E+02 0.10414E-01 0.83713E+02 356 0.23364E+04 0.18887E+02 0.10393E-01 0.82147E+02 357 0.23132E+04 0.19020E+02 0.10375E-01 0.80556E+02 358 0.22905E+04 0.19150E+02 0.10359E-01 0.78940E+02 359 0.22682E+04 0.19277E+02 0.10346E-01 0.77300E+02 360 0.22463E+04 0.19401E+02 0.10336E-01 0.75638E+02 361 0.22247E+04 0.19523E+02 0.10328E-01 0.73953E+02 362 0.22036E+04 0.19642E+02 0.10322E-01 0.72248E+02 363 0.21829E+04 0.19758E+02 0.10319E-01 0.70522E+02 364 0.21626E+04 0.19871E+02 0.10317E-01 0.68776E+02 365 0.21427E+04 0.19981E+02 0.10318E-01 0.67011E+02 366 0.21233E+04 0.20088E+02 0.10320E-01 0.65229E+02 367 0.21042E+04 0.20192E+02 0.10324E-01 0.63429E+02 368 0.20856E+04 0.20293E+02 0.10330E-01 0.61614E+02 369 0.20673E+04 0.20391E+02 0.10337E-01 0.59782E+02 370 0.20495E+04 0.20486E+02 0.10346E-01 0.57936E+02 371 0.20321E+04 0.20577E+02 0.10356E-01 0.56077E+02 372 0.20151E+04 0.20665E+02 0.10367E-01 0.54204E+02 373 0.19985E+04 0.20750E+02 0.10379E-01 0.52319E+02 374 0.19824E+04 0.20832E+02 0.10392E-01 0.50423E+02 375 0.19666E+04 0.20910E+02 0.10407E-01 0.48516E+02 376 0.19513E+04 0.20985E+02 0.10421E-01 0.46599E+02 377 0.19364E+04 0.21056E+02 0.10437E-01 0.44674E+02 378 0.19219E+04 0.21124E+02 0.10453E-01 0.42740E+02 379 0.19079E+04 0.21189E+02 0.10470E-01 0.40800E+02 380 0.18943E+04 0.21250E+02 0.10486E-01 0.38853E+02 381 0.18811E+04 0.21307E+02 0.10503E-01 0.36900E+02 382 0.18683E+04 0.21361E+02 0.10521E-01 0.34942E+02 383 0.18560E+04 0.21411E+02 0.10538E-01 0.32981E+02 384 0.18440E+04 0.21457E+02 0.10555E-01 0.31016E+02 385 0.18326E+04 0.21499E+02 0.10572E-01 0.29050E+02 386 0.18215E+04 0.21538E+02 0.10588E-01 0.27081E+02 387 0.18109E+04 0.21573E+02 0.10604E-01 0.25112E+02 388 0.18007E+04 0.21604E+02 0.10620E-01 0.23143E+02 389 0.17910E+04 0.21631E+02 0.10635E-01 0.21176E+02 390 0.17816E+04 0.21654E+02 0.10649E-01 0.19210E+02 391 0.17728E+04 0.21673E+02 0.10662E-01 0.17246E+02 392 0.17643E+04 0.21688E+02 0.10674E-01 0.15286E+02 393 0.17563E+04 0.21699E+02 0.10685E-01 0.13331E+02 394 0.17488E+04 0.21706E+02 0.10695E-01 0.11380E+02 395 0.17416E+04 0.21708E+02 0.10704E-01 0.94355E+01 396 0.17350E+04 0.21707E+02 0.10711E-01 0.74976E+01 397 0.17287E+04 0.21701E+02 0.10716E-01 0.55674E+01 398 0.17229E+04 0.21691E+02 0.10720E-01 0.36455E+01 399 0.17176E+04 0.21677E+02 0.10723E-01 0.17329E+01 400 0.17127E+04 0.21658E+02 0.10723E-01 -0.16973E+00 401 0.17082E+04 0.21635E+02 0.10721E-01 -0.20615E+01 402 0.17042E+04 0.21607E+02 0.10718E-01 -0.39418E+01 403 0.17006E+04 0.21576E+02 0.10712E-01 -0.58102E+01 404 0.16975E+04 0.21540E+02 0.10705E-01 -0.76660E+01 405 0.16948E+04 0.21500E+02 0.10696E-01 -0.95087E+01 406 0.16924E+04 0.21455E+02 0.10685E-01 -0.11338E+02 407 0.16905E+04 0.21407E+02 0.10672E-01 -0.13153E+02 408 0.16890E+04 0.21355E+02 0.10658E-01 -0.14953E+02 409 0.16879E+04 0.21299E+02 0.10642E-01 -0.16737E+02 410 0.16872E+04 0.21238E+02 0.10624E-01 -0.18506E+02 411 0.16869E+04 0.21174E+02 0.10605E-01 -0.20259E+02 412 0.16869E+04 0.21107E+02 0.10584E-01 -0.21994E+02 413 0.16873E+04 0.21035E+02 0.10561E-01 -0.23712E+02 414 0.16881E+04 0.20960E+02 0.10537E-01 -0.25411E+02 415 0.16893E+04 0.20881E+02 0.10511E-01 -0.27092E+02 416 0.16908E+04 0.20799E+02 0.10484E-01 -0.28754E+02 417 0.16926E+04 0.20713E+02 0.10455E-01 -0.30396E+02 418 0.16948E+04 0.20624E+02 0.10425E-01 -0.32018E+02 419 0.16973E+04 0.20532E+02 0.10394E-01 -0.33618E+02 420 0.17001E+04 0.20436E+02 0.10362E-01 -0.35198E+02 421 0.17033E+04 0.20337E+02 0.10328E-01 -0.36755E+02 422 0.17067E+04 0.20234E+02 0.10292E-01 -0.38289E+02 423 0.17105E+04 0.20129E+02 0.10256E-01 -0.39801E+02 424 0.17146E+04 0.20020E+02 0.10218E-01 -0.41288E+02 425 0.17190E+04 0.19908E+02 0.10179E-01 -0.42752E+02 426 0.17237E+04 0.19794E+02 0.10139E-01 -0.44190E+02 427 0.17286E+04 0.19676E+02 0.10098E-01 -0.45603E+02 428 0.17338E+04 0.19556E+02 0.10056E-01 -0.46991E+02 429 0.17393E+04 0.19433E+02 0.10013E-01 -0.48351E+02 430 0.17451E+04 0.19307E+02 0.99687E-02 -0.49685E+02 431 0.17511E+04 0.19178E+02 0.99236E-02 -0.50991E+02 432 0.17573E+04 0.19047E+02 0.98775E-02 -0.52269E+02 433 0.17639E+04 0.18913E+02 0.98305E-02 -0.53518E+02 434 0.17706E+04 0.18776E+02 0.97827E-02 -0.54738E+02 435 0.17776E+04 0.18638E+02 0.97340E-02 -0.55928E+02 436 0.17848E+04 0.18496E+02 0.96845E-02 -0.57088E+02 437 0.17922E+04 0.18353E+02 0.96343E-02 -0.58216E+02 438 0.17998E+04 0.18207E+02 0.95833E-02 -0.59313E+02 439 0.18077E+04 0.18058E+02 0.95316E-02 -0.60378E+02 440 0.18157E+04 0.17908E+02 0.94792E-02 -0.61411E+02 441 0.18240E+04 0.17756E+02 0.94262E-02 -0.62410E+02 442 0.18324E+04 0.17601E+02 0.93727E-02 -0.63375E+02 443 0.18410E+04 0.17444E+02 0.93185E-02 -0.64306E+02 444 0.18498E+04 0.17286E+02 0.92638E-02 -0.65203E+02 445 0.18587E+04 0.17126E+02 0.92086E-02 -0.66063E+02 446 0.18678E+04 0.16963E+02 0.91530E-02 -0.66888E+02 447 0.18771E+04 0.16799E+02 0.90969E-02 -0.67676E+02 448 0.18865E+04 0.16633E+02 0.90404E-02 -0.68427E+02 449 0.18961E+04 0.16466E+02 0.89836E-02 -0.69141E+02 450 0.19058E+04 0.16297E+02 0.89264E-02 -0.69816E+02 451 0.19156E+04 0.16126E+02 0.88689E-02 -0.70452E+02 452 0.19255E+04 0.15954E+02 0.88111E-02 -0.71051E+02 453 0.19356E+04 0.15781E+02 0.87532E-02 -0.71610E+02 454 0.19458E+04 0.15606E+02 0.86950E-02 -0.72132E+02 455 0.19560E+04 0.15430E+02 0.86367E-02 -0.72616E+02 456 0.19664E+04 0.15253E+02 0.85783E-02 -0.73063E+02 457 0.19769E+04 0.15076E+02 0.85197E-02 -0.73473E+02 458 0.19874E+04 0.14897E+02 0.84612E-02 -0.73846E+02 459 0.19981E+04 0.14718E+02 0.84026E-02 -0.74182E+02 460 0.20088E+04 0.14538E+02 0.83440E-02 -0.74482E+02 461 0.20195E+04 0.14358E+02 0.82855E-02 -0.74746E+02 462 0.20303E+04 0.14177E+02 0.82271E-02 -0.74974E+02 463 0.20412E+04 0.13996E+02 0.81688E-02 -0.75167E+02 464 0.20521E+04 0.13815E+02 0.81107E-02 -0.75324E+02 465 0.20631E+04 0.13633E+02 0.80527E-02 -0.75447E+02 466 0.20740E+04 0.13452E+02 0.79951E-02 -0.75535E+02 467 0.20850E+04 0.13271E+02 0.79376E-02 -0.75589E+02 468 0.20961E+04 0.13090E+02 0.78805E-02 -0.75609E+02 469 0.21071E+04 0.12910E+02 0.78238E-02 -0.75595E+02 470 0.21181E+04 0.12730E+02 0.77674E-02 -0.75547E+02 471 0.21292E+04 0.12550E+02 0.77114E-02 -0.75466E+02 472 0.21402E+04 0.12372E+02 0.76559E-02 -0.75353E+02 473 0.21512E+04 0.12194E+02 0.76009E-02 -0.75206E+02 474 0.21622E+04 0.12016E+02 0.75463E-02 -0.75028E+02 475 0.21731E+04 0.11840E+02 0.74924E-02 -0.74817E+02 476 0.21840E+04 0.11665E+02 0.74390E-02 -0.74574E+02 477 0.21949E+04 0.11492E+02 0.73863E-02 -0.74300E+02 478 0.22057E+04 0.11319E+02 0.73342E-02 -0.73994E+02 479 0.22165E+04 0.11148E+02 0.72828E-02 -0.73658E+02 480 0.22272E+04 0.10979E+02 0.72322E-02 -0.73291E+02 481 0.22379E+04 0.10811E+02 0.71823E-02 -0.72893E+02 482 0.22484E+04 0.10645E+02 0.71333E-02 -0.72465E+02 483 0.22589E+04 0.10480E+02 0.70851E-02 -0.72007E+02 484 0.22693E+04 0.10318E+02 0.70377E-02 -0.71520E+02 485 0.22796E+04 0.10158E+02 0.69913E-02 -0.71004E+02 486 0.22898E+04 0.99996E+01 0.69458E-02 -0.70458E+02 487 0.22999E+04 0.98438E+01 0.69013E-02 -0.69884E+02 488 0.23098E+04 0.96903E+01 0.68578E-02 -0.69281E+02 489 0.23197E+04 0.95394E+01 0.68154E-02 -0.68650E+02 490 0.23294E+04 0.93910E+01 0.67741E-02 -0.67990E+02 491 0.23390E+04 0.92454E+01 0.67339E-02 -0.67304E+02 492 0.23484E+04 0.91025E+01 0.66949E-02 -0.66590E+02 493 0.23577E+04 0.89626E+01 0.66570E-02 -0.65849E+02 494 0.23668E+04 0.88257E+01 0.66204E-02 -0.65081E+02 495 0.23758E+04 0.86919E+01 0.65851E-02 -0.64286E+02 496 0.23846E+04 0.85613E+01 0.65511E-02 -0.63465E+02 497 0.23932E+04 0.84341E+01 0.65184E-02 -0.62619E+02 498 0.24017E+04 0.83104E+01 0.64871E-02 -0.61746E+02 499 0.24099E+04 0.81902E+01 0.64572E-02 -0.60848E+02 500 0.24180E+04 0.80736E+01 0.64287E-02 -0.59925E+02 501 0.24258E+04 0.79608E+01 0.64018E-02 -0.58977E+02 502 0.24335E+04 0.78518E+01 0.63762E-02 -0.58006E+02 503 0.24409E+04 0.77467E+01 0.63521E-02 -0.57010E+02 504 0.24482E+04 0.76454E+01 0.63294E-02 -0.55993E+02 505 0.24552E+04 0.75481E+01 0.63079E-02 -0.54953E+02 506 0.24620E+04 0.74547E+01 0.62878E-02 -0.53893E+02 507 0.24687E+04 0.73653E+01 0.62689E-02 -0.52813E+02 508 0.24751E+04 0.72799E+01 0.62512E-02 -0.51713E+02 509 0.24813E+04 0.71986E+01 0.62347E-02 -0.50595E+02 510 0.24873E+04 0.71214E+01 0.62193E-02 -0.49459E+02 511 0.24931E+04 0.70483E+01 0.62049E-02 -0.48306E+02 512 0.24987E+04 0.69794E+01 0.61917E-02 -0.47137E+02 513 0.25040E+04 0.69148E+01 0.61794E-02 -0.45952E+02 514 0.25092E+04 0.68544E+01 0.61682E-02 -0.44753E+02 515 0.25142E+04 0.67983E+01 0.61578E-02 -0.43540E+02 516 0.25189E+04 0.67465E+01 0.61484E-02 -0.42314E+02 517 0.25234E+04 0.66991E+01 0.61398E-02 -0.41076E+02 518 0.25277E+04 0.66561E+01 0.61320E-02 -0.39826E+02 519 0.25318E+04 0.66176E+01 0.61249E-02 -0.38566E+02 520 0.25357E+04 0.65835E+01 0.61187E-02 -0.37296E+02 521 0.25394E+04 0.65540E+01 0.61131E-02 -0.36017E+02 522 0.25428E+04 0.65290E+01 0.61081E-02 -0.34729E+02 523 0.25461E+04 0.65086E+01 0.61038E-02 -0.33434E+02 524 0.25491E+04 0.64928E+01 0.61000E-02 -0.32133E+02 525 0.25519E+04 0.64818E+01 0.60968E-02 -0.30825E+02 526 0.25545E+04 0.64754E+01 0.60941E-02 -0.29513E+02 527 0.25568E+04 0.64738E+01 0.60918E-02 -0.28196E+02 528 0.25590E+04 0.64769E+01 0.60900E-02 -0.26875E+02 529 0.25609E+04 0.64849E+01 0.60885E-02 -0.25552E+02 530 0.25626E+04 0.64978E+01 0.60874E-02 -0.24227E+02 531 0.25641E+04 0.65155E+01 0.60866E-02 -0.22901E+02 532 0.25653E+04 0.65382E+01 0.60860E-02 -0.21574E+02 533 0.25663E+04 0.65658E+01 0.60856E-02 -0.20248E+02 534 0.25671E+04 0.65985E+01 0.60855E-02 -0.18923E+02 535 0.25677E+04 0.66362E+01 0.60854E-02 -0.17600E+02 536 0.25681E+04 0.66790E+01 0.60855E-02 -0.16280E+02 537 0.25682E+04 0.67270E+01 0.60856E-02 -0.14963E+02 538 0.25681E+04 0.67801E+01 0.60858E-02 -0.13651E+02 539 0.25678E+04 0.68383E+01 0.60859E-02 -0.12344E+02 540 0.25672E+04 0.69019E+01 0.60860E-02 -0.11043E+02 541 0.25664E+04 0.69707E+01 0.60860E-02 -0.97485E+01 542 0.25654E+04 0.70448E+01 0.60858E-02 -0.84617E+01 543 0.25642E+04 0.71243E+01 0.60855E-02 -0.71832E+01 544 0.25627E+04 0.72091E+01 0.60849E-02 -0.59138E+01 545 0.25610E+04 0.72994E+01 0.60841E-02 -0.46544E+01 546 0.25590E+04 0.73952E+01 0.60830E-02 -0.34056E+01 547 0.25569E+04 0.74964E+01 0.60816E-02 -0.21684E+01 548 0.25545E+04 0.76032E+01 0.60797E-02 -0.94338E+00 549 0.25518E+04 0.77156E+01 0.60775E-02 0.26852E+00 550 0.25489E+04 0.78336E+01 0.60749E-02 0.14666E+01 551 0.25458E+04 0.79572E+01 0.60717E-02 0.26500E+01 552 0.25425E+04 0.80864E+01 0.60680E-02 0.38184E+01 553 0.25389E+04 0.82211E+01 0.60639E-02 0.49711E+01 554 0.25351E+04 0.83611E+01 0.60593E-02 0.61079E+01 555 0.25311E+04 0.85065E+01 0.60542E-02 0.72283E+01 556 0.25269E+04 0.86572E+01 0.60486E-02 0.83317E+01 557 0.25225E+04 0.88129E+01 0.60425E-02 0.94177E+01 558 0.25178E+04 0.89738E+01 0.60360E-02 0.10486E+02 559 0.25130E+04 0.91396E+01 0.60290E-02 0.11536E+02 560 0.25080E+04 0.93103E+01 0.60215E-02 0.12567E+02 561 0.25027E+04 0.94859E+01 0.60136E-02 0.13579E+02 562 0.24973E+04 0.96661E+01 0.60052E-02 0.14572E+02 563 0.24917E+04 0.98510E+01 0.59963E-02 0.15544E+02 564 0.24860E+04 0.10041E+02 0.59870E-02 0.16496E+02 565 0.24800E+04 0.10234E+02 0.59772E-02 0.17427E+02 566 0.24739E+04 0.10433E+02 0.59670E-02 0.18337E+02 567 0.24676E+04 0.10635E+02 0.59563E-02 0.19224E+02 568 0.24612E+04 0.10842E+02 0.59452E-02 0.20089E+02 569 0.24546E+04 0.11053E+02 0.59336E-02 0.20932E+02 570 0.24478E+04 0.11268E+02 0.59216E-02 0.21751E+02 571 0.24409E+04 0.11487E+02 0.59091E-02 0.22547E+02 572 0.24339E+04 0.11710E+02 0.58962E-02 0.23318E+02 573 0.24267E+04 0.11937E+02 0.58829E-02 0.24065E+02 574 0.24194E+04 0.12168E+02 0.58692E-02 0.24787E+02 575 0.24119E+04 0.12402E+02 0.58550E-02 0.25484E+02 576 0.24044E+04 0.12639E+02 0.58404E-02 0.26154E+02 577 0.23967E+04 0.12881E+02 0.58253E-02 0.26798E+02 578 0.23889E+04 0.13125E+02 0.58099E-02 0.27415E+02 579 0.23809E+04 0.13373E+02 0.57940E-02 0.28005E+02 580 0.23729E+04 0.13624E+02 0.57777E-02 0.28568E+02 581 0.23648E+04 0.13878E+02 0.57610E-02 0.29102E+02 582 0.23565E+04 0.14135E+02 0.57439E-02 0.29607E+02 583 0.23482E+04 0.14395E+02 0.57263E-02 0.30083E+02 584 0.23398E+04 0.14658E+02 0.57084E-02 0.30530E+02 585 0.23313E+04 0.14924E+02 0.56901E-02 0.30947E+02 586 0.23227E+04 0.15193E+02 0.56713E-02 0.31333E+02 587 0.23140E+04 0.15464E+02 0.56522E-02 0.31688E+02 588 0.23052E+04 0.15738E+02 0.56327E-02 0.32013E+02 589 0.22964E+04 0.16014E+02 0.56128E-02 0.32305E+02 590 0.22876E+04 0.16293E+02 0.55924E-02 0.32565E+02 591 0.22786E+04 0.16574E+02 0.55717E-02 0.32792E+02 592 0.22696E+04 0.16857E+02 0.55507E-02 0.32986E+02 593 0.22606E+04 0.17142E+02 0.55292E-02 0.33147E+02 594 0.22515E+04 0.17429E+02 0.55074E-02 0.33273E+02 595 0.22424E+04 0.17718E+02 0.54851E-02 0.33365E+02 596 0.22332E+04 0.18009E+02 0.54625E-02 0.33422E+02 597 0.22240E+04 0.18302E+02 0.54396E-02 0.33444E+02 598 0.22147E+04 0.18597E+02 0.54162E-02 0.33430E+02 599 0.22055E+04 0.18893E+02 0.53925E-02 0.33379E+02 600 0.21962E+04 0.19191E+02 0.53685E-02 0.33292E+02 601 0.21869E+04 0.19490E+02 0.53440E-02 0.33167E+02 602 0.21776E+04 0.19791E+02 0.53193E-02 0.33006E+02 603 0.21683E+04 0.20092E+02 0.52942E-02 0.32808E+02 604 0.21589E+04 0.20395E+02 0.52688E-02 0.32574E+02 605 0.21496E+04 0.20699E+02 0.52431E-02 0.32304E+02 606 0.21403E+04 0.21004E+02 0.52172E-02 0.31999E+02 607 0.21310E+04 0.21309E+02 0.51910E-02 0.31659E+02 608 0.21217E+04 0.21615E+02 0.51646E-02 0.31284E+02 609 0.21124E+04 0.21921E+02 0.51380E-02 0.30875E+02 610 0.21032E+04 0.22228E+02 0.51112E-02 0.30432E+02 611 0.20939E+04 0.22535E+02 0.50843E-02 0.29955E+02 612 0.20847E+04 0.22842E+02 0.50571E-02 0.29445E+02 613 0.20756E+04 0.23148E+02 0.50299E-02 0.28902E+02 614 0.20664E+04 0.23455E+02 0.50026E-02 0.28327E+02 615 0.20573E+04 0.23762E+02 0.49751E-02 0.27719E+02 616 0.20483E+04 0.24068E+02 0.49476E-02 0.27080E+02 617 0.20393E+04 0.24373E+02 0.49201E-02 0.26409E+02 618 0.20304E+04 0.24678E+02 0.48925E-02 0.25707E+02 619 0.20215E+04 0.24982E+02 0.48649E-02 0.24974E+02 620 0.20127E+04 0.25285E+02 0.48373E-02 0.24211E+02 621 0.20040E+04 0.25587E+02 0.48098E-02 0.23418E+02 622 0.19953E+04 0.25888E+02 0.47823E-02 0.22596E+02 623 0.19867E+04 0.26188E+02 0.47548E-02 0.21744E+02 624 0.19782E+04 0.26486E+02 0.47275E-02 0.20863E+02 625 0.19697E+04 0.26783E+02 0.47003E-02 0.19953E+02 626 0.19614E+04 0.27078E+02 0.46731E-02 0.19016E+02 627 0.19532E+04 0.27371E+02 0.46462E-02 0.18050E+02 628 0.19450E+04 0.27662E+02 0.46194E-02 0.17057E+02 629 0.19370E+04 0.27952E+02 0.45927E-02 0.16037E+02 630 0.19290E+04 0.28239E+02 0.45663E-02 0.14990E+02 631 0.19212E+04 0.28524E+02 0.45401E-02 0.13917E+02 632 0.19135E+04 0.28806E+02 0.45142E-02 0.12817E+02 633 0.19059E+04 0.29086E+02 0.44885E-02 0.11692E+02 634 0.18984E+04 0.29363E+02 0.44631E-02 0.10542E+02 635 0.18910E+04 0.29637E+02 0.44380E-02 0.93669E+01 636 0.18838E+04 0.29909E+02 0.44132E-02 0.81670E+01 637 0.18767E+04 0.30177E+02 0.43887E-02 0.69429E+01 638 0.18698E+04 0.30443E+02 0.43646E-02 0.56949E+01 639 0.18630E+04 0.30705E+02 0.43409E-02 0.44234E+01 640 0.18563E+04 0.30964E+02 0.43176E-02 0.31288E+01 641 0.18498E+04 0.31219E+02 0.42947E-02 0.18113E+01 642 0.18435E+04 0.31470E+02 0.42723E-02 0.47144E+00 643 0.18373E+04 0.31718E+02 0.42503E-02 -0.89052E+00 644 0.18313E+04 0.31961E+02 0.42288E-02 -0.22742E+01 645 0.18254E+04 0.32201E+02 0.42077E-02 -0.36792E+01 646 0.18197E+04 0.32437E+02 0.41872E-02 -0.51052E+01 647 0.18142E+04 0.32668E+02 0.41673E-02 -0.65519E+01 648 0.18089E+04 0.32895E+02 0.41478E-02 -0.80188E+01 649 0.18038E+04 0.33117E+02 0.41290E-02 -0.95056E+01 650 0.17988E+04 0.33335E+02 0.41107E-02 -0.11012E+02 651 0.17941E+04 0.33548E+02 0.40931E-02 -0.12538E+02 652 0.17895E+04 0.33756E+02 0.40761E-02 -0.14081E+02 653 0.17851E+04 0.33959E+02 0.40596E-02 -0.15643E+02 654 0.17810E+04 0.34158E+02 0.40437E-02 -0.17221E+02 655 0.17770E+04 0.34351E+02 0.40284E-02 -0.18816E+02 656 0.17732E+04 0.34539E+02 0.40136E-02 -0.20425E+02 657 0.17696E+04 0.34723E+02 0.39994E-02 -0.22050E+02 658 0.17662E+04 0.34901E+02 0.39856E-02 -0.23687E+02 659 0.17630E+04 0.35075E+02 0.39724E-02 -0.25338E+02 660 0.17600E+04 0.35243E+02 0.39597E-02 -0.27001E+02 661 0.17571E+04 0.35406E+02 0.39474E-02 -0.28675E+02 662 0.17545E+04 0.35564E+02 0.39357E-02 -0.30360E+02 663 0.17521E+04 0.35717E+02 0.39243E-02 -0.32055E+02 664 0.17498E+04 0.35865E+02 0.39135E-02 -0.33759E+02 665 0.17477E+04 0.36007E+02 0.39030E-02 -0.35470E+02 666 0.17459E+04 0.36144E+02 0.38930E-02 -0.37190E+02 667 0.17442E+04 0.36276E+02 0.38833E-02 -0.38916E+02 668 0.17427E+04 0.36402E+02 0.38741E-02 -0.40647E+02 669 0.17414E+04 0.36523E+02 0.38652E-02 -0.42384E+02 670 0.17403E+04 0.36638E+02 0.38567E-02 -0.44125E+02 671 0.17393E+04 0.36748E+02 0.38485E-02 -0.45870E+02 672 0.17386E+04 0.36853E+02 0.38407E-02 -0.47618E+02 673 0.17380E+04 0.36952E+02 0.38332E-02 -0.49367E+02 674 0.17377E+04 0.37045E+02 0.38259E-02 -0.51117E+02 675 0.17375E+04 0.37133E+02 0.38190E-02 -0.52868E+02 676 0.17375E+04 0.37215E+02 0.38124E-02 -0.54619E+02 677 0.17377E+04 0.37291E+02 0.38060E-02 -0.56368E+02 678 0.17381E+04 0.37362E+02 0.37999E-02 -0.58115E+02 679 0.17387E+04 0.37426E+02 0.37941E-02 -0.59860E+02 680 0.17394E+04 0.37485E+02 0.37884E-02 -0.61601E+02 681 0.17404E+04 0.37539E+02 0.37830E-02 -0.63338E+02 682 0.17415E+04 0.37586E+02 0.37778E-02 -0.65069E+02 683 0.17428E+04 0.37628E+02 0.37728E-02 -0.66795E+02 684 0.17443E+04 0.37663E+02 0.37679E-02 -0.68514E+02 685 0.17460E+04 0.37693E+02 0.37632E-02 -0.70225E+02 686 0.17479E+04 0.37716E+02 0.37587E-02 -0.71929E+02 687 0.17499E+04 0.37734E+02 0.37543E-02 -0.73623E+02 688 0.17522E+04 0.37745E+02 0.37500E-02 -0.75307E+02 689 0.17546E+04 0.37751E+02 0.37458E-02 -0.76981E+02 690 0.17572E+04 0.37750E+02 0.37418E-02 -0.78644E+02 691 0.17600E+04 0.37743E+02 0.37378E-02 -0.80294E+02 692 0.17630E+04 0.37730E+02 0.37339E-02 -0.81931E+02 693 0.17661E+04 0.37710E+02 0.37300E-02 -0.83555E+02 694 0.17694E+04 0.37684E+02 0.37262E-02 -0.85164E+02 695 0.17730E+04 0.37652E+02 0.37224E-02 -0.86758E+02 696 0.17767E+04 0.37614E+02 0.37186E-02 -0.88335E+02 697 0.17805E+04 0.37569E+02 0.37148E-02 -0.89896E+02 698 0.17846E+04 0.37518E+02 0.37111E-02 -0.91439E+02 699 0.17889E+04 0.37460E+02 0.37072E-02 -0.92964E+02 700 0.17933E+04 0.37396E+02 0.37034E-02 -0.94470E+02 701 0.17979E+04 0.37326E+02 0.36995E-02 -0.95955E+02 702 0.18027E+04 0.37248E+02 0.36956E-02 -0.97420E+02 703 0.18076E+04 0.37165E+02 0.36916E-02 -0.98865E+02 704 0.18128E+04 0.37075E+02 0.36875E-02 -0.10029E+03 705 0.18180E+04 0.36980E+02 0.36834E-02 -0.10169E+03 706 0.18235E+04 0.36878E+02 0.36792E-02 -0.10307E+03 707 0.18291E+04 0.36770E+02 0.36749E-02 -0.10443E+03 708 0.18349E+04 0.36656E+02 0.36706E-02 -0.10576E+03 709 0.18408E+04 0.36537E+02 0.36662E-02 -0.10707E+03 710 0.18468E+04 0.36412E+02 0.36617E-02 -0.10836E+03 711 0.18530E+04 0.36281E+02 0.36571E-02 -0.10962E+03 712 0.18593E+04 0.36145E+02 0.36524E-02 -0.11086E+03 713 0.18658E+04 0.36003E+02 0.36476E-02 -0.11207E+03 714 0.18724E+04 0.35857E+02 0.36428E-02 -0.11326E+03 715 0.18791E+04 0.35705E+02 0.36378E-02 -0.11442E+03 716 0.18859E+04 0.35548E+02 0.36327E-02 -0.11556E+03 717 0.18929E+04 0.35386E+02 0.36275E-02 -0.11667E+03 718 0.19000E+04 0.35219E+02 0.36222E-02 -0.11775E+03 719 0.19071E+04 0.35047E+02 0.36168E-02 -0.11881E+03 720 0.19144E+04 0.34871E+02 0.36113E-02 -0.11984E+03 721 0.19218E+04 0.34690E+02 0.36056E-02 -0.12084E+03 722 0.19293E+04 0.34504E+02 0.35998E-02 -0.12181E+03 723 0.19368E+04 0.34314E+02 0.35939E-02 -0.12275E+03 724 0.19445E+04 0.34120E+02 0.35879E-02 -0.12366E+03 725 0.19522E+04 0.33922E+02 0.35817E-02 -0.12455E+03 726 0.19600E+04 0.33719E+02 0.35753E-02 -0.12540E+03 727 0.19679E+04 0.33513E+02 0.35689E-02 -0.12622E+03 728 0.19759E+04 0.33302E+02 0.35622E-02 -0.12701E+03 729 0.19839E+04 0.33088E+02 0.35554E-02 -0.12777E+03 730 0.19920E+04 0.32870E+02 0.35485E-02 -0.12850E+03 731 0.20002E+04 0.32648E+02 0.35414E-02 -0.12920E+03 732 0.20084E+04 0.32423E+02 0.35341E-02 -0.12986E+03 733 0.20167E+04 0.32194E+02 0.35267E-02 -0.13049E+03 734 0.20250E+04 0.31962E+02 0.35191E-02 -0.13108E+03 735 0.20334E+04 0.31727E+02 0.35113E-02 -0.13165E+03 736 0.20418E+04 0.31488E+02 0.35033E-02 -0.13218E+03 737 0.20502E+04 0.31247E+02 0.34952E-02 -0.13267E+03 738 0.20587E+04 0.31003E+02 0.34868E-02 -0.13313E+03 739 0.20672E+04 0.30755E+02 0.34783E-02 -0.13355E+03 740 0.20757E+04 0.30505E+02 0.34696E-02 -0.13394E+03 741 0.20842E+04 0.30252E+02 0.34606E-02 -0.13429E+03 742 0.20928E+04 0.29997E+02 0.34515E-02 -0.13460E+03 743 0.21014E+04 0.29739E+02 0.34422E-02 -0.13488E+03 744 0.21100E+04 0.29479E+02 0.34326E-02 -0.13512E+03 745 0.21185E+04 0.29217E+02 0.34229E-02 -0.13532E+03 746 0.21271E+04 0.28952E+02 0.34129E-02 -0.13548E+03 747 0.21357E+04 0.28685E+02 0.34027E-02 -0.13561E+03 748 0.21443E+04 0.28416E+02 0.33923E-02 -0.13569E+03 749 0.21528E+04 0.28146E+02 0.33817E-02 -0.13574E+03 750 0.21614E+04 0.27873E+02 0.33708E-02 -0.13574E+03 751 0.21699E+04 0.27599E+02 0.33597E-02 -0.13571E+03 752 0.21784E+04 0.27323E+02 0.33483E-02 -0.13563E+03 753 0.21869E+04 0.27046E+02 0.33368E-02 -0.13552E+03 754 0.21953E+04 0.26767E+02 0.33250E-02 -0.13536E+03 755 0.22037E+04 0.26488E+02 0.33130E-02 -0.13517E+03 756 0.22121E+04 0.26207E+02 0.33009E-02 -0.13494E+03 757 0.22204E+04 0.25925E+02 0.32886E-02 -0.13467E+03 758 0.22287E+04 0.25643E+02 0.32761E-02 -0.13436E+03 759 0.22370E+04 0.25360E+02 0.32634E-02 -0.13401E+03 760 0.22451E+04 0.25076E+02 0.32506E-02 -0.13363E+03 761 0.22533E+04 0.24792E+02 0.32376E-02 -0.13321E+03 762 0.22613E+04 0.24508E+02 0.32245E-02 -0.13276E+03 763 0.22693E+04 0.24223E+02 0.32113E-02 -0.13226E+03 764 0.22773E+04 0.23939E+02 0.31980E-02 -0.13174E+03 765 0.22851E+04 0.23654E+02 0.31846E-02 -0.13117E+03 766 0.22929E+04 0.23370E+02 0.31711E-02 -0.13057E+03 767 0.23006E+04 0.23087E+02 0.31575E-02 -0.12994E+03 768 0.23083E+04 0.22803E+02 0.31438E-02 -0.12927E+03 769 0.23158E+04 0.22521E+02 0.31300E-02 -0.12857E+03 770 0.23233E+04 0.22239E+02 0.31162E-02 -0.12784E+03 771 0.23307E+04 0.21958E+02 0.31024E-02 -0.12707E+03 772 0.23379E+04 0.21679E+02 0.30885E-02 -0.12626E+03 773 0.23451E+04 0.21400E+02 0.30746E-02 -0.12543E+03 774 0.23522E+04 0.21123E+02 0.30606E-02 -0.12456E+03 775 0.23591E+04 0.20847E+02 0.30467E-02 -0.12366E+03 776 0.23660E+04 0.20573E+02 0.30327E-02 -0.12273E+03 777 0.23727E+04 0.20300E+02 0.30188E-02 -0.12177E+03 778 0.23794E+04 0.20030E+02 0.30049E-02 -0.12078E+03 779 0.23859E+04 0.19761E+02 0.29910E-02 -0.11976E+03 780 0.23923E+04 0.19494E+02 0.29771E-02 -0.11871E+03 781 0.23985E+04 0.19230E+02 0.29633E-02 -0.11762E+03 782 0.24046E+04 0.18968E+02 0.29496E-02 -0.11651E+03 783 0.24106E+04 0.18708E+02 0.29359E-02 -0.11537E+03 784 0.24164E+04 0.18451E+02 0.29223E-02 -0.11420E+03 785 0.24221E+04 0.18197E+02 0.29088E-02 -0.11300E+03 786 0.24277E+04 0.17946E+02 0.28953E-02 -0.11177E+03 787 0.24331E+04 0.17698E+02 0.28820E-02 -0.11052E+03 788 0.24384E+04 0.17452E+02 0.28688E-02 -0.10924E+03 789 0.24435E+04 0.17211E+02 0.28557E-02 -0.10793E+03 790 0.24484E+04 0.16972E+02 0.28427E-02 -0.10660E+03 791 0.24532E+04 0.16737E+02 0.28299E-02 -0.10524E+03 792 0.24578E+04 0.16506E+02 0.28173E-02 -0.10385E+03 793 0.24622E+04 0.16279E+02 0.28048E-02 -0.10244E+03 794 0.24665E+04 0.16055E+02 0.27924E-02 -0.10100E+03 795 0.24705E+04 0.15836E+02 0.27803E-02 -0.99536E+02 796 0.24744E+04 0.15621E+02 0.27683E-02 -0.98049E+02 797 0.24781E+04 0.15410E+02 0.27565E-02 -0.96538E+02 798 0.24817E+04 0.15203E+02 0.27450E-02 -0.95003E+02 799 0.24850E+04 0.15002E+02 0.27336E-02 -0.93445E+02 800 0.24881E+04 0.14804E+02 0.27225E-02 -0.91864E+02 801 0.24911E+04 0.14612E+02 0.27116E-02 -0.90260E+02 802 0.24938E+04 0.14425E+02 0.27010E-02 -0.88634E+02 803 0.24963E+04 0.14242E+02 0.26905E-02 -0.86987E+02 804 0.24987E+04 0.14065E+02 0.26803E-02 -0.85319E+02 805 0.25008E+04 0.13893E+02 0.26703E-02 -0.83632E+02 806 0.25027E+04 0.13725E+02 0.26606E-02 -0.81926E+02 807 0.25044E+04 0.13563E+02 0.26510E-02 -0.80202E+02 808 0.25060E+04 0.13406E+02 0.26417E-02 -0.78460E+02 809 0.25073E+04 0.13254E+02 0.26326E-02 -0.76702E+02 810 0.25084E+04 0.13107E+02 0.26236E-02 -0.74927E+02 811 0.25094E+04 0.12965E+02 0.26149E-02 -0.73138E+02 812 0.25101E+04 0.12829E+02 0.26064E-02 -0.71334E+02 813 0.25107E+04 0.12698E+02 0.25980E-02 -0.69517E+02 814 0.25110E+04 0.12572E+02 0.25899E-02 -0.67687E+02 815 0.25111E+04 0.12452E+02 0.25819E-02 -0.65845E+02 816 0.25111E+04 0.12337E+02 0.25741E-02 -0.63991E+02 817 0.25108E+04 0.12227E+02 0.25665E-02 -0.62127E+02 818 0.25104E+04 0.12123E+02 0.25591E-02 -0.60253E+02 819 0.25097E+04 0.12025E+02 0.25518E-02 -0.58370E+02 820 0.25089E+04 0.11932E+02 0.25447E-02 -0.56479E+02 821 0.25078E+04 0.11844E+02 0.25378E-02 -0.54580E+02 822 0.25066E+04 0.11763E+02 0.25310E-02 -0.52675E+02 823 0.25051E+04 0.11687E+02 0.25244E-02 -0.50763E+02 824 0.25035E+04 0.11616E+02 0.25180E-02 -0.48846E+02 825 0.25017E+04 0.11552E+02 0.25117E-02 -0.46925E+02 826 0.24996E+04 0.11493E+02 0.25055E-02 -0.45000E+02 827 0.24974E+04 0.11440E+02 0.24995E-02 -0.43071E+02 828 0.24950E+04 0.11393E+02 0.24936E-02 -0.41141E+02 829 0.24923E+04 0.11352E+02 0.24878E-02 -0.39209E+02 830 0.24895E+04 0.11317E+02 0.24822E-02 -0.37277E+02 831 0.24865E+04 0.11287E+02 0.24767E-02 -0.35344E+02 832 0.24833E+04 0.11264E+02 0.24713E-02 -0.33412E+02 833 0.24799E+04 0.11247E+02 0.24661E-02 -0.31482E+02 834 0.24762E+04 0.11235E+02 0.24610E-02 -0.29554E+02 835 0.24724E+04 0.11230E+02 0.24559E-02 -0.27630E+02 836 0.24684E+04 0.11231E+02 0.24510E-02 -0.25709E+02 837 0.24642E+04 0.11239E+02 0.24462E-02 -0.23792E+02 838 0.24598E+04 0.11252E+02 0.24415E-02 -0.21881E+02 839 0.24553E+04 0.11272E+02 0.24369E-02 -0.19977E+02 840 0.24505E+04 0.11298E+02 0.24324E-02 -0.18079E+02 841 0.24455E+04 0.11330E+02 0.24280E-02 -0.16188E+02 842 0.24403E+04 0.11369E+02 0.24237E-02 -0.14306E+02 843 0.24349E+04 0.11414E+02 0.24194E-02 -0.12433E+02 844 0.24294E+04 0.11466E+02 0.24153E-02 -0.10570E+02 845 0.24236E+04 0.11524E+02 0.24112E-02 -0.87180E+01 846 0.24177E+04 0.11589E+02 0.24072E-02 -0.68771E+01 847 0.24115E+04 0.11660E+02 0.24032E-02 -0.50484E+01 848 0.24052E+04 0.11738E+02 0.23993E-02 -0.32326E+01 849 0.23986E+04 0.11822E+02 0.23955E-02 -0.14305E+01 850 0.23919E+04 0.11913E+02 0.23918E-02 0.35721E+00 851 0.23850E+04 0.12011E+02 0.23881E-02 0.21297E+01 852 0.23778E+04 0.12116E+02 0.23844E-02 0.38866E+01 853 0.23705E+04 0.12226E+02 0.23808E-02 0.56274E+01 854 0.23631E+04 0.12344E+02 0.23773E-02 0.73517E+01 855 0.23554E+04 0.12467E+02 0.23737E-02 0.90592E+01 856 0.23475E+04 0.12597E+02 0.23703E-02 0.10749E+02 857 0.23395E+04 0.12733E+02 0.23668E-02 0.12422E+02 858 0.23313E+04 0.12875E+02 0.23634E-02 0.14076E+02 859 0.23230E+04 0.13023E+02 0.23600E-02 0.15711E+02 860 0.23144E+04 0.13177E+02 0.23567E-02 0.17328E+02 861 0.23057E+04 0.13336E+02 0.23533E-02 0.18925E+02 862 0.22969E+04 0.13502E+02 0.23500E-02 0.20502E+02 863 0.22879E+04 0.13672E+02 0.23467E-02 0.22059E+02 864 0.22788E+04 0.13848E+02 0.23434E-02 0.23595E+02 865 0.22695E+04 0.14030E+02 0.23401E-02 0.25110E+02 866 0.22600E+04 0.14216E+02 0.23368E-02 0.26603E+02 867 0.22505E+04 0.14408E+02 0.23335E-02 0.28074E+02 868 0.22408E+04 0.14605E+02 0.23301E-02 0.29523E+02 869 0.22309E+04 0.14807E+02 0.23268E-02 0.30949E+02 870 0.22209E+04 0.15013E+02 0.23235E-02 0.32352E+02 871 0.22108E+04 0.15225E+02 0.23202E-02 0.33730E+02 872 0.22006E+04 0.15441E+02 0.23168E-02 0.35085E+02 873 0.21903E+04 0.15661E+02 0.23134E-02 0.36415E+02 874 0.21798E+04 0.15886E+02 0.23100E-02 0.37720E+02 875 0.21692E+04 0.16116E+02 0.23065E-02 0.39000E+02 876 0.21586E+04 0.16349E+02 0.23030E-02 0.40254E+02 877 0.21478E+04 0.16587E+02 0.22995E-02 0.41482E+02 878 0.21369E+04 0.16829E+02 0.22960E-02 0.42683E+02 879 0.21259E+04 0.17075E+02 0.22923E-02 0.43856E+02 880 0.21148E+04 0.17324E+02 0.22887E-02 0.45002E+02 881 0.21036E+04 0.17578E+02 0.22850E-02 0.46121E+02 882 0.20924E+04 0.17835E+02 0.22812E-02 0.47210E+02 883 0.20810E+04 0.18096E+02 0.22774E-02 0.48271E+02 884 0.20696E+04 0.18360E+02 0.22735E-02 0.49303E+02 885 0.20581E+04 0.18627E+02 0.22695E-02 0.50305E+02 886 0.20465E+04 0.18898E+02 0.22655E-02 0.51277E+02 887 0.20348E+04 0.19172E+02 0.22614E-02 0.52218E+02 888 0.20231E+04 0.19449E+02 0.22573E-02 0.53128E+02 889 0.20113E+04 0.19729E+02 0.22530E-02 0.54007E+02 890 0.19994E+04 0.20012E+02 0.22487E-02 0.54855E+02 891 0.19875E+04 0.20298E+02 0.22442E-02 0.55669E+02 892 0.19755E+04 0.20586E+02 0.22397E-02 0.56452E+02 893 0.19635E+04 0.20877E+02 0.22351E-02 0.57201E+02 894 0.19515E+04 0.21171E+02 0.22304E-02 0.57916E+02 895 0.19393E+04 0.21467E+02 0.22255E-02 0.58598E+02 896 0.19272E+04 0.21765E+02 0.22206E-02 0.59245E+02 897 0.19150E+04 0.22065E+02 0.22156E-02 0.59857E+02 898 0.19028E+04 0.22368E+02 0.22104E-02 0.60435E+02 899 0.18905E+04 0.22672E+02 0.22052E-02 0.60976E+02 900 0.18782E+04 0.22978E+02 0.21998E-02 0.61482E+02 901 0.18659E+04 0.23287E+02 0.21943E-02 0.61951E+02 902 0.18536E+04 0.23596E+02 0.21887E-02 0.62383E+02 903 0.18412E+04 0.23908E+02 0.21829E-02 0.62780E+02 904 0.18288E+04 0.24221E+02 0.21771E-02 0.63141E+02 905 0.18165E+04 0.24535E+02 0.21711E-02 0.63467E+02 906 0.18041E+04 0.24850E+02 0.21650E-02 0.63757E+02 907 0.17917E+04 0.25166E+02 0.21588E-02 0.64012E+02 908 0.17793E+04 0.25483E+02 0.21526E-02 0.64233E+02 909 0.17669E+04 0.25801E+02 0.21462E-02 0.64419E+02 910 0.17545E+04 0.26120E+02 0.21398E-02 0.64571E+02 911 0.17421E+04 0.26438E+02 0.21333E-02 0.64688E+02 912 0.17297E+04 0.26758E+02 0.21266E-02 0.64772E+02 913 0.17174E+04 0.27077E+02 0.21200E-02 0.64823E+02 914 0.17050E+04 0.27397E+02 0.21132E-02 0.64840E+02 915 0.16927E+04 0.27716E+02 0.21064E-02 0.64825E+02 916 0.16804E+04 0.28036E+02 0.20995E-02 0.64777E+02 917 0.16682E+04 0.28355E+02 0.20926E-02 0.64696E+02 918 0.16559E+04 0.28674E+02 0.20856E-02 0.64583E+02 919 0.16437E+04 0.28992E+02 0.20785E-02 0.64438E+02 920 0.16315E+04 0.29309E+02 0.20714E-02 0.64261E+02 921 0.16194E+04 0.29626E+02 0.20643E-02 0.64053E+02 922 0.16073E+04 0.29941E+02 0.20571E-02 0.63814E+02 923 0.15953E+04 0.30256E+02 0.20499E-02 0.63544E+02 924 0.15833E+04 0.30569E+02 0.20426E-02 0.63243E+02 925 0.15713E+04 0.30881E+02 0.20353E-02 0.62911E+02 926 0.15594E+04 0.31191E+02 0.20280E-02 0.62550E+02 927 0.15476E+04 0.31500E+02 0.20207E-02 0.62158E+02 928 0.15358E+04 0.31807E+02 0.20134E-02 0.61737E+02 929 0.15241E+04 0.32112E+02 0.20060E-02 0.61286E+02 930 0.15125E+04 0.32415E+02 0.19987E-02 0.60807E+02 931 0.15009E+04 0.32716E+02 0.19913E-02 0.60298E+02 932 0.14895E+04 0.33014E+02 0.19840E-02 0.59760E+02 933 0.14781E+04 0.33310E+02 0.19766E-02 0.59195E+02 934 0.14667E+04 0.33604E+02 0.19693E-02 0.58601E+02 935 0.14555E+04 0.33895E+02 0.19620E-02 0.57979E+02 936 0.14443E+04 0.34183E+02 0.19547E-02 0.57329E+02 937 0.14333E+04 0.34468E+02 0.19474E-02 0.56652E+02 938 0.14223E+04 0.34750E+02 0.19401E-02 0.55948E+02 939 0.14114E+04 0.35029E+02 0.19329E-02 0.55217E+02 940 0.14006E+04 0.35305E+02 0.19257E-02 0.54459E+02 941 0.13900E+04 0.35577E+02 0.19185E-02 0.53675E+02 942 0.13794E+04 0.35845E+02 0.19114E-02 0.52865E+02 943 0.13689E+04 0.36110E+02 0.19043E-02 0.52029E+02 944 0.13586E+04 0.36371E+02 0.18973E-02 0.51167E+02 945 0.13484E+04 0.36627E+02 0.18903E-02 0.50280E+02 946 0.13383E+04 0.36880E+02 0.18834E-02 0.49368E+02 947 0.13283E+04 0.37128E+02 0.18765E-02 0.48430E+02 948 0.13184E+04 0.37372E+02 0.18698E-02 0.47469E+02 949 0.13087E+04 0.37612E+02 0.18630E-02 0.46483E+02 950 0.12991E+04 0.37847E+02 0.18564E-02 0.45472E+02 951 0.12896E+04 0.38077E+02 0.18498E-02 0.44438E+02 952 0.12803E+04 0.38302E+02 0.18433E-02 0.43381E+02 953 0.12711E+04 0.38522E+02 0.18369E-02 0.42301E+02 954 0.12621E+04 0.38737E+02 0.18306E-02 0.41199E+02 955 0.12532E+04 0.38948E+02 0.18243E-02 0.40076E+02 956 0.12444E+04 0.39153E+02 0.18181E-02 0.38932E+02 957 0.12357E+04 0.39354E+02 0.18120E-02 0.37767E+02 958 0.12272E+04 0.39549E+02 0.18060E-02 0.36584E+02 959 0.12189E+04 0.39739E+02 0.18000E-02 0.35381E+02 960 0.12106E+04 0.39925E+02 0.17941E-02 0.34160E+02 961 0.12026E+04 0.40105E+02 0.17883E-02 0.32922E+02 962 0.11946E+04 0.40280E+02 0.17826E-02 0.31666E+02 963 0.11868E+04 0.40449E+02 0.17769E-02 0.30394E+02 964 0.11791E+04 0.40614E+02 0.17713E-02 0.29107E+02 965 0.11716E+04 0.40773E+02 0.17658E-02 0.27804E+02 966 0.11642E+04 0.40926E+02 0.17603E-02 0.26486E+02 967 0.11570E+04 0.41075E+02 0.17550E-02 0.25155E+02 968 0.11499E+04 0.41218E+02 0.17496E-02 0.23811E+02 969 0.11429E+04 0.41355E+02 0.17444E-02 0.22454E+02 970 0.11361E+04 0.41487E+02 0.17392E-02 0.21084E+02 971 0.11295E+04 0.41614E+02 0.17341E-02 0.19704E+02 972 0.11229E+04 0.41735E+02 0.17291E-02 0.18312E+02 973 0.11165E+04 0.41850E+02 0.17241E-02 0.16911E+02 974 0.11103E+04 0.41960E+02 0.17192E-02 0.15500E+02 975 0.11042E+04 0.42064E+02 0.17144E-02 0.14080E+02 976 0.10983E+04 0.42163E+02 0.17096E-02 0.12652E+02 977 0.10925E+04 0.42256E+02 0.17049E-02 0.11216E+02 978 0.10868E+04 0.42343E+02 0.17003E-02 0.97727E+01 979 0.10813E+04 0.42424E+02 0.16958E-02 0.83233E+01 980 0.10759E+04 0.42500E+02 0.16913E-02 0.68681E+01 981 0.10707E+04 0.42569E+02 0.16868E-02 0.54078E+01 982 0.10657E+04 0.42633E+02 0.16825E-02 0.39429E+01 983 0.10608E+04 0.42691E+02 0.16782E-02 0.24741E+01 984 0.10560E+04 0.42742E+02 0.16739E-02 0.10019E+01 985 0.10514E+04 0.42788E+02 0.16697E-02 -0.47289E+00 986 0.10469E+04 0.42828E+02 0.16656E-02 -0.19498E+01 987 0.10426E+04 0.42862E+02 0.16616E-02 -0.34281E+01 988 0.10384E+04 0.42889E+02 0.16576E-02 -0.49072E+01 989 0.10344E+04 0.42911E+02 0.16537E-02 -0.63865E+01 990 0.10305E+04 0.42926E+02 0.16498E-02 -0.78653E+01 991 0.10268E+04 0.42935E+02 0.16460E-02 -0.93431E+01 992 0.10232E+04 0.42938E+02 0.16423E-02 -0.10819E+02 993 0.10198E+04 0.42935E+02 0.16386E-02 -0.12293E+02 994 0.10166E+04 0.42925E+02 0.16349E-02 -0.13764E+02 995 0.10134E+04 0.42909E+02 0.16314E-02 -0.15231E+02 996 0.10105E+04 0.42887E+02 0.16279E-02 -0.16694E+02 997 0.10077E+04 0.42858E+02 0.16244E-02 -0.18153E+02 998 0.10050E+04 0.42822E+02 0.16210E-02 -0.19606E+02 999 0.10026E+04 0.42781E+02 0.16177E-02 -0.21053E+02 1000 0.10002E+04 0.42732E+02 0.16144E-02 -0.22493E+02 1001 0.99804E+03 0.42677E+02 0.16112E-02 -0.23926E+02 1002 0.99601E+03 0.42616E+02 0.16081E-02 -0.25351E+02 1003 0.99413E+03 0.42548E+02 0.16049E-02 -0.26768E+02 1004 0.99240E+03 0.42474E+02 0.16019E-02 -0.28177E+02 1005 0.99082E+03 0.42394E+02 0.15989E-02 -0.29577E+02 1006 0.98938E+03 0.42307E+02 0.15959E-02 -0.30967E+02 1007 0.98809E+03 0.42215E+02 0.15930E-02 -0.32348E+02 1008 0.98694E+03 0.42116E+02 0.15901E-02 -0.33719E+02 1009 0.98592E+03 0.42012E+02 0.15873E-02 -0.35079E+02 1010 0.98505E+03 0.41901E+02 0.15844E-02 -0.36429E+02 1011 0.98430E+03 0.41785E+02 0.15817E-02 -0.37767E+02 1012 0.98369E+03 0.41663E+02 0.15789E-02 -0.39093E+02 1013 0.98321E+03 0.41536E+02 0.15762E-02 -0.40407E+02 1014 0.98285E+03 0.41403E+02 0.15735E-02 -0.41709E+02 1015 0.98263E+03 0.41265E+02 0.15709E-02 -0.42998E+02 1016 0.98252E+03 0.41121E+02 0.15683E-02 -0.44274E+02 1017 0.98254E+03 0.40972E+02 0.15657E-02 -0.45536E+02 1018 0.98268E+03 0.40818E+02 0.15631E-02 -0.46784E+02 1019 0.98293E+03 0.40658E+02 0.15605E-02 -0.48017E+02 1020 0.98330E+03 0.40494E+02 0.15579E-02 -0.49236E+02 1021 0.98378E+03 0.40325E+02 0.15554E-02 -0.50439E+02 1022 0.98438E+03 0.40150E+02 0.15529E-02 -0.51627E+02 1023 0.98508E+03 0.39971E+02 0.15503E-02 -0.52798E+02 1024 0.98589E+03 0.39788E+02 0.15478E-02 -0.53953E+02 1025 0.98680E+03 0.39599E+02 0.15453E-02 -0.55092E+02 1026 0.98782E+03 0.39406E+02 0.15428E-02 -0.56212E+02 1027 0.98894E+03 0.39209E+02 0.15403E-02 -0.57316E+02 1028 0.99015E+03 0.39007E+02 0.15378E-02 -0.58401E+02 1029 0.99147E+03 0.38800E+02 0.15352E-02 -0.59468E+02 1030 0.99287E+03 0.38590E+02 0.15327E-02 -0.60515E+02 1031 0.99437E+03 0.38375E+02 0.15302E-02 -0.61544E+02 1032 0.99596E+03 0.38156E+02 0.15276E-02 -0.62553E+02 1033 0.99763E+03 0.37934E+02 0.15251E-02 -0.63542E+02 1034 0.99940E+03 0.37707E+02 0.15225E-02 -0.64510E+02 1035 0.10012E+04 0.37476E+02 0.15199E-02 -0.65457E+02 1036 0.10032E+04 0.37242E+02 0.15173E-02 -0.66384E+02 1037 0.10052E+04 0.37004E+02 0.15146E-02 -0.67288E+02 1038 0.10073E+04 0.36762E+02 0.15120E-02 -0.68171E+02 1039 0.10094E+04 0.36517E+02 0.15093E-02 -0.69030E+02 1040 0.10116E+04 0.36269E+02 0.15066E-02 -0.69868E+02 1041 0.10140E+04 0.36017E+02 0.15038E-02 -0.70681E+02 1042 0.10163E+04 0.35761E+02 0.15010E-02 -0.71472E+02 1043 0.10188E+04 0.35503E+02 0.14982E-02 -0.72238E+02 1044 0.10213E+04 0.35241E+02 0.14953E-02 -0.72979E+02 1045 0.10238E+04 0.34976E+02 0.14924E-02 -0.73696E+02 1046 0.10265E+04 0.34709E+02 0.14895E-02 -0.74388E+02 1047 0.10291E+04 0.34438E+02 0.14865E-02 -0.75054E+02 1048 0.10319E+04 0.34164E+02 0.14835E-02 -0.75694E+02 1049 0.10347E+04 0.33888E+02 0.14804E-02 -0.76307E+02 1050 0.10375E+04 0.33609E+02 0.14773E-02 -0.76893E+02 1051 0.10404E+04 0.33328E+02 0.14741E-02 -0.77453E+02 1052 0.10434E+04 0.33044E+02 0.14709E-02 -0.77985E+02 1053 0.10463E+04 0.32758E+02 0.14676E-02 -0.78490E+02 1054 0.10494E+04 0.32469E+02 0.14643E-02 -0.78969E+02 1055 0.10525E+04 0.32179E+02 0.14609E-02 -0.79421E+02 1056 0.10556E+04 0.31886E+02 0.14575E-02 -0.79846E+02 1057 0.10587E+04 0.31592E+02 0.14540E-02 -0.80245E+02 1058 0.10619E+04 0.31296E+02 0.14505E-02 -0.80617E+02 1059 0.10651E+04 0.30998E+02 0.14469E-02 -0.80964E+02 1060 0.10683E+04 0.30699E+02 0.14433E-02 -0.81285E+02 1061 0.10716E+04 0.30399E+02 0.14397E-02 -0.81579E+02 1062 0.10749E+04 0.30097E+02 0.14360E-02 -0.81849E+02 1063 0.10782E+04 0.29794E+02 0.14323E-02 -0.82092E+02 1064 0.10815E+04 0.29490E+02 0.14286E-02 -0.82311E+02 1065 0.10849E+04 0.29186E+02 0.14248E-02 -0.82504E+02 1066 0.10882E+04 0.28880E+02 0.14210E-02 -0.82672E+02 1067 0.10916E+04 0.28574E+02 0.14172E-02 -0.82815E+02 1068 0.10950E+04 0.28267E+02 0.14133E-02 -0.82934E+02 1069 0.10983E+04 0.27960E+02 0.14094E-02 -0.83027E+02 1070 0.11017E+04 0.27653E+02 0.14055E-02 -0.83097E+02 1071 0.11051E+04 0.27346E+02 0.14016E-02 -0.83142E+02 1072 0.11085E+04 0.27038E+02 0.13976E-02 -0.83163E+02 1073 0.11119E+04 0.26731E+02 0.13936E-02 -0.83160E+02 1074 0.11153E+04 0.26424E+02 0.13896E-02 -0.83133E+02 1075 0.11187E+04 0.26117E+02 0.13856E-02 -0.83082E+02 1076 0.11220E+04 0.25811E+02 0.13816E-02 -0.83007E+02 1077 0.11254E+04 0.25506E+02 0.13775E-02 -0.82910E+02 1078 0.11287E+04 0.25201E+02 0.13734E-02 -0.82789E+02 1079 0.11320E+04 0.24897E+02 0.13694E-02 -0.82644E+02 1080 0.11354E+04 0.24594E+02 0.13653E-02 -0.82477E+02 1081 0.11386E+04 0.24292E+02 0.13612E-02 -0.82287E+02 1082 0.11419E+04 0.23991E+02 0.13571E-02 -0.82074E+02 1083 0.11451E+04 0.23691E+02 0.13529E-02 -0.81839E+02 1084 0.11483E+04 0.23394E+02 0.13488E-02 -0.81581E+02 1085 0.11515E+04 0.23097E+02 0.13447E-02 -0.81301E+02 1086 0.11546E+04 0.22802E+02 0.13406E-02 -0.80999E+02 1087 0.11577E+04 0.22509E+02 0.13364E-02 -0.80675E+02 1088 0.11608E+04 0.22219E+02 0.13323E-02 -0.80329E+02 1089 0.11638E+04 0.21930E+02 0.13282E-02 -0.79962E+02 1090 0.11668E+04 0.21643E+02 0.13241E-02 -0.79573E+02 1091 0.11697E+04 0.21359E+02 0.13199E-02 -0.79162E+02 1092 0.11726E+04 0.21077E+02 0.13158E-02 -0.78731E+02 1093 0.11754E+04 0.20797E+02 0.13117E-02 -0.78278E+02 1094 0.11782E+04 0.20521E+02 0.13076E-02 -0.77804E+02 1095 0.11809E+04 0.20247E+02 0.13035E-02 -0.77310E+02 1096 0.11836E+04 0.19976E+02 0.12995E-02 -0.76795E+02 1097 0.11862E+04 0.19708E+02 0.12954E-02 -0.76259E+02 1098 0.11888E+04 0.19443E+02 0.12913E-02 -0.75703E+02 1099 0.11912E+04 0.19182E+02 0.12873E-02 -0.75127E+02 1100 0.11937E+04 0.18924E+02 0.12833E-02 -0.74531E+02 1101 0.11960E+04 0.18669E+02 0.12793E-02 -0.73914E+02 1102 0.11983E+04 0.18418E+02 0.12753E-02 -0.73279E+02 1103 0.12005E+04 0.18171E+02 0.12714E-02 -0.72624E+02 1104 0.12026E+04 0.17927E+02 0.12675E-02 -0.71952E+02 1105 0.12047E+04 0.17687E+02 0.12635E-02 -0.71261E+02 1106 0.12067E+04 0.17451E+02 0.12597E-02 -0.70552E+02 1107 0.12086E+04 0.17218E+02 0.12558E-02 -0.69827E+02 1108 0.12104E+04 0.16990E+02 0.12519E-02 -0.69084E+02 1109 0.12122E+04 0.16765E+02 0.12481E-02 -0.68326E+02 1110 0.12139E+04 0.16545E+02 0.12443E-02 -0.67553E+02 1111 0.12155E+04 0.16328E+02 0.12405E-02 -0.66764E+02 1112 0.12171E+04 0.16115E+02 0.12368E-02 -0.65960E+02 1113 0.12185E+04 0.15906E+02 0.12330E-02 -0.65142E+02 1114 0.12199E+04 0.15702E+02 0.12293E-02 -0.64311E+02 1115 0.12212E+04 0.15501E+02 0.12256E-02 -0.63466E+02 1116 0.12225E+04 0.15305E+02 0.12220E-02 -0.62609E+02 1117 0.12236E+04 0.15113E+02 0.12184E-02 -0.61739E+02 1118 0.12247E+04 0.14926E+02 0.12147E-02 -0.60857E+02 1119 0.12257E+04 0.14742E+02 0.12112E-02 -0.59965E+02 1120 0.12267E+04 0.14563E+02 0.12076E-02 -0.59061E+02 1121 0.12275E+04 0.14389E+02 0.12041E-02 -0.58147E+02 1122 0.12283E+04 0.14219E+02 0.12006E-02 -0.57223E+02 1123 0.12290E+04 0.14053E+02 0.11971E-02 -0.56290E+02 1124 0.12296E+04 0.13892E+02 0.11937E-02 -0.55347E+02 1125 0.12301E+04 0.13736E+02 0.11902E-02 -0.54397E+02 1126 0.12305E+04 0.13584E+02 0.11869E-02 -0.53438E+02 1127 0.12309E+04 0.13437E+02 0.11835E-02 -0.52472E+02 1128 0.12312E+04 0.13295E+02 0.11802E-02 -0.51499E+02 1129 0.12314E+04 0.13157E+02 0.11769E-02 -0.50519E+02 1130 0.12315E+04 0.13024E+02 0.11736E-02 -0.49533E+02 1131 0.12315E+04 0.12897E+02 0.11704E-02 -0.48542E+02 1132 0.12314E+04 0.12774E+02 0.11671E-02 -0.47545E+02 1133 0.12313E+04 0.12656E+02 0.11640E-02 -0.46544E+02 1134 0.12311E+04 0.12543E+02 0.11608E-02 -0.45539E+02 1135 0.12307E+04 0.12435E+02 0.11577E-02 -0.44530E+02 1136 0.12303E+04 0.12332E+02 0.11546E-02 -0.43518E+02 1137 0.12298E+04 0.12234E+02 0.11516E-02 -0.42503E+02 1138 0.12292E+04 0.12141E+02 0.11486E-02 -0.41485E+02 1139 0.12286E+04 0.12054E+02 0.11456E-02 -0.40467E+02 1140 0.12278E+04 0.11972E+02 0.11427E-02 -0.39446E+02 1141 0.12270E+04 0.11895E+02 0.11398E-02 -0.38425E+02 1142 0.12260E+04 0.11824E+02 0.11369E-02 -0.37404E+02 1143 0.12250E+04 0.11757E+02 0.11340E-02 -0.36383E+02 1144 0.12239E+04 0.11697E+02 0.11312E-02 -0.35362E+02 1145 0.12226E+04 0.11642E+02 0.11285E-02 -0.34342E+02 1146 0.12213E+04 0.11592E+02 0.11257E-02 -0.33324E+02 1147 0.12199E+04 0.11548E+02 0.11230E-02 -0.32308E+02 1148 0.12184E+04 0.11510E+02 0.11204E-02 -0.31295E+02 1149 0.12168E+04 0.11477E+02 0.11178E-02 -0.30285E+02 1150 0.12152E+04 0.11450E+02 0.11152E-02 -0.29278E+02 1151 0.12134E+04 0.11429E+02 0.11126E-02 -0.28275E+02 1152 0.12115E+04 0.11413E+02 0.11101E-02 -0.27276E+02 1153 0.12095E+04 0.11403E+02 0.11077E-02 -0.26282E+02 1154 0.12075E+04 0.11399E+02 0.11052E-02 -0.25293E+02 1155 0.12054E+04 0.11400E+02 0.11028E-02 -0.24309E+02 1156 0.12031E+04 0.11406E+02 0.11005E-02 -0.23330E+02 1157 0.12008E+04 0.11418E+02 0.10981E-02 -0.22358E+02 1158 0.11984E+04 0.11435E+02 0.10958E-02 -0.21392E+02 1159 0.11959E+04 0.11457E+02 0.10935E-02 -0.20432E+02 1160 0.11933E+04 0.11485E+02 0.10913E-02 -0.19479E+02 1161 0.11907E+04 0.11518E+02 0.10891E-02 -0.18534E+02 1162 0.11880E+04 0.11555E+02 0.10869E-02 -0.17596E+02 1163 0.11851E+04 0.11598E+02 0.10847E-02 -0.16665E+02 1164 0.11823E+04 0.11646E+02 0.10826E-02 -0.15743E+02 1165 0.11793E+04 0.11698E+02 0.10804E-02 -0.14830E+02 1166 0.11763E+04 0.11756E+02 0.10783E-02 -0.13925E+02 1167 0.11731E+04 0.11818E+02 0.10763E-02 -0.13030E+02 1168 0.11700E+04 0.11884E+02 0.10742E-02 -0.12144E+02 1169 0.11667E+04 0.11956E+02 0.10721E-02 -0.11268E+02 1170 0.11634E+04 0.12032E+02 0.10701E-02 -0.10402E+02 1171 0.11600E+04 0.12112E+02 0.10681E-02 -0.95459E+01 1172 0.11566E+04 0.12197E+02 0.10661E-02 -0.87011E+01 1173 0.11530E+04 0.12286E+02 0.10641E-02 -0.78674E+01 1174 0.11495E+04 0.12379E+02 0.10621E-02 -0.70451E+01 1175 0.11458E+04 0.12477E+02 0.10602E-02 -0.62346E+01 1176 0.11421E+04 0.12579E+02 0.10582E-02 -0.54362E+01 1177 0.11383E+04 0.12685E+02 0.10562E-02 -0.46502E+01 1178 0.11345E+04 0.12795E+02 0.10543E-02 -0.38769E+01 1179 0.11306E+04 0.12908E+02 0.10524E-02 -0.31167E+01 1180 0.11267E+04 0.13026E+02 0.10504E-02 -0.23699E+01 1181 0.11227E+04 0.13148E+02 0.10485E-02 -0.16368E+01 1182 0.11187E+04 0.13273E+02 0.10466E-02 -0.91775E+00 1183 0.11146E+04 0.13403E+02 0.10447E-02 -0.21305E+00 1184 0.11104E+04 0.13535E+02 0.10427E-02 0.47696E+00 1185 0.11063E+04 0.13672E+02 0.10408E-02 0.11520E+01 1186 0.11020E+04 0.13812E+02 0.10389E-02 0.18116E+01 1187 0.10977E+04 0.13955E+02 0.10370E-02 0.24556E+01 1188 0.10934E+04 0.14102E+02 0.10350E-02 0.30836E+01 1189 0.10890E+04 0.14252E+02 0.10331E-02 0.36953E+01 1190 0.10846E+04 0.14405E+02 0.10312E-02 0.42904E+01 1191 0.10802E+04 0.14562E+02 0.10292E-02 0.48684E+01 1192 0.10757E+04 0.14722E+02 0.10272E-02 0.54292E+01 1193 0.10712E+04 0.14885E+02 0.10253E-02 0.59724E+01 1194 0.10666E+04 0.15050E+02 0.10233E-02 0.64976E+01 1195 0.10620E+04 0.15219E+02 0.10213E-02 0.70046E+01 1196 0.10574E+04 0.15391E+02 0.10193E-02 0.74930E+01 1197 0.10527E+04 0.15566E+02 0.10173E-02 0.79624E+01 1198 0.10480E+04 0.15743E+02 0.10152E-02 0.84126E+01 1199 0.10433E+04 0.15923E+02 0.10132E-02 0.88433E+01 1200 0.10386E+04 0.16106E+02 0.10111E-02 0.92540E+01 1201 0.10338E+04 0.16291E+02 0.10090E-02 0.96446E+01 1202 0.10290E+04 0.16478E+02 0.10069E-02 0.10015E+02 1203 0.10242E+04 0.16668E+02 0.10047E-02 0.10366E+02 1204 0.10193E+04 0.16861E+02 0.10026E-02 0.10696E+02 1205 0.10145E+04 0.17055E+02 0.10004E-02 0.11007E+02 1206 0.10096E+04 0.17252E+02 0.99823E-03 0.11298E+02 1207 0.10047E+04 0.17450E+02 0.99603E-03 0.11569E+02 1208 0.99978E+03 0.17651E+02 0.99381E-03 0.11821E+02 1209 0.99485E+03 0.17853E+02 0.99158E-03 0.12053E+02 1210 0.98991E+03 0.18057E+02 0.98933E-03 0.12266E+02 1211 0.98497E+03 0.18262E+02 0.98706E-03 0.12459E+02 1212 0.98001E+03 0.18469E+02 0.98478E-03 0.12634E+02 1213 0.97505E+03 0.18677E+02 0.98249E-03 0.12789E+02 1214 0.97008E+03 0.18886E+02 0.98018E-03 0.12925E+02 1215 0.96511E+03 0.19097E+02 0.97786E-03 0.13043E+02 1216 0.96014E+03 0.19308E+02 0.97553E-03 0.13141E+02 1217 0.95517E+03 0.19521E+02 0.97318E-03 0.13221E+02 1218 0.95020E+03 0.19734E+02 0.97082E-03 0.13282E+02 1219 0.94523E+03 0.19949E+02 0.96845E-03 0.13325E+02 1220 0.94027E+03 0.20163E+02 0.96607E-03 0.13350E+02 1221 0.93531E+03 0.20379E+02 0.96368E-03 0.13356E+02 1222 0.93036E+03 0.20594E+02 0.96128E-03 0.13343E+02 1223 0.92543E+03 0.20810E+02 0.95887E-03 0.13313E+02 1224 0.92050E+03 0.21027E+02 0.95645E-03 0.13264E+02 1225 0.91559E+03 0.21243E+02 0.95402E-03 0.13198E+02 1226 0.91069E+03 0.21459E+02 0.95158E-03 0.13114E+02 1227 0.90581E+03 0.21676E+02 0.94914E-03 0.13012E+02 1228 0.90094E+03 0.21892E+02 0.94668E-03 0.12892E+02 1229 0.89610E+03 0.22108E+02 0.94422E-03 0.12754E+02 1230 0.89127E+03 0.22323E+02 0.94175E-03 0.12600E+02 1231 0.88647E+03 0.22538E+02 0.93928E-03 0.12427E+02 1232 0.88170E+03 0.22753E+02 0.93680E-03 0.12238E+02 1233 0.87695E+03 0.22967E+02 0.93432E-03 0.12031E+02 1234 0.87222E+03 0.23180E+02 0.93183E-03 0.11807E+02 1235 0.86753E+03 0.23392E+02 0.92933E-03 0.11566E+02 1236 0.86287E+03 0.23603E+02 0.92683E-03 0.11309E+02 1237 0.85824E+03 0.23813E+02 0.92433E-03 0.11034E+02 1238 0.85365E+03 0.24021E+02 0.92183E-03 0.10743E+02 1239 0.84909E+03 0.24229E+02 0.91932E-03 0.10435E+02 1240 0.84457E+03 0.24435E+02 0.91681E-03 0.10110E+02 1241 0.84009E+03 0.24640E+02 0.91429E-03 0.97689E+01 1242 0.83565E+03 0.24843E+02 0.91178E-03 0.94115E+01 1243 0.83125E+03 0.25044E+02 0.90927E-03 0.90379E+01 1244 0.82689E+03 0.25243E+02 0.90675E-03 0.86481E+01 1245 0.82259E+03 0.25441E+02 0.90423E-03 0.82421E+01 1246 0.81833E+03 0.25636E+02 0.90172E-03 0.78202E+01 1247 0.81412E+03 0.25830E+02 0.89921E-03 0.73824E+01 1248 0.80996E+03 0.26021E+02 0.89669E-03 0.69288E+01 1249 0.80585E+03 0.26210E+02 0.89418E-03 0.64595E+01 1250 0.80179E+03 0.26396E+02 0.89167E-03 0.59746E+01 1251 0.79780E+03 0.26580E+02 0.88916E-03 0.54743E+01 1252 0.79385E+03 0.26761E+02 0.88666E-03 0.49587E+01 1253 0.78997E+03 0.26940E+02 0.88416E-03 0.44284E+01 1254 0.78614E+03 0.27116E+02 0.88166E-03 0.38837E+01 1255 0.78237E+03 0.27290E+02 0.87917E-03 0.33249E+01 1256 0.77865E+03 0.27460E+02 0.87668E-03 0.27524E+01 1257 0.77500E+03 0.27628E+02 0.87419E-03 0.21666E+01 1258 0.77140E+03 0.27793E+02 0.87171E-03 0.15678E+01 1259 0.76786E+03 0.27955E+02 0.86924E-03 0.95643E+00 1260 0.76438E+03 0.28115E+02 0.86677E-03 0.33282E+00 1261 0.76096E+03 0.28271E+02 0.86430E-03 -0.30265E+00 1262 0.75760E+03 0.28424E+02 0.86185E-03 -0.94963E+00 1263 0.75430E+03 0.28574E+02 0.85940E-03 -0.16077E+01 1264 0.75106E+03 0.28721E+02 0.85695E-03 -0.22766E+01 1265 0.74788E+03 0.28865E+02 0.85452E-03 -0.29559E+01 1266 0.74476E+03 0.29006E+02 0.85209E-03 -0.36453E+01 1267 0.74171E+03 0.29144E+02 0.84967E-03 -0.43443E+01 1268 0.73871E+03 0.29278E+02 0.84726E-03 -0.50526E+01 1269 0.73578E+03 0.29409E+02 0.84486E-03 -0.57699E+01 1270 0.73291E+03 0.29536E+02 0.84247E-03 -0.64958E+01 1271 0.73011E+03 0.29661E+02 0.84008E-03 -0.72298E+01 1272 0.72736E+03 0.29781E+02 0.83771E-03 -0.79718E+01 1273 0.72469E+03 0.29899E+02 0.83535E-03 -0.87212E+01 1274 0.72207E+03 0.30012E+02 0.83299E-03 -0.94777E+01 1275 0.71952E+03 0.30122E+02 0.83065E-03 -0.10241E+02 1276 0.71704E+03 0.30229E+02 0.82832E-03 -0.11011E+02 1277 0.71462E+03 0.30332E+02 0.82600E-03 -0.11786E+02 1278 0.71227E+03 0.30431E+02 0.82369E-03 -0.12568E+02 1279 0.70998E+03 0.30526E+02 0.82140E-03 -0.13355E+02 1280 0.70776E+03 0.30618E+02 0.81912E-03 -0.14146E+02 1281 0.70560E+03 0.30705E+02 0.81685E-03 -0.14942E+02 1282 0.70352E+03 0.30789E+02 0.81460E-03 -0.15743E+02 1283 0.70150E+03 0.30869E+02 0.81235E-03 -0.16547E+02 1284 0.69954E+03 0.30945E+02 0.81013E-03 -0.17355E+02 1285 0.69766E+03 0.31017E+02 0.80791E-03 -0.18166E+02 1286 0.69585E+03 0.31085E+02 0.80572E-03 -0.18979E+02 1287 0.69410E+03 0.31148E+02 0.80353E-03 -0.19795E+02 1288 0.69243E+03 0.31208E+02 0.80137E-03 -0.20613E+02 1289 0.69082E+03 0.31263E+02 0.79922E-03 -0.21433E+02 1290 0.68928E+03 0.31314E+02 0.79708E-03 -0.22254E+02 1291 0.68782E+03 0.31361E+02 0.79496E-03 -0.23076E+02 1292 0.68642E+03 0.31404E+02 0.79286E-03 -0.23898E+02 1293 0.68510E+03 0.31442E+02 0.79078E-03 -0.24720E+02 1294 0.68385E+03 0.31476E+02 0.78871E-03 -0.25543E+02 1295 0.68267E+03 0.31505E+02 0.78666E-03 -0.26365E+02 1296 0.68156E+03 0.31530E+02 0.78463E-03 -0.27186E+02 1297 0.68053E+03 0.31550E+02 0.78262E-03 -0.28005E+02 1298 0.67956E+03 0.31565E+02 0.78063E-03 -0.28824E+02 1299 0.67868E+03 0.31576E+02 0.77866E-03 -0.29640E+02 1300 0.67786E+03 0.31583E+02 0.77671E-03 -0.30453E+02 1301 0.67712E+03 0.31584E+02 0.77477E-03 -0.31264E+02 1302 0.67646E+03 0.31581E+02 0.77286E-03 -0.32072E+02 1303 0.67586E+03 0.31573E+02 0.77097E-03 -0.32877E+02 1304 0.67534E+03 0.31561E+02 0.76909E-03 -0.33678E+02 1305 0.67488E+03 0.31544E+02 0.76724E-03 -0.34476E+02 1306 0.67450E+03 0.31523E+02 0.76540E-03 -0.35269E+02 1307 0.67418E+03 0.31497E+02 0.76358E-03 -0.36058E+02 1308 0.67394E+03 0.31466E+02 0.76177E-03 -0.36842E+02 1309 0.67375E+03 0.31432E+02 0.75998E-03 -0.37622E+02 1310 0.67364E+03 0.31393E+02 0.75821E-03 -0.38396E+02 1311 0.67358E+03 0.31350E+02 0.75646E-03 -0.39165E+02 1312 0.67359E+03 0.31302E+02 0.75471E-03 -0.39928E+02 1313 0.67366E+03 0.31251E+02 0.75299E-03 -0.40686E+02 1314 0.67380E+03 0.31195E+02 0.75128E-03 -0.41437E+02 1315 0.67399E+03 0.31135E+02 0.74958E-03 -0.42181E+02 1316 0.67424E+03 0.31071E+02 0.74789E-03 -0.42919E+02 1317 0.67455E+03 0.31003E+02 0.74622E-03 -0.43650E+02 1318 0.67492E+03 0.30931E+02 0.74456E-03 -0.44373E+02 1319 0.67535E+03 0.30856E+02 0.74291E-03 -0.45089E+02 1320 0.67582E+03 0.30776E+02 0.74127E-03 -0.45797E+02 1321 0.67636E+03 0.30693E+02 0.73965E-03 -0.46497E+02 1322 0.67694E+03 0.30606E+02 0.73803E-03 -0.47188E+02 1323 0.67758E+03 0.30515E+02 0.73643E-03 -0.47871E+02 1324 0.67827E+03 0.30420E+02 0.73483E-03 -0.48545E+02 1325 0.67901E+03 0.30322E+02 0.73325E-03 -0.49210E+02 1326 0.67980E+03 0.30220E+02 0.73167E-03 -0.49865E+02 1327 0.68063E+03 0.30115E+02 0.73010E-03 -0.50511E+02 1328 0.68152E+03 0.30006E+02 0.72854E-03 -0.51147E+02 1329 0.68245E+03 0.29893E+02 0.72698E-03 -0.51772E+02 1330 0.68342E+03 0.29778E+02 0.72544E-03 -0.52387E+02 1331 0.68444E+03 0.29659E+02 0.72390E-03 -0.52991E+02 1332 0.68550E+03 0.29536E+02 0.72236E-03 -0.53584E+02 1333 0.68661E+03 0.29411E+02 0.72083E-03 -0.54165E+02 1334 0.68775E+03 0.29282E+02 0.71931E-03 -0.54735E+02 1335 0.68894E+03 0.29150E+02 0.71779E-03 -0.55293E+02 1336 0.69016E+03 0.29014E+02 0.71627E-03 -0.55839E+02 1337 0.69142E+03 0.28876E+02 0.71476E-03 -0.56373E+02 1338 0.69272E+03 0.28735E+02 0.71325E-03 -0.56893E+02 1339 0.69405E+03 0.28591E+02 0.71174E-03 -0.57401E+02 1340 0.69542E+03 0.28443E+02 0.71024E-03 -0.57896E+02 1341 0.69683E+03 0.28293E+02 0.70874E-03 -0.58377E+02 1342 0.69826E+03 0.28140E+02 0.70724E-03 -0.58845E+02 1343 0.69973E+03 0.27984E+02 0.70574E-03 -0.59298E+02 1344 0.70123E+03 0.27826E+02 0.70424E-03 -0.59737E+02 1345 0.70276E+03 0.27664E+02 0.70274E-03 -0.60161E+02 1346 0.70432E+03 0.27500E+02 0.70124E-03 -0.60571E+02 1347 0.70590E+03 0.27333E+02 0.69974E-03 -0.60965E+02 1348 0.70752E+03 0.27164E+02 0.69823E-03 -0.61345E+02 1349 0.70916E+03 0.26992E+02 0.69673E-03 -0.61708E+02 1350 0.71082E+03 0.26818E+02 0.69522E-03 -0.62056E+02 1351 0.71251E+03 0.26641E+02 0.69371E-03 -0.62387E+02 1352 0.71422E+03 0.26462E+02 0.69220E-03 -0.62702E+02 1353 0.71595E+03 0.26281E+02 0.69069E-03 -0.63002E+02 1354 0.71770E+03 0.26097E+02 0.68917E-03 -0.63285E+02 1355 0.71947E+03 0.25912E+02 0.68765E-03 -0.63552E+02 1356 0.72126E+03 0.25724E+02 0.68613E-03 -0.63803E+02 1357 0.72306E+03 0.25534E+02 0.68460E-03 -0.64038E+02 1358 0.72488E+03 0.25343E+02 0.68307E-03 -0.64258E+02 1359 0.72672E+03 0.25149E+02 0.68154E-03 -0.64462E+02 1360 0.72856E+03 0.24954E+02 0.68001E-03 -0.64650E+02 1361 0.73042E+03 0.24758E+02 0.67847E-03 -0.64822E+02 1362 0.73229E+03 0.24559E+02 0.67693E-03 -0.64978E+02 1363 0.73416E+03 0.24360E+02 0.67539E-03 -0.65119E+02 1364 0.73605E+03 0.24159E+02 0.67384E-03 -0.65245E+02 1365 0.73793E+03 0.23956E+02 0.67230E-03 -0.65355E+02 1366 0.73983E+03 0.23753E+02 0.67075E-03 -0.65449E+02 1367 0.74173E+03 0.23548E+02 0.66919E-03 -0.65528E+02 1368 0.74363E+03 0.23342E+02 0.66764E-03 -0.65592E+02 1369 0.74553E+03 0.23135E+02 0.66608E-03 -0.65641E+02 1370 0.74743E+03 0.22928E+02 0.66452E-03 -0.65674E+02 1371 0.74933E+03 0.22720E+02 0.66296E-03 -0.65692E+02 1372 0.75123E+03 0.22510E+02 0.66139E-03 -0.65695E+02 1373 0.75312E+03 0.22301E+02 0.65982E-03 -0.65682E+02 1374 0.75501E+03 0.22090E+02 0.65825E-03 -0.65655E+02 1375 0.75689E+03 0.21880E+02 0.65667E-03 -0.65613E+02 1376 0.75877E+03 0.21669E+02 0.65510E-03 -0.65556E+02 1377 0.76063E+03 0.21457E+02 0.65352E-03 -0.65483E+02 1378 0.76249E+03 0.21246E+02 0.65193E-03 -0.65396E+02 1379 0.76433E+03 0.21034E+02 0.65035E-03 -0.65295E+02 1380 0.76616E+03 0.20822E+02 0.64876E-03 -0.65178E+02 1381 0.76798E+03 0.20610E+02 0.64717E-03 -0.65047E+02 1382 0.76978E+03 0.20399E+02 0.64558E-03 -0.64901E+02 1383 0.77156E+03 0.20187E+02 0.64398E-03 -0.64740E+02 1384 0.77333E+03 0.19976E+02 0.64238E-03 -0.64565E+02 1385 0.77508E+03 0.19765E+02 0.64078E-03 -0.64375E+02 1386 0.77681E+03 0.19555E+02 0.63918E-03 -0.64171E+02 1387 0.77851E+03 0.19345E+02 0.63757E-03 -0.63953E+02 1388 0.78020E+03 0.19136E+02 0.63596E-03 -0.63720E+02 1389 0.78186E+03 0.18927E+02 0.63435E-03 -0.63473E+02 1390 0.78349E+03 0.18719E+02 0.63273E-03 -0.63211E+02 1391 0.78510E+03 0.18512E+02 0.63112E-03 -0.62936E+02 1392 0.78668E+03 0.18306E+02 0.62950E-03 -0.62646E+02 1393 0.78823E+03 0.18102E+02 0.62788E-03 -0.62342E+02 1394 0.78975E+03 0.17898E+02 0.62625E-03 -0.62024E+02 1395 0.79123E+03 0.17695E+02 0.62462E-03 -0.61692E+02 1396 0.79269E+03 0.17494E+02 0.62299E-03 -0.61346E+02 1397 0.79411E+03 0.17294E+02 0.62136E-03 -0.60986E+02 1398 0.79549E+03 0.17095E+02 0.61972E-03 -0.60612E+02 1399 0.79684E+03 0.16898E+02 0.61809E-03 -0.60225E+02 1400 0.79815E+03 0.16703E+02 0.61645E-03 -0.59823E+02 1401 0.79942E+03 0.16509E+02 0.61480E-03 -0.59408E+02 1402 0.80066E+03 0.16317E+02 0.61316E-03 -0.58980E+02 1403 0.80185E+03 0.16126E+02 0.61151E-03 -0.58538E+02 1404 0.80300E+03 0.15938E+02 0.60986E-03 -0.58083E+02 1405 0.80411E+03 0.15751E+02 0.60821E-03 -0.57616E+02 1406 0.80518E+03 0.15567E+02 0.60656E-03 -0.57137E+02 1407 0.80620E+03 0.15384E+02 0.60490E-03 -0.56645E+02 1408 0.80719E+03 0.15203E+02 0.60325E-03 -0.56142E+02 1409 0.80813E+03 0.15024E+02 0.60159E-03 -0.55627E+02 1410 0.80903E+03 0.14848E+02 0.59994E-03 -0.55101E+02 1411 0.80989E+03 0.14673E+02 0.59829E-03 -0.54564E+02 1412 0.81070E+03 0.14501E+02 0.59663E-03 -0.54016E+02 1413 0.81147E+03 0.14330E+02 0.59498E-03 -0.53458E+02 1414 0.81220E+03 0.14162E+02 0.59333E-03 -0.52890E+02 1415 0.81288E+03 0.13997E+02 0.59167E-03 -0.52312E+02 1416 0.81351E+03 0.13833E+02 0.59003E-03 -0.51724E+02 1417 0.81410E+03 0.13672E+02 0.58838E-03 -0.51127E+02 1418 0.81465E+03 0.13513E+02 0.58673E-03 -0.50521E+02 1419 0.81515E+03 0.13357E+02 0.58509E-03 -0.49907E+02 1420 0.81560E+03 0.13203E+02 0.58345E-03 -0.49284E+02 1421 0.81600E+03 0.13052E+02 0.58181E-03 -0.48652E+02 1422 0.81636E+03 0.12904E+02 0.58017E-03 -0.48013E+02 1423 0.81667E+03 0.12757E+02 0.57854E-03 -0.47366E+02 1424 0.81693E+03 0.12614E+02 0.57691E-03 -0.46712E+02 1425 0.81714E+03 0.12473E+02 0.57529E-03 -0.46051E+02 1426 0.81731E+03 0.12335E+02 0.57367E-03 -0.45383E+02 1427 0.81742E+03 0.12200E+02 0.57205E-03 -0.44708E+02 1428 0.81749E+03 0.12068E+02 0.57044E-03 -0.44028E+02 1429 0.81750E+03 0.11939E+02 0.56884E-03 -0.43341E+02 1430 0.81746E+03 0.11812E+02 0.56724E-03 -0.42648E+02 1431 0.81738E+03 0.11688E+02 0.56564E-03 -0.41951E+02 1432 0.81724E+03 0.11568E+02 0.56405E-03 -0.41248E+02 1433 0.81705E+03 0.11450E+02 0.56247E-03 -0.40540E+02 1434 0.81681E+03 0.11336E+02 0.56090E-03 -0.39827E+02 1435 0.81651E+03 0.11224E+02 0.55933E-03 -0.39111E+02 1436 0.81617E+03 0.11116E+02 0.55776E-03 -0.38390E+02 1437 0.81577E+03 0.11011E+02 0.55621E-03 -0.37665E+02 1438 0.81531E+03 0.10909E+02 0.55466E-03 -0.36937E+02 1439 0.81481E+03 0.10811E+02 0.55312E-03 -0.36206E+02 1440 0.81424E+03 0.10715E+02 0.55159E-03 -0.35472E+02 1441 0.81363E+03 0.10624E+02 0.55006E-03 -0.34736E+02 1442 0.81296E+03 0.10535E+02 0.54855E-03 -0.33997E+02 1443 0.81223E+03 0.10450E+02 0.54704E-03 -0.33255E+02 1444 0.81145E+03 0.10369E+02 0.54554E-03 -0.32512E+02 1445 0.81061E+03 0.10291E+02 0.54406E-03 -0.31768E+02 1446 0.80971E+03 0.10216E+02 0.54258E-03 -0.31022E+02 1447 0.80876E+03 0.10146E+02 0.54111E-03 -0.30276E+02 1448 0.80775E+03 0.10079E+02 0.53965E-03 -0.29528E+02 1449 0.80668E+03 0.10015E+02 0.53820E-03 -0.28780E+02 1450 0.80555E+03 0.99557E+01 0.53677E-03 -0.28032E+02 1451 0.80437E+03 0.98999E+01 0.53534E-03 -0.27285E+02 1452 0.80313E+03 0.98478E+01 0.53393E-03 -0.26537E+02 1453 0.80183E+03 0.97995E+01 0.53252E-03 -0.25790E+02 1454 0.80047E+03 0.97549E+01 0.53113E-03 -0.25044E+02 1455 0.79906E+03 0.97139E+01 0.52974E-03 -0.24299E+02 1456 0.79759E+03 0.96766E+01 0.52837E-03 -0.23556E+02 1457 0.79607E+03 0.96429E+01 0.52701E-03 -0.22813E+02 1458 0.79449E+03 0.96128E+01 0.52565E-03 -0.22073E+02 1459 0.79286E+03 0.95862E+01 0.52430E-03 -0.21335E+02 1460 0.79118E+03 0.95631E+01 0.52297E-03 -0.20598E+02 1461 0.78945E+03 0.95436E+01 0.52164E-03 -0.19865E+02 1462 0.78766E+03 0.95275E+01 0.52032E-03 -0.19133E+02 1463 0.78583E+03 0.95148E+01 0.51901E-03 -0.18405E+02 1464 0.78394E+03 0.95055E+01 0.51771E-03 -0.17680E+02 1465 0.78201E+03 0.94996E+01 0.51641E-03 -0.16959E+02 1466 0.78002E+03 0.94970E+01 0.51513E-03 -0.16241E+02 1467 0.77799E+03 0.94978E+01 0.51385E-03 -0.15526E+02 1468 0.77592E+03 0.95018E+01 0.51257E-03 -0.14816E+02 1469 0.77379E+03 0.95091E+01 0.51131E-03 -0.14110E+02 1470 0.77162E+03 0.95196E+01 0.51005E-03 -0.13409E+02 1471 0.76941E+03 0.95333E+01 0.50880E-03 -0.12712E+02 1472 0.76715E+03 0.95502E+01 0.50755E-03 -0.12021E+02 1473 0.76484E+03 0.95702E+01 0.50632E-03 -0.11334E+02 1474 0.76250E+03 0.95933E+01 0.50508E-03 -0.10654E+02 1475 0.76011E+03 0.96195E+01 0.50385E-03 -0.99783E+01 1476 0.75768E+03 0.96487E+01 0.50263E-03 -0.93090E+01 1477 0.75520E+03 0.96809E+01 0.50142E-03 -0.86459E+01 1478 0.75269E+03 0.97161E+01 0.50020E-03 -0.79891E+01 1479 0.75014E+03 0.97543E+01 0.49900E-03 -0.73390E+01 1480 0.74755E+03 0.97954E+01 0.49780E-03 -0.66957E+01 1481 0.74492E+03 0.98393E+01 0.49660E-03 -0.60594E+01 1482 0.74225E+03 0.98862E+01 0.49540E-03 -0.54305E+01 1483 0.73954E+03 0.99358E+01 0.49422E-03 -0.48091E+01 1484 0.73680E+03 0.99883E+01 0.49303E-03 -0.41955E+01 1485 0.73402E+03 0.10044E+02 0.49185E-03 -0.35899E+01 1486 0.73121E+03 0.10102E+02 0.49067E-03 -0.29925E+01 1487 0.72836E+03 0.10162E+02 0.48949E-03 -0.24035E+01 1488 0.72548E+03 0.10226E+02 0.48832E-03 -0.18233E+01 1489 0.72257E+03 0.10292E+02 0.48715E-03 -0.12520E+01 1490 0.71962E+03 0.10360E+02 0.48598E-03 -0.68983E+00 1491 0.71665E+03 0.10432E+02 0.48482E-03 -0.13707E+00 1492 0.71364E+03 0.10505E+02 0.48365E-03 0.40608E+00 1493 0.71060E+03 0.10582E+02 0.48249E-03 0.93937E+00 1494 0.70753E+03 0.10661E+02 0.48133E-03 0.14626E+01 1495 0.70443E+03 0.10742E+02 0.48017E-03 0.19755E+01 1496 0.70130E+03 0.10826E+02 0.47901E-03 0.24778E+01 1497 0.69815E+03 0.10912E+02 0.47786E-03 0.29694E+01 1498 0.69497E+03 0.11001E+02 0.47670E-03 0.34500E+01 1499 0.69176E+03 0.11092E+02 0.47554E-03 0.39193E+01 1500 0.68853E+03 0.11185E+02 0.47439E-03 0.43772E+01 1501 0.68523E+03 0.11280E+02 0.00000E+00 0.48198E+01 1502 0.68195E+03 0.11377E+02 0.00000E+00 0.52543E+01 1503 0.67864E+03 0.11477E+02 0.00000E+00 0.56771E+01 1504 0.67532E+03 0.11579E+02 0.00000E+00 0.60882E+01 1505 0.67197E+03 0.11684E+02 0.00000E+00 0.64877E+01 1506 0.66860E+03 0.11790E+02 0.00000E+00 0.68754E+01 1507 0.66521E+03 0.11898E+02 0.00000E+00 0.72515E+01 1508 0.66180E+03 0.12007E+02 0.00000E+00 0.76159E+01 1509 0.65838E+03 0.12119E+02 0.00000E+00 0.79686E+01 1510 0.65494E+03 0.12232E+02 0.00000E+00 0.83097E+01 1511 0.65148E+03 0.12347E+02 0.00000E+00 0.86390E+01 1512 0.64801E+03 0.12464E+02 0.00000E+00 0.89567E+01 1513 0.64453E+03 0.12582E+02 0.00000E+00 0.92628E+01 1514 0.64103E+03 0.12701E+02 0.00000E+00 0.95571E+01 1515 0.63752E+03 0.12822E+02 0.00000E+00 0.98399E+01 1516 0.63401E+03 0.12944E+02 0.00000E+00 0.10111E+02 1517 0.63048E+03 0.13067E+02 0.00000E+00 0.10370E+02 1518 0.62694E+03 0.13192E+02 0.00000E+00 0.10618E+02 1519 0.62340E+03 0.13318E+02 0.00000E+00 0.10854E+02 1520 0.61985E+03 0.13444E+02 0.00000E+00 0.11079E+02 1521 0.61629E+03 0.13572E+02 0.00000E+00 0.11292E+02 1522 0.61273E+03 0.13701E+02 0.00000E+00 0.11493E+02 1523 0.60916E+03 0.13830E+02 0.00000E+00 0.11682E+02 1524 0.60560E+03 0.13961E+02 0.00000E+00 0.11860E+02 1525 0.60203E+03 0.14092E+02 0.00000E+00 0.12027E+02 1526 0.59846E+03 0.14224E+02 0.00000E+00 0.12181E+02 1527 0.59488E+03 0.14356E+02 0.00000E+00 0.12324E+02 1528 0.59132E+03 0.14489E+02 0.00000E+00 0.12456E+02 1529 0.58775E+03 0.14622E+02 0.00000E+00 0.12576E+02 1530 0.58418E+03 0.14756E+02 0.00000E+00 0.12684E+02 1531 0.58062E+03 0.14890E+02 0.00000E+00 0.12780E+02 1532 0.57707E+03 0.15024E+02 0.00000E+00 0.12865E+02 1533 0.57352E+03 0.15159E+02 0.00000E+00 0.12939E+02 1534 0.56998E+03 0.15293E+02 0.00000E+00 0.13001E+02 1535 0.56644E+03 0.15428E+02 0.00000E+00 0.13051E+02 1536 0.56291E+03 0.15563E+02 0.00000E+00 0.13089E+02 1537 0.55940E+03 0.15698E+02 0.00000E+00 0.13116E+02 1538 0.55589E+03 0.15832E+02 0.00000E+00 0.13132E+02 1539 0.55240E+03 0.15967E+02 0.00000E+00 0.13136E+02 1540 0.54892E+03 0.16101E+02 0.00000E+00 0.13128E+02 1541 0.54545E+03 0.16235E+02 0.00000E+00 0.13109E+02 1542 0.54200E+03 0.16368E+02 0.00000E+00 0.13078E+02 1543 0.53856E+03 0.16501E+02 0.00000E+00 0.13036E+02 1544 0.53514E+03 0.16634E+02 0.00000E+00 0.12982E+02 1545 0.53173E+03 0.16765E+02 0.00000E+00 0.12916E+02 1546 0.52835E+03 0.16897E+02 0.00000E+00 0.12839E+02 1547 0.52498E+03 0.17027E+02 0.00000E+00 0.12750E+02 1548 0.52164E+03 0.17157E+02 0.00000E+00 0.12650E+02 1549 0.51831E+03 0.17286E+02 0.00000E+00 0.12538E+02 1550 0.51501E+03 0.17414E+02 0.00000E+00 0.12415E+02 1551 0.51173E+03 0.17541E+02 0.00000E+00 0.12280E+02 1552 0.50848E+03 0.17667E+02 0.00000E+00 0.12134E+02 1553 0.50525E+03 0.17792E+02 0.00000E+00 0.11976E+02 1554 0.50204E+03 0.17916E+02 0.00000E+00 0.11808E+02 1555 0.49886E+03 0.18039E+02 0.00000E+00 0.11629E+02 1556 0.49571E+03 0.18161E+02 0.00000E+00 0.11439E+02 1557 0.49258E+03 0.18281E+02 0.00000E+00 0.11239E+02 1558 0.48947E+03 0.18401E+02 0.00000E+00 0.11029E+02 1559 0.48640E+03 0.18519E+02 0.00000E+00 0.10808E+02 1560 0.48335E+03 0.18635E+02 0.00000E+00 0.10578E+02 1561 0.48032E+03 0.18750E+02 0.00000E+00 0.10338E+02 1562 0.47733E+03 0.18864E+02 0.00000E+00 0.10089E+02 1563 0.47436E+03 0.18977E+02 0.00000E+00 0.98308E+01 1564 0.47142E+03 0.19088E+02 0.00000E+00 0.95632E+01 1565 0.46852E+03 0.19197E+02 0.00000E+00 0.92868E+01 1566 0.46564E+03 0.19305E+02 0.00000E+00 0.90017E+01 1567 0.46279E+03 0.19411E+02 0.00000E+00 0.87081E+01 1568 0.45997E+03 0.19516E+02 0.00000E+00 0.84063E+01 1569 0.45718E+03 0.19619E+02 0.00000E+00 0.80963E+01 1570 0.45442E+03 0.19721E+02 0.00000E+00 0.77784E+01 1571 0.45169E+03 0.19820E+02 0.00000E+00 0.74528E+01 1572 0.44900E+03 0.19918E+02 0.00000E+00 0.71197E+01 1573 0.44633E+03 0.20014E+02 0.00000E+00 0.67792E+01 1574 0.44370E+03 0.20108E+02 0.00000E+00 0.64316E+01 1575 0.44111E+03 0.20200E+02 0.00000E+00 0.60770E+01 1576 0.43854E+03 0.20290E+02 0.00000E+00 0.57156E+01 1577 0.43602E+03 0.20379E+02 0.00000E+00 0.53477E+01 1578 0.43352E+03 0.20465E+02 0.00000E+00 0.49734E+01 1579 0.43106E+03 0.20549E+02 0.00000E+00 0.45929E+01 1580 0.42863E+03 0.20631E+02 0.00000E+00 0.42064E+01 1581 0.42624E+03 0.20711E+02 0.00000E+00 0.38141E+01 1582 0.42389E+03 0.20789E+02 0.00000E+00 0.34161E+01 1583 0.42157E+03 0.20865E+02 0.00000E+00 0.30128E+01 1584 0.41929E+03 0.20938E+02 0.00000E+00 0.26042E+01 1585 0.41705E+03 0.21009E+02 0.00000E+00 0.21905E+01 1586 0.41484E+03 0.21078E+02 0.00000E+00 0.17720E+01 1587 0.41267E+03 0.21144E+02 0.00000E+00 0.13489E+01 1588 0.41055E+03 0.21208E+02 0.00000E+00 0.92125E+00 1589 0.40845E+03 0.21269E+02 0.00000E+00 0.48934E+00 1590 0.40640E+03 0.21328E+02 0.00000E+00 0.53339E-01 1591 0.40439E+03 0.21385E+02 0.00000E+00 -0.38656E+00 1592 0.40242E+03 0.21439E+02 0.00000E+00 -0.83017E+00 1593 0.40049E+03 0.21490E+02 0.00000E+00 -0.12773E+01 1594 0.39860E+03 0.21539E+02 0.00000E+00 -0.17277E+01 1595 0.39675E+03 0.21585E+02 0.00000E+00 -0.21813E+01 1596 0.39494E+03 0.21628E+02 0.00000E+00 -0.26379E+01 1597 0.39317E+03 0.21669E+02 0.00000E+00 -0.30971E+01 1598 0.39145E+03 0.21706E+02 0.00000E+00 -0.35590E+01 1599 0.38977E+03 0.21741E+02 0.00000E+00 -0.40232E+01 1600 0.38813E+03 0.21773E+02 0.00000E+00 -0.44896E+01 1601 0.38653E+03 0.21802E+02 0.00000E+00 -0.49579E+01 1602 0.38498E+03 0.21828E+02 0.00000E+00 -0.54281E+01 1603 0.38348E+03 0.21852E+02 0.00000E+00 -0.58999E+01 1604 0.38201E+03 0.21872E+02 0.00000E+00 -0.63731E+01 1605 0.38059E+03 0.21890E+02 0.00000E+00 -0.68476E+01 1606 0.37921E+03 0.21905E+02 0.00000E+00 -0.73232E+01 1607 0.37787E+03 0.21917E+02 0.00000E+00 -0.77997E+01 1608 0.37657E+03 0.21926E+02 0.00000E+00 -0.82768E+01 1609 0.37531E+03 0.21932E+02 0.00000E+00 -0.87545E+01 1610 0.37409E+03 0.21936E+02 0.00000E+00 -0.92325E+01 1611 0.37292E+03 0.21937E+02 0.00000E+00 -0.97107E+01 1612 0.37178E+03 0.21935E+02 0.00000E+00 -0.10189E+02 1613 0.37068E+03 0.21930E+02 0.00000E+00 -0.10667E+02 1614 0.36962E+03 0.21923E+02 0.00000E+00 -0.11144E+02 1615 0.36860E+03 0.21913E+02 0.00000E+00 -0.11621E+02 1616 0.36762E+03 0.21900E+02 0.00000E+00 -0.12097E+02 1617 0.36667E+03 0.21885E+02 0.00000E+00 -0.12573E+02 1618 0.36577E+03 0.21867E+02 0.00000E+00 -0.13047E+02 1619 0.36490E+03 0.21846E+02 0.00000E+00 -0.13520E+02 1620 0.36406E+03 0.21823E+02 0.00000E+00 -0.13991E+02 1621 0.36327E+03 0.21798E+02 0.00000E+00 -0.14461E+02 1622 0.36251E+03 0.21769E+02 0.00000E+00 -0.14928E+02 1623 0.36178E+03 0.21738E+02 0.00000E+00 -0.15394E+02 1624 0.36109E+03 0.21705E+02 0.00000E+00 -0.15858E+02 1625 0.36044E+03 0.21669E+02 0.00000E+00 -0.16319E+02 1626 0.35982E+03 0.21631E+02 0.00000E+00 -0.16777E+02 1627 0.35923E+03 0.21590E+02 0.00000E+00 -0.17233E+02 1628 0.35868E+03 0.21546E+02 0.00000E+00 -0.17686E+02 1629 0.35816E+03 0.21501E+02 0.00000E+00 -0.18135E+02 1630 0.35768E+03 0.21452E+02 0.00000E+00 -0.18582E+02 1631 0.35723E+03 0.21402E+02 0.00000E+00 -0.19025E+02 1632 0.35681E+03 0.21348E+02 0.00000E+00 -0.19464E+02 1633 0.35642E+03 0.21293E+02 0.00000E+00 -0.19899E+02 1634 0.35607E+03 0.21235E+02 0.00000E+00 -0.20330E+02 1635 0.35574E+03 0.21175E+02 0.00000E+00 -0.20757E+02 1636 0.35545E+03 0.21112E+02 0.00000E+00 -0.21180E+02 1637 0.35519E+03 0.21047E+02 0.00000E+00 -0.21598E+02 1638 0.35496E+03 0.20980E+02 0.00000E+00 -0.22011E+02 1639 0.35475E+03 0.20911E+02 0.00000E+00 -0.22419E+02 1640 0.35458E+03 0.20839E+02 0.00000E+00 -0.22822E+02 1641 0.35444E+03 0.20765E+02 0.00000E+00 -0.23219E+02 1642 0.35433E+03 0.20689E+02 0.00000E+00 -0.23612E+02 1643 0.35424E+03 0.20610E+02 0.00000E+00 -0.23998E+02 1644 0.35418E+03 0.20529E+02 0.00000E+00 -0.24379E+02 1645 0.35415E+03 0.20447E+02 0.00000E+00 -0.24753E+02 1646 0.35415E+03 0.20361E+02 0.00000E+00 -0.25121E+02 1647 0.35418E+03 0.20274E+02 0.00000E+00 -0.25483E+02 1648 0.35423E+03 0.20185E+02 0.00000E+00 -0.25838E+02 1649 0.35431E+03 0.20093E+02 0.00000E+00 -0.26187E+02 1650 0.35441E+03 0.20000E+02 0.00000E+00 -0.26528E+02 1651 0.35454E+03 0.19904E+02 0.00000E+00 -0.26862E+02 1652 0.35470E+03 0.19806E+02 0.00000E+00 -0.27189E+02 1653 0.35488E+03 0.19706E+02 0.00000E+00 -0.27509E+02 1654 0.35508E+03 0.19605E+02 0.00000E+00 -0.27822E+02 1655 0.35531E+03 0.19501E+02 0.00000E+00 -0.28127E+02 1656 0.35555E+03 0.19396E+02 0.00000E+00 -0.28425E+02 1657 0.35582E+03 0.19288E+02 0.00000E+00 -0.28715E+02 1658 0.35612E+03 0.19179E+02 0.00000E+00 -0.28999E+02 1659 0.35643E+03 0.19069E+02 0.00000E+00 -0.29275E+02 1660 0.35676E+03 0.18956E+02 0.00000E+00 -0.29543E+02 1661 0.35711E+03 0.18842E+02 0.00000E+00 -0.29805E+02 1662 0.35748E+03 0.18727E+02 0.00000E+00 -0.30058E+02 1663 0.35787E+03 0.18610E+02 0.00000E+00 -0.30305E+02 1664 0.35827E+03 0.18491E+02 0.00000E+00 -0.30543E+02 1665 0.35869E+03 0.18371E+02 0.00000E+00 -0.30775E+02 1666 0.35913E+03 0.18250E+02 0.00000E+00 -0.30998E+02 1667 0.35958E+03 0.18127E+02 0.00000E+00 -0.31214E+02 1668 0.36005E+03 0.18003E+02 0.00000E+00 -0.31423E+02 1669 0.36053E+03 0.17878E+02 0.00000E+00 -0.31624E+02 1670 0.36102E+03 0.17752E+02 0.00000E+00 -0.31817E+02 1671 0.36153E+03 0.17624E+02 0.00000E+00 -0.32003E+02 1672 0.36205E+03 0.17496E+02 0.00000E+00 -0.32181E+02 1673 0.36258E+03 0.17366E+02 0.00000E+00 -0.32351E+02 1674 0.36312E+03 0.17236E+02 0.00000E+00 -0.32514E+02 1675 0.36367E+03 0.17105E+02 0.00000E+00 -0.32669E+02 1676 0.36423E+03 0.16972E+02 0.00000E+00 -0.32816E+02 1677 0.36479E+03 0.16839E+02 0.00000E+00 -0.32955E+02 1678 0.36537E+03 0.16705E+02 0.00000E+00 -0.33086E+02 1679 0.36595E+03 0.16571E+02 0.00000E+00 -0.33210E+02 1680 0.36654E+03 0.16435E+02 0.00000E+00 -0.33326E+02 1681 0.36714E+03 0.16299E+02 0.00000E+00 -0.33433E+02 1682 0.36774E+03 0.16163E+02 0.00000E+00 -0.33533E+02 1683 0.36835E+03 0.16026E+02 0.00000E+00 -0.33625E+02 1684 0.36896E+03 0.15888E+02 0.00000E+00 -0.33709E+02 1685 0.36957E+03 0.15750E+02 0.00000E+00 -0.33785E+02 1686 0.37019E+03 0.15612E+02 0.00000E+00 -0.33853E+02 1687 0.37081E+03 0.15473E+02 0.00000E+00 -0.33913E+02 1688 0.37143E+03 0.15334E+02 0.00000E+00 -0.33965E+02 1689 0.37205E+03 0.15195E+02 0.00000E+00 -0.34008E+02 1690 0.37267E+03 0.15055E+02 0.00000E+00 -0.34044E+02 1691 0.37329E+03 0.14916E+02 0.00000E+00 -0.34071E+02 1692 0.37391E+03 0.14776E+02 0.00000E+00 -0.34091E+02 1693 0.37453E+03 0.14636E+02 0.00000E+00 -0.34102E+02 1694 0.37514E+03 0.14496E+02 0.00000E+00 -0.34105E+02 1695 0.37576E+03 0.14357E+02 0.00000E+00 -0.34099E+02 1696 0.37636E+03 0.14217E+02 0.00000E+00 -0.34086E+02 1697 0.37697E+03 0.14078E+02 0.00000E+00 -0.34064E+02 1698 0.37757E+03 0.13938E+02 0.00000E+00 -0.34033E+02 1699 0.37816E+03 0.13799E+02 0.00000E+00 -0.33995E+02 1700 0.37875E+03 0.13660E+02 0.00000E+00 -0.33948E+02 1701 0.37933E+03 0.13522E+02 0.00000E+00 -0.33893E+02 1702 0.37990E+03 0.13384E+02 0.00000E+00 -0.33829E+02 1703 0.38047E+03 0.13246E+02 0.00000E+00 -0.33757E+02 1704 0.38102E+03 0.13109E+02 0.00000E+00 -0.33677E+02 1705 0.38157E+03 0.12972E+02 0.00000E+00 -0.33590E+02 1706 0.38211E+03 0.12836E+02 0.00000E+00 -0.33494E+02 1707 0.38264E+03 0.12701E+02 0.00000E+00 -0.33391E+02 1708 0.38316E+03 0.12566E+02 0.00000E+00 -0.33281E+02 1709 0.38368E+03 0.12431E+02 0.00000E+00 -0.33163E+02 1710 0.38418E+03 0.12297E+02 0.00000E+00 -0.33037E+02 1711 0.38467E+03 0.12164E+02 0.00000E+00 -0.32905E+02 1712 0.38515E+03 0.12032E+02 0.00000E+00 -0.32765E+02 1713 0.38562E+03 0.11900E+02 0.00000E+00 -0.32619E+02 1714 0.38608E+03 0.11769E+02 0.00000E+00 -0.32466E+02 1715 0.38652E+03 0.11639E+02 0.00000E+00 -0.32306E+02 1716 0.38695E+03 0.11510E+02 0.00000E+00 -0.32139E+02 1717 0.38738E+03 0.11382E+02 0.00000E+00 -0.31966E+02 1718 0.38778E+03 0.11254E+02 0.00000E+00 -0.31787E+02 1719 0.38818E+03 0.11128E+02 0.00000E+00 -0.31601E+02 1720 0.38856E+03 0.11003E+02 0.00000E+00 -0.31410E+02 1721 0.38893E+03 0.10878E+02 0.00000E+00 -0.31212E+02 1722 0.38928E+03 0.10755E+02 0.00000E+00 -0.31009E+02 1723 0.38962E+03 0.10633E+02 0.00000E+00 -0.30800E+02 1724 0.38995E+03 0.10512E+02 0.00000E+00 -0.30585E+02 1725 0.39026E+03 0.10392E+02 0.00000E+00 -0.30365E+02 1726 0.39055E+03 0.10273E+02 0.00000E+00 -0.30140E+02 1727 0.39083E+03 0.10156E+02 0.00000E+00 -0.29909E+02 1728 0.39109E+03 0.10040E+02 0.00000E+00 -0.29673E+02 1729 0.39133E+03 0.99247E+01 0.00000E+00 -0.29433E+02 1730 0.39156E+03 0.98112E+01 0.00000E+00 -0.29187E+02 1731 0.39177E+03 0.96991E+01 0.00000E+00 -0.28937E+02 1732 0.39197E+03 0.95883E+01 0.00000E+00 -0.28682E+02 1733 0.39214E+03 0.94791E+01 0.00000E+00 -0.28422E+02 1734 0.39230E+03 0.93713E+01 0.00000E+00 -0.28158E+02 1735 0.39244E+03 0.92650E+01 0.00000E+00 -0.27890E+02 1736 0.39256E+03 0.91603E+01 0.00000E+00 -0.27618E+02 1737 0.39266E+03 0.90571E+01 0.00000E+00 -0.27342E+02 1738 0.39274E+03 0.89556E+01 0.00000E+00 -0.27062E+02 1739 0.39280E+03 0.88558E+01 0.00000E+00 -0.26778E+02 1740 0.39284E+03 0.87576E+01 0.00000E+00 -0.26490E+02 1741 0.39286E+03 0.86611E+01 0.00000E+00 -0.26199E+02 1742 0.39285E+03 0.85665E+01 0.00000E+00 -0.25905E+02 1743 0.39283E+03 0.84736E+01 0.00000E+00 -0.25607E+02 1744 0.39279E+03 0.83825E+01 0.00000E+00 -0.25306E+02 1745 0.39272E+03 0.82933E+01 0.00000E+00 -0.25002E+02 1746 0.39263E+03 0.82060E+01 0.00000E+00 -0.24696E+02 1747 0.39252E+03 0.81206E+01 0.00000E+00 -0.24386E+02 1748 0.39239E+03 0.80372E+01 0.00000E+00 -0.24074E+02 1749 0.39223E+03 0.79558E+01 0.00000E+00 -0.23759E+02 1750 0.39205E+03 0.78764E+01 0.00000E+00 -0.23442E+02 1751 0.39184E+03 0.77991E+01 0.00000E+00 -0.23122E+02 1752 0.39161E+03 0.77239E+01 0.00000E+00 -0.22800E+02 1753 0.39136E+03 0.76507E+01 0.00000E+00 -0.22477E+02 1754 0.39108E+03 0.75796E+01 0.00000E+00 -0.22151E+02 1755 0.39078E+03 0.75105E+01 0.00000E+00 -0.21824E+02 1756 0.39046E+03 0.74435E+01 0.00000E+00 -0.21495E+02 1757 0.39011E+03 0.73785E+01 0.00000E+00 -0.21164E+02 1758 0.38974E+03 0.73155E+01 0.00000E+00 -0.20832E+02 1759 0.38935E+03 0.72546E+01 0.00000E+00 -0.20499E+02 1760 0.38893E+03 0.71956E+01 0.00000E+00 -0.20165E+02 1761 0.38850E+03 0.71387E+01 0.00000E+00 -0.19830E+02 1762 0.38804E+03 0.70838E+01 0.00000E+00 -0.19494E+02 1763 0.38756E+03 0.70309E+01 0.00000E+00 -0.19157E+02 1764 0.38705E+03 0.69800E+01 0.00000E+00 -0.18820E+02 1765 0.38653E+03 0.69311E+01 0.00000E+00 -0.18482E+02 1766 0.38599E+03 0.68841E+01 0.00000E+00 -0.18144E+02 1767 0.38542E+03 0.68392E+01 0.00000E+00 -0.17806E+02 1768 0.38483E+03 0.67962E+01 0.00000E+00 -0.17468E+02 1769 0.38422E+03 0.67552E+01 0.00000E+00 -0.17130E+02 1770 0.38359E+03 0.67161E+01 0.00000E+00 -0.16793E+02 1771 0.38294E+03 0.66790E+01 0.00000E+00 -0.16456E+02 1772 0.38228E+03 0.66439E+01 0.00000E+00 -0.16119E+02 1773 0.38159E+03 0.66106E+01 0.00000E+00 -0.15783E+02 1774 0.38088E+03 0.65794E+01 0.00000E+00 -0.15448E+02 1775 0.38015E+03 0.65500E+01 0.00000E+00 -0.15114E+02 1776 0.37940E+03 0.65226E+01 0.00000E+00 -0.14780E+02 1777 0.37863E+03 0.64971E+01 0.00000E+00 -0.14449E+02 1778 0.37784E+03 0.64735E+01 0.00000E+00 -0.14118E+02 1779 0.37704E+03 0.64519E+01 0.00000E+00 -0.13789E+02 1780 0.37621E+03 0.64321E+01 0.00000E+00 -0.13461E+02 1781 0.37537E+03 0.64142E+01 0.00000E+00 -0.13136E+02 1782 0.37450E+03 0.63982E+01 0.00000E+00 -0.12812E+02 1783 0.37362E+03 0.63841E+01 0.00000E+00 -0.12490E+02 1784 0.37273E+03 0.63719E+01 0.00000E+00 -0.12171E+02 1785 0.37181E+03 0.63616E+01 0.00000E+00 -0.11853E+02 1786 0.37087E+03 0.63531E+01 0.00000E+00 -0.11538E+02 1787 0.36992E+03 0.63465E+01 0.00000E+00 -0.11226E+02 1788 0.36895E+03 0.63417E+01 0.00000E+00 -0.10917E+02 1789 0.36797E+03 0.63388E+01 0.00000E+00 -0.10610E+02 1790 0.36696E+03 0.63378E+01 0.00000E+00 -0.10306E+02 1791 0.36594E+03 0.63385E+01 0.00000E+00 -0.10005E+02 1792 0.36491E+03 0.63412E+01 0.00000E+00 -0.97080E+01 1793 0.36385E+03 0.63456E+01 0.00000E+00 -0.94140E+01 1794 0.36278E+03 0.63518E+01 0.00000E+00 -0.91236E+01 1795 0.36170E+03 0.63599E+01 0.00000E+00 -0.88367E+01 1796 0.36060E+03 0.63698E+01 0.00000E+00 -0.85537E+01 1797 0.35948E+03 0.63815E+01 0.00000E+00 -0.82746E+01 1798 0.35835E+03 0.63950E+01 0.00000E+00 -0.79996E+01 1799 0.35720E+03 0.64103E+01 0.00000E+00 -0.77287E+01 1800 0.35603E+03 0.64273E+01 0.00000E+00 -0.74622E+01 1801 0.35486E+03 0.64462E+01 0.00000E+00 -0.72002E+01 1802 0.35366E+03 0.64668E+01 0.00000E+00 -0.69426E+01 1803 0.35246E+03 0.64891E+01 0.00000E+00 -0.66896E+01 1804 0.35123E+03 0.65131E+01 0.00000E+00 -0.64411E+01 1805 0.35000E+03 0.65387E+01 0.00000E+00 -0.61972E+01 1806 0.34875E+03 0.65659E+01 0.00000E+00 -0.59580E+01 1807 0.34749E+03 0.65948E+01 0.00000E+00 -0.57233E+01 1808 0.34622E+03 0.66251E+01 0.00000E+00 -0.54934E+01 1809 0.34494E+03 0.66570E+01 0.00000E+00 -0.52681E+01 1810 0.34364E+03 0.66903E+01 0.00000E+00 -0.50476E+01 1811 0.34234E+03 0.67251E+01 0.00000E+00 -0.48318E+01 1812 0.34102E+03 0.67613E+01 0.00000E+00 -0.46208E+01 1813 0.33970E+03 0.67989E+01 0.00000E+00 -0.44146E+01 1814 0.33836E+03 0.68378E+01 0.00000E+00 -0.42133E+01 1815 0.33702E+03 0.68780E+01 0.00000E+00 -0.40168E+01 1816 0.33567E+03 0.69195E+01 0.00000E+00 -0.38252E+01 1817 0.33430E+03 0.69623E+01 0.00000E+00 -0.36385E+01 1818 0.33293E+03 0.70062E+01 0.00000E+00 -0.34568E+01 1819 0.33156E+03 0.70513E+01 0.00000E+00 -0.32801E+01 1820 0.33017E+03 0.70976E+01 0.00000E+00 -0.31084E+01 1821 0.32878E+03 0.71449E+01 0.00000E+00 -0.29418E+01 1822 0.32739E+03 0.71933E+01 0.00000E+00 -0.27801E+01 1823 0.32599E+03 0.72428E+01 0.00000E+00 -0.26236E+01 1824 0.32458E+03 0.72933E+01 0.00000E+00 -0.24723E+01 1825 0.32317E+03 0.73447E+01 0.00000E+00 -0.23260E+01 1826 0.32175E+03 0.73970E+01 0.00000E+00 -0.21850E+01 1827 0.32033E+03 0.74503E+01 0.00000E+00 -0.20492E+01 1828 0.31891E+03 0.75044E+01 0.00000E+00 -0.19186E+01 1829 0.31748E+03 0.75594E+01 0.00000E+00 -0.17932E+01 1830 0.31605E+03 0.76152E+01 0.00000E+00 -0.16732E+01 1831 0.31461E+03 0.76717E+01 0.00000E+00 -0.15585E+01 1832 0.31318E+03 0.77289E+01 0.00000E+00 -0.14491E+01 1833 0.31174E+03 0.77869E+01 0.00000E+00 -0.13451E+01 1834 0.31031E+03 0.78455E+01 0.00000E+00 -0.12466E+01 1835 0.30887E+03 0.79047E+01 0.00000E+00 -0.11534E+01 1836 0.30743E+03 0.79646E+01 0.00000E+00 -0.10658E+01 1837 0.30599E+03 0.80250E+01 0.00000E+00 -0.98360E+00 1838 0.30455E+03 0.80859E+01 0.00000E+00 -0.90695E+00 1839 0.30312E+03 0.81473E+01 0.00000E+00 -0.83585E+00 1840 0.30168E+03 0.82092E+01 0.00000E+00 -0.77033E+00 1841 0.30025E+03 0.82715E+01 0.00000E+00 -0.71042E+00 1842 0.29882E+03 0.83342E+01 0.00000E+00 -0.65615E+00 1843 0.29739E+03 0.83972E+01 0.00000E+00 -0.60754E+00 1844 0.29597E+03 0.84606E+01 0.00000E+00 -0.56462E+00 1845 0.29454E+03 0.85243E+01 0.00000E+00 -0.52743E+00 1846 0.29313E+03 0.85882E+01 0.00000E+00 -0.49599E+00 1847 0.29171E+03 0.86524E+01 0.00000E+00 -0.47032E+00 1848 0.29030E+03 0.87167E+01 0.00000E+00 -0.45047E+00 1849 0.28890E+03 0.87812E+01 0.00000E+00 -0.43645E+00 1850 0.28750E+03 0.88458E+01 0.00000E+00 -0.42829E+00 1851 0.28611E+03 0.89105E+01 0.00000E+00 -0.42601E+00 1852 0.28473E+03 0.89753E+01 0.00000E+00 -0.42955E+00 1853 0.28335E+03 0.90401E+01 0.00000E+00 -0.43885E+00 1854 0.28198E+03 0.91049E+01 0.00000E+00 -0.45382E+00 1855 0.28061E+03 0.91696E+01 0.00000E+00 -0.47441E+00 1856 0.27925E+03 0.92343E+01 0.00000E+00 -0.50055E+00 1857 0.27790E+03 0.92990E+01 0.00000E+00 -0.53215E+00 1858 0.27656E+03 0.93635E+01 0.00000E+00 -0.56916E+00 1859 0.27523E+03 0.94279E+01 0.00000E+00 -0.61150E+00 1860 0.27390E+03 0.94921E+01 0.00000E+00 -0.65910E+00 1861 0.27258E+03 0.95562E+01 0.00000E+00 -0.71190E+00 1862 0.27127E+03 0.96200E+01 0.00000E+00 -0.76982E+00 1863 0.26997E+03 0.96836E+01 0.00000E+00 -0.83279E+00 1864 0.26868E+03 0.97469E+01 0.00000E+00 -0.90075E+00 1865 0.26740E+03 0.98099E+01 0.00000E+00 -0.97361E+00 1866 0.26613E+03 0.98726E+01 0.00000E+00 -0.10513E+01 1867 0.26487E+03 0.99349E+01 0.00000E+00 -0.11338E+01 1868 0.26362E+03 0.99969E+01 0.00000E+00 -0.12210E+01 1869 0.26238E+03 0.10058E+02 0.00000E+00 -0.13128E+01 1870 0.26115E+03 0.10119E+02 0.00000E+00 -0.14092E+01 1871 0.25993E+03 0.10180E+02 0.00000E+00 -0.15101E+01 1872 0.25872E+03 0.10240E+02 0.00000E+00 -0.16154E+01 1873 0.25753E+03 0.10300E+02 0.00000E+00 -0.17250E+01 1874 0.25634E+03 0.10359E+02 0.00000E+00 -0.18390E+01 1875 0.25517E+03 0.10417E+02 0.00000E+00 -0.19571E+01 1876 0.25401E+03 0.10475E+02 0.00000E+00 -0.20794E+01 1877 0.25286E+03 0.10532E+02 0.00000E+00 -0.22058E+01 1878 0.25173E+03 0.10589E+02 0.00000E+00 -0.23361E+01 1879 0.25061E+03 0.10645E+02 0.00000E+00 -0.24704E+01 1880 0.24950E+03 0.10700E+02 0.00000E+00 -0.26086E+01 1881 0.24840E+03 0.10754E+02 0.00000E+00 -0.27506E+01 1882 0.24732E+03 0.10808E+02 0.00000E+00 -0.28962E+01 1883 0.24625E+03 0.10861E+02 0.00000E+00 -0.30456E+01 1884 0.24520E+03 0.10913E+02 0.00000E+00 -0.31985E+01 1885 0.24416E+03 0.10964E+02 0.00000E+00 -0.33549E+01 1886 0.24314E+03 0.11014E+02 0.00000E+00 -0.35148E+01 1887 0.24213E+03 0.11064E+02 0.00000E+00 -0.36781E+01 1888 0.24113E+03 0.11112E+02 0.00000E+00 -0.38446E+01 1889 0.24016E+03 0.11160E+02 0.00000E+00 -0.40144E+01 1890 0.23919E+03 0.11206E+02 0.00000E+00 -0.41873E+01 1891 0.23825E+03 0.11252E+02 0.00000E+00 -0.43634E+01 1892 0.23731E+03 0.11296E+02 0.00000E+00 -0.45425E+01 1893 0.23640E+03 0.11339E+02 0.00000E+00 -0.47245E+01 1894 0.23550E+03 0.11382E+02 0.00000E+00 -0.49094E+01 1895 0.23462E+03 0.11423E+02 0.00000E+00 -0.50971E+01 1896 0.23376E+03 0.11463E+02 0.00000E+00 -0.52876E+01 1897 0.23291E+03 0.11501E+02 0.00000E+00 -0.54807E+01 1898 0.23208E+03 0.11539E+02 0.00000E+00 -0.56764E+01 1899 0.23127E+03 0.11575E+02 0.00000E+00 -0.58747E+01 1900 0.23048E+03 0.11610E+02 0.00000E+00 -0.60754E+01 1901 0.22971E+03 0.11644E+02 0.00000E+00 -0.62786E+01 1902 0.22895E+03 0.11676E+02 0.00000E+00 -0.64839E+01 1903 0.22821E+03 0.11707E+02 0.00000E+00 -0.66915E+01 1904 0.22749E+03 0.11737E+02 0.00000E+00 -0.69010E+01 1905 0.22679E+03 0.11766E+02 0.00000E+00 -0.71124E+01 1906 0.22611E+03 0.11793E+02 0.00000E+00 -0.73255E+01 1907 0.22544E+03 0.11819E+02 0.00000E+00 -0.75403E+01 1908 0.22479E+03 0.11843E+02 0.00000E+00 -0.77566E+01 1909 0.22416E+03 0.11867E+02 0.00000E+00 -0.79742E+01 1910 0.22354E+03 0.11889E+02 0.00000E+00 -0.81931E+01 1911 0.22295E+03 0.11909E+02 0.00000E+00 -0.84130E+01 1912 0.22237E+03 0.11929E+02 0.00000E+00 -0.86339E+01 1913 0.22180E+03 0.11947E+02 0.00000E+00 -0.88557E+01 1914 0.22126E+03 0.11963E+02 0.00000E+00 -0.90782E+01 1915 0.22073E+03 0.11979E+02 0.00000E+00 -0.93013E+01 1916 0.22021E+03 0.11993E+02 0.00000E+00 -0.95248E+01 1917 0.21972E+03 0.12005E+02 0.00000E+00 -0.97487E+01 1918 0.21924E+03 0.12017E+02 0.00000E+00 -0.99727E+01 1919 0.21877E+03 0.12027E+02 0.00000E+00 -0.10197E+02 1920 0.21832E+03 0.12035E+02 0.00000E+00 -0.10421E+02 1921 0.21789E+03 0.12043E+02 0.00000E+00 -0.10645E+02 1922 0.21747E+03 0.12049E+02 0.00000E+00 -0.10868E+02 1923 0.21707E+03 0.12053E+02 0.00000E+00 -0.11091E+02 1924 0.21669E+03 0.12057E+02 0.00000E+00 -0.11314E+02 1925 0.21632E+03 0.12059E+02 0.00000E+00 -0.11536E+02 1926 0.21596E+03 0.12059E+02 0.00000E+00 -0.11757E+02 1927 0.21562E+03 0.12059E+02 0.00000E+00 -0.11977E+02 1928 0.21530E+03 0.12057E+02 0.00000E+00 -0.12196E+02 1929 0.21499E+03 0.12053E+02 0.00000E+00 -0.12414E+02 1930 0.21469E+03 0.12049E+02 0.00000E+00 -0.12630E+02 1931 0.21441E+03 0.12043E+02 0.00000E+00 -0.12845E+02 1932 0.21415E+03 0.12035E+02 0.00000E+00 -0.13058E+02 1933 0.21390E+03 0.12026E+02 0.00000E+00 -0.13270E+02 1934 0.21366E+03 0.12016E+02 0.00000E+00 -0.13479E+02 1935 0.21344E+03 0.12005E+02 0.00000E+00 -0.13687E+02 1936 0.21323E+03 0.11992E+02 0.00000E+00 -0.13893E+02 1937 0.21303E+03 0.11978E+02 0.00000E+00 -0.14096E+02 1938 0.21285E+03 0.11962E+02 0.00000E+00 -0.14297E+02 1939 0.21269E+03 0.11945E+02 0.00000E+00 -0.14495E+02 1940 0.21253E+03 0.11927E+02 0.00000E+00 -0.14691E+02 1941 0.21239E+03 0.11907E+02 0.00000E+00 -0.14884E+02 1942 0.21227E+03 0.11886E+02 0.00000E+00 -0.15074E+02 1943 0.21215E+03 0.11864E+02 0.00000E+00 -0.15261E+02 1944 0.21205E+03 0.11840E+02 0.00000E+00 -0.15445E+02 1945 0.21196E+03 0.11815E+02 0.00000E+00 -0.15626E+02 1946 0.21189E+03 0.11788E+02 0.00000E+00 -0.15803E+02 1947 0.21183E+03 0.11760E+02 0.00000E+00 -0.15977E+02 1948 0.21178E+03 0.11731E+02 0.00000E+00 -0.16146E+02 1949 0.21174E+03 0.11700E+02 0.00000E+00 -0.16313E+02 1950 0.21172E+03 0.11668E+02 0.00000E+00 -0.16475E+02 1951 0.21170E+03 0.11634E+02 0.00000E+00 -0.16633E+02 1952 0.21170E+03 0.11600E+02 0.00000E+00 -0.16787E+02 1953 0.21171E+03 0.11563E+02 0.00000E+00 -0.16938E+02 1954 0.21174E+03 0.11526E+02 0.00000E+00 -0.17084E+02 1955 0.21177E+03 0.11487E+02 0.00000E+00 -0.17227E+02 1956 0.21181E+03 0.11447E+02 0.00000E+00 -0.17366E+02 1957 0.21187E+03 0.11406E+02 0.00000E+00 -0.17502E+02 1958 0.21194E+03 0.11363E+02 0.00000E+00 -0.17634E+02 1959 0.21201E+03 0.11320E+02 0.00000E+00 -0.17762E+02 1960 0.21210E+03 0.11275E+02 0.00000E+00 -0.17888E+02 1961 0.21219E+03 0.11229E+02 0.00000E+00 -0.18010E+02 1962 0.21230E+03 0.11182E+02 0.00000E+00 -0.18129E+02 1963 0.21241E+03 0.11134E+02 0.00000E+00 -0.18244E+02 1964 0.21254E+03 0.11085E+02 0.00000E+00 -0.18357E+02 1965 0.21267E+03 0.11035E+02 0.00000E+00 -0.18467E+02 1966 0.21281E+03 0.10984E+02 0.00000E+00 -0.18574E+02 1967 0.21296E+03 0.10933E+02 0.00000E+00 -0.18678E+02 1968 0.21312E+03 0.10880E+02 0.00000E+00 -0.18780E+02 1969 0.21328E+03 0.10826E+02 0.00000E+00 -0.18879E+02 1970 0.21346E+03 0.10771E+02 0.00000E+00 -0.18976E+02 1971 0.21364E+03 0.10716E+02 0.00000E+00 -0.19070E+02 1972 0.21382E+03 0.10660E+02 0.00000E+00 -0.19161E+02 1973 0.21402E+03 0.10603E+02 0.00000E+00 -0.19251E+02 1974 0.21422E+03 0.10545E+02 0.00000E+00 -0.19338E+02 1975 0.21442E+03 0.10487E+02 0.00000E+00 -0.19423E+02 1976 0.21464E+03 0.10427E+02 0.00000E+00 -0.19506E+02 1977 0.21486E+03 0.10368E+02 0.00000E+00 -0.19587E+02 1978 0.21508E+03 0.10307E+02 0.00000E+00 -0.19666E+02 1979 0.21531E+03 0.10246E+02 0.00000E+00 -0.19744E+02 1980 0.21555E+03 0.10184E+02 0.00000E+00 -0.19820E+02 1981 0.21579E+03 0.10122E+02 0.00000E+00 -0.19894E+02 1982 0.21603E+03 0.10059E+02 0.00000E+00 -0.19966E+02 1983 0.21628E+03 0.99962E+01 0.00000E+00 -0.20037E+02 1984 0.21653E+03 0.99325E+01 0.00000E+00 -0.20107E+02 1985 0.21679E+03 0.98684E+01 0.00000E+00 -0.20176E+02 1986 0.21705E+03 0.98038E+01 0.00000E+00 -0.20243E+02 1987 0.21731E+03 0.97388E+01 0.00000E+00 -0.20309E+02 1988 0.21758E+03 0.96735E+01 0.00000E+00 -0.20374E+02 1989 0.21785E+03 0.96079E+01 0.00000E+00 -0.20438E+02 1990 0.21812E+03 0.95419E+01 0.00000E+00 -0.20501E+02 1991 0.21840E+03 0.94757E+01 0.00000E+00 -0.20564E+02 1992 0.21868E+03 0.94092E+01 0.00000E+00 -0.20625E+02 1993 0.21896E+03 0.93425E+01 0.00000E+00 -0.20686E+02 1994 0.21924E+03 0.92756E+01 0.00000E+00 -0.20747E+02 1995 0.21952E+03 0.92085E+01 0.00000E+00 -0.20806E+02 1996 0.21980E+03 0.91413E+01 0.00000E+00 -0.20866E+02 1997 0.22009E+03 0.90740E+01 0.00000E+00 -0.20925E+02 1998 0.22037E+03 0.90066E+01 0.00000E+00 -0.20984E+02 1999 0.22066E+03 0.89392E+01 0.00000E+00 -0.21043E+02 2000 0.22095E+03 0.88717E+01 0.00000E+00 -0.21102E+02 healpy-1.8.1/healpy/data/weight_ring_n01024.fits0000650000175000017530000016610011705033043021703 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:15:45' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24576 / width of table in bytes NAXIS2 = 2 / 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 NSIDE = 1024 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 3500 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1024D ' MAXVAL1 = 1.748933828406E-01 / maximum value of T weights MINVAL1 = -8.915246089061E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1024D ' MAXVAL2 = 1.748933828406E-01 / maximum value of Q weights MINVAL2 = -8.915246089061E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1024D ' MAXVAL3 = 1.748933828406E-01 / maximum value of U weights MINVAL3 = -8.915246089061E-02 / minimum value of U weights COMMENT END ?ÆbèË%6¿¶Ò²âp?«é±/a¿¡ÿ # 2‹?—œNfÒÕ¿ŒHèÚÝW…?~ÜÅd×±­¿iR?N~¾Þ72‚Wì?`)¼Ýåׂ¿i n}Ï@?lR9ÅZûí¿keÀË›¸å?g’ùDî¿b> S‰4?WYÿòá’h¿EªínÅJß¾òØÉù »?BV¯]ÔŽ¿Nž>ÔØ*x?R•F³¿S)-wmäÑ?QrRQ¬€D¿L‹iƒq?B÷îí¤ö¿2+“õš}>¾ë´üŒaCt?1-ç5wÁ¿=WI+W?BFWbÀc/¿CQÞ<Ê »?BŸ1͇ڿ=‡çdø8V?4_Xýup¿#¾z öÚŽ¾ägá”gèÄ?#ï`ÿìJy¿1/øGâ ?5¯…j“k¿79‰›ÞNY?5ë8ËŽ7¿2/6 ’£?)XyÙrÀ¿³eï© é¾Þ† ¼*Ÿ?lN>fV¿&K^µ?,­Ô\i§M¿.÷¿¸M?-uϨ¥%¿( f[¨v?!G‹ê‡)¿é±g¿S•¾ÖÖìËòèùŸ-mê.¿-ýg-?DÍ/%Èÿ¿ÇÕœ_ïî?bíµPÃÀ¿ *¯¶?p©3f;u¾õ@)rùy¾vtØìÜO>ô‘}8·Z\¿éöðK¼ ?ü‰x¨¿ ä&š+? hÜ{{6·¿º•I[Ð8?f˜DùÙ¾ò‡ó•ØÏË>¥ëJƒj­>ð— ±Û/y¾ÿKgÀ>Ÿ¢?æ}åž´¿ƒó­ê o?GݺÎÀo¿SâîÛ£>þ,ñù?§›¾ð†Lw>¶lí-É.>êÀ#—m œ¾ú/Çð~V?©ñ¢Íž¿Ê»ó?<›<Ù“¿¨”´ ÓB>ú–³˜—6¾î õuIŠ>À–œöÅS•>ån™-ü4k¾õÚ™F¶%ò>þžod¿Gµ”…«?m4Ðt¾ÿ¥§{ Ó>÷ôå*À¾ëÍWõd~`>Å«ÓH8‚Å>àñ…©§r¾òV 7×ù>ùÆë\9¾ýÿSÉÎ0o>þ™t9HHV¾ûžZ«™>õ€!¹¸©ò¾êg.B‰®>Êš°=³>Ú)kÛ‘f ¾î¹×„©¤Ø>ö(XàÁv6¾ú0Õ ·…«>ûÅnqš¯¾øÆö)U š>óªg²&‘é¾èÎ’u[“y>Ïx8Þ²>Ói½´2œl¾é…kFcO>óOëôîH¾ööŠÛ%¬>ø¼@ü™¾öft:>ò'šð¡@¾çÒmOùÊw>ÑÄÊ–1>ÊÛÌÀç‘B¾å'Àu¿´ >ðf RýM¾ô.¿1":>õŠÎþæ'¾ôa3…Ćë>ðãêý)P¾ç³@ï<>Óà‹PeT>ÀyÞKد¾á5 Á¡^>ìŒw,E¾ñ¿ô·WýW>óR9zëñ¾ò¡¯“W>ï @|V¾æyO]ZP>Õâ!Ü>Ùá>©{ÂGD9ú¾ÛU¥ Ò©>çè.V4õ¾ï-ˆ)gƒ>ñZÈhèG.¾ñmôÂdP>í¿W A˜¾åÿdQŽG>×ÇE?·×k¾”L{{ïmÿ¾ÔébOH>äóµt ¾ëF˜· ÿ>ï*·g E¾ïj_™z u>ìø¯L<¾å–Šjsô>ÙŒ8^>¼Å¾µrzRIˆ¾ÎÃW fH>à¦S+eƒ¾ç´YÛ<ñ >ëëÆ|Èe¾ìàa¥.>ê‡JŸ°9d¾å5ÕÁ? >Û+¼ç~|/¾ÂBölÈóA¾Ã1ñÊE|>Úà~ <»¾äc‰r›ë>èåJˆ a{¾êÇ` >étû*ê¾äÓ¸P'o>ÜŸŸQãú¾É0¶gjÞ¾²:kº~î°>ÔàÅ}–½q¾áEmË|¼">æ©Žq¾è7Íq/|k>磠赾äg‹$™Åy>ÝÝ´&܈Ͼτ’S×Ù>`Ðh%ªÖÎ>ÎwNX× ¾ÜŸ>ãFhÓýî¾åþqÜ8°>æ2hÓ¬ÿÒ¾ãé~'ºê>ÞÝÔ‚ºN¾Òœ¶²ºÊ{>±ñóÌŸ>ÃÌŠ Yò¾Öï½È|>à—Ýïºö¾ãÇðÍÏf>äµ|è33˜¾ãP!ôLº%>ß“ýR¡¡C¾Õ!ÅM³ŽÑ>ÁüÜ<>>³jb!`百ÑtÚIåŒÐ>ÛéüZÍŸ¾á.=™X>>ã$ÊB+¾â•=3ïZK>ßó…о×H×eê>È[{ÔyT]>XgPç¾ûÕ¾ÈSÐ/mW`>Ö²¬G"L•¾Þ¿Ý*÷ð>áw>àÔiоá±(É£Õ$>ßîÙ£7«ˆ¾Ù…“h¢=>ÎîaFHʾ±n+]I¾¼;— j>ц9ûû*žÙèŸ$}h>ßSqÀV§Ÿ¾ày›aš>ßxÚ›¾ÚJç Ã+°>ÒRV!P¯¾Àîéǹ«¾¡PglýqÕ>ÈÍi Ñ'L¾Õ"–Æ©úk>ÛpDc9̾ީÒã\.i>Þ«€l ¾Û yóA%>Ô®¦±ž³¾ÈYà'ÝŒ3>£Æ‚Á‹>½p¥M©¾Ð@ò9YÇ>×BþSôŒÐ¾Û§³2?Ã\>ÜÿªÒŒ¬¾Û1xŸçá¿>Özûdµ¢¾ÎÒ‡ú°3>» f(uÏ+>£§£ÀŽÃj¾ÆšÂÖÛš§>ÒÏrHƒ¾Ø1剒î >ÚèÞky¼¾Ú³ßÙc¡>×£zéXü¾Ò7B¼ke>ÅZ~¨mÕ¾¡Ð}Öqý¡¾¹b†H4!>Ì@©º´<‘¾ÔK¸lÍ`>Ø8ˆ‚"hŽ¾Ù„²“-O>Ø¥¾lJ3¾Ô6‰ó>ÌÙ†Ó7×¾ºV·ð„Z¾—¯YDg>Â’h^mH¾Ïÿü%×ã>Ôð8¹ÑŽÌ¾×™Ô¥ä>×½›}©à¾Õ_Ä3€>ÐÈز²4¾ÄùÞ P0Â>©^XÂò¿>±ŠÄ´î̾ÆŞƖ>ÑÎ÷R¡H¾Ôó´S°ÉÙ>Ö€âBnݾÕÉìLŽ®Ø>Ò¿ÚR1¾Ë”·h2í>½Ñá)ª²¾züqò—ŒW¾ºEmÛ¹¹Õ>É’éUWt¾Ñ™„Vš×[>Ô†gUÔR´¾ÕHØ5È…¥>ÓÔÆÐP©¾ÐV±±¼>Æd¨Ô]?x¾³ÙWÖô8¾›VÁ“Y>À>šÄºæÔ¾Ë=ã‘új>Ѧvt0ÇD¾ÓФ&+é`>ÓêºKÌÞ¾Ñøãnâ•.>Ìiðµê{ʾŠ0üs>§ìë(]’Á>ªDôUž ¾ÂKwdH4>ÌGÝyæ¾Ñb—%"Ý>ÒòyÖk^*¾ÒbÃl‚>ÐL"øŸ#¾ÈÍ’óÅ—@>½+D’î^ø¾˜ ßò¹á¾±|šSW_>Ãxà-΂ ¾ÌìàðÊ>ÐçuW¼Dê¾Ò ÇÚW3>ÑL™ÈaþͲÔ\W >ÅÞ"lH帾·Û”SÒ0¶>|ù æÍ>´+'äß[+¾Ãð°]úD>Ë°¼Ù›ý¾ÐK cŒî>ÑN‡'¡ç¾Ð+Z9{c>ËL7ÁGվÙ9sç_ý>´¯iTnO>j¥ÜG˜{}¾µlÔé$6K>ÃÕ{5:î¾ÊäVi4‰Z>Ï6½ÒÆð¾Ð3ðk˜X9>ÎcIYì¾Ée»YéË,>Áöü„¾±­çb:Q„¾€Ò™5š©>µwB<„¾ÃAûZ¿k‘>ÉÎgùn®ç¾ÍÂí]ðÄO>ÎĉZ[k¾ÌÃý„û>ÇùŽ±;ʾÀçÁp]æ>°ˆÚIVâ>PZXñ¾´t’@¬ýD>ÂI;QbÀ»¾È}…R3>ÌC"nÂ<+¾ÍD0?·,>ËpÁ¶o¾ÆüqÆ—¹·>À^þ›¦á¾°KÏÇD¾r‹´u|Â>²…ŒÙÉú¾À÷D==u(>Æøˆ7I‹¾Ê·–ö½È>ËàÈ£tX¾Ê^ûpÉ0‰>Æ^¸¢h,¾ÀH£—õä >±moÞh ß¾i@A?Ny¾¯‚´VfZô>¾¤g°tt¾Å>º¹Ø8>ÉŒ& „ݾʿ ´˜>É~æ5jœ¾Æ ·Ôo!Ì>À‘ãöÎõ–¾³.Ýæà 3>ŒŽk3T8~>¨qáõêuÛ¾º·[û-»S>ÃI”O42O¾Ç\“>ŽB¹>É8ö $îà¾È¸Ï]åæ|>Åî¿çé“þÁ#vD“Sy>µœmOT图œIŽviê6¾Ÿé‡O¹I>¶%[N@ª¾Á™êJE=>Åoô>Çóó“Ô¾ÅèÕ"Ä[×>Áẫî#¾¸‰;¹«Ì>¦W–á°>ˆ©ÀuPо°ë…ÉmÒî>½¢ú%“¾Ã@axÛ0>Æ+­b¹;¾Çž×ħÓ>ÅÚcÿ æ¾Â°—¯LcË>»¿6™ä. ¾¯k”¹ü`c>ƒG@Ó>€>¦@¨i¾·Z !­B>Àº0ê»<£¾Ä<åðGæ9>ÅéFV³Pƒ¾Åž@[’vA>Ãgêâ XD¾¾ûªC> >´{‚cþ¾ †rÊaö¾’J;{l§)>°â¤` ¥—¾»˜­Ð)>Áã᩵»C¾Ä_[ùµw>Å jµ>¸*¾ÃÝìxÜ·;>ÀöL’fü»¾¹4fí'}>¬»·@ûQ‘¾ƒ¹¡´ñ†¾£l?ƒ<—²>´ØxAƾ¾žÐ Z¼>ÂNo©˜!Q¾Ãöú®‡Ç>Ãâ«E¡¾Âô ¿=á>½…צ>°¾´aþˆš†O>£'dë·ð>;8ã1‚¢¾ªkã!¨ ´>·=¾à†Ñy¾¿3•¬fu>Â7ÑIv˜¾ÃC°šc&R>ªç¥ï&ɾÀ~Ά#*»>¹åC¦B§Ú¾°­qÐ`ç>˜ŠÑ¤õØá>“QfæáÍ$¾®•—¥ÜÒÄ>¸aY W<:¾¿Xà††&E>ÁÐùóÚOˆ¾Ât4§xñ>ÁŒ-£Ü㤾¾aQ¶$ì>·/©o' ¾¬A…³È&6>Û Ìlî>™ž|°ÎE‹¾°,E"¤kF>¸†Fn9»¾¾ÉŸŠ*å+>Á< ½«Çe¾Á¥ãgÀ>À7^B+¿¾¼w½PÕ‡>µlPÈOÞÿ¾©eŒ©œ‰[>ˆ"îA%Rû>›Mœ= ¾°ýR°n>·Ý!ÀŒñ‹ ¾Àç™ñ<» >¿Ìw¿Ùœ¾»B D>´“•FtóR¾¨žcñd>‰ ƒä@>˜Þ²•­G¾­üÜú >¶‚¦é¿¾¼-›¼Ï³_>¿“a6ÄÖ¾À:^´êM>¾Æš…eL¾º±N ®ÍŽ>´9“­ ¾©µdâîéÂ>ÞÃ~m°}>’³êJ9— ¾ªBü†ßé>´~ãqU`;º5Û¿Å­>½Ù¥m €¾¿'NÓñ³L>¾ ŸÂö¾º¢’êö>µ54H¶¨µ¾¬f†‘Ñ% >˜¨k”HU>‚4*Æu­-¾¤ñУ To>±Î?sk\¾·¹Ï^]¿?>»Ìê@Îmª¾½½TèMã>½k'%Þ™¾ºâs*`Úó>¶Y¾à·°·¾°-S‹ó²->¡¯–Í5½–¾m1a~¥È¾œLÝÖbÝ>¬Â2·*¦¾´™ÜvJ½+>¹>·+q¡ ¾»ûÎE/Þ]>¼¢Qa ¾»+h¶à_Õ>·¸$°:¾²Ž¡ê->¨'m3~è^¾“Ãà¹×¾†¥x™¸ó>¤R¬y|¾°±çYfÄ©>µ÷9¯´ þ¾¹šû«ÐV>»^(Á\R ¾»%!¾1Ãý>¸ù'CÕk¾µ*¢ ÄÓ>¯8ŒÆ6ù¾¢=xlÝQ>€B÷…ª)>”‘ɤû\¾§ÊI#3CŽ>±Àg𤠾¶Nž‡)]>¹@òmóðN¾ºfSïÞ>¹¯W+Ï‚¾·-%[Ó#>³u†ú®¾«S5ô š>gI.†¾bIa×^Õ¾˜¹]ù >¨êâÖ庾±ÓêäLáì>µí|›r?”¾¸}dmy>¹Z´‚­¹¾¸z·ÿ >µñ<†É…r¾±îÆÖ[N>©yµ…g)þ¾šâ†­/ÖØ>S¾:ž7¡>˜`ŸC2Š¾¨ ¢ïÿŽ´>±õ/21¤¾´ÿ¾¤1ì>·u½éu?꾸V©Óš²B>·—´‚¯fW¾µIÆ´Å_>±—ûAeò"¾©ˆÄ$FE>œ:ŸÌj¾qXD›7ݾ“ù='Çî]>¥dÊ.<,º¾¯Pûþcq,>³éDᾶ*ŽÕªxF>·P­¶|j2¾¶ó tà‹>µ΢?šì¾±ìû)óÇ>«<¤zȾ òò>7³P>†£Æ¡,u·>‡šÕ?“†¾ ÿmåK{#>ªî“ÀZ‡‚¾±‹L3b¼¸>´|P1‡ˆ¾¶‘¶”š>¶Y¬†_°‘¾µ/A^Ùü¹>²µÂëÔ¾®,DOP>¥>%Ž€¾•¤6ê9ýоûÌók‡b>•µ $ﾤå“ØvP>­•2"™#X¾²2—rb>´x"Wå“|¾µzéÓ¯Ý>µ.™F—쿾³›Hž» »>°Ü¬ò{ñ¾ª@>4p >¡C7ÝD¾?³s| ¾wúœZì›p>š úuø¾¦?ÃÍ|{C>®…¾Ê;²žÓRŒ*>³îˆˆV¾´§ˆjkP>´*t´”2«¾²YçwS9>¯/^³S¾¨SõZNÍ>Ÿ{ëÛ´ñʾ‰Bc¤õÌç¾{8ŽÓÐ7à>™³1%˽¾¥}iD7ò>¬Ö”D`.Ž¾±>Ñfs>³þö©¾³ÎÌâÌ–h>³kÞîû†q¾±òbA$I>®ôæJ|x¾¨T)›9ç`> e¯.€>À¾Žw5'q]+¾hJÒŠCV>”ÿPö꓾¢Ôÿïêr>ª]£Ä.¾¯ÒgÒ‘t>±åæwr™W¾²åÔI>²ÝÊ"ê.¾±ÏŽlÌ>¯˜Uª³¾©ðFÚÎN>¢ë"~L o¾•â¯Ð*Y>s‘÷|ÁA>ˆuâ¶Y쾜’0]e£>¥£õ“Ž2¾«Í#”¨2b>°:¤ö0÷Ѿ±±'š-0>²9ÂH–¾±Í¿•é>°w”§.o¾¬•oðhÍ>¦ÌHXGÁñ¾ŸÇBĈç>qöØðž¾93X±¤ÆQ¾QôÆ}‚>ž—4d¨ê ¾¥ü'Xæáž>«„ÃzïÅ⾯¡¿7£‹G>±G¡hOؾ±uñ£ú>°üMÐö»ú¾¯Y°°Ïj>«4í êh¾¥Â¸œì>ž•ü}¬x¾BÂ}ÊÍ>T„Œ!ú>‹aTö€@¾›Ü}8XZŠ>¤J®F}>®¾©¡²éž„c>­´÷ ãáо°+?Tg >°µBzá^1¾°t?-VÄÈ>®Û"mñh9¾«_‘UI„>¦£ŸxpñÒ¾ ãc8uÃ>”ÌJû]Ž´¾{ÖõúBhñ¾|\£‘Bvå>”´¬–-áC¾ ¢U¾­–?>¦Ù®â{¾ª‰ž¹6?h>­»s-“²•¾¯ÙÆ x>¯ö¡í“h¾®îŸÒp°>¬ˆÔov€¾¨ân’>¤*• œ$›¾1ñ»y>Ýcf 6ä¾o(N‡«C¾‚I *m«P>•®b‘$Ò¾ —¨efÆK>¥•ÖÞ¨þξ©9-Lí>¬„¬›‚Â=¾®/ø>¶u¸>®¿DA¯$¾­¦×‘ß39>«€_še¾¨7âßð>£ò–?óq޾ſ s¥Ô>’ìc$ñܾz8Z]pp¡¾vA¦‰l>‘[åþE¾œZô¾n4ô>£ðƒ‹¾§!×k³m1>ª>ÊTÀ뾬Hä] >­.¯òÎþ¬ê :`ð×>«ƒ{úý˜¾© š(Ñô>¥šÂᾡ[ç®W>˜ïËFl}¾ŒŽ'äë >i=9ŠqÕƒ>ÿ¼U·¸•¾’­TõyÔ>œ¹¦k‘óu E¾©5þÛ¯±)>« H¼yú¾«Ú#C¦m>«¡%M ÛÒ¾ªd¼:üâ¼>¨3Â$ÐèQ¾¥%¾©C¨>¡YÚ²‰K³¾™ë)Yºý,>Fƒœ`û¾xƒ]ŒaPj¾pŸ#î]%>Œk(7J¾—®¨-Ͷ7> é$gI³¾£Ï¾,qCØ>¦È{5«š¾¨ðÆûñ=>ª9¹…äD¾ªš~ ;¥é>ªÊž@ᾨª=«t;ç>¦o츥ƒ´¾£y¶o’ê>ŸÆ¼ƒȾ—šö$8=>qn Ú(¾u²ž^d:Ò¾oÌC;Ü¢u>ŠVÎÙI_¾•Ý~•>qr>ÉÚïÑk¬¾¢Yd}É>¥0Ï`W‘2¾§Wšµô•>¨½p$d뾩YùÉÅöf>©+«T_!­¾¨6L¥¦ÞÀ>¦„0’»©¾¤$èÆx>¡-¯iVŠ¾›n9ñ¼m™>“»ù ’ €¾‡ïië>hYõhå²>v’IjF-¾‹£TM;>•¥§Ö™m¾œÈîŠ@Ìò>¡„‡>æЦ¾¤4·9>¦eÙ»3Ͼ§zŽî‰O>¨*wf€‘ˆ¾¨+ŒDbêe>§€+äÁÛ¾¦/tÙÞ>¤Dómàp¾¡Ð2çÃ$>ÈiÊŒ½¾—-ªÜ1XK>?ešAƒ¾€æfbCK>Gbµª€¹>{ÍؽÝaH¾ŒÊ?fÝd>•i7wkˆƒ¾›Òä{Py?> ½\L“¾£wÏùu–>¤ÿºg–›ò¾¦V¬Ï>§LÞ™T¾§N½¿HÈ>¦ì¬añÔ¸¾¥üƒ’`Þ–>¤…_—Òö`¾¢’!ëËï¿> 0k„–ïʾšàk† S0>”Æ¿—6A¾ŒtÑýÿ$â>}at¼ ¾;ì‚¿ßô¾z sl•Ã>Šƒ]¨ˆ¼æ¾“©è—eá>™˜0¦"Û¾žì=´’Ì>¡Å8O£ÐѾ£­ªp7>¥&?êh]¾¦(\œÌµ³>¦°0²¦´¾¦¼ ÙªŽß>¦M²†¾¥hÕé'dÙ>¤¬ÆóNо¢V”xä> ;ÖêkL¾›žÍ¦û>–=*‘¨A˾o‡“$ú>„¨MØù$¾p(£ÁNÛ¾bxª[¸">1%[¾h}¬èr >”…ƒƒ#\5¾™ñ¿%‹À>>žà²­е¾¡žoD·>£yéh9ÓP¾¤û2lD%>¦pR̦꾦ÙRâ|A>§0EÛEÁ”¾§ fIR>¦ª&jR´ö¾¥ÑfŠõÛà>¤š? ¦†r¾£ $ñº>¡)‚掾þÚ¡ðæ‡>™+:¼u¾“ìb"‘»†>Œ¯¬ifFǾ?ï­ä>d?¬e±>l*çžÉÈ¥¾ƒeë!¹4>ŽïJº¤3¾•0qŠ‚>š¡‡­—´E¾Ÿ¸h¨»í>¢1_Ç/¾¤H%k·e\>¦T7¦è=¾§ž»¼ŠPp>¨Ó8èÎo¾©²¿…Òú>ª:_Qå$×¾ªhE××¾>ª;¼Pù|Õ¾©µ"‰À>¨Õæíg°¾§ | CC>¦K™ÉFÿ¾¤A§”+>¢!¸Â¡ró¾Ÿ|ØÙž~ä>š<ÀòÅ÷¾”‘žTš>ä)ã\¾€rCp.M_>ZÔ{x};>tÝP[檾‡£0zÂ#”>’ c¶ê`¾™aŠCéi> Ç5ï“/¾£7ó~Ë Õ>¦MT åL澩8q˸O>«ñ*Ë€a¾®oÁ Y l>°VsøŠ¨ ¾±Pè\9ø>²$ÁwÔݾ²Í1ƒ›]Â>³I ;°Éõ¾³—+2Rd>³³ê&IY¾³žJ€LvÐ>³UÙæ~¾²×YðÙɬ>²$š»ˆ¶¾±< Œ×>°Íëì ¾­›º­’‚ª>ª·ÝѾZ¾§ P~¥å>£M^ގѾž6§€ûU>•^Ùq¾†©áóXqa>MMÄ14WQ>„0]ÔxL¾•§íÇh> ÚËpoÊŽ¾§8‡æL<>­Ô³HÊ’¾²®ÂáÒô>µv(¸åH¾¸ä|?©z>¼\µïñï4¾¿ÚÎ@óè(>Á­Uûn›¾ÃlÄLw^>Å'€§sìá¾ÆÝz „í>ȋ΢¼«¾Ê0?É2˜>ËÈz¯¥£ê¾ÍRW•„K>ÎÊbþÞM²¾ÐNôå9>н½¾ÑV­¿éV>ÑßÇ#‚¢¾ÒV*d,ï>ÒµýÍ÷¢¾Òùã¡ @~>Ó ¶Î·Œ¾Ó †1Çc²>Ò¸$E$–¾Ò¯-ìWK>ЫkÈh§Æ¾Ì|AgiP>ÃfZ•}ÿ^¾{°lá^Tù¾Õ±îòOç>öê°hT¿n`©A?ÆbèË%6¿¶Ò²âp?«é±/a¿¡ÿ # 2‹?—œNfÒÕ¿ŒHèÚÝW…?~ÜÅd×±­¿iR?N~¾Þ72‚Wì?`)¼Ýåׂ¿i n}Ï@?lR9ÅZûí¿keÀË›¸å?g’ùDî¿b> S‰4?WYÿòá’h¿EªínÅJß¾òØÉù »?BV¯]ÔŽ¿Nž>ÔØ*x?R•F³¿S)-wmäÑ?QrRQ¬€D¿L‹iƒq?B÷îí¤ö¿2+“õš}>¾ë´üŒaCt?1-ç5wÁ¿=WI+W?BFWbÀc/¿CQÞ<Ê »?BŸ1͇ڿ=‡çdø8V?4_Xýup¿#¾z öÚŽ¾ägá”gèÄ?#ï`ÿìJy¿1/øGâ ?5¯…j“k¿79‰›ÞNY?5ë8ËŽ7¿2/6 ’£?)XyÙrÀ¿³eï© é¾Þ† ¼*Ÿ?lN>fV¿&K^µ?,­Ô\i§M¿.÷¿¸M?-uϨ¥%¿( f[¨v?!G‹ê‡)¿é±g¿S•¾ÖÖìËòèùŸ-mê.¿-ýg-?DÍ/%Èÿ¿ÇÕœ_ïî?bíµPÃÀ¿ *¯¶?p©3f;u¾õ@)rùy¾vtØìÜO>ô‘}8·Z\¿éöðK¼ ?ü‰x¨¿ ä&š+? hÜ{{6·¿º•I[Ð8?f˜DùÙ¾ò‡ó•ØÏË>¥ëJƒj­>ð— ±Û/y¾ÿKgÀ>Ÿ¢?æ}åž´¿ƒó­ê o?GݺÎÀo¿SâîÛ£>þ,ñù?§›¾ð†Lw>¶lí-É.>êÀ#—m œ¾ú/Çð~V?©ñ¢Íž¿Ê»ó?<›<Ù“¿¨”´ ÓB>ú–³˜—6¾î õuIŠ>À–œöÅS•>ån™-ü4k¾õÚ™F¶%ò>þžod¿Gµ”…«?m4Ðt¾ÿ¥§{ Ó>÷ôå*À¾ëÍWõd~`>Å«ÓH8‚Å>àñ…©§r¾òV 7×ù>ùÆë\9¾ýÿSÉÎ0o>þ™t9HHV¾ûžZ«™>õ€!¹¸©ò¾êg.B‰®>Êš°=³>Ú)kÛ‘f ¾î¹×„©¤Ø>ö(XàÁv6¾ú0Õ ·…«>ûÅnqš¯¾øÆö)U š>óªg²&‘é¾èÎ’u[“y>Ïx8Þ²>Ói½´2œl¾é…kFcO>óOëôîH¾ööŠÛ%¬>ø¼@ü™¾öft:>ò'šð¡@¾çÒmOùÊw>ÑÄÊ–1>ÊÛÌÀç‘B¾å'Àu¿´ >ðf RýM¾ô.¿1":>õŠÎþæ'¾ôa3…Ćë>ðãêý)P¾ç³@ï<>Óà‹PeT>ÀyÞKد¾á5 Á¡^>ìŒw,E¾ñ¿ô·WýW>óR9zëñ¾ò¡¯“W>ï @|V¾æyO]ZP>Õâ!Ü>Ùá>©{ÂGD9ú¾ÛU¥ Ò©>çè.V4õ¾ï-ˆ)gƒ>ñZÈhèG.¾ñmôÂdP>í¿W A˜¾åÿdQŽG>×ÇE?·×k¾”L{{ïmÿ¾ÔébOH>äóµt ¾ëF˜· ÿ>ï*·g E¾ïj_™z u>ìø¯L<¾å–Šjsô>ÙŒ8^>¼Å¾µrzRIˆ¾ÎÃW fH>à¦S+eƒ¾ç´YÛ<ñ >ëëÆ|Èe¾ìàa¥.>ê‡JŸ°9d¾å5ÕÁ? >Û+¼ç~|/¾ÂBölÈóA¾Ã1ñÊE|>Úà~ <»¾äc‰r›ë>èåJˆ a{¾êÇ` >étû*ê¾äÓ¸P'o>ÜŸŸQãú¾É0¶gjÞ¾²:kº~î°>ÔàÅ}–½q¾áEmË|¼">æ©Žq¾è7Íq/|k>磠赾äg‹$™Åy>ÝÝ´&܈Ͼτ’S×Ù>`Ðh%ªÖÎ>ÎwNX× ¾ÜŸ>ãFhÓýî¾åþqÜ8°>æ2hÓ¬ÿÒ¾ãé~'ºê>ÞÝÔ‚ºN¾Òœ¶²ºÊ{>±ñóÌŸ>ÃÌŠ Yò¾Öï½È|>à—Ýïºö¾ãÇðÍÏf>äµ|è33˜¾ãP!ôLº%>ß“ýR¡¡C¾Õ!ÅM³ŽÑ>ÁüÜ<>>³jb!`百ÑtÚIåŒÐ>ÛéüZÍŸ¾á.=™X>>ã$ÊB+¾â•=3ïZK>ßó…о×H×eê>È[{ÔyT]>XgPç¾ûÕ¾ÈSÐ/mW`>Ö²¬G"L•¾Þ¿Ý*÷ð>áw>àÔiоá±(É£Õ$>ßîÙ£7«ˆ¾Ù…“h¢=>ÎîaFHʾ±n+]I¾¼;— j>ц9ûû*žÙèŸ$}h>ßSqÀV§Ÿ¾ày›aš>ßxÚ›¾ÚJç Ã+°>ÒRV!P¯¾Àîéǹ«¾¡PglýqÕ>ÈÍi Ñ'L¾Õ"–Æ©úk>ÛpDc9̾ީÒã\.i>Þ«€l ¾Û yóA%>Ô®¦±ž³¾ÈYà'ÝŒ3>£Æ‚Á‹>½p¥M©¾Ð@ò9YÇ>×BþSôŒÐ¾Û§³2?Ã\>ÜÿªÒŒ¬¾Û1xŸçá¿>Özûdµ¢¾ÎÒ‡ú°3>» f(uÏ+>£§£ÀŽÃj¾ÆšÂÖÛš§>ÒÏrHƒ¾Ø1剒î >ÚèÞky¼¾Ú³ßÙc¡>×£zéXü¾Ò7B¼ke>ÅZ~¨mÕ¾¡Ð}Öqý¡¾¹b†H4!>Ì@©º´<‘¾ÔK¸lÍ`>Ø8ˆ‚"hŽ¾Ù„²“-O>Ø¥¾lJ3¾Ô6‰ó>ÌÙ†Ó7×¾ºV·ð„Z¾—¯YDg>Â’h^mH¾Ïÿü%×ã>Ôð8¹ÑŽÌ¾×™Ô¥ä>×½›}©à¾Õ_Ä3€>ÐÈز²4¾ÄùÞ P0Â>©^XÂò¿>±ŠÄ´î̾ÆŞƖ>ÑÎ÷R¡H¾Ôó´S°ÉÙ>Ö€âBnݾÕÉìLŽ®Ø>Ò¿ÚR1¾Ë”·h2í>½Ñá)ª²¾züqò—ŒW¾ºEmÛ¹¹Õ>É’éUWt¾Ñ™„Vš×[>Ô†gUÔR´¾ÕHØ5È…¥>ÓÔÆÐP©¾ÐV±±¼>Æd¨Ô]?x¾³ÙWÖô8¾›VÁ“Y>À>šÄºæÔ¾Ë=ã‘új>Ѧvt0ÇD¾ÓФ&+é`>ÓêºKÌÞ¾Ñøãnâ•.>Ìiðµê{ʾŠ0üs>§ìë(]’Á>ªDôUž ¾ÂKwdH4>ÌGÝyæ¾Ñb—%"Ý>ÒòyÖk^*¾ÒbÃl‚>ÐL"øŸ#¾ÈÍ’óÅ—@>½+D’î^ø¾˜ ßò¹á¾±|šSW_>Ãxà-΂ ¾ÌìàðÊ>ÐçuW¼Dê¾Ò ÇÚW3>ÑL™ÈaþͲÔ\W >ÅÞ"lH帾·Û”SÒ0¶>|ù æÍ>´+'äß[+¾Ãð°]úD>Ë°¼Ù›ý¾ÐK cŒî>ÑN‡'¡ç¾Ð+Z9{c>ËL7ÁGվÙ9sç_ý>´¯iTnO>j¥ÜG˜{}¾µlÔé$6K>ÃÕ{5:î¾ÊäVi4‰Z>Ï6½ÒÆð¾Ð3ðk˜X9>ÎcIYì¾Ée»YéË,>Áöü„¾±­çb:Q„¾€Ò™5š©>µwB<„¾ÃAûZ¿k‘>ÉÎgùn®ç¾ÍÂí]ðÄO>ÎĉZ[k¾ÌÃý„û>ÇùŽ±;ʾÀçÁp]æ>°ˆÚIVâ>PZXñ¾´t’@¬ýD>ÂI;QbÀ»¾È}…R3>ÌC"nÂ<+¾ÍD0?·,>ËpÁ¶o¾ÆüqÆ—¹·>À^þ›¦á¾°KÏÇD¾r‹´u|Â>²…ŒÙÉú¾À÷D==u(>Æøˆ7I‹¾Ê·–ö½È>ËàÈ£tX¾Ê^ûpÉ0‰>Æ^¸¢h,¾ÀH£—õä >±moÞh ß¾i@A?Ny¾¯‚´VfZô>¾¤g°tt¾Å>º¹Ø8>ÉŒ& „ݾʿ ´˜>É~æ5jœ¾Æ ·Ôo!Ì>À‘ãöÎõ–¾³.Ýæà 3>ŒŽk3T8~>¨qáõêuÛ¾º·[û-»S>ÃI”O42O¾Ç\“>ŽB¹>É8ö $îà¾È¸Ï]åæ|>Åî¿çé“þÁ#vD“Sy>µœmOT图œIŽviê6¾Ÿé‡O¹I>¶%[N@ª¾Á™êJE=>Åoô>Çóó“Ô¾ÅèÕ"Ä[×>Áẫî#¾¸‰;¹«Ì>¦W–á°>ˆ©ÀuPо°ë…ÉmÒî>½¢ú%“¾Ã@axÛ0>Æ+­b¹;¾Çž×ħÓ>ÅÚcÿ æ¾Â°—¯LcË>»¿6™ä. ¾¯k”¹ü`c>ƒG@Ó>€>¦@¨i¾·Z !­B>Àº0ê»<£¾Ä<åðGæ9>ÅéFV³Pƒ¾Åž@[’vA>Ãgêâ XD¾¾ûªC> >´{‚cþ¾ †rÊaö¾’J;{l§)>°â¤` ¥—¾»˜­Ð)>Áã᩵»C¾Ä_[ùµw>Å jµ>¸*¾ÃÝìxÜ·;>ÀöL’fü»¾¹4fí'}>¬»·@ûQ‘¾ƒ¹¡´ñ†¾£l?ƒ<—²>´ØxAƾ¾žÐ Z¼>ÂNo©˜!Q¾Ãöú®‡Ç>Ãâ«E¡¾Âô ¿=á>½…צ>°¾´aþˆš†O>£'dë·ð>;8ã1‚¢¾ªkã!¨ ´>·=¾à†Ñy¾¿3•¬fu>Â7ÑIv˜¾ÃC°šc&R>ªç¥ï&ɾÀ~Ά#*»>¹åC¦B§Ú¾°­qÐ`ç>˜ŠÑ¤õØá>“QfæáÍ$¾®•—¥ÜÒÄ>¸aY W<:¾¿Xà††&E>ÁÐùóÚOˆ¾Ât4§xñ>ÁŒ-£Ü㤾¾aQ¶$ì>·/©o' ¾¬A…³È&6>Û Ìlî>™ž|°ÎE‹¾°,E"¤kF>¸†Fn9»¾¾ÉŸŠ*å+>Á< ½«Çe¾Á¥ãgÀ>À7^B+¿¾¼w½PÕ‡>µlPÈOÞÿ¾©eŒ©œ‰[>ˆ"îA%Rû>›Mœ= ¾°ýR°n>·Ý!ÀŒñ‹ ¾Àç™ñ<» >¿Ìw¿Ùœ¾»B D>´“•FtóR¾¨žcñd>‰ ƒä@>˜Þ²•­G¾­üÜú >¶‚¦é¿¾¼-›¼Ï³_>¿“a6ÄÖ¾À:^´êM>¾Æš…eL¾º±N ®ÍŽ>´9“­ ¾©µdâîéÂ>ÞÃ~m°}>’³êJ9— ¾ªBü†ßé>´~ãqU`;º5Û¿Å­>½Ù¥m €¾¿'NÓñ³L>¾ ŸÂö¾º¢’êö>µ54H¶¨µ¾¬f†‘Ñ% >˜¨k”HU>‚4*Æu­-¾¤ñУ To>±Î?sk\¾·¹Ï^]¿?>»Ìê@Îmª¾½½TèMã>½k'%Þ™¾ºâs*`Úó>¶Y¾à·°·¾°-S‹ó²->¡¯–Í5½–¾m1a~¥È¾œLÝÖbÝ>¬Â2·*¦¾´™ÜvJ½+>¹>·+q¡ ¾»ûÎE/Þ]>¼¢Qa ¾»+h¶à_Õ>·¸$°:¾²Ž¡ê->¨'m3~è^¾“Ãà¹×¾†¥x™¸ó>¤R¬y|¾°±çYfÄ©>µ÷9¯´ þ¾¹šû«ÐV>»^(Á\R ¾»%!¾1Ãý>¸ù'CÕk¾µ*¢ ÄÓ>¯8ŒÆ6ù¾¢=xlÝQ>€B÷…ª)>”‘ɤû\¾§ÊI#3CŽ>±Àg𤠾¶Nž‡)]>¹@òmóðN¾ºfSïÞ>¹¯W+Ï‚¾·-%[Ó#>³u†ú®¾«S5ô š>gI.†¾bIa×^Õ¾˜¹]ù >¨êâÖ庾±ÓêäLáì>µí|›r?”¾¸}dmy>¹Z´‚­¹¾¸z·ÿ >µñ<†É…r¾±îÆÖ[N>©yµ…g)þ¾šâ†­/ÖØ>S¾:ž7¡>˜`ŸC2Š¾¨ ¢ïÿŽ´>±õ/21¤¾´ÿ¾¤1ì>·u½éu?꾸V©Óš²B>·—´‚¯fW¾µIÆ´Å_>±—ûAeò"¾©ˆÄ$FE>œ:ŸÌj¾qXD›7ݾ“ù='Çî]>¥dÊ.<,º¾¯Pûþcq,>³éDᾶ*ŽÕªxF>·P­¶|j2¾¶ó tà‹>µ΢?šì¾±ìû)óÇ>«<¤zȾ òò>7³P>†£Æ¡,u·>‡šÕ?“†¾ ÿmåK{#>ªî“ÀZ‡‚¾±‹L3b¼¸>´|P1‡ˆ¾¶‘¶”š>¶Y¬†_°‘¾µ/A^Ùü¹>²µÂëÔ¾®,DOP>¥>%Ž€¾•¤6ê9ýоûÌók‡b>•µ $ﾤå“ØvP>­•2"™#X¾²2—rb>´x"Wå“|¾µzéÓ¯Ý>µ.™F—쿾³›Hž» »>°Ü¬ò{ñ¾ª@>4p >¡C7ÝD¾?³s| ¾wúœZì›p>š úuø¾¦?ÃÍ|{C>®…¾Ê;²žÓRŒ*>³îˆˆV¾´§ˆjkP>´*t´”2«¾²YçwS9>¯/^³S¾¨SõZNÍ>Ÿ{ëÛ´ñʾ‰Bc¤õÌç¾{8ŽÓÐ7à>™³1%˽¾¥}iD7ò>¬Ö”D`.Ž¾±>Ñfs>³þö©¾³ÎÌâÌ–h>³kÞîû†q¾±òbA$I>®ôæJ|x¾¨T)›9ç`> e¯.€>À¾Žw5'q]+¾hJÒŠCV>”ÿPö꓾¢Ôÿïêr>ª]£Ä.¾¯ÒgÒ‘t>±åæwr™W¾²åÔI>²ÝÊ"ê.¾±ÏŽlÌ>¯˜Uª³¾©ðFÚÎN>¢ë"~L o¾•â¯Ð*Y>s‘÷|ÁA>ˆuâ¶Y쾜’0]e£>¥£õ“Ž2¾«Í#”¨2b>°:¤ö0÷Ѿ±±'š-0>²9ÂH–¾±Í¿•é>°w”§.o¾¬•oðhÍ>¦ÌHXGÁñ¾ŸÇBĈç>qöØðž¾93X±¤ÆQ¾QôÆ}‚>ž—4d¨ê ¾¥ü'Xæáž>«„ÃzïÅ⾯¡¿7£‹G>±G¡hOؾ±uñ£ú>°üMÐö»ú¾¯Y°°Ïj>«4í êh¾¥Â¸œì>ž•ü}¬x¾BÂ}ÊÍ>T„Œ!ú>‹aTö€@¾›Ü}8XZŠ>¤J®F}>®¾©¡²éž„c>­´÷ ãáо°+?Tg >°µBzá^1¾°t?-VÄÈ>®Û"mñh9¾«_‘UI„>¦£ŸxpñÒ¾ ãc8uÃ>”ÌJû]Ž´¾{ÖõúBhñ¾|\£‘Bvå>”´¬–-áC¾ ¢U¾­–?>¦Ù®â{¾ª‰ž¹6?h>­»s-“²•¾¯ÙÆ x>¯ö¡í“h¾®îŸÒp°>¬ˆÔov€¾¨ân’>¤*• œ$›¾1ñ»y>Ýcf 6ä¾o(N‡«C¾‚I *m«P>•®b‘$Ò¾ —¨efÆK>¥•ÖÞ¨þξ©9-Lí>¬„¬›‚Â=¾®/ø>¶u¸>®¿DA¯$¾­¦×‘ß39>«€_še¾¨7âßð>£ò–?óq޾ſ s¥Ô>’ìc$ñܾz8Z]pp¡¾vA¦‰l>‘[åþE¾œZô¾n4ô>£ðƒ‹¾§!×k³m1>ª>ÊTÀ뾬Hä] >­.¯òÎþ¬ê :`ð×>«ƒ{úý˜¾© š(Ñô>¥šÂᾡ[ç®W>˜ïËFl}¾ŒŽ'äë >i=9ŠqÕƒ>ÿ¼U·¸•¾’­TõyÔ>œ¹¦k‘óu E¾©5þÛ¯±)>« H¼yú¾«Ú#C¦m>«¡%M ÛÒ¾ªd¼:üâ¼>¨3Â$ÐèQ¾¥%¾©C¨>¡YÚ²‰K³¾™ë)Yºý,>Fƒœ`û¾xƒ]ŒaPj¾pŸ#î]%>Œk(7J¾—®¨-Ͷ7> é$gI³¾£Ï¾,qCØ>¦È{5«š¾¨ðÆûñ=>ª9¹…äD¾ªš~ ;¥é>ªÊž@ᾨª=«t;ç>¦o츥ƒ´¾£y¶o’ê>ŸÆ¼ƒȾ—šö$8=>qn Ú(¾u²ž^d:Ò¾oÌC;Ü¢u>ŠVÎÙI_¾•Ý~•>qr>ÉÚïÑk¬¾¢Yd}É>¥0Ï`W‘2¾§Wšµô•>¨½p$d뾩YùÉÅöf>©+«T_!­¾¨6L¥¦ÞÀ>¦„0’»©¾¤$èÆx>¡-¯iVŠ¾›n9ñ¼m™>“»ù ’ €¾‡ïië>hYõhå²>v’IjF-¾‹£TM;>•¥§Ö™m¾œÈîŠ@Ìò>¡„‡>æЦ¾¤4·9>¦eÙ»3Ͼ§zŽî‰O>¨*wf€‘ˆ¾¨+ŒDbêe>§€+äÁÛ¾¦/tÙÞ>¤Dómàp¾¡Ð2çÃ$>ÈiÊŒ½¾—-ªÜ1XK>?ešAƒ¾€æfbCK>Gbµª€¹>{ÍؽÝaH¾ŒÊ?fÝd>•i7wkˆƒ¾›Òä{Py?> ½\L“¾£wÏùu–>¤ÿºg–›ò¾¦V¬Ï>§LÞ™T¾§N½¿HÈ>¦ì¬añÔ¸¾¥üƒ’`Þ–>¤…_—Òö`¾¢’!ëËï¿> 0k„–ïʾšàk† S0>”Æ¿—6A¾ŒtÑýÿ$â>}at¼ ¾;ì‚¿ßô¾z sl•Ã>Šƒ]¨ˆ¼æ¾“©è—eá>™˜0¦"Û¾žì=´’Ì>¡Å8O£ÐѾ£­ªp7>¥&?êh]¾¦(\œÌµ³>¦°0²¦´¾¦¼ ÙªŽß>¦M²†¾¥hÕé'dÙ>¤¬ÆóNо¢V”xä> ;ÖêkL¾›žÍ¦û>–=*‘¨A˾o‡“$ú>„¨MØù$¾p(£ÁNÛ¾bxª[¸">1%[¾h}¬èr >”…ƒƒ#\5¾™ñ¿%‹À>>žà²­е¾¡žoD·>£yéh9ÓP¾¤û2lD%>¦pR̦꾦ÙRâ|A>§0EÛEÁ”¾§ fIR>¦ª&jR´ö¾¥ÑfŠõÛà>¤š? ¦†r¾£ $ñº>¡)‚掾þÚ¡ðæ‡>™+:¼u¾“ìb"‘»†>Œ¯¬ifFǾ?ï­ä>d?¬e±>l*çžÉÈ¥¾ƒeë!¹4>ŽïJº¤3¾•0qŠ‚>š¡‡­—´E¾Ÿ¸h¨»í>¢1_Ç/¾¤H%k·e\>¦T7¦è=¾§ž»¼ŠPp>¨Ó8èÎo¾©²¿…Òú>ª:_Qå$×¾ªhE××¾>ª;¼Pù|Õ¾©µ"‰À>¨Õæíg°¾§ | CC>¦K™ÉFÿ¾¤A§”+>¢!¸Â¡ró¾Ÿ|ØÙž~ä>š<ÀòÅ÷¾”‘žTš>ä)ã\¾€rCp.M_>ZÔ{x};>tÝP[檾‡£0zÂ#”>’ c¶ê`¾™aŠCéi> Ç5ï“/¾£7ó~Ë Õ>¦MT åL澩8q˸O>«ñ*Ë€a¾®oÁ Y l>°VsøŠ¨ ¾±Pè\9ø>²$ÁwÔݾ²Í1ƒ›]Â>³I ;°Éõ¾³—+2Rd>³³ê&IY¾³žJ€LvÐ>³UÙæ~¾²×YðÙɬ>²$š»ˆ¶¾±< Œ×>°Íëì ¾­›º­’‚ª>ª·ÝѾZ¾§ P~¥å>£M^ގѾž6§€ûU>•^Ùq¾†©áóXqa>MMÄ14WQ>„0]ÔxL¾•§íÇh> ÚËpoÊŽ¾§8‡æL<>­Ô³HÊ’¾²®ÂáÒô>µv(¸åH¾¸ä|?©z>¼\µïñï4¾¿ÚÎ@óè(>Á­Uûn›¾ÃlÄLw^>Å'€§sìá¾ÆÝz „í>ȋ΢¼«¾Ê0?É2˜>ËÈz¯¥£ê¾ÍRW•„K>ÎÊbþÞM²¾ÐNôå9>н½¾ÑV­¿éV>ÑßÇ#‚¢¾ÒV*d,ï>ÒµýÍ÷¢¾Òùã¡ @~>Ó ¶Î·Œ¾Ó †1Çc²>Ò¸$E$–¾Ò¯-ìWK>ЫkÈh§Æ¾Ì|AgiP>ÃfZ•}ÿ^¾{°lá^Tù¾Õ±îòOç>öê°hT¿n`©A?ÆbèË%6¿¶Ò²âp?«é±/a¿¡ÿ # 2‹?—œNfÒÕ¿ŒHèÚÝW…?~ÜÅd×±­¿iR?N~¾Þ72‚Wì?`)¼Ýåׂ¿i n}Ï@?lR9ÅZûí¿keÀË›¸å?g’ùDî¿b> S‰4?WYÿòá’h¿EªínÅJß¾òØÉù »?BV¯]ÔŽ¿Nž>ÔØ*x?R•F³¿S)-wmäÑ?QrRQ¬€D¿L‹iƒq?B÷îí¤ö¿2+“õš}>¾ë´üŒaCt?1-ç5wÁ¿=WI+W?BFWbÀc/¿CQÞ<Ê »?BŸ1͇ڿ=‡çdø8V?4_Xýup¿#¾z öÚŽ¾ägá”gèÄ?#ï`ÿìJy¿1/øGâ ?5¯…j“k¿79‰›ÞNY?5ë8ËŽ7¿2/6 ’£?)XyÙrÀ¿³eï© é¾Þ† ¼*Ÿ?lN>fV¿&K^µ?,­Ô\i§M¿.÷¿¸M?-uϨ¥%¿( f[¨v?!G‹ê‡)¿é±g¿S•¾ÖÖìËòèùŸ-mê.¿-ýg-?DÍ/%Èÿ¿ÇÕœ_ïî?bíµPÃÀ¿ *¯¶?p©3f;u¾õ@)rùy¾vtØìÜO>ô‘}8·Z\¿éöðK¼ ?ü‰x¨¿ ä&š+? hÜ{{6·¿º•I[Ð8?f˜DùÙ¾ò‡ó•ØÏË>¥ëJƒj­>ð— ±Û/y¾ÿKgÀ>Ÿ¢?æ}åž´¿ƒó­ê o?GݺÎÀo¿SâîÛ£>þ,ñù?§›¾ð†Lw>¶lí-É.>êÀ#—m œ¾ú/Çð~V?©ñ¢Íž¿Ê»ó?<›<Ù“¿¨”´ ÓB>ú–³˜—6¾î õuIŠ>À–œöÅS•>ån™-ü4k¾õÚ™F¶%ò>þžod¿Gµ”…«?m4Ðt¾ÿ¥§{ Ó>÷ôå*À¾ëÍWõd~`>Å«ÓH8‚Å>àñ…©§r¾òV 7×ù>ùÆë\9¾ýÿSÉÎ0o>þ™t9HHV¾ûžZ«™>õ€!¹¸©ò¾êg.B‰®>Êš°=³>Ú)kÛ‘f ¾î¹×„©¤Ø>ö(XàÁv6¾ú0Õ ·…«>ûÅnqš¯¾øÆö)U š>óªg²&‘é¾èÎ’u[“y>Ïx8Þ²>Ói½´2œl¾é…kFcO>óOëôîH¾ööŠÛ%¬>ø¼@ü™¾öft:>ò'šð¡@¾çÒmOùÊw>ÑÄÊ–1>ÊÛÌÀç‘B¾å'Àu¿´ >ðf RýM¾ô.¿1":>õŠÎþæ'¾ôa3…Ćë>ðãêý)P¾ç³@ï<>Óà‹PeT>ÀyÞKد¾á5 Á¡^>ìŒw,E¾ñ¿ô·WýW>óR9zëñ¾ò¡¯“W>ï @|V¾æyO]ZP>Õâ!Ü>Ùá>©{ÂGD9ú¾ÛU¥ Ò©>çè.V4õ¾ï-ˆ)gƒ>ñZÈhèG.¾ñmôÂdP>í¿W A˜¾åÿdQŽG>×ÇE?·×k¾”L{{ïmÿ¾ÔébOH>äóµt ¾ëF˜· ÿ>ï*·g E¾ïj_™z u>ìø¯L<¾å–Šjsô>ÙŒ8^>¼Å¾µrzRIˆ¾ÎÃW fH>à¦S+eƒ¾ç´YÛ<ñ >ëëÆ|Èe¾ìàa¥.>ê‡JŸ°9d¾å5ÕÁ? >Û+¼ç~|/¾ÂBölÈóA¾Ã1ñÊE|>Úà~ <»¾äc‰r›ë>èåJˆ a{¾êÇ` >étû*ê¾äÓ¸P'o>ÜŸŸQãú¾É0¶gjÞ¾²:kº~î°>ÔàÅ}–½q¾áEmË|¼">æ©Žq¾è7Íq/|k>磠赾äg‹$™Åy>ÝÝ´&܈Ͼτ’S×Ù>`Ðh%ªÖÎ>ÎwNX× ¾ÜŸ>ãFhÓýî¾åþqÜ8°>æ2hÓ¬ÿÒ¾ãé~'ºê>ÞÝÔ‚ºN¾Òœ¶²ºÊ{>±ñóÌŸ>ÃÌŠ Yò¾Öï½È|>à—Ýïºö¾ãÇðÍÏf>äµ|è33˜¾ãP!ôLº%>ß“ýR¡¡C¾Õ!ÅM³ŽÑ>ÁüÜ<>>³jb!`百ÑtÚIåŒÐ>ÛéüZÍŸ¾á.=™X>>ã$ÊB+¾â•=3ïZK>ßó…о×H×eê>È[{ÔyT]>XgPç¾ûÕ¾ÈSÐ/mW`>Ö²¬G"L•¾Þ¿Ý*÷ð>áw>àÔiоá±(É£Õ$>ßîÙ£7«ˆ¾Ù…“h¢=>ÎîaFHʾ±n+]I¾¼;— j>ц9ûû*žÙèŸ$}h>ßSqÀV§Ÿ¾ày›aš>ßxÚ›¾ÚJç Ã+°>ÒRV!P¯¾Àîéǹ«¾¡PglýqÕ>ÈÍi Ñ'L¾Õ"–Æ©úk>ÛpDc9̾ީÒã\.i>Þ«€l ¾Û yóA%>Ô®¦±ž³¾ÈYà'ÝŒ3>£Æ‚Á‹>½p¥M©¾Ð@ò9YÇ>×BþSôŒÐ¾Û§³2?Ã\>ÜÿªÒŒ¬¾Û1xŸçá¿>Özûdµ¢¾ÎÒ‡ú°3>» f(uÏ+>£§£ÀŽÃj¾ÆšÂÖÛš§>ÒÏrHƒ¾Ø1剒î >ÚèÞky¼¾Ú³ßÙc¡>×£zéXü¾Ò7B¼ke>ÅZ~¨mÕ¾¡Ð}Öqý¡¾¹b†H4!>Ì@©º´<‘¾ÔK¸lÍ`>Ø8ˆ‚"hŽ¾Ù„²“-O>Ø¥¾lJ3¾Ô6‰ó>ÌÙ†Ó7×¾ºV·ð„Z¾—¯YDg>Â’h^mH¾Ïÿü%×ã>Ôð8¹ÑŽÌ¾×™Ô¥ä>×½›}©à¾Õ_Ä3€>ÐÈز²4¾ÄùÞ P0Â>©^XÂò¿>±ŠÄ´î̾ÆŞƖ>ÑÎ÷R¡H¾Ôó´S°ÉÙ>Ö€âBnݾÕÉìLŽ®Ø>Ò¿ÚR1¾Ë”·h2í>½Ñá)ª²¾züqò—ŒW¾ºEmÛ¹¹Õ>É’éUWt¾Ñ™„Vš×[>Ô†gUÔR´¾ÕHØ5È…¥>ÓÔÆÐP©¾ÐV±±¼>Æd¨Ô]?x¾³ÙWÖô8¾›VÁ“Y>À>šÄºæÔ¾Ë=ã‘új>Ѧvt0ÇD¾ÓФ&+é`>ÓêºKÌÞ¾Ñøãnâ•.>Ìiðµê{ʾŠ0üs>§ìë(]’Á>ªDôUž ¾ÂKwdH4>ÌGÝyæ¾Ñb—%"Ý>ÒòyÖk^*¾ÒbÃl‚>ÐL"øŸ#¾ÈÍ’óÅ—@>½+D’î^ø¾˜ ßò¹á¾±|šSW_>Ãxà-΂ ¾ÌìàðÊ>ÐçuW¼Dê¾Ò ÇÚW3>ÑL™ÈaþͲÔ\W >ÅÞ"lH帾·Û”SÒ0¶>|ù æÍ>´+'äß[+¾Ãð°]úD>Ë°¼Ù›ý¾ÐK cŒî>ÑN‡'¡ç¾Ð+Z9{c>ËL7ÁGվÙ9sç_ý>´¯iTnO>j¥ÜG˜{}¾µlÔé$6K>ÃÕ{5:î¾ÊäVi4‰Z>Ï6½ÒÆð¾Ð3ðk˜X9>ÎcIYì¾Ée»YéË,>Áöü„¾±­çb:Q„¾€Ò™5š©>µwB<„¾ÃAûZ¿k‘>ÉÎgùn®ç¾ÍÂí]ðÄO>ÎĉZ[k¾ÌÃý„û>ÇùŽ±;ʾÀçÁp]æ>°ˆÚIVâ>PZXñ¾´t’@¬ýD>ÂI;QbÀ»¾È}…R3>ÌC"nÂ<+¾ÍD0?·,>ËpÁ¶o¾ÆüqÆ—¹·>À^þ›¦á¾°KÏÇD¾r‹´u|Â>²…ŒÙÉú¾À÷D==u(>Æøˆ7I‹¾Ê·–ö½È>ËàÈ£tX¾Ê^ûpÉ0‰>Æ^¸¢h,¾ÀH£—õä >±moÞh ß¾i@A?Ny¾¯‚´VfZô>¾¤g°tt¾Å>º¹Ø8>ÉŒ& „ݾʿ ´˜>É~æ5jœ¾Æ ·Ôo!Ì>À‘ãöÎõ–¾³.Ýæà 3>ŒŽk3T8~>¨qáõêuÛ¾º·[û-»S>ÃI”O42O¾Ç\“>ŽB¹>É8ö $îà¾È¸Ï]åæ|>Åî¿çé“þÁ#vD“Sy>µœmOT图œIŽviê6¾Ÿé‡O¹I>¶%[N@ª¾Á™êJE=>Åoô>Çóó“Ô¾ÅèÕ"Ä[×>Áẫî#¾¸‰;¹«Ì>¦W–á°>ˆ©ÀuPо°ë…ÉmÒî>½¢ú%“¾Ã@axÛ0>Æ+­b¹;¾Çž×ħÓ>ÅÚcÿ æ¾Â°—¯LcË>»¿6™ä. ¾¯k”¹ü`c>ƒG@Ó>€>¦@¨i¾·Z !­B>Àº0ê»<£¾Ä<åðGæ9>ÅéFV³Pƒ¾Åž@[’vA>Ãgêâ XD¾¾ûªC> >´{‚cþ¾ †rÊaö¾’J;{l§)>°â¤` ¥—¾»˜­Ð)>Áã᩵»C¾Ä_[ùµw>Å jµ>¸*¾ÃÝìxÜ·;>ÀöL’fü»¾¹4fí'}>¬»·@ûQ‘¾ƒ¹¡´ñ†¾£l?ƒ<—²>´ØxAƾ¾žÐ Z¼>ÂNo©˜!Q¾Ãöú®‡Ç>Ãâ«E¡¾Âô ¿=á>½…צ>°¾´aþˆš†O>£'dë·ð>;8ã1‚¢¾ªkã!¨ ´>·=¾à†Ñy¾¿3•¬fu>Â7ÑIv˜¾ÃC°šc&R>ªç¥ï&ɾÀ~Ά#*»>¹åC¦B§Ú¾°­qÐ`ç>˜ŠÑ¤õØá>“QfæáÍ$¾®•—¥ÜÒÄ>¸aY W<:¾¿Xà††&E>ÁÐùóÚOˆ¾Ât4§xñ>ÁŒ-£Ü㤾¾aQ¶$ì>·/©o' ¾¬A…³È&6>Û Ìlî>™ž|°ÎE‹¾°,E"¤kF>¸†Fn9»¾¾ÉŸŠ*å+>Á< ½«Çe¾Á¥ãgÀ>À7^B+¿¾¼w½PÕ‡>µlPÈOÞÿ¾©eŒ©œ‰[>ˆ"îA%Rû>›Mœ= ¾°ýR°n>·Ý!ÀŒñ‹ ¾Àç™ñ<» >¿Ìw¿Ùœ¾»B D>´“•FtóR¾¨žcñd>‰ ƒä@>˜Þ²•­G¾­üÜú >¶‚¦é¿¾¼-›¼Ï³_>¿“a6ÄÖ¾À:^´êM>¾Æš…eL¾º±N ®ÍŽ>´9“­ ¾©µdâîéÂ>ÞÃ~m°}>’³êJ9— ¾ªBü†ßé>´~ãqU`;º5Û¿Å­>½Ù¥m €¾¿'NÓñ³L>¾ ŸÂö¾º¢’êö>µ54H¶¨µ¾¬f†‘Ñ% >˜¨k”HU>‚4*Æu­-¾¤ñУ To>±Î?sk\¾·¹Ï^]¿?>»Ìê@Îmª¾½½TèMã>½k'%Þ™¾ºâs*`Úó>¶Y¾à·°·¾°-S‹ó²->¡¯–Í5½–¾m1a~¥È¾œLÝÖbÝ>¬Â2·*¦¾´™ÜvJ½+>¹>·+q¡ ¾»ûÎE/Þ]>¼¢Qa ¾»+h¶à_Õ>·¸$°:¾²Ž¡ê->¨'m3~è^¾“Ãà¹×¾†¥x™¸ó>¤R¬y|¾°±çYfÄ©>µ÷9¯´ þ¾¹šû«ÐV>»^(Á\R ¾»%!¾1Ãý>¸ù'CÕk¾µ*¢ ÄÓ>¯8ŒÆ6ù¾¢=xlÝQ>€B÷…ª)>”‘ɤû\¾§ÊI#3CŽ>±Àg𤠾¶Nž‡)]>¹@òmóðN¾ºfSïÞ>¹¯W+Ï‚¾·-%[Ó#>³u†ú®¾«S5ô š>gI.†¾bIa×^Õ¾˜¹]ù >¨êâÖ庾±ÓêäLáì>µí|›r?”¾¸}dmy>¹Z´‚­¹¾¸z·ÿ >µñ<†É…r¾±îÆÖ[N>©yµ…g)þ¾šâ†­/ÖØ>S¾:ž7¡>˜`ŸC2Š¾¨ ¢ïÿŽ´>±õ/21¤¾´ÿ¾¤1ì>·u½éu?꾸V©Óš²B>·—´‚¯fW¾µIÆ´Å_>±—ûAeò"¾©ˆÄ$FE>œ:ŸÌj¾qXD›7ݾ“ù='Çî]>¥dÊ.<,º¾¯Pûþcq,>³éDᾶ*ŽÕªxF>·P­¶|j2¾¶ó tà‹>µ΢?šì¾±ìû)óÇ>«<¤zȾ òò>7³P>†£Æ¡,u·>‡šÕ?“†¾ ÿmåK{#>ªî“ÀZ‡‚¾±‹L3b¼¸>´|P1‡ˆ¾¶‘¶”š>¶Y¬†_°‘¾µ/A^Ùü¹>²µÂëÔ¾®,DOP>¥>%Ž€¾•¤6ê9ýоûÌók‡b>•µ $ﾤå“ØvP>­•2"™#X¾²2—rb>´x"Wå“|¾µzéÓ¯Ý>µ.™F—쿾³›Hž» »>°Ü¬ò{ñ¾ª@>4p >¡C7ÝD¾?³s| ¾wúœZì›p>š úuø¾¦?ÃÍ|{C>®…¾Ê;²žÓRŒ*>³îˆˆV¾´§ˆjkP>´*t´”2«¾²YçwS9>¯/^³S¾¨SõZNÍ>Ÿ{ëÛ´ñʾ‰Bc¤õÌç¾{8ŽÓÐ7à>™³1%˽¾¥}iD7ò>¬Ö”D`.Ž¾±>Ñfs>³þö©¾³ÎÌâÌ–h>³kÞîû†q¾±òbA$I>®ôæJ|x¾¨T)›9ç`> e¯.€>À¾Žw5'q]+¾hJÒŠCV>”ÿPö꓾¢Ôÿïêr>ª]£Ä.¾¯ÒgÒ‘t>±åæwr™W¾²åÔI>²ÝÊ"ê.¾±ÏŽlÌ>¯˜Uª³¾©ðFÚÎN>¢ë"~L o¾•â¯Ð*Y>s‘÷|ÁA>ˆuâ¶Y쾜’0]e£>¥£õ“Ž2¾«Í#”¨2b>°:¤ö0÷Ѿ±±'š-0>²9ÂH–¾±Í¿•é>°w”§.o¾¬•oðhÍ>¦ÌHXGÁñ¾ŸÇBĈç>qöØðž¾93X±¤ÆQ¾QôÆ}‚>ž—4d¨ê ¾¥ü'Xæáž>«„ÃzïÅ⾯¡¿7£‹G>±G¡hOؾ±uñ£ú>°üMÐö»ú¾¯Y°°Ïj>«4í êh¾¥Â¸œì>ž•ü}¬x¾BÂ}ÊÍ>T„Œ!ú>‹aTö€@¾›Ü}8XZŠ>¤J®F}>®¾©¡²éž„c>­´÷ ãáо°+?Tg >°µBzá^1¾°t?-VÄÈ>®Û"mñh9¾«_‘UI„>¦£ŸxpñÒ¾ ãc8uÃ>”ÌJû]Ž´¾{ÖõúBhñ¾|\£‘Bvå>”´¬–-áC¾ ¢U¾­–?>¦Ù®â{¾ª‰ž¹6?h>­»s-“²•¾¯ÙÆ x>¯ö¡í“h¾®îŸÒp°>¬ˆÔov€¾¨ân’>¤*• œ$›¾1ñ»y>Ýcf 6ä¾o(N‡«C¾‚I *m«P>•®b‘$Ò¾ —¨efÆK>¥•ÖÞ¨þξ©9-Lí>¬„¬›‚Â=¾®/ø>¶u¸>®¿DA¯$¾­¦×‘ß39>«€_še¾¨7âßð>£ò–?óq޾ſ s¥Ô>’ìc$ñܾz8Z]pp¡¾vA¦‰l>‘[åþE¾œZô¾n4ô>£ðƒ‹¾§!×k³m1>ª>ÊTÀ뾬Hä] >­.¯òÎþ¬ê :`ð×>«ƒ{úý˜¾© š(Ñô>¥šÂᾡ[ç®W>˜ïËFl}¾ŒŽ'äë >i=9ŠqÕƒ>ÿ¼U·¸•¾’­TõyÔ>œ¹¦k‘óu E¾©5þÛ¯±)>« H¼yú¾«Ú#C¦m>«¡%M ÛÒ¾ªd¼:üâ¼>¨3Â$ÐèQ¾¥%¾©C¨>¡YÚ²‰K³¾™ë)Yºý,>Fƒœ`û¾xƒ]ŒaPj¾pŸ#î]%>Œk(7J¾—®¨-Ͷ7> é$gI³¾£Ï¾,qCØ>¦È{5«š¾¨ðÆûñ=>ª9¹…äD¾ªš~ ;¥é>ªÊž@ᾨª=«t;ç>¦o츥ƒ´¾£y¶o’ê>ŸÆ¼ƒȾ—šö$8=>qn Ú(¾u²ž^d:Ò¾oÌC;Ü¢u>ŠVÎÙI_¾•Ý~•>qr>ÉÚïÑk¬¾¢Yd}É>¥0Ï`W‘2¾§Wšµô•>¨½p$d뾩YùÉÅöf>©+«T_!­¾¨6L¥¦ÞÀ>¦„0’»©¾¤$èÆx>¡-¯iVŠ¾›n9ñ¼m™>“»ù ’ €¾‡ïië>hYõhå²>v’IjF-¾‹£TM;>•¥§Ö™m¾œÈîŠ@Ìò>¡„‡>æЦ¾¤4·9>¦eÙ»3Ͼ§zŽî‰O>¨*wf€‘ˆ¾¨+ŒDbêe>§€+äÁÛ¾¦/tÙÞ>¤Dómàp¾¡Ð2çÃ$>ÈiÊŒ½¾—-ªÜ1XK>?ešAƒ¾€æfbCK>Gbµª€¹>{ÍؽÝaH¾ŒÊ?fÝd>•i7wkˆƒ¾›Òä{Py?> ½\L“¾£wÏùu–>¤ÿºg–›ò¾¦V¬Ï>§LÞ™T¾§N½¿HÈ>¦ì¬añÔ¸¾¥üƒ’`Þ–>¤…_—Òö`¾¢’!ëËï¿> 0k„–ïʾšàk† S0>”Æ¿—6A¾ŒtÑýÿ$â>}at¼ ¾;ì‚¿ßô¾z sl•Ã>Šƒ]¨ˆ¼æ¾“©è—eá>™˜0¦"Û¾žì=´’Ì>¡Å8O£ÐѾ£­ªp7>¥&?êh]¾¦(\œÌµ³>¦°0²¦´¾¦¼ ÙªŽß>¦M²†¾¥hÕé'dÙ>¤¬ÆóNо¢V”xä> ;ÖêkL¾›žÍ¦û>–=*‘¨A˾o‡“$ú>„¨MØù$¾p(£ÁNÛ¾bxª[¸">1%[¾h}¬èr >”…ƒƒ#\5¾™ñ¿%‹À>>žà²­е¾¡žoD·>£yéh9ÓP¾¤û2lD%>¦pR̦꾦ÙRâ|A>§0EÛEÁ”¾§ fIR>¦ª&jR´ö¾¥ÑfŠõÛà>¤š? ¦†r¾£ $ñº>¡)‚掾þÚ¡ðæ‡>™+:¼u¾“ìb"‘»†>Œ¯¬ifFǾ?ï­ä>d?¬e±>l*çžÉÈ¥¾ƒeë!¹4>ŽïJº¤3¾•0qŠ‚>š¡‡­—´E¾Ÿ¸h¨»í>¢1_Ç/¾¤H%k·e\>¦T7¦è=¾§ž»¼ŠPp>¨Ó8èÎo¾©²¿…Òú>ª:_Qå$×¾ªhE××¾>ª;¼Pù|Õ¾©µ"‰À>¨Õæíg°¾§ | CC>¦K™ÉFÿ¾¤A§”+>¢!¸Â¡ró¾Ÿ|ØÙž~ä>š<ÀòÅ÷¾”‘žTš>ä)ã\¾€rCp.M_>ZÔ{x};>tÝP[檾‡£0zÂ#”>’ c¶ê`¾™aŠCéi> Ç5ï“/¾£7ó~Ë Õ>¦MT åL澩8q˸O>«ñ*Ë€a¾®oÁ Y l>°VsøŠ¨ ¾±Pè\9ø>²$ÁwÔݾ²Í1ƒ›]Â>³I ;°Éõ¾³—+2Rd>³³ê&IY¾³žJ€LvÐ>³UÙæ~¾²×YðÙɬ>²$š»ˆ¶¾±< Œ×>°Íëì ¾­›º­’‚ª>ª·ÝѾZ¾§ P~¥å>£M^ގѾž6§€ûU>•^Ùq¾†©áóXqa>MMÄ14WQ>„0]ÔxL¾•§íÇh> ÚËpoÊŽ¾§8‡æL<>­Ô³HÊ’¾²®ÂáÒô>µv(¸åH¾¸ä|?©z>¼\µïñï4¾¿ÚÎ@óè(>Á­Uûn›¾ÃlÄLw^>Å'€§sìá¾ÆÝz „í>ȋ΢¼«¾Ê0?É2˜>ËÈz¯¥£ê¾ÍRW•„K>ÎÊbþÞM²¾ÐNôå9>н½¾ÑV­¿éV>ÑßÇ#‚¢¾ÒV*d,ï>ÒµýÍ÷¢¾Òùã¡ @~>Ó ¶Î·Œ¾Ó †1Çc²>Ò¸$E$–¾Ò¯-ìWK>ЫkÈh§Æ¾Ì|AgiP>ÃfZ•}ÿ^¾{°lá^Tù¾Õ±îòOç>öê°hT¿n`©A>ö¿ü5åù·¾Ô€®¨ÄiE¾¡"&(óN/>ÇÓwæot¾Ðïå ™íM>ÓÐ;‹¨ð¾ÕŽ4x(˜ÿ>ÖŸ;•»¾×<Ó.ù—>×…ª¶ò¾×Šóª]]Œ>×V¿'i[<¾Öï4üËX’>ÖXQƆA¾Õ”ç¯w~>Ô§:¦=Q'¾Ó‘dW¾0T>ÒU–õñÊT¾ÐöKMÈW°>ÎìÂ2¯¾Ë²j}°>ÈE_ru ë¾Ä®™qº>Àø82Ž£’¾ºZöfÖA¦>²µWz¶&×¾¦3î —§?>%v6!ÓÔ>ŒmÚИ¾¤¿GL£ >°´ñлR¾¶n—ŒF‘ˆ>»t@œ ¾¿¬† IQ}>Á€þRœŽ¾Â±||‡ >ÃaŒ<ÝV¾Ã8_uÿa>Ã3Öª)&¾ÂWãn¦œØ>Àÿ?á6K¾¾f„²_ ÿ>ºYëB’¾´ï #j-ù>®«7,ÓÞ—¾¢Àhý,ÍL>‰ð—>?™R>†ö9Xa›÷¾¡†/˜lY>¬xªâŽ¾³þ®ÑI>·-Óp½o¾ºSÄÀ±5,>¼l@ñ7s`¾½aï,+‘>½*Šy¨Ž¾»Å·áuÚç>¹AÐæˆ>¹¾µ·­j#ó>±LCCðJX¾¨^X¸© …>šd Eîö‚¾i'”_éös¾“ñê ¥Xˆ>¤æ}UKxN¾®°o¶Æ^ >³mùCg ò¾¶Î$êgB>¸dÈÖÄ£¾¹]@/õ>¸Njv‚¾¶PmOúX>³!ÖPÈ1 ¾­Ú½È-¤(>£Ú¦´oØ·¾‘£z€ºR¾tù]®…³J>››ÝÉg¾¨í–ž‘>°a¹o¼ø°¾³¯ÿ3þe>µ»å¶!û(¾¶b>±ñ¿>µ– Å3ÅI¾³b4kVƒ¯>¯Ó0„^澦ËK_á “>˜ŒÈ‚Ú}“¾_u"½÷¶X¾”˜ LØô›>¤ÄÒЇ,¾­ª0ä*g<>²*ùéJIû¾´"· f@ê>´”OIòо³t”×!н>°Öÿ–,&"¾©ÚSí³ ä> ¼Æ–…ྃîsæT3ݾ‰óŸO>¡3÷K@\¾ª‚–B*~å>°ÅÙl¾²ÖúÁ'0>³Fóç+ ¾²š/OØ>®jKÁ*Èþ¾¦´¡õ&J>—˜}mŽ¾O5b/(㾕 %ÜÕ”1>¥ IŒ™e¾­BJ;ÕÑ/>±Qä°!qC¾²TR=r™±>±Œ”ëÞ¾®Ûl…R2>¦¦Ž¸¾—ßûq°$>S?Iš_>•…)×vŠ¾¤ôx›~p>¬êGŸàž°ä5ï›dR>±‚Ð̱"Œ¾°<éÆE•È>ªf!UÐ(z¾¡p2êÀ >>ŠIt¯Œ6>ƒùg¬—ô뾟ç¦ø½É‹>© Oºïõ¾¯8êw"‡Ž>°ÞNþŠ&.¾°#:òähÕ>ªüàí±¾¢|1]ø>,9‰ >~É–fpûk¾ìò¾ú•Ð>¨/“ߙξ®ZCÆ ¢>°Ui‰üw¾®Ð9¿"—•>©pî;²¾ŸòÀ•œ$>ƒ…ÚaUC^>‹L‡óæk¾¡—=5‡¡×>©øhò£Z¾®Ñ ›&>¯tÿ¢\×¾«ÆC±£z¼>¤Aä{6±¾“Ýûú»¼¤¾l, $]>â>šZ§ö¾¦®Aa£Kú>¬åœ×úÏm¾®çò3#¿0>¬dzˆ‚X¾¥³ónÔº%>—Ö Þ–¾5æ¢`Ѿ–î̱8/>¥U¡»ÚŸ•¾«ëŽ|z>>®1£!ᾫÆC6'Ÿ^>¥ürg5о•õoöç@¾Y²k¢ýÈ>˜ËM»3”0¾¥þ-øùÆ7>¬TÕW…L¾­r´ìw9N>ª 6‰ä1¾¢[‰2º·>>Ž€„]>sÙWY𲾟/)#Äò†>¨'ä\b²¾¬‘â$?°>¬•Nº–ø¾¦³¶Ü3`÷>šÉp6öGȾl (d{Ë.¾”Y™þ^#>¤F矄¾ªºä2F6Î>¬] µ'©a¾¨ÝêUP> Öt„óq¾†õ—·«Õ쾉–ïÅô;>¡SN‘b¾©š,$ý>>«ø üp󾩥7R >¢s\¦>o¾Žõ9¬à4¾Å‹ ·­[>Ÿ}ÜvZd¾§÷F%|´>>«{1¥•H€¾©”{xçê4>¢¾)U|_¾Ò„Hˆz¾ ¸È± º>ŸF¹‚D ¹¾§Ï*¥ Í®>«;¨ø=¾¨Þ +´îr>¡w+ˆÌ¾Š¡æWõʾ‡9Ñ¿±O> å?J<¯¾¨iyÐ4¸h>ªÀ_N>¾§eZá5¦>žû·T¨¾{µŸº•¾‘±.·ßØ">£7n`“ü ¾©` _d>©ôi®‰j¾¤Î;ÀÍ€¥>–ß ýø>b‰iuÓ뾚-ÚúxÔá>¦šÛ†ˆ¸¾ªDÙ¡Æ%>¨užŽ$¾ šZèÛlF>…]~JQÿ>ŒŽ#- Ž¾¡òlNÅΉ>¨ŽÜü’ྩh©&+Æ>¤GY>-L¾”¸*â›.£¾p$!>ºÄ>›Ãoáü¸¾¦i9å¤Ú¾>©‡—¢ì&’¾¦vÌ…×>›à™-ù5»¾p$ÖôϾ”ÄÍ7j>¤5òYl¤û¾©æ.qæ>§™#oä¾ G¡jÝ>ƒˆ`â×?…>Ží5&-Ak¾¢_¨ÈIæ¢>¨TI4%/6¾¨¿I”7k>¡žÃÐþE¾Š’,žÇ¾ˆ)ߟ؄>¡#ÒtǬ¾§Àn¥gÖ>¨ èA¶ž#¾¢&Ú QÑ>‡ÜUâ>…X{WæÆŒ¾ ž9E–u5>§p.38k“¾§ó G*à>¡þÇB…’À¾Œ­Sozù¾†bÔÒŠF> ÑËädæʾ§j{€-_7>§Ž81¨¾¡-×qû\Í>ˆ(mð–>‹Ⳝ5ʾ¡¬øj7¡>§™ùÊ83¯¾¦Ý+^ÍŸÚ>ŸN<Fòo¾þ¯øv ᾑ‘@xm’>£ µ êoo¾§ÎÆÃ߶.>¥³v!o‹¾šž4¤=ª>`ßî·ìY>–ý½2ðx¾¤ª_ˆ”çp>§¿Íþ}˜í¾£ÑèÁ?Vä>” Ÿ?ö>uözgä⃾]/ÒêÛ>¦5Æ3 í¾§»ê> ñ»X ‘Ͼ†ÖzäˆwɾŒÿY¾ƒ>¡üuÓxF/¾§5£µÅXD>¥M3w&t‘¾™©á|—ÍU>I½pX .>˜H%€°Ÿ¾¤ä†À3Cì>§ŽØϾ¢qè€P¼>x¡¨vÇ°>†£ìg¬aƒ¾ âJ—ƒ|¯>¦»¬a;¾¥T`³ž>š5“wáÞ¾UÌffÏr´¾—æÆ㊈->¤¶†*¼i¾¦ÀG¬ëª?>¡d>£žÌ¾‰sì4Ýò¾Šóñ?½&;>¡ºÍÞܾ¦®°'ŒÑ>¤?ØÍK*¾–6cü¿À2¾kŽÊ¥Zâû>›îhÎ ß¾¥†…ÿN@&>¥Úˆ§Æ# ¾¥{Ö¢Y&>vVYÉÂÖ>”Y«×ؽ¾£¬}%϶“>¦uY<ñqu¾¡ÝæìÈ>Š–Cøa.>Š/qÌ,¾¡x4ôøÛ%>¦VÉÃäľ£s~iÕw>“–Ä7rë>z1c¾ËD¾ž_!§r±>¥Á@;¾¤¨¿çÌÖ>˜†g¾dZ>Nø,λ¾š ›ö!€¿>¤íÌÀÜ?ྥY>󞳦>œ<]êÇ-^¾mTPfäÓ¾–@á>¤ ?¬’¾¥¯;õ¨ñ>žå\§ää¾|±ƒHvn龓'  y>£8[ŸÃ¾¥Ëc±ÕG8> V:øfg ¾ƒd·á›â¾Ûyü׸í>¢t6Á–¾¥Ç1\@ÑL> ÛIá82¾†ùø/a¾ŽÓ÷ ”±c>¢!D¡`L4áE¾‡Ë j¡¾¬2W>¡ò¿Œ¾¥š“~‰´> úD˜Œ¯¾‡Q§pý?¾Ž9¼màˆ>¢’…©è,¾¥|á&*»ü> Ûë&ôã¾… m¶ê¾6—ì½;Ü>¢Pi|i¯¾¥U,)é>§>Ÿí8º.¤¾9ß«>Õ ¾’©Æ3Ž>¢ÍgSΦ¾¥6Çœö>ø×zYC¾w>HlR;“¾”§‰Í nÌ>£iR7$F辤°¹:|y>›E|‰¬–¾aMLWf&¶¾—ÍÑØ ´N>¤ ˜íd:[¾¤ CÞÒ¥s>—ºÑ^ñø>biþ´”›_œÇ勞>¤™"Îö'o¾£›Ô÷¯­>“?Ÿi~N4>~ v3nŽQ¾Ÿ$-÷0ó>¤ê‹}&WS¾¡ŽÑ¯¥G>‹‡.¿Ú>Š¦=†|µˆ¾¡hm¯<–>¤×1ÍcÕ¾Ÿ¦|Êd>}Ø{-Ùš>“…¢ÔW‚¾£Jx…*>¤2€fU4 ¾™”*ÓÏI¾ `R»%·>™Ãy]Ùž?¾¤-ž4?2>¢ÐÅ.øÈf¾’»¨R°¾€qŒ ýÎ>ŸœXçoúì[²> ŒÔ¢û~|¾…eàW†ì¾¡t—ú¢>¢@é&Xf6¾¤5$U˜è°>šžÐ–Ô"ɾRl4À#šX¾˜ÎâLgCd>£èñaej¾¢ž¶îÞ ¶>’/fæ Í>× ªÕ·e¾ éÜ© –>¤rwñ±~Þ¾Ÿ—BcÎy>€…b x>“&~ëßø¾¢Â)“EÈó>£’%B-gϾ—"ÜÉ`ʾjgº;ÄdÙ>œ:²Ë1¾¤-^Ä ±>¡ê(‘'b¾ˆÚÞ;Äá¾æ‚-M—¬>¡¾R!cûð¾£ãïƒ.Øò>™×ÔÖª`/¾ }Áÿ1\¾™À¢¨z>£Õùu~²¾¡¢2Ä0Ë>Öp?>‰ÉC2¬¡¾¡+8LgšØ>£æVeLØ’¾š¶¶ù[Cõ>R¦*[[ï>˜é½…Fµz¾£§“%M3>¡žøÝV«¾8С¸B;‰ÇÝs½<¬>¡%˜y>8¾£¼»G’m>™õ¶–`¾!±”t¶® ¾™¼ vÑ{>£«Óç¬î¾¡@99>‰d ëkÜ>µ3p©:о¡¢Gÿ0M>£^2(ĈD¾—’Ë/c,¾g‹óÑríÆ>œŸîæNk¾£Åàq>Ÿç¢q¦xù2þ¢š¸ñÉâÍ>“\8Â,€>ÌVÏÔ -¾ŸYaÍdõ>£­ Vª¾œØXQ°>gôA¦·¹>—§± g([¾£>ßÉÃ|¼>¡#dæ5”¢¾Š(q=„ª;¾2“²˜äW>¡€›«Dñ¾¢üJSí&`>•ÿù@\[>sÎ4Š Ž=¾i`s7Èõ>£±IRÊ‹¾2–1yý>rf[HºÎt>–LvÒª ¾¢ø}Ô(÷>¡5|Ë7“o¾Šû8Ò›Lv¾Œ„pØe¦Ö>¡akxUåE¾¢Ëû1p->•L]„š}>w_¨7½¹¾üØò¨yQ>£e¤i÷µL¾›½M€mÍ,>cÄ”´ôzÞ>˜ ªN$,D¾£^û=Š> U˜í  ¥¾„˜?‚8ó¾‘atfÐúÝ>¢C(°ɾ¢z˜‰ÜV>‘Y0áö>„¶.Øú ¾ TpXv^>¢øˆ˜ÏE—¾—nM¥‰S¾j~>r]·¦>œOV‰¬¾£;žw•¤€>œpÕmIƒ~¾kÙϹ¾—LMÍÛç>¢åT1¯½¾ ,5){€Æ>ƒ¢móÃk$>‘ä…7ò7¾¢q$Ï=¨>¡•ùà°º¾¦‡vÝ ¾ˆ¨_”}›!> ÐÒU ¾¢~ÒX¤>”™|àÑi>{3›âÓ`ྞ‹ŠVpæA>¢óÂäï<¾˜éûTÄ°¾Wa…ºžÃ>› »s“@¾£&Â7åˆ>œóí ã0¾l–7å0†B¾—F`NÈ>¢ÀkõÙÉš¾Ÿb\‚¨/>€r³$øñ>“eÌʈ¾¢9Ý.me> Ï ¹Ñ&¾ˆâ[›îFt¾ o‚Ѥï>¡}à+€v7¾¡¢5N7a>4q9±¶>‡³ð  ¾ wN® >¢3ã$'f¾“‚žfçg¾€J±Ç¯>ŸIÙw"¦õ¾¢Ž{6>–_>éu>sƒ{݃L¾?[^W›v>¢º“èü4l¾˜ÐÅ›.ì:ùN¾¢ÂÖÛ0 ë>šß•yDh²¾RîÌO~6©¾™(¿˜Lé>¢¯•%¦Ð;œ•,†^Sù>mÃEáãŽ>—:G“ƒ¾¢ˆ´= “ý>ûv—•'¾wÕ'9’Ã<¾•m+ùï>¢U-ÒWdj¾ŸFÇ˃Ñ>™NÄú.®>“ÊQ£8ñá¾¢;‘…}> x_²a¾ƒ¹©b‘$¾’WŠñXÞ3>¡ßYu¨¾ XþSŒÚÀ>…ÙÀ=9âU>‘=ýò`|¾¡¦PÙÍ¢> ›yËà뾈De}^¥¾q£Žºï>¡s@¹.ºê¾ Ë;×i >‰ÀÖzêx>ŽŠ é…µ‚¾¡H´s]º> ê‚ 7 羊ó JFYh¾d@n·êc>¡(xEq7¾ û¡ÐUl >‹¬PÃR‚>Œ³Þ=nb¾¡ªÑÏ > ÿ×¾¶q¾‹íîõí™;¾ŒxgÁ–qK>¡ ÈØÉ(¾ ÷ã$÷/Ö>‹»´ØT3>Œ°GÜ`¾¡ ¶Û%j> ãìøŒm꾋½r'º¾Xön,#>¡È{Þe£¾ ÃŽ¾' >ŠâRøwÐ>Žo2ƒK0¾¡3Æjý…> •Ü”d¾ˆyQõå̾íïÌ[{·>¡Sò%¾ ¦¾ YofÓîi>† I’$>èÇ夬¾¡z8 @Ž>  r€¯ü¾„*yBþ’r½â%>¡£B×Nɽ¾ŸYeI?>1m™/­‡>“PÔ2®¯+¾¡Ì[Þè’>žoaXD˜¾{¸ýºb1¾”¿-f?>¡ñÏó`a¾Ukqs½ñ>t'’¨þø>–Ln×Q-¾¢¨DîÌ>œÜÎÓ±+¾gd );–ì¾—ñj½Ì8/>¢ûs_G]¾š{ 0b¨È>Bú¡¹ü8>™¥¹’E3 ¾¢ƒ¡/¤>˜¯“õÙ1ð>_¹zÜ°ˆ¾›_£§%sø>¢í¢s‚¾–ž–ìùF¾r©‡eÉ{>îOõÕ¾¡Ï³hlcå>”D7ɾ>~6˜E¾<ù¾ž¶›wÂ`>¡x=UÄ%8¾‘±Ù‹Ÿ¾…&VCŒ%n> »(礂¾ ù UGË>Sü°—Ÿ>‹aøgè¾ ÆÚýéš> Lå Ç%Ô:£Ž»)¾Úæ@`Ük>¡Q¹ÄÄt¾žÞ,ž·¢¼>…óÌ5 ‘>”d{×ä±¾¡µ»ê>œ·[Fô \¾pYv.j=…¾—¢®$Öû>¡èv~ÜŠþk>'¡Îá.ì>šœéñÔ{¾¡ã©aÖ£q>—›ŸûVÇ>py=úÑÑľœ·^Œ­»ó>¡žÙöØ<.¾““º‹x¾€Õ0øÜCœ>ŸgŽO§¾¡´—!¨>Gâ`¾¬¯>‰}<¶EoI¾ ˆ€`Û;> :ná½+X¾†™d–„ؾ‘ÁYW>¡C†H˜„¾ž!ÚÎõh >zm3«zóÓ>•$Kî¦Ï¾¡²Ú†c”>›)Wÿ¾Z#Á£=†å¾˜í,Ʀ>¡ËSXþJ¦¾—‹]Œæeݾl5¯…ª8>œVBý´iľ¡ƒ¬ÞÖ™>“Oê’:†>…ø¤^…¾Ÿ6ËÁoØ,> Ô3zØ|‹¾op? t¾‹ÞÀÎ4> ·0‘þ꾟qÏ€æä>‚yÜ`ß‹ >’ç4igÕ|¾¡o Ûÿ‚c>œ^mïl¾l°ZQd0÷¾—€Ìh–Ñj>¡µwؤc ¾˜u^F…¶’¾bi©ïÂØ>›‘•ÔPp¾¡~÷€ì{¢>“æլóE>€…¨sAöþ¾žìèê]Ì> ÃÈ—³¾ŒÀîÿü«ü¾Œ5ð3±Ä> µg«…Ù徟³¾Ú>s>€ÙŽX^>“¡N¯úzܾ¡r¹Ê,7å>›lVg`ݾ`™n©¶¯¾˜žåÑû ì>¡žï3ôS¾–ØæóœÜwÔÊÒ¾¡.ó ݼÕ>‘a"ÚÌ‚¸>…÷ÿÿË/š¾ ŒAþw[> <¡Ú&W¾†XØEÁ0–¾‘5‹Gþ>¡$–æ°—¾œÕ¤ï]E>q¹Ôm9LK>–ágÁ\噾¡Æ¤¨>˜@*#ö«–>dιh*±r¾›»…ç,T™>¡IJÉÿéE¾’šs®’P‘¾ƒHw 3³z>Ÿƒ_â_^I¾ G†!/{>ˆ)‰F#3â>aåòL~º¾ ÿí>N•>‰Û ;H¾s¹äYfÿO¾–€î@µäþ>¡¡ ˜,¾˜K6¹è‹¾d]àÛdï=>›°†ßÔ£¾¡7ŠGážÅ>’JëTx>„G>3å&¾Ÿ¥¤æyš¯> ´|Χ¢¾†ªá¢ZEɾ‘X‹Œ<Ÿ>¡õ µâ¾œe’üé!T>mÐ-Î>—m ksNʾ¡w?4*÷>>—ÃñR×>pª>¦F^«¾œ¤s·ÖÈÕ> úAì/Ó쾋c[•¾‡àÓṮe> 5ß·®Âš¾Ÿ,‰Híõ>‚Úâ …¨>“*Rä”*J¾¡?¾äs¸4>š¬2w&µ"¾Nãæ£`Q¾™kòZ»†ù>¡XŸ×ŽÑ¾”£ B¶a©¾}/£Pê+>žP¹ªQ“U¾ v0Ðî)Ö>Š¸&VS>ŽfßU¡Êè¾ Á¶LVJ>9–« ؾtèK. R ¾–KE >¡at%½Ÿ¼¾—ÀÀY“f,¾jeÌñ£Õo>œ0^,/¾ öàD>Ȩ̀vé>‡iõ î$f¾ "•àYæt>žû&·¯ú!¾j“ÈðC$¾“v&±‰Îó>¡7¿ÏK W¾šÚ8hG=Ûu€6AùÝ>š Œ‘Ö¬þ¾¡4þ!}žB>“iò€#åó>Š¾ú,8¾žýã ªƒ> VE©}A¾†à‚=x…¾‘ %øÀÁ÷> öYc ¾›¶cK ö%>eKM(œô>˜<£3OÑû¾¡Kib°u@>•]¦AÊÖ8>y°Pg‰à¾Ó§Û­> p—ˆ–侊ý>±ÕNA¾Ž3­Rž> °‰P°Q¾œÛ,ô²„>rwè`ϧ>–Æ@ »d¾¡Kº¹O.Ä>–À –óQ>rœÇ&`ý¾œÞcm?#Ã> ©U„ ¾éå~?#»¾‹KùÊz> s!+ÕàC¾š(щE>x ˜™ä¹>•²(^ÑL ¾¡B°Ð¥s–>—©.W_K;>k{˜õñ¹¾œ+,Œ‹w> Ç¢‹I^à¾Ì}Í Ú¾‰\öŸIÞx> E»=žG–¾ž 3F>‰Ý>{ÇÅ2>•PFrÎô¾¡8OpPj@>˜,6^Š>eÖ„¸ ÃO¾›ÀjD˜> ÔwiÉ«"¾báÊA†ù¾ˆY!!ªö0> +Ûèß{y¾ž7±ÕÅ7À>} .Ñÿn>”³=ƒœçþ¾¡0Ì·»<=>˜W¦£b*§>cðS'ö:p¾›š±Óv > Ô+ÿ6'¾xd§œ¾ˆ.A[Á]Ç> %ñü>Žg¾ž/ ‡#%ý>|ÜÞ2ï>”½»j­[¾¡-q­ÎR±>˜6ÎV^>ek—ˉd¾›¶!,eRP> ÈÖ»Zè¾1Ɇ‹Œ)¾ˆÆÌaÔæ> 2+8$æ¾öÈß÷ è>{"yŽ‹ü¬>• 4‰l¾¡-bŸYê>—ÎÂáy*>iéýÈa* ¾œ áÈv> ²¯û« ¾0Xa"N*¾Š Þ> M#yÖ ¾û€¢¸%>xÄŸóÂp>•¶¹¬ø3Ž¾¡.NeŽö>—'9ó‘Úm>p†ZŒŠ5%¾œ‹zü¨¢> ²ÿ‹šþ¾fØ ~¢¾‹áþüûŸ,> rx z{¾œü3³è>s·¢4"˜ >–DkÄb2¾¡-,oS>–C”d(vN>u:$5òd¾/T±¿€³> a7¢tƒ~¾‹˜¶âÛ˜¾Ž1®C¦§ó> F%¾œ;B)ÚŸ>l­Îl. >—Ž¯àØy¾¡%þ”; u>•'‚Áhnþ>zà¡BËûë¾éxþðW> "\É`Ér¾ˆJ¤A‚ÂÔ¾p$2¾ƒ> È™üÊ©ò¾›MøWãE]>`ùüüôO>˜®5~q@¾¡µ¤†gì>“Ö„HoQÎ>€¥ñúy÷ ¾ž®iÛÆö>Ÿ¤Ÿlb¾…hvÙ}¾‘êÖòÙ/> ïЕn…!¾š3"k¥vá>/¸è ÿèz>™àfîí¼Ï¾ øãg(X>’RÿÃ~ÆZ>„+N^Ùz¾ŸtPm“>žÞß!«º¾vGËêç]¾“€Y›XÈ>¡ís J¢¾˜èßÚ±h¾[3Ü4»-J>›¦]ÚV¾ ËàvýŠø>—š/ Å›>ˆ«v"¾ P׸O`>å¹Rªy¾z¬õíÞȾ•:ÝÒ]<>¡"á]<ÝS¾—OÎ)Py¾oõð0uÛ>œƒ>rRl¾ W_“±ó>Œ‡#R€>1ÇÊ'_Y¾ –E•üÑ>œ«CµØð¾`ÙØ)ät…¾›ó|Jv³>£ßøxc±>ö¿ü5åù·¾Ô€®¨ÄiE¾¡"&(óN/>ÇÓwæot¾Ðïå ™íM>ÓÐ;‹¨ð¾ÕŽ4x(˜ÿ>ÖŸ;•»¾×<Ó.ù—>×…ª¶ò¾×Šóª]]Œ>×V¿'i[<¾Öï4üËX’>ÖXQƆA¾Õ”ç¯w~>Ô§:¦=Q'¾Ó‘dW¾0T>ÒU–õñÊT¾ÐöKMÈW°>ÎìÂ2¯¾Ë²j}°>ÈE_ru ë¾Ä®™qº>Àø82Ž£’¾ºZöfÖA¦>²µWz¶&×¾¦3î —§?>%v6!ÓÔ>ŒmÚИ¾¤¿GL£ >°´ñлR¾¶n—ŒF‘ˆ>»t@œ ¾¿¬† IQ}>Á€þRœŽ¾Â±||‡ >ÃaŒ<ÝV¾Ã8_uÿa>Ã3Öª)&¾ÂWãn¦œØ>Àÿ?á6K¾¾f„²_ ÿ>ºYëB’¾´ï #j-ù>®«7,ÓÞ—¾¢Àhý,ÍL>‰ð—>?™R>†ö9Xa›÷¾¡†/˜lY>¬xªâŽ¾³þ®ÑI>·-Óp½o¾ºSÄÀ±5,>¼l@ñ7s`¾½aï,+‘>½*Šy¨Ž¾»Å·áuÚç>¹AÐæˆ>¹¾µ·­j#ó>±LCCðJX¾¨^X¸© …>šd Eîö‚¾i'”_éös¾“ñê ¥Xˆ>¤æ}UKxN¾®°o¶Æ^ >³mùCg ò¾¶Î$êgB>¸dÈÖÄ£¾¹]@/õ>¸Njv‚¾¶PmOúX>³!ÖPÈ1 ¾­Ú½È-¤(>£Ú¦´oØ·¾‘£z€ºR¾tù]®…³J>››ÝÉg¾¨í–ž‘>°a¹o¼ø°¾³¯ÿ3þe>µ»å¶!û(¾¶b>±ñ¿>µ– Å3ÅI¾³b4kVƒ¯>¯Ó0„^澦ËK_á “>˜ŒÈ‚Ú}“¾_u"½÷¶X¾”˜ LØô›>¤ÄÒЇ,¾­ª0ä*g<>²*ùéJIû¾´"· f@ê>´”OIòо³t”×!н>°Öÿ–,&"¾©ÚSí³ ä> ¼Æ–…ྃîsæT3ݾ‰óŸO>¡3÷K@\¾ª‚–B*~å>°ÅÙl¾²ÖúÁ'0>³Fóç+ ¾²š/OØ>®jKÁ*Èþ¾¦´¡õ&J>—˜}mŽ¾O5b/(㾕 %ÜÕ”1>¥ IŒ™e¾­BJ;ÕÑ/>±Qä°!qC¾²TR=r™±>±Œ”ëÞ¾®Ûl…R2>¦¦Ž¸¾—ßûq°$>S?Iš_>•…)×vŠ¾¤ôx›~p>¬êGŸàž°ä5ï›dR>±‚Ð̱"Œ¾°<éÆE•È>ªf!UÐ(z¾¡p2êÀ >>ŠIt¯Œ6>ƒùg¬—ô뾟ç¦ø½É‹>© Oºïõ¾¯8êw"‡Ž>°ÞNþŠ&.¾°#:òähÕ>ªüàí±¾¢|1]ø>,9‰ >~É–fpûk¾ìò¾ú•Ð>¨/“ߙξ®ZCÆ ¢>°Ui‰üw¾®Ð9¿"—•>©pî;²¾ŸòÀ•œ$>ƒ…ÚaUC^>‹L‡óæk¾¡—=5‡¡×>©øhò£Z¾®Ñ ›&>¯tÿ¢\×¾«ÆC±£z¼>¤Aä{6±¾“Ýûú»¼¤¾l, $]>â>šZ§ö¾¦®Aa£Kú>¬åœ×úÏm¾®çò3#¿0>¬dzˆ‚X¾¥³ónÔº%>—Ö Þ–¾5æ¢`Ѿ–î̱8/>¥U¡»ÚŸ•¾«ëŽ|z>>®1£!ᾫÆC6'Ÿ^>¥ürg5о•õoöç@¾Y²k¢ýÈ>˜ËM»3”0¾¥þ-øùÆ7>¬TÕW…L¾­r´ìw9N>ª 6‰ä1¾¢[‰2º·>>Ž€„]>sÙWY𲾟/)#Äò†>¨'ä\b²¾¬‘â$?°>¬•Nº–ø¾¦³¶Ü3`÷>šÉp6öGȾl (d{Ë.¾”Y™þ^#>¤F矄¾ªºä2F6Î>¬] µ'©a¾¨ÝêUP> Öt„óq¾†õ—·«Õ쾉–ïÅô;>¡SN‘b¾©š,$ý>>«ø üp󾩥7R >¢s\¦>o¾Žõ9¬à4¾Å‹ ·­[>Ÿ}ÜvZd¾§÷F%|´>>«{1¥•H€¾©”{xçê4>¢¾)U|_¾Ò„Hˆz¾ ¸È± º>ŸF¹‚D ¹¾§Ï*¥ Í®>«;¨ø=¾¨Þ +´îr>¡w+ˆÌ¾Š¡æWõʾ‡9Ñ¿±O> å?J<¯¾¨iyÐ4¸h>ªÀ_N>¾§eZá5¦>žû·T¨¾{µŸº•¾‘±.·ßØ">£7n`“ü ¾©` _d>©ôi®‰j¾¤Î;ÀÍ€¥>–ß ýø>b‰iuÓ뾚-ÚúxÔá>¦šÛ†ˆ¸¾ªDÙ¡Æ%>¨užŽ$¾ šZèÛlF>…]~JQÿ>ŒŽ#- Ž¾¡òlNÅΉ>¨ŽÜü’ྩh©&+Æ>¤GY>-L¾”¸*â›.£¾p$!>ºÄ>›Ãoáü¸¾¦i9å¤Ú¾>©‡—¢ì&’¾¦vÌ…×>›à™-ù5»¾p$ÖôϾ”ÄÍ7j>¤5òYl¤û¾©æ.qæ>§™#oä¾ G¡jÝ>ƒˆ`â×?…>Ží5&-Ak¾¢_¨ÈIæ¢>¨TI4%/6¾¨¿I”7k>¡žÃÐþE¾Š’,žÇ¾ˆ)ߟ؄>¡#ÒtǬ¾§Àn¥gÖ>¨ èA¶ž#¾¢&Ú QÑ>‡ÜUâ>…X{WæÆŒ¾ ž9E–u5>§p.38k“¾§ó G*à>¡þÇB…’À¾Œ­Sozù¾†bÔÒŠF> ÑËädæʾ§j{€-_7>§Ž81¨¾¡-×qû\Í>ˆ(mð–>‹Ⳝ5ʾ¡¬øj7¡>§™ùÊ83¯¾¦Ý+^ÍŸÚ>ŸN<Fòo¾þ¯øv ᾑ‘@xm’>£ µ êoo¾§ÎÆÃ߶.>¥³v!o‹¾šž4¤=ª>`ßî·ìY>–ý½2ðx¾¤ª_ˆ”çp>§¿Íþ}˜í¾£ÑèÁ?Vä>” Ÿ?ö>uözgä⃾]/ÒêÛ>¦5Æ3 í¾§»ê> ñ»X ‘Ͼ†ÖzäˆwɾŒÿY¾ƒ>¡üuÓxF/¾§5£µÅXD>¥M3w&t‘¾™©á|—ÍU>I½pX .>˜H%€°Ÿ¾¤ä†À3Cì>§ŽØϾ¢qè€P¼>x¡¨vÇ°>†£ìg¬aƒ¾ âJ—ƒ|¯>¦»¬a;¾¥T`³ž>š5“wáÞ¾UÌffÏr´¾—æÆ㊈->¤¶†*¼i¾¦ÀG¬ëª?>¡d>£žÌ¾‰sì4Ýò¾Šóñ?½&;>¡ºÍÞܾ¦®°'ŒÑ>¤?ØÍK*¾–6cü¿À2¾kŽÊ¥Zâû>›îhÎ ß¾¥†…ÿN@&>¥Úˆ§Æ# ¾¥{Ö¢Y&>vVYÉÂÖ>”Y«×ؽ¾£¬}%϶“>¦uY<ñqu¾¡ÝæìÈ>Š–Cøa.>Š/qÌ,¾¡x4ôøÛ%>¦VÉÃäľ£s~iÕw>“–Ä7rë>z1c¾ËD¾ž_!§r±>¥Á@;¾¤¨¿çÌÖ>˜†g¾dZ>Nø,λ¾š ›ö!€¿>¤íÌÀÜ?ྥY>󞳦>œ<]êÇ-^¾mTPfäÓ¾–@á>¤ ?¬’¾¥¯;õ¨ñ>žå\§ää¾|±ƒHvn龓'  y>£8[ŸÃ¾¥Ëc±ÕG8> V:øfg ¾ƒd·á›â¾Ûyü׸í>¢t6Á–¾¥Ç1\@ÑL> ÛIá82¾†ùø/a¾ŽÓ÷ ”±c>¢!D¡`L4áE¾‡Ë j¡¾¬2W>¡ò¿Œ¾¥š“~‰´> úD˜Œ¯¾‡Q§pý?¾Ž9¼màˆ>¢’…©è,¾¥|á&*»ü> Ûë&ôã¾… m¶ê¾6—ì½;Ü>¢Pi|i¯¾¥U,)é>§>Ÿí8º.¤¾9ß«>Õ ¾’©Æ3Ž>¢ÍgSΦ¾¥6Çœö>ø×zYC¾w>HlR;“¾”§‰Í nÌ>£iR7$F辤°¹:|y>›E|‰¬–¾aMLWf&¶¾—ÍÑØ ´N>¤ ˜íd:[¾¤ CÞÒ¥s>—ºÑ^ñø>biþ´”›_œÇ勞>¤™"Îö'o¾£›Ô÷¯­>“?Ÿi~N4>~ v3nŽQ¾Ÿ$-÷0ó>¤ê‹}&WS¾¡ŽÑ¯¥G>‹‡.¿Ú>Š¦=†|µˆ¾¡hm¯<–>¤×1ÍcÕ¾Ÿ¦|Êd>}Ø{-Ùš>“…¢ÔW‚¾£Jx…*>¤2€fU4 ¾™”*ÓÏI¾ `R»%·>™Ãy]Ùž?¾¤-ž4?2>¢ÐÅ.øÈf¾’»¨R°¾€qŒ ýÎ>ŸœXçoúì[²> ŒÔ¢û~|¾…eàW†ì¾¡t—ú¢>¢@é&Xf6¾¤5$U˜è°>šžÐ–Ô"ɾRl4À#šX¾˜ÎâLgCd>£èñaej¾¢ž¶îÞ ¶>’/fæ Í>× ªÕ·e¾ éÜ© –>¤rwñ±~Þ¾Ÿ—BcÎy>€…b x>“&~ëßø¾¢Â)“EÈó>£’%B-gϾ—"ÜÉ`ʾjgº;ÄdÙ>œ:²Ë1¾¤-^Ä ±>¡ê(‘'b¾ˆÚÞ;Äá¾æ‚-M—¬>¡¾R!cûð¾£ãïƒ.Øò>™×ÔÖª`/¾ }Áÿ1\¾™À¢¨z>£Õùu~²¾¡¢2Ä0Ë>Öp?>‰ÉC2¬¡¾¡+8LgšØ>£æVeLØ’¾š¶¶ù[Cõ>R¦*[[ï>˜é½…Fµz¾£§“%M3>¡žøÝV«¾8С¸B;‰ÇÝs½<¬>¡%˜y>8¾£¼»G’m>™õ¶–`¾!±”t¶® ¾™¼ vÑ{>£«Óç¬î¾¡@99>‰d ëkÜ>µ3p©:о¡¢Gÿ0M>£^2(ĈD¾—’Ë/c,¾g‹óÑríÆ>œŸîæNk¾£Åàq>Ÿç¢q¦xù2þ¢š¸ñÉâÍ>“\8Â,€>ÌVÏÔ -¾ŸYaÍdõ>£­ Vª¾œØXQ°>gôA¦·¹>—§± g([¾£>ßÉÃ|¼>¡#dæ5”¢¾Š(q=„ª;¾2“²˜äW>¡€›«Dñ¾¢üJSí&`>•ÿù@\[>sÎ4Š Ž=¾i`s7Èõ>£±IRÊ‹¾2–1yý>rf[HºÎt>–LvÒª ¾¢ø}Ô(÷>¡5|Ë7“o¾Šû8Ò›Lv¾Œ„pØe¦Ö>¡akxUåE¾¢Ëû1p->•L]„š}>w_¨7½¹¾üØò¨yQ>£e¤i÷µL¾›½M€mÍ,>cÄ”´ôzÞ>˜ ªN$,D¾£^û=Š> U˜í  ¥¾„˜?‚8ó¾‘atfÐúÝ>¢C(°ɾ¢z˜‰ÜV>‘Y0áö>„¶.Øú ¾ TpXv^>¢øˆ˜ÏE—¾—nM¥‰S¾j~>r]·¦>œOV‰¬¾£;žw•¤€>œpÕmIƒ~¾kÙϹ¾—LMÍÛç>¢åT1¯½¾ ,5){€Æ>ƒ¢móÃk$>‘ä…7ò7¾¢q$Ï=¨>¡•ùà°º¾¦‡vÝ ¾ˆ¨_”}›!> ÐÒU ¾¢~ÒX¤>”™|àÑi>{3›âÓ`ྞ‹ŠVpæA>¢óÂäï<¾˜éûTÄ°¾Wa…ºžÃ>› »s“@¾£&Â7åˆ>œóí ã0¾l–7å0†B¾—F`NÈ>¢ÀkõÙÉš¾Ÿb\‚¨/>€r³$øñ>“eÌʈ¾¢9Ý.me> Ï ¹Ñ&¾ˆâ[›îFt¾ o‚Ѥï>¡}à+€v7¾¡¢5N7a>4q9±¶>‡³ð  ¾ wN® >¢3ã$'f¾“‚žfçg¾€J±Ç¯>ŸIÙw"¦õ¾¢Ž{6>–_>éu>sƒ{݃L¾?[^W›v>¢º“èü4l¾˜ÐÅ›.ì:ùN¾¢ÂÖÛ0 ë>šß•yDh²¾RîÌO~6©¾™(¿˜Lé>¢¯•%¦Ð;œ•,†^Sù>mÃEáãŽ>—:G“ƒ¾¢ˆ´= “ý>ûv—•'¾wÕ'9’Ã<¾•m+ùï>¢U-ÒWdj¾ŸFÇ˃Ñ>™NÄú.®>“ÊQ£8ñá¾¢;‘…}> x_²a¾ƒ¹©b‘$¾’WŠñXÞ3>¡ßYu¨¾ XþSŒÚÀ>…ÙÀ=9âU>‘=ýò`|¾¡¦PÙÍ¢> ›yËà뾈De}^¥¾q£Žºï>¡s@¹.ºê¾ Ë;×i >‰ÀÖzêx>ŽŠ é…µ‚¾¡H´s]º> ê‚ 7 羊ó JFYh¾d@n·êc>¡(xEq7¾ û¡ÐUl >‹¬PÃR‚>Œ³Þ=nb¾¡ªÑÏ > ÿ×¾¶q¾‹íîõí™;¾ŒxgÁ–qK>¡ ÈØÉ(¾ ÷ã$÷/Ö>‹»´ØT3>Œ°GÜ`¾¡ ¶Û%j> ãìøŒm꾋½r'º¾Xön,#>¡È{Þe£¾ ÃŽ¾' >ŠâRøwÐ>Žo2ƒK0¾¡3Æjý…> •Ü”d¾ˆyQõå̾íïÌ[{·>¡Sò%¾ ¦¾ YofÓîi>† I’$>èÇ夬¾¡z8 @Ž>  r€¯ü¾„*yBþ’r½â%>¡£B×Nɽ¾ŸYeI?>1m™/­‡>“PÔ2®¯+¾¡Ì[Þè’>žoaXD˜¾{¸ýºb1¾”¿-f?>¡ñÏó`a¾Ukqs½ñ>t'’¨þø>–Ln×Q-¾¢¨DîÌ>œÜÎÓ±+¾gd );–ì¾—ñj½Ì8/>¢ûs_G]¾š{ 0b¨È>Bú¡¹ü8>™¥¹’E3 ¾¢ƒ¡/¤>˜¯“õÙ1ð>_¹zÜ°ˆ¾›_£§%sø>¢í¢s‚¾–ž–ìùF¾r©‡eÉ{>îOõÕ¾¡Ï³hlcå>”D7ɾ>~6˜E¾<ù¾ž¶›wÂ`>¡x=UÄ%8¾‘±Ù‹Ÿ¾…&VCŒ%n> »(礂¾ ù UGË>Sü°—Ÿ>‹aøgè¾ ÆÚýéš> Lå Ç%Ô:£Ž»)¾Úæ@`Ük>¡Q¹ÄÄt¾žÞ,ž·¢¼>…óÌ5 ‘>”d{×ä±¾¡µ»ê>œ·[Fô \¾pYv.j=…¾—¢®$Öû>¡èv~ÜŠþk>'¡Îá.ì>šœéñÔ{¾¡ã©aÖ£q>—›ŸûVÇ>py=úÑÑľœ·^Œ­»ó>¡žÙöØ<.¾““º‹x¾€Õ0øÜCœ>ŸgŽO§¾¡´—!¨>Gâ`¾¬¯>‰}<¶EoI¾ ˆ€`Û;> :ná½+X¾†™d–„ؾ‘ÁYW>¡C†H˜„¾ž!ÚÎõh >zm3«zóÓ>•$Kî¦Ï¾¡²Ú†c”>›)Wÿ¾Z#Á£=†å¾˜í,Ʀ>¡ËSXþJ¦¾—‹]Œæeݾl5¯…ª8>œVBý´iľ¡ƒ¬ÞÖ™>“Oê’:†>…ø¤^…¾Ÿ6ËÁoØ,> Ô3zØ|‹¾op? t¾‹ÞÀÎ4> ·0‘þ꾟qÏ€æä>‚yÜ`ß‹ >’ç4igÕ|¾¡o Ûÿ‚c>œ^mïl¾l°ZQd0÷¾—€Ìh–Ñj>¡µwؤc ¾˜u^F…¶’¾bi©ïÂØ>›‘•ÔPp¾¡~÷€ì{¢>“æլóE>€…¨sAöþ¾žìèê]Ì> ÃÈ—³¾ŒÀîÿü«ü¾Œ5ð3±Ä> µg«…Ù徟³¾Ú>s>€ÙŽX^>“¡N¯úzܾ¡r¹Ê,7å>›lVg`ݾ`™n©¶¯¾˜žåÑû ì>¡žï3ôS¾–ØæóœÜwÔÊÒ¾¡.ó ݼÕ>‘a"ÚÌ‚¸>…÷ÿÿË/š¾ ŒAþw[> <¡Ú&W¾†XØEÁ0–¾‘5‹Gþ>¡$–æ°—¾œÕ¤ï]E>q¹Ôm9LK>–ágÁ\噾¡Æ¤¨>˜@*#ö«–>dιh*±r¾›»…ç,T™>¡IJÉÿéE¾’šs®’P‘¾ƒHw 3³z>Ÿƒ_â_^I¾ G†!/{>ˆ)‰F#3â>aåòL~º¾ ÿí>N•>‰Û ;H¾s¹äYfÿO¾–€î@µäþ>¡¡ ˜,¾˜K6¹è‹¾d]àÛdï=>›°†ßÔ£¾¡7ŠGážÅ>’JëTx>„G>3å&¾Ÿ¥¤æyš¯> ´|Χ¢¾†ªá¢ZEɾ‘X‹Œ<Ÿ>¡õ µâ¾œe’üé!T>mÐ-Î>—m ksNʾ¡w?4*÷>>—ÃñR×>pª>¦F^«¾œ¤s·ÖÈÕ> úAì/Ó쾋c[•¾‡àÓṮe> 5ß·®Âš¾Ÿ,‰Híõ>‚Úâ …¨>“*Rä”*J¾¡?¾äs¸4>š¬2w&µ"¾Nãæ£`Q¾™kòZ»†ù>¡XŸ×ŽÑ¾”£ B¶a©¾}/£Pê+>žP¹ªQ“U¾ v0Ðî)Ö>Š¸&VS>ŽfßU¡Êè¾ Á¶LVJ>9–« ؾtèK. R ¾–KE >¡at%½Ÿ¼¾—ÀÀY“f,¾jeÌñ£Õo>œ0^,/¾ öàD>Ȩ̀vé>‡iõ î$f¾ "•àYæt>žû&·¯ú!¾j“ÈðC$¾“v&±‰Îó>¡7¿ÏK W¾šÚ8hG=Ûu€6AùÝ>š Œ‘Ö¬þ¾¡4þ!}žB>“iò€#åó>Š¾ú,8¾žýã ªƒ> VE©}A¾†à‚=x…¾‘ %øÀÁ÷> öYc ¾›¶cK ö%>eKM(œô>˜<£3OÑû¾¡Kib°u@>•]¦AÊÖ8>y°Pg‰à¾Ó§Û­> p—ˆ–侊ý>±ÕNA¾Ž3­Rž> °‰P°Q¾œÛ,ô²„>rwè`ϧ>–Æ@ »d¾¡Kº¹O.Ä>–À –óQ>rœÇ&`ý¾œÞcm?#Ã> ©U„ ¾éå~?#»¾‹KùÊz> s!+ÕàC¾š(щE>x ˜™ä¹>•²(^ÑL ¾¡B°Ð¥s–>—©.W_K;>k{˜õñ¹¾œ+,Œ‹w> Ç¢‹I^à¾Ì}Í Ú¾‰\öŸIÞx> E»=žG–¾ž 3F>‰Ý>{ÇÅ2>•PFrÎô¾¡8OpPj@>˜,6^Š>eÖ„¸ ÃO¾›ÀjD˜> ÔwiÉ«"¾báÊA†ù¾ˆY!!ªö0> +Ûèß{y¾ž7±ÕÅ7À>} .Ñÿn>”³=ƒœçþ¾¡0Ì·»<=>˜W¦£b*§>cðS'ö:p¾›š±Óv > Ô+ÿ6'¾xd§œ¾ˆ.A[Á]Ç> %ñü>Žg¾ž/ ‡#%ý>|ÜÞ2ï>”½»j­[¾¡-q­ÎR±>˜6ÎV^>ek—ˉd¾›¶!,eRP> ÈÖ»Zè¾1Ɇ‹Œ)¾ˆÆÌaÔæ> 2+8$æ¾öÈß÷ è>{"yŽ‹ü¬>• 4‰l¾¡-bŸYê>—ÎÂáy*>iéýÈa* ¾œ áÈv> ²¯û« ¾0Xa"N*¾Š Þ> M#yÖ ¾û€¢¸%>xÄŸóÂp>•¶¹¬ø3Ž¾¡.NeŽö>—'9ó‘Úm>p†ZŒŠ5%¾œ‹zü¨¢> ²ÿ‹šþ¾fØ ~¢¾‹áþüûŸ,> rx z{¾œü3³è>s·¢4"˜ >–DkÄb2¾¡-,oS>–C”d(vN>u:$5òd¾/T±¿€³> a7¢tƒ~¾‹˜¶âÛ˜¾Ž1®C¦§ó> F%¾œ;B)ÚŸ>l­Îl. >—Ž¯àØy¾¡%þ”; u>•'‚Áhnþ>zà¡BËûë¾éxþðW> "\É`Ér¾ˆJ¤A‚ÂÔ¾p$2¾ƒ> È™üÊ©ò¾›MøWãE]>`ùüüôO>˜®5~q@¾¡µ¤†gì>“Ö„HoQÎ>€¥ñúy÷ ¾ž®iÛÆö>Ÿ¤Ÿlb¾…hvÙ}¾‘êÖòÙ/> ïЕn…!¾š3"k¥vá>/¸è ÿèz>™àfîí¼Ï¾ øãg(X>’RÿÃ~ÆZ>„+N^Ùz¾ŸtPm“>žÞß!«º¾vGËêç]¾“€Y›XÈ>¡ís J¢¾˜èßÚ±h¾[3Ü4»-J>›¦]ÚV¾ ËàvýŠø>—š/ Å›>ˆ«v"¾ P׸O`>å¹Rªy¾z¬õíÞȾ•:ÝÒ]<>¡"á]<ÝS¾—OÎ)Py¾oõð0uÛ>œƒ>rRl¾ W_“±ó>Œ‡#R€>1ÇÊ'_Y¾ –E•üÑ>œ«CµØð¾`ÙØ)ät…¾›ó|Jv³>£ßøxc±>ö¿ü5åù·¾Ô€®¨ÄiE¾¡"&(óN/>ÇÓwæot¾Ðïå ™íM>ÓÐ;‹¨ð¾ÕŽ4x(˜ÿ>ÖŸ;•»¾×<Ó.ù—>×…ª¶ò¾×Šóª]]Œ>×V¿'i[<¾Öï4üËX’>ÖXQƆA¾Õ”ç¯w~>Ô§:¦=Q'¾Ó‘dW¾0T>ÒU–õñÊT¾ÐöKMÈW°>ÎìÂ2¯¾Ë²j}°>ÈE_ru ë¾Ä®™qº>Àø82Ž£’¾ºZöfÖA¦>²µWz¶&×¾¦3î —§?>%v6!ÓÔ>ŒmÚИ¾¤¿GL£ >°´ñлR¾¶n—ŒF‘ˆ>»t@œ ¾¿¬† IQ}>Á€þRœŽ¾Â±||‡ >ÃaŒ<ÝV¾Ã8_uÿa>Ã3Öª)&¾ÂWãn¦œØ>Àÿ?á6K¾¾f„²_ ÿ>ºYëB’¾´ï #j-ù>®«7,ÓÞ—¾¢Àhý,ÍL>‰ð—>?™R>†ö9Xa›÷¾¡†/˜lY>¬xªâŽ¾³þ®ÑI>·-Óp½o¾ºSÄÀ±5,>¼l@ñ7s`¾½aï,+‘>½*Šy¨Ž¾»Å·áuÚç>¹AÐæˆ>¹¾µ·­j#ó>±LCCðJX¾¨^X¸© …>šd Eîö‚¾i'”_éös¾“ñê ¥Xˆ>¤æ}UKxN¾®°o¶Æ^ >³mùCg ò¾¶Î$êgB>¸dÈÖÄ£¾¹]@/õ>¸Njv‚¾¶PmOúX>³!ÖPÈ1 ¾­Ú½È-¤(>£Ú¦´oØ·¾‘£z€ºR¾tù]®…³J>››ÝÉg¾¨í–ž‘>°a¹o¼ø°¾³¯ÿ3þe>µ»å¶!û(¾¶b>±ñ¿>µ– Å3ÅI¾³b4kVƒ¯>¯Ó0„^澦ËK_á “>˜ŒÈ‚Ú}“¾_u"½÷¶X¾”˜ LØô›>¤ÄÒЇ,¾­ª0ä*g<>²*ùéJIû¾´"· f@ê>´”OIòо³t”×!н>°Öÿ–,&"¾©ÚSí³ ä> ¼Æ–…ྃîsæT3ݾ‰óŸO>¡3÷K@\¾ª‚–B*~å>°ÅÙl¾²ÖúÁ'0>³Fóç+ ¾²š/OØ>®jKÁ*Èþ¾¦´¡õ&J>—˜}mŽ¾O5b/(㾕 %ÜÕ”1>¥ IŒ™e¾­BJ;ÕÑ/>±Qä°!qC¾²TR=r™±>±Œ”ëÞ¾®Ûl…R2>¦¦Ž¸¾—ßûq°$>S?Iš_>•…)×vŠ¾¤ôx›~p>¬êGŸàž°ä5ï›dR>±‚Ð̱"Œ¾°<éÆE•È>ªf!UÐ(z¾¡p2êÀ >>ŠIt¯Œ6>ƒùg¬—ô뾟ç¦ø½É‹>© Oºïõ¾¯8êw"‡Ž>°ÞNþŠ&.¾°#:òähÕ>ªüàí±¾¢|1]ø>,9‰ >~É–fpûk¾ìò¾ú•Ð>¨/“ߙξ®ZCÆ ¢>°Ui‰üw¾®Ð9¿"—•>©pî;²¾ŸòÀ•œ$>ƒ…ÚaUC^>‹L‡óæk¾¡—=5‡¡×>©øhò£Z¾®Ñ ›&>¯tÿ¢\×¾«ÆC±£z¼>¤Aä{6±¾“Ýûú»¼¤¾l, $]>â>šZ§ö¾¦®Aa£Kú>¬åœ×úÏm¾®çò3#¿0>¬dzˆ‚X¾¥³ónÔº%>—Ö Þ–¾5æ¢`Ѿ–î̱8/>¥U¡»ÚŸ•¾«ëŽ|z>>®1£!ᾫÆC6'Ÿ^>¥ürg5о•õoöç@¾Y²k¢ýÈ>˜ËM»3”0¾¥þ-øùÆ7>¬TÕW…L¾­r´ìw9N>ª 6‰ä1¾¢[‰2º·>>Ž€„]>sÙWY𲾟/)#Äò†>¨'ä\b²¾¬‘â$?°>¬•Nº–ø¾¦³¶Ü3`÷>šÉp6öGȾl (d{Ë.¾”Y™þ^#>¤F矄¾ªºä2F6Î>¬] µ'©a¾¨ÝêUP> Öt„óq¾†õ—·«Õ쾉–ïÅô;>¡SN‘b¾©š,$ý>>«ø üp󾩥7R >¢s\¦>o¾Žõ9¬à4¾Å‹ ·­[>Ÿ}ÜvZd¾§÷F%|´>>«{1¥•H€¾©”{xçê4>¢¾)U|_¾Ò„Hˆz¾ ¸È± º>ŸF¹‚D ¹¾§Ï*¥ Í®>«;¨ø=¾¨Þ +´îr>¡w+ˆÌ¾Š¡æWõʾ‡9Ñ¿±O> å?J<¯¾¨iyÐ4¸h>ªÀ_N>¾§eZá5¦>žû·T¨¾{µŸº•¾‘±.·ßØ">£7n`“ü ¾©` _d>©ôi®‰j¾¤Î;ÀÍ€¥>–ß ýø>b‰iuÓ뾚-ÚúxÔá>¦šÛ†ˆ¸¾ªDÙ¡Æ%>¨užŽ$¾ šZèÛlF>…]~JQÿ>ŒŽ#- Ž¾¡òlNÅΉ>¨ŽÜü’ྩh©&+Æ>¤GY>-L¾”¸*â›.£¾p$!>ºÄ>›Ãoáü¸¾¦i9å¤Ú¾>©‡—¢ì&’¾¦vÌ…×>›à™-ù5»¾p$ÖôϾ”ÄÍ7j>¤5òYl¤û¾©æ.qæ>§™#oä¾ G¡jÝ>ƒˆ`â×?…>Ží5&-Ak¾¢_¨ÈIæ¢>¨TI4%/6¾¨¿I”7k>¡žÃÐþE¾Š’,žÇ¾ˆ)ߟ؄>¡#ÒtǬ¾§Àn¥gÖ>¨ èA¶ž#¾¢&Ú QÑ>‡ÜUâ>…X{WæÆŒ¾ ž9E–u5>§p.38k“¾§ó G*à>¡þÇB…’À¾Œ­Sozù¾†bÔÒŠF> ÑËädæʾ§j{€-_7>§Ž81¨¾¡-×qû\Í>ˆ(mð–>‹Ⳝ5ʾ¡¬øj7¡>§™ùÊ83¯¾¦Ý+^ÍŸÚ>ŸN<Fòo¾þ¯øv ᾑ‘@xm’>£ µ êoo¾§ÎÆÃ߶.>¥³v!o‹¾šž4¤=ª>`ßî·ìY>–ý½2ðx¾¤ª_ˆ”çp>§¿Íþ}˜í¾£ÑèÁ?Vä>” Ÿ?ö>uözgä⃾]/ÒêÛ>¦5Æ3 í¾§»ê> ñ»X ‘Ͼ†ÖzäˆwɾŒÿY¾ƒ>¡üuÓxF/¾§5£µÅXD>¥M3w&t‘¾™©á|—ÍU>I½pX .>˜H%€°Ÿ¾¤ä†À3Cì>§ŽØϾ¢qè€P¼>x¡¨vÇ°>†£ìg¬aƒ¾ âJ—ƒ|¯>¦»¬a;¾¥T`³ž>š5“wáÞ¾UÌffÏr´¾—æÆ㊈->¤¶†*¼i¾¦ÀG¬ëª?>¡d>£žÌ¾‰sì4Ýò¾Šóñ?½&;>¡ºÍÞܾ¦®°'ŒÑ>¤?ØÍK*¾–6cü¿À2¾kŽÊ¥Zâû>›îhÎ ß¾¥†…ÿN@&>¥Úˆ§Æ# ¾¥{Ö¢Y&>vVYÉÂÖ>”Y«×ؽ¾£¬}%϶“>¦uY<ñqu¾¡ÝæìÈ>Š–Cøa.>Š/qÌ,¾¡x4ôøÛ%>¦VÉÃäľ£s~iÕw>“–Ä7rë>z1c¾ËD¾ž_!§r±>¥Á@;¾¤¨¿çÌÖ>˜†g¾dZ>Nø,λ¾š ›ö!€¿>¤íÌÀÜ?ྥY>󞳦>œ<]êÇ-^¾mTPfäÓ¾–@á>¤ ?¬’¾¥¯;õ¨ñ>žå\§ää¾|±ƒHvn龓'  y>£8[ŸÃ¾¥Ëc±ÕG8> V:øfg ¾ƒd·á›â¾Ûyü׸í>¢t6Á–¾¥Ç1\@ÑL> ÛIá82¾†ùø/a¾ŽÓ÷ ”±c>¢!D¡`L4áE¾‡Ë j¡¾¬2W>¡ò¿Œ¾¥š“~‰´> úD˜Œ¯¾‡Q§pý?¾Ž9¼màˆ>¢’…©è,¾¥|á&*»ü> Ûë&ôã¾… m¶ê¾6—ì½;Ü>¢Pi|i¯¾¥U,)é>§>Ÿí8º.¤¾9ß«>Õ ¾’©Æ3Ž>¢ÍgSΦ¾¥6Çœö>ø×zYC¾w>HlR;“¾”§‰Í nÌ>£iR7$F辤°¹:|y>›E|‰¬–¾aMLWf&¶¾—ÍÑØ ´N>¤ ˜íd:[¾¤ CÞÒ¥s>—ºÑ^ñø>biþ´”›_œÇ勞>¤™"Îö'o¾£›Ô÷¯­>“?Ÿi~N4>~ v3nŽQ¾Ÿ$-÷0ó>¤ê‹}&WS¾¡ŽÑ¯¥G>‹‡.¿Ú>Š¦=†|µˆ¾¡hm¯<–>¤×1ÍcÕ¾Ÿ¦|Êd>}Ø{-Ùš>“…¢ÔW‚¾£Jx…*>¤2€fU4 ¾™”*ÓÏI¾ `R»%·>™Ãy]Ùž?¾¤-ž4?2>¢ÐÅ.øÈf¾’»¨R°¾€qŒ ýÎ>ŸœXçoúì[²> ŒÔ¢û~|¾…eàW†ì¾¡t—ú¢>¢@é&Xf6¾¤5$U˜è°>šžÐ–Ô"ɾRl4À#šX¾˜ÎâLgCd>£èñaej¾¢ž¶îÞ ¶>’/fæ Í>× ªÕ·e¾ éÜ© –>¤rwñ±~Þ¾Ÿ—BcÎy>€…b x>“&~ëßø¾¢Â)“EÈó>£’%B-gϾ—"ÜÉ`ʾjgº;ÄdÙ>œ:²Ë1¾¤-^Ä ±>¡ê(‘'b¾ˆÚÞ;Äá¾æ‚-M—¬>¡¾R!cûð¾£ãïƒ.Øò>™×ÔÖª`/¾ }Áÿ1\¾™À¢¨z>£Õùu~²¾¡¢2Ä0Ë>Öp?>‰ÉC2¬¡¾¡+8LgšØ>£æVeLØ’¾š¶¶ù[Cõ>R¦*[[ï>˜é½…Fµz¾£§“%M3>¡žøÝV«¾8С¸B;‰ÇÝs½<¬>¡%˜y>8¾£¼»G’m>™õ¶–`¾!±”t¶® ¾™¼ vÑ{>£«Óç¬î¾¡@99>‰d ëkÜ>µ3p©:о¡¢Gÿ0M>£^2(ĈD¾—’Ë/c,¾g‹óÑríÆ>œŸîæNk¾£Åàq>Ÿç¢q¦xù2þ¢š¸ñÉâÍ>“\8Â,€>ÌVÏÔ -¾ŸYaÍdõ>£­ Vª¾œØXQ°>gôA¦·¹>—§± g([¾£>ßÉÃ|¼>¡#dæ5”¢¾Š(q=„ª;¾2“²˜äW>¡€›«Dñ¾¢üJSí&`>•ÿù@\[>sÎ4Š Ž=¾i`s7Èõ>£±IRÊ‹¾2–1yý>rf[HºÎt>–LvÒª ¾¢ø}Ô(÷>¡5|Ë7“o¾Šû8Ò›Lv¾Œ„pØe¦Ö>¡akxUåE¾¢Ëû1p->•L]„š}>w_¨7½¹¾üØò¨yQ>£e¤i÷µL¾›½M€mÍ,>cÄ”´ôzÞ>˜ ªN$,D¾£^û=Š> U˜í  ¥¾„˜?‚8ó¾‘atfÐúÝ>¢C(°ɾ¢z˜‰ÜV>‘Y0áö>„¶.Øú ¾ TpXv^>¢øˆ˜ÏE—¾—nM¥‰S¾j~>r]·¦>œOV‰¬¾£;žw•¤€>œpÕmIƒ~¾kÙϹ¾—LMÍÛç>¢åT1¯½¾ ,5){€Æ>ƒ¢móÃk$>‘ä…7ò7¾¢q$Ï=¨>¡•ùà°º¾¦‡vÝ ¾ˆ¨_”}›!> ÐÒU ¾¢~ÒX¤>”™|àÑi>{3›âÓ`ྞ‹ŠVpæA>¢óÂäï<¾˜éûTÄ°¾Wa…ºžÃ>› »s“@¾£&Â7åˆ>œóí ã0¾l–7å0†B¾—F`NÈ>¢ÀkõÙÉš¾Ÿb\‚¨/>€r³$øñ>“eÌʈ¾¢9Ý.me> Ï ¹Ñ&¾ˆâ[›îFt¾ o‚Ѥï>¡}à+€v7¾¡¢5N7a>4q9±¶>‡³ð  ¾ wN® >¢3ã$'f¾“‚žfçg¾€J±Ç¯>ŸIÙw"¦õ¾¢Ž{6>–_>éu>sƒ{݃L¾?[^W›v>¢º“èü4l¾˜ÐÅ›.ì:ùN¾¢ÂÖÛ0 ë>šß•yDh²¾RîÌO~6©¾™(¿˜Lé>¢¯•%¦Ð;œ•,†^Sù>mÃEáãŽ>—:G“ƒ¾¢ˆ´= “ý>ûv—•'¾wÕ'9’Ã<¾•m+ùï>¢U-ÒWdj¾ŸFÇ˃Ñ>™NÄú.®>“ÊQ£8ñá¾¢;‘…}> x_²a¾ƒ¹©b‘$¾’WŠñXÞ3>¡ßYu¨¾ XþSŒÚÀ>…ÙÀ=9âU>‘=ýò`|¾¡¦PÙÍ¢> ›yËà뾈De}^¥¾q£Žºï>¡s@¹.ºê¾ Ë;×i >‰ÀÖzêx>ŽŠ é…µ‚¾¡H´s]º> ê‚ 7 羊ó JFYh¾d@n·êc>¡(xEq7¾ û¡ÐUl >‹¬PÃR‚>Œ³Þ=nb¾¡ªÑÏ > ÿ×¾¶q¾‹íîõí™;¾ŒxgÁ–qK>¡ ÈØÉ(¾ ÷ã$÷/Ö>‹»´ØT3>Œ°GÜ`¾¡ ¶Û%j> ãìøŒm꾋½r'º¾Xön,#>¡È{Þe£¾ ÃŽ¾' >ŠâRøwÐ>Žo2ƒK0¾¡3Æjý…> •Ü”d¾ˆyQõå̾íïÌ[{·>¡Sò%¾ ¦¾ YofÓîi>† I’$>èÇ夬¾¡z8 @Ž>  r€¯ü¾„*yBþ’r½â%>¡£B×Nɽ¾ŸYeI?>1m™/­‡>“PÔ2®¯+¾¡Ì[Þè’>žoaXD˜¾{¸ýºb1¾”¿-f?>¡ñÏó`a¾Ukqs½ñ>t'’¨þø>–Ln×Q-¾¢¨DîÌ>œÜÎÓ±+¾gd );–ì¾—ñj½Ì8/>¢ûs_G]¾š{ 0b¨È>Bú¡¹ü8>™¥¹’E3 ¾¢ƒ¡/¤>˜¯“õÙ1ð>_¹zÜ°ˆ¾›_£§%sø>¢í¢s‚¾–ž–ìùF¾r©‡eÉ{>îOõÕ¾¡Ï³hlcå>”D7ɾ>~6˜E¾<ù¾ž¶›wÂ`>¡x=UÄ%8¾‘±Ù‹Ÿ¾…&VCŒ%n> »(礂¾ ù UGË>Sü°—Ÿ>‹aøgè¾ ÆÚýéš> Lå Ç%Ô:£Ž»)¾Úæ@`Ük>¡Q¹ÄÄt¾žÞ,ž·¢¼>…óÌ5 ‘>”d{×ä±¾¡µ»ê>œ·[Fô \¾pYv.j=…¾—¢®$Öû>¡èv~ÜŠþk>'¡Îá.ì>šœéñÔ{¾¡ã©aÖ£q>—›ŸûVÇ>py=úÑÑľœ·^Œ­»ó>¡žÙöØ<.¾““º‹x¾€Õ0øÜCœ>ŸgŽO§¾¡´—!¨>Gâ`¾¬¯>‰}<¶EoI¾ ˆ€`Û;> :ná½+X¾†™d–„ؾ‘ÁYW>¡C†H˜„¾ž!ÚÎõh >zm3«zóÓ>•$Kî¦Ï¾¡²Ú†c”>›)Wÿ¾Z#Á£=†å¾˜í,Ʀ>¡ËSXþJ¦¾—‹]Œæeݾl5¯…ª8>œVBý´iľ¡ƒ¬ÞÖ™>“Oê’:†>…ø¤^…¾Ÿ6ËÁoØ,> Ô3zØ|‹¾op? t¾‹ÞÀÎ4> ·0‘þ꾟qÏ€æä>‚yÜ`ß‹ >’ç4igÕ|¾¡o Ûÿ‚c>œ^mïl¾l°ZQd0÷¾—€Ìh–Ñj>¡µwؤc ¾˜u^F…¶’¾bi©ïÂØ>›‘•ÔPp¾¡~÷€ì{¢>“æլóE>€…¨sAöþ¾žìèê]Ì> ÃÈ—³¾ŒÀîÿü«ü¾Œ5ð3±Ä> µg«…Ù徟³¾Ú>s>€ÙŽX^>“¡N¯úzܾ¡r¹Ê,7å>›lVg`ݾ`™n©¶¯¾˜žåÑû ì>¡žï3ôS¾–ØæóœÜwÔÊÒ¾¡.ó ݼÕ>‘a"ÚÌ‚¸>…÷ÿÿË/š¾ ŒAþw[> <¡Ú&W¾†XØEÁ0–¾‘5‹Gþ>¡$–æ°—¾œÕ¤ï]E>q¹Ôm9LK>–ágÁ\噾¡Æ¤¨>˜@*#ö«–>dιh*±r¾›»…ç,T™>¡IJÉÿéE¾’šs®’P‘¾ƒHw 3³z>Ÿƒ_â_^I¾ G†!/{>ˆ)‰F#3â>aåòL~º¾ ÿí>N•>‰Û ;H¾s¹äYfÿO¾–€î@µäþ>¡¡ ˜,¾˜K6¹è‹¾d]àÛdï=>›°†ßÔ£¾¡7ŠGážÅ>’JëTx>„G>3å&¾Ÿ¥¤æyš¯> ´|Χ¢¾†ªá¢ZEɾ‘X‹Œ<Ÿ>¡õ µâ¾œe’üé!T>mÐ-Î>—m ksNʾ¡w?4*÷>>—ÃñR×>pª>¦F^«¾œ¤s·ÖÈÕ> úAì/Ó쾋c[•¾‡àÓṮe> 5ß·®Âš¾Ÿ,‰Híõ>‚Úâ …¨>“*Rä”*J¾¡?¾äs¸4>š¬2w&µ"¾Nãæ£`Q¾™kòZ»†ù>¡XŸ×ŽÑ¾”£ B¶a©¾}/£Pê+>žP¹ªQ“U¾ v0Ðî)Ö>Š¸&VS>ŽfßU¡Êè¾ Á¶LVJ>9–« ؾtèK. R ¾–KE >¡at%½Ÿ¼¾—ÀÀY“f,¾jeÌñ£Õo>œ0^,/¾ öàD>Ȩ̀vé>‡iõ î$f¾ "•àYæt>žû&·¯ú!¾j“ÈðC$¾“v&±‰Îó>¡7¿ÏK W¾šÚ8hG=Ûu€6AùÝ>š Œ‘Ö¬þ¾¡4þ!}žB>“iò€#åó>Š¾ú,8¾žýã ªƒ> VE©}A¾†à‚=x…¾‘ %øÀÁ÷> öYc ¾›¶cK ö%>eKM(œô>˜<£3OÑû¾¡Kib°u@>•]¦AÊÖ8>y°Pg‰à¾Ó§Û­> p—ˆ–侊ý>±ÕNA¾Ž3­Rž> °‰P°Q¾œÛ,ô²„>rwè`ϧ>–Æ@ »d¾¡Kº¹O.Ä>–À –óQ>rœÇ&`ý¾œÞcm?#Ã> ©U„ ¾éå~?#»¾‹KùÊz> s!+ÕàC¾š(щE>x ˜™ä¹>•²(^ÑL ¾¡B°Ð¥s–>—©.W_K;>k{˜õñ¹¾œ+,Œ‹w> Ç¢‹I^à¾Ì}Í Ú¾‰\öŸIÞx> E»=žG–¾ž 3F>‰Ý>{ÇÅ2>•PFrÎô¾¡8OpPj@>˜,6^Š>eÖ„¸ ÃO¾›ÀjD˜> ÔwiÉ«"¾báÊA†ù¾ˆY!!ªö0> +Ûèß{y¾ž7±ÕÅ7À>} .Ñÿn>”³=ƒœçþ¾¡0Ì·»<=>˜W¦£b*§>cðS'ö:p¾›š±Óv > Ô+ÿ6'¾xd§œ¾ˆ.A[Á]Ç> %ñü>Žg¾ž/ ‡#%ý>|ÜÞ2ï>”½»j­[¾¡-q­ÎR±>˜6ÎV^>ek—ˉd¾›¶!,eRP> ÈÖ»Zè¾1Ɇ‹Œ)¾ˆÆÌaÔæ> 2+8$æ¾öÈß÷ è>{"yŽ‹ü¬>• 4‰l¾¡-bŸYê>—ÎÂáy*>iéýÈa* ¾œ áÈv> ²¯û« ¾0Xa"N*¾Š Þ> M#yÖ ¾û€¢¸%>xÄŸóÂp>•¶¹¬ø3Ž¾¡.NeŽö>—'9ó‘Úm>p†ZŒŠ5%¾œ‹zü¨¢> ²ÿ‹šþ¾fØ ~¢¾‹áþüûŸ,> rx z{¾œü3³è>s·¢4"˜ >–DkÄb2¾¡-,oS>–C”d(vN>u:$5òd¾/T±¿€³> a7¢tƒ~¾‹˜¶âÛ˜¾Ž1®C¦§ó> F%¾œ;B)ÚŸ>l­Îl. >—Ž¯àØy¾¡%þ”; u>•'‚Áhnþ>zà¡BËûë¾éxþðW> "\É`Ér¾ˆJ¤A‚ÂÔ¾p$2¾ƒ> È™üÊ©ò¾›MøWãE]>`ùüüôO>˜®5~q@¾¡µ¤†gì>“Ö„HoQÎ>€¥ñúy÷ ¾ž®iÛÆö>Ÿ¤Ÿlb¾…hvÙ}¾‘êÖòÙ/> ïЕn…!¾š3"k¥vá>/¸è ÿèz>™àfîí¼Ï¾ øãg(X>’RÿÃ~ÆZ>„+N^Ùz¾ŸtPm“>žÞß!«º¾vGËêç]¾“€Y›XÈ>¡ís J¢¾˜èßÚ±h¾[3Ü4»-J>›¦]ÚV¾ ËàvýŠø>—š/ Å›>ˆ«v"¾ P׸O`>å¹Rªy¾z¬õíÞȾ•:ÝÒ]<>¡"á]<ÝS¾—OÎ)Py¾oõð0uÛ>œƒ>rRl¾ W_“±ó>Œ‡#R€>1ÇÊ'_Y¾ –E•üÑ>œ«CµØð¾`ÙØ)ät…¾›ó|Jv³>£ßøxc±healpy-1.8.1/healpy/data/weight_ring_n00008.fits0000650000175000017530000002640011705033043021702 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:03:50' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 16 / 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 NSIDE = 8 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 24 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 1.656768309032E-01 / maximum value of T weights MINVAL1 = -7.226390397992E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 1.656768309032E-01 / maximum value of Q weights MINVAL2 = -7.226390397992E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 1.656768309032E-01 / maximum value of U weights MINVAL3 = -7.226390397992E-02 / minimum value of U weights COMMENT END ?Å4åý7ŽŠ?Å4åý7ŽŠ?Å4åý7ŽŠ¿²ã FgÜ¿²ã FgÜ¿²ã FgÜ? ¶ü˜£mo? ¶ü˜£mo? ¶ü˜£mo¿‡{ ŸŒV¿‡{ ŸŒV¿‡{ ŸŒV?,Ñë0ÿð?,Ñë0ÿð?,Ñë0ÿð?sH ¿ïÌÝ?sH ¿ïÌÝ?sH ¿ïÌÝ¿ré3¿é?·¿ré3¿é?·¿ré3¿é?·¿z·•€¢ßÀ¿z·•€¢ßÀ¿z·•€¢ßÀ¿xÅËð|ªÍ¿xÅËð|ªÍ¿xÅËð|ªÍ?z,ß/DE…?z,ß/DE…?z,ß/DE…¿c<"Ì<ÕÁ¿c<"Ì<ÕÁ¿c<"Ì<ÕÁ¿g aC›À¿g aC›À¿g aC›À?tž “®V€?tž “®V€?tž “®V€¿bfrGDÝj¿bfrGDÝj¿bfrGDÝj¿háÅaÚÞ—¿háÅaÚÞ—¿háÅaÚÞ—?wCi"h?wCi"h?wCi"hhealpy-1.8.1/healpy/data/weight_ring_n04096.fits0000650000175000017530000062500011705033043021716 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:24:43' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24576 / width of table in bytes NAXIS2 = 8 / 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 NSIDE = 4096 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 12288 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1024D ' MAXVAL1 = 1.634655721049E-01 / maximum value of T weights MINVAL1 = -6.829251779909E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1024D ' MAXVAL2 = 1.634655721049E-01 / maximum value of Q weights MINVAL2 = -6.829251779909E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1024D ' MAXVAL3 = 1.634655721049E-01 / maximum value of U weights MINVAL3 = -6.829251779909E-02 / minimum value of U weights COMMENT END ?Äìp›9 ¿±{žR‚3Á?œj j&{½¿{¦«gZçí¿k¦ú¿!€?{ ì“«¿H¿wèˆOp?hé*~Èl3¿-‘Z€úà0¿[H5¥iøî?b–µ´3Q¿]#»¶¹!¼?G4¨g¾6?8‰,´q¿PÅ¥rͯ?R»l½¿G?Sš)C?¥Hû¿²‹?<'‰j´›¿F*)q\|ÐÞß\ت5¿0> ?,Lu«,Ö¿°ÂË èd?î9[¨ÅB?yÈæüο€Ìÿu«Ÿ?ÎqË‚ ¿ ä9ÐfV>¼H`?¾? ®sÜjû¿‹ÞRXdÞ?O0„f8¾üÏÉH°›í¾õ?Ì€Jë? e‚ú^¤I¿öê^Hh?8²q,\¾ÓÌ9ó¿Øè7 K? I­b I¿ Õ¤Ôt >ù° GÖ¤>ê˜K¢VÄ¿Ͷ“–Åõ? ddñ •Ú¿éòØHÖ>Ú¶é4]àœ>ùã^Ÿ.þ¿›x]Á?¥ùê;ñq¾ö ¬‘Ëaé¾à.÷pS˜W?“ŽBDœ(¿Þd®>ÿÆ~l#€S¾Þj>Isß¾òãSÜÉæ?Ù ý£³¿Ù©hFâ>ó¤«"¿>Ò9 ž†‚¾ù©ßX“Îy?(åΘöŒ¾û()F÷i‹>àT¼2pb>ëÁì1thÀ¾ü«‚c9ô·>ýñl55Q§¾ñ«Ù7–<¾À°_Ø® >ô P{䨾üc=];Ù1>÷†ë—Gu´¾àyX>ü¾äbÜC×¾Û>÷U‰œLŠy¾ùt´lådµ>ðéÇ>”Ò/´ B¾ïØ|ß»öM>÷ň/g–¾ôš«BÎý>àzKTíÁ“>Ý­k‹Â[Y¾ó/Ni{_©>õàt ,n²¾í-ç¶ò>®]a€?ºŠ>éTn)¨£¾ôõ4–Lö>ò3Ý\€ÊB¾àCrö1 ¾Õ,.1Ñy>ïÉ”ÙýÙ¾ò÷F¶›ù,>ê·r©ø¶¾¾£¹äÛ9¾ä0- øÁ>ñ!.¦è!Q¾ð1÷C•>ßÒÈ gº>ÍÏ‹R%¾êzq:*¼>ð¨ú„¾è`%±$>Ä€Ñ ?Ëe>àX§~.U¾í_’—>ìü#ß5*¾ÞòŒËŠná¾Â®iàÕÂ>æ"[OLïö¾íṘSÌ>æ¦Vä]V¾È‚¿Ù|¾Ùrþ†ò7>éKôz¿É ¾ê/Í¢£>Ý÷"ÄÐËÀ>´Åt‘F.€¾â‰Ã=ðØ>é¦@rA—¾äñ7Q©{a>ËkPÜüƒ#>ÓöÀLÿ0 ¾åÜCš±°^>焘Å^¡¾ÜëÊFS¾á?ámðÎ>ß ;‘h¼x¾æ´M³>ãg^µu¾Í±´‘O<¾ÎØ12G"5>âî·:k†m¾åIá㢿V>Û×à8;?3¾Š uó§ €¾Ùó*Šo>>ä&¨‡O¼N¾âüX)Œ>Îðbaº–>ÇC»¥ô³¾àjF¿·Š>ãPêAÎú¾ÚÀj‡Ú7>§Þ+aÓA#>Õœ“…[|¾áë(ò¸ƒ>໢ XÎ#¾Ïà›ÈbÛ´¾Àåé…åqÿ>Üw“qÓqh¾áŽ¦Ilé=>Ù¨¬ ›ÿ¾²øZªî`¾Ñâ…èæd>ßçXŒCÄ„¾ßÕâ_ >Ð64Ãé¬.>· !ÜöX¾Ø¨ÂŽÇó>ßôØâÎ}Š¾Ø’è†RnÆ>¸«ús•>ÍV§Ÿî¾ÜjEeýv>Üö‚†áõä¾ÐTª!¤…¾«ÙoZN>ÕPºRüŠ‘¾Ý6Ì„>×€†¶?hɾ½GN6Ç5“¾ÇÁ±ÙMhMô¾ÚõbFŸ¾>ÐQ»E—á,>˜ªiÇ2½˜¾Ò\äšÕ²X>ÚƒEÀ-¾Ör‚ñKa'>À}D&å0¾>ÂãûU Ž¾Ö‚  b:0>ÙŽl·ó|¾Ð5rÜãy>\¨'"{*>Ï|¥Tt¾Ø%Ö¢…²>ÕifŒº ¾ÁõóÔ-ÄV¾½CÇðÿÜ>Óþ`9øwç¾×Xí¿ås>ÐÝ"ú¾˜_4’üç—¾ÊÑÒe‰‰L>ÕúÐ,å"W¾Ôe’@ˆ@>à 6±¼>µÊ^nËŒ¾Ñ·I‰6>Õ¶ ŒZm¾Ï‚¯/}Ž¶>¥ÑØ ¶Bó>Æ¥‚Oæm¾Óûóµ×f>Óg(9jþÃþ竾®n ÿ3>ÏKÓðB{¾Ô,tœ>ÎàÑ=›Ö¾®qªÎ›æ¾Âça¦Ð¥ >Ò$KÝ4¾ÒnBÒ²>Ä¥¥r¦¤>¢×»Dá0N¾Ë…z¦ƒë>Ò¸OÙÚ w¾Î'^¸ÀÂ/>²€b^ ¤2>¿ÇíÊÍ[¾ÐnñN,/'>ÑzÒ|Þ2¾Å”2re¾‘>äæÅ ±>ÈÛV4(ë¾ÑXÚ8P+>ÍZlŠ*®¾µsAãk„¾¹lK¦+>ͱšûX¾ÐŒÔoJÉ>Åaß•Ó»¾I QÔ±³?¾Äê7\-A>Ð Ð!—DA¾Ì}13ž)>·í ûGÆÚ>³Š¥Ù8Z_¾Ê½©Ëš">ÏHQmBP¾Åƒ5i1þ >­1ñC˜>ÂÍ"ºzX¾ÍŸF!”3>Ë’vQp˜û¾¹ü®ˆâ6¾­2¶Âب{>Çû1e’ ¾Í€*ú°ò>Ńw]]W¾žª¦Jì¾¾²MÈúÖ¯>ËE÷ÈÉWû¾ÊœmßD%È>»¬;aø+>¤C¼à«5‡¾ÅgE€jvß>ËÄð_uºB¾ÅfVõ.¥yCßk8>¹É?®ê¾É fZ­>Éu†w]¾½ÌÀwõɾ˜aÿË”7T>Âý‰êjNϾʃK<˜>Å/J º¾ªØ>yL:¾µCe!¹à>Æç”P³*x¾È•ïrm'·>¾h¶¨c>ƒ™Âqº¾Àº™«½ˆÜ>ÈiýNŸ$¾ÄáH@{ ~>¯„¼ˆ ÷>±9m¯P¾ÄÞÊûF5~>Lj}½ù”h¾¾âµ÷S{¢>jÓŠéf"y>½7Kñ$ôœ¾ÆËJÊ%b>Ä~áÍn‹ ¾±Çn01©¾ª}Ú¸Î+>Âíü)–k¾Æuã€qà>¿p6Ô¾ŽcÐà3Šã¾¹Å6=4fXp¾Ä Rý€ã>³‚LªIÀ>£g«ËÒ¾ÁŸd¬¨È>Å_BíÏʾ¿ÅjÁU>™Ó†wLý>µ€¯a=k¾ÃªÒ´øÛÜ>Ã…’oq©œ¾´øíÕ;þ¾™Âä8Û¾>¾™ÅìZ³Z¾ÄE‚]ÎõÇ>¿ç„¿Åɾ¡« èý‡¾±þŸŸHäb>Â(ð”¦5d¾Âò]çÆÝš>¶0Ä¿?|†>‹†|‰®¾»6Ü$$žb>Ã)ŽÏ6Õ!¾¿ÚñÉÎ9¢>¥æ¨®dyC>­jÙ€¾À°¤š#­ª>ÂRDò±¤¾·.j=”)¾fPý̓5>·úïÝ펾 ' $Qr>¿£ˆ'Å£Ú¾©¥~ßf¾§@®#•Ÿx>¾ƒÑˆä)¾Á¦­SDYÄ>·ö)„ôŠ¾}OÙŽŒW¾´ä­°ð5>Àî¬8I¾¿Dí­ºV>¬ïK<Q>¡|räîlä¾»¹¸»®WŒ>Àðâ[ ·×¾¸‹¦dx@>†pï±Ó>±òý‚ü ¾¿ C´>¾Â:%Íäd¾¯ÊýÃuœ¾˜1î2Ro>¹O:B9¾À2†BÎ>¸ò\ð0x¾˜ânújãT¾®IëqgÕ>½edwÞ‘±¾¾x8 Ö>±dÜ*³J>ŒK Eð¾¶`TÚ2N>¾Ö°›4Ü“¾¹-@„Oe> 8·e^©n>¨óµ,:F¾»-a¤aà>½\@Z,×K¾²(%ôÆ;’¾s4 VÑ->³Ñ¨kýC9¾½;{jø{¢>¹?<%°‰¾£žUî©$ý¾£â,2›«õ>¸ùhºžƒl¾¼~/¿Ÿ!>³M®U}Ú¾næ˧n¾±W•æH· >»”~òtؾ¹*ÍàPÓL>¦¥Ùºÿ&>ž(ÍhB‘¾¶Ê¤¶^YH>»†Š0òE°¾³°1ýº«à>‡º‡³Ç/H>­äô™û™O¾¹ã ¼‹ ^>¸òy!ˆØC¾©S _ß×¾•k¢x>´¢nøÔÒ¾ºw¥ždÓl>´3ûøˆ^q¾“8 ë7“@¾©EäQÜ$>¸*¶,¹2V¾¸˜lÞým>«©Y[ˆ>‰qmH‘¾²ð¨—yÓ>¹Szþåv¾´°ï‘¨C>™ñ•O¬`p>¤ÒêMv ý¾¶kŠ1ô{>¸êžj¾­ªû¦”»+¾qÞ@uÐmØ>°j‚~ê´¾¸qœ•ü›>´Å8[;ç ¾ S|Fr4¾ ky+9›>´§Þ>ü\L¾·‡ï`G>¯[š•žBý¾h†s1¾¬º¢Rþ(N>¶Ô9¤d+P¾´ÖdXÚ]>¢Æ`ç]¦›>˜í²Æ³œ¾²áo×@¿ª>¶Õ”­µt\¾°^Ýúù8H>„&ïXaŠ>¨·oS)iy¾µ|øË€n¥>´Äö°¤3¹¾¥:2/‚΋¾‘ZÅZ™>±ø.¾¾¶ ½( (ý>°éãy?d`¾“J8 *¾¤ÍÐ2&¤>´»‡¸ ¾´’¥ª¥¬Ö>§cGÏ¿>ƒh—"Z¶ß¾®¦_Íÿ’>µ&n/y{¾±P3ʆ¶|>–Ž‚©Ûú>¡çàæ¾²¨ÿŠs¼>´A!÷™1_¾©BÂ?T÷›¾ew»‡Ô•>«šÏ„@¾´--Ã3á>±’ö¯û¶¾œÌæ¼÷澚£ÑR¤Da>±0(é“ËO¾³ÒJÞû>ªÚšÕ½”¾oq#Ìm½{¾§‰µò>³ ÷å™<¨¾±³{ã1d£> |`ö6#o>“‰Žü$€Ë¾¯` †Ž½ô>³G>¸5³!¾¬*V-~k>„?Ð2” >¤(8•ëÛx¾²®r~¨<>±²ñ4úlŠ¾¢³§P2ñ×¾‰nt‚”>¬U)¿¦Ò¾¾²¢E°×è>­5¥–fÓ¾ÇÑ9j‰µ¾ Â}/×¼6>°Ô® `À“¾±’²”Üÿ(>¤¨¼—2Ø>xƵÇÕо©C‚ÁeÝ>±äëŃ@¾­ûƒÌ’Mí>•73¾fžâ>šÞ£wÉ-¾¯1¿‹}/>±SÿÞ´/¾¦[¹r¼¸=Ý.Ü)F >¦.ùÄ¡¾±ùK U”>®Yˆ´=T¾šš‹ï¾”dK´.n¥>¬¢µyŽ9¾°øMƒÑ\>§ÌÒ^Ûf¾wxôˆÐ´Š¾£°†’ˆ¶>°(E)ÉàŒ¾®ÂàÓÛ&>ž‚„6mŸÜ>Œ9#Âå+¾ª4d¡s>°€ûKWt¾¨ü\J–´j>†¾,g´PU>  †AH[¾®Ye…Ûuã>®Å‡0L¾¡;îS/9¾€¼Œ(Y>§NšvG ¾¯ßC^ø¸>>©êÕ\Ž¾|÷€I\¾šP%†ê>¬@li$LÓ¾®‹Ðšà3Ì>¢øD±â>b Ý>‡`˜¾¤‘ånöh>®‹’0Ê ¹¾ª˜ê{ÄüŸ>•;Z·i>”!ö¾ÍÒ;ª ©6Š˜¼>®ú±¢$¾¤x9¿²Î>j,•†Tì¬>¡Î®Àø¿j¾­ l•®ä!>«}8ùö€¾™ŽPÀÒÍƾŒª¾wdÕD>§¹H\qu(¾­iZo Ì&>¥ºM·×‹(¾€þY0Êò¾¾ž]…O€>«_CíNi ¾«7ª‰3‘¥>táF’‹À>f™sD.¾¥Sš¬RÉÌ>¬…¯_jöÀ¾¦¾Yr…á >ŠÊÒ»ÞÉ}>˜‹ùjÖÆI¾©Ž• 3>«*Ϣ؀ú¾ u²c´AÛ¾jڸ朕>¢Ý0YŽŒ¾«n¶L.9·>§„-l¥l^¾‘òe¾Zk¾“ízá>§š‰*®¢¾ªâW¹ÕÄ>¡÷•9šõo¾_ö1³¼Ø¾ ZA‘£®>ª'®8“(—¾¨ '9 @œ>– ‚X7>‹aæ–­¾¥‰$du>ª`Ú»n©Â¾£>¾ßx¹ã>{ŽÚß&yx>›Ÿ²]•2Ò¾¨³Û}Ï¢?>¨V¬Êøô ¾™ê¼PþÑ„¾€Û->D|>£^ ­œ¾©§ìþzòÎ>¤J[B“ÁV¾‡÷öäÈw¾–…GsNô}>§oÖZz¾¨d¸Ü~c¾>L/Á‘_'>jšìÍ6*1¾¡"‚=ð+>¨ºWvÑùë¾¥¦ƒyx>ÊÐPõO>‘ou®j¾¥UçÐzm>¨7]îß›¾  [ ƒ]g>YW†‚ó„>›Ç†Ôe¾§›Û% >¥¬pA¬ñݾ“ætjv@&¾ˆÍuØe²>£r+Ñþîw¾§ÐM©{ƒ>¡bUÔ1®¾y°\«pˆ¾˜äÝÕ‡ U>¦M+$f‘ò¾¦¨”Ÿr>—‰‡+ó9>}ÙŠÆ&[¾¡rÖ™ªîJ>§1YÀ…¾¢jŒGâ»w>…_l?ã·>”!v-ôpô¾¤Ôk …k>¦ß Är¾šÉ ìVù¾e?"‚× Ž>ž·Å°{`꾦\ý¨î>£7Þg=}¾ Îl2˜¾Ž¸zÞ?-É>£4³É%¨a¾¥ûÔ˜õT[>Ÿ¡݃¾_®UžÕ¯X¾šd]<âœw>¥UÜ™ .š¾£É§e¨ >’žkÄEËÿ>…?$ËÚ$¾¡rO§e7>¥ ôTTï¾ IçÔû—>y¡*#SÇ>•ör #†¾¤E;2‹|>¤WÛ¾–6ŸŽã¯¾wÙ¬ýó>Ÿ#·ê44¾¥ åS¾$«>¡(˜Kê¾…-­ ʉ¾‘w„ë2hi>¢¼³ìüAü¾¤9[[2„>™%Dé€Ì>V´ï\.êо›0—MOÝo>¤Es«ŒI¾¡Á×ÀQ*w>ŒúÙm€#>‰çú9O€¾¡2MèrS[>¤C•ýpE¾›ÑJ)ˆÑ1>g¶¥t§ßD>—´ª¼¾£Híêa¶Y>¢HX¶á˜š¾’b9Tûq¾€íD¥),>ŸÌ. Þ0¾£½=9Ь">ž6w*¾|–·¢õš¾’Þ¦(G >¢ûù'a÷¾¢“5S§Þf>•P˜OB>p,Ãù–蘾›oàö‘ÓQ>£)ü£UþŸàezýÿ>†-y ÊiÊ>*[äP6¾ ÄËÕ½ Û>¢¢S“§¯¾˜-›äÛôÀ>0¿[»÷ÀÂ>—¤ ‡ ÎúA¨¾€ªNkú¾„Ã(áŽ>ž‰c}R¾¢vd1dXe>š£¾o°Ï¾q Ä‘(Qƒ¾“°ªÃï*>¡ds><³;¾¡#×»0Í>’Þö¹>wýG³AžÙ¾›BŠZ|”š>¢yä5ªª¾œ­9ø|´´>€²šoQ<ª>Bw¤4°Ø¾ 8ièî!E>¡F°#×<¾•Ѭ„—¾\­þ j>—¿ðXëý¾¡r~#9¿9>žEK'.Ì:¾ˆ7Ù¤,ݾ‡~áäÈ$>ÁL÷H§ù¾¡A\¯áU>—µË3¡Õ¾bR…pŠ¾” m߬¢x> žÇ…•¾¾ŸhQ-?ó!>Žæ5› 6>}€¿ÅÄ g¾šÃi(×”Å>¡îòd·¾™éšëë¸>xÎ,=’>2F˜HFQ¾Ÿ1š%ü>  ò•ƒÿ­¾’‡«Öã)á¾jAý¢O†>—Rpâ5ð¾ †©8Ö>›¯e\‚á­¾ƒÊœâü龈 Óðs >œÆÔ”_À$¾ #~T-_>•?VL〤¾G w|  ¾”9[PÎ<>Ÿ©nµÄƾɳ??>Š§FqYú³>€‡$ÉeÎ{î«\> úø}"¾—‘Ø ~×>rTZï‹‹u>^<Îñðø¾Û›®‘<>Ýð®,‡¾sš¡¿ S¾q#D8æZŒ>–ýÖ€5ð쾟F¹; €>™x@³ƒß¼¾€€ºé †O¾‰,¥°aÕ>›«Ì^6¾ž?v>ï>“:î岓ð>7–+*l?1¾“´XÑØ>I>ž¼=ŽV¾šìz)E*î>‡[G„Á ’>xGðW»c¾™ D_oüU>ž(5[Î㾕 NðÞ¾>kp‚!]–u>7rö|Î(¾œ}ðâ>›ê:•××ø¾¢º;D¾sw¡“ýϯ>–E:SÀ+¾˜±£è‘Q>—›†;Ù¾|9b”²Êɾ‰)NÒ¸ >šzz·0n(¾œna®»7K>‘Ÿ9f->P£z…=©-¾“%Ú8Ø>œ“š4·,ž™%º8˜¦Ä>„êBÖÍ>³ÔYƒSGýA%?>œwÞ90À¾” ¡qs >e41âñ¹>™FÛr`q¾›Ì: *­>š9‡àLǾ‹*c=/g¾tYnë6:>•ckùÆ+õ¾œ ÿ`KQ>–Tø7¹¶¾y ×5Þxo¾ˆ’·¾Éß>™=Ž÷¼áŠ¾šÓ;ùº7Ž>bwÃ“Æ >UŒÞP ¾’d_³`­ >›„ÌR¾—¨£G^-A>ƒTCL±;¾–û\NÙå:>šðñ1lú@¾’у+,³ú>buj¿°z¥>ŽR Áª\ž™Â~Q‘ö>˜Ç7pF¡¾‰kÀØâ¾sù LJ >”aàË7ˆ¾š’·ÌÑ>”؃l-ó¾wC#Û ª˜¾‡ šþ›±>—ù„ió+¥¾™j蛂¼>Žöx„“­>U_â|}0¾‘zšõ$>™º®èOZ¾–nÈ확>‚;øJ8tó>€nŽ@¨¾•Ëćö[>™‘'CÆX¾‘ã8ÕÓÝñ>aó·Ž3æ>ŒªA޲뾘mõô3ä>—»bh[¾ˆOT@#G¾rL1‘5>“C»Þ\G¼¾™9âs°>“âÃ\ò¸{¾v¹÷²Z¦3¾…ÿ,‡Â®Û>–°dHŒ쾘0ZâÁ7œ>¿Y(/Þ>P»H¼1¢¾mkYT…B>˜f윧d¾•p¼N¾¯>Ô$Y"RÎ>~'6ñ¡,¾”/å?S}>˜T$©N Ú¾‘9`T“7>c«ëP@Z >Š­ÒyO_¾—Å2Máè>–…äŠ È¾‡ÂÕÆûè¾pÏ¿¡KN>’8ö×~ñ¾—ø³,SØ>“)•aö3rªl¾—ûÒd> aàK >@RNµ¢µ¾Ž€“úP§ã>—àv›¾”¥ÖjÏi>ñ%&eiÜ>z¡¼ Ús¾“?ÀÐ2Á>—3žÑ“¾Ê7z¼Üø>gXn;m7'>ˆdì%ˆ¾•Î‹H®ÖØ>•§yî…*ؾ‡²)™!ξi–óS¦T>Á\Äntó¾–É*pô×L>’¢g!£ßé¾xÇÉMÉY¾ç¿xEŠ>” ñÃë+¾–) d €->ŒÈ7ÐǾ.úvÀ)˾‹éⲕ·>•à.Ú ¦ä¾”‡KgÜ>‚€Fª³>v^9 Ó辑áµT¥Àå>–'ü5œv8¾‹¼×YK¢>l¹ð“™ ¶>…Ñgp¾”}ßdŠ—>”é(`w=¾ˆ ƒ›Ð⑾aG@d4ü>Ž¸ŽZž©¾•¤^ ‘_a>’CÙƒBÁ½¾{{Ú:Á¾~¾d½y¨Ð>’ª9 ]j¾•K…,”!>Œß“'g¾RõÐϲ-ᾉ;oi®>”¡*a°v¾“‚†Éʪ>ƒnôï¶ä>qnÛâÐľp ö>•(Yl7ÀN¾s+}–l&>qÉ\ R>‚øN‡Ãt¾“$U#§¢>”@^bœgW¾ˆ´™BKÞ0¾Pkˆt\á>‹¹Zšªxݾ”’¶ù>’‘Ø ÿ¾~à><ý˾y]öð>‘7£ÅçüA¾”x×ð×áq><˜*›˜É¾bY»s­œ¾†;dïï°>“ZóVäP¾“mæYv%>„©©ÏJÄ>gÃs›åÀ¾Ì攟>”*‡´¥ñ“¾uh·—¸>uÒôUíæ`>±Óåìy¦¾‘»œàh>“¡º:v!¾‰žWë/µ&>5 V/•¿>ˆ€î’„ý¾“WVûÉ¿,>‘Ò¡°!|;¾€ÍÓ¨9LR¾rÖÇä>\tà7Ô龓¦ìÒ–~í>ÇÕm-ѾlVGužµ¾‚ªGþAàç>’¡þà;s¾’­Û®¯0p>†Ø)G¼Ã>W7¤âȾŠ€–hÉÌ >“#œ«Œ³¾„÷2÷§¾>zXáø5p>xè˜j‰”á¾;FÔ®k6>“ß¹BçоŠ¯uÞ TP>\§Å)Çž>…y­öݾ’SøG‹>‘¦î㾂ÁúË? —¾h#žÚv'´>Œ%%³Õh¾’É4yfE>ŽhT’9¾s›;ÿ¤¨¾~ -)·,?Äìp›9 ¿±{žR‚3Á?œj j&{½¿{¦«gZçí¿k¦ú¿!€?{ ì“«¿H¿wèˆOp?hé*~Èl3¿-‘Z€úà0¿[H5¥iøî?b–µ´3Q¿]#»¶¹!¼?G4¨g¾6?8‰,´q¿PÅ¥rͯ?R»l½¿G?Sš)C?¥Hû¿²‹?<'‰j´›¿F*)q\|ÐÞß\ت5¿0> ?,Lu«,Ö¿°ÂË èd?î9[¨ÅB?yÈæüο€Ìÿu«Ÿ?ÎqË‚ ¿ ä9ÐfV>¼H`?¾? ®sÜjû¿‹ÞRXdÞ?O0„f8¾üÏÉH°›í¾õ?Ì€Jë? e‚ú^¤I¿öê^Hh?8²q,\¾ÓÌ9ó¿Øè7 K? I­b I¿ Õ¤Ôt >ù° GÖ¤>ê˜K¢VÄ¿Ͷ“–Åõ? ddñ •Ú¿éòØHÖ>Ú¶é4]àœ>ùã^Ÿ.þ¿›x]Á?¥ùê;ñq¾ö ¬‘Ëaé¾à.÷pS˜W?“ŽBDœ(¿Þd®>ÿÆ~l#€S¾Þj>Isß¾òãSÜÉæ?Ù ý£³¿Ù©hFâ>ó¤«"¿>Ò9 ž†‚¾ù©ßX“Îy?(åΘöŒ¾û()F÷i‹>àT¼2pb>ëÁì1thÀ¾ü«‚c9ô·>ýñl55Q§¾ñ«Ù7–<¾À°_Ø® >ô P{䨾üc=];Ù1>÷†ë—Gu´¾àyX>ü¾äbÜC×¾Û>÷U‰œLŠy¾ùt´lådµ>ðéÇ>”Ò/´ B¾ïØ|ß»öM>÷ň/g–¾ôš«BÎý>àzKTíÁ“>Ý­k‹Â[Y¾ó/Ni{_©>õàt ,n²¾í-ç¶ò>®]a€?ºŠ>éTn)¨£¾ôõ4–Lö>ò3Ý\€ÊB¾àCrö1 ¾Õ,.1Ñy>ïÉ”ÙýÙ¾ò÷F¶›ù,>ê·r©ø¶¾¾£¹äÛ9¾ä0- øÁ>ñ!.¦è!Q¾ð1÷C•>ßÒÈ gº>ÍÏ‹R%¾êzq:*¼>ð¨ú„¾è`%±$>Ä€Ñ ?Ëe>àX§~.U¾í_’—>ìü#ß5*¾ÞòŒËŠná¾Â®iàÕÂ>æ"[OLïö¾íṘSÌ>æ¦Vä]V¾È‚¿Ù|¾Ùrþ†ò7>éKôz¿É ¾ê/Í¢£>Ý÷"ÄÐËÀ>´Åt‘F.€¾â‰Ã=ðØ>é¦@rA—¾äñ7Q©{a>ËkPÜüƒ#>ÓöÀLÿ0 ¾åÜCš±°^>焘Å^¡¾ÜëÊFS¾á?ámðÎ>ß ;‘h¼x¾æ´M³>ãg^µu¾Í±´‘O<¾ÎØ12G"5>âî·:k†m¾åIá㢿V>Û×à8;?3¾Š uó§ €¾Ùó*Šo>>ä&¨‡O¼N¾âüX)Œ>Îðbaº–>ÇC»¥ô³¾àjF¿·Š>ãPêAÎú¾ÚÀj‡Ú7>§Þ+aÓA#>Õœ“…[|¾áë(ò¸ƒ>໢ XÎ#¾Ïà›ÈbÛ´¾Àåé…åqÿ>Üw“qÓqh¾áŽ¦Ilé=>Ù¨¬ ›ÿ¾²øZªî`¾Ñâ…èæd>ßçXŒCÄ„¾ßÕâ_ >Ð64Ãé¬.>· !ÜöX¾Ø¨ÂŽÇó>ßôØâÎ}Š¾Ø’è†RnÆ>¸«ús•>ÍV§Ÿî¾ÜjEeýv>Üö‚†áõä¾ÐTª!¤…¾«ÙoZN>ÕPºRüŠ‘¾Ý6Ì„>×€†¶?hɾ½GN6Ç5“¾ÇÁ±ÙMhMô¾ÚõbFŸ¾>ÐQ»E—á,>˜ªiÇ2½˜¾Ò\äšÕ²X>ÚƒEÀ-¾Ör‚ñKa'>À}D&å0¾>ÂãûU Ž¾Ö‚  b:0>ÙŽl·ó|¾Ð5rÜãy>\¨'"{*>Ï|¥Tt¾Ø%Ö¢…²>ÕifŒº ¾ÁõóÔ-ÄV¾½CÇðÿÜ>Óþ`9øwç¾×Xí¿ås>ÐÝ"ú¾˜_4’üç—¾ÊÑÒe‰‰L>ÕúÐ,å"W¾Ôe’@ˆ@>à 6±¼>µÊ^nËŒ¾Ñ·I‰6>Õ¶ ŒZm¾Ï‚¯/}Ž¶>¥ÑØ ¶Bó>Æ¥‚Oæm¾Óûóµ×f>Óg(9jþÃþ竾®n ÿ3>ÏKÓðB{¾Ô,tœ>ÎàÑ=›Ö¾®qªÎ›æ¾Âça¦Ð¥ >Ò$KÝ4¾ÒnBÒ²>Ä¥¥r¦¤>¢×»Dá0N¾Ë…z¦ƒë>Ò¸OÙÚ w¾Î'^¸ÀÂ/>²€b^ ¤2>¿ÇíÊÍ[¾ÐnñN,/'>ÑzÒ|Þ2¾Å”2re¾‘>äæÅ ±>ÈÛV4(ë¾ÑXÚ8P+>ÍZlŠ*®¾µsAãk„¾¹lK¦+>ͱšûX¾ÐŒÔoJÉ>Åaß•Ó»¾I QÔ±³?¾Äê7\-A>Ð Ð!—DA¾Ì}13ž)>·í ûGÆÚ>³Š¥Ù8Z_¾Ê½©Ëš">ÏHQmBP¾Åƒ5i1þ >­1ñC˜>ÂÍ"ºzX¾ÍŸF!”3>Ë’vQp˜û¾¹ü®ˆâ6¾­2¶Âب{>Çû1e’ ¾Í€*ú°ò>Ńw]]W¾žª¦Jì¾¾²MÈúÖ¯>ËE÷ÈÉWû¾ÊœmßD%È>»¬;aø+>¤C¼à«5‡¾ÅgE€jvß>ËÄð_uºB¾ÅfVõ.¥yCßk8>¹É?®ê¾É fZ­>Éu†w]¾½ÌÀwõɾ˜aÿË”7T>Âý‰êjNϾʃK<˜>Å/J º¾ªØ>yL:¾µCe!¹à>Æç”P³*x¾È•ïrm'·>¾h¶¨c>ƒ™Âqº¾Àº™«½ˆÜ>ÈiýNŸ$¾ÄáH@{ ~>¯„¼ˆ ÷>±9m¯P¾ÄÞÊûF5~>Lj}½ù”h¾¾âµ÷S{¢>jÓŠéf"y>½7Kñ$ôœ¾ÆËJÊ%b>Ä~áÍn‹ ¾±Çn01©¾ª}Ú¸Î+>Âíü)–k¾Æuã€qà>¿p6Ô¾ŽcÐà3Šã¾¹Å6=4fXp¾Ä Rý€ã>³‚LªIÀ>£g«ËÒ¾ÁŸd¬¨È>Å_BíÏʾ¿ÅjÁU>™Ó†wLý>µ€¯a=k¾ÃªÒ´øÛÜ>Ã…’oq©œ¾´øíÕ;þ¾™Âä8Û¾>¾™ÅìZ³Z¾ÄE‚]ÎõÇ>¿ç„¿Åɾ¡« èý‡¾±þŸŸHäb>Â(ð”¦5d¾Âò]çÆÝš>¶0Ä¿?|†>‹†|‰®¾»6Ü$$žb>Ã)ŽÏ6Õ!¾¿ÚñÉÎ9¢>¥æ¨®dyC>­jÙ€¾À°¤š#­ª>ÂRDò±¤¾·.j=”)¾fPý̓5>·úïÝ펾 ' $Qr>¿£ˆ'Å£Ú¾©¥~ßf¾§@®#•Ÿx>¾ƒÑˆä)¾Á¦­SDYÄ>·ö)„ôŠ¾}OÙŽŒW¾´ä­°ð5>Àî¬8I¾¿Dí­ºV>¬ïK<Q>¡|räîlä¾»¹¸»®WŒ>Àðâ[ ·×¾¸‹¦dx@>†pï±Ó>±òý‚ü ¾¿ C´>¾Â:%Íäd¾¯ÊýÃuœ¾˜1î2Ro>¹O:B9¾À2†BÎ>¸ò\ð0x¾˜ânújãT¾®IëqgÕ>½edwÞ‘±¾¾x8 Ö>±dÜ*³J>ŒK Eð¾¶`TÚ2N>¾Ö°›4Ü“¾¹-@„Oe> 8·e^©n>¨óµ,:F¾»-a¤aà>½\@Z,×K¾²(%ôÆ;’¾s4 VÑ->³Ñ¨kýC9¾½;{jø{¢>¹?<%°‰¾£žUî©$ý¾£â,2›«õ>¸ùhºžƒl¾¼~/¿Ÿ!>³M®U}Ú¾næ˧n¾±W•æH· >»”~òtؾ¹*ÍàPÓL>¦¥Ùºÿ&>ž(ÍhB‘¾¶Ê¤¶^YH>»†Š0òE°¾³°1ýº«à>‡º‡³Ç/H>­äô™û™O¾¹ã ¼‹ ^>¸òy!ˆØC¾©S _ß×¾•k¢x>´¢nøÔÒ¾ºw¥ždÓl>´3ûøˆ^q¾“8 ë7“@¾©EäQÜ$>¸*¶,¹2V¾¸˜lÞým>«©Y[ˆ>‰qmH‘¾²ð¨—yÓ>¹Szþåv¾´°ï‘¨C>™ñ•O¬`p>¤ÒêMv ý¾¶kŠ1ô{>¸êžj¾­ªû¦”»+¾qÞ@uÐmØ>°j‚~ê´¾¸qœ•ü›>´Å8[;ç ¾ S|Fr4¾ ky+9›>´§Þ>ü\L¾·‡ï`G>¯[š•žBý¾h†s1¾¬º¢Rþ(N>¶Ô9¤d+P¾´ÖdXÚ]>¢Æ`ç]¦›>˜í²Æ³œ¾²áo×@¿ª>¶Õ”­µt\¾°^Ýúù8H>„&ïXaŠ>¨·oS)iy¾µ|øË€n¥>´Äö°¤3¹¾¥:2/‚΋¾‘ZÅZ™>±ø.¾¾¶ ½( (ý>°éãy?d`¾“J8 *¾¤ÍÐ2&¤>´»‡¸ ¾´’¥ª¥¬Ö>§cGÏ¿>ƒh—"Z¶ß¾®¦_Íÿ’>µ&n/y{¾±P3ʆ¶|>–Ž‚©Ûú>¡çàæ¾²¨ÿŠs¼>´A!÷™1_¾©BÂ?T÷›¾ew»‡Ô•>«šÏ„@¾´--Ã3á>±’ö¯û¶¾œÌæ¼÷澚£ÑR¤Da>±0(é“ËO¾³ÒJÞû>ªÚšÕ½”¾oq#Ìm½{¾§‰µò>³ ÷å™<¨¾±³{ã1d£> |`ö6#o>“‰Žü$€Ë¾¯` †Ž½ô>³G>¸5³!¾¬*V-~k>„?Ð2” >¤(8•ëÛx¾²®r~¨<>±²ñ4úlŠ¾¢³§P2ñ×¾‰nt‚”>¬U)¿¦Ò¾¾²¢E°×è>­5¥–fÓ¾ÇÑ9j‰µ¾ Â}/×¼6>°Ô® `À“¾±’²”Üÿ(>¤¨¼—2Ø>xƵÇÕо©C‚ÁeÝ>±äëŃ@¾­ûƒÌ’Mí>•73¾fžâ>šÞ£wÉ-¾¯1¿‹}/>±SÿÞ´/¾¦[¹r¼¸=Ý.Ü)F >¦.ùÄ¡¾±ùK U”>®Yˆ´=T¾šš‹ï¾”dK´.n¥>¬¢µyŽ9¾°øMƒÑ\>§ÌÒ^Ûf¾wxôˆÐ´Š¾£°†’ˆ¶>°(E)ÉàŒ¾®ÂàÓÛ&>ž‚„6mŸÜ>Œ9#Âå+¾ª4d¡s>°€ûKWt¾¨ü\J–´j>†¾,g´PU>  †AH[¾®Ye…Ûuã>®Å‡0L¾¡;îS/9¾€¼Œ(Y>§NšvG ¾¯ßC^ø¸>>©êÕ\Ž¾|÷€I\¾šP%†ê>¬@li$LÓ¾®‹Ðšà3Ì>¢øD±â>b Ý>‡`˜¾¤‘ånöh>®‹’0Ê ¹¾ª˜ê{ÄüŸ>•;Z·i>”!ö¾ÍÒ;ª ©6Š˜¼>®ú±¢$¾¤x9¿²Î>j,•†Tì¬>¡Î®Àø¿j¾­ l•®ä!>«}8ùö€¾™ŽPÀÒÍƾŒª¾wdÕD>§¹H\qu(¾­iZo Ì&>¥ºM·×‹(¾€þY0Êò¾¾ž]…O€>«_CíNi ¾«7ª‰3‘¥>táF’‹À>f™sD.¾¥Sš¬RÉÌ>¬…¯_jöÀ¾¦¾Yr…á >ŠÊÒ»ÞÉ}>˜‹ùjÖÆI¾©Ž• 3>«*Ϣ؀ú¾ u²c´AÛ¾jڸ朕>¢Ý0YŽŒ¾«n¶L.9·>§„-l¥l^¾‘òe¾Zk¾“ízá>§š‰*®¢¾ªâW¹ÕÄ>¡÷•9šõo¾_ö1³¼Ø¾ ZA‘£®>ª'®8“(—¾¨ '9 @œ>– ‚X7>‹aæ–­¾¥‰$du>ª`Ú»n©Â¾£>¾ßx¹ã>{ŽÚß&yx>›Ÿ²]•2Ò¾¨³Û}Ï¢?>¨V¬Êøô ¾™ê¼PþÑ„¾€Û->D|>£^ ­œ¾©§ìþzòÎ>¤J[B“ÁV¾‡÷öäÈw¾–…GsNô}>§oÖZz¾¨d¸Ü~c¾>L/Á‘_'>jšìÍ6*1¾¡"‚=ð+>¨ºWvÑùë¾¥¦ƒyx>ÊÐPõO>‘ou®j¾¥UçÐzm>¨7]îß›¾  [ ƒ]g>YW†‚ó„>›Ç†Ôe¾§›Û% >¥¬pA¬ñݾ“ætjv@&¾ˆÍuØe²>£r+Ñþîw¾§ÐM©{ƒ>¡bUÔ1®¾y°\«pˆ¾˜äÝÕ‡ U>¦M+$f‘ò¾¦¨”Ÿr>—‰‡+ó9>}ÙŠÆ&[¾¡rÖ™ªîJ>§1YÀ…¾¢jŒGâ»w>…_l?ã·>”!v-ôpô¾¤Ôk …k>¦ß Är¾šÉ ìVù¾e?"‚× Ž>ž·Å°{`꾦\ý¨î>£7Þg=}¾ Îl2˜¾Ž¸zÞ?-É>£4³É%¨a¾¥ûÔ˜õT[>Ÿ¡݃¾_®UžÕ¯X¾šd]<âœw>¥UÜ™ .š¾£É§e¨ >’žkÄEËÿ>…?$ËÚ$¾¡rO§e7>¥ ôTTï¾ IçÔû—>y¡*#SÇ>•ör #†¾¤E;2‹|>¤WÛ¾–6ŸŽã¯¾wÙ¬ýó>Ÿ#·ê44¾¥ åS¾$«>¡(˜Kê¾…-­ ʉ¾‘w„ë2hi>¢¼³ìüAü¾¤9[[2„>™%Dé€Ì>V´ï\.êо›0—MOÝo>¤Es«ŒI¾¡Á×ÀQ*w>ŒúÙm€#>‰çú9O€¾¡2MèrS[>¤C•ýpE¾›ÑJ)ˆÑ1>g¶¥t§ßD>—´ª¼¾£Híêa¶Y>¢HX¶á˜š¾’b9Tûq¾€íD¥),>ŸÌ. Þ0¾£½=9Ь">ž6w*¾|–·¢õš¾’Þ¦(G >¢ûù'a÷¾¢“5S§Þf>•P˜OB>p,Ãù–蘾›oàö‘ÓQ>£)ü£UþŸàezýÿ>†-y ÊiÊ>*[äP6¾ ÄËÕ½ Û>¢¢S“§¯¾˜-›äÛôÀ>0¿[»÷ÀÂ>—¤ ‡ ÎúA¨¾€ªNkú¾„Ã(áŽ>ž‰c}R¾¢vd1dXe>š£¾o°Ï¾q Ä‘(Qƒ¾“°ªÃï*>¡ds><³;¾¡#×»0Í>’Þö¹>wýG³AžÙ¾›BŠZ|”š>¢yä5ªª¾œ­9ø|´´>€²šoQ<ª>Bw¤4°Ø¾ 8ièî!E>¡F°#×<¾•Ѭ„—¾\­þ j>—¿ðXëý¾¡r~#9¿9>žEK'.Ì:¾ˆ7Ù¤,ݾ‡~áäÈ$>ÁL÷H§ù¾¡A\¯áU>—µË3¡Õ¾bR…pŠ¾” m߬¢x> žÇ…•¾¾ŸhQ-?ó!>Žæ5› 6>}€¿ÅÄ g¾šÃi(×”Å>¡îòd·¾™éšëë¸>xÎ,=’>2F˜HFQ¾Ÿ1š%ü>  ò•ƒÿ­¾’‡«Öã)á¾jAý¢O†>—Rpâ5ð¾ †©8Ö>›¯e\‚á­¾ƒÊœâü龈 Óðs >œÆÔ”_À$¾ #~T-_>•?VL〤¾G w|  ¾”9[PÎ<>Ÿ©nµÄƾɳ??>Š§FqYú³>€‡$ÉeÎ{î«\> úø}"¾—‘Ø ~×>rTZï‹‹u>^<Îñðø¾Û›®‘<>Ýð®,‡¾sš¡¿ S¾q#D8æZŒ>–ýÖ€5ð쾟F¹; €>™x@³ƒß¼¾€€ºé †O¾‰,¥°aÕ>›«Ì^6¾ž?v>ï>“:î岓ð>7–+*l?1¾“´XÑØ>I>ž¼=ŽV¾šìz)E*î>‡[G„Á ’>xGðW»c¾™ D_oüU>ž(5[Î㾕 NðÞ¾>kp‚!]–u>7rö|Î(¾œ}ðâ>›ê:•××ø¾¢º;D¾sw¡“ýϯ>–E:SÀ+¾˜±£è‘Q>—›†;Ù¾|9b”²Êɾ‰)NÒ¸ >šzz·0n(¾œna®»7K>‘Ÿ9f->P£z…=©-¾“%Ú8Ø>œ“š4·,ž™%º8˜¦Ä>„êBÖÍ>³ÔYƒSGýA%?>œwÞ90À¾” ¡qs >e41âñ¹>™FÛr`q¾›Ì: *­>š9‡àLǾ‹*c=/g¾tYnë6:>•ckùÆ+õ¾œ ÿ`KQ>–Tø7¹¶¾y ×5Þxo¾ˆ’·¾Éß>™=Ž÷¼áŠ¾šÓ;ùº7Ž>bwÃ“Æ >UŒÞP ¾’d_³`­ >›„ÌR¾—¨£G^-A>ƒTCL±;¾–û\NÙå:>šðñ1lú@¾’у+,³ú>buj¿°z¥>ŽR Áª\ž™Â~Q‘ö>˜Ç7pF¡¾‰kÀØâ¾sù LJ >”aàË7ˆ¾š’·ÌÑ>”؃l-ó¾wC#Û ª˜¾‡ šþ›±>—ù„ió+¥¾™j蛂¼>Žöx„“­>U_â|}0¾‘zšõ$>™º®èOZ¾–nÈ확>‚;øJ8tó>€nŽ@¨¾•Ëćö[>™‘'CÆX¾‘ã8ÕÓÝñ>aó·Ž3æ>ŒªA޲뾘mõô3ä>—»bh[¾ˆOT@#G¾rL1‘5>“C»Þ\G¼¾™9âs°>“âÃ\ò¸{¾v¹÷²Z¦3¾…ÿ,‡Â®Û>–°dHŒ쾘0ZâÁ7œ>¿Y(/Þ>P»H¼1¢¾mkYT…B>˜f윧d¾•p¼N¾¯>Ô$Y"RÎ>~'6ñ¡,¾”/å?S}>˜T$©N Ú¾‘9`T“7>c«ëP@Z >Š­ÒyO_¾—Å2Máè>–…äŠ È¾‡ÂÕÆûè¾pÏ¿¡KN>’8ö×~ñ¾—ø³,SØ>“)•aö3rªl¾—ûÒd> aàK >@RNµ¢µ¾Ž€“úP§ã>—àv›¾”¥ÖjÏi>ñ%&eiÜ>z¡¼ Ús¾“?ÀÐ2Á>—3žÑ“¾Ê7z¼Üø>gXn;m7'>ˆdì%ˆ¾•Î‹H®ÖØ>•§yî…*ؾ‡²)™!ξi–óS¦T>Á\Äntó¾–É*pô×L>’¢g!£ßé¾xÇÉMÉY¾ç¿xEŠ>” ñÃë+¾–) d €->ŒÈ7ÐǾ.úvÀ)˾‹éⲕ·>•à.Ú ¦ä¾”‡KgÜ>‚€Fª³>v^9 Ó辑áµT¥Àå>–'ü5œv8¾‹¼×YK¢>l¹ð“™ ¶>…Ñgp¾”}ßdŠ—>”é(`w=¾ˆ ƒ›Ð⑾aG@d4ü>Ž¸ŽZž©¾•¤^ ‘_a>’CÙƒBÁ½¾{{Ú:Á¾~¾d½y¨Ð>’ª9 ]j¾•K…,”!>Œß“'g¾RõÐϲ-ᾉ;oi®>”¡*a°v¾“‚†Éʪ>ƒnôï¶ä>qnÛâÐľp ö>•(Yl7ÀN¾s+}–l&>qÉ\ R>‚øN‡Ãt¾“$U#§¢>”@^bœgW¾ˆ´™BKÞ0¾Pkˆt\á>‹¹Zšªxݾ”’¶ù>’‘Ø ÿ¾~à><ý˾y]öð>‘7£ÅçüA¾”x×ð×áq><˜*›˜É¾bY»s­œ¾†;dïï°>“ZóVäP¾“mæYv%>„©©ÏJÄ>gÃs›åÀ¾Ì攟>”*‡´¥ñ“¾uh·—¸>uÒôUíæ`>±Óåìy¦¾‘»œàh>“¡º:v!¾‰žWë/µ&>5 V/•¿>ˆ€î’„ý¾“WVûÉ¿,>‘Ò¡°!|;¾€ÍÓ¨9LR¾rÖÇä>\tà7Ô龓¦ìÒ–~í>ÇÕm-ѾlVGužµ¾‚ªGþAàç>’¡þà;s¾’­Û®¯0p>†Ø)G¼Ã>W7¤âȾŠ€–hÉÌ >“#œ«Œ³¾„÷2÷§¾>zXáø5p>xè˜j‰”á¾;FÔ®k6>“ß¹BçоŠ¯uÞ TP>\§Å)Çž>…y­öݾ’SøG‹>‘¦î㾂ÁúË? —¾h#žÚv'´>Œ%%³Õh¾’É4yfE>ŽhT’9¾s›;ÿ¤¨¾~ -)·,?Äìp›9 ¿±{žR‚3Á?œj j&{½¿{¦«gZçí¿k¦ú¿!€?{ ì“«¿H¿wèˆOp?hé*~Èl3¿-‘Z€úà0¿[H5¥iøî?b–µ´3Q¿]#»¶¹!¼?G4¨g¾6?8‰,´q¿PÅ¥rͯ?R»l½¿G?Sš)C?¥Hû¿²‹?<'‰j´›¿F*)q\|ÐÞß\ت5¿0> ?,Lu«,Ö¿°ÂË èd?î9[¨ÅB?yÈæüο€Ìÿu«Ÿ?ÎqË‚ ¿ ä9ÐfV>¼H`?¾? ®sÜjû¿‹ÞRXdÞ?O0„f8¾üÏÉH°›í¾õ?Ì€Jë? e‚ú^¤I¿öê^Hh?8²q,\¾ÓÌ9ó¿Øè7 K? I­b I¿ Õ¤Ôt >ù° GÖ¤>ê˜K¢VÄ¿Ͷ“–Åõ? ddñ •Ú¿éòØHÖ>Ú¶é4]àœ>ùã^Ÿ.þ¿›x]Á?¥ùê;ñq¾ö ¬‘Ëaé¾à.÷pS˜W?“ŽBDœ(¿Þd®>ÿÆ~l#€S¾Þj>Isß¾òãSÜÉæ?Ù ý£³¿Ù©hFâ>ó¤«"¿>Ò9 ž†‚¾ù©ßX“Îy?(åΘöŒ¾û()F÷i‹>àT¼2pb>ëÁì1thÀ¾ü«‚c9ô·>ýñl55Q§¾ñ«Ù7–<¾À°_Ø® >ô P{䨾üc=];Ù1>÷†ë—Gu´¾àyX>ü¾äbÜC×¾Û>÷U‰œLŠy¾ùt´lådµ>ðéÇ>”Ò/´ B¾ïØ|ß»öM>÷ň/g–¾ôš«BÎý>àzKTíÁ“>Ý­k‹Â[Y¾ó/Ni{_©>õàt ,n²¾í-ç¶ò>®]a€?ºŠ>éTn)¨£¾ôõ4–Lö>ò3Ý\€ÊB¾àCrö1 ¾Õ,.1Ñy>ïÉ”ÙýÙ¾ò÷F¶›ù,>ê·r©ø¶¾¾£¹äÛ9¾ä0- øÁ>ñ!.¦è!Q¾ð1÷C•>ßÒÈ gº>ÍÏ‹R%¾êzq:*¼>ð¨ú„¾è`%±$>Ä€Ñ ?Ëe>àX§~.U¾í_’—>ìü#ß5*¾ÞòŒËŠná¾Â®iàÕÂ>æ"[OLïö¾íṘSÌ>æ¦Vä]V¾È‚¿Ù|¾Ùrþ†ò7>éKôz¿É ¾ê/Í¢£>Ý÷"ÄÐËÀ>´Åt‘F.€¾â‰Ã=ðØ>é¦@rA—¾äñ7Q©{a>ËkPÜüƒ#>ÓöÀLÿ0 ¾åÜCš±°^>焘Å^¡¾ÜëÊFS¾á?ámðÎ>ß ;‘h¼x¾æ´M³>ãg^µu¾Í±´‘O<¾ÎØ12G"5>âî·:k†m¾åIá㢿V>Û×à8;?3¾Š uó§ €¾Ùó*Šo>>ä&¨‡O¼N¾âüX)Œ>Îðbaº–>ÇC»¥ô³¾àjF¿·Š>ãPêAÎú¾ÚÀj‡Ú7>§Þ+aÓA#>Õœ“…[|¾áë(ò¸ƒ>໢ XÎ#¾Ïà›ÈbÛ´¾Àåé…åqÿ>Üw“qÓqh¾áŽ¦Ilé=>Ù¨¬ ›ÿ¾²øZªî`¾Ñâ…èæd>ßçXŒCÄ„¾ßÕâ_ >Ð64Ãé¬.>· !ÜöX¾Ø¨ÂŽÇó>ßôØâÎ}Š¾Ø’è†RnÆ>¸«ús•>ÍV§Ÿî¾ÜjEeýv>Üö‚†áõä¾ÐTª!¤…¾«ÙoZN>ÕPºRüŠ‘¾Ý6Ì„>×€†¶?hɾ½GN6Ç5“¾ÇÁ±ÙMhMô¾ÚõbFŸ¾>ÐQ»E—á,>˜ªiÇ2½˜¾Ò\äšÕ²X>ÚƒEÀ-¾Ör‚ñKa'>À}D&å0¾>ÂãûU Ž¾Ö‚  b:0>ÙŽl·ó|¾Ð5rÜãy>\¨'"{*>Ï|¥Tt¾Ø%Ö¢…²>ÕifŒº ¾ÁõóÔ-ÄV¾½CÇðÿÜ>Óþ`9øwç¾×Xí¿ås>ÐÝ"ú¾˜_4’üç—¾ÊÑÒe‰‰L>ÕúÐ,å"W¾Ôe’@ˆ@>à 6±¼>µÊ^nËŒ¾Ñ·I‰6>Õ¶ ŒZm¾Ï‚¯/}Ž¶>¥ÑØ ¶Bó>Æ¥‚Oæm¾Óûóµ×f>Óg(9jþÃþ竾®n ÿ3>ÏKÓðB{¾Ô,tœ>ÎàÑ=›Ö¾®qªÎ›æ¾Âça¦Ð¥ >Ò$KÝ4¾ÒnBÒ²>Ä¥¥r¦¤>¢×»Dá0N¾Ë…z¦ƒë>Ò¸OÙÚ w¾Î'^¸ÀÂ/>²€b^ ¤2>¿ÇíÊÍ[¾ÐnñN,/'>ÑzÒ|Þ2¾Å”2re¾‘>äæÅ ±>ÈÛV4(ë¾ÑXÚ8P+>ÍZlŠ*®¾µsAãk„¾¹lK¦+>ͱšûX¾ÐŒÔoJÉ>Åaß•Ó»¾I QÔ±³?¾Äê7\-A>Ð Ð!—DA¾Ì}13ž)>·í ûGÆÚ>³Š¥Ù8Z_¾Ê½©Ëš">ÏHQmBP¾Åƒ5i1þ >­1ñC˜>ÂÍ"ºzX¾ÍŸF!”3>Ë’vQp˜û¾¹ü®ˆâ6¾­2¶Âب{>Çû1e’ ¾Í€*ú°ò>Ńw]]W¾žª¦Jì¾¾²MÈúÖ¯>ËE÷ÈÉWû¾ÊœmßD%È>»¬;aø+>¤C¼à«5‡¾ÅgE€jvß>ËÄð_uºB¾ÅfVõ.¥yCßk8>¹É?®ê¾É fZ­>Éu†w]¾½ÌÀwõɾ˜aÿË”7T>Âý‰êjNϾʃK<˜>Å/J º¾ªØ>yL:¾µCe!¹à>Æç”P³*x¾È•ïrm'·>¾h¶¨c>ƒ™Âqº¾Àº™«½ˆÜ>ÈiýNŸ$¾ÄáH@{ ~>¯„¼ˆ ÷>±9m¯P¾ÄÞÊûF5~>Lj}½ù”h¾¾âµ÷S{¢>jÓŠéf"y>½7Kñ$ôœ¾ÆËJÊ%b>Ä~áÍn‹ ¾±Çn01©¾ª}Ú¸Î+>Âíü)–k¾Æuã€qà>¿p6Ô¾ŽcÐà3Šã¾¹Å6=4fXp¾Ä Rý€ã>³‚LªIÀ>£g«ËÒ¾ÁŸd¬¨È>Å_BíÏʾ¿ÅjÁU>™Ó†wLý>µ€¯a=k¾ÃªÒ´øÛÜ>Ã…’oq©œ¾´øíÕ;þ¾™Âä8Û¾>¾™ÅìZ³Z¾ÄE‚]ÎõÇ>¿ç„¿Åɾ¡« èý‡¾±þŸŸHäb>Â(ð”¦5d¾Âò]çÆÝš>¶0Ä¿?|†>‹†|‰®¾»6Ü$$žb>Ã)ŽÏ6Õ!¾¿ÚñÉÎ9¢>¥æ¨®dyC>­jÙ€¾À°¤š#­ª>ÂRDò±¤¾·.j=”)¾fPý̓5>·úïÝ펾 ' $Qr>¿£ˆ'Å£Ú¾©¥~ßf¾§@®#•Ÿx>¾ƒÑˆä)¾Á¦­SDYÄ>·ö)„ôŠ¾}OÙŽŒW¾´ä­°ð5>Àî¬8I¾¿Dí­ºV>¬ïK<Q>¡|räîlä¾»¹¸»®WŒ>Àðâ[ ·×¾¸‹¦dx@>†pï±Ó>±òý‚ü ¾¿ C´>¾Â:%Íäd¾¯ÊýÃuœ¾˜1î2Ro>¹O:B9¾À2†BÎ>¸ò\ð0x¾˜ânújãT¾®IëqgÕ>½edwÞ‘±¾¾x8 Ö>±dÜ*³J>ŒK Eð¾¶`TÚ2N>¾Ö°›4Ü“¾¹-@„Oe> 8·e^©n>¨óµ,:F¾»-a¤aà>½\@Z,×K¾²(%ôÆ;’¾s4 VÑ->³Ñ¨kýC9¾½;{jø{¢>¹?<%°‰¾£žUî©$ý¾£â,2›«õ>¸ùhºžƒl¾¼~/¿Ÿ!>³M®U}Ú¾næ˧n¾±W•æH· >»”~òtؾ¹*ÍàPÓL>¦¥Ùºÿ&>ž(ÍhB‘¾¶Ê¤¶^YH>»†Š0òE°¾³°1ýº«à>‡º‡³Ç/H>­äô™û™O¾¹ã ¼‹ ^>¸òy!ˆØC¾©S _ß×¾•k¢x>´¢nøÔÒ¾ºw¥ždÓl>´3ûøˆ^q¾“8 ë7“@¾©EäQÜ$>¸*¶,¹2V¾¸˜lÞým>«©Y[ˆ>‰qmH‘¾²ð¨—yÓ>¹Szþåv¾´°ï‘¨C>™ñ•O¬`p>¤ÒêMv ý¾¶kŠ1ô{>¸êžj¾­ªû¦”»+¾qÞ@uÐmØ>°j‚~ê´¾¸qœ•ü›>´Å8[;ç ¾ S|Fr4¾ ky+9›>´§Þ>ü\L¾·‡ï`G>¯[š•žBý¾h†s1¾¬º¢Rþ(N>¶Ô9¤d+P¾´ÖdXÚ]>¢Æ`ç]¦›>˜í²Æ³œ¾²áo×@¿ª>¶Õ”­µt\¾°^Ýúù8H>„&ïXaŠ>¨·oS)iy¾µ|øË€n¥>´Äö°¤3¹¾¥:2/‚΋¾‘ZÅZ™>±ø.¾¾¶ ½( (ý>°éãy?d`¾“J8 *¾¤ÍÐ2&¤>´»‡¸ ¾´’¥ª¥¬Ö>§cGÏ¿>ƒh—"Z¶ß¾®¦_Íÿ’>µ&n/y{¾±P3ʆ¶|>–Ž‚©Ûú>¡çàæ¾²¨ÿŠs¼>´A!÷™1_¾©BÂ?T÷›¾ew»‡Ô•>«šÏ„@¾´--Ã3á>±’ö¯û¶¾œÌæ¼÷澚£ÑR¤Da>±0(é“ËO¾³ÒJÞû>ªÚšÕ½”¾oq#Ìm½{¾§‰µò>³ ÷å™<¨¾±³{ã1d£> |`ö6#o>“‰Žü$€Ë¾¯` †Ž½ô>³G>¸5³!¾¬*V-~k>„?Ð2” >¤(8•ëÛx¾²®r~¨<>±²ñ4úlŠ¾¢³§P2ñ×¾‰nt‚”>¬U)¿¦Ò¾¾²¢E°×è>­5¥–fÓ¾ÇÑ9j‰µ¾ Â}/×¼6>°Ô® `À“¾±’²”Üÿ(>¤¨¼—2Ø>xƵÇÕо©C‚ÁeÝ>±äëŃ@¾­ûƒÌ’Mí>•73¾fžâ>šÞ£wÉ-¾¯1¿‹}/>±SÿÞ´/¾¦[¹r¼¸=Ý.Ü)F >¦.ùÄ¡¾±ùK U”>®Yˆ´=T¾šš‹ï¾”dK´.n¥>¬¢µyŽ9¾°øMƒÑ\>§ÌÒ^Ûf¾wxôˆÐ´Š¾£°†’ˆ¶>°(E)ÉàŒ¾®ÂàÓÛ&>ž‚„6mŸÜ>Œ9#Âå+¾ª4d¡s>°€ûKWt¾¨ü\J–´j>†¾,g´PU>  †AH[¾®Ye…Ûuã>®Å‡0L¾¡;îS/9¾€¼Œ(Y>§NšvG ¾¯ßC^ø¸>>©êÕ\Ž¾|÷€I\¾šP%†ê>¬@li$LÓ¾®‹Ðšà3Ì>¢øD±â>b Ý>‡`˜¾¤‘ånöh>®‹’0Ê ¹¾ª˜ê{ÄüŸ>•;Z·i>”!ö¾ÍÒ;ª ©6Š˜¼>®ú±¢$¾¤x9¿²Î>j,•†Tì¬>¡Î®Àø¿j¾­ l•®ä!>«}8ùö€¾™ŽPÀÒÍƾŒª¾wdÕD>§¹H\qu(¾­iZo Ì&>¥ºM·×‹(¾€þY0Êò¾¾ž]…O€>«_CíNi ¾«7ª‰3‘¥>táF’‹À>f™sD.¾¥Sš¬RÉÌ>¬…¯_jöÀ¾¦¾Yr…á >ŠÊÒ»ÞÉ}>˜‹ùjÖÆI¾©Ž• 3>«*Ϣ؀ú¾ u²c´AÛ¾jڸ朕>¢Ý0YŽŒ¾«n¶L.9·>§„-l¥l^¾‘òe¾Zk¾“ízá>§š‰*®¢¾ªâW¹ÕÄ>¡÷•9šõo¾_ö1³¼Ø¾ ZA‘£®>ª'®8“(—¾¨ '9 @œ>– ‚X7>‹aæ–­¾¥‰$du>ª`Ú»n©Â¾£>¾ßx¹ã>{ŽÚß&yx>›Ÿ²]•2Ò¾¨³Û}Ï¢?>¨V¬Êøô ¾™ê¼PþÑ„¾€Û->D|>£^ ­œ¾©§ìþzòÎ>¤J[B“ÁV¾‡÷öäÈw¾–…GsNô}>§oÖZz¾¨d¸Ü~c¾>L/Á‘_'>jšìÍ6*1¾¡"‚=ð+>¨ºWvÑùë¾¥¦ƒyx>ÊÐPõO>‘ou®j¾¥UçÐzm>¨7]îß›¾  [ ƒ]g>YW†‚ó„>›Ç†Ôe¾§›Û% >¥¬pA¬ñݾ“ætjv@&¾ˆÍuØe²>£r+Ñþîw¾§ÐM©{ƒ>¡bUÔ1®¾y°\«pˆ¾˜äÝÕ‡ U>¦M+$f‘ò¾¦¨”Ÿr>—‰‡+ó9>}ÙŠÆ&[¾¡rÖ™ªîJ>§1YÀ…¾¢jŒGâ»w>…_l?ã·>”!v-ôpô¾¤Ôk …k>¦ß Är¾šÉ ìVù¾e?"‚× Ž>ž·Å°{`꾦\ý¨î>£7Þg=}¾ Îl2˜¾Ž¸zÞ?-É>£4³É%¨a¾¥ûÔ˜õT[>Ÿ¡݃¾_®UžÕ¯X¾šd]<âœw>¥UÜ™ .š¾£É§e¨ >’žkÄEËÿ>…?$ËÚ$¾¡rO§e7>¥ ôTTï¾ IçÔû—>y¡*#SÇ>•ör #†¾¤E;2‹|>¤WÛ¾–6ŸŽã¯¾wÙ¬ýó>Ÿ#·ê44¾¥ åS¾$«>¡(˜Kê¾…-­ ʉ¾‘w„ë2hi>¢¼³ìüAü¾¤9[[2„>™%Dé€Ì>V´ï\.êо›0—MOÝo>¤Es«ŒI¾¡Á×ÀQ*w>ŒúÙm€#>‰çú9O€¾¡2MèrS[>¤C•ýpE¾›ÑJ)ˆÑ1>g¶¥t§ßD>—´ª¼¾£Híêa¶Y>¢HX¶á˜š¾’b9Tûq¾€íD¥),>ŸÌ. Þ0¾£½=9Ь">ž6w*¾|–·¢õš¾’Þ¦(G >¢ûù'a÷¾¢“5S§Þf>•P˜OB>p,Ãù–蘾›oàö‘ÓQ>£)ü£UþŸàezýÿ>†-y ÊiÊ>*[äP6¾ ÄËÕ½ Û>¢¢S“§¯¾˜-›äÛôÀ>0¿[»÷ÀÂ>—¤ ‡ ÎúA¨¾€ªNkú¾„Ã(áŽ>ž‰c}R¾¢vd1dXe>š£¾o°Ï¾q Ä‘(Qƒ¾“°ªÃï*>¡ds><³;¾¡#×»0Í>’Þö¹>wýG³AžÙ¾›BŠZ|”š>¢yä5ªª¾œ­9ø|´´>€²šoQ<ª>Bw¤4°Ø¾ 8ièî!E>¡F°#×<¾•Ѭ„—¾\­þ j>—¿ðXëý¾¡r~#9¿9>žEK'.Ì:¾ˆ7Ù¤,ݾ‡~áäÈ$>ÁL÷H§ù¾¡A\¯áU>—µË3¡Õ¾bR…pŠ¾” m߬¢x> žÇ…•¾¾ŸhQ-?ó!>Žæ5› 6>}€¿ÅÄ g¾šÃi(×”Å>¡îòd·¾™éšëë¸>xÎ,=’>2F˜HFQ¾Ÿ1š%ü>  ò•ƒÿ­¾’‡«Öã)á¾jAý¢O†>—Rpâ5ð¾ †©8Ö>›¯e\‚á­¾ƒÊœâü龈 Óðs >œÆÔ”_À$¾ #~T-_>•?VL〤¾G w|  ¾”9[PÎ<>Ÿ©nµÄƾɳ??>Š§FqYú³>€‡$ÉeÎ{î«\> úø}"¾—‘Ø ~×>rTZï‹‹u>^<Îñðø¾Û›®‘<>Ýð®,‡¾sš¡¿ S¾q#D8æZŒ>–ýÖ€5ð쾟F¹; €>™x@³ƒß¼¾€€ºé †O¾‰,¥°aÕ>›«Ì^6¾ž?v>ï>“:î岓ð>7–+*l?1¾“´XÑØ>I>ž¼=ŽV¾šìz)E*î>‡[G„Á ’>xGðW»c¾™ D_oüU>ž(5[Î㾕 NðÞ¾>kp‚!]–u>7rö|Î(¾œ}ðâ>›ê:•××ø¾¢º;D¾sw¡“ýϯ>–E:SÀ+¾˜±£è‘Q>—›†;Ù¾|9b”²Êɾ‰)NÒ¸ >šzz·0n(¾œna®»7K>‘Ÿ9f->P£z…=©-¾“%Ú8Ø>œ“š4·,ž™%º8˜¦Ä>„êBÖÍ>³ÔYƒSGýA%?>œwÞ90À¾” ¡qs >e41âñ¹>™FÛr`q¾›Ì: *­>š9‡àLǾ‹*c=/g¾tYnë6:>•ckùÆ+õ¾œ ÿ`KQ>–Tø7¹¶¾y ×5Þxo¾ˆ’·¾Éß>™=Ž÷¼áŠ¾šÓ;ùº7Ž>bwÃ“Æ >UŒÞP ¾’d_³`­ >›„ÌR¾—¨£G^-A>ƒTCL±;¾–û\NÙå:>šðñ1lú@¾’у+,³ú>buj¿°z¥>ŽR Áª\ž™Â~Q‘ö>˜Ç7pF¡¾‰kÀØâ¾sù LJ >”aàË7ˆ¾š’·ÌÑ>”؃l-ó¾wC#Û ª˜¾‡ šþ›±>—ù„ió+¥¾™j蛂¼>Žöx„“­>U_â|}0¾‘zšõ$>™º®èOZ¾–nÈ확>‚;øJ8tó>€nŽ@¨¾•Ëćö[>™‘'CÆX¾‘ã8ÕÓÝñ>aó·Ž3æ>ŒªA޲뾘mõô3ä>—»bh[¾ˆOT@#G¾rL1‘5>“C»Þ\G¼¾™9âs°>“âÃ\ò¸{¾v¹÷²Z¦3¾…ÿ,‡Â®Û>–°dHŒ쾘0ZâÁ7œ>¿Y(/Þ>P»H¼1¢¾mkYT…B>˜f윧d¾•p¼N¾¯>Ô$Y"RÎ>~'6ñ¡,¾”/å?S}>˜T$©N Ú¾‘9`T“7>c«ëP@Z >Š­ÒyO_¾—Å2Máè>–…äŠ È¾‡ÂÕÆûè¾pÏ¿¡KN>’8ö×~ñ¾—ø³,SØ>“)•aö3rªl¾—ûÒd> aàK >@RNµ¢µ¾Ž€“úP§ã>—àv›¾”¥ÖjÏi>ñ%&eiÜ>z¡¼ Ús¾“?ÀÐ2Á>—3žÑ“¾Ê7z¼Üø>gXn;m7'>ˆdì%ˆ¾•Î‹H®ÖØ>•§yî…*ؾ‡²)™!ξi–óS¦T>Á\Äntó¾–É*pô×L>’¢g!£ßé¾xÇÉMÉY¾ç¿xEŠ>” ñÃë+¾–) d €->ŒÈ7ÐǾ.úvÀ)˾‹éⲕ·>•à.Ú ¦ä¾”‡KgÜ>‚€Fª³>v^9 Ó辑áµT¥Àå>–'ü5œv8¾‹¼×YK¢>l¹ð“™ ¶>…Ñgp¾”}ßdŠ—>”é(`w=¾ˆ ƒ›Ð⑾aG@d4ü>Ž¸ŽZž©¾•¤^ ‘_a>’CÙƒBÁ½¾{{Ú:Á¾~¾d½y¨Ð>’ª9 ]j¾•K…,”!>Œß“'g¾RõÐϲ-ᾉ;oi®>”¡*a°v¾“‚†Éʪ>ƒnôï¶ä>qnÛâÐľp ö>•(Yl7ÀN¾s+}–l&>qÉ\ R>‚øN‡Ãt¾“$U#§¢>”@^bœgW¾ˆ´™BKÞ0¾Pkˆt\á>‹¹Zšªxݾ”’¶ù>’‘Ø ÿ¾~à><ý˾y]öð>‘7£ÅçüA¾”x×ð×áq><˜*›˜É¾bY»s­œ¾†;dïï°>“ZóVäP¾“mæYv%>„©©ÏJÄ>gÃs›åÀ¾Ì攟>”*‡´¥ñ“¾uh·—¸>uÒôUíæ`>±Óåìy¦¾‘»œàh>“¡º:v!¾‰žWë/µ&>5 V/•¿>ˆ€î’„ý¾“WVûÉ¿,>‘Ò¡°!|;¾€ÍÓ¨9LR¾rÖÇä>\tà7Ô龓¦ìÒ–~í>ÇÕm-ѾlVGužµ¾‚ªGþAàç>’¡þà;s¾’­Û®¯0p>†Ø)G¼Ã>W7¤âȾŠ€–hÉÌ >“#œ«Œ³¾„÷2÷§¾>zXáø5p>xè˜j‰”á¾;FÔ®k6>“ß¹BçоŠ¯uÞ TP>\§Å)Çž>…y­öݾ’SøG‹>‘¦î㾂ÁúË? —¾h#žÚv'´>Œ%%³Õh¾’É4yfE>ŽhT’9¾s›;ÿ¤¨¾~ -)·,>•÷’N¾’Ažä½»­>‡®±žøôk¾*¢î(Ûä ¾†ò6á®æ>’ ó؃¾•rCä«>4úKÇ­¿>q™yÁB`¾7{EôŒë>’PlÝQP&¾‹Î#FáY>jÚt0±>Dë¢wù^¾ÂÜÂõž>‘qrT0U¿¾„ЈõÐe¾SH+‰yn>ˆ{ƒËTÖ¾‘Ò«qÃ[á>k r’¾yXµ6\]¾vcSò‡kx>Žj¨i¾‘Áoz>‰HFy€¾_RM ±S±¾ƒ%EöæÛ>ËÒÌ4¥¾—¡,#³¢>‚~êZ>cœ/ ƒ.¾‰«\L@d>‘‚Œ ׭澌ÝÏâ¬#>søX ÞU>zyzé·/ξŽ‡BýöÄ;>‘# I±¥/¾†ß/… ;>F–¿¾— >„—Ø-ró¾¶ý>òv>tÕ—¹qï¾7sYE¾lI¤lc>ŠŒ)Q5¾‘U‘ÁIõ>ŠÊLÿu¾n2^‹Ž„¾}çüõÉÓy>ŽÆâŸ`÷%¾{©p ·>„ší¡=Ÿ>9š#þˆÖá¾…Æ­ðó>‰-HZ†¾¾(vÆ6P>zžà›Jjƒ>qÝ@xî£o¾‹(bøYK>«óO7un¾ˆÏ%7¾õÊ>ezŒ{­8·>€]øNqŸ¾ŽÐ7N> ½n]px¾‚€¸¹O‘”¾UÔ¦Ãß>†®®jd·&¾I@Ε Õ>ŒòŸ´Kù¾vvKó1ÐV¾u¢X‚Ä#>‹ˆÛjebä¾0“G[Šú>†òâSÂN¾[>ê¼ý¾uxGÒÀ>Ž­[Ïi–¾ŽK‰Ö×Ç>€”oQLI#>aŠZeí.!¾‡X¶V5¿0>÷-1ª3¾Š}L]V–=>rÀ ,w‹>wœ˜ßC`¾‹·ŒÑå>aRµÞg¾…9ùPï¯:>LVå8 ä·>‚e;’‘½¾ŽfØt}kÇ>Œÿ+œµK§¾}±—jžg"N,º‰{>‡Ìx½aû¾J²‘Óï>ˆÿЭ|‰ˆ¾nø`´ˆQ‰¾y·+ý6PY>‹¼~1"¾Ž_üjtÇd>ƒ¨4?fl¾%¯&…¤ `¾ƒæªÎt*>Ž®ðÿؾ‹Á£÷–°¶>zœÏÅm«>kÁWb ´#¾ˆ;îx÷>Ž‘wéè¦ý¾‡ŸÆ¤1>iRÓÜs @>{]±mn*澋Ÿ6úBKÃ>chõeô¾‚?ÄMA6¾;•…³æb>ƒ‡¸‹f ¾“Ö+á^>Š—¨yÛiA¾wì§\z'¾ow¼þ‘ð>ˆ-•j$n´¾Ô 0Ý>†`<àOô ¾dŠ¼mí¢¾|™Äáù¼ >‹f1Rä³Ý¾Œp¥@åŸ>f¯íu>Mzž3º¦¾ƒÒuÑN¨&> ‹k·q澉„Ò¾Å>uŸä õ{>q*ßøP§»¾ˆ'gÀRØŽì¾…C9ˆ/3b>`–¡?Ý6>}tê5{¥¾‹”e¯÷>‹‹—8J¾ßͱs%¾TéÔ>×(c>ƒõ>¼Áű¾Œ[°ˆ‹¹=u˜W¾s´¿¿Ô0=¾r5†ÈMz>ˆË}4¾Œ] [‹¯%>„Iß;äî¾Zàd†BŽ ¾}÷ãp†³>Š¶BQÌC¶¾Š·×¶>~9HV¤[>Y‚Ä*ÛÃ-¾ƒô‹qþQT>‹ðŽõòZE¾‡® G‰>r(¨ÁÏhö>rã KqÜq¾‡Ç8Ε]>‹«±NÓi¾ƒt¢¼ŸE>V@Ü~>~*€Âtdq¾ŠG¸à(>‰õ T_š¾|–4‚uƽ¾\Ÿ›+šêU>ƒÔ"Z쾋]u~ ƒ>†ì¦ ’’¾pø{ÁKUo¾s9öö9rž>‡tªqkf¾‹&°Æ>‚ÃWÙû4€¾RÊÁ*ؾ~ˆZvÁ÷>‰ÎBúŽ ¾‰F“¡‰ýÈ>{n·RæU>^V{»C?ž¾ƒ—%­sÊØ>ŠÊo·ºñ¾†G¤ÊÓ">p ” Z•>s@ ~nñ¾‡Šdùž™9•¾‚5Rµ®ÉË>PÝaûù»®>}¸˜ÛéE¾‰Kô4ï>ˆ¬ „o5ܾz–à‰ö'o¾^¼ ñ|ê>ƒ@Ür i¾Š8 †zÊ“>…¾€gðÎƾo9öåYiq¾rú6uãØ>†˜¢Ø<+¾‰ÑÔívÃ>É]úÙ¾PA?[»X•¾} 6á6>ˆÁÿ]#{¾ˆ%)ÊtÚ:>z K°nù×>]âzÐèо‚бUlw>‰¨‘×ïm¾…P1±Qu«>nÒø>¬û>rl×ýIj¾† Á:.³>‰IMÃÉ¥¾}Ø?}>PäùNO×ç>|GKkÒÑ5¾ˆ0Öò<‘>‡°éQpØǾyÈ(.Sõ¾[ÙüEÊ«>‚J1æ%NÞ¾‰Z°.ð>„û+D·¾o©MŸœ¹¾q›f "F°>…{þ@QÕ'¾ˆÊnœG@}>Pºì>öï¾R·ªê.N¾{6̙ϕ>‡˜6+/j“¾‡M¯…·’•>yÈÉ ›Zù>X°ÕkŽJ;­ €ôy>ˆŒ Á¥²ô¾„½gÚÔ¨ð>oÃ2\sÉ >pˆžN²)¾„Ö]ÞÉ>ˆS |¡G<¾?«ÃôÂ>U¨¸S×€¡>yî>¯=8¾†÷<ÚyÂ>†ùKé֡ξzrp‹”оTt8© Û>€ù€VuHD¾‡ýä¿”>„”ZDÀ.ô¾p„-ÅÝ´¾nm0:XÐD>„ p¹ßÛ¾‡â·Ã¹Òä>GóîƒHa¾Y¨x˜xV¾xnÄNuª>†Lw{¦C ¾†±ÍÅ>zˆV  À>N`êÀƒBÓ¾€.ëC €ì>‡jµF'þÚ¾„|ú ¡… >qd‰Ì!ô=>kMæ3ȾƒXùýï_§>‡téúÕ}¾f}göyÂ>^¥-êWÅ>v¶Ë_ÿ¾…•ì, ½Ê>†q¿„É9¾{.Gíœæ¾AãBû+->~™>´%F|¾†Òf¢ýoŠ>„s¿-,O+¾r}8Ëý! ¾g¶@µØ­á>‚~Iç*¾‡ÛêóìÈ>—¸¥–é¾bGt‘P¿¾tÇìE%ß>„Ñè¢¿í¾†7©ì"Yä>|,è«çÈ>7Uç(Áb¾|£$lDC>†0å»­Î×¾„t¯-‡%>sÈ%Vì)>c©Ø°º­¾Žc ç)>†”³(œ¾×Ÿƒ|gÃ>e¨à"ŸC>r ÚÑqHõ¾ƒû%» ,g>…þˆ:Ud™¾}{T>#õ>92¸¹<å>zyQ°›‚¾…‚“‹±z>„{Q>I0<¾u>”ýg ¾^R©¬A­š>€‡ ºÄì-¾†#_ËM(>‚!¦º™Wœ¾ikÕ\¸§¾pAýöªl>ƒÎ!!Ù;¾…Á8"xø>~ X§w°ã¾N_“C÷|$¾x5ÒAÜí>„Ãhç. A¾„‚©ÿ÷3w>vØäo‘V>Tv"Í›K¤¾~Ë룎µè>…’|«Ò›¾‚pÄù-„Ã>mƒnn ´µ>kQÒRC¯¾‚¹Lóâ >…{~aÖ¨ˆ¾N oÿÆ>XÓ“"Úÿ>u~7Թ¾ƒï–3Ð>„…-(“¢¾xŽZj6†¾Cí§s•ý>|QJn5¾„øµÕ7šÜ>‚¿a3!¢p¾pð]‡ÈöŽ¾e¯bN}¦>€ñ{fîòå¾…&«åÁš>€AʸÓü¾a˜i‹ÎS¾r©%YTÙŠ>ƒ òw¸I¾„|Æ’ b–>zTÌÉ á¾‡Õel¾yšxW›ý»>„G{UýM5¾ƒM­;*>s9iõ ò>_?Ðê…Ô¾k†)ì­>„½÷X®m¾€ÚZÉôùÌ>fûUez>o/öëU‚‚¾õL“4>„bæ(Ó"°¾| •~ ÓC>K26±M>v£'3︾ƒyPþÖú¸>ƒAµ»Êe{¾u‘H¹pWR¾RPvOsä>|°ñv­¿¼¾„8uU³D™>iáØkpS¾l›gãnŽ¾h–ÆX>€Æ¢ô]¾„0šK©8–>}ä]»›O¾Z„‚ˆ½ý ¡¾ƒg73cž>wìÆüÎ?>2‹eտ˾y®ɺ©Q>ƒ’^ ŒÄǾèØø¦>q,üþNÅ>aˆ»¹Vd¾~ãÓ8Ü0×>ƒÞ§…Å„þ¾‘(S¦ŠÂ>cÔZjÚú>o×95n l¾p‹m·&Õ>ƒoê·\;¾z=ëH¬„>C[KTˆ¿>v^ío½mw¾‚Äet}P¥>‚NÿT÷`¾t1ØNº¾T `ük'>{ç"È{H较e°/bºü>€‹!‹‘yù¾j†âCò!¾hX+‚MJ4>€+ý媎¾ƒS–È(†<>|q¼ÐZ:¾X{¶W¿:¾rÂdøÓ‰>ÈgV¬p¾‚“xÚF0>vá¼+ÍÞ>1Ò;Š¡ƒÔ¾x’YÛy›>‚¾Z Vºr¾0«]ž1>pžP¦y1>`]?FÀTA¾}n@=–« >ƒ ØO]ÆÕ¾~x·IÏY>cÉ… ídæ>m°Þjà5¾€˜ÜìDl†>‚¬ôð (¾y•Tj½Ï)>G’Œr·‹>tã¤Q¶Œ¾á¢–V³>¯D5cÙè¾sêFwâ–ž¾OÕ÷Ö]>z“ß-e¾‚ŠcªsJZ>€ÉÝ‚‹ö¾k[0ªþ§¾eLÕØ÷ Ç>~baj÷`¾‚‘ù3(ò…>| !»ñ¾\a§ÞŒ3¾pÚ9,ôžc>€É5öÑ83¾üv(´ê>w#=ž±/¾,x]à%E¾vdÍJ¨ý>ÍQ8%r¾€Òüx•[{>qeÛ¼ÎÞÅ>XÑ¡x¢¾{Pn º1>‚9)Í`b*¾~F࿆7Í>f†u=\ï;>hùaÆ…µæ¾~ßÖ;œÿ>‚ ŠOù.Õ¾yþ¦š¬Œ2>S~¨‰õêì>rCWW{F¾€ËS*>Oß/F—}¾tö‚Ã"º/¾8îBO¡çò>w\›ãƒÙ_¾™¸sºÍ0>€ CúÀÖ.¾n¹aÜ;3X¾_PªQÙ >{¤xžÁ&¾Ø' kù>|•ƒrR+ª¾bèׯ|þ¾kDû.í>~þÚN,¾ˆm’ŠQˆ>xDâ1ï쓾I½ö‚u¾s$÷+ÔµË>€«Ú=¸•¾€±OÇ"Kô>sJtŽH_Ê>G}ê%«ýT¾wÝ©B,~>R±y’8¾~ºF l`ü>k£{[ÓÕ>aÊ{žUþª¾{ÊmÎ0¾>på–|_e¾{3 <܈>`ìT4P>lùq_·T¾~ÒèÉ^I> 'w¾vî"Adñu>@Û›œî˜>sŽ8ÚF¢¾€s?•À¥^>€'ŒlL¾rEµ/ý¾N1°+öQu>w÷Àmht¾€þy"’À>} ê3ë|¾iˆåàÒ1¾bãþƒQ!÷>{–¿çñ¾ ¥_Èr>z%ÀípÃw¾\ÇCw͵¾mdýµñ/>~jV£Y÷¾€šû“Éé>uüûçLr}¾8F€T?@ñ¾s‹gë'‰>€(”P¶Õ¾l©{m–`>qIµäz%Û>PiðΈ3¾w¶Ã¾Cý>€¤ªGæj¾|ÌÀÅðÅÌ>hb3ä]µ>cùV“£¾{(¶S‹÷>€©sÆ÷¾yn΋+ìæ>[hyI}I:>m#զő¾}ÎY¯îj>€:| ¯w¾up  A‚ >6½Â³B >s%l™}O¾›™8¯I>~½h «.!¾pðÉZ – ¾OŸ$"w§>w"`K&œ~¾€E(n„1o>|=NW­¨æ¾h&^–Mû¾bB#1 =×>zqá’SG¾€MK£ß^œ>y “1|™¾[êÄ'õò/¾kô=Q<§>}í±]¾ÒÛ7•€™>uBämœq2¾<³:¤×@V¾ra¸Ê£´>~Êž¹Ï—¾~>…’OZK>qZç‚`A>JÆ­û2#¾v>B[âo>¾§ôçš¾{íÕV^¨>hÆÞN(6B>` IFR‚?¾yzÂ_©A>ë{ÑÈ6¾xõ›Ä*/Ë>^2h-ò©œ>iøÆs±¾|¡0Nš>J2Ùô$¾umŸ§2ÍG>Dßù<í’>qBk£‚`í¾}Ùî«ÞJ >}訡f;¾qp=[÷$v¾Bt1YLl¶>u [Xùô©¾~ëÔ~d«>{Õl)Þ!¹¾j4fNX/¾\R€¥ ì>x@Ýq} ±¾<àßxÕ˜>y"Ã?ÃCŠ¾a0ï×ZC¾g5ÇZU>zÖø£'n¾~ÐésXk÷>uåžæŒA¾N½ÀÛèé¾o׋V}e>|ÁÇã{Ѿ}°!O‚E>r5¾s] >+=ü×j»ø¾sƒ„ñÍN>}ûZ¹÷ ¹¾{çþçfˆ>lYnTù>UÅqä𽉾v¾,Av¸°>~‚)s:ÎÚ¾y…5ÛèÊ>cÈ|¯¿`>c©»Gd¾yh=}`>~Xu–2'¾vœêžÃ­>UÛÃì:X>kÙV˜PÒ£¾{v€ã\Úë>}„ØAU¶¾¾sC/+º×>/ñëé—>q¤-Wréɾ|âóVa¹Z>|sòÊ·¶¾ot–ºp¾KH³úA %>téÜé~U¾}ªˆyj0>z áR;g*ŒËâ¾^¬,¬J>w¯x…¾}θÓk‚>w¯?¶Öf¾]ÁšÆd…ò¾g`‘âê¯>yé •3ùX¾}R`ªîÓ>t‡/wÛ{©ß'n¾|>û™’ ½>q.ÌܨÑû>/óËËX`¾r¹Âg Æ>|¡v–¯i¾zžPÝÞù>kjâm—¤>TvÇdð' ¾už(ʯ»>}μ^”¾x}©y×—å>coWÍä8>bµöJÍE¾xcvá…º>}$úy¾uëïÈ}Åë>W ss‘ˆ>ivÙ±%Ö¾yïíÞ¤J×>|U›ªD:¾rù¢ð0‘Ì>p"²WAHö¾{O|®`8‚>{#ôøÂPñ¾oqW ¸M¾A€9q&‰>s&å„ÌF¾|%Â5Xs>yuŒóóóD¾hw›pW‚¾XûîË>uÁü“çL¾|qGÊj±©>wVhû‘V¾a*ƒm4оcbm}K›¡>wêΓ‰¾|7|º»T>tÔˆuðÞ¾S`e]$êµ¾j97~‘ >y›6'ä ¾{|YiîÒA>qÿ³ÞBz¾1eòÙþÌ<¾pzÏ£4ž¡¾zHÄú“ƒc>mË0Ê ¸>Dõ Pë¾s’|Rkê>{†•y䃾x¥Ì¾üû>g2 ]‡¤>XÚ!‡D‚ǾukÕû`à>{ÁR/-¢S¾vžÝfeµH>`RàIÓóÌ>cDµùY*£¾wk– b$>{ƒKïcuϾt@=íjz´>Rœ1x©˜>i©È €Ã¾xý‰Ó>zщ Ïó¾q—mZ<]>2@ ñE>o„M ä7¾zÚç¹z,>y³6õaY¾mcnM¯võ¾B¹ófxßœ>r`[‘F¾zÏåsø>x1ÅâF¾gt§–ã%ï¾{<Øï>vT„»í›É¾`ÕP½c2ñ¾aÜ'Ôkû>v‘dIvâ ¾zå» ª>t(¢ÿ™,O¾T–6sÏì¼¾gædþž>xœÜ¬ª¾zRFár>q¹ôÔBö¾=ÅÝl°q¶¾mwe~4«.>y=âù'Ž,¾y\ÐйC©>n#&ªáO>6@•ï#¸ ¾q>×p=>yý6}Å÷¾x ŠÉøîÎ>h}2ÖE´>R<í˜fe¾susoÉ}>zXžo#JÞ¾vjµÂó<>b™'`ýQ>^h¾qã½¾¾uZScxm>zR €-º®¾t~€¬RÏ>Y‡`,C>dõëìTÕ¾vék•Žÿ|>yîÁ[k ¾rSx=š³>I×'¾Ç~C>jPØ TjÕ¾x 6˜¥Â¿>y2§û¾oæïxÚ/è> ;#y´“ƒ>o6,eÄÚ‰¾xþÝ‚ñ->x"Ô–­¾jÑš©³P9¾F=|ÏÜ>qÌÂQÔz‡¾yƒ"Œ‘‚>vÇi Ï¾e{¨¾ßN¾V¦)wM¯ß>s¸(>Qô¾y± ¡óu>u( *Avª¾_ô’Ë¡ý¾`Ô•U0‡>uY¬c…v¾yŠâåív9>sL†wAT¾TÂÀ›Õ~›¾fE6Ž>v®ó$O+6¾yZKØ0E>q=C!K˾CØc{,¾jÕÀRÁÓ>w¶sÚ$»¾xRøk¸>n7ŽéÓ>fâÀáj¾o:Gâ½(>xp#¿{ÊS¾wI¤þE@b>iMñã)Ë>HíÀÛéeѾq•œÎŠ>>xÝ W~ñ´¾v'”sà>db« vVÜ>VúË'ǞǾsP%÷8nü>xþÇ+(u¾t~þÆrQ>^«gïeù'>`‚ ëóD¾tÉõÝå‘>xØ-)^òó¾rÊVFŽÏÁ>To’WtxÕ>e>Ì >÷â¾v£èéÑË>xlÖÂ>Ð~¾pê/Q¨ >D`cë÷þÕ>i§Ÿ.ë*¾vöRv”{|>wÀ¦Õæ4p¾mËQ‹þWè=Æ™z”ä>m³‡3ÍŽ¾w¨¨£ È>vØfÕ]ºó¾iˆVºèB¾CÆ”>VHè>p­µôå`¾xô3Sü->u¹U¥Ѿeõ!ç\¾Sƒ–â*=>rLô Vk¶¾xG¨êäÍ>th¤$6Á¾`R ™â¾\¾ÈW!<>sµ5*¾x9Y‹95~>rì!%…]¾WàñŸ&>ÿ¾bÀq?¯>tåXdßÍ»¾wð,¶ó±>qIÀ8þÞ¤¾M?g‰5dZ¾fÛÔÁU >uÜô ~»¾woftš7>oDÁóÜ(¾5¸î/ë ¾j«DX¹‘>v›î„˜×¾vº°@<¬Ì>kT‚U€ÛÓ>,ã9Å{3¾n("Œ¦§>w#'¤'‘{¾uÖh¾uI>grKÈ€Ÿ>HØç}($´¾p§)ÿý3!>wt&&9¾tÆ˃Òû>cqmfS >TðB3¹ò¾r SÈk>w@RâU¾s@J5l–>^»˜bßë>]§æïE¾sD²Ó‹Àa>wz•ã¾r7©c ~ÿ>Vƒ#‹û¼I>bi¸'“¾tM¡Ý’ò>w4A–’ ¾pÁ’ܸ+r>L—nJ*'Ò>f |¿Oßÿ¾u'Äst3>vÁƒ¤ôÓ¾ne¸øÒ>8žÙƒ.>im<%:<¾uÓv#PËq>v%!^V¯‡¾k•ËZWb¾úÃî“B>lŠˆA7š¥¾vQÖß7Õ‰>ubšìg‡>¾g¸|°:®²¾CJù^Rf>o`›xøtç¾v¤y…+s>t}2g`Š¾d;b"ϾQ2ï˜AQ>pöo9ÑH¾vËœs«²†>sxœìœ‘j¾`®úJCd¾XtUÖ{F>r'P¸Œ¼¾vʤWZŸ¨>rXš<ýjŸ¾Z7hš’zl¾__ÔÙ}¥>s\6C½¾v£-œN†>q Šfƒ¾SuÝH6§¾bö{¬äz>sçôŸ8U}¾vWrS¢9Ð>o¨:ROqO¾GîÕ »´ç¾f ú-/ªÐ>t˜ŠÄê‡N¾uê.àò€I>líÞq|=Œ¾3àACJ€Â¾hè j ê>u%åF#¾u]å_ 8—>jHÛv ø>0(ìb–¾kŽXuž>uŽ,f)¾tµ(/Ì>g.1·6R>AàÎQŠ¾mû)ÿ,âÒ>uÕl§GŸ—¾sòðÝ}Ì>d5ú+íÊ8>N÷yø¾p §ò]>uüX·sŠ¾sሱ>a4ýq*¤Ê>U9ˆÀ&6ñ¾qXI›‘‡>vXbœÞŠ¾r,•¦¨>\aÆoñK>[)´İ¾qòqéëÔ>uïOMJcÓ¾q-úõßh>V]×8©ð>`g‘®Ÿá¡¾r´ñu“Þ>u¿;”=a¾p ‘!‰)u>Pfw> Õf>c¢jnJ¾s[K£Ä¹ô>uuÔ¿®å™¾n ƒ—c?å>Eù‘uö>e• Ǿsæ"ß^¸>u8”è$X¾kÆnêP>2ÿy—F>gìÀ¦¶œ^¾tVŠõ>tŸ‹ý¥ì ¾ipEô@Y¾ 4²Ç ˆ>j>øP…¾t­ª¾M<™>tœåÚñA¾g,};“ƒ¾9fôŒUR>l×?òp¾tìZÚQA>s|SÖM…¾d§°¥€Ó¾GEæ!q—>mðµ)µÁ5¾u*›fc>rÓwm­ñp¾b=díŠk¾P¹íKõ’ñ>o›ÏÀ™…¾u&VP‰ ð>rZ7Jd¾_§&-ú–¾Uš·Ât²ì>pŽ/ߟs/¾u$% Œ±©>q[X^¹3â¾ZÛÌ¿pr¾ZBm¸n >q9É—Eq5¾uAS`;>p;mÅðý¾VâŒs¾^®Å®Ìn>qÑgýI©¹¾téØ18R>ozt¿€¼¾QràþÂ4ù¾aokÉ!ž>rU‚Ïq°ô¾t²ÄYN1>mÈ-mÝ—>•÷’N¾’Ažä½»­>‡®±žøôk¾*¢î(Ûä ¾†ò6á®æ>’ ó؃¾•rCä«>4úKÇ­¿>q™yÁB`¾7{EôŒë>’PlÝQP&¾‹Î#FáY>jÚt0±>Dë¢wù^¾ÂÜÂõž>‘qrT0U¿¾„ЈõÐe¾SH+‰yn>ˆ{ƒËTÖ¾‘Ò«qÃ[á>k r’¾yXµ6\]¾vcSò‡kx>Žj¨i¾‘Áoz>‰HFy€¾_RM ±S±¾ƒ%EöæÛ>ËÒÌ4¥¾—¡,#³¢>‚~êZ>cœ/ ƒ.¾‰«\L@d>‘‚Œ ׭澌ÝÏâ¬#>søX ÞU>zyzé·/ξŽ‡BýöÄ;>‘# I±¥/¾†ß/… ;>F–¿¾— >„—Ø-ró¾¶ý>òv>tÕ—¹qï¾7sYE¾lI¤lc>ŠŒ)Q5¾‘U‘ÁIõ>ŠÊLÿu¾n2^‹Ž„¾}çüõÉÓy>ŽÆâŸ`÷%¾{©p ·>„ší¡=Ÿ>9š#þˆÖá¾…Æ­ðó>‰-HZ†¾¾(vÆ6P>zžà›Jjƒ>qÝ@xî£o¾‹(bøYK>«óO7un¾ˆÏ%7¾õÊ>ezŒ{­8·>€]øNqŸ¾ŽÐ7N> ½n]px¾‚€¸¹O‘”¾UÔ¦Ãß>†®®jd·&¾I@Ε Õ>ŒòŸ´Kù¾vvKó1ÐV¾u¢X‚Ä#>‹ˆÛjebä¾0“G[Šú>†òâSÂN¾[>ê¼ý¾uxGÒÀ>Ž­[Ïi–¾ŽK‰Ö×Ç>€”oQLI#>aŠZeí.!¾‡X¶V5¿0>÷-1ª3¾Š}L]V–=>rÀ ,w‹>wœ˜ßC`¾‹·ŒÑå>aRµÞg¾…9ùPï¯:>LVå8 ä·>‚e;’‘½¾ŽfØt}kÇ>Œÿ+œµK§¾}±—jžg"N,º‰{>‡Ìx½aû¾J²‘Óï>ˆÿЭ|‰ˆ¾nø`´ˆQ‰¾y·+ý6PY>‹¼~1"¾Ž_üjtÇd>ƒ¨4?fl¾%¯&…¤ `¾ƒæªÎt*>Ž®ðÿؾ‹Á£÷–°¶>zœÏÅm«>kÁWb ´#¾ˆ;îx÷>Ž‘wéè¦ý¾‡ŸÆ¤1>iRÓÜs @>{]±mn*澋Ÿ6úBKÃ>chõeô¾‚?ÄMA6¾;•…³æb>ƒ‡¸‹f ¾“Ö+á^>Š—¨yÛiA¾wì§\z'¾ow¼þ‘ð>ˆ-•j$n´¾Ô 0Ý>†`<àOô ¾dŠ¼mí¢¾|™Äáù¼ >‹f1Rä³Ý¾Œp¥@åŸ>f¯íu>Mzž3º¦¾ƒÒuÑN¨&> ‹k·q澉„Ò¾Å>uŸä õ{>q*ßøP§»¾ˆ'gÀRØŽì¾…C9ˆ/3b>`–¡?Ý6>}tê5{¥¾‹”e¯÷>‹‹—8J¾ßͱs%¾TéÔ>×(c>ƒõ>¼Áű¾Œ[°ˆ‹¹=u˜W¾s´¿¿Ô0=¾r5†ÈMz>ˆË}4¾Œ] [‹¯%>„Iß;äî¾Zàd†BŽ ¾}÷ãp†³>Š¶BQÌC¶¾Š·×¶>~9HV¤[>Y‚Ä*ÛÃ-¾ƒô‹qþQT>‹ðŽõòZE¾‡® G‰>r(¨ÁÏhö>rã KqÜq¾‡Ç8Ε]>‹«±NÓi¾ƒt¢¼ŸE>V@Ü~>~*€Âtdq¾ŠG¸à(>‰õ T_š¾|–4‚uƽ¾\Ÿ›+šêU>ƒÔ"Z쾋]u~ ƒ>†ì¦ ’’¾pø{ÁKUo¾s9öö9rž>‡tªqkf¾‹&°Æ>‚ÃWÙû4€¾RÊÁ*ؾ~ˆZvÁ÷>‰ÎBúŽ ¾‰F“¡‰ýÈ>{n·RæU>^V{»C?ž¾ƒ—%­sÊØ>ŠÊo·ºñ¾†G¤ÊÓ">p ” Z•>s@ ~nñ¾‡Šdùž™9•¾‚5Rµ®ÉË>PÝaûù»®>}¸˜ÛéE¾‰Kô4ï>ˆ¬ „o5ܾz–à‰ö'o¾^¼ ñ|ê>ƒ@Ür i¾Š8 †zÊ“>…¾€gðÎƾo9öåYiq¾rú6uãØ>†˜¢Ø<+¾‰ÑÔívÃ>É]úÙ¾PA?[»X•¾} 6á6>ˆÁÿ]#{¾ˆ%)ÊtÚ:>z K°nù×>]âzÐèо‚бUlw>‰¨‘×ïm¾…P1±Qu«>nÒø>¬û>rl×ýIj¾† Á:.³>‰IMÃÉ¥¾}Ø?}>PäùNO×ç>|GKkÒÑ5¾ˆ0Öò<‘>‡°éQpØǾyÈ(.Sõ¾[ÙüEÊ«>‚J1æ%NÞ¾‰Z°.ð>„û+D·¾o©MŸœ¹¾q›f "F°>…{þ@QÕ'¾ˆÊnœG@}>Pºì>öï¾R·ªê.N¾{6̙ϕ>‡˜6+/j“¾‡M¯…·’•>yÈÉ ›Zù>X°ÕkŽJ;­ €ôy>ˆŒ Á¥²ô¾„½gÚÔ¨ð>oÃ2\sÉ >pˆžN²)¾„Ö]ÞÉ>ˆS |¡G<¾?«ÃôÂ>U¨¸S×€¡>yî>¯=8¾†÷<ÚyÂ>†ùKé֡ξzrp‹”оTt8© Û>€ù€VuHD¾‡ýä¿”>„”ZDÀ.ô¾p„-ÅÝ´¾nm0:XÐD>„ p¹ßÛ¾‡â·Ã¹Òä>GóîƒHa¾Y¨x˜xV¾xnÄNuª>†Lw{¦C ¾†±ÍÅ>zˆV  À>N`êÀƒBÓ¾€.ëC €ì>‡jµF'þÚ¾„|ú ¡… >qd‰Ì!ô=>kMæ3ȾƒXùýï_§>‡téúÕ}¾f}göyÂ>^¥-êWÅ>v¶Ë_ÿ¾…•ì, ½Ê>†q¿„É9¾{.Gíœæ¾AãBû+->~™>´%F|¾†Òf¢ýoŠ>„s¿-,O+¾r}8Ëý! ¾g¶@µØ­á>‚~Iç*¾‡ÛêóìÈ>—¸¥–é¾bGt‘P¿¾tÇìE%ß>„Ñè¢¿í¾†7©ì"Yä>|,è«çÈ>7Uç(Áb¾|£$lDC>†0å»­Î×¾„t¯-‡%>sÈ%Vì)>c©Ø°º­¾Žc ç)>†”³(œ¾×Ÿƒ|gÃ>e¨à"ŸC>r ÚÑqHõ¾ƒû%» ,g>…þˆ:Ud™¾}{T>#õ>92¸¹<å>zyQ°›‚¾…‚“‹±z>„{Q>I0<¾u>”ýg ¾^R©¬A­š>€‡ ºÄì-¾†#_ËM(>‚!¦º™Wœ¾ikÕ\¸§¾pAýöªl>ƒÎ!!Ù;¾…Á8"xø>~ X§w°ã¾N_“C÷|$¾x5ÒAÜí>„Ãhç. A¾„‚©ÿ÷3w>vØäo‘V>Tv"Í›K¤¾~Ë룎µè>…’|«Ò›¾‚pÄù-„Ã>mƒnn ´µ>kQÒRC¯¾‚¹Lóâ >…{~aÖ¨ˆ¾N oÿÆ>XÓ“"Úÿ>u~7Թ¾ƒï–3Ð>„…-(“¢¾xŽZj6†¾Cí§s•ý>|QJn5¾„øµÕ7šÜ>‚¿a3!¢p¾pð]‡ÈöŽ¾e¯bN}¦>€ñ{fîòå¾…&«åÁš>€AʸÓü¾a˜i‹ÎS¾r©%YTÙŠ>ƒ òw¸I¾„|Æ’ b–>zTÌÉ á¾‡Õel¾yšxW›ý»>„G{UýM5¾ƒM­;*>s9iõ ò>_?Ðê…Ô¾k†)ì­>„½÷X®m¾€ÚZÉôùÌ>fûUez>o/öëU‚‚¾õL“4>„bæ(Ó"°¾| •~ ÓC>K26±M>v£'3︾ƒyPþÖú¸>ƒAµ»Êe{¾u‘H¹pWR¾RPvOsä>|°ñv­¿¼¾„8uU³D™>iáØkpS¾l›gãnŽ¾h–ÆX>€Æ¢ô]¾„0šK©8–>}ä]»›O¾Z„‚ˆ½ý ¡¾ƒg73cž>wìÆüÎ?>2‹eտ˾y®ɺ©Q>ƒ’^ ŒÄǾèØø¦>q,üþNÅ>aˆ»¹Vd¾~ãÓ8Ü0×>ƒÞ§…Å„þ¾‘(S¦ŠÂ>cÔZjÚú>o×95n l¾p‹m·&Õ>ƒoê·\;¾z=ëH¬„>C[KTˆ¿>v^ío½mw¾‚Äet}P¥>‚NÿT÷`¾t1ØNº¾T `ük'>{ç"È{H较e°/bºü>€‹!‹‘yù¾j†âCò!¾hX+‚MJ4>€+ý媎¾ƒS–È(†<>|q¼ÐZ:¾X{¶W¿:¾rÂdøÓ‰>ÈgV¬p¾‚“xÚF0>vá¼+ÍÞ>1Ò;Š¡ƒÔ¾x’YÛy›>‚¾Z Vºr¾0«]ž1>pžP¦y1>`]?FÀTA¾}n@=–« >ƒ ØO]ÆÕ¾~x·IÏY>cÉ… ídæ>m°Þjà5¾€˜ÜìDl†>‚¬ôð (¾y•Tj½Ï)>G’Œr·‹>tã¤Q¶Œ¾á¢–V³>¯D5cÙè¾sêFwâ–ž¾OÕ÷Ö]>z“ß-e¾‚ŠcªsJZ>€ÉÝ‚‹ö¾k[0ªþ§¾eLÕØ÷ Ç>~baj÷`¾‚‘ù3(ò…>| !»ñ¾\a§ÞŒ3¾pÚ9,ôžc>€É5öÑ83¾üv(´ê>w#=ž±/¾,x]à%E¾vdÍJ¨ý>ÍQ8%r¾€Òüx•[{>qeÛ¼ÎÞÅ>XÑ¡x¢¾{Pn º1>‚9)Í`b*¾~F࿆7Í>f†u=\ï;>hùaÆ…µæ¾~ßÖ;œÿ>‚ ŠOù.Õ¾yþ¦š¬Œ2>S~¨‰õêì>rCWW{F¾€ËS*>Oß/F—}¾tö‚Ã"º/¾8îBO¡çò>w\›ãƒÙ_¾™¸sºÍ0>€ CúÀÖ.¾n¹aÜ;3X¾_PªQÙ >{¤xžÁ&¾Ø' kù>|•ƒrR+ª¾bèׯ|þ¾kDû.í>~þÚN,¾ˆm’ŠQˆ>xDâ1ï쓾I½ö‚u¾s$÷+ÔµË>€«Ú=¸•¾€±OÇ"Kô>sJtŽH_Ê>G}ê%«ýT¾wÝ©B,~>R±y’8¾~ºF l`ü>k£{[ÓÕ>aÊ{žUþª¾{ÊmÎ0¾>på–|_e¾{3 <܈>`ìT4P>lùq_·T¾~ÒèÉ^I> 'w¾vî"Adñu>@Û›œî˜>sŽ8ÚF¢¾€s?•À¥^>€'ŒlL¾rEµ/ý¾N1°+öQu>w÷Àmht¾€þy"’À>} ê3ë|¾iˆåàÒ1¾bãþƒQ!÷>{–¿çñ¾ ¥_Èr>z%ÀípÃw¾\ÇCw͵¾mdýµñ/>~jV£Y÷¾€šû“Éé>uüûçLr}¾8F€T?@ñ¾s‹gë'‰>€(”P¶Õ¾l©{m–`>qIµäz%Û>PiðΈ3¾w¶Ã¾Cý>€¤ªGæj¾|ÌÀÅðÅÌ>hb3ä]µ>cùV“£¾{(¶S‹÷>€©sÆ÷¾yn΋+ìæ>[hyI}I:>m#զő¾}ÎY¯îj>€:| ¯w¾up  A‚ >6½Â³B >s%l™}O¾›™8¯I>~½h «.!¾pðÉZ – ¾OŸ$"w§>w"`K&œ~¾€E(n„1o>|=NW­¨æ¾h&^–Mû¾bB#1 =×>zqá’SG¾€MK£ß^œ>y “1|™¾[êÄ'õò/¾kô=Q<§>}í±]¾ÒÛ7•€™>uBämœq2¾<³:¤×@V¾ra¸Ê£´>~Êž¹Ï—¾~>…’OZK>qZç‚`A>JÆ­û2#¾v>B[âo>¾§ôçš¾{íÕV^¨>hÆÞN(6B>` IFR‚?¾yzÂ_©A>ë{ÑÈ6¾xõ›Ä*/Ë>^2h-ò©œ>iøÆs±¾|¡0Nš>J2Ùô$¾umŸ§2ÍG>Dßù<í’>qBk£‚`í¾}Ùî«ÞJ >}訡f;¾qp=[÷$v¾Bt1YLl¶>u [Xùô©¾~ëÔ~d«>{Õl)Þ!¹¾j4fNX/¾\R€¥ ì>x@Ýq} ±¾<àßxÕ˜>y"Ã?ÃCŠ¾a0ï×ZC¾g5ÇZU>zÖø£'n¾~ÐésXk÷>uåžæŒA¾N½ÀÛèé¾o׋V}e>|ÁÇã{Ѿ}°!O‚E>r5¾s] >+=ü×j»ø¾sƒ„ñÍN>}ûZ¹÷ ¹¾{çþçfˆ>lYnTù>UÅqä𽉾v¾,Av¸°>~‚)s:ÎÚ¾y…5ÛèÊ>cÈ|¯¿`>c©»Gd¾yh=}`>~Xu–2'¾vœêžÃ­>UÛÃì:X>kÙV˜PÒ£¾{v€ã\Úë>}„ØAU¶¾¾sC/+º×>/ñëé—>q¤-Wréɾ|âóVa¹Z>|sòÊ·¶¾ot–ºp¾KH³úA %>téÜé~U¾}ªˆyj0>z áR;g*ŒËâ¾^¬,¬J>w¯x…¾}θÓk‚>w¯?¶Öf¾]ÁšÆd…ò¾g`‘âê¯>yé •3ùX¾}R`ªîÓ>t‡/wÛ{©ß'n¾|>û™’ ½>q.ÌܨÑû>/óËËX`¾r¹Âg Æ>|¡v–¯i¾zžPÝÞù>kjâm—¤>TvÇdð' ¾už(ʯ»>}μ^”¾x}©y×—å>coWÍä8>bµöJÍE¾xcvá…º>}$úy¾uëïÈ}Åë>W ss‘ˆ>ivÙ±%Ö¾yïíÞ¤J×>|U›ªD:¾rù¢ð0‘Ì>p"²WAHö¾{O|®`8‚>{#ôøÂPñ¾oqW ¸M¾A€9q&‰>s&å„ÌF¾|%Â5Xs>yuŒóóóD¾hw›pW‚¾XûîË>uÁü“çL¾|qGÊj±©>wVhû‘V¾a*ƒm4оcbm}K›¡>wêΓ‰¾|7|º»T>tÔˆuðÞ¾S`e]$êµ¾j97~‘ >y›6'ä ¾{|YiîÒA>qÿ³ÞBz¾1eòÙþÌ<¾pzÏ£4ž¡¾zHÄú“ƒc>mË0Ê ¸>Dõ Pë¾s’|Rkê>{†•y䃾x¥Ì¾üû>g2 ]‡¤>XÚ!‡D‚ǾukÕû`à>{ÁR/-¢S¾vžÝfeµH>`RàIÓóÌ>cDµùY*£¾wk– b$>{ƒKïcuϾt@=íjz´>Rœ1x©˜>i©È €Ã¾xý‰Ó>zщ Ïó¾q—mZ<]>2@ ñE>o„M ä7¾zÚç¹z,>y³6õaY¾mcnM¯võ¾B¹ófxßœ>r`[‘F¾zÏåsø>x1ÅâF¾gt§–ã%ï¾{<Øï>vT„»í›É¾`ÕP½c2ñ¾aÜ'Ôkû>v‘dIvâ ¾zå» ª>t(¢ÿ™,O¾T–6sÏì¼¾gædþž>xœÜ¬ª¾zRFár>q¹ôÔBö¾=ÅÝl°q¶¾mwe~4«.>y=âù'Ž,¾y\ÐйC©>n#&ªáO>6@•ï#¸ ¾q>×p=>yý6}Å÷¾x ŠÉøîÎ>h}2ÖE´>R<í˜fe¾susoÉ}>zXžo#JÞ¾vjµÂó<>b™'`ýQ>^h¾qã½¾¾uZScxm>zR €-º®¾t~€¬RÏ>Y‡`,C>dõëìTÕ¾vék•Žÿ|>yîÁ[k ¾rSx=š³>I×'¾Ç~C>jPØ TjÕ¾x 6˜¥Â¿>y2§û¾oæïxÚ/è> ;#y´“ƒ>o6,eÄÚ‰¾xþÝ‚ñ->x"Ô–­¾jÑš©³P9¾F=|ÏÜ>qÌÂQÔz‡¾yƒ"Œ‘‚>vÇi Ï¾e{¨¾ßN¾V¦)wM¯ß>s¸(>Qô¾y± ¡óu>u( *Avª¾_ô’Ë¡ý¾`Ô•U0‡>uY¬c…v¾yŠâåív9>sL†wAT¾TÂÀ›Õ~›¾fE6Ž>v®ó$O+6¾yZKØ0E>q=C!K˾CØc{,¾jÕÀRÁÓ>w¶sÚ$»¾xRøk¸>n7ŽéÓ>fâÀáj¾o:Gâ½(>xp#¿{ÊS¾wI¤þE@b>iMñã)Ë>HíÀÛéeѾq•œÎŠ>>xÝ W~ñ´¾v'”sà>db« vVÜ>VúË'ǞǾsP%÷8nü>xþÇ+(u¾t~þÆrQ>^«gïeù'>`‚ ëóD¾tÉõÝå‘>xØ-)^òó¾rÊVFŽÏÁ>To’WtxÕ>e>Ì >÷â¾v£èéÑË>xlÖÂ>Ð~¾pê/Q¨ >D`cë÷þÕ>i§Ÿ.ë*¾vöRv”{|>wÀ¦Õæ4p¾mËQ‹þWè=Æ™z”ä>m³‡3ÍŽ¾w¨¨£ È>vØfÕ]ºó¾iˆVºèB¾CÆ”>VHè>p­µôå`¾xô3Sü->u¹U¥Ѿeõ!ç\¾Sƒ–â*=>rLô Vk¶¾xG¨êäÍ>th¤$6Á¾`R ™â¾\¾ÈW!<>sµ5*¾x9Y‹95~>rì!%…]¾WàñŸ&>ÿ¾bÀq?¯>tåXdßÍ»¾wð,¶ó±>qIÀ8þÞ¤¾M?g‰5dZ¾fÛÔÁU >uÜô ~»¾woftš7>oDÁóÜ(¾5¸î/ë ¾j«DX¹‘>v›î„˜×¾vº°@<¬Ì>kT‚U€ÛÓ>,ã9Å{3¾n("Œ¦§>w#'¤'‘{¾uÖh¾uI>grKÈ€Ÿ>HØç}($´¾p§)ÿý3!>wt&&9¾tÆ˃Òû>cqmfS >TðB3¹ò¾r SÈk>w@RâU¾s@J5l–>^»˜bßë>]§æïE¾sD²Ó‹Àa>wz•ã¾r7©c ~ÿ>Vƒ#‹û¼I>bi¸'“¾tM¡Ý’ò>w4A–’ ¾pÁ’ܸ+r>L—nJ*'Ò>f |¿Oßÿ¾u'Äst3>vÁƒ¤ôÓ¾ne¸øÒ>8žÙƒ.>im<%:<¾uÓv#PËq>v%!^V¯‡¾k•ËZWb¾úÃî“B>lŠˆA7š¥¾vQÖß7Õ‰>ubšìg‡>¾g¸|°:®²¾CJù^Rf>o`›xøtç¾v¤y…+s>t}2g`Š¾d;b"ϾQ2ï˜AQ>pöo9ÑH¾vËœs«²†>sxœìœ‘j¾`®úJCd¾XtUÖ{F>r'P¸Œ¼¾vʤWZŸ¨>rXš<ýjŸ¾Z7hš’zl¾__ÔÙ}¥>s\6C½¾v£-œN†>q Šfƒ¾SuÝH6§¾bö{¬äz>sçôŸ8U}¾vWrS¢9Ð>o¨:ROqO¾GîÕ »´ç¾f ú-/ªÐ>t˜ŠÄê‡N¾uê.àò€I>líÞq|=Œ¾3àACJ€Â¾hè j ê>u%åF#¾u]å_ 8—>jHÛv ø>0(ìb–¾kŽXuž>uŽ,f)¾tµ(/Ì>g.1·6R>AàÎQŠ¾mû)ÿ,âÒ>uÕl§GŸ—¾sòðÝ}Ì>d5ú+íÊ8>N÷yø¾p §ò]>uüX·sŠ¾sሱ>a4ýq*¤Ê>U9ˆÀ&6ñ¾qXI›‘‡>vXbœÞŠ¾r,•¦¨>\aÆoñK>[)´İ¾qòqéëÔ>uïOMJcÓ¾q-úõßh>V]×8©ð>`g‘®Ÿá¡¾r´ñu“Þ>u¿;”=a¾p ‘!‰)u>Pfw> Õf>c¢jnJ¾s[K£Ä¹ô>uuÔ¿®å™¾n ƒ—c?å>Eù‘uö>e• Ǿsæ"ß^¸>u8”è$X¾kÆnêP>2ÿy—F>gìÀ¦¶œ^¾tVŠõ>tŸ‹ý¥ì ¾ipEô@Y¾ 4²Ç ˆ>j>øP…¾t­ª¾M<™>tœåÚñA¾g,};“ƒ¾9fôŒUR>l×?òp¾tìZÚQA>s|SÖM…¾d§°¥€Ó¾GEæ!q—>mðµ)µÁ5¾u*›fc>rÓwm­ñp¾b=díŠk¾P¹íKõ’ñ>o›ÏÀ™…¾u&VP‰ ð>rZ7Jd¾_§&-ú–¾Uš·Ât²ì>pŽ/ߟs/¾u$% Œ±©>q[X^¹3â¾ZÛÌ¿pr¾ZBm¸n >q9É—Eq5¾uAS`;>p;mÅðý¾VâŒs¾^®Å®Ìn>qÑgýI©¹¾téØ18R>ozt¿€¼¾QràþÂ4ù¾aokÉ!ž>rU‚Ïq°ô¾t²ÄYN1>mÈ-mÝ—>•÷’N¾’Ažä½»­>‡®±žøôk¾*¢î(Ûä ¾†ò6á®æ>’ ó؃¾•rCä«>4úKÇ­¿>q™yÁB`¾7{EôŒë>’PlÝQP&¾‹Î#FáY>jÚt0±>Dë¢wù^¾ÂÜÂõž>‘qrT0U¿¾„ЈõÐe¾SH+‰yn>ˆ{ƒËTÖ¾‘Ò«qÃ[á>k r’¾yXµ6\]¾vcSò‡kx>Žj¨i¾‘Áoz>‰HFy€¾_RM ±S±¾ƒ%EöæÛ>ËÒÌ4¥¾—¡,#³¢>‚~êZ>cœ/ ƒ.¾‰«\L@d>‘‚Œ ׭澌ÝÏâ¬#>søX ÞU>zyzé·/ξŽ‡BýöÄ;>‘# I±¥/¾†ß/… ;>F–¿¾— >„—Ø-ró¾¶ý>òv>tÕ—¹qï¾7sYE¾lI¤lc>ŠŒ)Q5¾‘U‘ÁIõ>ŠÊLÿu¾n2^‹Ž„¾}çüõÉÓy>ŽÆâŸ`÷%¾{©p ·>„ší¡=Ÿ>9š#þˆÖá¾…Æ­ðó>‰-HZ†¾¾(vÆ6P>zžà›Jjƒ>qÝ@xî£o¾‹(bøYK>«óO7un¾ˆÏ%7¾õÊ>ezŒ{­8·>€]øNqŸ¾ŽÐ7N> ½n]px¾‚€¸¹O‘”¾UÔ¦Ãß>†®®jd·&¾I@Ε Õ>ŒòŸ´Kù¾vvKó1ÐV¾u¢X‚Ä#>‹ˆÛjebä¾0“G[Šú>†òâSÂN¾[>ê¼ý¾uxGÒÀ>Ž­[Ïi–¾ŽK‰Ö×Ç>€”oQLI#>aŠZeí.!¾‡X¶V5¿0>÷-1ª3¾Š}L]V–=>rÀ ,w‹>wœ˜ßC`¾‹·ŒÑå>aRµÞg¾…9ùPï¯:>LVå8 ä·>‚e;’‘½¾ŽfØt}kÇ>Œÿ+œµK§¾}±—jžg"N,º‰{>‡Ìx½aû¾J²‘Óï>ˆÿЭ|‰ˆ¾nø`´ˆQ‰¾y·+ý6PY>‹¼~1"¾Ž_üjtÇd>ƒ¨4?fl¾%¯&…¤ `¾ƒæªÎt*>Ž®ðÿؾ‹Á£÷–°¶>zœÏÅm«>kÁWb ´#¾ˆ;îx÷>Ž‘wéè¦ý¾‡ŸÆ¤1>iRÓÜs @>{]±mn*澋Ÿ6úBKÃ>chõeô¾‚?ÄMA6¾;•…³æb>ƒ‡¸‹f ¾“Ö+á^>Š—¨yÛiA¾wì§\z'¾ow¼þ‘ð>ˆ-•j$n´¾Ô 0Ý>†`<àOô ¾dŠ¼mí¢¾|™Äáù¼ >‹f1Rä³Ý¾Œp¥@åŸ>f¯íu>Mzž3º¦¾ƒÒuÑN¨&> ‹k·q澉„Ò¾Å>uŸä õ{>q*ßøP§»¾ˆ'gÀRØŽì¾…C9ˆ/3b>`–¡?Ý6>}tê5{¥¾‹”e¯÷>‹‹—8J¾ßͱs%¾TéÔ>×(c>ƒõ>¼Áű¾Œ[°ˆ‹¹=u˜W¾s´¿¿Ô0=¾r5†ÈMz>ˆË}4¾Œ] [‹¯%>„Iß;äî¾Zàd†BŽ ¾}÷ãp†³>Š¶BQÌC¶¾Š·×¶>~9HV¤[>Y‚Ä*ÛÃ-¾ƒô‹qþQT>‹ðŽõòZE¾‡® G‰>r(¨ÁÏhö>rã KqÜq¾‡Ç8Ε]>‹«±NÓi¾ƒt¢¼ŸE>V@Ü~>~*€Âtdq¾ŠG¸à(>‰õ T_š¾|–4‚uƽ¾\Ÿ›+šêU>ƒÔ"Z쾋]u~ ƒ>†ì¦ ’’¾pø{ÁKUo¾s9öö9rž>‡tªqkf¾‹&°Æ>‚ÃWÙû4€¾RÊÁ*ؾ~ˆZvÁ÷>‰ÎBúŽ ¾‰F“¡‰ýÈ>{n·RæU>^V{»C?ž¾ƒ—%­sÊØ>ŠÊo·ºñ¾†G¤ÊÓ">p ” Z•>s@ ~nñ¾‡Šdùž™9•¾‚5Rµ®ÉË>PÝaûù»®>}¸˜ÛéE¾‰Kô4ï>ˆ¬ „o5ܾz–à‰ö'o¾^¼ ñ|ê>ƒ@Ür i¾Š8 †zÊ“>…¾€gðÎƾo9öåYiq¾rú6uãØ>†˜¢Ø<+¾‰ÑÔívÃ>É]úÙ¾PA?[»X•¾} 6á6>ˆÁÿ]#{¾ˆ%)ÊtÚ:>z K°nù×>]âzÐèо‚бUlw>‰¨‘×ïm¾…P1±Qu«>nÒø>¬û>rl×ýIj¾† Á:.³>‰IMÃÉ¥¾}Ø?}>PäùNO×ç>|GKkÒÑ5¾ˆ0Öò<‘>‡°éQpØǾyÈ(.Sõ¾[ÙüEÊ«>‚J1æ%NÞ¾‰Z°.ð>„û+D·¾o©MŸœ¹¾q›f "F°>…{þ@QÕ'¾ˆÊnœG@}>Pºì>öï¾R·ªê.N¾{6̙ϕ>‡˜6+/j“¾‡M¯…·’•>yÈÉ ›Zù>X°ÕkŽJ;­ €ôy>ˆŒ Á¥²ô¾„½gÚÔ¨ð>oÃ2\sÉ >pˆžN²)¾„Ö]ÞÉ>ˆS |¡G<¾?«ÃôÂ>U¨¸S×€¡>yî>¯=8¾†÷<ÚyÂ>†ùKé֡ξzrp‹”оTt8© Û>€ù€VuHD¾‡ýä¿”>„”ZDÀ.ô¾p„-ÅÝ´¾nm0:XÐD>„ p¹ßÛ¾‡â·Ã¹Òä>GóîƒHa¾Y¨x˜xV¾xnÄNuª>†Lw{¦C ¾†±ÍÅ>zˆV  À>N`êÀƒBÓ¾€.ëC €ì>‡jµF'þÚ¾„|ú ¡… >qd‰Ì!ô=>kMæ3ȾƒXùýï_§>‡téúÕ}¾f}göyÂ>^¥-êWÅ>v¶Ë_ÿ¾…•ì, ½Ê>†q¿„É9¾{.Gíœæ¾AãBû+->~™>´%F|¾†Òf¢ýoŠ>„s¿-,O+¾r}8Ëý! ¾g¶@µØ­á>‚~Iç*¾‡ÛêóìÈ>—¸¥–é¾bGt‘P¿¾tÇìE%ß>„Ñè¢¿í¾†7©ì"Yä>|,è«çÈ>7Uç(Áb¾|£$lDC>†0å»­Î×¾„t¯-‡%>sÈ%Vì)>c©Ø°º­¾Žc ç)>†”³(œ¾×Ÿƒ|gÃ>e¨à"ŸC>r ÚÑqHõ¾ƒû%» ,g>…þˆ:Ud™¾}{T>#õ>92¸¹<å>zyQ°›‚¾…‚“‹±z>„{Q>I0<¾u>”ýg ¾^R©¬A­š>€‡ ºÄì-¾†#_ËM(>‚!¦º™Wœ¾ikÕ\¸§¾pAýöªl>ƒÎ!!Ù;¾…Á8"xø>~ X§w°ã¾N_“C÷|$¾x5ÒAÜí>„Ãhç. A¾„‚©ÿ÷3w>vØäo‘V>Tv"Í›K¤¾~Ë룎µè>…’|«Ò›¾‚pÄù-„Ã>mƒnn ´µ>kQÒRC¯¾‚¹Lóâ >…{~aÖ¨ˆ¾N oÿÆ>XÓ“"Úÿ>u~7Թ¾ƒï–3Ð>„…-(“¢¾xŽZj6†¾Cí§s•ý>|QJn5¾„øµÕ7šÜ>‚¿a3!¢p¾pð]‡ÈöŽ¾e¯bN}¦>€ñ{fîòå¾…&«åÁš>€AʸÓü¾a˜i‹ÎS¾r©%YTÙŠ>ƒ òw¸I¾„|Æ’ b–>zTÌÉ á¾‡Õel¾yšxW›ý»>„G{UýM5¾ƒM­;*>s9iõ ò>_?Ðê…Ô¾k†)ì­>„½÷X®m¾€ÚZÉôùÌ>fûUez>o/öëU‚‚¾õL“4>„bæ(Ó"°¾| •~ ÓC>K26±M>v£'3︾ƒyPþÖú¸>ƒAµ»Êe{¾u‘H¹pWR¾RPvOsä>|°ñv­¿¼¾„8uU³D™>iáØkpS¾l›gãnŽ¾h–ÆX>€Æ¢ô]¾„0šK©8–>}ä]»›O¾Z„‚ˆ½ý ¡¾ƒg73cž>wìÆüÎ?>2‹eտ˾y®ɺ©Q>ƒ’^ ŒÄǾèØø¦>q,üþNÅ>aˆ»¹Vd¾~ãÓ8Ü0×>ƒÞ§…Å„þ¾‘(S¦ŠÂ>cÔZjÚú>o×95n l¾p‹m·&Õ>ƒoê·\;¾z=ëH¬„>C[KTˆ¿>v^ío½mw¾‚Äet}P¥>‚NÿT÷`¾t1ØNº¾T `ük'>{ç"È{H较e°/bºü>€‹!‹‘yù¾j†âCò!¾hX+‚MJ4>€+ý媎¾ƒS–È(†<>|q¼ÐZ:¾X{¶W¿:¾rÂdøÓ‰>ÈgV¬p¾‚“xÚF0>vá¼+ÍÞ>1Ò;Š¡ƒÔ¾x’YÛy›>‚¾Z Vºr¾0«]ž1>pžP¦y1>`]?FÀTA¾}n@=–« >ƒ ØO]ÆÕ¾~x·IÏY>cÉ… ídæ>m°Þjà5¾€˜ÜìDl†>‚¬ôð (¾y•Tj½Ï)>G’Œr·‹>tã¤Q¶Œ¾á¢–V³>¯D5cÙè¾sêFwâ–ž¾OÕ÷Ö]>z“ß-e¾‚ŠcªsJZ>€ÉÝ‚‹ö¾k[0ªþ§¾eLÕØ÷ Ç>~baj÷`¾‚‘ù3(ò…>| !»ñ¾\a§ÞŒ3¾pÚ9,ôžc>€É5öÑ83¾üv(´ê>w#=ž±/¾,x]à%E¾vdÍJ¨ý>ÍQ8%r¾€Òüx•[{>qeÛ¼ÎÞÅ>XÑ¡x¢¾{Pn º1>‚9)Í`b*¾~F࿆7Í>f†u=\ï;>hùaÆ…µæ¾~ßÖ;œÿ>‚ ŠOù.Õ¾yþ¦š¬Œ2>S~¨‰õêì>rCWW{F¾€ËS*>Oß/F—}¾tö‚Ã"º/¾8îBO¡çò>w\›ãƒÙ_¾™¸sºÍ0>€ CúÀÖ.¾n¹aÜ;3X¾_PªQÙ >{¤xžÁ&¾Ø' kù>|•ƒrR+ª¾bèׯ|þ¾kDû.í>~þÚN,¾ˆm’ŠQˆ>xDâ1ï쓾I½ö‚u¾s$÷+ÔµË>€«Ú=¸•¾€±OÇ"Kô>sJtŽH_Ê>G}ê%«ýT¾wÝ©B,~>R±y’8¾~ºF l`ü>k£{[ÓÕ>aÊ{žUþª¾{ÊmÎ0¾>på–|_e¾{3 <܈>`ìT4P>lùq_·T¾~ÒèÉ^I> 'w¾vî"Adñu>@Û›œî˜>sŽ8ÚF¢¾€s?•À¥^>€'ŒlL¾rEµ/ý¾N1°+öQu>w÷Àmht¾€þy"’À>} ê3ë|¾iˆåàÒ1¾bãþƒQ!÷>{–¿çñ¾ ¥_Èr>z%ÀípÃw¾\ÇCw͵¾mdýµñ/>~jV£Y÷¾€šû“Éé>uüûçLr}¾8F€T?@ñ¾s‹gë'‰>€(”P¶Õ¾l©{m–`>qIµäz%Û>PiðΈ3¾w¶Ã¾Cý>€¤ªGæj¾|ÌÀÅðÅÌ>hb3ä]µ>cùV“£¾{(¶S‹÷>€©sÆ÷¾yn΋+ìæ>[hyI}I:>m#զő¾}ÎY¯îj>€:| ¯w¾up  A‚ >6½Â³B >s%l™}O¾›™8¯I>~½h «.!¾pðÉZ – ¾OŸ$"w§>w"`K&œ~¾€E(n„1o>|=NW­¨æ¾h&^–Mû¾bB#1 =×>zqá’SG¾€MK£ß^œ>y “1|™¾[êÄ'õò/¾kô=Q<§>}í±]¾ÒÛ7•€™>uBämœq2¾<³:¤×@V¾ra¸Ê£´>~Êž¹Ï—¾~>…’OZK>qZç‚`A>JÆ­û2#¾v>B[âo>¾§ôçš¾{íÕV^¨>hÆÞN(6B>` IFR‚?¾yzÂ_©A>ë{ÑÈ6¾xõ›Ä*/Ë>^2h-ò©œ>iøÆs±¾|¡0Nš>J2Ùô$¾umŸ§2ÍG>Dßù<í’>qBk£‚`í¾}Ùî«ÞJ >}訡f;¾qp=[÷$v¾Bt1YLl¶>u [Xùô©¾~ëÔ~d«>{Õl)Þ!¹¾j4fNX/¾\R€¥ ì>x@Ýq} ±¾<àßxÕ˜>y"Ã?ÃCŠ¾a0ï×ZC¾g5ÇZU>zÖø£'n¾~ÐésXk÷>uåžæŒA¾N½ÀÛèé¾o׋V}e>|ÁÇã{Ѿ}°!O‚E>r5¾s] >+=ü×j»ø¾sƒ„ñÍN>}ûZ¹÷ ¹¾{çþçfˆ>lYnTù>UÅqä𽉾v¾,Av¸°>~‚)s:ÎÚ¾y…5ÛèÊ>cÈ|¯¿`>c©»Gd¾yh=}`>~Xu–2'¾vœêžÃ­>UÛÃì:X>kÙV˜PÒ£¾{v€ã\Úë>}„ØAU¶¾¾sC/+º×>/ñëé—>q¤-Wréɾ|âóVa¹Z>|sòÊ·¶¾ot–ºp¾KH³úA %>téÜé~U¾}ªˆyj0>z áR;g*ŒËâ¾^¬,¬J>w¯x…¾}θÓk‚>w¯?¶Öf¾]ÁšÆd…ò¾g`‘âê¯>yé •3ùX¾}R`ªîÓ>t‡/wÛ{©ß'n¾|>û™’ ½>q.ÌܨÑû>/óËËX`¾r¹Âg Æ>|¡v–¯i¾zžPÝÞù>kjâm—¤>TvÇdð' ¾už(ʯ»>}μ^”¾x}©y×—å>coWÍä8>bµöJÍE¾xcvá…º>}$úy¾uëïÈ}Åë>W ss‘ˆ>ivÙ±%Ö¾yïíÞ¤J×>|U›ªD:¾rù¢ð0‘Ì>p"²WAHö¾{O|®`8‚>{#ôøÂPñ¾oqW ¸M¾A€9q&‰>s&å„ÌF¾|%Â5Xs>yuŒóóóD¾hw›pW‚¾XûîË>uÁü“çL¾|qGÊj±©>wVhû‘V¾a*ƒm4оcbm}K›¡>wêΓ‰¾|7|º»T>tÔˆuðÞ¾S`e]$êµ¾j97~‘ >y›6'ä ¾{|YiîÒA>qÿ³ÞBz¾1eòÙþÌ<¾pzÏ£4ž¡¾zHÄú“ƒc>mË0Ê ¸>Dõ Pë¾s’|Rkê>{†•y䃾x¥Ì¾üû>g2 ]‡¤>XÚ!‡D‚ǾukÕû`à>{ÁR/-¢S¾vžÝfeµH>`RàIÓóÌ>cDµùY*£¾wk– b$>{ƒKïcuϾt@=íjz´>Rœ1x©˜>i©È €Ã¾xý‰Ó>zщ Ïó¾q—mZ<]>2@ ñE>o„M ä7¾zÚç¹z,>y³6õaY¾mcnM¯võ¾B¹ófxßœ>r`[‘F¾zÏåsø>x1ÅâF¾gt§–ã%ï¾{<Øï>vT„»í›É¾`ÕP½c2ñ¾aÜ'Ôkû>v‘dIvâ ¾zå» ª>t(¢ÿ™,O¾T–6sÏì¼¾gædþž>xœÜ¬ª¾zRFár>q¹ôÔBö¾=ÅÝl°q¶¾mwe~4«.>y=âù'Ž,¾y\ÐйC©>n#&ªáO>6@•ï#¸ ¾q>×p=>yý6}Å÷¾x ŠÉøîÎ>h}2ÖE´>R<í˜fe¾susoÉ}>zXžo#JÞ¾vjµÂó<>b™'`ýQ>^h¾qã½¾¾uZScxm>zR €-º®¾t~€¬RÏ>Y‡`,C>dõëìTÕ¾vék•Žÿ|>yîÁ[k ¾rSx=š³>I×'¾Ç~C>jPØ TjÕ¾x 6˜¥Â¿>y2§û¾oæïxÚ/è> ;#y´“ƒ>o6,eÄÚ‰¾xþÝ‚ñ->x"Ô–­¾jÑš©³P9¾F=|ÏÜ>qÌÂQÔz‡¾yƒ"Œ‘‚>vÇi Ï¾e{¨¾ßN¾V¦)wM¯ß>s¸(>Qô¾y± ¡óu>u( *Avª¾_ô’Ë¡ý¾`Ô•U0‡>uY¬c…v¾yŠâåív9>sL†wAT¾TÂÀ›Õ~›¾fE6Ž>v®ó$O+6¾yZKØ0E>q=C!K˾CØc{,¾jÕÀRÁÓ>w¶sÚ$»¾xRøk¸>n7ŽéÓ>fâÀáj¾o:Gâ½(>xp#¿{ÊS¾wI¤þE@b>iMñã)Ë>HíÀÛéeѾq•œÎŠ>>xÝ W~ñ´¾v'”sà>db« vVÜ>VúË'ǞǾsP%÷8nü>xþÇ+(u¾t~þÆrQ>^«gïeù'>`‚ ëóD¾tÉõÝå‘>xØ-)^òó¾rÊVFŽÏÁ>To’WtxÕ>e>Ì >÷â¾v£èéÑË>xlÖÂ>Ð~¾pê/Q¨ >D`cë÷þÕ>i§Ÿ.ë*¾vöRv”{|>wÀ¦Õæ4p¾mËQ‹þWè=Æ™z”ä>m³‡3ÍŽ¾w¨¨£ È>vØfÕ]ºó¾iˆVºèB¾CÆ”>VHè>p­µôå`¾xô3Sü->u¹U¥Ѿeõ!ç\¾Sƒ–â*=>rLô Vk¶¾xG¨êäÍ>th¤$6Á¾`R ™â¾\¾ÈW!<>sµ5*¾x9Y‹95~>rì!%…]¾WàñŸ&>ÿ¾bÀq?¯>tåXdßÍ»¾wð,¶ó±>qIÀ8þÞ¤¾M?g‰5dZ¾fÛÔÁU >uÜô ~»¾woftš7>oDÁóÜ(¾5¸î/ë ¾j«DX¹‘>v›î„˜×¾vº°@<¬Ì>kT‚U€ÛÓ>,ã9Å{3¾n("Œ¦§>w#'¤'‘{¾uÖh¾uI>grKÈ€Ÿ>HØç}($´¾p§)ÿý3!>wt&&9¾tÆ˃Òû>cqmfS >TðB3¹ò¾r SÈk>w@RâU¾s@J5l–>^»˜bßë>]§æïE¾sD²Ó‹Àa>wz•ã¾r7©c ~ÿ>Vƒ#‹û¼I>bi¸'“¾tM¡Ý’ò>w4A–’ ¾pÁ’ܸ+r>L—nJ*'Ò>f |¿Oßÿ¾u'Äst3>vÁƒ¤ôÓ¾ne¸øÒ>8žÙƒ.>im<%:<¾uÓv#PËq>v%!^V¯‡¾k•ËZWb¾úÃî“B>lŠˆA7š¥¾vQÖß7Õ‰>ubšìg‡>¾g¸|°:®²¾CJù^Rf>o`›xøtç¾v¤y…+s>t}2g`Š¾d;b"ϾQ2ï˜AQ>pöo9ÑH¾vËœs«²†>sxœìœ‘j¾`®úJCd¾XtUÖ{F>r'P¸Œ¼¾vʤWZŸ¨>rXš<ýjŸ¾Z7hš’zl¾__ÔÙ}¥>s\6C½¾v£-œN†>q Šfƒ¾SuÝH6§¾bö{¬äz>sçôŸ8U}¾vWrS¢9Ð>o¨:ROqO¾GîÕ »´ç¾f ú-/ªÐ>t˜ŠÄê‡N¾uê.àò€I>líÞq|=Œ¾3àACJ€Â¾hè j ê>u%åF#¾u]å_ 8—>jHÛv ø>0(ìb–¾kŽXuž>uŽ,f)¾tµ(/Ì>g.1·6R>AàÎQŠ¾mû)ÿ,âÒ>uÕl§GŸ—¾sòðÝ}Ì>d5ú+íÊ8>N÷yø¾p §ò]>uüX·sŠ¾sሱ>a4ýq*¤Ê>U9ˆÀ&6ñ¾qXI›‘‡>vXbœÞŠ¾r,•¦¨>\aÆoñK>[)´İ¾qòqéëÔ>uïOMJcÓ¾q-úõßh>V]×8©ð>`g‘®Ÿá¡¾r´ñu“Þ>u¿;”=a¾p ‘!‰)u>Pfw> Õf>c¢jnJ¾s[K£Ä¹ô>uuÔ¿®å™¾n ƒ—c?å>Eù‘uö>e• Ǿsæ"ß^¸>u8”è$X¾kÆnêP>2ÿy—F>gìÀ¦¶œ^¾tVŠõ>tŸ‹ý¥ì ¾ipEô@Y¾ 4²Ç ˆ>j>øP…¾t­ª¾M<™>tœåÚñA¾g,};“ƒ¾9fôŒUR>l×?òp¾tìZÚQA>s|SÖM…¾d§°¥€Ó¾GEæ!q—>mðµ)µÁ5¾u*›fc>rÓwm­ñp¾b=díŠk¾P¹íKõ’ñ>o›ÏÀ™…¾u&VP‰ ð>rZ7Jd¾_§&-ú–¾Uš·Ât²ì>pŽ/ߟs/¾u$% Œ±©>q[X^¹3â¾ZÛÌ¿pr¾ZBm¸n >q9É—Eq5¾uAS`;>p;mÅðý¾VâŒs¾^®Å®Ìn>qÑgýI©¹¾téØ18R>ozt¿€¼¾QràþÂ4ù¾aokÉ!ž>rU‚Ïq°ô¾t²ÄYN1>mÈ-mÝ—¾I¿[ʼnֺ¾chvz m¥>rÆý–0ɾtn5.ýù>l öûf¾@ÐI‡ü±ò¾eBÀ¿Ä->s&Îrís¾t©Vìþ!>jKEiLÁª¾0=™£euœ¾fþ·3'h>su¢7l&½¾s¿oâ ü>h† PM7=ãOÖçµ¾hšL¤‰>s´‹eª…¾sX#†>°†>fÀU)Y>0ß_FÚL=¾jŠÚíÒ>sä }¢Åf¾rçüÈZ¤Ä>dû ßzÝ>@E6!¼IC¾ky݃èvY>t©´êÛ ¾rp)ãô™«>c9xçÉÇo>GÈÄœìBÞ¾l½¦yDIW>tÈ0 ôr¾qò{Öœ»>a}qÿ­ÛÅ>NøÈäM`µ¾må¼,H1">t%*ÕܾqníGõf>_z1w!>Rê0í u7¾nòã¤|ô+>t#r6Ö¡O¾pç•D^W>\7:‚–äw>V,aú<  ¾oæaÛv±>tå7ͫ׾p][b…ò>XòXTeÃÀ>YC0°à8å¾p`Wà#_i>tŽ–ÂXH¾o¢?¶™Kñ>UÃO[0ž>\/!®Fu¾pÁøÕã*H>sç)¤€ Ó¾n‡fÞ!¯V>R¬­ÃÈ3>^ï–b³%˜¾qiH‹$3>sóBÅɾmlPMl–[>OaMÜ´E>`ÂÉúypª¾qdˆ9(Í>sš[ÂW3¾lRZFg8>IŸ·èŸ×B>aùŠ²Ê¾q¦àºZù—>sk—ÒRî¾k:‚Fc>DóÈãAÆ>cÏeÛ¾qßýËQ />s8gD°CC¾j'O¾A°>=™ÐÆ+ü>d(âéϾr¿ù]k>s¯Úos°¾iý‰»S>3|Ú‡£±w>e#,*h·*¾r9®¶m*>rÇù+þ;¾h³ÊÀ©¤>#ºh”)'>f ÑÕ"žr[Pݱ¾0>rŒ4~5 ¾gÞKOah=ç¼ñA–®>fà]ˆiŒT¾rv{6n:>rN½þˆ!ê¾f-Á&¤¾Œi=x¨œ>g¤´“ÿѪ¾r‹«[…9!>reFl¢k¾e'2µý“%¾0¾ë¨ô>hX˜¯Ú¾r›Vúöx>qѸu©¾dAnÑaN¾7¢P»«tú>hûiªÕ]¾r¦CeÖc”>q“YÝ}Ù¾ce:}Ìf¢¾>©È:Œ>i›ÕÞÃ?¾r¬Ûi¯@ï>qU’Uœhf¾b“ùŒffù¾B±ô^7s$>jí%¤ª¾r¯‚£·ßO>qðÆ;¢#¾aÎ7ùIÁ`¾E°+Q^ƒ>jŒA2Ò@.¾r®èNE…%>pÝú—Ç5 ¾a%¤jå½¾H•ëPñ>jöt$8Òʾr«`;Åù>p¤Û•aùÒ¾`eä8TB ¾K+RÀ¬>kS¼oª›û¾r¥7åò9(>pnä“Xº¾_ˆW,‹Ï¾Mƒ{¨â½>k¤êDç6¾rœ²ßt>p9Ü‹|kA¾^^„ô`r¾O _ç®,Ð>kêÃáUK ¾r“ z&l«>pvus¾]LÀõueÀ¾PÁ@¦0½>l%fOÛ8¾r‡uLU–ì>o´Röö¾\Uµ# Ã ¾Q”~óÕ>lU…ù4ªs¾rzÈÑÁ_C>o^Šýk…¾[x°ŽrʾRK®é;Ëî>l{Î\–Å“¾rm(ÂòÙ/>o€™ )¾Zµgx+ ›¾Ræ§Ï— ÷>l˜8ë&8оr^²g¬@>nǸ²H ¾Z Ï’VÃo¾SeiÌRr%>l«[<¿¾rOÊDr2¡>n‡¥^Ó.¾Y~„<¾µF¾SÉ+íFÉ>lµºÜXp;¾r@~w ,>nO˜Àâ>¾Y /ãÈú¾TÝQ%MØ>l·2‡ëNÛ¾r0Óiÿ>n9É€Šw¾X°T-žÏº¾T?hз €>l°/qŽ¾r!#:ït>mõ„-=Ú¾Xp´[’w¯¾TRí|¿à>l¡!éJÔ¾r; ábº>mÔƒ·=ß\¾XJ¦tCƒ³¾TLC²Æ>l‰’¸!”€¾r2#»5>m»fûx0V¾X>Ô’“ ؾT+7 Ê_½>liö]§Ï¡¾qñ.ŠU>mªR¤q¾XLŸ:âµÀ¾SðÈÆ\ð>lByöD`ò¾qá¶$0>m ¿DN¾XsY-q]¾Sœ¸ÝŠ&Z>l¯+¥3¾qЫ®-{>mžµCú]Ö¾X³Ž`¥“¾S.¹¿W¡ý>kÚ¸2Ÿ$¾qÀ!s¾ÕJ>m¤1Þ7û¾Y {P.ËŽ¾R§­0%?>kš«Ë_ÿ‹¾q¯8!G¸>m°Š0¥¾Y}[š·:™¾R:î¹Úz>kQø(0Õ¾q°7‚ñ%>má›R˜‡¾Z—böò¾QLÿ]¼ >kžÕö™O¾q‹’ ý‹ñ>mÝOJãu¿¾Z§I„ŒM¾Pyͯî[×>j¦–Z^ ¾qxün§>müÀvä%¶¾[^…ȾOuÍÑ×>jC-²h¸¾qdSzæR¡>n!±Ìß㣾\,Š‹g;M »ê4íþ>iÖGï¶wK¾qNÏaÄ´>nKÑ ±]ɾ]Gh‰¾JÎùqðpá>i_À¿½¾q7¡èÃŒô>nz% ¾^™\s¾H]n“"ª9>hÞÍKjä¾q`b{‘D>n¬;Ó ¾_ƒhš¾E¸BJ Mv>hS<3Bƒ4¾qèÇ…®ï>náš­.*¾`Ýc@…¾Bá04]¸—>g¼Óz}êþpäÅPyÉ>o؃:¾`³í-÷¹F¾?¯'¤dˆv>g»yÇJ8¾pÃy„Îk>oR-5Ò¾¾aUËácxŸ¾95Ë [-(>fl´i‡+‘¾pžÏn=½ï>o‹ó®0š ¾aÿ«”óâ¾2ZJmo–>e²{Ü(Åm¾pvAó€nŽ>oÅKÙÿ&ö¾b°¬¡ˆ»¾&8;t[N>dë6€ß¾pIDõ$>oýVº;g•¾chzVh× ¾ ÙÃû“ßÀ>d¥IÃ&J¾p”H‡Œq>p›‰5˜¾d&HƒÆ> CëÔTÁ>c4Œò=è¾oÁ9T¶a>p2²¤‘郾dè^ògo¡>)½P¾äw>bD¢p+5¾oG:)Ê>pIp~Ú¾e®Î]÷€>5•xà¢ô¸>aE03ãǾnÁY¡û>p]Oi^§¾fxÕz©>> çê-h>`7œ"ßæ¾n. €4>pmqÚ™ó5¾gBþÀ;<†>Cÿ$”h3>^5pÑJ#Ѿm‹Åò', >pyB» ¾h‘È”¢ÿ>HÕ ¹ùÚÿ>[Üÿ­§–ȾlÚ*ÛN½/>p€%Qº9¾hÙQC±C¡>MÍûan>Yf]! ã¾l ]ç]>p(Üà ¾i¡ž„)¢Ó>Qs!:È‚m>VÏ—7ÂÁ"¾kD?`Ü>p{¥+Lƒ°¾jfS,Ïé0>T è™ûJ>T7G¥O¾j^Bˆ´•">pnë» D¾k%Ÿ?U <>V´.R"B >QFœ w'•¾ie¾=F>pZ³¢Øô¾kÝ•(D>YcÒq>L©%HeI[¾hW”‰d"ò>p<3fòº4¾lŒÄGŒã>\vÀar >FŠ´Îõ¾g5•ƒg9v>pÌ.î¶Ø¾m1½/n>^ÔB€††>@4û*èöé¾eþ?zÊ~g>oÅ¢΃–¾mÈGŠ)Ÿ>`Ç¢â!>3Rí–¡B¾d°åy/=>oK!eç)¾nP´›Øe&>b"{œÒ >e ÍŒõA¾cM°Œí>n¸Ädwèk¾nÇÿ5âd>cy㌞;áô¤f±¾aÓßΩc>n ³ŠÁáb¾o+¿Ü‡mô>dËS|~©¾6¯tE7¾`Cžgi>mE½Äå}Ö¾ozVJþ>f© ¥¨›¾B?¿¡Þk…¾]:¹³Ä\Ž>lbÎÚ%6Z¾o°c<¨>gS,Fò¾I‹Žaø«á¾Y§›µ~#>kbbÓo¾ȯ׎T0>hƒúeú¾Pu#º¾Vê|,¢ì>jC©,oÌEàƱ>i¤íï>$ؾT)2Ú¾RUï¡9>i ü~F¾o­FñÆïÀ>j²šxc¾W܈ôå¾LÈQb?ƒ>g¨Œv.êä¾om-_Ih³>kª/:V™¾[‰ŽÊUS¾DŸg· ^>f+h- Á¾o Eí™D¿>lˆÅä —T¾_+^w±A¾8pW¡zf>d–'àϨ¾n‚km‡†¡>mJÕ2ÀÑs¾a\ñ7:¾±¾Ó6÷. ÿ>bÐS¸A¾mÓ ×Zi>míZÊØê¾cܺ­Kp>$ÃHW}Wí>`óIž>%¾lü·ïî’º>nmWÉ4“¾dÂqÝ« ><9C2 £•>]ð 3 p¾kü(Æ¡×g>nÇ@â%z¸¾fX¢«†p>GÚ¬°ò>YÀ5½Äð¾jжT8>nø3‘>QQ¾gÖÄšR`*>PM*LŽÂ>UY>oQ„¾iz E–‘>nýhKWÎœ¾i8{ œ_>T‘ÐÉV>PÀ‚ÐrF¾g÷¬ö¥Æø>nÓµM¿ñ+¾jyKvû‘¤>YÖËÔ£¢>Gõ/A± ¾fIz3/ùÐ>nx¾Ñ½•¾k•B{þB²>]^«ãMqm><8Û,_Ç·¾dpk3¬ÎÆ>mêk§{æʾl‡Ô o›s>`Í ù×G¨> |NDBé¾bmf Lýç>m&oï 0$¾mLƒôd/>bÕ–Ac}¾(ú8gñb³¾`Aà®CÑš>l+w²A†©¾m߀ðó±>dü/óvʾ@ž O0†s¾[àñª:‚>jø¦{ðô¾n<—NÒF >f‘ˆš½n¾K8Jµ´’¾V÷»tL6>iÙÒðø¾n_×ÊÔª>h9t'z…¾R¬[€Ð^D¾QÎÓI„Sæ>gé&fÎ1¾nF0#™L>iµåé_ѾWÂÁ ÀT¾HÞ½4Ð<>f ³UÅ8A¾mìr³6ÉP>k¼ÛÐn¾\·tþ°¢¾;‹'QmªÞ>cûêÝ‹ŸŠ¾mOðÓ|ÆD>l{~õ"¾`¾»ëxU‰¾>9¼e”£>a¶B$]á4¾lo!g¸§T>lë׿|SѾcè„ç>2@; y>^€ ºnÓ¾kHŸpæ\>mE’®­¾e!:Bá\>D·4{6^¨>Y9­JÉà~¾iÛÏÃ9iô>mÐ/®IXN¾g¡+6>P ÌðO>S£ŠÅÎKľh)}!Sú\>mÔ„šÁNj¾hÍî6Á&m>UÌ_š Úk>K“AÀÿÕ¾f2ßLìt>mŠL'T±¾jM>ƒiòµ>[Oâ¦ê†“>>â—˜0cÕ¾cú2Ã¥>lîà³%‚K¾k‰6øebO>`Lv"¼)>šÓ„Š7¾aƒSa­~>lcàY}¾lzà “ù>bÊE‚a˜¾393EN½ã¾]¥v6–öz>j½à:5¾mʶOE|>e›eŒ;¾FBñ¦¾WÜ#ŒÚšR>i'he€_þ¾mf¾¿ :Ò>g+¬†£p®¾Qc…sA¾Q¹u­>g>¹!‘¾mVÑÞ»Wd>hüžº0‚z¾W€¯dƾFšÿD=N*>eCìÔp@¾lè  dm>jžk´^¾]a†x|ø¾2ªÉOÔw/>b‚papÚ¾l}@a¶>k²Wï“Í^¾aw‰ä8Ù­> Ê‹š>_r=t©yõ¾jæˆ)ŒÚ>l†©FI¾d +y[Ê>AÏX 9>YbbWÄö.¾iR_1.k>l÷är•¬V¾fZx’ÌÈ>OP"ó–dŽ>Rç+¹aÅ̾g^Le²ùË>m…RŒÒ÷¾h^Á[æw>V?_4Ì1ñ>H+à îw¾e Ìò&Dþ>l›ÛºÆxH¾j 7cñ>\’tsÑ™>4¢{B¯7¾bf8Š´†>kÇRÏ„'¾kX 9rñ¹>aB½£â÷4¾!“¸¡Œ‹¾^Þ§aU¹>j‚W²>å¾l9‰´in„>cý­Ž2Ö‘¾BâY]–\,¾XdŒ¿Öß>hÌèkÏFè¾l¨‚?å­>fl4:ûu¾Pš;ËÁ9¾QtHçIð>fª÷êdl×¾lŸÓRÐ>h€ùªÍBW¾WŒí’ÑØ&¾DQƒvÍë>d!Þ—O•‹¾l²Ê0Øq>j.ð3ÜÁS¾^'‘Òjáq¾$ú~„«>a8ø! ξkúÀð€t>kj¿à Ÿ¾b$†²ƒt‘>4 ߈E!>[õ‚Èz¾iŽl:Ùn‘>l*–óRï¾dç¾Ï—*>>IPNèo ‡>TænŘ²¾g•$²š>leÿ8ùX¾gMS £¡>T´·WP>JÅœÑ0¾e¿å\‰>lEšAξiEfAn>[>Ä Ü>61Pð¼¾b/”Ô¿3>k;LôÅ+ß¾jÂÈ9úŒ>`óRw¾#¸ # ±s¾]ÌIDpŸ_>iÑLƒËe¦¾k¸äÇF>cõº’á¾DýÖp3ϾVŽ°±²Ô >gÜôÂqŠ¾lCæ³ ¹>f”¤U7w$¾R_™Pí±3¾M‘“˜w>eaô +¾k랉Ñ1ï>h½åÿ©¾Yëy8@ëw¾:„‡=!e…>bkæO¨a¾kÉž4Á>j`@”[œ¾`z­)ùü\>Ò N]7W>^o²ª(¾i±›„ÐPÓ>ko‡FrT¾c§º³;¯>DCê”.>V‡îÙ •E¾g­([Pèm>kÞ”¼£6ó¾ffÖas£>R[~_¶!@>L×¾f E¾eˆ$Ù×>k¦ÿ„—a$¾h£õÞ¤ƒ>Z6Žy´(>7žZ ¾,¾aùq$Nî>jăc¾jLµÛÕ>`¾.”_Š4¾&#Œãª…¾\ÊqÛÛ%S>i6þ!ë&¾kQÜ í‹>cý¢»“ãù¾G¡KÞ'é¾TÚp}~Òß>gaXdw€¾k§Õd_M>fÀû¨‡/@¾T£·m+¾H¤O§{=y>d3^µmnA¾kE38 ˆ">hñeâç3ò¾\ÌE`©¾+4Õر|b>`Õó1êI¾j(곊ÖÔ>j{kŒ¼±°¾a²Ö“4Su>6µíž4ž>Y÷s–¡xý¾hT›6£|>kOIrØ›ˆ¾dèF¯Lú¬>MTGŒ|>Q~Ø]b0¾eϪàÇ)m>ka0¦œ)¾gDî5Òã>WMU!TÍn>@ï¼"ƒæ¾b§"òVuë>jªû×8ϾiŠ?Ÿý8Ó>_TÇøà•Ü¾ àÙçLw¾]Ü_Šdvò>i,E/´¶¾jËÖ 5>c? îﱉ¾D~Ùÿ…_ݾUyÝ<òê>fêT”Øñ{¾k@?LQÆ0>fEº¥·cl¾SašÙóǾHÂOV2à>cñfë[Xª¾jà³úyùm>h¢‚íPµ$¾[ú k/‹H¾&±åà:>`T@h,î¾i©r¿À>j=t§¾aà$–@Î >;r( T-Ç>XW|ªI¾g%àx+>kŸdÇö+¾e6Sj#{ >Pg‡<—‹v>NXÖ«…ƾdÈ_ûùv>jæð6n}“¾gßm, ßÑ>YwÁƒ8v>5Åuáz!.¾a=K²2¼%>iäB"b›Ð¾i¿dzbI¦>`ݨíê¤Ô¾2'™Œ´¿ø¾Z+uDïT>gý:„Wŵ¾jÀi2KàÆ>dqÄ«Ì„¾LÛ¸®Ì'¾¾På¸)þ>e<ÍDǾjÓm¾²O>gS’šï“§¾Wßžt&>B¾;ÛÈ,ÚmS>aµízobŠ¾ið+VJ>icÀ“d ¾`BŽs½¾­>*J?Äp>[Àr¤5ʾh“g+“>j‰X£ –ý¾dTvÎa!>Jö"ù(£^>Q—p’ø6¾eZ7ì'6>j²µF8‘Ó¾g Ò–,Ä€>W;“Ê” R>=¯¬H"üÛ¾aÆ‘Ýþ>i׳ˆ¾i3¢MFUÉ>`Þcßy3¾(Ì&WÏe¾Zùð^ÉìÙ>gú*¤ªT}¾je%æò‚>cï°eÊÕ¾K Ü.Ïë8¾QH÷±Ú>e&ŠÔr¾j‹5¤L>g½í)¾W2VµarcþS0Ù¾iëü,›Þ>i0¸É-¯¾`Q¦Í+­%>/ÁPϵS>>ZÍbªé¾gŸÇu< ]>jSúª ¾d5” |>MUòáþŠW>OñHS8¦¾dŸ:)y7£>jY÷ã¤H¾gCèûå©>XÎέO^Î>4Â:ö¼¾`·,¦ w>i=òì+ã¾iUOs—Â>`÷°À?r¾7ˆ`"è{Û¾X ü(—Þ>gì¨Þt†¾jK.““õ0>dÍ}6A½”¾PÃduEËi¾KKJßÍzD>c¾„áÜÿ3¾jHi¤Zö>g¹´«™Ëz¾Zó0rbÓ1¾$ ePÞ¼>_ú{Êݾh«H ›Œ>i“5]³ü¾aúOø+>A£QÆP>U9ÞÀ²«¾f[ó>Ô>j<ÊRs¸¾e©Xï´%Ö>SÌã»õ?>DƒAb)ǾbvèðÖ>i§m碱,¾hTí¶”1>]ãmQ\°¾ŠpŸF!¾[Ô†«»>ü>gÒ2©g×¾iÔí%2 ‘>cJÈ+$5¾Iwí†Êú¾QN2_žž>dÌÂ]ôz¾jWÝ_xT>f³DÌŒ™¾W­ßWÐ !¾7h¢Ù§¡L>`·q÷®¾hù;óÜ=®>hûŽBZ¾`½Úɱ0X>7Þ\Ìyf©>W–« ^ž¾f˜ÁnR å>iü]Â{ ¾dÎvGÖ¨T>QŒ W;‡k>H‘q°÷4;cLNd >i¢4c8Ǿg̘J‘t>\D?_GÒ=ö§îõ‘SŽ¾\Ö¿­8>gèÜ'Llÿ¾iˆ|&À%>bÃp°PÂî¾GTäï#ZþR¯ù g">dàR[:c;¾iâ«nfB©>fe ü2tå¾W^Å”Ý[¾8„2ÜS€m>`«úgh™N¾hÍ¿}wô>>h̶ëO ¾`«2¿¸ló>8¨jÔYv•>Wzt A¾fPÁæãI†>iÐuÖ»œ±¾dÜõÈ‹.4>R-¶sêH>F™ªQÓ;¾bˆ_¢4€>iYEq±Œå¾gàD¯•r>]4Ù†ð5‚¾ÓŒý ¾[Jÿ×ÎÖ>ge/߃‹Ä¾i€§ñÛ*k>cI©lMì$¾K$bcòV~¾O¯Ô‹B›?>d ‘A «'¾i{j–(¹>f×ß÷«\ý¾YC–Z>¾*ý­”>^å.³V„<¾h,ª¿ ˆ>i¬9&ì¾a½n#K>B¿šõ_ýù>S©V1]è¾e:=Ï(>i«§ªQ¿~¾eÅ«Ÿ’l½>Uœhf(€>=M‘ T‚¾`ï$‡“ö>h³ÈÁ‡,è¾hsáJ7ºª>`EÛ{ãI¾6“™õ©pj¾W%)6¼8>f%ïü¾i“¿»ïn‡>d¸þ½½¼¾RRâàµ[T¾En?Ö¥ú¥>b"ŸVå6¾i ýÁ? >g×Qœ¤9.¾]ß ì]¿|>#R<£(ƒ>YÎEö–ȯ¾fÖE»Kº >icÛU1¾c¾ˆHØS>Nê]0‹žÛ>K9±pè¾c0gà}þ>i;%ë’³q¾g=ËP=H>[…ö¿“Ƭ=òÚQámý¹¾\§Ë\KF>gV¨þÙU7¾i(w>bà_!Vð¾Jz†•šU¾O«2ΆI¦>cÎ\áÕ¾iR'é\N„>f±Ç ¦¾YŽ ‰´¾#ÒUu¯Ü‘>]³˜ÙHÒ¾g¯¯ó€ë>hêj)^ ¶¾b&Y[Ö½>FBãZŽ?`>Q˜(Ø~¾dTíE¾ku>iWÿÅi•3¾f;˜åÕTö>XtÀÁ>0ˆ’<çgèØ<{P¾¾h²Ñ3YØ_>a–>ë‘^1¾CkŽ¾RØ\+}Nm>d®y½ê" ¾iS»)f¾ß>eáfcþC¾VåÙ̬“¾5t;•ôG>_»R¥)N;¾h 6Ç>h‡1:~¹Ë¾a41ífXa>A˜Ó Á‚>Sš,kÊþX¾dßMõ zÙ>iJY k×ü¾e§gÊÑÉ>V@¼ Dš”>7}üŒZEM¾`öPnò>hÔ¿9ä¾hktÛaÃÀ>aÄ>î.ã¾@ͺÞß•¾Sà#c~>dꊿ»¾i>çÁƒQ>eìñlú¾VÙ/a¨½¾7Ú)Q_ð>` Á5É€¾h"C6Vé>hadÃ)2@¾a%µŽž>A Jî<>S¬tI)ª¾dÏÿé&ö‹>i2ik k/¾e›¤áaNÆ>V_q{J—>6$‡ko'¾_®m¬å‹>gç ¸Be‹¾hhÖ,}§š>a5 l[hý¾BM!ªTc.¾Rý€’F¥>d/½#N¸¾i#ØN˜v>eÉsƒZѾW";JH<¾2Zù & )>^Ú£Ò•¾g±îUÑ•!>hˆ–€3k¾a–ÃüÝ×Ó>D–‘M~p>QÑc¶­ð¾d(6ö ±>iþÉ.‡¾I¿[ʼnֺ¾chvz m¥>rÆý–0ɾtn5.ýù>l öûf¾@ÐI‡ü±ò¾eBÀ¿Ä->s&Îrís¾t©Vìþ!>jKEiLÁª¾0=™£euœ¾fþ·3'h>su¢7l&½¾s¿oâ ü>h† PM7=ãOÖçµ¾hšL¤‰>s´‹eª…¾sX#†>°†>fÀU)Y>0ß_FÚL=¾jŠÚíÒ>sä }¢Åf¾rçüÈZ¤Ä>dû ßzÝ>@E6!¼IC¾ky݃èvY>t©´êÛ ¾rp)ãô™«>c9xçÉÇo>GÈÄœìBÞ¾l½¦yDIW>tÈ0 ôr¾qò{Öœ»>a}qÿ­ÛÅ>NøÈäM`µ¾må¼,H1">t%*ÕܾqníGõf>_z1w!>Rê0í u7¾nòã¤|ô+>t#r6Ö¡O¾pç•D^W>\7:‚–äw>V,aú<  ¾oæaÛv±>tå7ͫ׾p][b…ò>XòXTeÃÀ>YC0°à8å¾p`Wà#_i>tŽ–ÂXH¾o¢?¶™Kñ>UÃO[0ž>\/!®Fu¾pÁøÕã*H>sç)¤€ Ó¾n‡fÞ!¯V>R¬­ÃÈ3>^ï–b³%˜¾qiH‹$3>sóBÅɾmlPMl–[>OaMÜ´E>`ÂÉúypª¾qdˆ9(Í>sš[ÂW3¾lRZFg8>IŸ·èŸ×B>aùŠ²Ê¾q¦àºZù—>sk—ÒRî¾k:‚Fc>DóÈãAÆ>cÏeÛ¾qßýËQ />s8gD°CC¾j'O¾A°>=™ÐÆ+ü>d(âéϾr¿ù]k>s¯Úos°¾iý‰»S>3|Ú‡£±w>e#,*h·*¾r9®¶m*>rÇù+þ;¾h³ÊÀ©¤>#ºh”)'>f ÑÕ"žr[Pݱ¾0>rŒ4~5 ¾gÞKOah=ç¼ñA–®>fà]ˆiŒT¾rv{6n:>rN½þˆ!ê¾f-Á&¤¾Œi=x¨œ>g¤´“ÿѪ¾r‹«[…9!>reFl¢k¾e'2µý“%¾0¾ë¨ô>hX˜¯Ú¾r›Vúöx>qѸu©¾dAnÑaN¾7¢P»«tú>hûiªÕ]¾r¦CeÖc”>q“YÝ}Ù¾ce:}Ìf¢¾>©È:Œ>i›ÕÞÃ?¾r¬Ûi¯@ï>qU’Uœhf¾b“ùŒffù¾B±ô^7s$>jí%¤ª¾r¯‚£·ßO>qðÆ;¢#¾aÎ7ùIÁ`¾E°+Q^ƒ>jŒA2Ò@.¾r®èNE…%>pÝú—Ç5 ¾a%¤jå½¾H•ëPñ>jöt$8Òʾr«`;Åù>p¤Û•aùÒ¾`eä8TB ¾K+RÀ¬>kS¼oª›û¾r¥7åò9(>pnä“Xº¾_ˆW,‹Ï¾Mƒ{¨â½>k¤êDç6¾rœ²ßt>p9Ü‹|kA¾^^„ô`r¾O _ç®,Ð>kêÃáUK ¾r“ z&l«>pvus¾]LÀõueÀ¾PÁ@¦0½>l%fOÛ8¾r‡uLU–ì>o´Röö¾\Uµ# Ã ¾Q”~óÕ>lU…ù4ªs¾rzÈÑÁ_C>o^Šýk…¾[x°ŽrʾRK®é;Ëî>l{Î\–Å“¾rm(ÂòÙ/>o€™ )¾Zµgx+ ›¾Ræ§Ï— ÷>l˜8ë&8оr^²g¬@>nǸ²H ¾Z Ï’VÃo¾SeiÌRr%>l«[<¿¾rOÊDr2¡>n‡¥^Ó.¾Y~„<¾µF¾SÉ+íFÉ>lµºÜXp;¾r@~w ,>nO˜Àâ>¾Y /ãÈú¾TÝQ%MØ>l·2‡ëNÛ¾r0Óiÿ>n9É€Šw¾X°T-žÏº¾T?hз €>l°/qŽ¾r!#:ït>mõ„-=Ú¾Xp´[’w¯¾TRí|¿à>l¡!éJÔ¾r; ábº>mÔƒ·=ß\¾XJ¦tCƒ³¾TLC²Æ>l‰’¸!”€¾r2#»5>m»fûx0V¾X>Ô’“ ؾT+7 Ê_½>liö]§Ï¡¾qñ.ŠU>mªR¤q¾XLŸ:âµÀ¾SðÈÆ\ð>lByöD`ò¾qá¶$0>m ¿DN¾XsY-q]¾Sœ¸ÝŠ&Z>l¯+¥3¾qЫ®-{>mžµCú]Ö¾X³Ž`¥“¾S.¹¿W¡ý>kÚ¸2Ÿ$¾qÀ!s¾ÕJ>m¤1Þ7û¾Y {P.ËŽ¾R§­0%?>kš«Ë_ÿ‹¾q¯8!G¸>m°Š0¥¾Y}[š·:™¾R:î¹Úz>kQø(0Õ¾q°7‚ñ%>má›R˜‡¾Z—böò¾QLÿ]¼ >kžÕö™O¾q‹’ ý‹ñ>mÝOJãu¿¾Z§I„ŒM¾Pyͯî[×>j¦–Z^ ¾qxün§>müÀvä%¶¾[^…ȾOuÍÑ×>jC-²h¸¾qdSzæR¡>n!±Ìß㣾\,Š‹g;M »ê4íþ>iÖGï¶wK¾qNÏaÄ´>nKÑ ±]ɾ]Gh‰¾JÎùqðpá>i_À¿½¾q7¡èÃŒô>nz% ¾^™\s¾H]n“"ª9>hÞÍKjä¾q`b{‘D>n¬;Ó ¾_ƒhš¾E¸BJ Mv>hS<3Bƒ4¾qèÇ…®ï>náš­.*¾`Ýc@…¾Bá04]¸—>g¼Óz}êþpäÅPyÉ>o؃:¾`³í-÷¹F¾?¯'¤dˆv>g»yÇJ8¾pÃy„Îk>oR-5Ò¾¾aUËácxŸ¾95Ë [-(>fl´i‡+‘¾pžÏn=½ï>o‹ó®0š ¾aÿ«”óâ¾2ZJmo–>e²{Ü(Åm¾pvAó€nŽ>oÅKÙÿ&ö¾b°¬¡ˆ»¾&8;t[N>dë6€ß¾pIDõ$>oýVº;g•¾chzVh× ¾ ÙÃû“ßÀ>d¥IÃ&J¾p”H‡Œq>p›‰5˜¾d&HƒÆ> CëÔTÁ>c4Œò=è¾oÁ9T¶a>p2²¤‘郾dè^ògo¡>)½P¾äw>bD¢p+5¾oG:)Ê>pIp~Ú¾e®Î]÷€>5•xà¢ô¸>aE03ãǾnÁY¡û>p]Oi^§¾fxÕz©>> çê-h>`7œ"ßæ¾n. €4>pmqÚ™ó5¾gBþÀ;<†>Cÿ$”h3>^5pÑJ#Ѿm‹Åò', >pyB» ¾h‘È”¢ÿ>HÕ ¹ùÚÿ>[Üÿ­§–ȾlÚ*ÛN½/>p€%Qº9¾hÙQC±C¡>MÍûan>Yf]! ã¾l ]ç]>p(Üà ¾i¡ž„)¢Ó>Qs!:È‚m>VÏ—7ÂÁ"¾kD?`Ü>p{¥+Lƒ°¾jfS,Ïé0>T è™ûJ>T7G¥O¾j^Bˆ´•">pnë» D¾k%Ÿ?U <>V´.R"B >QFœ w'•¾ie¾=F>pZ³¢Øô¾kÝ•(D>YcÒq>L©%HeI[¾hW”‰d"ò>p<3fòº4¾lŒÄGŒã>\vÀar >FŠ´Îõ¾g5•ƒg9v>pÌ.î¶Ø¾m1½/n>^ÔB€††>@4û*èöé¾eþ?zÊ~g>oÅ¢΃–¾mÈGŠ)Ÿ>`Ç¢â!>3Rí–¡B¾d°åy/=>oK!eç)¾nP´›Øe&>b"{œÒ >e ÍŒõA¾cM°Œí>n¸Ädwèk¾nÇÿ5âd>cy㌞;áô¤f±¾aÓßΩc>n ³ŠÁáb¾o+¿Ü‡mô>dËS|~©¾6¯tE7¾`Cžgi>mE½Äå}Ö¾ozVJþ>f© ¥¨›¾B?¿¡Þk…¾]:¹³Ä\Ž>lbÎÚ%6Z¾o°c<¨>gS,Fò¾I‹Žaø«á¾Y§›µ~#>kbbÓo¾ȯ׎T0>hƒúeú¾Pu#º¾Vê|,¢ì>jC©,oÌEàƱ>i¤íï>$ؾT)2Ú¾RUï¡9>i ü~F¾o­FñÆïÀ>j²šxc¾W܈ôå¾LÈQb?ƒ>g¨Œv.êä¾om-_Ih³>kª/:V™¾[‰ŽÊUS¾DŸg· ^>f+h- Á¾o Eí™D¿>lˆÅä —T¾_+^w±A¾8pW¡zf>d–'àϨ¾n‚km‡†¡>mJÕ2ÀÑs¾a\ñ7:¾±¾Ó6÷. ÿ>bÐS¸A¾mÓ ×Zi>míZÊØê¾cܺ­Kp>$ÃHW}Wí>`óIž>%¾lü·ïî’º>nmWÉ4“¾dÂqÝ« ><9C2 £•>]ð 3 p¾kü(Æ¡×g>nÇ@â%z¸¾fX¢«†p>GÚ¬°ò>YÀ5½Äð¾jжT8>nø3‘>QQ¾gÖÄšR`*>PM*LŽÂ>UY>oQ„¾iz E–‘>nýhKWÎœ¾i8{ œ_>T‘ÐÉV>PÀ‚ÐrF¾g÷¬ö¥Æø>nÓµM¿ñ+¾jyKvû‘¤>YÖËÔ£¢>Gõ/A± ¾fIz3/ùÐ>nx¾Ñ½•¾k•B{þB²>]^«ãMqm><8Û,_Ç·¾dpk3¬ÎÆ>mêk§{æʾl‡Ô o›s>`Í ù×G¨> |NDBé¾bmf Lýç>m&oï 0$¾mLƒôd/>bÕ–Ac}¾(ú8gñb³¾`Aà®CÑš>l+w²A†©¾m߀ðó±>dü/óvʾ@ž O0†s¾[àñª:‚>jø¦{ðô¾n<—NÒF >f‘ˆš½n¾K8Jµ´’¾V÷»tL6>iÙÒðø¾n_×ÊÔª>h9t'z…¾R¬[€Ð^D¾QÎÓI„Sæ>gé&fÎ1¾nF0#™L>iµåé_ѾWÂÁ ÀT¾HÞ½4Ð<>f ³UÅ8A¾mìr³6ÉP>k¼ÛÐn¾\·tþ°¢¾;‹'QmªÞ>cûêÝ‹ŸŠ¾mOðÓ|ÆD>l{~õ"¾`¾»ëxU‰¾>9¼e”£>a¶B$]á4¾lo!g¸§T>lë׿|SѾcè„ç>2@; y>^€ ºnÓ¾kHŸpæ\>mE’®­¾e!:Bá\>D·4{6^¨>Y9­JÉà~¾iÛÏÃ9iô>mÐ/®IXN¾g¡+6>P ÌðO>S£ŠÅÎKľh)}!Sú\>mÔ„šÁNj¾hÍî6Á&m>UÌ_š Úk>K“AÀÿÕ¾f2ßLìt>mŠL'T±¾jM>ƒiòµ>[Oâ¦ê†“>>â—˜0cÕ¾cú2Ã¥>lîà³%‚K¾k‰6øebO>`Lv"¼)>šÓ„Š7¾aƒSa­~>lcàY}¾lzà “ù>bÊE‚a˜¾393EN½ã¾]¥v6–öz>j½à:5¾mʶOE|>e›eŒ;¾FBñ¦¾WÜ#ŒÚšR>i'he€_þ¾mf¾¿ :Ò>g+¬†£p®¾Qc…sA¾Q¹u­>g>¹!‘¾mVÑÞ»Wd>hüžº0‚z¾W€¯dƾFšÿD=N*>eCìÔp@¾lè  dm>jžk´^¾]a†x|ø¾2ªÉOÔw/>b‚papÚ¾l}@a¶>k²Wï“Í^¾aw‰ä8Ù­> Ê‹š>_r=t©yõ¾jæˆ)ŒÚ>l†©FI¾d +y[Ê>AÏX 9>YbbWÄö.¾iR_1.k>l÷är•¬V¾fZx’ÌÈ>OP"ó–dŽ>Rç+¹aÅ̾g^Le²ùË>m…RŒÒ÷¾h^Á[æw>V?_4Ì1ñ>H+à îw¾e Ìò&Dþ>l›ÛºÆxH¾j 7cñ>\’tsÑ™>4¢{B¯7¾bf8Š´†>kÇRÏ„'¾kX 9rñ¹>aB½£â÷4¾!“¸¡Œ‹¾^Þ§aU¹>j‚W²>å¾l9‰´in„>cý­Ž2Ö‘¾BâY]–\,¾XdŒ¿Öß>hÌèkÏFè¾l¨‚?å­>fl4:ûu¾Pš;ËÁ9¾QtHçIð>fª÷êdl×¾lŸÓRÐ>h€ùªÍBW¾WŒí’ÑØ&¾DQƒvÍë>d!Þ—O•‹¾l²Ê0Øq>j.ð3ÜÁS¾^'‘Òjáq¾$ú~„«>a8ø! ξkúÀð€t>kj¿à Ÿ¾b$†²ƒt‘>4 ߈E!>[õ‚Èz¾iŽl:Ùn‘>l*–óRï¾dç¾Ï—*>>IPNèo ‡>TænŘ²¾g•$²š>leÿ8ùX¾gMS £¡>T´·WP>JÅœÑ0¾e¿å\‰>lEšAξiEfAn>[>Ä Ü>61Pð¼¾b/”Ô¿3>k;LôÅ+ß¾jÂÈ9úŒ>`óRw¾#¸ # ±s¾]ÌIDpŸ_>iÑLƒËe¦¾k¸äÇF>cõº’á¾DýÖp3ϾVŽ°±²Ô >gÜôÂqŠ¾lCæ³ ¹>f”¤U7w$¾R_™Pí±3¾M‘“˜w>eaô +¾k랉Ñ1ï>h½åÿ©¾Yëy8@ëw¾:„‡=!e…>bkæO¨a¾kÉž4Á>j`@”[œ¾`z­)ùü\>Ò N]7W>^o²ª(¾i±›„ÐPÓ>ko‡FrT¾c§º³;¯>DCê”.>V‡îÙ •E¾g­([Pèm>kÞ”¼£6ó¾ffÖas£>R[~_¶!@>L×¾f E¾eˆ$Ù×>k¦ÿ„—a$¾h£õÞ¤ƒ>Z6Žy´(>7žZ ¾,¾aùq$Nî>jăc¾jLµÛÕ>`¾.”_Š4¾&#Œãª…¾\ÊqÛÛ%S>i6þ!ë&¾kQÜ í‹>cý¢»“ãù¾G¡KÞ'é¾TÚp}~Òß>gaXdw€¾k§Õd_M>fÀû¨‡/@¾T£·m+¾H¤O§{=y>d3^µmnA¾kE38 ˆ">hñeâç3ò¾\ÌE`©¾+4Õر|b>`Õó1êI¾j(곊ÖÔ>j{kŒ¼±°¾a²Ö“4Su>6µíž4ž>Y÷s–¡xý¾hT›6£|>kOIrØ›ˆ¾dèF¯Lú¬>MTGŒ|>Q~Ø]b0¾eϪàÇ)m>ka0¦œ)¾gDî5Òã>WMU!TÍn>@ï¼"ƒæ¾b§"òVuë>jªû×8ϾiŠ?Ÿý8Ó>_TÇøà•Ü¾ àÙçLw¾]Ü_Šdvò>i,E/´¶¾jËÖ 5>c? îﱉ¾D~Ùÿ…_ݾUyÝ<òê>fêT”Øñ{¾k@?LQÆ0>fEº¥·cl¾SašÙóǾHÂOV2à>cñfë[Xª¾jà³úyùm>h¢‚íPµ$¾[ú k/‹H¾&±åà:>`T@h,î¾i©r¿À>j=t§¾aà$–@Î >;r( T-Ç>XW|ªI¾g%àx+>kŸdÇö+¾e6Sj#{ >Pg‡<—‹v>NXÖ«…ƾdÈ_ûùv>jæð6n}“¾gßm, ßÑ>YwÁƒ8v>5Åuáz!.¾a=K²2¼%>iäB"b›Ð¾i¿dzbI¦>`ݨíê¤Ô¾2'™Œ´¿ø¾Z+uDïT>gý:„Wŵ¾jÀi2KàÆ>dqÄ«Ì„¾LÛ¸®Ì'¾¾På¸)þ>e<ÍDǾjÓm¾²O>gS’šï“§¾Wßžt&>B¾;ÛÈ,ÚmS>aµízobŠ¾ið+VJ>icÀ“d ¾`BŽs½¾­>*J?Äp>[Àr¤5ʾh“g+“>j‰X£ –ý¾dTvÎa!>Jö"ù(£^>Q—p’ø6¾eZ7ì'6>j²µF8‘Ó¾g Ò–,Ä€>W;“Ê” R>=¯¬H"üÛ¾aÆ‘Ýþ>i׳ˆ¾i3¢MFUÉ>`Þcßy3¾(Ì&WÏe¾Zùð^ÉìÙ>gú*¤ªT}¾je%æò‚>cï°eÊÕ¾K Ü.Ïë8¾QH÷±Ú>e&ŠÔr¾j‹5¤L>g½í)¾W2VµarcþS0Ù¾iëü,›Þ>i0¸É-¯¾`Q¦Í+­%>/ÁPϵS>>ZÍbªé¾gŸÇu< ]>jSúª ¾d5” |>MUòáþŠW>OñHS8¦¾dŸ:)y7£>jY÷ã¤H¾gCèûå©>XÎέO^Î>4Â:ö¼¾`·,¦ w>i=òì+ã¾iUOs—Â>`÷°À?r¾7ˆ`"è{Û¾X ü(—Þ>gì¨Þt†¾jK.““õ0>dÍ}6A½”¾PÃduEËi¾KKJßÍzD>c¾„áÜÿ3¾jHi¤Zö>g¹´«™Ëz¾Zó0rbÓ1¾$ ePÞ¼>_ú{Êݾh«H ›Œ>i“5]³ü¾aúOø+>A£QÆP>U9ÞÀ²«¾f[ó>Ô>j<ÊRs¸¾e©Xï´%Ö>SÌã»õ?>DƒAb)ǾbvèðÖ>i§m碱,¾hTí¶”1>]ãmQ\°¾ŠpŸF!¾[Ô†«»>ü>gÒ2©g×¾iÔí%2 ‘>cJÈ+$5¾Iwí†Êú¾QN2_žž>dÌÂ]ôz¾jWÝ_xT>f³DÌŒ™¾W­ßWÐ !¾7h¢Ù§¡L>`·q÷®¾hù;óÜ=®>hûŽBZ¾`½Úɱ0X>7Þ\Ìyf©>W–« ^ž¾f˜ÁnR å>iü]Â{ ¾dÎvGÖ¨T>QŒ W;‡k>H‘q°÷4;cLNd >i¢4c8Ǿg̘J‘t>\D?_GÒ=ö§îõ‘SŽ¾\Ö¿­8>gèÜ'Llÿ¾iˆ|&À%>bÃp°PÂî¾GTäï#ZþR¯ù g">dàR[:c;¾iâ«nfB©>fe ü2tå¾W^Å”Ý[¾8„2ÜS€m>`«úgh™N¾hÍ¿}wô>>h̶ëO ¾`«2¿¸ló>8¨jÔYv•>Wzt A¾fPÁæãI†>iÐuÖ»œ±¾dÜõÈ‹.4>R-¶sêH>F™ªQÓ;¾bˆ_¢4€>iYEq±Œå¾gàD¯•r>]4Ù†ð5‚¾ÓŒý ¾[Jÿ×ÎÖ>ge/߃‹Ä¾i€§ñÛ*k>cI©lMì$¾K$bcòV~¾O¯Ô‹B›?>d ‘A «'¾i{j–(¹>f×ß÷«\ý¾YC–Z>¾*ý­”>^å.³V„<¾h,ª¿ ˆ>i¬9&ì¾a½n#K>B¿šõ_ýù>S©V1]è¾e:=Ï(>i«§ªQ¿~¾eÅ«Ÿ’l½>Uœhf(€>=M‘ T‚¾`ï$‡“ö>h³ÈÁ‡,è¾hsáJ7ºª>`EÛ{ãI¾6“™õ©pj¾W%)6¼8>f%ïü¾i“¿»ïn‡>d¸þ½½¼¾RRâàµ[T¾En?Ö¥ú¥>b"ŸVå6¾i ýÁ? >g×Qœ¤9.¾]ß ì]¿|>#R<£(ƒ>YÎEö–ȯ¾fÖE»Kº >icÛU1¾c¾ˆHØS>Nê]0‹žÛ>K9±pè¾c0gà}þ>i;%ë’³q¾g=ËP=H>[…ö¿“Ƭ=òÚQámý¹¾\§Ë\KF>gV¨þÙU7¾i(w>bà_!Vð¾Jz†•šU¾O«2ΆI¦>cÎ\áÕ¾iR'é\N„>f±Ç ¦¾YŽ ‰´¾#ÒUu¯Ü‘>]³˜ÙHÒ¾g¯¯ó€ë>hêj)^ ¶¾b&Y[Ö½>FBãZŽ?`>Q˜(Ø~¾dTíE¾ku>iWÿÅi•3¾f;˜åÕTö>XtÀÁ>0ˆ’<çgèØ<{P¾¾h²Ñ3YØ_>a–>ë‘^1¾CkŽ¾RØ\+}Nm>d®y½ê" ¾iS»)f¾ß>eáfcþC¾VåÙ̬“¾5t;•ôG>_»R¥)N;¾h 6Ç>h‡1:~¹Ë¾a41ífXa>A˜Ó Á‚>Sš,kÊþX¾dßMõ zÙ>iJY k×ü¾e§gÊÑÉ>V@¼ Dš”>7}üŒZEM¾`öPnò>hÔ¿9ä¾hktÛaÃÀ>aÄ>î.ã¾@ͺÞß•¾Sà#c~>dꊿ»¾i>çÁƒQ>eìñlú¾VÙ/a¨½¾7Ú)Q_ð>` Á5É€¾h"C6Vé>hadÃ)2@¾a%µŽž>A Jî<>S¬tI)ª¾dÏÿé&ö‹>i2ik k/¾e›¤áaNÆ>V_q{J—>6$‡ko'¾_®m¬å‹>gç ¸Be‹¾hhÖ,}§š>a5 l[hý¾BM!ªTc.¾Rý€’F¥>d/½#N¸¾i#ØN˜v>eÉsƒZѾW";JH<¾2Zù & )>^Ú£Ò•¾g±îUÑ•!>hˆ–€3k¾a–ÃüÝ×Ó>D–‘M~p>QÑc¶­ð¾d(6ö ±>iþÉ.‡¾I¿[ʼnֺ¾chvz m¥>rÆý–0ɾtn5.ýù>l öûf¾@ÐI‡ü±ò¾eBÀ¿Ä->s&Îrís¾t©Vìþ!>jKEiLÁª¾0=™£euœ¾fþ·3'h>su¢7l&½¾s¿oâ ü>h† PM7=ãOÖçµ¾hšL¤‰>s´‹eª…¾sX#†>°†>fÀU)Y>0ß_FÚL=¾jŠÚíÒ>sä }¢Åf¾rçüÈZ¤Ä>dû ßzÝ>@E6!¼IC¾ky݃èvY>t©´êÛ ¾rp)ãô™«>c9xçÉÇo>GÈÄœìBÞ¾l½¦yDIW>tÈ0 ôr¾qò{Öœ»>a}qÿ­ÛÅ>NøÈäM`µ¾må¼,H1">t%*ÕܾqníGõf>_z1w!>Rê0í u7¾nòã¤|ô+>t#r6Ö¡O¾pç•D^W>\7:‚–äw>V,aú<  ¾oæaÛv±>tå7ͫ׾p][b…ò>XòXTeÃÀ>YC0°à8å¾p`Wà#_i>tŽ–ÂXH¾o¢?¶™Kñ>UÃO[0ž>\/!®Fu¾pÁøÕã*H>sç)¤€ Ó¾n‡fÞ!¯V>R¬­ÃÈ3>^ï–b³%˜¾qiH‹$3>sóBÅɾmlPMl–[>OaMÜ´E>`ÂÉúypª¾qdˆ9(Í>sš[ÂW3¾lRZFg8>IŸ·èŸ×B>aùŠ²Ê¾q¦àºZù—>sk—ÒRî¾k:‚Fc>DóÈãAÆ>cÏeÛ¾qßýËQ />s8gD°CC¾j'O¾A°>=™ÐÆ+ü>d(âéϾr¿ù]k>s¯Úos°¾iý‰»S>3|Ú‡£±w>e#,*h·*¾r9®¶m*>rÇù+þ;¾h³ÊÀ©¤>#ºh”)'>f ÑÕ"žr[Pݱ¾0>rŒ4~5 ¾gÞKOah=ç¼ñA–®>fà]ˆiŒT¾rv{6n:>rN½þˆ!ê¾f-Á&¤¾Œi=x¨œ>g¤´“ÿѪ¾r‹«[…9!>reFl¢k¾e'2µý“%¾0¾ë¨ô>hX˜¯Ú¾r›Vúöx>qѸu©¾dAnÑaN¾7¢P»«tú>hûiªÕ]¾r¦CeÖc”>q“YÝ}Ù¾ce:}Ìf¢¾>©È:Œ>i›ÕÞÃ?¾r¬Ûi¯@ï>qU’Uœhf¾b“ùŒffù¾B±ô^7s$>jí%¤ª¾r¯‚£·ßO>qðÆ;¢#¾aÎ7ùIÁ`¾E°+Q^ƒ>jŒA2Ò@.¾r®èNE…%>pÝú—Ç5 ¾a%¤jå½¾H•ëPñ>jöt$8Òʾr«`;Åù>p¤Û•aùÒ¾`eä8TB ¾K+RÀ¬>kS¼oª›û¾r¥7åò9(>pnä“Xº¾_ˆW,‹Ï¾Mƒ{¨â½>k¤êDç6¾rœ²ßt>p9Ü‹|kA¾^^„ô`r¾O _ç®,Ð>kêÃáUK ¾r“ z&l«>pvus¾]LÀõueÀ¾PÁ@¦0½>l%fOÛ8¾r‡uLU–ì>o´Röö¾\Uµ# Ã ¾Q”~óÕ>lU…ù4ªs¾rzÈÑÁ_C>o^Šýk…¾[x°ŽrʾRK®é;Ëî>l{Î\–Å“¾rm(ÂòÙ/>o€™ )¾Zµgx+ ›¾Ræ§Ï— ÷>l˜8ë&8оr^²g¬@>nǸ²H ¾Z Ï’VÃo¾SeiÌRr%>l«[<¿¾rOÊDr2¡>n‡¥^Ó.¾Y~„<¾µF¾SÉ+íFÉ>lµºÜXp;¾r@~w ,>nO˜Àâ>¾Y /ãÈú¾TÝQ%MØ>l·2‡ëNÛ¾r0Óiÿ>n9É€Šw¾X°T-žÏº¾T?hз €>l°/qŽ¾r!#:ït>mõ„-=Ú¾Xp´[’w¯¾TRí|¿à>l¡!éJÔ¾r; ábº>mÔƒ·=ß\¾XJ¦tCƒ³¾TLC²Æ>l‰’¸!”€¾r2#»5>m»fûx0V¾X>Ô’“ ؾT+7 Ê_½>liö]§Ï¡¾qñ.ŠU>mªR¤q¾XLŸ:âµÀ¾SðÈÆ\ð>lByöD`ò¾qá¶$0>m ¿DN¾XsY-q]¾Sœ¸ÝŠ&Z>l¯+¥3¾qЫ®-{>mžµCú]Ö¾X³Ž`¥“¾S.¹¿W¡ý>kÚ¸2Ÿ$¾qÀ!s¾ÕJ>m¤1Þ7û¾Y {P.ËŽ¾R§­0%?>kš«Ë_ÿ‹¾q¯8!G¸>m°Š0¥¾Y}[š·:™¾R:î¹Úz>kQø(0Õ¾q°7‚ñ%>má›R˜‡¾Z—böò¾QLÿ]¼ >kžÕö™O¾q‹’ ý‹ñ>mÝOJãu¿¾Z§I„ŒM¾Pyͯî[×>j¦–Z^ ¾qxün§>müÀvä%¶¾[^…ȾOuÍÑ×>jC-²h¸¾qdSzæR¡>n!±Ìß㣾\,Š‹g;M »ê4íþ>iÖGï¶wK¾qNÏaÄ´>nKÑ ±]ɾ]Gh‰¾JÎùqðpá>i_À¿½¾q7¡èÃŒô>nz% ¾^™\s¾H]n“"ª9>hÞÍKjä¾q`b{‘D>n¬;Ó ¾_ƒhš¾E¸BJ Mv>hS<3Bƒ4¾qèÇ…®ï>náš­.*¾`Ýc@…¾Bá04]¸—>g¼Óz}êþpäÅPyÉ>o؃:¾`³í-÷¹F¾?¯'¤dˆv>g»yÇJ8¾pÃy„Îk>oR-5Ò¾¾aUËácxŸ¾95Ë [-(>fl´i‡+‘¾pžÏn=½ï>o‹ó®0š ¾aÿ«”óâ¾2ZJmo–>e²{Ü(Åm¾pvAó€nŽ>oÅKÙÿ&ö¾b°¬¡ˆ»¾&8;t[N>dë6€ß¾pIDõ$>oýVº;g•¾chzVh× ¾ ÙÃû“ßÀ>d¥IÃ&J¾p”H‡Œq>p›‰5˜¾d&HƒÆ> CëÔTÁ>c4Œò=è¾oÁ9T¶a>p2²¤‘郾dè^ògo¡>)½P¾äw>bD¢p+5¾oG:)Ê>pIp~Ú¾e®Î]÷€>5•xà¢ô¸>aE03ãǾnÁY¡û>p]Oi^§¾fxÕz©>> çê-h>`7œ"ßæ¾n. €4>pmqÚ™ó5¾gBþÀ;<†>Cÿ$”h3>^5pÑJ#Ѿm‹Åò', >pyB» ¾h‘È”¢ÿ>HÕ ¹ùÚÿ>[Üÿ­§–ȾlÚ*ÛN½/>p€%Qº9¾hÙQC±C¡>MÍûan>Yf]! ã¾l ]ç]>p(Üà ¾i¡ž„)¢Ó>Qs!:È‚m>VÏ—7ÂÁ"¾kD?`Ü>p{¥+Lƒ°¾jfS,Ïé0>T è™ûJ>T7G¥O¾j^Bˆ´•">pnë» D¾k%Ÿ?U <>V´.R"B >QFœ w'•¾ie¾=F>pZ³¢Øô¾kÝ•(D>YcÒq>L©%HeI[¾hW”‰d"ò>p<3fòº4¾lŒÄGŒã>\vÀar >FŠ´Îõ¾g5•ƒg9v>pÌ.î¶Ø¾m1½/n>^ÔB€††>@4û*èöé¾eþ?zÊ~g>oÅ¢΃–¾mÈGŠ)Ÿ>`Ç¢â!>3Rí–¡B¾d°åy/=>oK!eç)¾nP´›Øe&>b"{œÒ >e ÍŒõA¾cM°Œí>n¸Ädwèk¾nÇÿ5âd>cy㌞;áô¤f±¾aÓßΩc>n ³ŠÁáb¾o+¿Ü‡mô>dËS|~©¾6¯tE7¾`Cžgi>mE½Äå}Ö¾ozVJþ>f© ¥¨›¾B?¿¡Þk…¾]:¹³Ä\Ž>lbÎÚ%6Z¾o°c<¨>gS,Fò¾I‹Žaø«á¾Y§›µ~#>kbbÓo¾ȯ׎T0>hƒúeú¾Pu#º¾Vê|,¢ì>jC©,oÌEàƱ>i¤íï>$ؾT)2Ú¾RUï¡9>i ü~F¾o­FñÆïÀ>j²šxc¾W܈ôå¾LÈQb?ƒ>g¨Œv.êä¾om-_Ih³>kª/:V™¾[‰ŽÊUS¾DŸg· ^>f+h- Á¾o Eí™D¿>lˆÅä —T¾_+^w±A¾8pW¡zf>d–'àϨ¾n‚km‡†¡>mJÕ2ÀÑs¾a\ñ7:¾±¾Ó6÷. ÿ>bÐS¸A¾mÓ ×Zi>míZÊØê¾cܺ­Kp>$ÃHW}Wí>`óIž>%¾lü·ïî’º>nmWÉ4“¾dÂqÝ« ><9C2 £•>]ð 3 p¾kü(Æ¡×g>nÇ@â%z¸¾fX¢«†p>GÚ¬°ò>YÀ5½Äð¾jжT8>nø3‘>QQ¾gÖÄšR`*>PM*LŽÂ>UY>oQ„¾iz E–‘>nýhKWÎœ¾i8{ œ_>T‘ÐÉV>PÀ‚ÐrF¾g÷¬ö¥Æø>nÓµM¿ñ+¾jyKvû‘¤>YÖËÔ£¢>Gõ/A± ¾fIz3/ùÐ>nx¾Ñ½•¾k•B{þB²>]^«ãMqm><8Û,_Ç·¾dpk3¬ÎÆ>mêk§{æʾl‡Ô o›s>`Í ù×G¨> |NDBé¾bmf Lýç>m&oï 0$¾mLƒôd/>bÕ–Ac}¾(ú8gñb³¾`Aà®CÑš>l+w²A†©¾m߀ðó±>dü/óvʾ@ž O0†s¾[àñª:‚>jø¦{ðô¾n<—NÒF >f‘ˆš½n¾K8Jµ´’¾V÷»tL6>iÙÒðø¾n_×ÊÔª>h9t'z…¾R¬[€Ð^D¾QÎÓI„Sæ>gé&fÎ1¾nF0#™L>iµåé_ѾWÂÁ ÀT¾HÞ½4Ð<>f ³UÅ8A¾mìr³6ÉP>k¼ÛÐn¾\·tþ°¢¾;‹'QmªÞ>cûêÝ‹ŸŠ¾mOðÓ|ÆD>l{~õ"¾`¾»ëxU‰¾>9¼e”£>a¶B$]á4¾lo!g¸§T>lë׿|SѾcè„ç>2@; y>^€ ºnÓ¾kHŸpæ\>mE’®­¾e!:Bá\>D·4{6^¨>Y9­JÉà~¾iÛÏÃ9iô>mÐ/®IXN¾g¡+6>P ÌðO>S£ŠÅÎKľh)}!Sú\>mÔ„šÁNj¾hÍî6Á&m>UÌ_š Úk>K“AÀÿÕ¾f2ßLìt>mŠL'T±¾jM>ƒiòµ>[Oâ¦ê†“>>â—˜0cÕ¾cú2Ã¥>lîà³%‚K¾k‰6øebO>`Lv"¼)>šÓ„Š7¾aƒSa­~>lcàY}¾lzà “ù>bÊE‚a˜¾393EN½ã¾]¥v6–öz>j½à:5¾mʶOE|>e›eŒ;¾FBñ¦¾WÜ#ŒÚšR>i'he€_þ¾mf¾¿ :Ò>g+¬†£p®¾Qc…sA¾Q¹u­>g>¹!‘¾mVÑÞ»Wd>hüžº0‚z¾W€¯dƾFšÿD=N*>eCìÔp@¾lè  dm>jžk´^¾]a†x|ø¾2ªÉOÔw/>b‚papÚ¾l}@a¶>k²Wï“Í^¾aw‰ä8Ù­> Ê‹š>_r=t©yõ¾jæˆ)ŒÚ>l†©FI¾d +y[Ê>AÏX 9>YbbWÄö.¾iR_1.k>l÷är•¬V¾fZx’ÌÈ>OP"ó–dŽ>Rç+¹aÅ̾g^Le²ùË>m…RŒÒ÷¾h^Á[æw>V?_4Ì1ñ>H+à îw¾e Ìò&Dþ>l›ÛºÆxH¾j 7cñ>\’tsÑ™>4¢{B¯7¾bf8Š´†>kÇRÏ„'¾kX 9rñ¹>aB½£â÷4¾!“¸¡Œ‹¾^Þ§aU¹>j‚W²>å¾l9‰´in„>cý­Ž2Ö‘¾BâY]–\,¾XdŒ¿Öß>hÌèkÏFè¾l¨‚?å­>fl4:ûu¾Pš;ËÁ9¾QtHçIð>fª÷êdl×¾lŸÓRÐ>h€ùªÍBW¾WŒí’ÑØ&¾DQƒvÍë>d!Þ—O•‹¾l²Ê0Øq>j.ð3ÜÁS¾^'‘Òjáq¾$ú~„«>a8ø! ξkúÀð€t>kj¿à Ÿ¾b$†²ƒt‘>4 ߈E!>[õ‚Èz¾iŽl:Ùn‘>l*–óRï¾dç¾Ï—*>>IPNèo ‡>TænŘ²¾g•$²š>leÿ8ùX¾gMS £¡>T´·WP>JÅœÑ0¾e¿å\‰>lEšAξiEfAn>[>Ä Ü>61Pð¼¾b/”Ô¿3>k;LôÅ+ß¾jÂÈ9úŒ>`óRw¾#¸ # ±s¾]ÌIDpŸ_>iÑLƒËe¦¾k¸äÇF>cõº’á¾DýÖp3ϾVŽ°±²Ô >gÜôÂqŠ¾lCæ³ ¹>f”¤U7w$¾R_™Pí±3¾M‘“˜w>eaô +¾k랉Ñ1ï>h½åÿ©¾Yëy8@ëw¾:„‡=!e…>bkæO¨a¾kÉž4Á>j`@”[œ¾`z­)ùü\>Ò N]7W>^o²ª(¾i±›„ÐPÓ>ko‡FrT¾c§º³;¯>DCê”.>V‡îÙ •E¾g­([Pèm>kÞ”¼£6ó¾ffÖas£>R[~_¶!@>L×¾f E¾eˆ$Ù×>k¦ÿ„—a$¾h£õÞ¤ƒ>Z6Žy´(>7žZ ¾,¾aùq$Nî>jăc¾jLµÛÕ>`¾.”_Š4¾&#Œãª…¾\ÊqÛÛ%S>i6þ!ë&¾kQÜ í‹>cý¢»“ãù¾G¡KÞ'é¾TÚp}~Òß>gaXdw€¾k§Õd_M>fÀû¨‡/@¾T£·m+¾H¤O§{=y>d3^µmnA¾kE38 ˆ">hñeâç3ò¾\ÌE`©¾+4Õر|b>`Õó1êI¾j(곊ÖÔ>j{kŒ¼±°¾a²Ö“4Su>6µíž4ž>Y÷s–¡xý¾hT›6£|>kOIrØ›ˆ¾dèF¯Lú¬>MTGŒ|>Q~Ø]b0¾eϪàÇ)m>ka0¦œ)¾gDî5Òã>WMU!TÍn>@ï¼"ƒæ¾b§"òVuë>jªû×8ϾiŠ?Ÿý8Ó>_TÇøà•Ü¾ àÙçLw¾]Ü_Šdvò>i,E/´¶¾jËÖ 5>c? îﱉ¾D~Ùÿ…_ݾUyÝ<òê>fêT”Øñ{¾k@?LQÆ0>fEº¥·cl¾SašÙóǾHÂOV2à>cñfë[Xª¾jà³úyùm>h¢‚íPµ$¾[ú k/‹H¾&±åà:>`T@h,î¾i©r¿À>j=t§¾aà$–@Î >;r( T-Ç>XW|ªI¾g%àx+>kŸdÇö+¾e6Sj#{ >Pg‡<—‹v>NXÖ«…ƾdÈ_ûùv>jæð6n}“¾gßm, ßÑ>YwÁƒ8v>5Åuáz!.¾a=K²2¼%>iäB"b›Ð¾i¿dzbI¦>`ݨíê¤Ô¾2'™Œ´¿ø¾Z+uDïT>gý:„Wŵ¾jÀi2KàÆ>dqÄ«Ì„¾LÛ¸®Ì'¾¾På¸)þ>e<ÍDǾjÓm¾²O>gS’šï“§¾Wßžt&>B¾;ÛÈ,ÚmS>aµízobŠ¾ið+VJ>icÀ“d ¾`BŽs½¾­>*J?Äp>[Àr¤5ʾh“g+“>j‰X£ –ý¾dTvÎa!>Jö"ù(£^>Q—p’ø6¾eZ7ì'6>j²µF8‘Ó¾g Ò–,Ä€>W;“Ê” R>=¯¬H"üÛ¾aÆ‘Ýþ>i׳ˆ¾i3¢MFUÉ>`Þcßy3¾(Ì&WÏe¾Zùð^ÉìÙ>gú*¤ªT}¾je%æò‚>cï°eÊÕ¾K Ü.Ïë8¾QH÷±Ú>e&ŠÔr¾j‹5¤L>g½í)¾W2VµarcþS0Ù¾iëü,›Þ>i0¸É-¯¾`Q¦Í+­%>/ÁPϵS>>ZÍbªé¾gŸÇu< ]>jSúª ¾d5” |>MUòáþŠW>OñHS8¦¾dŸ:)y7£>jY÷ã¤H¾gCèûå©>XÎέO^Î>4Â:ö¼¾`·,¦ w>i=òì+ã¾iUOs—Â>`÷°À?r¾7ˆ`"è{Û¾X ü(—Þ>gì¨Þt†¾jK.““õ0>dÍ}6A½”¾PÃduEËi¾KKJßÍzD>c¾„áÜÿ3¾jHi¤Zö>g¹´«™Ëz¾Zó0rbÓ1¾$ ePÞ¼>_ú{Êݾh«H ›Œ>i“5]³ü¾aúOø+>A£QÆP>U9ÞÀ²«¾f[ó>Ô>j<ÊRs¸¾e©Xï´%Ö>SÌã»õ?>DƒAb)ǾbvèðÖ>i§m碱,¾hTí¶”1>]ãmQ\°¾ŠpŸF!¾[Ô†«»>ü>gÒ2©g×¾iÔí%2 ‘>cJÈ+$5¾Iwí†Êú¾QN2_žž>dÌÂ]ôz¾jWÝ_xT>f³DÌŒ™¾W­ßWÐ !¾7h¢Ù§¡L>`·q÷®¾hù;óÜ=®>hûŽBZ¾`½Úɱ0X>7Þ\Ìyf©>W–« ^ž¾f˜ÁnR å>iü]Â{ ¾dÎvGÖ¨T>QŒ W;‡k>H‘q°÷4;cLNd >i¢4c8Ǿg̘J‘t>\D?_GÒ=ö§îõ‘SŽ¾\Ö¿­8>gèÜ'Llÿ¾iˆ|&À%>bÃp°PÂî¾GTäï#ZþR¯ù g">dàR[:c;¾iâ«nfB©>fe ü2tå¾W^Å”Ý[¾8„2ÜS€m>`«úgh™N¾hÍ¿}wô>>h̶ëO ¾`«2¿¸ló>8¨jÔYv•>Wzt A¾fPÁæãI†>iÐuÖ»œ±¾dÜõÈ‹.4>R-¶sêH>F™ªQÓ;¾bˆ_¢4€>iYEq±Œå¾gàD¯•r>]4Ù†ð5‚¾ÓŒý ¾[Jÿ×ÎÖ>ge/߃‹Ä¾i€§ñÛ*k>cI©lMì$¾K$bcòV~¾O¯Ô‹B›?>d ‘A «'¾i{j–(¹>f×ß÷«\ý¾YC–Z>¾*ý­”>^å.³V„<¾h,ª¿ ˆ>i¬9&ì¾a½n#K>B¿šõ_ýù>S©V1]è¾e:=Ï(>i«§ªQ¿~¾eÅ«Ÿ’l½>Uœhf(€>=M‘ T‚¾`ï$‡“ö>h³ÈÁ‡,è¾hsáJ7ºª>`EÛ{ãI¾6“™õ©pj¾W%)6¼8>f%ïü¾i“¿»ïn‡>d¸þ½½¼¾RRâàµ[T¾En?Ö¥ú¥>b"ŸVå6¾i ýÁ? >g×Qœ¤9.¾]ß ì]¿|>#R<£(ƒ>YÎEö–ȯ¾fÖE»Kº >icÛU1¾c¾ˆHØS>Nê]0‹žÛ>K9±pè¾c0gà}þ>i;%ë’³q¾g=ËP=H>[…ö¿“Ƭ=òÚQámý¹¾\§Ë\KF>gV¨þÙU7¾i(w>bà_!Vð¾Jz†•šU¾O«2ΆI¦>cÎ\áÕ¾iR'é\N„>f±Ç ¦¾YŽ ‰´¾#ÒUu¯Ü‘>]³˜ÙHÒ¾g¯¯ó€ë>hêj)^ ¶¾b&Y[Ö½>FBãZŽ?`>Q˜(Ø~¾dTíE¾ku>iWÿÅi•3¾f;˜åÕTö>XtÀÁ>0ˆ’<çgèØ<{P¾¾h²Ñ3YØ_>a–>ë‘^1¾CkŽ¾RØ\+}Nm>d®y½ê" ¾iS»)f¾ß>eáfcþC¾VåÙ̬“¾5t;•ôG>_»R¥)N;¾h 6Ç>h‡1:~¹Ë¾a41ífXa>A˜Ó Á‚>Sš,kÊþX¾dßMõ zÙ>iJY k×ü¾e§gÊÑÉ>V@¼ Dš”>7}üŒZEM¾`öPnò>hÔ¿9ä¾hktÛaÃÀ>aÄ>î.ã¾@ͺÞß•¾Sà#c~>dꊿ»¾i>çÁƒQ>eìñlú¾VÙ/a¨½¾7Ú)Q_ð>` Á5É€¾h"C6Vé>hadÃ)2@¾a%µŽž>A Jî<>S¬tI)ª¾dÏÿé&ö‹>i2ik k/¾e›¤áaNÆ>V_q{J—>6$‡ko'¾_®m¬å‹>gç ¸Be‹¾hhÖ,}§š>a5 l[hý¾BM!ªTc.¾Rý€’F¥>d/½#N¸¾i#ØN˜v>eÉsƒZѾW";JH<¾2Zù & )>^Ú£Ò•¾g±îUÑ•!>hˆ–€3k¾a–ÃüÝ×Ó>D–‘M~p>QÑc¶­ð¾d(6ö ±>iþÉ.‡¾f„§Fq>XXù:X >(ø°"ª¾]™@R±þ>gbìØW ¾h¡K{dhh>b%ƒ¹m‰¾Gá«œ9“'¾P$·#5"b>c“ë`P{¾hñ‘3ÇÐå>f}ùy16Ÿ¾YþKgÏþ±¾Ÿ ÆR>[ã0¥€)·¾fôOïº>>hÇÐÀ81@¾bÛ* ­Ï7>L'Nè„ÿv>KæVݨ9¸¾bÍÆ8s->hÁ ÎÂ˾føíú,¹î>\ ȶ·”¾4ÌÈR¾Y¯›§ ©?>f^t› ¤¾hê¦côöô>c²IC؇–¾P®A·Í¾Fp¸ Z>aÎùÈòp¾huQl|»3>g~6†´À¾^oœ8«.‡>1±Òøê§>Vô$d›Ð¾e˜$K½hk>hÿ Xe¾d¡Œ^£%>S¸èGÐ>?Áצùøľ`æ¸õ]>hÙ3{z¾h\ ð>`ºäÉ(¾?Ùÿ×¾S¨N½¦¤ï>d–ÑÓ¹Ö¾h÷÷ðJ]s>eo>Ù­è¾W$†ô#Fؾ0fw ³<>^Îjé:¬¾g\Ç­q®P>hwcc™%¾bJÉ4i>GòÈwÇ5Ä>O„È]Xž1¾cO+`}œÔ>hÆFXòñ¾f—£:Ùý>ZáoµÐD½ò«nw–Ïq¾Za0r<˜>ftºXGÎ&¾hÌËç—†M>c€ÿ‘Àæ¾Ph =…]í¾FzºkØG:>aµ«SÖoí¾hYä’ÈÝ>g~ŘÍо^ÖXóŸÊC>4ÖF*¾Q>VA0d³¢¾e;ŽNÁE½>hï„#é{¾dû}·Mv“>U.eIä3ð>8a¯G5Ǿ¾_~çf“>gƦò² ¾h>v˜>aq=¡*…¾E227•¾PíÁFAX«>c¢ff‘«¾hÊWINõù>f\ŽMHOò¾Z0|™9½örDkvY>ZÆ…Pžv¾f˜ò) ^>h¿dúns¾cnbü"@>P^Óž1>FhF{ øÕ¾g‹kö–9>_FC[c’¾7»«²ÃH#¾U5Â# [>dñ»{T­¾hçÏÑàî>eI[úÕ ¾VbyqŽm¾2n­ÈØŒ·>^1Þ\Æ/¾gL¹ÂÔŒÑ>hk¸W…¾b£ìaü1>IK¶ f>M’»Ë †u¾bÝGÒûÛ)>hœ?éž3¶¾fäBä8ø>\wLvTSŠ¾$1âCõ‰,¾X-‘8>eÆÀšì1¾hÞ\š=v >dn¼{[^¾S ÙÓàNC¾>,[ËJC™>`6ú%ýÜu¾gÁ¶¥m>hí¹Ð±¾a/Ûa4¸ò>DHÀXÓ–V>Q%íß9ɾc¡!s…·>h«ð9颾fl1ÀÀê>Z¥Y#{‹1½ú³ªÍœð¾Yï,"~‚X>f<ii×¾hξË=>cè0…Ÿ )¾R YQÎ"°¾BTlæ¸1>`Í'¿€”¾gøi˜®3>gî’XŸ¾`³Ø‡ãI>AÓ£‚ƒf>R@«¡z‚`¾c÷ñŽ¨¿Z>hÑ6^~Œ¾f8g– æ©>YëOWx¨=÷Á¯`N}¾ZŒDƒa\ã>fbQŸàm¾hÊöÉ>cÅž²éM¾Q¬£C‚¾Böâ9A·)>`æ{¬+>¾hY ^®Ž>gïñ…ΰ¾`µÉ Céý>Aú˜Æ‚>RÏý›%†¾cé«R¬&>hÑà8¯ ´¾fR`]¢>ZUAŸõ0˜½æâ:à¾Z Ös/E8>f>½HÒ%`¾hØIë€ä>d óè¦ ¾RX ‹¥¾@ûqšöu>`‚XcéH°¾gÜï•j!w>hjVÐ@š¾a6¸ý‡þ>DÃÀRæØ>P¾ÕÂ!hÁþáø…¾f·|ýôëŠ>[á/æóï¾ yôÂ"e“¾X_óÚh‚>eÊ_åàV ¾hðéXvçj>d´Ö6L–•¾T¯g{cVø¾8§PóM>_0YLXx¾g~üŒÙî>hsűLúÖ¾b.ÆT’o>J*‡*È·c>L ¦Ä*pë¾b‡­IÈÞ¿>hSÔ>ì¾gXÚ–†Ý>^|¶¯°(J¾50BÚ''¾Utš5h>dñ–3ˆC<¾hýÞÓØ›~>e®~UN§‰¾WúÖ(B£B¾#¯&³Z \>\-ÎJüñj¾fÎËëW>hÒ)?©z¾cŠªôà­…>Q T[ >D–ñâ˾aºªqü¼>hܨHªq¾h¦ºÀÊÜ>aëbë¾C½3w\K¾Q*ˆ†¡w>c– ^×壾hÛ$shÄ>fÙL:ÍM&¾\OT±7 >%Ù˜Äû>WÏ í˜ˆO¾e¦ BÖÙc>i"&Õ¾e)ew`ÀY>V&Æ ù_õ>1õâöJ…¾]Ó8ëD´>g:ü†Ó|¾hÆ1Ï_%+>cAË^|¾Oe@íç⌾F¾,L7%–>aí¥ò¯º¾hU[mJT>hÍ¡êܾ`·©H©:>B1Êr§±_>Qâõׯ¾cÖ!:(¥>h÷Ú9“¾fÙ,9x>\/Ò¢'P ¾#ïð+DP¾Wîn ¶ü>eµdYû¢Á¾i(wGÇýu>eP°ú©ØŽ¾V–ù7½V¾/üâ×>ïö>]oÌõû¾g->à’£>hîu¾cyu öMà>PÄá&¶>D†Òxr V¾a*ÿžWPƒ>h?MáÎaa³€b4 ¾E­îÄø?”¾P7c)ì„Ù>cM /)ÿؾhÇ.>ga4Š‚ݾ^.ïHy ’>3¤…/k>UÈ?R,€Þ¾eVå@>i@½ §Ü½¾f#8y_]>YPb²Ìå> ª•²è½¾Zèš"Žï*>f•§¤>À©¾i;ÔÝ~×>d¤UŽ!ä_¾TAŽ³B~¾:\C¤ëH×>_— WRí¾g½”–»>hçÑ«Åp¾bð1Ëai>N0^Ì3Õ>HIì¨T½¾aØØ”ƒõ>h–)f‘Ñê¾hL¤cS0>a]û9Õ¾CÕ'³u„¾Q$™¢,Ç>c¨žä¡ ’¾i#¸Ô 6ë>gsN‡ãpm¾^%hO]¢>3*F¤XCw>Uð h«ž–¾e6’\…‰ÿ>ikQ¾ 8¾fdNpYI'>Yû(– ø=ìúyk¾Z]ÒŠGb3>fƒªÂ¶J¾is~Û•±>e(»nòðô¾U¶­„äÅU¾4@¶ê²:>^iݬ­äQ¾g’½{3Œ>iBó¸ ;¾cȽ6J^>QgQƹײ>Cf18½·¾a£ßØ×>hf¸Eß !¾hÞmx`>bLÁpq™¾J84Ÿ{4¾L15SÎ7>bªWPèú¾i1»”#>hN&˜×W¾`¼¾‹˜{>AÁ4D*éL>R:“ç È ¾dT˜>in´á‚ª«¾g™{É“*>^;¸Öóù¾3<Äoo¾V R»•ç>e[%‘!±¾i¬X §>fÅ€ s ¾ZðESZ¼>J¹³÷R>Y¥¹qùèA¾foýjmÖ>iÀȃd÷ó¾eÙ–&[àê>W¢”QH#`>(†¶þ«T¾\ìÒ—§>gXP®¦žß¾i²X˜.†>dÛFzT‚þT[3ˆ©)¾:Ó“iÉ‹<>_è†~ Õô¾hJ]íô™>i…{ºþeö¾cÐGþ÷'>Q#xf¶>DJ7&¾aN—Û^>ø>h¸À"O‡¨¾i?“‘b>„>b½\šL˜¾LÞ0GÅ÷¾J¿8}æ?>b†V:vÀæ¾i6þ8lþ>>håC¼þ¾a¦æ«øÏ™>EýÈ¿m>Pbî´4ã¾cCVŽÕ>i™âKꉾhzâ鱧>`‘¥Âi ¾@:œºë`(¾S,¹è†¹ >d•[’Xd¯¾iâMÚÚï’>hþ|y‡r¾_ DÁ>5‰çj]hx>U¾öÉ@Á¾epØ1$Eý>j´¾—¾g‡Ç|ëEx>\ðÆ×þèà¾&‡ÿ¬T85¾XlToP>f2SÛ»#¾j9lÀ¼¹Ø>gïĉò¾Zõ`1z(=ûŒìOSF>Z?­Æ®ãõ¾fÛ=7qQÌ>jN) £¬¾f…g½ê>YÐo>³›gnÝúøí¾jW½ZôÚ>f$ô§Qg¾WQuÔAµà¾.–œî·Ë`>]ð9× ùŸ¾gï4?Œ* >jYm®d`é¾eŒÆ9ÛÍ•>U±˜À% ª>6ªA‡n¯¾_Žm÷x>h^lö¢*²¾jUœô¦1>ei³«¹¾T7g›x¨¡¾=D󫪹Ÿ>`pJV˜ów¾h¾›âñÈ >jOýœd¹¾d³´ö0'm>Rå_lÖ>AŽqZ6N¾a ü^ñ>iŸ·z÷¾jG¶c§[>dXòJê@¾Q¾0¹3)F¾DjeÅ“§>a¬>[% ¾iY1G”®ó>jAÇtnQ¾d ^©tÊ)>PÃW9Š>F>šïi¾b_p- >i–ÆÔ·¢%¾j>¤b?Û©>cˇҬ¿‘¾Oí?XÅ=¾H ¢ëwÕ>b`„nƒ?x¾i˦ ‚Z>j@ ‰D†¾c-ÕêQ>N²Ëû3Sâ>Id˜´°X„¾b¬É®MÄ>iø͇ßf±¾jFÎÀ1B~>cîã=&o¾MÙÊ4^f£¾JbÞÒKUå>båÊK^Ѿj¦7š>jT%?N ¾ctöf>Md?oŸ:>Jþ! Èܾc ü8 ¡—>j>µK‘–l¾jhWmqßâ>c|yÊîÇv¾MTp¸š¤¾K4" ázP>c “±$$¾jX"6¶ê«>j„ :«ë¾c—?ç'J>Mª¡å0ø >KÞ“fÄB¾c"ò¸ É>jk+].qɾj§&½2>cŤô. ¾Nij½(©Ò¾Jmb›“£>cFZ­9¯¾jwq|³Ì}>jÑG¨¡¾dgH«š?>O‘\¾šã >Ilëµ8d‘¾bîA‚Œ!´>j|=:Òú¾køÍßØ>dZŒ:»?Z¾P‘¥Zús ¾GÿÆO”Àü>bµ^Ñù¢¾jx“þ\H×>k8°¤ƒÿ˾dÁqÿÀ{˜>Q¼ñ„>F$‘…À¾bg˜ªŸ£>jk·…ËȾksÊ/”Å>e:¥•¤¾RÂöï‡æľC×[wF>b~’´Úî¾jR9w#4Î>k²Ô;eãóåÇu>T*ñR›]U>A–>×]ò¾a…"]rû\>j+ð†UJ³¾kñ{fgª±>f\¤†;¾UÇ 3ô¼¾;·~6 6>`ípS,Ûe¾iöWYߦ>l/ñï~:&¾gÁ& ø4>W–i'n>4P±(x¾`9éäa›ß>i­Ü 4«¾ljŒJXc™>g¶˜'¿u¾Y–s¸i8¾'Ú›YäùV>^ÐqêãMR¾iPŸžÐv>lž“Î ™¾hs1íÝ>[ÅÊk³¯>p:è–¾\íbG³‚,>hÛ)~¾lÈBùò>i6 @†«¾^!Ç–‡>I˜¢iâ¶>ZÅÒ/´ù¾hJ!"N¸:>läEøJ¶¾iümk—óæ>`R*¿;„¹¾31+T¼ÆL¾XV’‰à÷>g™ñ8âYÁ¾lígž tv>jÁû141¾a¥M:¸H‚>?™` p>U›ãß)¢¾fÆé§A >lßñc7 ¾k‚¥ØxR>cÚÖ/”‚¾Foµ¤Aè¾RÎR>eÍ?ëôf3¾l¶U%/>l9 ‹Lœ™¾ds!}Y«>MÅúËo>Ni¢aÈq¾d©3hË>lkÕ¹¾lßêäbÚT>eå¬LGnÙ¾R‹„”#'ò¾G ¦Ã°ñä>cW¢^.¾kùªô“dã>mpº;Go¾gYK;“¥~>VdÛ„;º>>Ss¥„D¾aÓƒâ•Î>k[3– 2¾må¿‹K>hÇîü»o’¾Z @ŸãS¾)]Ê[v»Ÿ>`g·»8D¾j‰óKÃ->n5HQ9&(¾j*¶—Ñz‹>^ޅܧªø¾°íÂV®¾\Xˆ²Øó]>i€fh‘À<¾nYø„2ú½>kyÕ:ÔHc¾a˜M”õ” >9´5Ošg5>X“¦? ¾h8 ƒýª>nJ£Ü?˜ì¾l¬¤¯Ì´ê>cÄk¼·¦¾GG¬Œ3ko¾SE8s$ʆ>f­·Þð¾mÿGœ‰óæ>m¹ŸäÅ¢ž¾eëÌÒ¡ù>Qײ«V>Lî™+ª@¾dÚÄÉbX>mo†³áf¾n–‰Ĭ>>hߘݽd¾V³Ø·Š ¾@Ò;ÍM­ø>b¼ZåˆÄF¾l’"q¨h>o8n±µ'›¾jà wŠ>\oîbœ°>"ÐûÅ{…;¾`O›ñ¡¥Þ>k`*Jõ¨¦¾o“òó†N2>kØÝ]±««¾azP%K>0O“lXÐ>['} -¯…¾iÒ[9qË>ojÓ÷ñ¾m}‹BœÎ>cöý`´l¾E¤’xÊã¾UN×Ë­>gâ:dH凾oI@í žÊ>nàÁçu)þ¾f¾ æ®ÿ5>QÎo)i¬Ü>LËÿ/Mál¾e‹|Ô ô>nŒ9œ×j„¾oóŠÜݤ>ibêŠÐ¾XðlíBlS¾<²b‚.å>bËz˜…¾m[ø 9½H>pRƒn$Ä%¾kЧ\t§>` šåðõ¾ùo#_¾_A‘-æ]>k¯eNŽ0¾psXÔÍìõ>m÷&h­²š¾c–LIÈ„Â>AI•ð|]F>Xɽl‡¾iV 1>pTˆ\L¾o­B3´>fþæé¾Q €èb¼¾P7ߦÙ>fÇX¾oÝUö©9>pŽ+©²º¾j0LXæ7¼>Y‘é…Õ?P>>~á—d©¬¾c…5àõS>nw\ë^b²¾pøºª\ƒ>m:ô°©¾a µùhÂ>»²3Õ± >_w2M$øZ¾ll¤íÞíˆ>qSÒyˆ™¾orc¶ê>e-Ñ•gs¿¾FN³U±o ¾Vâá(Ÿz>i¶³\…ð¾pÝûšÚ>pÁù•§©¾ivwUÐ>U7Xû-ó>JÉàCÌ‚3¾fR±9º>pF<ÏÀ`¾qmÄ.h½>lª›·Œ)l¾^ë6ÈEN¾)U(-ˆ>bC’;šØ"¾n’QƒŸ¸a>q¼Ü·i)¾oÂt3¥¥>dME™›úd¾>ìB€yp¾[#‡Šð»>kÄÌVm÷¾q£»¸Fö>qȬuI¶¾hä¦÷¡æ·>Rññ»°‘Ö>PšlÈ h¾h! ä>>q¥È½m×¾qük駈>mÈ­Á¾^;¨ç e¾4f›gSì»>cªæì«2Ѿp œ/]ñÎ>ri•g&+ ¾pVûÍP&Ó>d¡ãŽ51}¾<~ŒÏ3ÂW¾\Þr.·>môÇ•¾rVñòk>qÄ{?¿ZK¾iÕ³ì2‘>SÃÉ—§Ü>QÐ>EÀY¾hïÔ>ã¥Ì>q·û“ßœ‰¾r¼rf¥”K>n…¡8/Ù™¾`8„÷¤]™¾0<úÜL >cÞÝÎl6¾pƒgÏI÷>s*C»û;*¾q=ºPçÏ>f^6Ðþþ³¾Ch·ãG¾[Ì©X­>mi°Í> ¾rü+êvŸ—>rÀ0„o†¾lL0‚eÝ>WÙËÔåah>L—F½|Šè¾hš¦›[•>r#ß¾;ÇÁ¾s¯Ë¸Èj>pŽX&ÖŽ¾bòG!Q¡Ø=úó÷ ®}ô>b©·'ò}¾p˜¥ŸwÝ>sô“Åms¾r˜]þGcQ>i¢ÏNM‹°¾OË!Glf¾Wj¸Ö{Æ’>l°öß•¾sz°7h>t¼Ž5¦¾o±%.A\ >_“ÕòO@>?g÷œ2D¾fÏÀoß>r4&L¾t½† ôñj>reÊ }¦\¾gi3(äï>AÁ ¤:ZŽ>_Zþ˜Õ$¾p®2Äå–>tŸ…É]딾tPùïsÕ>nt«…'m-¾Z#°[A¡¾MìʇßÄ>jbÏk7¾s™áL‰Põ>urAU¦¾rEç$yŸ>e™Gã(뉾(`k…ãf¾c É×Î>q¡þ?ª6ľu©k©2ó;>t¦ ™‚g¾m›f=Ê™>UÝD×h‚ä>TÏ#ÑÀ“>¾mpBÊšåº>tÛÖÅIõ¿¾v+ÂìÄiÊ>rRÌ~K6Ô¾d^!Ç»qñ¾Tö²¡>eÓü=ÖÿÕ¾rúì‹ž>v­OL ‰`¾u!·pÇæ>mSeØ>±¾Sý©Íh´¾YNw‚5Ñ>pÛo'ðÁ¾v ÊOìÏP>wf´¾r£¾+a¬ô>cÞCªE[à>2 ‘¶a«¾hzŒÒ¢>t,°Î´4P¾w¼õ• Aþ>u×rãº÷ý¾mÆåÀ\ݲ>QÍñ9á>>\WVŠ¯Þ¾qpÁD%ß>w/Ì‰æ ¾x§w×>sMÂl‘{¬¾d?Ÿÿ÷$¾74ôLJe>iŒõ…ÍG¾u?×€…>xåýd'z¾vÜ# \¶Z>oPnïG_¾R‰WT•qäǘ   ¾xTékEš²>y?T“Ä}ñ¾td0¢ÅM‡>eª )E™>4vîÇÄ9¾jcUøáŒå>v0—Àʻܾz0Ûú†Jº>x? ØKÊ6¾pÁo+&&>U„ò’í>>]BZÃe|`¾rrà«œ>yyšFPJ¾zÃ)í5×>uøÝ­S(¾hIñTOƾ êå„kŸ¢>jbb‡‰ ؾvø£f¦E>{ŸwÈpà¾z š)Šy>rå²âÆ©¾[$â»Òã¾Z‚ 0 ì>r©šžßø¾z•áÖB×Ä>|‘^ŸÑßP¾xÝéL8ñ>lQ ü"¾->¥“¡4ã¾iTE}:=v>w„3TîT¾}+AùU·7>|L±+ÄOò¾u ú,‹j>añøX¾¤×>TöNž$±¾rk%DIge>{–¬‚¯þƒ¾~¦TÚ]>ò>zÚ‰.lvó¾pûý‰Ùós>I‘<á·%>fêWQ3CÓ¾w²ù ‘W>~Âcíq'¬¾¤ª>xMf×$¾h+tº¿þ#¾GÎ5â—cB>qŠÆ’Z¢¾|ZY0¦8Ó>€y´`f¾~=­†L¥>t¾­qÐ,¾Zç…Zd¾b·0ÆI¹T>wScŸP‰B¾€!çö-\U>Œ¹¶È¾|hJx®>pKžQ8¾¾ˆ—Ñ|¾o‘šˆ¯¹R>|«ëì17¾­ ´É>#?P}µ¾y’çæå>f%íÀâ.>XMâé•|M¾v[J²‚>€¼Æýým¥¾‚Ê@ì–.>€µÇJÓï¾uÎq3Ã#>TÊïÒ ýß>i™þÓS¾|‚ÔÚˆ¨¢¾ƒuÊ9}>˜[Ënêß¾q1¹ÍÌe¾3¤…í›|º>sª˜Lðó¾P9œt‡>„˜ŽfìÃ=¾ƒ®ÅXÉ3>|Øhé¨L‰¾g›ü13Nܾ`<Åæ=²">z˜Ï|u⾃Æk@œt>†“«°˜U¾ƒyQ³€ŽX>y6ñÕ«¶ ¾VÏbÅó ´¾nÕƒ]+‘€>€ÆF%“ù¾†UñêrH`>‡‚կܾ‚×ËìO°Ô>t¼œœ ö>1Q·Ò)H¾wòu´B>„BBÞ~¾ˆ¸N=¡h»>‡à ÂêÓ¸¾Íh÷€>nÙŒŽtÎÚ>a|è_t¾2Vß->‡ÅŠ†Z,¾Šó@×t>ˆTàPŽ£È¾€Z#}>bƒ?Ë!>pÅÖIlO‘¾ƒä×°… µ>‹\G«PˆI¾=¿¬dl>ˆ€^–.ðŽ¾|ý9aàÇå>A7Á|î>yßÊ°ö¾ˆ…¢Ì{#ò>êg+8`¾"SP’…Ð>ˆhþ¹ð_¾xcÉÍŠ5¾X2íÜÙ·>‚ ÈÝn¾ Ïe\UT>‘“ž\è±ì¾Ÿ+…;»>ˆš*kz¾rÇ–¸@¾oM‚l\^E>‡ñÎ8Ù„×¾‘º¤‘þ>“ÚÔ]R£¾‘Äd'r€™>‡„Wï½7¾gÍÀÖ2^«¾{0ƒJ¢Uº>ŽýtZR£÷¾•3¶™œ:^>–‘´¬;ˆ¾“o#<À²>†½2 1}?¾JQ¹ž“ ¾„Ñ=üÁqN>“ì½à.Ⱦ™˜°s†Ñ‚>š?O& ¾”ÕžÉuÎk>…¶èÇ:V†>`7X¸Ì_ô¾Žl‹ÿ:>™á…úw9*¾Ÿ–òúÏCn>žÍœ–>߬¾—Eñ¡õ{>„V¸¹.~U>xMý3\üI¾–1ûìL÷>¡ZðzX˜L¾¤RÃB¸Ä¤>£ ¦ûU¾›%/Á–R´>‚@ÚÃ.ã$>‰I^ƒeñ¿¾ ìnÎëB>¨ëÁ å澬M1W25¿>©ÉWW㶾¡+6hîI>{áWdeçÉ>š’¦,ev¾­M¯Ù$G>´ÚéÆQª¾·kjÀ—>µ¢Åv–¾©åpEu¾bÉ:£Ôß>²q°òuß̾Ã9µQØÌ«>̤ª{šcV¾Ñp®JZk >ÐNLJ;ôÞ¾šZZhÆs¾ø…ßù>¾f„§Fq>XXù:X >(ø°"ª¾]™@R±þ>gbìØW ¾h¡K{dhh>b%ƒ¹m‰¾Gá«œ9“'¾P$·#5"b>c“ë`P{¾hñ‘3ÇÐå>f}ùy16Ÿ¾YþKgÏþ±¾Ÿ ÆR>[ã0¥€)·¾fôOïº>>hÇÐÀ81@¾bÛ* ­Ï7>L'Nè„ÿv>KæVݨ9¸¾bÍÆ8s->hÁ ÎÂ˾føíú,¹î>\ ȶ·”¾4ÌÈR¾Y¯›§ ©?>f^t› ¤¾hê¦côöô>c²IC؇–¾P®A·Í¾Fp¸ Z>aÎùÈòp¾huQl|»3>g~6†´À¾^oœ8«.‡>1±Òøê§>Vô$d›Ð¾e˜$K½hk>hÿ Xe¾d¡Œ^£%>S¸èGÐ>?Áצùøľ`æ¸õ]>hÙ3{z¾h\ ð>`ºäÉ(¾?Ùÿ×¾S¨N½¦¤ï>d–ÑÓ¹Ö¾h÷÷ðJ]s>eo>Ù­è¾W$†ô#Fؾ0fw ³<>^Îjé:¬¾g\Ç­q®P>hwcc™%¾bJÉ4i>GòÈwÇ5Ä>O„È]Xž1¾cO+`}œÔ>hÆFXòñ¾f—£:Ùý>ZáoµÐD½ò«nw–Ïq¾Za0r<˜>ftºXGÎ&¾hÌËç—†M>c€ÿ‘Àæ¾Ph =…]í¾FzºkØG:>aµ«SÖoí¾hYä’ÈÝ>g~ŘÍо^ÖXóŸÊC>4ÖF*¾Q>VA0d³¢¾e;ŽNÁE½>hï„#é{¾dû}·Mv“>U.eIä3ð>8a¯G5Ǿ¾_~çf“>gƦò² ¾h>v˜>aq=¡*…¾E227•¾PíÁFAX«>c¢ff‘«¾hÊWINõù>f\ŽMHOò¾Z0|™9½örDkvY>ZÆ…Pžv¾f˜ò) ^>h¿dúns¾cnbü"@>P^Óž1>FhF{ øÕ¾g‹kö–9>_FC[c’¾7»«²ÃH#¾U5Â# [>dñ»{T­¾hçÏÑàî>eI[úÕ ¾VbyqŽm¾2n­ÈØŒ·>^1Þ\Æ/¾gL¹ÂÔŒÑ>hk¸W…¾b£ìaü1>IK¶ f>M’»Ë †u¾bÝGÒûÛ)>hœ?éž3¶¾fäBä8ø>\wLvTSŠ¾$1âCõ‰,¾X-‘8>eÆÀšì1¾hÞ\š=v >dn¼{[^¾S ÙÓàNC¾>,[ËJC™>`6ú%ýÜu¾gÁ¶¥m>hí¹Ð±¾a/Ûa4¸ò>DHÀXÓ–V>Q%íß9ɾc¡!s…·>h«ð9颾fl1ÀÀê>Z¥Y#{‹1½ú³ªÍœð¾Yï,"~‚X>f<ii×¾hξË=>cè0…Ÿ )¾R YQÎ"°¾BTlæ¸1>`Í'¿€”¾gøi˜®3>gî’XŸ¾`³Ø‡ãI>AÓ£‚ƒf>R@«¡z‚`¾c÷ñŽ¨¿Z>hÑ6^~Œ¾f8g– æ©>YëOWx¨=÷Á¯`N}¾ZŒDƒa\ã>fbQŸàm¾hÊöÉ>cÅž²éM¾Q¬£C‚¾Böâ9A·)>`æ{¬+>¾hY ^®Ž>gïñ…ΰ¾`µÉ Céý>Aú˜Æ‚>RÏý›%†¾cé«R¬&>hÑà8¯ ´¾fR`]¢>ZUAŸõ0˜½æâ:à¾Z Ös/E8>f>½HÒ%`¾hØIë€ä>d óè¦ ¾RX ‹¥¾@ûqšöu>`‚XcéH°¾gÜï•j!w>hjVÐ@š¾a6¸ý‡þ>DÃÀRæØ>P¾ÕÂ!hÁþáø…¾f·|ýôëŠ>[á/æóï¾ yôÂ"e“¾X_óÚh‚>eÊ_åàV ¾hðéXvçj>d´Ö6L–•¾T¯g{cVø¾8§PóM>_0YLXx¾g~üŒÙî>hsűLúÖ¾b.ÆT’o>J*‡*È·c>L ¦Ä*pë¾b‡­IÈÞ¿>hSÔ>ì¾gXÚ–†Ý>^|¶¯°(J¾50BÚ''¾Utš5h>dñ–3ˆC<¾hýÞÓØ›~>e®~UN§‰¾WúÖ(B£B¾#¯&³Z \>\-ÎJüñj¾fÎËëW>hÒ)?©z¾cŠªôà­…>Q T[ >D–ñâ˾aºªqü¼>hܨHªq¾h¦ºÀÊÜ>aëbë¾C½3w\K¾Q*ˆ†¡w>c– ^×壾hÛ$shÄ>fÙL:ÍM&¾\OT±7 >%Ù˜Äû>WÏ í˜ˆO¾e¦ BÖÙc>i"&Õ¾e)ew`ÀY>V&Æ ù_õ>1õâöJ…¾]Ó8ëD´>g:ü†Ó|¾hÆ1Ï_%+>cAË^|¾Oe@íç⌾F¾,L7%–>aí¥ò¯º¾hU[mJT>hÍ¡êܾ`·©H©:>B1Êr§±_>Qâõׯ¾cÖ!:(¥>h÷Ú9“¾fÙ,9x>\/Ò¢'P ¾#ïð+DP¾Wîn ¶ü>eµdYû¢Á¾i(wGÇýu>eP°ú©ØŽ¾V–ù7½V¾/üâ×>ïö>]oÌõû¾g->à’£>hîu¾cyu öMà>PÄá&¶>D†Òxr V¾a*ÿžWPƒ>h?MáÎaa³€b4 ¾E­îÄø?”¾P7c)ì„Ù>cM /)ÿؾhÇ.>ga4Š‚ݾ^.ïHy ’>3¤…/k>UÈ?R,€Þ¾eVå@>i@½ §Ü½¾f#8y_]>YPb²Ìå> ª•²è½¾Zèš"Žï*>f•§¤>À©¾i;ÔÝ~×>d¤UŽ!ä_¾TAŽ³B~¾:\C¤ëH×>_— WRí¾g½”–»>hçÑ«Åp¾bð1Ëai>N0^Ì3Õ>HIì¨T½¾aØØ”ƒõ>h–)f‘Ñê¾hL¤cS0>a]û9Õ¾CÕ'³u„¾Q$™¢,Ç>c¨žä¡ ’¾i#¸Ô 6ë>gsN‡ãpm¾^%hO]¢>3*F¤XCw>Uð h«ž–¾e6’\…‰ÿ>ikQ¾ 8¾fdNpYI'>Yû(– ø=ìúyk¾Z]ÒŠGb3>fƒªÂ¶J¾is~Û•±>e(»nòðô¾U¶­„äÅU¾4@¶ê²:>^iݬ­äQ¾g’½{3Œ>iBó¸ ;¾cȽ6J^>QgQƹײ>Cf18½·¾a£ßØ×>hf¸Eß !¾hÞmx`>bLÁpq™¾J84Ÿ{4¾L15SÎ7>bªWPèú¾i1»”#>hN&˜×W¾`¼¾‹˜{>AÁ4D*éL>R:“ç È ¾dT˜>in´á‚ª«¾g™{É“*>^;¸Öóù¾3<Äoo¾V R»•ç>e[%‘!±¾i¬X §>fÅ€ s ¾ZðESZ¼>J¹³÷R>Y¥¹qùèA¾foýjmÖ>iÀȃd÷ó¾eÙ–&[àê>W¢”QH#`>(†¶þ«T¾\ìÒ—§>gXP®¦žß¾i²X˜.†>dÛFzT‚þT[3ˆ©)¾:Ó“iÉ‹<>_è†~ Õô¾hJ]íô™>i…{ºþeö¾cÐGþ÷'>Q#xf¶>DJ7&¾aN—Û^>ø>h¸À"O‡¨¾i?“‘b>„>b½\šL˜¾LÞ0GÅ÷¾J¿8}æ?>b†V:vÀæ¾i6þ8lþ>>håC¼þ¾a¦æ«øÏ™>EýÈ¿m>Pbî´4ã¾cCVŽÕ>i™âKꉾhzâ鱧>`‘¥Âi ¾@:œºë`(¾S,¹è†¹ >d•[’Xd¯¾iâMÚÚï’>hþ|y‡r¾_ DÁ>5‰çj]hx>U¾öÉ@Á¾epØ1$Eý>j´¾—¾g‡Ç|ëEx>\ðÆ×þèà¾&‡ÿ¬T85¾XlToP>f2SÛ»#¾j9lÀ¼¹Ø>gïĉò¾Zõ`1z(=ûŒìOSF>Z?­Æ®ãõ¾fÛ=7qQÌ>jN) £¬¾f…g½ê>YÐo>³›gnÝúøí¾jW½ZôÚ>f$ô§Qg¾WQuÔAµà¾.–œî·Ë`>]ð9× ùŸ¾gï4?Œ* >jYm®d`é¾eŒÆ9ÛÍ•>U±˜À% ª>6ªA‡n¯¾_Žm÷x>h^lö¢*²¾jUœô¦1>ei³«¹¾T7g›x¨¡¾=D󫪹Ÿ>`pJV˜ów¾h¾›âñÈ >jOýœd¹¾d³´ö0'm>Rå_lÖ>AŽqZ6N¾a ü^ñ>iŸ·z÷¾jG¶c§[>dXòJê@¾Q¾0¹3)F¾DjeÅ“§>a¬>[% ¾iY1G”®ó>jAÇtnQ¾d ^©tÊ)>PÃW9Š>F>šïi¾b_p- >i–ÆÔ·¢%¾j>¤b?Û©>cˇҬ¿‘¾Oí?XÅ=¾H ¢ëwÕ>b`„nƒ?x¾i˦ ‚Z>j@ ‰D†¾c-ÕêQ>N²Ëû3Sâ>Id˜´°X„¾b¬É®MÄ>iø͇ßf±¾jFÎÀ1B~>cîã=&o¾MÙÊ4^f£¾JbÞÒKUå>båÊK^Ѿj¦7š>jT%?N ¾ctöf>Md?oŸ:>Jþ! Èܾc ü8 ¡—>j>µK‘–l¾jhWmqßâ>c|yÊîÇv¾MTp¸š¤¾K4" ázP>c “±$$¾jX"6¶ê«>j„ :«ë¾c—?ç'J>Mª¡å0ø >KÞ“fÄB¾c"ò¸ É>jk+].qɾj§&½2>cŤô. ¾Nij½(©Ò¾Jmb›“£>cFZ­9¯¾jwq|³Ì}>jÑG¨¡¾dgH«š?>O‘\¾šã >Ilëµ8d‘¾bîA‚Œ!´>j|=:Òú¾køÍßØ>dZŒ:»?Z¾P‘¥Zús ¾GÿÆO”Àü>bµ^Ñù¢¾jx“þ\H×>k8°¤ƒÿ˾dÁqÿÀ{˜>Q¼ñ„>F$‘…À¾bg˜ªŸ£>jk·…ËȾksÊ/”Å>e:¥•¤¾RÂöï‡æľC×[wF>b~’´Úî¾jR9w#4Î>k²Ô;eãóåÇu>T*ñR›]U>A–>×]ò¾a…"]rû\>j+ð†UJ³¾kñ{fgª±>f\¤†;¾UÇ 3ô¼¾;·~6 6>`ípS,Ûe¾iöWYߦ>l/ñï~:&¾gÁ& ø4>W–i'n>4P±(x¾`9éäa›ß>i­Ü 4«¾ljŒJXc™>g¶˜'¿u¾Y–s¸i8¾'Ú›YäùV>^ÐqêãMR¾iPŸžÐv>lž“Î ™¾hs1íÝ>[ÅÊk³¯>p:è–¾\íbG³‚,>hÛ)~¾lÈBùò>i6 @†«¾^!Ç–‡>I˜¢iâ¶>ZÅÒ/´ù¾hJ!"N¸:>läEøJ¶¾iümk—óæ>`R*¿;„¹¾31+T¼ÆL¾XV’‰à÷>g™ñ8âYÁ¾lígž tv>jÁû141¾a¥M:¸H‚>?™` p>U›ãß)¢¾fÆé§A >lßñc7 ¾k‚¥ØxR>cÚÖ/”‚¾Foµ¤Aè¾RÎR>eÍ?ëôf3¾l¶U%/>l9 ‹Lœ™¾ds!}Y«>MÅúËo>Ni¢aÈq¾d©3hË>lkÕ¹¾lßêäbÚT>eå¬LGnÙ¾R‹„”#'ò¾G ¦Ã°ñä>cW¢^.¾kùªô“dã>mpº;Go¾gYK;“¥~>VdÛ„;º>>Ss¥„D¾aÓƒâ•Î>k[3– 2¾må¿‹K>hÇîü»o’¾Z @ŸãS¾)]Ê[v»Ÿ>`g·»8D¾j‰óKÃ->n5HQ9&(¾j*¶—Ñz‹>^ޅܧªø¾°íÂV®¾\Xˆ²Øó]>i€fh‘À<¾nYø„2ú½>kyÕ:ÔHc¾a˜M”õ” >9´5Ošg5>X“¦? ¾h8 ƒýª>nJ£Ü?˜ì¾l¬¤¯Ì´ê>cÄk¼·¦¾GG¬Œ3ko¾SE8s$ʆ>f­·Þð¾mÿGœ‰óæ>m¹ŸäÅ¢ž¾eëÌÒ¡ù>Qײ«V>Lî™+ª@¾dÚÄÉbX>mo†³áf¾n–‰Ĭ>>hߘݽd¾V³Ø·Š ¾@Ò;ÍM­ø>b¼ZåˆÄF¾l’"q¨h>o8n±µ'›¾jà wŠ>\oîbœ°>"ÐûÅ{…;¾`O›ñ¡¥Þ>k`*Jõ¨¦¾o“òó†N2>kØÝ]±««¾azP%K>0O“lXÐ>['} -¯…¾iÒ[9qË>ojÓ÷ñ¾m}‹BœÎ>cöý`´l¾E¤’xÊã¾UN×Ë­>gâ:dH凾oI@í žÊ>nàÁçu)þ¾f¾ æ®ÿ5>QÎo)i¬Ü>LËÿ/Mál¾e‹|Ô ô>nŒ9œ×j„¾oóŠÜݤ>ibêŠÐ¾XðlíBlS¾<²b‚.å>bËz˜…¾m[ø 9½H>pRƒn$Ä%¾kЧ\t§>` šåðõ¾ùo#_¾_A‘-æ]>k¯eNŽ0¾psXÔÍìõ>m÷&h­²š¾c–LIÈ„Â>AI•ð|]F>Xɽl‡¾iV 1>pTˆ\L¾o­B3´>fþæé¾Q €èb¼¾P7ߦÙ>fÇX¾oÝUö©9>pŽ+©²º¾j0LXæ7¼>Y‘é…Õ?P>>~á—d©¬¾c…5àõS>nw\ë^b²¾pøºª\ƒ>m:ô°©¾a µùhÂ>»²3Õ± >_w2M$øZ¾ll¤íÞíˆ>qSÒyˆ™¾orc¶ê>e-Ñ•gs¿¾FN³U±o ¾Vâá(Ÿz>i¶³\…ð¾pÝûšÚ>pÁù•§©¾ivwUÐ>U7Xû-ó>JÉàCÌ‚3¾fR±9º>pF<ÏÀ`¾qmÄ.h½>lª›·Œ)l¾^ë6ÈEN¾)U(-ˆ>bC’;šØ"¾n’QƒŸ¸a>q¼Ü·i)¾oÂt3¥¥>dME™›úd¾>ìB€yp¾[#‡Šð»>kÄÌVm÷¾q£»¸Fö>qȬuI¶¾hä¦÷¡æ·>Rññ»°‘Ö>PšlÈ h¾h! ä>>q¥È½m×¾qük駈>mÈ­Á¾^;¨ç e¾4f›gSì»>cªæì«2Ѿp œ/]ñÎ>ri•g&+ ¾pVûÍP&Ó>d¡ãŽ51}¾<~ŒÏ3ÂW¾\Þr.·>môÇ•¾rVñòk>qÄ{?¿ZK¾iÕ³ì2‘>SÃÉ—§Ü>QÐ>EÀY¾hïÔ>ã¥Ì>q·û“ßœ‰¾r¼rf¥”K>n…¡8/Ù™¾`8„÷¤]™¾0<úÜL >cÞÝÎl6¾pƒgÏI÷>s*C»û;*¾q=ºPçÏ>f^6Ðþþ³¾Ch·ãG¾[Ì©X­>mi°Í> ¾rü+êvŸ—>rÀ0„o†¾lL0‚eÝ>WÙËÔåah>L—F½|Šè¾hš¦›[•>r#ß¾;ÇÁ¾s¯Ë¸Èj>pŽX&ÖŽ¾bòG!Q¡Ø=úó÷ ®}ô>b©·'ò}¾p˜¥ŸwÝ>sô“Åms¾r˜]þGcQ>i¢ÏNM‹°¾OË!Glf¾Wj¸Ö{Æ’>l°öß•¾sz°7h>t¼Ž5¦¾o±%.A\ >_“ÕòO@>?g÷œ2D¾fÏÀoß>r4&L¾t½† ôñj>reÊ }¦\¾gi3(äï>AÁ ¤:ZŽ>_Zþ˜Õ$¾p®2Äå–>tŸ…É]딾tPùïsÕ>nt«…'m-¾Z#°[A¡¾MìʇßÄ>jbÏk7¾s™áL‰Põ>urAU¦¾rEç$yŸ>e™Gã(뉾(`k…ãf¾c É×Î>q¡þ?ª6ľu©k©2ó;>t¦ ™‚g¾m›f=Ê™>UÝD×h‚ä>TÏ#ÑÀ“>¾mpBÊšåº>tÛÖÅIõ¿¾v+ÂìÄiÊ>rRÌ~K6Ô¾d^!Ç»qñ¾Tö²¡>eÓü=ÖÿÕ¾rúì‹ž>v­OL ‰`¾u!·pÇæ>mSeØ>±¾Sý©Íh´¾YNw‚5Ñ>pÛo'ðÁ¾v ÊOìÏP>wf´¾r£¾+a¬ô>cÞCªE[à>2 ‘¶a«¾hzŒÒ¢>t,°Î´4P¾w¼õ• Aþ>u×rãº÷ý¾mÆåÀ\ݲ>QÍñ9á>>\WVŠ¯Þ¾qpÁD%ß>w/Ì‰æ ¾x§w×>sMÂl‘{¬¾d?Ÿÿ÷$¾74ôLJe>iŒõ…ÍG¾u?×€…>xåýd'z¾vÜ# \¶Z>oPnïG_¾R‰WT•qäǘ   ¾xTékEš²>y?T“Ä}ñ¾td0¢ÅM‡>eª )E™>4vîÇÄ9¾jcUøáŒå>v0—Àʻܾz0Ûú†Jº>x? ØKÊ6¾pÁo+&&>U„ò’í>>]BZÃe|`¾rrà«œ>yyšFPJ¾zÃ)í5×>uøÝ­S(¾hIñTOƾ êå„kŸ¢>jbb‡‰ ؾvø£f¦E>{ŸwÈpà¾z š)Šy>rå²âÆ©¾[$â»Òã¾Z‚ 0 ì>r©šžßø¾z•áÖB×Ä>|‘^ŸÑßP¾xÝéL8ñ>lQ ü"¾->¥“¡4ã¾iTE}:=v>w„3TîT¾}+AùU·7>|L±+ÄOò¾u ú,‹j>añøX¾¤×>TöNž$±¾rk%DIge>{–¬‚¯þƒ¾~¦TÚ]>ò>zÚ‰.lvó¾pûý‰Ùós>I‘<á·%>fêWQ3CÓ¾w²ù ‘W>~Âcíq'¬¾¤ª>xMf×$¾h+tº¿þ#¾GÎ5â—cB>qŠÆ’Z¢¾|ZY0¦8Ó>€y´`f¾~=­†L¥>t¾­qÐ,¾Zç…Zd¾b·0ÆI¹T>wScŸP‰B¾€!çö-\U>Œ¹¶È¾|hJx®>pKžQ8¾¾ˆ—Ñ|¾o‘šˆ¯¹R>|«ëì17¾­ ´É>#?P}µ¾y’çæå>f%íÀâ.>XMâé•|M¾v[J²‚>€¼Æýým¥¾‚Ê@ì–.>€µÇJÓï¾uÎq3Ã#>TÊïÒ ýß>i™þÓS¾|‚ÔÚˆ¨¢¾ƒuÊ9}>˜[Ënêß¾q1¹ÍÌe¾3¤…í›|º>sª˜Lðó¾P9œt‡>„˜ŽfìÃ=¾ƒ®ÅXÉ3>|Øhé¨L‰¾g›ü13Nܾ`<Åæ=²">z˜Ï|u⾃Æk@œt>†“«°˜U¾ƒyQ³€ŽX>y6ñÕ«¶ ¾VÏbÅó ´¾nÕƒ]+‘€>€ÆF%“ù¾†UñêrH`>‡‚կܾ‚×ËìO°Ô>t¼œœ ö>1Q·Ò)H¾wòu´B>„BBÞ~¾ˆ¸N=¡h»>‡à ÂêÓ¸¾Íh÷€>nÙŒŽtÎÚ>a|è_t¾2Vß->‡ÅŠ†Z,¾Šó@×t>ˆTàPŽ£È¾€Z#}>bƒ?Ë!>pÅÖIlO‘¾ƒä×°… µ>‹\G«PˆI¾=¿¬dl>ˆ€^–.ðŽ¾|ý9aàÇå>A7Á|î>yßÊ°ö¾ˆ…¢Ì{#ò>êg+8`¾"SP’…Ð>ˆhþ¹ð_¾xcÉÍŠ5¾X2íÜÙ·>‚ ÈÝn¾ Ïe\UT>‘“ž\è±ì¾Ÿ+…;»>ˆš*kz¾rÇ–¸@¾oM‚l\^E>‡ñÎ8Ù„×¾‘º¤‘þ>“ÚÔ]R£¾‘Äd'r€™>‡„Wï½7¾gÍÀÖ2^«¾{0ƒJ¢Uº>ŽýtZR£÷¾•3¶™œ:^>–‘´¬;ˆ¾“o#<À²>†½2 1}?¾JQ¹ž“ ¾„Ñ=üÁqN>“ì½à.Ⱦ™˜°s†Ñ‚>š?O& ¾”ÕžÉuÎk>…¶èÇ:V†>`7X¸Ì_ô¾Žl‹ÿ:>™á…úw9*¾Ÿ–òúÏCn>žÍœ–>߬¾—Eñ¡õ{>„V¸¹.~U>xMý3\üI¾–1ûìL÷>¡ZðzX˜L¾¤RÃB¸Ä¤>£ ¦ûU¾›%/Á–R´>‚@ÚÃ.ã$>‰I^ƒeñ¿¾ ìnÎëB>¨ëÁ å澬M1W25¿>©ÉWW㶾¡+6hîI>{áWdeçÉ>š’¦,ev¾­M¯Ù$G>´ÚéÆQª¾·kjÀ—>µ¢Åv–¾©åpEu¾bÉ:£Ôß>²q°òuß̾Ã9µQØÌ«>̤ª{šcV¾Ñp®JZk >ÐNLJ;ôÞ¾šZZhÆs¾ø…ßù>¾f„§Fq>XXù:X >(ø°"ª¾]™@R±þ>gbìØW ¾h¡K{dhh>b%ƒ¹m‰¾Gá«œ9“'¾P$·#5"b>c“ë`P{¾hñ‘3ÇÐå>f}ùy16Ÿ¾YþKgÏþ±¾Ÿ ÆR>[ã0¥€)·¾fôOïº>>hÇÐÀ81@¾bÛ* ­Ï7>L'Nè„ÿv>KæVݨ9¸¾bÍÆ8s->hÁ ÎÂ˾føíú,¹î>\ ȶ·”¾4ÌÈR¾Y¯›§ ©?>f^t› ¤¾hê¦côöô>c²IC؇–¾P®A·Í¾Fp¸ Z>aÎùÈòp¾huQl|»3>g~6†´À¾^oœ8«.‡>1±Òøê§>Vô$d›Ð¾e˜$K½hk>hÿ Xe¾d¡Œ^£%>S¸èGÐ>?Áצùøľ`æ¸õ]>hÙ3{z¾h\ ð>`ºäÉ(¾?Ùÿ×¾S¨N½¦¤ï>d–ÑÓ¹Ö¾h÷÷ðJ]s>eo>Ù­è¾W$†ô#Fؾ0fw ³<>^Îjé:¬¾g\Ç­q®P>hwcc™%¾bJÉ4i>GòÈwÇ5Ä>O„È]Xž1¾cO+`}œÔ>hÆFXòñ¾f—£:Ùý>ZáoµÐD½ò«nw–Ïq¾Za0r<˜>ftºXGÎ&¾hÌËç—†M>c€ÿ‘Àæ¾Ph =…]í¾FzºkØG:>aµ«SÖoí¾hYä’ÈÝ>g~ŘÍо^ÖXóŸÊC>4ÖF*¾Q>VA0d³¢¾e;ŽNÁE½>hï„#é{¾dû}·Mv“>U.eIä3ð>8a¯G5Ǿ¾_~çf“>gƦò² ¾h>v˜>aq=¡*…¾E227•¾PíÁFAX«>c¢ff‘«¾hÊWINõù>f\ŽMHOò¾Z0|™9½örDkvY>ZÆ…Pžv¾f˜ò) ^>h¿dúns¾cnbü"@>P^Óž1>FhF{ øÕ¾g‹kö–9>_FC[c’¾7»«²ÃH#¾U5Â# [>dñ»{T­¾hçÏÑàî>eI[úÕ ¾VbyqŽm¾2n­ÈØŒ·>^1Þ\Æ/¾gL¹ÂÔŒÑ>hk¸W…¾b£ìaü1>IK¶ f>M’»Ë †u¾bÝGÒûÛ)>hœ?éž3¶¾fäBä8ø>\wLvTSŠ¾$1âCõ‰,¾X-‘8>eÆÀšì1¾hÞ\š=v >dn¼{[^¾S ÙÓàNC¾>,[ËJC™>`6ú%ýÜu¾gÁ¶¥m>hí¹Ð±¾a/Ûa4¸ò>DHÀXÓ–V>Q%íß9ɾc¡!s…·>h«ð9颾fl1ÀÀê>Z¥Y#{‹1½ú³ªÍœð¾Yï,"~‚X>f<ii×¾hξË=>cè0…Ÿ )¾R YQÎ"°¾BTlæ¸1>`Í'¿€”¾gøi˜®3>gî’XŸ¾`³Ø‡ãI>AÓ£‚ƒf>R@«¡z‚`¾c÷ñŽ¨¿Z>hÑ6^~Œ¾f8g– æ©>YëOWx¨=÷Á¯`N}¾ZŒDƒa\ã>fbQŸàm¾hÊöÉ>cÅž²éM¾Q¬£C‚¾Böâ9A·)>`æ{¬+>¾hY ^®Ž>gïñ…ΰ¾`µÉ Céý>Aú˜Æ‚>RÏý›%†¾cé«R¬&>hÑà8¯ ´¾fR`]¢>ZUAŸõ0˜½æâ:à¾Z Ös/E8>f>½HÒ%`¾hØIë€ä>d óè¦ ¾RX ‹¥¾@ûqšöu>`‚XcéH°¾gÜï•j!w>hjVÐ@š¾a6¸ý‡þ>DÃÀRæØ>P¾ÕÂ!hÁþáø…¾f·|ýôëŠ>[á/æóï¾ yôÂ"e“¾X_óÚh‚>eÊ_åàV ¾hðéXvçj>d´Ö6L–•¾T¯g{cVø¾8§PóM>_0YLXx¾g~üŒÙî>hsűLúÖ¾b.ÆT’o>J*‡*È·c>L ¦Ä*pë¾b‡­IÈÞ¿>hSÔ>ì¾gXÚ–†Ý>^|¶¯°(J¾50BÚ''¾Utš5h>dñ–3ˆC<¾hýÞÓØ›~>e®~UN§‰¾WúÖ(B£B¾#¯&³Z \>\-ÎJüñj¾fÎËëW>hÒ)?©z¾cŠªôà­…>Q T[ >D–ñâ˾aºªqü¼>hܨHªq¾h¦ºÀÊÜ>aëbë¾C½3w\K¾Q*ˆ†¡w>c– ^×壾hÛ$shÄ>fÙL:ÍM&¾\OT±7 >%Ù˜Äû>WÏ í˜ˆO¾e¦ BÖÙc>i"&Õ¾e)ew`ÀY>V&Æ ù_õ>1õâöJ…¾]Ó8ëD´>g:ü†Ó|¾hÆ1Ï_%+>cAË^|¾Oe@íç⌾F¾,L7%–>aí¥ò¯º¾hU[mJT>hÍ¡êܾ`·©H©:>B1Êr§±_>Qâõׯ¾cÖ!:(¥>h÷Ú9“¾fÙ,9x>\/Ò¢'P ¾#ïð+DP¾Wîn ¶ü>eµdYû¢Á¾i(wGÇýu>eP°ú©ØŽ¾V–ù7½V¾/üâ×>ïö>]oÌõû¾g->à’£>hîu¾cyu öMà>PÄá&¶>D†Òxr V¾a*ÿžWPƒ>h?MáÎaa³€b4 ¾E­îÄø?”¾P7c)ì„Ù>cM /)ÿؾhÇ.>ga4Š‚ݾ^.ïHy ’>3¤…/k>UÈ?R,€Þ¾eVå@>i@½ §Ü½¾f#8y_]>YPb²Ìå> ª•²è½¾Zèš"Žï*>f•§¤>À©¾i;ÔÝ~×>d¤UŽ!ä_¾TAŽ³B~¾:\C¤ëH×>_— WRí¾g½”–»>hçÑ«Åp¾bð1Ëai>N0^Ì3Õ>HIì¨T½¾aØØ”ƒõ>h–)f‘Ñê¾hL¤cS0>a]û9Õ¾CÕ'³u„¾Q$™¢,Ç>c¨žä¡ ’¾i#¸Ô 6ë>gsN‡ãpm¾^%hO]¢>3*F¤XCw>Uð h«ž–¾e6’\…‰ÿ>ikQ¾ 8¾fdNpYI'>Yû(– ø=ìúyk¾Z]ÒŠGb3>fƒªÂ¶J¾is~Û•±>e(»nòðô¾U¶­„äÅU¾4@¶ê²:>^iݬ­äQ¾g’½{3Œ>iBó¸ ;¾cȽ6J^>QgQƹײ>Cf18½·¾a£ßØ×>hf¸Eß !¾hÞmx`>bLÁpq™¾J84Ÿ{4¾L15SÎ7>bªWPèú¾i1»”#>hN&˜×W¾`¼¾‹˜{>AÁ4D*éL>R:“ç È ¾dT˜>in´á‚ª«¾g™{É“*>^;¸Öóù¾3<Äoo¾V R»•ç>e[%‘!±¾i¬X §>fÅ€ s ¾ZðESZ¼>J¹³÷R>Y¥¹qùèA¾foýjmÖ>iÀȃd÷ó¾eÙ–&[àê>W¢”QH#`>(†¶þ«T¾\ìÒ—§>gXP®¦žß¾i²X˜.†>dÛFzT‚þT[3ˆ©)¾:Ó“iÉ‹<>_è†~ Õô¾hJ]íô™>i…{ºþeö¾cÐGþ÷'>Q#xf¶>DJ7&¾aN—Û^>ø>h¸À"O‡¨¾i?“‘b>„>b½\šL˜¾LÞ0GÅ÷¾J¿8}æ?>b†V:vÀæ¾i6þ8lþ>>håC¼þ¾a¦æ«øÏ™>EýÈ¿m>Pbî´4ã¾cCVŽÕ>i™âKꉾhzâ鱧>`‘¥Âi ¾@:œºë`(¾S,¹è†¹ >d•[’Xd¯¾iâMÚÚï’>hþ|y‡r¾_ DÁ>5‰çj]hx>U¾öÉ@Á¾epØ1$Eý>j´¾—¾g‡Ç|ëEx>\ðÆ×þèà¾&‡ÿ¬T85¾XlToP>f2SÛ»#¾j9lÀ¼¹Ø>gïĉò¾Zõ`1z(=ûŒìOSF>Z?­Æ®ãõ¾fÛ=7qQÌ>jN) £¬¾f…g½ê>YÐo>³›gnÝúøí¾jW½ZôÚ>f$ô§Qg¾WQuÔAµà¾.–œî·Ë`>]ð9× ùŸ¾gï4?Œ* >jYm®d`é¾eŒÆ9ÛÍ•>U±˜À% ª>6ªA‡n¯¾_Žm÷x>h^lö¢*²¾jUœô¦1>ei³«¹¾T7g›x¨¡¾=D󫪹Ÿ>`pJV˜ów¾h¾›âñÈ >jOýœd¹¾d³´ö0'm>Rå_lÖ>AŽqZ6N¾a ü^ñ>iŸ·z÷¾jG¶c§[>dXòJê@¾Q¾0¹3)F¾DjeÅ“§>a¬>[% ¾iY1G”®ó>jAÇtnQ¾d ^©tÊ)>PÃW9Š>F>šïi¾b_p- >i–ÆÔ·¢%¾j>¤b?Û©>cˇҬ¿‘¾Oí?XÅ=¾H ¢ëwÕ>b`„nƒ?x¾i˦ ‚Z>j@ ‰D†¾c-ÕêQ>N²Ëû3Sâ>Id˜´°X„¾b¬É®MÄ>iø͇ßf±¾jFÎÀ1B~>cîã=&o¾MÙÊ4^f£¾JbÞÒKUå>båÊK^Ѿj¦7š>jT%?N ¾ctöf>Md?oŸ:>Jþ! Èܾc ü8 ¡—>j>µK‘–l¾jhWmqßâ>c|yÊîÇv¾MTp¸š¤¾K4" ázP>c “±$$¾jX"6¶ê«>j„ :«ë¾c—?ç'J>Mª¡å0ø >KÞ“fÄB¾c"ò¸ É>jk+].qɾj§&½2>cŤô. ¾Nij½(©Ò¾Jmb›“£>cFZ­9¯¾jwq|³Ì}>jÑG¨¡¾dgH«š?>O‘\¾šã >Ilëµ8d‘¾bîA‚Œ!´>j|=:Òú¾køÍßØ>dZŒ:»?Z¾P‘¥Zús ¾GÿÆO”Àü>bµ^Ñù¢¾jx“þ\H×>k8°¤ƒÿ˾dÁqÿÀ{˜>Q¼ñ„>F$‘…À¾bg˜ªŸ£>jk·…ËȾksÊ/”Å>e:¥•¤¾RÂöï‡æľC×[wF>b~’´Úî¾jR9w#4Î>k²Ô;eãóåÇu>T*ñR›]U>A–>×]ò¾a…"]rû\>j+ð†UJ³¾kñ{fgª±>f\¤†;¾UÇ 3ô¼¾;·~6 6>`ípS,Ûe¾iöWYߦ>l/ñï~:&¾gÁ& ø4>W–i'n>4P±(x¾`9éäa›ß>i­Ü 4«¾ljŒJXc™>g¶˜'¿u¾Y–s¸i8¾'Ú›YäùV>^ÐqêãMR¾iPŸžÐv>lž“Î ™¾hs1íÝ>[ÅÊk³¯>p:è–¾\íbG³‚,>hÛ)~¾lÈBùò>i6 @†«¾^!Ç–‡>I˜¢iâ¶>ZÅÒ/´ù¾hJ!"N¸:>läEøJ¶¾iümk—óæ>`R*¿;„¹¾31+T¼ÆL¾XV’‰à÷>g™ñ8âYÁ¾lígž tv>jÁû141¾a¥M:¸H‚>?™` p>U›ãß)¢¾fÆé§A >lßñc7 ¾k‚¥ØxR>cÚÖ/”‚¾Foµ¤Aè¾RÎR>eÍ?ëôf3¾l¶U%/>l9 ‹Lœ™¾ds!}Y«>MÅúËo>Ni¢aÈq¾d©3hË>lkÕ¹¾lßêäbÚT>eå¬LGnÙ¾R‹„”#'ò¾G ¦Ã°ñä>cW¢^.¾kùªô“dã>mpº;Go¾gYK;“¥~>VdÛ„;º>>Ss¥„D¾aÓƒâ•Î>k[3– 2¾må¿‹K>hÇîü»o’¾Z @ŸãS¾)]Ê[v»Ÿ>`g·»8D¾j‰óKÃ->n5HQ9&(¾j*¶—Ñz‹>^ޅܧªø¾°íÂV®¾\Xˆ²Øó]>i€fh‘À<¾nYø„2ú½>kyÕ:ÔHc¾a˜M”õ” >9´5Ošg5>X“¦? ¾h8 ƒýª>nJ£Ü?˜ì¾l¬¤¯Ì´ê>cÄk¼·¦¾GG¬Œ3ko¾SE8s$ʆ>f­·Þð¾mÿGœ‰óæ>m¹ŸäÅ¢ž¾eëÌÒ¡ù>Qײ«V>Lî™+ª@¾dÚÄÉbX>mo†³áf¾n–‰Ĭ>>hߘݽd¾V³Ø·Š ¾@Ò;ÍM­ø>b¼ZåˆÄF¾l’"q¨h>o8n±µ'›¾jà wŠ>\oîbœ°>"ÐûÅ{…;¾`O›ñ¡¥Þ>k`*Jõ¨¦¾o“òó†N2>kØÝ]±««¾azP%K>0O“lXÐ>['} -¯…¾iÒ[9qË>ojÓ÷ñ¾m}‹BœÎ>cöý`´l¾E¤’xÊã¾UN×Ë­>gâ:dH凾oI@í žÊ>nàÁçu)þ¾f¾ æ®ÿ5>QÎo)i¬Ü>LËÿ/Mál¾e‹|Ô ô>nŒ9œ×j„¾oóŠÜݤ>ibêŠÐ¾XðlíBlS¾<²b‚.å>bËz˜…¾m[ø 9½H>pRƒn$Ä%¾kЧ\t§>` šåðõ¾ùo#_¾_A‘-æ]>k¯eNŽ0¾psXÔÍìõ>m÷&h­²š¾c–LIÈ„Â>AI•ð|]F>Xɽl‡¾iV 1>pTˆ\L¾o­B3´>fþæé¾Q €èb¼¾P7ߦÙ>fÇX¾oÝUö©9>pŽ+©²º¾j0LXæ7¼>Y‘é…Õ?P>>~á—d©¬¾c…5àõS>nw\ë^b²¾pøºª\ƒ>m:ô°©¾a µùhÂ>»²3Õ± >_w2M$øZ¾ll¤íÞíˆ>qSÒyˆ™¾orc¶ê>e-Ñ•gs¿¾FN³U±o ¾Vâá(Ÿz>i¶³\…ð¾pÝûšÚ>pÁù•§©¾ivwUÐ>U7Xû-ó>JÉàCÌ‚3¾fR±9º>pF<ÏÀ`¾qmÄ.h½>lª›·Œ)l¾^ë6ÈEN¾)U(-ˆ>bC’;šØ"¾n’QƒŸ¸a>q¼Ü·i)¾oÂt3¥¥>dME™›úd¾>ìB€yp¾[#‡Šð»>kÄÌVm÷¾q£»¸Fö>qȬuI¶¾hä¦÷¡æ·>Rññ»°‘Ö>PšlÈ h¾h! ä>>q¥È½m×¾qük駈>mÈ­Á¾^;¨ç e¾4f›gSì»>cªæì«2Ѿp œ/]ñÎ>ri•g&+ ¾pVûÍP&Ó>d¡ãŽ51}¾<~ŒÏ3ÂW¾\Þr.·>môÇ•¾rVñòk>qÄ{?¿ZK¾iÕ³ì2‘>SÃÉ—§Ü>QÐ>EÀY¾hïÔ>ã¥Ì>q·û“ßœ‰¾r¼rf¥”K>n…¡8/Ù™¾`8„÷¤]™¾0<úÜL >cÞÝÎl6¾pƒgÏI÷>s*C»û;*¾q=ºPçÏ>f^6Ðþþ³¾Ch·ãG¾[Ì©X­>mi°Í> ¾rü+êvŸ—>rÀ0„o†¾lL0‚eÝ>WÙËÔåah>L—F½|Šè¾hš¦›[•>r#ß¾;ÇÁ¾s¯Ë¸Èj>pŽX&ÖŽ¾bòG!Q¡Ø=úó÷ ®}ô>b©·'ò}¾p˜¥ŸwÝ>sô“Åms¾r˜]þGcQ>i¢ÏNM‹°¾OË!Glf¾Wj¸Ö{Æ’>l°öß•¾sz°7h>t¼Ž5¦¾o±%.A\ >_“ÕòO@>?g÷œ2D¾fÏÀoß>r4&L¾t½† ôñj>reÊ }¦\¾gi3(äï>AÁ ¤:ZŽ>_Zþ˜Õ$¾p®2Äå–>tŸ…É]딾tPùïsÕ>nt«…'m-¾Z#°[A¡¾MìʇßÄ>jbÏk7¾s™áL‰Põ>urAU¦¾rEç$yŸ>e™Gã(뉾(`k…ãf¾c É×Î>q¡þ?ª6ľu©k©2ó;>t¦ ™‚g¾m›f=Ê™>UÝD×h‚ä>TÏ#ÑÀ“>¾mpBÊšåº>tÛÖÅIõ¿¾v+ÂìÄiÊ>rRÌ~K6Ô¾d^!Ç»qñ¾Tö²¡>eÓü=ÖÿÕ¾rúì‹ž>v­OL ‰`¾u!·pÇæ>mSeØ>±¾Sý©Íh´¾YNw‚5Ñ>pÛo'ðÁ¾v ÊOìÏP>wf´¾r£¾+a¬ô>cÞCªE[à>2 ‘¶a«¾hzŒÒ¢>t,°Î´4P¾w¼õ• Aþ>u×rãº÷ý¾mÆåÀ\ݲ>QÍñ9á>>\WVŠ¯Þ¾qpÁD%ß>w/Ì‰æ ¾x§w×>sMÂl‘{¬¾d?Ÿÿ÷$¾74ôLJe>iŒõ…ÍG¾u?×€…>xåýd'z¾vÜ# \¶Z>oPnïG_¾R‰WT•qäǘ   ¾xTékEš²>y?T“Ä}ñ¾td0¢ÅM‡>eª )E™>4vîÇÄ9¾jcUøáŒå>v0—Àʻܾz0Ûú†Jº>x? ØKÊ6¾pÁo+&&>U„ò’í>>]BZÃe|`¾rrà«œ>yyšFPJ¾zÃ)í5×>uøÝ­S(¾hIñTOƾ êå„kŸ¢>jbb‡‰ ؾvø£f¦E>{ŸwÈpà¾z š)Šy>rå²âÆ©¾[$â»Òã¾Z‚ 0 ì>r©šžßø¾z•áÖB×Ä>|‘^ŸÑßP¾xÝéL8ñ>lQ ü"¾->¥“¡4ã¾iTE}:=v>w„3TîT¾}+AùU·7>|L±+ÄOò¾u ú,‹j>añøX¾¤×>TöNž$±¾rk%DIge>{–¬‚¯þƒ¾~¦TÚ]>ò>zÚ‰.lvó¾pûý‰Ùós>I‘<á·%>fêWQ3CÓ¾w²ù ‘W>~Âcíq'¬¾¤ª>xMf×$¾h+tº¿þ#¾GÎ5â—cB>qŠÆ’Z¢¾|ZY0¦8Ó>€y´`f¾~=­†L¥>t¾­qÐ,¾Zç…Zd¾b·0ÆI¹T>wScŸP‰B¾€!çö-\U>Œ¹¶È¾|hJx®>pKžQ8¾¾ˆ—Ñ|¾o‘šˆ¯¹R>|«ëì17¾­ ´É>#?P}µ¾y’çæå>f%íÀâ.>XMâé•|M¾v[J²‚>€¼Æýým¥¾‚Ê@ì–.>€µÇJÓï¾uÎq3Ã#>TÊïÒ ýß>i™þÓS¾|‚ÔÚˆ¨¢¾ƒuÊ9}>˜[Ënêß¾q1¹ÍÌe¾3¤…í›|º>sª˜Lðó¾P9œt‡>„˜ŽfìÃ=¾ƒ®ÅXÉ3>|Øhé¨L‰¾g›ü13Nܾ`<Åæ=²">z˜Ï|u⾃Æk@œt>†“«°˜U¾ƒyQ³€ŽX>y6ñÕ«¶ ¾VÏbÅó ´¾nÕƒ]+‘€>€ÆF%“ù¾†UñêrH`>‡‚կܾ‚×ËìO°Ô>t¼œœ ö>1Q·Ò)H¾wòu´B>„BBÞ~¾ˆ¸N=¡h»>‡à ÂêÓ¸¾Íh÷€>nÙŒŽtÎÚ>a|è_t¾2Vß->‡ÅŠ†Z,¾Šó@×t>ˆTàPŽ£È¾€Z#}>bƒ?Ë!>pÅÖIlO‘¾ƒä×°… µ>‹\G«PˆI¾=¿¬dl>ˆ€^–.ðŽ¾|ý9aàÇå>A7Á|î>yßÊ°ö¾ˆ…¢Ì{#ò>êg+8`¾"SP’…Ð>ˆhþ¹ð_¾xcÉÍŠ5¾X2íÜÙ·>‚ ÈÝn¾ Ïe\UT>‘“ž\è±ì¾Ÿ+…;»>ˆš*kz¾rÇ–¸@¾oM‚l\^E>‡ñÎ8Ù„×¾‘º¤‘þ>“ÚÔ]R£¾‘Äd'r€™>‡„Wï½7¾gÍÀÖ2^«¾{0ƒJ¢Uº>ŽýtZR£÷¾•3¶™œ:^>–‘´¬;ˆ¾“o#<À²>†½2 1}?¾JQ¹ž“ ¾„Ñ=üÁqN>“ì½à.Ⱦ™˜°s†Ñ‚>š?O& ¾”ÕžÉuÎk>…¶èÇ:V†>`7X¸Ì_ô¾Žl‹ÿ:>™á…úw9*¾Ÿ–òúÏCn>žÍœ–>߬¾—Eñ¡õ{>„V¸¹.~U>xMý3\üI¾–1ûìL÷>¡ZðzX˜L¾¤RÃB¸Ä¤>£ ¦ûU¾›%/Á–R´>‚@ÚÃ.ã$>‰I^ƒeñ¿¾ ìnÎëB>¨ëÁ å澬M1W25¿>©ÉWW㶾¡+6hîI>{áWdeçÉ>š’¦,ev¾­M¯Ù$G>´ÚéÆQª¾·kjÀ—>µ¢Åv–¾©åpEu¾bÉ:£Ôß>²q°òuß̾Ã9µQØÌ«>̤ª{šcV¾Ñp®JZk >ÐNLJ;ôÞ¾šZZhÆs¾ø…ßù>¾™˜¿^¾©Ç>Ð5“Û* “¾ÑN¥lÎÁ1>ÌWf1v5$¾Âî~ÞþN³>±÷ L»¬¾SM{]ñﾩôcνÞ>´Á“Þâþ.¾¶æœS% é>´#¹á¹ɾ«³Ÿ,e‡W>—KÚÎ¥>‚P«u3¾¡ž–”Ð u>©s0Ú×¾«-àß8¬>§)IÁÍ©-¾¦÷Bäñ>!èõ¬Þs>ˆ‚Ð ({¯¾œÌš­x>¢ÉÓÃ*•Ã¾¢öÛ–¶>žLÙrúöB¾äýŠÇwš>MÝf3m‡Í>Œ!bäÙ×þ™äËO÷²>çÐjÆfÒ¾œœ¥x°>”Xባ=V¾rŠƒ(¾pU [>Ž„ ØHá~¾–}x«Å–>˜nÿ2¿y¾”òrXf>Š"<ªS—¾eÑ‘uït€¾~ÅŸ$‘“>ÑIŸ (C¾”8áó=[>“ÙùN£ìt¾Ž0Õofb¶>|ƺػà>_p€L3¾„”ºâ> Ù>êâ­œ@¾‘α*™à>$Q×]㬾ƒÑO í.>aÏ$±”1>vªKsèJ¾‡ò›ÞB>Ž¢“^Ÿ<¾Ž”*= >†ªËV®¾tŸˆ-u¸¾_âÛäöß0>€à5§®b¾‰o&¸6x—>‹Ò@èQ"p¾‡­séÕÝ>|Qªö̳°¾JS?ß´#¾u¹>‹6qê>„pó½@=%¾ˆïU3ëÄ>‡nÆGƒŒ¾€t‹W ›P>g0[¬‘»O>g²ú:#´¾ÑÏdM>…Ôÿç–72¾†dÄ“2Rü>˜ì:)7ƾqr³·¹”!¾P•…9™Ï>wíˆÄè㾂É3‰i>„çSû„Ž-¾êì6KL>uW wÏ(˾@Ab8Žã¾qJäHe߃>î¾a†Ã¾ƒ6wûZÚ>®ô͈]¾w·«äÈ->Zë¨c¡)>gÇ⎱¾zð þ/V}>~Ó×.[u¾ë¾ý>xófÁ v’¾chçm©ü×¾^}sŽõQ>v¬ ×e¶¾»?"¾)>€Shæ»ؾy\/Œæ@$>g±5nç>Q{À!r­ª¾s&•ÍïB>|ÉS~,…›¾~ï7*R$>y0ÓžŸ¬¾jLÇ \ʾ@ÐzÐ[î>pWçÆÁYB¾z:PÊ_rr>}3q£ÜD¾xžÔü㊟>k–Vè„5>Š$ú¥ðó¾ldÐóöx(>xõÆ©¾4¾{‹GÊìla>wÊ«ôákǾkÖrië¶>#dŠnœ>iI†\—lü¾vW€ …&Ë>z¼­Øa¾vË$·,M>kD@zØáؾ0ž½WȾg:x[NÊ>túôÁg>¾x¡,^YQ,>u®3ä³/¾j×x`ì>0q ÌôØ>f9‡“¾sôfX9à0>waõsÕ®¾t{HS0!>h>_9®Ío¾$4P•Z¹z¾e±Å“ù?Ü>s6µ§Ã&/¾v?zþœ²>s3¨¨Ý.¾eùŸ«r¹½÷£~r ÃÃ>eô 49 ¾r²©!q3>u/꿇ûç¾qÕ ”šúö>cC².|ôÁ>1†W<œ¾f¹Ÿ@fí:>rWÔš›˜p¾t&‘î™Æ3>pZ â²G̾`$À³ú÷¾B¨,’ÃðÏ>gàPÂyôf¾r+’U™ >s9¬kL¼¾mw—§š¾ò>YC4|éwâ>NÊæl·¾iEZw'š>qÔª=™õ¼¾qìUµ‚Ö£>iå‡@ @¾Q€ Ý}1¾UJâöGu>jÁ×¾ô§¾q„íÚ{\I>pœo€ ªL¾eñ½ô”2’>B(í驃>[à%xÓà„¾l,s·»f!>q)ùâr¾n-?â$H£>a“y–Óå^½ÞÿaÅZ…¾a?¡ãæÄ>mV¾~IÍN¾paA( Êz>jœÙR5d¬¾Y•«N–wk¾BY%:<Öþ>dhñ«­P¾nD6n¯&>nÉŽðóŽ¾fu˜%à®>N…¶@©lÐ>R‡š5£€z¾g8ÂRƒL²>n%Ø–z÷û¾lSÑN/G>a±¥.Ÿ¾1~Šßßg¾[‘Ë÷¥!>iuöÕ¾äH¾mgÖ)Qˆ>hƒ£ÂP¾X®ôvæýÚ¾;¶ˆÍNÞ>aê |€¾jã»tP >k¨xÃÐö¾d´,Õ1]>Jþz$*>Q¸øšë £¾eaªÞ!Ü>kCÝÚªú´¾hË”>œ-›>]šÞéÒ’2¾ xüôO™¾[çyÝ=èI>gâ »¾æ¾jbиõÈ7>dâßeľQ¥-sè-”¾FЫgØF#>bP'ÏÍZ¾i!‚rÝÓD>hs:šÓÞ¾_>KÕ̆>3·8« >Væ!ËÔ´!¾e’÷kÞ®>hÞ/0,bx¾d]°Ãê•>SÔhéò>@–S——¾`e>SX¸ô>g^GŽ´· ¾fë§Ú£² >^„ûä–#¾6íx;‡f¾Tœ¤èør>dmeÿ² ¾gd”éCÈ>c@Û=g¾Rò 5!ݾ?¡h­¦^>_¹ÒÚN¾f/‚¸>eu°•q5 ¾[üâ•vîA>0ðkN)al>T£¿ñƒµ¾cP£8ý>fiÕ„¾a‘.šzÝ>NÍì^6Ä>CŒ€>—°¾_%Ùþ>e.¼uý“¾c¹K;ë/>W㦾Q’¯<«¾V~hœc®š>cTgó¾dŽ=ý” >^œõ¾Y¾DXæÞq¾JÔž8W>`.xW"Àž¾d;°ñ*³;>a‘Þ" ôÕ¾R@‚=L¾2qÝy¡>Y’³ø÷h¾bøŽ–†Ó>bËX˜ßÃv¾X»Û;Ù®>.íŽÀ(§>RH®ÎHq ¾a2lÁ >cƒ›˜»¾]ÅKåWÿ>F#»(ä¤Y>Eí›p+ÒÀ¾]ýUóºI>b¢ÀÖ8^¾`dwvQ>QB¦]p¸">/´ªÿ @¾W¦“Ú ´>a‘/‹¾¶¶¾aI®õl³ >VAÒå½&Ù¾#¹jpDy‹¾Qýf+9‹K>`¬y>¾a+©Ø*>ZQÁPŸ¾@Q‡–Vî¾HÍ#Z¾ ß>\ƒ cË­ý¾aTOÇá^>\ËÍ«Nÿ¾J:.†¾<[0È¢T>X•åªGÿ)¾`³ŒÝ@¸>^‹|ˆ“¼¾QM|,!ï¾!ãlèæ>TŽ_°ÝN¾_’ðÖ¿’>_u(¶UѾTTgƒñøç>!_‘H&>P—±ÝŒ¶¾]]*Íï>_°ú,fÞ^¾VÔßV’’>7öÁT5ïá>I¥w›]¤ã¾ZðêÞø´ï>_e-*\¢)¾X¬½±wÂÕ>B~&¶Ù¿·>B®cg ¾XqÑÀUi>^´gkr¼¾YòðóXcé>Gé€ÃÈÊ>8Ì^Wõ¾Uû@çxHÞ>]¾&‘Œ‹¾ZÀQª#"Õ>LQ4V¢Í=>+sE{Æ7¾S£gœèÏ>\ž)ï/wϾ[,!J²Ú˜>OË©F]0>ÉÐj0Ú¾Qyò$¹Q7>[jH;¸~‰¾[K1Ï>Q9û¶(ë¾}¢~…o¾Oè沨>Z4®¾[0¸âTìn>R1¹Ëµý2¾$µäQ!‹¬¾K¯³ë{]X>Y àÑ©¦R¾Zí*ù >RÚ8¹dþ¾/¬pì;¾HÔ~dƒ>WùÏ¥C}¾ZŒïËÓ!Ë>S>hålÏɾ3[o¬¸gÛ¾FO~(á>W«Ü‘¿à¾Z®–Y$>ShÄ"H6ÎQ‹E¾D¶YWè>Œ>V4³ø U[¾YŸk ƒúq>S`±ð „¾7‹X‚kCò¾CoðA(Ï>Uˆ‚ŒP¾YqÚú >S,zø?/¾8 Ï< -¾B§8I"7Æ>Uk3õA ¾X›ßŒ«ë>RÑZë°xö¾7™·­CÖǾBVÄ•#¬•>TžÎñw+¾X³,]©w>RQˆ¢Ê ܾ6?1ÖêE¾BvÄ â#Ì>T]<Œî±±¾W“o뱑>Q®s»Mù¹¾4 TµŒà¾Bý/=¸€G>T8¨Ér®´¾W XJ Lò>Pèï;¢R¾1–>`ˆp¾Cá¹c8Ö†>T,„•µ7ù¾Vyš6&ºØ>OþÐäUö¾*›8›ªšé¾EŸM÷Í>T1ÂÁÙü^¾UÛ„iâñ>MàeŸV¾!¨£¢˜þþ¾F—dwÔkê>T@í75O¾U*¹¿ mz>Ks°ìQ¾ x1Ë®ŒT¾HNyÞÙS“>TR)êËR¶¾T`wUp\²>H²á>m“>º¬øHÓ¾J.÷=kÊÀ>T[Lº# ‹¾StÅ_g;®>EšÓÂÄÁ> Õ,ýþá¾L%!ôk þ>TQçE3S¾R`ê‚!ö>B'ïÊZD¯>.h«ÌI¾NW]sÛ>T+‚c¾Q·\zg><¶hžzP;>6Y ÒôÑÀ¾OÿÄnoN!>SÛЖÒQJ¾OH"Ð|>4n0+»2M>=±³;(på¾PØC8Ñ>SWÙ¦´ù¾KÞõÇ ZI>'£Cc»Ù>B‡ûÈ]I‡¾Q‰ú@ ÿL>R’žb·kϾGùsvþ>úªíñê>FŽ\Æ%¾Rœ«sÒ>Qƒe÷¬' ¾C”ýÍ(—¾£µf;º>I}ÔgÙÃ÷¾R:¦¾S}V>P ׽ܥ¾=p²ån³­¾1—í ´a‚>L~:!ù0ϾR7ÇŒR©>LË€ŽšZ¾2áìpØÔY¾;m ŽÆ¹¥>Nú<)½¾Q•õÞqÔý>Hžl–’EY¾¡Tm‹ §¾BkGhFEè>Pcnr™Žé¾P¡.ó¾>C¿`™éwp>½ÏSÒž¾F¹ü¶j1>PÝjMš¿ˆ¾Nho™D²!><ì‰`ŸJ>/O_’‘§¾JnÆ`>~>Pد¿¨¾J¾J—ˆ›0x¶ªFS>:ÿŒC2±ª¾MTô„h¶>PDÀ[/ÿ€¾EÔËÃu> ë(déØc>BÀ<—àfs¾O25niJú>N-ë*á¾@7µ^"_Œ¾"tÑE;r>GPëv ¸4¾OÙ’¯lµ>J™°;¾3Ð;CÖß¾5äõå8o$>JìbäÒ)ѾO"ëúiŽò>EÔ k焾ùÑ­(qó¾@ÏÄÔØòr>MLêSòE¾LôÜÎ2¨>@õ·°Í>¥Ž´h¼¾EÛ»´„ ¬>N6»¬³Dò¾IM8è«Û0>2³PX¼3>5-8%<\¾I¾Ý†bŽ>M~äzé7¾DAép½Þ>^Kçåîq>@¿2Ì‹}7¾L&ë…ª½—>K^ DG ¾<Ýë€^¾$ƒß| Á>EßYñ…™¾LÏ‹ü%>FìÛ‘¾+žzá ß¾8%Ô(p‰X>I8<}}f¾K¢“qw¶>AF§ˆD,=ôÇ †–±ê¾B(úS¢Tø>KníúJG¾H^&±ëcô>4Ñ3Ú<¤3>0>JýBÎǾFá?¤ô†;>KB!èm»1¾CY€Ï<Ã>I÷ÁÀ/>=ÖK(¾IÆÝér>Hë‘Rl¾9 î†|Ù¾$GñÌÛ>Dp6 MË1¾J€³ê)v>D€ÊÐ g¾$ð[ÐnR¾8žW,TÃÎ>H":a¶jF¾HãÑê W><”“¬x®—> ´;:×¾BlÌYU->I•8¡à¾Dõ,¢},>+!‹˜?UÂ>4ÏÐÁëɾF³éÈ+8>H{ñô¹†ø¾=ÿÿ¸¾)@ó§²>@ìÑ=µŠR¾Hž+Ÿåã>Då€oçpþ./«[5§â¾2gÙ+|) >E”:ê>)[e_Â&=ôßz†àʾ?ó49 «{>GÃêŽÐ ¾Dp"uBkÙ>.sj$ëEU>1Y““•8õ¾DÍaÕ;¶>G Î`&\¾=>àýp ½õkð¬ã>?¦:2¾GkèéBã>C§>Ä;Ž¾,Cùfa¹ð¾1„…3ý©Ó>DZšóDâ·¾FGÆ^‡Œ>;_CϸôÝ>öY`(hç¾?+¦ €eø>Fd‹Íª=¾¾BŽ¯‡_ì>'Ïžbz:>2Å~¾Q1¾D*Ci.ÑÛ>EJ¼¯È«G¾8“OJ•ÅV¾YÞY‹>@Z ¨`¾EÇ}ÿç>Aæê ræ¾!IR€^0¾4ì }G>D#Jéa²9¾Dyë¸Õ>4ÜÆÃ=+> ¹udJ%¾@¯geDT>EpúDÐõ¾>å>àù>›AO’( >7Ákt¾D!_-™x>B›uØ §¾04›<ð¾a¾(ÿ]àhÜY>Az†<ã¾D)˜poz†>:c«•Ú˜=æcFÈàú“¾:ú4°roÖ>Cúž´M•¾@³]¼u:">%;­Ì¥H”>10 0¾B5v‡wñ»>BÜ×G“Êý¾4”ªpˆÊ±¾ëRîd>><ŽÏ™ž¾C| ~0]><ˆ w’|–¾œ?U!¾6™ w˜]>B¦äÆ=™¾A1œÄÔ>, d°˜–>)ˆÛf}œ¾@Š äd?â>Bt†+I²&¾6w0óJ„x¾þ(ª\ >:΢'ù¾B”gêŸÄ->=hu…Ðо›L6Óð¾3"—õ>A~Æ"˜í¾@°Ønï>.HP=y#>%ÞôªEj¾>¿ý6olC>A½ÓῺ¶¾6q£zO`f½ûÇŒíæñÄ>8᜹à¾A²Ç,þá><‚ú\K¾ÞÕi­FF¾1à™Hª÷Ô>@§ö¾Æ›l¾?ß#0:†>,Ãêƒu[Ê>$z/!Æ(¦¾=…Ó­ekt>@áx^¤•q¾4çsåO¬¾… ü½3>8båáÉ¢¾@éBýÓ«>: wk5¾_„r6(¾2Kˆ7…)>@$:y¥¾=§@4Â3·>(I1«>'Jã‡?ê¾=0F@ŸÏ>?µlÞÅz¦¾2F”Vb¾;ô!×:Ú>9…è#w¾@ eúR>6éÐ"0  ½þäác¯¾3øh&÷j_>?g¨éÝõ—¾:›<-ÐÛ> J5Ö`>,Ää$ñ…¾=V/(§qþ>= 9ä×]¾+…%Í÷ID¾!²:óHc>:AŒçž¾>Cv82Ã>2PX‹Ó>uH3fQ¾6c=Ö*”>>SÚζóê¾6rTc*í>Š"§F1ÿ>1õ±¯$ž=ZHco_š>9\"þ¨'¾ QhÏ“¾*\ÓÛž&>;zî³Ý‘o¾;M-òUw>)©û$Ý> …Yèÿ¾8Þ°¶Öª_>5°?ýç¾¾4.’ÚY%+½õ0˜ &-8¾2jÉwûQ>;ÓŽþK¡–¾6Æ¡Ð!ê>Ù‚@f>,‚#zL3¾:†¦Ë ™>8¥Må«î¾#eÚ©s?q¾$”züï{>8ª‰1‡ ¾9ÑÓ¥¢_I>*q§2ó—ù>Oˆ˜5›ª¾6\øㆲÐ>:ZL¦Ðw”¾0>u•/6¾Ž–9s>3»/Σ±C¾:NÔ3 ô‘>2¿^Ø2„½óÏ'ßh¾0à^&ÜÒA>9Á|ÓÓ+ܾ4»Ãä^>ei)õg—>+ÉyA~ľ8Å,ýËœÄ>67ü×Θ¾ϪFøƾ%º{5í^>7mT` ž‰¾7<,KŽ2>$óà•_”>p4æ6¾5͈.˜>7Òúëúؾ)Ϙ>zÓL¾­ë(ßY>3ø4ÇKž8F“f¯ä>-øÄýȤ>?Ç—µºÅ¾1ÿp•nê>7è:rÒ¾0¸êA2Û!=Ý$XDË>/á·˜(«¾7~š®ó|M>2 îгË{¾õ'ÊRؾ+²¡ø+ت>6×ê7]‰A¾3:*‘ïõÊ>Jµè´ E>'‡Y¢”–¾6X¼SÔ>4 ¶ ‘*±¾;f„õδ¾#sÍŽ€x>5Àv.¾4UPsF>!¤ÔMºF> Ç.€°ª¾3춋Aþy>4õ†–í¼Ã¾$»t;¾˜BnaO>2Ä'óÎí¾5Lqá>'e#Žy|n>›¤íz_¾1‘žŽh>5Þ8‹¾)¨AvA@è¾?<#Ü >0[Ò0E€¾4ð_H¶Ž6>+ŒýJ$Ù=ð¨c4^'i¾.RQý¦h>4¬éo!ÌC¾-§ëªü»=Óü šXê>+ý³9m.¾4Sólq´†>.[²÷.Àÿ½øljæt¾)Ãøóóx>3êÉÙ×=¾/T¹>ÑLÞŽ 4>'¨"¼Í¾3uÉD±¹Š>0'}_­õ¾ ZëA>š[¾%°iµµÎ$>2øü¸—<¾0FLüR­b>q;oÔÚ>#Þó4?>¾2xvÑaË>0n³žÑ,¸¾;Kݨ¹}¾"6Àcá÷>1ø’œ/p¾0‚þð¾Í‘>‘H/¶ž:> º7j°¾1z’=û0m>0…áñÞ#:¾w£Qœv¾×lþƒd>1ôÝcXœ¾0yph¤>ôUÀ1à>“ZŽI… ¾0G¦n©ö>0_ª½˜s]¾3áE»¨¾¥z@w‹ó>0#ucü¯¾0:à¼.’Z>ÑNlá~6> ÷‘±Ù¾/o8ðyÍ>0 K`:U¾A¯d‘¾‹Æ]÷#>.ÊV[Iê:¾/±I©aF>d¼¸ÇŽß>˺ bËo¾.(º <ÌG>/:¯JÎÁ¡¾<àM…’æ¾$ciJN>-™ëNºŽ¾.·˜G"´>ÍZ œq„>ÇÃ]¸c@¾-d(§>.(!dòÇ®¾4k~3¯¾¯ye; >,­²$Ø„w¾-OÈ‚,>, ë@?8>Ö1'؃¾,MÓ›µÏ,>,èWÅÑð¾î¡Ù@Û¾8¨g8óÇ>+ûë]R<“¾,9a>n³>¤ZqíN>ÔÎ?QÛؾ+¶wsÇZ>+öFÞ¾ ù­lH"¾¦òmã>+zg¨8[®¾*·*pí¯>>©©$§¨>¨¹áŸE ¾+CÔ½sb>)ßÂK©ðŒ¾+R*Ë8¾(÷ûóI_> ã7ôü¹>EßóŒu¾*Ù¬^¼HÆ>'ÿ{aøè¾ ZT¢ñú¾Îœ2Ÿ¬>*¡BãH*(¾&õ3gðQå>H½VÈš>þ~a^¸Ë¾*báéEE>%Öø‚‚’¾âL A´¾Œ,w´Åú>*8‡Fw ¾$¡ÿÕ&T-=öV{ÁÝgá> Ûا£k¾)ÂFþ®1>#Te+ÕC½ä·#—£Çy¾!Z2þ ´>)V‚ª¤úv¾!í”Ý\þÕ½Às‹fí¨Ÿ>"í–SÕ¾(ÓÁ<`> n&c}ˆ:=í™;ºu߶¾"ÔøfÜð°>(7vÿ€#ݾ¬t¾sP½ûÈ,ÜÑJ¨>#~sÍB×¾'~ºÏ®>Kˆ»s~>v-O"¾$Ñ:î>&¥·„Žæ´¾·.czê6¾ ¹XF>$’"뇉ݾ%¨OzY>òÀ7—º^>ÈÕʺj¾$ïÂ1bj’>$ƒ¬€ü2¾JXB°¾ôôà@>%'Ö)‰6¾#6žSü>äq«œk>ýU$~"è¾%5´[èÜ,>!Á‹Ö³5½û Iö†ý¾Ö&äZ ¯>%ÉWèFS¾ $ÿ“Z0ú=änñöfá>tò%¶¾$ÄI´Z™>¿×F»=Û1ÒYÕ™Ú¾Ê&Ë’+Ñ>$<áù뮾ïE݇^œ½÷¹3œHµ> dgõÕ=¾#{oÞ”‹>Õ= >ò>&L¢O¾!/¬&b½Ì>"}ðÈž7/œzϾ åþ6p¯>!¿Žº} ñ¾!C(Û£nz>÷ë¨3‚>ÌÎ9~î¾"„îžñ@>œ›7×½ýmèqë?d¾<‚u¶b>"aãôɾCöíªcÃ=årºŸÜ?Q>LØÏî†e¾!Ù“3˜Ø>ƒaî´=ß Ä:Íi¾ë»Ð‚d_>!N­—“·D¾d`úó¹½ú"kK|å!>çJpž=¾ uV;C"K>êëŽæ6>È° ©:0¾ˆ4h$›Û>›°Ó+NV¾–-]¾ ãÀ»^ô>c} 'ªW¾·Ž&ÆtW=ùüýþºx>–è­ ñF¾œ¤"…>K—v¬²j½ÚÂ8'žk¾»çm Ìò>ÔLq¬¾hžýA|½èS`©gý>L‰1¿¾¿çöñÔ>"-Ö9öo=þ|²¿eè¾4çµ>ÈÞ: ?¾óû…ß羺&ø8Rü>aûÛõl¾#{lé=û/&…º€>VÌ]%¡u¾Åò…bÊ>ÞœÛ÷{½ß­ž-º¾é¬åø 0>YUOçÁ·¾êÆv´û½åéM¼x!>{Æ L‰t¾ëÉ5¶> ¨¸_âË=üÖ®Csª{¾KúcN–Ñ>{-í¶§¾¡>Îj×0¾”2ù9ã>K«¨{K¾bðBin ¾™˜¿^¾©Ç>Ð5“Û* “¾ÑN¥lÎÁ1>ÌWf1v5$¾Âî~ÞþN³>±÷ L»¬¾SM{]ñﾩôcνÞ>´Á“Þâþ.¾¶æœS% é>´#¹á¹ɾ«³Ÿ,e‡W>—KÚÎ¥>‚P«u3¾¡ž–”Ð u>©s0Ú×¾«-àß8¬>§)IÁÍ©-¾¦÷Bäñ>!èõ¬Þs>ˆ‚Ð ({¯¾œÌš­x>¢ÉÓÃ*•Ã¾¢öÛ–¶>žLÙrúöB¾äýŠÇwš>MÝf3m‡Í>Œ!bäÙ×þ™äËO÷²>çÐjÆfÒ¾œœ¥x°>”Xባ=V¾rŠƒ(¾pU [>Ž„ ØHá~¾–}x«Å–>˜nÿ2¿y¾”òrXf>Š"<ªS—¾eÑ‘uït€¾~ÅŸ$‘“>ÑIŸ (C¾”8áó=[>“ÙùN£ìt¾Ž0Õofb¶>|ƺػà>_p€L3¾„”ºâ> Ù>êâ­œ@¾‘α*™à>$Q×]㬾ƒÑO í.>aÏ$±”1>vªKsèJ¾‡ò›ÞB>Ž¢“^Ÿ<¾Ž”*= >†ªËV®¾tŸˆ-u¸¾_âÛäöß0>€à5§®b¾‰o&¸6x—>‹Ò@èQ"p¾‡­séÕÝ>|Qªö̳°¾JS?ß´#¾u¹>‹6qê>„pó½@=%¾ˆïU3ëÄ>‡nÆGƒŒ¾€t‹W ›P>g0[¬‘»O>g²ú:#´¾ÑÏdM>…Ôÿç–72¾†dÄ“2Rü>˜ì:)7ƾqr³·¹”!¾P•…9™Ï>wíˆÄè㾂É3‰i>„çSû„Ž-¾êì6KL>uW wÏ(˾@Ab8Žã¾qJäHe߃>î¾a†Ã¾ƒ6wûZÚ>®ô͈]¾w·«äÈ->Zë¨c¡)>gÇ⎱¾zð þ/V}>~Ó×.[u¾ë¾ý>xófÁ v’¾chçm©ü×¾^}sŽõQ>v¬ ×e¶¾»?"¾)>€Shæ»ؾy\/Œæ@$>g±5nç>Q{À!r­ª¾s&•ÍïB>|ÉS~,…›¾~ï7*R$>y0ÓžŸ¬¾jLÇ \ʾ@ÐzÐ[î>pWçÆÁYB¾z:PÊ_rr>}3q£ÜD¾xžÔü㊟>k–Vè„5>Š$ú¥ðó¾ldÐóöx(>xõÆ©¾4¾{‹GÊìla>wÊ«ôákǾkÖrië¶>#dŠnœ>iI†\—lü¾vW€ …&Ë>z¼­Øa¾vË$·,M>kD@zØáؾ0ž½WȾg:x[NÊ>túôÁg>¾x¡,^YQ,>u®3ä³/¾j×x`ì>0q ÌôØ>f9‡“¾sôfX9à0>waõsÕ®¾t{HS0!>h>_9®Ío¾$4P•Z¹z¾e±Å“ù?Ü>s6µ§Ã&/¾v?zþœ²>s3¨¨Ý.¾eùŸ«r¹½÷£~r ÃÃ>eô 49 ¾r²©!q3>u/꿇ûç¾qÕ ”šúö>cC².|ôÁ>1†W<œ¾f¹Ÿ@fí:>rWÔš›˜p¾t&‘î™Æ3>pZ â²G̾`$À³ú÷¾B¨,’ÃðÏ>gàPÂyôf¾r+’U™ >s9¬kL¼¾mw—§š¾ò>YC4|éwâ>NÊæl·¾iEZw'š>qÔª=™õ¼¾qìUµ‚Ö£>iå‡@ @¾Q€ Ý}1¾UJâöGu>jÁ×¾ô§¾q„íÚ{\I>pœo€ ªL¾eñ½ô”2’>B(í驃>[à%xÓà„¾l,s·»f!>q)ùâr¾n-?â$H£>a“y–Óå^½ÞÿaÅZ…¾a?¡ãæÄ>mV¾~IÍN¾paA( Êz>jœÙR5d¬¾Y•«N–wk¾BY%:<Öþ>dhñ«­P¾nD6n¯&>nÉŽðóŽ¾fu˜%à®>N…¶@©lÐ>R‡š5£€z¾g8ÂRƒL²>n%Ø–z÷û¾lSÑN/G>a±¥.Ÿ¾1~Šßßg¾[‘Ë÷¥!>iuöÕ¾äH¾mgÖ)Qˆ>hƒ£ÂP¾X®ôvæýÚ¾;¶ˆÍNÞ>aê |€¾jã»tP >k¨xÃÐö¾d´,Õ1]>Jþz$*>Q¸øšë £¾eaªÞ!Ü>kCÝÚªú´¾hË”>œ-›>]šÞéÒ’2¾ xüôO™¾[çyÝ=èI>gâ »¾æ¾jbиõÈ7>dâßeľQ¥-sè-”¾FЫgØF#>bP'ÏÍZ¾i!‚rÝÓD>hs:šÓÞ¾_>KÕ̆>3·8« >Væ!ËÔ´!¾e’÷kÞ®>hÞ/0,bx¾d]°Ãê•>SÔhéò>@–S——¾`e>SX¸ô>g^GŽ´· ¾fë§Ú£² >^„ûä–#¾6íx;‡f¾Tœ¤èør>dmeÿ² ¾gd”éCÈ>c@Û=g¾Rò 5!ݾ?¡h­¦^>_¹ÒÚN¾f/‚¸>eu°•q5 ¾[üâ•vîA>0ðkN)al>T£¿ñƒµ¾cP£8ý>fiÕ„¾a‘.šzÝ>NÍì^6Ä>CŒ€>—°¾_%Ùþ>e.¼uý“¾c¹K;ë/>W㦾Q’¯<«¾V~hœc®š>cTgó¾dŽ=ý” >^œõ¾Y¾DXæÞq¾JÔž8W>`.xW"Àž¾d;°ñ*³;>a‘Þ" ôÕ¾R@‚=L¾2qÝy¡>Y’³ø÷h¾bøŽ–†Ó>bËX˜ßÃv¾X»Û;Ù®>.íŽÀ(§>RH®ÎHq ¾a2lÁ >cƒ›˜»¾]ÅKåWÿ>F#»(ä¤Y>Eí›p+ÒÀ¾]ýUóºI>b¢ÀÖ8^¾`dwvQ>QB¦]p¸">/´ªÿ @¾W¦“Ú ´>a‘/‹¾¶¶¾aI®õl³ >VAÒå½&Ù¾#¹jpDy‹¾Qýf+9‹K>`¬y>¾a+©Ø*>ZQÁPŸ¾@Q‡–Vî¾HÍ#Z¾ ß>\ƒ cË­ý¾aTOÇá^>\ËÍ«Nÿ¾J:.†¾<[0È¢T>X•åªGÿ)¾`³ŒÝ@¸>^‹|ˆ“¼¾QM|,!ï¾!ãlèæ>TŽ_°ÝN¾_’ðÖ¿’>_u(¶UѾTTgƒñøç>!_‘H&>P—±ÝŒ¶¾]]*Íï>_°ú,fÞ^¾VÔßV’’>7öÁT5ïá>I¥w›]¤ã¾ZðêÞø´ï>_e-*\¢)¾X¬½±wÂÕ>B~&¶Ù¿·>B®cg ¾XqÑÀUi>^´gkr¼¾YòðóXcé>Gé€ÃÈÊ>8Ì^Wõ¾Uû@çxHÞ>]¾&‘Œ‹¾ZÀQª#"Õ>LQ4V¢Í=>+sE{Æ7¾S£gœèÏ>\ž)ï/wϾ[,!J²Ú˜>OË©F]0>ÉÐj0Ú¾Qyò$¹Q7>[jH;¸~‰¾[K1Ï>Q9û¶(ë¾}¢~…o¾Oè沨>Z4®¾[0¸âTìn>R1¹Ëµý2¾$µäQ!‹¬¾K¯³ë{]X>Y àÑ©¦R¾Zí*ù >RÚ8¹dþ¾/¬pì;¾HÔ~dƒ>WùÏ¥C}¾ZŒïËÓ!Ë>S>hålÏɾ3[o¬¸gÛ¾FO~(á>W«Ü‘¿à¾Z®–Y$>ShÄ"H6ÎQ‹E¾D¶YWè>Œ>V4³ø U[¾YŸk ƒúq>S`±ð „¾7‹X‚kCò¾CoðA(Ï>Uˆ‚ŒP¾YqÚú >S,zø?/¾8 Ï< -¾B§8I"7Æ>Uk3õA ¾X›ßŒ«ë>RÑZë°xö¾7™·­CÖǾBVÄ•#¬•>TžÎñw+¾X³,]©w>RQˆ¢Ê ܾ6?1ÖêE¾BvÄ â#Ì>T]<Œî±±¾W“o뱑>Q®s»Mù¹¾4 TµŒà¾Bý/=¸€G>T8¨Ér®´¾W XJ Lò>Pèï;¢R¾1–>`ˆp¾Cá¹c8Ö†>T,„•µ7ù¾Vyš6&ºØ>OþÐäUö¾*›8›ªšé¾EŸM÷Í>T1ÂÁÙü^¾UÛ„iâñ>MàeŸV¾!¨£¢˜þþ¾F—dwÔkê>T@í75O¾U*¹¿ mz>Ks°ìQ¾ x1Ë®ŒT¾HNyÞÙS“>TR)êËR¶¾T`wUp\²>H²á>m“>º¬øHÓ¾J.÷=kÊÀ>T[Lº# ‹¾StÅ_g;®>EšÓÂÄÁ> Õ,ýþá¾L%!ôk þ>TQçE3S¾R`ê‚!ö>B'ïÊZD¯>.h«ÌI¾NW]sÛ>T+‚c¾Q·\zg><¶hžzP;>6Y ÒôÑÀ¾OÿÄnoN!>SÛЖÒQJ¾OH"Ð|>4n0+»2M>=±³;(på¾PØC8Ñ>SWÙ¦´ù¾KÞõÇ ZI>'£Cc»Ù>B‡ûÈ]I‡¾Q‰ú@ ÿL>R’žb·kϾGùsvþ>úªíñê>FŽ\Æ%¾Rœ«sÒ>Qƒe÷¬' ¾C”ýÍ(—¾£µf;º>I}ÔgÙÃ÷¾R:¦¾S}V>P ׽ܥ¾=p²ån³­¾1—í ´a‚>L~:!ù0ϾR7ÇŒR©>LË€ŽšZ¾2áìpØÔY¾;m ŽÆ¹¥>Nú<)½¾Q•õÞqÔý>Hžl–’EY¾¡Tm‹ §¾BkGhFEè>Pcnr™Žé¾P¡.ó¾>C¿`™éwp>½ÏSÒž¾F¹ü¶j1>PÝjMš¿ˆ¾Nho™D²!><ì‰`ŸJ>/O_’‘§¾JnÆ`>~>Pد¿¨¾J¾J—ˆ›0x¶ªFS>:ÿŒC2±ª¾MTô„h¶>PDÀ[/ÿ€¾EÔËÃu> ë(déØc>BÀ<—àfs¾O25niJú>N-ë*á¾@7µ^"_Œ¾"tÑE;r>GPëv ¸4¾OÙ’¯lµ>J™°;¾3Ð;CÖß¾5äõå8o$>JìbäÒ)ѾO"ëúiŽò>EÔ k焾ùÑ­(qó¾@ÏÄÔØòr>MLêSòE¾LôÜÎ2¨>@õ·°Í>¥Ž´h¼¾EÛ»´„ ¬>N6»¬³Dò¾IM8è«Û0>2³PX¼3>5-8%<\¾I¾Ý†bŽ>M~äzé7¾DAép½Þ>^Kçåîq>@¿2Ì‹}7¾L&ë…ª½—>K^ DG ¾<Ýë€^¾$ƒß| Á>EßYñ…™¾LÏ‹ü%>FìÛ‘¾+žzá ß¾8%Ô(p‰X>I8<}}f¾K¢“qw¶>AF§ˆD,=ôÇ †–±ê¾B(úS¢Tø>KníúJG¾H^&±ëcô>4Ñ3Ú<¤3>0>JýBÎǾFá?¤ô†;>KB!èm»1¾CY€Ï<Ã>I÷ÁÀ/>=ÖK(¾IÆÝér>Hë‘Rl¾9 î†|Ù¾$GñÌÛ>Dp6 MË1¾J€³ê)v>D€ÊÐ g¾$ð[ÐnR¾8žW,TÃÎ>H":a¶jF¾HãÑê W><”“¬x®—> ´;:×¾BlÌYU->I•8¡à¾Dõ,¢},>+!‹˜?UÂ>4ÏÐÁëɾF³éÈ+8>H{ñô¹†ø¾=ÿÿ¸¾)@ó§²>@ìÑ=µŠR¾Hž+Ÿåã>Då€oçpþ./«[5§â¾2gÙ+|) >E”:ê>)[e_Â&=ôßz†àʾ?ó49 «{>GÃêŽÐ ¾Dp"uBkÙ>.sj$ëEU>1Y““•8õ¾DÍaÕ;¶>G Î`&\¾=>àýp ½õkð¬ã>?¦:2¾GkèéBã>C§>Ä;Ž¾,Cùfa¹ð¾1„…3ý©Ó>DZšóDâ·¾FGÆ^‡Œ>;_CϸôÝ>öY`(hç¾?+¦ €eø>Fd‹Íª=¾¾BŽ¯‡_ì>'Ïžbz:>2Å~¾Q1¾D*Ci.ÑÛ>EJ¼¯È«G¾8“OJ•ÅV¾YÞY‹>@Z ¨`¾EÇ}ÿç>Aæê ræ¾!IR€^0¾4ì }G>D#Jéa²9¾Dyë¸Õ>4ÜÆÃ=+> ¹udJ%¾@¯geDT>EpúDÐõ¾>å>àù>›AO’( >7Ákt¾D!_-™x>B›uØ §¾04›<ð¾a¾(ÿ]àhÜY>Az†<ã¾D)˜poz†>:c«•Ú˜=æcFÈàú“¾:ú4°roÖ>Cúž´M•¾@³]¼u:">%;­Ì¥H”>10 0¾B5v‡wñ»>BÜ×G“Êý¾4”ªpˆÊ±¾ëRîd>><ŽÏ™ž¾C| ~0]><ˆ w’|–¾œ?U!¾6™ w˜]>B¦äÆ=™¾A1œÄÔ>, d°˜–>)ˆÛf}œ¾@Š äd?â>Bt†+I²&¾6w0óJ„x¾þ(ª\ >:΢'ù¾B”gêŸÄ->=hu…Ðо›L6Óð¾3"—õ>A~Æ"˜í¾@°Ønï>.HP=y#>%ÞôªEj¾>¿ý6olC>A½ÓῺ¶¾6q£zO`f½ûÇŒíæñÄ>8᜹à¾A²Ç,þá><‚ú\K¾ÞÕi­FF¾1à™Hª÷Ô>@§ö¾Æ›l¾?ß#0:†>,Ãêƒu[Ê>$z/!Æ(¦¾=…Ó­ekt>@áx^¤•q¾4çsåO¬¾… ü½3>8båáÉ¢¾@éBýÓ«>: wk5¾_„r6(¾2Kˆ7…)>@$:y¥¾=§@4Â3·>(I1«>'Jã‡?ê¾=0F@ŸÏ>?µlÞÅz¦¾2F”Vb¾;ô!×:Ú>9…è#w¾@ eúR>6éÐ"0  ½þäác¯¾3øh&÷j_>?g¨éÝõ—¾:›<-ÐÛ> J5Ö`>,Ää$ñ…¾=V/(§qþ>= 9ä×]¾+…%Í÷ID¾!²:óHc>:AŒçž¾>Cv82Ã>2PX‹Ó>uH3fQ¾6c=Ö*”>>SÚζóê¾6rTc*í>Š"§F1ÿ>1õ±¯$ž=ZHco_š>9\"þ¨'¾ QhÏ“¾*\ÓÛž&>;zî³Ý‘o¾;M-òUw>)©û$Ý> …Yèÿ¾8Þ°¶Öª_>5°?ýç¾¾4.’ÚY%+½õ0˜ &-8¾2jÉwûQ>;ÓŽþK¡–¾6Æ¡Ð!ê>Ù‚@f>,‚#zL3¾:†¦Ë ™>8¥Må«î¾#eÚ©s?q¾$”züï{>8ª‰1‡ ¾9ÑÓ¥¢_I>*q§2ó—ù>Oˆ˜5›ª¾6\øㆲÐ>:ZL¦Ðw”¾0>u•/6¾Ž–9s>3»/Σ±C¾:NÔ3 ô‘>2¿^Ø2„½óÏ'ßh¾0à^&ÜÒA>9Á|ÓÓ+ܾ4»Ãä^>ei)õg—>+ÉyA~ľ8Å,ýËœÄ>67ü×Θ¾ϪFøƾ%º{5í^>7mT` ž‰¾7<,KŽ2>$óà•_”>p4æ6¾5͈.˜>7Òúëúؾ)Ϙ>zÓL¾­ë(ßY>3ø4ÇKž8F“f¯ä>-øÄýȤ>?Ç—µºÅ¾1ÿp•nê>7è:rÒ¾0¸êA2Û!=Ý$XDË>/á·˜(«¾7~š®ó|M>2 îгË{¾õ'ÊRؾ+²¡ø+ت>6×ê7]‰A¾3:*‘ïõÊ>Jµè´ E>'‡Y¢”–¾6X¼SÔ>4 ¶ ‘*±¾;f„õδ¾#sÍŽ€x>5Àv.¾4UPsF>!¤ÔMºF> Ç.€°ª¾3춋Aþy>4õ†–í¼Ã¾$»t;¾˜BnaO>2Ä'óÎí¾5Lqá>'e#Žy|n>›¤íz_¾1‘žŽh>5Þ8‹¾)¨AvA@è¾?<#Ü >0[Ò0E€¾4ð_H¶Ž6>+ŒýJ$Ù=ð¨c4^'i¾.RQý¦h>4¬éo!ÌC¾-§ëªü»=Óü šXê>+ý³9m.¾4Sólq´†>.[²÷.Àÿ½øljæt¾)Ãøóóx>3êÉÙ×=¾/T¹>ÑLÞŽ 4>'¨"¼Í¾3uÉD±¹Š>0'}_­õ¾ ZëA>š[¾%°iµµÎ$>2øü¸—<¾0FLüR­b>q;oÔÚ>#Þó4?>¾2xvÑaË>0n³žÑ,¸¾;Kݨ¹}¾"6Àcá÷>1ø’œ/p¾0‚þð¾Í‘>‘H/¶ž:> º7j°¾1z’=û0m>0…áñÞ#:¾w£Qœv¾×lþƒd>1ôÝcXœ¾0yph¤>ôUÀ1à>“ZŽI… ¾0G¦n©ö>0_ª½˜s]¾3áE»¨¾¥z@w‹ó>0#ucü¯¾0:à¼.’Z>ÑNlá~6> ÷‘±Ù¾/o8ðyÍ>0 K`:U¾A¯d‘¾‹Æ]÷#>.ÊV[Iê:¾/±I©aF>d¼¸ÇŽß>˺ bËo¾.(º <ÌG>/:¯JÎÁ¡¾<àM…’æ¾$ciJN>-™ëNºŽ¾.·˜G"´>ÍZ œq„>ÇÃ]¸c@¾-d(§>.(!dòÇ®¾4k~3¯¾¯ye; >,­²$Ø„w¾-OÈ‚,>, ë@?8>Ö1'؃¾,MÓ›µÏ,>,èWÅÑð¾î¡Ù@Û¾8¨g8óÇ>+ûë]R<“¾,9a>n³>¤ZqíN>ÔÎ?QÛؾ+¶wsÇZ>+öFÞ¾ ù­lH"¾¦òmã>+zg¨8[®¾*·*pí¯>>©©$§¨>¨¹áŸE ¾+CÔ½sb>)ßÂK©ðŒ¾+R*Ë8¾(÷ûóI_> ã7ôü¹>EßóŒu¾*Ù¬^¼HÆ>'ÿ{aøè¾ ZT¢ñú¾Îœ2Ÿ¬>*¡BãH*(¾&õ3gðQå>H½VÈš>þ~a^¸Ë¾*báéEE>%Öø‚‚’¾âL A´¾Œ,w´Åú>*8‡Fw ¾$¡ÿÕ&T-=öV{ÁÝgá> Ûا£k¾)ÂFþ®1>#Te+ÕC½ä·#—£Çy¾!Z2þ ´>)V‚ª¤úv¾!í”Ý\þÕ½Às‹fí¨Ÿ>"í–SÕ¾(ÓÁ<`> n&c}ˆ:=í™;ºu߶¾"ÔøfÜð°>(7vÿ€#ݾ¬t¾sP½ûÈ,ÜÑJ¨>#~sÍB×¾'~ºÏ®>Kˆ»s~>v-O"¾$Ñ:î>&¥·„Žæ´¾·.czê6¾ ¹XF>$’"뇉ݾ%¨OzY>òÀ7—º^>ÈÕʺj¾$ïÂ1bj’>$ƒ¬€ü2¾JXB°¾ôôà@>%'Ö)‰6¾#6žSü>äq«œk>ýU$~"è¾%5´[èÜ,>!Á‹Ö³5½û Iö†ý¾Ö&äZ ¯>%ÉWèFS¾ $ÿ“Z0ú=änñöfá>tò%¶¾$ÄI´Z™>¿×F»=Û1ÒYÕ™Ú¾Ê&Ë’+Ñ>$<áù뮾ïE݇^œ½÷¹3œHµ> dgõÕ=¾#{oÞ”‹>Õ= >ò>&L¢O¾!/¬&b½Ì>"}ðÈž7/œzϾ åþ6p¯>!¿Žº} ñ¾!C(Û£nz>÷ë¨3‚>ÌÎ9~î¾"„îžñ@>œ›7×½ýmèqë?d¾<‚u¶b>"aãôɾCöíªcÃ=årºŸÜ?Q>LØÏî†e¾!Ù“3˜Ø>ƒaî´=ß Ä:Íi¾ë»Ð‚d_>!N­—“·D¾d`úó¹½ú"kK|å!>çJpž=¾ uV;C"K>êëŽæ6>È° ©:0¾ˆ4h$›Û>›°Ó+NV¾–-]¾ ãÀ»^ô>c} 'ªW¾·Ž&ÆtW=ùüýþºx>–è­ ñF¾œ¤"…>K—v¬²j½ÚÂ8'žk¾»çm Ìò>ÔLq¬¾hžýA|½èS`©gý>L‰1¿¾¿çöñÔ>"-Ö9öo=þ|²¿eè¾4çµ>ÈÞ: ?¾óû…ß羺&ø8Rü>aûÛõl¾#{lé=û/&…º€>VÌ]%¡u¾Åò…bÊ>ÞœÛ÷{½ß­ž-º¾é¬åø 0>YUOçÁ·¾êÆv´û½åéM¼x!>{Æ L‰t¾ëÉ5¶> ¨¸_âË=üÖ®Csª{¾KúcN–Ñ>{-í¶§¾¡>Îj×0¾”2ù9ã>K«¨{K¾bðBin ¾™˜¿^¾©Ç>Ð5“Û* “¾ÑN¥lÎÁ1>ÌWf1v5$¾Âî~ÞþN³>±÷ L»¬¾SM{]ñﾩôcνÞ>´Á“Þâþ.¾¶æœS% é>´#¹á¹ɾ«³Ÿ,e‡W>—KÚÎ¥>‚P«u3¾¡ž–”Ð u>©s0Ú×¾«-àß8¬>§)IÁÍ©-¾¦÷Bäñ>!èõ¬Þs>ˆ‚Ð ({¯¾œÌš­x>¢ÉÓÃ*•Ã¾¢öÛ–¶>žLÙrúöB¾äýŠÇwš>MÝf3m‡Í>Œ!bäÙ×þ™äËO÷²>çÐjÆfÒ¾œœ¥x°>”Xባ=V¾rŠƒ(¾pU [>Ž„ ØHá~¾–}x«Å–>˜nÿ2¿y¾”òrXf>Š"<ªS—¾eÑ‘uït€¾~ÅŸ$‘“>ÑIŸ (C¾”8áó=[>“ÙùN£ìt¾Ž0Õofb¶>|ƺػà>_p€L3¾„”ºâ> Ù>êâ­œ@¾‘α*™à>$Q×]㬾ƒÑO í.>aÏ$±”1>vªKsèJ¾‡ò›ÞB>Ž¢“^Ÿ<¾Ž”*= >†ªËV®¾tŸˆ-u¸¾_âÛäöß0>€à5§®b¾‰o&¸6x—>‹Ò@èQ"p¾‡­séÕÝ>|Qªö̳°¾JS?ß´#¾u¹>‹6qê>„pó½@=%¾ˆïU3ëÄ>‡nÆGƒŒ¾€t‹W ›P>g0[¬‘»O>g²ú:#´¾ÑÏdM>…Ôÿç–72¾†dÄ“2Rü>˜ì:)7ƾqr³·¹”!¾P•…9™Ï>wíˆÄè㾂É3‰i>„çSû„Ž-¾êì6KL>uW wÏ(˾@Ab8Žã¾qJäHe߃>î¾a†Ã¾ƒ6wûZÚ>®ô͈]¾w·«äÈ->Zë¨c¡)>gÇ⎱¾zð þ/V}>~Ó×.[u¾ë¾ý>xófÁ v’¾chçm©ü×¾^}sŽõQ>v¬ ×e¶¾»?"¾)>€Shæ»ؾy\/Œæ@$>g±5nç>Q{À!r­ª¾s&•ÍïB>|ÉS~,…›¾~ï7*R$>y0ÓžŸ¬¾jLÇ \ʾ@ÐzÐ[î>pWçÆÁYB¾z:PÊ_rr>}3q£ÜD¾xžÔü㊟>k–Vè„5>Š$ú¥ðó¾ldÐóöx(>xõÆ©¾4¾{‹GÊìla>wÊ«ôákǾkÖrië¶>#dŠnœ>iI†\—lü¾vW€ …&Ë>z¼­Øa¾vË$·,M>kD@zØáؾ0ž½WȾg:x[NÊ>túôÁg>¾x¡,^YQ,>u®3ä³/¾j×x`ì>0q ÌôØ>f9‡“¾sôfX9à0>waõsÕ®¾t{HS0!>h>_9®Ío¾$4P•Z¹z¾e±Å“ù?Ü>s6µ§Ã&/¾v?zþœ²>s3¨¨Ý.¾eùŸ«r¹½÷£~r ÃÃ>eô 49 ¾r²©!q3>u/꿇ûç¾qÕ ”šúö>cC².|ôÁ>1†W<œ¾f¹Ÿ@fí:>rWÔš›˜p¾t&‘î™Æ3>pZ â²G̾`$À³ú÷¾B¨,’ÃðÏ>gàPÂyôf¾r+’U™ >s9¬kL¼¾mw—§š¾ò>YC4|éwâ>NÊæl·¾iEZw'š>qÔª=™õ¼¾qìUµ‚Ö£>iå‡@ @¾Q€ Ý}1¾UJâöGu>jÁ×¾ô§¾q„íÚ{\I>pœo€ ªL¾eñ½ô”2’>B(í驃>[à%xÓà„¾l,s·»f!>q)ùâr¾n-?â$H£>a“y–Óå^½ÞÿaÅZ…¾a?¡ãæÄ>mV¾~IÍN¾paA( Êz>jœÙR5d¬¾Y•«N–wk¾BY%:<Öþ>dhñ«­P¾nD6n¯&>nÉŽðóŽ¾fu˜%à®>N…¶@©lÐ>R‡š5£€z¾g8ÂRƒL²>n%Ø–z÷û¾lSÑN/G>a±¥.Ÿ¾1~Šßßg¾[‘Ë÷¥!>iuöÕ¾äH¾mgÖ)Qˆ>hƒ£ÂP¾X®ôvæýÚ¾;¶ˆÍNÞ>aê |€¾jã»tP >k¨xÃÐö¾d´,Õ1]>Jþz$*>Q¸øšë £¾eaªÞ!Ü>kCÝÚªú´¾hË”>œ-›>]šÞéÒ’2¾ xüôO™¾[çyÝ=èI>gâ »¾æ¾jbиõÈ7>dâßeľQ¥-sè-”¾FЫgØF#>bP'ÏÍZ¾i!‚rÝÓD>hs:šÓÞ¾_>KÕ̆>3·8« >Væ!ËÔ´!¾e’÷kÞ®>hÞ/0,bx¾d]°Ãê•>SÔhéò>@–S——¾`e>SX¸ô>g^GŽ´· ¾fë§Ú£² >^„ûä–#¾6íx;‡f¾Tœ¤èør>dmeÿ² ¾gd”éCÈ>c@Û=g¾Rò 5!ݾ?¡h­¦^>_¹ÒÚN¾f/‚¸>eu°•q5 ¾[üâ•vîA>0ðkN)al>T£¿ñƒµ¾cP£8ý>fiÕ„¾a‘.šzÝ>NÍì^6Ä>CŒ€>—°¾_%Ùþ>e.¼uý“¾c¹K;ë/>W㦾Q’¯<«¾V~hœc®š>cTgó¾dŽ=ý” >^œõ¾Y¾DXæÞq¾JÔž8W>`.xW"Àž¾d;°ñ*³;>a‘Þ" ôÕ¾R@‚=L¾2qÝy¡>Y’³ø÷h¾bøŽ–†Ó>bËX˜ßÃv¾X»Û;Ù®>.íŽÀ(§>RH®ÎHq ¾a2lÁ >cƒ›˜»¾]ÅKåWÿ>F#»(ä¤Y>Eí›p+ÒÀ¾]ýUóºI>b¢ÀÖ8^¾`dwvQ>QB¦]p¸">/´ªÿ @¾W¦“Ú ´>a‘/‹¾¶¶¾aI®õl³ >VAÒå½&Ù¾#¹jpDy‹¾Qýf+9‹K>`¬y>¾a+©Ø*>ZQÁPŸ¾@Q‡–Vî¾HÍ#Z¾ ß>\ƒ cË­ý¾aTOÇá^>\ËÍ«Nÿ¾J:.†¾<[0È¢T>X•åªGÿ)¾`³ŒÝ@¸>^‹|ˆ“¼¾QM|,!ï¾!ãlèæ>TŽ_°ÝN¾_’ðÖ¿’>_u(¶UѾTTgƒñøç>!_‘H&>P—±ÝŒ¶¾]]*Íï>_°ú,fÞ^¾VÔßV’’>7öÁT5ïá>I¥w›]¤ã¾ZðêÞø´ï>_e-*\¢)¾X¬½±wÂÕ>B~&¶Ù¿·>B®cg ¾XqÑÀUi>^´gkr¼¾YòðóXcé>Gé€ÃÈÊ>8Ì^Wõ¾Uû@çxHÞ>]¾&‘Œ‹¾ZÀQª#"Õ>LQ4V¢Í=>+sE{Æ7¾S£gœèÏ>\ž)ï/wϾ[,!J²Ú˜>OË©F]0>ÉÐj0Ú¾Qyò$¹Q7>[jH;¸~‰¾[K1Ï>Q9û¶(ë¾}¢~…o¾Oè沨>Z4®¾[0¸âTìn>R1¹Ëµý2¾$µäQ!‹¬¾K¯³ë{]X>Y àÑ©¦R¾Zí*ù >RÚ8¹dþ¾/¬pì;¾HÔ~dƒ>WùÏ¥C}¾ZŒïËÓ!Ë>S>hålÏɾ3[o¬¸gÛ¾FO~(á>W«Ü‘¿à¾Z®–Y$>ShÄ"H6ÎQ‹E¾D¶YWè>Œ>V4³ø U[¾YŸk ƒúq>S`±ð „¾7‹X‚kCò¾CoðA(Ï>Uˆ‚ŒP¾YqÚú >S,zø?/¾8 Ï< -¾B§8I"7Æ>Uk3õA ¾X›ßŒ«ë>RÑZë°xö¾7™·­CÖǾBVÄ•#¬•>TžÎñw+¾X³,]©w>RQˆ¢Ê ܾ6?1ÖêE¾BvÄ â#Ì>T]<Œî±±¾W“o뱑>Q®s»Mù¹¾4 TµŒà¾Bý/=¸€G>T8¨Ér®´¾W XJ Lò>Pèï;¢R¾1–>`ˆp¾Cá¹c8Ö†>T,„•µ7ù¾Vyš6&ºØ>OþÐäUö¾*›8›ªšé¾EŸM÷Í>T1ÂÁÙü^¾UÛ„iâñ>MàeŸV¾!¨£¢˜þþ¾F—dwÔkê>T@í75O¾U*¹¿ mz>Ks°ìQ¾ x1Ë®ŒT¾HNyÞÙS“>TR)êËR¶¾T`wUp\²>H²á>m“>º¬øHÓ¾J.÷=kÊÀ>T[Lº# ‹¾StÅ_g;®>EšÓÂÄÁ> Õ,ýþá¾L%!ôk þ>TQçE3S¾R`ê‚!ö>B'ïÊZD¯>.h«ÌI¾NW]sÛ>T+‚c¾Q·\zg><¶hžzP;>6Y ÒôÑÀ¾OÿÄnoN!>SÛЖÒQJ¾OH"Ð|>4n0+»2M>=±³;(på¾PØC8Ñ>SWÙ¦´ù¾KÞõÇ ZI>'£Cc»Ù>B‡ûÈ]I‡¾Q‰ú@ ÿL>R’žb·kϾGùsvþ>úªíñê>FŽ\Æ%¾Rœ«sÒ>Qƒe÷¬' ¾C”ýÍ(—¾£µf;º>I}ÔgÙÃ÷¾R:¦¾S}V>P ׽ܥ¾=p²ån³­¾1—í ´a‚>L~:!ù0ϾR7ÇŒR©>LË€ŽšZ¾2áìpØÔY¾;m ŽÆ¹¥>Nú<)½¾Q•õÞqÔý>Hžl–’EY¾¡Tm‹ §¾BkGhFEè>Pcnr™Žé¾P¡.ó¾>C¿`™éwp>½ÏSÒž¾F¹ü¶j1>PÝjMš¿ˆ¾Nho™D²!><ì‰`ŸJ>/O_’‘§¾JnÆ`>~>Pد¿¨¾J¾J—ˆ›0x¶ªFS>:ÿŒC2±ª¾MTô„h¶>PDÀ[/ÿ€¾EÔËÃu> ë(déØc>BÀ<—àfs¾O25niJú>N-ë*á¾@7µ^"_Œ¾"tÑE;r>GPëv ¸4¾OÙ’¯lµ>J™°;¾3Ð;CÖß¾5äõå8o$>JìbäÒ)ѾO"ëúiŽò>EÔ k焾ùÑ­(qó¾@ÏÄÔØòr>MLêSòE¾LôÜÎ2¨>@õ·°Í>¥Ž´h¼¾EÛ»´„ ¬>N6»¬³Dò¾IM8è«Û0>2³PX¼3>5-8%<\¾I¾Ý†bŽ>M~äzé7¾DAép½Þ>^Kçåîq>@¿2Ì‹}7¾L&ë…ª½—>K^ DG ¾<Ýë€^¾$ƒß| Á>EßYñ…™¾LÏ‹ü%>FìÛ‘¾+žzá ß¾8%Ô(p‰X>I8<}}f¾K¢“qw¶>AF§ˆD,=ôÇ †–±ê¾B(úS¢Tø>KníúJG¾H^&±ëcô>4Ñ3Ú<¤3>0>JýBÎǾFá?¤ô†;>KB!èm»1¾CY€Ï<Ã>I÷ÁÀ/>=ÖK(¾IÆÝér>Hë‘Rl¾9 î†|Ù¾$GñÌÛ>Dp6 MË1¾J€³ê)v>D€ÊÐ g¾$ð[ÐnR¾8žW,TÃÎ>H":a¶jF¾HãÑê W><”“¬x®—> ´;:×¾BlÌYU->I•8¡à¾Dõ,¢},>+!‹˜?UÂ>4ÏÐÁëɾF³éÈ+8>H{ñô¹†ø¾=ÿÿ¸¾)@ó§²>@ìÑ=µŠR¾Hž+Ÿåã>Då€oçpþ./«[5§â¾2gÙ+|) >E”:ê>)[e_Â&=ôßz†àʾ?ó49 «{>GÃêŽÐ ¾Dp"uBkÙ>.sj$ëEU>1Y““•8õ¾DÍaÕ;¶>G Î`&\¾=>àýp ½õkð¬ã>?¦:2¾GkèéBã>C§>Ä;Ž¾,Cùfa¹ð¾1„…3ý©Ó>DZšóDâ·¾FGÆ^‡Œ>;_CϸôÝ>öY`(hç¾?+¦ €eø>Fd‹Íª=¾¾BŽ¯‡_ì>'Ïžbz:>2Å~¾Q1¾D*Ci.ÑÛ>EJ¼¯È«G¾8“OJ•ÅV¾YÞY‹>@Z ¨`¾EÇ}ÿç>Aæê ræ¾!IR€^0¾4ì }G>D#Jéa²9¾Dyë¸Õ>4ÜÆÃ=+> ¹udJ%¾@¯geDT>EpúDÐõ¾>å>àù>›AO’( >7Ákt¾D!_-™x>B›uØ §¾04›<ð¾a¾(ÿ]àhÜY>Az†<ã¾D)˜poz†>:c«•Ú˜=æcFÈàú“¾:ú4°roÖ>Cúž´M•¾@³]¼u:">%;­Ì¥H”>10 0¾B5v‡wñ»>BÜ×G“Êý¾4”ªpˆÊ±¾ëRîd>><ŽÏ™ž¾C| ~0]><ˆ w’|–¾œ?U!¾6™ w˜]>B¦äÆ=™¾A1œÄÔ>, d°˜–>)ˆÛf}œ¾@Š äd?â>Bt†+I²&¾6w0óJ„x¾þ(ª\ >:΢'ù¾B”gêŸÄ->=hu…Ðо›L6Óð¾3"—õ>A~Æ"˜í¾@°Ønï>.HP=y#>%ÞôªEj¾>¿ý6olC>A½ÓῺ¶¾6q£zO`f½ûÇŒíæñÄ>8᜹à¾A²Ç,þá><‚ú\K¾ÞÕi­FF¾1à™Hª÷Ô>@§ö¾Æ›l¾?ß#0:†>,Ãêƒu[Ê>$z/!Æ(¦¾=…Ó­ekt>@áx^¤•q¾4çsåO¬¾… ü½3>8båáÉ¢¾@éBýÓ«>: wk5¾_„r6(¾2Kˆ7…)>@$:y¥¾=§@4Â3·>(I1«>'Jã‡?ê¾=0F@ŸÏ>?µlÞÅz¦¾2F”Vb¾;ô!×:Ú>9…è#w¾@ eúR>6éÐ"0  ½þäác¯¾3øh&÷j_>?g¨éÝõ—¾:›<-ÐÛ> J5Ö`>,Ää$ñ…¾=V/(§qþ>= 9ä×]¾+…%Í÷ID¾!²:óHc>:AŒçž¾>Cv82Ã>2PX‹Ó>uH3fQ¾6c=Ö*”>>SÚζóê¾6rTc*í>Š"§F1ÿ>1õ±¯$ž=ZHco_š>9\"þ¨'¾ QhÏ“¾*\ÓÛž&>;zî³Ý‘o¾;M-òUw>)©û$Ý> …Yèÿ¾8Þ°¶Öª_>5°?ýç¾¾4.’ÚY%+½õ0˜ &-8¾2jÉwûQ>;ÓŽþK¡–¾6Æ¡Ð!ê>Ù‚@f>,‚#zL3¾:†¦Ë ™>8¥Må«î¾#eÚ©s?q¾$”züï{>8ª‰1‡ ¾9ÑÓ¥¢_I>*q§2ó—ù>Oˆ˜5›ª¾6\øㆲÐ>:ZL¦Ðw”¾0>u•/6¾Ž–9s>3»/Σ±C¾:NÔ3 ô‘>2¿^Ø2„½óÏ'ßh¾0à^&ÜÒA>9Á|ÓÓ+ܾ4»Ãä^>ei)õg—>+ÉyA~ľ8Å,ýËœÄ>67ü×Θ¾ϪFøƾ%º{5í^>7mT` ž‰¾7<,KŽ2>$óà•_”>p4æ6¾5͈.˜>7Òúëúؾ)Ϙ>zÓL¾­ë(ßY>3ø4ÇKž8F“f¯ä>-øÄýȤ>?Ç—µºÅ¾1ÿp•nê>7è:rÒ¾0¸êA2Û!=Ý$XDË>/á·˜(«¾7~š®ó|M>2 îгË{¾õ'ÊRؾ+²¡ø+ت>6×ê7]‰A¾3:*‘ïõÊ>Jµè´ E>'‡Y¢”–¾6X¼SÔ>4 ¶ ‘*±¾;f„õδ¾#sÍŽ€x>5Àv.¾4UPsF>!¤ÔMºF> Ç.€°ª¾3춋Aþy>4õ†–í¼Ã¾$»t;¾˜BnaO>2Ä'óÎí¾5Lqá>'e#Žy|n>›¤íz_¾1‘žŽh>5Þ8‹¾)¨AvA@è¾?<#Ü >0[Ò0E€¾4ð_H¶Ž6>+ŒýJ$Ù=ð¨c4^'i¾.RQý¦h>4¬éo!ÌC¾-§ëªü»=Óü šXê>+ý³9m.¾4Sólq´†>.[²÷.Àÿ½øljæt¾)Ãøóóx>3êÉÙ×=¾/T¹>ÑLÞŽ 4>'¨"¼Í¾3uÉD±¹Š>0'}_­õ¾ ZëA>š[¾%°iµµÎ$>2øü¸—<¾0FLüR­b>q;oÔÚ>#Þó4?>¾2xvÑaË>0n³žÑ,¸¾;Kݨ¹}¾"6Àcá÷>1ø’œ/p¾0‚þð¾Í‘>‘H/¶ž:> º7j°¾1z’=û0m>0…áñÞ#:¾w£Qœv¾×lþƒd>1ôÝcXœ¾0yph¤>ôUÀ1à>“ZŽI… ¾0G¦n©ö>0_ª½˜s]¾3áE»¨¾¥z@w‹ó>0#ucü¯¾0:à¼.’Z>ÑNlá~6> ÷‘±Ù¾/o8ðyÍ>0 K`:U¾A¯d‘¾‹Æ]÷#>.ÊV[Iê:¾/±I©aF>d¼¸ÇŽß>˺ bËo¾.(º <ÌG>/:¯JÎÁ¡¾<àM…’æ¾$ciJN>-™ëNºŽ¾.·˜G"´>ÍZ œq„>ÇÃ]¸c@¾-d(§>.(!dòÇ®¾4k~3¯¾¯ye; >,­²$Ø„w¾-OÈ‚,>, ë@?8>Ö1'؃¾,MÓ›µÏ,>,èWÅÑð¾î¡Ù@Û¾8¨g8óÇ>+ûë]R<“¾,9a>n³>¤ZqíN>ÔÎ?QÛؾ+¶wsÇZ>+öFÞ¾ ù­lH"¾¦òmã>+zg¨8[®¾*·*pí¯>>©©$§¨>¨¹áŸE ¾+CÔ½sb>)ßÂK©ðŒ¾+R*Ë8¾(÷ûóI_> ã7ôü¹>EßóŒu¾*Ù¬^¼HÆ>'ÿ{aøè¾ ZT¢ñú¾Îœ2Ÿ¬>*¡BãH*(¾&õ3gðQå>H½VÈš>þ~a^¸Ë¾*báéEE>%Öø‚‚’¾âL A´¾Œ,w´Åú>*8‡Fw ¾$¡ÿÕ&T-=öV{ÁÝgá> Ûا£k¾)ÂFþ®1>#Te+ÕC½ä·#—£Çy¾!Z2þ ´>)V‚ª¤úv¾!í”Ý\þÕ½Às‹fí¨Ÿ>"í–SÕ¾(ÓÁ<`> n&c}ˆ:=í™;ºu߶¾"ÔøfÜð°>(7vÿ€#ݾ¬t¾sP½ûÈ,ÜÑJ¨>#~sÍB×¾'~ºÏ®>Kˆ»s~>v-O"¾$Ñ:î>&¥·„Žæ´¾·.czê6¾ ¹XF>$’"뇉ݾ%¨OzY>òÀ7—º^>ÈÕʺj¾$ïÂ1bj’>$ƒ¬€ü2¾JXB°¾ôôà@>%'Ö)‰6¾#6žSü>äq«œk>ýU$~"è¾%5´[èÜ,>!Á‹Ö³5½û Iö†ý¾Ö&äZ ¯>%ÉWèFS¾ $ÿ“Z0ú=änñöfá>tò%¶¾$ÄI´Z™>¿×F»=Û1ÒYÕ™Ú¾Ê&Ë’+Ñ>$<áù뮾ïE݇^œ½÷¹3œHµ> dgõÕ=¾#{oÞ”‹>Õ= >ò>&L¢O¾!/¬&b½Ì>"}ðÈž7/œzϾ åþ6p¯>!¿Žº} ñ¾!C(Û£nz>÷ë¨3‚>ÌÎ9~î¾"„îžñ@>œ›7×½ýmèqë?d¾<‚u¶b>"aãôɾCöíªcÃ=årºŸÜ?Q>LØÏî†e¾!Ù“3˜Ø>ƒaî´=ß Ä:Íi¾ë»Ð‚d_>!N­—“·D¾d`úó¹½ú"kK|å!>çJpž=¾ uV;C"K>êëŽæ6>È° ©:0¾ˆ4h$›Û>›°Ó+NV¾–-]¾ ãÀ»^ô>c} 'ªW¾·Ž&ÆtW=ùüýþºx>–è­ ñF¾œ¤"…>K—v¬²j½ÚÂ8'žk¾»çm Ìò>ÔLq¬¾hžýA|½èS`©gý>L‰1¿¾¿çöñÔ>"-Ö9öo=þ|²¿eè¾4çµ>ÈÞ: ?¾óû…ß羺&ø8Rü>aûÛõl¾#{lé=û/&…º€>VÌ]%¡u¾Åò…bÊ>ÞœÛ÷{½ß­ž-º¾é¬åø 0>YUOçÁ·¾êÆv´û½åéM¼x!>{Æ L‰t¾ëÉ5¶> ¨¸_âË=üÖ®Csª{¾KúcN–Ñ>{-í¶§¾¡>Îj×0¾”2ù9ã>K«¨{K¾bðBin =ò ÆŒ{‘> µb1Û*µ¾rXìÃ+>&fË=!y“£)0ž¾ÄuLèb>¸ÂeÖÂì¾ P‹Çó®=½ñèÍ68³Æ>ê|"°¾%’Quã>ÑΗäb”>3Óv f¾6ï!çž>É-„n½õÕàT:ÿ?¾j¶»@u>ãý Å'¾½C” V0=ÏŸ-ÏÖÈ|>PP“ؾb¾ùW > H•|€jß=êˆYؾT‡h _M>½¶B·¾M5Ca¿½ýŠ6J>¤¾±ž¾ QB•Y=óÉ yJ‚%>lš•(¾ ÆG;°n> `HÙCþ8½Ç)\YQ¬¾ ñÎíÂ#>‡>E*ö¾†½Fؽêyvh3ÍV>ÜÈU>¤N¾! JíÉf=ýâçßéÁ=ûÎÊ „D¾€è ºu> å?.ý/<½ì)‰7µz¾ î„ÿfŒ>¨^ËFfB¾;´æì/½·ýF4@ý>¾'ó‹²¾ÔßÓ³> nÀ0â»=ðS`¤¾ Ë¥NiÄÉ> °Óä b½ôñÍÛ!¨]½ü¯8¤š§>  ±úF¾"™W6=Ù”Ùr˜'é>lõfÎë¾ ™Õá>z£°=ÞDÃÓѵ¾þ ûíÛ.> m3ÕŸq½ø9%¥XÓk½óô´ê§>àÔþB.·¾ÆûÍ`Qæ=åæ-¾Š/K=þ*ôɳŽ¾ 8 L”Ó>÷X©©`Ô=¿2áTÐؘ¾Ê)NïÚ>ŒÞàQ¸½øÄù7 ½½ë9sO²e>íÁƒV.¾Ÿ|wï =éá_¯¹m=÷N¡âQ¾sgœÞ ê>Ž‘K1t¬½µ%˜­<þ÷½þx½uÎ8û>nEâE/½÷pô€ÜÇؽâ„öÒt>bVŠJlt¾ ýA¿T˜x½ôΙ„OP¨½Ùë´ì¶ç]=üv¹­JZ½þw=$ßÚ†=ç¬$,£…=ì:m‡@Qè½ý–í²ƒK,=ø…‹Öèa½È½ÖéÖ²6½ó˜¹ã'=d=ü.üHÖµ½ñi6ØÅù;½Ò©ÚŸHÇ=ö°¦;³ˆ½ø©Ãªˆ²À=ãÜÛäsž=å·ÎmžI ½÷jg™\=ó¤+ƒl*ƽƆ {œ°½î=*X5=öÔ¹p`½ë™ºñËD‹½Êc]Ãea=ñQö0ú‘нòþ#†C/=ß^ ®Œ =ß×’.­í×½ñŽ¿èi=í½TZML»½Ã@£.Ö„¾½åÔ(P½ú=ð%Ÿ¥¯èî½äŸÖÖœ¶½¿ÄõGL+œ=èJx{Ÿ…ë½ë'¡šžd°=××LŸ¤žŠ=ÔÏ.òd)½çÁ!Ò‹A=ä圈+0½Â¶˜ìd™æ½Úr”vë(=åÜò,À½ÝsDR_’½‹ N—Ðþ–=ÛÎÁt‰‡½áWÉft9=ÓFœ„\ë=¹ü‡À@~5½Ù¨Æ›+Ó=ÛQᾋH½Èö¯+“ýϽÀXx‚¶©=ÕüŒkω½ÕÖ󇤮=ºˆ™#V2=½@w“˨½ÒÈb±|‹ =ÓVu"‘9§½Â»ulj½¶üh}úd=Ñ·XÈJé¼½Ô“œ‰=Å­‚5Š=µ¹¯E¨½ÓÆÎ S†‹=×+ Š<¾J½È?{7Jj»½ÀŒM¡ø=Ù±zúUí½Û:M¸Þ¬=Æ-îJ nü=ÌëÖo½à[ëãü€=Þ]g—k7½·«š®}dž½ØÁˆh¯Œ3=äbÿWá’½Ý)È;¼½±|ÊìA=âÕsï¾·_½çMu*0Þ=Ö ­!Á6=Ó”±»ÈÈR½éb±m…=ç³cƒ*ï½Â¹_La½ã’>míÌ=îs¬±¼û½äiø3½»7½Ä|’¿)÷=ìsIPisà½ð.t>õö =Ù·”ÑEìº=á‘£ˆ`´½ò­7ÖÁ¹=íÁ>÷¡×õ½£¿Íå¾à½í˜ÇiÝ=ôbÕ·Hɽåà„è3½Ú¶ìVÄF=ô0N+ ½óyÏ'v(´=Ѽþl“=ìÿ›M¦¼ô½÷Žß.j­M=ïUnZ΋>=Ð?ᎠD½õ‘Py\3B=÷Ýš¸.yA½áYN¶ %½êî1’õL=úzÉË8Z×½ôm{ãìfk½¬Ù=©~=öKwç]¯¬½ûñ†¬qõ=êHpöœ#=ç³qV¹½üߟN‡Þ=ùzÓB¿½Äñ}ÊŽlµ½öt¯ü.œœ=ÿ¦JAvMF½ñ¬|þ9œ½ã”f?ì¹ê=þÅãÄ1NϽý†Tføí=ÙiÉúG²=ö&Òp½â¾|'¯R©=ö*õjÒåV=Ý®ÈlxÕ¿¾ë”síE>Ü÷t_'½ä\¤–sïì½õî·]:j>ùR#´`»½úŒ¸<- ×½Ó|Šð©Z>±ªåÊ<¾×\h ^ù=ëÿxˆaO=ô¥4lË ¾Sv¨XŠÕ=þÅ_m…ã=ÂKƒ—äêݾ*Ô/Ìæm>´À1qÛ½ñ±ùT/ǽó»yM}Â>•?ñz ¾c#|{À=‰IzQF]³>šRóôäž¾vJ`F=õ, èi™=òæ0ÀÌêh¾Åô­`€>BóåZŠ5½Ã°‰€Ä´H¾ s à–ô>.óë €½øYdÃq"¸½ò@3)fÒ>î§ÉeN·¾ýÊDRY»=Ѫ¢"™ry>ŒÜ.rÕò¾ ®Ï–)-×=û-qq9)«=ñáL!@¾ Ö˜ü>Á>““4z¾ž½×ôéÿîàÞ¾&XC®jÃ> .'¿”-û½ýf°·½ñàìßLu> H¿¾8[²… =Ük(«W!>æ"WÒo¾  ¸ë?0˜=ÿOR" =òWý鮚¾¾ Œ)›^ï> NùOd½Þ«99!r«¾×·à.Ì/> Ê3îÉm¾Œ´áFÜç½ób—+:ä > ëÙ' ­¾ j¸þiBE=ÞP[úÌåÎ>Á„Ëqñ¾fjîŠ8>þ ùµ}=õK¨ñ2®¾d‡Í•ô¶> Qí*ˆt½½Úù\²ÿ©»¾qd<çZ{>XŸk  Y¾ûz2‰Ó½÷ªÅWE>õfLÔæ¾ ø€q™$‚=Ô_èÉß ¦> áÚn£¾ð¤®Å!Ó>Í) $†Q=ú­µ//$:¾ÌrY ¹‡> T…A¡×½Ä0Oå$¾ »~kL¯>vòâ`òè¾›J€@ ½þ ˜7²À˜>¤NeMRÀ¾ YK¢1•½­ø¦Ác—> 5²šÜÖ¾å,×KÛ"=ýÈžÇð>°¨Ç`´½¾}#—Co»> ÷^ƒ¸eÙ=Õ”FHBFF¾–§xi¾>2ÔP}*½úQÄ6ºE¸¾wòJnKÅ>NåÏû€&¾ A›+üνåëTù@>a€&>Œ¾SÁºÀ¦=õ§˜&,">¡2Þ4ë¾ bØiM*> §ä”¿´=ñ¢‚oœ¼¾bi«rša>9¹Ú ®½ïX«6®Ï¾ 3ëT•ä>©Uc,ÿ¾‹"xX5½ùbܳ¯.>°IQE{¾Ô‡6Vù)=ा§Í¸á>ÙshÅq ¾Ôâ Š>¯oü>3>Nns¾érï#»–>–•¶=› ûý¾Z™ÖΙ«>1B¼ Kw¾­¯A’ ¾ÛcåXÏ>ú^LŒÆ¾Ú˜<-7½å QË-•¢>Fö›Wp°¾ö~B=ø÷‚žZT> ÷ó{ó¾Ëwµn> šNHçûœ=õæý–+ˆ¾Ñó >IŽÛT9¥½ì<žù`¾ µ¬{yê>AÞvc¾Npô@Æk¾/wâo >»LÿX-2¾{… WO=¸qñ+Íã>¬¿1Ïþ@8æ4 %>â×™:p>Óuà7¾SÇwª>Aq‡Í=évŠIÕ¾@òtÈa>¦ègȘ½ø 2Fù?¾¤i˜ÿ –>ÓiŽ.FT¾ ~¥ª ó½üKæÆ…0>pÁ–YÁ¤¾X/b)'í=⊙ˆ–3>¬NKJ ¾ý›?*†> ¼Û¤àù>\êûŠú‘¾&ß^TA>;ص”¬í=à ¨ˆ«K¾ÉUÑèý]>^;”Ç~½þRZ#îqá¾°„ZLªä>2´Á¯+ݾA7³€û½úÌ[Œ@GQ>tîØ*:A¾Ó[m =çÓÂ4ç>]“?³â¾c[¥À:>Ī<´¤>1‘{Yþ ¾tŽ%1>AúneÒ=ámx§y\‡¾àžMSà>‹0¬ôk½þ™ l9¿¥¾y¿à1Zš>‹h¾™®¼Ö½þÜ*U/ê,>ûÍ_oER¾‚UŠßô=á6ÿzˆ’>|ÂUU¾{iíÃOñ>¹ÑÚ ­> ÃÍÊm -¾†e—D>.·€¯ªr=ïh¢_w5‚¾Í2ýÏv>Æ]¾‚Œ½ø…™ i}G¾Ú]ˆs’G>Åá°!´¾ȇiÓg¾™!82@>÷IdL ¾%r"°¾½¹¶`öa>¼ù&ã<¾ñÄœè>V…9ÅŠ>˜ï÷Ag¾‘È7±$>¬Ñ²c=ý•Ìò·\¾›Ç×ó¿Œ>É9פ½æ4¢"¥ž¾]ëÜà‰>~@÷x'=¾ rf2@g¾ éÑ~Xf¿>eB‡w¾JB ›{(½ó-Í@·J>3§µÈ¾}43{xy=ö ËúÜ®>f¬=ˆ”¾7Å|m>‘è’± e> #¬êþª¾P[KP&>nhh|X=ä½0EൾŸ¼Ù,¾y> á …|½ÿ –›Á^°¾ôÏ]úè>€c³Ã€q¾[Oñ<¾Íù Ÿ­>‹==(S¾$Ð:<½Ëz7gP>GpS ¦¾J]Jˈ‚>¢[x/z>*?‡¾ üú¼æ>ñÑ-¯A>íÏ ÷^¾ÒɆ"ì>wÓ:.à>½¶«›\¨A¾*1l á>KœÃ)¾o$aŠYh¾î㬵> w§õ:ql¾úÕóxS¾ÆµÍÉ>: û¨. ¾nS ìð)=Ð/©_Š©A>Zy »íì¾ q<…Þä>Ä“¹ÉrM>Ï¢o ýO¾ ÌÂ"zÆê>³8qÈ:´>µ¡®ÊŠÐ¾ÌàæòF> ×è";½ÑRÕ5šå¾â´ËQ®ƒ> [ÀdT¿¾øªÀ\§¤¾Wv¸-ÉY>!"iB¤s˜¾Ûq„£+¾̆ŸÆ¤­> H—bL ë¾NntA×M=ÁCx‘å>Èʧ¶ ¾ ’@¾Q5>ü¾ý›£/>aSPT‘¢¾!ws ç:>~dK'>CæðÓ¾ Â\óA>,1(‰Þ_=ÄèܢڻϾ WSñqµ> «ºaoݾ¹¥"ŠÁ¾í­Ö­×¬>!Æ1è:¬¾ŽŠËU 6¾ ¢Òöÿnü>!N5ðùñ羓BÛ—j½ä6D¶×‚ç> Ú·7²¾ œ¬í­C5>˘Í>öQm·Åm¾"O9±v>øž·ÉÝÉ>fÍ(ú ¾!àÊrŠ5>k2Šå=ôhð=ξ : VÍýácý½õèà›9›ì¾j¨•Óp>"•†‘敾Mîݳ¯¾(š˜¯7>"iS€ð¾–3z'h®¾¾Â–‡4¾>!34«ýe¾x[¬wÛ=áнH8>/¨/ù—¾"ˆèéc> ¶VX'‰>“ð ¾"ÑyU¶AA>õ~´ìH>›w/ºc¾"%CÉúÌ>¶ ¯l½æ=ßÖÃ6wÕp¾ c³ëÔò>!˜hÙ›R¾ ·—µ¾qHAÄ”é>"þ1hPi.¾jÀxz}°¾ÎÌ‘"¹w>"ô~wªž¾õ¼ Â~â½û~¦Z†“>!~oœk™¾ ÂQ8Øô =ìßàS¡{>uv·@¥¾"Ï€€îõ¬> º.{î„>¾ÉqIÖ¾#~Tf1fE>$Åãlɽ>Û%OÊ~¾"ÄïB[è>ÉΛí“=ဩîÓe¾ ³xç]ÉÖ>"!õ+ ¾{FnäN¾ä@Ñò±T>#šxRÇó¾ÔÞÇh¾{uwö >#¶ÝÑtrb¾ÈB% ¾ŠžBÈ%K>"x,m¡ª¾ Љñp¨=Ù»ý>î©V™4¾#ûï.>¨•å‚†>ÂñÙÊÚ¾$!{üñô=>T‡é·”>Û{ÐLà¾#Ò·ÖÔ0>s6ƒ¸)=ø A¯>q¾"7âÖGvO>!Ö n8¢ ½ñ(Qy2W¾ÝNûŠl>#ÎnO?;u¾ ¶.dÁ嫾NãíïmQ>$…}a!©ø¾‰Ùcsp¾ ‡5j/ ¼>#òµ8“›¾BÖÌ'½ñ>–ci„–>""oßn;¾"ˆÒ$1o =÷µø"å–>h¦´2”Ô¾$Oªg× x>¦ƒH& >±’fW"¾$ÝM¦e>Éÿ÷ |> 5ÏJ®Çx¾$,k_¶Û> %ÆÊõÃ=í‘ –d¾"Jñÿ¨BR>"õtý2/<½ùÈ 4( x¾¯ÝA¡­T>$¬¿ ˜ê@¾:Ͷ羬€ÙÉ°>%5wM–þ¾x‹ü¾ ëäoÇW>$‹›ìjé¾ I$p9)K½ðï 8k>>"º–1‘òŸ¾#YÈbý=÷6?^Õx`>Á­ˆD$]¾$çRð€Š>ÿ–²û+>QH¥—˜6¾%ŽBÛ^Ÿ>o"hÑ>«^—XX¾% „R,ö> ù\º¦=÷á©ÃÀáà¾#oQßp[ö>"ûëVçe½ïŠOO½×Ò¾ Ì«q7ÐV>$ôÔÅϤj¾ QrZD3¾—c >%ÛA•{ên¾®öN°\g¾8Í¥7>%¥öS×Á¾‘0­¦áj¾ÝAó;3„>$[« )Š¾"w Iˆ$=ÉÉ÷ljtã>"E“ï¾$½HŠ¸Å>s.ƉA>¿s§Aú¾&¬JhP´>´½Èçek>ó ]ð¾&7îG„ûr>öò+[ši> 6 dó~¾%`ø£ÁQ[>!t ~ W6=í*Jè‚[Ú¾#ŠXÃ/T³>$ê](½÷î¶NJľ ÍÙ’œH>%Ùpª¦)k¾­Ä°J¼¾˜—­ÜU>&˜š"ü£¾ oxz´¾eœ•úçÊ>&UHVC¾—Êþåd*¾Åg šž`>%í6 o–¾"åöâåu=€ïnAih_>"ëôlD¾%.?…îP>ä@Úš>ä¼Îž½Ê¾&Ž¤â–4Õ>sËÃÃáµ>˜á+Bì¾&û‰Oå¬>­öq0~>GIúm4ª¾&sâE«p\> æ‘Åܬ=ý.¶±Eøø¾%¾—úô>#Ãó»ó½ßŸNÕ}¾"´¶BZG>%Õ¢’ç`¾R\9,™¾Tù[Ž&>' ®øöW¾å\Œ ¥O¾;-Õi>'UdN‡È¾ØÚ”R…—¾”E<¿x>&»BÃôxÀ¾!\$2_æ&½ûÛë sÈÀ>%Có{Þá¾$"žöö{I=àätË¡öD>#¿_d¥¾&'Î"\Z >1öìk> \à뿾'[¦¹½ê>ª4¼ÔVM> …Þ¿ ¾'¶D¹ýû>‚™4 p”>Ýp ©¾'7Ò¡(,Ô>!.ºØ >ó-PÐ&¾%èDPzÆœ>$™}tL„½·trK–±¾#Ö°›ô»>& fJY ¾\T¶¾!WÔI.²>'~ƒ j󾪔”B4]¾¼4ÿL>(XõW:V¾Œ2Ö¾w¾о~¡Ô>'ÚgUS£s¾ I|žv|R¾¸5y´Û#>&ÛñAHð ¾#DÉ2>@½ê—ÍfÜ }>%"€Í‡ñ¾%ŸÏræS=õ1µž>"¿K¤í:³¾'Ld {•í> y¼pu>¤ø`¼ê¾(?”.nïï>»q—GœW>®òÖS+±¾(u4' "™> û'*Õ@>8X¶¶š¾'ïYCLb>!¾5½²>õVXˆ¯¾&´X¹~º>$n ‘ ¶=ÄŒg˜R¾$Ñ¢™¸,è>&…$`Öw½þÃO³£2~¾"WÕx¨B>'ö»XÜ(—¾ëM!KO¾·B¦‘L>(»Ðk¢¾i•ZÀ™-¾ép—&Ì>(ÑTrÜ¡k¾`Äù½tŽ¾z¤æ£“>(:Ír¿Å¾"@cóÂB¾>‡\ò*ü>&ÿDö ˆ¦¾$Ñ÷̨ɽÂ`ÙŒ;9>%*@}É‹Q¾&ÖS*°Ž=ýìI‹o”>"ÊÜ;”3¾(BΚ) j>ž%2¥‚Ä>æ¢Û -‰¾)CcУN>¹ºø¿êù>p¨eϾ)?€*‡>Žx >`„yþÄ ¾(ÏÑ1ô>!Ò!Ÿ½ù)>ÊšeÆPd¾'ÇëLAÑ>$mo¦Tƒ[=éw½k­m±¾&1@’à#ï>&‹mÊÐmô½òK^}¾$G#íõ>("c‹ÀŒ¾dG ó¾!‹õ^y8$>)*ÿ,¯“ƒ¾ƒ?ÑÇ}ɾ;!ßí˜>)£-m¯¯¾]î½Õça¾¿Š†¾>)‹ "ë˜ô¾ O'©Òn¾™”³ŽÛ¾>(æ8j!öɾ#Ž§”$¾Èïò>'»GkŽV¾%l<ðyI@½ÒKxôâi”>&h &ؾ'QüŸ °Ã=øþΕqÎH>#ú }Ë0O¾(¼lÕh“c> ötókqµ>!|Ë4¢´U¾)§ ]©Æ>iÛqÃNæ>T¯†”Ž¾*"‚‹ >êu`çT>%–¼£É¾)ø…ä(\[> o¸ç»ÿE>Á^ôón¾)c³îè“>#« Q3¦>^ÒKK)Y¾(W`ÆÖH>%bOÏËo¡=åeS*>6¢¾&Û=õz§Ñ>'G.IÎÀ ½ñd¥|Å9¾$øÙðõ>(À“ "¾ƒåAÓ Ÿ¾"»(‹Gñ>)ÈÌ¢Œ8 ¾ï~{¥©<¾ .MéD,h>*_±Ì(¤F¾FL¯¯P¾¾É¨ÀI’>*„î­,ž¾,u“lÉ&¾¸ Αþâ>*:ÀKF¾!ÆI„°ÊÕ¾ È’äl>)…".•=¾$)ÈÀ€Ò½ÿ~:Heœ>(i¯É–&¥¾&8órF ½ÔU7ùÍZ>&ï{»Wç`¾'í½lu =õ>Üž&>%¾Èôa¾)CܬàV>ŒfQ Y >#¿ç£|¾*8¶Ö U>;Qt2Ü> Ÿˆö a¾*Ë/”¶§>ú#2í ‰> YbÊ{_¾*ûæz°­Å>Ž'J ">|_ãÙ‘å¾*ÌöWز>!Xjä].ß>¨5"=y¾*AÒ9‰¦>#©¼XŠ6p>JrdÒ2A¾)]?ê$Ç>%´Æ·VŸ=ò$œ3ÀlB¾(&ÌõŸ˜>'t¤=ç½Ùn„Q0ˆ¾&¤U¼7Å>(å´sœr ½þšîÕÔ±l¾$ÜO[L>*˜Ã|iu¾ &åРÞ¾"Ö]g>*Ó«En=¾KpÏÉe¾ ›§G ¬4>+N…慨¾¿ŒP­¾g=/¿Z>+w¤¶Š¼¾ß ó¡M¾NÈhZ>+Q®UïÚ)¾!OÚàÿÕ¾üÀâx ³>*ßüåÅ›¾#{ üߺ¾ ”—_¥L>*#Oÿjø¾%l’ì Òw½ûÔÓ½j¨¨>)"Ò;S`*¾' çÌiѽÕõ8´WÍ¢>'ânà©|%¾(•Vþ­g=ð¹.ZüXf>&gsâd…¾)È0Dº1 >J«„ážø>$·®h¯d)¾*¸^H(¢> ñ¤ ê>"ØýBŠ©¾+e¸  S >üZ¼k> љÔº(¾+ÐÙð¼Ù>•hCÿÕ>Oœx~øy¾+úç.à{J>¨‘+Öí>Ãœ&{ÐK¾+å«™õE> ÿш鶈> ­4/p¾+“ŽYEÌ>#:Ajª„>gà %næ¾+^¦ÌŠ >$Õˆ Kþ>bŸd¾*DJw-`c>&zfß2=õN¼˜ºc¾)Mö{âÙÌ>'î>0=¸IÔ‘µŒ¾((8^‘z>)/P¶ù½ò_+ûný¾&×Ê)#V>*=¯0¾­ˆ>¾%^Áú(î>+­ÒÆOá¾ TÌ¢¾#Ôerg´>+¿<ç®0Ó¾—pǧ]¾" âÒ¡· >,4wÈhR¾÷ªÜª…ç=ò ÆŒ{‘> µb1Û*µ¾rXìÃ+>&fË=!y“£)0ž¾ÄuLèb>¸ÂeÖÂì¾ P‹Çó®=½ñèÍ68³Æ>ê|"°¾%’Quã>ÑΗäb”>3Óv f¾6ï!çž>É-„n½õÕàT:ÿ?¾j¶»@u>ãý Å'¾½C” V0=ÏŸ-ÏÖÈ|>PP“ؾb¾ùW > H•|€jß=êˆYؾT‡h _M>½¶B·¾M5Ca¿½ýŠ6J>¤¾±ž¾ QB•Y=óÉ yJ‚%>lš•(¾ ÆG;°n> `HÙCþ8½Ç)\YQ¬¾ ñÎíÂ#>‡>E*ö¾†½Fؽêyvh3ÍV>ÜÈU>¤N¾! JíÉf=ýâçßéÁ=ûÎÊ „D¾€è ºu> å?.ý/<½ì)‰7µz¾ î„ÿfŒ>¨^ËFfB¾;´æì/½·ýF4@ý>¾'ó‹²¾ÔßÓ³> nÀ0â»=ðS`¤¾ Ë¥NiÄÉ> °Óä b½ôñÍÛ!¨]½ü¯8¤š§>  ±úF¾"™W6=Ù”Ùr˜'é>lõfÎë¾ ™Õá>z£°=ÞDÃÓѵ¾þ ûíÛ.> m3ÕŸq½ø9%¥XÓk½óô´ê§>àÔþB.·¾ÆûÍ`Qæ=åæ-¾Š/K=þ*ôɳŽ¾ 8 L”Ó>÷X©©`Ô=¿2áTÐؘ¾Ê)NïÚ>ŒÞàQ¸½øÄù7 ½½ë9sO²e>íÁƒV.¾Ÿ|wï =éá_¯¹m=÷N¡âQ¾sgœÞ ê>Ž‘K1t¬½µ%˜­<þ÷½þx½uÎ8û>nEâE/½÷pô€ÜÇؽâ„öÒt>bVŠJlt¾ ýA¿T˜x½ôΙ„OP¨½Ùë´ì¶ç]=üv¹­JZ½þw=$ßÚ†=ç¬$,£…=ì:m‡@Qè½ý–í²ƒK,=ø…‹Öèa½È½ÖéÖ²6½ó˜¹ã'=d=ü.üHÖµ½ñi6ØÅù;½Ò©ÚŸHÇ=ö°¦;³ˆ½ø©Ãªˆ²À=ãÜÛäsž=å·ÎmžI ½÷jg™\=ó¤+ƒl*ƽƆ {œ°½î=*X5=öÔ¹p`½ë™ºñËD‹½Êc]Ãea=ñQö0ú‘нòþ#†C/=ß^ ®Œ =ß×’.­í×½ñŽ¿èi=í½TZML»½Ã@£.Ö„¾½åÔ(P½ú=ð%Ÿ¥¯èî½äŸÖÖœ¶½¿ÄõGL+œ=èJx{Ÿ…ë½ë'¡šžd°=××LŸ¤žŠ=ÔÏ.òd)½çÁ!Ò‹A=ä圈+0½Â¶˜ìd™æ½Úr”vë(=åÜò,À½ÝsDR_’½‹ N—Ðþ–=ÛÎÁt‰‡½áWÉft9=ÓFœ„\ë=¹ü‡À@~5½Ù¨Æ›+Ó=ÛQᾋH½Èö¯+“ýϽÀXx‚¶©=ÕüŒkω½ÕÖ󇤮=ºˆ™#V2=½@w“˨½ÒÈb±|‹ =ÓVu"‘9§½Â»ulj½¶üh}úd=Ñ·XÈJé¼½Ô“œ‰=Å­‚5Š=µ¹¯E¨½ÓÆÎ S†‹=×+ Š<¾J½È?{7Jj»½ÀŒM¡ø=Ù±zúUí½Û:M¸Þ¬=Æ-îJ nü=ÌëÖo½à[ëãü€=Þ]g—k7½·«š®}dž½ØÁˆh¯Œ3=äbÿWá’½Ý)È;¼½±|ÊìA=âÕsï¾·_½çMu*0Þ=Ö ­!Á6=Ó”±»ÈÈR½éb±m…=ç³cƒ*ï½Â¹_La½ã’>míÌ=îs¬±¼û½äiø3½»7½Ä|’¿)÷=ìsIPisà½ð.t>õö =Ù·”ÑEìº=á‘£ˆ`´½ò­7ÖÁ¹=íÁ>÷¡×õ½£¿Íå¾à½í˜ÇiÝ=ôbÕ·Hɽåà„è3½Ú¶ìVÄF=ô0N+ ½óyÏ'v(´=Ѽþl“=ìÿ›M¦¼ô½÷Žß.j­M=ïUnZ΋>=Ð?ᎠD½õ‘Py\3B=÷Ýš¸.yA½áYN¶ %½êî1’õL=úzÉË8Z×½ôm{ãìfk½¬Ù=©~=öKwç]¯¬½ûñ†¬qõ=êHpöœ#=ç³qV¹½üߟN‡Þ=ùzÓB¿½Äñ}ÊŽlµ½öt¯ü.œœ=ÿ¦JAvMF½ñ¬|þ9œ½ã”f?ì¹ê=þÅãÄ1NϽý†Tføí=ÙiÉúG²=ö&Òp½â¾|'¯R©=ö*õjÒåV=Ý®ÈlxÕ¿¾ë”síE>Ü÷t_'½ä\¤–sïì½õî·]:j>ùR#´`»½úŒ¸<- ×½Ó|Šð©Z>±ªåÊ<¾×\h ^ù=ëÿxˆaO=ô¥4lË ¾Sv¨XŠÕ=þÅ_m…ã=ÂKƒ—äêݾ*Ô/Ìæm>´À1qÛ½ñ±ùT/ǽó»yM}Â>•?ñz ¾c#|{À=‰IzQF]³>šRóôäž¾vJ`F=õ, èi™=òæ0ÀÌêh¾Åô­`€>BóåZŠ5½Ã°‰€Ä´H¾ s à–ô>.óë €½øYdÃq"¸½ò@3)fÒ>î§ÉeN·¾ýÊDRY»=Ѫ¢"™ry>ŒÜ.rÕò¾ ®Ï–)-×=û-qq9)«=ñáL!@¾ Ö˜ü>Á>““4z¾ž½×ôéÿîàÞ¾&XC®jÃ> .'¿”-û½ýf°·½ñàìßLu> H¿¾8[²… =Ük(«W!>æ"WÒo¾  ¸ë?0˜=ÿOR" =òWý鮚¾¾ Œ)›^ï> NùOd½Þ«99!r«¾×·à.Ì/> Ê3îÉm¾Œ´áFÜç½ób—+:ä > ëÙ' ­¾ j¸þiBE=ÞP[úÌåÎ>Á„Ëqñ¾fjîŠ8>þ ùµ}=õK¨ñ2®¾d‡Í•ô¶> Qí*ˆt½½Úù\²ÿ©»¾qd<çZ{>XŸk  Y¾ûz2‰Ó½÷ªÅWE>õfLÔæ¾ ø€q™$‚=Ô_èÉß ¦> áÚn£¾ð¤®Å!Ó>Í) $†Q=ú­µ//$:¾ÌrY ¹‡> T…A¡×½Ä0Oå$¾ »~kL¯>vòâ`òè¾›J€@ ½þ ˜7²À˜>¤NeMRÀ¾ YK¢1•½­ø¦Ác—> 5²šÜÖ¾å,×KÛ"=ýÈžÇð>°¨Ç`´½¾}#—Co»> ÷^ƒ¸eÙ=Õ”FHBFF¾–§xi¾>2ÔP}*½úQÄ6ºE¸¾wòJnKÅ>NåÏû€&¾ A›+üνåëTù@>a€&>Œ¾SÁºÀ¦=õ§˜&,">¡2Þ4ë¾ bØiM*> §ä”¿´=ñ¢‚oœ¼¾bi«rša>9¹Ú ®½ïX«6®Ï¾ 3ëT•ä>©Uc,ÿ¾‹"xX5½ùbܳ¯.>°IQE{¾Ô‡6Vù)=ा§Í¸á>ÙshÅq ¾Ôâ Š>¯oü>3>Nns¾érï#»–>–•¶=› ûý¾Z™ÖΙ«>1B¼ Kw¾­¯A’ ¾ÛcåXÏ>ú^LŒÆ¾Ú˜<-7½å QË-•¢>Fö›Wp°¾ö~B=ø÷‚žZT> ÷ó{ó¾Ëwµn> šNHçûœ=õæý–+ˆ¾Ñó >IŽÛT9¥½ì<žù`¾ µ¬{yê>AÞvc¾Npô@Æk¾/wâo >»LÿX-2¾{… WO=¸qñ+Íã>¬¿1Ïþ@8æ4 %>â×™:p>Óuà7¾SÇwª>Aq‡Í=évŠIÕ¾@òtÈa>¦ègȘ½ø 2Fù?¾¤i˜ÿ –>ÓiŽ.FT¾ ~¥ª ó½üKæÆ…0>pÁ–YÁ¤¾X/b)'í=⊙ˆ–3>¬NKJ ¾ý›?*†> ¼Û¤àù>\êûŠú‘¾&ß^TA>;ص”¬í=à ¨ˆ«K¾ÉUÑèý]>^;”Ç~½þRZ#îqá¾°„ZLªä>2´Á¯+ݾA7³€û½úÌ[Œ@GQ>tîØ*:A¾Ó[m =çÓÂ4ç>]“?³â¾c[¥À:>Ī<´¤>1‘{Yþ ¾tŽ%1>AúneÒ=ámx§y\‡¾àžMSà>‹0¬ôk½þ™ l9¿¥¾y¿à1Zš>‹h¾™®¼Ö½þÜ*U/ê,>ûÍ_oER¾‚UŠßô=á6ÿzˆ’>|ÂUU¾{iíÃOñ>¹ÑÚ ­> ÃÍÊm -¾†e—D>.·€¯ªr=ïh¢_w5‚¾Í2ýÏv>Æ]¾‚Œ½ø…™ i}G¾Ú]ˆs’G>Åá°!´¾ȇiÓg¾™!82@>÷IdL ¾%r"°¾½¹¶`öa>¼ù&ã<¾ñÄœè>V…9ÅŠ>˜ï÷Ag¾‘È7±$>¬Ñ²c=ý•Ìò·\¾›Ç×ó¿Œ>É9פ½æ4¢"¥ž¾]ëÜà‰>~@÷x'=¾ rf2@g¾ éÑ~Xf¿>eB‡w¾JB ›{(½ó-Í@·J>3§µÈ¾}43{xy=ö ËúÜ®>f¬=ˆ”¾7Å|m>‘è’± e> #¬êþª¾P[KP&>nhh|X=ä½0EൾŸ¼Ù,¾y> á …|½ÿ –›Á^°¾ôÏ]úè>€c³Ã€q¾[Oñ<¾Íù Ÿ­>‹==(S¾$Ð:<½Ëz7gP>GpS ¦¾J]Jˈ‚>¢[x/z>*?‡¾ üú¼æ>ñÑ-¯A>íÏ ÷^¾ÒɆ"ì>wÓ:.à>½¶«›\¨A¾*1l á>KœÃ)¾o$aŠYh¾î㬵> w§õ:ql¾úÕóxS¾ÆµÍÉ>: û¨. ¾nS ìð)=Ð/©_Š©A>Zy »íì¾ q<…Þä>Ä“¹ÉrM>Ï¢o ýO¾ ÌÂ"zÆê>³8qÈ:´>µ¡®ÊŠÐ¾ÌàæòF> ×è";½ÑRÕ5šå¾â´ËQ®ƒ> [ÀdT¿¾øªÀ\§¤¾Wv¸-ÉY>!"iB¤s˜¾Ûq„£+¾̆ŸÆ¤­> H—bL ë¾NntA×M=ÁCx‘å>Èʧ¶ ¾ ’@¾Q5>ü¾ý›£/>aSPT‘¢¾!ws ç:>~dK'>CæðÓ¾ Â\óA>,1(‰Þ_=ÄèܢڻϾ WSñqµ> «ºaoݾ¹¥"ŠÁ¾í­Ö­×¬>!Æ1è:¬¾ŽŠËU 6¾ ¢Òöÿnü>!N5ðùñ羓BÛ—j½ä6D¶×‚ç> Ú·7²¾ œ¬í­C5>˘Í>öQm·Åm¾"O9±v>øž·ÉÝÉ>fÍ(ú ¾!àÊrŠ5>k2Šå=ôhð=ξ : VÍýácý½õèà›9›ì¾j¨•Óp>"•†‘敾Mîݳ¯¾(š˜¯7>"iS€ð¾–3z'h®¾¾Â–‡4¾>!34«ýe¾x[¬wÛ=áнH8>/¨/ù—¾"ˆèéc> ¶VX'‰>“ð ¾"ÑyU¶AA>õ~´ìH>›w/ºc¾"%CÉúÌ>¶ ¯l½æ=ßÖÃ6wÕp¾ c³ëÔò>!˜hÙ›R¾ ·—µ¾qHAÄ”é>"þ1hPi.¾jÀxz}°¾ÎÌ‘"¹w>"ô~wªž¾õ¼ Â~â½û~¦Z†“>!~oœk™¾ ÂQ8Øô =ìßàS¡{>uv·@¥¾"Ï€€îõ¬> º.{î„>¾ÉqIÖ¾#~Tf1fE>$Åãlɽ>Û%OÊ~¾"ÄïB[è>ÉΛí“=ဩîÓe¾ ³xç]ÉÖ>"!õ+ ¾{FnäN¾ä@Ñò±T>#šxRÇó¾ÔÞÇh¾{uwö >#¶ÝÑtrb¾ÈB% ¾ŠžBÈ%K>"x,m¡ª¾ Љñp¨=Ù»ý>î©V™4¾#ûï.>¨•å‚†>ÂñÙÊÚ¾$!{üñô=>T‡é·”>Û{ÐLà¾#Ò·ÖÔ0>s6ƒ¸)=ø A¯>q¾"7âÖGvO>!Ö n8¢ ½ñ(Qy2W¾ÝNûŠl>#ÎnO?;u¾ ¶.dÁ嫾NãíïmQ>$…}a!©ø¾‰Ùcsp¾ ‡5j/ ¼>#òµ8“›¾BÖÌ'½ñ>–ci„–>""oßn;¾"ˆÒ$1o =÷µø"å–>h¦´2”Ô¾$Oªg× x>¦ƒH& >±’fW"¾$ÝM¦e>Éÿ÷ |> 5ÏJ®Çx¾$,k_¶Û> %ÆÊõÃ=í‘ –d¾"Jñÿ¨BR>"õtý2/<½ùÈ 4( x¾¯ÝA¡­T>$¬¿ ˜ê@¾:Ͷ羬€ÙÉ°>%5wM–þ¾x‹ü¾ ëäoÇW>$‹›ìjé¾ I$p9)K½ðï 8k>>"º–1‘òŸ¾#YÈbý=÷6?^Õx`>Á­ˆD$]¾$çRð€Š>ÿ–²û+>QH¥—˜6¾%ŽBÛ^Ÿ>o"hÑ>«^—XX¾% „R,ö> ù\º¦=÷á©ÃÀáà¾#oQßp[ö>"ûëVçe½ïŠOO½×Ò¾ Ì«q7ÐV>$ôÔÅϤj¾ QrZD3¾—c >%ÛA•{ên¾®öN°\g¾8Í¥7>%¥öS×Á¾‘0­¦áj¾ÝAó;3„>$[« )Š¾"w Iˆ$=ÉÉ÷ljtã>"E“ï¾$½HŠ¸Å>s.ƉA>¿s§Aú¾&¬JhP´>´½Èçek>ó ]ð¾&7îG„ûr>öò+[ši> 6 dó~¾%`ø£ÁQ[>!t ~ W6=í*Jè‚[Ú¾#ŠXÃ/T³>$ê](½÷î¶NJľ ÍÙ’œH>%Ùpª¦)k¾­Ä°J¼¾˜—­ÜU>&˜š"ü£¾ oxz´¾eœ•úçÊ>&UHVC¾—Êþåd*¾Åg šž`>%í6 o–¾"åöâåu=€ïnAih_>"ëôlD¾%.?…îP>ä@Úš>ä¼Îž½Ê¾&Ž¤â–4Õ>sËÃÃáµ>˜á+Bì¾&û‰Oå¬>­öq0~>GIúm4ª¾&sâE«p\> æ‘Åܬ=ý.¶±Eøø¾%¾—úô>#Ãó»ó½ßŸNÕ}¾"´¶BZG>%Õ¢’ç`¾R\9,™¾Tù[Ž&>' ®øöW¾å\Œ ¥O¾;-Õi>'UdN‡È¾ØÚ”R…—¾”E<¿x>&»BÃôxÀ¾!\$2_æ&½ûÛë sÈÀ>%Có{Þá¾$"žöö{I=àätË¡öD>#¿_d¥¾&'Î"\Z >1öìk> \à뿾'[¦¹½ê>ª4¼ÔVM> …Þ¿ ¾'¶D¹ýû>‚™4 p”>Ýp ©¾'7Ò¡(,Ô>!.ºØ >ó-PÐ&¾%èDPzÆœ>$™}tL„½·trK–±¾#Ö°›ô»>& fJY ¾\T¶¾!WÔI.²>'~ƒ j󾪔”B4]¾¼4ÿL>(XõW:V¾Œ2Ö¾w¾о~¡Ô>'ÚgUS£s¾ I|žv|R¾¸5y´Û#>&ÛñAHð ¾#DÉ2>@½ê—ÍfÜ }>%"€Í‡ñ¾%ŸÏræS=õ1µž>"¿K¤í:³¾'Ld {•í> y¼pu>¤ø`¼ê¾(?”.nïï>»q—GœW>®òÖS+±¾(u4' "™> û'*Õ@>8X¶¶š¾'ïYCLb>!¾5½²>õVXˆ¯¾&´X¹~º>$n ‘ ¶=ÄŒg˜R¾$Ñ¢™¸,è>&…$`Öw½þÃO³£2~¾"WÕx¨B>'ö»XÜ(—¾ëM!KO¾·B¦‘L>(»Ðk¢¾i•ZÀ™-¾ép—&Ì>(ÑTrÜ¡k¾`Äù½tŽ¾z¤æ£“>(:Ír¿Å¾"@cóÂB¾>‡\ò*ü>&ÿDö ˆ¦¾$Ñ÷̨ɽÂ`ÙŒ;9>%*@}É‹Q¾&ÖS*°Ž=ýìI‹o”>"ÊÜ;”3¾(BΚ) j>ž%2¥‚Ä>æ¢Û -‰¾)CcУN>¹ºø¿êù>p¨eϾ)?€*‡>Žx >`„yþÄ ¾(ÏÑ1ô>!Ò!Ÿ½ù)>ÊšeÆPd¾'ÇëLAÑ>$mo¦Tƒ[=éw½k­m±¾&1@’à#ï>&‹mÊÐmô½òK^}¾$G#íõ>("c‹ÀŒ¾dG ó¾!‹õ^y8$>)*ÿ,¯“ƒ¾ƒ?ÑÇ}ɾ;!ßí˜>)£-m¯¯¾]î½Õça¾¿Š†¾>)‹ "ë˜ô¾ O'©Òn¾™”³ŽÛ¾>(æ8j!öɾ#Ž§”$¾Èïò>'»GkŽV¾%l<ðyI@½ÒKxôâi”>&h &ؾ'QüŸ °Ã=øþΕqÎH>#ú }Ë0O¾(¼lÕh“c> ötókqµ>!|Ë4¢´U¾)§ ]©Æ>iÛqÃNæ>T¯†”Ž¾*"‚‹ >êu`çT>%–¼£É¾)ø…ä(\[> o¸ç»ÿE>Á^ôón¾)c³îè“>#« Q3¦>^ÒKK)Y¾(W`ÆÖH>%bOÏËo¡=åeS*>6¢¾&Û=õz§Ñ>'G.IÎÀ ½ñd¥|Å9¾$øÙðõ>(À“ "¾ƒåAÓ Ÿ¾"»(‹Gñ>)ÈÌ¢Œ8 ¾ï~{¥©<¾ .MéD,h>*_±Ì(¤F¾FL¯¯P¾¾É¨ÀI’>*„î­,ž¾,u“lÉ&¾¸ Αþâ>*:ÀKF¾!ÆI„°ÊÕ¾ È’äl>)…".•=¾$)ÈÀ€Ò½ÿ~:Heœ>(i¯É–&¥¾&8órF ½ÔU7ùÍZ>&ï{»Wç`¾'í½lu =õ>Üž&>%¾Èôa¾)CܬàV>ŒfQ Y >#¿ç£|¾*8¶Ö U>;Qt2Ü> Ÿˆö a¾*Ë/”¶§>ú#2í ‰> YbÊ{_¾*ûæz°­Å>Ž'J ">|_ãÙ‘å¾*ÌöWز>!Xjä].ß>¨5"=y¾*AÒ9‰¦>#©¼XŠ6p>JrdÒ2A¾)]?ê$Ç>%´Æ·VŸ=ò$œ3ÀlB¾(&ÌõŸ˜>'t¤=ç½Ùn„Q0ˆ¾&¤U¼7Å>(å´sœr ½þšîÕÔ±l¾$ÜO[L>*˜Ã|iu¾ &åРÞ¾"Ö]g>*Ó«En=¾KpÏÉe¾ ›§G ¬4>+N…慨¾¿ŒP­¾g=/¿Z>+w¤¶Š¼¾ß ó¡M¾NÈhZ>+Q®UïÚ)¾!OÚàÿÕ¾üÀâx ³>*ßüåÅ›¾#{ üߺ¾ ”—_¥L>*#Oÿjø¾%l’ì Òw½ûÔÓ½j¨¨>)"Ò;S`*¾' çÌiѽÕõ8´WÍ¢>'ânà©|%¾(•Vþ­g=ð¹.ZüXf>&gsâd…¾)È0Dº1 >J«„ážø>$·®h¯d)¾*¸^H(¢> ñ¤ ê>"ØýBŠ©¾+e¸  S >üZ¼k> љÔº(¾+ÐÙð¼Ù>•hCÿÕ>Oœx~øy¾+úç.à{J>¨‘+Öí>Ãœ&{ÐK¾+å«™õE> ÿш鶈> ­4/p¾+“ŽYEÌ>#:Ajª„>gà %næ¾+^¦ÌŠ >$Õˆ Kþ>bŸd¾*DJw-`c>&zfß2=õN¼˜ºc¾)Mö{âÙÌ>'î>0=¸IÔ‘µŒ¾((8^‘z>)/P¶ù½ò_+ûný¾&×Ê)#V>*=¯0¾­ˆ>¾%^Áú(î>+­ÒÆOá¾ TÌ¢¾#Ôerg´>+¿<ç®0Ó¾—pǧ]¾" âÒ¡· >,4wÈhR¾÷ªÜª…ç=ò ÆŒ{‘> µb1Û*µ¾rXìÃ+>&fË=!y“£)0ž¾ÄuLèb>¸ÂeÖÂì¾ P‹Çó®=½ñèÍ68³Æ>ê|"°¾%’Quã>ÑΗäb”>3Óv f¾6ï!çž>É-„n½õÕàT:ÿ?¾j¶»@u>ãý Å'¾½C” V0=ÏŸ-ÏÖÈ|>PP“ؾb¾ùW > H•|€jß=êˆYؾT‡h _M>½¶B·¾M5Ca¿½ýŠ6J>¤¾±ž¾ QB•Y=óÉ yJ‚%>lš•(¾ ÆG;°n> `HÙCþ8½Ç)\YQ¬¾ ñÎíÂ#>‡>E*ö¾†½Fؽêyvh3ÍV>ÜÈU>¤N¾! JíÉf=ýâçßéÁ=ûÎÊ „D¾€è ºu> å?.ý/<½ì)‰7µz¾ î„ÿfŒ>¨^ËFfB¾;´æì/½·ýF4@ý>¾'ó‹²¾ÔßÓ³> nÀ0â»=ðS`¤¾ Ë¥NiÄÉ> °Óä b½ôñÍÛ!¨]½ü¯8¤š§>  ±úF¾"™W6=Ù”Ùr˜'é>lõfÎë¾ ™Õá>z£°=ÞDÃÓѵ¾þ ûíÛ.> m3ÕŸq½ø9%¥XÓk½óô´ê§>àÔþB.·¾ÆûÍ`Qæ=åæ-¾Š/K=þ*ôɳŽ¾ 8 L”Ó>÷X©©`Ô=¿2áTÐؘ¾Ê)NïÚ>ŒÞàQ¸½øÄù7 ½½ë9sO²e>íÁƒV.¾Ÿ|wï =éá_¯¹m=÷N¡âQ¾sgœÞ ê>Ž‘K1t¬½µ%˜­<þ÷½þx½uÎ8û>nEâE/½÷pô€ÜÇؽâ„öÒt>bVŠJlt¾ ýA¿T˜x½ôΙ„OP¨½Ùë´ì¶ç]=üv¹­JZ½þw=$ßÚ†=ç¬$,£…=ì:m‡@Qè½ý–í²ƒK,=ø…‹Öèa½È½ÖéÖ²6½ó˜¹ã'=d=ü.üHÖµ½ñi6ØÅù;½Ò©ÚŸHÇ=ö°¦;³ˆ½ø©Ãªˆ²À=ãÜÛäsž=å·ÎmžI ½÷jg™\=ó¤+ƒl*ƽƆ {œ°½î=*X5=öÔ¹p`½ë™ºñËD‹½Êc]Ãea=ñQö0ú‘нòþ#†C/=ß^ ®Œ =ß×’.­í×½ñŽ¿èi=í½TZML»½Ã@£.Ö„¾½åÔ(P½ú=ð%Ÿ¥¯èî½äŸÖÖœ¶½¿ÄõGL+œ=èJx{Ÿ…ë½ë'¡šžd°=××LŸ¤žŠ=ÔÏ.òd)½çÁ!Ò‹A=ä圈+0½Â¶˜ìd™æ½Úr”vë(=åÜò,À½ÝsDR_’½‹ N—Ðþ–=ÛÎÁt‰‡½áWÉft9=ÓFœ„\ë=¹ü‡À@~5½Ù¨Æ›+Ó=ÛQᾋH½Èö¯+“ýϽÀXx‚¶©=ÕüŒkω½ÕÖ󇤮=ºˆ™#V2=½@w“˨½ÒÈb±|‹ =ÓVu"‘9§½Â»ulj½¶üh}úd=Ñ·XÈJé¼½Ô“œ‰=Å­‚5Š=µ¹¯E¨½ÓÆÎ S†‹=×+ Š<¾J½È?{7Jj»½ÀŒM¡ø=Ù±zúUí½Û:M¸Þ¬=Æ-îJ nü=ÌëÖo½à[ëãü€=Þ]g—k7½·«š®}dž½ØÁˆh¯Œ3=äbÿWá’½Ý)È;¼½±|ÊìA=âÕsï¾·_½çMu*0Þ=Ö ­!Á6=Ó”±»ÈÈR½éb±m…=ç³cƒ*ï½Â¹_La½ã’>míÌ=îs¬±¼û½äiø3½»7½Ä|’¿)÷=ìsIPisà½ð.t>õö =Ù·”ÑEìº=á‘£ˆ`´½ò­7ÖÁ¹=íÁ>÷¡×õ½£¿Íå¾à½í˜ÇiÝ=ôbÕ·Hɽåà„è3½Ú¶ìVÄF=ô0N+ ½óyÏ'v(´=Ѽþl“=ìÿ›M¦¼ô½÷Žß.j­M=ïUnZ΋>=Ð?ᎠD½õ‘Py\3B=÷Ýš¸.yA½áYN¶ %½êî1’õL=úzÉË8Z×½ôm{ãìfk½¬Ù=©~=öKwç]¯¬½ûñ†¬qõ=êHpöœ#=ç³qV¹½üߟN‡Þ=ùzÓB¿½Äñ}ÊŽlµ½öt¯ü.œœ=ÿ¦JAvMF½ñ¬|þ9œ½ã”f?ì¹ê=þÅãÄ1NϽý†Tføí=ÙiÉúG²=ö&Òp½â¾|'¯R©=ö*õjÒåV=Ý®ÈlxÕ¿¾ë”síE>Ü÷t_'½ä\¤–sïì½õî·]:j>ùR#´`»½úŒ¸<- ×½Ó|Šð©Z>±ªåÊ<¾×\h ^ù=ëÿxˆaO=ô¥4lË ¾Sv¨XŠÕ=þÅ_m…ã=ÂKƒ—äêݾ*Ô/Ìæm>´À1qÛ½ñ±ùT/ǽó»yM}Â>•?ñz ¾c#|{À=‰IzQF]³>šRóôäž¾vJ`F=õ, èi™=òæ0ÀÌêh¾Åô­`€>BóåZŠ5½Ã°‰€Ä´H¾ s à–ô>.óë €½øYdÃq"¸½ò@3)fÒ>î§ÉeN·¾ýÊDRY»=Ѫ¢"™ry>ŒÜ.rÕò¾ ®Ï–)-×=û-qq9)«=ñáL!@¾ Ö˜ü>Á>““4z¾ž½×ôéÿîàÞ¾&XC®jÃ> .'¿”-û½ýf°·½ñàìßLu> H¿¾8[²… =Ük(«W!>æ"WÒo¾  ¸ë?0˜=ÿOR" =òWý鮚¾¾ Œ)›^ï> NùOd½Þ«99!r«¾×·à.Ì/> Ê3îÉm¾Œ´áFÜç½ób—+:ä > ëÙ' ­¾ j¸þiBE=ÞP[úÌåÎ>Á„Ëqñ¾fjîŠ8>þ ùµ}=õK¨ñ2®¾d‡Í•ô¶> Qí*ˆt½½Úù\²ÿ©»¾qd<çZ{>XŸk  Y¾ûz2‰Ó½÷ªÅWE>õfLÔæ¾ ø€q™$‚=Ô_èÉß ¦> áÚn£¾ð¤®Å!Ó>Í) $†Q=ú­µ//$:¾ÌrY ¹‡> T…A¡×½Ä0Oå$¾ »~kL¯>vòâ`òè¾›J€@ ½þ ˜7²À˜>¤NeMRÀ¾ YK¢1•½­ø¦Ác—> 5²šÜÖ¾å,×KÛ"=ýÈžÇð>°¨Ç`´½¾}#—Co»> ÷^ƒ¸eÙ=Õ”FHBFF¾–§xi¾>2ÔP}*½úQÄ6ºE¸¾wòJnKÅ>NåÏû€&¾ A›+üνåëTù@>a€&>Œ¾SÁºÀ¦=õ§˜&,">¡2Þ4ë¾ bØiM*> §ä”¿´=ñ¢‚oœ¼¾bi«rša>9¹Ú ®½ïX«6®Ï¾ 3ëT•ä>©Uc,ÿ¾‹"xX5½ùbܳ¯.>°IQE{¾Ô‡6Vù)=ा§Í¸á>ÙshÅq ¾Ôâ Š>¯oü>3>Nns¾érï#»–>–•¶=› ûý¾Z™ÖΙ«>1B¼ Kw¾­¯A’ ¾ÛcåXÏ>ú^LŒÆ¾Ú˜<-7½å QË-•¢>Fö›Wp°¾ö~B=ø÷‚žZT> ÷ó{ó¾Ëwµn> šNHçûœ=õæý–+ˆ¾Ñó >IŽÛT9¥½ì<žù`¾ µ¬{yê>AÞvc¾Npô@Æk¾/wâo >»LÿX-2¾{… WO=¸qñ+Íã>¬¿1Ïþ@8æ4 %>â×™:p>Óuà7¾SÇwª>Aq‡Í=évŠIÕ¾@òtÈa>¦ègȘ½ø 2Fù?¾¤i˜ÿ –>ÓiŽ.FT¾ ~¥ª ó½üKæÆ…0>pÁ–YÁ¤¾X/b)'í=⊙ˆ–3>¬NKJ ¾ý›?*†> ¼Û¤àù>\êûŠú‘¾&ß^TA>;ص”¬í=à ¨ˆ«K¾ÉUÑèý]>^;”Ç~½þRZ#îqá¾°„ZLªä>2´Á¯+ݾA7³€û½úÌ[Œ@GQ>tîØ*:A¾Ó[m =çÓÂ4ç>]“?³â¾c[¥À:>Ī<´¤>1‘{Yþ ¾tŽ%1>AúneÒ=ámx§y\‡¾àžMSà>‹0¬ôk½þ™ l9¿¥¾y¿à1Zš>‹h¾™®¼Ö½þÜ*U/ê,>ûÍ_oER¾‚UŠßô=á6ÿzˆ’>|ÂUU¾{iíÃOñ>¹ÑÚ ­> ÃÍÊm -¾†e—D>.·€¯ªr=ïh¢_w5‚¾Í2ýÏv>Æ]¾‚Œ½ø…™ i}G¾Ú]ˆs’G>Åá°!´¾ȇiÓg¾™!82@>÷IdL ¾%r"°¾½¹¶`öa>¼ù&ã<¾ñÄœè>V…9ÅŠ>˜ï÷Ag¾‘È7±$>¬Ñ²c=ý•Ìò·\¾›Ç×ó¿Œ>É9פ½æ4¢"¥ž¾]ëÜà‰>~@÷x'=¾ rf2@g¾ éÑ~Xf¿>eB‡w¾JB ›{(½ó-Í@·J>3§µÈ¾}43{xy=ö ËúÜ®>f¬=ˆ”¾7Å|m>‘è’± e> #¬êþª¾P[KP&>nhh|X=ä½0EൾŸ¼Ù,¾y> á …|½ÿ –›Á^°¾ôÏ]úè>€c³Ã€q¾[Oñ<¾Íù Ÿ­>‹==(S¾$Ð:<½Ëz7gP>GpS ¦¾J]Jˈ‚>¢[x/z>*?‡¾ üú¼æ>ñÑ-¯A>íÏ ÷^¾ÒɆ"ì>wÓ:.à>½¶«›\¨A¾*1l á>KœÃ)¾o$aŠYh¾î㬵> w§õ:ql¾úÕóxS¾ÆµÍÉ>: û¨. ¾nS ìð)=Ð/©_Š©A>Zy »íì¾ q<…Þä>Ä“¹ÉrM>Ï¢o ýO¾ ÌÂ"zÆê>³8qÈ:´>µ¡®ÊŠÐ¾ÌàæòF> ×è";½ÑRÕ5šå¾â´ËQ®ƒ> [ÀdT¿¾øªÀ\§¤¾Wv¸-ÉY>!"iB¤s˜¾Ûq„£+¾̆ŸÆ¤­> H—bL ë¾NntA×M=ÁCx‘å>Èʧ¶ ¾ ’@¾Q5>ü¾ý›£/>aSPT‘¢¾!ws ç:>~dK'>CæðÓ¾ Â\óA>,1(‰Þ_=ÄèܢڻϾ WSñqµ> «ºaoݾ¹¥"ŠÁ¾í­Ö­×¬>!Æ1è:¬¾ŽŠËU 6¾ ¢Òöÿnü>!N5ðùñ羓BÛ—j½ä6D¶×‚ç> Ú·7²¾ œ¬í­C5>˘Í>öQm·Åm¾"O9±v>øž·ÉÝÉ>fÍ(ú ¾!àÊrŠ5>k2Šå=ôhð=ξ : VÍýácý½õèà›9›ì¾j¨•Óp>"•†‘敾Mîݳ¯¾(š˜¯7>"iS€ð¾–3z'h®¾¾Â–‡4¾>!34«ýe¾x[¬wÛ=áнH8>/¨/ù—¾"ˆèéc> ¶VX'‰>“ð ¾"ÑyU¶AA>õ~´ìH>›w/ºc¾"%CÉúÌ>¶ ¯l½æ=ßÖÃ6wÕp¾ c³ëÔò>!˜hÙ›R¾ ·—µ¾qHAÄ”é>"þ1hPi.¾jÀxz}°¾ÎÌ‘"¹w>"ô~wªž¾õ¼ Â~â½û~¦Z†“>!~oœk™¾ ÂQ8Øô =ìßàS¡{>uv·@¥¾"Ï€€îõ¬> º.{î„>¾ÉqIÖ¾#~Tf1fE>$Åãlɽ>Û%OÊ~¾"ÄïB[è>ÉΛí“=ဩîÓe¾ ³xç]ÉÖ>"!õ+ ¾{FnäN¾ä@Ñò±T>#šxRÇó¾ÔÞÇh¾{uwö >#¶ÝÑtrb¾ÈB% ¾ŠžBÈ%K>"x,m¡ª¾ Љñp¨=Ù»ý>î©V™4¾#ûï.>¨•å‚†>ÂñÙÊÚ¾$!{üñô=>T‡é·”>Û{ÐLà¾#Ò·ÖÔ0>s6ƒ¸)=ø A¯>q¾"7âÖGvO>!Ö n8¢ ½ñ(Qy2W¾ÝNûŠl>#ÎnO?;u¾ ¶.dÁ嫾NãíïmQ>$…}a!©ø¾‰Ùcsp¾ ‡5j/ ¼>#òµ8“›¾BÖÌ'½ñ>–ci„–>""oßn;¾"ˆÒ$1o =÷µø"å–>h¦´2”Ô¾$Oªg× x>¦ƒH& >±’fW"¾$ÝM¦e>Éÿ÷ |> 5ÏJ®Çx¾$,k_¶Û> %ÆÊõÃ=í‘ –d¾"Jñÿ¨BR>"õtý2/<½ùÈ 4( x¾¯ÝA¡­T>$¬¿ ˜ê@¾:Ͷ羬€ÙÉ°>%5wM–þ¾x‹ü¾ ëäoÇW>$‹›ìjé¾ I$p9)K½ðï 8k>>"º–1‘òŸ¾#YÈbý=÷6?^Õx`>Á­ˆD$]¾$çRð€Š>ÿ–²û+>QH¥—˜6¾%ŽBÛ^Ÿ>o"hÑ>«^—XX¾% „R,ö> ù\º¦=÷á©ÃÀáà¾#oQßp[ö>"ûëVçe½ïŠOO½×Ò¾ Ì«q7ÐV>$ôÔÅϤj¾ QrZD3¾—c >%ÛA•{ên¾®öN°\g¾8Í¥7>%¥öS×Á¾‘0­¦áj¾ÝAó;3„>$[« )Š¾"w Iˆ$=ÉÉ÷ljtã>"E“ï¾$½HŠ¸Å>s.ƉA>¿s§Aú¾&¬JhP´>´½Èçek>ó ]ð¾&7îG„ûr>öò+[ši> 6 dó~¾%`ø£ÁQ[>!t ~ W6=í*Jè‚[Ú¾#ŠXÃ/T³>$ê](½÷î¶NJľ ÍÙ’œH>%Ùpª¦)k¾­Ä°J¼¾˜—­ÜU>&˜š"ü£¾ oxz´¾eœ•úçÊ>&UHVC¾—Êþåd*¾Åg šž`>%í6 o–¾"åöâåu=€ïnAih_>"ëôlD¾%.?…îP>ä@Úš>ä¼Îž½Ê¾&Ž¤â–4Õ>sËÃÃáµ>˜á+Bì¾&û‰Oå¬>­öq0~>GIúm4ª¾&sâE«p\> æ‘Åܬ=ý.¶±Eøø¾%¾—úô>#Ãó»ó½ßŸNÕ}¾"´¶BZG>%Õ¢’ç`¾R\9,™¾Tù[Ž&>' ®øöW¾å\Œ ¥O¾;-Õi>'UdN‡È¾ØÚ”R…—¾”E<¿x>&»BÃôxÀ¾!\$2_æ&½ûÛë sÈÀ>%Có{Þá¾$"žöö{I=àätË¡öD>#¿_d¥¾&'Î"\Z >1öìk> \à뿾'[¦¹½ê>ª4¼ÔVM> …Þ¿ ¾'¶D¹ýû>‚™4 p”>Ýp ©¾'7Ò¡(,Ô>!.ºØ >ó-PÐ&¾%èDPzÆœ>$™}tL„½·trK–±¾#Ö°›ô»>& fJY ¾\T¶¾!WÔI.²>'~ƒ j󾪔”B4]¾¼4ÿL>(XõW:V¾Œ2Ö¾w¾о~¡Ô>'ÚgUS£s¾ I|žv|R¾¸5y´Û#>&ÛñAHð ¾#DÉ2>@½ê—ÍfÜ }>%"€Í‡ñ¾%ŸÏræS=õ1µž>"¿K¤í:³¾'Ld {•í> y¼pu>¤ø`¼ê¾(?”.nïï>»q—GœW>®òÖS+±¾(u4' "™> û'*Õ@>8X¶¶š¾'ïYCLb>!¾5½²>õVXˆ¯¾&´X¹~º>$n ‘ ¶=ÄŒg˜R¾$Ñ¢™¸,è>&…$`Öw½þÃO³£2~¾"WÕx¨B>'ö»XÜ(—¾ëM!KO¾·B¦‘L>(»Ðk¢¾i•ZÀ™-¾ép—&Ì>(ÑTrÜ¡k¾`Äù½tŽ¾z¤æ£“>(:Ír¿Å¾"@cóÂB¾>‡\ò*ü>&ÿDö ˆ¦¾$Ñ÷̨ɽÂ`ÙŒ;9>%*@}É‹Q¾&ÖS*°Ž=ýìI‹o”>"ÊÜ;”3¾(BΚ) j>ž%2¥‚Ä>æ¢Û -‰¾)CcУN>¹ºø¿êù>p¨eϾ)?€*‡>Žx >`„yþÄ ¾(ÏÑ1ô>!Ò!Ÿ½ù)>ÊšeÆPd¾'ÇëLAÑ>$mo¦Tƒ[=éw½k­m±¾&1@’à#ï>&‹mÊÐmô½òK^}¾$G#íõ>("c‹ÀŒ¾dG ó¾!‹õ^y8$>)*ÿ,¯“ƒ¾ƒ?ÑÇ}ɾ;!ßí˜>)£-m¯¯¾]î½Õça¾¿Š†¾>)‹ "ë˜ô¾ O'©Òn¾™”³ŽÛ¾>(æ8j!öɾ#Ž§”$¾Èïò>'»GkŽV¾%l<ðyI@½ÒKxôâi”>&h &ؾ'QüŸ °Ã=øþΕqÎH>#ú }Ë0O¾(¼lÕh“c> ötókqµ>!|Ë4¢´U¾)§ ]©Æ>iÛqÃNæ>T¯†”Ž¾*"‚‹ >êu`çT>%–¼£É¾)ø…ä(\[> o¸ç»ÿE>Á^ôón¾)c³îè“>#« Q3¦>^ÒKK)Y¾(W`ÆÖH>%bOÏËo¡=åeS*>6¢¾&Û=õz§Ñ>'G.IÎÀ ½ñd¥|Å9¾$øÙðõ>(À“ "¾ƒåAÓ Ÿ¾"»(‹Gñ>)ÈÌ¢Œ8 ¾ï~{¥©<¾ .MéD,h>*_±Ì(¤F¾FL¯¯P¾¾É¨ÀI’>*„î­,ž¾,u“lÉ&¾¸ Αþâ>*:ÀKF¾!ÆI„°ÊÕ¾ È’äl>)…".•=¾$)ÈÀ€Ò½ÿ~:Heœ>(i¯É–&¥¾&8órF ½ÔU7ùÍZ>&ï{»Wç`¾'í½lu =õ>Üž&>%¾Èôa¾)CܬàV>ŒfQ Y >#¿ç£|¾*8¶Ö U>;Qt2Ü> Ÿˆö a¾*Ë/”¶§>ú#2í ‰> YbÊ{_¾*ûæz°­Å>Ž'J ">|_ãÙ‘å¾*ÌöWز>!Xjä].ß>¨5"=y¾*AÒ9‰¦>#©¼XŠ6p>JrdÒ2A¾)]?ê$Ç>%´Æ·VŸ=ò$œ3ÀlB¾(&ÌõŸ˜>'t¤=ç½Ùn„Q0ˆ¾&¤U¼7Å>(å´sœr ½þšîÕÔ±l¾$ÜO[L>*˜Ã|iu¾ &åРÞ¾"Ö]g>*Ó«En=¾KpÏÉe¾ ›§G ¬4>+N…慨¾¿ŒP­¾g=/¿Z>+w¤¶Š¼¾ß ó¡M¾NÈhZ>+Q®UïÚ)¾!OÚàÿÕ¾üÀâx ³>*ßüåÅ›¾#{ üߺ¾ ”—_¥L>*#Oÿjø¾%l’ì Òw½ûÔÓ½j¨¨>)"Ò;S`*¾' çÌiѽÕõ8´WÍ¢>'ânà©|%¾(•Vþ­g=ð¹.ZüXf>&gsâd…¾)È0Dº1 >J«„ážø>$·®h¯d)¾*¸^H(¢> ñ¤ ê>"ØýBŠ©¾+e¸  S >üZ¼k> љÔº(¾+ÐÙð¼Ù>•hCÿÕ>Oœx~øy¾+úç.à{J>¨‘+Öí>Ãœ&{ÐK¾+å«™õE> ÿш鶈> ­4/p¾+“ŽYEÌ>#:Ajª„>gà %næ¾+^¦ÌŠ >$Õˆ Kþ>bŸd¾*DJw-`c>&zfß2=õN¼˜ºc¾)Mö{âÙÌ>'î>0=¸IÔ‘µŒ¾((8^‘z>)/P¶ù½ò_+ûný¾&×Ê)#V>*=¯0¾­ˆ>¾%^Áú(î>+­ÒÆOá¾ TÌ¢¾#Ôerg´>+¿<ç®0Ó¾—pǧ]¾" âÒ¡· >,4wÈhR¾÷ªÜª…ç¾ 6 é ÷>,x|3 °ú¾%3þd;˜šQ,àÈ>,Œ¬šà$¾ƒS€ ¾¡ÔfÖý>,rå*³Q¾!icù¾@5Š>,-±ý}¾#%)B"~â¾j×9Y¦‚>+½xT‘*R¾$¿ŸÝE ¾tAaô.>+&‹cçw·¾&5ð{V¼¾ &ô<ú>*jÚ¥p ñ¾'ˆòú¦h½î‰j)]ï>)èßDY¾(·® ÷á¢=¶u$%q5¨>(¨åYq¾)Áæ ­¬=ñÚýó) >'vhŸ^ZÁ¾*§¼.­>¬ƒŽ¹ê>&C&l:C„¾+iŠ/úÉF>ã—øyäÕ>$ù¼Ã¹è¾,èĮ́>Fèm)@>#šÔØÂÄ”¾,ƒ«b 6Û>ûàELð¤>"+Nê´ç»¾,Ýϼ« >c¼UN§> ­ÛÿŒÛ¾-t‚Ù(Ë>ø­ÖµÛÆ>E§$7ƒÃ¾-1ïNð¾n>;e‹ý8E>ÙVÛ?¾-.¤5S’°> ©Í¥² •>ç…Â'W¾-ª5Ôo>"ì?$ñU>§/œÎx¾,ÔÖNÁ¿ž>#{±¡â>aES£ý¾,‡›UÛ>$È"–y Ë> 1Ègdm¾,ãÆW–­>%ù¹!½ýì>¥U&ß䋾+–•Ò$Ý9>'#‡…Ý=þF;zUÙ¾+Mï Ç>(“¡É=ñbÌ*̈N¾*[Í:y¶¸>)FK9¬©=Ò¯O#´±¾)¤ÉŽ#"¹>)ÚŠ¥M²ñ½ßSUÃX¾(Þß…ê6ý>*šøy:6H½ôªÒY®¾( à ޺ƒ>+F]ihñ¾m~©æ ¾',÷Ú^B>+ÜfàªeX¾Üâ¨Ï¾&D+Ÿ»>,^ÜWpž]¾ ‡ñ`ëT.¾%R‘€ÍÆb>,Î)¡ã뾃"±ýd¾$YÜ•"x‡>-+&â%['¾*×»¤›¾#[Hýß‹\>-v¼§”Ïj¾ºG©ÚÒ[¾"X)Èêµ:>-±Ð•Ë¾0Ë}L¾!Q±Û‘>-ÝO *C²¾þHúMó¾ Iò÷en>-ú5²ø õ¾ÑS ƒ+¾~vµ=Å^>. vb‡¾ûNÓÌPÙ¾j¥¿p×£>. Ÿ,Y­¾ …­ËóB¾X€0³‹>.äH¹Õ¾!€ã¿–p¾IŸ{eùu>-î÷Nçëf¾"o}‚'rÚ¾?µO>-Ñ>«ÏO×¾#Qš!Cá¾<.ánã¸>-ªŸ@¢Å^¾$'x0хɾ@WÔâU¢>-|ÜUDÓ¾$ñcY¯/ξMm»FÂ">-FB´{»D¾%¯©>A'º¾ Èúõ1º®>- ?á›>*¾&b¤ª£Cؾ øH¢2T>,ÈÖÓ0†¾' ©Þj¡ ¾hŸv+YÓ>,‚ÆZó)˾'¨"nµ¾Ý~úmt>,8Ê‹•pо(;{…•C½üÙÜÕŠ>+ë²D”kí¾(ÅÀ«™†½ö/>Oë-ì>+œ*B¡¾)EhV0æA½ï}Hð6k>+JשÁÎà¾)¼Òà½ò‡½ãBâ…à¹>*ø\¹´yŠ¾*+ÑmÚ…é½Ìy? +ó*>*¥Pê"{[¾*’ÔCÖ=Áf7êó>*RRu4¾*ò8÷Lø=Þ©tÁù»@>)ÿÜÀ.<–¾+JÆíCÌ=éÐß­JO>)®t“^w¾+œ0j|0=ñçè+>)^’Û8h`¾+ç3‚þÐó=ö¥85>Ò>)¨PR¾,,kÌ°—O=û"жE¼”>(ÅZÅ·/¾,l´æî=ÿ`úzG>(|Ntsˆ¾,¦Š¡Ú½¾>®=âÝãå>(6™+™?¾,Ü hºY>ŒP²õs>'ôSôào…¾- 5á„ðl>JñÑÿ >'µÏJÒeÞ¾-: =0ÕF>ç¬w9µð>'{A "‡Ô¾-bþlJ)Ð>eKU”À£>'DÿžF¢½¾-ˆAĸmM> Âô07ËØ>'4B5vu¾-ª Šô¢9> ÙÕ½ýC>&æÉÛæ¾-ÈÒ Û´> ÿŒ§õG>&½âÑñ8z¾-äŠ!²às> ¡ì‘Dz>&š¯QZšÏ¾-ýy’ˆ> üêZãÄ>&|ª¹€_¾.Î’„çI>¼Ýhí¯{>&cöL¹b"¾.'©59ð>]‡Ý\Í¥>&P¦¢x÷¾.9'¡¯rþ>ßÀ>&B×Ü’GG¾.HeÄ›kÒ> »rw˜ê>&:•Þí¯Ñ¾.Ui¢vÎñ>B|¿È¨À>&7ðºC—S¾.`WK@K*>T¢‘É¥F>&:òjn¾.i#è¦Ak>W:ö™õ^>&Cœ¿ÞðG¾.oËh!I>JQÒä±£>&QåÇaö¸¾.t^4xN>-×[ýÒÔ>&eßæ°¾.v½bæm>½š~å>&q2Þ~h¾.vâtâ¬*>‹Ò’9Õ˜>&žšÎà¾.t°œ‚ȼ>ô¼×Dd²>&Ã&1CÌ/¾.p ÿ³>>œäÒ >&í$½q]¾.hÖ_Åßx> g‡ƒ¹êº>'d”á5¾.^ä»íQ[> qÈI1>'PÑ*Ûž¡¾.R ¥&R(> ZŒðÈ >'ŠBå]T¾.BÙ`Ý£> #‘Û¬è>'È‹FÉóæ¾..Æþ(Y(>̱Æò>( yóŽ'¾.ßMUq\>Sïÿ‹=l>(RÖƒ¾-ý2õzbä>ºÕ”²L >(žy¶{\¾-ÞZ¥˜÷>™Že>>(îP€±¾-»^L;Ï>%%g>×ï>)AMçF=¾-“¯ÒÃ>(`Ù±Ê`>)—ð#o¹¾-fò7Pú=üb~rS>)ñ©‘ö›­¾-3“Ÿò'=÷”ð øüƒ>*Nû #¾,ûO΢bý=òÒnïšDt>*¬Ú„_ËR¾,¼Ý =ë™Ì—aÜ>+ †.¯÷[¾,wØ"rŸ=á µp†%">+o­Øíµ¾,+á¡å’ò=ÇÔÒæ:R¸>+Ò晦à¾+ØŠ‘ÀÔ²½ÆŽÊNßÉ>,6¥†;¦¾+}^qídç½á¾Øß">,šfÄa/$¾+úðµ¹½îY=“ø´>,ý™cÙô|¾*­î?ï̽õ¸çÊÚŸŽ>-_­„p+ö¾*8É\atñ½ü‚Ånk…Ç>-ÀÝ<ľ)º)QŪ*¾ÄDÄ.:>.øüÄø¾)1“¥=ö ¾d%LÁ6i>.xß«Á ¾(ž¦òÌ)(¾ óÐ¥VW>.Ïü<*~¾(ùÁ Ó“¾ ö4œ“ù >/"Ÿ(qN;¾'X(!uÃr¾rËÕ`\>/p¹‘c…¾&£ÆZ˜©H¾v&väÂ3>/·MOœtǾ%ã™DÔ¾„Mñ¾™(>/÷ÈS¦*c¾%0DvǾœ8Ø`M>0C!H§ ¾$>OmìE¾¼¯òyÏN>00^£˜9Ÿ¾#X²?–#0¾ä‹•²gy>0CÂÎ6W¾"f£‰×T¾m·-­>0Qüì8O¾!fiMU—¾DÕø×G1>0Z™€Ós¾ YhØ0]"‰,þ~>:ëOQ¾!ØI„—ØÕ>0Y&PBM¾.ð! Š¾"ó2zî›>0N-\þŋ©a(¾$ Êúe.>0;Æ?Ó€‡¾@Êì[즾%$ ž,RÛ>0!wLj¨:¾¢‘›Xd´¾&7ÇÄc?>/ý¬y ³¾êñ ÷«¾'FæÀ“ž¿>/¦ÜÍ»~¾5Br.™¾(P,9Y>/=¸i!‘À¾e ©•â¾)R1ãv¥?>.ÁmVöä¾g‹Ðsd¾*KÂÙÜE >.1> oÖ«½ø~F³¡C¾+;k­ÖQA>-ŒyË8Ô½ç»ì"Š w¾,Ãîïì>,Ò~”ûˆ=°³QOÔ›¾,÷J)#û@>,ÂQ°Ì¸=ìk  \ç¾-ÀƒRzŸ>+½TçP*=û˜-䆾.yÛÖ­V0>* 1ö™m>”ÌòX–Ͼ/!β6»“>) ‚—Ÿã > o¾¾u½¾/¶ÇˆÇ÷>'áÊ.àá>+™òöu¾0’è“I2>&Ÿç»á>¢h“«°Õ¾0P¶„v)W>%FåÀyún>Ñòç¾0zšËÀç>#ÖþŸÓÚ>Œ<“_ì¾0–´íXŒä>"PÕö{§>÷fêö°Ë¾0¦Þí³> ³ðX¥-þ>!+ªðš#µ¾0§mŽ”>îèÒ>"ÓËžššÚ¾0š I]Ñ#>vãGë ,>$qäPLûñ¾0}T•š¹ >½ Gj‚>&±]V{L¾0P³_âÞg>éã’Ƀ¹>'†ØFáü{¾0¡ÀØ£> Þ\† ý¬>(ø÷ÍîÒ¾/‹Z“—%ò>«q½ Ô¦>*W”—‘­F¾.ÌìR@È=ú„I|ªÛŸ>+ 4=ýÖ¾-ëY[ú-U=⩳޳ Q>,ÐE„¾,æDT›ñ½àKXÜù`>-åY®]u¾+½~A[.½ùØx.Ît>.Üèpã„ƾ*q26cÖ¾×¢_ÿ'L>/´vîg¿b¾) É+¾ÉÇ‚=íû>04Òäl>Ѿ'n4Ÿ’G¾ÛŒ‹ø/>0}c'2¾%¹* 1AȾIŠ“cc >0±Û*ù®*¾#ã)o¾¨h³[¥]>0Ò,.§Š¾!í q ¾ x¯œæÞr>0Ý 'GD¾±­®m³¾"Ž¬ýR>0Ñ™E•2¾PØI;µA¾$’;à0O>0¯/ì¾»ò?Ú=¾&€³›ô^ý>0tì&Ã=¾ø4©\Š¾(UMÖXÆ>0"‹3aU·¾ å:ÿŽU¾*  ð€X">/o< cd½ÿë¡¡²2̾+¢æ¬¼¸o>.gí2í¸Þ½æw! ŒOô¾-mPw|'>-/@´E2=ãŒuO‰‚0¾.]‹Ý2ù>+Å.™ºÎ=þù­œV Z¾/z晟>**Ó–/¼> ¡v!W¾04Z\~ ¤>(a9¿ÿG¬>Za¡1ÛÔ¾0’> SZ>&iñsg®ƒ>–ãH;©¾0Õ%Wa…ø>$G ô®>ºÂ_ºÃ…¾0ü+AñÒ/>!úö³?„s> Ýçž¿å#¾1þ)_h>Y¹¢ª0>#GË\H™¾0ñ¢5Ö>ç1–ÉÅ>%•Ë•Œ9¾0¾OVgBž>& õ&•>'–lÞÿJ¾0kv$s a> 釹Ä>)ÈÈJRèÖ¾/ñ›Ëofë>2³€0¡->+£žÒûa‡¾.ÌF¯r—=éx©ý w>-MÄœ,´±¾-h@bßIò½æ‹¶Ð¢‚G>.Âe;Á=¾+Å“Æa¾¸áøs]#>/üæ`#‹v¾)æ<›8ìP¾ Ê­¾¢ià>0|€kØ’¾'Ì~Kážß–ƒÎÜ>0ÙcÎŽ’Š¾%{TI!-F¾¼(©â >1my×%ë¾"öD·zˆµ¾ 7mf+Zw>1)ð=$m¾ A‹Ú\d…¾"ô…rC™>1?ì!C¾Ä9!ã¾%ŽL6 g>0âüÚg¾º‰Ú•˜¾'ýÓÞiºG>0…Æ!³!ä¾ å+¼9`—¾*<¶Ï|š>0qw Ø ½ÿæÆ›4ù{¾,B…ˆ&Ø>.¬qù~}½Õåã&Œ¾. §˜ùS>- yÎÂG=õ@Øù x¹¾/Žr<µßè>+Á¨Þˆ>?q1#%¾0d2#½û>(çO»8‚;>¥Sôy?¾0Ù½B•ÛÈ>&nåOÕÎî>(䪲lè¾1%§ì¶À>#·­ŒJvÏ>{e}¦7ô¾1F(ø> ÇAìA(Ñ>"ÅG[|Ôʾ19Ôfë²>H:bbÉŸ>%¢6e°é¾0ÿµzæ§Ö>«Iýëö>(Kšh”t¶¾0—SAÀ¤> Ž…%kèß>*¸ÞLW÷Ò¾0±÷µ=ú¹°½«s>,á¼IN¾.xÒ‰¨#w½Á’‘Žü…v>.¾x!ÍQç¾,—*üµ¤½ÿVìÑdS>0#îlŽø¾*_݇E=ò¾0ÇcÁŠ>0»Åmz$ʾ'×yÀ×=k¾=çùÖ™ù>1#ø¦Þ·Í¾%°(øI¾1F1_o>1Z5~˜¯-¾!ë_ö48¾!íæ6¹ >1\»0€‰¾-ûM(¾%²Aœš•>1*^Ÿ_@ª¾B!†‰ç¾'ÿ&Ó‚ï­>0šL><¾ pÆòèwÀ¾*¥¾†¤€>0%o°¶¦X½ü\êÈFÈ$¾,ý{]p>.§¨*MDó=Åü4—«Ⱦ.ý¯ Å>,žu\}Ô>ŽÊ×[¾0N Ðÿˆ«>*4&(ÞFW>LA» ¾0éˆK|d>'nvÑÁdp>íqá vç¾1MâcY^Ø>$Tü}ëH>MÃ’ù¾1x˜Ónß> ðœ"U;´>#(5Ò„ó¯¾1gíN|/á>—>«Þ>>&nŒtÕ]¾1æýsÝ>âýL*§">)lÔ'| ¾0‘\8Z½ä>»d ½+û>,ßÍÙKû¾/˜ºØV¨=åD-Žç>.aháeµ¾-˜þny‰½öÄñ}ZÐ>0!ȩ̂ɾ+*žüb!,¾ þ阺>0Ø ˆ’ƒz¾(SÐ"‡ÁP¾(üÊ7¤>1QÎå®Ç¾%;M¤å¾œÏ…qÊ>1‹f½·~æ¾!‘AÜæAž"ÈXJýAØ>1‚»/sÓ¾wÙ´ä>¾&H!G?«+>16­ûe?ɾU—h\¾)wÅOÙn‹>0§(i<,¾³þh ‡¾,I,ä\>7>/ªCee½½áAKÇÁI¾.¯Z9¨U>-…SxA=ú¦bQíPÙ¾0OO{ÊÌ>*åÝ)íž>ÖrküR±¾1sùÅ8$>'ÔcaÕ>üÆ+Û:L¾1xø©àú>$[žç¸m> Üâ Zž1£Ævp»å> ˆCû )h>#þëO1f¾1„è­›ß>ÑÕϦaÍ>'“¬B¾1'žt>Ùê:m+>*ÈXêƒU‹¾0h3—­ø%=üI´Šƒå>-Xxâ¾.Ù?v]½á&™ –èò>/ÙâR<¾,WÜìè˾Âù&‹O¡>0ÍÜX„C±¾)T󛨾zrkÅ΢>1eKcÞ¥€¾%Ûö–ÛGY¾FÓ†>1¯WI ݾ!ú¥&ñâ|¾"Íxkf>1©_¥â1ؾ‚;Ë-@¾&¨OÔÆôG>1R,6p,;ƒ f¶¾* O‚Ñ>0©þéj²‘¾?$Ï a“¾-#…ÒR2r>/e>Ò‘ÛÉ=¿V¿Ì_ñU¾/¡Â mÕ¤>,ÞºÙ.«”>Me7§q¾0ÆrÆ‘6ô>)Ê,Ì s>>®¥ÈÞé¾1l¤wÁbæ>&4G°/5>äSÆIü¾1¿o›¡’>",““ƒ3>"Íx²í`4¾1º±J||>Š‚ÍÀk[>&ÒI2ÒZ2¾1^^QAe>%£µå¦h>*kÄy¾0ªwòUXê>¯R¼ >-ƒ÷¸!#¾/B„ôÎνÚìÌ½à‰ª>0’ˆ“¾,n¹’öm¾vªçL‘>0ø©\î#2¾)A<ôGS¾™¶0ÊBn>1•¡q¾%læUBR4¾|uIé>1ÖQDϾ!"”³^o¾#ýë^¨§>1¹©vßb¾î°Ï ¾( @óüx[>1>T„ÀE¾ ~fC0ë¾+Ÿ¶³É²ý>0e„…a„{½ò÷1˜­/ø¾.¢”M-f5>.dõ3²±½=öÉ –Ä_/¾0¼ºÍY>+UA-6Š>[Nmña¾1W›#…¡‹>'©ÂŸ«u>%ž©7z¾1ÎÊlèl>#uÝP“x>!Ú¬›ú=¾1â°í&ú¼>œB J>&D7dCɾ1‘rÆÿ®>˜—;yñÑ>*4ï dW¾0Û} ÕÔ>.ês·>-”i­Q´¾/†üLN3+½ÚÁI)I0a>0&„ã9Uþ¾,œýºœú>¾è7^î&>1&HÇŽYõ¾)†Ž?2Š¾3|¡>1ÂN³8é^¾$Ù@ÊÏë¾ ‰Äd0Ô>1õ¤rþ¾ )é -yª¾%6·„¸n>1½¡Ur¾&>¸©6­¾)iÝ¥ò.>1,a”¾Êë;ß›D¾-¯•Ð>0 º²ÆN½´]Òä'ÞȾ/øö2 ³N>-:ÅTu˜–>¥rj-j¾1?,wÊ>)¡€O´J>ÁYêe‘|¾1ÂËB7Ã,>%cÃศ•> ÒÁ3Ÿ¿¾2â÷NH¾> š5ú…>$õÝp"…ξ1Ñ`©¿þŠ>ÂÞ‡3RP>)Q•ø#¾1. HðãË>f:]”@è>-kÖí§Á¾0‡¸zô=²›zž¹º >0 ÍÛ°~¾->È‘Þ€Õ¾[ÛÑÏÁ(>1)8¸iŽœ¾)„º°ñ¾jàE —>1×+7\>²¾%)œ‚S¾ ÂéW¯ž>2ü9€Â¾ $êj5ÿ©¾%„YYvc>1п!î&¾v*%½¾)í»LI@•>1¢LC¾ f˦ka¾-­^âƒb·>/ÜY…Ò™=ÛÐÒÈÓ§J¾0SÓ÷çài>,© ¦b8‘> ñ·Äli¾1bâ7²]>(­¡¢•Áx>õœÒsN¾1û;ÑîY€>$ïáø ÷>!å*Nxñ¾2K׊b>ùÈ>&ØÁ%m©¾1´Ö½Á‚><à䋵ß>+17ÜŸ–¾0Õß½ü¥=ùtXLS>.Íé&_-¾.ù—.¼{ž½öõŒUf’>0ÉgQ ¶3¾+hh?*ß_¾¼%îèÖÒ>1´º-F;*¾' Ðg:%–¾H¯`Mp>2 æ¼o÷¾" ó‚y¾$è¬÷…>2 _Gê©b¾îuÖ¹·¾(ÚþÄ«>1mXƒ§¾ ªÖ ¾,þot¹>0OÓØ"Lù½ÇBa¥ÌK¾0'§1>-oX¸^ç>S¶wã¾1X+ëB >)_\ù!>ÂÙ!iÞ¾2î0Bñ>$Šáfëá¨>!š¤ãD¸L¾2/¶Å¸}]>+ \j(É>&Ó×*Güx¾1Ìà”ì¹î>N>˜ ¹7>+c(맼¾0àÛi2º±=÷_®XUÔ>/$¢tb’±¾.⡾)ì$½ûbV2»@O>0ûÕŽæ_¾+ócؾ`Ôiâ7’>1áúçÊK¾&eƒ†tD¾]¸qƒR‹>22pÖg$‘¾1~lÚV¾*Ó~xv¯>1@ ž|k¾5iX*W”¾.5ôp},e>/ß Ožó=ꯪ–ÌÕ¾0¯Úz?»>,8äÀ=Ð×>8¦ÖGô¾1¾éŸV?{>'©•ç)é>£ñeK" ¾2>)ˆw;·>"T&¦ðJˆ>$aì^m0¾2'ÿ ÁŠR>Å$®«n->)>¢ë•Â³¾1{¨+âú>TÚzXÑ>-˜agþÖ¾0=6wçU¬½Ò8žÚrò§>0’*‚08¾,ë=¡ó¾ ¦ç{òSL>1©ç{—8b¾(e¯rÓ¾%ylõ>2@y„dò¾# â:¾ ³¾#€†ÝRu >2;_ˆæľ`üõ#¾(Ô„• p­>1š­%Ìuî¾ S§…Ú¬š¾-X*7ÿü¹>0aÄÑbç]=°Óä×E>¾0q*úv—>-3 è55T> j5zºa.¾1¨å_ŽÊ>(¡çèöI>¾“†cÊh¾2GBìé9½>#4 {^>#t¢3é¾2EPð §å>/’w^_>(ã«£ ¹¾1¡¢ÂÿtM> KYb,>-z}Ä´à5¾0`aʼn÷½Å €´;·{>0‡ñ±Ã¶¾-¨|£dE¾ µÁ%CÓW>1½ÎeK ƒ¾(c=Ø‹oú¾˜4ÑÄ^>2UJTˆÊ„¾"ΨËÉ|r¾#órø þ >2F™V¸š¾‘ɾ)j1#ØåÃ>1¼Ò,´¾1ãdÇÅL¾-ü~›{±·>08·õíã=âÃÖÄŽb¾0¿¬š—>,“ Âë…>@V îо1åã<2àÄ>'§€P@_N>jMp×¾2f´õ¨6->!Ú…š<|>$÷é!ÛÊ=¾2;ETðŠ>ÁXÑffA>*aá•Ïv¾1c§¬‘‘«>ÖæÒ™@u>.Õ/íúán¾/Ì©Û©µ½õ,zÎd”>1¸œ?ä¾+ ¥ &’¾[¬P¼>2ŵôœñ¾&gõÃ=Ⱦ ^‡EÉut>2tpëHøô¾ Q´?¨–¨¾&w‘ µ‡>2Ö¤‰ú"¾2 ¡ÀT¾+ºr»¸W>1ÌÒVë½óé‚Cr³¾/ó–Dù„v>.ÃÜðÔ]Ë>ó‘r J(¾1{T9veê>*0óÉí>œŠÁ°Où¾2Qª© ¬>$—|m·¹>"p—ªü>¾2s ·") ¾ 6 é ÷>,x|3 °ú¾%3þd;˜šQ,àÈ>,Œ¬šà$¾ƒS€ ¾¡ÔfÖý>,rå*³Q¾!icù¾@5Š>,-±ý}¾#%)B"~â¾j×9Y¦‚>+½xT‘*R¾$¿ŸÝE ¾tAaô.>+&‹cçw·¾&5ð{V¼¾ &ô<ú>*jÚ¥p ñ¾'ˆòú¦h½î‰j)]ï>)èßDY¾(·® ÷á¢=¶u$%q5¨>(¨åYq¾)Áæ ­¬=ñÚýó) >'vhŸ^ZÁ¾*§¼.­>¬ƒŽ¹ê>&C&l:C„¾+iŠ/úÉF>ã—øyäÕ>$ù¼Ã¹è¾,èĮ́>Fèm)@>#šÔØÂÄ”¾,ƒ«b 6Û>ûàELð¤>"+Nê´ç»¾,Ýϼ« >c¼UN§> ­ÛÿŒÛ¾-t‚Ù(Ë>ø­ÖµÛÆ>E§$7ƒÃ¾-1ïNð¾n>;e‹ý8E>ÙVÛ?¾-.¤5S’°> ©Í¥² •>ç…Â'W¾-ª5Ôo>"ì?$ñU>§/œÎx¾,ÔÖNÁ¿ž>#{±¡â>aES£ý¾,‡›UÛ>$È"–y Ë> 1Ègdm¾,ãÆW–­>%ù¹!½ýì>¥U&ß䋾+–•Ò$Ý9>'#‡…Ý=þF;zUÙ¾+Mï Ç>(“¡É=ñbÌ*̈N¾*[Í:y¶¸>)FK9¬©=Ò¯O#´±¾)¤ÉŽ#"¹>)ÚŠ¥M²ñ½ßSUÃX¾(Þß…ê6ý>*šøy:6H½ôªÒY®¾( à ޺ƒ>+F]ihñ¾m~©æ ¾',÷Ú^B>+ÜfàªeX¾Üâ¨Ï¾&D+Ÿ»>,^ÜWpž]¾ ‡ñ`ëT.¾%R‘€ÍÆb>,Î)¡ã뾃"±ýd¾$YÜ•"x‡>-+&â%['¾*×»¤›¾#[Hýß‹\>-v¼§”Ïj¾ºG©ÚÒ[¾"X)Èêµ:>-±Ð•Ë¾0Ë}L¾!Q±Û‘>-ÝO *C²¾þHúMó¾ Iò÷en>-ú5²ø õ¾ÑS ƒ+¾~vµ=Å^>. vb‡¾ûNÓÌPÙ¾j¥¿p×£>. Ÿ,Y­¾ …­ËóB¾X€0³‹>.äH¹Õ¾!€ã¿–p¾IŸ{eùu>-î÷Nçëf¾"o}‚'rÚ¾?µO>-Ñ>«ÏO×¾#Qš!Cá¾<.ánã¸>-ªŸ@¢Å^¾$'x0хɾ@WÔâU¢>-|ÜUDÓ¾$ñcY¯/ξMm»FÂ">-FB´{»D¾%¯©>A'º¾ Èúõ1º®>- ?á›>*¾&b¤ª£Cؾ øH¢2T>,ÈÖÓ0†¾' ©Þj¡ ¾hŸv+YÓ>,‚ÆZó)˾'¨"nµ¾Ý~úmt>,8Ê‹•pо(;{…•C½üÙÜÕŠ>+ë²D”kí¾(ÅÀ«™†½ö/>Oë-ì>+œ*B¡¾)EhV0æA½ï}Hð6k>+JשÁÎà¾)¼Òà½ò‡½ãBâ…à¹>*ø\¹´yŠ¾*+ÑmÚ…é½Ìy? +ó*>*¥Pê"{[¾*’ÔCÖ=Áf7êó>*RRu4¾*ò8÷Lø=Þ©tÁù»@>)ÿÜÀ.<–¾+JÆíCÌ=éÐß­JO>)®t“^w¾+œ0j|0=ñçè+>)^’Û8h`¾+ç3‚þÐó=ö¥85>Ò>)¨PR¾,,kÌ°—O=û"жE¼”>(ÅZÅ·/¾,l´æî=ÿ`úzG>(|Ntsˆ¾,¦Š¡Ú½¾>®=âÝãå>(6™+™?¾,Ü hºY>ŒP²õs>'ôSôào…¾- 5á„ðl>JñÑÿ >'µÏJÒeÞ¾-: =0ÕF>ç¬w9µð>'{A "‡Ô¾-bþlJ)Ð>eKU”À£>'DÿžF¢½¾-ˆAĸmM> Âô07ËØ>'4B5vu¾-ª Šô¢9> ÙÕ½ýC>&æÉÛæ¾-ÈÒ Û´> ÿŒ§õG>&½âÑñ8z¾-äŠ!²às> ¡ì‘Dz>&š¯QZšÏ¾-ýy’ˆ> üêZãÄ>&|ª¹€_¾.Î’„çI>¼Ýhí¯{>&cöL¹b"¾.'©59ð>]‡Ý\Í¥>&P¦¢x÷¾.9'¡¯rþ>ßÀ>&B×Ü’GG¾.HeÄ›kÒ> »rw˜ê>&:•Þí¯Ñ¾.Ui¢vÎñ>B|¿È¨À>&7ðºC—S¾.`WK@K*>T¢‘É¥F>&:òjn¾.i#è¦Ak>W:ö™õ^>&Cœ¿ÞðG¾.oËh!I>JQÒä±£>&QåÇaö¸¾.t^4xN>-×[ýÒÔ>&eßæ°¾.v½bæm>½š~å>&q2Þ~h¾.vâtâ¬*>‹Ò’9Õ˜>&žšÎà¾.t°œ‚ȼ>ô¼×Dd²>&Ã&1CÌ/¾.p ÿ³>>œäÒ >&í$½q]¾.hÖ_Åßx> g‡ƒ¹êº>'d”á5¾.^ä»íQ[> qÈI1>'PÑ*Ûž¡¾.R ¥&R(> ZŒðÈ >'ŠBå]T¾.BÙ`Ý£> #‘Û¬è>'È‹FÉóæ¾..Æþ(Y(>̱Æò>( yóŽ'¾.ßMUq\>Sïÿ‹=l>(RÖƒ¾-ý2õzbä>ºÕ”²L >(žy¶{\¾-ÞZ¥˜÷>™Že>>(îP€±¾-»^L;Ï>%%g>×ï>)AMçF=¾-“¯ÒÃ>(`Ù±Ê`>)—ð#o¹¾-fò7Pú=üb~rS>)ñ©‘ö›­¾-3“Ÿò'=÷”ð øüƒ>*Nû #¾,ûO΢bý=òÒnïšDt>*¬Ú„_ËR¾,¼Ý =ë™Ì—aÜ>+ †.¯÷[¾,wØ"rŸ=á µp†%">+o­Øíµ¾,+á¡å’ò=ÇÔÒæ:R¸>+Ò晦à¾+ØŠ‘ÀÔ²½ÆŽÊNßÉ>,6¥†;¦¾+}^qídç½á¾Øß">,šfÄa/$¾+úðµ¹½îY=“ø´>,ý™cÙô|¾*­î?ï̽õ¸çÊÚŸŽ>-_­„p+ö¾*8É\atñ½ü‚Ånk…Ç>-ÀÝ<ľ)º)QŪ*¾ÄDÄ.:>.øüÄø¾)1“¥=ö ¾d%LÁ6i>.xß«Á ¾(ž¦òÌ)(¾ óÐ¥VW>.Ïü<*~¾(ùÁ Ó“¾ ö4œ“ù >/"Ÿ(qN;¾'X(!uÃr¾rËÕ`\>/p¹‘c…¾&£ÆZ˜©H¾v&väÂ3>/·MOœtǾ%ã™DÔ¾„Mñ¾™(>/÷ÈS¦*c¾%0DvǾœ8Ø`M>0C!H§ ¾$>OmìE¾¼¯òyÏN>00^£˜9Ÿ¾#X²?–#0¾ä‹•²gy>0CÂÎ6W¾"f£‰×T¾m·-­>0Qüì8O¾!fiMU—¾DÕø×G1>0Z™€Ós¾ YhØ0]"‰,þ~>:ëOQ¾!ØI„—ØÕ>0Y&PBM¾.ð! Š¾"ó2zî›>0N-\þŋ©a(¾$ Êúe.>0;Æ?Ó€‡¾@Êì[즾%$ ž,RÛ>0!wLj¨:¾¢‘›Xd´¾&7ÇÄc?>/ý¬y ³¾êñ ÷«¾'FæÀ“ž¿>/¦ÜÍ»~¾5Br.™¾(P,9Y>/=¸i!‘À¾e ©•â¾)R1ãv¥?>.ÁmVöä¾g‹Ðsd¾*KÂÙÜE >.1> oÖ«½ø~F³¡C¾+;k­ÖQA>-ŒyË8Ô½ç»ì"Š w¾,Ãîïì>,Ò~”ûˆ=°³QOÔ›¾,÷J)#û@>,ÂQ°Ì¸=ìk  \ç¾-ÀƒRzŸ>+½TçP*=û˜-䆾.yÛÖ­V0>* 1ö™m>”ÌòX–Ͼ/!β6»“>) ‚—Ÿã > o¾¾u½¾/¶ÇˆÇ÷>'áÊ.àá>+™òöu¾0’è“I2>&Ÿç»á>¢h“«°Õ¾0P¶„v)W>%FåÀyún>Ñòç¾0zšËÀç>#ÖþŸÓÚ>Œ<“_ì¾0–´íXŒä>"PÕö{§>÷fêö°Ë¾0¦Þí³> ³ðX¥-þ>!+ªðš#µ¾0§mŽ”>îèÒ>"ÓËžššÚ¾0š I]Ñ#>vãGë ,>$qäPLûñ¾0}T•š¹ >½ Gj‚>&±]V{L¾0P³_âÞg>éã’Ƀ¹>'†ØFáü{¾0¡ÀØ£> Þ\† ý¬>(ø÷ÍîÒ¾/‹Z“—%ò>«q½ Ô¦>*W”—‘­F¾.ÌìR@È=ú„I|ªÛŸ>+ 4=ýÖ¾-ëY[ú-U=⩳޳ Q>,ÐE„¾,æDT›ñ½àKXÜù`>-åY®]u¾+½~A[.½ùØx.Ît>.Üèpã„ƾ*q26cÖ¾×¢_ÿ'L>/´vîg¿b¾) É+¾ÉÇ‚=íû>04Òäl>Ѿ'n4Ÿ’G¾ÛŒ‹ø/>0}c'2¾%¹* 1AȾIŠ“cc >0±Û*ù®*¾#ã)o¾¨h³[¥]>0Ò,.§Š¾!í q ¾ x¯œæÞr>0Ý 'GD¾±­®m³¾"Ž¬ýR>0Ñ™E•2¾PØI;µA¾$’;à0O>0¯/ì¾»ò?Ú=¾&€³›ô^ý>0tì&Ã=¾ø4©\Š¾(UMÖXÆ>0"‹3aU·¾ å:ÿŽU¾*  ð€X">/o< cd½ÿë¡¡²2̾+¢æ¬¼¸o>.gí2í¸Þ½æw! ŒOô¾-mPw|'>-/@´E2=ãŒuO‰‚0¾.]‹Ý2ù>+Å.™ºÎ=þù­œV Z¾/z晟>**Ó–/¼> ¡v!W¾04Z\~ ¤>(a9¿ÿG¬>Za¡1ÛÔ¾0’> SZ>&iñsg®ƒ>–ãH;©¾0Õ%Wa…ø>$G ô®>ºÂ_ºÃ…¾0ü+AñÒ/>!úö³?„s> Ýçž¿å#¾1þ)_h>Y¹¢ª0>#GË\H™¾0ñ¢5Ö>ç1–ÉÅ>%•Ë•Œ9¾0¾OVgBž>& õ&•>'–lÞÿJ¾0kv$s a> 釹Ä>)ÈÈJRèÖ¾/ñ›Ëofë>2³€0¡->+£žÒûa‡¾.ÌF¯r—=éx©ý w>-MÄœ,´±¾-h@bßIò½æ‹¶Ð¢‚G>.Âe;Á=¾+Å“Æa¾¸áøs]#>/üæ`#‹v¾)æ<›8ìP¾ Ê­¾¢ià>0|€kØ’¾'Ì~Kážß–ƒÎÜ>0ÙcÎŽ’Š¾%{TI!-F¾¼(©â >1my×%ë¾"öD·zˆµ¾ 7mf+Zw>1)ð=$m¾ A‹Ú\d…¾"ô…rC™>1?ì!C¾Ä9!ã¾%ŽL6 g>0âüÚg¾º‰Ú•˜¾'ýÓÞiºG>0…Æ!³!ä¾ å+¼9`—¾*<¶Ï|š>0qw Ø ½ÿæÆ›4ù{¾,B…ˆ&Ø>.¬qù~}½Õåã&Œ¾. §˜ùS>- yÎÂG=õ@Øù x¹¾/Žr<µßè>+Á¨Þˆ>?q1#%¾0d2#½û>(çO»8‚;>¥Sôy?¾0Ù½B•ÛÈ>&nåOÕÎî>(䪲lè¾1%§ì¶À>#·­ŒJvÏ>{e}¦7ô¾1F(ø> ÇAìA(Ñ>"ÅG[|Ôʾ19Ôfë²>H:bbÉŸ>%¢6e°é¾0ÿµzæ§Ö>«Iýëö>(Kšh”t¶¾0—SAÀ¤> Ž…%kèß>*¸ÞLW÷Ò¾0±÷µ=ú¹°½«s>,á¼IN¾.xÒ‰¨#w½Á’‘Žü…v>.¾x!ÍQç¾,—*üµ¤½ÿVìÑdS>0#îlŽø¾*_݇E=ò¾0ÇcÁŠ>0»Åmz$ʾ'×yÀ×=k¾=çùÖ™ù>1#ø¦Þ·Í¾%°(øI¾1F1_o>1Z5~˜¯-¾!ë_ö48¾!íæ6¹ >1\»0€‰¾-ûM(¾%²Aœš•>1*^Ÿ_@ª¾B!†‰ç¾'ÿ&Ó‚ï­>0šL><¾ pÆòèwÀ¾*¥¾†¤€>0%o°¶¦X½ü\êÈFÈ$¾,ý{]p>.§¨*MDó=Åü4—«Ⱦ.ý¯ Å>,žu\}Ô>ŽÊ×[¾0N Ðÿˆ«>*4&(ÞFW>LA» ¾0éˆK|d>'nvÑÁdp>íqá vç¾1MâcY^Ø>$Tü}ëH>MÃ’ù¾1x˜Ónß> ðœ"U;´>#(5Ò„ó¯¾1gíN|/á>—>«Þ>>&nŒtÕ]¾1æýsÝ>âýL*§">)lÔ'| ¾0‘\8Z½ä>»d ½+û>,ßÍÙKû¾/˜ºØV¨=åD-Žç>.aháeµ¾-˜þny‰½öÄñ}ZÐ>0!ȩ̂ɾ+*žüb!,¾ þ阺>0Ø ˆ’ƒz¾(SÐ"‡ÁP¾(üÊ7¤>1QÎå®Ç¾%;M¤å¾œÏ…qÊ>1‹f½·~æ¾!‘AÜæAž"ÈXJýAØ>1‚»/sÓ¾wÙ´ä>¾&H!G?«+>16­ûe?ɾU—h\¾)wÅOÙn‹>0§(i<,¾³þh ‡¾,I,ä\>7>/ªCee½½áAKÇÁI¾.¯Z9¨U>-…SxA=ú¦bQíPÙ¾0OO{ÊÌ>*åÝ)íž>ÖrküR±¾1sùÅ8$>'ÔcaÕ>üÆ+Û:L¾1xø©àú>$[žç¸m> Üâ Zž1£Ævp»å> ˆCû )h>#þëO1f¾1„è­›ß>ÑÕϦaÍ>'“¬B¾1'žt>Ùê:m+>*ÈXêƒU‹¾0h3—­ø%=üI´Šƒå>-Xxâ¾.Ù?v]½á&™ –èò>/ÙâR<¾,WÜìè˾Âù&‹O¡>0ÍÜX„C±¾)T󛨾zrkÅ΢>1eKcÞ¥€¾%Ûö–ÛGY¾FÓ†>1¯WI ݾ!ú¥&ñâ|¾"Íxkf>1©_¥â1ؾ‚;Ë-@¾&¨OÔÆôG>1R,6p,;ƒ f¶¾* O‚Ñ>0©þéj²‘¾?$Ï a“¾-#…ÒR2r>/e>Ò‘ÛÉ=¿V¿Ì_ñU¾/¡Â mÕ¤>,ÞºÙ.«”>Me7§q¾0ÆrÆ‘6ô>)Ê,Ì s>>®¥ÈÞé¾1l¤wÁbæ>&4G°/5>äSÆIü¾1¿o›¡’>",““ƒ3>"Íx²í`4¾1º±J||>Š‚ÍÀk[>&ÒI2ÒZ2¾1^^QAe>%£µå¦h>*kÄy¾0ªwòUXê>¯R¼ >-ƒ÷¸!#¾/B„ôÎνÚìÌ½à‰ª>0’ˆ“¾,n¹’öm¾vªçL‘>0ø©\î#2¾)A<ôGS¾™¶0ÊBn>1•¡q¾%læUBR4¾|uIé>1ÖQDϾ!"”³^o¾#ýë^¨§>1¹©vßb¾î°Ï ¾( @óüx[>1>T„ÀE¾ ~fC0ë¾+Ÿ¶³É²ý>0e„…a„{½ò÷1˜­/ø¾.¢”M-f5>.dõ3²±½=öÉ –Ä_/¾0¼ºÍY>+UA-6Š>[Nmña¾1W›#…¡‹>'©ÂŸ«u>%ž©7z¾1ÎÊlèl>#uÝP“x>!Ú¬›ú=¾1â°í&ú¼>œB J>&D7dCɾ1‘rÆÿ®>˜—;yñÑ>*4ï dW¾0Û} ÕÔ>.ês·>-”i­Q´¾/†üLN3+½ÚÁI)I0a>0&„ã9Uþ¾,œýºœú>¾è7^î&>1&HÇŽYõ¾)†Ž?2Š¾3|¡>1ÂN³8é^¾$Ù@ÊÏë¾ ‰Äd0Ô>1õ¤rþ¾ )é -yª¾%6·„¸n>1½¡Ur¾&>¸©6­¾)iÝ¥ò.>1,a”¾Êë;ß›D¾-¯•Ð>0 º²ÆN½´]Òä'ÞȾ/øö2 ³N>-:ÅTu˜–>¥rj-j¾1?,wÊ>)¡€O´J>ÁYêe‘|¾1ÂËB7Ã,>%cÃศ•> ÒÁ3Ÿ¿¾2â÷NH¾> š5ú…>$õÝp"…ξ1Ñ`©¿þŠ>ÂÞ‡3RP>)Q•ø#¾1. HðãË>f:]”@è>-kÖí§Á¾0‡¸zô=²›zž¹º >0 ÍÛ°~¾->È‘Þ€Õ¾[ÛÑÏÁ(>1)8¸iŽœ¾)„º°ñ¾jàE —>1×+7\>²¾%)œ‚S¾ ÂéW¯ž>2ü9€Â¾ $êj5ÿ©¾%„YYvc>1п!î&¾v*%½¾)í»LI@•>1¢LC¾ f˦ka¾-­^âƒb·>/ÜY…Ò™=ÛÐÒÈÓ§J¾0SÓ÷çài>,© ¦b8‘> ñ·Äli¾1bâ7²]>(­¡¢•Áx>õœÒsN¾1û;ÑîY€>$ïáø ÷>!å*Nxñ¾2K׊b>ùÈ>&ØÁ%m©¾1´Ö½Á‚><à䋵ß>+17ÜŸ–¾0Õß½ü¥=ùtXLS>.Íé&_-¾.ù—.¼{ž½öõŒUf’>0ÉgQ ¶3¾+hh?*ß_¾¼%îèÖÒ>1´º-F;*¾' Ðg:%–¾H¯`Mp>2 æ¼o÷¾" ó‚y¾$è¬÷…>2 _Gê©b¾îuÖ¹·¾(ÚþÄ«>1mXƒ§¾ ªÖ ¾,þot¹>0OÓØ"Lù½ÇBa¥ÌK¾0'§1>-oX¸^ç>S¶wã¾1X+ëB >)_\ù!>ÂÙ!iÞ¾2î0Bñ>$Šáfëá¨>!š¤ãD¸L¾2/¶Å¸}]>+ \j(É>&Ó×*Güx¾1Ìà”ì¹î>N>˜ ¹7>+c(맼¾0àÛi2º±=÷_®XUÔ>/$¢tb’±¾.⡾)ì$½ûbV2»@O>0ûÕŽæ_¾+ócؾ`Ôiâ7’>1áúçÊK¾&eƒ†tD¾]¸qƒR‹>22pÖg$‘¾1~lÚV¾*Ó~xv¯>1@ ž|k¾5iX*W”¾.5ôp},e>/ß Ožó=ꯪ–ÌÕ¾0¯Úz?»>,8äÀ=Ð×>8¦ÖGô¾1¾éŸV?{>'©•ç)é>£ñeK" ¾2>)ˆw;·>"T&¦ðJˆ>$aì^m0¾2'ÿ ÁŠR>Å$®«n->)>¢ë•Â³¾1{¨+âú>TÚzXÑ>-˜agþÖ¾0=6wçU¬½Ò8žÚrò§>0’*‚08¾,ë=¡ó¾ ¦ç{òSL>1©ç{—8b¾(e¯rÓ¾%ylõ>2@y„dò¾# â:¾ ³¾#€†ÝRu >2;_ˆæľ`üõ#¾(Ô„• p­>1š­%Ìuî¾ S§…Ú¬š¾-X*7ÿü¹>0aÄÑbç]=°Óä×E>¾0q*úv—>-3 è55T> j5zºa.¾1¨å_ŽÊ>(¡çèöI>¾“†cÊh¾2GBìé9½>#4 {^>#t¢3é¾2EPð §å>/’w^_>(ã«£ ¹¾1¡¢ÂÿtM> KYb,>-z}Ä´à5¾0`aʼn÷½Å €´;·{>0‡ñ±Ã¶¾-¨|£dE¾ µÁ%CÓW>1½ÎeK ƒ¾(c=Ø‹oú¾˜4ÑÄ^>2UJTˆÊ„¾"ΨËÉ|r¾#órø þ >2F™V¸š¾‘ɾ)j1#ØåÃ>1¼Ò,´¾1ãdÇÅL¾-ü~›{±·>08·õíã=âÃÖÄŽb¾0¿¬š—>,“ Âë…>@V îо1åã<2àÄ>'§€P@_N>jMp×¾2f´õ¨6->!Ú…š<|>$÷é!ÛÊ=¾2;ETðŠ>ÁXÑffA>*aá•Ïv¾1c§¬‘‘«>ÖæÒ™@u>.Õ/íúán¾/Ì©Û©µ½õ,zÎd”>1¸œ?ä¾+ ¥ &’¾[¬P¼>2ŵôœñ¾&gõÃ=Ⱦ ^‡EÉut>2tpëHøô¾ Q´?¨–¨¾&w‘ µ‡>2Ö¤‰ú"¾2 ¡ÀT¾+ºr»¸W>1ÌÒVë½óé‚Cr³¾/ó–Dù„v>.ÃÜðÔ]Ë>ó‘r J(¾1{T9veê>*0óÉí>œŠÁ°Où¾2Qª© ¬>$—|m·¹>"p—ªü>¾2s ·") ¾ 6 é ÷>,x|3 °ú¾%3þd;˜šQ,àÈ>,Œ¬šà$¾ƒS€ ¾¡ÔfÖý>,rå*³Q¾!icù¾@5Š>,-±ý}¾#%)B"~â¾j×9Y¦‚>+½xT‘*R¾$¿ŸÝE ¾tAaô.>+&‹cçw·¾&5ð{V¼¾ &ô<ú>*jÚ¥p ñ¾'ˆòú¦h½î‰j)]ï>)èßDY¾(·® ÷á¢=¶u$%q5¨>(¨åYq¾)Áæ ­¬=ñÚýó) >'vhŸ^ZÁ¾*§¼.­>¬ƒŽ¹ê>&C&l:C„¾+iŠ/úÉF>ã—øyäÕ>$ù¼Ã¹è¾,èĮ́>Fèm)@>#šÔØÂÄ”¾,ƒ«b 6Û>ûàELð¤>"+Nê´ç»¾,Ýϼ« >c¼UN§> ­ÛÿŒÛ¾-t‚Ù(Ë>ø­ÖµÛÆ>E§$7ƒÃ¾-1ïNð¾n>;e‹ý8E>ÙVÛ?¾-.¤5S’°> ©Í¥² •>ç…Â'W¾-ª5Ôo>"ì?$ñU>§/œÎx¾,ÔÖNÁ¿ž>#{±¡â>aES£ý¾,‡›UÛ>$È"–y Ë> 1Ègdm¾,ãÆW–­>%ù¹!½ýì>¥U&ß䋾+–•Ò$Ý9>'#‡…Ý=þF;zUÙ¾+Mï Ç>(“¡É=ñbÌ*̈N¾*[Í:y¶¸>)FK9¬©=Ò¯O#´±¾)¤ÉŽ#"¹>)ÚŠ¥M²ñ½ßSUÃX¾(Þß…ê6ý>*šøy:6H½ôªÒY®¾( à ޺ƒ>+F]ihñ¾m~©æ ¾',÷Ú^B>+ÜfàªeX¾Üâ¨Ï¾&D+Ÿ»>,^ÜWpž]¾ ‡ñ`ëT.¾%R‘€ÍÆb>,Î)¡ã뾃"±ýd¾$YÜ•"x‡>-+&â%['¾*×»¤›¾#[Hýß‹\>-v¼§”Ïj¾ºG©ÚÒ[¾"X)Èêµ:>-±Ð•Ë¾0Ë}L¾!Q±Û‘>-ÝO *C²¾þHúMó¾ Iò÷en>-ú5²ø õ¾ÑS ƒ+¾~vµ=Å^>. vb‡¾ûNÓÌPÙ¾j¥¿p×£>. Ÿ,Y­¾ …­ËóB¾X€0³‹>.äH¹Õ¾!€ã¿–p¾IŸ{eùu>-î÷Nçëf¾"o}‚'rÚ¾?µO>-Ñ>«ÏO×¾#Qš!Cá¾<.ánã¸>-ªŸ@¢Å^¾$'x0хɾ@WÔâU¢>-|ÜUDÓ¾$ñcY¯/ξMm»FÂ">-FB´{»D¾%¯©>A'º¾ Èúõ1º®>- ?á›>*¾&b¤ª£Cؾ øH¢2T>,ÈÖÓ0†¾' ©Þj¡ ¾hŸv+YÓ>,‚ÆZó)˾'¨"nµ¾Ý~úmt>,8Ê‹•pо(;{…•C½üÙÜÕŠ>+ë²D”kí¾(ÅÀ«™†½ö/>Oë-ì>+œ*B¡¾)EhV0æA½ï}Hð6k>+JשÁÎà¾)¼Òà½ò‡½ãBâ…à¹>*ø\¹´yŠ¾*+ÑmÚ…é½Ìy? +ó*>*¥Pê"{[¾*’ÔCÖ=Áf7êó>*RRu4¾*ò8÷Lø=Þ©tÁù»@>)ÿÜÀ.<–¾+JÆíCÌ=éÐß­JO>)®t“^w¾+œ0j|0=ñçè+>)^’Û8h`¾+ç3‚þÐó=ö¥85>Ò>)¨PR¾,,kÌ°—O=û"жE¼”>(ÅZÅ·/¾,l´æî=ÿ`úzG>(|Ntsˆ¾,¦Š¡Ú½¾>®=âÝãå>(6™+™?¾,Ü hºY>ŒP²õs>'ôSôào…¾- 5á„ðl>JñÑÿ >'µÏJÒeÞ¾-: =0ÕF>ç¬w9µð>'{A "‡Ô¾-bþlJ)Ð>eKU”À£>'DÿžF¢½¾-ˆAĸmM> Âô07ËØ>'4B5vu¾-ª Šô¢9> ÙÕ½ýC>&æÉÛæ¾-ÈÒ Û´> ÿŒ§õG>&½âÑñ8z¾-äŠ!²às> ¡ì‘Dz>&š¯QZšÏ¾-ýy’ˆ> üêZãÄ>&|ª¹€_¾.Î’„çI>¼Ýhí¯{>&cöL¹b"¾.'©59ð>]‡Ý\Í¥>&P¦¢x÷¾.9'¡¯rþ>ßÀ>&B×Ü’GG¾.HeÄ›kÒ> »rw˜ê>&:•Þí¯Ñ¾.Ui¢vÎñ>B|¿È¨À>&7ðºC—S¾.`WK@K*>T¢‘É¥F>&:òjn¾.i#è¦Ak>W:ö™õ^>&Cœ¿ÞðG¾.oËh!I>JQÒä±£>&QåÇaö¸¾.t^4xN>-×[ýÒÔ>&eßæ°¾.v½bæm>½š~å>&q2Þ~h¾.vâtâ¬*>‹Ò’9Õ˜>&žšÎà¾.t°œ‚ȼ>ô¼×Dd²>&Ã&1CÌ/¾.p ÿ³>>œäÒ >&í$½q]¾.hÖ_Åßx> g‡ƒ¹êº>'d”á5¾.^ä»íQ[> qÈI1>'PÑ*Ûž¡¾.R ¥&R(> ZŒðÈ >'ŠBå]T¾.BÙ`Ý£> #‘Û¬è>'È‹FÉóæ¾..Æþ(Y(>̱Æò>( yóŽ'¾.ßMUq\>Sïÿ‹=l>(RÖƒ¾-ý2õzbä>ºÕ”²L >(žy¶{\¾-ÞZ¥˜÷>™Že>>(îP€±¾-»^L;Ï>%%g>×ï>)AMçF=¾-“¯ÒÃ>(`Ù±Ê`>)—ð#o¹¾-fò7Pú=üb~rS>)ñ©‘ö›­¾-3“Ÿò'=÷”ð øüƒ>*Nû #¾,ûO΢bý=òÒnïšDt>*¬Ú„_ËR¾,¼Ý =ë™Ì—aÜ>+ †.¯÷[¾,wØ"rŸ=á µp†%">+o­Øíµ¾,+á¡å’ò=ÇÔÒæ:R¸>+Ò晦à¾+ØŠ‘ÀÔ²½ÆŽÊNßÉ>,6¥†;¦¾+}^qídç½á¾Øß">,šfÄa/$¾+úðµ¹½îY=“ø´>,ý™cÙô|¾*­î?ï̽õ¸çÊÚŸŽ>-_­„p+ö¾*8É\atñ½ü‚Ånk…Ç>-ÀÝ<ľ)º)QŪ*¾ÄDÄ.:>.øüÄø¾)1“¥=ö ¾d%LÁ6i>.xß«Á ¾(ž¦òÌ)(¾ óÐ¥VW>.Ïü<*~¾(ùÁ Ó“¾ ö4œ“ù >/"Ÿ(qN;¾'X(!uÃr¾rËÕ`\>/p¹‘c…¾&£ÆZ˜©H¾v&väÂ3>/·MOœtǾ%ã™DÔ¾„Mñ¾™(>/÷ÈS¦*c¾%0DvǾœ8Ø`M>0C!H§ ¾$>OmìE¾¼¯òyÏN>00^£˜9Ÿ¾#X²?–#0¾ä‹•²gy>0CÂÎ6W¾"f£‰×T¾m·-­>0Qüì8O¾!fiMU—¾DÕø×G1>0Z™€Ós¾ YhØ0]"‰,þ~>:ëOQ¾!ØI„—ØÕ>0Y&PBM¾.ð! Š¾"ó2zî›>0N-\þŋ©a(¾$ Êúe.>0;Æ?Ó€‡¾@Êì[즾%$ ž,RÛ>0!wLj¨:¾¢‘›Xd´¾&7ÇÄc?>/ý¬y ³¾êñ ÷«¾'FæÀ“ž¿>/¦ÜÍ»~¾5Br.™¾(P,9Y>/=¸i!‘À¾e ©•â¾)R1ãv¥?>.ÁmVöä¾g‹Ðsd¾*KÂÙÜE >.1> oÖ«½ø~F³¡C¾+;k­ÖQA>-ŒyË8Ô½ç»ì"Š w¾,Ãîïì>,Ò~”ûˆ=°³QOÔ›¾,÷J)#û@>,ÂQ°Ì¸=ìk  \ç¾-ÀƒRzŸ>+½TçP*=û˜-䆾.yÛÖ­V0>* 1ö™m>”ÌòX–Ͼ/!β6»“>) ‚—Ÿã > o¾¾u½¾/¶ÇˆÇ÷>'áÊ.àá>+™òöu¾0’è“I2>&Ÿç»á>¢h“«°Õ¾0P¶„v)W>%FåÀyún>Ñòç¾0zšËÀç>#ÖþŸÓÚ>Œ<“_ì¾0–´íXŒä>"PÕö{§>÷fêö°Ë¾0¦Þí³> ³ðX¥-þ>!+ªðš#µ¾0§mŽ”>îèÒ>"ÓËžššÚ¾0š I]Ñ#>vãGë ,>$qäPLûñ¾0}T•š¹ >½ Gj‚>&±]V{L¾0P³_âÞg>éã’Ƀ¹>'†ØFáü{¾0¡ÀØ£> Þ\† ý¬>(ø÷ÍîÒ¾/‹Z“—%ò>«q½ Ô¦>*W”—‘­F¾.ÌìR@È=ú„I|ªÛŸ>+ 4=ýÖ¾-ëY[ú-U=⩳޳ Q>,ÐE„¾,æDT›ñ½àKXÜù`>-åY®]u¾+½~A[.½ùØx.Ît>.Üèpã„ƾ*q26cÖ¾×¢_ÿ'L>/´vîg¿b¾) É+¾ÉÇ‚=íû>04Òäl>Ѿ'n4Ÿ’G¾ÛŒ‹ø/>0}c'2¾%¹* 1AȾIŠ“cc >0±Û*ù®*¾#ã)o¾¨h³[¥]>0Ò,.§Š¾!í q ¾ x¯œæÞr>0Ý 'GD¾±­®m³¾"Ž¬ýR>0Ñ™E•2¾PØI;µA¾$’;à0O>0¯/ì¾»ò?Ú=¾&€³›ô^ý>0tì&Ã=¾ø4©\Š¾(UMÖXÆ>0"‹3aU·¾ å:ÿŽU¾*  ð€X">/o< cd½ÿë¡¡²2̾+¢æ¬¼¸o>.gí2í¸Þ½æw! ŒOô¾-mPw|'>-/@´E2=ãŒuO‰‚0¾.]‹Ý2ù>+Å.™ºÎ=þù­œV Z¾/z晟>**Ó–/¼> ¡v!W¾04Z\~ ¤>(a9¿ÿG¬>Za¡1ÛÔ¾0’> SZ>&iñsg®ƒ>–ãH;©¾0Õ%Wa…ø>$G ô®>ºÂ_ºÃ…¾0ü+AñÒ/>!úö³?„s> Ýçž¿å#¾1þ)_h>Y¹¢ª0>#GË\H™¾0ñ¢5Ö>ç1–ÉÅ>%•Ë•Œ9¾0¾OVgBž>& õ&•>'–lÞÿJ¾0kv$s a> 釹Ä>)ÈÈJRèÖ¾/ñ›Ëofë>2³€0¡->+£žÒûa‡¾.ÌF¯r—=éx©ý w>-MÄœ,´±¾-h@bßIò½æ‹¶Ð¢‚G>.Âe;Á=¾+Å“Æa¾¸áøs]#>/üæ`#‹v¾)æ<›8ìP¾ Ê­¾¢ià>0|€kØ’¾'Ì~Kážß–ƒÎÜ>0ÙcÎŽ’Š¾%{TI!-F¾¼(©â >1my×%ë¾"öD·zˆµ¾ 7mf+Zw>1)ð=$m¾ A‹Ú\d…¾"ô…rC™>1?ì!C¾Ä9!ã¾%ŽL6 g>0âüÚg¾º‰Ú•˜¾'ýÓÞiºG>0…Æ!³!ä¾ å+¼9`—¾*<¶Ï|š>0qw Ø ½ÿæÆ›4ù{¾,B…ˆ&Ø>.¬qù~}½Õåã&Œ¾. §˜ùS>- yÎÂG=õ@Øù x¹¾/Žr<µßè>+Á¨Þˆ>?q1#%¾0d2#½û>(çO»8‚;>¥Sôy?¾0Ù½B•ÛÈ>&nåOÕÎî>(䪲lè¾1%§ì¶À>#·­ŒJvÏ>{e}¦7ô¾1F(ø> ÇAìA(Ñ>"ÅG[|Ôʾ19Ôfë²>H:bbÉŸ>%¢6e°é¾0ÿµzæ§Ö>«Iýëö>(Kšh”t¶¾0—SAÀ¤> Ž…%kèß>*¸ÞLW÷Ò¾0±÷µ=ú¹°½«s>,á¼IN¾.xÒ‰¨#w½Á’‘Žü…v>.¾x!ÍQç¾,—*üµ¤½ÿVìÑdS>0#îlŽø¾*_݇E=ò¾0ÇcÁŠ>0»Åmz$ʾ'×yÀ×=k¾=çùÖ™ù>1#ø¦Þ·Í¾%°(øI¾1F1_o>1Z5~˜¯-¾!ë_ö48¾!íæ6¹ >1\»0€‰¾-ûM(¾%²Aœš•>1*^Ÿ_@ª¾B!†‰ç¾'ÿ&Ó‚ï­>0šL><¾ pÆòèwÀ¾*¥¾†¤€>0%o°¶¦X½ü\êÈFÈ$¾,ý{]p>.§¨*MDó=Åü4—«Ⱦ.ý¯ Å>,žu\}Ô>ŽÊ×[¾0N Ðÿˆ«>*4&(ÞFW>LA» ¾0éˆK|d>'nvÑÁdp>íqá vç¾1MâcY^Ø>$Tü}ëH>MÃ’ù¾1x˜Ónß> ðœ"U;´>#(5Ò„ó¯¾1gíN|/á>—>«Þ>>&nŒtÕ]¾1æýsÝ>âýL*§">)lÔ'| ¾0‘\8Z½ä>»d ½+û>,ßÍÙKû¾/˜ºØV¨=åD-Žç>.aháeµ¾-˜þny‰½öÄñ}ZÐ>0!ȩ̂ɾ+*žüb!,¾ þ阺>0Ø ˆ’ƒz¾(SÐ"‡ÁP¾(üÊ7¤>1QÎå®Ç¾%;M¤å¾œÏ…qÊ>1‹f½·~æ¾!‘AÜæAž"ÈXJýAØ>1‚»/sÓ¾wÙ´ä>¾&H!G?«+>16­ûe?ɾU—h\¾)wÅOÙn‹>0§(i<,¾³þh ‡¾,I,ä\>7>/ªCee½½áAKÇÁI¾.¯Z9¨U>-…SxA=ú¦bQíPÙ¾0OO{ÊÌ>*åÝ)íž>ÖrküR±¾1sùÅ8$>'ÔcaÕ>üÆ+Û:L¾1xø©àú>$[žç¸m> Üâ Zž1£Ævp»å> ˆCû )h>#þëO1f¾1„è­›ß>ÑÕϦaÍ>'“¬B¾1'žt>Ùê:m+>*ÈXêƒU‹¾0h3—­ø%=üI´Šƒå>-Xxâ¾.Ù?v]½á&™ –èò>/ÙâR<¾,WÜìè˾Âù&‹O¡>0ÍÜX„C±¾)T󛨾zrkÅ΢>1eKcÞ¥€¾%Ûö–ÛGY¾FÓ†>1¯WI ݾ!ú¥&ñâ|¾"Íxkf>1©_¥â1ؾ‚;Ë-@¾&¨OÔÆôG>1R,6p,;ƒ f¶¾* O‚Ñ>0©þéj²‘¾?$Ï a“¾-#…ÒR2r>/e>Ò‘ÛÉ=¿V¿Ì_ñU¾/¡Â mÕ¤>,ÞºÙ.«”>Me7§q¾0ÆrÆ‘6ô>)Ê,Ì s>>®¥ÈÞé¾1l¤wÁbæ>&4G°/5>äSÆIü¾1¿o›¡’>",““ƒ3>"Íx²í`4¾1º±J||>Š‚ÍÀk[>&ÒI2ÒZ2¾1^^QAe>%£µå¦h>*kÄy¾0ªwòUXê>¯R¼ >-ƒ÷¸!#¾/B„ôÎνÚìÌ½à‰ª>0’ˆ“¾,n¹’öm¾vªçL‘>0ø©\î#2¾)A<ôGS¾™¶0ÊBn>1•¡q¾%læUBR4¾|uIé>1ÖQDϾ!"”³^o¾#ýë^¨§>1¹©vßb¾î°Ï ¾( @óüx[>1>T„ÀE¾ ~fC0ë¾+Ÿ¶³É²ý>0e„…a„{½ò÷1˜­/ø¾.¢”M-f5>.dõ3²±½=öÉ –Ä_/¾0¼ºÍY>+UA-6Š>[Nmña¾1W›#…¡‹>'©ÂŸ«u>%ž©7z¾1ÎÊlèl>#uÝP“x>!Ú¬›ú=¾1â°í&ú¼>œB J>&D7dCɾ1‘rÆÿ®>˜—;yñÑ>*4ï dW¾0Û} ÕÔ>.ês·>-”i­Q´¾/†üLN3+½ÚÁI)I0a>0&„ã9Uþ¾,œýºœú>¾è7^î&>1&HÇŽYõ¾)†Ž?2Š¾3|¡>1ÂN³8é^¾$Ù@ÊÏë¾ ‰Äd0Ô>1õ¤rþ¾ )é -yª¾%6·„¸n>1½¡Ur¾&>¸©6­¾)iÝ¥ò.>1,a”¾Êë;ß›D¾-¯•Ð>0 º²ÆN½´]Òä'ÞȾ/øö2 ³N>-:ÅTu˜–>¥rj-j¾1?,wÊ>)¡€O´J>ÁYêe‘|¾1ÂËB7Ã,>%cÃศ•> ÒÁ3Ÿ¿¾2â÷NH¾> š5ú…>$õÝp"…ξ1Ñ`©¿þŠ>ÂÞ‡3RP>)Q•ø#¾1. HðãË>f:]”@è>-kÖí§Á¾0‡¸zô=²›zž¹º >0 ÍÛ°~¾->È‘Þ€Õ¾[ÛÑÏÁ(>1)8¸iŽœ¾)„º°ñ¾jàE —>1×+7\>²¾%)œ‚S¾ ÂéW¯ž>2ü9€Â¾ $êj5ÿ©¾%„YYvc>1п!î&¾v*%½¾)í»LI@•>1¢LC¾ f˦ka¾-­^âƒb·>/ÜY…Ò™=ÛÐÒÈÓ§J¾0SÓ÷çài>,© ¦b8‘> ñ·Äli¾1bâ7²]>(­¡¢•Áx>õœÒsN¾1û;ÑîY€>$ïáø ÷>!å*Nxñ¾2K׊b>ùÈ>&ØÁ%m©¾1´Ö½Á‚><à䋵ß>+17ÜŸ–¾0Õß½ü¥=ùtXLS>.Íé&_-¾.ù—.¼{ž½öõŒUf’>0ÉgQ ¶3¾+hh?*ß_¾¼%îèÖÒ>1´º-F;*¾' Ðg:%–¾H¯`Mp>2 æ¼o÷¾" ó‚y¾$è¬÷…>2 _Gê©b¾îuÖ¹·¾(ÚþÄ«>1mXƒ§¾ ªÖ ¾,þot¹>0OÓØ"Lù½ÇBa¥ÌK¾0'§1>-oX¸^ç>S¶wã¾1X+ëB >)_\ù!>ÂÙ!iÞ¾2î0Bñ>$Šáfëá¨>!š¤ãD¸L¾2/¶Å¸}]>+ \j(É>&Ó×*Güx¾1Ìà”ì¹î>N>˜ ¹7>+c(맼¾0àÛi2º±=÷_®XUÔ>/$¢tb’±¾.⡾)ì$½ûbV2»@O>0ûÕŽæ_¾+ócؾ`Ôiâ7’>1áúçÊK¾&eƒ†tD¾]¸qƒR‹>22pÖg$‘¾1~lÚV¾*Ó~xv¯>1@ ž|k¾5iX*W”¾.5ôp},e>/ß Ožó=ꯪ–ÌÕ¾0¯Úz?»>,8äÀ=Ð×>8¦ÖGô¾1¾éŸV?{>'©•ç)é>£ñeK" ¾2>)ˆw;·>"T&¦ðJˆ>$aì^m0¾2'ÿ ÁŠR>Å$®«n->)>¢ë•Â³¾1{¨+âú>TÚzXÑ>-˜agþÖ¾0=6wçU¬½Ò8žÚrò§>0’*‚08¾,ë=¡ó¾ ¦ç{òSL>1©ç{—8b¾(e¯rÓ¾%ylõ>2@y„dò¾# â:¾ ³¾#€†ÝRu >2;_ˆæľ`üõ#¾(Ô„• p­>1š­%Ìuî¾ S§…Ú¬š¾-X*7ÿü¹>0aÄÑbç]=°Óä×E>¾0q*úv—>-3 è55T> j5zºa.¾1¨å_ŽÊ>(¡çèöI>¾“†cÊh¾2GBìé9½>#4 {^>#t¢3é¾2EPð §å>/’w^_>(ã«£ ¹¾1¡¢ÂÿtM> KYb,>-z}Ä´à5¾0`aʼn÷½Å €´;·{>0‡ñ±Ã¶¾-¨|£dE¾ µÁ%CÓW>1½ÎeK ƒ¾(c=Ø‹oú¾˜4ÑÄ^>2UJTˆÊ„¾"ΨËÉ|r¾#órø þ >2F™V¸š¾‘ɾ)j1#ØåÃ>1¼Ò,´¾1ãdÇÅL¾-ü~›{±·>08·õíã=âÃÖÄŽb¾0¿¬š—>,“ Âë…>@V îо1åã<2àÄ>'§€P@_N>jMp×¾2f´õ¨6->!Ú…š<|>$÷é!ÛÊ=¾2;ETðŠ>ÁXÑffA>*aá•Ïv¾1c§¬‘‘«>ÖæÒ™@u>.Õ/íúán¾/Ì©Û©µ½õ,zÎd”>1¸œ?ä¾+ ¥ &’¾[¬P¼>2ŵôœñ¾&gõÃ=Ⱦ ^‡EÉut>2tpëHøô¾ Q´?¨–¨¾&w‘ µ‡>2Ö¤‰ú"¾2 ¡ÀT¾+ºr»¸W>1ÌÒVë½óé‚Cr³¾/ó–Dù„v>.ÃÜðÔ]Ë>ó‘r J(¾1{T9veê>*0óÉí>œŠÁ°Où¾2Qª© ¬>$—|m·¹>"p—ªü>¾2s ·") >YÝC­ÂX>(`Ö1=[h¾1Ü©Ÿ ÿ> ¾ rSÜ>-bÁë¾0’ÞÓ¡ë}½«cRŠy>0 eŠœ¾-BMÒˆö¾ ¬·Vôìh>1è–œøûD¾(3¯Õó¢#¾ë2éÀ>2|V#B;À¾"*áQ7ì¾$òFmnæÆ>2SæJ]‰¾ÇBÿ¾<¾*¡láf4>1oaÏ ég¾ˆ“Â… ¾/;“h¡±">/¬æ'Y¼=úxPѯ¾1MãÝ‹>+0y\aHJ>J”Yß=Ѿ2IÛR$ŒC>%•–úg5t>!‘Y͑ľ2ˆnN )E=*ÛÎ>'ʪ³|ðè¾2ºè®–¨>ÀáëŒÔ>-MåE»¦¾0¨EÚ=Ì £X·Š>0‘Jxú·¾-œR7×'¾ V\á|¨>1ìç9ú—¾(tÆ?澯·2=XK>2Šóê–¾"Cöq÷›²¾%ä:Ÿu­>2`Û_“#‡¾”È)æ¾*Ö¢»Ø†u>1q\ºI ]½þ‹°ï l¡¾/‰vÒv>/ˆˆiÛæ?=þ²5“&λ¾1tw‰Ú>*Ô¿`ÔwÅ>³™i†äf¾2g(²#<>$ø@2™k¸>"fwè„á¾2I#¼Ø>bk»#%>(®œË¾1í¢8@> "ÌÙäúÎ>-éfëŸ&¾0ƒßúVÁF½Þ 9ŸW§×>0îCx»0ó¾,à å(ô¾HÎTg²>2,{©¸É¢¾':(Ö…Zÿ¾ú¥ºÕç]>2 ZÙ¾ ¨ÙxJD%¾&§Ù± zÏ>2Boج'¾®stÆʾ,Wu)ÛÆ >1@>‹%ä½élNç’ܾ0dî‚»G¼>.N¬üm5> ¡&À·h¾1åm«‰>)±—¤Æý>®Cm]±S¾2™µÔ‚ÝÜ>"·ô_³K>$Ó§*@ž¾2y>‘½/>ÿNý¤š>*å'ž¬C¾1ƒ¯~²ùŽ=ýìú‰ÿ>/ÃÉ[ .]¾/…F¾—Z¾Ô8?ž¶&>1šiWàô¾*’6HTk¾ø=ùÜÇ!>2†Æ_ ¾$ev[ú3ï¾#<6ŸX:`>2šÄ—b†¯¾ŠµÏá”P¾)Ÿ;Q ?®>1Óý˜€†‘¾¾™B¾.ØIï¶y­>0: 8'Þ=ôôƘý¾1SºøØP>+½cù;>ä³æve¾2nŽË’>%¹Jðc §>!éýú´œ¾2­Þ>g P>Z½P(ñ«BNM¾2 lHôb> ²|-ˆ<>.âÞÝ ¾0“58GZ½âÉÀ¼¯Pß>1&™Œ¾,ŸV.f¾yžA¶>2WUáÀ¾&¹ò4í®\¾ áã€`£[>2¸z¿Ÿ¥õ¾w³¿â[Õ¾'½Îs£§Î>25rž¾ãGX@™h¾-{3<>0ÒµçÛp9=¸‚º=Úå¾0èÉá1™>-?×ï™ýÓ>»= sœ¾2D‰-ÁŒ>'mÚö¡@ > '¸ÎR6¨¾2¾©W˜à> u{1+²Ì>'-áû5³¾2OÑnÒǶ>W]uPãF>-&F,>¾0ûîä\O=Ì* \îqœ>0ËØyû'¾-¤v\cJݾS¦0p"›>2:Nq&T¾'Ù?ÃZF¾y‹Ôüqˆ>2Ñ‹Äæú¾ Ý/-~^ ¾&âD1Å¡8>2_tHUI¾9°Œ¾,élR /%>1y:g®E½×$ꉢç¾0Á΋/i—>-Ñ¥í哼>‹¥4$¾29Ðý¢¸ã>'ÿÅŠ…ª>C¶B Yݾ2È{ŠŸ’> õã àr>&ÜNξ2e›Ù"³>ÝÎÝNî>,ógž0¾1Tʵ.ü=ÕD›©>Ò>0Ël–“Œ|¾-ÉØ‹7Ú¾3Ürª>2CÍÈ™P5¾'⤢þ)ž«µ„Ås7>2Îf÷Z0—¾ ÀwÛ½éʾ'Î|»'>2b¾ì ,¾|šA‡éy¾-4?2d>1ëJ¤ßŽÁ ~ß«ž¾0çú“So>-‹)¡€A?>{žÇN¥¾2WZ{Q>'‚rYãWq> Ws”@Ÿ¾2Óçmœ<> = Ünì>'œ(3µ¾2UÄqíP >8†x Æ>-©JÕ4¬¾0â†v^½Í–!ÕÏ>1ͪ¯¾-Ó’¾æ‡c>2ríæÕ¼¾&Ý®;ì¾!#‚Ÿö…\>2×s›oP£¾Ùp–­_¾(\Ÿ}>2<øÓÂXs¾ š…÷0‰j¾.MÕVŠ`á>0ªIØìî=èSwrœ€™¾1RÿvW¢>,fÿ'ÚQÎ>Að“‚)a¾2“tÏ«š>%ò)5†w>"6‘ü ¤m¾2ÕØS®13>™3?èãâ>)V&WOL*¾27üt>x¾ö˜>/ Ì !l¾0Z‹•;9½÷0†â+|>1›YÁ¾+xôìÿc¾ ¾C¼Ö>2µU«Q&¾$¼az̾ƒ¾#‹*^>2Ë_AÔ1ý¾¶fß¿d¾*ƒ/VŒy >1Úãw^A龸©Y?â¾0уÜ>/ßW÷à˜ë>\&Ñ–ô¿¾1êfÚùž>*Fºþ­;û>h:IY{¾2Ót ƒF>#8ÅÐi¤Q>%¢ÃÑ"¾2²è[>Ô>.‹vwïç>+Û6fê¾1‰*=AµZ=ò¢ ÿÀ>0‰UÈ<_Á¾.ÊÕTçH¾ Q ô€b)>2:¿pÞuE¾(ÉÖì¥?H¾F„ßj!>2èVûW¾!côÝiÒ¾&Ý‘Va†@>2‡ÛÅoO¾þEœL”^¾-SH¯[>1*S5ô„½¥{,Å»2¾1ƒ']/š>-oc}„Å>³iýZ:¾2…Э¯>&üÅÙj>!M…ÿjÔ¾2í+Ù[ÿç>p( >(Èñ³Ôø–¾2AiÝ —Á> Jˆ˜¼âI>.ß6G¡fD¾0Šý’sG’½ó¶¾7—k˜>1šˆ-™;¾+Ã]«Ù¥¾Àõ5vp>2Äc´ªb¾$ÖÉùªØ¾¾#§4EðÓ9>2ÚÐ@ÚVɾhlÊÈf“¾*Ð3b½>1Û7[uËŸ½þ’‘QÚø:¾08*œðµ¿>/¦ÖϬ>1%L?Û¾2*'K_©>)¾iHÌÍ>@ÖäOÒy¾2î ÿU“Á>"UáQ×>&&=ËAS=¾2©)ÅH!U>­¢dÏXÇ>,äúñd¾1M:ø§wC=Ø1r*¸>0û°s©¾-Ú°‚—*¾Æpi[~>2…´jÚ4V¾'Wý’@µ¾! Óòÿ>2ú ÆK}¾ånÅÌL¾(»3Â_%>2P-»¹E©¾ €9â¦!÷¾.õl,†¨>0˜oªl¸=ôÕ¹>ÍTÙ¾1®qX“Z>+©q.>Í>cð¸T’†¾2Ö'DY1l>$Š F >$õ+Kä ¾2ßdz9ê>\)¥ÃB“>+TV•¨3]¾1ÇF6Ié·=øŸ§*{:™>0w V@¶¾/<½‘—Œ­¾å=¿-q>2H UÍZ¡¾)¸Õ/³¾U{ Cx>3\‡¥2M¾!P‹Ð¹¾'5æ£Ë˜ÿ>2“flÑðh¾ü²v¼o¾-ÝPŒêªŸ>1•“»+=Øás=9"»¾1\|¹'T>,á~È‚˜(>Ì[Q} ¾2¼‡…åü/>%òçæýž>"¼êEÕb ¾2ùV3õ›C>Rw邏+>*JMBïrR¾2 ”CN§>êm’_­>0†zIÁ¾0uÀ«Ã¾–Cì·ÄÞ>2ó_$Éc¾*RîÍ/¾NíWF>2ÿû°z;ƒ¾"a\ž8Ö•¾&SŒÇgS>2¶Š_zC¢¾/øcj¾-?|MÆ>1DëÍa™ù½¹›4'Ù+¾1/’%êÌ>-¨éäN>pü$°¿¾2¯`óèÉ>&¢Y2G6>"/äêú¾32ϼŻ>¯3#ìQ>)ÔíÐî¾2-qDfô >‘°Wß±m>/úðc¾01q!CÔ¾’ÄHf›A>2 ®'-y¾*aÇ-p¿¾Uݧ+¿>3F%?êL¾"¶×¥¡¤¾&¿²½°ð>2æÉD N¾³Ï=ƒÅ¾-%\i}jU>1Tøqý ¼½ÆÇ“`e鑾1.¥«"Éw>-š„¶>Yþ–ÊB¾2µñæ¬ò>&©¾¯Ê!>"#Á¾œ[_¾3 -¤ \~>ˆáŠ>)ö­¾•³ç¾2-5ÌȃÁ>Ð÷æWƒ>0ˆÊrâA¾0%8ì´É?¾ÁPäWK>2$ ¾%M¾*(µÚŽq ¾E~{8ƒ>3 9°ž*¾"WΛRô|¾&ƒæ~ç)ó>2½Íß d¾­&Y3ZV¾-Œî:[ÉT>19ÉÒ}=Áî)w°s”¾1X­cÈ>-2%òïïs>É¡ëÓ‚m¾2Í= |ë>& *!5ÙB>"á«äG J¾3 ÿ'¬X>ìªÄHÖ>*¨›|Ü¡¾2 ØJ•H=ÿïkPöXU>0[¡µÚ¥Þ¾/Ä\øµí¾[U³K>2S—ÃÖi‰¾)\Y+A¾CØFw>3WÙV¾!IÙ/ˆ V¾'‰×uYµ>2¡Ö?Ýʵ¾'×ܳ¾.jfåïy>0ðÖB8ã=êÖn1.帾1§[ÄR«Š>,Ea,o·—>ªõŠµ”¾2ñ^qkïo>$ËI®Œ†>$AéD*Á¾2ü|ø>ß¹Z->+Û\õ¦¸(¾1ÆÞŽ!=ò=‘%Åäœ>0Ð ¯¸»ê¾.ÇÚ8‘?¾)+,kd>2–`ÍNG@¾'ö=¬\¤Ñ¾ ß‚ ;x>3!Õ%±¾5Cìe¾)Èž‘þ¿>2gMÏ«Q¾QÚÇÅ(ô¾/¨ÿ–vÕ>0rí÷‚Å=þh78à>"¾2OÖ)4D>*É–Õõò>ácz —¾3Æ×ñw‰>"à«Û8 ¢>&1"•Òp¾2ÕPÞbÔz>bµ-¥ŸÄ>-wXúth¾1Q5j\g½³Â¼? %þ>1bx9þ…¾-E§§iƾ­XJ¶š>2Þo¨ó°Ì¾%í8ëP!¾#0“OÃ(h>3ý<:ɾ/ÜÁç3¾+HŸ‚ÔÃ>2hTM½úêæ.L‘ ¾0•…3ßöÈ>/jµ2†P> jLþFqb¾2€vÒ÷á>(¯p³öG‹> "ÌL N¾3*,k'> DŠðL-Þ>(”àíôM¾2†&¢î²> íìÚ~ƒ>/\¥ÁoíÓ¾0ž‰ÂÝÃû½ú0%oíèÀ>2!2:#8¾+'eË…¾"lƒd¥>3W?—ù·¾#4îùè¾%ú,Y2‘>2âÐcÏ#R¾ÚÀ˜L¾-c·ÃÚ'|>1`J¾?=•N’e&Š!¾1ea´n>-V¿-|> ¦Ì‡H¾2æ‚bh·>%åÜyæß>#Q .­¾3‰ © 2>ß͵:>+J`‹„`³¾1ü¨YuªI=ø“bñ 8>0±Liþd¾/?Zb—©è¾ w©‘Ý>2–U7뎾(YQ\èí(¾ ¡L¾o(°>31 _HÛl¾€•],¾)õhmIM>2vrñ¾1EÝŒÛü¾/Ó“‘r‚°>0raÎÍ‹ø>Y'­x'¾2+ßð D>*ÔÒ²Þ>å1C¯hx¾3)‹Ÿg3>"]Ö³j¤Ü>&×ÏîèåX¾2Ð,=gD»>ÀÉ^"•õ>.%¶0Å“ ¾1%Á],f½ãï­[lÞ >1«õ´¯‘õ¾,Š©6p1¡¾•8V³|¿>3¾…ø—&¾$Ç»-ù«¾¾$x·éE>3 Ø“«R¾>ú®¾,_Ý®ø°Ï>1º¹G•%½çÔtSšà¾1¸(綸>.LÏÔb1>]ôª˜Z¾2ί¨»b>&þüxG ]>"@~i ¾3/õê¥ü>³2±>*‰&Ö8Ò4¾23&uÀOb>pP–û¥È>0x¾í?¾/×ãõ‡à=¾üëýŒ>2ÊÀÃH¾)=`ŽIj¾ëg¿¶ >39ÛMÔæH¾ ftïçþ¾(§ZΧ…>2’ô±×¥¾ ke‘K{¾/—»†®ªÛ>0˜ HªV=ý`_`àW¨¾2#Ðͪ¬>*ÙŸMˆØ>d*¦c6ľ3/­N²‚;>"”à'Le>&¿&~;l^¾2ÛmD‚K>ñqcŽ…¶>.,9D¢h¾1,@¬kJ:½ä¬Þ&j+ê>1·Ã=Ö“¶¾,€».q¯¾ñÚÓÍŸ>3Zü©A¾$™Ï~fÃо$Õª‡>ÚB>3 $ËÂw¾hø’[­8¾,³qÍßð>1ªTÎúÑt½ß¶é)¼mv¾1?ø UŒà>-ü^7¨„>›‡E+µg¾2ç —üç>&vÌ6Ó>"îûm~Ý^¾3/È¿úsð>œÃÙcâµ>+2•€iž•¾2á /“=ùdQþ6Q+>0¿ò¯ÚÔ¾/NŠ÷}Ⱦ ʨƒáÞ)>2­~T Â°¾(,¹ðul¾! óbà›•>3?æ¢ Òþ¾Œk)­G`¾)¬ÑÈ4>2jèìÚdŒ¾e@úŠ9¾06Ì›îƒÀ>0=;Æ9a>§ðç#Z¾2hX$îY>)½ÙÆœ>k‚Œå>¾3AEÆéD‰>!oÓÚÈ>(&FG濾2°òG‚Œ> äD¢<¶ò>/Rîìv'¾0Á2§>¤½ù¦/Òžh>2íu쀑¾++tw9­n¾ÐÃŽµ”­>35òæžÿ¾"Ó>©S;Ú¾&¡Uƒb®²>2çáî}0¾,SÚIgP¾.0úžãS»>14Äck¯y=åH­xdº?¾1Ãƹ›˜O>,wþÚªòS>PG àuj¾3pùÉÛ¼>$jj:k9ž>%! ¡ úô¾3÷›[Ú>°•\R ó>- ,Ežó¾1™.— Å=Í¡èþ`¸—>1g¿L'[«¾-¥ù[M<¾ì’g<Æ>2ÿ¦¦H° ¾%ãT©/¾#§d"é>3.Vbî)¾þ܉ª"Ò¾+ã¬áTÑ>1ï¦g/ë_½ñ\Ï©F.µ¾1 Õ{Wù>.µFsËx™>§*­Ûi¾2×ÑPËÉ>'?éáEÝÖ>"5¡ûlƾ3@ÔÐU=9>~‡+ç_>*½D¤%ï¾29“…Õ²=þX!&ûz>0£?•}r‘¾/ª%™Xc¾ à4Øv`>2©Œ/Ö·¿¾(&ʆ™¹¾ ͽ/¨V>3JjÕ.¾|2¶¾)™WÈ£9>2xFÓ¸‘v¾Qú aÎV¾0=7´ )J>0C![v>ÿ“^àe̾2uÖû þÈ>)©á„Î9>áíc®Ø¾3K9Æ„­õ> ÜJãïö=>(z†}C(¾2¬±{ô?/> #PÈ•›>/¬pV {¾0¥Œ$÷ú½þ{´=>2> ô¾*¸ÇDL*<¾?o[K¾>3Eƒ™zâ;¾" …Ö³šu¾'`a!ßï>2Ø!CØ%¾O¼LÑ=¾.ݼÇÕÛ>0ýŽÍ—§T=óƒÄwX5ˆ¾2ê~ƒ¡ï>+²MÍÂÆ>>¶S Q©"¾39Ë4[dE>#NÔ²´ó>&MÎ#zšþ¾2û`´óf$>åµÀ+?Þ>.]a4ó¾1KÎì´†½â&Ýfu>1Åibú¾,–°mG¿t¾Fs¬fl>3)=”A¾$gÞÅ›ß=¾%BÊ, rŒ>3™°Bºð¾SßÊ2¾-E²€>1‘nr13½ªf…eên¾1†ƒœAÏÎ>-gá¡ü>ñJ¤*6¾3såßû5>%mG‘ÏÒÏ>$@zõÝ,\¾3-l‰5º>œ¹þ7IÃ>,}aª›Ñp¾1Îÿ€r=än8Xþ÷à>1F²3í½ü¾.&é²9¾¶$É¥º$>2üp‡Z*n¾&_Ãð -¾#Fó®» >3=ä2%"5¾ÀãÆkÈV¾+¹¸t Ì>2„þ€‚Š½óXt)Ák¾1o²ï¬û>.Õ•ÿƽ>•à X_í¾2áŸY!µ>'@óN>"Wõüׄ¾3Iv[© >Ã"ŸpÓH>*ûHárÙ¾25wÙöo=û{ßÕl (>0Æu„÷îü¾/tÉ•ï0þ¾ ˆœÍä>2ÄØÙöT|¾(u}ÚÖ ¾!pjôZú>3QS]â龤'턼¾*B²çü>2_¼€ïO ¾²â…Cîþ0†ðÓ¨p>0‡;;r> Euíý¾2¦aŒëÜ>(Òòér(> “¼m(á¾3TôQmF¢>f»?Høž>) <-­¾2„µ™©Ðà>n¼9 É×>0Hv‹@¾0EU€>¾û¾Ž3+„Ï>2†íPqÌs¾)…î aí*¾€õ<Ô~H>3UüLÇ: ¾ …Ñçì;Þ¾(áúœÖÎN>2¥+Ù¯‹¾òCîØÓ¾0 TsÀW>0ÌÞ~­>'|×wñ¾2f›&jÑŠ>*+í@bà>î¦ÆE ¾3TTHÌj>!JÓðÏ/m>(;}W(N¾2Áe@ g> Bª_„>/ž_eH’q¾0¸Ò²Ý+5½ý¼“cÿ¤)>2EûQ'mz¾*ÅåÁÛ¾mIfBmà>3P§G0Ù¾"ÊUjÕ±¾'›3€oê>2Úþ$¡¾_;¥¾/)†¿µT>0ëzöx=÷†#¶Õμ¾2%(Íÿ>+TŽVë >ÿ@`K¾3KZ‰”>"¯Kúþ‚>'šÓ¤á¾2ïi^>'%Äk>.¸D ¶ð¦¾1ä5–Ô½ñ¢ýòÄFÕ>2l³¯®ã¾+×íá$¾¢LÛ|`>3D(+ŸB¾#OÜá×"|¾&n´b¹›>3þ“ë =¾ˆ2Q9 ’¾.JH¸] >1BË*Ÿ°=è$Ãc€Ý¾1ãÞ0Íîµ>,RŠ¢'K$>V© ¢-n¾3;äx²F0>#æ¤i«N>%àùŽ'µ€¾3ïYJ%>Õ‹Ðq>-à©z5D¾1hûöA,í½Û/Zß!ªì>1ÃÒ«d·8¾,Ä1u\¬¾”¼9'Z>32Åù¡ ;$s¡°DÈð¾%YžÛ6ùt>3ÃZšš»¾a©Ú«ô¾-y7?¨¼>1Œ j%Å$=¼éHPm+¾1¤'/–ã>-. Áâ6à>îR#“¾3(¹hšõÞ>$øocrË>$Ø5pT1¾3+„eQJ;>6UÝåzH>-Æܪ¾1¬ I+€§=Çq.kˆ>1…$=çE¾-s*ÞñR¾Ïf³É,¥>3+ã™ê,¾%t=}BÚd¾$\Vwðj>35¨¶7Ñu¾M`±î¾,¶!]kÒ>1ɃÇñ•½Ý­>v †¾1fžãL†¼>-ìoJhÐm>¾¸ž­¾3üy}³¤>%é8âE|¯>#å(ó‰S¾3>)-ϽÇ>UÎݳF'>,Y¯™ƒF¾1ä‚é«8=çaë;,¿~>1H×Ç4{*¾.B,¥ö˾¹˜šs,í>3†=.û‹¾&W+±4Íľ#rèç5¨Ê>3Enýv|>¾O»ùµ»•¾,Š KP>1ýv!Ìp¾½ï™Üí¾1+ª>.’©{8±¾>À§O0Jí¾2û¥³ I±>&¿)^‹üý>#tÜt¹¾3KiªÆÓ>=< þùt>+©ÏòvŠ¾2]Ïצw=óžµ[‡oå>1ô3E¾.Ý×÷ÐbO¾ÒC;Öq¨>2ï¥î‡UÙ¾'!c ¹ÿ¾"œ g*ó>3Pt±|¾¿23æ¾+V?‡š2Ç>2)™¹ bн÷LEsÊÿ¾0ó$:òÞõ>/$…˜Í†4>Þã®sK¾2ãj%â>'}´®vd>"7t^™ ¾3TlÚ[×+>ó\Tš×v>+ Õ0†\¾2=òVµ=úË„lÆ`Ö>0Ø*âL8¾/fGkqE¾-}x yœ>2×O“8²¾'ÔI‘i7¾!×y‰–x>3W©þ³8¾»Õ­Ÿ¾*¹|kÈvÊ>2NÎk%¤½þçD”²¾0¾JÝL;Æ>/¢ü”rƒ> š:%-3[¾2Ëeîes5>($ñV§>!~Ù«ša¾3ZÍ¡ö>q¾ékJ>*s7Ð6¬¾2^^“Xš>‚&q܈">0¦Üåœqì¾/×ë‰ôO¾ 6G”4•>2ÀÄk…‚Ò¾(gñî±¼ò¾!2Ñ(A0>3[¾qæâY¾½ÿ‡þ¾*:Ìçš>2jI(¾šfÉcb]¾0•ûتŒÁ>/ûž«<¤&> X÷夾2ºÇײ(>(‰­°B¨>!;­AE¾3\¬º[ÀÐ>\ŠØ³>*AØÐM°¾2fÚÙ >´Æ¨›>0±\¾w¾/¨œ¹d2óµfó¾&tt7qV¾&ù°òã>7ªŸÊÕ¾•>YÝC­ÂX>(`Ö1=[h¾1Ü©Ÿ ÿ> ¾ rSÜ>-bÁë¾0’ÞÓ¡ë}½«cRŠy>0 eŠœ¾-BMÒˆö¾ ¬·Vôìh>1è–œøûD¾(3¯Õó¢#¾ë2éÀ>2|V#B;À¾"*áQ7ì¾$òFmnæÆ>2SæJ]‰¾ÇBÿ¾<¾*¡láf4>1oaÏ ég¾ˆ“Â… ¾/;“h¡±">/¬æ'Y¼=úxPѯ¾1MãÝ‹>+0y\aHJ>J”Yß=Ѿ2IÛR$ŒC>%•–úg5t>!‘Y͑ľ2ˆnN )E=*ÛÎ>'ʪ³|ðè¾2ºè®–¨>ÀáëŒÔ>-MåE»¦¾0¨EÚ=Ì £X·Š>0‘Jxú·¾-œR7×'¾ V\á|¨>1ìç9ú—¾(tÆ?澯·2=XK>2Šóê–¾"Cöq÷›²¾%ä:Ÿu­>2`Û_“#‡¾”È)æ¾*Ö¢»Ø†u>1q\ºI ]½þ‹°ï l¡¾/‰vÒv>/ˆˆiÛæ?=þ²5“&λ¾1tw‰Ú>*Ô¿`ÔwÅ>³™i†äf¾2g(²#<>$ø@2™k¸>"fwè„á¾2I#¼Ø>bk»#%>(®œË¾1í¢8@> "ÌÙäúÎ>-éfëŸ&¾0ƒßúVÁF½Þ 9ŸW§×>0îCx»0ó¾,à å(ô¾HÎTg²>2,{©¸É¢¾':(Ö…Zÿ¾ú¥ºÕç]>2 ZÙ¾ ¨ÙxJD%¾&§Ù± zÏ>2Boج'¾®stÆʾ,Wu)ÛÆ >1@>‹%ä½élNç’ܾ0dî‚»G¼>.N¬üm5> ¡&À·h¾1åm«‰>)±—¤Æý>®Cm]±S¾2™µÔ‚ÝÜ>"·ô_³K>$Ó§*@ž¾2y>‘½/>ÿNý¤š>*å'ž¬C¾1ƒ¯~²ùŽ=ýìú‰ÿ>/ÃÉ[ .]¾/…F¾—Z¾Ô8?ž¶&>1šiWàô¾*’6HTk¾ø=ùÜÇ!>2†Æ_ ¾$ev[ú3ï¾#<6ŸX:`>2šÄ—b†¯¾ŠµÏá”P¾)Ÿ;Q ?®>1Óý˜€†‘¾¾™B¾.ØIï¶y­>0: 8'Þ=ôôƘý¾1SºøØP>+½cù;>ä³æve¾2nŽË’>%¹Jðc §>!éýú´œ¾2­Þ>g P>Z½P(ñ«BNM¾2 lHôb> ²|-ˆ<>.âÞÝ ¾0“58GZ½âÉÀ¼¯Pß>1&™Œ¾,ŸV.f¾yžA¶>2WUáÀ¾&¹ò4í®\¾ áã€`£[>2¸z¿Ÿ¥õ¾w³¿â[Õ¾'½Îs£§Î>25rž¾ãGX@™h¾-{3<>0ÒµçÛp9=¸‚º=Úå¾0èÉá1™>-?×ï™ýÓ>»= sœ¾2D‰-ÁŒ>'mÚö¡@ > '¸ÎR6¨¾2¾©W˜à> u{1+²Ì>'-áû5³¾2OÑnÒǶ>W]uPãF>-&F,>¾0ûîä\O=Ì* \îqœ>0ËØyû'¾-¤v\cJݾS¦0p"›>2:Nq&T¾'Ù?ÃZF¾y‹Ôüqˆ>2Ñ‹Äæú¾ Ý/-~^ ¾&âD1Å¡8>2_tHUI¾9°Œ¾,élR /%>1y:g®E½×$ꉢç¾0Á΋/i—>-Ñ¥í哼>‹¥4$¾29Ðý¢¸ã>'ÿÅŠ…ª>C¶B Yݾ2È{ŠŸ’> õã àr>&ÜNξ2e›Ù"³>ÝÎÝNî>,ógž0¾1Tʵ.ü=ÕD›©>Ò>0Ël–“Œ|¾-ÉØ‹7Ú¾3Ürª>2CÍÈ™P5¾'⤢þ)ž«µ„Ås7>2Îf÷Z0—¾ ÀwÛ½éʾ'Î|»'>2b¾ì ,¾|šA‡éy¾-4?2d>1ëJ¤ßŽÁ ~ß«ž¾0çú“So>-‹)¡€A?>{žÇN¥¾2WZ{Q>'‚rYãWq> Ws”@Ÿ¾2Óçmœ<> = Ünì>'œ(3µ¾2UÄqíP >8†x Æ>-©JÕ4¬¾0â†v^½Í–!ÕÏ>1ͪ¯¾-Ó’¾æ‡c>2ríæÕ¼¾&Ý®;ì¾!#‚Ÿö…\>2×s›oP£¾Ùp–­_¾(\Ÿ}>2<øÓÂXs¾ š…÷0‰j¾.MÕVŠ`á>0ªIØìî=èSwrœ€™¾1RÿvW¢>,fÿ'ÚQÎ>Að“‚)a¾2“tÏ«š>%ò)5†w>"6‘ü ¤m¾2ÕØS®13>™3?èãâ>)V&WOL*¾27üt>x¾ö˜>/ Ì !l¾0Z‹•;9½÷0†â+|>1›YÁ¾+xôìÿc¾ ¾C¼Ö>2µU«Q&¾$¼az̾ƒ¾#‹*^>2Ë_AÔ1ý¾¶fß¿d¾*ƒ/VŒy >1Úãw^A龸©Y?â¾0уÜ>/ßW÷à˜ë>\&Ñ–ô¿¾1êfÚùž>*Fºþ­;û>h:IY{¾2Ót ƒF>#8ÅÐi¤Q>%¢ÃÑ"¾2²è[>Ô>.‹vwïç>+Û6fê¾1‰*=AµZ=ò¢ ÿÀ>0‰UÈ<_Á¾.ÊÕTçH¾ Q ô€b)>2:¿pÞuE¾(ÉÖì¥?H¾F„ßj!>2èVûW¾!côÝiÒ¾&Ý‘Va†@>2‡ÛÅoO¾þEœL”^¾-SH¯[>1*S5ô„½¥{,Å»2¾1ƒ']/š>-oc}„Å>³iýZ:¾2…Э¯>&üÅÙj>!M…ÿjÔ¾2í+Ù[ÿç>p( >(Èñ³Ôø–¾2AiÝ —Á> Jˆ˜¼âI>.ß6G¡fD¾0Šý’sG’½ó¶¾7—k˜>1šˆ-™;¾+Ã]«Ù¥¾Àõ5vp>2Äc´ªb¾$ÖÉùªØ¾¾#§4EðÓ9>2ÚÐ@ÚVɾhlÊÈf“¾*Ð3b½>1Û7[uËŸ½þ’‘QÚø:¾08*œðµ¿>/¦ÖϬ>1%L?Û¾2*'K_©>)¾iHÌÍ>@ÖäOÒy¾2î ÿU“Á>"UáQ×>&&=ËAS=¾2©)ÅH!U>­¢dÏXÇ>,äúñd¾1M:ø§wC=Ø1r*¸>0û°s©¾-Ú°‚—*¾Æpi[~>2…´jÚ4V¾'Wý’@µ¾! Óòÿ>2ú ÆK}¾ånÅÌL¾(»3Â_%>2P-»¹E©¾ €9â¦!÷¾.õl,†¨>0˜oªl¸=ôÕ¹>ÍTÙ¾1®qX“Z>+©q.>Í>cð¸T’†¾2Ö'DY1l>$Š F >$õ+Kä ¾2ßdz9ê>\)¥ÃB“>+TV•¨3]¾1ÇF6Ié·=øŸ§*{:™>0w V@¶¾/<½‘—Œ­¾å=¿-q>2H UÍZ¡¾)¸Õ/³¾U{ Cx>3\‡¥2M¾!P‹Ð¹¾'5æ£Ë˜ÿ>2“flÑðh¾ü²v¼o¾-ÝPŒêªŸ>1•“»+=Øás=9"»¾1\|¹'T>,á~È‚˜(>Ì[Q} ¾2¼‡…åü/>%òçæýž>"¼êEÕb ¾2ùV3õ›C>Rw邏+>*JMBïrR¾2 ”CN§>êm’_­>0†zIÁ¾0uÀ«Ã¾–Cì·ÄÞ>2ó_$Éc¾*RîÍ/¾NíWF>2ÿû°z;ƒ¾"a\ž8Ö•¾&SŒÇgS>2¶Š_zC¢¾/øcj¾-?|MÆ>1DëÍa™ù½¹›4'Ù+¾1/’%êÌ>-¨éäN>pü$°¿¾2¯`óèÉ>&¢Y2G6>"/äêú¾32ϼŻ>¯3#ìQ>)ÔíÐî¾2-qDfô >‘°Wß±m>/úðc¾01q!CÔ¾’ÄHf›A>2 ®'-y¾*aÇ-p¿¾Uݧ+¿>3F%?êL¾"¶×¥¡¤¾&¿²½°ð>2æÉD N¾³Ï=ƒÅ¾-%\i}jU>1Tøqý ¼½ÆÇ“`e鑾1.¥«"Éw>-š„¶>Yþ–ÊB¾2µñæ¬ò>&©¾¯Ê!>"#Á¾œ[_¾3 -¤ \~>ˆáŠ>)ö­¾•³ç¾2-5ÌȃÁ>Ð÷æWƒ>0ˆÊrâA¾0%8ì´É?¾ÁPäWK>2$ ¾%M¾*(µÚŽq ¾E~{8ƒ>3 9°ž*¾"WΛRô|¾&ƒæ~ç)ó>2½Íß d¾­&Y3ZV¾-Œî:[ÉT>19ÉÒ}=Áî)w°s”¾1X­cÈ>-2%òïïs>É¡ëÓ‚m¾2Í= |ë>& *!5ÙB>"á«äG J¾3 ÿ'¬X>ìªÄHÖ>*¨›|Ü¡¾2 ØJ•H=ÿïkPöXU>0[¡µÚ¥Þ¾/Ä\øµí¾[U³K>2S—ÃÖi‰¾)\Y+A¾CØFw>3WÙV¾!IÙ/ˆ V¾'‰×uYµ>2¡Ö?Ýʵ¾'×ܳ¾.jfåïy>0ðÖB8ã=êÖn1.帾1§[ÄR«Š>,Ea,o·—>ªõŠµ”¾2ñ^qkïo>$ËI®Œ†>$AéD*Á¾2ü|ø>ß¹Z->+Û\õ¦¸(¾1ÆÞŽ!=ò=‘%Åäœ>0Ð ¯¸»ê¾.ÇÚ8‘?¾)+,kd>2–`ÍNG@¾'ö=¬\¤Ñ¾ ß‚ ;x>3!Õ%±¾5Cìe¾)Èž‘þ¿>2gMÏ«Q¾QÚÇÅ(ô¾/¨ÿ–vÕ>0rí÷‚Å=þh78à>"¾2OÖ)4D>*É–Õõò>ácz —¾3Æ×ñw‰>"à«Û8 ¢>&1"•Òp¾2ÕPÞbÔz>bµ-¥ŸÄ>-wXúth¾1Q5j\g½³Â¼? %þ>1bx9þ…¾-E§§iƾ­XJ¶š>2Þo¨ó°Ì¾%í8ëP!¾#0“OÃ(h>3ý<:ɾ/ÜÁç3¾+HŸ‚ÔÃ>2hTM½úêæ.L‘ ¾0•…3ßöÈ>/jµ2†P> jLþFqb¾2€vÒ÷á>(¯p³öG‹> "ÌL N¾3*,k'> DŠðL-Þ>(”àíôM¾2†&¢î²> íìÚ~ƒ>/\¥ÁoíÓ¾0ž‰ÂÝÃû½ú0%oíèÀ>2!2:#8¾+'eË…¾"lƒd¥>3W?—ù·¾#4îùè¾%ú,Y2‘>2âÐcÏ#R¾ÚÀ˜L¾-c·ÃÚ'|>1`J¾?=•N’e&Š!¾1ea´n>-V¿-|> ¦Ì‡H¾2æ‚bh·>%åÜyæß>#Q .­¾3‰ © 2>ß͵:>+J`‹„`³¾1ü¨YuªI=ø“bñ 8>0±Liþd¾/?Zb—©è¾ w©‘Ý>2–U7뎾(YQ\èí(¾ ¡L¾o(°>31 _HÛl¾€•],¾)õhmIM>2vrñ¾1EÝŒÛü¾/Ó“‘r‚°>0raÎÍ‹ø>Y'­x'¾2+ßð D>*ÔÒ²Þ>å1C¯hx¾3)‹Ÿg3>"]Ö³j¤Ü>&×ÏîèåX¾2Ð,=gD»>ÀÉ^"•õ>.%¶0Å“ ¾1%Á],f½ãï­[lÞ >1«õ´¯‘õ¾,Š©6p1¡¾•8V³|¿>3¾…ø—&¾$Ç»-ù«¾¾$x·éE>3 Ø“«R¾>ú®¾,_Ý®ø°Ï>1º¹G•%½çÔtSšà¾1¸(綸>.LÏÔb1>]ôª˜Z¾2ί¨»b>&þüxG ]>"@~i ¾3/õê¥ü>³2±>*‰&Ö8Ò4¾23&uÀOb>pP–û¥È>0x¾í?¾/×ãõ‡à=¾üëýŒ>2ÊÀÃH¾)=`ŽIj¾ëg¿¶ >39ÛMÔæH¾ ftïçþ¾(§ZΧ…>2’ô±×¥¾ ke‘K{¾/—»†®ªÛ>0˜ HªV=ý`_`àW¨¾2#Ðͪ¬>*ÙŸMˆØ>d*¦c6ľ3/­N²‚;>"”à'Le>&¿&~;l^¾2ÛmD‚K>ñqcŽ…¶>.,9D¢h¾1,@¬kJ:½ä¬Þ&j+ê>1·Ã=Ö“¶¾,€».q¯¾ñÚÓÍŸ>3Zü©A¾$™Ï~fÃо$Õª‡>ÚB>3 $ËÂw¾hø’[­8¾,³qÍßð>1ªTÎúÑt½ß¶é)¼mv¾1?ø UŒà>-ü^7¨„>›‡E+µg¾2ç —üç>&vÌ6Ó>"îûm~Ý^¾3/È¿úsð>œÃÙcâµ>+2•€iž•¾2á /“=ùdQþ6Q+>0¿ò¯ÚÔ¾/NŠ÷}Ⱦ ʨƒáÞ)>2­~T Â°¾(,¹ðul¾! óbà›•>3?æ¢ Òþ¾Œk)­G`¾)¬ÑÈ4>2jèìÚdŒ¾e@úŠ9¾06Ì›îƒÀ>0=;Æ9a>§ðç#Z¾2hX$îY>)½ÙÆœ>k‚Œå>¾3AEÆéD‰>!oÓÚÈ>(&FG濾2°òG‚Œ> äD¢<¶ò>/Rîìv'¾0Á2§>¤½ù¦/Òžh>2íu쀑¾++tw9­n¾ÐÃŽµ”­>35òæžÿ¾"Ó>©S;Ú¾&¡Uƒb®²>2çáî}0¾,SÚIgP¾.0úžãS»>14Äck¯y=åH­xdº?¾1Ãƹ›˜O>,wþÚªòS>PG àuj¾3pùÉÛ¼>$jj:k9ž>%! ¡ úô¾3÷›[Ú>°•\R ó>- ,Ežó¾1™.— Å=Í¡èþ`¸—>1g¿L'[«¾-¥ù[M<¾ì’g<Æ>2ÿ¦¦H° ¾%ãT©/¾#§d"é>3.Vbî)¾þ܉ª"Ò¾+ã¬áTÑ>1ï¦g/ë_½ñ\Ï©F.µ¾1 Õ{Wù>.µFsËx™>§*­Ûi¾2×ÑPËÉ>'?éáEÝÖ>"5¡ûlƾ3@ÔÐU=9>~‡+ç_>*½D¤%ï¾29“…Õ²=þX!&ûz>0£?•}r‘¾/ª%™Xc¾ à4Øv`>2©Œ/Ö·¿¾(&ʆ™¹¾ ͽ/¨V>3JjÕ.¾|2¶¾)™WÈ£9>2xFÓ¸‘v¾Qú aÎV¾0=7´ )J>0C![v>ÿ“^àe̾2uÖû þÈ>)©á„Î9>áíc®Ø¾3K9Æ„­õ> ÜJãïö=>(z†}C(¾2¬±{ô?/> #PÈ•›>/¬pV {¾0¥Œ$÷ú½þ{´=>2> ô¾*¸ÇDL*<¾?o[K¾>3Eƒ™zâ;¾" …Ö³šu¾'`a!ßï>2Ø!CØ%¾O¼LÑ=¾.ݼÇÕÛ>0ýŽÍ—§T=óƒÄwX5ˆ¾2ê~ƒ¡ï>+²MÍÂÆ>>¶S Q©"¾39Ë4[dE>#NÔ²´ó>&MÎ#zšþ¾2û`´óf$>åµÀ+?Þ>.]a4ó¾1KÎì´†½â&Ýfu>1Åibú¾,–°mG¿t¾Fs¬fl>3)=”A¾$gÞÅ›ß=¾%BÊ, rŒ>3™°Bºð¾SßÊ2¾-E²€>1‘nr13½ªf…eên¾1†ƒœAÏÎ>-gá¡ü>ñJ¤*6¾3såßû5>%mG‘ÏÒÏ>$@zõÝ,\¾3-l‰5º>œ¹þ7IÃ>,}aª›Ñp¾1Îÿ€r=än8Xþ÷à>1F²3í½ü¾.&é²9¾¶$É¥º$>2üp‡Z*n¾&_Ãð -¾#Fó®» >3=ä2%"5¾ÀãÆkÈV¾+¹¸t Ì>2„þ€‚Š½óXt)Ák¾1o²ï¬û>.Õ•ÿƽ>•à X_í¾2áŸY!µ>'@óN>"Wõüׄ¾3Iv[© >Ã"ŸpÓH>*ûHárÙ¾25wÙöo=û{ßÕl (>0Æu„÷îü¾/tÉ•ï0þ¾ ˆœÍä>2ÄØÙöT|¾(u}ÚÖ ¾!pjôZú>3QS]â龤'턼¾*B²çü>2_¼€ïO ¾²â…Cîþ0†ðÓ¨p>0‡;;r> Euíý¾2¦aŒëÜ>(Òòér(> “¼m(á¾3TôQmF¢>f»?Høž>) <-­¾2„µ™©Ðà>n¼9 É×>0Hv‹@¾0EU€>¾û¾Ž3+„Ï>2†íPqÌs¾)…î aí*¾€õ<Ô~H>3UüLÇ: ¾ …Ñçì;Þ¾(áúœÖÎN>2¥+Ù¯‹¾òCîØÓ¾0 TsÀW>0ÌÞ~­>'|×wñ¾2f›&jÑŠ>*+í@bà>î¦ÆE ¾3TTHÌj>!JÓðÏ/m>(;}W(N¾2Áe@ g> Bª_„>/ž_eH’q¾0¸Ò²Ý+5½ý¼“cÿ¤)>2EûQ'mz¾*ÅåÁÛ¾mIfBmà>3P§G0Ù¾"ÊUjÕ±¾'›3€oê>2Úþ$¡¾_;¥¾/)†¿µT>0ëzöx=÷†#¶Õμ¾2%(Íÿ>+TŽVë >ÿ@`K¾3KZ‰”>"¯Kúþ‚>'šÓ¤á¾2ïi^>'%Äk>.¸D ¶ð¦¾1ä5–Ô½ñ¢ýòÄFÕ>2l³¯®ã¾+×íá$¾¢LÛ|`>3D(+ŸB¾#OÜá×"|¾&n´b¹›>3þ“ë =¾ˆ2Q9 ’¾.JH¸] >1BË*Ÿ°=è$Ãc€Ý¾1ãÞ0Íîµ>,RŠ¢'K$>V© ¢-n¾3;äx²F0>#æ¤i«N>%àùŽ'µ€¾3ïYJ%>Õ‹Ðq>-à©z5D¾1hûöA,í½Û/Zß!ªì>1ÃÒ«d·8¾,Ä1u\¬¾”¼9'Z>32Åù¡ ;$s¡°DÈð¾%YžÛ6ùt>3ÃZšš»¾a©Ú«ô¾-y7?¨¼>1Œ j%Å$=¼éHPm+¾1¤'/–ã>-. Áâ6à>îR#“¾3(¹hšõÞ>$øocrË>$Ø5pT1¾3+„eQJ;>6UÝåzH>-Æܪ¾1¬ I+€§=Çq.kˆ>1…$=çE¾-s*ÞñR¾Ïf³É,¥>3+ã™ê,¾%t=}BÚd¾$\Vwðj>35¨¶7Ñu¾M`±î¾,¶!]kÒ>1ɃÇñ•½Ý­>v †¾1fžãL†¼>-ìoJhÐm>¾¸ž­¾3üy}³¤>%é8âE|¯>#å(ó‰S¾3>)-ϽÇ>UÎݳF'>,Y¯™ƒF¾1ä‚é«8=çaë;,¿~>1H×Ç4{*¾.B,¥ö˾¹˜šs,í>3†=.û‹¾&W+±4Íľ#rèç5¨Ê>3Enýv|>¾O»ùµ»•¾,Š KP>1ýv!Ìp¾½ï™Üí¾1+ª>.’©{8±¾>À§O0Jí¾2û¥³ I±>&¿)^‹üý>#tÜt¹¾3KiªÆÓ>=< þùt>+©ÏòvŠ¾2]Ïצw=óžµ[‡oå>1ô3E¾.Ý×÷ÐbO¾ÒC;Öq¨>2ï¥î‡UÙ¾'!c ¹ÿ¾"œ g*ó>3Pt±|¾¿23æ¾+V?‡š2Ç>2)™¹ bн÷LEsÊÿ¾0ó$:òÞõ>/$…˜Í†4>Þã®sK¾2ãj%â>'}´®vd>"7t^™ ¾3TlÚ[×+>ó\Tš×v>+ Õ0†\¾2=òVµ=úË„lÆ`Ö>0Ø*âL8¾/fGkqE¾-}x yœ>2×O“8²¾'ÔI‘i7¾!×y‰–x>3W©þ³8¾»Õ­Ÿ¾*¹|kÈvÊ>2NÎk%¤½þçD”²¾0¾JÝL;Æ>/¢ü”rƒ> š:%-3[¾2Ëeîes5>($ñV§>!~Ù«ša¾3ZÍ¡ö>q¾ékJ>*s7Ð6¬¾2^^“Xš>‚&q܈">0¦Üåœqì¾/×ë‰ôO¾ 6G”4•>2ÀÄk…‚Ò¾(gñî±¼ò¾!2Ñ(A0>3[¾qæâY¾½ÿ‡þ¾*:Ìçš>2jI(¾šfÉcb]¾0•ûتŒÁ>/ûž«<¤&> X÷夾2ºÇײ(>(‰­°B¨>!;­AE¾3\¬º[ÀÐ>\ŠØ³>*AØÐM°¾2fÚÙ >´Æ¨›>0±\¾w¾/¨œ¹d2óµfó¾&tt7qV¾&ù°òã>7ªŸÊÕ¾•>YÝC­ÂX>(`Ö1=[h¾1Ü©Ÿ ÿ> ¾ rSÜ>-bÁë¾0’ÞÓ¡ë}½«cRŠy>0 eŠœ¾-BMÒˆö¾ ¬·Vôìh>1è–œøûD¾(3¯Õó¢#¾ë2éÀ>2|V#B;À¾"*áQ7ì¾$òFmnæÆ>2SæJ]‰¾ÇBÿ¾<¾*¡láf4>1oaÏ ég¾ˆ“Â… ¾/;“h¡±">/¬æ'Y¼=úxPѯ¾1MãÝ‹>+0y\aHJ>J”Yß=Ѿ2IÛR$ŒC>%•–úg5t>!‘Y͑ľ2ˆnN )E=*ÛÎ>'ʪ³|ðè¾2ºè®–¨>ÀáëŒÔ>-MåE»¦¾0¨EÚ=Ì £X·Š>0‘Jxú·¾-œR7×'¾ V\á|¨>1ìç9ú—¾(tÆ?澯·2=XK>2Šóê–¾"Cöq÷›²¾%ä:Ÿu­>2`Û_“#‡¾”È)æ¾*Ö¢»Ø†u>1q\ºI ]½þ‹°ï l¡¾/‰vÒv>/ˆˆiÛæ?=þ²5“&λ¾1tw‰Ú>*Ô¿`ÔwÅ>³™i†äf¾2g(²#<>$ø@2™k¸>"fwè„á¾2I#¼Ø>bk»#%>(®œË¾1í¢8@> "ÌÙäúÎ>-éfëŸ&¾0ƒßúVÁF½Þ 9ŸW§×>0îCx»0ó¾,à å(ô¾HÎTg²>2,{©¸É¢¾':(Ö…Zÿ¾ú¥ºÕç]>2 ZÙ¾ ¨ÙxJD%¾&§Ù± zÏ>2Boج'¾®stÆʾ,Wu)ÛÆ >1@>‹%ä½élNç’ܾ0dî‚»G¼>.N¬üm5> ¡&À·h¾1åm«‰>)±—¤Æý>®Cm]±S¾2™µÔ‚ÝÜ>"·ô_³K>$Ó§*@ž¾2y>‘½/>ÿNý¤š>*å'ž¬C¾1ƒ¯~²ùŽ=ýìú‰ÿ>/ÃÉ[ .]¾/…F¾—Z¾Ô8?ž¶&>1šiWàô¾*’6HTk¾ø=ùÜÇ!>2†Æ_ ¾$ev[ú3ï¾#<6ŸX:`>2šÄ—b†¯¾ŠµÏá”P¾)Ÿ;Q ?®>1Óý˜€†‘¾¾™B¾.ØIï¶y­>0: 8'Þ=ôôƘý¾1SºøØP>+½cù;>ä³æve¾2nŽË’>%¹Jðc §>!éýú´œ¾2­Þ>g P>Z½P(ñ«BNM¾2 lHôb> ²|-ˆ<>.âÞÝ ¾0“58GZ½âÉÀ¼¯Pß>1&™Œ¾,ŸV.f¾yžA¶>2WUáÀ¾&¹ò4í®\¾ áã€`£[>2¸z¿Ÿ¥õ¾w³¿â[Õ¾'½Îs£§Î>25rž¾ãGX@™h¾-{3<>0ÒµçÛp9=¸‚º=Úå¾0èÉá1™>-?×ï™ýÓ>»= sœ¾2D‰-ÁŒ>'mÚö¡@ > '¸ÎR6¨¾2¾©W˜à> u{1+²Ì>'-áû5³¾2OÑnÒǶ>W]uPãF>-&F,>¾0ûîä\O=Ì* \îqœ>0ËØyû'¾-¤v\cJݾS¦0p"›>2:Nq&T¾'Ù?ÃZF¾y‹Ôüqˆ>2Ñ‹Äæú¾ Ý/-~^ ¾&âD1Å¡8>2_tHUI¾9°Œ¾,élR /%>1y:g®E½×$ꉢç¾0Á΋/i—>-Ñ¥í哼>‹¥4$¾29Ðý¢¸ã>'ÿÅŠ…ª>C¶B Yݾ2È{ŠŸ’> õã àr>&ÜNξ2e›Ù"³>ÝÎÝNî>,ógž0¾1Tʵ.ü=ÕD›©>Ò>0Ël–“Œ|¾-ÉØ‹7Ú¾3Ürª>2CÍÈ™P5¾'⤢þ)ž«µ„Ås7>2Îf÷Z0—¾ ÀwÛ½éʾ'Î|»'>2b¾ì ,¾|šA‡éy¾-4?2d>1ëJ¤ßŽÁ ~ß«ž¾0çú“So>-‹)¡€A?>{žÇN¥¾2WZ{Q>'‚rYãWq> Ws”@Ÿ¾2Óçmœ<> = Ünì>'œ(3µ¾2UÄqíP >8†x Æ>-©JÕ4¬¾0â†v^½Í–!ÕÏ>1ͪ¯¾-Ó’¾æ‡c>2ríæÕ¼¾&Ý®;ì¾!#‚Ÿö…\>2×s›oP£¾Ùp–­_¾(\Ÿ}>2<øÓÂXs¾ š…÷0‰j¾.MÕVŠ`á>0ªIØìî=èSwrœ€™¾1RÿvW¢>,fÿ'ÚQÎ>Að“‚)a¾2“tÏ«š>%ò)5†w>"6‘ü ¤m¾2ÕØS®13>™3?èãâ>)V&WOL*¾27üt>x¾ö˜>/ Ì !l¾0Z‹•;9½÷0†â+|>1›YÁ¾+xôìÿc¾ ¾C¼Ö>2µU«Q&¾$¼az̾ƒ¾#‹*^>2Ë_AÔ1ý¾¶fß¿d¾*ƒ/VŒy >1Úãw^A龸©Y?â¾0уÜ>/ßW÷à˜ë>\&Ñ–ô¿¾1êfÚùž>*Fºþ­;û>h:IY{¾2Ót ƒF>#8ÅÐi¤Q>%¢ÃÑ"¾2²è[>Ô>.‹vwïç>+Û6fê¾1‰*=AµZ=ò¢ ÿÀ>0‰UÈ<_Á¾.ÊÕTçH¾ Q ô€b)>2:¿pÞuE¾(ÉÖì¥?H¾F„ßj!>2èVûW¾!côÝiÒ¾&Ý‘Va†@>2‡ÛÅoO¾þEœL”^¾-SH¯[>1*S5ô„½¥{,Å»2¾1ƒ']/š>-oc}„Å>³iýZ:¾2…Э¯>&üÅÙj>!M…ÿjÔ¾2í+Ù[ÿç>p( >(Èñ³Ôø–¾2AiÝ —Á> Jˆ˜¼âI>.ß6G¡fD¾0Šý’sG’½ó¶¾7—k˜>1šˆ-™;¾+Ã]«Ù¥¾Àõ5vp>2Äc´ªb¾$ÖÉùªØ¾¾#§4EðÓ9>2ÚÐ@ÚVɾhlÊÈf“¾*Ð3b½>1Û7[uËŸ½þ’‘QÚø:¾08*œðµ¿>/¦ÖϬ>1%L?Û¾2*'K_©>)¾iHÌÍ>@ÖäOÒy¾2î ÿU“Á>"UáQ×>&&=ËAS=¾2©)ÅH!U>­¢dÏXÇ>,äúñd¾1M:ø§wC=Ø1r*¸>0û°s©¾-Ú°‚—*¾Æpi[~>2…´jÚ4V¾'Wý’@µ¾! Óòÿ>2ú ÆK}¾ånÅÌL¾(»3Â_%>2P-»¹E©¾ €9â¦!÷¾.õl,†¨>0˜oªl¸=ôÕ¹>ÍTÙ¾1®qX“Z>+©q.>Í>cð¸T’†¾2Ö'DY1l>$Š F >$õ+Kä ¾2ßdz9ê>\)¥ÃB“>+TV•¨3]¾1ÇF6Ié·=øŸ§*{:™>0w V@¶¾/<½‘—Œ­¾å=¿-q>2H UÍZ¡¾)¸Õ/³¾U{ Cx>3\‡¥2M¾!P‹Ð¹¾'5æ£Ë˜ÿ>2“flÑðh¾ü²v¼o¾-ÝPŒêªŸ>1•“»+=Øás=9"»¾1\|¹'T>,á~È‚˜(>Ì[Q} ¾2¼‡…åü/>%òçæýž>"¼êEÕb ¾2ùV3õ›C>Rw邏+>*JMBïrR¾2 ”CN§>êm’_­>0†zIÁ¾0uÀ«Ã¾–Cì·ÄÞ>2ó_$Éc¾*RîÍ/¾NíWF>2ÿû°z;ƒ¾"a\ž8Ö•¾&SŒÇgS>2¶Š_zC¢¾/øcj¾-?|MÆ>1DëÍa™ù½¹›4'Ù+¾1/’%êÌ>-¨éäN>pü$°¿¾2¯`óèÉ>&¢Y2G6>"/äêú¾32ϼŻ>¯3#ìQ>)ÔíÐî¾2-qDfô >‘°Wß±m>/úðc¾01q!CÔ¾’ÄHf›A>2 ®'-y¾*aÇ-p¿¾Uݧ+¿>3F%?êL¾"¶×¥¡¤¾&¿²½°ð>2æÉD N¾³Ï=ƒÅ¾-%\i}jU>1Tøqý ¼½ÆÇ“`e鑾1.¥«"Éw>-š„¶>Yþ–ÊB¾2µñæ¬ò>&©¾¯Ê!>"#Á¾œ[_¾3 -¤ \~>ˆáŠ>)ö­¾•³ç¾2-5ÌȃÁ>Ð÷æWƒ>0ˆÊrâA¾0%8ì´É?¾ÁPäWK>2$ ¾%M¾*(µÚŽq ¾E~{8ƒ>3 9°ž*¾"WΛRô|¾&ƒæ~ç)ó>2½Íß d¾­&Y3ZV¾-Œî:[ÉT>19ÉÒ}=Áî)w°s”¾1X­cÈ>-2%òïïs>É¡ëÓ‚m¾2Í= |ë>& *!5ÙB>"á«äG J¾3 ÿ'¬X>ìªÄHÖ>*¨›|Ü¡¾2 ØJ•H=ÿïkPöXU>0[¡µÚ¥Þ¾/Ä\øµí¾[U³K>2S—ÃÖi‰¾)\Y+A¾CØFw>3WÙV¾!IÙ/ˆ V¾'‰×uYµ>2¡Ö?Ýʵ¾'×ܳ¾.jfåïy>0ðÖB8ã=êÖn1.帾1§[ÄR«Š>,Ea,o·—>ªõŠµ”¾2ñ^qkïo>$ËI®Œ†>$AéD*Á¾2ü|ø>ß¹Z->+Û\õ¦¸(¾1ÆÞŽ!=ò=‘%Åäœ>0Ð ¯¸»ê¾.ÇÚ8‘?¾)+,kd>2–`ÍNG@¾'ö=¬\¤Ñ¾ ß‚ ;x>3!Õ%±¾5Cìe¾)Èž‘þ¿>2gMÏ«Q¾QÚÇÅ(ô¾/¨ÿ–vÕ>0rí÷‚Å=þh78à>"¾2OÖ)4D>*É–Õõò>ácz —¾3Æ×ñw‰>"à«Û8 ¢>&1"•Òp¾2ÕPÞbÔz>bµ-¥ŸÄ>-wXúth¾1Q5j\g½³Â¼? %þ>1bx9þ…¾-E§§iƾ­XJ¶š>2Þo¨ó°Ì¾%í8ëP!¾#0“OÃ(h>3ý<:ɾ/ÜÁç3¾+HŸ‚ÔÃ>2hTM½úêæ.L‘ ¾0•…3ßöÈ>/jµ2†P> jLþFqb¾2€vÒ÷á>(¯p³öG‹> "ÌL N¾3*,k'> DŠðL-Þ>(”àíôM¾2†&¢î²> íìÚ~ƒ>/\¥ÁoíÓ¾0ž‰ÂÝÃû½ú0%oíèÀ>2!2:#8¾+'eË…¾"lƒd¥>3W?—ù·¾#4îùè¾%ú,Y2‘>2âÐcÏ#R¾ÚÀ˜L¾-c·ÃÚ'|>1`J¾?=•N’e&Š!¾1ea´n>-V¿-|> ¦Ì‡H¾2æ‚bh·>%åÜyæß>#Q .­¾3‰ © 2>ß͵:>+J`‹„`³¾1ü¨YuªI=ø“bñ 8>0±Liþd¾/?Zb—©è¾ w©‘Ý>2–U7뎾(YQ\èí(¾ ¡L¾o(°>31 _HÛl¾€•],¾)õhmIM>2vrñ¾1EÝŒÛü¾/Ó“‘r‚°>0raÎÍ‹ø>Y'­x'¾2+ßð D>*ÔÒ²Þ>å1C¯hx¾3)‹Ÿg3>"]Ö³j¤Ü>&×ÏîèåX¾2Ð,=gD»>ÀÉ^"•õ>.%¶0Å“ ¾1%Á],f½ãï­[lÞ >1«õ´¯‘õ¾,Š©6p1¡¾•8V³|¿>3¾…ø—&¾$Ç»-ù«¾¾$x·éE>3 Ø“«R¾>ú®¾,_Ý®ø°Ï>1º¹G•%½çÔtSšà¾1¸(綸>.LÏÔb1>]ôª˜Z¾2ί¨»b>&þüxG ]>"@~i ¾3/õê¥ü>³2±>*‰&Ö8Ò4¾23&uÀOb>pP–û¥È>0x¾í?¾/×ãõ‡à=¾üëýŒ>2ÊÀÃH¾)=`ŽIj¾ëg¿¶ >39ÛMÔæH¾ ftïçþ¾(§ZΧ…>2’ô±×¥¾ ke‘K{¾/—»†®ªÛ>0˜ HªV=ý`_`àW¨¾2#Ðͪ¬>*ÙŸMˆØ>d*¦c6ľ3/­N²‚;>"”à'Le>&¿&~;l^¾2ÛmD‚K>ñqcŽ…¶>.,9D¢h¾1,@¬kJ:½ä¬Þ&j+ê>1·Ã=Ö“¶¾,€».q¯¾ñÚÓÍŸ>3Zü©A¾$™Ï~fÃо$Õª‡>ÚB>3 $ËÂw¾hø’[­8¾,³qÍßð>1ªTÎúÑt½ß¶é)¼mv¾1?ø UŒà>-ü^7¨„>›‡E+µg¾2ç —üç>&vÌ6Ó>"îûm~Ý^¾3/È¿úsð>œÃÙcâµ>+2•€iž•¾2á /“=ùdQþ6Q+>0¿ò¯ÚÔ¾/NŠ÷}Ⱦ ʨƒáÞ)>2­~T Â°¾(,¹ðul¾! óbà›•>3?æ¢ Òþ¾Œk)­G`¾)¬ÑÈ4>2jèìÚdŒ¾e@úŠ9¾06Ì›îƒÀ>0=;Æ9a>§ðç#Z¾2hX$îY>)½ÙÆœ>k‚Œå>¾3AEÆéD‰>!oÓÚÈ>(&FG濾2°òG‚Œ> äD¢<¶ò>/Rîìv'¾0Á2§>¤½ù¦/Òžh>2íu쀑¾++tw9­n¾ÐÃŽµ”­>35òæžÿ¾"Ó>©S;Ú¾&¡Uƒb®²>2çáî}0¾,SÚIgP¾.0úžãS»>14Äck¯y=åH­xdº?¾1Ãƹ›˜O>,wþÚªòS>PG àuj¾3pùÉÛ¼>$jj:k9ž>%! ¡ úô¾3÷›[Ú>°•\R ó>- ,Ežó¾1™.— Å=Í¡èþ`¸—>1g¿L'[«¾-¥ù[M<¾ì’g<Æ>2ÿ¦¦H° ¾%ãT©/¾#§d"é>3.Vbî)¾þ܉ª"Ò¾+ã¬áTÑ>1ï¦g/ë_½ñ\Ï©F.µ¾1 Õ{Wù>.µFsËx™>§*­Ûi¾2×ÑPËÉ>'?éáEÝÖ>"5¡ûlƾ3@ÔÐU=9>~‡+ç_>*½D¤%ï¾29“…Õ²=þX!&ûz>0£?•}r‘¾/ª%™Xc¾ à4Øv`>2©Œ/Ö·¿¾(&ʆ™¹¾ ͽ/¨V>3JjÕ.¾|2¶¾)™WÈ£9>2xFÓ¸‘v¾Qú aÎV¾0=7´ )J>0C![v>ÿ“^àe̾2uÖû þÈ>)©á„Î9>áíc®Ø¾3K9Æ„­õ> ÜJãïö=>(z†}C(¾2¬±{ô?/> #PÈ•›>/¬pV {¾0¥Œ$÷ú½þ{´=>2> ô¾*¸ÇDL*<¾?o[K¾>3Eƒ™zâ;¾" …Ö³šu¾'`a!ßï>2Ø!CØ%¾O¼LÑ=¾.ݼÇÕÛ>0ýŽÍ—§T=óƒÄwX5ˆ¾2ê~ƒ¡ï>+²MÍÂÆ>>¶S Q©"¾39Ë4[dE>#NÔ²´ó>&MÎ#zšþ¾2û`´óf$>åµÀ+?Þ>.]a4ó¾1KÎì´†½â&Ýfu>1Åibú¾,–°mG¿t¾Fs¬fl>3)=”A¾$gÞÅ›ß=¾%BÊ, rŒ>3™°Bºð¾SßÊ2¾-E²€>1‘nr13½ªf…eên¾1†ƒœAÏÎ>-gá¡ü>ñJ¤*6¾3såßû5>%mG‘ÏÒÏ>$@zõÝ,\¾3-l‰5º>œ¹þ7IÃ>,}aª›Ñp¾1Îÿ€r=än8Xþ÷à>1F²3í½ü¾.&é²9¾¶$É¥º$>2üp‡Z*n¾&_Ãð -¾#Fó®» >3=ä2%"5¾ÀãÆkÈV¾+¹¸t Ì>2„þ€‚Š½óXt)Ák¾1o²ï¬û>.Õ•ÿƽ>•à X_í¾2áŸY!µ>'@óN>"Wõüׄ¾3Iv[© >Ã"ŸpÓH>*ûHárÙ¾25wÙöo=û{ßÕl (>0Æu„÷îü¾/tÉ•ï0þ¾ ˆœÍä>2ÄØÙöT|¾(u}ÚÖ ¾!pjôZú>3QS]â龤'턼¾*B²çü>2_¼€ïO ¾²â…Cîþ0†ðÓ¨p>0‡;;r> Euíý¾2¦aŒëÜ>(Òòér(> “¼m(á¾3TôQmF¢>f»?Høž>) <-­¾2„µ™©Ðà>n¼9 É×>0Hv‹@¾0EU€>¾û¾Ž3+„Ï>2†íPqÌs¾)…î aí*¾€õ<Ô~H>3UüLÇ: ¾ …Ñçì;Þ¾(áúœÖÎN>2¥+Ù¯‹¾òCîØÓ¾0 TsÀW>0ÌÞ~­>'|×wñ¾2f›&jÑŠ>*+í@bà>î¦ÆE ¾3TTHÌj>!JÓðÏ/m>(;}W(N¾2Áe@ g> Bª_„>/ž_eH’q¾0¸Ò²Ý+5½ý¼“cÿ¤)>2EûQ'mz¾*ÅåÁÛ¾mIfBmà>3P§G0Ù¾"ÊUjÕ±¾'›3€oê>2Úþ$¡¾_;¥¾/)†¿µT>0ëzöx=÷†#¶Õμ¾2%(Íÿ>+TŽVë >ÿ@`K¾3KZ‰”>"¯Kúþ‚>'šÓ¤á¾2ïi^>'%Äk>.¸D ¶ð¦¾1ä5–Ô½ñ¢ýòÄFÕ>2l³¯®ã¾+×íá$¾¢LÛ|`>3D(+ŸB¾#OÜá×"|¾&n´b¹›>3þ“ë =¾ˆ2Q9 ’¾.JH¸] >1BË*Ÿ°=è$Ãc€Ý¾1ãÞ0Íîµ>,RŠ¢'K$>V© ¢-n¾3;äx²F0>#æ¤i«N>%àùŽ'µ€¾3ïYJ%>Õ‹Ðq>-à©z5D¾1hûöA,í½Û/Zß!ªì>1ÃÒ«d·8¾,Ä1u\¬¾”¼9'Z>32Åù¡ ;$s¡°DÈð¾%YžÛ6ùt>3ÃZšš»¾a©Ú«ô¾-y7?¨¼>1Œ j%Å$=¼éHPm+¾1¤'/–ã>-. Áâ6à>îR#“¾3(¹hšõÞ>$øocrË>$Ø5pT1¾3+„eQJ;>6UÝåzH>-Æܪ¾1¬ I+€§=Çq.kˆ>1…$=çE¾-s*ÞñR¾Ïf³É,¥>3+ã™ê,¾%t=}BÚd¾$\Vwðj>35¨¶7Ñu¾M`±î¾,¶!]kÒ>1ɃÇñ•½Ý­>v †¾1fžãL†¼>-ìoJhÐm>¾¸ž­¾3üy}³¤>%é8âE|¯>#å(ó‰S¾3>)-ϽÇ>UÎݳF'>,Y¯™ƒF¾1ä‚é«8=çaë;,¿~>1H×Ç4{*¾.B,¥ö˾¹˜šs,í>3†=.û‹¾&W+±4Íľ#rèç5¨Ê>3Enýv|>¾O»ùµ»•¾,Š KP>1ýv!Ìp¾½ï™Üí¾1+ª>.’©{8±¾>À§O0Jí¾2û¥³ I±>&¿)^‹üý>#tÜt¹¾3KiªÆÓ>=< þùt>+©ÏòvŠ¾2]Ïצw=óžµ[‡oå>1ô3E¾.Ý×÷ÐbO¾ÒC;Öq¨>2ï¥î‡UÙ¾'!c ¹ÿ¾"œ g*ó>3Pt±|¾¿23æ¾+V?‡š2Ç>2)™¹ bн÷LEsÊÿ¾0ó$:òÞõ>/$…˜Í†4>Þã®sK¾2ãj%â>'}´®vd>"7t^™ ¾3TlÚ[×+>ó\Tš×v>+ Õ0†\¾2=òVµ=úË„lÆ`Ö>0Ø*âL8¾/fGkqE¾-}x yœ>2×O“8²¾'ÔI‘i7¾!×y‰–x>3W©þ³8¾»Õ­Ÿ¾*¹|kÈvÊ>2NÎk%¤½þçD”²¾0¾JÝL;Æ>/¢ü”rƒ> š:%-3[¾2Ëeîes5>($ñV§>!~Ù«ša¾3ZÍ¡ö>q¾ékJ>*s7Ð6¬¾2^^“Xš>‚&q܈">0¦Üåœqì¾/×ë‰ôO¾ 6G”4•>2ÀÄk…‚Ò¾(gñî±¼ò¾!2Ñ(A0>3[¾qæâY¾½ÿ‡þ¾*:Ìçš>2jI(¾šfÉcb]¾0•ûتŒÁ>/ûž«<¤&> X÷夾2ºÇײ(>(‰­°B¨>!;­AE¾3\¬º[ÀÐ>\ŠØ³>*AØÐM°¾2fÚÙ >´Æ¨›>0±\¾w¾/¨œ¹d2óµfó¾&tt7qV¾&ù°òã>7ªŸÊÕ¾•healpy-1.8.1/healpy/data/weight_ring_n00512.fits0000650000175000017530000010340011705033043021676 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:04:54' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24576 / width of table in bytes NAXIS2 = 1 / 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 NSIDE = 512 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 1700 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1024D ' MAXVAL1 = 1.728855013929E-01 / maximum value of T weights MINVAL1 = -8.531867588429E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1024D ' MAXVAL2 = 1.728855013929E-01 / maximum value of Q weights MINVAL2 = -8.531867588429E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1024D ' MAXVAL3 = 1.728855013929E-01 / maximum value of U weights MINVAL3 = -8.531867588429E-02 / minimum value of U weights COMMENT END ?Æ!³7±Õ¿µ×qÚ©;e?©0bh¤/ð¿ƒ9ãÔÝ?(aŽ¶º7¿}Q[õÀ±?W„åKÆ–?`Z˜dF×G¿nœImÓ$Y?qPGÔ,y‘¿oY;¢BA?h0ì䬟ï¿]ÌšØI?FdJí ?2ŽÉ£’* ¿Oú–oÀÊå?V'ÉÃ6s—¿WQøˆMÜô?TWß—F"¿MÆòÕŽ?=5Uû +…¾Ü6¿Ó¼ëÉ¿75in$¿?Cêf1Ö½¿Ggx·=?Fg̳Ö¦¿A¾ 5tH—?5hзÁ~¿:êó%ðA¿"dó_Ù?4‰R‚=¿:ý´v¬a¬?<ÕöÂê÷?*Úi ‰½¿Ó=äÙ>Ü¿µm}‡?lZ¦¿Ûl¿%:>SbÆ©?*Iz.¨e¿*ec=I?%ðooªâ¿_3õY-?R„‰Pc?–-¯qå¿ðš©GÜk?" ¤üþ1’¿$2dŸê4?"*B9 ©¿D‡³D¿?²BåJÈú>æ5î¡û¿mF³6ý°?[.]Å¿úrSQ?*úðT*z¿ r¬È¹? iÉÓg@¾ã¸=á: ¿h8To9?BeóÏ%¿Ó¸ŸÏ=o?÷oÐ'F ¿»´z1ëò? ÚÀÆšŽ[¾÷©¿c³¨Ö±µ,>üÉvÓUp»¿ 5|òï¥?{‰ur¿ÞSºxž¶? ®ý7U™¿ð.$o%>鉇z¿µ'>êÐ^Ùã:´¿t ÌÍf? Õž“¸ÍV¿ Ø•ly1? Ë’bU¿>éä-UÎ>õjWuI>³™ý$ƒ5¾öZ;&ã9u?g_~´¢¿ýðvå?O.æ¥Ñ›¿yŽP]„>úœ¿nðÙk¾àœN vÓ¾ålpÅ–©§>û/¼µ¢Í¿6®ØjÔÕ?]´˜ªwÅ¿Ñ{)!°ï>ýñ]¤Óóû¾ïÍÕ¢ª¾¯dìV¥²>ð½ßJ)¾ýPæú_?Ôõù¿kæ/®ëþ>ÿNäkÂÚq¾ô±Õ5n¢>ÛÙ+|ô°>Ýé“ 5Ò<¾ô.]BJo>ýRu…âh¿hžF:©>þîÞÆ¥¾¾÷ðº©oÎÞ>êWþ^Å"·¾¡„ZrC¾ç‰ý¹™/>õ½@çÑžM¾ûǺ<Ž‘i>ýÎ+Ìà¾ùd6z÷4â>ñª ×=þ¾Ü÷š. Ì,¾ÐE°¡ªì>ì»áZ6ñ¾õü¹=1BA>ùÀØ»‹y¾ù)p\Ì^>ôq¶xþo¾èüsD/¨Ê>Ž;u·Ô>Ü賟1^\¾ïiŒ¶m >õ_Ë‹§7¾÷bçÇ ¬U>õ…2Íá¾ð0­Æ~øE>à»\Ǿ>£‰-‹@ò®¾â} ¸A« >ð%’m1p¾ô>fâ ³Z>ôóTÕAÖ¾ò? ×·9>éRÇnkd¾Ô´în¨?p¾Çš½€’zÎ>äÉäb2J¾ïóÆj&?Ó>òÙr§ho¾ò f¶Œ^>î×õž§ák¾ã¨­†ÿ‚8>ÆnÚïü>ÑüxØ4¾åÍ„)è´Å>îÔÊÉ\ÇϾñ^Âl£h>ð…0³™Õñ¾ê$Ç2¢0é>Þ‹PY‡Q¾±ò1Ä ¡¾ÕªÇâ+0>å島(u|¾íAðÞÂŒ>ïÙ‘„ÛᓾíbçL#Í>æ_9%Mæ4¾Ø –ðFÜ„>Fñ¶=¢>×j#ö[éO¾åYãú¶ùƒ>ëuÕ)vÿ¾í+ÈÈÿ}>êRšG‡·¾ãv¢e¡ôô>Ó~b­“/ª>¤1VÇ›|Š¾×­Tðý>>ä^‰ëSh¾é–Pì eü>êÆ[Ø¥ü»¾ç×Yj´r>áT e1¾ÐžÕèUfR¾¬Œ+0?_>ÖËŠéHh¾ã>Ô³h{>ç¸u·ž%¾è­sù&4ÿ>åä>‹åÐb¾ßºæêu,“>ÎM ´Ä’L>ªóU­°«¾ÕHÊQ»>ᔞ᱄K¾åãù†g²I>æÚ£ª%Ud¾äfx1Mú—>ÝïÕëe¾Í°Ž8)¾¡)æ„âx>Ò}x<óiw¾ßËÕ²æ/c>ä‡÷^¾å?aà)¦÷>ãF†Ð:Ì¾Ý Cqµó>Îù¾‹Z/ù>RUZ˜¿çH¾Î¨ŒPõðø>ÜzÎŽA}¾âD t”— >ãÆÄv<~ò¾âhõŒ`ð>Ü×÷j•R¾ÐßùÇn#q>¥ªxüƒÁd>Ç-;©PÛ‹¾×ù~p7ô>à]rñD ¾âVÆëQŠ5>á®w"âç,¾Ýæº#”>ÒËß(ž¾¸93õ æ¾½>?×Ùœq>ÓkE4Rmš¾ÜšŒháj>àÑ„¦áÓO¾àóØø@£è>ÝvsâñC\¾ÕV×"?P>ßþ0ó 8>¤ls¡Qho¾Ì¶®ZP­k>×ý­™œ¾Þ-ÓŽüç">àE¨Ñù ¾Ý²*O­±\>×Aoš íó¾ËŠ¯q‹éu>¤§ðhèñ>ÁŠ L:±¾ÒÁ#Å趩>Úìk.,Y¾ÝÁ)ÊÝ~»>Ýjü3–IR¾Ù+S8ã”ê>Ñ¥z}ˆо¿¡3Šir•¾¥ÁKHM»î>É¢K.eþS¾Õk_ø¿‚>Úl⡱>‡¾Ü>¿¤JZ>ÚXóŸï&¾Õd·lœŠ>Ê<'§_©z¾¬Úç„çs“¾¸á4«‡ˆ’>Î/¯« ;Õä^5ÃÙ4>ÙÈ÷ _SQ¾ÚT "¿±p>׃ÌxZñ7¾ÑÃaUJ{>ó{çð-¾Š-k%5Š”¾À[õ>ãâ„>ÐÐV¡¾ÕºµeóÁ>ئãkËü¾Øv¨¦ùÃ>Õ>ÔY D‰¾Îè#¿`—ïu»ƒ>ƒ©‡g±=¾Á¾¥L^>ÏÙ¯¥Ø±¡¾Ôï²#=>×Ušs&õ¾Öà?­£á“>ÓªÈnǾÌHÐÇ;§E>¼,ÈŸ >‹º“<ÓùŸ¾Á =Ô› f>ÎÎbK¾Ó¶c‰d>Õúç­k{¾Õ¢•8;e4>ÒÃ.xi†ß¾Ë{Á»¬e(>¼Ç-fù¶>W÷j¥oF¾½N{[¡>ËHJÎ=ɾÒµÍAO>Ô‘ý3]¾Ô¨˜Ù«Ç«>Òf•ÙuÇ’¾Ì/œZA>Àƒg%¼ìN¾™.g«U8ß¾´Åq+´Ãû>Æ“K‰I¾Ð @Ðæ,>Òõ¤¸$CŒ¾Ó¾‹÷¸NÀ>ÒYSó¸Y¾Íír¨va>ÃüLÃáº%¾°Jn“ ¤¾¢µåa±-±>À¯ÃϪÕھʽïLI(>Ðæ§Xø¼¾Ò”ñ\ÍÆ<>ÒDŽH΀;а n`À>È@ŽòŽ '¾¼[¹9f>“†AX¶*9>²vŒ•L<¾ÃË*º¨ÏN>Ì,—ÀÑÐľÐÆB:Yp>ѵœ¶Ñpº¾ÐÓ ñ+€¤>Ì~p¡éXé¾Ä…2ã'~¸>µ*ÉÞ ´z>bTêÙ¦`¾µú!ªbãd>Äv5ÌPK®¾ËÊSdŠ>Ð$¡‚«!6¾ÐÇŽúÙ>ωäuѾÊzE‹;á>ÂêîI~¾³B†–aÁw¾mÇ<ÐaG7>´ÇÌÊ.U€¾Ã4V¨¡ª‚>ÊÉý¶¾Îp/eÅ1>Ïáor œè¾ÎT¡»Í8Í>ÉûþËK\žÃJz¤=»B>µÏ«H¾‡¾‰ý?“ã;¾®Å;‰7m>À3Pßí{š¾Ç%Yœ‚É>Ëlém¾Î+P@ÜÇX>ͳp/­#»¾Ê] ‰/V>Å9ÞO.!¾¼è1Hý>¦èºÏª”>—ëÝÐb²gDºÇ>£}÷OØF¾ÈB J2>ËÂ9 *u´¾ÌᮤbÂ7>Ë’“\kU~¾ÇûJ$2¦j>ÂqËÛ¦ë\¾¶ævä%ôa>œÄ9¸;>¡Ûn7E¾¸%åXôW0> ҔT¶ž¾Çž°ô¬>Ê­Šýs¶¾Ë—³Ñ>ÊSãz†Ÿ¾Ç°< ¸>ÁôšÝOLn¾·MGELÚ>¡^‚´$cQ>™ Ñé˜ë¾´”î›![>ÀšCH…,z¾Å›§Ødœß>ÈôÜjp¾Êm~¯T)>ÉñÂìW›í¾Ç’Ñú0¨ì>ÄvÞï’¾¼0·/” >®ÝD»-6 ¾{$èÏ ‰=¾¨ï[ñ>¸ËÀwîO¾ÁÜ8C¸vÆ>Æ ñõ€¾È¬–áíø$>ÉšÕ× B²¾ÈËö­DIÆ>ÆTÀz˜Ê¹¾Âe¾ÃWPU>ºŽh;B¢c¾­NŒ-¦PÍ>~+8 />¥ÒâDº¾¶ê*lݬÎ>À°39]{¾ÄÔcÕÀÿ>Ç£oŸó¾Èõ¨ë>tƒ>È»²€„J/¾Æþªäþ³,>ÃÞáKÿо¿"[µ{ß>´¶U¦›Oø¾¢:Vlξ!¾‡½}íƒòÿ>­§g¾¹ÈÉà}*Ê>Ák'g¢V¾ÅSåñš>ÇÓcÿƒÑξÈþ›²[ƒª>ÈÈ2ívúw¾Ç7®äIp>Ädb¼Ñ¹•¾Àz_›Ûî>·_\ðˆ3ɾ©z7=öü>qBaÇ>ý>¤ñ7šqJ¾µ‚]l$Ý>¿|.æ~K¾ÃôêK™Iy>Ç2+¥¨Ãî¾ÉO@âqW>Ê3áÆ B2¾ÉÖÏ>¼O‹>È=Ñ pñ¾Å}z>ÁµŽ(¥¢¾º'‹Es ¸>¯3äàÐ瀾ç)ý°)¾çí°sÕ>³o‘xT/¾½Ûùº}Ó>Ã˨%#j¾ÇäööW¡Ù>Ë å;Ÿýð¾Í$.Äб>Î\Œ³€¾ÍÆcÿho(>ÌEÖ'€\¾É™¤1i;Ö>Åׂ:¿²¾Áòô¦º¹>·0PÕU‚¾¥È#z¿¾çÉ‚¥ˆ[>¯ƒêžó+¾½6°KAV>ÅÚWì¯ ¾Ë 6¸/xu>Ð)â…Òm»¾Ò[LJ &\>Ô2ÅU›\¾ÕÄ—Æ\¯>ÕtíYcÒ9¾Õ"¡š-4ó>Ô—e邾ÒF®tã w>Ïx…=ª•q¾Èõmòç÷>ÁÛ™‡¶¾¯ëúÃr¾‘ùÙ“°:>ºÝ_‡>_/¾Éfw]X¸>ÒùÀkˆÄ¾Ùpr 0G>ßúeÌ|оã<–ü³k¾>æf=þKY¾éh½=‚ >ì0ª '­¾î§9—>ðW[Ïö ¾ñ¹J¢—>ñWžù’,r¾ðó†J£µ>î¶C)®²ë¾æ¡ ä >¡Û1Õ:Ú?¡X]ò¯¿,óùg$Ñ?гvœª>¸¡æ/Aa¾é0!0O™>ðþ¡“à¸Å¾òÉHìrU_>óBq1\ľòêEyF˜ù>ñþ k*ut¾ðža`ÔM.>íÂð²[·Q¾é³D_->å0æ@á(›¾à`n»“>ÖÑïìÒéF¾ÉÐpÕ¹^>ªÒ%w|¥Ç>¶rÅõľʩt†øJ>ÓÔÏ“”æ¾ØÀ #ðºb>Ûåâި㶾Ý*uEOˆ>܉ì-ÇDZ¾Úǘ0?š>Ö™ ’4 ¾Ð°ðó†;>ÄÈ“{«ñl¾¬ç>Éêy¾©1uüøA>ÂÇ™^ÚJ¾ÍD†:g>ÒyU^ô†K¾Ô›¥„ûˆ˜>ÔÞ¤ ¥x ¾Ó@â1—>ÏÐÙÐO}d¾ÆR_‘•0l>µÝÉý¹>ƒº/ûFû¾¹ê…à­¤>Ç Ä%É r¾Înì-J¾>Ñ*iD“1ä¾Ñ)Ñ´Uº>ÎfîlLúM¾Ç¾˜7{‚>º%ƒó¾‹6çÇAüó¾³QÅrÃÿ>Ù €¼§¾Ê×#€ÔÕw>Îp Ôˆê¾Íç@H‰¹ã>ÉL¯l!ËÛ¾Á@SKªÂX>«…à° >¡U›Èò*c¾½„¨!eÎÝ>ÆØ‚®ûLÀ¾Ë]3ÇPÐ>Ë›U½½Ý¾Ç„õ¤ÆÒ¦>¿w‡NZ¯¾¥õÛhpc`¾¦*¬²„ô>¿N^®Óþ¾ÆÆct¢Öœ>ʘn_‹^¾È²™_k}>Âÿw•WD¾³ß7ïŸ3¾{bb¸â>¶Ès‹Ik+¾Ã²,"å>È.7Nac€¾Çöos*ÇË>ÿ³ÊòK¾´Ø»MIø¾^§žÕu&>µ‹`hÒ1ó¾Ã!þ„Í‹>Ç8˜9êι¾Æ€rŠt¼0>Àú’³µšb¾¯HÄ3."¾—æe½uçB>º —Ì+Áy¾Ä%Ú¶–zÇ>ÆžÕöô7ݾÃä8·úÐ>¹"+¬C$#¾’µð0't¸¾°Ä¾ÇëGÄ>Á ‹è§m¾ÅƒèDò}¼>ijž+|é¾½Šºï¤·PJ>¦¯jÚÎù¾¾ ØF¸<>ÄsMçaû¾ÄˆGvH¹‡>¾o4—¹N¾§Ù”¸ý±¾£æ 2N ò>¼âvÍŠ¤ê¾ÃìdXî >Ãã{ò‡W¾¼¤w‹Õ¶,>£s,Ó >¨t¦xŽÛó¾¾b‰0ž>ÃÚ_¸é`¾Â¸F“‹w>¸2fÔ2¿¾ŽÂ¹FN¾±“kO'*:>ÀÐ , i¾Ã´r#(sã>ÀŽ}ÏLa)¾°ŸºÊøü]¾“ç¶×ƒ· >¸ðœ‘Fl¾ÂyóÈ¿Ã>Â“à‹§–׸,³ß>°NfʾÀ3H&îù>Âô7 ¾¾ÂSŒ"7>ª—B. À>¡.ŽdÜ~¾»~á&qx>ÂtYÄ Þu¾ÀÅ3•KÇÿ>²‚ã„è m>‡®E¢CŸ¾·S#«)þÏ>Á¬8áF¾ÁX4þj‡>µŒkb¦r¾dC'Õ:U¾´tÉ ªðë>Àüÿûä?¾Ás˜}~#>¶Ø,úZ éÏ@¯Õ¾³¼ñÜAü>À˜jë섾ÁIyh8ê>¶¯–\}þ¾€Œ%µM¾³MoN±”>À‰ÀûiÇY¾Àèqmú3 >µ.ß”†^¾Cìjшì>¾´âa¼i˜§>À¼†êžÕl¾À>‘TnuÁ>²IšV?~>ŠéÑÔýa7¾·•+ïøB>Àÿê«Xc¾¾?õí˜ Ç>«¶ÔfÈB> §0'¶‚Ѿºñ8¸™´œ>ÁÆ—PÏœ¾º 5î[žC>Ÿ™Sv¾·>¬Ð®~¯£¼¾¾Húó¯>Àuþ¹ì†.¾µ o¼/u>)×@þi[ >µt”ï¾ÀV“ñ3,ˆ>½·ìÞØ'ð¾ªÖRÏm#¾¡Ï}Oò0×>»%Ô æôb¾À~Nã®]ú>··&»Í]Õ¾Œr韔«¾²5x¦|ðÓ>¿{Yæ̇F¾¾ wyÝ>­Xk¦>Ÿ7C˾º_ç l>’>À76ŽoOr¾·ˆŠž¤>„ΟNïãC>³Î>ùܾ¿o=Ï›‹ó>¼’Ê7s5¾§šñ׸I®¾¥l 7¤ÌS>»í³<–ÙTex>ƒL{¿e;„¾¶ÒIAµÎ>¿ÂÖÛj ½¾¸µ5b…>”¾Ð;®>°îÖ'˜«]¾¾eÆ¢'‹ì>¼NäŽu¾§g]Ÿˆž5¾¥ÎÎÏa>»Ö‡”~#~¾¾N]²âY>°ý.GÐO0>”½°§÷!̾¸›!°'v>¿ 1qLÁ¼¾µ²ËØѾ.{#Ô–zG>µ d¬™%¾¾áŒ™‰æÉ>¸Çb˧¾‘RÈ'Ög¾±¸B Tè>¾$øÈºí´¾º,©ÐöB>ŸÄ¾¤åíˆ>­7b‡¬e¾½1šÌU>»m€õùö¾¥–˜‰É饾§Þž;œ>»ÿ :;¾¼k¥¨5¦ð>©á¿0€F>£N@îšØ¾º÷=xêI>¼å ·%)¾¬åÖ@hẾ aDwg_ƒ>º!@xÓ `¾½µŸM7ù>®Ã€[Õ>œ¯Óµ•¼¾¹Žå6Ûªj>½!x –ª¾¯•@boF¾šä P‹n:>¹H¿†GÅú¾½!ÚI>¯mcš‡>›P°D†ç¾¹O—ç&>¼ÈÈôâƾ®SÇPeáÀ¾ßŽ£®z>¹RRfþ!¾¼gñª0Xj>¬Ié—*®]>¡9Éià%¾º%c•üê>»ÖÿnsÚ¾©I¦fùl§¾¤rÛÄ÷öù>ºÔñkò»r.Ñèg>¥Iß’C»>¨€;&;¾»’Éu¯i>¹Ú(à,»¾ B%ú€])¾­<Ý´y‘j>¼?gɾ…¾¸?£³÷y>”_Að(ˆ >±;¯·Ûå¾¼µML#dÝ>¶x…/:­¾xÕD Òg>¾³ôößÎ÷>¼Éñ#üdå¾³Qá „^ÿ¾ƒŒ¢Íx~¢>¶Ÿò €¾¼O‘Þ7±“>¯­dÛÊW>›1í«%ä-¾¹ãä*a¸>»&5Ì˾§@Ôžv½j¾¦¹ycˆ{É>ºòˆÝ1¾¸ù’N«øÂ>šØÜ»ÅßE>¯×¦löõ¾¼A}¾øö>µÓ E‘¾s&ðo‘ݾ´35è‚Ê>¼·ÞdǾ‹!¾»¾¬¡µ¯>¨„9¤Æ}9>¥ˆƒW–a6¾º¶º&Ã>¸…Òÿˤ¾˜WõN®¾°ŠÓ;¬Žr>»èKu}£æ¾´fHݧA_¾mJúؤÇ9>µ—<‡„W¾»“Ž²^H>­ŽäÃí°> +쳊E^¾¹hŸ<Çé>¹Rp«Iãs¾Ÿñ9A~Þ¾­îë{`“>»}ÉõÚQ¾µÇ1¾>|>7LŒíê#>´ëêÆG]¾»l“~Ù>­Èì–1hˆ>ŸëUéÐg¯¾¹GSÈ…8Ø>¸ïçÊVSᾜ·«‚Ãƾ¯,k¥ —ç>»jQ^Áã¾³þ©‡bÀ3¾w`Ìlèj>µã ›!þÕ¾ºÚÝÍç˜>©¶°È{‰ó>¤r#Ò¨q¼¾º “—f¸ÿ>·aÃ6—ƒ¾q´l§íE¾²õ¯vù>»\˜Pˆê¾±Ý÷îx¹¾•]™{@>>·øüw×о¹hÁdíôm>¡;ŸZ-BN>¬¶: 7cq¾ºûbý>´(ÑÉÆT)>sEG‹ÉŸH¾µ¯|0š>ºvY'Õ 7¾¨"öˆ­e¾¦#ßbÀ">º'&÷jݾ¶4Ëë.­>€¼g;ú»>³ˆìkÃ_ü¾ºâôz•Û‡>­)Wb ²> Æá¡vðR¾¹2N–Ži#>·‚%î‚P/¾’6bŽçy¾±½7ç·ãg>ºôÍ5›À¾°Kdž4³1¾™Šnï@:>¸U¹èã ¾¸EŸ+—’>˜î¤Ýycæ>°jºhøhÛ¾ºÞ.^Ù¯>±Xà‡Ã6>”Jû,['a¾·³ërm2ˆ>¸¦€öx)¾œÌfÁ_…¾¯=Ù¦¤Y>º¾Ø@"(F¾±Öáx`±t¾‘ºÚ5bQ;>·]ôæȾ¸¾ ב=U>ž‚Hœð>®¶üóæH¾º¦›Õ(Å]>±×æ#‹!%>‘µ+ž¦È‘¾·Wx¡Nýè>¸˜¥¾_ãÙ¾œîÆa<ôª¾¯3ñÓAêc>º˜%RT¾±eŠÿoC»¾” &t>ª$>·™§k2ÒÕ¾¸7ÌHnR¡>™`ÍHp >°MÌnqœç¾º‹‹Säåñ>°‚jEåˆ>˜óAx`¾¸S]ø®>·”uÆ ê¾” CR©uX¾±e)=Åà>ºp•ŸùÖ¾®X*Ü«1¾ŸSÂÑ >¸´bRàÛ ¾¶¡’p)ß>ˆúü«éR>²É0Dgåû¾º0Ýÿà>ª½P”%l>£Ž«kœ¾¹Zû4ãªÎ>µN¶°Ål%¾h`%ïžÊ ¾´]åñt F>¹±û¶IÞᾦ+!|d4$¾¨Az?«>¹èÄ%¼dŸ¾³Šðnñ°¾€2ßÉ»¨>>¶N°ºëL¾¸×㌫rã>  ­¤Ò¯Ö>­c_Oåj¾º:v­*y>±G®Á¸»R>”©›Ó–:B¾·‘ë,ÝY>·‡ƒ<+è¾”PÐüç½¾±WÙbÌk>º+ò¥/«­¾¬÷XKã!ƾ¡$8%>¸á†4NsH¾µ©ä|ãÓã>væ¨ t½>³ë¨Š:Ÿ¾¹š×dy->¦K6ÿðé‘>¨(ÖNM·ú¾¹Ê9µ$öq>³.©ì/Ýë>„R™Ä ã{¾¶ARE >¸i…Э@¾9D–gü¬¾¯ ²`¡—k>º#BXÎþ¾°Jž¬2Ÿ¾šÕí~îlZ>¸+)‘¯¦¾¶‚>' Ò[>ˆPŸÅ*ã…>²ÕuØÇ»¾¹ÉÂv{”ô>¨¡þÌin>¥Òò ”G¾¹|Â(n>³Ú Åì>xsqÀ­gè¾µ±;ã.´z>¸£<×D¹Ø¾  ø¦ÈÄ©¾­ë~þ,ê>º‘çYÇþ°rÙ 8´¾˜íÂøà˜>·ôob¾¶ ‰Ü0>ŠiÀ …">²¦ Aæ(¾¹Á}3§ >¨¸ˆË»ó>¥ÀŒ¿—·¾¹r¯×?QÄ>³¿öïaB>zû4zßú¾µÆ‰tçy>¸LÒï×-¾žÇÌ×#·r¾®€âñÍ•->ºâTéæ¾° ŽPņ%¾›(ÿSj>¸(p%Ç:ò¾¶C&[)ñ>„™äimþ>³,jû³h¾¹–^ÀPT>§^IÕÓ5>§•ýb|Œ¾¹¦vm°ƒ>²ä¦þîs>ˆô'›Yz¾¶ªü´Ûª>·¾áq3¾“Šë1~+¾³…¿ÛÃ>¾„ªÒ gµ?Æ!³7±Õ¿µ×qÚ©;e?©0bh¤/ð¿ƒ9ãÔÝ?(aŽ¶º7¿}Q[õÀ±?W„åKÆ–?`Z˜dF×G¿nœImÓ$Y?qPGÔ,y‘¿oY;¢BA?h0ì䬟ï¿]ÌšØI?FdJí ?2ŽÉ£’* ¿Oú–oÀÊå?V'ÉÃ6s—¿WQøˆMÜô?TWß—F"¿MÆòÕŽ?=5Uû +…¾Ü6¿Ó¼ëÉ¿75in$¿?Cêf1Ö½¿Ggx·=?Fg̳Ö¦¿A¾ 5tH—?5hзÁ~¿:êó%ðA¿"dó_Ù?4‰R‚=¿:ý´v¬a¬?<ÕöÂê÷?*Úi ‰½¿Ó=äÙ>Ü¿µm}‡?lZ¦¿Ûl¿%:>SbÆ©?*Iz.¨e¿*ec=I?%ðooªâ¿_3õY-?R„‰Pc?–-¯qå¿ðš©GÜk?" ¤üþ1’¿$2dŸê4?"*B9 ©¿D‡³D¿?²BåJÈú>æ5î¡û¿mF³6ý°?[.]Å¿úrSQ?*úðT*z¿ r¬È¹? iÉÓg@¾ã¸=á: ¿h8To9?BeóÏ%¿Ó¸ŸÏ=o?÷oÐ'F ¿»´z1ëò? ÚÀÆšŽ[¾÷©¿c³¨Ö±µ,>üÉvÓUp»¿ 5|òï¥?{‰ur¿ÞSºxž¶? ®ý7U™¿ð.$o%>鉇z¿µ'>êÐ^Ùã:´¿t ÌÍf? Õž“¸ÍV¿ Ø•ly1? Ë’bU¿>éä-UÎ>õjWuI>³™ý$ƒ5¾öZ;&ã9u?g_~´¢¿ýðvå?O.æ¥Ñ›¿yŽP]„>úœ¿nðÙk¾àœN vÓ¾ålpÅ–©§>û/¼µ¢Í¿6®ØjÔÕ?]´˜ªwÅ¿Ñ{)!°ï>ýñ]¤Óóû¾ïÍÕ¢ª¾¯dìV¥²>ð½ßJ)¾ýPæú_?Ôõù¿kæ/®ëþ>ÿNäkÂÚq¾ô±Õ5n¢>ÛÙ+|ô°>Ýé“ 5Ò<¾ô.]BJo>ýRu…âh¿hžF:©>þîÞÆ¥¾¾÷ðº©oÎÞ>êWþ^Å"·¾¡„ZrC¾ç‰ý¹™/>õ½@çÑžM¾ûǺ<Ž‘i>ýÎ+Ìà¾ùd6z÷4â>ñª ×=þ¾Ü÷š. Ì,¾ÐE°¡ªì>ì»áZ6ñ¾õü¹=1BA>ùÀØ»‹y¾ù)p\Ì^>ôq¶xþo¾èüsD/¨Ê>Ž;u·Ô>Ü賟1^\¾ïiŒ¶m >õ_Ë‹§7¾÷bçÇ ¬U>õ…2Íá¾ð0­Æ~øE>à»\Ǿ>£‰-‹@ò®¾â} ¸A« >ð%’m1p¾ô>fâ ³Z>ôóTÕAÖ¾ò? ×·9>éRÇnkd¾Ô´în¨?p¾Çš½€’zÎ>äÉäb2J¾ïóÆj&?Ó>òÙr§ho¾ò f¶Œ^>î×õž§ák¾ã¨­†ÿ‚8>ÆnÚïü>ÑüxØ4¾åÍ„)è´Å>îÔÊÉ\ÇϾñ^Âl£h>ð…0³™Õñ¾ê$Ç2¢0é>Þ‹PY‡Q¾±ò1Ä ¡¾ÕªÇâ+0>å島(u|¾íAðÞÂŒ>ïÙ‘„ÛᓾíbçL#Í>æ_9%Mæ4¾Ø –ðFÜ„>Fñ¶=¢>×j#ö[éO¾åYãú¶ùƒ>ëuÕ)vÿ¾í+ÈÈÿ}>êRšG‡·¾ãv¢e¡ôô>Ó~b­“/ª>¤1VÇ›|Š¾×­Tðý>>ä^‰ëSh¾é–Pì eü>êÆ[Ø¥ü»¾ç×Yj´r>áT e1¾ÐžÕèUfR¾¬Œ+0?_>ÖËŠéHh¾ã>Ô³h{>ç¸u·ž%¾è­sù&4ÿ>åä>‹åÐb¾ßºæêu,“>ÎM ´Ä’L>ªóU­°«¾ÕHÊQ»>ᔞ᱄K¾åãù†g²I>æÚ£ª%Ud¾äfx1Mú—>ÝïÕëe¾Í°Ž8)¾¡)æ„âx>Ò}x<óiw¾ßËÕ²æ/c>ä‡÷^¾å?aà)¦÷>ãF†Ð:Ì¾Ý Cqµó>Îù¾‹Z/ù>RUZ˜¿çH¾Î¨ŒPõðø>ÜzÎŽA}¾âD t”— >ãÆÄv<~ò¾âhõŒ`ð>Ü×÷j•R¾ÐßùÇn#q>¥ªxüƒÁd>Ç-;©PÛ‹¾×ù~p7ô>à]rñD ¾âVÆëQŠ5>á®w"âç,¾Ýæº#”>ÒËß(ž¾¸93õ æ¾½>?×Ùœq>ÓkE4Rmš¾ÜšŒháj>àÑ„¦áÓO¾àóØø@£è>ÝvsâñC\¾ÕV×"?P>ßþ0ó 8>¤ls¡Qho¾Ì¶®ZP­k>×ý­™œ¾Þ-ÓŽüç">àE¨Ñù ¾Ý²*O­±\>×Aoš íó¾ËŠ¯q‹éu>¤§ðhèñ>ÁŠ L:±¾ÒÁ#Å趩>Úìk.,Y¾ÝÁ)ÊÝ~»>Ýjü3–IR¾Ù+S8ã”ê>Ñ¥z}ˆо¿¡3Šir•¾¥ÁKHM»î>É¢K.eþS¾Õk_ø¿‚>Úl⡱>‡¾Ü>¿¤JZ>ÚXóŸï&¾Õd·lœŠ>Ê<'§_©z¾¬Úç„çs“¾¸á4«‡ˆ’>Î/¯« ;Õä^5ÃÙ4>ÙÈ÷ _SQ¾ÚT "¿±p>׃ÌxZñ7¾ÑÃaUJ{>ó{çð-¾Š-k%5Š”¾À[õ>ãâ„>ÐÐV¡¾ÕºµeóÁ>ئãkËü¾Øv¨¦ùÃ>Õ>ÔY D‰¾Îè#¿`—ïu»ƒ>ƒ©‡g±=¾Á¾¥L^>ÏÙ¯¥Ø±¡¾Ôï²#=>×Ušs&õ¾Öà?­£á“>ÓªÈnǾÌHÐÇ;§E>¼,ÈŸ >‹º“<ÓùŸ¾Á =Ô› f>ÎÎbK¾Ó¶c‰d>Õúç­k{¾Õ¢•8;e4>ÒÃ.xi†ß¾Ë{Á»¬e(>¼Ç-fù¶>W÷j¥oF¾½N{[¡>ËHJÎ=ɾÒµÍAO>Ô‘ý3]¾Ô¨˜Ù«Ç«>Òf•ÙuÇ’¾Ì/œZA>Àƒg%¼ìN¾™.g«U8ß¾´Åq+´Ãû>Æ“K‰I¾Ð @Ðæ,>Òõ¤¸$CŒ¾Ó¾‹÷¸NÀ>ÒYSó¸Y¾Íír¨va>ÃüLÃáº%¾°Jn“ ¤¾¢µåa±-±>À¯ÃϪÕھʽïLI(>Ðæ§Xø¼¾Ò”ñ\ÍÆ<>ÒDŽH΀;а n`À>È@ŽòŽ '¾¼[¹9f>“†AX¶*9>²vŒ•L<¾ÃË*º¨ÏN>Ì,—ÀÑÐľÐÆB:Yp>ѵœ¶Ñpº¾ÐÓ ñ+€¤>Ì~p¡éXé¾Ä…2ã'~¸>µ*ÉÞ ´z>bTêÙ¦`¾µú!ªbãd>Äv5ÌPK®¾ËÊSdŠ>Ð$¡‚«!6¾ÐÇŽúÙ>ωäuѾÊzE‹;á>ÂêîI~¾³B†–aÁw¾mÇ<ÐaG7>´ÇÌÊ.U€¾Ã4V¨¡ª‚>ÊÉý¶¾Îp/eÅ1>Ïáor œè¾ÎT¡»Í8Í>ÉûþËK\žÃJz¤=»B>µÏ«H¾‡¾‰ý?“ã;¾®Å;‰7m>À3Pßí{š¾Ç%Yœ‚É>Ëlém¾Î+P@ÜÇX>ͳp/­#»¾Ê] ‰/V>Å9ÞO.!¾¼è1Hý>¦èºÏª”>—ëÝÐb²gDºÇ>£}÷OØF¾ÈB J2>ËÂ9 *u´¾ÌᮤbÂ7>Ë’“\kU~¾ÇûJ$2¦j>ÂqËÛ¦ë\¾¶ævä%ôa>œÄ9¸;>¡Ûn7E¾¸%åXôW0> ҔT¶ž¾Çž°ô¬>Ê­Šýs¶¾Ë—³Ñ>ÊSãz†Ÿ¾Ç°< ¸>ÁôšÝOLn¾·MGELÚ>¡^‚´$cQ>™ Ñé˜ë¾´”î›![>ÀšCH…,z¾Å›§Ødœß>ÈôÜjp¾Êm~¯T)>ÉñÂìW›í¾Ç’Ñú0¨ì>ÄvÞï’¾¼0·/” >®ÝD»-6 ¾{$èÏ ‰=¾¨ï[ñ>¸ËÀwîO¾ÁÜ8C¸vÆ>Æ ñõ€¾È¬–áíø$>ÉšÕ× B²¾ÈËö­DIÆ>ÆTÀz˜Ê¹¾Âe¾ÃWPU>ºŽh;B¢c¾­NŒ-¦PÍ>~+8 />¥ÒâDº¾¶ê*lݬÎ>À°39]{¾ÄÔcÕÀÿ>Ç£oŸó¾Èõ¨ë>tƒ>È»²€„J/¾Æþªäþ³,>ÃÞáKÿо¿"[µ{ß>´¶U¦›Oø¾¢:Vlξ!¾‡½}íƒòÿ>­§g¾¹ÈÉà}*Ê>Ák'g¢V¾ÅSåñš>ÇÓcÿƒÑξÈþ›²[ƒª>ÈÈ2ívúw¾Ç7®äIp>Ädb¼Ñ¹•¾Àz_›Ûî>·_\ðˆ3ɾ©z7=öü>qBaÇ>ý>¤ñ7šqJ¾µ‚]l$Ý>¿|.æ~K¾ÃôêK™Iy>Ç2+¥¨Ãî¾ÉO@âqW>Ê3áÆ B2¾ÉÖÏ>¼O‹>È=Ñ pñ¾Å}z>ÁµŽ(¥¢¾º'‹Es ¸>¯3äàÐ瀾ç)ý°)¾çí°sÕ>³o‘xT/¾½Ûùº}Ó>Ã˨%#j¾ÇäööW¡Ù>Ë å;Ÿýð¾Í$.Äб>Î\Œ³€¾ÍÆcÿho(>ÌEÖ'€\¾É™¤1i;Ö>Åׂ:¿²¾Áòô¦º¹>·0PÕU‚¾¥È#z¿¾çÉ‚¥ˆ[>¯ƒêžó+¾½6°KAV>ÅÚWì¯ ¾Ë 6¸/xu>Ð)â…Òm»¾Ò[LJ &\>Ô2ÅU›\¾ÕÄ—Æ\¯>ÕtíYcÒ9¾Õ"¡š-4ó>Ô—e邾ÒF®tã w>Ïx…=ª•q¾Èõmòç÷>ÁÛ™‡¶¾¯ëúÃr¾‘ùÙ“°:>ºÝ_‡>_/¾Éfw]X¸>ÒùÀkˆÄ¾Ùpr 0G>ßúeÌ|оã<–ü³k¾>æf=þKY¾éh½=‚ >ì0ª '­¾î§9—>ðW[Ïö ¾ñ¹J¢—>ñWžù’,r¾ðó†J£µ>î¶C)®²ë¾æ¡ ä >¡Û1Õ:Ú?¡X]ò¯¿,óùg$Ñ?гvœª>¸¡æ/Aa¾é0!0O™>ðþ¡“à¸Å¾òÉHìrU_>óBq1\ľòêEyF˜ù>ñþ k*ut¾ðža`ÔM.>íÂð²[·Q¾é³D_->å0æ@á(›¾à`n»“>ÖÑïìÒéF¾ÉÐpÕ¹^>ªÒ%w|¥Ç>¶rÅõľʩt†øJ>ÓÔÏ“”æ¾ØÀ #ðºb>Ûåâި㶾Ý*uEOˆ>܉ì-ÇDZ¾Úǘ0?š>Ö™ ’4 ¾Ð°ðó†;>ÄÈ“{«ñl¾¬ç>Éêy¾©1uüøA>ÂÇ™^ÚJ¾ÍD†:g>ÒyU^ô†K¾Ô›¥„ûˆ˜>ÔÞ¤ ¥x ¾Ó@â1—>ÏÐÙÐO}d¾ÆR_‘•0l>µÝÉý¹>ƒº/ûFû¾¹ê…à­¤>Ç Ä%É r¾Înì-J¾>Ñ*iD“1ä¾Ñ)Ñ´Uº>ÎfîlLúM¾Ç¾˜7{‚>º%ƒó¾‹6çÇAüó¾³QÅrÃÿ>Ù €¼§¾Ê×#€ÔÕw>Îp Ôˆê¾Íç@H‰¹ã>ÉL¯l!ËÛ¾Á@SKªÂX>«…à° >¡U›Èò*c¾½„¨!eÎÝ>ÆØ‚®ûLÀ¾Ë]3ÇPÐ>Ë›U½½Ý¾Ç„õ¤ÆÒ¦>¿w‡NZ¯¾¥õÛhpc`¾¦*¬²„ô>¿N^®Óþ¾ÆÆct¢Öœ>ʘn_‹^¾È²™_k}>Âÿw•WD¾³ß7ïŸ3¾{bb¸â>¶Ès‹Ik+¾Ã²,"å>È.7Nac€¾Çöos*ÇË>ÿ³ÊòK¾´Ø»MIø¾^§žÕu&>µ‹`hÒ1ó¾Ã!þ„Í‹>Ç8˜9êι¾Æ€rŠt¼0>Àú’³µšb¾¯HÄ3."¾—æe½uçB>º —Ì+Áy¾Ä%Ú¶–zÇ>ÆžÕöô7ݾÃä8·úÐ>¹"+¬C$#¾’µð0't¸¾°Ä¾ÇëGÄ>Á ‹è§m¾ÅƒèDò}¼>ijž+|é¾½Šºï¤·PJ>¦¯jÚÎù¾¾ ØF¸<>ÄsMçaû¾ÄˆGvH¹‡>¾o4—¹N¾§Ù”¸ý±¾£æ 2N ò>¼âvÍŠ¤ê¾ÃìdXî >Ãã{ò‡W¾¼¤w‹Õ¶,>£s,Ó >¨t¦xŽÛó¾¾b‰0ž>ÃÚ_¸é`¾Â¸F“‹w>¸2fÔ2¿¾ŽÂ¹FN¾±“kO'*:>ÀÐ , i¾Ã´r#(sã>ÀŽ}ÏLa)¾°ŸºÊøü]¾“ç¶×ƒ· >¸ðœ‘Fl¾ÂyóÈ¿Ã>Â“à‹§–׸,³ß>°NfʾÀ3H&îù>Âô7 ¾¾ÂSŒ"7>ª—B. À>¡.ŽdÜ~¾»~á&qx>ÂtYÄ Þu¾ÀÅ3•KÇÿ>²‚ã„è m>‡®E¢CŸ¾·S#«)þÏ>Á¬8áF¾ÁX4þj‡>µŒkb¦r¾dC'Õ:U¾´tÉ ªðë>Àüÿûä?¾Ás˜}~#>¶Ø,úZ éÏ@¯Õ¾³¼ñÜAü>À˜jë섾ÁIyh8ê>¶¯–\}þ¾€Œ%µM¾³MoN±”>À‰ÀûiÇY¾Àèqmú3 >µ.ß”†^¾Cìjшì>¾´âa¼i˜§>À¼†êžÕl¾À>‘TnuÁ>²IšV?~>ŠéÑÔýa7¾·•+ïøB>Àÿê«Xc¾¾?õí˜ Ç>«¶ÔfÈB> §0'¶‚Ѿºñ8¸™´œ>ÁÆ—PÏœ¾º 5î[žC>Ÿ™Sv¾·>¬Ð®~¯£¼¾¾Húó¯>Àuþ¹ì†.¾µ o¼/u>)×@þi[ >µt”ï¾ÀV“ñ3,ˆ>½·ìÞØ'ð¾ªÖRÏm#¾¡Ï}Oò0×>»%Ô æôb¾À~Nã®]ú>··&»Í]Õ¾Œr韔«¾²5x¦|ðÓ>¿{Yæ̇F¾¾ wyÝ>­Xk¦>Ÿ7C˾º_ç l>’>À76ŽoOr¾·ˆŠž¤>„ΟNïãC>³Î>ùܾ¿o=Ï›‹ó>¼’Ê7s5¾§šñ׸I®¾¥l 7¤ÌS>»í³<–ÙTex>ƒL{¿e;„¾¶ÒIAµÎ>¿ÂÖÛj ½¾¸µ5b…>”¾Ð;®>°îÖ'˜«]¾¾eÆ¢'‹ì>¼NäŽu¾§g]Ÿˆž5¾¥ÎÎÏa>»Ö‡”~#~¾¾N]²âY>°ý.GÐO0>”½°§÷!̾¸›!°'v>¿ 1qLÁ¼¾µ²ËØѾ.{#Ô–zG>µ d¬™%¾¾áŒ™‰æÉ>¸Çb˧¾‘RÈ'Ög¾±¸B Tè>¾$øÈºí´¾º,©ÐöB>ŸÄ¾¤åíˆ>­7b‡¬e¾½1šÌU>»m€õùö¾¥–˜‰É饾§Þž;œ>»ÿ :;¾¼k¥¨5¦ð>©á¿0€F>£N@îšØ¾º÷=xêI>¼å ·%)¾¬åÖ@hẾ aDwg_ƒ>º!@xÓ `¾½µŸM7ù>®Ã€[Õ>œ¯Óµ•¼¾¹Žå6Ûªj>½!x –ª¾¯•@boF¾šä P‹n:>¹H¿†GÅú¾½!ÚI>¯mcš‡>›P°D†ç¾¹O—ç&>¼ÈÈôâƾ®SÇPeáÀ¾ßŽ£®z>¹RRfþ!¾¼gñª0Xj>¬Ié—*®]>¡9Éià%¾º%c•üê>»ÖÿnsÚ¾©I¦fùl§¾¤rÛÄ÷öù>ºÔñkò»r.Ñèg>¥Iß’C»>¨€;&;¾»’Éu¯i>¹Ú(à,»¾ B%ú€])¾­<Ý´y‘j>¼?gɾ…¾¸?£³÷y>”_Að(ˆ >±;¯·Ûå¾¼µML#dÝ>¶x…/:­¾xÕD Òg>¾³ôößÎ÷>¼Éñ#üdå¾³Qá „^ÿ¾ƒŒ¢Íx~¢>¶Ÿò €¾¼O‘Þ7±“>¯­dÛÊW>›1í«%ä-¾¹ãä*a¸>»&5Ì˾§@Ôžv½j¾¦¹ycˆ{É>ºòˆÝ1¾¸ù’N«øÂ>šØÜ»ÅßE>¯×¦löõ¾¼A}¾øö>µÓ E‘¾s&ðo‘ݾ´35è‚Ê>¼·ÞdǾ‹!¾»¾¬¡µ¯>¨„9¤Æ}9>¥ˆƒW–a6¾º¶º&Ã>¸…Òÿˤ¾˜WõN®¾°ŠÓ;¬Žr>»èKu}£æ¾´fHݧA_¾mJúؤÇ9>µ—<‡„W¾»“Ž²^H>­ŽäÃí°> +쳊E^¾¹hŸ<Çé>¹Rp«Iãs¾Ÿñ9A~Þ¾­îë{`“>»}ÉõÚQ¾µÇ1¾>|>7LŒíê#>´ëêÆG]¾»l“~Ù>­Èì–1hˆ>ŸëUéÐg¯¾¹GSÈ…8Ø>¸ïçÊVSᾜ·«‚Ãƾ¯,k¥ —ç>»jQ^Áã¾³þ©‡bÀ3¾w`Ìlèj>µã ›!þÕ¾ºÚÝÍç˜>©¶°È{‰ó>¤r#Ò¨q¼¾º “—f¸ÿ>·aÃ6—ƒ¾q´l§íE¾²õ¯vù>»\˜Pˆê¾±Ý÷îx¹¾•]™{@>>·øüw×о¹hÁdíôm>¡;ŸZ-BN>¬¶: 7cq¾ºûbý>´(ÑÉÆT)>sEG‹ÉŸH¾µ¯|0š>ºvY'Õ 7¾¨"öˆ­e¾¦#ßbÀ">º'&÷jݾ¶4Ëë.­>€¼g;ú»>³ˆìkÃ_ü¾ºâôz•Û‡>­)Wb ²> Æá¡vðR¾¹2N–Ži#>·‚%î‚P/¾’6bŽçy¾±½7ç·ãg>ºôÍ5›À¾°Kdž4³1¾™Šnï@:>¸U¹èã ¾¸EŸ+—’>˜î¤Ýycæ>°jºhøhÛ¾ºÞ.^Ù¯>±Xà‡Ã6>”Jû,['a¾·³ërm2ˆ>¸¦€öx)¾œÌfÁ_…¾¯=Ù¦¤Y>º¾Ø@"(F¾±Öáx`±t¾‘ºÚ5bQ;>·]ôæȾ¸¾ ב=U>ž‚Hœð>®¶üóæH¾º¦›Õ(Å]>±×æ#‹!%>‘µ+ž¦È‘¾·Wx¡Nýè>¸˜¥¾_ãÙ¾œîÆa<ôª¾¯3ñÓAêc>º˜%RT¾±eŠÿoC»¾” &t>ª$>·™§k2ÒÕ¾¸7ÌHnR¡>™`ÍHp >°MÌnqœç¾º‹‹Säåñ>°‚jEåˆ>˜óAx`¾¸S]ø®>·”uÆ ê¾” CR©uX¾±e)=Åà>ºp•ŸùÖ¾®X*Ü«1¾ŸSÂÑ >¸´bRàÛ ¾¶¡’p)ß>ˆúü«éR>²É0Dgåû¾º0Ýÿà>ª½P”%l>£Ž«kœ¾¹Zû4ãªÎ>µN¶°Ål%¾h`%ïžÊ ¾´]åñt F>¹±û¶IÞᾦ+!|d4$¾¨Az?«>¹èÄ%¼dŸ¾³Šðnñ°¾€2ßÉ»¨>>¶N°ºëL¾¸×㌫rã>  ­¤Ò¯Ö>­c_Oåj¾º:v­*y>±G®Á¸»R>”©›Ó–:B¾·‘ë,ÝY>·‡ƒ<+è¾”PÐüç½¾±WÙbÌk>º+ò¥/«­¾¬÷XKã!ƾ¡$8%>¸á†4NsH¾µ©ä|ãÓã>væ¨ t½>³ë¨Š:Ÿ¾¹š×dy->¦K6ÿðé‘>¨(ÖNM·ú¾¹Ê9µ$öq>³.©ì/Ýë>„R™Ä ã{¾¶ARE >¸i…Э@¾9D–gü¬¾¯ ²`¡—k>º#BXÎþ¾°Jž¬2Ÿ¾šÕí~îlZ>¸+)‘¯¦¾¶‚>' Ò[>ˆPŸÅ*ã…>²ÕuØÇ»¾¹ÉÂv{”ô>¨¡þÌin>¥Òò ”G¾¹|Â(n>³Ú Åì>xsqÀ­gè¾µ±;ã.´z>¸£<×D¹Ø¾  ø¦ÈÄ©¾­ë~þ,ê>º‘çYÇþ°rÙ 8´¾˜íÂøà˜>·ôob¾¶ ‰Ü0>ŠiÀ …">²¦ Aæ(¾¹Á}3§ >¨¸ˆË»ó>¥ÀŒ¿—·¾¹r¯×?QÄ>³¿öïaB>zû4zßú¾µÆ‰tçy>¸LÒï×-¾žÇÌ×#·r¾®€âñÍ•->ºâTéæ¾° ŽPņ%¾›(ÿSj>¸(p%Ç:ò¾¶C&[)ñ>„™äimþ>³,jû³h¾¹–^ÀPT>§^IÕÓ5>§•ýb|Œ¾¹¦vm°ƒ>²ä¦þîs>ˆô'›Yz¾¶ªü´Ûª>·¾áq3¾“Šë1~+¾³…¿ÛÃ>¾„ªÒ gµ?Æ!³7±Õ¿µ×qÚ©;e?©0bh¤/ð¿ƒ9ãÔÝ?(aŽ¶º7¿}Q[õÀ±?W„åKÆ–?`Z˜dF×G¿nœImÓ$Y?qPGÔ,y‘¿oY;¢BA?h0ì䬟ï¿]ÌšØI?FdJí ?2ŽÉ£’* ¿Oú–oÀÊå?V'ÉÃ6s—¿WQøˆMÜô?TWß—F"¿MÆòÕŽ?=5Uû +…¾Ü6¿Ó¼ëÉ¿75in$¿?Cêf1Ö½¿Ggx·=?Fg̳Ö¦¿A¾ 5tH—?5hзÁ~¿:êó%ðA¿"dó_Ù?4‰R‚=¿:ý´v¬a¬?<ÕöÂê÷?*Úi ‰½¿Ó=äÙ>Ü¿µm}‡?lZ¦¿Ûl¿%:>SbÆ©?*Iz.¨e¿*ec=I?%ðooªâ¿_3õY-?R„‰Pc?–-¯qå¿ðš©GÜk?" ¤üþ1’¿$2dŸê4?"*B9 ©¿D‡³D¿?²BåJÈú>æ5î¡û¿mF³6ý°?[.]Å¿úrSQ?*úðT*z¿ r¬È¹? iÉÓg@¾ã¸=á: ¿h8To9?BeóÏ%¿Ó¸ŸÏ=o?÷oÐ'F ¿»´z1ëò? ÚÀÆšŽ[¾÷©¿c³¨Ö±µ,>üÉvÓUp»¿ 5|òï¥?{‰ur¿ÞSºxž¶? ®ý7U™¿ð.$o%>鉇z¿µ'>êÐ^Ùã:´¿t ÌÍf? Õž“¸ÍV¿ Ø•ly1? Ë’bU¿>éä-UÎ>õjWuI>³™ý$ƒ5¾öZ;&ã9u?g_~´¢¿ýðvå?O.æ¥Ñ›¿yŽP]„>úœ¿nðÙk¾àœN vÓ¾ålpÅ–©§>û/¼µ¢Í¿6®ØjÔÕ?]´˜ªwÅ¿Ñ{)!°ï>ýñ]¤Óóû¾ïÍÕ¢ª¾¯dìV¥²>ð½ßJ)¾ýPæú_?Ôõù¿kæ/®ëþ>ÿNäkÂÚq¾ô±Õ5n¢>ÛÙ+|ô°>Ýé“ 5Ò<¾ô.]BJo>ýRu…âh¿hžF:©>þîÞÆ¥¾¾÷ðº©oÎÞ>êWþ^Å"·¾¡„ZrC¾ç‰ý¹™/>õ½@çÑžM¾ûǺ<Ž‘i>ýÎ+Ìà¾ùd6z÷4â>ñª ×=þ¾Ü÷š. Ì,¾ÐE°¡ªì>ì»áZ6ñ¾õü¹=1BA>ùÀØ»‹y¾ù)p\Ì^>ôq¶xþo¾èüsD/¨Ê>Ž;u·Ô>Ü賟1^\¾ïiŒ¶m >õ_Ë‹§7¾÷bçÇ ¬U>õ…2Íá¾ð0­Æ~øE>à»\Ǿ>£‰-‹@ò®¾â} ¸A« >ð%’m1p¾ô>fâ ³Z>ôóTÕAÖ¾ò? ×·9>éRÇnkd¾Ô´în¨?p¾Çš½€’zÎ>äÉäb2J¾ïóÆj&?Ó>òÙr§ho¾ò f¶Œ^>î×õž§ák¾ã¨­†ÿ‚8>ÆnÚïü>ÑüxØ4¾åÍ„)è´Å>îÔÊÉ\ÇϾñ^Âl£h>ð…0³™Õñ¾ê$Ç2¢0é>Þ‹PY‡Q¾±ò1Ä ¡¾ÕªÇâ+0>å島(u|¾íAðÞÂŒ>ïÙ‘„ÛᓾíbçL#Í>æ_9%Mæ4¾Ø –ðFÜ„>Fñ¶=¢>×j#ö[éO¾åYãú¶ùƒ>ëuÕ)vÿ¾í+ÈÈÿ}>êRšG‡·¾ãv¢e¡ôô>Ó~b­“/ª>¤1VÇ›|Š¾×­Tðý>>ä^‰ëSh¾é–Pì eü>êÆ[Ø¥ü»¾ç×Yj´r>áT e1¾ÐžÕèUfR¾¬Œ+0?_>ÖËŠéHh¾ã>Ô³h{>ç¸u·ž%¾è­sù&4ÿ>åä>‹åÐb¾ßºæêu,“>ÎM ´Ä’L>ªóU­°«¾ÕHÊQ»>ᔞ᱄K¾åãù†g²I>æÚ£ª%Ud¾äfx1Mú—>ÝïÕëe¾Í°Ž8)¾¡)æ„âx>Ò}x<óiw¾ßËÕ²æ/c>ä‡÷^¾å?aà)¦÷>ãF†Ð:Ì¾Ý Cqµó>Îù¾‹Z/ù>RUZ˜¿çH¾Î¨ŒPõðø>ÜzÎŽA}¾âD t”— >ãÆÄv<~ò¾âhõŒ`ð>Ü×÷j•R¾ÐßùÇn#q>¥ªxüƒÁd>Ç-;©PÛ‹¾×ù~p7ô>à]rñD ¾âVÆëQŠ5>á®w"âç,¾Ýæº#”>ÒËß(ž¾¸93õ æ¾½>?×Ùœq>ÓkE4Rmš¾ÜšŒháj>àÑ„¦áÓO¾àóØø@£è>ÝvsâñC\¾ÕV×"?P>ßþ0ó 8>¤ls¡Qho¾Ì¶®ZP­k>×ý­™œ¾Þ-ÓŽüç">àE¨Ñù ¾Ý²*O­±\>×Aoš íó¾ËŠ¯q‹éu>¤§ðhèñ>ÁŠ L:±¾ÒÁ#Å趩>Úìk.,Y¾ÝÁ)ÊÝ~»>Ýjü3–IR¾Ù+S8ã”ê>Ñ¥z}ˆо¿¡3Šir•¾¥ÁKHM»î>É¢K.eþS¾Õk_ø¿‚>Úl⡱>‡¾Ü>¿¤JZ>ÚXóŸï&¾Õd·lœŠ>Ê<'§_©z¾¬Úç„çs“¾¸á4«‡ˆ’>Î/¯« ;Õä^5ÃÙ4>ÙÈ÷ _SQ¾ÚT "¿±p>׃ÌxZñ7¾ÑÃaUJ{>ó{çð-¾Š-k%5Š”¾À[õ>ãâ„>ÐÐV¡¾ÕºµeóÁ>ئãkËü¾Øv¨¦ùÃ>Õ>ÔY D‰¾Îè#¿`—ïu»ƒ>ƒ©‡g±=¾Á¾¥L^>ÏÙ¯¥Ø±¡¾Ôï²#=>×Ušs&õ¾Öà?­£á“>ÓªÈnǾÌHÐÇ;§E>¼,ÈŸ >‹º“<ÓùŸ¾Á =Ô› f>ÎÎbK¾Ó¶c‰d>Õúç­k{¾Õ¢•8;e4>ÒÃ.xi†ß¾Ë{Á»¬e(>¼Ç-fù¶>W÷j¥oF¾½N{[¡>ËHJÎ=ɾÒµÍAO>Ô‘ý3]¾Ô¨˜Ù«Ç«>Òf•ÙuÇ’¾Ì/œZA>Àƒg%¼ìN¾™.g«U8ß¾´Åq+´Ãû>Æ“K‰I¾Ð @Ðæ,>Òõ¤¸$CŒ¾Ó¾‹÷¸NÀ>ÒYSó¸Y¾Íír¨va>ÃüLÃáº%¾°Jn“ ¤¾¢µåa±-±>À¯ÃϪÕھʽïLI(>Ðæ§Xø¼¾Ò”ñ\ÍÆ<>ÒDŽH΀;а n`À>È@ŽòŽ '¾¼[¹9f>“†AX¶*9>²vŒ•L<¾ÃË*º¨ÏN>Ì,—ÀÑÐľÐÆB:Yp>ѵœ¶Ñpº¾ÐÓ ñ+€¤>Ì~p¡éXé¾Ä…2ã'~¸>µ*ÉÞ ´z>bTêÙ¦`¾µú!ªbãd>Äv5ÌPK®¾ËÊSdŠ>Ð$¡‚«!6¾ÐÇŽúÙ>ωäuѾÊzE‹;á>ÂêîI~¾³B†–aÁw¾mÇ<ÐaG7>´ÇÌÊ.U€¾Ã4V¨¡ª‚>ÊÉý¶¾Îp/eÅ1>Ïáor œè¾ÎT¡»Í8Í>ÉûþËK\žÃJz¤=»B>µÏ«H¾‡¾‰ý?“ã;¾®Å;‰7m>À3Pßí{š¾Ç%Yœ‚É>Ëlém¾Î+P@ÜÇX>ͳp/­#»¾Ê] ‰/V>Å9ÞO.!¾¼è1Hý>¦èºÏª”>—ëÝÐb²gDºÇ>£}÷OØF¾ÈB J2>ËÂ9 *u´¾ÌᮤbÂ7>Ë’“\kU~¾ÇûJ$2¦j>ÂqËÛ¦ë\¾¶ævä%ôa>œÄ9¸;>¡Ûn7E¾¸%åXôW0> ҔT¶ž¾Çž°ô¬>Ê­Šýs¶¾Ë—³Ñ>ÊSãz†Ÿ¾Ç°< ¸>ÁôšÝOLn¾·MGELÚ>¡^‚´$cQ>™ Ñé˜ë¾´”î›![>ÀšCH…,z¾Å›§Ødœß>ÈôÜjp¾Êm~¯T)>ÉñÂìW›í¾Ç’Ñú0¨ì>ÄvÞï’¾¼0·/” >®ÝD»-6 ¾{$èÏ ‰=¾¨ï[ñ>¸ËÀwîO¾ÁÜ8C¸vÆ>Æ ñõ€¾È¬–áíø$>ÉšÕ× B²¾ÈËö­DIÆ>ÆTÀz˜Ê¹¾Âe¾ÃWPU>ºŽh;B¢c¾­NŒ-¦PÍ>~+8 />¥ÒâDº¾¶ê*lݬÎ>À°39]{¾ÄÔcÕÀÿ>Ç£oŸó¾Èõ¨ë>tƒ>È»²€„J/¾Æþªäþ³,>ÃÞáKÿо¿"[µ{ß>´¶U¦›Oø¾¢:Vlξ!¾‡½}íƒòÿ>­§g¾¹ÈÉà}*Ê>Ák'g¢V¾ÅSåñš>ÇÓcÿƒÑξÈþ›²[ƒª>ÈÈ2ívúw¾Ç7®äIp>Ädb¼Ñ¹•¾Àz_›Ûî>·_\ðˆ3ɾ©z7=öü>qBaÇ>ý>¤ñ7šqJ¾µ‚]l$Ý>¿|.æ~K¾ÃôêK™Iy>Ç2+¥¨Ãî¾ÉO@âqW>Ê3áÆ B2¾ÉÖÏ>¼O‹>È=Ñ pñ¾Å}z>ÁµŽ(¥¢¾º'‹Es ¸>¯3äàÐ瀾ç)ý°)¾çí°sÕ>³o‘xT/¾½Ûùº}Ó>Ã˨%#j¾ÇäööW¡Ù>Ë å;Ÿýð¾Í$.Äб>Î\Œ³€¾ÍÆcÿho(>ÌEÖ'€\¾É™¤1i;Ö>Åׂ:¿²¾Áòô¦º¹>·0PÕU‚¾¥È#z¿¾çÉ‚¥ˆ[>¯ƒêžó+¾½6°KAV>ÅÚWì¯ ¾Ë 6¸/xu>Ð)â…Òm»¾Ò[LJ &\>Ô2ÅU›\¾ÕÄ—Æ\¯>ÕtíYcÒ9¾Õ"¡š-4ó>Ô—e邾ÒF®tã w>Ïx…=ª•q¾Èõmòç÷>ÁÛ™‡¶¾¯ëúÃr¾‘ùÙ“°:>ºÝ_‡>_/¾Éfw]X¸>ÒùÀkˆÄ¾Ùpr 0G>ßúeÌ|оã<–ü³k¾>æf=þKY¾éh½=‚ >ì0ª '­¾î§9—>ðW[Ïö ¾ñ¹J¢—>ñWžù’,r¾ðó†J£µ>î¶C)®²ë¾æ¡ ä >¡Û1Õ:Ú?¡X]ò¯¿,óùg$Ñ?гvœª>¸¡æ/Aa¾é0!0O™>ðþ¡“à¸Å¾òÉHìrU_>óBq1\ľòêEyF˜ù>ñþ k*ut¾ðža`ÔM.>íÂð²[·Q¾é³D_->å0æ@á(›¾à`n»“>ÖÑïìÒéF¾ÉÐpÕ¹^>ªÒ%w|¥Ç>¶rÅõľʩt†øJ>ÓÔÏ“”æ¾ØÀ #ðºb>Ûåâި㶾Ý*uEOˆ>܉ì-ÇDZ¾Úǘ0?š>Ö™ ’4 ¾Ð°ðó†;>ÄÈ“{«ñl¾¬ç>Éêy¾©1uüøA>ÂÇ™^ÚJ¾ÍD†:g>ÒyU^ô†K¾Ô›¥„ûˆ˜>ÔÞ¤ ¥x ¾Ó@â1—>ÏÐÙÐO}d¾ÆR_‘•0l>µÝÉý¹>ƒº/ûFû¾¹ê…à­¤>Ç Ä%É r¾Înì-J¾>Ñ*iD“1ä¾Ñ)Ñ´Uº>ÎfîlLúM¾Ç¾˜7{‚>º%ƒó¾‹6çÇAüó¾³QÅrÃÿ>Ù €¼§¾Ê×#€ÔÕw>Îp Ôˆê¾Íç@H‰¹ã>ÉL¯l!ËÛ¾Á@SKªÂX>«…à° >¡U›Èò*c¾½„¨!eÎÝ>ÆØ‚®ûLÀ¾Ë]3ÇPÐ>Ë›U½½Ý¾Ç„õ¤ÆÒ¦>¿w‡NZ¯¾¥õÛhpc`¾¦*¬²„ô>¿N^®Óþ¾ÆÆct¢Öœ>ʘn_‹^¾È²™_k}>Âÿw•WD¾³ß7ïŸ3¾{bb¸â>¶Ès‹Ik+¾Ã²,"å>È.7Nac€¾Çöos*ÇË>ÿ³ÊòK¾´Ø»MIø¾^§žÕu&>µ‹`hÒ1ó¾Ã!þ„Í‹>Ç8˜9êι¾Æ€rŠt¼0>Àú’³µšb¾¯HÄ3."¾—æe½uçB>º —Ì+Áy¾Ä%Ú¶–zÇ>ÆžÕöô7ݾÃä8·úÐ>¹"+¬C$#¾’µð0't¸¾°Ä¾ÇëGÄ>Á ‹è§m¾ÅƒèDò}¼>ijž+|é¾½Šºï¤·PJ>¦¯jÚÎù¾¾ ØF¸<>ÄsMçaû¾ÄˆGvH¹‡>¾o4—¹N¾§Ù”¸ý±¾£æ 2N ò>¼âvÍŠ¤ê¾ÃìdXî >Ãã{ò‡W¾¼¤w‹Õ¶,>£s,Ó >¨t¦xŽÛó¾¾b‰0ž>ÃÚ_¸é`¾Â¸F“‹w>¸2fÔ2¿¾ŽÂ¹FN¾±“kO'*:>ÀÐ , i¾Ã´r#(sã>ÀŽ}ÏLa)¾°ŸºÊøü]¾“ç¶×ƒ· >¸ðœ‘Fl¾ÂyóÈ¿Ã>Â“à‹§–׸,³ß>°NfʾÀ3H&îù>Âô7 ¾¾ÂSŒ"7>ª—B. À>¡.ŽdÜ~¾»~á&qx>ÂtYÄ Þu¾ÀÅ3•KÇÿ>²‚ã„è m>‡®E¢CŸ¾·S#«)þÏ>Á¬8áF¾ÁX4þj‡>µŒkb¦r¾dC'Õ:U¾´tÉ ªðë>Àüÿûä?¾Ás˜}~#>¶Ø,úZ éÏ@¯Õ¾³¼ñÜAü>À˜jë섾ÁIyh8ê>¶¯–\}þ¾€Œ%µM¾³MoN±”>À‰ÀûiÇY¾Àèqmú3 >µ.ß”†^¾Cìjшì>¾´âa¼i˜§>À¼†êžÕl¾À>‘TnuÁ>²IšV?~>ŠéÑÔýa7¾·•+ïøB>Àÿê«Xc¾¾?õí˜ Ç>«¶ÔfÈB> §0'¶‚Ѿºñ8¸™´œ>ÁÆ—PÏœ¾º 5î[žC>Ÿ™Sv¾·>¬Ð®~¯£¼¾¾Húó¯>Àuþ¹ì†.¾µ o¼/u>)×@þi[ >µt”ï¾ÀV“ñ3,ˆ>½·ìÞØ'ð¾ªÖRÏm#¾¡Ï}Oò0×>»%Ô æôb¾À~Nã®]ú>··&»Í]Õ¾Œr韔«¾²5x¦|ðÓ>¿{Yæ̇F¾¾ wyÝ>­Xk¦>Ÿ7C˾º_ç l>’>À76ŽoOr¾·ˆŠž¤>„ΟNïãC>³Î>ùܾ¿o=Ï›‹ó>¼’Ê7s5¾§šñ׸I®¾¥l 7¤ÌS>»í³<–ÙTex>ƒL{¿e;„¾¶ÒIAµÎ>¿ÂÖÛj ½¾¸µ5b…>”¾Ð;®>°îÖ'˜«]¾¾eÆ¢'‹ì>¼NäŽu¾§g]Ÿˆž5¾¥ÎÎÏa>»Ö‡”~#~¾¾N]²âY>°ý.GÐO0>”½°§÷!̾¸›!°'v>¿ 1qLÁ¼¾µ²ËØѾ.{#Ô–zG>µ d¬™%¾¾áŒ™‰æÉ>¸Çb˧¾‘RÈ'Ög¾±¸B Tè>¾$øÈºí´¾º,©ÐöB>ŸÄ¾¤åíˆ>­7b‡¬e¾½1šÌU>»m€õùö¾¥–˜‰É饾§Þž;œ>»ÿ :;¾¼k¥¨5¦ð>©á¿0€F>£N@îšØ¾º÷=xêI>¼å ·%)¾¬åÖ@hẾ aDwg_ƒ>º!@xÓ `¾½µŸM7ù>®Ã€[Õ>œ¯Óµ•¼¾¹Žå6Ûªj>½!x –ª¾¯•@boF¾šä P‹n:>¹H¿†GÅú¾½!ÚI>¯mcš‡>›P°D†ç¾¹O—ç&>¼ÈÈôâƾ®SÇPeáÀ¾ßŽ£®z>¹RRfþ!¾¼gñª0Xj>¬Ié—*®]>¡9Éià%¾º%c•üê>»ÖÿnsÚ¾©I¦fùl§¾¤rÛÄ÷öù>ºÔñkò»r.Ñèg>¥Iß’C»>¨€;&;¾»’Éu¯i>¹Ú(à,»¾ B%ú€])¾­<Ý´y‘j>¼?gɾ…¾¸?£³÷y>”_Að(ˆ >±;¯·Ûå¾¼µML#dÝ>¶x…/:­¾xÕD Òg>¾³ôößÎ÷>¼Éñ#üdå¾³Qá „^ÿ¾ƒŒ¢Íx~¢>¶Ÿò €¾¼O‘Þ7±“>¯­dÛÊW>›1í«%ä-¾¹ãä*a¸>»&5Ì˾§@Ôžv½j¾¦¹ycˆ{É>ºòˆÝ1¾¸ù’N«øÂ>šØÜ»ÅßE>¯×¦löõ¾¼A}¾øö>µÓ E‘¾s&ðo‘ݾ´35è‚Ê>¼·ÞdǾ‹!¾»¾¬¡µ¯>¨„9¤Æ}9>¥ˆƒW–a6¾º¶º&Ã>¸…Òÿˤ¾˜WõN®¾°ŠÓ;¬Žr>»èKu}£æ¾´fHݧA_¾mJúؤÇ9>µ—<‡„W¾»“Ž²^H>­ŽäÃí°> +쳊E^¾¹hŸ<Çé>¹Rp«Iãs¾Ÿñ9A~Þ¾­îë{`“>»}ÉõÚQ¾µÇ1¾>|>7LŒíê#>´ëêÆG]¾»l“~Ù>­Èì–1hˆ>ŸëUéÐg¯¾¹GSÈ…8Ø>¸ïçÊVSᾜ·«‚Ãƾ¯,k¥ —ç>»jQ^Áã¾³þ©‡bÀ3¾w`Ìlèj>µã ›!þÕ¾ºÚÝÍç˜>©¶°È{‰ó>¤r#Ò¨q¼¾º “—f¸ÿ>·aÃ6—ƒ¾q´l§íE¾²õ¯vù>»\˜Pˆê¾±Ý÷îx¹¾•]™{@>>·øüw×о¹hÁdíôm>¡;ŸZ-BN>¬¶: 7cq¾ºûbý>´(ÑÉÆT)>sEG‹ÉŸH¾µ¯|0š>ºvY'Õ 7¾¨"öˆ­e¾¦#ßbÀ">º'&÷jݾ¶4Ëë.­>€¼g;ú»>³ˆìkÃ_ü¾ºâôz•Û‡>­)Wb ²> Æá¡vðR¾¹2N–Ži#>·‚%î‚P/¾’6bŽçy¾±½7ç·ãg>ºôÍ5›À¾°Kdž4³1¾™Šnï@:>¸U¹èã ¾¸EŸ+—’>˜î¤Ýycæ>°jºhøhÛ¾ºÞ.^Ù¯>±Xà‡Ã6>”Jû,['a¾·³ërm2ˆ>¸¦€öx)¾œÌfÁ_…¾¯=Ù¦¤Y>º¾Ø@"(F¾±Öáx`±t¾‘ºÚ5bQ;>·]ôæȾ¸¾ ב=U>ž‚Hœð>®¶üóæH¾º¦›Õ(Å]>±×æ#‹!%>‘µ+ž¦È‘¾·Wx¡Nýè>¸˜¥¾_ãÙ¾œîÆa<ôª¾¯3ñÓAêc>º˜%RT¾±eŠÿoC»¾” &t>ª$>·™§k2ÒÕ¾¸7ÌHnR¡>™`ÍHp >°MÌnqœç¾º‹‹Säåñ>°‚jEåˆ>˜óAx`¾¸S]ø®>·”uÆ ê¾” CR©uX¾±e)=Åà>ºp•ŸùÖ¾®X*Ü«1¾ŸSÂÑ >¸´bRàÛ ¾¶¡’p)ß>ˆúü«éR>²É0Dgåû¾º0Ýÿà>ª½P”%l>£Ž«kœ¾¹Zû4ãªÎ>µN¶°Ål%¾h`%ïžÊ ¾´]åñt F>¹±û¶IÞᾦ+!|d4$¾¨Az?«>¹èÄ%¼dŸ¾³Šðnñ°¾€2ßÉ»¨>>¶N°ºëL¾¸×㌫rã>  ­¤Ò¯Ö>­c_Oåj¾º:v­*y>±G®Á¸»R>”©›Ó–:B¾·‘ë,ÝY>·‡ƒ<+è¾”PÐüç½¾±WÙbÌk>º+ò¥/«­¾¬÷XKã!ƾ¡$8%>¸á†4NsH¾µ©ä|ãÓã>væ¨ t½>³ë¨Š:Ÿ¾¹š×dy->¦K6ÿðé‘>¨(ÖNM·ú¾¹Ê9µ$öq>³.©ì/Ýë>„R™Ä ã{¾¶ARE >¸i…Э@¾9D–gü¬¾¯ ²`¡—k>º#BXÎþ¾°Jž¬2Ÿ¾šÕí~îlZ>¸+)‘¯¦¾¶‚>' Ò[>ˆPŸÅ*ã…>²ÕuØÇ»¾¹ÉÂv{”ô>¨¡þÌin>¥Òò ”G¾¹|Â(n>³Ú Åì>xsqÀ­gè¾µ±;ã.´z>¸£<×D¹Ø¾  ø¦ÈÄ©¾­ë~þ,ê>º‘çYÇþ°rÙ 8´¾˜íÂøà˜>·ôob¾¶ ‰Ü0>ŠiÀ …">²¦ Aæ(¾¹Á}3§ >¨¸ˆË»ó>¥ÀŒ¿—·¾¹r¯×?QÄ>³¿öïaB>zû4zßú¾µÆ‰tçy>¸LÒï×-¾žÇÌ×#·r¾®€âñÍ•->ºâTéæ¾° ŽPņ%¾›(ÿSj>¸(p%Ç:ò¾¶C&[)ñ>„™äimþ>³,jû³h¾¹–^ÀPT>§^IÕÓ5>§•ýb|Œ¾¹¦vm°ƒ>²ä¦þîs>ˆô'›Yz¾¶ªü´Ûª>·¾áq3¾“Šë1~+¾³…¿ÛÃ>¾„ªÒ gµhealpy-1.8.1/healpy/data/pixel_window_n0016.fits0000650000175000017530000002070011705033043022020 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 65 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 16 / Resolution parameter for HEALPIX MAX-LPOL= 64 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 16 COMMENT for multipoles in range [0, 64] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ðD?ïý}ÕÇ?ï÷)»Ó?ïýŸ`¨ð?ïî$céŶ?ïôy=]ö?ïâA<Í?ïè2|»?ïÓjp²å?ïÙYfÙðî?ïÁ£mòLo?ïǦ$μ?ï¬ðL5—?ï²ÙSN¢Z?ï•UÐM½?ï›;2Ì‚?ïzÙfE‰å?²‘ ?ï]"õR?ïc]çÆyt?ï=SÀ êC?ïC+Kæ2?ïXš˜P?ï +¡Ts?îô—­±=?îúd?Ÿ 6?îÌ”÷ªÆ?îÑßå‰s?î ç„=Å»?(d ?îs Fë1 ?îxÃÔ…Æ?îB<þH?îH@IÿC¶?î~RŒ?€?î'zpc?êøÊ¿nÊ¢?ê£ÂL®?ê¨ã5Ká.?êRÅ ý?êW1;*å?éþ¾¥ÈUð?êÆÿOD?驹/µÄå?鮳ZûÓ¶?éS*†eÊ?éX Ë6d 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð$@?ïÐÃûz2O?ïrô~šMc?ïÐãFL½˜?îçß–òG?ïD~ïùf¼?î1oŽÅýÍ?îŒWE“$?íR%ƒÎÄÓ?íªñ_Þ¾Ò?ìM³Ø" ?ì£Z|Ö5¤?ë%”YWˆ}?ëyXšcÀ?é߯²=.G?ê0…´¼?è‘j½+?è̘Dx?ç ®ÎÓ3x?çSw!˜?傪£¨A?åÈIZó~(?ãï=žxÝ?ä0ç°? T?âT%ý÷<?⑽ü?à¶Çhe?àï…×et?Þ3Tð£Ûô?ÞÇJ€ ’?Û³çtÅ?Ûh®`Ò(healpy-1.8.1/healpy/data/pixel_window_n1024.fits0000650000175000017530000021450011705033043022023 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 4097 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 1024 / Resolution parameter for HEALPIX MAX-LPOL= 4096 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 1024 COMMENT for multipoles in range [0, 4096] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð?ïÿÿ㸠?ïÿÿ¨‰ùÍ?ïÿÿÐF?ïÿÿIŒ ?ïÿÿqH$M?ïÿþ¿R>Ê?ïÿþçUk?ïÿþÏOI?ïÿþ)‹dþ?ïÿýj@"?ïÿý/&T ?ïÿûÇp»2?ïÿûï,Î#?ïÿú:kð?ïÿúaÖ|ô?ïÿøYŒšú?ïÿøH©¨?ïÿö#rï€?ïÿöK.ûp?ïÿóš$7?ïÿóÁà?ïÿðÄÍÅJ?ïÿðì‰Ê?ïÿí°ÉÀë?ïÿíØ…Â]?ïÿêr‘‰?ïÿêšM†€?ïÿç%9ëE?ïÿçLõä—?ïÿãë «˜?ïÿäÉ è?ïÿà쫦?ïÿág—µ?ïÿÞWó;?ïÿÞ¯)j?ïÿÜ^fí?ïÿ܆"Ù ?ïÿØ‘J5w?ïÿع¯?ïÿÔRú¬€?ïÿÔz¶Žs?ïÿÏëa?ïÿÐî‘?ïÿËf'?ïÿ˽f?ïÿÆЃd ?ïÿÆø?59?ïÿÂ:±+?ïÿÂblöú?ïÿ½¶c?ïÿ½ÞÊð?ïÿ¹WC1?ïÿ¹~þÓ£?ïÿ´$ï¾?ïÿ´L«J¼?ïÿ®„; Á?ïÿ®«÷SÂ?ïÿ¨¹>•Ú?ïÿ¨àúAª?ïÿ¢Ë+°ø?ïÿ¢òçUk?ïÿœÂA8Â?ïÿœéüÕ¶?ïÿ–§­08?ïÿ–ÏhÅ—?ïÿ…Çi~?ïÿ­‚÷A?ïÿŠgÊàd?ïÿŠ†f?ïÿƒºØün?ïÿƒâ”zN?ïÿ|ª$›ù?ïÿ|Ñà?ïÿun\ßW?ïÿu–Kv?ïÿn ­ˆ–?ïÿn4hëŠ?ïÿfŠÜ@z?ïÿf²—š?ïÿ^ïY•×.g?ïÿ>þé^?ïÿ6%kÏ?ïÿ6M&=X?ïÿ-KúIŠ?ïÿ-sµ\?ïÿ$OG>‹?ïÿ$wEï?ïÿ4*ˆ‚?ïÿ[å„—?ïÿÿç¸Í?ïÿ'¢©u?ïÿ¸#&˜?ïÿßÞ º?ïþÿ[Å?ïþÿ7fè?ïþõJ[?ïþõ9(K?ïþêæûº:?ïþë¶zU?ïþà“ÂË?ïýuÔp>?ïý–t$?ïý¾,ˆP?ïüó¼ º?ïüóã f?ïüâœÊ¬ ?ïüâÄ‚æ.?ïüÑ7ÿÃ?ïüÑ_·ç?ïü¿¥¨ Ò?ïü¿Í`v?ïü­ç|ù¬?ïü®4òH?ïü›ÿL?ïüœ'ûð?ïü‰ïJx?ïüŠºj?ïüw¸žnt?ïüwàV#É?ïüe^/²=?ïüe…çPÇ?ïüRÁ,ê?ïüRèäqq?ïü?àUÈ?ïü@ qÅ?ïü,ÑÈŸ?ïü,ù€ ?ïü—ôk?ïü¾Ô4Ý?ïü1ú ß?ïüY±5?ïûŽ:z¸s?ïûy[‡Âc?ïûyƒ>;Þ?ïûdyn«b?ïûd¡% ð?ïûOn Ø?ïûO•ÃID?ïû:;v?ïû:b¹¡?ïû$â´÷?ïû% ¾ÅŽ?ïûIÒù:?ïûqˆï?ïúùp…aÎ?ïúù˜;æÓµ?ïõÊf–>]?ïõªóœ-–?ïõ«Kqb?ïõ‹|ÔR‘?ïõ‹¤ƒoK?ïõkÛ’ª÷?ïõlA j?ïõLÞo9?ïõL8=3?ïõ, ƒˆ?ïõ,4º)Â?ïõ ÍÔUb?ïõ õ‚Ó‘?ïôë`;îS?ïôë‡êD=?ïôÊÅ"¶?ïôÊìÐE#?ïô©ýqº?ïôª%¾À?ïô‰ |e?ïô‰1ÁX4?ïôgëþ;l?ïôh«î?ïôF¤+ƒ7?ïôFËÙ ”?ïô%#Àno?ïô%KmÎ3?ïôhyO?ïô&K0?ïóá~Ç ?ïóá¦t›Î?ïó¿g‚3??ïó¿/¯?ïó#ƒÛ†?ïóK0’i?ïóz³¯sH?ïózÛ[ÿi?ïóXìwv?ïóX@˜ØŸ?ïó5T(*§?ïó5{Ô`¤?ïóWD¡Ã?ïó~ð¬N?ïòï #N?ïòïG¯?ïò˺NN?ïòËáùº+?ïò¨&ô»?ïò¨N AË?ïò„fÈ|]?ïò„ŽsÖ©?ïò`zž§?ïò`¢IMW?ïò?ïîyGtˆ«?ïîyoݤ?ïîPZ[?ïîP¾?‚?ïî'4Œ½?ïî'[ª{Ì?ïíýßi-?ïíþèÚ?ïíÔ\ò?ïíÔ„—™2?ïíª­Rêä?ïíªÔø?S?ïí€Ñ?aœ?ïí€øä‚?ïíVÉp]º?ïíVñIþ?ïí,–¢›„?ïí,¾GSb?ïí-ˆi—?ïíU,ìÌ?ïì׌ ?ïì׳²Þå?ï쬼 0±?ïì¬ã®IÍ?ïì¾!bf?ïìåÅF ?ïìV’þ=?ïìVº¡ëÑ#?ïáˆbQáj?ïሉè$º?ïáRÁh„?ïáR©Whî?ïáuM·?ïáœâÅ?ïàæ4l h?ïàæ\†X?ï௽Rä8?ïà¯äè†?ïày©ú?ïày?=ûm?ïàBCïÓ*?ïàBk„‰?ïà B«q/?ïà j?ÛA?ïßÔ^”6?ïßÔ;ò¹Ã?ïßœ¹’ÁÚ?ïßœá&¢«?ïße2пX?ïßeZd[6?ïß-wÏæÐ?ïß-Ÿc={?ïÞõ†ÌØß?ïÞõ®_ê?ïÞ½g<Â?ïÞ½ŽÎÒF?ïÞ…˜›×?ïÞ…A+!q?ïÞLžcª¤?ïÞLÅõê?ïÞöÎN?ïÞ¯Çl?ïÝÛ!Jµ&?ïÝÛHÜg³?ïÝ¢ n­Â?ïÝ¢H†?ïÝhë‚lj?ïÝi‘&?ïÝ/€ÆÁ·?ïÝ/¨WŸ(?ïÜõçR?ïÜöçù?ïܼ &B?ïܼG¶0?ïÜ‚+4…è?ïÜ‚RÄŒ?ïÜH *Ñê?ïÜH0ºð?ïÜ º‡£N?ïÜ âî?ïÛÓ?Ê·ü?ïÛÓgYäþ?ïÛ˜‘'~ø?ïÛ˜¸¶c?ïÛ]¬èº¤?ïÛ]ÔwU¨?ïÛ"šJ>?ïÛ"Á­›ç?ïÚçYB¯¨?ïÚç€Ð·¿?ïÚ«êËá¦?ïÚ¬YŸñ?ïÚpO2¤‹?ïÚpvÀÑ?ïÚ4†õ©?ïÚ4®‚¹´?ïÙø’‘_V?ïÙøº>ï?ïÙ¼jn??ïÙ¼‘û&?ïÙ€ ábV?ïÙ€4m¬H?ïÙC€Ì\?ïÙC¨X€?ïÙÆ£9F?ïÙî.ì¡?ïØÉÞÛé´?ïØÊgQo?ïØŒÉíÿ¾?ïØŒñy ?ïØOˆObd?ïØO¯Ú26?ïØ|æ2?ïØBi½?ï×Ôyo¸?ï×Ô ž¦¼?ï×–¢mý`?ï×–É÷ç›?ï×XDaÚ?ï×XÄÍÿ?ï×jSD?ïב£A?ïÖÜ 'ÙÀ?ïÖÜ0°ÜG?ïÖ{ÏX?ïÖ¢¤„2?ïÖ^ÀWÒ.?ïÖ^çà9$?ïÖÙSs?ïÖ Û2N?ïÕà¾Ûƒ?ïÕàæcM„?ïÕ¡oU°?ïÕ¡–Ü™“?ïÕañM£È?ïÕbÔÐÔ?ïÕ"E3ת?ïÕ"lºµ¦?ïÔâkwÞ?ïÔâ’ý¥’?ïÔ¢d†À?ïÔ¢Œ ÿ9?ïÔb0×z®?ïÔbX]j(?ïÔ!ÐܱÍ?ïÔ!øbQX?ïÓá=“¶$?ïÓáe?ïÓ ug¶?ïÓ œì¡?ïÓ_~½@Ï?ïÓ_¦Aï?ïÓZ8 ?ïÓ…•g?ïÒÝ —?ïÒÝ/$$Ø?ïÒ›ˆ s¼?ïÒ›¯.¨?ïÒYÛ©Êë?ïÒZ-4J?ïÒôÞ„?ïÒ*wö ?ïÑÕ÷þw?ïÑÖ™Ä?ïÑ“¶}žy?ïÑ“ÞÏ?ïÑQGkÑ\?ïÑQníò4?ïѪJ¬Ê?ïÑÑÌzë?ïÐËß‚å˜?ïÐÌ`É?ïЈç€e&?ïЉ/?ïÐE±`â?ïÐEê25Œ?ïÐq‚ƒø?ïЙ ?ïϾíJâ«?ïÏ¿Ëè?ïÏ{4‚×?ïÏ{\°B?ïÏ7MFeâ?ïÏ7tÅê·?ïÎó7ü%:?ïÎó_{U„?ïήõ mü?ïίŠIƒ?ïÎj„Ü^¯?ïÎj¬Zåœ&?ïÂ>D }?ïÁñ—úM-?ïÁñ¿iW ?ïÁ¤åñ¸?ïÁ¥ sœX?ïÁX"r?ïÁX+„mœ?ïÁ õ‰ ?ïÁ öôƒ?ïÀ½¹¸§?ïÀ½á&:?ïÀpQ|F?ïÀpxo§»?ïÀ"»ÄQÖ?ïÀ"ã1õ?ï¿ÔôR#°?ï¿Õ¾Ž;?ￆùOHü?ￇ »R²?ï¿8ÏÿD:?ï¿8÷jìã?ï¾êxºSI?ï¾ê %š«?ï¾›óÙr9?ﾜDX?ï¾MA·Û?ï¾Mi!¢?ï½þb­PÎ?ï½þŠs ?ｯWI°?ｯ~‚ Å?ï½`k¤¢?ï½`@ÕR?ｨN"Þ?ï½Ï·é?ï¼ÁëHë?ï¼Á0Sá?ï¼q;˜D?ï¼qcy*?ï¼!@¬µ×?ï¼!h‡œ?ï»Ñ€w?ï»Ñ?çåP?ﻀÃm?ﻀêÔ˜?ï»0AËØÂ?ï»0i2I?ïºßŽ-÷›?ïºßµ”9ì?ﺎ§@–?ﺎΥÞr?ïº=’bm?ïº=¹xÛ›?ï¹ìNüKš?ï¹ìva_á?﹚ÞOמ?ï¹›´†Ä?ï¹I@d‹š?ï¹IgÈÕh?ï¸÷u‘Ù•?ï¸÷œõ½Ó?︥~/ã$?︥¥“aš?ï¸STëÞÎ?ï¸S|N÷??ï¸øxë?ï¸Ú´?ï·®mÌPÅ?ï·®•.œt?ï·[µ;L|?ï·[Ü1t?ï·ÏÂ?ï·özÉ?ﶵ»ºÝR?ﶵãô1?ï¶b{u%,?ï°ñœ3g?ï°õ ¡?ﯻ@No?ﯻ/˜º¾?ï¯cñi«?ï¯diiÖ?ï¯ ¬_µ~?ï¯ Ó·IL?﮵:{ ¦?﮵aÒ1ß?ï®]›³a=?ï®]à ©?ï®Ð[Lœ?ï®÷±š?ï­­Ó†Èp?ï­­úܨ˜?ï­U£ü¼?ï­UËQ‘c?ï¬ýFY?ï¬ým® ?ﬤºê[?ﬤâ>¨V?ï¬Lý= ?ï¬L)Qfp?ï«óáP?ï«óC5 ?ï«šå'?ï«š08râ?ï«@ÉY??ï«@ð«î??ïªçXi‰Ø?ïªç»÷Ê?華àõ°?ïªÜ2ôS?ïª3ãGðæ?ïª4 ™€?ï©ÙãéØ ?ï©Ú :÷û?ï©·P‚?ï©Þdÿä?ï©%]Ï?ï©%„cW?ï¨ÊÖ5?ï¨Êý„ãå?ï¨p"Èœí?ï¨pJû?ï¨>‹ü?ï¨e_yI?狀&Üa&?狀N*ÝV?ï§^á ²Ë?ï§_?ï§n§EQ?崙ôÞ ?獵Î;© ?獵õˆÐ“?ï¦L©¶a?ï¦L'ökë?ï¥ð=Æ:?ï¥ð-Š Ž?肋ßE „?凜ñk?ï¥7‡"í?ï¥7®d*?ï¤ÚüŒýd?ï¤Û#×è¸?ï¤~DKf?ï¤~kLØ?ï¤!]ÂD?ï¤!… $?ï£ÄJ,”?ï£Äq^½Ù?ï£g G. ?ï£g0Kš?ï£ ›£ú?ï£ Âë¼q?t_?(¼E›?ï¢N6)¶0?ï¢N]qvõ?ï¡ð8›;¼?ï¡ð_â‡Ì?ï¡’ ýÒ?ï¡’4]Ôó?ï¡3³äÁø?ï¡3Û+#ò?ï Õ-McŒ?ï ÕT“P&?ï vy™“?ï v ß ?ï ™M?ï ÀXNI?Œ£ð?³J/?ïŸYMó^?ïŸYu7rë?ïžùݸ­?ïžúüK‚?ïžš?’¥?ïžšfÕ;R?ïž:sÅtþ?ïž:›%¸?ïÚz™Äj?ïÚ¡Ûý÷?ïzTWÖx?ïz{™˜¡?ïHR?ï(‰œ ?³²ï?¨ô…«?ïœXÑ2f?ïœXøra?ï›÷î£T.?ï›øã6?ï›–Þ1Ä?ï›—púœ?ï›5 "Ô ?ï›5ÇaŹ?ïšÔ4¼l8?ïšÔ[úäY?ïšrœEHQ?ïšrÃGC?ïš×`è?ïšþBæs?ï™®åCäí? €ðÙ?ï™L¬Ð?ï™Léè¨á?ï˜ên"¿G?ï˜ê•^×??ëÀ›z?ü9 ?ï˜%;Èö]?ï˜%cy?ï—Â^‚$?ï—Â…¼Ä|?ï—_T0Á$?ï—_{jî‚?ï–üþ?ï–üDT´)?ï–˜¹ˆÇx?ï–˜àÁþ:?ï–5%6Æ×?ï–5Loô?ï•Ñ_ >B?ï•Ñ†E}z?ï•mk+Ž?ï•m’Lîª?ï• Iêô?ï• pÇ1º?úÂÈò?!ù“*?ï”@~òä?ï”@¦(aW?ï“ÛÖcù?ï“Ûý˜ån?ï“wZM‚?ï“w( Ã?ï“ûªÑ?ï“"Þæ¡?ï’¬Äæ?ï‡R¿}„?ï†çuÔý`?ï†çœú·Û?ï†|Þ¬¸¼?ï†}ÑîÜ?ï†51q?ï†>Yâú?ï…§iF?ï…§E<û?ï…;øn”?ï…<%ë8?ïf«bë5?ïf«>`ž¡?ïf3røá2?ïf3™ö?ïe»ž‡m?ïe»Å~?ïeCœ ¨?ïeCà µ?ïdËmÓX?ïdË“ÿ3)?ïdS:ÜÀ?ïdS85§?ïcÚˆçÁê?ïcÚ¯áö?ïcaÔBG”?ïcaû;æf?ïbèóƒâ?ïbé|êÒ?ïboãN‘“?ïbp Gù?ïaö¢¼V8?ïaöÉ´2?ïa}5w,?ïa}[þ¼;?ïašeÂ,?ïaÁ\p—Û?ï[¾w.º}?ï[B™· ?ï[B¿þ@?ïZƲ’Pè?ïZÆÙ@?ïZJ›êpD?ïZJÂØÅZ?ïYÎX9en?ïYÎ' 7?ïYQç´e:?ïYR¡…~?ïXÕJ†¤?ïXÕq} ,?ïXX´†?ïXX§ïŸ?ïWÛ‹B¤4?ïWÛ²-óŸ?ïW^i„è=?ïW^oœG?ïVán³?ïVá?z‡"?ïVc—‡~?ïVc¾pú¶?ïUåéƒÆð?ïUæl§z?ïUh¸’?ïUh5 IÕ?ïTêYÌž?ïTê.Atc?ïTkÓ¡H?ïTkú„¬Y?ïSís¸bd?ïS횞Љ?ïSnçà?ïSoÅß?ïRð,æw‹?ïRðSË«0?ïRqAð÷?ïRqhÕ?ïQò*  ú?ïQòPð™7?ïQrånÝö?ïQs R8,?ïPótJ.ð?ïPó›,êæ?ïPsÖÒÎü?ïPsý´ì|?ïOô =ìa?ïOô4k5?ïOt¿]‘?ïOt> =?ïNóó4½h?ïNôþ:?ïNsžÆŒÃ?ïNsŦ.’J%‡ÿ?ï>’pñq?ï> T~$?ï> {Ig3?ï=†2/¢H?ï=†Xú>å?ï<ÿãiòN?ï= 3è%?ï[?ï;kî6Üã?ï;lþÝ"?ï:äï~’/?ï:åEêÍ?ï:]Â&S?ï:]èì´?ï9Öeaš?ï9ÖŒ'J?ï9NÜ ð?ï9OÈjT?ï8Ç&zã?ï!å³xºú?ï!åÚ! ˜?ï!V~ÄFZ?ï!V¥kã'?ï Ǧ¸?ï ÇEM¢Ú?ï 7j¡8?ï 7·Ù¼?ï§ÓQUT?ï§ùöÛ\?ïéúª†?ïŸ}Ü?ï‡Ô“5€?ï‡û7Uî?ï÷“G†>?ï÷¹êóŒ?ïg&D²?ïgLçl?ïÖ¸˜.?ïÖ´Zžš?ïEÉÐ#?ïEðqRÍ?ï´×Þj ?ï´þ P?ï#·(-–?ï#ÝÈ?ï’jD&š?ï’ã\©?ïñ^šÎ?ïý:?ïoL¤ Ä?ïosAÚW?ïÝ|@—H?ïݢݮÍ?ïK€aZ”?ïK¦ý¼Ô?ï¹Y31z?ï¹ÎÞ>?ï'Rä?ï'*¬Iõ?Bak?ܢŽ?ïÐVG?ïöïŒE?ïnôw¡¨?ïovL?ïÛìÒï?ïÜk )?ïH¹”8¾?ïHà+ ?ïµZç„?ïµ~4^?ï!Ðùy3?ï!÷rL?ïŽ.P‡?ïŽ?Ã’4?ïú2ÍÀ‡?ïúYbJŽ?ïf _ñM?ïfFóÃv?ïÑâ¡Ð?ïÒ¢»æ?ï=xRä?ï=žš´±?ï¨âu~@?ï© '?ï!‚úð?ïHëˆ?ï5\Ûô?ï[í ?ï ênâ+?ï êAþ`´?ï TÓ Õ?ï Tù’Îÿ?ï ¿^œ9.?ï ¿…*DÅ?ï )¾a‚6?ï )äîÔ?ï “ò|Þ?ï ” ¨?ï ýû Ñ2?ï þ!¬®Æ?ï gØp¤Z?ï gþûÇ?ï ÑŠšû?ï ѱ%c˜?ï ;ã#?ï ;5Í?ï¤e'`Ê?喇°S_?ï N¦Î?ï µÖÞ?ïv³=Ö?ïv´:¹ž?ïß`Œ.?ï߇L??ïHÞ´ ?ïH.d¸B?ï°ƒúɬ?ï°ª€«?ïÔÿ@Ã?ïûƒÌj?ï€øhm”?ïì<©?ïèí„]à?ïép+?ïP¶Äi?ïPÝF¾X?ï¸TR•G?ï¸zÔ-X?ïÆWûú?ïìØÖ?ï‡ ÿ3?ï‡3P?ïî(rÈø?ïîNò(?ïUܾï?ïU?[`?îÿ»ÛÁˆê?îÿ¼?kº?îÿ"pqV3?îÿ"–îz‚?îþˆÙVÈ?îþˆÿÒla?îýï˜Ù?îýï=€óT8?îìØeYš?îì9…N÷`?îì9«´ ª?îëšÖQ_?îëšÄ;5Z?îêûŠ×¹®?îêû±;Ø"?îê\Lzl ?îê\rÝÄÂ?îé¼âæP?îé½ H§?îéNB¯)?îét¤{É?îè}Ž¸L?j?îÌ`"|\_?î˸•™ÑG?î˸»×`?îË&Ü?îË*b‹â?îÊiH8è?îÊinCå§?îÉÁaf÷?îÉÁ‡ ð:?îÉPe8¨?îÉvŸD;?îÈqغ?îÈq9@e?îÇȨ!Ͳ?îÇÈÎZ7Ò«/v?î¬>øÁg&?î«Y=¼3?î«Sÿ?îªßµn?é?îªßÛ‚Ã?îª/ç`@Ø?îª0 sê@?î©ï6üZ?î©€IËA?î¨ÏÍ)ë?î¨Ïó(?î¨~ô°}?ÉÄ?î§o?WÚ?î§o*O•ý?^õš.?…üú?î¦ :Ú?î¦ µH—?î¥\•/vø?î¥\»="w?pø—Ó?—g\?î£ú"¸ê~?î£úHÄÝÝ?î£Hª“K¦?î£HОb¨?„\×?,Ž—E?î¡å5ûk?î¡å\w ?î¡3:ñ ?î¡3`ù†¯?î ˆSŸ?î ;÷ ?îŸÎÅãÅ°?îŸÎëê‹´?îŸL% +?îŸr+ˆ’?îži¨pÕ?îžiÎuߧ?î¶Úè_Þ?î·ìŒn?îáŽ4ø?L?îœP»Ò¡N?îœPáÕ/?î›kªZ’?«ëÌ?îšéñ6ôò?îšê7§O?îš6Lš±?îš6rš„`?}÷½d?£ö±l?î˜Î…p½þ?î˜Î«nÒ?î˜c(œ?%C?î—f%…=?î—f;!Ú=?î–±šÚò)?î–±ÀÖg?î•üö7YÄ?î•ý1î\?î•H'\©*?î•HMV]>?.l3ì?TeI?î“Þ ‡ø4?î“Þ1ê¦?î“(¾Òƒ.?î“(äÉ”?î’sHmãÔ?î’sndÔ?¦g3]?Ì\Ô?î‘Ø1õ¢?î‘þ&bY?îQß·ÉT?îR«T?æü?î›ã •?îŽåpzJ_?îŽå–lœ?îŽ.ùú!?îŽ/ë¹?îxY»&–?îx«'}?îŒÁß¾”?îŒÁµÎÜ‚?îŒ šz3.?îŒ Àhmî?î‹Sxÿf“?î‹Sžì½î?-TCº?S@·{?î‰ä·™k}?î‰äÝ„ûp?î‰-ð @?î‰-=Ú·2?îˆuNyÁä?îˆutc‰Ÿ?[W|=?@_?î‡>«7¶?î‡d“6k?î†LöÄ?î†Mt™¦?î…”‚sˆZ $?î>èÞ}?¿Ù@?å¹+ý?îÊùÈY7?î˧^l?î ¯¸;?î/ÖŽ?î~Vï°ž?î~WFÜ?î}œ«é¯¨?î}œÑÅÿ?î|â>}‹ð?î|âdXôg?î|'§ŒP@?î|'ÍfÑ?î{lç7J?î{m °-?îz±û C?îz²!x³ ?îyöä@uá?îy÷ >Y?îy;¢îl6?îy;ÈÅL*?îx€7ÉNb?îx€]ŸEž?îwÄ¢òÜ?îwÄÈÇ,?îw䈪¾?îw \Ïï?îvLü­gC?îvM"€£ ?îuëfÀ?îu‘S¹?îtÔ¯,e'?îtÔÔýÍÂ?îtG(x¡?îtlø÷J?îs[µFÁõ?îs[ÛVx?îržù¦Îˆ?îrŸux°?îqâh~¿?îqâ:6>Y?îq%¬lˆ?îq%+yAb?îpgÍ’P?îpgó^:?îoªl:Æ?îoª’€ƒ?înìßÒ\`?îníœoÀ?în/'Õ>ô?în/MžfÁ?îmqF€?îmqk×X…?îl³:ŸŒn?îl³`fÜx?îkõ¦^R?îkõ+lÂ.?îk6§Cë?îk6Íxe?îjx•Í½?îjxEZX¡?îi¹n¾Š™?îi¹”‚(µ?îhú’ïù?îhú¸±Ð?îh;‹¤Çœ?îh;±f‹†?îg|Z¦Ú?îg|€g°”?îf½ù©?îf½%Óâ‘?îeý| JÐ?îeý¡ËEê?îe=ίh?îe=ôm?îd}øšn?îd~عP?îc½øqÉ‹?îc¾-ú?îbýÍèµ°?îbýó£÷?îb=wþI?îb=¸ãS?îa|øvø?îa}/jú?î`¼Onª?î`¼u&ˆr?î_û}‚j?î_û¢½Å?î_:[ìÂ?î_:§‚{?î^y\Œ?î^y‚F1ç?î]¸Âkü?î]¸4w!Ú?î\ö–-Öˆ?î\ö»áœ)?î\4òR°?î\5rà?î[s$îë?î[sJŸôu?îZ±.1Ž?îZ±SÐ%??îYï ”?îYï3µ :?îY,ľ*D?îY,êm;ª?îXjRiÒ~?îXjxòr?îW§·'X?îW§ÜÔE§?îVäñ6…?îVåâÁw?îV">è?îV"%ĉM?îU^åˆÓ?îU_ 3+)?îT›¡£%Ò?îT›ÇL‹}?îSØ4†þ?îSØZ/q’?îSžSY_?îSÃúÙ„?îRPß&>¸?îRQÌËÍ?îQŒ÷_?îQÄøÔ?îPÈ䃔?îPÉ (:n?îP¦Õg?îPÌy-?îO@?Éq®?îO@el0}?îN{¯~ä?îN{Õè ?îM¶öx(?îM·²N?îLò¢ ¨?îLò9Aì¤?îL-NJ.?îL--í7~?îKgÔ4–n?îKgùÒŽà?îJ¢uŸE`?îJ¢›þ|'V?î>þ¡‘¶p?î>6‡”iÍ?î>6­"?î=nhb*+?î=nîÈ}?î<¦ }?î<¦E #0?î;ݮȴ„?î;ÝÔSa@?î;œ!Ç?î;:%Õl?î:LQ¬bj?î:Lw5Å?î9ƒf-²?î9ƒ‹žî’?î8ºQúm?î8ºw46?î7ñ­­}?î7ñ93zË?î7'ª¸…+?î7'Ð=Xb?î6^½Ù¾?î6^>A²©?î5”]Û7^?î5”ƒ^Ì?î4Êz-Ì7?î4ÊŸ¯¯õ?î4mÒ€Ù?î4“Siµ?î368çF?î36^g3Ê?î2kÛ‰'?î2lq¦?î1¡T42?î1¡y“+5?î0Ö¢î?î0ÖÇéU?î0 Ç!Ö–?î0 ìÖ?î/@Ã^ö¡?î/@èÙùû?î.u–ç?î.u¼a0?î-ªA×Ib?î-ªgPSù?î,ÞÄLó€?î,ÞéÅj?î,dîï?î,CÛÿù?î+GN€%¨?î+Gsö9Ÿ?î*{T((?î*{y>Ä?î)¯0øÑ?î)¯Vl+?î(âå °}?î(ã Ì?î(pÿ?î(•ô´?î'IÓuZ¸?î'IøæzM?î&}Ã’?î&}3säã?î%° IÝ ?î%°E¸ÿä?î$ã­3œ?î$ã.WÌ?î$Ƹ\(?î$ì%z?î#H\ûÀ?î#Hn"?î"zȦw?î"zîþ?î!­ Âb?î!­2,‰”?î ß(r Û?î ßMÛ3¸?î Ò–:?î A:¾=?îB瀋?îC g¨?îtˆdÓ:?ît­Êúï?î¥ÿ‹ß6?î¦$ñv?î×Nƒì?î×slª…?îsöxb?î™Yž"?î9qr¡ì?î9–ÔÆ ?îjF˜¸·?îjkùÜ-?îšó…F^?î›åhd?îËxTì&?îË´ ‹?îûÓu9±?îûøÓX@?î,s!X?î,)Ð=Ý?î\ Ý™r?î\29³»?î‹ìДP?îŒ+¬+?gÖd?î»ÉÁëž?îë3¿;œ?îëYN?îšó´*?îÀKÃŽ?îIÚ À?îIÿw̺?îxï¸#š?îy,^?î§ÛHkÝ?î¨q?îÖž\nZ?îÖðo¯?î9 ‘?î^bå?î3«~/?î3ÐÐ(#?î aõÃx:?î bló?î û‘Â?î =Kã?î ¾Bcz?î ¾7‘NÑ?î ëã ©?î ì[r?î ‰í-}?î ¯:¦?î Gg°6?î G-³‹ü?ît^˜B8?îtƒãi?î¡Œš×?ä§é?îÎ’‹5ø?îηÔi?îûp„mÞ?îû•Ì2$?î(&¢¶?î(Késþ?îT³_̧?îTØ¥„?îL-@?î;ÝØ?î­Pêé„?î­v.“'?îÙcWc¬?îÙˆš'?îM¬Œl?îrî'Ž?î1d?î15F›û?íÿ\ªNw?íÿ\ϾÚR?íþˆ3d…?íþˆBqès?íý³f É?íý³‹ÞDë?íüÞ†YÏ?íüÞ«•tG?íü }Û K?íü £‹=?íû4MBø?íû4r|r2?íú^ô©'o?íú_‾?íù‰t+ „?íù‰™cp¸?íø³Ëã}Ø?íø³ñÄ¿?í÷Ýûí”L?í÷Þ!#ѵ?í÷Ë9?í÷(Kð?íö1àªð?íö2BÔÃ?íõ[•48?íõ[ºgXL?íô…"Uî*?íô…Gˆ?íó®‡V?íó®¬À$O?íò×Äú­>?íò×ê*­‹?íòÚ³¼?íòÿâ -?íñ)ÈÓ¶%?íñ)î ˆ?íðRâwo?íðR³V‘?íï{)r¦ô?íï{Nžz¡?íü_0?íî£Â''7?ííËèšvp?ííÌ Ä2Ÿ?íìô fú€?íìô1ª¦?íì|Ôÿ?íì-¤xë?íëCÜöØ?íëDoˆ?íêk‰ï’7?íêk¯?íé“ ñ.V?íé“3¬j?íèºhQ?í躳Â?íçá›@ãP?íçáÀcG-?íç¦- ?íçË>ƒ€?íæ/‰?ÎX?íæ/®`7?íåVDÂ÷b?íåViâ2x?íä|ØÁZk?íä|ý߇‡?íã£EUfd?íã£jr…V?íâɉ w?íâÉ®(® ?íáï£}Q±?íáïȘSµ?íá–°Â?íá»1¤?íà;`õºI?íà;†ž—?íßa1ì?íßa)IW?íÞ†åœ2?íÞ†¤üb?íÝ«Ô+׫?íÝ«ùAù?íÜÑðÄ?íÜÑ&3—[?íÛöP:¤?íÛö*cÑQ?íÛàV• ?íÛi˜?íÚ?“Ÿ?íÚ?¸°vX?íÙdCH?íÙdDS­Û?í؈ƒ\Ë?í؈¨l ?í׬À?k?í׬僙?íÖÐÕY¬@?íÖÐúfß\?íÕôÃpÀ?íÕôè|áö?íÕˆàÿ.?íÕ­ì?íÔ<%B—‘?íÔ?íÎ1ëÜ>?íÎ1>îYü?íÍSxn=÷?íÍSo¨‚?íÌu¯cœà?íÌuÔcô?íË—¾å ¼?íË—ãäNL?íʹ§ W\?íÊ¹Ì ‡&?íÉÛgòú`?íÉÛŒð3?íÈý²~Z?íÈý&®†?íÈtdÖ?íÈ™_Ég?íÇ?¾¦-A?íÇ?ã  ?íÆ`à¯M?íÆa yW?íÅÚß°?íÅþþ”Ì?íÄ¢¬¡´)?íĢјT&?íÃÃWúŠ?íÃÃ|ðÈ?íÂãÜ*¼?íÂä1E?íÂ9K·6?íÂ^?±?íÁ$ov»y?íÁ$”i?íÀD}L–?íÀD¢=É¥?í¿dbg¸?í¿d‡WÕÐ?í¾„ 'ö?í¾„E&À?í½£¶£åÂ?í½£Û‘Õä?í¼Ã%÷ R?í¼ÃJãäœ?í»ân9OÚ?í»â“%?í»„Å?í»´o,Ì?íº ‰ñÃÈ?íº ®ÛWf?í¹?\$©G?í¹? %I?í¸^¹¸ê?í¸^*¡?í·|ˆ ¤?í·|¬òTÚ?í¶šã4?í¶›7?íµ¹Jö”?íµ¹?í“ÃŒÈ0Ú?í’Û¦:x?í’ÛË: N?í‘ó¾_Âø?í‘óãsÙ?í‘ ¯ÁR`?í‘ Ôwã?í#z¾e8?í#ŸsÕž?í;o6É?í;D#†©?íŽRœ‹¹?íŽRÁ>èA?íiñ¶ ¢?íjhä?íŒ 5äê?íŒDæÒ?틘("‡ ?틘LÒRì?튯 “͈?튯.Bwó?í‰ÅÄ¡á,?í‰ÅéOiï?íˆÜYcà,?íˆÜ~G?í‡òÇò'9?í‡òìl ?í‡ vë?í‡ 3²™›?í†.IQ“?í†RòQÛ?í…5&ù–ø?í…5K¡t§?í„Jù0•j?í„K×PP?íƒ`¥Z»?íƒ`ɪò©?í‚v*á ?í‚vO4UÒ?틉繨?í‹®‹ ?퀠Ã$Á{?퀠çÆïe?íµÕð?íµù¦ú4?í~Ê¿.Þs?í~ÊãÎľ?í}ß‚àç ?í}ߧ©??í|ô 3g@?í|ôDÑ*?í|—=Þ?í|»Ú P?í{èÜç?í{ ²1³?íz1ÖÅ”?íz17põŠ?íyE”¼’?íyE<-ǃ?íxXõ{?íxYªô5?íwlªöT„?íwlÏ×?ív€:|ä™?ív€_U?íu“£½do?íu“ÈQÙe?ít¦æÏc?ít§ b²?ísºÊ0?ísº(\0 ?írÌúĆÔ?írÍU‰[?íqßËÖ:¨?íqßðf¬?ípòuÄÐQ?ípòšS… ?ípø5hU?ípÂöÀ?íoTcnÔ?íoxïÖ*?ín)ŠeÔ,?ín)®ñ>?ím;šSH¬?ím;¾ÝaK?ílM„C(î?ílM¨Ìê?ík_HLV]?ík_lÔ‰?íjpæ…Ôì?íjq v?íi‚]¸Ï?íi‚‚=úÉ?íh“­‹¢?íh“ÒS;?íg¤×5 ?íg¤û¸2#?ífµÚÍ—–?ífµÿO–Ý?íeƸkjX?íeÆÜì@°?íd×p$îD?íd×”¤›}?ícèu?ícè&øï?íbønH:?íbø’Åj©?íb³”'è?íbØXª?íaÑ”Ä?íaö›©?í`(É™í?í`(îùÅ?í_8› v?í_8À¾?í^HGÀAÿ?í^Hl7Ê0?í]WÎuº?í]WòÓR?í\g.¿/²?í\gS4b?í[viÈhR?í[vŽêt?íTÜÕƨ?íTÜùsœ‡?íSêߺ½€?íSë%fî?íRøÃ¼Ì ?íRøè&HØ?íR€·@?íR¥?íQØÐú@øµ´?í>úeI^Ë?í>äðê?í> @b}?í=c³É?í=ˆ­?í<¼üö?í<àjƒ?í;#í×½å?í;$#£9?í:-ú Žr?í:.UB_?í97àË ž?í98¢ö?í8A¢/kè?í8AÆw¼|?í7K>L݃?í7Kb“ü%?í6Tµ9`ó?í6TÙMu?í5^ '?í5^+OáE?í4g2 ?í4gV㈼?í3p7¤„a?í3p[æÙi?í2y<„?í2y;}¦¼?í1Ñ},@?í1õ½b?í0Šf|I0?í0ŠŠ»?í/’ÖOWÄ?í/’úŒàF?í.›! ,?í.›EH?í-£FÈnž?í-£kÉ?í,«Feœ?í,«jžñÔ?í+³l€?í+³CÈ%–?í*ºÓh‡„?í*º÷  J?í)Âb}b?í)†;Í©?í(ÉË{§¸?í(Éï°ÃR?í'Ñà0?í'Ñ4eð?í&Ø/IÓg?í&ØS|…?í%ß)ÌýÁ?í%ßMþzB?í$åþN?í$æ"~J0?í#ì¬{6 ?í#ìЪG“?í"ó5r/@?í"óY  ?í!ù™H&%?í!ù½tË÷?í ÿØ•ú?í ÿü>¬?í ñæ»Â?í õ'?í æÚÈ?í ±?í·Ûã?íÛ)¨#?íaDê4¦Ø?ìÕ4p¤Ö?ìÕ4“Ò÷?ìÔ/ ƒæ§?ìÔ/ÄOõ?ìÓ*¬äi?ìÓ*Я3h?ìÒ%•;ü?ìÒ%¹‰.?ìÑ Y›`ä?ìÑ }c¢¶?ìÐú\&?ìÐàYl?ìÏvÈnø?ìÏšŽ'„?ìÎϼÌä?ìÎó@‹?ìÍ øJ(?ìÍ '»x»?ìÌ1ÉA?ìÌ6ó²“?ìÊýþj9´?ìÊþ"*ݘ?ìÉ÷ŵ*l?ìÉ÷étˆ¶?ìÈñi&4?ìÈñŒäL–?ìÇêèÑ?ìÇë î“?ìÆäDÉ|ø?ìÆäh… h?ìÅÝ}"ص?ìÅÝ ÝÙ?ìÄÖáî¯?ìÄÖ´šîZ?ìÃϾv?ìÃÏ£uÁz?ìÂÈJ¶¦?ìÂÈnlvÖ?ìÁÀñÝMJ?ìÁÁ’xy?ìÀ¹uGš?ìÀ¹˜úôœ?쿱ÕÝL?쿱ø¹yö?쾪0\ù?쾪4á²?ì½¢)Öì$?ì½¢M†ù˜?켚´é?켚A°z?컑íi%¥?ì»’£.?캉™ R*?캉¼µ‡{?ì¹ õL:?ì¹D 9&?ì¸x…@t4?ì¸x¨ê?ì·oÅþ3Ð?ì·oé¦m?ì¶fãAìì?ì¶gèÿ ?ìµ]Ýùˆ?ìµ^ÄÃ'?ì´T²Ÿ ´?ì´TÖCŒ?ì³KczÔ.?ì³K‡ ?ì²Að¬_‘?ì²BNLá?ì±8ZF¾?ì±8}çaš?ì°. ]U?ì°.Ãüsè?ì¯$Ã…â?ì¯$æ •U?ì®ÂJ`1?ì®åç%W?ì­žGÞn?ì­ÁãY?ì¬V¹?ì¬y¡AÁ?ìªûéAº-?ìªü ÚŸc?ì©ñXï%¯?ì©ñ|†¿æ?ì¨æ¥"QÆ?ì¨æȸ Ó?ì§ÛÍîE?ì§ÛñƒH¸?ì¦ÐÓf ?ì¦ÐöùØD?ì¥ÅµœÈf?ì¥ÅÙ/4ë?줺t¥’ì?줺˜6³—?죯ŽØf?죯3­ ?좣†Cv?좣©¡Ëæ?ì¡—Ù'Ðy?ì¡—üµ ‰?ì ŒÞâJ?ì Œ,jÑÎ?쟀KÒ¶?쟀8Öu‚?ìžsþkS?ìžt" Á;?ìgÄ’m¸?ìgèv‘?ìœ[g’,?ìœ[‹çº?ì›N摘?ì›O D?ìšBAKŠÊ?ìšBdÏ«l?ì™5x²åÛ?ì™5œ5¸½?ì˜(ŒÚpš?ì˜(°[õ?ì—}Ô•²?ì—¡TÌ?ì–K´OÅ?ì–o38`?ì•öŒ€J?ì• v?ì“ó~o¬/?ì“ó¡ë÷À?ì’åâq™q?ì’æì–;?ì‘Ø"NU?ì‘ØEÇÇ,?ìÊ>õP*?ìÊbm®á?ì¼8yó?ì¼[ñq?쎮îŒø?쎮2dLí?ìŸÂe â?ìŸåÚ5?쌑RñÛÊ?쌑vdüP?ì‹‚À¦%˜?ì‹‚äö%?ìŠt ˜'S?ìŠt.§»?ì‰e0„†Ð?ì‰eSó¶æ?ìˆV3Yib?ìˆVVÇHû?ì‡G(ëà?ì‡G6•zÐ?ì†7Зþ?ì†7ópÖ?ì…(jx?ì…(ký”?ì„á0¬Õ?ì„™HÆ?ìƒ 5¤Aè?ìƒ Y Œƒ?ìùftÝ€?ìù‰ÚÖ™?ì€és_µx?ì€é–Ä\â?ìÙ]P7?ìÙ€³åÈ?ì~É$YÌZ?ì~ÉG»Ïå?ì}¸ÈŽ(?ì}¸ëî??ì|¨Iþ4 ?ì|¨m]“?ì{—¨¾EÚ?ì{—ÌRP?ìz†äßßX?ìz‡<™?ìyuý~H?ìyv Ùz/?ìxdòVÇN?ìxe°Û*?ìwSÄRôg?ìwS竵 ?ìvBs…)Â?ìvB–Ü—?ìu0ÿÿyð?ìu1#U“ª?ìtiÓÿž?ìt(Å ?ìs ±08?ìs Ôh¢X?ìqûÕÕ%þ?ìqûù'D?ìpé×1 ?ìpéúÓi?ìo×´ç^d?ìo×Ø6ÓÙ?ìnÅoß^Þ?ìnÅ“-Ã?ìm³*ã/?ìm³+w¯Y?ìl }ÜØ?ìl ¡'•?ìkÑ(4?ìkôOJf?ìj{¸?ìj{%à?ìih÷=?ìih3NnÍ?ìhTûP”?ìhUWr‘?ìgA–?.?ìgAåÛ l?ìf.gzߨ?ìf.Š¾Uý?ìeéÐè¤?ìe ä?ìdIªI²?ìdlë³?ìbó‡Ü?ìbóªXŽs?ìaߢ/*?ìaßÅmG?ì`ËšþŽD?ì`˾;T‡?ì_·p©¡?ì_·“ä€ù?ì^£"îÍ?ì^£F(˜?ì]Ž²±šÔ?ì]ŽÕê[Ô?ì\z 9N?ì\zC;¢á?ì[ej÷ø"?ì[eŽ. ?ìZP“ž{ò?ìZP¶Ó6,?ìY;š »?ìY;½=v ?ìX&~Lbë?ìX&¡~m#?ìW?‰jÖ?ìWbºÌ?ìUûÝÑÌ?ìUü±+S?ìTæYÄ?ìTæ|D²?ìSвW« ?ìSÐÕ„S8?ìRºéX^„?ìR» ƒ­Â?ìQ¤þ*d?ìQ¥!Sú‰?ìPŽðÝö²?ìP“•?ìOxÁ†I?ìOxä­ŒŒ?ìNboI •?ìNb’o s?ìMKùçÌ7?ìML \R?ìL5b@™š?ìL5…cÏÆ?ìK¨dü„?ìKˆؖ?ìJÌfF?ìJï‡?ìHðÎV¶ø?ìHðñuÞZ?ìGÙ®G:´?ìGÙÑe~?ìFÂlIœ@?ìFÂfI?ìE«†~d?ìE«*¡•?ìD“¿¶ª?ìD“¢Ùr­?ìC{ÕÑH‚?ìC{øé©B?ìBd ÌÇF?ìBd,ã̘?ìALÃ\ö?ìAL>Ù±?ì@4 ÆË0?ì@4.Û)?ì?ÙèJ=?ì?üû†9™Ó?ì>©K/Ë?ì<ëåEz?ì<ë2õ1?ì;Òv­è˜?ì;Ò™¼Åã?ì:¹»mpœ?ì:¹ÞzñP?ì9 Þ5 ?ì9¡AD?ì8‡ß`l?ì8ˆ!'v?ì7n¾"RB?ì7ná+¼7?ì6U{j] ?ì6UžriÁ?ì5<?ì5<:¾S?ì4"7¼?ì4"³‰w?ì3æ]öð?ì3 aêì?ì1ïÁ(¹?ì1ï=þÍ?ì0Õ-Kø?ì0ÕPLVù?ì/» ³G?ì/»A ?ì. ítÐ?ì.¡ð.?ì-†š|Jà?ì-†½yg®?ì,l&L¢¤?ì,lIH`¹?ì+Q·©ï?ì+Q²² ?ì*6ÖÄ?ì*6ùzå?ì)û~Ÿ'?ì)v@?ì(þÁN¼?ì(!·??ì&åàZj_?ì&æOLU?ì%Ê ZÂH?ì%ÊÃND‡?ì$¯>Ó|u?ì$¯aÅžÔ?ì#“»ÕÅ?ì#“ÞƇá?ì"x’µl?ì"x9‚Œ?ì!\NÏÀ?ì!\q½€?ì @e^y€?ì @ˆK·?ì$ZQ˜æ?ì$}<Ùj?ì-¹”´?ìP£t[?ìëߧ\,?ììÚÍ?ìÏp+¦^?ìÏ“ÃÏ?ì²ßWÍú?ì³=Š?ì–,_j?ì–OCjÿ?ìyWr@?ìyyék&?ì\`¶?ì\ƒM?ì?G»¿0?ì?j›ô=?ì" ë|?ì"0Éé^?ì²¾›ˆ?ìÕœ ?ìç6GS?ìçY#a$?ìɘ•ê{?ìÉ»p•ä?ì«Øà ó?ì«û¹UŠ?ìöëœ"?ìŽý?ìoó‡ß$?ìp^aš?ì QÎň¾?ì Qñš§æ?ì 3ˆµ€ª?ì 3«‰ˆ?ëóx²kDú?ëòWK·`Z?ëòWnjÿž?ëñ5æÇRj?ëñ6 yŠV?ëð`ö…v?ëðƒ§Uá?ëîòºUg?ëîòÝè(?ëíÐòôž?ëíÑ¢ž÷?ëì¯ ­â?ëì¯,¾FÔ?ëëŒÿtÏô?ëë" Á?ëêjÓå·\?ëêjöÚ?ëéH‡t]â?ëéHª½è?ëè&1.?ëè&<Ø%€?ëçŒ,Kï?ëç®ÑÚŒ?ëåàÝuÿ¤?ëåá%P?ë侈?ëä¾0ÁD–?ëã›eè?ëã›@;S?ëâx Øý?ëâx-´ÂÞ?ëáT×ðÈQ?ëáTúHœ?ëà1„ m?ëà1¦§!ù?ëßpƒ¨?ëß2 0M?ëÝêz4sC?ëÝêœÎµØ?ëÜÆÄeôŠ?ëÜÆæþÌç?ëÛ¢îI?ëÛ£¬†F?ëÚ~ö„ž?ëÚ?ëÙZÝ|?ëÙ[®O?ëØ6£ÀÇ$?ëØ6ÆSõ?ë×Ib!¶?ë×kóä•?ëÕíÎp?ëÕíñm²?ëÔÉ2ú‹7?ëÔÉU‰w”?ëÓ¤wÈÄ?ëÓ¤™ŸI£?ëҚűÅ?ëÒ½QÆþ?ëÑZZ-Û?ëÑZ¿ä×D?ëÐ5~™n ?ëÐ5¡"¬?ëÏ?Dìå?ëÏa̾6?ëÍêßl£2?ëÍëó9?ëÌÅ_ d6?ëÌÅ¥\Ì?ëËŸ¾p%?ëËŸàó£!?ëÊyýk™’?ëÊzí¸Ì?ëÉT"ì†?ëÉT>£žÖ?ëÈ.ÜÈ?ëÈ.<[G?ëÇöaE/?ëÇß/?ëÅá²rœè?ëÅáÔï„?ëÄ»NÇŠ?ëÄ»pšÄš?ëÔÉxk?ëÔëñú]?ëÂn$Œnr?ëÂnGð?ëÁG_k‘a?ëÁGâDÚ?ëÀ z%¶ˆ?ëÀ œšûÔ?ë¾ùtÅï?ë¾ù–vœæ?ë½ÒLÍë“?ë½Òo@T ?뼫Dé1?뼫'µã?뻃wPê?뻃¿æÛì?ëº\tÈþ?ëº\7âå ?ë¹4mM)Š?ë¹4¹Öv?ë¸ ¥öo?ë¸ Ç{4?ë¶ä¼Í ü?ë¶äß6ï3?ëµ¼³ÎGê?ëµ¼Ö6¦Š?ë´”‰ßs?ë´”¬Fb~?ë³l?¼T?ë³lb!Ó•?ë²CÕtnž?ë²C÷Ø}‡?ë±KY:?ë±my÷ë?ë¯ò ´±?ë¯òÃßh?ë®ÉÖ\ ?ë®Éø»ÆÝ?ë­ ìì?ë­¡{U?ë¬wáC„ä?ë¬x a)?ë«Nµ›“Î?ë«N×öÿ?ëª%ißzä?ëª%Œ9u?ë¨ûþ ¢?ë¨ü w)p?ë§ÒrhRö?ë§Ò”¿jL?릨ÆÌW?릨é!¨?ë¥~ûYmê?륭¡Û?ë¤UÆJ?ë¤U2rˆM?ë£+mw?ë£+&¾ed?ë¢Ø µ?ë¢ú]ëc?ë Ö‹ºÝÕ?ë Ö® I?러‚À­?러AϹg?ëž“u?{?ëžµÀÅ?ëVç¡r´?ëW ë…Û?ëœ, ’?ëœ,>_ªµ?ë›0å7ù?ë›S,dð?ë™Ö%[¯»?ë™ÖG¡i^?똪ùGÞø?똫Œ%?ë—­`)æ?ë—Ï¢üj?ë–TA³‘g?ë–Tcôð?ë•(¶Q•?ë•(Ø‘l[?ë“ý I"?ë“ý-‡˜¹?ë’Ñ@©¼z?ë’Ñbæ¾å?ë‘¥V‚¼h?ë‘¥x¾Jj?ëyL%šN?ëyn_³À?ëM!`$Å?ëMC˜É?ëŽ Öæùâ?ëŽ ù)¼?ëŒôlÉG ?ëŒôŽÿÜ?ë‹Çã! ?ë‹ÈJf°?늛9ܯú?늛\€H?ë‰nq,ò?ë‰n“]lÄ?ëˆA‰xD?ëˆA«C]r?뇀æGˆ?뇣¶ë?ë…çXsð?ë…çz _?넺ln?넺2˜Ã?냌¨áºâ?ëƒŒË Çõ?ë‚_!á«!?ë‚_D AË?ë1{{2$?ë1¢R>?뀵½™Å?ë€×ãC(?ë~Õи^?ë~ÕòÜEä?ë}§Ë¿hš?ë}§íâ$?ë|y¦£Z?ë|yÈÄT­?ë{KbÐ ?ë{K„3?ëzþ \?ëz >Ôà?ëxîzØ%º?ëxîœõ›?ëw¿ØI²?ëw¿úe+?ëv‘„ X?ëv‘8÷€?ëub5–@(?ëubW®¶;?ët34×LW?ët3VîJ+?ësæS?ës6,kÂ?ëqÔÔ5 ?ëqÔöAë?ëp¥t®†?ëp¥–À–µ?ëouö#É?ëov4*?ënFXr.?ënFzÀ‚?ëm›ªA?ëm½¸jF?ëkæ¿Ú6-?ëkæáææ ?ëj¶ÄZÒÝ?ëj¶æf F?ëi†¨üf’?ëi†Ë#^?ëhVnl'`?ëhVtji?ëg&¸î^?ëg&6¿·|?ëeõ›ñŠ†?ëeõ½öÙ“?ëdÅ$k?ëdÅ&(?Ø?ëc”M`u?ëc”obÐ?ëbcw´…Ã?ëbc™µe·?ëa2‚{>A?ëa2¤z£‰?ë`m…Yz?ë`ƒCð?ë^Ð9~v?ë^Ð[zå”?ë]žæu (?ë]Ÿoþ„?ë\mtwå;?ë\m–q^R?ë[;ã•“Ó?ë[<‘}?ëZ 3ܦ˜?ëZ UÓ(®?ëXØe\–?ëX؇Q ó?ëW¦wp;?ëW¦™c¸?ëVtiéÇ*?ëVt‹ÛÕŸ?ëUB=sqf?ëUB_d®?ëTò_”?ëT u‡?ëR݇ïðq?ëRݩ݉ê?ëQªþÿéÜ?ëQ« ìµ?ëPxWYÝ?ëPxyD}?ëOE‘ 4Ã?ëOE²õWç?ëN«u?)?ëNÍ\å:?ëLߦfÂÐ?ëLßÈLë¦?ëK¬‚ˆäh?ëK¬¤mÝ?ëJy?ê)ù?ëJyaÍWç?ëIEÞ™/?ëIFz±p?ëH^££V?ëH€ƒÕÃ?ëFÞÀ† ?ëFÞá÷:?ëE«[%?ëE«$ã‘y?ëDw&Ìù?ëDwH¨±?ëCC+>Ö)?ëCCMÊ?ëBBŽ?ëB2Úýœ?ë@ÚØ%›]?ë@Úùü׳?ë?¦€·3?ë?¦¢Œð{?ë>r Å_Ì?ë>r,™ž=?ë==v^_É?ë==˜1?ë<Þø?ë<åaÞî?ë:Óñ¾Á?ë:ÔÇA?ë9Ÿ¹I{?ë9Ÿ"‡Š]?ë8iñ'.Y?ë8jóïx?ë74Ãâ?ë74äáT?ë5ÿv“èŽ?ë5ÿ˜]©³?ë4Ê ¯"T?ë4Ê-wcD?ë3”‚uÿ?ë3”¤<¿–?ë2^Úö—O?ë2^ü»×d?ë1)”€ž?ë1)6X@ ?ë/ó/#5`?ë/óPåt?ë.½+E¾I?ë.½M{÷?ë-‡ &2?ë-‡*ÉbÈ?ë,PÈ~‰‰?ë,Pê–?ë(­sBuR?ë'v—¢??ë'v¹Yóý?ë&?¾Îß=?ë&?à…(?ë%Ç°zì?ë%ée+¶?ë#ѲUB?ë#ÑÔ>Æ?ë"š~Ê ñ?ë"š |M ?ë!c-Mæ?ë!cNÏwm?ë +½aï?ë +ßƾ?ëô/ž#j?ëôQKG^?뼃=dŽ?뼤é?넸'¶?ë„Ù½E?ëLο,§?ëLðgÇ"?ëÇOdÕ?ëèö{Ý?ëÜ¡Ñ©”?ëÜÃw=?ë¤^TÔ?ë¤ø†?ëkü䂤?ël‡r?ë3}ÍP?ë3Ÿ1Õ?ëúßÁàé?ëûad‚?ëÂ#LsA?ëÂDêr†?ë‰HΫ¸?ë‰jk&„?ëPPVo?ëPqñeB?ë9ñ|V?ë[ŠíÀ?ë Þ­ˆ/?ë Þ'Et°?ë ¤³˜Æ"?ë ¤Õ/-•?ë kCÀãð?ë keUÆ1?ë 1µ:X?ë 1×#—@?ëøÜí?ëø*mðW?ë¾>Ab?ë¾_Ñq(?ë„UÌïB?ë„w[»@?ëJOVa?ëJqœr?ë+ ’?ëMÊ‘?ëÕéâÄý?ëÖ lþÄ?뛊“k?뛬m?ëa  ?ëa.•7ê?êÿ&q(V}?êÿ&’­ü¿?êýë·}?±?êýëÙ_'?êü°àit?êü±ù?êûuë yÝ?êûv Ž‹M?êú:Ød  ?êú:ùã–Õ?êøÿ¨+ép?êøÿÉ©ìE?ê÷ÄZr¤â?ê÷Ä{ï 3?êöˆî¦‘?êö‰!8?êõMdœjÐ?êõM†Ö¨?êô¼îëG?êôÞfÏ,?êòÕ÷«2…?êòÖ!ŽQ?êñšÞ¿(?êñš6S’·?êð^—I?êð^6 ”??êï!öâGž?êï"T E?êíå»Í]ä?êíåÝ=—à?êì©bÇÑÇ?êì©„6‚ô?êëlë¨go?êëm ¥?êê0W?êê0xr£8?êèó¤ðîŸ?êèóÆ[}?êç¶Õs™i?êç¶öÜ%ä?êæy蜢X?êæz ¥L?êå<Þyfþ?êå<ÿÞàF?êãÿ·}Ý?êãÿØ{mT?êâÂqçå?êâ“JK?êá…ÁÁz?êá…0"œâ?êàGŽ;EÒ?êàG¯š–û?êß ðaÈZ?êß ¿ ?êÝÌ5B¡æ?êÝÌVžÞ$?êÜŽ\ëcè?êÜŽ~Fz?êÛPgiDã?êÛPˆÂk¥?êÚTÉ´?êÚv!OÒ?êØÔ$W4?êØÔEÕgè?êוÖaó’?êו÷¶y?êÖWkôÎ?êÖWŒXîâ?êÕâx¿ˆ?êÕÊ.?êÓÚ<Ç­Ú?êÓÚ^¼?êÒ›yÿçN?êÒ››N>b?êÑ\š.ËÑ?êÑ\»{–ñ?êÐa°Ñ?êо¬ïÚ?êÎÞƒ ·Þ?êÎÞ¤Vj¬?êÍŸKU?êÍŸlPDÂ?êÌ_õæèŸ?êÌ`-‚‡?êË ƒ¶:?êË ¤ûGM?êÉàôƒ`²?êÉáÆá$?êÈ¡H[x.?êÈ¡ik¯?êÇaK¹?êÇa Œ ?êÆ!™a{z?êÆ!º T®?êÄá–rÂ?êÄá·O¾˜?êáu7Fí?êá–sB?êÂa7a}?êÂaX›­Å?êÁ Üž: ?êÁ ýÖÜò?ê¿àdúŠÚ?ê¿à†1ŸÒ?꾟ЃŒ†?꾟ñ¹m?ê½_Fl?ê½_@zdÈ?ê¼QP>Ù?ê¼r‚©2?êºÝfcá?êºÝ‡I?½?깜]x –?깜~§mÑ?ê¸[7ÿ.ù?ê¸[Y,ín?ê·õºµN?ê·æäÚ?êµØ–·§¶?êµØ·âH6?ê´—\?ê´—<,(«?ê³U‚ª%F?ê³U£Ñ§A?ê²͹Àh?ê²îß²ì?ê°Ñûªºk?ê°ÒÏS?ê¯ Võ?ê¯-yÈÅ?ê®NLÀ?ê®N!nR?ê­ ×˜ÿ¦?ê­ ø¸²ã?ê«É’HÄD?ê«É³fçV?ꪇ0hÞÀ?ꪇQ…q„?ê©D²<Ë?ê©DÓ!??ê¨-ÛÖ?ê¨8GM”?ꦿ_Z>??ꦿ€rD?ê¥|Šey?ê¥|«{É/?ê¤9˜Üqt?ê¤9¹ñ0š?ê¢öŠÌ?ê¢ö«ßJ?ꡳ`A!t?ꡳR¾/?ê pH{@?ê p:X†‘?êŸ,µï \?êŸ,Öý…?êé6A¶K?êéWNž\?ꜥ™¼Oÿ?ꜥºÇ¦;?ê›aà9•.?ê›bCYr?êš Dë0?êš+MX?ê˜Úëè?ê˜Ú8ñ¦Ð?ê—– 8¬²?ê—–*=º7?ê–QÞ:°b?ê–Qÿ>+a?ê• –ýÁ>?ê• ·ÿ©•?ê“É3ŽÄþ?ê“ÉT‰?ê’„³k,’?ê’„Ôiï,?ê‘@n.?ê‘@7k/µ?êû]!B?êû~Þd?ꎶ‡‘ã?ꎶ¨‹ŠÚ?êq•Ë…?êq¶Ãû?êŒ,‡Ûûg?êŒ,¨ÒÝB?êŠç]χ9?êŠç~ÄÕR?ꉢ³ú?ꉢ8¦½-?êˆ\µR¨?êˆ\Õ÷xÒ?ê‡5¡Ök?ê‡V’hh?ê…Ñš/ö?ê…Ñ»-¤?ê„‹â_ð¸?ê„ŒMYó?êƒFšŸƒ?êƒF/†t)?ê‚Íù?ê‚?¸9 ?ꀺˆô?ꀺ3ï4?êsëPÜÜ?êt 7òò?ê~-§-{í?ê~-Èüã?ê|çFxw~?ê|çg\c/?ê{ É¸¬æ?ê{ ê›0?êzZ0ú¼+?êzZQÛ|ë?êy|K?êy*?'?êwÌ«¶?i?êwÌÌ“Ô­?êv…¿H¤¤?êv…à$£ö?êu>·6?êu>×é|t?ês÷’‹X-?ês÷³d+4?êr°Q™Á_?êr°rpþ ?êqhôÀ+v?êqi•Ñ¤?êp!| Ñ’?êp!œÞá ?ênÙç†t?ênÚX@?êm’7>£?êm’X„ç?êlJk@µî?êlJŒÎ?êkƒ˜ºŽ?êk¤fnD?êiºÊN7?êiº –j ?êhr_²!%?êhr€|¦?êg*#ÔwÔ?êg*De;?êeáÌ=¨â?êeáíþ”?êd™Xùó†?êd™y¿±a?êcPÊ¿X?êcPêÙå:?êb‚À?êb@`†?ê`¿Y ?ê`¿z^…‘?ê_vwš‘“?ê_v˜Yî»?ê^-yr1­?ê^-š/öR?ê\ä_¦ú0?ê\ä€c&/?ê[›*E¹?ê[›Jÿ£ï?êZQÙXõ×?êZQúð#?êYlî¹ß?êY¦?êW¾å»[?êW¿ȃl?êVuAÑZÓ?êVub…‰“?êU+‚°Øà?êU+£cn-?êS᧎óæ?êSáÈ?ï?êR—°í}?êR—Ñœx|?êQMž×5˜?êQM¿„ý½?êPqY º?êP’Îâ?êN¹(€©K?êN¹I+=U?êMnÄX=¥?êMnå7o?êL$Dì³.?êL$e”—?êJÙ©ÅÑž?êJÙÊk–ƒ?êIŽòÁ·L?êIeá‰?êHD `eq?êHDAôå?êFù2®z?êFùSNú?êE®)¶œþ?êE®JUö{?êDc†&ì?êDc&#å:?êCÆ(ø3?êCæÅ1?êAÌk«2?êAÌŒE£¾?ê@€õ•«5?ê@.—,?ê?5cÇm´?ê?5„^½õ?ê=鶾æ&?ê=é×TšŽ?ê<î‡è ?ê<ž{?ê;R .¹š?ê;R+Á5í?ê: ¿%€?ê:-P•?ê8¹óE\“?ê8ºÔ H?ê7m¾Íxb?ê7mß[—?ê6!náø°?ê6!nB?ê4ÕaÞm?ê4Õ#ìL:?ê3ˆ|ÊzÌ?ê3ˆSK³?ê2;Û'£j?ê2;û®×H?ê0ï…<2?ê0ï? Òç?ê/¢FïCÐ?ê/¢gs=:?ê.UTq®C?ê.Utô @?ê-G}Í?ê-g™<=?ê+»o¼ ?ê+»>îÜË?ê*mÚVÇC?ê*múÔJ1?ê) {Ij´?ê) ›ÅO®?ê'ÓS£_?ê'Ó!ÍêD?ê&…l>D?ê&…Œùæó?ê%7¼ÝñC?ê%7ÝTû›?ê#éòuÊþ?ê#êë6Ý?ê"œ T¶~?ê"œ-ȃÃ?ê!N í?ê!N-z‰?êÿño˜ò?ê à(ž?걻ݠ?ê±ÛtÎM?êciÖ¡%?êcŠCò³?êýí²‡?êYdÓ?êÆwVÖ?êÆ—Àèú?êwÖÞ?êwö†Q|?ê)NžŸ?ê):µra?êÚCwàê?êÚcÝæ?ê‹QyÔO?ê‹qÝhc?ê¦?éØì$yñƒ?éØìD’?C?éט]¡Ö™?éט}¸~r?éÖD|~oº?éÖDœ“qŠ?éÔðFŸ?éÔ𡔢G?éÓœlµPÀ?éÓœŒÇ ?éÒH>%ñD?éÒH^6?éÄùA×B?éã™Þ-Ä?éã¹Ü?éÂN6•F?éÂNV‘Vœ?éÀø¹J¤?éÀøÙE4l?é¿£"mrc?é¿£BfZˆ?é¾Mr?é¾M‘ÿÏo?é¼÷¨'Jû?é¼÷Èâr?黡ÄÔ‰´?黡äÈx¤?éºKÈ…‰?éºKè ËÔ?é¸õ²m‚?é¸õÑø ?é·Ÿ‚2ßE?é·Ÿ¢!Óä?é¶I8Ë?é¶IXo™?é´òÕaÃÝ?é´òõMfQ?鳜Xݯ?鳜xǨ>?é²Eâ†?é²EâèòQ?é°ïÕÍ?é°ï3¼sV?鯘Kgÿˆ?鯘kLü+?é®AiÂvæ?é®A‰¥ÉÇ?é¬ên‚?é¬êŽbÈ?é«“Yˆ1Á?é«“yh0¾?éª<+CÿÝ?éªûàT.?é‡?“6Î?é…å(˾?é…åH?ô?é„‹<†šô?é„‹\6" ?éƒ17Õyé?éƒ1WƒSî?é×i?é×9Ç•X?é€|ã>Sï?é€}èÒH?é"“¥~˜?é"³NNì?é}È+[”>?é}ÈK¶o?é|mªkLž?é|mÊÀŒ?é{ß`J?é{0ƒ%Ø?éy¸^ÂZ0?éy¸~dq??éx]”#A?éx]³¿‹²?éw°—Ϋ?éwÐ6ˆ`?éu§´Œž?éu§Ó¯—x?étLžõ§?étL¾‘è?érñqK?érñåIá?éq–+"?éq–J·³?ép:Ìz?ép:ìëO?énßUhã¹?énßtý‚?émƒÅô¢O?émƒå‡‘…?él(Á6¿?él(=RvF?éjÌ\µ ÿ?éjÌ|D™¶?éipƒ53z?éip¢ÃC?éh‘LcP?éh°Ø“ ?éf¸‡íâ?éf¸¦mu?ée\di„ä?ée\ƒòT.?éd)„¡?édI ¿ó?éb£Ö`ê?éb£õæX}?éaGj¢×1?éaGŠ&”í?é_êæ1ˆA?é_볕:?é^ŽIp”j?é^Žhððƒ?é]1”j¢º?é]1³éMÕ?é[ÔÇ*!T?é[Ôæ§R?éZwá¹?éZx4Çã?éYä#NX?éYœåÄ?éW½Îqÿm?éW½íéåb?éV` K}?éV`¿Á±f?éUY–äî?éUy g›?éS¥ú·J?éS¦)Ù&?éRHƒ¶)1?éRH£'H?éPêôž¸f?éPë%F?éOM{>L?éOlèù?éN/ŽV  ?éN/­Â ?éLÑ·9›¼?éLÑÖ£ñÂ?éKsÇÌåŽ?éKsç5‰?éJ¿÷?éJß^}ö?éH·  l?éH·¿€H‰?éGYhAÛ˜?éGY‡¥f×?éEûv/>?éEû7Ø?éDœ°ÂK¨?éDœÐ"pÐ?éC>10Ó?éC>PE ?éAß™ËöK?éAß¹(´æ?é@€ê;Ýn?é@ –è–?é?""hœª?é?"AÁôA?é=ÃB²xQ?é=Ãb 9?éáÎ?é-I¤‚?é+ép²íÃ?é+éôgF?é*‰DF’?é*‰c…ÇÈ?é)(ÿàæ"?é))ôï?é'ȣ᚜?é'ÈÃóá?é&h0Rb’?é&hO3?é%¥=Gš?é%Äv5x?é#§¬_.?é#§!ã—.?é"FH©÷Ê?é"FgßyÎ?é åw@>ˆ?é å–t r?é„Ž²?é„­LÇË?é#"k§?é#¬RË?éÂt´{¸?é“ã$¦?éaDÚס?éadÊ?éÿýŸ¸Ò?éÊô‡?鞟 ÿ+?éž¾6„?é=),Ùà?é=HT§ç?éÛœ ƒÖ?éÛ»/šÜ?éy÷Oþ?ézsïä?é:胞?éZ ,G?é¶g0DZ?鶆Q5©?éT|0¿2?éT›Où ?éòyóìæ?éò™o+?é `ƒó|?é Ÿ¾?é ./êÌ”?é .Oß[?é Ëè2}ˆ?é ÌJØe?é i‰îw?é i¨‘M?éWâý?é1lͯ?餄z]?餣JÏ?éAßy~|?éAþŠø?éß#`°?éßBoÇI?é|P7ž»?é|oE§¾?éf gv?é…·Å?èÿ¶dâ0?èÿ¶ƒìÇ~?èþSLmïà?èþSkvÎq?èüð—ëu?èüð;Ÿý?èûŒÕ¹Å?èûŒô¿1{?èú)wÝ,º?èú)–àßØ?èøÆ Aý?èøÆ";»?è÷bwPÀÃ?è÷b–Q?èõþÔ´¾H?èõþó³Dñ?èô›B o?èô›:>Úc?èó7J¨³)?èó7i£ÆL?èñÓbÓ%ï?èñÓÌ#?èðodˆ?èðoƒ¯±?èï N‡1?èï m}?èí§"$[ö?èí§A†´?èìBÞû|„?èìBýíìâ?èêÞ…\Ý?èêÞ¤¿?èéz~¼Œ?èéz3m·Õ?èèŒæ?èè«ÓD®?èæ°î6Å€?èæ± "KC?èåL8È”Ñ?èåLW²_¦?èãçl¥>"?èãç‹Mí?è₉ւÁ?è₨¼×f?èáfO?èá¯J²±?è߸€]äÞ?è߸Ÿ@Âã?èÞSYÇ‘¡?èÞSx¨´,?èÜîUo ?èÜî;4Õý?èÛˆÇò¹]?èÛˆæÐd?èÚ#\õ¹˜?èÚ#{Ñ© ?èؽÛh(«?èؽúB\0?è×XCS´Î?è×Xb,,L?èÕò”Â-t?èÕò³˜èÏ?èԌϽ+h?èÔŒî’*„?èÓ&ôN‰¦?èÓ'!Ìg?èÑÁ)“m?èÑÁ û·?èÐZù9ª¡?èÐ[ tX?èÎôÙÔ]˜?èÎôø¢j ?èÍŽ¤&[?èÍŽÂÏv—?èÌ(WÏ«?èÌ(vš>f?èÊÁõC²ø?èÊ ‰K?èÉ[|hÃÑ?èÉ[›/Ý?èÇôíHy?èÇõ Õ‰?èÆŽG—p?èÆŽf[¾?èÅ'‹AZ ?èÅ'ª;>?èÃÀ¸šŠ?èÃÀ×Z­ª?èÂYϬˆ?èÂYîjî?èÀòЀòu?èÀòï=š«?è¿‹»!\z?è¿‹ÙÜFÎ?è¾$—z„?è¾$®P¦Ü?è¼½Mì´È?è¼½l¤# ?è»UõÖ³¡?è»VŒc¯?è¹î‡AŠ?è¹î¥õG?踇€lÓ?踇!2 %?è·gœì^?è·†Ma*?èµ·¶ ™u?èµ·ÕOOŸ?è´Oï”éÆ?è´PAá3?è²èƒHV?è²è1.€ë?è±€uwJ?è±€>ðê?è°!èw?è°4É£?讯öuè?è®°ÿM?è­GÀÁ#;?è­Gße_Z?è«ßu©'?è«ß“²%ã?èªwjb?èªw2 À¡?è©›ÙË?詺xÈÅ?触hXª?触-–œ?è¦=k/Ô?è¦=‰º­ø?è¤Ô±µàr?è¤ÔÐOž¬?è£kâL†?è£l±J¹?è¢üšƒ@?è¢0ÁR?è šC?è š×}ç?èŸ0ð(í?èŸ1®æl?èÇÉ/NI?èÇçÀKV?èœ^Œ† ??èœ^«H¿?èšõ:)“ ?èšõX·÷?虋ÑÒ˜ø?虋ð^T ?è˜"SnBÜ?è˜"qø=?è–¸¿LÄ ?è–¸ÝÔýD?è•OwO™?è•O3ýÇÀ?è“åU÷yŒ?è“åt|0ƒ?è’{€Öjc?è’{ŸY`?è‘–u¹?è‘´žª?觕Ö:?觴U?èŽ=¹æñ?èŽ=ž7˜?èŒÓS¶8ò?èŒÓr2(g?è‹is¡?è‹i0”¡D?è‰þºï­ ?è‰þÙhØ?舔N?1@?舔lµÚñ?è‡)Ìv¸?è‡)ê‡^H?è…¿4r“Ù?è…¿Rå¹,?è„T‡héü?è„T¥ÚLù?è‚éÄ°)þ?è‚éãʉ?è~ì6j?è £æi?è€þH¥$?耴À{?è~¨úñY¼?è~©[²Q?è}=â9?¬?è}>¡Õe?è{Ò´)›,?è{ÒÒmî?èzgpË»?èzg0ÊÍ?èxü(ó?èxü6Œ8?èw©üe(?èwÈ]îg?èv%&4À ?èv%D”…é?èt¹ýî?èt¹«}O?èsMÞÄ&@?èsMý e ?èqâ- ;?èqâ9ˆV?èpvBd]þ?èpv`½M?èo Tq±c?èo rȤÎ?èmžQ^·?èmžo³æ€?èl28è'U?èl2W;’§?èjÆ üXä?èjÆ)N?èiYÇç€Ê?èiYæ7c˜?ègío²Ÿ,?èg펽‘?èffóÄ?èf ³M¦?èe€ žn?èežX3²?èc§è¯Ÿ+?èc¨øo¸?èb;*»¨ˆ?èD>HÝw?èBϲ­•0?èBÏÐÍ+?èAa& ¯z?èAaD'ðP?è?ò„ØëÒ?è?ò¢õeh?è>ƒÎÜ ?è>ƒìö¾D?è=yg?è="d1?è;¦$”F?è;¦B«¤ƒ?è:70›0Ù?è:7N°Œo?è8È(V`?è8ÈF2ê6?è7Y )À?è7Y);Œ?è5éÙÃzY?è5é÷Ó~d?è4z“õH½?è4z²„¼?è3 9€Ê?è3 W>i?è1›ÊUÛ.?è1›è`†È?è0,F»è?è0,dÄËG?è.¼®»®?è.¼ÌÂÈè?è-M^H?è-M cpŒ?è+ÝA«õ8?è+Ý_¯~Ø?è*ml®ø?è*mŠ¯ÙÚ?è(ýƒmdô?è(ý¡m]?è'…¬Tl?è'£ªƒˆ?è&s[ h?è&‘Wpy?è$­LÀ ¬?è$­jº¨š?è#=äJ?è#=/Üáü?è!ÌÂÏç:?è!ÌàÆñ—?è \_ŒVz?è \}—h?èëè"Ò?èì“9?è{\šÞ?è{z‹Ã¥?è ¼·®y?è Ú§’†?èškE`?èš&Y_š?è)?úx©?è)]æÈ÷?è¸cn ,?è¸X’u?èGrΚ"?èG·VM?èÖn$ð6?èÖŒ â*?èeUyÇ%?èes^îÊ?èô(Õá¹?èôF¹>ö?è‚çý‹µ?èƒßq?è’á”}?è°Á\ž?è  )Æ–±?è  G¤”?è .¬µ&?è .Ê‘X¥?è ½¶ü?è ½9…¸?è KvÑý ?è K”ª™Þ?èÙ¾?èÙÛèQ)?ègñ}`×?èhRgP?èöÚל?èö.®Í?è„ù?è„9ìhÒ?è‡?è1Q+Y?èŸ÷Í?è äñ‘?çÿ-Æä&|?çÿ-ä°3–?çý»‚ñ„?çâ;¦|%?çâY(™,?çÂ,ÛH”?çÂ,øˆ•û?çÀ·gu²?çÀ·„ô/¾?ç¿Aà¹l ?ç¿Aþ6é?ç½ÌFÆ!Ž?ç½Ìd@ÿ…?ç¼V™ÚM&?ç¼V·S[?çºàÙþ!Ð?çºà÷u_±?ç¹k9æ3?ç¹k$¯Sæ?ç·õ!•þž?ç·õ? œ ?ç¶)°Î?ç¶FŒ}ß?çµ ÐL?çµ ;@H¬?ç³’ÿ‚tÃ?糓ð Ó?ç²Î$ §?ç²ëi?ç°¦‰ò0?ç°¦§]'â?ç¯02ön?ç¯0P_'ù?ç­¹É7À¨?筹枩?ç¬CL¾Ê—?ç¬Cj#âŒ?çªÌ½“Õ4?çªÌÚ÷?ç©V¿J?ç©V9 ”÷?ç§ßg J?ç§ß„l­±?ç¦hŸpòÖ?ç¦h¼ÎÅÞ?ç¤ñÅ'„ï?ç¤ñ⃆‚?ç£zØ8ð?ç£zõ“ ?ç¢Ø­Yÿ?ç¢ö¸b?砌ƌèT?ç Œããtü?矡ßçØ?矿4¢®?çžj®è?瞈yÖ?çœ' Æ&·?çœ'>=¥?皯Ä!{?皯áifQ?ç™8Tæuí?ç™8r3è•?ç—ÀÓ30^?ç—Àð~ÐÁ?ç–I?f’?ç–I\R4˜?ç”јnih?ç”ѵ¶dû?ç“YßmC¢?ç“Yü³l«?ç‘â Q?ç‘â1Qs¹?çj6B ?çjS^Ź?çŽòEŽL"?çŽòbÎý?çzBžBA?çz_Ý =?çŒ-T\(?çŒJ‘g'?犊¸•š?犊"ó͆?ç‰ËÒý ?ç‰é bb?燙«Ô:?燙œãe¼?ç†!!K?ç†!>€Ñ¹?焨°ÇÊ?焨ͳ²†?çƒ0-=ü ?çƒ0Jp@?ç·—¿Þà?ç·´ð"{?ç€>ð f‹?ç€? ;Öt?ç~Æ6.º ?ç~ÆS[V@?ç}Mj+ØŸ?ç}M‡V à?ç{ÔŒ Ê\?ç{Ô©5¾§?çz[›Ù î?çz[¹Á,?çxâ™bO;?çxⶇ›V?çwi„š÷²?çwi¡¾o”?çuð]½Î?çuðzÞ³_?çtw$Ðt)?çtwAðCS?çrýÙÝ1ô?çrýöû,¡?çq„|ësH?çq„š™b?çp ÿR?çp +PÂ?çn‘+ëV?çn‘ªDh?çmú6ñ=?çmM™?çkžU¢Ð?çkžr-u½?çj$ž \$?çj$»Z?çhªÕ8Ž?çhªò"a^?çg0ú8!Â?çg1Gub?çe· †Ô?çe·*“.?çd=ÑØ?çd=,zÖ?çbÂþ¶|®?çbÃÀP:?çaHÜr€R?çaHùz~V?ç_Ψ+Ó.?ç_ÎÅ1û“?ç^Tbõ?ç^TG³?ç\Ú DñN?ç\Ú'Gn3?ç[_ ´¢?ç[_½µI ?çYå%pàŽ?çYåBo±›?çXj˜™'?çXjµ~”(?çVïùîÔ¶?çVðéù“?çUuIŠË÷?çUuf„œ?çSú‡JwÃ?çSú¤Að?çR³dò ?çRÐZ”?çQÍáò’?çQêÕ¾?çO‰ÖÉVò?çO‰ó»K×?çNÎ"üv?çNëµ?çL“³ö¿©?çL“Ðå+?çKˆLr³?çK¥8ãc?çIJ÷T?çIgáíã?çH!ûì™1?çH"Õ[ü?çF¦›b>å?çF¦¸I*œ?çE+)`Nh?çE+FEbö?çC¯¥îxæ?çC¯ÂѶ4?çB4‹ü?çB4-õñ÷?ç@¸jÚ^J?ç@¸‡¹ìÚ?ç?<³G¼?ç?<Ð%s'?ç=Àê0£—?ç=Á ƒ?ç³O3?ç¹'?çÙr³Á?çö"D ?ç”câ?ç”ÄÊ—?çÛÓ^b?çø;X?ç™C¯AË?ç™`YDë?çš²XÅ?ç·Zü?çàäFÃ?çýŠ•ü?ç L›\?ç 2ñ‚?ç¢:ó ¨?ç¢W•¦¦?ç$N®Ÿ©?ç$kO`j?ç ¦QuÏÅ?ç ¦n¶4?ç (Czá3?ç (`íÉ ?ç´*ÎÙþ?æÿ5z¼ƒG?æÿ5—J¹/?æý¶Ö¥—?æý¶ó1ê_?æü8"}”?æü8>‹ý&?æú¹\׶?æú¹y`Z]?æù:‡/í$?æù:£¶¶ ?æ÷»¡“€?æ÷»½–€õ?æö<ªUC7?æö<ÆØU%?æô½¢ñùƒ?æô½¿s/Ô?æó>‹`Ø?æó>§—»x?æñ¿bÐ'?æñ¿Mƒ?æð@* Z°?æð@F›ý²?æîÀáäN?æîÀýŠ«b?æíA‡©`?æíA¤!r?æëÂð‚æ?æëÂ:f‘á?æêB£Àr?æêBÀ4¤Ù?æèÃý?æèÃ5‚S°?æçC~Sö?æçCšÎ3?æåÃÒÅÈ%?æåÃï4eú?æäD: ?æäD3§ƒy?æâÄKuÏ>?æâÄgà´?æáDo~Q”?æáD‹çY¸?æßă[¯?æßÄŸÂÚˆ?æÞD†èq?æÞD£Me?æÜÄzá¸?æÜÄ–~Sv?æÛD]#V?æÛDy„ëJ?æÙÄ0ðP?æÙÄLh¨?æØCòÒñV?æØD0Ëø?æÖÃ¥ˆÓj?æÖÃÁäÐÜ?æÕCH1ø?æÕCdŒ1?æÓÂÚÕÄy?æÓÂ÷.L?æÒB]O2?æÒBy¥i™?æÐÁÏ•rœ?æÐÁëéú?æÏA1׉y?æÏAN*3Ê?æÍÀ„”È?æÍÀ mao?æÌ?Æl ä?æÌ?âºøÏ?æʾøÍ3?æÊ¿D3?æÉ>Gc=?æÉ>7’–s?æǽ-â ?æǽJ+bN?æÆ<0xª}?æÆ?æQºò'­~?æQ» Þz]?æP5TL}ˆ?æP5pf?æN¯¨ 6’?æN¯Ã¿;Ë?æM)íIT?æM*úuK?æK¤#ýãG?æK¤?­ ?æJLPƦ?æJgþÝ?æH˜fHøÕ?æH˜ômè?æGqí=B?æG–Î?æEŒoD‘'?æEŒŠì=¼?æD^UÑ ?æDyû™E?æB€?'á?æB€ZËÅR?æ@úç^?æ@ú-?æ²?æ?sÕ²%d?æ?sñR@)?æ=í‹ŠÓ²?æ=í§) ×?æ?æŸF©¼.?æŸbî?æYòá?æuWÜŒ?æ_t¯Ý?æzØÏ?æ WSß°?æ rµ]Ø?æ A–ÊŸ?æ \öaì?æ ÷Dç?æ ÷9¡ÊG?æníb‹æ?æo¾UJ?ææ®øÃF?ææÊR¥›?æ^c wÏ?æ^~es?æÖ ‡M?æÖ$Ý'U?æM¢`¸q?æM½´å9?æÅ-½‚Z?æÅIÇÑ?åÿ<«¤-M?åÿ<Æô‹b?åý´Pú?åý´7iÇœ?åü+)‘L?åü+šv l?åú¢ÔÕ°?åú¢ð W¨?åù&9?åù8nøï?å÷‘X‚?å÷‘sH÷µ?åö…dö ?åö ©ç ?åô¥q"l?åôÀ´+?åòö¸-3!?åòöÓnSÑ?åñm½Ÿä?åñmØßÌ?åïäµÏº{?åïäÑ ,?åî[ ÃTû?åî[»þ½”?åìÒ~k–?åìÒ™ºì?åëINñ~Š?åëIj)Â?åéÀ&®?åéÀ-DÖœ?åè6ÇüP6?åè6ã0Ê?åæ­p¿”v?åæ­‹ñsŸ?åå$ _u´?åå$'lc?åãššâ“æ?å㚶¢ ?åâO|L?åâ7{¡Õ?åà‡¬ÈF?åà‡«×#?åÞý÷Ⳋ?åÞþ «?åÝtQìû*?åÝtmf?åÛêžìé?åÛêºk{?åÚ`Þé ò?åÚ`ú §~?åØ×çãÖ?åØ×-”e?å×M7ð?å×MSÉ¡?åÕÃQöV?åÕÃl$Ô½?åÔ9]6H”?åÔ9xQ=Î?åÒ¯\cÆÜ?åÒ¯w|ÒÙ?åÑ%NŒlf?åÑ%i£?åÏ›3ÐЯ?åÏ›Næ ?åÎ 7À?åÎ'JÝ¥?å̆×Ç*ï?å̆òØ‘X?åÊü–†>?åÊü±•‘?åÉrHzÓ-?åÉrcˆfl?åÇçí«ë¸?åÇè·•J?åÆ]†¼Ò?åÆ]¡ |§?åÄÓ{mÄ?åÄÓ,ƒCÍ?åÃH6+*?åÃH«<W?åÁ¾9Må?åÁ¾=P%?åÀ3g‹Tÿ?åÀ3‚mC?徨À2Ç?徨Û2õM?å½ 6 ?å½'4O8?廓K›¥i?廓f—ÿ[?åº~Mš?庙H ½?å¸}¤H*x?å¸}¿@¯ä?å¶ò½ªÜÄ?å¶òØ¡wÖ?åµgÊ|1?åµgåpâ)?å³ÜÊÂ|¨?å³ÜåµB×?å²Q¾„<‚?å²QÙu'?å°Æ¥ÇØ}?å°ÆÀ¶ÉŠ?å¯;€“¿’?å¯;›€Å÷?å­°NÒŒM?å­°i½§ú?å¬%€¼Ï?å¬%+iíµ?媙Ž:À?媙ऀÐ?å©nŽhÓ?婉sÃý?姃 úµŒ?姃%Þ%Á?å¥÷›O?å¥÷µê?å¤l¾4?å¤l9Î?å¢à–"8°?å¢à°ÿç¨?å¡U Š?å¡UûdO?åŸÉ_³*?åŸÉzŠ?åž=±û9¡?åž=ÌÓ&Ó?圱÷þ!K?圲Ô#?å›&1Â-~?å›&L–Cß?噚_MÌ?噚zöþ?嘀§X?嘛w—â?å–‚•Õ$z?å–‚°£x0?å”öžÂûV?å”ö¹c`?å“j›m°fc?å‡çù‚¶?å…|]2ÉŠ?å…|wëùš?åƒïá.K÷?åƒïûåµ?å‚cY72Ð?å‚csìŠ-?å€ÖÅSÊž?å€Öà5?åJ%ŠQá?åJ@;ÐQ?å}½yá(1?å}½”º?å|0ÂEÓ?å|0Üò­?åz£þ³5"?åz¤^í¿?åy/Hf¨?åyIò2Œ?åwŠT ÒG?åwŠn²±c?åuým°ô?åuý‡¦£:?åtpz0\¯?åtp”Ôb?årã{Ÿÿ;?årã–B¨?åqVqUÖ‘?åqV‹öû?åoÉ[?Vœ?åoÉuÝ”õ?ån<9YÛp?ånÎ9Â;?å>èš@ê?å<€>öM¡?å<€YTÝl?å:ñ¤˜ž¤?å:ñ¾õ?{?å9bÿ&À¢?å9cry?å7ÔN¦×?å7Ôhÿ™Î?å6E“êÀ?å6E­u¾l?å4¶Ì•X?å4¶æéøÙ?å3'ûsŠ?å3(bhÔ?å1™~&?å1™8Ï +?å0 6ßÇ?å0 Q.&y?å.{DL ¤?å.{^™4õ?å,ìFÊ÷?å,ìa.÷?å+]>aß?å+]X«'÷?å)Î+Ý?å)ÎE^6n?å(? ïèë?å(?'5R2?å&¯ãóÍ?å&¯þ6“p?å% ° ?å% ÊR“ ?å#‘qH?å#‘‹‡®9?å"'±+~?å"AîÕä?å rÓR\Ê?å ríŽV?åãt1’~?åãŽk]"?åT Tãò?åT$Œ¾¡?åÄ•ÂN.?åįø8Û?å5Ù?å50³Ô?奌~’¤?奦°%?å÷½" ?åí?å7˜×}æ?äÿ§L,8?äÿ§f*-ò?äþøш?äþ) âG?äü†Ç~à[?äü†áŽ?äúöu¯GÈ?äúö¼vj?äùfñ~?äùf3›.ÿ?ä÷Õ³&µT?ä÷ÕÍ0§?äöEByŸ½?äöE\€úÔ?äô´ÇŽè?äô´á“ë·?äó$BXŒ?äó$\[{?äñ“²Õ("?äñ“ÌÖ¯;?äðÕl?äð3k?äîru4î9?äîr2’i?äìáÇ#U?äìáá¹?äëQíë:?äëQ(ç¬O?äéÀLšŒ‘?äéÀf’\?äè/€/,z?äè/š% B?äæž©žÛë?äæžÃ’Çù?äå Èè½"?äå âÚ·j?äã|Þ#Nž?äã|øW?äáëéTP>?äáìBfÔ?äàZê­ø?äà[mÒ¢?äÞÉá±=Ø?äÞÉû›p‹?äÝ8ÎèÐ?äÝ8èÑå?ä©oö‡~Â?ä©p/rE?ä§Ý›ãp?ä§Ý´»ãW?ä¦K6?QË?ä¦KOã^ ?䤸Ⱥ`?䤸á¹Òë?ä£&P¤×ˆ?ä£&jDüT?ä¡“ÏìfX?䡓銗Y?ä Eô:?ä _Ce?äžn²ÁyÃ?äžnÌ[à ?äœÜZmù?äœÜ/òÃU?ä›Ip´Ð?ä›IŠK1g?䙶Áк@?䙶Ûe'Ÿ?ä˜$ Á¨V?ä˜$#T!¦?ä–‘HQø?ä–‘b×-?ä”þ~9ex?ä”þ—Çö‡?ä“kªËƒ­?ä“kÄX ‹?ä‘ØÎI\V?ä‘ØçÔö?äE踙Ó?äFAN,?䎲ú¢|?䎳–b?ä N¡š?ä ÓmA?䋈»ƒ?ä‹ ’À?ä‰ù÷Ñ"?ä‰úDsê?äˆfå¾?äˆfþƒ¬Z?ä†ÓÉQè±?ä†ÓâÎân?ä…@¤°Â#?ä…@¾+ÇI?䃭w&Þ ?䃭Ÿî?ä‚@«‘?ä‚Z".j?䀇=ÇÚ?䀇²îû?ä~ó¸ñª?ä~óÒdÂ?ä}`gÌ‚?ä}`=N?ä{Í Òë|?ä{Í'B45?äz9« ´`?äz9Äy5?äx¦?{ýœ?äx¦Xç\ƒ?äwË)tu?äwä’Þb?äuN Qˆ?äugrÆq?äsëÈ"@1-ÞJ?ä>@JP¹Œ?ä<«„äÍž?ä<«ž²c?ä;Ћ`?ä;éª ž?ä9‚&V*?ä9‚-CMØ?ä7íO»×?ä7íhÖØ ?ä6XƒE™?ä6Xœ^?ä4îÃ@¦?ä4ÃÇÚTf?ä3.ÒF^Ú?ä3.ë[{á?ä1™íÓÔ?ä1šæúF?ä0q'?ä0‚V’?ä.p #ºA?ä.p&2òä?ä,Ûðò7?ä,Û)þ3ú?ä+F ÞYÐ?ä+F%餩?ä)±å´õ?ä)±ïÛ?ä(í=7?ä(š ?ä&†ÑU¯Õ?ä&†ê[¶?ä$ñ­Óc³?ä$ñÆÖÒƒ?ä#\‚†Â ?ä#\›ˆ9Ã?ä!ÇOuB‚?ä!ÇhtÃ?ä 2¤;á?ä 2-¡ÅF?äœÒK?äœë©y?ä‡Î%Z?ä ÇÀG?är5ÄÀÿ?ärN¼d¢?äÜÜ ?äÜõÄa?äGz©šé?äG“OÚ?ä²¢ ö?ä²*”^€?ä ü“ò?ä¹ìZ ?ä‡(¼Ðt?ä‡AªŸ?äñ¨èÁl?äñÁÔ˜‰?ä\!{?ä\:dß•?äÆ’u¼?äÆ«]µ?ä 0ûåÛÒ?ä 1ËÌ,?ä ›]Òš·?ä ›v¶“h?ä ¸@½£?ä Ñ"¾¢?äp 5Ñ?äp$š?äÚV¶v¨?äÚo”ˆ'?äDšÈÔ?äD³¤íÈ?ä®×g¨ä?ä®ðAʽ?ä ”‘£?ä%l»œ?äƒ:^ ,?äƒS4=?ãí{>ôe—?ãëäõ¢?ãëå_5?ãêN½è¡?ãêNÖ¢µ4?ãè¸'?ã踗ÀÎ7?ãç"9op?ãç"QÇ?ãå‹ì4?ã区ê;?ããõ—îÄ«?ããõ°¡‚G?ãâ_<ÏTd?ãâ_U€l?ãàÈÚ­7í?ãàÈó\Y?ãß2q¶ø?ãß2Š:Š¿?ãÝœlú?ãÝœÕ"?ãÜŠMÃ?ãÜ¢õë&?ãÚo ;(?ãÚo$âÌ?ãØ؇<„¬?ãØØŸáu‰?ã×AûVoê?ã×Bùgö?ãÕ«hŽä?ãÕ«/?ãÔÎèÙ¬?ãÔç‡ßÿ?ãÒ~.kÕÎ?ãÒ~Gã7?ãÐ燳ˆ?ãÐ矮Çÿ?ãÏPØâ‚I?ãÏPñ{Ä?ãͺ#å!V?ãͺ<|CÎ?ãÌ#h Þ?ãÌ#€¶z?ãÊŒ¥šÖ4?ãÊŒ¾.?ãÈõÜXHÞ?ãÈõôé€?ãÇ_ ^L?ãÇ_$í½d?ãÅÈ5²¢–?ãÅÈN?ç?ãÄ1XQ¨¾?ãÄ1pÜôs?ãšt=Öú?㚌Ç)r?ãÁ‰ƒ«?ãÁ¢ öÝ?ã¿l˜(56?ã¿l°­•?ã½Õ 0É?ã½Õ¸´/ª?ã¼>¡¢šˆ?ã¼>º$·?㺧œ‚Ê?㺧µ>W?ã¹Ö“É?㹩T"?ã·y~›C±?ã·y—Ä“?ãµâeÓ6?ãµâ~L½f?ã´KFŠˆc?ã´K_??ã²´ Æiä?ã²´9;þ1?ã±ô‹øà?ã± ÿ“•?㯅Áàx¢?㯅ÚR¹?ã­îˆÉÆ?ã­î¡8¬5?ã¬WIJ¿>?ã¬Wa¸lþ?ãªÀcb§?ãªÀÏ°?ã©(·d²?ã©(Ïü?㧑dl† ?㧑|ÔF?ã¥ú mäâ?ã¥ú#Ó«–?ã¤b¬±?ã¤bÄ‚}ì?ã¢ËF„?ã¢Ë^åÙ?ã¡3Ú£ @?ã¡3óâY?㟜h€Þè?㟜€Þ¾?ãžð–©?ãžw{Ý?ãœmqudž?ãœm‰Ï²½?ãšÕìšÎ•?ãšÖò¿Ç?ã™>aÀÝ?ã™>yå¸?ã—¦ÐYÈÞ?ã—¦è­Åï?ã–8þI?ã–QP=?ã”w›‡Ñ?ã”w³Ñ¡?ã’ß÷é}§?ã’à7ŒL?ã‘HN4I.?ã‘Hf€] ?ã°žd“ ?ã°¶®­C?ãŽè…eb?ãŽÍ…W?ãŒ,›×„?ãŒDáý/?ãŠéj¬÷Ù?ãŠé‚ñ#3?ã‰Q¢½íò?ã‰Q»ó?ㇹÔÓÐÐ?ㇹíq?ã†"ó®‚?ã†"1ê¼?ã„Š'H‡?ã„Š?XŠS?ã‚òGPsn?ã‚ò_ŠºÃ?ãZašÐš?ãZyÓr?ãÂvn_?ãÂŽ6À²?ã~*„†hÜ?ã~*œºÀ¢?ã|’1Ä?ã|’¥d!B?ãzú å?ãzú¨8}?ãyb ¼?ãyb¥;w²?ãwÊ„A?ãwÊœm…d?ãv2u¦²R?ãv2Ñ$î?ãtšaH#Ø?ãtšyp›½?ãsG*y ?ãs_PöÇ?ãqj'RÊ?ãqj?wLñ?ãoÒÆN?ãoÒè â?ãn9Ö‰rl?ãn9î©ÿ,?ãl¡¥¡á#?ãl¡½Às?ãk oÌ^?ãk ‡+cb?ãiq2Ó= ?ãiqJíÙ'?ãgØðù,Ì?ãgÙ Íö?ãf@©…›ò?ãf@ÁœB%?ãd¨\}”´?ãd¨t’?ê?ãc æë?ãc!øÐ?ãaw±Ä=Š?ãawÉÔò°?ã_ßTì"?ã_ßl+¦5?ã^FðïÿÞ?ã^Gü¾×?ã\®ˆ@†»?ã\® KJ”?ã[Ç?ã[2 åy?ãY}¦{ÓÒ?ãY}¾‚¡V?ãWå-p¥Ç?ãWåEux?ãVL®ûƒ°?ãVLÆþZÅ?ãT´+!‚²?ãT´C"^…?ãS¡çU?ãS¹æmß?ãQƒMÉF?ãQƒ+J®?ãOêWjé?ãOê—RTÎ?ãNQæ µä?ãNQþ¤l?ãL¹Gu¤L?ãL¹_l—q?ãK £”: ?ãK »‰1Æ?ãI‡únj¬?ãIˆaf÷?ãGïL (g?ãGïcú);?ãFV˜izr?ãFV°XÊ?ãD½ßÀ•?ãD½÷|Êi?ãC%!J?ãC%9jXX?ãAŒ^AÄ?ãAŒv*(}?ã?ó•Ún?ã?ó­Á(?ã>ZÈO0Ê?ã>Zà4LN?ã<Áõ¥mµ?ã< ˆ–?ã;)á­þ?ã;)5ÂÒ4?ã9Að3?ã9Xè¹?ã7÷_î¡?ã7÷vùp?ã6^x Ž?ã6^ù< ?ã4ÅŒóW?ã4Å£ñ(¦?ã3,›ŽÛ?ã3,²åÈa?ã1“¥к?ã1“¼Üo?ã/úªŸ ?ã/úÁØàì?ã.aªíl?ã.aÁá3p?ã,È¥*¦’?ã,ȼùð³?ã+/›VÓ?ã+/³$!=?ã)–Œ—ýí?ã)–¤cP8?ã'ýxöl?ã'ý¿Âj?ã&d`wb?ã&dx>j¾?ã$ËCÍ?ã$ËZä+ë?ã#2 òŒW?ã#28µî«?ã!˜ù÷4?ã!™¸šX?ãÿÎ1®c?ãÿåñ™?ãf£T ?ãfµ`¾?ãÍhO¼á?ãÍ€ .á?ã4.>î,?ã4Eød?ãšïuË’?ã›-EC?ã«ù/]?ãî¬Þ?ãhcÎ÷?ãh{†B?ãÏù'?ãÏ.ª¬?ã5ÅxZ?ã5Ý/)?ãœob§Ÿ?㜇4'?ã¦a#?ã,Qñ^?ãiµRY!?ãiÌûí ?ã ÐQkn?ã Ði–?ã 6èöut?ã 7œ§?ã {øK?ã “›éß?ã uÔ$?ã"vŠ?ãj”sâ,?ãj¬ˆ#?ãÑôp)?ãÑ1’¬?ã7šûMð?ã7²–úù?ãžÚg?ãž/)Šò?ã¶äV?ã§N˜\?âþkuO,?âþk ¨?âüÑrÏæì?âüÑŠc¡Ø?âû7ÝË„à?âû7õ]C6?âùžDmó?âùž[ü¯?âø¦¶ŸÁ?âø¾DdÝ?âök¬;?âök8?âôÑ^Tð?âôÑuÞ»Ð?âó7³µŒt?âó7Ë=[?âñžÒàœ?âñžX³?âðQ±»J?âði5÷?âîjšVñ=?âîj±ØÊ*?âìÐÞÇJÓ?âìÐöG&û?âë7cÓ?âë76ƒC0?âé[.V?âér‘ä?âè’ým?âèªwRÂ?âæiÆÂð«?âæiÞ:Ù‹?âäÏöj„ú?âäÐ àpû?âã6!øðœ?âã69lߺ?âáœIs}?âáœ`äù±?âàl݆2?âà„M{x?âÞhŒ;OÜ?âÞh£©H0?âÜΧr4?âÜξüm?âÛ4¾ãhç?âÛ4ÖMgE?âÙšÒ8õ[?âÙšé ö·?âØá•æ(?âØøûê~?âÖfìþùð?âÖgc:?âÔÌôxõ1?âÔÍ Úÿj?âÓ2ø¢W?âÓ3h¯{?âј÷±Ñ?âÑ™/Ú?âÏþóv’ñ?âÏÿ Ò¥Û?âÎdë_1~?âÎe¹GD?âÌÊßo±E?âÌÊöÇÉâ?âË0ϬÜ|?âË0ç÷ì?âÉ–¼q?âÉ–ÓoM?âÇü¤À/!?âÇü¼P'?âÆb‰ŸÙ?âÆb ïüá?âÄÈj½Ò¤?âÄÈ‚ ù.?âÃ.HT±?âÃ._j}ö?âÁ”!ÇL?âÁ”9xŒ?â¿ù÷½v¦?â¿ú¥T?â¾_ÊŠX?â¾_áK»³?â¼Å˜¤Då?â¼Å¯èxé?â»+cžb&?â»+zà˜Î?⹑*ø•N?⹑B8Ζ?â·ö˜?â·÷ôÐ{?â¶\®Ü¯Ì?â¶\ÆîF?â´Âkp‚?â´Â‚ªÃ?â³($vÇ*?â³(;¯ Ä?â±Ùô2K?â±ñ*xn?â¯ó‹íxÓ?â¯ó£!Á|?â®Y:gR^?â®YQ™ˆ?⬾åfmé?⬾ü–»?â«$ŒîĨ?â«$¤Æ?â©Š1¹[?â©ŠH1 í?â§ïÑ­«°?â§ïèز?â¦UnîHq?â¦U†ŸÞ?⤻Ë>ž?⤻ñ˜r?⣠ŸIC ?⣠¶mŸ@?⡆2l÷?⡆IU´?âŸëÂ;°?âŸëÙ[x¡?âžQN·ßÝ?âžQeÖC$?✶×çÅ?✶ï* ?â›]ÏÞ?â›têEì?â™àtÌX?â™÷6‹?â—ç_ÛIF?â—çvñµ¿?â–LÜïô?â–Ló^¯?┲TÿvÚ?┲lçÔ?â“ÊÆ„²?â“áÖ÷æ?â‘}=a•j?â‘}Tp Ô?ââ¬Õ;v?ââÃá³?âŽH&>È?âŽH00¸”?⌭‚YK4?⌭™aÇ+?â‹èsf?â‹ÿy~„?â‰xKx”?â‰xb|ŽÕ?â‡Ý«m ~?â‡ÝÂoÞ?â†CV«±?â†CW0-?ℨb9§I?ℨy8-Ý?⃠¹›}?⃠Ð$$?âs þ†?âs#ø¦>?âØ]èÄ„?âØtáQI?â~=«ß9N?â~=ÂÕÈ?â|¢öæÌ?â|£ Ú¨Ÿ?â{?ü?â{UôS?âym„7”\?âym›()/?âwÒÆ‹Ö@?âwÒÝzm ?âv8{¹?âv8ð}?âtB¢Ä&?âtY^Ý?âs|nVñ?âs“Vó˜?âqg³jËê?âqgÊQj~?âoÌ眵ð?âoÌþVl?ân2»Î?ân2/ë^1?âl—G³q-?âl—^”q?âjüs¢5?âjüŠ€»X?âiaœÙ}k?âia³¶%i?âgÆÃ]¨??âgÆÚ8R?âf+ç3'x?âf+þ Ó#?âd‘^??âd‘5J»?âbö&ä‘€?âbö=¹@Ë?âa[BÉ£–?âa[YœT«?â_À\ja?â_Àrã>?â^%rÄ^?â^%‰“·?â\Š†äa¤?â\Š±?âZï˜v:©?âZï¯@òÉ?âYT§~w+?âYT¾G1?âW¹´§O?âW¹ÊÈbâ?âV¾dy?âVÔÉ!À?âTƒÅ‹4ò?âTƒÜMóë?âRèÊš«Ï?âRèá[lw?âQMÍ8’?âQMã÷Th?âO²ÍiÉ´?âO²ä&°?âNË1àt?âNáì¦?âL|Æ•`š?âL|ÝN'Ý?âJῘ֎?âJáÖOŸp?âIF¶@ÉÔ?âIFÌõ”S?âG«ª‘Π?âG«ÁDš¹?âFœf'?âF³A3×?âDuŒB“×?âDu¢ñc?âBÚy­b¦?âBÚZ3z?âA?dÔ ä?âA?{~ÜG?â?¤M»´?â?¤dcç£?â> 4g X?â> K áÏ?â»Þ?áýÇ•ÆÕ?áü+… »ˆ?áü+›^Ç©?áúZãJ?áú4­ð”?áøô¶6 ó?áøô̇¯c?á÷YL¤A†?á÷YbóQ?áõ½á©>€?áõ½÷öO9?áô"uGl™?áô"‹’~s?áò‡ƒ:?áò‡ÌM?áðë˜a>?áð뮨&W?áïP'åcø?áïP>*y-?áí´¶™p?áí´ÌW¯À?áìBóÝ?áìY46F?áê}Έx?áê}äÇ?áèâXÚ$-?áèâo=Ä?áçFáéÎç?áçFø$é’?áå«i»Ú«?áå«ôöi?áäðT¯n?áä‹Ì>?áâtu¸µo?áât‹íÓN?áàØùìNd?áàÙmR?áß=|óäý?áß=“%ø?áÝ¡þ×9ò?áÝ¢Zù?áÜ›Õ?áÜ•È÷?áÚjÿC&ø?áÚknJ?áØÏ}Ñ™f?áØÏ“ú½‡?á×3ûK†®?á×4r«Õ?áÕ˜wµSà?áÕ˜Úz ?áÓüód­?áÓý 6‹Ü?áÒamj?áÒaƒ‹EC?áÐÅæÁf”?áÐÅüàÇ?áÏ*_ç§?áÏ*u<Ù?áÍŽÖƒÓØ?áÍŽìžÿ ?áËóLôŽ?áËóc ºF?áÊWÂutŠ?áÊWØŒ¡´?áȼ7 à‚?áȼM ¨?áÇ ª¹/?áÇ ÀÌ^:?áÅ…„ÆW?áÅ…3•öo?áÃéuÅS?áÃ饄öc?áÂN‘Õ‰?áÂNŸ?áÀ²pÙÿB?áÀ²†å2>?á¿àR›„?á¿ö[Ïu?á½{Oª?á½{e8?á»ß¼æ™î?á»ßÒëÏÆ?áºD* ±y?áºD@ èB?Ḩ–pŸ‚?Ḩ¬q×?á°žª¥Í?á°žÀ â/?á¯s¢º?á¯(hà?á­gz2´õ?á­g%ó.?á«ËáX,ú?á«Ë÷Il?áª0Gì’:?áª0]ÛÒG?ᨔ­õµt?ᨔÃâöj?á¦ùt,¬?á¦ù)_nŠ?á¥]xlJã?á¥]ŽU©?á£ÁÜâaÈ?á£ÁòÉ¥u?á¢&@ÚÅ?á¢&VÀ ™?á Š¤YÈ?á Šº= ?ážïc±ž?ážïD÷ü?áSj@ø?áSàˆ;?á›·Ì8M?á›·â•,?áš. >A?ášCä‡L?ᘀxh2?ᘀ¥Q² ?á–äðŠ?á–åa[ì?á•IQB‹t?á•Ig×(?á“­±¦!‹?á“­Çyn ?á’¹³?á’'Šm)?ávq„k?áv‡S¹Y?áŽÚÑ îi?áŽÚæÛ=¢?á?0Uß?á?F!/)?á‹£`ž?á‹£¥)Þ˜?áŠî28t?áŠùŠN?áˆlLÏ/)?áˆlb”ã?á†Ð«;¼˜?á†ÐÀÿ1?á…5 |#q?á…5=wé?კg™wæ?კ}XÍ>?áýÅ™µ¼?áýÛW ó?á€b#|Þ?á€b985.?á~ÆG8?á~Æ—?á}*Þý$?á}*ô´h÷?á{<¢žÞ?á{RWø?áyóš<4¶?áyó¯ïF?áxW÷Îï?áxX k^?áv¼Uaq&?áv¼kÍs?áu ²üZž?áu È©·É?ás…ž©ˆ?ás…&J’?áqénL5?áqéƒõü?ápMÌ s™?ápMá±Óa?án²)Üv¾?án²?×e?ám‡ÆÙr?ámj:÷?ákzåÍè ?ákzûoJq?áißCû W?áißYšnš?áhC¢TO'?áhC·ñ³J?áf¨ÙaÝ?áf¨tÆà?áe _Žƒz?áe u'é\?ácp¾wïJ?ácpÔV ?áaÕ™Ý?áaÕ3/E2?á`9|ø”u§Æ0ˆ?á>u½/«è?á<Ú¼.?á<Ú&l8{?á;>zè´¬?á;>N1ç?á9¢åvS7?á9¢úÙÑ`?á8P±¿ ?á8f>#?á6k¼¥Ë?á6kÒÓ?á4Ð)V…ˆ?á4Ð>´‚?á34–Å ?á34¬ ¡ý?á1™õS?á1™N‰2?á/ýsêk&?á/ý‰Aîú?á.aã©yg?á.aøþþ/?á,ÆT6a2?á,Æi‰æð?á+*Å•Mõ?á+*ÚæÔ«?á)7Ðuý?á)Mýª?á'óªî)Ô?á'óÀ;²{?á&Xí;Î?á&X48Åo?á$¼“ÑÕs?á$¼©`?á#!   •?á#!ç¬.?á!…€\E¯?á!…•¡ÒF?áéø r~?áê N?áNp®Ì¿?áN…ð[T?á²êSµÏ?á²ÿ“Ef?ádÿ‚Ü?áz=v?á{à°ãƒ?á{õìu ?áà]kû¯?áàr¥ŽR?áDÛ4ñ7?áDðl„à?á©ZêG?á©oE~ø?á Ú ?á ï4Ÿ¼?ár[ xË?árp>?áÖÝ<¹Ô?áÖòlQ¤?á;`˜3à?á;uÅ̾?á ŸåjØ?á ŸúIÄ?á jÐ{z?á úw?á hñµ‹?á iÝ'?áÍyл°?áÍŽöXÓ?á2&0?á2IÎ??á–º Ü?á–¢Ûª*?áû–ðX?áû.¶½?á_¦ÃU0?á_»àö®?àÿÄ5=”>?àÿÄJY6Ø?àþ(Å ËQ?àþ(Ú#o?àüV,à?àükC»¶?àúñ訚9?àúñý¾@/?àùV|ƒpÃ?àùV‘—Û?à÷»À¹w?à÷»&Òa²?àö¨kEË?àö½zï,?àô„@‰‹?àô„U—5›?àòèÚ½€?àòèï%i1?àñMuøÀ?àñMŠ)¥œ?àï² W"?àï²&¨*?àö„?àîĤ¥º?àì{Oóp?àì{d#£×?àêßð'eÍ?àêà)f?àéD’À<¬?àéD§¿ïy?àç©6ðÿ®?àç©Kî³±?àæ Ü·½\?àæ ñ³r—?àär„ˆÀ?àär™?5?àâ×-€œ?àâ×B8N?àá;׸µL?àá;ì®n?à¥Í£EXï?à¥Í·ñF;?à¤2™H:*?à¤2­ò)?ࢗ‘œÇ$?ࢗ¦D·ª?à üŒG5?à ü ìò]?àŸa‰JñJ?àŸaîå?àƈ¬¡³?àÆN—'?àœ+Šw½ñ?àœ+Ÿµ?àšŽ³¡?àš£Pÿl?à˜õ•[µq?à˜õ©÷¯í?à—ZžuÐ|?à—Z³Ì«?à•¿ª_»?à•¿¾] ?à”$¸co?à”$̤c?à’‰È”Ý¯?à’‰Ý(ß ?àîÛœØâ?àîð.Ûþ?àSñ2k?àTÂI?๠[f°?à¹émU?àŒ$âœ?àŒ8¡ë ?àŠƒAeŒË?àŠƒUï—?àˆèaNe?àˆèuÖq*?à‡MƒÔp‰?à‡M˜Z~f?à…²¨û¬=?à…²½»ñ?à„ÐÈì?à„åJ*z?à‚|ûE›?à‚}Å®ú?à€â({Ò?à€â<ù?àGXeWh?àGlán—?à}¬‹?à}¬Ÿ‚©*?à|ÀhªN?à|ÔàÅN?àzvø‰¦*?àzw ÿÃ?àxÜ3o€×?àxÜG㟶?àwAq6/?àwA…W?àu¦±¡ÇÔ?àu¦Æê ?àt õA?àt o5 ?àrq;8î$?àrqO¥ë?àpÖ„MZ®?àpÖ˜·ƒx?ào;ÐBU½?ào;䪀Ž?àm¡Ü7?àm¡3‚ ?àlpÝà$?àl…B ?àjkÅŒcÀ?àjkÙ?àhÑ3zø?àhÑ1“®?àg6wÚ ?àg6Œ8@0?àe›Õ|Õl?àe›éÙ °?àd6Ôý?àdJza?àbf™Ç?àbf®;›?à`ÌvR?à`ÌÌÅ?à_1j1½"?à_1~…üý?à]–Öý6Å?à]–ëOxÐ?à[üFäù ?à[ü[5=K?àZa¹ïía?àZaÎ>3Õ?àXÇ0·A?àXÇDfÿð?àW,©iNw?àW,½³™e?àU’%ߣ,?àU’:'ð]?àS÷¥­¯?àS÷¹Çý&?àR](Sf?àR]<—¸R?àP®X¸j?àP› {?àO(7õð?àO(KÞLS?àMÄ*7?àMØhið?àKóSù’-?àKóh5íB?àJXçl?àJXûJÉ{?àH¾}r?àH¾‘ªîé?àG$#óË?àG$+ZV?àE‰´(Œ?àE‰È\æ4?àCïT„2å?àCïh¶™ü?àBTøChä?àBU sÒo?à@ºŸmV?à@º³›…Y?à? Iý´Š?à? ^*# ?à=…÷ù1?à=† #¢?à;ë©ctr?à;뽋çö?à:Q^@uÀ?à:QrfëÌ?à8·”!N?à8·*¸™ç?à7Òb^ø?à7æ„Ú#?à5‚‘·µ?à5‚¥Ø2Ö?à3èT›6?à3èh¹˜?à2Nã`?à2N/%fY?à0³å‘?à0³ù‹-?à/²“f"?à/Æ«îf?à-ƒ·òü?à-—Î}ë?à+åXvšL?à+ål‹'ì?à*K0ÓEÃ?à*KDåÖ?à(± Ú‡?à(± ë?à'ì“d?à'¡ùÌ?à%|Ïúp?à%|ä³þ?à#â·”Æ?à#âË0?à"H¡àºÓ?à"HµéXõ?à ®huŽ?à ®¤o€?à‚­°L?à–²T?àzx´Qó?àzŒ¶ø“?ààr‰B?àà†‰¬À?àFp2Ê?àF„1vx?à¬q­ÔŠ?ଅªƒÓ?àvþ¢?àŠø´Ø?àx€'V?ß~-Qø60?ß~-yƒ?ßzûAh_Ž?ßzûhL?ßwÉ:w˜"?ßwÉaŠŒç?ßt—=-Š?ßt—d<‡(?ßqeI‘ä¾?ßqepœê&?ßn3_¬G?ßn3†³TÍ?ßk—'Œ?ßk¦š=Æ?ßgÏ©`ï8?ßgÏÐ` î?ßdÝ–§?ßdžû½å?ßal}Àå?ßalAtð·?ß^:aà»?ß^:ˆÓP-?ß[³/<4?ß[Ú}T?ßW×rÎJ?ßW×5^#?ßT¥s²y.?ßT¥š™ËÍ?ßQsãÆÖ?ßQt ì"G?ßNB\„%u?ßNBƒc‰Ä?ßKàtü?ßKöâ6?ßGßmÖLƒ?ßGß”­Âµ?ßD®¼NB?ßD®,Íy?ßA|§Õ!y?ßA|Τ©Á?ß>KT(]$?ß>Kzóî‰?ß; ½ P?ß;1…:à?ß7è˯™G?ß7èòs=?ß4·— ¾?ß4·½Ìk?ß1†lËý?ß1†“‡z?ß.ULôF*?ß.Us¬å?ß+$7Þ¦?ß+$^A§Ì?ß'ó, +‹?ß'óSOþ)?ß$Â,2ÅŒ?ß$ÂRÞ¡¯?ß!‘6MGn?ß!‘\õ-$?ß`K v"?ß`q®ew?ß/jxÓÃ?ß/‘ÌÅ?ßþ”Žðq?ßþ»*ó-?ßÍÉTfÜ?ßÍïìs_?ßÐÏ ?ß/dåx?ßlS »Æ?ßly›Ûÿ?ß ;¨ ÄV?ß ;Θî?ß Û€Ô?ß .c´ú?ßÚr’Î’?ßÚ™ Â?ß©èA/"?ߪÁwi?ÞþyhÝÕ?ÞþyYoB?ÞûHôn(7?ÞûIæ„×?ÞøŠûæÄ?Þø±pM¥?Þôè,éî?ÞôèRþ[?Þñ·Ù+Â?Þñ·ÿ˜=¨?Þî‡Üûª?ÞEŸ?ÞëWS¼˜”?ÞëWz!)?Þè'!Ùž?Þè'H9·?Þäöû(á}?Þä÷!…‡?ÞáÆß³s¸?ÞáÇ #à?ÞÞ–Ï€fR?ÞÞ–õÕ!)?ÞÛfÊ—@´?ÞÛfðèI?ÞØ6Ðÿ•U?ÞØ6÷Le´?ÞÕâÀñ?ÞÕ ÌL?ÞÑÖÿö]ú?ÞÑ×&;D?ÞΧ(®r$?ÞΧNïc’å,?ÞÁèdÄ«?Þ¾¸ òº¹?Þ¾¸Çãv?Þ»‰ñ!ú?Þ»‰5V?Þ¸Yˆ©r-?Þ›¯ã­˜É?Þ›° ¯@ñ?Þ˜€Ô&88?Þ˜€ú#ìO?Þ•QЪ<æ?Þ•Qö£üù?Þ’"ÙA"Š?Þ’"ÿ6îª?ÞŽóíòhB?ÞŽôä@}?Þ‹ÅÅ’0?Þ‹Å4³v•?Þˆ–;Âf?Þˆ–a¬?Þ…guZÊ?Þ…gšéW±?Þ‚8º—æX?Þ‚8àyï–?Þ u«‰?Þ 2SÁ/?Þ{Ûj¤. ?Þ{Û~P)?Þx¬Õ*é?Þx¬û©?Þu~LV™?Þu~qã‘Ñ?ÞrOÏ^÷T?ÞrOõ-?/?Þo!_AÈ?Þo!„å–W?Þkòûa˜ï?Þkó!'úB?ÞhĤ@ˆ?ÞhÄÊ ®?Þe–Y®(Ã?Þe–l£Ì?Þbh±±î?ÞbhAl9é?Þ_9êR³Ä?Þ_: HÂ?Þ\ Ř©h?Þ\ ëKKw?ÞXÝ­‹™?ÞXÝÓ9´Ê?ÞU¯¢1Eã?ÞU¯ÇÜE?ÞR£¦Ø?ÞRÉM¡²?ÞOS±ú^:?ÞOS×5.?ÞL%Í!š½?ÞL%òÀ?ÞH÷õ$ ?ÞHø¾úÑ?ÞEÊ* ‘?ÞEÊO Ø?ÞBœkØD2?ÞBœ‘kQ ?Þ?nº˜þB?Þ?nà(¼?Þ?ÞǨøÈÒ?Þ š¦|c^?Þ šËÌ`›?Þ mÖÖíà?Þ mü"ùÖ?ÞAÐ?ÞA:+Â?Þ`v|˜?Þ…º¦3?Ýÿ繿¶Y?ÝÿçÞÿîà?Ýü» ³.æ?Ýü»Eïvj?ÝùŽ•XH”?ÝùŽºŸ&?Ýöb¶p‚?Ýöb<êÖ4?Ýó5§Õ¼?Ýó5͇ž?Ýð E»”k?Ýð jèŽ?ÝìÜñ…?ÝìÝ®0?Ýé°«AÝó?Ýé°Ðf€Ì?Ýæ„råÈ0?Ý愘z?ÝãXHxÆ”?ÝãXm•ˆi?Ýà,,Ar?Ýà,QÞ?Ý݉š:?ÝÝBž{P?ÝÙÔ;‹?ÝÙÔB',\?ÝÖ¨*¯‰4?ÝÖ¨O¼‰Ñ?ÝÓ|Fq1?ÝÓ|kzAŽ?ÝÐPpiåm?ÝÐP•o×?ÝÍ$¨T?ÝÍ$Í>¾?ÝÉøîè ‰?ÝÉùåM?ÝÆÍC|H?ÝÆÍhu™ ?Ýá¦S"a?ÝáËHƒ8?ÝÀvsü7?ÝÀvzü ?Ý^Lbò‰*?Ý["‹]_Ž?Ý["¯ÐÿA?ÝWøç£)?ÝWù Ûu?ÝTÏSh'Í?ÝTÏwÓìç?ÝQ¥Î»?ÝQ¥ó"èð?ÝN|Y‘ ‚?ÝN|}ôøO?ÝKRóñs\?ÝKSQq ?ÝH)ã™?ÝH)Â?©ê?ÝEWnË“?ÝE{Æï~?ÝA× šcž?ÝA×Dîš¹?Ý>­ùm¬?Ý>®½öf?Ý;„âyb?Ý;…P×?Ý8[Úm~ ?Ý8[þµïÃ?Ý52ââ?Ý53âg>?Ý2 úœò#?Ý2 ÝŠW?Ý.á"r3?Ý.áF®¬ ?Ý+¸Z$]V?Ý+¸~]ê?Ý(¡»V(?Ý(Åð)Š?Ý%fù>6R?Ý%go–?Ý">`ÈØ?Ý">„õÓK?ÝØií?Ýü’üV?Ýí`?Ýí„;°|?ÝÄ÷Ö 3?ÝÅ÷AÃ?ÝœŸ¯±?ÝœÃÌüÛ?ÝtWªÌŒ?Ýt{Ä,º?ÝLΫÂ?ÝLCä ]?Ý #ø"–à?Ý $4ý?ÝûàÂd%?ÝüÐØ?ÝÓÙ¼ÇB?ÝÓýÆyž?Ý«ãÔÔ?ݬ ›ï?Üÿƒü§Ö?Üÿ„ ©²|?Üü\&§o?Üü\J¥ C?Üù4a æ†?Üù4…ìU?Üö «Ý†¤?Üö ÏÓ¡ƒ?Üòå#C?Üòå+s ?Üï½røïÂ?Üï½–ç4ý?Üì•ïm<‚?Üì–W— ?Üén|u;*?Üén [«?ÜæG4X?ÜæG=ú¹¸?ÜãÈ]nÿ?Üãì< ê?Üßø‡L4?Üßø«&å(?ÜÜÑVëÉY?ÜÜÑz˜?ÜÙª7CqØ?ÜÙª[Mà?ÜÖƒ(o²?ÜÖƒL=ö™?ÜÓ\*}.¿?ÜÓ\NH6˜?ÜÐ5=bûì?ÜÐ5a*Í?ÜÍa'³8?ÜÍ„êç7?ÜÉç•Ò˜x?ÜÉ繑â¨?ÜÆÀÛjñc?ÜÆÀÿ&QÛ?ÜÚ1ø:?ÜÚU¯x?ÜÀs™ §?ÜÀs½4˜ë?ܽM!á¥?ܽM5Ñ…o?ܺ&›é/³?ܺ&¿”ê?Ü·6Ëÿ?Ü·ZsÐ4?ܳÙâÑ‘?ܳÚuxí?Ü°³ ,?Ü°³Ã¡*×?Ü­nbv?Ü­‘þ%?ܪgMû}€?ܪgq“ª0?ܧA>Ô¶ø?ܧAbhúÃ?ܤA †3?ܤd™á/?Ü õT¨—?Ü õx5 a?ÜÏy¦ó‰?ÜÏ/}(?Üš©° Úˆ?Üš©Ó{š?Ü—ƒ÷ÞŒ 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð$?ïÿÐHä<ð?ïÿpÛ^#O?ïÿÐI)q?ïþá¸Ð‰Ž?ïÿA%·à?ïþ"ãO¦›?ïþ‚M»¼Ó?ïý4]¡@?ïý“ŽÊz?ïü+;x§?ïüu’¹&?ïúÈPFþ)?ïû'²b’ù?ïùJÑœ®ü?ïùª0{|?ï÷´ÆžÃ?ï÷ý“P?ïõÀÿÿ¼ ?ïö U£×¥?ïó´º3«ú?ïô ÃýÄ?ïñxêþ¡’?ïñØ6J?ïï š­1O?ïïlß´f ?ïìrÒ< l?ïìÒÎ*t?ï騛X0i?ïêÒÿoð?ïæ¯]æb?ïç0¤Óí?ïㆠYNw?ïãå4Ê|h?ïà-Ë»?ïàŒë+×G?ïܦHÍ€y?ïÝ`3Uó?ïØï’ɬ?ïÙN ú$†?ïÕ ¶Á¸?ïÕh»GÝZ?ïÐôÃ+:‰?ïÑS½’8™?ïÌ°Ç)‘?ïͶü·­?ïÈ=ÒŠb?ïÈœ·XLè?ïÛõÕB?ïÃúÏ"ÿ0?ï¾ËB*•I?ï¿*‡‰Î?ï¹ËÉe2?ïº*Š\øQ?ï´žbf?ï´üR&>{?ï¯@Ó?«8?ﯟzÌ~?冀|çDî?ïªù#?ï£û¯‚c?ï¤Z:`L_?>"£?ïžqüu‹³?ï—ýó’?ï˜[r»A?T!Å?ï’±²à¡?ï‹E„óŸK?ï‹£Ò…¦?¯:6õ?ï…ìZÔ ?ï}Õën¯9?ï~4«ÇE?ïvÙR±/Ë?ïw7m˜áç?ïo®þÈS?ïp èúÅ?ïhW ¶?ïhµÇ{?ï`ÑË¥?ïa/t C?ïY«ô4?ïY||¤ê?ïQ>y—éb?ïQœ70æ*?ïI1Sª?ïIŽÀ®Í+?ï@ö¡Œ¾D?ïAT6¾™l?ï87Lň?ï8ì·£-ú?ï/ú÷5hn?ï0Xb@Ò?ï':ËV‹?ï'—V~ï?ïLt3:’?侀[*c?ï2r1J?ïšÁ Í?ï ì'L?ï I-°éº?ïy”Ç ?ïÖŽ+F?îøÚüš9¹?îù7ÞÍ®ã?îïxíìÈ?îïmBÑíå?îå,åÉø?îåvÞ @„?îÚø<ñ`P?îÛTÔïŠÌ?îЪÎ}?îÑL‚†æ?îÆ2HA?îÆŽjhñs? ä˜?î»êTݲž?î°¿’Â¥?î±2³?î¥Åu9N?î¦!+Q“»?îš n‰Ö?îšüf·£I?îQ1c,x?î­ x$ì?îƒ×‰'˜¤?î„3H¹Ô§?îx3ŸU˜?îxB6NÔ?îležèÙ?îlÁ$9#†?î`m² zÚ?î`Éžç?îTLhTw?îT§MÔ?O?îHÁ÷y“?îH[ìÔîÏ?î;ŒCi?î;ç#*Ûû?î.î1bÉM?î/IíS?î"'=øjÅ?î"‚ ¾Ør?î7k2G ?î’·e?îçÈ}‘?îysÔ¯G?íúÝâüMj?íû8Ný+?íítŒ— Ç?ííÎÖS6J?íßãéO?íà=<æ,ª?íÒ)¬ÈÞL?íÒƒ²¢±?íÄH…‘œ?íÄ¢hä‚š?í¶?Ñ"}?í¶™‘‹;]?í¨ÁÝkà?í¨i^ù;3?홸Š¥ÿþ?íš’?í‹:^àb¨?í‹“´;Ù?í|•rp2‡?í|î£Y.¿?ímÉù·dn?ín#Ìþü?í^Ø)•" ?í_1vî?íOÀ7d¦8?íPø²²n?í@‚Xü ?í@ÚôVï?í1Ä«]ï?í1w9´ 7?í!•±:ý^?í!íÿ“G?íçUêä·?í?}4Ut?íêqAÏ?íkêN¡•?ìò¦ùP¨?ìòs ªª?ìáþÄ")4?ìâVt —?ìѽzýŠì?ìÒkÕ?ìÁX¦ì?ìÁ¯cŸUb?ì°ÎœHçÇ?ì±%Ñ¡äÂ?ì !{·Ñ?ì x†Õ§#?ìPÜ0Eœ?짾 RÝ?ì~\úêFª?ì~³²€&5?ìmFä¸q?ìmœŸÜ¨A?ì\ `1Ÿø?ì\bÂ3h…?ìJ°KÇb?ìKUÿ¼Ÿ?ì91zv?ì9‡˜$|•?ì'æ×AF?ì'æÅ꽦?ìÎj>™?ì$‹‹?ìêU\®?ì?Ûw f?ëñä楎?ëò:?Ä#?ëß¾\ìeG?ëàˆ»4æ?ëÍv÷g%Š?ëÍËõ‘ôÇ?ë»õ¨F ?ë»cÅÛâ†?먆—Ÿíî?ë¨Û9‰¸ ?ë•Þš&?ë–2è¿?ëƒÈ=ˆ?ëƒj žµ?ëp-؉í/?ëpí¬Ií?ë]&מ?ë]zujño?ëJ/Ón:?ëJS剎?ë6ºú‚‰Á?ë7€ È?ë#W2;ý:?ë#ª‡HWÈ?ëÕ©ð?ë(=ìx?êü4óÇÌ_?êü‡æó*l?êèwàâ ?êèÉŨZ?êÔ›A?êÔö?êÀ¢Ô¹xŽ?êÀõ2ÕX}?ꬓÉ?ê¬ßIhkì?ê˜Z¬™9?꘬¥ÝÑç?ê„ Æ’®>?ê„]ŒüÇy?êo °Ó5?êoòCÔV÷?ê[¯ß†‡?ê[k¹ü!?êFw !»4?êFÈ6HH?ê1¹2Î?ê2 ý]…!?êßç0²Ð?ê0«Y¶?êëö~ƒÂ?ê<…àkÿ?éòÝy¼8f?éó-ÔQ°?éÝ´·È¾b?éÞÝK±å?éÈq÷¿ëK?éÈÁçìê?é³€ùg?é³e;Œ®²?韛è”?éï½/M?鈰¥'?éˆ_ÜIl.?érh û'?ér·¹3Ù¯?é\¨W(?é\öþµM?éFÏJƒØ‘?éGõ://?é0Þqά’?é1,ådú?éÕÛÏÖ¬?é$"Å?éµÑŠ?éÖ ß®?èî~œ/!³?èîÌhéÒº?èØ0…D?èØ~À‡?èÁËÕæw”?èÂ22&?è«PØ<å²?è«ûöúÜ?蔿Ö M?è• Àñ^á?è~FK?è~eË,\?èg\ì4U_?èg©dÙ9i?èP‹™&]?èP×ØPš_?è9¥j—-R?è9ñp«í?è"ª«&e?è"öv³?è ›¥”ìñ?è ç6ÿ@?çôx¤ÃÛ??çôÃûÕM*?çÝAó³é‘?çÝ6z¢?çÅ÷݃ ?çÆB¿Aö·?箚­nË?ç®åT3ˆ¼?ç—*®ÉÔO?ç—ubBW?ç¨-%ÿ?çò]?2?çhs¯-Ë?çh]hT ?çPlÎbjŒ?çP¶‡BB?ç8´ˆ×wf?ç8þÀpé?ç êîÙü?ç!4/›ÿ?æ©\?æ©ImD,?æÖþoB?æ‘Öö7n?æx›ièú>?æxãu¼)?æ`QÝUò?æ`™6oA?æGù¨ÈÄ$?æH@Ãý77?æ/“bä?æ/Ùö«XZ?æ{>ü?æeq?Ø?åþœ¿U¸?åþâ{³Pê?åæ DMêŠ?åæRfÚ´4?åÍoDVZ[?å͵(T)?å´ÅgG+à?åµ ŽÙw?åœù&›?åœT_û/±?åƒLG¡+ ?僑o ®Ò?åj}é s?åj†)ÍE?åQ£HÔrõ?åQçñÈÑö?å8½”̱"?å9þP³Þ?åÌÎ6°*?å ø&ü&?åÑAqÏ”?å+«ªõ?äíË:ÖÍÉ?äîå8¼?äÔ»¶±ú?äÔþqþv?ä» ñY¹T?ä»ä¦&i?ä¢}FþF‚?ä¢À1—ý?ä‰PS×Ôk?䉒ýŽlF?äpd ëÅ?äp\ÍJÉ¢?äVÛû—?äWì_Ü9?ä=”¾ëôø?ä=Ö¦ÚѪ?ä$E¡ž Ð?ä$‡H¹×Ì?ä î·¾î­?ä 0ëœ?ãñM+@.?ãñÑrKÝi?ãØ*­­«P?ãØk‘§[Z?ã¾¾$ýù|?ã¾þǵû??ã¥JþÀ¯?㥋`Jð?ã‹Ñ†ƒQo?㌦j?ãrRÁ?ãr‘æ|"?ãXÌÍÜg™?ãY jŽ +?ã?B$ ÆÐ?ã?Ü¡?ã%²UÁf>?ã%ñnÞ·L?ã ­ØJ­?ã \… 4Q?âò„weuC?âòà “èj?âØæýNŸ?âÙ%Pd÷?â¿EŠ[¢?⿃›EE(?⥠i;>ˆ?â¥Þ7ã«#?â‹÷ä|Ä›?âŒ5pÐ1‡?ârLF’®?âr‰}M ?âXÙÎl?âXÚá>ºf?â>ìèey›?â?)­HÄË?â%9¼jÚ9?â%v>¯¯?â „ŸÑO•?â ÀßfkA?áñÍÜj?áò Ù?d?áØ»äL·?áØQuéI?á¾\‡Ì4a?á¾—þñ¿?ᤢ‰Š°¢?á¤Ý½Áæç?áŠè dŸý?á‹"ûŸ%è?áq-SzKc?áqhªJ6?áWr­Æ×Ö?áW­Þüè?á=¸b½E?á=òŠ8â?á#þ¹4BÈ?á$8öÆù?á Eû?á ¿Ž?àðŽq‹dÿ?àðÇÏÉ¥?àÖØciE§?à×~T±?à½$8m„?à½\ðÆó?à£qÚâ7Z?࣪o¾Ï?à‰Áð'+’?à‰ú@ÝHö?àp ž¤Ž?àpL­ÛsÂ?àVj3¶xø?àV¡ýql?à<Âð²¬~?à<úväó?à#­&û?à#VaMWö?à •qñ?à ¶b[?ßßÅÒ`ù‰?ßà3I3 ù?߬–&0Ïm?ß­¸æ?ßyo‘x«x?ßyÛù«7é?ßFR ÀŠŠ?ßF¾’î ?ß?à9à¼?ß«9¢Tw?Þà7Û¿g¨?Þࢭ´ù?Þ­;Ôü?Þ­¥iOŠ?ÞzJ4§Š?Þz³÷ŸÁÙ?ÞGe¨ 2?ÞGÎã|c0?ÞŽ„ð?Þö·eE5?ÝáÃÑ6V.?Ýâ+ýƒo?ݯšôR?ݯo?©D ?Ý|Yê8áÃ?Ý|ÁRÁˆ?ÝI»H*D?ÝJ!Ý¥ËÚ?Ý,=— ¶?Ý’Kr?Üä­Rú~?ÜåÙ3ïû?ܲ?xu?ܲ¤Ò?Üáýã¡l?Ü€FtØâÈhealpy-1.8.1/healpy/data/pixel_window_n0002.fits0000650000175000017530000002070011705033043022013 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 9 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 2 / Resolution parameter for HEALPIX MAX-LPOL= 8 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 2 COMMENT for multipoles in range [0, 8] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð‘?ïFñµî?íÜ?/ÞØ?ïGÒ –žr?ëÔ»ñhHU?í-a—-ý?éJÐÓd ?ê‹>¤üµ?æ^¢ž?ç‚ÍOgq:?ã4*ç*«?ä9"Ȳ^^?ßá„pFþ3?àÔ³Xìß`?Ùrm3=?Úö’ÙÊt®healpy-1.8.1/healpy/data/weight_ring_n08192.fits0000650000175000017530000142340011705033043021720 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-18T00:57:38' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24576 / width of table in bytes NAXIS2 = 16 / 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 NSIDE = 8192 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 24576 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1024D ' MAXVAL1 = 1.634629503848E-01 / maximum value of T weights MINVAL1 = -6.828799286753E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1024D ' MAXVAL2 = 1.634629503848E-01 / maximum value of Q weights MINVAL2 = -6.828799286753E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1024D ' MAXVAL3 = 1.634629503848E-01 / maximum value of U weights MINVAL3 = -6.828799286753E-02 / minimum value of U weights COMMENT END ?ÄìZQ_¿±{RhTÄ?œiBˆ•ág¿{¡Ú÷õfi¿k­4­¸ºª?{ é1Ñ¿w¦’ºÀ?håF˜õ¿-PF,ög ¿[Ml4™m…?b—«‰¿] k%jÓ½?G)ê_BòV?8Œº51¿PÈg™Ëc?Rôª…{¿G8ÆeH ž?c²eægá?<pS@&,¿F+É]˜Y¶?Cz8K!âz¿2’íaŽB¿n.¨cîÕ?9.}i¿=¸,èŽ?4Ú¡”<¿0éÅ9¯Q¿'§ÀÐc?4´>?í¿3}/UQ©?#ù¼:éœ?’½úûè}¿)oRŽFß]?0Tû‚H¿(…Ù3·? ‚3"G²?y,®-]¿'–¡2šn€?'xÄØDZp¿$»³¦ð¾ðŸ¾¬T†™?ÏÑåIÕ¿$„;ñ³É?² w+l¿>ÚÒ~¯øÉ6„¿˜í»É?/JxZò¿£$C¶k?¿,éV ?.=gˆðD¿‹ì0u¡>?Šéh9m¤¿ ¿¥ƒ0`>¶„ªuø¸e†vck>ë2Û×;a¿ä3Üù;? `¸®¿Î,ˆîøü>Ù€õN×¢>ú#¡Kþèm¿¦( >·?–¹_W¾õÅâþÙå¾àÂ?Õìu?ªrÆ+¡¿Á6§÷ä>ÿ•&¤ƒ¼'¾ÝFf?ÅS}¾ó"MZZ[?å/–f¿Í[ÂÑ™>óf%o#)>ÓU4fÛ×¾ùØËt´ù?)ª¶dÄ̾úûÿË&>ß)–nkØ…>ì>Ô9”³ã¾üÆš†I>ýÝ…pÓU¾ñpÚçú/,¾ÂÙ&øgš>ôPXîÚÂÔ¾üh¬Ä‰9I>÷_Oîž™­¾ßé¿â¹ ¾äß‘×ë÷”>÷srÞej¾ùd (Ç>ï–ãà(æ¥>¢ßE*º¾ð ÿ áf>÷ί,‹a¾ôw$3ÇÑ“>ßõ³àÍzÔ>Þ§°-øu+¾óPvŠ>õÔhÁh‘6¾ìÆß…NñX>¦ ñ9FW<>é»dÑØ”¾ô&ºg[Ü›>ò*Õˆäü¾ßâ¼¹¼J¾Ö(1êr">ð\”ï˾òï# N>êWb#Ѹ¾¹öùïýä¾äš¢Ëa@Î>ñ1‡2¹Þä¯ é5>Ï–Æé¾êÇVMGæ½>ðŠ¸ÅÍ#¾è5/ ïäc>Âx«ñê‘>à¶ø³ãý¾í†Ù¡XÏ>ìË'H(*Q¾Þ ÿȸyh¾Ä°¹7³ÿÓ>æu#oõϾí?—J;ì>æQá·¿è¾Æ}Û¤LU9¾ÚW™½9À>ézöTAP¾éå?Ž£ì%>ÝØB.·ñ>¸Õø±zÙ¾âáÀ+ÒRÁ>é¬ÂÆ¥Ué¾ä¢yî>U¬>ÉkÙ~?À–>ÔãA¡#2¾æƒÀì}Â>çaÐŒ4–!¾ÜçuÔÅv¾§)¬ë†>ßȧ.Fjå¾æˆ2¤kG>ãodçäؾ˄íÝ)À’¾Ð`®ò9>ã,J]Œ"«¾å.U,(>Û‹™$˜>lÛ–Å7뫾ڼ˜«9 >ä<¯²5íý¾á¿½O>ÌúÉÛ‹>Éã<Ò•¨(;¾Ùø"6Ÿ4>žòRñØDH>Öqyµ23¾â .#ÂÄO>à~âé> ¾Íñh¶¢3¼¾ÂîWHÖ >Ý€ïöÛ5¾á‚1ÍOaÿ>Øèæ[q^!¾­yì?FRv¾ÒÄ÷úá>àΑ¾Þ³UA()>΄ 0ׂ>»8ñkþS¾ÙPÇ=œ1>ßëÊ T×¾×Ü`¤Õ?>´iÁ¼;Å«>Ï1‚;;±ì¾ÜÇ+êàÅ>Ü—¥ªRFоÎÈáms­‡¾²6»è]¼R>ÖëC#‡O¾Ý!ÎY,è˜>ÖÓ겎¼?¾¹Å„£c;ɳÐÈ(DE>Ù»/©eվڤ߼^s>ÎΣ,Ó[>¥[Û4ã¾Ó#H²¼2>Ú›vˈ`¾Õк¾ú!'>¼²¢^>Äìí%Ýnf¾×¥Rî¬Ø>ØÖ(+cxì¾Î¢p‚•Ô¾$5ˆHY>Гà…³O¾ØOtY㢠>ÔÓGµk)¾¿¥þ(v]˾ÀÀÀAeiµ>ÔŽÓ2yQö¾×'mf‘´ò>ÎMGSP¼3¾xv¶ž«™¾Ì› Ëê9q>Ö6vöÃC¾ÓÜ"¤íh¯>ÀüðªZNk>º2DnÕX¿¾ÒYn²ê¹m>Õ•@'Ÿð¾Í×Ô|ÇH2>™-â5±>ÈŒv`ë̾ÔJäÏG[>ÒëWk'uܾÁã¶KŽg[¾³ÆŽ-íp‹>ÐYx2A¤¾Ô¶De‚ >ÍHHFΣ¾¤§aû»1–¾Äë„Sì\>Ò…L^ÎV¾Ò'9DcD>‘• 㜬>¬A5žDd¾Í%„#Ô|>Ò»Rœ?x¾Ì£[sÛè³>«ŒgHí%>Áªx’¸²Þ¾Ðã‰üØ>Ñk56|/¾Ãý”‘¥µ¾¢Ln˜ö)>ÉÂ6ŸåV¾Ñnñ?‹µ/>Ëíx[:J;¾°³ƒÍ1û¸¾½{—ÕY¨>ÎÂ{ŸD(K¾Ð@=žHå¸>ÃbòÙ.Â>“ žË” ¾Æ½/‡©S#>Ð5º< Ë×¾Ë)®cèž>³,CKùF>¸7‹Ó¤ª¾Ëö0 Žÿ>ÎÒÄûL—Á¾Ã“N¦o5m¾l‚o™‘bª>Ãùå0)«Ä¾Î%¿û>Ê[*‘Jl¾µ?Œî¿Õ&¾³xB¶cÐ>É] 6·e¾Í1Å\m >äüP«Šn¾„'_ã ¾Áqãgì>Ëí.zŒ¾Ò¾ÉƒœÔyÑ >¶ù$š~>®_:Ø÷¦ž¾ÆòitÓV>ËœõYëBl¾Ãœ$~]å>–þhS >¾>2¢r¾ÉÜ-Ð’#>È¥Œl2r澸dVï)¾¦¢í[$ë>ıuÈ>¼t¾ÊW•Ѐ>Ã|SºVü¾ Qòák¾¹ùU>>ÇæÌÜTþ¾ÇÂ8e–U¢>¹ˆïêÍÖÍ>ŸMKhÀ¦¾Â—o6Ã7S>È—f×s ¾ÃH‘‚ßž>¤ñ ”;ï,>¶ ¨\â¡¾Æ [ K-´>ÆÛ@u3÷ÿ¾ºoòÿV®¾’°Ou-êÔ>À¡#›uuŒ¾Ç&! UU>Ã{ÔÇgx¾¨úM¿Åéç¾²p^X½­>ÄH¨¶ ¾Åñ‘1„¨Ü>»j¶mÐ>}ÅÀÞå5÷¾Â¯Uv~öJ>¬{œGþO>®;hëP¾Â›˜¢E/X>ÅiÃ|¾»¸“@6â>g‘ 1 Fé>º)^‚{*x¾ÄeE²>ÂNéZ?½¾¯oM¦«â¾¨˜d»ÏÊ>Á{³«R„¾ÄhM9>»ï’ÁÄÖa¾ˆXk¾,y徶ô/P>ÃæÛM¾Áá|‘ïÚd>± ŸÕr>¢|èXØØǾ¿2úŽHè>Ã.‹Aýxt¾¼ýÁÓn>”tŸr ‘ >³óÑ©©7¾ÁÏk¥|ðe>ÁkêÔŒ½¾²$CÓ¤‰W¾š¡dÈ#–W>¼#ÈÁ€`¾ÂC?œÁ1±>¼ ‘Œ®½¾¾›ÞÏaNúO¾±$ù'*Q„>À”A¯=‘Ò¾Àìu*+>³ZµuçG>‘±R!€†¾¹hÔüoŸ>ÁYRÐÌB•¾¼U¸Š(6>¡=ÿ+ _.>­ ÉXµ¾¾Æß Ù8`>ÀeÔ{Î9¾³ÍÖ)µÍ¤¾€ÏM$6‰ø>¶Ð£öúú¨¾Àq+¶ŒA>»ÑM«X¾¤-Ó’Š ¾¨ ÝôÌ8¥>¼y)½˜¾¿²¯û­ª³>´f³Ìó¥>:•º¹åƾ´YªŒ › >¿EIH\ß¾»bº>¦ÅØÂ’’æ>£‹è7«=¾º?zãþ×y>¾+‡¾´ÛÃ~ØŽE>{Šq¶Ól>²…Úiʾ½OzòÕ"S>»œº•%¾© \¤ ¾ž†ˆ¶®Q’>¸#F ç&¾½bØB³ÜÐ>µ0T?cÙ¾‹k)÷k”¾¯“Ù·¤6n>»ŽçžGQS¾ºWòVºÑ>«¥‘VÃ>–Œ-èÔýO¾¶A/~¿è>¼/HÉ»œ­¾µf©‹ù, >“™>ŒiZ¬>«]v¥Ѿ¹ÔÎóþA4>ºµ"Þp¾¬».멦¾Ž´4Š×`±¾ºõì0LÓ >µuÜG¾™ËW=¾§_¿Lõkk>¸"/ðo«Ž¾¹n!²ž­>®-x?ÈöÛ>€nä%¡¾²"»0Cm>¹¸®¨²o¾µ‚Ý:$5G>ž*x­1>£˜ÁIJ>¾¶w8Íé/d>¸¾ö!²Ó[¾¯bKÞþ%¾]çí Jü>°>xûWY¾¸vòfTvN>µlùÉãE¾¡<»ÕúéÔ¾ ¯tõÈm>´ÔÊM¾¸’‹ªŽ>°.Ûå¨Ù¾pp$`&¾¬ì½«N‚>·3¦Pj¡î¾µAlDøî>£7­ÄH¾>™O¾ §Cš¾³;HÈX|>·:(LÄþ¾°‘ºáuY>ƒ'ÞE€>©€š`ο¾µï6:_>µNÄÚ&8¾¤øä]Ô¾’õ†wan >±ª§ƒï©ß¾¶g{ŸÃší>°Ûˆ…¾5V#^Hľ¦8Üý ^>´ª˜ï2ž¾´°èjb¶>¦‚À|Õ¨¨>‰÷£,åþݾ°#˲H¶Ó>µ‹Š”¾± Ï^³Íà>“6¹0ã>£…ûξ³f±Ñc5š>´Oe r¾§ØË`韾}€¶ä>­NIÍGe¾´§èÆ­H >±**Öꌾ—jô‡zÊ“¾ ì38o!>²$Vîѽ&¾³Ýî0&¤Ë>¨ýÃÛj[>`ùž/:¾ªinÖÞBë>³½n2†Æ¾±2¡tÄ.>›<˟ϘP>šl:\qm¾°äPY‡y >³_TF…‹¾©òÀÅ?7Æ>fFØgÓúê>§šS~‘D澲̈́Õã•>±&¬êšp ¾ž®Ü׫ññ¾”öØ„å>¯N·sÖü ¾²Ó˜H¤ ¶>ª»¡ê˜X¾}i­ËÁ]G¾¤àðk˜>±Øæ'”º÷¾± vÕl¶> ãˆ`Ó>‹Ä›$q¾¬ÜNðôÝe>²<߉²¾«Zž0a!ª>‡/¦Ýlâˆ>¢>q&®4¾°àÜzR[>°Û—s“¢9¾¢BsÃýb¾…³çEö®>ªr»•ÇRܾ±›Ê5¿Œ>«ÑJ†ºJk¾l¼áêÁ¾ŸeH#ù>¯Ìq›gs¾°ž7¨Så>£wêÅ>ï>xÅÝ I¾¨3ÂoöE>°ñ»ªžF_¾¬"Yë‰2>“±ŨÉ>š}ä±ö”:¾­Ó/%2Ò$>°RsÜؾ¤„¨ËÐT¾\Æ9.’L*>¥¾å!)‘¾°?q®Í r>¬O;@\®h¾–lMN|Öþ¾•Å½É[›.>«Ø0 ËMú¾¯ò¼ËDá’>¥j_ µ°¾b³¿¬¤¼M¾£väÐÍ[½>¯ l¾‡éU¾¬Zt‰© ³>™nTEÑ>‘?‘öño¾©Ý@Ê‚;>¯'üߧ¾¦*„ »ž >xÛG‡ãD7>¡¬EW uÖÕ¾œ%îæE4n¾‰Ò’<€£z>§ãV—…€¾®F w [Ä>¦Ç6™1¾ƒ¬íŸ©”7¾žÝIUI>¬9Èñ1s¾¬FöÍXò>ž•ãOÇ9>Œ¥ƒt’¾¥ìx/õï>­P–ÞµÑI¾§@ÅÔ^&>Šj]-"d>™å¾J ¦¾ªr¯›j>«Â€„Ù1¾ _íö!ªh¾sV]±g«x>£ùÕ‹X¾¬G·á°>§™Ì̾TNâÀÝò¾•ËÚŽ'Ÿ>¨ÙFN:Hø¾«XJ-L4>¡RèTwì>QŠsžáྡྷ Lè|s>«-ÕEÇó¾§Òü9ˆˆ>“4$^™Ò>‘ÓÖôeÉw¾§:Ú÷ÁÒ>ªÔÒS°T¾¢$ÕÐ}á¥>c‰&y UL> %Ÿîƒ`¾ª«ÿT,>§îH^jY¾•Ö1óÜ;¾‹þoÙ^›Þ>¥˜õ9NB¾ª:FÓõ¬z>¢Ö³¡¯w;¾w·Güj¹¾œŽjsæ¤p>¨ÍôÔzDE¾§ìf{&>˜:‹ÚkÝ >„žÕæïiœ¾£ô–`Α[>©‰ÊÄ´2¾£i}Xué>Ïÿå‹>¾>˜ãkýÞ𾧋WÆÏÖ >§ÏºÚ].¾šc,+»ó¾{ôãâ¬B>¢O½î(àؾ¨Åy;)Ó*>£Þ29$Bß¾‡©[4cÂ꾕M}ZîDn>¦>w:Oj[¾§˜©ÛåòÀ>œOË5¨hŸ>kp’¾ «W7¥û>§îj0Øòᾤ5ÔM<ÿ>ËF×ì‚>‘ͼ‘?‹û¾¤èå]ôă>§I?-oMv¾žÁ ¿é¸¾$ÇðÈOû>žŒKŸ¤¾§­¬l`>¤qhüA»j¾‘0dsþ꾌ÎM|Id›>£Œ2úú€¦¾¦âZ ³…›>Ÿ|ˆb‡¾g6¥9’‰µ¾šÔÁžÙ c>¦PÉ#ù¾¤‘ú0k…>“a#¡Ñ™>†5Z6dB¾¢)ß¼µÑ>¦eØ‹XNw¾ _œ#½´>w3r§¢Ÿ>— Ù¯Wkv¾¥ Uõ55¢>¤˜˜k#&x¾•|{L¡Â¨¾¬;€ë>Ö> Ãiù¢ô[¾¥Ôt ý> äfüز۾nâÀ"×¾”xZ'Dz„>£øÄÓÉËo¾¤†TJ–Ú>—dw²7¥™>sd0ãïa¾ž´|øÔÊ>¥0‚4 ‘F¾¡O\mv»z>†-y‰àB>‘^š:·š¾¢Ü‘üÅÄ8>¤\Fèy¾™Œ„éý¾^rPíõš>›ß“°Sc¾¤zm‘9F§>¡ "…wx£¾Šò¡Ì@{ô¾Œ©âê†èÛ>¡¶À‰B¾¤ýòŠ>šš$(£”¾MBÆy Gñ¾™ зYÙš>£´7‡ÌŠ¾¡×énCƒb>^!ýR>†½iÄؾ ‰6–R¡ >£ÅK+nÿ ¾›èéÊ$ó>là m~æw>–8å|#q¾¢ÞÈÅC!>¡÷A ƒŽ¾‘·oWU¾€øìà+Íð>ž©ãMÆžõ¾£Z¤”ƒá>ui“éq¾x–Âb¾“lgȤÚ>¡ûözÊ6¾¡þºÿªy>“’a:ݶ?>vÆØ2I÷þ¾œ7—PÒ®û>¢ÜÉ18ξòªxdhã>7ò_¿>§ßꤡž¾¡ ­büãb>¡ïr’êD>¾•?³gZƒA¾gúÆ}?>™½rä–x¾¢Lè²çrÐ>ž¯Q•œ ê¾…’»È^¾‹Û~5—Mä> ¾<Òïú¾¡Ê|–J<4>–¿eK@m>9ñÛZ•oÛ¾—? ¶8pë>¡¬9‡AȾŸ<‡( >‰ÄßSw2>†€È!âá2¾ž/¨¸Xù>¡[â#Ë‘¾˜‘ýŸ–>`Ÿr ˆ>”¾?Ô¯åؾ ûöí¡>Ÿœ?ý@Š'¾¨À·Æ«T¾D%Új`>œ ÿ}ÄྡBp[œ´š>™6wMŸÒº¾qÅÉdÙQÁ¾’>‚™‡]> =^ùOF¾ŸÎÖE û>·/kGº>xT4eƒ½¾™áñjöN> áPÝâ­¾š.ló=1>zÀ£â‘>ƒ0Þœ¦?¾žãj'mT>ŸÖl˜›Kœ¾’>¿Þòò¾lÚ&I >>—²m&{wê¾ nkók_>šùíŽÙ¹º¾›ÌKÀ‚ˆ¾Š•¯Ã`òv>4ƒ˜{_¾Ÿ³“,Ãé>“¶FÖrÃ=>SmüÌ˱%¾•zV5 ÌÄ>ŸÔÜôÙ×¾›™â%]}>…”’böM—>…·ÑÖñ¾›pžin£>Ÿhžå?g¾•ÔXHƒ>Qd¢-^E^>“=+Nvz7¾ž­ª’¶Yb>œÈj™É¾‰FάÈñ¾€ïñ?^-:>™š/¶t\¾žöVœÄÐ>–)§ÜF¾jSNËD‚¾ü¼ÍÑŒ+>h¹;yš™¾œXAÏbªÕ>Œ²@2%©>x‚D¹¦ˆ6¾—³þ”K8Š>ž_;kÉÒ²¾—% År>uS!—×>xâÇùݾœ !û¸¬>œy‡ÇyZ¾Óš©Ðõ?¾nÅ“[5¡¡>•À•Ãßæ_¾¤K[›W>—öè„î‚ƾ}ƒÒ¸“ü]¬ž‚>š{1ï…j¾œq¹+šî>‘UÐ…º¬>ZëµI‚Ͼ““í!8½>œÈ0о…j¾˜  wlÐ>‚€¶w£ÀÏ>„‰¥Æ"Uß¾™ñ{x{B>œCKDeÂg¾’›ª¯PM>@/‘¼•?Î-¾›ÌÙñ)4>™ -ˆ¼¾†gâ#U¾€$òk¬@W>—_8ùH¾›ï#9>“ºž²Ìt¾d~!5‰¾bdþÛÿ>š²Ý…¹4K¾™x”9þ:>‰AžÕÑT>w¨—F‹¡Ù¾•«Qðq>›v¹Šß}¾”³CVëÚ9>r×·l>‹F §ä¼A¾™}Óæ-íÄ>™©6»Êu¾Œ?5ÛDeú¾nkC.–g>“è·/…¾šÛ”þžä>•…›ŒJþ¾y’ÝÝš5¾‡)/Icä>˜/ö%:¾™³¤ÎoÇ2>Žø^PÇ÷í>[ô Ó“ý¾’û=y¬^>šfFÚš¾–0ðT (/>€Pyb¼>ƒð¼[2e¾–ÊÈE©×{>™˜åÉ¢¾µÁQ×ss>/r¿dåñ>A0uéð ¾™Cðc?Ž©>–¶*Æ7¨¾ƒŸ]ˆX¾~u…Â~Á>•Q]hç%¥¾™Xr†‰ÜE>‘Ë´)rq¾aQͺªG¾ŒÃ;P­­‡>˜KCƒêá¾—â˜lß0>†³&¿ufò>vìyz2¾“Å]«‹p>˜õ-È„¼¾’½ŠÓû®ƒ>pôóµ}>ˆú@]Í*¾—6Ñg‚l>—NNÍ+Èr¾‰Š[’)ó7s¾˜p`„yƒ>“Šó¿6t¾w]´%þ…-ì§bÙ*>– 3±»1¾—bXWøXé>Œ!i,‘:Ù>YýƒÝAÖľ€ßw.`Ü>—ÊØfþôæ¾”3Áƒ™c>}«ÿL@>aû^ä(>¾”ÄcÆsœ×>—R}¬…Ì/¾ŽwÇÊU0Y>.LUÖAe>š¹¯Y_F¾—å¹ö¾û>”·óÚ…c]¾ó¸¹þ2Ѿ{9“€£³Ú>“j¡é‘¾—ømKÜ)>EAVh¾`Ežˆ#ï ¾Š"|hˆ>–%˜Ž]¾¾•°ð>„Û¾r`Xv>sÃë‚=º,¾‘þ6H'>–É‘$î f¾‘,Õz`ߘ>nPAï9½>†Ÿ…„r¾•)w)ZÇ>•SJìܾ‡‰ïfÓè¾hÞ³óªç‚>…¶KÕ¾–RÑÙŸ >‘ñ{jÓ®î¾uŸ @'¾ƒŒˆ=o>”ÐÎ펾•k:Ÿ‰—˜>‰ý6ûÔù>U t¼‰a¾íõåHq>•¼Åõk ¾’“Š°z>{Û}q²Ö>J!¾’ç]!*”>•`&1e>g¾Œ2:ê>;a:ì.>ŠÂ#E¾•EêÁ>“7Dìüܾ€ÜGZžxf•Ÿiµ>‘¥¢¼çÊø¾•2Û­­ÅÌ>Ž'üÔ»×i¾`é‘Úƒ-¾‡„—‹nï>”7ŸsFB¹¾“n*cÊæ9>ƒ—>È­zS>q À}¾Q…€F4A>”äRYÍl¸¾Üb™H]>mÜ‚D½ßO>„:gŽ}9¾“KðÃæc>“¦ôÄ›N…¾†V”¶"V¾dT Zõ­T>Ùkìr+¾”u¨à0¼¯>§Mݿľuæ±U¿¾€è¨çñ•>’GÇZHú¾“½—ãê1×>ˆh¶…–Þ>K{JPeÊ‘¾Šôt­A¦f>“è+BÞæq¾‘>¨-‘Â>zörd’1¢>{))î ˾‘,tAt>“±þ|Ÿf”¾Šz c >HñaË}°>‡÷Ö4ê3!¾“=F?³Ù>‘´„ãü¾€;&Û²B¾t†í+I>ù»-ªÁ¾“…}þ(]>ŒN;À֓ƾbåyâJK뾄éÊÜ°zï>’v‘™Š~¾’,É-r>‚Éie}>kå3iE¾tîèIÁ)>“8c'º¾ã¬T`Y>o#Ür©>Î/5ʾ‘•ÄnÐ:¢>’:fo Nɾ…$^3ºå¾]âLÓÈ}W>ŠÐ|ZId¾’ÌVÞðÑd>9xÍ8¾¾uSA¦%¾}VµŠ]Ç >œ¾Õƒò¾’JÛlC)æ>‡Gö¥¿=¯>2‰<®Ž¾ˆéâ=òT>’AüB ¾&¢¢<ëu>zÎÝkåVy>w Ïx䌾óº¡S>>’:«u"¾‰2írQK>T Wòt>…9`7î?ÄìZQ_¿±{RhTÄ?œiBˆ•ág¿{¡Ú÷õfi¿k­4­¸ºª?{ é1Ñ¿w¦’ºÀ?håF˜õ¿-PF,ög ¿[Ml4™m…?b—«‰¿] k%jÓ½?G)ê_BòV?8Œº51¿PÈg™Ëc?Rôª…{¿G8ÆeH ž?c²eægá?<pS@&,¿F+É]˜Y¶?Cz8K!âz¿2’íaŽB¿n.¨cîÕ?9.}i¿=¸,èŽ?4Ú¡”<¿0éÅ9¯Q¿'§ÀÐc?4´>?í¿3}/UQ©?#ù¼:éœ?’½úûè}¿)oRŽFß]?0Tû‚H¿(…Ù3·? ‚3"G²?y,®-]¿'–¡2šn€?'xÄØDZp¿$»³¦ð¾ðŸ¾¬T†™?ÏÑåIÕ¿$„;ñ³É?² w+l¿>ÚÒ~¯øÉ6„¿˜í»É?/JxZò¿£$C¶k?¿,éV ?.=gˆðD¿‹ì0u¡>?Šéh9m¤¿ ¿¥ƒ0`>¶„ªuø¸e†vck>ë2Û×;a¿ä3Üù;? `¸®¿Î,ˆîøü>Ù€õN×¢>ú#¡Kþèm¿¦( >·?–¹_W¾õÅâþÙå¾àÂ?Õìu?ªrÆ+¡¿Á6§÷ä>ÿ•&¤ƒ¼'¾ÝFf?ÅS}¾ó"MZZ[?å/–f¿Í[ÂÑ™>óf%o#)>ÓU4fÛ×¾ùØËt´ù?)ª¶dÄ̾úûÿË&>ß)–nkØ…>ì>Ô9”³ã¾üÆš†I>ýÝ…pÓU¾ñpÚçú/,¾ÂÙ&øgš>ôPXîÚÂÔ¾üh¬Ä‰9I>÷_Oîž™­¾ßé¿â¹ ¾äß‘×ë÷”>÷srÞej¾ùd (Ç>ï–ãà(æ¥>¢ßE*º¾ð ÿ áf>÷ί,‹a¾ôw$3ÇÑ“>ßõ³àÍzÔ>Þ§°-øu+¾óPvŠ>õÔhÁh‘6¾ìÆß…NñX>¦ ñ9FW<>é»dÑØ”¾ô&ºg[Ü›>ò*Õˆäü¾ßâ¼¹¼J¾Ö(1êr">ð\”ï˾òï# N>êWb#Ѹ¾¹öùïýä¾äš¢Ëa@Î>ñ1‡2¹Þä¯ é5>Ï–Æé¾êÇVMGæ½>ðŠ¸ÅÍ#¾è5/ ïäc>Âx«ñê‘>à¶ø³ãý¾í†Ù¡XÏ>ìË'H(*Q¾Þ ÿȸyh¾Ä°¹7³ÿÓ>æu#oõϾí?—J;ì>æQá·¿è¾Æ}Û¤LU9¾ÚW™½9À>ézöTAP¾éå?Ž£ì%>ÝØB.·ñ>¸Õø±zÙ¾âáÀ+ÒRÁ>é¬ÂÆ¥Ué¾ä¢yî>U¬>ÉkÙ~?À–>ÔãA¡#2¾æƒÀì}Â>çaÐŒ4–!¾ÜçuÔÅv¾§)¬ë†>ßȧ.Fjå¾æˆ2¤kG>ãodçäؾ˄íÝ)À’¾Ð`®ò9>ã,J]Œ"«¾å.U,(>Û‹™$˜>lÛ–Å7뫾ڼ˜«9 >ä<¯²5íý¾á¿½O>ÌúÉÛ‹>Éã<Ò•¨(;¾Ùø"6Ÿ4>žòRñØDH>Öqyµ23¾â .#ÂÄO>à~âé> ¾Íñh¶¢3¼¾ÂîWHÖ >Ý€ïöÛ5¾á‚1ÍOaÿ>Øèæ[q^!¾­yì?FRv¾ÒÄ÷úá>àΑ¾Þ³UA()>΄ 0ׂ>»8ñkþS¾ÙPÇ=œ1>ßëÊ T×¾×Ü`¤Õ?>´iÁ¼;Å«>Ï1‚;;±ì¾ÜÇ+êàÅ>Ü—¥ªRFоÎÈáms­‡¾²6»è]¼R>ÖëC#‡O¾Ý!ÎY,è˜>ÖÓ겎¼?¾¹Å„£c;ɳÐÈ(DE>Ù»/©eվڤ߼^s>ÎΣ,Ó[>¥[Û4ã¾Ó#H²¼2>Ú›vˈ`¾Õк¾ú!'>¼²¢^>Äìí%Ýnf¾×¥Rî¬Ø>ØÖ(+cxì¾Î¢p‚•Ô¾$5ˆHY>Гà…³O¾ØOtY㢠>ÔÓGµk)¾¿¥þ(v]˾ÀÀÀAeiµ>ÔŽÓ2yQö¾×'mf‘´ò>ÎMGSP¼3¾xv¶ž«™¾Ì› Ëê9q>Ö6vöÃC¾ÓÜ"¤íh¯>ÀüðªZNk>º2DnÕX¿¾ÒYn²ê¹m>Õ•@'Ÿð¾Í×Ô|ÇH2>™-â5±>ÈŒv`ë̾ÔJäÏG[>ÒëWk'uܾÁã¶KŽg[¾³ÆŽ-íp‹>ÐYx2A¤¾Ô¶De‚ >ÍHHFΣ¾¤§aû»1–¾Äë„Sì\>Ò…L^ÎV¾Ò'9DcD>‘• 㜬>¬A5žDd¾Í%„#Ô|>Ò»Rœ?x¾Ì£[sÛè³>«ŒgHí%>Áªx’¸²Þ¾Ðã‰üØ>Ñk56|/¾Ãý”‘¥µ¾¢Ln˜ö)>ÉÂ6ŸåV¾Ñnñ?‹µ/>Ëíx[:J;¾°³ƒÍ1û¸¾½{—ÕY¨>ÎÂ{ŸD(K¾Ð@=žHå¸>ÃbòÙ.Â>“ žË” ¾Æ½/‡©S#>Ð5º< Ë×¾Ë)®cèž>³,CKùF>¸7‹Ó¤ª¾Ëö0 Žÿ>ÎÒÄûL—Á¾Ã“N¦o5m¾l‚o™‘bª>Ãùå0)«Ä¾Î%¿û>Ê[*‘Jl¾µ?Œî¿Õ&¾³xB¶cÐ>É] 6·e¾Í1Å\m >äüP«Šn¾„'_ã ¾Áqãgì>Ëí.zŒ¾Ò¾ÉƒœÔyÑ >¶ù$š~>®_:Ø÷¦ž¾ÆòitÓV>ËœõYëBl¾Ãœ$~]å>–þhS >¾>2¢r¾ÉÜ-Ð’#>È¥Œl2r澸dVï)¾¦¢í[$ë>ıuÈ>¼t¾ÊW•Ѐ>Ã|SºVü¾ Qòák¾¹ùU>>ÇæÌÜTþ¾ÇÂ8e–U¢>¹ˆïêÍÖÍ>ŸMKhÀ¦¾Â—o6Ã7S>È—f×s ¾ÃH‘‚ßž>¤ñ ”;ï,>¶ ¨\â¡¾Æ [ K-´>ÆÛ@u3÷ÿ¾ºoòÿV®¾’°Ou-êÔ>À¡#›uuŒ¾Ç&! UU>Ã{ÔÇgx¾¨úM¿Åéç¾²p^X½­>ÄH¨¶ ¾Åñ‘1„¨Ü>»j¶mÐ>}ÅÀÞå5÷¾Â¯Uv~öJ>¬{œGþO>®;hëP¾Â›˜¢E/X>ÅiÃ|¾»¸“@6â>g‘ 1 Fé>º)^‚{*x¾ÄeE²>ÂNéZ?½¾¯oM¦«â¾¨˜d»ÏÊ>Á{³«R„¾ÄhM9>»ï’ÁÄÖa¾ˆXk¾,y徶ô/P>ÃæÛM¾Áá|‘ïÚd>± ŸÕr>¢|èXØØǾ¿2úŽHè>Ã.‹Aýxt¾¼ýÁÓn>”tŸr ‘ >³óÑ©©7¾ÁÏk¥|ðe>ÁkêÔŒ½¾²$CÓ¤‰W¾š¡dÈ#–W>¼#ÈÁ€`¾ÂC?œÁ1±>¼ ‘Œ®½¾¾›ÞÏaNúO¾±$ù'*Q„>À”A¯=‘Ò¾Àìu*+>³ZµuçG>‘±R!€†¾¹hÔüoŸ>ÁYRÐÌB•¾¼U¸Š(6>¡=ÿ+ _.>­ ÉXµ¾¾Æß Ù8`>ÀeÔ{Î9¾³ÍÖ)µÍ¤¾€ÏM$6‰ø>¶Ð£öúú¨¾Àq+¶ŒA>»ÑM«X¾¤-Ó’Š ¾¨ ÝôÌ8¥>¼y)½˜¾¿²¯û­ª³>´f³Ìó¥>:•º¹åƾ´YªŒ › >¿EIH\ß¾»bº>¦ÅØÂ’’æ>£‹è7«=¾º?zãþ×y>¾+‡¾´ÛÃ~ØŽE>{Šq¶Ól>²…Úiʾ½OzòÕ"S>»œº•%¾© \¤ ¾ž†ˆ¶®Q’>¸#F ç&¾½bØB³ÜÐ>µ0T?cÙ¾‹k)÷k”¾¯“Ù·¤6n>»ŽçžGQS¾ºWòVºÑ>«¥‘VÃ>–Œ-èÔýO¾¶A/~¿è>¼/HÉ»œ­¾µf©‹ù, >“™>ŒiZ¬>«]v¥Ѿ¹ÔÎóþA4>ºµ"Þp¾¬».멦¾Ž´4Š×`±¾ºõì0LÓ >µuÜG¾™ËW=¾§_¿Lõkk>¸"/ðo«Ž¾¹n!²ž­>®-x?ÈöÛ>€nä%¡¾²"»0Cm>¹¸®¨²o¾µ‚Ý:$5G>ž*x­1>£˜ÁIJ>¾¶w8Íé/d>¸¾ö!²Ó[¾¯bKÞþ%¾]çí Jü>°>xûWY¾¸vòfTvN>µlùÉãE¾¡<»ÕúéÔ¾ ¯tõÈm>´ÔÊM¾¸’‹ªŽ>°.Ûå¨Ù¾pp$`&¾¬ì½«N‚>·3¦Pj¡î¾µAlDøî>£7­ÄH¾>™O¾ §Cš¾³;HÈX|>·:(LÄþ¾°‘ºáuY>ƒ'ÞE€>©€š`ο¾µï6:_>µNÄÚ&8¾¤øä]Ô¾’õ†wan >±ª§ƒï©ß¾¶g{ŸÃší>°Ûˆ…¾5V#^Hľ¦8Üý ^>´ª˜ï2ž¾´°èjb¶>¦‚À|Õ¨¨>‰÷£,åþݾ°#˲H¶Ó>µ‹Š”¾± Ï^³Íà>“6¹0ã>£…ûξ³f±Ñc5š>´Oe r¾§ØË`韾}€¶ä>­NIÍGe¾´§èÆ­H >±**Öꌾ—jô‡zÊ“¾ ì38o!>²$Vîѽ&¾³Ýî0&¤Ë>¨ýÃÛj[>`ùž/:¾ªinÖÞBë>³½n2†Æ¾±2¡tÄ.>›<˟ϘP>šl:\qm¾°äPY‡y >³_TF…‹¾©òÀÅ?7Æ>fFØgÓúê>§šS~‘D澲̈́Õã•>±&¬êšp ¾ž®Ü׫ññ¾”öØ„å>¯N·sÖü ¾²Ó˜H¤ ¶>ª»¡ê˜X¾}i­ËÁ]G¾¤àðk˜>±Øæ'”º÷¾± vÕl¶> ãˆ`Ó>‹Ä›$q¾¬ÜNðôÝe>²<߉²¾«Zž0a!ª>‡/¦Ýlâˆ>¢>q&®4¾°àÜzR[>°Û—s“¢9¾¢BsÃýb¾…³çEö®>ªr»•ÇRܾ±›Ê5¿Œ>«ÑJ†ºJk¾l¼áêÁ¾ŸeH#ù>¯Ìq›gs¾°ž7¨Så>£wêÅ>ï>xÅÝ I¾¨3ÂoöE>°ñ»ªžF_¾¬"Yë‰2>“±ŨÉ>š}ä±ö”:¾­Ó/%2Ò$>°RsÜؾ¤„¨ËÐT¾\Æ9.’L*>¥¾å!)‘¾°?q®Í r>¬O;@\®h¾–lMN|Öþ¾•Å½É[›.>«Ø0 ËMú¾¯ò¼ËDá’>¥j_ µ°¾b³¿¬¤¼M¾£väÐÍ[½>¯ l¾‡éU¾¬Zt‰© ³>™nTEÑ>‘?‘öño¾©Ý@Ê‚;>¯'üߧ¾¦*„ »ž >xÛG‡ãD7>¡¬EW uÖÕ¾œ%îæE4n¾‰Ò’<€£z>§ãV—…€¾®F w [Ä>¦Ç6™1¾ƒ¬íŸ©”7¾žÝIUI>¬9Èñ1s¾¬FöÍXò>ž•ãOÇ9>Œ¥ƒt’¾¥ìx/õï>­P–ÞµÑI¾§@ÅÔ^&>Šj]-"d>™å¾J ¦¾ªr¯›j>«Â€„Ù1¾ _íö!ªh¾sV]±g«x>£ùÕ‹X¾¬G·á°>§™Ì̾TNâÀÝò¾•ËÚŽ'Ÿ>¨ÙFN:Hø¾«XJ-L4>¡RèTwì>QŠsžáྡྷ Lè|s>«-ÕEÇó¾§Òü9ˆˆ>“4$^™Ò>‘ÓÖôeÉw¾§:Ú÷ÁÒ>ªÔÒS°T¾¢$ÕÐ}á¥>c‰&y UL> %Ÿîƒ`¾ª«ÿT,>§îH^jY¾•Ö1óÜ;¾‹þoÙ^›Þ>¥˜õ9NB¾ª:FÓõ¬z>¢Ö³¡¯w;¾w·Güj¹¾œŽjsæ¤p>¨ÍôÔzDE¾§ìf{&>˜:‹ÚkÝ >„žÕæïiœ¾£ô–`Α[>©‰ÊÄ´2¾£i}Xué>Ïÿå‹>¾>˜ãkýÞ𾧋WÆÏÖ >§ÏºÚ].¾šc,+»ó¾{ôãâ¬B>¢O½î(àؾ¨Åy;)Ó*>£Þ29$Bß¾‡©[4cÂ꾕M}ZîDn>¦>w:Oj[¾§˜©ÛåòÀ>œOË5¨hŸ>kp’¾ «W7¥û>§îj0Øòᾤ5ÔM<ÿ>ËF×ì‚>‘ͼ‘?‹û¾¤èå]ôă>§I?-oMv¾žÁ ¿é¸¾$ÇðÈOû>žŒKŸ¤¾§­¬l`>¤qhüA»j¾‘0dsþ꾌ÎM|Id›>£Œ2úú€¦¾¦âZ ³…›>Ÿ|ˆb‡¾g6¥9’‰µ¾šÔÁžÙ c>¦PÉ#ù¾¤‘ú0k…>“a#¡Ñ™>†5Z6dB¾¢)ß¼µÑ>¦eØ‹XNw¾ _œ#½´>w3r§¢Ÿ>— Ù¯Wkv¾¥ Uõ55¢>¤˜˜k#&x¾•|{L¡Â¨¾¬;€ë>Ö> Ãiù¢ô[¾¥Ôt ý> äfüز۾nâÀ"×¾”xZ'Dz„>£øÄÓÉËo¾¤†TJ–Ú>—dw²7¥™>sd0ãïa¾ž´|øÔÊ>¥0‚4 ‘F¾¡O\mv»z>†-y‰àB>‘^š:·š¾¢Ü‘üÅÄ8>¤\Fèy¾™Œ„éý¾^rPíõš>›ß“°Sc¾¤zm‘9F§>¡ "…wx£¾Šò¡Ì@{ô¾Œ©âê†èÛ>¡¶À‰B¾¤ýòŠ>šš$(£”¾MBÆy Gñ¾™ зYÙš>£´7‡ÌŠ¾¡×énCƒb>^!ýR>†½iÄؾ ‰6–R¡ >£ÅK+nÿ ¾›èéÊ$ó>là m~æw>–8å|#q¾¢ÞÈÅC!>¡÷A ƒŽ¾‘·oWU¾€øìà+Íð>ž©ãMÆžõ¾£Z¤”ƒá>ui“éq¾x–Âb¾“lgȤÚ>¡ûözÊ6¾¡þºÿªy>“’a:ݶ?>vÆØ2I÷þ¾œ7—PÒ®û>¢ÜÉ18ξòªxdhã>7ò_¿>§ßꤡž¾¡ ­büãb>¡ïr’êD>¾•?³gZƒA¾gúÆ}?>™½rä–x¾¢Lè²çrÐ>ž¯Q•œ ê¾…’»È^¾‹Û~5—Mä> ¾<Òïú¾¡Ê|–J<4>–¿eK@m>9ñÛZ•oÛ¾—? ¶8pë>¡¬9‡AȾŸ<‡( >‰ÄßSw2>†€È!âá2¾ž/¨¸Xù>¡[â#Ë‘¾˜‘ýŸ–>`Ÿr ˆ>”¾?Ô¯åؾ ûöí¡>Ÿœ?ý@Š'¾¨À·Æ«T¾D%Új`>œ ÿ}ÄྡBp[œ´š>™6wMŸÒº¾qÅÉdÙQÁ¾’>‚™‡]> =^ùOF¾ŸÎÖE û>·/kGº>xT4eƒ½¾™áñjöN> áPÝâ­¾š.ló=1>zÀ£â‘>ƒ0Þœ¦?¾žãj'mT>ŸÖl˜›Kœ¾’>¿Þòò¾lÚ&I >>—²m&{wê¾ nkók_>šùíŽÙ¹º¾›ÌKÀ‚ˆ¾Š•¯Ã`òv>4ƒ˜{_¾Ÿ³“,Ãé>“¶FÖrÃ=>SmüÌ˱%¾•zV5 ÌÄ>ŸÔÜôÙ×¾›™â%]}>…”’böM—>…·ÑÖñ¾›pžin£>Ÿhžå?g¾•ÔXHƒ>Qd¢-^E^>“=+Nvz7¾ž­ª’¶Yb>œÈj™É¾‰FάÈñ¾€ïñ?^-:>™š/¶t\¾žöVœÄÐ>–)§ÜF¾jSNËD‚¾ü¼ÍÑŒ+>h¹;yš™¾œXAÏbªÕ>Œ²@2%©>x‚D¹¦ˆ6¾—³þ”K8Š>ž_;kÉÒ²¾—% År>uS!—×>xâÇùݾœ !û¸¬>œy‡ÇyZ¾Óš©Ðõ?¾nÅ“[5¡¡>•À•Ãßæ_¾¤K[›W>—öè„î‚ƾ}ƒÒ¸“ü]¬ž‚>š{1ï…j¾œq¹+šî>‘UÐ…º¬>ZëµI‚Ͼ““í!8½>œÈ0о…j¾˜  wlÐ>‚€¶w£ÀÏ>„‰¥Æ"Uß¾™ñ{x{B>œCKDeÂg¾’›ª¯PM>@/‘¼•?Î-¾›ÌÙñ)4>™ -ˆ¼¾†gâ#U¾€$òk¬@W>—_8ùH¾›ï#9>“ºž²Ìt¾d~!5‰¾bdþÛÿ>š²Ý…¹4K¾™x”9þ:>‰AžÕÑT>w¨—F‹¡Ù¾•«Qðq>›v¹Šß}¾”³CVëÚ9>r×·l>‹F §ä¼A¾™}Óæ-íÄ>™©6»Êu¾Œ?5ÛDeú¾nkC.–g>“è·/…¾šÛ”þžä>•…›ŒJþ¾y’ÝÝš5¾‡)/Icä>˜/ö%:¾™³¤ÎoÇ2>Žø^PÇ÷í>[ô Ó“ý¾’û=y¬^>šfFÚš¾–0ðT (/>€Pyb¼>ƒð¼[2e¾–ÊÈE©×{>™˜åÉ¢¾µÁQ×ss>/r¿dåñ>A0uéð ¾™Cðc?Ž©>–¶*Æ7¨¾ƒŸ]ˆX¾~u…Â~Á>•Q]hç%¥¾™Xr†‰ÜE>‘Ë´)rq¾aQͺªG¾ŒÃ;P­­‡>˜KCƒêá¾—â˜lß0>†³&¿ufò>vìyz2¾“Å]«‹p>˜õ-È„¼¾’½ŠÓû®ƒ>pôóµ}>ˆú@]Í*¾—6Ñg‚l>—NNÍ+Èr¾‰Š[’)ó7s¾˜p`„yƒ>“Šó¿6t¾w]´%þ…-ì§bÙ*>– 3±»1¾—bXWøXé>Œ!i,‘:Ù>YýƒÝAÖľ€ßw.`Ü>—ÊØfþôæ¾”3Áƒ™c>}«ÿL@>aû^ä(>¾”ÄcÆsœ×>—R}¬…Ì/¾ŽwÇÊU0Y>.LUÖAe>š¹¯Y_F¾—å¹ö¾û>”·óÚ…c]¾ó¸¹þ2Ѿ{9“€£³Ú>“j¡é‘¾—ømKÜ)>EAVh¾`Ežˆ#ï ¾Š"|hˆ>–%˜Ž]¾¾•°ð>„Û¾r`Xv>sÃë‚=º,¾‘þ6H'>–É‘$î f¾‘,Õz`ߘ>nPAï9½>†Ÿ…„r¾•)w)ZÇ>•SJìܾ‡‰ïfÓè¾hÞ³óªç‚>…¶KÕ¾–RÑÙŸ >‘ñ{jÓ®î¾uŸ @'¾ƒŒˆ=o>”ÐÎ펾•k:Ÿ‰—˜>‰ý6ûÔù>U t¼‰a¾íõåHq>•¼Åõk ¾’“Š°z>{Û}q²Ö>J!¾’ç]!*”>•`&1e>g¾Œ2:ê>;a:ì.>ŠÂ#E¾•EêÁ>“7Dìüܾ€ÜGZžxf•Ÿiµ>‘¥¢¼çÊø¾•2Û­­ÅÌ>Ž'üÔ»×i¾`é‘Úƒ-¾‡„—‹nï>”7ŸsFB¹¾“n*cÊæ9>ƒ—>È­zS>q À}¾Q…€F4A>”äRYÍl¸¾Üb™H]>mÜ‚D½ßO>„:gŽ}9¾“KðÃæc>“¦ôÄ›N…¾†V”¶"V¾dT Zõ­T>Ùkìr+¾”u¨à0¼¯>§Mݿľuæ±U¿¾€è¨çñ•>’GÇZHú¾“½—ãê1×>ˆh¶…–Þ>K{JPeÊ‘¾Šôt­A¦f>“è+BÞæq¾‘>¨-‘Â>zörd’1¢>{))î ˾‘,tAt>“±þ|Ÿf”¾Šz c >HñaË}°>‡÷Ö4ê3!¾“=F?³Ù>‘´„ãü¾€;&Û²B¾t†í+I>ù»-ªÁ¾“…}þ(]>ŒN;À֓ƾbåyâJK뾄éÊÜ°zï>’v‘™Š~¾’,É-r>‚Éie}>kå3iE¾tîèIÁ)>“8c'º¾ã¬T`Y>o#Ür©>Î/5ʾ‘•ÄnÐ:¢>’:fo Nɾ…$^3ºå¾]âLÓÈ}W>ŠÐ|ZId¾’ÌVÞðÑd>9xÍ8¾¾uSA¦%¾}VµŠ]Ç >œ¾Õƒò¾’JÛlC)æ>‡Gö¥¿=¯>2‰<®Ž¾ˆéâ=òT>’AüB ¾&¢¢<ëu>zÎÝkåVy>w Ïx䌾óº¡S>>’:«u"¾‰2írQK>T Wòt>…9`7î?ÄìZQ_¿±{RhTÄ?œiBˆ•ág¿{¡Ú÷õfi¿k­4­¸ºª?{ é1Ñ¿w¦’ºÀ?håF˜õ¿-PF,ög ¿[Ml4™m…?b—«‰¿] k%jÓ½?G)ê_BòV?8Œº51¿PÈg™Ëc?Rôª…{¿G8ÆeH ž?c²eægá?<pS@&,¿F+É]˜Y¶?Cz8K!âz¿2’íaŽB¿n.¨cîÕ?9.}i¿=¸,èŽ?4Ú¡”<¿0éÅ9¯Q¿'§ÀÐc?4´>?í¿3}/UQ©?#ù¼:éœ?’½úûè}¿)oRŽFß]?0Tû‚H¿(…Ù3·? ‚3"G²?y,®-]¿'–¡2šn€?'xÄØDZp¿$»³¦ð¾ðŸ¾¬T†™?ÏÑåIÕ¿$„;ñ³É?² w+l¿>ÚÒ~¯øÉ6„¿˜í»É?/JxZò¿£$C¶k?¿,éV ?.=gˆðD¿‹ì0u¡>?Šéh9m¤¿ ¿¥ƒ0`>¶„ªuø¸e†vck>ë2Û×;a¿ä3Üù;? `¸®¿Î,ˆîøü>Ù€õN×¢>ú#¡Kþèm¿¦( >·?–¹_W¾õÅâþÙå¾àÂ?Õìu?ªrÆ+¡¿Á6§÷ä>ÿ•&¤ƒ¼'¾ÝFf?ÅS}¾ó"MZZ[?å/–f¿Í[ÂÑ™>óf%o#)>ÓU4fÛ×¾ùØËt´ù?)ª¶dÄ̾úûÿË&>ß)–nkØ…>ì>Ô9”³ã¾üÆš†I>ýÝ…pÓU¾ñpÚçú/,¾ÂÙ&øgš>ôPXîÚÂÔ¾üh¬Ä‰9I>÷_Oîž™­¾ßé¿â¹ ¾äß‘×ë÷”>÷srÞej¾ùd (Ç>ï–ãà(æ¥>¢ßE*º¾ð ÿ áf>÷ί,‹a¾ôw$3ÇÑ“>ßõ³àÍzÔ>Þ§°-øu+¾óPvŠ>õÔhÁh‘6¾ìÆß…NñX>¦ ñ9FW<>é»dÑØ”¾ô&ºg[Ü›>ò*Õˆäü¾ßâ¼¹¼J¾Ö(1êr">ð\”ï˾òï# N>êWb#Ѹ¾¹öùïýä¾äš¢Ëa@Î>ñ1‡2¹Þä¯ é5>Ï–Æé¾êÇVMGæ½>ðŠ¸ÅÍ#¾è5/ ïäc>Âx«ñê‘>à¶ø³ãý¾í†Ù¡XÏ>ìË'H(*Q¾Þ ÿȸyh¾Ä°¹7³ÿÓ>æu#oõϾí?—J;ì>æQá·¿è¾Æ}Û¤LU9¾ÚW™½9À>ézöTAP¾éå?Ž£ì%>ÝØB.·ñ>¸Õø±zÙ¾âáÀ+ÒRÁ>é¬ÂÆ¥Ué¾ä¢yî>U¬>ÉkÙ~?À–>ÔãA¡#2¾æƒÀì}Â>çaÐŒ4–!¾ÜçuÔÅv¾§)¬ë†>ßȧ.Fjå¾æˆ2¤kG>ãodçäؾ˄íÝ)À’¾Ð`®ò9>ã,J]Œ"«¾å.U,(>Û‹™$˜>lÛ–Å7뫾ڼ˜«9 >ä<¯²5íý¾á¿½O>ÌúÉÛ‹>Éã<Ò•¨(;¾Ùø"6Ÿ4>žòRñØDH>Öqyµ23¾â .#ÂÄO>à~âé> ¾Íñh¶¢3¼¾ÂîWHÖ >Ý€ïöÛ5¾á‚1ÍOaÿ>Øèæ[q^!¾­yì?FRv¾ÒÄ÷úá>àΑ¾Þ³UA()>΄ 0ׂ>»8ñkþS¾ÙPÇ=œ1>ßëÊ T×¾×Ü`¤Õ?>´iÁ¼;Å«>Ï1‚;;±ì¾ÜÇ+êàÅ>Ü—¥ªRFоÎÈáms­‡¾²6»è]¼R>ÖëC#‡O¾Ý!ÎY,è˜>ÖÓ겎¼?¾¹Å„£c;ɳÐÈ(DE>Ù»/©eվڤ߼^s>ÎΣ,Ó[>¥[Û4ã¾Ó#H²¼2>Ú›vˈ`¾Õк¾ú!'>¼²¢^>Äìí%Ýnf¾×¥Rî¬Ø>ØÖ(+cxì¾Î¢p‚•Ô¾$5ˆHY>Гà…³O¾ØOtY㢠>ÔÓGµk)¾¿¥þ(v]˾ÀÀÀAeiµ>ÔŽÓ2yQö¾×'mf‘´ò>ÎMGSP¼3¾xv¶ž«™¾Ì› Ëê9q>Ö6vöÃC¾ÓÜ"¤íh¯>ÀüðªZNk>º2DnÕX¿¾ÒYn²ê¹m>Õ•@'Ÿð¾Í×Ô|ÇH2>™-â5±>ÈŒv`ë̾ÔJäÏG[>ÒëWk'uܾÁã¶KŽg[¾³ÆŽ-íp‹>ÐYx2A¤¾Ô¶De‚ >ÍHHFΣ¾¤§aû»1–¾Äë„Sì\>Ò…L^ÎV¾Ò'9DcD>‘• 㜬>¬A5žDd¾Í%„#Ô|>Ò»Rœ?x¾Ì£[sÛè³>«ŒgHí%>Áªx’¸²Þ¾Ðã‰üØ>Ñk56|/¾Ãý”‘¥µ¾¢Ln˜ö)>ÉÂ6ŸåV¾Ñnñ?‹µ/>Ëíx[:J;¾°³ƒÍ1û¸¾½{—ÕY¨>ÎÂ{ŸD(K¾Ð@=žHå¸>ÃbòÙ.Â>“ žË” ¾Æ½/‡©S#>Ð5º< Ë×¾Ë)®cèž>³,CKùF>¸7‹Ó¤ª¾Ëö0 Žÿ>ÎÒÄûL—Á¾Ã“N¦o5m¾l‚o™‘bª>Ãùå0)«Ä¾Î%¿û>Ê[*‘Jl¾µ?Œî¿Õ&¾³xB¶cÐ>É] 6·e¾Í1Å\m >äüP«Šn¾„'_ã ¾Áqãgì>Ëí.zŒ¾Ò¾ÉƒœÔyÑ >¶ù$š~>®_:Ø÷¦ž¾ÆòitÓV>ËœõYëBl¾Ãœ$~]å>–þhS >¾>2¢r¾ÉÜ-Ð’#>È¥Œl2r澸dVï)¾¦¢í[$ë>ıuÈ>¼t¾ÊW•Ѐ>Ã|SºVü¾ Qòák¾¹ùU>>ÇæÌÜTþ¾ÇÂ8e–U¢>¹ˆïêÍÖÍ>ŸMKhÀ¦¾Â—o6Ã7S>È—f×s ¾ÃH‘‚ßž>¤ñ ”;ï,>¶ ¨\â¡¾Æ [ K-´>ÆÛ@u3÷ÿ¾ºoòÿV®¾’°Ou-êÔ>À¡#›uuŒ¾Ç&! UU>Ã{ÔÇgx¾¨úM¿Åéç¾²p^X½­>ÄH¨¶ ¾Åñ‘1„¨Ü>»j¶mÐ>}ÅÀÞå5÷¾Â¯Uv~öJ>¬{œGþO>®;hëP¾Â›˜¢E/X>ÅiÃ|¾»¸“@6â>g‘ 1 Fé>º)^‚{*x¾ÄeE²>ÂNéZ?½¾¯oM¦«â¾¨˜d»ÏÊ>Á{³«R„¾ÄhM9>»ï’ÁÄÖa¾ˆXk¾,y徶ô/P>ÃæÛM¾Áá|‘ïÚd>± ŸÕr>¢|èXØØǾ¿2úŽHè>Ã.‹Aýxt¾¼ýÁÓn>”tŸr ‘ >³óÑ©©7¾ÁÏk¥|ðe>ÁkêÔŒ½¾²$CÓ¤‰W¾š¡dÈ#–W>¼#ÈÁ€`¾ÂC?œÁ1±>¼ ‘Œ®½¾¾›ÞÏaNúO¾±$ù'*Q„>À”A¯=‘Ò¾Àìu*+>³ZµuçG>‘±R!€†¾¹hÔüoŸ>ÁYRÐÌB•¾¼U¸Š(6>¡=ÿ+ _.>­ ÉXµ¾¾Æß Ù8`>ÀeÔ{Î9¾³ÍÖ)µÍ¤¾€ÏM$6‰ø>¶Ð£öúú¨¾Àq+¶ŒA>»ÑM«X¾¤-Ó’Š ¾¨ ÝôÌ8¥>¼y)½˜¾¿²¯û­ª³>´f³Ìó¥>:•º¹åƾ´YªŒ › >¿EIH\ß¾»bº>¦ÅØÂ’’æ>£‹è7«=¾º?zãþ×y>¾+‡¾´ÛÃ~ØŽE>{Šq¶Ól>²…Úiʾ½OzòÕ"S>»œº•%¾© \¤ ¾ž†ˆ¶®Q’>¸#F ç&¾½bØB³ÜÐ>µ0T?cÙ¾‹k)÷k”¾¯“Ù·¤6n>»ŽçžGQS¾ºWòVºÑ>«¥‘VÃ>–Œ-èÔýO¾¶A/~¿è>¼/HÉ»œ­¾µf©‹ù, >“™>ŒiZ¬>«]v¥Ѿ¹ÔÎóþA4>ºµ"Þp¾¬».멦¾Ž´4Š×`±¾ºõì0LÓ >µuÜG¾™ËW=¾§_¿Lõkk>¸"/ðo«Ž¾¹n!²ž­>®-x?ÈöÛ>€nä%¡¾²"»0Cm>¹¸®¨²o¾µ‚Ý:$5G>ž*x­1>£˜ÁIJ>¾¶w8Íé/d>¸¾ö!²Ó[¾¯bKÞþ%¾]çí Jü>°>xûWY¾¸vòfTvN>µlùÉãE¾¡<»ÕúéÔ¾ ¯tõÈm>´ÔÊM¾¸’‹ªŽ>°.Ûå¨Ù¾pp$`&¾¬ì½«N‚>·3¦Pj¡î¾µAlDøî>£7­ÄH¾>™O¾ §Cš¾³;HÈX|>·:(LÄþ¾°‘ºáuY>ƒ'ÞE€>©€š`ο¾µï6:_>µNÄÚ&8¾¤øä]Ô¾’õ†wan >±ª§ƒï©ß¾¶g{ŸÃší>°Ûˆ…¾5V#^Hľ¦8Üý ^>´ª˜ï2ž¾´°èjb¶>¦‚À|Õ¨¨>‰÷£,åþݾ°#˲H¶Ó>µ‹Š”¾± Ï^³Íà>“6¹0ã>£…ûξ³f±Ñc5š>´Oe r¾§ØË`韾}€¶ä>­NIÍGe¾´§èÆ­H >±**Öꌾ—jô‡zÊ“¾ ì38o!>²$Vîѽ&¾³Ýî0&¤Ë>¨ýÃÛj[>`ùž/:¾ªinÖÞBë>³½n2†Æ¾±2¡tÄ.>›<˟ϘP>šl:\qm¾°äPY‡y >³_TF…‹¾©òÀÅ?7Æ>fFØgÓúê>§šS~‘D澲̈́Õã•>±&¬êšp ¾ž®Ü׫ññ¾”öØ„å>¯N·sÖü ¾²Ó˜H¤ ¶>ª»¡ê˜X¾}i­ËÁ]G¾¤àðk˜>±Øæ'”º÷¾± vÕl¶> ãˆ`Ó>‹Ä›$q¾¬ÜNðôÝe>²<߉²¾«Zž0a!ª>‡/¦Ýlâˆ>¢>q&®4¾°àÜzR[>°Û—s“¢9¾¢BsÃýb¾…³çEö®>ªr»•ÇRܾ±›Ê5¿Œ>«ÑJ†ºJk¾l¼áêÁ¾ŸeH#ù>¯Ìq›gs¾°ž7¨Så>£wêÅ>ï>xÅÝ I¾¨3ÂoöE>°ñ»ªžF_¾¬"Yë‰2>“±ŨÉ>š}ä±ö”:¾­Ó/%2Ò$>°RsÜؾ¤„¨ËÐT¾\Æ9.’L*>¥¾å!)‘¾°?q®Í r>¬O;@\®h¾–lMN|Öþ¾•Å½É[›.>«Ø0 ËMú¾¯ò¼ËDá’>¥j_ µ°¾b³¿¬¤¼M¾£väÐÍ[½>¯ l¾‡éU¾¬Zt‰© ³>™nTEÑ>‘?‘öño¾©Ý@Ê‚;>¯'üߧ¾¦*„ »ž >xÛG‡ãD7>¡¬EW uÖÕ¾œ%îæE4n¾‰Ò’<€£z>§ãV—…€¾®F w [Ä>¦Ç6™1¾ƒ¬íŸ©”7¾žÝIUI>¬9Èñ1s¾¬FöÍXò>ž•ãOÇ9>Œ¥ƒt’¾¥ìx/õï>­P–ÞµÑI¾§@ÅÔ^&>Šj]-"d>™å¾J ¦¾ªr¯›j>«Â€„Ù1¾ _íö!ªh¾sV]±g«x>£ùÕ‹X¾¬G·á°>§™Ì̾TNâÀÝò¾•ËÚŽ'Ÿ>¨ÙFN:Hø¾«XJ-L4>¡RèTwì>QŠsžáྡྷ Lè|s>«-ÕEÇó¾§Òü9ˆˆ>“4$^™Ò>‘ÓÖôeÉw¾§:Ú÷ÁÒ>ªÔÒS°T¾¢$ÕÐ}á¥>c‰&y UL> %Ÿîƒ`¾ª«ÿT,>§îH^jY¾•Ö1óÜ;¾‹þoÙ^›Þ>¥˜õ9NB¾ª:FÓõ¬z>¢Ö³¡¯w;¾w·Güj¹¾œŽjsæ¤p>¨ÍôÔzDE¾§ìf{&>˜:‹ÚkÝ >„žÕæïiœ¾£ô–`Α[>©‰ÊÄ´2¾£i}Xué>Ïÿå‹>¾>˜ãkýÞ𾧋WÆÏÖ >§ÏºÚ].¾šc,+»ó¾{ôãâ¬B>¢O½î(àؾ¨Åy;)Ó*>£Þ29$Bß¾‡©[4cÂ꾕M}ZîDn>¦>w:Oj[¾§˜©ÛåòÀ>œOË5¨hŸ>kp’¾ «W7¥û>§îj0Øòᾤ5ÔM<ÿ>ËF×ì‚>‘ͼ‘?‹û¾¤èå]ôă>§I?-oMv¾žÁ ¿é¸¾$ÇðÈOû>žŒKŸ¤¾§­¬l`>¤qhüA»j¾‘0dsþ꾌ÎM|Id›>£Œ2úú€¦¾¦âZ ³…›>Ÿ|ˆb‡¾g6¥9’‰µ¾šÔÁžÙ c>¦PÉ#ù¾¤‘ú0k…>“a#¡Ñ™>†5Z6dB¾¢)ß¼µÑ>¦eØ‹XNw¾ _œ#½´>w3r§¢Ÿ>— Ù¯Wkv¾¥ Uõ55¢>¤˜˜k#&x¾•|{L¡Â¨¾¬;€ë>Ö> Ãiù¢ô[¾¥Ôt ý> äfüز۾nâÀ"×¾”xZ'Dz„>£øÄÓÉËo¾¤†TJ–Ú>—dw²7¥™>sd0ãïa¾ž´|øÔÊ>¥0‚4 ‘F¾¡O\mv»z>†-y‰àB>‘^š:·š¾¢Ü‘üÅÄ8>¤\Fèy¾™Œ„éý¾^rPíõš>›ß“°Sc¾¤zm‘9F§>¡ "…wx£¾Šò¡Ì@{ô¾Œ©âê†èÛ>¡¶À‰B¾¤ýòŠ>šš$(£”¾MBÆy Gñ¾™ зYÙš>£´7‡ÌŠ¾¡×énCƒb>^!ýR>†½iÄؾ ‰6–R¡ >£ÅK+nÿ ¾›èéÊ$ó>là m~æw>–8å|#q¾¢ÞÈÅC!>¡÷A ƒŽ¾‘·oWU¾€øìà+Íð>ž©ãMÆžõ¾£Z¤”ƒá>ui“éq¾x–Âb¾“lgȤÚ>¡ûözÊ6¾¡þºÿªy>“’a:ݶ?>vÆØ2I÷þ¾œ7—PÒ®û>¢ÜÉ18ξòªxdhã>7ò_¿>§ßꤡž¾¡ ­büãb>¡ïr’êD>¾•?³gZƒA¾gúÆ}?>™½rä–x¾¢Lè²çrÐ>ž¯Q•œ ê¾…’»È^¾‹Û~5—Mä> ¾<Òïú¾¡Ê|–J<4>–¿eK@m>9ñÛZ•oÛ¾—? ¶8pë>¡¬9‡AȾŸ<‡( >‰ÄßSw2>†€È!âá2¾ž/¨¸Xù>¡[â#Ë‘¾˜‘ýŸ–>`Ÿr ˆ>”¾?Ô¯åؾ ûöí¡>Ÿœ?ý@Š'¾¨À·Æ«T¾D%Új`>œ ÿ}ÄྡBp[œ´š>™6wMŸÒº¾qÅÉdÙQÁ¾’>‚™‡]> =^ùOF¾ŸÎÖE û>·/kGº>xT4eƒ½¾™áñjöN> áPÝâ­¾š.ló=1>zÀ£â‘>ƒ0Þœ¦?¾žãj'mT>ŸÖl˜›Kœ¾’>¿Þòò¾lÚ&I >>—²m&{wê¾ nkók_>šùíŽÙ¹º¾›ÌKÀ‚ˆ¾Š•¯Ã`òv>4ƒ˜{_¾Ÿ³“,Ãé>“¶FÖrÃ=>SmüÌ˱%¾•zV5 ÌÄ>ŸÔÜôÙ×¾›™â%]}>…”’böM—>…·ÑÖñ¾›pžin£>Ÿhžå?g¾•ÔXHƒ>Qd¢-^E^>“=+Nvz7¾ž­ª’¶Yb>œÈj™É¾‰FάÈñ¾€ïñ?^-:>™š/¶t\¾žöVœÄÐ>–)§ÜF¾jSNËD‚¾ü¼ÍÑŒ+>h¹;yš™¾œXAÏbªÕ>Œ²@2%©>x‚D¹¦ˆ6¾—³þ”K8Š>ž_;kÉÒ²¾—% År>uS!—×>xâÇùݾœ !û¸¬>œy‡ÇyZ¾Óš©Ðõ?¾nÅ“[5¡¡>•À•Ãßæ_¾¤K[›W>—öè„î‚ƾ}ƒÒ¸“ü]¬ž‚>š{1ï…j¾œq¹+šî>‘UÐ…º¬>ZëµI‚Ͼ““í!8½>œÈ0о…j¾˜  wlÐ>‚€¶w£ÀÏ>„‰¥Æ"Uß¾™ñ{x{B>œCKDeÂg¾’›ª¯PM>@/‘¼•?Î-¾›ÌÙñ)4>™ -ˆ¼¾†gâ#U¾€$òk¬@W>—_8ùH¾›ï#9>“ºž²Ìt¾d~!5‰¾bdþÛÿ>š²Ý…¹4K¾™x”9þ:>‰AžÕÑT>w¨—F‹¡Ù¾•«Qðq>›v¹Šß}¾”³CVëÚ9>r×·l>‹F §ä¼A¾™}Óæ-íÄ>™©6»Êu¾Œ?5ÛDeú¾nkC.–g>“è·/…¾šÛ”þžä>•…›ŒJþ¾y’ÝÝš5¾‡)/Icä>˜/ö%:¾™³¤ÎoÇ2>Žø^PÇ÷í>[ô Ó“ý¾’û=y¬^>šfFÚš¾–0ðT (/>€Pyb¼>ƒð¼[2e¾–ÊÈE©×{>™˜åÉ¢¾µÁQ×ss>/r¿dåñ>A0uéð ¾™Cðc?Ž©>–¶*Æ7¨¾ƒŸ]ˆX¾~u…Â~Á>•Q]hç%¥¾™Xr†‰ÜE>‘Ë´)rq¾aQͺªG¾ŒÃ;P­­‡>˜KCƒêá¾—â˜lß0>†³&¿ufò>vìyz2¾“Å]«‹p>˜õ-È„¼¾’½ŠÓû®ƒ>pôóµ}>ˆú@]Í*¾—6Ñg‚l>—NNÍ+Èr¾‰Š[’)ó7s¾˜p`„yƒ>“Šó¿6t¾w]´%þ…-ì§bÙ*>– 3±»1¾—bXWøXé>Œ!i,‘:Ù>YýƒÝAÖľ€ßw.`Ü>—ÊØfþôæ¾”3Áƒ™c>}«ÿL@>aû^ä(>¾”ÄcÆsœ×>—R}¬…Ì/¾ŽwÇÊU0Y>.LUÖAe>š¹¯Y_F¾—å¹ö¾û>”·óÚ…c]¾ó¸¹þ2Ѿ{9“€£³Ú>“j¡é‘¾—ømKÜ)>EAVh¾`Ežˆ#ï ¾Š"|hˆ>–%˜Ž]¾¾•°ð>„Û¾r`Xv>sÃë‚=º,¾‘þ6H'>–É‘$î f¾‘,Õz`ߘ>nPAï9½>†Ÿ…„r¾•)w)ZÇ>•SJìܾ‡‰ïfÓè¾hÞ³óªç‚>…¶KÕ¾–RÑÙŸ >‘ñ{jÓ®î¾uŸ @'¾ƒŒˆ=o>”ÐÎ펾•k:Ÿ‰—˜>‰ý6ûÔù>U t¼‰a¾íõåHq>•¼Åõk ¾’“Š°z>{Û}q²Ö>J!¾’ç]!*”>•`&1e>g¾Œ2:ê>;a:ì.>ŠÂ#E¾•EêÁ>“7Dìüܾ€ÜGZžxf•Ÿiµ>‘¥¢¼çÊø¾•2Û­­ÅÌ>Ž'üÔ»×i¾`é‘Úƒ-¾‡„—‹nï>”7ŸsFB¹¾“n*cÊæ9>ƒ—>È­zS>q À}¾Q…€F4A>”äRYÍl¸¾Üb™H]>mÜ‚D½ßO>„:gŽ}9¾“KðÃæc>“¦ôÄ›N…¾†V”¶"V¾dT Zõ­T>Ùkìr+¾”u¨à0¼¯>§Mݿľuæ±U¿¾€è¨çñ•>’GÇZHú¾“½—ãê1×>ˆh¶…–Þ>K{JPeÊ‘¾Šôt­A¦f>“è+BÞæq¾‘>¨-‘Â>zörd’1¢>{))î ˾‘,tAt>“±þ|Ÿf”¾Šz c >HñaË}°>‡÷Ö4ê3!¾“=F?³Ù>‘´„ãü¾€;&Û²B¾t†í+I>ù»-ªÁ¾“…}þ(]>ŒN;À֓ƾbåyâJK뾄éÊÜ°zï>’v‘™Š~¾’,É-r>‚Éie}>kå3iE¾tîèIÁ)>“8c'º¾ã¬T`Y>o#Ür©>Î/5ʾ‘•ÄnÐ:¢>’:fo Nɾ…$^3ºå¾]âLÓÈ}W>ŠÐ|ZId¾’ÌVÞðÑd>9xÍ8¾¾uSA¦%¾}VµŠ]Ç >œ¾Õƒò¾’JÛlC)æ>‡Gö¥¿=¯>2‰<®Ž¾ˆéâ=òT>’AüB ¾&¢¢<ëu>zÎÝkåVy>w Ïx䌾óº¡S>>’:«u"¾‰2írQK>T Wòt>…9`7›QŠ6ˆU>ï½f“©¾ðû(úÞ¾pÄns¼m>ŒÔ)ïîèþ¾’ ã÷Ê”½>Šáô“öM¾e÷Îx&ÙÁ¾‚PªÊ¼K2>ÙQÖ8Äá¾ØJ­½->‚Z÷Éå >e½ßçŽn¾Ši‹ybz>‘º’p^¾ŒTr)7˜Û>p°®… Â_>~¸Gâ ô|¾üCnµ½>ÿÊUÏ€¾„‰G uÆE¾Q»²T]>‡ßÂ#ÀW ¾‘KtW]vÍ>‡Ñ„ d~¾vàRBu¾x¿z“l">ŽôîX£¾‘µC“ö>†‚üLjæ¾8Ì[Åõ¾…;“¨ž¬>Àä !¾Ž|9õ_Iž>{;wÅÿOÌ>rÃÆ/üľŒþ½¬Ü>í‰Å*K¾ˆCöT‰X¼>]hÅß»>‚ÿhM¦8¾¢Ÿpo>/ß­Ûv¾€ço˜Ëï¾iš`làMk>‰ÏÃÃྴðÇŸ’²>‰Ë>àâÓ¾iäé:|6´¾p*?có>Ž®±mr÷¾£­–gD>‚4ýGòè>[¡Ö!^œ%¾‡vè&ò@ì>]ÎÆHž`¾‹ÙkÈ![>rJ87½ïG>yÆ™*l¾Œú®§ywd>Ö±dS㾄6¿X殾1×¢íÊp->„ÿþ ­®"¾Òa(!€v>Œ#‹`g¼¾w[d‹•¾t+}˜D–>‹3{ %¾Ê¢KR>†Xææöq¾Rš’!k¾‚qP(X>Ž°¼¶×Ÿ÷¾Œò)^ˆ³*>|É;‡u¨>l²^ôJ‡¾‰,M”ƒ$>jÎKP÷¾‡˜>„ « >cýNÝ#°*>›ï ŸGó¾Y‹701>‚G/1ξ€Aé íf¾aV‹¼®>†â9™9·¾Ž÷ºÛ¸Á>ˆóVbK¾ny MÝV¾z:&J0î>‹Ð[7]¾Ò–Ê?E>‚F…ÉFK>HŠ•RG¨¢¾„“o?I2Ç>Ž3Øû«óö¾ŠÕ¯3¨À>t:,_¹½>tŨtç ¾Šîó;ˆ>ä~f9¾„"¸Yo>CS° WÖ>‚*$n_.¾7DK[>Šõsõ,¾xì¹$N.¾n“5š‚Ïh>ˆ5 %ˆx¾·™bʉ>…µÚ™ _¾^÷m–¡¾T8ûJío>Œr‹¿“ܾ‹š@J^LŒ>}NJ’äÃ/>c /'ýg¾†+›¤‡ïh>N-μs¾‡Ké:w>i¾$²šd>z3H>ƒæ¾Šž{1*>ŒÍ¼²Z¾€ªŽ(ùŒ+¾Q—ò:WE>„.&mr{¾Œ¨·ï Ý¢>ˆF^¸Aa¾qćPlF¥¾tùÕʬ->‰Â[”Û¾Œ)W‹ÏÙ>‚~?j®‡ì¾-˜°‹×÷¾·€ü1S®>‹Ê_òGu8¾‰6€ŒàGŒ>ve0çhÜ)>oiÏå»p¹¾‡F MÑ™J>Œ’RIJ:¾„ +Ó¢'>Xmœ¹„Æ”>~­(ñÇ‚µ¾Š´„n]h;>‰ézj’(C¾z¸lÆÎM¾dÚ`u.j•>…[ª ”Òÿ¾‹Á)‰v­ë>…ˆOq÷‰¾f;Ÿ=ëìȾyÅ)ˆºuó>‰k"¯n½"¾Š_Ÿš-ŠG>~¶J2©Âú>T¿OÛ¢ül¾ƒN0ê.96>‹3FŸ†>n¾†¹­è…¾6>oÐ ­×tô>tÁºy^'¾‡ðrV>Š—ª¤Òd/¾+°ž˜:½Ö'Íu¼ì7>!iW±µ¾ŠkÀü«;®>‡±^)¾tr–ý^lõ¾o[|ß6mš>†I7¼î½¾Š’Üšùs>‚ʇt¬ Y¾T,T—€`¾}¶¥Ð•Ó0>‰lîÜVê⾈lã!s¢¿>x²„•¶}4>e(ž˜&nt¾„xpðú;–>ŠP¨¾„4¹ØMâ·>cÍyŒº„|>y@1©%ɾˆ9‡åÙ >ˆìaœÞæ\¾|¡hqª¾V+Ä*#$>‚ƒ•N ﾉÔUi«>…gÇ3µæT¾m'í¤Ø¾t,fR«ù>†ÔÚËXµ¾‰.[ . ä>€¼*È~>gòöóѾ€nM»¯ì>‰”ßZû¾†a˜½Zt>s¿SÝ?¸>nˆRóî ¾…BmÉTˆN>‰3íÞÀTê¾´ÓÚÂ$<>Q¥ái[7Ó>|}JÔ-öx¾ˆ/$Ò†õh>‡ ›MÓ:‰¾w-¨• eY¾d©ŒZZé<>ƒ†SØP%3¾ˆü¢ƒ+€<>ƒà9ëFB¾bS¹$~vžwñ£aû»¿>‡ ⟳ý/¾‡£±„I >{ú¸l•>Už†ÚÒt¾¤é<¾>ˆŠŸ%ëÀk¾„K'ÒnÌ>kr&eÌ¿>sF–ô-„¨¾…·yÓÙêÕ>‡êI&Å"E¾~‰‹¿Úð¸¾!B#Áª>Eãwù¾‡Þv»)ù{>…Bxµq¾r Þå»ì¾m §Q2 >„4ˆ,¾Ê®¾‡ôN6‚«Z>€ÖƒGTï~¾PêN!ïKø¾{ Ûì(T>†ûUßÓȾ† ¦®úš>v±@[å>cv©ßÛÑU¾‚ˆ Ç >‡ÂCÂè+¾‚4êóBgG>a²„å¿y>v£i{‘/œ¾…âÞ[°}_>†²|—Ú¾yÜb*Zxm¾SȺOÕj>€µyNxZ¾‡U(³ýEV>ƒ^'šÕ̾j’"`“c¾r°nF>„™1*¸5ÿ¾†Ç¯‘£>}F˜Õ”«ë> ¿°J?•¾}…Ï"¸ >†®˜Î@Œî¾„NâêÀ…>q}­ƒ0 >j÷‹Æáln¾ƒ í×dÄ…>†ÐñÕ)Fa¾€)R^#Ê>Q¬{Þ2Ûp>yfÞ¢"‘:¾…ШßÁÖ¦>…>v×L`¾uoš·y¾a¥Z ¬ñ> ô­¾†žÔ°h‘c>|ߨ{#¾aм4¸ne¾uíø\(g>„¾ Š‹òß¾…ó§bi>yñ™ÂÞ>P¬§HAý¾n’@aS}>†1loèù¾‚›‡Ï€>jn3~Ú€–>p°³iwÔ•¾ƒyßÆQ 1>…ÂAt}ÀÔ¾|_›*2ÞŽ>¼@…BÓÈ>{ž€–¼wß¾…‹;3?­è>ƒW?gd„¾qJ°j¯©¾h_g S) >‚ÚÝ/Ù-¾…Ƴ…A6>N_„²+~¾S¿OBþÓ¾w–‡ƒÆ z>„­}êÖÞ¾„-íêVDï>uèÀSü>^ýu5¾€lÅÇþ>…Ž¨hŪ㾀슶¸Ã>b—j™¨¹>sc¡_`XÖ¾ƒ›Ó!„Ȇ>„Ÿzr1æ¾xœIïÎT¾HÜÀ-`[>}Vmêξ…=¾A>ûüÕnrà¾jîÝS=ï¾nÓÞ`¹ô>‚X™Ý;`¾„Õ<š EI>{Çî÷&Sá¾5óâ|fª¾y”™hè>„q_Áy•å¾‚Óõ)®Þ±>qhf'ìé>eO~à\ß¾€èyùqÆ>„Ϙå*†¾~”®ú€>Vúq=Z­ô>u#'Á¤¾ƒZL3>ƒq®¿~¾f±‘¥¾„ŽUÆá>€}­áÿT¾cð×CG…)¾q{uðÌ í>‚yóvÚ‹v¾ƒÔ¾‡¤6»>xo9ÝäFÙ><µ +>¾{"ÎóT.®>„ÁrÿÍÕ¾{9£þ>kþµø,¡‘>jvúµž«¾3¤ü°pˆ>ƒû—…¾çݾ{s.­! ˜>D„_ž²dp>whº±‹|„¾ƒ]qÜ'Ê>‚@¦Î”˜¾qÊ=]±U¾aÒäÃ…U">‚ )¾ƒç»6>~noý‰¾[:Á³=¾s|NÞ®ë$>‚s "9’¾‚Ë°˜È>uLpìáí>RGºÑ\JÕ¾|LüÎ;­>ƒ–÷ÃOú¾€)ý—S“6>eȱûià=>nσŽV“¾Uæ0 >ƒäEPp¡¾x~UZ'ª¾fø1eÉû>xÒ@”Àù¾ƒ h$Ÿ6>ù,u%ð¾mˆïW´µ­¾fpÌ xF>€žž`澃/ÏÜÿ@Õ>{U(nÿ{P¾OÖ¾¡C¾u÷åøîÐ>‚K‚¤Mï¾ÁðÝPV>rex›¥>[ç8FJT#¾} ¹ÎùÎ>ƒ{[ üç¾}Ê©Ät->`-XV{æÔ>q4ÓT¦ï¾T¾úÈ=#>‚5À_ºtU¾u»Çpˆê¾EÒâ ¶œp>yã¹wp¾‚¥Ô»øòÞ>ÖPì04v¾h ŒuCaR¾jT"—m@‚>€+†¡Ê‹¾‚nÍÁ$>x½)‚ H»¯s¾€º ¢†í>ox€;±->bDSg ¾}© Às>‚kó?€W¾{aEŒÛ!ã>VY™¯¥ä+>rªœ…ºšŽ¾7-|aÂ>Nõë 5L¾s.ÌG=>ƾSuBë ¦J>z¦ïïœÏT¾‚-Š€uÝK>}¡[FÉ&¾cÛŒ¿¥~¾mŽ=`Hæ>€0Hùz‚¾©8/ô%m>vRïÌ?Ÿ›>&´Z%Іx¾w\/´²ue¾uÚ¾x.>j¦6Y ká>e‰šÇ쥟¾}ðŸOöûS>Ç.”Ÿ¾yõeE|¤>K¡z3#J>sÒ0ÚNªŒ¾8¼à³>€l^g´®*¾pÛ¡LªÆ¾ZÂøºùZK>{(¤P0*ʾ©˜Ï–+>{ŠHYúbº¾]npñk8H¾prÔ¿†W>€´“…·²¾€ã`œ|(2>t¢ƒ‡ e>Dí­B))¾x€ t’>PXB™ç"¾}]Œ6÷ƒ>fUêÃј>hgÏÖ1¾~ÂpŒ5Ö>+Is“¾wPóV¯>7gOÙ9b>t´šO‰áû¾€½­žƒ0—>"üß˾m„G0’kr¾`rÇâbÏ>{po¡<¿5¾`íÌ>y– ·f×¢¾U¹^ü³®¾¾qáK0Î>æõÎè-¾€!™â&^>rù誥à>Pˤˆ5D¯¾x‰—=­>€â'>–žB¾{Áäo£3Y>bƒ R:/Ô>j»7»çc¾}è9"?>€w4Ìà ¾u–3ì¼¾ü7ùk]>uXKy–V¾€j¼FD_ù>}€u¨ù®¾iÇuýýÚ'¾bø€p7}ƒ>{‡¾ÆGcO¾€u)8Ú>wʉÊë<{¾N“$291¾qèö5=>u¸‹_j>¾~ÎM-S×>pG¢òýpÉ>V)/8«- ¾xÎ÷2€>€ms§I±}¾z[:¶®>^ZøÍïe>lŽ,'°…¾}¨¹OŸ:>¥°÷ÿ¾sa±Ú ÂH¾9B>‚þÓ7>uÆdm´E¾€ê%´xX>{ù ïˆÊ¾f~ ÷·?³¾e^­Yˆ >{w™Lßr¾€ÓÖxÁ>v'üû ̾B±À¤ý…¾rzÚiç>~ìßüDˆž¾}kh‘“×->mZ›ÔõF>Zˆ²® ñ3¾xçzŸ_> >ëÁ«¾A ¾xþb:Ñ/>X »Dó>mîF4t#¾}LÑÖe«ê>~ið¨ÙÈξqÖ·p›uE¾EÚŠ;« b>vipƾZf \mo>zòW;¾c¤ñze¾f”ÃãÝŸ>{D+A™GR¾~ïÂ%)Ü’>t®9N홾2[™:=î=¾rÚS Fp>~R˜Uä¾|ÇÎ~e¹>j´bÑ>]ÿÈËåѦ¾xÚî4¦wc>~üïåUý ¾w*ëkþ:>SÉRý/$>nè.°Á}¾|Ú8¼ÉCV>}=ýÒÖ˾p{×Á䥾MG¿¤µ;>v±8(ûd¾~<ÐÝp>yBé¸?¾a8-ºo`÷¾g¼°½!/>zõË*=›i¾}ä ÏcrÙ>saÿrܾÇ”²‚!þsR“Ÿ>}¬ñ—^ξzí€0M±6>h)¨Q xl>`Q”FnÅÁ¾x®•†±g>~œÿGu ¾uí@Á²i>O˜ómmã>o„&´úmõ¾|U³ì˜a>|%né7rô¾nžÄšm̾Q‚.áÐö¸>v Tˆ–¾}Ä”¸½Ò >xy&¥‚ª¾^iKÀB6I¾h†SÚIK>z‘®]ñÆ5¾|æéÞRéÞ>r>$G4È>"Ë6O#=„¾scÆó!î>|ÿ+\ýœ¾yÕ¾ó²Ð`>f&FÉzp>a?»öTû¼¾xf½«Háé>}-Ãà?P¸¾tÖhB~ÊO>I@dç˜y>oÌÙN)Îؾ{ÄÕÈ7º>{"åÖÈ}M¾l¢(ÿ1¾SœDòòðN>uߟ´¥Oü¾|ú±'Ÿ— >w ’ʹ¯G¾['Ü®b2¾hø…éU2>züs%^¾{øOÒOáƒ>qE^A•F">2ƒ†Q£èâ¾sn+.ÓE>|MiŒÏ²¾xÚ«Ÿ1ø]>d‚Â{²¡À>aÓ†¤ú4¾xÕêP0î>|Tl·Ì†¾sårŠ¦é>DhX–y7J>oËØ)Ub@¾{*Š?Ñb>z6x™ç ¾jýÂ1¶F¾TþDžkm³>u—qŒG7á¾|4v)À…>v$ôa ™K¾X£òæµÛ,¾iñil>y•ÆØ`0¾{n”÷™×>pvÿûBõ>8¾MEqå¾rÑhE_–>{šÙ÷9R\¾wûðþŠÅ>c8wyRñ]>bJ£e{¨¾w— Ë$F>{†ENº¸¾sù°·w>@þ9á|SC>o†ÂAqT¾zˆïSH¯ã>ya? êS¾i¯ª1æix¾U³5ǽ8«>u7¢šÿ)/¾{tÄkÛ4>u]œzµÍE¾VÓB xü-¾hó®Ï5:i>y:žû:¾zPhƒŒ€I>o›t¶ª|ÿ>zè0Ÿä+›¾w8µÅ7[e>bCë YnÜ>b 4»L7¾w3ž~7­>zÄáL3M¾rpÏÞ:^$>=ßÀ@ï}ç>oÄCbÄ¢¾y㲜èÍ>x£§pûy ¾h²¡‰©ƒÃ¾UˬŸ5«>tÃWíñÎ?¾z¼tµb·3ï¾U¨Œ†Ä¾hŠlH»œ>xj+K_K¾y–¾OÁ”z>n•ß*\ËN>=S.vœí¾rï*[×>z7p&¨ð¾v‘3@Ñ“>a¡v¨äçZ>aµðZÔ–Ù¾v„™Ž.¢>zT¸}:¾qêÈÓ{J›><>Œ9rBé>nGö)ÀUZ¾y9^AU!>wûä 2¿¾hD‚ ¾UP%¢þž>t;gËu¡.¾z õÇ-#z>t+[‰Žkè¾U<´Ø¾gáõº£>wÆZ/¾A¾xîötPw>mØrf2y>;û;w³È²¾q™‚¬·e¬>yˆqpðÆ=¾v‹…Ü)>aJÃé«>a!nÏ•¡7¾uæƒq…;e>yf#…è5ƾq„jÉ¢T><øÍíÚ5™>mW`N…Ì@¾x‹ëUü%ß>wiN‹ùp¾g˜¯=+ÛŠ¾THçÏÍå>s¡®…‰$!¾y_X&Z!Ï>s¾:S2a¾U'CºîI¾gd×ËÙ>wÝiç­¾xWhæùQ>m\wëÿó>8vm¢ƒ½Ð¾qsB-À>xÚñÒ²éC¾ur¨k>a9ç£>l#>`Mz&ñˆO¾u;Þ@î>xÈ¿GÚþ¾q< c×…>?ñ cF$–>l4ÿöUϨ¾wÛžŠÔÙK>vê¼lÁý8¾gsKÄ*“ß¾R¿ÙUgV>r÷q¬%¾xº°ñ+>sj¿V›ÉξU¹cvfß¾eçÀA#J>vfî+'¾wÍïÌ?É>mÍ” '>2Ö1w–iؾpZUV¿j>x.LevŽ¾u-ÕÌ€™>amT'¿Á>^}pȪ"¾tƒgÁ¢²W>x4%ÞD”ã¾q5/Ì>Bxø ¾}1>jãðÝ3¢¾w'4ˆè¼>v|þºÞ,¾gŠÊ:@"Ó¾P¼Á`Oî>r;â&…®¾¾x4}t^>s.ñpÁüŸ¾VÎ"›Ü¾d™c‡ý4ã>u©ŒkQ¾wQ„.¿È|>m#ƒh(Õ>&†¥Ñ% ¾o7õ@Ûå >wªÏ4¾tá  ²Á>aÜZž;Ú>[ðïþ¤¾s¾—è½á5>w§:〦x¾püKØ“>EðjI­œï>icXäM¾vlíN^«>veO>¾gÛä”öb¾L†upÄvÐ>qoQj·å¾w|kªz¶u>s‚„çÊ“¾XYù>m^Û¾cÞN—>tãljñ¾vßÕø>mEÀ8Cu%=þ4¼:j'¾m“홼Þ>vÒ+2Hö¾t¥lˆ¤ú >bƒk:{£>Xöïz§ø¾rëEyw³ý>w`5N4Ž¾pþBðCÿe>JQ¬¶Daž>g´ë¨—5å¾u¬#âÆÖû>uˉCGS:¾h_ÊC/K;¾FºnêP>p‘§øš‘¾vÞô«;&³>róBXË+ÿ¾ZQ$Zk‰¾ag-ïŒuB>tÒ¸Öaw¾vs/B[þ›>mžÊyŠà¾"xÔõ^­F¾kÄ «‹^™>v 4òò¾tw>dáØ>c^&/*«p>U•K%É> ¾r =ç,8>vš*ΞÅV¾qÝ ½*o>O‚ý ¹Y«>eÙËÄô~¾tâ9ùtóË>u ô<Ͼi^3>¿¾@þ €‹>oB12Œì¾v>Q¥>rì=ŸÑ³¾\­Uꈾ_@?>s1Y.ÆŒ¾v zÂ8* >n‚ŠI+à¾5öäÅàB¾iËÖ~¸Ãø>uc ¾2“¾tR3ÕÓ@>dd2d׉¦>QѲRü·t¾q|FŽ:ä>vK‹ß´m¾q5Ì}è ³>R» @i­>cÏà7ö5¾t E£ÜW>u;dÖ/ñ¾iåøøþc¾1jÛ½†?>m9}“–ó ¾u˜K¬ñã>rðÔUÒn¾_aptñ\¾Zâ‚è>rC=ß¡¾u£¾òBü0>n»žöZ´d¾B*‹>ñ_¾g¨(Ò„6±>toß¼FV¾t2Ž(å$>eH|.>>KXB)s"¾pÌ0ÿµ>u‡šØTŸ¾qdQêÈ´>V rˆäÜ·>a—éƒÄ¾¿¾s(—w[Ô3>töýLƒ^p¾jÛF§¥h.½ópïTI>kGo"‡~¾tèé6¿¨>>rùòÇý¾a/ÁBÉÄæ¾V`B){c>qB«[m¼¾u7iƒ£>oo/·‚Ÿ¾I×?Ç )¾eV¯Û•W">sÊ>jÁ`x¾tªjw·ì>fÜAlXC?>BV6® Ÿš¾m*ã>tóš- ‹d¾q˜Ü^*ÔÓ>Y©˜!ƒú>^e€‚—z¾r3ÈPÁƒ7>t®k›Bh'¾kæNA Ù–>0`#¼Ïðã>h©æ‡¡r¾t+èS ¸>s¶0¨¾bÎâ›Úêé¾Q€®$ ” >p.DuŒ¬u¾tà ;‚Î#>phæggR¾Q¯Y‡×š¾bØ-;B ^>r撲̾ǾsóIl¶¬é>h>S$XrÚ>1Wøý`éë¾kÆP%€>tR­J/¾qÎ函>]„ÉÓ€y/>Y=—óÎñ¾q*e ¤p>t]a;³¶‚¾m«PQ>A–i y`>f ÍfÖ#¾s^Ngon>s ÜþÏP¾d…Š»­Bb¾H—¥‚¿ <>náDcE¾tA~VÕ>pz©e1:¾Uˆ<ëb s¾`*æà©°>qí÷yé¾sÈÚå…œ>i®“Ýyò—¾ þPG“û}¾hÿåÃ÷g>sŸäÚdоrñÞ®mñ>`É.ž9Ø >S»ÒzÚÇ ¾p w;ð[>sÿIäå¾n¹^{>K~òHVÁ>c`פ²ˆ÷¾r{™Ýýc>s ¶í)Œ¾fJ‡\e÷¾;_±dV>k€íA ¹¾s­eÀ Ÿ>pÙh8Ú~õ¾Z*Xò`¾J¾Z›Ð´$Çc>pÝg˜žÀ¾sßìšËz>k$ Ì.ýˆ¾8îõK`F¾f>¸µ¤^u>rÖ™Iiè[¾r+ã›"'>bÞÉ+ëÆ>KËœÅó.¾m¡b\‡I>sâ8ž\·¾o3h1¥èñ>Rè´8–ì8>`reæƒ@e¾qK¢Î̯>rü¿f¾hf¦½³¾Epxøi'>hĽý+š¾s³=íAÃ>q/?‰Mmƒ¾^îÀ:8EÁ¾Tˆ–a9>odv`ƒ¾sE1\|‡|>l‘ºÔ/èq¾G¿j-Ÿ…$¾cI®“_q>qóÇ3né¾rF9® âO>dú_wž>>øX×Ä+¾jôMHÞ—î>s2ö~‰¾psÐíãv>X:Z„e;S>Z¥’) Y¾pf~Ò‰0>rØ÷yN©¾iØsÄ)Ã>4y•:s'>eÑ@?³¨¨¾r;ìTî)>qtñãÏȾaà €§ø¡¾L:õÄ=­ê>lÏÙEãfv¾rßqï>mì7:ûdh¾Q°£ÃX’¾`P]s|d>pðÀ>_s,¾rKs ¯B>g‚/j >EÇÙ»¾h ƒ£­´F>r]0Óõ+_¾p2Cî>];Ì_™>T 9oR¾nZeº#v¾‘›QŠ6ˆU>ï½f“©¾ðû(úÞ¾pÄns¼m>ŒÔ)ïîèþ¾’ ã÷Ê”½>Šáô“öM¾e÷Îx&ÙÁ¾‚PªÊ¼K2>ÙQÖ8Äá¾ØJ­½->‚Z÷Éå >e½ßçŽn¾Ši‹ybz>‘º’p^¾ŒTr)7˜Û>p°®… Â_>~¸Gâ ô|¾üCnµ½>ÿÊUÏ€¾„‰G uÆE¾Q»²T]>‡ßÂ#ÀW ¾‘KtW]vÍ>‡Ñ„ d~¾vàRBu¾x¿z“l">ŽôîX£¾‘µC“ö>†‚üLjæ¾8Ì[Åõ¾…;“¨ž¬>Àä !¾Ž|9õ_Iž>{;wÅÿOÌ>rÃÆ/üľŒþ½¬Ü>í‰Å*K¾ˆCöT‰X¼>]hÅß»>‚ÿhM¦8¾¢Ÿpo>/ß­Ûv¾€ço˜Ëï¾iš`làMk>‰ÏÃÃྴðÇŸ’²>‰Ë>àâÓ¾iäé:|6´¾p*?có>Ž®±mr÷¾£­–gD>‚4ýGòè>[¡Ö!^œ%¾‡vè&ò@ì>]ÎÆHž`¾‹ÙkÈ![>rJ87½ïG>yÆ™*l¾Œú®§ywd>Ö±dS㾄6¿X殾1×¢íÊp->„ÿþ ­®"¾Òa(!€v>Œ#‹`g¼¾w[d‹•¾t+}˜D–>‹3{ %¾Ê¢KR>†Xææöq¾Rš’!k¾‚qP(X>Ž°¼¶×Ÿ÷¾Œò)^ˆ³*>|É;‡u¨>l²^ôJ‡¾‰,M”ƒ$>jÎKP÷¾‡˜>„ « >cýNÝ#°*>›ï ŸGó¾Y‹701>‚G/1ξ€Aé íf¾aV‹¼®>†â9™9·¾Ž÷ºÛ¸Á>ˆóVbK¾ny MÝV¾z:&J0î>‹Ð[7]¾Ò–Ê?E>‚F…ÉFK>HŠ•RG¨¢¾„“o?I2Ç>Ž3Øû«óö¾ŠÕ¯3¨À>t:,_¹½>tŨtç ¾Šîó;ˆ>ä~f9¾„"¸Yo>CS° WÖ>‚*$n_.¾7DK[>Šõsõ,¾xì¹$N.¾n“5š‚Ïh>ˆ5 %ˆx¾·™bʉ>…µÚ™ _¾^÷m–¡¾T8ûJío>Œr‹¿“ܾ‹š@J^LŒ>}NJ’äÃ/>c /'ýg¾†+›¤‡ïh>N-μs¾‡Ké:w>i¾$²šd>z3H>ƒæ¾Šž{1*>ŒÍ¼²Z¾€ªŽ(ùŒ+¾Q—ò:WE>„.&mr{¾Œ¨·ï Ý¢>ˆF^¸Aa¾qćPlF¥¾tùÕʬ->‰Â[”Û¾Œ)W‹ÏÙ>‚~?j®‡ì¾-˜°‹×÷¾·€ü1S®>‹Ê_òGu8¾‰6€ŒàGŒ>ve0çhÜ)>oiÏå»p¹¾‡F MÑ™J>Œ’RIJ:¾„ +Ó¢'>Xmœ¹„Æ”>~­(ñÇ‚µ¾Š´„n]h;>‰ézj’(C¾z¸lÆÎM¾dÚ`u.j•>…[ª ”Òÿ¾‹Á)‰v­ë>…ˆOq÷‰¾f;Ÿ=ëìȾyÅ)ˆºuó>‰k"¯n½"¾Š_Ÿš-ŠG>~¶J2©Âú>T¿OÛ¢ül¾ƒN0ê.96>‹3FŸ†>n¾†¹­è…¾6>oÐ ­×tô>tÁºy^'¾‡ðrV>Š—ª¤Òd/¾+°ž˜:½Ö'Íu¼ì7>!iW±µ¾ŠkÀü«;®>‡±^)¾tr–ý^lõ¾o[|ß6mš>†I7¼î½¾Š’Üšùs>‚ʇt¬ Y¾T,T—€`¾}¶¥Ð•Ó0>‰lîÜVê⾈lã!s¢¿>x²„•¶}4>e(ž˜&nt¾„xpðú;–>ŠP¨¾„4¹ØMâ·>cÍyŒº„|>y@1©%ɾˆ9‡åÙ >ˆìaœÞæ\¾|¡hqª¾V+Ä*#$>‚ƒ•N ﾉÔUi«>…gÇ3µæT¾m'í¤Ø¾t,fR«ù>†ÔÚËXµ¾‰.[ . ä>€¼*È~>gòöóѾ€nM»¯ì>‰”ßZû¾†a˜½Zt>s¿SÝ?¸>nˆRóî ¾…BmÉTˆN>‰3íÞÀTê¾´ÓÚÂ$<>Q¥ái[7Ó>|}JÔ-öx¾ˆ/$Ò†õh>‡ ›MÓ:‰¾w-¨• eY¾d©ŒZZé<>ƒ†SØP%3¾ˆü¢ƒ+€<>ƒà9ëFB¾bS¹$~vžwñ£aû»¿>‡ ⟳ý/¾‡£±„I >{ú¸l•>Už†ÚÒt¾¤é<¾>ˆŠŸ%ëÀk¾„K'ÒnÌ>kr&eÌ¿>sF–ô-„¨¾…·yÓÙêÕ>‡êI&Å"E¾~‰‹¿Úð¸¾!B#Áª>Eãwù¾‡Þv»)ù{>…Bxµq¾r Þå»ì¾m §Q2 >„4ˆ,¾Ê®¾‡ôN6‚«Z>€ÖƒGTï~¾PêN!ïKø¾{ Ûì(T>†ûUßÓȾ† ¦®úš>v±@[å>cv©ßÛÑU¾‚ˆ Ç >‡ÂCÂè+¾‚4êóBgG>a²„å¿y>v£i{‘/œ¾…âÞ[°}_>†²|—Ú¾yÜb*Zxm¾SȺOÕj>€µyNxZ¾‡U(³ýEV>ƒ^'šÕ̾j’"`“c¾r°nF>„™1*¸5ÿ¾†Ç¯‘£>}F˜Õ”«ë> ¿°J?•¾}…Ï"¸ >†®˜Î@Œî¾„NâêÀ…>q}­ƒ0 >j÷‹Æáln¾ƒ í×dÄ…>†ÐñÕ)Fa¾€)R^#Ê>Q¬{Þ2Ûp>yfÞ¢"‘:¾…ШßÁÖ¦>…>v×L`¾uoš·y¾a¥Z ¬ñ> ô­¾†žÔ°h‘c>|ߨ{#¾aм4¸ne¾uíø\(g>„¾ Š‹òß¾…ó§bi>yñ™ÂÞ>P¬§HAý¾n’@aS}>†1loèù¾‚›‡Ï€>jn3~Ú€–>p°³iwÔ•¾ƒyßÆQ 1>…ÂAt}ÀÔ¾|_›*2ÞŽ>¼@…BÓÈ>{ž€–¼wß¾…‹;3?­è>ƒW?gd„¾qJ°j¯©¾h_g S) >‚ÚÝ/Ù-¾…Ƴ…A6>N_„²+~¾S¿OBþÓ¾w–‡ƒÆ z>„­}êÖÞ¾„-íêVDï>uèÀSü>^ýu5¾€lÅÇþ>…Ž¨hŪ㾀슶¸Ã>b—j™¨¹>sc¡_`XÖ¾ƒ›Ó!„Ȇ>„Ÿzr1æ¾xœIïÎT¾HÜÀ-`[>}Vmêξ…=¾A>ûüÕnrà¾jîÝS=ï¾nÓÞ`¹ô>‚X™Ý;`¾„Õ<š EI>{Çî÷&Sá¾5óâ|fª¾y”™hè>„q_Áy•å¾‚Óõ)®Þ±>qhf'ìé>eO~à\ß¾€èyùqÆ>„Ϙå*†¾~”®ú€>Vúq=Z­ô>u#'Á¤¾ƒZL3>ƒq®¿~¾f±‘¥¾„ŽUÆá>€}­áÿT¾cð×CG…)¾q{uðÌ í>‚yóvÚ‹v¾ƒÔ¾‡¤6»>xo9ÝäFÙ><µ +>¾{"ÎóT.®>„ÁrÿÍÕ¾{9£þ>kþµø,¡‘>jvúµž«¾3¤ü°pˆ>ƒû—…¾çݾ{s.­! ˜>D„_ž²dp>whº±‹|„¾ƒ]qÜ'Ê>‚@¦Î”˜¾qÊ=]±U¾aÒäÃ…U">‚ )¾ƒç»6>~noý‰¾[:Á³=¾s|NÞ®ë$>‚s "9’¾‚Ë°˜È>uLpìáí>RGºÑ\JÕ¾|LüÎ;­>ƒ–÷ÃOú¾€)ý—S“6>eȱûià=>nσŽV“¾Uæ0 >ƒäEPp¡¾x~UZ'ª¾fø1eÉû>xÒ@”Àù¾ƒ h$Ÿ6>ù,u%ð¾mˆïW´µ­¾fpÌ xF>€žž`澃/ÏÜÿ@Õ>{U(nÿ{P¾OÖ¾¡C¾u÷åøîÐ>‚K‚¤Mï¾ÁðÝPV>rex›¥>[ç8FJT#¾} ¹ÎùÎ>ƒ{[ üç¾}Ê©Ät->`-XV{æÔ>q4ÓT¦ï¾T¾úÈ=#>‚5À_ºtU¾u»Çpˆê¾EÒâ ¶œp>yã¹wp¾‚¥Ô»øòÞ>ÖPì04v¾h ŒuCaR¾jT"—m@‚>€+†¡Ê‹¾‚nÍÁ$>x½)‚ H»¯s¾€º ¢†í>ox€;±->bDSg ¾}© Às>‚kó?€W¾{aEŒÛ!ã>VY™¯¥ä+>rªœ…ºšŽ¾7-|aÂ>Nõë 5L¾s.ÌG=>ƾSuBë ¦J>z¦ïïœÏT¾‚-Š€uÝK>}¡[FÉ&¾cÛŒ¿¥~¾mŽ=`Hæ>€0Hùz‚¾©8/ô%m>vRïÌ?Ÿ›>&´Z%Іx¾w\/´²ue¾uÚ¾x.>j¦6Y ká>e‰šÇ쥟¾}ðŸOöûS>Ç.”Ÿ¾yõeE|¤>K¡z3#J>sÒ0ÚNªŒ¾8¼à³>€l^g´®*¾pÛ¡LªÆ¾ZÂøºùZK>{(¤P0*ʾ©˜Ï–+>{ŠHYúbº¾]npñk8H¾prÔ¿†W>€´“…·²¾€ã`œ|(2>t¢ƒ‡ e>Dí­B))¾x€ t’>PXB™ç"¾}]Œ6÷ƒ>fUêÃј>hgÏÖ1¾~ÂpŒ5Ö>+Is“¾wPóV¯>7gOÙ9b>t´šO‰áû¾€½­žƒ0—>"üß˾m„G0’kr¾`rÇâbÏ>{po¡<¿5¾`íÌ>y– ·f×¢¾U¹^ü³®¾¾qáK0Î>æõÎè-¾€!™â&^>rù誥à>Pˤˆ5D¯¾x‰—=­>€â'>–žB¾{Áäo£3Y>bƒ R:/Ô>j»7»çc¾}è9"?>€w4Ìà ¾u–3ì¼¾ü7ùk]>uXKy–V¾€j¼FD_ù>}€u¨ù®¾iÇuýýÚ'¾bø€p7}ƒ>{‡¾ÆGcO¾€u)8Ú>wʉÊë<{¾N“$291¾qèö5=>u¸‹_j>¾~ÎM-S×>pG¢òýpÉ>V)/8«- ¾xÎ÷2€>€ms§I±}¾z[:¶®>^ZøÍïe>lŽ,'°…¾}¨¹OŸ:>¥°÷ÿ¾sa±Ú ÂH¾9B>‚þÓ7>uÆdm´E¾€ê%´xX>{ù ïˆÊ¾f~ ÷·?³¾e^­Yˆ >{w™Lßr¾€ÓÖxÁ>v'üû ̾B±À¤ý…¾rzÚiç>~ìßüDˆž¾}kh‘“×->mZ›ÔõF>Zˆ²® ñ3¾xçzŸ_> >ëÁ«¾A ¾xþb:Ñ/>X »Dó>mîF4t#¾}LÑÖe«ê>~ið¨ÙÈξqÖ·p›uE¾EÚŠ;« b>vipƾZf \mo>zòW;¾c¤ñze¾f”ÃãÝŸ>{D+A™GR¾~ïÂ%)Ü’>t®9N홾2[™:=î=¾rÚS Fp>~R˜Uä¾|ÇÎ~e¹>j´bÑ>]ÿÈËåѦ¾xÚî4¦wc>~üïåUý ¾w*ëkþ:>SÉRý/$>nè.°Á}¾|Ú8¼ÉCV>}=ýÒÖ˾p{×Á䥾MG¿¤µ;>v±8(ûd¾~<ÐÝp>yBé¸?¾a8-ºo`÷¾g¼°½!/>zõË*=›i¾}ä ÏcrÙ>saÿrܾÇ”²‚!þsR“Ÿ>}¬ñ—^ξzí€0M±6>h)¨Q xl>`Q”FnÅÁ¾x®•†±g>~œÿGu ¾uí@Á²i>O˜ómmã>o„&´úmõ¾|U³ì˜a>|%né7rô¾nžÄšm̾Q‚.áÐö¸>v Tˆ–¾}Ä”¸½Ò >xy&¥‚ª¾^iKÀB6I¾h†SÚIK>z‘®]ñÆ5¾|æéÞRéÞ>r>$G4È>"Ë6O#=„¾scÆó!î>|ÿ+\ýœ¾yÕ¾ó²Ð`>f&FÉzp>a?»öTû¼¾xf½«Háé>}-Ãà?P¸¾tÖhB~ÊO>I@dç˜y>oÌÙN)Îؾ{ÄÕÈ7º>{"åÖÈ}M¾l¢(ÿ1¾SœDòòðN>uߟ´¥Oü¾|ú±'Ÿ— >w ’ʹ¯G¾['Ü®b2¾hø…éU2>züs%^¾{øOÒOáƒ>qE^A•F">2ƒ†Q£èâ¾sn+.ÓE>|MiŒÏ²¾xÚ«Ÿ1ø]>d‚Â{²¡À>aÓ†¤ú4¾xÕêP0î>|Tl·Ì†¾sårŠ¦é>DhX–y7J>oËØ)Ub@¾{*Š?Ñb>z6x™ç ¾jýÂ1¶F¾TþDžkm³>u—qŒG7á¾|4v)À…>v$ôa ™K¾X£òæµÛ,¾iñil>y•ÆØ`0¾{n”÷™×>pvÿûBõ>8¾MEqå¾rÑhE_–>{šÙ÷9R\¾wûðþŠÅ>c8wyRñ]>bJ£e{¨¾w— Ë$F>{†ENº¸¾sù°·w>@þ9á|SC>o†ÂAqT¾zˆïSH¯ã>ya? êS¾i¯ª1æix¾U³5ǽ8«>u7¢šÿ)/¾{tÄkÛ4>u]œzµÍE¾VÓB xü-¾hó®Ï5:i>y:žû:¾zPhƒŒ€I>o›t¶ª|ÿ>zè0Ÿä+›¾w8µÅ7[e>bCë YnÜ>b 4»L7¾w3ž~7­>zÄáL3M¾rpÏÞ:^$>=ßÀ@ï}ç>oÄCbÄ¢¾y㲜èÍ>x£§pûy ¾h²¡‰©ƒÃ¾UˬŸ5«>tÃWíñÎ?¾z¼tµb·3ï¾U¨Œ†Ä¾hŠlH»œ>xj+K_K¾y–¾OÁ”z>n•ß*\ËN>=S.vœí¾rï*[×>z7p&¨ð¾v‘3@Ñ“>a¡v¨äçZ>aµðZÔ–Ù¾v„™Ž.¢>zT¸}:¾qêÈÓ{J›><>Œ9rBé>nGö)ÀUZ¾y9^AU!>wûä 2¿¾hD‚ ¾UP%¢þž>t;gËu¡.¾z õÇ-#z>t+[‰Žkè¾U<´Ø¾gáõº£>wÆZ/¾A¾xîötPw>mØrf2y>;û;w³È²¾q™‚¬·e¬>yˆqpðÆ=¾v‹…Ü)>aJÃé«>a!nÏ•¡7¾uæƒq…;e>yf#…è5ƾq„jÉ¢T><øÍíÚ5™>mW`N…Ì@¾x‹ëUü%ß>wiN‹ùp¾g˜¯=+ÛŠ¾THçÏÍå>s¡®…‰$!¾y_X&Z!Ï>s¾:S2a¾U'CºîI¾gd×ËÙ>wÝiç­¾xWhæùQ>m\wëÿó>8vm¢ƒ½Ð¾qsB-À>xÚñÒ²éC¾ur¨k>a9ç£>l#>`Mz&ñˆO¾u;Þ@î>xÈ¿GÚþ¾q< c×…>?ñ cF$–>l4ÿöUϨ¾wÛžŠÔÙK>vê¼lÁý8¾gsKÄ*“ß¾R¿ÙUgV>r÷q¬%¾xº°ñ+>sj¿V›ÉξU¹cvfß¾eçÀA#J>vfî+'¾wÍïÌ?É>mÍ” '>2Ö1w–iؾpZUV¿j>x.LevŽ¾u-ÕÌ€™>amT'¿Á>^}pȪ"¾tƒgÁ¢²W>x4%ÞD”ã¾q5/Ì>Bxø ¾}1>jãðÝ3¢¾w'4ˆè¼>v|þºÞ,¾gŠÊ:@"Ó¾P¼Á`Oî>r;â&…®¾¾x4}t^>s.ñpÁüŸ¾VÎ"›Ü¾d™c‡ý4ã>u©ŒkQ¾wQ„.¿È|>m#ƒh(Õ>&†¥Ñ% ¾o7õ@Ûå >wªÏ4¾tá  ²Á>aÜZž;Ú>[ðïþ¤¾s¾—è½á5>w§:〦x¾püKØ“>EðjI­œï>icXäM¾vlíN^«>veO>¾gÛä”öb¾L†upÄvÐ>qoQj·å¾w|kªz¶u>s‚„çÊ“¾XYù>m^Û¾cÞN—>tãljñ¾vßÕø>mEÀ8Cu%=þ4¼:j'¾m“홼Þ>vÒ+2Hö¾t¥lˆ¤ú >bƒk:{£>Xöïz§ø¾rëEyw³ý>w`5N4Ž¾pþBðCÿe>JQ¬¶Daž>g´ë¨—5å¾u¬#âÆÖû>uˉCGS:¾h_ÊC/K;¾FºnêP>p‘§øš‘¾vÞô«;&³>róBXË+ÿ¾ZQ$Zk‰¾ag-ïŒuB>tÒ¸Öaw¾vs/B[þ›>mžÊyŠà¾"xÔõ^­F¾kÄ «‹^™>v 4òò¾tw>dáØ>c^&/*«p>U•K%É> ¾r =ç,8>vš*ΞÅV¾qÝ ½*o>O‚ý ¹Y«>eÙËÄô~¾tâ9ùtóË>u ô<Ͼi^3>¿¾@þ €‹>oB12Œì¾v>Q¥>rì=ŸÑ³¾\­Uꈾ_@?>s1Y.ÆŒ¾v zÂ8* >n‚ŠI+à¾5öäÅàB¾iËÖ~¸Ãø>uc ¾2“¾tR3ÕÓ@>dd2d׉¦>QѲRü·t¾q|FŽ:ä>vK‹ß´m¾q5Ì}è ³>R» @i­>cÏà7ö5¾t E£ÜW>u;dÖ/ñ¾iåøøþc¾1jÛ½†?>m9}“–ó ¾u˜K¬ñã>rðÔUÒn¾_aptñ\¾Zâ‚è>rC=ß¡¾u£¾òBü0>n»žöZ´d¾B*‹>ñ_¾g¨(Ò„6±>toß¼FV¾t2Ž(å$>eH|.>>KXB)s"¾pÌ0ÿµ>u‡šØTŸ¾qdQêÈ´>V rˆäÜ·>a—éƒÄ¾¿¾s(—w[Ô3>töýLƒ^p¾jÛF§¥h.½ópïTI>kGo"‡~¾tèé6¿¨>>rùòÇý¾a/ÁBÉÄæ¾V`B){c>qB«[m¼¾u7iƒ£>oo/·‚Ÿ¾I×?Ç )¾eV¯Û•W">sÊ>jÁ`x¾tªjw·ì>fÜAlXC?>BV6® Ÿš¾m*ã>tóš- ‹d¾q˜Ü^*ÔÓ>Y©˜!ƒú>^e€‚—z¾r3ÈPÁƒ7>t®k›Bh'¾kæNA Ù–>0`#¼Ïðã>h©æ‡¡r¾t+èS ¸>s¶0¨¾bÎâ›Úêé¾Q€®$ ” >p.DuŒ¬u¾tà ;‚Î#>phæggR¾Q¯Y‡×š¾bØ-;B ^>r撲̾ǾsóIl¶¬é>h>S$XrÚ>1Wøý`éë¾kÆP%€>tR­J/¾qÎ函>]„ÉÓ€y/>Y=—óÎñ¾q*e ¤p>t]a;³¶‚¾m«PQ>A–i y`>f ÍfÖ#¾s^Ngon>s ÜþÏP¾d…Š»­Bb¾H—¥‚¿ <>náDcE¾tA~VÕ>pz©e1:¾Uˆ<ëb s¾`*æà©°>qí÷yé¾sÈÚå…œ>i®“Ýyò—¾ þPG“û}¾hÿåÃ÷g>sŸäÚdоrñÞ®mñ>`É.ž9Ø >S»ÒzÚÇ ¾p w;ð[>sÿIäå¾n¹^{>K~òHVÁ>c`פ²ˆ÷¾r{™Ýýc>s ¶í)Œ¾fJ‡\e÷¾;_±dV>k€íA ¹¾s­eÀ Ÿ>pÙh8Ú~õ¾Z*Xò`¾J¾Z›Ð´$Çc>pÝg˜žÀ¾sßìšËz>k$ Ì.ýˆ¾8îõK`F¾f>¸µ¤^u>rÖ™Iiè[¾r+ã›"'>bÞÉ+ëÆ>KËœÅó.¾m¡b\‡I>sâ8ž\·¾o3h1¥èñ>Rè´8–ì8>`reæƒ@e¾qK¢Î̯>rü¿f¾hf¦½³¾Epxøi'>hĽý+š¾s³=íAÃ>q/?‰Mmƒ¾^îÀ:8EÁ¾Tˆ–a9>odv`ƒ¾sE1\|‡|>l‘ºÔ/èq¾G¿j-Ÿ…$¾cI®“_q>qóÇ3né¾rF9® âO>dú_wž>>øX×Ä+¾jôMHÞ—î>s2ö~‰¾psÐíãv>X:Z„e;S>Z¥’) Y¾pf~Ò‰0>rØ÷yN©¾iØsÄ)Ã>4y•:s'>eÑ@?³¨¨¾r;ìTî)>qtñãÏȾaà €§ø¡¾L:õÄ=­ê>lÏÙEãfv¾rßqï>mì7:ûdh¾Q°£ÃX’¾`P]s|d>pðÀ>_s,¾rKs ¯B>g‚/j >EÇÙ»¾h ƒ£­´F>r]0Óõ+_¾p2Cî>];Ì_™>T 9oR¾nZeº#v¾‘›QŠ6ˆU>ï½f“©¾ðû(úÞ¾pÄns¼m>ŒÔ)ïîèþ¾’ ã÷Ê”½>Šáô“öM¾e÷Îx&ÙÁ¾‚PªÊ¼K2>ÙQÖ8Äá¾ØJ­½->‚Z÷Éå >e½ßçŽn¾Ši‹ybz>‘º’p^¾ŒTr)7˜Û>p°®… Â_>~¸Gâ ô|¾üCnµ½>ÿÊUÏ€¾„‰G uÆE¾Q»²T]>‡ßÂ#ÀW ¾‘KtW]vÍ>‡Ñ„ d~¾vàRBu¾x¿z“l">ŽôîX£¾‘µC“ö>†‚üLjæ¾8Ì[Åõ¾…;“¨ž¬>Àä !¾Ž|9õ_Iž>{;wÅÿOÌ>rÃÆ/üľŒþ½¬Ü>í‰Å*K¾ˆCöT‰X¼>]hÅß»>‚ÿhM¦8¾¢Ÿpo>/ß­Ûv¾€ço˜Ëï¾iš`làMk>‰ÏÃÃྴðÇŸ’²>‰Ë>àâÓ¾iäé:|6´¾p*?có>Ž®±mr÷¾£­–gD>‚4ýGòè>[¡Ö!^œ%¾‡vè&ò@ì>]ÎÆHž`¾‹ÙkÈ![>rJ87½ïG>yÆ™*l¾Œú®§ywd>Ö±dS㾄6¿X殾1×¢íÊp->„ÿþ ­®"¾Òa(!€v>Œ#‹`g¼¾w[d‹•¾t+}˜D–>‹3{ %¾Ê¢KR>†Xææöq¾Rš’!k¾‚qP(X>Ž°¼¶×Ÿ÷¾Œò)^ˆ³*>|É;‡u¨>l²^ôJ‡¾‰,M”ƒ$>jÎKP÷¾‡˜>„ « >cýNÝ#°*>›ï ŸGó¾Y‹701>‚G/1ξ€Aé íf¾aV‹¼®>†â9™9·¾Ž÷ºÛ¸Á>ˆóVbK¾ny MÝV¾z:&J0î>‹Ð[7]¾Ò–Ê?E>‚F…ÉFK>HŠ•RG¨¢¾„“o?I2Ç>Ž3Øû«óö¾ŠÕ¯3¨À>t:,_¹½>tŨtç ¾Šîó;ˆ>ä~f9¾„"¸Yo>CS° WÖ>‚*$n_.¾7DK[>Šõsõ,¾xì¹$N.¾n“5š‚Ïh>ˆ5 %ˆx¾·™bʉ>…µÚ™ _¾^÷m–¡¾T8ûJío>Œr‹¿“ܾ‹š@J^LŒ>}NJ’äÃ/>c /'ýg¾†+›¤‡ïh>N-μs¾‡Ké:w>i¾$²šd>z3H>ƒæ¾Šž{1*>ŒÍ¼²Z¾€ªŽ(ùŒ+¾Q—ò:WE>„.&mr{¾Œ¨·ï Ý¢>ˆF^¸Aa¾qćPlF¥¾tùÕʬ->‰Â[”Û¾Œ)W‹ÏÙ>‚~?j®‡ì¾-˜°‹×÷¾·€ü1S®>‹Ê_òGu8¾‰6€ŒàGŒ>ve0çhÜ)>oiÏå»p¹¾‡F MÑ™J>Œ’RIJ:¾„ +Ó¢'>Xmœ¹„Æ”>~­(ñÇ‚µ¾Š´„n]h;>‰ézj’(C¾z¸lÆÎM¾dÚ`u.j•>…[ª ”Òÿ¾‹Á)‰v­ë>…ˆOq÷‰¾f;Ÿ=ëìȾyÅ)ˆºuó>‰k"¯n½"¾Š_Ÿš-ŠG>~¶J2©Âú>T¿OÛ¢ül¾ƒN0ê.96>‹3FŸ†>n¾†¹­è…¾6>oÐ ­×tô>tÁºy^'¾‡ðrV>Š—ª¤Òd/¾+°ž˜:½Ö'Íu¼ì7>!iW±µ¾ŠkÀü«;®>‡±^)¾tr–ý^lõ¾o[|ß6mš>†I7¼î½¾Š’Üšùs>‚ʇt¬ Y¾T,T—€`¾}¶¥Ð•Ó0>‰lîÜVê⾈lã!s¢¿>x²„•¶}4>e(ž˜&nt¾„xpðú;–>ŠP¨¾„4¹ØMâ·>cÍyŒº„|>y@1©%ɾˆ9‡åÙ >ˆìaœÞæ\¾|¡hqª¾V+Ä*#$>‚ƒ•N ﾉÔUi«>…gÇ3µæT¾m'í¤Ø¾t,fR«ù>†ÔÚËXµ¾‰.[ . ä>€¼*È~>gòöóѾ€nM»¯ì>‰”ßZû¾†a˜½Zt>s¿SÝ?¸>nˆRóî ¾…BmÉTˆN>‰3íÞÀTê¾´ÓÚÂ$<>Q¥ái[7Ó>|}JÔ-öx¾ˆ/$Ò†õh>‡ ›MÓ:‰¾w-¨• eY¾d©ŒZZé<>ƒ†SØP%3¾ˆü¢ƒ+€<>ƒà9ëFB¾bS¹$~vžwñ£aû»¿>‡ ⟳ý/¾‡£±„I >{ú¸l•>Už†ÚÒt¾¤é<¾>ˆŠŸ%ëÀk¾„K'ÒnÌ>kr&eÌ¿>sF–ô-„¨¾…·yÓÙêÕ>‡êI&Å"E¾~‰‹¿Úð¸¾!B#Áª>Eãwù¾‡Þv»)ù{>…Bxµq¾r Þå»ì¾m §Q2 >„4ˆ,¾Ê®¾‡ôN6‚«Z>€ÖƒGTï~¾PêN!ïKø¾{ Ûì(T>†ûUßÓȾ† ¦®úš>v±@[å>cv©ßÛÑU¾‚ˆ Ç >‡ÂCÂè+¾‚4êóBgG>a²„å¿y>v£i{‘/œ¾…âÞ[°}_>†²|—Ú¾yÜb*Zxm¾SȺOÕj>€µyNxZ¾‡U(³ýEV>ƒ^'šÕ̾j’"`“c¾r°nF>„™1*¸5ÿ¾†Ç¯‘£>}F˜Õ”«ë> ¿°J?•¾}…Ï"¸ >†®˜Î@Œî¾„NâêÀ…>q}­ƒ0 >j÷‹Æáln¾ƒ í×dÄ…>†ÐñÕ)Fa¾€)R^#Ê>Q¬{Þ2Ûp>yfÞ¢"‘:¾…ШßÁÖ¦>…>v×L`¾uoš·y¾a¥Z ¬ñ> ô­¾†žÔ°h‘c>|ߨ{#¾aм4¸ne¾uíø\(g>„¾ Š‹òß¾…ó§bi>yñ™ÂÞ>P¬§HAý¾n’@aS}>†1loèù¾‚›‡Ï€>jn3~Ú€–>p°³iwÔ•¾ƒyßÆQ 1>…ÂAt}ÀÔ¾|_›*2ÞŽ>¼@…BÓÈ>{ž€–¼wß¾…‹;3?­è>ƒW?gd„¾qJ°j¯©¾h_g S) >‚ÚÝ/Ù-¾…Ƴ…A6>N_„²+~¾S¿OBþÓ¾w–‡ƒÆ z>„­}êÖÞ¾„-íêVDï>uèÀSü>^ýu5¾€lÅÇþ>…Ž¨hŪ㾀슶¸Ã>b—j™¨¹>sc¡_`XÖ¾ƒ›Ó!„Ȇ>„Ÿzr1æ¾xœIïÎT¾HÜÀ-`[>}Vmêξ…=¾A>ûüÕnrà¾jîÝS=ï¾nÓÞ`¹ô>‚X™Ý;`¾„Õ<š EI>{Çî÷&Sá¾5óâ|fª¾y”™hè>„q_Áy•å¾‚Óõ)®Þ±>qhf'ìé>eO~à\ß¾€èyùqÆ>„Ϙå*†¾~”®ú€>Vúq=Z­ô>u#'Á¤¾ƒZL3>ƒq®¿~¾f±‘¥¾„ŽUÆá>€}­áÿT¾cð×CG…)¾q{uðÌ í>‚yóvÚ‹v¾ƒÔ¾‡¤6»>xo9ÝäFÙ><µ +>¾{"ÎóT.®>„ÁrÿÍÕ¾{9£þ>kþµø,¡‘>jvúµž«¾3¤ü°pˆ>ƒû—…¾çݾ{s.­! ˜>D„_ž²dp>whº±‹|„¾ƒ]qÜ'Ê>‚@¦Î”˜¾qÊ=]±U¾aÒäÃ…U">‚ )¾ƒç»6>~noý‰¾[:Á³=¾s|NÞ®ë$>‚s "9’¾‚Ë°˜È>uLpìáí>RGºÑ\JÕ¾|LüÎ;­>ƒ–÷ÃOú¾€)ý—S“6>eȱûià=>nσŽV“¾Uæ0 >ƒäEPp¡¾x~UZ'ª¾fø1eÉû>xÒ@”Àù¾ƒ h$Ÿ6>ù,u%ð¾mˆïW´µ­¾fpÌ xF>€žž`澃/ÏÜÿ@Õ>{U(nÿ{P¾OÖ¾¡C¾u÷åøîÐ>‚K‚¤Mï¾ÁðÝPV>rex›¥>[ç8FJT#¾} ¹ÎùÎ>ƒ{[ üç¾}Ê©Ät->`-XV{æÔ>q4ÓT¦ï¾T¾úÈ=#>‚5À_ºtU¾u»Çpˆê¾EÒâ ¶œp>yã¹wp¾‚¥Ô»øòÞ>ÖPì04v¾h ŒuCaR¾jT"—m@‚>€+†¡Ê‹¾‚nÍÁ$>x½)‚ H»¯s¾€º ¢†í>ox€;±->bDSg ¾}© Às>‚kó?€W¾{aEŒÛ!ã>VY™¯¥ä+>rªœ…ºšŽ¾7-|aÂ>Nõë 5L¾s.ÌG=>ƾSuBë ¦J>z¦ïïœÏT¾‚-Š€uÝK>}¡[FÉ&¾cÛŒ¿¥~¾mŽ=`Hæ>€0Hùz‚¾©8/ô%m>vRïÌ?Ÿ›>&´Z%Іx¾w\/´²ue¾uÚ¾x.>j¦6Y ká>e‰šÇ쥟¾}ðŸOöûS>Ç.”Ÿ¾yõeE|¤>K¡z3#J>sÒ0ÚNªŒ¾8¼à³>€l^g´®*¾pÛ¡LªÆ¾ZÂøºùZK>{(¤P0*ʾ©˜Ï–+>{ŠHYúbº¾]npñk8H¾prÔ¿†W>€´“…·²¾€ã`œ|(2>t¢ƒ‡ e>Dí­B))¾x€ t’>PXB™ç"¾}]Œ6÷ƒ>fUêÃј>hgÏÖ1¾~ÂpŒ5Ö>+Is“¾wPóV¯>7gOÙ9b>t´šO‰áû¾€½­žƒ0—>"üß˾m„G0’kr¾`rÇâbÏ>{po¡<¿5¾`íÌ>y– ·f×¢¾U¹^ü³®¾¾qáK0Î>æõÎè-¾€!™â&^>rù誥à>Pˤˆ5D¯¾x‰—=­>€â'>–žB¾{Áäo£3Y>bƒ R:/Ô>j»7»çc¾}è9"?>€w4Ìà ¾u–3ì¼¾ü7ùk]>uXKy–V¾€j¼FD_ù>}€u¨ù®¾iÇuýýÚ'¾bø€p7}ƒ>{‡¾ÆGcO¾€u)8Ú>wʉÊë<{¾N“$291¾qèö5=>u¸‹_j>¾~ÎM-S×>pG¢òýpÉ>V)/8«- ¾xÎ÷2€>€ms§I±}¾z[:¶®>^ZøÍïe>lŽ,'°…¾}¨¹OŸ:>¥°÷ÿ¾sa±Ú ÂH¾9B>‚þÓ7>uÆdm´E¾€ê%´xX>{ù ïˆÊ¾f~ ÷·?³¾e^­Yˆ >{w™Lßr¾€ÓÖxÁ>v'üû ̾B±À¤ý…¾rzÚiç>~ìßüDˆž¾}kh‘“×->mZ›ÔõF>Zˆ²® ñ3¾xçzŸ_> >ëÁ«¾A ¾xþb:Ñ/>X »Dó>mîF4t#¾}LÑÖe«ê>~ið¨ÙÈξqÖ·p›uE¾EÚŠ;« b>vipƾZf \mo>zòW;¾c¤ñze¾f”ÃãÝŸ>{D+A™GR¾~ïÂ%)Ü’>t®9N홾2[™:=î=¾rÚS Fp>~R˜Uä¾|ÇÎ~e¹>j´bÑ>]ÿÈËåѦ¾xÚî4¦wc>~üïåUý ¾w*ëkþ:>SÉRý/$>nè.°Á}¾|Ú8¼ÉCV>}=ýÒÖ˾p{×Á䥾MG¿¤µ;>v±8(ûd¾~<ÐÝp>yBé¸?¾a8-ºo`÷¾g¼°½!/>zõË*=›i¾}ä ÏcrÙ>saÿrܾÇ”²‚!þsR“Ÿ>}¬ñ—^ξzí€0M±6>h)¨Q xl>`Q”FnÅÁ¾x®•†±g>~œÿGu ¾uí@Á²i>O˜ómmã>o„&´úmõ¾|U³ì˜a>|%né7rô¾nžÄšm̾Q‚.áÐö¸>v Tˆ–¾}Ä”¸½Ò >xy&¥‚ª¾^iKÀB6I¾h†SÚIK>z‘®]ñÆ5¾|æéÞRéÞ>r>$G4È>"Ë6O#=„¾scÆó!î>|ÿ+\ýœ¾yÕ¾ó²Ð`>f&FÉzp>a?»öTû¼¾xf½«Háé>}-Ãà?P¸¾tÖhB~ÊO>I@dç˜y>oÌÙN)Îؾ{ÄÕÈ7º>{"åÖÈ}M¾l¢(ÿ1¾SœDòòðN>uߟ´¥Oü¾|ú±'Ÿ— >w ’ʹ¯G¾['Ü®b2¾hø…éU2>züs%^¾{øOÒOáƒ>qE^A•F">2ƒ†Q£èâ¾sn+.ÓE>|MiŒÏ²¾xÚ«Ÿ1ø]>d‚Â{²¡À>aÓ†¤ú4¾xÕêP0î>|Tl·Ì†¾sårŠ¦é>DhX–y7J>oËØ)Ub@¾{*Š?Ñb>z6x™ç ¾jýÂ1¶F¾TþDžkm³>u—qŒG7á¾|4v)À…>v$ôa ™K¾X£òæµÛ,¾iñil>y•ÆØ`0¾{n”÷™×>pvÿûBõ>8¾MEqå¾rÑhE_–>{šÙ÷9R\¾wûðþŠÅ>c8wyRñ]>bJ£e{¨¾w— Ë$F>{†ENº¸¾sù°·w>@þ9á|SC>o†ÂAqT¾zˆïSH¯ã>ya? êS¾i¯ª1æix¾U³5ǽ8«>u7¢šÿ)/¾{tÄkÛ4>u]œzµÍE¾VÓB xü-¾hó®Ï5:i>y:žû:¾zPhƒŒ€I>o›t¶ª|ÿ>zè0Ÿä+›¾w8µÅ7[e>bCë YnÜ>b 4»L7¾w3ž~7­>zÄáL3M¾rpÏÞ:^$>=ßÀ@ï}ç>oÄCbÄ¢¾y㲜èÍ>x£§pûy ¾h²¡‰©ƒÃ¾UˬŸ5«>tÃWíñÎ?¾z¼tµb·3ï¾U¨Œ†Ä¾hŠlH»œ>xj+K_K¾y–¾OÁ”z>n•ß*\ËN>=S.vœí¾rï*[×>z7p&¨ð¾v‘3@Ñ“>a¡v¨äçZ>aµðZÔ–Ù¾v„™Ž.¢>zT¸}:¾qêÈÓ{J›><>Œ9rBé>nGö)ÀUZ¾y9^AU!>wûä 2¿¾hD‚ ¾UP%¢þž>t;gËu¡.¾z õÇ-#z>t+[‰Žkè¾U<´Ø¾gáõº£>wÆZ/¾A¾xîötPw>mØrf2y>;û;w³È²¾q™‚¬·e¬>yˆqpðÆ=¾v‹…Ü)>aJÃé«>a!nÏ•¡7¾uæƒq…;e>yf#…è5ƾq„jÉ¢T><øÍíÚ5™>mW`N…Ì@¾x‹ëUü%ß>wiN‹ùp¾g˜¯=+ÛŠ¾THçÏÍå>s¡®…‰$!¾y_X&Z!Ï>s¾:S2a¾U'CºîI¾gd×ËÙ>wÝiç­¾xWhæùQ>m\wëÿó>8vm¢ƒ½Ð¾qsB-À>xÚñÒ²éC¾ur¨k>a9ç£>l#>`Mz&ñˆO¾u;Þ@î>xÈ¿GÚþ¾q< c×…>?ñ cF$–>l4ÿöUϨ¾wÛžŠÔÙK>vê¼lÁý8¾gsKÄ*“ß¾R¿ÙUgV>r÷q¬%¾xº°ñ+>sj¿V›ÉξU¹cvfß¾eçÀA#J>vfî+'¾wÍïÌ?É>mÍ” '>2Ö1w–iؾpZUV¿j>x.LevŽ¾u-ÕÌ€™>amT'¿Á>^}pȪ"¾tƒgÁ¢²W>x4%ÞD”ã¾q5/Ì>Bxø ¾}1>jãðÝ3¢¾w'4ˆè¼>v|þºÞ,¾gŠÊ:@"Ó¾P¼Á`Oî>r;â&…®¾¾x4}t^>s.ñpÁüŸ¾VÎ"›Ü¾d™c‡ý4ã>u©ŒkQ¾wQ„.¿È|>m#ƒh(Õ>&†¥Ñ% ¾o7õ@Ûå >wªÏ4¾tá  ²Á>aÜZž;Ú>[ðïþ¤¾s¾—è½á5>w§:〦x¾püKØ“>EðjI­œï>icXäM¾vlíN^«>veO>¾gÛä”öb¾L†upÄvÐ>qoQj·å¾w|kªz¶u>s‚„çÊ“¾XYù>m^Û¾cÞN—>tãljñ¾vßÕø>mEÀ8Cu%=þ4¼:j'¾m“홼Þ>vÒ+2Hö¾t¥lˆ¤ú >bƒk:{£>Xöïz§ø¾rëEyw³ý>w`5N4Ž¾pþBðCÿe>JQ¬¶Daž>g´ë¨—5å¾u¬#âÆÖû>uˉCGS:¾h_ÊC/K;¾FºnêP>p‘§øš‘¾vÞô«;&³>róBXË+ÿ¾ZQ$Zk‰¾ag-ïŒuB>tÒ¸Öaw¾vs/B[þ›>mžÊyŠà¾"xÔõ^­F¾kÄ «‹^™>v 4òò¾tw>dáØ>c^&/*«p>U•K%É> ¾r =ç,8>vš*ΞÅV¾qÝ ½*o>O‚ý ¹Y«>eÙËÄô~¾tâ9ùtóË>u ô<Ͼi^3>¿¾@þ €‹>oB12Œì¾v>Q¥>rì=ŸÑ³¾\­Uꈾ_@?>s1Y.ÆŒ¾v zÂ8* >n‚ŠI+à¾5öäÅàB¾iËÖ~¸Ãø>uc ¾2“¾tR3ÕÓ@>dd2d׉¦>QѲRü·t¾q|FŽ:ä>vK‹ß´m¾q5Ì}è ³>R» @i­>cÏà7ö5¾t E£ÜW>u;dÖ/ñ¾iåøøþc¾1jÛ½†?>m9}“–ó ¾u˜K¬ñã>rðÔUÒn¾_aptñ\¾Zâ‚è>rC=ß¡¾u£¾òBü0>n»žöZ´d¾B*‹>ñ_¾g¨(Ò„6±>toß¼FV¾t2Ž(å$>eH|.>>KXB)s"¾pÌ0ÿµ>u‡šØTŸ¾qdQêÈ´>V rˆäÜ·>a—éƒÄ¾¿¾s(—w[Ô3>töýLƒ^p¾jÛF§¥h.½ópïTI>kGo"‡~¾tèé6¿¨>>rùòÇý¾a/ÁBÉÄæ¾V`B){c>qB«[m¼¾u7iƒ£>oo/·‚Ÿ¾I×?Ç )¾eV¯Û•W">sÊ>jÁ`x¾tªjw·ì>fÜAlXC?>BV6® Ÿš¾m*ã>tóš- ‹d¾q˜Ü^*ÔÓ>Y©˜!ƒú>^e€‚—z¾r3ÈPÁƒ7>t®k›Bh'¾kæNA Ù–>0`#¼Ïðã>h©æ‡¡r¾t+èS ¸>s¶0¨¾bÎâ›Úêé¾Q€®$ ” >p.DuŒ¬u¾tà ;‚Î#>phæggR¾Q¯Y‡×š¾bØ-;B ^>r撲̾ǾsóIl¶¬é>h>S$XrÚ>1Wøý`éë¾kÆP%€>tR­J/¾qÎ函>]„ÉÓ€y/>Y=—óÎñ¾q*e ¤p>t]a;³¶‚¾m«PQ>A–i y`>f ÍfÖ#¾s^Ngon>s ÜþÏP¾d…Š»­Bb¾H—¥‚¿ <>náDcE¾tA~VÕ>pz©e1:¾Uˆ<ëb s¾`*æà©°>qí÷yé¾sÈÚå…œ>i®“Ýyò—¾ þPG“û}¾hÿåÃ÷g>sŸäÚdоrñÞ®mñ>`É.ž9Ø >S»ÒzÚÇ ¾p w;ð[>sÿIäå¾n¹^{>K~òHVÁ>c`פ²ˆ÷¾r{™Ýýc>s ¶í)Œ¾fJ‡\e÷¾;_±dV>k€íA ¹¾s­eÀ Ÿ>pÙh8Ú~õ¾Z*Xò`¾J¾Z›Ð´$Çc>pÝg˜žÀ¾sßìšËz>k$ Ì.ýˆ¾8îõK`F¾f>¸µ¤^u>rÖ™Iiè[¾r+ã›"'>bÞÉ+ëÆ>KËœÅó.¾m¡b\‡I>sâ8ž\·¾o3h1¥èñ>Rè´8–ì8>`reæƒ@e¾qK¢Î̯>rü¿f¾hf¦½³¾Epxøi'>hĽý+š¾s³=íAÃ>q/?‰Mmƒ¾^îÀ:8EÁ¾Tˆ–a9>odv`ƒ¾sE1\|‡|>l‘ºÔ/èq¾G¿j-Ÿ…$¾cI®“_q>qóÇ3né¾rF9® âO>dú_wž>>øX×Ä+¾jôMHÞ—î>s2ö~‰¾psÐíãv>X:Z„e;S>Z¥’) Y¾pf~Ò‰0>rØ÷yN©¾iØsÄ)Ã>4y•:s'>eÑ@?³¨¨¾r;ìTî)>qtñãÏȾaà €§ø¡¾L:õÄ=­ê>lÏÙEãfv¾rßqï>mì7:ûdh¾Q°£ÃX’¾`P]s|d>pðÀ>_s,¾rKs ¯B>g‚/j >EÇÙ»¾h ƒ£­´F>r]0Óõ+_¾p2Cî>];Ì_™>T 9oR¾nZeº#v>r˜Ë‡2OÙ¾kˆ£¨ &L>FÀ¹žÚïo>b¢ïÿM¾qS¼ÒZ2¨>q¤1™!Vë¾dEít”Jü¾=Š=ˆ–’z>iú—K5~¾rZ–wñÈ>o&À´28ž¾Wš{¸q¾Y|$à;>o—àó»b%¾r4_K¬¦Î>izF?ÜG¾5U-Õ‚Kb¾dã‰xH^>>q’‘Úrk¾pççû>a~;‰@*>J%"ÿ§¾kŸõ¡oö>r8·Ö¿‹¾m¬ Þ7Ë>QÃXv™¥ø>^u†ª»ñ;pF„OêŽ>q¶Q2€>³¾fš°ŠGòû½ùØ?>Ï/æ>fà?Ù /¾q°I(ù>pZ¬Ú»(¾]ƒUÀúd¿¾RZ ‰î¡Ü>m“~lª¾qù©òÁ-Ô>jø§®¶N„¾HGZ~ÀG¾az½Én²¥>pŸÀN{âȾq"¬õ•tI>d‚,‹K >7>¥È©V¾h›}Úù>q°¨aQ¾nx$.çÃã>X,à°Ù0>W7˧|äF¾n ÎÂŽ2>q£ /æ¾hÎ~)o®N>;—c‘>c~é›Ïš¦¾pÚ‡4yÏE>p}ŠèIõb¾aªiV€Ê]¾E¾)¾ª‚ç>j,ÃÂðÀ¾q•O¥ûÌ>l«´ °‚˜¾Sm¨xør¾[©PÝÃÛ>oRj3l¾q7´îÕpö>f¡- èÿ^¾Ѹ“¶š¾eHq?yÌÃ>pùÉ劵 ¾o•gIÙ ¿>^‚õH៓>O%·V*¸Ð¾kXÑ+õ>qck›@×…¾jÒG@nñƒ>L$~ÿ>_¯íÚµ.¾oª`Btö—>p» td_>¾dv[¯niþ¾(ìiÔ)>fÙRÙ_v¾q:Ú0Ï´>nE¶’üh¾YÓt_mA ¾SèΆ·â>la•!Y½¾q¾¿Ôá>hò†6Ûo¾B m“ WW¾a§„?°Ò>p ƒÓz¾p0Fñ‡›…>bS'Áå²>>bžAI}¾h4׋¨h>pð§!®f6¾l’™¢ ‚{>UN¨tWÉö>Wà‘á[øk¾m7K+±ÑH>pÇnï¾>¾gI Gw>3ScDÜaaä¾p3ÙÉ´æÎ>o5yNdW¾`<eÕ¾G…³9 Ùd>i\2Ji*¾pÍÙ›´&>kö¦~óà¾PúHÞá¾[{'§Éˆž>mÝAûŠïì¾pc<Ø=]‘>e6’ãîZ?¾¼›º#^¾d±­³Âê >pC*z[’ð¾múµŽ£DW>\jÌ- >x>O7Â'¯¾jU&b4†ˆ>pšÀïºý¾iko,³Q®>I¶oŠcc>^»ëz²>¾nW¨…ÄbÝ>oç¬õt¶¾cc_Ç5€Ò¾*p^”DÏ>eð9F­iˆ¾p@Cmû>lµž¼Ói+¾X… rœ­Í¾S"^¦n“>k"ŽKþd&¾pZèS}>g× 1´RF¾Aêi`½Ⱦ`Òœüó«>n«5i7­¿¾n÷ˆbN9ž>aœ.å¯.P>;èy\aœ}¾gÇŒö>p-t”ˆÌ€¾kj–]í0>TÌ]ê×ä>VXGõ6ؾkǨ /ŠÊ>pQ˜˜îì¾fHà ½k>5/P¬U¢Á>bÕy¾nÜXè%x²>mû8¯#º¾_È2°D: ¾Dµ€¼/ >gí|—x¶o¾p ÿà 8>j³¹w„¾QDaj¾Y?7x@Ê!>lGævL/d¾osAv²j>dÂ5k ¾R±!y¾cA¼ð– @>nïQç¼ؾl÷B«©ž>\|3' 6¨>J鯦¾h²¡ä{¢>o‰á2·¬¾hÒ³!ø–—>KÞÃÞò;>[ÚŽºÌè3¾l¦Üx¾S>n¼&Z´¼¾cGÈÃ[g¾—  >d?ÝoKÌï¾nçDZä!J>kï°¤!J¾YXüêV-(¾PGè·¡^¨>iU©';%½¾oXÑÇ™,>gL¼»….¾EžmÔ- Ä¾^-ßž©Q&>lèrú–Rè¾mû× Å>aÛž' ±Õ>0Ó#<#оe½œ™òà>nÉ_]E”¾jç©'L· >Vb%më=>RÖD.¡N„¾iÙ<™ =‘>nàÌ_sSQ¾fPššjW>?›`xú±>`q½ý°»¾mN½ÑÅÀ>m42•g¾`šüõ뀾;†2x¨Sò>eÕ/é¥íŒ¾n—–þ¯>iâ&u6¢@¾S™„MŸtžU!­·U>j@,*lI¾n]—0¥ú>e;½è¾4ÜhÓN¾aH®Y&>m!ÔÎð ¾lj€v)±Œ>^kÆZ9ï>B¡Ë7º0’¾fqçðÀ¿/>nV<)Ú(s¾háÌ/3·>Q†“†=/>W-z’Œsƒ¾jFöÈš9>mÒE—ª¾cúåRÕÐý>&dŠ~Z7>aÍ=Û.ñ7¾m¸nŸä>k¡gÌ´S¾\oŽ{!¾Gýtº Ú>fóiœ,µ7¾n†=‘Â*>géc´¸†¾M0³ç 4¾Xü·«© ì>jõKg>¾mA¬ã?fé>bå>¯Ðe¾0N"£’À¾bx1©qr>m ÅžéO¾jÚú^ 8>Y¾}G'Åõ>JõkºŸI ¾g[¿ÄœÎT>m±xâ77¾fû)ÃÌX>Hĺoï ¡>Z’ž×¿£ø¾jæD@CŠŸ>l®ÉÃdAh¾aß Šö¾erKÇ f>c{‹1¦¾lë‘»éœ>jD¦Ê¢4¾W§ÕÔJÀP¾Np›bŸ¤>g­+J@"¾mSBÓ>fò'˜S¾D¾ŒuÝf¾[ñeùsùš>j÷Š]C4¾l"¿Úsx>`ë’NãËh>*ëÒ*3¾c€,ÿ˜¡¥>l¾ó¼¿R¾i^2VYR>U¼êªÓ">>P¿uñ©¾géVçE¼ >lð$j¾eCÓÕ‰ø×>ALý¤,:>]ÁU§ª¶¾jùj%ûòM>k‹×è7öT¾` 0¢Ü<¾3Ôôlà>cá9û)–‹¾l‰Y§úš>h«”¿´](¾SþBð0¶‚¾R’3âu½>h‚Wö(¾l‰ã~Ü€×>d|Ö¬¤M¾;Ãa©°Ý¾^z¸Æ—>jíÛr:é¾jÿS5³Oü>^xsªœ´¼>9w,DØþd,ÿ“0Á®>lLà¦sѾh4~€F>RlìÓÞà³>S28#É}q¾h,[£ÙÎ>l"äÑž¾cÄÕÜ2û¤>6 t}†>^ß,s˼¾jÖ¤ ,Ó>jwïÚ”ØÁ¾]œPsõ¾>MÒŠ'pû>ddüVQŠ ¾l íÚ8f7>gf4æY2¾Q BÇ8K¾T"€3ã¼->h6æ>e.ï¾k¼Ì‚çÁ>cëg¯w¾1åÆ— ¾_~ÙsL¹ó>jµÎGõÞ¾iöÙãÝ]>[¶*±Ök>A0ñÝäÌR¾dŠ“"œk»>kÄè‚j …¾fÕ+#š‡À>O¦‚inà¹>Tä11.‚ؾh3Ÿe>kY %ÉG¾b…Ä”ð>)½¶9ƒ>_ö3›%™ä¾j[-#>i}{ÿlɘ¾Z1¬‹)¾BÝ‹ÒU>dŸUL¾k|A0Kì>fPŸÖ¤å¶¾M“w‡‚‡´¾Uy-¢6>h$¦?¾jø[‡³»>aÿØ˱¾"Än[8¾.¾`#p3‘tg>j]¢p’Ó¾i È\ìò>Y’}¬_2¤>D0 Œg¾d¥ûŒêì>k1Ñ»+€G¾eÙ¯D)>KׯìãH>Uäã€,/¾h $º>j›y‰½Ž¾aŠÿÝ¿{î>u³ùu õ>`9Q²p¾j(_­D,>h¥{Iͧ¾X½%tõª¾E*D}[}>dœ™ VJ1¾jç?Ðtg>enÿµÂ0ξJqD°ìÖa¾V&çòÌbe>g延1sû¾jBó–±i>a':+U¾$ªÌÊô¾`=‹£Ù¥>iíêÛ_Ep¾hG«h1¼>XðØŠaƒ>EÎ<ìµ­¾d†{»%F>j'Í›(D¾e꿼Á>I_þxØ?Î>VCÜ롧¾g¸kƬæ>iïŸ8+Ä`¾`Ô™¿h >ûŸ:V²>`1QÌZ¾i®ÝþÇT>gó^ ª¥=¾W‰žŠîÓ¾FYI.0®>dcY,«l¾jS›BçË«>dÄà¾ü(n¾H¢Â¯*-©¾V:„:]-Š>g‚ë»:øà¾i¡ëá³`>`‘ç:.` ¾Ø ˆ Ì›¾`n¸Mž>ilònªš¾g¨“ã¹9H>W)µ¥ñó>F]E%ût¾d3¯O >j Çó,÷á¾d„a,%js>H7å™D`ÿ>V àì¾gEJÒÇ ->iZˆf¤/¾``—߉<û>Ó[n6¤>_Õ Í¾i%Ìòæ±0>ggšãÝü¾Vís _¶i¾EÑQ¨y>cøFLè.¹¾i¤Á>dQ*#u6¾H4©µ¬¾U»fˆÑ,…>fÿ¶k© õ¾iy¨Îtç>`?ü-ãk¾Ôµ2”ƒ_¾_aO—½½®>hÜo)¨è5¾g03g=™>VÖA{[v¬>E9lRi¾c±ˆÁüé¤>i{‚×™>‹¾d*E}Zåç>HLo—rŠ>UG¦ÜB¾f²* %Ñ^>hÙäígCÿ¾`.“v@Ã>¾Í,­³ >^ÏõˆbqŽ¾hzTh™#>g%V]p{¾Vâ¾8c­¾DW#Ú I>c_µŒÁ‡Ï¾i58µ¯q©>d÷­f\ñ½K£x¾h ½¡Æ­œ>`,GZW+à¾.ËÊ÷¾^!*úäj³>h>Ž(ßDå¾f܆Ò:->WËO1P>C+•X>ϾchSm=t>hïwT&âþ¾d™ê–5ï>I‰`<>Süßeü¾eÿÿUÜ<ÿ>hkÅ}ÏÚ¾`8 Zl¶!>B”ˆ`½œ>]U°#²aw¾gé"/?$>f¾|;ÜúL¾WaaùHíO¾A·ÅüÐ>b™_Ò&¾h©Mæ|Ç>cþvk"ŠÕ¾J’B•ñoH¾S&4:bbè>e› /½Ú¾h:h, ;>`Qq=À¸¾%Dj€Wa¾\mØ¥¯ã.>g¨e.¾f§Š5¦>WÏ¥g1U>?ü¾*hžb$<_EHA>ha×\,Ù(¾dM,§Ý>KßÕŠ-ÿ>R.ˆ•Ÿ‡¾e-?Á¶æ´>h Órµd¾`w¯¯`m>+üì *e>[i‡4 Âh¾g/ŸÚf>f•Œ@)¾!¾XZµ¾W‡‚¾<œ|óô=>a¢ø²Ë"•¾hGC²ó>dîÕ}e!¾Mm™RÈd¾Q×]T0I>dµÞ?«ð¾gÞ¢Üéö>`©ÚYGߤ¾1â¡Þ˜­ð¾ZG¶†³äË>fÊ4Bdù¬¾f‰–1ÑÜ>Y\·Ð'>7„/ð ?¾aB•Ýz>gËJž<Â_¾d,7´>O7§üR©>O¹¹§¦ý¾d4 ô^uI>g±}M úѾ`æt#Ôš°>6JÒÅ:ð>Y–Iöµ¾f]nòQÓ>f€8/  ù¾YÁÖÜXL0¾2’€ª ï>`z¤‹úd¾gzu›ô¹¶>dIÃ$ÓÕf¾PÈ¡ªø¾Mó ü!è>c§QžÄ•0¾g‚óüÌä‹>a,­!”ú¾;/' ïmø¾W¨fŠR@>eè ö6¾fyeþÆ+Z>Zšƒ$î>)øhT^ž¾_¤_Š¿2>g$Y½T¹¾dl¬y >‚>Q¹t–ÃT>JÑh*@¾cå°ˆŸ>gQä¤/c+¾ay8Û¦@ù>@D]~õ‡c>V*:¡j9¾ehÕ8Ay>frÙƒa3 ¾[†²_—ó¾Û–Ö«9>^63Œdxº¾fÇ1b~>d“J¤)ʾRîê~†‘¾FåEÚ­‘%>biãÂtRš¾gÔ¢q%¸>aÌ­ç±òm¾C(0ˆ¬¾TŒÅ+)³t>dÞĺ^£‚¾fj»ˆ¦>\„¯-…Ø=ÞÇÌ+õj¾\©8¼Ê>faJþÇeݾd»‡"ëï>T;L*H@>CsNUßóµ¾a¶î–}®8>fâI²ɾb$áÞ…;–>F@®uLXu>Rϧ÷;dH¥y™.¯>f_…òÄT¾]¶>K>éh;£c >ZüÊÛ¤Ï+¾eðíi9#6>dãR³Gþ?¾U›8üyò´¾?‚ ;¸vQ>`ôÖ“FÚ ¾fŸƒðíÏ>b€ k±n¾IŠ*òZêÕ¾PñÑ‹ß{>c¥/ÅUߟ¾fORóqñ>^§ì¶†Ïk¾+´Tºû¸¾Y/ên9*‘>etµ€¾eˆ±Ë½£>W XÍX>7£Ïñ'vø¾`"~ú´È>fRøTg¾bÛÈê7æ>LÿöShc¦>Må}Ý7¾bò“N”yG>f8¼óuš¾_ÆÆ3é‰Ø>5¢…–Æô>WA®Ó®Ò’¾dêÿÙзr>e):()ˆš¾Xˆ¼æâ¾.£[ö7,>^~V{ öI¾eúScÊä¯>c5Àý›VϾPM–ÚŒ$J¾I¤‹Çá>b/E¢0é¾fMÚ4á¢>`t›{.Ç5¾=Ì~é~É?¾U0v€­Gÿ>dRéR„¾eC2:XÀ>ZL³>>&ÅëlÊ·¾\”3-Êžá>e“Äÿiæ¾c‹xäB~¹>R*MÛ[À‰>E"À;Ln¾aYÌ–­Ï>eê`0 [ð¾aó©n>C'6DCa>RûVúªö¾c§Ð1ô¯>eSý5 Þ¾[™ŽS±_>=5ôùø>Z…}vé¾eIu21ï>cÚ§ñ:õà¾T2Zt|¾@b Ê´Â>`q$ÈÕi¾e®ÏTì`§>a‘¾>³Êê¾GŒ»ºãP¾P¡ÍÜzã>bêHÒHøÿ¾eX¡˜±9>]%Â%§vv¾(z¿w$pr¾XNãlPþ>d”Á³vþ‰¾d ³ï>O>V tˆCò>6Ê“Þ¿¾^èpŽn¦>eb]?²ð¡¾b&Û.­>LøŠÄ>LI:aºq×¾bª_ÁEO>eN8®\¾¾^¬Ì®á÷õ>6-j$½¨š>Uðe­ûq¾c÷´“‚>dZɻ¢¾Wô £š1[¾(ºvR •>\Ä%Y­l¾e§5S„>b•ŠUð¨ö¾PRÍC¨…¾G t–¼ >a.·ê’C¾e1ÎKïý>`MœE ž¾@3¿iáE¾ShîæP´¾>cCál #S¾d…MñE>Yä1ÎØiò=øJ¼Ûå¥M¾Zsúp=>d3i.jÙ¾cà6ä"H>R£ØôU£Ì>A‡9e‚5d¾`.ˆ»-3>eÈt;-¾`ÉWÁ+g}>Em&s<–>P¹6$TòϾbw4K†y>d‡V웶¾[ËSXCD²>#fÌ$ûÞ>W󪩙ë¾cÿ+7©’ˆ>chÚË·çE¾TõqÚOª.¾7ŠNÇ°ç†>^)ZI¿Ý¾d¸XY—>arpóƒ)¾J¸Þ™3"¾KÄ~•ïó>a%Q÷;¨¾dŸ|6Å»i>]¢ˆl]ý”¾58Ëþcø`¾UEG㌌>cV /ˠǾc·«£:ù›>WAm–Û¥>'!¢:â2-¾[Â_?6Š8>dU¬9VÞ»¾b þíŠ>Psé#ü >EˆӾã5¾`;ÓöàÀ>dˆ]†]8Ž¾_b\¨ºÎC>@{¤7 û>RhÉ×ÀýQ¾bvÒºw·>cHƾY€1¤çH=éøÁ¿M`^>Y%Õ Õ"-¾cÕœUïE>b’m-šÙ¾R®^š2¿V¾?¥rB¾>^ÚuBò®¾dTódûÖ>`ÆŠÝH¾Fk™th!ž¾N¿ y¨ª>a©¿ÁYaȾd !Wb;>[©¨nù½¾+@ù`\J¾VS$T"W.>c5[‚ÖoN¾c/3@AÚ>ULüM¹Ç>2“_Y”­¾\]ÅkÇB„>d•ÕÝé¾a>óçFÈk>L`g4ïÊ>HWŒ„¿#n¾`£N¬´ñA>d QÌ3ãϾ]µ2ž[]€>:mþW‚™Q>SK’Í«f+¾br^Ël²J>cTcj¿@¾WÙiÍ<}¤¾‹*£ÐHá>Y£Í]«V¾cŒB…ÍÑb>aä]cŸ¾Q%Hq¼¾A e»ïØ>^õÏU'+¾cè5AíT[>_šFlp¤N¾C»v¦=æõ¾PŠ‡ìÞ>aŠÙV)¾c†¥¨ºÌ>ZJ?(£šæ¾"IH+6§¾Vªg=LÌ>bð€о¾bm S¡%>T N¶NN >5DbNL¾\^Î}ÌO>cŸ´“§”7¾`§¯²z\S>J?kkÂå8>IM¾h"ꎾ`}0ÎY!>c•½p ¾\•l½¨ ®>7$0Äh®>Suž>@“ú¾b,#þ®Ô>bÔ1јì¾VÛCO¦l=¾Cò”¤cd>Y€×¬†R¾c.Qé]*>ae6üŠ¤ü¾PXXhÂP×¾B!ŽH‰>«>^‘?…ľc{]wUF!>^°Ò­ʾBœz¹)W¾P *ãuç>a=T]×¾cä6$Ç>Y†ò…Ko¦¾æ,ê¸e¾V\˜T þ>b-æ ¾b&ez¬å>S}TÇÌŸ6>5R+àçƹ¾[Ö‰äÌç>c5 #ÿ¾`H¾óàl>IžÕEŠL\>HÊHÉÂH¾`"œZQ$Ÿ>c*Ãnߦؾ\…¬Í&>6õëFE2q>RõXŠ®Ä¾aÃEšÉ‘§>bs³ ¢¥¾V‚O.×Ë?¾š–Ï­`>XÌ` 'O¾b¿ù)aR>açîƵµ¾PA†ÒZ ¾A&‘´ˆ>]¶KqŽ½ð¾cm¡‘WT>^E2Nlh¾BüÌ›f‡¾NŒ˜÷hþ>`Ũÿ¨/·¾b¸d*ÍßJ>YZ_Ú:$n¾#®¹z¡^X¾UsýðÓm>b+€·V¾a¹£@Äj§>S˜‘2£‹>2gàûP`Õ¾ZÍŒÏmÁ>bÄÔÔrµ¾`¢‘/Œ>Jk#¯–¶>Fßï} ;O¾_,^»P¹®>bË~´>¾[÷³ =ÿ>9¹Û >QÒ›k"‡¾a8¬Ù>b-×ù?f¾VÄ­1¼?P¾^¾1›©>W‹É[¾b@ýˆ[ŸÁ>`òEÕå©ð¾PÕ’‰ûã%¾=€ù™0 ü>\i-hP«¾b§©ÖjÞM>^LeDNä¾DÅõ09V¾KÙÖóÿ>`#¥.e­¾bl¥c\ T>Y¸ ‡Æ]¾-*Àg­Ñ¾Sóø‡w‚>a‚Ò˜YpȾa“Ðë'z>TOr|έ’>)Oh×_¾YB<:ð >bH·g|‚¾`%7W®„¤>LŠo~[]#>CšÒÜ«¾]«FWUh>bpè®ݾ\b>l2v>?AMÿ¾>P¢ä¯ËÔ¾`ˆãc >aüØD÷å_¾W’1iFW’>híw'Ç>U»)*m5¶¾aªÜØ5(_>`ñK"’~§¾Rä\ ]³¾5÷´È}Ì“>Z¢¿ù<ãO¾b5Üî…[[>^³ÇGÚ@¾GÜ$y-Ƭ¾GÈ[ôáÙx>^ 8.7¼6¾b'å)>ZŒ7εB‰¾6k=#Ø ¾QÚ§b>`Ëa‹b¦q¾a‚ê°~>UIB÷¢>½û¹†ë…¾W.zC{%½>a·}kØW¾`MÇi[ >OÚi)>> €•?¾[¶NFræ>boÊ"Ÿ¾]+H˜Æ)Ô>C©ÖQ´{>KQé  M«¾_Q‹ñèÖ>aÓ "#ª¾XÓ¼x0%–>+Åe+ “>SUPë³à¾`ònàZ·À>a 3“¾SºRØà š¾'ŒˆE›3>XUõ³ï¸G¾a®ÝIQÉ2>_]·ò8­*¾L8âªÚ¾Bh±÷7¬8>\†ª(ð„æ¾aÛN+ߥ>[»‘ï#ó¾?ñ-â_O¾N@$xff>_Éî3¾awÆÁÕA\>W@¸eú‡­¾uùSP¾T…E-³®8>a³ùlf¾`ˆÍÒêœ>R˜¢‰ B>20(̾Y9†“³¦>a–£6Yw¾^1þÞ£î‰>HÓÑôhj>E:~¯¹ù¾]^ˆ €$>až•Z-¡¾Ziê×N†>9—ךVÇ÷>PN5Š¯0¾`r’'Ðô>aùÉpH‰¾UÙUqš‘¾aQhö>`‰G¡eŸ¾P©ߺ 7¾7v‚,±>Yá/ø£€¾asUb™.«>]~4½¾F‚Ëzø¾G}cB¢>Z>] Ð~«¾a]=}áW>Y=Ǿ”¹j¾4Jû—…oà¾Q7² uX>`þµ<¾`À¿áil½>T¢¸è×–9¾Vͱ›Ó>`ñžd=³¾_KPyž*>Nè' ‡ª>;¥¡sû<¾ZRÛ1å>aHÂÊÁ3¾\+?¢i¬®>C´ÿDŠ‚w>I8gÚ5]º¾]µ:m;ù¢>a'fÅw¾X;:æ¯M*>0 f*Íþœ>Qá|¹™j‡>r˜Ë‡2OÙ¾kˆ£¨ &L>FÀ¹žÚïo>b¢ïÿM¾qS¼ÒZ2¨>q¤1™!Vë¾dEít”Jü¾=Š=ˆ–’z>iú—K5~¾rZ–wñÈ>o&À´28ž¾Wš{¸q¾Y|$à;>o—àó»b%¾r4_K¬¦Î>izF?ÜG¾5U-Õ‚Kb¾dã‰xH^>>q’‘Úrk¾pççû>a~;‰@*>J%"ÿ§¾kŸõ¡oö>r8·Ö¿‹¾m¬ Þ7Ë>QÃXv™¥ø>^u†ª»ñ;pF„OêŽ>q¶Q2€>³¾fš°ŠGòû½ùØ?>Ï/æ>fà?Ù /¾q°I(ù>pZ¬Ú»(¾]ƒUÀúd¿¾RZ ‰î¡Ü>m“~lª¾qù©òÁ-Ô>jø§®¶N„¾HGZ~ÀG¾az½Én²¥>pŸÀN{âȾq"¬õ•tI>d‚,‹K >7>¥È©V¾h›}Úù>q°¨aQ¾nx$.çÃã>X,à°Ù0>W7˧|äF¾n ÎÂŽ2>q£ /æ¾hÎ~)o®N>;—c‘>c~é›Ïš¦¾pÚ‡4yÏE>p}ŠèIõb¾aªiV€Ê]¾E¾)¾ª‚ç>j,ÃÂðÀ¾q•O¥ûÌ>l«´ °‚˜¾Sm¨xør¾[©PÝÃÛ>oRj3l¾q7´îÕpö>f¡- èÿ^¾Ѹ“¶š¾eHq?yÌÃ>pùÉ劵 ¾o•gIÙ ¿>^‚õH៓>O%·V*¸Ð¾kXÑ+õ>qck›@×…¾jÒG@nñƒ>L$~ÿ>_¯íÚµ.¾oª`Btö—>p» td_>¾dv[¯niþ¾(ìiÔ)>fÙRÙ_v¾q:Ú0Ï´>nE¶’üh¾YÓt_mA ¾SèΆ·â>la•!Y½¾q¾¿Ôá>hò†6Ûo¾B m“ WW¾a§„?°Ò>p ƒÓz¾p0Fñ‡›…>bS'Áå²>>bžAI}¾h4׋¨h>pð§!®f6¾l’™¢ ‚{>UN¨tWÉö>Wà‘á[øk¾m7K+±ÑH>pÇnï¾>¾gI Gw>3ScDÜaaä¾p3ÙÉ´æÎ>o5yNdW¾`<eÕ¾G…³9 Ùd>i\2Ji*¾pÍÙ›´&>kö¦~óà¾PúHÞá¾[{'§Éˆž>mÝAûŠïì¾pc<Ø=]‘>e6’ãîZ?¾¼›º#^¾d±­³Âê >pC*z[’ð¾múµŽ£DW>\jÌ- >x>O7Â'¯¾jU&b4†ˆ>pšÀïºý¾iko,³Q®>I¶oŠcc>^»ëz²>¾nW¨…ÄbÝ>oç¬õt¶¾cc_Ç5€Ò¾*p^”DÏ>eð9F­iˆ¾p@Cmû>lµž¼Ói+¾X… rœ­Í¾S"^¦n“>k"ŽKþd&¾pZèS}>g× 1´RF¾Aêi`½Ⱦ`Òœüó«>n«5i7­¿¾n÷ˆbN9ž>aœ.å¯.P>;èy\aœ}¾gÇŒö>p-t”ˆÌ€¾kj–]í0>TÌ]ê×ä>VXGõ6ؾkǨ /ŠÊ>pQ˜˜îì¾fHà ½k>5/P¬U¢Á>bÕy¾nÜXè%x²>mû8¯#º¾_È2°D: ¾Dµ€¼/ >gí|—x¶o¾p ÿà 8>j³¹w„¾QDaj¾Y?7x@Ê!>lGævL/d¾osAv²j>dÂ5k ¾R±!y¾cA¼ð– @>nïQç¼ؾl÷B«©ž>\|3' 6¨>J鯦¾h²¡ä{¢>o‰á2·¬¾hÒ³!ø–—>KÞÃÞò;>[ÚŽºÌè3¾l¦Üx¾S>n¼&Z´¼¾cGÈÃ[g¾—  >d?ÝoKÌï¾nçDZä!J>kï°¤!J¾YXüêV-(¾PGè·¡^¨>iU©';%½¾oXÑÇ™,>gL¼»….¾EžmÔ- Ä¾^-ßž©Q&>lèrú–Rè¾mû× Å>aÛž' ±Õ>0Ó#<#оe½œ™òà>nÉ_]E”¾jç©'L· >Vb%më=>RÖD.¡N„¾iÙ<™ =‘>nàÌ_sSQ¾fPššjW>?›`xú±>`q½ý°»¾mN½ÑÅÀ>m42•g¾`šüõ뀾;†2x¨Sò>eÕ/é¥íŒ¾n—–þ¯>iâ&u6¢@¾S™„MŸtžU!­·U>j@,*lI¾n]—0¥ú>e;½è¾4ÜhÓN¾aH®Y&>m!ÔÎð ¾lj€v)±Œ>^kÆZ9ï>B¡Ë7º0’¾fqçðÀ¿/>nV<)Ú(s¾háÌ/3·>Q†“†=/>W-z’Œsƒ¾jFöÈš9>mÒE—ª¾cúåRÕÐý>&dŠ~Z7>aÍ=Û.ñ7¾m¸nŸä>k¡gÌ´S¾\oŽ{!¾Gýtº Ú>fóiœ,µ7¾n†=‘Â*>géc´¸†¾M0³ç 4¾Xü·«© ì>jõKg>¾mA¬ã?fé>bå>¯Ðe¾0N"£’À¾bx1©qr>m ÅžéO¾jÚú^ 8>Y¾}G'Åõ>JõkºŸI ¾g[¿ÄœÎT>m±xâ77¾fû)ÃÌX>Hĺoï ¡>Z’ž×¿£ø¾jæD@CŠŸ>l®ÉÃdAh¾aß Šö¾erKÇ f>c{‹1¦¾lë‘»éœ>jD¦Ê¢4¾W§ÕÔJÀP¾Np›bŸ¤>g­+J@"¾mSBÓ>fò'˜S¾D¾ŒuÝf¾[ñeùsùš>j÷Š]C4¾l"¿Úsx>`ë’NãËh>*ëÒ*3¾c€,ÿ˜¡¥>l¾ó¼¿R¾i^2VYR>U¼êªÓ">>P¿uñ©¾géVçE¼ >lð$j¾eCÓÕ‰ø×>ALý¤,:>]ÁU§ª¶¾jùj%ûòM>k‹×è7öT¾` 0¢Ü<¾3Ôôlà>cá9û)–‹¾l‰Y§úš>h«”¿´](¾SþBð0¶‚¾R’3âu½>h‚Wö(¾l‰ã~Ü€×>d|Ö¬¤M¾;Ãa©°Ý¾^z¸Æ—>jíÛr:é¾jÿS5³Oü>^xsªœ´¼>9w,DØþd,ÿ“0Á®>lLà¦sѾh4~€F>RlìÓÞà³>S28#É}q¾h,[£ÙÎ>l"äÑž¾cÄÕÜ2û¤>6 t}†>^ß,s˼¾jÖ¤ ,Ó>jwïÚ”ØÁ¾]œPsõ¾>MÒŠ'pû>ddüVQŠ ¾l íÚ8f7>gf4æY2¾Q BÇ8K¾T"€3ã¼->h6æ>e.ï¾k¼Ì‚çÁ>cëg¯w¾1åÆ— ¾_~ÙsL¹ó>jµÎGõÞ¾iöÙãÝ]>[¶*±Ök>A0ñÝäÌR¾dŠ“"œk»>kÄè‚j …¾fÕ+#š‡À>O¦‚inà¹>Tä11.‚ؾh3Ÿe>kY %ÉG¾b…Ä”ð>)½¶9ƒ>_ö3›%™ä¾j[-#>i}{ÿlɘ¾Z1¬‹)¾BÝ‹ÒU>dŸUL¾k|A0Kì>fPŸÖ¤å¶¾M“w‡‚‡´¾Uy-¢6>h$¦?¾jø[‡³»>aÿØ˱¾"Än[8¾.¾`#p3‘tg>j]¢p’Ó¾i È\ìò>Y’}¬_2¤>D0 Œg¾d¥ûŒêì>k1Ñ»+€G¾eÙ¯D)>KׯìãH>Uäã€,/¾h $º>j›y‰½Ž¾aŠÿÝ¿{î>u³ùu õ>`9Q²p¾j(_­D,>h¥{Iͧ¾X½%tõª¾E*D}[}>dœ™ VJ1¾jç?Ðtg>enÿµÂ0ξJqD°ìÖa¾V&çòÌbe>g延1sû¾jBó–±i>a':+U¾$ªÌÊô¾`=‹£Ù¥>iíêÛ_Ep¾hG«h1¼>XðØŠaƒ>EÎ<ìµ­¾d†{»%F>j'Í›(D¾e꿼Á>I_þxØ?Î>VCÜ롧¾g¸kƬæ>iïŸ8+Ä`¾`Ô™¿h >ûŸ:V²>`1QÌZ¾i®ÝþÇT>gó^ ª¥=¾W‰žŠîÓ¾FYI.0®>dcY,«l¾jS›BçË«>dÄà¾ü(n¾H¢Â¯*-©¾V:„:]-Š>g‚ë»:øà¾i¡ëá³`>`‘ç:.` ¾Ø ˆ Ì›¾`n¸Mž>ilònªš¾g¨“ã¹9H>W)µ¥ñó>F]E%ût¾d3¯O >j Çó,÷á¾d„a,%js>H7å™D`ÿ>V àì¾gEJÒÇ ->iZˆf¤/¾``—߉<û>Ó[n6¤>_Õ Í¾i%Ìòæ±0>ggšãÝü¾Vís _¶i¾EÑQ¨y>cøFLè.¹¾i¤Á>dQ*#u6¾H4©µ¬¾U»fˆÑ,…>fÿ¶k© õ¾iy¨Îtç>`?ü-ãk¾Ôµ2”ƒ_¾_aO—½½®>hÜo)¨è5¾g03g=™>VÖA{[v¬>E9lRi¾c±ˆÁüé¤>i{‚×™>‹¾d*E}Zåç>HLo—rŠ>UG¦ÜB¾f²* %Ñ^>hÙäígCÿ¾`.“v@Ã>¾Í,­³ >^ÏõˆbqŽ¾hzTh™#>g%V]p{¾Vâ¾8c­¾DW#Ú I>c_µŒÁ‡Ï¾i58µ¯q©>d÷­f\ñ½K£x¾h ½¡Æ­œ>`,GZW+à¾.ËÊ÷¾^!*úäj³>h>Ž(ßDå¾f܆Ò:->WËO1P>C+•X>ϾchSm=t>hïwT&âþ¾d™ê–5ï>I‰`<>Süßeü¾eÿÿUÜ<ÿ>hkÅ}ÏÚ¾`8 Zl¶!>B”ˆ`½œ>]U°#²aw¾gé"/?$>f¾|;ÜúL¾WaaùHíO¾A·ÅüÐ>b™_Ò&¾h©Mæ|Ç>cþvk"ŠÕ¾J’B•ñoH¾S&4:bbè>e› /½Ú¾h:h, ;>`Qq=À¸¾%Dj€Wa¾\mØ¥¯ã.>g¨e.¾f§Š5¦>WÏ¥g1U>?ü¾*hžb$<_EHA>ha×\,Ù(¾dM,§Ý>KßÕŠ-ÿ>R.ˆ•Ÿ‡¾e-?Á¶æ´>h Órµd¾`w¯¯`m>+üì *e>[i‡4 Âh¾g/ŸÚf>f•Œ@)¾!¾XZµ¾W‡‚¾<œ|óô=>a¢ø²Ë"•¾hGC²ó>dîÕ}e!¾Mm™RÈd¾Q×]T0I>dµÞ?«ð¾gÞ¢Üéö>`©ÚYGߤ¾1â¡Þ˜­ð¾ZG¶†³äË>fÊ4Bdù¬¾f‰–1ÑÜ>Y\·Ð'>7„/ð ?¾aB•Ýz>gËJž<Â_¾d,7´>O7§üR©>O¹¹§¦ý¾d4 ô^uI>g±}M úѾ`æt#Ôš°>6JÒÅ:ð>Y–Iöµ¾f]nòQÓ>f€8/  ù¾YÁÖÜXL0¾2’€ª ï>`z¤‹úd¾gzu›ô¹¶>dIÃ$ÓÕf¾PÈ¡ªø¾Mó ü!è>c§QžÄ•0¾g‚óüÌä‹>a,­!”ú¾;/' ïmø¾W¨fŠR@>eè ö6¾fyeþÆ+Z>Zšƒ$î>)øhT^ž¾_¤_Š¿2>g$Y½T¹¾dl¬y >‚>Q¹t–ÃT>JÑh*@¾cå°ˆŸ>gQä¤/c+¾ay8Û¦@ù>@D]~õ‡c>V*:¡j9¾ehÕ8Ay>frÙƒa3 ¾[†²_—ó¾Û–Ö«9>^63Œdxº¾fÇ1b~>d“J¤)ʾRîê~†‘¾FåEÚ­‘%>biãÂtRš¾gÔ¢q%¸>aÌ­ç±òm¾C(0ˆ¬¾TŒÅ+)³t>dÞĺ^£‚¾fj»ˆ¦>\„¯-…Ø=ÞÇÌ+õj¾\©8¼Ê>faJþÇeݾd»‡"ëï>T;L*H@>CsNUßóµ¾a¶î–}®8>fâI²ɾb$áÞ…;–>F@®uLXu>Rϧ÷;dH¥y™.¯>f_…òÄT¾]¶>K>éh;£c >ZüÊÛ¤Ï+¾eðíi9#6>dãR³Gþ?¾U›8üyò´¾?‚ ;¸vQ>`ôÖ“FÚ ¾fŸƒðíÏ>b€ k±n¾IŠ*òZêÕ¾PñÑ‹ß{>c¥/ÅUߟ¾fORóqñ>^§ì¶†Ïk¾+´Tºû¸¾Y/ên9*‘>etµ€¾eˆ±Ë½£>W XÍX>7£Ïñ'vø¾`"~ú´È>fRøTg¾bÛÈê7æ>LÿöShc¦>Må}Ý7¾bò“N”yG>f8¼óuš¾_ÆÆ3é‰Ø>5¢…–Æô>WA®Ó®Ò’¾dêÿÙзr>e):()ˆš¾Xˆ¼æâ¾.£[ö7,>^~V{ öI¾eúScÊä¯>c5Àý›VϾPM–ÚŒ$J¾I¤‹Çá>b/E¢0é¾fMÚ4á¢>`t›{.Ç5¾=Ì~é~É?¾U0v€­Gÿ>dRéR„¾eC2:XÀ>ZL³>>&ÅëlÊ·¾\”3-Êžá>e“Äÿiæ¾c‹xäB~¹>R*MÛ[À‰>E"À;Ln¾aYÌ–­Ï>eê`0 [ð¾aó©n>C'6DCa>RûVúªö¾c§Ð1ô¯>eSý5 Þ¾[™ŽS±_>=5ôùø>Z…}vé¾eIu21ï>cÚ§ñ:õà¾T2Zt|¾@b Ê´Â>`q$ÈÕi¾e®ÏTì`§>a‘¾>³Êê¾GŒ»ºãP¾P¡ÍÜzã>bêHÒHøÿ¾eX¡˜±9>]%Â%§vv¾(z¿w$pr¾XNãlPþ>d”Á³vþ‰¾d ³ï>O>V tˆCò>6Ê“Þ¿¾^èpŽn¦>eb]?²ð¡¾b&Û.­>LøŠÄ>LI:aºq×¾bª_ÁEO>eN8®\¾¾^¬Ì®á÷õ>6-j$½¨š>Uðe­ûq¾c÷´“‚>dZɻ¢¾Wô £š1[¾(ºvR •>\Ä%Y­l¾e§5S„>b•ŠUð¨ö¾PRÍC¨…¾G t–¼ >a.·ê’C¾e1ÎKïý>`MœE ž¾@3¿iáE¾ShîæP´¾>cCál #S¾d…MñE>Yä1ÎØiò=øJ¼Ûå¥M¾Zsúp=>d3i.jÙ¾cà6ä"H>R£ØôU£Ì>A‡9e‚5d¾`.ˆ»-3>eÈt;-¾`ÉWÁ+g}>Em&s<–>P¹6$TòϾbw4K†y>d‡V웶¾[ËSXCD²>#fÌ$ûÞ>W󪩙ë¾cÿ+7©’ˆ>chÚË·çE¾TõqÚOª.¾7ŠNÇ°ç†>^)ZI¿Ý¾d¸XY—>arpóƒ)¾J¸Þ™3"¾KÄ~•ïó>a%Q÷;¨¾dŸ|6Å»i>]¢ˆl]ý”¾58Ëþcø`¾UEG㌌>cV /ˠǾc·«£:ù›>WAm–Û¥>'!¢:â2-¾[Â_?6Š8>dU¬9VÞ»¾b þíŠ>Psé#ü >EˆӾã5¾`;ÓöàÀ>dˆ]†]8Ž¾_b\¨ºÎC>@{¤7 û>RhÉ×ÀýQ¾bvÒºw·>cHƾY€1¤çH=éøÁ¿M`^>Y%Õ Õ"-¾cÕœUïE>b’m-šÙ¾R®^š2¿V¾?¥rB¾>^ÚuBò®¾dTódûÖ>`ÆŠÝH¾Fk™th!ž¾N¿ y¨ª>a©¿ÁYaȾd !Wb;>[©¨nù½¾+@ù`\J¾VS$T"W.>c5[‚ÖoN¾c/3@AÚ>ULüM¹Ç>2“_Y”­¾\]ÅkÇB„>d•ÕÝé¾a>óçFÈk>L`g4ïÊ>HWŒ„¿#n¾`£N¬´ñA>d QÌ3ãϾ]µ2ž[]€>:mþW‚™Q>SK’Í«f+¾br^Ël²J>cTcj¿@¾WÙiÍ<}¤¾‹*£ÐHá>Y£Í]«V¾cŒB…ÍÑb>aä]cŸ¾Q%Hq¼¾A e»ïØ>^õÏU'+¾cè5AíT[>_šFlp¤N¾C»v¦=æõ¾PŠ‡ìÞ>aŠÙV)¾c†¥¨ºÌ>ZJ?(£šæ¾"IH+6§¾Vªg=LÌ>bð€о¾bm S¡%>T N¶NN >5DbNL¾\^Î}ÌO>cŸ´“§”7¾`§¯²z\S>J?kkÂå8>IM¾h"ꎾ`}0ÎY!>c•½p ¾\•l½¨ ®>7$0Äh®>Suž>@“ú¾b,#þ®Ô>bÔ1јì¾VÛCO¦l=¾Cò”¤cd>Y€×¬†R¾c.Qé]*>ae6üŠ¤ü¾PXXhÂP×¾B!ŽH‰>«>^‘?…ľc{]wUF!>^°Ò­ʾBœz¹)W¾P *ãuç>a=T]×¾cä6$Ç>Y†ò…Ko¦¾æ,ê¸e¾V\˜T þ>b-æ ¾b&ez¬å>S}TÇÌŸ6>5R+àçƹ¾[Ö‰äÌç>c5 #ÿ¾`H¾óàl>IžÕEŠL\>HÊHÉÂH¾`"œZQ$Ÿ>c*Ãnߦؾ\…¬Í&>6õëFE2q>RõXŠ®Ä¾aÃEšÉ‘§>bs³ ¢¥¾V‚O.×Ë?¾š–Ï­`>XÌ` 'O¾b¿ù)aR>açîƵµ¾PA†ÒZ ¾A&‘´ˆ>]¶KqŽ½ð¾cm¡‘WT>^E2Nlh¾BüÌ›f‡¾NŒ˜÷hþ>`Ũÿ¨/·¾b¸d*ÍßJ>YZ_Ú:$n¾#®¹z¡^X¾UsýðÓm>b+€·V¾a¹£@Äj§>S˜‘2£‹>2gàûP`Õ¾ZÍŒÏmÁ>bÄÔÔrµ¾`¢‘/Œ>Jk#¯–¶>Fßï} ;O¾_,^»P¹®>bË~´>¾[÷³ =ÿ>9¹Û >QÒ›k"‡¾a8¬Ù>b-×ù?f¾VÄ­1¼?P¾^¾1›©>W‹É[¾b@ýˆ[ŸÁ>`òEÕå©ð¾PÕ’‰ûã%¾=€ù™0 ü>\i-hP«¾b§©ÖjÞM>^LeDNä¾DÅõ09V¾KÙÖóÿ>`#¥.e­¾bl¥c\ T>Y¸ ‡Æ]¾-*Àg­Ñ¾Sóø‡w‚>a‚Ò˜YpȾa“Ðë'z>TOr|έ’>)Oh×_¾YB<:ð >bH·g|‚¾`%7W®„¤>LŠo~[]#>CšÒÜ«¾]«FWUh>bpè®ݾ\b>l2v>?AMÿ¾>P¢ä¯ËÔ¾`ˆãc >aüØD÷å_¾W’1iFW’>híw'Ç>U»)*m5¶¾aªÜØ5(_>`ñK"’~§¾Rä\ ]³¾5÷´È}Ì“>Z¢¿ù<ãO¾b5Üî…[[>^³ÇGÚ@¾GÜ$y-Ƭ¾GÈ[ôáÙx>^ 8.7¼6¾b'å)>ZŒ7εB‰¾6k=#Ø ¾QÚ§b>`Ëa‹b¦q¾a‚ê°~>UIB÷¢>½û¹†ë…¾W.zC{%½>a·}kØW¾`MÇi[ >OÚi)>> €•?¾[¶NFræ>boÊ"Ÿ¾]+H˜Æ)Ô>C©ÖQ´{>KQé  M«¾_Q‹ñèÖ>aÓ "#ª¾XÓ¼x0%–>+Åe+ “>SUPë³à¾`ònàZ·À>a 3“¾SºRØà š¾'ŒˆE›3>XUõ³ï¸G¾a®ÝIQÉ2>_]·ò8­*¾L8âªÚ¾Bh±÷7¬8>\†ª(ð„æ¾aÛN+ߥ>[»‘ï#ó¾?ñ-â_O¾N@$xff>_Éî3¾awÆÁÕA\>W@¸eú‡­¾uùSP¾T…E-³®8>a³ùlf¾`ˆÍÒêœ>R˜¢‰ B>20(̾Y9†“³¦>a–£6Yw¾^1þÞ£î‰>HÓÑôhj>E:~¯¹ù¾]^ˆ €$>až•Z-¡¾Ziê×N†>9—ךVÇ÷>PN5Š¯0¾`r’'Ðô>aùÉpH‰¾UÙUqš‘¾aQhö>`‰G¡eŸ¾P©ߺ 7¾7v‚,±>Yá/ø£€¾asUb™.«>]~4½¾F‚Ëzø¾G}cB¢>Z>] Ð~«¾a]=}áW>Y=Ǿ”¹j¾4Jû—…oà¾Q7² uX>`þµ<¾`À¿áil½>T¢¸è×–9¾Vͱ›Ó>`ñžd=³¾_KPyž*>Nè' ‡ª>;¥¡sû<¾ZRÛ1å>aHÂÊÁ3¾\+?¢i¬®>C´ÿDŠ‚w>I8gÚ5]º¾]µ:m;ù¢>a'fÅw¾X;:æ¯M*>0 f*Íþœ>Qá|¹™j‡>r˜Ë‡2OÙ¾kˆ£¨ &L>FÀ¹žÚïo>b¢ïÿM¾qS¼ÒZ2¨>q¤1™!Vë¾dEít”Jü¾=Š=ˆ–’z>iú—K5~¾rZ–wñÈ>o&À´28ž¾Wš{¸q¾Y|$à;>o—àó»b%¾r4_K¬¦Î>izF?ÜG¾5U-Õ‚Kb¾dã‰xH^>>q’‘Úrk¾pççû>a~;‰@*>J%"ÿ§¾kŸõ¡oö>r8·Ö¿‹¾m¬ Þ7Ë>QÃXv™¥ø>^u†ª»ñ;pF„OêŽ>q¶Q2€>³¾fš°ŠGòû½ùØ?>Ï/æ>fà?Ù /¾q°I(ù>pZ¬Ú»(¾]ƒUÀúd¿¾RZ ‰î¡Ü>m“~lª¾qù©òÁ-Ô>jø§®¶N„¾HGZ~ÀG¾az½Én²¥>pŸÀN{âȾq"¬õ•tI>d‚,‹K >7>¥È©V¾h›}Úù>q°¨aQ¾nx$.çÃã>X,à°Ù0>W7˧|äF¾n ÎÂŽ2>q£ /æ¾hÎ~)o®N>;—c‘>c~é›Ïš¦¾pÚ‡4yÏE>p}ŠèIõb¾aªiV€Ê]¾E¾)¾ª‚ç>j,ÃÂðÀ¾q•O¥ûÌ>l«´ °‚˜¾Sm¨xør¾[©PÝÃÛ>oRj3l¾q7´îÕpö>f¡- èÿ^¾Ѹ“¶š¾eHq?yÌÃ>pùÉ劵 ¾o•gIÙ ¿>^‚õH៓>O%·V*¸Ð¾kXÑ+õ>qck›@×…¾jÒG@nñƒ>L$~ÿ>_¯íÚµ.¾oª`Btö—>p» td_>¾dv[¯niþ¾(ìiÔ)>fÙRÙ_v¾q:Ú0Ï´>nE¶’üh¾YÓt_mA ¾SèΆ·â>la•!Y½¾q¾¿Ôá>hò†6Ûo¾B m“ WW¾a§„?°Ò>p ƒÓz¾p0Fñ‡›…>bS'Áå²>>bžAI}¾h4׋¨h>pð§!®f6¾l’™¢ ‚{>UN¨tWÉö>Wà‘á[øk¾m7K+±ÑH>pÇnï¾>¾gI Gw>3ScDÜaaä¾p3ÙÉ´æÎ>o5yNdW¾`<eÕ¾G…³9 Ùd>i\2Ji*¾pÍÙ›´&>kö¦~óà¾PúHÞá¾[{'§Éˆž>mÝAûŠïì¾pc<Ø=]‘>e6’ãîZ?¾¼›º#^¾d±­³Âê >pC*z[’ð¾múµŽ£DW>\jÌ- >x>O7Â'¯¾jU&b4†ˆ>pšÀïºý¾iko,³Q®>I¶oŠcc>^»ëz²>¾nW¨…ÄbÝ>oç¬õt¶¾cc_Ç5€Ò¾*p^”DÏ>eð9F­iˆ¾p@Cmû>lµž¼Ói+¾X… rœ­Í¾S"^¦n“>k"ŽKþd&¾pZèS}>g× 1´RF¾Aêi`½Ⱦ`Òœüó«>n«5i7­¿¾n÷ˆbN9ž>aœ.å¯.P>;èy\aœ}¾gÇŒö>p-t”ˆÌ€¾kj–]í0>TÌ]ê×ä>VXGõ6ؾkǨ /ŠÊ>pQ˜˜îì¾fHà ½k>5/P¬U¢Á>bÕy¾nÜXè%x²>mû8¯#º¾_È2°D: ¾Dµ€¼/ >gí|—x¶o¾p ÿà 8>j³¹w„¾QDaj¾Y?7x@Ê!>lGævL/d¾osAv²j>dÂ5k ¾R±!y¾cA¼ð– @>nïQç¼ؾl÷B«©ž>\|3' 6¨>J鯦¾h²¡ä{¢>o‰á2·¬¾hÒ³!ø–—>KÞÃÞò;>[ÚŽºÌè3¾l¦Üx¾S>n¼&Z´¼¾cGÈÃ[g¾—  >d?ÝoKÌï¾nçDZä!J>kï°¤!J¾YXüêV-(¾PGè·¡^¨>iU©';%½¾oXÑÇ™,>gL¼»….¾EžmÔ- Ä¾^-ßž©Q&>lèrú–Rè¾mû× Å>aÛž' ±Õ>0Ó#<#оe½œ™òà>nÉ_]E”¾jç©'L· >Vb%më=>RÖD.¡N„¾iÙ<™ =‘>nàÌ_sSQ¾fPššjW>?›`xú±>`q½ý°»¾mN½ÑÅÀ>m42•g¾`šüõ뀾;†2x¨Sò>eÕ/é¥íŒ¾n—–þ¯>iâ&u6¢@¾S™„MŸtžU!­·U>j@,*lI¾n]—0¥ú>e;½è¾4ÜhÓN¾aH®Y&>m!ÔÎð ¾lj€v)±Œ>^kÆZ9ï>B¡Ë7º0’¾fqçðÀ¿/>nV<)Ú(s¾háÌ/3·>Q†“†=/>W-z’Œsƒ¾jFöÈš9>mÒE—ª¾cúåRÕÐý>&dŠ~Z7>aÍ=Û.ñ7¾m¸nŸä>k¡gÌ´S¾\oŽ{!¾Gýtº Ú>fóiœ,µ7¾n†=‘Â*>géc´¸†¾M0³ç 4¾Xü·«© ì>jõKg>¾mA¬ã?fé>bå>¯Ðe¾0N"£’À¾bx1©qr>m ÅžéO¾jÚú^ 8>Y¾}G'Åõ>JõkºŸI ¾g[¿ÄœÎT>m±xâ77¾fû)ÃÌX>Hĺoï ¡>Z’ž×¿£ø¾jæD@CŠŸ>l®ÉÃdAh¾aß Šö¾erKÇ f>c{‹1¦¾lë‘»éœ>jD¦Ê¢4¾W§ÕÔJÀP¾Np›bŸ¤>g­+J@"¾mSBÓ>fò'˜S¾D¾ŒuÝf¾[ñeùsùš>j÷Š]C4¾l"¿Úsx>`ë’NãËh>*ëÒ*3¾c€,ÿ˜¡¥>l¾ó¼¿R¾i^2VYR>U¼êªÓ">>P¿uñ©¾géVçE¼ >lð$j¾eCÓÕ‰ø×>ALý¤,:>]ÁU§ª¶¾jùj%ûòM>k‹×è7öT¾` 0¢Ü<¾3Ôôlà>cá9û)–‹¾l‰Y§úš>h«”¿´](¾SþBð0¶‚¾R’3âu½>h‚Wö(¾l‰ã~Ü€×>d|Ö¬¤M¾;Ãa©°Ý¾^z¸Æ—>jíÛr:é¾jÿS5³Oü>^xsªœ´¼>9w,DØþd,ÿ“0Á®>lLà¦sѾh4~€F>RlìÓÞà³>S28#É}q¾h,[£ÙÎ>l"äÑž¾cÄÕÜ2û¤>6 t}†>^ß,s˼¾jÖ¤ ,Ó>jwïÚ”ØÁ¾]œPsõ¾>MÒŠ'pû>ddüVQŠ ¾l íÚ8f7>gf4æY2¾Q BÇ8K¾T"€3ã¼->h6æ>e.ï¾k¼Ì‚çÁ>cëg¯w¾1åÆ— ¾_~ÙsL¹ó>jµÎGõÞ¾iöÙãÝ]>[¶*±Ök>A0ñÝäÌR¾dŠ“"œk»>kÄè‚j …¾fÕ+#š‡À>O¦‚inà¹>Tä11.‚ؾh3Ÿe>kY %ÉG¾b…Ä”ð>)½¶9ƒ>_ö3›%™ä¾j[-#>i}{ÿlɘ¾Z1¬‹)¾BÝ‹ÒU>dŸUL¾k|A0Kì>fPŸÖ¤å¶¾M“w‡‚‡´¾Uy-¢6>h$¦?¾jø[‡³»>aÿØ˱¾"Än[8¾.¾`#p3‘tg>j]¢p’Ó¾i È\ìò>Y’}¬_2¤>D0 Œg¾d¥ûŒêì>k1Ñ»+€G¾eÙ¯D)>KׯìãH>Uäã€,/¾h $º>j›y‰½Ž¾aŠÿÝ¿{î>u³ùu õ>`9Q²p¾j(_­D,>h¥{Iͧ¾X½%tõª¾E*D}[}>dœ™ VJ1¾jç?Ðtg>enÿµÂ0ξJqD°ìÖa¾V&çòÌbe>g延1sû¾jBó–±i>a':+U¾$ªÌÊô¾`=‹£Ù¥>iíêÛ_Ep¾hG«h1¼>XðØŠaƒ>EÎ<ìµ­¾d†{»%F>j'Í›(D¾e꿼Á>I_þxØ?Î>VCÜ롧¾g¸kƬæ>iïŸ8+Ä`¾`Ô™¿h >ûŸ:V²>`1QÌZ¾i®ÝþÇT>gó^ ª¥=¾W‰žŠîÓ¾FYI.0®>dcY,«l¾jS›BçË«>dÄà¾ü(n¾H¢Â¯*-©¾V:„:]-Š>g‚ë»:øà¾i¡ëá³`>`‘ç:.` ¾Ø ˆ Ì›¾`n¸Mž>ilònªš¾g¨“ã¹9H>W)µ¥ñó>F]E%ût¾d3¯O >j Çó,÷á¾d„a,%js>H7å™D`ÿ>V àì¾gEJÒÇ ->iZˆf¤/¾``—߉<û>Ó[n6¤>_Õ Í¾i%Ìòæ±0>ggšãÝü¾Vís _¶i¾EÑQ¨y>cøFLè.¹¾i¤Á>dQ*#u6¾H4©µ¬¾U»fˆÑ,…>fÿ¶k© õ¾iy¨Îtç>`?ü-ãk¾Ôµ2”ƒ_¾_aO—½½®>hÜo)¨è5¾g03g=™>VÖA{[v¬>E9lRi¾c±ˆÁüé¤>i{‚×™>‹¾d*E}Zåç>HLo—rŠ>UG¦ÜB¾f²* %Ñ^>hÙäígCÿ¾`.“v@Ã>¾Í,­³ >^ÏõˆbqŽ¾hzTh™#>g%V]p{¾Vâ¾8c­¾DW#Ú I>c_µŒÁ‡Ï¾i58µ¯q©>d÷­f\ñ½K£x¾h ½¡Æ­œ>`,GZW+à¾.ËÊ÷¾^!*úäj³>h>Ž(ßDå¾f܆Ò:->WËO1P>C+•X>ϾchSm=t>hïwT&âþ¾d™ê–5ï>I‰`<>Süßeü¾eÿÿUÜ<ÿ>hkÅ}ÏÚ¾`8 Zl¶!>B”ˆ`½œ>]U°#²aw¾gé"/?$>f¾|;ÜúL¾WaaùHíO¾A·ÅüÐ>b™_Ò&¾h©Mæ|Ç>cþvk"ŠÕ¾J’B•ñoH¾S&4:bbè>e› /½Ú¾h:h, ;>`Qq=À¸¾%Dj€Wa¾\mØ¥¯ã.>g¨e.¾f§Š5¦>WÏ¥g1U>?ü¾*hžb$<_EHA>ha×\,Ù(¾dM,§Ý>KßÕŠ-ÿ>R.ˆ•Ÿ‡¾e-?Á¶æ´>h Órµd¾`w¯¯`m>+üì *e>[i‡4 Âh¾g/ŸÚf>f•Œ@)¾!¾XZµ¾W‡‚¾<œ|óô=>a¢ø²Ë"•¾hGC²ó>dîÕ}e!¾Mm™RÈd¾Q×]T0I>dµÞ?«ð¾gÞ¢Üéö>`©ÚYGߤ¾1â¡Þ˜­ð¾ZG¶†³äË>fÊ4Bdù¬¾f‰–1ÑÜ>Y\·Ð'>7„/ð ?¾aB•Ýz>gËJž<Â_¾d,7´>O7§üR©>O¹¹§¦ý¾d4 ô^uI>g±}M úѾ`æt#Ôš°>6JÒÅ:ð>Y–Iöµ¾f]nòQÓ>f€8/  ù¾YÁÖÜXL0¾2’€ª ï>`z¤‹úd¾gzu›ô¹¶>dIÃ$ÓÕf¾PÈ¡ªø¾Mó ü!è>c§QžÄ•0¾g‚óüÌä‹>a,­!”ú¾;/' ïmø¾W¨fŠR@>eè ö6¾fyeþÆ+Z>Zšƒ$î>)øhT^ž¾_¤_Š¿2>g$Y½T¹¾dl¬y >‚>Q¹t–ÃT>JÑh*@¾cå°ˆŸ>gQä¤/c+¾ay8Û¦@ù>@D]~õ‡c>V*:¡j9¾ehÕ8Ay>frÙƒa3 ¾[†²_—ó¾Û–Ö«9>^63Œdxº¾fÇ1b~>d“J¤)ʾRîê~†‘¾FåEÚ­‘%>biãÂtRš¾gÔ¢q%¸>aÌ­ç±òm¾C(0ˆ¬¾TŒÅ+)³t>dÞĺ^£‚¾fj»ˆ¦>\„¯-…Ø=ÞÇÌ+õj¾\©8¼Ê>faJþÇeݾd»‡"ëï>T;L*H@>CsNUßóµ¾a¶î–}®8>fâI²ɾb$áÞ…;–>F@®uLXu>Rϧ÷;dH¥y™.¯>f_…òÄT¾]¶>K>éh;£c >ZüÊÛ¤Ï+¾eðíi9#6>dãR³Gþ?¾U›8üyò´¾?‚ ;¸vQ>`ôÖ“FÚ ¾fŸƒðíÏ>b€ k±n¾IŠ*òZêÕ¾PñÑ‹ß{>c¥/ÅUߟ¾fORóqñ>^§ì¶†Ïk¾+´Tºû¸¾Y/ên9*‘>etµ€¾eˆ±Ë½£>W XÍX>7£Ïñ'vø¾`"~ú´È>fRøTg¾bÛÈê7æ>LÿöShc¦>Må}Ý7¾bò“N”yG>f8¼óuš¾_ÆÆ3é‰Ø>5¢…–Æô>WA®Ó®Ò’¾dêÿÙзr>e):()ˆš¾Xˆ¼æâ¾.£[ö7,>^~V{ öI¾eúScÊä¯>c5Àý›VϾPM–ÚŒ$J¾I¤‹Çá>b/E¢0é¾fMÚ4á¢>`t›{.Ç5¾=Ì~é~É?¾U0v€­Gÿ>dRéR„¾eC2:XÀ>ZL³>>&ÅëlÊ·¾\”3-Êžá>e“Äÿiæ¾c‹xäB~¹>R*MÛ[À‰>E"À;Ln¾aYÌ–­Ï>eê`0 [ð¾aó©n>C'6DCa>RûVúªö¾c§Ð1ô¯>eSý5 Þ¾[™ŽS±_>=5ôùø>Z…}vé¾eIu21ï>cÚ§ñ:õà¾T2Zt|¾@b Ê´Â>`q$ÈÕi¾e®ÏTì`§>a‘¾>³Êê¾GŒ»ºãP¾P¡ÍÜzã>bêHÒHøÿ¾eX¡˜±9>]%Â%§vv¾(z¿w$pr¾XNãlPþ>d”Á³vþ‰¾d ³ï>O>V tˆCò>6Ê“Þ¿¾^èpŽn¦>eb]?²ð¡¾b&Û.­>LøŠÄ>LI:aºq×¾bª_ÁEO>eN8®\¾¾^¬Ì®á÷õ>6-j$½¨š>Uðe­ûq¾c÷´“‚>dZɻ¢¾Wô £š1[¾(ºvR •>\Ä%Y­l¾e§5S„>b•ŠUð¨ö¾PRÍC¨…¾G t–¼ >a.·ê’C¾e1ÎKïý>`MœE ž¾@3¿iáE¾ShîæP´¾>cCál #S¾d…MñE>Yä1ÎØiò=øJ¼Ûå¥M¾Zsúp=>d3i.jÙ¾cà6ä"H>R£ØôU£Ì>A‡9e‚5d¾`.ˆ»-3>eÈt;-¾`ÉWÁ+g}>Em&s<–>P¹6$TòϾbw4K†y>d‡V웶¾[ËSXCD²>#fÌ$ûÞ>W󪩙ë¾cÿ+7©’ˆ>chÚË·çE¾TõqÚOª.¾7ŠNÇ°ç†>^)ZI¿Ý¾d¸XY—>arpóƒ)¾J¸Þ™3"¾KÄ~•ïó>a%Q÷;¨¾dŸ|6Å»i>]¢ˆl]ý”¾58Ëþcø`¾UEG㌌>cV /ˠǾc·«£:ù›>WAm–Û¥>'!¢:â2-¾[Â_?6Š8>dU¬9VÞ»¾b þíŠ>Psé#ü >EˆӾã5¾`;ÓöàÀ>dˆ]†]8Ž¾_b\¨ºÎC>@{¤7 û>RhÉ×ÀýQ¾bvÒºw·>cHƾY€1¤çH=éøÁ¿M`^>Y%Õ Õ"-¾cÕœUïE>b’m-šÙ¾R®^š2¿V¾?¥rB¾>^ÚuBò®¾dTódûÖ>`ÆŠÝH¾Fk™th!ž¾N¿ y¨ª>a©¿ÁYaȾd !Wb;>[©¨nù½¾+@ù`\J¾VS$T"W.>c5[‚ÖoN¾c/3@AÚ>ULüM¹Ç>2“_Y”­¾\]ÅkÇB„>d•ÕÝé¾a>óçFÈk>L`g4ïÊ>HWŒ„¿#n¾`£N¬´ñA>d QÌ3ãϾ]µ2ž[]€>:mþW‚™Q>SK’Í«f+¾br^Ël²J>cTcj¿@¾WÙiÍ<}¤¾‹*£ÐHá>Y£Í]«V¾cŒB…ÍÑb>aä]cŸ¾Q%Hq¼¾A e»ïØ>^õÏU'+¾cè5AíT[>_šFlp¤N¾C»v¦=æõ¾PŠ‡ìÞ>aŠÙV)¾c†¥¨ºÌ>ZJ?(£šæ¾"IH+6§¾Vªg=LÌ>bð€о¾bm S¡%>T N¶NN >5DbNL¾\^Î}ÌO>cŸ´“§”7¾`§¯²z\S>J?kkÂå8>IM¾h"ꎾ`}0ÎY!>c•½p ¾\•l½¨ ®>7$0Äh®>Suž>@“ú¾b,#þ®Ô>bÔ1јì¾VÛCO¦l=¾Cò”¤cd>Y€×¬†R¾c.Qé]*>ae6üŠ¤ü¾PXXhÂP×¾B!ŽH‰>«>^‘?…ľc{]wUF!>^°Ò­ʾBœz¹)W¾P *ãuç>a=T]×¾cä6$Ç>Y†ò…Ko¦¾æ,ê¸e¾V\˜T þ>b-æ ¾b&ez¬å>S}TÇÌŸ6>5R+àçƹ¾[Ö‰äÌç>c5 #ÿ¾`H¾óàl>IžÕEŠL\>HÊHÉÂH¾`"œZQ$Ÿ>c*Ãnߦؾ\…¬Í&>6õëFE2q>RõXŠ®Ä¾aÃEšÉ‘§>bs³ ¢¥¾V‚O.×Ë?¾š–Ï­`>XÌ` 'O¾b¿ù)aR>açîƵµ¾PA†ÒZ ¾A&‘´ˆ>]¶KqŽ½ð¾cm¡‘WT>^E2Nlh¾BüÌ›f‡¾NŒ˜÷hþ>`Ũÿ¨/·¾b¸d*ÍßJ>YZ_Ú:$n¾#®¹z¡^X¾UsýðÓm>b+€·V¾a¹£@Äj§>S˜‘2£‹>2gàûP`Õ¾ZÍŒÏmÁ>bÄÔÔrµ¾`¢‘/Œ>Jk#¯–¶>Fßï} ;O¾_,^»P¹®>bË~´>¾[÷³ =ÿ>9¹Û >QÒ›k"‡¾a8¬Ù>b-×ù?f¾VÄ­1¼?P¾^¾1›©>W‹É[¾b@ýˆ[ŸÁ>`òEÕå©ð¾PÕ’‰ûã%¾=€ù™0 ü>\i-hP«¾b§©ÖjÞM>^LeDNä¾DÅõ09V¾KÙÖóÿ>`#¥.e­¾bl¥c\ T>Y¸ ‡Æ]¾-*Àg­Ñ¾Sóø‡w‚>a‚Ò˜YpȾa“Ðë'z>TOr|έ’>)Oh×_¾YB<:ð >bH·g|‚¾`%7W®„¤>LŠo~[]#>CšÒÜ«¾]«FWUh>bpè®ݾ\b>l2v>?AMÿ¾>P¢ä¯ËÔ¾`ˆãc >aüØD÷å_¾W’1iFW’>híw'Ç>U»)*m5¶¾aªÜØ5(_>`ñK"’~§¾Rä\ ]³¾5÷´È}Ì“>Z¢¿ù<ãO¾b5Üî…[[>^³ÇGÚ@¾GÜ$y-Ƭ¾GÈ[ôáÙx>^ 8.7¼6¾b'å)>ZŒ7εB‰¾6k=#Ø ¾QÚ§b>`Ëa‹b¦q¾a‚ê°~>UIB÷¢>½û¹†ë…¾W.zC{%½>a·}kØW¾`MÇi[ >OÚi)>> €•?¾[¶NFræ>boÊ"Ÿ¾]+H˜Æ)Ô>C©ÖQ´{>KQé  M«¾_Q‹ñèÖ>aÓ "#ª¾XÓ¼x0%–>+Åe+ “>SUPë³à¾`ònàZ·À>a 3“¾SºRØà š¾'ŒˆE›3>XUõ³ï¸G¾a®ÝIQÉ2>_]·ò8­*¾L8âªÚ¾Bh±÷7¬8>\†ª(ð„æ¾aÛN+ߥ>[»‘ï#ó¾?ñ-â_O¾N@$xff>_Éî3¾awÆÁÕA\>W@¸eú‡­¾uùSP¾T…E-³®8>a³ùlf¾`ˆÍÒêœ>R˜¢‰ B>20(̾Y9†“³¦>a–£6Yw¾^1þÞ£î‰>HÓÑôhj>E:~¯¹ù¾]^ˆ €$>až•Z-¡¾Ziê×N†>9—ךVÇ÷>PN5Š¯0¾`r’'Ðô>aùÉpH‰¾UÙUqš‘¾aQhö>`‰G¡eŸ¾P©ߺ 7¾7v‚,±>Yá/ø£€¾asUb™.«>]~4½¾F‚Ëzø¾G}cB¢>Z>] Ð~«¾a]=}áW>Y=Ǿ”¹j¾4Jû—…oà¾Q7² uX>`þµ<¾`À¿áil½>T¢¸è×–9¾Vͱ›Ó>`ñžd=³¾_KPyž*>Nè' ‡ª>;¥¡sû<¾ZRÛ1å>aHÂÊÁ3¾\+?¢i¬®>C´ÿDŠ‚w>I8gÚ5]º¾]µ:m;ù¢>a'fÅw¾X;:æ¯M*>0 f*Íþœ>Qá|¹™j‡¾`kÔ ©>`l„]½„Š¾Sž`"8¹•¾KGSB">V”G}¸¾`Ø>ü6>^‰a´²$¾LñJ’¢¾>Çß:l6[>Z”œ9Êi¾aÀƒ`U>[Y›T#Áw¾A✙DDi¾Jq«ÿfŠç>]ÄÑ®½Ù£¾`Úç„”>WeËÛ׃¸¾)©ç ülP¾RP ÚëÀâ>`ºÓ‰´i¾` Ž¡ËvÊ>RÏ?ïÅÎÚ>$Œ¿¿^=K¾VÖ Z¼>`·IÁŒË¾]â_л>KoQ¼O¢>@s‹X”a¾Zªò`Õ>`èÖ."÷¾Z­Œä÷?|>@Ž¸ ³n>K0ώ¾]²Ú¶ðþþ>`Ÿ$ëÄr6¾V¿»Ò½>%C‰wŽq>R‡žÙÏy¾_Þlý®^>_¼ÔÖQ ¾R5¯3΄¾'òLx š>Vç¨ zD®¾`Éógè>]YI£+'©¾JbrZ²E¾A†=â»>Z˜už½•¾`·ÆŽɧ>Z)>ÅÇó¾?n‰JLäæ¾KyÓùIiæ>]ƒeÕÀ¾`hüѶÅ>VGƒ»Øvƒ¾"ÒYltS“¾RŠø3¡%l>_—Ù€Zªã¾_Mnþ>QÏæû-÷>)c•XËÌò¾VËtþÝy>`cóÿo ¾\ï'úÅ>IÊkø‹ƒÂ>AˆA.¾Zaj'Vx>`‡äå ·¾YÌéoÃ;>>²ºêì¨ì>KTxm50í¾]8–Ú1&>`9åà!¾Uþf‡ÌF>"L$4å>R\*\D{¾_>ùm:\¯>^ôYÕ¾QŸSf9÷¾(êS„+>Vƒœ‡X9•¾`4>|©Å>\¤«†’B¾I¤€NH¹¾@ÂÄî8±`>Z~¡ÞÅÙ¾`Y`©»5¨>Y—ÒcGC¾>áÚ7¹–Y¾JÃ4­Õ„Ü>\ÓQ^ÔŠ¾`öŸêò·>UâÐû5ŽÐ¾#¥pdÆç¾Qûϧ/¿m>^ÔŒGD춾^°%„E'b>Q¢jÔ¢Ÿ>&• ¥ÉÁξVTñ#ö>`é±ñŽ¾\x†¹&èY>Iìé’„Ë>?ìEóì³¾Y‹ Èç Æ>`+Í„p/¾Y‡Ëxª¥S>?õ®¬%š‘>IÇ­´Øœ¾\Rõr± Û>_Ô‹ùˆf¾Uóy®ê>&Õb/_>Qk;·Ž¾^X‡:U>^€mˆÓ”Œ¾QÖêd È¾"p½zFzÊ>UuSd‚¾_’uÛ3`e>\hM¾ù˜A¾Jž.ñb…о=tÞð(>XëXÁQ¾_ûÝâ÷äÒ>Yš‚ E(ì¾@óg`w2€¾Haý˜Cÿ>[¶v›²Ç ¾_“¦%¡¢.>V-"„Ÿöô¾+ÌiÇ f¾P©Üì7ß>]ÈZ¢IÛ¾^aßJ(>R9Ú x„ >‡H†ÞžT®®}‚@T>_œçÖ˜M¾\p(‡hçL>K³ŽÄt˜‰>:!»È´v¾X&bío_Ã>_œ¤à¾Y̪[Ü>>BW#^Y_>F’¿D@\¾Zûê{!B>_Xƒ “’¾VAÇK’>1<Ïêlh>Op•Eâ-¾]"˜uÛq>^P&!•„¾RÇ3!´˜o¾ÉãÖ¿3x>S»»V’Qɾ^×ò´>\‹â<ûU¾M'îF¤„¾5òû Ì».>W:PœÜ¾_5—-už>ZRNÈ­¾D É·Mæ¾DYñƒÑž>Z ¥¢ (ò¾_ì<º"o>W\Ó¸¾5ctâüà¾M* q>\a4’ë5Û¾^Ez…B³>SzÜ0ÉŽÙ¾Qmê›Ü¾R™åuFü->]î1A‡¾\¶5P•Ð>Nñ¿T2D>0ëå)O¾V#wùw[…>^Â-ä/d¾Z}³«‚>FG#ÄXËò>A¸ƘçO¾Y Š¨-.:>^ÛßÕ ,¾WªÖU&—Æ>:PG^œË>J}h “!¾[€'7 ´>^;Ÿ5'¯ö¾TO×’£0>{•ªf6D>QFã´Ù¾]5ŠCX¹È>\é 7î¾P…?>;ä¾& îË€lƒ>Tß½Ì[[ó¾^;d[¹ôV>Zïãºá"¾HÂçŠ\ö‘¾=Xrç>Wö¹ÖX 9¾^Z#üR'>X\mlŸ¾?öãDľGejfʘß>Zy†bG¶à¾^+<â-zÒ>U@aŠäî¹¾+µ“n|îÕ¾O€€0 0*>\\þ· Û"¾][EPS >Q±ñ„ó#”>Ÿ„éhSœ¾SjÃVç`C>]™Û–v ®¾[hgÔ2ÓE>K‰¯T‰ÔÛ>6këÇÐß[¾V’Xz&M>^)`òmù¾Y¤ãqÜ>C$sB'6N>Cá Yò=оYGI/ϧ©>^ ?Ú7¤n¾VDØgp¹é>4Ð}>¿ÓD>Lõ„hú¾[]"Áð®6>]Fñ¼UÍx¾Rø6±ó>5q›º+o>QÀ_ •»U¾\Ô©fÅN'>[ÞF ­¾Nj{½Ý‚¾-V,ÈpÓï>UìÿB¾]§ŸE>YÝÍs¾F˜¤øúS¾?Þ?[žCž>Wã`¹Ñ˯¾]Ô®¡úøc>WT,6ãX«¾Z-è“#…n¾]^ u'0>TOXóŠT9¾&`kµG¾O¸·rž|á>[ãñ|z¾\G8èò÷Ý>PâéŽþà>t(GG¡Ê¾SI »{Uv>\ý%š¢uá¾Zšð>.y>JHcº];ª>7!TÇ:•ã¾VFûæîc>]y¹¥‡!F¾Xc‚(\o >BMƒúÊ,>CÃZAï +¾XÆË­Ï>]V>8:D¾U­úŽBÚT>4@ó9>Kw´¹}¾Z¼ÅO®>\˜AL5=¾RŒÿêÜ> ‹ u͉F>QDJ<½¾\ æµÓªe>[Eáâ^¾N#{‰;hÚ¾+ ôl*a›>Tk¢5kD)¾\ïI{€´G>YgLûòc¾F¥ý€œ¾=ä¾û¨-Q>W µŒ¾]$^ÒüÜi>Wà¹(œ¾=l­`Tt<¾FºùŒz>YVµq§â'¾\ËóT>T: lAu¦¾*W À-¾MýP*œ`>[n/¿Ù¾[ÐÊGxP>Q s ñj> º&VÄx´¾RK7΢g’>\)šÔ[û¾ZQ£ú6°T>K‰¨*n¯>3_1 /Þ ¾U2’t^>\ºî\&ƒw¾XRf»…ûŒ>C¢Uo¨'×>Aþ5į¾W©ÝnÚFN>\¼Ÿ³§¾UÞ!Mg>7¶§T0ƒ >Hé d ð$¾Y¥ŠÒ匎>\-5á忾Sñó»%>] Ù:Î[>OÃD™Ÿ1þ¾[»­x*>[¡ôPöB¾OŸÊtµß¾ ¿~/2N>Rø²Ñëí2¾\ œ g4Ø>Y{óZع¾H° :‘¾7™FÐ7F>U­* ½ù¾\qÍòvºþ>Wh{WñYbvÜݾ\K®…²0×>Téâ÷ÈÛí¾3z﫬²¾JYg |óZ>Y½\þ£¾á¾[Ÿlý ¦>R6™fjʾ<9ðZ̾Pm½ÒÑ@ô>[ ¯usÍp¾Zq€×æ>MÅ©µãF>& bXľSYj`Ò¾Z>[Ö#ZOú!¾XÈ—äeô4>Fð›XÅ,>:QMɽŒ¾UâN†!&Þ>\TC#?b¾V°ÍÙx“>?†Ž¯Èª'>DZ2X}¾Xrº¤îr>[àNË2K]¾T4®"@f>0·¡_ôA³>K¾•§Ïô¾Yª½Ê¦¢&>[#N¶±+Š¾Q`f¹rÿ=ûíþ2rÍÔ>Pª]ØÃ|°¾ZÚw²¢Þ«>Yëôú¦L¦¾L‰!¶ÅÍ“¾*3ÝE;7¯>Sr'@±oi¾[ŽyüËoI>XBÿ‘76½¾Eß €¶C¾;˜iÉ(\K>UÜ¡ïÓ2,¾[Ĭ$ºôß>V/ÔuÄ7I¾=Á“Q–¾D¼dkm­>WÞyɾ²+¾[}8òžØæ>S¾£öBh¾.ÉþàJ²¾K=¼!Gá>Yq’À¿[¾Z½¯6¶„‘>PüøW˾½ìê Z“s¾Pœ¾øÒKù>Z‘ù‚¾¾YŠr \>Kì²+ì•>*÷ÏWd –¾SJàø'y>[:¬L¢AA¾Wé¹c³sú>Etg+ ^>;}ó¸ªwx¾U߃Ss»>[kì)ÙJÖ¾Uæ£ö¾=>=bqà·ìÅ>Dsùõa2¾WjÐO!º>[(Mä¾SŠ“c>.õfqRh>Jî1P÷¾Yä+¼>ZpTülr¼¾Pà¿ÄÖ„=÷+{¯žR>PHgº˜§5¾Z1•’˜¥L>YJ½†Ö…ʾKì?¦oÒ¾(ê´*jG³>R㟂ÅÒ ¾ZÛëµ—Ø>W¿0½A¥£¾E±ˆ‡ný¾: ¯põ>U+²Ôå(¾[Ì Êˆ>UÓæŽ ”<¾>T=€˜/a¾C‹$ËBÏÊ>WŽîD¹˜¾ZÝ;Þ ´>S“Š.lÁ¶¾0ìÄéÐû§¾I®ap•Ýa>X›²sv¾Z9F³ÜN0>Q ðë x­¾ !ĤJ¸¾O\ˆ3^Ì>Y»NøD|¾Y,Îeno´>LNõ¬MÏ>$76Ør¾R?Xœºy>Zp^ÖªZ«¾W¼ð}HÇN>FŠ<#Ñâ>7JîÙËCq¾T€]×:V>Zºv拘a¾UóGe`ñC>@Jcå®:ÿ>AþÝÍႾVkéýÑE±>Z›z9W§i¾S×cls„>3¯i,Ÿ >HHWˆ9¾Wúöb"'>Z¸@̺%¾Qr†pÊ >s¦ÏÕ•d>M›ŠÚÚe¾Y(D*õÉ>Y(;ö¬„á¾M¡Ýˆ¥¾«fÎTq>QYt[7ø[¾Yò›í3—>Wß«/¾GúÌ)8å¾3>9øân¯>S»p­œÙ¾ZXX: ci>V>â¯÷Ò¾Bç~!>¾?©}Õð>U‘0–ؾZX˜®">TLàÝqiT¾7²f2v ±¾E½7.Ë[>W/+‰GQ¾Y÷R1³8>Rº ‹Œ¾&I~Þ`Lt¾KHvÛ‹, >XsÒ4eäÛ¾Y6ÎW5>O@FåMM=÷s ¶žš¾P0¸xT±Ñ>YZ…èèŒ.¾X‘ÒÊ>º>IîнLM#>+Ôv9ÅŠ#¾RzÅ8CU¬>Y⦢™9`¾Vª~ïc>DNŒ“P4•>: ú¦¾T}\TK>Z ƒÛüå¾Tì`‘b|_><â‹ÏŠòï>BÛ™iÝz¾V1’Œ r>YØþ—'ï¾RæõrEÉ;>0Þ]È—T>H\Ž¨öª¾W‘Íþ¸ >YIñh’6I¾P¤Üì)P>²Ffçc>Mz”ÔTÛ¾XœÛT ±>Xd¬o’‡’¾L\`X¶%(¾KB‘èíp>Qˆ5ö]û¾YO´šÂv >W+õÈTº ¾G-\Ûg¾3.æZÄa>S'÷'ñŽ¾Y¨›ï^>U¦¸ãM­¾A’ð™Dž¾>§cN™¦y>Tõ·OÑqt¾Yª. í>SÜ©S`Þc¾7¾qBÕTß¾DÏ„/‰Z)>Vy Œ¿-÷¾YUç‡Ó>QÓ3ìR:¾(C^XT3ø¾I÷®wCÏz>W¬EÚ¸…¾X«7>ŸÄ>O&ØXDÿž½ßƒù¨ù¡¾Nºi弫!>Xúœ@¾W²dOq9í>JMþ#ä3>&nò͘¾Q‡ óÅ”­>Yâž:Û³¾Vnxeî¶î>E)xXu>6SímŒê&¾SrPOUO>YYÃDõë+¾Täã2âó>?›3}͸>@š¢_Æ” ¾Un¡˜¶>YCŠÇÖ³{¾SŒ0ÿ?r>4×ð«>EÈR -¦ã¾Vy8óÍÑ>XÞ1šO®¾Qùʯ*%>"%ù>J¥Ú(¢8¾W‚ñr»>X*JZRc¾MÑ•ƒ†Zƽû¢%­Í{>O!~ <¾XWmÒà,>W-p;e)g¾IÙ;#²O¾)ci;Ê¡>Q˜›øœs…¾XÓŸx+´{>Uìh <áñ¾D)³¼Úª¾7sÀÌß×>SfGE»Èp¾Y²ãn!>TjÅà«U ¾>Pòª³÷¾@éWÙún >TóŸ¤è$¾Xä£aNÏ>R¯oÒÕ•´¾3y Ýì¾¾EÖ•ÀZh>V=Úù¼±¾X}kK >PÁÔ?¾! ƒOYÀ¾JwßZÿr—>WCßñî‘˾WÎÈJGR£>MMŸx:¨×=ýªt0vQ¾N¿^¾¹¹²>XùD›Y¾VÛ=GJ >HÌõ š”þ>(ÀN> ¶b¾QP3“>Xxv‹ü‚¾U©9°ûî>DŠ‡wX=>6¦H‚/!‡¾S £C"m>X¨‡_Ïäz¾T;ôŒ<“>>Ru/$*Ú>@JrùÒ[²¾TŠkf•L=>X‘"è ¾R˜Y'¢ƒQ>4DЗA>Eª.'¾UËzµH3>X4ÿáX燾PÆùh¯>$7‡[±±>IwµÜäM¤¾VÍTüÃ>W—³F O ¾M”56ÞZå½±poC(ªå>MšÌþŽÚÓ¾WŽZŽA±>VºG˹æ¾IT ‚•V†¾$FvÒ†” >P°ÖAR¾X §=>U¡”©w§8¾DܬuÒŒ"¾3ú½fþ.>R`ÃY9î¾XHÛæ¯>TRÓÚ ¡å¾@9†ñ$eÕ¾=†‹;j`®>SÜýs4û¾XD‚ ™ÿ>RÐÀü'W›¾6ëï>£¹¾CUXÝ“¬>Uù7™¸Ð¾Wÿ…BÜp>Q!vel‹¾*bx¬4“¾G¦À‹3ã>V(˜ÈÓ²¾W}ýÿJ{V>N–Ïט"˜¾ Ê(®7“¾K±y]]`ù>Vö|Æxœà¾VÁŸ#ƒ‰¦>J¤p€hx> 9T±f¾Oj²e‹°»>W†ÞÙóʾUÌ¡÷q׊>Fy”®Ëù>.ó¨¶$o‰¾QdjQ_ó>WÚºáÒÐ{¾T¤¯*8R_>B#æ‘®a`>8¬=¨–y÷¾Rä n*’>Wó†x[¯2¾SLä乜Í>;Vú-’¡ú>@ÆV8z’¾T2[ˆÛ&n>WÐys‚ë ¾QÈ©cÊÑq>2< é`ص>Dÿ—€Ï(¾UJ‹t5°>Wt.ìNKü¾PµÜ)Þ@>"$µ3°G>Hú¿ÃÛÃE¾V-³U_üž>VáÚç袾L¥è¬jÝò½·MÃÝ¥³ð>L±”‚¾ï¾VÙóflI>V.Uáž]¾HÓÜN À¾"N‘Ø&dé>P yaÐõ¾WMÿ4m%>U!1þøw„¾DÓ(FïD¸¾2É/ÉȾ>Q–OÔ7YÙ¾WŒ_x’/>SûN‰«†g¾@®¼6À5½¾:¤YÕ>Rô¦Ò> U¾W“¼ÎG©>RªV@øD]¾8ÜYɾAw{º8>T#w¢ 0t¾Wepÿ³À¦>Q3=Göf ¾0?Êñf ¾EhIŠ,l>U")Z§ªø¾W¹ûtýì>O6jÞ½êX¾^ª}dÞ ¾I ¾ÕÕŸ¿>Uð–²°¯¾Vrµ±>KÉV‘sê=ðÚeËrß¾L˜Ý­,>VŒ;§Zí¾U°Ötmó>H*'ë­'3>#"~1Øu¾OÆ$ÿàUf>VõðNÝÕ ¾TÃÜ¥»o>Dcù5Ý€/>1é’ÝÃI¾QTò7µŸ>W.ýÎœ¿¾S­âMçŽ8>@{åͺºù>:8‰dÙ ¾Rž{kÕT\>W62£Âü¾Rq6v¦êo>8úUSN>@êÝóåÔÓ¾S¼ÿY€J>W ªŠ6ƒ¾Q_ 3u[>0än‡d>D£Þu^¤<¾T±$ $,>V·ãÊMa¾O. Ÿò÷f>! =YE>H*rߥ½¾Uyyƒš>V4ÇÑ2ã¾Kþêå œ=ä`“熎>Kt÷ZûÌ_¾V[dæiÙ>U‡hqD€¾H¢Uû-†Ï¾€ •Ö¢¹>N€ >þÕ¾VшR^u>T³9LE…¾E Ùˆ{Þ`¾.ȨŒ->P¤¿ŒpMO¾VÃÎã)d>S¸å3¨MK¾A‡¢—@.¾6íaöÅõÝ>Qä¼6Ur¾VØúíO>RœEÎHoi¾;” ŸJ>¾>T£˜o|>Rÿ…¬éy¾VÄ=Ó•>QaR,5K¾4 7ÎÁ¾B¸5f`>Sôì×½ª„¾V…çpú]n>P >ôé:¾(ä¤4®šû¾F†zÀÐ>TÂ:)û‰Ã¾V‰„«×>M0ƒw¨/¥¾sݦt¥N¾IGhÒ!m>UgíKRº‹¾U‘×å÷òú>J%EnŸ>P£>üt¾L@ˆ¸Ïd>UæÚe½Kî¾Tà쎰­[>Fó‹v¦•ö>$2v‚N‹¾NþÑOYËÒ>V=@ôØEP¾T ú&9¦>C£ô÷Xc>1\R ßJ¾P¾ÿh7ÅU>Vl‘þ=æù¾SS¦AèÐ>@?.ùTF>8k¬=àÓ„¾Qßa°n>Vvu “ò¾R ƒŒ ^[>91Õ:Ž¨>?@%é_P-¾RÞ‚O¤>VZÇuÁ¾Pß3V¶ÜZ>2‹žEÐï¦>BäÏv#¾Sº¨<Äuæ>Vb[Â?ϾO: ‘ ›r>'h¿B¦>EÿK»ï‰œ¾Tu;FL>U¶÷’jzð¾L‹{eáÃ>îØî¡ÿ>Hïâ%¦¾U ~1gH>U2p\ïàŒ¾I¶…ä¼¾衃5r>K­“ÔU ѾU¬ >TŽˆ´5E4¾FÄxìÓ¾"°M)p×>N8§ÚD{¾UÓ”€ü"u>SΎΕ7¾C¹NFð‡¾0ׇžá\>PGMÀ² =¾VFø´Ÿ>RñH…PÂξ@—åÎÕ;6Ÿ¾&!”>QU…‘(©¾V(ÒÊ*>Qû#?›¾:Ôj0uhß¾<òl6…ZÌ>RFÝæ™$J¾V¼˜ƒAb>PîÕ¤lA9¾4f®¾ú¾A…# …(>S¯>aܾUÏå¼€*">O™{vŽBó¾+Ú‰{\°¾Dn/ξ³>SѼ;”«i¾UáQ$äk>M0$mQ‡ë¾âõQ™¾G/.{™‡>TiÀø¤–¤¾Uçíu°j>J¨&€C¿½ðùÂà˾IÈòoT&%>TäÀ*z )¾TŒ…ÐÆ ß>HmC×>%¹Å1ý¾L7;—Ü–Æ>UA ¿#V¾Sê[žÁÆ·>EEeŸ6Á=>'îûœg¾Nuúè¼P•>Uøq¥ô?¾S0÷z̹€>Bwqy]K>1—h:øÁ‰¾PC™|:>U£ÛHxÁ¾Ra(‡À+—>?2¡[Ð>7„Ìñwd¾Q3ØlxD¢>U©H“`¾Q{Ç^)ô>9bR>MÙ>=<Œ«€%¾R Oò¶¨>U“Ám§8X¾P„‚M\ÍC>3‰û‘\6Ü>A^,nÌX0¾RÈz]¢å>UeZ°»¢¾Nø£òñLý>+T+ì'Y>D=I~Ó¾SmI}ò>UPgik»¾LÈ> DVB>:KÝcYƒ>FaºJYy¾S÷ÇaNì>T»pòT)¾JH4Üt¾>›Â>HÞVœ/¾TiñŽ‡ê‘>TD¨BsŒ%¾Hž˜W45¾ ãaßN›•>K$+G×ç¾TÃööÉ>S·m©£ÒܾE«w«o¾"Ãúøgïû>M)’J’L ¾UÀËL¡>S½„OMÚáÓ¾U+@ýrSµ>Rbö=s„˾@šãó‹ü¾4H;펳>Pkü”š¾UQ¡Ÿñ1¾<ß1Ìm¨¾9êFý@ñ>Q6ûMóìN¾U5žë°ˆe>PÈû‚:¾6Í Óƒœ{¾>Šæq+'>Qíö¸˜ÊÀ¾UîHè·>OËñ©ÇFô¾1üŸOQ´¾A²ìYg>Rå6„½+¾Té*”%$ñ>Mëb$¹Ðp¾(¥¼Ä¶B¾D0jÆ7L>SôníÖ¾T£VÜ›6þ>KôÓƒ_¾J6x°ª¾F8Ûkø2>S–3¬:ú¾TKIǶ1Ô>IêÚ‰DND½ÿ—Ê°¸‘ ¾HP*r³±²>SúÁóÁܾSá&?½ËÀ>GÎÙ*ãöî>öåât2¾JIJ‘œË>TJ'¨¯ï/¾Se ×é Õ>E¤¨¦¸-¶> :%…òbî¾L º5(:|>T…¯RºË¶¾RÙúœ^>CpðdfT>*l4Eâæ¾MÙkOÑà…>T®Á¸ A©¾R@ 9 ˆ%>A2žßÌmç>1É^ª(¿f¾Oq ±¦/>TĬCõî¾Q—·Žö¯>=Ü/PîÄl>6l2g<,á¾Pr®a7;>TÇ5=‚¤ ¾Pã¿£Á>9O<€Ôä>:éŽÞlnZ¾Q÷þ Ù]>T¹µ;ì1ȾP$rx}+†>4»ÃΆ‘>?BL]P¾Q¶x]?S'>Tšàh%¾N´eÄ™>0)·dÔFµ>A¶K_ä¾R>X,Ø?É>Tk2¿³÷¾MÎ`–ž6>'B(ü÷i>C´á1Xo¾R¶ŽEtƱ>T-‹üç•}¾`kÔ ©>`l„]½„Š¾Sž`"8¹•¾KGSB">V”G}¸¾`Ø>ü6>^‰a´²$¾LñJ’¢¾>Çß:l6[>Z”œ9Êi¾aÀƒ`U>[Y›T#Áw¾A✙DDi¾Jq«ÿfŠç>]ÄÑ®½Ù£¾`Úç„”>WeËÛ׃¸¾)©ç ülP¾RP ÚëÀâ>`ºÓ‰´i¾` Ž¡ËvÊ>RÏ?ïÅÎÚ>$Œ¿¿^=K¾VÖ Z¼>`·IÁŒË¾]â_л>KoQ¼O¢>@s‹X”a¾Zªò`Õ>`èÖ."÷¾Z­Œä÷?|>@Ž¸ ³n>K0ώ¾]²Ú¶ðþþ>`Ÿ$ëÄr6¾V¿»Ò½>%C‰wŽq>R‡žÙÏy¾_Þlý®^>_¼ÔÖQ ¾R5¯3΄¾'òLx š>Vç¨ zD®¾`Éógè>]YI£+'©¾JbrZ²E¾A†=â»>Z˜už½•¾`·ÆŽɧ>Z)>ÅÇó¾?n‰JLäæ¾KyÓùIiæ>]ƒeÕÀ¾`hüѶÅ>VGƒ»Øvƒ¾"ÒYltS“¾RŠø3¡%l>_—Ù€Zªã¾_Mnþ>QÏæû-÷>)c•XËÌò¾VËtþÝy>`cóÿo ¾\ï'úÅ>IÊkø‹ƒÂ>AˆA.¾Zaj'Vx>`‡äå ·¾YÌéoÃ;>>²ºêì¨ì>KTxm50í¾]8–Ú1&>`9åà!¾Uþf‡ÌF>"L$4å>R\*\D{¾_>ùm:\¯>^ôYÕ¾QŸSf9÷¾(êS„+>Vƒœ‡X9•¾`4>|©Å>\¤«†’B¾I¤€NH¹¾@ÂÄî8±`>Z~¡ÞÅÙ¾`Y`©»5¨>Y—ÒcGC¾>áÚ7¹–Y¾JÃ4­Õ„Ü>\ÓQ^ÔŠ¾`öŸêò·>UâÐû5ŽÐ¾#¥pdÆç¾Qûϧ/¿m>^ÔŒGD춾^°%„E'b>Q¢jÔ¢Ÿ>&• ¥ÉÁξVTñ#ö>`é±ñŽ¾\x†¹&èY>Iìé’„Ë>?ìEóì³¾Y‹ Èç Æ>`+Í„p/¾Y‡Ëxª¥S>?õ®¬%š‘>IÇ­´Øœ¾\Rõr± Û>_Ô‹ùˆf¾Uóy®ê>&Õb/_>Qk;·Ž¾^X‡:U>^€mˆÓ”Œ¾QÖêd È¾"p½zFzÊ>UuSd‚¾_’uÛ3`e>\hM¾ù˜A¾Jž.ñb…о=tÞð(>XëXÁQ¾_ûÝâ÷äÒ>Yš‚ E(ì¾@óg`w2€¾Haý˜Cÿ>[¶v›²Ç ¾_“¦%¡¢.>V-"„Ÿöô¾+ÌiÇ f¾P©Üì7ß>]ÈZ¢IÛ¾^aßJ(>R9Ú x„ >‡H†ÞžT®®}‚@T>_œçÖ˜M¾\p(‡hçL>K³ŽÄt˜‰>:!»È´v¾X&bío_Ã>_œ¤à¾Y̪[Ü>>BW#^Y_>F’¿D@\¾Zûê{!B>_Xƒ “’¾VAÇK’>1<Ïêlh>Op•Eâ-¾]"˜uÛq>^P&!•„¾RÇ3!´˜o¾ÉãÖ¿3x>S»»V’Qɾ^×ò´>\‹â<ûU¾M'îF¤„¾5òû Ì».>W:PœÜ¾_5—-už>ZRNÈ­¾D É·Mæ¾DYñƒÑž>Z ¥¢ (ò¾_ì<º"o>W\Ó¸¾5ctâüà¾M* q>\a4’ë5Û¾^Ez…B³>SzÜ0ÉŽÙ¾Qmê›Ü¾R™åuFü->]î1A‡¾\¶5P•Ð>Nñ¿T2D>0ëå)O¾V#wùw[…>^Â-ä/d¾Z}³«‚>FG#ÄXËò>A¸ƘçO¾Y Š¨-.:>^ÛßÕ ,¾WªÖU&—Æ>:PG^œË>J}h “!¾[€'7 ´>^;Ÿ5'¯ö¾TO×’£0>{•ªf6D>QFã´Ù¾]5ŠCX¹È>\é 7î¾P…?>;ä¾& îË€lƒ>Tß½Ì[[ó¾^;d[¹ôV>Zïãºá"¾HÂçŠ\ö‘¾=Xrç>Wö¹ÖX 9¾^Z#üR'>X\mlŸ¾?öãDľGejfʘß>Zy†bG¶à¾^+<â-zÒ>U@aŠäî¹¾+µ“n|îÕ¾O€€0 0*>\\þ· Û"¾][EPS >Q±ñ„ó#”>Ÿ„éhSœ¾SjÃVç`C>]™Û–v ®¾[hgÔ2ÓE>K‰¯T‰ÔÛ>6këÇÐß[¾V’Xz&M>^)`òmù¾Y¤ãqÜ>C$sB'6N>Cá Yò=оYGI/ϧ©>^ ?Ú7¤n¾VDØgp¹é>4Ð}>¿ÓD>Lõ„hú¾[]"Áð®6>]Fñ¼UÍx¾Rø6±ó>5q›º+o>QÀ_ •»U¾\Ô©fÅN'>[ÞF ­¾Nj{½Ý‚¾-V,ÈpÓï>UìÿB¾]§ŸE>YÝÍs¾F˜¤øúS¾?Þ?[žCž>Wã`¹Ñ˯¾]Ô®¡úøc>WT,6ãX«¾Z-è“#…n¾]^ u'0>TOXóŠT9¾&`kµG¾O¸·rž|á>[ãñ|z¾\G8èò÷Ý>PâéŽþà>t(GG¡Ê¾SI »{Uv>\ý%š¢uá¾Zšð>.y>JHcº];ª>7!TÇ:•ã¾VFûæîc>]y¹¥‡!F¾Xc‚(\o >BMƒúÊ,>CÃZAï +¾XÆË­Ï>]V>8:D¾U­úŽBÚT>4@ó9>Kw´¹}¾Z¼ÅO®>\˜AL5=¾RŒÿêÜ> ‹ u͉F>QDJ<½¾\ æµÓªe>[Eáâ^¾N#{‰;hÚ¾+ ôl*a›>Tk¢5kD)¾\ïI{€´G>YgLûòc¾F¥ý€œ¾=ä¾û¨-Q>W µŒ¾]$^ÒüÜi>Wà¹(œ¾=l­`Tt<¾FºùŒz>YVµq§â'¾\ËóT>T: lAu¦¾*W À-¾MýP*œ`>[n/¿Ù¾[ÐÊGxP>Q s ñj> º&VÄx´¾RK7΢g’>\)šÔ[û¾ZQ£ú6°T>K‰¨*n¯>3_1 /Þ ¾U2’t^>\ºî\&ƒw¾XRf»…ûŒ>C¢Uo¨'×>Aþ5į¾W©ÝnÚFN>\¼Ÿ³§¾UÞ!Mg>7¶§T0ƒ >Hé d ð$¾Y¥ŠÒ匎>\-5á忾Sñó»%>] Ù:Î[>OÃD™Ÿ1þ¾[»­x*>[¡ôPöB¾OŸÊtµß¾ ¿~/2N>Rø²Ñëí2¾\ œ g4Ø>Y{óZع¾H° :‘¾7™FÐ7F>U­* ½ù¾\qÍòvºþ>Wh{WñYbvÜݾ\K®…²0×>Téâ÷ÈÛí¾3z﫬²¾JYg |óZ>Y½\þ£¾á¾[Ÿlý ¦>R6™fjʾ<9ðZ̾Pm½ÒÑ@ô>[ ¯usÍp¾Zq€×æ>MÅ©µãF>& bXľSYj`Ò¾Z>[Ö#ZOú!¾XÈ—äeô4>Fð›XÅ,>:QMɽŒ¾UâN†!&Þ>\TC#?b¾V°ÍÙx“>?†Ž¯Èª'>DZ2X}¾Xrº¤îr>[àNË2K]¾T4®"@f>0·¡_ôA³>K¾•§Ïô¾Yª½Ê¦¢&>[#N¶±+Š¾Q`f¹rÿ=ûíþ2rÍÔ>Pª]ØÃ|°¾ZÚw²¢Þ«>Yëôú¦L¦¾L‰!¶ÅÍ“¾*3ÝE;7¯>Sr'@±oi¾[ŽyüËoI>XBÿ‘76½¾Eß €¶C¾;˜iÉ(\K>UÜ¡ïÓ2,¾[Ĭ$ºôß>V/ÔuÄ7I¾=Á“Q–¾D¼dkm­>WÞyɾ²+¾[}8òžØæ>S¾£öBh¾.ÉþàJ²¾K=¼!Gá>Yq’À¿[¾Z½¯6¶„‘>PüøW˾½ìê Z“s¾Pœ¾øÒKù>Z‘ù‚¾¾YŠr \>Kì²+ì•>*÷ÏWd –¾SJàø'y>[:¬L¢AA¾Wé¹c³sú>Etg+ ^>;}ó¸ªwx¾U߃Ss»>[kì)ÙJÖ¾Uæ£ö¾=>=bqà·ìÅ>Dsùõa2¾WjÐO!º>[(Mä¾SŠ“c>.õfqRh>Jî1P÷¾Yä+¼>ZpTülr¼¾Pà¿ÄÖ„=÷+{¯žR>PHgº˜§5¾Z1•’˜¥L>YJ½†Ö…ʾKì?¦oÒ¾(ê´*jG³>R㟂ÅÒ ¾ZÛëµ—Ø>W¿0½A¥£¾E±ˆ‡ný¾: ¯põ>U+²Ôå(¾[Ì Êˆ>UÓæŽ ”<¾>T=€˜/a¾C‹$ËBÏÊ>WŽîD¹˜¾ZÝ;Þ ´>S“Š.lÁ¶¾0ìÄéÐû§¾I®ap•Ýa>X›²sv¾Z9F³ÜN0>Q ðë x­¾ !ĤJ¸¾O\ˆ3^Ì>Y»NøD|¾Y,Îeno´>LNõ¬MÏ>$76Ør¾R?Xœºy>Zp^ÖªZ«¾W¼ð}HÇN>FŠ<#Ñâ>7JîÙËCq¾T€]×:V>Zºv拘a¾UóGe`ñC>@Jcå®:ÿ>AþÝÍႾVkéýÑE±>Z›z9W§i¾S×cls„>3¯i,Ÿ >HHWˆ9¾Wúöb"'>Z¸@̺%¾Qr†pÊ >s¦ÏÕ•d>M›ŠÚÚe¾Y(D*õÉ>Y(;ö¬„á¾M¡Ýˆ¥¾«fÎTq>QYt[7ø[¾Yò›í3—>Wß«/¾GúÌ)8å¾3>9øân¯>S»p­œÙ¾ZXX: ci>V>â¯÷Ò¾Bç~!>¾?©}Õð>U‘0–ؾZX˜®">TLàÝqiT¾7²f2v ±¾E½7.Ë[>W/+‰GQ¾Y÷R1³8>Rº ‹Œ¾&I~Þ`Lt¾KHvÛ‹, >XsÒ4eäÛ¾Y6ÎW5>O@FåMM=÷s ¶žš¾P0¸xT±Ñ>YZ…èèŒ.¾X‘ÒÊ>º>IîнLM#>+Ôv9ÅŠ#¾RzÅ8CU¬>Y⦢™9`¾Vª~ïc>DNŒ“P4•>: ú¦¾T}\TK>Z ƒÛüå¾Tì`‘b|_><â‹ÏŠòï>BÛ™iÝz¾V1’Œ r>YØþ—'ï¾RæõrEÉ;>0Þ]È—T>H\Ž¨öª¾W‘Íþ¸ >YIñh’6I¾P¤Üì)P>²Ffçc>Mz”ÔTÛ¾XœÛT ±>Xd¬o’‡’¾L\`X¶%(¾KB‘èíp>Qˆ5ö]û¾YO´šÂv >W+õÈTº ¾G-\Ûg¾3.æZÄa>S'÷'ñŽ¾Y¨›ï^>U¦¸ãM­¾A’ð™Dž¾>§cN™¦y>Tõ·OÑqt¾Yª. í>SÜ©S`Þc¾7¾qBÕTß¾DÏ„/‰Z)>Vy Œ¿-÷¾YUç‡Ó>QÓ3ìR:¾(C^XT3ø¾I÷®wCÏz>W¬EÚ¸…¾X«7>ŸÄ>O&ØXDÿž½ßƒù¨ù¡¾Nºi弫!>Xúœ@¾W²dOq9í>JMþ#ä3>&nò͘¾Q‡ óÅ”­>Yâž:Û³¾Vnxeî¶î>E)xXu>6SímŒê&¾SrPOUO>YYÃDõë+¾Täã2âó>?›3}͸>@š¢_Æ” ¾Un¡˜¶>YCŠÇÖ³{¾SŒ0ÿ?r>4×ð«>EÈR -¦ã¾Vy8óÍÑ>XÞ1šO®¾Qùʯ*%>"%ù>J¥Ú(¢8¾W‚ñr»>X*JZRc¾MÑ•ƒ†Zƽû¢%­Í{>O!~ <¾XWmÒà,>W-p;e)g¾IÙ;#²O¾)ci;Ê¡>Q˜›øœs…¾XÓŸx+´{>Uìh <áñ¾D)³¼Úª¾7sÀÌß×>SfGE»Èp¾Y²ãn!>TjÅà«U ¾>Pòª³÷¾@éWÙún >TóŸ¤è$¾Xä£aNÏ>R¯oÒÕ•´¾3y Ýì¾¾EÖ•ÀZh>V=Úù¼±¾X}kK >PÁÔ?¾! ƒOYÀ¾JwßZÿr—>WCßñî‘˾WÎÈJGR£>MMŸx:¨×=ýªt0vQ¾N¿^¾¹¹²>XùD›Y¾VÛ=GJ >HÌõ š”þ>(ÀN> ¶b¾QP3“>Xxv‹ü‚¾U©9°ûî>DŠ‡wX=>6¦H‚/!‡¾S £C"m>X¨‡_Ïäz¾T;ôŒ<“>>Ru/$*Ú>@JrùÒ[²¾TŠkf•L=>X‘"è ¾R˜Y'¢ƒQ>4DЗA>Eª.'¾UËzµH3>X4ÿáX燾PÆùh¯>$7‡[±±>IwµÜäM¤¾VÍTüÃ>W—³F O ¾M”56ÞZå½±poC(ªå>MšÌþŽÚÓ¾WŽZŽA±>VºG˹æ¾IT ‚•V†¾$FvÒ†” >P°ÖAR¾X §=>U¡”©w§8¾DܬuÒŒ"¾3ú½fþ.>R`ÃY9î¾XHÛæ¯>TRÓÚ ¡å¾@9†ñ$eÕ¾=†‹;j`®>SÜýs4û¾XD‚ ™ÿ>RÐÀü'W›¾6ëï>£¹¾CUXÝ“¬>Uù7™¸Ð¾Wÿ…BÜp>Q!vel‹¾*bx¬4“¾G¦À‹3ã>V(˜ÈÓ²¾W}ýÿJ{V>N–Ïט"˜¾ Ê(®7“¾K±y]]`ù>Vö|Æxœà¾VÁŸ#ƒ‰¦>J¤p€hx> 9T±f¾Oj²e‹°»>W†ÞÙóʾUÌ¡÷q׊>Fy”®Ëù>.ó¨¶$o‰¾QdjQ_ó>WÚºáÒÐ{¾T¤¯*8R_>B#æ‘®a`>8¬=¨–y÷¾Rä n*’>Wó†x[¯2¾SLä乜Í>;Vú-’¡ú>@ÆV8z’¾T2[ˆÛ&n>WÐys‚ë ¾QÈ©cÊÑq>2< é`ص>Dÿ—€Ï(¾UJ‹t5°>Wt.ìNKü¾PµÜ)Þ@>"$µ3°G>Hú¿ÃÛÃE¾V-³U_üž>VáÚç袾L¥è¬jÝò½·MÃÝ¥³ð>L±”‚¾ï¾VÙóflI>V.Uáž]¾HÓÜN À¾"N‘Ø&dé>P yaÐõ¾WMÿ4m%>U!1þøw„¾DÓ(FïD¸¾2É/ÉȾ>Q–OÔ7YÙ¾WŒ_x’/>SûN‰«†g¾@®¼6À5½¾:¤YÕ>Rô¦Ò> U¾W“¼ÎG©>RªV@øD]¾8ÜYɾAw{º8>T#w¢ 0t¾Wepÿ³À¦>Q3=Göf ¾0?Êñf ¾EhIŠ,l>U")Z§ªø¾W¹ûtýì>O6jÞ½êX¾^ª}dÞ ¾I ¾ÕÕŸ¿>Uð–²°¯¾Vrµ±>KÉV‘sê=ðÚeËrß¾L˜Ý­,>VŒ;§Zí¾U°Ötmó>H*'ë­'3>#"~1Øu¾OÆ$ÿàUf>VõðNÝÕ ¾TÃÜ¥»o>Dcù5Ý€/>1é’ÝÃI¾QTò7µŸ>W.ýÎœ¿¾S­âMçŽ8>@{åͺºù>:8‰dÙ ¾Rž{kÕT\>W62£Âü¾Rq6v¦êo>8úUSN>@êÝóåÔÓ¾S¼ÿY€J>W ªŠ6ƒ¾Q_ 3u[>0än‡d>D£Þu^¤<¾T±$ $,>V·ãÊMa¾O. Ÿò÷f>! =YE>H*rߥ½¾Uyyƒš>V4ÇÑ2ã¾Kþêå œ=ä`“熎>Kt÷ZûÌ_¾V[dæiÙ>U‡hqD€¾H¢Uû-†Ï¾€ •Ö¢¹>N€ >þÕ¾VшR^u>T³9LE…¾E Ùˆ{Þ`¾.ȨŒ->P¤¿ŒpMO¾VÃÎã)d>S¸å3¨MK¾A‡¢—@.¾6íaöÅõÝ>Qä¼6Ur¾VØúíO>RœEÎHoi¾;” ŸJ>¾>T£˜o|>Rÿ…¬éy¾VÄ=Ó•>QaR,5K¾4 7ÎÁ¾B¸5f`>Sôì×½ª„¾V…çpú]n>P >ôé:¾(ä¤4®šû¾F†zÀÐ>TÂ:)û‰Ã¾V‰„«×>M0ƒw¨/¥¾sݦt¥N¾IGhÒ!m>UgíKRº‹¾U‘×å÷òú>J%EnŸ>P£>üt¾L@ˆ¸Ïd>UæÚe½Kî¾Tà쎰­[>Fó‹v¦•ö>$2v‚N‹¾NþÑOYËÒ>V=@ôØEP¾T ú&9¦>C£ô÷Xc>1\R ßJ¾P¾ÿh7ÅU>Vl‘þ=æù¾SS¦AèÐ>@?.ùTF>8k¬=àÓ„¾Qßa°n>Vvu “ò¾R ƒŒ ^[>91Õ:Ž¨>?@%é_P-¾RÞ‚O¤>VZÇuÁ¾Pß3V¶ÜZ>2‹žEÐï¦>BäÏv#¾Sº¨<Äuæ>Vb[Â?ϾO: ‘ ›r>'h¿B¦>EÿK»ï‰œ¾Tu;FL>U¶÷’jzð¾L‹{eáÃ>îØî¡ÿ>Hïâ%¦¾U ~1gH>U2p\ïàŒ¾I¶…ä¼¾衃5r>K­“ÔU ѾU¬ >TŽˆ´5E4¾FÄxìÓ¾"°M)p×>N8§ÚD{¾UÓ”€ü"u>SΎΕ7¾C¹NFð‡¾0ׇžá\>PGMÀ² =¾VFø´Ÿ>RñH…PÂξ@—åÎÕ;6Ÿ¾&!”>QU…‘(©¾V(ÒÊ*>Qû#?›¾:Ôj0uhß¾<òl6…ZÌ>RFÝæ™$J¾V¼˜ƒAb>PîÕ¤lA9¾4f®¾ú¾A…# …(>S¯>aܾUÏå¼€*">O™{vŽBó¾+Ú‰{\°¾Dn/ξ³>SѼ;”«i¾UáQ$äk>M0$mQ‡ë¾âõQ™¾G/.{™‡>TiÀø¤–¤¾Uçíu°j>J¨&€C¿½ðùÂà˾IÈòoT&%>TäÀ*z )¾TŒ…ÐÆ ß>HmC×>%¹Å1ý¾L7;—Ü–Æ>UA ¿#V¾Sê[žÁÆ·>EEeŸ6Á=>'îûœg¾Nuúè¼P•>Uøq¥ô?¾S0÷z̹€>Bwqy]K>1—h:øÁ‰¾PC™|:>U£ÛHxÁ¾Ra(‡À+—>?2¡[Ð>7„Ìñwd¾Q3ØlxD¢>U©H“`¾Q{Ç^)ô>9bR>MÙ>=<Œ«€%¾R Oò¶¨>U“Ám§8X¾P„‚M\ÍC>3‰û‘\6Ü>A^,nÌX0¾RÈz]¢å>UeZ°»¢¾Nø£òñLý>+T+ì'Y>D=I~Ó¾SmI}ò>UPgik»¾LÈ> DVB>:KÝcYƒ>FaºJYy¾S÷ÇaNì>T»pòT)¾JH4Üt¾>›Â>HÞVœ/¾TiñŽ‡ê‘>TD¨BsŒ%¾Hž˜W45¾ ãaßN›•>K$+G×ç¾TÃööÉ>S·m©£ÒܾE«w«o¾"Ãúøgïû>M)’J’L ¾UÀËL¡>S½„OMÚáÓ¾U+@ýrSµ>Rbö=s„˾@šãó‹ü¾4H;펳>Pkü”š¾UQ¡Ÿñ1¾<ß1Ìm¨¾9êFý@ñ>Q6ûMóìN¾U5žë°ˆe>PÈû‚:¾6Í Óƒœ{¾>Šæq+'>Qíö¸˜ÊÀ¾UîHè·>OËñ©ÇFô¾1üŸOQ´¾A²ìYg>Rå6„½+¾Té*”%$ñ>Mëb$¹Ðp¾(¥¼Ä¶B¾D0jÆ7L>SôníÖ¾T£VÜ›6þ>KôÓƒ_¾J6x°ª¾F8Ûkø2>S–3¬:ú¾TKIǶ1Ô>IêÚ‰DND½ÿ—Ê°¸‘ ¾HP*r³±²>SúÁóÁܾSá&?½ËÀ>GÎÙ*ãöî>öåât2¾JIJ‘œË>TJ'¨¯ï/¾Se ×é Õ>E¤¨¦¸-¶> :%…òbî¾L º5(:|>T…¯RºË¶¾RÙúœ^>CpðdfT>*l4Eâæ¾MÙkOÑà…>T®Á¸ A©¾R@ 9 ˆ%>A2žßÌmç>1É^ª(¿f¾Oq ±¦/>TĬCõî¾Q—·Žö¯>=Ü/PîÄl>6l2g<,á¾Pr®a7;>TÇ5=‚¤ ¾Pã¿£Á>9O<€Ôä>:éŽÞlnZ¾Q÷þ Ù]>T¹µ;ì1ȾP$rx}+†>4»ÃΆ‘>?BL]P¾Q¶x]?S'>Tšàh%¾N´eÄ™>0)·dÔFµ>A¶K_ä¾R>X,Ø?É>Tk2¿³÷¾MÎ`–ž6>'B(ü÷i>C´á1Xo¾R¶ŽEtƱ>T-‹üç•}¾`kÔ ©>`l„]½„Š¾Sž`"8¹•¾KGSB">V”G}¸¾`Ø>ü6>^‰a´²$¾LñJ’¢¾>Çß:l6[>Z”œ9Êi¾aÀƒ`U>[Y›T#Áw¾A✙DDi¾Jq«ÿfŠç>]ÄÑ®½Ù£¾`Úç„”>WeËÛ׃¸¾)©ç ülP¾RP ÚëÀâ>`ºÓ‰´i¾` Ž¡ËvÊ>RÏ?ïÅÎÚ>$Œ¿¿^=K¾VÖ Z¼>`·IÁŒË¾]â_л>KoQ¼O¢>@s‹X”a¾Zªò`Õ>`èÖ."÷¾Z­Œä÷?|>@Ž¸ ³n>K0ώ¾]²Ú¶ðþþ>`Ÿ$ëÄr6¾V¿»Ò½>%C‰wŽq>R‡žÙÏy¾_Þlý®^>_¼ÔÖQ ¾R5¯3΄¾'òLx š>Vç¨ zD®¾`Éógè>]YI£+'©¾JbrZ²E¾A†=â»>Z˜už½•¾`·ÆŽɧ>Z)>ÅÇó¾?n‰JLäæ¾KyÓùIiæ>]ƒeÕÀ¾`hüѶÅ>VGƒ»Øvƒ¾"ÒYltS“¾RŠø3¡%l>_—Ù€Zªã¾_Mnþ>QÏæû-÷>)c•XËÌò¾VËtþÝy>`cóÿo ¾\ï'úÅ>IÊkø‹ƒÂ>AˆA.¾Zaj'Vx>`‡äå ·¾YÌéoÃ;>>²ºêì¨ì>KTxm50í¾]8–Ú1&>`9åà!¾Uþf‡ÌF>"L$4å>R\*\D{¾_>ùm:\¯>^ôYÕ¾QŸSf9÷¾(êS„+>Vƒœ‡X9•¾`4>|©Å>\¤«†’B¾I¤€NH¹¾@ÂÄî8±`>Z~¡ÞÅÙ¾`Y`©»5¨>Y—ÒcGC¾>áÚ7¹–Y¾JÃ4­Õ„Ü>\ÓQ^ÔŠ¾`öŸêò·>UâÐû5ŽÐ¾#¥pdÆç¾Qûϧ/¿m>^ÔŒGD춾^°%„E'b>Q¢jÔ¢Ÿ>&• ¥ÉÁξVTñ#ö>`é±ñŽ¾\x†¹&èY>Iìé’„Ë>?ìEóì³¾Y‹ Èç Æ>`+Í„p/¾Y‡Ëxª¥S>?õ®¬%š‘>IÇ­´Øœ¾\Rõr± Û>_Ô‹ùˆf¾Uóy®ê>&Õb/_>Qk;·Ž¾^X‡:U>^€mˆÓ”Œ¾QÖêd È¾"p½zFzÊ>UuSd‚¾_’uÛ3`e>\hM¾ù˜A¾Jž.ñb…о=tÞð(>XëXÁQ¾_ûÝâ÷äÒ>Yš‚ E(ì¾@óg`w2€¾Haý˜Cÿ>[¶v›²Ç ¾_“¦%¡¢.>V-"„Ÿöô¾+ÌiÇ f¾P©Üì7ß>]ÈZ¢IÛ¾^aßJ(>R9Ú x„ >‡H†ÞžT®®}‚@T>_œçÖ˜M¾\p(‡hçL>K³ŽÄt˜‰>:!»È´v¾X&bío_Ã>_œ¤à¾Y̪[Ü>>BW#^Y_>F’¿D@\¾Zûê{!B>_Xƒ “’¾VAÇK’>1<Ïêlh>Op•Eâ-¾]"˜uÛq>^P&!•„¾RÇ3!´˜o¾ÉãÖ¿3x>S»»V’Qɾ^×ò´>\‹â<ûU¾M'îF¤„¾5òû Ì».>W:PœÜ¾_5—-už>ZRNÈ­¾D É·Mæ¾DYñƒÑž>Z ¥¢ (ò¾_ì<º"o>W\Ó¸¾5ctâüà¾M* q>\a4’ë5Û¾^Ez…B³>SzÜ0ÉŽÙ¾Qmê›Ü¾R™åuFü->]î1A‡¾\¶5P•Ð>Nñ¿T2D>0ëå)O¾V#wùw[…>^Â-ä/d¾Z}³«‚>FG#ÄXËò>A¸ƘçO¾Y Š¨-.:>^ÛßÕ ,¾WªÖU&—Æ>:PG^œË>J}h “!¾[€'7 ´>^;Ÿ5'¯ö¾TO×’£0>{•ªf6D>QFã´Ù¾]5ŠCX¹È>\é 7î¾P…?>;ä¾& îË€lƒ>Tß½Ì[[ó¾^;d[¹ôV>Zïãºá"¾HÂçŠ\ö‘¾=Xrç>Wö¹ÖX 9¾^Z#üR'>X\mlŸ¾?öãDľGejfʘß>Zy†bG¶à¾^+<â-zÒ>U@aŠäî¹¾+µ“n|îÕ¾O€€0 0*>\\þ· Û"¾][EPS >Q±ñ„ó#”>Ÿ„éhSœ¾SjÃVç`C>]™Û–v ®¾[hgÔ2ÓE>K‰¯T‰ÔÛ>6këÇÐß[¾V’Xz&M>^)`òmù¾Y¤ãqÜ>C$sB'6N>Cá Yò=оYGI/ϧ©>^ ?Ú7¤n¾VDØgp¹é>4Ð}>¿ÓD>Lõ„hú¾[]"Áð®6>]Fñ¼UÍx¾Rø6±ó>5q›º+o>QÀ_ •»U¾\Ô©fÅN'>[ÞF ­¾Nj{½Ý‚¾-V,ÈpÓï>UìÿB¾]§ŸE>YÝÍs¾F˜¤øúS¾?Þ?[žCž>Wã`¹Ñ˯¾]Ô®¡úøc>WT,6ãX«¾Z-è“#…n¾]^ u'0>TOXóŠT9¾&`kµG¾O¸·rž|á>[ãñ|z¾\G8èò÷Ý>PâéŽþà>t(GG¡Ê¾SI »{Uv>\ý%š¢uá¾Zšð>.y>JHcº];ª>7!TÇ:•ã¾VFûæîc>]y¹¥‡!F¾Xc‚(\o >BMƒúÊ,>CÃZAï +¾XÆË­Ï>]V>8:D¾U­úŽBÚT>4@ó9>Kw´¹}¾Z¼ÅO®>\˜AL5=¾RŒÿêÜ> ‹ u͉F>QDJ<½¾\ æµÓªe>[Eáâ^¾N#{‰;hÚ¾+ ôl*a›>Tk¢5kD)¾\ïI{€´G>YgLûòc¾F¥ý€œ¾=ä¾û¨-Q>W µŒ¾]$^ÒüÜi>Wà¹(œ¾=l­`Tt<¾FºùŒz>YVµq§â'¾\ËóT>T: lAu¦¾*W À-¾MýP*œ`>[n/¿Ù¾[ÐÊGxP>Q s ñj> º&VÄx´¾RK7΢g’>\)šÔ[û¾ZQ£ú6°T>K‰¨*n¯>3_1 /Þ ¾U2’t^>\ºî\&ƒw¾XRf»…ûŒ>C¢Uo¨'×>Aþ5į¾W©ÝnÚFN>\¼Ÿ³§¾UÞ!Mg>7¶§T0ƒ >Hé d ð$¾Y¥ŠÒ匎>\-5á忾Sñó»%>] Ù:Î[>OÃD™Ÿ1þ¾[»­x*>[¡ôPöB¾OŸÊtµß¾ ¿~/2N>Rø²Ñëí2¾\ œ g4Ø>Y{óZع¾H° :‘¾7™FÐ7F>U­* ½ù¾\qÍòvºþ>Wh{WñYbvÜݾ\K®…²0×>Téâ÷ÈÛí¾3z﫬²¾JYg |óZ>Y½\þ£¾á¾[Ÿlý ¦>R6™fjʾ<9ðZ̾Pm½ÒÑ@ô>[ ¯usÍp¾Zq€×æ>MÅ©µãF>& bXľSYj`Ò¾Z>[Ö#ZOú!¾XÈ—äeô4>Fð›XÅ,>:QMɽŒ¾UâN†!&Þ>\TC#?b¾V°ÍÙx“>?†Ž¯Èª'>DZ2X}¾Xrº¤îr>[àNË2K]¾T4®"@f>0·¡_ôA³>K¾•§Ïô¾Yª½Ê¦¢&>[#N¶±+Š¾Q`f¹rÿ=ûíþ2rÍÔ>Pª]ØÃ|°¾ZÚw²¢Þ«>Yëôú¦L¦¾L‰!¶ÅÍ“¾*3ÝE;7¯>Sr'@±oi¾[ŽyüËoI>XBÿ‘76½¾Eß €¶C¾;˜iÉ(\K>UÜ¡ïÓ2,¾[Ĭ$ºôß>V/ÔuÄ7I¾=Á“Q–¾D¼dkm­>WÞyɾ²+¾[}8òžØæ>S¾£öBh¾.ÉþàJ²¾K=¼!Gá>Yq’À¿[¾Z½¯6¶„‘>PüøW˾½ìê Z“s¾Pœ¾øÒKù>Z‘ù‚¾¾YŠr \>Kì²+ì•>*÷ÏWd –¾SJàø'y>[:¬L¢AA¾Wé¹c³sú>Etg+ ^>;}ó¸ªwx¾U߃Ss»>[kì)ÙJÖ¾Uæ£ö¾=>=bqà·ìÅ>Dsùõa2¾WjÐO!º>[(Mä¾SŠ“c>.õfqRh>Jî1P÷¾Yä+¼>ZpTülr¼¾Pà¿ÄÖ„=÷+{¯žR>PHgº˜§5¾Z1•’˜¥L>YJ½†Ö…ʾKì?¦oÒ¾(ê´*jG³>R㟂ÅÒ ¾ZÛëµ—Ø>W¿0½A¥£¾E±ˆ‡ný¾: ¯põ>U+²Ôå(¾[Ì Êˆ>UÓæŽ ”<¾>T=€˜/a¾C‹$ËBÏÊ>WŽîD¹˜¾ZÝ;Þ ´>S“Š.lÁ¶¾0ìÄéÐû§¾I®ap•Ýa>X›²sv¾Z9F³ÜN0>Q ðë x­¾ !ĤJ¸¾O\ˆ3^Ì>Y»NøD|¾Y,Îeno´>LNõ¬MÏ>$76Ør¾R?Xœºy>Zp^ÖªZ«¾W¼ð}HÇN>FŠ<#Ñâ>7JîÙËCq¾T€]×:V>Zºv拘a¾UóGe`ñC>@Jcå®:ÿ>AþÝÍႾVkéýÑE±>Z›z9W§i¾S×cls„>3¯i,Ÿ >HHWˆ9¾Wúöb"'>Z¸@̺%¾Qr†pÊ >s¦ÏÕ•d>M›ŠÚÚe¾Y(D*õÉ>Y(;ö¬„á¾M¡Ýˆ¥¾«fÎTq>QYt[7ø[¾Yò›í3—>Wß«/¾GúÌ)8å¾3>9øân¯>S»p­œÙ¾ZXX: ci>V>â¯÷Ò¾Bç~!>¾?©}Õð>U‘0–ؾZX˜®">TLàÝqiT¾7²f2v ±¾E½7.Ë[>W/+‰GQ¾Y÷R1³8>Rº ‹Œ¾&I~Þ`Lt¾KHvÛ‹, >XsÒ4eäÛ¾Y6ÎW5>O@FåMM=÷s ¶žš¾P0¸xT±Ñ>YZ…èèŒ.¾X‘ÒÊ>º>IîнLM#>+Ôv9ÅŠ#¾RzÅ8CU¬>Y⦢™9`¾Vª~ïc>DNŒ“P4•>: ú¦¾T}\TK>Z ƒÛüå¾Tì`‘b|_><â‹ÏŠòï>BÛ™iÝz¾V1’Œ r>YØþ—'ï¾RæõrEÉ;>0Þ]È—T>H\Ž¨öª¾W‘Íþ¸ >YIñh’6I¾P¤Üì)P>²Ffçc>Mz”ÔTÛ¾XœÛT ±>Xd¬o’‡’¾L\`X¶%(¾KB‘èíp>Qˆ5ö]û¾YO´šÂv >W+õÈTº ¾G-\Ûg¾3.æZÄa>S'÷'ñŽ¾Y¨›ï^>U¦¸ãM­¾A’ð™Dž¾>§cN™¦y>Tõ·OÑqt¾Yª. í>SÜ©S`Þc¾7¾qBÕTß¾DÏ„/‰Z)>Vy Œ¿-÷¾YUç‡Ó>QÓ3ìR:¾(C^XT3ø¾I÷®wCÏz>W¬EÚ¸…¾X«7>ŸÄ>O&ØXDÿž½ßƒù¨ù¡¾Nºi弫!>Xúœ@¾W²dOq9í>JMþ#ä3>&nò͘¾Q‡ óÅ”­>Yâž:Û³¾Vnxeî¶î>E)xXu>6SímŒê&¾SrPOUO>YYÃDõë+¾Täã2âó>?›3}͸>@š¢_Æ” ¾Un¡˜¶>YCŠÇÖ³{¾SŒ0ÿ?r>4×ð«>EÈR -¦ã¾Vy8óÍÑ>XÞ1šO®¾Qùʯ*%>"%ù>J¥Ú(¢8¾W‚ñr»>X*JZRc¾MÑ•ƒ†Zƽû¢%­Í{>O!~ <¾XWmÒà,>W-p;e)g¾IÙ;#²O¾)ci;Ê¡>Q˜›øœs…¾XÓŸx+´{>Uìh <áñ¾D)³¼Úª¾7sÀÌß×>SfGE»Èp¾Y²ãn!>TjÅà«U ¾>Pòª³÷¾@éWÙún >TóŸ¤è$¾Xä£aNÏ>R¯oÒÕ•´¾3y Ýì¾¾EÖ•ÀZh>V=Úù¼±¾X}kK >PÁÔ?¾! ƒOYÀ¾JwßZÿr—>WCßñî‘˾WÎÈJGR£>MMŸx:¨×=ýªt0vQ¾N¿^¾¹¹²>XùD›Y¾VÛ=GJ >HÌõ š”þ>(ÀN> ¶b¾QP3“>Xxv‹ü‚¾U©9°ûî>DŠ‡wX=>6¦H‚/!‡¾S £C"m>X¨‡_Ïäz¾T;ôŒ<“>>Ru/$*Ú>@JrùÒ[²¾TŠkf•L=>X‘"è ¾R˜Y'¢ƒQ>4DЗA>Eª.'¾UËzµH3>X4ÿáX燾PÆùh¯>$7‡[±±>IwµÜäM¤¾VÍTüÃ>W—³F O ¾M”56ÞZå½±poC(ªå>MšÌþŽÚÓ¾WŽZŽA±>VºG˹æ¾IT ‚•V†¾$FvÒ†” >P°ÖAR¾X §=>U¡”©w§8¾DܬuÒŒ"¾3ú½fþ.>R`ÃY9î¾XHÛæ¯>TRÓÚ ¡å¾@9†ñ$eÕ¾=†‹;j`®>SÜýs4û¾XD‚ ™ÿ>RÐÀü'W›¾6ëï>£¹¾CUXÝ“¬>Uù7™¸Ð¾Wÿ…BÜp>Q!vel‹¾*bx¬4“¾G¦À‹3ã>V(˜ÈÓ²¾W}ýÿJ{V>N–Ïט"˜¾ Ê(®7“¾K±y]]`ù>Vö|Æxœà¾VÁŸ#ƒ‰¦>J¤p€hx> 9T±f¾Oj²e‹°»>W†ÞÙóʾUÌ¡÷q׊>Fy”®Ëù>.ó¨¶$o‰¾QdjQ_ó>WÚºáÒÐ{¾T¤¯*8R_>B#æ‘®a`>8¬=¨–y÷¾Rä n*’>Wó†x[¯2¾SLä乜Í>;Vú-’¡ú>@ÆV8z’¾T2[ˆÛ&n>WÐys‚ë ¾QÈ©cÊÑq>2< é`ص>Dÿ—€Ï(¾UJ‹t5°>Wt.ìNKü¾PµÜ)Þ@>"$µ3°G>Hú¿ÃÛÃE¾V-³U_üž>VáÚç袾L¥è¬jÝò½·MÃÝ¥³ð>L±”‚¾ï¾VÙóflI>V.Uáž]¾HÓÜN À¾"N‘Ø&dé>P yaÐõ¾WMÿ4m%>U!1þøw„¾DÓ(FïD¸¾2É/ÉȾ>Q–OÔ7YÙ¾WŒ_x’/>SûN‰«†g¾@®¼6À5½¾:¤YÕ>Rô¦Ò> U¾W“¼ÎG©>RªV@øD]¾8ÜYɾAw{º8>T#w¢ 0t¾Wepÿ³À¦>Q3=Göf ¾0?Êñf ¾EhIŠ,l>U")Z§ªø¾W¹ûtýì>O6jÞ½êX¾^ª}dÞ ¾I ¾ÕÕŸ¿>Uð–²°¯¾Vrµ±>KÉV‘sê=ðÚeËrß¾L˜Ý­,>VŒ;§Zí¾U°Ötmó>H*'ë­'3>#"~1Øu¾OÆ$ÿàUf>VõðNÝÕ ¾TÃÜ¥»o>Dcù5Ý€/>1é’ÝÃI¾QTò7µŸ>W.ýÎœ¿¾S­âMçŽ8>@{åͺºù>:8‰dÙ ¾Rž{kÕT\>W62£Âü¾Rq6v¦êo>8úUSN>@êÝóåÔÓ¾S¼ÿY€J>W ªŠ6ƒ¾Q_ 3u[>0än‡d>D£Þu^¤<¾T±$ $,>V·ãÊMa¾O. Ÿò÷f>! =YE>H*rߥ½¾Uyyƒš>V4ÇÑ2ã¾Kþêå œ=ä`“熎>Kt÷ZûÌ_¾V[dæiÙ>U‡hqD€¾H¢Uû-†Ï¾€ •Ö¢¹>N€ >þÕ¾VшR^u>T³9LE…¾E Ùˆ{Þ`¾.ȨŒ->P¤¿ŒpMO¾VÃÎã)d>S¸å3¨MK¾A‡¢—@.¾6íaöÅõÝ>Qä¼6Ur¾VØúíO>RœEÎHoi¾;” ŸJ>¾>T£˜o|>Rÿ…¬éy¾VÄ=Ó•>QaR,5K¾4 7ÎÁ¾B¸5f`>Sôì×½ª„¾V…çpú]n>P >ôé:¾(ä¤4®šû¾F†zÀÐ>TÂ:)û‰Ã¾V‰„«×>M0ƒw¨/¥¾sݦt¥N¾IGhÒ!m>UgíKRº‹¾U‘×å÷òú>J%EnŸ>P£>üt¾L@ˆ¸Ïd>UæÚe½Kî¾Tà쎰­[>Fó‹v¦•ö>$2v‚N‹¾NþÑOYËÒ>V=@ôØEP¾T ú&9¦>C£ô÷Xc>1\R ßJ¾P¾ÿh7ÅU>Vl‘þ=æù¾SS¦AèÐ>@?.ùTF>8k¬=àÓ„¾Qßa°n>Vvu “ò¾R ƒŒ ^[>91Õ:Ž¨>?@%é_P-¾RÞ‚O¤>VZÇuÁ¾Pß3V¶ÜZ>2‹žEÐï¦>BäÏv#¾Sº¨<Äuæ>Vb[Â?ϾO: ‘ ›r>'h¿B¦>EÿK»ï‰œ¾Tu;FL>U¶÷’jzð¾L‹{eáÃ>îØî¡ÿ>Hïâ%¦¾U ~1gH>U2p\ïàŒ¾I¶…ä¼¾衃5r>K­“ÔU ѾU¬ >TŽˆ´5E4¾FÄxìÓ¾"°M)p×>N8§ÚD{¾UÓ”€ü"u>SΎΕ7¾C¹NFð‡¾0ׇžá\>PGMÀ² =¾VFø´Ÿ>RñH…PÂξ@—åÎÕ;6Ÿ¾&!”>QU…‘(©¾V(ÒÊ*>Qû#?›¾:Ôj0uhß¾<òl6…ZÌ>RFÝæ™$J¾V¼˜ƒAb>PîÕ¤lA9¾4f®¾ú¾A…# …(>S¯>aܾUÏå¼€*">O™{vŽBó¾+Ú‰{\°¾Dn/ξ³>SѼ;”«i¾UáQ$äk>M0$mQ‡ë¾âõQ™¾G/.{™‡>TiÀø¤–¤¾Uçíu°j>J¨&€C¿½ðùÂà˾IÈòoT&%>TäÀ*z )¾TŒ…ÐÆ ß>HmC×>%¹Å1ý¾L7;—Ü–Æ>UA ¿#V¾Sê[žÁÆ·>EEeŸ6Á=>'îûœg¾Nuúè¼P•>Uøq¥ô?¾S0÷z̹€>Bwqy]K>1—h:øÁ‰¾PC™|:>U£ÛHxÁ¾Ra(‡À+—>?2¡[Ð>7„Ìñwd¾Q3ØlxD¢>U©H“`¾Q{Ç^)ô>9bR>MÙ>=<Œ«€%¾R Oò¶¨>U“Ám§8X¾P„‚M\ÍC>3‰û‘\6Ü>A^,nÌX0¾RÈz]¢å>UeZ°»¢¾Nø£òñLý>+T+ì'Y>D=I~Ó¾SmI}ò>UPgik»¾LÈ> DVB>:KÝcYƒ>FaºJYy¾S÷ÇaNì>T»pòT)¾JH4Üt¾>›Â>HÞVœ/¾TiñŽ‡ê‘>TD¨BsŒ%¾Hž˜W45¾ ãaßN›•>K$+G×ç¾TÃööÉ>S·m©£ÒܾE«w«o¾"Ãúøgïû>M)’J’L ¾UÀËL¡>S½„OMÚáÓ¾U+@ýrSµ>Rbö=s„˾@šãó‹ü¾4H;펳>Pkü”š¾UQ¡Ÿñ1¾<ß1Ìm¨¾9êFý@ñ>Q6ûMóìN¾U5žë°ˆe>PÈû‚:¾6Í Óƒœ{¾>Šæq+'>Qíö¸˜ÊÀ¾UîHè·>OËñ©ÇFô¾1üŸOQ´¾A²ìYg>Rå6„½+¾Té*”%$ñ>Mëb$¹Ðp¾(¥¼Ä¶B¾D0jÆ7L>SôníÖ¾T£VÜ›6þ>KôÓƒ_¾J6x°ª¾F8Ûkø2>S–3¬:ú¾TKIǶ1Ô>IêÚ‰DND½ÿ—Ê°¸‘ ¾HP*r³±²>SúÁóÁܾSá&?½ËÀ>GÎÙ*ãöî>öåât2¾JIJ‘œË>TJ'¨¯ï/¾Se ×é Õ>E¤¨¦¸-¶> :%…òbî¾L º5(:|>T…¯RºË¶¾RÙúœ^>CpðdfT>*l4Eâæ¾MÙkOÑà…>T®Á¸ A©¾R@ 9 ˆ%>A2žßÌmç>1É^ª(¿f¾Oq ±¦/>TĬCõî¾Q—·Žö¯>=Ü/PîÄl>6l2g<,á¾Pr®a7;>TÇ5=‚¤ ¾Pã¿£Á>9O<€Ôä>:éŽÞlnZ¾Q÷þ Ù]>T¹µ;ì1ȾP$rx}+†>4»ÃΆ‘>?BL]P¾Q¶x]?S'>Tšàh%¾N´eÄ™>0)·dÔFµ>A¶K_ä¾R>X,Ø?É>Tk2¿³÷¾MÎ`–ž6>'B(ü÷i>C´á1Xo¾R¶ŽEtƱ>T-‹üç•}¾KYµb¡µ>y„ça9ý>E܉éI¾Sq‰“ì£>SàŠRY•¾I”õÐ Ÿ >GÁŠ×™Ë>GlÉ‘õÎ’¾Su_Ê>w>S…ê}Ô¾GÆdçTj½û‚ó»:$®>I"àjê¾S½‚…µþ0>SpBÛˆ¾Eî-Üv m¾$¼‘™ˆ->JÁsò¯H¾SöVµÑ›ô>R¬'6õ;D wôšq¾$†ö «Ô7>LD‹„B·¾Tdw¤Åq>R-ÚIâe·¾B&Ð[¸BU¾,Á游ÅÛ>M­ÈU]¾¾T:õRH×É>Q¦K í|ý¾@=8Û&­v¾2fn…±¾­>Nþì«Ó̾TH¬2ýz>QC’§=¾<Ÿ"×B2¼¾6N4m.éb>P(<96º¾TH(-x>PzMhWô¾8Æ.@?Š¾:áÏÎË5>P§ûÜßc¾T;Çwä>O²¼(‘K§¾4ïQ)÷‰º‚¾T#B´ ô>>Na‰óCg§¾1rÔ?R¾@ŸN˜– >Qžxq“ì¾SþN%[_ç>Mb®é2©¾*œõíw¾BN ªY>R¡~ô^¾SÏS%üK>Kž—‘W1¾#.Œ‡††¾CìD„ vÆ>Rc’B^-¾S– áœ[>J.+Mø.¿¾Xm„ ¾EwÜmå%`>R³ÇxüÔ¾SRA*xàñ>H¶SïEqܾû“F›¾FîÎ&Ñû>Rø„:%"¾SP$¹à>G:4+Fj=öRI–Ÿc¾HTgßXÈ›>S2øé7Ö¾R² Š*ö>E·¶~õ™>¯™B¼¼”¾I¦æEb‚>SaÆÒ¹¸g¾RUè¬,V>D1Ρ¼Yç> ¶˜ÈMö.¾Jät±#>S†1È‹ ¾QñÿT’U>B«„w‘þ>'jýÇ—¾ñ¾L¿”Î>S¡Šx™€¾Qˆ\ m*5>A"qD ˆ>-ù„qÉl¾M*ÍåÖ>S²n)—Á¾Q÷xfx¯>?2üÎjZ>2(ðvŸ«­¾N.ózá¥>Sº;ÑÏŒB¾P£-p£><&Ð š£X>5<›¼¼ýľO#*óE>Sº?“]¬-¾P)¬=\G0>9Iúœ® >8:‹BÌK¾P¤Gp—©>S±13Uy¾OV?|yÝ>6®8p>;ÎE=(¾Piò`ñBÏ>S `•NFs¾NS»w€§>3+pàU>=á5Ù‹ „¾PÉ{“<–>S‰&t¦x¾MKÀ]Q>0&bôss>@H!m£ˆ¾Q ›‘(ê›>Sj:„(ù¾L;ia ¹³>*wþÆAì>AG ^Ç`¾Qn­ î#s>SD諾K)^º>$ÁüœGg>BÊé÷ûш¾QµµUû?">S’§Mø¥¾J Y^!>=Á´ÌP>Cù¸°‡Á¾Qõa™fm>RéßG|ξHú–l¦.C>/‚Ћ Ì>E@ÜG1é¾R,M¢Dp>R´%=€wë¾GáRù…”>Öa¸ô ˜>F+OûK“¾R]R’þn1>Rz³ú%ȶ¾FÇR2õ¤½áB»<¬>G1ÏdͲ¾R‡™‚›& >R<0ýý£¾E«ÅEú;¾ó„[G»o>H)aà ‘¸¾RªöjKŠ>Qùîqo¡¾D’8)N­é¾x¿¨úP%>Iü vľRÈI7Z±(>Qµ-oœ ¾CzFž{ÚǾ z?ëx>Ió£<[O'¾Rà7U¸<>Ql•ª‚ϾBbŒRÖŸ%¾$Þ¡JÒDm>JÅX/:*¾RñÅyÖÓ(>Q!b.H(;AO$ Õ—ò¾)qæPü‡Y>KŠMáÌÍ ¾Rÿ hQv¸>PÔÓM;§¾@>Ͷ$¾-æ†9ÆÂ>LEc·U¶L¾Sv £=ì>P…ŒXÊO¾>`­y<÷ß¾1Í°×y>Ló?"i¦Â¾S y¶^¬~>P4²/«ºÖ¾M•ç¨l„l¾S ¶Î%>OÆûªšþ¾:FÜàšFP¾5-=s΂ >N/p Z¤î¾SÏWÒ¨¬>O!¶Ré¾8D¡Æï¾7nâ›ZÃ>N¼¿É4¾Rý韌>NyÓÓ´~¾6PRÝìÃʾ8ó]eªž>O@€1¾RñËÚ Ø>MÓ¬Šq«¾4fý.C{¾:»RiñdÓ>O»QÄ]k'¾Rã| Èè—>M+¨.é‰2¾2…àvоPÊ ¾€C¾RÑŽe,‹H>L„ âD¾0´RŸ£d¾>ó¿Ý´>PIz+ú-d¾R¾á<êÏ>KÞêÓëîi¾-Þ†^?D¾? -8J·¦>PyÁöê G¾R¨6!Y„>K9k×®¼¾*g±µÛˆš¾@&%fÕ7>P¥'a_½1¾R•fοm>J•œµç]¾'9êýµ¾ACè#è>PÌ®Pm’¨¾RvæÇ}ä>Iõž&*×¾#×ú(Òñi¾AðØpÔú>Pñh» „¾R[¤$G§>IVeÆ%m¿¾ ²°”[C¾B•‡šÍ>QÍü HľR=ö^9ü$>Hº€âŒ²¾`Â5¾Þé¾C0ä* >Q.íƒ5¯Ö¾R ªÊNú|>H"ƒ‹ g¾• à^H¾CÃõ.`Ü>QIÒ}4rj¾R…\nH>GŒ½ % ¾ëšB°¾DOÆxâö‹>Q`õ­K6è¾Qâä¶ÞÉP>Fú»GJŒt¾;†$6þDÒí‘m>QuZ#Žf¾Qì-òhñ>Fni(/G$½õÿýG4!¾EN1éËî>Qˆ &E穾Q¤3Y@à~>E䩹ȽÁðø­1›¾EÂÝHNW>Q—ƒlþ1¾QƒÊ2Jè>E_a¬uŽ=ðc|4E¾F.‹×1·[>Q¤½¼ãJp¾QdLP#ž>Dàs%û> •½SÕ¾F”ÆÁ·f>Q°ÃfÒ‡í¾QEŽpÜ6>Ddªš ÙW> ö¦V4¾Fô2>Qº©˜Ú¾Q%LÐ çá>CíðZøÊ>¿$ ”¾GJæd¦/|>QÁyÜv|Ù¾Qì™^2>C~kèÞE>|ºÒz³¾GœÜÓÁ‚³>QÈ*lû ¾Pé/ƒdcÆ>CÔä(€'> ÿ‚ÇÞǾGèj s‘Ò>QÌ}3©Yê¾PË`—˜C8>B«Æþô»>W ¶ Zµ¾H,œ@’ù>QÏr'£š¾P¯A;k&+>BKvú&>gäÆ1I¾HkjŸ‹†>QÑñˆN¼á¾P”ÈÈÛ>Aïç1ïž> ¥ý Ù ¾H¤×´ˆ®>QÒvÚ5¥q¾Py3²\8>AšÇNð>!ôùÕ ¡¾HÖÜí>QÑêæÍ)€¾P`Gjbå‘>AK·/èð>#'£7þǾIýö«>QÑA–?h>$DénÀ,)¾I-©)qZË>QÎ֥⨾P1TÂŒ-‹>@½cx—N9>%?p¾€ç‰¾IOL‘|×X>QË¡ib ¾PM³üÊP>@€è)å*º>&=ahg¾ImqN_N>QÈŒdnŠ¾P±ér>@HÁõ(>&è(wöˆÖ¾I†‚ çj>QÃöœFP¾OëpcëèI>@­{P>'!Ó"ÓľI˜çRp£.>Q¾Ãkµ®Û¾OÊ(D`y!>?سd¢³>(µÖ/g±¾I¨PY²\>Q¹ØôMf¾O«üÜÍ¡/>?ŒßPë>(•#BXÎj¾I²j§àÂ>Q³“zy2¾OGd*~.>?MLyü˜>(ëç)¾I¶[2×ù>Q¬Ð‡Q5¾OwiÖŸ¼>?7sש>)'ßRßÿ®¾I·3ž¢:>Q¦ožC ¾ObÍKàÌÇ>>öúÒž±>)OæuNÞì¾I³x">QžÌÕ@ž}¾OO¹÷ Èç>>ÛÖlâ>)VçZ¾I©l3BÑ}>Q–¹cŽ s¾OAŠ•J›Ñ>>Ï›K2¿”>)Cv2“p"¾IœsL¹Ô™>Q 3e ¾O6˜=[Ój>>ÌïM&ú4>)^µ·ò¿¾IŠæ5×>Q†%}㜾O-4Gc‹>>Ö5“[¬h>(Ô‘d¹é¾IsÁêÿ„>Q|ÊV¤n¶¾O(œÆœ>>îÐÍ[x7>(r¬—¾QsÐoúÿܾO'× Áå>?øôÜðº>'ý4Nä.{¾I9®"u>QiŠÖ(E§¾O'²uƒž>?<ùyþ^[>'gV©+"¾IˆO€$Ã>Q^éof-¾O+–ã>?xÙzl&>&·$C~ǾHêè¦HŽ>QTBôîO3µñÌÛ>?½òq:N>%ôOk›¦¾H½™À5‰v>QHVÒÂ[~¾O;œ*0² >@KÖXöÿ>%ãßI$.¾H‰Ý©€(°>Q;IJ”ýh¾OHƒGÓÞï>@5W—µòâ>$¤lCà¾HRð÷à°(>Q/O–céB¾OWì·³FP>@hJÞxº># àõ«¾HÆx²e>Q!G˜…ü¾Oh%ÛD ¨>@ «Ò° :>!Ò[fFõ¾GÔ–ÂZ=~>Q`¢Iud¾O|=ïù´[>@à Ç.²5> ‡íÓµ¾GŽ£µ¸Tâ>Q`®dH¾O’g.êýˆ>A"ü`„WÆ>Tdxó¾GC}KóÂ2>PòŒ¡ú°?¾O¨Ô¥mñ>Ak ·l§‹>YüJ—ö¾FñhA#ËÑ>Pà›Œï¾O–’ýq>A¹¼îöð>*qÉ€± ¾F›Ž9LÎ>PÎGMCë¾OÝÒ‡Îã>B ™]/§>ÕâwÌpu¾F@!o²q%>P¹Í>è-¾Oø¶#õs>Bb-Tl€4>AQùpÞ7¾EÝmø>`8>P£êèyêǾP Ý“pØ>B¾æ«˜j> óý![ü¾Ev˜Jxû‚>PO›lÚ ¾PCû\>CR÷œÓ™>ß=}è¾E ÕÖ'Ì>Pt5WiÞ¾P(ÚWx’>Cã ]}p=õ‡Êd¼íƒ¾D•YÙ(Ÿ>PYNŒ l"¾P8^WžM¤>Cë ­å=ÐHérî\¾D[kú9_>P=LÝŒzÿ¾PG΃Ñ{¥>DVD+39µ½ëê[q`¾CœÿCb .>Ph☺‘¾PV@‘²A'>DÄúÑ|>‚¾yì)S"¾C”#ëiz>Oú›/¿¬¾Pe"A¢U>E8aØ*’¾ YYξB‰)Ÿ‚_€>OµM”¸ ¾Psz³«|æ>E­{Ãç¾>ÿõ½i¾Aö >>Ìà>OiZ›’¾P€GŹ9Ÿ>F%Ù½mó¾ŒÐ‚?P©¾AZu¥ô2m>O¦>¥¦¾PŒù·!ÌÁ>F ³rÃöv¾©Šf¾@¹hOb>NÂÄÿ´¾P˜‘^RÓ>Gº`J²õ¾!RiØ}ú¾@~­Éòh>NeãPŒÏˆ¾P¢ Rõß >Gšr²u’ã¾$< èÌèå¾>ÁZU¼O>N¸8õb¥¾PªÈá¿Ï>H a2{¾':úßÜ&¾=TW{à ¬>Mš†ÌÁv¾P±ÇÜs>H›*Éw®²¾*GòN² ¾;Ø¢#2šG>M)Ó^ŠÅ?¾P¶„퉭>Iº€!Þý¾-n¨º¬¾:Jßfo›à>L±Ô8ÆB¾P¸×kÐ}>Ižbt‘¾0TÍx¾8±XnÓ>,>L3ÞŒ´CG¾P¹8«ŸbÐ>J[çvPi¾1öIÚÿí¾7ÆS¿N£>K¬iø¾Ãì¾P¶&<àæ>JæD³¹(¾3£Îx*–.¾5Mõÿ(’>KÀp¼ \¾P°ìMÃii>K·-c,¿¾5Xì¾4àѾ3‡Vg¨³Ü>J†"ÒkÔj¾P¨‚[u1Y>Kšg¾7ÁÎf>÷¾1±®W ó>Iå!wEÙ‹¾P›ÞÚÐ&é>L䆽¾8Óݵõ—s¾/”r…f>I;2Ü… ¾PŒNèͤY>LŒÄA“¾:›Q¾¹‹<¾+­¡Ð0@ >H‰$ýó)•¾PxÉÊÏå0>ML4OZÒ¾GÌ X6¾P`?}²ö>Mo®tˆ*è¾>3qOWpü¾#„Ĕ¤>G6V`¾PDï¡TV>MÛâ×H¦(¾@­QÙ¾’#X1>F5»Á¤cʾP"üø•ju>NA6Âо@ê¿J|q¾åö‚>EZʸ…U¾OøXºåm>N QðÒ¾AÔÙíÆʾ ôؼ«>DtÙ¢„=¾O¡²c™¨G>Nùä;Tà4¾B½âç¹ß½ïMn¶>C†BcÇß¾O?øò0”>OJ”Ó@½¾C¤…læ9™=õT82y:ž>B‹w‡Õ×¾NÑ€ÿ»+>O“I»£¾DŠîÑ6‡> —FÉFuš>A…û) ÞܾNW±„ôj®>OÔ’…B¾EnÔ¾õ>]2àù˜—>@w[?&\ݾMÑÉ™ì…8>P嘮£¾FMÚ\šè>! _ —†>>¹ÝÿV¾M=Seué>P†\ZSµ¾G*ZÒÓ}Y>%ùý­M`0>P+J ?¾HùäKg>*ñÅžáêÀ>:mƒA¾Kîâlñ¶">P5>gˆ’¾HÒ7;ºO>/ô#{ÏO>7œî"é+ƾK1MŠX>>P8Ñèèb¾I_MÛUB>2‚µúÆ}>5p (Û¾JfRà6ùb>P6_Î;øš¾J`â¾–\>5 ‘È­}>2{yíd\¾IŒÑÀ4>P+ûq ùÕ¾KJ¬LøÎ>7“JÕúì2>/™%°dðþH¢ÄO*G>PçêcоKË®6\–>:S.¢Æs>*r¯t&¾G«$ù\«U>P{ ±¬¾Lr~«Äý=><£x?”š>$z cä¾F¤.KÞšž>O½ãÉ꥜¾M *(ª~Ž>?$Ð&‹á>m`Ý3*G¾EŒYEjkš>Oh’•]y¾Mš¿° x>@Ðpø³ Ö>¬¼¬åü¾Dfµo Ü¿>OG‚P¾N—ïÌÙm>BÜDä›Ó=÷PA Ch¾C1ÎqdOÄ>N‰oÆÔ™º¾NŒHš¤p>C;¨Ð´ö½ù|Aôžµ¾Aì>7ƒ Ö>MüéaøŠu¾NîU/~„">Di.®~ʇ¾©H'P¾@™Y¡w¢ù>M^mÓ{'¾O?¢5ZÑô>E SYǼ¾¿ c)¾>oоÑ]>Lªr´Ê¼ê¾O}eö¯¼‘>F§¾­£Ÿî¾%Â×ð"þ»¾;G™»7>Kâ5‚ z¾O©¬eðp>G¹%]hæl¾, ¯C£ô¾8“4MT>KÚ%-7«¾OÁä¦Óâ>H½,QÑ‘¾1&'?ÛÈœ¾5~ɹ9>Jñ Ö¾OÄÞ·>I³fx|Fi¾4Hÿ"G0æ¾2NµÐÁ;>Igb°þ¾O°°‚Ä«>Jœr%lŒ¾7gu“ ê¾.€"v¬l>Gô3ÓÓµ¾O†òíGÔ„>Ks ÎZ'x¾:{“À¥‰Ü¾'cdñ©ˆ>FÃ~œ>Œ7¾OCóæxÓ >L9S¿£¾=ˆYäc¸ú¾ …Qˆ ²>E}ùçÃÓ¾Néê*¼3k>Lì±gpjà¾@CÔÕO.¾ú¼°û>D%sšÂN¾Nv ¶µ«>MŠ' t ,¾A¹x„³ŽY½ó´CÔ©Ý>B·gl—¾¾Mçòž}»>NmÝϾC&sÂ!øÀ>î›ýö>A5»&hÀZ¾M@gªN3¦>N‚³Fð/Jì{>?Eico¾L~JÅÉÅ>NÙ†M.Q/¾EÙ^ ¦->#>xñºË‰>;ø3ÑüꎾKŸ^vµ>Oµ¾uU¾GnGXpÓ>*ú޺ɖ>8ˆËjä¡F¾J¦3onH>O8ƒ9®¡¾HN7Fãf\>0éjA¼>4üŠ½wç¾I’ ’Ôè>O<¶ß“Êø¾IjÝcÒ•>4…®)—TŸ>1OÀC†ì¾Ha%ÊF©p>O#Ë¥·÷¾JsÂa9>8©[tób>+áü¾G͈ÙŸ>NìAŸYؾKdÄ29H>;çö¸ËÌ>#Z7ÍIR^¾E±ë Põ>N“ÀJº_6¾L;˜˜cm>? @„#>ë ñ“±§¾D1š>ý±¿>NÜôÜ’4¾L÷¢´ë>A4±?a`=û‡²l'þ´¾B™­‚´¼Â>M‚X.¬ ×¾M—µoz½>BÒˆà¼XN¾”œ{±L€¾@éž©2Ì>LÆ¢á:3¾NÂÚŒ¬>D_œ5óÔã¾ 9ÐÌZ¾>B9ÞÜ~§>Kèý7påó¾Nv yQ»ë>EÚñ¤<š_¾%§Ÿ'Õ¾:‰ŒVo>JêÃGzt;N³Ìòiw>G? oÁ×¾-%)ñW˾6¨8Y­\>IÉDxqB¾NÌ[M•ï¸>HŠÕñ˜X¾2 Røø½‰¾2 rqœ>H…¶‰qº¾NÁtËû>È>I½Sëê2–¾6 ¶®-v¾,õf.á d>G"¾à”Þˆ¾NZnKÍs>JÑ›Î=¾:ŠñÍØšl¾$s‰‚>Eæ,60d¾N6‹ Y·!>KÄþâd••¾>_iží{¾|*g€¯Ç>Cù·µ?-€¾M¶@«é 8>L˜h€Þí¾A ù·Œs“½÷_r|–w>B9™ 9m¾M a˜ø>MEõùGÛ¾BÐ)na 2>õÖKéG>@ZJ>‘Ä%¾L:çF/%>MÍ „lª½¾DÙžN¢È>ïúã#›•><ÁØ(ÉpX¾K?Eÿä,æ>N-_\oú¾Fn°%>'êšœ…½>8 ûT=¬¾J¡¾º½’>Nag ß ¾G•,ÊUá/>0fÏ]­œg>4P¾cí9ɾHÎ,»Š 7>NiÄÙÔ¾Hñè¾ô•á>4Ìe˜ [4>/³Ï*Ù¾GZœ%öÄ[>NFH`V.¾J,†4—‘>9¾ð±>&ˆK›ué&¾EÀ›~Ã>MòÙ¶'ô¾K?+dk+)>=G5Ü–Mk>DCnÛƒ¾D"‡\ÎI>Mpý¸£ê¾L+;Wùm>@©‡<~Ê/=ü£À˜)¾Bñ%Ó>L¾ì®ñ¤Ø¾LìC:ï>B—9-KÜ'”Lju¾M}ÄÇnÉ>Dj:>¡ôŽ¾vÈ™¹=Á¾;î¶_;>JÉmï@4f¾MàÒw7Q>F  ’FY¾)c1z¾7s§ÂE²S>Iˆ±šÖK¾NÅèñh>G±ÚŠ•Zc¾1u¾w ¾2Ç•¥RIw>HàíξN _2:j=>IS¯;u¾6'kŠ€ a¾+Ý›„__">Fy×âÏ*¾MÕ˜É(|>J`1øz<¢¾:ºBnäY.¾!íƦ(Sc>D±ÄÞ÷ïW¾Mfs×/´9>KtôÁX–¾?!ÕöèÚ¾+þ§¿d>B¾áёﺾL¿Hb~ã>LVíCS“¾A­>åÊ`=óú*ÐØ/Æ>@¥IŽ Q¾KâJ­'B>Mjˆšg¾C«àV=°>¡ë Q¥><Ó=.Ô‡¾JÎ65-FÂ>M£QgÞ¾E†}‰>Ù>'V)”>8¬VâœF¾I‚C ¹Ç>M¾Är‹¾G;kŒö*>0¨õm£U‡>3%èhÞð¾H—>±÷>MÄ4ÄŽ4%¾HÄ¡åûŒç>5¨#~Ïí>, kÚ?á¾FO€2”|#>M‹pßTzx¾J;î`Ki>:ƒ_SBW>!}ëÜE¾DiÄŠxg~>MΟь¾KA_³>?2<:P­:> ÛPƤÉÒ¾BW#g_>La/!T¾L-à6m{>AѺT̃¾ª¤„`¾@»GÙò>Km¥¬aD¾LÝ£ÂÏŽ>CçCÓaˆ¾6WÏ8þ¾;fõ·,eT>J<&±šÙ¾MPE©ø1+>EÕ¤ 4M¾)ûÖ~¢bt¾6X©ÿ4o!>HÏ_׊Q¾M² ¹¨>G”cþ^N~¾2VêXÄK¾1;‘úË·>G&3îïòi¾Mnn¡ÔQ>IÊÖ)¾7‘õŽ‹¾'%Ð…½ˆ‚>EDŒó¨¯]¾MÕ” ò>JtVÏã!¾<œhoa¥¾ÕÄZGæù>C/9jµM¾L{£‹S6>KŠ‚ÛѶ¾@´-¨¿n½Ð0;q$>@æ—œœ•¾K˜:A÷s>L_ £èN>¾Bö»Ã\¾>¯DCE><â]ê†hâ¾Jpþëž[ý>LñuS< D¾E Ùdó4Ì>&säšþÎ>7ª¹Ñ‘‹¾IÒ®n¦8>M:Ž-ɾFñ¬aéÇ>0ßÞYô[;>2,,×eM¾GWM]—†>M8hG*Û¾HŸÚtï<>6eóEâʸ>(춤 Ðf¾KYµb¡µ>y„ça9ý>E܉éI¾Sq‰“ì£>SàŠRY•¾I”õÐ Ÿ >GÁŠ×™Ë>GlÉ‘õÎ’¾Su_Ê>w>S…ê}Ô¾GÆdçTj½û‚ó»:$®>I"àjê¾S½‚…µþ0>SpBÛˆ¾Eî-Üv m¾$¼‘™ˆ->JÁsò¯H¾SöVµÑ›ô>R¬'6õ;D wôšq¾$†ö «Ô7>LD‹„B·¾Tdw¤Åq>R-ÚIâe·¾B&Ð[¸BU¾,Á游ÅÛ>M­ÈU]¾¾T:õRH×É>Q¦K í|ý¾@=8Û&­v¾2fn…±¾­>Nþì«Ó̾TH¬2ýz>QC’§=¾<Ÿ"×B2¼¾6N4m.éb>P(<96º¾TH(-x>PzMhWô¾8Æ.@?Š¾:áÏÎË5>P§ûÜßc¾T;Çwä>O²¼(‘K§¾4ïQ)÷‰º‚¾T#B´ ô>>Na‰óCg§¾1rÔ?R¾@ŸN˜– >Qžxq“ì¾SþN%[_ç>Mb®é2©¾*œõíw¾BN ªY>R¡~ô^¾SÏS%üK>Kž—‘W1¾#.Œ‡††¾CìD„ vÆ>Rc’B^-¾S– áœ[>J.+Mø.¿¾Xm„ ¾EwÜmå%`>R³ÇxüÔ¾SRA*xàñ>H¶SïEqܾû“F›¾FîÎ&Ñû>Rø„:%"¾SP$¹à>G:4+Fj=öRI–Ÿc¾HTgßXÈ›>S2øé7Ö¾R² Š*ö>E·¶~õ™>¯™B¼¼”¾I¦æEb‚>SaÆÒ¹¸g¾RUè¬,V>D1Ρ¼Yç> ¶˜ÈMö.¾Jät±#>S†1È‹ ¾QñÿT’U>B«„w‘þ>'jýÇ—¾ñ¾L¿”Î>S¡Šx™€¾Qˆ\ m*5>A"qD ˆ>-ù„qÉl¾M*ÍåÖ>S²n)—Á¾Q÷xfx¯>?2üÎjZ>2(ðvŸ«­¾N.ózá¥>Sº;ÑÏŒB¾P£-p£><&Ð š£X>5<›¼¼ýľO#*óE>Sº?“]¬-¾P)¬=\G0>9Iúœ® >8:‹BÌK¾P¤Gp—©>S±13Uy¾OV?|yÝ>6®8p>;ÎE=(¾Piò`ñBÏ>S `•NFs¾NS»w€§>3+pàU>=á5Ù‹ „¾PÉ{“<–>S‰&t¦x¾MKÀ]Q>0&bôss>@H!m£ˆ¾Q ›‘(ê›>Sj:„(ù¾L;ia ¹³>*wþÆAì>AG ^Ç`¾Qn­ î#s>SD諾K)^º>$ÁüœGg>BÊé÷ûш¾QµµUû?">S’§Mø¥¾J Y^!>=Á´ÌP>Cù¸°‡Á¾Qõa™fm>RéßG|ξHú–l¦.C>/‚Ћ Ì>E@ÜG1é¾R,M¢Dp>R´%=€wë¾GáRù…”>Öa¸ô ˜>F+OûK“¾R]R’þn1>Rz³ú%ȶ¾FÇR2õ¤½áB»<¬>G1ÏdͲ¾R‡™‚›& >R<0ýý£¾E«ÅEú;¾ó„[G»o>H)aà ‘¸¾RªöjKŠ>Qùîqo¡¾D’8)N­é¾x¿¨úP%>Iü vľRÈI7Z±(>Qµ-oœ ¾CzFž{ÚǾ z?ëx>Ió£<[O'¾Rà7U¸<>Ql•ª‚ϾBbŒRÖŸ%¾$Þ¡JÒDm>JÅX/:*¾RñÅyÖÓ(>Q!b.H(;AO$ Õ—ò¾)qæPü‡Y>KŠMáÌÍ ¾Rÿ hQv¸>PÔÓM;§¾@>Ͷ$¾-æ†9ÆÂ>LEc·U¶L¾Sv £=ì>P…ŒXÊO¾>`­y<÷ß¾1Í°×y>Ló?"i¦Â¾S y¶^¬~>P4²/«ºÖ¾M•ç¨l„l¾S ¶Î%>OÆûªšþ¾:FÜàšFP¾5-=s΂ >N/p Z¤î¾SÏWÒ¨¬>O!¶Ré¾8D¡Æï¾7nâ›ZÃ>N¼¿É4¾Rý韌>NyÓÓ´~¾6PRÝìÃʾ8ó]eªž>O@€1¾RñËÚ Ø>MÓ¬Šq«¾4fý.C{¾:»RiñdÓ>O»QÄ]k'¾Rã| Èè—>M+¨.é‰2¾2…àvоPÊ ¾€C¾RÑŽe,‹H>L„ âD¾0´RŸ£d¾>ó¿Ý´>PIz+ú-d¾R¾á<êÏ>KÞêÓëîi¾-Þ†^?D¾? -8J·¦>PyÁöê G¾R¨6!Y„>K9k×®¼¾*g±µÛˆš¾@&%fÕ7>P¥'a_½1¾R•fοm>J•œµç]¾'9êýµ¾ACè#è>PÌ®Pm’¨¾RvæÇ}ä>Iõž&*×¾#×ú(Òñi¾AðØpÔú>Pñh» „¾R[¤$G§>IVeÆ%m¿¾ ²°”[C¾B•‡šÍ>QÍü HľR=ö^9ü$>Hº€âŒ²¾`Â5¾Þé¾C0ä* >Q.íƒ5¯Ö¾R ªÊNú|>H"ƒ‹ g¾• à^H¾CÃõ.`Ü>QIÒ}4rj¾R…\nH>GŒ½ % ¾ëšB°¾DOÆxâö‹>Q`õ­K6è¾Qâä¶ÞÉP>Fú»GJŒt¾;†$6þDÒí‘m>QuZ#Žf¾Qì-òhñ>Fni(/G$½õÿýG4!¾EN1éËî>Qˆ &E穾Q¤3Y@à~>E䩹ȽÁðø­1›¾EÂÝHNW>Q—ƒlþ1¾QƒÊ2Jè>E_a¬uŽ=ðc|4E¾F.‹×1·[>Q¤½¼ãJp¾QdLP#ž>Dàs%û> •½SÕ¾F”ÆÁ·f>Q°ÃfÒ‡í¾QEŽpÜ6>Ddªš ÙW> ö¦V4¾Fô2>Qº©˜Ú¾Q%LÐ çá>CíðZøÊ>¿$ ”¾GJæd¦/|>QÁyÜv|Ù¾Qì™^2>C~kèÞE>|ºÒz³¾GœÜÓÁ‚³>QÈ*lû ¾Pé/ƒdcÆ>CÔä(€'> ÿ‚ÇÞǾGèj s‘Ò>QÌ}3©Yê¾PË`—˜C8>B«Æþô»>W ¶ Zµ¾H,œ@’ù>QÏr'£š¾P¯A;k&+>BKvú&>gäÆ1I¾HkjŸ‹†>QÑñˆN¼á¾P”ÈÈÛ>Aïç1ïž> ¥ý Ù ¾H¤×´ˆ®>QÒvÚ5¥q¾Py3²\8>AšÇNð>!ôùÕ ¡¾HÖÜí>QÑêæÍ)€¾P`Gjbå‘>AK·/èð>#'£7þǾIýö«>QÑA–?h>$DénÀ,)¾I-©)qZË>QÎ֥⨾P1TÂŒ-‹>@½cx—N9>%?p¾€ç‰¾IOL‘|×X>QË¡ib ¾PM³üÊP>@€è)å*º>&=ahg¾ImqN_N>QÈŒdnŠ¾P±ér>@HÁõ(>&è(wöˆÖ¾I†‚ çj>QÃöœFP¾OëpcëèI>@­{P>'!Ó"ÓľI˜çRp£.>Q¾Ãkµ®Û¾OÊ(D`y!>?سd¢³>(µÖ/g±¾I¨PY²\>Q¹ØôMf¾O«üÜÍ¡/>?ŒßPë>(•#BXÎj¾I²j§àÂ>Q³“zy2¾OGd*~.>?MLyü˜>(ëç)¾I¶[2×ù>Q¬Ð‡Q5¾OwiÖŸ¼>?7sש>)'ßRßÿ®¾I·3ž¢:>Q¦ožC ¾ObÍKàÌÇ>>öúÒž±>)OæuNÞì¾I³x">QžÌÕ@ž}¾OO¹÷ Èç>>ÛÖlâ>)VçZ¾I©l3BÑ}>Q–¹cŽ s¾OAŠ•J›Ñ>>Ï›K2¿”>)Cv2“p"¾IœsL¹Ô™>Q 3e ¾O6˜=[Ój>>ÌïM&ú4>)^µ·ò¿¾IŠæ5×>Q†%}㜾O-4Gc‹>>Ö5“[¬h>(Ô‘d¹é¾IsÁêÿ„>Q|ÊV¤n¶¾O(œÆœ>>îÐÍ[x7>(r¬—¾QsÐoúÿܾO'× Áå>?øôÜðº>'ý4Nä.{¾I9®"u>QiŠÖ(E§¾O'²uƒž>?<ùyþ^[>'gV©+"¾IˆO€$Ã>Q^éof-¾O+–ã>?xÙzl&>&·$C~ǾHêè¦HŽ>QTBôîO3µñÌÛ>?½òq:N>%ôOk›¦¾H½™À5‰v>QHVÒÂ[~¾O;œ*0² >@KÖXöÿ>%ãßI$.¾H‰Ý©€(°>Q;IJ”ýh¾OHƒGÓÞï>@5W—µòâ>$¤lCà¾HRð÷à°(>Q/O–céB¾OWì·³FP>@hJÞxº># àõ«¾HÆx²e>Q!G˜…ü¾Oh%ÛD ¨>@ «Ò° :>!Ò[fFõ¾GÔ–ÂZ=~>Q`¢Iud¾O|=ïù´[>@à Ç.²5> ‡íÓµ¾GŽ£µ¸Tâ>Q`®dH¾O’g.êýˆ>A"ü`„WÆ>Tdxó¾GC}KóÂ2>PòŒ¡ú°?¾O¨Ô¥mñ>Ak ·l§‹>YüJ—ö¾FñhA#ËÑ>Pà›Œï¾O–’ýq>A¹¼îöð>*qÉ€± ¾F›Ž9LÎ>PÎGMCë¾OÝÒ‡Îã>B ™]/§>ÕâwÌpu¾F@!o²q%>P¹Í>è-¾Oø¶#õs>Bb-Tl€4>AQùpÞ7¾EÝmø>`8>P£êèyêǾP Ý“pØ>B¾æ«˜j> óý![ü¾Ev˜Jxû‚>PO›lÚ ¾PCû\>CR÷œÓ™>ß=}è¾E ÕÖ'Ì>Pt5WiÞ¾P(ÚWx’>Cã ]}p=õ‡Êd¼íƒ¾D•YÙ(Ÿ>PYNŒ l"¾P8^WžM¤>Cë ­å=ÐHérî\¾D[kú9_>P=LÝŒzÿ¾PG΃Ñ{¥>DVD+39µ½ëê[q`¾CœÿCb .>Ph☺‘¾PV@‘²A'>DÄúÑ|>‚¾yì)S"¾C”#ëiz>Oú›/¿¬¾Pe"A¢U>E8aØ*’¾ YYξB‰)Ÿ‚_€>OµM”¸ ¾Psz³«|æ>E­{Ãç¾>ÿõ½i¾Aö >>Ìà>OiZ›’¾P€GŹ9Ÿ>F%Ù½mó¾ŒÐ‚?P©¾AZu¥ô2m>O¦>¥¦¾PŒù·!ÌÁ>F ³rÃöv¾©Šf¾@¹hOb>NÂÄÿ´¾P˜‘^RÓ>Gº`J²õ¾!RiØ}ú¾@~­Éòh>NeãPŒÏˆ¾P¢ Rõß >Gšr²u’ã¾$< èÌèå¾>ÁZU¼O>N¸8õb¥¾PªÈá¿Ï>H a2{¾':úßÜ&¾=TW{à ¬>Mš†ÌÁv¾P±ÇÜs>H›*Éw®²¾*GòN² ¾;Ø¢#2šG>M)Ó^ŠÅ?¾P¶„퉭>Iº€!Þý¾-n¨º¬¾:Jßfo›à>L±Ô8ÆB¾P¸×kÐ}>Ižbt‘¾0TÍx¾8±XnÓ>,>L3ÞŒ´CG¾P¹8«ŸbÐ>J[çvPi¾1öIÚÿí¾7ÆS¿N£>K¬iø¾Ãì¾P¶&<àæ>JæD³¹(¾3£Îx*–.¾5Mõÿ(’>KÀp¼ \¾P°ìMÃii>K·-c,¿¾5Xì¾4àѾ3‡Vg¨³Ü>J†"ÒkÔj¾P¨‚[u1Y>Kšg¾7ÁÎf>÷¾1±®W ó>Iå!wEÙ‹¾P›ÞÚÐ&é>L䆽¾8Óݵõ—s¾/”r…f>I;2Ü… ¾PŒNèͤY>LŒÄA“¾:›Q¾¹‹<¾+­¡Ð0@ >H‰$ýó)•¾PxÉÊÏå0>ML4OZÒ¾GÌ X6¾P`?}²ö>Mo®tˆ*è¾>3qOWpü¾#„Ĕ¤>G6V`¾PDï¡TV>MÛâ×H¦(¾@­QÙ¾’#X1>F5»Á¤cʾP"üø•ju>NA6Âо@ê¿J|q¾åö‚>EZʸ…U¾OøXºåm>N QðÒ¾AÔÙíÆʾ ôؼ«>DtÙ¢„=¾O¡²c™¨G>Nùä;Tà4¾B½âç¹ß½ïMn¶>C†BcÇß¾O?øò0”>OJ”Ó@½¾C¤…læ9™=õT82y:ž>B‹w‡Õ×¾NÑ€ÿ»+>O“I»£¾DŠîÑ6‡> —FÉFuš>A…û) ÞܾNW±„ôj®>OÔ’…B¾EnÔ¾õ>]2àù˜—>@w[?&\ݾMÑÉ™ì…8>P嘮£¾FMÚ\šè>! _ —†>>¹ÝÿV¾M=Seué>P†\ZSµ¾G*ZÒÓ}Y>%ùý­M`0>P+J ?¾HùäKg>*ñÅžáêÀ>:mƒA¾Kîâlñ¶">P5>gˆ’¾HÒ7;ºO>/ô#{ÏO>7œî"é+ƾK1MŠX>>P8Ñèèb¾I_MÛUB>2‚µúÆ}>5p (Û¾JfRà6ùb>P6_Î;øš¾J`â¾–\>5 ‘È­}>2{yíd\¾IŒÑÀ4>P+ûq ùÕ¾KJ¬LøÎ>7“JÕúì2>/™%°dðþH¢ÄO*G>PçêcоKË®6\–>:S.¢Æs>*r¯t&¾G«$ù\«U>P{ ±¬¾Lr~«Äý=><£x?”š>$z cä¾F¤.KÞšž>O½ãÉ꥜¾M *(ª~Ž>?$Ð&‹á>m`Ý3*G¾EŒYEjkš>Oh’•]y¾Mš¿° x>@Ðpø³ Ö>¬¼¬åü¾Dfµo Ü¿>OG‚P¾N—ïÌÙm>BÜDä›Ó=÷PA Ch¾C1ÎqdOÄ>N‰oÆÔ™º¾NŒHš¤p>C;¨Ð´ö½ù|Aôžµ¾Aì>7ƒ Ö>MüéaøŠu¾NîU/~„">Di.®~ʇ¾©H'P¾@™Y¡w¢ù>M^mÓ{'¾O?¢5ZÑô>E SYǼ¾¿ c)¾>oоÑ]>Lªr´Ê¼ê¾O}eö¯¼‘>F§¾­£Ÿî¾%Â×ð"þ»¾;G™»7>Kâ5‚ z¾O©¬eðp>G¹%]hæl¾, ¯C£ô¾8“4MT>KÚ%-7«¾OÁä¦Óâ>H½,QÑ‘¾1&'?ÛÈœ¾5~ɹ9>Jñ Ö¾OÄÞ·>I³fx|Fi¾4Hÿ"G0æ¾2NµÐÁ;>Igb°þ¾O°°‚Ä«>Jœr%lŒ¾7gu“ ê¾.€"v¬l>Gô3ÓÓµ¾O†òíGÔ„>Ks ÎZ'x¾:{“À¥‰Ü¾'cdñ©ˆ>FÃ~œ>Œ7¾OCóæxÓ >L9S¿£¾=ˆYäc¸ú¾ …Qˆ ²>E}ùçÃÓ¾Néê*¼3k>Lì±gpjà¾@CÔÕO.¾ú¼°û>D%sšÂN¾Nv ¶µ«>MŠ' t ,¾A¹x„³ŽY½ó´CÔ©Ý>B·gl—¾¾Mçòž}»>NmÝϾC&sÂ!øÀ>î›ýö>A5»&hÀZ¾M@gªN3¦>N‚³Fð/Jì{>?Eico¾L~JÅÉÅ>NÙ†M.Q/¾EÙ^ ¦->#>xñºË‰>;ø3ÑüꎾKŸ^vµ>Oµ¾uU¾GnGXpÓ>*ú޺ɖ>8ˆËjä¡F¾J¦3onH>O8ƒ9®¡¾HN7Fãf\>0éjA¼>4üŠ½wç¾I’ ’Ôè>O<¶ß“Êø¾IjÝcÒ•>4…®)—TŸ>1OÀC†ì¾Ha%ÊF©p>O#Ë¥·÷¾JsÂa9>8©[tób>+áü¾G͈ÙŸ>NìAŸYؾKdÄ29H>;çö¸ËÌ>#Z7ÍIR^¾E±ë Põ>N“ÀJº_6¾L;˜˜cm>? @„#>ë ñ“±§¾D1š>ý±¿>NÜôÜ’4¾L÷¢´ë>A4±?a`=û‡²l'þ´¾B™­‚´¼Â>M‚X.¬ ×¾M—µoz½>BÒˆà¼XN¾”œ{±L€¾@éž©2Ì>LÆ¢á:3¾NÂÚŒ¬>D_œ5óÔã¾ 9ÐÌZ¾>B9ÞÜ~§>Kèý7påó¾Nv yQ»ë>EÚñ¤<š_¾%§Ÿ'Õ¾:‰ŒVo>JêÃGzt;N³Ìòiw>G? oÁ×¾-%)ñW˾6¨8Y­\>IÉDxqB¾NÌ[M•ï¸>HŠÕñ˜X¾2 Røø½‰¾2 rqœ>H…¶‰qº¾NÁtËû>È>I½Sëê2–¾6 ¶®-v¾,õf.á d>G"¾à”Þˆ¾NZnKÍs>JÑ›Î=¾:ŠñÍØšl¾$s‰‚>Eæ,60d¾N6‹ Y·!>KÄþâd••¾>_iží{¾|*g€¯Ç>Cù·µ?-€¾M¶@«é 8>L˜h€Þí¾A ù·Œs“½÷_r|–w>B9™ 9m¾M a˜ø>MEõùGÛ¾BÐ)na 2>õÖKéG>@ZJ>‘Ä%¾L:çF/%>MÍ „lª½¾DÙžN¢È>ïúã#›•><ÁØ(ÉpX¾K?Eÿä,æ>N-_\oú¾Fn°%>'êšœ…½>8 ûT=¬¾J¡¾º½’>Nag ß ¾G•,ÊUá/>0fÏ]­œg>4P¾cí9ɾHÎ,»Š 7>NiÄÙÔ¾Hñè¾ô•á>4Ìe˜ [4>/³Ï*Ù¾GZœ%öÄ[>NFH`V.¾J,†4—‘>9¾ð±>&ˆK›ué&¾EÀ›~Ã>MòÙ¶'ô¾K?+dk+)>=G5Ü–Mk>DCnÛƒ¾D"‡\ÎI>Mpý¸£ê¾L+;Wùm>@©‡<~Ê/=ü£À˜)¾Bñ%Ó>L¾ì®ñ¤Ø¾LìC:ï>B—9-KÜ'”Lju¾M}ÄÇnÉ>Dj:>¡ôŽ¾vÈ™¹=Á¾;î¶_;>JÉmï@4f¾MàÒw7Q>F  ’FY¾)c1z¾7s§ÂE²S>Iˆ±šÖK¾NÅèñh>G±ÚŠ•Zc¾1u¾w ¾2Ç•¥RIw>HàíξN _2:j=>IS¯;u¾6'kŠ€ a¾+Ý›„__">Fy×âÏ*¾MÕ˜É(|>J`1øz<¢¾:ºBnäY.¾!íƦ(Sc>D±ÄÞ÷ïW¾Mfs×/´9>KtôÁX–¾?!ÕöèÚ¾+þ§¿d>B¾áёﺾL¿Hb~ã>LVíCS“¾A­>åÊ`=óú*ÐØ/Æ>@¥IŽ Q¾KâJ­'B>Mjˆšg¾C«àV=°>¡ë Q¥><Ó=.Ô‡¾JÎ65-FÂ>M£QgÞ¾E†}‰>Ù>'V)”>8¬VâœF¾I‚C ¹Ç>M¾Är‹¾G;kŒö*>0¨õm£U‡>3%èhÞð¾H—>±÷>MÄ4ÄŽ4%¾HÄ¡åûŒç>5¨#~Ïí>, kÚ?á¾FO€2”|#>M‹pßTzx¾J;î`Ki>:ƒ_SBW>!}ëÜE¾DiÄŠxg~>MΟь¾KA_³>?2<:P­:> ÛPƤÉÒ¾BW#g_>La/!T¾L-à6m{>AѺT̃¾ª¤„`¾@»GÙò>Km¥¬aD¾LÝ£ÂÏŽ>CçCÓaˆ¾6WÏ8þ¾;fõ·,eT>J<&±šÙ¾MPE©ø1+>EÕ¤ 4M¾)ûÖ~¢bt¾6X©ÿ4o!>HÏ_׊Q¾M² ¹¨>G”cþ^N~¾2VêXÄK¾1;‘úË·>G&3îïòi¾Mnn¡ÔQ>IÊÖ)¾7‘õŽ‹¾'%Ð…½ˆ‚>EDŒó¨¯]¾MÕ” ò>JtVÏã!¾<œhoa¥¾ÕÄZGæù>C/9jµM¾L{£‹S6>KŠ‚ÛѶ¾@´-¨¿n½Ð0;q$>@æ—œœ•¾K˜:A÷s>L_ £èN>¾Bö»Ã\¾>¯DCE><â]ê†hâ¾Jpþëž[ý>LñuS< D¾E Ùdó4Ì>&säšþÎ>7ª¹Ñ‘‹¾IÒ®n¦8>M:Ž-ɾFñ¬aéÇ>0ßÞYô[;>2,,×eM¾GWM]—†>M8hG*Û¾HŸÚtï<>6eóEâʸ>(춤 Ðf¾KYµb¡µ>y„ça9ý>E܉éI¾Sq‰“ì£>SàŠRY•¾I”õÐ Ÿ >GÁŠ×™Ë>GlÉ‘õÎ’¾Su_Ê>w>S…ê}Ô¾GÆdçTj½û‚ó»:$®>I"àjê¾S½‚…µþ0>SpBÛˆ¾Eî-Üv m¾$¼‘™ˆ->JÁsò¯H¾SöVµÑ›ô>R¬'6õ;D wôšq¾$†ö «Ô7>LD‹„B·¾Tdw¤Åq>R-ÚIâe·¾B&Ð[¸BU¾,Á游ÅÛ>M­ÈU]¾¾T:õRH×É>Q¦K í|ý¾@=8Û&­v¾2fn…±¾­>Nþì«Ó̾TH¬2ýz>QC’§=¾<Ÿ"×B2¼¾6N4m.éb>P(<96º¾TH(-x>PzMhWô¾8Æ.@?Š¾:áÏÎË5>P§ûÜßc¾T;Çwä>O²¼(‘K§¾4ïQ)÷‰º‚¾T#B´ ô>>Na‰óCg§¾1rÔ?R¾@ŸN˜– >Qžxq“ì¾SþN%[_ç>Mb®é2©¾*œõíw¾BN ªY>R¡~ô^¾SÏS%üK>Kž—‘W1¾#.Œ‡††¾CìD„ vÆ>Rc’B^-¾S– áœ[>J.+Mø.¿¾Xm„ ¾EwÜmå%`>R³ÇxüÔ¾SRA*xàñ>H¶SïEqܾû“F›¾FîÎ&Ñû>Rø„:%"¾SP$¹à>G:4+Fj=öRI–Ÿc¾HTgßXÈ›>S2øé7Ö¾R² Š*ö>E·¶~õ™>¯™B¼¼”¾I¦æEb‚>SaÆÒ¹¸g¾RUè¬,V>D1Ρ¼Yç> ¶˜ÈMö.¾Jät±#>S†1È‹ ¾QñÿT’U>B«„w‘þ>'jýÇ—¾ñ¾L¿”Î>S¡Šx™€¾Qˆ\ m*5>A"qD ˆ>-ù„qÉl¾M*ÍåÖ>S²n)—Á¾Q÷xfx¯>?2üÎjZ>2(ðvŸ«­¾N.ózá¥>Sº;ÑÏŒB¾P£-p£><&Ð š£X>5<›¼¼ýľO#*óE>Sº?“]¬-¾P)¬=\G0>9Iúœ® >8:‹BÌK¾P¤Gp—©>S±13Uy¾OV?|yÝ>6®8p>;ÎE=(¾Piò`ñBÏ>S `•NFs¾NS»w€§>3+pàU>=á5Ù‹ „¾PÉ{“<–>S‰&t¦x¾MKÀ]Q>0&bôss>@H!m£ˆ¾Q ›‘(ê›>Sj:„(ù¾L;ia ¹³>*wþÆAì>AG ^Ç`¾Qn­ î#s>SD諾K)^º>$ÁüœGg>BÊé÷ûш¾QµµUû?">S’§Mø¥¾J Y^!>=Á´ÌP>Cù¸°‡Á¾Qõa™fm>RéßG|ξHú–l¦.C>/‚Ћ Ì>E@ÜG1é¾R,M¢Dp>R´%=€wë¾GáRù…”>Öa¸ô ˜>F+OûK“¾R]R’þn1>Rz³ú%ȶ¾FÇR2õ¤½áB»<¬>G1ÏdͲ¾R‡™‚›& >R<0ýý£¾E«ÅEú;¾ó„[G»o>H)aà ‘¸¾RªöjKŠ>Qùîqo¡¾D’8)N­é¾x¿¨úP%>Iü vľRÈI7Z±(>Qµ-oœ ¾CzFž{ÚǾ z?ëx>Ió£<[O'¾Rà7U¸<>Ql•ª‚ϾBbŒRÖŸ%¾$Þ¡JÒDm>JÅX/:*¾RñÅyÖÓ(>Q!b.H(;AO$ Õ—ò¾)qæPü‡Y>KŠMáÌÍ ¾Rÿ hQv¸>PÔÓM;§¾@>Ͷ$¾-æ†9ÆÂ>LEc·U¶L¾Sv £=ì>P…ŒXÊO¾>`­y<÷ß¾1Í°×y>Ló?"i¦Â¾S y¶^¬~>P4²/«ºÖ¾M•ç¨l„l¾S ¶Î%>OÆûªšþ¾:FÜàšFP¾5-=s΂ >N/p Z¤î¾SÏWÒ¨¬>O!¶Ré¾8D¡Æï¾7nâ›ZÃ>N¼¿É4¾Rý韌>NyÓÓ´~¾6PRÝìÃʾ8ó]eªž>O@€1¾RñËÚ Ø>MÓ¬Šq«¾4fý.C{¾:»RiñdÓ>O»QÄ]k'¾Rã| Èè—>M+¨.é‰2¾2…àvоPÊ ¾€C¾RÑŽe,‹H>L„ âD¾0´RŸ£d¾>ó¿Ý´>PIz+ú-d¾R¾á<êÏ>KÞêÓëîi¾-Þ†^?D¾? -8J·¦>PyÁöê G¾R¨6!Y„>K9k×®¼¾*g±µÛˆš¾@&%fÕ7>P¥'a_½1¾R•fοm>J•œµç]¾'9êýµ¾ACè#è>PÌ®Pm’¨¾RvæÇ}ä>Iõž&*×¾#×ú(Òñi¾AðØpÔú>Pñh» „¾R[¤$G§>IVeÆ%m¿¾ ²°”[C¾B•‡šÍ>QÍü HľR=ö^9ü$>Hº€âŒ²¾`Â5¾Þé¾C0ä* >Q.íƒ5¯Ö¾R ªÊNú|>H"ƒ‹ g¾• à^H¾CÃõ.`Ü>QIÒ}4rj¾R…\nH>GŒ½ % ¾ëšB°¾DOÆxâö‹>Q`õ­K6è¾Qâä¶ÞÉP>Fú»GJŒt¾;†$6þDÒí‘m>QuZ#Žf¾Qì-òhñ>Fni(/G$½õÿýG4!¾EN1éËî>Qˆ &E穾Q¤3Y@à~>E䩹ȽÁðø­1›¾EÂÝHNW>Q—ƒlþ1¾QƒÊ2Jè>E_a¬uŽ=ðc|4E¾F.‹×1·[>Q¤½¼ãJp¾QdLP#ž>Dàs%û> •½SÕ¾F”ÆÁ·f>Q°ÃfÒ‡í¾QEŽpÜ6>Ddªš ÙW> ö¦V4¾Fô2>Qº©˜Ú¾Q%LÐ çá>CíðZøÊ>¿$ ”¾GJæd¦/|>QÁyÜv|Ù¾Qì™^2>C~kèÞE>|ºÒz³¾GœÜÓÁ‚³>QÈ*lû ¾Pé/ƒdcÆ>CÔä(€'> ÿ‚ÇÞǾGèj s‘Ò>QÌ}3©Yê¾PË`—˜C8>B«Æþô»>W ¶ Zµ¾H,œ@’ù>QÏr'£š¾P¯A;k&+>BKvú&>gäÆ1I¾HkjŸ‹†>QÑñˆN¼á¾P”ÈÈÛ>Aïç1ïž> ¥ý Ù ¾H¤×´ˆ®>QÒvÚ5¥q¾Py3²\8>AšÇNð>!ôùÕ ¡¾HÖÜí>QÑêæÍ)€¾P`Gjbå‘>AK·/èð>#'£7þǾIýö«>QÑA–?h>$DénÀ,)¾I-©)qZË>QÎ֥⨾P1TÂŒ-‹>@½cx—N9>%?p¾€ç‰¾IOL‘|×X>QË¡ib ¾PM³üÊP>@€è)å*º>&=ahg¾ImqN_N>QÈŒdnŠ¾P±ér>@HÁõ(>&è(wöˆÖ¾I†‚ çj>QÃöœFP¾OëpcëèI>@­{P>'!Ó"ÓľI˜çRp£.>Q¾Ãkµ®Û¾OÊ(D`y!>?سd¢³>(µÖ/g±¾I¨PY²\>Q¹ØôMf¾O«üÜÍ¡/>?ŒßPë>(•#BXÎj¾I²j§àÂ>Q³“zy2¾OGd*~.>?MLyü˜>(ëç)¾I¶[2×ù>Q¬Ð‡Q5¾OwiÖŸ¼>?7sש>)'ßRßÿ®¾I·3ž¢:>Q¦ožC ¾ObÍKàÌÇ>>öúÒž±>)OæuNÞì¾I³x">QžÌÕ@ž}¾OO¹÷ Èç>>ÛÖlâ>)VçZ¾I©l3BÑ}>Q–¹cŽ s¾OAŠ•J›Ñ>>Ï›K2¿”>)Cv2“p"¾IœsL¹Ô™>Q 3e ¾O6˜=[Ój>>ÌïM&ú4>)^µ·ò¿¾IŠæ5×>Q†%}㜾O-4Gc‹>>Ö5“[¬h>(Ô‘d¹é¾IsÁêÿ„>Q|ÊV¤n¶¾O(œÆœ>>îÐÍ[x7>(r¬—¾QsÐoúÿܾO'× Áå>?øôÜðº>'ý4Nä.{¾I9®"u>QiŠÖ(E§¾O'²uƒž>?<ùyþ^[>'gV©+"¾IˆO€$Ã>Q^éof-¾O+–ã>?xÙzl&>&·$C~ǾHêè¦HŽ>QTBôîO3µñÌÛ>?½òq:N>%ôOk›¦¾H½™À5‰v>QHVÒÂ[~¾O;œ*0² >@KÖXöÿ>%ãßI$.¾H‰Ý©€(°>Q;IJ”ýh¾OHƒGÓÞï>@5W—µòâ>$¤lCà¾HRð÷à°(>Q/O–céB¾OWì·³FP>@hJÞxº># àõ«¾HÆx²e>Q!G˜…ü¾Oh%ÛD ¨>@ «Ò° :>!Ò[fFõ¾GÔ–ÂZ=~>Q`¢Iud¾O|=ïù´[>@à Ç.²5> ‡íÓµ¾GŽ£µ¸Tâ>Q`®dH¾O’g.êýˆ>A"ü`„WÆ>Tdxó¾GC}KóÂ2>PòŒ¡ú°?¾O¨Ô¥mñ>Ak ·l§‹>YüJ—ö¾FñhA#ËÑ>Pà›Œï¾O–’ýq>A¹¼îöð>*qÉ€± ¾F›Ž9LÎ>PÎGMCë¾OÝÒ‡Îã>B ™]/§>ÕâwÌpu¾F@!o²q%>P¹Í>è-¾Oø¶#õs>Bb-Tl€4>AQùpÞ7¾EÝmø>`8>P£êèyêǾP Ý“pØ>B¾æ«˜j> óý![ü¾Ev˜Jxû‚>PO›lÚ ¾PCû\>CR÷œÓ™>ß=}è¾E ÕÖ'Ì>Pt5WiÞ¾P(ÚWx’>Cã ]}p=õ‡Êd¼íƒ¾D•YÙ(Ÿ>PYNŒ l"¾P8^WžM¤>Cë ­å=ÐHérî\¾D[kú9_>P=LÝŒzÿ¾PG΃Ñ{¥>DVD+39µ½ëê[q`¾CœÿCb .>Ph☺‘¾PV@‘²A'>DÄúÑ|>‚¾yì)S"¾C”#ëiz>Oú›/¿¬¾Pe"A¢U>E8aØ*’¾ YYξB‰)Ÿ‚_€>OµM”¸ ¾Psz³«|æ>E­{Ãç¾>ÿõ½i¾Aö >>Ìà>OiZ›’¾P€GŹ9Ÿ>F%Ù½mó¾ŒÐ‚?P©¾AZu¥ô2m>O¦>¥¦¾PŒù·!ÌÁ>F ³rÃöv¾©Šf¾@¹hOb>NÂÄÿ´¾P˜‘^RÓ>Gº`J²õ¾!RiØ}ú¾@~­Éòh>NeãPŒÏˆ¾P¢ Rõß >Gšr²u’ã¾$< èÌèå¾>ÁZU¼O>N¸8õb¥¾PªÈá¿Ï>H a2{¾':úßÜ&¾=TW{à ¬>Mš†ÌÁv¾P±ÇÜs>H›*Éw®²¾*GòN² ¾;Ø¢#2šG>M)Ó^ŠÅ?¾P¶„퉭>Iº€!Þý¾-n¨º¬¾:Jßfo›à>L±Ô8ÆB¾P¸×kÐ}>Ižbt‘¾0TÍx¾8±XnÓ>,>L3ÞŒ´CG¾P¹8«ŸbÐ>J[çvPi¾1öIÚÿí¾7ÆS¿N£>K¬iø¾Ãì¾P¶&<àæ>JæD³¹(¾3£Îx*–.¾5Mõÿ(’>KÀp¼ \¾P°ìMÃii>K·-c,¿¾5Xì¾4àѾ3‡Vg¨³Ü>J†"ÒkÔj¾P¨‚[u1Y>Kšg¾7ÁÎf>÷¾1±®W ó>Iå!wEÙ‹¾P›ÞÚÐ&é>L䆽¾8Óݵõ—s¾/”r…f>I;2Ü… ¾PŒNèͤY>LŒÄA“¾:›Q¾¹‹<¾+­¡Ð0@ >H‰$ýó)•¾PxÉÊÏå0>ML4OZÒ¾GÌ X6¾P`?}²ö>Mo®tˆ*è¾>3qOWpü¾#„Ĕ¤>G6V`¾PDï¡TV>MÛâ×H¦(¾@­QÙ¾’#X1>F5»Á¤cʾP"üø•ju>NA6Âо@ê¿J|q¾åö‚>EZʸ…U¾OøXºåm>N QðÒ¾AÔÙíÆʾ ôؼ«>DtÙ¢„=¾O¡²c™¨G>Nùä;Tà4¾B½âç¹ß½ïMn¶>C†BcÇß¾O?øò0”>OJ”Ó@½¾C¤…læ9™=õT82y:ž>B‹w‡Õ×¾NÑ€ÿ»+>O“I»£¾DŠîÑ6‡> —FÉFuš>A…û) ÞܾNW±„ôj®>OÔ’…B¾EnÔ¾õ>]2àù˜—>@w[?&\ݾMÑÉ™ì…8>P嘮£¾FMÚ\šè>! _ —†>>¹ÝÿV¾M=Seué>P†\ZSµ¾G*ZÒÓ}Y>%ùý­M`0>P+J ?¾HùäKg>*ñÅžáêÀ>:mƒA¾Kîâlñ¶">P5>gˆ’¾HÒ7;ºO>/ô#{ÏO>7œî"é+ƾK1MŠX>>P8Ñèèb¾I_MÛUB>2‚µúÆ}>5p (Û¾JfRà6ùb>P6_Î;øš¾J`â¾–\>5 ‘È­}>2{yíd\¾IŒÑÀ4>P+ûq ùÕ¾KJ¬LøÎ>7“JÕúì2>/™%°dðþH¢ÄO*G>PçêcоKË®6\–>:S.¢Æs>*r¯t&¾G«$ù\«U>P{ ±¬¾Lr~«Äý=><£x?”š>$z cä¾F¤.KÞšž>O½ãÉ꥜¾M *(ª~Ž>?$Ð&‹á>m`Ý3*G¾EŒYEjkš>Oh’•]y¾Mš¿° x>@Ðpø³ Ö>¬¼¬åü¾Dfµo Ü¿>OG‚P¾N—ïÌÙm>BÜDä›Ó=÷PA Ch¾C1ÎqdOÄ>N‰oÆÔ™º¾NŒHš¤p>C;¨Ð´ö½ù|Aôžµ¾Aì>7ƒ Ö>MüéaøŠu¾NîU/~„">Di.®~ʇ¾©H'P¾@™Y¡w¢ù>M^mÓ{'¾O?¢5ZÑô>E SYǼ¾¿ c)¾>oоÑ]>Lªr´Ê¼ê¾O}eö¯¼‘>F§¾­£Ÿî¾%Â×ð"þ»¾;G™»7>Kâ5‚ z¾O©¬eðp>G¹%]hæl¾, ¯C£ô¾8“4MT>KÚ%-7«¾OÁä¦Óâ>H½,QÑ‘¾1&'?ÛÈœ¾5~ɹ9>Jñ Ö¾OÄÞ·>I³fx|Fi¾4Hÿ"G0æ¾2NµÐÁ;>Igb°þ¾O°°‚Ä«>Jœr%lŒ¾7gu“ ê¾.€"v¬l>Gô3ÓÓµ¾O†òíGÔ„>Ks ÎZ'x¾:{“À¥‰Ü¾'cdñ©ˆ>FÃ~œ>Œ7¾OCóæxÓ >L9S¿£¾=ˆYäc¸ú¾ …Qˆ ²>E}ùçÃÓ¾Néê*¼3k>Lì±gpjà¾@CÔÕO.¾ú¼°û>D%sšÂN¾Nv ¶µ«>MŠ' t ,¾A¹x„³ŽY½ó´CÔ©Ý>B·gl—¾¾Mçòž}»>NmÝϾC&sÂ!øÀ>î›ýö>A5»&hÀZ¾M@gªN3¦>N‚³Fð/Jì{>?Eico¾L~JÅÉÅ>NÙ†M.Q/¾EÙ^ ¦->#>xñºË‰>;ø3ÑüꎾKŸ^vµ>Oµ¾uU¾GnGXpÓ>*ú޺ɖ>8ˆËjä¡F¾J¦3onH>O8ƒ9®¡¾HN7Fãf\>0éjA¼>4üŠ½wç¾I’ ’Ôè>O<¶ß“Êø¾IjÝcÒ•>4…®)—TŸ>1OÀC†ì¾Ha%ÊF©p>O#Ë¥·÷¾JsÂa9>8©[tób>+áü¾G͈ÙŸ>NìAŸYؾKdÄ29H>;çö¸ËÌ>#Z7ÍIR^¾E±ë Põ>N“ÀJº_6¾L;˜˜cm>? @„#>ë ñ“±§¾D1š>ý±¿>NÜôÜ’4¾L÷¢´ë>A4±?a`=û‡²l'þ´¾B™­‚´¼Â>M‚X.¬ ×¾M—µoz½>BÒˆà¼XN¾”œ{±L€¾@éž©2Ì>LÆ¢á:3¾NÂÚŒ¬>D_œ5óÔã¾ 9ÐÌZ¾>B9ÞÜ~§>Kèý7påó¾Nv yQ»ë>EÚñ¤<š_¾%§Ÿ'Õ¾:‰ŒVo>JêÃGzt;N³Ìòiw>G? oÁ×¾-%)ñW˾6¨8Y­\>IÉDxqB¾NÌ[M•ï¸>HŠÕñ˜X¾2 Røø½‰¾2 rqœ>H…¶‰qº¾NÁtËû>È>I½Sëê2–¾6 ¶®-v¾,õf.á d>G"¾à”Þˆ¾NZnKÍs>JÑ›Î=¾:ŠñÍØšl¾$s‰‚>Eæ,60d¾N6‹ Y·!>KÄþâd••¾>_iží{¾|*g€¯Ç>Cù·µ?-€¾M¶@«é 8>L˜h€Þí¾A ù·Œs“½÷_r|–w>B9™ 9m¾M a˜ø>MEõùGÛ¾BÐ)na 2>õÖKéG>@ZJ>‘Ä%¾L:çF/%>MÍ „lª½¾DÙžN¢È>ïúã#›•><ÁØ(ÉpX¾K?Eÿä,æ>N-_\oú¾Fn°%>'êšœ…½>8 ûT=¬¾J¡¾º½’>Nag ß ¾G•,ÊUá/>0fÏ]­œg>4P¾cí9ɾHÎ,»Š 7>NiÄÙÔ¾Hñè¾ô•á>4Ìe˜ [4>/³Ï*Ù¾GZœ%öÄ[>NFH`V.¾J,†4—‘>9¾ð±>&ˆK›ué&¾EÀ›~Ã>MòÙ¶'ô¾K?+dk+)>=G5Ü–Mk>DCnÛƒ¾D"‡\ÎI>Mpý¸£ê¾L+;Wùm>@©‡<~Ê/=ü£À˜)¾Bñ%Ó>L¾ì®ñ¤Ø¾LìC:ï>B—9-KÜ'”Lju¾M}ÄÇnÉ>Dj:>¡ôŽ¾vÈ™¹=Á¾;î¶_;>JÉmï@4f¾MàÒw7Q>F  ’FY¾)c1z¾7s§ÂE²S>Iˆ±šÖK¾NÅèñh>G±ÚŠ•Zc¾1u¾w ¾2Ç•¥RIw>HàíξN _2:j=>IS¯;u¾6'kŠ€ a¾+Ý›„__">Fy×âÏ*¾MÕ˜É(|>J`1øz<¢¾:ºBnäY.¾!íƦ(Sc>D±ÄÞ÷ïW¾Mfs×/´9>KtôÁX–¾?!ÕöèÚ¾+þ§¿d>B¾áёﺾL¿Hb~ã>LVíCS“¾A­>åÊ`=óú*ÐØ/Æ>@¥IŽ Q¾KâJ­'B>Mjˆšg¾C«àV=°>¡ë Q¥><Ó=.Ô‡¾JÎ65-FÂ>M£QgÞ¾E†}‰>Ù>'V)”>8¬VâœF¾I‚C ¹Ç>M¾Är‹¾G;kŒö*>0¨õm£U‡>3%èhÞð¾H—>±÷>MÄ4ÄŽ4%¾HÄ¡åûŒç>5¨#~Ïí>, kÚ?á¾FO€2”|#>M‹pßTzx¾J;î`Ki>:ƒ_SBW>!}ëÜE¾DiÄŠxg~>MΟь¾KA_³>?2<:P­:> ÛPƤÉÒ¾BW#g_>La/!T¾L-à6m{>AѺT̃¾ª¤„`¾@»GÙò>Km¥¬aD¾LÝ£ÂÏŽ>CçCÓaˆ¾6WÏ8þ¾;fõ·,eT>J<&±šÙ¾MPE©ø1+>EÕ¤ 4M¾)ûÖ~¢bt¾6X©ÿ4o!>HÏ_׊Q¾M² ¹¨>G”cþ^N~¾2VêXÄK¾1;‘úË·>G&3îïòi¾Mnn¡ÔQ>IÊÖ)¾7‘õŽ‹¾'%Ð…½ˆ‚>EDŒó¨¯]¾MÕ” ò>JtVÏã!¾<œhoa¥¾ÕÄZGæù>C/9jµM¾L{£‹S6>KŠ‚ÛѶ¾@´-¨¿n½Ð0;q$>@æ—œœ•¾K˜:A÷s>L_ £èN>¾Bö»Ã\¾>¯DCE><â]ê†hâ¾Jpþëž[ý>LñuS< D¾E Ùdó4Ì>&säšþÎ>7ª¹Ñ‘‹¾IÒ®n¦8>M:Ž-ɾFñ¬aéÇ>0ßÞYô[;>2,,×eM¾GWM]—†>M8hG*Û¾HŸÚtï<>6eóEâʸ>(춤 Ðf¾Ek<ú•&>Lì@C×ê¾J³ŽbÔx>;¶ÍPÊÌ>hXw8Œ¦¾CCÙAçÔ>LQ¾Þv"´¾K9ëþK>@bêØâT‚=äÊ¥¨ê3¾@ä*ÕÌÄ>Kj*tÄò¾LèMûÄ>BÃHg@¾Ž9²wÉ<¾<¨¿ä™=²>J7ÅÐÝúì¾L¸ —|“>Dò C&C ¾&½S)ƒM¾72P¢àÑ>H¹C‰[)â¾M~æÔ>FéZã“s’¾1Er覽‰¾1o±ˆZd{>Fò¼úÙÝT¾LøŽ]Ü>H£¾SísȾ7b^F©¾&ë†_?Íw>Dé% NÎæ¾L¨}#Ø>Jè—ø:¾<ƒäH$†=¾G¹#¤¦>Bž+q¥•û¾Kë¾*ä¿>KAj¿öÊ}¾@Ýt„˜Æ)=í¤Cé;Ë9>@±ôŽam¾JçÃ5°>L‹F6l¾CJ¨†¨>½ ÀÑB‰>:Áž£J[¾Iíÿá®>L¢“92·¾E}Ú ¯ø>*È_ †éR>4ôsÝ}–¾Gè7¥ÄË^>LЦÈz«¾Gs™}!6Ü>3zÝݨ¼;>-½AÿVﯾEóôÞP>L¥`OóîA¾I"P$ðt¿>9Y—Ó)4>!(±¸ÍϾC·e @îæ>LÖµaµJ¾J•½v±>>ï ª“¢>ß¡7D¾A6Ó²po>K:·Šâ8¾KŽ&îÞ >BHÌo¾vвñx³¾<ø¢’J>IþbÀ"¾LAWL]÷¬>Dxáú©È¾%«š«Ú–ª¾7Á{ô§Ÿ>HhO“‡ñ¾L•€÷‚>F›0ñø;G¾14»{´!ú¾0å é-i{>F}z¤{E¾LŠg¨õ˜>Ht¤‡q­'¾7a5=ÕoP¾$à#V¸èt>DDC"Iú|ËH¸¾=A·Z¥x)¾sØâ÷‹c>AÀ2}Èh¾KJÖê(¨¯>K'þv.¾AbŸoúÄ>_4AÏ„>=óGŠ ž¾J=Ó„ ù>KõÅž¨†¾Cê°ùß©>#Bìm¥x/>7ö Øü’Y¾H…ù|GL^ä„Œ¾F*ÃÇ»K†>01˜$IˆC…¾F–†‰\^>L`V3BʾHYô<>6¦•p’¢‚>%àþ;·©O¾DR&ÁJ‘7>Kùz¾ ÑÔ¾I¹¼&\r><ÀäÛ4ðÀ>iL_¯Â¾A¾\vRÄ>K&é9g ʾJô]㮃þ>A:±^Û;(¾µ±uâjo¾=Ä7h&¦>Ië.òÜ,>¾KÊ/¼‹¹Ô>C×R†£a—¾#Š†^<­¾7” Á7P>HJy·GɾL4ŒçŒB>F(Go ¾0’ûÿ9sç¾0ÿŠ6tï>FFs\vÎå¾L.Tþ;E3>H#”žŠQ¡¾7)«yäbœ¾$8ñøV”h>CæÐpÉ,¾K¸@{<ø>IÁ¤¢}¾ö¾=j°î*;X¡ x>A4ëŽì¯Ì¾Jлo§?Þ>J÷Nü}¾A›ß2dJ…>lübYVù>K¾ ±‡‹5¾D> óÐé9>&wJb—öš>5ö`·ÊX¾G´DÙ¸G¢>LØu–ãm¾FŽå°‰>21þ­!ÛÖ>.8uéÞn¾E‰ÔùEÓÞ>Kï,¨{¾H~åqS¥>8â{ÞJy–>ÙBÌ{üY¾Bþ¼q3¯>KR_>eÃ!¾J IJjëË>?1eº°=ä°.ó’ ~¾@*ªdÓ+>J>Ê1£šQ¾K#oÆüG>B}¦/ßÆC¾θ<'\¾9ééÀ(y[>H´’“›û¾KÄ‘”Š>EXôŽh ¾+óäî lã¾3>K.(ú>F¸r« h¾Ké±ÎEà6>GN°¹Ø¾5ô¿ùÂ<¾'ÑÕlW|\>DTZݼ ç¾KæN4¾>IÚ_ŸhÀ¾;¼W¬»È/¾î•è$­V>AŽ@7êˆÂ¾J´¼Ké_>J|ÿùyÿ¾@üQô>ŒG/ 1><å±vÒJ…¾I\:7e‹À>Ka@x³/¾CÍ´ÐÝ?Ô>%+Rºõb>6!¦“á”I¾G‰¯ËèÎY>KÂmGÖ‘¾FAþ¢™F>1ï>7r¡>-Ñôù§$¾EBC‰.ãc>KÉŠçÏC¾HNkðL3ð>8ü]Ô­>‘˜K£Â¾B‘â>{HÍ>Jó Ò:¾Iå¤æû>?“8épèǽԿN!$5u¾?^f¨êò>IÀp}En¾JüI¼?1*>BÉÆf¿ŽÏ¾ j¡D«‹¾8B @õ:®>H ‡§¾KjºÝL >EoŽ—†à†¾/UyX½´¾0ÿ!çG‘>EÚÈÚ|¤-¾K’q¢·Ó2>G¨÷éÇN¿¾6û10 W4¾"ºšÂ >C6Vl§¾K}‚û/p>Ij Ô½NÚ¾=Þ},ÙB½÷÷’‰Âc>@*8¡$é¾IïºÓ9/>J¨Ëåm.¾BÐ{ºCõ>­öué&P>9Ž;ÖR¾HM5Žù‚>KY¨'ï®u¾DÝ㌦Ã>,x…×X›¯>24ç¼Uس¾F%·`Ç)>Kwï¸|ñ`¾G9q†mLù>5ʹl>$âë8MNƾCƒ˜³¯è@>KÖÝVcA¾ImŠ£Nn><æ°ùošê>{©E](¾@sð/á >IôÄ9lD¿¾JlùÆ@`:>A´³ø¿ï%¾«Îï×Êì¾:†‚G>HUyZoÉ~¾K0m-|Ù>D—>7~½¾+[ ŽkML¾2‘ÁDX>F,&î¦:A¾KY´²¢>G‘å[´¾5g`Ͼ%Pøô1´/>C€;ʳÞ3¾Jäíf“‚8>HòЪGk¶¾<°#îMMµ¾½ •‘vë>@`ˆ¥uAd¾IÔ©‚È>JQXÇt¾A¬/)Ý„€>4)Û2”–>9½Ü3òît¾H+LpJk>KŠß’ËE¾D™¦Ru[>+îØÎj–>2¬zìF¾EîïÉc§>K6¾&X!ð¾GþÅÊœ>5تm­>#ûؽÓ¾C-síI>JµäÉó“ ¾Hý¾ø>>=:1=Òa=ú5‡QÁ¾?èÈ°£•>IÖ:㜾¾JQGßàp>A÷‰1xŸa¾GÊf ¾KÖÜ"ž>DæÔæ7o§¾.;>.âU¾0É^uÅÉ>Eo—8è¹ð¾Kq“¥ï>GSü¿yA¾7öêä×[¾ ònˆ´?>B‰J0Iƒ¾Jl¿N->I.á<^M¾>}S+W¤À=·ï^• Û¼>>RÁ‚ÎSB¾I ñkf‡o>JjŸ ‡"¾B•\þû v>![¨ìwU>6Ê‹ÅË̾G0ýŽbÂ>Jùꎇás¾Etdæ6õ‘>1ì¡äB/>-EÚ:»[©¾D¤NBÐ>J×Õ¥¼ž¾Gɤ µÞ>9gg¢F>J%¤²ú¾A«ˆ@¡k>Jæ¶ ¦Q¾IýÓ³×V>@6GB*©9¾^ØóÈ)‘¾;ûûŠÈÂŒ>H~G]÷ξJŽB]SK>CyTÚp ù¾&Å·ïÝÒ¥¾4ÆŠãu>FP ‚*F_¾J毣½”>F;.û$Ó ¾3Ó•–¬7m¾'=up‰Y>C‡!ðœŽÝ¾J…yàI—â>Hcÿà}†¾;¿y=¥fG¾¸M¦j>@1îÞqy¾IhøéÍe±>I㸈C‹¾AyÊÂ1I>tÿé,.ë>8Îƃ¹§È¾G˜ö"–7h>J®s–n`˜¾D™jìƇy>-ȆæX>0„Oô@p¾EcÓ9>J¹#´ ˾G'!ëV°Ÿ>7GÐÃîà]>á÷a;šn¾Bf¢k(j>JúZ¸£ ¾I…xp >? íXî9½õ9˜÷Ü)¾<Ö§:³>HŒÄ{B" ¾JBˆsÏ‘î>B÷¿I”œq¾$¶sÅ<¾4Áˆ¬SWž>F^Öé7‹¾J±w b1>EßBÊ‘–¾3 ûn:4¾(¬G¡‚>C‡1} “Õ¾JYBŠ+ì>H%ï8%êµ¾;\uoˆ;w¾q`û;?>@_F@j@¾I9idHn>Iµ_…?ÂX¾Af8”v¾Š>'v6±>8[‰hMÈK¾GT}lïôb>J€EÐË ¾Dœ¢‚±K>.·ûxÚGü>/}¯'¦Ï¾Dºv,ÔG>J~:²¾G4êëÄÏY>7û4C]ë>‡ÐnÂľA{u(âI>I«ÓÇF$¾I>êV>?ävP’˃¾Ï4UÑ…×¾;[H÷/w>H âQëL-¾J4fÃH>Cl2µEeZ¾(õk bÿ¾2àVJ7|>Eª—ìœ$À¾J¿Zú±>FK©{¤¾4ú }è¾#Š;çÙeß>B•ù™þ¾Iò&Íð¾>Hvx¹•œ[¾=JÙ+ ´½ÓàfÖhÝ>=Ì4«{U¾Hê ‰ž>IÛcIN„h¾BXYÎ I >"\ ´å¥€>5qº€v{3¾F`L h—>Jh¬ã¶Ê¾Esß[ì|>2fÇðI{>(³bT¾Cq~PökS>JÙox¾GÞMrÜ€>;FºZ·ç>‹<âÐ4¬¾?¸ã¹a¼>HêxÐM”»¾I>QÀŸ>Aišn8q ¾Q3¹š¾7x£^ï>õ>FäYdïªP¾JDƒÒHi“>D¸ñË1P¾0Iš©‰,™¾,ÆÕr½8•>D¬R¡¾J'6GE>GW”h5&–¾98Oq"\H¾- •§V>@•©„QœP¾I#w÷§F¸>I)MSi2¾@¦Í<‹·>ý¦¥íu>8ü³ÓZ›¾G>S_ã×>JvÉ왾D èYõïÂ>-Oo1Ù{æ>/Ï8ƒNG4¾Dˆ=¬îüÀ>J&ȹÌÂE¾Fè­Þ¸T„>7Ñ BHdˆ>öÍ0m•¾A¯ËËÛ>IBš5\¾HàÁá ¢¾>@Dȸ¬²¾ ~„Qjc?¾:óó´C’>GtÍáù)ã¾Iö×¹ñœÁ>C°s諯ù¾+žÑïľ0é© öÓd>DÍʲ­ƒ_¾Jƒ¶â³)>F–èËò>$¾6Ýü‰²i¾£ÊŒÆÝ>A`kñ‚ƒÊ¾IK×™M*>H«) ½Â ¾?kJKÿ°³>/"ï!>:—°nß>X¾G‹ò£ ÙÍ>IØT4?{¾Cj$T [>)½%a–Å>1lfµI¾Dé Ý&eH>J {Ä)¾Fe¡×¶>6c*õçU=>< ·ê2ö¾Ax¡ß¦÷Ö>ID¤Ý ò—¾H‹;À»q3>?íXÛÁ¾ÿå\ñZ¾:·ü%×Ô>G†,Ÿ¾IÁÓYm*h>COÙ®w¾)u:ê¾1p’åÂI>DÜW:&û¾Iø°>FVû#\ö ¾6a)C)þÆ8Ž­Ö>A`4㟡¾I-®y1>HßWƒÏ1¾?.yÉ¢>î ¦`p>:fì^……ñ¾GczM`BÓ>Iµ_«–ξCaö+º;^>*/ó)? >0÷}ÿü†¾D§ùñAÙ…>Iâ‰KG{y¾FjzŠšxE>6Öp䶥 >HéçSìÿ¾AãJýÄ>IIìíJ¾H•/l`£>?­Lë€YÞ¾ ø£Ñ9·¾9¢—å‡×h>G#N!ñ¾I°°ØVȘ>CŸÒà p¾+êG­ú¤B¾0ù4ÖÅò>DKlUÛ$S¾IÇ+ý0…>Fø°’Ë9¾7¿zíÏ;¾ÃunÀ`K>@› /º#¾HË^¾aL>H«õ5¬Kž@H‘žßM>‘¥bµ>8hö:$±¾FÃx®º¶>I±ñiL9¾DfGó_>.ùó9í>-‹PÙ ß¾Cë1æaZ>I¢¸O¹Å¾FílâÄ>9>.h*Ü>2K¡éw#¾?Òú'94Q>Hxêüh<¾Hب”6Ëí>@êMdQ»¾«x¸¨C[¾6¶eøú>F?-숬¾I³GK)þ•>D‘5çѾ1 2ÙPâ¾)/Ü5»mÁ>C N–In®ºœÓ>GRtÆšóà¾:ÚbÙ¾ü½þ?Ô…À/>=ý+^_ý¾H £Hü>I È&¾A¶ßw‰'>!àMèŽÂ>4†½4œ)N¾E‘Wðº‘ø>I­<‰ó6¢¾E8ÙèÕd>3cKÌ C>$> v´~¾BT”5>I#—Ï>ô#¾GÆÕܶ‰><ý»!ÇÌU½èü¾ôÓÎî¾;­‡-´—2>Gt³4¯ëϾIBŒÔCæ;>B§„’’D–¾'\]ÇüV‰¾1ÓÄ‘€3>D²’Á3¡¾I•åM¢ >Eõàâ¿N¾6þ$Ù’T¾~ Á,ò>@ö¢þæÂ÷¾H¸÷ÉŽ>HA=U”¾?téT-V>£zËÍ€Ð>8Ú–öVR¾F²mÍižì>IlÞwÝò¾C³ #Êê">-¼²í¬g©>-.É6Ãö ¾C˜ˆ«(¼>IbI§®ô¾F½ù3¿g>9br Ïæ> Àøââã¾?MÌÕ³P>H!Í$áNj¾Hµ¢W¡<>Am L¾n(£ÞKè¾5zïsÚÈ¢>E·©—f#¾I}æŽä™>DÎÌGµÝ¾2vbO*ò¾%˜ƒ3”ã>B;Õ"\ ¾I§$LA>G…*u¾¾;°„Ñ5WÁ¾GSõ¤¹(r>I·QÀO®¾B‰'ñh`×>'iØ«ì>1†SÁ ¾Dx‘RÒ->Ifõ5ʾE펚]§‘>6h#ãÎè>ŹEp# ¾@“Sšo}>Hr%[6¾H;|:?„”>@xZ™ ¾úAt: ¾7¬(\R§˜>FAy ñ¾IP‚ÏÂÄ×>Dß•=ñÓ¾03OßÓõÔ¾)뉾ZZ>BêiW <¾I|kî̪>Fÿ›»jž‡¾:Â(Cƽø¥Ò²§ô>=.†Òž ¾G—ä&$'>HÏ[ìÈM¾A×h2ÇIƒ>#öze–E­>3µ³§†²¾DڰͶ>ISÔÀã¾EsNH«º8>5y¢âÎ>'Ò¯±•Ø¾AÊa+™œ>HƒzšD± ¾Gñ•Î@Ï>>ú:( ¾ólRõj_¾8M$Õqz>Ff¯X(ã¾I+¹ ¸Üæ>C§€ª{T¾.¯¤mJb¾+Qžxºm«>CÏÝ¡’¾I Õ«ºµ>FÆ”z]­¾:Ÿ“U„ú¾K’äàÇ!>=nUþaüü¾G’.MË©~>H­*{³÷#¾A«J2ïœ>#p>³‹1>3^Xw´Ê¾DÎ%þÇç>I:úÜ&I¾E]HÀŒÔ¸>4ù¡TÄE¾>ŸÚ…!Ƀ¾@á³–ÁW>HdF‘`J¾Gä¸÷æŒ>? #Þw¾íæÚ­û¾8t™gê´>F3ؾI9ŽÎy>CÃóoj A¾/Ïäëø…s¾)Ø9ÉDZá>BÀmªb†¾HäM"ËÀ#>FßÆ艓²¾:¹á¨Ž·ã½ð·J6³U>H²¯V}€¾B:TòL•>%Ô‡>°0>1Êx8Šÿ"¾DT°Â°‘È>I¬í…²(¾EªôRëzü>6H:R§‡0>5Þ.F¾@2²±…Ã>HàÒntt¾H²£¢:>@3ýô3¾HžPª Z¾6;ëpá¤\>E¡Ì5¯Øw¾IÎW×üF>DR!ãÛr!¾1ÜÍ¿¾%{2z8Ù>AéŸá‹5#¾H™àžå6À>GA¯öôÏê¾<¤p ºßI=öÝZŠy–>:>¥ Ì\)¾F¬X¾¤X >HÒßɼ4°¾Bß®‰„>+5…«io>.)5R~ùž¾Cb]&kû¶>HçB&Æ‘¾FM8š>ûG>8Ý0“®>¾JýÕɾ=ÓÐá 9>GzžºÅ¬ ¾HeíN >A]2ÎP¯¾"·\,Ÿ|™¾3 o‡9U(>D 'B ©Þ¾IQ@àh¤>E>3GOa¾5"µã&Nˆ¾TµÊ©òa>@~2)¯1ؾH ßÆ4>GÒàºí)¾?¦£u(¤>xs YT>6§Ó–$ E¾E§%äL§æ>HïÀc¿|¾Dé}ž°u>1‚NÕ•€>%ÈÕ…%Ó¾AÞðúš@>H|aÎ*ã¾G%Cº><”ÞP}ÃV½ù“–¶PQ¶¾9äíšýä±>F|ßTî¦À¾Hº;EËõ>Bñ3&l¾, :‘'ÞÞ¾,ÄP-Ï0ð>Cµ(\Úu¾H¼©! >FdMÀ?±¾9’¬<Ú½þ¶„cém!><ÇŸù£§¾G&Æ›Ç@h>Hh½H–úù¾A H î>%l‘ZZíÕ>1Ž˜Ø +¾DñIR̶>HÚ6Ûù.¾E–§n!:l>6«É9ÚQÊ>¬+9¨=¾?R¯SI>Gªr¤…Žø¾HƒTuή>@–Vîj*¾jŠbxh9¾4jÍùÆIé>Dê?Ïkéó¾HÛ.±2¦>D©™ÄðÔ¾3è0 ß Ê¾ E|Ênà>@ÅNÝO,9¾H £M6ƒÍ>GŽ-Ñ“#¾>çp«QG>å© \>6øý¸?Jî¾EŸ¸Wx>HÆ+ƒç8¾Cíþ%¿í>1O}D’¨>%¥c¾_ñ¾Aº_:6BÅ>HR\>"èï¾GLÄÜv><¾'ÉÝ+¾²ÌcO\s¾9:Ùÿ!¶Å>F3§©«s©¾H õnm‰>CS ÓŠ¾-Ì?ÄDíy¾*v¸áÂä€>BŒz~Ëà¾H€[ÀI2=>F…ç„w¾:¶û¡ˆÀô½ÒÏ4YÛð]>;3dZɆ´¾F«¨·š%©>HpÙ3£B“¾BXX0Aü‚>)fJÉo«Û>.¼Fb÷×¾C=ÕÅL‹è>H›ßå@w{¾FÑ‘÷Ð>8Ø.¬h‘>Z]Öá¾<æãö5k>G ®h¤£M¾H9Ê6›:>AŸýB³±M¾%tTÎòɾ1;=ìÕ¢>CҾ͵~5¾H©Sô&Ø>E”èŠ5'¾7&“ ¾&\ù›Z>>XjÐî¾GT*bƒ‘>Gÿ­8Ö̾@÷álZ >!ü?ýœXð>2Ô0Rˈ¾DM‚Nu\>H¬ÀOº‡¾E#Séåà>5§R$’5>˜ó3™èh¾?±1}èq>GŒ :~Ÿ<¾GÅÌð"-è>@b^}L¾þð ôw$¾4*›ûƒÝj>D¯)Eky ¾H¨ÒßêÂî>D½yLaä¾4^Wþ9S ¾.2AÃÕ>@Esd ¾Gµ]5æZ>GÎw¯³”¾?Âô¯&”R>þøéÉeŽ>5Aà®%ÕC¾Dû8Qiq>H )Îåa¾DeçÅjT>3Nv[c…#> ±zÔŇ¾@©7¥ª–‡>GÒÜðªõâ¾G`\^—¢Ú>>ïÒª¼ ¾úwæ/Ú7¾6W®sÂ:>E3ÕȾH”ñ •Õ>D5¿w¸¾2x^é2Á¾"] í?ï¼>@óñ›C¾GåöôáÀ>G9©”q_{¾>KÔÖù1ç>ø?ýÓ+>6¼úÅ,Š¾EZÔ>“\<>H‰“æÁоCçDµä ó>1ÜøÉ}Ý>#ˆoPøÚ¾A#뜨&V>GïÿLž¹â¾G_rËÌ>=Ûˆ¤Œ¾öi bk¾7!$ƒ^è>Eq˜w·Eñ¾H¥çž?>CÃ0Š^‡ë¾1|Á^á¾$5XoH¦×>A=Pƒt—¾GñßÐÙ[_>G á½Ì)í¾=žÍ{‰Æn> cÌ9JÞ>7L¬KðÀ¾ExSú’òä>Hx,(„†Õ¾C²›+û²>1Y}n œ>$dýí{ø¾A?ñ°Ó[­>GìÍ4½Ø¾Gô «]A>=•áد$¾"°K^XF¾7=¢Üý*>Eo ØúgQ¾Hrå÷i>Cµÿné¾1s—–¿¶¾$SH¶­>A,ß‚t¾Gáµt+w>GeP¬Ã¾=¾W9dÉ>+†Ú>6õzÍÜJ¾EUÂHÀË>Horn~¾CÌ‘ò‚4>1ËaÎöÐW>#E\ a‹¾Aô;ø¸>GΗ-ñu¾G 6û€>>ýŽŽöæ¾)Q0=Jð¾6t d'xí>E,E,v¬y¾HlòÐm²µ>Cõ~ŠW ¾2^úIÁ«¾!ó¿ in>@½²c(™›¾G³Íaïm*>G-/>G®Ñ¾>ªXJËn>6Þ&»Ê—>5¹ŒˆŠG#¾DñêÀ×I>HjÛ™½¾D/•Î?0ó>3,ý†jvÉ> !ÿ$p¥¾@aC!Þè&>G( ÓX¾GNÎê@4È>?j˳Ò¾Fçªl8¾4ÂêÙ(>D¥xð¾Hg§r^iM>Dz.˜~¾43¤aÝÙ¾Ÿµ¾ÂŒ¶>?ÕúýåÁ¾G^£ÕtH(>GvÚ Ñhƒ¾@,>×U·@>XŽT„X>3ÿÈú¾DD‘ç>Ha_ÿŽÐ%¾DÓi&K>5r)Ç1y>ùúÁظø¾Ek<ú•&>Lì@C×ê¾J³ŽbÔx>;¶ÍPÊÌ>hXw8Œ¦¾CCÙAçÔ>LQ¾Þv"´¾K9ëþK>@bêØâT‚=äÊ¥¨ê3¾@ä*ÕÌÄ>Kj*tÄò¾LèMûÄ>BÃHg@¾Ž9²wÉ<¾<¨¿ä™=²>J7ÅÐÝúì¾L¸ —|“>Dò C&C ¾&½S)ƒM¾72P¢àÑ>H¹C‰[)â¾M~æÔ>FéZã“s’¾1Er覽‰¾1o±ˆZd{>Fò¼úÙÝT¾LøŽ]Ü>H£¾SísȾ7b^F©¾&ë†_?Íw>Dé% NÎæ¾L¨}#Ø>Jè—ø:¾<ƒäH$†=¾G¹#¤¦>Bž+q¥•û¾Kë¾*ä¿>KAj¿öÊ}¾@Ýt„˜Æ)=í¤Cé;Ë9>@±ôŽam¾JçÃ5°>L‹F6l¾CJ¨†¨>½ ÀÑB‰>:Áž£J[¾Iíÿá®>L¢“92·¾E}Ú ¯ø>*È_ †éR>4ôsÝ}–¾Gè7¥ÄË^>LЦÈz«¾Gs™}!6Ü>3zÝݨ¼;>-½AÿVﯾEóôÞP>L¥`OóîA¾I"P$ðt¿>9Y—Ó)4>!(±¸ÍϾC·e @îæ>LÖµaµJ¾J•½v±>>ï ª“¢>ß¡7D¾A6Ó²po>K:·Šâ8¾KŽ&îÞ >BHÌo¾vвñx³¾<ø¢’J>IþbÀ"¾LAWL]÷¬>Dxáú©È¾%«š«Ú–ª¾7Á{ô§Ÿ>HhO“‡ñ¾L•€÷‚>F›0ñø;G¾14»{´!ú¾0å é-i{>F}z¤{E¾LŠg¨õ˜>Ht¤‡q­'¾7a5=ÕoP¾$à#V¸èt>DDC"Iú|ËH¸¾=A·Z¥x)¾sØâ÷‹c>AÀ2}Èh¾KJÖê(¨¯>K'þv.¾AbŸoúÄ>_4AÏ„>=óGŠ ž¾J=Ó„ ù>KõÅž¨†¾Cê°ùß©>#Bìm¥x/>7ö Øü’Y¾H…ù|GL^ä„Œ¾F*ÃÇ»K†>01˜$IˆC…¾F–†‰\^>L`V3BʾHYô<>6¦•p’¢‚>%àþ;·©O¾DR&ÁJ‘7>Kùz¾ ÑÔ¾I¹¼&\r><ÀäÛ4ðÀ>iL_¯Â¾A¾\vRÄ>K&é9g ʾJô]㮃þ>A:±^Û;(¾µ±uâjo¾=Ä7h&¦>Ië.òÜ,>¾KÊ/¼‹¹Ô>C×R†£a—¾#Š†^<­¾7” Á7P>HJy·GɾL4ŒçŒB>F(Go ¾0’ûÿ9sç¾0ÿŠ6tï>FFs\vÎå¾L.Tþ;E3>H#”žŠQ¡¾7)«yäbœ¾$8ñøV”h>CæÐpÉ,¾K¸@{<ø>IÁ¤¢}¾ö¾=j°î*;X¡ x>A4ëŽì¯Ì¾Jлo§?Þ>J÷Nü}¾A›ß2dJ…>lübYVù>K¾ ±‡‹5¾D> óÐé9>&wJb—öš>5ö`·ÊX¾G´DÙ¸G¢>LØu–ãm¾FŽå°‰>21þ­!ÛÖ>.8uéÞn¾E‰ÔùEÓÞ>Kï,¨{¾H~åqS¥>8â{ÞJy–>ÙBÌ{üY¾Bþ¼q3¯>KR_>eÃ!¾J IJjëË>?1eº°=ä°.ó’ ~¾@*ªdÓ+>J>Ê1£šQ¾K#oÆüG>B}¦/ßÆC¾θ<'\¾9ééÀ(y[>H´’“›û¾KÄ‘”Š>EXôŽh ¾+óäî lã¾3>K.(ú>F¸r« h¾Ké±ÎEà6>GN°¹Ø¾5ô¿ùÂ<¾'ÑÕlW|\>DTZݼ ç¾KæN4¾>IÚ_ŸhÀ¾;¼W¬»È/¾î•è$­V>AŽ@7êˆÂ¾J´¼Ké_>J|ÿùyÿ¾@üQô>ŒG/ 1><å±vÒJ…¾I\:7e‹À>Ka@x³/¾CÍ´ÐÝ?Ô>%+Rºõb>6!¦“á”I¾G‰¯ËèÎY>KÂmGÖ‘¾FAþ¢™F>1ï>7r¡>-Ñôù§$¾EBC‰.ãc>KÉŠçÏC¾HNkðL3ð>8ü]Ô­>‘˜K£Â¾B‘â>{HÍ>Jó Ò:¾Iå¤æû>?“8épèǽԿN!$5u¾?^f¨êò>IÀp}En¾JüI¼?1*>BÉÆf¿ŽÏ¾ j¡D«‹¾8B @õ:®>H ‡§¾KjºÝL >EoŽ—†à†¾/UyX½´¾0ÿ!çG‘>EÚÈÚ|¤-¾K’q¢·Ó2>G¨÷éÇN¿¾6û10 W4¾"ºšÂ >C6Vl§¾K}‚û/p>Ij Ô½NÚ¾=Þ},ÙB½÷÷’‰Âc>@*8¡$é¾IïºÓ9/>J¨Ëåm.¾BÐ{ºCõ>­öué&P>9Ž;ÖR¾HM5Žù‚>KY¨'ï®u¾DÝ㌦Ã>,x…×X›¯>24ç¼Uس¾F%·`Ç)>Kwï¸|ñ`¾G9q†mLù>5ʹl>$âë8MNƾCƒ˜³¯è@>KÖÝVcA¾ImŠ£Nn><æ°ùošê>{©E](¾@sð/á >IôÄ9lD¿¾JlùÆ@`:>A´³ø¿ï%¾«Îï×Êì¾:†‚G>HUyZoÉ~¾K0m-|Ù>D—>7~½¾+[ ŽkML¾2‘ÁDX>F,&î¦:A¾KY´²¢>G‘å[´¾5g`Ͼ%Pøô1´/>C€;ʳÞ3¾Jäíf“‚8>HòЪGk¶¾<°#îMMµ¾½ •‘vë>@`ˆ¥uAd¾IÔ©‚È>JQXÇt¾A¬/)Ý„€>4)Û2”–>9½Ü3òît¾H+LpJk>KŠß’ËE¾D™¦Ru[>+îØÎj–>2¬zìF¾EîïÉc§>K6¾&X!ð¾GþÅÊœ>5تm­>#ûؽÓ¾C-síI>JµäÉó“ ¾Hý¾ø>>=:1=Òa=ú5‡QÁ¾?èÈ°£•>IÖ:㜾¾JQGßàp>A÷‰1xŸa¾GÊf ¾KÖÜ"ž>DæÔæ7o§¾.;>.âU¾0É^uÅÉ>Eo—8è¹ð¾Kq“¥ï>GSü¿yA¾7öêä×[¾ ònˆ´?>B‰J0Iƒ¾Jl¿N->I.á<^M¾>}S+W¤À=·ï^• Û¼>>RÁ‚ÎSB¾I ñkf‡o>JjŸ ‡"¾B•\þû v>![¨ìwU>6Ê‹ÅË̾G0ýŽbÂ>Jùꎇás¾Etdæ6õ‘>1ì¡äB/>-EÚ:»[©¾D¤NBÐ>J×Õ¥¼ž¾Gɤ µÞ>9gg¢F>J%¤²ú¾A«ˆ@¡k>Jæ¶ ¦Q¾IýÓ³×V>@6GB*©9¾^ØóÈ)‘¾;ûûŠÈÂŒ>H~G]÷ξJŽB]SK>CyTÚp ù¾&Å·ïÝÒ¥¾4ÆŠãu>FP ‚*F_¾J毣½”>F;.û$Ó ¾3Ó•–¬7m¾'=up‰Y>C‡!ðœŽÝ¾J…yàI—â>Hcÿà}†¾;¿y=¥fG¾¸M¦j>@1îÞqy¾IhøéÍe±>I㸈C‹¾AyÊÂ1I>tÿé,.ë>8Îƃ¹§È¾G˜ö"–7h>J®s–n`˜¾D™jìƇy>-ȆæX>0„Oô@p¾EcÓ9>J¹#´ ˾G'!ëV°Ÿ>7GÐÃîà]>á÷a;šn¾Bf¢k(j>JúZ¸£ ¾I…xp >? íXî9½õ9˜÷Ü)¾<Ö§:³>HŒÄ{B" ¾JBˆsÏ‘î>B÷¿I”œq¾$¶sÅ<¾4Áˆ¬SWž>F^Öé7‹¾J±w b1>EßBÊ‘–¾3 ûn:4¾(¬G¡‚>C‡1} “Õ¾JYBŠ+ì>H%ï8%êµ¾;\uoˆ;w¾q`û;?>@_F@j@¾I9idHn>Iµ_…?ÂX¾Af8”v¾Š>'v6±>8[‰hMÈK¾GT}lïôb>J€EÐË ¾Dœ¢‚±K>.·ûxÚGü>/}¯'¦Ï¾Dºv,ÔG>J~:²¾G4êëÄÏY>7û4C]ë>‡ÐnÂľA{u(âI>I«ÓÇF$¾I>êV>?ävP’˃¾Ï4UÑ…×¾;[H÷/w>H âQëL-¾J4fÃH>Cl2µEeZ¾(õk bÿ¾2àVJ7|>Eª—ìœ$À¾J¿Zú±>FK©{¤¾4ú }è¾#Š;çÙeß>B•ù™þ¾Iò&Íð¾>Hvx¹•œ[¾=JÙ+ ´½ÓàfÖhÝ>=Ì4«{U¾Hê ‰ž>IÛcIN„h¾BXYÎ I >"\ ´å¥€>5qº€v{3¾F`L h—>Jh¬ã¶Ê¾Esß[ì|>2fÇðI{>(³bT¾Cq~PökS>JÙox¾GÞMrÜ€>;FºZ·ç>‹<âÐ4¬¾?¸ã¹a¼>HêxÐM”»¾I>QÀŸ>Aišn8q ¾Q3¹š¾7x£^ï>õ>FäYdïªP¾JDƒÒHi“>D¸ñË1P¾0Iš©‰,™¾,ÆÕr½8•>D¬R¡¾J'6GE>GW”h5&–¾98Oq"\H¾- •§V>@•©„QœP¾I#w÷§F¸>I)MSi2¾@¦Í<‹·>ý¦¥íu>8ü³ÓZ›¾G>S_ã×>JvÉ왾D èYõïÂ>-Oo1Ù{æ>/Ï8ƒNG4¾Dˆ=¬îüÀ>J&ȹÌÂE¾Fè­Þ¸T„>7Ñ BHdˆ>öÍ0m•¾A¯ËËÛ>IBš5\¾HàÁá ¢¾>@Dȸ¬²¾ ~„Qjc?¾:óó´C’>GtÍáù)ã¾Iö×¹ñœÁ>C°s諯ù¾+žÑïľ0é© öÓd>DÍʲ­ƒ_¾Jƒ¶â³)>F–èËò>$¾6Ýü‰²i¾£ÊŒÆÝ>A`kñ‚ƒÊ¾IK×™M*>H«) ½Â ¾?kJKÿ°³>/"ï!>:—°nß>X¾G‹ò£ ÙÍ>IØT4?{¾Cj$T [>)½%a–Å>1lfµI¾Dé Ý&eH>J {Ä)¾Fe¡×¶>6c*õçU=>< ·ê2ö¾Ax¡ß¦÷Ö>ID¤Ý ò—¾H‹;À»q3>?íXÛÁ¾ÿå\ñZ¾:·ü%×Ô>G†,Ÿ¾IÁÓYm*h>COÙ®w¾)u:ê¾1p’åÂI>DÜW:&û¾Iø°>FVû#\ö ¾6a)C)þÆ8Ž­Ö>A`4㟡¾I-®y1>HßWƒÏ1¾?.yÉ¢>î ¦`p>:fì^……ñ¾GczM`BÓ>Iµ_«–ξCaö+º;^>*/ó)? >0÷}ÿü†¾D§ùñAÙ…>Iâ‰KG{y¾FjzŠšxE>6Öp䶥 >HéçSìÿ¾AãJýÄ>IIìíJ¾H•/l`£>?­Lë€YÞ¾ ø£Ñ9·¾9¢—å‡×h>G#N!ñ¾I°°ØVȘ>CŸÒà p¾+êG­ú¤B¾0ù4ÖÅò>DKlUÛ$S¾IÇ+ý0…>Fø°’Ë9¾7¿zíÏ;¾ÃunÀ`K>@› /º#¾HË^¾aL>H«õ5¬Kž@H‘žßM>‘¥bµ>8hö:$±¾FÃx®º¶>I±ñiL9¾DfGó_>.ùó9í>-‹PÙ ß¾Cë1æaZ>I¢¸O¹Å¾FílâÄ>9>.h*Ü>2K¡éw#¾?Òú'94Q>Hxêüh<¾Hب”6Ëí>@êMdQ»¾«x¸¨C[¾6¶eøú>F?-숬¾I³GK)þ•>D‘5çѾ1 2ÙPâ¾)/Ü5»mÁ>C N–In®ºœÓ>GRtÆšóà¾:ÚbÙ¾ü½þ?Ô…À/>=ý+^_ý¾H £Hü>I È&¾A¶ßw‰'>!àMèŽÂ>4†½4œ)N¾E‘Wðº‘ø>I­<‰ó6¢¾E8ÙèÕd>3cKÌ C>$> v´~¾BT”5>I#—Ï>ô#¾GÆÕܶ‰><ý»!ÇÌU½èü¾ôÓÎî¾;­‡-´—2>Gt³4¯ëϾIBŒÔCæ;>B§„’’D–¾'\]ÇüV‰¾1ÓÄ‘€3>D²’Á3¡¾I•åM¢ >Eõàâ¿N¾6þ$Ù’T¾~ Á,ò>@ö¢þæÂ÷¾H¸÷ÉŽ>HA=U”¾?téT-V>£zËÍ€Ð>8Ú–öVR¾F²mÍižì>IlÞwÝò¾C³ #Êê">-¼²í¬g©>-.É6Ãö ¾C˜ˆ«(¼>IbI§®ô¾F½ù3¿g>9br Ïæ> Àøââã¾?MÌÕ³P>H!Í$áNj¾Hµ¢W¡<>Am L¾n(£ÞKè¾5zïsÚÈ¢>E·©—f#¾I}æŽä™>DÎÌGµÝ¾2vbO*ò¾%˜ƒ3”ã>B;Õ"\ ¾I§$LA>G…*u¾¾;°„Ñ5WÁ¾GSõ¤¹(r>I·QÀO®¾B‰'ñh`×>'iØ«ì>1†SÁ ¾Dx‘RÒ->Ifõ5ʾE펚]§‘>6h#ãÎè>ŹEp# ¾@“Sšo}>Hr%[6¾H;|:?„”>@xZ™ ¾úAt: ¾7¬(\R§˜>FAy ñ¾IP‚ÏÂÄ×>Dß•=ñÓ¾03OßÓõÔ¾)뉾ZZ>BêiW <¾I|kî̪>Fÿ›»jž‡¾:Â(Cƽø¥Ò²§ô>=.†Òž ¾G—ä&$'>HÏ[ìÈM¾A×h2ÇIƒ>#öze–E­>3µ³§†²¾DڰͶ>ISÔÀã¾EsNH«º8>5y¢âÎ>'Ò¯±•Ø¾AÊa+™œ>HƒzšD± ¾Gñ•Î@Ï>>ú:( ¾ólRõj_¾8M$Õqz>Ff¯X(ã¾I+¹ ¸Üæ>C§€ª{T¾.¯¤mJb¾+Qžxºm«>CÏÝ¡’¾I Õ«ºµ>FÆ”z]­¾:Ÿ“U„ú¾K’äàÇ!>=nUþaüü¾G’.MË©~>H­*{³÷#¾A«J2ïœ>#p>³‹1>3^Xw´Ê¾DÎ%þÇç>I:úÜ&I¾E]HÀŒÔ¸>4ù¡TÄE¾>ŸÚ…!Ƀ¾@á³–ÁW>HdF‘`J¾Gä¸÷æŒ>? #Þw¾íæÚ­û¾8t™gê´>F3ؾI9ŽÎy>CÃóoj A¾/Ïäëø…s¾)Ø9ÉDZá>BÀmªb†¾HäM"ËÀ#>FßÆ艓²¾:¹á¨Ž·ã½ð·J6³U>H²¯V}€¾B:TòL•>%Ô‡>°0>1Êx8Šÿ"¾DT°Â°‘È>I¬í…²(¾EªôRëzü>6H:R§‡0>5Þ.F¾@2²±…Ã>HàÒntt¾H²£¢:>@3ýô3¾HžPª Z¾6;ëpá¤\>E¡Ì5¯Øw¾IÎW×üF>DR!ãÛr!¾1ÜÍ¿¾%{2z8Ù>AéŸá‹5#¾H™àžå6À>GA¯öôÏê¾<¤p ºßI=öÝZŠy–>:>¥ Ì\)¾F¬X¾¤X >HÒßɼ4°¾Bß®‰„>+5…«io>.)5R~ùž¾Cb]&kû¶>HçB&Æ‘¾FM8š>ûG>8Ý0“®>¾JýÕɾ=ÓÐá 9>GzžºÅ¬ ¾HeíN >A]2ÎP¯¾"·\,Ÿ|™¾3 o‡9U(>D 'B ©Þ¾IQ@àh¤>E>3GOa¾5"µã&Nˆ¾TµÊ©òa>@~2)¯1ؾH ßÆ4>GÒàºí)¾?¦£u(¤>xs YT>6§Ó–$ E¾E§%äL§æ>HïÀc¿|¾Dé}ž°u>1‚NÕ•€>%ÈÕ…%Ó¾AÞðúš@>H|aÎ*ã¾G%Cº><”ÞP}ÃV½ù“–¶PQ¶¾9äíšýä±>F|ßTî¦À¾Hº;EËõ>Bñ3&l¾, :‘'ÞÞ¾,ÄP-Ï0ð>Cµ(\Úu¾H¼©! >FdMÀ?±¾9’¬<Ú½þ¶„cém!><ÇŸù£§¾G&Æ›Ç@h>Hh½H–úù¾A H î>%l‘ZZíÕ>1Ž˜Ø +¾DñIR̶>HÚ6Ûù.¾E–§n!:l>6«É9ÚQÊ>¬+9¨=¾?R¯SI>Gªr¤…Žø¾HƒTuή>@–Vîj*¾jŠbxh9¾4jÍùÆIé>Dê?Ïkéó¾HÛ.±2¦>D©™ÄðÔ¾3è0 ß Ê¾ E|Ênà>@ÅNÝO,9¾H £M6ƒÍ>GŽ-Ñ“#¾>çp«QG>å© \>6øý¸?Jî¾EŸ¸Wx>HÆ+ƒç8¾Cíþ%¿í>1O}D’¨>%¥c¾_ñ¾Aº_:6BÅ>HR\>"èï¾GLÄÜv><¾'ÉÝ+¾²ÌcO\s¾9:Ùÿ!¶Å>F3§©«s©¾H õnm‰>CS ÓŠ¾-Ì?ÄDíy¾*v¸áÂä€>BŒz~Ëà¾H€[ÀI2=>F…ç„w¾:¶û¡ˆÀô½ÒÏ4YÛð]>;3dZɆ´¾F«¨·š%©>HpÙ3£B“¾BXX0Aü‚>)fJÉo«Û>.¼Fb÷×¾C=ÕÅL‹è>H›ßå@w{¾FÑ‘÷Ð>8Ø.¬h‘>Z]Öá¾<æãö5k>G ®h¤£M¾H9Ê6›:>AŸýB³±M¾%tTÎòɾ1;=ìÕ¢>CҾ͵~5¾H©Sô&Ø>E”èŠ5'¾7&“ ¾&\ù›Z>>XjÐî¾GT*bƒ‘>Gÿ­8Ö̾@÷álZ >!ü?ýœXð>2Ô0Rˈ¾DM‚Nu\>H¬ÀOº‡¾E#Séåà>5§R$’5>˜ó3™èh¾?±1}èq>GŒ :~Ÿ<¾GÅÌð"-è>@b^}L¾þð ôw$¾4*›ûƒÝj>D¯)Eky ¾H¨ÒßêÂî>D½yLaä¾4^Wþ9S ¾.2AÃÕ>@Esd ¾Gµ]5æZ>GÎw¯³”¾?Âô¯&”R>þøéÉeŽ>5Aà®%ÕC¾Dû8Qiq>H )Îåa¾DeçÅjT>3Nv[c…#> ±zÔŇ¾@©7¥ª–‡>GÒÜðªõâ¾G`\^—¢Ú>>ïÒª¼ ¾úwæ/Ú7¾6W®sÂ:>E3ÕȾH”ñ •Õ>D5¿w¸¾2x^é2Á¾"] í?ï¼>@óñ›C¾GåöôáÀ>G9©”q_{¾>KÔÖù1ç>ø?ýÓ+>6¼úÅ,Š¾EZÔ>“\<>H‰“æÁоCçDµä ó>1ÜøÉ}Ý>#ˆoPøÚ¾A#뜨&V>GïÿLž¹â¾G_rËÌ>=Ûˆ¤Œ¾öi bk¾7!$ƒ^è>Eq˜w·Eñ¾H¥çž?>CÃ0Š^‡ë¾1|Á^á¾$5XoH¦×>A=Pƒt—¾GñßÐÙ[_>G á½Ì)í¾=žÍ{‰Æn> cÌ9JÞ>7L¬KðÀ¾ExSú’òä>Hx,(„†Õ¾C²›+û²>1Y}n œ>$dýí{ø¾A?ñ°Ó[­>GìÍ4½Ø¾Gô «]A>=•áد$¾"°K^XF¾7=¢Üý*>Eo ØúgQ¾Hrå÷i>Cµÿné¾1s—–¿¶¾$SH¶­>A,ß‚t¾Gáµt+w>GeP¬Ã¾=¾W9dÉ>+†Ú>6õzÍÜJ¾EUÂHÀË>Horn~¾CÌ‘ò‚4>1ËaÎöÐW>#E\ a‹¾Aô;ø¸>GΗ-ñu¾G 6û€>>ýŽŽöæ¾)Q0=Jð¾6t d'xí>E,E,v¬y¾HlòÐm²µ>Cõ~ŠW ¾2^úIÁ«¾!ó¿ in>@½²c(™›¾G³Íaïm*>G-/>G®Ñ¾>ªXJËn>6Þ&»Ê—>5¹ŒˆŠG#¾DñêÀ×I>HjÛ™½¾D/•Î?0ó>3,ý†jvÉ> !ÿ$p¥¾@aC!Þè&>G( ÓX¾GNÎê@4È>?j˳Ò¾Fçªl8¾4ÂêÙ(>D¥xð¾Hg§r^iM>Dz.˜~¾43¤aÝÙ¾Ÿµ¾ÂŒ¶>?ÕúýåÁ¾G^£ÕtH(>GvÚ Ñhƒ¾@,>×U·@>XŽT„X>3ÿÈú¾DD‘ç>Ha_ÿŽÐ%¾DÓi&K>5r)Ç1y>ùúÁظø¾Ek<ú•&>Lì@C×ê¾J³ŽbÔx>;¶ÍPÊÌ>hXw8Œ¦¾CCÙAçÔ>LQ¾Þv"´¾K9ëþK>@bêØâT‚=äÊ¥¨ê3¾@ä*ÕÌÄ>Kj*tÄò¾LèMûÄ>BÃHg@¾Ž9²wÉ<¾<¨¿ä™=²>J7ÅÐÝúì¾L¸ —|“>Dò C&C ¾&½S)ƒM¾72P¢àÑ>H¹C‰[)â¾M~æÔ>FéZã“s’¾1Er覽‰¾1o±ˆZd{>Fò¼úÙÝT¾LøŽ]Ü>H£¾SísȾ7b^F©¾&ë†_?Íw>Dé% NÎæ¾L¨}#Ø>Jè—ø:¾<ƒäH$†=¾G¹#¤¦>Bž+q¥•û¾Kë¾*ä¿>KAj¿öÊ}¾@Ýt„˜Æ)=í¤Cé;Ë9>@±ôŽam¾JçÃ5°>L‹F6l¾CJ¨†¨>½ ÀÑB‰>:Áž£J[¾Iíÿá®>L¢“92·¾E}Ú ¯ø>*È_ †éR>4ôsÝ}–¾Gè7¥ÄË^>LЦÈz«¾Gs™}!6Ü>3zÝݨ¼;>-½AÿVﯾEóôÞP>L¥`OóîA¾I"P$ðt¿>9Y—Ó)4>!(±¸ÍϾC·e @îæ>LÖµaµJ¾J•½v±>>ï ª“¢>ß¡7D¾A6Ó²po>K:·Šâ8¾KŽ&îÞ >BHÌo¾vвñx³¾<ø¢’J>IþbÀ"¾LAWL]÷¬>Dxáú©È¾%«š«Ú–ª¾7Á{ô§Ÿ>HhO“‡ñ¾L•€÷‚>F›0ñø;G¾14»{´!ú¾0å é-i{>F}z¤{E¾LŠg¨õ˜>Ht¤‡q­'¾7a5=ÕoP¾$à#V¸èt>DDC"Iú|ËH¸¾=A·Z¥x)¾sØâ÷‹c>AÀ2}Èh¾KJÖê(¨¯>K'þv.¾AbŸoúÄ>_4AÏ„>=óGŠ ž¾J=Ó„ ù>KõÅž¨†¾Cê°ùß©>#Bìm¥x/>7ö Øü’Y¾H…ù|GL^ä„Œ¾F*ÃÇ»K†>01˜$IˆC…¾F–†‰\^>L`V3BʾHYô<>6¦•p’¢‚>%àþ;·©O¾DR&ÁJ‘7>Kùz¾ ÑÔ¾I¹¼&\r><ÀäÛ4ðÀ>iL_¯Â¾A¾\vRÄ>K&é9g ʾJô]㮃þ>A:±^Û;(¾µ±uâjo¾=Ä7h&¦>Ië.òÜ,>¾KÊ/¼‹¹Ô>C×R†£a—¾#Š†^<­¾7” Á7P>HJy·GɾL4ŒçŒB>F(Go ¾0’ûÿ9sç¾0ÿŠ6tï>FFs\vÎå¾L.Tþ;E3>H#”žŠQ¡¾7)«yäbœ¾$8ñøV”h>CæÐpÉ,¾K¸@{<ø>IÁ¤¢}¾ö¾=j°î*;X¡ x>A4ëŽì¯Ì¾Jлo§?Þ>J÷Nü}¾A›ß2dJ…>lübYVù>K¾ ±‡‹5¾D> óÐé9>&wJb—öš>5ö`·ÊX¾G´DÙ¸G¢>LØu–ãm¾FŽå°‰>21þ­!ÛÖ>.8uéÞn¾E‰ÔùEÓÞ>Kï,¨{¾H~åqS¥>8â{ÞJy–>ÙBÌ{üY¾Bþ¼q3¯>KR_>eÃ!¾J IJjëË>?1eº°=ä°.ó’ ~¾@*ªdÓ+>J>Ê1£šQ¾K#oÆüG>B}¦/ßÆC¾θ<'\¾9ééÀ(y[>H´’“›û¾KÄ‘”Š>EXôŽh ¾+óäî lã¾3>K.(ú>F¸r« h¾Ké±ÎEà6>GN°¹Ø¾5ô¿ùÂ<¾'ÑÕlW|\>DTZݼ ç¾KæN4¾>IÚ_ŸhÀ¾;¼W¬»È/¾î•è$­V>AŽ@7êˆÂ¾J´¼Ké_>J|ÿùyÿ¾@üQô>ŒG/ 1><å±vÒJ…¾I\:7e‹À>Ka@x³/¾CÍ´ÐÝ?Ô>%+Rºõb>6!¦“á”I¾G‰¯ËèÎY>KÂmGÖ‘¾FAþ¢™F>1ï>7r¡>-Ñôù§$¾EBC‰.ãc>KÉŠçÏC¾HNkðL3ð>8ü]Ô­>‘˜K£Â¾B‘â>{HÍ>Jó Ò:¾Iå¤æû>?“8épèǽԿN!$5u¾?^f¨êò>IÀp}En¾JüI¼?1*>BÉÆf¿ŽÏ¾ j¡D«‹¾8B @õ:®>H ‡§¾KjºÝL >EoŽ—†à†¾/UyX½´¾0ÿ!çG‘>EÚÈÚ|¤-¾K’q¢·Ó2>G¨÷éÇN¿¾6û10 W4¾"ºšÂ >C6Vl§¾K}‚û/p>Ij Ô½NÚ¾=Þ},ÙB½÷÷’‰Âc>@*8¡$é¾IïºÓ9/>J¨Ëåm.¾BÐ{ºCõ>­öué&P>9Ž;ÖR¾HM5Žù‚>KY¨'ï®u¾DÝ㌦Ã>,x…×X›¯>24ç¼Uس¾F%·`Ç)>Kwï¸|ñ`¾G9q†mLù>5ʹl>$âë8MNƾCƒ˜³¯è@>KÖÝVcA¾ImŠ£Nn><æ°ùošê>{©E](¾@sð/á >IôÄ9lD¿¾JlùÆ@`:>A´³ø¿ï%¾«Îï×Êì¾:†‚G>HUyZoÉ~¾K0m-|Ù>D—>7~½¾+[ ŽkML¾2‘ÁDX>F,&î¦:A¾KY´²¢>G‘å[´¾5g`Ͼ%Pøô1´/>C€;ʳÞ3¾Jäíf“‚8>HòЪGk¶¾<°#îMMµ¾½ •‘vë>@`ˆ¥uAd¾IÔ©‚È>JQXÇt¾A¬/)Ý„€>4)Û2”–>9½Ü3òît¾H+LpJk>KŠß’ËE¾D™¦Ru[>+îØÎj–>2¬zìF¾EîïÉc§>K6¾&X!ð¾GþÅÊœ>5تm­>#ûؽÓ¾C-síI>JµäÉó“ ¾Hý¾ø>>=:1=Òa=ú5‡QÁ¾?èÈ°£•>IÖ:㜾¾JQGßàp>A÷‰1xŸa¾GÊf ¾KÖÜ"ž>DæÔæ7o§¾.;>.âU¾0É^uÅÉ>Eo—8è¹ð¾Kq“¥ï>GSü¿yA¾7öêä×[¾ ònˆ´?>B‰J0Iƒ¾Jl¿N->I.á<^M¾>}S+W¤À=·ï^• Û¼>>RÁ‚ÎSB¾I ñkf‡o>JjŸ ‡"¾B•\þû v>![¨ìwU>6Ê‹ÅË̾G0ýŽbÂ>Jùꎇás¾Etdæ6õ‘>1ì¡äB/>-EÚ:»[©¾D¤NBÐ>J×Õ¥¼ž¾Gɤ µÞ>9gg¢F>J%¤²ú¾A«ˆ@¡k>Jæ¶ ¦Q¾IýÓ³×V>@6GB*©9¾^ØóÈ)‘¾;ûûŠÈÂŒ>H~G]÷ξJŽB]SK>CyTÚp ù¾&Å·ïÝÒ¥¾4ÆŠãu>FP ‚*F_¾J毣½”>F;.û$Ó ¾3Ó•–¬7m¾'=up‰Y>C‡!ðœŽÝ¾J…yàI—â>Hcÿà}†¾;¿y=¥fG¾¸M¦j>@1îÞqy¾IhøéÍe±>I㸈C‹¾AyÊÂ1I>tÿé,.ë>8Îƃ¹§È¾G˜ö"–7h>J®s–n`˜¾D™jìƇy>-ȆæX>0„Oô@p¾EcÓ9>J¹#´ ˾G'!ëV°Ÿ>7GÐÃîà]>á÷a;šn¾Bf¢k(j>JúZ¸£ ¾I…xp >? íXî9½õ9˜÷Ü)¾<Ö§:³>HŒÄ{B" ¾JBˆsÏ‘î>B÷¿I”œq¾$¶sÅ<¾4Áˆ¬SWž>F^Öé7‹¾J±w b1>EßBÊ‘–¾3 ûn:4¾(¬G¡‚>C‡1} “Õ¾JYBŠ+ì>H%ï8%êµ¾;\uoˆ;w¾q`û;?>@_F@j@¾I9idHn>Iµ_…?ÂX¾Af8”v¾Š>'v6±>8[‰hMÈK¾GT}lïôb>J€EÐË ¾Dœ¢‚±K>.·ûxÚGü>/}¯'¦Ï¾Dºv,ÔG>J~:²¾G4êëÄÏY>7û4C]ë>‡ÐnÂľA{u(âI>I«ÓÇF$¾I>êV>?ävP’˃¾Ï4UÑ…×¾;[H÷/w>H âQëL-¾J4fÃH>Cl2µEeZ¾(õk bÿ¾2àVJ7|>Eª—ìœ$À¾J¿Zú±>FK©{¤¾4ú }è¾#Š;çÙeß>B•ù™þ¾Iò&Íð¾>Hvx¹•œ[¾=JÙ+ ´½ÓàfÖhÝ>=Ì4«{U¾Hê ‰ž>IÛcIN„h¾BXYÎ I >"\ ´å¥€>5qº€v{3¾F`L h—>Jh¬ã¶Ê¾Esß[ì|>2fÇðI{>(³bT¾Cq~PökS>JÙox¾GÞMrÜ€>;FºZ·ç>‹<âÐ4¬¾?¸ã¹a¼>HêxÐM”»¾I>QÀŸ>Aišn8q ¾Q3¹š¾7x£^ï>õ>FäYdïªP¾JDƒÒHi“>D¸ñË1P¾0Iš©‰,™¾,ÆÕr½8•>D¬R¡¾J'6GE>GW”h5&–¾98Oq"\H¾- •§V>@•©„QœP¾I#w÷§F¸>I)MSi2¾@¦Í<‹·>ý¦¥íu>8ü³ÓZ›¾G>S_ã×>JvÉ왾D èYõïÂ>-Oo1Ù{æ>/Ï8ƒNG4¾Dˆ=¬îüÀ>J&ȹÌÂE¾Fè­Þ¸T„>7Ñ BHdˆ>öÍ0m•¾A¯ËËÛ>IBš5\¾HàÁá ¢¾>@Dȸ¬²¾ ~„Qjc?¾:óó´C’>GtÍáù)ã¾Iö×¹ñœÁ>C°s諯ù¾+žÑïľ0é© öÓd>DÍʲ­ƒ_¾Jƒ¶â³)>F–èËò>$¾6Ýü‰²i¾£ÊŒÆÝ>A`kñ‚ƒÊ¾IK×™M*>H«) ½Â ¾?kJKÿ°³>/"ï!>:—°nß>X¾G‹ò£ ÙÍ>IØT4?{¾Cj$T [>)½%a–Å>1lfµI¾Dé Ý&eH>J {Ä)¾Fe¡×¶>6c*õçU=>< ·ê2ö¾Ax¡ß¦÷Ö>ID¤Ý ò—¾H‹;À»q3>?íXÛÁ¾ÿå\ñZ¾:·ü%×Ô>G†,Ÿ¾IÁÓYm*h>COÙ®w¾)u:ê¾1p’åÂI>DÜW:&û¾Iø°>FVû#\ö ¾6a)C)þÆ8Ž­Ö>A`4㟡¾I-®y1>HßWƒÏ1¾?.yÉ¢>î ¦`p>:fì^……ñ¾GczM`BÓ>Iµ_«–ξCaö+º;^>*/ó)? >0÷}ÿü†¾D§ùñAÙ…>Iâ‰KG{y¾FjzŠšxE>6Öp䶥 >HéçSìÿ¾AãJýÄ>IIìíJ¾H•/l`£>?­Lë€YÞ¾ ø£Ñ9·¾9¢—å‡×h>G#N!ñ¾I°°ØVȘ>CŸÒà p¾+êG­ú¤B¾0ù4ÖÅò>DKlUÛ$S¾IÇ+ý0…>Fø°’Ë9¾7¿zíÏ;¾ÃunÀ`K>@› /º#¾HË^¾aL>H«õ5¬Kž@H‘žßM>‘¥bµ>8hö:$±¾FÃx®º¶>I±ñiL9¾DfGó_>.ùó9í>-‹PÙ ß¾Cë1æaZ>I¢¸O¹Å¾FílâÄ>9>.h*Ü>2K¡éw#¾?Òú'94Q>Hxêüh<¾Hب”6Ëí>@êMdQ»¾«x¸¨C[¾6¶eøú>F?-숬¾I³GK)þ•>D‘5çѾ1 2ÙPâ¾)/Ü5»mÁ>C N–In®ºœÓ>GRtÆšóà¾:ÚbÙ¾ü½þ?Ô…À/>=ý+^_ý¾H £Hü>I È&¾A¶ßw‰'>!àMèŽÂ>4†½4œ)N¾E‘Wðº‘ø>I­<‰ó6¢¾E8ÙèÕd>3cKÌ C>$> v´~¾BT”5>I#—Ï>ô#¾GÆÕܶ‰><ý»!ÇÌU½èü¾ôÓÎî¾;­‡-´—2>Gt³4¯ëϾIBŒÔCæ;>B§„’’D–¾'\]ÇüV‰¾1ÓÄ‘€3>D²’Á3¡¾I•åM¢ >Eõàâ¿N¾6þ$Ù’T¾~ Á,ò>@ö¢þæÂ÷¾H¸÷ÉŽ>HA=U”¾?téT-V>£zËÍ€Ð>8Ú–öVR¾F²mÍižì>IlÞwÝò¾C³ #Êê">-¼²í¬g©>-.É6Ãö ¾C˜ˆ«(¼>IbI§®ô¾F½ù3¿g>9br Ïæ> Àøââã¾?MÌÕ³P>H!Í$áNj¾Hµ¢W¡<>Am L¾n(£ÞKè¾5zïsÚÈ¢>E·©—f#¾I}æŽä™>DÎÌGµÝ¾2vbO*ò¾%˜ƒ3”ã>B;Õ"\ ¾I§$LA>G…*u¾¾;°„Ñ5WÁ¾GSõ¤¹(r>I·QÀO®¾B‰'ñh`×>'iØ«ì>1†SÁ ¾Dx‘RÒ->Ifõ5ʾE펚]§‘>6h#ãÎè>ŹEp# ¾@“Sšo}>Hr%[6¾H;|:?„”>@xZ™ ¾úAt: ¾7¬(\R§˜>FAy ñ¾IP‚ÏÂÄ×>Dß•=ñÓ¾03OßÓõÔ¾)뉾ZZ>BêiW <¾I|kî̪>Fÿ›»jž‡¾:Â(Cƽø¥Ò²§ô>=.†Òž ¾G—ä&$'>HÏ[ìÈM¾A×h2ÇIƒ>#öze–E­>3µ³§†²¾DڰͶ>ISÔÀã¾EsNH«º8>5y¢âÎ>'Ò¯±•Ø¾AÊa+™œ>HƒzšD± ¾Gñ•Î@Ï>>ú:( ¾ólRõj_¾8M$Õqz>Ff¯X(ã¾I+¹ ¸Üæ>C§€ª{T¾.¯¤mJb¾+Qžxºm«>CÏÝ¡’¾I Õ«ºµ>FÆ”z]­¾:Ÿ“U„ú¾K’äàÇ!>=nUþaüü¾G’.MË©~>H­*{³÷#¾A«J2ïœ>#p>³‹1>3^Xw´Ê¾DÎ%þÇç>I:úÜ&I¾E]HÀŒÔ¸>4ù¡TÄE¾>ŸÚ…!Ƀ¾@á³–ÁW>HdF‘`J¾Gä¸÷æŒ>? #Þw¾íæÚ­û¾8t™gê´>F3ؾI9ŽÎy>CÃóoj A¾/Ïäëø…s¾)Ø9ÉDZá>BÀmªb†¾HäM"ËÀ#>FßÆ艓²¾:¹á¨Ž·ã½ð·J6³U>H²¯V}€¾B:TòL•>%Ô‡>°0>1Êx8Šÿ"¾DT°Â°‘È>I¬í…²(¾EªôRëzü>6H:R§‡0>5Þ.F¾@2²±…Ã>HàÒntt¾H²£¢:>@3ýô3¾HžPª Z¾6;ëpá¤\>E¡Ì5¯Øw¾IÎW×üF>DR!ãÛr!¾1ÜÍ¿¾%{2z8Ù>AéŸá‹5#¾H™àžå6À>GA¯öôÏê¾<¤p ºßI=öÝZŠy–>:>¥ Ì\)¾F¬X¾¤X >HÒßɼ4°¾Bß®‰„>+5…«io>.)5R~ùž¾Cb]&kû¶>HçB&Æ‘¾FM8š>ûG>8Ý0“®>¾JýÕɾ=ÓÐá 9>GzžºÅ¬ ¾HeíN >A]2ÎP¯¾"·\,Ÿ|™¾3 o‡9U(>D 'B ©Þ¾IQ@àh¤>E>3GOa¾5"µã&Nˆ¾TµÊ©òa>@~2)¯1ؾH ßÆ4>GÒàºí)¾?¦£u(¤>xs YT>6§Ó–$ E¾E§%äL§æ>HïÀc¿|¾Dé}ž°u>1‚NÕ•€>%ÈÕ…%Ó¾AÞðúš@>H|aÎ*ã¾G%Cº><”ÞP}ÃV½ù“–¶PQ¶¾9äíšýä±>F|ßTî¦À¾Hº;EËõ>Bñ3&l¾, :‘'ÞÞ¾,ÄP-Ï0ð>Cµ(\Úu¾H¼©! >FdMÀ?±¾9’¬<Ú½þ¶„cém!><ÇŸù£§¾G&Æ›Ç@h>Hh½H–úù¾A H î>%l‘ZZíÕ>1Ž˜Ø +¾DñIR̶>HÚ6Ûù.¾E–§n!:l>6«É9ÚQÊ>¬+9¨=¾?R¯SI>Gªr¤…Žø¾HƒTuή>@–Vîj*¾jŠbxh9¾4jÍùÆIé>Dê?Ïkéó¾HÛ.±2¦>D©™ÄðÔ¾3è0 ß Ê¾ E|Ênà>@ÅNÝO,9¾H £M6ƒÍ>GŽ-Ñ“#¾>çp«QG>å© \>6øý¸?Jî¾EŸ¸Wx>HÆ+ƒç8¾Cíþ%¿í>1O}D’¨>%¥c¾_ñ¾Aº_:6BÅ>HR\>"èï¾GLÄÜv><¾'ÉÝ+¾²ÌcO\s¾9:Ùÿ!¶Å>F3§©«s©¾H õnm‰>CS ÓŠ¾-Ì?ÄDíy¾*v¸áÂä€>BŒz~Ëà¾H€[ÀI2=>F…ç„w¾:¶û¡ˆÀô½ÒÏ4YÛð]>;3dZɆ´¾F«¨·š%©>HpÙ3£B“¾BXX0Aü‚>)fJÉo«Û>.¼Fb÷×¾C=ÕÅL‹è>H›ßå@w{¾FÑ‘÷Ð>8Ø.¬h‘>Z]Öá¾<æãö5k>G ®h¤£M¾H9Ê6›:>AŸýB³±M¾%tTÎòɾ1;=ìÕ¢>CҾ͵~5¾H©Sô&Ø>E”èŠ5'¾7&“ ¾&\ù›Z>>XjÐî¾GT*bƒ‘>Gÿ­8Ö̾@÷álZ >!ü?ýœXð>2Ô0Rˈ¾DM‚Nu\>H¬ÀOº‡¾E#Séåà>5§R$’5>˜ó3™èh¾?±1}èq>GŒ :~Ÿ<¾GÅÌð"-è>@b^}L¾þð ôw$¾4*›ûƒÝj>D¯)Eky ¾H¨ÒßêÂî>D½yLaä¾4^Wþ9S ¾.2AÃÕ>@Esd ¾Gµ]5æZ>GÎw¯³”¾?Âô¯&”R>þøéÉeŽ>5Aà®%ÕC¾Dû8Qiq>H )Îåa¾DeçÅjT>3Nv[c…#> ±zÔŇ¾@©7¥ª–‡>GÒÜðªõâ¾G`\^—¢Ú>>ïÒª¼ ¾úwæ/Ú7¾6W®sÂ:>E3ÕȾH”ñ •Õ>D5¿w¸¾2x^é2Á¾"] í?ï¼>@óñ›C¾GåöôáÀ>G9©”q_{¾>KÔÖù1ç>ø?ýÓ+>6¼úÅ,Š¾EZÔ>“\<>H‰“æÁоCçDµä ó>1ÜøÉ}Ý>#ˆoPøÚ¾A#뜨&V>GïÿLž¹â¾G_rËÌ>=Ûˆ¤Œ¾öi bk¾7!$ƒ^è>Eq˜w·Eñ¾H¥çž?>CÃ0Š^‡ë¾1|Á^á¾$5XoH¦×>A=Pƒt—¾GñßÐÙ[_>G á½Ì)í¾=žÍ{‰Æn> cÌ9JÞ>7L¬KðÀ¾ExSú’òä>Hx,(„†Õ¾C²›+û²>1Y}n œ>$dýí{ø¾A?ñ°Ó[­>GìÍ4½Ø¾Gô «]A>=•áد$¾"°K^XF¾7=¢Üý*>Eo ØúgQ¾Hrå÷i>Cµÿné¾1s—–¿¶¾$SH¶­>A,ß‚t¾Gáµt+w>GeP¬Ã¾=¾W9dÉ>+†Ú>6õzÍÜJ¾EUÂHÀË>Horn~¾CÌ‘ò‚4>1ËaÎöÐW>#E\ a‹¾Aô;ø¸>GΗ-ñu¾G 6û€>>ýŽŽöæ¾)Q0=Jð¾6t d'xí>E,E,v¬y¾HlòÐm²µ>Cõ~ŠW ¾2^úIÁ«¾!ó¿ in>@½²c(™›¾G³Íaïm*>G-/>G®Ñ¾>ªXJËn>6Þ&»Ê—>5¹ŒˆŠG#¾DñêÀ×I>HjÛ™½¾D/•Î?0ó>3,ý†jvÉ> !ÿ$p¥¾@aC!Þè&>G( ÓX¾GNÎê@4È>?j˳Ò¾Fçªl8¾4ÂêÙ(>D¥xð¾Hg§r^iM>Dz.˜~¾43¤aÝÙ¾Ÿµ¾ÂŒ¶>?ÕúýåÁ¾G^£ÕtH(>GvÚ Ñhƒ¾@,>×U·@>XŽT„X>3ÿÈú¾DD‘ç>Ha_ÿŽÐ%¾DÓi&K>5r)Ç1y>ùúÁظø¾>³1§H¯>G ‰þ#€(¾G¢¸€‡þè>@·ÊÝËϹ¾"1‰¯ Mì¾2‹Ët°>CÌÑÁU´¾HT´ Š>E8€'õû¾6æ œê¾˜n¶>Zé>=W üŔ۾FÒNÕ‡ º>GÐlô4©¾AU®ÑwÄþ>%¯–ÐÐW\>0a«»lÏl¾C;GmS>H>5¼Ö‘ú¾E¦Ú’^pá>8Œ‰5|6=þQ¯2´÷3¾;¼ŸV¢)>Fpù—žþؾGû¢¸>¬á>BÌ°MR¾)¡Žþ³Y«¾,ÏŸ•èf>BŽsàVÒ¾HFi)±>F^¼bý¾:_üá=ÒÜ 80/¨>9ßy(&_«¾EøcE–.>H!˜uìoþB¿ÄÙH>.쬟b¶>(Sš—‡/¾AÃ57íЫ>Gä‹9¦P¾FŽÈ'B>Ed}`¢¨¾H<ÀÆ;->Cƒêyx[E¾1h*j䡾#HócÅ¢F>@Ö„wïA¾G™g¾>õâ>Fÿó¨£gd¾>tðêñ`>®ìè –>5M™a€.S¾D°ø—Yˆl>HGÌsî£Ç¾DM}˜,>3þ¨¨76>^X”¬Ç•¾?‰™ô* †>G3ɘ ÷¾Gh»3©”Ï>@T7'~)¾ «¶¡ÍAܾ2“‡¶Ÿ&·>CÚ,ôv–¾H<î¡÷oš>E!‘@Ýã¾6¼…[Û š¾Tcã>=×r¸&¾F­ÞñÏ„>GÃUE‰áü¾AuËÉ´´]>&ï#³6Šà>/:©+d$¾BÜðª6µ>Hž#‘&þ¾EÕÉ, ×>9š‘¸$:×=Ú^4†“&÷¾:Kø¶ìP>Fæ8 íþH„îe¯÷>B™¬$ü¼¾-–†"N+¾(cæÕ›>A²›;¸¾GΗ9×Ãt>FˆàVšæ­¾<Ö8Ž°g> ‡`â"ð~>7(Á®É4L¾E*0‹§×>H0ä¸ÑÑì¾C¸ž(9ξ>2I&¶ LÈ>!Ô—ïUÙ¾@Yd›Œ»„>G^M(žßü¾G&þSù>?‹1µb,ç¾åÕÊíZ¾3©t—¶±·>D!á5øá¾H4–t,8ø>DÊɻႾ5å·XO¾;[Vlµ>=™°ù¬8¹¾F¾SÞ…,t>G§ÿn$i¾ABO$Ë°'>&!9ð1Y>/š(‚åp_¾Bä5(P±>H "há¾EÇtî>9“ iù÷ÿ=Ó!šÒÜDh¾:h—ìTà>Eç¦ñ`1±¾H[߆>B´ÛýBξ.Š ô ؾ'&ãi²>AlaÌd̾G¯sâI^j>F¥³ ß,¾=Bô¿Ù/>Ü7sàë¼>6 òF5¼¾DÓ¢¾ ²›>H,in¢9ê¾Dïµ›S>3–ªÊ>ÿLŠË³÷¾?mn3û>G…±€¾G[ud¬ýý>@qýx­¾!áàÊùàB¾1¿:ÞôY¬>C|ÿ‚@¾H4Jn>EQÜ9è1Q¾7ó^j>lö¾Ç—h°æÐ>;y‚Ê·Y¾F8ÍR+½Ž>GÝÚhRþB.=°6”Ì>+§ÄÏ[ÃM>)äÇFçžAÞþ¼‘Á>GÈz‹_+P¾Fejîš “>EÖ–MÔ¾H ö¤ç>CÌâ7L{¾2ÍïÆ‘±Ž¾ÿêbÿÂ>?졯x¾G'ó‰rÚB>GA‘ç»t…¾@;«[ rî> õDÁº¼ô>2§‹ølоC’,¢·³ƒ>Hõ!:ö¾E? æy*,>7Èø¥¬ >–ÈûI¾Þ¾;€Þäà>F1ïä@Fa¾GÙJÏŽo>B5ø´¸¯¦¾,³-4¾)ZT)Ðec>A¾ºêd±·¾Gºh(lÑÁ>FuêUïÞ(¾<¨è&C> 'tv–Ì>6{H_p¾DÞ?^Åõ>>HBuRŒå¾DõgçÆð>3—z>E?‹²K'¾?$Z¹/>Fû]5²ý¾GbÀ›V>@§$àq¾#`KŒËÚx¾0ḼŒ>C&»åt÷ñ¾H¢$K>E’ ®¶U¾9£J ½âüÈF‘~>:nîè¯x¾EÒÆbØZ>Gô:³eÉB¾BÊÑv&å¡>/¤Ä¸$«¢>%ƒphÉlH¾A¶€1>GËê’çÿ¾FÑAhÞÓÑ>>c¥–VK¾œnNù¾4_€8ºC©>D9¬’ý†¶¾H[$2R‰>D­ùGû9¾5é"¢Æ·¾½~*žO¼>=WÇvß¾F‚³2[ ­>G®ê-xÛ¾A¨Mã!y>)úaâ´>, ¥ž¨õȾB+ ¢G>GÏBƒCì¾F9ª‹¤:>;ÍZ”¡ÿê¾Ì%Ÿí¾7- Ü ý>E\œæþ¾Hp•ðs">CÙiLŒ8¼¾30T‰Vëÿ¾‰èAâSZ>?Kxªx¾Fü-)ƒt>G\ÀÓÇ°¾@©-è+>#¬¿GÊÇ>0žÆN xä¾C§Ç‡6>GúQê|tµ¾E­¼ºÈ@Ê>9¤­Û5½Åð.~â ¾9Yûz¥Ò,>EšoeØ(¾GÿL?¨@ß>C"ÜÇ –é¾0û¢h¶»H¾"Þ;E¶ä >@’<)­¾GKQo‰>GìÈÂ[¾?µ+E–­ >îÑ6ýS>2“˜ÕKýe¾C£›ã‡Æd>Hê袓s¾E8øº§±>7õyÐP9=ü£Æ¨zÿ¾:îÏ^Uõ~>EþBDYz˾Gã:>B”ûÙŒ”¾.´¾‘CÒ¾&*6|Aÿ×>Aì ™œµ¾G}8ˆ`<í>FÐ!ú½ÜÚ¾>‡ |â½x>õ•¢Ù£>3í€ ñ ¾D »±=œÑ>HÂð宾Dã‚Z€²>6Í„–RO><ñrØ‚¾;ò’Š,üF>F;!ô  ¾GÍÁV;ªÛ>B8[œ/¾,¢ B˜Æ¾(7^Ãæ>ArzÞ ´"¾G˜›"Ù>F§Ûä¾=Ò2Ï0>ƒG¥² Í>4¬ýªâV¾DBšþÝþ£>H|‚‰œ¾D¶yE_=>66e¼.ÿ> MßÇ|Ÿ'¾FWÇ[5ä¾Gêz Ú>BX©õT¾+ÄVycýÔ¾)$‹Ø$À>A“b(ÓS¾G¡!pž6>Fšþ<{ˆ{¾=Ÿj³‡ä>¨Žò|<>4×\硾DMÉý#ù>HûkG°”¾D²[6//èdHù> O ?û! ¾FTh×ÞÒ¾GÆ‚/O>B! ÿ’¾,'.1q²Ô¾(p׶á>A{û•å¾Gš¾çÞ9>F¬F"Þ—¾=ï„B‡ Ì>VBG_>4o#Wì¾D,‹Wa§‘>H“'…¾¾DØ–—§=~>6»@+Æ9>nom°¾;Úݺ)>F1¤OÜ’²¾GØ&s>BbŽ6™›c¾-ƪÕâ«S¾&ÝFNf(>A,*f毾G‚¦Ð¤ ì>F×Ùý—ñ¾>¾++êhû>–_ħ¢¯>3m p%^¾CÛ_ìäÛ×>HU;áFw¾E'èat|>7ÙäH/¥=ûSÌ3'ô¾:Âz÷¶ü>Eí[¶È`¾GóPÖEÄj>BÚW˜îme¾0MÆœUX¾#äÕ•Kƒ>@ûk|y%¾GRÎ×ÄôP>GXxA¾@æÝûˆy> ·\šŠm>1Î!,æ¾CWŠG÷‰¿>H 9 œeT¾Eš ø‚œ>9C.2º4½Î«,4I¡¶¾9‚gÉæ>E}Çã|õÛ¾Hå¾ö >CûËÂG¾2PÚ•6EÚ¾/2q÷i°>?™¡ºš½¸¾Gb}ÐÇé>GlÔ+s¾@âm«Y>%aê·Ž‰ì>/ç«WK¾B˜.íŸÙA>Gèc…p–¾F%%:¶l·>;©kó)¿Ä¾Ï[Ÿ7—¥¾6ÍXÆèÖ°>DÛi­£W¾H%dÕ,í>DKÛÙrD™¾4ä^–Jç¾òp|"Ï>=d/†'JǾFù‡Ëí>G¿í‹4X¾Aîj%›>+CÖSdœ‡>)<“ÅQ t¾A’^jpßè>G¦(jÆšn¾F¿tÆä{ñ>>Dþ¾Ú–h¾qoÉW¾3ÚLMèÎ>Cû¥u{¨¾H$cùþ¦>E/c/ÁI…¾7÷EÄÅW‡½÷ü´äÔÐ>:…tæÃX·¾EÝWWkÔè>Hw˜ÄyW¾C‹B<<>1&åÕQ“>!÷¤@L”¾@<ýp%Ní>G4¤:­FO¾GWÆ$u%>@œu°‚j¾#ø-æ»û/¾0/þçjý&>BÌ£ º¾Gú¡Äk>Fi ÖÖI¾;zçW´œð>\”ĩ>6ídј§Û¾DåI¦Ô>H0·Å!z„¾Da1üN!>5* URÏ>9:±¾=wbéI€>F~º´ãX/¾GØäþ4S>B4GA.Z¾,âéú}¿ü¾'„¸àÐ>AAáîí¹è¾G“¹ ' >FüW0Ý6o¾?Oó£®<>效%@>2ºP舾C’—¹+…>H"¤Üa\—¾E¡DœU©>9•Î•n!{½Úø¶ÂD½¾8ݱ¨¿u>Ep­qëÈ„¾H,È“–°«>CÖv“íú¾3d©ïq¾@¢àUkZ>>šôä¾¾FتþÜ·>G¶›K—¯ª¾A¦TžÆ& >)¸)y"Í>*¬9Ò·«„¾AÑœV|ß>GÄgð§Uæ¾FÆË †¼”>>EÙ¸õÜf¾›ønÍÎÀ¾3Ä2Šoí>Cõ¡‘ [€¾H67Ñï/d>Ef›SWc1¾8²²¡½ã‰i4i>9¼üžØ…¾E®•8d½½>H-b Ð ¾C Äðmÿ:>2¸R€¹>™‡Í"¾?&¡ñaZd>FúʪåN¿¾G±6¨k#>AÕœ®T¾(ç%`1Ä$¾+w¥åìö>>Aö'/p £¾GÔØ…×>FÅxBIËñ¾>.A!½Â>*Só‡>3Û—äŠ0¾Cþ‚"n¸>H?ðò\0Ö¾EuXœnþ>8ÝG¾_F=Ú`jš™ÑL¾9‘i$ò‹M>E¦qÌ1¨‹¾H;>úº>CÇÚ*™ ò¾3-ù¢?Ö¾í"P>>ÁîŠüÃT¾Fê¢E6¶>GάìB¾AÊÁ rc!>*z›‚Чù>)ãñj0ž¾A°RÓ¥†?>GÇ•]óö¾Fû>Q%>?"RÊE²¾s[ð®M¾2Ò‹ô>L>C¬ïPq¸¾H?@àvrÇ>EÍBÏc¾:¿ñÒžh=ðz|V"<>8Usç^ ¦¾EThO[?D>HS(ˆÆ‘ˆ¾DIŽ$ÚO]>4ÅÜEêN’>!¯+kä¾=bâ­±¨9>F –ZdþϾH×–Fá>B|ÀJöDû¾.n7¦ý÷¾%áœ!eÜ>@ø†É6ã0¾G’´ù|tw>G_{F¹°í¾@m߮ɟ[>"ü³î¨+>0œ96âľBö™Ý³…>H(/e\ξFc5¬fNÛ>Dª+?"(¤¾Hdú{k;>EfÀ¤ýK¾7u ¥· -¾I…3.Ý>:ñÊœžCN¾F =>HIFNíʾC‰ç½é>2WC)%>´†z¨Êå¾?}|¢èTï>G ±A'ç¾GÜسA$§>A½f(»˜l¾*®UŸÎé¾*Küb¥-<>AÇŧŒ4æ¾Gá¾ûœó>G ôËzç¾?yV¹¡<¡>Ÿ–C»Ì>2]hOó”)¾CŠ:›|ø>HTTѪ$¾F¡‘Áiò>;!À\|1•¾ðÙ»Qü¾7JHÕ‚xš>E(Œ’e ¾HwkY Ec>DÙ¦sWȾ6…è$³Ù.¾ÛOÔ>;Ú‡‚Ÿã¾FP¸dFå(>HQC8ž¾C[×ýÔ'È>1·ÛÍJ¿> µ'p´P¾@ÇcxcÝ>GG°'똾Gâ¡ñuó>A©Á'm3¾)‘±~+ì¾*ÔÁ„%R>AäÍZ*»–¾GøQ7‡>G3M•^¥÷¾?›S­\n&>"·ºîŽë>2C÷Ó8¾C!>«}>HdUà/Ú¾FE]F4£4>;˜ÇN„i•¾:A›î¾6Õá-ž)n>Døï÷4Q¾HŒÝ¤à4>E!Ž#™[U¾7`5û=-¾hFóu™>;Ît\Ö¾F)ô¬Ím>HuÏrjó–¾Cʵ×ÀE>2úš²à[>>©†Xš¾¾? ½,Âò¹>G3Ô´¾H"1¯ý€v>BIÿˆyÌ5¾,öãÝÇYö¾'yJd›i>AOîСW˜¾GÖžßs‘>G– #Ѿ@¢ƒÆP2>#Ôž­} >0B5M¾BèÀ8b’ð>HRå%OÒѾFÕÎþÇ>=ºû#ý5¾d‹‚ò£L¾4Ž´RçG¼>DQƒⲃ¾H˜‰™×ß<>EæÌ_—ä¾9ûÅ„,ZV=鵘 Y-R>8›‘!x´¾E†dBÃY“>H¦’¦Öx9¾DËC›ðJ>6*±·Á> Aí0]¾FŠf«ñ× ¾H‚ªƒ©%>C‹Lkí‹n¾25YÂH¾ Éu|Û¶>?ÞV¢Gð¾G[öDë‚>H->Jm ¾B*9YóÝ>,"0•á”>(u1&j“I¾A†Ó€19>GüZÄ'Vx¾G¬šW µè>@­b¡]õ¾#á¿sÌľ0GæÌa ñ>BôÅJ–®Ú¾Hlä°EÓ8>G± Mš»¾>2ÏIÈþ>u‰Vˆ>4!WÚÓ¾D:žp*æ>H±,‘Ó¾F3بÔä>:æ'½!ú½ý¹€I¾7Ç™‚°»8>EWžjô¾¹¾HÉ©õwߦ>EAýxÜ ¾7}r¡ºKv¾1ˆ–Ÿf>;19B¾FL«9çd>Hº±aê¶ì¾D5B²R>4Z˜=×;>!i/Úï¾>`ô/~Àé>G¼f²ôá¾H„Vñ›€G>C wÑJÄ;0ygé]¤ø¾#’õžÛÿ)>@§¢Zñ5ê¾G¾Â hÍ»>H,‹]áEm¾AÑ®±—î>)ÚI&*p>*Õ‰¢O̾BB˜Ü¨>H?£öˆH€¾G³;SF>@‚®%eÎѾ"ÅéôUO[¾0âÀLçÚ>C7fÅlPâ¾HœíÞÿÇ>G‰†“Z¾>M}¸XÌÛ>„e•ubÅ>42<ÌÒWZ¾DP#"ˆ>HاÂQäu¾Fnn%šÍ>;|ù5œº…¾e_€Xؾ7R­‚(Ç>EGÎ ¾™f¾Hô¿Àýž8>E©Ã*\¨¾8Ÿv¶ùzŠ½î©ÒÇ—kã>:GŽ`øj¾F"AÞòÒc>Hóƒ%>à0¾DÎ2¦¾¥q>5µhæX˜>d ¾= q*ò²:>FÝš:Xã´¾H×tKµY>Cãõ:Ÿ®2¾2ÉÆ(¨žT¾Êçä¼^^>?ž¢¾8¾G}ÈòÁ¨>H¡ïíٗϾBê k}¸>/·³Ž%‹>%ž¤ò ¾@ÿ|Ã')Í>Hbd©Yk¾HVB ÕÑ>Aæ&Co²/¾)ëa8ƒ%Ⱦ*û @1 U>BchÞ\[¾HlªZ:=>Gö‰:D#7¾@×ÃÊÏ:>$+©Is‡>0Rgί¾C¦6%>H¾rý騾G„ò]qR>?ˆw!°¾çAYƾ3Çz|êH>D94©(¾HûdoÃÉ>GÞ””OÀ¾=U⦷¨>z‚‡ˆ2>5“ú™øî¾DØwKœIÜ>I!° uåÿ¾Fuju±5m>;![ÅU3½ý0»¨ÌÖC¾7ÿ8 ØI!>E—º q¨¾I6¥yÏ$>EÛÏAd(—¾8ébáh&¿½é3ˆÇF²>:F¢DÌÝc¾F@þrÛî>I94Úiý¾E8öm[÷D>6¶Ù¿êÏ3> hj8ƒ¾FØY+ŠŸI¾I-C“…5>DŽëîFÕ¾4‡æç¾ìƒU÷h*>>jgޗν¾G[ìQZÁ}>IkhÇe«¾Cßc©ÊÎ>2bÁyT†ë> qû´Mɾ@#ô÷nŒ¸>GÏì©»$R¾Hìá²Cw>C,6ýžûª¾0F—†r‘¾$­Ê<>Aä5žH2“Y…5+>H»¤6g¾¾Bvå5JÐÿ>,ui¿jy2>(ÉÛx‹^×¾AÏ|2,ãã>Hˆ'fÒ–ó¾H‚è4AÕÞ>AÁ´œË¾(vEƒÿõK¾,Òù®[97>Bp½Èp¾HÎäÜÿ(>HA–Í{¶Í¾A Ö‚¢>$žöòë>0Oìt»Ù¾CI ט¥L¾GûÓ¤.>@XÁdrW‚¾ æjm†´¾2¤«£>>CÜöAà](¾I:ßÄŠ>G°Mêþ†Ý¾?Q©ÖˆË>¶Ý£ÌÐ>3Ínî–Ð3¾DpM‘)e>Ib„Õç¤T¾Gc ².´ü>=ú…S1o¾ç¨Â¿&A¾5eˆÙ>DöZ Žé—¾I€6F¤o>G˜¿‡T¾<­°K­Ÿ!> õ4D¦Š>6ßT— @å¾Ep©Æå5ÿ>I˜ š×†¾FÂÊSšE;>;m5¸€*&½ýkC€zæÀ¾8BW­zp[>EßÓ2ZF¾I¨QÚ´>FrŒì!¾::fï-P=Ú&EI«C>9‰7oﯾFDyVí}ß>I´jhS¤Ç¾F$ ]t¡&>9ýÚ®ˆ=î&°7UÀ¾:¹÷dŠê¹>FŸ€q¢§°¾Iºú|Eç>EÖÿÛÇë¾8âGý’¾‚æ_¨¿m>;ÏÔ(Áw»¾Fñ|©€Áò>I¿¬ Æk¾EŽ€ròß >7‰¤Ás> ÔŒ<#+'¾<ÐãÌoÁÙ>G;D1ö–“¾IÀb9¤Ø‘>EH ôöð¾6¥^÷{®¾¦ì–‹¿Ò>=¸aË|ý¾G}\̾=w>IÀÚÌöβ¾EÃ㧳¤>58k¶>›>Ž˜™6öç¾>Œ`ט>G¸|dÃ7ù¾I¾ÝÔºÿð>DÌày>Ÿ‹¾4qTÓ[¶ ¾ Ëî~@>?Hã¾Gí~êÉ÷>I¾Ž,|¾D˜7ÛS_>3¿a\|T¥>-Òê੾?ñh<ÛÝ>HÕMÀ>¾I»ÿÙ×û—>Dh¨+Þñ¾3"Ôã ¾å2PoKÿ>@AÀYú%®¾HE;Ìç>I¼<Á©©Ó¾DAGÖ²õ>2œŸ>‚ > £?ÏÊÙú¾@‚÷~Î>Hi)Ça͹¾I¼Cre¯>DÛ=Ê q¾2,Ø hqd¾!ˆù®>@·M—ŒÊ¾Hˆ‚)>Ø`>I¿h®IC:¾Da-–o >1Ô;Eˆ–>"k–_Á¶‡¾@ä'½¹%v>H£tÍ9V¾Ià Éêiì>Cõtë=¾1’ÙÌ•´¤¾#À9 >AM¦¼.¾HºFñ·>IÊi•¢Vç¾Cí¸tÊý>1iA+’£>#o#~þ‰a¾AÎ¥’»>HÌ¡=l0þ¾IÒ¹IH >Cë‹a­Uf¾1Wy­Uw2¾#£ªœHÊ>A.´eð¥å¾HÛ"¥çã>Iß ¶ï¿¾CóÓ¥Š®>1]þ%<æ>#¬e ;5¾A5o*½zÜ>Hå«zEȾIìkç¾h>DP¥{À”¾1|¦ÿ1®è¾#|~ÂM|>A16!M:o¾Hì9PaX>Iýøˆìuo¾D¦Ê¥¶>1³öZÞØÞ># ¯›Œ¾A$šÔ<¦>Hî^Ó¡æN¾JyUi=P>D='5™o¾2œJ)j ¾"Š˜òÍ˱>A ÀRžª¾Hì5¡»Õ>J&¹BrɾDgcX6A¦>2l i8>!ÇO[Šæ¤¾@쀅Ô>Hårlñ;¾J=–Ÿ‚N>D˜‘°"í¾2ìàŸê(¾ ÉëLoÑ >@¿¶ô›àü¾HÙ¥l}e>JW°h'žDÓzùò>3†D¾|Ì>;£n %¾@‰íVº¹>HÈ|…ÞŠ¾Jq§Ú_@£>El⓾47íîH¾kh +ö>@G¸5#äþH±]¶.ö|>J÷g žÍ¾E]Þ_7èý>5ÞæØ‘Ž>:èMȾ?ö¯+W>H“ê’÷Ô¾J©)ŒÅœ>E­Rì4Že¾5ãwªÀ…®¾‘/å±ËK>?Cc@`¾HoU9»?Z>JÅ€?'Õ™¾F¦{ÊŨ>6Ü™Ñaã>„:ì²!¾>yêøÓoe>HCéU™¾JßRG£áú>F`5\s¾7ì”xnp­¾ ÷4ë­´Ð>=“î É™¾H;,©”z>JøÅî#õ¾FÃ7ÎR£y>9òÙ5C>*~g¾<•¢töLº>GÐ'E–8¾K jX7Ð>G)¶Êmd¾:NÂ¥ƒºß½å†éþ¶5>;xÆj¥²Ó¾G‡Õlr>K!Çà÷ì¾G” 9L:½>;Ÿ<,,òÛ½ézÑ?#¸¾:A`Ñ—->G4rYDA¾K-ÆǺhà¾>³1§H¯>G ‰þ#€(¾G¢¸€‡þè>@·ÊÝËϹ¾"1‰¯ Mì¾2‹Ët°>CÌÑÁU´¾HT´ Š>E8€'õû¾6æ œê¾˜n¶>Zé>=W üŔ۾FÒNÕ‡ º>GÐlô4©¾AU®ÑwÄþ>%¯–ÐÐW\>0a«»lÏl¾C;GmS>H>5¼Ö‘ú¾E¦Ú’^pá>8Œ‰5|6=þQ¯2´÷3¾;¼ŸV¢)>Fpù—žþؾGû¢¸>¬á>BÌ°MR¾)¡Žþ³Y«¾,ÏŸ•èf>BŽsàVÒ¾HFi)±>F^¼bý¾:_üá=ÒÜ 80/¨>9ßy(&_«¾EøcE–.>H!˜uìoþB¿ÄÙH>.쬟b¶>(Sš—‡/¾AÃ57íЫ>Gä‹9¦P¾FŽÈ'B>Ed}`¢¨¾H<ÀÆ;->Cƒêyx[E¾1h*j䡾#HócÅ¢F>@Ö„wïA¾G™g¾>õâ>Fÿó¨£gd¾>tðêñ`>®ìè –>5M™a€.S¾D°ø—Yˆl>HGÌsî£Ç¾DM}˜,>3þ¨¨76>^X”¬Ç•¾?‰™ô* †>G3ɘ ÷¾Gh»3©”Ï>@T7'~)¾ «¶¡ÍAܾ2“‡¶Ÿ&·>CÚ,ôv–¾H<î¡÷oš>E!‘@Ýã¾6¼…[Û š¾Tcã>=×r¸&¾F­ÞñÏ„>GÃUE‰áü¾AuËÉ´´]>&ï#³6Šà>/:©+d$¾BÜðª6µ>Hž#‘&þ¾EÕÉ, ×>9š‘¸$:×=Ú^4†“&÷¾:Kø¶ìP>Fæ8 íþH„îe¯÷>B™¬$ü¼¾-–†"N+¾(cæÕ›>A²›;¸¾GΗ9×Ãt>FˆàVšæ­¾<Ö8Ž°g> ‡`â"ð~>7(Á®É4L¾E*0‹§×>H0ä¸ÑÑì¾C¸ž(9ξ>2I&¶ LÈ>!Ô—ïUÙ¾@Yd›Œ»„>G^M(žßü¾G&þSù>?‹1µb,ç¾åÕÊíZ¾3©t—¶±·>D!á5øá¾H4–t,8ø>DÊɻႾ5å·XO¾;[Vlµ>=™°ù¬8¹¾F¾SÞ…,t>G§ÿn$i¾ABO$Ë°'>&!9ð1Y>/š(‚åp_¾Bä5(P±>H "há¾EÇtî>9“ iù÷ÿ=Ó!šÒÜDh¾:h—ìTà>Eç¦ñ`1±¾H[߆>B´ÛýBξ.Š ô ؾ'&ãi²>AlaÌd̾G¯sâI^j>F¥³ ß,¾=Bô¿Ù/>Ü7sàë¼>6 òF5¼¾DÓ¢¾ ²›>H,in¢9ê¾Dïµ›S>3–ªÊ>ÿLŠË³÷¾?mn3û>G…±€¾G[ud¬ýý>@qýx­¾!áàÊùàB¾1¿:ÞôY¬>C|ÿ‚@¾H4Jn>EQÜ9è1Q¾7ó^j>lö¾Ç—h°æÐ>;y‚Ê·Y¾F8ÍR+½Ž>GÝÚhRþB.=°6”Ì>+§ÄÏ[ÃM>)äÇFçžAÞþ¼‘Á>GÈz‹_+P¾Fejîš “>EÖ–MÔ¾H ö¤ç>CÌâ7L{¾2ÍïÆ‘±Ž¾ÿêbÿÂ>?졯x¾G'ó‰rÚB>GA‘ç»t…¾@;«[ rî> õDÁº¼ô>2§‹ølоC’,¢·³ƒ>Hõ!:ö¾E? æy*,>7Èø¥¬ >–ÈûI¾Þ¾;€Þäà>F1ïä@Fa¾GÙJÏŽo>B5ø´¸¯¦¾,³-4¾)ZT)Ðec>A¾ºêd±·¾Gºh(lÑÁ>FuêUïÞ(¾<¨è&C> 'tv–Ì>6{H_p¾DÞ?^Åõ>>HBuRŒå¾DõgçÆð>3—z>E?‹²K'¾?$Z¹/>Fû]5²ý¾GbÀ›V>@§$àq¾#`KŒËÚx¾0ḼŒ>C&»åt÷ñ¾H¢$K>E’ ®¶U¾9£J ½âüÈF‘~>:nîè¯x¾EÒÆbØZ>Gô:³eÉB¾BÊÑv&å¡>/¤Ä¸$«¢>%ƒphÉlH¾A¶€1>GËê’çÿ¾FÑAhÞÓÑ>>c¥–VK¾œnNù¾4_€8ºC©>D9¬’ý†¶¾H[$2R‰>D­ùGû9¾5é"¢Æ·¾½~*žO¼>=WÇvß¾F‚³2[ ­>G®ê-xÛ¾A¨Mã!y>)úaâ´>, ¥ž¨õȾB+ ¢G>GÏBƒCì¾F9ª‹¤:>;ÍZ”¡ÿê¾Ì%Ÿí¾7- Ü ý>E\œæþ¾Hp•ðs">CÙiLŒ8¼¾30T‰Vëÿ¾‰èAâSZ>?Kxªx¾Fü-)ƒt>G\ÀÓÇ°¾@©-è+>#¬¿GÊÇ>0žÆN xä¾C§Ç‡6>GúQê|tµ¾E­¼ºÈ@Ê>9¤­Û5½Åð.~â ¾9Yûz¥Ò,>EšoeØ(¾GÿL?¨@ß>C"ÜÇ –é¾0û¢h¶»H¾"Þ;E¶ä >@’<)­¾GKQo‰>GìÈÂ[¾?µ+E–­ >îÑ6ýS>2“˜ÕKýe¾C£›ã‡Æd>Hê袓s¾E8øº§±>7õyÐP9=ü£Æ¨zÿ¾:îÏ^Uõ~>EþBDYz˾Gã:>B”ûÙŒ”¾.´¾‘CÒ¾&*6|Aÿ×>Aì ™œµ¾G}8ˆ`<í>FÐ!ú½ÜÚ¾>‡ |â½x>õ•¢Ù£>3í€ ñ ¾D »±=œÑ>HÂð宾Dã‚Z€²>6Í„–RO><ñrØ‚¾;ò’Š,üF>F;!ô  ¾GÍÁV;ªÛ>B8[œ/¾,¢ B˜Æ¾(7^Ãæ>ArzÞ ´"¾G˜›"Ù>F§Ûä¾=Ò2Ï0>ƒG¥² Í>4¬ýªâV¾DBšþÝþ£>H|‚‰œ¾D¶yE_=>66e¼.ÿ> MßÇ|Ÿ'¾FWÇ[5ä¾Gêz Ú>BX©õT¾+ÄVycýÔ¾)$‹Ø$À>A“b(ÓS¾G¡!pž6>Fšþ<{ˆ{¾=Ÿj³‡ä>¨Žò|<>4×\硾DMÉý#ù>HûkG°”¾D²[6//èdHù> O ?û! ¾FTh×ÞÒ¾GÆ‚/O>B! ÿ’¾,'.1q²Ô¾(p׶á>A{û•å¾Gš¾çÞ9>F¬F"Þ—¾=ï„B‡ Ì>VBG_>4o#Wì¾D,‹Wa§‘>H“'…¾¾DØ–—§=~>6»@+Æ9>nom°¾;Úݺ)>F1¤OÜ’²¾GØ&s>BbŽ6™›c¾-ƪÕâ«S¾&ÝFNf(>A,*f毾G‚¦Ð¤ ì>F×Ùý—ñ¾>¾++êhû>–_ħ¢¯>3m p%^¾CÛ_ìäÛ×>HU;áFw¾E'èat|>7ÙäH/¥=ûSÌ3'ô¾:Âz÷¶ü>Eí[¶È`¾GóPÖEÄj>BÚW˜îme¾0MÆœUX¾#äÕ•Kƒ>@ûk|y%¾GRÎ×ÄôP>GXxA¾@æÝûˆy> ·\šŠm>1Î!,æ¾CWŠG÷‰¿>H 9 œeT¾Eš ø‚œ>9C.2º4½Î«,4I¡¶¾9‚gÉæ>E}Çã|õÛ¾Hå¾ö >CûËÂG¾2PÚ•6EÚ¾/2q÷i°>?™¡ºš½¸¾Gb}ÐÇé>GlÔ+s¾@âm«Y>%aê·Ž‰ì>/ç«WK¾B˜.íŸÙA>Gèc…p–¾F%%:¶l·>;©kó)¿Ä¾Ï[Ÿ7—¥¾6ÍXÆèÖ°>DÛi­£W¾H%dÕ,í>DKÛÙrD™¾4ä^–Jç¾òp|"Ï>=d/†'JǾFù‡Ëí>G¿í‹4X¾Aîj%›>+CÖSdœ‡>)<“ÅQ t¾A’^jpßè>G¦(jÆšn¾F¿tÆä{ñ>>Dþ¾Ú–h¾qoÉW¾3ÚLMèÎ>Cû¥u{¨¾H$cùþ¦>E/c/ÁI…¾7÷EÄÅW‡½÷ü´äÔÐ>:…tæÃX·¾EÝWWkÔè>Hw˜ÄyW¾C‹B<<>1&åÕQ“>!÷¤@L”¾@<ýp%Ní>G4¤:­FO¾GWÆ$u%>@œu°‚j¾#ø-æ»û/¾0/þçjý&>BÌ£ º¾Gú¡Äk>Fi ÖÖI¾;zçW´œð>\”ĩ>6ídј§Û¾DåI¦Ô>H0·Å!z„¾Da1üN!>5* URÏ>9:±¾=wbéI€>F~º´ãX/¾GØäþ4S>B4GA.Z¾,âéú}¿ü¾'„¸àÐ>AAáîí¹è¾G“¹ ' >FüW0Ý6o¾?Oó£®<>效%@>2ºP舾C’—¹+…>H"¤Üa\—¾E¡DœU©>9•Î•n!{½Úø¶ÂD½¾8ݱ¨¿u>Ep­qëÈ„¾H,È“–°«>CÖv“íú¾3d©ïq¾@¢àUkZ>>šôä¾¾FتþÜ·>G¶›K—¯ª¾A¦TžÆ& >)¸)y"Í>*¬9Ò·«„¾AÑœV|ß>GÄgð§Uæ¾FÆË †¼”>>EÙ¸õÜf¾›ønÍÎÀ¾3Ä2Šoí>Cõ¡‘ [€¾H67Ñï/d>Ef›SWc1¾8²²¡½ã‰i4i>9¼üžØ…¾E®•8d½½>H-b Ð ¾C Äðmÿ:>2¸R€¹>™‡Í"¾?&¡ñaZd>FúʪåN¿¾G±6¨k#>AÕœ®T¾(ç%`1Ä$¾+w¥åìö>>Aö'/p £¾GÔØ…×>FÅxBIËñ¾>.A!½Â>*Só‡>3Û—äŠ0¾Cþ‚"n¸>H?ðò\0Ö¾EuXœnþ>8ÝG¾_F=Ú`jš™ÑL¾9‘i$ò‹M>E¦qÌ1¨‹¾H;>úº>CÇÚ*™ ò¾3-ù¢?Ö¾í"P>>ÁîŠüÃT¾Fê¢E6¶>GάìB¾AÊÁ rc!>*z›‚Чù>)ãñj0ž¾A°RÓ¥†?>GÇ•]óö¾Fû>Q%>?"RÊE²¾s[ð®M¾2Ò‹ô>L>C¬ïPq¸¾H?@àvrÇ>EÍBÏc¾:¿ñÒžh=ðz|V"<>8Usç^ ¦¾EThO[?D>HS(ˆÆ‘ˆ¾DIŽ$ÚO]>4ÅÜEêN’>!¯+kä¾=bâ­±¨9>F –ZdþϾH×–Fá>B|ÀJöDû¾.n7¦ý÷¾%áœ!eÜ>@ø†É6ã0¾G’´ù|tw>G_{F¹°í¾@m߮ɟ[>"ü³î¨+>0œ96âľBö™Ý³…>H(/e\ξFc5¬fNÛ>Dª+?"(¤¾Hdú{k;>EfÀ¤ýK¾7u ¥· -¾I…3.Ý>:ñÊœžCN¾F =>HIFNíʾC‰ç½é>2WC)%>´†z¨Êå¾?}|¢èTï>G ±A'ç¾GÜسA$§>A½f(»˜l¾*®UŸÎé¾*Küb¥-<>AÇŧŒ4æ¾Gá¾ûœó>G ôËzç¾?yV¹¡<¡>Ÿ–C»Ì>2]hOó”)¾CŠ:›|ø>HTTѪ$¾F¡‘Áiò>;!À\|1•¾ðÙ»Qü¾7JHÕ‚xš>E(Œ’e ¾HwkY Ec>DÙ¦sWȾ6…è$³Ù.¾ÛOÔ>;Ú‡‚Ÿã¾FP¸dFå(>HQC8ž¾C[×ýÔ'È>1·ÛÍJ¿> µ'p´P¾@ÇcxcÝ>GG°'똾Gâ¡ñuó>A©Á'm3¾)‘±~+ì¾*ÔÁ„%R>AäÍZ*»–¾GøQ7‡>G3M•^¥÷¾?›S­\n&>"·ºîŽë>2C÷Ó8¾C!>«}>HdUà/Ú¾FE]F4£4>;˜ÇN„i•¾:A›î¾6Õá-ž)n>Døï÷4Q¾HŒÝ¤à4>E!Ž#™[U¾7`5û=-¾hFóu™>;Ît\Ö¾F)ô¬Ím>HuÏrjó–¾Cʵ×ÀE>2úš²à[>>©†Xš¾¾? ½,Âò¹>G3Ô´¾H"1¯ý€v>BIÿˆyÌ5¾,öãÝÇYö¾'yJd›i>AOîСW˜¾GÖžßs‘>G– #Ѿ@¢ƒÆP2>#Ôž­} >0B5M¾BèÀ8b’ð>HRå%OÒѾFÕÎþÇ>=ºû#ý5¾d‹‚ò£L¾4Ž´RçG¼>DQƒⲃ¾H˜‰™×ß<>EæÌ_—ä¾9ûÅ„,ZV=鵘 Y-R>8›‘!x´¾E†dBÃY“>H¦’¦Öx9¾DËC›ðJ>6*±·Á> Aí0]¾FŠf«ñ× ¾H‚ªƒ©%>C‹Lkí‹n¾25YÂH¾ Éu|Û¶>?ÞV¢Gð¾G[öDë‚>H->Jm ¾B*9YóÝ>,"0•á”>(u1&j“I¾A†Ó€19>GüZÄ'Vx¾G¬šW µè>@­b¡]õ¾#á¿sÌľ0GæÌa ñ>BôÅJ–®Ú¾Hlä°EÓ8>G± Mš»¾>2ÏIÈþ>u‰Vˆ>4!WÚÓ¾D:žp*æ>H±,‘Ó¾F3بÔä>:æ'½!ú½ý¹€I¾7Ç™‚°»8>EWžjô¾¹¾HÉ©õwߦ>EAýxÜ ¾7}r¡ºKv¾1ˆ–Ÿf>;19B¾FL«9çd>Hº±aê¶ì¾D5B²R>4Z˜=×;>!i/Úï¾>`ô/~Àé>G¼f²ôá¾H„Vñ›€G>C wÑJÄ;0ygé]¤ø¾#’õžÛÿ)>@§¢Zñ5ê¾G¾Â hÍ»>H,‹]áEm¾AÑ®±—î>)ÚI&*p>*Õ‰¢O̾BB˜Ü¨>H?£öˆH€¾G³;SF>@‚®%eÎѾ"ÅéôUO[¾0âÀLçÚ>C7fÅlPâ¾HœíÞÿÇ>G‰†“Z¾>M}¸XÌÛ>„e•ubÅ>42<ÌÒWZ¾DP#"ˆ>HاÂQäu¾Fnn%šÍ>;|ù5œº…¾e_€Xؾ7R­‚(Ç>EGÎ ¾™f¾Hô¿Àýž8>E©Ã*\¨¾8Ÿv¶ùzŠ½î©ÒÇ—kã>:GŽ`øj¾F"AÞòÒc>Hóƒ%>à0¾DÎ2¦¾¥q>5µhæX˜>d ¾= q*ò²:>FÝš:Xã´¾H×tKµY>Cãõ:Ÿ®2¾2ÉÆ(¨žT¾Êçä¼^^>?ž¢¾8¾G}ÈòÁ¨>H¡ïíٗϾBê k}¸>/·³Ž%‹>%ž¤ò ¾@ÿ|Ã')Í>Hbd©Yk¾HVB ÕÑ>Aæ&Co²/¾)ëa8ƒ%Ⱦ*û @1 U>BchÞ\[¾HlªZ:=>Gö‰:D#7¾@×ÃÊÏ:>$+©Is‡>0Rgί¾C¦6%>H¾rý騾G„ò]qR>?ˆw!°¾çAYƾ3Çz|êH>D94©(¾HûdoÃÉ>GÞ””OÀ¾=U⦷¨>z‚‡ˆ2>5“ú™øî¾DØwKœIÜ>I!° uåÿ¾Fuju±5m>;![ÅU3½ý0»¨ÌÖC¾7ÿ8 ØI!>E—º q¨¾I6¥yÏ$>EÛÏAd(—¾8ébáh&¿½é3ˆÇF²>:F¢DÌÝc¾F@þrÛî>I94Úiý¾E8öm[÷D>6¶Ù¿êÏ3> hj8ƒ¾FØY+ŠŸI¾I-C“…5>DŽëîFÕ¾4‡æç¾ìƒU÷h*>>jgޗν¾G[ìQZÁ}>IkhÇe«¾Cßc©ÊÎ>2bÁyT†ë> qû´Mɾ@#ô÷nŒ¸>GÏì©»$R¾Hìá²Cw>C,6ýžûª¾0F—†r‘¾$­Ê<>Aä5žH2“Y…5+>H»¤6g¾¾Bvå5JÐÿ>,ui¿jy2>(ÉÛx‹^×¾AÏ|2,ãã>Hˆ'fÒ–ó¾H‚è4AÕÞ>AÁ´œË¾(vEƒÿõK¾,Òù®[97>Bp½Èp¾HÎäÜÿ(>HA–Í{¶Í¾A Ö‚¢>$žöòë>0Oìt»Ù¾CI ט¥L¾GûÓ¤.>@XÁdrW‚¾ æjm†´¾2¤«£>>CÜöAà](¾I:ßÄŠ>G°Mêþ†Ý¾?Q©ÖˆË>¶Ý£ÌÐ>3Ínî–Ð3¾DpM‘)e>Ib„Õç¤T¾Gc ².´ü>=ú…S1o¾ç¨Â¿&A¾5eˆÙ>DöZ Žé—¾I€6F¤o>G˜¿‡T¾<­°K­Ÿ!> õ4D¦Š>6ßT— @å¾Ep©Æå5ÿ>I˜ š×†¾FÂÊSšE;>;m5¸€*&½ýkC€zæÀ¾8BW­zp[>EßÓ2ZF¾I¨QÚ´>FrŒì!¾::fï-P=Ú&EI«C>9‰7oﯾFDyVí}ß>I´jhS¤Ç¾F$ ]t¡&>9ýÚ®ˆ=î&°7UÀ¾:¹÷dŠê¹>FŸ€q¢§°¾Iºú|Eç>EÖÿÛÇë¾8âGý’¾‚æ_¨¿m>;ÏÔ(Áw»¾Fñ|©€Áò>I¿¬ Æk¾EŽ€ròß >7‰¤Ás> ÔŒ<#+'¾<ÐãÌoÁÙ>G;D1ö–“¾IÀb9¤Ø‘>EH ôöð¾6¥^÷{®¾¦ì–‹¿Ò>=¸aË|ý¾G}\̾=w>IÀÚÌöβ¾EÃ㧳¤>58k¶>›>Ž˜™6öç¾>Œ`ט>G¸|dÃ7ù¾I¾ÝÔºÿð>DÌày>Ÿ‹¾4qTÓ[¶ ¾ Ëî~@>?Hã¾Gí~êÉ÷>I¾Ž,|¾D˜7ÛS_>3¿a\|T¥>-Òê੾?ñh<ÛÝ>HÕMÀ>¾I»ÿÙ×û—>Dh¨+Þñ¾3"Ôã ¾å2PoKÿ>@AÀYú%®¾HE;Ìç>I¼<Á©©Ó¾DAGÖ²õ>2œŸ>‚ > £?ÏÊÙú¾@‚÷~Î>Hi)Ça͹¾I¼Cre¯>DÛ=Ê q¾2,Ø hqd¾!ˆù®>@·M—ŒÊ¾Hˆ‚)>Ø`>I¿h®IC:¾Da-–o >1Ô;Eˆ–>"k–_Á¶‡¾@ä'½¹%v>H£tÍ9V¾Ià Éêiì>Cõtë=¾1’ÙÌ•´¤¾#À9 >AM¦¼.¾HºFñ·>IÊi•¢Vç¾Cí¸tÊý>1iA+’£>#o#~þ‰a¾AÎ¥’»>HÌ¡=l0þ¾IÒ¹IH >Cë‹a­Uf¾1Wy­Uw2¾#£ªœHÊ>A.´eð¥å¾HÛ"¥çã>Iß ¶ï¿¾CóÓ¥Š®>1]þ%<æ>#¬e ;5¾A5o*½zÜ>Hå«zEȾIìkç¾h>DP¥{À”¾1|¦ÿ1®è¾#|~ÂM|>A16!M:o¾Hì9PaX>Iýøˆìuo¾D¦Ê¥¶>1³öZÞØÞ># ¯›Œ¾A$šÔ<¦>Hî^Ó¡æN¾JyUi=P>D='5™o¾2œJ)j ¾"Š˜òÍ˱>A ÀRžª¾Hì5¡»Õ>J&¹BrɾDgcX6A¦>2l i8>!ÇO[Šæ¤¾@쀅Ô>Hårlñ;¾J=–Ÿ‚N>D˜‘°"í¾2ìàŸê(¾ ÉëLoÑ >@¿¶ô›àü¾HÙ¥l}e>JW°h'žDÓzùò>3†D¾|Ì>;£n %¾@‰íVº¹>HÈ|…ÞŠ¾Jq§Ú_@£>El⓾47íîH¾kh +ö>@G¸5#äþH±]¶.ö|>J÷g žÍ¾E]Þ_7èý>5ÞæØ‘Ž>:èMȾ?ö¯+W>H“ê’÷Ô¾J©)ŒÅœ>E­Rì4Že¾5ãwªÀ…®¾‘/å±ËK>?Cc@`¾HoU9»?Z>JÅ€?'Õ™¾F¦{ÊŨ>6Ü™Ñaã>„:ì²!¾>yêøÓoe>HCéU™¾JßRG£áú>F`5\s¾7ì”xnp­¾ ÷4ë­´Ð>=“î É™¾H;,©”z>JøÅî#õ¾FÃ7ÎR£y>9òÙ5C>*~g¾<•¢töLº>GÐ'E–8¾K jX7Ð>G)¶Êmd¾:NÂ¥ƒºß½å†éþ¶5>;xÆj¥²Ó¾G‡Õlr>K!Çà÷ì¾G” 9L:½>;Ÿ<,,òÛ½ézÑ?#¸¾:A`Ñ—->G4rYDA¾K-ÆǺhà¾>³1§H¯>G ‰þ#€(¾G¢¸€‡þè>@·ÊÝËϹ¾"1‰¯ Mì¾2‹Ët°>CÌÑÁU´¾HT´ Š>E8€'õû¾6æ œê¾˜n¶>Zé>=W üŔ۾FÒNÕ‡ º>GÐlô4©¾AU®ÑwÄþ>%¯–ÐÐW\>0a«»lÏl¾C;GmS>H>5¼Ö‘ú¾E¦Ú’^pá>8Œ‰5|6=þQ¯2´÷3¾;¼ŸV¢)>Fpù—žþؾGû¢¸>¬á>BÌ°MR¾)¡Žþ³Y«¾,ÏŸ•èf>BŽsàVÒ¾HFi)±>F^¼bý¾:_üá=ÒÜ 80/¨>9ßy(&_«¾EøcE–.>H!˜uìoþB¿ÄÙH>.쬟b¶>(Sš—‡/¾AÃ57íЫ>Gä‹9¦P¾FŽÈ'B>Ed}`¢¨¾H<ÀÆ;->Cƒêyx[E¾1h*j䡾#HócÅ¢F>@Ö„wïA¾G™g¾>õâ>Fÿó¨£gd¾>tðêñ`>®ìè –>5M™a€.S¾D°ø—Yˆl>HGÌsî£Ç¾DM}˜,>3þ¨¨76>^X”¬Ç•¾?‰™ô* †>G3ɘ ÷¾Gh»3©”Ï>@T7'~)¾ «¶¡ÍAܾ2“‡¶Ÿ&·>CÚ,ôv–¾H<î¡÷oš>E!‘@Ýã¾6¼…[Û š¾Tcã>=×r¸&¾F­ÞñÏ„>GÃUE‰áü¾AuËÉ´´]>&ï#³6Šà>/:©+d$¾BÜðª6µ>Hž#‘&þ¾EÕÉ, ×>9š‘¸$:×=Ú^4†“&÷¾:Kø¶ìP>Fæ8 íþH„îe¯÷>B™¬$ü¼¾-–†"N+¾(cæÕ›>A²›;¸¾GΗ9×Ãt>FˆàVšæ­¾<Ö8Ž°g> ‡`â"ð~>7(Á®É4L¾E*0‹§×>H0ä¸ÑÑì¾C¸ž(9ξ>2I&¶ LÈ>!Ô—ïUÙ¾@Yd›Œ»„>G^M(žßü¾G&þSù>?‹1µb,ç¾åÕÊíZ¾3©t—¶±·>D!á5øá¾H4–t,8ø>DÊɻႾ5å·XO¾;[Vlµ>=™°ù¬8¹¾F¾SÞ…,t>G§ÿn$i¾ABO$Ë°'>&!9ð1Y>/š(‚åp_¾Bä5(P±>H "há¾EÇtî>9“ iù÷ÿ=Ó!šÒÜDh¾:h—ìTà>Eç¦ñ`1±¾H[߆>B´ÛýBξ.Š ô ؾ'&ãi²>AlaÌd̾G¯sâI^j>F¥³ ß,¾=Bô¿Ù/>Ü7sàë¼>6 òF5¼¾DÓ¢¾ ²›>H,in¢9ê¾Dïµ›S>3–ªÊ>ÿLŠË³÷¾?mn3û>G…±€¾G[ud¬ýý>@qýx­¾!áàÊùàB¾1¿:ÞôY¬>C|ÿ‚@¾H4Jn>EQÜ9è1Q¾7ó^j>lö¾Ç—h°æÐ>;y‚Ê·Y¾F8ÍR+½Ž>GÝÚhRþB.=°6”Ì>+§ÄÏ[ÃM>)äÇFçžAÞþ¼‘Á>GÈz‹_+P¾Fejîš “>EÖ–MÔ¾H ö¤ç>CÌâ7L{¾2ÍïÆ‘±Ž¾ÿêbÿÂ>?졯x¾G'ó‰rÚB>GA‘ç»t…¾@;«[ rî> õDÁº¼ô>2§‹ølоC’,¢·³ƒ>Hõ!:ö¾E? æy*,>7Èø¥¬ >–ÈûI¾Þ¾;€Þäà>F1ïä@Fa¾GÙJÏŽo>B5ø´¸¯¦¾,³-4¾)ZT)Ðec>A¾ºêd±·¾Gºh(lÑÁ>FuêUïÞ(¾<¨è&C> 'tv–Ì>6{H_p¾DÞ?^Åõ>>HBuRŒå¾DõgçÆð>3—z>E?‹²K'¾?$Z¹/>Fû]5²ý¾GbÀ›V>@§$àq¾#`KŒËÚx¾0ḼŒ>C&»åt÷ñ¾H¢$K>E’ ®¶U¾9£J ½âüÈF‘~>:nîè¯x¾EÒÆbØZ>Gô:³eÉB¾BÊÑv&å¡>/¤Ä¸$«¢>%ƒphÉlH¾A¶€1>GËê’çÿ¾FÑAhÞÓÑ>>c¥–VK¾œnNù¾4_€8ºC©>D9¬’ý†¶¾H[$2R‰>D­ùGû9¾5é"¢Æ·¾½~*žO¼>=WÇvß¾F‚³2[ ­>G®ê-xÛ¾A¨Mã!y>)úaâ´>, ¥ž¨õȾB+ ¢G>GÏBƒCì¾F9ª‹¤:>;ÍZ”¡ÿê¾Ì%Ÿí¾7- Ü ý>E\œæþ¾Hp•ðs">CÙiLŒ8¼¾30T‰Vëÿ¾‰èAâSZ>?Kxªx¾Fü-)ƒt>G\ÀÓÇ°¾@©-è+>#¬¿GÊÇ>0žÆN xä¾C§Ç‡6>GúQê|tµ¾E­¼ºÈ@Ê>9¤­Û5½Åð.~â ¾9Yûz¥Ò,>EšoeØ(¾GÿL?¨@ß>C"ÜÇ –é¾0û¢h¶»H¾"Þ;E¶ä >@’<)­¾GKQo‰>GìÈÂ[¾?µ+E–­ >îÑ6ýS>2“˜ÕKýe¾C£›ã‡Æd>Hê袓s¾E8øº§±>7õyÐP9=ü£Æ¨zÿ¾:îÏ^Uõ~>EþBDYz˾Gã:>B”ûÙŒ”¾.´¾‘CÒ¾&*6|Aÿ×>Aì ™œµ¾G}8ˆ`<í>FÐ!ú½ÜÚ¾>‡ |â½x>õ•¢Ù£>3í€ ñ ¾D »±=œÑ>HÂð宾Dã‚Z€²>6Í„–RO><ñrØ‚¾;ò’Š,üF>F;!ô  ¾GÍÁV;ªÛ>B8[œ/¾,¢ B˜Æ¾(7^Ãæ>ArzÞ ´"¾G˜›"Ù>F§Ûä¾=Ò2Ï0>ƒG¥² Í>4¬ýªâV¾DBšþÝþ£>H|‚‰œ¾D¶yE_=>66e¼.ÿ> MßÇ|Ÿ'¾FWÇ[5ä¾Gêz Ú>BX©õT¾+ÄVycýÔ¾)$‹Ø$À>A“b(ÓS¾G¡!pž6>Fšþ<{ˆ{¾=Ÿj³‡ä>¨Žò|<>4×\硾DMÉý#ù>HûkG°”¾D²[6//èdHù> O ?û! ¾FTh×ÞÒ¾GÆ‚/O>B! ÿ’¾,'.1q²Ô¾(p׶á>A{û•å¾Gš¾çÞ9>F¬F"Þ—¾=ï„B‡ Ì>VBG_>4o#Wì¾D,‹Wa§‘>H“'…¾¾DØ–—§=~>6»@+Æ9>nom°¾;Úݺ)>F1¤OÜ’²¾GØ&s>BbŽ6™›c¾-ƪÕâ«S¾&ÝFNf(>A,*f毾G‚¦Ð¤ ì>F×Ùý—ñ¾>¾++êhû>–_ħ¢¯>3m p%^¾CÛ_ìäÛ×>HU;áFw¾E'èat|>7ÙäH/¥=ûSÌ3'ô¾:Âz÷¶ü>Eí[¶È`¾GóPÖEÄj>BÚW˜îme¾0MÆœUX¾#äÕ•Kƒ>@ûk|y%¾GRÎ×ÄôP>GXxA¾@æÝûˆy> ·\šŠm>1Î!,æ¾CWŠG÷‰¿>H 9 œeT¾Eš ø‚œ>9C.2º4½Î«,4I¡¶¾9‚gÉæ>E}Çã|õÛ¾Hå¾ö >CûËÂG¾2PÚ•6EÚ¾/2q÷i°>?™¡ºš½¸¾Gb}ÐÇé>GlÔ+s¾@âm«Y>%aê·Ž‰ì>/ç«WK¾B˜.íŸÙA>Gèc…p–¾F%%:¶l·>;©kó)¿Ä¾Ï[Ÿ7—¥¾6ÍXÆèÖ°>DÛi­£W¾H%dÕ,í>DKÛÙrD™¾4ä^–Jç¾òp|"Ï>=d/†'JǾFù‡Ëí>G¿í‹4X¾Aîj%›>+CÖSdœ‡>)<“ÅQ t¾A’^jpßè>G¦(jÆšn¾F¿tÆä{ñ>>Dþ¾Ú–h¾qoÉW¾3ÚLMèÎ>Cû¥u{¨¾H$cùþ¦>E/c/ÁI…¾7÷EÄÅW‡½÷ü´äÔÐ>:…tæÃX·¾EÝWWkÔè>Hw˜ÄyW¾C‹B<<>1&åÕQ“>!÷¤@L”¾@<ýp%Ní>G4¤:­FO¾GWÆ$u%>@œu°‚j¾#ø-æ»û/¾0/þçjý&>BÌ£ º¾Gú¡Äk>Fi ÖÖI¾;zçW´œð>\”ĩ>6ídј§Û¾DåI¦Ô>H0·Å!z„¾Da1üN!>5* URÏ>9:±¾=wbéI€>F~º´ãX/¾GØäþ4S>B4GA.Z¾,âéú}¿ü¾'„¸àÐ>AAáîí¹è¾G“¹ ' >FüW0Ý6o¾?Oó£®<>效%@>2ºP舾C’—¹+…>H"¤Üa\—¾E¡DœU©>9•Î•n!{½Úø¶ÂD½¾8ݱ¨¿u>Ep­qëÈ„¾H,È“–°«>CÖv“íú¾3d©ïq¾@¢àUkZ>>šôä¾¾FتþÜ·>G¶›K—¯ª¾A¦TžÆ& >)¸)y"Í>*¬9Ò·«„¾AÑœV|ß>GÄgð§Uæ¾FÆË †¼”>>EÙ¸õÜf¾›ønÍÎÀ¾3Ä2Šoí>Cõ¡‘ [€¾H67Ñï/d>Ef›SWc1¾8²²¡½ã‰i4i>9¼üžØ…¾E®•8d½½>H-b Ð ¾C Äðmÿ:>2¸R€¹>™‡Í"¾?&¡ñaZd>FúʪåN¿¾G±6¨k#>AÕœ®T¾(ç%`1Ä$¾+w¥åìö>>Aö'/p £¾GÔØ…×>FÅxBIËñ¾>.A!½Â>*Só‡>3Û—äŠ0¾Cþ‚"n¸>H?ðò\0Ö¾EuXœnþ>8ÝG¾_F=Ú`jš™ÑL¾9‘i$ò‹M>E¦qÌ1¨‹¾H;>úº>CÇÚ*™ ò¾3-ù¢?Ö¾í"P>>ÁîŠüÃT¾Fê¢E6¶>GάìB¾AÊÁ rc!>*z›‚Чù>)ãñj0ž¾A°RÓ¥†?>GÇ•]óö¾Fû>Q%>?"RÊE²¾s[ð®M¾2Ò‹ô>L>C¬ïPq¸¾H?@àvrÇ>EÍBÏc¾:¿ñÒžh=ðz|V"<>8Usç^ ¦¾EThO[?D>HS(ˆÆ‘ˆ¾DIŽ$ÚO]>4ÅÜEêN’>!¯+kä¾=bâ­±¨9>F –ZdþϾH×–Fá>B|ÀJöDû¾.n7¦ý÷¾%áœ!eÜ>@ø†É6ã0¾G’´ù|tw>G_{F¹°í¾@m߮ɟ[>"ü³î¨+>0œ96âľBö™Ý³…>H(/e\ξFc5¬fNÛ>Dª+?"(¤¾Hdú{k;>EfÀ¤ýK¾7u ¥· -¾I…3.Ý>:ñÊœžCN¾F =>HIFNíʾC‰ç½é>2WC)%>´†z¨Êå¾?}|¢èTï>G ±A'ç¾GÜسA$§>A½f(»˜l¾*®UŸÎé¾*Küb¥-<>AÇŧŒ4æ¾Gá¾ûœó>G ôËzç¾?yV¹¡<¡>Ÿ–C»Ì>2]hOó”)¾CŠ:›|ø>HTTѪ$¾F¡‘Áiò>;!À\|1•¾ðÙ»Qü¾7JHÕ‚xš>E(Œ’e ¾HwkY Ec>DÙ¦sWȾ6…è$³Ù.¾ÛOÔ>;Ú‡‚Ÿã¾FP¸dFå(>HQC8ž¾C[×ýÔ'È>1·ÛÍJ¿> µ'p´P¾@ÇcxcÝ>GG°'똾Gâ¡ñuó>A©Á'm3¾)‘±~+ì¾*ÔÁ„%R>AäÍZ*»–¾GøQ7‡>G3M•^¥÷¾?›S­\n&>"·ºîŽë>2C÷Ó8¾C!>«}>HdUà/Ú¾FE]F4£4>;˜ÇN„i•¾:A›î¾6Õá-ž)n>Døï÷4Q¾HŒÝ¤à4>E!Ž#™[U¾7`5û=-¾hFóu™>;Ît\Ö¾F)ô¬Ím>HuÏrjó–¾Cʵ×ÀE>2úš²à[>>©†Xš¾¾? ½,Âò¹>G3Ô´¾H"1¯ý€v>BIÿˆyÌ5¾,öãÝÇYö¾'yJd›i>AOîСW˜¾GÖžßs‘>G– #Ѿ@¢ƒÆP2>#Ôž­} >0B5M¾BèÀ8b’ð>HRå%OÒѾFÕÎþÇ>=ºû#ý5¾d‹‚ò£L¾4Ž´RçG¼>DQƒⲃ¾H˜‰™×ß<>EæÌ_—ä¾9ûÅ„,ZV=鵘 Y-R>8›‘!x´¾E†dBÃY“>H¦’¦Öx9¾DËC›ðJ>6*±·Á> Aí0]¾FŠf«ñ× ¾H‚ªƒ©%>C‹Lkí‹n¾25YÂH¾ Éu|Û¶>?ÞV¢Gð¾G[öDë‚>H->Jm ¾B*9YóÝ>,"0•á”>(u1&j“I¾A†Ó€19>GüZÄ'Vx¾G¬šW µè>@­b¡]õ¾#á¿sÌľ0GæÌa ñ>BôÅJ–®Ú¾Hlä°EÓ8>G± Mš»¾>2ÏIÈþ>u‰Vˆ>4!WÚÓ¾D:žp*æ>H±,‘Ó¾F3بÔä>:æ'½!ú½ý¹€I¾7Ç™‚°»8>EWžjô¾¹¾HÉ©õwߦ>EAýxÜ ¾7}r¡ºKv¾1ˆ–Ÿf>;19B¾FL«9çd>Hº±aê¶ì¾D5B²R>4Z˜=×;>!i/Úï¾>`ô/~Àé>G¼f²ôá¾H„Vñ›€G>C wÑJÄ;0ygé]¤ø¾#’õžÛÿ)>@§¢Zñ5ê¾G¾Â hÍ»>H,‹]áEm¾AÑ®±—î>)ÚI&*p>*Õ‰¢O̾BB˜Ü¨>H?£öˆH€¾G³;SF>@‚®%eÎѾ"ÅéôUO[¾0âÀLçÚ>C7fÅlPâ¾HœíÞÿÇ>G‰†“Z¾>M}¸XÌÛ>„e•ubÅ>42<ÌÒWZ¾DP#"ˆ>HاÂQäu¾Fnn%šÍ>;|ù5œº…¾e_€Xؾ7R­‚(Ç>EGÎ ¾™f¾Hô¿Àýž8>E©Ã*\¨¾8Ÿv¶ùzŠ½î©ÒÇ—kã>:GŽ`øj¾F"AÞòÒc>Hóƒ%>à0¾DÎ2¦¾¥q>5µhæX˜>d ¾= q*ò²:>FÝš:Xã´¾H×tKµY>Cãõ:Ÿ®2¾2ÉÆ(¨žT¾Êçä¼^^>?ž¢¾8¾G}ÈòÁ¨>H¡ïíٗϾBê k}¸>/·³Ž%‹>%ž¤ò ¾@ÿ|Ã')Í>Hbd©Yk¾HVB ÕÑ>Aæ&Co²/¾)ëa8ƒ%Ⱦ*û @1 U>BchÞ\[¾HlªZ:=>Gö‰:D#7¾@×ÃÊÏ:>$+©Is‡>0Rgί¾C¦6%>H¾rý騾G„ò]qR>?ˆw!°¾çAYƾ3Çz|êH>D94©(¾HûdoÃÉ>GÞ””OÀ¾=U⦷¨>z‚‡ˆ2>5“ú™øî¾DØwKœIÜ>I!° uåÿ¾Fuju±5m>;![ÅU3½ý0»¨ÌÖC¾7ÿ8 ØI!>E—º q¨¾I6¥yÏ$>EÛÏAd(—¾8ébáh&¿½é3ˆÇF²>:F¢DÌÝc¾F@þrÛî>I94Úiý¾E8öm[÷D>6¶Ù¿êÏ3> hj8ƒ¾FØY+ŠŸI¾I-C“…5>DŽëîFÕ¾4‡æç¾ìƒU÷h*>>jgޗν¾G[ìQZÁ}>IkhÇe«¾Cßc©ÊÎ>2bÁyT†ë> qû´Mɾ@#ô÷nŒ¸>GÏì©»$R¾Hìá²Cw>C,6ýžûª¾0F—†r‘¾$­Ê<>Aä5žH2“Y…5+>H»¤6g¾¾Bvå5JÐÿ>,ui¿jy2>(ÉÛx‹^×¾AÏ|2,ãã>Hˆ'fÒ–ó¾H‚è4AÕÞ>AÁ´œË¾(vEƒÿõK¾,Òù®[97>Bp½Èp¾HÎäÜÿ(>HA–Í{¶Í¾A Ö‚¢>$žöòë>0Oìt»Ù¾CI ט¥L¾GûÓ¤.>@XÁdrW‚¾ æjm†´¾2¤«£>>CÜöAà](¾I:ßÄŠ>G°Mêþ†Ý¾?Q©ÖˆË>¶Ý£ÌÐ>3Ínî–Ð3¾DpM‘)e>Ib„Õç¤T¾Gc ².´ü>=ú…S1o¾ç¨Â¿&A¾5eˆÙ>DöZ Žé—¾I€6F¤o>G˜¿‡T¾<­°K­Ÿ!> õ4D¦Š>6ßT— @å¾Ep©Æå5ÿ>I˜ š×†¾FÂÊSšE;>;m5¸€*&½ýkC€zæÀ¾8BW­zp[>EßÓ2ZF¾I¨QÚ´>FrŒì!¾::fï-P=Ú&EI«C>9‰7oﯾFDyVí}ß>I´jhS¤Ç¾F$ ]t¡&>9ýÚ®ˆ=î&°7UÀ¾:¹÷dŠê¹>FŸ€q¢§°¾Iºú|Eç>EÖÿÛÇë¾8âGý’¾‚æ_¨¿m>;ÏÔ(Áw»¾Fñ|©€Áò>I¿¬ Æk¾EŽ€ròß >7‰¤Ás> ÔŒ<#+'¾<ÐãÌoÁÙ>G;D1ö–“¾IÀb9¤Ø‘>EH ôöð¾6¥^÷{®¾¦ì–‹¿Ò>=¸aË|ý¾G}\̾=w>IÀÚÌöβ¾EÃ㧳¤>58k¶>›>Ž˜™6öç¾>Œ`ט>G¸|dÃ7ù¾I¾ÝÔºÿð>DÌày>Ÿ‹¾4qTÓ[¶ ¾ Ëî~@>?Hã¾Gí~êÉ÷>I¾Ž,|¾D˜7ÛS_>3¿a\|T¥>-Òê੾?ñh<ÛÝ>HÕMÀ>¾I»ÿÙ×û—>Dh¨+Þñ¾3"Ôã ¾å2PoKÿ>@AÀYú%®¾HE;Ìç>I¼<Á©©Ó¾DAGÖ²õ>2œŸ>‚ > £?ÏÊÙú¾@‚÷~Î>Hi)Ça͹¾I¼Cre¯>DÛ=Ê q¾2,Ø hqd¾!ˆù®>@·M—ŒÊ¾Hˆ‚)>Ø`>I¿h®IC:¾Da-–o >1Ô;Eˆ–>"k–_Á¶‡¾@ä'½¹%v>H£tÍ9V¾Ià Éêiì>Cõtë=¾1’ÙÌ•´¤¾#À9 >AM¦¼.¾HºFñ·>IÊi•¢Vç¾Cí¸tÊý>1iA+’£>#o#~þ‰a¾AÎ¥’»>HÌ¡=l0þ¾IÒ¹IH >Cë‹a­Uf¾1Wy­Uw2¾#£ªœHÊ>A.´eð¥å¾HÛ"¥çã>Iß ¶ï¿¾CóÓ¥Š®>1]þ%<æ>#¬e ;5¾A5o*½zÜ>Hå«zEȾIìkç¾h>DP¥{À”¾1|¦ÿ1®è¾#|~ÂM|>A16!M:o¾Hì9PaX>Iýøˆìuo¾D¦Ê¥¶>1³öZÞØÞ># ¯›Œ¾A$šÔ<¦>Hî^Ó¡æN¾JyUi=P>D='5™o¾2œJ)j ¾"Š˜òÍ˱>A ÀRžª¾Hì5¡»Õ>J&¹BrɾDgcX6A¦>2l i8>!ÇO[Šæ¤¾@쀅Ô>Hårlñ;¾J=–Ÿ‚N>D˜‘°"í¾2ìàŸê(¾ ÉëLoÑ >@¿¶ô›àü¾HÙ¥l}e>JW°h'žDÓzùò>3†D¾|Ì>;£n %¾@‰íVº¹>HÈ|…ÞŠ¾Jq§Ú_@£>El⓾47íîH¾kh +ö>@G¸5#äþH±]¶.ö|>J÷g žÍ¾E]Þ_7èý>5ÞæØ‘Ž>:èMȾ?ö¯+W>H“ê’÷Ô¾J©)ŒÅœ>E­Rì4Že¾5ãwªÀ…®¾‘/å±ËK>?Cc@`¾HoU9»?Z>JÅ€?'Õ™¾F¦{ÊŨ>6Ü™Ñaã>„:ì²!¾>yêøÓoe>HCéU™¾JßRG£áú>F`5\s¾7ì”xnp­¾ ÷4ë­´Ð>=“î É™¾H;,©”z>JøÅî#õ¾FÃ7ÎR£y>9òÙ5C>*~g¾<•¢töLº>GÐ'E–8¾K jX7Ð>G)¶Êmd¾:NÂ¥ƒºß½å†éþ¶5>;xÆj¥²Ó¾G‡Õlr>K!Çà÷ì¾G” 9L:½>;Ÿ<,,òÛ½ézÑ?#¸¾:A`Ñ—->G4rYDA¾K-ÆǺhà>H{ÂÂuï¾=1Sâb>ýF€`ùZ>8é.%©l¾FÔíëBQÇ>K6 k–m¾Hp Ú9Žo>>ytŽäÍ ¾3Œ4Ü>á¾7tSÞ‚>Fh[¤­ôß¾K5±Vl¼>HÞé¤âX¾@,øȇ>dmßWE)>5ܺ©¯ç¾Eí–ÄÅpÇ>K.D°9(¾IN{#Þr>@Ë0=×¾ø ¿¾4&#tÊ>Ec¡ÝR¢w¾K}<#Dï>IºÁ000¾Aœ«ìOl>#›ª—ÿç>2Jòø] Ö¾DÉRÒ¢Ã>JþËšyó¨¾J$Ûâ¼D>Bs¡;B’¾'µƒHþ`D¾0O–k·A_>D©+L/ݾJÓ·¤<Ž$>Jˆ…"¾CN³¡UJ3>,!6ªeb>,\W£›ì¾C_yó–¾½>J›Œ„rʾJæıp$>D,˜ÙóqE¾0Zù‚¸Î¾'×Z·ä•±>Bט°à¾JQÂLÆiß>K;%0g¾E žº„£>2¾æQK>#Vô“$¾A§¥ ht >I÷Ž(Ø̈¾K…í'þ*C>Eê%‰Ì=¾51â©‚P¹¾â4©ÅúB>@¬Q4‡Î¾IˆS1b‰õ>KÂÛŽ_ãs¾FÆ.Eôk>7¹ÑAŠ>"Hõölx¾?4QB«½¤>I9GÑ¥¾Kò:£‡èÔ>GÃÿîDä¾:M7÷~y€½÷BŒ„ZØ><⟯§î¾Hi°«Ð™>L/hü¤$¾Hn†{ˆV ><îtŠ@oú½÷ª› kû_¾:a¤N0ˆ>G¶éW«1[¾Lö g{Í>I6)À?”DÁáñ>+óµfÆ>7°ÇSW¾Fèkë’ïæ>L “ß俾Iñõb%bÃ>AÉÕ¾ìu¾Ö멾4Ï_T1Û>Eÿ’’ÓÊ“¾Kê,Nâž>JŸ@ÏÀÜ‹¾Bs3Ü^‘¡>&IrØž5>1½£J¡ÉϾDø§î«0>Kª²gF ‚¾K; Gj´•>CĆÊ´†¾,ÉÏÓ„|_¾,÷½µµŽÝ>CÓ ¡±{u¾KOOìÌÚ•>KÂZµï+¦¾EÊW«>1×4vÞÉ›>&åeÒ`S¾BŽDlv>JÒ÷÷V)˜¾L1çt¹>FOWå¾Òa¾5Z£¿½š¾¾·\û l±>A*§"C5¾J5÷ šÈ>L†‰ÿr£ž¾G‚OAÊEì>8ä°~ ˆ> .BÇ ³ò¾?GŸiˆ«>Isƒæ³•g¾L¼Îçu® >H¦ç½h+¾;úë5N¾HŒ)<>LÑv—7=¾I³îï!Ç >?ýý‰Æè¾q… çR¾8jíL˜ô>G{|‚½ˆ ¾LÁj²D\>JªªìïSH¾A¿yý€7«>!Ñ|zî*>4›t“対FBJ›\³>LˆIÐiî6¾Kƒ0µ²´>Ctõ7V»%¾)­C„pÍ ¾0‹dKy"R>DÝŽâÊؾL#ù"¦2>L;ñóŒ¾E…xÉÇô>11a%a†>(… Z˜'¾CN8è1,>K‘-kÞJ~¾LÍ¢M× >F±ÇÒIé,¾5•—ú[±í¾þÅwv|>A‘§«»*—¾JÍVéÁ>M6“ߎ©Ã¾H/*:°0>9úpwAÓŸ>ieYn¹+¾?UúÜs>IÕ4JŒš¾Mo{<\êO>I±q®<¾>UÆjH·=ý7Xw!x€>;.6ˆ|Ú¾H§}a€‰ò>MvÊJÚ`¾JÊQ1O~¨>ANk¶J9¾S• oNŒ¾6¶AsýÀô>GBwuÈúÓ¾ME‰“‹>KÜ©óÖ¦í¾Ca»YÇ>'æïì>1ì²GQDw¾E¥¾>9>LÚ{Ó¹ ¹¾LÁd¶ñÍ>E^…Œ@sؾ1èV&¾)¸kãîºî>CÎÙÍܶҾL/bix.>Mp îy{¾G=âÊï4²>6PÍð…Ø>JgÛ_¾AÀG—ä#Y>KCôÁê找MåaÒè:i>HøÄV¸fª¾;vŽ!ŠÝ½ÿ¸ñæ3Ï>>õI{Rs–¾Jì¤+½{>N.{5 ¾J‡¥ã³ó>@Bäu¥Š"¾ÍúOv¾9ÿïXù>HS¸ûl¾N‹ÒÄ>KãôžxŸ¾Bµ#6ÜΉ>4§Òŧ¾FßcÁÅŒn>M¬¦(°~'¾MOÏáä„>E ÿú¥Šè¾/9Üо-廾‰Â>DÛúÝèÊø¾M1¿HÒô>Màð–H¾G;Á—¿xx>5{k…z¢³>!Üi®b‘“¾B‘fMôÝ>LOS§þNt‰mP >I=Ûûàá~¾;]ù*½è:¾/ùÓÍÏ>@¯éŸÁ{¾JµùøÀã>N·PÒ Sð¾Kð‘4>@/Èi.¾²/æ­ ²¾:m[ÒUï>IÔò 3¾N¢Ë›íˆº>L+øe¾CP?Éçåº>$éœV+×>4^0™Ñrà¾GòT9|>N1ˆÐIžÆ¾MÇÚgÞ>Eêivçn¾1!Nµub7¾+ÆEaš#Å>D½ ³²¾M^ÑÞõs>N­PçGÖ¾HR–\ò?>7Å ©>Fù˜º¾B•|YaÒ>L'PKQ¹É¾O4WºŸõ>Jz= ¦Ä6¾>Hß².Ä×=¡glkZT>>D ‡Qcú¾Jˆà—nûÁ>OVùlHª ¾LWí£4‡ë>BH—}{g¾Bd²ºŽJ¾7˽NþÂ>Hƒ3ßyÛ¾O xýÆa>MÝ:è½ÎɾEABgeá^>-e“ËQ>0ÏQŽ«‹Æ¾F´U•>NNò„O¸¾OKL;„>H1\G»¾6 $Mn>ؾ"Ðx"QÃ>CIbM­Qq¾M…m”T>O¶ã®­k¾Jvaæàî3>=GÃÀsñå=ú‘‚ÁƒÙ¾@!ÿ rj>Kn³<(hª¾Oöô<Ó¨>L•jƒÎ$j¾B'©@ÑÔ>6"Wçj«>9;d†›Ñ¾IHŠn _K>O¶«•Ûâ:¾NN»©Á>Eg9W'¾,Ã_9‰¢¾1¤>¬qKE>F­„÷_¾Nò%(È7ï>O”ÂYþ˜¦¾Hja8£[|>6k²(*"†># ¶^«¾Cž)sµ‹>M¢lH™ÞG¾P-f!ɾ>KÚË·|¾>K+¬üžÎ½ñ×F®Óem>@%ÿcȾKÈ äd>PJìG*¾M^+NÇR*>BéŸ@^o¾Frâ7¾8˜õÌs >Iad!ÈꜾPQÑuy >O,úɥȾFo°=‹°ø>0V¼íP>0COHŒµ]¾P7öà±ÑÇ>I  ­tÅE¾9°WôaW¾˜^À¾M™>CÖÖ€Ö¾Mµ…°îÿ>P!šO£‰¾Lh¢eŒr>@·Ýæè(½ý(:…Í*1¾>I–;2.>Kƒqõ+¾P”$ÔÇ¢Ï>N°qiî…¾D³9 £ºz>&€1$hŒf>5´ÃK7ÿ¨¾H³Ò¬NN >PC·!ÕÓ ¾P48TO¼î>H[–Ô/Ån¾4¬R j>Ͼ(ð{¨ã>ENï8gH¾O2û¦¾©>P½ð%b;¾K—Çziç¼>=磟ž$ >Ê©§Ð¦Ž¾A_NR°·©>M+tý.•¾PïJw>NO[,ûü¾CZ>êñSQ>CfKö“,>9èí.zqU¾Jp<ïÛ8Ø>PÀj|,uξP5‚(¥‘˜>Go#½–¾1sÅ»ÛÁ¾0D&öÀÿ>G Ó¸X¢¾P/0N-rí>PêÔBW°¾KrÖ€±í>;mµ¹UË>¤}Á•¾CNä $¯>Np®³Üo¾Q>rÏZYÝ>N*#¹ýÙP¾BzÞ6þ4>¦t<öÐ><à A„2¾K»Â"%3ñ>Q))EyEÙ¾PL!µyh>Fõ³šéÄ›¾.õÒ×ý¾2Ä©v“ÅS>HD1Bf ¾P¥ìã*À)>Q#TkѾJô$ÄEX>:-Èßï^ >Ã+B ø¾Dƒî™ÝÄ>OdíÃÆ|1¾QŽ–ÏHOL>NY¡r üëLDI>>˜©š¾LžÛ–¦>Q†Êf¤ùÞ¾Pƒ³æä>GèìôW¾-ÁAÏþ¾3ñïd>I¼¼£¿@¾QÏ?é O>Qp-€õ¾KN zéE>:E,tZ*Ž> ëâ{\¾Dœv4À­>PiY>cy¾QæÊ'Oˆ>NîhZÌa¾B™ãæ=> O ‰ò•ù>? ç³æ m¾MŠ¨1H8>QÜúQ°•¾PጪIË>G¬ÑBú$¾/W7:¾3´Bç1>ž>I?LWòLh¾QM² v#>QÖ¿_,¾L,eB†ƒ>;Ê¥k*ç>øÙ×p¾D†‹›@$‰>P5K ®¾RGJãÓ±>Oð{û7X¾C§3epã'>˜_-ãÒ>>35Î’è¾M-Â’ád>R+B“²¾Qg;¾‰G>Hðà¡9™Ü¾2+[Írè¾1õ÷åµ>Hïn¶¼j¾Q{ RûOŠ>RRì\üJ+¾M“W–sû>>Ôho¼UF>­m8~—5¾CÈÒq4øß>P5È”&Îé¾R«™X=ÃÃ>P­³Îð¿K¾Eg <>!A*øeþ>;¯ò Žx¾L½^Ø·Ó!>RhKJ2Üm¾Rt=xÀ“>JÓÈY®6@¾68×ÿ¶¸—¾-&AqÖµ>Gý}Ðt]Ò¾Q‚6'wV>RÝÁ±IؾOxÝ,¯¬¢>A´þþX0Þ=ãwü'2¿ì¾BI‘ó:õ>Oõ¦…m‰¾S7‘?ý…>Q‘ñ9:û¾GØtŸ<ù˜>+vè•7Q¿>7‘ÒµS²¾K­†ñp!¥>R„ó7wó¾RÐŽÔbË>MJ`BŽ)¾;õ÷Ò³‰.¾"¼Ž#žÅ>FHuëy¾QQ‰Û¥’>Sgª÷xè¾P姀ÓÛa>DÂxú>$ÿ¾5§üõ–¾?Ñ0艪>NßVŽJ:¾SHV~Œ°ô>R“5÷JðÀFo>4§æD.°.>1ˆ8‘„ŽP¾IÕUHúm„>Rjà»Ë*¦¾S”3ü »„>P”È Å¾A­÷u΋L¾f£K¥>C¥w|Ì®¶¾Pγ#ë…ñ>S×­ Nya¾R3Ô"ñí>H†øX¿6¾+V)»uü#¾9‰~>LöUâ¢ÈO¾SP¬ÏeŽ>S›`¬*®¾NâîãŸ>=d­<¦i>"´-/1¤¾FÿÍåb‘S>Qú’Owú¾T>pyEA>QÀŒdÿU‹¾F(+Xïä¸>…^*>?Ó´‰,Bb¾O´'St—>T ;UèJ¾S‰îÿd.“>Lã Ú4̾7ÄÚ/HòC¾/ÑÆmrg£>Iû3•úUš¾RúÇ©¼K#>Tˆ8Em½¾QEòïvå¢>CéVƒé&ɽò5è°Aï¾BõÉl(ã>Q 5„°v¾T¦"Hʈ3>SkÅT\¾KHyëšu>2›¶t2>5Îp06Ã.¾L†²n„Ú>S×hoëáã¾TÀ ÖÃ0>PÏ‹J(îc¾AÜY*màô¾ôP™½Ý >E©¨[’$2¾RùÓgd>U*LlHø-¾SK àñ>IÔÃtÓ”‚¾,¦tU/+¾;nÍÏÛA>Nîd2o*¾T˜~mÚž>Tð|*òÒ¾PgM(õîÿ>@¬"#>!ædòv7¾Hiah>S»ä¼µ¾U {9£(>S3fœJòþH™‰F >$ÅÍ°†@>?ˆkˆu —¾Pzß™^×>UE§Û8¾U"ƒ­I->PóøJk¾=" ±ìd,¾)èèI¦Í»>J9«øª ¾SسI p>VÜÔv¸E¾S+ïïZ>G¤Uφùx¾JA»ºä¾A¬®nøË>Q]“¼=5¾Uå}ƒ…ý>U^5‡ m¾OÆ"qÞ]‡>:Õ,^>07{³Ÿ¸¾KÒ¶0¥[M>T”Γ;•¾V‚¢î×Dœ>S=Ю÷¾G£í@ —>më Uÿ>C;ìØïþR"4 ¨>V}…ëǾUªbíñ5>Oªý¾dº¾9Nk¿0¾2°äš¢ð>MBÌñª!n¾U? Z1dI>VûêÝþz¾Smsãom>FÂW,¬¾Ä>™’&æ¾Dm-.µñ>RÊ”0#xh¾Wòj‘8>V ñ¥ä²Ä¾Oæ«›˜ý>8¡ì:ççÕ>4W‰¤5ž<¾NeÀˆ?Ÿ>UÚ6î®5b¾WBš¸‹>SÂkŠ¹¼æ¾Fê©4øË=ÿœqÃL€>E?Aôø6¾SW0 sµb>W¥Ì à~/¾VŠ–¬Gžå>PBÑAÀ¾8â€Î¦¥¾5;Òj”>O9xÎ&¾Vge0¤þ>X³C¨`¾T@Wü¡~[>G†¼šH ¾ˆ€xå®[¾E«ó½>SÇ:õJrs¾X:„“°n">W&ÅCQ¬"¾PÅÿ¸[Ø>:#þ_‰÷>4õ l˜Öx¾O¸ªPÔ>VåÏuB~¾XºEWYâ>T꧕Od¾HŸŸ¯ßÇ0> –åƒ~¹E>E¨iÛIŒ“¾T-€fmõ>XÏÌM³¥¾Wã1È©hÂ>Q‚Þ-¬w¯¾OÚ"7^ñ,¾WRœ'W­\>Yo<á:¾UÃŒÚòu>J>žø_¸ú¾To£ô§¾E,è›H>TEv#½ñ¾Ybõ&G¿>X¿ÊÐðs¾R{4µú¤Á>?ñ,eù¶>1z+"Ò¦¾OíqÁþõ>W¨àœÛAT¾Z2Z›ì­>VÌO×:¾Ljýw¢ü >"ßÌã¿õa>D'§à{I˜¾TH]O²ÎR>YîÓ¯`»¾Yº[pö 0>S°²;÷ ¾BSí&`­ç¾+àú¤A‘>NÌ`ý¯y¾WáC0YO½>Zþ9½g¬Y¾Xà¸5-ç>O*w’ÊT¾,º<™—ѾB‰Mmƒ¿Í>T3[P¾Zkg”h’)>ZÎ…PQy¹¾U#†€²¶$>EW …>" %¯ªh¾MwšTÒ³£>Wñ¢3Ÿµ×¾[ËZ´êlƒ>Ydc³®ÖC¾Q@#UÕ|£>4¸·`t>@;•»Á¾S¥lÌÛ¦>ZÍÆÖÚœü¾[õÃi¬â>VÑð„aóB¾I 1‘À̾Çþ -WZ>Kyˆæ耾WÌŠÓ\‰>\Žy6'›é¾Zê!¢Ãß>S6YæõÃû¾<œ]ß%1þ¾:L.ìŒ[ª>Räôˆ–¾[§[—… >]#i?\âò¾X·9u5>Mr¯Œ^ö¾û–Õ¥J¾H´Š«Ä>Wa#—7¾]8c–°ñ>\ŠG­‹P{¾Uu¾'>CyÉ#>2]””‘p¾QÃ6­xù>[í&E)W¾^J…#ÄFˆ>Zˆ“É]¾QGÜp“Ïf>.͹mÃœF>E7ÝBKF¾V›¨|¦>]µÆÔd®É¾^6¶í®n´>WøT ©ß2¾H¬ßýºÁ¾ ëQ¼ü@¢>P-EÚÊ9(¾ZµP‡–>_VuŒÃŠÐ¾]ŠEk>T/+ù·ä¾;A‡¬#V¾@MzîE†>Ub̽S(Š¾]î‰B V>_ܧ٨P¾Z´Žìs>O$Q'*KŸ¾ úò(5N¾Léëý§>Y÷Y™÷fý¾`Ò»<ö>_EW"3qÞ¾Wg©iy>D”ŠßB8>4ÅŽúó¾S¬}ên²>]ÅXVñœ¾`°Ud·æº>]˜£¹¾T¾S8ªSµ5">2ñêÏ‘‹>F‘¼w5¹S¾X®eÄÑ­>`X?‡#p¾`À/8L´>ZäÑP³ÁþL‘¼È3é?¾!T^ýE>Q.„%ƒâ¾]4*¯~>aQ¥žê'¾`G ¦ˆd>WA0Üm´4¾A~ýêø4¾?(Ïÿ >V·R= )÷¾`\`caiæ>aÈ9µ1æɾ^‘¡abA>RÉq¬ ÇR¾&1ÒU0Ò¾Kì‹aŠâÔ>[»£e’¾a½d`Ì#>a¹î…y÷¸¾[›&^~5>K;LÁ˜Ò>+Ìö‘üξSì&/éz>` ¥Ø5¾b¥fm£«×>a'§.J’q¾WÀëιƒ>?‰âãÞ">C«l´èSä¾Y…ALnt>aÚ¹Š ’…¾c[ZÃ>`„#Q¾S !-Y¦>ÁââŽÄñ>P%/©jöM¾^í%>c=ò=¾bùƒòÆ-y>]Lqz¾K‹¾2¾fq¼>VCȹK›¾aŒf¤q²†>d+–Ögñ¾bdo'™×p>Y#O@ºª¾? @0Yµ¾Fu¯ÿ}h>\ cøî¡ô¾cnËõ:H&>d¢ E¶£¾aT{˜€o>Th×Y’¾>øÓv0¾Qƒœþi>`°ÞÏ­Ó÷¾dë龜T›>dž„FŸ#¾_œÕêükÿ>NS”Fm>4"ãäŸKȾX%ѸuÕf>c¸Óù´Ž¾eüÖ'«>dÓs…zξ[µÍ Ö>BnW‰Š>G£ˆsܾ^Erù.‡ì>e&]YUð@¾fœí£5"·>c*3DAܱ¾W’£VV>$rã‘Ò¯8>R©©óñ¾beVô*>fÜ’Öia¾fÉ# ´Û>aÁ/?ÁžQ —¨´¾1†Ú ÿ>Ys•xöKܾd©agª7>h0ãÉ@À¾f€ÿ4Üeˆ>_Ô0}Ÿä¾G5ÝÖ¢s¾F²p“Í´>` £ö?±¾g B2û»>i¶¦ð¾eŬi.w>[WÉÓ¹÷¾4(ÄÝ­‘©¾R™…çi½…>ci º•–uѾd˜â);,>VÃäñdä>ÊÌä¾YíZâ_>fE fä¾jÞ·š§‹->i·lI‡im¾býðàD¢>P*ôý _’>BÎŽ r<é¾` œÕ€ñ‘>i‡ÊÑ,¾lF¹œ¬g>iaQg2æ¾`ø§³zëÓ>C.6±[>Q$ È怪¾dBMÅNÐ>k»,0:¾mRÞ4õF>hž_^d]kõÌ+ >#W—e!G~>Y#Ûœ¨Dt¾gÔj E>n1'ô¥Ñ¾nÿ6ÂL>go¬ßëà¾Wx=•€P¾5>ÈÛç™>`® ÂßܾkR lž—>pgZ^¾nO" ”—Y>eÕ¢3ý°¾Q# 9ʾK!îS[4§>d⥯(ø&¾n¸+žºÄ>qHiæí^¾n<ƒõ4r>cÐ)Æ ”¾CåÇVŸ!¾VVŠRN•ì>i-ÏÔ}K,¾qŠ·&Z=>qÛtÄÏI̾mÈåƒS>a^Ìñ„>¾ gߎFX%¾_£}ü»’Y>m‘d‘%‰€¾rœøÝ>r†du)¾lñe1qˆÖ>\ý6¯&$>:.b·U*¾dÀD±Î_„>qè1@¾t-)Õ‹0>sNñ¨s¾kµHs»¿>VSÙ…bà¯>P/°êÓ¾jx7óÖÎ>s[Ôö- ã¾uµ÷w—Ã>syk„ñ‚‚¾j€åoQ>M_$;¦¾>Z±:­}ù³¾o¢Ú#©Æ>uÈÍŽ<Àp¾wsÂÝxGq¾gûç^:ì>7űš$T>c*=ä*ôU¾rÞ^Âd\>xZnÙ‡áK¾xÇ$¯X^[>sî„OÈÕ¾elžC™À¾0ZÔ·"¿ï>i­ÓŒE=¾v:Li*íO>{ pßPþ¾z`Kb/ˆC>sü Ü6˜œ¾bPîý³7‰¾Oc vF„>pŠ”M~¾yÿ÷Ñ~2r_›e†¾|œdè>sí‘?a¾]üo@^é¾]QÆ"„–Ù>tÖT‘ãÖk¾~X0\ö">€ÙÃlËÜÿ¾}ý‰tº~_>sÂùE˜¾SÛéߤ„¾fÖ‰l>yö£é».¾Á¢q:ì4>‚í!G.Ðb¾€"pü‰)>szÑ&~¾@£R`& ¾pzîÂ;³`>€&þ ^4Ÿ¾„õ$LF2>…€ xvx;yÌå%ï>ssSi(h>:e1>¾wpV+>„C­á7¾‰!ÝïdFU>ˆàEbe²(¾ƒFÿ wh=>rx/ìSè%>Zëœ;deM¾ú â‰òÖ^¾Žõ}Yq “>¢w c(¾…Ör¹*>q’XH¹ç=>lqòªÂ꾆«Ú¨F½€>‘EÍÄ´¾“ó3³ô;F>’…—à l¾‰ÝõE:„>oý¤…˜¢>zÃêÇŸ0§¾‘q1L>˜¾*Q,¼r¾›äÉÀ&ý,>™?œ¥¾Ÿ_¾¤“2>hk(† g>ŠB¸È÷«¾H¸®ËÜ>¤º‘åøÑA¾§5œÅõ:j>¤ÄC'tÁ¾™t=éd’¾W’ù@ÙÇ>¢}ÈÿXð¾³1ÒXüµg>¼‘@ª¥¯¾ÁcµÒ½®€>ÀA>Ë ¾‰·_ÁJ'¾è4¬AQÞ>H{ÂÂuï¾=1Sâb>ýF€`ùZ>8é.%©l¾FÔíëBQÇ>K6 k–m¾Hp Ú9Žo>>ytŽäÍ ¾3Œ4Ü>á¾7tSÞ‚>Fh[¤­ôß¾K5±Vl¼>HÞé¤âX¾@,øȇ>dmßWE)>5ܺ©¯ç¾Eí–ÄÅpÇ>K.D°9(¾IN{#Þr>@Ë0=×¾ø ¿¾4&#tÊ>Ec¡ÝR¢w¾K}<#Dï>IºÁ000¾Aœ«ìOl>#›ª—ÿç>2Jòø] Ö¾DÉRÒ¢Ã>JþËšyó¨¾J$Ûâ¼D>Bs¡;B’¾'µƒHþ`D¾0O–k·A_>D©+L/ݾJÓ·¤<Ž$>Jˆ…"¾CN³¡UJ3>,!6ªeb>,\W£›ì¾C_yó–¾½>J›Œ„rʾJæıp$>D,˜ÙóqE¾0Zù‚¸Î¾'×Z·ä•±>Bט°à¾JQÂLÆiß>K;%0g¾E žº„£>2¾æQK>#Vô“$¾A§¥ ht >I÷Ž(Ø̈¾K…í'þ*C>Eê%‰Ì=¾51â©‚P¹¾â4©ÅúB>@¬Q4‡Î¾IˆS1b‰õ>KÂÛŽ_ãs¾FÆ.Eôk>7¹ÑAŠ>"Hõölx¾?4QB«½¤>I9GÑ¥¾Kò:£‡èÔ>GÃÿîDä¾:M7÷~y€½÷BŒ„ZØ><⟯§î¾Hi°«Ð™>L/hü¤$¾Hn†{ˆV ><îtŠ@oú½÷ª› kû_¾:a¤N0ˆ>G¶éW«1[¾Lö g{Í>I6)À?”DÁáñ>+óµfÆ>7°ÇSW¾Fèkë’ïæ>L “ß俾Iñõb%bÃ>AÉÕ¾ìu¾Ö멾4Ï_T1Û>Eÿ’’ÓÊ“¾Kê,Nâž>JŸ@ÏÀÜ‹¾Bs3Ü^‘¡>&IrØž5>1½£J¡ÉϾDø§î«0>Kª²gF ‚¾K; Gj´•>CĆÊ´†¾,ÉÏÓ„|_¾,÷½µµŽÝ>CÓ ¡±{u¾KOOìÌÚ•>KÂZµï+¦¾EÊW«>1×4vÞÉ›>&åeÒ`S¾BŽDlv>JÒ÷÷V)˜¾L1çt¹>FOWå¾Òa¾5Z£¿½š¾¾·\û l±>A*§"C5¾J5÷ šÈ>L†‰ÿr£ž¾G‚OAÊEì>8ä°~ ˆ> .BÇ ³ò¾?GŸiˆ«>Isƒæ³•g¾L¼Îçu® >H¦ç½h+¾;úë5N¾HŒ)<>LÑv—7=¾I³îï!Ç >?ýý‰Æè¾q… çR¾8jíL˜ô>G{|‚½ˆ ¾LÁj²D\>JªªìïSH¾A¿yý€7«>!Ñ|zî*>4›t“対FBJ›\³>LˆIÐiî6¾Kƒ0µ²´>Ctõ7V»%¾)­C„pÍ ¾0‹dKy"R>DÝŽâÊؾL#ù"¦2>L;ñóŒ¾E…xÉÇô>11a%a†>(… Z˜'¾CN8è1,>K‘-kÞJ~¾LÍ¢M× >F±ÇÒIé,¾5•—ú[±í¾þÅwv|>A‘§«»*—¾JÍVéÁ>M6“ߎ©Ã¾H/*:°0>9úpwAÓŸ>ieYn¹+¾?UúÜs>IÕ4JŒš¾Mo{<\êO>I±q®<¾>UÆjH·=ý7Xw!x€>;.6ˆ|Ú¾H§}a€‰ò>MvÊJÚ`¾JÊQ1O~¨>ANk¶J9¾S• oNŒ¾6¶AsýÀô>GBwuÈúÓ¾ME‰“‹>KÜ©óÖ¦í¾Ca»YÇ>'æïì>1ì²GQDw¾E¥¾>9>LÚ{Ó¹ ¹¾LÁd¶ñÍ>E^…Œ@sؾ1èV&¾)¸kãîºî>CÎÙÍܶҾL/bix.>Mp îy{¾G=âÊï4²>6PÍð…Ø>JgÛ_¾AÀG—ä#Y>KCôÁê找MåaÒè:i>HøÄV¸fª¾;vŽ!ŠÝ½ÿ¸ñæ3Ï>>õI{Rs–¾Jì¤+½{>N.{5 ¾J‡¥ã³ó>@Bäu¥Š"¾ÍúOv¾9ÿïXù>HS¸ûl¾N‹ÒÄ>KãôžxŸ¾Bµ#6ÜΉ>4§Òŧ¾FßcÁÅŒn>M¬¦(°~'¾MOÏáä„>E ÿú¥Šè¾/9Üо-廾‰Â>DÛúÝèÊø¾M1¿HÒô>Màð–H¾G;Á—¿xx>5{k…z¢³>!Üi®b‘“¾B‘fMôÝ>LOS§þNt‰mP >I=Ûûàá~¾;]ù*½è:¾/ùÓÍÏ>@¯éŸÁ{¾JµùøÀã>N·PÒ Sð¾Kð‘4>@/Èi.¾²/æ­ ²¾:m[ÒUï>IÔò 3¾N¢Ë›íˆº>L+øe¾CP?Éçåº>$éœV+×>4^0™Ñrà¾GòT9|>N1ˆÐIžÆ¾MÇÚgÞ>Eêivçn¾1!Nµub7¾+ÆEaš#Å>D½ ³²¾M^ÑÞõs>N­PçGÖ¾HR–\ò?>7Å ©>Fù˜º¾B•|YaÒ>L'PKQ¹É¾O4WºŸõ>Jz= ¦Ä6¾>Hß².Ä×=¡glkZT>>D ‡Qcú¾Jˆà—nûÁ>OVùlHª ¾LWí£4‡ë>BH—}{g¾Bd²ºŽJ¾7˽NþÂ>Hƒ3ßyÛ¾O xýÆa>MÝ:è½ÎɾEABgeá^>-e“ËQ>0ÏQŽ«‹Æ¾F´U•>NNò„O¸¾OKL;„>H1\G»¾6 $Mn>ؾ"Ðx"QÃ>CIbM­Qq¾M…m”T>O¶ã®­k¾Jvaæàî3>=GÃÀsñå=ú‘‚ÁƒÙ¾@!ÿ rj>Kn³<(hª¾Oöô<Ó¨>L•jƒÎ$j¾B'©@ÑÔ>6"Wçj«>9;d†›Ñ¾IHŠn _K>O¶«•Ûâ:¾NN»©Á>Eg9W'¾,Ã_9‰¢¾1¤>¬qKE>F­„÷_¾Nò%(È7ï>O”ÂYþ˜¦¾Hja8£[|>6k²(*"†># ¶^«¾Cž)sµ‹>M¢lH™ÞG¾P-f!ɾ>KÚË·|¾>K+¬üžÎ½ñ×F®Óem>@%ÿcȾKÈ äd>PJìG*¾M^+NÇR*>BéŸ@^o¾Frâ7¾8˜õÌs >Iad!ÈꜾPQÑuy >O,úɥȾFo°=‹°ø>0V¼íP>0COHŒµ]¾P7öà±ÑÇ>I  ­tÅE¾9°WôaW¾˜^À¾M™>CÖÖ€Ö¾Mµ…°îÿ>P!šO£‰¾Lh¢eŒr>@·Ýæè(½ý(:…Í*1¾>I–;2.>Kƒqõ+¾P”$ÔÇ¢Ï>N°qiî…¾D³9 £ºz>&€1$hŒf>5´ÃK7ÿ¨¾H³Ò¬NN >PC·!ÕÓ ¾P48TO¼î>H[–Ô/Ån¾4¬R j>Ͼ(ð{¨ã>ENï8gH¾O2û¦¾©>P½ð%b;¾K—Çziç¼>=磟ž$ >Ê©§Ð¦Ž¾A_NR°·©>M+tý.•¾PïJw>NO[,ûü¾CZ>êñSQ>CfKö“,>9èí.zqU¾Jp<ïÛ8Ø>PÀj|,uξP5‚(¥‘˜>Go#½–¾1sÅ»ÛÁ¾0D&öÀÿ>G Ó¸X¢¾P/0N-rí>PêÔBW°¾KrÖ€±í>;mµ¹UË>¤}Á•¾CNä $¯>Np®³Üo¾Q>rÏZYÝ>N*#¹ýÙP¾BzÞ6þ4>¦t<öÐ><à A„2¾K»Â"%3ñ>Q))EyEÙ¾PL!µyh>Fõ³šéÄ›¾.õÒ×ý¾2Ä©v“ÅS>HD1Bf ¾P¥ìã*À)>Q#TkѾJô$ÄEX>:-Èßï^ >Ã+B ø¾Dƒî™ÝÄ>OdíÃÆ|1¾QŽ–ÏHOL>NY¡r üëLDI>>˜©š¾LžÛ–¦>Q†Êf¤ùÞ¾Pƒ³æä>GèìôW¾-ÁAÏþ¾3ñïd>I¼¼£¿@¾QÏ?é O>Qp-€õ¾KN zéE>:E,tZ*Ž> ëâ{\¾Dœv4À­>PiY>cy¾QæÊ'Oˆ>NîhZÌa¾B™ãæ=> O ‰ò•ù>? ç³æ m¾MŠ¨1H8>QÜúQ°•¾PጪIË>G¬ÑBú$¾/W7:¾3´Bç1>ž>I?LWòLh¾QM² v#>QÖ¿_,¾L,eB†ƒ>;Ê¥k*ç>øÙ×p¾D†‹›@$‰>P5K ®¾RGJãÓ±>Oð{û7X¾C§3epã'>˜_-ãÒ>>35Î’è¾M-Â’ád>R+B“²¾Qg;¾‰G>Hðà¡9™Ü¾2+[Írè¾1õ÷åµ>Hïn¶¼j¾Q{ RûOŠ>RRì\üJ+¾M“W–sû>>Ôho¼UF>­m8~—5¾CÈÒq4øß>P5È”&Îé¾R«™X=ÃÃ>P­³Îð¿K¾Eg <>!A*øeþ>;¯ò Žx¾L½^Ø·Ó!>RhKJ2Üm¾Rt=xÀ“>JÓÈY®6@¾68×ÿ¶¸—¾-&AqÖµ>Gý}Ðt]Ò¾Q‚6'wV>RÝÁ±IؾOxÝ,¯¬¢>A´þþX0Þ=ãwü'2¿ì¾BI‘ó:õ>Oõ¦…m‰¾S7‘?ý…>Q‘ñ9:û¾GØtŸ<ù˜>+vè•7Q¿>7‘ÒµS²¾K­†ñp!¥>R„ó7wó¾RÐŽÔbË>MJ`BŽ)¾;õ÷Ò³‰.¾"¼Ž#žÅ>FHuëy¾QQ‰Û¥’>Sgª÷xè¾P姀ÓÛa>DÂxú>$ÿ¾5§üõ–¾?Ñ0艪>NßVŽJ:¾SHV~Œ°ô>R“5÷JðÀFo>4§æD.°.>1ˆ8‘„ŽP¾IÕUHúm„>Rjà»Ë*¦¾S”3ü »„>P”È Å¾A­÷u΋L¾f£K¥>C¥w|Ì®¶¾Pγ#ë…ñ>S×­ Nya¾R3Ô"ñí>H†øX¿6¾+V)»uü#¾9‰~>LöUâ¢ÈO¾SP¬ÏeŽ>S›`¬*®¾NâîãŸ>=d­<¦i>"´-/1¤¾FÿÍåb‘S>Qú’Owú¾T>pyEA>QÀŒdÿU‹¾F(+Xïä¸>…^*>?Ó´‰,Bb¾O´'St—>T ;UèJ¾S‰îÿd.“>Lã Ú4̾7ÄÚ/HòC¾/ÑÆmrg£>Iû3•úUš¾RúÇ©¼K#>Tˆ8Em½¾QEòïvå¢>CéVƒé&ɽò5è°Aï¾BõÉl(ã>Q 5„°v¾T¦"Hʈ3>SkÅT\¾KHyëšu>2›¶t2>5Îp06Ã.¾L†²n„Ú>S×hoëáã¾TÀ ÖÃ0>PÏ‹J(îc¾AÜY*màô¾ôP™½Ý >E©¨[’$2¾RùÓgd>U*LlHø-¾SK àñ>IÔÃtÓ”‚¾,¦tU/+¾;nÍÏÛA>Nîd2o*¾T˜~mÚž>Tð|*òÒ¾PgM(õîÿ>@¬"#>!ædòv7¾Hiah>S»ä¼µ¾U {9£(>S3fœJòþH™‰F >$ÅÍ°†@>?ˆkˆu —¾Pzß™^×>UE§Û8¾U"ƒ­I->PóøJk¾=" ±ìd,¾)èèI¦Í»>J9«øª ¾SسI p>VÜÔv¸E¾S+ïïZ>G¤Uφùx¾JA»ºä¾A¬®nøË>Q]“¼=5¾Uå}ƒ…ý>U^5‡ m¾OÆ"qÞ]‡>:Õ,^>07{³Ÿ¸¾KÒ¶0¥[M>T”Γ;•¾V‚¢î×Dœ>S=Ю÷¾G£í@ —>më Uÿ>C;ìØïþR"4 ¨>V}…ëǾUªbíñ5>Oªý¾dº¾9Nk¿0¾2°äš¢ð>MBÌñª!n¾U? Z1dI>VûêÝþz¾Smsãom>FÂW,¬¾Ä>™’&æ¾Dm-.µñ>RÊ”0#xh¾Wòj‘8>V ñ¥ä²Ä¾Oæ«›˜ý>8¡ì:ççÕ>4W‰¤5ž<¾NeÀˆ?Ÿ>UÚ6î®5b¾WBš¸‹>SÂkŠ¹¼æ¾Fê©4øË=ÿœqÃL€>E?Aôø6¾SW0 sµb>W¥Ì à~/¾VŠ–¬Gžå>PBÑAÀ¾8â€Î¦¥¾5;Òj”>O9xÎ&¾Vge0¤þ>X³C¨`¾T@Wü¡~[>G†¼šH ¾ˆ€xå®[¾E«ó½>SÇ:õJrs¾X:„“°n">W&ÅCQ¬"¾PÅÿ¸[Ø>:#þ_‰÷>4õ l˜Öx¾O¸ªPÔ>VåÏuB~¾XºEWYâ>T꧕Od¾HŸŸ¯ßÇ0> –åƒ~¹E>E¨iÛIŒ“¾T-€fmõ>XÏÌM³¥¾Wã1È©hÂ>Q‚Þ-¬w¯¾OÚ"7^ñ,¾WRœ'W­\>Yo<á:¾UÃŒÚòu>J>žø_¸ú¾To£ô§¾E,è›H>TEv#½ñ¾Ybõ&G¿>X¿ÊÐðs¾R{4µú¤Á>?ñ,eù¶>1z+"Ò¦¾OíqÁþõ>W¨àœÛAT¾Z2Z›ì­>VÌO×:¾Ljýw¢ü >"ßÌã¿õa>D'§à{I˜¾TH]O²ÎR>YîÓ¯`»¾Yº[pö 0>S°²;÷ ¾BSí&`­ç¾+àú¤A‘>NÌ`ý¯y¾WáC0YO½>Zþ9½g¬Y¾Xà¸5-ç>O*w’ÊT¾,º<™—ѾB‰Mmƒ¿Í>T3[P¾Zkg”h’)>ZÎ…PQy¹¾U#†€²¶$>EW …>" %¯ªh¾MwšTÒ³£>Wñ¢3Ÿµ×¾[ËZ´êlƒ>Ydc³®ÖC¾Q@#UÕ|£>4¸·`t>@;•»Á¾S¥lÌÛ¦>ZÍÆÖÚœü¾[õÃi¬â>VÑð„aóB¾I 1‘À̾Çþ -WZ>Kyˆæ耾WÌŠÓ\‰>\Žy6'›é¾Zê!¢Ãß>S6YæõÃû¾<œ]ß%1þ¾:L.ìŒ[ª>Räôˆ–¾[§[—… >]#i?\âò¾X·9u5>Mr¯Œ^ö¾û–Õ¥J¾H´Š«Ä>Wa#—7¾]8c–°ñ>\ŠG­‹P{¾Uu¾'>CyÉ#>2]””‘p¾QÃ6­xù>[í&E)W¾^J…#ÄFˆ>Zˆ“É]¾QGÜp“Ïf>.͹mÃœF>E7ÝBKF¾V›¨|¦>]µÆÔd®É¾^6¶í®n´>WøT ©ß2¾H¬ßýºÁ¾ ëQ¼ü@¢>P-EÚÊ9(¾ZµP‡–>_VuŒÃŠÐ¾]ŠEk>T/+ù·ä¾;A‡¬#V¾@MzîE†>Ub̽S(Š¾]î‰B V>_ܧ٨P¾Z´Žìs>O$Q'*KŸ¾ úò(5N¾Léëý§>Y÷Y™÷fý¾`Ò»<ö>_EW"3qÞ¾Wg©iy>D”ŠßB8>4ÅŽúó¾S¬}ên²>]ÅXVñœ¾`°Ud·æº>]˜£¹¾T¾S8ªSµ5">2ñêÏ‘‹>F‘¼w5¹S¾X®eÄÑ­>`X?‡#p¾`À/8L´>ZäÑP³ÁþL‘¼È3é?¾!T^ýE>Q.„%ƒâ¾]4*¯~>aQ¥žê'¾`G ¦ˆd>WA0Üm´4¾A~ýêø4¾?(Ïÿ >V·R= )÷¾`\`caiæ>aÈ9µ1æɾ^‘¡abA>RÉq¬ ÇR¾&1ÒU0Ò¾Kì‹aŠâÔ>[»£e’¾a½d`Ì#>a¹î…y÷¸¾[›&^~5>K;LÁ˜Ò>+Ìö‘üξSì&/éz>` ¥Ø5¾b¥fm£«×>a'§.J’q¾WÀëιƒ>?‰âãÞ">C«l´èSä¾Y…ALnt>aÚ¹Š ’…¾c[ZÃ>`„#Q¾S !-Y¦>ÁââŽÄñ>P%/©jöM¾^í%>c=ò=¾bùƒòÆ-y>]Lqz¾K‹¾2¾fq¼>VCȹK›¾aŒf¤q²†>d+–Ögñ¾bdo'™×p>Y#O@ºª¾? @0Yµ¾Fu¯ÿ}h>\ cøî¡ô¾cnËõ:H&>d¢ E¶£¾aT{˜€o>Th×Y’¾>øÓv0¾Qƒœþi>`°ÞÏ­Ó÷¾dë龜T›>dž„FŸ#¾_œÕêükÿ>NS”Fm>4"ãäŸKȾX%ѸuÕf>c¸Óù´Ž¾eüÖ'«>dÓs…zξ[µÍ Ö>BnW‰Š>G£ˆsܾ^Erù.‡ì>e&]YUð@¾fœí£5"·>c*3DAܱ¾W’£VV>$rã‘Ò¯8>R©©óñ¾beVô*>fÜ’Öia¾fÉ# ´Û>aÁ/?ÁžQ —¨´¾1†Ú ÿ>Ys•xöKܾd©agª7>h0ãÉ@À¾f€ÿ4Üeˆ>_Ô0}Ÿä¾G5ÝÖ¢s¾F²p“Í´>` £ö?±¾g B2û»>i¶¦ð¾eŬi.w>[WÉÓ¹÷¾4(ÄÝ­‘©¾R™…çi½…>ci º•–uѾd˜â);,>VÃäñdä>ÊÌä¾YíZâ_>fE fä¾jÞ·š§‹->i·lI‡im¾býðàD¢>P*ôý _’>BÎŽ r<é¾` œÕ€ñ‘>i‡ÊÑ,¾lF¹œ¬g>iaQg2æ¾`ø§³zëÓ>C.6±[>Q$ È怪¾dBMÅNÐ>k»,0:¾mRÞ4õF>hž_^d]kõÌ+ >#W—e!G~>Y#Ûœ¨Dt¾gÔj E>n1'ô¥Ñ¾nÿ6ÂL>go¬ßëà¾Wx=•€P¾5>ÈÛç™>`® ÂßܾkR lž—>pgZ^¾nO" ”—Y>eÕ¢3ý°¾Q# 9ʾK!îS[4§>d⥯(ø&¾n¸+žºÄ>qHiæí^¾n<ƒõ4r>cÐ)Æ ”¾CåÇVŸ!¾VVŠRN•ì>i-ÏÔ}K,¾qŠ·&Z=>qÛtÄÏI̾mÈåƒS>a^Ìñ„>¾ gߎFX%¾_£}ü»’Y>m‘d‘%‰€¾rœøÝ>r†du)¾lñe1qˆÖ>\ý6¯&$>:.b·U*¾dÀD±Î_„>qè1@¾t-)Õ‹0>sNñ¨s¾kµHs»¿>VSÙ…bà¯>P/°êÓ¾jx7óÖÎ>s[Ôö- ã¾uµ÷w—Ã>syk„ñ‚‚¾j€åoQ>M_$;¦¾>Z±:­}ù³¾o¢Ú#©Æ>uÈÍŽ<Àp¾wsÂÝxGq¾gûç^:ì>7űš$T>c*=ä*ôU¾rÞ^Âd\>xZnÙ‡áK¾xÇ$¯X^[>sî„OÈÕ¾elžC™À¾0ZÔ·"¿ï>i­ÓŒE=¾v:Li*íO>{ pßPþ¾z`Kb/ˆC>sü Ü6˜œ¾bPîý³7‰¾Oc vF„>pŠ”M~¾yÿ÷Ñ~2r_›e†¾|œdè>sí‘?a¾]üo@^é¾]QÆ"„–Ù>tÖT‘ãÖk¾~X0\ö">€ÙÃlËÜÿ¾}ý‰tº~_>sÂùE˜¾SÛéߤ„¾fÖ‰l>yö£é».¾Á¢q:ì4>‚í!G.Ðb¾€"pü‰)>szÑ&~¾@£R`& ¾pzîÂ;³`>€&þ ^4Ÿ¾„õ$LF2>…€ xvx;yÌå%ï>ssSi(h>:e1>¾wpV+>„C­á7¾‰!ÝïdFU>ˆàEbe²(¾ƒFÿ wh=>rx/ìSè%>Zëœ;deM¾ú â‰òÖ^¾Žõ}Yq “>¢w c(¾…Ör¹*>q’XH¹ç=>lqòªÂ꾆«Ú¨F½€>‘EÍÄ´¾“ó3³ô;F>’…—à l¾‰ÝõE:„>oý¤…˜¢>zÃêÇŸ0§¾‘q1L>˜¾*Q,¼r¾›äÉÀ&ý,>™?œ¥¾Ÿ_¾¤“2>hk(† g>ŠB¸È÷«¾H¸®ËÜ>¤º‘åøÑA¾§5œÅõ:j>¤ÄC'tÁ¾™t=éd’¾W’ù@ÙÇ>¢}ÈÿXð¾³1ÒXüµg>¼‘@ª¥¯¾ÁcµÒ½®€>ÀA>Ë ¾‰·_ÁJ'¾è4¬AQÞ>H{ÂÂuï¾=1Sâb>ýF€`ùZ>8é.%©l¾FÔíëBQÇ>K6 k–m¾Hp Ú9Žo>>ytŽäÍ ¾3Œ4Ü>á¾7tSÞ‚>Fh[¤­ôß¾K5±Vl¼>HÞé¤âX¾@,øȇ>dmßWE)>5ܺ©¯ç¾Eí–ÄÅpÇ>K.D°9(¾IN{#Þr>@Ë0=×¾ø ¿¾4&#tÊ>Ec¡ÝR¢w¾K}<#Dï>IºÁ000¾Aœ«ìOl>#›ª—ÿç>2Jòø] Ö¾DÉRÒ¢Ã>JþËšyó¨¾J$Ûâ¼D>Bs¡;B’¾'µƒHþ`D¾0O–k·A_>D©+L/ݾJÓ·¤<Ž$>Jˆ…"¾CN³¡UJ3>,!6ªeb>,\W£›ì¾C_yó–¾½>J›Œ„rʾJæıp$>D,˜ÙóqE¾0Zù‚¸Î¾'×Z·ä•±>Bט°à¾JQÂLÆiß>K;%0g¾E žº„£>2¾æQK>#Vô“$¾A§¥ ht >I÷Ž(Ø̈¾K…í'þ*C>Eê%‰Ì=¾51â©‚P¹¾â4©ÅúB>@¬Q4‡Î¾IˆS1b‰õ>KÂÛŽ_ãs¾FÆ.Eôk>7¹ÑAŠ>"Hõölx¾?4QB«½¤>I9GÑ¥¾Kò:£‡èÔ>GÃÿîDä¾:M7÷~y€½÷BŒ„ZØ><⟯§î¾Hi°«Ð™>L/hü¤$¾Hn†{ˆV ><îtŠ@oú½÷ª› kû_¾:a¤N0ˆ>G¶éW«1[¾Lö g{Í>I6)À?”DÁáñ>+óµfÆ>7°ÇSW¾Fèkë’ïæ>L “ß俾Iñõb%bÃ>AÉÕ¾ìu¾Ö멾4Ï_T1Û>Eÿ’’ÓÊ“¾Kê,Nâž>JŸ@ÏÀÜ‹¾Bs3Ü^‘¡>&IrØž5>1½£J¡ÉϾDø§î«0>Kª²gF ‚¾K; Gj´•>CĆÊ´†¾,ÉÏÓ„|_¾,÷½µµŽÝ>CÓ ¡±{u¾KOOìÌÚ•>KÂZµï+¦¾EÊW«>1×4vÞÉ›>&åeÒ`S¾BŽDlv>JÒ÷÷V)˜¾L1çt¹>FOWå¾Òa¾5Z£¿½š¾¾·\û l±>A*§"C5¾J5÷ šÈ>L†‰ÿr£ž¾G‚OAÊEì>8ä°~ ˆ> .BÇ ³ò¾?GŸiˆ«>Isƒæ³•g¾L¼Îçu® >H¦ç½h+¾;úë5N¾HŒ)<>LÑv—7=¾I³îï!Ç >?ýý‰Æè¾q… çR¾8jíL˜ô>G{|‚½ˆ ¾LÁj²D\>JªªìïSH¾A¿yý€7«>!Ñ|zî*>4›t“対FBJ›\³>LˆIÐiî6¾Kƒ0µ²´>Ctõ7V»%¾)­C„pÍ ¾0‹dKy"R>DÝŽâÊؾL#ù"¦2>L;ñóŒ¾E…xÉÇô>11a%a†>(… Z˜'¾CN8è1,>K‘-kÞJ~¾LÍ¢M× >F±ÇÒIé,¾5•—ú[±í¾þÅwv|>A‘§«»*—¾JÍVéÁ>M6“ߎ©Ã¾H/*:°0>9úpwAÓŸ>ieYn¹+¾?UúÜs>IÕ4JŒš¾Mo{<\êO>I±q®<¾>UÆjH·=ý7Xw!x€>;.6ˆ|Ú¾H§}a€‰ò>MvÊJÚ`¾JÊQ1O~¨>ANk¶J9¾S• oNŒ¾6¶AsýÀô>GBwuÈúÓ¾ME‰“‹>KÜ©óÖ¦í¾Ca»YÇ>'æïì>1ì²GQDw¾E¥¾>9>LÚ{Ó¹ ¹¾LÁd¶ñÍ>E^…Œ@sؾ1èV&¾)¸kãîºî>CÎÙÍܶҾL/bix.>Mp îy{¾G=âÊï4²>6PÍð…Ø>JgÛ_¾AÀG—ä#Y>KCôÁê找MåaÒè:i>HøÄV¸fª¾;vŽ!ŠÝ½ÿ¸ñæ3Ï>>õI{Rs–¾Jì¤+½{>N.{5 ¾J‡¥ã³ó>@Bäu¥Š"¾ÍúOv¾9ÿïXù>HS¸ûl¾N‹ÒÄ>KãôžxŸ¾Bµ#6ÜΉ>4§Òŧ¾FßcÁÅŒn>M¬¦(°~'¾MOÏáä„>E ÿú¥Šè¾/9Üо-廾‰Â>DÛúÝèÊø¾M1¿HÒô>Màð–H¾G;Á—¿xx>5{k…z¢³>!Üi®b‘“¾B‘fMôÝ>LOS§þNt‰mP >I=Ûûàá~¾;]ù*½è:¾/ùÓÍÏ>@¯éŸÁ{¾JµùøÀã>N·PÒ Sð¾Kð‘4>@/Èi.¾²/æ­ ²¾:m[ÒUï>IÔò 3¾N¢Ë›íˆº>L+øe¾CP?Éçåº>$éœV+×>4^0™Ñrà¾GòT9|>N1ˆÐIžÆ¾MÇÚgÞ>Eêivçn¾1!Nµub7¾+ÆEaš#Å>D½ ³²¾M^ÑÞõs>N­PçGÖ¾HR–\ò?>7Å ©>Fù˜º¾B•|YaÒ>L'PKQ¹É¾O4WºŸõ>Jz= ¦Ä6¾>Hß².Ä×=¡glkZT>>D ‡Qcú¾Jˆà—nûÁ>OVùlHª ¾LWí£4‡ë>BH—}{g¾Bd²ºŽJ¾7˽NþÂ>Hƒ3ßyÛ¾O xýÆa>MÝ:è½ÎɾEABgeá^>-e“ËQ>0ÏQŽ«‹Æ¾F´U•>NNò„O¸¾OKL;„>H1\G»¾6 $Mn>ؾ"Ðx"QÃ>CIbM­Qq¾M…m”T>O¶ã®­k¾Jvaæàî3>=GÃÀsñå=ú‘‚ÁƒÙ¾@!ÿ rj>Kn³<(hª¾Oöô<Ó¨>L•jƒÎ$j¾B'©@ÑÔ>6"Wçj«>9;d†›Ñ¾IHŠn _K>O¶«•Ûâ:¾NN»©Á>Eg9W'¾,Ã_9‰¢¾1¤>¬qKE>F­„÷_¾Nò%(È7ï>O”ÂYþ˜¦¾Hja8£[|>6k²(*"†># ¶^«¾Cž)sµ‹>M¢lH™ÞG¾P-f!ɾ>KÚË·|¾>K+¬üžÎ½ñ×F®Óem>@%ÿcȾKÈ äd>PJìG*¾M^+NÇR*>BéŸ@^o¾Frâ7¾8˜õÌs >Iad!ÈꜾPQÑuy >O,úɥȾFo°=‹°ø>0V¼íP>0COHŒµ]¾P7öà±ÑÇ>I  ­tÅE¾9°WôaW¾˜^À¾M™>CÖÖ€Ö¾Mµ…°îÿ>P!šO£‰¾Lh¢eŒr>@·Ýæè(½ý(:…Í*1¾>I–;2.>Kƒqõ+¾P”$ÔÇ¢Ï>N°qiî…¾D³9 £ºz>&€1$hŒf>5´ÃK7ÿ¨¾H³Ò¬NN >PC·!ÕÓ ¾P48TO¼î>H[–Ô/Ån¾4¬R j>Ͼ(ð{¨ã>ENï8gH¾O2û¦¾©>P½ð%b;¾K—Çziç¼>=磟ž$ >Ê©§Ð¦Ž¾A_NR°·©>M+tý.•¾PïJw>NO[,ûü¾CZ>êñSQ>CfKö“,>9èí.zqU¾Jp<ïÛ8Ø>PÀj|,uξP5‚(¥‘˜>Go#½–¾1sÅ»ÛÁ¾0D&öÀÿ>G Ó¸X¢¾P/0N-rí>PêÔBW°¾KrÖ€±í>;mµ¹UË>¤}Á•¾CNä $¯>Np®³Üo¾Q>rÏZYÝ>N*#¹ýÙP¾BzÞ6þ4>¦t<öÐ><à A„2¾K»Â"%3ñ>Q))EyEÙ¾PL!µyh>Fõ³šéÄ›¾.õÒ×ý¾2Ä©v“ÅS>HD1Bf ¾P¥ìã*À)>Q#TkѾJô$ÄEX>:-Èßï^ >Ã+B ø¾Dƒî™ÝÄ>OdíÃÆ|1¾QŽ–ÏHOL>NY¡r üëLDI>>˜©š¾LžÛ–¦>Q†Êf¤ùÞ¾Pƒ³æä>GèìôW¾-ÁAÏþ¾3ñïd>I¼¼£¿@¾QÏ?é O>Qp-€õ¾KN zéE>:E,tZ*Ž> ëâ{\¾Dœv4À­>PiY>cy¾QæÊ'Oˆ>NîhZÌa¾B™ãæ=> O ‰ò•ù>? ç³æ m¾MŠ¨1H8>QÜúQ°•¾PጪIË>G¬ÑBú$¾/W7:¾3´Bç1>ž>I?LWòLh¾QM² v#>QÖ¿_,¾L,eB†ƒ>;Ê¥k*ç>øÙ×p¾D†‹›@$‰>P5K ®¾RGJãÓ±>Oð{û7X¾C§3epã'>˜_-ãÒ>>35Î’è¾M-Â’ád>R+B“²¾Qg;¾‰G>Hðà¡9™Ü¾2+[Írè¾1õ÷åµ>Hïn¶¼j¾Q{ RûOŠ>RRì\üJ+¾M“W–sû>>Ôho¼UF>­m8~—5¾CÈÒq4øß>P5È”&Îé¾R«™X=ÃÃ>P­³Îð¿K¾Eg <>!A*øeþ>;¯ò Žx¾L½^Ø·Ó!>RhKJ2Üm¾Rt=xÀ“>JÓÈY®6@¾68×ÿ¶¸—¾-&AqÖµ>Gý}Ðt]Ò¾Q‚6'wV>RÝÁ±IؾOxÝ,¯¬¢>A´þþX0Þ=ãwü'2¿ì¾BI‘ó:õ>Oõ¦…m‰¾S7‘?ý…>Q‘ñ9:û¾GØtŸ<ù˜>+vè•7Q¿>7‘ÒµS²¾K­†ñp!¥>R„ó7wó¾RÐŽÔbË>MJ`BŽ)¾;õ÷Ò³‰.¾"¼Ž#žÅ>FHuëy¾QQ‰Û¥’>Sgª÷xè¾P姀ÓÛa>DÂxú>$ÿ¾5§üõ–¾?Ñ0艪>NßVŽJ:¾SHV~Œ°ô>R“5÷JðÀFo>4§æD.°.>1ˆ8‘„ŽP¾IÕUHúm„>Rjà»Ë*¦¾S”3ü »„>P”È Å¾A­÷u΋L¾f£K¥>C¥w|Ì®¶¾Pγ#ë…ñ>S×­ Nya¾R3Ô"ñí>H†øX¿6¾+V)»uü#¾9‰~>LöUâ¢ÈO¾SP¬ÏeŽ>S›`¬*®¾NâîãŸ>=d­<¦i>"´-/1¤¾FÿÍåb‘S>Qú’Owú¾T>pyEA>QÀŒdÿU‹¾F(+Xïä¸>…^*>?Ó´‰,Bb¾O´'St—>T ;UèJ¾S‰îÿd.“>Lã Ú4̾7ÄÚ/HòC¾/ÑÆmrg£>Iû3•úUš¾RúÇ©¼K#>Tˆ8Em½¾QEòïvå¢>CéVƒé&ɽò5è°Aï¾BõÉl(ã>Q 5„°v¾T¦"Hʈ3>SkÅT\¾KHyëšu>2›¶t2>5Îp06Ã.¾L†²n„Ú>S×hoëáã¾TÀ ÖÃ0>PÏ‹J(îc¾AÜY*màô¾ôP™½Ý >E©¨[’$2¾RùÓgd>U*LlHø-¾SK àñ>IÔÃtÓ”‚¾,¦tU/+¾;nÍÏÛA>Nîd2o*¾T˜~mÚž>Tð|*òÒ¾PgM(õîÿ>@¬"#>!ædòv7¾Hiah>S»ä¼µ¾U {9£(>S3fœJòþH™‰F >$ÅÍ°†@>?ˆkˆu —¾Pzß™^×>UE§Û8¾U"ƒ­I->PóøJk¾=" ±ìd,¾)èèI¦Í»>J9«øª ¾SسI p>VÜÔv¸E¾S+ïïZ>G¤Uφùx¾JA»ºä¾A¬®nøË>Q]“¼=5¾Uå}ƒ…ý>U^5‡ m¾OÆ"qÞ]‡>:Õ,^>07{³Ÿ¸¾KÒ¶0¥[M>T”Γ;•¾V‚¢î×Dœ>S=Ю÷¾G£í@ —>më Uÿ>C;ìØïþR"4 ¨>V}…ëǾUªbíñ5>Oªý¾dº¾9Nk¿0¾2°äš¢ð>MBÌñª!n¾U? Z1dI>VûêÝþz¾Smsãom>FÂW,¬¾Ä>™’&æ¾Dm-.µñ>RÊ”0#xh¾Wòj‘8>V ñ¥ä²Ä¾Oæ«›˜ý>8¡ì:ççÕ>4W‰¤5ž<¾NeÀˆ?Ÿ>UÚ6î®5b¾WBš¸‹>SÂkŠ¹¼æ¾Fê©4øË=ÿœqÃL€>E?Aôø6¾SW0 sµb>W¥Ì à~/¾VŠ–¬Gžå>PBÑAÀ¾8â€Î¦¥¾5;Òj”>O9xÎ&¾Vge0¤þ>X³C¨`¾T@Wü¡~[>G†¼šH ¾ˆ€xå®[¾E«ó½>SÇ:õJrs¾X:„“°n">W&ÅCQ¬"¾PÅÿ¸[Ø>:#þ_‰÷>4õ l˜Öx¾O¸ªPÔ>VåÏuB~¾XºEWYâ>T꧕Od¾HŸŸ¯ßÇ0> –åƒ~¹E>E¨iÛIŒ“¾T-€fmõ>XÏÌM³¥¾Wã1È©hÂ>Q‚Þ-¬w¯¾OÚ"7^ñ,¾WRœ'W­\>Yo<á:¾UÃŒÚòu>J>žø_¸ú¾To£ô§¾E,è›H>TEv#½ñ¾Ybõ&G¿>X¿ÊÐðs¾R{4µú¤Á>?ñ,eù¶>1z+"Ò¦¾OíqÁþõ>W¨àœÛAT¾Z2Z›ì­>VÌO×:¾Ljýw¢ü >"ßÌã¿õa>D'§à{I˜¾TH]O²ÎR>YîÓ¯`»¾Yº[pö 0>S°²;÷ ¾BSí&`­ç¾+àú¤A‘>NÌ`ý¯y¾WáC0YO½>Zþ9½g¬Y¾Xà¸5-ç>O*w’ÊT¾,º<™—ѾB‰Mmƒ¿Í>T3[P¾Zkg”h’)>ZÎ…PQy¹¾U#†€²¶$>EW …>" %¯ªh¾MwšTÒ³£>Wñ¢3Ÿµ×¾[ËZ´êlƒ>Ydc³®ÖC¾Q@#UÕ|£>4¸·`t>@;•»Á¾S¥lÌÛ¦>ZÍÆÖÚœü¾[õÃi¬â>VÑð„aóB¾I 1‘À̾Çþ -WZ>Kyˆæ耾WÌŠÓ\‰>\Žy6'›é¾Zê!¢Ãß>S6YæõÃû¾<œ]ß%1þ¾:L.ìŒ[ª>Räôˆ–¾[§[—… >]#i?\âò¾X·9u5>Mr¯Œ^ö¾û–Õ¥J¾H´Š«Ä>Wa#—7¾]8c–°ñ>\ŠG­‹P{¾Uu¾'>CyÉ#>2]””‘p¾QÃ6­xù>[í&E)W¾^J…#ÄFˆ>Zˆ“É]¾QGÜp“Ïf>.͹mÃœF>E7ÝBKF¾V›¨|¦>]µÆÔd®É¾^6¶í®n´>WøT ©ß2¾H¬ßýºÁ¾ ëQ¼ü@¢>P-EÚÊ9(¾ZµP‡–>_VuŒÃŠÐ¾]ŠEk>T/+ù·ä¾;A‡¬#V¾@MzîE†>Ub̽S(Š¾]î‰B V>_ܧ٨P¾Z´Žìs>O$Q'*KŸ¾ úò(5N¾Léëý§>Y÷Y™÷fý¾`Ò»<ö>_EW"3qÞ¾Wg©iy>D”ŠßB8>4ÅŽúó¾S¬}ên²>]ÅXVñœ¾`°Ud·æº>]˜£¹¾T¾S8ªSµ5">2ñêÏ‘‹>F‘¼w5¹S¾X®eÄÑ­>`X?‡#p¾`À/8L´>ZäÑP³ÁþL‘¼È3é?¾!T^ýE>Q.„%ƒâ¾]4*¯~>aQ¥žê'¾`G ¦ˆd>WA0Üm´4¾A~ýêø4¾?(Ïÿ >V·R= )÷¾`\`caiæ>aÈ9µ1æɾ^‘¡abA>RÉq¬ ÇR¾&1ÒU0Ò¾Kì‹aŠâÔ>[»£e’¾a½d`Ì#>a¹î…y÷¸¾[›&^~5>K;LÁ˜Ò>+Ìö‘üξSì&/éz>` ¥Ø5¾b¥fm£«×>a'§.J’q¾WÀëιƒ>?‰âãÞ">C«l´èSä¾Y…ALnt>aÚ¹Š ’…¾c[ZÃ>`„#Q¾S !-Y¦>ÁââŽÄñ>P%/©jöM¾^í%>c=ò=¾bùƒòÆ-y>]Lqz¾K‹¾2¾fq¼>VCȹK›¾aŒf¤q²†>d+–Ögñ¾bdo'™×p>Y#O@ºª¾? @0Yµ¾Fu¯ÿ}h>\ cøî¡ô¾cnËõ:H&>d¢ E¶£¾aT{˜€o>Th×Y’¾>øÓv0¾Qƒœþi>`°ÞÏ­Ó÷¾dë龜T›>dž„FŸ#¾_œÕêükÿ>NS”Fm>4"ãäŸKȾX%ѸuÕf>c¸Óù´Ž¾eüÖ'«>dÓs…zξ[µÍ Ö>BnW‰Š>G£ˆsܾ^Erù.‡ì>e&]YUð@¾fœí£5"·>c*3DAܱ¾W’£VV>$rã‘Ò¯8>R©©óñ¾beVô*>fÜ’Öia¾fÉ# ´Û>aÁ/?ÁžQ —¨´¾1†Ú ÿ>Ys•xöKܾd©agª7>h0ãÉ@À¾f€ÿ4Üeˆ>_Ô0}Ÿä¾G5ÝÖ¢s¾F²p“Í´>` £ö?±¾g B2û»>i¶¦ð¾eŬi.w>[WÉÓ¹÷¾4(ÄÝ­‘©¾R™…çi½…>ci º•–uѾd˜â);,>VÃäñdä>ÊÌä¾YíZâ_>fE fä¾jÞ·š§‹->i·lI‡im¾býðàD¢>P*ôý _’>BÎŽ r<é¾` œÕ€ñ‘>i‡ÊÑ,¾lF¹œ¬g>iaQg2æ¾`ø§³zëÓ>C.6±[>Q$ È怪¾dBMÅNÐ>k»,0:¾mRÞ4õF>hž_^d]kõÌ+ >#W—e!G~>Y#Ûœ¨Dt¾gÔj E>n1'ô¥Ñ¾nÿ6ÂL>go¬ßëà¾Wx=•€P¾5>ÈÛç™>`® ÂßܾkR lž—>pgZ^¾nO" ”—Y>eÕ¢3ý°¾Q# 9ʾK!îS[4§>d⥯(ø&¾n¸+žºÄ>qHiæí^¾n<ƒõ4r>cÐ)Æ ”¾CåÇVŸ!¾VVŠRN•ì>i-ÏÔ}K,¾qŠ·&Z=>qÛtÄÏI̾mÈåƒS>a^Ìñ„>¾ gߎFX%¾_£}ü»’Y>m‘d‘%‰€¾rœøÝ>r†du)¾lñe1qˆÖ>\ý6¯&$>:.b·U*¾dÀD±Î_„>qè1@¾t-)Õ‹0>sNñ¨s¾kµHs»¿>VSÙ…bà¯>P/°êÓ¾jx7óÖÎ>s[Ôö- ã¾uµ÷w—Ã>syk„ñ‚‚¾j€åoQ>M_$;¦¾>Z±:­}ù³¾o¢Ú#©Æ>uÈÍŽ<Àp¾wsÂÝxGq¾gûç^:ì>7űš$T>c*=ä*ôU¾rÞ^Âd\>xZnÙ‡áK¾xÇ$¯X^[>sî„OÈÕ¾elžC™À¾0ZÔ·"¿ï>i­ÓŒE=¾v:Li*íO>{ pßPþ¾z`Kb/ˆC>sü Ü6˜œ¾bPîý³7‰¾Oc vF„>pŠ”M~¾yÿ÷Ñ~2r_›e†¾|œdè>sí‘?a¾]üo@^é¾]QÆ"„–Ù>tÖT‘ãÖk¾~X0\ö">€ÙÃlËÜÿ¾}ý‰tº~_>sÂùE˜¾SÛéߤ„¾fÖ‰l>yö£é».¾Á¢q:ì4>‚í!G.Ðb¾€"pü‰)>szÑ&~¾@£R`& ¾pzîÂ;³`>€&þ ^4Ÿ¾„õ$LF2>…€ xvx;yÌå%ï>ssSi(h>:e1>¾wpV+>„C­á7¾‰!ÝïdFU>ˆàEbe²(¾ƒFÿ wh=>rx/ìSè%>Zëœ;deM¾ú â‰òÖ^¾Žõ}Yq “>¢w c(¾…Ör¹*>q’XH¹ç=>lqòªÂ꾆«Ú¨F½€>‘EÍÄ´¾“ó3³ô;F>’…—à l¾‰ÝõE:„>oý¤…˜¢>zÃêÇŸ0§¾‘q1L>˜¾*Q,¼r¾›äÉÀ&ý,>™?œ¥¾Ÿ_¾¤“2>hk(† g>ŠB¸È÷«¾H¸®ËÜ>¤º‘åøÑA¾§5œÅõ:j>¤ÄC'tÁ¾™t=éd’¾W’ù@ÙÇ>¢}ÈÿXð¾³1ÒXüµg>¼‘@ª¥¯¾ÁcµÒ½®€>ÀA>Ë ¾‰·_ÁJ'¾è4¬AQÞ¾‰j懎ƒ">À7)­©æ¾ÁUЪ.b>¼p%Ük©ú¾³{'¯Þ>¢D µ7²X¾RÚ÷úy4c¾™ˆ’ Û>¤®Ñû›Ö¾¦ÿ`çÕù>¤jT-¶5¾œ‹³¨%Ë>‰#¥?A÷>m ²´/ì¾ë:ôýX…>™.V®Ôd¾›qµ¥ƒ„>—öG p5Ú¾ rÕˆ¥´>v¶ŸB[ë>sWÕJ†û¾ŠÑäÜ÷À–>’ƒ ¶Î¾“k LõÛ>JºƒcU¾„$d?›Äœ>b”XÔ½>u߀§¼Ò¾‡ ¹+Øà>šEòÓ¹¾›7éCú¾>‡z¢ ÍF¾yµ_®)•>õàÚÝ\x>w”/YtxX¾„¢ÓuÜ9`>ˆ°2ÓI°¾‡[„¶ ö‰>2§O‡Ž¾nòz(W¬_¾W÷ÍׄZ>xÇó—µܾ‚Õm±ÔíÎ>…1ãÝB¾‚Ÿê¤>xÏQ5+ç¾^ ÐO¾¾dÞׄVZ2>yŠrDá8´¾Kjç{¼>ò5Õ·¾}x ÞÇO®>pú躓ºS¾5t%£¾l™%¯ÓÙ>y×[0jH¾¦Cæv!ä>~nc^zq©¾v¯Z?n8>d—µƒän¨>OFäü«_¾pͺ‰§£>y¢·w*xà¾|Þà™û‡>yG3„;p‰ v¦K>QÍš~;>`}[­u\L¾r˧"Òú>xÞ’¡ŒùJ¾yY3ç7>t@v' ¾e¯ÂgŸé¾&å‹õÃ0>g…Š—`¾sðLGTÊk>wƒŸÛjÀ¾uÄÿu›8à>nˆ«Cìé¾V/¯u·Ÿ2¾T£ò6áÝ6>lèÎr»¨‹¾tNo¡‹šÈ>u~–ÙÝè¾qܹg2æ>d¨ªKPâÔ¾%J¨5ÂÊý¾aدP4LM>pK &ÖÞ¾s×ÜË®ö>rÜAI;v¾kQ–¦Š~>VN¢&Y>MËðÛV~¾gÎÝ~Ô(>q9Óš·¾rŠÏ?P/.>oE|³ ²¾b~Ú.¾Vö>,™…4AÉ>]ù–'½9ľl t×°>q5Œ,nÍ ¾pmA>µ>gÓ!¾Sð;e-V¾J§:[W×>eƒ¾ƒ ¾nN)fp…>p;ÐÅ£¾k ®Üê§>_QLfK.Û¾~ŒAVV¾[ök€8_Ñ>iEÙ<ëø–¾nˆTÄ¢BF>l¥p—Äó¾d*è˜éªH>LªPªÐƒc>MLÔ3 º¾cÇOµ@öû>kzËmñòT¾l©ÅŸ>g(vþéž¾X°ÐÒ&›!¾"²1–Êú>\a¨© Ö·¾g¯ÏI6ß\>k} „²’3¾hʪ¿çuÐ>`RöðpS_¾@¡j½¹X÷¾Q—Å µG>c{XÁ‚p¾ijÉ€Mr>iE´ÚJ«:¾c*Óâó+›>Q@ØÓ:Û>>`»9 Œ³¾^GFÞ†*š>fºbFHœÞ¾hÐÝÔpÞ+>dûl(”—¾XoWS»×>¨)\ê>U½&_Ôû¬¾c¨XÃȱ>g¡õ€4µ¾eèi—‘ã>]ïétðkø¾B*~ŸæUs¾KS‘LÐ.‹>`it‹øU¾eì9Y‡À›>f]ÿÑÔ¾`ñ(Ëí¡>O#`‰D6u>9 ÐDñJ'¾ZK},>cÜ ¼‚­¾e¯–Øež>b<¯Â”&U¾TÔå3Œbr=õ{exuˆ>Sû¢)Tƒ¾a˜dÚ˜ø(>dÓ ?µVö¾bñÅÒu½Q>Xñ2߬<µ¾8Gò«ÐHʾLÑ Ënª>^€4 3è#¾c¤Á r©x>c,TPÂÐ^¾\õ  ‡~>EÝD*‹!>ADÞDâb¾YÙ Ù ö>b?Ö*ZÙ¾c}ÖÕ¡ð>^,úÁ+¾MêæŒÃ˜¾.>y{c‹ý>U_rfø¦¾`¼ë@¿€ž>b’ã9e]2¾_EÐ3ç>R4€*àØB½þ"“çMUf¾Q/"G!ûB>^]Ϥ*Õ¾aë' ¿*Û>`'s|¾TÀqÚçœB>0†™Söj©>J°îØ"O¾[KwJ9a ~aÉhX¾`E¥ÿ¯p·>V­¶:¡?¾<Ü‘ðûë¾CͶW6>XXß5kœ»¾`@ÍŠÀ¶>`0 E“~ ¾X›)»öñ>CŠUP\ôã>;u¦×'ä¾U˜[‘@­>^³:þoúо_ìdÕòÚ->Yh*ç¸B¾Gª8ˆY°¾0öe´Ëš~>SQ˜ëÒ¾\æóÑ™~k>_B=¶Ÿ–¾Y›K/±€Î>Jìu—9 > Ì#YÛh¾PÒöaš(>[.3ùξ^vLÆ=Ù”>Yã`Î ¾MfûÉã½åBH}zåª>M³„‰V¾Y‘šÐ">]—E1î™ê¾YîÁ%KŒv>O4sGÞ…¾>—Aî¾JR¬å¬Y>XV¹ äÁ¾\²S-Ð$¡>YÊu¿×ÿN¾P4Ì62J>#ìä¬w‹ä>G€ÈØÿÖ¾VÍøç‰V„>[Ï€¶mš¾Y‚r‹þ^ >PD›ac˾*Ô›ò˜’þE;‡m#/>U®´æ¾Zö³6Ž->YLTv»2¾P¯Üò‘«Ú>/L4xí»>Czy­¥¾T¼ ÎlÒI>Z+*Žv”¼¾X¥å`ÀÅ<>P =£ÞòŽ¾1y,­P¾B8ÕÑ2ÐÛ>S÷ý8„ȾYpž5™D>XËhªG‰¾Pcº¯·>1|¾£°îþ>Al_c»æp¾S^mb[zš>XƼ `|¾W‡4íý3B>P+… U¾1 NÏõ4¾AK¾©Fê>Rï8hôƒ¾X.X4Fâ>Våh¼{„¾Nò”ªí=>/›Ó;X/>AÄ  È¾R¤ˆK™=>W£³üæÍоV8¸í>M¡$:½°¾+¯;舾A|‘y÷l>R|º›q¼¾W%Ëp™C“>U~Üž0Gï¾L mAŒª‹>&`B5q“*¾K¾RpÇ+&>V¯IVGÜû¾T¶ýlZýZ>J7á |¾¤úŬü¾C:uG\1Í>R}@8Å}¿¾V<›©c‘>SÝl¾H¶<Ñà >q1ë­>DB*ôk—¾Rš+›X+‰>UÇC>ñg¾R˜ó‘>EÆw|÷ Z=Úוg®P¾EûgG¿~³>RÃ!+EZý¾UI¯Mž¾£>QæÈê÷²ñ¾C(R ÅêA¾wbk-Û¡>G s G”¾Rî[ñpÅi>T¼œyÔˆ¾PÂxûÞë›>@HyZQ.m>%€ö?Iâ½¾IcT¥ŒoL>SB^r÷¾Tõn¦.>Nøã<%DY¾:D¹$g/ö¾0†!âHÃ>K2jÂĆ¾S/À]&Ü>SYOTr¾L$Y ÕH >3yƒæÉh>6”!üå¾Lÿ Úä$Y>S4ŠªH²¾Rt¡?Xcî>HþÈG k½¾([µOgM5¾<ÔjPˆj>N³ÆiÄì¾S*Àj:>Qc׷ϾE†{Sº˜Î>åè6öÓê>AÀVqì¾Pø;ý+>Rѧ£Í;O¾P!÷®@ò>A·Æ"th:> Ãkù?>оD¬·~s‚Û>PÂ2¾ÐÅt¾RWf|?w>MQk±PŸ=¾;.ÁØé˶¾'Â;í³PŒ>G¥È°‡\¾Q8µÀï*Œ>Q¡¬[@a¾Ië†Öì˜$>2S„JÀ¨é>4DkNô\ȾJbœìMÁÛ>Qtåçv¬¾P¥ª·š¢6>F =R–E¾!õtwµ.ÿ¾<‰G¬þû“>LÆ|æåt ¾Qk©á–U²>N¾ËØiø¾A»<\`%½ç5z6qr>B@Y™|EѾN´´»»ùL>Q9ÕˆF›¾KJô e>9÷×1åFâ>%9CB–gw¾Eï¸ÈÏÅ,>PÆG€Ó¾PY¤e>GÁxòæR¾/ŠXô ¡‰¾4l‚wÑËz>I36 áÓx¾PWIœtÒ>N}Ýd‹´ ¾CS ÔMJÕ>)¿ªæÈ8>=ÜÕ9¼¶¾Kßt H>P?rÍåz¾Ky›®ûýÏ><¯) JO&>ÄY÷”¾CNCaY.,>MЙóL‚ú¾Ofûží§¡>G£ÃžH_õ¾1ı>®¾0Þ_!mÐ>G$,çoñ€¾NÜÑ$Áj>MS §ºva¾C ÓÞÂ/>Ú|ÊÛNÙ>;U)p…)¾JAúѳ–>NæÙ-¾J@ K¥*>;{“ɵèÞ> ÒÒ–Êv¾BtÓÒ›¢>Lqª!ëšÐ¾MÏŒêÞh>F/m¿C²è¾/¢T]Ò€z¾1\R­£->F4Ç‚jæ¾M‹ü/Ô†>KŒ~MŠ>¾A8)çN> ˜&>¡»>Meò·dÝ)¾Hò;!¦2>6ùhrce>"3×–…Dˆ¾C\ôXs>KÈ …v á¾Kë©?/ö>C‡”_¤-¾$×EÈÎ˧¾5B‚dO²>G"òô4¾L{€ý>I×ïêá¾;öȵM¼¾v7†R>@,iú%iy¾IôÑ%þŒù>K³WšæݾDç®›ùg>.Ê@ì w>/G‚d”ß+¾DØiª°=[>K]€æhJ¾IbÊÛZØ>?mSʯ²½þô¶]ÈÔ¾;´>ÃÖ>HLäþ Ï`¾K'›²è>E¯í&â¾2–< {{¾'9:~ñ ¯>CZÇ«Ò˜¾J@rݬÆö>IA½W¾@b9ëú¸>~s,Þ>8g挮־Fóûæö}|>JwQ˜¥¡^¾E¬G˜®›¨>48à·d†>"CŠàèÀ4¾A½U*§ù“>IG=<ÕÀ<¾HÕ‚±ƒ˜¥>@“еľo¬Ûш¾6sVGôÍ«>Eúû-KH¾I¿pÖ«û>E\Â/4yʾ4G ¦!`¾ 5¡Î§ó…>Ažjž»¾H­nÑok>H5vŠ[*ü¾@;×GÊ(è>"JãïíT>5ÇFC*¾Edƒ–‰gj>I a °íM¾D²pÂ6¶c>3Žs·t—¢> Ô(Ú`Ãî¾@ÈžSêF>GñEw1p¾Gjžyiòÿ>>Ð-›á¾dŒé¦ê¾6I#S):1>E(6ø›FŠ¾HW"‰6üŒ>C²˜¬‚¾1|犓tµ¾#஑Ç>As˜Y¢ß¾G‰ŸæÅÞ'>Fpäþ‰]o¾<;-FyŸ>f¼âÔ>7ÖC¸†¿¾E3ëÓ_è®>G—¤N•Ù¾BVm‡–!Ã>,¬é­Éü>)ÑÆ.s‡¾A  )G¼>G4aãvþE8÷Z´>8´β]¸=ïº8‹/7¾:?TAZw¿>EkÛtlsk¾F³µ\‘ÕG>@“ ·¾$C"ã™–à¾0ÓEÄc>Byõ)+°ù¾FÑTÚ?Ê>C«?¹>ì×¾4.›D-ξ°œ$±>=G&A> ¾Eª~Û¼t>E‹<`¥í¾<¯ÝªêL>¦ 2Õ¶>4`LèƒÀÞ¾Cl5¹Þ´>F7}º73¾A«¶è ,u>-=\Q‰Ò>%±x©Éy¾@OsÃècµ>EÁ3Ò'¾CøîÚ\ñ>7)5' &=ó¬ƒ!˜3m¾9 Z½ *>DEÏÚy¾E9Ȫb”#>>=F]9¾ žÓ.¾0Ç_0aá>Añ‰*Aì¾Eyò|T¢S>AÔ#ìÄÂ`¾0|r²œ"¾ <[âÒ—>=ç"c»& ¾DËuÅÅ{>C¦æçR‚¾7ÜC‹ ²=Þù–.y>6õ¿b·¾CL\ëVH¶>DšŸÞ–-¹¾=ôÑû¤]•>!WmDPQ>.泬»¸¾A"’óö¢ê>Dº¤l,äð¾APJRIx›>0!ïë°Û>ñÃ~?˜w¾<ãÛ9‚Ÿ>DŠ¼§!ß¾BêEy‘`>6¬niÇ=»s€ó‡¾6à #½O>BÍX*~ɾCÎN-ßü¡><%mø–Ͼ˜TÚ:¾03P#K|>@÷ó¨S¤.¾D(šýE>@9=g/5ܾC›½üwtå>AÉ_‚ÔÇ@¾3ÂÿbÚÊ_¾™Qêʼ>8A"†GB«†žRš>BÆXÉ@¾8ÙÅ*ml > :7Ú­U¥>2·®¼Î¿ñ¾AFÍvDý˜>C5©9­Ãq¾=Öö£Í>#N‡â}ì>)ó{çÇq¾?xû>C&…eܾ@$>ww_º>.9ÍvrQ>ì|¦-å¾:ûö zãÚ>B¦RyQ&ú¾AOͯÙ4´>3í¦z†j}=ú2v?%ðô¾6Œ|6e>AÃí^%³*¾B cžÑ®n>8¿ö>0?¾ œBò? n¾1â2»Å…N>@’ˆ‡`tϾBb"eQ2`>;„ §ˆ¾!UxgêRÙ¾*KÖ« ž>>Eí¤‡×s¾B[­ë Ë>>@;ç›M¾*a â†Þ¾ á'Œ&]>;5Æí!g¾BÃK7>@)4DÈ7z¾1>³¡H™¾Û‡þØØ>7†;OÏSG¾Ah¥–3½˜>@â–¨e »¾4É»dîÃ^=ßùV«û@>3ãí.¡v?¾@”] ³¤>APZöíu¾7ÐNäwÎ>^5Øü‘!>00mG4B¾?%XäX¼>A}LäJä¾:ZeuPÜ> ÁU²XZ>) ¡€·}ö¾<áïöƉº>Apñ·ƒ©¾'ÙÄë›ä>!ævl‰‘o¾:nNV`ÀL>A1æÁÓ½¡¾>ü‘oN¥>-ÈÄèÝ^>b½¾7Üwj@&>@ËÄDÒ¾?6™¥ãr¦>1 y`hŽ> ­‡#™á¾5AÙçÝ >@D}¤OÓ®¾@½ø„~>3ÿ¤n±æ½èîVÅ•´z¾2¦Ì¯ »·>?FFmܾ@Eò`+.>6 úó²0‹¾ Ç7'¥øÚ¾0Àâºþ_>=àÎõÜF5¾@d^Üéy$>7Çž?µm—¾«9Ò{u ¾+A>$Ýl>96,¦°°Ê¾ øNøä[B¾&Œ¶4¾Ì>:ÚKÄæ£ç¾@IÚsÎm@>:bÉ8$)¾%%¤ÌG,¾"`Î}Í™>9MË5öƒ:¾@²="•>;Tk}.Ðg¾(Õñ†$×¾ßr-É>7Èi‹±Ð ¾?Äß.—=>< ¬0¨ï¾,”‹¾mÈÙkõ>6K«\Õ8ľ?6P®±sÂ><—íxÇÜP¾.ÞÕ¬Çð¾ csuÆ>4⺷Ö?y¾>{¨Æù><ü³þ2¿Ý¾0¢0ùAµ½ýv2¼!Rú>3’0êÜj‡¾=û|NÕSï>=;Æèšçé¾1¢Ÿ²*G½ÞJÃm¿Ý_>2XLg§zQ¾=VÁ :¼>=`5¤„w¾2z5r\¨=çA1ÓVÿÂ>1=J¡7F¾<·hW>;s>=oðèôj¾3&|ðÐqæ=ûؼ {°`>0C:’›Ã¾<9óø >=gc“½‘£¾3«/—t:>¾·¶Oø>.ÌHêàâ¾;»¡È>=RoQ+=¾4¡<#q> Q!J"Ú>-Xž …1¾; ðDµò>=3vd_ë¾4Tloç>‚R—e(€>,,s.­Õ¾:›Qk–‰â>=šoÀZÀ¾4wßJˆÅr>Ä9ÔvÉ}>+=F\ÜK¾:723oQ><ÖHô@找4ƒg"æš>¶¶ \>*”÷Ùýîl¾9çÄCÜ8Ù>< éÞ2l²¾4r²)ÇÅq>&Êêi>*3Tßý+¾9§ÔÆìöÃ>Ð ³ðu>* ŸÆÙ¾9w/ÊË >úò\>*& e‘¾9ZŽÁþȧ>;Ý´`=Ñ3¾3«j†¡‘$>‡øÆq>*…–Èa¾9KY D*å>;7!uL¾36›÷8±> é_…äÝÊ>+SíÔ¾9Hr†Z>;=¦u Sa¾2¬Õ –ú¨>V,û²ä >+Ù.rqˆº¾9T*Ūˆé>:ä^ó ‹ô¾2ø#ÈÙÄ>§¯gšŸo>,Ù@ùµ/¾9gÏÓ¡t¡>:|ïòâžR¾1G8Î^°«=ö©Åë#>.(ò‘…å¾9€3,ßÕi>: ]¨ÿU¾0nþ —=ܘ¿ª/5>/Váò2F-¾9Ÿ—¨äYi>9‰ïsœÂ(¾.ñhôg &½ã¿l NiÄ>0ja'F|æ¾9¼ùÔ¸ø'>8óEƒˆ„þ¾,ÆPL4r¨½üŠ‚°’S>14Å­æ?¾9ÔMÓìtZ>8H€þ#(̾*e]M´Î¾`e»àA­>2 fHlľ9柣Rl˜>7†GûѾ'Á¹€¾®¬¥´?>2í!1{ˆL¾9éÄSse>6£¬+9K¾$Ú ’ Æ,¾~ÅUŸl­>3ÌÜ“-eƾ9اŠ·Ê>5¢¾ÚÓ'à¾!¸jH7犾”­›Éw‹>4«ÚßsÞܾ9³X¤væÄ>4€ ¾¤rWÔú¾!û²Æ÷>5„N¹:;ô¾9nÜ;½(>33Sƒ Öy¾R(§Ù7¾%?É”‰¿›>6J‡ôŽ«¾9½²>1¿#?PáS¾ +’¬t#¾(ŒOñacì>6ý'lGÿ¾8w:ª’r‘>0!qmUÓ·½õŒV$ÕÚ¾+àûl T>7”å¤1P¾7¸ïýr>,¦ËrÈ =éÂiŽ¹ñ¾/")>D2g>8§J $¾6Åv±‚'D>(³üŽSÆ>(O_~¾1!…•‚>8Iü ‹Ï_¾5ŸU'©>$kÁÞ…¦3>/S³§¯¾2ž#[(–á>8\èùê¹¾48x€Ùq>Ž+-òŒ>l]þƒp¾3÷ÿ­w>80 ¯þ\°¾2‘î¥>CŒ>¯k#U~=>#ÊTµÕ:¾5$÷ ®8ï>7Á—ÒdM‹¾0®þw%7®>Ÿt‹¬‡–>(KE}Ò¾6óG2ÃŽ>7 p?Ài¾-ˆ1à—Î=½=èŸÙ>,¡àì@Éó¾6Ø­ˆòøQ>5ÿn>õ”̾(Gý¬Ç=œ¾O•ˆ@0s>0U¯A£:Ѿ7DgYÛcŠ>4¡z¯ãoº¾#.´ß¨¾ÛjÐdF>2+ÇâûbŒ¾7^PŽç®>2íëÒ´‘̾ÎJî’½¾ ƒßPŸq>3Å1Êô–¾7ù;’¼>0ÞºvÕQO¾ “Õ¢‘d¾%î»:Oôx>5‚‚Qɾ6h¥ o¿>,ö¬@é¿õ½â”%0Ù.¾+ g÷Ã~Ê>5ýkÌ/&¾5OK1´¸A>'‘gP¹ç>é™íV&I¾/Ç|‹5NZ>6…ÆŒƒùѾ3Ä*Ö&>!“% ÜYd>H~1·)¾1öÄi>6•Fí»¾1źVnãG><‡`ß'Â>!ⱄˆJù¾3¬!î>6'"¥¾.¹–Ü?–ˆ>Eñi)>'Õ˜ýQ!¾4÷Q½þ‡Z>53¸ÒÙÊé¾)Ë`9Ò@½õ¿îºîÂ>-Nºú]ò¾5Á‚cœðË>3±ËÖPÙ¾"·'ô¸>x¾Œ©Dߨ>1 £È7þ¾5ûk–£ä>1§ Q­;ˆ¾’׸Ė¾ ¦=›ô,>2þó±¹ÑŒ¾5ž[0S“d>.2R¹y]¾ªÜ ^Vh¾'+Q%"p6>4pP§@ZB¾4œ÷ùªŽv>(àÆïvÞ=ùƒACG/ľ-œ³Ï¿>5C5åÁZ¾2ôµ˜>!4ן£ú>ƒ‡#E8÷¾1 eË}]>5l²K¶–U¾0­ûo1™ˆ>\äRÿ;>"¡GK¼K¾3N Üa)>4ß|щIœ¾+œ6f*åï=ër[aÏ¥”>(ØÒ+s¾4[‹ßœÏ7>3i¹ƒ×¾$ÍŒ¡=¾ „¤ì¾Jÿ>.Âzhow\¾4ó 'û>1†.y†À™¾[«t>6ʾ˜>¹žY>1É"ݲ:ʾ4ÁII=ž>-•vrz’žÑ|óõ&¥¾%À ê˜Á>3‚¾(Žè“¾3·gu/bb>&׈KŠŒz=üwÚLѳ¾,Z¾Óåþ>4lH¥5¾1Õ.^­æ>- ßÜHŒ>ìoo†Ë¾0ã )¡ >4uÆC¯|¾.T;W©Ë> yGÍÓ|>#é÷*Âñ¾2ß w >3“ >„‚û¾'Œl´%77½ñüô‚ ­Ï>+4/0 ¾3ùô 0†Õ>1½í)Ûg¾)`ÈDHï¾éu†>0g§2D¾4Ù#¹o>.˜µùd¾ ?ÂâñÉŒ¾#Zó¨Jâí>2] ‚Pc¾39ëÇ}>'ú’§“=óeߟ۾*¹å±©š6>3§^…˜ži¾1Psur«B>ŒžÍ©õv>!…Oüá¾0W-1B³>3¸üÆ?¯¾,Þ{<Í>…(\1þÔ>$óf]¾2ha¤§Ã»>2®löÀ—©¾%tWÉj­®½þþ­å¸Ë>+q?~¢l¾3m5ŠÔ¢>0‹(*¿R¾oëêŸ9ú¾sJœ³&á>0¡o†W¬¾3D¹|­§ü¾‰j懎ƒ">À7)­©æ¾ÁUЪ.b>¼p%Ük©ú¾³{'¯Þ>¢D µ7²X¾RÚ÷úy4c¾™ˆ’ Û>¤®Ñû›Ö¾¦ÿ`çÕù>¤jT-¶5¾œ‹³¨%Ë>‰#¥?A÷>m ²´/ì¾ë:ôýX…>™.V®Ôd¾›qµ¥ƒ„>—öG p5Ú¾ rÕˆ¥´>v¶ŸB[ë>sWÕJ†û¾ŠÑäÜ÷À–>’ƒ ¶Î¾“k LõÛ>JºƒcU¾„$d?›Äœ>b”XÔ½>u߀§¼Ò¾‡ ¹+Øà>šEòÓ¹¾›7éCú¾>‡z¢ ÍF¾yµ_®)•>õàÚÝ\x>w”/YtxX¾„¢ÓuÜ9`>ˆ°2ÓI°¾‡[„¶ ö‰>2§O‡Ž¾nòz(W¬_¾W÷ÍׄZ>xÇó—µܾ‚Õm±ÔíÎ>…1ãÝB¾‚Ÿê¤>xÏQ5+ç¾^ ÐO¾¾dÞׄVZ2>yŠrDá8´¾Kjç{¼>ò5Õ·¾}x ÞÇO®>pú躓ºS¾5t%£¾l™%¯ÓÙ>y×[0jH¾¦Cæv!ä>~nc^zq©¾v¯Z?n8>d—µƒän¨>OFäü«_¾pͺ‰§£>y¢·w*xà¾|Þà™û‡>yG3„;p‰ v¦K>QÍš~;>`}[­u\L¾r˧"Òú>xÞ’¡ŒùJ¾yY3ç7>t@v' ¾e¯ÂgŸé¾&å‹õÃ0>g…Š—`¾sðLGTÊk>wƒŸÛjÀ¾uÄÿu›8à>nˆ«Cìé¾V/¯u·Ÿ2¾T£ò6áÝ6>lèÎr»¨‹¾tNo¡‹šÈ>u~–ÙÝè¾qܹg2æ>d¨ªKPâÔ¾%J¨5ÂÊý¾aدP4LM>pK &ÖÞ¾s×ÜË®ö>rÜAI;v¾kQ–¦Š~>VN¢&Y>MËðÛV~¾gÎÝ~Ô(>q9Óš·¾rŠÏ?P/.>oE|³ ²¾b~Ú.¾Vö>,™…4AÉ>]ù–'½9ľl t×°>q5Œ,nÍ ¾pmA>µ>gÓ!¾Sð;e-V¾J§:[W×>eƒ¾ƒ ¾nN)fp…>p;ÐÅ£¾k ®Üê§>_QLfK.Û¾~ŒAVV¾[ök€8_Ñ>iEÙ<ëø–¾nˆTÄ¢BF>l¥p—Äó¾d*è˜éªH>LªPªÐƒc>MLÔ3 º¾cÇOµ@öû>kzËmñòT¾l©ÅŸ>g(vþéž¾X°ÐÒ&›!¾"²1–Êú>\a¨© Ö·¾g¯ÏI6ß\>k} „²’3¾hʪ¿çuÐ>`RöðpS_¾@¡j½¹X÷¾Q—Å µG>c{XÁ‚p¾ijÉ€Mr>iE´ÚJ«:¾c*Óâó+›>Q@ØÓ:Û>>`»9 Œ³¾^GFÞ†*š>fºbFHœÞ¾hÐÝÔpÞ+>dûl(”—¾XoWS»×>¨)\ê>U½&_Ôû¬¾c¨XÃȱ>g¡õ€4µ¾eèi—‘ã>]ïétðkø¾B*~ŸæUs¾KS‘LÐ.‹>`it‹øU¾eì9Y‡À›>f]ÿÑÔ¾`ñ(Ëí¡>O#`‰D6u>9 ÐDñJ'¾ZK},>cÜ ¼‚­¾e¯–Øež>b<¯Â”&U¾TÔå3Œbr=õ{exuˆ>Sû¢)Tƒ¾a˜dÚ˜ø(>dÓ ?µVö¾bñÅÒu½Q>Xñ2߬<µ¾8Gò«ÐHʾLÑ Ënª>^€4 3è#¾c¤Á r©x>c,TPÂÐ^¾\õ  ‡~>EÝD*‹!>ADÞDâb¾YÙ Ù ö>b?Ö*ZÙ¾c}ÖÕ¡ð>^,úÁ+¾MêæŒÃ˜¾.>y{c‹ý>U_rfø¦¾`¼ë@¿€ž>b’ã9e]2¾_EÐ3ç>R4€*àØB½þ"“çMUf¾Q/"G!ûB>^]Ϥ*Õ¾aë' ¿*Û>`'s|¾TÀqÚçœB>0†™Söj©>J°îØ"O¾[KwJ9a ~aÉhX¾`E¥ÿ¯p·>V­¶:¡?¾<Ü‘ðûë¾CͶW6>XXß5kœ»¾`@ÍŠÀ¶>`0 E“~ ¾X›)»öñ>CŠUP\ôã>;u¦×'ä¾U˜[‘@­>^³:þoúо_ìdÕòÚ->Yh*ç¸B¾Gª8ˆY°¾0öe´Ëš~>SQ˜ëÒ¾\æóÑ™~k>_B=¶Ÿ–¾Y›K/±€Î>Jìu—9 > Ì#YÛh¾PÒöaš(>[.3ùξ^vLÆ=Ù”>Yã`Î ¾MfûÉã½åBH}zåª>M³„‰V¾Y‘šÐ">]—E1î™ê¾YîÁ%KŒv>O4sGÞ…¾>—Aî¾JR¬å¬Y>XV¹ äÁ¾\²S-Ð$¡>YÊu¿×ÿN¾P4Ì62J>#ìä¬w‹ä>G€ÈØÿÖ¾VÍøç‰V„>[Ï€¶mš¾Y‚r‹þ^ >PD›ac˾*Ô›ò˜’þE;‡m#/>U®´æ¾Zö³6Ž->YLTv»2¾P¯Üò‘«Ú>/L4xí»>Czy­¥¾T¼ ÎlÒI>Z+*Žv”¼¾X¥å`ÀÅ<>P =£ÞòŽ¾1y,­P¾B8ÕÑ2ÐÛ>S÷ý8„ȾYpž5™D>XËhªG‰¾Pcº¯·>1|¾£°îþ>Al_c»æp¾S^mb[zš>XƼ `|¾W‡4íý3B>P+… U¾1 NÏõ4¾AK¾©Fê>Rï8hôƒ¾X.X4Fâ>Våh¼{„¾Nò”ªí=>/›Ó;X/>AÄ  È¾R¤ˆK™=>W£³üæÍоV8¸í>M¡$:½°¾+¯;舾A|‘y÷l>R|º›q¼¾W%Ëp™C“>U~Üž0Gï¾L mAŒª‹>&`B5q“*¾K¾RpÇ+&>V¯IVGÜû¾T¶ýlZýZ>J7á |¾¤úŬü¾C:uG\1Í>R}@8Å}¿¾V<›©c‘>SÝl¾H¶<Ñà >q1ë­>DB*ôk—¾Rš+›X+‰>UÇC>ñg¾R˜ó‘>EÆw|÷ Z=Úוg®P¾EûgG¿~³>RÃ!+EZý¾UI¯Mž¾£>QæÈê÷²ñ¾C(R ÅêA¾wbk-Û¡>G s G”¾Rî[ñpÅi>T¼œyÔˆ¾PÂxûÞë›>@HyZQ.m>%€ö?Iâ½¾IcT¥ŒoL>SB^r÷¾Tõn¦.>Nøã<%DY¾:D¹$g/ö¾0†!âHÃ>K2jÂĆ¾S/À]&Ü>SYOTr¾L$Y ÕH >3yƒæÉh>6”!üå¾Lÿ Úä$Y>S4ŠªH²¾Rt¡?Xcî>HþÈG k½¾([µOgM5¾<ÔjPˆj>N³ÆiÄì¾S*Àj:>Qc׷ϾE†{Sº˜Î>åè6öÓê>AÀVqì¾Pø;ý+>Rѧ£Í;O¾P!÷®@ò>A·Æ"th:> Ãkù?>оD¬·~s‚Û>PÂ2¾ÐÅt¾RWf|?w>MQk±PŸ=¾;.ÁØé˶¾'Â;í³PŒ>G¥È°‡\¾Q8µÀï*Œ>Q¡¬[@a¾Ië†Öì˜$>2S„JÀ¨é>4DkNô\ȾJbœìMÁÛ>Qtåçv¬¾P¥ª·š¢6>F =R–E¾!õtwµ.ÿ¾<‰G¬þû“>LÆ|æåt ¾Qk©á–U²>N¾ËØiø¾A»<\`%½ç5z6qr>B@Y™|EѾN´´»»ùL>Q9ÕˆF›¾KJô e>9÷×1åFâ>%9CB–gw¾Eï¸ÈÏÅ,>PÆG€Ó¾PY¤e>GÁxòæR¾/ŠXô ¡‰¾4l‚wÑËz>I36 áÓx¾PWIœtÒ>N}Ýd‹´ ¾CS ÔMJÕ>)¿ªæÈ8>=ÜÕ9¼¶¾Kßt H>P?rÍåz¾Ky›®ûýÏ><¯) JO&>ÄY÷”¾CNCaY.,>MЙóL‚ú¾Ofûží§¡>G£ÃžH_õ¾1ı>®¾0Þ_!mÐ>G$,çoñ€¾NÜÑ$Áj>MS §ºva¾C ÓÞÂ/>Ú|ÊÛNÙ>;U)p…)¾JAúѳ–>NæÙ-¾J@ K¥*>;{“ɵèÞ> ÒÒ–Êv¾BtÓÒ›¢>Lqª!ëšÐ¾MÏŒêÞh>F/m¿C²è¾/¢T]Ò€z¾1\R­£->F4Ç‚jæ¾M‹ü/Ô†>KŒ~MŠ>¾A8)çN> ˜&>¡»>Meò·dÝ)¾Hò;!¦2>6ùhrce>"3×–…Dˆ¾C\ôXs>KÈ …v á¾Kë©?/ö>C‡”_¤-¾$×EÈÎ˧¾5B‚dO²>G"òô4¾L{€ý>I×ïêá¾;öȵM¼¾v7†R>@,iú%iy¾IôÑ%þŒù>K³WšæݾDç®›ùg>.Ê@ì w>/G‚d”ß+¾DØiª°=[>K]€æhJ¾IbÊÛZØ>?mSʯ²½þô¶]ÈÔ¾;´>ÃÖ>HLäþ Ï`¾K'›²è>E¯í&â¾2–< {{¾'9:~ñ ¯>CZÇ«Ò˜¾J@rݬÆö>IA½W¾@b9ëú¸>~s,Þ>8g挮־Fóûæö}|>JwQ˜¥¡^¾E¬G˜®›¨>48à·d†>"CŠàèÀ4¾A½U*§ù“>IG=<ÕÀ<¾HÕ‚±ƒ˜¥>@“еľo¬Ûш¾6sVGôÍ«>Eúû-KH¾I¿pÖ«û>E\Â/4yʾ4G ¦!`¾ 5¡Î§ó…>Ažjž»¾H­nÑok>H5vŠ[*ü¾@;×GÊ(è>"JãïíT>5ÇFC*¾Edƒ–‰gj>I a °íM¾D²pÂ6¶c>3Žs·t—¢> Ô(Ú`Ãî¾@ÈžSêF>GñEw1p¾Gjžyiòÿ>>Ð-›á¾dŒé¦ê¾6I#S):1>E(6ø›FŠ¾HW"‰6üŒ>C²˜¬‚¾1|犓tµ¾#஑Ç>As˜Y¢ß¾G‰ŸæÅÞ'>Fpäþ‰]o¾<;-FyŸ>f¼âÔ>7ÖC¸†¿¾E3ëÓ_è®>G—¤N•Ù¾BVm‡–!Ã>,¬é­Éü>)ÑÆ.s‡¾A  )G¼>G4aãvþE8÷Z´>8´β]¸=ïº8‹/7¾:?TAZw¿>EkÛtlsk¾F³µ\‘ÕG>@“ ·¾$C"ã™–à¾0ÓEÄc>Byõ)+°ù¾FÑTÚ?Ê>C«?¹>ì×¾4.›D-ξ°œ$±>=G&A> ¾Eª~Û¼t>E‹<`¥í¾<¯ÝªêL>¦ 2Õ¶>4`LèƒÀÞ¾Cl5¹Þ´>F7}º73¾A«¶è ,u>-=\Q‰Ò>%±x©Éy¾@OsÃècµ>EÁ3Ò'¾CøîÚ\ñ>7)5' &=ó¬ƒ!˜3m¾9 Z½ *>DEÏÚy¾E9Ȫb”#>>=F]9¾ žÓ.¾0Ç_0aá>Añ‰*Aì¾Eyò|T¢S>AÔ#ìÄÂ`¾0|r²œ"¾ <[âÒ—>=ç"c»& ¾DËuÅÅ{>C¦æçR‚¾7ÜC‹ ²=Þù–.y>6õ¿b·¾CL\ëVH¶>DšŸÞ–-¹¾=ôÑû¤]•>!WmDPQ>.泬»¸¾A"’óö¢ê>Dº¤l,äð¾APJRIx›>0!ïë°Û>ñÃ~?˜w¾<ãÛ9‚Ÿ>DŠ¼§!ß¾BêEy‘`>6¬niÇ=»s€ó‡¾6à #½O>BÍX*~ɾCÎN-ßü¡><%mø–Ͼ˜TÚ:¾03P#K|>@÷ó¨S¤.¾D(šýE>@9=g/5ܾC›½üwtå>AÉ_‚ÔÇ@¾3ÂÿbÚÊ_¾™Qêʼ>8A"†GB«†žRš>BÆXÉ@¾8ÙÅ*ml > :7Ú­U¥>2·®¼Î¿ñ¾AFÍvDý˜>C5©9­Ãq¾=Öö£Í>#N‡â}ì>)ó{çÇq¾?xû>C&…eܾ@$>ww_º>.9ÍvrQ>ì|¦-å¾:ûö zãÚ>B¦RyQ&ú¾AOͯÙ4´>3í¦z†j}=ú2v?%ðô¾6Œ|6e>AÃí^%³*¾B cžÑ®n>8¿ö>0?¾ œBò? n¾1â2»Å…N>@’ˆ‡`tϾBb"eQ2`>;„ §ˆ¾!UxgêRÙ¾*KÖ« ž>>Eí¤‡×s¾B[­ë Ë>>@;ç›M¾*a â†Þ¾ á'Œ&]>;5Æí!g¾BÃK7>@)4DÈ7z¾1>³¡H™¾Û‡þØØ>7†;OÏSG¾Ah¥–3½˜>@â–¨e »¾4É»dîÃ^=ßùV«û@>3ãí.¡v?¾@”] ³¤>APZöíu¾7ÐNäwÎ>^5Øü‘!>00mG4B¾?%XäX¼>A}LäJä¾:ZeuPÜ> ÁU²XZ>) ¡€·}ö¾<áïöƉº>Apñ·ƒ©¾'ÙÄë›ä>!ævl‰‘o¾:nNV`ÀL>A1æÁÓ½¡¾>ü‘oN¥>-ÈÄèÝ^>b½¾7Üwj@&>@ËÄDÒ¾?6™¥ãr¦>1 y`hŽ> ­‡#™á¾5AÙçÝ >@D}¤OÓ®¾@½ø„~>3ÿ¤n±æ½èîVÅ•´z¾2¦Ì¯ »·>?FFmܾ@Eò`+.>6 úó²0‹¾ Ç7'¥øÚ¾0Àâºþ_>=àÎõÜF5¾@d^Üéy$>7Çž?µm—¾«9Ò{u ¾+A>$Ýl>96,¦°°Ê¾ øNøä[B¾&Œ¶4¾Ì>:ÚKÄæ£ç¾@IÚsÎm@>:bÉ8$)¾%%¤ÌG,¾"`Î}Í™>9MË5öƒ:¾@²="•>;Tk}.Ðg¾(Õñ†$×¾ßr-É>7Èi‹±Ð ¾?Äß.—=>< ¬0¨ï¾,”‹¾mÈÙkõ>6K«\Õ8ľ?6P®±sÂ><—íxÇÜP¾.ÞÕ¬Çð¾ csuÆ>4⺷Ö?y¾>{¨Æù><ü³þ2¿Ý¾0¢0ùAµ½ýv2¼!Rú>3’0êÜj‡¾=û|NÕSï>=;Æèšçé¾1¢Ÿ²*G½ÞJÃm¿Ý_>2XLg§zQ¾=VÁ :¼>=`5¤„w¾2z5r\¨=çA1ÓVÿÂ>1=J¡7F¾<·hW>;s>=oðèôj¾3&|ðÐqæ=ûؼ {°`>0C:’›Ã¾<9óø >=gc“½‘£¾3«/—t:>¾·¶Oø>.ÌHêàâ¾;»¡È>=RoQ+=¾4¡<#q> Q!J"Ú>-Xž …1¾; ðDµò>=3vd_ë¾4Tloç>‚R—e(€>,,s.­Õ¾:›Qk–‰â>=šoÀZÀ¾4wßJˆÅr>Ä9ÔvÉ}>+=F\ÜK¾:723oQ><ÖHô@找4ƒg"æš>¶¶ \>*”÷Ùýîl¾9çÄCÜ8Ù>< éÞ2l²¾4r²)ÇÅq>&Êêi>*3Tßý+¾9§ÔÆìöÃ>Ð ³ðu>* ŸÆÙ¾9w/ÊË >úò\>*& e‘¾9ZŽÁþȧ>;Ý´`=Ñ3¾3«j†¡‘$>‡øÆq>*…–Èa¾9KY D*å>;7!uL¾36›÷8±> é_…äÝÊ>+SíÔ¾9Hr†Z>;=¦u Sa¾2¬Õ –ú¨>V,û²ä >+Ù.rqˆº¾9T*Ūˆé>:ä^ó ‹ô¾2ø#ÈÙÄ>§¯gšŸo>,Ù@ùµ/¾9gÏÓ¡t¡>:|ïòâžR¾1G8Î^°«=ö©Åë#>.(ò‘…å¾9€3,ßÕi>: ]¨ÿU¾0nþ —=ܘ¿ª/5>/Váò2F-¾9Ÿ—¨äYi>9‰ïsœÂ(¾.ñhôg &½ã¿l NiÄ>0ja'F|æ¾9¼ùÔ¸ø'>8óEƒˆ„þ¾,ÆPL4r¨½üŠ‚°’S>14Å­æ?¾9ÔMÓìtZ>8H€þ#(̾*e]M´Î¾`e»àA­>2 fHlľ9柣Rl˜>7†GûѾ'Á¹€¾®¬¥´?>2í!1{ˆL¾9éÄSse>6£¬+9K¾$Ú ’ Æ,¾~ÅUŸl­>3ÌÜ“-eƾ9اŠ·Ê>5¢¾ÚÓ'à¾!¸jH7犾”­›Éw‹>4«ÚßsÞܾ9³X¤væÄ>4€ ¾¤rWÔú¾!û²Æ÷>5„N¹:;ô¾9nÜ;½(>33Sƒ Öy¾R(§Ù7¾%?É”‰¿›>6J‡ôŽ«¾9½²>1¿#?PáS¾ +’¬t#¾(ŒOñacì>6ý'lGÿ¾8w:ª’r‘>0!qmUÓ·½õŒV$ÕÚ¾+àûl T>7”å¤1P¾7¸ïýr>,¦ËrÈ =éÂiŽ¹ñ¾/")>D2g>8§J $¾6Åv±‚'D>(³üŽSÆ>(O_~¾1!…•‚>8Iü ‹Ï_¾5ŸU'©>$kÁÞ…¦3>/S³§¯¾2ž#[(–á>8\èùê¹¾48x€Ùq>Ž+-òŒ>l]þƒp¾3÷ÿ­w>80 ¯þ\°¾2‘î¥>CŒ>¯k#U~=>#ÊTµÕ:¾5$÷ ®8ï>7Á—ÒdM‹¾0®þw%7®>Ÿt‹¬‡–>(KE}Ò¾6óG2ÃŽ>7 p?Ài¾-ˆ1à—Î=½=èŸÙ>,¡àì@Éó¾6Ø­ˆòøQ>5ÿn>õ”̾(Gý¬Ç=œ¾O•ˆ@0s>0U¯A£:Ѿ7DgYÛcŠ>4¡z¯ãoº¾#.´ß¨¾ÛjÐdF>2+ÇâûbŒ¾7^PŽç®>2íëÒ´‘̾ÎJî’½¾ ƒßPŸq>3Å1Êô–¾7ù;’¼>0ÞºvÕQO¾ “Õ¢‘d¾%î»:Oôx>5‚‚Qɾ6h¥ o¿>,ö¬@é¿õ½â”%0Ù.¾+ g÷Ã~Ê>5ýkÌ/&¾5OK1´¸A>'‘gP¹ç>é™íV&I¾/Ç|‹5NZ>6…ÆŒƒùѾ3Ä*Ö&>!“% ÜYd>H~1·)¾1öÄi>6•Fí»¾1źVnãG><‡`ß'Â>!ⱄˆJù¾3¬!î>6'"¥¾.¹–Ü?–ˆ>Eñi)>'Õ˜ýQ!¾4÷Q½þ‡Z>53¸ÒÙÊé¾)Ë`9Ò@½õ¿îºîÂ>-Nºú]ò¾5Á‚cœðË>3±ËÖPÙ¾"·'ô¸>x¾Œ©Dߨ>1 £È7þ¾5ûk–£ä>1§ Q­;ˆ¾’׸Ė¾ ¦=›ô,>2þó±¹ÑŒ¾5ž[0S“d>.2R¹y]¾ªÜ ^Vh¾'+Q%"p6>4pP§@ZB¾4œ÷ùªŽv>(àÆïvÞ=ùƒACG/ľ-œ³Ï¿>5C5åÁZ¾2ôµ˜>!4ן£ú>ƒ‡#E8÷¾1 eË}]>5l²K¶–U¾0­ûo1™ˆ>\äRÿ;>"¡GK¼K¾3N Üa)>4ß|щIœ¾+œ6f*åï=ër[aÏ¥”>(ØÒ+s¾4[‹ßœÏ7>3i¹ƒ×¾$ÍŒ¡=¾ „¤ì¾Jÿ>.Âzhow\¾4ó 'û>1†.y†À™¾[«t>6ʾ˜>¹žY>1É"ݲ:ʾ4ÁII=ž>-•vrz’žÑ|óõ&¥¾%À ê˜Á>3‚¾(Žè“¾3·gu/bb>&׈KŠŒz=üwÚLѳ¾,Z¾Óåþ>4lH¥5¾1Õ.^­æ>- ßÜHŒ>ìoo†Ë¾0ã )¡ >4uÆC¯|¾.T;W©Ë> yGÍÓ|>#é÷*Âñ¾2ß w >3“ >„‚û¾'Œl´%77½ñüô‚ ­Ï>+4/0 ¾3ùô 0†Õ>1½í)Ûg¾)`ÈDHï¾éu†>0g§2D¾4Ù#¹o>.˜µùd¾ ?ÂâñÉŒ¾#Zó¨Jâí>2] ‚Pc¾39ëÇ}>'ú’§“=óeߟ۾*¹å±©š6>3§^…˜ži¾1Psur«B>ŒžÍ©õv>!…Oüá¾0W-1B³>3¸üÆ?¯¾,Þ{<Í>…(\1þÔ>$óf]¾2ha¤§Ã»>2®löÀ—©¾%tWÉj­®½þþ­å¸Ë>+q?~¢l¾3m5ŠÔ¢>0‹(*¿R¾oëêŸ9ú¾sJœ³&á>0¡o†W¬¾3D¹|­§ü¾‰j懎ƒ">À7)­©æ¾ÁUЪ.b>¼p%Ük©ú¾³{'¯Þ>¢D µ7²X¾RÚ÷úy4c¾™ˆ’ Û>¤®Ñû›Ö¾¦ÿ`çÕù>¤jT-¶5¾œ‹³¨%Ë>‰#¥?A÷>m ²´/ì¾ë:ôýX…>™.V®Ôd¾›qµ¥ƒ„>—öG p5Ú¾ rÕˆ¥´>v¶ŸB[ë>sWÕJ†û¾ŠÑäÜ÷À–>’ƒ ¶Î¾“k LõÛ>JºƒcU¾„$d?›Äœ>b”XÔ½>u߀§¼Ò¾‡ ¹+Øà>šEòÓ¹¾›7éCú¾>‡z¢ ÍF¾yµ_®)•>õàÚÝ\x>w”/YtxX¾„¢ÓuÜ9`>ˆ°2ÓI°¾‡[„¶ ö‰>2§O‡Ž¾nòz(W¬_¾W÷ÍׄZ>xÇó—µܾ‚Õm±ÔíÎ>…1ãÝB¾‚Ÿê¤>xÏQ5+ç¾^ ÐO¾¾dÞׄVZ2>yŠrDá8´¾Kjç{¼>ò5Õ·¾}x ÞÇO®>pú躓ºS¾5t%£¾l™%¯ÓÙ>y×[0jH¾¦Cæv!ä>~nc^zq©¾v¯Z?n8>d—µƒän¨>OFäü«_¾pͺ‰§£>y¢·w*xà¾|Þà™û‡>yG3„;p‰ v¦K>QÍš~;>`}[­u\L¾r˧"Òú>xÞ’¡ŒùJ¾yY3ç7>t@v' ¾e¯ÂgŸé¾&å‹õÃ0>g…Š—`¾sðLGTÊk>wƒŸÛjÀ¾uÄÿu›8à>nˆ«Cìé¾V/¯u·Ÿ2¾T£ò6áÝ6>lèÎr»¨‹¾tNo¡‹šÈ>u~–ÙÝè¾qܹg2æ>d¨ªKPâÔ¾%J¨5ÂÊý¾aدP4LM>pK &ÖÞ¾s×ÜË®ö>rÜAI;v¾kQ–¦Š~>VN¢&Y>MËðÛV~¾gÎÝ~Ô(>q9Óš·¾rŠÏ?P/.>oE|³ ²¾b~Ú.¾Vö>,™…4AÉ>]ù–'½9ľl t×°>q5Œ,nÍ ¾pmA>µ>gÓ!¾Sð;e-V¾J§:[W×>eƒ¾ƒ ¾nN)fp…>p;ÐÅ£¾k ®Üê§>_QLfK.Û¾~ŒAVV¾[ök€8_Ñ>iEÙ<ëø–¾nˆTÄ¢BF>l¥p—Äó¾d*è˜éªH>LªPªÐƒc>MLÔ3 º¾cÇOµ@öû>kzËmñòT¾l©ÅŸ>g(vþéž¾X°ÐÒ&›!¾"²1–Êú>\a¨© Ö·¾g¯ÏI6ß\>k} „²’3¾hʪ¿çuÐ>`RöðpS_¾@¡j½¹X÷¾Q—Å µG>c{XÁ‚p¾ijÉ€Mr>iE´ÚJ«:¾c*Óâó+›>Q@ØÓ:Û>>`»9 Œ³¾^GFÞ†*š>fºbFHœÞ¾hÐÝÔpÞ+>dûl(”—¾XoWS»×>¨)\ê>U½&_Ôû¬¾c¨XÃȱ>g¡õ€4µ¾eèi—‘ã>]ïétðkø¾B*~ŸæUs¾KS‘LÐ.‹>`it‹øU¾eì9Y‡À›>f]ÿÑÔ¾`ñ(Ëí¡>O#`‰D6u>9 ÐDñJ'¾ZK},>cÜ ¼‚­¾e¯–Øež>b<¯Â”&U¾TÔå3Œbr=õ{exuˆ>Sû¢)Tƒ¾a˜dÚ˜ø(>dÓ ?µVö¾bñÅÒu½Q>Xñ2߬<µ¾8Gò«ÐHʾLÑ Ënª>^€4 3è#¾c¤Á r©x>c,TPÂÐ^¾\õ  ‡~>EÝD*‹!>ADÞDâb¾YÙ Ù ö>b?Ö*ZÙ¾c}ÖÕ¡ð>^,úÁ+¾MêæŒÃ˜¾.>y{c‹ý>U_rfø¦¾`¼ë@¿€ž>b’ã9e]2¾_EÐ3ç>R4€*àØB½þ"“çMUf¾Q/"G!ûB>^]Ϥ*Õ¾aë' ¿*Û>`'s|¾TÀqÚçœB>0†™Söj©>J°îØ"O¾[KwJ9a ~aÉhX¾`E¥ÿ¯p·>V­¶:¡?¾<Ü‘ðûë¾CͶW6>XXß5kœ»¾`@ÍŠÀ¶>`0 E“~ ¾X›)»öñ>CŠUP\ôã>;u¦×'ä¾U˜[‘@­>^³:þoúо_ìdÕòÚ->Yh*ç¸B¾Gª8ˆY°¾0öe´Ëš~>SQ˜ëÒ¾\æóÑ™~k>_B=¶Ÿ–¾Y›K/±€Î>Jìu—9 > Ì#YÛh¾PÒöaš(>[.3ùξ^vLÆ=Ù”>Yã`Î ¾MfûÉã½åBH}zåª>M³„‰V¾Y‘šÐ">]—E1î™ê¾YîÁ%KŒv>O4sGÞ…¾>—Aî¾JR¬å¬Y>XV¹ äÁ¾\²S-Ð$¡>YÊu¿×ÿN¾P4Ì62J>#ìä¬w‹ä>G€ÈØÿÖ¾VÍøç‰V„>[Ï€¶mš¾Y‚r‹þ^ >PD›ac˾*Ô›ò˜’þE;‡m#/>U®´æ¾Zö³6Ž->YLTv»2¾P¯Üò‘«Ú>/L4xí»>Czy­¥¾T¼ ÎlÒI>Z+*Žv”¼¾X¥å`ÀÅ<>P =£ÞòŽ¾1y,­P¾B8ÕÑ2ÐÛ>S÷ý8„ȾYpž5™D>XËhªG‰¾Pcº¯·>1|¾£°îþ>Al_c»æp¾S^mb[zš>XƼ `|¾W‡4íý3B>P+… U¾1 NÏõ4¾AK¾©Fê>Rï8hôƒ¾X.X4Fâ>Våh¼{„¾Nò”ªí=>/›Ó;X/>AÄ  È¾R¤ˆK™=>W£³üæÍоV8¸í>M¡$:½°¾+¯;舾A|‘y÷l>R|º›q¼¾W%Ëp™C“>U~Üž0Gï¾L mAŒª‹>&`B5q“*¾K¾RpÇ+&>V¯IVGÜû¾T¶ýlZýZ>J7á |¾¤úŬü¾C:uG\1Í>R}@8Å}¿¾V<›©c‘>SÝl¾H¶<Ñà >q1ë­>DB*ôk—¾Rš+›X+‰>UÇC>ñg¾R˜ó‘>EÆw|÷ Z=Úוg®P¾EûgG¿~³>RÃ!+EZý¾UI¯Mž¾£>QæÈê÷²ñ¾C(R ÅêA¾wbk-Û¡>G s G”¾Rî[ñpÅi>T¼œyÔˆ¾PÂxûÞë›>@HyZQ.m>%€ö?Iâ½¾IcT¥ŒoL>SB^r÷¾Tõn¦.>Nøã<%DY¾:D¹$g/ö¾0†!âHÃ>K2jÂĆ¾S/À]&Ü>SYOTr¾L$Y ÕH >3yƒæÉh>6”!üå¾Lÿ Úä$Y>S4ŠªH²¾Rt¡?Xcî>HþÈG k½¾([µOgM5¾<ÔjPˆj>N³ÆiÄì¾S*Àj:>Qc׷ϾE†{Sº˜Î>åè6öÓê>AÀVqì¾Pø;ý+>Rѧ£Í;O¾P!÷®@ò>A·Æ"th:> Ãkù?>оD¬·~s‚Û>PÂ2¾ÐÅt¾RWf|?w>MQk±PŸ=¾;.ÁØé˶¾'Â;í³PŒ>G¥È°‡\¾Q8µÀï*Œ>Q¡¬[@a¾Ië†Öì˜$>2S„JÀ¨é>4DkNô\ȾJbœìMÁÛ>Qtåçv¬¾P¥ª·š¢6>F =R–E¾!õtwµ.ÿ¾<‰G¬þû“>LÆ|æåt ¾Qk©á–U²>N¾ËØiø¾A»<\`%½ç5z6qr>B@Y™|EѾN´´»»ùL>Q9ÕˆF›¾KJô e>9÷×1åFâ>%9CB–gw¾Eï¸ÈÏÅ,>PÆG€Ó¾PY¤e>GÁxòæR¾/ŠXô ¡‰¾4l‚wÑËz>I36 áÓx¾PWIœtÒ>N}Ýd‹´ ¾CS ÔMJÕ>)¿ªæÈ8>=ÜÕ9¼¶¾Kßt H>P?rÍåz¾Ky›®ûýÏ><¯) JO&>ÄY÷”¾CNCaY.,>MЙóL‚ú¾Ofûží§¡>G£ÃžH_õ¾1ı>®¾0Þ_!mÐ>G$,çoñ€¾NÜÑ$Áj>MS §ºva¾C ÓÞÂ/>Ú|ÊÛNÙ>;U)p…)¾JAúѳ–>NæÙ-¾J@ K¥*>;{“ɵèÞ> ÒÒ–Êv¾BtÓÒ›¢>Lqª!ëšÐ¾MÏŒêÞh>F/m¿C²è¾/¢T]Ò€z¾1\R­£->F4Ç‚jæ¾M‹ü/Ô†>KŒ~MŠ>¾A8)çN> ˜&>¡»>Meò·dÝ)¾Hò;!¦2>6ùhrce>"3×–…Dˆ¾C\ôXs>KÈ …v á¾Kë©?/ö>C‡”_¤-¾$×EÈÎ˧¾5B‚dO²>G"òô4¾L{€ý>I×ïêá¾;öȵM¼¾v7†R>@,iú%iy¾IôÑ%þŒù>K³WšæݾDç®›ùg>.Ê@ì w>/G‚d”ß+¾DØiª°=[>K]€æhJ¾IbÊÛZØ>?mSʯ²½þô¶]ÈÔ¾;´>ÃÖ>HLäþ Ï`¾K'›²è>E¯í&â¾2–< {{¾'9:~ñ ¯>CZÇ«Ò˜¾J@rݬÆö>IA½W¾@b9ëú¸>~s,Þ>8g挮־Fóûæö}|>JwQ˜¥¡^¾E¬G˜®›¨>48à·d†>"CŠàèÀ4¾A½U*§ù“>IG=<ÕÀ<¾HÕ‚±ƒ˜¥>@“еľo¬Ûш¾6sVGôÍ«>Eúû-KH¾I¿pÖ«û>E\Â/4yʾ4G ¦!`¾ 5¡Î§ó…>Ažjž»¾H­nÑok>H5vŠ[*ü¾@;×GÊ(è>"JãïíT>5ÇFC*¾Edƒ–‰gj>I a °íM¾D²pÂ6¶c>3Žs·t—¢> Ô(Ú`Ãî¾@ÈžSêF>GñEw1p¾Gjžyiòÿ>>Ð-›á¾dŒé¦ê¾6I#S):1>E(6ø›FŠ¾HW"‰6üŒ>C²˜¬‚¾1|犓tµ¾#஑Ç>As˜Y¢ß¾G‰ŸæÅÞ'>Fpäþ‰]o¾<;-FyŸ>f¼âÔ>7ÖC¸†¿¾E3ëÓ_è®>G—¤N•Ù¾BVm‡–!Ã>,¬é­Éü>)ÑÆ.s‡¾A  )G¼>G4aãvþE8÷Z´>8´β]¸=ïº8‹/7¾:?TAZw¿>EkÛtlsk¾F³µ\‘ÕG>@“ ·¾$C"ã™–à¾0ÓEÄc>Byõ)+°ù¾FÑTÚ?Ê>C«?¹>ì×¾4.›D-ξ°œ$±>=G&A> ¾Eª~Û¼t>E‹<`¥í¾<¯ÝªêL>¦ 2Õ¶>4`LèƒÀÞ¾Cl5¹Þ´>F7}º73¾A«¶è ,u>-=\Q‰Ò>%±x©Éy¾@OsÃècµ>EÁ3Ò'¾CøîÚ\ñ>7)5' &=ó¬ƒ!˜3m¾9 Z½ *>DEÏÚy¾E9Ȫb”#>>=F]9¾ žÓ.¾0Ç_0aá>Añ‰*Aì¾Eyò|T¢S>AÔ#ìÄÂ`¾0|r²œ"¾ <[âÒ—>=ç"c»& ¾DËuÅÅ{>C¦æçR‚¾7ÜC‹ ²=Þù–.y>6õ¿b·¾CL\ëVH¶>DšŸÞ–-¹¾=ôÑû¤]•>!WmDPQ>.泬»¸¾A"’óö¢ê>Dº¤l,äð¾APJRIx›>0!ïë°Û>ñÃ~?˜w¾<ãÛ9‚Ÿ>DŠ¼§!ß¾BêEy‘`>6¬niÇ=»s€ó‡¾6à #½O>BÍX*~ɾCÎN-ßü¡><%mø–Ͼ˜TÚ:¾03P#K|>@÷ó¨S¤.¾D(šýE>@9=g/5ܾC›½üwtå>AÉ_‚ÔÇ@¾3ÂÿbÚÊ_¾™Qêʼ>8A"†GB«†žRš>BÆXÉ@¾8ÙÅ*ml > :7Ú­U¥>2·®¼Î¿ñ¾AFÍvDý˜>C5©9­Ãq¾=Öö£Í>#N‡â}ì>)ó{çÇq¾?xû>C&…eܾ@$>ww_º>.9ÍvrQ>ì|¦-å¾:ûö zãÚ>B¦RyQ&ú¾AOͯÙ4´>3í¦z†j}=ú2v?%ðô¾6Œ|6e>AÃí^%³*¾B cžÑ®n>8¿ö>0?¾ œBò? n¾1â2»Å…N>@’ˆ‡`tϾBb"eQ2`>;„ §ˆ¾!UxgêRÙ¾*KÖ« ž>>Eí¤‡×s¾B[­ë Ë>>@;ç›M¾*a â†Þ¾ á'Œ&]>;5Æí!g¾BÃK7>@)4DÈ7z¾1>³¡H™¾Û‡þØØ>7†;OÏSG¾Ah¥–3½˜>@â–¨e »¾4É»dîÃ^=ßùV«û@>3ãí.¡v?¾@”] ³¤>APZöíu¾7ÐNäwÎ>^5Øü‘!>00mG4B¾?%XäX¼>A}LäJä¾:ZeuPÜ> ÁU²XZ>) ¡€·}ö¾<áïöƉº>Apñ·ƒ©¾'ÙÄë›ä>!ævl‰‘o¾:nNV`ÀL>A1æÁÓ½¡¾>ü‘oN¥>-ÈÄèÝ^>b½¾7Üwj@&>@ËÄDÒ¾?6™¥ãr¦>1 y`hŽ> ­‡#™á¾5AÙçÝ >@D}¤OÓ®¾@½ø„~>3ÿ¤n±æ½èîVÅ•´z¾2¦Ì¯ »·>?FFmܾ@Eò`+.>6 úó²0‹¾ Ç7'¥øÚ¾0Àâºþ_>=àÎõÜF5¾@d^Üéy$>7Çž?µm—¾«9Ò{u ¾+A>$Ýl>96,¦°°Ê¾ øNøä[B¾&Œ¶4¾Ì>:ÚKÄæ£ç¾@IÚsÎm@>:bÉ8$)¾%%¤ÌG,¾"`Î}Í™>9MË5öƒ:¾@²="•>;Tk}.Ðg¾(Õñ†$×¾ßr-É>7Èi‹±Ð ¾?Äß.—=>< ¬0¨ï¾,”‹¾mÈÙkõ>6K«\Õ8ľ?6P®±sÂ><—íxÇÜP¾.ÞÕ¬Çð¾ csuÆ>4⺷Ö?y¾>{¨Æù><ü³þ2¿Ý¾0¢0ùAµ½ýv2¼!Rú>3’0êÜj‡¾=û|NÕSï>=;Æèšçé¾1¢Ÿ²*G½ÞJÃm¿Ý_>2XLg§zQ¾=VÁ :¼>=`5¤„w¾2z5r\¨=çA1ÓVÿÂ>1=J¡7F¾<·hW>;s>=oðèôj¾3&|ðÐqæ=ûؼ {°`>0C:’›Ã¾<9óø >=gc“½‘£¾3«/—t:>¾·¶Oø>.ÌHêàâ¾;»¡È>=RoQ+=¾4¡<#q> Q!J"Ú>-Xž …1¾; ðDµò>=3vd_ë¾4Tloç>‚R—e(€>,,s.­Õ¾:›Qk–‰â>=šoÀZÀ¾4wßJˆÅr>Ä9ÔvÉ}>+=F\ÜK¾:723oQ><ÖHô@找4ƒg"æš>¶¶ \>*”÷Ùýîl¾9çÄCÜ8Ù>< éÞ2l²¾4r²)ÇÅq>&Êêi>*3Tßý+¾9§ÔÆìöÃ>Ð ³ðu>* ŸÆÙ¾9w/ÊË >úò\>*& e‘¾9ZŽÁþȧ>;Ý´`=Ñ3¾3«j†¡‘$>‡øÆq>*…–Èa¾9KY D*å>;7!uL¾36›÷8±> é_…äÝÊ>+SíÔ¾9Hr†Z>;=¦u Sa¾2¬Õ –ú¨>V,û²ä >+Ù.rqˆº¾9T*Ūˆé>:ä^ó ‹ô¾2ø#ÈÙÄ>§¯gšŸo>,Ù@ùµ/¾9gÏÓ¡t¡>:|ïòâžR¾1G8Î^°«=ö©Åë#>.(ò‘…å¾9€3,ßÕi>: ]¨ÿU¾0nþ —=ܘ¿ª/5>/Váò2F-¾9Ÿ—¨äYi>9‰ïsœÂ(¾.ñhôg &½ã¿l NiÄ>0ja'F|æ¾9¼ùÔ¸ø'>8óEƒˆ„þ¾,ÆPL4r¨½üŠ‚°’S>14Å­æ?¾9ÔMÓìtZ>8H€þ#(̾*e]M´Î¾`e»àA­>2 fHlľ9柣Rl˜>7†GûѾ'Á¹€¾®¬¥´?>2í!1{ˆL¾9éÄSse>6£¬+9K¾$Ú ’ Æ,¾~ÅUŸl­>3ÌÜ“-eƾ9اŠ·Ê>5¢¾ÚÓ'à¾!¸jH7犾”­›Éw‹>4«ÚßsÞܾ9³X¤væÄ>4€ ¾¤rWÔú¾!û²Æ÷>5„N¹:;ô¾9nÜ;½(>33Sƒ Öy¾R(§Ù7¾%?É”‰¿›>6J‡ôŽ«¾9½²>1¿#?PáS¾ +’¬t#¾(ŒOñacì>6ý'lGÿ¾8w:ª’r‘>0!qmUÓ·½õŒV$ÕÚ¾+àûl T>7”å¤1P¾7¸ïýr>,¦ËrÈ =éÂiŽ¹ñ¾/")>D2g>8§J $¾6Åv±‚'D>(³üŽSÆ>(O_~¾1!…•‚>8Iü ‹Ï_¾5ŸU'©>$kÁÞ…¦3>/S³§¯¾2ž#[(–á>8\èùê¹¾48x€Ùq>Ž+-òŒ>l]þƒp¾3÷ÿ­w>80 ¯þ\°¾2‘î¥>CŒ>¯k#U~=>#ÊTµÕ:¾5$÷ ®8ï>7Á—ÒdM‹¾0®þw%7®>Ÿt‹¬‡–>(KE}Ò¾6óG2ÃŽ>7 p?Ài¾-ˆ1à—Î=½=èŸÙ>,¡àì@Éó¾6Ø­ˆòøQ>5ÿn>õ”̾(Gý¬Ç=œ¾O•ˆ@0s>0U¯A£:Ѿ7DgYÛcŠ>4¡z¯ãoº¾#.´ß¨¾ÛjÐdF>2+ÇâûbŒ¾7^PŽç®>2íëÒ´‘̾ÎJî’½¾ ƒßPŸq>3Å1Êô–¾7ù;’¼>0ÞºvÕQO¾ “Õ¢‘d¾%î»:Oôx>5‚‚Qɾ6h¥ o¿>,ö¬@é¿õ½â”%0Ù.¾+ g÷Ã~Ê>5ýkÌ/&¾5OK1´¸A>'‘gP¹ç>é™íV&I¾/Ç|‹5NZ>6…ÆŒƒùѾ3Ä*Ö&>!“% ÜYd>H~1·)¾1öÄi>6•Fí»¾1źVnãG><‡`ß'Â>!ⱄˆJù¾3¬!î>6'"¥¾.¹–Ü?–ˆ>Eñi)>'Õ˜ýQ!¾4÷Q½þ‡Z>53¸ÒÙÊé¾)Ë`9Ò@½õ¿îºîÂ>-Nºú]ò¾5Á‚cœðË>3±ËÖPÙ¾"·'ô¸>x¾Œ©Dߨ>1 £È7þ¾5ûk–£ä>1§ Q­;ˆ¾’׸Ė¾ ¦=›ô,>2þó±¹ÑŒ¾5ž[0S“d>.2R¹y]¾ªÜ ^Vh¾'+Q%"p6>4pP§@ZB¾4œ÷ùªŽv>(àÆïvÞ=ùƒACG/ľ-œ³Ï¿>5C5åÁZ¾2ôµ˜>!4ן£ú>ƒ‡#E8÷¾1 eË}]>5l²K¶–U¾0­ûo1™ˆ>\äRÿ;>"¡GK¼K¾3N Üa)>4ß|щIœ¾+œ6f*åï=ër[aÏ¥”>(ØÒ+s¾4[‹ßœÏ7>3i¹ƒ×¾$ÍŒ¡=¾ „¤ì¾Jÿ>.Âzhow\¾4ó 'û>1†.y†À™¾[«t>6ʾ˜>¹žY>1É"ݲ:ʾ4ÁII=ž>-•vrz’žÑ|óõ&¥¾%À ê˜Á>3‚¾(Žè“¾3·gu/bb>&׈KŠŒz=üwÚLѳ¾,Z¾Óåþ>4lH¥5¾1Õ.^­æ>- ßÜHŒ>ìoo†Ë¾0ã )¡ >4uÆC¯|¾.T;W©Ë> yGÍÓ|>#é÷*Âñ¾2ß w >3“ >„‚û¾'Œl´%77½ñüô‚ ­Ï>+4/0 ¾3ùô 0†Õ>1½í)Ûg¾)`ÈDHï¾éu†>0g§2D¾4Ù#¹o>.˜µùd¾ ?ÂâñÉŒ¾#Zó¨Jâí>2] ‚Pc¾39ëÇ}>'ú’§“=óeߟ۾*¹å±©š6>3§^…˜ži¾1Psur«B>ŒžÍ©õv>!…Oüá¾0W-1B³>3¸üÆ?¯¾,Þ{<Í>…(\1þÔ>$óf]¾2ha¤§Ã»>2®löÀ—©¾%tWÉj­®½þþ­å¸Ë>+q?~¢l¾3m5ŠÔ¢>0‹(*¿R¾oëêŸ9ú¾sJœ³&á>0¡o†W¬¾3D¹|­§ü>*¿SïÍѽù) ¦F,¾%ÊKžËßp>2Ré×<ù¾1åœæ×]>"³ª·>1> ”t!Gø¾,üµ"‘>33î¤Ñ%™¾.¼|Xöˆ¡>ÓŸÞ³{c> Ç3Ⱦ1):B\"ç>2¡E,ATt¾'•u¦Ô!½Ò~þ»ÛC±>(lâÅ’—T¾2¨>XDu…>0Á m›š ¾$Õ'L¹¾Õ`”Ò>/&L±!ÿ¾2ÔÜ¿Qº>+`t[Õb„¾m˜5<ľ#ʨ 6±½>1Â`ŵ&¾1¤š^äBm>#7ßÝO~€>Èùva¥¾+˜5%¢>2©qúá¾.977¾S>Ãs$ú‹¾0©@‘Ü>2 f×"Z¾&Æò  ;½Ü’ Ðœ>(Šá¾22ÿì8Œ>0\<ë ~¾·zär¾ŒÌê±>.èÎO¾2Bp¢y&>)•A·Æ¸C½ø¡ÔÁ9¾$Ær åI>1“ç þ?¾0Ç.ùóž=> »d+ã>›0æ6o¾,€@á1Z>2,ñ9ÀH„¾+¨å4Æ;E> ¤Ci¶¤D>!µO« ¥ê¾0ÛŒP"Îr>1*ÔS²Ô2¾#NŒ´zf¾û&‚î˜>*3gu@[ ¾1óÄ[2.>-0z€üf¾Kά—×¾ä[e5>0$ø ðÌþ¾1]4fŵ>%C_¥j’Â=‘üq¾(&ñÀÅi>1£+A$ $¾.2èµ^Ä>_© µ>‹E–Öþè¾.é}ZFá‰>1hNÅÃ~H¾&µØå =¶¾ŸlÚä>&d7“ò˾1MÁ2 eâ>.ÚíXiöþ¾Æ²¹S¾ùøÓ1“c>-¾2ÇÅíî¾1]&®vù|>'ªgîê`½ë(NZ,¾%[ÅçkJ>0ùŽ „³¾/)Çu÷>프kªÁ>R4´8¾,ÃrÙJ¾>1@:Q ¾(;¨¢¼Â=õíq5Σ>#ûúŸ¤l_¾0±tX‰>/?›£Ês‰¾,;[€¾§g¬•Ã>,|ØŠË ¾1Þ\‹pÌ>(j,ÏȽúY®¾#`ë¹sT¯>0vWÒ0Û¾/н¸Ll>}¿ü—”Œ>ã‡6J!¾+¥)þ>\>0ò›ÙE¾(G#&EÈñÂ0¾0Nu&#ˆß>.Ć ë‘ò¾ÿÈiv’ ¾ƒ_’>þ>+…‚^ÈEɾ0ů‘Œè±>'Ìêü*ƽ÷+½C_ر¾#R”Ë£×>04OŽiÁ¾.9^äËA¹>¥Ïu”B>KÑÀë²¾+ŸWŒÓ<>0‘¿}°Ãо'LÅ,óñ=ðxäˆû|>#Ö…fÛ^k¾0)ÙÚ­åˆ>-„@¥[¾‚ܾG`¾«YjX>+ýkÒ¾0Wh aÍ>%ã¨vjøø½×÷Ú곊¾$³B×xŒ>0%ô<«¾,Š{¶Xñ•>„JV¨ÆQ>«ðŽ¾»¾,€Y7Ò³>0 o½q¾$l%DyÇ:½Þ9ܘ! L>%Ó_•|„k¾0#…ÖÔ>+T¹Åô¾D¾º$KÇè¾®ÕÖ…>-,1¥Wý¾/Yßb>"èrºhË=ø `ÏÎ2¸¾'1ž$A>0~£W¦¾)ÂLea‘> >[Û\>µã€ë¾-ÙDMiSË>.Wž ›Ѿ JšÚ½ªk¾2§zTŽ®>(°ñ qH^¾/ò63vß>'×–3•ú¾+°õØ;¾!IAÏè¿>.‚@Ó>A½¾-â_Êö™>"S] ²>ÈPýâË}¾*BÓeÿü´>/o݃'ž%r6T0çŽ=â+ôÓ>#°*wPÖ¾.÷.š\‘>+Dƒñ3b¾Ìù*5@"¾ï?÷™w>+À„K¢ôj¾.”vS"…>"—…j!gŽ=ó³hÖ¥¾&*ÎI£C>/*[ì—C¾)§<+%*> Q^•Å>‡ÔXä¾- 8þYS>-7-4)ö¾T3‚œ 1¾ìô-Nz>(Ò=Wɾ.äÈG{Y>&.´eãG½õsC6D86¾"óP%oÂ>.5žã¾+E]h`é>qˆ.–¦^>¹Š6Ô¾*º[Úç±Ò>.4G,¾"¶l¿žÊk½ìŸ•ät‡}>%`E.ø@¾.uE'áÿÊ>(šw!Aìø¾ Ò”Æ"¾â¥&e<;>,w¿‰àGâ¾,€¥äÖ¬>• ·Õ> ’“ñ¿¾(ZHo—ì>.0%öŠ7¾%, Eo»ƒ=ìD5þ®Ä>"clj%)¾-›ÅÜI ‡>*Ê7…-¾ºíIPG¾ÉÅûBc>*àÆOi×7¾-;8òx> æ“,EÀ#=ü¶åôr#‰¾&Cïg—>-æ~ö è¾&¼öx´-é>_‘­½H> *¯ìΘҾ,£wàÉ>*çü5Iu6¾°l¿)èÙ¾!땼Ī>)rÒ¸Ðã\¾--)øŸ>"iÂl:þ=çÅǬÈ, ¾$œ­ƒcP>-tã±Z¼^¾'¡Ö˜dQ>:µ ;~>ÿéWHÈ:¾+Ì{zþ>+8ª¯R[¾* )Óî¾4?ÇÕ>(afïÝ Ê¾-W½]Ä=>#)ÑiY]‡=¾ü”zÑ^Þ¾# >,ú€–ξ'óÆ¥â> ÌϺ|>’}ÛR¶¾++#ì¿­è>+1À‡¯ó®¾,3È8÷:¾ @À²©s0>'Â2bç¾,¿·œ‚p>#K¯+yžI½µ°—e+«×¾#nlÙàþ>,—²[4±¾'ɜ۫´)> EeÎ>zÍô¾*Ï d]gÈ>*Û ¹À+ž¾ úùé¾ VãöçL§>']Ú²¾,a n™vö>"Û{4.Æ=¶œc°ɾ#²|ýór>,S;‹L’¬¾'7 ¢ît> wþ˜MŽ>X°r8 ê¾*ÀýCH†È>*Bvã:{¾쥦À §¾€§2ãF>'Ï«Paê¾+äh-†ž<>!ÐPúÒ U=äªZÙÖ˜¾#¶Y¸_\®>,d¹z ¾&,ÈþÁSö>óŸÀ¶nu>m•Pû;*å~ü‰>)[ülоÌÁ«mCã¾0e iƸ>(j͸)l¾+AUˆfß> -Ns£?»=ùoÜõQ ¾$Ñ—úÿ Ö>+Ô!ÿ¯ƒr¾$š¹˜ ·=öß(ð,¾[> QšòIG¾+Æ”I/>(EÆêú¾>}ÈƪV¾VªÉʹÇ>)58‚]µ×¾*LQw$ÐÚ>È!æ¿Y>†ÙåP¾&;ïËúøâ>+bÖwDš¾"s]x*º=”ƒ¿CØUW>"\![¹Y¾+G‚`2>&#²PC»å¾n¨ù Á„¾®²sK[>* {ë篾(Ùq Nd>²ïùD|Û>s\®›‰¾'ÄœºÛ6*>*„ ÏOøl¾© Þâí½û`PÞB²>$œž„ ÓÞ¾+U¨-s“>#’|_o:O½îuaꂱ¾ º>è§Ë>*¨°?#°¾&À‡íÉ–> 2ì&u>‘K ðç¾)5Uã‚°$>)¨®Oá¾®–È/¸¾ à:¼þHÊ>&ÝQÁþ*Yãnÿi> fˆv!=óÐ|%Ø÷ê¾#Âß‘ç¬>*ºé{a¥ê¾#Âì´4ò-=óýžƒ®ä> ϾÊGî¾*1Ž}Ï$>&¦ºÏT›Å¾ ¹ðEr:¾½æc¢ >(Ê £Àࣾ(¹o‘ÅŸ>s™Œ²-> ‹´xºŒ²¾&™‡l…pP>)ôCJÇ÷W¾kLŽH†[½õýÈéy>#¼m~&$£¾*Yˆ§2¼ >#!èˆ ÚS½î*¨'˽¾ T0R‘Þ:>)ñj¼$úI¾%éd¶&ƒ©> tT2è´@>Çf_ý}¾(ÇêjÓØè>'ûøþWž¾Ü~t˾Õç®é»X>&ì¶ ,Œ¾)Qñ8ךp>µ¿6Je>©ì6ÏŸ¾$tÿÍX¾>)ë…RO4Z¾!¯ZX72g=®´“Xâ;>!{ÞA³¾)ÐIY;¼½>${EQR¾DÚYsy;9CŸ#‰>) 'KSÕ¾&°ÇÙ§Å>žh© VŽ>ìà˸¾'¨Öˆ·Ë>(GÍ–)¾ÿÆsÒ´¾  \Ê>%¸Mk*l¾):¤®Ü>¡ìˆeê=õÚ9ªÚâ¾#KWTëÃ>)Žö†ö’ÿ¾"3ÓQB3=â•À‹p_˜> xôJlÜj¾)LÉI}ú>$ŸN)~0¾ÊAÃÁ¾³|ãΤ>(~ņá¦<¾&Š$ß¼D>¤Y“>‚%èAò¾'01WçW>'îy$¾¶[†¾ 7´×þ*a>%lÕô¹ó˜¾(ɤVn€>´`ö=ë =øEÇú¸š[¾#Cˆ`„¬5>) ±)ÀÛ“¾!}ûƒ.=ÎNŒ¿°OT> Æ2q¶©Å¾(ûp•Gâ“>#¿Im±?½ÿ)¹KûÃE¾>ŒU(>(bÄg>? ¾%— ç[0õ> ¤êš'©>:-j“—¾'_N§ÍpK>'ªѾm¤©Y›+¾&.xžT°>%ùªâF¾'úž G > У\ç>à;ãM!“¾$<ä÷ÏO>(ˆ qìP9¾$æź½íš¢_m`½>"6É2·}+¾(¯Áô*¼ß>!ÄòZõ³9½ãšœtÝ{̾íäVñâÀ>(xHLTß¾#­˜rt;w>Í#Y(¥ >‹úû+¾'çŽw >%?ƒ ¥ò_¾ :ø-1žþ«’1?>'£ÉL¾&xçR 67>_-¨sŽ>¹Lb̾%Òpr!´>'[Çå÷ ¾K¶¦m"ª¾´QÊ¥é=>$`|î¨ó¾'ìÿMìç>ÌbñLé=÷â›äŃ…¾"·µ'9 o>(1*¥až¾ kmÇ2«¸½Åˆ¸âsÄ> äÞ6î(¾(+¸nh’å>"0Bu9µD½ñál”+VŒ¾ÚvüÀÑ>'ß`7Ôwô¾#²Ql­ú­>ÒUÌ!›$>³ÍÈY¾'PöøΑÜ>$òk$}îc¾ >yûDˆe¾`Ï;7šk>&‡Ø—ƒf ¾%óú7ÅÆ>’ÂtWñ >õo:Á4̾%~·õ”>&¹¶t°²¾¹æÂ-¡°¾ û¢—€>$hR⡾'EÂé‡>‰ø#Æ‚K>: ùŸFN¾##¢a>'–š‚4žü–Cíx½îIqTû$æ>!µJ¸È¶¾'°Ñ®¹R > ˆûääw°½¼¯~©ÜŠ¾ /÷´ eó>'˜¨Ê+ó¾!ç?¡¡, =ò@˜A}ï>,1u2áϾ'UÊAHn>#|öÛ4g¾ á8Ìd¾߀£CÁ“>&ëEÕm|¾$"„Ý:øþ>ƒ7´1Æ>†-pþã¾&^À¹åó¸>$þ;ä}= ¾ ÿ?á¾':}Pd>%±l‚ó ¾%®^AòJ>D¿1l>‹ï<ä¾$æƒwðh>&6:— ‡¾4âó…ݾÏŒ¦„F>$Mãù‹«¾&šÂâ!:Ä>®0ØÔ7>*Œ‡¬q¾#kÍ|>&ߤ¿­©þ¾·ž”¿‡½÷ejI)n>" àë/îè¾'‹)ŸZ®>+(÷ú=åÓœ©ÛXê¾!üæT`ž>'ÂÎȸ¾ "½)¨££=±S·_s%F>×dœü ¾&ýÜ ¾[>!’·^”6½é>»¹Üï¾Í5æ‡>&Òyg{ƒ-¾!ôCGÅí=÷´H¡&ü>]IΟU¾&•F~*ñY>"¸#6… ô¾!{|¸L¾[MiÛ…>&IÚÉf¾#d•÷{ž@>²†½’í>ë;Ö»!¾%ïÏMjmà>#ø‡Ü/ç–¾ ¼t{ÛW¾Âæ«z‚>%‰õÛL¾$t—ÇÂ0‹> ø÷‰Ç>£ØéK·¾%L”5ÆN>$Ûa<®Ÿ¦¾ŒH÷ý•û¾Ç>"³U>$š´g釾%1:-äš->pæçÄöÄ> U 3S©¾$û‰ºö>%xâ—w@z¾3:pã¿M¾ :t¿?FÎ>#š )0Rë¾%²íŽØiÁ>Ï\•¡>“ØŒŒO¾#§úï>%ÞgÍù£ ¾D?r4 ‡¾!8:k+>"•Óú'æ³¾%ûʺcéR>•Nîå=ý´ø& ²lÿ±¾ÉG äêè½÷zÒ ÀÖ—>!CS•Ù¾&:¨>ã†øVá=ñž³ÉHɾ!±7x->&cp`À¾㎼ƒÆ½èm#Ïk> ›Má«­]¾&Ä<çV>ÅÊ°¼Î»=Ý3—ØåU¾ +ñêsÃ7>&ÉÂgœ¾‰y<(¢½ÆËDý¼µ>ƒˆ>’¯Ì¾& †1µü€>2:òÆC‰½³†[ö¶ð¾¸üh1F¹>%úæþ·Jò¾Ƥk¹ô=ÓÆÊOÌ€—>û¥;ÕwG¾%ék1ô*> $ûf&\É½à”²¢*Â’¾Qj×Èó>%Øðýb#¾ ]¾±ÌÍ=æ\ºfq–ä>½ƒIY¾%É w›Y> ‹uB¨àñ½ë-VÕüa®¾>V Êî>%·Ä‹¶"¾ ­¡ HsI=ï~s2õ >ÏF!o›H¾%¤ßà¹,> ÅÇ̢⠽ñ%<ØVûá¾nÂÆI'h>%ÈÙȾ Öß¿b‘=òjágÕŒv>ŽwL¾%o† Ó¢> áû_à§ÿ½óU· ȧb¾å±È¾>%q¼#¦wß¾ æ‡|S÷‡=óÒcJÛiT>ÄyÇ" '¾%fÆÆ»§5> â‘Í=•½óÙd\¶.¾¹€ŒÜŒZ>%\”´¿•¾ Ó½t; =ós»¨,>¿`§b\4¾%P¿8Ã×> ¼wìøI½ò·m(¾Óß(¹e>%Dÿj^C¾ žÞdí'=ñ¬û–B¶>ø¢º“_z¾%;÷¨Ô¹> {ÜõÌ蕽ðJõò3f¾2V¹> @>%67¼z)9¾ R3,À]p=ìÿ†šj0³>‚u6‹'<¾%2H¾ ¯º> 4!§R½è…MÓ8+¾ækU.·>%-- t½¾Ââ¶5Û“=ã9Tx°—µ>XBTúµ¾%%]}£F*>3c#‹J“½ÚŒýæò¾ÔœO?G>%NH¿?ê¾”qé¼µ=Êð¤ÕãM0>]i:=¾%áCX’'>ç!"G|=Œs ±#‹l¾õ1þö‚Ä>%qÇ“Ž¾(©’+ȽÐÖ­“3>óÅdUÛ¾$ú,iÆ>R¥€ñ÷ì=á>+M™#,¾SÓíò(Ä>$èárU¾bb\÷V•½êÖÙmaX´> øÌ=Ùò¾$ϦèÃ.>XÔP!wí=òƒu'Õ~!¾ gMç†>$¯wÜ.³x¾:­yE½÷Üs³†5> ÇÈ?ð³o¾$‰šñlH?>~ëÂŽ=ý{Š*¿‚î¾!+ Ÿ©Ê>$]óR{;O¾½´£iŸš¾¸ AÞŠl>!‘*pçž$*Oä_Ä]>W!ý.>à1æŽü¾!÷F\éÈ>#êì»ûÐ[¾ДaK¿¾.ÇÅ•LÁ>"YÞ;Cä×¾#†$ö*>+×01ŒŒ> •I‚vX¾"¶YÔLµÈ>#AòÖ~WK¾mÆAsŠ¾ {|ÎÃÄ># +òÇÁ ¾"Ù˜ªÝ}´> .Û@äÄŸ>J ´)Ô¾#\N x">"d,×Ô<¾ O¯Ä¾³X€©>#¥öôSë¾!߬;¨>1²·ªâ>ñšüSà!¾#æTï3À>!H(¤˜"5¾Ôz\:¾¾Ï_aFM>$ëÓª·Y¾ ›«fø/ =øxÃ*I>©f!Á3¾$:¿Ž` >´ŽEŒ°„½íÚÏ…Vè­¾yÛY8ÍÅ>$JÝZn·a¾ «„õÝ=Ô\»\/cÒ>>­d¬Ô€¾$IÙÛ N><µªcN¸=Ô'lÓjxÒ¾øf¬»>$6¯ðgý¾Eaí‚Ƚîÿ ãõEY>¤q­Ó/«¾$hµ¾+™>€„ÿu=úEEŽ€á¾ ǘn>#ÌqzÑ|¾ÈðÍÓ²c¾¡õ NG>!Y{ýE,¾#mñÊòî>D1 £n‰>*`Δæ¾"‹×†„>"ò2¢Sù¯¾—v’õò£¾ ­âñ9Í•>"”—‹¾"ZRò¤Ì¹> ¯)¼>’ô{´A¾#¨ŠæMâ>!¥é!•;¾£QAzãý¾Hy‡Ô>#uHÞ²E—¾ Òòä\V§=þÛ·Ä 0õ>ñâJiN¾#½úÂ3ÆË>»úÓ•L½ñá åY邾‡^fq>#å,Ék•¶¾‹5úoPR=ÑÆ:+ù'K>úäêÀNݾ#æè­ío†>³gãq=â‹?âí_ ¾C1"I>#Á¬ˆE’N¾a,‰Íb½÷"dh·> ,§E¶KÕ¾#u•¤0ÁÇ>qòÀJÕn>‡[ÿ¼é¾!&ù’¸…>#”××¾H´ý"Ÿ¾ ~¸§q,Œ>! Ò¾"bã'â:/> Èí’ȵG>4Re2!U¾"ž¯Æ+m}>!•˜ñ>s¾‘/Ñèƾ–zo™v>##‰^_ÄO¾ ˜tíÎH=ýö{0¹>ÕÕj`@¥¾#yGz€>Õëh.Ž!½ìˆÏÝ ¾äôÀVãž>#œ]ÿó;#Cj=¡”½¼‡»£>º Øëà÷¾#Œ»§åi>”dß h=ò ÀqÌ3!¾N‚v×o>#H7’r –¾ÄN@:Î1¾5¡NÒá> Ë“H$Åø¾"Ëz›NŠ>û{xÕf> ]‚fÈ £¾!Ãu¤)>"@(Œšú¾ MÌË ¾®~´ÎhÓ>"†b"ôæ{¾!°*u§1>äòÙ#]³>…¿-€Hx¾# ¼®×ÀH>˺ÖXCa½ö?V*³qâ¾"“ª°Ë‚>#U——€¹¾ïU6ûæ=Ðß.' ½ >vÚŒÆ[1¾#\1³_>¦ÂMêDË=ì/ëHƾwˆTÄã>#‹1‡Ã¾öá“]‰Ÿ¾@ Ïx> ‹'ö“T¾"š‚7þ3N>ãýzgw> `eÜÉý¾! ·È' ©>!ÊNUö¾ ðuo‘Pè¾ °F•>"rš?MŸ¾ ®*WŸ>ˆN!ïñŠ>WÃÎç ë¾"øô}%z>ŽÚ½7Xp½îñk'PM•¾>D¸Uee>#/ú‹5~¾7Êrܹ½Ò@ gu°Ü>Áív›®¾#B½á2>aå—Ìå=ø»…Ê,¾Ðy[n˜ü>"¢h;­„n¾¥M2@ɾ_E–vT´>!-DÌw莾!Ú•ß©Ï> ÆÇÀ—Ö>g´-ÀH¾"%T¬7> ¹ (¼þ¾¬ÝOI/»¾²y m5>"Åšh4 ¾}™=øË=ð$-˜—u>÷»5.Žµ¾#'ü>áê‘9m+=ÖbIÙ.%_¾õ´ý†>"â¿MñѾ°ì/Ü]½ûcÚ…ã§Ï>þ{V¾"ZÁÇ%sÈ>ý¦x"=,>f¨>V‹a¾!J¦Ýð`È>!nzOÐǾ ·K÷ü®¬¾Z߉>":HIþvྠä綜Y=ý}2%¾ql>0ç@’æ ¾"Ã÷û7Š²>ÑuLCĽÚCÔÄûj¾“ frˆÌ>"ÝÚÙjW¾®*yCï½ðÉâ½âPc>\‹bU¯¾"‚5-Œ&>æ9|€ÀF>÷v û®¹¾ ¶ÕÐ P>!°ÔÞ,¾ ,€-¥)W¾Dú~ëÙ>!Öä®a"̾ jó‘‘*.>½yÎθ>Ée=¢I¾"…ÊM“W>p¾bŒ};½ç¬P¢“ž‡màq´>"»¿öÍf¯¾=ùàj÷p½êI!v|9>¦–‰U›¾"qñÁü™[>NäîÝŒ>ÄÊ4ú"v¾ €2–eý>!£ƪ¤/¾ }¶±¸°,¾Ÿ—Èm¸>!¸ó ¼D‰¾ PâqÎv|>ge®[>××ÁúØ,¾"oVºj&>P»Û@¹½âß¡D….¾Ë\u™X >"šªÄ6j¾~s¦Ö/¦½ð^£c'–®>Ýß7о"7lÌü‘ø>7 ÏÚF4>îä¢^¾ ªè‹àµ>!EFhÁøZ¾ ›]cµH¸¾“9âÄ>!ÔîÉÑ¥¾Œ™+yð =û¡ ó©À+>8Îb]ŒÞ¾"o¥0!d>€ X –ν«—N÷¾2–;'öC>"nÒƒpð¾}Tàróë½ú/ò™¶Ïb>*¿SïÍѽù) ¦F,¾%ÊKžËßp>2Ré×<ù¾1åœæ×]>"³ª·>1> ”t!Gø¾,üµ"‘>33î¤Ñ%™¾.¼|Xöˆ¡>ÓŸÞ³{c> Ç3Ⱦ1):B\"ç>2¡E,ATt¾'•u¦Ô!½Ò~þ»ÛC±>(lâÅ’—T¾2¨>XDu…>0Á m›š ¾$Õ'L¹¾Õ`”Ò>/&L±!ÿ¾2ÔÜ¿Qº>+`t[Õb„¾m˜5<ľ#ʨ 6±½>1Â`ŵ&¾1¤š^äBm>#7ßÝO~€>Èùva¥¾+˜5%¢>2©qúá¾.977¾S>Ãs$ú‹¾0©@‘Ü>2 f×"Z¾&Æò  ;½Ü’ Ðœ>(Šá¾22ÿì8Œ>0\<ë ~¾·zär¾ŒÌê±>.èÎO¾2Bp¢y&>)•A·Æ¸C½ø¡ÔÁ9¾$Ær åI>1“ç þ?¾0Ç.ùóž=> »d+ã>›0æ6o¾,€@á1Z>2,ñ9ÀH„¾+¨å4Æ;E> ¤Ci¶¤D>!µO« ¥ê¾0ÛŒP"Îr>1*ÔS²Ô2¾#NŒ´zf¾û&‚î˜>*3gu@[ ¾1óÄ[2.>-0z€üf¾Kά—×¾ä[e5>0$ø ðÌþ¾1]4fŵ>%C_¥j’Â=‘üq¾(&ñÀÅi>1£+A$ $¾.2èµ^Ä>_© µ>‹E–Öþè¾.é}ZFá‰>1hNÅÃ~H¾&µØå =¶¾ŸlÚä>&d7“ò˾1MÁ2 eâ>.ÚíXiöþ¾Æ²¹S¾ùøÓ1“c>-¾2ÇÅíî¾1]&®vù|>'ªgîê`½ë(NZ,¾%[ÅçkJ>0ùŽ „³¾/)Çu÷>프kªÁ>R4´8¾,ÃrÙJ¾>1@:Q ¾(;¨¢¼Â=õíq5Σ>#ûúŸ¤l_¾0±tX‰>/?›£Ês‰¾,;[€¾§g¬•Ã>,|ØŠË ¾1Þ\‹pÌ>(j,ÏȽúY®¾#`ë¹sT¯>0vWÒ0Û¾/н¸Ll>}¿ü—”Œ>ã‡6J!¾+¥)þ>\>0ò›ÙE¾(G#&EÈñÂ0¾0Nu&#ˆß>.Ć ë‘ò¾ÿÈiv’ ¾ƒ_’>þ>+…‚^ÈEɾ0ů‘Œè±>'Ìêü*ƽ÷+½C_ر¾#R”Ë£×>04OŽiÁ¾.9^äËA¹>¥Ïu”B>KÑÀë²¾+ŸWŒÓ<>0‘¿}°Ãо'LÅ,óñ=ðxäˆû|>#Ö…fÛ^k¾0)ÙÚ­åˆ>-„@¥[¾‚ܾG`¾«YjX>+ýkÒ¾0Wh aÍ>%ã¨vjøø½×÷Ú곊¾$³B×xŒ>0%ô<«¾,Š{¶Xñ•>„JV¨ÆQ>«ðŽ¾»¾,€Y7Ò³>0 o½q¾$l%DyÇ:½Þ9ܘ! L>%Ó_•|„k¾0#…ÖÔ>+T¹Åô¾D¾º$KÇè¾®ÕÖ…>-,1¥Wý¾/Yßb>"èrºhË=ø `ÏÎ2¸¾'1ž$A>0~£W¦¾)ÂLea‘> >[Û\>µã€ë¾-ÙDMiSË>.Wž ›Ѿ JšÚ½ªk¾2§zTŽ®>(°ñ qH^¾/ò63vß>'×–3•ú¾+°õØ;¾!IAÏè¿>.‚@Ó>A½¾-â_Êö™>"S] ²>ÈPýâË}¾*BÓeÿü´>/o݃'ž%r6T0çŽ=â+ôÓ>#°*wPÖ¾.÷.š\‘>+Dƒñ3b¾Ìù*5@"¾ï?÷™w>+À„K¢ôj¾.”vS"…>"—…j!gŽ=ó³hÖ¥¾&*ÎI£C>/*[ì—C¾)§<+%*> Q^•Å>‡ÔXä¾- 8þYS>-7-4)ö¾T3‚œ 1¾ìô-Nz>(Ò=Wɾ.äÈG{Y>&.´eãG½õsC6D86¾"óP%oÂ>.5žã¾+E]h`é>qˆ.–¦^>¹Š6Ô¾*º[Úç±Ò>.4G,¾"¶l¿žÊk½ìŸ•ät‡}>%`E.ø@¾.uE'áÿÊ>(šw!Aìø¾ Ò”Æ"¾â¥&e<;>,w¿‰àGâ¾,€¥äÖ¬>• ·Õ> ’“ñ¿¾(ZHo—ì>.0%öŠ7¾%, Eo»ƒ=ìD5þ®Ä>"clj%)¾-›ÅÜI ‡>*Ê7…-¾ºíIPG¾ÉÅûBc>*àÆOi×7¾-;8òx> æ“,EÀ#=ü¶åôr#‰¾&Cïg—>-æ~ö è¾&¼öx´-é>_‘­½H> *¯ìΘҾ,£wàÉ>*çü5Iu6¾°l¿)èÙ¾!땼Ī>)rÒ¸Ðã\¾--)øŸ>"iÂl:þ=çÅǬÈ, ¾$œ­ƒcP>-tã±Z¼^¾'¡Ö˜dQ>:µ ;~>ÿéWHÈ:¾+Ì{zþ>+8ª¯R[¾* )Óî¾4?ÇÕ>(afïÝ Ê¾-W½]Ä=>#)ÑiY]‡=¾ü”zÑ^Þ¾# >,ú€–ξ'óÆ¥â> ÌϺ|>’}ÛR¶¾++#ì¿­è>+1À‡¯ó®¾,3È8÷:¾ @À²©s0>'Â2bç¾,¿·œ‚p>#K¯+yžI½µ°—e+«×¾#nlÙàþ>,—²[4±¾'ɜ۫´)> EeÎ>zÍô¾*Ï d]gÈ>*Û ¹À+ž¾ úùé¾ VãöçL§>']Ú²¾,a n™vö>"Û{4.Æ=¶œc°ɾ#²|ýór>,S;‹L’¬¾'7 ¢ît> wþ˜MŽ>X°r8 ê¾*ÀýCH†È>*Bvã:{¾쥦À §¾€§2ãF>'Ï«Paê¾+äh-†ž<>!ÐPúÒ U=äªZÙÖ˜¾#¶Y¸_\®>,d¹z ¾&,ÈþÁSö>óŸÀ¶nu>m•Pû;*å~ü‰>)[ülоÌÁ«mCã¾0e iƸ>(j͸)l¾+AUˆfß> -Ns£?»=ùoÜõQ ¾$Ñ—úÿ Ö>+Ô!ÿ¯ƒr¾$š¹˜ ·=öß(ð,¾[> QšòIG¾+Æ”I/>(EÆêú¾>}ÈƪV¾VªÉʹÇ>)58‚]µ×¾*LQw$ÐÚ>È!æ¿Y>†ÙåP¾&;ïËúøâ>+bÖwDš¾"s]x*º=”ƒ¿CØUW>"\![¹Y¾+G‚`2>&#²PC»å¾n¨ù Á„¾®²sK[>* {ë篾(Ùq Nd>²ïùD|Û>s\®›‰¾'ÄœºÛ6*>*„ ÏOøl¾© Þâí½û`PÞB²>$œž„ ÓÞ¾+U¨-s“>#’|_o:O½îuaꂱ¾ º>è§Ë>*¨°?#°¾&À‡íÉ–> 2ì&u>‘K ðç¾)5Uã‚°$>)¨®Oá¾®–È/¸¾ à:¼þHÊ>&ÝQÁþ*Yãnÿi> fˆv!=óÐ|%Ø÷ê¾#Âß‘ç¬>*ºé{a¥ê¾#Âì´4ò-=óýžƒ®ä> ϾÊGî¾*1Ž}Ï$>&¦ºÏT›Å¾ ¹ðEr:¾½æc¢ >(Ê £Àࣾ(¹o‘ÅŸ>s™Œ²-> ‹´xºŒ²¾&™‡l…pP>)ôCJÇ÷W¾kLŽH†[½õýÈéy>#¼m~&$£¾*Yˆ§2¼ >#!èˆ ÚS½î*¨'˽¾ T0R‘Þ:>)ñj¼$úI¾%éd¶&ƒ©> tT2è´@>Çf_ý}¾(ÇêjÓØè>'ûøþWž¾Ü~t˾Õç®é»X>&ì¶ ,Œ¾)Qñ8ךp>µ¿6Je>©ì6ÏŸ¾$tÿÍX¾>)ë…RO4Z¾!¯ZX72g=®´“Xâ;>!{ÞA³¾)ÐIY;¼½>${EQR¾DÚYsy;9CŸ#‰>) 'KSÕ¾&°ÇÙ§Å>žh© VŽ>ìà˸¾'¨Öˆ·Ë>(GÍ–)¾ÿÆsÒ´¾  \Ê>%¸Mk*l¾):¤®Ü>¡ìˆeê=õÚ9ªÚâ¾#KWTëÃ>)Žö†ö’ÿ¾"3ÓQB3=â•À‹p_˜> xôJlÜj¾)LÉI}ú>$ŸN)~0¾ÊAÃÁ¾³|ãΤ>(~ņá¦<¾&Š$ß¼D>¤Y“>‚%èAò¾'01WçW>'îy$¾¶[†¾ 7´×þ*a>%lÕô¹ó˜¾(ɤVn€>´`ö=ë =øEÇú¸š[¾#Cˆ`„¬5>) ±)ÀÛ“¾!}ûƒ.=ÎNŒ¿°OT> Æ2q¶©Å¾(ûp•Gâ“>#¿Im±?½ÿ)¹KûÃE¾>ŒU(>(bÄg>? ¾%— ç[0õ> ¤êš'©>:-j“—¾'_N§ÍpK>'ªѾm¤©Y›+¾&.xžT°>%ùªâF¾'úž G > У\ç>à;ãM!“¾$<ä÷ÏO>(ˆ qìP9¾$æź½íš¢_m`½>"6É2·}+¾(¯Áô*¼ß>!ÄòZõ³9½ãšœtÝ{̾íäVñâÀ>(xHLTß¾#­˜rt;w>Í#Y(¥ >‹úû+¾'çŽw >%?ƒ ¥ò_¾ :ø-1žþ«’1?>'£ÉL¾&xçR 67>_-¨sŽ>¹Lb̾%Òpr!´>'[Çå÷ ¾K¶¦m"ª¾´QÊ¥é=>$`|î¨ó¾'ìÿMìç>ÌbñLé=÷â›äŃ…¾"·µ'9 o>(1*¥až¾ kmÇ2«¸½Åˆ¸âsÄ> äÞ6î(¾(+¸nh’å>"0Bu9µD½ñál”+VŒ¾ÚvüÀÑ>'ß`7Ôwô¾#²Ql­ú­>ÒUÌ!›$>³ÍÈY¾'PöøΑÜ>$òk$}îc¾ >yûDˆe¾`Ï;7šk>&‡Ø—ƒf ¾%óú7ÅÆ>’ÂtWñ >õo:Á4̾%~·õ”>&¹¶t°²¾¹æÂ-¡°¾ û¢—€>$hR⡾'EÂé‡>‰ø#Æ‚K>: ùŸFN¾##¢a>'–š‚4žü–Cíx½îIqTû$æ>!µJ¸È¶¾'°Ñ®¹R > ˆûääw°½¼¯~©ÜŠ¾ /÷´ eó>'˜¨Ê+ó¾!ç?¡¡, =ò@˜A}ï>,1u2áϾ'UÊAHn>#|öÛ4g¾ á8Ìd¾߀£CÁ“>&ëEÕm|¾$"„Ý:øþ>ƒ7´1Æ>†-pþã¾&^À¹åó¸>$þ;ä}= ¾ ÿ?á¾':}Pd>%±l‚ó ¾%®^AòJ>D¿1l>‹ï<ä¾$æƒwðh>&6:— ‡¾4âó…ݾÏŒ¦„F>$Mãù‹«¾&šÂâ!:Ä>®0ØÔ7>*Œ‡¬q¾#kÍ|>&ߤ¿­©þ¾·ž”¿‡½÷ejI)n>" àë/îè¾'‹)ŸZ®>+(÷ú=åÓœ©ÛXê¾!üæT`ž>'ÂÎȸ¾ "½)¨££=±S·_s%F>×dœü ¾&ýÜ ¾[>!’·^”6½é>»¹Üï¾Í5æ‡>&Òyg{ƒ-¾!ôCGÅí=÷´H¡&ü>]IΟU¾&•F~*ñY>"¸#6… ô¾!{|¸L¾[MiÛ…>&IÚÉf¾#d•÷{ž@>²†½’í>ë;Ö»!¾%ïÏMjmà>#ø‡Ü/ç–¾ ¼t{ÛW¾Âæ«z‚>%‰õÛL¾$t—ÇÂ0‹> ø÷‰Ç>£ØéK·¾%L”5ÆN>$Ûa<®Ÿ¦¾ŒH÷ý•û¾Ç>"³U>$š´g釾%1:-äš->pæçÄöÄ> U 3S©¾$û‰ºö>%xâ—w@z¾3:pã¿M¾ :t¿?FÎ>#š )0Rë¾%²íŽØiÁ>Ï\•¡>“ØŒŒO¾#§úï>%ÞgÍù£ ¾D?r4 ‡¾!8:k+>"•Óú'æ³¾%ûʺcéR>•Nîå=ý´ø& ²lÿ±¾ÉG äêè½÷zÒ ÀÖ—>!CS•Ù¾&:¨>ã†øVá=ñž³ÉHɾ!±7x->&cp`À¾㎼ƒÆ½èm#Ïk> ›Má«­]¾&Ä<çV>ÅÊ°¼Î»=Ý3—ØåU¾ +ñêsÃ7>&ÉÂgœ¾‰y<(¢½ÆËDý¼µ>ƒˆ>’¯Ì¾& †1µü€>2:òÆC‰½³†[ö¶ð¾¸üh1F¹>%úæþ·Jò¾Ƥk¹ô=ÓÆÊOÌ€—>û¥;ÕwG¾%ék1ô*> $ûf&\É½à”²¢*Â’¾Qj×Èó>%Øðýb#¾ ]¾±ÌÍ=æ\ºfq–ä>½ƒIY¾%É w›Y> ‹uB¨àñ½ë-VÕüa®¾>V Êî>%·Ä‹¶"¾ ­¡ HsI=ï~s2õ >ÏF!o›H¾%¤ßà¹,> ÅÇ̢⠽ñ%<ØVûá¾nÂÆI'h>%ÈÙȾ Öß¿b‘=òjágÕŒv>ŽwL¾%o† Ó¢> áû_à§ÿ½óU· ȧb¾å±È¾>%q¼#¦wß¾ æ‡|S÷‡=óÒcJÛiT>ÄyÇ" '¾%fÆÆ»§5> â‘Í=•½óÙd\¶.¾¹€ŒÜŒZ>%\”´¿•¾ Ó½t; =ós»¨,>¿`§b\4¾%P¿8Ã×> ¼wìøI½ò·m(¾Óß(¹e>%Dÿj^C¾ žÞdí'=ñ¬û–B¶>ø¢º“_z¾%;÷¨Ô¹> {ÜõÌ蕽ðJõò3f¾2V¹> @>%67¼z)9¾ R3,À]p=ìÿ†šj0³>‚u6‹'<¾%2H¾ ¯º> 4!§R½è…MÓ8+¾ækU.·>%-- t½¾Ââ¶5Û“=ã9Tx°—µ>XBTúµ¾%%]}£F*>3c#‹J“½ÚŒýæò¾ÔœO?G>%NH¿?ê¾”qé¼µ=Êð¤ÕãM0>]i:=¾%áCX’'>ç!"G|=Œs ±#‹l¾õ1þö‚Ä>%qÇ“Ž¾(©’+ȽÐÖ­“3>óÅdUÛ¾$ú,iÆ>R¥€ñ÷ì=á>+M™#,¾SÓíò(Ä>$èárU¾bb\÷V•½êÖÙmaX´> øÌ=Ùò¾$ϦèÃ.>XÔP!wí=òƒu'Õ~!¾ gMç†>$¯wÜ.³x¾:­yE½÷Üs³†5> ÇÈ?ð³o¾$‰šñlH?>~ëÂŽ=ý{Š*¿‚î¾!+ Ÿ©Ê>$]óR{;O¾½´£iŸš¾¸ AÞŠl>!‘*pçž$*Oä_Ä]>W!ý.>à1æŽü¾!÷F\éÈ>#êì»ûÐ[¾ДaK¿¾.ÇÅ•LÁ>"YÞ;Cä×¾#†$ö*>+×01ŒŒ> •I‚vX¾"¶YÔLµÈ>#AòÖ~WK¾mÆAsŠ¾ {|ÎÃÄ># +òÇÁ ¾"Ù˜ªÝ}´> .Û@äÄŸ>J ´)Ô¾#\N x">"d,×Ô<¾ O¯Ä¾³X€©>#¥öôSë¾!߬;¨>1²·ªâ>ñšüSà!¾#æTï3À>!H(¤˜"5¾Ôz\:¾¾Ï_aFM>$ëÓª·Y¾ ›«fø/ =øxÃ*I>©f!Á3¾$:¿Ž` >´ŽEŒ°„½íÚÏ…Vè­¾yÛY8ÍÅ>$JÝZn·a¾ «„õÝ=Ô\»\/cÒ>>­d¬Ô€¾$IÙÛ N><µªcN¸=Ô'lÓjxÒ¾øf¬»>$6¯ðgý¾Eaí‚Ƚîÿ ãõEY>¤q­Ó/«¾$hµ¾+™>€„ÿu=úEEŽ€á¾ ǘn>#ÌqzÑ|¾ÈðÍÓ²c¾¡õ NG>!Y{ýE,¾#mñÊòî>D1 £n‰>*`Δæ¾"‹×†„>"ò2¢Sù¯¾—v’õò£¾ ­âñ9Í•>"”—‹¾"ZRò¤Ì¹> ¯)¼>’ô{´A¾#¨ŠæMâ>!¥é!•;¾£QAzãý¾Hy‡Ô>#uHÞ²E—¾ Òòä\V§=þÛ·Ä 0õ>ñâJiN¾#½úÂ3ÆË>»úÓ•L½ñá åY邾‡^fq>#å,Ék•¶¾‹5úoPR=ÑÆ:+ù'K>úäêÀNݾ#æè­ío†>³gãq=â‹?âí_ ¾C1"I>#Á¬ˆE’N¾a,‰Íb½÷"dh·> ,§E¶KÕ¾#u•¤0ÁÇ>qòÀJÕn>‡[ÿ¼é¾!&ù’¸…>#”××¾H´ý"Ÿ¾ ~¸§q,Œ>! Ò¾"bã'â:/> Èí’ȵG>4Re2!U¾"ž¯Æ+m}>!•˜ñ>s¾‘/Ñèƾ–zo™v>##‰^_ÄO¾ ˜tíÎH=ýö{0¹>ÕÕj`@¥¾#yGz€>Õëh.Ž!½ìˆÏÝ ¾äôÀVãž>#œ]ÿó;#Cj=¡”½¼‡»£>º Øëà÷¾#Œ»§åi>”dß h=ò ÀqÌ3!¾N‚v×o>#H7’r –¾ÄN@:Î1¾5¡NÒá> Ë“H$Åø¾"Ëz›NŠ>û{xÕf> ]‚fÈ £¾!Ãu¤)>"@(Œšú¾ MÌË ¾®~´ÎhÓ>"†b"ôæ{¾!°*u§1>äòÙ#]³>…¿-€Hx¾# ¼®×ÀH>˺ÖXCa½ö?V*³qâ¾"“ª°Ë‚>#U——€¹¾ïU6ûæ=Ðß.' ½ >vÚŒÆ[1¾#\1³_>¦ÂMêDË=ì/ëHƾwˆTÄã>#‹1‡Ã¾öá“]‰Ÿ¾@ Ïx> ‹'ö“T¾"š‚7þ3N>ãýzgw> `eÜÉý¾! ·È' ©>!ÊNUö¾ ðuo‘Pè¾ °F•>"rš?MŸ¾ ®*WŸ>ˆN!ïñŠ>WÃÎç ë¾"øô}%z>ŽÚ½7Xp½îñk'PM•¾>D¸Uee>#/ú‹5~¾7Êrܹ½Ò@ gu°Ü>Áív›®¾#B½á2>aå—Ìå=ø»…Ê,¾Ðy[n˜ü>"¢h;­„n¾¥M2@ɾ_E–vT´>!-DÌw莾!Ú•ß©Ï> ÆÇÀ—Ö>g´-ÀH¾"%T¬7> ¹ (¼þ¾¬ÝOI/»¾²y m5>"Åšh4 ¾}™=øË=ð$-˜—u>÷»5.Žµ¾#'ü>áê‘9m+=ÖbIÙ.%_¾õ´ý†>"â¿MñѾ°ì/Ü]½ûcÚ…ã§Ï>þ{V¾"ZÁÇ%sÈ>ý¦x"=,>f¨>V‹a¾!J¦Ýð`È>!nzOÐǾ ·K÷ü®¬¾Z߉>":HIþvྠä綜Y=ý}2%¾ql>0ç@’æ ¾"Ã÷û7Š²>ÑuLCĽÚCÔÄûj¾“ frˆÌ>"ÝÚÙjW¾®*yCï½ðÉâ½âPc>\‹bU¯¾"‚5-Œ&>æ9|€ÀF>÷v û®¹¾ ¶ÕÐ P>!°ÔÞ,¾ ,€-¥)W¾Dú~ëÙ>!Öä®a"̾ jó‘‘*.>½yÎθ>Ée=¢I¾"…ÊM“W>p¾bŒ};½ç¬P¢“ž‡màq´>"»¿öÍf¯¾=ùàj÷p½êI!v|9>¦–‰U›¾"qñÁü™[>NäîÝŒ>ÄÊ4ú"v¾ €2–eý>!£ƪ¤/¾ }¶±¸°,¾Ÿ—Èm¸>!¸ó ¼D‰¾ PâqÎv|>ge®[>××ÁúØ,¾"oVºj&>P»Û@¹½âß¡D….¾Ë\u™X >"šªÄ6j¾~s¦Ö/¦½ð^£c'–®>Ýß7о"7lÌü‘ø>7 ÏÚF4>îä¢^¾ ªè‹àµ>!EFhÁøZ¾ ›]cµH¸¾“9âÄ>!ÔîÉÑ¥¾Œ™+yð =û¡ ó©À+>8Îb]ŒÞ¾"o¥0!d>€ X –ν«—N÷¾2–;'öC>"nÒƒpð¾}Tàróë½ú/ò™¶Ïb>*¿SïÍѽù) ¦F,¾%ÊKžËßp>2Ré×<ù¾1åœæ×]>"³ª·>1> ”t!Gø¾,üµ"‘>33î¤Ñ%™¾.¼|Xöˆ¡>ÓŸÞ³{c> Ç3Ⱦ1):B\"ç>2¡E,ATt¾'•u¦Ô!½Ò~þ»ÛC±>(lâÅ’—T¾2¨>XDu…>0Á m›š ¾$Õ'L¹¾Õ`”Ò>/&L±!ÿ¾2ÔÜ¿Qº>+`t[Õb„¾m˜5<ľ#ʨ 6±½>1Â`ŵ&¾1¤š^äBm>#7ßÝO~€>Èùva¥¾+˜5%¢>2©qúá¾.977¾S>Ãs$ú‹¾0©@‘Ü>2 f×"Z¾&Æò  ;½Ü’ Ðœ>(Šá¾22ÿì8Œ>0\<ë ~¾·zär¾ŒÌê±>.èÎO¾2Bp¢y&>)•A·Æ¸C½ø¡ÔÁ9¾$Ær åI>1“ç þ?¾0Ç.ùóž=> »d+ã>›0æ6o¾,€@á1Z>2,ñ9ÀH„¾+¨å4Æ;E> ¤Ci¶¤D>!µO« ¥ê¾0ÛŒP"Îr>1*ÔS²Ô2¾#NŒ´zf¾û&‚î˜>*3gu@[ ¾1óÄ[2.>-0z€üf¾Kά—×¾ä[e5>0$ø ðÌþ¾1]4fŵ>%C_¥j’Â=‘üq¾(&ñÀÅi>1£+A$ $¾.2èµ^Ä>_© µ>‹E–Öþè¾.é}ZFá‰>1hNÅÃ~H¾&µØå =¶¾ŸlÚä>&d7“ò˾1MÁ2 eâ>.ÚíXiöþ¾Æ²¹S¾ùøÓ1“c>-¾2ÇÅíî¾1]&®vù|>'ªgîê`½ë(NZ,¾%[ÅçkJ>0ùŽ „³¾/)Çu÷>프kªÁ>R4´8¾,ÃrÙJ¾>1@:Q ¾(;¨¢¼Â=õíq5Σ>#ûúŸ¤l_¾0±tX‰>/?›£Ês‰¾,;[€¾§g¬•Ã>,|ØŠË ¾1Þ\‹pÌ>(j,ÏȽúY®¾#`ë¹sT¯>0vWÒ0Û¾/н¸Ll>}¿ü—”Œ>ã‡6J!¾+¥)þ>\>0ò›ÙE¾(G#&EÈñÂ0¾0Nu&#ˆß>.Ć ë‘ò¾ÿÈiv’ ¾ƒ_’>þ>+…‚^ÈEɾ0ů‘Œè±>'Ìêü*ƽ÷+½C_ر¾#R”Ë£×>04OŽiÁ¾.9^äËA¹>¥Ïu”B>KÑÀë²¾+ŸWŒÓ<>0‘¿}°Ãо'LÅ,óñ=ðxäˆû|>#Ö…fÛ^k¾0)ÙÚ­åˆ>-„@¥[¾‚ܾG`¾«YjX>+ýkÒ¾0Wh aÍ>%ã¨vjøø½×÷Ú곊¾$³B×xŒ>0%ô<«¾,Š{¶Xñ•>„JV¨ÆQ>«ðŽ¾»¾,€Y7Ò³>0 o½q¾$l%DyÇ:½Þ9ܘ! L>%Ó_•|„k¾0#…ÖÔ>+T¹Åô¾D¾º$KÇè¾®ÕÖ…>-,1¥Wý¾/Yßb>"èrºhË=ø `ÏÎ2¸¾'1ž$A>0~£W¦¾)ÂLea‘> >[Û\>µã€ë¾-ÙDMiSË>.Wž ›Ѿ JšÚ½ªk¾2§zTŽ®>(°ñ qH^¾/ò63vß>'×–3•ú¾+°õØ;¾!IAÏè¿>.‚@Ó>A½¾-â_Êö™>"S] ²>ÈPýâË}¾*BÓeÿü´>/o݃'ž%r6T0çŽ=â+ôÓ>#°*wPÖ¾.÷.š\‘>+Dƒñ3b¾Ìù*5@"¾ï?÷™w>+À„K¢ôj¾.”vS"…>"—…j!gŽ=ó³hÖ¥¾&*ÎI£C>/*[ì—C¾)§<+%*> Q^•Å>‡ÔXä¾- 8þYS>-7-4)ö¾T3‚œ 1¾ìô-Nz>(Ò=Wɾ.äÈG{Y>&.´eãG½õsC6D86¾"óP%oÂ>.5žã¾+E]h`é>qˆ.–¦^>¹Š6Ô¾*º[Úç±Ò>.4G,¾"¶l¿žÊk½ìŸ•ät‡}>%`E.ø@¾.uE'áÿÊ>(šw!Aìø¾ Ò”Æ"¾â¥&e<;>,w¿‰àGâ¾,€¥äÖ¬>• ·Õ> ’“ñ¿¾(ZHo—ì>.0%öŠ7¾%, Eo»ƒ=ìD5þ®Ä>"clj%)¾-›ÅÜI ‡>*Ê7…-¾ºíIPG¾ÉÅûBc>*àÆOi×7¾-;8òx> æ“,EÀ#=ü¶åôr#‰¾&Cïg—>-æ~ö è¾&¼öx´-é>_‘­½H> *¯ìΘҾ,£wàÉ>*çü5Iu6¾°l¿)èÙ¾!땼Ī>)rÒ¸Ðã\¾--)øŸ>"iÂl:þ=çÅǬÈ, ¾$œ­ƒcP>-tã±Z¼^¾'¡Ö˜dQ>:µ ;~>ÿéWHÈ:¾+Ì{zþ>+8ª¯R[¾* )Óî¾4?ÇÕ>(afïÝ Ê¾-W½]Ä=>#)ÑiY]‡=¾ü”zÑ^Þ¾# >,ú€–ξ'óÆ¥â> ÌϺ|>’}ÛR¶¾++#ì¿­è>+1À‡¯ó®¾,3È8÷:¾ @À²©s0>'Â2bç¾,¿·œ‚p>#K¯+yžI½µ°—e+«×¾#nlÙàþ>,—²[4±¾'ɜ۫´)> EeÎ>zÍô¾*Ï d]gÈ>*Û ¹À+ž¾ úùé¾ VãöçL§>']Ú²¾,a n™vö>"Û{4.Æ=¶œc°ɾ#²|ýór>,S;‹L’¬¾'7 ¢ît> wþ˜MŽ>X°r8 ê¾*ÀýCH†È>*Bvã:{¾쥦À §¾€§2ãF>'Ï«Paê¾+äh-†ž<>!ÐPúÒ U=äªZÙÖ˜¾#¶Y¸_\®>,d¹z ¾&,ÈþÁSö>óŸÀ¶nu>m•Pû;*å~ü‰>)[ülоÌÁ«mCã¾0e iƸ>(j͸)l¾+AUˆfß> -Ns£?»=ùoÜõQ ¾$Ñ—úÿ Ö>+Ô!ÿ¯ƒr¾$š¹˜ ·=öß(ð,¾[> QšòIG¾+Æ”I/>(EÆêú¾>}ÈƪV¾VªÉʹÇ>)58‚]µ×¾*LQw$ÐÚ>È!æ¿Y>†ÙåP¾&;ïËúøâ>+bÖwDš¾"s]x*º=”ƒ¿CØUW>"\![¹Y¾+G‚`2>&#²PC»å¾n¨ù Á„¾®²sK[>* {ë篾(Ùq Nd>²ïùD|Û>s\®›‰¾'ÄœºÛ6*>*„ ÏOøl¾© Þâí½û`PÞB²>$œž„ ÓÞ¾+U¨-s“>#’|_o:O½îuaꂱ¾ º>è§Ë>*¨°?#°¾&À‡íÉ–> 2ì&u>‘K ðç¾)5Uã‚°$>)¨®Oá¾®–È/¸¾ à:¼þHÊ>&ÝQÁþ*Yãnÿi> fˆv!=óÐ|%Ø÷ê¾#Âß‘ç¬>*ºé{a¥ê¾#Âì´4ò-=óýžƒ®ä> ϾÊGî¾*1Ž}Ï$>&¦ºÏT›Å¾ ¹ðEr:¾½æc¢ >(Ê £Àࣾ(¹o‘ÅŸ>s™Œ²-> ‹´xºŒ²¾&™‡l…pP>)ôCJÇ÷W¾kLŽH†[½õýÈéy>#¼m~&$£¾*Yˆ§2¼ >#!èˆ ÚS½î*¨'˽¾ T0R‘Þ:>)ñj¼$úI¾%éd¶&ƒ©> tT2è´@>Çf_ý}¾(ÇêjÓØè>'ûøþWž¾Ü~t˾Õç®é»X>&ì¶ ,Œ¾)Qñ8ךp>µ¿6Je>©ì6ÏŸ¾$tÿÍX¾>)ë…RO4Z¾!¯ZX72g=®´“Xâ;>!{ÞA³¾)ÐIY;¼½>${EQR¾DÚYsy;9CŸ#‰>) 'KSÕ¾&°ÇÙ§Å>žh© VŽ>ìà˸¾'¨Öˆ·Ë>(GÍ–)¾ÿÆsÒ´¾  \Ê>%¸Mk*l¾):¤®Ü>¡ìˆeê=õÚ9ªÚâ¾#KWTëÃ>)Žö†ö’ÿ¾"3ÓQB3=â•À‹p_˜> xôJlÜj¾)LÉI}ú>$ŸN)~0¾ÊAÃÁ¾³|ãΤ>(~ņá¦<¾&Š$ß¼D>¤Y“>‚%èAò¾'01WçW>'îy$¾¶[†¾ 7´×þ*a>%lÕô¹ó˜¾(ɤVn€>´`ö=ë =øEÇú¸š[¾#Cˆ`„¬5>) ±)ÀÛ“¾!}ûƒ.=ÎNŒ¿°OT> Æ2q¶©Å¾(ûp•Gâ“>#¿Im±?½ÿ)¹KûÃE¾>ŒU(>(bÄg>? ¾%— ç[0õ> ¤êš'©>:-j“—¾'_N§ÍpK>'ªѾm¤©Y›+¾&.xžT°>%ùªâF¾'úž G > У\ç>à;ãM!“¾$<ä÷ÏO>(ˆ qìP9¾$æź½íš¢_m`½>"6É2·}+¾(¯Áô*¼ß>!ÄòZõ³9½ãšœtÝ{̾íäVñâÀ>(xHLTß¾#­˜rt;w>Í#Y(¥ >‹úû+¾'çŽw >%?ƒ ¥ò_¾ :ø-1žþ«’1?>'£ÉL¾&xçR 67>_-¨sŽ>¹Lb̾%Òpr!´>'[Çå÷ ¾K¶¦m"ª¾´QÊ¥é=>$`|î¨ó¾'ìÿMìç>ÌbñLé=÷â›äŃ…¾"·µ'9 o>(1*¥až¾ kmÇ2«¸½Åˆ¸âsÄ> äÞ6î(¾(+¸nh’å>"0Bu9µD½ñál”+VŒ¾ÚvüÀÑ>'ß`7Ôwô¾#²Ql­ú­>ÒUÌ!›$>³ÍÈY¾'PöøΑÜ>$òk$}îc¾ >yûDˆe¾`Ï;7šk>&‡Ø—ƒf ¾%óú7ÅÆ>’ÂtWñ >õo:Á4̾%~·õ”>&¹¶t°²¾¹æÂ-¡°¾ û¢—€>$hR⡾'EÂé‡>‰ø#Æ‚K>: ùŸFN¾##¢a>'–š‚4žü–Cíx½îIqTû$æ>!µJ¸È¶¾'°Ñ®¹R > ˆûääw°½¼¯~©ÜŠ¾ /÷´ eó>'˜¨Ê+ó¾!ç?¡¡, =ò@˜A}ï>,1u2áϾ'UÊAHn>#|öÛ4g¾ á8Ìd¾߀£CÁ“>&ëEÕm|¾$"„Ý:øþ>ƒ7´1Æ>†-pþã¾&^À¹åó¸>$þ;ä}= ¾ ÿ?á¾':}Pd>%±l‚ó ¾%®^AòJ>D¿1l>‹ï<ä¾$æƒwðh>&6:— ‡¾4âó…ݾÏŒ¦„F>$Mãù‹«¾&šÂâ!:Ä>®0ØÔ7>*Œ‡¬q¾#kÍ|>&ߤ¿­©þ¾·ž”¿‡½÷ejI)n>" àë/îè¾'‹)ŸZ®>+(÷ú=åÓœ©ÛXê¾!üæT`ž>'ÂÎȸ¾ "½)¨££=±S·_s%F>×dœü ¾&ýÜ ¾[>!’·^”6½é>»¹Üï¾Í5æ‡>&Òyg{ƒ-¾!ôCGÅí=÷´H¡&ü>]IΟU¾&•F~*ñY>"¸#6… ô¾!{|¸L¾[MiÛ…>&IÚÉf¾#d•÷{ž@>²†½’í>ë;Ö»!¾%ïÏMjmà>#ø‡Ü/ç–¾ ¼t{ÛW¾Âæ«z‚>%‰õÛL¾$t—ÇÂ0‹> ø÷‰Ç>£ØéK·¾%L”5ÆN>$Ûa<®Ÿ¦¾ŒH÷ý•û¾Ç>"³U>$š´g釾%1:-äš->pæçÄöÄ> U 3S©¾$û‰ºö>%xâ—w@z¾3:pã¿M¾ :t¿?FÎ>#š )0Rë¾%²íŽØiÁ>Ï\•¡>“ØŒŒO¾#§úï>%ÞgÍù£ ¾D?r4 ‡¾!8:k+>"•Óú'æ³¾%ûʺcéR>•Nîå=ý´ø& ²lÿ±¾ÉG äêè½÷zÒ ÀÖ—>!CS•Ù¾&:¨>ã†øVá=ñž³ÉHɾ!±7x->&cp`À¾㎼ƒÆ½èm#Ïk> ›Má«­]¾&Ä<çV>ÅÊ°¼Î»=Ý3—ØåU¾ +ñêsÃ7>&ÉÂgœ¾‰y<(¢½ÆËDý¼µ>ƒˆ>’¯Ì¾& †1µü€>2:òÆC‰½³†[ö¶ð¾¸üh1F¹>%úæþ·Jò¾Ƥk¹ô=ÓÆÊOÌ€—>û¥;ÕwG¾%ék1ô*> $ûf&\É½à”²¢*Â’¾Qj×Èó>%Øðýb#¾ ]¾±ÌÍ=æ\ºfq–ä>½ƒIY¾%É w›Y> ‹uB¨àñ½ë-VÕüa®¾>V Êî>%·Ä‹¶"¾ ­¡ HsI=ï~s2õ >ÏF!o›H¾%¤ßà¹,> ÅÇ̢⠽ñ%<ØVûá¾nÂÆI'h>%ÈÙȾ Öß¿b‘=òjágÕŒv>ŽwL¾%o† Ó¢> áû_à§ÿ½óU· ȧb¾å±È¾>%q¼#¦wß¾ æ‡|S÷‡=óÒcJÛiT>ÄyÇ" '¾%fÆÆ»§5> â‘Í=•½óÙd\¶.¾¹€ŒÜŒZ>%\”´¿•¾ Ó½t; =ós»¨,>¿`§b\4¾%P¿8Ã×> ¼wìøI½ò·m(¾Óß(¹e>%Dÿj^C¾ žÞdí'=ñ¬û–B¶>ø¢º“_z¾%;÷¨Ô¹> {ÜõÌ蕽ðJõò3f¾2V¹> @>%67¼z)9¾ R3,À]p=ìÿ†šj0³>‚u6‹'<¾%2H¾ ¯º> 4!§R½è…MÓ8+¾ækU.·>%-- t½¾Ââ¶5Û“=ã9Tx°—µ>XBTúµ¾%%]}£F*>3c#‹J“½ÚŒýæò¾ÔœO?G>%NH¿?ê¾”qé¼µ=Êð¤ÕãM0>]i:=¾%áCX’'>ç!"G|=Œs ±#‹l¾õ1þö‚Ä>%qÇ“Ž¾(©’+ȽÐÖ­“3>óÅdUÛ¾$ú,iÆ>R¥€ñ÷ì=á>+M™#,¾SÓíò(Ä>$èárU¾bb\÷V•½êÖÙmaX´> øÌ=Ùò¾$ϦèÃ.>XÔP!wí=òƒu'Õ~!¾ gMç†>$¯wÜ.³x¾:­yE½÷Üs³†5> ÇÈ?ð³o¾$‰šñlH?>~ëÂŽ=ý{Š*¿‚î¾!+ Ÿ©Ê>$]óR{;O¾½´£iŸš¾¸ AÞŠl>!‘*pçž$*Oä_Ä]>W!ý.>à1æŽü¾!÷F\éÈ>#êì»ûÐ[¾ДaK¿¾.ÇÅ•LÁ>"YÞ;Cä×¾#†$ö*>+×01ŒŒ> •I‚vX¾"¶YÔLµÈ>#AòÖ~WK¾mÆAsŠ¾ {|ÎÃÄ># +òÇÁ ¾"Ù˜ªÝ}´> .Û@äÄŸ>J ´)Ô¾#\N x">"d,×Ô<¾ O¯Ä¾³X€©>#¥öôSë¾!߬;¨>1²·ªâ>ñšüSà!¾#æTï3À>!H(¤˜"5¾Ôz\:¾¾Ï_aFM>$ëÓª·Y¾ ›«fø/ =øxÃ*I>©f!Á3¾$:¿Ž` >´ŽEŒ°„½íÚÏ…Vè­¾yÛY8ÍÅ>$JÝZn·a¾ «„õÝ=Ô\»\/cÒ>>­d¬Ô€¾$IÙÛ N><µªcN¸=Ô'lÓjxÒ¾øf¬»>$6¯ðgý¾Eaí‚Ƚîÿ ãõEY>¤q­Ó/«¾$hµ¾+™>€„ÿu=úEEŽ€á¾ ǘn>#ÌqzÑ|¾ÈðÍÓ²c¾¡õ NG>!Y{ýE,¾#mñÊòî>D1 £n‰>*`Δæ¾"‹×†„>"ò2¢Sù¯¾—v’õò£¾ ­âñ9Í•>"”—‹¾"ZRò¤Ì¹> ¯)¼>’ô{´A¾#¨ŠæMâ>!¥é!•;¾£QAzãý¾Hy‡Ô>#uHÞ²E—¾ Òòä\V§=þÛ·Ä 0õ>ñâJiN¾#½úÂ3ÆË>»úÓ•L½ñá åY邾‡^fq>#å,Ék•¶¾‹5úoPR=ÑÆ:+ù'K>úäêÀNݾ#æè­ío†>³gãq=â‹?âí_ ¾C1"I>#Á¬ˆE’N¾a,‰Íb½÷"dh·> ,§E¶KÕ¾#u•¤0ÁÇ>qòÀJÕn>‡[ÿ¼é¾!&ù’¸…>#”××¾H´ý"Ÿ¾ ~¸§q,Œ>! Ò¾"bã'â:/> Èí’ȵG>4Re2!U¾"ž¯Æ+m}>!•˜ñ>s¾‘/Ñèƾ–zo™v>##‰^_ÄO¾ ˜tíÎH=ýö{0¹>ÕÕj`@¥¾#yGz€>Õëh.Ž!½ìˆÏÝ ¾äôÀVãž>#œ]ÿó;#Cj=¡”½¼‡»£>º Øëà÷¾#Œ»§åi>”dß h=ò ÀqÌ3!¾N‚v×o>#H7’r –¾ÄN@:Î1¾5¡NÒá> Ë“H$Åø¾"Ëz›NŠ>û{xÕf> ]‚fÈ £¾!Ãu¤)>"@(Œšú¾ MÌË ¾®~´ÎhÓ>"†b"ôæ{¾!°*u§1>äòÙ#]³>…¿-€Hx¾# ¼®×ÀH>˺ÖXCa½ö?V*³qâ¾"“ª°Ë‚>#U——€¹¾ïU6ûæ=Ðß.' ½ >vÚŒÆ[1¾#\1³_>¦ÂMêDË=ì/ëHƾwˆTÄã>#‹1‡Ã¾öá“]‰Ÿ¾@ Ïx> ‹'ö“T¾"š‚7þ3N>ãýzgw> `eÜÉý¾! ·È' ©>!ÊNUö¾ ðuo‘Pè¾ °F•>"rš?MŸ¾ ®*WŸ>ˆN!ïñŠ>WÃÎç ë¾"øô}%z>ŽÚ½7Xp½îñk'PM•¾>D¸Uee>#/ú‹5~¾7Êrܹ½Ò@ gu°Ü>Áív›®¾#B½á2>aå—Ìå=ø»…Ê,¾Ðy[n˜ü>"¢h;­„n¾¥M2@ɾ_E–vT´>!-DÌw莾!Ú•ß©Ï> ÆÇÀ—Ö>g´-ÀH¾"%T¬7> ¹ (¼þ¾¬ÝOI/»¾²y m5>"Åšh4 ¾}™=øË=ð$-˜—u>÷»5.Žµ¾#'ü>áê‘9m+=ÖbIÙ.%_¾õ´ý†>"â¿MñѾ°ì/Ü]½ûcÚ…ã§Ï>þ{V¾"ZÁÇ%sÈ>ý¦x"=,>f¨>V‹a¾!J¦Ýð`È>!nzOÐǾ ·K÷ü®¬¾Z߉>":HIþvྠä綜Y=ý}2%¾ql>0ç@’æ ¾"Ã÷û7Š²>ÑuLCĽÚCÔÄûj¾“ frˆÌ>"ÝÚÙjW¾®*yCï½ðÉâ½âPc>\‹bU¯¾"‚5-Œ&>æ9|€ÀF>÷v û®¹¾ ¶ÕÐ P>!°ÔÞ,¾ ,€-¥)W¾Dú~ëÙ>!Öä®a"̾ jó‘‘*.>½yÎθ>Ée=¢I¾"…ÊM“W>p¾bŒ};½ç¬P¢“ž‡màq´>"»¿öÍf¯¾=ùàj÷p½êI!v|9>¦–‰U›¾"qñÁü™[>NäîÝŒ>ÄÊ4ú"v¾ €2–eý>!£ƪ¤/¾ }¶±¸°,¾Ÿ—Èm¸>!¸ó ¼D‰¾ PâqÎv|>ge®[>××ÁúØ,¾"oVºj&>P»Û@¹½âß¡D….¾Ë\u™X >"šªÄ6j¾~s¦Ö/¦½ð^£c'–®>Ýß7о"7lÌü‘ø>7 ÏÚF4>îä¢^¾ ªè‹àµ>!EFhÁøZ¾ ›]cµH¸¾“9âÄ>!ÔîÉÑ¥¾Œ™+yð =û¡ ó©À+>8Îb]ŒÞ¾"o¥0!d>€ X –ν«—N÷¾2–;'öC>"nÒƒpð¾}Tàróë½ú/ò™¶Ïb>IJoi9 ¾!ÍK\bö>­õ­Š> ?ÁÀd&U¾!+še3> ŽR(W¾}bGîyê¾M\Ÿlà>"ݯK\¾m•¿ñ£=ë4·‡@>Õu¥ÞÜ8¾"f$ úe(>ª*p*-G=ìáÒ_6»¥¾.þ >"¤‹W!Û¾ø …¦Ç¾¥Hßí> {Ñ9£ï¾ ûö©ÅíN> ³—Ì> VÝ“q…¾!ÂÿÐUI>”ð‚½ö5uîšêä¾·¯@Ê >"IÆÏÁæ¾û‚n‚x½Û2åüæ½>?§žïS¾"ØA ¦>NÀ¨©ì¥>â1úF2ξ $™Ê,Î>!,'nÁ^ï¾ Šw@`@¾¼ì5ì²{>!ƒa×½7¾©N½SÙ=ú~•÷Ú(>-ô[¯Õe¾")à'د1>{Ýpo™k=Êëv®/n‚¾˜~íW9/>" ûC¾¾Ò·DsS¾£.÷LÅÌ>Ý÷>ŸÃݾ!)̔ܫm> $v¸Ù†[>ú¶¸`‡¾!d$LQFd>A~‰,ë½úç>÷á²¾s™nX>"šQÄ^7¾R'ÍùjV½ÏhÒEû¥>ž½ÎwU©¾!õb†‚)C>]ó¨”"8>e°Õ2#¼¾øãEÜ}> þÞa†:¾ Ø…Í›;“¾\ø©*>!kÑ?‡0W¾r´§°=÷4ÿ—=>°-8Æg¾"=w¬ê>lCqR¸Í=áq"½ù¾B”ïa"¦>!Å6Á¢ú¾"‚Bà~¾ ³±„ ø> =:3ï<¾ ¢'·Óì,>¸ϱsC>sùæÍ0f¾!W5Uòc>Ns9È­½ï|=@¬†Š¾o¤’Ô”>!ú¿x´0¾Ñ!®jÿ½ðÿ¿¤>uÎÞ.‰¾!y{J^ì”> íκ‰ñ>‡c±vÑ”¾ ¬)sOM&> ±ªò¾¤#u—¾«ëðž5>!ºæ ˜ƾw3lÍ=ÐÝŽvt‡¤> :FÃ\¾!Ô!§û y>T0Ú'Qü=ý<ë>ûS¾3 lŽ> ñ´CW†¾ ÷À»Ða€¾ž£yüû9>!&A¥ß¾7?Âé(x=÷>¹T•5>~8=œ„ ¾!Ó-¯-¦>Íaqzô=åô%¾¢H¾nÇ×/Ï>!zÀ3Q ¾éóÜ`®¾eÂ: ©> _žGþg¾ ZI<<>ØAU^ø> Yd’¾!‘h6®÷ü>3 ï`½Ôž°Î«È¾Çø×ߥ>!´H¡¢Íã¾Õø~ø½ýÝzEV»>÷¸kmÀ…¾ Á)¡^S+> Àlüe¹Ç>˜yBÓn¾!!žZas%>„ˆ©ÐÔQ½ó"!»xû¾.˜!·µ>!¶áñ𾾦F–´Y½ð¼ ‡f> ó·ðòо!*·%›¬G><¯½¼Œ> ¿àÄë]Ͼ ž5=Õ½> á3¶½þæK‚±b¾Ï$Mz×Ó>!—ýËŬ°¾¢¦xºè½ÕŸ0˜¸:>hnÆ= v¾!fÄd4`>€äÃdP->ÆÚ£Xl¾ t½yt> H‡n9¾(®ëÐu¾Áâø5‘µ>!e3 J%¾Òø¶G}=Ís …1Í>݇”‰hß¾!~„Oœà÷>9»zª¥>¬}£èõl¾1„eÒǦ> ]±‘fõ¾Ђ#¹â7¾ 0ñó>!*åÐ4¤6¾#ÙBŽ6=嘚…=÷ >” e×¾!ƒ‹’5Íî>~¸WåºS=û½nÓð¥¾]Ëꪴ’> •…—ÌÕ¾ zx ìb¾…áÛ Ûš> øÇÏ…ß¾Ö·0ï=ï—²fX&¹>¤-ùzWå¾!9Ðr™B>PJŽT»l=ö¾áTFR¾Äm‚>/e> ±Þ¼¾ OAúó¾ Ú–fÀ†> Ч•Æ¾1õ;ÑŽ¦=ò¶?Íe%‘> ¤æ–¾!r‘)ä>·‘m“=ôe&r²Ô¾cÀg]f> µäpÂÉø¾ ×n õôõ¾ «•@¥±> ¶ã‰iý¾H°ÄsÄ“=óÀ$Þ>Î¥¹SO¾!f©Óÿ>p>äe"=ó÷5Ž^»`¾JáFªˆ > ¬ é @õ¾ ±õÜ“â¾ !;chÑ> ²ÙþPßÅ[=òÆ?Úc™d>øˆÅäå¾!\’:†š>lßÃé¡=õ™Ž÷!ò®¾y1© h¶> Ž8yü$‰¾ ˜IðÒ$y¾&ÔŸ|A> ½.¤ØžG¾§'A}Ç=ïšnm…µË>{9YL:¶¾!M·~>±–üÉæL=ùIPÉ3¾ß¼!Œ{> Z!SÇj…¾ žEŒÍ¾÷·YZÏ‚> Ój°ª½²¾è¾ØXd=柫л¯>P5+xè¾!9*Õ"µå>—µÑ½=þe°Œoò¾}³j6„‡> d9¶¾¾°pÈ ¾O>ÆÀÕ> ô…Ñkò¸¾ÙõH=ÐèSå|F1>wu¥ÍI¾!þG˜[%> /jÈ>ÍQjŸJE¾F¢¹4³>Hý[5q!¾Úþ(Õ™r¾0i(=~>!qÀ|QH¾c6$Aiz½Ò»÷åÄ>×í²¯ü¾ àÚ^²Q-> 2Ð\à>6uy¸¨œ¾ Ì.Õð>òçœs½üò(“¿¾þ…Taná>!" ‚q6¾€Ë6õ©½íôŽ.¨E>[ ÿë#¾ ‡Š §á> @”uÕ> VÚÒ^ÀF¾ w9öHdl>Œ±j½Ô?½ðjô„)ÛG¾8É w=>!(䪾"¬¬+üJ½û;‚Âsi>óÕ’±¾¾ äIÉi> PNs%]>S-C웾 Ð_ºz/Ú>|°&¿¦¤½ÅׂCÆy¾˜$Ó×±l> è++jA¾.î̤>:¾‰RíÌŽ>v;~qz¾q¡ÙJ=ÿ½Ûî,´­>*Fš3§B¾!Ó U¬‹>ÔwgX"º=é}'–!îø¾ðü<ôB> w¸(·=¾ Heî@¾ > Z > ]˜ôõÊu¾Khà„‰(=î¨|®\_>V*Ž#D¾ ü¡BðG­>ŠÍ–ÒŽ=ý·&7ü¾%ႳÐ>yAQ£ci¾øHÎ Œ‰¾ïáû,B> Ð1Ž½E¾s&±[Äì½ÉJä€&>vRÇ™RѾ ªÞpƒÆ®>†q…½ã> k£¼¾ âÿWz›>>`XÖ;Ľöº:›¿Ð(¾é±U´¦ß> ôZ± s¾Æv·w‚ê½÷g9ë_5ž>LÄÅwc9¾ád¥C>ƒõpü>»µN¥‘¾ ¥*Ëê£>*½÷’A½µDÎy”:j¾®žÖ.B€> ¯£Œ’ɪ¾AÌÅká¾UPs¤À>œÒ§žE¾|î«"=ù;‡ÿpû¨>_ ,EåT¾ ã„R˜[> j~‹a0=õÅž½¶€ ¾Õõëת>Ûa̳k¾È«¸À¾”@< 1> –Ì-ÜÃM¾ô[›ôÞ=®fÅls_>¶Ùôft¾ žS.E%i>ðª’`³>ü<Š W¾­¸›«>$Rk]Ìù½öÓ11,¾ÐØB|z5> Ö8ÂxÒ¾\ZP¸îy½ù òÄö>g-£:óϾffžOç¦>® Z²¿>ß=ÅCÁ¾  wç”cu>@Ö·£E=Ñeí™Sw¾>ÂaÏ> iÿ¾¤]i¾ãQÃN¾ Û²D> t*÷¾!¥EÔï=ï_ Ei(>–Ëõúï¾ ½¶¶·4>¸¥þ¾’ñ>ö0sF¾EùS¼ž+>s£P1‰¾R6t_·c¾`»\Of> ¶µ†/J¾Ug~ ½ìÙ8šÀy>ï(­m{n¾ wêZÎÇ> Q,s>ÙéºÊy¾ \‚îŒ~/>Y)~ Ï½ÍV«5 &¾+Æ.é > „7—Ü÷c¾û†éO¾·?ù>v¬m ¨¾źž|xº=ôò#¿y ð>•ý#¾ ±ï>™§>|'S¡õ3=ý%X´¾¾Ћ€R>¡Öy=_¾—9—ú྾È~Ëxã`> ›ÖS)¾‡aÎÔ[+½éû;!r>¨†ŠŽX§¾÷_[žý> ‡¡RS>ºðmõ4ľ K¨XsL><ù²z£½Ä"€@b¾M£rÖ¤j> g×`áT¾m”dÉø¾Õå±6H>“p¬£‰¾9I–ºaŠ=ñ4DÀgÕ >ÀbPÓľ šÉr G>qpö³…>&A´z¾<¾S8m>åÖ„<%½þðiœŽi«¾ØñbŸÎ> š•¦æö¬¾}‚F¡½ô¬lÝnL>¢×\£Ö¿¾*¶ƒÞ€>Ò]oÛÆ>PÆœ" ‘¾ oJÓˆ{ž>_g4ñ.=ßD5þ1“Z¾Ø.dP~ú> ¨|ºˆ¾ ¤gŽ‰I¾ Õb > !”4Ц¾S ±¢ ~=Ñ‘a„ëé÷>í~}1‚d¾ Uýx¨ž\>si‹„­>«Ö á½¾oÂM v>ôä+·À½ï¦Qzàì’¾ò‹¾ÕGF> ~Õª|u¾Ë¥ï¥tU¾kó€ï >q¶ÝÙÀ¾IÛn?¡=úbÂ\š>ñI÷Y­å¾ ˆÎ)g>ÛAÂ$bý=úÏóÝ0z-¾RYLÊË>W^Ì)×¾RbÖ¾ò[õ¦p> xGãb̾§K‚y-›½ñQCM;>:v›5¾'Ã)#¸>oÀU½‡¶>üçÂö«½¾ SOqZ¾°>5©”™Mï=àÍÉ-¤‡D¾Ú~‹â×È>Ä-&\¾ lŠD­T¾3êx*ü> ‘aXÕa¾+{mˆ.½‚Ò[±÷>—¨ŠÎÿϾ =6ô> ýn¸…°> ¢šÊªh¾ľ«áBm>±'Gg›!½ÝŽ] B50„n¾‘yp•ª9¾SfÆFš¨>=¬¶ŽÃ€¾¥Ùkó=ìPFETç >0ø-Ïľ Y¦Aü(>ïEiÑÊ>J0£i’í¾¯Sc„ˆ>lVúIŸ½ô.kBII¾¦üjŒ©> cÖ«¾[TÔ¾ˆ´*z=">v•<ùÿ¾ ÐWýÞ6=ù~€¶Ü¶Ã> ÔXü¹¹¾ dÓþQñ>Úáú[=þ ܣϾu@*5>«R÷ß½þ!³R¢~¾bg•ú> _û Ê?c¾øD5¶‡š½ùÍRjì›> [íYľøô¥²…B> ­b³2>IùDÛ7Ö¾ X¤þä´>¬31€5=ö#É")êß¾›!`o¢>J³ÉÏÒ¾©²HÇ&[¾› ÷3’²> O¢\†Â4¾;bœyõµ½ó-К0>:b'äÐݾ†¡£ ’É>퀌­åÚ>g‰D-Õ¾ EÕnV>¤þ(Œl.=ðå¿ÛebÕ¾ëíîƒ>­~ëÀO7¾Û4 áã¾£ ¦ŽÏ> ;u„<“¹¾íØ:I½î‰.òª¶÷>¯·åÒ•X¾ÃAóÀè>xV¶">Y¹0ÆŸ]¾ 2_¿ý‰>â§ÃŒÐ=ì†ÛÁ˜•¾ˆóç“­>Ë –vE¾ȲQ1€Á¾3" (­> +ÿ,hKn¾$ß*õ?i½ëÑÌb¯>y½°¾dž²Èû>ʼIîN>1²ƒžNÀ¾ ){Œ^Þ>Í6th¯=ìvj—ÙL¾„7Æ-¨>· '÷|ü¾zÃeæ´x¾WèÓOÇ> )Ø㢾çáÔÀû½î‚lÂíÕ>¥òT<”›¾—t—{}U>Õ étm> Êö®µ¾ +ÀZËr*>˜¡–ÊÅÈ=ðñ¬3ËŒk¾Ü¿ÊÛ>eÛ¬EÏ’¾Ý˜£I ¾ Ax¿³> -‡“-,L¾)1ŠJ;y½óDš%xK>#:ƒÙÉt¾"N,;ê>•ŸÐ°§3>–5Ìi¾ / ÈÖz>™½ƒÁ)=ö/us#w¡¾{=ܨ>̈®€)¾5Ó¥o{¾>×?:g> /ö7¹Ë¾ê´ûñk‡½ù¶þ€¸”>âžÇ'¾c¤Š1­…=þ6/Kƒ³=>±¦[sV¾ /RQì%U>6*8=ýÞË[ §¾X`YçÉ>âˆY±Œ½ù½Ç„‰¾éù´µK3> *[G-©¾%ªÒÖì¾S`ó>µ¯>ÖO|¾Cã©îD=ôFUÆô>æUzP@¾ ×^ÅÉ>ø‚¸Ã/>Çßyz¾V2¯†BC>Á¾Ð¦½íf ìMt¾õ­ïÖ«> Gƒ.ÀB¾¦¶±Ç¬§¾ïéfüÆ!>Л(ñÆ»¾™¶F3G=à_ftpÈ>¾,¿åQ¾Ôx²¥„>P¾ÔÉ÷{> és±8,¾A_+CH!>‰"Å•½°ûëgâF¾4@õXú>\{¤P8H¾ úÌÔ°­¾ o~«o, >£Bm¾ME¯ò ½ÚºõÚã,>[¦:buÖ¾Ò”D åtK>{#ô7‡õ¾ñfÙÍè>à;æÁ=î?¬túʾ™£å– >pÞÞN¾)"I/Ê ¾Q©+#šÊ> £QÛ]3¾;^ÜùaG½÷ý«{Ÿ¯}>œM¿Âû¾4YÄ>‚*=ýG¹ÄÀ>29p]\¾ OH >Yá#föD>¸qRP¾ OiïÒ˜>¸ŠÓº½óuQÇo‰¾:cöo>ü¦kÍ{Y¾:ÞVQ$¾¡úúv¿Ñ>‚†´r¾¨"Á÷I=áÕé¡óÐv>é\Öód¾–&sÙ> ºÏéÐ> ªízèž¾9ýZÁÜ,>ü@#Šã= ’È¡¨I¾¬ˆæú%>íxàäéw¾‡ ^h°¾ÄâVÇþÈ>½#³j1 ¾ €îÄû½ì*G\>R-ÄOw¾û˜ì!ž>×óΚ>or­H ¾ ûwÓxµ>Å -~´t=úA`ñ»u ¾Ïg»‚‡R>¶F*za½ù_ði3±¾òB6htF>úµë+£¾1 ó}Zí¾pRc8~B>v.²õ‹¾ ¨U”=èTÅM½L>[DÁkì¾™ÌHmŠ>»~â~´> ÔÞRº-þ꾡k3> 0¬ ÷=¼°L©SǾ˜¢mpMo>Ññ§5c6¾`‹ÙȾ€µ´’ó>³×&€H¾Ÿ5vÜ擽ðPa+À‹T>˜Z·>¾šîÑ;óá>…ýùŸ:>-Et]ÄG¾ïý9ºó§>ÊÞ›=ÿ)â"榾J ‚ø1>í½»ŠW#½óh öŽ¾!›4"ü>¸ƒ Üs¾rñª¾þp½¢>œ¦ïÜn¾ÆåÃû=ÉN'Qrý>Θœqݾ ýñ> ê"^}Q>sù=ZÁ—¾B@ŠÈ>57VV=êÖ[¥2Ž\¾3†#š­æ>¾î䮾üêdâð¾Í°ˆw( >Ý~O‰†ó¾ô‰0è[,½þc‡N[>0ã§DÀ¾䳂­ƒÔ=òÞ_ßf>(qèÖ¾¤Ø܆¿:>K€D$Ëü>®û@ø"¾­ÉcÏPÄ>lü¦Æ¬½©¶ä<ªG¾,ôi=¤=>Ä7»^¾\(‚·^-¾ôŽášÇ>‘g÷œS¾Vi†½ñØs,hE>¾J!Þ6e¾2"DtøŒ=þ±ë=yö¶>áê¿ð¾ȱStq>¨›ôº~>P øøF|¾Á’yÝÛ…>é%{:Lj½æçé`6ƒ)¾p3ÆQL>Bªw¾¯o¾ à*–xm¾ ‰¾ï`,>¸8¹H,¾é]-ý”0½á@¯¶…>„õ‹ž`ê¾òþè§çÛ>wÍ\Æ">*تì̾·á3ÞÔ>5ɦ7~=ýÐFâV¾ÿç?-9>ÎÏ3îÛî½ò†{6Kúþ5H@Àþ>zÛ¸ÇKz¾²ÉÊB¾¦dþÔ€>½¼0|#¾Ò–½Ç'á½È¢ÜìÌ>¹ækÓ’¾SyL¬ˆ>Ë¡ Ôa9>)SLyþž?‹ à.>]­Ã?=ù$nÉ’¡¾Ž5õ¢%>4}¤@+8½õíjáÀ¶‚¾–¬Ä¦å+>…¥ $¨¾oƒ89ã7¾d«eËö >‰,¾Ù¾˜RG§½¯JÛ‡®>i„¶(ªÿ¾b”«ú >jÁuLCð>ß‹Ïísc¾‰ue†X>ÀêN²€=ø]kn+¦¾tEË4Ù>,–ž÷¿?½õæòf–¢¾”]±ò}Å>s˜¼zƾGþÖÕ«¾µãÚž%š>‹{¦¯%¾æ&^çnܽÂÔðw?¨d>š³» Ïù¾5|¹vd>st´=<>OIî“©¾‰»E¯ä€>š^^ÕvÕ=ûÃÿßÙ¡¾½ã*Ìž*>Ä%V“—ª½ò|„ ö¥ ¾6ñRËê>Múg*,Õ¾ÅFîaΣ¾ ¨ŽÑþ¡>É©Äžrm¾"›?þ†½Ý š'äo>Oö¶‘ ¾Ã*:°£¾>Í›Û[>{îI¾‘ðvg%>cÞô·m>¡®æ£@¾[{6²©>áÿð{®½ç!ý!7^¾o,NŒî>õ¼l™Š0¾ X¶‹3½¾ %Þ׸ð+>!1VŠÒ¾¸†2«ý`½ïJòç_—M>f}Çe¯=¾æñ¢ZѶ=üÕç#´¼Û>Dx<¾wý•¿úf>f¿á¦G¾>FKœ°ãu¾ þg´>i„½±Í(›“¾â¥ñ+ >E~ìùܾAÌ1™>¾öfF–tõ>hIxa£¾–J“ç<нû0ʺÌE>µŽÐJ±u¾ƒ@WÒ*=ð©á({íâ>ˆŒ¬uíþ¾Ï“*Ù> 0å®#ü¾> MÀ-iг¾æ:Å/Ö>=a®·Áv=é9E £Ú¾‹lEœ>ˆ2ÍÑнþÇبóœÖ¾å*ùo>mò ß=ö¾™.òˆl¾á]XÏ)‹> :XúŽ¾c×CÕ¿=¬°`»ºè>àEcªÔ¾*âÇn˜>ªf*`¨¡>Ao–˜ o¾d‘YU”{>$Ã$?ût=ý”6@Z{B¾ó9‘8dÿ>½%Y½êd;Ð_âï¾&‡€ŠA:>Û¨Éb¾ )+m‚¾ aÆñ“»k> Tù‹„¾DQØ˸ª½òB—\íM>±S}¾ˆ†¾_Ϲtg=ø7³Ñ ›>+vØXl.¾9ƒ6Χ>çÞA3^(>ƒfOÜá÷¾„ñvŒ(>Y1R!=ß°ž¼"ŠM¾]n=C9t>VáH†g¾úcýžã¾Aa#ÐÝ>Zœqâ8Ͼú%¬W¨¾ÈN"ýa>ÛsP呾n©ÁïÃÃ=´â‘‰µu¼> ø𪱜¾ ¨sá©>1ÃÄ]S>xÏÅw…¾QT²Ø‹ª>«Ë_u—ÿ=ÿöªÍ Óµ¾%{ÿŽ¥~>rïó;½â²CB¾ʤÆwÊ>‡|–ê1b¾Ã͆nÖ¾¸¹“‚1Ð>+<µ±G%¾ŠÌoÊO½øïdŽ¢>o–Œ0‚¾o¤+Á=ð(1®¡[>¦‚º¨ça¾Ø¢f>µ=> ³kËh4> évéB½P¾óÛ@Ôµ>'â¼þ~=òú’ j‹¾Ä ,  o>À½„í~½õÄ©°Býþ¦o I(>­ãOFL¾ ã7:ˆ¾ ‹´!u³Ò”¾Ýüâ¤Ý½ì9°mÉÜØ>*’a‰§í¾ŽR¼¦¹”=ú8¬Éï >ϬÊ”Z¾Ï–>Ûž¤ þ>£4Øo’¾w<ܽ¶>¡wŽ|Uk=䥾F࿾¬£ÍcàØ>áÇtîÀ½ý’¿¨Ê«'¾)y©Fµ>*Zœ¶ò¾•šÓ}É…¾:L¿}¡>E ¬´Ú¾ÎÜ8G½Þš“ã >Q=bæê^Æ”=ÿÐáßÔ2>IJoi9 ¾!ÍK\bö>­õ­Š> ?ÁÀd&U¾!+še3> ŽR(W¾}bGîyê¾M\Ÿlà>"ݯK\¾m•¿ñ£=ë4·‡@>Õu¥ÞÜ8¾"f$ úe(>ª*p*-G=ìáÒ_6»¥¾.þ >"¤‹W!Û¾ø …¦Ç¾¥Hßí> {Ñ9£ï¾ ûö©ÅíN> ³—Ì> VÝ“q…¾!ÂÿÐUI>”ð‚½ö5uîšêä¾·¯@Ê >"IÆÏÁæ¾û‚n‚x½Û2åüæ½>?§žïS¾"ØA ¦>NÀ¨©ì¥>â1úF2ξ $™Ê,Î>!,'nÁ^ï¾ Šw@`@¾¼ì5ì²{>!ƒa×½7¾©N½SÙ=ú~•÷Ú(>-ô[¯Õe¾")à'د1>{Ýpo™k=Êëv®/n‚¾˜~íW9/>" ûC¾¾Ò·DsS¾£.÷LÅÌ>Ý÷>ŸÃݾ!)̔ܫm> $v¸Ù†[>ú¶¸`‡¾!d$LQFd>A~‰,ë½úç>÷á²¾s™nX>"šQÄ^7¾R'ÍùjV½ÏhÒEû¥>ž½ÎwU©¾!õb†‚)C>]ó¨”"8>e°Õ2#¼¾øãEÜ}> þÞa†:¾ Ø…Í›;“¾\ø©*>!kÑ?‡0W¾r´§°=÷4ÿ—=>°-8Æg¾"=w¬ê>lCqR¸Í=áq"½ù¾B”ïa"¦>!Å6Á¢ú¾"‚Bà~¾ ³±„ ø> =:3ï<¾ ¢'·Óì,>¸ϱsC>sùæÍ0f¾!W5Uòc>Ns9È­½ï|=@¬†Š¾o¤’Ô”>!ú¿x´0¾Ñ!®jÿ½ðÿ¿¤>uÎÞ.‰¾!y{J^ì”> íκ‰ñ>‡c±vÑ”¾ ¬)sOM&> ±ªò¾¤#u—¾«ëðž5>!ºæ ˜ƾw3lÍ=ÐÝŽvt‡¤> :FÃ\¾!Ô!§û y>T0Ú'Qü=ý<ë>ûS¾3 lŽ> ñ´CW†¾ ÷À»Ða€¾ž£yüû9>!&A¥ß¾7?Âé(x=÷>¹T•5>~8=œ„ ¾!Ó-¯-¦>Íaqzô=åô%¾¢H¾nÇ×/Ï>!zÀ3Q ¾éóÜ`®¾eÂ: ©> _žGþg¾ ZI<<>ØAU^ø> Yd’¾!‘h6®÷ü>3 ï`½Ôž°Î«È¾Çø×ߥ>!´H¡¢Íã¾Õø~ø½ýÝzEV»>÷¸kmÀ…¾ Á)¡^S+> Àlüe¹Ç>˜yBÓn¾!!žZas%>„ˆ©ÐÔQ½ó"!»xû¾.˜!·µ>!¶áñ𾾦F–´Y½ð¼ ‡f> ó·ðòо!*·%›¬G><¯½¼Œ> ¿àÄë]Ͼ ž5=Õ½> á3¶½þæK‚±b¾Ï$Mz×Ó>!—ýËŬ°¾¢¦xºè½ÕŸ0˜¸:>hnÆ= v¾!fÄd4`>€äÃdP->ÆÚ£Xl¾ t½yt> H‡n9¾(®ëÐu¾Áâø5‘µ>!e3 J%¾Òø¶G}=Ís …1Í>݇”‰hß¾!~„Oœà÷>9»zª¥>¬}£èõl¾1„eÒǦ> ]±‘fõ¾Ђ#¹â7¾ 0ñó>!*åÐ4¤6¾#ÙBŽ6=嘚…=÷ >” e×¾!ƒ‹’5Íî>~¸WåºS=û½nÓð¥¾]Ëꪴ’> •…—ÌÕ¾ zx ìb¾…áÛ Ûš> øÇÏ…ß¾Ö·0ï=ï—²fX&¹>¤-ùzWå¾!9Ðr™B>PJŽT»l=ö¾áTFR¾Äm‚>/e> ±Þ¼¾ OAúó¾ Ú–fÀ†> Ч•Æ¾1õ;ÑŽ¦=ò¶?Íe%‘> ¤æ–¾!r‘)ä>·‘m“=ôe&r²Ô¾cÀg]f> µäpÂÉø¾ ×n õôõ¾ «•@¥±> ¶ã‰iý¾H°ÄsÄ“=óÀ$Þ>Î¥¹SO¾!f©Óÿ>p>äe"=ó÷5Ž^»`¾JáFªˆ > ¬ é @õ¾ ±õÜ“â¾ !;chÑ> ²ÙþPßÅ[=òÆ?Úc™d>øˆÅäå¾!\’:†š>lßÃé¡=õ™Ž÷!ò®¾y1© h¶> Ž8yü$‰¾ ˜IðÒ$y¾&ÔŸ|A> ½.¤ØžG¾§'A}Ç=ïšnm…µË>{9YL:¶¾!M·~>±–üÉæL=ùIPÉ3¾ß¼!Œ{> Z!SÇj…¾ žEŒÍ¾÷·YZÏ‚> Ój°ª½²¾è¾ØXd=柫л¯>P5+xè¾!9*Õ"µå>—µÑ½=þe°Œoò¾}³j6„‡> d9¶¾¾°pÈ ¾O>ÆÀÕ> ô…Ñkò¸¾ÙõH=ÐèSå|F1>wu¥ÍI¾!þG˜[%> /jÈ>ÍQjŸJE¾F¢¹4³>Hý[5q!¾Úþ(Õ™r¾0i(=~>!qÀ|QH¾c6$Aiz½Ò»÷åÄ>×í²¯ü¾ àÚ^²Q-> 2Ð\à>6uy¸¨œ¾ Ì.Õð>òçœs½üò(“¿¾þ…Taná>!" ‚q6¾€Ë6õ©½íôŽ.¨E>[ ÿë#¾ ‡Š §á> @”uÕ> VÚÒ^ÀF¾ w9öHdl>Œ±j½Ô?½ðjô„)ÛG¾8É w=>!(䪾"¬¬+üJ½û;‚Âsi>óÕ’±¾¾ äIÉi> PNs%]>S-C웾 Ð_ºz/Ú>|°&¿¦¤½ÅׂCÆy¾˜$Ó×±l> è++jA¾.î̤>:¾‰RíÌŽ>v;~qz¾q¡ÙJ=ÿ½Ûî,´­>*Fš3§B¾!Ó U¬‹>ÔwgX"º=é}'–!îø¾ðü<ôB> w¸(·=¾ Heî@¾ > Z > ]˜ôõÊu¾Khà„‰(=î¨|®\_>V*Ž#D¾ ü¡BðG­>ŠÍ–ÒŽ=ý·&7ü¾%ႳÐ>yAQ£ci¾øHÎ Œ‰¾ïáû,B> Ð1Ž½E¾s&±[Äì½ÉJä€&>vRÇ™RѾ ªÞpƒÆ®>†q…½ã> k£¼¾ âÿWz›>>`XÖ;Ľöº:›¿Ð(¾é±U´¦ß> ôZ± s¾Æv·w‚ê½÷g9ë_5ž>LÄÅwc9¾ád¥C>ƒõpü>»µN¥‘¾ ¥*Ëê£>*½÷’A½µDÎy”:j¾®žÖ.B€> ¯£Œ’ɪ¾AÌÅká¾UPs¤À>œÒ§žE¾|î«"=ù;‡ÿpû¨>_ ,EåT¾ ã„R˜[> j~‹a0=õÅž½¶€ ¾Õõëת>Ûa̳k¾È«¸À¾”@< 1> –Ì-ÜÃM¾ô[›ôÞ=®fÅls_>¶Ùôft¾ žS.E%i>ðª’`³>ü<Š W¾­¸›«>$Rk]Ìù½öÓ11,¾ÐØB|z5> Ö8ÂxÒ¾\ZP¸îy½ù òÄö>g-£:óϾffžOç¦>® Z²¿>ß=ÅCÁ¾  wç”cu>@Ö·£E=Ñeí™Sw¾>ÂaÏ> iÿ¾¤]i¾ãQÃN¾ Û²D> t*÷¾!¥EÔï=ï_ Ei(>–Ëõúï¾ ½¶¶·4>¸¥þ¾’ñ>ö0sF¾EùS¼ž+>s£P1‰¾R6t_·c¾`»\Of> ¶µ†/J¾Ug~ ½ìÙ8šÀy>ï(­m{n¾ wêZÎÇ> Q,s>ÙéºÊy¾ \‚îŒ~/>Y)~ Ï½ÍV«5 &¾+Æ.é > „7—Ü÷c¾û†éO¾·?ù>v¬m ¨¾źž|xº=ôò#¿y ð>•ý#¾ ±ï>™§>|'S¡õ3=ý%X´¾¾Ћ€R>¡Öy=_¾—9—ú྾È~Ëxã`> ›ÖS)¾‡aÎÔ[+½éû;!r>¨†ŠŽX§¾÷_[žý> ‡¡RS>ºðmõ4ľ K¨XsL><ù²z£½Ä"€@b¾M£rÖ¤j> g×`áT¾m”dÉø¾Õå±6H>“p¬£‰¾9I–ºaŠ=ñ4DÀgÕ >ÀbPÓľ šÉr G>qpö³…>&A´z¾<¾S8m>åÖ„<%½þðiœŽi«¾ØñbŸÎ> š•¦æö¬¾}‚F¡½ô¬lÝnL>¢×\£Ö¿¾*¶ƒÞ€>Ò]oÛÆ>PÆœ" ‘¾ oJÓˆ{ž>_g4ñ.=ßD5þ1“Z¾Ø.dP~ú> ¨|ºˆ¾ ¤gŽ‰I¾ Õb > !”4Ц¾S ±¢ ~=Ñ‘a„ëé÷>í~}1‚d¾ Uýx¨ž\>si‹„­>«Ö á½¾oÂM v>ôä+·À½ï¦Qzàì’¾ò‹¾ÕGF> ~Õª|u¾Ë¥ï¥tU¾kó€ï >q¶ÝÙÀ¾IÛn?¡=úbÂ\š>ñI÷Y­å¾ ˆÎ)g>ÛAÂ$bý=úÏóÝ0z-¾RYLÊË>W^Ì)×¾RbÖ¾ò[õ¦p> xGãb̾§K‚y-›½ñQCM;>:v›5¾'Ã)#¸>oÀU½‡¶>üçÂö«½¾ SOqZ¾°>5©”™Mï=àÍÉ-¤‡D¾Ú~‹â×È>Ä-&\¾ lŠD­T¾3êx*ü> ‘aXÕa¾+{mˆ.½‚Ò[±÷>—¨ŠÎÿϾ =6ô> ýn¸…°> ¢šÊªh¾ľ«áBm>±'Gg›!½ÝŽ] B50„n¾‘yp•ª9¾SfÆFš¨>=¬¶ŽÃ€¾¥Ùkó=ìPFETç >0ø-Ïľ Y¦Aü(>ïEiÑÊ>J0£i’í¾¯Sc„ˆ>lVúIŸ½ô.kBII¾¦üjŒ©> cÖ«¾[TÔ¾ˆ´*z=">v•<ùÿ¾ ÐWýÞ6=ù~€¶Ü¶Ã> ÔXü¹¹¾ dÓþQñ>Úáú[=þ ܣϾu@*5>«R÷ß½þ!³R¢~¾bg•ú> _û Ê?c¾øD5¶‡š½ùÍRjì›> [íYľøô¥²…B> ­b³2>IùDÛ7Ö¾ X¤þä´>¬31€5=ö#É")êß¾›!`o¢>J³ÉÏÒ¾©²HÇ&[¾› ÷3’²> O¢\†Â4¾;bœyõµ½ó-К0>:b'äÐݾ†¡£ ’É>퀌­åÚ>g‰D-Õ¾ EÕnV>¤þ(Œl.=ðå¿ÛebÕ¾ëíîƒ>­~ëÀO7¾Û4 áã¾£ ¦ŽÏ> ;u„<“¹¾íØ:I½î‰.òª¶÷>¯·åÒ•X¾ÃAóÀè>xV¶">Y¹0ÆŸ]¾ 2_¿ý‰>â§ÃŒÐ=ì†ÛÁ˜•¾ˆóç“­>Ë –vE¾ȲQ1€Á¾3" (­> +ÿ,hKn¾$ß*õ?i½ëÑÌb¯>y½°¾dž²Èû>ʼIîN>1²ƒžNÀ¾ ){Œ^Þ>Í6th¯=ìvj—ÙL¾„7Æ-¨>· '÷|ü¾zÃeæ´x¾WèÓOÇ> )Ø㢾çáÔÀû½î‚lÂíÕ>¥òT<”›¾—t—{}U>Õ étm> Êö®µ¾ +ÀZËr*>˜¡–ÊÅÈ=ðñ¬3ËŒk¾Ü¿ÊÛ>eÛ¬EÏ’¾Ý˜£I ¾ Ax¿³> -‡“-,L¾)1ŠJ;y½óDš%xK>#:ƒÙÉt¾"N,;ê>•ŸÐ°§3>–5Ìi¾ / ÈÖz>™½ƒÁ)=ö/us#w¡¾{=ܨ>̈®€)¾5Ó¥o{¾>×?:g> /ö7¹Ë¾ê´ûñk‡½ù¶þ€¸”>âžÇ'¾c¤Š1­…=þ6/Kƒ³=>±¦[sV¾ /RQì%U>6*8=ýÞË[ §¾X`YçÉ>âˆY±Œ½ù½Ç„‰¾éù´µK3> *[G-©¾%ªÒÖì¾S`ó>µ¯>ÖO|¾Cã©îD=ôFUÆô>æUzP@¾ ×^ÅÉ>ø‚¸Ã/>Çßyz¾V2¯†BC>Á¾Ð¦½íf ìMt¾õ­ïÖ«> Gƒ.ÀB¾¦¶±Ç¬§¾ïéfüÆ!>Л(ñÆ»¾™¶F3G=à_ftpÈ>¾,¿åQ¾Ôx²¥„>P¾ÔÉ÷{> és±8,¾A_+CH!>‰"Å•½°ûëgâF¾4@õXú>\{¤P8H¾ úÌÔ°­¾ o~«o, >£Bm¾ME¯ò ½ÚºõÚã,>[¦:buÖ¾Ò”D åtK>{#ô7‡õ¾ñfÙÍè>à;æÁ=î?¬túʾ™£å– >pÞÞN¾)"I/Ê ¾Q©+#šÊ> £QÛ]3¾;^ÜùaG½÷ý«{Ÿ¯}>œM¿Âû¾4YÄ>‚*=ýG¹ÄÀ>29p]\¾ OH >Yá#föD>¸qRP¾ OiïÒ˜>¸ŠÓº½óuQÇo‰¾:cöo>ü¦kÍ{Y¾:ÞVQ$¾¡úúv¿Ñ>‚†´r¾¨"Á÷I=áÕé¡óÐv>é\Öód¾–&sÙ> ºÏéÐ> ªízèž¾9ýZÁÜ,>ü@#Šã= ’È¡¨I¾¬ˆæú%>íxàäéw¾‡ ^h°¾ÄâVÇþÈ>½#³j1 ¾ €îÄû½ì*G\>R-ÄOw¾û˜ì!ž>×óΚ>or­H ¾ ûwÓxµ>Å -~´t=úA`ñ»u ¾Ïg»‚‡R>¶F*za½ù_ði3±¾òB6htF>úµë+£¾1 ó}Zí¾pRc8~B>v.²õ‹¾ ¨U”=èTÅM½L>[DÁkì¾™ÌHmŠ>»~â~´> ÔÞRº-þ꾡k3> 0¬ ÷=¼°L©SǾ˜¢mpMo>Ññ§5c6¾`‹ÙȾ€µ´’ó>³×&€H¾Ÿ5vÜ擽ðPa+À‹T>˜Z·>¾šîÑ;óá>…ýùŸ:>-Et]ÄG¾ïý9ºó§>ÊÞ›=ÿ)â"榾J ‚ø1>í½»ŠW#½óh öŽ¾!›4"ü>¸ƒ Üs¾rñª¾þp½¢>œ¦ïÜn¾ÆåÃû=ÉN'Qrý>Θœqݾ ýñ> ê"^}Q>sù=ZÁ—¾B@ŠÈ>57VV=êÖ[¥2Ž\¾3†#š­æ>¾î䮾üêdâð¾Í°ˆw( >Ý~O‰†ó¾ô‰0è[,½þc‡N[>0ã§DÀ¾䳂­ƒÔ=òÞ_ßf>(qèÖ¾¤Ø܆¿:>K€D$Ëü>®û@ø"¾­ÉcÏPÄ>lü¦Æ¬½©¶ä<ªG¾,ôi=¤=>Ä7»^¾\(‚·^-¾ôŽášÇ>‘g÷œS¾Vi†½ñØs,hE>¾J!Þ6e¾2"DtøŒ=þ±ë=yö¶>áê¿ð¾ȱStq>¨›ôº~>P øøF|¾Á’yÝÛ…>é%{:Lj½æçé`6ƒ)¾p3ÆQL>Bªw¾¯o¾ à*–xm¾ ‰¾ï`,>¸8¹H,¾é]-ý”0½á@¯¶…>„õ‹ž`ê¾òþè§çÛ>wÍ\Æ">*تì̾·á3ÞÔ>5ɦ7~=ýÐFâV¾ÿç?-9>ÎÏ3îÛî½ò†{6Kúþ5H@Àþ>zÛ¸ÇKz¾²ÉÊB¾¦dþÔ€>½¼0|#¾Ò–½Ç'á½È¢ÜìÌ>¹ækÓ’¾SyL¬ˆ>Ë¡ Ôa9>)SLyþž?‹ à.>]­Ã?=ù$nÉ’¡¾Ž5õ¢%>4}¤@+8½õíjáÀ¶‚¾–¬Ä¦å+>…¥ $¨¾oƒ89ã7¾d«eËö >‰,¾Ù¾˜RG§½¯JÛ‡®>i„¶(ªÿ¾b”«ú >jÁuLCð>ß‹Ïísc¾‰ue†X>ÀêN²€=ø]kn+¦¾tEË4Ù>,–ž÷¿?½õæòf–¢¾”]±ò}Å>s˜¼zƾGþÖÕ«¾µãÚž%š>‹{¦¯%¾æ&^çnܽÂÔðw?¨d>š³» Ïù¾5|¹vd>st´=<>OIî“©¾‰»E¯ä€>š^^ÕvÕ=ûÃÿßÙ¡¾½ã*Ìž*>Ä%V“—ª½ò|„ ö¥ ¾6ñRËê>Múg*,Õ¾ÅFîaΣ¾ ¨ŽÑþ¡>É©Äžrm¾"›?þ†½Ý š'äo>Oö¶‘ ¾Ã*:°£¾>Í›Û[>{îI¾‘ðvg%>cÞô·m>¡®æ£@¾[{6²©>áÿð{®½ç!ý!7^¾o,NŒî>õ¼l™Š0¾ X¶‹3½¾ %Þ׸ð+>!1VŠÒ¾¸†2«ý`½ïJòç_—M>f}Çe¯=¾æñ¢ZѶ=üÕç#´¼Û>Dx<¾wý•¿úf>f¿á¦G¾>FKœ°ãu¾ þg´>i„½±Í(›“¾â¥ñ+ >E~ìùܾAÌ1™>¾öfF–tõ>hIxa£¾–J“ç<нû0ʺÌE>µŽÐJ±u¾ƒ@WÒ*=ð©á({íâ>ˆŒ¬uíþ¾Ï“*Ù> 0å®#ü¾> MÀ-iг¾æ:Å/Ö>=a®·Áv=é9E £Ú¾‹lEœ>ˆ2ÍÑнþÇبóœÖ¾å*ùo>mò ß=ö¾™.òˆl¾á]XÏ)‹> :XúŽ¾c×CÕ¿=¬°`»ºè>àEcªÔ¾*âÇn˜>ªf*`¨¡>Ao–˜ o¾d‘YU”{>$Ã$?ût=ý”6@Z{B¾ó9‘8dÿ>½%Y½êd;Ð_âï¾&‡€ŠA:>Û¨Éb¾ )+m‚¾ aÆñ“»k> Tù‹„¾DQØ˸ª½òB—\íM>±S}¾ˆ†¾_Ϲtg=ø7³Ñ ›>+vØXl.¾9ƒ6Χ>çÞA3^(>ƒfOÜá÷¾„ñvŒ(>Y1R!=ß°ž¼"ŠM¾]n=C9t>VáH†g¾úcýžã¾Aa#ÐÝ>Zœqâ8Ͼú%¬W¨¾ÈN"ýa>ÛsP呾n©ÁïÃÃ=´â‘‰µu¼> ø𪱜¾ ¨sá©>1ÃÄ]S>xÏÅw…¾QT²Ø‹ª>«Ë_u—ÿ=ÿöªÍ Óµ¾%{ÿŽ¥~>rïó;½â²CB¾ʤÆwÊ>‡|–ê1b¾Ã͆nÖ¾¸¹“‚1Ð>+<µ±G%¾ŠÌoÊO½øïdŽ¢>o–Œ0‚¾o¤+Á=ð(1®¡[>¦‚º¨ça¾Ø¢f>µ=> ³kËh4> évéB½P¾óÛ@Ôµ>'â¼þ~=òú’ j‹¾Ä ,  o>À½„í~½õÄ©°Býþ¦o I(>­ãOFL¾ ã7:ˆ¾ ‹´!u³Ò”¾Ýüâ¤Ý½ì9°mÉÜØ>*’a‰§í¾ŽR¼¦¹”=ú8¬Éï >ϬÊ”Z¾Ï–>Ûž¤ þ>£4Øo’¾w<ܽ¶>¡wŽ|Uk=䥾F࿾¬£ÍcàØ>áÇtîÀ½ý’¿¨Ê«'¾)y©Fµ>*Zœ¶ò¾•šÓ}É…¾:L¿}¡>E ¬´Ú¾ÎÜ8G½Þš“ã >Q=bæê^Æ”=ÿÐáßÔ2>IJoi9 ¾!ÍK\bö>­õ­Š> ?ÁÀd&U¾!+še3> ŽR(W¾}bGîyê¾M\Ÿlà>"ݯK\¾m•¿ñ£=ë4·‡@>Õu¥ÞÜ8¾"f$ úe(>ª*p*-G=ìáÒ_6»¥¾.þ >"¤‹W!Û¾ø …¦Ç¾¥Hßí> {Ñ9£ï¾ ûö©ÅíN> ³—Ì> VÝ“q…¾!ÂÿÐUI>”ð‚½ö5uîšêä¾·¯@Ê >"IÆÏÁæ¾û‚n‚x½Û2åüæ½>?§žïS¾"ØA ¦>NÀ¨©ì¥>â1úF2ξ $™Ê,Î>!,'nÁ^ï¾ Šw@`@¾¼ì5ì²{>!ƒa×½7¾©N½SÙ=ú~•÷Ú(>-ô[¯Õe¾")à'د1>{Ýpo™k=Êëv®/n‚¾˜~íW9/>" ûC¾¾Ò·DsS¾£.÷LÅÌ>Ý÷>ŸÃݾ!)̔ܫm> $v¸Ù†[>ú¶¸`‡¾!d$LQFd>A~‰,ë½úç>÷á²¾s™nX>"šQÄ^7¾R'ÍùjV½ÏhÒEû¥>ž½ÎwU©¾!õb†‚)C>]ó¨”"8>e°Õ2#¼¾øãEÜ}> þÞa†:¾ Ø…Í›;“¾\ø©*>!kÑ?‡0W¾r´§°=÷4ÿ—=>°-8Æg¾"=w¬ê>lCqR¸Í=áq"½ù¾B”ïa"¦>!Å6Á¢ú¾"‚Bà~¾ ³±„ ø> =:3ï<¾ ¢'·Óì,>¸ϱsC>sùæÍ0f¾!W5Uòc>Ns9È­½ï|=@¬†Š¾o¤’Ô”>!ú¿x´0¾Ñ!®jÿ½ðÿ¿¤>uÎÞ.‰¾!y{J^ì”> íκ‰ñ>‡c±vÑ”¾ ¬)sOM&> ±ªò¾¤#u—¾«ëðž5>!ºæ ˜ƾw3lÍ=ÐÝŽvt‡¤> :FÃ\¾!Ô!§û y>T0Ú'Qü=ý<ë>ûS¾3 lŽ> ñ´CW†¾ ÷À»Ða€¾ž£yüû9>!&A¥ß¾7?Âé(x=÷>¹T•5>~8=œ„ ¾!Ó-¯-¦>Íaqzô=åô%¾¢H¾nÇ×/Ï>!zÀ3Q ¾éóÜ`®¾eÂ: ©> _žGþg¾ ZI<<>ØAU^ø> Yd’¾!‘h6®÷ü>3 ï`½Ôž°Î«È¾Çø×ߥ>!´H¡¢Íã¾Õø~ø½ýÝzEV»>÷¸kmÀ…¾ Á)¡^S+> Àlüe¹Ç>˜yBÓn¾!!žZas%>„ˆ©ÐÔQ½ó"!»xû¾.˜!·µ>!¶áñ𾾦F–´Y½ð¼ ‡f> ó·ðòо!*·%›¬G><¯½¼Œ> ¿àÄë]Ͼ ž5=Õ½> á3¶½þæK‚±b¾Ï$Mz×Ó>!—ýËŬ°¾¢¦xºè½ÕŸ0˜¸:>hnÆ= v¾!fÄd4`>€äÃdP->ÆÚ£Xl¾ t½yt> H‡n9¾(®ëÐu¾Áâø5‘µ>!e3 J%¾Òø¶G}=Ís …1Í>݇”‰hß¾!~„Oœà÷>9»zª¥>¬}£èõl¾1„eÒǦ> ]±‘fõ¾Ђ#¹â7¾ 0ñó>!*åÐ4¤6¾#ÙBŽ6=嘚…=÷ >” e×¾!ƒ‹’5Íî>~¸WåºS=û½nÓð¥¾]Ëꪴ’> •…—ÌÕ¾ zx ìb¾…áÛ Ûš> øÇÏ…ß¾Ö·0ï=ï—²fX&¹>¤-ùzWå¾!9Ðr™B>PJŽT»l=ö¾áTFR¾Äm‚>/e> ±Þ¼¾ OAúó¾ Ú–fÀ†> Ч•Æ¾1õ;ÑŽ¦=ò¶?Íe%‘> ¤æ–¾!r‘)ä>·‘m“=ôe&r²Ô¾cÀg]f> µäpÂÉø¾ ×n õôõ¾ «•@¥±> ¶ã‰iý¾H°ÄsÄ“=óÀ$Þ>Î¥¹SO¾!f©Óÿ>p>äe"=ó÷5Ž^»`¾JáFªˆ > ¬ é @õ¾ ±õÜ“â¾ !;chÑ> ²ÙþPßÅ[=òÆ?Úc™d>øˆÅäå¾!\’:†š>lßÃé¡=õ™Ž÷!ò®¾y1© h¶> Ž8yü$‰¾ ˜IðÒ$y¾&ÔŸ|A> ½.¤ØžG¾§'A}Ç=ïšnm…µË>{9YL:¶¾!M·~>±–üÉæL=ùIPÉ3¾ß¼!Œ{> Z!SÇj…¾ žEŒÍ¾÷·YZÏ‚> Ój°ª½²¾è¾ØXd=柫л¯>P5+xè¾!9*Õ"µå>—µÑ½=þe°Œoò¾}³j6„‡> d9¶¾¾°pÈ ¾O>ÆÀÕ> ô…Ñkò¸¾ÙõH=ÐèSå|F1>wu¥ÍI¾!þG˜[%> /jÈ>ÍQjŸJE¾F¢¹4³>Hý[5q!¾Úþ(Õ™r¾0i(=~>!qÀ|QH¾c6$Aiz½Ò»÷åÄ>×í²¯ü¾ àÚ^²Q-> 2Ð\à>6uy¸¨œ¾ Ì.Õð>òçœs½üò(“¿¾þ…Taná>!" ‚q6¾€Ë6õ©½íôŽ.¨E>[ ÿë#¾ ‡Š §á> @”uÕ> VÚÒ^ÀF¾ w9öHdl>Œ±j½Ô?½ðjô„)ÛG¾8É w=>!(䪾"¬¬+üJ½û;‚Âsi>óÕ’±¾¾ äIÉi> PNs%]>S-C웾 Ð_ºz/Ú>|°&¿¦¤½ÅׂCÆy¾˜$Ó×±l> è++jA¾.î̤>:¾‰RíÌŽ>v;~qz¾q¡ÙJ=ÿ½Ûî,´­>*Fš3§B¾!Ó U¬‹>ÔwgX"º=é}'–!îø¾ðü<ôB> w¸(·=¾ Heî@¾ > Z > ]˜ôõÊu¾Khà„‰(=î¨|®\_>V*Ž#D¾ ü¡BðG­>ŠÍ–ÒŽ=ý·&7ü¾%ႳÐ>yAQ£ci¾øHÎ Œ‰¾ïáû,B> Ð1Ž½E¾s&±[Äì½ÉJä€&>vRÇ™RѾ ªÞpƒÆ®>†q…½ã> k£¼¾ âÿWz›>>`XÖ;Ľöº:›¿Ð(¾é±U´¦ß> ôZ± s¾Æv·w‚ê½÷g9ë_5ž>LÄÅwc9¾ád¥C>ƒõpü>»µN¥‘¾ ¥*Ëê£>*½÷’A½µDÎy”:j¾®žÖ.B€> ¯£Œ’ɪ¾AÌÅká¾UPs¤À>œÒ§žE¾|î«"=ù;‡ÿpû¨>_ ,EåT¾ ã„R˜[> j~‹a0=õÅž½¶€ ¾Õõëת>Ûa̳k¾È«¸À¾”@< 1> –Ì-ÜÃM¾ô[›ôÞ=®fÅls_>¶Ùôft¾ žS.E%i>ðª’`³>ü<Š W¾­¸›«>$Rk]Ìù½öÓ11,¾ÐØB|z5> Ö8ÂxÒ¾\ZP¸îy½ù òÄö>g-£:óϾffžOç¦>® Z²¿>ß=ÅCÁ¾  wç”cu>@Ö·£E=Ñeí™Sw¾>ÂaÏ> iÿ¾¤]i¾ãQÃN¾ Û²D> t*÷¾!¥EÔï=ï_ Ei(>–Ëõúï¾ ½¶¶·4>¸¥þ¾’ñ>ö0sF¾EùS¼ž+>s£P1‰¾R6t_·c¾`»\Of> ¶µ†/J¾Ug~ ½ìÙ8šÀy>ï(­m{n¾ wêZÎÇ> Q,s>ÙéºÊy¾ \‚îŒ~/>Y)~ Ï½ÍV«5 &¾+Æ.é > „7—Ü÷c¾û†éO¾·?ù>v¬m ¨¾źž|xº=ôò#¿y ð>•ý#¾ ±ï>™§>|'S¡õ3=ý%X´¾¾Ћ€R>¡Öy=_¾—9—ú྾È~Ëxã`> ›ÖS)¾‡aÎÔ[+½éû;!r>¨†ŠŽX§¾÷_[žý> ‡¡RS>ºðmõ4ľ K¨XsL><ù²z£½Ä"€@b¾M£rÖ¤j> g×`áT¾m”dÉø¾Õå±6H>“p¬£‰¾9I–ºaŠ=ñ4DÀgÕ >ÀbPÓľ šÉr G>qpö³…>&A´z¾<¾S8m>åÖ„<%½þðiœŽi«¾ØñbŸÎ> š•¦æö¬¾}‚F¡½ô¬lÝnL>¢×\£Ö¿¾*¶ƒÞ€>Ò]oÛÆ>PÆœ" ‘¾ oJÓˆ{ž>_g4ñ.=ßD5þ1“Z¾Ø.dP~ú> ¨|ºˆ¾ ¤gŽ‰I¾ Õb > !”4Ц¾S ±¢ ~=Ñ‘a„ëé÷>í~}1‚d¾ Uýx¨ž\>si‹„­>«Ö á½¾oÂM v>ôä+·À½ï¦Qzàì’¾ò‹¾ÕGF> ~Õª|u¾Ë¥ï¥tU¾kó€ï >q¶ÝÙÀ¾IÛn?¡=úbÂ\š>ñI÷Y­å¾ ˆÎ)g>ÛAÂ$bý=úÏóÝ0z-¾RYLÊË>W^Ì)×¾RbÖ¾ò[õ¦p> xGãb̾§K‚y-›½ñQCM;>:v›5¾'Ã)#¸>oÀU½‡¶>üçÂö«½¾ SOqZ¾°>5©”™Mï=àÍÉ-¤‡D¾Ú~‹â×È>Ä-&\¾ lŠD­T¾3êx*ü> ‘aXÕa¾+{mˆ.½‚Ò[±÷>—¨ŠÎÿϾ =6ô> ýn¸…°> ¢šÊªh¾ľ«áBm>±'Gg›!½ÝŽ] B50„n¾‘yp•ª9¾SfÆFš¨>=¬¶ŽÃ€¾¥Ùkó=ìPFETç >0ø-Ïľ Y¦Aü(>ïEiÑÊ>J0£i’í¾¯Sc„ˆ>lVúIŸ½ô.kBII¾¦üjŒ©> cÖ«¾[TÔ¾ˆ´*z=">v•<ùÿ¾ ÐWýÞ6=ù~€¶Ü¶Ã> ÔXü¹¹¾ dÓþQñ>Úáú[=þ ܣϾu@*5>«R÷ß½þ!³R¢~¾bg•ú> _û Ê?c¾øD5¶‡š½ùÍRjì›> [íYľøô¥²…B> ­b³2>IùDÛ7Ö¾ X¤þä´>¬31€5=ö#É")êß¾›!`o¢>J³ÉÏÒ¾©²HÇ&[¾› ÷3’²> O¢\†Â4¾;bœyõµ½ó-К0>:b'äÐݾ†¡£ ’É>퀌­åÚ>g‰D-Õ¾ EÕnV>¤þ(Œl.=ðå¿ÛebÕ¾ëíîƒ>­~ëÀO7¾Û4 áã¾£ ¦ŽÏ> ;u„<“¹¾íØ:I½î‰.òª¶÷>¯·åÒ•X¾ÃAóÀè>xV¶">Y¹0ÆŸ]¾ 2_¿ý‰>â§ÃŒÐ=ì†ÛÁ˜•¾ˆóç“­>Ë –vE¾ȲQ1€Á¾3" (­> +ÿ,hKn¾$ß*õ?i½ëÑÌb¯>y½°¾dž²Èû>ʼIîN>1²ƒžNÀ¾ ){Œ^Þ>Í6th¯=ìvj—ÙL¾„7Æ-¨>· '÷|ü¾zÃeæ´x¾WèÓOÇ> )Ø㢾çáÔÀû½î‚lÂíÕ>¥òT<”›¾—t—{}U>Õ étm> Êö®µ¾ +ÀZËr*>˜¡–ÊÅÈ=ðñ¬3ËŒk¾Ü¿ÊÛ>eÛ¬EÏ’¾Ý˜£I ¾ Ax¿³> -‡“-,L¾)1ŠJ;y½óDš%xK>#:ƒÙÉt¾"N,;ê>•ŸÐ°§3>–5Ìi¾ / ÈÖz>™½ƒÁ)=ö/us#w¡¾{=ܨ>̈®€)¾5Ó¥o{¾>×?:g> /ö7¹Ë¾ê´ûñk‡½ù¶þ€¸”>âžÇ'¾c¤Š1­…=þ6/Kƒ³=>±¦[sV¾ /RQì%U>6*8=ýÞË[ §¾X`YçÉ>âˆY±Œ½ù½Ç„‰¾éù´µK3> *[G-©¾%ªÒÖì¾S`ó>µ¯>ÖO|¾Cã©îD=ôFUÆô>æUzP@¾ ×^ÅÉ>ø‚¸Ã/>Çßyz¾V2¯†BC>Á¾Ð¦½íf ìMt¾õ­ïÖ«> Gƒ.ÀB¾¦¶±Ç¬§¾ïéfüÆ!>Л(ñÆ»¾™¶F3G=à_ftpÈ>¾,¿åQ¾Ôx²¥„>P¾ÔÉ÷{> és±8,¾A_+CH!>‰"Å•½°ûëgâF¾4@õXú>\{¤P8H¾ úÌÔ°­¾ o~«o, >£Bm¾ME¯ò ½ÚºõÚã,>[¦:buÖ¾Ò”D åtK>{#ô7‡õ¾ñfÙÍè>à;æÁ=î?¬túʾ™£å– >pÞÞN¾)"I/Ê ¾Q©+#šÊ> £QÛ]3¾;^ÜùaG½÷ý«{Ÿ¯}>œM¿Âû¾4YÄ>‚*=ýG¹ÄÀ>29p]\¾ OH >Yá#föD>¸qRP¾ OiïÒ˜>¸ŠÓº½óuQÇo‰¾:cöo>ü¦kÍ{Y¾:ÞVQ$¾¡úúv¿Ñ>‚†´r¾¨"Á÷I=áÕé¡óÐv>é\Öód¾–&sÙ> ºÏéÐ> ªízèž¾9ýZÁÜ,>ü@#Šã= ’È¡¨I¾¬ˆæú%>íxàäéw¾‡ ^h°¾ÄâVÇþÈ>½#³j1 ¾ €îÄû½ì*G\>R-ÄOw¾û˜ì!ž>×óΚ>or­H ¾ ûwÓxµ>Å -~´t=úA`ñ»u ¾Ïg»‚‡R>¶F*za½ù_ði3±¾òB6htF>úµë+£¾1 ó}Zí¾pRc8~B>v.²õ‹¾ ¨U”=èTÅM½L>[DÁkì¾™ÌHmŠ>»~â~´> ÔÞRº-þ꾡k3> 0¬ ÷=¼°L©SǾ˜¢mpMo>Ññ§5c6¾`‹ÙȾ€µ´’ó>³×&€H¾Ÿ5vÜ擽ðPa+À‹T>˜Z·>¾šîÑ;óá>…ýùŸ:>-Et]ÄG¾ïý9ºó§>ÊÞ›=ÿ)â"榾J ‚ø1>í½»ŠW#½óh öŽ¾!›4"ü>¸ƒ Üs¾rñª¾þp½¢>œ¦ïÜn¾ÆåÃû=ÉN'Qrý>Θœqݾ ýñ> ê"^}Q>sù=ZÁ—¾B@ŠÈ>57VV=êÖ[¥2Ž\¾3†#š­æ>¾î䮾üêdâð¾Í°ˆw( >Ý~O‰†ó¾ô‰0è[,½þc‡N[>0ã§DÀ¾䳂­ƒÔ=òÞ_ßf>(qèÖ¾¤Ø܆¿:>K€D$Ëü>®û@ø"¾­ÉcÏPÄ>lü¦Æ¬½©¶ä<ªG¾,ôi=¤=>Ä7»^¾\(‚·^-¾ôŽášÇ>‘g÷œS¾Vi†½ñØs,hE>¾J!Þ6e¾2"DtøŒ=þ±ë=yö¶>áê¿ð¾ȱStq>¨›ôº~>P øøF|¾Á’yÝÛ…>é%{:Lj½æçé`6ƒ)¾p3ÆQL>Bªw¾¯o¾ à*–xm¾ ‰¾ï`,>¸8¹H,¾é]-ý”0½á@¯¶…>„õ‹ž`ê¾òþè§çÛ>wÍ\Æ">*تì̾·á3ÞÔ>5ɦ7~=ýÐFâV¾ÿç?-9>ÎÏ3îÛî½ò†{6Kúþ5H@Àþ>zÛ¸ÇKz¾²ÉÊB¾¦dþÔ€>½¼0|#¾Ò–½Ç'á½È¢ÜìÌ>¹ækÓ’¾SyL¬ˆ>Ë¡ Ôa9>)SLyþž?‹ à.>]­Ã?=ù$nÉ’¡¾Ž5õ¢%>4}¤@+8½õíjáÀ¶‚¾–¬Ä¦å+>…¥ $¨¾oƒ89ã7¾d«eËö >‰,¾Ù¾˜RG§½¯JÛ‡®>i„¶(ªÿ¾b”«ú >jÁuLCð>ß‹Ïísc¾‰ue†X>ÀêN²€=ø]kn+¦¾tEË4Ù>,–ž÷¿?½õæòf–¢¾”]±ò}Å>s˜¼zƾGþÖÕ«¾µãÚž%š>‹{¦¯%¾æ&^çnܽÂÔðw?¨d>š³» Ïù¾5|¹vd>st´=<>OIî“©¾‰»E¯ä€>š^^ÕvÕ=ûÃÿßÙ¡¾½ã*Ìž*>Ä%V“—ª½ò|„ ö¥ ¾6ñRËê>Múg*,Õ¾ÅFîaΣ¾ ¨ŽÑþ¡>É©Äžrm¾"›?þ†½Ý š'äo>Oö¶‘ ¾Ã*:°£¾>Í›Û[>{îI¾‘ðvg%>cÞô·m>¡®æ£@¾[{6²©>áÿð{®½ç!ý!7^¾o,NŒî>õ¼l™Š0¾ X¶‹3½¾ %Þ׸ð+>!1VŠÒ¾¸†2«ý`½ïJòç_—M>f}Çe¯=¾æñ¢ZѶ=üÕç#´¼Û>Dx<¾wý•¿úf>f¿á¦G¾>FKœ°ãu¾ þg´>i„½±Í(›“¾â¥ñ+ >E~ìùܾAÌ1™>¾öfF–tõ>hIxa£¾–J“ç<нû0ʺÌE>µŽÐJ±u¾ƒ@WÒ*=ð©á({íâ>ˆŒ¬uíþ¾Ï“*Ù> 0å®#ü¾> MÀ-iг¾æ:Å/Ö>=a®·Áv=é9E £Ú¾‹lEœ>ˆ2ÍÑнþÇبóœÖ¾å*ùo>mò ß=ö¾™.òˆl¾á]XÏ)‹> :XúŽ¾c×CÕ¿=¬°`»ºè>àEcªÔ¾*âÇn˜>ªf*`¨¡>Ao–˜ o¾d‘YU”{>$Ã$?ût=ý”6@Z{B¾ó9‘8dÿ>½%Y½êd;Ð_âï¾&‡€ŠA:>Û¨Éb¾ )+m‚¾ aÆñ“»k> Tù‹„¾DQØ˸ª½òB—\íM>±S}¾ˆ†¾_Ϲtg=ø7³Ñ ›>+vØXl.¾9ƒ6Χ>çÞA3^(>ƒfOÜá÷¾„ñvŒ(>Y1R!=ß°ž¼"ŠM¾]n=C9t>VáH†g¾úcýžã¾Aa#ÐÝ>Zœqâ8Ͼú%¬W¨¾ÈN"ýa>ÛsP呾n©ÁïÃÃ=´â‘‰µu¼> ø𪱜¾ ¨sá©>1ÃÄ]S>xÏÅw…¾QT²Ø‹ª>«Ë_u—ÿ=ÿöªÍ Óµ¾%{ÿŽ¥~>rïó;½â²CB¾ʤÆwÊ>‡|–ê1b¾Ã͆nÖ¾¸¹“‚1Ð>+<µ±G%¾ŠÌoÊO½øïdŽ¢>o–Œ0‚¾o¤+Á=ð(1®¡[>¦‚º¨ça¾Ø¢f>µ=> ³kËh4> évéB½P¾óÛ@Ôµ>'â¼þ~=òú’ j‹¾Ä ,  o>À½„í~½õÄ©°Býþ¦o I(>­ãOFL¾ ã7:ˆ¾ ‹´!u³Ò”¾Ýüâ¤Ý½ì9°mÉÜØ>*’a‰§í¾ŽR¼¦¹”=ú8¬Éï >ϬÊ”Z¾Ï–>Ûž¤ þ>£4Øo’¾w<ܽ¶>¡wŽ|Uk=䥾F࿾¬£ÍcàØ>áÇtîÀ½ý’¿¨Ê«'¾)y©Fµ>*Zœ¶ò¾•šÓ}É…¾:L¿}¡>E ¬´Ú¾ÎÜ8G½Þš“ã >Q=bæê^Æ”=ÿÐáßÔ2>¹ERäù¾.ë4ˆ÷>þÎW#o>WñØm9G¾&ýž¶4>P–žëZ]=Ø|pTGü¾ùo¤ Ž>2÷_ÝÑV¾xÿp3^¦¾ƒ wDx>/7?5ð7¾)×Û¯Ý÷¾¦<<>YßÔѾaÈ%*t"½×  ¹*äØ;¾30eð 2>x’Ÿ6Ìå>…¹XwXȾ+,vÂ=>áð¥Æ>3žÓ/Ó¸¾ÀG!z[>C¯ýà=Ú&L·c0×¾. üÜFS>³€BŽ½ÿ×õթݤ¾¿f°zkÑ> n[äÑ(¾ÄÞ¥W´¾é. ¥3>3[:?Á¾ö'Už¬*½àÔ®ù‰C>lx°¦bñ¾ßH·×æ=ý¬ãžžz>,2§¶Î¾é{ØB>7|2°jÀ>/$€KȾVhîÖ>z8a´I=æµ4cï ¾ÌîË’Ç>Š[-w½út}î9¾Ì úûp>óùúµ[¾Û§j‚0‹¾ Ì ÏÇ„>„®9¦“¾Î';ýÑ(½î¾à •Ax>LWŠWw¾ÍK=ã=ö$°x2–>›{ç:òX¾ËÀx¡öw> Æ[¬Âeì> õí†Y ¾¹ÁÌ¥ßa>ë·ÔŒ%=ôyD­YD¾æñ¾ >võ¬›ø¼½ð´q Zžà¾—eŠbA>Œ¤°nT&¾ %añ›'¾•B½æ-ß>ë ¥ýA^¾Éèùe|œ½ú§¡KŒ+Ï>­ÀÛJ–¾§V€LÍ=ä2Ê[Di>µ#¶Ǿ+Yhl!¼>î‹Š¹Ûª>ÍŠ$`¾ ´hž”&>bŽÙ›Ð¼>êK½Im¾=E\Ö6>šø®1”½Âè/¯jXÔ¾ê¬ÏßÈø>›F¡¨ÂϾpÓü·å¾yÇLr¸>oŠø¾°o ®ú]¾òæ+ ë>à't4D¾Jrd½Oõ½ÙÎŽz_#¶>)¾Íû[q¾ÒÏgÓg=ýnxõœ#>B;^§¾ê~PQÌ>^S2Cj> [™B‚H5¾kØÚð•u>­]”6:Ü=ðBŠß>Ž¾fW<}lÁ>Ä^à)—½óp–q¤§¾/Î<Œ'>Œñ¼ûüO¾ ·Òd`{¾Û£dÖ³>Ñ>³¸‚2¾¼CŒ÷þr½û$¢ð»->‘P÷¡¾fßØŸ=à„£hm[>5È,ÈO¾éUÆýó>_¸|—)>„5@Lº¾ÿòëM6Ú>l˜o–§M>G¼éQm†¾™ª “Õ>ªʦû5=ÐEŽ¯QL¾Ø+fËêk>ìáááaï%K¾l³G¾¾ c§/F>gœfðä%¾€Šiž{½ñsσ¸~>Œ‡XÔŒ¾„ ðß<‡=ñ#G¨!: >ŽÞc*‡—¾`¡–x=> %V¦·g+>¬o,å¾âM}¯Äz>Þkú<=ÿ©½e9l¾5³C§>½œ_÷*½ÂÅ%Q¸Å«¾ðˆiq>dòñ¿ù¾ n™à5Q¾úNþÙGI>îŽÆ]X¾½É]½R¾4:ª×H_>!Á@±ÉW¾."8¶fp½ë.wR±E> þF¾Ý–~óÈ=ôK|Ë¡÷¯>¸‘o¾uU4€Ü> >G9&e£>¥FôQß&¾Ê“½6>,¼—ˆ?=þÓ~­#¯¾ÚY߬4>¹ ¹´óÁ½É\î—Ü 2¾Ï+ƒŠ0>_·â¶X ¾Üœ@1þ¾øÀ¡û<>àûïøi~¾–ÅG·6C¾Ž“ü~Š§>%¶sTá¾í`8[Sƒ½îqµ¾‰>@uTŸÌ`¾™ý ÿ=òJ²fO>jÏÃU‹ï¾K(RHÒ˜>Øîã¢é>EC ݾÔ4t\°Û>pe-Šÿw>ö.0²Ž¾0|µdZe>Îpåá×=¸“„¨ÃÙ¾‚2ua%(>ëã%Ïî½þÜídÒ¾´ ¸7ò>ÁÞš¾‚–0 =#¾ {K[iÿ>t9’a·¾¸ ƒ–½ö8¶ûèå>Ê+„F@¾¬B³KÖ=äQi½xÜ>Áúœu!h¾ÊÀ½Îˆù>ѯ›±ì%>ÚTXP-(¾á†7ï‘P>ŒçűP}>…1ÒÒ1¾â]#¡ë>|Ì4L¹Ö=综½âè}¾ãÜ3±¢>ÕŸÖ3R©½ôL¡N@v¾c-&±Ä>PÚ*î2¾ 8Zz=XÓ¾ÁâØ>Ⱦ­G #¾\÷$ôþ>¾> )ý¢`>9ëh‹(¤¾ÒÔ]üŽÊ\¢pÕ>Ã5Ù䈾¥‹ÓQ³=ü9Rw,v>¢š›W”¡¾™A™ÇŠp> ²÷õm,j> a¢‡®Fô¾’ n¥’ >¿Î¼b9=ûk#¬=¥o¾•®ú'e>Ìî¿õ½Ì¨%^½tª¾Ç Z%øm>1;%ÿ‰¾ ¬otI¾j/ã´(¯>º•’ž¾UÅÅ=¾ °øÃî>S³˜x8¾ÃÖ0Ï’p½õøÐ(ýC>°|¯‘¾|7_4ë=áo ~ŽUå>ÿs¹v羌S%Y¬>brk͆>6¾Á¥€¾Ǥ&çÙD>•Ó߆æO>Á_S>¾X*Û;>q<Šÿ,=ò5¤…<^¾¡nÍ´:‘>êĊݰݽè3š²’,¾y{…·p2>ÀS4§fX¾Êü·V©¾ëCÝr¬Ž>ÊA5o8ܾ8ÁÓ+1¾ž]§`k¡>üö‚ òÔ¾Îc,ˆåo½ð1°6Šù >hÅv¾¾]Ð lÜ=ëmט.æ“>9?\ ¾Ô?,Ÿn >\Y.Íò>°`Õ;—¦¾ÈT uú>Iw¶ƒW>Hþ¡ã ¾ñ ,ÔÕN>ÝÙ¬?=ïÇð¿N’þ¾`ÄøD&”>aý9(ö½ë8hˆ”w€¾?žÒôc>ÉŸ­VÍ ¾6X¶5¾ÎMJðµ>ÂZ­ù6Ù¾b˜¦¾¾¹*Àû>üsØ·Þ¾¢ôœºÚ½ñDÑ…ß7>‡>3/€0¾äu¢ò5=ç¤S †HP>Š!ëú¾¢ rªÔÆ>ÅÝÍ^c>Au/0羸ÊØšñ>Šæ*tG>ö6¤þÏÁ¾||&€®>d_Óhx=ôG ˜e¾Ú±>3(>u€¯‰ær½àÃ[,±½5¾z ú>YÍ^ì(¾?0Ž‹]¾×÷ _Ÿ>¥êa1}'¾Ecì§w½¾ îåûŠÿá>KØÀ}ýÓ¾JL•òæ½øëgõí>TiÞåãø¾Ê…6­=ÊùÙ—Ã>ÞTb噆¾éøáêì|=ÿ-q²'A>µd Ðà¾ìaBÿ‘> ¯:¡•Ü;> Ÿ×UÉ9:¾€»ñÕMŠ>åúĸ=ÿ)£ s‡¾ê\;Ø¢Š>Ö¹:¼ë‹=Ìk70ݾ×ÆCm°PQ½ø&K¢¸½¾tå?™¥>;n)f¾ C¯ ¾üX€Ð¹­>¨¿—¹þ¾©m¾z–Q>‰¾Âý÷¾‹1{ÖC½è ª’Où>ð¨¥)¾Sô&f)—=î­˜Ÿo¨ô> ‡»ˆÃ¾½Èp÷1þ>ñÙMëb>ó–‚{2¾­¯J—@è>’KËöÝJ>A `ľjF`ä™>Ö›Ñ-`Ž=ö)K:¢m¾ù}䛪>sï,‘½Ó!ÓÈ·…¾®h¸µg>ð¢¸iž½ÿgF“Åï¾ØWÂOü>tÞĀ¾ 6—p $¾ 6Tbœë†>ƒ7hÝü¾«]dJŠÎ¾×¶-Íw>­rX¾HKàRƒ½ÝÅxÆÉö>^]U¾W¾½æ»J.=óõG7É>c·³÷ÎR¾ãR|vìî>I:S¸Æ>bUÿ6,¾¤¿/wÚ§>ü2{>/ã7Îÿƾü8ˆ™øÎ>B¥ÄÊ=õ*ú£¼W ¾ôé·OëF> lý$"ç½Ó©<–ØF¾ª:óŸ>Ü åŽÐ½þ¯+g¤´å¾E _œ{ü>_$)¨+†¾ }ÁxÎø¾ öÂ(Gâ>„hÕž¾/Z Œ¾û‰Ü>NM¾Á.c>½åͤϼ>Ís¯¥ƾBÁ×Éù*=íƒûêã2>"ÖÔ¹C¾¿-UYm>בâY‘è>wÌ]+Iݾ‘®Î£íæ>fÈq’å£> cþxÿ¾@Ò€=^>È…}y3œ=ü E¦µ“¾¤ ;Þ4>õítáˆ=ÈoéiTEƾÐqE § >C‰Å^n½ö/.Àˆ–¾çÕÆŸ!x>÷ Ýíb¾õV0&6¾~ï:f>›™êí³¾5Ñ“´ ¾(Š“5`›>ùY¼; {¾Ú0° ½ön7 >‡±>}üEµÚ¾¹è¹Bë)=ÂXòº÷J…>óˆ>·µ¾ˆ}¢P]=úÖh¬óÎ>qÛÙ¶¾+eÕùõ> š†»½>0[Õ‚ò¾”ÎA­>ÝP߈>`^[ð=¾Ãßœ'¹º>qξã»è=ó¬ÿ A¾Ä«g>²È4Ö‰½Ô¶€ÅS!—¾­([£ùu>¾B$ªß½ý/ØÁŒK¾ ò&&ù>< xDÕ¿¾ ûz8¾€®¾•)Š(ï>‹!A{¾)ÄR¾¸ŠmÎ :>«Àþlݾœ+óà½ò43Éš×>©Í—™G0¾-s!¢Ä=ÖöF<åø>›×y®Z3¾¼‰_ÉXÅ=ý.ÂsAý>¢uµÜÁ¿¾3…†, Å> ĨqÌ>ÌëÔI^Ô¾‡;XŠç5>øG¼QÜ_>.\#2‘¾·ÇÞ«æ&>^lÖåÓW=ó¡êç–|î¾Ïôk*9h>í\]\ ½ÍÛ蕾äÊ{.®£>…×Õ§¿þ½úß\O´f¯¾@Ư°ý>e릗¾yûÖª»Ž¾„>êzË0>‡ÌTHa¾Kô@{Õ@¾Á®#ó“|>ä«)îVå¾·Ûemu§½÷iɉü†ÿ>2+z;ZS±,yw½¢;`t­1>‚Pë<ü™¾¬=KÌï=ö5{ys>ðJ jp¾ÑÞÈ@>F{Ñļ>ž8ã.>¾ƒ ©‹¡>â…°‡È> id/÷wß¾'1@$[j>æŸy”=ýZ_ì2…¾ÃÙÓÞDÿ>eÍ´‡f;=Ý\zܾgÝfNÿ/>Wzk ½îF’.’Y¾*vÐÅ>[#£aªS¾yeÆ Óã¾)ÿÚÎ=T>b*رd¾ ¹1†ÖR¾ *²fŠE>fÑ‘Ö['¾þ ô|•?¾êJ¿>k¢,4¾ûº–h¬ä½ðUÿÒñÒ>{þDxã¾6ÎÄj=ÖjòJ‚´">ª‡tYM™¾”®‚o¸´=ûG’œBÞ>ùrѾ‰;‡ù>ÿäq«Š>Ï`ëÙ¼j¾‚¢™²>ÇK¿ý‘Í>”Jü³¾ºŸ)h‚>ÆEú=û üĆýQ¾œ½ù7æ>‘íÁÎlZ=ÙMÞ—òhn¾OŒ3ZŠõæµ½î,ÅÇMå¾5Ò…>HêæßϾùýïðI ¾gÜ«oDû>PŠÒœø™¾ ÑñRðþ^¾¯E\G¥>kývËÒ¾dE!œ%¾p§•Uü>K¼ƒ$¾M͘(Ú½ô~‚/‚ÕD>íH>ÓÛb¾‰gHîÞ\=šÁœÝ -2>k|¡Z§<¾¿n =õ:þâœ>-2Ûn· ¾£c<^>«kHFa>LÌÄQûÖ¾gñ‡éB°>]…$°`> Ò4u_7¾K)7->'>Kø¬‡÷;>G½¬u¼¾P’((§Ö>ûÐܲ‚ =ðƒÚ9 h¢¾‚BÓ >+Î,c/½ÏMä38>æ¾ï(ÑÂ[H>HM.ú½ø%Ð"SXû¾¬‡|¯hê>ÃQáÒ¬¾ÐSDÉ+ö¾Óã˜>jn&Dñ¾é‘v½¾ SpÃJã>:œ.á/~¾jis©¬¾ª+…q>8ÖŽ[Ž ¾­§|%½ï…›«b/Ë>n*£–¡¾ ò»Cý=И-éÖ‡>énÿA ¾C @; †=÷Ýàå¥2>¾3²‚¾¸OwsÜ>o¤Im²>€®ø>“¾d üuBx>VYPQ> ¨˜å3o¾¾D~õ™>4ñ‡þƒ>›Î;¥Z¾\ß×¼8Î>»¶³ÌU=ò<§‰[O³¾µ“>Êã>ªOª ½² -.t¤¾[ÇyÇÓª>é"’½ôbŒüÆÓ¨¾`ü+R .>}ƒâ ô¾†PÄ2¬Ï¾Ú0šÃ|Ü>MÈ,)`ú¾ Tðž•÷¾ ¿)ãPØÏ>]ÐkÉ´á¾3ºÁæZ#¾ž9î§4>¯HÓ.ÐŒ¾ÆŸRd‚½÷ëÒøÈÓ>HÒá˜jî¾΋@Ïÿ½Ô 7ð´È`>5n‹°““¾:“¾Š•=ëL†÷à}á>„Ì}’̾ýÎ~<ü]>Ygª 9>Fñ'£A¾Çuª²æ>ÎÂ!OqE>“’×¹›E¾lC„¹+>|‚c’ê> óV‹²A¾‚ ó'š>+O¬ôSÊ>T'€×W¾ çûòùö>_`ë ü=í=–Ìí¾W±pr³ >±ülY ½ÍZA¡q¾ ÜÞ°u>¬2·Æ½õËw¶™5¾-5PÅ1ò>‚!“RÀ±¾­÷ Š¾Ö]ü¸™U>D”Çg ƾ úôµÏ…-¾2î"YÕ>[³q Â1¾Ñ >§¾îêùÂÞ>ÉcgYFݾ=@8sýûâß B¹>’õB[ؾ0$¬üR½âù hL%É>Á4°]\¾›lìú€8=àxíE5^>`;¦äs±ÃwÎÃ=ù²ûÊ>~²¸yR€¾°éæÊIÞ>EþÆ8j?>-Æ2©d¾N¥ò"ƒ> 7Ñcée> éˆÖ_¾Kª£²>C„F>:>#èí»¾¾ªK÷²l>†½/0Ì¥=ù’#fÝá¾oï7Ts>WBž:4=á ›LA¾¤õú¤ac>§Æ‘aQ½á;dá—¬¾Twf9¢¨>nHši/½ù „[,s¾Œé ó>£¬ÿÂ'¾è26šq’¾[1œÈ û>CæqèG¾ žN¶ÒŸ¾ ¦ªÎ½h>Mû‘>kW¾ßf·s¾ ÛÖÛ­k>ë<Ôò±¾hK6½ü&3xyÊ>©Ål¥ßU¾ÞBjòሽçx?ž?ï=>‡kŸêì¾3])XÖ¤=ÓH •é×à>殸þÍ$¾ ^á?É=õ5•ç>SDƒ \¾YowÔ5<>q !àã>ZLÓ:A¾4Ƨœc> &Š†+L> °™k}¾Y/šÑi>‰†(GÍ>ï)T¹;¾Rf%ul>×Ð]›†>^¾Ôº…ľ/ê-¹í°>´–åK\s=óÄ cµ½¾ÕÎŒm¾R>(s„h,_=É4 ”Ìö¾áY°Ë>* ÿ[F@½é~èç§5¾½èO˜Çx>²r:)¹½üZ*Š¶¾uý‘Aú>»®A«Ã7¾³I±ÔÙ¾xÞMÓ°>D4¹â s¾ Ó!’“r_¾ ˜Â8H¤>KQk€ûf¾·ÏÆçb¾yhðn >Ò¬X®îï¾·5Þ½þft[k¬>ÞT0pÁj¾]['n¬o½î‚D¯…ý'>sû-m|-¾Ÿx£A7S=nŽáP»-y>› 0†Ái¾vF„=î˜NV´ÝÍ>\äßoò;¾ÛóPJþò=þ73yË-Á>Ãÿ—V›”¾Ì^Wë>KX³$ùÚ>Ûü`@«[¾E½·g> ç!þl> cX2ÐÙ§¾GñXðQ¼>¶êÚ¿_>¤ŸµÄ£e¾ÔÆC^%>˜EÍ-–g=ÿ/aà¾ï±9³M÷>'÷ï6=ð±„ÎÔÑ=¾èf‰Á•>ZÇ>Öe=À>ÓJ¼òè¾æb|f>,{žù”½é+‚'%ìM¾Ð@ª>— ZÆeq½úñ-ɽ޾eKEJ˜ß>–¾ ‚ûµ¾k0D ó¾¯ÍKZ3ð>)~ãÕå¾ pNľuR°ß˜>O :ˆ¦¾Ÿñǯd‰¾ "6îñÖ>Ÿ@¸ã•¾{j×ß½7¾XH²×>XÍÁA¾¤yËÞ´½÷J21¼>C³èHü¾Q­™µ¬ ½â¯Ô!V9>ΣçÄW´¾>ÇËîh=Òœzè7Yî>/ˆæ«¾Α‰ÁüK=ò‚r¤)‹>ßìxv‰@¾ÿVRœ18>2èÁ#¾>v@ ü-¤¾ÍûçÚ>@>Œo'Îó>ÌZ/ì^Ò¾9b¯LG> ¿©¬Ÿ+> ØB.[ǾAÒO|í>FP_ú8>¿X`k$;èÇÖÆ@R>ñUdž¤>cqŒ–t·¾0õá »>Y/t3Q=õ³]S[j¾*ü(ß>wiò÷G=àÝ'OŸÉ¾µ^i˜I.>F“צîQ½Ót-¼=Ö ¾ü<çxx>Â~Ë; “½òfà'ξùp±9Õ}>çôf Ð×½þæv1ÛÕl¾´rXôS>´÷5^xF¾«ckŒ™¾4ÿÓK>(s#üÔ¾ š…rR4H¾9­T¶>Cä‚6¾˜ 4dÞ@¾ Qþ~âDÜ>rOÉ7²¾.µ…Õï¾\+lìvÊ>r#UYɾŠÇ>‘½úpoÖÄ%l>Œ6œšy¾¦hĺhI½ëáj£Y™>Wwlk¾|Íèñ—½µÈЋ%`´>Ø×Ìeо "ÇÊšu=æP¥§ND,>±xx07¾KQ3ÅÊå=÷{Áuž>Y>ðŠ\ T¾>U Ì u>¾¸«5.ô>Ú6ÃÐù¨¾áíx.1>‡UOúêE>obí]´˜¾5àhX E> YGÞ1>> µz1²Óp¾:°T[>>Îè–ÅÝ>Gh²à³¾ñÅxé>ƒ0tñÆ>£ØŒçV½¾]1u—l>µFˆ†=ù³í´°À¾ÒÞ"ƒè>­Ýý--{=ëå=´pm¾]46$ô>hÈü&Õê=Á bm*Z¾ù[&È>ãSµÅ«½ãDÚ°³‰€¾XÓúØ‚b>,t7¸½õ<'3……z¾€´wÆ3> s–•EÔ¾H»Dn+ƒ¾vyé->¸ùšÊá@¾Ä¶°Ü;¾?ÑGáÛZ>oì÷@)KÞwÿ¾þND@tB¾ ÊúœC#>L˜Àî¾TÉú¹¨¾œ!º«>µUg^œ°¾|^Ú˜ ƾF˜)»ï> ‚,U]¾t {^)¦½õªš«j“Ã>'€¨°Èݾ7ðF~…L½åXÅøÑ!b>x ѯ¾Äñ3¼:=•Œã„¼ï‰>­óÎ"ƾí×I†q=æŠî/TD(>!ïêtï¾2"éÓ=ö >ç×­]>f¤e§©6¾mï>H†²‘Ë>€™~Pä¾°5ˆ¹h>a’.Ü>t„=#H¾bºIŽ”> GDã?®>GEˆ þݾð²xKnv> ûÌñÛ¾)QÜÔ½ô>ªü“é­‹>;.B æÖ¾Ü,¿š>·È³¸`>VO×SF¾VÑb‚\>›ÈÀÔ#—=ú¯<èQÿ¾›t©q¤>T4'ãåæ=ð’lî[¾¬—s•JÊ>Þ’ÛQ´›=Ù£]1Ôš¾Œñ"ÒS>9¼÷½ÍÎÌ•qA¾?•b)DC>b'„wwÿ½ë‡&HOd¾ÇÚç®Þ7>Xß°Þx½÷¢Ç†ªN¾);mÊi>†a(Ÿ•¾£„<`²¾geÎáý`>¹ERäù¾.ë4ˆ÷>þÎW#o>WñØm9G¾&ýž¶4>P–žëZ]=Ø|pTGü¾ùo¤ Ž>2÷_ÝÑV¾xÿp3^¦¾ƒ wDx>/7?5ð7¾)×Û¯Ý÷¾¦<<>YßÔѾaÈ%*t"½×  ¹*äØ;¾30eð 2>x’Ÿ6Ìå>…¹XwXȾ+,vÂ=>áð¥Æ>3žÓ/Ó¸¾ÀG!z[>C¯ýà=Ú&L·c0×¾. üÜFS>³€BŽ½ÿ×õթݤ¾¿f°zkÑ> n[äÑ(¾ÄÞ¥W´¾é. ¥3>3[:?Á¾ö'Už¬*½àÔ®ù‰C>lx°¦bñ¾ßH·×æ=ý¬ãžžz>,2§¶Î¾é{ØB>7|2°jÀ>/$€KȾVhîÖ>z8a´I=æµ4cï ¾ÌîË’Ç>Š[-w½út}î9¾Ì úûp>óùúµ[¾Û§j‚0‹¾ Ì ÏÇ„>„®9¦“¾Î';ýÑ(½î¾à •Ax>LWŠWw¾ÍK=ã=ö$°x2–>›{ç:òX¾ËÀx¡öw> Æ[¬Âeì> õí†Y ¾¹ÁÌ¥ßa>ë·ÔŒ%=ôyD­YD¾æñ¾ >võ¬›ø¼½ð´q Zžà¾—eŠbA>Œ¤°nT&¾ %añ›'¾•B½æ-ß>ë ¥ýA^¾Éèùe|œ½ú§¡KŒ+Ï>­ÀÛJ–¾§V€LÍ=ä2Ê[Di>µ#¶Ǿ+Yhl!¼>î‹Š¹Ûª>ÍŠ$`¾ ´hž”&>bŽÙ›Ð¼>êK½Im¾=E\Ö6>šø®1”½Âè/¯jXÔ¾ê¬ÏßÈø>›F¡¨ÂϾpÓü·å¾yÇLr¸>oŠø¾°o ®ú]¾òæ+ ë>à't4D¾Jrd½Oõ½ÙÎŽz_#¶>)¾Íû[q¾ÒÏgÓg=ýnxõœ#>B;^§¾ê~PQÌ>^S2Cj> [™B‚H5¾kØÚð•u>­]”6:Ü=ðBŠß>Ž¾fW<}lÁ>Ä^à)—½óp–q¤§¾/Î<Œ'>Œñ¼ûüO¾ ·Òd`{¾Û£dÖ³>Ñ>³¸‚2¾¼CŒ÷þr½û$¢ð»->‘P÷¡¾fßØŸ=à„£hm[>5È,ÈO¾éUÆýó>_¸|—)>„5@Lº¾ÿòëM6Ú>l˜o–§M>G¼éQm†¾™ª “Õ>ªʦû5=ÐEŽ¯QL¾Ø+fËêk>ìáááaï%K¾l³G¾¾ c§/F>gœfðä%¾€Šiž{½ñsσ¸~>Œ‡XÔŒ¾„ ðß<‡=ñ#G¨!: >ŽÞc*‡—¾`¡–x=> %V¦·g+>¬o,å¾âM}¯Äz>Þkú<=ÿ©½e9l¾5³C§>½œ_÷*½ÂÅ%Q¸Å«¾ðˆiq>dòñ¿ù¾ n™à5Q¾úNþÙGI>îŽÆ]X¾½É]½R¾4:ª×H_>!Á@±ÉW¾."8¶fp½ë.wR±E> þF¾Ý–~óÈ=ôK|Ë¡÷¯>¸‘o¾uU4€Ü> >G9&e£>¥FôQß&¾Ê“½6>,¼—ˆ?=þÓ~­#¯¾ÚY߬4>¹ ¹´óÁ½É\î—Ü 2¾Ï+ƒŠ0>_·â¶X ¾Üœ@1þ¾øÀ¡û<>àûïøi~¾–ÅG·6C¾Ž“ü~Š§>%¶sTá¾í`8[Sƒ½îqµ¾‰>@uTŸÌ`¾™ý ÿ=òJ²fO>jÏÃU‹ï¾K(RHÒ˜>Øîã¢é>EC ݾÔ4t\°Û>pe-Šÿw>ö.0²Ž¾0|µdZe>Îpåá×=¸“„¨ÃÙ¾‚2ua%(>ëã%Ïî½þÜídÒ¾´ ¸7ò>ÁÞš¾‚–0 =#¾ {K[iÿ>t9’a·¾¸ ƒ–½ö8¶ûèå>Ê+„F@¾¬B³KÖ=äQi½xÜ>Áúœu!h¾ÊÀ½Îˆù>ѯ›±ì%>ÚTXP-(¾á†7ï‘P>ŒçűP}>…1ÒÒ1¾â]#¡ë>|Ì4L¹Ö=综½âè}¾ãÜ3±¢>ÕŸÖ3R©½ôL¡N@v¾c-&±Ä>PÚ*î2¾ 8Zz=XÓ¾ÁâØ>Ⱦ­G #¾\÷$ôþ>¾> )ý¢`>9ëh‹(¤¾ÒÔ]üŽÊ\¢pÕ>Ã5Ù䈾¥‹ÓQ³=ü9Rw,v>¢š›W”¡¾™A™ÇŠp> ²÷õm,j> a¢‡®Fô¾’ n¥’ >¿Î¼b9=ûk#¬=¥o¾•®ú'e>Ìî¿õ½Ì¨%^½tª¾Ç Z%øm>1;%ÿ‰¾ ¬otI¾j/ã´(¯>º•’ž¾UÅÅ=¾ °øÃî>S³˜x8¾ÃÖ0Ï’p½õøÐ(ýC>°|¯‘¾|7_4ë=áo ~ŽUå>ÿs¹v羌S%Y¬>brk͆>6¾Á¥€¾Ǥ&çÙD>•Ó߆æO>Á_S>¾X*Û;>q<Šÿ,=ò5¤…<^¾¡nÍ´:‘>êĊݰݽè3š²’,¾y{…·p2>ÀS4§fX¾Êü·V©¾ëCÝr¬Ž>ÊA5o8ܾ8ÁÓ+1¾ž]§`k¡>üö‚ òÔ¾Îc,ˆåo½ð1°6Šù >hÅv¾¾]Ð lÜ=ëmט.æ“>9?\ ¾Ô?,Ÿn >\Y.Íò>°`Õ;—¦¾ÈT uú>Iw¶ƒW>Hþ¡ã ¾ñ ,ÔÕN>ÝÙ¬?=ïÇð¿N’þ¾`ÄøD&”>aý9(ö½ë8hˆ”w€¾?žÒôc>ÉŸ­VÍ ¾6X¶5¾ÎMJðµ>ÂZ­ù6Ù¾b˜¦¾¾¹*Àû>üsØ·Þ¾¢ôœºÚ½ñDÑ…ß7>‡>3/€0¾äu¢ò5=ç¤S †HP>Š!ëú¾¢ rªÔÆ>ÅÝÍ^c>Au/0羸ÊØšñ>Šæ*tG>ö6¤þÏÁ¾||&€®>d_Óhx=ôG ˜e¾Ú±>3(>u€¯‰ær½àÃ[,±½5¾z ú>YÍ^ì(¾?0Ž‹]¾×÷ _Ÿ>¥êa1}'¾Ecì§w½¾ îåûŠÿá>KØÀ}ýÓ¾JL•òæ½øëgõí>TiÞåãø¾Ê…6­=ÊùÙ—Ã>ÞTb噆¾éøáêì|=ÿ-q²'A>µd Ðà¾ìaBÿ‘> ¯:¡•Ü;> Ÿ×UÉ9:¾€»ñÕMŠ>åúĸ=ÿ)£ s‡¾ê\;Ø¢Š>Ö¹:¼ë‹=Ìk70ݾ×ÆCm°PQ½ø&K¢¸½¾tå?™¥>;n)f¾ C¯ ¾üX€Ð¹­>¨¿—¹þ¾©m¾z–Q>‰¾Âý÷¾‹1{ÖC½è ª’Où>ð¨¥)¾Sô&f)—=î­˜Ÿo¨ô> ‡»ˆÃ¾½Èp÷1þ>ñÙMëb>ó–‚{2¾­¯J—@è>’KËöÝJ>A `ľjF`ä™>Ö›Ñ-`Ž=ö)K:¢m¾ù}䛪>sï,‘½Ó!ÓÈ·…¾®h¸µg>ð¢¸iž½ÿgF“Åï¾ØWÂOü>tÞĀ¾ 6—p $¾ 6Tbœë†>ƒ7hÝü¾«]dJŠÎ¾×¶-Íw>­rX¾HKàRƒ½ÝÅxÆÉö>^]U¾W¾½æ»J.=óõG7É>c·³÷ÎR¾ãR|vìî>I:S¸Æ>bUÿ6,¾¤¿/wÚ§>ü2{>/ã7Îÿƾü8ˆ™øÎ>B¥ÄÊ=õ*ú£¼W ¾ôé·OëF> lý$"ç½Ó©<–ØF¾ª:óŸ>Ü åŽÐ½þ¯+g¤´å¾E _œ{ü>_$)¨+†¾ }ÁxÎø¾ öÂ(Gâ>„hÕž¾/Z Œ¾û‰Ü>NM¾Á.c>½åͤϼ>Ís¯¥ƾBÁ×Éù*=íƒûêã2>"ÖÔ¹C¾¿-UYm>בâY‘è>wÌ]+Iݾ‘®Î£íæ>fÈq’å£> cþxÿ¾@Ò€=^>È…}y3œ=ü E¦µ“¾¤ ;Þ4>õítáˆ=ÈoéiTEƾÐqE § >C‰Å^n½ö/.Àˆ–¾çÕÆŸ!x>÷ Ýíb¾õV0&6¾~ï:f>›™êí³¾5Ñ“´ ¾(Š“5`›>ùY¼; {¾Ú0° ½ön7 >‡±>}üEµÚ¾¹è¹Bë)=ÂXòº÷J…>óˆ>·µ¾ˆ}¢P]=úÖh¬óÎ>qÛÙ¶¾+eÕùõ> š†»½>0[Õ‚ò¾”ÎA­>ÝP߈>`^[ð=¾Ãßœ'¹º>qξã»è=ó¬ÿ A¾Ä«g>²È4Ö‰½Ô¶€ÅS!—¾­([£ùu>¾B$ªß½ý/ØÁŒK¾ ò&&ù>< xDÕ¿¾ ûz8¾€®¾•)Š(ï>‹!A{¾)ÄR¾¸ŠmÎ :>«Àþlݾœ+óà½ò43Éš×>©Í—™G0¾-s!¢Ä=ÖöF<åø>›×y®Z3¾¼‰_ÉXÅ=ý.ÂsAý>¢uµÜÁ¿¾3…†, Å> ĨqÌ>ÌëÔI^Ô¾‡;XŠç5>øG¼QÜ_>.\#2‘¾·ÇÞ«æ&>^lÖåÓW=ó¡êç–|î¾Ïôk*9h>í\]\ ½ÍÛ蕾äÊ{.®£>…×Õ§¿þ½úß\O´f¯¾@Ư°ý>e릗¾yûÖª»Ž¾„>êzË0>‡ÌTHa¾Kô@{Õ@¾Á®#ó“|>ä«)îVå¾·Ûemu§½÷iɉü†ÿ>2+z;ZS±,yw½¢;`t­1>‚Pë<ü™¾¬=KÌï=ö5{ys>ðJ jp¾ÑÞÈ@>F{Ñļ>ž8ã.>¾ƒ ©‹¡>â…°‡È> id/÷wß¾'1@$[j>æŸy”=ýZ_ì2…¾ÃÙÓÞDÿ>eÍ´‡f;=Ý\zܾgÝfNÿ/>Wzk ½îF’.’Y¾*vÐÅ>[#£aªS¾yeÆ Óã¾)ÿÚÎ=T>b*رd¾ ¹1†ÖR¾ *²fŠE>fÑ‘Ö['¾þ ô|•?¾êJ¿>k¢,4¾ûº–h¬ä½ðUÿÒñÒ>{þDxã¾6ÎÄj=ÖjòJ‚´">ª‡tYM™¾”®‚o¸´=ûG’œBÞ>ùrѾ‰;‡ù>ÿäq«Š>Ï`ëÙ¼j¾‚¢™²>ÇK¿ý‘Í>”Jü³¾ºŸ)h‚>ÆEú=û üĆýQ¾œ½ù7æ>‘íÁÎlZ=ÙMÞ—òhn¾OŒ3ZŠõæµ½î,ÅÇMå¾5Ò…>HêæßϾùýïðI ¾gÜ«oDû>PŠÒœø™¾ ÑñRðþ^¾¯E\G¥>kývËÒ¾dE!œ%¾p§•Uü>K¼ƒ$¾M͘(Ú½ô~‚/‚ÕD>íH>ÓÛb¾‰gHîÞ\=šÁœÝ -2>k|¡Z§<¾¿n =õ:þâœ>-2Ûn· ¾£c<^>«kHFa>LÌÄQûÖ¾gñ‡éB°>]…$°`> Ò4u_7¾K)7->'>Kø¬‡÷;>G½¬u¼¾P’((§Ö>ûÐܲ‚ =ðƒÚ9 h¢¾‚BÓ >+Î,c/½ÏMä38>æ¾ï(ÑÂ[H>HM.ú½ø%Ð"SXû¾¬‡|¯hê>ÃQáÒ¬¾ÐSDÉ+ö¾Óã˜>jn&Dñ¾é‘v½¾ SpÃJã>:œ.á/~¾jis©¬¾ª+…q>8ÖŽ[Ž ¾­§|%½ï…›«b/Ë>n*£–¡¾ ò»Cý=И-éÖ‡>énÿA ¾C @; †=÷Ýàå¥2>¾3²‚¾¸OwsÜ>o¤Im²>€®ø>“¾d üuBx>VYPQ> ¨˜å3o¾¾D~õ™>4ñ‡þƒ>›Î;¥Z¾\ß×¼8Î>»¶³ÌU=ò<§‰[O³¾µ“>Êã>ªOª ½² -.t¤¾[ÇyÇÓª>é"’½ôbŒüÆÓ¨¾`ü+R .>}ƒâ ô¾†PÄ2¬Ï¾Ú0šÃ|Ü>MÈ,)`ú¾ Tðž•÷¾ ¿)ãPØÏ>]ÐkÉ´á¾3ºÁæZ#¾ž9î§4>¯HÓ.ÐŒ¾ÆŸRd‚½÷ëÒøÈÓ>HÒá˜jî¾΋@Ïÿ½Ô 7ð´È`>5n‹°““¾:“¾Š•=ëL†÷à}á>„Ì}’̾ýÎ~<ü]>Ygª 9>Fñ'£A¾Çuª²æ>ÎÂ!OqE>“’×¹›E¾lC„¹+>|‚c’ê> óV‹²A¾‚ ó'š>+O¬ôSÊ>T'€×W¾ çûòùö>_`ë ü=í=–Ìí¾W±pr³ >±ülY ½ÍZA¡q¾ ÜÞ°u>¬2·Æ½õËw¶™5¾-5PÅ1ò>‚!“RÀ±¾­÷ Š¾Ö]ü¸™U>D”Çg ƾ úôµÏ…-¾2î"YÕ>[³q Â1¾Ñ >§¾îêùÂÞ>ÉcgYFݾ=@8sýûâß B¹>’õB[ؾ0$¬üR½âù hL%É>Á4°]\¾›lìú€8=àxíE5^>`;¦äs±ÃwÎÃ=ù²ûÊ>~²¸yR€¾°éæÊIÞ>EþÆ8j?>-Æ2©d¾N¥ò"ƒ> 7Ñcée> éˆÖ_¾Kª£²>C„F>:>#èí»¾¾ªK÷²l>†½/0Ì¥=ù’#fÝá¾oï7Ts>WBž:4=á ›LA¾¤õú¤ac>§Æ‘aQ½á;dá—¬¾Twf9¢¨>nHši/½ù „[,s¾Œé ó>£¬ÿÂ'¾è26šq’¾[1œÈ û>CæqèG¾ žN¶ÒŸ¾ ¦ªÎ½h>Mû‘>kW¾ßf·s¾ ÛÖÛ­k>ë<Ôò±¾hK6½ü&3xyÊ>©Ål¥ßU¾ÞBjòሽçx?ž?ï=>‡kŸêì¾3])XÖ¤=ÓH •é×à>殸þÍ$¾ ^á?É=õ5•ç>SDƒ \¾YowÔ5<>q !àã>ZLÓ:A¾4Ƨœc> &Š†+L> °™k}¾Y/šÑi>‰†(GÍ>ï)T¹;¾Rf%ul>×Ð]›†>^¾Ôº…ľ/ê-¹í°>´–åK\s=óÄ cµ½¾ÕÎŒm¾R>(s„h,_=É4 ”Ìö¾áY°Ë>* ÿ[F@½é~èç§5¾½èO˜Çx>²r:)¹½üZ*Š¶¾uý‘Aú>»®A«Ã7¾³I±ÔÙ¾xÞMÓ°>D4¹â s¾ Ó!’“r_¾ ˜Â8H¤>KQk€ûf¾·ÏÆçb¾yhðn >Ò¬X®îï¾·5Þ½þft[k¬>ÞT0pÁj¾]['n¬o½î‚D¯…ý'>sû-m|-¾Ÿx£A7S=nŽáP»-y>› 0†Ái¾vF„=î˜NV´ÝÍ>\äßoò;¾ÛóPJþò=þ73yË-Á>Ãÿ—V›”¾Ì^Wë>KX³$ùÚ>Ûü`@«[¾E½·g> ç!þl> cX2ÐÙ§¾GñXðQ¼>¶êÚ¿_>¤ŸµÄ£e¾ÔÆC^%>˜EÍ-–g=ÿ/aà¾ï±9³M÷>'÷ï6=ð±„ÎÔÑ=¾èf‰Á•>ZÇ>Öe=À>ÓJ¼òè¾æb|f>,{žù”½é+‚'%ìM¾Ð@ª>— ZÆeq½úñ-ɽ޾eKEJ˜ß>–¾ ‚ûµ¾k0D ó¾¯ÍKZ3ð>)~ãÕå¾ pNľuR°ß˜>O :ˆ¦¾Ÿñǯd‰¾ "6îñÖ>Ÿ@¸ã•¾{j×ß½7¾XH²×>XÍÁA¾¤yËÞ´½÷J21¼>C³èHü¾Q­™µ¬ ½â¯Ô!V9>ΣçÄW´¾>ÇËîh=Òœzè7Yî>/ˆæ«¾Α‰ÁüK=ò‚r¤)‹>ßìxv‰@¾ÿVRœ18>2èÁ#¾>v@ ü-¤¾ÍûçÚ>@>Œo'Îó>ÌZ/ì^Ò¾9b¯LG> ¿©¬Ÿ+> ØB.[ǾAÒO|í>FP_ú8>¿X`k$;èÇÖÆ@R>ñUdž¤>cqŒ–t·¾0õá »>Y/t3Q=õ³]S[j¾*ü(ß>wiò÷G=àÝ'OŸÉ¾µ^i˜I.>F“צîQ½Ót-¼=Ö ¾ü<çxx>Â~Ë; “½òfà'ξùp±9Õ}>çôf Ð×½þæv1ÛÕl¾´rXôS>´÷5^xF¾«ckŒ™¾4ÿÓK>(s#üÔ¾ š…rR4H¾9­T¶>Cä‚6¾˜ 4dÞ@¾ Qþ~âDÜ>rOÉ7²¾.µ…Õï¾\+lìvÊ>r#UYɾŠÇ>‘½úpoÖÄ%l>Œ6œšy¾¦hĺhI½ëáj£Y™>Wwlk¾|Íèñ—½µÈЋ%`´>Ø×Ìeо "ÇÊšu=æP¥§ND,>±xx07¾KQ3ÅÊå=÷{Áuž>Y>ðŠ\ T¾>U Ì u>¾¸«5.ô>Ú6ÃÐù¨¾áíx.1>‡UOúêE>obí]´˜¾5àhX E> YGÞ1>> µz1²Óp¾:°T[>>Îè–ÅÝ>Gh²à³¾ñÅxé>ƒ0tñÆ>£ØŒçV½¾]1u—l>µFˆ†=ù³í´°À¾ÒÞ"ƒè>­Ýý--{=ëå=´pm¾]46$ô>hÈü&Õê=Á bm*Z¾ù[&È>ãSµÅ«½ãDÚ°³‰€¾XÓúØ‚b>,t7¸½õ<'3……z¾€´wÆ3> s–•EÔ¾H»Dn+ƒ¾vyé->¸ùšÊá@¾Ä¶°Ü;¾?ÑGáÛZ>oì÷@)KÞwÿ¾þND@tB¾ ÊúœC#>L˜Àî¾TÉú¹¨¾œ!º«>µUg^œ°¾|^Ú˜ ƾF˜)»ï> ‚,U]¾t {^)¦½õªš«j“Ã>'€¨°Èݾ7ðF~…L½åXÅøÑ!b>x ѯ¾Äñ3¼:=•Œã„¼ï‰>­óÎ"ƾí×I†q=æŠî/TD(>!ïêtï¾2"éÓ=ö >ç×­]>f¤e§©6¾mï>H†²‘Ë>€™~Pä¾°5ˆ¹h>a’.Ü>t„=#H¾bºIŽ”> GDã?®>GEˆ þݾð²xKnv> ûÌñÛ¾)QÜÔ½ô>ªü“é­‹>;.B æÖ¾Ü,¿š>·È³¸`>VO×SF¾VÑb‚\>›ÈÀÔ#—=ú¯<èQÿ¾›t©q¤>T4'ãåæ=ð’lî[¾¬—s•JÊ>Þ’ÛQ´›=Ù£]1Ôš¾Œñ"ÒS>9¼÷½ÍÎÌ•qA¾?•b)DC>b'„wwÿ½ë‡&HOd¾ÇÚç®Þ7>Xß°Þx½÷¢Ç†ªN¾);mÊi>†a(Ÿ•¾£„<`²¾geÎáý`>¹ERäù¾.ë4ˆ÷>þÎW#o>WñØm9G¾&ýž¶4>P–žëZ]=Ø|pTGü¾ùo¤ Ž>2÷_ÝÑV¾xÿp3^¦¾ƒ wDx>/7?5ð7¾)×Û¯Ý÷¾¦<<>YßÔѾaÈ%*t"½×  ¹*äØ;¾30eð 2>x’Ÿ6Ìå>…¹XwXȾ+,vÂ=>áð¥Æ>3žÓ/Ó¸¾ÀG!z[>C¯ýà=Ú&L·c0×¾. üÜFS>³€BŽ½ÿ×õթݤ¾¿f°zkÑ> n[äÑ(¾ÄÞ¥W´¾é. ¥3>3[:?Á¾ö'Už¬*½àÔ®ù‰C>lx°¦bñ¾ßH·×æ=ý¬ãžžz>,2§¶Î¾é{ØB>7|2°jÀ>/$€KȾVhîÖ>z8a´I=æµ4cï ¾ÌîË’Ç>Š[-w½út}î9¾Ì úûp>óùúµ[¾Û§j‚0‹¾ Ì ÏÇ„>„®9¦“¾Î';ýÑ(½î¾à •Ax>LWŠWw¾ÍK=ã=ö$°x2–>›{ç:òX¾ËÀx¡öw> Æ[¬Âeì> õí†Y ¾¹ÁÌ¥ßa>ë·ÔŒ%=ôyD­YD¾æñ¾ >võ¬›ø¼½ð´q Zžà¾—eŠbA>Œ¤°nT&¾ %añ›'¾•B½æ-ß>ë ¥ýA^¾Éèùe|œ½ú§¡KŒ+Ï>­ÀÛJ–¾§V€LÍ=ä2Ê[Di>µ#¶Ǿ+Yhl!¼>î‹Š¹Ûª>ÍŠ$`¾ ´hž”&>bŽÙ›Ð¼>êK½Im¾=E\Ö6>šø®1”½Âè/¯jXÔ¾ê¬ÏßÈø>›F¡¨ÂϾpÓü·å¾yÇLr¸>oŠø¾°o ®ú]¾òæ+ ë>à't4D¾Jrd½Oõ½ÙÎŽz_#¶>)¾Íû[q¾ÒÏgÓg=ýnxõœ#>B;^§¾ê~PQÌ>^S2Cj> [™B‚H5¾kØÚð•u>­]”6:Ü=ðBŠß>Ž¾fW<}lÁ>Ä^à)—½óp–q¤§¾/Î<Œ'>Œñ¼ûüO¾ ·Òd`{¾Û£dÖ³>Ñ>³¸‚2¾¼CŒ÷þr½û$¢ð»->‘P÷¡¾fßØŸ=à„£hm[>5È,ÈO¾éUÆýó>_¸|—)>„5@Lº¾ÿòëM6Ú>l˜o–§M>G¼éQm†¾™ª “Õ>ªʦû5=ÐEŽ¯QL¾Ø+fËêk>ìáááaï%K¾l³G¾¾ c§/F>gœfðä%¾€Šiž{½ñsσ¸~>Œ‡XÔŒ¾„ ðß<‡=ñ#G¨!: >ŽÞc*‡—¾`¡–x=> %V¦·g+>¬o,å¾âM}¯Äz>Þkú<=ÿ©½e9l¾5³C§>½œ_÷*½ÂÅ%Q¸Å«¾ðˆiq>dòñ¿ù¾ n™à5Q¾úNþÙGI>îŽÆ]X¾½É]½R¾4:ª×H_>!Á@±ÉW¾."8¶fp½ë.wR±E> þF¾Ý–~óÈ=ôK|Ë¡÷¯>¸‘o¾uU4€Ü> >G9&e£>¥FôQß&¾Ê“½6>,¼—ˆ?=þÓ~­#¯¾ÚY߬4>¹ ¹´óÁ½É\î—Ü 2¾Ï+ƒŠ0>_·â¶X ¾Üœ@1þ¾øÀ¡û<>àûïøi~¾–ÅG·6C¾Ž“ü~Š§>%¶sTá¾í`8[Sƒ½îqµ¾‰>@uTŸÌ`¾™ý ÿ=òJ²fO>jÏÃU‹ï¾K(RHÒ˜>Øîã¢é>EC ݾÔ4t\°Û>pe-Šÿw>ö.0²Ž¾0|µdZe>Îpåá×=¸“„¨ÃÙ¾‚2ua%(>ëã%Ïî½þÜídÒ¾´ ¸7ò>ÁÞš¾‚–0 =#¾ {K[iÿ>t9’a·¾¸ ƒ–½ö8¶ûèå>Ê+„F@¾¬B³KÖ=äQi½xÜ>Áúœu!h¾ÊÀ½Îˆù>ѯ›±ì%>ÚTXP-(¾á†7ï‘P>ŒçűP}>…1ÒÒ1¾â]#¡ë>|Ì4L¹Ö=综½âè}¾ãÜ3±¢>ÕŸÖ3R©½ôL¡N@v¾c-&±Ä>PÚ*î2¾ 8Zz=XÓ¾ÁâØ>Ⱦ­G #¾\÷$ôþ>¾> )ý¢`>9ëh‹(¤¾ÒÔ]üŽÊ\¢pÕ>Ã5Ù䈾¥‹ÓQ³=ü9Rw,v>¢š›W”¡¾™A™ÇŠp> ²÷õm,j> a¢‡®Fô¾’ n¥’ >¿Î¼b9=ûk#¬=¥o¾•®ú'e>Ìî¿õ½Ì¨%^½tª¾Ç Z%øm>1;%ÿ‰¾ ¬otI¾j/ã´(¯>º•’ž¾UÅÅ=¾ °øÃî>S³˜x8¾ÃÖ0Ï’p½õøÐ(ýC>°|¯‘¾|7_4ë=áo ~ŽUå>ÿs¹v羌S%Y¬>brk͆>6¾Á¥€¾Ǥ&çÙD>•Ó߆æO>Á_S>¾X*Û;>q<Šÿ,=ò5¤…<^¾¡nÍ´:‘>êĊݰݽè3š²’,¾y{…·p2>ÀS4§fX¾Êü·V©¾ëCÝr¬Ž>ÊA5o8ܾ8ÁÓ+1¾ž]§`k¡>üö‚ òÔ¾Îc,ˆåo½ð1°6Šù >hÅv¾¾]Ð lÜ=ëmט.æ“>9?\ ¾Ô?,Ÿn >\Y.Íò>°`Õ;—¦¾ÈT uú>Iw¶ƒW>Hþ¡ã ¾ñ ,ÔÕN>ÝÙ¬?=ïÇð¿N’þ¾`ÄøD&”>aý9(ö½ë8hˆ”w€¾?žÒôc>ÉŸ­VÍ ¾6X¶5¾ÎMJðµ>ÂZ­ù6Ù¾b˜¦¾¾¹*Àû>üsØ·Þ¾¢ôœºÚ½ñDÑ…ß7>‡>3/€0¾äu¢ò5=ç¤S †HP>Š!ëú¾¢ rªÔÆ>ÅÝÍ^c>Au/0羸ÊØšñ>Šæ*tG>ö6¤þÏÁ¾||&€®>d_Óhx=ôG ˜e¾Ú±>3(>u€¯‰ær½àÃ[,±½5¾z ú>YÍ^ì(¾?0Ž‹]¾×÷ _Ÿ>¥êa1}'¾Ecì§w½¾ îåûŠÿá>KØÀ}ýÓ¾JL•òæ½øëgõí>TiÞåãø¾Ê…6­=ÊùÙ—Ã>ÞTb噆¾éøáêì|=ÿ-q²'A>µd Ðà¾ìaBÿ‘> ¯:¡•Ü;> Ÿ×UÉ9:¾€»ñÕMŠ>åúĸ=ÿ)£ s‡¾ê\;Ø¢Š>Ö¹:¼ë‹=Ìk70ݾ×ÆCm°PQ½ø&K¢¸½¾tå?™¥>;n)f¾ C¯ ¾üX€Ð¹­>¨¿—¹þ¾©m¾z–Q>‰¾Âý÷¾‹1{ÖC½è ª’Où>ð¨¥)¾Sô&f)—=î­˜Ÿo¨ô> ‡»ˆÃ¾½Èp÷1þ>ñÙMëb>ó–‚{2¾­¯J—@è>’KËöÝJ>A `ľjF`ä™>Ö›Ñ-`Ž=ö)K:¢m¾ù}䛪>sï,‘½Ó!ÓÈ·…¾®h¸µg>ð¢¸iž½ÿgF“Åï¾ØWÂOü>tÞĀ¾ 6—p $¾ 6Tbœë†>ƒ7hÝü¾«]dJŠÎ¾×¶-Íw>­rX¾HKàRƒ½ÝÅxÆÉö>^]U¾W¾½æ»J.=óõG7É>c·³÷ÎR¾ãR|vìî>I:S¸Æ>bUÿ6,¾¤¿/wÚ§>ü2{>/ã7Îÿƾü8ˆ™øÎ>B¥ÄÊ=õ*ú£¼W ¾ôé·OëF> lý$"ç½Ó©<–ØF¾ª:óŸ>Ü åŽÐ½þ¯+g¤´å¾E _œ{ü>_$)¨+†¾ }ÁxÎø¾ öÂ(Gâ>„hÕž¾/Z Œ¾û‰Ü>NM¾Á.c>½åͤϼ>Ís¯¥ƾBÁ×Éù*=íƒûêã2>"ÖÔ¹C¾¿-UYm>בâY‘è>wÌ]+Iݾ‘®Î£íæ>fÈq’å£> cþxÿ¾@Ò€=^>È…}y3œ=ü E¦µ“¾¤ ;Þ4>õítáˆ=ÈoéiTEƾÐqE § >C‰Å^n½ö/.Àˆ–¾çÕÆŸ!x>÷ Ýíb¾õV0&6¾~ï:f>›™êí³¾5Ñ“´ ¾(Š“5`›>ùY¼; {¾Ú0° ½ön7 >‡±>}üEµÚ¾¹è¹Bë)=ÂXòº÷J…>óˆ>·µ¾ˆ}¢P]=úÖh¬óÎ>qÛÙ¶¾+eÕùõ> š†»½>0[Õ‚ò¾”ÎA­>ÝP߈>`^[ð=¾Ãßœ'¹º>qξã»è=ó¬ÿ A¾Ä«g>²È4Ö‰½Ô¶€ÅS!—¾­([£ùu>¾B$ªß½ý/ØÁŒK¾ ò&&ù>< xDÕ¿¾ ûz8¾€®¾•)Š(ï>‹!A{¾)ÄR¾¸ŠmÎ :>«Àþlݾœ+óà½ò43Éš×>©Í—™G0¾-s!¢Ä=ÖöF<åø>›×y®Z3¾¼‰_ÉXÅ=ý.ÂsAý>¢uµÜÁ¿¾3…†, Å> ĨqÌ>ÌëÔI^Ô¾‡;XŠç5>øG¼QÜ_>.\#2‘¾·ÇÞ«æ&>^lÖåÓW=ó¡êç–|î¾Ïôk*9h>í\]\ ½ÍÛ蕾äÊ{.®£>…×Õ§¿þ½úß\O´f¯¾@Ư°ý>e릗¾yûÖª»Ž¾„>êzË0>‡ÌTHa¾Kô@{Õ@¾Á®#ó“|>ä«)îVå¾·Ûemu§½÷iɉü†ÿ>2+z;ZS±,yw½¢;`t­1>‚Pë<ü™¾¬=KÌï=ö5{ys>ðJ jp¾ÑÞÈ@>F{Ñļ>ž8ã.>¾ƒ ©‹¡>â…°‡È> id/÷wß¾'1@$[j>æŸy”=ýZ_ì2…¾ÃÙÓÞDÿ>eÍ´‡f;=Ý\zܾgÝfNÿ/>Wzk ½îF’.’Y¾*vÐÅ>[#£aªS¾yeÆ Óã¾)ÿÚÎ=T>b*رd¾ ¹1†ÖR¾ *²fŠE>fÑ‘Ö['¾þ ô|•?¾êJ¿>k¢,4¾ûº–h¬ä½ðUÿÒñÒ>{þDxã¾6ÎÄj=ÖjòJ‚´">ª‡tYM™¾”®‚o¸´=ûG’œBÞ>ùrѾ‰;‡ù>ÿäq«Š>Ï`ëÙ¼j¾‚¢™²>ÇK¿ý‘Í>”Jü³¾ºŸ)h‚>ÆEú=û üĆýQ¾œ½ù7æ>‘íÁÎlZ=ÙMÞ—òhn¾OŒ3ZŠõæµ½î,ÅÇMå¾5Ò…>HêæßϾùýïðI ¾gÜ«oDû>PŠÒœø™¾ ÑñRðþ^¾¯E\G¥>kývËÒ¾dE!œ%¾p§•Uü>K¼ƒ$¾M͘(Ú½ô~‚/‚ÕD>íH>ÓÛb¾‰gHîÞ\=šÁœÝ -2>k|¡Z§<¾¿n =õ:þâœ>-2Ûn· ¾£c<^>«kHFa>LÌÄQûÖ¾gñ‡éB°>]…$°`> Ò4u_7¾K)7->'>Kø¬‡÷;>G½¬u¼¾P’((§Ö>ûÐܲ‚ =ðƒÚ9 h¢¾‚BÓ >+Î,c/½ÏMä38>æ¾ï(ÑÂ[H>HM.ú½ø%Ð"SXû¾¬‡|¯hê>ÃQáÒ¬¾ÐSDÉ+ö¾Óã˜>jn&Dñ¾é‘v½¾ SpÃJã>:œ.á/~¾jis©¬¾ª+…q>8ÖŽ[Ž ¾­§|%½ï…›«b/Ë>n*£–¡¾ ò»Cý=И-éÖ‡>énÿA ¾C @; †=÷Ýàå¥2>¾3²‚¾¸OwsÜ>o¤Im²>€®ø>“¾d üuBx>VYPQ> ¨˜å3o¾¾D~õ™>4ñ‡þƒ>›Î;¥Z¾\ß×¼8Î>»¶³ÌU=ò<§‰[O³¾µ“>Êã>ªOª ½² -.t¤¾[ÇyÇÓª>é"’½ôbŒüÆÓ¨¾`ü+R .>}ƒâ ô¾†PÄ2¬Ï¾Ú0šÃ|Ü>MÈ,)`ú¾ Tðž•÷¾ ¿)ãPØÏ>]ÐkÉ´á¾3ºÁæZ#¾ž9î§4>¯HÓ.ÐŒ¾ÆŸRd‚½÷ëÒøÈÓ>HÒá˜jî¾΋@Ïÿ½Ô 7ð´È`>5n‹°““¾:“¾Š•=ëL†÷à}á>„Ì}’̾ýÎ~<ü]>Ygª 9>Fñ'£A¾Çuª²æ>ÎÂ!OqE>“’×¹›E¾lC„¹+>|‚c’ê> óV‹²A¾‚ ó'š>+O¬ôSÊ>T'€×W¾ çûòùö>_`ë ü=í=–Ìí¾W±pr³ >±ülY ½ÍZA¡q¾ ÜÞ°u>¬2·Æ½õËw¶™5¾-5PÅ1ò>‚!“RÀ±¾­÷ Š¾Ö]ü¸™U>D”Çg ƾ úôµÏ…-¾2î"YÕ>[³q Â1¾Ñ >§¾îêùÂÞ>ÉcgYFݾ=@8sýûâß B¹>’õB[ؾ0$¬üR½âù hL%É>Á4°]\¾›lìú€8=àxíE5^>`;¦äs±ÃwÎÃ=ù²ûÊ>~²¸yR€¾°éæÊIÞ>EþÆ8j?>-Æ2©d¾N¥ò"ƒ> 7Ñcée> éˆÖ_¾Kª£²>C„F>:>#èí»¾¾ªK÷²l>†½/0Ì¥=ù’#fÝá¾oï7Ts>WBž:4=á ›LA¾¤õú¤ac>§Æ‘aQ½á;dá—¬¾Twf9¢¨>nHši/½ù „[,s¾Œé ó>£¬ÿÂ'¾è26šq’¾[1œÈ û>CæqèG¾ žN¶ÒŸ¾ ¦ªÎ½h>Mû‘>kW¾ßf·s¾ ÛÖÛ­k>ë<Ôò±¾hK6½ü&3xyÊ>©Ål¥ßU¾ÞBjòሽçx?ž?ï=>‡kŸêì¾3])XÖ¤=ÓH •é×à>殸þÍ$¾ ^á?É=õ5•ç>SDƒ \¾YowÔ5<>q !àã>ZLÓ:A¾4Ƨœc> &Š†+L> °™k}¾Y/šÑi>‰†(GÍ>ï)T¹;¾Rf%ul>×Ð]›†>^¾Ôº…ľ/ê-¹í°>´–åK\s=óÄ cµ½¾ÕÎŒm¾R>(s„h,_=É4 ”Ìö¾áY°Ë>* ÿ[F@½é~èç§5¾½èO˜Çx>²r:)¹½üZ*Š¶¾uý‘Aú>»®A«Ã7¾³I±ÔÙ¾xÞMÓ°>D4¹â s¾ Ó!’“r_¾ ˜Â8H¤>KQk€ûf¾·ÏÆçb¾yhðn >Ò¬X®îï¾·5Þ½þft[k¬>ÞT0pÁj¾]['n¬o½î‚D¯…ý'>sû-m|-¾Ÿx£A7S=nŽáP»-y>› 0†Ái¾vF„=î˜NV´ÝÍ>\äßoò;¾ÛóPJþò=þ73yË-Á>Ãÿ—V›”¾Ì^Wë>KX³$ùÚ>Ûü`@«[¾E½·g> ç!þl> cX2ÐÙ§¾GñXðQ¼>¶êÚ¿_>¤ŸµÄ£e¾ÔÆC^%>˜EÍ-–g=ÿ/aà¾ï±9³M÷>'÷ï6=ð±„ÎÔÑ=¾èf‰Á•>ZÇ>Öe=À>ÓJ¼òè¾æb|f>,{žù”½é+‚'%ìM¾Ð@ª>— ZÆeq½úñ-ɽ޾eKEJ˜ß>–¾ ‚ûµ¾k0D ó¾¯ÍKZ3ð>)~ãÕå¾ pNľuR°ß˜>O :ˆ¦¾Ÿñǯd‰¾ "6îñÖ>Ÿ@¸ã•¾{j×ß½7¾XH²×>XÍÁA¾¤yËÞ´½÷J21¼>C³èHü¾Q­™µ¬ ½â¯Ô!V9>ΣçÄW´¾>ÇËîh=Òœzè7Yî>/ˆæ«¾Α‰ÁüK=ò‚r¤)‹>ßìxv‰@¾ÿVRœ18>2èÁ#¾>v@ ü-¤¾ÍûçÚ>@>Œo'Îó>ÌZ/ì^Ò¾9b¯LG> ¿©¬Ÿ+> ØB.[ǾAÒO|í>FP_ú8>¿X`k$;èÇÖÆ@R>ñUdž¤>cqŒ–t·¾0õá »>Y/t3Q=õ³]S[j¾*ü(ß>wiò÷G=àÝ'OŸÉ¾µ^i˜I.>F“צîQ½Ót-¼=Ö ¾ü<çxx>Â~Ë; “½òfà'ξùp±9Õ}>çôf Ð×½þæv1ÛÕl¾´rXôS>´÷5^xF¾«ckŒ™¾4ÿÓK>(s#üÔ¾ š…rR4H¾9­T¶>Cä‚6¾˜ 4dÞ@¾ Qþ~âDÜ>rOÉ7²¾.µ…Õï¾\+lìvÊ>r#UYɾŠÇ>‘½úpoÖÄ%l>Œ6œšy¾¦hĺhI½ëáj£Y™>Wwlk¾|Íèñ—½µÈЋ%`´>Ø×Ìeо "ÇÊšu=æP¥§ND,>±xx07¾KQ3ÅÊå=÷{Áuž>Y>ðŠ\ T¾>U Ì u>¾¸«5.ô>Ú6ÃÐù¨¾áíx.1>‡UOúêE>obí]´˜¾5àhX E> YGÞ1>> µz1²Óp¾:°T[>>Îè–ÅÝ>Gh²à³¾ñÅxé>ƒ0tñÆ>£ØŒçV½¾]1u—l>µFˆ†=ù³í´°À¾ÒÞ"ƒè>­Ýý--{=ëå=´pm¾]46$ô>hÈü&Õê=Á bm*Z¾ù[&È>ãSµÅ«½ãDÚ°³‰€¾XÓúØ‚b>,t7¸½õ<'3……z¾€´wÆ3> s–•EÔ¾H»Dn+ƒ¾vyé->¸ùšÊá@¾Ä¶°Ü;¾?ÑGáÛZ>oì÷@)KÞwÿ¾þND@tB¾ ÊúœC#>L˜Àî¾TÉú¹¨¾œ!º«>µUg^œ°¾|^Ú˜ ƾF˜)»ï> ‚,U]¾t {^)¦½õªš«j“Ã>'€¨°Èݾ7ðF~…L½åXÅøÑ!b>x ѯ¾Äñ3¼:=•Œã„¼ï‰>­óÎ"ƾí×I†q=æŠî/TD(>!ïêtï¾2"éÓ=ö >ç×­]>f¤e§©6¾mï>H†²‘Ë>€™~Pä¾°5ˆ¹h>a’.Ü>t„=#H¾bºIŽ”> GDã?®>GEˆ þݾð²xKnv> ûÌñÛ¾)QÜÔ½ô>ªü“é­‹>;.B æÖ¾Ü,¿š>·È³¸`>VO×SF¾VÑb‚\>›ÈÀÔ#—=ú¯<èQÿ¾›t©q¤>T4'ãåæ=ð’lî[¾¬—s•JÊ>Þ’ÛQ´›=Ù£]1Ôš¾Œñ"ÒS>9¼÷½ÍÎÌ•qA¾?•b)DC>b'„wwÿ½ë‡&HOd¾ÇÚç®Þ7>Xß°Þx½÷¢Ç†ªN¾);mÊi>†a(Ÿ•¾£„<`²¾geÎáý`>¬ÖrnU¸¾PmÊ*/’¾†ÝÔß> äªa¾ ÐǬ^G¾‰hPþ{”>4yœè“¾ÓsÁ-/¾ êBïE¦µ>,å+z•‚¾ÖáAý¾šf\!¯>ôûÿ¨¾R!(±˜¾+LÊ€¡>Œêü´ª¾ËüêgÈø½ÿIcÜ|F>÷Œ^ÈÀ$¾pÌ„âh’½öѬü>6v˜GÐ0¾ïÏ;â>R½éÁ#ƒ¢f®>KÓ<î4L¾Gƒ×˜½Í°ró¶>9ß×î¾vßHuD1=Ö;…˜ѹ>0y¤¢¹¾|ãC¶w=íLuZ¦D>ªq¹þº¡¾YÇŸ´O=÷–'¸ ;k>2nå˜a ¾ õ‚Ù—>)k+<¯s>î6ò©¾’½\w>hW>8g>ïßN‚±AïAŒ>+BQ¤Þ¯¾$Yƒƒ,> sS$œÓš>¦&ù­W¾/ŒíLU€> K*$“> Ô½îkо۸ƒnÇ>ãHl8ƒ,>è+¸ Ó¾Ï5R¹]>¶ž8>æ-Ô~¾eý1ÌÏ\>!Ç'î49=ý©]O* E¾Ø¥ƒ†,K>•;Ëœ=õr­ŽZܾ(¼é°.½>郺¼ÌV=êeòc¥Õ¾X Tž€n>?çðœ=ÓÔË®ø%¾hCÂgÃæ>27¥P}½Éæ¹ä¾[gÖ5i>%OÛ¯Bì½æ²ÙaX½¾3…¿”L~>÷…úF½óW ›gõm¾òzFj>§Ol+°Ú½û-°r”¾š•­~ß>6~·t˾jjï›’¾-á9ykÀ>£Ö¬LÍí¾"XR w¾®”$Qª>ðq1þ6¾»[_(·ñ¾À ®Zñ>‚ûྠ2MýÀ2¾>úò¥\>)á˜-£Š¾„#-Èç¾ ¬eY3>Ñàx&¾WIŠ $¾C‰¬:æM>çÇtÊ_¾×|¯K+‘¾Ê{ueÆ>š¹$X̺¾AÑs€ßK¾Ec å`9>1ÍÍÒ“B¾•RŽ C÷½ûp»ÉxQ>®*™÷¾Ñd'¬ŒÒ½ôLØ­ÄxS>­šúɾõ`sbW½êOCô³>[Ôê.«¾Ð0yf½Ø!ꞯl•>²©é_|¾óré– Å=°¯í# W>®&3¡Ç´¾ÍŽ·=àF¨J>¸˜NhÞb¾³^Õˆ=íê­)ˆ>°¥~^ ¾53AÈA¯=õÀ0ŸÄÊ>—r””W~¾ÃÎùi¢=üh–wüæŠ>n»©Sx¾9ÃYßá>tt€Pa;>7×8JV¾—U *Â?>ž«‰õ(>ôE20·¾Ý OR‚º>°§V³3M>¥z…‘ÕŒ¾ <’ ò˜> ¨Ë˜×ds>LÛÝ i0¾"—ø:Š‚> …7 ,n> ×ÿUm¾#©ãÄ.>"e’­t> :î¾3[¡³l>s?mlÞ>+‡óÂ>R¾åÙë\kn>³å ¡µ>FËèrº¾¨w“÷·?>ä©E؃>[¦cDŽ~¾Wç"4ò>Öz§==þÙ0”ts¾ôטÚã>'M.Y‹=ø÷"ÍM¾€R9p>ošn[d=ó#¾û&“ù"÷>ÿ„s÷h‰=êt ¨¾fKcNº >ÛH<ø=Ý›¬ zc¾©!>l>¥®Ž`#]=º¦l¢2c¾-‰ý«r>^Ó¼N÷~½ÐY]Ã~ÑM¾R¸æ¾2E>ã9¥L½ãsQnx¾ˆbèÖÑ>æ¦s½îŒï9{ˆ¾²øØ„F¨>$  t}i½ôºv<ÊLï¾ÓcR'ˆx>™ÎÇŒ?–½úm.Ÿ¾ê¡þù½>>ÿ/‡¨Z+½ÿL¨°˜Æ3¾ùv‡ck>TÅúáÔ)¾3jõdƾæÕ>š×0Iù¾¯mï_÷þ¾­¶Å6>Ѷ…äJ¾¯BÂÐÛ¾üÍ8º¢<>úSã3¾ q?˜‹ò¾òì¤Y/‡>ÿr¼ó4¾ µ“(9©Û¾É‹>>…> K2¾ æ?ÆÚL¾ ¦r˜9B>g›»„Š¾RŠ¾rc¾ ~—]Îî>Áí÷¥‡¾%#½“E¾ QoB…3Ã>÷êl/¾þ¨³Él ¾"NÖJ/v>Òt±ü¢¾íŽb°×\¾ñ½\ü:>¡ÛT~Ê}¾ÑÔS«îI¾ÀÇßU„>f¾ÏZ2¾«‰·°"^¾î×f>!—²!= ¾zž‘‚½üÅôÚQç">ÓOik×¾?™jee½øoäÒ¿†ƒ>{§,äx¾ùr;¿½ô"¸.°#>ãØØÓؾ¨~ÁÝ2ã½ï»Plï3„>´Z®ü z¾M¿½ât¢½çI«úÓÁ>E”Èx%,¾è¿Á”_½Ýâ<6ª9>ÐÊOé ¾yÖ$ÚÓ½ÊÕ s›øä>TaöŽE¾ ¿/­=¦sÏ  ºÌ>Òû–-ä¾~ÎŒì©=ÒżcËØX>LuõOõ€¾ó'åD´Ô=á:~d¢>ÁAíÙQ’¾^_k¹=èìPL‚ã0>1Ù&c[¾À¢ØÊi9=ð;¼ƒ=td>ž¸rñ"`¾UL£Çk=óìs 9†p>@@ꬾkß“ æ=÷ˆ¹‰cÉò>ní]@+¾´Ê‹=û ´¿­>ÓõÒ7¾öGÇJ/ª=þlJzÜM>5N!(:¾04´+'>ì«F õ >•Óå¸ûN¾bÿœ&d>Ž"ïl˜>õYn¾ŽÇ&mg>$.î5$>Sl øt¾´ 5„K >®˜Á$ûÇ>±3vð¾Òþ,°ô>-ER¯×>«à¾ëôUåwÆ> WRUä§>lGµÐÿ!pUÊ> ¹ˆÓ‰Ö>Êó9Ïþ H±@¬> csí†^–>(ŸØ R¾Òj‹¨î> ³µÃVÇ >)m]Eý¾á$ÝÄD> øž7> Ñ>°[¾Iꇑ÷>1c®Q¨> ”ÿ²4 "¾š‚sS>/­Þûš> \ÒU›'¾ ëc£áŒ>Áí˜=Þ> &¶ó‰!¾ÿ˜lcÆÌ>LýÉÑí‹>õQZ‡ÐR¾ïîŠ×‰”>Ó|äiEs>ÈK­¶§…¾ÝÌëE>T±âDw>Ÿä˜bоÇ€š«>гïY±>| ÜÆ‚¾¯?Ñcnn>G”<΂É>^‡Ž†a¾”µ0ð»>¹pRÁé >F÷—j¾wþéÅ=#>&r·O_>3fÀs\¦¾YlÎaW‘>Ž¨38 •>&žƒ\'¿¾9DpÑú{>òA'| ›> AIhQž¤¤Y‘>QO.Á4¼=þ@©çξôÔ!}?H>«ÿzý6=üMÖey®$¾Ñ€G$7>G>àG´=úhÈFÅ4¾¬vŠZÖì>TdÃg›V=ø‘J~–C¾‡3uÞÃ~>¢ŠBð÷Y=öÇï•¥?¾aŠ˜m K>ìÅ®L1=õ íº°.i¾;°O¡>3#–ü‚=ó`›"årU¾°>uÒ,?Ü*=ñÂÛÞœb¾ïÈó¸¦Ù>´ìt.=ð4(œš[¾Ê “ÅÒ>ð‚bÑ.=ígËBG»Ý¾¤¶d¿ç>(à(¹þ=ê†1Ë!NÒ¾ëMp9>]ðÛf&¸=çÂãDùÜ¢¾[¼ðbó>èØŸú˜=åæÈ€!ø¾8jBÁ¯¯>¾×ñNín=☕•TѾä+¶Á‘>êË Š¨Ó=à1\úGÔ¾ôXÿ}$>üÁ!P=ÛѲë›Ö¾Ôµ>;>:jò9ƒ=ׇRV§ã¾´ÕÁä4>^5­MÊÇ=Ól:å9BF¾–èÝ >i-Ÿ²=Ï+%f¾zj|²ú>ž0 >ºþ=ÇülµÝá¾_`«¡Ê6>º‰ J/b=ÁJ~ÈîM+¾EÚl63>Ô‰N«\&=¶&]Ÿ‹ö°¾-ù¿|2>ìI¹×-/=¥gH§ï:®¾µÇ!Nk>ܘ\®G=K–³Í¤¾:2‹†*>J"¹ ¦½¢˜Ðh2â¾ðìËÐ>&œ/¬j½±ÔÙ6ñϾߣ(ÿ¾>5ó뀽¹dVnÕ6¾ЦþeÈ>C2¬çX½¿þ …ˆºê¾Ã…tÍHy>Nˆñm‡R½ÂÏ"í°3¾¸OÈ›?®>Wé]mE²½Å%°ÁaF쾯 “ësô>_}SÎØJ½Æÿ‘b#%¾§Õæ¥#H>e9; ¹½È]3SF¥_¾¢‡¦LÂ>hä$B[ñ½ÉA&Ju Ö¾Ÿ?Õá'9>jÜ•÷J½ÉªåÞY$뾞 бŀ>jþך½É—ŠÿOS„¾žËÎÜ‘Ã>iH1[D¨½É ¡èœè†¾¡Žª>_>eÈÕ׽ȮâjUa¾¦Y”l“V>`T KcH½Æ€±Z¡D%¾­ÕC>Y!J|ÞP½Ä‚>13½6¾µÀ›HO>P“Yí£½Â ª)æ¾ÀaÕ¦å>EzÃPõ½¾5´ú+n¾ÌïÕ´<“>8!€ÛÔš½·_z3onq¾Û\ÅÏ­Ë>);I/ν¯+gÙÝ0¾늪m¢m>gñ:ɽ›sÁEm—¾ýŸ¥Oè>’0æñ§=†½k©á¼¾\ñX>ð–iy7=ªì¿øô¤X¾&Èf¼>ÙšÅ'êŽ=¹ Êy)z¾=è}>À`ojì=ÂɯÓûŸ9¾VŠ6Ncù>¤ëÒA°š=É„Îà°½¾pÀãB&>‡½Y~=Ð]ˆçÁ¾ŒB3~’>fþ®r™‹=Ô2»qÔÔ¾©'@@X>DtŽ®n=ØDp‰Ù–¾ÇM.Q°->ncØ4=ܑƇzÀ:¾æªàU±>÷Ôá¿yÒ=àŽ.’­,¾šŒº>Ín:n=âðÙƒž¾(g ¤Eƒ> `ÙÇ>=åo±|¹(¾J“éÆ­û>prmdj =è èQ÷F¾mŒä®¶«>=¢9å³Ê=êÅß*ÖB¾‘iùzd>ÐÜzzð=휲š!}k¾µ1&¾Ás>ÎÀ#«+Ä=ðG¤ö4 ­¾Ù¥g‹>’Š~a‰]=ñÏr‡ÀÓ¾þ<¯“Í>S éÅW~=óeÁa¾"õ‰W–> 82Hå=õ÷Œ­A¾G®gK¡>É¢{ ³y=ö¹¸ÕmS¾l ÿ$(È>ƒˆ€n’=øw9[Ôxk¾;›k[>1§–)=úBŸb’ ~¾³°¸è¥L>ßþ–o4¬=ü|øê¾ÖØ7¹ >ŠoÂÒ­=ýÿZ^›X¾øt(‹íx>0É7w‡…=ÿðâî¾BÛ!ì©>ÒþâDZ>öw SFA¾8Ç·5~>pðD×û>ú…-`¯”¾V܉‘IÈ> ŽÆ!¾>@‚ß É¾s=‚S!>Ÿ¬®§>A]¥hq¾¨}ÅÔ“>0J›¹ >'0`Cº©¾¦t¬9Í>¼NãæÅû>@Ý/O¾¼*Í.¹>Cø¼Öð>]~p“M'¾ÏžÏrÕN>ƳmcÑ>>g(1¾à`$GÅÿ>C“ø?~T> ¤ÚÈm3Ò¾îr;>¼/¤¿½> Î"7Œá¾ø˜*ò¤>/Ñ¿·²> úÁÉØ@ܾÿŸDC><ŒPüxÜ> *<Ù±í¬¾Û^C£>Fl 2´>\8/À¾ ˆåÀ> ן&TI±>Xª¸zž¾ý!êØÇf> •~¼S>c0¿Ä¾ó£jy™å> HáÇѽÁ>þlJ¶¬¾åy ©jÈ>ñÄ0ŽZ>šEN/Ó¾Ò7Ðs4>¤ª‹é>6&L{†Q¾¹¾dCl>#Ö$Åu>ÑÚv+/=¾›¶¢º`Ë>­2ž\jƒ>m»®`=¾wîGz§>,@§c«>¢±¿ã ¾N)} I­> …né$>¡J}°£¾“j•a> ߀M)v>9;{€¾çaH&I½=üÖ-Ü7Ë>Ϧq¿ô¾©÷ßßû=ù‚Ç$VÛ>d…gS¾e˚ʾ=öß0†ªç>ö ŸÉ„¾¾ÍÉ? ç=ò¢8˜\}>…R  h¾Æ”oË4Ñ=î,dxð˜i>{'¯÷¾k @(I=æððØ”Ñõ>š"8Oé4¾®`›1=ß'ϲe{¥>É,lQ¾¼âKÃf=Ð-xºÐñ>ŸEò 7#¾*eíž=Ž´u¶Ûk’>°ƒ>¾®1½Ì÷np•V‰>‘”¡¯¾*ƒ.ºp½Þ!ÇéÑ)J>Š >g¾œ¹‰¿ëp½æûŠ3žÖ˜>m¨.´Ý¾Ze¬±½îüEI¸‡>Ò+&Ï:¾g ÷£ó½óˆ&Ì›§•>/Ùª(ø¾¾t¡ )B½÷™éUW]Ç>†:š>Ù¾ £gå;^½û²†Œ>ÔÅð•¾Q{:˜~ã½ÿÏù¾(¦©> ïÖ¿D¾Œø…Ø;ø: >b->X£úUô¾¿&ÇÛsø¾ GàÙüÚ>›ããM¾çù=#@Ÿ¾ Áì å>·øaá˜d¾nDgç¾)œÇÊL>ظlÝy¾ÀõOƾ 6ôg Ç°>ïb”¾*Ûjù;¾ @µ„OG>úyÜ/¾^™$ؾFHe™¶>ú‚ ò}¾ T `à@†¾"þqSH>îÕ dZ¾ 9ðaÒo¾kGŸ‰h>ÖüN¤ý†¾‚˨V”¾ÀÁï?³>²«P´s¬¾Ò×&âœÉ¾ o±ÝŸ>q|o¾‡r|;Óï¾ùªu‰Ê>CíLT¾-d~›ä¾áÕ,×*>÷Dz.½ýˆþ˜›y¾Ã?ñ$å>U¤òU½øgσïâ¾6Ëøpü>5‹ÍíQ½ó˜ª>9) ¾nú“£ôM>¿h \Bò½ìú›î˜³E¾7×ÉÈ°^>:ʼH‚†½âšn^þ÷²ðÒ>§|}>©½Ð+O^€Ç쾫ìò"Œ>_š¿‚d=´v>¦ì¾U‘#×B>Trã…=Ú™¸ÒPv¾óvN˜ð…>”–e¾8±=èî¼ "1¾„½7uÄ>ÅËüÚ¹€=ñ€°8è³É¾±'±->è1 †=öõå_‡cà¾~÷éºè>û³÷ûk=ükIX©‡Ì¾å§ _«>Æȶ¶Ø>ï±ä)ƒ¾=^i|>÷e`Mÿ>¥ok¾„ù1OXØ>ßàœªÊ´>VªÝ¥'¾»Ö æ¢X>º™IÐ> 9xÑF¾áLˆÕ>‡ä]ž«Í> ¢V ™¾ô掦h>rÞøI¸>8Ïcœ‡×¾õñ2™"Y> ø äýI>aýv¬ž¾ãû=yá‚> Hn- l>ž¿¾¾†û±ƒ>€æêY„>Ò9öƒÆ•¾…Gy‡_>¥ÍMÆ=É>ü¦4r¶¢¾7¶ “jî>¶¥a§|¨>[3}m¾Õ¥Š’«=ûk+®¦W>/zHÔÐœ¾^½ñp)=õHѦÞ>5¨ËÌ;¾Òà!Í=îuCÈp5>-yÜ3E¾1ðñ!‚=ágD™Ï.¤>ëÓF¨2¾{ÎÉZ”Ÿ=ÂI`Ehœ—>í²c•z|¾°ªÙó½ÐÁDœ{¯Ú>³ä™§,á¾Ð¿íO½ågÔž_ é>ge¿Z·ú¾ÛŸÜÅöù½ñ=¡Ç¦v>)U¶ÿ9¾Ò"ë¢s4½÷Å¡žbà>’»éP+¾´¡aÕŽ½þH{ß](h>l¯—”¾ƒ†’“¾`V_]>f!Cò^ľ?LJù*¾“RõÅú>­TÆvd×¾è¢MËÁ辺·s§Ÿ,>ÜNDz(Ⱦ€`Úœ@{¾ Óryé{z>òS‰šé¾£f÷ß¾Úc§\?0>îªR›2 ¾ üÓZNã¾æO¦?×>ÐÛ”Šß¾Íyc£+˜¾RÔxh9>˜Y±×Hp¾‚òkÐ…á¾±àc\/d>DÀYŽ¬r¾±:ä€!ˆƒå>ÕÙ§Ò½ûMߺ־@50xä>KoCìyö½ô4b'‚üe¾la¸8.K>¥e¸p|>½é÷›ƒ‡¾„‚æ¸w>ãË›Ïtú½Ö¥ÄÂ+Üq¾†Úì¾ >Ñè¬J=»±šö‹,¾r? >Óô—wh=âV&&OR¾Dê!ȼ>ü#˜­±=ðŸ? i.Z¾ý¢°“TZ>Ïyïbe£=øpI©^·¾›AÖƒ’N>‰TwŠà<=ÿs¦,­´¾\œ0ÖÔ>*Îwãw”>bJߧº¾ë "èî>´  !‚P>ûò:Ç+¾Äã65©'>(Ý&)> ƒre"u ¾êJ¹²½Z> ºf=v> ôÚjã¾ïqÌDô> ¢v,®¦‰>¤Ïuëì¾Ó›-RyB>‹GÒX>?ų›µ¾–LcâmºË2>ÈââMèM¾7â0ï>–ô§Öë>=Ô6Ti.¾µé¡hF‹=ùaœièÇA>œ±Ÿ…ľ|ÍÐq{=ñk5…ÓËÄ>ã:…£ó¾M(çì´=â§ÛÇÎ>}T/¾e÷Ôá¿ò=²Ap,ïÖ¦>€ŽOÖ¾]¹Kwãd½Üg-£òe…>‚ЪN‚¾4ÒØܽî·;Mx|>ã¨Á‹9Õ¾ìWå'€™½÷—K߀Ý>”s5Qt9¾…+^â ,½ÿÂ!Þt~Y>"9(ÿ뾨Ș̾èp¼Ø¯8>‹½º:éM¾`N†>UP¾ÜU]É>ÏÆI3œU¾¥’ *‚=¾ ·j°ûéÉ>íBh¾ ¤üìk‹¾s˜ œ—>ãfK~óǾ Òü÷Û˾…Àärèp>±uNé{¾ÖþØ¢<û¾<»}€zt>W6™:½7¾¸X(Ÿ›ÿ¾Ûù·ð‹>ÔP;vž½ú÷F ©2¾`óÛÜÓ>(Ã*‡ô½òK3í5³·¾ÈË+Ù×N>TÛç焽âó‹ÿN€%¾9–ùÀo>Y#9Y!p½¡¾e±8]¾7²p%|š>6SXÈ´=àÖ8ǧw¤¾:¤Sz>íl.Ü’Ô=ñd¸Ïצؾ,ùº…Ò>¬J€äØ=úQ7Ú´ù|¾Ê )+¬Û>î·„°’¨>‘x8½Ú¾TùضÞ>æ6ŽýϾ²™– ;o>j "_I> { Yµ¾äugFvV>÷J1’ªÙ>6ƒ†< ¾觃32¯> ävmueL>-[@¾¾K»Æ2t>¢8&Ž|½>ðó¶N‘ú¾e€¡e˜>6‘À–¤‰>´9ú5­•¾Ü ãs‡=ûP,Ý@±l>XŘÑS©¾%:2 £=ñû!y_0>Û`…¶°y¾??Î ÐÊ=àù"Ý\²=>8þY ±F¾+x ÓÑë½±Á9SQU>nØ…ê;ÿ¾ëiÁ÷k½åLôx39>z* u+{¾Iäf£½ô]Ík:m>XŸõš =¾ê¨°" ½ýåoHEò>ùPƒé¾-lg‘v¨¾¢Õ:.÷C>†Z掑M¾KÑuŽõ¾7squ–>Ò+yT"¾H€š‚f¾ ¦·écRœ>ê!üÛub¾ JkjÙ Ö¾tÂü>ÍXÿ˜‘â¾Í [` ®¾{x¥¼O>{"tq*G¾²´lÆg¾c‚Dmu>óiTš*½ü“ÎAp9V¾(ÑrÍí.>6d8 tz½ò¨U(¹­ü¾ÇÄÀˆ£ž>Djù„=½á‹ÿœ\²¾<±Q±¤>Bè­=ºm Ô°Öþ…\ÅJ>¬ÖrnU¸¾PmÊ*/’¾†ÝÔß> äªa¾ ÐǬ^G¾‰hPþ{”>4yœè“¾ÓsÁ-/¾ êBïE¦µ>,å+z•‚¾ÖáAý¾šf\!¯>ôûÿ¨¾R!(±˜¾+LÊ€¡>Œêü´ª¾ËüêgÈø½ÿIcÜ|F>÷Œ^ÈÀ$¾pÌ„âh’½öѬü>6v˜GÐ0¾ïÏ;â>R½éÁ#ƒ¢f®>KÓ<î4L¾Gƒ×˜½Í°ró¶>9ß×î¾vßHuD1=Ö;…˜ѹ>0y¤¢¹¾|ãC¶w=íLuZ¦D>ªq¹þº¡¾YÇŸ´O=÷–'¸ ;k>2nå˜a ¾ õ‚Ù—>)k+<¯s>î6ò©¾’½\w>hW>8g>ïßN‚±AïAŒ>+BQ¤Þ¯¾$Yƒƒ,> sS$œÓš>¦&ù­W¾/ŒíLU€> K*$“> Ô½îkо۸ƒnÇ>ãHl8ƒ,>è+¸ Ó¾Ï5R¹]>¶ž8>æ-Ô~¾eý1ÌÏ\>!Ç'î49=ý©]O* E¾Ø¥ƒ†,K>•;Ëœ=õr­ŽZܾ(¼é°.½>郺¼ÌV=êeòc¥Õ¾X Tž€n>?çðœ=ÓÔË®ø%¾hCÂgÃæ>27¥P}½Éæ¹ä¾[gÖ5i>%OÛ¯Bì½æ²ÙaX½¾3…¿”L~>÷…úF½óW ›gõm¾òzFj>§Ol+°Ú½û-°r”¾š•­~ß>6~·t˾jjï›’¾-á9ykÀ>£Ö¬LÍí¾"XR w¾®”$Qª>ðq1þ6¾»[_(·ñ¾À ®Zñ>‚ûྠ2MýÀ2¾>úò¥\>)á˜-£Š¾„#-Èç¾ ¬eY3>Ñàx&¾WIŠ $¾C‰¬:æM>çÇtÊ_¾×|¯K+‘¾Ê{ueÆ>š¹$X̺¾AÑs€ßK¾Ec å`9>1ÍÍÒ“B¾•RŽ C÷½ûp»ÉxQ>®*™÷¾Ñd'¬ŒÒ½ôLØ­ÄxS>­šúɾõ`sbW½êOCô³>[Ôê.«¾Ð0yf½Ø!ꞯl•>²©é_|¾óré– Å=°¯í# W>®&3¡Ç´¾ÍŽ·=àF¨J>¸˜NhÞb¾³^Õˆ=íê­)ˆ>°¥~^ ¾53AÈA¯=õÀ0ŸÄÊ>—r””W~¾ÃÎùi¢=üh–wüæŠ>n»©Sx¾9ÃYßá>tt€Pa;>7×8JV¾—U *Â?>ž«‰õ(>ôE20·¾Ý OR‚º>°§V³3M>¥z…‘ÕŒ¾ <’ ò˜> ¨Ë˜×ds>LÛÝ i0¾"—ø:Š‚> …7 ,n> ×ÿUm¾#©ãÄ.>"e’­t> :î¾3[¡³l>s?mlÞ>+‡óÂ>R¾åÙë\kn>³å ¡µ>FËèrº¾¨w“÷·?>ä©E؃>[¦cDŽ~¾Wç"4ò>Öz§==þÙ0”ts¾ôטÚã>'M.Y‹=ø÷"ÍM¾€R9p>ošn[d=ó#¾û&“ù"÷>ÿ„s÷h‰=êt ¨¾fKcNº >ÛH<ø=Ý›¬ zc¾©!>l>¥®Ž`#]=º¦l¢2c¾-‰ý«r>^Ó¼N÷~½ÐY]Ã~ÑM¾R¸æ¾2E>ã9¥L½ãsQnx¾ˆbèÖÑ>æ¦s½îŒï9{ˆ¾²øØ„F¨>$  t}i½ôºv<ÊLï¾ÓcR'ˆx>™ÎÇŒ?–½úm.Ÿ¾ê¡þù½>>ÿ/‡¨Z+½ÿL¨°˜Æ3¾ùv‡ck>TÅúáÔ)¾3jõdƾæÕ>š×0Iù¾¯mï_÷þ¾­¶Å6>Ѷ…äJ¾¯BÂÐÛ¾üÍ8º¢<>úSã3¾ q?˜‹ò¾òì¤Y/‡>ÿr¼ó4¾ µ“(9©Û¾É‹>>…> K2¾ æ?ÆÚL¾ ¦r˜9B>g›»„Š¾RŠ¾rc¾ ~—]Îî>Áí÷¥‡¾%#½“E¾ QoB…3Ã>÷êl/¾þ¨³Él ¾"NÖJ/v>Òt±ü¢¾íŽb°×\¾ñ½\ü:>¡ÛT~Ê}¾ÑÔS«îI¾ÀÇßU„>f¾ÏZ2¾«‰·°"^¾î×f>!—²!= ¾zž‘‚½üÅôÚQç">ÓOik×¾?™jee½øoäÒ¿†ƒ>{§,äx¾ùr;¿½ô"¸.°#>ãØØÓؾ¨~ÁÝ2ã½ï»Plï3„>´Z®ü z¾M¿½ât¢½çI«úÓÁ>E”Èx%,¾è¿Á”_½Ýâ<6ª9>ÐÊOé ¾yÖ$ÚÓ½ÊÕ s›øä>TaöŽE¾ ¿/­=¦sÏ  ºÌ>Òû–-ä¾~ÎŒì©=ÒżcËØX>LuõOõ€¾ó'åD´Ô=á:~d¢>ÁAíÙQ’¾^_k¹=èìPL‚ã0>1Ù&c[¾À¢ØÊi9=ð;¼ƒ=td>ž¸rñ"`¾UL£Çk=óìs 9†p>@@ꬾkß“ æ=÷ˆ¹‰cÉò>ní]@+¾´Ê‹=û ´¿­>ÓõÒ7¾öGÇJ/ª=þlJzÜM>5N!(:¾04´+'>ì«F õ >•Óå¸ûN¾bÿœ&d>Ž"ïl˜>õYn¾ŽÇ&mg>$.î5$>Sl øt¾´ 5„K >®˜Á$ûÇ>±3vð¾Òþ,°ô>-ER¯×>«à¾ëôUåwÆ> WRUä§>lGµÐÿ!pUÊ> ¹ˆÓ‰Ö>Êó9Ïþ H±@¬> csí†^–>(ŸØ R¾Òj‹¨î> ³µÃVÇ >)m]Eý¾á$ÝÄD> øž7> Ñ>°[¾Iꇑ÷>1c®Q¨> ”ÿ²4 "¾š‚sS>/­Þûš> \ÒU›'¾ ëc£áŒ>Áí˜=Þ> &¶ó‰!¾ÿ˜lcÆÌ>LýÉÑí‹>õQZ‡ÐR¾ïîŠ×‰”>Ó|äiEs>ÈK­¶§…¾ÝÌëE>T±âDw>Ÿä˜bоÇ€š«>гïY±>| ÜÆ‚¾¯?Ñcnn>G”<΂É>^‡Ž†a¾”µ0ð»>¹pRÁé >F÷—j¾wþéÅ=#>&r·O_>3fÀs\¦¾YlÎaW‘>Ž¨38 •>&žƒ\'¿¾9DpÑú{>òA'| ›> AIhQž¤¤Y‘>QO.Á4¼=þ@©çξôÔ!}?H>«ÿzý6=üMÖey®$¾Ñ€G$7>G>àG´=úhÈFÅ4¾¬vŠZÖì>TdÃg›V=ø‘J~–C¾‡3uÞÃ~>¢ŠBð÷Y=öÇï•¥?¾aŠ˜m K>ìÅ®L1=õ íº°.i¾;°O¡>3#–ü‚=ó`›"årU¾°>uÒ,?Ü*=ñÂÛÞœb¾ïÈó¸¦Ù>´ìt.=ð4(œš[¾Ê “ÅÒ>ð‚bÑ.=ígËBG»Ý¾¤¶d¿ç>(à(¹þ=ê†1Ë!NÒ¾ëMp9>]ðÛf&¸=çÂãDùÜ¢¾[¼ðbó>èØŸú˜=åæÈ€!ø¾8jBÁ¯¯>¾×ñNín=☕•TѾä+¶Á‘>êË Š¨Ó=à1\úGÔ¾ôXÿ}$>üÁ!P=ÛѲë›Ö¾Ôµ>;>:jò9ƒ=ׇRV§ã¾´ÕÁä4>^5­MÊÇ=Ól:å9BF¾–èÝ >i-Ÿ²=Ï+%f¾zj|²ú>ž0 >ºþ=ÇülµÝá¾_`«¡Ê6>º‰ J/b=ÁJ~ÈîM+¾EÚl63>Ô‰N«\&=¶&]Ÿ‹ö°¾-ù¿|2>ìI¹×-/=¥gH§ï:®¾µÇ!Nk>ܘ\®G=K–³Í¤¾:2‹†*>J"¹ ¦½¢˜Ðh2â¾ðìËÐ>&œ/¬j½±ÔÙ6ñϾߣ(ÿ¾>5ó뀽¹dVnÕ6¾ЦþeÈ>C2¬çX½¿þ …ˆºê¾Ã…tÍHy>Nˆñm‡R½ÂÏ"í°3¾¸OÈ›?®>Wé]mE²½Å%°ÁaF쾯 “ësô>_}SÎØJ½Æÿ‘b#%¾§Õæ¥#H>e9; ¹½È]3SF¥_¾¢‡¦LÂ>hä$B[ñ½ÉA&Ju Ö¾Ÿ?Õá'9>jÜ•÷J½ÉªåÞY$뾞 бŀ>jþך½É—ŠÿOS„¾žËÎÜ‘Ã>iH1[D¨½É ¡èœè†¾¡Žª>_>eÈÕ׽ȮâjUa¾¦Y”l“V>`T KcH½Æ€±Z¡D%¾­ÕC>Y!J|ÞP½Ä‚>13½6¾µÀ›HO>P“Yí£½Â ª)æ¾ÀaÕ¦å>EzÃPõ½¾5´ú+n¾ÌïÕ´<“>8!€ÛÔš½·_z3onq¾Û\ÅÏ­Ë>);I/ν¯+gÙÝ0¾늪m¢m>gñ:ɽ›sÁEm—¾ýŸ¥Oè>’0æñ§=†½k©á¼¾\ñX>ð–iy7=ªì¿øô¤X¾&Èf¼>ÙšÅ'êŽ=¹ Êy)z¾=è}>À`ojì=ÂɯÓûŸ9¾VŠ6Ncù>¤ëÒA°š=É„Îà°½¾pÀãB&>‡½Y~=Ð]ˆçÁ¾ŒB3~’>fþ®r™‹=Ô2»qÔÔ¾©'@@X>DtŽ®n=ØDp‰Ù–¾ÇM.Q°->ncØ4=ܑƇzÀ:¾æªàU±>÷Ôá¿yÒ=àŽ.’­,¾šŒº>Ín:n=âðÙƒž¾(g ¤Eƒ> `ÙÇ>=åo±|¹(¾J“éÆ­û>prmdj =è èQ÷F¾mŒä®¶«>=¢9å³Ê=êÅß*ÖB¾‘iùzd>ÐÜzzð=휲š!}k¾µ1&¾Ás>ÎÀ#«+Ä=ðG¤ö4 ­¾Ù¥g‹>’Š~a‰]=ñÏr‡ÀÓ¾þ<¯“Í>S éÅW~=óeÁa¾"õ‰W–> 82Hå=õ÷Œ­A¾G®gK¡>É¢{ ³y=ö¹¸ÕmS¾l ÿ$(È>ƒˆ€n’=øw9[Ôxk¾;›k[>1§–)=úBŸb’ ~¾³°¸è¥L>ßþ–o4¬=ü|øê¾ÖØ7¹ >ŠoÂÒ­=ýÿZ^›X¾øt(‹íx>0É7w‡…=ÿðâî¾BÛ!ì©>ÒþâDZ>öw SFA¾8Ç·5~>pðD×û>ú…-`¯”¾V܉‘IÈ> ŽÆ!¾>@‚ß É¾s=‚S!>Ÿ¬®§>A]¥hq¾¨}ÅÔ“>0J›¹ >'0`Cº©¾¦t¬9Í>¼NãæÅû>@Ý/O¾¼*Í.¹>Cø¼Öð>]~p“M'¾ÏžÏrÕN>ƳmcÑ>>g(1¾à`$GÅÿ>C“ø?~T> ¤ÚÈm3Ò¾îr;>¼/¤¿½> Î"7Œá¾ø˜*ò¤>/Ñ¿·²> úÁÉØ@ܾÿŸDC><ŒPüxÜ> *<Ù±í¬¾Û^C£>Fl 2´>\8/À¾ ˆåÀ> ן&TI±>Xª¸zž¾ý!êØÇf> •~¼S>c0¿Ä¾ó£jy™å> HáÇѽÁ>þlJ¶¬¾åy ©jÈ>ñÄ0ŽZ>šEN/Ó¾Ò7Ðs4>¤ª‹é>6&L{†Q¾¹¾dCl>#Ö$Åu>ÑÚv+/=¾›¶¢º`Ë>­2ž\jƒ>m»®`=¾wîGz§>,@§c«>¢±¿ã ¾N)} I­> …né$>¡J}°£¾“j•a> ߀M)v>9;{€¾çaH&I½=üÖ-Ü7Ë>Ϧq¿ô¾©÷ßßû=ù‚Ç$VÛ>d…gS¾e˚ʾ=öß0†ªç>ö ŸÉ„¾¾ÍÉ? ç=ò¢8˜\}>…R  h¾Æ”oË4Ñ=î,dxð˜i>{'¯÷¾k @(I=æððØ”Ñõ>š"8Oé4¾®`›1=ß'ϲe{¥>É,lQ¾¼âKÃf=Ð-xºÐñ>ŸEò 7#¾*eíž=Ž´u¶Ûk’>°ƒ>¾®1½Ì÷np•V‰>‘”¡¯¾*ƒ.ºp½Þ!ÇéÑ)J>Š >g¾œ¹‰¿ëp½æûŠ3žÖ˜>m¨.´Ý¾Ze¬±½îüEI¸‡>Ò+&Ï:¾g ÷£ó½óˆ&Ì›§•>/Ùª(ø¾¾t¡ )B½÷™éUW]Ç>†:š>Ù¾ £gå;^½û²†Œ>ÔÅð•¾Q{:˜~ã½ÿÏù¾(¦©> ïÖ¿D¾Œø…Ø;ø: >b->X£úUô¾¿&ÇÛsø¾ GàÙüÚ>›ããM¾çù=#@Ÿ¾ Áì å>·øaá˜d¾nDgç¾)œÇÊL>ظlÝy¾ÀõOƾ 6ôg Ç°>ïb”¾*Ûjù;¾ @µ„OG>úyÜ/¾^™$ؾFHe™¶>ú‚ ò}¾ T `à@†¾"þqSH>îÕ dZ¾ 9ðaÒo¾kGŸ‰h>ÖüN¤ý†¾‚˨V”¾ÀÁï?³>²«P´s¬¾Ò×&âœÉ¾ o±ÝŸ>q|o¾‡r|;Óï¾ùªu‰Ê>CíLT¾-d~›ä¾áÕ,×*>÷Dz.½ýˆþ˜›y¾Ã?ñ$å>U¤òU½øgσïâ¾6Ëøpü>5‹ÍíQ½ó˜ª>9) ¾nú“£ôM>¿h \Bò½ìú›î˜³E¾7×ÉÈ°^>:ʼH‚†½âšn^þ÷²ðÒ>§|}>©½Ð+O^€Ç쾫ìò"Œ>_š¿‚d=´v>¦ì¾U‘#×B>Trã…=Ú™¸ÒPv¾óvN˜ð…>”–e¾8±=èî¼ "1¾„½7uÄ>ÅËüÚ¹€=ñ€°8è³É¾±'±->è1 †=öõå_‡cà¾~÷éºè>û³÷ûk=ükIX©‡Ì¾å§ _«>Æȶ¶Ø>ï±ä)ƒ¾=^i|>÷e`Mÿ>¥ok¾„ù1OXØ>ßàœªÊ´>VªÝ¥'¾»Ö æ¢X>º™IÐ> 9xÑF¾áLˆÕ>‡ä]ž«Í> ¢V ™¾ô掦h>rÞøI¸>8Ïcœ‡×¾õñ2™"Y> ø äýI>aýv¬ž¾ãû=yá‚> Hn- l>ž¿¾¾†û±ƒ>€æêY„>Ò9öƒÆ•¾…Gy‡_>¥ÍMÆ=É>ü¦4r¶¢¾7¶ “jî>¶¥a§|¨>[3}m¾Õ¥Š’«=ûk+®¦W>/zHÔÐœ¾^½ñp)=õHѦÞ>5¨ËÌ;¾Òà!Í=îuCÈp5>-yÜ3E¾1ðñ!‚=ágD™Ï.¤>ëÓF¨2¾{ÎÉZ”Ÿ=ÂI`Ehœ—>í²c•z|¾°ªÙó½ÐÁDœ{¯Ú>³ä™§,á¾Ð¿íO½ågÔž_ é>ge¿Z·ú¾ÛŸÜÅöù½ñ=¡Ç¦v>)U¶ÿ9¾Ò"ë¢s4½÷Å¡žbà>’»éP+¾´¡aÕŽ½þH{ß](h>l¯—”¾ƒ†’“¾`V_]>f!Cò^ľ?LJù*¾“RõÅú>­TÆvd×¾è¢MËÁ辺·s§Ÿ,>ÜNDz(Ⱦ€`Úœ@{¾ Óryé{z>òS‰šé¾£f÷ß¾Úc§\?0>îªR›2 ¾ üÓZNã¾æO¦?×>ÐÛ”Šß¾Íyc£+˜¾RÔxh9>˜Y±×Hp¾‚òkÐ…á¾±àc\/d>DÀYŽ¬r¾±:ä€!ˆƒå>ÕÙ§Ò½ûMߺ־@50xä>KoCìyö½ô4b'‚üe¾la¸8.K>¥e¸p|>½é÷›ƒ‡¾„‚æ¸w>ãË›Ïtú½Ö¥ÄÂ+Üq¾†Úì¾ >Ñè¬J=»±šö‹,¾r? >Óô—wh=âV&&OR¾Dê!ȼ>ü#˜­±=ðŸ? i.Z¾ý¢°“TZ>Ïyïbe£=øpI©^·¾›AÖƒ’N>‰TwŠà<=ÿs¦,­´¾\œ0ÖÔ>*Îwãw”>bJߧº¾ë "èî>´  !‚P>ûò:Ç+¾Äã65©'>(Ý&)> ƒre"u ¾êJ¹²½Z> ºf=v> ôÚjã¾ïqÌDô> ¢v,®¦‰>¤Ïuëì¾Ó›-RyB>‹GÒX>?ų›µ¾–LcâmºË2>ÈââMèM¾7â0ï>–ô§Öë>=Ô6Ti.¾µé¡hF‹=ùaœièÇA>œ±Ÿ…ľ|ÍÐq{=ñk5…ÓËÄ>ã:…£ó¾M(çì´=â§ÛÇÎ>}T/¾e÷Ôá¿ò=²Ap,ïÖ¦>€ŽOÖ¾]¹Kwãd½Üg-£òe…>‚ЪN‚¾4ÒØܽî·;Mx|>ã¨Á‹9Õ¾ìWå'€™½÷—K߀Ý>”s5Qt9¾…+^â ,½ÿÂ!Þt~Y>"9(ÿ뾨Ș̾èp¼Ø¯8>‹½º:éM¾`N†>UP¾ÜU]É>ÏÆI3œU¾¥’ *‚=¾ ·j°ûéÉ>íBh¾ ¤üìk‹¾s˜ œ—>ãfK~óǾ Òü÷Û˾…Àärèp>±uNé{¾ÖþØ¢<û¾<»}€zt>W6™:½7¾¸X(Ÿ›ÿ¾Ûù·ð‹>ÔP;vž½ú÷F ©2¾`óÛÜÓ>(Ã*‡ô½òK3í5³·¾ÈË+Ù×N>TÛç焽âó‹ÿN€%¾9–ùÀo>Y#9Y!p½¡¾e±8]¾7²p%|š>6SXÈ´=àÖ8ǧw¤¾:¤Sz>íl.Ü’Ô=ñd¸Ïצؾ,ùº…Ò>¬J€äØ=úQ7Ú´ù|¾Ê )+¬Û>î·„°’¨>‘x8½Ú¾TùضÞ>æ6ŽýϾ²™– ;o>j "_I> { Yµ¾äugFvV>÷J1’ªÙ>6ƒ†< ¾觃32¯> ävmueL>-[@¾¾K»Æ2t>¢8&Ž|½>ðó¶N‘ú¾e€¡e˜>6‘À–¤‰>´9ú5­•¾Ü ãs‡=ûP,Ý@±l>XŘÑS©¾%:2 £=ñû!y_0>Û`…¶°y¾??Î ÐÊ=àù"Ý\²=>8þY ±F¾+x ÓÑë½±Á9SQU>nØ…ê;ÿ¾ëiÁ÷k½åLôx39>z* u+{¾Iäf£½ô]Ík:m>XŸõš =¾ê¨°" ½ýåoHEò>ùPƒé¾-lg‘v¨¾¢Õ:.÷C>†Z掑M¾KÑuŽõ¾7squ–>Ò+yT"¾H€š‚f¾ ¦·écRœ>ê!üÛub¾ JkjÙ Ö¾tÂü>ÍXÿ˜‘â¾Í [` ®¾{x¥¼O>{"tq*G¾²´lÆg¾c‚Dmu>óiTš*½ü“ÎAp9V¾(ÑrÍí.>6d8 tz½ò¨U(¹­ü¾ÇÄÀˆ£ž>Djù„=½á‹ÿœ\²¾<±Q±¤>Bè­=ºm Ô°Öþ…\ÅJ>¬ÖrnU¸¾PmÊ*/’¾†ÝÔß> äªa¾ ÐǬ^G¾‰hPþ{”>4yœè“¾ÓsÁ-/¾ êBïE¦µ>,å+z•‚¾ÖáAý¾šf\!¯>ôûÿ¨¾R!(±˜¾+LÊ€¡>Œêü´ª¾ËüêgÈø½ÿIcÜ|F>÷Œ^ÈÀ$¾pÌ„âh’½öѬü>6v˜GÐ0¾ïÏ;â>R½éÁ#ƒ¢f®>KÓ<î4L¾Gƒ×˜½Í°ró¶>9ß×î¾vßHuD1=Ö;…˜ѹ>0y¤¢¹¾|ãC¶w=íLuZ¦D>ªq¹þº¡¾YÇŸ´O=÷–'¸ ;k>2nå˜a ¾ õ‚Ù—>)k+<¯s>î6ò©¾’½\w>hW>8g>ïßN‚±AïAŒ>+BQ¤Þ¯¾$Yƒƒ,> sS$œÓš>¦&ù­W¾/ŒíLU€> K*$“> Ô½îkо۸ƒnÇ>ãHl8ƒ,>è+¸ Ó¾Ï5R¹]>¶ž8>æ-Ô~¾eý1ÌÏ\>!Ç'î49=ý©]O* E¾Ø¥ƒ†,K>•;Ëœ=õr­ŽZܾ(¼é°.½>郺¼ÌV=êeòc¥Õ¾X Tž€n>?çðœ=ÓÔË®ø%¾hCÂgÃæ>27¥P}½Éæ¹ä¾[gÖ5i>%OÛ¯Bì½æ²ÙaX½¾3…¿”L~>÷…úF½óW ›gõm¾òzFj>§Ol+°Ú½û-°r”¾š•­~ß>6~·t˾jjï›’¾-á9ykÀ>£Ö¬LÍí¾"XR w¾®”$Qª>ðq1þ6¾»[_(·ñ¾À ®Zñ>‚ûྠ2MýÀ2¾>úò¥\>)á˜-£Š¾„#-Èç¾ ¬eY3>Ñàx&¾WIŠ $¾C‰¬:æM>çÇtÊ_¾×|¯K+‘¾Ê{ueÆ>š¹$X̺¾AÑs€ßK¾Ec å`9>1ÍÍÒ“B¾•RŽ C÷½ûp»ÉxQ>®*™÷¾Ñd'¬ŒÒ½ôLØ­ÄxS>­šúɾõ`sbW½êOCô³>[Ôê.«¾Ð0yf½Ø!ꞯl•>²©é_|¾óré– Å=°¯í# W>®&3¡Ç´¾ÍŽ·=àF¨J>¸˜NhÞb¾³^Õˆ=íê­)ˆ>°¥~^ ¾53AÈA¯=õÀ0ŸÄÊ>—r””W~¾ÃÎùi¢=üh–wüæŠ>n»©Sx¾9ÃYßá>tt€Pa;>7×8JV¾—U *Â?>ž«‰õ(>ôE20·¾Ý OR‚º>°§V³3M>¥z…‘ÕŒ¾ <’ ò˜> ¨Ë˜×ds>LÛÝ i0¾"—ø:Š‚> …7 ,n> ×ÿUm¾#©ãÄ.>"e’­t> :î¾3[¡³l>s?mlÞ>+‡óÂ>R¾åÙë\kn>³å ¡µ>FËèrº¾¨w“÷·?>ä©E؃>[¦cDŽ~¾Wç"4ò>Öz§==þÙ0”ts¾ôטÚã>'M.Y‹=ø÷"ÍM¾€R9p>ošn[d=ó#¾û&“ù"÷>ÿ„s÷h‰=êt ¨¾fKcNº >ÛH<ø=Ý›¬ zc¾©!>l>¥®Ž`#]=º¦l¢2c¾-‰ý«r>^Ó¼N÷~½ÐY]Ã~ÑM¾R¸æ¾2E>ã9¥L½ãsQnx¾ˆbèÖÑ>æ¦s½îŒï9{ˆ¾²øØ„F¨>$  t}i½ôºv<ÊLï¾ÓcR'ˆx>™ÎÇŒ?–½úm.Ÿ¾ê¡þù½>>ÿ/‡¨Z+½ÿL¨°˜Æ3¾ùv‡ck>TÅúáÔ)¾3jõdƾæÕ>š×0Iù¾¯mï_÷þ¾­¶Å6>Ѷ…äJ¾¯BÂÐÛ¾üÍ8º¢<>úSã3¾ q?˜‹ò¾òì¤Y/‡>ÿr¼ó4¾ µ“(9©Û¾É‹>>…> K2¾ æ?ÆÚL¾ ¦r˜9B>g›»„Š¾RŠ¾rc¾ ~—]Îî>Áí÷¥‡¾%#½“E¾ QoB…3Ã>÷êl/¾þ¨³Él ¾"NÖJ/v>Òt±ü¢¾íŽb°×\¾ñ½\ü:>¡ÛT~Ê}¾ÑÔS«îI¾ÀÇßU„>f¾ÏZ2¾«‰·°"^¾î×f>!—²!= ¾zž‘‚½üÅôÚQç">ÓOik×¾?™jee½øoäÒ¿†ƒ>{§,äx¾ùr;¿½ô"¸.°#>ãØØÓؾ¨~ÁÝ2ã½ï»Plï3„>´Z®ü z¾M¿½ât¢½çI«úÓÁ>E”Èx%,¾è¿Á”_½Ýâ<6ª9>ÐÊOé ¾yÖ$ÚÓ½ÊÕ s›øä>TaöŽE¾ ¿/­=¦sÏ  ºÌ>Òû–-ä¾~ÎŒì©=ÒżcËØX>LuõOõ€¾ó'åD´Ô=á:~d¢>ÁAíÙQ’¾^_k¹=èìPL‚ã0>1Ù&c[¾À¢ØÊi9=ð;¼ƒ=td>ž¸rñ"`¾UL£Çk=óìs 9†p>@@ꬾkß“ æ=÷ˆ¹‰cÉò>ní]@+¾´Ê‹=û ´¿­>ÓõÒ7¾öGÇJ/ª=þlJzÜM>5N!(:¾04´+'>ì«F õ >•Óå¸ûN¾bÿœ&d>Ž"ïl˜>õYn¾ŽÇ&mg>$.î5$>Sl øt¾´ 5„K >®˜Á$ûÇ>±3vð¾Òþ,°ô>-ER¯×>«à¾ëôUåwÆ> WRUä§>lGµÐÿ!pUÊ> ¹ˆÓ‰Ö>Êó9Ïþ H±@¬> csí†^–>(ŸØ R¾Òj‹¨î> ³µÃVÇ >)m]Eý¾á$ÝÄD> øž7> Ñ>°[¾Iꇑ÷>1c®Q¨> ”ÿ²4 "¾š‚sS>/­Þûš> \ÒU›'¾ ëc£áŒ>Áí˜=Þ> &¶ó‰!¾ÿ˜lcÆÌ>LýÉÑí‹>õQZ‡ÐR¾ïîŠ×‰”>Ó|äiEs>ÈK­¶§…¾ÝÌëE>T±âDw>Ÿä˜bоÇ€š«>гïY±>| ÜÆ‚¾¯?Ñcnn>G”<΂É>^‡Ž†a¾”µ0ð»>¹pRÁé >F÷—j¾wþéÅ=#>&r·O_>3fÀs\¦¾YlÎaW‘>Ž¨38 •>&žƒ\'¿¾9DpÑú{>òA'| ›> AIhQž¤¤Y‘>QO.Á4¼=þ@©çξôÔ!}?H>«ÿzý6=üMÖey®$¾Ñ€G$7>G>àG´=úhÈFÅ4¾¬vŠZÖì>TdÃg›V=ø‘J~–C¾‡3uÞÃ~>¢ŠBð÷Y=öÇï•¥?¾aŠ˜m K>ìÅ®L1=õ íº°.i¾;°O¡>3#–ü‚=ó`›"årU¾°>uÒ,?Ü*=ñÂÛÞœb¾ïÈó¸¦Ù>´ìt.=ð4(œš[¾Ê “ÅÒ>ð‚bÑ.=ígËBG»Ý¾¤¶d¿ç>(à(¹þ=ê†1Ë!NÒ¾ëMp9>]ðÛf&¸=çÂãDùÜ¢¾[¼ðbó>èØŸú˜=åæÈ€!ø¾8jBÁ¯¯>¾×ñNín=☕•TѾä+¶Á‘>êË Š¨Ó=à1\úGÔ¾ôXÿ}$>üÁ!P=ÛѲë›Ö¾Ôµ>;>:jò9ƒ=ׇRV§ã¾´ÕÁä4>^5­MÊÇ=Ól:å9BF¾–èÝ >i-Ÿ²=Ï+%f¾zj|²ú>ž0 >ºþ=ÇülµÝá¾_`«¡Ê6>º‰ J/b=ÁJ~ÈîM+¾EÚl63>Ô‰N«\&=¶&]Ÿ‹ö°¾-ù¿|2>ìI¹×-/=¥gH§ï:®¾µÇ!Nk>ܘ\®G=K–³Í¤¾:2‹†*>J"¹ ¦½¢˜Ðh2â¾ðìËÐ>&œ/¬j½±ÔÙ6ñϾߣ(ÿ¾>5ó뀽¹dVnÕ6¾ЦþeÈ>C2¬çX½¿þ …ˆºê¾Ã…tÍHy>Nˆñm‡R½ÂÏ"í°3¾¸OÈ›?®>Wé]mE²½Å%°ÁaF쾯 “ësô>_}SÎØJ½Æÿ‘b#%¾§Õæ¥#H>e9; ¹½È]3SF¥_¾¢‡¦LÂ>hä$B[ñ½ÉA&Ju Ö¾Ÿ?Õá'9>jÜ•÷J½ÉªåÞY$뾞 бŀ>jþך½É—ŠÿOS„¾žËÎÜ‘Ã>iH1[D¨½É ¡èœè†¾¡Žª>_>eÈÕ׽ȮâjUa¾¦Y”l“V>`T KcH½Æ€±Z¡D%¾­ÕC>Y!J|ÞP½Ä‚>13½6¾µÀ›HO>P“Yí£½Â ª)æ¾ÀaÕ¦å>EzÃPõ½¾5´ú+n¾ÌïÕ´<“>8!€ÛÔš½·_z3onq¾Û\ÅÏ­Ë>);I/ν¯+gÙÝ0¾늪m¢m>gñ:ɽ›sÁEm—¾ýŸ¥Oè>’0æñ§=†½k©á¼¾\ñX>ð–iy7=ªì¿øô¤X¾&Èf¼>ÙšÅ'êŽ=¹ Êy)z¾=è}>À`ojì=ÂɯÓûŸ9¾VŠ6Ncù>¤ëÒA°š=É„Îà°½¾pÀãB&>‡½Y~=Ð]ˆçÁ¾ŒB3~’>fþ®r™‹=Ô2»qÔÔ¾©'@@X>DtŽ®n=ØDp‰Ù–¾ÇM.Q°->ncØ4=ܑƇzÀ:¾æªàU±>÷Ôá¿yÒ=àŽ.’­,¾šŒº>Ín:n=âðÙƒž¾(g ¤Eƒ> `ÙÇ>=åo±|¹(¾J“éÆ­û>prmdj =è èQ÷F¾mŒä®¶«>=¢9å³Ê=êÅß*ÖB¾‘iùzd>ÐÜzzð=휲š!}k¾µ1&¾Ás>ÎÀ#«+Ä=ðG¤ö4 ­¾Ù¥g‹>’Š~a‰]=ñÏr‡ÀÓ¾þ<¯“Í>S éÅW~=óeÁa¾"õ‰W–> 82Hå=õ÷Œ­A¾G®gK¡>É¢{ ³y=ö¹¸ÕmS¾l ÿ$(È>ƒˆ€n’=øw9[Ôxk¾;›k[>1§–)=úBŸb’ ~¾³°¸è¥L>ßþ–o4¬=ü|øê¾ÖØ7¹ >ŠoÂÒ­=ýÿZ^›X¾øt(‹íx>0É7w‡…=ÿðâî¾BÛ!ì©>ÒþâDZ>öw SFA¾8Ç·5~>pðD×û>ú…-`¯”¾V܉‘IÈ> ŽÆ!¾>@‚ß É¾s=‚S!>Ÿ¬®§>A]¥hq¾¨}ÅÔ“>0J›¹ >'0`Cº©¾¦t¬9Í>¼NãæÅû>@Ý/O¾¼*Í.¹>Cø¼Öð>]~p“M'¾ÏžÏrÕN>ƳmcÑ>>g(1¾à`$GÅÿ>C“ø?~T> ¤ÚÈm3Ò¾îr;>¼/¤¿½> Î"7Œá¾ø˜*ò¤>/Ñ¿·²> úÁÉØ@ܾÿŸDC><ŒPüxÜ> *<Ù±í¬¾Û^C£>Fl 2´>\8/À¾ ˆåÀ> ן&TI±>Xª¸zž¾ý!êØÇf> •~¼S>c0¿Ä¾ó£jy™å> HáÇѽÁ>þlJ¶¬¾åy ©jÈ>ñÄ0ŽZ>šEN/Ó¾Ò7Ðs4>¤ª‹é>6&L{†Q¾¹¾dCl>#Ö$Åu>ÑÚv+/=¾›¶¢º`Ë>­2ž\jƒ>m»®`=¾wîGz§>,@§c«>¢±¿ã ¾N)} I­> …né$>¡J}°£¾“j•a> ߀M)v>9;{€¾çaH&I½=üÖ-Ü7Ë>Ϧq¿ô¾©÷ßßû=ù‚Ç$VÛ>d…gS¾e˚ʾ=öß0†ªç>ö ŸÉ„¾¾ÍÉ? ç=ò¢8˜\}>…R  h¾Æ”oË4Ñ=î,dxð˜i>{'¯÷¾k @(I=æððØ”Ñõ>š"8Oé4¾®`›1=ß'ϲe{¥>É,lQ¾¼âKÃf=Ð-xºÐñ>ŸEò 7#¾*eíž=Ž´u¶Ûk’>°ƒ>¾®1½Ì÷np•V‰>‘”¡¯¾*ƒ.ºp½Þ!ÇéÑ)J>Š >g¾œ¹‰¿ëp½æûŠ3žÖ˜>m¨.´Ý¾Ze¬±½îüEI¸‡>Ò+&Ï:¾g ÷£ó½óˆ&Ì›§•>/Ùª(ø¾¾t¡ )B½÷™éUW]Ç>†:š>Ù¾ £gå;^½û²†Œ>ÔÅð•¾Q{:˜~ã½ÿÏù¾(¦©> ïÖ¿D¾Œø…Ø;ø: >b->X£úUô¾¿&ÇÛsø¾ GàÙüÚ>›ããM¾çù=#@Ÿ¾ Áì å>·øaá˜d¾nDgç¾)œÇÊL>ظlÝy¾ÀõOƾ 6ôg Ç°>ïb”¾*Ûjù;¾ @µ„OG>úyÜ/¾^™$ؾFHe™¶>ú‚ ò}¾ T `à@†¾"þqSH>îÕ dZ¾ 9ðaÒo¾kGŸ‰h>ÖüN¤ý†¾‚˨V”¾ÀÁï?³>²«P´s¬¾Ò×&âœÉ¾ o±ÝŸ>q|o¾‡r|;Óï¾ùªu‰Ê>CíLT¾-d~›ä¾áÕ,×*>÷Dz.½ýˆþ˜›y¾Ã?ñ$å>U¤òU½øgσïâ¾6Ëøpü>5‹ÍíQ½ó˜ª>9) ¾nú“£ôM>¿h \Bò½ìú›î˜³E¾7×ÉÈ°^>:ʼH‚†½âšn^þ÷²ðÒ>§|}>©½Ð+O^€Ç쾫ìò"Œ>_š¿‚d=´v>¦ì¾U‘#×B>Trã…=Ú™¸ÒPv¾óvN˜ð…>”–e¾8±=èî¼ "1¾„½7uÄ>ÅËüÚ¹€=ñ€°8è³É¾±'±->è1 †=öõå_‡cà¾~÷éºè>û³÷ûk=ükIX©‡Ì¾å§ _«>Æȶ¶Ø>ï±ä)ƒ¾=^i|>÷e`Mÿ>¥ok¾„ù1OXØ>ßàœªÊ´>VªÝ¥'¾»Ö æ¢X>º™IÐ> 9xÑF¾áLˆÕ>‡ä]ž«Í> ¢V ™¾ô掦h>rÞøI¸>8Ïcœ‡×¾õñ2™"Y> ø äýI>aýv¬ž¾ãû=yá‚> Hn- l>ž¿¾¾†û±ƒ>€æêY„>Ò9öƒÆ•¾…Gy‡_>¥ÍMÆ=É>ü¦4r¶¢¾7¶ “jî>¶¥a§|¨>[3}m¾Õ¥Š’«=ûk+®¦W>/zHÔÐœ¾^½ñp)=õHѦÞ>5¨ËÌ;¾Òà!Í=îuCÈp5>-yÜ3E¾1ðñ!‚=ágD™Ï.¤>ëÓF¨2¾{ÎÉZ”Ÿ=ÂI`Ehœ—>í²c•z|¾°ªÙó½ÐÁDœ{¯Ú>³ä™§,á¾Ð¿íO½ågÔž_ é>ge¿Z·ú¾ÛŸÜÅöù½ñ=¡Ç¦v>)U¶ÿ9¾Ò"ë¢s4½÷Å¡žbà>’»éP+¾´¡aÕŽ½þH{ß](h>l¯—”¾ƒ†’“¾`V_]>f!Cò^ľ?LJù*¾“RõÅú>­TÆvd×¾è¢MËÁ辺·s§Ÿ,>ÜNDz(Ⱦ€`Úœ@{¾ Óryé{z>òS‰šé¾£f÷ß¾Úc§\?0>îªR›2 ¾ üÓZNã¾æO¦?×>ÐÛ”Šß¾Íyc£+˜¾RÔxh9>˜Y±×Hp¾‚òkÐ…á¾±àc\/d>DÀYŽ¬r¾±:ä€!ˆƒå>ÕÙ§Ò½ûMߺ־@50xä>KoCìyö½ô4b'‚üe¾la¸8.K>¥e¸p|>½é÷›ƒ‡¾„‚æ¸w>ãË›Ïtú½Ö¥ÄÂ+Üq¾†Úì¾ >Ñè¬J=»±šö‹,¾r? >Óô—wh=âV&&OR¾Dê!ȼ>ü#˜­±=ðŸ? i.Z¾ý¢°“TZ>Ïyïbe£=øpI©^·¾›AÖƒ’N>‰TwŠà<=ÿs¦,­´¾\œ0ÖÔ>*Îwãw”>bJߧº¾ë "èî>´  !‚P>ûò:Ç+¾Äã65©'>(Ý&)> ƒre"u ¾êJ¹²½Z> ºf=v> ôÚjã¾ïqÌDô> ¢v,®¦‰>¤Ïuëì¾Ó›-RyB>‹GÒX>?ų›µ¾–LcâmºË2>ÈââMèM¾7â0ï>–ô§Öë>=Ô6Ti.¾µé¡hF‹=ùaœièÇA>œ±Ÿ…ľ|ÍÐq{=ñk5…ÓËÄ>ã:…£ó¾M(çì´=â§ÛÇÎ>}T/¾e÷Ôá¿ò=²Ap,ïÖ¦>€ŽOÖ¾]¹Kwãd½Üg-£òe…>‚ЪN‚¾4ÒØܽî·;Mx|>ã¨Á‹9Õ¾ìWå'€™½÷—K߀Ý>”s5Qt9¾…+^â ,½ÿÂ!Þt~Y>"9(ÿ뾨Ș̾èp¼Ø¯8>‹½º:éM¾`N†>UP¾ÜU]É>ÏÆI3œU¾¥’ *‚=¾ ·j°ûéÉ>íBh¾ ¤üìk‹¾s˜ œ—>ãfK~óǾ Òü÷Û˾…Àärèp>±uNé{¾ÖþØ¢<û¾<»}€zt>W6™:½7¾¸X(Ÿ›ÿ¾Ûù·ð‹>ÔP;vž½ú÷F ©2¾`óÛÜÓ>(Ã*‡ô½òK3í5³·¾ÈË+Ù×N>TÛç焽âó‹ÿN€%¾9–ùÀo>Y#9Y!p½¡¾e±8]¾7²p%|š>6SXÈ´=àÖ8ǧw¤¾:¤Sz>íl.Ü’Ô=ñd¸Ïצؾ,ùº…Ò>¬J€äØ=úQ7Ú´ù|¾Ê )+¬Û>î·„°’¨>‘x8½Ú¾TùضÞ>æ6ŽýϾ²™– ;o>j "_I> { Yµ¾äugFvV>÷J1’ªÙ>6ƒ†< ¾觃32¯> ävmueL>-[@¾¾K»Æ2t>¢8&Ž|½>ðó¶N‘ú¾e€¡e˜>6‘À–¤‰>´9ú5­•¾Ü ãs‡=ûP,Ý@±l>XŘÑS©¾%:2 £=ñû!y_0>Û`…¶°y¾??Î ÐÊ=àù"Ý\²=>8þY ±F¾+x ÓÑë½±Á9SQU>nØ…ê;ÿ¾ëiÁ÷k½åLôx39>z* u+{¾Iäf£½ô]Ík:m>XŸõš =¾ê¨°" ½ýåoHEò>ùPƒé¾-lg‘v¨¾¢Õ:.÷C>†Z掑M¾KÑuŽõ¾7squ–>Ò+yT"¾H€š‚f¾ ¦·écRœ>ê!üÛub¾ JkjÙ Ö¾tÂü>ÍXÿ˜‘â¾Í [` ®¾{x¥¼O>{"tq*G¾²´lÆg¾c‚Dmu>óiTš*½ü“ÎAp9V¾(ÑrÍí.>6d8 tz½ò¨U(¹­ü¾ÇÄÀˆ£ž>Djù„=½á‹ÿœ\²¾<±Q±¤>Bè­=ºm Ô°Öþ…\ÅJ>ÇB($“]=çÒÞèľ›Øã]^>>ƒ¨‹ò=öýªhŒ…¾s”U´>‡»Öäüh>ãÍ›o¸¾-w%h(~>¥tÌ2QÞ> 2ò¾£¥1Ê¢)>šÑPÖ8> ÛÝ !7¾àw0ìè">Ö‹9¾>}ˆ0àþ!¾âvÚº> 5AY…z¸>sÙ-M>¾¨ù3v£z>Z\÷}tÀ>ˆ¨“@¾3|…h>NÞ¾éØ°>xéFw¡¾‚pE_,ü=ö8ä_÷À'>=êÅ9•È¾–:Cz;¸=ç5BJ墭>Ö ^H]¯¾oÝdÚJˆ=« w"yW÷>lÿ°„s1¾|>€C2½ô¾ÓJ¦"š>e%z¨úM¾³Ã þß½ÿe©ùh§›>!Ãäû†¾ºè˜—ª‡¾ê~M7Ìô> ~Õ˽c¾•GÔKkl¾ úŽ&ºÄ>ßoëYžp¾Ž!«¤›B¾×_ÊsC>ÝI˜ ©Ì¾ ©"Çì侺Î<Ç*>™&H•L¸¾‡F‹„¾äúõÀ¢>ê:* Y½þbŒÃ£¦¾å 3Ï1t>J¶I­Jè½óf<*“.¾µ­†eY–>Aš ±×a½àfud:ás¾RPÇPK>ùBTqèt=È÷Û§6ƒ¾¶tž†q>s°!oJ=ìëŸ en¾Þ;s%ˆc>³Älhè=ù¶GUZ!¾Æ§²w>¼öV?>c$e¯Cå¾kRŸ>“Ãа>Å|Ù‡¾ËHŠ¿9>:Ì|Î> ôk#ôÅT¾äg”ûwe> rƒ³oß>ñ–°9=²¾µF%É>'ÒŽP ‚>B``›;h¾>K1›€ò>¡Ç;w|>fr?÷ ξ~׳5<†=õÚÇ7™í>Wè`Âð¾xSz¤;=ä`ãάYÅ>_pÕ¾,m5`L—½¹ñj¢&>Ô2»;¾’U\v½êì½Ë®>ÈÇ,&­´¾ÎÛ5v̽ù6ò¢³4ó>¾Ju|0¾ÄLŒ,žt¾aKk0e>k*6“¾‚t«“:¾ý·Ü•Ê>̶Gí ¾Tb"÷ ¾ `ð9ÃC>á ¸à g¾ ÜfÞ»L0¾>^ bÜÑ>§F‚0¦¾P1Òs —¾¡KG~*Ð>àƒ±ä‡½ÿ ɳAU¾ÒlCâ>H~ª˜à}½óàlt‰¾Ë1Æv`7>%x¸BYï½Û¬¶öj¾…Í”¦šN>¸®d‡B=Õö-ÃÔW¾ü·ñ&>Rökp)=ñ®ÔIÏ<­¾+8£ÕlH> Š§Ä§=ýÕ)m»¾ 4`B%s>Ô6²Ùªr>Ú é/_õ¾ŸaIUYÌ>dαÙ> ”ψ3訾ß0r_a> ÐbÈP>™2Ò¾Ësº >ãv¨ÇR>”à¹ý©_¾b–þCŸ%>ûï£îª5>òèsä÷¾¥š<Ûõ=÷·9Ì¢Ö>Y†•þ¾•Š³*mr=æMîTí^Û>÷¹Í•#z¾4—ãêM½¹PJ[‘q>“ ð^¾…å¦ä~"½ì¯ÇÞUÓ>âàÚµ¾—=¦+½úûƒx[Ã>ߥõör¾PР¿+_¾­@hNÀe>ˆ\;×ÌľÕc'/!4¾ §UVÁDœ>Ù‚T#¾Dµpvñ-¾YqiÝɦ>Ð0‹yjƒ¾~u͹O¾XåGáå>l¯­ 3.¾h[à0ÿ¾ÏQé+>®ÖäCÕ½ø)eŸÕ¾Üp#>—ÿê²ñ½æY¨=¾ûTÿ×>*®º‡1l=¿áö;DUF¾¢~߶cõ>jƒNÄIM=î[UF6l§¾÷ /–»ç>\ gÕ=ü8¶ÆÒ%·¾õž*üùa>@‹Ä;>z²)ô˜ñ¾˜fÞu-G>l§Ð[> œü‘\]N¾ÝîaU> 4ݪÿ+>7€/d¾ÁÒ)îž>+³Uæ|/>îx K§¾Eþ‡œ?Æ>Óc^Vt>jÀl{¾jG·Œ®Ï=ô|_+W>¡y´© £¾0w‘=ÜáRjîÝ>ŒÛé€/¾›ÙjS4-½ÚX”ÑNå>$äúÛ»¾°ªÓr˜‰½ô%è+¦>cŠ‹A;t¦‚Šî¾¾Pöœ~‡>CÉ ¢¾îm!`¾6·Â~>ÁŸÞì–¾%öÆêྠew,¸‘E>ÚsËÃi¾ H;®YbоšC>tbJ>oñ+L¾åaú²¾G…ݨàÝ>ÙfUñÅ‹½úq‹[æ ¾°¤T,Vt>ÀüÔ.Zj½éc”’*(=¾̧FÒˆ>FÙŽ¡í=´SãdhǾ“#Úúmä>oÐö¹ù=î†Îù¾ýO ì*H>?u5@ò=ýuæwò‡¾ C 6 >¾ôÕBç>E‡}qa羦TͨÈ>õëW3¥> ¹Æ+4†¾ÜØ•Ü6)> Ú“…K;v>æÌx›äz¾§¼q]$>_üU“‡À>µþÿHœ¾ƒ\”,«=ý$ÖUóÚÖ>?E¢y`¤¾ú„o«þ»=î(”ÌdÆŠ>x­­qN¾†˜í¿ã«=¨2éçÚÞ>YI}é辯CUÆ#½ë>u/+Ëe>Ù'iŠ×¾zu|(°½û×®V©+>ñçà£Õ³¾ﮈ¥_8¾Ù‰­ðÚ>žxäŒÎ¾¾ÂÈëÞq¾ |ò —>ÛH´êûϾ ù™uŠî ¾Þ[Àñ4Ž>¦y"§%%¾TZjŽ1O¾À"åÈÎÆ>ÿáâªÉ›½ü°Rn_|Á¾XHûJò>èê1#½ì}­†DÚë¾›^Ðà Ø>dçØ…™=5ãø¢"p¾€ylæä>xºð³Ñv=îaøý.Ͼÿ&Õ"&Q>+;J®®=ý¼HhšŸà¾¦{à™>„ç8×>î,3×èZ¾¯ÜÂ(ÅÄ>ŽuèJ—> ¬@©—±¾Ù Æ,> ¨S´Ñ©>~2ü)ª?¾Šü—¹†>ÃêQ “>b*Õã¾Åu*úÑ•=ùôXéĨ>õ¸@ìúz¾ŠÞo8Œ=ägCŸ¾ûß>-°ã[8ì¾ßTÅØj½ÓŠi=$þb>1£‹?I¾È( Pؽóïwí¨¥n>dô”‘b¾Mµ#¡„¾ZH“œÒß>U8xªçR¾yC'2Ó²¾z ö\Ý>Ì“þÒ¾«›Ü)ë¾8„¯L¦o>Æ£{ðÑX¾ßâÑíΓ¾¼D,H­>Cì9оªûZrz+¾\#9¬ >E(YϽòTÎ6W·º¾é}Ö¥>Íq¡¶ê¾½ÇÛv¼È\«¾”ðü>â4žQ“ =èêÜ0±¬e¾ãûô>Š¡¼w>©=û» )û„Ѿó¥æ‹>иÖQã>Iq,D÷ʾ¥¡E÷¾ó>½“ápó> ]«!¶æ”¾×wSøú> ¿Ìe`Öá>};¨÷s¾†­­¾óÄ>Šw‹ßòâ>€ý¸âÐE¾³zHkG=÷ô²?Ì>,µ[º¬¾`—ööÙR=ུ¾…1é>qΑRÁ@¾’ã%(¸½Ý—¼sÏOš>GTðõ;œ¾QŠ?šs½÷ÛòX¤o>£Üù$0¾¥Þ ¾2¡r…Î>g&𮊾šÑïóDY¾ ˆ^•u•>Õ¶Ù…n¾ {¼em9ʾµ.ÜaI>¤6Õåà±¾;MC¹y¾Ûû‰¢ož>êŸü”°Ñ½û)ÐýK]¾©dŒîZš>«>Õ>ê÷½æ¨§¡ÁÞ¤¾Æ"Ùo8>êÜËZR…=ÒüÓ¼©ˆ¾0RœÎî>°œë‚¡?=ôÆåv8i¾y“™àÙË> fZ¾Ë>;•`QE¾k3ÿ97>öÙœb‰'> ÂÏ<·Ög¾Ò€ þ´ã> !ŸÁš˜>jbÿc4辬›“ÈZ‚>ƲŒ#û>§mtôîB¾ù÷‰$=ûþŸsû}>ˆ‰O~™Ñ¾ºQod» =ç¾³ˆJ­>ÿËÔè¾õ.é,½Ò ;‡þKæ¸" ¾±ccz21½ôÙÝÑ ¿>{¾Ÿr ¾øç`4‡¾j &ÅÈñ>o Åš1a¾Ø=Ê,¦¾ ïŸÍ‡e>Ò©Öó¾ ¼Ì?P¾Ÿã5ûP>£½kHæ¾5œÌDã`¾æVSÄ¢>á<Ð쓽ú‚¯‚ÛýǾËî<’¯>a9Q½äÏ£D]¾A{®qô€>²Ÿ‰‘È=Ú™gm)4¾9ÎBcß8>S›&ü®x=÷A`ç2–¾ª ÑæB>}r¡Q„£>¸lµÖQ¾Š.“1ð¢>=©â8îY> pã#áÛç¾ÔmŽ"ž¡> H,‡s¿>Pë¹Ö[ó¾†ißEÖ^>„îØ‘î>’¿t¿åõ¾  i7_=ö±k6õ³*>l}%Eö¾&J¥º'=×h­“—xn>ΔÊxT¾’2ÕF½æK6Êzáâ>«èæ0!¾’³P³YŒ½ûôñÉ=€>ùµè"ÿ¾H´å]¾áëññ>°(õˆà£¾#<‰_ÏȾ у£ÅÀD>ÊpòQʾÀêÁÊ€¾uû†`ï´>FñIò©±¾±´P]X…¾£ E²‹>'P«#èJ½ð‹Ö·v×¾^‚àE½‘>px¤‘úš=¥¿ìߎ~`¾˜Ô¸žž“>*ŸÕ¿¢Ë=ñîgnæ¾E¢þ‚Î>a"á¼ÎÊ>k´>qQ¾Y\=ý>"å…¡> †SŒ†én¾ÎŒÃ\ô4> ý§Õ‡>&$ƒRU¾¡`D§³š>8Ù†¹†>þÂÔi¾C¾Ño:g¤=ùbÇ•Â>ɦü¾bV!¶I =àôrÆìz>Œ9ÝÁ¾ZÊ]Í ½ã³º0c½>‡ºçQi¾Å2Sð¹u½úìa®>ê§bŠ]¾®ò!6’¾áÛÆ”[C>¬R³x]¾(¬fIѾ ×gÁ‡/3>Çæ þå·¾ŠÑ·.1¾”‚¬ë+>; Å;u/¾5=²°Ä¾Ö cŒõ_>LuÉ>½íû-ŠòÉ@¾ ð_Âz>4ŸÔv¯=ÆoE ‡Ö¾Øë–qÁ;>Ê8EO­ô=ô“'À3–¾{àr"Òc>Õµô%pY>õƘczI¾{y®•ÙO>gUÒ o> 8üæC”¾ÐùÍè5> $F5{M¸>qJyCc¬¾y4Æ>×Í·1éº>âp°à†ð¾u"„ÁœÁ=ô1'Á·>Ûèsû(¾É--¯=Áš99¢Õ¥>H÷©¹ßø¾ƒ't›`½ïÃK>ùLþ>ã~Ç‹¾£>÷žo¾ÐÖaÚ„>K»/!³¾E468T¾ Q­Sêå>ËaÀ[™¾ ïú¤4ú¾ŸÐd“H>™·,œÍ(¾¤Ï ž*o¾5.t‚¬>¶=O’9½÷²!D\¾R»ùÓ>%1Gy ½Ö v+6´2¾äÐ3–”>îÅ%ç&H=é°MV+ù×¾ÛFï c>¨ø€íÔ=þíÀ†îÚS¾(^Åà’¨>ÈaEg>'ÒŸ&æ¾ÃôLE G> ÷ ö©&Ì>$u«‘o¬¾¨É«…Û>¡»éj!>Óžgí£ý¾Ös=C¸³=ù„Òx*½> Ô®Œì¾Q ä'_y=Ü{µ"jL>²Ú'5\¾ ßd½æùlÃœN{>¼EŽb´¾RŸý”°½ýÚ7H¦)>D²˜·y¾öåáó ¸¾†øí´™>¿çd¤AȾDçä.¾D3 i>ªûXôz¾×*«†›¾Á÷~‰é+>Ù콌rv½ù¶é¢i9O¾÷»gÙ>PÄÅ’àæ½ÜJÉ(!·¾¶žòÍ¥ù>Uàö€¿=çØqÖC¾Äáü:Òo>=ØOT¨©=þ`lª,¹¾!•°6s>Òˆp%¶¤>󲶧¾¶žDCx> ×ú‚†œ½>:þv–ÌB¾£J,xá>E=Y…>þø¥¿_î¾Âà÷‚=øFüý®>BOù ›Û¾&!mÅÍ$=ÕpÁæKt˜>îéœ}17¾Ö-ßW<½ëv4¸f‚u>ò%F¦ 8¾âJÏ2o¾@sv&Í>=ïŠý©1¾\È´~~¾ Ȥ7¡ºù¾ ´s¡©Æä¾Ê~¥n >cÑ׳:¾íÍ6]Òy¾ˆÁ _ ¹>Œ¾5ä½õ;¦²3*ø¾¿n " >Ì2¸ã÷o½À!³ôŸTؾWñÅÚçq>V•%ƒL=ñI±±Ï@¾@‘2 >;aÔ©>é±r>³¾iÒ{Uö>ŽÒ}B»=> ¨ŠSZ¾Ì0üµ>> Ò6 <\l>«“ÌKá¾c”å4²ò>Ë”Úeü†>Wíž÷{D¾1…:Y}Ä=ð¹ÂiƒÉ>sŠ£€Î{¾=" Îðˆ½Ç´QNè»>轺.¾’ìì,½öo‹%QÄÊ>£Àͼ,¾D3»¾ªò®©i>™b—>æÛ¾g0|&’¾ ’®³ÓŠ>ÁR‚z•¾,œZ(¾ØfR>Ñ>X¼°_½ý¸ò<ÅM¾dvüäÚ>¤Éÿ½ä{#`‚¾U»™>lï4R=ãþ.$“¾”¨ÃÖö>€c*l›ç=ýVæBƾÎV~>òî‚tð >ð.äÕ¾¿Šú$T0> ¹ä€r3¯>Wò”¸¾šVÍV±>µád—0m>CF¸Hõ¾¡Žâ€§=ö2³Vëòr>Ÿ©ÔV²¾Ù2Ö¬e=ŠëÂzÌ´>Si²Ó›¾OšñìT½ñ©ªâoì>Iý?L©¾šeî¹@¾–Å%®—>t/&.W¾? D9Å×¾ ÕÙDΧ„>Èncù]5¾ ÔÓ'«­¾&Þ(‹{¨>C-OÒBa¾iŠÝ‡Ž¾ßÃǧü’>ç5~뮽ê 6‚—¾ùˆ<«Úò>½O²÷ =ÜÈîñÒ{µ¾\‚ŸFÌh>ÔkÖí¹á=û<Ú¬æax¾õù©UöÔ>A$ŽÁ.Ò>Bûh‚<¾¹"bîw÷>:@¸î<á>N¦¿c¾Ÿ¢Û®·> •‡85>&ˆz°¾§Í$=ö|ú‰ÍZò>˜—Ó±ÿƒ¾ØŒÈgÅ×=Ás*z}7 >Z  ¯?¾>¬}ŸI“½ò9tµž& >VäØ)1¢¾ì’} f:¾nv‘p>}zuNa¾¾ún[ÜO¾ vâ¨Ý”>ÄÖ«z¾ ë9ó" ¾„x¹ >(§ƒ1½þ¼z8¥ùE¾Aݸ”‘»>­–Þ®½äÞÌ£%¼¾V.2ã÷>]jœ„»ú=äl~bξ¨è+ëU/>I o˜Nn=þ• ÿ%­c¾'.½ÐÔ >‡! ‰sÈ> ‡< WI¾ÄQ³Ü×> h9¦øj>ý°ÔøS¾zt’âZ>á`®dÔ>Þ˜*é¾J±¦íÒ=ñ†ÃCì~Ê>[¾QÅs”¾=3¢lÎq½Ê5§™šð=>øÞ¤Fç¾`ù66½ø! &J>Âïâ}À¾Ë4Ò+¾6w»è>ªÝëÙ5ʾ0Ça1Ns¾_³Ý $>¨GÉ'´¾ÏÄ=‘ Ã¾áà hU>º< %%Q½÷{Wæfg+¾w·<α>æó6„ÙƽĞÆ8j¤¾Sµ‹ûå>;äíÛá'=òpîAô ¾]åI%î}>Í~1~ºÌ>t÷ ?8¶¾… ó`œF>¶Y¨tìò> ã»Pmå¾¾´Ž~©á>-fN•’>êÕä6ê¾ã*„ë{=üM4Ë©X>±–ø9IÒ¾eA¡-¡¹=ÝHÑóëŸË>ÁmÄéû¾ãÅ«C½ëÚ‰ûã=>X€ô~“¾”¥í?оa–dÇäû>[A¾”5ƒ›èŸ¾ Aýû0•>ÅRÛ¸A8¾ ›–)¾¾#‹[‰ƒ>:±dN*]¾ØGX2ª¾IB“Þq>¾vfw½å÷HÉ°mÕ¾JzbÆEš>[Æ©fOŸ=äëÏ]¬´&¾²ä`£p‚>%sÏ;\7=ÿ˜¯EËL¾5¢?>Ye>56¨d> Þk(P±¾Äæó§€> V`ßá‘‹>xr.•â¾Z÷ÅÏëà>Yš«î>šbœ/í¾ú¤æ.=ëo¿»>òÊÓUC¾¬ê︦½à$3ZàOc>yÅŸ=þ…¡q׷˽ýuºÖÊ`­>ؤξž'1U¬¾ó¿Ðí±#>Á*2UO¸¾ -£¾„Ö¾-÷ª%ö>lÔb9¾+Â1Sn¾Q5Ư>Kx¢¨|½î$ŒÅN/¾¿|h”ÿ>Øéä=Úì¢9Õ•¾Y­!¡G¾>·P£ ==üVý‹³’¾ ’¾ >Ђò® >‚P“§Ü¾¿‡Œõb> ŠÓߎÕ;> I—‡ë¾r²MBÙã>yjcÏ®>5ãQEñɾ&&ùP"F=ï ÷S0‡>¯Ø9>ɾã˜6,½Ùцž‹{¤>SNÌÁǾ½¯y6y½ü?K‚YnÝ>-‚]vþ¾ÏÝxÃÚ¾&سn\>¾jNíؾ rè çy¾qs56>n”üA®¾IDñJؾJ\*DÊ>`Sv‹ª½íèGô…L¾Æ °Dù>ÌXaÞ=ÜÛ *ƙ̾gòC³œÆ>˜”È’=ý)l2¤¶¾ôÕÎñ>˜ÿ¤ÆŸR> íZsM”¾Àœ Ó {> äCû?<>W&ÞÿѾ`½`œè>˜.½zT>ŒP¾\¾ø›ŒuÛ=ê¬k‡ °Å>܆¹Aƾ“×dçÁò½â øDf÷î>”Ç¡ï¾Fñ^ˆœ½ÿv“êX>/Ìfwh¾.Ï‹Æ ±¾ ×®pê>Â!\2(£¾ ßá‹n¾Ð wÈß>E‹1±¾i¯VŸZ¾ú¾³ Å>½Xú¦¯”½ågJ8ξ]BEÕ1Ñ>6lU·Z©=ç¬HçÄ¾Ø èí>Æû”Ë>ýRØv>(¾Sl)ì>Á"Î|“> vÙø„¾À°i-&ë> a§ÿ‡:>{ †çZû¾›ØÚì<=ýråýئ>Ùº%¾f0–0vf=Ü ƒæâ—>Ö7Y3_ ¾²î/Aì½ïVZÈh€Þ>+Îǃ¼¾’òh¾ê „Ráh>z¤KòAp¾´d ¸£¾ Pé¿%>µz´Ÿ¾h~7{‚¾SùûH¢>Ù'ÛD½ù,¿c5¾K üãÓw>ìké•Ÿ½ÂÓ8íN ¾gu¡,ÃÄ>ŽxÛ*Ë=ôxx|Hn쾊ΎÇÇk>0&È8†ü>HVG(g×¾ŸÚ¤lÍ/>=æ¹×r>ºlöG¾› Ãe¤ï>ìÝ®«…q>T®[´¯ ¾{®”\Ö=ó¢éŒ¶â>!šæ½aœ¾K6¤Àֽʿ8²ðP>PGˆ±¾Žé½ú:–û·ö>ì \‘™¾Ndz$2¾½nehj>¹]$± ã¾ “ ÂM¾ ÖáOª>gªÖá˜F¾îÝÙ(&!¾wÂW¿‹>øʘ) ½êb…w!¾ è¯ôº>y{ OL‹=äî­!kµ¾±2É ý@>-‰Ñ¬½>n«Ú„O{¾GÇÁ>°¡2­¤7> >­Í"¾¾Ç¼úðË> bàìV°Ö>ƒˆèk(¾Üôë|Ž=üÏšš!z>³c[¤s¼¾H‘ÿ£U-=ÖÙtÖ>¼\»!@¾p‡ãؘ½ñ¢E‚»O7>VãÖ‘¾¥ñ  0¯¾*#çŽÔ±>eÝBÒ¾ T!„¾¾½K(ém>£mL1l€>ÇB($“]=çÒÞèľ›Øã]^>>ƒ¨‹ò=öýªhŒ…¾s”U´>‡»Öäüh>ãÍ›o¸¾-w%h(~>¥tÌ2QÞ> 2ò¾£¥1Ê¢)>šÑPÖ8> ÛÝ !7¾àw0ìè">Ö‹9¾>}ˆ0àþ!¾âvÚº> 5AY…z¸>sÙ-M>¾¨ù3v£z>Z\÷}tÀ>ˆ¨“@¾3|…h>NÞ¾éØ°>xéFw¡¾‚pE_,ü=ö8ä_÷À'>=êÅ9•È¾–:Cz;¸=ç5BJ墭>Ö ^H]¯¾oÝdÚJˆ=« w"yW÷>lÿ°„s1¾|>€C2½ô¾ÓJ¦"š>e%z¨úM¾³Ã þß½ÿe©ùh§›>!Ãäû†¾ºè˜—ª‡¾ê~M7Ìô> ~Õ˽c¾•GÔKkl¾ úŽ&ºÄ>ßoëYžp¾Ž!«¤›B¾×_ÊsC>ÝI˜ ©Ì¾ ©"Çì侺Î<Ç*>™&H•L¸¾‡F‹„¾äúõÀ¢>ê:* Y½þbŒÃ£¦¾å 3Ï1t>J¶I­Jè½óf<*“.¾µ­†eY–>Aš ±×a½àfud:ás¾RPÇPK>ùBTqèt=È÷Û§6ƒ¾¶tž†q>s°!oJ=ìëŸ en¾Þ;s%ˆc>³Älhè=ù¶GUZ!¾Æ§²w>¼öV?>c$e¯Cå¾kRŸ>“Ãа>Å|Ù‡¾ËHŠ¿9>:Ì|Î> ôk#ôÅT¾äg”ûwe> rƒ³oß>ñ–°9=²¾µF%É>'ÒŽP ‚>B``›;h¾>K1›€ò>¡Ç;w|>fr?÷ ξ~׳5<†=õÚÇ7™í>Wè`Âð¾xSz¤;=ä`ãάYÅ>_pÕ¾,m5`L—½¹ñj¢&>Ô2»;¾’U\v½êì½Ë®>ÈÇ,&­´¾ÎÛ5v̽ù6ò¢³4ó>¾Ju|0¾ÄLŒ,žt¾aKk0e>k*6“¾‚t«“:¾ý·Ü•Ê>̶Gí ¾Tb"÷ ¾ `ð9ÃC>á ¸à g¾ ÜfÞ»L0¾>^ bÜÑ>§F‚0¦¾P1Òs —¾¡KG~*Ð>àƒ±ä‡½ÿ ɳAU¾ÒlCâ>H~ª˜à}½óàlt‰¾Ë1Æv`7>%x¸BYï½Û¬¶öj¾…Í”¦šN>¸®d‡B=Õö-ÃÔW¾ü·ñ&>Rökp)=ñ®ÔIÏ<­¾+8£ÕlH> Š§Ä§=ýÕ)m»¾ 4`B%s>Ô6²Ùªr>Ú é/_õ¾ŸaIUYÌ>dαÙ> ”ψ3訾ß0r_a> ÐbÈP>™2Ò¾Ësº >ãv¨ÇR>”à¹ý©_¾b–þCŸ%>ûï£îª5>òèsä÷¾¥š<Ûõ=÷·9Ì¢Ö>Y†•þ¾•Š³*mr=æMîTí^Û>÷¹Í•#z¾4—ãêM½¹PJ[‘q>“ ð^¾…å¦ä~"½ì¯ÇÞUÓ>âàÚµ¾—=¦+½úûƒx[Ã>ߥõör¾PР¿+_¾­@hNÀe>ˆ\;×ÌľÕc'/!4¾ §UVÁDœ>Ù‚T#¾Dµpvñ-¾YqiÝɦ>Ð0‹yjƒ¾~u͹O¾XåGáå>l¯­ 3.¾h[à0ÿ¾ÏQé+>®ÖäCÕ½ø)eŸÕ¾Üp#>—ÿê²ñ½æY¨=¾ûTÿ×>*®º‡1l=¿áö;DUF¾¢~߶cõ>jƒNÄIM=î[UF6l§¾÷ /–»ç>\ gÕ=ü8¶ÆÒ%·¾õž*üùa>@‹Ä;>z²)ô˜ñ¾˜fÞu-G>l§Ð[> œü‘\]N¾ÝîaU> 4ݪÿ+>7€/d¾ÁÒ)îž>+³Uæ|/>îx K§¾Eþ‡œ?Æ>Óc^Vt>jÀl{¾jG·Œ®Ï=ô|_+W>¡y´© £¾0w‘=ÜáRjîÝ>ŒÛé€/¾›ÙjS4-½ÚX”ÑNå>$äúÛ»¾°ªÓr˜‰½ô%è+¦>cŠ‹A;t¦‚Šî¾¾Pöœ~‡>CÉ ¢¾îm!`¾6·Â~>ÁŸÞì–¾%öÆêྠew,¸‘E>ÚsËÃi¾ H;®YbоšC>tbJ>oñ+L¾åaú²¾G…ݨàÝ>ÙfUñÅ‹½úq‹[æ ¾°¤T,Vt>ÀüÔ.Zj½éc”’*(=¾̧FÒˆ>FÙŽ¡í=´SãdhǾ“#Úúmä>oÐö¹ù=î†Îù¾ýO ì*H>?u5@ò=ýuæwò‡¾ C 6 >¾ôÕBç>E‡}qa羦TͨÈ>õëW3¥> ¹Æ+4†¾ÜØ•Ü6)> Ú“…K;v>æÌx›äz¾§¼q]$>_üU“‡À>µþÿHœ¾ƒ\”,«=ý$ÖUóÚÖ>?E¢y`¤¾ú„o«þ»=î(”ÌdÆŠ>x­­qN¾†˜í¿ã«=¨2éçÚÞ>YI}é辯CUÆ#½ë>u/+Ëe>Ù'iŠ×¾zu|(°½û×®V©+>ñçà£Õ³¾ﮈ¥_8¾Ù‰­ðÚ>žxäŒÎ¾¾ÂÈëÞq¾ |ò —>ÛH´êûϾ ù™uŠî ¾Þ[Àñ4Ž>¦y"§%%¾TZjŽ1O¾À"åÈÎÆ>ÿáâªÉ›½ü°Rn_|Á¾XHûJò>èê1#½ì}­†DÚë¾›^Ðà Ø>dçØ…™=5ãø¢"p¾€ylæä>xºð³Ñv=îaøý.Ͼÿ&Õ"&Q>+;J®®=ý¼HhšŸà¾¦{à™>„ç8×>î,3×èZ¾¯ÜÂ(ÅÄ>ŽuèJ—> ¬@©—±¾Ù Æ,> ¨S´Ñ©>~2ü)ª?¾Šü—¹†>ÃêQ “>b*Õã¾Åu*úÑ•=ùôXéĨ>õ¸@ìúz¾ŠÞo8Œ=ägCŸ¾ûß>-°ã[8ì¾ßTÅØj½ÓŠi=$þb>1£‹?I¾È( Pؽóïwí¨¥n>dô”‘b¾Mµ#¡„¾ZH“œÒß>U8xªçR¾yC'2Ó²¾z ö\Ý>Ì“þÒ¾«›Ü)ë¾8„¯L¦o>Æ£{ðÑX¾ßâÑíΓ¾¼D,H­>Cì9оªûZrz+¾\#9¬ >E(YϽòTÎ6W·º¾é}Ö¥>Íq¡¶ê¾½ÇÛv¼È\«¾”ðü>â4žQ“ =èêÜ0±¬e¾ãûô>Š¡¼w>©=û» )û„Ѿó¥æ‹>иÖQã>Iq,D÷ʾ¥¡E÷¾ó>½“ápó> ]«!¶æ”¾×wSøú> ¿Ìe`Öá>};¨÷s¾†­­¾óÄ>Šw‹ßòâ>€ý¸âÐE¾³zHkG=÷ô²?Ì>,µ[º¬¾`—ööÙR=ུ¾…1é>qΑRÁ@¾’ã%(¸½Ý—¼sÏOš>GTðõ;œ¾QŠ?šs½÷ÛòX¤o>£Üù$0¾¥Þ ¾2¡r…Î>g&𮊾šÑïóDY¾ ˆ^•u•>Õ¶Ù…n¾ {¼em9ʾµ.ÜaI>¤6Õåà±¾;MC¹y¾Ûû‰¢ož>êŸü”°Ñ½û)ÐýK]¾©dŒîZš>«>Õ>ê÷½æ¨§¡ÁÞ¤¾Æ"Ùo8>êÜËZR…=ÒüÓ¼©ˆ¾0RœÎî>°œë‚¡?=ôÆåv8i¾y“™àÙË> fZ¾Ë>;•`QE¾k3ÿ97>öÙœb‰'> ÂÏ<·Ög¾Ò€ þ´ã> !ŸÁš˜>jbÿc4辬›“ÈZ‚>ƲŒ#û>§mtôîB¾ù÷‰$=ûþŸsû}>ˆ‰O~™Ñ¾ºQod» =ç¾³ˆJ­>ÿËÔè¾õ.é,½Ò ;‡þKæ¸" ¾±ccz21½ôÙÝÑ ¿>{¾Ÿr ¾øç`4‡¾j &ÅÈñ>o Åš1a¾Ø=Ê,¦¾ ïŸÍ‡e>Ò©Öó¾ ¼Ì?P¾Ÿã5ûP>£½kHæ¾5œÌDã`¾æVSÄ¢>á<Ð쓽ú‚¯‚ÛýǾËî<’¯>a9Q½äÏ£D]¾A{®qô€>²Ÿ‰‘È=Ú™gm)4¾9ÎBcß8>S›&ü®x=÷A`ç2–¾ª ÑæB>}r¡Q„£>¸lµÖQ¾Š.“1ð¢>=©â8îY> pã#áÛç¾ÔmŽ"ž¡> H,‡s¿>Pë¹Ö[ó¾†ißEÖ^>„îØ‘î>’¿t¿åõ¾  i7_=ö±k6õ³*>l}%Eö¾&J¥º'=×h­“—xn>ΔÊxT¾’2ÕF½æK6Êzáâ>«èæ0!¾’³P³YŒ½ûôñÉ=€>ùµè"ÿ¾H´å]¾áëññ>°(õˆà£¾#<‰_ÏȾ у£ÅÀD>ÊpòQʾÀêÁÊ€¾uû†`ï´>FñIò©±¾±´P]X…¾£ E²‹>'P«#èJ½ð‹Ö·v×¾^‚àE½‘>px¤‘úš=¥¿ìߎ~`¾˜Ô¸žž“>*ŸÕ¿¢Ë=ñîgnæ¾E¢þ‚Î>a"á¼ÎÊ>k´>qQ¾Y\=ý>"å…¡> †SŒ†én¾ÎŒÃ\ô4> ý§Õ‡>&$ƒRU¾¡`D§³š>8Ù†¹†>þÂÔi¾C¾Ño:g¤=ùbÇ•Â>ɦü¾bV!¶I =àôrÆìz>Œ9ÝÁ¾ZÊ]Í ½ã³º0c½>‡ºçQi¾Å2Sð¹u½úìa®>ê§bŠ]¾®ò!6’¾áÛÆ”[C>¬R³x]¾(¬fIѾ ×gÁ‡/3>Çæ þå·¾ŠÑ·.1¾”‚¬ë+>; Å;u/¾5=²°Ä¾Ö cŒõ_>LuÉ>½íû-ŠòÉ@¾ ð_Âz>4ŸÔv¯=ÆoE ‡Ö¾Øë–qÁ;>Ê8EO­ô=ô“'À3–¾{àr"Òc>Õµô%pY>õƘczI¾{y®•ÙO>gUÒ o> 8üæC”¾ÐùÍè5> $F5{M¸>qJyCc¬¾y4Æ>×Í·1éº>âp°à†ð¾u"„ÁœÁ=ô1'Á·>Ûèsû(¾É--¯=Áš99¢Õ¥>H÷©¹ßø¾ƒ't›`½ïÃK>ùLþ>ã~Ç‹¾£>÷žo¾ÐÖaÚ„>K»/!³¾E468T¾ Q­Sêå>ËaÀ[™¾ ïú¤4ú¾ŸÐd“H>™·,œÍ(¾¤Ï ž*o¾5.t‚¬>¶=O’9½÷²!D\¾R»ùÓ>%1Gy ½Ö v+6´2¾äÐ3–”>îÅ%ç&H=é°MV+ù×¾ÛFï c>¨ø€íÔ=þíÀ†îÚS¾(^Åà’¨>ÈaEg>'ÒŸ&æ¾ÃôLE G> ÷ ö©&Ì>$u«‘o¬¾¨É«…Û>¡»éj!>Óžgí£ý¾Ös=C¸³=ù„Òx*½> Ô®Œì¾Q ä'_y=Ü{µ"jL>²Ú'5\¾ ßd½æùlÃœN{>¼EŽb´¾RŸý”°½ýÚ7H¦)>D²˜·y¾öåáó ¸¾†øí´™>¿çd¤AȾDçä.¾D3 i>ªûXôz¾×*«†›¾Á÷~‰é+>Ù콌rv½ù¶é¢i9O¾÷»gÙ>PÄÅ’àæ½ÜJÉ(!·¾¶žòÍ¥ù>Uàö€¿=çØqÖC¾Äáü:Òo>=ØOT¨©=þ`lª,¹¾!•°6s>Òˆp%¶¤>󲶧¾¶žDCx> ×ú‚†œ½>:þv–ÌB¾£J,xá>E=Y…>þø¥¿_î¾Âà÷‚=øFüý®>BOù ›Û¾&!mÅÍ$=ÕpÁæKt˜>îéœ}17¾Ö-ßW<½ëv4¸f‚u>ò%F¦ 8¾âJÏ2o¾@sv&Í>=ïŠý©1¾\È´~~¾ Ȥ7¡ºù¾ ´s¡©Æä¾Ê~¥n >cÑ׳:¾íÍ6]Òy¾ˆÁ _ ¹>Œ¾5ä½õ;¦²3*ø¾¿n " >Ì2¸ã÷o½À!³ôŸTؾWñÅÚçq>V•%ƒL=ñI±±Ï@¾@‘2 >;aÔ©>é±r>³¾iÒ{Uö>ŽÒ}B»=> ¨ŠSZ¾Ì0üµ>> Ò6 <\l>«“ÌKá¾c”å4²ò>Ë”Úeü†>Wíž÷{D¾1…:Y}Ä=ð¹ÂiƒÉ>sŠ£€Î{¾=" Îðˆ½Ç´QNè»>轺.¾’ìì,½öo‹%QÄÊ>£Àͼ,¾D3»¾ªò®©i>™b—>æÛ¾g0|&’¾ ’®³ÓŠ>ÁR‚z•¾,œZ(¾ØfR>Ñ>X¼°_½ý¸ò<ÅM¾dvüäÚ>¤Éÿ½ä{#`‚¾U»™>lï4R=ãþ.$“¾”¨ÃÖö>€c*l›ç=ýVæBƾÎV~>òî‚tð >ð.äÕ¾¿Šú$T0> ¹ä€r3¯>Wò”¸¾šVÍV±>µád—0m>CF¸Hõ¾¡Žâ€§=ö2³Vëòr>Ÿ©ÔV²¾Ù2Ö¬e=ŠëÂzÌ´>Si²Ó›¾OšñìT½ñ©ªâoì>Iý?L©¾šeî¹@¾–Å%®—>t/&.W¾? D9Å×¾ ÕÙDΧ„>Èncù]5¾ ÔÓ'«­¾&Þ(‹{¨>C-OÒBa¾iŠÝ‡Ž¾ßÃǧü’>ç5~뮽ê 6‚—¾ùˆ<«Úò>½O²÷ =ÜÈîñÒ{µ¾\‚ŸFÌh>ÔkÖí¹á=û<Ú¬æax¾õù©UöÔ>A$ŽÁ.Ò>Bûh‚<¾¹"bîw÷>:@¸î<á>N¦¿c¾Ÿ¢Û®·> •‡85>&ˆz°¾§Í$=ö|ú‰ÍZò>˜—Ó±ÿƒ¾ØŒÈgÅ×=Ás*z}7 >Z  ¯?¾>¬}ŸI“½ò9tµž& >VäØ)1¢¾ì’} f:¾nv‘p>}zuNa¾¾ún[ÜO¾ vâ¨Ý”>ÄÖ«z¾ ë9ó" ¾„x¹ >(§ƒ1½þ¼z8¥ùE¾Aݸ”‘»>­–Þ®½äÞÌ£%¼¾V.2ã÷>]jœ„»ú=äl~bξ¨è+ëU/>I o˜Nn=þ• ÿ%­c¾'.½ÐÔ >‡! ‰sÈ> ‡< WI¾ÄQ³Ü×> h9¦øj>ý°ÔøS¾zt’âZ>á`®dÔ>Þ˜*é¾J±¦íÒ=ñ†ÃCì~Ê>[¾QÅs”¾=3¢lÎq½Ê5§™šð=>øÞ¤Fç¾`ù66½ø! &J>Âïâ}À¾Ë4Ò+¾6w»è>ªÝëÙ5ʾ0Ça1Ns¾_³Ý $>¨GÉ'´¾ÏÄ=‘ Ã¾áà hU>º< %%Q½÷{Wæfg+¾w·<α>æó6„ÙƽĞÆ8j¤¾Sµ‹ûå>;äíÛá'=òpîAô ¾]åI%î}>Í~1~ºÌ>t÷ ?8¶¾… ó`œF>¶Y¨tìò> ã»Pmå¾¾´Ž~©á>-fN•’>êÕä6ê¾ã*„ë{=üM4Ë©X>±–ø9IÒ¾eA¡-¡¹=ÝHÑóëŸË>ÁmÄéû¾ãÅ«C½ëÚ‰ûã=>X€ô~“¾”¥í?оa–dÇäû>[A¾”5ƒ›èŸ¾ Aýû0•>ÅRÛ¸A8¾ ›–)¾¾#‹[‰ƒ>:±dN*]¾ØGX2ª¾IB“Þq>¾vfw½å÷HÉ°mÕ¾JzbÆEš>[Æ©fOŸ=äëÏ]¬´&¾²ä`£p‚>%sÏ;\7=ÿ˜¯EËL¾5¢?>Ye>56¨d> Þk(P±¾Äæó§€> V`ßá‘‹>xr.•â¾Z÷ÅÏëà>Yš«î>šbœ/í¾ú¤æ.=ëo¿»>òÊÓUC¾¬ê︦½à$3ZàOc>yÅŸ=þ…¡q׷˽ýuºÖÊ`­>ؤξž'1U¬¾ó¿Ðí±#>Á*2UO¸¾ -£¾„Ö¾-÷ª%ö>lÔb9¾+Â1Sn¾Q5Ư>Kx¢¨|½î$ŒÅN/¾¿|h”ÿ>Øéä=Úì¢9Õ•¾Y­!¡G¾>·P£ ==üVý‹³’¾ ’¾ >Ђò® >‚P“§Ü¾¿‡Œõb> ŠÓߎÕ;> I—‡ë¾r²MBÙã>yjcÏ®>5ãQEñɾ&&ùP"F=ï ÷S0‡>¯Ø9>ɾã˜6,½Ùцž‹{¤>SNÌÁǾ½¯y6y½ü?K‚YnÝ>-‚]vþ¾ÏÝxÃÚ¾&سn\>¾jNíؾ rè çy¾qs56>n”üA®¾IDñJؾJ\*DÊ>`Sv‹ª½íèGô…L¾Æ °Dù>ÌXaÞ=ÜÛ *ƙ̾gòC³œÆ>˜”È’=ý)l2¤¶¾ôÕÎñ>˜ÿ¤ÆŸR> íZsM”¾Àœ Ó {> äCû?<>W&ÞÿѾ`½`œè>˜.½zT>ŒP¾\¾ø›ŒuÛ=ê¬k‡ °Å>܆¹Aƾ“×dçÁò½â øDf÷î>”Ç¡ï¾Fñ^ˆœ½ÿv“êX>/Ìfwh¾.Ï‹Æ ±¾ ×®pê>Â!\2(£¾ ßá‹n¾Ð wÈß>E‹1±¾i¯VŸZ¾ú¾³ Å>½Xú¦¯”½ågJ8ξ]BEÕ1Ñ>6lU·Z©=ç¬HçÄ¾Ø èí>Æû”Ë>ýRØv>(¾Sl)ì>Á"Î|“> vÙø„¾À°i-&ë> a§ÿ‡:>{ †çZû¾›ØÚì<=ýråýئ>Ùº%¾f0–0vf=Ü ƒæâ—>Ö7Y3_ ¾²î/Aì½ïVZÈh€Þ>+Îǃ¼¾’òh¾ê „Ráh>z¤KòAp¾´d ¸£¾ Pé¿%>µz´Ÿ¾h~7{‚¾SùûH¢>Ù'ÛD½ù,¿c5¾K üãÓw>ìké•Ÿ½ÂÓ8íN ¾gu¡,ÃÄ>ŽxÛ*Ë=ôxx|Hn쾊ΎÇÇk>0&È8†ü>HVG(g×¾ŸÚ¤lÍ/>=æ¹×r>ºlöG¾› Ãe¤ï>ìÝ®«…q>T®[´¯ ¾{®”\Ö=ó¢éŒ¶â>!šæ½aœ¾K6¤Àֽʿ8²ðP>PGˆ±¾Žé½ú:–û·ö>ì \‘™¾Ndz$2¾½nehj>¹]$± ã¾ “ ÂM¾ ÖáOª>gªÖá˜F¾îÝÙ(&!¾wÂW¿‹>øʘ) ½êb…w!¾ è¯ôº>y{ OL‹=äî­!kµ¾±2É ý@>-‰Ñ¬½>n«Ú„O{¾GÇÁ>°¡2­¤7> >­Í"¾¾Ç¼úðË> bàìV°Ö>ƒˆèk(¾Üôë|Ž=üÏšš!z>³c[¤s¼¾H‘ÿ£U-=ÖÙtÖ>¼\»!@¾p‡ãؘ½ñ¢E‚»O7>VãÖ‘¾¥ñ  0¯¾*#çŽÔ±>eÝBÒ¾ T!„¾¾½K(ém>£mL1l€>ÇB($“]=çÒÞèľ›Øã]^>>ƒ¨‹ò=öýªhŒ…¾s”U´>‡»Öäüh>ãÍ›o¸¾-w%h(~>¥tÌ2QÞ> 2ò¾£¥1Ê¢)>šÑPÖ8> ÛÝ !7¾àw0ìè">Ö‹9¾>}ˆ0àþ!¾âvÚº> 5AY…z¸>sÙ-M>¾¨ù3v£z>Z\÷}tÀ>ˆ¨“@¾3|…h>NÞ¾éØ°>xéFw¡¾‚pE_,ü=ö8ä_÷À'>=êÅ9•È¾–:Cz;¸=ç5BJ墭>Ö ^H]¯¾oÝdÚJˆ=« w"yW÷>lÿ°„s1¾|>€C2½ô¾ÓJ¦"š>e%z¨úM¾³Ã þß½ÿe©ùh§›>!Ãäû†¾ºè˜—ª‡¾ê~M7Ìô> ~Õ˽c¾•GÔKkl¾ úŽ&ºÄ>ßoëYžp¾Ž!«¤›B¾×_ÊsC>ÝI˜ ©Ì¾ ©"Çì侺Î<Ç*>™&H•L¸¾‡F‹„¾äúõÀ¢>ê:* Y½þbŒÃ£¦¾å 3Ï1t>J¶I­Jè½óf<*“.¾µ­†eY–>Aš ±×a½àfud:ás¾RPÇPK>ùBTqèt=È÷Û§6ƒ¾¶tž†q>s°!oJ=ìëŸ en¾Þ;s%ˆc>³Älhè=ù¶GUZ!¾Æ§²w>¼öV?>c$e¯Cå¾kRŸ>“Ãа>Å|Ù‡¾ËHŠ¿9>:Ì|Î> ôk#ôÅT¾äg”ûwe> rƒ³oß>ñ–°9=²¾µF%É>'ÒŽP ‚>B``›;h¾>K1›€ò>¡Ç;w|>fr?÷ ξ~׳5<†=õÚÇ7™í>Wè`Âð¾xSz¤;=ä`ãάYÅ>_pÕ¾,m5`L—½¹ñj¢&>Ô2»;¾’U\v½êì½Ë®>ÈÇ,&­´¾ÎÛ5v̽ù6ò¢³4ó>¾Ju|0¾ÄLŒ,žt¾aKk0e>k*6“¾‚t«“:¾ý·Ü•Ê>̶Gí ¾Tb"÷ ¾ `ð9ÃC>á ¸à g¾ ÜfÞ»L0¾>^ bÜÑ>§F‚0¦¾P1Òs —¾¡KG~*Ð>àƒ±ä‡½ÿ ɳAU¾ÒlCâ>H~ª˜à}½óàlt‰¾Ë1Æv`7>%x¸BYï½Û¬¶öj¾…Í”¦šN>¸®d‡B=Õö-ÃÔW¾ü·ñ&>Rökp)=ñ®ÔIÏ<­¾+8£ÕlH> Š§Ä§=ýÕ)m»¾ 4`B%s>Ô6²Ùªr>Ú é/_õ¾ŸaIUYÌ>dαÙ> ”ψ3訾ß0r_a> ÐbÈP>™2Ò¾Ësº >ãv¨ÇR>”à¹ý©_¾b–þCŸ%>ûï£îª5>òèsä÷¾¥š<Ûõ=÷·9Ì¢Ö>Y†•þ¾•Š³*mr=æMîTí^Û>÷¹Í•#z¾4—ãêM½¹PJ[‘q>“ ð^¾…å¦ä~"½ì¯ÇÞUÓ>âàÚµ¾—=¦+½úûƒx[Ã>ߥõör¾PР¿+_¾­@hNÀe>ˆ\;×ÌľÕc'/!4¾ §UVÁDœ>Ù‚T#¾Dµpvñ-¾YqiÝɦ>Ð0‹yjƒ¾~u͹O¾XåGáå>l¯­ 3.¾h[à0ÿ¾ÏQé+>®ÖäCÕ½ø)eŸÕ¾Üp#>—ÿê²ñ½æY¨=¾ûTÿ×>*®º‡1l=¿áö;DUF¾¢~߶cõ>jƒNÄIM=î[UF6l§¾÷ /–»ç>\ gÕ=ü8¶ÆÒ%·¾õž*üùa>@‹Ä;>z²)ô˜ñ¾˜fÞu-G>l§Ð[> œü‘\]N¾ÝîaU> 4ݪÿ+>7€/d¾ÁÒ)îž>+³Uæ|/>îx K§¾Eþ‡œ?Æ>Óc^Vt>jÀl{¾jG·Œ®Ï=ô|_+W>¡y´© £¾0w‘=ÜáRjîÝ>ŒÛé€/¾›ÙjS4-½ÚX”ÑNå>$äúÛ»¾°ªÓr˜‰½ô%è+¦>cŠ‹A;t¦‚Šî¾¾Pöœ~‡>CÉ ¢¾îm!`¾6·Â~>ÁŸÞì–¾%öÆêྠew,¸‘E>ÚsËÃi¾ H;®YbоšC>tbJ>oñ+L¾åaú²¾G…ݨàÝ>ÙfUñÅ‹½úq‹[æ ¾°¤T,Vt>ÀüÔ.Zj½éc”’*(=¾̧FÒˆ>FÙŽ¡í=´SãdhǾ“#Úúmä>oÐö¹ù=î†Îù¾ýO ì*H>?u5@ò=ýuæwò‡¾ C 6 >¾ôÕBç>E‡}qa羦TͨÈ>õëW3¥> ¹Æ+4†¾ÜØ•Ü6)> Ú“…K;v>æÌx›äz¾§¼q]$>_üU“‡À>µþÿHœ¾ƒ\”,«=ý$ÖUóÚÖ>?E¢y`¤¾ú„o«þ»=î(”ÌdÆŠ>x­­qN¾†˜í¿ã«=¨2éçÚÞ>YI}é辯CUÆ#½ë>u/+Ëe>Ù'iŠ×¾zu|(°½û×®V©+>ñçà£Õ³¾ﮈ¥_8¾Ù‰­ðÚ>žxäŒÎ¾¾ÂÈëÞq¾ |ò —>ÛH´êûϾ ù™uŠî ¾Þ[Àñ4Ž>¦y"§%%¾TZjŽ1O¾À"åÈÎÆ>ÿáâªÉ›½ü°Rn_|Á¾XHûJò>èê1#½ì}­†DÚë¾›^Ðà Ø>dçØ…™=5ãø¢"p¾€ylæä>xºð³Ñv=îaøý.Ͼÿ&Õ"&Q>+;J®®=ý¼HhšŸà¾¦{à™>„ç8×>î,3×èZ¾¯ÜÂ(ÅÄ>ŽuèJ—> ¬@©—±¾Ù Æ,> ¨S´Ñ©>~2ü)ª?¾Šü—¹†>ÃêQ “>b*Õã¾Åu*úÑ•=ùôXéĨ>õ¸@ìúz¾ŠÞo8Œ=ägCŸ¾ûß>-°ã[8ì¾ßTÅØj½ÓŠi=$þb>1£‹?I¾È( Pؽóïwí¨¥n>dô”‘b¾Mµ#¡„¾ZH“œÒß>U8xªçR¾yC'2Ó²¾z ö\Ý>Ì“þÒ¾«›Ü)ë¾8„¯L¦o>Æ£{ðÑX¾ßâÑíΓ¾¼D,H­>Cì9оªûZrz+¾\#9¬ >E(YϽòTÎ6W·º¾é}Ö¥>Íq¡¶ê¾½ÇÛv¼È\«¾”ðü>â4žQ“ =èêÜ0±¬e¾ãûô>Š¡¼w>©=û» )û„Ѿó¥æ‹>иÖQã>Iq,D÷ʾ¥¡E÷¾ó>½“ápó> ]«!¶æ”¾×wSøú> ¿Ìe`Öá>};¨÷s¾†­­¾óÄ>Šw‹ßòâ>€ý¸âÐE¾³zHkG=÷ô²?Ì>,µ[º¬¾`—ööÙR=ུ¾…1é>qΑRÁ@¾’ã%(¸½Ý—¼sÏOš>GTðõ;œ¾QŠ?šs½÷ÛòX¤o>£Üù$0¾¥Þ ¾2¡r…Î>g&𮊾šÑïóDY¾ ˆ^•u•>Õ¶Ù…n¾ {¼em9ʾµ.ÜaI>¤6Õåà±¾;MC¹y¾Ûû‰¢ož>êŸü”°Ñ½û)ÐýK]¾©dŒîZš>«>Õ>ê÷½æ¨§¡ÁÞ¤¾Æ"Ùo8>êÜËZR…=ÒüÓ¼©ˆ¾0RœÎî>°œë‚¡?=ôÆåv8i¾y“™àÙË> fZ¾Ë>;•`QE¾k3ÿ97>öÙœb‰'> ÂÏ<·Ög¾Ò€ þ´ã> !ŸÁš˜>jbÿc4辬›“ÈZ‚>ƲŒ#û>§mtôîB¾ù÷‰$=ûþŸsû}>ˆ‰O~™Ñ¾ºQod» =ç¾³ˆJ­>ÿËÔè¾õ.é,½Ò ;‡þKæ¸" ¾±ccz21½ôÙÝÑ ¿>{¾Ÿr ¾øç`4‡¾j &ÅÈñ>o Åš1a¾Ø=Ê,¦¾ ïŸÍ‡e>Ò©Öó¾ ¼Ì?P¾Ÿã5ûP>£½kHæ¾5œÌDã`¾æVSÄ¢>á<Ð쓽ú‚¯‚ÛýǾËî<’¯>a9Q½äÏ£D]¾A{®qô€>²Ÿ‰‘È=Ú™gm)4¾9ÎBcß8>S›&ü®x=÷A`ç2–¾ª ÑæB>}r¡Q„£>¸lµÖQ¾Š.“1ð¢>=©â8îY> pã#áÛç¾ÔmŽ"ž¡> H,‡s¿>Pë¹Ö[ó¾†ißEÖ^>„îØ‘î>’¿t¿åõ¾  i7_=ö±k6õ³*>l}%Eö¾&J¥º'=×h­“—xn>ΔÊxT¾’2ÕF½æK6Êzáâ>«èæ0!¾’³P³YŒ½ûôñÉ=€>ùµè"ÿ¾H´å]¾áëññ>°(õˆà£¾#<‰_ÏȾ у£ÅÀD>ÊpòQʾÀêÁÊ€¾uû†`ï´>FñIò©±¾±´P]X…¾£ E²‹>'P«#èJ½ð‹Ö·v×¾^‚àE½‘>px¤‘úš=¥¿ìߎ~`¾˜Ô¸žž“>*ŸÕ¿¢Ë=ñîgnæ¾E¢þ‚Î>a"á¼ÎÊ>k´>qQ¾Y\=ý>"å…¡> †SŒ†én¾ÎŒÃ\ô4> ý§Õ‡>&$ƒRU¾¡`D§³š>8Ù†¹†>þÂÔi¾C¾Ño:g¤=ùbÇ•Â>ɦü¾bV!¶I =àôrÆìz>Œ9ÝÁ¾ZÊ]Í ½ã³º0c½>‡ºçQi¾Å2Sð¹u½úìa®>ê§bŠ]¾®ò!6’¾áÛÆ”[C>¬R³x]¾(¬fIѾ ×gÁ‡/3>Çæ þå·¾ŠÑ·.1¾”‚¬ë+>; Å;u/¾5=²°Ä¾Ö cŒõ_>LuÉ>½íû-ŠòÉ@¾ ð_Âz>4ŸÔv¯=ÆoE ‡Ö¾Øë–qÁ;>Ê8EO­ô=ô“'À3–¾{àr"Òc>Õµô%pY>õƘczI¾{y®•ÙO>gUÒ o> 8üæC”¾ÐùÍè5> $F5{M¸>qJyCc¬¾y4Æ>×Í·1éº>âp°à†ð¾u"„ÁœÁ=ô1'Á·>Ûèsû(¾É--¯=Áš99¢Õ¥>H÷©¹ßø¾ƒ't›`½ïÃK>ùLþ>ã~Ç‹¾£>÷žo¾ÐÖaÚ„>K»/!³¾E468T¾ Q­Sêå>ËaÀ[™¾ ïú¤4ú¾ŸÐd“H>™·,œÍ(¾¤Ï ž*o¾5.t‚¬>¶=O’9½÷²!D\¾R»ùÓ>%1Gy ½Ö v+6´2¾äÐ3–”>îÅ%ç&H=é°MV+ù×¾ÛFï c>¨ø€íÔ=þíÀ†îÚS¾(^Åà’¨>ÈaEg>'ÒŸ&æ¾ÃôLE G> ÷ ö©&Ì>$u«‘o¬¾¨É«…Û>¡»éj!>Óžgí£ý¾Ös=C¸³=ù„Òx*½> Ô®Œì¾Q ä'_y=Ü{µ"jL>²Ú'5\¾ ßd½æùlÃœN{>¼EŽb´¾RŸý”°½ýÚ7H¦)>D²˜·y¾öåáó ¸¾†øí´™>¿çd¤AȾDçä.¾D3 i>ªûXôz¾×*«†›¾Á÷~‰é+>Ù콌rv½ù¶é¢i9O¾÷»gÙ>PÄÅ’àæ½ÜJÉ(!·¾¶žòÍ¥ù>Uàö€¿=çØqÖC¾Äáü:Òo>=ØOT¨©=þ`lª,¹¾!•°6s>Òˆp%¶¤>󲶧¾¶žDCx> ×ú‚†œ½>:þv–ÌB¾£J,xá>E=Y…>þø¥¿_î¾Âà÷‚=øFüý®>BOù ›Û¾&!mÅÍ$=ÕpÁæKt˜>îéœ}17¾Ö-ßW<½ëv4¸f‚u>ò%F¦ 8¾âJÏ2o¾@sv&Í>=ïŠý©1¾\È´~~¾ Ȥ7¡ºù¾ ´s¡©Æä¾Ê~¥n >cÑ׳:¾íÍ6]Òy¾ˆÁ _ ¹>Œ¾5ä½õ;¦²3*ø¾¿n " >Ì2¸ã÷o½À!³ôŸTؾWñÅÚçq>V•%ƒL=ñI±±Ï@¾@‘2 >;aÔ©>é±r>³¾iÒ{Uö>ŽÒ}B»=> ¨ŠSZ¾Ì0üµ>> Ò6 <\l>«“ÌKá¾c”å4²ò>Ë”Úeü†>Wíž÷{D¾1…:Y}Ä=ð¹ÂiƒÉ>sŠ£€Î{¾=" Îðˆ½Ç´QNè»>轺.¾’ìì,½öo‹%QÄÊ>£Àͼ,¾D3»¾ªò®©i>™b—>æÛ¾g0|&’¾ ’®³ÓŠ>ÁR‚z•¾,œZ(¾ØfR>Ñ>X¼°_½ý¸ò<ÅM¾dvüäÚ>¤Éÿ½ä{#`‚¾U»™>lï4R=ãþ.$“¾”¨ÃÖö>€c*l›ç=ýVæBƾÎV~>òî‚tð >ð.äÕ¾¿Šú$T0> ¹ä€r3¯>Wò”¸¾šVÍV±>µád—0m>CF¸Hõ¾¡Žâ€§=ö2³Vëòr>Ÿ©ÔV²¾Ù2Ö¬e=ŠëÂzÌ´>Si²Ó›¾OšñìT½ñ©ªâoì>Iý?L©¾šeî¹@¾–Å%®—>t/&.W¾? D9Å×¾ ÕÙDΧ„>Èncù]5¾ ÔÓ'«­¾&Þ(‹{¨>C-OÒBa¾iŠÝ‡Ž¾ßÃǧü’>ç5~뮽ê 6‚—¾ùˆ<«Úò>½O²÷ =ÜÈîñÒ{µ¾\‚ŸFÌh>ÔkÖí¹á=û<Ú¬æax¾õù©UöÔ>A$ŽÁ.Ò>Bûh‚<¾¹"bîw÷>:@¸î<á>N¦¿c¾Ÿ¢Û®·> •‡85>&ˆz°¾§Í$=ö|ú‰ÍZò>˜—Ó±ÿƒ¾ØŒÈgÅ×=Ás*z}7 >Z  ¯?¾>¬}ŸI“½ò9tµž& >VäØ)1¢¾ì’} f:¾nv‘p>}zuNa¾¾ún[ÜO¾ vâ¨Ý”>ÄÖ«z¾ ë9ó" ¾„x¹ >(§ƒ1½þ¼z8¥ùE¾Aݸ”‘»>­–Þ®½äÞÌ£%¼¾V.2ã÷>]jœ„»ú=äl~bξ¨è+ëU/>I o˜Nn=þ• ÿ%­c¾'.½ÐÔ >‡! ‰sÈ> ‡< WI¾ÄQ³Ü×> h9¦øj>ý°ÔøS¾zt’âZ>á`®dÔ>Þ˜*é¾J±¦íÒ=ñ†ÃCì~Ê>[¾QÅs”¾=3¢lÎq½Ê5§™šð=>øÞ¤Fç¾`ù66½ø! &J>Âïâ}À¾Ë4Ò+¾6w»è>ªÝëÙ5ʾ0Ça1Ns¾_³Ý $>¨GÉ'´¾ÏÄ=‘ Ã¾áà hU>º< %%Q½÷{Wæfg+¾w·<α>æó6„ÙƽĞÆ8j¤¾Sµ‹ûå>;äíÛá'=òpîAô ¾]åI%î}>Í~1~ºÌ>t÷ ?8¶¾… ó`œF>¶Y¨tìò> ã»Pmå¾¾´Ž~©á>-fN•’>êÕä6ê¾ã*„ë{=üM4Ë©X>±–ø9IÒ¾eA¡-¡¹=ÝHÑóëŸË>ÁmÄéû¾ãÅ«C½ëÚ‰ûã=>X€ô~“¾”¥í?оa–dÇäû>[A¾”5ƒ›èŸ¾ Aýû0•>ÅRÛ¸A8¾ ›–)¾¾#‹[‰ƒ>:±dN*]¾ØGX2ª¾IB“Þq>¾vfw½å÷HÉ°mÕ¾JzbÆEš>[Æ©fOŸ=äëÏ]¬´&¾²ä`£p‚>%sÏ;\7=ÿ˜¯EËL¾5¢?>Ye>56¨d> Þk(P±¾Äæó§€> V`ßá‘‹>xr.•â¾Z÷ÅÏëà>Yš«î>šbœ/í¾ú¤æ.=ëo¿»>òÊÓUC¾¬ê︦½à$3ZàOc>yÅŸ=þ…¡q׷˽ýuºÖÊ`­>ؤξž'1U¬¾ó¿Ðí±#>Á*2UO¸¾ -£¾„Ö¾-÷ª%ö>lÔb9¾+Â1Sn¾Q5Ư>Kx¢¨|½î$ŒÅN/¾¿|h”ÿ>Øéä=Úì¢9Õ•¾Y­!¡G¾>·P£ ==üVý‹³’¾ ’¾ >Ђò® >‚P“§Ü¾¿‡Œõb> ŠÓߎÕ;> I—‡ë¾r²MBÙã>yjcÏ®>5ãQEñɾ&&ùP"F=ï ÷S0‡>¯Ø9>ɾã˜6,½Ùцž‹{¤>SNÌÁǾ½¯y6y½ü?K‚YnÝ>-‚]vþ¾ÏÝxÃÚ¾&سn\>¾jNíؾ rè çy¾qs56>n”üA®¾IDñJؾJ\*DÊ>`Sv‹ª½íèGô…L¾Æ °Dù>ÌXaÞ=ÜÛ *ƙ̾gòC³œÆ>˜”È’=ý)l2¤¶¾ôÕÎñ>˜ÿ¤ÆŸR> íZsM”¾Àœ Ó {> äCû?<>W&ÞÿѾ`½`œè>˜.½zT>ŒP¾\¾ø›ŒuÛ=ê¬k‡ °Å>܆¹Aƾ“×dçÁò½â øDf÷î>”Ç¡ï¾Fñ^ˆœ½ÿv“êX>/Ìfwh¾.Ï‹Æ ±¾ ×®pê>Â!\2(£¾ ßá‹n¾Ð wÈß>E‹1±¾i¯VŸZ¾ú¾³ Å>½Xú¦¯”½ågJ8ξ]BEÕ1Ñ>6lU·Z©=ç¬HçÄ¾Ø èí>Æû”Ë>ýRØv>(¾Sl)ì>Á"Î|“> vÙø„¾À°i-&ë> a§ÿ‡:>{ †çZû¾›ØÚì<=ýråýئ>Ùº%¾f0–0vf=Ü ƒæâ—>Ö7Y3_ ¾²î/Aì½ïVZÈh€Þ>+Îǃ¼¾’òh¾ê „Ráh>z¤KòAp¾´d ¸£¾ Pé¿%>µz´Ÿ¾h~7{‚¾SùûH¢>Ù'ÛD½ù,¿c5¾K üãÓw>ìké•Ÿ½ÂÓ8íN ¾gu¡,ÃÄ>ŽxÛ*Ë=ôxx|Hn쾊ΎÇÇk>0&È8†ü>HVG(g×¾ŸÚ¤lÍ/>=æ¹×r>ºlöG¾› Ãe¤ï>ìÝ®«…q>T®[´¯ ¾{®”\Ö=ó¢éŒ¶â>!šæ½aœ¾K6¤Àֽʿ8²ðP>PGˆ±¾Žé½ú:–û·ö>ì \‘™¾Ndz$2¾½nehj>¹]$± ã¾ “ ÂM¾ ÖáOª>gªÖá˜F¾îÝÙ(&!¾wÂW¿‹>øʘ) ½êb…w!¾ è¯ôº>y{ OL‹=äî­!kµ¾±2É ý@>-‰Ñ¬½>n«Ú„O{¾GÇÁ>°¡2­¤7> >­Í"¾¾Ç¼úðË> bàìV°Ö>ƒˆèk(¾Üôë|Ž=üÏšš!z>³c[¤s¼¾H‘ÿ£U-=ÖÙtÖ>¼\»!@¾p‡ãؘ½ñ¢E‚»O7>VãÖ‘¾¥ñ  0¯¾*#çŽÔ±>eÝBÒ¾ T!„¾¾½K(ém>£mL1l€¾§.]jío¾Hà#»v>TM Ó±½ô±RrµÙ¾þHSé>_™F"ôâ=Æ /KØ™`¾ûûv«@>&FXÖCA=ú [ - g¾ëì¬Ñ>ï{>>@ßkÒ¾¹¢-ô·> @8ŸPlý>?§ó4)×¾[û>{¼>Y½hÀ­>²¶»Î/Š¾Õ¢s°KzÌ&m¾4ݬb,c½è^ÿ1þ†%>äÓ’¶îs¾“QyH?¾µFKœ¯”>c*•Ú¨¹¾ë—£úz¾ ¡ËÙê†D>¶N—»¾Í©.˜o¾6ªÉŽä×>ÙÆ –f|½øõ„ôj'¾Y@ýŠ˜>ÕG”I^½´… ì²÷·¾WsÑøs>¼nX-T=öxñ{ûgO¾±4Y²w„>®¾?ä>¬Ñ‰p»¾­µ( Ýù> ¦æ¹6²¡>›DÉb°\¾w’Dz™«>»•…J >5¨{vÄ¢¾ífxÿ=ì)ÆÛÁ>õ8ˆÇ˜¾„{ÜãÛ½ãÍÜyO½×>²z¾í¼Cm¦¾Á]'QÒú>N¬%믑¾q7!]¾ ãœAÒPÒ>¹5i¯‚Ú¾y+@[W¾ò’ X¤>ì+‘AȽú`D“ʾ-ÄÈȃ>îÚeºn½Á2äeAw"¾v8¾ ² >Õ,V€=õê¼­¾¨kr›á¤>¾ÄYˆ%,>wM1ÃP¾¬ 8î³è> ¬4Å–‹a>©Ê³t¾u`:’ÇP>£¢+>D€ÀD¾lŒC”§=ë[/ÜS > ÜŽÏоj‰àuɽå~€eºr>ÇŒ£&¾¿_µé~y¾MüÁšä">Zéü·¹Y¾*S<5G¾ †gíèý²>´p%¼!Ѿ·l1¸úm¾GÖ¶D«Ó>ÎÒþ«½ø0 ™2RϾ~ÙÕEØ>²wErnª=zA£çIs¾¸ÅŽ³iñ>uB%qéÞ=øjqRÔÝ—¾ÓÆâep>9-šg½•>Ü–•áàÔ¾µZŽÕ@> V£Ò»“>B`p÷„¾U)6u>Ú¨‚É–>Û™´ÈûZ¾µm1NaÈ=ãÑà²\à>ˆ áÖ¾æ¯ç§cO½íSYW`úñ>DàRB+¾Ép†´z¾Q<¶ëÏÑ>86$ê¾?ÚâP¾}Ý©†> bus¢Š¾†ûœfï¾.D¶áp>yxø8]½ó?8"=.Þ¾@û¸W> `X S=Õ«Õ íŸ¾HÏÛâÀ>•WA`Œm=ýàjéH¾#MHÞ>Ss?³> ˆ@ܘSb¾ºß¢I”> žå:c>~h·L§­¾ÌRéZ=ûÚ¾e=ξ>ì EQ§¾Î{½‹=ÉÞû·&žN>ZåqÀTw¾êщmé½õŽŒ½¹8>£»]áϾ¸žÌüþ¾¶œ#´©>«à„Ý«¾ MsŸPȾÕ&³ø¬[>f±/Nv»¾Þp]„R ¾’õ£Ôce>Ö2kXëq½æ‹Q dÝá¾^¶ ú> ݇\ªõ=ëo¹“W·¾ <À¬>#\œÀñ>Y~|­ß¾}'˜¡>K]È(>o¾áB<<¾Ÿ<"]Ñó>p$M ²>;õ€R¾påÃÜ#=ò¦׎Õ>Z«3¹å¾ü#u¶Â½Ù¾3Ò¬·ÿ>d9lmH˾^~Ù”ê½ÿBl?)le>4ø£Û¾¿;ó᩾ ZÈsî¯>¶ý.%…̾¦ßÜAã¾î/àP‰>ã`ïK3u½ù`±Sü™¾W~÷,g>¯cÿO½’•aLá…¾³c¨JlÍ>l?$dzÈ=øÙúçr#¾ÛÁêq˜“>ÒçX’#>qz€,¾¶ ƒ"—s©>®¾z=¾7É•VrÁ=ÿoÍÀx~]>XvÐ2°ì¾e±÷o=Ù“¾O Â¿>þÒæó€Á¾RKÒ½òöþ%µ¬~>vŽD€^“¾"]Ðw¤ú¾½ð¾{e>¡¥º8w>¾ íˆJ_¾‚N+ Læ>q^-&Gɾnù®)¥¾e;ƒOá/>æþPVð½çÓþew¾M†Ž’bf>b1ùZÒ=ë5qyñƒ¾ Dß\Î6>´† !>B¸ƒL ¾€9ð•r> .Rö>׳㾗õ¨‹õ>Ñ®ð}Ø>€XÍ*¬Ã¾NŒÝÖ¼š=ðÑSpò >¢¥¼:Ë ¾µðýí½áž”`˜‚> - a%¾èpB­B¾àä^‚>Ur¥Sy;¾.•q®¾ Ý+^ki·>«ëkgM¾è€%ÂR@¾®™×ƒÔÑ>žË”Y¥l½õ!ô­ÿ| ¾¯/Å0>9§¯Òà =ÒDÔ¥ƒ|7¾9U ÞÊ>˜Ehš1S=þÀÙÝ4f¾'0tT·…>å+ûÇ-> âá7  ÐŒ>²~è‡ ø>ñ–MÍᶾÜòžÎb´=øØ´£ç>r’KÕ·¾¦“ß}X½¬óÐHu‹>Ø5ÓXo¾*É¥/±½ú¢þ¿´ÍŠ>÷½"G¾”³ì§ÎȾ rÕŸ,Æ>¶Ë>LCš¾ 5ˆVÐýê¾M°[´ˆ> $P’(q½ûýzDC.³¾ó|±þÿ~>ûٶ€½Á™#¹ù‡¾É¿»%Ï>¡&ŠUÿé=÷¸gTŠ¾Ëv; xõ>#]@)b>CQˆW¸¾³‡¿2S> q‡¯×µ?>ÁC˜²›{¾-šMìÑ8=þŽâ°¸÷>‡H”@¾?8_z±=Òê ¿JÐ>7g6$v±¾ÿ2{5ØʽõZš+åu>£ÄTW’¾”ÅÕÍàl¾6l´'†È>­é"FS¾ lR'ï;¾Q)ó©%>E‚J6x¾JI¾µ¸¾0|a÷rý>pó:@ãÓ½ÚÓïO‘ª¾ü8æ!t“>EE Šýô=ó„¨4Až¾ƒî8Ó€>é(‰ºË{>hðûe¾§ {’ ¹> $³gÇz£>û柿xW¾V!y5¶>w—ó<ÿ>ïÉ”"²¾”?VD™¼=à<èß9S>Ð;M•k_¾vr»Ê1½½ò< I>³>l"²d`=¾# yâ$¾Ûæªñ%¨>¡K·Áçé¾   >F¾ÃÏÚÌŸ>_•vî(¾ù§¿«Q¾ÆŽKÿ ®>¨ý#®Øc½áûÙÉìIy¾µÈ<»d>’e”±ù=ñ|¦³‡W¾^¡CÙ~>B(¹AŸÝ>RWF¾ži²%> ÜÖ W„>§Ä¾™ ý¾dí’‚#>µë§J÷>´dÝÿ“Ǿ±sèñp=âžžiÉöŸ>«Þ4eº,¾›ZZ¹kÜl8¾Hrø,2ñ¾„ˆ«…›Ó>pÙ¾ ÞÂD¥í¾©#ÈË'Ý>b¿/¿­À¾©Rèjýh¾ºu™¥Ö>¬«^Ab½â3‡C䓱¾´½#>1ßÿê=ñ› Üchõ¾aºÐn•/>4²…Ä2^>¸¨¡¢¿‘¾Ÿ¹L±»©> £ëZ"¥C>Æ>¯ÙÏ=¾]\Ì3]>Ze3ðü>×4êè†ú¾›êj¨›=à°ÓÚÔ_Œ>Ì™å=³¾rE¼Œ“O½òw!e%.ä>qÚ“—¨X¾wg€€¾-‚Õ@&\>£‹vŲ¾ .ÞH²ð¾ÿèãš°Ê>Qyéþ!¾Ë´vpåå¾ SxUƒ>}a†÷J½ÜH‡6hGN¾ö¯¤Lû>?Þo(ɽ=óÖ¤V?ﾋÀ3ö+4>Áø”]>ß3í³û¾©]ƒñò> |—ŠÌA>T ñþ¾?=:IT=ÿô;vßJ¬>T‚ĵ‡¾QÃÞ`ïÈ=Õ×䇌e>-ý ®ýx¾ù‹öº½õ»T˶¬>¬¨XHe¾bDš ܾÎÝ`œ‘>®tõè¤Z¾ )ˆTH¾Âì¢ößú>$í"Ñ?½ýБbN¯ ¾²°‹×¤€>1 á„N½Ç|yÛéñ¾t<„›€>œÕë"”Ò=ø¾›¤ *¾Ôi½v\>æj@7÷Äygª¾²«D> b™æÝy>IØhŒ>ç¾µ5º_ë=û&´"ô¾%Û-¾ʇW„=uISwñ‹Á>Åw³ìa´¾)¸^Ÿ,½ûU?]DB>ÿanGñ\¾OP›òõ+¾ ZØúÓ>±Â)/QC¾ø·–Vôä¾ès­ëL>Ò5ÿŸL!½÷ûR1²÷¾¤§ÎUT>ka!•[Ó=Ê*'¶µ’°¾ ¶v~‡œ>$’Š É=þ^õ­°H]¾,Φ¨>šE …pt> ðZçihe¾«C¿'>LÕËà»>›i$ét澕&Uût0=ôHz·Á–>3Ì*£–„¾øB\x7½ÜVp'lv>õ.xèV¾ö²„:!¾ pßÃ>WÅk`*¾ÇGüX=<¾ ¹¢Ã0->š˜(wX4¾`t*¯T¦¾a¼QÁ{°>FsSk‹½ð‚‚Ä$¾Ï*}¨2Ù>lf v,s=æùÏusľçD|ô>2èKô>:,i%ì¾~sNu¦h>§'ìþ>®H¿¯í¾}ÙX¯ÿ>/m±»>7IñãJ¾äf›<<¬=æ®üKü0Ë>qû·éÀ¾Ç__yww½ðSj)ju>K×Zæ4¾Q!;–S羌´åáØ>œ9néÕ˾ }æ`–x¾欎”_Q>Oú7Ã5O¾»×"²%ÿ¾XV ->j7ùî$½Øl$ræ^Ú¾Hdhð>›@·Ó=õœ» uѾ¬ý'¸ãL>M˜x]pÔ>\Û45€¾®,¡op> ©¾‰Ã>f×¢¥Â¾s›Ì=üÉç˜^?>·k¢YÔ¾Õ®I¸¤‰=–§MÁ¥7>ÁMyge¿¾"j5CÜ]½ûUìE‚–g>ŸºJžÇ¾(ž‘§¾ ÅÅœ& ¨>®C“¯U±¾W’Õõ ¾42cæ^É>³Ö¦Æms½ö œ¨ö¾öå.D9>"Fùª4g=×rCW|Lö¾e½9$_>%c®óM>¹ª‚*t¾P/zËèª>ܺµ·²> ™±;Ä‘B¾™µt@#‡>VFÞMz>k8ßj]c¾=9ZÀ…=ïùÿ¾2Á>ç2Hzø^¾M5'ª~ ½é‘…ãן>ÿü*:ºc¾òÊÓèÓê¾÷\(¿Ù->ˆ|bEœ[¾Öúêý‹¾FhÖàe>iÓUß ¡¾ Ìçnc¾¨ÿ7àï>¤¬ØÙæ½àë‚–²ý.¾Ó®ì0&æ>QˆS]†=ó«ÌÄòE¾Œ7”ŠÓÌ>Ÿr‰Ï®>Z¡mM›à¾©œ¬ß­N> ¢ù|Çè×>È¡;ÿA¾öÀ1ä=üêŽJ¸Bz>䢭§¾ç-Þ¬…Æ=¬ôw¦ Ù>´ØŒÎ–¾-@RÝ16½û-\‚ü½O>0s —¾"XÔ'о Þ•O} K>¬¡J“¾G™ÔU#¾Q#´‘‹s>¦s\_|z½õ-g¼ ð¾æµ|»ä>þê!Ö+=ÜnXƘ _¾†Ϙe>Û˜ŸS>€ê Õ$¾`wBu¹>x5m×ä>v¿úß¾¾Œ½9ÛÕ >E R @?>Ø}Ó9P¾¨lJ³,=é¾{1<>E;©¾é2TL…½ï­ÖlÈ>?]ÉÇ2ì¾[Eiͧ¾ŽÜêŒ>šÞW:Ai¾ B ÿ¿b÷¾ ¬*š¾T>B±é¤½ì¾ W²58¾Y½Ô^–>:ýAkï½Ð8Θˆð¾\ßQ0> Ä6 i¥=ø]ÚŠmv¾Û œ>¨cú%—> ³÷§Ù˾®u"&í«> 5ßĈl§>Þ}Jl±t¾Ê ÷€y~=÷E¼>·i>ÌiE#­¾:¥ íD½Ôþp»Æ>YÔ×­*¾#¯cn,æ¾½¯–k>PN0xQ¾à ¨eþŽ¾ äÉ¢EÃJ>’“¤…öÔ¾ÎëB¿?¾¨#¤P ¦>q–iìž½ë{¡6•íþ¾*>[gö>(¡zg=íèÆb®B¾4¹ð—îo>mß良„>eØJ Ù©¾™/ð¶Sï> QoùÖò“> wüç|m¾Aän$> ¡ý >aJkGL¾3 æ“Ë_=ÍSüQ×êE>i“;4œz¾Š”™[4ä½ùfªØÔŸ>äÂî„»ù¾~æk„†‹¾ ¿LØÖ¢>¬®­7,0¾¶¤îx‘I¾ŽëIã€>´™šž9½õïàáÇ,å¾BXý7> CŸeÀ=Ûx7Éx3¾‚ùõ°E>Õ)þÍæ6>¤þšx¾bŸiæØ>TPóŸ>Ð8Bt‚9¾„…ÑÇ >µ!ˆÜq>#|¾åã\¹Îo=æOrV1’L>‚nµà™=¾žn;S_ê½ñÉRS— k>kíöoA¾ßMjÙÞI¾Ø5Â[E±>¤eOÜâr¾ àÊNþ‘¾¸¢S‚>9>”‚½ü«Tо÷OEkg >ÎúLDûÄ=‚'O×0¾×@Ýé ª>êÇv£ß=üöXœò­¾v83‰>¦†‹ƒº8> •ù»q«¾£4˜j¹j>¤œ*Üò>ôÄÞ#×¾bƒØ#<ì=ñ;nŠ ý>³#X¥‚¾l²‰0çç½ç¿©¨­ß5>õÐ"GßC¾î©ô‡Ä7¾$ˆX«+>‰ÁÍc—¹¾Y¨ýý†¾’G`¨H—>U¤cd/u¾ÿ'l[Òx¥ú<½Ô݇m˜ìê¾?$8z²>º “%=÷å åÁ1¾Õ 2C~>§Á<¿6Á> É¿Mš;@¾«ùùâYª>åékn> NQÅ®í¾µêOù;º=õîiî‹„6>¡Gp秾ïq±/r½Ý#Ž’ñ™>Ž‰”蔾¶bRä°p¾ ›‹Œé·>iL“[b¾qûz6’¾W¬`ëqÁ>yg·C¾ü]!º+¾^÷x¸êq>¼‰á†ó½âsTyIJ¡¾Ä£Âx÷>L•~}×L=ôh¹gë¾—9;3 >_¶ï¯«>ÖÀLÖd¾©Ôá£ØŒ> ƒÓ;ù‘ï>YÄwè$¾êŒÒÀ¢ÿ=ùK‹Ür“>„ºá:ià¾dkZ pŸ½Ð |`*«>>ûmxP;>Ttƒ:¾‹yD3.û>LVÇ¢{(¾¸àöa̾²Ã’ø>‹¾PUfF¾UAD¾à™‚c`>ø=ÖfÝß½çÓ¬‡[駾n>Ê­U>ª½…4Þ=ñ—"†G²ò¾j|E%ÊH>ÔŠš¢M´>ÜQ†&ô¾¤o‘ KV> ‡·X„^>ç™çm“¾ÿx;=û^1.Âh>2YÒ¾ž>úQǽÀM ¿D×0> ã‹ú1^¾ŒÃ ¯½ÿUòÎ j·>9?ä9\¾àÐ’x°¾ Yº=€>“àkzgß¾(t“,#¾›ÕÔ©þ>b «·½ê Ò_>?×¾@Ö很l>׫ïaÏû=ðX>"q‰ë¾Sug°/> òu[ùM>€HÓÙ¼¾ Ì™V™> øŒUb@N>¶›’¦—¹¾:–iŽÐ=ü1°t¡o`>äé¯-¾²ÓŠ±ݽµmMJgPF>ûT"¿W¾¤ÚW_½þÎjÍdð>3$ŦÉó¾)åÖ±,T¾ -JÁÉÜ>•– C†¾3"4˜F>¾OYÅ €>äž 'S½êêà¬1¸Ô¾=Øؘ‚q=ðY2‹3­ü¾T^Åàð>¬ÓT…ã>‘çþ¡3’¾ ö¨î·> ÛwÞ Û>Åè(N0‚¾:-ß#ù=ûÌø3-ÎŽ>#¯C£í¼¾¤P˜@4‡½¾A–©a> ¾ö 6?¾‰î2þ*½ÿz”›?‘>;éÈ¿¾ÿÖvV“¾ Šáƒ#!R>ˉE¾ÁŠ½Ïg@¾¼ÃÍÞ™ë>Åê}½è½v_I7¾bù™XD>®rÉŠ\=ñ“f¤á•Ò¾k›Iž§ä>ÅËn©7ç>5a€ñ&ò¾¤d(ú¯> 2´®¯á>ÄlºbF¾ø¶|gq”=ú6õ?/Û>eöŒ*–¾r|àë4½ÍSÇ3ù¹>9zåU\¾:~üô¾©²…´€>Ní‹&¦ƒ¾•çüÉ ¾n›© É>ƒHa{ʾ½ÿÛæ¾ £ê²•&>Òz¹À—‡½ä%iÚå‡g¾¯+>nP >WtÎâ½é=óþ<7hɾ—O”«Nd>Jáþß¾>e×!ØK¾¨M?„ò> þ‘c¶[Å>ÖÌqʾÏéLlÿ“=÷pÓ`9; >ÕB“¾=¹Ø•°½ÚŒZ ÷ýX>ƒ‡’òÀp¾¶.Çb?þ&½gÚ„;>jÜŒõP³¾ÑÏ?L’n¾Ñ 8#ˆ>jÖe¦Æ¾&7®„>¾¶»?ƒÙ.>‚›l”çÖ½ÚZ€™&ý\¾ ÄJÛK>Ñ”ƒ‡±=÷{ƒ¯~a¾ÒÜRxÂ>’û náA> ¾´`j ¾§sÕž">=©ê^X+>]8 œ ƒ¾'‡^G=ómt+t>k€º¬sE¾š9¬R.½å‹UÎÔU>âÏ8P¾ù{DÖ±ˆ¾-€+B®s>ˆ¥;òG…¾ òè=Ìs¾ÔUAL|">@ž‰8½ÿø‹ɾy 4ô¾=>¼É·n½¾ýÈZK)9¾¦ÉC>àpTË=ü={W澊Èæ¶>›g× > Iøe ýϾšöËîß±>íkØ{”‚>Måî<çK¾/´SªÙÕ=ìÉQ÷žýö>" ´j¾éõÏT}1½ðö&“Ê>Op–¬™M¾»Åe¾µ'QÈ> ‘räþ¾ ˆ}9$ñz¾ô‡ØÐÊÞ>ü¿]ß½ú}<­¼¾`(/Y¡e>o¯J1bÆ=ÎÒËËúŒ¾A:Ô2­0>#6¡¬š>ú*dç¾UŸf×4>_i;¾9D>éel |¾yZÍ+«q> Ät?È.>g?ƒX=?¾©>xƒ¼Î=àG…ÔÄI>ïMàí–¾MóùàĽö\r£TQ>¿I¬9Ô“¾Äæ“I~q¾ ±ÁGSd>¦Èƒ{¾2<$mÒ¾AñÕ†¯>•¬/Ig“½óÙAS\i¾bàæ¤>MÅ•l£=åyõ@Û¯¤¾ãú–â1i>ï¬5ø£>P ¤9Û¾ŠLHþc> ·ò¢¡ú>ôNCtì¾8a~R+=ÿ%ðϧ>ŸhKÚ¾òRìˆÒ=¨y¡m²6š>ÈLôe¾Þ‡9Ñ}ÿ½ý¯2-U±>&oà l¾B˜®y³¾ ƒRu4S>‘3Ñ7|ñ¾ûÑ]£¤¾°8ñcÕ>zµWì½è!¤Ûäd©¾s[)±€>ŽZ¹à%–=ò¨­nÕ¸%¾—g¤_>u¯íp>qÆꧦ¾¥›‰O@Â> þ´×zP>™â®ÕÐ¥¾Ë ØA2=÷ ëðràf>êVDÉ?¾ÿȹ'>?½ÞºÁÀ$o·>ŸH “’»¾sƒ?/ÈO¾óÌúacà>wG¡sŠ¾è££ñ¾e@º8ž¨>R XÅÇc¾ÑA|µ?¾5ÅÞŽ‡>1d {›æ½ÉY.ÙHÛL¾†`é‚”->9`>ü¹=û†kçÕWd¾ Ê9\e>®/ ù> /A$8e¾™e¦QÌä>ß ?·a&>Y±ú›”¾%47¸G=ë 5ÒÉ->:Þøÿ¾Ljäÿóà½ñ ñõ_ù>eË£‰Ðó¾º?ÿ—Ÿ'¾q®pÙµç>¢ŠŒ`‰Í¾ ©î›É²$¾^Z¦¾§.]jío¾Hà#»v>TM Ó±½ô±RrµÙ¾þHSé>_™F"ôâ=Æ /KØ™`¾ûûv«@>&FXÖCA=ú [ - g¾ëì¬Ñ>ï{>>@ßkÒ¾¹¢-ô·> @8ŸPlý>?§ó4)×¾[û>{¼>Y½hÀ­>²¶»Î/Š¾Õ¢s°KzÌ&m¾4ݬb,c½è^ÿ1þ†%>äÓ’¶îs¾“QyH?¾µFKœ¯”>c*•Ú¨¹¾ë—£úz¾ ¡ËÙê†D>¶N—»¾Í©.˜o¾6ªÉŽä×>ÙÆ –f|½øõ„ôj'¾Y@ýŠ˜>ÕG”I^½´… ì²÷·¾WsÑøs>¼nX-T=öxñ{ûgO¾±4Y²w„>®¾?ä>¬Ñ‰p»¾­µ( Ýù> ¦æ¹6²¡>›DÉb°\¾w’Dz™«>»•…J >5¨{vÄ¢¾ífxÿ=ì)ÆÛÁ>õ8ˆÇ˜¾„{ÜãÛ½ãÍÜyO½×>²z¾í¼Cm¦¾Á]'QÒú>N¬%믑¾q7!]¾ ãœAÒPÒ>¹5i¯‚Ú¾y+@[W¾ò’ X¤>ì+‘AȽú`D“ʾ-ÄÈȃ>îÚeºn½Á2äeAw"¾v8¾ ² >Õ,V€=õê¼­¾¨kr›á¤>¾ÄYˆ%,>wM1ÃP¾¬ 8î³è> ¬4Å–‹a>©Ê³t¾u`:’ÇP>£¢+>D€ÀD¾lŒC”§=ë[/ÜS > ÜŽÏоj‰àuɽå~€eºr>ÇŒ£&¾¿_µé~y¾MüÁšä">Zéü·¹Y¾*S<5G¾ †gíèý²>´p%¼!Ѿ·l1¸úm¾GÖ¶D«Ó>ÎÒþ«½ø0 ™2RϾ~ÙÕEØ>²wErnª=zA£çIs¾¸ÅŽ³iñ>uB%qéÞ=øjqRÔÝ—¾ÓÆâep>9-šg½•>Ü–•áàÔ¾µZŽÕ@> V£Ò»“>B`p÷„¾U)6u>Ú¨‚É–>Û™´ÈûZ¾µm1NaÈ=ãÑà²\à>ˆ áÖ¾æ¯ç§cO½íSYW`úñ>DàRB+¾Ép†´z¾Q<¶ëÏÑ>86$ê¾?ÚâP¾}Ý©†> bus¢Š¾†ûœfï¾.D¶áp>yxø8]½ó?8"=.Þ¾@û¸W> `X S=Õ«Õ íŸ¾HÏÛâÀ>•WA`Œm=ýàjéH¾#MHÞ>Ss?³> ˆ@ܘSb¾ºß¢I”> žå:c>~h·L§­¾ÌRéZ=ûÚ¾e=ξ>ì EQ§¾Î{½‹=ÉÞû·&žN>ZåqÀTw¾êщmé½õŽŒ½¹8>£»]áϾ¸žÌüþ¾¶œ#´©>«à„Ý«¾ MsŸPȾÕ&³ø¬[>f±/Nv»¾Þp]„R ¾’õ£Ôce>Ö2kXëq½æ‹Q dÝá¾^¶ ú> ݇\ªõ=ëo¹“W·¾ <À¬>#\œÀñ>Y~|­ß¾}'˜¡>K]È(>o¾áB<<¾Ÿ<"]Ñó>p$M ²>;õ€R¾påÃÜ#=ò¦׎Õ>Z«3¹å¾ü#u¶Â½Ù¾3Ò¬·ÿ>d9lmH˾^~Ù”ê½ÿBl?)le>4ø£Û¾¿;ó᩾ ZÈsî¯>¶ý.%…̾¦ßÜAã¾î/àP‰>ã`ïK3u½ù`±Sü™¾W~÷,g>¯cÿO½’•aLá…¾³c¨JlÍ>l?$dzÈ=øÙúçr#¾ÛÁêq˜“>ÒçX’#>qz€,¾¶ ƒ"—s©>®¾z=¾7É•VrÁ=ÿoÍÀx~]>XvÐ2°ì¾e±÷o=Ù“¾O Â¿>þÒæó€Á¾RKÒ½òöþ%µ¬~>vŽD€^“¾"]Ðw¤ú¾½ð¾{e>¡¥º8w>¾ íˆJ_¾‚N+ Læ>q^-&Gɾnù®)¥¾e;ƒOá/>æþPVð½çÓþew¾M†Ž’bf>b1ùZÒ=ë5qyñƒ¾ Dß\Î6>´† !>B¸ƒL ¾€9ð•r> .Rö>׳㾗õ¨‹õ>Ñ®ð}Ø>€XÍ*¬Ã¾NŒÝÖ¼š=ðÑSpò >¢¥¼:Ë ¾µðýí½áž”`˜‚> - a%¾èpB­B¾àä^‚>Ur¥Sy;¾.•q®¾ Ý+^ki·>«ëkgM¾è€%ÂR@¾®™×ƒÔÑ>žË”Y¥l½õ!ô­ÿ| ¾¯/Å0>9§¯Òà =ÒDÔ¥ƒ|7¾9U ÞÊ>˜Ehš1S=þÀÙÝ4f¾'0tT·…>å+ûÇ-> âá7  ÐŒ>²~è‡ ø>ñ–MÍᶾÜòžÎb´=øØ´£ç>r’KÕ·¾¦“ß}X½¬óÐHu‹>Ø5ÓXo¾*É¥/±½ú¢þ¿´ÍŠ>÷½"G¾”³ì§ÎȾ rÕŸ,Æ>¶Ë>LCš¾ 5ˆVÐýê¾M°[´ˆ> $P’(q½ûýzDC.³¾ó|±þÿ~>ûٶ€½Á™#¹ù‡¾É¿»%Ï>¡&ŠUÿé=÷¸gTŠ¾Ëv; xõ>#]@)b>CQˆW¸¾³‡¿2S> q‡¯×µ?>ÁC˜²›{¾-šMìÑ8=þŽâ°¸÷>‡H”@¾?8_z±=Òê ¿JÐ>7g6$v±¾ÿ2{5ØʽõZš+åu>£ÄTW’¾”ÅÕÍàl¾6l´'†È>­é"FS¾ lR'ï;¾Q)ó©%>E‚J6x¾JI¾µ¸¾0|a÷rý>pó:@ãÓ½ÚÓïO‘ª¾ü8æ!t“>EE Šýô=ó„¨4Až¾ƒî8Ó€>é(‰ºË{>hðûe¾§ {’ ¹> $³gÇz£>û柿xW¾V!y5¶>w—ó<ÿ>ïÉ”"²¾”?VD™¼=à<èß9S>Ð;M•k_¾vr»Ê1½½ò< I>³>l"²d`=¾# yâ$¾Ûæªñ%¨>¡K·Áçé¾   >F¾ÃÏÚÌŸ>_•vî(¾ù§¿«Q¾ÆŽKÿ ®>¨ý#®Øc½áûÙÉìIy¾µÈ<»d>’e”±ù=ñ|¦³‡W¾^¡CÙ~>B(¹AŸÝ>RWF¾ži²%> ÜÖ W„>§Ä¾™ ý¾dí’‚#>µë§J÷>´dÝÿ“Ǿ±sèñp=âžžiÉöŸ>«Þ4eº,¾›ZZ¹kÜl8¾Hrø,2ñ¾„ˆ«…›Ó>pÙ¾ ÞÂD¥í¾©#ÈË'Ý>b¿/¿­À¾©Rèjýh¾ºu™¥Ö>¬«^Ab½â3‡C䓱¾´½#>1ßÿê=ñ› Üchõ¾aºÐn•/>4²…Ä2^>¸¨¡¢¿‘¾Ÿ¹L±»©> £ëZ"¥C>Æ>¯ÙÏ=¾]\Ì3]>Ze3ðü>×4êè†ú¾›êj¨›=à°ÓÚÔ_Œ>Ì™å=³¾rE¼Œ“O½òw!e%.ä>qÚ“—¨X¾wg€€¾-‚Õ@&\>£‹vŲ¾ .ÞH²ð¾ÿèãš°Ê>Qyéþ!¾Ë´vpåå¾ SxUƒ>}a†÷J½ÜH‡6hGN¾ö¯¤Lû>?Þo(ɽ=óÖ¤V?ﾋÀ3ö+4>Áø”]>ß3í³û¾©]ƒñò> |—ŠÌA>T ñþ¾?=:IT=ÿô;vßJ¬>T‚ĵ‡¾QÃÞ`ïÈ=Õ×䇌e>-ý ®ýx¾ù‹öº½õ»T˶¬>¬¨XHe¾bDš ܾÎÝ`œ‘>®tõè¤Z¾ )ˆTH¾Âì¢ößú>$í"Ñ?½ýБbN¯ ¾²°‹×¤€>1 á„N½Ç|yÛéñ¾t<„›€>œÕë"”Ò=ø¾›¤ *¾Ôi½v\>æj@7÷Äygª¾²«D> b™æÝy>IØhŒ>ç¾µ5º_ë=û&´"ô¾%Û-¾ʇW„=uISwñ‹Á>Åw³ìa´¾)¸^Ÿ,½ûU?]DB>ÿanGñ\¾OP›òõ+¾ ZØúÓ>±Â)/QC¾ø·–Vôä¾ès­ëL>Ò5ÿŸL!½÷ûR1²÷¾¤§ÎUT>ka!•[Ó=Ê*'¶µ’°¾ ¶v~‡œ>$’Š É=þ^õ­°H]¾,Φ¨>šE …pt> ðZçihe¾«C¿'>LÕËà»>›i$ét澕&Uût0=ôHz·Á–>3Ì*£–„¾øB\x7½ÜVp'lv>õ.xèV¾ö²„:!¾ pßÃ>WÅk`*¾ÇGüX=<¾ ¹¢Ã0->š˜(wX4¾`t*¯T¦¾a¼QÁ{°>FsSk‹½ð‚‚Ä$¾Ï*}¨2Ù>lf v,s=æùÏusľçD|ô>2èKô>:,i%ì¾~sNu¦h>§'ìþ>®H¿¯í¾}ÙX¯ÿ>/m±»>7IñãJ¾äf›<<¬=æ®üKü0Ë>qû·éÀ¾Ç__yww½ðSj)ju>K×Zæ4¾Q!;–S羌´åáØ>œ9néÕ˾ }æ`–x¾欎”_Q>Oú7Ã5O¾»×"²%ÿ¾XV ->j7ùî$½Øl$ræ^Ú¾Hdhð>›@·Ó=õœ» uѾ¬ý'¸ãL>M˜x]pÔ>\Û45€¾®,¡op> ©¾‰Ã>f×¢¥Â¾s›Ì=üÉç˜^?>·k¢YÔ¾Õ®I¸¤‰=–§MÁ¥7>ÁMyge¿¾"j5CÜ]½ûUìE‚–g>ŸºJžÇ¾(ž‘§¾ ÅÅœ& ¨>®C“¯U±¾W’Õõ ¾42cæ^É>³Ö¦Æms½ö œ¨ö¾öå.D9>"Fùª4g=×rCW|Lö¾e½9$_>%c®óM>¹ª‚*t¾P/zËèª>ܺµ·²> ™±;Ä‘B¾™µt@#‡>VFÞMz>k8ßj]c¾=9ZÀ…=ïùÿ¾2Á>ç2Hzø^¾M5'ª~ ½é‘…ãן>ÿü*:ºc¾òÊÓèÓê¾÷\(¿Ù->ˆ|bEœ[¾Öúêý‹¾FhÖàe>iÓUß ¡¾ Ìçnc¾¨ÿ7àï>¤¬ØÙæ½àë‚–²ý.¾Ó®ì0&æ>QˆS]†=ó«ÌÄòE¾Œ7”ŠÓÌ>Ÿr‰Ï®>Z¡mM›à¾©œ¬ß­N> ¢ù|Çè×>È¡;ÿA¾öÀ1ä=üêŽJ¸Bz>䢭§¾ç-Þ¬…Æ=¬ôw¦ Ù>´ØŒÎ–¾-@RÝ16½û-\‚ü½O>0s —¾"XÔ'о Þ•O} K>¬¡J“¾G™ÔU#¾Q#´‘‹s>¦s\_|z½õ-g¼ ð¾æµ|»ä>þê!Ö+=ÜnXƘ _¾†Ϙe>Û˜ŸS>€ê Õ$¾`wBu¹>x5m×ä>v¿úß¾¾Œ½9ÛÕ >E R @?>Ø}Ó9P¾¨lJ³,=é¾{1<>E;©¾é2TL…½ï­ÖlÈ>?]ÉÇ2ì¾[Eiͧ¾ŽÜêŒ>šÞW:Ai¾ B ÿ¿b÷¾ ¬*š¾T>B±é¤½ì¾ W²58¾Y½Ô^–>:ýAkï½Ð8Θˆð¾\ßQ0> Ä6 i¥=ø]ÚŠmv¾Û œ>¨cú%—> ³÷§Ù˾®u"&í«> 5ßĈl§>Þ}Jl±t¾Ê ÷€y~=÷E¼>·i>ÌiE#­¾:¥ íD½Ôþp»Æ>YÔ×­*¾#¯cn,æ¾½¯–k>PN0xQ¾à ¨eþŽ¾ äÉ¢EÃJ>’“¤…öÔ¾ÎëB¿?¾¨#¤P ¦>q–iìž½ë{¡6•íþ¾*>[gö>(¡zg=íèÆb®B¾4¹ð—îo>mß良„>eØJ Ù©¾™/ð¶Sï> QoùÖò“> wüç|m¾Aän$> ¡ý >aJkGL¾3 æ“Ë_=ÍSüQ×êE>i“;4œz¾Š”™[4ä½ùfªØÔŸ>äÂî„»ù¾~æk„†‹¾ ¿LØÖ¢>¬®­7,0¾¶¤îx‘I¾ŽëIã€>´™šž9½õïàáÇ,å¾BXý7> CŸeÀ=Ûx7Éx3¾‚ùõ°E>Õ)þÍæ6>¤þšx¾bŸiæØ>TPóŸ>Ð8Bt‚9¾„…ÑÇ >µ!ˆÜq>#|¾åã\¹Îo=æOrV1’L>‚nµà™=¾žn;S_ê½ñÉRS— k>kíöoA¾ßMjÙÞI¾Ø5Â[E±>¤eOÜâr¾ àÊNþ‘¾¸¢S‚>9>”‚½ü«Tо÷OEkg >ÎúLDûÄ=‚'O×0¾×@Ýé ª>êÇv£ß=üöXœò­¾v83‰>¦†‹ƒº8> •ù»q«¾£4˜j¹j>¤œ*Üò>ôÄÞ#×¾bƒØ#<ì=ñ;nŠ ý>³#X¥‚¾l²‰0çç½ç¿©¨­ß5>õÐ"GßC¾î©ô‡Ä7¾$ˆX«+>‰ÁÍc—¹¾Y¨ýý†¾’G`¨H—>U¤cd/u¾ÿ'l[Òx¥ú<½Ô݇m˜ìê¾?$8z²>º “%=÷å åÁ1¾Õ 2C~>§Á<¿6Á> É¿Mš;@¾«ùùâYª>åékn> NQÅ®í¾µêOù;º=õîiî‹„6>¡Gp秾ïq±/r½Ý#Ž’ñ™>Ž‰”蔾¶bRä°p¾ ›‹Œé·>iL“[b¾qûz6’¾W¬`ëqÁ>yg·C¾ü]!º+¾^÷x¸êq>¼‰á†ó½âsTyIJ¡¾Ä£Âx÷>L•~}×L=ôh¹gë¾—9;3 >_¶ï¯«>ÖÀLÖd¾©Ôá£ØŒ> ƒÓ;ù‘ï>YÄwè$¾êŒÒÀ¢ÿ=ùK‹Ür“>„ºá:ià¾dkZ pŸ½Ð |`*«>>ûmxP;>Ttƒ:¾‹yD3.û>LVÇ¢{(¾¸àöa̾²Ã’ø>‹¾PUfF¾UAD¾à™‚c`>ø=ÖfÝß½çÓ¬‡[駾n>Ê­U>ª½…4Þ=ñ—"†G²ò¾j|E%ÊH>ÔŠš¢M´>ÜQ†&ô¾¤o‘ KV> ‡·X„^>ç™çm“¾ÿx;=û^1.Âh>2YÒ¾ž>úQǽÀM ¿D×0> ã‹ú1^¾ŒÃ ¯½ÿUòÎ j·>9?ä9\¾àÐ’x°¾ Yº=€>“àkzgß¾(t“,#¾›ÕÔ©þ>b «·½ê Ò_>?×¾@Ö很l>׫ïaÏû=ðX>"q‰ë¾Sug°/> òu[ùM>€HÓÙ¼¾ Ì™V™> øŒUb@N>¶›’¦—¹¾:–iŽÐ=ü1°t¡o`>äé¯-¾²ÓŠ±ݽµmMJgPF>ûT"¿W¾¤ÚW_½þÎjÍdð>3$ŦÉó¾)åÖ±,T¾ -JÁÉÜ>•– C†¾3"4˜F>¾OYÅ €>äž 'S½êêà¬1¸Ô¾=Øؘ‚q=ðY2‹3­ü¾T^Åàð>¬ÓT…ã>‘çþ¡3’¾ ö¨î·> ÛwÞ Û>Åè(N0‚¾:-ß#ù=ûÌø3-ÎŽ>#¯C£í¼¾¤P˜@4‡½¾A–©a> ¾ö 6?¾‰î2þ*½ÿz”›?‘>;éÈ¿¾ÿÖvV“¾ Šáƒ#!R>ˉE¾ÁŠ½Ïg@¾¼ÃÍÞ™ë>Åê}½è½v_I7¾bù™XD>®rÉŠ\=ñ“f¤á•Ò¾k›Iž§ä>ÅËn©7ç>5a€ñ&ò¾¤d(ú¯> 2´®¯á>ÄlºbF¾ø¶|gq”=ú6õ?/Û>eöŒ*–¾r|àë4½ÍSÇ3ù¹>9zåU\¾:~üô¾©²…´€>Ní‹&¦ƒ¾•çüÉ ¾n›© É>ƒHa{ʾ½ÿÛæ¾ £ê²•&>Òz¹À—‡½ä%iÚå‡g¾¯+>nP >WtÎâ½é=óþ<7hɾ—O”«Nd>Jáþß¾>e×!ØK¾¨M?„ò> þ‘c¶[Å>ÖÌqʾÏéLlÿ“=÷pÓ`9; >ÕB“¾=¹Ø•°½ÚŒZ ÷ýX>ƒ‡’òÀp¾¶.Çb?þ&½gÚ„;>jÜŒõP³¾ÑÏ?L’n¾Ñ 8#ˆ>jÖe¦Æ¾&7®„>¾¶»?ƒÙ.>‚›l”çÖ½ÚZ€™&ý\¾ ÄJÛK>Ñ”ƒ‡±=÷{ƒ¯~a¾ÒÜRxÂ>’û náA> ¾´`j ¾§sÕž">=©ê^X+>]8 œ ƒ¾'‡^G=ómt+t>k€º¬sE¾š9¬R.½å‹UÎÔU>âÏ8P¾ù{DÖ±ˆ¾-€+B®s>ˆ¥;òG…¾ òè=Ìs¾ÔUAL|">@ž‰8½ÿø‹ɾy 4ô¾=>¼É·n½¾ýÈZK)9¾¦ÉC>àpTË=ü={W澊Èæ¶>›g× > Iøe ýϾšöËîß±>íkØ{”‚>Måî<çK¾/´SªÙÕ=ìÉQ÷žýö>" ´j¾éõÏT}1½ðö&“Ê>Op–¬™M¾»Åe¾µ'QÈ> ‘räþ¾ ˆ}9$ñz¾ô‡ØÐÊÞ>ü¿]ß½ú}<­¼¾`(/Y¡e>o¯J1bÆ=ÎÒËËúŒ¾A:Ô2­0>#6¡¬š>ú*dç¾UŸf×4>_i;¾9D>éel |¾yZÍ+«q> Ät?È.>g?ƒX=?¾©>xƒ¼Î=àG…ÔÄI>ïMàí–¾MóùàĽö\r£TQ>¿I¬9Ô“¾Äæ“I~q¾ ±ÁGSd>¦Èƒ{¾2<$mÒ¾AñÕ†¯>•¬/Ig“½óÙAS\i¾bàæ¤>MÅ•l£=åyõ@Û¯¤¾ãú–â1i>ï¬5ø£>P ¤9Û¾ŠLHþc> ·ò¢¡ú>ôNCtì¾8a~R+=ÿ%ðϧ>ŸhKÚ¾òRìˆÒ=¨y¡m²6š>ÈLôe¾Þ‡9Ñ}ÿ½ý¯2-U±>&oà l¾B˜®y³¾ ƒRu4S>‘3Ñ7|ñ¾ûÑ]£¤¾°8ñcÕ>zµWì½è!¤Ûäd©¾s[)±€>ŽZ¹à%–=ò¨­nÕ¸%¾—g¤_>u¯íp>qÆꧦ¾¥›‰O@Â> þ´×zP>™â®ÕÐ¥¾Ë ØA2=÷ ëðràf>êVDÉ?¾ÿȹ'>?½ÞºÁÀ$o·>ŸH “’»¾sƒ?/ÈO¾óÌúacà>wG¡sŠ¾è££ñ¾e@º8ž¨>R XÅÇc¾ÑA|µ?¾5ÅÞŽ‡>1d {›æ½ÉY.ÙHÛL¾†`é‚”->9`>ü¹=û†kçÕWd¾ Ê9\e>®/ ù> /A$8e¾™e¦QÌä>ß ?·a&>Y±ú›”¾%47¸G=ë 5ÒÉ->:Þøÿ¾Ljäÿóà½ñ ñõ_ù>eË£‰Ðó¾º?ÿ—Ÿ'¾q®pÙµç>¢ŠŒ`‰Í¾ ©î›É²$¾^Z¦¾§.]jío¾Hà#»v>TM Ó±½ô±RrµÙ¾þHSé>_™F"ôâ=Æ /KØ™`¾ûûv«@>&FXÖCA=ú [ - g¾ëì¬Ñ>ï{>>@ßkÒ¾¹¢-ô·> @8ŸPlý>?§ó4)×¾[û>{¼>Y½hÀ­>²¶»Î/Š¾Õ¢s°KzÌ&m¾4ݬb,c½è^ÿ1þ†%>äÓ’¶îs¾“QyH?¾µFKœ¯”>c*•Ú¨¹¾ë—£úz¾ ¡ËÙê†D>¶N—»¾Í©.˜o¾6ªÉŽä×>ÙÆ –f|½øõ„ôj'¾Y@ýŠ˜>ÕG”I^½´… ì²÷·¾WsÑøs>¼nX-T=öxñ{ûgO¾±4Y²w„>®¾?ä>¬Ñ‰p»¾­µ( Ýù> ¦æ¹6²¡>›DÉb°\¾w’Dz™«>»•…J >5¨{vÄ¢¾ífxÿ=ì)ÆÛÁ>õ8ˆÇ˜¾„{ÜãÛ½ãÍÜyO½×>²z¾í¼Cm¦¾Á]'QÒú>N¬%믑¾q7!]¾ ãœAÒPÒ>¹5i¯‚Ú¾y+@[W¾ò’ X¤>ì+‘AȽú`D“ʾ-ÄÈȃ>îÚeºn½Á2äeAw"¾v8¾ ² >Õ,V€=õê¼­¾¨kr›á¤>¾ÄYˆ%,>wM1ÃP¾¬ 8î³è> ¬4Å–‹a>©Ê³t¾u`:’ÇP>£¢+>D€ÀD¾lŒC”§=ë[/ÜS > ÜŽÏоj‰àuɽå~€eºr>ÇŒ£&¾¿_µé~y¾MüÁšä">Zéü·¹Y¾*S<5G¾ †gíèý²>´p%¼!Ѿ·l1¸úm¾GÖ¶D«Ó>ÎÒþ«½ø0 ™2RϾ~ÙÕEØ>²wErnª=zA£çIs¾¸ÅŽ³iñ>uB%qéÞ=øjqRÔÝ—¾ÓÆâep>9-šg½•>Ü–•áàÔ¾µZŽÕ@> V£Ò»“>B`p÷„¾U)6u>Ú¨‚É–>Û™´ÈûZ¾µm1NaÈ=ãÑà²\à>ˆ áÖ¾æ¯ç§cO½íSYW`úñ>DàRB+¾Ép†´z¾Q<¶ëÏÑ>86$ê¾?ÚâP¾}Ý©†> bus¢Š¾†ûœfï¾.D¶áp>yxø8]½ó?8"=.Þ¾@û¸W> `X S=Õ«Õ íŸ¾HÏÛâÀ>•WA`Œm=ýàjéH¾#MHÞ>Ss?³> ˆ@ܘSb¾ºß¢I”> žå:c>~h·L§­¾ÌRéZ=ûÚ¾e=ξ>ì EQ§¾Î{½‹=ÉÞû·&žN>ZåqÀTw¾êщmé½õŽŒ½¹8>£»]áϾ¸žÌüþ¾¶œ#´©>«à„Ý«¾ MsŸPȾÕ&³ø¬[>f±/Nv»¾Þp]„R ¾’õ£Ôce>Ö2kXëq½æ‹Q dÝá¾^¶ ú> ݇\ªõ=ëo¹“W·¾ <À¬>#\œÀñ>Y~|­ß¾}'˜¡>K]È(>o¾áB<<¾Ÿ<"]Ñó>p$M ²>;õ€R¾påÃÜ#=ò¦׎Õ>Z«3¹å¾ü#u¶Â½Ù¾3Ò¬·ÿ>d9lmH˾^~Ù”ê½ÿBl?)le>4ø£Û¾¿;ó᩾ ZÈsî¯>¶ý.%…̾¦ßÜAã¾î/àP‰>ã`ïK3u½ù`±Sü™¾W~÷,g>¯cÿO½’•aLá…¾³c¨JlÍ>l?$dzÈ=øÙúçr#¾ÛÁêq˜“>ÒçX’#>qz€,¾¶ ƒ"—s©>®¾z=¾7É•VrÁ=ÿoÍÀx~]>XvÐ2°ì¾e±÷o=Ù“¾O Â¿>þÒæó€Á¾RKÒ½òöþ%µ¬~>vŽD€^“¾"]Ðw¤ú¾½ð¾{e>¡¥º8w>¾ íˆJ_¾‚N+ Læ>q^-&Gɾnù®)¥¾e;ƒOá/>æþPVð½çÓþew¾M†Ž’bf>b1ùZÒ=ë5qyñƒ¾ Dß\Î6>´† !>B¸ƒL ¾€9ð•r> .Rö>׳㾗õ¨‹õ>Ñ®ð}Ø>€XÍ*¬Ã¾NŒÝÖ¼š=ðÑSpò >¢¥¼:Ë ¾µðýí½áž”`˜‚> - a%¾èpB­B¾àä^‚>Ur¥Sy;¾.•q®¾ Ý+^ki·>«ëkgM¾è€%ÂR@¾®™×ƒÔÑ>žË”Y¥l½õ!ô­ÿ| ¾¯/Å0>9§¯Òà =ÒDÔ¥ƒ|7¾9U ÞÊ>˜Ehš1S=þÀÙÝ4f¾'0tT·…>å+ûÇ-> âá7  ÐŒ>²~è‡ ø>ñ–MÍᶾÜòžÎb´=øØ´£ç>r’KÕ·¾¦“ß}X½¬óÐHu‹>Ø5ÓXo¾*É¥/±½ú¢þ¿´ÍŠ>÷½"G¾”³ì§ÎȾ rÕŸ,Æ>¶Ë>LCš¾ 5ˆVÐýê¾M°[´ˆ> $P’(q½ûýzDC.³¾ó|±þÿ~>ûٶ€½Á™#¹ù‡¾É¿»%Ï>¡&ŠUÿé=÷¸gTŠ¾Ëv; xõ>#]@)b>CQˆW¸¾³‡¿2S> q‡¯×µ?>ÁC˜²›{¾-šMìÑ8=þŽâ°¸÷>‡H”@¾?8_z±=Òê ¿JÐ>7g6$v±¾ÿ2{5ØʽõZš+åu>£ÄTW’¾”ÅÕÍàl¾6l´'†È>­é"FS¾ lR'ï;¾Q)ó©%>E‚J6x¾JI¾µ¸¾0|a÷rý>pó:@ãÓ½ÚÓïO‘ª¾ü8æ!t“>EE Šýô=ó„¨4Až¾ƒî8Ó€>é(‰ºË{>hðûe¾§ {’ ¹> $³gÇz£>û柿xW¾V!y5¶>w—ó<ÿ>ïÉ”"²¾”?VD™¼=à<èß9S>Ð;M•k_¾vr»Ê1½½ò< I>³>l"²d`=¾# yâ$¾Ûæªñ%¨>¡K·Áçé¾   >F¾ÃÏÚÌŸ>_•vî(¾ù§¿«Q¾ÆŽKÿ ®>¨ý#®Øc½áûÙÉìIy¾µÈ<»d>’e”±ù=ñ|¦³‡W¾^¡CÙ~>B(¹AŸÝ>RWF¾ži²%> ÜÖ W„>§Ä¾™ ý¾dí’‚#>µë§J÷>´dÝÿ“Ǿ±sèñp=âžžiÉöŸ>«Þ4eº,¾›ZZ¹kÜl8¾Hrø,2ñ¾„ˆ«…›Ó>pÙ¾ ÞÂD¥í¾©#ÈË'Ý>b¿/¿­À¾©Rèjýh¾ºu™¥Ö>¬«^Ab½â3‡C䓱¾´½#>1ßÿê=ñ› Üchõ¾aºÐn•/>4²…Ä2^>¸¨¡¢¿‘¾Ÿ¹L±»©> £ëZ"¥C>Æ>¯ÙÏ=¾]\Ì3]>Ze3ðü>×4êè†ú¾›êj¨›=à°ÓÚÔ_Œ>Ì™å=³¾rE¼Œ“O½òw!e%.ä>qÚ“—¨X¾wg€€¾-‚Õ@&\>£‹vŲ¾ .ÞH²ð¾ÿèãš°Ê>Qyéþ!¾Ë´vpåå¾ SxUƒ>}a†÷J½ÜH‡6hGN¾ö¯¤Lû>?Þo(ɽ=óÖ¤V?ﾋÀ3ö+4>Áø”]>ß3í³û¾©]ƒñò> |—ŠÌA>T ñþ¾?=:IT=ÿô;vßJ¬>T‚ĵ‡¾QÃÞ`ïÈ=Õ×䇌e>-ý ®ýx¾ù‹öº½õ»T˶¬>¬¨XHe¾bDš ܾÎÝ`œ‘>®tõè¤Z¾ )ˆTH¾Âì¢ößú>$í"Ñ?½ýБbN¯ ¾²°‹×¤€>1 á„N½Ç|yÛéñ¾t<„›€>œÕë"”Ò=ø¾›¤ *¾Ôi½v\>æj@7÷Äygª¾²«D> b™æÝy>IØhŒ>ç¾µ5º_ë=û&´"ô¾%Û-¾ʇW„=uISwñ‹Á>Åw³ìa´¾)¸^Ÿ,½ûU?]DB>ÿanGñ\¾OP›òõ+¾ ZØúÓ>±Â)/QC¾ø·–Vôä¾ès­ëL>Ò5ÿŸL!½÷ûR1²÷¾¤§ÎUT>ka!•[Ó=Ê*'¶µ’°¾ ¶v~‡œ>$’Š É=þ^õ­°H]¾,Φ¨>šE …pt> ðZçihe¾«C¿'>LÕËà»>›i$ét澕&Uût0=ôHz·Á–>3Ì*£–„¾øB\x7½ÜVp'lv>õ.xèV¾ö²„:!¾ pßÃ>WÅk`*¾ÇGüX=<¾ ¹¢Ã0->š˜(wX4¾`t*¯T¦¾a¼QÁ{°>FsSk‹½ð‚‚Ä$¾Ï*}¨2Ù>lf v,s=æùÏusľçD|ô>2èKô>:,i%ì¾~sNu¦h>§'ìþ>®H¿¯í¾}ÙX¯ÿ>/m±»>7IñãJ¾äf›<<¬=æ®üKü0Ë>qû·éÀ¾Ç__yww½ðSj)ju>K×Zæ4¾Q!;–S羌´åáØ>œ9néÕ˾ }æ`–x¾欎”_Q>Oú7Ã5O¾»×"²%ÿ¾XV ->j7ùî$½Øl$ræ^Ú¾Hdhð>›@·Ó=õœ» uѾ¬ý'¸ãL>M˜x]pÔ>\Û45€¾®,¡op> ©¾‰Ã>f×¢¥Â¾s›Ì=üÉç˜^?>·k¢YÔ¾Õ®I¸¤‰=–§MÁ¥7>ÁMyge¿¾"j5CÜ]½ûUìE‚–g>ŸºJžÇ¾(ž‘§¾ ÅÅœ& ¨>®C“¯U±¾W’Õõ ¾42cæ^É>³Ö¦Æms½ö œ¨ö¾öå.D9>"Fùª4g=×rCW|Lö¾e½9$_>%c®óM>¹ª‚*t¾P/zËèª>ܺµ·²> ™±;Ä‘B¾™µt@#‡>VFÞMz>k8ßj]c¾=9ZÀ…=ïùÿ¾2Á>ç2Hzø^¾M5'ª~ ½é‘…ãן>ÿü*:ºc¾òÊÓèÓê¾÷\(¿Ù->ˆ|bEœ[¾Öúêý‹¾FhÖàe>iÓUß ¡¾ Ìçnc¾¨ÿ7àï>¤¬ØÙæ½àë‚–²ý.¾Ó®ì0&æ>QˆS]†=ó«ÌÄòE¾Œ7”ŠÓÌ>Ÿr‰Ï®>Z¡mM›à¾©œ¬ß­N> ¢ù|Çè×>È¡;ÿA¾öÀ1ä=üêŽJ¸Bz>䢭§¾ç-Þ¬…Æ=¬ôw¦ Ù>´ØŒÎ–¾-@RÝ16½û-\‚ü½O>0s —¾"XÔ'о Þ•O} K>¬¡J“¾G™ÔU#¾Q#´‘‹s>¦s\_|z½õ-g¼ ð¾æµ|»ä>þê!Ö+=ÜnXƘ _¾†Ϙe>Û˜ŸS>€ê Õ$¾`wBu¹>x5m×ä>v¿úß¾¾Œ½9ÛÕ >E R @?>Ø}Ó9P¾¨lJ³,=é¾{1<>E;©¾é2TL…½ï­ÖlÈ>?]ÉÇ2ì¾[Eiͧ¾ŽÜêŒ>šÞW:Ai¾ B ÿ¿b÷¾ ¬*š¾T>B±é¤½ì¾ W²58¾Y½Ô^–>:ýAkï½Ð8Θˆð¾\ßQ0> Ä6 i¥=ø]ÚŠmv¾Û œ>¨cú%—> ³÷§Ù˾®u"&í«> 5ßĈl§>Þ}Jl±t¾Ê ÷€y~=÷E¼>·i>ÌiE#­¾:¥ íD½Ôþp»Æ>YÔ×­*¾#¯cn,æ¾½¯–k>PN0xQ¾à ¨eþŽ¾ äÉ¢EÃJ>’“¤…öÔ¾ÎëB¿?¾¨#¤P ¦>q–iìž½ë{¡6•íþ¾*>[gö>(¡zg=íèÆb®B¾4¹ð—îo>mß良„>eØJ Ù©¾™/ð¶Sï> QoùÖò“> wüç|m¾Aän$> ¡ý >aJkGL¾3 æ“Ë_=ÍSüQ×êE>i“;4œz¾Š”™[4ä½ùfªØÔŸ>äÂî„»ù¾~æk„†‹¾ ¿LØÖ¢>¬®­7,0¾¶¤îx‘I¾ŽëIã€>´™šž9½õïàáÇ,å¾BXý7> CŸeÀ=Ûx7Éx3¾‚ùõ°E>Õ)þÍæ6>¤þšx¾bŸiæØ>TPóŸ>Ð8Bt‚9¾„…ÑÇ >µ!ˆÜq>#|¾åã\¹Îo=æOrV1’L>‚nµà™=¾žn;S_ê½ñÉRS— k>kíöoA¾ßMjÙÞI¾Ø5Â[E±>¤eOÜâr¾ àÊNþ‘¾¸¢S‚>9>”‚½ü«Tо÷OEkg >ÎúLDûÄ=‚'O×0¾×@Ýé ª>êÇv£ß=üöXœò­¾v83‰>¦†‹ƒº8> •ù»q«¾£4˜j¹j>¤œ*Üò>ôÄÞ#×¾bƒØ#<ì=ñ;nŠ ý>³#X¥‚¾l²‰0çç½ç¿©¨­ß5>õÐ"GßC¾î©ô‡Ä7¾$ˆX«+>‰ÁÍc—¹¾Y¨ýý†¾’G`¨H—>U¤cd/u¾ÿ'l[Òx¥ú<½Ô݇m˜ìê¾?$8z²>º “%=÷å åÁ1¾Õ 2C~>§Á<¿6Á> É¿Mš;@¾«ùùâYª>åékn> NQÅ®í¾µêOù;º=õîiî‹„6>¡Gp秾ïq±/r½Ý#Ž’ñ™>Ž‰”蔾¶bRä°p¾ ›‹Œé·>iL“[b¾qûz6’¾W¬`ëqÁ>yg·C¾ü]!º+¾^÷x¸êq>¼‰á†ó½âsTyIJ¡¾Ä£Âx÷>L•~}×L=ôh¹gë¾—9;3 >_¶ï¯«>ÖÀLÖd¾©Ôá£ØŒ> ƒÓ;ù‘ï>YÄwè$¾êŒÒÀ¢ÿ=ùK‹Ür“>„ºá:ià¾dkZ pŸ½Ð |`*«>>ûmxP;>Ttƒ:¾‹yD3.û>LVÇ¢{(¾¸àöa̾²Ã’ø>‹¾PUfF¾UAD¾à™‚c`>ø=ÖfÝß½çÓ¬‡[駾n>Ê­U>ª½…4Þ=ñ—"†G²ò¾j|E%ÊH>ÔŠš¢M´>ÜQ†&ô¾¤o‘ KV> ‡·X„^>ç™çm“¾ÿx;=û^1.Âh>2YÒ¾ž>úQǽÀM ¿D×0> ã‹ú1^¾ŒÃ ¯½ÿUòÎ j·>9?ä9\¾àÐ’x°¾ Yº=€>“àkzgß¾(t“,#¾›ÕÔ©þ>b «·½ê Ò_>?×¾@Ö很l>׫ïaÏû=ðX>"q‰ë¾Sug°/> òu[ùM>€HÓÙ¼¾ Ì™V™> øŒUb@N>¶›’¦—¹¾:–iŽÐ=ü1°t¡o`>äé¯-¾²ÓŠ±ݽµmMJgPF>ûT"¿W¾¤ÚW_½þÎjÍdð>3$ŦÉó¾)åÖ±,T¾ -JÁÉÜ>•– C†¾3"4˜F>¾OYÅ €>äž 'S½êêà¬1¸Ô¾=Øؘ‚q=ðY2‹3­ü¾T^Åàð>¬ÓT…ã>‘çþ¡3’¾ ö¨î·> ÛwÞ Û>Åè(N0‚¾:-ß#ù=ûÌø3-ÎŽ>#¯C£í¼¾¤P˜@4‡½¾A–©a> ¾ö 6?¾‰î2þ*½ÿz”›?‘>;éÈ¿¾ÿÖvV“¾ Šáƒ#!R>ˉE¾ÁŠ½Ïg@¾¼ÃÍÞ™ë>Åê}½è½v_I7¾bù™XD>®rÉŠ\=ñ“f¤á•Ò¾k›Iž§ä>ÅËn©7ç>5a€ñ&ò¾¤d(ú¯> 2´®¯á>ÄlºbF¾ø¶|gq”=ú6õ?/Û>eöŒ*–¾r|àë4½ÍSÇ3ù¹>9zåU\¾:~üô¾©²…´€>Ní‹&¦ƒ¾•çüÉ ¾n›© É>ƒHa{ʾ½ÿÛæ¾ £ê²•&>Òz¹À—‡½ä%iÚå‡g¾¯+>nP >WtÎâ½é=óþ<7hɾ—O”«Nd>Jáþß¾>e×!ØK¾¨M?„ò> þ‘c¶[Å>ÖÌqʾÏéLlÿ“=÷pÓ`9; >ÕB“¾=¹Ø•°½ÚŒZ ÷ýX>ƒ‡’òÀp¾¶.Çb?þ&½gÚ„;>jÜŒõP³¾ÑÏ?L’n¾Ñ 8#ˆ>jÖe¦Æ¾&7®„>¾¶»?ƒÙ.>‚›l”çÖ½ÚZ€™&ý\¾ ÄJÛK>Ñ”ƒ‡±=÷{ƒ¯~a¾ÒÜRxÂ>’û náA> ¾´`j ¾§sÕž">=©ê^X+>]8 œ ƒ¾'‡^G=ómt+t>k€º¬sE¾š9¬R.½å‹UÎÔU>âÏ8P¾ù{DÖ±ˆ¾-€+B®s>ˆ¥;òG…¾ òè=Ìs¾ÔUAL|">@ž‰8½ÿø‹ɾy 4ô¾=>¼É·n½¾ýÈZK)9¾¦ÉC>àpTË=ü={W澊Èæ¶>›g× > Iøe ýϾšöËîß±>íkØ{”‚>Måî<çK¾/´SªÙÕ=ìÉQ÷žýö>" ´j¾éõÏT}1½ðö&“Ê>Op–¬™M¾»Åe¾µ'QÈ> ‘räþ¾ ˆ}9$ñz¾ô‡ØÐÊÞ>ü¿]ß½ú}<­¼¾`(/Y¡e>o¯J1bÆ=ÎÒËËúŒ¾A:Ô2­0>#6¡¬š>ú*dç¾UŸf×4>_i;¾9D>éel |¾yZÍ+«q> Ät?È.>g?ƒX=?¾©>xƒ¼Î=àG…ÔÄI>ïMàí–¾MóùàĽö\r£TQ>¿I¬9Ô“¾Äæ“I~q¾ ±ÁGSd>¦Èƒ{¾2<$mÒ¾AñÕ†¯>•¬/Ig“½óÙAS\i¾bàæ¤>MÅ•l£=åyõ@Û¯¤¾ãú–â1i>ï¬5ø£>P ¤9Û¾ŠLHþc> ·ò¢¡ú>ôNCtì¾8a~R+=ÿ%ðϧ>ŸhKÚ¾òRìˆÒ=¨y¡m²6š>ÈLôe¾Þ‡9Ñ}ÿ½ý¯2-U±>&oà l¾B˜®y³¾ ƒRu4S>‘3Ñ7|ñ¾ûÑ]£¤¾°8ñcÕ>zµWì½è!¤Ûäd©¾s[)±€>ŽZ¹à%–=ò¨­nÕ¸%¾—g¤_>u¯íp>qÆꧦ¾¥›‰O@Â> þ´×zP>™â®ÕÐ¥¾Ë ØA2=÷ ëðràf>êVDÉ?¾ÿȹ'>?½ÞºÁÀ$o·>ŸH “’»¾sƒ?/ÈO¾óÌúacà>wG¡sŠ¾è££ñ¾e@º8ž¨>R XÅÇc¾ÑA|µ?¾5ÅÞŽ‡>1d {›æ½ÉY.ÙHÛL¾†`é‚”->9`>ü¹=û†kçÕWd¾ Ê9\e>®/ ù> /A$8e¾™e¦QÌä>ß ?·a&>Y±ú›”¾%47¸G=ë 5ÒÉ->:Þøÿ¾Ljäÿóà½ñ ñõ_ù>eË£‰Ðó¾º?ÿ—Ÿ'¾q®pÙµç>¢ŠŒ`‰Í¾ ©î›É²$¾^Z¦>Û›bÎ<½øØ%…õ~¾Ããùp-j> LÊð„=Ûü»Å›*¾‹v†>”ý·äÍ>›m’¿¾rMÚ¯º÷>(*–"Ìì>G¢®wÊÔ¾VZ”ýýÙ> Ù¶v>%tU^¿Á¾8ÿõ׳=ËF¼Ù“ÊK>€±¦¡Ô¾>fã1úŽ½ûu“о> ”ªžN+¾«å#Š°¾ :ùx"l>—ßsÅŸº¾Å!O‘°¾fšB2?>d‡–y½êÊê4ßð¾IÛúBÕ>´šƒ L¨=ñ®™1Û¡@¾púoŘ>˜Ìàß>î>Ç‚€úR¾£±ôÊ.q> F…™’8õ>‹!íH¦i¾Ì]›!I=÷¯ÀVJ'>ìWf.w¾øüj¯{„½ßðŠê·õ$>§éœ¨LZ¾Záæþ€¾B:†ÿC.>{iÈyó¾…ê\c€¾™ÌHη>E÷‡eËɾ9 v†<¾m³ÏÃÝ> e`ùï½¹pkÐugH¾µ3½j¤>ïÎP²—=ýc”}j5¿¾#½Œføy>>©ßý> ,'ábÐA¾¾Ó^eê>³ØÞéh->Ñ]sK+¾ëPÚ]=åé™õ‰Ô>›&lèO¾Xçóûë½ôD/!øøc>žkxrM¾¦Xwn¾ ayÏ>¤ÆÌeßܾùN3—¾¸æ  ¢>›l,ÙHC½ô ¨¾_ÅkºC>”ÊS’=æa ¦Cx¾ð^L*F>Ä@Þ\¤>ÙaÄ’â¾.=©Ïw> wR_ P>S”f怡¾ÌÄG”\=üæ‰_ÞA>ˆ­J¹p¾£ßL”ôŽ½ÁìÍ@uÌ>CÕ鮾M[Þú†¾žx¶Æ1Î>NF¾¥¾fRK³\\¾ö%Ï4C >rßà“Ì ¾²*×÷sš¾’ ¬ð"o>‡™$Wµ½Ú6ï rª×¾&›D̹>­ô¬t©u=øÁÄeŒk¾åò¸/>*h}x> +“~µÀ¾ž5ãÚÇŠ>¿Ú/C+Å>œ5Å&:¾AË¢W›×=î?KàP»B>—è^ÿ¾èlèU_½ðS·Ù dã>Xr o,å¾ÍüDÄõi¾R ¿Âd£> ’<•m ¾ ›°WùÏÚ¾k‘&u>Ò7à殡½÷t'ÃÙùE¾âA°8¶€>û[ÅN&=ßç’ú`a̾©ëóÊ2¬>N§š'y>mSÁMKC¾}Ï]ä>@!«†Ïü>¿êH-¯“¾<ÏËÜn=ÿ|ö!¾Ð>št¶¼+´¾èù"‰ìš={ù¥,ìà>ÜÓðF¾­ÔÒ)d–½ÿ Säð€>6ä|¸û°¾Ö÷5ºu¾ßn™êˆ>¸°Ÿ¾›{çhö¾?øH…Œ>°»ùYB¤½àŽ î ¾óEÍtá¶>ê7áj´,=÷B^F×ݧ¾Ïë¹{ʯ>p7Oäã¾> “«š(Þ6¾ b½:L ÔÕ—r>ÑÅE4bà¾UQª$–=ðpï3õ<>ñ78¦À¾’©í$ܽïæžRÜÍ>I÷µ£X¾í Àw ø¾ íko>ž¼Z»=¾ Ðf³k7Á¾VþíôãP>Öˆlß½÷·9)s«?¾Ùäzõx>ÿ#1y¥=ß›nÉDº¾©«Ð8Ã>K“iþß>{~jàm ¾~Kn•™‘>#¾><>Ð*›rYU¾7\ÜåÐ=ÿ kW—l>®ýâNàžØäÂãϽš$ :ži>îQY¾žnƤ‹½ÿÚŒÔÅÊ>?µUò ¾¾£Ú ‹}½¾‚Õ r>wô "×¾t•ÜDz>’‰{-_‹½Û¿9ÀêCT¾½íá>±¦£,Òr=øÂ@<»NÕ¾æšøÜs>*ìÖ=£> Wm/Wdq¾›gîBƒÈ>q0Y1·p>+§”EDá¾.Ž´_“4=ì+‰\žø>8’‚\¾¹ÂAÁ©½ñ½Ü‚É>s¤œ1J¾|KJ±ßí¾%ÕNq >¢?‹s¿¾ ¬ª'DݾØ!#Gt6>¬Ä–týý½õ Aé=Y¾AŒ±`­×>¥{Ä=åš ê¾ê‰e3¡>ÂtŠÅµÙ>ïK…Òì¾n(> ½Î<àÕ7>zÙZk"¾Ö ¨_À=ûÁß­iÇ—>:Ž²aÙB¾uÊ¿d˜ž½Ïë¶âMˆñ>KÐÅF¼]¾ð]ª«ê¾º½ Œ›e>b¦N[¾¦×£ÊoÀ¾_‡¢‰->W²J ™³¾¨…B¾¤¾&ô¹‚>+D“a ½Å‹ÌÞwqA¾›ð°P²>.¶2ø=ýòs¶O¾ G4æMà>2"à`š"> \_÷[æ&¾‡KãŒØ$><›³¥g*>6-¢/÷¾ÈN—Š=âi¿§‰íš>ØžÀ©±ß¾h".*½ö½ïoL>Èæ2¾|±[Ù­3¾ …`÷I_i>ž ÊD¼à¾9ê†|¬k¾ÞäzÕCƒ>K®PG`½ïê 3ɾ51à()>çwDÁ{ó=ð{Êþž ü¾]ºB° >±7\!@>ªõÇRâ¾ ‹ WÏÔ> " "…¯>®E*y£4¾¸Œ]™SJ=õ´Û…?G{>)ä o¾¶0<1—½ä«Ÿv z±>àÜþÜ7¾ÑhË¢hö¾Ы'÷¨> ÀØÚ¾ ÊøY,iI¾xræ®ë>xʯ%ͽû«o=/é¾@óäqû>ný´™ˆ=Ñ)n £Ñ¾Têp8NÇ>ÜV€Eýa>øŠ^“^¾gÈÃ'Ü>^F§h;Ô>=Œª¢\¾P)Â{ùA>´]ÕDX”>M¤ÚJ*þ¾#†í¼=¹ÓEÅ׆æ>¹ó~LˆØ¾Óä±®ú½þO gfÔE>.ŪëB¾çò[y_¾UšÂ|¼>}-áÍh:¾y«Ã±S¾RìOxÇ>ŸîoE&½ÝŒ³×æýÒ¾9Fñ£>·›¥–©=ø¹ø2?Ž¾æÆß`¤Ÿ>q2ÓëØ> ‚Øsa\p¾˜Yn Ë¨> s•Ø/>PËgÌÓ·¾KøW=éýW´m…‚>`NÅuß¾‡¯2F½ó;í·¿ž>4XDN‚¾$]z­6¾ r)V>¡KÕØŠ¾«Ë—„Û=¾J!sD;>²ŸÝ½òsËÌ/-¾¤.&ø>E~§O=ë ìW%¾*ÉÆpiv>(xwÜÌ>ˆD×3a“¾šÎ5‰¹Ì> íÂN>>²C$²l¾ØNY®±M=÷ºmN&î>ÞèL -[¾ñE…µ½á(,v¸f>¹Uëž}:¾t6¤¥T¾F—8óˆ>„c˜2á¾ júØn ¾1.}u>jXy‰¾½ü×*€ÓU¾ Fó >‹˜TiìE=Êz÷•ŸãÚ¾=¦¥H«Õ>ÿ]ÊÅ%È>œq6>¾`ÕÍ@YÙ>ž\•R9–>!$,;Þ¾S|n @p>áq:ÒÒZ>@Œ}Òú^¾!Îfj=¼#NÔ, °>·HÀ€òk¾ÓT¾ñf½þb=~¬ì>/§“á(¾ÛkcaÑľ"àI^q>zúl˾AœÛýT¾iÈ΀ʹ>:ö€Ôo½ÚØñ4½¾)~4ÈG>–šƒð=ùšEξó†ð€ò3>ؾüÓ˜z> ǯ¦ø̾“^%̦>ˆÊs¹›>ŽKÝ ¾ü/IÆ»½=çI®×Çç>’^íbèؾKã_™‘¦½ôèBδú=>«ì™ [þÉ !CD¾ âà¯ÿÚ>ŸÔ[d¯¾¹Þæ÷–¾°£ZŒ#>Y'ÔŽV½ð1®2˜Ã¾õÙÈÅ`>ò‘†Ðü=ðI©r“ªµ¾[gçAŠ >ªêæRœï>ÆÓ!ls¾Ÿ}¸ÉÙg> Ñùà·P)>Ðç÷h¾©gÿEŽê=ô·ÂG,ËÌ>Rä,›Pý¾‹2k(3½ç‹[šwé¢>S®a[‘¾€r ¦°¾±¶„ôŠ>” Ç®²Ð¾ Ô#„Ü‘¾ïy~Ä>ìG¸Œá÷½ùŸª§h¾«ì¯yû>N`§ðB=Ý` ªR<£¾ )KZ Ù>HY2†4œ>Ÿ¶ì۷ྠ¯÷HŒ> ½ï¨Ú—> ©÷Õ(:¾$J€ÿ=ýVvB'Ùù>?-Á4—¾•‚"Êd†½È>€‰e9>7Q?XC—¾’¦êè¾–ëˆð>_ä‘ݸ¾’T×9'õ¾+(`.®€>OÜSWè¾·]æÓ+¾R,{w—>ëáoÝ»½²÷¡ûÈ£¾Éùá_Y>³ý` ¢X=ÿ(»‡ˆ¹¾8ÓH–gû>§‰¾1f‘>“Kƒ¾º¾q÷ûÄâ>¯)ô½>> Þ>Ã>¾o¹öÕÖ~=Õ$ãëNê>T˜ÉÕI„¾XžY‹½û8 €=> 2䩈Ͼ{¾s‚âT¾ Ôg%’cé>‰§÷q徕vÅ"¾î‘ãI?’>Ëå6˜Ê½â‰µb®ÉJ¾ÜQ±¦Ix>ñJÌôà=÷Ws…c ¾Ó+…]>DŽ¹ð;Ú> Šþ|ó¾˜üÙ½‘P>g´ GÅ—>:]Àè:§¾‡ñjìï=êC¢1§¾>_9¶¾€D“c½ól*ˆ1>•á‘˾ÔÆ€)³¾ `¹±@’B>Ÿ;*eÂñ¾(êê¿Ç¨¾†M¯7Ö>fÈR°°Þ½ðãÌg[¾ß—³ÂŽ`>߸Ðmê=ïªÏ1ѾS™Ñ á6>¸N¤çD>­«úƒ)-¾žsB,p$> ÖhøÓ>ÑYÁíÈ ¾¦§4ç±=ô„å>ÊQ>\m'NIe¾~®d¬À?½èl!Ú¾¬ç> e˺ʾcÛê!Л¾ù9C;«>•ØJÑY¾ s¢gŠ+¾”ié‘c>ÝDãåA½ø ¯ŒÜ/k¾×Íinê)>ïk#0„=áT6n4¼l¾¿a4 Èw>Dý%¯ú>[j÷Ãð뾇Y½õq> ýãYÛ¤æ>iÄ+¡Ò¾   ‹I=ûoä¯È“>PÁõsJ¾X7¶ˆ½Ôßn…ÊT>n“Ê—S÷¾ž|œ,n©¾½twq›T>r3roƒ¾xŠ„ ¬¾·ó4ѱ>3³v¬h½þºJ˜ÛA¾É+:@^R>·š,.º=½›‰_üïƾ„B€w>.>—6”•>%ˆFD·ò¾XPûä\§>á—™9’>憳2 ¾T”‚‰h>ò oqŽ>@fŠ|+¾Ëâ/_·=¶ Ú9èÝh>îܠ©K¾¶h‡VM ½ÿ-¦GÅ>8®^bÞú¾•~ÓX¾°®\n¼¢>n8âz·¾zE®†ÿ•¾·M¹7Ï>_Ýi=J½ÒdúñU0¾j‰’6F>5ã_6¢D=üõ7¡ì¾RÐËC£>Aüg˶ÿ> V6Õ²²¾‚‘ÙsI€>ò´nŸ:>-ªšß¾©’|ð„¼=Þ¸éˆý^>ŒÉ´††¾®w‹´Íë½ù"Ú®=Ü>í,™t…®¾ߘ)÷²Ó¾ ì­ÿ¶>»íòܾ^Ëôám¹¾¥ßÁÓµ>ëÕvW¨½å]d%בG¾±‚ÆfHV> m’aÚ=ö4¯†vú/¾Â"„.¡>u$ü76a> ±'о¶¾š&¹4>[>»£ÓšÎQ>B_ª+è¾(„·½;=ë)õŽY'>REýѪ¨¾‰it§¨¾½ó[}4°¿¿>“)e$¾c/@u¾ g8ÜrR]>ž6g¾ ÈNá|k¾”ûXºP>^Ž Ðsá½ðg~â-µz¾ò»]‡9>ì}‡ryª=ð‘]|Ù¹¾blUàd>Œ¡ðè>!aIkβ¾ž²ðÃSñ> Oy±t¢>]5:F¾¼‘îp=ó £"d>‘™yçã¾I÷œëÆM½ë·NaZŽ>-³¹9e¨¾ /n—K¾ã£h0–>š`ÂûL<¾ ‡3'sß¾‰V¦?^>»÷@ŠÊ½õÅ—V›ñܾ0¾@¡Ž,> Ç™ˆ›U=æj;à "˾÷æ©h‘>ˆé\Š5<>©/É9>Œ¾“…ËÜz> ±úÇop>Ï—·d¾â.}ˆ¾!=øR"®L>ÎãotZú¾òÔ#‚ѽáG G8ˆ<>¿M^»¾þ’Õr±Ñ¾wPAÅ0>‡£Rñ§m¾ ÐÛ5r澂ʊY²—>é(BýúÌZŒšø‡¾mŸãû>>jÒBÝŒ=Ø/[%1_¾…ü*¢>mÐÁfF•>I²Žîº»¾z;ÕG> ã¦å0z|>ÐñÙýá¾"mlÊä=ý.–!;VÔ> Úõž¬Å¾…äK¨(½ÍˆÄ³øë>J}ã[Ο¾Ø<3¦ùɾ$Wsû¿)>hÁßt±×¾íi:“‘¾ƒ\ii³><'¹oGæ½ÿ|ˆX¬¾«$¿;î >ÇàedX=µ %¯ê¾ž qÑ><¬ÖÍ@¨>ë¿‹Ûg¾UËŽQQ}>ê8‘j›>ÁÑÐz¾Rñ¸íuÆ>ÜË¥½Ë >J<ƒ4/¾ _mÜk=¯x÷Ø\ÊÏ>ÑEx4¾œÚl’§R½ÿ×69“†½>?ʼnLÁ&¾oMm Ô¾5êÙ‘>eŠÍ—·¾ñ–}Ÿs³¾ê£Ò¯–;>?2v¥Ä¸½ÉÓpÎêŽb¾“pâ;™i>÷woXÙ=ý°Á‚S¾(lFÁV>ãݲüì >$žhÚxë¾uÂo¢°Ñ>ûÈ%÷We>‹!ÇFâ¾uPbÊÌ=Õ—4$Mb>T}Ki‚¾N^ùåî1½û™ ~¬"¨>†*O«Ø¾T{ˆJçò¾ 7úÎl2u>‚E‰=¾þK±¢õ¾- ‘½Y>¦l¾ÁƒO½Þ®:Ÿˆ¾Ú¬c€Ÿ> üÒ=ù‹M “Z¾ó³Ó>¿Î™w{%> MÞµwŸÏ¾ŒÃO;†’>ö{ù(+>ÏFk½a¾ÕÍÅû%=ã ¾1÷é«>ÖPõÒI¾îšÿ@1°½÷¶á‰>Ö°ú§˜n¾'“Ó"Ac¾ i¿Tšûd>”ÓRú¾çµéöŠQ¾sPýÿ'>ÿySïP'½ç¥x|k¾—,7q(>8Sÿä!Õ=õ˜º^@¾¹ºüòe>Štm6:É> ˆ%U7ýà¾™Ì Ô†>ÏŽa;îï>•Õ_+H¾'œM¾ â=êûáãô³>WDØ ¡:¾Cßmv ½ó³çµ•>™•È´Ü~¾ê!•¿ž¾ ¬€‡Vq>œ©V“(¾°Ü»=¾½ÀQ.[>K÷4•½îÂÑÔ¿×¾8VXØÉ>ÁÞÇzÓ=ñÖ5òH4ë¾yÍjÿä>E[¾s²>Ó¬Ó;k?¾žIáo"\>‰;À³k›>d]¹luO¾n_ýC¦Ø=ñ2˧R=>؇ì²A6¾ÜIZ½ð Öu˜>XYŬô…¾—öççþ¾k|ÙÄW>A¥a3h¾ [ÜljhŸ¾ ÕGôë>T`Í*½òúÃ~w4t¾™°m5ì¶>>~j±=ìƒ9±†BZ¾6ßî‚# >ñ¸pÌTz>/¸:h?¾›Gà™9> &b9òß>µ½Q<ܾªÊ ]Ýz=ô²´Ó°ê>Zm9Xß?¾wø"W³Ê½é‹:¥Ù>û $¾CW¹D¨Ñ¾d¶åå >— å™ß#¾ ëz/(Øö¾`”Ö:ß>Åîh}ô½öa©6¢W·¾+îå‘>®_ªäØ=å°ÏêÐn¦¾ñ-ûkM>‘0’—£>›õd'u›¾’,‰Oñƒ> ¨ê­ñã> íùÀ›Q¾Ýúégǘ=øk†\J(>Ýu:\¹¾âÎiR‰½âhå y¿*>ÍÄퟕ¾ܲPr뎾Ø’8û–>‹»ý¤¾ aüÿ ¾¹)´*½>ô9µ67‚½ù™-Mø=š¾Ÿëö#Ku>h™[=Þ]ÄÙî~¾©SGžL>$£Í_JI>€lVÞ¾ƒ‹Ûì Ò> Œw!?x>f¥”˜Rо &¨Ãt=û#jµ¡?¸>aà,ØüK¾C­ 2½Ø¹]ë->„A¸ÍJ¾jÒŠ­û¾[)ø y?>z+[<¾ ÁÚ+$i¾}$Üs>½q¾Ë½ü¦Éªì¾%¸&ƒ2>pSØ–fê=Ñì~²G)N¾_¸õ}ˆ#>­¾Ë >¡ˆ»¾pu&Å­~>hªî‰ä¬>ÅÜW¾-^k4G±=þJTo²>çË. ²†¾›‹©À®½ÇÛLæÍñi>9÷Þ•M†¾ïƒØÙv¾ëq¸ >eý"!l¾ ‰–FоwdASE`><±Ïôôâ½ÿ‹â1惄¾«¢÷@£Ã>Ä-Z¨ÈR=¸ ­ê´ÿ¾ÌŠ.Ÿ>-^Ž½_v>7¤j¬Ý¾Yj’¦Y>ªBK¯§ >):àðÃã¾KLˆi³Þ>wò…t¨M>o+ÝhÌœ¾ëŸn*`E½p¤a£+ïð>îœw>µ`¾jL 2ßྈ^¸Ÿì:>L"µ fµ¾"•œ×¾¹}‚ê‡ß>WÒ0‡´¾'2n—ü¦¾3Õig•ƒ>……ê¹ ½µ¯'C¾Èá*§“>¤tøQ4 =ÿ´¶C>¾>Ö’‚³ï>m TI5> äeSG2¾c¸Ne…y>Ðÿo'Ìó>ø £þ=¾4„x•…—=Åä´}ϲ˜>¢+ ÿ%ï¾ÝsÕðU½þa (T¥>0âÇ9ྶrSÒwM¾‹ep fÕ>m´èº¾xŒàLG@¾½mº²²>V%!Ù¼X½ÐjWUš¾{þªüé>ã)Zÿ=ý°4c¾!2BVž>ý'ß0™B> ö12›úz¾w:™çïå>JÒú>‚^†Ï 4¾w/"³=Õ¼’`Ó>TöÃûDë¾IY5Áã(½ûÆ–Èólƒ> ePC¾B¶Àaµ—¾ dbÆ’qò>~׈!*ô¾»IPd¾HkØPÎÏ>•É|:šá½Û_ãV9¾.–”ÙB>|O½’=úÌ?@P¾ùU7">…Äý^3t> Òü¿!‰°¾†2_9õ>VEæ¿D>8ÈÚ©¾³µ‡xªÑ=àÛiÇ*ç>^À©\¾®K„ËZR½ùAªàGÆD>íܾÇ¥x—Ö;¾ Dû±¦”÷>‹Ò²2ç¾ï¦ìZ{¾Õq‹¶Ã>ÏyÎR[½â”㓇n¾á¼•{->ݶ#dŒý=ø1k÷¾Þ‘¬£î<>¤fÓ§> ¸\ ­6¾‘"rz->²j1l>œÐÓ‹Z£¾êp6G=åFïp‚>º]ÊêÄ¿¾ Ï0ͼ©½öØöZß>ÌšŽ)¾CÍ›JÓÁ¾ 1n5êq>”ËË‹ñ¾¬tPú¾f±,ÎüÉ>ÛÎV°½çW˨‘쾕žÇ'H>6S¯«=õ¶ØÐBÏÀ¾»ª€´Éñ>|HËÚÁ> °ÅÀb¾˜Oñ>‘¡Y¹>3wmOµT¾cM™&­=étuGÌw>sœ~î¾\Åbs²¿½ô·dõ±«>«žN‘¤¾­œ×Úí–¾ Cí"B>š%NY ¦¾ýcdá=x¾ ¾Q¤õ>)ú ïÓ½ë ¡;~¾[(©« ì>uËÒa‚=ô®â;Š¾£€k´žu>Ä­H¤0> x Ÿvî¾›ÑWf–»>äÑ·£a>Íר'¾$ZûÉ=é”ò=¥·>…\3§H8¾5b¸ .Ž÷‡Ùyû>ù‘V÷ ª¾+´¬IÌf¾‘^Í+)>"($Ô >Û›bÎ<½øØ%…õ~¾Ããùp-j> LÊð„=Ûü»Å›*¾‹v†>”ý·äÍ>›m’¿¾rMÚ¯º÷>(*–"Ìì>G¢®wÊÔ¾VZ”ýýÙ> Ù¶v>%tU^¿Á¾8ÿõ׳=ËF¼Ù“ÊK>€±¦¡Ô¾>fã1úŽ½ûu“о> ”ªžN+¾«å#Š°¾ :ùx"l>—ßsÅŸº¾Å!O‘°¾fšB2?>d‡–y½êÊê4ßð¾IÛúBÕ>´šƒ L¨=ñ®™1Û¡@¾púoŘ>˜Ìàß>î>Ç‚€úR¾£±ôÊ.q> F…™’8õ>‹!íH¦i¾Ì]›!I=÷¯ÀVJ'>ìWf.w¾øüj¯{„½ßðŠê·õ$>§éœ¨LZ¾Záæþ€¾B:†ÿC.>{iÈyó¾…ê\c€¾™ÌHη>E÷‡eËɾ9 v†<¾m³ÏÃÝ> e`ùï½¹pkÐugH¾µ3½j¤>ïÎP²—=ýc”}j5¿¾#½Œføy>>©ßý> ,'ábÐA¾¾Ó^eê>³ØÞéh->Ñ]sK+¾ëPÚ]=åé™õ‰Ô>›&lèO¾Xçóûë½ôD/!øøc>žkxrM¾¦Xwn¾ ayÏ>¤ÆÌeßܾùN3—¾¸æ  ¢>›l,ÙHC½ô ¨¾_ÅkºC>”ÊS’=æa ¦Cx¾ð^L*F>Ä@Þ\¤>ÙaÄ’â¾.=©Ïw> wR_ P>S”f怡¾ÌÄG”\=üæ‰_ÞA>ˆ­J¹p¾£ßL”ôŽ½ÁìÍ@uÌ>CÕ鮾M[Þú†¾žx¶Æ1Î>NF¾¥¾fRK³\\¾ö%Ï4C >rßà“Ì ¾²*×÷sš¾’ ¬ð"o>‡™$Wµ½Ú6ï rª×¾&›D̹>­ô¬t©u=øÁÄeŒk¾åò¸/>*h}x> +“~µÀ¾ž5ãÚÇŠ>¿Ú/C+Å>œ5Å&:¾AË¢W›×=î?KàP»B>—è^ÿ¾èlèU_½ðS·Ù dã>Xr o,å¾ÍüDÄõi¾R ¿Âd£> ’<•m ¾ ›°WùÏÚ¾k‘&u>Ò7à殡½÷t'ÃÙùE¾âA°8¶€>û[ÅN&=ßç’ú`a̾©ëóÊ2¬>N§š'y>mSÁMKC¾}Ï]ä>@!«†Ïü>¿êH-¯“¾<ÏËÜn=ÿ|ö!¾Ð>št¶¼+´¾èù"‰ìš={ù¥,ìà>ÜÓðF¾­ÔÒ)d–½ÿ Säð€>6ä|¸û°¾Ö÷5ºu¾ßn™êˆ>¸°Ÿ¾›{çhö¾?øH…Œ>°»ùYB¤½àŽ î ¾óEÍtá¶>ê7áj´,=÷B^F×ݧ¾Ïë¹{ʯ>p7Oäã¾> “«š(Þ6¾ b½:L ÔÕ—r>ÑÅE4bà¾UQª$–=ðpï3õ<>ñ78¦À¾’©í$ܽïæžRÜÍ>I÷µ£X¾í Àw ø¾ íko>ž¼Z»=¾ Ðf³k7Á¾VþíôãP>Öˆlß½÷·9)s«?¾Ùäzõx>ÿ#1y¥=ß›nÉDº¾©«Ð8Ã>K“iþß>{~jàm ¾~Kn•™‘>#¾><>Ð*›rYU¾7\ÜåÐ=ÿ kW—l>®ýâNàžØäÂãϽš$ :ži>îQY¾žnƤ‹½ÿÚŒÔÅÊ>?µUò ¾¾£Ú ‹}½¾‚Õ r>wô "×¾t•ÜDz>’‰{-_‹½Û¿9ÀêCT¾½íá>±¦£,Òr=øÂ@<»NÕ¾æšøÜs>*ìÖ=£> Wm/Wdq¾›gîBƒÈ>q0Y1·p>+§”EDá¾.Ž´_“4=ì+‰\žø>8’‚\¾¹ÂAÁ©½ñ½Ü‚É>s¤œ1J¾|KJ±ßí¾%ÕNq >¢?‹s¿¾ ¬ª'DݾØ!#Gt6>¬Ä–týý½õ Aé=Y¾AŒ±`­×>¥{Ä=åš ê¾ê‰e3¡>ÂtŠÅµÙ>ïK…Òì¾n(> ½Î<àÕ7>zÙZk"¾Ö ¨_À=ûÁß­iÇ—>:Ž²aÙB¾uÊ¿d˜ž½Ïë¶âMˆñ>KÐÅF¼]¾ð]ª«ê¾º½ Œ›e>b¦N[¾¦×£ÊoÀ¾_‡¢‰->W²J ™³¾¨…B¾¤¾&ô¹‚>+D“a ½Å‹ÌÞwqA¾›ð°P²>.¶2ø=ýòs¶O¾ G4æMà>2"à`š"> \_÷[æ&¾‡KãŒØ$><›³¥g*>6-¢/÷¾ÈN—Š=âi¿§‰íš>ØžÀ©±ß¾h".*½ö½ïoL>Èæ2¾|±[Ù­3¾ …`÷I_i>ž ÊD¼à¾9ê†|¬k¾ÞäzÕCƒ>K®PG`½ïê 3ɾ51à()>çwDÁ{ó=ð{Êþž ü¾]ºB° >±7\!@>ªõÇRâ¾ ‹ WÏÔ> " "…¯>®E*y£4¾¸Œ]™SJ=õ´Û…?G{>)ä o¾¶0<1—½ä«Ÿv z±>àÜþÜ7¾ÑhË¢hö¾Ы'÷¨> ÀØÚ¾ ÊøY,iI¾xræ®ë>xʯ%ͽû«o=/é¾@óäqû>ný´™ˆ=Ñ)n £Ñ¾Têp8NÇ>ÜV€Eýa>øŠ^“^¾gÈÃ'Ü>^F§h;Ô>=Œª¢\¾P)Â{ùA>´]ÕDX”>M¤ÚJ*þ¾#†í¼=¹ÓEÅ׆æ>¹ó~LˆØ¾Óä±®ú½þO gfÔE>.ŪëB¾çò[y_¾UšÂ|¼>}-áÍh:¾y«Ã±S¾RìOxÇ>ŸîoE&½ÝŒ³×æýÒ¾9Fñ£>·›¥–©=ø¹ø2?Ž¾æÆß`¤Ÿ>q2ÓëØ> ‚Øsa\p¾˜Yn Ë¨> s•Ø/>PËgÌÓ·¾KøW=éýW´m…‚>`NÅuß¾‡¯2F½ó;í·¿ž>4XDN‚¾$]z­6¾ r)V>¡KÕØŠ¾«Ë—„Û=¾J!sD;>²ŸÝ½òsËÌ/-¾¤.&ø>E~§O=ë ìW%¾*ÉÆpiv>(xwÜÌ>ˆD×3a“¾šÎ5‰¹Ì> íÂN>>²C$²l¾ØNY®±M=÷ºmN&î>ÞèL -[¾ñE…µ½á(,v¸f>¹Uëž}:¾t6¤¥T¾F—8óˆ>„c˜2á¾ júØn ¾1.}u>jXy‰¾½ü×*€ÓU¾ Fó >‹˜TiìE=Êz÷•ŸãÚ¾=¦¥H«Õ>ÿ]ÊÅ%È>œq6>¾`ÕÍ@YÙ>ž\•R9–>!$,;Þ¾S|n @p>áq:ÒÒZ>@Œ}Òú^¾!Îfj=¼#NÔ, °>·HÀ€òk¾ÓT¾ñf½þb=~¬ì>/§“á(¾ÛkcaÑľ"àI^q>zúl˾AœÛýT¾iÈ΀ʹ>:ö€Ôo½ÚØñ4½¾)~4ÈG>–šƒð=ùšEξó†ð€ò3>ؾüÓ˜z> ǯ¦ø̾“^%̦>ˆÊs¹›>ŽKÝ ¾ü/IÆ»½=çI®×Çç>’^íbèؾKã_™‘¦½ôèBδú=>«ì™ [þÉ !CD¾ âà¯ÿÚ>ŸÔ[d¯¾¹Þæ÷–¾°£ZŒ#>Y'ÔŽV½ð1®2˜Ã¾õÙÈÅ`>ò‘†Ðü=ðI©r“ªµ¾[gçAŠ >ªêæRœï>ÆÓ!ls¾Ÿ}¸ÉÙg> Ñùà·P)>Ðç÷h¾©gÿEŽê=ô·ÂG,ËÌ>Rä,›Pý¾‹2k(3½ç‹[šwé¢>S®a[‘¾€r ¦°¾±¶„ôŠ>” Ç®²Ð¾ Ô#„Ü‘¾ïy~Ä>ìG¸Œá÷½ùŸª§h¾«ì¯yû>N`§ðB=Ý` ªR<£¾ )KZ Ù>HY2†4œ>Ÿ¶ì۷ྠ¯÷HŒ> ½ï¨Ú—> ©÷Õ(:¾$J€ÿ=ýVvB'Ùù>?-Á4—¾•‚"Êd†½È>€‰e9>7Q?XC—¾’¦êè¾–ëˆð>_ä‘ݸ¾’T×9'õ¾+(`.®€>OÜSWè¾·]æÓ+¾R,{w—>ëáoÝ»½²÷¡ûÈ£¾Éùá_Y>³ý` ¢X=ÿ(»‡ˆ¹¾8ÓH–gû>§‰¾1f‘>“Kƒ¾º¾q÷ûÄâ>¯)ô½>> Þ>Ã>¾o¹öÕÖ~=Õ$ãëNê>T˜ÉÕI„¾XžY‹½û8 €=> 2䩈Ͼ{¾s‚âT¾ Ôg%’cé>‰§÷q徕vÅ"¾î‘ãI?’>Ëå6˜Ê½â‰µb®ÉJ¾ÜQ±¦Ix>ñJÌôà=÷Ws…c ¾Ó+…]>DŽ¹ð;Ú> Šþ|ó¾˜üÙ½‘P>g´ GÅ—>:]Àè:§¾‡ñjìï=êC¢1§¾>_9¶¾€D“c½ól*ˆ1>•á‘˾ÔÆ€)³¾ `¹±@’B>Ÿ;*eÂñ¾(êê¿Ç¨¾†M¯7Ö>fÈR°°Þ½ðãÌg[¾ß—³ÂŽ`>߸Ðmê=ïªÏ1ѾS™Ñ á6>¸N¤çD>­«úƒ)-¾žsB,p$> ÖhøÓ>ÑYÁíÈ ¾¦§4ç±=ô„å>ÊQ>\m'NIe¾~®d¬À?½èl!Ú¾¬ç> e˺ʾcÛê!Л¾ù9C;«>•ØJÑY¾ s¢gŠ+¾”ié‘c>ÝDãåA½ø ¯ŒÜ/k¾×Íinê)>ïk#0„=áT6n4¼l¾¿a4 Èw>Dý%¯ú>[j÷Ãð뾇Y½õq> ýãYÛ¤æ>iÄ+¡Ò¾   ‹I=ûoä¯È“>PÁõsJ¾X7¶ˆ½Ôßn…ÊT>n“Ê—S÷¾ž|œ,n©¾½twq›T>r3roƒ¾xŠ„ ¬¾·ó4ѱ>3³v¬h½þºJ˜ÛA¾É+:@^R>·š,.º=½›‰_üïƾ„B€w>.>—6”•>%ˆFD·ò¾XPûä\§>á—™9’>憳2 ¾T”‚‰h>ò oqŽ>@fŠ|+¾Ëâ/_·=¶ Ú9èÝh>îܠ©K¾¶h‡VM ½ÿ-¦GÅ>8®^bÞú¾•~ÓX¾°®\n¼¢>n8âz·¾zE®†ÿ•¾·M¹7Ï>_Ýi=J½ÒdúñU0¾j‰’6F>5ã_6¢D=üõ7¡ì¾RÐËC£>Aüg˶ÿ> V6Õ²²¾‚‘ÙsI€>ò´nŸ:>-ªšß¾©’|ð„¼=Þ¸éˆý^>ŒÉ´††¾®w‹´Íë½ù"Ú®=Ü>í,™t…®¾ߘ)÷²Ó¾ ì­ÿ¶>»íòܾ^Ëôám¹¾¥ßÁÓµ>ëÕvW¨½å]d%בG¾±‚ÆfHV> m’aÚ=ö4¯†vú/¾Â"„.¡>u$ü76a> ±'о¶¾š&¹4>[>»£ÓšÎQ>B_ª+è¾(„·½;=ë)õŽY'>REýѪ¨¾‰it§¨¾½ó[}4°¿¿>“)e$¾c/@u¾ g8ÜrR]>ž6g¾ ÈNá|k¾”ûXºP>^Ž Ðsá½ðg~â-µz¾ò»]‡9>ì}‡ryª=ð‘]|Ù¹¾blUàd>Œ¡ðè>!aIkβ¾ž²ðÃSñ> Oy±t¢>]5:F¾¼‘îp=ó £"d>‘™yçã¾I÷œëÆM½ë·NaZŽ>-³¹9e¨¾ /n—K¾ã£h0–>š`ÂûL<¾ ‡3'sß¾‰V¦?^>»÷@ŠÊ½õÅ—V›ñܾ0¾@¡Ž,> Ç™ˆ›U=æj;à "˾÷æ©h‘>ˆé\Š5<>©/É9>Œ¾“…ËÜz> ±úÇop>Ï—·d¾â.}ˆ¾!=øR"®L>ÎãotZú¾òÔ#‚ѽáG G8ˆ<>¿M^»¾þ’Õr±Ñ¾wPAÅ0>‡£Rñ§m¾ ÐÛ5r澂ʊY²—>é(BýúÌZŒšø‡¾mŸãû>>jÒBÝŒ=Ø/[%1_¾…ü*¢>mÐÁfF•>I²Žîº»¾z;ÕG> ã¦å0z|>ÐñÙýá¾"mlÊä=ý.–!;VÔ> Úõž¬Å¾…äK¨(½ÍˆÄ³øë>J}ã[Ο¾Ø<3¦ùɾ$Wsû¿)>hÁßt±×¾íi:“‘¾ƒ\ii³><'¹oGæ½ÿ|ˆX¬¾«$¿;î >ÇàedX=µ %¯ê¾ž qÑ><¬ÖÍ@¨>ë¿‹Ûg¾UËŽQQ}>ê8‘j›>ÁÑÐz¾Rñ¸íuÆ>ÜË¥½Ë >J<ƒ4/¾ _mÜk=¯x÷Ø\ÊÏ>ÑEx4¾œÚl’§R½ÿ×69“†½>?ʼnLÁ&¾oMm Ô¾5êÙ‘>eŠÍ—·¾ñ–}Ÿs³¾ê£Ò¯–;>?2v¥Ä¸½ÉÓpÎêŽb¾“pâ;™i>÷woXÙ=ý°Á‚S¾(lFÁV>ãݲüì >$žhÚxë¾uÂo¢°Ñ>ûÈ%÷We>‹!ÇFâ¾uPbÊÌ=Õ—4$Mb>T}Ki‚¾N^ùåî1½û™ ~¬"¨>†*O«Ø¾T{ˆJçò¾ 7úÎl2u>‚E‰=¾þK±¢õ¾- ‘½Y>¦l¾ÁƒO½Þ®:Ÿˆ¾Ú¬c€Ÿ> üÒ=ù‹M “Z¾ó³Ó>¿Î™w{%> MÞµwŸÏ¾ŒÃO;†’>ö{ù(+>ÏFk½a¾ÕÍÅû%=ã ¾1÷é«>ÖPõÒI¾îšÿ@1°½÷¶á‰>Ö°ú§˜n¾'“Ó"Ac¾ i¿Tšûd>”ÓRú¾çµéöŠQ¾sPýÿ'>ÿySïP'½ç¥x|k¾—,7q(>8Sÿä!Õ=õ˜º^@¾¹ºüòe>Štm6:É> ˆ%U7ýà¾™Ì Ô†>ÏŽa;îï>•Õ_+H¾'œM¾ â=êûáãô³>WDØ ¡:¾Cßmv ½ó³çµ•>™•È´Ü~¾ê!•¿ž¾ ¬€‡Vq>œ©V“(¾°Ü»=¾½ÀQ.[>K÷4•½îÂÑÔ¿×¾8VXØÉ>ÁÞÇzÓ=ñÖ5òH4ë¾yÍjÿä>E[¾s²>Ó¬Ó;k?¾žIáo"\>‰;À³k›>d]¹luO¾n_ýC¦Ø=ñ2˧R=>؇ì²A6¾ÜIZ½ð Öu˜>XYŬô…¾—öççþ¾k|ÙÄW>A¥a3h¾ [ÜljhŸ¾ ÕGôë>T`Í*½òúÃ~w4t¾™°m5ì¶>>~j±=ìƒ9±†BZ¾6ßî‚# >ñ¸pÌTz>/¸:h?¾›Gà™9> &b9òß>µ½Q<ܾªÊ ]Ýz=ô²´Ó°ê>Zm9Xß?¾wø"W³Ê½é‹:¥Ù>û $¾CW¹D¨Ñ¾d¶åå >— å™ß#¾ ëz/(Øö¾`”Ö:ß>Åîh}ô½öa©6¢W·¾+îå‘>®_ªäØ=å°ÏêÐn¦¾ñ-ûkM>‘0’—£>›õd'u›¾’,‰Oñƒ> ¨ê­ñã> íùÀ›Q¾Ýúégǘ=øk†\J(>Ýu:\¹¾âÎiR‰½âhå y¿*>ÍÄퟕ¾ܲPr뎾Ø’8û–>‹»ý¤¾ aüÿ ¾¹)´*½>ô9µ67‚½ù™-Mø=š¾Ÿëö#Ku>h™[=Þ]ÄÙî~¾©SGžL>$£Í_JI>€lVÞ¾ƒ‹Ûì Ò> Œw!?x>f¥”˜Rо &¨Ãt=û#jµ¡?¸>aà,ØüK¾C­ 2½Ø¹]ë->„A¸ÍJ¾jÒŠ­û¾[)ø y?>z+[<¾ ÁÚ+$i¾}$Üs>½q¾Ë½ü¦Éªì¾%¸&ƒ2>pSØ–fê=Ñì~²G)N¾_¸õ}ˆ#>­¾Ë >¡ˆ»¾pu&Å­~>hªî‰ä¬>ÅÜW¾-^k4G±=þJTo²>çË. ²†¾›‹©À®½ÇÛLæÍñi>9÷Þ•M†¾ïƒØÙv¾ëq¸ >eý"!l¾ ‰–FоwdASE`><±Ïôôâ½ÿ‹â1惄¾«¢÷@£Ã>Ä-Z¨ÈR=¸ ­ê´ÿ¾ÌŠ.Ÿ>-^Ž½_v>7¤j¬Ý¾Yj’¦Y>ªBK¯§ >):àðÃã¾KLˆi³Þ>wò…t¨M>o+ÝhÌœ¾ëŸn*`E½p¤a£+ïð>îœw>µ`¾jL 2ßྈ^¸Ÿì:>L"µ fµ¾"•œ×¾¹}‚ê‡ß>WÒ0‡´¾'2n—ü¦¾3Õig•ƒ>……ê¹ ½µ¯'C¾Èá*§“>¤tøQ4 =ÿ´¶C>¾>Ö’‚³ï>m TI5> äeSG2¾c¸Ne…y>Ðÿo'Ìó>ø £þ=¾4„x•…—=Åä´}ϲ˜>¢+ ÿ%ï¾ÝsÕðU½þa (T¥>0âÇ9ྶrSÒwM¾‹ep fÕ>m´èº¾xŒàLG@¾½mº²²>V%!Ù¼X½ÐjWUš¾{þªüé>ã)Zÿ=ý°4c¾!2BVž>ý'ß0™B> ö12›úz¾w:™çïå>JÒú>‚^†Ï 4¾w/"³=Õ¼’`Ó>TöÃûDë¾IY5Áã(½ûÆ–Èólƒ> ePC¾B¶Àaµ—¾ dbÆ’qò>~׈!*ô¾»IPd¾HkØPÎÏ>•É|:šá½Û_ãV9¾.–”ÙB>|O½’=úÌ?@P¾ùU7">…Äý^3t> Òü¿!‰°¾†2_9õ>VEæ¿D>8ÈÚ©¾³µ‡xªÑ=àÛiÇ*ç>^À©\¾®K„ËZR½ùAªàGÆD>íܾÇ¥x—Ö;¾ Dû±¦”÷>‹Ò²2ç¾ï¦ìZ{¾Õq‹¶Ã>ÏyÎR[½â”㓇n¾á¼•{->ݶ#dŒý=ø1k÷¾Þ‘¬£î<>¤fÓ§> ¸\ ­6¾‘"rz->²j1l>œÐÓ‹Z£¾êp6G=åFïp‚>º]ÊêÄ¿¾ Ï0ͼ©½öØöZß>ÌšŽ)¾CÍ›JÓÁ¾ 1n5êq>”ËË‹ñ¾¬tPú¾f±,ÎüÉ>ÛÎV°½çW˨‘쾕žÇ'H>6S¯«=õ¶ØÐBÏÀ¾»ª€´Éñ>|HËÚÁ> °ÅÀb¾˜Oñ>‘¡Y¹>3wmOµT¾cM™&­=étuGÌw>sœ~î¾\Åbs²¿½ô·dõ±«>«žN‘¤¾­œ×Úí–¾ Cí"B>š%NY ¦¾ýcdá=x¾ ¾Q¤õ>)ú ïÓ½ë ¡;~¾[(©« ì>uËÒa‚=ô®â;Š¾£€k´žu>Ä­H¤0> x Ÿvî¾›ÑWf–»>äÑ·£a>Íר'¾$ZûÉ=é”ò=¥·>…\3§H8¾5b¸ .Ž÷‡Ùyû>ù‘V÷ ª¾+´¬IÌf¾‘^Í+)>"($Ô >Û›bÎ<½øØ%…õ~¾Ããùp-j> LÊð„=Ûü»Å›*¾‹v†>”ý·äÍ>›m’¿¾rMÚ¯º÷>(*–"Ìì>G¢®wÊÔ¾VZ”ýýÙ> Ù¶v>%tU^¿Á¾8ÿõ׳=ËF¼Ù“ÊK>€±¦¡Ô¾>fã1úŽ½ûu“о> ”ªžN+¾«å#Š°¾ :ùx"l>—ßsÅŸº¾Å!O‘°¾fšB2?>d‡–y½êÊê4ßð¾IÛúBÕ>´šƒ L¨=ñ®™1Û¡@¾púoŘ>˜Ìàß>î>Ç‚€úR¾£±ôÊ.q> F…™’8õ>‹!íH¦i¾Ì]›!I=÷¯ÀVJ'>ìWf.w¾øüj¯{„½ßðŠê·õ$>§éœ¨LZ¾Záæþ€¾B:†ÿC.>{iÈyó¾…ê\c€¾™ÌHη>E÷‡eËɾ9 v†<¾m³ÏÃÝ> e`ùï½¹pkÐugH¾µ3½j¤>ïÎP²—=ýc”}j5¿¾#½Œføy>>©ßý> ,'ábÐA¾¾Ó^eê>³ØÞéh->Ñ]sK+¾ëPÚ]=åé™õ‰Ô>›&lèO¾Xçóûë½ôD/!øøc>žkxrM¾¦Xwn¾ ayÏ>¤ÆÌeßܾùN3—¾¸æ  ¢>›l,ÙHC½ô ¨¾_ÅkºC>”ÊS’=æa ¦Cx¾ð^L*F>Ä@Þ\¤>ÙaÄ’â¾.=©Ïw> wR_ P>S”f怡¾ÌÄG”\=üæ‰_ÞA>ˆ­J¹p¾£ßL”ôŽ½ÁìÍ@uÌ>CÕ鮾M[Þú†¾žx¶Æ1Î>NF¾¥¾fRK³\\¾ö%Ï4C >rßà“Ì ¾²*×÷sš¾’ ¬ð"o>‡™$Wµ½Ú6ï rª×¾&›D̹>­ô¬t©u=øÁÄeŒk¾åò¸/>*h}x> +“~µÀ¾ž5ãÚÇŠ>¿Ú/C+Å>œ5Å&:¾AË¢W›×=î?KàP»B>—è^ÿ¾èlèU_½ðS·Ù dã>Xr o,å¾ÍüDÄõi¾R ¿Âd£> ’<•m ¾ ›°WùÏÚ¾k‘&u>Ò7à殡½÷t'ÃÙùE¾âA°8¶€>û[ÅN&=ßç’ú`a̾©ëóÊ2¬>N§š'y>mSÁMKC¾}Ï]ä>@!«†Ïü>¿êH-¯“¾<ÏËÜn=ÿ|ö!¾Ð>št¶¼+´¾èù"‰ìš={ù¥,ìà>ÜÓðF¾­ÔÒ)d–½ÿ Säð€>6ä|¸û°¾Ö÷5ºu¾ßn™êˆ>¸°Ÿ¾›{çhö¾?øH…Œ>°»ùYB¤½àŽ î ¾óEÍtá¶>ê7áj´,=÷B^F×ݧ¾Ïë¹{ʯ>p7Oäã¾> “«š(Þ6¾ b½:L ÔÕ—r>ÑÅE4bà¾UQª$–=ðpï3õ<>ñ78¦À¾’©í$ܽïæžRÜÍ>I÷µ£X¾í Àw ø¾ íko>ž¼Z»=¾ Ðf³k7Á¾VþíôãP>Öˆlß½÷·9)s«?¾Ùäzõx>ÿ#1y¥=ß›nÉDº¾©«Ð8Ã>K“iþß>{~jàm ¾~Kn•™‘>#¾><>Ð*›rYU¾7\ÜåÐ=ÿ kW—l>®ýâNàžØäÂãϽš$ :ži>îQY¾žnƤ‹½ÿÚŒÔÅÊ>?µUò ¾¾£Ú ‹}½¾‚Õ r>wô "×¾t•ÜDz>’‰{-_‹½Û¿9ÀêCT¾½íá>±¦£,Òr=øÂ@<»NÕ¾æšøÜs>*ìÖ=£> Wm/Wdq¾›gîBƒÈ>q0Y1·p>+§”EDá¾.Ž´_“4=ì+‰\žø>8’‚\¾¹ÂAÁ©½ñ½Ü‚É>s¤œ1J¾|KJ±ßí¾%ÕNq >¢?‹s¿¾ ¬ª'DݾØ!#Gt6>¬Ä–týý½õ Aé=Y¾AŒ±`­×>¥{Ä=åš ê¾ê‰e3¡>ÂtŠÅµÙ>ïK…Òì¾n(> ½Î<àÕ7>zÙZk"¾Ö ¨_À=ûÁß­iÇ—>:Ž²aÙB¾uÊ¿d˜ž½Ïë¶âMˆñ>KÐÅF¼]¾ð]ª«ê¾º½ Œ›e>b¦N[¾¦×£ÊoÀ¾_‡¢‰->W²J ™³¾¨…B¾¤¾&ô¹‚>+D“a ½Å‹ÌÞwqA¾›ð°P²>.¶2ø=ýòs¶O¾ G4æMà>2"à`š"> \_÷[æ&¾‡KãŒØ$><›³¥g*>6-¢/÷¾ÈN—Š=âi¿§‰íš>ØžÀ©±ß¾h".*½ö½ïoL>Èæ2¾|±[Ù­3¾ …`÷I_i>ž ÊD¼à¾9ê†|¬k¾ÞäzÕCƒ>K®PG`½ïê 3ɾ51à()>çwDÁ{ó=ð{Êþž ü¾]ºB° >±7\!@>ªõÇRâ¾ ‹ WÏÔ> " "…¯>®E*y£4¾¸Œ]™SJ=õ´Û…?G{>)ä o¾¶0<1—½ä«Ÿv z±>àÜþÜ7¾ÑhË¢hö¾Ы'÷¨> ÀØÚ¾ ÊøY,iI¾xræ®ë>xʯ%ͽû«o=/é¾@óäqû>ný´™ˆ=Ñ)n £Ñ¾Têp8NÇ>ÜV€Eýa>øŠ^“^¾gÈÃ'Ü>^F§h;Ô>=Œª¢\¾P)Â{ùA>´]ÕDX”>M¤ÚJ*þ¾#†í¼=¹ÓEÅ׆æ>¹ó~LˆØ¾Óä±®ú½þO gfÔE>.ŪëB¾çò[y_¾UšÂ|¼>}-áÍh:¾y«Ã±S¾RìOxÇ>ŸîoE&½ÝŒ³×æýÒ¾9Fñ£>·›¥–©=ø¹ø2?Ž¾æÆß`¤Ÿ>q2ÓëØ> ‚Øsa\p¾˜Yn Ë¨> s•Ø/>PËgÌÓ·¾KøW=éýW´m…‚>`NÅuß¾‡¯2F½ó;í·¿ž>4XDN‚¾$]z­6¾ r)V>¡KÕØŠ¾«Ë—„Û=¾J!sD;>²ŸÝ½òsËÌ/-¾¤.&ø>E~§O=ë ìW%¾*ÉÆpiv>(xwÜÌ>ˆD×3a“¾šÎ5‰¹Ì> íÂN>>²C$²l¾ØNY®±M=÷ºmN&î>ÞèL -[¾ñE…µ½á(,v¸f>¹Uëž}:¾t6¤¥T¾F—8óˆ>„c˜2á¾ júØn ¾1.}u>jXy‰¾½ü×*€ÓU¾ Fó >‹˜TiìE=Êz÷•ŸãÚ¾=¦¥H«Õ>ÿ]ÊÅ%È>œq6>¾`ÕÍ@YÙ>ž\•R9–>!$,;Þ¾S|n @p>áq:ÒÒZ>@Œ}Òú^¾!Îfj=¼#NÔ, °>·HÀ€òk¾ÓT¾ñf½þb=~¬ì>/§“á(¾ÛkcaÑľ"àI^q>zúl˾AœÛýT¾iÈ΀ʹ>:ö€Ôo½ÚØñ4½¾)~4ÈG>–šƒð=ùšEξó†ð€ò3>ؾüÓ˜z> ǯ¦ø̾“^%̦>ˆÊs¹›>ŽKÝ ¾ü/IÆ»½=çI®×Çç>’^íbèؾKã_™‘¦½ôèBδú=>«ì™ [þÉ !CD¾ âà¯ÿÚ>ŸÔ[d¯¾¹Þæ÷–¾°£ZŒ#>Y'ÔŽV½ð1®2˜Ã¾õÙÈÅ`>ò‘†Ðü=ðI©r“ªµ¾[gçAŠ >ªêæRœï>ÆÓ!ls¾Ÿ}¸ÉÙg> Ñùà·P)>Ðç÷h¾©gÿEŽê=ô·ÂG,ËÌ>Rä,›Pý¾‹2k(3½ç‹[šwé¢>S®a[‘¾€r ¦°¾±¶„ôŠ>” Ç®²Ð¾ Ô#„Ü‘¾ïy~Ä>ìG¸Œá÷½ùŸª§h¾«ì¯yû>N`§ðB=Ý` ªR<£¾ )KZ Ù>HY2†4œ>Ÿ¶ì۷ྠ¯÷HŒ> ½ï¨Ú—> ©÷Õ(:¾$J€ÿ=ýVvB'Ùù>?-Á4—¾•‚"Êd†½È>€‰e9>7Q?XC—¾’¦êè¾–ëˆð>_ä‘ݸ¾’T×9'õ¾+(`.®€>OÜSWè¾·]æÓ+¾R,{w—>ëáoÝ»½²÷¡ûÈ£¾Éùá_Y>³ý` ¢X=ÿ(»‡ˆ¹¾8ÓH–gû>§‰¾1f‘>“Kƒ¾º¾q÷ûÄâ>¯)ô½>> Þ>Ã>¾o¹öÕÖ~=Õ$ãëNê>T˜ÉÕI„¾XžY‹½û8 €=> 2䩈Ͼ{¾s‚âT¾ Ôg%’cé>‰§÷q徕vÅ"¾î‘ãI?’>Ëå6˜Ê½â‰µb®ÉJ¾ÜQ±¦Ix>ñJÌôà=÷Ws…c ¾Ó+…]>DŽ¹ð;Ú> Šþ|ó¾˜üÙ½‘P>g´ GÅ—>:]Àè:§¾‡ñjìï=êC¢1§¾>_9¶¾€D“c½ól*ˆ1>•á‘˾ÔÆ€)³¾ `¹±@’B>Ÿ;*eÂñ¾(êê¿Ç¨¾†M¯7Ö>fÈR°°Þ½ðãÌg[¾ß—³ÂŽ`>߸Ðmê=ïªÏ1ѾS™Ñ á6>¸N¤çD>­«úƒ)-¾žsB,p$> ÖhøÓ>ÑYÁíÈ ¾¦§4ç±=ô„å>ÊQ>\m'NIe¾~®d¬À?½èl!Ú¾¬ç> e˺ʾcÛê!Л¾ù9C;«>•ØJÑY¾ s¢gŠ+¾”ié‘c>ÝDãåA½ø ¯ŒÜ/k¾×Íinê)>ïk#0„=áT6n4¼l¾¿a4 Èw>Dý%¯ú>[j÷Ãð뾇Y½õq> ýãYÛ¤æ>iÄ+¡Ò¾   ‹I=ûoä¯È“>PÁõsJ¾X7¶ˆ½Ôßn…ÊT>n“Ê—S÷¾ž|œ,n©¾½twq›T>r3roƒ¾xŠ„ ¬¾·ó4ѱ>3³v¬h½þºJ˜ÛA¾É+:@^R>·š,.º=½›‰_üïƾ„B€w>.>—6”•>%ˆFD·ò¾XPûä\§>á—™9’>憳2 ¾T”‚‰h>ò oqŽ>@fŠ|+¾Ëâ/_·=¶ Ú9èÝh>îܠ©K¾¶h‡VM ½ÿ-¦GÅ>8®^bÞú¾•~ÓX¾°®\n¼¢>n8âz·¾zE®†ÿ•¾·M¹7Ï>_Ýi=J½ÒdúñU0¾j‰’6F>5ã_6¢D=üõ7¡ì¾RÐËC£>Aüg˶ÿ> V6Õ²²¾‚‘ÙsI€>ò´nŸ:>-ªšß¾©’|ð„¼=Þ¸éˆý^>ŒÉ´††¾®w‹´Íë½ù"Ú®=Ü>í,™t…®¾ߘ)÷²Ó¾ ì­ÿ¶>»íòܾ^Ëôám¹¾¥ßÁÓµ>ëÕvW¨½å]d%בG¾±‚ÆfHV> m’aÚ=ö4¯†vú/¾Â"„.¡>u$ü76a> ±'о¶¾š&¹4>[>»£ÓšÎQ>B_ª+è¾(„·½;=ë)õŽY'>REýѪ¨¾‰it§¨¾½ó[}4°¿¿>“)e$¾c/@u¾ g8ÜrR]>ž6g¾ ÈNá|k¾”ûXºP>^Ž Ðsá½ðg~â-µz¾ò»]‡9>ì}‡ryª=ð‘]|Ù¹¾blUàd>Œ¡ðè>!aIkβ¾ž²ðÃSñ> Oy±t¢>]5:F¾¼‘îp=ó £"d>‘™yçã¾I÷œëÆM½ë·NaZŽ>-³¹9e¨¾ /n—K¾ã£h0–>š`ÂûL<¾ ‡3'sß¾‰V¦?^>»÷@ŠÊ½õÅ—V›ñܾ0¾@¡Ž,> Ç™ˆ›U=æj;à "˾÷æ©h‘>ˆé\Š5<>©/É9>Œ¾“…ËÜz> ±úÇop>Ï—·d¾â.}ˆ¾!=øR"®L>ÎãotZú¾òÔ#‚ѽáG G8ˆ<>¿M^»¾þ’Õr±Ñ¾wPAÅ0>‡£Rñ§m¾ ÐÛ5r澂ʊY²—>é(BýúÌZŒšø‡¾mŸãû>>jÒBÝŒ=Ø/[%1_¾…ü*¢>mÐÁfF•>I²Žîº»¾z;ÕG> ã¦å0z|>ÐñÙýá¾"mlÊä=ý.–!;VÔ> Úõž¬Å¾…äK¨(½ÍˆÄ³øë>J}ã[Ο¾Ø<3¦ùɾ$Wsû¿)>hÁßt±×¾íi:“‘¾ƒ\ii³><'¹oGæ½ÿ|ˆX¬¾«$¿;î >ÇàedX=µ %¯ê¾ž qÑ><¬ÖÍ@¨>ë¿‹Ûg¾UËŽQQ}>ê8‘j›>ÁÑÐz¾Rñ¸íuÆ>ÜË¥½Ë >J<ƒ4/¾ _mÜk=¯x÷Ø\ÊÏ>ÑEx4¾œÚl’§R½ÿ×69“†½>?ʼnLÁ&¾oMm Ô¾5êÙ‘>eŠÍ—·¾ñ–}Ÿs³¾ê£Ò¯–;>?2v¥Ä¸½ÉÓpÎêŽb¾“pâ;™i>÷woXÙ=ý°Á‚S¾(lFÁV>ãݲüì >$žhÚxë¾uÂo¢°Ñ>ûÈ%÷We>‹!ÇFâ¾uPbÊÌ=Õ—4$Mb>T}Ki‚¾N^ùåî1½û™ ~¬"¨>†*O«Ø¾T{ˆJçò¾ 7úÎl2u>‚E‰=¾þK±¢õ¾- ‘½Y>¦l¾ÁƒO½Þ®:Ÿˆ¾Ú¬c€Ÿ> üÒ=ù‹M “Z¾ó³Ó>¿Î™w{%> MÞµwŸÏ¾ŒÃO;†’>ö{ù(+>ÏFk½a¾ÕÍÅû%=ã ¾1÷é«>ÖPõÒI¾îšÿ@1°½÷¶á‰>Ö°ú§˜n¾'“Ó"Ac¾ i¿Tšûd>”ÓRú¾çµéöŠQ¾sPýÿ'>ÿySïP'½ç¥x|k¾—,7q(>8Sÿä!Õ=õ˜º^@¾¹ºüòe>Štm6:É> ˆ%U7ýà¾™Ì Ô†>ÏŽa;îï>•Õ_+H¾'œM¾ â=êûáãô³>WDØ ¡:¾Cßmv ½ó³çµ•>™•È´Ü~¾ê!•¿ž¾ ¬€‡Vq>œ©V“(¾°Ü»=¾½ÀQ.[>K÷4•½îÂÑÔ¿×¾8VXØÉ>ÁÞÇzÓ=ñÖ5òH4ë¾yÍjÿä>E[¾s²>Ó¬Ó;k?¾žIáo"\>‰;À³k›>d]¹luO¾n_ýC¦Ø=ñ2˧R=>؇ì²A6¾ÜIZ½ð Öu˜>XYŬô…¾—öççþ¾k|ÙÄW>A¥a3h¾ [ÜljhŸ¾ ÕGôë>T`Í*½òúÃ~w4t¾™°m5ì¶>>~j±=ìƒ9±†BZ¾6ßî‚# >ñ¸pÌTz>/¸:h?¾›Gà™9> &b9òß>µ½Q<ܾªÊ ]Ýz=ô²´Ó°ê>Zm9Xß?¾wø"W³Ê½é‹:¥Ù>û $¾CW¹D¨Ñ¾d¶åå >— å™ß#¾ ëz/(Øö¾`”Ö:ß>Åîh}ô½öa©6¢W·¾+îå‘>®_ªäØ=å°ÏêÐn¦¾ñ-ûkM>‘0’—£>›õd'u›¾’,‰Oñƒ> ¨ê­ñã> íùÀ›Q¾Ýúégǘ=øk†\J(>Ýu:\¹¾âÎiR‰½âhå y¿*>ÍÄퟕ¾ܲPr뎾Ø’8û–>‹»ý¤¾ aüÿ ¾¹)´*½>ô9µ67‚½ù™-Mø=š¾Ÿëö#Ku>h™[=Þ]ÄÙî~¾©SGžL>$£Í_JI>€lVÞ¾ƒ‹Ûì Ò> Œw!?x>f¥”˜Rо &¨Ãt=û#jµ¡?¸>aà,ØüK¾C­ 2½Ø¹]ë->„A¸ÍJ¾jÒŠ­û¾[)ø y?>z+[<¾ ÁÚ+$i¾}$Üs>½q¾Ë½ü¦Éªì¾%¸&ƒ2>pSØ–fê=Ñì~²G)N¾_¸õ}ˆ#>­¾Ë >¡ˆ»¾pu&Å­~>hªî‰ä¬>ÅÜW¾-^k4G±=þJTo²>çË. ²†¾›‹©À®½ÇÛLæÍñi>9÷Þ•M†¾ïƒØÙv¾ëq¸ >eý"!l¾ ‰–FоwdASE`><±Ïôôâ½ÿ‹â1惄¾«¢÷@£Ã>Ä-Z¨ÈR=¸ ­ê´ÿ¾ÌŠ.Ÿ>-^Ž½_v>7¤j¬Ý¾Yj’¦Y>ªBK¯§ >):àðÃã¾KLˆi³Þ>wò…t¨M>o+ÝhÌœ¾ëŸn*`E½p¤a£+ïð>îœw>µ`¾jL 2ßྈ^¸Ÿì:>L"µ fµ¾"•œ×¾¹}‚ê‡ß>WÒ0‡´¾'2n—ü¦¾3Õig•ƒ>……ê¹ ½µ¯'C¾Èá*§“>¤tøQ4 =ÿ´¶C>¾>Ö’‚³ï>m TI5> äeSG2¾c¸Ne…y>Ðÿo'Ìó>ø £þ=¾4„x•…—=Åä´}ϲ˜>¢+ ÿ%ï¾ÝsÕðU½þa (T¥>0âÇ9ྶrSÒwM¾‹ep fÕ>m´èº¾xŒàLG@¾½mº²²>V%!Ù¼X½ÐjWUš¾{þªüé>ã)Zÿ=ý°4c¾!2BVž>ý'ß0™B> ö12›úz¾w:™çïå>JÒú>‚^†Ï 4¾w/"³=Õ¼’`Ó>TöÃûDë¾IY5Áã(½ûÆ–Èólƒ> ePC¾B¶Àaµ—¾ dbÆ’qò>~׈!*ô¾»IPd¾HkØPÎÏ>•É|:šá½Û_ãV9¾.–”ÙB>|O½’=úÌ?@P¾ùU7">…Äý^3t> Òü¿!‰°¾†2_9õ>VEæ¿D>8ÈÚ©¾³µ‡xªÑ=àÛiÇ*ç>^À©\¾®K„ËZR½ùAªàGÆD>íܾÇ¥x—Ö;¾ Dû±¦”÷>‹Ò²2ç¾ï¦ìZ{¾Õq‹¶Ã>ÏyÎR[½â”㓇n¾á¼•{->ݶ#dŒý=ø1k÷¾Þ‘¬£î<>¤fÓ§> ¸\ ­6¾‘"rz->²j1l>œÐÓ‹Z£¾êp6G=åFïp‚>º]ÊêÄ¿¾ Ï0ͼ©½öØöZß>ÌšŽ)¾CÍ›JÓÁ¾ 1n5êq>”ËË‹ñ¾¬tPú¾f±,ÎüÉ>ÛÎV°½çW˨‘쾕žÇ'H>6S¯«=õ¶ØÐBÏÀ¾»ª€´Éñ>|HËÚÁ> °ÅÀb¾˜Oñ>‘¡Y¹>3wmOµT¾cM™&­=étuGÌw>sœ~î¾\Åbs²¿½ô·dõ±«>«žN‘¤¾­œ×Úí–¾ Cí"B>š%NY ¦¾ýcdá=x¾ ¾Q¤õ>)ú ïÓ½ë ¡;~¾[(©« ì>uËÒa‚=ô®â;Š¾£€k´žu>Ä­H¤0> x Ÿvî¾›ÑWf–»>äÑ·£a>Íר'¾$ZûÉ=é”ò=¥·>…\3§H8¾5b¸ .Ž÷‡Ùyû>ù‘V÷ ª¾+´¬IÌf¾‘^Í+)>"($Ô healpy-1.8.1/healpy/data/weight_ring_n02048.fits0000650000175000017530000032560011705033043021714 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:08:01' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24576 / width of table in bytes NAXIS2 = 4 / 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 NSIDE = 2048 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 6144 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1024D ' MAXVAL1 = 1.634779014281E-01 / maximum value of T weights MINVAL1 = -6.831377479844E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1024D ' MAXVAL2 = 1.634779014281E-01 / maximum value of Q weights MINVAL2 = -6.831377479844E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1024D ' MAXVAL3 = 1.634779014281E-01 / maximum value of U weights MINVAL3 = -6.831377479844E-02 / minimum value of U weights COMMENT END ?ÄìØ P?¿±}ô &ç?œq .Š¿{½N]ýó¿k‰¢ûä ?{:»ºœ¿wƒõ``Q"?hûd?\²Ù¿.ÃuÓë|¿[/†nYè?b”ß¡m¿]3%³ë?Gf÷ Tòq?7«.˜üY¿Pº gc:p?R Rz:a¿G]½œgR?Øâ?ÌÚÖ?;Éê1S8Y¿F" hÞªú?C‹ß$k¬%¿2GLL"@¿Q«K^#?9b$X¡œ¿=¼Õºëp·?5ª› ª¿+ßä’p¿'@¤Š £?4¡ò¶j­™¿3’©¼’ä?$ZW¢¤ùb?ê3.ðg¿),çùýå?0 ü,¢C¿(OyW²~e? ÿ¹æqt?Òwï}å¿'sÚûV*?'“ðöšŸî¿¹-Öb'Ú¾ëß²n+¯?Zyòç.u¿#ük”Ša,? 2yGeê¿sÃ)0:‰¿ ÙpTÌŽ?É»õ/w¿“ËÔb l?FXBmåH>­¨6¼§.¿¨l$±?l $¿ìŽ(–`0?Ä¢¸ÛúË?/Ý‹´Z—¿Iº®0?¢ í™V™¿ †ù:)›±>Ëe¾¯Hß? N´hpê¿vbémC?LºR€<ˆ¾þDºîrÓ\¾óÀÚòÅŸã? øÛ1âQ¿AßN;É?‘¬ß{Ç©¾ÙÅExuT¿fÕc<è? » 2â¿ !{’}¾>úM½Ì’ÿ}>çÎãiÒH¨¿_å–d92? kñдB}¿a†ÉÖ>à܇ÚJ>ø¶›Ûï=¿b"tª?ârCXZ¾÷3å­ ”ê¾Û`µ é5?$¡¦Á· ¿ C©×¤?KvF-œH¾áÁ7$Öâ…¾ñ½ÑjùÎ ?™Rj½'‘¿  [ˆ>ô´!è”ÂJ>Ê`~"­4h¾øÈ’Í^}ó?¥Œ)ŒÛ¾ûÞ˜EO{ >âƒdÄë`¹>逕¸ÕËx¾üð&'Z>þ9jH÷Û¾ò£ìP.ƾ«ñŽÁT­Ö>ó:b }I_¾ü6´º„k >ø&‡ÉÂá¾â»ãÑÐßľâ'lÁ¼>ö¾ Út;¾ù§Öut¯>ðæûÓ¿“ľ«9Ó\–3¾î¯–Ô >÷‡ïÿ'ôx¾õ%™( é>âŸØ«Ó&ù>Ù<è#°iѾò‹ò«ÁÆ>öaôù¾îÓƒã…Ë>ÀÁtøíTÙ>çs{ÀJ¾óËâDó¥l>ò«L˜$¾âOæUZ²¾Ð¾6\9<>îkoÕ²Ù¾ó1s‚ÏC>ì<‘“* ¾ÇýÌîIqY¾âBEíflÚ>ðÂòpOʾð—'Ë¢Øë>áÜâÿ@>Ä?üìÆ“/¾é <;„ý>ð‰¿K¿ã¾éô§´} ó>ÍC¤«ÔÞa>Ü-@ŽjAˆ¾ì‚ƒ2’x*>í¢‚’«S=¾áU±‹¦¯}¾³Ÿëΰõ{>ä“ïé“Ém¾ì劼†/>çìjý¶‰M¾ÐŠÿ©³»Œ¾Õc®Œ>èOyýhÞ¹¾ê‘ÔÏО>àÁ:ʉç0>ˆ Û%@.I¾àâ‘FlJ>éS#Ê4©¾æKïܺ>Ñè+G£lÑ>ϘÌëãB¾ä¿ÁÐyE>çãQÿ¬RL¾à$²Äj>¤ ”˜3#…>ÛŽ.½z¢¾æ=?j g>än˜À{ñE¾ÒÙ×ÿý ¾ÆOÕxhúÙ>á²ú^iU¾å„'hÙl>ß{¢=˜N¾µ w@¾ÖFtøþwq>ãŠçMp]¾âèªËn >Ów‘ÔVgÚ>½ZA™?_¾ÞË ˆ^>ãeëžïµ9¾Ý¼{ôÀ>½®ÌE˜6ê>ÑÀbÔ•õ ¾á*0–³#>á€Qe"ݾÓÒš‘8澯úñ{•më>Ù}Q$<þm¾á}j !f•>Üo5'ÎPò¾ÂR*îÉåܾ˲Kþì$>Þí ¼ù¾à1£Ôã*;>Ó÷Ì[V7÷>“­:ÒƾÕn4;{e>߃ªydL§¾Û ­Œ$K>Å!æçNÊ>Äë·©{˜7¾ÚPWì×Ù>Ýð;gw%×¾ÓðÊ^Qæ\>‘áR!Æ›¹>ÑÖhaÏÓ¤¾ÜXYNF<ñ>ÙÑYyCâT¾ÇOÉ*Ž¾¾nD>Öæ"p­£¾Û¡Ë¸AÊ>ÓÄ늸[¾¨áro¥¾ÍG¾BÀ >Ùm°Qi°&¾Ø¿òPÅ>Éh‡’;>³®'C80²¾ÓÍh´gX>ÙrãˆÎoQ¾ÓyÊÞ“2Å>³2Ò³–C·>Çš5´´¾Öº§f@]%>×2}]¶—¾ÊQ^Â\ž`¾¥6¦ uf->Ðû×^‚о×_T­îQ>ÓÄ©›Mè„Aµæ¾ÂnÁÜgý>Ô7÷ãþ9¾Õâî ;à>Ë>¥§ßn>…³q ¾ÌËó{€FÑ>Õc°ùê"£¾Ò–=ƒjl—>½³:¨=Ð>» sAܾÑ߶+ôfõ>Ô’ínCñŽ¾ËÙbNS>‘jp?näs>È(Ejqm¾Ó},«K|>Òë¾ÀÖèÅ)Ͼ³Nœ÷“Œg>ÏZFôFM¶¾ÓC`'ȱ>Ì*±Ûîû¾¤ôÖ`G q¾Ã±K—ùD>Ñ©„®ϾÑ^øÞÇ>ÂvïPUêY>§œýuüê~¾Ë8Ïÿᡆ>ÑóÖq#óŸ¾Ì9ÜÏH¿Y>¯£^²'°Š>¿VCim¾ÏÍäÌzØ>Щ2—ų¾ÃÂy®[Á¾”3qÝ>ÇTõš1W¾Ð¤bŽrþ>Ì á‡Z¯¾´rwk¢¾·ê$àÖ–š>Ìh-Nˆ‹¾ÏÈ< tð]>ÄÀ©ºÜm1¾pbglW¾Ã©í™™Î>ΪP)È‹s¾Ë¨»(Xå|>¸iÍ»½3X>±Ðs^ÂѾÉé&à T>Î"&ó1í7¾Åwep#Å>™Úxkn7>À4fäâð¾Ì ÕËCij>Ë¥R›q¾»Ä§\4D¾¥ˆ7ã4ú>ÅóÊ-tà¾Ìb•'êžu>ÅëŒWwdm¾¦%ÇÙ¤¾¹á«òŽ`>ÉqÝ°¾ÊKL7 >¾‹Ìë–{–>“çøgŸ³¾Âã"|k¬,>Ê‹ã4zðR¾Æ!Cê¡aŠ>¯+*sÌ‚0>³¼¢‘®–¾ÆØ"2[ ¼>ÉXú&=XÕ¾Àcœjk©ñ>TjŸä‚>¿Û¯Ý­¢¾È bŽ’Œ>Æ…Û«¾³QëIÁ¾«íé3ë²ä>ÄCR•äPϾÈ=¼55n>Á>¤¹c¾”ŠôbËô¾º(²É> ¡>Æ¢€f&©¾Åß7ûXi™>¶ˆ:ß&ñ›>¡ªxŸA¾Á´\R«íw>Æü¢ß&é¾ÁÙ³U$rØ>¢õÃ_óÀ>´¯)툑“¾Ä”Å’2\i>Åm†êØÂx¾¹<,þÚkܾŒ<&„ +º>¾Z‰øC“ª¾Å˜7>{gt>Â7,3 ¾ª¸0‚lcÒ¾®ã¹!ŸÀÅ>ÂyùfnB¾ÄÉÑYßø>»p¡Ôþ³4¾r n´éw¾¹`é"jÅ>Äß° ¾ÂY5#so+>°Æ¡LP¶>¤èÒŠ|¯¾ÀU.\±Õ>Ãö×oÚ;½'ñÜkXG>•›t­Ò–µ>´N•‘¾Âr¨þј>ÂAå醷¾³ºjŽ9-À¾–ì½·åR>¼Rû´ëˆª¾Â÷ytˆ3>¾d*[{m+¾¢v>´±¾¯ƒå¿_¥]>À·ú‹-™Ê¾ÁóRS»h>¶6ñÂá4²>t³m³1a ¾·õæË0Ï>ÁξÜÛVž¿'Htûi‘>©ƒj~ˆ˜>¦S`Êh¦¾½Ï¯;Í*>Áo¼nY0¾¸;”ÄTQa>†¯j5œr>³™¾™_â¾ÀûK„_<>¿sqî`I¾¯Ÿ­†­`À¾›2—è¶Ö>º ß™n};¾À¹—ëØìÒ>¹Ç­ðdc2¾šˆùÕ¹ î¾®±Y04\>¾§ Ã௾¿K-" µû>²o\õ&í>„hkûŸ´Ó¾¶,&ê=5>¿§hÀGᾺÚåý;&%>¤&ôÐæ>¦Y©÷„0¾ºþ¶ôÝ££>¾±—oR)&¾´œÖÚ¯>vlj¡Y¸>²<¤²Gõ?¾½‚‰CcòŸ>»uSúÂȾªFˆt_>ò¾›ªÃ»Ò >·¬,ÿùÙ¾½ª™ÍUœ@>¶S¤éG³c¾”Jcè|!¾¬Ä??Üê>» gOǾ»—Ë‚»[¼>¯–µw¦t>‡—Í÷¾´0 Ñ}d>¼;ˆ¾·“0ù8> Û¥—‡>¤¬qZ¨¶¾¸LP™îy>»DÉçξ²Ì#{Ñú>j/¯1È>°•“ÔKE꾺i0ß;)>¸Xõu‘ƒ¾¦Ý [Á¹"¾™Û\Pd>µM?QZÔ¾º|ò}>³Í6mŽ’쾑]{+ü/¶¾©Ñ}T ö>¸¬Ä®Îð >…ª;¤KÍ;²Ô!(M>¹FÊ+ªsO¾µ )½Ž˜>žMŒêf.>¢mxåO.Û¾µ½@GgvÙ>¸u`EVµW¾°@x¦ÙpZ>lÇQÀïÔ>­|í¾^1x¾·§iÜ«">µñÓ#¿Í¾¤óÇËrÜž¾–6•z£mx>²öŸ†Ø»¾·Î¥_~M>²ã"U ¾ù{š3À¾¦‘¨Ž++Ÿ>µ¦`¼Iøª¾¶Iƒ U˜>ª¾„‚Ûß>Äêé· $¾¯éY°¤>¶³ßŒ§v¾³Jè•eD>U5avþ>ŸŒ¸Æþ¾³M-J}‘Ù>¶#¾÷´R¾®9V\²ƒ>vÝ2î&…>©‰g®<Ôÿ¾µ*ì:Y>´¼j—b¾¤0µ$º€ñ¾‘.«ûФ>°§@ößŦ¾µ‚)¥TÀY>°ÅnË‹f¾’„¨òö¢¾¢í?β.>³;çê,œÊ¾´bmÚ­è>¨õvº»š.>l¤´ù X¾«„Am(ê!>´h«xÔ+ï¾±ójñt—>ž6,æÎÜa>˜lŸç°ñ¾°ñ>/G$²>´--²¸e¾¬áNÈ£~ð>‚Ðô^|p>¥Z’"…ß¾²Ý°x¨ó*>² â=¥8%¾¤H1¯‹¢ß¾†#±ø&Ì>¬¯¥æ±ôľ³xºJ¼Ø>¯ß›ï/Xu¾•§k ¾è›¨ÍB>°ê[ø¯¾²Ê{5™)>¨¬{(Ÿd¾^“þE7÷¶¾¦ýßV3º>²Iš=úê¾°ïÐÜÜK> 7`n ï>ï9lÑLY¾­5Q’g˜>²o¤,[¾¬-ðšH² >Œkum%> ðÀjä…¾°§tQ…ÅA>±jÅ!i4Ž¾¤öÉÈäß¾plFü>§úëà<ྱ’ßìûl>®¶iF³'‘¾™„C¡Æ¾•^9­lïé>­:R“ûÔã¾±]²N˜>¨ß…8ɾ€|¾–ÊX?¾¢Hæž9­w>°:0𓾰tús”'>¡Ã¿ÕîÞb>“ëeñ¾¨rme•ª>°É ÷-+ ¾«Ö&@û»è>“ÅdÖ¡_>˜Öçaº,¾¬Þ‰ƒ6Z>°OWZ¡ ]¾¥û]1«{>kÿ2Ý­<>£_Nð#¾¯b)éF˜á>­Ä•˜¾ž#®/Œlɾˆ”àƒ9Ò_>¨YѯL^¾¯ðr±C_>©Huc›€¾Ž@½û9O¾š²0Û'‘Ä>¬<‰4l«q¾®›U~>9,>£ƒ_Ô‘{>!¦ŽåÞÅm¾£y˜Ï «>®/QàAѾ«ð4Ǧ>™¸c•T¿>„%ŠX|h¾¨:Ï‹‹\>®S\‡D±¾§Ý›?S§>†þ£“«¼»>›îþ\ú5¾«i»" UD>¬½Æo‰l"¾¡u³àͻξfH¢¿üZ,>£lJ¹•£¾¬ímeM>©f;«Äì¾–5ëü°XŽ¾S¯™‰•$>§·ßI­ ™¾¬ÆšÁ—y*>¥2ÿ;—%ï3Ѿœjž‚»|á>ªv±z¤õ¾« žÙ!Z>Ÿ›··ä >r7ÎßZ+¾£;ö§Ö Ç>«©-ªôÄ~¾§ïhz>Ÿ>“Œ'!!Ó>‘H×þXü¾§ПÞœ>«Srú*¯¾£©Œï—~6>{·ùtÑ€>œC¯ï_Ú<¾©o‘u̵v>©Ž~À·š¾ 'ìä.ø¾v0C‡<²£>¢½ ›¿Tྪjï0_.T>¦…D%Ìj ¾‘¨R S0s¾‘<‡ œZ´>¦/ÿ‚€ØT¾©ýÞìNS>¢qd×¾wB[~yʆ¾›“ZIŽ >¨\‰¯ÊM€¾¨@ÈúÙº>›*ñGñ#Ê>wj•/ûh|¾¢ )*¿nï>©7Q³´ê¾¥[Íp6¶s>wÆ÷DEÞ>Äé&›¾¥>7°<­>¨ÆéŸÙÖ¾¡ƒ‡çEfž>u{Ôˆ4ê¹>škÕ;iˆ¾§BH-hР>§"0Èð¹D¾™ê詾·à¾v7:=‹+>¡3®ùm³B¾¨ºnç¤mã‡Rd1¾ÐJRx{¾ô Õ~‹>¤5¥MƒS¾§¬ÏùgÑ0> Ù«ö­·¾vÄÁ>˾˜Ü[ ¤¤ü>¦"mËŠ±¾¦..ðÆqÚ>™9üB†9>rÚÓ^d'¾ 5I*wÞ>¦òËÄbß¾£´Êq “x>Îüʧ >Œ¬m– ‘¾£ŠÁÓ_>¦«q»H4¾ kD˜Ì'{>x×òy—†>–î_Ò…j¾¤ûûì>¥^U'­nò¾™SÍÅB,¾kĪRÛ>ž(œê¥2¿¾¥ÜÈ1ÃÔê>£(a#ëy¾d07%¯ ¾ˆñ|ö}ê¹>¡â›Üá¾¥¼¡Xáý=> //˜DMž¾}vÍôÖ¾”¨­A6>£ËÀ±‹RŽ¾¤ª‡[æà˜>™=/›jœv>Z%öÉ–Ï ¾›¢f?u£Ê>¤ÇïryæV¾¢¿9âÌP>‘L|êPW¹>„qMIÖoо •½ÒŠ>¤Øq-Ӵ̾ Z. ºx>ÜiD ´Í>’ ù‹K¾¢Œ¿|®€…>¤ $ãéý`¾™Ê‰è5~>@IV;R6 >˜Ö‹©¿î¾£¬ÓO„3 >¢nŸä ?*¾’åÂÖ¶¾~tË8×£>žZE¿ß^¾£õfñeAž> $£^¿©¾…¯‹ëìDU¾Ž?&,u©°>¡8¢ |ìþ¾£o%Û:/~>š˜•§r}ö¾gñÂ6Ü-¾•À¢‚µ ‚ˆ¾¢*Àûœ >”`D-x>r¶5@­ ¾›HlË ‘>£¿\4ȵ¾ >­¸3ƒ>ŠœZóŽ>‡Â˜›O&¾Ÿgn¾ê>¢Ð<]®¡)¾›!vE„«>w÷)¾E’>’]òƒÌ¾¡?í§CžÚ>¡åºÑFó¾•Éw½—º¾W"8[yª]>—ìƒtúRf¾¢º—ô> [ºè/È]¾ŽÞcQ”??¾€ªÉCQ7–>œgí¿G‰‰¾¢ª‹øw>œ’þMœ~5¾ˆîìú°¾Teæ>Ÿ´æn+8r¾¡‘‰9ag>—“gµëؾ`N£#TE€¾”=ünt_Å> ã nÑM‚¾ lAq"i>‘ò+ObWÌ>r`3¨Ð¾˜é½8º>¡MAF6#a¾… à¯>‡Ôí^êr>…N÷ Ë)¾œ‘¤vr>¡Tçz…Ž¾™TV_°ÑE>vÛ s\ª>7UÂ88¾Ÿ"ÑàV¹> `ð溾”v6óZ€í¾• aÂOkµ¾ Lj; >žDC£Í þŽ<¢ÌøѾyjvó|&>™ëJMz¾ {Ã~ØW>šéÒr†Àó¾‚þnÍg¾‡¯ìqÏr>œ Úíf°ù¾ %¶QuU$>–ÙÁ×TÛ¾nW¾ñe:]¾Ã6ÔNüb>ž|ûë侞©v¢-®w>’>ú€MÓ>\ú:'7}¾”ýÖv|F—>Ÿ2òbÊE꾜,¾Š„¦>Š‹BYG†>|šî˜I¾˜qHs €>ŸS‹\õ8 ¾˜õA^coé>€2Ñnfœy>ˆ)Ô[PŒ¾› øîU>žŒ½äYë`¾•&<ÐÁ—T>g þ¥~+h>|X œ¾œÐFß;ª5>œñù{—„k¾äÉG×o¾a›üºœ>”CíÍÑMu¾µQ8ÓŽJ>š›ãìm¾ˆ­ izϨ¾|)nÃÞÝ>—ZØjÎ ¾Å €àèU>—¥iõ5L¾~ÒʤԾ‡¹´múˆ>™µðÊÃá¾ ö O>”-¿ N‚¾g(N"p¾kÞTt%>›P}“B™¾››8U¹V>T ”@l”>[®Ù×By¾’÷µƒ>œ+M!ÆÛ¾™‡ÈK W>ˆo੃U>xŠÚ€$D^¾•ÓJdÌ ¦>œMš?Ù¡¾–éD  Þ>੃†ÙS>„rÛ–âÚ¾˜ «K–$I>›Á)’-^.¾“Ù ÕÛÊ*>m-ÐHÔ½>‹Ô¼Òzmÿ¾™ ry >š”Á´›¾qa˜7y¾@d`¹>>‘%MÂq탾šŽŠ¸ƒçZ>˜Ù½y‡'¾‰™kš#¾r7fk+Z>“ÞkíÉý¾šÝõdÕí>–£žáâ]'¾‚ÓÜ)¾€“ØAöí>–%”3??€¾t¿Fƒu‹±¾‡wmõÌ=G>—°þœ\¾™¿d¡h²?>‘[êŒk¾Vh3í„:V¾š?ÜËÒ>˜Ç2)Ц'¾˜lÂX½Ÿ2>‹ãXý¸>bµ~iо‘sÓ Þ >™T:IÏ+¾–«Æ{Òí>…EŒîÆZŸ>vø4»W^†¾“¨æÄ“®0>™^yµwÆ9¾”1¾Æ>}‹ü{…>ñé"ÔW¾•h·skôá>˜îµ`~š7¾’"JjçL>oÇîžwÚ>‡ÑUWJ‚é¾–²‰&óI>˜ŠõÚbI¾ŽøÕÍá^G>B#;×u>Ï;5/û¾—ˆFua.T>–ÍJ[1®¾‰Y=½¥«¾dÿûM °K>Ä"Oµsñ¾—î4ŒˆO'>•4XU½ö¾ƒ†QÆJ¼Q¾vëïÙ>’¥]§ò…þ¾—ê}  ý¿>“RïYtœ.¾{= Fàž¾€â<¥>”%ê¥(×¾—„ÜôGˆ>‘6œpB4)¾n÷^&Àxì¾…ýLo+ ƒ>•FE½êâ\¾–ÆTÕ¢ >Ùô.z©¾OÔe~…„쾊 ½?­:>–É’ß9 ¾•¸´Lfü%>‰>Axbž>\j”Q¾Žˆ±o †‰>–q[붥b¾”fZ.:ð>„ ös ”>qž‡¿4M!¾õ£‰˜!ê>–…@ä8¾’Ùï™g >}þd²µ>:>{rs¡G’ܾ’Y«¤Ÿ¿n>–JÉE­‹Œ¾‘M2á>sï³æ‰´Ü>‚?ª@3­¾“q*ßóS>•É‡8.¾Žz'.ÑÜ%>dŸù‡=>†WØ;”?·¾”>+?åF7>•’ãYÆ ¾Šö§/Bž>x³P`n6>‰ýS¼*)d¾”ÃÞÞFæ>”o@A=`¾†f>”f4¾aQúÖùlá>,(wC)¾•S¬áôÁ>’埀$¤‡¾‚8L#X¾qN`‚|ã„>ãC…ÿÁÛ¾• OQͧ‚>‘•'ó(+Õ¾|Ý/¹E?¾y`ãªjc>‘æû£¤Z¾”Õ+LAH>$Öxjù¹¾sÆU‹Ñ5¾€h=âˆ^>‘øfM“¾”làs8¡>8+¤®Äè¾gY6©{¾ƒË wÀ·È>’§^;˜ùþ¾“Ö^}Þc>ŠÚæ[Œa¾N¼êýǦ¾†Õ˜X}61>“!½h³¾“\¨Šæ>†¹ÀtY3I>M7cifGš¾‰†Ù‰Jã>“jòŠù…¾’9ÿ²žˆ>ƒe¦ÈÆ¿>eð Ћc¾‹ß6­ÌO>“†Ã9×ö¾‘=„÷r>€;)bS>qkj{¢´Æ¾àk3Jýa>“yAÜó ¾¾+¾*ã¬>y‘Õ;#¤Ç>wžR„€¸Ü¾hgR»b>“F©Èd美·Œ4ÚH>s#š+òYò>}Tzý]n\¾túê9-;>’ó9ÔÞ8E¾‹±‚¿-J¥>iÏ\1$ä1>E{8ó¾ýLwÛ-2>’ƒ7ì2þ¾‰B$b>[¦uL|@j>ƒ ›,üÕ¾‘b?J~W>‘úÓ=N來ËÈ¥!]>3(–Ò—+>…¼J_AWR¾‘¦’u°×>‘^ ‡V|p¾„T—6´+>¾PÙZ”T>‡™ïÎö ø¾‘Í&ªÁ3>°·{ü/ß¾ãfº°µ†¾b—oÝåÿ\>‰;·d_' ¾‘Øù,eÿ>ìólSv‰¾~ûŠ¾q•E¾lu¹-0Q>Š¤Zñк6¾‘ÌþÏ71h>ŽeLZD´‚¾zPä¶í¦¾roâ£þ¸>‹Öî­b¨9¾‘¬#›EË>ŒÐ¯*¾uÎü¼^þv|+!y¨>ŒÖï§C?`¾‘yKGÊ5>‹4Äõù42¾q|WG¾z/Æ>¨Ų´¾‘72\êrU>‰–‘`&˜ ¾j¼GI¼FF¾}‹ÂNÄ[>ŽN'¨9tà¾ètH/Û >‡ú ”wy@¾bñ Å ’:¾€IŸ^ ª>ŽÍú”æ½¾WDh>†dôuÚ$?ÄìØ P?¿±}ô &ç?œq .Š¿{½N]ýó¿k‰¢ûä ?{:»ºœ¿wƒõ``Q"?hûd?\²Ù¿.ÃuÓë|¿[/†nYè?b”ß¡m¿]3%³ë?Gf÷ Tòq?7«.˜üY¿Pº gc:p?R Rz:a¿G]½œgR?Øâ?ÌÚÖ?;Éê1S8Y¿F" hÞªú?C‹ß$k¬%¿2GLL"@¿Q«K^#?9b$X¡œ¿=¼Õºëp·?5ª› ª¿+ßä’p¿'@¤Š £?4¡ò¶j­™¿3’©¼’ä?$ZW¢¤ùb?ê3.ðg¿),çùýå?0 ü,¢C¿(OyW²~e? ÿ¹æqt?Òwï}å¿'sÚûV*?'“ðöšŸî¿¹-Öb'Ú¾ëß²n+¯?Zyòç.u¿#ük”Ša,? 2yGeê¿sÃ)0:‰¿ ÙpTÌŽ?É»õ/w¿“ËÔb l?FXBmåH>­¨6¼§.¿¨l$±?l $¿ìŽ(–`0?Ä¢¸ÛúË?/Ý‹´Z—¿Iº®0?¢ í™V™¿ †ù:)›±>Ëe¾¯Hß? N´hpê¿vbémC?LºR€<ˆ¾þDºîrÓ\¾óÀÚòÅŸã? øÛ1âQ¿AßN;É?‘¬ß{Ç©¾ÙÅExuT¿fÕc<è? » 2â¿ !{’}¾>úM½Ì’ÿ}>çÎãiÒH¨¿_å–d92? kñдB}¿a†ÉÖ>à܇ÚJ>ø¶›Ûï=¿b"tª?ârCXZ¾÷3å­ ”ê¾Û`µ é5?$¡¦Á· ¿ C©×¤?KvF-œH¾áÁ7$Öâ…¾ñ½ÑjùÎ ?™Rj½'‘¿  [ˆ>ô´!è”ÂJ>Ê`~"­4h¾øÈ’Í^}ó?¥Œ)ŒÛ¾ûÞ˜EO{ >âƒdÄë`¹>逕¸ÕËx¾üð&'Z>þ9jH÷Û¾ò£ìP.ƾ«ñŽÁT­Ö>ó:b }I_¾ü6´º„k >ø&‡ÉÂá¾â»ãÑÐßľâ'lÁ¼>ö¾ Út;¾ù§Öut¯>ðæûÓ¿“ľ«9Ó\–3¾î¯–Ô >÷‡ïÿ'ôx¾õ%™( é>âŸØ«Ó&ù>Ù<è#°iѾò‹ò«ÁÆ>öaôù¾îÓƒã…Ë>ÀÁtøíTÙ>çs{ÀJ¾óËâDó¥l>ò«L˜$¾âOæUZ²¾Ð¾6\9<>îkoÕ²Ù¾ó1s‚ÏC>ì<‘“* ¾ÇýÌîIqY¾âBEíflÚ>ðÂòpOʾð—'Ë¢Øë>áÜâÿ@>Ä?üìÆ“/¾é <;„ý>ð‰¿K¿ã¾éô§´} ó>ÍC¤«ÔÞa>Ü-@ŽjAˆ¾ì‚ƒ2’x*>í¢‚’«S=¾áU±‹¦¯}¾³Ÿëΰõ{>ä“ïé“Ém¾ì劼†/>çìjý¶‰M¾ÐŠÿ©³»Œ¾Õc®Œ>èOyýhÞ¹¾ê‘ÔÏО>àÁ:ʉç0>ˆ Û%@.I¾àâ‘FlJ>éS#Ê4©¾æKïܺ>Ñè+G£lÑ>ϘÌëãB¾ä¿ÁÐyE>çãQÿ¬RL¾à$²Äj>¤ ”˜3#…>ÛŽ.½z¢¾æ=?j g>än˜À{ñE¾ÒÙ×ÿý ¾ÆOÕxhúÙ>á²ú^iU¾å„'hÙl>ß{¢=˜N¾µ w@¾ÖFtøþwq>ãŠçMp]¾âèªËn >Ów‘ÔVgÚ>½ZA™?_¾ÞË ˆ^>ãeëžïµ9¾Ý¼{ôÀ>½®ÌE˜6ê>ÑÀbÔ•õ ¾á*0–³#>á€Qe"ݾÓÒš‘8澯úñ{•më>Ù}Q$<þm¾á}j !f•>Üo5'ÎPò¾ÂR*îÉåܾ˲Kþì$>Þí ¼ù¾à1£Ôã*;>Ó÷Ì[V7÷>“­:ÒƾÕn4;{e>߃ªydL§¾Û ­Œ$K>Å!æçNÊ>Äë·©{˜7¾ÚPWì×Ù>Ýð;gw%×¾ÓðÊ^Qæ\>‘áR!Æ›¹>ÑÖhaÏÓ¤¾ÜXYNF<ñ>ÙÑYyCâT¾ÇOÉ*Ž¾¾nD>Öæ"p­£¾Û¡Ë¸AÊ>ÓÄ늸[¾¨áro¥¾ÍG¾BÀ >Ùm°Qi°&¾Ø¿òPÅ>Éh‡’;>³®'C80²¾ÓÍh´gX>ÙrãˆÎoQ¾ÓyÊÞ“2Å>³2Ò³–C·>Çš5´´¾Öº§f@]%>×2}]¶—¾ÊQ^Â\ž`¾¥6¦ uf->Ðû×^‚о×_T­îQ>ÓÄ©›Mè„Aµæ¾ÂnÁÜgý>Ô7÷ãþ9¾Õâî ;à>Ë>¥§ßn>…³q ¾ÌËó{€FÑ>Õc°ùê"£¾Ò–=ƒjl—>½³:¨=Ð>» sAܾÑ߶+ôfõ>Ô’ínCñŽ¾ËÙbNS>‘jp?näs>È(Ejqm¾Ó},«K|>Òë¾ÀÖèÅ)Ͼ³Nœ÷“Œg>ÏZFôFM¶¾ÓC`'ȱ>Ì*±Ûîû¾¤ôÖ`G q¾Ã±K—ùD>Ñ©„®ϾÑ^øÞÇ>ÂvïPUêY>§œýuüê~¾Ë8Ïÿᡆ>ÑóÖq#óŸ¾Ì9ÜÏH¿Y>¯£^²'°Š>¿VCim¾ÏÍäÌzØ>Щ2—ų¾ÃÂy®[Á¾”3qÝ>ÇTõš1W¾Ð¤bŽrþ>Ì á‡Z¯¾´rwk¢¾·ê$àÖ–š>Ìh-Nˆ‹¾ÏÈ< tð]>ÄÀ©ºÜm1¾pbglW¾Ã©í™™Î>ΪP)È‹s¾Ë¨»(Xå|>¸iÍ»½3X>±Ðs^ÂѾÉé&à T>Î"&ó1í7¾Åwep#Å>™Úxkn7>À4fäâð¾Ì ÕËCij>Ë¥R›q¾»Ä§\4D¾¥ˆ7ã4ú>ÅóÊ-tà¾Ìb•'êžu>ÅëŒWwdm¾¦%ÇÙ¤¾¹á«òŽ`>ÉqÝ°¾ÊKL7 >¾‹Ìë–{–>“çøgŸ³¾Âã"|k¬,>Ê‹ã4zðR¾Æ!Cê¡aŠ>¯+*sÌ‚0>³¼¢‘®–¾ÆØ"2[ ¼>ÉXú&=XÕ¾Àcœjk©ñ>TjŸä‚>¿Û¯Ý­¢¾È bŽ’Œ>Æ…Û«¾³QëIÁ¾«íé3ë²ä>ÄCR•äPϾÈ=¼55n>Á>¤¹c¾”ŠôbËô¾º(²É> ¡>Æ¢€f&©¾Åß7ûXi™>¶ˆ:ß&ñ›>¡ªxŸA¾Á´\R«íw>Æü¢ß&é¾ÁÙ³U$rØ>¢õÃ_óÀ>´¯)툑“¾Ä”Å’2\i>Åm†êØÂx¾¹<,þÚkܾŒ<&„ +º>¾Z‰øC“ª¾Å˜7>{gt>Â7,3 ¾ª¸0‚lcÒ¾®ã¹!ŸÀÅ>ÂyùfnB¾ÄÉÑYßø>»p¡Ôþ³4¾r n´éw¾¹`é"jÅ>Äß° ¾ÂY5#so+>°Æ¡LP¶>¤èÒŠ|¯¾ÀU.\±Õ>Ãö×oÚ;½'ñÜkXG>•›t­Ò–µ>´N•‘¾Âr¨þј>ÂAå醷¾³ºjŽ9-À¾–ì½·åR>¼Rû´ëˆª¾Â÷ytˆ3>¾d*[{m+¾¢v>´±¾¯ƒå¿_¥]>À·ú‹-™Ê¾ÁóRS»h>¶6ñÂá4²>t³m³1a ¾·õæË0Ï>ÁξÜÛVž¿'Htûi‘>©ƒj~ˆ˜>¦S`Êh¦¾½Ï¯;Í*>Áo¼nY0¾¸;”ÄTQa>†¯j5œr>³™¾™_â¾ÀûK„_<>¿sqî`I¾¯Ÿ­†­`À¾›2—è¶Ö>º ß™n};¾À¹—ëØìÒ>¹Ç­ðdc2¾šˆùÕ¹ î¾®±Y04\>¾§ Ã௾¿K-" µû>²o\õ&í>„hkûŸ´Ó¾¶,&ê=5>¿§hÀGᾺÚåý;&%>¤&ôÐæ>¦Y©÷„0¾ºþ¶ôÝ££>¾±—oR)&¾´œÖÚ¯>vlj¡Y¸>²<¤²Gõ?¾½‚‰CcòŸ>»uSúÂȾªFˆt_>ò¾›ªÃ»Ò >·¬,ÿùÙ¾½ª™ÍUœ@>¶S¤éG³c¾”Jcè|!¾¬Ä??Üê>» gOǾ»—Ë‚»[¼>¯–µw¦t>‡—Í÷¾´0 Ñ}d>¼;ˆ¾·“0ù8> Û¥—‡>¤¬qZ¨¶¾¸LP™îy>»DÉçξ²Ì#{Ñú>j/¯1È>°•“ÔKE꾺i0ß;)>¸Xõu‘ƒ¾¦Ý [Á¹"¾™Û\Pd>µM?QZÔ¾º|ò}>³Í6mŽ’쾑]{+ü/¶¾©Ñ}T ö>¸¬Ä®Îð >…ª;¤KÍ;²Ô!(M>¹FÊ+ªsO¾µ )½Ž˜>žMŒêf.>¢mxåO.Û¾µ½@GgvÙ>¸u`EVµW¾°@x¦ÙpZ>lÇQÀïÔ>­|í¾^1x¾·§iÜ«">µñÓ#¿Í¾¤óÇËrÜž¾–6•z£mx>²öŸ†Ø»¾·Î¥_~M>²ã"U ¾ù{š3À¾¦‘¨Ž++Ÿ>µ¦`¼Iøª¾¶Iƒ U˜>ª¾„‚Ûß>Äêé· $¾¯éY°¤>¶³ßŒ§v¾³Jè•eD>U5avþ>ŸŒ¸Æþ¾³M-J}‘Ù>¶#¾÷´R¾®9V\²ƒ>vÝ2î&…>©‰g®<Ôÿ¾µ*ì:Y>´¼j—b¾¤0µ$º€ñ¾‘.«ûФ>°§@ößŦ¾µ‚)¥TÀY>°ÅnË‹f¾’„¨òö¢¾¢í?β.>³;çê,œÊ¾´bmÚ­è>¨õvº»š.>l¤´ù X¾«„Am(ê!>´h«xÔ+ï¾±ójñt—>ž6,æÎÜa>˜lŸç°ñ¾°ñ>/G$²>´--²¸e¾¬áNÈ£~ð>‚Ðô^|p>¥Z’"…ß¾²Ý°x¨ó*>² â=¥8%¾¤H1¯‹¢ß¾†#±ø&Ì>¬¯¥æ±ôľ³xºJ¼Ø>¯ß›ï/Xu¾•§k ¾è›¨ÍB>°ê[ø¯¾²Ê{5™)>¨¬{(Ÿd¾^“þE7÷¶¾¦ýßV3º>²Iš=úê¾°ïÐÜÜK> 7`n ï>ï9lÑLY¾­5Q’g˜>²o¤,[¾¬-ðšH² >Œkum%> ðÀjä…¾°§tQ…ÅA>±jÅ!i4Ž¾¤öÉÈäß¾plFü>§úëà<ྱ’ßìûl>®¶iF³'‘¾™„C¡Æ¾•^9­lïé>­:R“ûÔã¾±]²N˜>¨ß…8ɾ€|¾–ÊX?¾¢Hæž9­w>°:0𓾰tús”'>¡Ã¿ÕîÞb>“ëeñ¾¨rme•ª>°É ÷-+ ¾«Ö&@û»è>“ÅdÖ¡_>˜Öçaº,¾¬Þ‰ƒ6Z>°OWZ¡ ]¾¥û]1«{>kÿ2Ý­<>£_Nð#¾¯b)éF˜á>­Ä•˜¾ž#®/Œlɾˆ”àƒ9Ò_>¨YѯL^¾¯ðr±C_>©Huc›€¾Ž@½û9O¾š²0Û'‘Ä>¬<‰4l«q¾®›U~>9,>£ƒ_Ô‘{>!¦ŽåÞÅm¾£y˜Ï «>®/QàAѾ«ð4Ǧ>™¸c•T¿>„%ŠX|h¾¨:Ï‹‹\>®S\‡D±¾§Ý›?S§>†þ£“«¼»>›îþ\ú5¾«i»" UD>¬½Æo‰l"¾¡u³àͻξfH¢¿üZ,>£lJ¹•£¾¬ímeM>©f;«Äì¾–5ëü°XŽ¾S¯™‰•$>§·ßI­ ™¾¬ÆšÁ—y*>¥2ÿ;—%ï3Ѿœjž‚»|á>ªv±z¤õ¾« žÙ!Z>Ÿ›··ä >r7ÎßZ+¾£;ö§Ö Ç>«©-ªôÄ~¾§ïhz>Ÿ>“Œ'!!Ó>‘H×þXü¾§ПÞœ>«Srú*¯¾£©Œï—~6>{·ùtÑ€>œC¯ï_Ú<¾©o‘u̵v>©Ž~À·š¾ 'ìä.ø¾v0C‡<²£>¢½ ›¿Tྪjï0_.T>¦…D%Ìj ¾‘¨R S0s¾‘<‡ œZ´>¦/ÿ‚€ØT¾©ýÞìNS>¢qd×¾wB[~yʆ¾›“ZIŽ >¨\‰¯ÊM€¾¨@ÈúÙº>›*ñGñ#Ê>wj•/ûh|¾¢ )*¿nï>©7Q³´ê¾¥[Íp6¶s>wÆ÷DEÞ>Äé&›¾¥>7°<­>¨ÆéŸÙÖ¾¡ƒ‡çEfž>u{Ôˆ4ê¹>škÕ;iˆ¾§BH-hР>§"0Èð¹D¾™ê詾·à¾v7:=‹+>¡3®ùm³B¾¨ºnç¤mã‡Rd1¾ÐJRx{¾ô Õ~‹>¤5¥MƒS¾§¬ÏùgÑ0> Ù«ö­·¾vÄÁ>˾˜Ü[ ¤¤ü>¦"mËŠ±¾¦..ðÆqÚ>™9üB†9>rÚÓ^d'¾ 5I*wÞ>¦òËÄbß¾£´Êq “x>Îüʧ >Œ¬m– ‘¾£ŠÁÓ_>¦«q»H4¾ kD˜Ì'{>x×òy—†>–î_Ò…j¾¤ûûì>¥^U'­nò¾™SÍÅB,¾kĪRÛ>ž(œê¥2¿¾¥ÜÈ1ÃÔê>£(a#ëy¾d07%¯ ¾ˆñ|ö}ê¹>¡â›Üá¾¥¼¡Xáý=> //˜DMž¾}vÍôÖ¾”¨­A6>£ËÀ±‹RŽ¾¤ª‡[æà˜>™=/›jœv>Z%öÉ–Ï ¾›¢f?u£Ê>¤ÇïryæV¾¢¿9âÌP>‘L|êPW¹>„qMIÖoо •½ÒŠ>¤Øq-Ӵ̾ Z. ºx>ÜiD ´Í>’ ù‹K¾¢Œ¿|®€…>¤ $ãéý`¾™Ê‰è5~>@IV;R6 >˜Ö‹©¿î¾£¬ÓO„3 >¢nŸä ?*¾’åÂÖ¶¾~tË8×£>žZE¿ß^¾£õfñeAž> $£^¿©¾…¯‹ëìDU¾Ž?&,u©°>¡8¢ |ìþ¾£o%Û:/~>š˜•§r}ö¾gñÂ6Ü-¾•À¢‚µ ‚ˆ¾¢*Àûœ >”`D-x>r¶5@­ ¾›HlË ‘>£¿\4ȵ¾ >­¸3ƒ>ŠœZóŽ>‡Â˜›O&¾Ÿgn¾ê>¢Ð<]®¡)¾›!vE„«>w÷)¾E’>’]òƒÌ¾¡?í§CžÚ>¡åºÑFó¾•Éw½—º¾W"8[yª]>—ìƒtúRf¾¢º—ô> [ºè/È]¾ŽÞcQ”??¾€ªÉCQ7–>œgí¿G‰‰¾¢ª‹øw>œ’þMœ~5¾ˆîìú°¾Teæ>Ÿ´æn+8r¾¡‘‰9ag>—“gµëؾ`N£#TE€¾”=ünt_Å> ã nÑM‚¾ lAq"i>‘ò+ObWÌ>r`3¨Ð¾˜é½8º>¡MAF6#a¾… à¯>‡Ôí^êr>…N÷ Ë)¾œ‘¤vr>¡Tçz…Ž¾™TV_°ÑE>vÛ s\ª>7UÂ88¾Ÿ"ÑàV¹> `ð溾”v6óZ€í¾• aÂOkµ¾ Lj; >žDC£Í þŽ<¢ÌøѾyjvó|&>™ëJMz¾ {Ã~ØW>šéÒr†Àó¾‚þnÍg¾‡¯ìqÏr>œ Úíf°ù¾ %¶QuU$>–ÙÁ×TÛ¾nW¾ñe:]¾Ã6ÔNüb>ž|ûë侞©v¢-®w>’>ú€MÓ>\ú:'7}¾”ýÖv|F—>Ÿ2òbÊE꾜,¾Š„¦>Š‹BYG†>|šî˜I¾˜qHs €>ŸS‹\õ8 ¾˜õA^coé>€2Ñnfœy>ˆ)Ô[PŒ¾› øîU>žŒ½äYë`¾•&<ÐÁ—T>g þ¥~+h>|X œ¾œÐFß;ª5>œñù{—„k¾äÉG×o¾a›üºœ>”CíÍÑMu¾µQ8ÓŽJ>š›ãìm¾ˆ­ izϨ¾|)nÃÞÝ>—ZØjÎ ¾Å €àèU>—¥iõ5L¾~ÒʤԾ‡¹´múˆ>™µðÊÃá¾ ö O>”-¿ N‚¾g(N"p¾kÞTt%>›P}“B™¾››8U¹V>T ”@l”>[®Ù×By¾’÷µƒ>œ+M!ÆÛ¾™‡ÈK W>ˆo੃U>xŠÚ€$D^¾•ÓJdÌ ¦>œMš?Ù¡¾–éD  Þ>੃†ÙS>„rÛ–âÚ¾˜ «K–$I>›Á)’-^.¾“Ù ÕÛÊ*>m-ÐHÔ½>‹Ô¼Òzmÿ¾™ ry >š”Á´›¾qa˜7y¾@d`¹>>‘%MÂq탾šŽŠ¸ƒçZ>˜Ù½y‡'¾‰™kš#¾r7fk+Z>“ÞkíÉý¾šÝõdÕí>–£žáâ]'¾‚ÓÜ)¾€“ØAöí>–%”3??€¾t¿Fƒu‹±¾‡wmõÌ=G>—°þœ\¾™¿d¡h²?>‘[êŒk¾Vh3í„:V¾š?ÜËÒ>˜Ç2)Ц'¾˜lÂX½Ÿ2>‹ãXý¸>bµ~iо‘sÓ Þ >™T:IÏ+¾–«Æ{Òí>…EŒîÆZŸ>vø4»W^†¾“¨æÄ“®0>™^yµwÆ9¾”1¾Æ>}‹ü{…>ñé"ÔW¾•h·skôá>˜îµ`~š7¾’"JjçL>oÇîžwÚ>‡ÑUWJ‚é¾–²‰&óI>˜ŠõÚbI¾ŽøÕÍá^G>B#;×u>Ï;5/û¾—ˆFua.T>–ÍJ[1®¾‰Y=½¥«¾dÿûM °K>Ä"Oµsñ¾—î4ŒˆO'>•4XU½ö¾ƒ†QÆJ¼Q¾vëïÙ>’¥]§ò…þ¾—ê}  ý¿>“RïYtœ.¾{= Fàž¾€â<¥>”%ê¥(×¾—„ÜôGˆ>‘6œpB4)¾n÷^&Àxì¾…ýLo+ ƒ>•FE½êâ\¾–ÆTÕ¢ >Ùô.z©¾OÔe~…„쾊 ½?­:>–É’ß9 ¾•¸´Lfü%>‰>Axbž>\j”Q¾Žˆ±o †‰>–q[붥b¾”fZ.:ð>„ ös ”>qž‡¿4M!¾õ£‰˜!ê>–…@ä8¾’Ùï™g >}þd²µ>:>{rs¡G’ܾ’Y«¤Ÿ¿n>–JÉE­‹Œ¾‘M2á>sï³æ‰´Ü>‚?ª@3­¾“q*ßóS>•É‡8.¾Žz'.ÑÜ%>dŸù‡=>†WØ;”?·¾”>+?åF7>•’ãYÆ ¾Šö§/Bž>x³P`n6>‰ýS¼*)d¾”ÃÞÞFæ>”o@A=`¾†f>”f4¾aQúÖùlá>,(wC)¾•S¬áôÁ>’埀$¤‡¾‚8L#X¾qN`‚|ã„>ãC…ÿÁÛ¾• OQͧ‚>‘•'ó(+Õ¾|Ý/¹E?¾y`ãªjc>‘æû£¤Z¾”Õ+LAH>$Öxjù¹¾sÆU‹Ñ5¾€h=âˆ^>‘øfM“¾”làs8¡>8+¤®Äè¾gY6©{¾ƒË wÀ·È>’§^;˜ùþ¾“Ö^}Þc>ŠÚæ[Œa¾N¼êýǦ¾†Õ˜X}61>“!½h³¾“\¨Šæ>†¹ÀtY3I>M7cifGš¾‰†Ù‰Jã>“jòŠù…¾’9ÿ²žˆ>ƒe¦ÈÆ¿>eð Ћc¾‹ß6­ÌO>“†Ã9×ö¾‘=„÷r>€;)bS>qkj{¢´Æ¾àk3Jýa>“yAÜó ¾¾+¾*ã¬>y‘Õ;#¤Ç>wžR„€¸Ü¾hgR»b>“F©Èd美·Œ4ÚH>s#š+òYò>}Tzý]n\¾túê9-;>’ó9ÔÞ8E¾‹±‚¿-J¥>iÏ\1$ä1>E{8ó¾ýLwÛ-2>’ƒ7ì2þ¾‰B$b>[¦uL|@j>ƒ ›,üÕ¾‘b?J~W>‘úÓ=N來ËÈ¥!]>3(–Ò—+>…¼J_AWR¾‘¦’u°×>‘^ ‡V|p¾„T—6´+>¾PÙZ”T>‡™ïÎö ø¾‘Í&ªÁ3>°·{ü/ß¾ãfº°µ†¾b—oÝåÿ\>‰;·d_' ¾‘Øù,eÿ>ìólSv‰¾~ûŠ¾q•E¾lu¹-0Q>Š¤Zñк6¾‘ÌþÏ71h>ŽeLZD´‚¾zPä¶í¦¾roâ£þ¸>‹Öî­b¨9¾‘¬#›EË>ŒÐ¯*¾uÎü¼^þv|+!y¨>ŒÖï§C?`¾‘yKGÊ5>‹4Äõù42¾q|WG¾z/Æ>¨Ų´¾‘72\êrU>‰–‘`&˜ ¾j¼GI¼FF¾}‹ÂNÄ[>ŽN'¨9tà¾ètH/Û >‡ú ”wy@¾bñ Å ’:¾€IŸ^ ª>ŽÍú”æ½¾WDh>†dôuÚ$?ÄìØ P?¿±}ô &ç?œq .Š¿{½N]ýó¿k‰¢ûä ?{:»ºœ¿wƒõ``Q"?hûd?\²Ù¿.ÃuÓë|¿[/†nYè?b”ß¡m¿]3%³ë?Gf÷ Tòq?7«.˜üY¿Pº gc:p?R Rz:a¿G]½œgR?Øâ?ÌÚÖ?;Éê1S8Y¿F" hÞªú?C‹ß$k¬%¿2GLL"@¿Q«K^#?9b$X¡œ¿=¼Õºëp·?5ª› ª¿+ßä’p¿'@¤Š £?4¡ò¶j­™¿3’©¼’ä?$ZW¢¤ùb?ê3.ðg¿),çùýå?0 ü,¢C¿(OyW²~e? ÿ¹æqt?Òwï}å¿'sÚûV*?'“ðöšŸî¿¹-Öb'Ú¾ëß²n+¯?Zyòç.u¿#ük”Ša,? 2yGeê¿sÃ)0:‰¿ ÙpTÌŽ?É»õ/w¿“ËÔb l?FXBmåH>­¨6¼§.¿¨l$±?l $¿ìŽ(–`0?Ä¢¸ÛúË?/Ý‹´Z—¿Iº®0?¢ í™V™¿ †ù:)›±>Ëe¾¯Hß? N´hpê¿vbémC?LºR€<ˆ¾þDºîrÓ\¾óÀÚòÅŸã? øÛ1âQ¿AßN;É?‘¬ß{Ç©¾ÙÅExuT¿fÕc<è? » 2â¿ !{’}¾>úM½Ì’ÿ}>çÎãiÒH¨¿_å–d92? kñдB}¿a†ÉÖ>à܇ÚJ>ø¶›Ûï=¿b"tª?ârCXZ¾÷3å­ ”ê¾Û`µ é5?$¡¦Á· ¿ C©×¤?KvF-œH¾áÁ7$Öâ…¾ñ½ÑjùÎ ?™Rj½'‘¿  [ˆ>ô´!è”ÂJ>Ê`~"­4h¾øÈ’Í^}ó?¥Œ)ŒÛ¾ûÞ˜EO{ >âƒdÄë`¹>逕¸ÕËx¾üð&'Z>þ9jH÷Û¾ò£ìP.ƾ«ñŽÁT­Ö>ó:b }I_¾ü6´º„k >ø&‡ÉÂá¾â»ãÑÐßľâ'lÁ¼>ö¾ Út;¾ù§Öut¯>ðæûÓ¿“ľ«9Ó\–3¾î¯–Ô >÷‡ïÿ'ôx¾õ%™( é>âŸØ«Ó&ù>Ù<è#°iѾò‹ò«ÁÆ>öaôù¾îÓƒã…Ë>ÀÁtøíTÙ>çs{ÀJ¾óËâDó¥l>ò«L˜$¾âOæUZ²¾Ð¾6\9<>îkoÕ²Ù¾ó1s‚ÏC>ì<‘“* ¾ÇýÌîIqY¾âBEíflÚ>ðÂòpOʾð—'Ë¢Øë>áÜâÿ@>Ä?üìÆ“/¾é <;„ý>ð‰¿K¿ã¾éô§´} ó>ÍC¤«ÔÞa>Ü-@ŽjAˆ¾ì‚ƒ2’x*>í¢‚’«S=¾áU±‹¦¯}¾³Ÿëΰõ{>ä“ïé“Ém¾ì劼†/>çìjý¶‰M¾ÐŠÿ©³»Œ¾Õc®Œ>èOyýhÞ¹¾ê‘ÔÏО>àÁ:ʉç0>ˆ Û%@.I¾àâ‘FlJ>éS#Ê4©¾æKïܺ>Ñè+G£lÑ>ϘÌëãB¾ä¿ÁÐyE>çãQÿ¬RL¾à$²Äj>¤ ”˜3#…>ÛŽ.½z¢¾æ=?j g>än˜À{ñE¾ÒÙ×ÿý ¾ÆOÕxhúÙ>á²ú^iU¾å„'hÙl>ß{¢=˜N¾µ w@¾ÖFtøþwq>ãŠçMp]¾âèªËn >Ów‘ÔVgÚ>½ZA™?_¾ÞË ˆ^>ãeëžïµ9¾Ý¼{ôÀ>½®ÌE˜6ê>ÑÀbÔ•õ ¾á*0–³#>á€Qe"ݾÓÒš‘8澯úñ{•më>Ù}Q$<þm¾á}j !f•>Üo5'ÎPò¾ÂR*îÉåܾ˲Kþì$>Þí ¼ù¾à1£Ôã*;>Ó÷Ì[V7÷>“­:ÒƾÕn4;{e>߃ªydL§¾Û ­Œ$K>Å!æçNÊ>Äë·©{˜7¾ÚPWì×Ù>Ýð;gw%×¾ÓðÊ^Qæ\>‘áR!Æ›¹>ÑÖhaÏÓ¤¾ÜXYNF<ñ>ÙÑYyCâT¾ÇOÉ*Ž¾¾nD>Öæ"p­£¾Û¡Ë¸AÊ>ÓÄ늸[¾¨áro¥¾ÍG¾BÀ >Ùm°Qi°&¾Ø¿òPÅ>Éh‡’;>³®'C80²¾ÓÍh´gX>ÙrãˆÎoQ¾ÓyÊÞ“2Å>³2Ò³–C·>Çš5´´¾Öº§f@]%>×2}]¶—¾ÊQ^Â\ž`¾¥6¦ uf->Ðû×^‚о×_T­îQ>ÓÄ©›Mè„Aµæ¾ÂnÁÜgý>Ô7÷ãþ9¾Õâî ;à>Ë>¥§ßn>…³q ¾ÌËó{€FÑ>Õc°ùê"£¾Ò–=ƒjl—>½³:¨=Ð>» sAܾÑ߶+ôfõ>Ô’ínCñŽ¾ËÙbNS>‘jp?näs>È(Ejqm¾Ó},«K|>Òë¾ÀÖèÅ)Ͼ³Nœ÷“Œg>ÏZFôFM¶¾ÓC`'ȱ>Ì*±Ûîû¾¤ôÖ`G q¾Ã±K—ùD>Ñ©„®ϾÑ^øÞÇ>ÂvïPUêY>§œýuüê~¾Ë8Ïÿᡆ>ÑóÖq#óŸ¾Ì9ÜÏH¿Y>¯£^²'°Š>¿VCim¾ÏÍäÌzØ>Щ2—ų¾ÃÂy®[Á¾”3qÝ>ÇTõš1W¾Ð¤bŽrþ>Ì á‡Z¯¾´rwk¢¾·ê$àÖ–š>Ìh-Nˆ‹¾ÏÈ< tð]>ÄÀ©ºÜm1¾pbglW¾Ã©í™™Î>ΪP)È‹s¾Ë¨»(Xå|>¸iÍ»½3X>±Ðs^ÂѾÉé&à T>Î"&ó1í7¾Åwep#Å>™Úxkn7>À4fäâð¾Ì ÕËCij>Ë¥R›q¾»Ä§\4D¾¥ˆ7ã4ú>ÅóÊ-tà¾Ìb•'êžu>ÅëŒWwdm¾¦%ÇÙ¤¾¹á«òŽ`>ÉqÝ°¾ÊKL7 >¾‹Ìë–{–>“çøgŸ³¾Âã"|k¬,>Ê‹ã4zðR¾Æ!Cê¡aŠ>¯+*sÌ‚0>³¼¢‘®–¾ÆØ"2[ ¼>ÉXú&=XÕ¾Àcœjk©ñ>TjŸä‚>¿Û¯Ý­¢¾È bŽ’Œ>Æ…Û«¾³QëIÁ¾«íé3ë²ä>ÄCR•äPϾÈ=¼55n>Á>¤¹c¾”ŠôbËô¾º(²É> ¡>Æ¢€f&©¾Åß7ûXi™>¶ˆ:ß&ñ›>¡ªxŸA¾Á´\R«íw>Æü¢ß&é¾ÁÙ³U$rØ>¢õÃ_óÀ>´¯)툑“¾Ä”Å’2\i>Åm†êØÂx¾¹<,þÚkܾŒ<&„ +º>¾Z‰øC“ª¾Å˜7>{gt>Â7,3 ¾ª¸0‚lcÒ¾®ã¹!ŸÀÅ>ÂyùfnB¾ÄÉÑYßø>»p¡Ôþ³4¾r n´éw¾¹`é"jÅ>Äß° ¾ÂY5#so+>°Æ¡LP¶>¤èÒŠ|¯¾ÀU.\±Õ>Ãö×oÚ;½'ñÜkXG>•›t­Ò–µ>´N•‘¾Âr¨þј>ÂAå醷¾³ºjŽ9-À¾–ì½·åR>¼Rû´ëˆª¾Â÷ytˆ3>¾d*[{m+¾¢v>´±¾¯ƒå¿_¥]>À·ú‹-™Ê¾ÁóRS»h>¶6ñÂá4²>t³m³1a ¾·õæË0Ï>ÁξÜÛVž¿'Htûi‘>©ƒj~ˆ˜>¦S`Êh¦¾½Ï¯;Í*>Áo¼nY0¾¸;”ÄTQa>†¯j5œr>³™¾™_â¾ÀûK„_<>¿sqî`I¾¯Ÿ­†­`À¾›2—è¶Ö>º ß™n};¾À¹—ëØìÒ>¹Ç­ðdc2¾šˆùÕ¹ î¾®±Y04\>¾§ Ã௾¿K-" µû>²o\õ&í>„hkûŸ´Ó¾¶,&ê=5>¿§hÀGᾺÚåý;&%>¤&ôÐæ>¦Y©÷„0¾ºþ¶ôÝ££>¾±—oR)&¾´œÖÚ¯>vlj¡Y¸>²<¤²Gõ?¾½‚‰CcòŸ>»uSúÂȾªFˆt_>ò¾›ªÃ»Ò >·¬,ÿùÙ¾½ª™ÍUœ@>¶S¤éG³c¾”Jcè|!¾¬Ä??Üê>» gOǾ»—Ë‚»[¼>¯–µw¦t>‡—Í÷¾´0 Ñ}d>¼;ˆ¾·“0ù8> Û¥—‡>¤¬qZ¨¶¾¸LP™îy>»DÉçξ²Ì#{Ñú>j/¯1È>°•“ÔKE꾺i0ß;)>¸Xõu‘ƒ¾¦Ý [Á¹"¾™Û\Pd>µM?QZÔ¾º|ò}>³Í6mŽ’쾑]{+ü/¶¾©Ñ}T ö>¸¬Ä®Îð >…ª;¤KÍ;²Ô!(M>¹FÊ+ªsO¾µ )½Ž˜>žMŒêf.>¢mxåO.Û¾µ½@GgvÙ>¸u`EVµW¾°@x¦ÙpZ>lÇQÀïÔ>­|í¾^1x¾·§iÜ«">µñÓ#¿Í¾¤óÇËrÜž¾–6•z£mx>²öŸ†Ø»¾·Î¥_~M>²ã"U ¾ù{š3À¾¦‘¨Ž++Ÿ>µ¦`¼Iøª¾¶Iƒ U˜>ª¾„‚Ûß>Äêé· $¾¯éY°¤>¶³ßŒ§v¾³Jè•eD>U5avþ>ŸŒ¸Æþ¾³M-J}‘Ù>¶#¾÷´R¾®9V\²ƒ>vÝ2î&…>©‰g®<Ôÿ¾µ*ì:Y>´¼j—b¾¤0µ$º€ñ¾‘.«ûФ>°§@ößŦ¾µ‚)¥TÀY>°ÅnË‹f¾’„¨òö¢¾¢í?β.>³;çê,œÊ¾´bmÚ­è>¨õvº»š.>l¤´ù X¾«„Am(ê!>´h«xÔ+ï¾±ójñt—>ž6,æÎÜa>˜lŸç°ñ¾°ñ>/G$²>´--²¸e¾¬áNÈ£~ð>‚Ðô^|p>¥Z’"…ß¾²Ý°x¨ó*>² â=¥8%¾¤H1¯‹¢ß¾†#±ø&Ì>¬¯¥æ±ôľ³xºJ¼Ø>¯ß›ï/Xu¾•§k ¾è›¨ÍB>°ê[ø¯¾²Ê{5™)>¨¬{(Ÿd¾^“þE7÷¶¾¦ýßV3º>²Iš=úê¾°ïÐÜÜK> 7`n ï>ï9lÑLY¾­5Q’g˜>²o¤,[¾¬-ðšH² >Œkum%> ðÀjä…¾°§tQ…ÅA>±jÅ!i4Ž¾¤öÉÈäß¾plFü>§úëà<ྱ’ßìûl>®¶iF³'‘¾™„C¡Æ¾•^9­lïé>­:R“ûÔã¾±]²N˜>¨ß…8ɾ€|¾–ÊX?¾¢Hæž9­w>°:0𓾰tús”'>¡Ã¿ÕîÞb>“ëeñ¾¨rme•ª>°É ÷-+ ¾«Ö&@û»è>“ÅdÖ¡_>˜Öçaº,¾¬Þ‰ƒ6Z>°OWZ¡ ]¾¥û]1«{>kÿ2Ý­<>£_Nð#¾¯b)éF˜á>­Ä•˜¾ž#®/Œlɾˆ”àƒ9Ò_>¨YѯL^¾¯ðr±C_>©Huc›€¾Ž@½û9O¾š²0Û'‘Ä>¬<‰4l«q¾®›U~>9,>£ƒ_Ô‘{>!¦ŽåÞÅm¾£y˜Ï «>®/QàAѾ«ð4Ǧ>™¸c•T¿>„%ŠX|h¾¨:Ï‹‹\>®S\‡D±¾§Ý›?S§>†þ£“«¼»>›îþ\ú5¾«i»" UD>¬½Æo‰l"¾¡u³àͻξfH¢¿üZ,>£lJ¹•£¾¬ímeM>©f;«Äì¾–5ëü°XŽ¾S¯™‰•$>§·ßI­ ™¾¬ÆšÁ—y*>¥2ÿ;—%ï3Ѿœjž‚»|á>ªv±z¤õ¾« žÙ!Z>Ÿ›··ä >r7ÎßZ+¾£;ö§Ö Ç>«©-ªôÄ~¾§ïhz>Ÿ>“Œ'!!Ó>‘H×þXü¾§ПÞœ>«Srú*¯¾£©Œï—~6>{·ùtÑ€>œC¯ï_Ú<¾©o‘u̵v>©Ž~À·š¾ 'ìä.ø¾v0C‡<²£>¢½ ›¿Tྪjï0_.T>¦…D%Ìj ¾‘¨R S0s¾‘<‡ œZ´>¦/ÿ‚€ØT¾©ýÞìNS>¢qd×¾wB[~yʆ¾›“ZIŽ >¨\‰¯ÊM€¾¨@ÈúÙº>›*ñGñ#Ê>wj•/ûh|¾¢ )*¿nï>©7Q³´ê¾¥[Íp6¶s>wÆ÷DEÞ>Äé&›¾¥>7°<­>¨ÆéŸÙÖ¾¡ƒ‡çEfž>u{Ôˆ4ê¹>škÕ;iˆ¾§BH-hР>§"0Èð¹D¾™ê詾·à¾v7:=‹+>¡3®ùm³B¾¨ºnç¤mã‡Rd1¾ÐJRx{¾ô Õ~‹>¤5¥MƒS¾§¬ÏùgÑ0> Ù«ö­·¾vÄÁ>˾˜Ü[ ¤¤ü>¦"mËŠ±¾¦..ðÆqÚ>™9üB†9>rÚÓ^d'¾ 5I*wÞ>¦òËÄbß¾£´Êq “x>Îüʧ >Œ¬m– ‘¾£ŠÁÓ_>¦«q»H4¾ kD˜Ì'{>x×òy—†>–î_Ò…j¾¤ûûì>¥^U'­nò¾™SÍÅB,¾kĪRÛ>ž(œê¥2¿¾¥ÜÈ1ÃÔê>£(a#ëy¾d07%¯ ¾ˆñ|ö}ê¹>¡â›Üá¾¥¼¡Xáý=> //˜DMž¾}vÍôÖ¾”¨­A6>£ËÀ±‹RŽ¾¤ª‡[æà˜>™=/›jœv>Z%öÉ–Ï ¾›¢f?u£Ê>¤ÇïryæV¾¢¿9âÌP>‘L|êPW¹>„qMIÖoо •½ÒŠ>¤Øq-Ӵ̾ Z. ºx>ÜiD ´Í>’ ù‹K¾¢Œ¿|®€…>¤ $ãéý`¾™Ê‰è5~>@IV;R6 >˜Ö‹©¿î¾£¬ÓO„3 >¢nŸä ?*¾’åÂÖ¶¾~tË8×£>žZE¿ß^¾£õfñeAž> $£^¿©¾…¯‹ëìDU¾Ž?&,u©°>¡8¢ |ìþ¾£o%Û:/~>š˜•§r}ö¾gñÂ6Ü-¾•À¢‚µ ‚ˆ¾¢*Àûœ >”`D-x>r¶5@­ ¾›HlË ‘>£¿\4ȵ¾ >­¸3ƒ>ŠœZóŽ>‡Â˜›O&¾Ÿgn¾ê>¢Ð<]®¡)¾›!vE„«>w÷)¾E’>’]òƒÌ¾¡?í§CžÚ>¡åºÑFó¾•Éw½—º¾W"8[yª]>—ìƒtúRf¾¢º—ô> [ºè/È]¾ŽÞcQ”??¾€ªÉCQ7–>œgí¿G‰‰¾¢ª‹øw>œ’þMœ~5¾ˆîìú°¾Teæ>Ÿ´æn+8r¾¡‘‰9ag>—“gµëؾ`N£#TE€¾”=ünt_Å> ã nÑM‚¾ lAq"i>‘ò+ObWÌ>r`3¨Ð¾˜é½8º>¡MAF6#a¾… à¯>‡Ôí^êr>…N÷ Ë)¾œ‘¤vr>¡Tçz…Ž¾™TV_°ÑE>vÛ s\ª>7UÂ88¾Ÿ"ÑàV¹> `ð溾”v6óZ€í¾• aÂOkµ¾ Lj; >žDC£Í þŽ<¢ÌøѾyjvó|&>™ëJMz¾ {Ã~ØW>šéÒr†Àó¾‚þnÍg¾‡¯ìqÏr>œ Úíf°ù¾ %¶QuU$>–ÙÁ×TÛ¾nW¾ñe:]¾Ã6ÔNüb>ž|ûë侞©v¢-®w>’>ú€MÓ>\ú:'7}¾”ýÖv|F—>Ÿ2òbÊE꾜,¾Š„¦>Š‹BYG†>|šî˜I¾˜qHs €>ŸS‹\õ8 ¾˜õA^coé>€2Ñnfœy>ˆ)Ô[PŒ¾› øîU>žŒ½äYë`¾•&<ÐÁ—T>g þ¥~+h>|X œ¾œÐFß;ª5>œñù{—„k¾äÉG×o¾a›üºœ>”CíÍÑMu¾µQ8ÓŽJ>š›ãìm¾ˆ­ izϨ¾|)nÃÞÝ>—ZØjÎ ¾Å €àèU>—¥iõ5L¾~ÒʤԾ‡¹´múˆ>™µðÊÃá¾ ö O>”-¿ N‚¾g(N"p¾kÞTt%>›P}“B™¾››8U¹V>T ”@l”>[®Ù×By¾’÷µƒ>œ+M!ÆÛ¾™‡ÈK W>ˆo੃U>xŠÚ€$D^¾•ÓJdÌ ¦>œMš?Ù¡¾–éD  Þ>੃†ÙS>„rÛ–âÚ¾˜ «K–$I>›Á)’-^.¾“Ù ÕÛÊ*>m-ÐHÔ½>‹Ô¼Òzmÿ¾™ ry >š”Á´›¾qa˜7y¾@d`¹>>‘%MÂq탾šŽŠ¸ƒçZ>˜Ù½y‡'¾‰™kš#¾r7fk+Z>“ÞkíÉý¾šÝõdÕí>–£žáâ]'¾‚ÓÜ)¾€“ØAöí>–%”3??€¾t¿Fƒu‹±¾‡wmõÌ=G>—°þœ\¾™¿d¡h²?>‘[êŒk¾Vh3í„:V¾š?ÜËÒ>˜Ç2)Ц'¾˜lÂX½Ÿ2>‹ãXý¸>bµ~iо‘sÓ Þ >™T:IÏ+¾–«Æ{Òí>…EŒîÆZŸ>vø4»W^†¾“¨æÄ“®0>™^yµwÆ9¾”1¾Æ>}‹ü{…>ñé"ÔW¾•h·skôá>˜îµ`~š7¾’"JjçL>oÇîžwÚ>‡ÑUWJ‚é¾–²‰&óI>˜ŠõÚbI¾ŽøÕÍá^G>B#;×u>Ï;5/û¾—ˆFua.T>–ÍJ[1®¾‰Y=½¥«¾dÿûM °K>Ä"Oµsñ¾—î4ŒˆO'>•4XU½ö¾ƒ†QÆJ¼Q¾vëïÙ>’¥]§ò…þ¾—ê}  ý¿>“RïYtœ.¾{= Fàž¾€â<¥>”%ê¥(×¾—„ÜôGˆ>‘6œpB4)¾n÷^&Àxì¾…ýLo+ ƒ>•FE½êâ\¾–ÆTÕ¢ >Ùô.z©¾OÔe~…„쾊 ½?­:>–É’ß9 ¾•¸´Lfü%>‰>Axbž>\j”Q¾Žˆ±o †‰>–q[붥b¾”fZ.:ð>„ ös ”>qž‡¿4M!¾õ£‰˜!ê>–…@ä8¾’Ùï™g >}þd²µ>:>{rs¡G’ܾ’Y«¤Ÿ¿n>–JÉE­‹Œ¾‘M2á>sï³æ‰´Ü>‚?ª@3­¾“q*ßóS>•É‡8.¾Žz'.ÑÜ%>dŸù‡=>†WØ;”?·¾”>+?åF7>•’ãYÆ ¾Šö§/Bž>x³P`n6>‰ýS¼*)d¾”ÃÞÞFæ>”o@A=`¾†f>”f4¾aQúÖùlá>,(wC)¾•S¬áôÁ>’埀$¤‡¾‚8L#X¾qN`‚|ã„>ãC…ÿÁÛ¾• OQͧ‚>‘•'ó(+Õ¾|Ý/¹E?¾y`ãªjc>‘æû£¤Z¾”Õ+LAH>$Öxjù¹¾sÆU‹Ñ5¾€h=âˆ^>‘øfM“¾”làs8¡>8+¤®Äè¾gY6©{¾ƒË wÀ·È>’§^;˜ùþ¾“Ö^}Þc>ŠÚæ[Œa¾N¼êýǦ¾†Õ˜X}61>“!½h³¾“\¨Šæ>†¹ÀtY3I>M7cifGš¾‰†Ù‰Jã>“jòŠù…¾’9ÿ²žˆ>ƒe¦ÈÆ¿>eð Ћc¾‹ß6­ÌO>“†Ã9×ö¾‘=„÷r>€;)bS>qkj{¢´Æ¾àk3Jýa>“yAÜó ¾¾+¾*ã¬>y‘Õ;#¤Ç>wžR„€¸Ü¾hgR»b>“F©Èd美·Œ4ÚH>s#š+òYò>}Tzý]n\¾túê9-;>’ó9ÔÞ8E¾‹±‚¿-J¥>iÏ\1$ä1>E{8ó¾ýLwÛ-2>’ƒ7ì2þ¾‰B$b>[¦uL|@j>ƒ ›,üÕ¾‘b?J~W>‘úÓ=N來ËÈ¥!]>3(–Ò—+>…¼J_AWR¾‘¦’u°×>‘^ ‡V|p¾„T—6´+>¾PÙZ”T>‡™ïÎö ø¾‘Í&ªÁ3>°·{ü/ß¾ãfº°µ†¾b—oÝåÿ\>‰;·d_' ¾‘Øù,eÿ>ìólSv‰¾~ûŠ¾q•E¾lu¹-0Q>Š¤Zñк6¾‘ÌþÏ71h>ŽeLZD´‚¾zPä¶í¦¾roâ£þ¸>‹Öî­b¨9¾‘¬#›EË>ŒÐ¯*¾uÎü¼^þv|+!y¨>ŒÖï§C?`¾‘yKGÊ5>‹4Äõù42¾q|WG¾z/Æ>¨Ų´¾‘72\êrU>‰–‘`&˜ ¾j¼GI¼FF¾}‹ÂNÄ[>ŽN'¨9tà¾ètH/Û >‡ú ”wy@¾bñ Å ’:¾€IŸ^ ª>ŽÍú”æ½¾WDh>†dôuÚ$¾W9yýg´¹¾¤™¯ƒkt>(¼ÄVñ†¾.ΰÁ#ù>„ØõhëàÖ¾C š`0pp¾‚Ø›Þ+ÎŽ>dð*c!<¾šäÅsR>ƒY¤ÿ¯-‰>)”]=M^Ÿ¾ƒç¤„£” >…jâ;~¾Ž¼ `L*>é·i/>Mß‘Dô¾„ÓèK~Í>ÅÙC–ƒ¾ão—'kv>€Š¿(MZ>Y²žÀв6¾…Ÿ›^v|>VõÀÕ:¾ îÖTÍ>~}æ´KCì>a¾Ò5#¾†L÷®Îÿ^>cUŸ“=\¾Œ2k×ôŠ#>|!|_÷>f*á„FÀ྆ÞK™á¡Î>6À~Ó]q¾‹_]ѹx%>yË0°]8f>j —\о¹¾‡UÂ>&2Ž>ŽþDøss¾Š’ëu>w³³y3Éc>m£4/«ÒA¾‡µsZÀ>Ž¼h>•{¾‰Ï—ö•˜>uÉÎwÍü>p[OO’¤¾‡ÿnð>n>ŽspõÕ½.¾‰3ì~®>t'¿3i>q¯x%õ辈5““ßTL>Ž%Rb«õ¾ˆf̪ð$g>r€ä¨æd>rвUDR¾ˆY˜Í´X>ÓÕ’Ì~s¾‡Äð$§ç)>q"TxõS>s¿ðqpr¾ˆm$oùIÊ>€‡ï6}Ͼ‡0sPoâƒ>oä7êÝy>t~xmTÚ¾ˆqž4D¥·>,¥[ÓØ©ôÔË”Í>mßq)à`>u>×”ëq¾ˆhAŠåûÙ>ŒÙEˆäˈ¾†1øYÊ–>l5ˆöZ@¹>uv“¨dÁ¾ˆR2a™©­>Œ‡F±c¦$¾…Ⱦûª>jäÀ™ç¯¹>u±¯/È#L¾ˆ0Sküyl>Œ7= ý³¾…n\x½QÞ>i뉳 »>uÄm Q"㾈Yý ¸>‹é}þ§¾…"×4îP>iH*2º{S>u¯­ÎË,¾‡Ëム>‹ž¨…Iw.¾„åøjJû?>høo_†sc>ut¢"ãlN¾‡ŠMj• d>‹V[§ÉÚ^¾„·g±,G>húZêÎO*>u+>µö¾‡>Ë<¥ñ>‹˜ØÐp¾„–¾EŸ ^>iKÉCzÍ>t(±£®¾†ézƒ‘ä>ŠÍ÷Ïn(¾„ƒ`±8¦ø>iê*,µIS>sæO¡“p˜¾†Š>ñ÷<,>Š‹AØùš¾„|“·¼I€>jÓCOo>smwI¾† ÖëBÜ>ŠJã´^ľ„Ž"†^r>lþÎÞÖí>r*åC_~¾…¬òÂÎ&w>Š ¥Ÿ.E¾„‘R»ØÉ>myÌÚ á>q+ÖeB¾…. á>‰ÈÃ!3C¾„ªÂÂ.‹w>o1}»U¶ß>oʺ,$o¾„£ŠÂ)>‰…§š£Þ¾„Ì°+5\P>p“áóÈ’>m³Mþ@¾„ ÁÐk7>‰?qé·‹ß¾„õµPMˆ‡>q¬TZO™ª>j-°«]Χ¾ƒhèõ‹R>ˆô­@ˆu¾…$HU’î>rà zCX2>fú{HsÀ¾‚·$Y|÷>ˆ£Ø?º¾…VÊù{ý>t,ÂZjÇR>c„ûµð¾ö áÖ/>ˆKSL¬!ܾ…‹dèp»>uÁP*“+>_œÊ-?Aï¾&t²åá>‡éQ^6O‘¾…ÀCÈ †>w)€¿!Æ>W°,įd¾€E¹N²‡¯>‡|BÝï+¾…òÈô ÐÛ>xŒÁÈ›->N@ZE ¾~§JfmœI>‡ƒÊs6¾†!+•[ >zÄL¶>9ªY±¸!¾|žÜÍêÃï>†wÔóŒu¾†HÄa9>{»(»œu ¾'f­°s¾zpÏmöÚ>…Ý<§+¾†g›ù>}Zp8ÅT%¾I)«¸o?ƾx8Ã[à2>…/O õÁ¾†y6&–nP>~ø|Ò´5a¾V¢ƒ¼Æ”¾u m s^l>„l1Æ;¾†|o?î.~>€Gê½]å×¾`!n^».¾rý8Û­n³>ƒ’nçøš1¾†mÏ™t> @âan*¾eÌ{¿!¨¾p3 —Ý]Á>‚ /ä›}¾†JNjÊ:>ÈñD«Fžk.tã!+Ⱦj†\bˆ…>“êO§x­¾†àÀµêè>‚wÐú;Œ¾pMãí¹Y¾d^aɸ­ >€lhÒ0§¾…¸‰IrŽ>ƒ>ÍZú¾s·?Æ{¾[çñŸZ>~Q‡Q86ÿ¾…Dk:ö®u>ƒž/Ò?V¾u±šd8¤`¾M9µò¥'>{Ð6zõ¾„¯¢Èm¦á>„GŠMà ¾xOİ팇¾ ˱/(¸>x–‘&0-¾ƒ÷³¾Ð‡D>„a[ˆ,5·¾zÕx¢ãé>J',É%f>ucÁŒíe¾ƒV¡K3{>„“%¹_Ýã¾}93Y\™>[4ºv»‡>qúmy0Ò(¾‚ª2¢C">„ŸzÖ÷N¾pá¯}‹>dµë[™d>l¼FEõÀò¾€è^¸ Ðo>„‚PÛÔØ~¾€¸Ø£ð°>kÅÚ@|t>e'ç…µj·¾#\`šëÐ>„7ÈQD8=¾˜/‹òél>qXüÆ£ž¡>Z‰ºrOß<¾|#üÀÒÒ>ƒ¼qFq¾‚PÀðþåt>t²Yë°®\>D+là ¾xÑ›¸+~Q>ƒ Y–Š:}¾‚ÜÁ@@~>wáO”ú™¤¾91E±#ç¾u2`=v2§>‚(% `.G¾ƒ6€ /“>z×À€¶=M¾Wdˆ¿À¾qJëâO»O> V´(ô¾ƒX§£ïv^>}†ÎjÒÖE¾cÒàÝ‹ßÁ¾jFd¿‘Pr>lѧð?D¾ƒ>?ÁTε>Þý‚Ü˾kúa‰³˜s¾aŠá` L‹>|SÏ +~/¾‚âúNôáÀ>€èfV| ò¾qêý—5—¾Pù©›029>xÏwðœN¾‚CwšhƒD>¦}{A¬á¾u 9f¡ØŽ>šñzÔÛ?>tæ|N>%ܾ]_þý‰>‚"ny]T>¾y 6ý²ÙÎ>T,îYÊë¶>p¢Ž>s³¾€/±Kz˜>‚U“ì;Dæ¾|êQÞT>cO—ÑZ0Ž>h!©µ¦v¾}v'ó¦>‚:1Ž(¾~¥bï‡-Õ>lC;àÅ/>]”ü™ä¾z´+Þ>˵gŸw´¾€XvÍbw>r`‹Örñ>BM;Îú¾vG'û[Ç>'‘žL¾¾uŸCAô>vK&¹¾F>~#m¾q©p„hž¬>Öâ{iZ¾pß-¶0>yÇ,â™S©¾_Øï<9ð¾iÀ¶’r>|ó/e¥¾tžɘ>|º›£þ`f¾i<×ØGϾ_+Ý.¹>yjP%Åؾ©x¡ÁE> b5 Ï…¾q5ÿ|X¾DPÁ!å>uHÃcóR¾€OZ—Ç›e>€R¤¶™þs¾uh|ó5>F´­HNÙ>p ù»¾~G;©oÄ¡>€¸¥±uìÚ¾yB^Ã"ø>`C·9µ,>gí.Ó›¾{(1U•í>€°K•–B!¾|] HŠ›>jq‚ùú>XŠÅtS»¾wM~·@]>€4Nl¬W¾~_úÖ*' >qô¿Š·>!Á`ºÒ_u¾rÊ?žëdµ>~…mµP¾Åõ,e%>v+ÏFyX¾T/±*[j¾kr=ÅÃÎ…>{º ,zYȾ€ˆ G¡>y¸×÷ &¾dýCû3 Ú¾`wþx  >x äCv‘¾ªŸ%ß®Î>|vr…Ž5F¾o7æ?o[L¾CÝ«Aæy>s¦¥Mÿ¾~{ði>~D9Xi榾t3üûÉo÷>JÆCòÅ·È>m!,'c6ξ{x%gº§>Þ—o6¾xñBM>w>b`‹ïÿ>aò@Eú¾wãÇÅ¢ò>~¯ZO劎¾{:ø[’>lØS`Æ:>H}/'\~¾so3¡n>}2š‘T,¾}—}çà >s<5•þªD¾G£¶Nðe ¾l{‰C|¬l>z”úò[嫾}ô±…XÒ>wGpÒml¾a­¤úJ0¥¾`ûŸòL'>væ¸Ôõ=d¾}–›¯K!>z[ħÑKh¾l®þVϧ¾C>F»w>rE‰À+p¾{øÉfRõ>|NEç’Ž¾s6 ›µZ÷>Nÿr>i¹&à>d¾y!üúk„>|þuŽ¬µô¾w4í%XV>c|kì³H>[âð²¾u(­Ú¥Kv>|Y /U±¾zÆTEÃ>n|4@'|9>#Ïȹ ¾p3R[¨;€>zZQÀé<ý¾{ÀG÷l§¢>súó©õ~¾V%Œ|<Ú¾dðAŦÉß>wTò’ ¾{ÿî'wVð>w±Xξg8(+‘˜»¾Pï2ˆŸk¯>r›ÛtôlؾzÍ á§)>z'EÎ<ñ¿¾píi¤D>A‰Ø›ÖÕ>j`§ ª[¾x,šÈËdÊ>{0×\ÿ›¾uK^èĺ>`ìŽÖXœ~>\K¥ÖÄv˜¾t9 ‰=›>z´MÃs¾xpuH0>lmókpb >"ü}9ôª¾nE/`ÊÜÌ>x­j`Ⱥ¾z$mHJJR>s ³0»³¾W…½Úê¾b\ð:€‡Ú>u0$öúʾzB„ î>vÊT¿{|¾gç"Ãò°M¾E£ž®¿‘™>pi”KÌ—p¾x½¹¼%1>yZ79¸¾q9g±eµï>O,| Õæ^>e>P¾öáé¾u£ìV.’^>y >ŸPŒ¾uUkÞX>dbˆñRÅÄ>P±@@-‰)¾q|BÎ>x€ÎÃÍ̾wøéÙº«Ä>o~GÞ© ¾Død¨é¾fî~j Ó>u±“~³¾xë^¹ó¬>t&xõ‚lä¾aê|ù6-k¾T*rŽ‰“>q[ŽÏí¿¾xó5:pÏ>wË)ú’˾meÝrU>;"ÍlI¸Ø>gš2çí¾uo ϱOÁ>x7X­:Ük¾sH`ö)>`|Â=La±>Ulú$í|¾q.é#ŒFÉ>w(Ë”«¾vSt“sÁ>l,1Vg•¾6ØtjÎd¾g;"Fd,¼>tê`?î¾wч¦¤v>r¼‹¦¿^ ¾`†èäÞƒ¾T #7Åh>p¥¦šTI¾vÓ_„ù>uȾÈ8¾kÈ")²oä>:¸kº7/>f^”2bQ¾t)Íô›Ž>vï{íuóM¾r~ÌòÜ™>`Ž´¢š>QèÆðÓ‘ó¾o† ƒf>v  N¤¾uh€©h~¸>l&ÛS6â/¾CØÅ0¾cø€ãŠHÜ>s,MŽô¼^¾vTÜ÷Év(>rƒ_¦ íˆ¾aæe†¼x¾JÅj7—È>mE•Sý¾u$@ÃyÎð>u%1V"¿M¾m+4=Šú#>LHâ92>a臻6¾qê“ ø ð>u¯LD¯¾r¸n`áJº>c÷ò »Ä÷><圦};iâ»~×;>t "ÝǼ¾têJ}†>n­‚`%Ó-¾TFÆ¿æm«¾Zϼs2å•>pXÌ!'§¾tè®ê8‚>s§\ª@S¾fœ‹¹]ǧ>È–²I>eí$A?¾rªüçÞŽ3>tœ±©ëƒ[¾p<Ñ™ÈE>[°èàNë>QÐÀSµ$R¾lÏji™>sæ¾XÑÏg¾sKøçb 2>i¡¦n¾C¼Ñë>[¾a$7îÓ,§>pïøjµ¾tc¼S³>q&’~|&¾bü(„V¾=*g8 `>hñð0¾rŠ¬ jÑ>se¥ŸÁýQ¾lÂ|Dqç>>T.·ÎÖ>>WÖf ʾm„ i@½_>s@Ûí󋎾qëÃ|³E>fbÚ6À7¾29#³Hç¾be#".¸M>pµ7…_¾s'"ëd³>o«G¹Æb–¾_%4T<ù~¾D`®‹ãðï>hD¿è.>¾q娧î—>rYªç[Ⱦj¡§“hõ>QV—Ìv^>>WŠî£)7Œ¾l“ÌÞú>rasz²Xž¾pùJäüg>e 5Ž ¾/z9®pO¾a”•.™à>oÉxº^¾r<ñÒ9Ü>nP é2/¾^lƒ¬µv¾A50‘ï|Q>fl¬9›Û¾pæ!źB>q­(Íß¾jÞ4xý>RÁ/e(bì>Sñð´<ܾjCJpV>q\‘¸“5¾puJ)»>erJ°*Ë;=ÿª£•¾]ßpr~x@>m '†,à¾qX€#h>S>nãÑ7̾`«±y ø¾(4ÔÆ3%_>c#àé3)–¾o¸>( >pî-w¿~þjÄ­ŸO>>W×@Bdw>I3VÖÚ¹m¾f’ß_Ÿ/>pÅògî¾p2?×2Èp>g3p™5O¾M^­€ ~¾UTYÓáŽ>iC¹1 ‡¾pKiSu´>nqç€> ¸¾c†Ý;4v>8ZQ 7$ä>\lŒ²mNº¾kCð‘$>p1ÊR+$ ¾l*fëuöä>_À-)ò{>ª>Y„f¾aMé#j>l¦. A¬‹¾o·qÃ:)>i°_Á;X³{fa¿¾A¹üÌr>c×í"áþ½¾mÌåC>n¯bjz3k¾g )£Tø>R¹Ï >N)û¿yz÷¾eÞcÉ‚Í>mæÜB/ç~¾mgZåM3ü>d“ŒZÒæ¾Gè¼ r—¾Tr=ä­à„>goD«Tz¾mòkài»>køþ]Yõ¾b}…ff>9ŦÐ.Ë3>Xû ?i\ľh˜ÞÚ ¾>m¸ÿÿø–¾jwhÐ¥P;>_žQWШ¾é"Ç’¾\¾rW}Í>ik¥s‘;¾mKlrùê4>h÷sÊVAº¾[d˜÷Ƚ“¾%>Žòì-_>_Ë´×ÿ¾iõQý—“>l¾¦LX0[¾g‡kCÛ›>WŸXÁ >8óSK/ƾa.Dá˜m>jFEŽcľl!þÞyU>f3i•\¾TWâìs7¾BeÕŸÇ>b§“!Te¾jkIÿzàC>k€ &ç3¾e&D>Q•&©C¶>G$F;UY£¾b´nhËq–>jp2rü¾jæ;fKÿz>dÉ‘‹\‡¾N²/¬¼¾JÆc+îºÉõ¼¾j_ˆQJ>j\~‚¯÷i¾c.òݪ>KGÞ”y>M^¤¬Uíò¾ctãòÿ>j@&;ÿ¾iéCüZä\>bhj„¾Hè@ÄùêQ¾Ný¯¦å}»>c•i_ùß<¾jâôb¸Ö>i‘ƒ'²”n¾b(y—4­'>GŽÏ#Ñïr>O²ªÙÕ;c’ˆ±@nO>iðåìÕÿ¾iX*v{Ø>a÷FξG6h§éU¾Oˆjd:ˆ>cosêÚL'¾iÈ·5%>i?šÎÔú¾aýÀ§ªÊ>GÚOc½¬>N†= ¾@|¾c.#Ëâ>i seÔZ¾iF(Žió>b:sWˆ(¾Iv„éƒÂ¸¾L¯¢.¾Fœ>bΩƒ¹Bl¾iye©´>il|Ìþq…¾b¬‘¡ÇÑ>L5+¨‘Õ>J#›Î^¾bOÞ:C¸>iQ`}“²Ö¾i¯£¨>cR(„ÉÙ¾Oƒ±Mã¾F}÷ôŸ">a®¼1#Äù¾i#ð"5>>j J³u¾d(õþC¬>R©åËS_>B FÌv¾`ç,T”D>hëáår섾j||Ö2%¦>e-œK8´¾T·SîE¡I¾9xÜæÒ&µ>_æ ´Æ¿]¾h¢pn >jú•?æ¾f\{-a>Wããó 5N>)˜ËjÊã¾]—@=Të">h=âÝ´¤¾k}õ@·ì>g®õù¼Ç¾[†~÷Þ=ÿÓ°ùb–i>ZÐú}‡¾g´´þN°«>küÂJ !ù¾iaŠFÁ˜>_›ûLó¾3qfŒòá¾Wì-¢>fúkÛß¾lj¸­r>j¤fTźî¾bˆ[œ>C2ÌŽ€l>S“ƒ~ …¾f/Í‚œ>l¹´Åº“¾l3 `xá>d€~ïƒÜ£¾Nu²P‚¼¾Mè¹ö:«>d¹¬Ûß¾lØÆ1‘K¤>m½6«v9ɾgI%º >U"PŸp¡>CNø+]j¾cl´Õ,´¤¾o1ðUð*Í>i×Xx¸+o¾[Ó@=x*î¾*¨ý©µ>`üTDD ¾l7Þuii>p>!ºM£ ¾l£1Nª<>aŒuP1û­¾.± êÛzñ¾\Æ!aUT>kIÕLbvG¾pÁÇ›ô5>olª-gó¾epøÃ>†æ>GÚ+ ±ý >Vlâì÷¾iÐD€…¯å>qUFŠ¥Þ¾q ‘µµP~>i‰kËñµ¾Tö¶,`«þ¾M•ÆU#Kç>g¯ª?"Û¾q(Du›þ‡>rGíòž›ø¾mÁ ÷M¾ú>^éï ‚V>7#˜Û—«!¾dËÀpvçô>pç캾sR³-kû >pýÇ[Q¾dÖ ŒÕû >2§lçÀΧ>a ¥±#Z¾p@;á7gÏ>t·fp7D¾s ”@?Ö>jŠ~HÃ#µ¾PW †?¾X¢1æ P_>n7ØÚÁ<¾t}qA î.>tì+RÌç/¾p8ÅÑ~åÖ>]ÖfþAÐE>J>õ!lÅÚ¾j˼0‹,>tgYh%ꆾvˆ=x®%à>s.¶ŠX]¾f*zÿñn>Éb>f'„¾Ö¾s¶­˜éê€>w»@ÌWb®¾vç L7Õ>màòTèì5¾PQ~f'ž_ß;P1«]>rK³ðe-¾x]yÃ@°>x ô]® ¨¾rë°ÑUÎ0>a ç˦Ÿá>PŽ¾-ÿ¾p‘Ÿé>xCI÷þªw¾zÈX-ª>vàŠŽ½[C¾j¾ï2$>‚Ó>Œ¥>i°¹­Ö¾w>…€³ñ>|HyµWËå¾zœÒB^%>r‚r(†é ¾W3¸™™À¾a—/^(>u!^}ÏYì¾|ä44þ]>}áõ˜³7"¾w¼Ýd7¤0>g”v”0s%>I»rÜ ¾qÁ®¨->|YÓ«x}û¾€2­Íç$£>|̱„þrD¦S*ôÜ>I^8 hé>iüÍrŽ¾zg hnûì>€é®GÖ&¾€®Í“±ë >xüÏ—Iˆ¾eEŘA¾[ r‡S>Ñ>vÍÕ¦°þ™¾€å×Ó¡¬c>‚„Öúa¾šÊÆÚ-V>r˜Ñií©}¾-{Ä#³¾q[¹»&¥ê>ô<ñÔ&¾ƒ­œ„ â>‚Ö$6¢#@¾{ºháü%>càLZµ$/>cä/-“i¾{óþ(TÞ>ƒèí-ÑÛ¾…R«¢œoS>ȱž[¾t¬Tõô¾"ŠùB>u{bÉÃJ¾‚ôÝŒŒ¡—>†ñ¨T’„¾…°yþÄ>~¸'ª©Rc¾e>¼úrB¾hÚs?‰ƒ>€“‹9E/¨¾‡Zï¦>ˆâÙãÊü¾„³IIý9b>w?§ Ž!>'UÚ© û¾y$ÄÜv¦w>†0q­ˆâJ¾ŠðA‹%m|>‰›;Ò~¼¾‚Xÿôì1>j¹ˆM‰”(>kNNƒ±kñ¾ƒȹcÍu>‹\Ú«ÓF‚¾ ¹ >°>‰íVwI¾}Rn uø>4ç`˜5»>{Ç·šg¾‰ªãßã8Z>ëºû.õw¾]óÝ`¨>‡!µ¾saΡæµÑ¾i\ ðã í>…f|Ær…P¾ì?£‡9>‘Þ­}¶õ;qmAùéE>ƒå, ß¾[ìÝñö ®¾|k>܉ºã>@2|©Ó¾“¥†YöX>“_nÈI¿¾Ž$¦R‘â>~¤Î8•Ÿm>_]PvÏÔt¾†ëN…™äN>’³¡ (ÇŒ¾•ý4`È>”tRu¾ŒxÉ0>rÀ§2˜ØÀ>y,Žo±×›¾BóëÐÚ>–ôÅDPÈ羘ğêi>• DÔÔ¾‰;Á»¤¿>ODè祥>†ªO›ì.¾•š¡N„¥®>›zŠ¨ˆc®¾›{'4‚2o>•`\o²{Ǿ„‰ÂMLnϾl¶ž×ð€>‘?ËŒ@bÒ¾›¯8Ѹ<Ñ> 9˾_¾ž?É)sB>•@8/Œµ¾|„RýdÈZ¾‚}/gZV™>˜_ÎÜ&%+¾¡oÃwDy>£_çy\¾ £î«d >”Á¡¾gËÊÑ-I:¾qA÷—щ> ªž`qÅX¾¥í±F,‚W>¦¬#ýå˾¢xÂ0†>“ßšÖ=6>eC-tªÜ¾šÐÉ­µï>¦­E¹^Ã{¾«ý ~ˆã>«„[Ý÷ü&¾¤òÆü?¹>’…"ÄM¤Š>…•ým2¾¤ ì­›Î>¯Œ:2AâG¾²‰·ßǤ—>±to 2B«¾¨Í!>é ,>YáQD:î>˜¿Ï·ä ¾¯Â«=™¯>·Zd ^Y¾ºƒ >¸±¹mg¾¯ëYªØèû>‡¹ÁKBô>©ŒÑH ë¾¼IenÅ}>ÄA«.Y¾Æƒv}4\>Ä'¯†ñŠ¾¸Ÿ¥ã¶ÊÁ¾| %'­¾>ÂTìéX K¾ÒùÜCî4 >Ü?*7›C6¾á4ª)2,­>àrŸú=V¾§–~¹O¿%4úDƾW9yýg´¹¾¤™¯ƒkt>(¼ÄVñ†¾.ΰÁ#ù>„ØõhëàÖ¾C š`0pp¾‚Ø›Þ+ÎŽ>dð*c!<¾šäÅsR>ƒY¤ÿ¯-‰>)”]=M^Ÿ¾ƒç¤„£” >…jâ;~¾Ž¼ `L*>é·i/>Mß‘Dô¾„ÓèK~Í>ÅÙC–ƒ¾ão—'kv>€Š¿(MZ>Y²žÀв6¾…Ÿ›^v|>VõÀÕ:¾ îÖTÍ>~}æ´KCì>a¾Ò5#¾†L÷®Îÿ^>cUŸ“=\¾Œ2k×ôŠ#>|!|_÷>f*á„FÀ྆ÞK™á¡Î>6À~Ó]q¾‹_]ѹx%>yË0°]8f>j —\о¹¾‡UÂ>&2Ž>ŽþDøss¾Š’ëu>w³³y3Éc>m£4/«ÒA¾‡µsZÀ>Ž¼h>•{¾‰Ï—ö•˜>uÉÎwÍü>p[OO’¤¾‡ÿnð>n>ŽspõÕ½.¾‰3ì~®>t'¿3i>q¯x%õ辈5““ßTL>Ž%Rb«õ¾ˆf̪ð$g>r€ä¨æd>rвUDR¾ˆY˜Í´X>ÓÕ’Ì~s¾‡Äð$§ç)>q"TxõS>s¿ðqpr¾ˆm$oùIÊ>€‡ï6}Ͼ‡0sPoâƒ>oä7êÝy>t~xmTÚ¾ˆqž4D¥·>,¥[ÓØ©ôÔË”Í>mßq)à`>u>×”ëq¾ˆhAŠåûÙ>ŒÙEˆäˈ¾†1øYÊ–>l5ˆöZ@¹>uv“¨dÁ¾ˆR2a™©­>Œ‡F±c¦$¾…Ⱦûª>jäÀ™ç¯¹>u±¯/È#L¾ˆ0Sküyl>Œ7= ý³¾…n\x½QÞ>i뉳 »>uÄm Q"㾈Yý ¸>‹é}þ§¾…"×4îP>iH*2º{S>u¯­ÎË,¾‡Ëム>‹ž¨…Iw.¾„åøjJû?>høo_†sc>ut¢"ãlN¾‡ŠMj• d>‹V[§ÉÚ^¾„·g±,G>húZêÎO*>u+>µö¾‡>Ë<¥ñ>‹˜ØÐp¾„–¾EŸ ^>iKÉCzÍ>t(±£®¾†ézƒ‘ä>ŠÍ÷Ïn(¾„ƒ`±8¦ø>iê*,µIS>sæO¡“p˜¾†Š>ñ÷<,>Š‹AØùš¾„|“·¼I€>jÓCOo>smwI¾† ÖëBÜ>ŠJã´^ľ„Ž"†^r>lþÎÞÖí>r*åC_~¾…¬òÂÎ&w>Š ¥Ÿ.E¾„‘R»ØÉ>myÌÚ á>q+ÖeB¾…. á>‰ÈÃ!3C¾„ªÂÂ.‹w>o1}»U¶ß>oʺ,$o¾„£ŠÂ)>‰…§š£Þ¾„Ì°+5\P>p“áóÈ’>m³Mþ@¾„ ÁÐk7>‰?qé·‹ß¾„õµPMˆ‡>q¬TZO™ª>j-°«]Χ¾ƒhèõ‹R>ˆô­@ˆu¾…$HU’î>rà zCX2>fú{HsÀ¾‚·$Y|÷>ˆ£Ø?º¾…VÊù{ý>t,ÂZjÇR>c„ûµð¾ö áÖ/>ˆKSL¬!ܾ…‹dèp»>uÁP*“+>_œÊ-?Aï¾&t²åá>‡éQ^6O‘¾…ÀCÈ †>w)€¿!Æ>W°,įd¾€E¹N²‡¯>‡|BÝï+¾…òÈô ÐÛ>xŒÁÈ›->N@ZE ¾~§JfmœI>‡ƒÊs6¾†!+•[ >zÄL¶>9ªY±¸!¾|žÜÍêÃï>†wÔóŒu¾†HÄa9>{»(»œu ¾'f­°s¾zpÏmöÚ>…Ý<§+¾†g›ù>}Zp8ÅT%¾I)«¸o?ƾx8Ã[à2>…/O õÁ¾†y6&–nP>~ø|Ò´5a¾V¢ƒ¼Æ”¾u m s^l>„l1Æ;¾†|o?î.~>€Gê½]å×¾`!n^».¾rý8Û­n³>ƒ’nçøš1¾†mÏ™t> @âan*¾eÌ{¿!¨¾p3 —Ý]Á>‚ /ä›}¾†JNjÊ:>ÈñD«Fžk.tã!+Ⱦj†\bˆ…>“êO§x­¾†àÀµêè>‚wÐú;Œ¾pMãí¹Y¾d^aɸ­ >€lhÒ0§¾…¸‰IrŽ>ƒ>ÍZú¾s·?Æ{¾[çñŸZ>~Q‡Q86ÿ¾…Dk:ö®u>ƒž/Ò?V¾u±šd8¤`¾M9µò¥'>{Ð6zõ¾„¯¢Èm¦á>„GŠMà ¾xOİ팇¾ ˱/(¸>x–‘&0-¾ƒ÷³¾Ð‡D>„a[ˆ,5·¾zÕx¢ãé>J',É%f>ucÁŒíe¾ƒV¡K3{>„“%¹_Ýã¾}93Y\™>[4ºv»‡>qúmy0Ò(¾‚ª2¢C">„ŸzÖ÷N¾pá¯}‹>dµë[™d>l¼FEõÀò¾€è^¸ Ðo>„‚PÛÔØ~¾€¸Ø£ð°>kÅÚ@|t>e'ç…µj·¾#\`šëÐ>„7ÈQD8=¾˜/‹òél>qXüÆ£ž¡>Z‰ºrOß<¾|#üÀÒÒ>ƒ¼qFq¾‚PÀðþåt>t²Yë°®\>D+là ¾xÑ›¸+~Q>ƒ Y–Š:}¾‚ÜÁ@@~>wáO”ú™¤¾91E±#ç¾u2`=v2§>‚(% `.G¾ƒ6€ /“>z×À€¶=M¾Wdˆ¿À¾qJëâO»O> V´(ô¾ƒX§£ïv^>}†ÎjÒÖE¾cÒàÝ‹ßÁ¾jFd¿‘Pr>lѧð?D¾ƒ>?ÁTε>Þý‚Ü˾kúa‰³˜s¾aŠá` L‹>|SÏ +~/¾‚âúNôáÀ>€èfV| ò¾qêý—5—¾Pù©›029>xÏwðœN¾‚CwšhƒD>¦}{A¬á¾u 9f¡ØŽ>šñzÔÛ?>tæ|N>%ܾ]_þý‰>‚"ny]T>¾y 6ý²ÙÎ>T,îYÊë¶>p¢Ž>s³¾€/±Kz˜>‚U“ì;Dæ¾|êQÞT>cO—ÑZ0Ž>h!©µ¦v¾}v'ó¦>‚:1Ž(¾~¥bï‡-Õ>lC;àÅ/>]”ü™ä¾z´+Þ>˵gŸw´¾€XvÍbw>r`‹Örñ>BM;Îú¾vG'û[Ç>'‘žL¾¾uŸCAô>vK&¹¾F>~#m¾q©p„hž¬>Öâ{iZ¾pß-¶0>yÇ,â™S©¾_Øï<9ð¾iÀ¶’r>|ó/e¥¾tžɘ>|º›£þ`f¾i<×ØGϾ_+Ý.¹>yjP%Åؾ©x¡ÁE> b5 Ï…¾q5ÿ|X¾DPÁ!å>uHÃcóR¾€OZ—Ç›e>€R¤¶™þs¾uh|ó5>F´­HNÙ>p ù»¾~G;©oÄ¡>€¸¥±uìÚ¾yB^Ã"ø>`C·9µ,>gí.Ó›¾{(1U•í>€°K•–B!¾|] HŠ›>jq‚ùú>XŠÅtS»¾wM~·@]>€4Nl¬W¾~_úÖ*' >qô¿Š·>!Á`ºÒ_u¾rÊ?žëdµ>~…mµP¾Åõ,e%>v+ÏFyX¾T/±*[j¾kr=ÅÃÎ…>{º ,zYȾ€ˆ G¡>y¸×÷ &¾dýCû3 Ú¾`wþx  >x äCv‘¾ªŸ%ß®Î>|vr…Ž5F¾o7æ?o[L¾CÝ«Aæy>s¦¥Mÿ¾~{ði>~D9Xi榾t3üûÉo÷>JÆCòÅ·È>m!,'c6ξ{x%gº§>Þ—o6¾xñBM>w>b`‹ïÿ>aò@Eú¾wãÇÅ¢ò>~¯ZO劎¾{:ø[’>lØS`Æ:>H}/'\~¾so3¡n>}2š‘T,¾}—}çà >s<5•þªD¾G£¶Nðe ¾l{‰C|¬l>z”úò[嫾}ô±…XÒ>wGpÒml¾a­¤úJ0¥¾`ûŸòL'>væ¸Ôõ=d¾}–›¯K!>z[ħÑKh¾l®þVϧ¾C>F»w>rE‰À+p¾{øÉfRõ>|NEç’Ž¾s6 ›µZ÷>Nÿr>i¹&à>d¾y!üúk„>|þuŽ¬µô¾w4í%XV>c|kì³H>[âð²¾u(­Ú¥Kv>|Y /U±¾zÆTEÃ>n|4@'|9>#Ïȹ ¾p3R[¨;€>zZQÀé<ý¾{ÀG÷l§¢>súó©õ~¾V%Œ|<Ú¾dðAŦÉß>wTò’ ¾{ÿî'wVð>w±Xξg8(+‘˜»¾Pï2ˆŸk¯>r›ÛtôlؾzÍ á§)>z'EÎ<ñ¿¾píi¤D>A‰Ø›ÖÕ>j`§ ª[¾x,šÈËdÊ>{0×\ÿ›¾uK^èĺ>`ìŽÖXœ~>\K¥ÖÄv˜¾t9 ‰=›>z´MÃs¾xpuH0>lmókpb >"ü}9ôª¾nE/`ÊÜÌ>x­j`Ⱥ¾z$mHJJR>s ³0»³¾W…½Úê¾b\ð:€‡Ú>u0$öúʾzB„ î>vÊT¿{|¾gç"Ãò°M¾E£ž®¿‘™>pi”KÌ—p¾x½¹¼%1>yZ79¸¾q9g±eµï>O,| Õæ^>e>P¾öáé¾u£ìV.’^>y >ŸPŒ¾uUkÞX>dbˆñRÅÄ>P±@@-‰)¾q|BÎ>x€ÎÃÍ̾wøéÙº«Ä>o~GÞ© ¾Død¨é¾fî~j Ó>u±“~³¾xë^¹ó¬>t&xõ‚lä¾aê|ù6-k¾T*rŽ‰“>q[ŽÏí¿¾xó5:pÏ>wË)ú’˾meÝrU>;"ÍlI¸Ø>gš2çí¾uo ϱOÁ>x7X­:Ük¾sH`ö)>`|Â=La±>Ulú$í|¾q.é#ŒFÉ>w(Ë”«¾vSt“sÁ>l,1Vg•¾6ØtjÎd¾g;"Fd,¼>tê`?î¾wч¦¤v>r¼‹¦¿^ ¾`†èäÞƒ¾T #7Åh>p¥¦šTI¾vÓ_„ù>uȾÈ8¾kÈ")²oä>:¸kº7/>f^”2bQ¾t)Íô›Ž>vï{íuóM¾r~ÌòÜ™>`Ž´¢š>QèÆðÓ‘ó¾o† ƒf>v  N¤¾uh€©h~¸>l&ÛS6â/¾CØÅ0¾cø€ãŠHÜ>s,MŽô¼^¾vTÜ÷Év(>rƒ_¦ íˆ¾aæe†¼x¾JÅj7—È>mE•Sý¾u$@ÃyÎð>u%1V"¿M¾m+4=Šú#>LHâ92>a臻6¾qê“ ø ð>u¯LD¯¾r¸n`áJº>c÷ò »Ä÷><圦};iâ»~×;>t "ÝǼ¾têJ}†>n­‚`%Ó-¾TFÆ¿æm«¾Zϼs2å•>pXÌ!'§¾tè®ê8‚>s§\ª@S¾fœ‹¹]ǧ>È–²I>eí$A?¾rªüçÞŽ3>tœ±©ëƒ[¾p<Ñ™ÈE>[°èàNë>QÐÀSµ$R¾lÏji™>sæ¾XÑÏg¾sKøçb 2>i¡¦n¾C¼Ñë>[¾a$7îÓ,§>pïøjµ¾tc¼S³>q&’~|&¾bü(„V¾=*g8 `>hñð0¾rŠ¬ jÑ>se¥ŸÁýQ¾lÂ|Dqç>>T.·ÎÖ>>WÖf ʾm„ i@½_>s@Ûí󋎾qëÃ|³E>fbÚ6À7¾29#³Hç¾be#".¸M>pµ7…_¾s'"ëd³>o«G¹Æb–¾_%4T<ù~¾D`®‹ãðï>hD¿è.>¾q娧î—>rYªç[Ⱦj¡§“hõ>QV—Ìv^>>WŠî£)7Œ¾l“ÌÞú>rasz²Xž¾pùJäüg>e 5Ž ¾/z9®pO¾a”•.™à>oÉxº^¾r<ñÒ9Ü>nP é2/¾^lƒ¬µv¾A50‘ï|Q>fl¬9›Û¾pæ!źB>q­(Íß¾jÞ4xý>RÁ/e(bì>Sñð´<ܾjCJpV>q\‘¸“5¾puJ)»>erJ°*Ë;=ÿª£•¾]ßpr~x@>m '†,à¾qX€#h>S>nãÑ7̾`«±y ø¾(4ÔÆ3%_>c#àé3)–¾o¸>( >pî-w¿~þjÄ­ŸO>>W×@Bdw>I3VÖÚ¹m¾f’ß_Ÿ/>pÅògî¾p2?×2Èp>g3p™5O¾M^­€ ~¾UTYÓáŽ>iC¹1 ‡¾pKiSu´>nqç€> ¸¾c†Ý;4v>8ZQ 7$ä>\lŒ²mNº¾kCð‘$>p1ÊR+$ ¾l*fëuöä>_À-)ò{>ª>Y„f¾aMé#j>l¦. A¬‹¾o·qÃ:)>i°_Á;X³{fa¿¾A¹üÌr>c×í"áþ½¾mÌåC>n¯bjz3k¾g )£Tø>R¹Ï >N)û¿yz÷¾eÞcÉ‚Í>mæÜB/ç~¾mgZåM3ü>d“ŒZÒæ¾Gè¼ r—¾Tr=ä­à„>goD«Tz¾mòkài»>køþ]Yõ¾b}…ff>9ŦÐ.Ë3>Xû ?i\ľh˜ÞÚ ¾>m¸ÿÿø–¾jwhÐ¥P;>_žQWШ¾é"Ç’¾\¾rW}Í>ik¥s‘;¾mKlrùê4>h÷sÊVAº¾[d˜÷Ƚ“¾%>Žòì-_>_Ë´×ÿ¾iõQý—“>l¾¦LX0[¾g‡kCÛ›>WŸXÁ >8óSK/ƾa.Dá˜m>jFEŽcľl!þÞyU>f3i•\¾TWâìs7¾BeÕŸÇ>b§“!Te¾jkIÿzàC>k€ &ç3¾e&D>Q•&©C¶>G$F;UY£¾b´nhËq–>jp2rü¾jæ;fKÿz>dÉ‘‹\‡¾N²/¬¼¾JÆc+îºÉõ¼¾j_ˆQJ>j\~‚¯÷i¾c.òݪ>KGÞ”y>M^¤¬Uíò¾ctãòÿ>j@&;ÿ¾iéCüZä\>bhj„¾Hè@ÄùêQ¾Ný¯¦å}»>c•i_ùß<¾jâôb¸Ö>i‘ƒ'²”n¾b(y—4­'>GŽÏ#Ñïr>O²ªÙÕ;c’ˆ±@nO>iðåìÕÿ¾iX*v{Ø>a÷FξG6h§éU¾Oˆjd:ˆ>cosêÚL'¾iÈ·5%>i?šÎÔú¾aýÀ§ªÊ>GÚOc½¬>N†= ¾@|¾c.#Ëâ>i seÔZ¾iF(Žió>b:sWˆ(¾Iv„éƒÂ¸¾L¯¢.¾Fœ>bΩƒ¹Bl¾iye©´>il|Ìþq…¾b¬‘¡ÇÑ>L5+¨‘Õ>J#›Î^¾bOÞ:C¸>iQ`}“²Ö¾i¯£¨>cR(„ÉÙ¾Oƒ±Mã¾F}÷ôŸ">a®¼1#Äù¾i#ð"5>>j J³u¾d(õþC¬>R©åËS_>B FÌv¾`ç,T”D>hëáår섾j||Ö2%¦>e-œK8´¾T·SîE¡I¾9xÜæÒ&µ>_æ ´Æ¿]¾h¢pn >jú•?æ¾f\{-a>Wããó 5N>)˜ËjÊã¾]—@=Të">h=âÝ´¤¾k}õ@·ì>g®õù¼Ç¾[†~÷Þ=ÿÓ°ùb–i>ZÐú}‡¾g´´þN°«>küÂJ !ù¾iaŠFÁ˜>_›ûLó¾3qfŒòá¾Wì-¢>fúkÛß¾lj¸­r>j¤fTźî¾bˆ[œ>C2ÌŽ€l>S“ƒ~ …¾f/Í‚œ>l¹´Åº“¾l3 `xá>d€~ïƒÜ£¾Nu²P‚¼¾Mè¹ö:«>d¹¬Ûß¾lØÆ1‘K¤>m½6«v9ɾgI%º >U"PŸp¡>CNø+]j¾cl´Õ,´¤¾o1ðUð*Í>i×Xx¸+o¾[Ó@=x*î¾*¨ý©µ>`üTDD ¾l7Þuii>p>!ºM£ ¾l£1Nª<>aŒuP1û­¾.± êÛzñ¾\Æ!aUT>kIÕLbvG¾pÁÇ›ô5>olª-gó¾epøÃ>†æ>GÚ+ ±ý >Vlâì÷¾iÐD€…¯å>qUFŠ¥Þ¾q ‘µµP~>i‰kËñµ¾Tö¶,`«þ¾M•ÆU#Kç>g¯ª?"Û¾q(Du›þ‡>rGíòž›ø¾mÁ ÷M¾ú>^éï ‚V>7#˜Û—«!¾dËÀpvçô>pç캾sR³-kû >pýÇ[Q¾dÖ ŒÕû >2§lçÀΧ>a ¥±#Z¾p@;á7gÏ>t·fp7D¾s ”@?Ö>jŠ~HÃ#µ¾PW †?¾X¢1æ P_>n7ØÚÁ<¾t}qA î.>tì+RÌç/¾p8ÅÑ~åÖ>]ÖfþAÐE>J>õ!lÅÚ¾j˼0‹,>tgYh%ꆾvˆ=x®%à>s.¶ŠX]¾f*zÿñn>Éb>f'„¾Ö¾s¶­˜éê€>w»@ÌWb®¾vç L7Õ>màòTèì5¾PQ~f'ž_ß;P1«]>rK³ðe-¾x]yÃ@°>x ô]® ¨¾rë°ÑUÎ0>a ç˦Ÿá>PŽ¾-ÿ¾p‘Ÿé>xCI÷þªw¾zÈX-ª>vàŠŽ½[C¾j¾ï2$>‚Ó>Œ¥>i°¹­Ö¾w>…€³ñ>|HyµWËå¾zœÒB^%>r‚r(†é ¾W3¸™™À¾a—/^(>u!^}ÏYì¾|ä44þ]>}áõ˜³7"¾w¼Ýd7¤0>g”v”0s%>I»rÜ ¾qÁ®¨->|YÓ«x}û¾€2­Íç$£>|̱„þrD¦S*ôÜ>I^8 hé>iüÍrŽ¾zg hnûì>€é®GÖ&¾€®Í“±ë >xüÏ—Iˆ¾eEŘA¾[ r‡S>Ñ>vÍÕ¦°þ™¾€å×Ó¡¬c>‚„Öúa¾šÊÆÚ-V>r˜Ñií©}¾-{Ä#³¾q[¹»&¥ê>ô<ñÔ&¾ƒ­œ„ â>‚Ö$6¢#@¾{ºháü%>càLZµ$/>cä/-“i¾{óþ(TÞ>ƒèí-ÑÛ¾…R«¢œoS>ȱž[¾t¬Tõô¾"ŠùB>u{bÉÃJ¾‚ôÝŒŒ¡—>†ñ¨T’„¾…°yþÄ>~¸'ª©Rc¾e>¼úrB¾hÚs?‰ƒ>€“‹9E/¨¾‡Zï¦>ˆâÙãÊü¾„³IIý9b>w?§ Ž!>'UÚ© û¾y$ÄÜv¦w>†0q­ˆâJ¾ŠðA‹%m|>‰›;Ò~¼¾‚Xÿôì1>j¹ˆM‰”(>kNNƒ±kñ¾ƒȹcÍu>‹\Ú«ÓF‚¾ ¹ >°>‰íVwI¾}Rn uø>4ç`˜5»>{Ç·šg¾‰ªãßã8Z>ëºû.õw¾]óÝ`¨>‡!µ¾saΡæµÑ¾i\ ðã í>…f|Ær…P¾ì?£‡9>‘Þ­}¶õ;qmAùéE>ƒå, ß¾[ìÝñö ®¾|k>܉ºã>@2|©Ó¾“¥†YöX>“_nÈI¿¾Ž$¦R‘â>~¤Î8•Ÿm>_]PvÏÔt¾†ëN…™äN>’³¡ (ÇŒ¾•ý4`È>”tRu¾ŒxÉ0>rÀ§2˜ØÀ>y,Žo±×›¾BóëÐÚ>–ôÅDPÈ羘ğêi>• DÔÔ¾‰;Á»¤¿>ODè祥>†ªO›ì.¾•š¡N„¥®>›zŠ¨ˆc®¾›{'4‚2o>•`\o²{Ǿ„‰ÂMLnϾl¶ž×ð€>‘?ËŒ@bÒ¾›¯8Ѹ<Ñ> 9˾_¾ž?É)sB>•@8/Œµ¾|„RýdÈZ¾‚}/gZV™>˜_ÎÜ&%+¾¡oÃwDy>£_çy\¾ £î«d >”Á¡¾gËÊÑ-I:¾qA÷—щ> ªž`qÅX¾¥í±F,‚W>¦¬#ýå˾¢xÂ0†>“ßšÖ=6>eC-tªÜ¾šÐÉ­µï>¦­E¹^Ã{¾«ý ~ˆã>«„[Ý÷ü&¾¤òÆü?¹>’…"ÄM¤Š>…•ým2¾¤ ì­›Î>¯Œ:2AâG¾²‰·ßǤ—>±to 2B«¾¨Í!>é ,>YáQD:î>˜¿Ï·ä ¾¯Â«=™¯>·Zd ^Y¾ºƒ >¸±¹mg¾¯ëYªØèû>‡¹ÁKBô>©ŒÑH ë¾¼IenÅ}>ÄA«.Y¾Æƒv}4\>Ä'¯†ñŠ¾¸Ÿ¥ã¶ÊÁ¾| %'­¾>ÂTìéX K¾ÒùÜCî4 >Ü?*7›C6¾á4ª)2,­>àrŸú=V¾§–~¹O¿%4úDƾW9yýg´¹¾¤™¯ƒkt>(¼ÄVñ†¾.ΰÁ#ù>„ØõhëàÖ¾C š`0pp¾‚Ø›Þ+ÎŽ>dð*c!<¾šäÅsR>ƒY¤ÿ¯-‰>)”]=M^Ÿ¾ƒç¤„£” >…jâ;~¾Ž¼ `L*>é·i/>Mß‘Dô¾„ÓèK~Í>ÅÙC–ƒ¾ão—'kv>€Š¿(MZ>Y²žÀв6¾…Ÿ›^v|>VõÀÕ:¾ îÖTÍ>~}æ´KCì>a¾Ò5#¾†L÷®Îÿ^>cUŸ“=\¾Œ2k×ôŠ#>|!|_÷>f*á„FÀ྆ÞK™á¡Î>6À~Ó]q¾‹_]ѹx%>yË0°]8f>j —\о¹¾‡UÂ>&2Ž>ŽþDøss¾Š’ëu>w³³y3Éc>m£4/«ÒA¾‡µsZÀ>Ž¼h>•{¾‰Ï—ö•˜>uÉÎwÍü>p[OO’¤¾‡ÿnð>n>ŽspõÕ½.¾‰3ì~®>t'¿3i>q¯x%õ辈5““ßTL>Ž%Rb«õ¾ˆf̪ð$g>r€ä¨æd>rвUDR¾ˆY˜Í´X>ÓÕ’Ì~s¾‡Äð$§ç)>q"TxõS>s¿ðqpr¾ˆm$oùIÊ>€‡ï6}Ͼ‡0sPoâƒ>oä7êÝy>t~xmTÚ¾ˆqž4D¥·>,¥[ÓØ©ôÔË”Í>mßq)à`>u>×”ëq¾ˆhAŠåûÙ>ŒÙEˆäˈ¾†1øYÊ–>l5ˆöZ@¹>uv“¨dÁ¾ˆR2a™©­>Œ‡F±c¦$¾…Ⱦûª>jäÀ™ç¯¹>u±¯/È#L¾ˆ0Sküyl>Œ7= ý³¾…n\x½QÞ>i뉳 »>uÄm Q"㾈Yý ¸>‹é}þ§¾…"×4îP>iH*2º{S>u¯­ÎË,¾‡Ëム>‹ž¨…Iw.¾„åøjJû?>høo_†sc>ut¢"ãlN¾‡ŠMj• d>‹V[§ÉÚ^¾„·g±,G>húZêÎO*>u+>µö¾‡>Ë<¥ñ>‹˜ØÐp¾„–¾EŸ ^>iKÉCzÍ>t(±£®¾†ézƒ‘ä>ŠÍ÷Ïn(¾„ƒ`±8¦ø>iê*,µIS>sæO¡“p˜¾†Š>ñ÷<,>Š‹AØùš¾„|“·¼I€>jÓCOo>smwI¾† ÖëBÜ>ŠJã´^ľ„Ž"†^r>lþÎÞÖí>r*åC_~¾…¬òÂÎ&w>Š ¥Ÿ.E¾„‘R»ØÉ>myÌÚ á>q+ÖeB¾…. á>‰ÈÃ!3C¾„ªÂÂ.‹w>o1}»U¶ß>oʺ,$o¾„£ŠÂ)>‰…§š£Þ¾„Ì°+5\P>p“áóÈ’>m³Mþ@¾„ ÁÐk7>‰?qé·‹ß¾„õµPMˆ‡>q¬TZO™ª>j-°«]Χ¾ƒhèõ‹R>ˆô­@ˆu¾…$HU’î>rà zCX2>fú{HsÀ¾‚·$Y|÷>ˆ£Ø?º¾…VÊù{ý>t,ÂZjÇR>c„ûµð¾ö áÖ/>ˆKSL¬!ܾ…‹dèp»>uÁP*“+>_œÊ-?Aï¾&t²åá>‡éQ^6O‘¾…ÀCÈ †>w)€¿!Æ>W°,įd¾€E¹N²‡¯>‡|BÝï+¾…òÈô ÐÛ>xŒÁÈ›->N@ZE ¾~§JfmœI>‡ƒÊs6¾†!+•[ >zÄL¶>9ªY±¸!¾|žÜÍêÃï>†wÔóŒu¾†HÄa9>{»(»œu ¾'f­°s¾zpÏmöÚ>…Ý<§+¾†g›ù>}Zp8ÅT%¾I)«¸o?ƾx8Ã[à2>…/O õÁ¾†y6&–nP>~ø|Ò´5a¾V¢ƒ¼Æ”¾u m s^l>„l1Æ;¾†|o?î.~>€Gê½]å×¾`!n^».¾rý8Û­n³>ƒ’nçøš1¾†mÏ™t> @âan*¾eÌ{¿!¨¾p3 —Ý]Á>‚ /ä›}¾†JNjÊ:>ÈñD«Fžk.tã!+Ⱦj†\bˆ…>“êO§x­¾†àÀµêè>‚wÐú;Œ¾pMãí¹Y¾d^aɸ­ >€lhÒ0§¾…¸‰IrŽ>ƒ>ÍZú¾s·?Æ{¾[çñŸZ>~Q‡Q86ÿ¾…Dk:ö®u>ƒž/Ò?V¾u±šd8¤`¾M9µò¥'>{Ð6zõ¾„¯¢Èm¦á>„GŠMà ¾xOİ팇¾ ˱/(¸>x–‘&0-¾ƒ÷³¾Ð‡D>„a[ˆ,5·¾zÕx¢ãé>J',É%f>ucÁŒíe¾ƒV¡K3{>„“%¹_Ýã¾}93Y\™>[4ºv»‡>qúmy0Ò(¾‚ª2¢C">„ŸzÖ÷N¾pá¯}‹>dµë[™d>l¼FEõÀò¾€è^¸ Ðo>„‚PÛÔØ~¾€¸Ø£ð°>kÅÚ@|t>e'ç…µj·¾#\`šëÐ>„7ÈQD8=¾˜/‹òél>qXüÆ£ž¡>Z‰ºrOß<¾|#üÀÒÒ>ƒ¼qFq¾‚PÀðþåt>t²Yë°®\>D+là ¾xÑ›¸+~Q>ƒ Y–Š:}¾‚ÜÁ@@~>wáO”ú™¤¾91E±#ç¾u2`=v2§>‚(% `.G¾ƒ6€ /“>z×À€¶=M¾Wdˆ¿À¾qJëâO»O> V´(ô¾ƒX§£ïv^>}†ÎjÒÖE¾cÒàÝ‹ßÁ¾jFd¿‘Pr>lѧð?D¾ƒ>?ÁTε>Þý‚Ü˾kúa‰³˜s¾aŠá` L‹>|SÏ +~/¾‚âúNôáÀ>€èfV| ò¾qêý—5—¾Pù©›029>xÏwðœN¾‚CwšhƒD>¦}{A¬á¾u 9f¡ØŽ>šñzÔÛ?>tæ|N>%ܾ]_þý‰>‚"ny]T>¾y 6ý²ÙÎ>T,îYÊë¶>p¢Ž>s³¾€/±Kz˜>‚U“ì;Dæ¾|êQÞT>cO—ÑZ0Ž>h!©µ¦v¾}v'ó¦>‚:1Ž(¾~¥bï‡-Õ>lC;àÅ/>]”ü™ä¾z´+Þ>˵gŸw´¾€XvÍbw>r`‹Örñ>BM;Îú¾vG'û[Ç>'‘žL¾¾uŸCAô>vK&¹¾F>~#m¾q©p„hž¬>Öâ{iZ¾pß-¶0>yÇ,â™S©¾_Øï<9ð¾iÀ¶’r>|ó/e¥¾tžɘ>|º›£þ`f¾i<×ØGϾ_+Ý.¹>yjP%Åؾ©x¡ÁE> b5 Ï…¾q5ÿ|X¾DPÁ!å>uHÃcóR¾€OZ—Ç›e>€R¤¶™þs¾uh|ó5>F´­HNÙ>p ù»¾~G;©oÄ¡>€¸¥±uìÚ¾yB^Ã"ø>`C·9µ,>gí.Ó›¾{(1U•í>€°K•–B!¾|] HŠ›>jq‚ùú>XŠÅtS»¾wM~·@]>€4Nl¬W¾~_úÖ*' >qô¿Š·>!Á`ºÒ_u¾rÊ?žëdµ>~…mµP¾Åõ,e%>v+ÏFyX¾T/±*[j¾kr=ÅÃÎ…>{º ,zYȾ€ˆ G¡>y¸×÷ &¾dýCû3 Ú¾`wþx  >x äCv‘¾ªŸ%ß®Î>|vr…Ž5F¾o7æ?o[L¾CÝ«Aæy>s¦¥Mÿ¾~{ði>~D9Xi榾t3üûÉo÷>JÆCòÅ·È>m!,'c6ξ{x%gº§>Þ—o6¾xñBM>w>b`‹ïÿ>aò@Eú¾wãÇÅ¢ò>~¯ZO劎¾{:ø[’>lØS`Æ:>H}/'\~¾so3¡n>}2š‘T,¾}—}çà >s<5•þªD¾G£¶Nðe ¾l{‰C|¬l>z”úò[嫾}ô±…XÒ>wGpÒml¾a­¤úJ0¥¾`ûŸòL'>væ¸Ôõ=d¾}–›¯K!>z[ħÑKh¾l®þVϧ¾C>F»w>rE‰À+p¾{øÉfRõ>|NEç’Ž¾s6 ›µZ÷>Nÿr>i¹&à>d¾y!üúk„>|þuŽ¬µô¾w4í%XV>c|kì³H>[âð²¾u(­Ú¥Kv>|Y /U±¾zÆTEÃ>n|4@'|9>#Ïȹ ¾p3R[¨;€>zZQÀé<ý¾{ÀG÷l§¢>súó©õ~¾V%Œ|<Ú¾dðAŦÉß>wTò’ ¾{ÿî'wVð>w±Xξg8(+‘˜»¾Pï2ˆŸk¯>r›ÛtôlؾzÍ á§)>z'EÎ<ñ¿¾píi¤D>A‰Ø›ÖÕ>j`§ ª[¾x,šÈËdÊ>{0×\ÿ›¾uK^èĺ>`ìŽÖXœ~>\K¥ÖÄv˜¾t9 ‰=›>z´MÃs¾xpuH0>lmókpb >"ü}9ôª¾nE/`ÊÜÌ>x­j`Ⱥ¾z$mHJJR>s ³0»³¾W…½Úê¾b\ð:€‡Ú>u0$öúʾzB„ î>vÊT¿{|¾gç"Ãò°M¾E£ž®¿‘™>pi”KÌ—p¾x½¹¼%1>yZ79¸¾q9g±eµï>O,| Õæ^>e>P¾öáé¾u£ìV.’^>y >ŸPŒ¾uUkÞX>dbˆñRÅÄ>P±@@-‰)¾q|BÎ>x€ÎÃÍ̾wøéÙº«Ä>o~GÞ© ¾Død¨é¾fî~j Ó>u±“~³¾xë^¹ó¬>t&xõ‚lä¾aê|ù6-k¾T*rŽ‰“>q[ŽÏí¿¾xó5:pÏ>wË)ú’˾meÝrU>;"ÍlI¸Ø>gš2çí¾uo ϱOÁ>x7X­:Ük¾sH`ö)>`|Â=La±>Ulú$í|¾q.é#ŒFÉ>w(Ë”«¾vSt“sÁ>l,1Vg•¾6ØtjÎd¾g;"Fd,¼>tê`?î¾wч¦¤v>r¼‹¦¿^ ¾`†èäÞƒ¾T #7Åh>p¥¦šTI¾vÓ_„ù>uȾÈ8¾kÈ")²oä>:¸kº7/>f^”2bQ¾t)Íô›Ž>vï{íuóM¾r~ÌòÜ™>`Ž´¢š>QèÆðÓ‘ó¾o† ƒf>v  N¤¾uh€©h~¸>l&ÛS6â/¾CØÅ0¾cø€ãŠHÜ>s,MŽô¼^¾vTÜ÷Év(>rƒ_¦ íˆ¾aæe†¼x¾JÅj7—È>mE•Sý¾u$@ÃyÎð>u%1V"¿M¾m+4=Šú#>LHâ92>a臻6¾qê“ ø ð>u¯LD¯¾r¸n`áJº>c÷ò »Ä÷><圦};iâ»~×;>t "ÝǼ¾têJ}†>n­‚`%Ó-¾TFÆ¿æm«¾Zϼs2å•>pXÌ!'§¾tè®ê8‚>s§\ª@S¾fœ‹¹]ǧ>È–²I>eí$A?¾rªüçÞŽ3>tœ±©ëƒ[¾p<Ñ™ÈE>[°èàNë>QÐÀSµ$R¾lÏji™>sæ¾XÑÏg¾sKøçb 2>i¡¦n¾C¼Ñë>[¾a$7îÓ,§>pïøjµ¾tc¼S³>q&’~|&¾bü(„V¾=*g8 `>hñð0¾rŠ¬ jÑ>se¥ŸÁýQ¾lÂ|Dqç>>T.·ÎÖ>>WÖf ʾm„ i@½_>s@Ûí󋎾qëÃ|³E>fbÚ6À7¾29#³Hç¾be#".¸M>pµ7…_¾s'"ëd³>o«G¹Æb–¾_%4T<ù~¾D`®‹ãðï>hD¿è.>¾q娧î—>rYªç[Ⱦj¡§“hõ>QV—Ìv^>>WŠî£)7Œ¾l“ÌÞú>rasz²Xž¾pùJäüg>e 5Ž ¾/z9®pO¾a”•.™à>oÉxº^¾r<ñÒ9Ü>nP é2/¾^lƒ¬µv¾A50‘ï|Q>fl¬9›Û¾pæ!źB>q­(Íß¾jÞ4xý>RÁ/e(bì>Sñð´<ܾjCJpV>q\‘¸“5¾puJ)»>erJ°*Ë;=ÿª£•¾]ßpr~x@>m '†,à¾qX€#h>S>nãÑ7̾`«±y ø¾(4ÔÆ3%_>c#àé3)–¾o¸>( >pî-w¿~þjÄ­ŸO>>W×@Bdw>I3VÖÚ¹m¾f’ß_Ÿ/>pÅògî¾p2?×2Èp>g3p™5O¾M^­€ ~¾UTYÓáŽ>iC¹1 ‡¾pKiSu´>nqç€> ¸¾c†Ý;4v>8ZQ 7$ä>\lŒ²mNº¾kCð‘$>p1ÊR+$ ¾l*fëuöä>_À-)ò{>ª>Y„f¾aMé#j>l¦. A¬‹¾o·qÃ:)>i°_Á;X³{fa¿¾A¹üÌr>c×í"áþ½¾mÌåC>n¯bjz3k¾g )£Tø>R¹Ï >N)û¿yz÷¾eÞcÉ‚Í>mæÜB/ç~¾mgZåM3ü>d“ŒZÒæ¾Gè¼ r—¾Tr=ä­à„>goD«Tz¾mòkài»>køþ]Yõ¾b}…ff>9ŦÐ.Ë3>Xû ?i\ľh˜ÞÚ ¾>m¸ÿÿø–¾jwhÐ¥P;>_žQWШ¾é"Ç’¾\¾rW}Í>ik¥s‘;¾mKlrùê4>h÷sÊVAº¾[d˜÷Ƚ“¾%>Žòì-_>_Ë´×ÿ¾iõQý—“>l¾¦LX0[¾g‡kCÛ›>WŸXÁ >8óSK/ƾa.Dá˜m>jFEŽcľl!þÞyU>f3i•\¾TWâìs7¾BeÕŸÇ>b§“!Te¾jkIÿzàC>k€ &ç3¾e&D>Q•&©C¶>G$F;UY£¾b´nhËq–>jp2rü¾jæ;fKÿz>dÉ‘‹\‡¾N²/¬¼¾JÆc+îºÉõ¼¾j_ˆQJ>j\~‚¯÷i¾c.òݪ>KGÞ”y>M^¤¬Uíò¾ctãòÿ>j@&;ÿ¾iéCüZä\>bhj„¾Hè@ÄùêQ¾Ný¯¦å}»>c•i_ùß<¾jâôb¸Ö>i‘ƒ'²”n¾b(y—4­'>GŽÏ#Ñïr>O²ªÙÕ;c’ˆ±@nO>iðåìÕÿ¾iX*v{Ø>a÷FξG6h§éU¾Oˆjd:ˆ>cosêÚL'¾iÈ·5%>i?šÎÔú¾aýÀ§ªÊ>GÚOc½¬>N†= ¾@|¾c.#Ëâ>i seÔZ¾iF(Žió>b:sWˆ(¾Iv„éƒÂ¸¾L¯¢.¾Fœ>bΩƒ¹Bl¾iye©´>il|Ìþq…¾b¬‘¡ÇÑ>L5+¨‘Õ>J#›Î^¾bOÞ:C¸>iQ`}“²Ö¾i¯£¨>cR(„ÉÙ¾Oƒ±Mã¾F}÷ôŸ">a®¼1#Äù¾i#ð"5>>j J³u¾d(õþC¬>R©åËS_>B FÌv¾`ç,T”D>hëáår섾j||Ö2%¦>e-œK8´¾T·SîE¡I¾9xÜæÒ&µ>_æ ´Æ¿]¾h¢pn >jú•?æ¾f\{-a>Wããó 5N>)˜ËjÊã¾]—@=Të">h=âÝ´¤¾k}õ@·ì>g®õù¼Ç¾[†~÷Þ=ÿÓ°ùb–i>ZÐú}‡¾g´´þN°«>küÂJ !ù¾iaŠFÁ˜>_›ûLó¾3qfŒòá¾Wì-¢>fúkÛß¾lj¸­r>j¤fTźî¾bˆ[œ>C2ÌŽ€l>S“ƒ~ …¾f/Í‚œ>l¹´Åº“¾l3 `xá>d€~ïƒÜ£¾Nu²P‚¼¾Mè¹ö:«>d¹¬Ûß¾lØÆ1‘K¤>m½6«v9ɾgI%º >U"PŸp¡>CNø+]j¾cl´Õ,´¤¾o1ðUð*Í>i×Xx¸+o¾[Ó@=x*î¾*¨ý©µ>`üTDD ¾l7Þuii>p>!ºM£ ¾l£1Nª<>aŒuP1û­¾.± êÛzñ¾\Æ!aUT>kIÕLbvG¾pÁÇ›ô5>olª-gó¾epøÃ>†æ>GÚ+ ±ý >Vlâì÷¾iÐD€…¯å>qUFŠ¥Þ¾q ‘µµP~>i‰kËñµ¾Tö¶,`«þ¾M•ÆU#Kç>g¯ª?"Û¾q(Du›þ‡>rGíòž›ø¾mÁ ÷M¾ú>^éï ‚V>7#˜Û—«!¾dËÀpvçô>pç캾sR³-kû >pýÇ[Q¾dÖ ŒÕû >2§lçÀΧ>a ¥±#Z¾p@;á7gÏ>t·fp7D¾s ”@?Ö>jŠ~HÃ#µ¾PW †?¾X¢1æ P_>n7ØÚÁ<¾t}qA î.>tì+RÌç/¾p8ÅÑ~åÖ>]ÖfþAÐE>J>õ!lÅÚ¾j˼0‹,>tgYh%ꆾvˆ=x®%à>s.¶ŠX]¾f*zÿñn>Éb>f'„¾Ö¾s¶­˜éê€>w»@ÌWb®¾vç L7Õ>màòTèì5¾PQ~f'ž_ß;P1«]>rK³ðe-¾x]yÃ@°>x ô]® ¨¾rë°ÑUÎ0>a ç˦Ÿá>PŽ¾-ÿ¾p‘Ÿé>xCI÷þªw¾zÈX-ª>vàŠŽ½[C¾j¾ï2$>‚Ó>Œ¥>i°¹­Ö¾w>…€³ñ>|HyµWËå¾zœÒB^%>r‚r(†é ¾W3¸™™À¾a—/^(>u!^}ÏYì¾|ä44þ]>}áõ˜³7"¾w¼Ýd7¤0>g”v”0s%>I»rÜ ¾qÁ®¨->|YÓ«x}û¾€2­Íç$£>|̱„þrD¦S*ôÜ>I^8 hé>iüÍrŽ¾zg hnûì>€é®GÖ&¾€®Í“±ë >xüÏ—Iˆ¾eEŘA¾[ r‡S>Ñ>vÍÕ¦°þ™¾€å×Ó¡¬c>‚„Öúa¾šÊÆÚ-V>r˜Ñií©}¾-{Ä#³¾q[¹»&¥ê>ô<ñÔ&¾ƒ­œ„ â>‚Ö$6¢#@¾{ºháü%>càLZµ$/>cä/-“i¾{óþ(TÞ>ƒèí-ÑÛ¾…R«¢œoS>ȱž[¾t¬Tõô¾"ŠùB>u{bÉÃJ¾‚ôÝŒŒ¡—>†ñ¨T’„¾…°yþÄ>~¸'ª©Rc¾e>¼úrB¾hÚs?‰ƒ>€“‹9E/¨¾‡Zï¦>ˆâÙãÊü¾„³IIý9b>w?§ Ž!>'UÚ© û¾y$ÄÜv¦w>†0q­ˆâJ¾ŠðA‹%m|>‰›;Ò~¼¾‚Xÿôì1>j¹ˆM‰”(>kNNƒ±kñ¾ƒȹcÍu>‹\Ú«ÓF‚¾ ¹ >°>‰íVwI¾}Rn uø>4ç`˜5»>{Ç·šg¾‰ªãßã8Z>ëºû.õw¾]óÝ`¨>‡!µ¾saΡæµÑ¾i\ ðã í>…f|Ær…P¾ì?£‡9>‘Þ­}¶õ;qmAùéE>ƒå, ß¾[ìÝñö ®¾|k>܉ºã>@2|©Ó¾“¥†YöX>“_nÈI¿¾Ž$¦R‘â>~¤Î8•Ÿm>_]PvÏÔt¾†ëN…™äN>’³¡ (ÇŒ¾•ý4`È>”tRu¾ŒxÉ0>rÀ§2˜ØÀ>y,Žo±×›¾BóëÐÚ>–ôÅDPÈ羘ğêi>• DÔÔ¾‰;Á»¤¿>ODè祥>†ªO›ì.¾•š¡N„¥®>›zŠ¨ˆc®¾›{'4‚2o>•`\o²{Ǿ„‰ÂMLnϾl¶ž×ð€>‘?ËŒ@bÒ¾›¯8Ѹ<Ñ> 9˾_¾ž?É)sB>•@8/Œµ¾|„RýdÈZ¾‚}/gZV™>˜_ÎÜ&%+¾¡oÃwDy>£_çy\¾ £î«d >”Á¡¾gËÊÑ-I:¾qA÷—щ> ªž`qÅX¾¥í±F,‚W>¦¬#ýå˾¢xÂ0†>“ßšÖ=6>eC-tªÜ¾šÐÉ­µï>¦­E¹^Ã{¾«ý ~ˆã>«„[Ý÷ü&¾¤òÆü?¹>’…"ÄM¤Š>…•ým2¾¤ ì­›Î>¯Œ:2AâG¾²‰·ßǤ—>±to 2B«¾¨Í!>é ,>YáQD:î>˜¿Ï·ä ¾¯Â«=™¯>·Zd ^Y¾ºƒ >¸±¹mg¾¯ëYªØèû>‡¹ÁKBô>©ŒÑH ë¾¼IenÅ}>ÄA«.Y¾Æƒv}4\>Ä'¯†ñŠ¾¸Ÿ¥ã¶ÊÁ¾| %'­¾>ÂTìéX K¾ÒùÜCî4 >Ü?*7›C6¾á4ª)2,­>àrŸú=V¾§–~¹O¿%4úDƾªhô·q±–>à_kJܾáŠR º&Á>ÜÒÜ-~ä¾ÓMuÕ&%8>ÂIsf/Õ¾M#e‘®¾»Cr\Ê… >Ŷ¿™­¾Çè(-ÊPj>ÄíeE¿¬c¾¼f@ësÙ•>¦L–Q—œ¥>˜ ‚€dí¾³É›*Ll>»ÊTŒX"ñ¾½÷M¢Í>¸~’¦¨¾¬ÿnœùR>…»}Q=@>¡Ir=Rp‹¾±(GÒžy>µA_[Ñ÷þ´d5Ði{#>®6Á‘TV¾›jZMñ‰2¾‚íâúû݈>¤ë¬+Éκ¾¯fçV¡Gä>±S@ÈZY¾­i-±P1>¡Œ=†í“«¾ue2£c澘zû³¦ý>§9-—$Üƾ¬w;H0<¥>ªÐÁè€Ù¾¢ô*VJ’k>‹êëu¼\>>ˆ€ÿÛ\9価8Õà”†Y>§ÀX—Wx(¾¨SRÑ—/æ>£/Øój¾’¢Z —2¾rQ=¼>™Öƒ¶b,–«áJD>¥ï¾X¹¾¢a“åù>”ÄúEÅN‹¾ZÀUZᾓê0èY>¡*º3{p¾£ÕˆÆ×>¡gœb!œ¾•?Ÿ›Íù>e5Òê^Hh>fi‰B¾ž9s9AR9>¢ ´äQ˾ JÅŽ½¦~>”Ÿuÿãa ¾l¡É÷"Ò¾‹÷w~ÏŸd>›qÄþŠô¾ «Ë ò>žDÆ¢n³þ¾“7Rs¾ó >jCk×y]>Š[Ãeƾ™¼ÕH&Ê>ŸjBùÕ¾›æ1~‰î>‘2Òø¢¾`'wåϾŠÐ$ÑA¥È>˜Ø]Ð'£¾6&•ù d>™iS" þ@§™Îw3¾€bÕæ>ŒÖㇰ×¾˜öQͤÿ>›€Î˜x\Q¾–®à¤0êo>‡ˆ"ŽçŽ>eì‡NÇâ#¾ów‹è v>˜j¼M¾º•¾™´:¿Ù}¹>“Žñ¬Ú¾gLÒe¿¾wÐIª §3>‘ÏÅúBý¾˜Hõ¼'c>—Š”‹Û+¼¾Ä}öÜ>m3ƒÞ€™À>‚ùùžÒ ¾“ŸQc‘ä>—Ãê1ÒRE¾”¿¬PÁ,>‡½œ¯+Ž>PÎé• ¯IL|r¾–/9Ú"á>‘=ÎøžzΡã,¾w© í¯qr>` Žü¢Ÿ¾•¨f}>©q>”+¥—,W¾ˆà„«‡¥,>M•}YQ|œ>…|…jÏ0¾’è¿ÛZ+ö>• ÌÛ²±¶¾‚ÅYÕ>{@ÝMIFû>s¿Ü¿Æò¾ú°/\>”%Õ»þ›}¾’ÍØ -Œh>†àÏWW©ï¾>¡ç¦¾…tMUÌ(>’åQ°šC¾“’[‡VÞ>w›O7œ;¾t…òN[g7¾x;A•è>ŽJõ|RÕ€¾“'Ú–‡£>ËÌT™¨Õ¾Èðͤ@¯¾^F/w^À>‡äéœ>&¾‘é¿û øS>‘ÒL%Ý뾇zå&.œ>\veªsq>whb¡ŽÞ¾+Ui£h>’ Cün%º¾‹€óñoÓÇ>s/$ÿ%>vé ÝýѾŒc`¾ÝµŽ>‘²²˜"¾ŽC¡¨>|ážÛc>h|x×4¾ˆc ‡ƒ›>þoãgL龚ãe>‚#øWOzÊ>I¹D§™‹¾„¢ÉÑ^”>95³i¾"+:žÿ>„Ö(ÔßaW¾Pr`B±˜[¾RS•?!®>ŽWã4WâȾ-µO°›:>†°D¸z¸ù¾c‹Õº8G¬¾}äÎj>Œ”Bš3¾ ;œÐÐ>‡Ùý²†y¾kÀ“#kë¾xÐõΰï>‹R×Ìö¾Ÿ<k£ù>ˆu½=K ¾pŒQk¢hý¾uĉÄöÙ>‰ÛzÝ=é]¾ÆÛf>ˆžfí\Äõ¾që?ªÁÉh¾sò~Tú‡†>‰B¼-œs¾Žƒèº4•,>ˆf—î`¾rF:ñ 3¾sQÕ$")w>ˆkÉzù¾ù+>J>‡ØQãëÊ9¾q(d&6‡¾sБ%"±O>ˆt‚àò•&¾qH¯;8>†öe+g1¾nQBö¾uY¶1@¾>ˆ¦Žçz¾Œážµ*m>…¼€‘¢„¾hD„ ݹ7¾wÓHMÈU®>‰JOf»q¾Œ9en >„!3Í&‚+¾`7°0 ]¾{€±3â>‰¥:Yw!G¾‹a@X†ÿì>‚Š¬ZÑ@¾Hí >Ê»¾ Ölù^‘>Š:?®h-¾Š;æÈ2ê&>"ÐV —†>FG(-m9”¾³$èë>Š­ŒBlt¾ˆ©mX—ð>y=¿æÛ>böH L ¾ƒó#v&‡>ŠÓ?ýY–§¾†‰…El>qÈãÃ7Êz>pÉ[¶%ø¾†£…©å»>Šz©`ç›U¾ƒ¼}üD;Ý>bçCë—²>xjfº'¶V¾‡èø­·>>‰q tûÞ¹¾€-L÷íoM>`L3£H>÷þïôI¾‰&ñÿÎÄ8>‡†4ýü @¾w¤Uæcˆ¾c¢è&bk>ƒtke˜¾‰Œ9N @>„’¾m¦¬¾jÖOÜRÈž¾t`w×ã>†MáõÎÆÒ¾ˆÔ9ªDÔj>€€0&Šž¾?Œ°7?†²¾}Ë݉*µŽ>ˆ,~ÿnŠ¾†Ä/Þ2>v¥â±×>dSo\‘«ö¾ƒ+k5Fz4>ˆ±¢xõÅÞ¾ƒ6ËO_>dÅp­›>v/‰"?྆ZS-r¹:>‡ŒuÜì¾|RÓÁ5ʾI<ÂBè>€†aÖ Ìr¾‡ö‚ù-y>„†µq¹û¾o%£ù;gˆ¾pâ¥Ávÿó>„Ä…DáäϾ‡’?Ò“o¯>-Zà ½¾/ ånó¾}ŒH éþ;>‡1agè\¾„ån™J&>qì`…>lM6œw¾ƒÇ;šNß>‡Ag“Û®¾ÍÄŸM:8>B =ŠC>|" À¾ŒN¾†ªV—Ùb’>„œÔ)ë!‘¾qÆÞ¢Âÿ‰¾kéÿc­>ƒ€ˆªë¦ì¾†ÆÔìœ>~ˆ=˜Y*¾1sÔ!Þé¾|Å£8µ>†lþoŠØɾƒÀ«e‚ô»>n¡¶½æv;>p¼©È½¾ƒÝÑ°¥Ù|>†'HïÂs¾{dG0Bi:¾DsüI}ËÚ>-Mó¯ÿѾ†QtuA3>‚6×y?:ø¾e$ê83•a¾tXœA>„ ýK–p¢¾„ýzGõÅ>v/.¡«ËÀ>`ÓUl*ãî¾eV.Æ©z>…ÿÁbåi`¾…¹2Їh>LV 5›;Ù>záIRÅô¾…_ßÂ. Q>ƒn® û¾mD‰Å˜Ê¾pPl CQ>ƒ\q…7Ú㾄úPs€Å>x4ˆÞqè>Vvº@S¾€D÷¶úÈ>…ƒÆÄI}µ¾Õß·7Í>R|#åšã>xÙØô¹X¾„Õša(]{>‚©lÑr¾l V¶“¾pOÿ">q€>ƒ#k&º¾„SÓØvz„>v?çÆ}¥ >]û (É€¨”ÔÂÚ>„ú»ô\\¾|þ'tJ4>1òãdÀëA>{A'¾:&¾„»°co–a>¥Cm¾bV1Û¾ñ¾t‡»Ä–Ha>ƒ¼.Aß¾‚äÓ–·hâ>pbUÅ©jU>k<®NÒǾ‚$i‹ôh>ƒù¸o]¾vœ1rˆ>¾ZR‰"Aüq>€eDk‰Ð¾„f]ØpRQ>{Æ`t‹®®½ò‘Ÿä5u.¾{™š-‚>„EFvŠô¾àÇiÙ>Xüc(¢ws>v¨; j?¾ƒ°\[ÕÞ[>|uŠÝö¾g¥y x&Ó¾qŸ0zÄ‹æ>‚Â,=¾‚“]Vv¿Ñ>p½.}ìN>iWö—ã3f¾“ÌÅ;¨’>ƒC„­‡š¾tùuøÊ¢s¾_Ŭ±„>€;êÞS¾ƒ/ŸêEP>x‹YÆ9 >LD>ÂV/J¾}œyö›×n>ƒ°Ý0ÿ—S¾{|ù.vY>‰Hˆ ±>z¶·Ï Å(¾ƒŽ{Ï Gü>}ܦ€ñ¹¾Pddtª'¾wᓃ‰ÕÃ>ƒDÓ›5ÕϾ»ÜxCâ>]aV ¿Ö>u2^½î©å¾‚á&5 A^>€”ôéݦ^¾dˆVÁf¾r¹Xr Í>‚nûã>Ñ‚¾?xAñ>hžX)4†i>p‚e¦p>¤¾øší>~•/\)§¾lm7üõÏy¾m+¤zÂ>„sY!v¾ÀOùå& >ox8æ„>iò”™¾xÍó(§>èÊIuìà¾på¦@¾Z¾g^†ÞÈíÇ>€¿)ñf¾ý@{Lv«>q¸Ù2kw9>et(Å·Ús¾€u¡ùþ“K>‚¿`Ÿ=á¾r:šo#’¾d3° öÎ>€@ŒÙ"O ¾ù 6ä¿(>rn£¨ å=>cœd4ò¾€ æ³^äE>å Km4¿¾rWÆÙwaC¾cª®ÿ%’Ù>€ÀZ°çâ¾Æ©Í 3>q÷€þä0>d[ú•©R¾€!-Of½>›r¶–Õµ¾qN3îû”¢¾e«`‡Òð>€>L¨þ)Þ¾c¶”û)n>p[A-üEl>g‘î´¢ŠÊ¾€kIÂ{èa>0jI5â¾n:nÀ‘øo¾j¨©÷O>€¤U®nÁ7¾€ÁZ£µÑÄ>k$Hö“±E>m:Ëþ+¾€ä ÄÁjY>€Nå›'jK¾goü²œ¾p=YcÊq>&UôOR¾¿9ĘŸ>c1¦‰ïŸ>r,AiïH¾b›g}6>~ÈîMV ¾\BË«µ0¾tDäYs“V>‘—oÖ”¥¾|l±ú²V_>Q?.µ >vzE%.ÖŽ¾ªhúìZ>zag8$:ö¾2Šf™A'b¾x¼ƒkÙ.)>£¾î`p¾wñ°KWœ¾AÑÏhr>zø’rßšâ¾sáÿb2>u ¤«V8>Wl•Ú‚‘k¾}h¢<>fÚŒA¾qž<å¹A¾cX®¼œm—>„Ï:ó¾€jFlQJ>l»‚[>k5,ÀŠ¦S¾€L/ÉÀ>~ü(8¡^Q¾c™*¾qCC œ>€Þû³S&Ó¾|‚jžü½>T½)Èu(ñ>uf ®“[-¾)/?zˆ>y[)YÎ%¾ ad#ؾy\‡z>ëÊ ž7¾u€dvâÕš¾Sßž•œ¯>|5ŒßäT¾€¥VPÍÐ>pô3ñ©ÿ>d9³ÜÔ ¾~ÖÙ„s@Ë>wƒ2àì0¾g…ahÍ(¾o B_⊠>€[9­¦jÁ¾|ª /ÓïÉ>X¯»Ê³h>t‚˜òJÙœ¾€Ó4Úö°Á>xÙå è>)ÓT„(¾yå¤n >€¾QiþlI¾t ¦Mæ¾Zί(ôT>|Àõ¶7dP¾€ PÇë£>l§ Ͷ>i¬¨Lî/y¾è ñ:>}]ÖŠ|âH¾_^墦þ¹¾rÕ)„¦3>€38ìé¾yL¿ÐmŒ>*7rÁ Z6>x*å»ýl¾€‡#ƒN2->sïÅ3ã\>YÆ£…[¾|}xß©S¯>|gYŸ+©¾jÞ÷îEÚâ¾k( N7>uÐ &]i¾|9:ßTÐ>X0¨¥ë¶>t)F–âwL±öÂ>=èw†P9¾y½^¨‘Ëa>€.úÅö¾pÜ^â.¦Ö¾c¸Øc‰H‘>}Ý“óúǾ}”æ#}Ï>bi2qfÛ•þ¾€ GT>xñúÉ$¾(^‹W¨!{¾wèã… )>€zNÉ ¾ruCIÝì¾_¨.(O>|ÓNùEx;}í;eµ>dîDM(¤>p*ÄðHZ¾¢l­"ÏÔ>yG×~kl!¾7ë)Ô$ݳ¾wJÍ=„>>òop2Ǿr{^"a¾_4’G>|˜œ÷ƒPÚ¾}ŒÅ³@!c>cñ­u‰>p„¥¢R>f¾yj”î>xyqSJ q¾IG•Í¯¾wèÄaõ«>|1ÅÑ¢¾q3LIؾb²ÜyUl>} û·Š­ê¾|q¯Ð÷>_¡W´ªô>rU¤0·Ýp¾(áŽL?>vužÓ °G>CRÇc’xæ¾yã‚Éó>~šðÅú;ø¾kÿñ‰W-‰¾hÿ"„®ä&>~ÿœ`tؾzTü†ÛÎ>NçI­ô>uS&ïöÚ˜¾NðØÐàõ>rû·%>[t™§+ƒ¾{Ç|pL÷Ý>|ÓŸ¯ëù¾b†#Áãž¾pèkã ¶>~ï2?›w"¾vÃ>’Ã)¾;Ê.†KÈ>xõ¦×Vúü¾~4ÕÇ&l >khí‘Ù©>iMT´N*¾}ÚQG’Œ›>y|^ÒÔ§î¾E®sæãÔ¾uÿ±©±Í7>~Á?Ž,¢¾q7­³m)¾a”Ù òÕþ>|c?.ø¾{VŸ¸+ÿ>YŸhí0>s)é<˜X ¾~½¸g»€‰>sâòœ‡L->Uã#©dÀ”¾zͯìRÓr>|‚zèÍꣾb±¹Ðl±¾p¤´‰ÎUø>~f ”÷¾uÓš;¿ô¾F*M™£>yM“ þ¾}0 7Â/>g"F6¿’>m õ–0¾}ê‘}ønë>w'ÅÝåzÁ>&òX‚Â…c¾xWô­>}…á½n¾j>l¢+;¾¾iþ‡šîÛE>}o…j€k¾wú#¬ú|Ö>%ú Ú»>wêDÀ̈¾}¡Þã|Œ©>l!)”">gù,'2õ6¾} ŽrØ…>x_Q8,øÀ¾7>¹VxŽX¾v‡Ö”±`Ã>}—õsà5±¾là˜b‹¾g—P™ >|Ò“í¶Vs¾xd}f’kX>9‹>"hÂ>v`ù#ooo¾}r0”Øù>l‹§?”>gX(]çi¾|šá̓>xè” K¾2 ÕqÉ72¾v §AC‰>}0¤ »ä¾k%;»/–¾h±ºÑµc>|Øi=Ú!¾w\%Õø_=óFjBÑXï>w> ”Û˾|ʲ#Þ5L>h«—à ´ñ>ky?\in¾}æ†aå,>vB…ŠúÊõ>8ÿªÛý¾x)j°1Ð^>|.ø &!¾ee‘÷ ¾nc¸µÀÙ>}4MíÔ6›¾t³R¯Ê•¾N·ý+>yJ­‘뇾{D°3MX>`S 6>q<Óy¥ a¾}DgȹÛ>ršô¥¿Î£>YæÐC½V¾zc”où>yíÒWξTÄI[w^ˆ¾säʵ>}ªAñ0¾oÍ P ªK¾cKk¤P»>{£ Ù ǾxØ4ÄV¯>:‰ çºã>vµë˹¤¾|fž…ÇD°>i .²#Ä>jT¢¢x#E¾|}ý¡Üa>ul%.Åš±>CÛwpûÛÿ¾xi@Nw0>{ œËŒ¨¾`ÛIŽ{ܾpÞÜfA{j>|Ô‘9á濾r­CdZ“¾\*ìà>z~¹Ã„îv¾xôC@\ö>M$Eæ0})>t‰³“îÙ¾|e¹QÁk>ke77Î¥º>gÀR19¾{ú•ºÁ/->uËç@9×É>;å“Ç®Cß¾wß:L®zê>zï/%Ïg…¾`ú³»¾p¹'µH¦>|ŠòÆ‚¾qnŽõÏ\¾^&{Ï͉Š>z„T^Ü{=¾x5ç-âÖ >CȺq9L~>u;AZ?ià¾{ØÕ(´Ã>h´tKfì>jÛÃÅÕ¼ª¾|히Ç>t´|o•>P}³¨ßB¾xõÎøõ•8>y›ôºc)¾V1»pÛ¾rüA?zô>| ¯¢`¾lêTKaC­¾e×ä1>{i)hÑ(¾uŸÅö·óH¾;ÆV}9`>>w©Ú.Á?2¾zO ,žƒj>^Õø‡¢Ž>qaýŸq¾|UËúY>o±íKÙx>b¦]ö°“Q¾zÚÄS>vdÿ{hhë>?z»^œE¾v×zŠGuôó7¾`ë~“Zz¾p ë-J>{ðþ»†¾pX¾w ð§¾a`ÈŒhÔ>zŒy½:¢¾v„Skþh’½ô-ÁE8â>v—*\é¾zmÖ˜É^>`Ù­º‰”L>p‡Òòë ¾{ÉY‡³ã>pfÍô8>b¦zŒeb X >v • Ys>(R˜fݾvêyÿGñn[¾]Ç8FÒ¼x¾qJ®í4^>{™t;÷1ç¾mŧ™Í¾dyé Ò^þ>zËFE^ñ¾tò¯ó'öÿ¾CAw`xíF>wº¨™‡0„¾y*Â^]¶µ>V[>­>r½›˜•U¾{B ùs™>iÅ,ý`>>h™ö-`y~¾{ 8`×~ú>sæî F>S䤊i%"¾xÛá©×£ß>wÆtç••ê¾Ež÷hÉÓ¾tµ6‰qý>z‹ö¨ï)™¾cãô²Þ÷¾n—ó>{K5Q¶ x¾pi?ŒBœ“¾`½&š`¸>z¨ûk ¾u˜IüðMA¾2ÏÕ9&$„>vîl㶠¾y,<Žl)>Wÿ:±7˜>rD3™mJ(¾zô¶P7>iQ˜Üº=>h׶Âvº¾záŸwJ>r_iºüúÑ>WRU9;뛾yzøÔ¯>vËØC‡Pñ¾0¼ö>˜u–¾u•pKÆ>y±*‹sÆr¾_Ñ]}z¾pÒÚ}Ñ>zï2Ë‚·¾kÆ#,Íúô¾f0:¿@Ó>z‚E‘Vbå¾s|"•Æ&¾SŸçÃ>x%f³œ8¾w‹Ö¨éU>;ê;„y>uq ¾ï¾yªŠ ¸>`N-ó6™>p‹æ!³¥¾zÅo1,^6>k–µÚ?>fEE •4]¾zbTrï£>r·FÀµ«>TÒ.Ä`8¾x•‘¥Ó§¼>v‘î†$M¾-"+íÆöؾu…Ï^¯ó>y/iç©^3¾[‹8à¨A¾qhY”Uœ>z|ÀA¤¬¾hØþÄ{!U¾húÊZ»>zuô‘[2}¾qD…𳃾\'ŸJ^>y)&6̘¨¾u6MÕÁU¾5tm÷M>v³pñnîx¾xÑ+ÉA>QQ+æ]y²>s>)ÐÁ¾yÞ1ˆ.–y>cnb/¬^Ý>m÷’C¢Åʾzuz»¯-Ë>m.ôÁæÙÞ>dIk 쫾yç®m1.>rÄåÖr ¶>SÐxÖ!íš¾xG;¼;[U>v7ËA‘¾¼ígNˆç¾u± þ>Ø>x}âéBå ¾V@Û}üJÖ¾rJE&/$Ê>yâW?l¾dðŸ”ûß ¾l{ï©nû(>zD0¶ö§*¾mÍH5Ô¾cuyJÑL>y«îºš’ܾr¶ÞÞc£¾SÁîËšT’>x*¢d;¾uÊkÊݽìÃu²}±$>u֮˛q¾xÑ÷p©>Rû˜"Ë¢>rÏýˆb§¾y~HöYÛÙ>bO«ì L>npWª&Çí¾zÉ aþ'>jú•&A¤Ì>fgßd#¾yÍÅðŠ 1>q-›\æ>[£§ò`ѾxÁ`þ5ö!>tFÉfh;¿>CáÜG´)̾výTã"9 >v¹jÍäÖ¾>ëT2']³¾t—Ê¿/2>x{&sfÿ'¾XÝ¥L¡¾qª,‹çˆ–>y‡jŠl5оd€š#d…¾lŸ÷ÉTðu>yßçê—Ÿƒ¾ká³Ðk¦»¾eKw½šgë>y‹4¾µàľq4dºGR½¾[Í4õQÕ>x”9w„¯¾sûR‹¾F’oîç*d>w i±…¸¼¾v9ž±>2Úƒ5Åæ>tûøvèð¾wéP}”©:>Séœ/ g>rÌËQ³¾y˜o-ŠÑ>aH‰¦EiÌ>oNÏéQ¾y•º ÓÄ>h¸ú-y>i±ýëײ¾y˜YÈÖßÄ>nFážç¦1>br‚HÒL×¾yÿ'hIƒ>qÝr—ŽË>W1Ç' •¾x’?(‹G>t1w  8>B¬­UŠÁ¾v±ÖºÈ¶—>v™èZßa¾1ž>øv*¾tæî…¹>w’Ë®°l—¾QÇIÊäʾrÈÜh,%>xœ”éaо^‘Í÷'Z¾pf;!Iq>y8ÊJ‹«¾eJRn½¾kšhk±J¹>ykF\ì°¾jÕ5ú¡k?¾fÕ´°ÙÚ>y9±ó}¾oÙb6³»Å¾`bæ,ªÜi>xªÌ&s ¾r%„5 k¾U$ѼÉlE>wÆ>U–ø¾tö¡1¾BüÚ÷¦ï'>v•U ûÞ¾u­D…×> )­-">u!ɹrÙ¾vøæÂ8Çw>Jm뤡`>srí+eï[¾wõC„!„>WýI;^)T>q”m)¼ú‰¾x¤)lä|ä>aw¹>>oÖäØ-]¾y¡s~n>eëðºï>jÖà„ÿ†V¾y&’Ò­=>j_27W–¼>fe"1§­ë¾y”Ïñ\>nrÁ(RHS>aØ©¢î8¾x¡Ä)þ,>q|‹¿‰×>Z€ƒ€é°¾x ›àj$>r³bk3>QR«õmê¾w?ÐrbT>t"îÚº>@‰u\j4î²¾d÷ã: ^¾u.‡g?.b>vc…‚´/˜¾B‡ïžh#¾sò‡¼ ú>w8ÿ[6ï ¾Q“dDªZö¾r›³·ßX澪hô·q±–>à_kJܾáŠR º&Á>ÜÒÜ-~ä¾ÓMuÕ&%8>ÂIsf/Õ¾M#e‘®¾»Cr\Ê… >Ŷ¿™­¾Çè(-ÊPj>ÄíeE¿¬c¾¼f@ësÙ•>¦L–Q—œ¥>˜ ‚€dí¾³É›*Ll>»ÊTŒX"ñ¾½÷M¢Í>¸~’¦¨¾¬ÿnœùR>…»}Q=@>¡Ir=Rp‹¾±(GÒžy>µA_[Ñ÷þ´d5Ði{#>®6Á‘TV¾›jZMñ‰2¾‚íâúû݈>¤ë¬+Éκ¾¯fçV¡Gä>±S@ÈZY¾­i-±P1>¡Œ=†í“«¾ue2£c澘zû³¦ý>§9-—$Üƾ¬w;H0<¥>ªÐÁè€Ù¾¢ô*VJ’k>‹êëu¼\>>ˆ€ÿÛ\9価8Õà”†Y>§ÀX—Wx(¾¨SRÑ—/æ>£/Øój¾’¢Z —2¾rQ=¼>™Öƒ¶b,–«áJD>¥ï¾X¹¾¢a“åù>”ÄúEÅN‹¾ZÀUZᾓê0èY>¡*º3{p¾£ÕˆÆ×>¡gœb!œ¾•?Ÿ›Íù>e5Òê^Hh>fi‰B¾ž9s9AR9>¢ ´äQ˾ JÅŽ½¦~>”Ÿuÿãa ¾l¡É÷"Ò¾‹÷w~ÏŸd>›qÄþŠô¾ «Ë ò>žDÆ¢n³þ¾“7Rs¾ó >jCk×y]>Š[Ãeƾ™¼ÕH&Ê>ŸjBùÕ¾›æ1~‰î>‘2Òø¢¾`'wåϾŠÐ$ÑA¥È>˜Ø]Ð'£¾6&•ù d>™iS" þ@§™Îw3¾€bÕæ>ŒÖㇰ×¾˜öQͤÿ>›€Î˜x\Q¾–®à¤0êo>‡ˆ"ŽçŽ>eì‡NÇâ#¾ów‹è v>˜j¼M¾º•¾™´:¿Ù}¹>“Žñ¬Ú¾gLÒe¿¾wÐIª §3>‘ÏÅúBý¾˜Hõ¼'c>—Š”‹Û+¼¾Ä}öÜ>m3ƒÞ€™À>‚ùùžÒ ¾“ŸQc‘ä>—Ãê1ÒRE¾”¿¬PÁ,>‡½œ¯+Ž>PÎé• ¯IL|r¾–/9Ú"á>‘=ÎøžzΡã,¾w© í¯qr>` Žü¢Ÿ¾•¨f}>©q>”+¥—,W¾ˆà„«‡¥,>M•}YQ|œ>…|…jÏ0¾’è¿ÛZ+ö>• ÌÛ²±¶¾‚ÅYÕ>{@ÝMIFû>s¿Ü¿Æò¾ú°/\>”%Õ»þ›}¾’ÍØ -Œh>†àÏWW©ï¾>¡ç¦¾…tMUÌ(>’åQ°šC¾“’[‡VÞ>w›O7œ;¾t…òN[g7¾x;A•è>ŽJõ|RÕ€¾“'Ú–‡£>ËÌT™¨Õ¾Èðͤ@¯¾^F/w^À>‡äéœ>&¾‘é¿û øS>‘ÒL%Ý뾇zå&.œ>\veªsq>whb¡ŽÞ¾+Ui£h>’ Cün%º¾‹€óñoÓÇ>s/$ÿ%>vé ÝýѾŒc`¾ÝµŽ>‘²²˜"¾ŽC¡¨>|ážÛc>h|x×4¾ˆc ‡ƒ›>þoãgL龚ãe>‚#øWOzÊ>I¹D§™‹¾„¢ÉÑ^”>95³i¾"+:žÿ>„Ö(ÔßaW¾Pr`B±˜[¾RS•?!®>ŽWã4WâȾ-µO°›:>†°D¸z¸ù¾c‹Õº8G¬¾}äÎj>Œ”Bš3¾ ;œÐÐ>‡Ùý²†y¾kÀ“#kë¾xÐõΰï>‹R×Ìö¾Ÿ<k£ù>ˆu½=K ¾pŒQk¢hý¾uĉÄöÙ>‰ÛzÝ=é]¾ÆÛf>ˆžfí\Äõ¾që?ªÁÉh¾sò~Tú‡†>‰B¼-œs¾Žƒèº4•,>ˆf—î`¾rF:ñ 3¾sQÕ$")w>ˆkÉzù¾ù+>J>‡ØQãëÊ9¾q(d&6‡¾sБ%"±O>ˆt‚àò•&¾qH¯;8>†öe+g1¾nQBö¾uY¶1@¾>ˆ¦Žçz¾Œážµ*m>…¼€‘¢„¾hD„ ݹ7¾wÓHMÈU®>‰JOf»q¾Œ9en >„!3Í&‚+¾`7°0 ]¾{€±3â>‰¥:Yw!G¾‹a@X†ÿì>‚Š¬ZÑ@¾Hí >Ê»¾ Ölù^‘>Š:?®h-¾Š;æÈ2ê&>"ÐV —†>FG(-m9”¾³$èë>Š­ŒBlt¾ˆ©mX—ð>y=¿æÛ>böH L ¾ƒó#v&‡>ŠÓ?ýY–§¾†‰…El>qÈãÃ7Êz>pÉ[¶%ø¾†£…©å»>Šz©`ç›U¾ƒ¼}üD;Ý>bçCë—²>xjfº'¶V¾‡èø­·>>‰q tûÞ¹¾€-L÷íoM>`L3£H>÷þïôI¾‰&ñÿÎÄ8>‡†4ýü @¾w¤Uæcˆ¾c¢è&bk>ƒtke˜¾‰Œ9N @>„’¾m¦¬¾jÖOÜRÈž¾t`w×ã>†MáõÎÆÒ¾ˆÔ9ªDÔj>€€0&Šž¾?Œ°7?†²¾}Ë݉*µŽ>ˆ,~ÿnŠ¾†Ä/Þ2>v¥â±×>dSo\‘«ö¾ƒ+k5Fz4>ˆ±¢xõÅÞ¾ƒ6ËO_>dÅp­›>v/‰"?྆ZS-r¹:>‡ŒuÜì¾|RÓÁ5ʾI<ÂBè>€†aÖ Ìr¾‡ö‚ù-y>„†µq¹û¾o%£ù;gˆ¾pâ¥Ávÿó>„Ä…DáäϾ‡’?Ò“o¯>-Zà ½¾/ ånó¾}ŒH éþ;>‡1agè\¾„ån™J&>qì`…>lM6œw¾ƒÇ;šNß>‡Ag“Û®¾ÍÄŸM:8>B =ŠC>|" À¾ŒN¾†ªV—Ùb’>„œÔ)ë!‘¾qÆÞ¢Âÿ‰¾kéÿc­>ƒ€ˆªë¦ì¾†ÆÔìœ>~ˆ=˜Y*¾1sÔ!Þé¾|Å£8µ>†lþoŠØɾƒÀ«e‚ô»>n¡¶½æv;>p¼©È½¾ƒÝÑ°¥Ù|>†'HïÂs¾{dG0Bi:¾DsüI}ËÚ>-Mó¯ÿѾ†QtuA3>‚6×y?:ø¾e$ê83•a¾tXœA>„ ýK–p¢¾„ýzGõÅ>v/.¡«ËÀ>`ÓUl*ãî¾eV.Æ©z>…ÿÁbåi`¾…¹2Їh>LV 5›;Ù>záIRÅô¾…_ßÂ. Q>ƒn® û¾mD‰Å˜Ê¾pPl CQ>ƒ\q…7Ú㾄úPs€Å>x4ˆÞqè>Vvº@S¾€D÷¶úÈ>…ƒÆÄI}µ¾Õß·7Í>R|#åšã>xÙØô¹X¾„Õša(]{>‚©lÑr¾l V¶“¾pOÿ">q€>ƒ#k&º¾„SÓØvz„>v?çÆ}¥ >]û (É€¨”ÔÂÚ>„ú»ô\\¾|þ'tJ4>1òãdÀëA>{A'¾:&¾„»°co–a>¥Cm¾bV1Û¾ñ¾t‡»Ä–Ha>ƒ¼.Aß¾‚äÓ–·hâ>pbUÅ©jU>k<®NÒǾ‚$i‹ôh>ƒù¸o]¾vœ1rˆ>¾ZR‰"Aüq>€eDk‰Ð¾„f]ØpRQ>{Æ`t‹®®½ò‘Ÿä5u.¾{™š-‚>„EFvŠô¾àÇiÙ>Xüc(¢ws>v¨; j?¾ƒ°\[ÕÞ[>|uŠÝö¾g¥y x&Ó¾qŸ0zÄ‹æ>‚Â,=¾‚“]Vv¿Ñ>p½.}ìN>iWö—ã3f¾“ÌÅ;¨’>ƒC„­‡š¾tùuøÊ¢s¾_Ŭ±„>€;êÞS¾ƒ/ŸêEP>x‹YÆ9 >LD>ÂV/J¾}œyö›×n>ƒ°Ý0ÿ—S¾{|ù.vY>‰Hˆ ±>z¶·Ï Å(¾ƒŽ{Ï Gü>}ܦ€ñ¹¾Pddtª'¾wᓃ‰ÕÃ>ƒDÓ›5ÕϾ»ÜxCâ>]aV ¿Ö>u2^½î©å¾‚á&5 A^>€”ôéݦ^¾dˆVÁf¾r¹Xr Í>‚nûã>Ñ‚¾?xAñ>hžX)4†i>p‚e¦p>¤¾øší>~•/\)§¾lm7üõÏy¾m+¤zÂ>„sY!v¾ÀOùå& >ox8æ„>iò”™¾xÍó(§>èÊIuìà¾på¦@¾Z¾g^†ÞÈíÇ>€¿)ñf¾ý@{Lv«>q¸Ù2kw9>et(Å·Ús¾€u¡ùþ“K>‚¿`Ÿ=á¾r:šo#’¾d3° öÎ>€@ŒÙ"O ¾ù 6ä¿(>rn£¨ å=>cœd4ò¾€ æ³^äE>å Km4¿¾rWÆÙwaC¾cª®ÿ%’Ù>€ÀZ°çâ¾Æ©Í 3>q÷€þä0>d[ú•©R¾€!-Of½>›r¶–Õµ¾qN3îû”¢¾e«`‡Òð>€>L¨þ)Þ¾c¶”û)n>p[A-üEl>g‘î´¢ŠÊ¾€kIÂ{èa>0jI5â¾n:nÀ‘øo¾j¨©÷O>€¤U®nÁ7¾€ÁZ£µÑÄ>k$Hö“±E>m:Ëþ+¾€ä ÄÁjY>€Nå›'jK¾goü²œ¾p=YcÊq>&UôOR¾¿9ĘŸ>c1¦‰ïŸ>r,AiïH¾b›g}6>~ÈîMV ¾\BË«µ0¾tDäYs“V>‘—oÖ”¥¾|l±ú²V_>Q?.µ >vzE%.ÖŽ¾ªhúìZ>zag8$:ö¾2Šf™A'b¾x¼ƒkÙ.)>£¾î`p¾wñ°KWœ¾AÑÏhr>zø’rßšâ¾sáÿb2>u ¤«V8>Wl•Ú‚‘k¾}h¢<>fÚŒA¾qž<å¹A¾cX®¼œm—>„Ï:ó¾€jFlQJ>l»‚[>k5,ÀŠ¦S¾€L/ÉÀ>~ü(8¡^Q¾c™*¾qCC œ>€Þû³S&Ó¾|‚jžü½>T½)Èu(ñ>uf ®“[-¾)/?zˆ>y[)YÎ%¾ ad#ؾy\‡z>ëÊ ž7¾u€dvâÕš¾Sßž•œ¯>|5ŒßäT¾€¥VPÍÐ>pô3ñ©ÿ>d9³ÜÔ ¾~ÖÙ„s@Ë>wƒ2àì0¾g…ahÍ(¾o B_⊠>€[9­¦jÁ¾|ª /ÓïÉ>X¯»Ê³h>t‚˜òJÙœ¾€Ó4Úö°Á>xÙå è>)ÓT„(¾yå¤n >€¾QiþlI¾t ¦Mæ¾Zί(ôT>|Àõ¶7dP¾€ PÇë£>l§ Ͷ>i¬¨Lî/y¾è ñ:>}]ÖŠ|âH¾_^墦þ¹¾rÕ)„¦3>€38ìé¾yL¿ÐmŒ>*7rÁ Z6>x*å»ýl¾€‡#ƒN2->sïÅ3ã\>YÆ£…[¾|}xß©S¯>|gYŸ+©¾jÞ÷îEÚâ¾k( N7>uÐ &]i¾|9:ßTÐ>X0¨¥ë¶>t)F–âwL±öÂ>=èw†P9¾y½^¨‘Ëa>€.úÅö¾pÜ^â.¦Ö¾c¸Øc‰H‘>}Ý“óúǾ}”æ#}Ï>bi2qfÛ•þ¾€ GT>xñúÉ$¾(^‹W¨!{¾wèã… )>€zNÉ ¾ruCIÝì¾_¨.(O>|ÓNùEx;}í;eµ>dîDM(¤>p*ÄðHZ¾¢l­"ÏÔ>yG×~kl!¾7ë)Ô$ݳ¾wJÍ=„>>òop2Ǿr{^"a¾_4’G>|˜œ÷ƒPÚ¾}ŒÅ³@!c>cñ­u‰>p„¥¢R>f¾yj”î>xyqSJ q¾IG•Í¯¾wèÄaõ«>|1ÅÑ¢¾q3LIؾb²ÜyUl>} û·Š­ê¾|q¯Ð÷>_¡W´ªô>rU¤0·Ýp¾(áŽL?>vužÓ °G>CRÇc’xæ¾yã‚Éó>~šðÅú;ø¾kÿñ‰W-‰¾hÿ"„®ä&>~ÿœ`tؾzTü†ÛÎ>NçI­ô>uS&ïöÚ˜¾NðØÐàõ>rû·%>[t™§+ƒ¾{Ç|pL÷Ý>|ÓŸ¯ëù¾b†#Áãž¾pèkã ¶>~ï2?›w"¾vÃ>’Ã)¾;Ê.†KÈ>xõ¦×Vúü¾~4ÕÇ&l >khí‘Ù©>iMT´N*¾}ÚQG’Œ›>y|^ÒÔ§î¾E®sæãÔ¾uÿ±©±Í7>~Á?Ž,¢¾q7­³m)¾a”Ù òÕþ>|c?.ø¾{VŸ¸+ÿ>YŸhí0>s)é<˜X ¾~½¸g»€‰>sâòœ‡L->Uã#©dÀ”¾zͯìRÓr>|‚zèÍꣾb±¹Ðl±¾p¤´‰ÎUø>~f ”÷¾uÓš;¿ô¾F*M™£>yM“ þ¾}0 7Â/>g"F6¿’>m õ–0¾}ê‘}ønë>w'ÅÝåzÁ>&òX‚Â…c¾xWô­>}…á½n¾j>l¢+;¾¾iþ‡šîÛE>}o…j€k¾wú#¬ú|Ö>%ú Ú»>wêDÀ̈¾}¡Þã|Œ©>l!)”">gù,'2õ6¾} ŽrØ…>x_Q8,øÀ¾7>¹VxŽX¾v‡Ö”±`Ã>}—õsà5±¾là˜b‹¾g—P™ >|Ò“í¶Vs¾xd}f’kX>9‹>"hÂ>v`ù#ooo¾}r0”Øù>l‹§?”>gX(]çi¾|šá̓>xè” K¾2 ÕqÉ72¾v §AC‰>}0¤ »ä¾k%;»/–¾h±ºÑµc>|Øi=Ú!¾w\%Õø_=óFjBÑXï>w> ”Û˾|ʲ#Þ5L>h«—à ´ñ>ky?\in¾}æ†aå,>vB…ŠúÊõ>8ÿªÛý¾x)j°1Ð^>|.ø &!¾ee‘÷ ¾nc¸µÀÙ>}4MíÔ6›¾t³R¯Ê•¾N·ý+>yJ­‘뇾{D°3MX>`S 6>q<Óy¥ a¾}DgȹÛ>ršô¥¿Î£>YæÐC½V¾zc”où>yíÒWξTÄI[w^ˆ¾säʵ>}ªAñ0¾oÍ P ªK¾cKk¤P»>{£ Ù ǾxØ4ÄV¯>:‰ çºã>vµë˹¤¾|fž…ÇD°>i .²#Ä>jT¢¢x#E¾|}ý¡Üa>ul%.Åš±>CÛwpûÛÿ¾xi@Nw0>{ œËŒ¨¾`ÛIŽ{ܾpÞÜfA{j>|Ô‘9á濾r­CdZ“¾\*ìà>z~¹Ã„îv¾xôC@\ö>M$Eæ0})>t‰³“îÙ¾|e¹QÁk>ke77Î¥º>gÀR19¾{ú•ºÁ/->uËç@9×É>;å“Ç®Cß¾wß:L®zê>zï/%Ïg…¾`ú³»¾p¹'µH¦>|ŠòÆ‚¾qnŽõÏ\¾^&{Ï͉Š>z„T^Ü{=¾x5ç-âÖ >CȺq9L~>u;AZ?ià¾{ØÕ(´Ã>h´tKfì>jÛÃÅÕ¼ª¾|히Ç>t´|o•>P}³¨ßB¾xõÎøõ•8>y›ôºc)¾V1»pÛ¾rüA?zô>| ¯¢`¾lêTKaC­¾e×ä1>{i)hÑ(¾uŸÅö·óH¾;ÆV}9`>>w©Ú.Á?2¾zO ,žƒj>^Õø‡¢Ž>qaýŸq¾|UËúY>o±íKÙx>b¦]ö°“Q¾zÚÄS>vdÿ{hhë>?z»^œE¾v×zŠGuôó7¾`ë~“Zz¾p ë-J>{ðþ»†¾pX¾w ð§¾a`ÈŒhÔ>zŒy½:¢¾v„Skþh’½ô-ÁE8â>v—*\é¾zmÖ˜É^>`Ù­º‰”L>p‡Òòë ¾{ÉY‡³ã>pfÍô8>b¦zŒeb X >v • Ys>(R˜fݾvêyÿGñn[¾]Ç8FÒ¼x¾qJ®í4^>{™t;÷1ç¾mŧ™Í¾dyé Ò^þ>zËFE^ñ¾tò¯ó'öÿ¾CAw`xíF>wº¨™‡0„¾y*Â^]¶µ>V[>­>r½›˜•U¾{B ùs™>iÅ,ý`>>h™ö-`y~¾{ 8`×~ú>sæî F>S䤊i%"¾xÛá©×£ß>wÆtç••ê¾Ež÷hÉÓ¾tµ6‰qý>z‹ö¨ï)™¾cãô²Þ÷¾n—ó>{K5Q¶ x¾pi?ŒBœ“¾`½&š`¸>z¨ûk ¾u˜IüðMA¾2ÏÕ9&$„>vîl㶠¾y,<Žl)>Wÿ:±7˜>rD3™mJ(¾zô¶P7>iQ˜Üº=>h׶Âvº¾záŸwJ>r_iºüúÑ>WRU9;뛾yzøÔ¯>vËØC‡Pñ¾0¼ö>˜u–¾u•pKÆ>y±*‹sÆr¾_Ñ]}z¾pÒÚ}Ñ>zï2Ë‚·¾kÆ#,Íúô¾f0:¿@Ó>z‚E‘Vbå¾s|"•Æ&¾SŸçÃ>x%f³œ8¾w‹Ö¨éU>;ê;„y>uq ¾ï¾yªŠ ¸>`N-ó6™>p‹æ!³¥¾zÅo1,^6>k–µÚ?>fEE •4]¾zbTrï£>r·FÀµ«>TÒ.Ä`8¾x•‘¥Ó§¼>v‘î†$M¾-"+íÆöؾu…Ï^¯ó>y/iç©^3¾[‹8à¨A¾qhY”Uœ>z|ÀA¤¬¾hØþÄ{!U¾húÊZ»>zuô‘[2}¾qD…𳃾\'ŸJ^>y)&6̘¨¾u6MÕÁU¾5tm÷M>v³pñnîx¾xÑ+ÉA>QQ+æ]y²>s>)ÐÁ¾yÞ1ˆ.–y>cnb/¬^Ý>m÷’C¢Åʾzuz»¯-Ë>m.ôÁæÙÞ>dIk 쫾yç®m1.>rÄåÖr ¶>SÐxÖ!íš¾xG;¼;[U>v7ËA‘¾¼ígNˆç¾u± þ>Ø>x}âéBå ¾V@Û}üJÖ¾rJE&/$Ê>yâW?l¾dðŸ”ûß ¾l{ï©nû(>zD0¶ö§*¾mÍH5Ô¾cuyJÑL>y«îºš’ܾr¶ÞÞc£¾SÁîËšT’>x*¢d;¾uÊkÊݽìÃu²}±$>u֮˛q¾xÑ÷p©>Rû˜"Ë¢>rÏýˆb§¾y~HöYÛÙ>bO«ì L>npWª&Çí¾zÉ aþ'>jú•&A¤Ì>fgßd#¾yÍÅðŠ 1>q-›\æ>[£§ò`ѾxÁ`þ5ö!>tFÉfh;¿>CáÜG´)̾výTã"9 >v¹jÍäÖ¾>ëT2']³¾t—Ê¿/2>x{&sfÿ'¾XÝ¥L¡¾qª,‹çˆ–>y‡jŠl5оd€š#d…¾lŸ÷ÉTðu>yßçê—Ÿƒ¾ká³Ðk¦»¾eKw½šgë>y‹4¾µàľq4dºGR½¾[Í4õQÕ>x”9w„¯¾sûR‹¾F’oîç*d>w i±…¸¼¾v9ž±>2Úƒ5Åæ>tûøvèð¾wéP}”©:>Séœ/ g>rÌËQ³¾y˜o-ŠÑ>aH‰¦EiÌ>oNÏéQ¾y•º ÓÄ>h¸ú-y>i±ýëײ¾y˜YÈÖßÄ>nFážç¦1>br‚HÒL×¾yÿ'hIƒ>qÝr—ŽË>W1Ç' •¾x’?(‹G>t1w  8>B¬­UŠÁ¾v±ÖºÈ¶—>v™èZßa¾1ž>øv*¾tæî…¹>w’Ë®°l—¾QÇIÊäʾrÈÜh,%>xœ”éaо^‘Í÷'Z¾pf;!Iq>y8ÊJ‹«¾eJRn½¾kšhk±J¹>ykF\ì°¾jÕ5ú¡k?¾fÕ´°ÙÚ>y9±ó}¾oÙb6³»Å¾`bæ,ªÜi>xªÌ&s ¾r%„5 k¾U$ѼÉlE>wÆ>U–ø¾tö¡1¾BüÚ÷¦ï'>v•U ûÞ¾u­D…×> )­-">u!ɹrÙ¾vøæÂ8Çw>Jm뤡`>srí+eï[¾wõC„!„>WýI;^)T>q”m)¼ú‰¾x¤)lä|ä>aw¹>>oÖäØ-]¾y¡s~n>eëðºï>jÖà„ÿ†V¾y&’Ò­=>j_27W–¼>fe"1§­ë¾y”Ïñ\>nrÁ(RHS>aØ©¢î8¾x¡Ä)þ,>q|‹¿‰×>Z€ƒ€é°¾x ›àj$>r³bk3>QR«õmê¾w?ÐrbT>t"îÚº>@‰u\j4î²¾d÷ã: ^¾u.‡g?.b>vc…‚´/˜¾B‡ïžh#¾sò‡¼ ú>w8ÿ[6ï ¾Q“dDªZö¾r›³·ßX澪hô·q±–>à_kJܾáŠR º&Á>ÜÒÜ-~ä¾ÓMuÕ&%8>ÂIsf/Õ¾M#e‘®¾»Cr\Ê… >Ŷ¿™­¾Çè(-ÊPj>ÄíeE¿¬c¾¼f@ësÙ•>¦L–Q—œ¥>˜ ‚€dí¾³É›*Ll>»ÊTŒX"ñ¾½÷M¢Í>¸~’¦¨¾¬ÿnœùR>…»}Q=@>¡Ir=Rp‹¾±(GÒžy>µA_[Ñ÷þ´d5Ði{#>®6Á‘TV¾›jZMñ‰2¾‚íâúû݈>¤ë¬+Éκ¾¯fçV¡Gä>±S@ÈZY¾­i-±P1>¡Œ=†í“«¾ue2£c澘zû³¦ý>§9-—$Üƾ¬w;H0<¥>ªÐÁè€Ù¾¢ô*VJ’k>‹êëu¼\>>ˆ€ÿÛ\9価8Õà”†Y>§ÀX—Wx(¾¨SRÑ—/æ>£/Øój¾’¢Z —2¾rQ=¼>™Öƒ¶b,–«áJD>¥ï¾X¹¾¢a“åù>”ÄúEÅN‹¾ZÀUZᾓê0èY>¡*º3{p¾£ÕˆÆ×>¡gœb!œ¾•?Ÿ›Íù>e5Òê^Hh>fi‰B¾ž9s9AR9>¢ ´äQ˾ JÅŽ½¦~>”Ÿuÿãa ¾l¡É÷"Ò¾‹÷w~ÏŸd>›qÄþŠô¾ «Ë ò>žDÆ¢n³þ¾“7Rs¾ó >jCk×y]>Š[Ãeƾ™¼ÕH&Ê>ŸjBùÕ¾›æ1~‰î>‘2Òø¢¾`'wåϾŠÐ$ÑA¥È>˜Ø]Ð'£¾6&•ù d>™iS" þ@§™Îw3¾€bÕæ>ŒÖㇰ×¾˜öQͤÿ>›€Î˜x\Q¾–®à¤0êo>‡ˆ"ŽçŽ>eì‡NÇâ#¾ów‹è v>˜j¼M¾º•¾™´:¿Ù}¹>“Žñ¬Ú¾gLÒe¿¾wÐIª §3>‘ÏÅúBý¾˜Hõ¼'c>—Š”‹Û+¼¾Ä}öÜ>m3ƒÞ€™À>‚ùùžÒ ¾“ŸQc‘ä>—Ãê1ÒRE¾”¿¬PÁ,>‡½œ¯+Ž>PÎé• ¯IL|r¾–/9Ú"á>‘=ÎøžzΡã,¾w© í¯qr>` Žü¢Ÿ¾•¨f}>©q>”+¥—,W¾ˆà„«‡¥,>M•}YQ|œ>…|…jÏ0¾’è¿ÛZ+ö>• ÌÛ²±¶¾‚ÅYÕ>{@ÝMIFû>s¿Ü¿Æò¾ú°/\>”%Õ»þ›}¾’ÍØ -Œh>†àÏWW©ï¾>¡ç¦¾…tMUÌ(>’åQ°šC¾“’[‡VÞ>w›O7œ;¾t…òN[g7¾x;A•è>ŽJõ|RÕ€¾“'Ú–‡£>ËÌT™¨Õ¾Èðͤ@¯¾^F/w^À>‡äéœ>&¾‘é¿û øS>‘ÒL%Ý뾇zå&.œ>\veªsq>whb¡ŽÞ¾+Ui£h>’ Cün%º¾‹€óñoÓÇ>s/$ÿ%>vé ÝýѾŒc`¾ÝµŽ>‘²²˜"¾ŽC¡¨>|ážÛc>h|x×4¾ˆc ‡ƒ›>þoãgL龚ãe>‚#øWOzÊ>I¹D§™‹¾„¢ÉÑ^”>95³i¾"+:žÿ>„Ö(ÔßaW¾Pr`B±˜[¾RS•?!®>ŽWã4WâȾ-µO°›:>†°D¸z¸ù¾c‹Õº8G¬¾}äÎj>Œ”Bš3¾ ;œÐÐ>‡Ùý²†y¾kÀ“#kë¾xÐõΰï>‹R×Ìö¾Ÿ<k£ù>ˆu½=K ¾pŒQk¢hý¾uĉÄöÙ>‰ÛzÝ=é]¾ÆÛf>ˆžfí\Äõ¾që?ªÁÉh¾sò~Tú‡†>‰B¼-œs¾Žƒèº4•,>ˆf—î`¾rF:ñ 3¾sQÕ$")w>ˆkÉzù¾ù+>J>‡ØQãëÊ9¾q(d&6‡¾sБ%"±O>ˆt‚àò•&¾qH¯;8>†öe+g1¾nQBö¾uY¶1@¾>ˆ¦Žçz¾Œážµ*m>…¼€‘¢„¾hD„ ݹ7¾wÓHMÈU®>‰JOf»q¾Œ9en >„!3Í&‚+¾`7°0 ]¾{€±3â>‰¥:Yw!G¾‹a@X†ÿì>‚Š¬ZÑ@¾Hí >Ê»¾ Ölù^‘>Š:?®h-¾Š;æÈ2ê&>"ÐV —†>FG(-m9”¾³$èë>Š­ŒBlt¾ˆ©mX—ð>y=¿æÛ>böH L ¾ƒó#v&‡>ŠÓ?ýY–§¾†‰…El>qÈãÃ7Êz>pÉ[¶%ø¾†£…©å»>Šz©`ç›U¾ƒ¼}üD;Ý>bçCë—²>xjfº'¶V¾‡èø­·>>‰q tûÞ¹¾€-L÷íoM>`L3£H>÷þïôI¾‰&ñÿÎÄ8>‡†4ýü @¾w¤Uæcˆ¾c¢è&bk>ƒtke˜¾‰Œ9N @>„’¾m¦¬¾jÖOÜRÈž¾t`w×ã>†MáõÎÆÒ¾ˆÔ9ªDÔj>€€0&Šž¾?Œ°7?†²¾}Ë݉*µŽ>ˆ,~ÿnŠ¾†Ä/Þ2>v¥â±×>dSo\‘«ö¾ƒ+k5Fz4>ˆ±¢xõÅÞ¾ƒ6ËO_>dÅp­›>v/‰"?྆ZS-r¹:>‡ŒuÜì¾|RÓÁ5ʾI<ÂBè>€†aÖ Ìr¾‡ö‚ù-y>„†µq¹û¾o%£ù;gˆ¾pâ¥Ávÿó>„Ä…DáäϾ‡’?Ò“o¯>-Zà ½¾/ ånó¾}ŒH éþ;>‡1agè\¾„ån™J&>qì`…>lM6œw¾ƒÇ;šNß>‡Ag“Û®¾ÍÄŸM:8>B =ŠC>|" À¾ŒN¾†ªV—Ùb’>„œÔ)ë!‘¾qÆÞ¢Âÿ‰¾kéÿc­>ƒ€ˆªë¦ì¾†ÆÔìœ>~ˆ=˜Y*¾1sÔ!Þé¾|Å£8µ>†lþoŠØɾƒÀ«e‚ô»>n¡¶½æv;>p¼©È½¾ƒÝÑ°¥Ù|>†'HïÂs¾{dG0Bi:¾DsüI}ËÚ>-Mó¯ÿѾ†QtuA3>‚6×y?:ø¾e$ê83•a¾tXœA>„ ýK–p¢¾„ýzGõÅ>v/.¡«ËÀ>`ÓUl*ãî¾eV.Æ©z>…ÿÁbåi`¾…¹2Їh>LV 5›;Ù>záIRÅô¾…_ßÂ. Q>ƒn® û¾mD‰Å˜Ê¾pPl CQ>ƒ\q…7Ú㾄úPs€Å>x4ˆÞqè>Vvº@S¾€D÷¶úÈ>…ƒÆÄI}µ¾Õß·7Í>R|#åšã>xÙØô¹X¾„Õša(]{>‚©lÑr¾l V¶“¾pOÿ">q€>ƒ#k&º¾„SÓØvz„>v?çÆ}¥ >]û (É€¨”ÔÂÚ>„ú»ô\\¾|þ'tJ4>1òãdÀëA>{A'¾:&¾„»°co–a>¥Cm¾bV1Û¾ñ¾t‡»Ä–Ha>ƒ¼.Aß¾‚äÓ–·hâ>pbUÅ©jU>k<®NÒǾ‚$i‹ôh>ƒù¸o]¾vœ1rˆ>¾ZR‰"Aüq>€eDk‰Ð¾„f]ØpRQ>{Æ`t‹®®½ò‘Ÿä5u.¾{™š-‚>„EFvŠô¾àÇiÙ>Xüc(¢ws>v¨; j?¾ƒ°\[ÕÞ[>|uŠÝö¾g¥y x&Ó¾qŸ0zÄ‹æ>‚Â,=¾‚“]Vv¿Ñ>p½.}ìN>iWö—ã3f¾“ÌÅ;¨’>ƒC„­‡š¾tùuøÊ¢s¾_Ŭ±„>€;êÞS¾ƒ/ŸêEP>x‹YÆ9 >LD>ÂV/J¾}œyö›×n>ƒ°Ý0ÿ—S¾{|ù.vY>‰Hˆ ±>z¶·Ï Å(¾ƒŽ{Ï Gü>}ܦ€ñ¹¾Pddtª'¾wᓃ‰ÕÃ>ƒDÓ›5ÕϾ»ÜxCâ>]aV ¿Ö>u2^½î©å¾‚á&5 A^>€”ôéݦ^¾dˆVÁf¾r¹Xr Í>‚nûã>Ñ‚¾?xAñ>hžX)4†i>p‚e¦p>¤¾øší>~•/\)§¾lm7üõÏy¾m+¤zÂ>„sY!v¾ÀOùå& >ox8æ„>iò”™¾xÍó(§>èÊIuìà¾på¦@¾Z¾g^†ÞÈíÇ>€¿)ñf¾ý@{Lv«>q¸Ù2kw9>et(Å·Ús¾€u¡ùþ“K>‚¿`Ÿ=á¾r:šo#’¾d3° öÎ>€@ŒÙ"O ¾ù 6ä¿(>rn£¨ å=>cœd4ò¾€ æ³^äE>å Km4¿¾rWÆÙwaC¾cª®ÿ%’Ù>€ÀZ°çâ¾Æ©Í 3>q÷€þä0>d[ú•©R¾€!-Of½>›r¶–Õµ¾qN3îû”¢¾e«`‡Òð>€>L¨þ)Þ¾c¶”û)n>p[A-üEl>g‘î´¢ŠÊ¾€kIÂ{èa>0jI5â¾n:nÀ‘øo¾j¨©÷O>€¤U®nÁ7¾€ÁZ£µÑÄ>k$Hö“±E>m:Ëþ+¾€ä ÄÁjY>€Nå›'jK¾goü²œ¾p=YcÊq>&UôOR¾¿9ĘŸ>c1¦‰ïŸ>r,AiïH¾b›g}6>~ÈîMV ¾\BË«µ0¾tDäYs“V>‘—oÖ”¥¾|l±ú²V_>Q?.µ >vzE%.ÖŽ¾ªhúìZ>zag8$:ö¾2Šf™A'b¾x¼ƒkÙ.)>£¾î`p¾wñ°KWœ¾AÑÏhr>zø’rßšâ¾sáÿb2>u ¤«V8>Wl•Ú‚‘k¾}h¢<>fÚŒA¾qž<å¹A¾cX®¼œm—>„Ï:ó¾€jFlQJ>l»‚[>k5,ÀŠ¦S¾€L/ÉÀ>~ü(8¡^Q¾c™*¾qCC œ>€Þû³S&Ó¾|‚jžü½>T½)Èu(ñ>uf ®“[-¾)/?zˆ>y[)YÎ%¾ ad#ؾy\‡z>ëÊ ž7¾u€dvâÕš¾Sßž•œ¯>|5ŒßäT¾€¥VPÍÐ>pô3ñ©ÿ>d9³ÜÔ ¾~ÖÙ„s@Ë>wƒ2àì0¾g…ahÍ(¾o B_⊠>€[9­¦jÁ¾|ª /ÓïÉ>X¯»Ê³h>t‚˜òJÙœ¾€Ó4Úö°Á>xÙå è>)ÓT„(¾yå¤n >€¾QiþlI¾t ¦Mæ¾Zί(ôT>|Àõ¶7dP¾€ PÇë£>l§ Ͷ>i¬¨Lî/y¾è ñ:>}]ÖŠ|âH¾_^墦þ¹¾rÕ)„¦3>€38ìé¾yL¿ÐmŒ>*7rÁ Z6>x*å»ýl¾€‡#ƒN2->sïÅ3ã\>YÆ£…[¾|}xß©S¯>|gYŸ+©¾jÞ÷îEÚâ¾k( N7>uÐ &]i¾|9:ßTÐ>X0¨¥ë¶>t)F–âwL±öÂ>=èw†P9¾y½^¨‘Ëa>€.úÅö¾pÜ^â.¦Ö¾c¸Øc‰H‘>}Ý“óúǾ}”æ#}Ï>bi2qfÛ•þ¾€ GT>xñúÉ$¾(^‹W¨!{¾wèã… )>€zNÉ ¾ruCIÝì¾_¨.(O>|ÓNùEx;}í;eµ>dîDM(¤>p*ÄðHZ¾¢l­"ÏÔ>yG×~kl!¾7ë)Ô$ݳ¾wJÍ=„>>òop2Ǿr{^"a¾_4’G>|˜œ÷ƒPÚ¾}ŒÅ³@!c>cñ­u‰>p„¥¢R>f¾yj”î>xyqSJ q¾IG•Í¯¾wèÄaõ«>|1ÅÑ¢¾q3LIؾb²ÜyUl>} û·Š­ê¾|q¯Ð÷>_¡W´ªô>rU¤0·Ýp¾(áŽL?>vužÓ °G>CRÇc’xæ¾yã‚Éó>~šðÅú;ø¾kÿñ‰W-‰¾hÿ"„®ä&>~ÿœ`tؾzTü†ÛÎ>NçI­ô>uS&ïöÚ˜¾NðØÐàõ>rû·%>[t™§+ƒ¾{Ç|pL÷Ý>|ÓŸ¯ëù¾b†#Áãž¾pèkã ¶>~ï2?›w"¾vÃ>’Ã)¾;Ê.†KÈ>xõ¦×Vúü¾~4ÕÇ&l >khí‘Ù©>iMT´N*¾}ÚQG’Œ›>y|^ÒÔ§î¾E®sæãÔ¾uÿ±©±Í7>~Á?Ž,¢¾q7­³m)¾a”Ù òÕþ>|c?.ø¾{VŸ¸+ÿ>YŸhí0>s)é<˜X ¾~½¸g»€‰>sâòœ‡L->Uã#©dÀ”¾zͯìRÓr>|‚zèÍꣾb±¹Ðl±¾p¤´‰ÎUø>~f ”÷¾uÓš;¿ô¾F*M™£>yM“ þ¾}0 7Â/>g"F6¿’>m õ–0¾}ê‘}ønë>w'ÅÝåzÁ>&òX‚Â…c¾xWô­>}…á½n¾j>l¢+;¾¾iþ‡šîÛE>}o…j€k¾wú#¬ú|Ö>%ú Ú»>wêDÀ̈¾}¡Þã|Œ©>l!)”">gù,'2õ6¾} ŽrØ…>x_Q8,øÀ¾7>¹VxŽX¾v‡Ö”±`Ã>}—õsà5±¾là˜b‹¾g—P™ >|Ò“í¶Vs¾xd}f’kX>9‹>"hÂ>v`ù#ooo¾}r0”Øù>l‹§?”>gX(]çi¾|šá̓>xè” K¾2 ÕqÉ72¾v §AC‰>}0¤ »ä¾k%;»/–¾h±ºÑµc>|Øi=Ú!¾w\%Õø_=óFjBÑXï>w> ”Û˾|ʲ#Þ5L>h«—à ´ñ>ky?\in¾}æ†aå,>vB…ŠúÊõ>8ÿªÛý¾x)j°1Ð^>|.ø &!¾ee‘÷ ¾nc¸µÀÙ>}4MíÔ6›¾t³R¯Ê•¾N·ý+>yJ­‘뇾{D°3MX>`S 6>q<Óy¥ a¾}DgȹÛ>ršô¥¿Î£>YæÐC½V¾zc”où>yíÒWξTÄI[w^ˆ¾säʵ>}ªAñ0¾oÍ P ªK¾cKk¤P»>{£ Ù ǾxØ4ÄV¯>:‰ çºã>vµë˹¤¾|fž…ÇD°>i .²#Ä>jT¢¢x#E¾|}ý¡Üa>ul%.Åš±>CÛwpûÛÿ¾xi@Nw0>{ œËŒ¨¾`ÛIŽ{ܾpÞÜfA{j>|Ô‘9á濾r­CdZ“¾\*ìà>z~¹Ã„îv¾xôC@\ö>M$Eæ0})>t‰³“îÙ¾|e¹QÁk>ke77Î¥º>gÀR19¾{ú•ºÁ/->uËç@9×É>;å“Ç®Cß¾wß:L®zê>zï/%Ïg…¾`ú³»¾p¹'µH¦>|ŠòÆ‚¾qnŽõÏ\¾^&{Ï͉Š>z„T^Ü{=¾x5ç-âÖ >CȺq9L~>u;AZ?ià¾{ØÕ(´Ã>h´tKfì>jÛÃÅÕ¼ª¾|히Ç>t´|o•>P}³¨ßB¾xõÎøõ•8>y›ôºc)¾V1»pÛ¾rüA?zô>| ¯¢`¾lêTKaC­¾e×ä1>{i)hÑ(¾uŸÅö·óH¾;ÆV}9`>>w©Ú.Á?2¾zO ,žƒj>^Õø‡¢Ž>qaýŸq¾|UËúY>o±íKÙx>b¦]ö°“Q¾zÚÄS>vdÿ{hhë>?z»^œE¾v×zŠGuôó7¾`ë~“Zz¾p ë-J>{ðþ»†¾pX¾w ð§¾a`ÈŒhÔ>zŒy½:¢¾v„Skþh’½ô-ÁE8â>v—*\é¾zmÖ˜É^>`Ù­º‰”L>p‡Òòë ¾{ÉY‡³ã>pfÍô8>b¦zŒeb X >v • Ys>(R˜fݾvêyÿGñn[¾]Ç8FÒ¼x¾qJ®í4^>{™t;÷1ç¾mŧ™Í¾dyé Ò^þ>zËFE^ñ¾tò¯ó'öÿ¾CAw`xíF>wº¨™‡0„¾y*Â^]¶µ>V[>­>r½›˜•U¾{B ùs™>iÅ,ý`>>h™ö-`y~¾{ 8`×~ú>sæî F>S䤊i%"¾xÛá©×£ß>wÆtç••ê¾Ež÷hÉÓ¾tµ6‰qý>z‹ö¨ï)™¾cãô²Þ÷¾n—ó>{K5Q¶ x¾pi?ŒBœ“¾`½&š`¸>z¨ûk ¾u˜IüðMA¾2ÏÕ9&$„>vîl㶠¾y,<Žl)>Wÿ:±7˜>rD3™mJ(¾zô¶P7>iQ˜Üº=>h׶Âvº¾záŸwJ>r_iºüúÑ>WRU9;뛾yzøÔ¯>vËØC‡Pñ¾0¼ö>˜u–¾u•pKÆ>y±*‹sÆr¾_Ñ]}z¾pÒÚ}Ñ>zï2Ë‚·¾kÆ#,Íúô¾f0:¿@Ó>z‚E‘Vbå¾s|"•Æ&¾SŸçÃ>x%f³œ8¾w‹Ö¨éU>;ê;„y>uq ¾ï¾yªŠ ¸>`N-ó6™>p‹æ!³¥¾zÅo1,^6>k–µÚ?>fEE •4]¾zbTrï£>r·FÀµ«>TÒ.Ä`8¾x•‘¥Ó§¼>v‘î†$M¾-"+íÆöؾu…Ï^¯ó>y/iç©^3¾[‹8à¨A¾qhY”Uœ>z|ÀA¤¬¾hØþÄ{!U¾húÊZ»>zuô‘[2}¾qD…𳃾\'ŸJ^>y)&6̘¨¾u6MÕÁU¾5tm÷M>v³pñnîx¾xÑ+ÉA>QQ+æ]y²>s>)ÐÁ¾yÞ1ˆ.–y>cnb/¬^Ý>m÷’C¢Åʾzuz»¯-Ë>m.ôÁæÙÞ>dIk 쫾yç®m1.>rÄåÖr ¶>SÐxÖ!íš¾xG;¼;[U>v7ËA‘¾¼ígNˆç¾u± þ>Ø>x}âéBå ¾V@Û}üJÖ¾rJE&/$Ê>yâW?l¾dðŸ”ûß ¾l{ï©nû(>zD0¶ö§*¾mÍH5Ô¾cuyJÑL>y«îºš’ܾr¶ÞÞc£¾SÁîËšT’>x*¢d;¾uÊkÊݽìÃu²}±$>u֮˛q¾xÑ÷p©>Rû˜"Ë¢>rÏýˆb§¾y~HöYÛÙ>bO«ì L>npWª&Çí¾zÉ aþ'>jú•&A¤Ì>fgßd#¾yÍÅðŠ 1>q-›\æ>[£§ò`ѾxÁ`þ5ö!>tFÉfh;¿>CáÜG´)̾výTã"9 >v¹jÍäÖ¾>ëT2']³¾t—Ê¿/2>x{&sfÿ'¾XÝ¥L¡¾qª,‹çˆ–>y‡jŠl5оd€š#d…¾lŸ÷ÉTðu>yßçê—Ÿƒ¾ká³Ðk¦»¾eKw½šgë>y‹4¾µàľq4dºGR½¾[Í4õQÕ>x”9w„¯¾sûR‹¾F’oîç*d>w i±…¸¼¾v9ž±>2Úƒ5Åæ>tûøvèð¾wéP}”©:>Séœ/ g>rÌËQ³¾y˜o-ŠÑ>aH‰¦EiÌ>oNÏéQ¾y•º ÓÄ>h¸ú-y>i±ýëײ¾y˜YÈÖßÄ>nFážç¦1>br‚HÒL×¾yÿ'hIƒ>qÝr—ŽË>W1Ç' •¾x’?(‹G>t1w  8>B¬­UŠÁ¾v±ÖºÈ¶—>v™èZßa¾1ž>øv*¾tæî…¹>w’Ë®°l—¾QÇIÊäʾrÈÜh,%>xœ”éaо^‘Í÷'Z¾pf;!Iq>y8ÊJ‹«¾eJRn½¾kšhk±J¹>ykF\ì°¾jÕ5ú¡k?¾fÕ´°ÙÚ>y9±ó}¾oÙb6³»Å¾`bæ,ªÜi>xªÌ&s ¾r%„5 k¾U$ѼÉlE>wÆ>U–ø¾tö¡1¾BüÚ÷¦ï'>v•U ûÞ¾u­D…×> )­-">u!ɹrÙ¾vøæÂ8Çw>Jm뤡`>srí+eï[¾wõC„!„>WýI;^)T>q”m)¼ú‰¾x¤)lä|ä>aw¹>>oÖäØ-]¾y¡s~n>eëðºï>jÖà„ÿ†V¾y&’Ò­=>j_27W–¼>fe"1§­ë¾y”Ïñ\>nrÁ(RHS>aØ©¢î8¾x¡Ä)þ,>q|‹¿‰×>Z€ƒ€é°¾x ›àj$>r³bk3>QR«õmê¾w?ÐrbT>t"îÚº>@‰u\j4î²¾d÷ã: ^¾u.‡g?.b>vc…‚´/˜¾B‡ïžh#¾sò‡¼ ú>w8ÿ[6ï ¾Q“dDªZö¾r›³·ßXæ>wÞëOHõJ¾Y„á4†Ð¾q/O‘í >xW´Üø¾`‡?b–ð­¾od¦ÄóëC>x¦Lxfú˾dZc·­F¾lRÃ@¬˜>xÍyggÎ?ýY¾i1q2Ÿ>xа¡Ö;—¾j}â|Ö{¾f¨ ¤L>x²ù[W¾mWô‰#T¾bßBè‰Ó*>xw²ÊÆ&z¾oõg™2/l¾_w%-˜s.>x"&‡’3¾q+‚NŒ¾YF0Ÿßâ‰>wµŽš_Û@¾r?Ã9Î^¾S56*X5L>w5b| –¾s6cÛ¥©#¾J˜¾+—•²>v£ª•¼1¾t‘EÊÃW¾>J2·-Ò>vDQp¾tÔñ]Zé3¾ j2‰^K$>uY“‰BµŸ¾u~÷»8Õ.>)öéuÜùª>t¦&HJ©H¾v/ø¨«¿>@œßŽ×pB>sì\¥¡B¾v5ÕÅb1>J=ÓU›¬.>s.hä/̾vú®_ùq¶>Q®–ïÎåï>rnNøP5¾wSAžhœ>Uü€¡ª t>q­å¸,‰ã¾w›•5Ý?—>ZQÇÎLØ>pî×\pt«¾wÕGÎs>]ÒBÞ–3>p2£’5ôn¾xí¨ vŸ>`­€ ý’G>nõB?KÓw¾x# {çx#>bQÍpbâ>>m!Ÿ; ¾x:4Fì>cÖ·Í´U!>l7œlü3¶¾xHy­mž>e= 9¥¼Û>jíêK¡^5¾xOzþ\>f…° Úë>i´‚ŒØ:¾xPTÃIÿÏ>g±–1 ">hŒÄƒi‡Ã¾xL-¦ê(>hÁ¹!9`>gwÜ6fX¾xD÷ x>i·hãgr>fvÇb Ë.¾x8÷ÄÈ%>j’°z¸F>eŠXóP¹¨¾x+¾Ü¿Tî>kUwÝy>d³?SÍC.¾x/¢Ï9®>lWœ_ B>cò„äÞF¾x ü¹H“>l”/™±ÖŠ>cG~?©|¾wþÂ,Y­P>mÌ9J¢Æ>b²Ø´wf#¾wð²9ô4>myçU¥_h>b5u”äðô¾wâ;Znì>mÍ&}Ö‚>aÏZøa ¾wÕ¼Ö{ãt>n 6;>a㞼ɼ¾wÊÓX›n76Þ°>aGÐÂB‘¾wÁ²ûÄÖH>nNà”W…ñ>a&ÚG;wº|ë¢æt>nS]¢ßõc>aèC9uȾwµ>Ô !Q>nDÞʲø>a)Õů+½¾w±óöîõn>n#{^ì Ó>aMpGݾw°…—ˆá>mï4ÏN(>a‡z Á#²¾w°Ê¢ÄU%>m§ôhÔ|ù>a×¥~ñ®¥¾w²ˆ-ÿ¡'>mMTE‚>b=˜3úM¾wµrZv>lßÅý´Å>b¸èøÛľw¹+ž–d>l^Fµ¯>cIÚq÷·¾w½Eê!b>kÈ®Á|¬Û>cí«ÓÐN¾wÁAׄ>k§Sç–>d¥òì§n¾wÄ:ÍËV>j_fÁtž'>eq>—Uñ ¾wÆ‘b¦7÷>iŠ´8§¹‚>fNÃMû~¾wÆ•ÉOÃ>hŸêT†€,>g=š» Ú¾wÃÞ¬ ÎÁ>gžz[¼v->h<Á>âÔp¾w½žŒáÆ<>f…Ö™-7<>iKHÁˆ¾w²ùZÀz;>eUv$òi>jgUxçO®¾w£Ma>d Ù.u%Ÿ>k{f¯¾wŒÏ^)[Ó>b«bÃ?ï>lÃÐ?©Üï¾woSÔÁ}b>a13R®>nÆK{Gº¾wIˆ„¢2‘>_;D4F>oE€é]S¾wZ×Q>[à¡NDTl>pGZ&ƒä¾v஋ÄÛ¨>XS(©‘Ö‹>pí®’Ú1X¾v›g!ÄC÷>T’Ý"­Â>q”QföT¾vIc4ºM(>P [@Îã>r9ò hž:¾ué‚ g >HùSñ˜Õ>rÝ'â&Z¾uz¨”J2þ>@R‰â±æ>s|nÓ®IŽ¾tû¿> *">-AL€z u>t.Æ“VX¾tk»,N›ï¾A¬HMü>t¨µbœƾsÉŸË|ø:¾7a‘ r)0>u2; Ȭ¦¾s‚õEsm¾E¡Ïù<©>u°äo»Ôð¾rK’=y"ý¾OÒYê*3>v"ÄBêv¾qnŒåËL¾UÜ°Ñû>v…ÞMæ=Ù¾p{~7G*¾Zcˆ•Uå>vØ+i˜tm¾næ±$×+º¾_¸î?áK>wÂôÇ+¾lªÊÅæ9h¾bŠgá +k>wB$Èï5Ö¾jC+.«Ä7¾e7pñçy>wU³Øä.;g°#Ý8S¾gßÛz»Ä>wPH@l:¾dò€šdꋾj|J^t>w/§+¾b ’óxœ¾m íE>Ç>vòÏ”Jç^¾]úw‡Ÿ`ݾo‚TÂ`Ô>v—.׳x¯¾W“ëRÓî=¾pïÈj” Z>v|£¯w¾P鹯c톾r ·ãÙR>u~ZÍ ƒ-¾D×@@’¾sÁêùli>t¾§}3F¾'O8êU*¹¾t šÃ{`>sÛ„ûîq>1b-WÞÇ#¾tâêUUÉ>rÔgë |t>Gpz˳ϾuUÎ}>q©Q›Uˆ>S(«ãN²¾v6Šsdñ>pYÖ¬+>Z™ÈþF§¾v«Jç'fj>mÎ^‚¥j>`þÁ™)l¿¾vøz/Æq«>j¤~iSÔ‰>d¡3¹1[þw/{#D >g9,:€ ¼>h+=¿Æe¾w¾ùp¼>c”æÉD >k“fþÇ?z¾vÖÍ{ÅX>__òO¬¨ >nÏÙ¸¯;}¾vk`€e>W;iI‰Ç‚>pë;û öþuÌîyOc¼>M…™Çê]>rN~ìÑ!ľtúoØE³†>8Òƒ-Gz>sŒ’$Ç«8¾sóouÉR¾'+HSxÀ>t en‰ ¾r¸îU‘¾G×mß•>u…{Èýb¾qIL9WŒÌ¾Tô‹+I)+>v5䓼q3¾oQ@Ïè—:¾]ç25€U.>v®”õå^¾k°ñÁo}¾cT]TØ à>vë>·FëÞ¾g¸"LݾgŽÜîB >vèŒ6E¾cn°ó¶Û¾k“½Êì<Ä>v£Í¬jÙ¾]½&«¹Hˆ¾oU,(7sh>vSŠ›¾T&O@»¨¾qb ½o¶ì>uMES~Ô¾Deù®Áý‰¾r鶺Ž>t:râ×s)6>D¢ºÿ’nî¾uI™bHŒ¶>qI ‰ëR>TŸ·¾sþE¾vyôÚG>nßèH%$>^ÅéÌy_ô¾v™•'¦O>j·¸OFÔñ>dNÉÙÊ!¾vÎR‡1ºµ>f$†@¡v>hÿŸZGJ¾v±4uHG>a3·ø‰>ma³mXs¾v?WKƒ©>Wê¹ë6B>p°OÖ-6¾uwçÒ|¨œ>IéÛϲ‡X>rt̡֘¾tZîpbÒž>^%wQ“>sõ%~RÁ¾rêxºÕ¾CqÙìu(ºãV¾Ï¾q(¦n¾U"ßM«O>vú e¾n6n|ŸîŒ¾`ºÝ¿4$>vŒcâöi¡¾i‘]¢3¾ev™ +L]>v°ÌÚ ¾dqfk;ƾj€Ùÿ|?>vqŽã„8¾]Õe–û;)¾où;E½w>u̺ØP4z¾R&ÍÙ›P¾qœ£¼`&£>tÂC¹,t¾8$èš¿c|¾s]ôÌ>sT“R>91šCjð¾tÅTƒtƒ4>q†B=ÿO>RŸMpÞ£)¾uÌ ª+)>n½å#ˆ(>^±ä¦„оvitoí)>iÌÿø´Çy>e"|€#=ξv—3ò´ §>dN¸q]%>jŒ‡Ï0Ž¾vQYýµ¶ù>\·è.á€>owé‹à5´¾u–2 úcì>P"ap>qãgzR]¾tfˆŒšö¦>(èc¯Ëh>s®Ã {g¾rÅÍG^ ¾D'<˜Çs >u¤¥5ïX¾pº'"¦cR¾W&dhÖ_}>vƒt£-å¾l˜ôZE  ¾açÞžýG¤>vvB¬g~¾g­ô',H¾gá®4P`>vi‡Š® ¬¾`÷µAß¾m[ ó¦a>uÙ<\2¾TÝß&îµÁ¾qòóˆ=>tÄÁ‚ºcH¾<ÚãEýˆ£¾scás0-í à>:Õ;Õš =¾t´åFÉ^>q" bÂ1^>T‚5× Š¾uËÏÆ'f>mI”„³sî>aJT:¾vZ:$ì >g‹G§Y>gX~™Ñ©¾vYlÐþ¶>a*u<Å>m"‘6¿²Š¾uÆ4ÉÅuÓ>T›Ÿ\ÔpR>qÈ"¾t¡.X>9¥µåŠô>s5סyW¾rîôïž¾@´´†ŒUF>tÐÃêƒ<=¾p¸/†Ô’¨¾VÔ†ûæX>uÞy3¤ýžl!jŽÉ¾bc£ y>vTAƒÐ¶¾eçCŠÒ¾˜¾hä‹!K >v+§öš’¾^)èé*nS¾n½,Ù>ub“ˉy¯¾O*Ž îâƾqßš…áZ>sû$aà½ýò3a&Öß¾sßE 7š>qýð¦9æë>MŸ 0‹¾uMak:£ý>në£5UCr>]ž;¿¾¯0¾v¦gkŒG>hçák§2_>e×ò2d¾v@Á‚h›B>b·& ²À>l@O|q‹h¾u¸W%ãV>UkÖkë >péÓPÞÄ>¾tƒ`n{Ë>7Uòñg>s0sÙ¨?à¾r¨`å8‡I¾CÔ½ÿ>tß&ã‹0§¾p3m±®ÚW¾Y|3_a‡ü>uåU´C¾jl 9Ää…¾d(ƒe_™?>v7u§ô…¾ceu9f¾jô]º!4v>uÏ ¶ÜG¾X{#þ¾pr”Š’¦B>t® þʾ¾@Ø÷|(Q¾râ*¹õ&>rÙHÄ ¶5>@“úm–²g¾t°ýìs•9>p^@RVoU>Xi0÷T!›¾uÌÛ»?½÷>j jP?ß>câoùþ…Û¾v(Ãnñù¤>c •{½ê>jèº/¾u¾Nª­P>WŠ´xÔß>pxÕY þ¾tŽ k>¬><7ºÍÕ²í>rû°7²ª ¾rŸ»Y´“ÿ¾C†çê‰>tÉVË&M¾pRë$M¾ZM­nQ%>uÖË=Ý– ¾i—U1F€L¾dùµüqV>v-h€¥¾b/ê ¦œ_¾l äºÏ.>u„£äùä¾T#w%¿ 9¾qÍä>t!Ìí;/ù¾(Ž1¨-¾srÊJ }J>qøþ¬_À>La¼àb»¾u q²E•>n9>T“>^ùý,•ºà¾uó˜ÐÄyø>gM>‘³Ó>gOÐ Ìœ ¾uðèJÙ ¾>^Þ¸@°þe>n?™®~dݾuï;BâÕ>K±A4/X>rßòª¾sVˆd!7j¾.l5Ì´d>t+÷˜aL¾pÓ…Råc¾U^]Î 'j>u‡@&¨9æ¾k<»”à,c¾c²e«Ê>vÒ–£Â¾c¬ý«Üé¾j±!>Q—>u“ˆl”j¾VˆÝÃÎ ¾pž*~«òR>t=àb+¾2ÔöÞ|¾s3ý¾uðP>r 9˜&úV>JÅz¯÷j¾tû0(sY>n'Qíl‡I>^ù®ž!¾uÞ¢†ñ%§>fäµ E‚Ä>g¥´=]#~¾uÐlšMŒ.>]:Bƒ>nÎÖ:³ ´¾tÎ{kwcø>F§æÅÉVÖ>rR3¾ša¾ráâ×’¾<Š­­&Å8>toô´®ÍQ¾pYgk< ¾YX¨¾ª¡œ>u¥èÉmÚ+¾i4½Õé¶ð¾e=·»§Ò`>uã?œu".ü(Pt¾P½C1¾q›Ü’¥G°>sh‹gŒØ>% ¨uö‘¾sú˜E;¹@>pÇׂ‚Yò>URüN1¸2¾um·nâ;>j¹Š{3­¿>cŠ…ä_èQ¾uá4‰+2>bœSF`„V>k‡^øX+ ¾uLZDŒ6>S-œä²õÞ>q˜,‚¾s³™T}öõ=ä¿0ÏÏo>s©—²X§t¾q'‘éŽ{•¾Rëýœ7L:>uDZ>d¾kŠMÜE㈾b’ñ#6?Å>u×ÆŠ±Ër¾ch5¿@ ¾jÎÉa>¥>uYÈ)™­y¾T˜ú»%‹é¾pßœƒÞë>sͬo ­»¾Þ7?‰»ð¾s„Bíg>qDP.}Þ‡>R“°ÿ®A¾u1F‰ý8>k·bVodg†(¾uÎuþø}|>cz»âE‰>j¸ P¦c¾uQ¿ˆ›½>Tuc<*áØ>pá­öãìµ¾s¼œ·/$k> vU ž>sŒ$…‹‰<¾q#'Se 5¾R×tL¡d>u5ï2t2¾kI3Ò“¾bÏ—h>uÆZT ýˆ¾bÚÕ‰¯¾k=eèuÝ>u3)v.¾RÒ0@ ¾q!>sèËM>søN™>Ñ54¹iƒ¾s½Ðhp>pÄÎl8ñ=>U ¾¦Ó´¹¾uN‹ÊrÒ>jB;£wBG>cò— D¾u»e£Ä]>aŒ2¾±>lR¢~Õ´¾tûÍÚ‡—>OtF §¿>q—FP·žI¾suu%¹e¾21¢Íùr>tgߤ¾p&GÎY¥Æ¾XŸÎá=p>ur¡,–’«¾hžÖ'ҳʾe²éÉÍ)>u¤ëSNž¾_—\D º¾månJM‚>t¢ÔÊXð¾Fk¡‹/¤¾r9›Îà>rx.<‘«2>B¾•=Íg–¾tzõ±hÍr>nƒuo"¬>]ygß3L;¾u•“ápôµ>fWÊÃå”>gùu¾è¹ ¾uvR|L>YÂs×>oÜóÒnÓÿ¾tex¤§ö>5røýtê¸#Fº¾lOúgJ¾a¸¦DËT>u§¢Ã$ʾcduÎP°h¾j®ï¦þCy>uÍ €~¾S/S66h¾q ´Å\åu>sZ9yOòÕ>¤j6J´„¾sÂh]ÒFý>pnÄRοç>VÇ'íÖR³¾uMnrMÁ>iMÇÉ 2>e*!ÿ¼E¾u“ðŽG͆>_zôÕ/"þ>m±N¿€/ø¾tHJ2ZD>EÒv}‹G»>r9Ȫ›´â¾rL¾¦oië¾D·ç3?Zo>t‚_LHQD¾mÚ2ÏŠn¾_ ñÅle>uŒÑùxÁ­¾eEâf”þ¾hï磾j>uFÔ´óM¾V¿Ž²µ.¾pk¸Œ"ÕA>s±‹sèÚ¾1ŽËtÒ¾s^S}Æ51>päva¼ŠÉ>SÛÀ×à ʾu9Û7>j`LjÇý>d„/Ò¹¼¾u^Ýcÿ{>`¹èHÉ>lß÷rØèð¾t¨m]¡°>I>ë7¹­`>q÷áÍ-¡•¾rs¯‹ÖÔ¾B'5À» >t_l–¶ ¾n'IfÒ‹¾^+K”øa>u}¹‹ˆ~¾ezfw2lR¾hµºÛžb(>u>q¹J¾VÖXÎÄ(ô¾pc3o²O>s£g݈È?¾‰ûù´A¾s`Züe"6>pÄؘà‹Y>T‚¼p#å;u^Ð ý·>i R$U&¶>dz3O•£µ¾u]ì,hi>` ’‚3Œ->mcX©BÂS¾t}Ýö­Û>E–M‚‰Fe>r3 TJñ¾r#¬·`r¾Fx—3‘È>t… vCÕ¾m0~Jßá~¾`Hê”L)>u~ßÇ Œ¾d+mF­¾i㾨jGŒ>uZþºå¾S™Ñµ¸I¾pæg¯´¼(>s7îú˜2¨>#½.®è&ë¾s½ Þä®—>pàHÚ½'>Xg¹âxÆ´¾uCø+ð‹>gδ‘=ç>f_Ff.¸õ¾u^è‹Ç¶‰>[›¯ê)83>o‡æ¾t *ÔR¯^>6Úé½Èo>rÔAQ˜¾qZÈÉ“Ñ“¾P™94…>tÜží B¢¾jû`G¥¾bèïòɪ>u{¦]¹'¾ah¡.﫾l>ÿ™ùQ->t£&ûš¾J†ê3éý¾qÕ_ƒhe>ramé#÷¶>BrëqfƾtS‹ºlð>m·õ-O;w>_í—Y°¾ulŽµwi>džŒLrÈ>ipVZè\…¾u A•m*q>T*PMpÉ®pÉ{†¾s4‘´ôZÙ¾"¬ØeGHÎ>s²ïj›¾pw:èïF¾X³[9Ì~Ô>u<)¤Dyú¾gv,–q¿U¾f¯eèÆ¥>uJ­Ÿ¼E›¾Zlœžãí¾oq‹,÷å>sÚè²üµÎ¾0-£ )·À¾sR¿50>qêé5ö>R¥³Dn+¾tñâ±El%>iõqeôÆK>d8ÎLà‹¾uhÂìIó„>`ÏX÷%¥>mQvž·´¾tZâÜRtr>CÎè~7èk>rDéƒ?ìm¾qÙÔÐ\r¾I÷´¤{_ª>t”§K¾l#¨=¯ÉG¾a|!çŠÔ>ul#1ĸp¾b¼vEHP¾k<¬ÛY[ž>tº} Q˜¾N€Fßú£¾q…e´Ã{`>rŠä©ÝÃþ>>é{s@оt*;¹•ZÉ>nwáßp>^,C$2<(¾uZ©@ŸçÅ>dÍ؇é>i:g¯™˜Ç¾tÿ1aŽb¸>T¶xK¶×>pÆ3±»¾sÿ#Í™3¾'ïÔ!>s·¤è. ¾o«f,Ã<¾Y®² ¯›N>u9bZh¾fË+›Y¾gOíÎÞºš>u-ßN”œÁ¾Xzbs•xt¾p ÌeðÃ>s”i—ξÒÒ5ßH8¾s@âm:>pŠ0ñ|Ý>U‚¹ù¹‡¾u ¹·c¿>h×ß%\D>e€×6ŸŠå¾uJÔ—3>\i‹Ð!!>n«äU­¾sõœUÖX>6_•ØÌÞî>rÉ-‚+¾q$ýnAü¾Q©"A9ûT>t×ò@xm¾j¾p⪾cÏa­Œö%>uYÄ‘ÞOƾ_ï`$·|z¾mRJÜÇ>tC¼×p¥7¾B„¹,_6¾rSƒºâZ>q©pˆrì[>LA€¼å锾tžTwvhP>kwcšãâ>b<¤T½=¾u]܉žï>aŠ.&ëüò>l 2I¥Oþt‚4î’„>I$UKˆÛ>qàn%³Þª¾r‡õ;?¾EÎÄ!AU>tb!Ód¾l© áꬾ`ÈÔƒ7§y>uYÀÊwo#¾bð‹ô?!z¾jÚì»A2>t³²¾O#ªKr¾qr°ê„3>rzó(×ë>?àÜH;»¾t%7KºÒn>m´¦4³†þ>^æÏÊéÖ†¾uO¥i¾>d.ý¢Jº>i¿1v’—¾tÚFj€²ƒ>R; “ÛU|>q ÁNs÷ ¾rÍ}å¾5?ÀsÑQ>sèüÿ0w;¾nžÄ¸f¾\v”º…ò>uAN`-¾eI™Îó¦è¾h¹ Î4j`>tøpéD9¤¾T¡™Z|F¾p©1çß>s±§c->'IN~?Ž,¾s®{”>c€>ok•.^Jv>Z=æçÍê¾u0(lÂú4>fD@+ÉÐ[>gÇý€L ¾u´(—ôß>VÇ°GSÔ>pN>ØüäX¾sNÒ›ÿ2ø¾ÒšItBƒ>sveˆ3—ù¾pu`Þ˘¾X9"•Ý >uJÆ3eg¾g"ž“¾fë=¤n>u!wFê(V¾X´2hx©¾oóÐP÷T«>sÞâ)*õ¾U+e x¾sA+×õY>p^Ká!‘>Vd¡ÐV¾u ‹ò- ã>gè‰_!@>f!Dî`ì¾u.äeÊ(„>Zlëás•ò>oWôBŒ5‹¾s­¦¤rº¸>'¿óÜ9ˆ>s»|P'¾p£@DˆN^¾Tº©JzôŠ>tõ†é/Šý¾h—×I×t¾eh粌ß>u8êf?~¾[øRp#Ö¾nÈKË¢u¸>sÓW²©&¾2:ŒZ[Œ¾rà ÀV(g>pà=˜0>S8k`(B¾tᯠ# c>i4´: Ö>dÀ$Ö…a¾u@Kg>][^j— ±>nD'öIkî¾sóìj]œ>7ö±rþ>r´@|þÔë¾q'4•Ìß¾QÚ¤…ayÃ>tÎ\„R•¾iÀa=™¢®¾d&Ðh {>uE›mO¸¾^™¾*\¾n¾mË=±‡§!>tQ>õ¾=¾¸· ˾r‹Ñ²Ë›‹>qE£ü7Ï>PŸª%ÉYu¾t»õ ‡j>j<# Úqñ>cœæÐÌ:¾uIP+ÿ>_³;h@ÐÜ>m^¹ Ⱦt(¼þrÄ>@ÓeòMbŒ>rg¢Ó2¹¾qnSÔ;I¾OhàÉ>t«]UaÍã¾j¤Äæ©BÔ¾c'ÅkÆ£Ò>uK¼)&u̾`M™,©†¾mÃÁÌæ>t: eK.Ÿ¾B”ÔB9탾rL pE€Z>q‹'ê+>M¡ÚËêKl¾t n€çZ>jãc¢XR>béT÷C¾uM{ìk>`tØ7KH£>lõ¯z:Lˆ¾t;›VZº>Bî¨F”¦>ra‚4ÞŒ¾qf…Õ3Šw¾P¦æVP >tÚƒÍìâ¾h°1|÷õŽ¾iI\——Û>z q3¦Ú>wÞëOHõJ¾Y„á4†Ð¾q/O‘í >xW´Üø¾`‡?b–ð­¾od¦ÄóëC>x¦Lxfú˾dZc·­F¾lRÃ@¬˜>xÍyggÎ?ýY¾i1q2Ÿ>xа¡Ö;—¾j}â|Ö{¾f¨ ¤L>x²ù[W¾mWô‰#T¾bßBè‰Ó*>xw²ÊÆ&z¾oõg™2/l¾_w%-˜s.>x"&‡’3¾q+‚NŒ¾YF0Ÿßâ‰>wµŽš_Û@¾r?Ã9Î^¾S56*X5L>w5b| –¾s6cÛ¥©#¾J˜¾+—•²>v£ª•¼1¾t‘EÊÃW¾>J2·-Ò>vDQp¾tÔñ]Zé3¾ j2‰^K$>uY“‰BµŸ¾u~÷»8Õ.>)öéuÜùª>t¦&HJ©H¾v/ø¨«¿>@œßŽ×pB>sì\¥¡B¾v5ÕÅb1>J=ÓU›¬.>s.hä/̾vú®_ùq¶>Q®–ïÎåï>rnNøP5¾wSAžhœ>Uü€¡ª t>q­å¸,‰ã¾w›•5Ý?—>ZQÇÎLØ>pî×\pt«¾wÕGÎs>]ÒBÞ–3>p2£’5ôn¾xí¨ vŸ>`­€ ý’G>nõB?KÓw¾x# {çx#>bQÍpbâ>>m!Ÿ; ¾x:4Fì>cÖ·Í´U!>l7œlü3¶¾xHy­mž>e= 9¥¼Û>jíêK¡^5¾xOzþ\>f…° Úë>i´‚ŒØ:¾xPTÃIÿÏ>g±–1 ">hŒÄƒi‡Ã¾xL-¦ê(>hÁ¹!9`>gwÜ6fX¾xD÷ x>i·hãgr>fvÇb Ë.¾x8÷ÄÈ%>j’°z¸F>eŠXóP¹¨¾x+¾Ü¿Tî>kUwÝy>d³?SÍC.¾x/¢Ï9®>lWœ_ B>cò„äÞF¾x ü¹H“>l”/™±ÖŠ>cG~?©|¾wþÂ,Y­P>mÌ9J¢Æ>b²Ø´wf#¾wð²9ô4>myçU¥_h>b5u”äðô¾wâ;Znì>mÍ&}Ö‚>aÏZøa ¾wÕ¼Ö{ãt>n 6;>a㞼ɼ¾wÊÓX›n76Þ°>aGÐÂB‘¾wÁ²ûÄÖH>nNà”W…ñ>a&ÚG;wº|ë¢æt>nS]¢ßõc>aèC9uȾwµ>Ô !Q>nDÞʲø>a)Õů+½¾w±óöîõn>n#{^ì Ó>aMpGݾw°…—ˆá>mï4ÏN(>a‡z Á#²¾w°Ê¢ÄU%>m§ôhÔ|ù>a×¥~ñ®¥¾w²ˆ-ÿ¡'>mMTE‚>b=˜3úM¾wµrZv>lßÅý´Å>b¸èøÛľw¹+ž–d>l^Fµ¯>cIÚq÷·¾w½Eê!b>kÈ®Á|¬Û>cí«ÓÐN¾wÁAׄ>k§Sç–>d¥òì§n¾wÄ:ÍËV>j_fÁtž'>eq>—Uñ ¾wÆ‘b¦7÷>iŠ´8§¹‚>fNÃMû~¾wÆ•ÉOÃ>hŸêT†€,>g=š» Ú¾wÃÞ¬ ÎÁ>gžz[¼v->h<Á>âÔp¾w½žŒáÆ<>f…Ö™-7<>iKHÁˆ¾w²ùZÀz;>eUv$òi>jgUxçO®¾w£Ma>d Ù.u%Ÿ>k{f¯¾wŒÏ^)[Ó>b«bÃ?ï>lÃÐ?©Üï¾woSÔÁ}b>a13R®>nÆK{Gº¾wIˆ„¢2‘>_;D4F>oE€é]S¾wZ×Q>[à¡NDTl>pGZ&ƒä¾v஋ÄÛ¨>XS(©‘Ö‹>pí®’Ú1X¾v›g!ÄC÷>T’Ý"­Â>q”QföT¾vIc4ºM(>P [@Îã>r9ò hž:¾ué‚ g >HùSñ˜Õ>rÝ'â&Z¾uz¨”J2þ>@R‰â±æ>s|nÓ®IŽ¾tû¿> *">-AL€z u>t.Æ“VX¾tk»,N›ï¾A¬HMü>t¨µbœƾsÉŸË|ø:¾7a‘ r)0>u2; Ȭ¦¾s‚õEsm¾E¡Ïù<©>u°äo»Ôð¾rK’=y"ý¾OÒYê*3>v"ÄBêv¾qnŒåËL¾UÜ°Ñû>v…ÞMæ=Ù¾p{~7G*¾Zcˆ•Uå>vØ+i˜tm¾næ±$×+º¾_¸î?áK>wÂôÇ+¾lªÊÅæ9h¾bŠgá +k>wB$Èï5Ö¾jC+.«Ä7¾e7pñçy>wU³Øä.;g°#Ý8S¾gßÛz»Ä>wPH@l:¾dò€šdꋾj|J^t>w/§+¾b ’óxœ¾m íE>Ç>vòÏ”Jç^¾]úw‡Ÿ`ݾo‚TÂ`Ô>v—.׳x¯¾W“ëRÓî=¾pïÈj” Z>v|£¯w¾P鹯c톾r ·ãÙR>u~ZÍ ƒ-¾D×@@’¾sÁêùli>t¾§}3F¾'O8êU*¹¾t šÃ{`>sÛ„ûîq>1b-WÞÇ#¾tâêUUÉ>rÔgë |t>Gpz˳ϾuUÎ}>q©Q›Uˆ>S(«ãN²¾v6Šsdñ>pYÖ¬+>Z™ÈþF§¾v«Jç'fj>mÎ^‚¥j>`þÁ™)l¿¾vøz/Æq«>j¤~iSÔ‰>d¡3¹1[þw/{#D >g9,:€ ¼>h+=¿Æe¾w¾ùp¼>c”æÉD >k“fþÇ?z¾vÖÍ{ÅX>__òO¬¨ >nÏÙ¸¯;}¾vk`€e>W;iI‰Ç‚>pë;û öþuÌîyOc¼>M…™Çê]>rN~ìÑ!ľtúoØE³†>8Òƒ-Gz>sŒ’$Ç«8¾sóouÉR¾'+HSxÀ>t en‰ ¾r¸îU‘¾G×mß•>u…{Èýb¾qIL9WŒÌ¾Tô‹+I)+>v5䓼q3¾oQ@Ïè—:¾]ç25€U.>v®”õå^¾k°ñÁo}¾cT]TØ à>vë>·FëÞ¾g¸"LݾgŽÜîB >vèŒ6E¾cn°ó¶Û¾k“½Êì<Ä>v£Í¬jÙ¾]½&«¹Hˆ¾oU,(7sh>vSŠ›¾T&O@»¨¾qb ½o¶ì>uMES~Ô¾Deù®Áý‰¾r鶺Ž>t:râ×s)6>D¢ºÿ’nî¾uI™bHŒ¶>qI ‰ëR>TŸ·¾sþE¾vyôÚG>nßèH%$>^ÅéÌy_ô¾v™•'¦O>j·¸OFÔñ>dNÉÙÊ!¾vÎR‡1ºµ>f$†@¡v>hÿŸZGJ¾v±4uHG>a3·ø‰>ma³mXs¾v?WKƒ©>Wê¹ë6B>p°OÖ-6¾uwçÒ|¨œ>IéÛϲ‡X>rt̡֘¾tZîpbÒž>^%wQ“>sõ%~RÁ¾rêxºÕ¾CqÙìu(ºãV¾Ï¾q(¦n¾U"ßM«O>vú e¾n6n|ŸîŒ¾`ºÝ¿4$>vŒcâöi¡¾i‘]¢3¾ev™ +L]>v°ÌÚ ¾dqfk;ƾj€Ùÿ|?>vqŽã„8¾]Õe–û;)¾où;E½w>u̺ØP4z¾R&ÍÙ›P¾qœ£¼`&£>tÂC¹,t¾8$èš¿c|¾s]ôÌ>sT“R>91šCjð¾tÅTƒtƒ4>q†B=ÿO>RŸMpÞ£)¾uÌ ª+)>n½å#ˆ(>^±ä¦„оvitoí)>iÌÿø´Çy>e"|€#=ξv—3ò´ §>dN¸q]%>jŒ‡Ï0Ž¾vQYýµ¶ù>\·è.á€>owé‹à5´¾u–2 úcì>P"ap>qãgzR]¾tfˆŒšö¦>(èc¯Ëh>s®Ã {g¾rÅÍG^ ¾D'<˜Çs >u¤¥5ïX¾pº'"¦cR¾W&dhÖ_}>vƒt£-å¾l˜ôZE  ¾açÞžýG¤>vvB¬g~¾g­ô',H¾gá®4P`>vi‡Š® ¬¾`÷µAß¾m[ ó¦a>uÙ<\2¾TÝß&îµÁ¾qòóˆ=>tÄÁ‚ºcH¾<ÚãEýˆ£¾scás0-í à>:Õ;Õš =¾t´åFÉ^>q" bÂ1^>T‚5× Š¾uËÏÆ'f>mI”„³sî>aJT:¾vZ:$ì >g‹G§Y>gX~™Ñ©¾vYlÐþ¶>a*u<Å>m"‘6¿²Š¾uÆ4ÉÅuÓ>T›Ÿ\ÔpR>qÈ"¾t¡.X>9¥µåŠô>s5סyW¾rîôïž¾@´´†ŒUF>tÐÃêƒ<=¾p¸/†Ô’¨¾VÔ†ûæX>uÞy3¤ýžl!jŽÉ¾bc£ y>vTAƒÐ¶¾eçCŠÒ¾˜¾hä‹!K >v+§öš’¾^)èé*nS¾n½,Ù>ub“ˉy¯¾O*Ž îâƾqßš…áZ>sû$aà½ýò3a&Öß¾sßE 7š>qýð¦9æë>MŸ 0‹¾uMak:£ý>në£5UCr>]ž;¿¾¯0¾v¦gkŒG>hçák§2_>e×ò2d¾v@Á‚h›B>b·& ²À>l@O|q‹h¾u¸W%ãV>UkÖkë >péÓPÞÄ>¾tƒ`n{Ë>7Uòñg>s0sÙ¨?à¾r¨`å8‡I¾CÔ½ÿ>tß&ã‹0§¾p3m±®ÚW¾Y|3_a‡ü>uåU´C¾jl 9Ää…¾d(ƒe_™?>v7u§ô…¾ceu9f¾jô]º!4v>uÏ ¶ÜG¾X{#þ¾pr”Š’¦B>t® þʾ¾@Ø÷|(Q¾râ*¹õ&>rÙHÄ ¶5>@“úm–²g¾t°ýìs•9>p^@RVoU>Xi0÷T!›¾uÌÛ»?½÷>j jP?ß>câoùþ…Û¾v(Ãnñù¤>c •{½ê>jèº/¾u¾Nª­P>WŠ´xÔß>pxÕY þ¾tŽ k>¬><7ºÍÕ²í>rû°7²ª ¾rŸ»Y´“ÿ¾C†çê‰>tÉVË&M¾pRë$M¾ZM­nQ%>uÖË=Ý– ¾i—U1F€L¾dùµüqV>v-h€¥¾b/ê ¦œ_¾l äºÏ.>u„£äùä¾T#w%¿ 9¾qÍä>t!Ìí;/ù¾(Ž1¨-¾srÊJ }J>qøþ¬_À>La¼àb»¾u q²E•>n9>T“>^ùý,•ºà¾uó˜ÐÄyø>gM>‘³Ó>gOÐ Ìœ ¾uðèJÙ ¾>^Þ¸@°þe>n?™®~dݾuï;BâÕ>K±A4/X>rßòª¾sVˆd!7j¾.l5Ì´d>t+÷˜aL¾pÓ…Råc¾U^]Î 'j>u‡@&¨9æ¾k<»”à,c¾c²e«Ê>vÒ–£Â¾c¬ý«Üé¾j±!>Q—>u“ˆl”j¾VˆÝÃÎ ¾pž*~«òR>t=àb+¾2ÔöÞ|¾s3ý¾uðP>r 9˜&úV>JÅz¯÷j¾tû0(sY>n'Qíl‡I>^ù®ž!¾uÞ¢†ñ%§>fäµ E‚Ä>g¥´=]#~¾uÐlšMŒ.>]:Bƒ>nÎÖ:³ ´¾tÎ{kwcø>F§æÅÉVÖ>rR3¾ša¾ráâ×’¾<Š­­&Å8>toô´®ÍQ¾pYgk< ¾YX¨¾ª¡œ>u¥èÉmÚ+¾i4½Õé¶ð¾e=·»§Ò`>uã?œu".ü(Pt¾P½C1¾q›Ü’¥G°>sh‹gŒØ>% ¨uö‘¾sú˜E;¹@>pÇׂ‚Yò>URüN1¸2¾um·nâ;>j¹Š{3­¿>cŠ…ä_èQ¾uá4‰+2>bœSF`„V>k‡^øX+ ¾uLZDŒ6>S-œä²õÞ>q˜,‚¾s³™T}öõ=ä¿0ÏÏo>s©—²X§t¾q'‘éŽ{•¾Rëýœ7L:>uDZ>d¾kŠMÜE㈾b’ñ#6?Å>u×ÆŠ±Ër¾ch5¿@ ¾jÎÉa>¥>uYÈ)™­y¾T˜ú»%‹é¾pßœƒÞë>sͬo ­»¾Þ7?‰»ð¾s„Bíg>qDP.}Þ‡>R“°ÿ®A¾u1F‰ý8>k·bVodg†(¾uÎuþø}|>cz»âE‰>j¸ P¦c¾uQ¿ˆ›½>Tuc<*áØ>pá­öãìµ¾s¼œ·/$k> vU ž>sŒ$…‹‰<¾q#'Se 5¾R×tL¡d>u5ï2t2¾kI3Ò“¾bÏ—h>uÆZT ýˆ¾bÚÕ‰¯¾k=eèuÝ>u3)v.¾RÒ0@ ¾q!>sèËM>søN™>Ñ54¹iƒ¾s½Ðhp>pÄÎl8ñ=>U ¾¦Ó´¹¾uN‹ÊrÒ>jB;£wBG>cò— D¾u»e£Ä]>aŒ2¾±>lR¢~Õ´¾tûÍÚ‡—>OtF §¿>q—FP·žI¾suu%¹e¾21¢Íùr>tgߤ¾p&GÎY¥Æ¾XŸÎá=p>ur¡,–’«¾hžÖ'ҳʾe²éÉÍ)>u¤ëSNž¾_—\D º¾månJM‚>t¢ÔÊXð¾Fk¡‹/¤¾r9›Îà>rx.<‘«2>B¾•=Íg–¾tzõ±hÍr>nƒuo"¬>]ygß3L;¾u•“ápôµ>fWÊÃå”>gùu¾è¹ ¾uvR|L>YÂs×>oÜóÒnÓÿ¾tex¤§ö>5røýtê¸#Fº¾lOúgJ¾a¸¦DËT>u§¢Ã$ʾcduÎP°h¾j®ï¦þCy>uÍ €~¾S/S66h¾q ´Å\åu>sZ9yOòÕ>¤j6J´„¾sÂh]ÒFý>pnÄRοç>VÇ'íÖR³¾uMnrMÁ>iMÇÉ 2>e*!ÿ¼E¾u“ðŽG͆>_zôÕ/"þ>m±N¿€/ø¾tHJ2ZD>EÒv}‹G»>r9Ȫ›´â¾rL¾¦oië¾D·ç3?Zo>t‚_LHQD¾mÚ2ÏŠn¾_ ñÅle>uŒÑùxÁ­¾eEâf”þ¾hï磾j>uFÔ´óM¾V¿Ž²µ.¾pk¸Œ"ÕA>s±‹sèÚ¾1ŽËtÒ¾s^S}Æ51>päva¼ŠÉ>SÛÀ×à ʾu9Û7>j`LjÇý>d„/Ò¹¼¾u^Ýcÿ{>`¹èHÉ>lß÷rØèð¾t¨m]¡°>I>ë7¹­`>q÷áÍ-¡•¾rs¯‹ÖÔ¾B'5À» >t_l–¶ ¾n'IfÒ‹¾^+K”øa>u}¹‹ˆ~¾ezfw2lR¾hµºÛžb(>u>q¹J¾VÖXÎÄ(ô¾pc3o²O>s£g݈È?¾‰ûù´A¾s`Züe"6>pÄؘà‹Y>T‚¼p#å;u^Ð ý·>i R$U&¶>dz3O•£µ¾u]ì,hi>` ’‚3Œ->mcX©BÂS¾t}Ýö­Û>E–M‚‰Fe>r3 TJñ¾r#¬·`r¾Fx—3‘È>t… vCÕ¾m0~Jßá~¾`Hê”L)>u~ßÇ Œ¾d+mF­¾i㾨jGŒ>uZþºå¾S™Ñµ¸I¾pæg¯´¼(>s7îú˜2¨>#½.®è&ë¾s½ Þä®—>pàHÚ½'>Xg¹âxÆ´¾uCø+ð‹>gδ‘=ç>f_Ff.¸õ¾u^è‹Ç¶‰>[›¯ê)83>o‡æ¾t *ÔR¯^>6Úé½Èo>rÔAQ˜¾qZÈÉ“Ñ“¾P™94…>tÜží B¢¾jû`G¥¾bèïòɪ>u{¦]¹'¾ah¡.﫾l>ÿ™ùQ->t£&ûš¾J†ê3éý¾qÕ_ƒhe>ramé#÷¶>BrëqfƾtS‹ºlð>m·õ-O;w>_í—Y°¾ulŽµwi>džŒLrÈ>ipVZè\…¾u A•m*q>T*PMpÉ®pÉ{†¾s4‘´ôZÙ¾"¬ØeGHÎ>s²ïj›¾pw:èïF¾X³[9Ì~Ô>u<)¤Dyú¾gv,–q¿U¾f¯eèÆ¥>uJ­Ÿ¼E›¾Zlœžãí¾oq‹,÷å>sÚè²üµÎ¾0-£ )·À¾sR¿50>qêé5ö>R¥³Dn+¾tñâ±El%>iõqeôÆK>d8ÎLà‹¾uhÂìIó„>`ÏX÷%¥>mQvž·´¾tZâÜRtr>CÎè~7èk>rDéƒ?ìm¾qÙÔÐ\r¾I÷´¤{_ª>t”§K¾l#¨=¯ÉG¾a|!çŠÔ>ul#1ĸp¾b¼vEHP¾k<¬ÛY[ž>tº} Q˜¾N€Fßú£¾q…e´Ã{`>rŠä©ÝÃþ>>é{s@оt*;¹•ZÉ>nwáßp>^,C$2<(¾uZ©@ŸçÅ>dÍ؇é>i:g¯™˜Ç¾tÿ1aŽb¸>T¶xK¶×>pÆ3±»¾sÿ#Í™3¾'ïÔ!>s·¤è. ¾o«f,Ã<¾Y®² ¯›N>u9bZh¾fË+›Y¾gOíÎÞºš>u-ßN”œÁ¾Xzbs•xt¾p ÌeðÃ>s”i—ξÒÒ5ßH8¾s@âm:>pŠ0ñ|Ý>U‚¹ù¹‡¾u ¹·c¿>h×ß%\D>e€×6ŸŠå¾uJÔ—3>\i‹Ð!!>n«äU­¾sõœUÖX>6_•ØÌÞî>rÉ-‚+¾q$ýnAü¾Q©"A9ûT>t×ò@xm¾j¾p⪾cÏa­Œö%>uYÄ‘ÞOƾ_ï`$·|z¾mRJÜÇ>tC¼×p¥7¾B„¹,_6¾rSƒºâZ>q©pˆrì[>LA€¼å锾tžTwvhP>kwcšãâ>b<¤T½=¾u]܉žï>aŠ.&ëüò>l 2I¥Oþt‚4î’„>I$UKˆÛ>qàn%³Þª¾r‡õ;?¾EÎÄ!AU>tb!Ód¾l© áꬾ`ÈÔƒ7§y>uYÀÊwo#¾bð‹ô?!z¾jÚì»A2>t³²¾O#ªKr¾qr°ê„3>rzó(×ë>?àÜH;»¾t%7KºÒn>m´¦4³†þ>^æÏÊéÖ†¾uO¥i¾>d.ý¢Jº>i¿1v’—¾tÚFj€²ƒ>R; “ÛU|>q ÁNs÷ ¾rÍ}å¾5?ÀsÑQ>sèüÿ0w;¾nžÄ¸f¾\v”º…ò>uAN`-¾eI™Îó¦è¾h¹ Î4j`>tøpéD9¤¾T¡™Z|F¾p©1çß>s±§c->'IN~?Ž,¾s®{”>c€>ok•.^Jv>Z=æçÍê¾u0(lÂú4>fD@+ÉÐ[>gÇý€L ¾u´(—ôß>VÇ°GSÔ>pN>ØüäX¾sNÒ›ÿ2ø¾ÒšItBƒ>sveˆ3—ù¾pu`Þ˘¾X9"•Ý >uJÆ3eg¾g"ž“¾fë=¤n>u!wFê(V¾X´2hx©¾oóÐP÷T«>sÞâ)*õ¾U+e x¾sA+×õY>p^Ká!‘>Vd¡ÐV¾u ‹ò- ã>gè‰_!@>f!Dî`ì¾u.äeÊ(„>Zlëás•ò>oWôBŒ5‹¾s­¦¤rº¸>'¿óÜ9ˆ>s»|P'¾p£@DˆN^¾Tº©JzôŠ>tõ†é/Šý¾h—×I×t¾eh粌ß>u8êf?~¾[øRp#Ö¾nÈKË¢u¸>sÓW²©&¾2:ŒZ[Œ¾rà ÀV(g>pà=˜0>S8k`(B¾tᯠ# c>i4´: Ö>dÀ$Ö…a¾u@Kg>][^j— ±>nD'öIkî¾sóìj]œ>7ö±rþ>r´@|þÔë¾q'4•Ìß¾QÚ¤…ayÃ>tÎ\„R•¾iÀa=™¢®¾d&Ðh {>uE›mO¸¾^™¾*\¾n¾mË=±‡§!>tQ>õ¾=¾¸· ˾r‹Ñ²Ë›‹>qE£ü7Ï>PŸª%ÉYu¾t»õ ‡j>j<# Úqñ>cœæÐÌ:¾uIP+ÿ>_³;h@ÐÜ>m^¹ Ⱦt(¼þrÄ>@ÓeòMbŒ>rg¢Ó2¹¾qnSÔ;I¾OhàÉ>t«]UaÍã¾j¤Äæ©BÔ¾c'ÅkÆ£Ò>uK¼)&u̾`M™,©†¾mÃÁÌæ>t: eK.Ÿ¾B”ÔB9탾rL pE€Z>q‹'ê+>M¡ÚËêKl¾t n€çZ>jãc¢XR>béT÷C¾uM{ìk>`tØ7KH£>lõ¯z:Lˆ¾t;›VZº>Bî¨F”¦>ra‚4ÞŒ¾qf…Õ3Šw¾P¦æVP >tÚƒÍìâ¾h°1|÷õŽ¾iI\——Û>z q3¦Ú>wÞëOHõJ¾Y„á4†Ð¾q/O‘í >xW´Üø¾`‡?b–ð­¾od¦ÄóëC>x¦Lxfú˾dZc·­F¾lRÃ@¬˜>xÍyggÎ?ýY¾i1q2Ÿ>xа¡Ö;—¾j}â|Ö{¾f¨ ¤L>x²ù[W¾mWô‰#T¾bßBè‰Ó*>xw²ÊÆ&z¾oõg™2/l¾_w%-˜s.>x"&‡’3¾q+‚NŒ¾YF0Ÿßâ‰>wµŽš_Û@¾r?Ã9Î^¾S56*X5L>w5b| –¾s6cÛ¥©#¾J˜¾+—•²>v£ª•¼1¾t‘EÊÃW¾>J2·-Ò>vDQp¾tÔñ]Zé3¾ j2‰^K$>uY“‰BµŸ¾u~÷»8Õ.>)öéuÜùª>t¦&HJ©H¾v/ø¨«¿>@œßŽ×pB>sì\¥¡B¾v5ÕÅb1>J=ÓU›¬.>s.hä/̾vú®_ùq¶>Q®–ïÎåï>rnNøP5¾wSAžhœ>Uü€¡ª t>q­å¸,‰ã¾w›•5Ý?—>ZQÇÎLØ>pî×\pt«¾wÕGÎs>]ÒBÞ–3>p2£’5ôn¾xí¨ vŸ>`­€ ý’G>nõB?KÓw¾x# {çx#>bQÍpbâ>>m!Ÿ; ¾x:4Fì>cÖ·Í´U!>l7œlü3¶¾xHy­mž>e= 9¥¼Û>jíêK¡^5¾xOzþ\>f…° Úë>i´‚ŒØ:¾xPTÃIÿÏ>g±–1 ">hŒÄƒi‡Ã¾xL-¦ê(>hÁ¹!9`>gwÜ6fX¾xD÷ x>i·hãgr>fvÇb Ë.¾x8÷ÄÈ%>j’°z¸F>eŠXóP¹¨¾x+¾Ü¿Tî>kUwÝy>d³?SÍC.¾x/¢Ï9®>lWœ_ B>cò„äÞF¾x ü¹H“>l”/™±ÖŠ>cG~?©|¾wþÂ,Y­P>mÌ9J¢Æ>b²Ø´wf#¾wð²9ô4>myçU¥_h>b5u”äðô¾wâ;Znì>mÍ&}Ö‚>aÏZøa ¾wÕ¼Ö{ãt>n 6;>a㞼ɼ¾wÊÓX›n76Þ°>aGÐÂB‘¾wÁ²ûÄÖH>nNà”W…ñ>a&ÚG;wº|ë¢æt>nS]¢ßõc>aèC9uȾwµ>Ô !Q>nDÞʲø>a)Õů+½¾w±óöîõn>n#{^ì Ó>aMpGݾw°…—ˆá>mï4ÏN(>a‡z Á#²¾w°Ê¢ÄU%>m§ôhÔ|ù>a×¥~ñ®¥¾w²ˆ-ÿ¡'>mMTE‚>b=˜3úM¾wµrZv>lßÅý´Å>b¸èøÛľw¹+ž–d>l^Fµ¯>cIÚq÷·¾w½Eê!b>kÈ®Á|¬Û>cí«ÓÐN¾wÁAׄ>k§Sç–>d¥òì§n¾wÄ:ÍËV>j_fÁtž'>eq>—Uñ ¾wÆ‘b¦7÷>iŠ´8§¹‚>fNÃMû~¾wÆ•ÉOÃ>hŸêT†€,>g=š» Ú¾wÃÞ¬ ÎÁ>gžz[¼v->h<Á>âÔp¾w½žŒáÆ<>f…Ö™-7<>iKHÁˆ¾w²ùZÀz;>eUv$òi>jgUxçO®¾w£Ma>d Ù.u%Ÿ>k{f¯¾wŒÏ^)[Ó>b«bÃ?ï>lÃÐ?©Üï¾woSÔÁ}b>a13R®>nÆK{Gº¾wIˆ„¢2‘>_;D4F>oE€é]S¾wZ×Q>[à¡NDTl>pGZ&ƒä¾v஋ÄÛ¨>XS(©‘Ö‹>pí®’Ú1X¾v›g!ÄC÷>T’Ý"­Â>q”QföT¾vIc4ºM(>P [@Îã>r9ò hž:¾ué‚ g >HùSñ˜Õ>rÝ'â&Z¾uz¨”J2þ>@R‰â±æ>s|nÓ®IŽ¾tû¿> *">-AL€z u>t.Æ“VX¾tk»,N›ï¾A¬HMü>t¨µbœƾsÉŸË|ø:¾7a‘ r)0>u2; Ȭ¦¾s‚õEsm¾E¡Ïù<©>u°äo»Ôð¾rK’=y"ý¾OÒYê*3>v"ÄBêv¾qnŒåËL¾UÜ°Ñû>v…ÞMæ=Ù¾p{~7G*¾Zcˆ•Uå>vØ+i˜tm¾næ±$×+º¾_¸î?áK>wÂôÇ+¾lªÊÅæ9h¾bŠgá +k>wB$Èï5Ö¾jC+.«Ä7¾e7pñçy>wU³Øä.;g°#Ý8S¾gßÛz»Ä>wPH@l:¾dò€šdꋾj|J^t>w/§+¾b ’óxœ¾m íE>Ç>vòÏ”Jç^¾]úw‡Ÿ`ݾo‚TÂ`Ô>v—.׳x¯¾W“ëRÓî=¾pïÈj” Z>v|£¯w¾P鹯c톾r ·ãÙR>u~ZÍ ƒ-¾D×@@’¾sÁêùli>t¾§}3F¾'O8êU*¹¾t šÃ{`>sÛ„ûîq>1b-WÞÇ#¾tâêUUÉ>rÔgë |t>Gpz˳ϾuUÎ}>q©Q›Uˆ>S(«ãN²¾v6Šsdñ>pYÖ¬+>Z™ÈþF§¾v«Jç'fj>mÎ^‚¥j>`þÁ™)l¿¾vøz/Æq«>j¤~iSÔ‰>d¡3¹1[þw/{#D >g9,:€ ¼>h+=¿Æe¾w¾ùp¼>c”æÉD >k“fþÇ?z¾vÖÍ{ÅX>__òO¬¨ >nÏÙ¸¯;}¾vk`€e>W;iI‰Ç‚>pë;û öþuÌîyOc¼>M…™Çê]>rN~ìÑ!ľtúoØE³†>8Òƒ-Gz>sŒ’$Ç«8¾sóouÉR¾'+HSxÀ>t en‰ ¾r¸îU‘¾G×mß•>u…{Èýb¾qIL9WŒÌ¾Tô‹+I)+>v5䓼q3¾oQ@Ïè—:¾]ç25€U.>v®”õå^¾k°ñÁo}¾cT]TØ à>vë>·FëÞ¾g¸"LݾgŽÜîB >vèŒ6E¾cn°ó¶Û¾k“½Êì<Ä>v£Í¬jÙ¾]½&«¹Hˆ¾oU,(7sh>vSŠ›¾T&O@»¨¾qb ½o¶ì>uMES~Ô¾Deù®Áý‰¾r鶺Ž>t:râ×s)6>D¢ºÿ’nî¾uI™bHŒ¶>qI ‰ëR>TŸ·¾sþE¾vyôÚG>nßèH%$>^ÅéÌy_ô¾v™•'¦O>j·¸OFÔñ>dNÉÙÊ!¾vÎR‡1ºµ>f$†@¡v>hÿŸZGJ¾v±4uHG>a3·ø‰>ma³mXs¾v?WKƒ©>Wê¹ë6B>p°OÖ-6¾uwçÒ|¨œ>IéÛϲ‡X>rt̡֘¾tZîpbÒž>^%wQ“>sõ%~RÁ¾rêxºÕ¾CqÙìu(ºãV¾Ï¾q(¦n¾U"ßM«O>vú e¾n6n|ŸîŒ¾`ºÝ¿4$>vŒcâöi¡¾i‘]¢3¾ev™ +L]>v°ÌÚ ¾dqfk;ƾj€Ùÿ|?>vqŽã„8¾]Õe–û;)¾où;E½w>u̺ØP4z¾R&ÍÙ›P¾qœ£¼`&£>tÂC¹,t¾8$èš¿c|¾s]ôÌ>sT“R>91šCjð¾tÅTƒtƒ4>q†B=ÿO>RŸMpÞ£)¾uÌ ª+)>n½å#ˆ(>^±ä¦„оvitoí)>iÌÿø´Çy>e"|€#=ξv—3ò´ §>dN¸q]%>jŒ‡Ï0Ž¾vQYýµ¶ù>\·è.á€>owé‹à5´¾u–2 úcì>P"ap>qãgzR]¾tfˆŒšö¦>(èc¯Ëh>s®Ã {g¾rÅÍG^ ¾D'<˜Çs >u¤¥5ïX¾pº'"¦cR¾W&dhÖ_}>vƒt£-å¾l˜ôZE  ¾açÞžýG¤>vvB¬g~¾g­ô',H¾gá®4P`>vi‡Š® ¬¾`÷µAß¾m[ ó¦a>uÙ<\2¾TÝß&îµÁ¾qòóˆ=>tÄÁ‚ºcH¾<ÚãEýˆ£¾scás0-í à>:Õ;Õš =¾t´åFÉ^>q" bÂ1^>T‚5× Š¾uËÏÆ'f>mI”„³sî>aJT:¾vZ:$ì >g‹G§Y>gX~™Ñ©¾vYlÐþ¶>a*u<Å>m"‘6¿²Š¾uÆ4ÉÅuÓ>T›Ÿ\ÔpR>qÈ"¾t¡.X>9¥µåŠô>s5סyW¾rîôïž¾@´´†ŒUF>tÐÃêƒ<=¾p¸/†Ô’¨¾VÔ†ûæX>uÞy3¤ýžl!jŽÉ¾bc£ y>vTAƒÐ¶¾eçCŠÒ¾˜¾hä‹!K >v+§öš’¾^)èé*nS¾n½,Ù>ub“ˉy¯¾O*Ž îâƾqßš…áZ>sû$aà½ýò3a&Öß¾sßE 7š>qýð¦9æë>MŸ 0‹¾uMak:£ý>në£5UCr>]ž;¿¾¯0¾v¦gkŒG>hçák§2_>e×ò2d¾v@Á‚h›B>b·& ²À>l@O|q‹h¾u¸W%ãV>UkÖkë >péÓPÞÄ>¾tƒ`n{Ë>7Uòñg>s0sÙ¨?à¾r¨`å8‡I¾CÔ½ÿ>tß&ã‹0§¾p3m±®ÚW¾Y|3_a‡ü>uåU´C¾jl 9Ää…¾d(ƒe_™?>v7u§ô…¾ceu9f¾jô]º!4v>uÏ ¶ÜG¾X{#þ¾pr”Š’¦B>t® þʾ¾@Ø÷|(Q¾râ*¹õ&>rÙHÄ ¶5>@“úm–²g¾t°ýìs•9>p^@RVoU>Xi0÷T!›¾uÌÛ»?½÷>j jP?ß>câoùþ…Û¾v(Ãnñù¤>c •{½ê>jèº/¾u¾Nª­P>WŠ´xÔß>pxÕY þ¾tŽ k>¬><7ºÍÕ²í>rû°7²ª ¾rŸ»Y´“ÿ¾C†çê‰>tÉVË&M¾pRë$M¾ZM­nQ%>uÖË=Ý– ¾i—U1F€L¾dùµüqV>v-h€¥¾b/ê ¦œ_¾l äºÏ.>u„£äùä¾T#w%¿ 9¾qÍä>t!Ìí;/ù¾(Ž1¨-¾srÊJ }J>qøþ¬_À>La¼àb»¾u q²E•>n9>T“>^ùý,•ºà¾uó˜ÐÄyø>gM>‘³Ó>gOÐ Ìœ ¾uðèJÙ ¾>^Þ¸@°þe>n?™®~dݾuï;BâÕ>K±A4/X>rßòª¾sVˆd!7j¾.l5Ì´d>t+÷˜aL¾pÓ…Råc¾U^]Î 'j>u‡@&¨9æ¾k<»”à,c¾c²e«Ê>vÒ–£Â¾c¬ý«Üé¾j±!>Q—>u“ˆl”j¾VˆÝÃÎ ¾pž*~«òR>t=àb+¾2ÔöÞ|¾s3ý¾uðP>r 9˜&úV>JÅz¯÷j¾tû0(sY>n'Qíl‡I>^ù®ž!¾uÞ¢†ñ%§>fäµ E‚Ä>g¥´=]#~¾uÐlšMŒ.>]:Bƒ>nÎÖ:³ ´¾tÎ{kwcø>F§æÅÉVÖ>rR3¾ša¾ráâ×’¾<Š­­&Å8>toô´®ÍQ¾pYgk< ¾YX¨¾ª¡œ>u¥èÉmÚ+¾i4½Õé¶ð¾e=·»§Ò`>uã?œu".ü(Pt¾P½C1¾q›Ü’¥G°>sh‹gŒØ>% ¨uö‘¾sú˜E;¹@>pÇׂ‚Yò>URüN1¸2¾um·nâ;>j¹Š{3­¿>cŠ…ä_èQ¾uá4‰+2>bœSF`„V>k‡^øX+ ¾uLZDŒ6>S-œä²õÞ>q˜,‚¾s³™T}öõ=ä¿0ÏÏo>s©—²X§t¾q'‘éŽ{•¾Rëýœ7L:>uDZ>d¾kŠMÜE㈾b’ñ#6?Å>u×ÆŠ±Ër¾ch5¿@ ¾jÎÉa>¥>uYÈ)™­y¾T˜ú»%‹é¾pßœƒÞë>sͬo ­»¾Þ7?‰»ð¾s„Bíg>qDP.}Þ‡>R“°ÿ®A¾u1F‰ý8>k·bVodg†(¾uÎuþø}|>cz»âE‰>j¸ P¦c¾uQ¿ˆ›½>Tuc<*áØ>pá­öãìµ¾s¼œ·/$k> vU ž>sŒ$…‹‰<¾q#'Se 5¾R×tL¡d>u5ï2t2¾kI3Ò“¾bÏ—h>uÆZT ýˆ¾bÚÕ‰¯¾k=eèuÝ>u3)v.¾RÒ0@ ¾q!>sèËM>søN™>Ñ54¹iƒ¾s½Ðhp>pÄÎl8ñ=>U ¾¦Ó´¹¾uN‹ÊrÒ>jB;£wBG>cò— D¾u»e£Ä]>aŒ2¾±>lR¢~Õ´¾tûÍÚ‡—>OtF §¿>q—FP·žI¾suu%¹e¾21¢Íùr>tgߤ¾p&GÎY¥Æ¾XŸÎá=p>ur¡,–’«¾hžÖ'ҳʾe²éÉÍ)>u¤ëSNž¾_—\D º¾månJM‚>t¢ÔÊXð¾Fk¡‹/¤¾r9›Îà>rx.<‘«2>B¾•=Íg–¾tzõ±hÍr>nƒuo"¬>]ygß3L;¾u•“ápôµ>fWÊÃå”>gùu¾è¹ ¾uvR|L>YÂs×>oÜóÒnÓÿ¾tex¤§ö>5røýtê¸#Fº¾lOúgJ¾a¸¦DËT>u§¢Ã$ʾcduÎP°h¾j®ï¦þCy>uÍ €~¾S/S66h¾q ´Å\åu>sZ9yOòÕ>¤j6J´„¾sÂh]ÒFý>pnÄRοç>VÇ'íÖR³¾uMnrMÁ>iMÇÉ 2>e*!ÿ¼E¾u“ðŽG͆>_zôÕ/"þ>m±N¿€/ø¾tHJ2ZD>EÒv}‹G»>r9Ȫ›´â¾rL¾¦oië¾D·ç3?Zo>t‚_LHQD¾mÚ2ÏŠn¾_ ñÅle>uŒÑùxÁ­¾eEâf”þ¾hï磾j>uFÔ´óM¾V¿Ž²µ.¾pk¸Œ"ÕA>s±‹sèÚ¾1ŽËtÒ¾s^S}Æ51>päva¼ŠÉ>SÛÀ×à ʾu9Û7>j`LjÇý>d„/Ò¹¼¾u^Ýcÿ{>`¹èHÉ>lß÷rØèð¾t¨m]¡°>I>ë7¹­`>q÷áÍ-¡•¾rs¯‹ÖÔ¾B'5À» >t_l–¶ ¾n'IfÒ‹¾^+K”øa>u}¹‹ˆ~¾ezfw2lR¾hµºÛžb(>u>q¹J¾VÖXÎÄ(ô¾pc3o²O>s£g݈È?¾‰ûù´A¾s`Züe"6>pÄؘà‹Y>T‚¼p#å;u^Ð ý·>i R$U&¶>dz3O•£µ¾u]ì,hi>` ’‚3Œ->mcX©BÂS¾t}Ýö­Û>E–M‚‰Fe>r3 TJñ¾r#¬·`r¾Fx—3‘È>t… vCÕ¾m0~Jßá~¾`Hê”L)>u~ßÇ Œ¾d+mF­¾i㾨jGŒ>uZþºå¾S™Ñµ¸I¾pæg¯´¼(>s7îú˜2¨>#½.®è&ë¾s½ Þä®—>pàHÚ½'>Xg¹âxÆ´¾uCø+ð‹>gδ‘=ç>f_Ff.¸õ¾u^è‹Ç¶‰>[›¯ê)83>o‡æ¾t *ÔR¯^>6Úé½Èo>rÔAQ˜¾qZÈÉ“Ñ“¾P™94…>tÜží B¢¾jû`G¥¾bèïòɪ>u{¦]¹'¾ah¡.﫾l>ÿ™ùQ->t£&ûš¾J†ê3éý¾qÕ_ƒhe>ramé#÷¶>BrëqfƾtS‹ºlð>m·õ-O;w>_í—Y°¾ulŽµwi>džŒLrÈ>ipVZè\…¾u A•m*q>T*PMpÉ®pÉ{†¾s4‘´ôZÙ¾"¬ØeGHÎ>s²ïj›¾pw:èïF¾X³[9Ì~Ô>u<)¤Dyú¾gv,–q¿U¾f¯eèÆ¥>uJ­Ÿ¼E›¾Zlœžãí¾oq‹,÷å>sÚè²üµÎ¾0-£ )·À¾sR¿50>qêé5ö>R¥³Dn+¾tñâ±El%>iõqeôÆK>d8ÎLà‹¾uhÂìIó„>`ÏX÷%¥>mQvž·´¾tZâÜRtr>CÎè~7èk>rDéƒ?ìm¾qÙÔÐ\r¾I÷´¤{_ª>t”§K¾l#¨=¯ÉG¾a|!çŠÔ>ul#1ĸp¾b¼vEHP¾k<¬ÛY[ž>tº} Q˜¾N€Fßú£¾q…e´Ã{`>rŠä©ÝÃþ>>é{s@оt*;¹•ZÉ>nwáßp>^,C$2<(¾uZ©@ŸçÅ>dÍ؇é>i:g¯™˜Ç¾tÿ1aŽb¸>T¶xK¶×>pÆ3±»¾sÿ#Í™3¾'ïÔ!>s·¤è. ¾o«f,Ã<¾Y®² ¯›N>u9bZh¾fË+›Y¾gOíÎÞºš>u-ßN”œÁ¾Xzbs•xt¾p ÌeðÃ>s”i—ξÒÒ5ßH8¾s@âm:>pŠ0ñ|Ý>U‚¹ù¹‡¾u ¹·c¿>h×ß%\D>e€×6ŸŠå¾uJÔ—3>\i‹Ð!!>n«äU­¾sõœUÖX>6_•ØÌÞî>rÉ-‚+¾q$ýnAü¾Q©"A9ûT>t×ò@xm¾j¾p⪾cÏa­Œö%>uYÄ‘ÞOƾ_ï`$·|z¾mRJÜÇ>tC¼×p¥7¾B„¹,_6¾rSƒºâZ>q©pˆrì[>LA€¼å锾tžTwvhP>kwcšãâ>b<¤T½=¾u]܉žï>aŠ.&ëüò>l 2I¥Oþt‚4î’„>I$UKˆÛ>qàn%³Þª¾r‡õ;?¾EÎÄ!AU>tb!Ód¾l© áꬾ`ÈÔƒ7§y>uYÀÊwo#¾bð‹ô?!z¾jÚì»A2>t³²¾O#ªKr¾qr°ê„3>rzó(×ë>?àÜH;»¾t%7KºÒn>m´¦4³†þ>^æÏÊéÖ†¾uO¥i¾>d.ý¢Jº>i¿1v’—¾tÚFj€²ƒ>R; “ÛU|>q ÁNs÷ ¾rÍ}å¾5?ÀsÑQ>sèüÿ0w;¾nžÄ¸f¾\v”º…ò>uAN`-¾eI™Îó¦è¾h¹ Î4j`>tøpéD9¤¾T¡™Z|F¾p©1çß>s±§c->'IN~?Ž,¾s®{”>c€>ok•.^Jv>Z=æçÍê¾u0(lÂú4>fD@+ÉÐ[>gÇý€L ¾u´(—ôß>VÇ°GSÔ>pN>ØüäX¾sNÒ›ÿ2ø¾ÒšItBƒ>sveˆ3—ù¾pu`Þ˘¾X9"•Ý >uJÆ3eg¾g"ž“¾fë=¤n>u!wFê(V¾X´2hx©¾oóÐP÷T«>sÞâ)*õ¾U+e x¾sA+×õY>p^Ká!‘>Vd¡ÐV¾u ‹ò- ã>gè‰_!@>f!Dî`ì¾u.äeÊ(„>Zlëás•ò>oWôBŒ5‹¾s­¦¤rº¸>'¿óÜ9ˆ>s»|P'¾p£@DˆN^¾Tº©JzôŠ>tõ†é/Šý¾h—×I×t¾eh粌ß>u8êf?~¾[øRp#Ö¾nÈKË¢u¸>sÓW²©&¾2:ŒZ[Œ¾rà ÀV(g>pà=˜0>S8k`(B¾tᯠ# c>i4´: Ö>dÀ$Ö…a¾u@Kg>][^j— ±>nD'öIkî¾sóìj]œ>7ö±rþ>r´@|þÔë¾q'4•Ìß¾QÚ¤…ayÃ>tÎ\„R•¾iÀa=™¢®¾d&Ðh {>uE›mO¸¾^™¾*\¾n¾mË=±‡§!>tQ>õ¾=¾¸· ˾r‹Ñ²Ë›‹>qE£ü7Ï>PŸª%ÉYu¾t»õ ‡j>j<# Úqñ>cœæÐÌ:¾uIP+ÿ>_³;h@ÐÜ>m^¹ Ⱦt(¼þrÄ>@ÓeòMbŒ>rg¢Ó2¹¾qnSÔ;I¾OhàÉ>t«]UaÍã¾j¤Äæ©BÔ¾c'ÅkÆ£Ò>uK¼)&u̾`M™,©†¾mÃÁÌæ>t: eK.Ÿ¾B”ÔB9탾rL pE€Z>q‹'ê+>M¡ÚËêKl¾t n€çZ>jãc¢XR>béT÷C¾uM{ìk>`tØ7KH£>lõ¯z:Lˆ¾t;›VZº>Bî¨F”¦>ra‚4ÞŒ¾qf…Õ3Šw¾P¦æVP >tÚƒÍìâ¾h°1|÷õŽ¾iI\——Û>z q3¦Úhealpy-1.8.1/healpy/data/pixel_window_n2048.fits0000650000175000017530000041600011705033043022031 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 8193 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 2048 / Resolution parameter for HEALPIX MAX-LPOL= 8192 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 2048 COMMENT for multipoles in range [0, 8192] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð?ïÿÿù??ïÿÿêß64?ïÿÿô~ù?ïÿÿÕ¬õ¾?ïÿÿÞß>}?ïÿÿ·Æ2»?ïÿÿÀø{q?ïÿÿ‘¥iÅ?ïÿÿš×²p?ïÿÿa¡« ?ïÿÿjÓô=?ïÿÿ'ÅkY?ïÿÿ0÷³æ?ïÿþââV¹?ïÿþìŸ2?ïÿþ‘„V€?ïÿþš¶žâ?ïÿþ2}, ?ïÿþ;¯tR?ïÿýÅ/­ø?ïÿýÎaö?ïÿýH8¹º?ïÿýQk¾?ïÿü¹î.?ïÿüà O ?ïÿüÏ?ïÿü#DÇ?ïÿûgYf?ïÿûp6 ß?ïÿú *4Õ?ïÿú©\|?ïÿùÄïéª?ïÿùÎ"0«?ïÿøÔo¼?ïÿøÝ¡fx?ïÿ÷ΙÄV?ïÿ÷×Ì Æ?ïÿö³Th?ïÿö¼†Ç‡?ïÿõƒ[p?ïÿõŒI¡7?ïÿô>HÍB?ïÿôG{¬?ïÿòå¬ic?ïÿòîÞ®j?ïÿñzj8 ç?ïÿEDp?ïÿ@ø%c`?ïÿAWuE?ïÿ<©î¶?ïÿ<³ "^?ïÿ8QeŠ?ïÿ8Z8tó?ïÿ3íã‰p?ïÿ3÷—•?ïÿ/!•?ïÿ/ŠSŽu?ïÿ+ B®?ïÿ+t(E?ïÿ&ŒÎ,#?ïÿ&–6p?ïÿ"|ùÆ?ïÿ"¯Æ?ïÿxãÓF?ïÿ‚Ú÷?ïÿ䧣n?ïÿíÙ©Î?ïÿJsö4?ïÿS¥ûA?ïÿ« z`?ïÿ´=~?ïÿ Þ?ïÿ P C?ïÿ_böÌ?ïÿh”÷Ú?ïÿ‚ø|É?ïÿŒ*|q?ïþü„^±?ïþü˜¶\ì?ïþ÷l÷ò?ïþ÷™žô¾?ïþò† ì™?ïþòRçò?ïþípæ÷´?ïþízñ˜?ïþèQ>®x?ïþèZp¦ã?ïþã'›¤¡?ïþã0Í›?ïþÝôZ¹@?ïþÝýŒ®°?ïþظ)0?ïþØÁ:?ïþÓs û‰?ïþÓ|Ríõ?ïþÎ&?ïþÎ/F ô?ïþÈÑs8 ?ïþÈÚ¥'i?ïþÃuÉ'?ïþÃ~ûï?ïþ¾–ã€?ïþ¾ÈÏÇ?ïþ¸«wí‡?ïþ¸´©Ø@?ïþ³>tm?ïþ³G:]—?ïþ­¤Ë6&?ïþ­­ý³?ïþ§ô˜VQ?ïþ§ýÊ<z‚?ïýâ b̹?ïýâ)”yÊ?ïýÚõ`b?ïýÚþ‘¾c?ïýÓ¾¦7!?ïýÓÇ×à?ïýÌ|‡S?ïýÌ…¸úh?ïýÅ/8×·?ïýÅ8j|v?ïý½×j1?ïý½à: Ô?ïý¶t:¦x?ïý¶}lFû?ïý¯âÖ?ïý¯B7?ïý§ÞÁ4?ïý§™]p?ïý ñÁ?ïý #[?ïý˜„Žë(?ïý˜Àƒ?ïýñ#?ïýú9±ß?ïý‰T¾7„?ïý‰]ïË?ïý¯úí?ïý¹+¬F?ïýzTº?ïýz Bãß?ïýrNhE.?ïýrW™Ò?ïýj{/G~?ïýj„`Ò,?ïýb’`л?ïýb›’Y#?ïýZè6œ?ïýZ§¼¼?ïýRó„ã?ïýR§%µ?ïýJ’¿--?ïýJ›ð®°?ïýB|•¦=?ïýB…Ç%m?ïý:[¬™@?ïý:dÞ?ïý20> †?ïý29o„?ïý)úž^?ïý*Ï•ƒ?ïý!ºþ?ïý!Ä/{Þ?ïýq«€ü?ïýzÜôa?ïýógä?ïý($Øä?ïýÃ;–?ïýÌBª/?ïý^\dj?ïýgЙ?ïü÷ñ$W^?ïü÷úUÁ!?ïüï{©úG?ïüï„Ûaœ?ïüæéÿ-$?ïüæó0’?ïüÞCJ®?ïüÞL|x?ïüÕá—?ïüÕšíz?ïüÌÒô†E?ïüÌÜ%ã¤?ïüÄ È&?ïüÄù^ÿ?ïü»5†Oî?ïü»>·¨>?ïü²Vf¤¾?ïü²_—ú€?ïü©l±Yb?ïü©u⬕?ïü x’ãÂ?ïü Ä4b?ïü—zMg0?ïü—ƒ~µ:?ïüŽr&ƒº?ïüŽ{WÏ,?ïü…`UÈ?ïü…i‡Þ?ïü|E¹u?ïü|NIÿ­?ïüs ½~â?ïüs)îÂz?ïüió{ÈÒ?ïüiü­ Ç?ïü`½ž?ïü`ÆÏRc?ïüWmpP[?ïüWv¡‹ý?ïüN³D0?ïüNä}?ïüD˜>ð,?ïüD¡p&e?ïü;Jzµ?ïü;%{®4?ïü1”ýAl?ïü1ž.r-?ïü(·O?ïü( ÁåP?ïüe7ú?ïünh18?ïü½!z–?ïüÆR£?ïü †ÀG?ïü ·åõ?ïüM¢Äê?ïüVÓçÌ?ïû÷†ªj?ïû÷ÛŠ?ïûíµÕÛ¦?ïûí¿øæ?ïûãÛhŽ?ïûã䙨l?ïûÙ÷”ø?ïûÚƤ?ïûÐ –ïm?ïûÐÈ'?ïûƵht?ïûÆæzQ?ïû¼üÈŸ?ïû¼-ט?ïû±ã*¢‰?ïû±ì[®˜?ïû§´¢Ÿµ?ïû§½Ó¨×?ïûz‹×ã?ïûƒ¼Þ?ïû“5DÒ?ïû“>GH?ïûˆäx£~?ïûˆí©£Å?ïû~ˆÓcZ?ïû~’`§?ïût"[pL?ïût+Œjœ?ïûi±L\Ã?ïûiº}T?ïû_5ͤp?ïû_>þ˜¼?ïûT°Vl?ïûT¹DG³?ïûJ VFÄ?ïûJ)‡5?ïû?†Ê›ª?ïû?û†Û?ïû4ã§e4?ïû4ìØMW?ïû*7"ÝÐ?ïû*@SÂâ?ïûwý°?ïûŠ¨ß®?ïû´0šì?ïû½ayÏ?ïû Ó?ÍW?ïû Üp©?ïúþæ’ÝÀ?ïúþïö_?ïúóîUcC?ïúó÷†8º?ïúèêµ—?ïúèóæiS?ïúÝÛÕÕ…?ïúÝ夥?ïúÒÁçä€?ïúÒË°o?ïúÇXs?ïúǦF!/?ïú¼mŠ{Ö?ïú¼v»AZ?ïú±3{˜?ïú±<¬Z\?ïú¥ïæî?ïú¥øE¥û?ïúš …T&?ïúš©¶ô?ïúGü³¦?ïúQ-l1?ïúƒå²¸â?ïúƒîãn'?ïúxyÒx?ïúxƒ´u?ïúm’Lü?ïúm Âû®?ïúaxÃp*?ïúaôŠ?ïúUÙ©f?ïúUâÙ½p?ïúJ.ÓåZ?ïúJ8Š ?ïú>xjÈò?ïú>›jC?ïú2¶’Ò?ïú2¿ÂžÃ?ïú&éqýÂ?ïú&ò¢˜N?ïú5Ÿ²?ïúf6×?ïú.Ѹ?ïú77er?ïú@ çò?ïúI=x>?ïù÷Gq°º?ïù÷P¢=–?ïùëDcZ?ïùëM“Â?ïùß7\ž?ïùß@Aâ?ïùÓ¥Q`?ïùÓ(ÕÓØ?ïùÆþM|X?ïùÇ}ûT?ïùºÓ7ŠÙ?ïùºÜhU?ïù®ž›¯)„tÌ?ïù>2´Ìu?ïù1rk^ì?ïù1{›²í?ïù$°ÈU?ïù$¹ø¥l?ïùäÉË??ïùíúè?ïù S?ïù ¿›þ?ïøþ.G7Ã?ïøþ7w}?ïøñD#v4?ïøñMS·Ã?ïøäPHÜ\?ïøäYy2?ïø×Gsó?ïø×P¤-–?ïøÊ, Í?ïøÊ5:M ?ïø½ß"?ïø½Ï­?ïø¯ÒXJ?ïø¯ÛH‡ ?ïø¢“Ý/Ô?ïø¢ ZÆ?ïø•JB?ïø•Sr¦.?ïø‡õyã¥?ïø‡þªñ?ïøz•¡ùD?ïøzžÒ·?ïøm*Û…¸?ïøm4 ¡P?ïø_µRTv?ïø_¾‚l1?ïøR5.DÂ?ïøR>^X›?ïøDªŠŽí?ïøD³ºžâ?ïø7”ÂC?ïø7ÄÎP?ïø)vyzc?ïø)©‚‡?ïøÍ[°t?ïøÖ‹´«?ïøfIé?ïø#–J/?ïøS#ƒ ?ïø\SY?ï÷òy“Ê~?ï÷ò‚ÃÂÓ?ï÷ä”D…¥1?ï÷Hט÷r?ï÷HàÈ¿?ï÷:o¢N?ï÷:xÒ?ï÷+ý·ƒ?ï÷,æØÎ?ï÷x3ä?ï÷4ï?ï÷àSÅŽ?ï÷éƒ|{?ï÷<àõ—?ï÷F¨O?ïöñËe¤?ïöñ–û#?ïöâÓ0Óè?ïöâÜ`~,?ïöÔ 4ã?ïöÔd‰ ?ïöÅ;ò2„?ïöÅE!ÔG?ïö¶_R¡?ïö¶h¼ð?ïö§x';I?ïö§VÔ~?ïö˜…ÜP?ïö˜ :?ïö‰ˆÏ·?ïö‰‘þ—R?ïöz#øÖ?ïözŠS…?ïöknùÏB?ïökx)W7?ïö\Rv–Ž?ïö\[¦+?ïöM+ÀÌÄ?ïöM4ðL?ïö=úö={?ïö>%¸_?ïö.¶ì;?ïö.À±›?ïöa"(m?ïöjQš†?ïöÿ’bö?ïöÁУ?ïö’c¡?ïö›’à?ïõñ«Aý?ïõñ"Ú¦É?ïõᕆ@¾?ïõážµ¡?ïõÒ•š?ïõÒFñx?ïõÂkIè?ïõÂt®¡I?ïõ²ÅÓžH?ïõ²Ïñ+?ïõ£;á¤?ïõ£k0?ïõ“YÔR„?ïõ“cœ^?ïõƒ“½sk?ïõƒœì¸½?ïõsÃ5T?ïõsÌGv?ïõcè8Þ?ïõcñ6u?ïõT§Iè?ïõT ÖŽ?ïõD"(Æ?ïõDQ[Ù?ïõ4˨'?ïõ4úÖ ?ïõ#üì#?ïõ$+ü?ïõÝMÞ«?ïõæ}â?ïõ² +?ïõ»8K—?ïôó{8¸[?ïôó„gÔD?ïôã8øøZ?ïôãB(–?ïôÒëgøØ?ïôÒô— f?ïôÂ’¢î~?ïô›ÑüY?ïô².Ȩ¸?ïô²7÷±Ý?ïô¡¿ô³.?ïô¡É#·š?ïô‘F@™å?ïô‘Oo™•?ïô€ÁÒiÕ?ïô€ËdÅ?ïôp2Äy)?ïôp;óoX?ïô_™6\v?ïô_¢eMß?ïôNõI>ª?ïôNþx+K?ïô>G{?ïô>PLbÞ?ïô-†ZI?ïô-°=N?ïô´žÑ?ïô½Í`?ïô Ö÷Ïh?ïô à&¨¾?ïóúí§¨5?ïóúöÖ|°?ïóéøË%À?ïóêùõ[?ïóØø}[?ïóÙ¬&H?ïóÇìÖ4Z?ïóÇöú,?ïó¶ÕóÕ\?ïó¶ß"–E?ïó¥³ó?ïó¥½"IŠ?ïó”†êãå?ïó”šò?ïóƒNü‰ ?ïóƒX+;$?ïór FÚ†ž4?ïó> µõ]ë?ïí‹G»ëO?ïí‹PèæF?ïívN´«ù?ïívWá é?ïíaJÊ'?ïíaS÷ý?ïíL<!¬?ïíLEA …?ïí7"ª¬?ïí7+×€t?ïí!þ¦ÊÔ?ïí"Ó§‰?ïí ÉåVÄ?ïí Ó-a?ïì÷„æ¼?ïì÷ŽŒš?ïìâ4)Xs?ïìâ=V"Ó?ïìÌ×»;–?ïìÌàçÿÒ?ïì·o¶Ø?ïì·xã–1?ïì¡ü0Iâ?ïì¢]Í?ïìŒ}81 ?ï쌆dâÊ?ïìvòæ×t?ïìvüƒ?ïìa]SÌ8?ïìaf€q‘?ïìK¼’7J?ïìKžÖk?ïì6¹,j?ïì6åÅQ?ïì Yß Í?ïì c w?ïì ˜« ?ïì ¡D8 ?ïëôË| õ?ïëôÔ©'?ïëÞô$ó¾?ïëÞýQsœ?ïëÉ%,?ïëÉQ¥¨?ï볟0v?ïë³(Ë£¼?ïëï–?ïë&.\‰?ï뇢¯?ïë‡ÎæJ?ïëpô•¬H?ïëpý Š?ïëZÎî¥Å?ïëZØÿ©?ïëDÀÒƒ?ïëD¦í&?ïë.a$JN?ïë.jP—n?ïë+L?ïë"WU?ïëÅé"Ö?ïëÏc$?ïêëgs¦˜?ïêëpŸàx?ïêÔýâ—"?ïêÕÊ‘?ï꾉GëÆ?ïê¾’tÁ?ïê¨ ºDÑ?ïê¨ækU?ïê‘PuT?ïꑈ|•^?ïêzêÞÌ?ïêzóJøX?ïêdJ=Ÿu?ïêdSi²?ïêMšüR?ïêM£1Ù?ïê6ÙÖø½?ïê6ãþ¹?ïê éµ#?ïê ´’?ïê 6N¤Ó?ïê ?z²?ïéòSo@?ïéò\Ca‹?ïéÛd[':?ïéÛm‡î?ïéÄj*ö|?ïéÄsVÛ•?ïé­dšÕÎ?ïé­mÆ´J?ïé–S¾îÒ?ïé–\êÆ­?ïé7­U^?ïé@Ù&•?ïéhw!Œ?ïéh¢ì?ïéPÞ3¥ñ?ïéPç_iÖ?ïé9 ÷Ï?ïé9ª#Œ;?ïé"XÕOƒ?ïé"b?ïé äåF?ïé •?ïèó¨;7?ïèó±fà"?ïèÜ:fU•?ïèÜC‘÷ô?ïèļ¼á.?ïèÄÅè|Í?ïè­3TX?ïè­<ìð?ïè•ž;èZ?ï蕧gvn?ïè}ý‰´?ïè~µ;L?ïèfQNö†?ïèfZzw?ïèN™Ÿ¡¦?ïèN¢ËQ?ïè6ÖŽüj?ïè6ߺoA?ïè/¥f?ïè[f?ïè.”jº?ïè7¿ÏÞ?ïçïIÏtç?ïçïRúÓ.?ïç×Yú™Ð?ïç×c%ñ6?ïç¿_%ÛÒ?ïç¿hQ,T?ïç§Y` P?ïç§b‹éê?ïçHǾ=?ïçQóí?ïçw-kÊ–?ïçw6—X?ïç_›J?ïç_ =Ð?ïçFÇÿâ?ïçFÐ.-»?ïç.€3œ?ïç.‰^Ä{?ïç-µ›0?ïç6à»?ïæýÏ‘?ïæýØÈ©ï?ïæåeûW¾?ïæåo&i›?ïæÌðà˜„?ïæÌú £Z?ïæ´pdÚ?ïæ´yÝÙ?ïæ›ä•7Ð?ïæ›íÀ4?ïæƒM…~$?ïæƒV°sÐ?ïæj«K@ª?ïæj´v/B?ïæQý÷bL?ïæR"IÍ?ïæ9E›Ä=?ïæ9NƤ¢?ïæ ‚SLJ?ïæ ‹~%’?ïæ´,)?ïæ½VûE?ïåîÛ8À|?ïåîäc‹~?ïåÕòo¾f?ïåÕûš‚@?ïå¼ú n?ïå½6Ç?ïå£õêGH?ïå£ÿüÄ?ïåŠæÜ?ïåŠïFŠY?ïåqʲWø?ïåqÓÜÿ ?ïåX£º±Ä?ïåX¬åQ›?ïå?qO‚?ïå?zz´?ïå&3zç)?ïå&<¥x‚?ïå êR=T?ïå ó|Çh?ïäó•ê:?ïäóŸ¼Þ?ïäÚ6Qp?ïäÚ?{ë‘?ïäÀËšŒw?ïäÀÔŪ?ïä§UÙõ6?ïä§_b?ïäÕ O|?ïäÞJµ ?ïätI€ÃÂ?ïätR«!ù?ïäZ³…?ïäZ¼<Üy?ïäA ñV#?ïäA¥ ?ïä'WQBŽ?ïä'`{Š¨?ïä •ô´Ó?ïä Ÿõ†?ïãóÈê:r?ïãóÒs»?ïãÙðDe~?ïãÙùn—Y?ïãÀ a?ïãÀ>‹ˆ?ïã¦iõ*?ïã¦%” ?ïãŒ!UÖ˜?ïãŒ*ò?ïãríxæ?ïãr$Œê?ïãX <"?ïãXf¨?ïã=ìX®¦?ïã=õ‚³«?ïã#ÄU—l?ïã#Í”í?ïã ‘CëB?ïã šmá;?ïâïS2=2?ïâï\\+¡?ïâÕ 8a²?ïâÕbH“?ï⺶h?#?ï⺿’s?ïâ S’Z?ïâ \/j?ïâ…àAfM?ïâ…ék6m?ïâka¿ô¬?ïâkjé½/?ïâP×]ù?ïâPà¹Û?ïâ6AÆçÐ?ïâ6Jð¡?ïâ pyJ?ïâ©š*á?ïâóŸ¹?ïâüÈȦ?ïáæ;gž?ïáæD‘#Ý?ïáËwÔ½6?ïáË€þWÄ?ïá°¨úFT?ïá°²#Ù-?ïá•ÎèºÎ?ïá•ØEð?ïázé±›B?ïázòÛª?ïá_ùfŒe?ïá`?ïáDþÐg?ïáEDDP?ïá)÷ÞÙ¡?ïá*EÅ?ïáæÃAq?ïáïì¥Î?ïàóÆ;ŒÎ?ïàóÏdé_?ïàØ–h[?ïàØŸ‘¯×?ïà½ZØ”†?ïà½dát?ï࢟ÇÍ?ïà¢É ã?ïà†ÀÈà&?ïà†Éòc?ïàkbdÅr?ïàkkúÑ?ïàOø…óé?ïàP¯!g?ïà4ƒ=’?ïà4Œf¸?ïà—¾?ïà ÀÐ?ïÞZ¼ÌÑK?ïÞZÅõn¼?ïÞ>säœt?ïÞ>} 1Å?ïÞ"½O?ïÞ"(æ{?ïÞÀnûä?ïÞÉ—€é?ïÝéV¡?ïÝé_,€|?ïÝÌà‹8R?ïÝÌ鳬þ?ïÝ°`!?ïÝ°iEŽ?ïÝ“ÔÄk¥?ïÝ“ÝìÏì?ïÝw:9ñ?ïÝwCbM'?ïÝZ”ð?ïÝZ™¼ÕÃ?ïÝ=Û5Y?ïÝ=ä][ë?ïÝ!*¤ý?ïÝ!#RèL?ïÝM‡*n?ïÝV¯ev?ïÜçuS¬ª?ïÜç~{ßh?ïÜÊ‘¥@?ïÜÊšÍ@°?ïÜ­¢‰†G?ïÜ­«±¨f?ïܨ<œ?ïܱ7Vg?ïÜs¢F¨D?ïÜs«n¹¹?ïÜV‘>÷@?ïÜVšgZ?ïÜ9u ƒè?ïÜ9~1„¥?ïÜMµ¹ ?ïÜVݱg?ïÛÿT}ã?ïÛÿ$|mÛ?ïÛáÝôÍ&?ïÛáç´·?ïÛÄ•¦pS?ïÛÄžÎOy?ïÛ§>B¤e?ïÛ§Gj{?ïÛ‰×Ú¨?ïÛ‰áâì?ïÛle·û4?ïÛlnßÁ?ïÛNçîZ2?ïÛNñ‡?ïÛ1^ˆŽE?ïÛ1g°C?ïÛÉ”Ç?ïÛÒ¼sp?ïÚö)&œ?ïÚö2M©o?ïÚØ}Hè?ïÚ؆oœ4?ïÚºÆ Aþ?ïÚºÏ2ÔÀ?ïÚ~kQ?ïÚ ¥õ…?ïÚ5°=^?ïÚ>׿?ïÚa\°AI?ïÚae׺Y?ïÚCxq¥?ïÚC¶â?ïÚ%‰]ø?ïÚ%’„÷Ö?ïÚ)'…?ïÚ˜P†Æ?ïÙ銈„?ïÙé“*ß$?ïÙËuáì3?ïÙË :.?ïÙ­Rиá?ïÙ­[÷þ3?ïÙ$ ?ïÙ-0GÁ?ïÙpé—Ð?ïÙpò¿?ïÙR£Š~?ïÙR¬±=À?ïÙ4Qòáõ?ïÙ4[€?ïÙôÜÞ ?ïÙþ÷Ü?ïØ÷ŒX~?ïØ÷•’?ïØÙrrÚ?ïØÙ!™{.?ïغ™;?ïغ¢b¨?ïØœÀÚª?ïØœçÑs?ïØ}y-s?ïØ}‚=s?ïØ^ØFür?ïØ^ámá¤?ïØ@,_\©?ïØ@5†9 ?ïØ!uuÝ6?ïØ!~œ°Ä?ïس”3 ?ïؼºýÀ?ï×ãâÏâñ?ï×ãëö¤Í?ï×Å2Å?ï×Å Y~?ïצÝF?ïצ!=_?ïׇ ßhÀ?ïׇ*ó?ï×hHå?ï×h'oƒ^?ï×I&**?ï×IL¿‡?ï×)ö†¯f?ï×)ÿ­;Ó?ï× ÑvÓ?ï× ÚV€?ïÖë¡$?ïÖëª,§?ïÖÌe@é?ïÖÌngZ›?ïÖ­9ÚÂ?ïÖ­'`CN?ïÖËýÝ®?ïÖÕ$=:?ïÖnn—ðâ?ïÖnw¾Gj?ïÖORƒ?ïÖOC ?ïÖ/’™×Ó?ïÖ/›ÀK?ïÖ¸W?ïÖ@óÂ?ïÕð†ÐòŒ?ïÕð÷$å?ïÕÐêÀ]l?ïÕÐó憰?ïÕ±Bûų?ïÕ±L!åÝ?ïÕ‘ü?ïÕ‘˜¶* ?ïÕqЉ¦@?ïÕqÙ¯´/?ïÕRø ?ïÕR l?ïÕ2/ê…V?ïÕ29€ü?ïÕNk¯ ?ïÕW‘¡†?ïÔòaŠ>a?ïÔòj°'±?ïÔÒiVÎl?ïÔÒr|®‹?ïÔ²eݶà?ïÔ²oÌ?ïÔ’W, ÿ?ïÔ’`Q×µ?ïÔr=R ?ïÔrFwÑŒ?ïÔR]¢¹?ïÔR!ƒ]ø?ïÔ1è]e–?ïÔ1ñƒ•?ïÔ­b€%?ïÔ¶ˆ(à?ïÓñc±Ù÷?ïÓñl×yk?ïÓÑ Jüö?ïÓÑp“?ïÓ°§3ýG?ïÓ°°YŠ ?ïÓ7uÁ,?ïÓ@›D³?ïÓo¼•”?ïÓoÅCÅ?ïÓO5<‰É?ïÓO>aú¡?ïÓ.¢ÞA*?ïÓ.¬¨¦?ïÓ‹?ïÓ4s§?ïÒí[Þ…?ïÒíeÙÇ?ïÒ̧V«?ïÒÌ°{öX?ïÒ«çˆl\?ïÒ«ð­®F?ïÒ‹‚ïú?ïÒ‹%¨(w?ïÒjFQѬ?ïÒjOw¹?ïÒIeÍÚ?ïÒIn(ót?ïÒ(x¨R??ïÒ(Ínc?ïÒLz?ïÒŠqŒ¼?ïÑæ{Oî>?ïÑæ„t÷k?ïÑÅf³®Ê?ïÑÅoØ®u?ïѤFep?ïѤOŠ†–?ïуqÜÚ?ïу#–Éw?ïÑaâèŒ?ïÑaì o&?ïÑ@ŸÔà¶?ïÑ@¨ùº9?ïÑQB6‚?ïÑZgr?ïÐý÷?•”?ïÐþd[ï?ïÐÜ‘Ù¸Æ?ïÐÜšþuˆ?ïл! –?ïл*B½¼?ïЙ¥kš?ïЙ®A ?ïÐxà|?ïÐx'²_?ïÐV‹vm?ïÐV”š¬ª?ïÐ4íï1h?ïÐ4÷½ü?ïÐEU³?ïÐNz5ø?ïÏñ‘¹ê¶?ïÏñšÞcî?ïÏÏÏ”`Ò?ïÏÏظÐW?ïÏ­þÞ8?ïÏ®Ü?ïÏŒ"xžp?ïÏŒ+œú?ïÏj:p(v?ïÏjC”zÉ?ïÏHFÏ(Ó?ïÏHOóqd?ïÏ&G¥Mœ?ïÏ&PÉŒh?ïÏ=¬?ïÏF$5¯?ïÎâ&éAr?ïÎâ0 lª?ïÎÀn§?ïÎÀ’Èw?ïÎØŸü?ïÎáÃ’?ïÎ{ †c ?ïÎ{©ªpË?ïÎY]1ý?ïÎYfV?ïÎ7±}\?ïÎ7Õwh?ïε ¯,?ïξ1ŸY?ïÍòPWŽ…?ïÍòY{tÏ?ïÍÏàœ³ ?ïÍÏéÀo?ïÍ­bjz?ïÍ­kŽM?ïÍŠÕ¹Žb?ïÍŠÞÝVð?ïÍh=[}p?ïÍhF< ?ïÍE™[kž?ïÍE¢ E?ïÍ"éÄ’ö?ïÍ"òè=¥?ïÍ.¥²?ïÍ7ÉRÌ?ïÌÝh n?ïÌÝq,ž$?ï̺•ýyJ?ï̺Ÿ!ÿ?ïÌ—¸&d?ïÌ—Á²©?ïÌtÏɱc?ïÌtØí* ?ïÌQÛº‡m?ïÌQäÝö?ïÌ.Üo)¡?ïÌ.å’Ž.?ïÌ Ñô ?ïÌ ÛeŠ?ïËè¼VÕþ?ïËèÅz&c?ïËÅ›¥ÙN?ïËŤÉ›?ïË¢oì¥?ïË¢yáQ?ïË5ÏK\?ïË>ò}m?ïË[íDoÈ?ïË[ög—¶?ïË8™ ëÁ?ïË8¢0 ‡?ïË94ÂÀ?ïËBWÖ\?ïÊñÍÈ ì?ïÊñÖëZ?ïÊÎVÒbÍ?ïÊÎ_õb ?ïʪÔa³ÿ?ïʪ݄©?ïʇFÁÀ?ïʇO¤¬?ïÊc­=Ô"?ïÊc¶`´·?ïÊ@£‚Í?ïÊ@ÆY%?ïÊX¾>:?ïÊaá P?ïÉø›6Ò?ïÉø¦½ø£?ïÉÔ×H>?ïÉÔàjõ ?ïɱÒª"?ïɱõW`?ïÉ)E­¸?ïÉ2hP¨?ïÉiA­¬É?ïÉiJÐEg?ïÉEKÆ=?ïÉETé+…?ïÉ!Gs ?ïÉ!P£öû?ïÈý7ž1?ïÈý@³Ã?ïÈÙø ?ïÈÙ%#g;?ïÈ´ôÞR4?ïÈ´þ·?ïÈÂ4É?ïÈËV_.?ïÈl„ 2?ïÈl1p.?ïÈH:y~?ïÈHC›Ã¤?ïÈ#ålÒ?ïÈ#ï?ïÇÿ…3?ïÇÿŽULÅ?ïÇÛšC:?ïÇÛ"¼ik?ïǶ¢Â!ä?ïǶ«ä=š?ïÇ’ ¹Ú?ïÇ’)ÛëU?ïÇm“‹0 ?ïÇmœ­6Â?ïÇHûC? ?ïÇIe;=?ïÇ$WðIñ?ïÇ$a;œ?ïÆÿ¦_,]?ïÆÿ¯|?ïÆÚæ~Â?ïÆÚï ž•?ïƶ÷ëª?ïƶ$½¦?ïÆ‘CÑJÌ?ïÆ‘Ló2?ïÆla!Ì?ïÆlj:Þ™?ïÆGrÛÑ?ïÆG{üÄ?ïÆ"y"D´?ïÆ"‚CìC?ïÅýsù÷0?ïÅý}”?ïÅØco?ïÅØl¦K?ïųG…?ïųP¯ œ?ïÅŽ aÎÚ?ïÅŽ)ƒKÈ?ïÅhí÷vÅ?ïÅh÷é?ïÅC°YŒ ?ïÅC¹zô)?ïÅg•ÜÂ?ïÅp·9”?ïÄù¹3µ?ïÄùÚ…Í?ïÄÓ´Í@Þ?ïÄÓ½îˆ8?ïÄ®G´\×?ïÄ®PÕ™p?ïĈÌ]—ù?ïĈÕ~ÉÌ?ïÄcE_º?ïÄcN€6Ä?ïÄ=²ÄŠ?ïÄ=»å¦Y?ïÄ™VÊ?ïĺh9?ïÃòjèOÿ?ïÃòt V›?ïÃ̵½ö?ïÃ̾ÞñÙ?ïæõ%Ìl?ïæþF½W?ïÃ)+gÜ?ïÃ2LMë?ïÃ[QÙbY?ïÃ[Zú=‡?ïÃ5o>˜¾?ïÃ5x_i ?ïÃc)i?ïʃîÎ?ïÂéˆSü?ïÂé‘t¶Œ?ïÂÄ™ ?ïÂÃ@H˜?ïÂtÏa˜?ïÂ}ð6?ïÂwZnàš?ïÂwczF?ïÂQ1òjI?ïÂQ;øý?ïÂ*ûEµ‹?ïÂ+f9C?ï¸óŽì?ïÂÂ¥?ïÁÞkø#?ïÁÞt'eÛ?ïÁ¸‹–?ïÁ¸«fH?ïÁ‘¬ŠP ?ïÁ‘µª§É?ïÁk<žT?ïÁkE1êñ?ïÁDÀ,1Ç?ïÁDÉLsU?ïÁ8äWH?ïÁBÃ?ïÀ÷¦Etð?ïÀ÷¯e U?ïÀÑ[¤?ïÀÑ{!ð?ïÀª_2’(?ïÀªhR§X?ïÀƒªÖ¶Ö?ïÀƒ³öÀæ?ïÀ\ëR•%?ïÀ\ôr”?ïÀ6 ±d?ïÀ6)ÑWÙ?ïÀK{Å?ïÀT!dc?ï¿ègC×¼?ï¿èpcµ.?ï¿Áudi?ï¿Á~ƒî©?ï¿šwâ'ì?ï¿šîø?ï¿snǼP?ï¿swçx$?ï¿LZ*÷?ï¿Lc=Û?ï¿%9ñá¨?ï¿%C‡?ï¾þMט?ï¾þmq°?ï¾Ö×>ï?ï¾Öà]¥Â?ﾯ”̳š?ﾯì7%?ﾈG×X?ﾈP%O—?ï¾`íó6 ?ï¾`÷¢ú?ï¾9‰¡‘?ï¾9’À{/?ï¾Ùz?ï¾#:/Â?ï½êŸl]ö?ï½ê¨‹¨æ?ï½Ã¡žÍ?ï½Ã"ÀÞa?ï½›ˆÅ"è?ï½›‘äW?ï½séê 3?ï½só 6?ï½L<ü‚^?ï½LFŸÉ?ï½$„lR`?ï½$‹db?ï¼üÀEŒ?ï¼üÉd’°?ï¼Ôð“M(?ï¼Ôù²HK?ï¼­_ÃI?ï¼­~²÷?ï¼….´­&?ï¼…7Ó‘]?ï¼]<žU0?ï¼]E½-ì?ï¼5?' ?ï¼5HEåJ?ï¼ 6ZÞ¢?ï¼ ?y ^?ï»å"C¥ç?ï»å+b\?﻽ìöÐ?﻽ ¡€?ï»”Øaë?ﻔည(?ï»l¢®)Ð?ï»l«Ì½g?ï»DaÛq¸?ï»Djùù½?ï»ö…q?ï»â?ïºó¼$t£?ïºóÅBå{?ïºËTLP?ïºË]js‹?ﺢàÓ…”?ﺢéñß/?ïºzaÇ(Ø?ïºzjåvÐ?ïºQ×/j?ïºQàM¬X?ïº)A=$?ïº)J5sË?ﺟ‹ ?ﺨ©F?ï¹×ò“£‘?ï¹×û±ÂÛ?﹯:½ªg?ï¸>ÆÈM?ï¸o‹]?︘)7?ï·ìU¡?ï·ì^¾§?ï·ÃI´?ï·Ãg:4?ï·™¿t"?﷙ȑœÆ?ï·pc*¯­?ï·plH?ï·Fûw>??ï·G” º?ï·ˆe.È?ï·‘‚…Z?ï¶ô þ_?ï¶ôQ?ï¶Ê€MAÊ?ï¶Ê‰j€?ﶠë^k?ﶠô{Ö?ï¶wK9K„?ï¶wTVrP?ï¶MŸëq˜?ï¶M©Œj?ï¶#é€|?ï¶#ò&Q?ïµú'ÿ­H?ïµú1°?ïµÐX¬×²?ïµÐaÉ΃?ﵦ{pÐt?ﵦ„»°?ï²WƳ6!?ï²,ìFÕº?ï²,õbÀÝ?ï²Z¦?ﲫ9w?ï±×'zZO?ï±×0–,Ì?ﱬ4½H?ﱬ=/ƒl?ï±5e*€ä?ï±V+wjg?ï±V4“Ò?ï±+VV?ï±+q¸_?ï°ÿö ¹?ï°ÿÿ&•]?ï°ÔÊ y~?ï°ÔÓ¼º?ï°©”!ÌY?ï°©=H*?ï°~Oì»?ï°~YŽ?ï°RýäJD?ï°Sÿ­3?ï°' F*²?ï°'©a*?ï¯ü7gà?ï¯ü@5±ß?ï¯ÐÂkD?ï¯ÐˆRÆ?ﯥBBR©?ﯥK]ƒª?ï¯y¶©×Þ?ï¯y¿Äü\?ï¯N«ÝÂ?ï¯N(Æõ¹?ï¯"}R©—?ï¯"†mµ?ï®öϦ½0?ï®öØÁ¼?ï®Ë²x?ï®ËÍjf?ﮟR¡c?ﮟ[œ‡?ï®sƒúß?ï®sŒ6Ô?ï®G¨dÚ?ï®G±¨1c?ï®Âàp”?ï®Ëû0?ï­ïÒÕf?ï­ïÛ9ˆ°?ï­ÃÓ²òr?ï­ÃÜÍ™?ï­—Ç€ÁV?ﭗЛ[S?ï­k¯º¯j?ï­k¸Õ<»?ï­?ŒhÇç?ï­?•ƒH‰?ï­]–¸ð?ï­f±,ß?ï¬ç#KO?ï¬ç,e¶9?ךּݒÂ?ךּæ­?﬎Œv5º?﬎•ƒ}?ï¬b/þ׆?ï¬b9Š?ï¬5È5qé?ï¬5ÑO¦*?ï¬ U&ÝS?ï¬ ^AÎ?ï«ÜÖÛÂ?ï«Üßõ2s?ï«°M[ñ?ï«°VuÕ?遲¸³RJ?遲ÁÍS_?ï«WìÁ?ï«W"õ?ï«*n†#?ï«*w)mŽ?ïªýµ–È[?ïªý¾°¢í?ïªÐïc/µ?ïªÐø|ýh?瘝”?瘝&·Tí?ïªw@O-2?ïªwIhá?ïªJW€ÍÔ?ïªJ`štÙ?ïªc=Î?ïªlV±è?ï©ðcÖ}?ï©ðl§c¨?ï©ÃX{:?ï©Ãa”Ÿs?ï©–BÕÝ?ï©–K(I ?ï©i T:6?ï©i)m ?ï©;óR¦?ï©;ükÿU?ï©»°?ï©Ä.M?ï¨áw¤}?ï¨á€½¼g?勤) ©¯?勤2$Ûø?暴ÏT@é?暴Ømf*?ï¨YjˆxÂ?ï¨Ys¡÷?ï¨+ø+Ä ?ï¨,DÏÆ?ï§þx —Ö?ï§þ9•è?ï§Ðì…ž¤?ï§Ðõž ?泥UdTö?泥^}8×?ï§u²Ä†??ï§u»Ý]?ï§H±-?ï§H ÊJÐ?ï§K3— ?ï§TLSˆ?ï¦ì†TßØ?ï¦ìm0?料¶¡n?料¿7C›?ï¦Úš-??ï¦ã²Â>?ï¦bóÏ•»?ï¦büèŠ?ï¦5Êk$?ï¦5 âå¾?漣×2?ï¦ «D”?ï¥Øü36?ï¥ÙK–/?索è¶Ê?索ñÏï?ï¥|Ê%¢?ï¥|Ó=JK?ï¥Nž ?ï¥N§&Vo?ï¥ dTM²?ï¥ mlxÍ?ï¤ò <–?ï¤ò(%Ze?ï¤ÃÎB;=?ï¤Ã×ZK½?洛qûʶ?洛{Íã?ï¤g Bä¬?ï¤gZÚƒ?ï¤8—!gÓ?ï¤8 9PP?ï¤  Ðl?ï¤ !¸«Œ?ï£ÛŽÉÌ?ï£Û—á™Ü?ù¥7?¼Ô”?ï£~Y=Œ?ï£~bU??ï£O­›* ?ï£O¶²Ï˜?ï£ öÈH?ï£ ÿߦi?ï¢ò4Í‹?ï¢ò=åÃ?ï¢Ãg´‘ý?ï¢ÃpÌ:?‡Ïï?˜Ÿ?¶?ï¢e©âô?ï¢e²ùòA?ï¢6¶¤¾w?ï¢6¿¼F?܃?ï¢ÀócÑ?ï¡Ø­’<0?ï¡Ø¶©uù?ï¡©—Ï ì?ï¡© æ8,?ï¡zv›\q?ï¡z²{&?ï¡KJ¶?ï¡KSÇ9?ï¡ ¼´?ï¡ ÀH?ï ìμaH?ï ì×ÓWG?ï ½€$K?ï ½‰;3?ï Ž&HiÈ?ï Ž/_D“?ï ^Á3yÜ?ï ^ÊJG?ï /PïÖ€?ï /Z– ?ïŸÿÕ„&Ž?ïŸÿÞšØr?ïŸÐNû¯ÿ?ïŸÐXT;?½`±?Æv¯A?ïŸqV?ïŸq'mï?ïŸAq¿¸ž?ïŸAzÖ3Ë?¡¥÷?m?ïžáöÙ?ïžáÿ8Ò?ïž²&îk¦?ïž²0½¥?ïž‚Ll2??ïž‚U‚v}?ïžRf„ Ë?ïžRošCE?ïž"u@_?ïž"~V‡Æ?ïòxªYÑ?ïòÀtº?ïÂpÉ)´?ïÂyß6Ï?ï’]¦çn?ï’f¼æ¸?ïb?M´þ?ïbHc¦t?ï2Ävn?ï2ÚZ ?ïáb×?ïê+8›?ïœÑ¡JQõ?ïœÑª`Ü?Vk‚Ý?_<â?ïœpþ*ûŠ?ïœq@§«?ïœ@˜iKÇ?ïœ@¡~éÿ?ïœ' %k?ïœ05µ·?ï›ßªZÑd?ï›ß³pSÁ?" ö×?+6kA?ï›~Žz¯é?ï›~—]?ï›MïrÒ?ï›Mø‡éM?ï›E÷b?ï›N%Aá?ïšì[D?ïšì˜pXÃ?ïš»Î]y’?ïš»×r¨?ïš‹"0×?ïš‹ 7QM?ïšZ*­ôÄ?ïšZ3Ã1?ïš)H b¦?ïš)Q!g?ï™øZGéŒ?ï™øc\ßÜ?ï™Çaf+¿?ï™Çj{ü?ï™–]r7?ï™–f†î_?ï™eL&à??ï™eU;¬L?ï™4-cß?ï™46x?ž?ï™ 2Cl?ï˜ÑÍ^H…?ï˜ÑÖrê/?Œ*´…?•?H?ï˜o?œä?ï˜oH¤"´Þ?8\É?KÒ}?ۋ#?䞊Y?ï”Y¢º?ï”Y¦µ\‘?ï”'T… •?ï”']˜Tø?ï“õ?ïüðly&?ïÉžª5Ð?ïɧ¼>ü?ï–J~Œ8?ï–S†£?ïbêá’ì?ïbóó~”?ï/×]f ?ïTiLH?ïè*e?ïñ86×?ï€çdÜN?ï€çméÈv?Ö] Í?ßjÀG?ï€z<´cG?ï€zEÂ?ï€C—éSI?ï€C öæ]?ï€ èêÐ?ï€ ñn-?ïÖ- š‚?ïÖ6%?ïŸg "®?ïŸp†“?ïh”šØ?ïhîü?ï1³×=`?ï1¼ä¾?ï~úÈ<ñ¹?ï~úÑJ&N?ï~ÃÑ>…?ï~ÃÚK4O?ï~ŒÎâ™´?ï~Œ×ﮯ?ï~UÁ0Ñ ?ï~UÊ=ÖI?ï~¨0p?ï~±=Ã?ï}çƒéá½?ï}çŒöÇ7?ï}°TcãÆ?ï}°]p¹d?ï}y§Qè?ï}y"´§?ï}AÓ»Jg?ï}AÜÈC?ï} ‚¦ó§?ï} ‹³™?ï|Ó&rç¶?ï|Ó/}Ä?ï|›¿'à?ï|›È3˜?ï|dLʯv?ï|dU×%¨?ï|,Ïe`‹?ï|,ØqÆÊ?ï{õE™È?ï{õNð?ï{½­†ã?ï{½¶’Z2?ï{† žÈa?ï{†ªþ³?ï{N\U„?ï{Neaªi?ï{¢°g?ï{«¼}j?ïzÞݹ 1?ïzÞæÅ&x?ïz§ wF¦?ïz§ƒ<ã?ïzo1ð¶¦?ïzo:üœÕ?ïz7K-q ?ïz7T9G??ïyÿY61Í?ïyÿbA÷Ø?ïyÇ\Þs?ïyÇe”f?ïySÅÚ?ïy\Ш³?ïyW@[ûT?ïyWIg‘?ïy!Ü9„?ïy*ç¿?ïxæøMéÁ?ïxçY_8?ïx®Ã¸Œf?ïx®ÌÃñ¶?ïxv‚1^?ïxv‹<\ƒ?ïx>3”@^?ïx><Ÿ…T?ïxÙ’B?ïxâ<?ïwÍt0´?ïwÍ};Ù?ïw•w³Ü?ïw• ‚È3?ïw\‡n?ïw\y#4?ïw$Év?ï\Ô»¢{?ï\–b[I©?ï\–k^›÷?ï\X²åex?ï\X»è¦ ?ï\ø\%?ï\_Sí?ï[Ý2Æg?ï[Ý;É„)?ï[Ÿb,ú?ï[Ÿk/L?ï[a†“@†?ï[a–:?ï[# ¾È?ï[#©¦‰?ïZå¬Ç¥U?ïZåµÊ{H?ïZ§¬¾å–?ïZ§µÁ©¸?ïZi¡j?ïZiªlÊÜ?ïZ+ŠÏÏd?ïZ+“ÒoÙ?ïYíhö Þ?ïYíqù/x?ïY¯;åʧ?ïY¯DèGb?ïYq¢¬†?ïYq ¥`?ïY2À4à?ïY2É79 ?ïXôq¢!?ïXôz¤hª?ïX¶ò¾?ïX¶ ôJà?ïXw³+%?ïXw¼-HA?ïX9CSmÚ?ïX9LU?ïWúÈr¥m?ïWúÑt¤º?ïW¼BŽõ”?ïW¼Kâé?ïW}±¯~o?ïW}º±YÉ?ïW?Úu­?ïW?Ü? ?ïWmc7¾?ïWvdï?ïVÁ¸&¼Ö?ïVÁÁ(b+?ïV‚÷¢ÌÕ?ïVƒ¤` ?ïVD+Ûbe?ïVD4Üã¥?ïVTØ;ä?ïV]Ù«?ïUÆr Ì¬?ïUÆ{¢)Ê?ïU‡…9ÀÉ?ïU‡Ž; Ò?ïUHŒªæ_?ïUH•¬O?ïU ˆûqR?ïU ‘ü˜&?ïTÊz0¾/?ïTʃ1Òä?ïT‹`Q¼Â?ïT‹iR¿T?ïTL;f·?ïTLDfñ#?ïT rY?ïT s7á?ïSÍУ?ïSÍÙ€o1?ïSŽŠ’¸s?ïSŽ““r\?ïSO9³CM?ïSOB³ë?ïSÜ9–?ïSå:X?ïRÐr‡N?ïRÐ{ •?ïRü‡‡?ïR‘‡ø ?ïRQ{Í}?ïRQ„ÍoG?ïRïÚÙÏ?ïRøÛ&V?ïQÒX¶²?ïQÒa¶ìI?ïQ’¶gZ?ïQ’¿g‚?ïQSóIe?ïQSó_?ïQP_tN?ïQY_w¨?ïPÓŒ´ÑÓ?ïPÓ•´ÂÚ?ïP“½øa?ïP“Æø?Î?ïPSä1šÙ?ïPSí1g/?ïPÿf&˜?ïPeà’?ïOÔ9L?ïOÔœàæ?ïO”ݾ®?ïO”ÝSå?ïOT-o3?ïOT,ò?ïOüì?b?ïOë¯É?ïNÓÝõi!?ïNÓæôÇ?ïN“³½ÇX?ïN“¼½à?ïNS~KVß?ïNS‡Jô?ïN=¢”Á?ïNF¡»^?ïMÒñËø?ïMÒúË :?ïM’šÎ)2?ïM’£Í*Ø?ïMR8®X?ïMRA¬ò}?ïMËr‡©?ïMÔqdJ?ïLÑS"n€?ïLÑ\!8š?ïLÏÃŒÄ?ïLØÂDS?ïLPA\¥z?ïLPJ[J|?ïL§õ—?ïL°ó® ?ïKÏ‘ë×?ïKÏ kµ?ïKŽT:ƒÈ?ïKŽ]8ñ?ïKM™ôÓj?ïKM¢ó.?ïK Ó%° ?ïK Ü#ø?ïJËÿ«ˆ?ïJÌ©Sö?ïJ‹ òÈ"?ïJ‹)ðêë?ïJJ7ú|?ïJJ@ ?ïJ AßÖÝ?ïJ JÝÔS?ïIÈA’é4?ïIÈJÓü?ïI‡6 Žì?ïI‡?g?ïIFDé?ïIF(Ž K?ïIýçs?ïIå%¾?ïHÃÑ+Óà?ïHÃÚ)sÏ?ïH‚™eÙ?ïH‚¢cfI?ïHAVšúZ?ïHA_˜tÉ?ïHе ?ïHθ?ïG¾°WV?ïG¾¹ ¬9?ïG}LZçi?ïG}UX)?ïG;Ý» X?ïG;æ¸<£?ïFúbšy?ïFúk—–?ïF¸ÚÖó(?ïF¸ãÓüÌ?ïFwGØ– ?ïFwPÕl?ïF5©¦„?ïF5²¢ÿt?ïEôEYš?ïEô B*¬?ïE²K¼z?ïE²T¹83?ïEpŒŽß?ïEp•:)?ïE.ÁMÊÚ?ïE.ÊJc;?ïDìës‚?ïDìôpz?ïD« Š=y?ïD«†°?ïDi˜‹$?ïDi'”ê¹?ïD''¤²?ïD'0 þ¨?ïCå%µ•˜?ïCå.±Ï@?ïC£ц¢?ïC£!Í­N?ïCaüÊ?ïCa øݼ?ïCÞ?̇?ïCç;Í3?ïBܯ ÿ?ïBܸì©?ïBšs8£Ö?ïBš|4~t?ïBX,0à ?ïBX5,Š›?ïBÙøf ?ïBâô?ïAÓ|•¯?ïAÓ…¦?ïA‘*†?ïA‘ ¸à?ïAN iXð?ïAN©dÔ1?ïA !«ËŠ?ïA *§3¯?ï@É—ÜÐØ?ï@É Ø%Þ?ï@‡l?ï@‡ ýÑO?ï@Dc"?ï@Dl5Ì?ï@¸B”`?ï@Á=¯õ?ï?¿jlÆ?ï?¿ eu/?ï?|AŸ5?ï?|Jš*:?ï?9uè Ö?ï?9~âîÞ?ï>öŸK‚þ?ï>ö¨FQÐ?ï>³¼=ߨ?ï>³Å8›A?ï>pÌœ0…?ï>pÕ–Øá?ï>-ÑÇ—ò?ï>-ÚÂ-?ï=êËÅ¿î?ï=êÔÀAÈ?ï=§ºË™?ï=§Ã˜:,?ï=džUn*?ï=d§OÉt?ï=!vò†?ï=!ì]ƒ?ï<ÞDyÉZ?ï<ÞMsþ?ï<›ó*Š?ï<›íKå?ï?ï5s5Èg?ï5s -ÛB?ï5.‹<¥Ù?ï5.”4¥?ï4ê*B?ï4ê"¿?ï4¥zª?ï4¥‚ûÚ?ï4`àχÕ?ï4`éÇKè?ï4<“‘æ?ï4E‹B??ï3×V@Z?ï3×–MÜõ?ï3’Ó¤Ê?ï3’Ü-¥?ï3N í@l?ï3N䵃?ï3 =Îá?ï3 FÆBg?ï2ÄbÄô?ï2Äk¼A™?ï2|Øú?ï2…Ï<´?ï2:Œ Çj?ï2:•íS?ï1õŽé”l?ï1õ—ঃ?ï1°…KPq?ï1°ŽBN°?ï1kp† í?ï1ky|ôR?ï1&Pž 6?ï1&Y•v½?ï0á%šÏÛ?ï0á.‘’?ï0›ï‚QÜ?ï0›øyž?ï0V®Xó?ï0V·Oá?ï0b$Å8?ï0kL)?ï/Ì ìnN?ï/ÌâáQ?ï/†¨µxÒ?ï/†±«×ä?ï/A;†~?ï/AD|N?ï.ûÃd1W?ï.ûÌZh~?ï.¶@URµ?ï.¶IKuã?ï.p²`jx?ï.p»Vy©?ï.+ŠŠN?ï.+"€…~?ï-åuÙç?ï-å~ÏÎ.?ï-ŸÅØ6ì?ï-ŸÎÎ ?ï-Z c‚u?ï-ZYA?ï-AÊm[?ï-JÀi?ï,Îo ?ï,Îx ˜?ï,ˆ‘F-—?ï,ˆš;°?ï,B¨e‚ˆ?ï,B±ZñX?ï+ü´x@?ï+ü½mš¸?ï+¶µ„ñ8?ï+¶¾z7Ñ?ï+p«ìl?ï+p´…ã?ï+*– S¬?ï+*Ÿ•r?ï*äv»t?ï*ä°¡?ï*žKæ=?ï*žTÛ3?ï*X(m¤?ï*XOy?ï*Õ†è?ï*Þ{µ¾?ï)ËŠ9Ç?ï)Ë’ûó8?ï)…3°Vr?ï)…<¤û¬?ï)>Ѹ©?ï)>ÚI¨?ï(øbZo?ï(øjø×0?ï(±çÙý?ï(±ðÍ~?ï(kb”SŸ?ï(kkˆ§Û?ï($Ò;_&?ï($Û/Ÿ?ï'Þ6ÓŒÝ?ï'Þ?Ǹ‡?ï'—cNR?ï'—™We®?ï'PÞïrZ?ï'Pçãue?ï' "~,o?ï' +r&?ï&Ã[³î?ï&Ãd ŽN?ï&|ˆ»qV?ï&|‘¯7[?ï&5«tÑ¥?ï&5´hƒL?ï%îÃHÉ?ï%îÌ;¶?ï%§Ð:0 ?ï%§Ù-¸ì?ï%`ÒR6?ï%`ÛEª˜?ï%É•¨é?ï%Ò‰û?ï$Ò´—åd?ï$Ò½‹1 ?ï$‹“6¤?ï$‹œ)ÛG?ï$Df¹ÚŒ?ï$Do¬ýK?ï#ý/&Á’?ï#ý8ÏÙ?ï#µìƒóR?ï#µõví?ï#nžÖjÙ?ï#n§ÉP'?ï#'F"â?ï#'O²Î?ï"ßâpDÀ?ï"ßëc ?ï"˜sÄ&§™?ïÝ"-¦¨?ï“«N­C?ï“´=—7?ïJ2j«_?ïJ;Y€7?ï®—ýª?ï·†½a?ï·Û9N?ï·(Éãá?ïm†;ƒ?ïm)¨ï?ï#á½zS?ï#ê«ú•?ïÚ2f‡Ô?ïÚ;Tòé?ïx<¸È?ï+­?ïF³Dù€?ïF¼3:1?ïüã„Á?ïüìrìŽ?ï³¢§??ï³½€?ïi}4?ïi(k5 ?ï,Lc?ï59ñ&?ïÕ._ ?ïÕ75ˆ?ï‹$Þ{¶?ï‹-Ì<î?ïA«Ž?ïA™9ð?ïöñ‚¡°?ïöúp8R?ï¬ÇjK—?ï¬ÐWÌè?ïb’e¾^?ïb›S*[?ïR|^ø?ï[iµž?ïβs?ïΟ´Ì? ”:?úÀ*?ï9Q“ŸÓ?ï9Z€¶c?ïîæJ5Ì?ïîï76ø?ï¤p6t?ï¤y#_Û?ïYï]¿;?ïYøJ•™?ïbkB?ïkX÷?ï ÄÉ<Ÿ/?ï ÄÒ)J¯?ï z%Ùù?ï z-óp?ï /uψ?ï /~»™?ï 仚Ç?ï äć2:?ï ™önÐå?ï ™ÿ[&„?ï O&Q.?ï O/=n=?ï KF?ï T2¹¢?ï ¹eU5/?ï ¹nAJE?ï nt–?ï n}m•§?ï #xѸH?ï #½¢G?ï ØrK!J?ï Ø{6õº?ï `óH?ï iÞ×%?ï BDÎ"$?ï BM¹Ëk?ï ÷ã¨?ï ÷&έV?ï «ì6‹?ï «õ" 1?ï `®vÕÄ?ï `·b>6?ï d‚̆?ï mnU?ïÊŒj?ïÊwY“?ï~¯—Ú´?ï~¸ƒ4?ï3D« F?ï3M–2?ïçÎËKa?ïç׶G…?ïœMüu?ïœVç\?ïPÂEÏè?ïPË0 £?ï+«¼®?ï4–w¯?﹊3fâ?﹓ '?ïmÝâ>©?ïmæÌÎ.?ï"&½ù ?ï"/¨rã?ïÖdËŠ‡?ïÖmµî…?m®?ú»â?ï>À’ ê?ï>É|YS?ïòÞU£Š?ïòç?Æ$?ï¦ðƒÄ?ï¦øøŒ?ïZõš÷/?ïZþ„î!?ïð(^{?ïù?”?ïÂß»ÿØ?ïÂè¥Ë?ïvÄ[è&?ïvÍE„?ï*ž ÝÌ?ï*¦õ}G?ïÞlÒv¥?ïÞu¼:?ï’0´„n?ï’9ø?ïE鶛³?ïEòŸùt?ïù—Þ™[?ïù Çá-?ï­;1Û¸?ï­D ˜?ï`Ó´ÁR?ï`ÜÝ=?ïamó®?ïjVù ?ïÇäbšœ?ïÇíKŠ“?ï{\—`?ï{e€:?ï.Ê´?ï.Òúx?îÿâ+‡õ?îÿâ4p£ ?îÿ•€ÙÅB?îÿ•‰Â],?îÿHË1Ni?îÿHÔÐG?îþü “D°?îþü{°?îþ¯?àÉ?îþ¯Gí6†?îþbh‹^Ñ?îþbqsžy?îþ‡,¿\?îþèì?îýÈší?îýÈ£Õ’?îý{£Ñp|?îý{¬¹mÒ?îý.¡ßÑÁ?îý.ªÇ¸õ?îüá•óZ?îüážÄj?îü”}Žeñ?îü”†v Ù?îüG[9=?îüGd áÝ?îûú."Ð?îûú7 ^¨?îû¬öP9g?îû¬ÿ7±Å?îû_³Æ×?îû_¼®9G?îûeAKX?îûn(—K?îúÅ Ÿ?îúņTÊ?îúw¥’ï?îúw­í²h?îú*4|˺?îú*=cÔò?îùܹñ„?îùÜÁíäx?îù2ªoz?îù;‘L&?îùA¡kô“?îùAªRºô?îøôQ2X?îøô7âk?îø¦^^žÎ?îø¦gE8?îøX¬™²\?îøXµ€5Ë?îø ð¨ì?îø øî?î÷½(­Á·?î÷½1”t?î÷oVÿ¿?î÷o_w@?î÷!y¶ii?î÷!‚œ“i?îöÓ’#‡Š?îöÓ› ›&?îö…ŸÝ¦®?îö…¨Ã£ã?îö7¡£a?îö7ª‰,?îõé—S+?îõé 8åˆ?îõ›‚;å?îõ›ŠöõÑ?îõMaâ¢ü?îõMjÈFu?îôÿ6Ì¡X?îôÿ?².Z?îô±ÔŠ?îô± ¹‰?îôb¿ý–L?îôbÈâöW?îôtNÌp?îô}4û?îóÆÌ0?îóÆ&±O7?îów¼zì¸?îówÅ` 9?îó)PaeU?îó)YFkK?îòÚÙ‚û?îòÚâgê‡?îòŒWåÛâ?îòŒ`Ê´¼?îò=ËŽ¾–?îò=Ôs€Þ?îñï4‚œš?îñï=gHK?îñ ’Çn ?îñ ›¬#?îñQåd×?îñQîãS?îñ+i_Ì?îñ4MǨ?îð´fÅõ²?îð´oªFë?îðe—:ç?îðe !—?îð¼ËEÁ?îðůiª?îïÇ×~+?îïÇàbh?îïxçW_z?îïxð;V?îï)ì\>Ð?îï)õ@ª?îîÚæ‘Ä}?îîÚïu¡?îî‹Õýö?îî‹Þàºa?îî<º¢§?îî<ÆB¯?îí픈?îé•Óp?îéE3M!Æ?îéE

­x?îèõg ÄÊ?îè¥~xÆT?î襇ZƱ?îèU”9€?îèUœã"ç?îèžÜd…?î觾6ñ?î絟#Ë?î絧ðß9?îçe“cìö?îçeœE‘c?îç{º¯n?îç„œ<×?îæÅY,˜?îæÅb|?îæu+¿‚?îæu4 áå?îæ$ówÛ¼?îæ$üY$?îåÔ°ZQd?îåÔ¹;‚›?îå„bk”o?îå„kL®’?îå4 ±‹ô?îå4’?îäã¦/A?îäã¯- ?îä“7ëÓÚ?îä“@̨®?îäB¾ë Â?îäBÇËÉu?îãò;1.¨?îãòDÕ8?î㡬Ĭà?î㡵¥Tþ?îâ_‡®?îâAvé?îâIè’b?îá½oóJÝ?îá½xÓO?îál”,–?îálœã˜?îá­<%?îá¶Öè?îàÊ»¤K?îàÊăÐÊ?îày¿?‡÷?îàyÈ/0?îà(¸2?îà(Àò—"?îßצ$+_?îßׯ¤?î߆‰w%Â?î߆’V‡?îß5bgÄ?îß5jï±Å?îÞä/õÒL?îÞä8Õ÷?îÞ’ó,Uú?îÞ’ü qM?îÞA«·óÜ?îÞA´–÷Ó?îÝðYžXÄ?îÝðb}E\?îÝžüäºê?îÝŸà ?îÝM”[áÅ?îÝM:Ÿ–?îÜüäÿ?îÜü(¹g?îܪ ‘3?îܪ©oÂ?îÜYgS’?îÜYEË?îÜl0"?îÜŠJ=?îÛµá¤Xò?î۵ꂡ˜?îÛd7oì?îÛd?ñ¡?îÛ¿u‹?îÛŠ=?îÚÀÁ¬Æ¨?îÚÀÊŠÈÜ?îÚnößÿ‰?îÚnÿ½ê;?îÚ!^°J?îÚ*<ƒw?îÙËA-zá?îÙËJ 6‡?îÙyVQN?îÙy_.¨i?îÙ'`Î0Á?îÙ'i«½N?îØÕ`©çJ?îØÕi‡\F?î؃UéMñ?î؃^Æ«Z?îØ1?`}K?îØ1H=Ã?î×ßðšÃ?î×ß%ÍÈù?î׌ï©Éê?î׌ø†à‚?î×:·‘:Ø?î×:Àn9Ï?îÖèt«lž?îÖè}ˆSñ?îÖ–&üáO?îÖ–/Ù°û?îÖC΋Hì?îÖC×hî?îÕñkZ0?îÕñt6 …?îÕžýn?îÕŸK ©?îÕL„ÍY?îÕL©Éø?îÔú|q?îÔú X`«?îÔ§s~0î?îÔ§|Zrn?îÔTÚÙZt?îÔT㵄7?îÔ7’”F?îÔ@n¦I?îÓ¯‰®z\?îÓ¯’Št?îÓ\Ñ1««?îÓ\Ú Ž&?îÓ ô«÷?îÓ Ðv©?îÒ·<Ø‘?îÒ·E³Ëv?îÒdaéQú?îÒdjÄí?îÒ|-x°?îÒ…ûò?îѾ‹¨†ÿ?îѾ”ƒòl?îÑk_Þ5?îÑk™;1É?îÑŠWôú?îÑ“30²?îÐÅy”Îb?îÐÅ‚oò:?îÐr^Óð?îÐrfößå?îÐ7ñû.?îÐ@Ìï>?îÏÌŠô?îÏÌög?îÏx˹ˆ?îÏxÔx}Ä?îÏ%…|Ó}?îÏ%ŽWË?îÎÒ4½c}?îÎÒ=—÷Ù?îÎ~Ùe?îÎ~â?š„?îÎ+sx?îÎ+|Rï?îÍØÒô?îÍØ ¬di?îÍ„„TM?îÍ„.‹?îÍ0ü ) ?îÍ1ãE‚?îÌÝhôц?îÌÝqÎÕö?î̉Ëœ?î̉Óö ?îÌ6"„Ú?îÌ6+^®s?îËâo2î?îËâx Å=?îËŽ±)=’?îËŽºáÐ?îË:èo ø?îË:ñH­"?îÊç®Û?îÊçá"î?îÊ“6øEÍ?îÊ“?Ñ¡Å?îÊ?NF )?îÊ?WP?îÉëZôV\?îÉëcÍ‚?îÉ—]ň?îÉ—eáÙ?îÉCTˆM–?îÉC]aI?îÈïAvû>?îÈïJOÞ†?îÈ›"´X?îÈ›+#«?îÈFø!У?îÈGúƒ?îÇòÂÆ8;?îÇòËžÒò?îÇž‚¦W?îÇž‹~Ù?îÇJ7Çl/?îÇJ@ŸÖv?îÆõâ- Ò?îÆõërÝ?îÆ¡Üóx?îÆ¡Šµ-C?îÆMÚÍN?îÆM²îÖ?îÅø¡+ƒG?îÅøªŒ‰?îŤ Ó²Â?îŤ)«£¼?îÅO•Øp?îÅOž°H´?îÄû=¯j?îÄû oÉ?îĦ`Ä™?îĦhàl¦?îÄQµ=ã‚?îÄQ¾s9?îÃüÿá}?îÃý¸ôa?îè?ø²›?îèHР?îÃStf^>?îÃS}=¤ä?îÂþ õK?îÂþ¥â#?ì?ö?î©ÃÃUÕ?îÂTÎI¼?îÂTÖåG3?îÁÿÖt­i?îÁÿßK’u?îÁªÔ%Ã?îÁªÜûÝa?îÁUÇ#úî?îÁUÏú¯?îÁ¯uHš?îÁ¸KäR?îÀ«ùÌ?îÀ«•ô} ?îÀV`#ì?îÀVhù{²?îÀ(ˆrÆ?îÀ1^Å?î¿«æRín?î¿«ï)'5?î¿V™‡Q?î¿V¢]rÄ?î¿B)Å“?î¿JÿÎQ?à?Ì?é¼9?î¾VsÍÊ?î¾V|£¡À?î¾û¸ƒd?B{?wâ Ø?€¸G\?î½UéM„?î½Uò#ó?î½OýØ?î½XÓMY?«÷×Ó?´Í4Š?î¼Tý@3Ÿ?î¼Uwµ?î»ÿCÛ+ ?î»ÿL°W?Î À?ˆ£3Ž?î»S±¬£?î»S¹ñ¦È?îºý×Ëûý?îºýà Ýv?óà 1?ü´èû?îºR]د?îºR2ˆÇ?î¹ü IuJ?î¹ü ­?¨,ž?|«H?î¹Oú}á’?î¹PRG‚?î¸ùáÏ]Û?î¸ù꣫ ?½†+¯?ÆZ`?î¸MƒVÄ?î¸M–Wrn?î·÷RÆ$¹?î·÷[š'›?î·¡ S2­?î·¡'Ä?î·J½/ 3?î·JÆñ|?î¶ôb]sR?î¶ôk1+Ê?î¶üãì¥?·ŒI?î¶GŒÆˆË?î¶G•š—?îµñ |?îµñÜ|n?Œ°Óó?•„)?îµCüÁݸ?îµD•ì?î´íbAN?î´íkqb?î´–½2½„?î´–ÆÇî?î´@ ›‹Þ?î´@n}^?î³éSw?î³é\Rh ?î³’Žãôe?î³’—¶´ ?î³;¾´Âœ?î³;LJiM?î²äâÓlÑ?î²äë¥úŒ?î²ü=$M?™?î²7 ö€?î²7ÈcE?î±àÿ?î±àÔAã?eg9?7ü?î±1÷%G$?î±1ÿ÷Wá?î°ÚÛE&?î°Úä†Û?î°ƒ´Ë?î°ƒ½œñ¼?î°,ƒºpÛ?î°,ŒŒ6u?î¯ÕHh"?î¯ÕPéª?î¯~æÔ?î¯~ ¸g‡?î¯&±-Yö?î¯&¹þÔQ?î®ÏUîùI?î®Ï^ÀZ‰?î®wð1x?î®wùLš?î® ÷Gí?î® ˆÈvî?î­É1 ?î­É 5ô?î­q|ÁEµ?î­q…’Bk?î­ê ­?î­óq¨?î¬ÂMÓ X?î¬ÂV¤j´?î¬j¦_e?î¬j¯/Ä‘?î¬ôGTê?î¬ýìâ?î«»7Œ?î«»@`M?î«cp>;b?î«cy ê?î« žV1`?î« §&}ª?ÁÜ2?ʬD„*p?îš Xæ"|?îš a±‹i?q”Àò?z`?î™UÇßž?î™Uˆ“Û?î˜ûƒ„#k?î˜ûŒO>Ë?|ÍÆÞ?…˜È_?î˜Gk©=?î˜Gtt$¡?î—íPŽ½?î—íXå\w?î—“){$?î—“1è.õ?î—8ö”’ó?î—8ÿ_,Ø?î–Þ¹o<á?î–ÞÂ9¼Ö?î–„q±$,?î–„z{Š0?î–*_pç?î–*()¼õ?î•ÏÂ}f°?î•ÏËG˜Ç?î•u[YÈ?î•ucÙqã?î•éB„?î•ñä@¡?î”Àl¡×j?î”Àuk»†?î”eåªd?î”eîsÑ|?î” T7Ñ*?î” ];?î“°¸Nò%?î“°Áˆ,?î“Vó˹?î“V½G³?î’ûa*Áp?î’ûiô#Y?î’ ¥÷Ít?î’ ®ÁJ?î’Eà_ù ?î’Eé)&Ë?î‘ëa “?î‘ë*9?î‘2Ý"Ö?î‘;¦_?î‘5KÂ.s?î‘5T‹ Ü?îÚZà?îÚbÜÉ'?î]Ö°†?îfŸ[§?î$Wy ?î$_× ˜?îÉE¿pó?îÉN‡ç¾?în)ítõ?în2µÑ’?î<~?î e~è?ÒÒªW?ۚÒ?îŽ\—’D?îŽ\ ZR?îŽQßðÂ?îŽZ§ä„?î¦Ào¶?î¦ ˆI:?îJ§7AÄ?îJ¯ÿ?îŒïBI_°?îŒïK¯?Òú„9?ÛÂñ?îŒ8XKƒ%?îŒ8aó“?î‹ÜÒ Ñ?î‹ÜÚçtñ?î‹Ab‰q?î‹J)ÅA?î‹%¦Œý?î‹%®Ý®z?îŠÊ@Êz?îŠÊ Ñ ?îŠnOå'?îŠnX«üó?.Œ?îŠÎü?ϫÌé?Ør„ù?î‰ZÿÖÀ?î‰[]´?îˆÿ%ŒI?îˆÿ.RÌ_?@Ðv[?I–ß:?îˆGQ§÷@?îˆGZnE³?î‡ëX©.?î‡ë`ÜÝ2?î‡T kÝ?î‡\æ…o?î‡3EÊ)å?î‡3N)?î†×-’F?î†×5Ývì?î†{ DÔ?î†{Òÿ?î†ÙŒej?î†âR?î…Ÿ?î…¨Dª1?î…fZè{ö?î…fc­öž?î… ÍbØ?î… ’Âø?î„­²0î?î„­ºö3²?î„QNêy?î„QVÝ‚?îƒô߆ì?îƒôèK/d?fò¬?oDè‘?îƒ;ãǽ?îƒ;ëÍ£ ?î‚ßU& ?î‚ß]êÑU?î‚‚¼Ú•À?î‚‚ÅŸ;Ø?î‚&*ûB?î‚&"?îÉmç%?îÉuàWü?îlµ°Æ@?îl¾ur?îóî:?îü²IÃ?&Ú¼Ø?/žÝ¶?î€VNY²÷?î€VW¹'?îùkP¯·?îùt›4?îœ}Ä?‡ÔU?î?…·cÄ?î?Ž{Ô?î~âƒ.¼6?î~â‹òWŒ?î~…v.—·?î~…~òO?î~(^º±Ð?î~(g~§?î}Ë<Öü„?î}ËEšG—?î}nˆ<Î?î}nKm?î}ÙÑ—Ð?î}â”­R?î|³˜·¢c?î|³¡z?î|VM>ŠÚ?î|VVjÀ?î{ø÷jMv?î{ù-‰?î{›—?¨?î{› Æå?î{>,Á,â?î{>5ƒ¼F?îzà¶ù•t?îz࿼ ü?îzƒ5Ì6¤?îzƒ>ŽN?îz%ªm?îz%²Þ«Ø?îyÈí¬ß?îyȯÐÁ?îyjsCÔO?îyj|ÝH?îy È$/?îy Ðæ$?îx¯‘gÂ?îx¯S:â?îxQRþO?îxQ[Q¶~?îwóˆ$@¤?îwóåÝÞ?îw•³Q¯F?îw•¼1‰?îw7Ôhc?îw7ÜÝÏ«?îvÙêˆóŸ?îvÙóJ?ê?îv{ö›?3?îv{ÿ\p~?îvøV I?îv¶?îu¿ïÀs@?îu¿øn?îuaÜÜC?îuaåœñ|?îu¾µ?0?îuÇv\?ît¥•0¥È?ît¥ñOå?îtGa.V?îtGiî `?îsé"²! ?îsé+r•?îsŠÙÁuÊ?îsŠâΦ?îs,†^âk?îs, +?îrÎ(ŽqD?îrÎ1N“å?îroÀTün?îroÉí?îrMµ]0?îrVuI‹?îq²Ð´ ¢?îq²ÙsÛÕ?îqTIU°ø?îqTRg?îpõ·–Š?îpõÀ]1e?îp—8?îp—$O·«?îp8u1yÚ?îp8}ðÞQ?îoÙÄ…P?îoÙÍDX‘?îo{ GŠ?îo{Nu‘?îoC_WP?îoLj?în½qØy§?în½z—q1?în^•Øø5?în^ž—Ô|?îmÿ¯eþÔ?îmÿ¸$¿Õ?îm ¾‚ˆ&?îm ÇA-ß?îmAÃ2*‘?îmAËð´ý?îlâ½zJT?îlâÆ8¹q?îlƒ­]µ?îlƒ¶ã?îl$’à A?îl$›žØ·?îkÅnv ?îkÅvÅ“*?îkf>Õ£p?îkfG“¥4?îkNýŠ?îk ãð?îj§ÁwôG?îj§Ê5¿M?îjHsT`‡?îjH|)?îiéè0?îié#¥±k?îi‰¸7Òš?îi‰ÀõKl?îi*JTX?îi*Sy½?îhÊÑ!0q?îhÊÙÞre?îhkM{Ú?îhkV9?îh ¿g;?îh È$F?îg¬&ç¨5?îg¬/¤—Ç?îgL„E>?îgLŒ¾T?îfìÖ·Ò)?îfìßtŠÀ?îfxð?îf'Ë?îf-] `L?îf-eÆáÜ?îeÍ®è¥?îeÍ™kN­?îem¹ÿ§?îem»ñ”?îe ÙbR?îe ὑA?îd­í·N?îd­ösal?îdMø%S?îdNàý?îcíøPH?îcî ú|?îcî;:ô?îcööûŽ?îc-ØúR³?îc-áµ÷¯?îb͸r`Å?îbÍÁ-ê!?îbm|½ƒ?îbm–8+=?îb X¯«?îb `Ù¾?îa­Yç?îa­!QQ?îaLÎ2€ ?îaLÖíšÇ?î`ìy­ÆŠ?î`ì‚hÅ™?î`ŒÏÓ,?î`Œ#Š¶ˆ?î`+±šþ’?î`+ºUÆ9?î_Ë>̦?î_ËFÎx–?î_jÀ>ÂÜ?î_jÈùS?î_ 8Ú?î_ @Ù}P?î^©¥¸‘*?î^©®réà?î^I ´x?î^IÉñi?î]èb(šø?î]èjâ¼"?î]‡±t?î]‡¹Àyz?î]&ôÀ!?î]&ýz #?î\Æ-:ô?î\Æ5óз?î\e[KÍ?î\ed?î\~ùˆÌ?î\‡³ç?î[£˜FÜn?î[£¡V¯?î[B§7ÔO?î[B¯ñ2´?îZá«Ð~k?îZá´‰Àñ?îZ€¦¾ô?îZ€®Ìå˜?îZ–=j?îZž¿H)?îY¾{«©b?îY¾„d˜9?îY]Wæ(?îY]_À¹?îXü(ØÞ?îXü0×Ü?îXšîôhr?îXš÷­?îX9«Œ?îX9´D™,?îWØ]ê -?îWØf¢mO?îWwºR?îWwË{?îW£,÷?îW«ÖX#?îV´4ñ…?îV´=©”/?îVR¼bØr?îVRÅË›?îUñ9u,4?îUñB-W?îU¬,M¿?îU´äÙ?îU.ŒÒ°?îU.Dq¾?îTÌr™ÅŠ?îTÌ{QH‰?îTjÆVù?îTjÏ`?îT Éõ?îT €RÍ?îS§NòŸA?îS§W©Î?îSEƒ×ú-?îSEŒ Ó?îRã®}éÌ?îRã·4àS?îRÎæï{?îR×Éâ?îRå|ý?îRíÎ;A?îQ½ñÔ0?îQ½ùÊvM?îQ[òÞß?îQ[û•e ?îPù锢ƒ?îPùòK I?îP—ÕnB?îP—ÝлÙ?îP5¶C?îP5¾ù3€?îOÓÛ?îOÓ•È4 ?îOqY‹é€?îOqbAâv?îO´&&?îO$jß?îN¬ÓÕâ?îN¬ÜC–]?îNJÆ?îNJ‰Ó¼ÿ?îMè$g_è?îMè-çÝ?îM…½n ?îM…Æ#u±?îM#L6F*?îM#Të•Œ?îLÀÐË?îLÀÙxQ ?îL^KÅÀ?îL^SÍÜ…?îKû»;oö?îKûÃðjg?îK™!.]Û?îK™)ã;ö?îK6|õ4?îK6…©õà?îJÓÍ®“Ž?îJÓÖc8ó?îJq?ó?îJqóŒù?îJNw³Â?îJW, e?îI«]Mƒ?îI«ˆÁ?îIH¥ò2x?îIH®¦fM?îHåÂ:ߟ?îHåÊî÷?îH‚Ô;q¤?îH‚Üïl ?îHÛöáã?îHäªÀm?îG¼Ùp^?îG¼â$Os?îGYÌ­º?îGYÕa`/?îFöµ°Õä?îFö¾d_?îF“”~?îF“1q7?îF0iø?îF0qÌî?îEÍ3‡¤?îEÍ<:;I?îEióɨú?îEiü|À?îE©æ?¢?îE²™:8?îD£TüQ?îD£]®÷Z?îD?ôð~^?îD?ý£?Ù?îCÜŠ“¡ô?îCÜ“FFÜ?îCyçÛY?îCyšc¬?îC–ñÊS?îCŸ¤6?îB² µv?îB²gl–?îBNz4ó‰?îBN‚ç& ?îAêÜu/?îAêå'E?îA‡4z.?îA‡=,k?îA#‚F™T?îA#Šøuê?î@¿ÅÞ£?î@¿Îbý?î@[ÿF|=?î@\ø~?î?ø.®¾?î?ø735O?î?”S“•ñ?î?”\DÿÐ?î?0n€°Î?î?0w1ý÷?î>ÌL-¾?î>̇ý^.?î>h…z.?î>hÉã?î>ËÌà?î>ˆ|Ã×?î= p2[Ç?î= xã5ü?î=Ø?î6…ìíw?î6+ª’r?î6+²³H?î5ÆÌ“ë?î5ÆÕA¶”?î5aäìÊÇ?î5aí›Fp?î4üógQ?î4üûÃÅ÷?î4—÷Rw?î4—ÿ¿”?î42ðãž®?î42ù‘ÃG?î3Íà¿—?î3Íé=Ç$?î3hÆ¿?î3hÎÈ=?î3¡…Á°?î3ª3?î2žrÕÓÈ?î2ž{ƒ„!?î29:u¦?î29B½è?î1ÓöYV?î1ÓÿÌA?î1n§˜‡6?î1n°EàA?î1 N—¾Ý?î1 WDúÈ?î0£ëX­è?î0£ôÌ°?î0>}ß 8?î0>†Œ¡Ù?î/Ù1h?î/ÙÝöà?î/s„O¨?î/sŒûàô?î/ ø>P?î/ê°m?î.¨búš?î.¨j®‡…?î.BÁoÒ?î.BÊI߈?î-Ýê?î-ÝÁ<™?î-wbl`Ô?î-wk–?î-£§›?î-¬S'¢?î,«ÚÈ3Ê?î,«ãt.‘?î,FÔ†’?î,F€d?î+à*΋h?î+à3zK¤?î+zBß•¼?î+zK‹8¯?î+Oî¾U?î+XšCü?î*®RÁîÄ?î*®[mW?î*HK]•?î*HTà ?î)â9Å4”?î)âBpbD?î)|ü#\?î)|&§3³?î)ø‰Ö?î)°|Ò?î(¯Çæ Î?î(¯Ðàl?î(I D?î(I–JüÍ?î'ãI8O¡?î'ãQâêz?î'|ú²Ø?î'}\”J?î'¢Ê}?î'ª»*…?î&°?Wm¢?î&°H°=?î&IÒŠ|¶?î&IÛ4¡â?î%ã[­¹ ?î%ãdWÁZ?î%|ÚÃÎX?î%|ãm¸œ?î%Nùe?î%W£1è?î$¯¸3½ò?î$¯ÀÝmB?î$I8÷ï?î$Iâ‰Á?î#âl þr?î#âtµrÂ?î#{¶°@?î#{¿Ys ?î#÷)*?î#ÿÒcL?î"®-{Ž&?î"®6$©à?î"GY©­ú?î"GbR¬'?î!à{·f°?î!à„`GM?î!y“¨9b?î!yœPül?î!¡€4È?î!ª(Ú=?î «¥AÅ?î «­êLÞ?î Džò°?î D§š}ð?îÝŽ“a?îÝ—;® ?îvt)ñ´?îv|Ò ³?îO¹N?îXa_é?î¨ omQ?î¨)a?î@æ2H;?î@îÚD?î١Ŧž?îÙªm^ù?îrS,l?î·) !?îNÁýü?îNÉ®¸?îæj´|7?îæsYö?î~ Juº?î~îê{?îŸãêS?A?î­*³˜?î­3WºQ?îDªŸì ?îD³DÑ?îÜ gŸˆ?îÜ) œ.?îsŒ­ü?îs”²Œ”?î í˜sƒ?î ö<4 ?î¢EMœ?î¢M«ð?î9’aÉ ?î9›Mf?îÐÕ¨F*?îÐÞK¬m?îhÞù?îh‚A@?î ÿ> ü?î ÿF­&?î –c+üé?î –kÏÎ?î -~Hêï?î -†ëØ®?î Äd¶À?î ʆW?î [–‚mî?î [Ÿ%Z?î ò“¥¨š?î òœH;Ø?î ‰†Ñ¥ ?î ‰t?î o;XØ?î wݯ²?î ·LÉF?î ·Uk~§?î N 9 H?î N(Û'±?î äéw?î äò/sA?î {¨Ê1?î {±l?î ]óE&?î f•Ñ?î© R?ô?î?ªf?î?²·é7?îÖAצ?îÖI¹Ÿ?î¶6sá?îL$÷ˆ?îL-—-`?îâBFžÑ?îâJæ—:?îxU‡m?îx^'G?î^½T¼?îg]@?î¤]ëý2?î¤f‹š@?î:S´ø?î:[¶3Œ?îÐ>@Dª?îÐFߤÂ?îfm :?îf( MÒ?íÿûöŸª?íÿûÿ>Í?íÿ‘ÃÛrE?íÿ‘ÌzvÕ?íÿ'‡$õ¼?íÿ'ÃÛÄ?íþ½@~×?íþ½Iž’?íþRï웡?íþRø‹D?íý蔧 H?íýèE”§?íý~.•+À?íý~73—‹?íý¾pµ(?íýÇ]?íü©D=k}?íü©LÛš?íü>¿þ4Ž?íü>ÈœD‹?íûÔ1¶« ?íûÔ:Tœ?íûi™j‹?íûi¢äG?íúþ÷«†?íúþÿ¹_?íú”JΑg?íú”Sl&Ö?íú)”‡CF?íú)$º ?íù¾ÔHU¢?íù¾Üå­¸?íùT ±?íùT²K?íøé5ðîË?íøé>Ž }?íø~Wß’J?íø~`|ŽE?íøoäIn?íøx&°?í÷¨~¼.?í÷¨†Ÿz´?í÷=ud£?í÷=Šj?íöÒz#KF?íöÒ‚¿ÌK?íöghÅ-Y?íögqa™?íõüM]¹õ?íõüUùýl?íõ‘'ïúö?íõ‘0Œ£?íõ%øÚs?íõ&àR?íôº¿dâ?íôºÇ¬Kð?íôO{¥ZH?íôO„A"ƒ?íóä.AÉÂ?íóä6Ýs&?íóxÖéâ?íóxß„§m?íó už9?íó ~9¤É?íò¢ e<‹?íò¢‰[?íò6•Ah(?íò6Ü–?íñË5L¬?íñËÐ[µ?íñ_E‘'?íñ_•àI?íðóútœŸ?íðôm×?íðˆ\ÿuÃ?íðˆeš( ?íð´Î[ž?íð½hî÷?íï±–P?íï± 0Äu?íïEFZ×·?íïENõ-'?íîÙ€¤½?íîÙˆ¹Û5?íîm¯ç?íîm¸¤Œ?íîÕµìÞ?íîÞOå[?íí•ñŽÒ€?íí•ú(«û?íí*t¿v?íí* yì?íì¾ k?þ?íì¾Ûl?íìR v9à?íìR¶D?íëåý˜2Ì?íëæ1#?íëyçÔºÓ?íëyðmù?íë È/»w?íë ÐÈÚ«?íê¡ž«¾–?íꡧD¾µ?íê5kLX?íê5så9 ?íéÉ-Q?íéÉ5éÓó?íé\ä õm?íé\í9˜9?íèð‘ð:?íè𚈙å?íè„5BGh?íè„=Ú«î?íèΚ?íè×2Æn?íç«]û¼²?íç«f“âç?íç>ãi¤ú?íç>ì¬?íæÒ^ç6?íæÒgÞ?íæeÐxHÖ?íæeÙ{?íåù8 í?íåù@·±]?í匕ásG?í匞xý?íå鿸?íåòW#?íä³3¾à*?íä³1Ä?íÔsFÄdJ?íÔv÷n?íÔ wù?íÓ–¼Ô&?íÓ–Åfî?íÓ(mMdß?íÓ(uߦ?íÒºäàÔ?íÒºwD?íÒK°ž@?íÒK¹0÷?íÑÝC||Ä?íÑÝL^¾?íÑñô?íÑnÕÓ/?íÑKµÃ?íÑTF©C6?íÎhxk²v?íÎh€ü–)?íÍù±”È\?íÍùº%Œ9?íÍŠàÖA?íÍŠéf¼D?íÍ2võ?íÍÂû?íÌ­!¬dð?íÌ­*<É:?íÌ>3H»{?íÌ>;Øÿä?íËÏ; R?íËÏC™vŒ?íË`8ñ‚Î?íË`A‡k?íÊñ-)`?íÊñ5•?íÊ‚F÷?íÊ‚Ö»Î?íÊ÷¹É*?íÊIn?íÉ£ÎaÔ+?íÉ£ÖñY?íÉ4›A"2?íÉ4£Ð‡!?íÈÅ^[”{?íÈÅfêÙr?íÈV´4?íÈV C²1?íÇæÇNÅ?íÇæÏÝÊ?íÇwlrç.?íÇwuÌ-?íÇ Úz?íǘŸv?íƘ—¿+á?íƘ MÐÕ?íÆ)•RÈ?íÆ)'#×´?폛q“?폤Ör?íÅJ²¬ë?íÅJ@ñ¼?íÄÚwÿ:?íÄÚ€£ø?íÄj×z¸î?íÄjཙ?íÃû-&¬ú?íÃû5´‘?íËy?íË”È ?íû;_?íÃì߻?í«óqVB?í«ûþÚ~?íÂ<"©|?íÂ<* •?íÁÌFÓ n?íÁÌO`Qb?íÁ\aè°?íÁ\juÔ[?íÀìsEm¿?íÀì{Òq`?íÀ|z3öd?íÀ|‚ÀÙÖ?íÀ vò?íÀ )Ê4?í¿œi*)j?í¿œq¶Ìx?í¿,Qß ?í¿,Zk¢æ?í¾¼0¾†"?í¾¼9JèÀ?í¾LËL±?í¾LW?í½ÛÑ cz?í½ÛÙ•…œ?í½k’{??í½k›@ä?í¼ûJ$Rx?í¼ûR°4?í¼Šøfg?í¼‹”'»?í¼œ)tX?í¼¤µa?í»ª6‹þ?í»ª?º?í»9Ç0Yn?í»9Ï»¹Ú?íºÉNx8?íºÉV§¸Q?íºXËRó ?íºXÓÞÑ?í¹è>ÖH'?í¹èGaG“?í¹w§ó¨R?í¹w°~‡b?í¹’Ô?í¹’Å?í¸–[]P'?í¸–cçîw?í¸%¦U“?í¸%®ß„€?í·´ç~?í·´ðbˆ?í·DÚßî?í·D'e ?í¶ÓLnÿ?í¶ÓTù³?í¶bpÏ?í±÷ÅÆÉ?í±†tª.?í±†}2ÄÄ?í±"J ?í±*Ò–E?í°£Æ!—í?í°£Î©í‡?í°2`3Kñ?í°2h»€ó?í¯ÀðÊ?í¯Àù Þ‚?í¯OwÒ?í¯O™ Ÿ?í®Ýóãtä?í®ÝükH?í®lfü“h?í®lo„Eó?í­úÐ_ƒÂ?í­úØç©?í­‰0Ù’?í­‰8–JÑ?í­† Ð6?í­Ž• Ê?í¬¥Ò` Ó?í¬¥ÚçPº?í¬4J?í¬4?í«ÂN Vá?í«ÂVEe?í«P|³óä?í«P…:Á²?íªÞ ðøf?íªÞ©w¥|?íªl»dÕx?íªlÃëaÒ?í©úÌ0‹?í©úÔ™œ'?í©ˆÒþ·?í©ˆÛ…ß?í©Ð*“è?í©Ø°½ÿ?í¨¤ÃšoŒ?í¨¤Ì xÜ?í¨2­P~N?í¨2µÖfÕ?í§ÀOîc?í§À•Õ¶?í§Ncœ”˜?í§Nl";ƒ?í¦Ü08Ò#?í¦Ü8¾Xpš ?í¢ÖªÁè?í¢Ö²“ "?í¢dtÅk?í¢dù¶?í¡ñu!Ã\?í¡ñ}¥ß¶?í¡~Ì?í¡~Ôœ w?í¡ [Nz?í¡ !ß(ê?í ™\îÊ?í ™erƒ‰?í &–ÔÜ€?í &ŸXtû?ퟳÇ1ð?ퟳϓ©l?íŸ@í¤é­?íŸ@ö(@(?ížÎ –?ížÎ9y?íž[åµ?íž[&hÉ}?íè'—Ì»?íè0À ?íu'¯%?íu01÷ç?í~ʇ?í&{Ï?íœñ\?íœs¨’?íœ꧞+?íœó* L?훨¤¦»?훨Ë&ôÄ?í›5ëŲ?í›5™mòŸ?íšÂUëÆ?íšÂ^÷–?íšOd3¦?íšOæV?í™ÛÁ›áì?í™ÛÊ«x?í™hi)FÈ?í™hqªï.?í˜õÑÊ?í˜õ‘Y?혛RxÞ?혣ÓÞï?í˜%ô "?í˜.uO?í—š¦÷¦o?í—š¯xÊ ?í—'`ÁF?í—'&áÃÄ?í–³Œ2?í–³”²äO?í–?ðn¸f?í–?øïxs?í•ÌJkª/?í•ÌRìI?í•Xš4¹?í•X¢“²J?í”äàÙ,?í”äè…5|?í”qCÏ}?í”q$Ä ˆ?í“ýNÓyK?í“ýWS“?퓉w¶Dï?퓉€6=g?í“–ﾤ?í“Ÿo•Ï?í’¡¬‚Væ?í’¡µ À?í’-¸qJ–?í’-Àðß?푹º¿†??푹Ã>ùq?í‘E³p ?í‘E»ïqî?íÑ¢†ª?íÑ«7(?í]ˆËæ?í]ƒÛ?íécîlò?íélmZ²?íu6F}½?íu>ÅJ?íÿAø?íŽìï?펌½¡ê?íŽŒÆ s¢?íŽqæ#`?íŽzd‹?í¤{Þ?í¤$ùO‘?í/½c¡f?í/ÅáƧ?팻T£>?팻]!! ?íŒFâ<Õø?íŒF꺸N?í‹Òf33Š?í‹Òn°ôf?í‹]àˆÇ‚?í‹]éfá?íŠéQAü?íŠéY¿ Û?íŠt¸_Ï®?íŠtÀÝ, ?íŠæC?íŠc~u?퉋iØsŽ?퉋rUŒß?퉴9o?퉼¶fß?툡õ ¥•?툡ýˆ{Î?íˆ-,Rò#?íˆ-4ϦÌ?퇸ZMQ?퇸bàg?í‡C}Ÿ¶ ?í‡C†(!?í†Î–èÛ1?í†ÎŸe+?í†Y¦‰r¼?í†Y¯¡ ?í…䬃²¯?í…ä´ÿ¿]?í…o¨Ün?í…o±Wï|?í„ú›“þ’?í„ú¤Çü?í„…„¯ ?í„…*Âã?í„d0\p?í„l«â‹?탛:­?탛B–?íƒ&pjÊ?íƒ&ë­Š?í‚°É5¹º?í‚°Ñ°ÚÈ?í‚;‚lÈ?í‚;ŠçÇv?íÆ2)?íÆ:“zÌ?íPØ<‘$?íPà·M ?í€ÛtÛ ê?í€Û}U§?í€föÊ™?í€fqC?íðêwÒ?íð™dÎ~?í{ éß?í{Æ?턵;?í/Z?í~ð*T?í~ø¤Eq?í~RaÆ?í~Z}1M?í}¤ªC"l?í}¤²¼Ð#?í}.øìb?í}/e£F?í|¹>Š¥?í|¹Fzô³?í|Cy…ÿ”?í|CÿGË?í{Í«}ar?í{ͳö‡Î?í{WÓê ”?í{WÜc?ízáòÎ:ª?ízáûGG?ízl-þp?ízl¦¿)?íyö ¹M?íyö„X!?íy€jkÿ?íy€âèê?íy M1?íy Ås0?íx“þul?íx”‡®}?íx✨±?íxë¿Ñ?íw§½Ž7Ä?íw§Æ,ï?íw1Žç8…?íw1—_ º?ív»VªrQ?ív»_"#?ívEÚ­}?ívER<¼?íuÎÉzÛ?íuÎÑòHD?íuXtìÉ?íuX}8?ítâÕš?ítâþÓ?ítk®9ó?ítk¶A%?ísõ<•…^?ísõE j†?ís~Á‘?ís~ÊÒ?ís=¤?ísE„½¯?ír‘¯V?ír‘·…Õ‰?ír˜R?ír a7?íq¤v«/?íq¤!Yü?íq-Ë¥ÝL?íq-Ôõþ?íp·rí=?íp·èãÑ?íp@Wªóx?íp@` Çì?íoÉP®¥?íoÉ—Æ`ö?íoR½gò™?íoRÅÝ‚Å?ínÛáòkx?ínÛêgÙ{?índüó)®?ínehu†?ímîmeÝ?ímîâ‡?ímwd2?ímwÙ9?ímÚ£?ímNèé?íl‰ ÑÇ?íl‰FŠ'?ílõNB…?ílýÂã\?íkš×R<ò?íkšßÆ»?ík#¯á‘¬?ík#¸Uî ?íj¬~þDË?íj¬‡r~ç?íj5D« %?íj5M7ý?íi¾HS?íi¾¼å?íiF±¿pQ?íiFº3C™?íhÏY¨GC?íhÏbø??íhWøç?íhXyu¾?ígàŒÚàA?ígà•NLœ?ígi*¾?ígi \Å?ífñ™ö8$?ífñ¢i_Ô?ífzBYb?ífzµ^·?íf¼j?íf‰ƒŸb?íeŠæeVæ?íeŠîØ?íeBB"L?íeJ´Àƒ?íd›”ª+?íd›¦ë?íd#Ý ~¤?íd#æØ?íc¬'g©?íc¬%™ž¨?íc4SBj”?íc4[´'?íb¼ôpC?íb¼ˆfbf?íbD¢Æ.?íbD«•ß?íaÌ»)¹…?íaÌÛfÀ?íaTÊ.HZ?íaTÒŸÓ?í`ÜÏ®!Ô?í`ÜØŠ?í`dË«Z?í`dÔŸã?í_ì¾*?í_ìÆ›$f?í_t§+·â?í_t¯œ¸¨?í^ü†³ô?í^ü$Ò_?í^„\Å·Z?í^„e6s?í^ )cA`?í^ 1ÓÚ?í]“ìãe?í]“õZ?í]¦NSÀ?í]®¾§Î?í\£V¡"à?í\£_TZ?í\*ý‹/ä?í\+û>È?í[²›ü?í[²£€ G?í[:/1”8?í[:7¡]è?íZÁ¹R>´?íZÁÁÁåÅ?íZI9^yò?íZIAÍþb?íYЯéqN?íYиXÓ?íYXö ?íYX%eY/?íX߀‡C|?íX߈ö_ø?íXfÚ  J?íXfã?íWî+B§€?íWî3±~¡?íWurr^‘Ñ_ö?íI>š;þ ?íHIJù²˜?íHÄ»d.¼êÂ?í>¼òn[Â?í>B<‡7?í>BDiý¥?í=Ç„¯þà?í=ÇR ?í=LÄQ²?í=LÌx•?í<Ñú)Œß?í<Ò™x?í?í1¿£\˜?í1¿«g:£?í1CöÑ™º?í1Cÿ5T9?í0ÈAQÜ?í0ÈI´™Î?í0L‚„E)?í0LŠç¸‹?í/кmxg?í/ÐÂÐÈ6?í/Té,«?í/TñsXå?í.ÙnUÚ?í.ÙÑ^|?í.]*ŠÉð?í.]2í®÷?í-á=i?í-áEËÜ|?í-eG ôº?í-eOm’„?í,éFÜ6°c?í,m<ÉÓA?í,mE,)Â?í+ñ)_!?í+ñ1Á3ù?í+u ž`þ?í+up+?í*ø抺*?í*øî쥪?í*|·&ú?í*|¿ˆÁà?í*~uSê?í*†Öø?í)„ÛŠZ?í(G<Ÿ?í'’×ͯÁ?í'’à.¡6?í'g‚i`?í'oã7?í&™íüx?í&™ö\¿c?í&k=‚ý?í&sž ?í% ßIŸ?í% ç©ã÷?í%$I!R?í%$Qí_Ü?í$§©ôæ,?í$§²Uå?í$+ ?í$+ k?í#®NÒ¡`?í#®W2tp?í#1“MñF?í#1›­ }?í"´Î¥?í"´Öß0z?í"8jÈ~?í"8Ê/ü?í!»)ˆ¶?í!»1pÌR?í!>Hv^H?í!>PÕ~?í Á^œÆf?í ÁfûÂ:?í Dk†¦?í Dså~l?íÇo7 Ü?íÇw•ÁÛ?íJi°Â/?íJrRA?íÍZö°?íÍcT†Ñ?íPC Þ¥?íPKh&Ò?íÓ!îû?íÓ*MO?íU÷ÒI?íUÿqÒˆ?íØÂdÄD?íØÊ ‡?í[„k ñ?í[ŒÈÅ6?íÞ=)­Ü?íÞE‡B ?í`ì£C?í`õ…ƒ?íã’Ù²5?íã›6þo?íf/Ðck?íf8-‹?íèÉ™x?íèËæž?íkN—?íkVdï®?ííÏNº?íí׫=Á?ípG_î?ípO»°á?íò¶<܃?íò¾™P`?íuê¯~?íu$FÿB?í÷xj½D?í÷€Æèí?íyË¿êb?íyÔñí?íüì÷4?íüHÚž?í~Va•›?í~^½Tâ?í (è?í•fÄ?킺q(?í‚ÂÌŸ”?íÞ•±Ä?íæñ?í†ù|›x?í‡×Ê?í ''—?í ‚2?틘vÓ?í‹ó] ?í Óªf?í .li?íÚP??í4î ?íõ¯‹?íþ ª?í’ÙVY ?í’á°®ñ?í³Ñ(F?í¼+YV?í–…" ?í–|'Ö?íMLÅQ?íU¦­×?íš SL†?íš­Ä?íÂ7û—?íÊ‘›‰?í nlõ?í vÆp¿?í ÞœD?í 7ó—?í  ª…?í  ²l¸?í ":ê?í "Bgù*?í £ÀÒv6?í £É+`†?í %>`Ò?í %F¹˜v?í ¦²½<Œ?í ¦»Þ#?í (éÍØ?í (&BK?í ©éT?í ©ˆAg'?í *ؾ˜?í *áM?í¬(kQo?í¬0Ãas?í-nóBÝ?í-wK.u?í®¬XS0?í®´°[?í/à{F?í/èõ?í± ÄÚ?í±XJ?í2-Ѳ„?í26) V?í³F6·ò?í³NíK?í4Tás?í4]8P?íµZU—9?íµb¬ƒ™?í6V–ê„?í6^í²c?í·I§Åý?í·QþiY?í83Šðö?í8;áoÌ?í¹B¢?í¹˜ü[?í9ëÑ}¬?í9ô'³n?íºº9àH?íºÂñ|?í;~ܘ?í;‡ÔÉ;?í¼;¢c ?í¼Cø+±?í<î§ö8?í<öý™³?ìÿ½˜‘b”?ìÿ½ æáw?ìÿ>9aQ^?ìÿ>A¶«¦?ìþ¾Ñ´Q?ìþ¾Ùoéû?ìþ?_ÀYŠ?ìþ?hj”?ìý¿äÆ?ìý¿íy?ìý@`oÞ?ìý@hn7 ?ìüÀÒ=ö#?ìüÀÚ’™?ìòÂ:š2?ìòÂBëÖü?ìòAì@&|?ìòAô‘Åf?ìñÁ”Í‹\?ìñÁd?ìñA4E ô?ìñA<–v?ìðÀÊ©Ç?ìðÀÒú÷;?ìð@WýbÆ?ìð@`Nn?ìï¿ÜBÕb?ìï¿ä“»Æ?ìï?W|”þ?ìï?_ÍVt?ìî¾É­ƒë?ìî¾Ñþ o?ìî>2×®;(%Ë?ìí½’r†â?ìí½šÂÙz?ìí<èk˜w?ìí<ð»Æ?ìì¼5D)p?ìì¼=”2?ìì;xþÆ?ìì;N©²?ì뺳û6?ì뺻í¹Ö?ìë9å$z&?ìë9ítÂ?ìê¹ ”B(?ìê¹㶼?ìê8,ðÜ?ìê85?Ug?ìé·C:œ9?ìé·K‰Æ·?ìé6PvN?ìé6XÅSp?ìèµT¥A?ìèµ\ô!d?ìè4Oʹ4?ìè4Xt~?ìç³AéS?ìç³J7—‡?ìç2+¨?ìç23PŽÂ?ìæ± 0E?ìæ±g|C?ìæ/â0ÍD?ìæ/ê~ô$?ì宯ÀËý?ì宸ͼ?ìå-s·±i?ìå-|Ž?ìä¬.•:1?ìä¬6âñ¥?ìä*à[¤u?ìä*è©6À?ì㩉 ½B?ìã©‘[*a?ìã((­ç?ìã(0û/€?ì⦿>ª“?ìâ¦Ç‹ÍS?ìâ%LÂÕ ?ìâ%UÒ¬?ìá£Ñ<>'?ìá£Ù‰}?ìá"L­ÙL?ìá"TúŒi?ìà ¿ Ü?ìà Çfš¾?ìà(ƒ†¸?ìà0Ïï[?ì߈ìD?ìß‘8‡}?ìßàW^’?ìßè£|²?ìÞš.Ç??ìÞš77Ü?ìÞt>+•?ìÞ|‰ÿ&?ìÝ–°6+š?ìÝ–¸Ùá?ìÝâ6j?ìÝêè¿c?ìÜ“ ñÉš?ìÜ“=-C?ìÜ,6ðü?ìÜ4‚/R?ìÛCnÁa?ìÛK¹Úa?ìÛ Q›sµ?ìÛ Yæg\?ìÚ‹VÀ’?ìÚ‹_ ãß?ìÚ RÞ½Î?ìÚ [)f¾?ìÙ‡Eú>?ìÙ‡ND”Î?ìÙ0‘ü?ìÙ8^ð)?ì؃0|?ìÄ”Õ&±?ìÄD,T­?ìÄLp­R?ìò R»?ìú䅑?ìà ^Þ?ìà `kâ?ì†t¢ž¸?ì†|æ…ç?ìÂÈ6N•?ìÂÐzí?ìÁÙO®?ìÁë,?ìÀûTŽ1´?ìÀû\ѧU?ìÀwW„Ú?ìÀw•šÔœ?ì¿ó½7”€?ì¿óÅz¾`?ì¿oä0Ï^?ì¿oìsÓZ?ì¾ìEÇm?ì¾ì ˆ¥ƒ?ì¾hx„”?ì¾h»<À?ì½ä#Ëwh?ì½ä, ¨?ì½`'A›®?ì½`/„?ì¼Ü!Yû£?ì¼Ü)œB?ì¼XÙ?ì¼XDù~?ì»Óù¶¡‚?ì»Ôø›ø?ì»OØvè€?ì»O฼ý?ìºË®FœR?ìºË¶ˆJÔ?ìºG{(f€?ìºGƒiï?ì¹Ã?D>?ì¹ÃG_¦Á?ì¹>ú*½¶?ì¹?kú5?츺¬P ­?츺´‘·'?ì¸6U‘„¤?ì¸6]Òu?ì·±õð?ì·±þ0à}?ì·-oi€?ì·-•° Ú?충õØ?충$Qt!?ì¶$¡Ø·?ì¶$ªmí?ìµ ƨÕ?ìµ 'Ú÷?ìµ’ß‚?ìµ›%Œ?ì´–ý¡ß$?ì´—áÅ?ì´^ýé2?ì´g=©?ì³·kí?쳿« ?ì³ í² ?ì³ -%œ?첄M†on?첄UżÚ?ì±ÿ‹8Õ?ì±ÿ“w??ì±zÀ œ?ì±zÈD ·?ì°õëðO‚?ì°õô/*q?ì°qûzÂ?ì°q:/‚?ì¯ì))0-?ì¯ì1g¾¼?ì¯g:{Ðh?ì¯gBº8Ã?ì®âBõß?ì®âK4!(?ì®]B™½Ê?ì®]J×Ùµ?ì­Ø9iña?ì­ØA§ç?ì­S'h˜*?ì­S/¦g›?ì¬Î ˜¶?ì¬ÎÕ¾æ?ì¬HèzÓË?ì¬Hð¸V¸?ì«Ãºþôè?ì«ÃÄ›ü?ì«>ŒÙ2|?쪹ETÈl?쪹M‘Ø?ìª3ý+I°?ìª4h3u?ì©®¬!ùO?ì©®´^¼Ä?ì©)R;·Ì?ì©)ZxTî?쨣ïz2p?쨣÷¶©=?쨃ßäR?쨌4Ç?짙ok:?짙«•T?짒+en?짚gi+?즎 ¤à?즎Q‚>?ì¦}0ë ?즅l¢?쥂åqÂ?쥂í»Y?ì¤ýE·(?ì¤ýM?!X?ì¤w›À::?ì¤w£û~?ì£ñé7ü÷?ì£ññsQ?ì£l-Y¬%?ì£l5”£?ì¢æh›Á]?ì¢æpÖ‘Ö?ì¢`›Œ"?ì¢`£;6'?ì¡ÚÄŠ~?ì¡ÚÌÅ?ì¡Tå<-Z?ì¡TívŠp?ì ÎýÇ”?ì ÏQþ.?ì I žþ?ì IY¯?ìŸÃV'Ü?ìŸÃx?ìŸ=½“?ìŸ=÷V ?ìž·Xü?ìž· ‘®Ž?ìž0ð(€?ìž0øaö˜?ìªÓ135?ìªÛj‚´?ì$­sÕW?ì$µ¬þH?윞~óÌ?윞‡,Îp?ìœG²Ãå?ìœO럴?ì›’5f?ì›’nR?ì› ½j¤°?ì› Å£3R?ìš…jÇ‹š?ìš…rÿó¢?ì™ÿNɇ?ì™ÿ‡ ò?ì™x«†'?ì™x³: ó?ì˜ò=å-u?ì˜òF!ž?ì˜kÇøèF?ì˜kÐ0µË?ì—åI@E€?ì—åQwì^?ì—^Á½MI?ì—^ÉôÍ}?ì–Ø1rmÊ?ì–Ø9©ÇS?ì–Q˜b7?ì–Q ™jX?ì•Êö?ì•ÊþÆ%¹?ì•DKúü§?ì•DT1â?씽˜¨¶U?씽 ßu?ì”6Üšsæ?ì”6äÑ ì?ì“°ÒA~?ì“° ²É?ì“)IÖg?ì“)R Oõ?ì’¢r”öJ?ì’¢zË?ì’’ƒ=j?ì’š¹:t?ì‘”©¢û¬?ì‘”±ØÑñ?ì‘ ·ö•ø?ì‘ À,Eu?솽€Oþ?ì†ÅµØ°?ìÿºB±P?ìÿÂx5?ìx®?»f?ìx¶tö|?ìŽñ™y³ž?ìŽñ¡®Çâ?ìŽj{óf^?ìŽj„(SÍ?ìãU®ÖÂ?ìã]ãY?ì\&®Žò?ì\.ã.°?ìŒÔîôÖ`?ìŒÔ÷)OB?ìŒM®ƒT?ìŒM¶·âW?ì‹Æe]­A?ì‹Æm‘Øc?ì‹?…T¡?ì‹?¹Xà?슷¸Bl?슷ÀµÅ?ìŠ0T@ŒÏ?ìŠ0\tC>?쉨ç6¿&?쉨ïjNª?ì‰!qeÒ¡?ì‰!y™;7?숙òÐ%—?숙ûg=?ìˆkwõ^?ìˆs«?쇊Û_ÂË?쇊㒶ˆ?ì‡B‰g×?ì‡J¼4›?ì†{ ÷©U?ì†{©*O?ì…óö¬è?ì…óþßfè?ì…lC«!?ì~… ’^?ì~…ÂvK?ì}üß«Ör?ì}üçÜ _?ìw˜Ì?ìw˜0+?ìwpLl?ìwxz?Œ?ìv†Çäß·?ìv†Ðï‘?ìuþÎç¢?ìuþüÐ3?ìuu] Íø?ìuue9>?ìtìšžŒ'?ìtì¢Ì& ?ìtcψò%?ìtc׶dÎ?ìsÚû͸?ìsÛú^?ìsRm…q?ìsR'š©r?ìrÉ:lÁ>?ìrÉB™½ç?ìr@L̹V?ìr@TùŽ¦?ìq·Vå¯?ìq·^¼“¢?ìq.W@¡œ?ìq._m(0?ìp¥NÎï?ìp¥VûNF?ìp=ª0?ìpEÖJÿ?ìo“#ÔyŠ?ìo“,‰ñ?ìo P+2?ìo |0?ìn€Ö÷˜?ìn€ÞK¹*?ìm÷¢EÇÎ?ìm÷ªqaò?ìmneæt?ìmnmï(?ìlå œ…9?ìlå(ÇÐy?ìl[ÒÑË?ìl[ÚüîÛ?ìkÒ|eæì?ìkÒ„ã??ìkI[ªé?ìkI%†Á?ìj¿µµ>?ìj¿½ß°™?ìj6Esý™?ìj6Mžƒu?ìi¬Ì›¯&?ìi¬ÔÆ ?ìi#K-‚-?ìi#SW¹?ìh™Àµd,?ìh™Èßsz?ìh-#WÉ?ìh5M??ìg†åÊ:?ìg†™Šr?ìfüëþÞò?ìfüô(w›?ìfs>q~®?ìfsFšïÆ?ìeéˆ>Ç_?ìeéhã?ìe_ÉiÃ…?ìe_Ñ’ås?ìdÖô¹>?ìdÖ ³”?ìdL1ál ?ìdL: >Å?ìcÂY2#?ìcÂaZÎ7?ìc8wéˆF?ìc8€ Ä?ìb®Ž ¢?ìb®–1ýö?ìb$›”˜t?ìb$£¼Ì©?ìaš ŒÕ?ìaš¨´á ?ìaœô¡q?ìa¥†V?ì`†Î.?ì`†˜õÃf?ì_ü{¥Ûª?ì_üƒÍq4?ì_r]lfÌ?ì_re“Ô£?ì^è6ŽýC?ì^è>¶Cf?ì^^R?ì^^7<À?ì]ÓÎñ…Ô?ì]Ó×|ˆ?ì]IŽ5rÃ?ì]I–\A¼?ì\¿DÞÇ¢?ì\¿MnÝ?ì\4òïAÈ?ì\4ûÁC?ì[ª˜hàZ?ì[ª 8?ì[ 5N‡?ì[ =t·?ìZ•É¡õ?ìZ•ÑÇý*?ìZ Uek¸?ìZ ]‹L?ìY€Ø›-‰?ìY€àÀæ?ìXöSE}$?ìXö[k é?ìXkÅf\¢?ìXkÍ‹Å•?ìWá/²J?ìWá7%ói?ìWV¢5?ìWV—Ç7}?ìVËç:„]?ìVËï_uÌ?ìVA66È]?ìVA>[‘ð?ìU¶|˜À}?ìU¶„½b2?ìU+ºbÅv?ìU+‡?J?ìT ï—û?ìT ÷»aì?ìT7Ù6?ìT$\B?ìS‹@G:R?ìS‹HkÕÅ+â¨?ì>ÕÍIñ6?ì>I›Tnl?ì>I£rT²?ì=½i Aˆ?ì=½q)ÿ„?ì=1-äË?ì=16`±?ì<¤éÎsW?ì<¤ñëà¶?ì<2Ê»?ì<¥PÉ?ì;ŒHÖ™?ì;ŒP0óR?ì:ÿês|æ?ì:ÿòqH?ì:s„TCã?ì:sŒqì?ì9ç¸g?ì9çÔ¶?ì9Zž ïº?ì9Z¦½k?ì8΃I?ì8Î'-Ö7?ì8A— µB?ì8AŸ'ßÌ?ì7µ‘®(?ì7µ­°M?ì7(m¥Ö¼?ì7(uÁ°y?ì6›ÌIø¨?ì6›Ôe©û?ì6"€]ª?ì6*›æ?ì5‚pK0?ì5‚xfz?ì4õµ¬Ú*?ì4õ½È/?ì4hò7Š¶?ì4húRšG?ì3Ü%ÜJ?ì3Ü-÷1ª?ì3OQ>?ì3OYü±?ì2Âs®E?ì2Â{ÈÛ)?ì25ßþ?ì25•úlD?ì1¨ŸšK?ì1¨§´¦?ì1¨ß, ?ì1°ùID?ì0Ž©±"Ž?ì0Ž±Ë­?ì0¢ïƒ?ì0ª+»?ì/t’µ?ì/tšXœ?ì.çy‰;Eë¶?ì >CTÝ?ì ®îÁ%ª?ì ®öÏíÆ?ì ™öf?ì ¢ ?ì<è?ìDöŒ¿?ì×-Þº?ìß<+;?ìqh¹„F?ìqpǧ?ìáñî?ìáùü ?ìRrÍ?ìRzÛ]í?ìÂëYÖ?ìÂóg}¤?ì3[•«?ì3c£)P?ì£Ã‚U ?ì£Ëª?ì#"?ì+/AÅ?ì„zw/ø?ì„‚„2s?ìôɃÆh?ìôÑŸ—?ìeI >?ìeVP ?ìÕNË]’?ìÕV×ä#?ìE… i5?ìEÆt?ìµ³ '?ìµ»;?ì%ØÉšª?ì%àÕ¥SÒ?ëóÀضêZ?ëóÀà¿e ?ëó0>öÎ?ëó0Fÿ9?ëòŸœ÷?ëòŸ¤ÿ·«?ëòòº­Ì?ëòú«Ê?ëñ~@B{ô?ëñ~HJP\?ëðí…‘nT?ëðí™$?ëð\©ˆ?ëð\Ê°„¾?ëïË÷‹rµ?ëïËÿ’ÊN?ëï;$;ð?ëï;,B?ê?ëîªH¹žb?ëîªPÀ¢º?ëîeôT?ëîmÏ ?ëíˆy+¨/?ëíˆ2Y>?ëì÷„¼Š·?ëì÷ŒÃ?ëìf‡­¡W?ëìf³ÿ?ëëÕ‚_^D?ëëÕŠe’S?ëëDtÓui?ëëD|ÙÇ?ëê³_ ØF?ëê³g¸ò?ëê"A Ôv?ëê"I‹n?ëé‘Ò=›?ëé‘"×ÊÜ?ëèÿìd$á?ëèÿôiˆi?ëènµÂºS?ëèn½Çô?ëçÝvï´.?ëçÝ~ôÄS?ëâ/F’Á=?ëá¤ý_?ëá­£W?ëá 9ºæ?ëá <ÕU?ëàzYF4Ø?ëàzaI%j?ëßè§%3„?ëßè¯'ú8?ëßVìØgs?ëßVôÛE?ëÞÅ*aÜÂ?ëÞÅ2dO°?ëÞ3_ÃÜ¢?ëÞ3gÆ%ª?ëÝ¡7?ëÝ¡•V??ëݲùZ?ëݺî?ëÜ}Ï0Ò?ëÜ}×ü?ëÛëãçÍ?ëÛëëéna?ëÛYð¡Ü3?ëÛYø£S™?ëÚÇôÛ¹?ëÚÇüÝw?ëÚ5ð‡¦V?ëÚ5øˆÉÒ?ëÙ£ä­þ?ë٣지?ëÙÏQµÿ?ëÙ×R…†?ëزt<(?ëغtá±?ë×ílqz?ë×í•lí?ë×[`=M~?ë×[h=Ÿ?ëÖÉ*èü?ëÖÉ2è)~?ëÖ6ínïÆ?ëÖ6õníA?ëÕ¤§Ô5?ëÕ¤¯Óð¦?ëÕZTƒ?ëÕbýé?ëÔ€@ºù?ëÔ€ @:Q?ëÓí¦L9Æ?ëÓí®K ?ëÓ[@>?ëÓ[H=@G?ëÒÈÒúN?ëÒÈÚûn?ëÒ6[ÜL‚?ëÒ6cÛ#‹?ëÑ£Ý)?ëÑ£å'¼î?ëÑUð‡ý?ëÑ]ï Ï?ëÐ~ÆC?ëÐ~ÎŽ›É?ëÏì/ åz?ëÏì7 ?ëÏY_n2?ëÏY—]r¡?ëÎÆç“U?ëÎÆï‘/d?ëÎ47§!S?ëÎ4?¤Ñt?ëÍ¡œðÿ?ëÍ¡‡švö?ëÍ¿vÄx?ëÍÇt C?ëÌ{÷6œc?ëÌ{ÿ3Íÿ?ëËé&Þ—Û?ëËé.ÛŸF?ëËVNp| ?ëËVVmY@?ëÊÃmîJ¡?ëÊÃuêý¡?ëÊ0…Yçž?ëÊ0Vpf?ëÉ”µÍ?ëÉœ²,?ëÉ œJÝ?ëÉ £ÿ.?ëÈwšâ³?ëÈw¢Þ$Å?ëÇä‘D¼¹?ëÇä™@œ‰?ëÇQ‡rë?ëÇQ‡ƒ(w?ëƾe¬V?ëƾm§£œ?ëÆ+C´â[?ëÆ+K°CX?ëŘ£p¶?ëŘ!ž§g?ëÅçyùr?ëÅïuÖ?ëÄq­:vå?ëÄqµ5Xù?ëÃÞjæ§Þ?ëÃÞrá_¡?ëÃK €ÃM?ëÃK({P»?ë·Πē?ë·Ö'ª?ëÂ$s†‰i?ëÂ${€Â(?ëÁ‘õïð?ëÁ‘ïþS?ëÀý¦[ND?ëÀý®U2I?ëÀj3¸GU?ëÀj;²û?ë¿Ö¹õ?ë¿ÖÁ£8?ë¿C5ÿöâ?ë¿C=ù[Á?뾯ª}ɤ?뾯²w?ë¾ãfË?ë¾ÜvÙ?뽈{2ß¹?뽈ƒ+Å\?ë¼ô×n×?ë¼ôßg= ?ë¼a+—¬ ?ë¼a3<Î?ë»Íw±Ö?ë»Í©l(?ë»9»»îÞ?ë»9ô*º?뺥÷ºz?뺥ÿ²‹}?ëº+¯2?ëº3¦û?ë¹~W›;°?ë¹~_’ø ?ë¸ê{€Èç?ë¸êƒxZØ?ë¸V—b)h?ë¸VŸYÙ?ë·Â«A6 ?ë·Â³8s?ë·.·ª?ë·.¿¼÷?붚ºÿ¹¥?붚Âö¡†?붶‚ßC?붾yœ›?ëµr©›B‚?ëµr±‘ÕM?ë´Þ”£Ü?ë´ÞœšDO?ë´Jwž@Á?ë´J”~l?볶RŒ|”?볶Z‚¬?ë³"%pôü?ë³"-fÝ?ë²ðLæ±?ë²øB¤œ?ë±ù³"š ?ë±ù»-]?ë±emô9ø?ë±eu颬?ë°Ñ Ã]K?ë°Ñ(¸›a?ë°<Ë’/?ë°<Ó‡C?믨nbHU?믨vW1&?ë¯ 6?ë¯*Í3?뮜þJ?뮤‘Î?ë­ë&ï¹S?ë­ë.ä"-?ë­V©Ù»f?ë­V±Íù’?ë¬Â$o^8?ë¬Â,cq¶?ë¬-–£¶¥?ë¬-ž—Ÿq?ë«™ÏÆ?ë«™Ä?ë«bõͧ?ë«jéa ?ëªo½Óð?ëªoÅ <›?ë©Û7†â?ë©Û*ÄÒ?ë©FYW ?ë©FaJ>?먱›xg³?먱£kP(?ë¨Õ.P?ë¨Ýì?마Ç„W?마ºF?ë¦ó1ù|?ë¦ó9ë÷¥?ë¦^T4â2?ë¦^\'“?ë¥Én{…N?ë¥Évm—å?ë¥4€Ïï?ë¥4ˆÁi¸?뤟‹2Ä?뤟“$€ú?ë¤ §7¼?ë¤ •˜Éå?ë£u‡Ðj²?ë£uÁÒ?ë¢ày û»?ë¢à’8:?ë¢Kcqx¨?ë¢KkbŠN?롶EDå?롶M5±?ë¡!®\?ë¡!' jK?ë ‹ðö¸‡?ë ‹øçI–?ëŸöºÚÏç?ëŸöÂË6?ëŸa|È€†?ëŸa„¸»Ð?ëžÌ6ÁÌd?ëžÌ>±ÜÇ?ëž6èȘn?ëž6ð¸}é?ë¡’Þç8?롚ΡÈ?ë 5F+?ë <õÕÎ?ëœvÏ@ó=?ë€O'xì?ë€O/_Q:?ë¸<Æmö?ë¸D­å?ë!JCžÖ?ë!R*•d?ë~ŠOñ¦ä?ë~ŠWØr?ë}óMwÅg?ë}óU^e+?ë}\BÉê?ë}\J¯„F?ë|Å0:Õ?ë|Å8!?ë|.ÎÿŒ?ë|.µ?ë{–ó‡#¢?ë{–ûm·?ëzÿÉe ?ëzÿÑKfº?ëzh—l ¸?ëzhŸQ¤è?ëyÑ]œ/x?ëyÑeŸ2?ëy:ø7 ?ëy:#Ý{N?ëx¢Ò¶4?ëx¢ÚfÎü?ëx :|´?ëx ‰iþ?ëwt($ÍÜ?ëwt0 ¨?ëvÜÇB¯?ëvÜÏ&œú?ëvE^”1k?ëvEfxœ2?ëu­îuV?ëu­ö´—?ëuußiô?ëu}Ã}®?ët~õ‚=>?ët~ýf%n?ësçlù±ê?ësçtÝn?ësOÜ™ˆ¡?ësOä}¶?ër¸Dcý?ër¸LGb‹?ër ¤Z×ë?ër ¬>Û?ëqˆüŦ?ëq‰bÔ?ëpñLÔ¬\?ëpñT·?ëpY•[$?ëpY>FM?ëoÁÖ7î?ëoÁÝøÃz?ëo*7}?ëo*è—k?ën’@-Ë)?ën’Hÿw?ëmúiŽ ö?ëmúqp© ?ëmb‹*  ?ëmb“ }¦?ëlÊ¥²?ëlʬåc|?ël2·½®?ël2¾ýCb?ëkšÁtrz?ëkšÉUÌ‚?ëk÷$X?ëk˘R²?ëjj½×?Ù?ëjjŸB‚?ëiÒ°'üú?ëiÒ¸Óñ?ëi:š«‘¤?ëi:¢Œ<æ?ëh¢}cˆ7?ëh¢…DÂ?ëh XQúp?ëh `2NA?ëgr+xÜ?ëgr3X·ñ?ëfÙöØÓÀ?ëfÙþ¸Ð?ëfAºtý8?ëfAÂTÍÏ?ëe©vO c?ëe©~.¯7?ëe*h‡S?ëe2Hc?ëdxÖÃV"?ëdxÞ¢£k?ëcà{aY)?ëcàƒ@z©?ëcHD?ëcH #…C?ëb¯­n£?ëb¯µMlû?ëb:ávÞ?ëbBÀö?ëa~ÀG,…?ëa~È%žÊ?ë`æ=“0â?ë`æEqwS?ë`M³4M?ë`MºöNè?ë_µ Ø-ý?ë_µ(¶¾?ë_†Ô£o?ë_Ž²fU?ë^ƒå¨Ú?ë^ƒìí?ã?ë]ë;‹´?ë]ëCh„Þ?ë]RŠHµ>?ë]R’%ô†?ë\¹ÑJŒ?ë\¹Ù'1ð?ë\!‘jÌ?ë\!nRI?ë[ˆH =–?ë[ˆOüù+?ëZïwøÈø?ëZïÕX¢?ëZV [Ò?ëZV§ø¿?ëY½ÀŒÓx?ëY½Èi F?ëY$ÙL›v?ëY$á(§S?ëX‹ê]“?ëX‹ò8ã|?ëWòói20?ëWòûDæ#?ëWYôe"r?ëWYü@ªm?ëVÀí¡þ¢?ëVÀõ}Z£?ëV'ß!Õ?ëV'æý?ëUŽÈæ´ ?ëUŽÐÁ¸?ëTõªò8ö?ëTõ²Íû?ëT\…F9þ?ëT\ åÿ?ëSÃWä ?ëSÃ_¿ œ?ëS*"Ï Ž?ëS**©^‚?ëRæO!?ëRíáw ?ëQ÷¡‡†?ëQ÷©iƒe?ëQ^Uhý®?ëQ^]BÍ~?ëPÅ•úŠ?ëPÅ ožI?ëP+¦V?ëP+­ñÍ´?ëO’BñwI?ëO’JÊÂá?ëNøØ#‹–?ëNøßü«?ëN_eZge?ëN_m3ZÌ?ëMÅê‰Í*?ëMÅòb”u?ëM,h›?ëM,oÛ61?ëL’Ýƽw?ëL’åŸ,„?ëKùK×èÌ?ëKùS°+·?ëK_²7íË?ëK_º‘?ëJÆè??ëJÆÀkß?ëJ,gëÉ?ëJ,oÇ~?ëI’·C^6?ëI’¿ð‚?ëHøþðÚ-?ëHùÈ@K?ëH_>ö+?ëH_FÍe ?ëGÅwU#@?ëGÅ,0ü?ëG+¨±??ëG+¯æ’È?ëF‘Ñ'o€?ëF‘Øþ$Ò?ëE÷òžM$?ëE÷útÖ>?ëE^ v9ƒ?ëE^L–c?ëDÄ[Ñ]?ëDÄ&2?ëD*(C›?ëD*0þ?ëC*{ú]?ëC2QÒ?ëBö%”û?ëBö,Þ@Ú?ëB\êM?ëB\¿æ?ëAÂ#&š?ëA øyë?ëA'æ´Ñ(?ëA'î‰ø/?ë@¡">?ë@Êvù?ë?ó–ê8?ë?óž¾Ð¤?ë?Yc‘†?ë?Yke§¡?ë>¿(˜?ë>¿0lŠÈ?ë>$æý¯?ë>$íÕG"?ë=Š›ÍŒÙ?ë=Š£¡©õ?ë<ðIÿ¬?ë<ðQÓœÄ?ë?ë6çx 2?ë6LÊ F?ë6LÑßž?ë5²2pT?ë5²$L8?ë5fÀHÂ?ë5n‘ø0?ë4|©·ÙÎ?ë4|±‰\Ã?ë3áå?X?ë3áìì•Ò?ë3Gìy~?ë3G ½£|?ë2¬E,á9?ë2¬LýÞ¸?ë2iÞ[@?ë2q¯,??ë1v†¯€,?ë1vŽ€$§?ë0Û›”ž²?ë0Û£e¨?ë0@¨ÛÙæ?ë0@°¬%T?ë/¥®‡}û?ë/¥¶Wœß?ë/ ¬˜ÀÊ?ë/ ´h³"?ë.o£›k?ë.oªáa4?ë-Ô‘óÏw?ë-Ô™Ãh¯?ë-9yAÁ?ë-9‹g?ë,žXûKW?ë,ž`Ê‹h?ë,1$jî?ë,8ó~h?ë+h½´þ?ë+h Œ›ß?ë*ÌÊÉ?ë*ÌÒ—Âe?ë*1ŒHz¦?ë*1”O?ë)–F=³ù?ë)–N ?ë(úøªw„?ë(ûx«ë?ë(_£ˆî?ë(_«^±?ë'ÄFŸCÏ?ë'ÄNmë?ë'(áËj?ë'(é˜ÀÞ?ë&ua| ?ë&}.þj?ë%òd>P?ë%ò 1“l?ë%V…Õ“?ë%V¢<?ë$»µ¸¼?ë$» ‚´w?ë$xY"?ë$Õ(*?ë#ƒåÍï ?ë#ƒíš‘ó?ë"èLßc?ë"èSÕTþ?ë"Lªº’Œ?ë"L²†Ûm?ë!±äýê?ë!± ±?ë!Q‰úÈ?ë!YUê.?ë y™ªô?ë y¡v¶­?ëÝÚIß?ëÝâtÿ?ëBhzT?ëB3ãs?ë¦Ehž?ë¦LÓ¤ö?ë nÙþ„?ë v¥?ënÑø÷?ën˜œÛ»?ëÒ«<ò·?ëÒ³¨­?ë6¾‡?ë6Åç,?ëšÉrˆ?ëšÑ<äå?ëþÍ@Ê?ëûΰ”N?ë^´î7l?ë^¼±æX?ëÁ›‚¶?ëÁ£F7ä?ë$z¬Ê?ë$‚onh?ë‡Rl|?ë‡Z/8ï?ëê"Ä‚ý?ëê*‡}D?ëLë·¾?ëLóyê×?믬öp{?믴¹c?ëfwˆÌ?ën9û?êÿu„²û?êÿu Fø{?êþ××?êþ×Êá¯c?êþ:fJá?êþ:n þð?êý¶Š?êý Çt^?êüÿ–TBù?êüÿžÓ?êüb#7³§?êüb*ùý?êûĨ±DÖ?êûÄ°rzë?êû'&»?êû'.ƒÃÔ?êú‰nG?êú‰¥/#'?êùì ´ñ7?êùìuŸy?êùNt˜éœ?êùN|Yj”?êø°Õö?êø°ÜÜI­?êø.?o@?êø5ÿ•œ?ê÷u€6'?ê÷u‡Å/3?êö×Ê åë?êö×Ñ౤?êö: ‡¦²?êö:GE?êõœG‚ÞÎ?êõœOBOÚ?êôþ{gª?êôþ‚Ó«]?êô`§=®r?êô`®üÄÉ?êóĄ̂ ?êóÂÓ¿‘?êó$é^Ý*?êó$ñ˜Ä?êò†ÿYñÊ?êò‡€?êñé óÀJ?êñé²!?êñK.?êñKì;‡?êð­ RÂ?êð­ÈXÇ?êð Š)ý?êðH—?êïpþ¯º?êïqme7?êáÔgñ_Ï?êáÔo«!?êá5¯TY?êá5¶¾è{?êà–îÂE?êà–ö{¬?êßø')|”?êßø.âµv?êßYX<É|?êßY_õÔ¹?êÞºýü>?êÞº‰¶ÙÖ?êÞ¤n”„?êÞ¬'Dt?êÝ|¿-?êÝ|ÇH¯L?êÜÝÓd±*?êÜÝÛÄ?êÜ>ßí†`?êÜ>祭K?êÛŸå,˜h?êÛŸìä‘£?êÛã#gê?êÛêÛ3r?êÚaÙÓÆ.?êÚaá‹d?êÙÂÉ?x?êÙÂÐö‰–?êÙ#±ùî?êÙ#¸Ó?êÁpó·ÇÀ?êÁpûh:¢?êÀпLÄ?êÀÐÆÍ‘œ?êÀ0ƒK±«?êÀ0ŠûÈv?ê¿@Dó?ê¿Gô¯?ê¾ïö®.?ê¾ïý¸hÚ?ê¾O¤šã®?ê¾O¬JpF?꽯KüFx?꽯S«¤ü?ê½ì.³?ê½óÝã‡?ê¼n…3‚?ê¼nŒâ„Z?ê»Î Å?ê»Î»™´?ê–¢éfô?ê–¢ñ +Ÿ?ê–ÌÖcæ?ê–ÔzZü?ê•^©8Ó?ê•^°ÛÉO?ꔼ~ŒWJ?ꔼ†/ñ,?ê”LÔÈ?ê”Tx3S?ê“xP?ê“x¶Œ©?ê’ÕÔR(?ê’ÕÛ¦`,?ê’3Œ›,?ê’3”> g?ê‘‘>ÉB?ê‘‘E¿yþ?êî艄a?êîð,w?êL‹ãç?êL“…sT?êª(+x`?êª/Í!?ê½c´ä?êŪ÷?êŽeK˜X?êŽeS/_¼?êÂÒª˜?êÂÚL0³?ê R¼ø?ê Z]úø?êŒ}ËÄÄö?êŒ}ÓfA?ê‹Û=Ä÷p?ê‹ÛEf?ê‹8¨¾Ò?ê‹8°_¯ï?ꊖ ³Êé?ꊖTz?ê‰ói¥¥Ê?ê‰óqF&+?ê‰P¿•Ù ?ê‰PÇ6*®?ꈮ@¿?ꈮàáï?êˆ Uœçù?êˆ ]<Ü?ê‡h•ë7Ú?ê‡hŠý0?ê†ÅÏ-l>?ê†ÅÖÍÍ?ê†#e!?ê†# væ?ê…€,“ÞN?ê…€43H?ê„ÝP»J2?ê„ÝXZT]?ê„:mÜÝ4?ê„:u{¸?ꃗƒúUˆ?ꃗ‹™?ê‚ô“ >?ê‚ôš³‡ô?ê‚Q›.ín?ê‚Q¢Ímî?êz‹Ú[;?êye)æ³å?êye1‚r@?êxÁÈ”ù¯?êxÁÐ0‰?êx`J’(?êxgåò˜?êwzñ 7?êwzø¤h—?êv×zÒ¢x?êvׂm¤÷?êv3ý§ô/?êv4BDZ?êuy‹M"?êu%ñ¦?êtìî~ì?êtìövp?êtI\=ÑÝ?êtIcØ_?ês¥ÂÁ´)?ês¥Ê[˧?ês"I4?ês)ã«?êr^zÕ§`?êr^‚o`Ð?êqºÌhí-?êqºÔw’?êq¢Ô?êqþ-?êpsZ©ã?êpsbCQ?êoÏ—Z{å?êoÏžóy?êo+Í;ª?êo+Ô± Ò?ên‡ûäW?ênˆ|ö)?êmä#Àƒ?êmä+Xó?êm@D®Ž?êm@LFÎþ?êlœ^¯`Ä?êlœfGr?êkøqÅ0.?êkøy]Ý?êkT}ñdþ?êkT…‰Ž?êj°ƒ5Nx?êj°ŠÌÒé?êj Oío?êj ˆçB½?êihx7´Ê?êihÎÚó?êhÄh+—®?êhÄoÂŽ²?êh Q-‘ø?êh XÄYÓ?êg|3?v?êg|:ÕŸ'?êfØa ”?êfØ÷u?êf3â•ÐŒ?êf3ê, â?êe¯Þ…˜?êe·t¾?êdëv<Á?êdë}Ò?êdG5² ?êdG=G¬ß?êc¢î?òÏ?êc¢õÕpX?êbþŸçã~?êbþ§}1Ï?êbZJ«èo?êbZRA†?êaµîS?êaµö" .?êa‹ [?êa“!Íø?ê`m!­Žµ?ê`m)B ?ê_È°®7?ê_ȸBpQ?ê_$8„±…?ê_$@ä[?ê^¹pœ¸?ê^Á H?ê]Û3rûA?ê]Û;ψ?ê]6¦^u?ê]6®!r?ê\’Áq?ê\’TæÐ?ê[íx’?ê[í£Øc?ê[HÖ|9`?ê[HÞPr?êZ¤.E3?êZ¤5™,ó?êYÿ~° ?êYÿ†BÍ ?êYZÈ{ê?êYZÐ ?êX¶ hǦ?êX¶û!d?êXG{v?êXO ,Û?êWl|²äZ?êWl„Dßc?êVÇ«Kí?êVDz¤—?êV"Òšå*?êV"Ú,t?êU}ó *Í?êU}ú—¶?êTÙ ]‹'?êTÙîÈ«?êT4ÌÞØ?êT4&]ì÷?êS*[–?êS1ëùM?êRê/ 0h?êRê6šßµ?êRE,Û­ ?êRE4l-?êQ #ПH?êQ +`ï»?êPûën?êPû{3q?êPUý,z‚?êPV¼l?êO°ß•Í8?êO°ç%U?êO »)b8?êO ¸ôà?êNfè/~?êNf—w’®?êMÁ]ÓõM?êMÁec)?êM$îAv?êM,}E±?êLvå8ˆ±?êLvìÇ]n?êKÑž´Y?êKѦBþT?êK,Q"±ú?êK,X±'¶?êJ†üzhp?êJ‡®©?êIá øW­?êIᨆn_?êI<>žSw?êIâxú¾#?ê> «Ë?ê><¢va”?ê><ª“?ê=–Å%ÖÙ?ê=–Ì°e-?ê<ðá ˆÏ?ê<ðè”çv?êú?ê7–G3?êr ¤?êðä›?êè{rû-?êè‚ñŽý?ê@çËÅ€?ê@ïJ)(?ê™M~#d?ê™TüVá?êñ¬‹  ?êñ´ £\?êJõ|Ä?êJ sOå?ê¢V½v>?ê¢^;/?êú¡äÿJ?êú©br ?êRæm¨?êRíêR2?ê«$Wßv?ê«+ÔñÊ?ê[¦—ç?êc#z?ê [ŒZ{?ê [“×,â?ê ³¶8š?ê ³½µD@?ê Ù9L-?ê ൕ?ê cõ”ž”?ê cý¿¼?ê ¼ LÓ«?ê ¼ÈÄ‘?ê cl?ê !ÞÐ?ê l"ا&?ê l*T7„?êÄ$¯Ù?êÄ,*hï?êèâ?ê'c4®?êt„Žš?êtÿŽ?ê̆vŽ?êÌ EÂ?ê#éïŒ?ê#ñi±q?ê{Ê¿é˜?ê{Ò:X,?êÓ¤úQÂ?êÓ¬t?ê+xŸÒ=?ê+€à)?êƒE±ÙÒ?êƒM+·g?êÛ 1×b?êÛ«„Ÿ?ê2Ëåýz?ê2Ó_z]?ꊄÅcˆ?ꊌ>°?êâ7Å?êâ>áÅ?ê9â±¥”?ê9ê*‘\?éÿ‘‡Á#x?éÿ‘9ÞÞ?éþé&9 Ç?éþé-±•È?éþ@¾Å.?éþ@Å“Ê?éý˜OgB?éý˜VßlO?éüïÚ ¯*?éüïᘨô?éüG^Hq?éüGe¿ÝÐ?éûžÛÞÖ?éûžãV\‡?éúöR戌?éúöZ]ñ?éúMÃ`µ?éúMÊ×í,?éù¥-N³ž?éù¥4Å»;?éøü±î‹?éøü˜(ų?éøS패?éøSõÀZ?é÷«C£QÇ?é÷«KÇÿ?é÷’ï¡]?é÷šeç?éöYÛ¨£f?éöY㸧?éõ±ÏÕm?éõ±%Eº0?éõYfÍm?éõ`ܯ?éô_ŽnØS?éô_•ä\?éó¶¼é*Ç?éó¶Ä^~?éó äפ&?éó ìLÆÛ?éòe;yH?éòe °ku?éñ¼!(7?éñ¼(ŠéÛ?éñ5i¸?éñ<ݧÐ?éðjC5Ã?éðjJª#Œ?éïÁJ}J ?éïÁQñz?éïKA‹Ž?éïRµŠø?éîoEƒÕZ?éîoL÷¤0?éíÆ9Eu]?éíÆ@¹ž?éí&Mß°?éí-ÁMZ?éìt ”»~?éìtø?éëÊìQG_?éëÊóÄSÖ?éë!Å„ü€?éë!Ì÷ØZ?éêx˜1#Œ?éêxŸ£ÎÈ?ééÏdWT?ééÏkÉî?éé&)ø|b?éé&1jÆ[?éè|é¡"?éè|ðˆºw?éçÓ¡²Ôî?éçÓ©$½œ?éç*SÎÁþ?éç*[@z?éæ€ÿkúP?éæÝ­?éåפ‹N?éå׫ü¤µ?éå.C.˜ ?éå.JŸ¾?éä„ÛWj¢?éä„âÈ_ö?éãÛmÆÀ?éãÛtw‹c?éã1ø>‡w?éã1ÿ¯f?éâˆ|ÆR?é∄6µË?éáÞú–J?éáßHÍ?éá5qäTÞ?éá5yTV¨?éà‹â²ƒ.?éà‹ê"T=?éßâMþ?éßâTqžS?éß8°ÔR?éß8¸CÂ%?éÞ+"?éÞšLö?éÝåeà?éÝålv"ó?éÝ;µj<Ä?éÝ;¼Ù?éÜ‘ÿUÊÙ?éÜ’Äwa?éÛèBËl?éÛèJ9˜-?éÛ>Ë×M?éÛ>‡:"D?éÚ”¶Y@Î?éÚ”½ÇZù?éÙêætž]?éÙêí⇻?éÙA–?éÙAN“?éØ—3[µµ?éØ—:É=s?é×íOñ5 ?é×íW^‹õ?é×CeØHÐ?é×CmEnæ?éÖ™uF 0?éÖ™|³•o?éÕï~=Ãß?éÕï…ªˆF?éÕE€¿<§?éÕEˆ+Ð4?éÔ›|Ìc0?éÔ›„8Åá?éÓñrfx$?éÓñyÒ©÷?éÓGaŽÔe?éÓGhúÕW?éÒJGaH?éÒQ³1Y?éÑó,ÿx?éÑó3üž¥?éÑImP>?éÑIؾ…?éОÝÝÜà?éОåI@?éÏô¬ãžq?éÏô´Nªç?éÏJu€f†?éÏJ|ëB?éΠ7µ¦?éΠ? Q+?éÍõó„oô?éÍõúîé¤?éÍK¨¶3>?éÍK° {þ?éÌ¡WC#*?éÌ¡^­:÷?éËöÿ`Me?éË÷Ê4=?éËL¡6P?éËL¨xì2?éÊ¢#?éÆ£`¥?éÅøÇ«úÓ?éÅøÏ(Á?éÅN/¹0Ò?éÅN7!-¹?éÄ£‘f5E?éÄ£˜Î$?éÃøì´-?éÃøôÈa?éÃNA¤Î¿?éÃNI 8‡?é£?飗i8¾?éÁø×Ãz“?éÁøß*‚(`?é»÷E]&?é»LF$‚Þ?é»LM‰Ÿ‚?麡GÈ9˜?麡O-%?é¹öCTß?é¹öJy9?é¹K8 =­?é¹K?nÆÞ?鸠&«¤…?鸠.üŒ?é·õÂÎÎ?é·õ&õª?é·IðHJ¬?é·I÷¬@[?鶞ËoæÌ?鶞ÒÓ«L?éµó :ïW?éµó§ž‚¦?éµHn«Â?éµHvqÝ?é´6Á|ˆ?é´>$­o?é³ñø™Ô?é³ñÿ♄?é³F³æËä?é³F»Iš\?é²›hø_B?é²›pZü?é±ðµ¸M?é±ð$N?é±DÀ k?é±DÇ‚¥Ë?é°™b9”¦?é°™i›ž*?é¯íþ±‰?é¯îd‰Ë?é¯B“}>?é¯BšÞå?é®—"ªŸ?é®—* ¾?é­ë«‹ñî?é­ë²í6a?é­@-ìÆÑ?é­@5MÙû?鬔©Å2ê?鬔±&É?é«éHÝð?é«é&©Ž‚?é«=Žyó?é«=•Ù7?骑÷W?骑þ·_?é©æYäõ?é©æaD.—?é©:¶"·?é©:½ì?é¨ Þ¥?é¨q˜ž?é§ã[µ â?é§ãc”„?é§7¥ Ðø?é§7¬l(@?馋èìâ?馋ïzÏ?é¥à$à1ò?é¥à,?&ƒ?é¥4[^Ž?é¥4b½Q¿?餈‹—3Õ?餈’õŦ?é£Üµ‹#¿?é£Ü¼é„/?é£0Ù<5%?é£0àšd0?预övSu?预ýÔQ?é¡Ù 1z‰?é¡ÙFÇ?é¡- Ìù?é¡-$þgÎ?é 'Ŧm?é /#Ö?éŸÕ+¡3c?éŸÕ2þk^?éŸ))4ϱ?éŸ)0‘Ö=?éž} ‚?éž}'Þó!?éÑŠ3?éÑæ×(?é$üN›Q?é%« †?éœxàЙõ?éœxè,Ú´?é›Ì¿‹ˆ?é›ÌÆmšÏ?é› —ãØ?é› žnÁ¥?éšthÖ¬?éštp1Âþ?é™È4\9¦?é™È;·´z?é™ù¦À¾?é™ ?é˜o¸·ø?é˜oÀ7Ì?é—ÃqY̽?é—Ãx´³?é—#‡f ?é—*âí?é–jÏr¾?é–jÖ̘?镾u?镾|uRÜ?镃àü?é•Þ0?é”e­­ô‚?é”eµã*?铹@š5i?铹Góò„?é“ ÍJq?é“ Ô£ü›?é’`S¿çÖ?é’`[AÐ?鑳Óû°?鑳ÛTë?é‘Mÿ·˜?é‘UX®j?éZÁÌï¡?éZÉ%´Ý?é®/d“ü?é®6½'Ÿ?é–ÈZÂ?éž ¼Ë?éŽT÷ù„´?éŽTÿQµ!?é¨Rù S?é¨ZQ #?éŒû§”«s?éŒû®ìx¢?éŒNõÄÐ?éŒNýk?é‹¢=ºª½?é‹¢E¨?éŠõxd?éŠõ†Ï<ª?éŠHºþGé?éŠHÂUNˆ?鉛ðNk9?鉛÷¥@0?éˆïjK?éˆï&À«˜?éˆBHRrÚ?éˆBO¨ä{?釕kþ³?釕r_>¥?é†è‡Žÿ²?é†èŽå õ?é†;åá(?é†;¥;½¹?é…Ž®°æ?é…Žµd[Å?é„Ḡ$?é„á¿`‚M?é„4»Ül¹?é„4Ã1´+?郇¹ƒé®?郇ÀØÿh?é‚Ú±ø?é‚Ú¸Wæø?é‚-¢'³$?é‚-©|eg?逌ê .?途> ´?é€Óq{?é€ÓxÏëÝ?é€&Oݬ?é€&W1­°?éy(Å?éy/e?é~ËúëH?é~Ìk¤Ä?é~Åó ,?é~ÍF§á?é}q‹£òÒ?é}q’÷H¿?é|ÄK+á›?é|ÄR½?é|ŒS¢?é| ßEø?é{i·Æj&?é{i¿*®?éz¼dÛŒc?éz¼l.?éz Í8ê?éz•Ñ?éya¬œ‘*?éya³î¼>?éx´GJüˆ?éx´NœõÇ?éxÛÚû?éxã+Ød?éwYj¬6?éwYqiAÆ?év«ñý!?év«ùN„·?éuþsºµú?éuþ{ çÓ?éuPïQˆ?éuPö¢ˆ?ét£dÃV?ét£lßr?ésõÔâý?ésõÛa7?ésH=<î?ésHDŒmE?érš EëL?érš§–#¾?éqìý/¹V?éqí¿á?éq?Súþ‚?éq?[JÓ%?ép‘¤¨ïk?ép‘«ø’$?éoãï:×ó?éoãöŠHÀ?éo63²?éo6;Bï?énˆrR?énˆy_B?émÚªV'Ä?émÚ±¥Â?ém,Ü…qî?ém,ãÔú?élm/?él»¦&?ékÑ.;J?ékÑ5T€j?ék#M€/‰?ék#TÎB°?éjufܯê?éjun*‘?éiÇzì?éiÇj³?éi‡B-¬?éiŽªà?éhkŽMÑ`?éhk•›”?ég½Adó?ég½–Ž~&?égŠ¼r?ég‘j££?éfa~ä|)?éfa†11U?ée³m–ÔÎ?ée³tãWó?éeV6%]?ée]‚vz?édW8Ããþ?édW@?éc©AAŽ?éc©.–?ébúë¯@Ë?ébúòúûÅ?ébL¼´e?ébLÃ[=P?éaž†2SÕ?éaž}ª°?é`ðJ…†?é`ðQZªN?é`BÖ×ç?é`B!Êš?é_“¿‰êº?é_“ÆÔ«W?é^åq)w#?é^åxt¨?é^7·4?é^7${?é]ˆÂ4e?é]ˆÉ~m?é\Úa¢â?é\Úhì?é\+ûf?é\,KÊy?é[}ŽU?L?é[}•žÓ??éZÏœæh?éZÏ"æH8?éZ ¢ÚÇÈ?éZ ª#÷t?éYr$ËF?éYr+XÈÌ?éXß=Kë?éXæ†J?éXdÒÉ?éX­kþ?éWfƒ‡Œõ?éWfŠÏóÿ?éV·ìu´¢?éV·ó½é?éV O(fq?éV Vpi ?éUZ«Î@2?éUZ³±?éT¬hu?éT¬ °Â?éSýRø®É?éSýZ@â?éSNÙã?éSN¤ÇÇ?éRŸáÿph?éRŸéFx?éQñ xÉ?éQñ'¿ž‡?éQBXíQ‘?éQB`3ôÊ?éP“‹]íò?éP“’¤^î?éOä·Ì9æ?éOä¿x¤?éO5Þ9ŒN?éO5å˜Ì?éN†þ¦÷J?éN‡ìц?éMØš?éMØ [¾“?éM)-ˆb?éM)4͉?éLz;ýÿù?éLzCCCe?éKËDI ª?éKËKŽÍ?éKFbM©?éKM§,ƒ?éJmBw?éJmI¼;Ž?éI¾8ŠªŸ?éI¾?Ï$ß?éI(œÅJ?éI/á :?éH`®¿7?éE£m~?éE£†U¹Æ?éDôK8¯Y?éDôR{ÉG?éDEf“ƒ?éDE©{?éC•Ñõø?éC•Øà«-?éBæ‹ßûò?éBæ“"~É?éB7@-†J?éB7GoÖ¿?éA‡îˆCZ?éA‡õÊam?é@Ø–ÁœÃ?é@Øžˆr?é@)8ÒªK?é@)@c”?é?yÔéW?é?yÜ*Ýï?é>Êk˜?é>ÊrGÔ?é>û+[Á?é>l}Î?é=k…Y¬.?é=kŒš›Î?é<¼ ’{0?é<¼Ó8b?é< ‡×¶?é< ‹w?é;](¹?é;]ig?é:­rˆÅ“?é:­yÈën?é9ýÞøG‚?é9ýæ8:è?é9NExÒ ?é9NL¸’ü?é8ž¦ ^?é8ž­K+Ô?é7ï±Êí?é7ïñ&é?é7?UlÀ|?é7?\«éû?é6¤=úŠ?é6«|ñŒ?é5ßì÷4Œ?é5ßô5ù?é50/‘ÞÚ?é506ÐpÚ?é4€l;<ž?é4€syœ?é3Тóùv?é3Ъ2&o?é3 Ó½ºö?é3 Úûµh?é2pþ™â‚?é2qתl?é1Á#‰vÁ?é1Á*Ç !?é1BŽB?é1IË€?é0a[¨ÜÂ?é0abæ ?é/±nÚÒÂ?é/±vÐy?é/|%¤Û?é/ƒbp?é.QƒŠpŸ?é.QŠÇ 3?é-¡… &\?é-¡ŒFŒ\?é,ñ€¦™?é,ñ‡âÌ€?é,Av`¹(?é,A}œ¹û?é+‘f9èR?é+‘mu¶Œ?é*áPºê?é*áW@V‰?é*13ºËà?é*1:ö4â?é)ˆ]S?é)Ó·?é(ÐénÌž?é(Ðð©Ðb?é( »o`…?é( ª1§?é'p‡‹ö?é'pŽÅºu?é&ÀMà@?é&ÀTþ ?é& ?é&TVÓ?é%_È€’?é%_Ïɇ?é$¯}%jr?é$¯„_>Q?é#ÿ+Ý"/?é#ÿ3Ãb?é#NÔ·« ?é#NÛñ?é"žw¶¦\?é"ž~ïâ3?é!îÛx?é!î ž?é!=¬&Ez?é!=³_í?é =™Ž?é DÒ1Õ?éÜÉ/£?éÜÐ@ ¬?é,Nk~¥?é,U£¼ö?é{ÍïrŠ?é{Õ'~"?éËG•dµ?éËNÍ=‘?é»^z?é–'š?éj)L"L?éj0ƒ•­?鹑_s?鹘–´0?é󙡾?éúЯ?éXOüÞ?éXW2÷ù?駦ˆ'ö?駭¾ÐL?éö÷>Ù?éöþuN¤?éFB!¶Ò?éFIWù˜?镇1×L?é•ŽgçH?éäÆpg4?éäͦDd?é3ÿÞÀ7?é4j™?éƒ3~hû?éƒ:³àŽ?éÒa"«'?éÒhWïé?é!ˆÅv?é!úˆ?épª’¼?ép±Æå×?é¿Æ‰² ?é¿Í¾^å?éÜ­‹Ô?éãâA?é]ìÿ+0?é]ô3qÃ?é¬÷uý?é¬þ³‰¶?éûü/Ø8?éüc¹?éJû§l?éKEUi?é™ô%ß~?é™ûYZœ?é èçmìz?é èî¡4¶?é 7Ôë –?é 7Ü"î?é †¼ž˜{?é †ÃÑzî?é Õž‰¶?é Õ¥¼e?é $z­ÒL?é $àNð?é sQ Ó?é sX>Ì?é Â!xsX?é Â(ªŠ&?é ëí/p?é óP?é_°”¡â?é_·ÆRÓ?é®opu¶?é®v¡ó¶?éý(¢ü?éý/²î ?éKÛÉ{E?éKâú“^?隉IP)?éšz5L?éé1FŽ?éé82øº?é7Òõ™À?é7Ú&ó?é†o$›g?é†vTçŸ?éÕ.?éÕ À¶j?é#–:—x?é#j}µ?ér!$¦?ér(S»ã?éÀ¦N,?éÀ­}¬[?é%º¾?é,é]ø?èÿ]ŸiK2?èÿ]¦˜eg?èþ¬0¶H?èþ¬_v?èýú Ÿ)?èýúˆ8SO?èýHéÇÏ?èýHðMHë?èü—Kq:þ?èü—RŸ‰?èûå¨0?èûå¯0K?èû3þÓ!F?èû4 :?èú‚Oå.?èú‚W¸?èùЛ9#‰?èùТf¥[?èùàÐÐ ?èùçþÈ?èøm ­Vv?èøm'Úr?è÷»ZÏÁÎ?è÷»aüª`?è÷ 9_á?è÷ –fZ?èöW½ë~}?èöWÅÜ?èõ¥æç??èõ¥îŽE?èôô .?èôôZ!¦?èôB'Á ¡?èôB.ìò§?èó?už³?èóF¡T™?èòÞQEÁC?èòÞXqD?èò,][#`?èò,d†rÿ?èñzc¶âj?èñzjáþâ?èðÈdZt?èðÈk…]â?èð_G f?èðfqÃŽ?èïdT}ž?èïd[¨!?èî²CÿÈú?èî²K*Ë?èî-Ε–?èî4ø²9?èíNë!b?èíN Õ?èì›ðVÌo?èì›÷€‚±?èëéÉÊ~?èëéБp?èé úgG£?èèn¯s£?èèn¶œš?èç¼eÍ–Ì?èç¼lõæ†?èç v,?èç ž2¨?èæWÁnYÌ?èæWÈ–C?èå¥f·{\?èå¥mß1V?èäóR”¢?èäó zY?èä@ A®?èä@§hQ ?èãŽ4„‚?èãŽ;«$­?èâÛÃÂî?èâÛÊC«Ð?èâ)L v÷?èâ)S3,?èávÏTj©?èávÖzì÷?èàÄLõ¡Ù?èàÄTðÙ?èàÄñ¤Ð?èàÌÀ?èß_7I£Ž?èß_>o‹ï?èÞ¬£þuã?èÞ¬«$*ñ?èÝú ¤ ?èÝú7%Û?èÝGlYó‚?èÝGsAè?èÜ”ÇÐìS?èÜ”Îöb?èÛ⟞G?èÛâ$Ä…ý?èÛ/mÇa}?èÛ/tìÙ?èÚ|¸I ë?èÚ|¿mŠë?èÙÉý%Ù½?èÙÊJ'_?èÙ<_?$?èÙCƒYh?èØduö:?èØd}õ?è×±©ëá>?è×±±”¾?èÖþØAä[?èÖþßedw?èÖLù-Ì?èÖLzƒ?èÕ™$Ã?èÕ™+6/?èÔæAÈ‚?èÔæH³®i?èÔ3YsFZ?èÔ3`•øÖ?èÓ€k»ý‡?èÓ€rÞ|˜?èÒÍxlFK?èÒÍŽ‘î?èÒ[+?èÒ†}_?èÑg€‚Sº?èÑg‡¤8|?èд| ”Y?èдƒ,E©?èÐqôÁ€?èÐy?\?èÏNbBEk?èÏNicÑ?èΛLô2Š?èΛTIy?èÍè2 ›c?èÍè9,~Ø?èÍ5‰ê6?èÍ5ªš1?èÌëpGs?èÌòÃò?èËο¿ñ?èËÎÆà:‚?èËŽzà?èË•š&b?èÊhWŸãü?èÊh^¿Åü?èɵ2}s?èɵ"R+ñ?èÉÙ31¦?èÉàR¬ ?èÈN‘£Tì?èÈN˜Âœ`?èÇ›DƒÎ/?èÇ›K¢â?èÆçñ¬ww?èÆçøËWÚ?èÆ4™™?èÆ4 6Eá?èÅ:ìœ?èÅB Q?èÄÍ×,Ðå?èÄÍÞK£?èÄmÙˆ?èÄt÷šE?èÃfþóº˜?èÃg™5?賊|ξ?賑šyÉ?èÂuÿ?è“v’?èÁLàDÈ?èÁL—ýˆ¨?èÀ™ ½?èÀ™Ú]?è¿å } ?è¿åˆ*ZP?è¿1ðÒŽÁ?è¿1÷ï7Ö?è¾~[ µ ?è¾~b*+?è½Ê¿ÀB?è½ÊÆÜC?è½êÂ(?è½&Ðd?è¼cx1?è¼cª÷Ë?軯̅tä?軯ӡÛ?èºüÇ¡I?èºü!ãœ?èºHc}É?èºHj˜_v?è¹”¦§f?è¹”­Âl?è¸àäF—/?è¸àëao‹?è¸-]Š?è¸-#w¸ §þ?è¹Ed?è¼a(?èÃk_C?è~N5\á?è~N?èf%âkî?èf%én¯±?èeo¡? j?èeo¨AæÍ?èd¹ZÐÒé?èd¹aÓ{ê?èd"’?èd$w/?ècL¾3µÆ?ècLÅ5õý?èb–h?èb–o *á?èaà pò?èaàŸHZ?èa)«ÒêÇ?èa)²ÔÆ?è`sE¢?è`sL£ûœ?è_¼Ú/~?è_¼á0¸6?è_izìÞ?è_p{ò–?è^Oó…Þ'?è^Oú†¯o?è]™xQ€æ?è]™R½?è\â÷ß7?è\âþß›?è\,r/Àè?è\,y/ô×?è[uçD=L?è[uîD<Æ?èZ¿WÞ?èZ¿^Üà?èZÁ¾m€?èZȾ ?èYR'&–?èYR.%w¥?èX›‡Vx`?èX›ŽU¥ó?èWäâPš’?èWäéO“§?èW.8«?èW.?o¨?èVwˆ¦Ã®?èVw¥SÄ?èUÀÓàöá?èUÀÚßRu?èU ¾í?èU ½*?èTSZc©?èTSaaƒ5?èSœ•Ïâ×?èSœœÍ Ý?èRåÌ?èRåÓ˜?èR.ý@–?èR/•Š?èQx(΢î?èQx/ËÃW?èPÁOe .?èPÁVaù ?èP pÉø?èP wÅËG?èOSŒûŽo?èOS“ø.?èNœ£ý}Ö?èNœªùÌ?èMåµÐv´?èMå¼ÌP?èM.Âu;'?èM.Éq /?èLwÉìá|?èLwÐè‘î?èKÀÌ8ª ?èKÀÓ4%å?èK ÉYÕ?èK ÐU^?èJRÁ-‰¢?èJRÈ(œK?èI›³®ÿË?èI›º©ÝØ?èHä¡hF?èHä§û·?èH-‰"Àä?èH-5¶?èGvl[~?èGvs›±?èF¿IßJâ?èF¿PÙVr?èF"{bô?èF)u9â?èEPõí4i?èEPüæÖ³?èD™Ä5½?èD™Ë/*²?èCâUÐÊ?èCâ”O Æ?èC+QNÖJ?èC+XGÚž?èBt!àX?èBt°?èA¼ÉÏìÈ?èA¼ÐȇÅ?èA~Zb.?èA…RÈ~?è@N-Â>X?è@N4ºoù?è?–Øj*?è?–ßg?è>ß} ò?è>ß„ºF?è>(Å E?è>(#¼Ò?è=p·XUN?è=p¾O´&?è<¹LÆ ^?è<¹S½6?è<ÝSº?è<äI$?è;Jh4ü?è;Jo+¼°?è:’î8h8?è:’õ.ô.?è9ÛoÑ|?è9Ûv(¶?è9#êÜó?è9#ñÓ ?è8la€FJ?è*yï æ?è)Y~],?è)Y…Nªê?è(¡„­¿?è(¡‹Ÿ#n?è'é…Î]:?è'錿Œ8?è'1¹î\?è'1ˆªèw?è&yx‘xó?è&y‚>+?è%ÁjUðº?è%ÁqF ?è% Wœ†?è% ]ø÷ò?è$Q>ªp ?è$QEš–Ž?è#™!?è…r¹–_?è…y¦¢š?èÍ yÃ?èÍfš@?è›3¬v?è¢ N±?è\'èlp?è\.ÔÙ©?裯˜Ê?裶…5?èë2F1ˆ?èë924¸?è2¯ñ“h?è2¶Ýa‘?èz(›ËZ?èz/‡d{?èÁœFnù?èÁ£1Ó?è òYð?è ݈ý?èPt gõ?èP{‹aö?è—ÙRà?è—à<ÞÓ?èß8çk?èß?Ñ N?è&“Z®É?è&šE œ?èmè̼M?èmï¶â ?èµ9>¶u?èµ@(§"?è ü„±7å?è ü‹šó}?è CË%Ò¢?è CÒY#?è ‹ J?è ‹†›÷?è ÒIÊ?è ÒPæà?è €™hñ?è ‡‚P&?è `³ ;÷?è `ºî?è §à®YÞ?è §ç–ÖÚ?èï DØâ?èï- ¿?è6,交?è63ÌÍ`?è}K)î?è}Rw‰?èÄeEQz?èÄl,ùñ?è z2Þ?è €ï¦0?èR‰·æk?èRŸ$—?è™”P³?è™›7&·?èà™ð}À?èà ×Qœ?è'š™²Æ?è'¡€Qv?èn–M!ä?èn3‹i?èµ Éy?赓ñýÐ?èü~Ö§à?èü…¼§?èCk®Ïû?èCr”™ó?çÿŠS•}¶?çÿŠZ{}?çþÑ6‹¯Y?çþÑ=qí?çþ’c8?çþw—?çý^íªþ%?çý^ôóO?çü¥ÁÖ,\?çü¥ÈºìN?çûì‘>(?çûì—ùÈâ?çû3[i1¿?çû3bM‡??çúz Óà?çúz'·:$?çùÀá3×??çùÀèÂF?çùœ†ÙÅ?çù£jŽ?çøNRë^?çøNYΕç?ç÷•aÂŽ?ç÷• E Õ?çöÛ°ìR?çöÛ·ÏW?çö"XŠÄ=?çö"_m¤þ?çõhû?#H?çõi!ÎÃ?çô¯™ 1ä?çô¯Ÿì¨?çóö1ìÿŠ?çóö8Ï@u?çó<Åè°?çó<ÌÊ»¸?çòƒTþRô?çòƒ[à)J?çñÉß.Τ?çñÉæo®?çñd{oÒ?çñk\Û?çðVäåþ?çðVëÆSk?çï`lùã?çïgMúÿ?çîã×*C?çîãÝôö ?çî*H»ïl?çî*Oœ…â?çípµ_µ\?çíp¼@}?çì·:Ä?çì·#þf?çëýø‹Ì?çëý†Ø‚??çëCÝï :?çëCäÏaS?çêŠ7˜™?çêŠ=ä$X?çéЋ8©Ä?çéÐ’&?çéÚŒ¢°?çéákõ?çè]%Ì?çè]+à¸7?çç£j™3n?çç£qwé´?çæé«S¦4?çæé²2'?çæ/ç2‚Y?çæ/îÍÚ?çåv6¿|?çåv%Õ™?çä¼Pa@Ü?çä¼W?!”?çä}³Ox?çä„úÈ?çãH¦. –?çãH­ }?çâŽÉ²Å?çâŽÐ~?çáÔè=†Œ?çáÔï‘?çáìtl?çáÉJ?çàaÀnÉ?çàaÿ?çߧ&º§?çߧ-—ã?çÞí1Ü:u?çÞí8¸oË?çÞ38%ôª?çÞ3?ô?çÝy9™f?çÝy@tåÖ?çÜ¿66·\?çÜ¿=LV?çÜ-ÿåŠ?çÜ4ÛE?çÛK õ®”?çÛK'ÐØ ?çÚ‘Ö?çÚ‘óûh?çÙÖøjöì?çÙÖÿE¶?çÙÜì›»?çÙãÇ%V?çØb¼Ÿ:ª?çØbÃyŽÇ?çר—ƒ‹)?çרž]©È?çÖîm{òÇ?çÖîtUÛæ?çÖ4>„&Â?çÖ4E]Ú^?çÕz ¹ÆZ?çÕz“Ds?çÔ¿ÒëW?çÔ¿Ø÷3ë?çÔ”±¯k?çÔ›ŠÂz?çÓKRuï?çÓKYNÍ?çÒ‘ lg?çÒ‘D¾e?çÑÖ¿”Ø_?çÑÖÆmJÔ?çÑnñwŒ?çÑuÉ´u?çÐb‚å ?çÐb Zìe?çϧ¿J:h?çϧÆ" 6?çÎí`Hh¼?çÎíg ú?çÎ2ü~½?çÎ3Vk?çÍx“î?çÍxšÅ8/?ç̾&—m[?ç̾-nhã?çÌ´|a?çÌ»RØT?çËI=~h©?çËIDTù?çÊŽÁš5‚?çÊŽÈpF?çÉÔ@ìùI?çÉÔGÃt?çÉ»wÊ\?çÉÂM¹ì?çÈ_1;‚ƒ?çÈ_8J rÏ?ç»>Qrfá?纃eø¹?纃lÉÂ?ç¹È|– |?ç¹Èƒg“!?ç¹ Ž{™î?ç¹ •LìÚ?ç¸R›©Øñ?ç¸R¢zö#?ç·—¤!²?ç·—ªò™•?ç¶Ü§ä$ ?ç¶Ü®´ÕÚ?ç¶!¦òiÎ?ç¶!­ÂåÊ?çµf¡MY¤?çµf¨Ÿà?ç´«–öU?ç´«Æ*Ñ?ç³ð‡Ð(I?ç³ðŽ ?ç³5s×|”?ç³5z§!Š?ç²z[(j4?ç²za÷Ùe?籿=Ä(è?籿D“bS?籫 F?ç±"z£é?ç°HôßËá?ç°Hû®™»?ç¯ÉaÏY?ç¯Ð0gi?ç®Ò™2ÎB?ç®Ò 0†?ç®dSt?ç®k! z?ç­\*Å42?ç­\1“*Ú?笠ìˆâ?ç¦ ðXŒ?ç¥O|g}?ç¥Oƒ3#ˆ?礔 ™ î?礔dz?ç£Ø”!Ý ?ç£ØšíÀ?ç£ÚÂ?ç£Íß“?ç¢a™=7,?ç¢a ?硦Ñê‚?硦œƒ?ç ê‹Á± ?ç ê’ŒF?ç .þ úÙ?ç /Ø(?çŸsk·¿É?çŸsr·!?çž·Ô¿¼F?çž·Û‰}´?çü9'8?çü?ðÛ?ç@˜ï?3?ç@Ÿ¸”Ë?眄óü€?眄úÅ#*?ç›ÉJI±"?ç›ÉQšÝ?ç› ›óÖ?çnïôΧ_?çn3)-p?çn3/èáP?çmv_³‰?çmvfo"³?çl¹‘¢I™?çl¹˜]¬ö?çkü¿&?çküÅÎS—?çk?è~?çk?îÂtÚ?çjƒ €t?çjƒ:Ò?çiÆ,}É6?çiÆ38S{?çi HÜ3?çi N¼0/?çhL_ Fk?çhLeÇd?çgq Èý?çgxZ°c?çfÒ½‡?çfÒ†w8)?çf‰d·N?çf2?çeXŽ–ó–?çeX•P8?çd›U†?çd›–”@?çcÞ‹¡Vý?çcÞ’Z.Õ?çc!ƒ{u•?çc!Š4?çbdvä¶l?çbd}!œ?ça§eó?ça§l{çí?ç`êP¨j?ç`êV̦í?ç`-5ñwñ?ç`-<©@?ç_p[š?ç_p¬k?ç^²ôRN­?ç^²û ª"?ç]õÌØ  ?ç]õÓEº?ç]8 íÃò?ç]8§¤²®?ç\{p” Z?ç\{wJ·?ç[¾;Ì-?ç[¾B‚‚*?ç[–±®?ç[ LýI?çZCÄôð€?çZCË«¹?çY†‚çÜ\?çY†‰»1?çXÉ?çP¦Ïô>?çP¦ƒEÿ?çOè•CäÆ?çOè›÷?çO+Sª\?çO+3?çNm‘›Þ?çNm—³J>?çM°K®Á?çM°þ&©?çLò{5ž$?çLòçß’?çL4é¿­??çL4ðq¸3?çKwSê½ü?çKwZœ’t?çJ¹¹·žÙ?çJ¹Ài<Ô?çIü à?çIü!¿Gš?çI>wêS?çI>~›4O?çH€ÐdÏ(?çH€×É£?çGÃ$6L?çGÃ+/úD?çGt:e¦?çGzêó?çFG¿—?çFGÆGY?çEŠ–8‹?çEŠ FXõ?çDÌI8ûm?çDÌOèåO?çD‡€)Ö?çDŽ/Ý/?çCPÁlɤ?çCPÈFt?çB’÷Î?çB’ý¯a?çAÕ(:Â?çAÕ.éÑÐ?çAUØ ?çA[̱Ê?ç@Y}ªd ?ç@Y„Y¦?ç?›¡á/Ó?ç?›¨›ß?ç>ÝÁÃhN?ç>ÝÈqÈ?ç>Ý8¶°?ç>ã浘?ç=aô=¾p?ç=aúë†Ã?ç<¤êÍú?ç<¤ ˜_¸?ç;æAî?ç;æîj?ç;(AJ#?ç;(%în³?ç:j$ì‚o?ç:j+™pf?ç9¬&CáJ?ç9¬,ð˜§?ç8î#HBÀ?ç8î)ôÃ?ç80ú‚Ü?ç80"¦Í?ç7r[·—?ç7rË?ç6´l©“?ç6´†{?ç5õì.‚ ?ç5õòÚ(P?ç57Ó¢VË?ç57ÚMÆq?ç4y¶ÈÝ?ç4y½t?ç3»•£=Þ?ç3»œN@=?ç2ýp2Tû?ç2ývÝ ´?ç2?F^Wà?ç2?Mìó?ç1#å?ç1ÎC‚?ç0Âåšún?ç0ÂìE"0?ç0®Ä—®?ç0µnˆÆ?ç/Fs¡ÏÚ?ç/FzKŠF?ç.ˆ43P?ç.ˆ:Ý?ç-Éðz›à?ç-É÷#èñ?ç- ¨x­?ç- ¯!2?ç,M\-@?ç,MbÕíò?ç+ š_Î?ç+CÎ?ç*жÀüˆ?ç*нinÔ?ç*]¡ãÑ?ç*dJj?ç)T>Ã?ç)Tæ§?ç(•ž–hì?ç(•¥>7?ç'×8«ò?ç'×?S‰‚?ç'Îœc?ç'Õ&ý?ç&Z_ú?ç&Zf¡,?ç%›íÐ(?ç%›ó¾Ãm?ç$Ýuð¡?ç$Ý|—]?ç$ú…q…?ç$+÷P?ç#`z×QH?ç#`} T?ç"¡öçv?ç"¡ý.Á?ç!ãnµ½‘?ç!ãu[Ÿ?ç!$âDiq?ç!$èê8?ç fQ“¶t?ç fX9*w?秼¤íÆ?ç§ÃJ+?çé#xø|?çé*þò?ç*††?ç*ŒµUÁ?çkäl߃?çkëxi?ç­>ŽÇh?ç­E3)„?çî”wM?çî›xX?ç/æ'YJ?ç/ìËMÍ?çq3‡ýL?çq:+»?ç²|•ºµ?粃9A›?çóÁhK?çóÈ Sa?ç5ÿöß?ç5£$?çv>^/'?çvE™?ç·vƒß?ç·}&ŠŸ?çøªqÿÏ?çø±t˜?ç9Ú)d˜?ç9àË¢Š?ç{«¤?ç{ M ¿?ç¼,øn?ç¼3™Õ°?çýP ¢?çýV²§ ?ç>n÷QÄ?ç>u˜´P?牫¤ª?çLÐZ?çÀ .ÿ\?çÀ¦Ïô.?粂Z×?ç¹#Ê?çBÀ¦° ?çBÇG7?çƒÊ…9~?çƒÑ%‰°?ç ÄÐ Ó?ç ÄÖ»&"?ç Ñ~Ç«?ç ت?ç Fα™¹?ç FÕQE@?ç ‡Ç´S-?ç ‡ÎSÇÍ?ç ȼ‡ê\?ç ÈÃ'(?ç ­-Bz?ç ³ÌIJ?ç J™¥wì?ç J DGÓ?ç‹ñmÆ?狈Â?çÌf?çÌl°i(?ç F9ú?ç L¦e?çN!Õ€?çN(s´?çŽùyD€?çÄ?çÏÌö?çÏÓ“Že?çœLP?ç¢éŸr?çQg|Æ,?çQnÞš?ç’.qfW?ç’5GÑ?çÒñ'ç?çÒ÷òj?篴 ø?ç¶P„?çTj¤ø?çTpµá?æÿ• Xš(?æÿ•&ôŸÃ?æþÕÒqóÏ?æþÕÙ Âo?æþ€f¸?æþ‡OÄ?æýW*7¡9?æýW0Óá?æü—Ïå¢7?æü—Ö€Ëà?æûØqqÔ+?æûØx ÆÕ?æûÝ*?æûwå¿?æúY¨(Jé?æúY®ÂÏ‘?æùš=TˆŽ?æùšCîÖ4?æøÚÎbÕÕ?æøÚÔüìw?æøÆ ?æøaí¦?æìá­öxÖ?æìá´–?æì!ù^”?æì!ÿ°ÍW,?æ×ãæÎôŽ?æ×#¹™yˆ?æ×#À)ß±?æÖcŽð÷?æÖc•&?æÕ£`E¹™?æÕ£fÕ±M?æÔã-˜¡w?æÔã4(aï?æÔ"öê´†?æÔ"ýz=À?æÓb¼<Üq?æÓbÂÌ.l?æÒ¢}zd?æÒ¢„ ~Ò?æÑâ: 4?æÑâA/˜?æÑ!óÔ?æÑ!úR@T?æÐa¨åkR?æÐa¯sàH?æÏ¡ZŽ5?æÏ¡`”Ëæ?æÎá( x?æÎá ¶ä?æÎ °JÍ™?æÎ ¶Øœ¾?æÍ`Uo’¿?æÍ`[ý*?æÌŸö—nÐ?æÌŸý$Ïd?æËß“ÃHÄ?æËßšPr?æË,ô}?æË3€ù|?æÊ^Â*ˆ{?æÊ^È·C.?æÉžSgá\?æÉžYôdÁ?æÈÝà¬Ê ?æÈÝç9#?æÈiúN¶?æÈp†c|?æÇ\ïQ_T?æÇ\õÝ<É?æÆœpl>?æÆœw)b?æÅÛíÛÉH?æÅÛôg8?æÅg!;Þ?æÅm¬sZ?æÄZÜnŒ6?æÄZâùŒ\?æÚMÄÄ?æÚTOŒÒ?æÂÙ»$Çn?æÂÙÁ¯Xå?æÂ$z ?æÂ+Ô¾?æÁXŠË?æÁXíÊ?æÀ—눯Z?æÀ—òšÃ?æ¿×Iøæ?æ¿×O¢¬ó?æ¿¢·§¤?æ¿©A$T?æ¾UøeŸn?æ¾Uþîä¾?潕J#±l?潕P¬¿]?æ¼Ô—òÝh?æ¼Ôž{³ø?æ¼áÔ,l?æ¼è\Ëš?æ»S'È\Í?æ»S.PĘ?溒i»†K?溒pC¶²?æ¹Ñ§ªµö?æ¹Ñ®2®÷?æ¹᪄%?æ¹è2E¿?æ¸P»Èä?æ¸PCS?æ·Ißx"?æ·PfÊë?æ¶ÎxMÚ?æ¶Î~i:?æ¶ ¢ac%?æ¶ ¨èG?æµLÈÁ¢u?æµLÏHNý?æ´‹ë7Ðð?æ´‹ñ¾F ?æ³Ë ÄâšÍ"?æjnE õn?æi«è8n?æi«î©à?æhéŽ(Çç?æhé”™€~?æh'0lXQ?æh'6ÜÙ ?ægdÏ?ægdÕtXý?æf¢iðõn?æf¢pan?æeà!}?æeà‘V±?æe”“+Ò?æe›Í?æd[$Wö?æd[*Ç_w?æc˜°q¶?æc˜¶à65?æbÖ8Þå/?æbÖ?MÞÊ?æb½¢­?æbÄo8?æaQ>½*Æ?æaQE+´—?æ`Ž¼/?æ_ ¬¡ ?æ_ ²‹ƒ»?æ^G›¼Ï?æ^G% g?æ]„tÍO?æ]„“â?–?æ\Áø©ñ¼?æ\Áÿ,?æ[ÿ`;Û~?æ[ÿf¨Ýí?æ[<Ä+r?æ[<ʘ=?æZz$yž™?æZz*æ1,?æY·!×?æY·‡|z?æXôÙû§@?æXôàgÉò?æX2/>óà?æX25ªÞ ?æWo€ßÛF?æWo‡KŽ?æV¬ÎßC ?æV¬ÕJ½ù?æUê>#*?æUê©f ?æU'_ýF?æU'fh3?æTd£#`?æTd©‡öW?æS¡âŸ;Ê?æS¡é ÖÉ?æRß„†?æRß$îsŒ?æRVÌ´2?æR]6ß=?æQY‹yçÀ?æQY‘ãÚÐ?æP–¼Œl?æP–Âö'0?æOÓê\¹?æOÓðnßÏ?æOåh@?æON³X?æNN:-s¬?æNN@–†Ä?æM‹\̨B?æM‹c5ƒZ?æLÈ{ÀÆ_?æLÈ‚)iu?æL—,_?æLƒ—s?æKB®ÜÏ6?æKBµEF?æJÃm†?æJÉnh’?æI¼Ó˜×ô?æI¼Úšú?æHùà•c?æHùæü©b?æH6éüf?æH6ðcm^?æGsïÎo??æGsö5Š.?æF°ò ?æF°øsôf?æEíð¸ì¢?æEí÷—|?æE*ëÒÇà?æE*ò9:¯?æDgã[…ˆ?æDgéÁÀI?æC¤×T"î?æC¤Ýº%¢?æBáǽU?æBáÎ#µ?æB´˜?æBºý™«?æA[Ó¶J?æA[¤9Î?æ@˜ƒn&?æ@˜‰ÓH‘?æ?Õexjl?æ?ÕkÝTÊ?æ?Cól;?æ?JX†?æ>Oßçs?æ>O%Da¨?æ=‹ö>à ?æ=‹ü£"*?æ<ÈÊ#Ð?æ<ÈÐu-Ù?æ<šWn|?æ< »@l?æ;BgºÌ?æ;BmvT£?æ:0CÖd?æ:6§8!?æ9»õë Ò?æ9»üNÊs?æ8ø¸ ð ?æ8ø¾mâ&?æ85v¢®=?æ85}g¦?æ7r1³ž ?æ7r8U?æ6®é>±_?æ6®ï úŠ?æ5ëDÇx?æ5룦؃?æ5(Mµ°÷?æ5(T‰à?æ4dú+f?æ4eðÌ-?æ3¡£â£?æ3¡ªC„G?æ2ÞI¯1ò?æ2ÞPbq?æ2ë÷T|?æ2òXLÖ?æ1WŠ»iN?æ1W‘)‚?æ0”%üDq?æ0”,\Ì}?æ/нºÔÐ?æ/ÐÄ$´?æ/ Q÷Ó`?æ/ XWë?æ.Iâ´.è?æ.Iéx?æ-†oð©>?æ-†vPP£?æ,Âù®:?æ,à ©:?æ+ÿí«Ü?æ+ÿ†Lâç?æ+<¯Û^?æ+< Ú:?æ*xõœ?æ*xˆTb½?æ)´ý¿Ê_?æ)µXÛ?æ(ñuþ¤`?æ(ñ|\ú«?æ(-ê¯áª?æ(-ñ ÿÃ?æ'j[äõ?æ'jbAèÚ?æ&¦É›ë¢?æ&¦Ïù™S?æ%ã3؇ð?æ%ã:5ýk?æ%šš…f?æ% ÷«?æ$[ýâÐ?æ$\?Õ*?æ#˜]²]?æ#˜d)î?æ"Ôº к?æ"ÔÀfeU?æ"êâ?æ"F|C?æ!MhT$€?æ!Mn°H¦?æ ‰ºH¦˜?æ ‰À¤’?æÆȈê?æÆ$<–?æSÔ·?æZ02Œ?æ>›mÞ2?æ>¡É!`?æzß•t?æzåða?æ· :ŒÓ?æ·&•_?æó]\pr?æóc· Ü?æ/— ºû?æ/e!?ækÍFgË?ækÓ ‘­?æ¨!Ê?æ¨jg?æä/hä4?æä5Š?æ [Q}„?æ aªþ’?æ\ƒÊªZ?æ\Š#ó ?昨Õnž?是.?æÔÊr²?æÔÐËgå?æè¢ÛÚ?æîû{Á?æMg!F?æM ¿ˆá?æ‰ÀZ¨?æ‰!‰ö?æÅ.¯;R?æÅ52Q?æ?4´ë?æEŒs›?æ=LQ•]?æ=R©½?æyUö«T?æy\Mùc?æµ\!éÓ?æµbxÿ?æñ^ã/“?æñe: ý?æ-^;Qm?æ-d‘ö‚?æ iZ+g?æ i`'?æ ¥R³añ?æ ¥Y –[?æ áGÔñ ?æ áN*í3?æ 9¸&?æ ?æ{á?æ Y'ç”t?æ Y.=Õ?æ •Ú.?æ •/?æÐúi—Œ?æѾ²9?æ Þ–Æ?æ äëd?æH¿aÒÁ?æHŶ|µ?æ„œÌLî?æ„£ ¾ƒ?æÀvÖÖ8?æÀ}+o?æüM‚9Ð?æüSÖ:§?æ8 ¿± ?æ8'y?æsðä?æsöà¯ø?毼ú'?æ¯ÃM~¶?æ놆Ê?æëŒZ¦?æ'K¶+ä?æ'R Í?æcͺ?æcY|>?åÿžÌúG?åÿžÓL½2?åþÚˆ‘„n?åþÚŽãÂ#?åþ@ÍE×?åþGK$?åýQõ®T,?åýQü!?åü§5­f?åü­‡AÞ?åûÉUcöÕ?åûÉ[µRâ?åû:7"?åû‹ZÃ?åú@§¹%4?åú@® f?åù|K቗?åù|R2<\?åø·ì´Y?åø·óÓZ?å÷óŠ"ø“?å÷ós:w?å÷/$+WØ?å÷/*{aK?åöjºÜýr?åöjÁ,Îs?åõ¦N8•b?åõ¦Tˆ-ð?åôáÞ>Ô~?åôáäŽ4—?åôjð­g?åôq?Õ ?åóXôNݨ?åóXúÌÖ?åò”zZNè?åò”€© ?åñÏýÇd?åñÐbE£?åñ ||'Ê?åñ ‚Êm‘?åðFø”62?åðFþâC?åï‚q\ÊV?åï‚wªŸ(?åî½æÖĨ?åî½í$`þ?åíùYÙn?åíù_P=G?åí4Çâ E?åí4Î/7 ?åìp3uM?åìp9Â)?åë«›­­Î?åë«¡úh+?åêçŠÎ?åêçÖ“«?åê"b%ë?åê"heoG?åé]À[œj?åé]Ƨ­C?åè™Re0?åè™!ž=…?åçÔrþUž?åçÔyIõo?åçÇ`È?åçÍ«‡?åæKx³Z?åæKÃâ ?åå†fHîN?åå†l“äŒ?åäÁ°Ñpì?åäÁ·.¢?åãüø¥ã ?å«ÂDà?Z?åªü™DBÔ?åªüŸ~fT?åª6ðÇuà?åª6÷`’?å©qE0;z?å©qKií^?娫–RÑ?娫œ¸Ëä?å§åäµ·²?å§åêî÷õ?å§ /Ô+?å§ 6 œ?å¦ZwÛ)?å¦Z~ø-?奔¼Ë×?奔Ãlè?å¤Îþ¦ßX?å¤Ïßf ?å…? ­m?å…E9ír?å„Sž?å„S7¥?僌À v€?僌Æ8D“?å‚Æ|Ù?å‚Æ‚<œñ?å‚54`?å‚;E|?å9ë%³Z?å9ñSÖy?å€sž:U´?å€s¤h?×?å­NUÁh?å­TƒrŒ?å~æûxØj?å~ç¦P?å~ ¥¤t?å~ «Ñ³'?å}ZLÙK?å}ZSQ=?å|“ñ Ê?å|“÷8—¥?å{Í’:Œ?å{͘g @?å{0qÙx?å{6ž4–?åz@˲xè?åz@ÑÞ›?åyzcýA×?åyzj)*ì?åx³ùS ?åx³ÿ~³?åwí‹´hù?åwí‘ßà?åw'"SX?åw'!M‘Z?åv`§?åv`­È„•?åuš1&š?åuš7Qeô?åtÓ·¾¤I?åtÓ½é7.?åt ;fAö?åt A›Ð?åsF¼AJ?åsFÂHb?år€9ç_Y?år€@G?åq¹´Â”ô?åq¹ºìC©?åpó,°kÃ?åpó2Ùáj?åp,¡¥°ï?åp,§Îí†?åof¡ž?åofÊ &?ånŸ‚®}ý?ånŸˆ×Ht?åmØîÎÝ]?åmØô÷nÃ?åmXòþ?åm^+KQ?ålK¾K`^?ålKÄsž?åk…!©½?åk…'Ðùè?åj¾‚Ù?åj¾ˆD†/?åi÷ߧZG?åi÷åÎÎG?åi1:Ic'?åi1@pž?åhj’Ð’?åhj˜*Òd?åg£æ×C¡?åg£ìþ [?åfÝ8Ä»?åfÝ>ëJ»?åf‡ÌÆæ?åfóm?åeOÓðT™?åeOÚr?åd‰0 ‰?åd‰#UñÙ?åcÂcÄ?åcÂi¦¯ø?åbû¦áƈ?åbû­8Ÿ?åb4ç^Sc?åb4탌[?åan$÷J„?åan+J]?å`§_­d’?å`§eÒ+L?å_à—|-?å_ঠÆ?å_ÌtZÔ?å_Ò˜¯L?å^Rþ†¸ö?å^SªÔK?å]Œ-¹ò?å]Œ3Ýd$?å\ÅZ TŽ?å\Å`0ýœ?å[þƒ‚ñ†?å[þ‰¦ao?å[7ª2÷?å[7°>i»?åZpÍÖÐ÷?åZpÓùΔ?åY©î¶­ø?åY©ôÙrn?åXã »pë?åXãÝü9?åX'åó¤?åX.EÉ?åWU@+[b?åWUFMt]?åVŽUŠyû?åVŽ[¬YË?åUÇhßá?åUÇn0††?åUw¹Ý?åU}Ú†V?åT9„Š/é?åT9Š«d5?åSrŽ‚Ê?åSr”£Å=?åR«•£|?åR«›Ä_k?åQä™íÖ?åQä  –?åQ›a=ú?åQ¡‰?åPV™ÿ‡²?åPV ž?åO•É6?åO›é½?åNÈŽ¿²?åNȔެ¬?åN„᳦?åN‹m?åM:x2²?åM:~QQE?åLsh°ñU?åLsnÏé²?åK¬V^æ]?åK¬\}¥„?åJåA1´Ù?åJåGP:É?åJ)'ôÐ?åJ/FA‰?åIWLéZ?åIWjüÚ?åHð¡xï?åHö¿S6?åGÈÐ&N¾?åGÈÖCïË?åG¬Üæ?åG²ù}¸?åF:†ÃÎ?åF:Œàü–?åEs]Þ!þ?åEscûX?åD¬2+«è?åD¬8Hh?åCå­Z*?åCå ÉÝ ?åCÒcðÜ?åCØ€:{?åBVžP# ?åBV¤l3€?åAgrÅÏ?åAmŽœï?å@È-ÌœÅ?å@È3è:£?å@ñ^J?å@÷y®«?å?9²(ª·?å?9¸CÖ?å>rp!§e?å>rv<™{?å=«+GÈÙ?å=«1b«?å<ãã¦@»?å<ãéÀÀF?å<™=Ñ)?å<ŸXn?å;UL+L?å;UR)8K?å:ü?å:Ž4äÕ?å9Æ©bLð?å9Ư{ç^?å8ÿSå ‹?å8ÿYÿ±?å87û¥Þˆ?å88¿d?å7p £·±?å7p¦¼¦B?å6©Bßíœ?å6©Hø¢á?å5áâ[AÊ?å5áès½Â?å5Žä?å5….Ñ?å4S}?å4S*†f?å3‹°OÕÞ?å3‹¶g¥í?å2ÄDÏc ?å2ÄJæùÊ?å1üÖ‡Á?å1üÜž{/?å15euõ8?å15kU?å0mñ¦­k?å0m÷½˜6?å/¦{õ(?å/¦0¦¡?å.ßÐ¥+?å.ßçP?å.…Ët€?å.‹á³P?å-P  ?å-P !œ?å,ˆ…]¾?å,ˆ‹¦)ã?å+Á\÷?å+Áq™Æ?å*ùznÌ?å*ù€„&?å*1ðÉ~Z?å*1öÞžy?å)jdlÛY?å)jjÂ?å(¢ÕY‘­?å(¢Ûn??å'ÛCpø?å'ÛI¤å ?å'¯/”?å'µ&jJ?å&Lߥ`?å&Ló¦º?å%„}ï¬?å%„„æ©?å$¼á?‹â?å$¼çS?å#õAÛ;ÿ?å#õGî‘??å#-ŸÃh?å#-¥Ö:I?å"eú÷çÁ?å"f ÊC?å!žSzDD?å!žYŒíd?å Ö©KR?å Ö¯]‚?å ükY?å }<¶?åGLÚÔ¶?åGRìѯ?åš›:?å ¬ý©?å·å­Ø?å·ë¾§ ?åð. l?åð4"q7?å(sÈ:?å(yÙŸ?å`¶Ò”´?å`¼ãr²?å˜÷1~ ?å˜ýB"Ÿ?åÑ4å’?åÑ:õý­?å oåy ?å uõªÑ?åA¨0Õ?åA®?ú/?åyÝÏtv?åyãß3f?å²Ĭù?å²Ô2}?åêA+?åêGw–?å"n²ÔD?å"tÁæî?åZ™­z¼?åZŸ¼Sø?å’ÂÀ6?å’È`?åÊç­oŸ?åÊí»Õþ?å ´C(?åÂp?å;+ ò?å;1$o?åsHÓyV?åsNá3a?å«cíOò?å«iúЋ?åã|dK¥?åã‚q’Ë?å’9”?å˜F#F?å S¥l™x?å S«ymµ?å ‹µõ?å ‹¼'Û?å ÃÃÒü?å ÃÉß]`?å ûÏì©?å ûÕƒ?å 3שõÅ?å 3ݵä'?å kݤðÎ?å kã°¥¸?å£á®Ã?å£ç *3?åÛá½ÆS?åÛçÉJ?åßÝ)œ?ååè2?åKÛ_o!?åKáj>!?åƒÔEVð?åƒÚOìt?å»Ê±¡?å»Ðš ¨?åó¾?.x?åóÄIQ?å+¯T„õ?å+µ^mÿ?åcЖ ?åc£ÚE”?囉´&?国v1?åÓrÿ‚Ü?åÓy¿f?å YªNZ?å _³Qc?äÿC=³N ?äÿCC¼’?äþ{$OÎ?äþ{%,ßÑ?äý²ýþ Z?äý³_Ù?äüêÚAIB?äüêàIf=?äü"³î´‹?äü"¹ö˜?äûZ‹R?äûZ‘»B?äú’_‹%ž?äú’e’–?äùÊ1{ž„?äùÊ7‚Õe?äùÙc?äùà``?äø9Í¥:?äø9Ó«Ë ?ä÷q—ß/¯?ä÷qå¹õ?äö©_ˆäJ?äö©e5?äõá$¢°œ?äõá*¨ÇÌ?äõç-QÙ?äõí3/~?äôP§)•¨?äôP­/9À?äóˆdŽÊj?äóˆj”4õ?äòÀ[ý«?äòÀ%a.§?äñ÷ךÍÛ?äñ÷ÝŸÅH?äñ/Kݼ?äñ/“P›š?äðg@oà—?äðgFtdä?äïžñª¬?äïž÷ õh?äîÖŸÿ ?äîÖ¥Ë?äîJ•`ß?äîP™8w?äíE󌻓?äÒ¤‹ïm%?äÒ¤‘ëcë?äÑÛÝ]‡p?äÑÛãYDŠ?äÑ,W–?äÑ2S?äÐJxÞ¼?äÐJ~Ùg{?äÏÂò Ò?äÏÈíã?äι ”s?äιŽäÔ?äÍðO¼0I?äÍðU¶Ìú?äÍ'’iœ?äÍ'˜cÿ?äÌ^Ò¥<*?äÌ^ØŸey?äË–o¬‚?äË–iœ?äÊÍKɱ½?äÊÍQÃg§?äÊ„´?äÊŠ­|O?äÉ;»/dH?äÉ;Á(¦Ë?äÈrïq<?äÁcV¾Ö?äÁc\µ×n?äÀšr’ÊÐ?äÀšx‰’g?ä¿Ñ‹þk›?ä¿Ñ‘ôùu?ä¿£IÑ?俨øî?ä¾?·ŸHe?ä¾?½•bÄ?ä½vÉÖ!Z?ä½vÏÌû?ä¼­Ù§eÎ?ä¼­ß ¯?ä»äçš?ä»äí m»?ä»ò£V?ä»øÖ¶?äºRúÁΖ?äºS¶È5?乊u?乊ù4ó?ä¸ÁåH3?ä¸Á ÙÎM?ä·ødàÂ?ä·ø Y-?ä·/„r?ä·/ x?ä¶fCph?ä¶f7I6?䵜ü£Ú?äµ—y ?ä´Óôæé?ä´Óú‘L+?ä´ ê0Ñh?ä´ ð#üä?ä³AÝdÙ?ä³AãWʼ?ä²xÎ:ÅÚ?ä²xÔ-}Æ?䱯¼³_à?䱯¥Þ?ä°æ¨Ï%¿?ä°æ®Áj?ä°’Žïš?ä°˜€ú)?ä¯TyóT?ä¯Tå^?䮋^ý•Ä?䮋dï,½?ä­ÂA­Ø ?ä­ÂGŸ5Í?ä¬ù" (?ä¬ù'ö0‡?ä¬0ÁÔ?ä¬0ô«e?ä«fÛªÖb?ä«fᛆ%?䪴úñŒ?䪺ëg€?ä©Ô‹ô¹û?ä©Ô‘äö ?ä© `™%?ä© f‰y?ä¨B2àµ{?ä¨B8Ð}þ?ä§yÊß²?ä§yºnc?䦯Ð_Â(?䦯ÖO?ä¥æ› K?ä¥æ¡-W?ä¥dŒ}V?ä¥j{^?ä¤T+%¨X?ä¤T1O¼?䣊ïly.?䣊õZæ½?ä¢Á±al(?ä¢Á·OŸâ?ä¡øqfþ?ä¡øvó`â?ä¡/.YO?ä¡/4FÆ\?ä eé]?ä eïJE?䟜¢ó?䟜§ÿbO?äžÓXy?äžÓ^fœ?äž ’q¶?äž J_?ä@¾_V?ä@ÄK¦&?äœwmߥô?äœwsÌ é?ä›® ðæ?ä‘tÐœ;?ä‘t¹Öð?䪣€Ž?䪨ñ^?äá-ýªì?äá3æq×?䶩”É?ä¼’!Í?äŽN= š6?äŽNBóíT?ä„Á+8ä?ä„ÇR?䌻C b&?䌻HñAt?ä‹ñ¦¦^?ä‹ñÈŽKÃ?ä‹(@¾;?ä‹(Eë)·?äŠ^»!bN?äŠ^Á“á?䉕4:÷?䉕9ç2ž?äˆËª¡¢?äˆË°‡¾_?äˆ[ˆ?äˆ$êßY?ä‡8‘+$"?ä‡8—n?ä†oêT?ä†oûúK?ä…¥nņn?ä…¥t«\v?ä„ÛÚ:¨^?ä„Ûà Dx?ä„CuçÜ?ä„I[J?äƒHªxÊ?äƒH°]-?ä‚:™o?䂇¹?äµq¼Ñà?äµw¡†9?ä€ëÒb›?ä€ë×êÝ?ä€"0Ùà?ä€"5üU?äX‹ñö%?äX‘Õü§?ä~Žå•e³?ä~Žëy2B?ä}Å=Ö¾?ä}ÅBæiY?ä|û’:ÿl?ä|û˜X?ä|1å>•Ö?ä|1ë!´†?ä{h6X?ä{h;ñ<¿?äzž„ªó×?äzžŠžš?äyÔÑ?äyÔÖ÷‡â?äy Mo}?äy !/¦Q?äxAcTÂÂ?äxAi6¿œ?äww©+®g?äww¯ qH?äv­ìÒïô?äv­ò´xÛ?äuä.DJ?äuä4%˜ý?äumX?äus`.I?ätPªŠ¸?ätP°k““?äs†åg³ò?äs†ëHTë?är½߀?är½#÷F|?äqóT˜ß@?äqóZy >?äq)ˆîW?äq)ŽÎJ?äp_»Ý?äp_À÷»Þ?äo•ë¶h?äo•ðö5i?änÌêåH?änÌÊ*I?änD•s&?änJt~&?äm8n ƒ?äm8sõÜ‚?äln•pIÆ?äln›NàÃ?äk¤º¡ñL?äk¤À€NE?äjÚݬ½X?äjÚãŠàO?äjþ‘A?äjo*?äiGI–í?äiG#'EÛ?äh}9Õ;¯?äh}?²°˜?äg³T; d?äg³ZDG?äfél{Éì?äférXÊÈ?äf‚˜/?äfˆtõæ?äeU–Ú…?äeUœmgS?äd‹¨f•ê?äd‹®Bè°?äcÁ¸Æ?äcÁ½ö‚?äb÷Å«ÚŽ?äb÷ˇ¹A?äb-ÑƧ?äb-ÖøkP?äacÚm€R?äacàHêð?ä`™áž°Î?ä`™çyáa?ä_Ïæ°ù@?ä_Ïì‹ïÇ?ä_é¥*¥?ä_ïç?ä^;ê{åø?ä^;ðVhd?ä]qé5ô?ä]qï)?äPмåY?äP‘Pàv?äP—'MŽ?äO?äLÝîÑð?äL¹f´Ì?äL¿;ÿb?äKIˆÿ¶?äKIÚ1?äJT”­?äJZhÙ ?äIµj˜?äIµ$éÛ?äHêç†Ôb?äHêí[6‡?äH ­ëìÎ?äH ³ÀÕ?äGVrD€@?äGVxn)?äFŒ4‘#{?äFŒ:d×D?äEÁôÒ¢¶?äEÁú¦`?äD÷³ ŠŸ?äD÷¸ÜÊ(?äD-o6{?äD-u ”ä?äCc)TnÀ?äCc/':?äB˜ábµ?äB˜ç5F??äAΗg–¸?äAÎ9íº?äAKcæI?äAQ6(?ä@9ýX^œ?ä@:*AW?ä?o­EšÂ?ä?o³CY?ä>¥[,=ž?ä>¥`ý¬?ä=Û š?ä=Û ÞEæ?ä=°è±†?ä=¶¹««?ä?ä¬Óözœ?ä¬Ù¼ÿ}?äâ!\ j?äâ'"T ?älØ·Ú?äržÈ9?äL¶mQ?äL¼3'-?äþ€¶?ä‚à‘?ä·Càâ°?ä·I¦DH?äì‡Á22?äì†Y†?ä!ɼ ?ä!Ï°?äW Ò?~?äW–òI?äŒHSß?äŒMÈÌe?äÁ„MÕÔ?äÁŠ?äö¾®Y?äöÄr]?ä+÷+›?ä+üïe5?äa-Æ/›?äa3‰¿?ä –b~¿`?ä –hB…?ä Ë•Uü‚?ä Ë›_?ä ÆL u?ä Ì?ä 5õc%þ?ä 5û%ÌH?ä k"še®?ä k(\Ñ®?ä  Mó?äNøÍÚ?äIe¨´e?äIki³?ä~€?e‡?ä~…ÿŠ†?䳘üÐH?䳞¼ºö?äè¯áÃq?ä赡sÏ?äÄîÇ~?äÊ®=‹?ãÿRØ$“¤?ãÿRÝãÏ`?ãþ‡éƒß?ãþ‡ïBàj?ãý¼ù Q?ãý¼þÌ?ãüòÁ‰=?ãüò €?ãü'¡'$?ãü'_y”?ãû\¬øà?ãû\"kü?ãú‘$åº?ãú‘*£{?ãùÆ+K´÷?ãùÆ1 Xj?ãøû/ßõ ?ãøû5^)?ãø02¢í}?ãø08`C?ã÷e3˜?ã÷e9MŒ…?ãöš2¨¶Ž?ãöš8ep¦?ãõÏ/ðYº?ãõÏ5¬Ù{?ãõ+hN-?ãõ1$“–?ãô9%9}?ãô9*ÍDŒ?ãónë’‡?ãón"§c=?ãò£øD´?ãò£³Û?ãñØ7åÐ?ãñØ óAÓ?ãñ ù« ?ãñ ÿf-8?ãðAêR‰Æ?ãðAð q?ãïvÙ.æn?ãïvÞé“^?ãî«Æ@ÎS?ãî«Ëû@ç?ãíైî&?ãíà·C&]?ãí›úH?ãí Áø!?ãìJ‚¾‡ð?ãìJˆxKk?ãëh­CŽ?ãënfÌ«?ãê´LÐX?ãê´R‰¦Í?ãéé/'oI?ãéé4àƒ§?ãé·µb?ãép`?ãèRîŸL?ãèRô:>é?ãç‡Ë…ï€?ãç‡Ñ>T¼?ã漦ÅA˜?ã漬}ls?ãåñ€@g^?ãåñ…øWØ?ãå&W÷Õy?ãå&]¯‹?ãä[-ìFJ?ãä[3£Áý?ããlN?ããÕ­ž?ãâÄÔŽêz?ãâÄÚEñf?ãáù¥>[ä?ãáùªõ(k?ãá.t-‚N?ãá.yäq?ãàcA\ø¦?ãàcGPc?ãߘ ÍiB?ãߘƒ†˜?ãÞÌÖv§?ãÞÌÜ5Y–?ãÞžoe?ãÞ¤% ž?ãÝ6d X?ãÝ6jRzy?ãÜk) G”?ãÜk.Â{M?ãÛŸëÀ ÷?ãÛŸñušG?ãÚÔ¬·è4?ãÚÔ²l§?ãÚ kó¯?ãÚ q¨3„?ãÙ>)t‡?ãÙ>/(Ñ)?ãØrå;0]?ãØrêï@?ãקŸHSˆ?ãק¤ü(Æ?ãÖÜWœ™3?ãÖÜ]P4?ãÖ8šn?ãÖëúÔ?ãÕEÃÏ?ãÕEÈÐ<É?ãÔzvJŸ†?ãÔz{ý‹?ãÓ¯'Áû·?ãÓ¯-t¬Ö?ãÒã׃¬ö?ãÒãÝ6#§?ãÒ…c ?ãÒ‹BŸO?ãÑM1䡤?ãÑM7–£x?ãÐÜ€Vä?ãÐâ2H?ã϶…gçU?ã϶‹tI?ãÎë,œ(2?ãÎë2Mzµ?ãÎÒ°ó?ãÎ×ÎÉ?ãÍTuí(^?ãÍT{žþ?ã̉ <á?ã̉»à?ã˽¸x•?ã˽¾(ýÐ?ãÊòW5È?ãÊò\åög?ãÊ&ôC‹Ö?ãÊ&ùó¬?ãÉ[¢~æ?ãÉ[•R8H?ãÈ)SG•?ãÈ/ƃ?ãÇÄÁV›~?ãÇÄÇß÷?ãÆùW­W?ãÆù]\Z?ãÆ-ìWO%?ãÆ-ò³?ãÅbV‹?ãÅb…—£?ãÄ—¥ÖÊ?ãÄ—T1j?ãÃË F±‚?ãÃË¥ôÑ«?ãÃ.<ü£?ãÃ3êâT?ãÂ4º‰]?ãÂ4À7:?ãÁiE,o¥?ãÁiJÙàe?ãÀÎ&Ù8?ãÀÓÔ?ã¿ÒUyUa?ã¿Ò[&Q/?ã¿Û$qŒ?ã¿àÑ2ß?ã¾;_(é,?ã¾;dÕp?ã½oá‡`?ã½oç3¬î?㼤b@l˜?㼤gì~z?ã»ØáTÈt?ã»ØçŸÚ?ã» ^Å1?ã» dpµ?ãºAÚ‘èÂ?ãºAà=K/?ã¹vT»ü¼?ã¹vZg$«?㸪ÍC÷ó?㸪Òîåd?ã·ßD&•¤?ã·ßIÑH—?ã·¹cѦ?ã·¿J?ã¶H-Š?ã¶H2ªB?ãµ|žûª±?ãµ|¤¥®&?ã´±W}º?ã´±F®?ã³å~/ƒ?ã³åƒ½½ö?ã³ë2K€?ã³ðÛŸr?ã²NV²ƒf?ã²N\[œ×?㱂À•ˆÍ?㱂Æ>g¼?ã°·(ÛßE?ã°·.„ƒ±?ã¯ë†O5?ã¯ë•.¹?ã¯ô•kT?ã¯ú=šº?ã®TX ää?ã®T]±ÙÆ?ã­ˆ¹äV?ã­ˆ¿Œs?㬽%`´?㬽ÌàŒ?ã«ñxͽ`?ã«ñ~u³?ã«%ÕÚU…?ã«%Û`R?ãªZ1K3F?ãªZ6ò?ã©Ž‹$Y„?ã©ŽÊïD?ã¨Âãf‡r?ã¨Âé â«?ã§÷:F¦?ã§÷?¸gW?ã§+(FÛ?ã§+”Î-?ã¦_â©(g?ã¦_èNÔ?㥔4•“5?㥔:;M?ã¤È„î'r?ã¤ÈŠ“^?ã£üÓ³…7?ã£üÙX?ãšp Ô%!?ãšpvb‹?㙤ENßs?㙤JðâM?ã˜Ø~>r²?ã˜Øƒà:ü?㘠µ£ª®?㘠»E8g?ã—@ëÉ?ã—@ñ pñ?ã–uÑbT?ã–u%rzê?ã•©R›,ý?ã•©X< ?ã”݃Ý# ?ã”݉}Æ’?㔳—âj?㔹8KJ?ã“EáÌÖ?ã“Eçl/"?ã’zz:R?ã’z. ?ã‘®9Ÿâ?ã‘®??›%?ãâc=?ãâhÜ ?ã‹Ugn?ãô«h?ãJ±éø?ãJ·ˆ‰^?ãŽ~Öúq?ãŽ~ܘâ@?ã²ú‡Å¸?ã³&Yñ?ãŒç“2ý?ãŒç"1ŒŸ?ãŒ=ïÊ?ãŒB»Ö?ã‹O\%®è?ã‹OaÓ[?㊃y® L?㊃K¶'?㉷•¶²ÿ?㉷›T"B?ãˆë°@Mï?ãˆëµÝ‚˜?ãˆÉK€f?ãˆÎèzw?ã‡SàØǤ?ã‡Sæu‡?ㆇöèì²?ㆇü…qŽ?ã…¼ |t??ã…¼¾?ã„ð‘±?ã„ð$-X?ã„$0&±?ã„$5† ?ãƒX@@ô?ãƒXEÜŽð?ã‚ŒNàwÂ?ã‚ŒT{ו?ãÀ\ܦ?ãÀa¡Ý?ã€ôg±½d?ã€ômL§ý?ã€(qäÃK?ã€(wsF?ã\zŸ—ˆ?ã\€: æ?ã~â½f?ã~‡|ø%?ã}ć®í ?ã}ÄHí*?ã|øŒÖø?ã|ø‘žœx?ã|,ŽåÅ?ã|,”~¦?ã{`P)À?ã{`•éz?ãz”Fä?ãz”•ßù±?ãyÈŽÉÆ–?ãyÈ”b¡•?ãxü‹Ùˆó?ãxü‘r)Q?ãx0‡sÝÙ?ãx0 C•?ãwd˜Ùÿ?ãwd‡1?ãv˜zK×ë?ãv˜ãÈb?ãuÌq?ãuÌw%4ç?ãug^g¼?ãulõâí?ãt4[¿92?ãt4aVy¿?ãshN°©Á?ãshTG¯©?ãrœ@33>?ãrœEÉþ‚?ãqÐ0G“V?ãqÐ5Þ#ô?ãqîij?ãq$„¿c?ãp8 (>.?ãp8¾Y?ãok÷õ¿î?ãoký‹ ›?ãnŸâW«û?ãnŸçíR?ãmÓËNlš?ãmÓÐã×ø?ãm²ÚÕ‰?ãm¸p@?ãl;˜ý~?ãl;ž’t,?ãko}´?ãWb¶°?ãV²Ï™c®?ãV²Õ()m?ãUæyú?ãUæ””?ãUM£4?ãUR¦ó?ãTN Ó‰S?ãTNažø?ãSÅ6¿À?ãSÊÄš°?ãRµBðG?ãRµ„Ѓ?ãQé7ö\?ãQé=ƒÁŽ?ãQïQ;?ãQôÞF ?ãPP¥VF?ãPPªã b?ãO„Zýw?ãO„_’²Ü?ãN¸ aL‘?ãN¸íÇ@?ãMë¿hÀ3?ãMëÄõ+?ãMpêk?ãMu¨ï¬?ãLS~s°?ãLS% >9?ãK†Íæq?ãK†ÓvB?ãJºzLd?ãJº×V}?ãIî%¹NÎ?ãIî+Di.?ãI!ÏÖoN?ãI!ÕaNô?ãHUx¤j?ãHU~.¨V?ãG‰ "¤ ?ãG‰%­S?ãF¼ÆRùA?ãF¼ËÝ(º?ãEðk5›™?ãEðp¿V?ãE$Èý?ãE$R·?ãDW± Y¾?ãDW¶–Ù?ãC‹RVd?ãC‹WŽšï?ãB¾ñ±ƒX?ãB¾÷:'?ãAò–9?ãAò•›eL?ãA&-)&¬?ãA&2±»?ã@YÈõÌF?ã@YÎ~%Þ?ã?cy<[?ã?i[5?ã>Àü³ÿb?ã>Á;ã~?ã=ô”¦¬³?ã=ôš.V?ã=(+QùX?ã=(0Ùg÷?ã<[À¶|x?ã<[Æ=°W?ã;TÔÍ"?ã;Z[ÆB?ã:Âç­‘4?ã:Âí4O”?ã9öyAn}?ã9ö~Çò?ã9* åp?ã9*.O?ã8]˜š¦í?ã8]ž µ ?ã7‘&^æ ?ã7‘+ä¹e?ã6IJài?ã6ĸe¶?ã5ø>?ã5øC¤eì?ã5+È4]?ã5+Í¡Ws?ã4_PØ0…?ã4_V]Ø?ã3’ØS¨p?ã3’ÝØV?ã2Æ^@…?ã2Æd³R?ã1ùã‹Ž/?ã1ùéÆ8?ã1-gI5 ?ã1-lÍ2å?ã0`éÈÌ?ã0`ïLŽ˜?ã/”k î4?ã/”pŽuï?ã.ÇëN¾?ã.Çð“›´?ã-ûiÙ{F?ã-ûo\u?ã-.çgK?ã-.ìéص?ã,bc¹“T?ã,bi?ã 6«j#·?ã 6°ãË?ã iøSŒ?ã iý̃?ã DÌÁ?ã I‘þu?ã ÐŽ»ëê?ã Д4âÉ?ã Ø=0?ã ݵÎ:?ã 7 œÇ†?ã 7&H»?ãjgÛ¿ú?ãjmTY?ã­ú’ ?ã³r–?ãÐòùÅw?ãÐøq–*?ã6Ú?ãí•?âù7Þä?âù7ãz+?âøk+'û?âøkžÕf?â÷ž?:L¸?â÷žD­¿F?âöÑn5P¯?âöÑs¨ˆa?âöœÇ_?âö¡Ä4?âõ7ÈñRå?âõ7ÎdÝ?âôjô³è?âôjú&?âóždR?âóž$ÖPŽ?âòÑIf¡?âòÑNuwÿ?âòq’9>?âòw½?âñ7™,y?âñ7ž‚È?âðj¿€Ëà?âðjÄò,¢?âïäá¸ð?âïêRÞÒ?âîÑ 4†d?âîÑ¥qg?âî,yÕ†?âî1ê…¨?âí7N²8ç?âí7T"®*?âìjoÞJO?âìjuN„±?âëýŒ?âë•m‹ˆ?âêЯh´?âêд€-S?âêÍxÒ?âêÒˆ?âé6êcé?âé6ï…²Å?âèj ´'?âèj yÈ"?âç ö ?âç&dâµ?âæÐ:Øõ¢?âæÐ@G“×?âæS´&«?âæY"‰ý?âå6kˆÿ?âå6pö@m?âäi‚U8?âäi‡ÃlÃ?â㜘æ?â㜊˜«?ââϬÞäœ?ââϲL\_?ââÀœ!¼?ââÆ ^š?âá5ÓU.?âá5ØÂ0?âàhå šl?âàhêwa?âß›õ½ ?âß›û)™K?âÞÏl4_?âÞÏ Ø…©?âÞbè?âÞ„yL?âÝ5!Ã(+?âÝ5'/©?âÜh.m$?âÜh3Ø»¼?âÛ›:Ä$?âÛ›?‚)Ô?âÚÎDÀÈ”?âÚÎJ+ó]?âÚNkÆx?âÚSÖ¶[?âÙ4WEÝ?âÙ4\‚ú×?âØg^Æëí?âØgd1eÿ?âךexVc?âךjâ•Ž?âÖÍk-Ê?âÖÍp— ?âÖoå­?âÖuOvé?âÕ3s¢Ü¤?âÕ3y k?âÔfve)$?âÔf{Î|«?âÓ™x-)?âÓ™}–Aµ?âÒÌxû?âÒÌ~d^»?âÑÿxÏô—?âÑÿ~8—`?âÑ2w«$?âÑ2}h?âÐeuð??âÐezö3?âϘryRÀ?âϘwáDÉ?âÎËnmÒv?âÎËsÕ‰”?âÍþilI?âÍþnÓ€{?âÍ1ctuÈ?âÍ1hÛ·?âÌd\‡Âü?âÌdaîÉV?âË—T¦–T?âË—Z aÂ?âÊÊKÑgR?âÊÊQ7÷Ó?âÉýBØþ?âÉýGo.’?âÉ07M•ƒ?âÉ0<³°*?âÈc+ "¯?âÈc1h?âÇ–#:?âÇ–$fÈ?âÆÉq$ ?âÆÉÖè?âÅüðÀn?âÅüUï]?âÅ.óî#?âÅ.øäâ#?âÄaã'O?âÄaèƒà`?âÔÑÏš¢?âÔ×4Å?âÂÇ¿‘Ô?âÂÇÄöJ?âÁú¬f‹?âÁú±Ê“F?âÁ-˜N5r?âÁ-²Æ?âÀ`ƒItÖ?âÀ`ˆ­:?â¿“mXñÇ?â¿“r¼I:?â¾ÆV}0‰?â¾Æ[àM ?â½ù>¶ÃÐ?â½ùD¥a?â½,&[,?â½,+iÌ?â¼_ ll,?â¼_Î×Û?⻑ñé¦-?⻑÷KÖê?âºÄÖ~ª?âºÄÛàŸÎ?â¹÷º+ìü?â¹÷¿§Õ?â¹*œòû?â¹*¢S–á?â¸]~ÑGà?â¸]„2ŒÓ?â·_É÷Œ?â·e+?â¶Ã?Ý7d?â¶ÃE>q?âµö ˜µ?âµö$l,Ï?âµ(ýU¬Ç?âµ)¶í?â´[Ú¼1?â´[à1c?Ⳏ·?dB?Ⳏ¼ŸG?â²Á’à)½?â²Á˜?Ò?â±ômŸ¥?â±ôrþ…ø?â±'G|¬?â±'LÛÞ|?â°Z ytè?â°Z%ØlQ?⯌ø–'¿?⯌ýôä3?⮿ÏÓF¾?⮿Õ1ÈP?â)è–?â.m¼å?âŒFÜë÷å?âŒFâ@‘3?â‹yùò?â‹y•Mc@?⊬B@›?⊬G”¾U?â‰ÞóÃLŠ?â‰Þù4×?≤²ä?≩Õ`0?âˆDT|gr?âˆDYÏÙ½?â‡w³õ%?â‡w ,o?↩²(î?↩·{êN?â…Ü_ÛòO?â…Üe.³•?â… Í™Í?â… ?â„A¸þ…?â„A¾PÐR?âƒtdo19?âƒtiÁAx?₧ 6“?₧r Ð?âÙ¹&*?âÙ¾cÀd?â bE˜?â g–÷U?â€? »,?â€? :`?âq²sFŒ?âq·Ä/¼?â~¤Yn¹ô?â~¤^¿h ?â}Öÿ­ë–?â}×þ^¾?â} ¥1ˆŒ?â} ªÀ°?â|oûÌql?â>p «ú?â=¢n”µN?â=¢sÒ´É?â<ÔàÏ–?â<Ôæ aÿ?â<R}¸Ö?â<W»B,?â;9ßœŽ?â;9ÈÜêÐ?â:l45Ð?â:l9rãG?â9ž¤@ú^?â9ž©}Òy?â8ÑÁ›ƒ?â8Ñþ8‹?â8‚¹å?â8‡õtÙ?â75ñ("#?â75ödI?â6h_»?â6hdJ|‡?â5šÌlå$?â5šÑ¨•Ü?â4Í9C³Ë?â4Í>)n?â3ÿ¥“˜ ?â3ÿªÎÒš?â32]?â32˜Š?â2d| Ä‘?â2dÛˆö?â1–ç_8–?â1–ì™Áæ?â0ÉQ˜ó?â0ÉVÓAK?â/û»N‹h?â/ûÀˆž?â/.$€œr?â/.)ºt‚?â.`/¤Ø?â.`’iAÒ?â-’õ\BÆ?â-’ú•¤ª?â,Å]ÿ@?â,Åb@&?â+÷Ä0q:?â+÷Éi\ò?â+**Ú§?â+*0ÂI?â*\‘Ÿ%?â*\–=±?â)Žö¯Â\?â)ŽûçüÒ?â(Á[Ü?â(Áaì?â'óÀŠ"Ú?â'óÅÁç"?â'&$ºs×?â'&)ñý?â&Xˆmû?â&X¤ì?â%Šë¤3«?â%ŠðÛF®?â$½N^À2?â$½S•˜?â#ï°ÕÊ?â#ïµÔrž?â#"b’?â#"˜hN?â"Ts«Ú?â"Txâ½?â!†Ô{åÍ?â!†Ù±ÑZ?â ¹4Ò»Ž?â ¹:l?âë”°âª?âë™æX?âô÷K?âùL1?âPSŽâ?âPX;Ž?₱€a?₶µ%¤?ⵄ ?⵸›?âçm*“?âçrFxu?âÊ+1T?âÏ_D?âL&Ï·3?âL,Žã?â~ƒPe?â~ˆ3ìü?â°Þ½†“?â°ãðè?âã:ôÀ?âã?;$?â”à ì?âš 6?âGïF”}?âGôyD®?âzI;í°?âzNnbÆ?⬢À²A?⬧òì=?âÞûÕkR?âßj4?âTz³d?âY¬w-?âC¬±ê?âC±âŸ˜?âvzJÚ?âv «˜n?â¨[×3?â¨a+¬?âÚ²Æüf?âÚ·÷ÓÅ?â JrG?â {‹?â?_bp?â?d’u˜?â qµum?â qº>›z?â ¤ PÊ?â ¤€¼?â Ö_'šÜ?â ÖdWJ³?â ³•yˆ?â ¸ÄîD?â ;šRp?â ; ÉŒ?â m[6©Æ?â m`e¨J?⟮k?⟳™Øz?âÒ8"Ä?âÒf«?âSžZH?âX̧x?â6¥žMd?â6ªÌ_x?âh÷8ŠN?âhüfaF?â›Hnëí?â›Mœ‡È?âÍ™BC†?âÍžo¤E?âÿé±Õà?âÿîÞûƒ?â29¾AÖ?â2>ë,\?âd‰h ç?âdŽ”½P?â–دÀx?â–ÝÜ4Ä?áÿÉ'•ô°?áÿÉ,Â-ß?áþûv0Ê?áþû{G.Ü?áþ-Ä@P?áþ-ÉkÈE?áý`ÿD?áý`0‡?áü’_j¯ ?áü’d•ûÆ?áûĬqšƒ?áûıœ¬ ?áúöù\L?áúöþE2Ê?áú)Ee„?áú)Jâ?áù[‘SŽ`?áù[–}î£?áøÜå¹?áøâ<Þ?á÷À( ?á÷À-Eö ?áöòrù9U?áöòx"è=?áö$½{æÏ?áö$Â¥Zš?áõW¤ F?áõW ÍØò?áô‰Qsà?áô‰VœÝ¦?áó»šêJ+?áó»  š?áòíäj?áòíé0ñW?áò ,ιÓ?áò 1÷?áñRu=Ö´?áê÷W;¬?áéI7ZJk?áéI<€ D?áè{|2ƒu?áè{X -?áç­Àº¬?áç­ÅßÍD?áæàòà??áæà ð·?áæHÜR?áæNéª?áåDŒvµ|?áåD‘›O´?áävÏÃPÖ?áävÔç¯î?áã©Âe¢?áã©扙?áâÛUt˜û?áâÛZ˜Ñ?áâ —Úf€?áâ œþ6?áá?ÙôaÞ?áá?ßÔt?áàrÃÊ?áàr æO??áߤ]GO?áߤbj£?áÞÖž€Þº?áÞÖ££Ÿí?áÞßr­?áÞä•3“?áÝ; O©?áÝ;%?š™?áÜm`Í!?áÜme¡Üð?áÛŸ š®V?áÛŸ¥¼ƒ?áÚÑàn…ð?áÚÑå|?áÚûÜ4?áÚ%:Ÿ?áÙ6_CC ?áÙ6ddfê?áØhžEG¸?áØh£f/à?áךÝi™?áךâ# ?áÖÍ{EÖ?áÖÍ ›·»?áÕÿY°`Ê?áÕÿ^З?áÕ1—¢B5?áÕ1œÂ=Ö?áÔcÕQx¡?áÔcÚq9 ?áÓ–¾•î?áÓ–ÞK?áÒÈOê'?áÒÈU hb?áÑúŒÔ¦q?áÑú‘óµ‰?áÑ,É€o,?áÑ,ΟC"?áÐ_îTœ?áÐ_ íp?áÏ‘BFÆ?áÏ‘G;¤x?áÎÃ~ ÓN?áÎÃ+õÝ?áÍõ¹Àv?áÍõ¾Þ]ý?áÍ'õ5ÈM?áÍ'úSt—?áÌZ0nUâ?áÌZ5‹Ç ?áËŒkj¥¸?áËŒp‡Û½?áʾ¦+E?áʾ«H?ä?áÉðà°Ç¸?áÉðå͇w?áÉ#û¦G?áÉ# *ã?áÈUU ‚5?áÈUZ(Ë®?áLJŽãÞ ?áLJ“ÿìc?áƹȂ?¸?áƹ͞ë?áÅìè7O?áÅìÏ_?áÅ;TÖ?áÅ@1±Â?áÄPtõ?áÄPy*â?á¬ÒôV?á±íÚû?á´åa+$?á´ê{Ö¦?áÁçº"?áÁç"Ô’d?áÁUÞah?áÁZø–£?áÀKÎ{ñ?áÀK’èv?á¿}ÅŠöu?á¿}ʤµh?ᾯýci?á¾°-ç9?á½â4kGw?á½â9„#?á½k4ê?á½p©Br?á¼F¢ƒ©h?á¼F§œ{Í?á»xÙFDº?á»xÞ^Ûû?ẫØz?ẫðÖ9?á¹ÝF:âR?á¹ÝKSK?á¹|n Ç?á¹…ñ›?á¸A²rw&?á¸A·Š!Ö?á·sèJ§g?á·síbò?ᶦ÷›?ᶦ#´?áµØSw°1?áµØXŽ©t?áµ ˆËÑ?áµ â:?á´<½ôbP?á´<à åJ?á³nòññZ?á³nø90?Ს'Å?Ს,ÛÀ?á±Ó\nEg?á±Óa„ô?á±î–?á±–¦þ?á°7ÅE?á°7ÊZcL?á¯iùsµk?á¯iþˆÕŠ?ᮜ-zžö?ᮜ2ƒð?á­ÎaZXb?á­Îfo7?á­•k ?á­š'ÙÐ?á¬2ȦRå?á¬2ͺ†p?á«dü©þ?á«e'¢d?᪗/]úK?᪗4q·Œ?á©Éb†0ö?á©Ég™³?á¨û•Šî¾?á¨ûšž5µ?á¨-Èl¿´?á¨-͈?á§_û,)?á§`>ù­?ᦒ-ɹç?ᦒ2ÜOo?á¥Ä`Eþ6?á¥ÄeXX™?á¤ö’¡t?á¤ö—³“>?á¤(ÄÜ­¹?á¤(Éî‘Ñ?á£Zöø6æ?á£Zü ßÙ?á¢(ô”(?á¢.ö?á¡¿ZÒW®?á¡¿_ãŠV?á ñŒ’‡?á ñ‘¢ú ?á #¾4#K?á #ÃDߨ?áŸUï¹Hz?áŸUôÉɲ?ឈ!!ý?ឈ&2C)?áºRpØ_?áºW€ãL?áœìƒ¦âs?áœìˆ¶²;?᜴›Ô?᜹Ò0v?á›PåÄP?á›PêÓÚÌ?ᚃ­'m?ᚃ¼EÃ?ᙵG}f?ᙵL‹û—?á˜çx4ל?á˜ç}C¨?ᘨÔõá?ᘭãbÇ?á—KÙ]ùÐ?á—KÞl+?á–~ Ðiì?á–~Þ`†?á•°:,ÖÆ?á•°?:’:?á”âjsÊ?á”âoJh?ᔚ¥Ã\?ᔟ³„?á“FÊÃL?á“FÏÐV?á’xúÌû\?á’xÿÙÊ8?á‘«*ÃPS?á‘«/Ïä ?áÝZ©?áÝ_µi ?áŠ4d?á‹QÏ?áAºDx?áA¿P¼?áŽséøeŸ?áŽsï ¾?ᦜ‹Æ?ᦧ÷¿?áŒØI1 N?áŒØNÜŽºÇ?á>Ü“¯Žš?á>Ã1ª*?á>È&6?á=@÷Ñ+?á=@üÅn^?á‰r?á,_qª¶r?á,_vš-°?á+‘ªZY6?á+‘¯I•P?á*Ãã?F?á*Ãè.G ?á)ö\êX?á)ö!K°,?á)(U´cš?á)(Z¢îK?á(ZCle?á(Z”1»ó?á'ŒÉ ?á'ŒÍø•j?á&¿ 4Ä?á&¿ø ?á%ñ=C m?á%ñB0¨’?á%#wµ„™?á%#|¢çš?á$U²b)#?á$U·OQ?á#‡íIzƒ?á#‡ò6g??á"º(lº?á"º-X³T?á!ìcÊD`?á!ìh¶º×?á!ŸdÇ÷?á!¤QK?á PÛ<?á Pà(8?áƒP“Ò?ძ?àñ´T[Ù–?àðæ^Ô˜?àðæ¢=4f?àðëŸ)ò?àðð}N£?àïK:>Ò?àïK?»—?àî}‰>V+?àî}Ž¢?àí¯Øž%Ž?àí¯Ý{˜è?àìâ(^Ïè?àìâ-<%?àìx€Ô“?àì}]Ñ´?àëFɹL?àëFÍá{P?àêyëÉ?àêyÇŠ°?àé«k7®?àé«pÍy?àèݼëXš?àèÝÁÇiI?àèåá?àèß»t?àçBa®¼?àçBf]I3?àæt´e5?àæt¹@”_?à姯 ?àå§ Š%H?àäÙ[_”~?àäÙ`:}¢?àä ¯wju?àä ´R}?àã>÷Æ?àã>ч²?àâpXß\?àâp]¹F-?à᢮/ÕP?àᢳ Ò?ààÕéô°?ààÕöK?ààZ ç$?àà^çm¤?àß9°œ4O?àß9µu´?àÞl•]7?àÞl nm?àÝž^ùì’?àÝžcÒÁÂ?àÜжͺ$?àÜл¦T:?àÜô$?àÜêS?àÛ5gÃë¿?àÛ5lœ ?àÚgÀäç?àÚgż®?àÙšs Ë?àÙšJ¹x?àØÌtq>²?àØÌyH±E?à×þÎß3Û?à×þÓ¶kT?à×1)½qè?à×1.”nH?àÖc… j?àÖc‰ã@°?àÕ•àÌÜX?àÕ•å£b…?àÔÈ<ÿU?àÔÈAÕPh?àÓú™£€°?àÓúžy«?àÓ,öºÇ ?àÓ,ûœ‚?àÒ_TEmJ?àÒ_Y?àÑ‘²Cíû?àÑ‘·L«?àÐĶÉ+?àÐÄ‹ìÃ?àÏöo¡ð?àÏötvÙ?àÏ(Ï”a?àÏ(ÓÛAÇ?àÎ[.áðF?àÎ[3¶b•?àÍ4†‰?àÍ”½¿?àÌ¿ïþÜ“?àÌ¿ôÒز?àËòQAt}?àËòV5„?àË$²üÍ ?àË$·ÐRú?àÊW1kh?àÊW¶@?àɉwßÊï?àɉ|²Ú¯?àÈ»ÛzZ?àÈ»ßÛO?àÇî>«ñž?àÇîC~‹0?àÇ ¢Ê¯?àÇ § Š?àÆSe:­?àÆS 7^?àÅ…l|¢?àÅ…qNð?àÄ·ÒËË?àÄ·Öáy?àÃê8 ×?àÃê<òI??àÞ³9X?àã„pb?àÂOÈâ?àÂO ™Ö?àÁm\µÍ?àÁr-v¬?àÀ³Õq‡©?àÀ³ÚB q?à¿æ> õ?à¿æB×X¨?࿧ÏÌ?à¿«íßj?à¾K¶T6?à¾K†(¾?à½}zÑ÷?à½} «j?༯ån“)?༯ê=ñ‡?à»âPTÙ?à»âU^x"?໼3×E?à»Á¿y?àºG(\É?àºG-+Jé?à¹y• .ê?à¹y™Ø õ?ฬ<ý¶?ฬ 4­?à·Þoõ ¬?à·ÞtÃœ?à·Þ4ì?à·ãNº?à¶CLýܸ?à¶CQËbr?àµu¼R·R?àµuÁ ù?à´¨,0Fc?à´¨0ýU÷?à³Úœ–ÿ˜?à³Ú¡cÔ?à³ ‡o"?à³ T?à²? ‡?à²?ƒÎhá?à±qñ]Ë?à±qõÓ?à°¤c—á„?à°¤hcɸ?à¯ÖÖ´!?à¯ÖÛβ?௠J\–R?௠O(a?à®;¾‘ÈF?à®;Ã\ÿC?à­n3T2â?à­n8.Í?ଠ¨¤TÁ?ଠ­o™?à«Ó‚¶?à«Ó#M;å?à«”ïÒ-?à«™ºâ?àª8 ì*Š?àª8¶:.?à©jƒ{ëÐ?à©jˆEÀb?ਜû Kº?à¨iå;?à§ÏtVH'?à§Ïy¦—?à§ížké?à§ògH?à¦4gy>…?à¦4lB&Ô?à¥fáç0Þ?à¥fæ¯Þ?ङ\èп?ङa±Bí?à£ËØ~˜‰?à£ËÝFϦ?à¢þT© 1?à¢þYq??à¢0Ñh¥ò?à¢0Ö0fï?à¡cN½ð?à¡cS…uò?à •Ì©g­?à •Ñp²‹?àŸÈK+?àŸÈOò \?àžúÊDáQ?àžúÏ ¶?àž-IõãÛ?àž-N¼}Œ?à_Ê?Œ?à_Ïz.?àœ’K$¶’?àœ’OêÚ%?à›Ä̧åô?à›ÄÑmÎy?àš÷Nųÿ?àš÷S‹au?àš)Ñ~ i?àš)ÖDÒ?à™\TÓ!9?à™\Y˜X“?à˜ŽØÃÂÚ?à˜ŽÝˆ¿&?à—Á]Q?à—ÁbÂÏ?à–óâ{S?à–óç?ÙQ?à–&hCFê?à–&m’?à•Xî©Xõ?à•Xómi ?à”‹u®d?à”‹zqÝo?à“½ýQÚ·?à“¾tµ?à’ð…•H|?à’ðŠX§m?à’#xÊ2?à’#;î?à‘U—üñê?à‘Uœ¿ÚÃ?àˆ"">]?àˆ&äì)?ຬìëÜ?ັ¯^?àŽí8^0F?àŽí= gû?àŽÄs‚?àŽÉ4ÿ,?àRQ+ݪ?àRUíŸH?àŒ„Þ‰Fh?àŒ„ãJÌû?à‹·l‹·°?à‹·qM9?àŠéû3µ÷?àŠéÿôÆu?àŠŠÂx?àŠB—ì?à‰Ov[?à‰O6õ|?àˆ«ý¢?àˆ¯Ò]?à‡´?à†æÓ]‰?à†`Ô=$?à†e“ëf?à…KôA?à…KøІy?à„~‡÷w.?à„~Œ¶¯\?àƒ±‡ã?àƒ±!Fà7?à‚ã±Æ­¢?à‚㶅o¿?à‚Gµí?à‚LsŸ?àHÞOõò?àHãAþ?à€{u—Ô–?à€{zUåš?à® -‚?à®K}?à~à¦0w?à~àªî?à~?‚=ì?à~D?Ø?à}EÙ‚þª?à}EÞ@#?à|xt35Ì?à|xxðª?à{«“f#?à{«Pù?àzÝ«¤n?àzÝ°`†=?àzHe°Š?àzM!éS?àyBåØÉl?àyBê”Ç/?àxuƒýÜ\?àxuˆ¹Ÿ?àw¨"Õb0?àw¨'éæ?àvÚÂ_àe?àvÚÇ-?àv b¡·Á?àv g\Él?àu@œå?àu@VñŠ?àtr¥Kçû?àtrªƒ›?às¥G±Ä?às¥Lkþ_?àr×êÍ´€?àr×ï‡Ú?àr Ž ±?àr “Z›°?àq=3+M?àq=7äÄÚ?àpoØmR°?àpoÝ&Ç9?ào¢~gúµ?ào¢ƒ!4:?ànÕ%…:?ànÕ)Ôƒ¼?àn̈p^?ànÑA3Û?àm:t¯CÄ?àm:ygÌ>?àlmsÙ?àlm"HÁP?àkŸÇ,~…?àkŸËäù?àjÒqƒçñ?àjÒv;¿c?àj—4;?àj!NЪ?ài7ÈjÇo?ài7Í"(Û?àhjtÿëæ?àhjy·P?àg"S`÷?àg' L_?àfÏÐe£ù?àfÏÕT`?àf721?àfƒí§–?àe5.È’V?àe53~̺?àdgß>R?àdgãÐ=µ?àcš,³*?àcš”âwŒ?àbÍBt&?àbÍFµýˆ?àaÿô•úõ?àaÿùKIW?àa2§íÍã?àa2¬¢áD?à`e\lÉ?à`e`½E*?à_˜æJ¼?à_˜šè?à^ÊƇðö?à^ÊËGD?àCˆ¾– x?àCˆÃB˜s?àB»u±¬?àB»•"¯?àAîc1¶®?àAîgÝͺ?àA!6Æ¿L?àA!;r›a?à@T 5A¤?à@TàâÂ?à?†à}½9?à?†å)#a?à>¹¶ ´š?à>¹»KßÌ?à=ìž—b?à=ì’I‡ž?à=ewô?à=j"©×?à-AÜ?àqwÀ?à$IC Ä?à#|2ë Ê?à#|7Žbà?à"¯(RG,?à"¯,õcU?à!⧩s?à!â#JŠ°?à!ëµ6?à!Ž[†?à HÚ0?à HÁE”?à{A¡?à{ ãÑŠ?à®T‚Ð?à®öx[?ààüWûl?àáù¶ ?àøL?àüî Ê?àFõ6í?àFùØ1ç?àyóið?ày÷¹sÏ?à¬ñíx?à¬öŽFý?àßñ¶™??àßöW-J?àòtI?à÷¢8?àEô'?àEøÇ$S?àxöÏH„?àxûo+Ñ?à«úm‹“?à«ÿ 3÷?àÞÿSÕ?àß¡ÁP?àŽ%?à -H¸?àE Vâ?àE°NŒ?àxŒŠ¿?àx+G‚?à«9?à«žºí?àÞ$lÖb?àÞ) V?à.Òæ»?à3pòÈ?àD:2Û_?àD>Ь…?àwF‘†j?àwK/©?àªSð*È?àªX†!?à ÝbK=K?à Ýfè]½?à q£5?à v@¥?à Cø•¼?à C†•@c?à v“KÖ6?à v—èEù?à ©¥vÌ?à ©ª9«ª?à ܸíîP?à ܽ‰èI?à Í=À?à ÑÙ?àBâe£?àBç(éÔ?àuøÝ\ ?àuýx¥W?à©.ž?à©É%?àÜ(€{?àÜ-ò?àAÓð6?àFnˆÙ?àB\)þõ?àB`Ä\¶?àuw‚Ía?àu|ð@?ਓã*½?ਘ}¹?àÛ±LdG?àÛµæb?àϺÜÂ?àÔTNü?àAï/„?àAóÈMÜ?ßþêSl?ßþê(…[?ßýPbUIÉ?ßýPk†Ì÷?ßû¶§eï?ßû¶°–üs?ßúî…õæ?ßú÷¶”?ßøƒ7¶O“?ßøƒ@æq?ßöé‚÷í?ßöéŒ'™6?ßõOÐKÑ´?ßõOÙ{&?ßó¶²úÀ?ßó¶(á»t?ßòq.X¡?ßòz\£™?ßð‚ľ۰?ßð‚Íì°ë?ßîée†Â?ßîé#’æB?ßíOr#P ?ßíO{P9Ï?ßëµÌâš?ßëµÕ.V¥?ßê(í7?ßê1/ë‡?ß肆"”?ßè‚M§+?ßæèæ]lF?ßæèïˆ%?ßåOH¶Ñö?ßåOQáo?ßãµ­/Dè?ß㵶YlW?ßâÇ­Ò?ßâñ_Š?ßà‚|v?ßà‚…ªVy?ßÞèç\ž?ßÞèð…Eë?ßÝOTZ˸?ßÝO]ƒP?ßÛµÃ|ÿž?ß۵̤Ú?ßÚ4Äœ?ßÚ=ëtÌ?ßØ‚¨0ãz?ßØ‚±WÒ÷?ßÖéćï?ßÖé&ë¹?ßÕO•÷?ßÕOž¥û?ßÓ¶dË?ßÓ¶‰ 2?ßÒ‹z­á?ßÒ”ŸÆ˜?ßЃ ÆoO?ßЃëV?ßÎéŠ?ôÝ?ßÎé“d"5?ßÍP è7É?ßÍP ïr?ß˶‘À1?ß˶šãs?ßÊÈÍp?ßÊ!뙽?ßȃ¢Î?ßȃ«%hn?ßÆê-oäP?ßÆê6‘ÅD?ßÅP»I°?ßÅPÄ1´ø?ß÷Jå4?ß÷T)¢?ßÂÜ?ßÂæ!‹?ßÀ„q0}ô?ßÀ„zPˆ=?ß¾ë¨Àä?ß¾ëÈU„?ß½Q Yb?ß½Q©x€ù?ß»¸;C^è?ß»¸Db8?ߺØg¨´?ߺá…Ü]?߸…wÐð?߸…€íÝó?߶ìj?߶ì"œ²w?ßµR½n t?ßµRÆŠÝ,?ß³¹c 5?ß³¹l¹gI?ß² MS?ß² )4Ã?ß°†¶¿Ð^?ß°†¿ÛB*?ß®ícµ‰ˆ?ß®ílÐ…±?ß­Tïu?ß­T ûˆ?ß«ºÄn‚z?ß«ºÍˆ“`?ߪ!x3´?ߪ!MOL?ߨˆ.?æ„?ߨˆ7Y *?ߦîæ”!Õ?ߦîï¬ÑÛ?ߥU¡1g‚?ߥUªI¡ê?ߣ¼^“ù?ߣ¼g0XÃ?ߢ#J®š?ߢ#&aýÆ?ß ‰ÞÈ¥ù?ß ‰ç߉?ßžð¢œjò?ßžð«²Îæ?ßWhȪ’?ßWqÞ˜ë?ß›¾1EÙ­?ß›¾:[Rk?ßš$üò‹?ßš%)õ¯?ߘ‹É6é0?ߘ‹ÒKv»?ß–ò˜¬±p?ß–ò¡ÀÉb?ß•Yjw8Ð?ß•YsŠÛ*?ß“À>—ˆ]?ß“ÀGªµ?ß’'Z?ß’'!G†?ßíÝ:¾?ßöï|T?ߎôɉï?ߎôÒUð?ß[¦…j£?ß[¯–Á?ߋ†`Ò¦?ß‹Âq³~?ߊ)h—ÀÊ?ߊ)q¨,?߈M+$b?߈V;?߆÷4ò°?߆÷=+rÑ?ß…^t,8?ß…^&ƒ6È?߃Š6‚f?߃ÅEe?ß‚+÷[Oï?ß‚,io_?߀’çã˜î?߀’ðñBÎ?ß~ùÚÐKÊ?ß~ùãÝ€?ß}`Ð"\ë?ß}`Ù/®?ß{ÇÇÚƸ?ß{ÇÐçï?ßz.Áút?ßz.ËG²?ßx•¾‚^ð?ßx•Ç½?ßvü½sP?ßvüÆ~iä?ßuc¾ÎÎÇ?ßucÇÙAÑ?ßsÊ•7¬?ßsÊËŸ5,?ßr1ÈǸ€?ßr1ÑÑ@w?ßp˜ÑgAC?ßp˜ÚpS²?ßnÿÜtÁæ?ßnÿå}^Í?ßmféñ9i?ßmfòù`Ê?ßkÍùæ±?ßkÎîbö?ßj5 WØi?ßj5_½?ßhœ!= _?ßhœ*CÓ/?ßg8—?>?ßgAŠ?ßejRgc?ßej[m>à?ßcÑn®s?ßcÑw³ÙN?ßb8mZ¬?ßb8–rKp?ß`Ÿ®¥»?ß`Ÿ·©‰þ?ß_ÒVŒØ?ß_ÛZ’š?ß]mø‚ÉV?ß]n†Y™?ß[Õ!*©?ß[Õ*-Ãâ?ßZ¢•?ß8µ¾.Ç?ß8µ&·1X?ß7€Ö?ß7‰Î”(?ß5ƒæ„ì ?ß5ƒï}¿?ß3ëNËË2?ß3ëWÃm{?ß2R¹«£ó?ß2R¢ÐÐ?ß0º'%Z6?ß0º0§?ß/!—9ê?ß/! 0,?ß-‰ êLc?ß-‰à?ß+ð7g¦?ß+ðˆ,¾Ú?ß*W÷"7t?ß*X@?ß(¿q«±&?ß(¿z Š?ß'&îÔÀ×?ß'&÷È·Õ?ß%Žnž^‘?ß%Žw‘à)?ß#õñ =?ß#õùü‹p?ß"]vw?ß"] ¨E?ß ÄýÈ Û?ß Åº.E?ß,ˆ&©L?ß,‘UT?ß”5¥?ß”&ÛÃ?ßû¤í!ï?ßû­Ýã3?ßc7Nî?ßc@>hÑ?ßÊÌY}Ñ?ßÊÕITT?ß2d8Z?ß2lÿ™?ß™þsI8?ßšb4þ?ß›ƒ‘“?ߤrû?ßi;Bê?ßiD0õ?ßÐݯÉE?ßÐæTõ?ß8‚Ív?ß8‹º¥Ê?ß  *œeT?ß  3‰N?ß Õ=‚?ß Þ i#?ß o‚Q j?ß o‹<À±?ß×28µD?ß×;#ö3?ß>äÕíÀè?ߦš0æŽ?ߦ£<Ð?ßRNrü?ß[8Sç?ßv %õì?ßva‚?ßÝʸZð?ßÝÓ¡Q2?ÞÿE‹¢¨?ÞÿE“ï#—?Þý­N¸V?Þý­VùÃò?ÞüÚ,?ÞüÂ#w?Þú|Üb*?Þú|åI9#?Þø䧩G,?Þøä°òÕ?Þ÷Lu±Ú?Þ÷L~—>4?Þõ´FzYÖ?Þõ´O`á?Þô*x?Þô"ëv5?ÞòƒðUcè?Þòƒù::X?ÞðëÉhü??ÞðëÒM]c?ÞïS¥Aìv?ÞïS®%ØN?Þí»ƒá2?Þí»ŒÄ”¿?Þì#ePìü?Þì#n3î@?Þê‹I”b?Þê‹Rv§\?Þèó0¢®?Þèó9„Ä·?Þç[}”?Þç[#_5‰?ÞåÃ%Èç?ÞåÃõ ?Þä*öœ5:?Þä*ÿ|ì?Þâ’èáÐó?Þâ’ñÂŒ?ÞàúÝ÷Š°?Þàúæ×W?ÞßbÕÞPä?ÞßbÞ½§ö?ÞÝÊЗ ö?ÞÝÊÙvÄ?ÞÜ2Î"ã?ÞÜ2×O‘?Þښ΂þ?ÞÚš×`yJ?ÞÙѶúÖ?ÞÙÚ”|â?Þ×j×ÁA5?Þ×jàžN?ÞÕÒà¢?ÞÊ«oÉ?ÞÊ«wö+ý?ÞÉŽõÄü?ÞÉ—β²?ÞÇ{±°K2?ÞÇ{ºˆÃ±?ÞÅã×MDÆ?ÞÅãà%H?ÞÄKÿÍ£®?ÞÄL¥1Á?Þ´+2\º?Þ´4 u™?ÞÁY|^’?ÞÁbS>?Þ¿„Š¬—¨?Þ¿„“‚Æ ?Þ½ì¾ÃüZ?Þ½ìÇ™µ ?Þ¼TõÃ}Î?Þ¼Tþ˜Áã?Þº½/¬?Þº½8€Þë?Þ¹%lˆH?Þ¹%u\sý?Þ·¬Zhã?Þ·µ.Mi?Þµõïï/?Þµõ÷î^‡?Þ´^4ÊŽ¼?Þ´^=ˆç?Þ²Æ}jFú?޲Ɔ<Ëù?Þ±.Èû$?Þ±.ÑÍ÷?Þ¯—}­R?Þ¯— OGú?Þ­ÿhóAp?Þ­ÿqÄfï?Þ¬g½\®F?Þ¬gÆ-^œ?ުкÚx?ުЋ¥?Þ©8oÁo?Þ©8wÞ‡v?Þ§ ÌYO?Þ§ Õ( `?Þ¦ ,›vÊ?Þ¦ 5jR…?Þ¤qÖ&N?Þ¤q˜¤Œå?Þ¢Ùö O×?Þ¢ÙþØAJ?Þ¡B_8Ü?Þ¡BhXc?ÞŸªËlP¬?ÞŸªÔ9WÚ?Þž:§w'?ÞžCt 3?Þœ{¬â&7?Þœ{µ®C$?Þšä"X?Þšä*èÿÝ?Þ™LšYýË?Þ™L£%0y?Þ—µ˜ÿT?Þ—µc¼å?Þ–“ÛSl?Þ–œ¥›à?Þ”†!çª?Þ”†ë»?Þ’î™m©‡?Þ’î¢7Ã?Þ‘W ¿B?Þ‘W)ˆxe?Þ¿«†?Þ¿³àú ?ÞŽ(8ywÀ?ÞŽ(AAv°?ÞŒÈã]D?ތѪç?ÞŠù\W&8?ÞŠùe:ú?Þ‰aòÕ¹?Þ‰aûœXÊ?އʌ` F?އʕ&5Þ?Þ†3)ªþ?Þ†31Æ`?Þ„›ÈºUõ?Þ„›Ñ–e?Þƒk„äÝ?ÞƒtI°;?ÞmaOž?Þm%¥ê?ÞÕºPú?ÞÕÃc6?Þ~>fSg•?Þ~>oÓÁ?Þ|§j÷Ô?Þ|§-îñ?Þ{ǘ ?Þ{ÐZš?Þyx|ÛÈH?Þyx…ÕJ?Þwá56ç”?Þwá=øŠ?ÞvIðªl¸?ÞvIùk¢?Þt²¯7Ea?Þt²·÷óA?ÞspÞb?ÞsyžšÙ?Þq„5 ²ð?Þq„>`v¾?Þoìý.V?Þoí>}?ÞnUÈzµF?ÞnUÑ9?Þl¾–Û.?Þl¾Ÿ\?è?Þk'gëoš?Þk'p©_O?Þi<[>ë?ÞiE¹œ?Þgùî8¼?Þgù«>i?Þfaî¥O~?Þfa÷aà*?ÞdÊÌl†?ÞdÊÕ=ˆ0?Þc3­ƒ~ú?Þc3¶?%¤?Þaœ‘¬xÊ?Þaœšgªt?Þ`xýHÎ?Þ`¸y?Þ^ncvÔÆ?Þ^nl1t?Þ\×Q ?Þ\×YÓòº?Þ[@Aè ?Þ[@J¡j¹?ÞY©5áƒú?ÞY©>šl³?ÞX-~Ú?ÞX5¿òš?ÞV{'Zî‚?ÞV{0íI?ÞTä$ܺ´?ÞTä-”D‚?ÞSM%—~G?ÞSM.N“?ÞQ¶)Ž ?ÞQ¶2D«}?ÞP0¸x?ÞP9nHc?ÞNˆ;§&?ÞNˆCÌ]?ÞLñHª•Î?ÞLñQ_ÖÑ?ÞKZYtÙn?ÞKZb)¥~?ÞIÃmv^ê?ÞIÃv*¶?ÞH,„°í?ÞH,cû?ÞF•Ÿ"ñ?ÞF•§Ö^D?ÞDþ¼ÏÓš?ÞDþÅ‚Ëè?ÞCgÝ·µÔ?ÞCgæj94?ÞAÑÛƒÆ?ÞAÑ ’9?Þ@:)<)e?Þ@:1íÂì?Þ>£SÚžN?Þ>£\‹Âê?Þ= ·È0?Þ= Šhwá?Þ;u²Ô˜s?Þ;u»„Ó:?Þ9Þç;³ ?Þ9Þïëy?Þ8Hïà ?Þ8H'Ÿ1?Þ6±YèÜ@?Þ6±b—¸R?Þ5˜'™D?Þ5 Öp?Þ3ƒÙ­?Þ3ƒâZ÷K?Þ1íz 6?Þ1í''Š™?Þ0Vf™ƒ?Þ0Vo<¢?Þ.¿±îšR?Þ.¿º›-ñ?Þ-)—ÿä?Þ-) D¢?Þ+’RŒºD?Þ+’[8d"?Þ)û§Í¹a?Þ)û°xî_?Þ(e[ç?Þ(e §3?Þ&Î\85ì?Þ&Îdâ/?Þ%7»co?Þ%7Ä eÖ?Þ#¡Þßõ?Þ#¡&ˆA?Þ" ƒ«‰?Þ" ŒT :?Þ sìÒç?Þ sõ{^ß?ÞÝYYC?ÞÝbC?ÞFÉ5RN?ÞFÑÜàv?Þ°—Œd?Þ’À¡vb?Þ’ÉE]ò?ÞüN®/ÿ?ÞüWQ¢À?Þ eà;u?Þ eè½9h?Þ Ïtæ—±?Þ Ï}‰ ×?Þ 9 +Ü?Þ 9¶@6?Þ¢¨£Ûû?Þ¢±E{Š?Þ G j?Þ PA”Õ?Þuê žœ?Þuò­T™?Þßà!?Þߘ€b8?ÞI9ÝÜ?ÞIA»ªJ?Þ²åÀÄy?Þ²î`!?Ýÿ•ÏÇ ?Ýÿžn©î?Ýý†IIΪ?Ýý†Qè<É?Ýûð/ÊB?ÝûðÍÞ?ÝúYº‚Ÿ·?ÝúYà $Q?ÝøÃxCFp?ÝøÀàVI?Ý÷-9r¦ó?Ý÷-BB ?Ýõ–þ²r?Ýõ—­ØÌ?ÝôÆ!Q%?ÝôνÁ?Ýòj‘¢n?Ýòjš=ªï?ÝðÔ`•üâ?ÝðÔi0Å?Ýï>2üèA?Ýï>;—;©?Ýí¨áåf?Ýí¨{Ä?ÝìâGÅ?Ýìêá/ ?Ýê{¿&.|?Ýê{Ç¿#¹?ÝèåŸ~Ú?Ýèå¨`?ÝçOƒPPj?ÝçO‹è\9?Ýå¹jã?Ýå¹s5z2?Ýä#Ug°Ñ?Ýä#]þÓ7?ÝâC®£P?ÝâLEQ?Ýà÷5s¬þ?Ýà÷> åÿ?Ýßa*·½-?Ýßa3M}?ÝÝË#{´X?ÝÝË,ø?ÝÜ5À8?ÝÜ5(Uh)?ÝÚŸ‡*ê?ÝÚŸ(‘,?ÝÙ "Ð|?ÝÙ +dm´?Ý×s)oX?Ý×s20ìB?ÝÕÝ3îð?ÝÕÝ<øM?ÝÔGAÏÀ?ÝÔGJbT%?ÝÒ±SB®?ÝÒ±[ÔÍ ?ÝÑh?QZ?ÝÑpÐû?ÝÏ…€Æ›Q?ÝÏ…‰WÐî?ÝÍïœÙvî?ÝÍï¥j7å?ÝÌY¼x×Û?ÝÌYÅ $-?ÝÊÃߥ¢Þ?ÝÊÃè5zŒ?ÝÉ.`€?ÝÉ.ð%Œ?Ýǘ0«,Ì?Ýǘ9:6?ÝÆ^…Ã4?ÝÆg<ý?ÝÄlñuš?ÝÄl˜zÃ?ÝÂÖÄï6±?ÝÂÖÍ|Çlœ.?Ý>t[µò?ݪL.ì?ݪTbÔŒ?Ý0f?Ý8t˜ ?Ý‚8-â?Ý‚ ‘ë=?Ý îbkN?Ý î »´‰?Ý Yôš Ì?Ý Yüòßè?Ý Åèéæ'?Ý ÅñBG$?Ý1áTÔâ?Ý1é¬ÁÂ?ÝÝÒO.?Ýæ)Çò?Ý Þc@Ð?Ý æºEy?Ýuã‘?Ýuë_!¨?ÝáëÃ(ž?ÝáôE?ÝMø“ñ@?ÝN陡?Üþº {Ô¿?ÜþºÑ ?Üý&{Àö?Üý&&Ð,?Üû’7”™–?Üû’?èå¸?ÜùþTÇIP?Üùþ]!`?Üøjv¹G?Üøj~hF?ÜöÖ›}Ðý?ÜöÖ£ÐÀë?ÜõBÅyB?ÜõBÍUõ"?Üó®ò¦¡î?Üó®úø©À?Üò$h-Â?Üò,¹Á‡?Üð‡ZR÷?Üð‡b¤Ö?Üîó”iØa?Üî󜺄?Üí_Ò¤J¥?Üí_Úô‚L?ÜëÌ/?ÜëÌRò»?Üê8[‡v†?Üê8cÖÆ?Ü褦2 X?Ü褮€åë?ÜçõÏ?ÜçýR7?Üå}Gý°Æ?Üå}PK¤R?ÜãéŸ –ô?Üãé§n~?ÜâUúmh?ÜâVºs¦?ÜàÂYå?ÜàÂb1«¡?Üß.½ˆ?Üß.ÅÔ¢¦?ÜÝ›%X"?ÜÝ›-¤?°?ÜÜ‘V0Ö?ÜÜ™¡li?ÜÚt‚O?ÜÚt Íš?ÜØàuÝËm?ÜØà~( ?Ü×Lîs„Ù?Ü×Lö½d€?ÜÕ¹kFV×?ÜÕ¹s‡?ÜÔ%ìM³}?ÜÔ%ô–«7?ÜÒ’qŠƒø?ÜÒ’yÓ¾?ÜÐþúý´2?ÜÐÿEÄ?ÜÏkˆ¨'R?ÜÏkïÃ2?ÜÍØŠËÑ?ÜÍØ"ÑóÀ?ÜÌD°¦‡d?ÜÌD¸í;d?ÜʱJüA?ÜʱSB#?ÜÉéŒãø?ÜÉñÒ°?ÜÇŠŒYX:?ÜÇŠ”ž°r?ÜÅ÷3b…Ï?ÜÅ÷;§j?ÜÄcÞ©Uø?ÜÄcæíÆ[?ÜÂÐŽ.°f?ÜÂЖr¬à?ÜÁ=Aó{(?ÜÁ=J7»?Ü¿©ùø£T?Ü¿ª;¸?ܾ¶I ?ܾ¾‹ Ò?ܼƒvçiÂ?ܼƒ)–§?ܺð;ËWs?ܺðD v?ܹ]õ±½?ܹ] 6öß?Ü·ÉÒg_»?Ü·ÉÚ¨0ý?ܶ6¤!L?ܶ6¬a©ó?Ü´£z$_ ?Ü´£‚dH‘?ܳTq}¾?ܳ\°óh?ܱ}3 “n?ܱ};H•=?ܯêí†f?ܯê,\?Ü®Vý?ª?Ü®W\YÈ?ܬÃ蜦ž?ܬÃðÚLä?Ü«0Øi¦Ø?Ü«0à¦ÙH?ܩ̆#,?Ü©ÔÂáÈ?ܨ Äóp?ܨ Í/P8?ܦwÁ±:+?ܦwÉí!?ܤäÂË‘¾?ܤäËôã?Ü£QÈDët?Ü£QÐÚÉ?Ü¡¾Ò½ñ?Ü¡¾ÚO9x?Ü +à;í?Ü +èuôÌ?Üž˜ò»b-?Üž˜úôö?Ü ”‰?ÜÍ&¬?Ü›s$ƾî?Ü›s,ÿkH?Ü™àDTw"?Ü™àLŒ¯³?ܘMh>|?ܘMpuÛFhealpy-1.8.1/healpy/data/pixel_window_n0032.fits0000650000175000017530000002070011705033043022016 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 129 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 32 / Resolution parameter for HEALPIX MAX-LPOL= 128 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 32 COMMENT for multipoles in range [0, 128] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð?ïÿA4¨i?ïýç@h?ïÿA6,­1?ïû‡o´ý?ïýè~§?ïøŒ®›¶?ïú ãèì?ïôÓ1ã?ïöPÆ›aÙ?ïð\K¸ß…?ïñÙUéÎ?ïë'#x ƒ?ïì£ú8Ä?ïå4d°!”?ïæ±eÊ/?ïÞ„g˜Å?ïàÁY?ï×S¹M?ïØ“ŸC”±?ïÎîIëŒ?ïÐj Áu?ïÆ Aç{?ïÇ„w?¶Û?ï¼hfk?ï½ãm§âT?ï² Ù³ó?ﳇz¸PÉ?ï¦÷o¦´?ï¨q7¡ÀŽ?ï›'Šä?H=½:?ÿnÐ?ïZÿǨ?ï^j7–Í?ï‚×(å‹ó?ïsfA'I?ïtÞuf'·?ïd·k¦À??ïf/`‚À?ïURÁái¾?ïVÉ̼Ý?ïE9&E)ç?ïF¯Ô³%?ï4k…lV?ï5áIgŸy?ï"êÖ {?ï$_ì|Õ?ï¸Ñ™ ?ï,zÑ3?îýÔXaž|?îÿGÿ6U?îê@©+x¾?îë³­úU?îÕþ)Z„h?î×pDæ­}?îÁº«÷?îÂLŽú¯?î«q`žT?î¬áÖí?î•)ƒÂx?î–™Îô?î~7®2ïì?î¦bÇE€?îf-/ßà?îh ÷x¡H?îN[W øÅ?îOÈ0ƒsz?î5s‹X¢?î6ßm?—Ç?îç1l6:?îRÝS@?î·ºíM?î!›E¿4?íææ¡ ™×?íèOvú„B?íËueµkø?íÌÝ*ôês?í¯e“(Ïì?í°ÌA„Bb?í’¸»ÛWé?í”M+¬a?íupzRG+?ívÔèBs?íWŽq$~?íXñ¶©U?í9J ¹i?í:v_û'?í·”‚1?íd˜^•?ìú^r»””?ìû¾›>Y?ìÚ&?êà-¢+Y3?ê¶ò«\K?ê¸;¼ý@…?ꎎØé·?êÖV„p:?êe¹¯~ã?êfÿ”|nê?êGXv?ïùÙŠk@V?ïùÞÚé•5?ïùw8ä/l?ïù|‰R-?ïùØÊu1?ïù)'™?ïø©’{Ot?ïø®âÇD?ïø>?*s?ïøCdØ?ï÷ÐÁG?ï÷ÕT·h¹?ï÷^¾Ym ?ï÷dn@ö?ïöêðc>?ïöïßñçõ?ïösW0‡Û?ïöx§<?ïõù5wRM?ïõþ…Pº?ïõ| ‘œÌ?ïõZV7?ïôûö ?ïõE¸PÓ?ïôxÙg’Ø?ïô~)?ïóòÒ”vN?ïóø"¶?ïóiĨê¡?ïóoc?ïòÝÌ&@?ïòãg[X?ïòNÍT®?ïòT’?ïñ¼ã†¯à?ïñÂ2«à®?ïñ'ôu¿Å?ïñ-C‚/Õ?ïðDÌ?ïð•hówæ?ïïõ; M†?ïïú‰ùÃJ?ïïWp—iK?ïï\¿V¥u?ïs©?ïî»ñ+f?ïîèpj³?ïî6ù¶ä?ïíl+™Üd?ïíqzrV?ï삺Od?ïìÇÑ ²Ä?ïì×Ç¡Ã?ïì%üR“?ïëf@®I?ïëkŽÅš3?ï골?ïÕ‡X¥T´?ïÔ‚¨D°?ïÔ‡òŽS¨?ïÓ€WÞ+?ïÓ…¡üà?ïÒ{]C@?ïÒ€YP‹U?ïÑrÜ®¸þ?ïÑx&v%?ïÐg²‹|%?ïÐlü&t'?ïÏYž‹¥?ïÏ^çù‰?ïÎH“¼'æ?ïÎMÜüÛ?ïÍ4ŸeE7?ïÍ9èx¿?ïÌ´çY?ïÌ"ýË€½?ïËá:ºÂ?ïË )ð_(?ïÉçƒ?ïÉì`•l?ïÈÇf¬-?ïÈÌ®j+?ïǤ¿B6?ïǪhfs?ïÆ0²?ïÆ„wø€ã?ïÅV¬˜jÎ?ïÅ[ô\‰#?ïÄ+A&Ú¢?ïÄ0ˆ¹5r?ïÂüâ4ù°?ïÃ)•k?ïÁË›§#?ïÁÐâÔ€+?ïÀ—bEöˆ?ïÀœ©@v?ï¿`A·g\?ï¿eˆ}Ô§?ï¾&/ìÀ?ï¾+u–'?ï¼é5•£\?ï¼î{ó/@?ﻩJ²[T?ï»®Ú»’?ïºfyŠÄÁ?ïºk¿}}û?ï¹ ·ŸšÚ?ï¹%ý\/õ?ï·Øê?ï·ÝUpÄ?ﶌx$Yö?﶑½s3A?ïµ=û°äå?ï£8®Qa?ï£=ðiç ?ï¡Á~Ð` ?ï¡ÆÀªŠé?ï Geû”?ï L¦³O.?ïžÊjd?ïŠoèÕ}Ø?ïˆÅJiÀž?ïˆÊˆÝÀ?ï‡ÐE?ï‡"C„i÷?ï…qæ(‹?ï…w#N(*?ïƒÃã.–…?ïƒÉ »R?ï‚Ms?ï‚Aã§?ï€_E8ež?ï€d†-?ï~¨ªõi?ï~­æúK›?ï|ï/WI?ï|ôkË$?ï{2ÚGgX?ï{8¹K?ïys¤·¹Ö?ïyxßß7?ïw±–u`ü?ïw¶ÑQé®?ïuì¨]“?ïuñã!ŸS?ït$âºýÎ?ït* ?ïrZ>"½ð?ïr_x´?ïpŒÂ_Ü?ïp‘ü —¹?ïn¼hºSÎ?ïnÁ¢»Ë?ïlé8²4V?ïlîqÃö¹?ïk+­Z?ïkdp½P?ïi:I•Š?ïi?„ {?ïg^Š[\?ïgcÂUG?ïeöÜ|?ïe….²ë6?ïcžˆ/®Ì?ïc£¿¶7?ïaºEˆÓì?ïa¿|¾ÃW?ï_Ó(žºÀ?ï_Ø_ƒ´Ì?ï]é8ŽSã?ï]îo!à_?ï[üo'î0?ï\¥i“å?ïZ ÓqyÔ?ïZ `À¶?ïX_T§?ïX”ñ?ïV%Á?ïV*O /T?ïT,ü¸ƒ¨?ïT21­Ú*?ïR2s¾?ïR7C¶‰Ê?ïP4Jñ ?ïP9=Ûã?ïN3·¦k?ïN8ëÒo?ïL0M§dâ?ïL5Hç{?ïJ*bð?ïJ/H®QÇ?ïH!Œ\?ïH&;WÃ?ïF-ÀvC?ïF`^.?ïD]qŸ?ïD ±£ ~?ïAõ뽤?ïAú5Ùìp?ï?àµàcŒ?ï?åçv-?ï=É›°[?ï=ÎÌí"r?ï;¯¯æ@?ï;´àÉy?ï9’øãó©?ï9˜)muû?ï7sqIf2?ï7x¡x’Â?ï5Qf>b?ï5VO:žz?ï3+ýî×€?ï31-gó‡?ï1 è.?ï1 B>I–?ï.ÙYÅ0Œ?ï.Þˆ†_é?ï,«Ø÷?ï,±l}ð?ï*{ˆÅ”Ø?ï*€¶Ìü?ï(Hr w?ï(MŸÂÚÀ?ï&Žò¢Ü?ï&¼>g!?ï#Ùå\.?ï#ßI`]?ï!žpY(?ï!£œçKX?ï`5âãù?ïeb»C?ï1ãº?ï$\ÞÔb?ïÛgÉ/9?ïà“7Ã?ï”Õ7¡Ø?ïšEc3?ïK4|f?ïP©àõ@?ïÿ`ú¹ë?ï‹Esæ?ï°€TPì?ﵪ<Öž?ï^Øøá?ïdÔ?ï ob)8?ï ˜„ä¼?ï ³@/q?ï ¸hî–á?ïYP¡H¸?ï^xüc½?ïüœ'[ò?ïÄö\?ï(^¿H?ï¢Oðd5?ï:ðÇÚ`?ï@ô+?îþÕúñP°?îþÛ!·ª¢?îünBl˜‚?îüshÌ)?îú̹òÊ?îúò³-›?î÷–•{Š?î÷›» C?îõ&¢"¿œ?îõ+ÇMá?îò³îb½ø?îò¹$Ý·?îð> Á?îðC£ù–Ì?îíÆQœ‚ ?îíËuŒóƒ?îëKi¯¡Ø?îëP6¼?îèÍêۋ?îèÒæÇÍ+?îæMdØî¾?îæR‡‹rK?îãÊIo§?îãÏkb¤?îáDu­)z?îáI—‰tF?îÞ»æü?îÞÁñ…L?îÜ0 Ç%À?îÜ5ÁËh#?îÙ¢ ~:?îÙ§ÁÊv?î×êËAv?î× õ¬?îÔ~{»u•?îÔƒ›xG?îÑèXg‘H?îÑíw¶Vú?îÏO|ëNY?îÏT›Ë”?î̳îSwg?î̹ ÄÊa?îʨÉûê?îÊÆËè™?îÇt±Où¾?îÇyÎâ x?îÄÑ\¼?îÄÖ!?$5?îÂ*¦'¢?îÂ/ÂتÖ?î¿“´šË?¯ôq¶?î¼ÕÑ®}*?î¼Úí|¯ý?îº'\h‡¯?îº,wÄ£†?î·v8Áé(?î·{S«{ð?î´ÂcMB?î´Ç}‘äM?î² àHÙ×?î²úLE?î¯R¬¸…V?î¯WÆGί?Í3‘€?æN‰?î©Ø>4ý?î©ÝVÛ0˜?î§{ŸÚ?ñ?î¤S“?î¤X4Jr!?î¡Œ‹#è?î¡‘¢i%Ó?îžÃLÎg?îžÈc!?î›÷f8²`?î›ü|iÑ?î™(Ô«Á?î™-éãõã?î–WšÏt†?î–\°7à€?·I3 ?Ì9P ?î­.û¤?î²B~WÜ?îÓûÂ@b?îÙÀk8?îŠø%Wð?îŠý8‹àö?›0?¥÷o?î…8…›š?î…=—‘ŽÛ?î‚T½ «–?î‚YÏ«?înS0"?îsdÉ®ê?î|…DN°9?î|ŠUlw¾?îy™”ÖY·?îyž¥wÝ1?îv«A¯|c?îv°QÔK†?îsºO@ñH?îs¿^èœ?îpƺ~Jš?îpËɨa×?îmЇÅn·?îmÕ–q‚ ?îj×´Fh?îjÜÂBç#?îgÜCÂ¥y?îgáQqcå?îdÞ3×*?îdãAù©?îa݈ 0Y?îaâ•OÜ?î^Ú?1]°?î^ßK`Ù!?î[Ô[μ ?î[Ùg}˜©?îXËÛ˜­?îXÐæÅÔ&?îUÀÂȘ?îUÅÍti‹?îR³‰d‘?îR¸³Ë?îO¢Ãž¶?îO§Ì¶«Š?îLÝŒ¨þ?îL”æ±ír?îIzb-ë?îIjÏù?îFbN1½3?îFgVP&r?îCG¥ºNG?îCL­T¤ê?î@*fF”?î@/m'c?î= “Pï6?î=™áÖ¦?î9è*Ìò1?î9í0Ø}E?î6Ã0—¸Ñ?î6È6zô¾àž?îCöø´?îêÙ*?îë—£L?îÄVb4“?îÉV–¢Ï?îƒ4èC®?îˆ4’:f?î?ŠP’ú?îD‰o¦J?î ùT2Ë?î þRÆŽ³?î °–lÒÐ?î µ”tÛ?îeNŸ¦»?îjL‡¬??î}‘lF?íÿÇ*]Ê?íÿÌ&€­n?íütNäF4?íüyJ¹,&?íùì¦ýð?íù#çî¨?íõÇ/†‡?íõÌèW?íòlœ9ä?íòq–d ¹?í﯈s?íï©#‹?íë°>à+ü?íëµ7ë¹û?íèNMü|F?íèSFxÃ?íäéÚ« ª?íäîÒ–Yà?íá‚è Ú?íá‡ßûeÊ?íÞu´=P?íÞl}ž$?íÚ­…“½?íÚ²{Ë\·?í×?ì?í×D Ê?íÓÎ*úÂ,?íÓÓ &G?íÐZÂü‘?íÐ_¶’ê?íÌäßéj?íÌéÒò>›?íÉlÃ]œ?íÉqs ê?íÅñ§è«?íÅöš®KL?íÂtUlм?íÂyGø€?í¾ô‹äü´?í¾ù}C?í»rIQrš?í»w:Xnc?í·í‘A¬?í·ò²\/Ñ?íz§E¢Åë?íz¬+äûö?ívöºÎ˜?ívû sÊÚ?ísCÇ0äÐ?ísH¬8¼Æ?íoŽn6¬?ío“R‰Fb?íkÖ­îâö?íkÛ‘ºÄ/?íh‰ð‰?íh!ml—?íd`…P?íddã Ø??í`¡çä†?í`¥öÖ×í?í\ßÅæ?í\ä¦ÜM?íY´æÔ?íY öcê°?íUVÊ;?íUZãØŽ\?íQ“ *Õ?íQ’rzª_?íMÂÁð7X?íMÇ ¼]0?íIõ“®jâ?íIúqØÒt?íF&Àö_?íF*äI:×?íBT^ –?íBXûCɨ?í>Ù?í>„µH`(?í:©9èÓ"?í:®ˆTN?í6Ð?Ž§?í6ÕŠsù?í2ôí#H?í2ùÇzý?í/A4cU?í/çœl?í+7>éQ’?í+<÷«K?í'TäÖx·?í'Y½?d?í#p6X’?í#u áÉ?í‰1\$?íŽy}ÿ?íŸÙ­Xi?í¤°$RÇ?í´-³Ñh?í¹ƒü0?íÆ0ˆ€_?í˱xù?íÕàÓœ]?íÚµTÿú?í ãA©o8?í è‚ÛŠ?íîQ¸ÎD?íó$éàÇ?í÷5”?íû晌D?ìÿý‡gòR?íYG*ö?ìü®Çþì?ìüý·Ì?ìøˆìíŠ?ìøYxÄ·?ìôÝ<&?ìôè¾Ð3?ìð]Zã¾?ìð,‘Ó ?ìëûYg¸6?ìì'ó¡›?ìçô ÌM?ìçøÙ¬w?ìãêw…[À?ìãïDºØ?ìßÞ›b?ìßãgê™?ìÛÐz[%”?ìÛÕF7,é?ì×ÀEVì?ì×ÄÞtsÜ?ìÓ­i7š?ìÓ²3— è?ìϘz¥Š2?ìÏDy±l?ìËJæ®T?ìˆ ʇ?ìÇgعk@?ìÇl¡1I?ìÃL' á/?ìÃPîÒÇi?ì¿.4¾Å­?ì¿2ûØB?컿õ˜?ì»Ë*'/?ì¶ë•ú!Ž?ì¶ð[´iŸ?ì²ÆëQ9?ì²Ë°[¸?ì® ·(*?쮤Èß?ìªvâ %Ù?ìª{¥´w?ì¦K…Hlò?ì¦PH?X¨?ì¢ðGT–?ì¢"²Œ|g?ìî"' ?ìòãš,X?왼_7V?ì™ÀÞ?¼?앇áSž?ì•Œ¡%V?ì‘Qp·e?ì‘V01Íú?ìÊ”?ì‰[MF?ìˆÝñº(\?ìˆâ¯ÌþA?ì„ å7®?ì„¥¢–.?ì€a§Ø{é?ì€fd‚H§?ì| 8±qð?ì|$ô¦.?ìwÜšŠà?ìwáUÉbš?ìs–Ì|Óáß“v?ë½C~ÜD?븠ÁÖ«A?븥]M{À?ë´SÙ?ë´8Ûç?ë¯^sàI¼?ë¯c Í(?몺Gó.S?몾á“ ?ë¦4?릱{É­?ë¡kéÉ?ë¡pdðF?ëœÁ¹“A®?ëœÆPh9\?똊èhˆ?ë˜ ö‘Î?ë“g]_Åò?ë“kò¦Ëé?뎷3g&o7í?ërlª]“Â?ërq:)k?ëm®°/Üš?ëm³?1ðo?ëhîÁ²¥L?ëhóOê¢q?ëd,Þ’a?ëd1l"£?ë_i .‚‚?ë_m•ÑY?ëZ£A7kØ?ëZ§Í2Õ?ëUÛ‰ N?ëUà²õ?ëQàY?æ?ëQj™ðJ?ëLFI€ec?ëLJÒõ?ëGxÄ8 ì?ëG}LàqÄ?ëB©RÖœw?ëB­Ú²B©?ë=×õn2?ë=Ü|(é?ë9­SèÃ?ë9 3•DŽ?ë4/{G½ñ?ë44»zS?ë/XaEy?ë/\åëDõ?ë*_ãÊ?ë*ƒâên?ë%¤vý·Á?ë%¨ú¯–?ë ǨÏÍ®?ë Ì+ âS?ëèöÔI?ëíx>øU?ë`Ø~š?ë ásÛ?ë%é%0?ë*hð¸ÿ?ë AŒ†?ë F‡??ë[VR¥ü?ë_Ô}–Í?ës=N½N?ëwº¨êy?êþ‰FÃ?êþÃL6@?êùr‰Š@?êù¡îAB?êô¯Ââ ?êô´=È%a?êïÀ7ªÒ?êïı¾–±?êêÎÓ 9Î?êêÓLað?êåÛ•$·ð?êåà “Ðß?êàæòÇ\?êàê÷Žô*?êÛï“oÕ¡?êÛô 8Çú?êÖöÑÔ/?êÖûGÉq?êÑü;“È?êÒ°*'M?êÌÿÑBöú?êÍEfz?êÈ”p;r?êÈé9O?êÆÃS8?êÃùg’.?ê½ÿ¨,ø ?ê¾ü+k?ê¸ûúÝ?ê¹k×f¼?ê³ö~É‘´?ê³úîíÅq?ê®ï6Íì?ê®ó¥m?ê©æ Õrà?ê©êMtý?ê¤ÛAÊâ?ê¤ß®ºA¶?êŸÎ–ä«*?êŸÓ¯J‚?êšÀ$aÜë?êšÄUXñ?ꕯéÑC?ê•´T«Þ?êè”Þ(?ê¢RÙ0a?ê‹Š!t‰?ê‹ŽŠàP¢?ê†t–Q Î?ê†xþå©?ê]G2Õp?êa®î3í?ê|D6:„|?ê|HûØ?êw)crTî?êw-É{šf?êr Ðù3~?êr6(üª?êlî~ÜÓ?êlòã2ÕŒ?êgÎo9Å)?êgÒÒµ¶æ?êb¬¢!$0?êb±»&?ê]‰­š?ê]{t?êXcÕòIø?êXh6ÞNU?êS<Ùl@?êSA99'?êN#Œ ?êN‚<Ø-?êHé¶ ¥?êHî^£ ?êC½’†Ì?êCÁï™ö…?ê>¹`Õ@?ê>”é±?ê9`+ðáø?ê9d‡µR?ê4.ëÝ^Õ?ê43FÄãR?ê.ûùHi`?ê/SR¹?ê)ÇV@‡D?ê)˯m[A?ê$‘ëB?ê$•[:*7?êYTTÖ?ê]XÅY@?êQ¤è¤?ê#¨7š?êãõæ¸?êèKšÏ??ê¦îE¸ƒ?ê«Cîs?ê h<É¥@?ê l¿³!?ê'ᡘ?ê,4¸71?éÿåÞÓã?éÿê1 ë½?éú¢4O?éú¦…ç=_?éõ\äÜ«?éõa5SW¥?éðïíŸV?éð?ƒÄL?éêÍWÄ6?éêѦy¿?é僙!"?éå‡jmeÎ?éà7@k'?éà;^ç?éÚéÃv'A?éÚî‡v?éÕš§¶´¹?éÕžòæ!?éÐIíkÃ:?éÐN7¹:?éÊ÷–Ì?éÊûßú¥(?éÅ££dÍx?éŧëìö ?éÀNã>?éÀR]ˆM'?éºöîO¹}?éºû5´“?鵞. áL?éµ¢t_¼?é°Cס?é°H_?éªçé½6?éªì-ÓÏS?饊fÇ;±?饎©ù®?é +P/³?é /’}#?éšÊ¦B´ù?éšÎç«Ïþ?é•hjñð´?é•l«uû™?鞶š?éÞ,n¶?銟Cñ™?銣½•?é…8X¨tÕ?é…<–{Ài?éÏág a?éÔT;–?ézeÝ–rv?ézjIb?étúO mp?étþŠ@§~?éo6^–t?éo‘p—ò?éj•8´‘?éj"Ίð™?éd®l .I?éd²¤v ‹?é_<¼»ÀÒ?é_@ô>úv?éYɇ©®E?éY;E„?éTTθ¹d?éTYkíÇ?éNÞ’Jáy?éNâDz›?éIfÔA÷:?éIk$%?éC핺F?éCñÇü°?é>rÖlý¹?é>w}%?é8ö˜èP¡?é8úÊ>?é3xÞR€r?é3}£?é-ù§Ó`?é-ýÖiœ?é(xõ:è?é(}#w[Ü?é"öȨ—k?é"úö'Y6?és#¾í’?éwPS ?éîÀÛ)?éò2j"ø?égs†sä?ékžD¡B?é ßjìD?é ã”TÁ?éU퉄õ?éZpÃ_?éÊý ¤?éÏ% ví?èü>šïÑ?èüBÁÿ)Ì?èö°ÇšLr?èö´í½V=?èñ!„ãâÃ?èñ%ª`‘?èëÓF¦?èë”÷Zæ?èåþ´“$®?èæ×ïÓà?èàk)EíO?èàoKµZC?èÚÖ3-·ï?èÚÚT¯¦Y?èÕ?ÒÉ£¡?èÕCó]×K?èϨ æ”—?èϬ)ŒÑ—?èÊÙk?èÊ÷¾$ì?èÄtAóR?èÄx_¼î•?è¾ØE2Fí?è¾Üb 9ì?è¹:䌺ÑÚ?è¨A f?èá¾ë1©?èåÀ[g&?èüXH6?è!üÓ8?èXø±—‰?è\ø7 C?è’´ŸÞ®?è–³/£?èË1ÐÿÌ?èÏ/jÞê?çýpïÓ?çým“—ú?ç÷8s¨œÏ?ç÷.¡?ç±aÃó«?ç±e³¢öØ?竈„?ç«Œ ˜ž?祭Iv¹?祱7–·þ?çŸÑK1… ?çŸÕ8X7A?ç™ô#OšÜ?ç™ø|ÎÛ?ç”ÒÛû?甽Á`j?çŽ6ZŠlåz?çAvR\¾?çAz/‘|‡?ç;‡-€i¤?ç;‹ ü å?ç5–òù9T?ç5šÎx3Ý?ç/¥¤þ?ç/©~˜:à?ç)³A¤YG?ç)·)v¶?ç#¿Í4ݽ?ç#Ã¥¼È/?çËG–¶?çÏ!@-?çÕ²YT«?çÙˆæQ0?çßM‚ð?çâãÜÄë?ç ç]<ú?ç ë1’—ª?çîŸFú3?çòrÚ@û?æÿôÖ«]?æÿø©@cš?æùú ?æùýÕ™«?æóþ(מz?æôùo ?æîFZ?æ°?æè]íH?æè+¡:Ê?æânÂZR?æâ<]Œ’?æÜ|»0õ?æÜIWÇ?æÖ‡Êy˜?æÖSfóõ?æБw@ö?æÐ\?æÉþšœ*~?æÊd9A½?æÃú¤¾â?æÃþm\?æ½õ°»Ÿ?æ½ùxX©?æ·ïÀ·??æ·ó†³|C?æ±èÓ­ì?æ±ì™JAË?æ«àí4ƒ?æ«ä±ŸñH?æ¥Ø øçÀ?æ¥ÛГâ&?æŸÎ5 œ?æŸÑ÷§ªÙ?æ™Ãf#0¶?æ™Ç'¼*ï?æ“·¡¹íÀ?æ“»bQªŽ?æªè´/À?殨J†|?æ‡<åú?懠û%®Z?æPûå½Ý|?æJáDþøo?æJäù{«­?æDÉsvP?æDÍ&ïÅ*?æ>°½;½?æ>´o‘Lž?æ8—"Ú.ž?æ8šÔLµm?æ2|¦)Ý?æ2€V—Üö?æ,aGõ¼?æ,d÷`¦?æ&E ´d½?æ&H¸l:?æ 'ìT²9?æ +™·š4?æ ñIÎõ?æ ¨r—?æë„8¿?æîÄÞsY?æ Ëfvˆ?æ Ï˵§?æªÙy?殂b Ô?æ‰rÆ+"?æP¬?åûg4ˆuç?åûjÛÏ¡½?åõDÇu?åõGÆ ›ï?åï 5w؉?åï#Ú´¦)?åèûw¿‚?åèÿ?)?åâÕålç?åâÙˆžÉ^?åܯ‚…œ?åܳ$@½Ü?åÖˆMõ|‚?åÖ‹ïçþ?åÐ`J{ŧ?åÐcêœAë?åÊ7xŸ…Ö?åÊ;¹ð“?åÄ Ùˇ8?åÄwß¾^?å½ãnùŸ?å½ç G?å·¸9‘ä£?å·»Õ™O!?屌:cb?å±Õ‘54?å«_s]å?å«c WÆ?å¥1äó}x?å¥5}æºK?埻 Â?åŸ(§L¨?å˜Ôw°‘C?å˜Ø•µ†?å’¤›:­?å’¨1Ñ?åŒsüU¶ž?åŒw‘,@S?å†BœhBì?å†F07O?å€|pî÷?å€8]º?åyÝÓv©?åyá/“(M?åsª ?ås­’Gõ?åmu© †6?åmy8¹_J?åg@•A Ì?ågD#èÈÒ?åa ǘm?åaU7¡‚?åZÔA:¨?åZ×ͨf?åT ­4?åT Ž›at?åNeŽÐ?åNh™ ’?åH,dôf_?åH/îqÑŠ?åAóDvª?åAö¹P?å;¸öÜ=!?å;¼~GçŒ?å5~4Á^?å5»#ü6?å/BÂPÈ–?å/FGªbˆ?äŒV‚"„Â?äŒYìh8?ä† 7 µ?ä†  EW?ä½\ö/Y?äÀÅ#­b?äyoôõÆÀ?äys\™?äs"W][?äs%flw§?älÓ€/"?älÖå7è?äf„uÉ?äf‡ÙÅtÖ?ä`4â:BJ?ä`8E*š?äYäÆÍ™À?äYè(°×÷?äS”$˜â%?äS—…opÜ?äMBüæø?äMF\¯åÿ?äFñPËÉk?äFô¯ˆ¶Á?ä@Ÿ!’ôb?ä@¢BðSƒž?ä3ü™é[â?ä-¥Œ¬î?ä-¨ç5”ž?ä'Q\¦)”?ä'T¶!‰m?ä ü¯Wã:?ä!ÅçŠ?䧆7X?äªÝh˃?äQáІ/?äU8#•È?ä ûÃõóÓ?ä ÿ;j£?ä¥-’’œ?ä¨Ê\š?äNꎗ?äQs—ñ?ãúöœ¥T?ãúùî4Úf?ãôž£`ö?ãô¡ônbR?ãîF6Ü?„?ãîI†Ü‘ë?ãçíWÏp]?ãçð¦Á´È?ãá”U³ ?ãá—U9Ö?ãÛ:F°[?ãÛ=“†K,?ãÔàüÎ?ãÔãbÃÂô?ãÎ…yyWÐ?ãΈÄ2©Ä?ãÈ*oE^i?ãÈ-¸ðF?ãÁÎùŸ®2?ãÁÒB<Ç?ã»s¦'¥?ã»va4q?ãµЗ^G?㵜Ò?㮺‘Ζ?㮽e\š?ã¨]Ó‡?ã¨`L4êð?ã¡ÿŠz]K?ã¢ÍÍW7?㛡¨ÄKØ?㛤ëb™?ã•CcЊÙ?ã•F¥­ð?ãŽä¼Úð_?ãŽçý‚?㈅µ©Û?㈈ô´ð?ã‚&M…­ü?ã‚)‹•?ã{Ƈ¯?ã{ÉÄzb—?ãufd1»Ø?ãui ,%?ãoä·´?ão ‘4…?ãh¥ Jê?ãh¨D¦T?ãbCÖöš?ãbGÊBK?ã[âI;‡?ã[å€çS‚?ãU€dòß?ãUƒ›¹?ãO*lfû?ãO!_ù ƒ?ãH»šÊâD?ãH¾ÏGÚˆ?ãBX·DÚ4?ãB[ê²C?ã;õ€ýˆ?ã;ø³[!?ã5‘ù*ž†?ã5•*xE?ã/. ïÌn?ã/1Q-’#?ã(ÉùäÃ?ã(Í(¯¼l?ã"e„e?ã"h²"ë ?ãÁ­Aß?ã?㛳Ÿ¾?ãžßœÔ@?ââlN®7?âܧúC®?âÜÊe6Í?âÕ™åROÄ?âÕ¬»g?âÏ1ã×` ?âÏ5!9Á?âÈɤ°jD?âÈÌÃé§Ï?âÂa)  ?âÂdG47n?â»ørOh?â»û(6£?âµ€ëÜ_?âµ’œó Ø?â¯&VÅîJ?â¯)q¼Xˆ?⨼ôËü?â¨À°¹¸?â¢S\#_È?â¢Vtø'ë?â›éú†¸?â›ì¥¾p^?â•‹xÞ}?â•‚¢+àó?âUÉip?âkk|4?∪îÅ;?∮¥ßý?â‚@U…*…?â‚CiE&?â{ÕC‚¢?â{ØŸ²•5?âuj–yAÍ?âum§×D–?ânÿrO˜q?âo‚œƒæ?âh”!ï4)?âh—1+ð?âb(¦%?âb+´¬6?â[½.’¾?â[ÀH ä?âUQ3ù°?âUT?(@E?âNå=|î?âNèHsúq?âHy!ojø?âH|+U6á?âB àÖ>?âBèò[n?â; z²l4?â;£‚u¤«?â53òRÒò?â56ù¸á?â.ÇH)~ú?â.ÊMÊ Â?â(Z}[YÃ?â(]ê‰ù?â!í“?â!ð–ß? tÒ&?⃌á7µ?âd«~Ì?âfw©?â¦"Ú†æ?â©#$i?â8Æ-–?â;ÅeH?âËOŦb?âÎMì=ü?áû]ÀϹ‘?áû`½äÒþ?áôðm:?áôópÑr?áî‚]Éœ¾?áî…X»®V?áèŒ'?áè…æ¯f?áᦦNvÔ?áá©Ÿr?áÛ8­Ãµ?áÛ;¥€Š¶?áÔÊ£åÜ?áÔÍš;¿4?áÎ\ˆÔ§ï?áÎ_~nëà?áÇî^½Q\?áÇñSEýX?áÁ€&i V?áÁƒàÿ?á»áåA?á»ÓiZk?á´£¬W+?á´¦-Ú?á®53Ž‘à?á®8#ÐÈJ?á§ÆÍÈ[?á§É¼øð ?á¡X_†÷?á¡[M¤ô7?ášééäŸa?ášìÖñì?á”{nœ)?á”~Z C\?Ꭰí&b’?áŽØca?ᇞhRu?ᇡR*ÎÖ?á/à°“q?á2ÉwE¶?ázÁWmUà?ázÄ?"`_?átRÍ£Ï×?átU´G2y?ámäD€®?ámç*ia?águ½\\?ágx¡žoÆ?áa8©™?áa Š?áZ˜¸<%?áZ›š˜ë;?áT*=΀?áT-Mï1?áM»È°ë?áM¾¨P-7?áGMZ¤¦M?áGP9Ìr?á@ÞõÅ%¯?á@áÓÛ]?á:pš¥?á:sw©«X?á4J\C®?á4&O<±?á-”¡?á-–àøý¶?á'%Îî[ ?á'(¨¾?á ·¦ f0?á º~Ë‘?áIŒ‹P?áLd7å¶?áÛƒ•¦?áÞZ0Ð?á mŒ@«?á paÊP?áÿ§ºÎ,?á|2µl?á‘× ?ᔪtI?àú$ˆ^¶?àú&íÝ7I?àó¶v\–?àó¹G`³A?àíHè,?àíK¸6ÙÎ?àæÛrSd(?àæÞAsÂÑ?ààn5s‘?ààpäD\?àÚÔ¾ª?àÚ¡¼!ª?àÓ“¯îÄ?àÓ–{ù½?àÍ&¦`%¤?àÍ)q:È¿?àƹ»¸+ˆ?àƼ…kÅ?àÀLð6JG?àÀO¸î,Ô?à¹àET?à¹ã ­ÞÌ?à³s»<ý?à³vÒ4Ž?à­T?à­ ‡ò?ছm”È?à¦Ôà8?à .ñ¦Wj?à 1µ¹Ç?à™Âø¾Ù?à™Å»¿?à“W&ã¼À?à“Yè"°:?àŒë}$ú¥?àŒî=RÀ–?à†ü¯!Ð?à†‚»ËÁ?à€¦‘—Å?à€dj?ày©{øÕÓ?ày¬8ó=?às>}ó±f?àsA9ݧ?àlÓ­®ŒA?àlÖh†Ù?àfi 7®r?àfkÅþùµ?à_þš»]ç?à`Sq¯‡?àY”ZGW?àY—ì·6?àS*LÃœ?àS-œ:œ?àLÀq Ó°?àLÃ&j?àFVÊy“¢?àFY~ìR?à?íYc¨|?à?ð Å—ð?à9„óÿ¦?à9†ÑE)*?à36¶?à3Íw"Ö?à,²RW•c?à,µ‡Nÿ?à&IÂb2ì?à&LqBî?àám‚8?àä¨W?àyT²x?à|ÀŒæ?àyO"ú?à%p¥?Ý ™'ø~?Ý‹G¸ ?ݵ]Їõ?ݵbÀŒA“?ݨ°ïnéä?ݨµÝWè×?Ýœ÷ÛTÈ?Ýœ ã©-{?ÝYì–?Ý^ÕËY:?Ý‚¯Î$$?Ý‚´µ¼&?Ýv Hõ4?Ýv …ÆG¯?Ýi^dƒíó?ÝicGæ¹ ?Ý\·'ñ?Ý\»þg”@?ÝPÌßg?ÝP«Eà?ÝCks´•"?ÝCpPÈ¿?Ý6ÇóÈð?Ý6Ëðî ?Ý*#µ`R?Ý*(ýîŸ?ÝS,#?݆)ó"ï?ÝßòhY?ÝäÇõ6?Ý?”Ì?ÝDg`wƒ?Ü÷ <žüû?Ü÷¥ SI?ÜëëÚqÅ?Üëº<æª?ÜÞd¤Åz¡?ÜÞiq:E?ÜÑÈiXÅú?ÜÑÍ3‰üÚ?ÜÅ-;Ú¹?ÜÅ2ó” ?ܸ“CT~?ܸ—äD¿?Ü«úØZ?Ü«þÖÁœ?ÜŸb‘ Ô?ÜŸfÝaø¯?Ü’Ë:²ÃH?Ü’Ïúkö(healpy-1.8.1/healpy/data/weight_ring_n00032.fits0000650000175000017530000002640011705033043021677 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:04:02' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 64 / 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 NSIDE = 32 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 100 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 1.685120771520E-01 / maximum value of T weights MINVAL1 = -7.723710942327E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 1.685120771520E-01 / maximum value of Q weights MINVAL2 = -7.723710942327E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 1.685120771520E-01 / maximum value of U weights MINVAL3 = -7.723710942327E-02 / minimum value of U weights COMMENT END ?Å‘ÍÂ,¡—?Å‘ÍÂ,¡—?Å‘ÍÂ,¡—¿³ÅÏ«²6¿³ÅÏ«²6¿³ÅÏ«²6?£ÄÑÌ­j?£ÄÑÌ­j?£ÄÑÌ­j¿‘¨ÁH¦›¥¿‘¨ÁH¦›¥¿‘¨ÁH¦›¥?s…‚Í„Ë?s…‚Í„Ë?s…‚Í„Ë?`žÂÑâ‹#?`žÂÑâ‹#?`žÂÑâ‹#¿t1c¶&7h¿t1c¶&7h¿t1c¶&7h?u†ÕH+#?u†ÕH+#?u†ÕH+#¿p½cSÛ Â¿p½cSÛ Â¿p½cSÛ Â?bÓ“úß?bÓ“úß?bÓ“úß¿A…Í^¿A…Í^¿A…Í^¿JB˜Ñz]¿JB˜Ñz]¿JB˜Ñz]?Y0qq|¥Î?Y0qq|¥Î?Y0qq|¥Î¿[¥Á Ñ9ο[¥Á Ñ9ο[¥Á Ñ9Î?VÇ%–¾ÜÓ?VÇ%–¾ÜÓ?VÇ%–¾ÜÓ¿K˜\¯Öv¿K˜\¯Öv¿K˜\¯Öv?/4SÆm‚?/4SÆm‚?/4SÆm‚?1´Ï^ÓÅ?1´Ï^ÓÅ?1´Ï^ÓÅ¿C} ‹™a…¿C} ‹™a…¿C} ‹™a…?G]ùœ'?G]ùœ'?G]ùœ'¿Eud Òè¿Eud Òè¿Eud Òè??‡ir\Ȫ??‡ir\Ȫ??‡ir\Ȫ¿16³ßÑ&¿16³ßÑ&¿16³ßÑ&?Jõ:“ M?Jõ:“ M?Jõ:“ M?9^&T¸á?9^&T¸á?9^&T¸á¿!ØÁ—~3S¿!ØÁ—~3S¿!ØÁ—~3S?2\ ¨”«?2\ ¨”«?2\ ¨”«¿ 3XÒßO¨¿ 3XÒßO¨¿ 3XÒßO¨¾û<[ ß'G¾û<[ ß'G¾û<[ ß'G>õ¦?\øëÙ>õ¦?\øëÙ>õ¦?\øëÙ?6óÊ™24?6óÊ™24?6óÊ™24¿iûããG–v¿iûããG–v¿iûããG–v¿6›Ïëø¿6›Ïëø¿6›Ïëø?G|‹ó»°?G|‹ó»°?G|‹ó»°¿N+Ka¾­¿N+Ka¾­¿N+Ka¾­?L PïîbŒ?L PïîbŒ?L PïîbŒ¿Bø4éϧ¿Bø4éϧ¿Bø4éϧ?$™ÅøMSh?$™ÅøMSh?$™ÅøMSh?1êë?1êë?1êë¿B”(U¿B”(U¿B”(U?B0Ø\ÎP?B0Ø\ÎP?B0Ø\ÎP¿1¹Ö¸—ó©¿1¹Ö¸—ó©¿1¹Ö¸—ó©¿"v…åøÆ ¿"v…åøÆ ¿"v…åøÆ ?=b߯±þ1?=b߯±þ1?=b߯±þ1¿>;#~ƒ1¿>;#~ƒ1¿>;#~ƒ1?&¢$Ë·9?&¢$Ë·9?&¢$Ë·9?.95¹â?.95¹â?.95¹â¿=p›'˜×¾¿=p›'˜×¾¿=p›'˜×¾?5ñï-’3?5ñï-’3?5ñï-’3? óÏâý~? óÏâý~? óÏâý~¿8­·ŽÜc ¿8­·ŽÜc ¿8­·ŽÜc ?8ãóñŠJ?8ãóñŠJ?8ãóñŠJ¿®5~‘%¿®5~‘%¿®5~‘%¿4#jœº¿4#jœº¿4#jœº?9Ô\í1Ϙ?9Ô\í1Ϙ?9Ô\í1Ϙ¿ùx‘’¿ùx‘’¿ùx‘’¿1ȸ'§K¿1ȸ'§K¿1ȸ'§K?9ÎcÀì–ø?9ÎcÀì–ø?9ÎcÀì–ø¿#õäüÓ°ì¿#õäüÓ°ì¿#õäüÓ°ì¿.ÌÙN¿¿.ÌÙN¿¿.ÌÙN¿?9Pr¥¢,?9Pr¥¢,?9Pr¥¢,¿$%kà¿$%kà¿$%kà¿1Q ˜ëÔ¿1Q ˜ëÔ¿1Q ˜ëÔ?>¢å P³®?>¢å P³®?>¢å P³®healpy-1.8.1/healpy/data/weight_ring_n00004.fits0000650000175000017530000002640011705033043021676 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:03:42' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 8 / 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 NSIDE = 4 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 8 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 1.198278418678E-01 / maximum value of T weights MINVAL1 = -1.931310224103E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 1.198278418678E-01 / maximum value of Q weights MINVAL2 = -1.931310224103E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 1.198278418678E-01 / maximum value of U weights MINVAL3 = -1.931310224103E-02 / minimum value of U weights COMMENT END ?¾­ •ù“?¾­ •ù“?¾­ •ù“¿z¶î¦îU¿z¶î¦îU¿z¶î¦îU¿“ÆÐZ Äf¿“ÆÐZ Äf¿“ÆÐZ Äf¿~aFηk¤¿~aFηk¤¿~aFηk¤¿q0y$Žã~¿q0y$Žã~¿q0y$Žã~¿jžb¤v´\¿jžb¤v´\¿jžb¤v´\?,£C±0Û?,£C±0Û?,£C±0Û?sï5»áô?sï5»áô?sï5»áôhealpy-1.8.1/healpy/data/pixel_window_n0512.fits0000650000175000017530000011660011705033043022026 0ustar zoncaplanck00000000000000SIMPLE = T / Written by IDL: Fri Nov 29 16:12:11 2002 BITPIX = 16 / Number of bits per data pixel NAXIS = 0 / Number of data axes EXTEND = T / FITS data may contain extensions DATE = '2002-11-30' / Creation UTC (CCCC-MM-DD) date of FITS header COMMENT FITS (Flexible Image Transport System) format is defined in 'Astronomy COMMENT and Astrophysics', volume 376, page 359; bibcode 2001A&A...376..359H END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 16 / width of table in bytes NAXIS2 = 2049 / number of rows in table PCOUNT = 0 / size of special data area GCOUNT = 1 / one data group (required keyword) TFIELDS = 2 / number of fields in each row COMMENT EXTNAME = 'PIXEL WINDOW' / NSIDE = 512 / Resolution parameter for HEALPIX MAX-LPOL= 2048 / Maximum multipole l=4*nside COMMENT COMMENT COMMENT COMMENT Contains pixel window smoothing factors COMMENT for temperature and polarization for NSIDE = 512 COMMENT for multipoles in range [0, 2048] COMMENT TTYPE1 = 'TEMPERATURE' / TEMPERATURE pixel window smoothing factors TFORM1 = '1D ' / data format of field: 8-byte REAL TUNIT1 = 'unknown ' / no unit COMMENT TTYPE2 = 'POLARIZATION' / POLARIZATION pixel window smoothing factors TFORM2 = '1D ' / data format of field: 8-byte REAL TUNIT2 = 'unknown ' / no unit HISTORY HISTORY For NSIDE <= 128, the T and P windows are computed exactly HISTORY by averaging the individual pixel windows. HISTORY For NSIDE > 128 : HISTORY * The average T window is extrapolated from smaller NSIDE HISTORY assuming a scaling of the window function with the pixel radius HISTORY similar to the one exhibited by a tophat window HISTORY * The P window is assumed proportional to T HISTORY E. Hivon, Nov 2002 END ?ð?ïÿÿ‰ªÇ?ïÿþu®7ø?ïÿÿAß½?ïÿüèj?ïÿýMR°Ç?ïÿùh6?ïÿú3é½Ç?ïÿôÿ,­?ïÿõÊ—µ?ïÿïXMyã?ïÿð#·Á”?ïÿèá  ?ïÿé¬wá6?ïÿâr¬F?ïÿã>ú?ïÿÝN¸bV?ïÿÞ"7]?ïÿÖ‹aq?ïÿ×Vʽ{?ïÿ;‡Äo?ïÿΉñ6‡?ïÿÄ–@FŒ?ïÿÅa©~o?ïÿ»tÉX?ïÿ¼[ÝÇà?ïÿ±ló1¡?ïÿ²8[ïµ?ïÿ¥Ø|Æ/?ïÿ¦£å:§?ïÿ™ÈTn?ïÿš“¼•Þ?ïÿ†\gž?ïÿŽQÄA|?ïÿ€J†vÜ?ïÿíü›?ïÿqÔï¾?ïÿrŸ‚?ïÿbÑÀ@?ïÿc' „?ïÿSv˜•%?ïÿTAþýî?ïÿC2|R?ïÿCý}}²?ïÿ1Ï|èd?ïÿ2šâ{@?ïÿ×B?ïÿ ¢v¡ã?ïÿ o—!v?ïÿ:ûÍ?ïþú(.E?ïþúó’v,?ïþåÔTT?ïþ柷¾2?ïþÐäoT?ïþѯqš?ïþ»va¾?ïþ¼AùJ?ïþ¥.Ò°‘?ïþ¥ú4Å}?ïþæëñ³?ïþŽ²Mr¢?ïþuý×ö?ïþvÉ8ç?ïþ]WÀí?ïþ^X¸‚?ïþDG0êé?ïþE—Õ?ïþ* „oà?ïþ*Ôãuý?ïþ'‰8?ïþòoäo?ïýóµÙoÁ?ïýô7†?ïý×r1Z?ïýØ=x*t?ïýº=Œo?ïý»讃?ïýœai4J?ïý,ĵì?ïý}ðâÞ­?ïý~¼=žÐ?ïý^°8*4?ïý_{’#¬?ïý>„ Æò?ïý?Oeóç?ïý®C6?ïýyiŸq?ïüü??!R?ïüý –©?ïüÚ,Š#?ïüÚ̓81?ïü¶ÝåÓ?ïü·©;¡«?ïü“ öû²?ïü“ÙKæ·?ïün¡›!z?ïüolï$õ?ïüIh‹Wœ?ïüJ3Þnz?ïü#KÓÒ&?ïü$%ö¿?ïûüì9P?ïûýM=gV?ïûբ׺?ïûÕãó 8?ïû¬ãëœw?ïû­¯:Ða?ïûƒÎŒ0¨?ïû„™Ú_j?ïûZ ³í?ïûZÖV?ïû/¤þš,?ïû0pJ±í?ïûtð}Ä?ïû@;‚ý?ïúØfÈ]R?ïúÙ2J~?ïú«©Çl?ïú¬tW˜0?ïú~G\ÙN?ïú¤‰–?ïúP@D^?ïúPç†Ï+?ïú!?þ?ïú!à…]ã?ïùñ]»ÍT?ïùò(ÿýÝ?ïùÁr‰¾?ïùÁ˵†Õ?ïùÚ‰Ò¥?ïù¥Ë—P?ïù]Ú¯ºà?ïù^¥ðAµ?ïù+)‰?ïù+ô¾S ?ïø÷ÐõiB?ïøøœ3gu?ïøð†Ñ?ïøÄ{Ą̂?ïøŽ·Ú l?ïøƒ‰?ïøY ùå?ïøYØWÜ?ïø"¹«œ?ïø#„äO¡?ï÷ëžõ=?ï÷ìj,’[?ï÷³­ˆñJ?ï÷´x¾ã?ï÷{ iÿ®?ï÷{Ôž‰Z?ï÷A»c ?ï÷B†–9r?ï÷¦§ãH?ï÷qÙx?ïö̼”p?ïö͇ĥ·?ïö‘?„?ïö‘ên>¾?ïöTÖðwG?ïöU¢²Í?ïöÈqø?ïö“œÖ_?ïõÙåÖGî?ïõÚ±uñ?ïõ›Oz‹Ó?ïõœ£+ü?ïõ\ 2wÑ?ïõ\ØY…Û?ïõ2û ?ïõÐXr¡?ïôÛ*7¸F?ïôÛõ[“?ïô™› jS?ïôšf,¤P?ïôW_M&?ïôX*7â?ïô]ÛW0?ïô(úB5?ïóЊ«?ïóÑUÈPö?ïóŒã(ð?ïóŒÍþ±-?ïóFÍ’t ?ïóG˜¬DU?ïóÓ^çó?ïóžvûj?ïòº)Qƒ?ïòºÓ?¢õ?ïòrˆ¤8?ïòsS/'?ïò*Y¢á?ïò+$´Ãù?ïñáf¿ ”?ïñâ1Ðô?ïñ—£¸§’?ïñ˜nÇÃ?ïñM+p/C?ïñMö}q]?ïñQÆ#?ïñÏ]*‚?ïð¶ ?ïð¶äŒÈ?ïði^kO»?ïðj)réÁ?ïðîCc\?ïð¹I ?ïïÍε¦÷?ïïΙ¹d?ïï~ëQ+?ïï¶RÞÙ?ïï/9ZÌ«?ïï0Z™¾?ïîÞјI”?ïîßœ–ˆ?ïî¹íøj?ïéÂâ?ïî;Þ¼Wh?ïî<©¶ˆ?ïíé5®!.?ïíê¥ÕÚ?ïí•Ö˜º+?ïí–¡Ž\Þ?ïíAÇ%Øy?ïíB’dÒ?ïììôv?ª?ïìí¿g°Ï?ïì—T”Ñ(?ï옄"?ïì@þx«3?ïìAÉe×;?ïëé÷’t±?ïëêÂ}wƒ?ïë’-¸ Õ?ïë’ø à™?ïë9—K¿ì?ïë:b2aŽ?ïêàJuï8?ïêáZY2?ïê†Ls¥O?ïê‡UÓ9?ïê+‹Â²?ïê,V¢Ÿ?ïéÏÿ‡Â?ïéÐÉõ.Ñ?ïés»Ø®F?ïét†´ ×?ïéÇwr?ïé‘í…?ïè¹ãbD?ïè¹Úº4?ïèZHU?ïè[X¶ª?ïçûSõ”?ïçüÇl?ïç›hÊŒ?ïçœ3š!¨?ïç:»s€i?ïç;†@»÷?ïæÙC;5“?ïæÚŠ?ïæw*LZ?ïæwÞò¬.?ïæ2÷ˆ,?ïæý½sr?ïå°ÖÐŒ?ïå±ZšBs?ïåL"Wž?ïåLíô ?ïäæýá§?ïäçÈŸ‰8?ïä'Ã*?ïäñ¬\?ïäŽzSr?ïäY3°w?ïã³, ¥¸?ïã³öÂq‹?ïãK|D?ïãKÝC²[?ïââFoV·?ïâã ò¢?ïâx¸ØÚS?ïâyƒ‡×C?ïâaØR”?ïâ,„«Š?ïá£S³€î?ïá¤]1]?ïá7’³JP?ïá8]ZMÇ?ïàËvåà?ïàËÛ7“?ïà]ÅBד?ïà^är…?ïßïÂØ'ª?ïßðwM?ïß _‹Ó?ïß×û«·?ïß–âfý?ïßa{ÂU?ïÞ¡WÜÒ"?ïÞ¢"scô?ïÞ0a‘}l?ïÞ1,%A+?ïݾ¸ 3?ïÝ¿‚›$È?ïÝLMµJŸ?ïÝMCd‡?ïÜÙDIÖ?ïÜÙåχw?ïÜe1€_²?ïÜeü¼}?ïÛð”Vs¤?ïÛñ^Ûë&?ïÛ{6–W?ïÛ|¥Æ?ïÛ V?ïÛÛŸôw?ïÚŽ4ND¦?ïÚŽþÊïy?ïÚ£ñ’ ?ïÚnkDÔ?ïÙžS3Ÿ4?ïÙŸªU*?ïÙ%;$þ³?ïÙ&˜²æ?ïØ«k²´–?ïج6#bw?ïØ0è“¥?ïØ1³H ?ï×µ¥H?ï׶o³#?ï×9›³?ï×:ev›¿?ïÖ¼ÙlY&?ïÖ½£Ð¿&?ïÖ?cþÒø?ïÖ@.`t?ïÕÁ.š%?ïÕÁøø³Z?ïÕB2¦›±?ïÕBýš°?ïÔÂF`i?ïÔÃIž3¤?ïÔBµ¼?ïÔBâVX½?ïÓÀðú3Z?ïÓÁ»K¡\?ïÓ?¿³$?ïÓ?Î ç;?ïÒ¼_Ú?ïÒ½)cÏ¡?ïÒ9uv²?ïÒ9н)b?ïÑ´îBòZ?ïѵ¸‡]X?ïÑ08“…?ïÑ0Úy±ç?ïЪzÂub?ïЫEBš?ïÐ$1?ïÃàqÅ»%?ïÃHx dœ?ïÃIAòt?ï°“êKï?ï±]ÏA>?ïÂñ¡@º?ﻂkÆ?ïÁ~‹Ë܆?ïÁU©8u?ïÀänÆ(Z?ïÀå8Ÿ°Ÿ?ïÀInò˜?ïÀJgD¢¹?ï¿® Ãí?ï¿®×ò—2?ï¿»•'?ï¿…cª?ï¾t±è|ä?ï¾u{²ˆ3?ï½ÖóéÂH?ï½×½¯âÛ?ï½8x&÷r?ï½9Aé(”?ï¼™9tÒÖ?：3°?ï»ùC±åÁ?ï»ú l)Æ?ï»X™žÒ\?ï»YcU?ﺷ1û_Ð?ﺷû­¤ƒ?ﺵ™N?ïºÑc×)?ï¹r&p?=?ï¹rðq³?ï¸ÎÞÛÐ?ï¸ÏZ„þh?ï¸*=ðå?ï¸+’ ë?ï·…(«6?ï·…òI ×?ï¶ß\zkî?ï¶à&BŸ?ï¶8ÜÐ;?ï¶9¥˜„?ﵑžaNp?ïµ’gòÛ™?ï´éžµáF?ï´êhCB‚?ï´@è2²…?ï´A±»ãH?ï³—}pG¥?ﳘFõCv?ï²íU·“‚?ï²î8U°?ï²Bl?è?ï²C5¼lK?ï±–ÌoÚ?ï±—•~°˜?ï°êw—*A?ï°ëA #‰?ï°=fe4?ï°>/Ôá¯?ﯓ¾å?ï¯]*AË?ï®á m›-?ï®áÓÔ¡Þ?ï®1Ìñ]?ï®2–T Ë?ï­Òæ™.?ï­‚œDçD?ï¬Ñ±ì’?ï¬Ñá ×7?ﬥêB ?ï¬ o?ÅL?ï«m€4?ï«nIU'n?諸Ãê?請g?ïªú£0?ïªÃë_0?ï©R¡âÎ?ï©SjL—Œ?﨓^~¼?羽\´?ï§çɎõ?ï§è’Éuò?ï§1?'Û-?ï§2^ ?ï¦yþb\?ï¦zÇ“¤U?ï¥Â ›œ›?ï¥ÂÒȨ6?ï¥ XäØ´?ï¥ " NF?ï¤Oçà?ï¤P±àÃ?À—ç‚?‰·"ï?ï¢Úå`Ô?ï¢Û®z·s?ï¢Nm£8?ï¢ ƒ’`?ï¡b÷u¶(?ï¡cÀ†ø?ï ¥êWÕ?ï ¦³c¯?ïŸè)[ø(?ïŸèòcÒ?ïŸ)¬Û?ïŸ*uÞ&?ïžjpS&?ïžk9›²“?ïª~W_B?ï«GPú†?ïœéØGü3?ïœê¡<ÎØ?ïœ(véÉ?ïœ)?ÙÎß?ï›fV ?ï›g>_?Z=f?H@š0?ï™ßôê”H?ï™à½Ì?b6?ï™x>Ø!?ï˜Vª¬ï?ï˜Ws„¬Â?ï—ð-Øx?ï—‘¹­H?ï–Ê‚wÜ?ï–ËJà_L?ï–Y’J?ï–!݇¶?ï•;q2Æ‘?ï•<9öÅ;?ï”rÓ¨7w?ï”sœg:Ý?ï“©‚˜ì??KRïì?ï’ßvÞè=?ï’à?“ç?ï’¬ˆo½?ï’u8eõ?ï‘I,«”@?ï‘IõV|ß?ï|ùcT°?ï} +A?ï° ¨(Û?ï°ÔHè¼?ïŽâ_˜?ïŽã(3¬?ïŽþ$d¼?ïŽƺéJ?ïDé`l6?ïE±ñÌf?ïŒua!_?ïŒuâíX?Tùä?ï‹¥UÜ_?ïŠÓK ›?ïŠÔ‹rd?ïŠU‰ŒÆ?ïŠ-b?ï‰.¦…†?ï‰/n}êÚ?ïˆ[8¾‘?ïˆ\0¶æ?\e7?ÞÉF?@â— ? J/ ?ï…ܱžÄí?ï…ÝzI?ï…dÝÇ?ï…-:¿5?ï„/c(.?ï„0+€ ˆ?ïƒW®z&h?ïƒXvÌl‘?ï‚@:Éd?ï‚€‡¯À?ï¦Æ7”?ï¦Ý ¹p?ï€Ì4„Œó?ï€ÌüÆ¥Ò?ïñ¡hÙ€?ïòi¥„ò?ïTö<æ?ï-vO?ï~:K–a>?ï~;È#î?ï}]Ö§?ï}^U½"?ï|€Ò=u?ï|€äùJ?ï{¡òöèõ?ï{¢»,‹?ïzà v¬?ïzÃÔ‘ÔU?ïyãqxã?ïyä9Î?ïy#ä8Ø?ïyëôÔA?ïx"m¿?ïx"åx¹?ïw@Z™)È?ïwA"ž“¤?ïv]ãr‰?ïv^«rSH?ïuz¹Ö‘a?ïu{з¢?ït–ד©n?ït—Ÿˆ'?ïs²9õ?ïlsµ,¦Z?ïlt|íiü?ïkˆ®xRD?ïk‰v3?ã?ïjœõ½‡É?ïj½ršû?ïi°…°?ïi±L¿Dâ?ïhÃY(X?ïhÄ ÑRå?ïgÕy¼?ïgÖA@‚.?ïfæè2·|?ïfç¯Ð3h?ïe÷ŸsÈ?ïeøf©þž?ïe›¬•?ïeb’A±?ïdãz*°?ïd«Åž?ïc%zKÑ?ïJ«¦½du?ïJ¬m§jX?ïI§ÒB=V?ïI¨™%ÏŒ?ïH£K¬jŽ?ïH¤‰„©?ïGž‘̨?ïGžÛhjF?ïF˜'»Í?ïF˜î‹é­?ïE‘‚F™ž?ïE’I0§?ïDŠ*êëô?ïDŠñ­øý?ïC‚#::Oeƒèc?ï>P,[Ó?ï=C ð½B?ï=Cç…‡a?ï<6*âÒ?ï<6ñpî?ï;(„á¾Z?ï;)Ki(¦?ï:)ë¹1?ï:ðllç?ï9 9ü¾?ï9 ݳõM?ï7ûSD†ð?ï7ü·¿ò?ï6êߎJŠ?ï6ë¥ú¿¢?ï5Ù·&AÁ?ï5Ú}‹îr?ï4Ç×Nôf?ï4È­Ô"?ï3µFk¬ ?ï3¶ ú‚?ï2¢úà¸?ï2¢ÌLc?ï1ŽÉ)?ï1Ž×f'¢?ï0ye|N?ï0z+]ü ?ï/dEñÞ?ï/d΂Žx?ï.Müf?ï.NÂM1?ï-7;¿6È?ï-8íÿð?ï,Ä‘Ü:?ï, Š¹´ã?ï+œÊw?ï+bëZâ?ï)îÅÞ> ?ï)ï‹ø(•?ï(Õ; ù†?ï(Öæ\?ï'ºù³÷´?ï'»¿¿âO?ï& ûJ?ï& ÍÿìI?ï%„gSÍ?ï%…-PðÖ?ï$h Vâ?ï$hÙ ?ï#K‰õ?ï#KÎyªÁ?ï"-MãQ?ï".Ëît?ï!ä„?ï!ªe‘Ô?ïïÇÊæÿ?ïð¥F™?ïÏõ&‚?ïкù¼|?ï¯r˜†ç?ï°8d–ã?ïŽA‰.?ïMóÖ?ïl]fnŒ?ïm#$o?ïIæõŽ?ïJ‰]m)?ï&z:/?ï'?ék ?ï‚„_f?ïH,[c?ïÝØW?ïÞ¢¸ë?ï¸x29h?ï¹=˨?ï’hòL?ï“.„<°?ïk«¡Ïz?ïlq,ŸG?ïD;ÌAï?ïEO»µ?ïùn?ïÜu#¯?ïóBòì¸?ïôg­?ïÉÁ~©?ïʆƒÛÛ?ï ŸŒý"a?ï  Rc÷?ï t¤5£j?ï ui”,æ?ï I z ˜?ï IÑÑ"£?ï Ç"Ž/?ï Œr2y?ïïÏÖ‚Ð?ïð•­í?ïÂ$,åœ?ïÂém“?ï“ÉÎC6?ï”n°?ïdÂj?ïe‡@¥˜?ï5¤ˆº?î«çíÏÐ?ã=®˜?¦-»­?î©'òñ™æ?î©(µØéÉ?î§ÇVz¡´?î§ÈY0?î¦f í<7?î¦fÎÃ×?î¥Þ Ú?î¥Ú« y?{d§?>(×?î¢>3ãª?î¢>õÏA§?î Ú=š?î Úÿ¸!U?îŸuÂL1?îŸv`køs?îžV^àS?îžÿ­p?cwâþ?&̵?î›CÃ,êO?î›D…»ìR?î™Üyú[?î™Ý<€q6?î˜tˆòI¦?î˜uKoo±?î— ì»5?î— ¯/Lï?î•¢£yñØ?î•£eå*ô?î”8±Ÿ b?î”9tG²?î’Î:?î’ÎÚ“@Z?î‘bÓûw?î‘c–K7œ?îöã ol?î÷¥Sœ?IÒ¡~? Àz?î ZÓv?îËàŸ?^sæ?àŠk?îŠ@‡ Tl?îŠAI010?îˆÑGÀ‰‹?îˆÒ ÚGÍ?î‡aa‚;ÿ?î‡b#’ך?î…ðÑnÒ?î…ñ“ã‹?î„”¯jÖ?î„€V­´i?îƒ °tÍ?îƒr’?î›%ç>8?î›çÓ%?î€'ñY^?î€(³< ¦?î~´-îÜ?î~´Ób?î}?‰¦ì¯?î}@KwÑ?î{Ê[Ê£?î{Ëñ?îzT„l]Î?îzUF*K?îxÞÍg?îxÞÃÀÓ?îwfØ$ ž?îwg™Ï)›?îuïsrÚ?îuïÊ&ä?îtv™Å¤?îtwQ2 ˆ?îrýkÛ˜Ÿ?îrþ-j–?îqƒ¡d×?îq„bêrú?îp 15ý ?îp ò²3^?înŽ6bs?înŽÙ©.ï?îmT¯c ?îmÁs?îk•êÂH?îk–¬!ô}?îjÛlÝ?îjœÃRí?îh›#Ÿ}R?îh›äìx¹?îgÁ¨v?îg‚ëò³?îe¹ž¸?îežzØ?îd |hâ?îdͬÛÇ?îb·;ÔÙ?îbžxb¼ ?îa¸/Äé?îayMZ?î_›dö?î_›ÔwÇó?î^ÉÒÍ?î^ŠÜ0@?î\•Ø{%S?î\–™{·?î[=·B ?î[þ®3ô?îYý‡ºR?îYŽ¾u ?îX ãÿ:?îX ÙǤí?îVƒŒÕÜ?îV„M¯‰L?îTýW¹@Æ?îTþ‰‰À?îSv}†+j?îSw>L¿Ô?îQîÿ1a¶?îQï¿î=~?îPfÙ̱^?îPgšÐ]?îNÞ ¹Ãq?îNÞÌc!w?îMT˜åX‰?îMUY„ñ?îKÊ‚Bh:?îKËBØ8?îJ?Äë@?îJ@…wÏ?îH´_EIâ?îHµÇzþ?îG(U3úL?îG)¬Uà?îE›§¨ d?îEœh¢`?îDSæé?îD(K,?îB€Wñ1?îBKó_?î@ñ¸ ìë?î@òxZÉR?î?btügé?î?c5CZK?î=Ò‹ò¬»?î=ÓL/°ú?îÙô¨?î²N#´?î³ < ?îyÝH?î87]$?îmÿBù@?în¾Yô?î Êä#½®?î Ë£/q9?î '(—ôê?î 'ç™}º¸â?íÝ?;‘Ïä?íÛˆ…öŒ’?íÛ‰CÂÄ?íÙÑìŠÎÃ?íÙÒªL!¡?íØ´Áì¦?íØrxW‚?íÖbßkâ$?íÖca?íÔªj%ù¤?íÔ«'ƈ±?íÒñS ¾ë?íÒò6Z?íÑ7Ÿ§å?íÑ8\©K:?íÏ}Mmþ^?íÏ~ í¥ù?íÍÂ\2|ö?íÍç$â?íÌÊ P¡?í̇‰ôà?íÊJšrÆ?íÊKWЬn?íÈÍôKÜ?íÈŽ‹GÝ?íÆÐbQV¼?íÆÑ™Øw?íÅVA[?íÅ~o«?íÃS¬õôÚ?íÃTj(KÖ?íÁ”g;Þ?íÁ•$bJ¤?í¿Ô‚Àõ ?í¿Õ?ÝÀ?í¾þCö?í¾»Tv?í¼RÜìe¦?í¼S™ò8!?íº‘†(ò?íº‘Ü€Ðˆ?í¸ÎÃÇ8?í¸Ï€¶°É?í· Èn‘?í· …R׈?íµH0Ÿ•2?íµHíx¤~?í³ƒý!Åë?í³„¹ïš¬?í±¿+²JR?í±¿ètà?í¯ù»®?í¯úwËÿ?í®3®aºí?í®4k ȃ?í¬mb8 ?í¬mÃûz?íª¥Àؼõ?íª¦}n2W?í¨ÝÜ‹?í¨Þ™1t?í§\KÚ?í§ ]?í¥LA¤,?í¥LþŠø?í£‚‰˜·Ü?í£ƒFÎ ?í¡¸34³`?í¡¸ï‘h?íŸíA„Ǩ?íŸíýÖä?íž!µK®a?íž"q‘”_?íœUŒXé½?íœVH“b˜?횈Åywß?횉¨¬?혻c²Šª?혼Ö‘?í–ígÅ’º?í–î#ݬæ?í•χÝí?í•‹”{~?í“O™É¯ä?í“PUÊÌï?í‘ɉ3A?í‘€…~Ëð?í¯_†Uz?í°peü?íÞYœX?íßz˜Ï?íŒ ¶ž!s?íŒ rq÷?íŠ:yƒ‹?íŠ;5JëÕ?íˆg£ xÍ?íˆh^ÆAö?톔1ð]?톔ìÄ?í„À"wž?í„ÀÞ¢?í‚ëz#ž{?í‚ì5¼‰·?í8Ö=@?íôcˆ?í@\uô³?íA÷Ž/?í}iãÜÞ?í}jŸRÈÞ?í{’Ñóåp?í{“^Â?íy»'v5P?íy»âÔ·[?íwââP[¦?íwã£#•?ív _× ?ív ¼¦á?ít0‡†‡D?ít1BÁÏo?írVu~,r?írW0­¯?íp{É8å!?íp|„\žY?ín —«F?ín¡<¯—@?ílÄ¡uXH?ílÅ\s9?íjè)Š'¸?íjèäŠmÜ?íi ÍÞV?íi ÒÂKÛ?íg-k$„?íg.& ?íeO&b:Þ?íeOá>ë¬?ícpJ=äh?ícq±5?íaÔ´¢?ía‘y‡?í_°Ä­Æ?í_±f¿o?í]Ðö·ü?í]Ð×£Áè?í[îÞD´à?í[ï˜åË¡?íZ š¢—?íZ Á/Âb?íX*”âÛn?íX+Olo?íVG‹ãõŠ?íVHFa?íTcìQ÷Ò?íTd¦Ãÿ?íR´5!ï?íR€nš@ ?íPšâz¸C?íP›œÓÌz?íNµyâàð?íN¶4/ç…?íLÏ{ H±?íLÐ5a=ê?íJèä@t²?íJéžuTÇ?íI´3Ú“?íIn\¡·?íGí´ ¬?íG§Ð¸#?íE1‘rFþ?íE2K‚Ñ?íCHT¸?íCIW…ºŸ?íA_ÔÔ ?íA_ÊÍþ?í?tîÄ ?í?u¨ Öd?í=Š6÷-?í=ŠïñÚ ?í;žæ÷?í;Ÿ —fÏ?í9²ÿ+`X?í9³¸òÙ%?í7ÆõžÐ?í7Ç;°Üú?í5ÙoÑÄ?í5Ú)€–?í3ëÆÚêI?í3ì€}¨?í1ý† ÐÚ?í1þ?£H¼?í0° f?í0i—;¸?í.Eˆ·8?í.ÿ˜K?í,/D¢>J?í,/þÎa?í*>¬V8?í*?e»sq?í(MD°^?í(N8“H?í&[¾W…?í&\weÞR?í$ifûç˜?í$j <?í"vxë»à?í"w2A?í ‚ö‚—?í ƒ¯©ù³?íŽàk,ä?홆?íš4ÑîÁ?íšíàqH?í¤ò¹*?í¥«»:4?í¯´À?í¯ÕªZ%?í¸³m¯,?í¹lVÏŠ?íÁµµn?íÂmòXb?íÊ ²v?íÊÙ‚*F?íÑøЃ?íÒ±“®…?íÙ>ºÙ?íÙöÎÏg?í ßî¿âF?í à§jj°?í æ ÐY®?í æÂnRZ?ìZÛÃm&N?ìX±#ˆ?ìX±Ð7J&?ìV†žf¡ã?ìV‡RŠ¼?ìT[•ÆÆ?ìT\I¥`d?ìR0’¼?ìR0·™ß¸?ìPèúÿ!?ìPœôþ?ìM×DgP ?ìM×øS| ?ìKª¤}?ìKªÈ÷û?ìI|]T[?ìI}íÑ«?ìGNþùÇ?ìGNÐÁšk?ìES_^Ù?ìE g?ìBïÿƒD§?ìBð³*!°?ì@À#qZP?ì@À× Ps?ì>¿µ(è?ì>s@4Å?ì<^ÒóD?ì<_†pbJ?ì:-\rê–?ì:.â¯?ì7û^5òÞ?ì7ü—+?ì5ÈØÆ¿2?ì5ÉŒ?ì3•ÊÍû”e?ëù­ï齯?ë÷lö>"?ë÷l´½?ëõ*B½tò?ëõ*ôuðG?ëòçü²a?ëòè®lÑÂ?ëð¥2âü?ëð¥ä~¼>?ëîaå¡<Š?ëîb—.š3?ëìÄZÍÞ„?ë¤êr ?ë¤êÃÙʨ?뢕ü¤6?뢖¬OÁ‚?ë AcýµÚ?ë BšpÏ?ëìKâp?ëìûpwÎ?ë›–´Í®ð?ë›—dL¿?ë™@¤üú?ë™AM3¬?ë–êÕW?ë–êµ6°­?ë”’ï%‹?딓žcžØ?ë’;YÒp~?ë’< a?ëãEŠ…?ëãô79Ó?늰7=?ë‹_5üÈ?ë‹1œ©Ç©?ë‹2KÀ M?ëˆØ Hké?ëˆØºPT…?ë†}úØÞr?ë†~©ÑÓÞ?ë„#jË¿1?ë„$µ¾B?ëÈ\Ë]°?ëÉ ¦cE?ëlÑPô?ëm€ ð?ë}ÇIÇ ?ë}vÐ_?ëz´>+!?ëz´ìÙz?ëxW7šQ ?ëxWæ9Q÷?ëuù´ü°?ëuúbžóé?ës›²|F4?ësœ`ý1.?ëq=2V¹¬?ëq=àÈ•C?ënÞ5@Š÷?ënÞã£T?ël~»°€/?ëlj3µ?ëjÄÃ?ëjrá®—?ëg¾O|˜ö?ëg¾ý²õ?ëe]]íb:?ëe^ ÂO?ëbûðejH?ëbüž|¨^?ë`šÞJ?ë`š³æc?ë^7Ð5(?ë^8KÉ%í?ë[Ô¹Õ¤F?ë[Õg¿iÁ?ëYqZc²Þ?ëYr>Iý?ëW ~w4Æ?ëW,Bšr?ëT©%Š+?ëT©ÓF\?ëRDQ3CÂ?ëRDþà=A?ëOßæø?ëO߯„‚‹?ëMy6¤¬i?ëMyä3-|?ëKîèºñ?ëKœgû-?ëH¬,EÙ¢?ëH¬ÙµÕú?ëFDï/pÓ?ëFEœ&ó»Hš?êÎ?ž!á?êËÀIx?êËÀóÍñp?êÉA+‡,?êÉAÕW‹Þ?êÆÁ˜ñqË?êÆÂC'”â?êÄA’AO*?êÄBA?ꦪ¥E»?꣘+Í?꣘ǂkÖ?ê¡ÉF?ê¡r[ªg?êž‹a^n?êž‹«—á&?êœÉE?n?êœrk¯æ?ê™|[?ê™|Æq\v?ê–óÿõj?ê–ô¨û­?ê”kqz¼T?ê”lpå ?ê‘âq"I³?ê‘ãTÝ?êXþ‡Ú?êY§]ÄÞ?êŒÏû’?êŒÏÃÀÊ&?êŠDÆáG¾?êŠEo–éT?ꇺt›w?ꇺª>?ê….ÊRk?ê…/r縥?ê‚£"Æíb?ê‚£ËL ?ê€ 7 ø?ꀳ«÷?ê}Š‚ßll?ê}‹+D%ó?êzý‰^ê?êzþ1³l¶?êxpþ“¢?êxpÈBÜÁ?êuâG"¤ ?êuâïV°Ð?êsSþ S³?êsT¦.!Q?êpÅDV ?êpÅìi¨M?ên6Kݨ?ên6ÃO$¡?êk¦ƒNñV?êk§+AðØ?êi{¡ea?êi#„¨?êf†å/?êf†«·—[?êcõ\Ú¢?êcõÅó ?êacÈkP$?êadp?ê^ÒUÄ?ê^Ò«öz?ê\?нŒì?ê\@xN¥˜?êY­.äA?êY­Ödÿ?êW+R„?êWÆ›²è?êT† Ùß~?êT‡H9ߢ?êQò³”áè?êQóZä ?êO^X˜´?êO^ÿ×ëæ?êLÉFË&?êLÊ7uš?êJ4YèÕÍ?êJ59•?êGžµ%Fd?êGŸ\3ù›?ê?Ûß•u?ê=CÞ,ªÁ?ê=D„øÍÔ?ê:¬y t?ê:¬¾4µ?ê8ä„w}?ê8‹/ ì?ê5{DoÇ?ê5{ë8X?ê2â7mr?ê2âÝ÷—?ê0H¾'‹P?ê0Id¡*?ê-®Ù+??ê-¯”Tå?ê+‡ÉÒÛ?ê+."]?ê(yÉ®‘?ê(zoö a?ê%Þ ýº?ê%ßF?hŠ?ê#C 6—T?ê#C±]nz?ê § „?ê §°£Äè?ê ¸ò ?ê C¾™Ó?êmÅåñ˜?ênkÚý°?êЃrç†?êÑ)WUI?ê2Õµã?ê3{‰¯Ô?ꔼ\…«?ê•b®Ä?êö8ê$?êöÞClí?êWJ°¿2?êWðR™ ?ê ·ò„}?ê ¸—¥²¼?ê .kR]?ê ÓëÒZ?êxÜ.X?êx¦Kýs?ê×iÄU¾?êØ#qX?ê6h~¬?ê7 Íw?éþ”ü»‹R?éþ•¡ù8?éûó'Ÿ@p?éûóÌÌ1·?éùPé†/÷?éùQŽ¢c?éÑž$³jÍ?éÑžÈÓC¥?éÎõ`ÉFîo3,?é¬?‘¡{i?é©‘åvL?é©‘5³}?é¦áÐpNo?é¦âs€~?é¤2ªg¢æ?é¤3MfÂ~?顃;"÷?顃Â)0?éžÓ.§\ž?éžÓÑ„T“?éœ"Ù·B?éœ#|‚æ¥?é™r Áb_?é™rÃ|(µ?é–Á8^z?é–Á¥âB?销ÙÑ¢?é”#r\\?é‘]š­²Ø?é‘^=5 ?鎫Q ¬?鎫ó€ñÎ?é‹ø£dëU?é‹ùEÊ ?é‰E‘{‘Ý?é‰F3χ˜?醒SÝz?醒¾–§Å?éƒÞDCíJ?éƒÞæu‰¯?é*Â-„?é*ªâ™Œ?é~uiŽæì?é~v ž ?é{Àg¬¹Ÿ?é{Á ª½…?éy qEã?éy ¥^ ?évU¯?èy±ÌŠÎ?èy²h ic?èvÚð'2Ã?èvÛ‹ªÁ?èt½ùŽý?ètYk¶?èq,6ÊaÎ?èq,Ò)ÐË?ènTZã;?ènTö0`c?èk|)êõ6?èk|Å&èUG?èeÊÉ%Ëß?èeËd<âÛ?èbñšgÆõ?èbò5l±?è`.|·?è`²![?è]>?WÍ=?è]>Ú8Œ.?èZd§¾r?èZd®v[Û?èW‰”fÍ}?èWŠ/#GL?èT®Á@s?èT¯[êX’?èQÓšP|?èQÔ4ª|Ô?èNøŸ””?èNøº%—?èLR/ÓÙ?èL죪r?èI@1oÓ)?èI@ËÑ{Ê?èFc½?Š?èFdW3?èC†ö^³¶?èC‡›ú2?è@©ÝÓ?è@ªw?åf?è=Ìqs¬?è=Í )OÑ?è:î²2‹~?è:ïL9/b?è8¡8¤¹?è8;-R?è52>ið?è52ØLY?è2S‰v u?è2T#F]?è/t‚@$?è/uþ;¤?è,•)ƒNâ?è,•Ã.ºò?è)µ…”$?è)¶»Á?è&Õƒù/I?è&Ö€l?è#õ6Á ?è#õÐ5£®?è!˜–¨Æ?è!1øöæ?è3©À Û?è4C"v?èRiñ?èS.È&?èpÙ l^?èqr8Îè?èŽ÷Ìv ?èå† ?è¬Ætÿ?è­_zÃz?èÊD¹U×?èÊÝ­ºÌ?è çr+^?è è c7Î?è P€ãv?è éP•f?è ÞýÙW?è!w».Î?è=®Ú%?è=¶YÑ'?èY yÃ;?èY¥YÌ?çþt¬Õ6?çþuD˜ `?çûü»ç>?çû•/· ?çøªþ0™[?çø«–’Ñ?çõÅ°V•:?çõÆH¥–c?çòàßF?çò଱-?çïú)¯{?çïúÁ8Ú/?çíïŸv´?ç퇷3A?çê-gyq?çê-ÿ~Sã?ççF‘J©n?ççG)=ƒÔ?çä_mXzˆ?çä`8àô?çáwû^ `?çáx“,â?çÞ;DAà?çÞÒÿºˆ?çÛ¨-¸?çÛ¨Åa`?çØ¿ÒýRX?çØÀj“Õˆ?çÕ×*Ñ;?çÕ×ÂU@¥?çÒî5TÖ?çÒîÌŽÚÞ?çÐòŒå*?çЉëé¿?çÍcc/¯?çÍú¯°ê?çÊ1‡_„?çÊ2™|?çÇG^jù4?çÇGõ’n?çÄ\é0:’?çÄ]€E&M?çÁr'ñ¯6?çÁr¾ôþ?羇oÂî?羇±_–Þ?ç»›À•ÍJæ¬?猾ÓþBj?ç‰Íïô°?ç‰Î„±¢+?ç†ÝVÀ<ð?ç†ÝìN:W?çƒìu À€?çƒí œ ?ç€ûJ"&£?ç€ûߊ¾m?ç~ Öbn´?ç~ k¸P÷?ç{"Ä?ç{¯e0³?çx&*nÓ?çx&ªZà¡?çu3Çl8ž?çu4\‰ï|?çrA1ƒƒS?çrAÆŽ}v?çoNS°Oò?çoN訋’?çl[-½•¦?çl[£÷?çig¿œÍ%?çihTo†\?çft è1Þ?çftž¨'5?çc€ ßh3?çc€¡Œ—ä?ç`‹ÈNæ>?ç`Œ\éNƒ?ç]—<(à.?ç]—а??çZ¢iáç?çZ¢ýz¶?çW­O%^?çW­ã‡"¿?çT·îTfX?çT¸‚£Ÿ>?çQÂF†æ¦?çQÂÚÃON?çNÌXSK?çNÌì|á¾?çKÖ#øhH?çKÖ¸+5?çHß©El?çHà=I}Þ?çEèè.¨Ø?çEé|¿?çBñáHŒ=?çBòu&É~?ç?ú”ÑÌÕ?ç?û(/f?ç=› ?ç=–SšÄ?ç: *™)?ç: ¾>¿%?ç7 _ ]?ç7 ñÒz?ç4«*ÿ¦?ç4>ªæ-?ç1"ÏŒ?ç1"—< Ä?ç.)@²ñ?ç.)ªšÑ$?ç+/æm\?ç+0yX¤Õ?ç(6p~áj?ç(7³0v?ç%<¶\“ä?ç%=I}øÐ?ç"B· áÌ?ç"CJ¯Zã?çHtÛg"?çIÖò´?çMîIŒÉ?çN2)'?çS#À*?çS¶•ÕŽ?çX6_F?çX§ù+?ç\Ã:’?ç]Uéà6?ça.f ?çaÀ¥4Ø?ç eUweJ?ç eèÝ?æþv-ùöR?æþvÀ$Þ„?æûxįF±?æûyVÇ-W?æø{]0?æø{«b?æõ}+Ü™÷?æõ}½Îx™?æò~ü&øØ?æòŽÑ?æÅ/±?æïÿ¿?æì×ó&Ù?æì‚i«í,?æé‚ã‹h?æéƒu0Ñ_?æ惭‡7U?ææ„?åP?æã„6nÈ©?æã„Çîh ?æà„~}E‹?æà…éÔ´?æÝ„…Ž@0?æÝ…罆?æÚ„Kœ´®?æÚ„Üã“?æ׃Ñ.6Þ?æׄba‹¸?æÔƒ}ø¶?æÔƒ§ž6í?æÑ‚hȤ?æÑ‚¬uîž?æ΀ßêlá?æÎpäy?æËd†Ïæ?æËõmÀž?æÈ}©xÁD?æÈ~:L”û?æÅ{®ž^½?æÅ|?_Ý?æÂysô2¶?æÂz¡Çª?æ¿vùüŠy?æ¿wŠ–ý®?æ¼t@ñÖ5?æ¼tÑy&?æ¹qH³ƒØ?æ¹qÙ'®Ü?æ¶n>Ìû?æ¶n¡ŸÑŒ?æ³j›^Ê?æ³k+b;Y?æ°fænf§?æ°gv©§?æ­bó-‘E?æ­cƒU(?æª^ÁOÃ*?æª_Qdb?æ§ZQT"?æ§ZáUO?æ¤U£t~?æ¤V3b|Á?æ¡P·’±”?æ¡QGm}Ž?æžK­oå?æžLu ?æ›F&BPQ?æ›Fµöµ?æ˜@Š´|?æ˜A+ãg?æ•:ŸiЬ?æ•;.÷È1?æ’4Þúð?æ’5Y¹‡?æ.#f3^?æ.²Í·…?æŒ'Š8š‚?æŒ(Œâ¶?æ‰ ´:’º?æ‰!C{y?憡l%0?æ†0™ð÷?æƒRGÎK?æƒábYœ?æ€ ÇRt?æ€ V ›Ï?æ}ÿ@#?æ}ŽF ?æyúûÝk®?æyûŠ¾,¢?ævò¼oÀg?ævóK=:í?æsêA| e?æsêÐ6Ó?æpáŠêÞ-?æpâ‘Çf?æmؘ»öå?æmÙ'O•@?æjÏkgF‚?æjÏù瘆?ægÆ$ô@?ægÆ‘‘øv?æd¼_Üó„?æd¼î6¨v?æa²‘jÆ?æa³×Îü?æ^¨h¸GÂ?æ^¨öëYÉ?æ[ž‰P¡?æ[ž£©?æX“‡í¤]?æX”ú ª?æUˆ¿è?æU‰Má,Õ?æR}½í$±?æR~KÒßz?æOr‚43?æOs”}?æLg §”8?æLgšfšÁ?æI[]JÉÎ?æI[êöt?æFOtì?æFP)8?æCCR°§¦?æCCà5•?æ@6÷•çš?æ@7…tz?æ=*cD¯Ù?æ=*ð¢ÚÁ?æ:–.?æ:#yHŠ?æ7Š*Þ?æ7ÁŸ?æ4RD9?æ4ßh5¢?æ0õÛaŽ’?æ0öhr#‹?æ-è,R4|?æ-è¹O`x?æ*ÚELžz?æ*ÚÒ6`?æ'Ì&>’ó?æ'̳èÉ?æ$½Ï-Œt?æ$¾[ðu"?æ!¯@ˆ?æ!¯Í7‘8?æ z„nÛ?æ¡ y?æ‘}fí?æ’ ™ÿÜ?æ‚H5í?æ‚ÔªC2?ærÜ\Å'?æsh¾wc?æc9¾7Û?æcÆ t³?æS`I`?æSì„&&?æ CP¢?æ CÜ,cœ?æ 3 ]v?æ 3•pêø?æ"Œ†âÜ?æ#‡?å_}»XÐc?å\aðC,?å\bx qß?åYF.SÓ?åYGãÙ9?åV*à<{Ã?åV+gÞ?”?åS}Cx?åS› D‘?åOóHÄ,?åOó Ãl?åLÖñÐ1m?åL×y6©³?åIºµç?åI»$fh?åFž#x]?åFž¢bcS?åClVXR?åCózò?å@dÝL8?å@eô¥h?å=Gˆ¹f‚?å=H¼õ%?å:*SûL¹?å:*Úë³?å7 òø½f?å7 yÔ³ž?å3ïeâY(?å3ï쪆?å0Ѭº+Q?å0Ò3n„½?å-³Ç‘W#?å-´N1à„?å*•¶¼kÊ?å*–=I$ ?å'wzkŇ?å'xä«•?å$Y¢R™?å$Y™e_?å!:qÉ[?å!;ÃÄ?åÁ-~8?åGjç3?åüØï?åý^/"j?åÝÃýÙ‚?åÞJ”o?å¾…(?å¿ *ak?åŸ׺ï?埡ÅÃ?åˆ;jˆ?倘m?å _ÊX?äÜpBÉ¥?äÜpÆŸ¿½?äÙMôŒÔw?äÙNyÞ€?äÖ+G%v?äÖ,»Bt?äÓâF;?äÓ fßu2?äÏæcÔù?äÏ械ï?äÌÃ2ýÅ?äÌ÷6?äÉ  b2=?äÉ ¤†‘F?äÆ|æÜ£œ?äÆ}jí¹?äÃY†›c?äÃZ —ÝZ?äÀ5ÿ¨?$?äÀ6ƒÅ‰?ä½RËž?ä½Õí]6?ä¹î~7ux?ä¹ïøP?ä¶Ê„2Oˆ?ä¶ËÞô­?䳦dö>?䳦笣¿?ä°‚òv]?ä°‚¡w+G?ä­]²#„?ä­^5‡Þè?äª9 ¯Õð?äª9¤ –ß?ä§iÇ÷¤?ä§í½/?ä£ïv ?ä£ðªÍÚ?ä ÊŒNw?ä Ë#t?ä¥ešmC?ä¥è§;?䚀JŒ?䚀CZÈ?ä—Zª)¨Ç?ä—[-wŒ?ä”5~ÿ¬?ä”5˜OÍŒ?ä‘\wã%?ä‘ß4¯9?äé!W ?äêÊ j?äŠÃ}’Þ?äŠÄ'‰f?ä‡X^²?ä‡Ú“ü?ä„wÍ;¾?ä„w‘9÷§?äP¡Ñ"¿?äQ$)Ød?ä~*5èõ?ä~*“z—t?ä{]@ȯ?ä{ßqo&?äw܆˜þ?äwÝ;6Ž?ätµ‹ÝáÈ?ät¶ æu’?äqŽn–ëí?äqŽð‹u?äng.âì?äng°n`?äk?Ëïn?äk@M»ßF?ähFÊÌN?ähȃ0Z?ädðŸ8ºÁ?ädñ ݺ?äaÈÕ|a#?äaÉW ¨/?ä^ éÂ-[?ä^¡k>d¢?ä[xÜ%?ä[y]‚L7?äXP¬al?äXQ-ñv¢?äU([Ž´?äU(ÜΡ?äQÿéŠ?äRjDqY?äN×UMM«?äN×Öe)‰?äK® Fø?äK¯!IØ?äH…ÊD?äH†K3·˜?äE\Ós ?äE]TN³%?äB3»äÁÓ?äB4<¬E·?ä? ƒ³:?ä? fn?ä;á+ ®?ä;᫽_¸?ä8·²Q¨P?ä8¸2Üá¹?ä5Ž_ü?ä5Ž™×?ä2d`ckW?ä2dàÆo?ä/:‡›<ä?ä/;ê$¢?ä,2ôæ?ä,m¿Ø?ä(æw=uÏ?ä(æ÷d#+?ä%¼?ÕŠ?ä%¼¿è?ä"‘é9ˆÀ?ä"’i7øœ?ägs”³?ägó‘?ä<Þú¦.?ä=^ÐÕu?ä+†’›?ä«H p?äçYuÙ1?äçÙ#ÄÒ?ä¼hóq?ä¼èX?ä‘Zûí?ä‘Ù™ â?ä f,ò«t?ä f¬d+ò?ä :áÌà?ä ;a)w(?äxË#o?äøXÄ?äãòºù?ääq9É?ãÿ¸M”Ö?ãÿ¸Ìµ½T?ãüŒ‹·—?ãü ÃÂ¥?ãù`¬•âº?ãùa+Žxæ?ãö4°GÞ?ãö5/+‡o?ãó–æÿ ?ãó ·AÜ?ãïÜ`°6×?ãïÜßlN?ãì° Í-^?ãì°ŒuË?ã郞T.v?ãé„çíl?ãæWaíð?ãæWá¸?ãã*j01Â?ãã*蛕ª?ãßý¥é+!?ãßþ$@`v?ãÜÐÅ£Ñ+?ãÜÑCæ×;?ãÙ£É}2ü?ãÙ¤G¬ ?ãÖv±®5?ãÖw/ÈÚ’?ãÓI~`×c?ãÓIügK‚?ãÐ/¬®}?ãЭžð˜?ãÌîů,û?ãÌïC_³?ãWíáD?ãWhã8?ãSçåi ?ãSè`EÁe?ãP¶È25?ãP·Bú‹F?ãM…•›åt?ãM†PÇ?ãJTMÖB…?ãJTÈv“?ãG"ñþy?ãG#k”Š¾?ãCñR2ˆ?ãCñùÉr~?ã@¿øÒúB?ã@Às5íe?ã=Ž]ºr¤?ã=ŽØ q?ã:\®01Q?ã:](j‰G?ã7*êRÞÑ?ã7+dxèm?ã3ùCåE?ã3ùŒU ?ã0Ç&1—a?ã0Ç /Ë?ã-•&CeÈ?ã-• ,[?ã*c˜~³?ã*cŒmIò?ã'0ëR“þ?ã'1ek?ã#þ°ŸE*?ã#ÿ*KnK?ã Ìb¥Í–?ã ÌÜ=¤ð?ãš…Ý„?ãš{ b?ãgaxš?ãhЪù?ã5e|Ð?ã5À[ÿ?ãl¸ô“?ãåÿ€?ãÏÀ| ?ãÐ9®Wé?ã ÑD?ã zï&î?ã j0ä…à?ã j©î­?ã7MÜÉ ?ã7ÆÒ\?ãXÚÈV?ãÑ»ª»?ãÑR?ãÑÊÍ?âýž9{Ÿ?âýž²3KØ?âúkoŒi?âä `þ:?âä‚vm ?âàÏYR[?âàÏÑSoè?âÝ›˜ ë.?âÝœ÷¤ü?âÚgÆ®\?âÚh>†nÄ?â×3åe$¦?â×4])'D?âÓÿôVWì?âÔlþ[?âÐËó¤U?âÐÌk?žù?âÍ—ãrÆà?â͘Zù³È?âÊcÃêZH?âÊd;\éÙ?âÇ/•1 Õ?âÇ0 ?¯?âÃûWj ‘?âÃûγÝU?âÀÇ ¹6Æ?âÀÇî¬?â½’¯F—ô?⽓&g®o?âº^E8“?âº^¼D¼Ý?â·)̱[?â·*C©s?â³õEÕüJ?â³õ¼¹ô!?â°À°Î þ?â°Á'£“?â­Œ ¾ôf?â­Œ„z+a?âªW\ÌÄí?âªWÓsšõ?â§"žâc?â§#®W!?â£íÑÓ °?â£îHQÍ?â ¸ø·ö?â ¹ni?â„o?ℇc½ë?âšOÛÙ ?âšO“ÅK?â—¦Ê?â—‘Ò?â“å ’PN?â“僪vX?â¯òŤK?â°hÉfÁ?âzËdì!?â{ATJ´?âŠE—•˜ª?âŠF p“ ?â‡W|Ö.?â‡ÍCl?âƒÛ @œ?âƒÛ€ò4­?‥³B‡?…(¢~?â}pNîjÊ?â}pÄwÑ[?âz:ß#|A?âz;T˜}#?âwcÉAÿ?âwÙ)Üè?âsÏÝ?âsÐRQO¦?âpšJû;Ü?âpšÀ3 ø?âmd­Ð†È?âme"óî?âj/«&D?âj/zº&y?âfùR°ºÐ?âfùÇ«S«?âcÕÝ ?âcÄ ëÛ?â`ÌÌ@4?â`ŽAž ?â]Wú-€?â]Xnêá:?âZ"Nqš?âZ"‘÷jj?âVì6RÚ?âVìªæ§?âS¶E\û¿?âS¶¹Ý#?âP€J– Ï?âP€¿Þñ?âMJF#‘5?âMJºzåõ?âJ8'»†?âJ¬j¦©?âFÞ Çñ?âFÞ”õ†;?âC¨(Òz?âC¨tBé°?â@qÖsbä?â@rJyÌ?â=;£È•Ì?â=<¹Ø-?â:hL¨Q?â:Ü)ô?â6Ï$'_º?â6Ï—ïÌf?â3˜×2Ú?â3™K34Z?â0b‚um\?â0bö{?â-,%.$Ú?â-,˜¹Oc?â)õ¿Ñ‚J?â)ö3HA ?â&¿R†1¹?â&¿Åè„~?â#ˆÝlí?àþöxe™Å?àþöäo°0?àû¿š§›'?àûÀBÌ?àøˆÂZ±8?àø‰.;ê9?àõQï­ôä?àõR[z¿e?àò"Ë¿0?àòŽ„V?àîä[ÉçŠ?àîäÇmÕz?àë­šÉGj?àë®XÇK?àèvßù-ø?àèwKt?ð?àå@+„ K?àå@–ê°„?àâ }bz?àâ èÑ™?àÞÒÖ íÒ?àÞÓAI·?àÛœ5Y.N?àÛœ ‚Š@?àØe›‘² ?àØf¦ ç?àÕ/Ê›“?àÕ/sË…?àÑø}$Žõ?àÑøè¤+?àÎÁøÏ>±?àÎÂc¦çY?àË‹{õQÒ?àˋ渎?àÈU«”@?àÈUqZd[?àÅ™Œk?àŬð‰?àÁè3Z!:?àÁèà?ྱխ Ñ?ྲ@šŒ?à»{€Èœ?à»{ê|éò?à¸E2ÒÂ+?à¸ExQ?àµíö Õ?àµX*U?à±Ø±´w¶?à±ÙÔX?஢~",R?஢è-¢-?à«lS_{’?à«l½V‡?à¨61œ¦V?à¨6›GÂ?क़â?ूÒÐl?à¡Ê «Â?à¡Êsdí¦?àž”°wˆ?àž”mUÜ?à›^E E?à›^pÖ?à˜(“ß0?à˜(~qŒ?à”ò+°p~?à”ò•š(?à‘¼LºàG?à‘¼¶¡~?àŽ†wãÄ£?àŽ†á#§?à‹P­V2H?à‹Q#[?àˆí%]A?àˆV;æ¦?à„å7qL?à„å sn ?ௌj½6?à¯õXx?à~yì<ÙŽ?à~zU-z?à{DVú‡?à{D¿¿tl?àxÌóN?àx5t:D?àtÙMÉG?àtÙ¶egê?àq£Ú6|@?àq¤B¾7^?ànnrñŽ?ànnÚ‘G,?àk9Ÿz?àk9}þjˆ?àhÄì ¸?àh-6¬7?àd΀/5J?àdÎèe\*?àa™G{ x?àa™¯œÍ?à^dï^}?à^d‚ü½?à[.ú½b&?à[/b¶\ú?àWùçsd?àWúNõ Ñ?àTÄßúžÜ?àTÅGÊÓ3?àQ囉Œ?àQMW[?àNZø$ˆS%,s?à>S‚f´³ˆ|?à+¥zÒÁ?à'ãöÀ F?à'ä]sŒ4?à$¯½‹•ô?à$°$*#è?à!{“%k?à!{ù¯›v?àGw­iW?àGÞ#!0?ß|”<šë¿?ß|•Â3?ßv0.´•º?ßv0ö³=u?ßoÌGx€²?ßoÍN‰[?ßih‡Ké?ßiiNù.:?ßcî†J?ßc¶ y?ß\¡}F1‘?ß\¢D¢bà?ßV>3È™ä?ßV>úü0 ?ßOÛr¾0?ßOÛÙ}º1?ßIxœ—F?ßIxà~ú!?ßCIcâ÷?ßC­¯?ß<²¢˜ž?ß<³h–Ì5?ß6P#ç»?ß6PêO¸9?ß/íÏ`gw?ß/î• oã?ß)‹¤Žâ^?ß)Œj¦VÂ?ß#)£¯_U?ß#*iž@»?ßÇÍ'\»?ßÈ’í¬2?ßf!NåD?ßfæì£Ù?ß BþÏ?ße¸-“?ß £J@_õ?ß ¤Œÿù?ßB¬œþ?ßBäЯX?Þüá ßÈÜ?ÞüáåÛN ?Þö€Mö—‚?ÞöÉ‘È?Þð§-–S?Þð kØ4?Þé¿,êwQ?Þé¿ñl]ç?Þã^ß…V1?Þã_£Þ´™?ÞÜþ¿š?ÞÜÿƒKgó?ÞÖžËæ“’Hs?ÝØ>ÒI”-?ÝÑæLž©?ÝÑç ¢˜]?ÝËŽ¼Y‚G?ÝËyÀ+^?ÝÅ7e}À?ÝÅ8"»ç£?ݾàGºÖ@?ݾáÐâ[?ݸ‰cw‹ ?ݸŠ eJÌ?ݲ2¹ ¯?ݲ3uÑ#ñ?Ý«ÜHª§?Ý«Ý-Ö?Ý¥†A|M?Ý¥†Î¶_ž?ÝŸ0„N€?ÝŸ0ÒÐë;?ݘÚU±˜?ݘÛÕo6?Ý’„Ïá?Ý’…‹Ý+?ÝŒ/…O0?ÝŒ0A#Þ?Ý…Úva‚Ï?Ý…Û2 â?Ý…£p?݆^óQø?Ýy1 “»,?Ýy1ÇîÏQ?Ýrܲ|Ž?ÝrÝm:Ty?Ýlˆ”1`?Ýl‰O;ýÂ?Ýf4³iG—?Ýf5nK«™?Ý_áȦ?Ý_áÊ‚Iú?ÝY©ˆ”j?ÝYŽdŠ–?ÝS:½b?ÝS;;z~ï?ÝLç–¸k1?ÝLèPùù©?ÝF”ê˜gÎ?ÝF•¤±Ä½?Ý@B|ëH‹?Ý@C6Üu?Ý9ðNÅ?Ý9ñàL?Ý3ž^s’?Ý3ŸcÆ?Ý-L®fì?Ý-Mg’ O?Ý&û=CU?Ý&ûö“Ž?Ý ª VŠ·?Ý ªÅ~ßH?ÝY«‰N?ÝYÔ«·Y?ÝkZ“î?Ý $2 ?Ý ·ûžZ?Ý ¸´M÷&?ÝgÌÛíÝ?Ýh…c±ó?ÝßkÌ^?Ý—Ëp^?ÜúÈ3f¨?ÜúÈë3?ÜôxÉ ?Üôyˆ¹?Üî) ®¾?Üî*X– ›?ÜçÚºº†j?ÜçÛryºc?ÜáŒ@É*?ÜáŒÎ×å??ÜÛ=¶{¾$?ÜÛ>mêÃü?ÜÔï˜Ñ.”?ÜÔðPÚ?ÜΡ¾˜šB?Ü΢u·x£?ÜÈT'ê7—?ÜÈTÞáÀ?ÜÂÕ,ø?Ü‹Îê˜?Ü»¹Æ@,2?Ü»º|æÛû?ܵlü â?ܵm²€D†?ܯ v\¯G?ܯ!,³H{?ܨÔ5‹eH?ܨÔë¹õÂ?Ü¢ˆ9ó_g?Ü¢ˆïùèÝ?Üœ<ƒëõ–?Üœ=9ÊyÄ?Ü•ñ86?Ü•ñÉC¸Öhealpy-1.8.1/healpy/data/weight_ring_n00002.fits0000650000175000017530000002640011705033043021674 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:03:03' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 4 / 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 NSIDE = 2 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 2 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 5.569143403334E-02 / maximum value of T weights MINVAL1 = -3.955469343004E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 5.569143403334E-02 / maximum value of Q weights MINVAL2 = -3.955469343004E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 5.569143403334E-02 / maximum value of U weights MINVAL3 = -3.955469343004E-02 / minimum value of U weights COMMENT END ?¬ƒ–o®[ñ?¬ƒ–o®[ñ?¬ƒ–o®[ñ?v*—RK×N?v*—RK×N?v*—RK×N¿‹›qýÄÛH¿‹›qýÄÛH¿‹›qýÄÛH¿¤@ƒE^ä!¿¤@ƒE^ä!¿¤@ƒE^ä!healpy-1.8.1/healpy/data/weight_ring_n00064.fits0000650000175000017530000003410011705033043021700 0ustar zoncaplanck00000000000000SIMPLE = 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 is defined in 'AstronomyCOMMENT and Astrophysics', volume 376, page 359; bibcode: 2001A&A...376..359H DATE = '2005-08-17T23:04:09' / file creation date (YYYY-MM-DDThh:mm:ss UT) END XTENSION= 'BINTABLE' / binary table extension BITPIX = 8 / 8-bit bytes NAXIS = 2 / 2-dimensional binary table NAXIS1 = 24 / width of table in bytes NAXIS2 = 128 / 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 NSIDE = 64 / Resolution parameter for HEALPIX CREATOR = 'QUAD_RING' / Software creating the FITS file VERSION = '1.3.0 ' / Version of the simulation software MAX-LPOL= 226 / Maximum multipole l used in map synthesis COMMENT COMMENT ----------------------------------------------- COMMENT Data Description Specific Keywords COMMENT ----------------------------------------------- COMMENT COMMENT contains D_weight for the north hemisphere of HEALPIX COMMENT each ring has to be multiplied by (1+D_weight) COMMENT in order to improve the quadrature when analyzing a map COMMENT COMMENT computed by SVD using DGESDD from Lapack library COMMENT TTYPE1 = 'TEMPERATURE WEIGHTS' / Temperature weights TUNIT1 = '1 ' / unit TFORM1 = '1D ' MAXVAL1 = 1.769182615475E-01 / maximum value of T weights MINVAL1 = -9.309373410869E-02 / minimum value of T weights COMMENT TTYPE2 = 'Q-POLARISATION WEIGHTS' / Q Polarisation weights TUNIT2 = '1 ' / unit TFORM2 = '1D ' MAXVAL2 = 1.769182615475E-01 / maximum value of Q weights MINVAL2 = -9.309373410869E-02 / minimum value of Q weights COMMENT TTYPE3 = 'U-POLARISATION WEIGHTS' / U Polarisation weights TUNIT3 = '1 ' / unit TFORM3 = '1D ' MAXVAL3 = 1.769182615475E-01 / maximum value of U weights MINVAL3 = -9.309373410869E-02 / minimum value of U weights COMMENT END ?Æ¥Añ´µ?Æ¥Añ´µ?Æ¥Añ´µ¿·Ôý¯u—¨¿·Ôý¯u—¨¿·Ôý¯u—¨?®ÍensqŸ‘¿ut>sqŸ‘¿ut>sqŸ‘?hUÄ£"ð_?hUÄ£"ð_?hUÄ£"ð_¿SöFïP“O¿SöFïP“O¿SöFïP“O¿æ¾WÑ@¿æ¾WÑ@¿æ¾WÑ@?Q`~î\°•?Q`~î\°•?Q`~î\°•¿\ÐÝC¿\ÐÝC¿\ÐÝC?aO¨ÝÎË?aO¨ÝÎË?aO¨ÝÎË¿bân¬½¿bân¬½¿bân¬½?c]lÿ¿?c]lÿ¿?c]lÿ¿¿bAŒ6@•¿bAŒ6@•¿bAŒ6@•?`¤:¡m>/?`¤:¡m>/?`¤:¡m>/¿\ý“«–u¿\ý“«–u¿\ý“«–u?Xˆ€$õŠ?Xˆ€$õŠ?Xˆ€$õŠ¿RÖÀäMdοRÖÀäMdοRÖÀäMdÎ?KB›Oa?KB›Oa?KB›Oa¿ASq«;¶¿ASq«;¶¿ASq«;¶?0oÁ+!jÜ?0oÁ+!jÜ?0oÁ+!jܾ×UMñÈè¾×UMñÈè¾×UMñÈè¿*ƒ±3ýµ¿*ƒ±3ýµ¿*ƒ±3ýµ?8N·Âú=?8N·Âú=?8N·Âú=¿@d+Ûòù¿¿@d+Ûòù¿¿@d+Ûòù¿?CeIdš…¨?CeIdš…¨?CeIdš…¨¿ECõ#¿ECõ#¿ECõ#?FY:žû ?FY:žû ?FY:žû ¿FFÐ)pX¿FFÐ)pX¿FFÐ)pX?EZ5J¢?EZ5J¢?EZ5J¢¿D ‡5¿D ‡5¿D ‡5?BJê]f=}?BJê]f=}?BJê]f=}¿@@nØ´Þï¿@@nØ´Þï¿@@nØ´Þï?<ÀªfŸE?<ÀªfŸE?<ÀªfŸE¿7yÚâëŽ#¿7yÚâëŽ#¿7yÚâëŽ#?2çÑ ¦ë?2çÑ ¦ë?2çÑ ¦ë¿,û4O$Ë¿,û4O$Ë¿,û4O$Ë?$«ÑÓP0?$«ÑÓP0?$«ÑÓP0¿gìB a¿gìB a¿gìB a?ž4 ü›?ž4 ü›?ž4 ü›¾¨Ô[|bϾ¨Ô[|bϾ¨Ô[|bÏ¿ƒòäÃ心òäÃ心òäÃå?i1Úy»?i1Úy»?i1Úy»¿UÞdŠY¿UÞdŠY¿UÞdŠY? O´T? O´T? O´T¿"OõʘtX¿"OõʘtX¿"OõʘtX?#õ%2ûì?#õ%2ûì?#õ%2ûì¿%ÿŒÿoº¿%ÿŒÿoº¿%ÿŒÿoº?%¹L¢‰¸ø?%¹L¢‰¸ø?%¹L¢‰¸ø¿%õ &“¨¿%õ &“¨¿%õ &“¨?%Ψù8}?%Ψù8}?%Ψù8}¿%FMUŠl¨¿%FMUŠl¨¿%FMUŠl¨?$M\aµÀý?$M\aµÀý?$M\aµÀý¿"¶qÝ$¿"¶qÝ$¿"¶qÝ$? ‚ü°A·? ‚ü°A·? ‚ü°A·¿p ùå¿p ùå¿p ùå¾ÁjJ­K°w¾ÁjJ­K°w¾ÁjJ­K°w?1–…1T’?1–…1T’?1–…1T’¿\Ûá)ÖiŒ¿\Ûá)ÖiŒ¿\Ûá)ÖiŒ?.^4ÍæD?.^4ÍæD?.^4ÍæD?ŲüõÄ?ŲüõÄ?ŲüõÄ¿'°ìåì…r¿'°ìåì…r¿'°ìåì…r?0Whb9ž?0Whb9ž?0Whb9ž¿3‡1ãA¿3‡1ãA¿3‡1ãA?5Ò‚É`oÓ?5Ò‚É`oÓ?5Ò‚É`oÓ¿73É‹ï¿73É‹ï¿73É‹ï?7wšõi 8?7wšõi 8?7wšõi 8¿6c¡x¯A¿6c¡x¯A¿6c¡x¯A?3Æ:ãÇ?3Æ:ãÇ?3Æ:ãÇ¿/ˆ³hú[¿/ˆ³hú[¿/ˆ³hú[?#ÌT ±‚?#ÌT ±‚?#ÌT ±‚¿ ŸC ÿô¿ ŸC ÿô¿ ŸC ÿô¿žòô´¿žòô´¿žòô´?$‚u3~ˆ?$‚u3~ˆ?$‚u3~ˆ¿.YdÚ|¿.YdÚ|¿.YdÚ|?18o.*­?18o.*­?18o.*­¿03…#I‡¿03…#I‡¿03…#I‡?'åí/Ž±?'åí/Ž±?'åí/Ž±¿¢´Ã{·¿¢´Ã{·¿¢´Ã{·¿+ZƒðY¿+ZƒðY¿+ZƒðY?#óeæ¡*3?#óeæ¡*3?#óeæ¡*3¿- æ £¿- æ £¿- æ £?.KÈX?Ù…?.KÈX?Ù…?.KÈX?Ù…¿&ÊÚ^ `¿&ÊÚ^ `¿&ÊÚ^ `?ýY:<“?ýY:<“?ýY:<“?ÃiÓòÝŽ?ÃiÓòÝŽ?ÃiÓòÝŽ¿&l4ÆÝ¿&l4ÆÝ¿&l4ÆÝ?,ÅV݆eÖ?,ÅV݆eÖ?,ÅV݆eÖ¿(ôaó䯿(ôaó䯿(ôaóä¯?!‡ŽàÆ?!‡ŽàÆ?!‡ŽàÆ?,)¤µ;?,)¤µ;?,)¤µ;¿$š›œ!¿$š›œ!¿$š›œ!?+t)0Gpt?+t)0Gpt?+t)0Gpt¿'×…5=ß¿'×…5=ß¿'×…5=ß? ¢æNE? ¢æNE? ¢æNE?©…«¤›è?©…«¤›è?©…«¤›è¿&½%=3Oç¿&½%=3Oç¿&½%=3Oç?*V{‘¥?*V{‘¥?*V{‘¥¿!ϲȿ!ϲȿ!ϲÈ>ߢ'Ã>ߢ'Ã>ߢ'Ã? C-¾˜á? C-¾˜á? C-¾˜á¿)‰)ÀHc¿)‰)ÀHc¿)‰)ÀHc?&./®>ùÑ?&./®>ùÑ?&./®>ùÑ¿íÅCäÓÉ¿íÅCäÓÉ¿íÅCäÓÉ¿/º:€2¿/º:€2¿/º:€2?'hÀ…Èöº?'hÀ…Èöº?'hÀ…Èöº¿'ý¾â̲¿'ý¾â̲¿'ý¾â̲?ÚÈtï?ÚÈtï?ÚÈtï? ÖoxåC? ÖoxåC? ÖoxåC¿%S4?Á:_¿%S4?Á:_¿%S4?Á:_?(’hòwY?(’hòwY?(’hòwY¿°g*J†¿°g*J†¿°g*J†¾þV»£*71¾þV»£*71¾þV»£*71?#Ê—ŽA£s?#Ê—ŽA£s?#Ê—ŽA£s¿(«‹—=òF¿(«‹—=òF¿(«‹—=òF?6ž¶ ûË?6ž¶ ûË?6ž¶ ûË>òµi©Ô>òµi©Ô>òµi©Ô¿"õ—¶Y¿"õ—¶Y¿"õ—¶Y?(£ŠJÝ”Ü?(£ŠJÝ”Ü?(£ŠJݔܿ·Ã¿ø¯6¿·Ã¿ø¯6¿·Ã¿ø¯6¾õ›×ëƒØ;¾õ›×ëƒØ;¾õ›×ëƒØ;?$¼6€=?$¼6€=?$¼6€=¿,"6ºy“B¿,"6ºy“B¿,"6ºy“Bhealpy-1.8.1/healpy/pixelfunc.py0000644000175000017500000013266012351601276017115 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # """ ===================================================== pixelfunc.py : Healpix pixelization related functions ===================================================== This module provides functions related to Healpix pixelization scheme. conversion from/to sky coordinates ---------------------------------- - :func:`pix2ang` converts pixel number to angular coordinates - :func:`pix2vec` converts pixel number to unit 3-vector direction - :func:`ang2pix` converts angular coordinates to pixel number - :func:`vec2pix` converts 3-vector to pixel number - :func:`vec2ang` converts 3-vector to angular coordinates - :func:`ang2vec` converts angular coordinates to unit 3-vector - :func:`get_neighbours` returns the 4 nearest pixels for given angular coordinates - :func:`get_all_neighbours` return the 8 nearest pixels for given angular coordinates conversion between NESTED and RING schemes ------------------------------------------ - :func:`nest2ring` converts NESTED scheme pixel numbers to RING scheme pixel number - :func:`ring2nest` converts RING scheme pixel number to NESTED scheme pixel number - :func:`reorder` reorders a healpix map pixels from one scheme to another nside/npix/resolution --------------------- - :func:`nside2npix` converts healpix nside parameter to number of pixel - :func:`npix2nside` converts number of pixel to healpix nside parameter - :func:`nside2resol` converts nside to mean angular resolution - :func:`nside2pixarea` converts nside to pixel area - :func:`isnsideok` checks the validity of nside - :func:`isnpixok` checks the validity of npix - :func:`get_map_size` gives the number of pixel of a map - :func:`get_min_valid_nside` gives the minimum nside possible for a given number of pixel - :func:`get_nside` returns the nside of a map - :func:`maptype` checks the type of a map (one map or sequence of maps) - :func:`ud_grade` upgrades or degrades the resolution (nside) of a map Masking pixels -------------- - :const:`UNSEEN` is a constant value interpreted as a masked pixel - :func:`mask_bad` returns a map with ``True`` where map is :const:`UNSEEN` - :func:`mask_good` returns a map with ``False`` where map is :const:`UNSEEN` - :func:`ma` returns a masked array as map, with mask given by :func:`mask_bad` Map data manipulation --------------------- - :func:`fit_dipole` fits a monopole+dipole on the map - :func:`fit_monopole` fits a monopole on the map - :func:`remove_dipole` fits and removes a monopole+dipole from the map - :func:`remove_monopole` fits and remove a monopole from the map - :func:`get_interp_val` computes a bilinear interpolation of the map at given angular coordinates, using 4 nearest neighbours """ import numpy as np from . import _healpy_pixel_lib as pixlib from functools import wraps #: Special value used for masked pixels UNSEEN = pixlib.UNSEEN # We are using 64-bit integer types. # nside > 2**29 requires extended integer types. max_nside = 1 << 29 __all__ = ['pix2ang', 'pix2vec', 'ang2pix', 'vec2pix', 'ang2vec', 'vec2ang', 'get_neighbours', 'get_interp_val', 'get_all_neighbours', 'max_pixrad', 'nest2ring', 'ring2nest', 'reorder', 'ud_grade', 'UNSEEN', 'mask_good', 'mask_bad', 'ma', 'fit_dipole', 'remove_dipole', 'fit_monopole', 'remove_monopole', 'nside2npix', 'npix2nside', 'nside2resol', 'nside2pixarea', 'isnsideok', 'isnpixok', 'get_map_size', 'get_min_valid_nside', 'get_nside', 'maptype', 'ma_to_array'] def check_theta_valid(theta): """Raises exception if theta is not within 0 and pi""" assert (np.asarray(theta) >= 0).all() & (np.asarray(theta) <= np.pi + 1e-5).all(), "Theta is defined between 0 and pi" def maptype(m): """Describe the type of the map (valid, single, sequence of maps). Checks : the number of maps, that all maps have same length and that this length is a valid map size (using :func:`isnpixok`). Parameters ---------- m : sequence the map to get info from Returns ------- info : int -1 if the given object is not a valid map, 0 if it is a single map, *info* > 0 if it is a sequence of maps (*info* is then the number of maps) Examples -------- >>> import healpy as hp >>> hp.pixelfunc.maptype(np.arange(12)) 0 >>> hp.pixelfunc.maptype([np.arange(12), np.arange(12)]) 2 """ if not hasattr(m, '__len__'): raise TypeError('input map is a scalar') if len(m) == 0: raise TypeError('input map has length zero') if hasattr(m[0], '__len__'): npix=len(m[0]) for mm in m[1:]: if len(mm) != npix: raise TypeError('input maps have different npix') if isnpixok(len(m[0])): return len(m) else: raise TypeError('bad number of pixels') else: if isnpixok(len(m)): return 0 else: raise TypeError('bad number of pixels') def ma_to_array(m): """Converts a masked array or a list of masked arrays to filled numpy arrays Parameters ---------- m : a map (may be a sequence of maps) Returns ------- m : filled map or tuple of filled maps Examples -------- >>> import healpy as hp >>> m = hp.ma(np.array([2., 2., 3, 4, 5, 0, 0, 0, 0, 0, 0, 0])) >>> m.mask = np.array([0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], dtype=np.bool) >>> print(m.data[1]) # data is not affected by mask 2.0 >>> print(m[1]) # shows that the value is masked -- >>> print(ma_to_array(m)[1]) # filled array, masked values replace by UNSEEN -1.6375e+30 """ try: return m.filled() except AttributeError: try: return tuple([mm.filled() for mm in m]) except AttributeError: pass return m def is_ma(m): """Converts a masked array or a list of masked arrays to filled numpy arrays Parameters ---------- m : a map (may be a sequence of maps) Returns ------- is_ma : bool whether the input map was a ma or not """ return hasattr(m, 'filled') or hasattr(m[0], 'filled') def accept_ma(f): """Wraps a function in order to convert the input map from a masked to a regular numpy array, and convert back the output from a regular array to a masked array""" @wraps(f) def wrapper(*args, **kwds): return_ma = is_ma(args[0]) m = ma_to_array(args[0]) out = f(m, *args[1:], **kwds) return ma(out) if return_ma else out return wrapper def mask_bad(m, badval = UNSEEN, rtol = 1.e-5, atol = 1.e-8): """Returns a bool array with ``True`` where m is close to badval. Parameters ---------- m : a map (may be a sequence of maps) badval : float, optional The value of the pixel considered as bad (:const:`UNSEEN` by default) rtol : float, optional The relative tolerance atol : float, optional The absolute tolerance Returns ------- mask a bool array with the same shape as the input map, ``True`` where input map is close to badval, and ``False`` elsewhere. See Also -------- mask_good, ma Examples -------- >>> import healpy as hp >>> import numpy as np >>> m = np.arange(12.) >>> m[3] = hp.UNSEEN >>> hp.mask_bad(m) array([False, False, False, True, False, False, False, False, False, False, False, False], dtype=bool) """ m = np.asarray(m) atol = np.absolute(atol) rtol = np.absolute(rtol) return np.absolute(m - badval) <= atol + rtol * np.absolute(badval) def mask_good(m, badval = UNSEEN, rtol = 1.e-5, atol = 1.e-8): """Returns a bool array with ``False`` where m is close to badval. Parameters ---------- m : a map (may be a sequence of maps) badval : float, optional The value of the pixel considered as bad (:const:`UNSEEN` by default) rtol : float, optional The relative tolerance atol : float, optional The absolute tolerance Returns ------- a bool array with the same shape as the input map, ``False`` where input map is close to badval, and ``True`` elsewhere. See Also -------- mask_bad, ma Examples -------- >>> import healpy as hp >>> m = np.arange(12.) >>> m[3] = hp.UNSEEN >>> hp.mask_good(m) array([ True, True, True, False, True, True, True, True, True, True, True, True], dtype=bool) """ m = np.asarray(m) atol = np.absolute(atol) rtol = np.absolute(rtol) return np.absolute(m - badval) > atol + rtol * np.absolute(badval) def ma(m, badval = UNSEEN, rtol = 1e-5, atol = 1e-8, copy = True): """Return map as a masked array, with ``badval`` pixels masked. Parameters ---------- m : a map (may be a sequence of maps) badval : float, optional The value of the pixel considered as bad (:const:`UNSEEN` by default) rtol : float, optional The relative tolerance atol : float, optional The absolute tolerance copy : bool, optional If ``True``, a copy of the input map is made. Returns ------- a masked array with the same shape as the input map, masked where input map is close to badval. See Also -------- mask_good, mask_bad, numpy.ma.masked_values Examples -------- >>> import healpy as hp >>> m = np.arange(12.) >>> m[3] = hp.UNSEEN >>> hp.ma(m) masked_array(data = [0.0 1.0 2.0 -- 4.0 5.0 6.0 7.0 8.0 9.0 10.0 11.0], mask = [False False False True False False False False False False False False], fill_value = -1.6375e+30) """ if maptype(m) == 0: return np.ma.masked_values(m, badval, rtol = rtol, atol = atol, copy = copy) else: return tuple([ma(mm) for mm in m]) def ang2pix(nside,theta,phi,nest=False): """ang2pix : nside,theta[rad],phi[rad],nest=False -> ipix (default:RING) Parameters ---------- nside : int, scalar or array-like The healpix nside parameter, must be a power of 2, less than 2**30 theta, phi : float, scalars or array-like Angular coordinates of a point on the sphere nest : bool, optional if True, assume NESTED pixel ordering, otherwise, RING pixel ordering Returns ------- pix : int or array of int The healpix pixel numbers. Scalar if all input are scalar, array otherwise. Usual numpy broadcasting rules apply. See Also -------- pix2ang, pix2vec, vec2pix Examples -------- >>> import healpy as hp >>> hp.ang2pix(16, np.pi/2, 0) 1440 >>> hp.ang2pix(16, [np.pi/2, np.pi/4, np.pi/2, 0, np.pi], [0., np.pi/4, np.pi/2, 0, 0]) array([1440, 427, 1520, 0, 3068]) >>> hp.ang2pix(16, np.pi/2, [0, np.pi/2]) array([1440, 1520]) >>> hp.ang2pix([1, 2, 4, 8, 16], np.pi/2, 0) array([ 4, 12, 72, 336, 1440]) """ check_theta_valid(theta) check_nside(nside) if nest: return pixlib._ang2pix_nest(nside,theta,phi) else: return pixlib._ang2pix_ring(nside,theta,phi) def pix2ang(nside,ipix,nest=False): """pix2ang : nside,ipix,nest=False -> theta[rad],phi[rad] (default RING) Parameters ---------- nside : int or array-like The healpix nside parameter, must be a power of 2, less than 2**30 ipix : int or array-like Pixel indices nest : bool, optional if True, assume NESTED pixel ordering, otherwise, RING pixel ordering Returns ------- theta, phi : float, scalar or array-like The angular coordinates corresponding to ipix. Scalar if all input are scalar, array otherwise. Usual numpy broadcasting rules apply. See Also -------- ang2pix, vec2pix, pix2vec Examples -------- >>> import healpy as hp >>> hp.pix2ang(16, 1440) (1.5291175943723188, 0.0) >>> hp.pix2ang(16, [1440, 427, 1520, 0, 3068]) (array([ 1.52911759, 0.78550497, 1.57079633, 0.05103658, 3.09055608]), array([ 0. , 0.78539816, 1.61988371, 0.78539816, 0.78539816])) >>> hp.pix2ang([1, 2, 4, 8], 11) (array([ 2.30052398, 0.84106867, 0.41113786, 0.2044802 ]), array([ 5.49778714, 5.89048623, 5.89048623, 5.89048623])) """ check_nside(nside) if nest: return pixlib._pix2ang_nest(nside, ipix) else: return pixlib._pix2ang_ring(nside,ipix) def vec2pix(nside,x,y,z,nest=False): """vec2pix : nside,x,y,z,nest=False -> ipix (default:RING) Parameters ---------- nside : int or array-like The healpix nside parameter, must be a power of 2, less than 2**30 x,y,z : floats or array-like vector coordinates defining point on the sphere nest : bool, optional if True, assume NESTED pixel ordering, otherwise, RING pixel ordering Returns ------- ipix : int, scalar or array-like The healpix pixel number corresponding to input vector. Scalar if all input are scalar, array otherwise. Usual numpy broadcasting rules apply. See Also -------- ang2pix, pix2ang, pix2vec Examples -------- >>> import healpy as hp >>> hp.vec2pix(16, 1, 0, 0) 1504 >>> hp.vec2pix(16, [1, 0], [0, 1], [0, 0]) array([1504, 1520]) >>> hp.vec2pix([1, 2, 4, 8], 1, 0, 0) array([ 4, 20, 88, 368]) """ if nest: return pixlib._vec2pix_nest(nside,x,y,z) else: return pixlib._vec2pix_ring(nside,x,y,z) def pix2vec(nside,ipix,nest=False): """pix2vec : nside,ipix,nest=False -> x,y,z (default RING) Parameters ---------- nside : int, scalar or array-like The healpix nside parameter, must be a power of 2, less than 2**30 ipix : int, scalar or array-like Healpix pixel number nest : bool, optional if True, assume NESTED pixel ordering, otherwise, RING pixel ordering Returns ------- x, y, z : floats, scalar or array-like The coordinates of vector corresponding to input pixels. Scalar if all input are scalar, array otherwise. Usual numpy broadcasting rules apply. See Also -------- ang2pix, pix2ang, vec2pix Examples -------- >>> import healpy as hp >>> hp.pix2vec(16, 1504) (0.99879545620517241, 0.049067674327418015, 0.0) >>> hp.pix2vec(16, [1440, 427]) (array([ 0.99913157, 0.5000534 ]), array([ 0. , 0.5000534]), array([ 0.04166667, 0.70703125])) >>> hp.pix2vec([1, 2], 11) (array([ 0.52704628, 0.68861915]), array([-0.52704628, -0.28523539]), array([-0.66666667, 0.66666667])) """ check_nside(nside) if nest: return pixlib._pix2vec_nest(nside,ipix) else: return pixlib._pix2vec_ring(nside,ipix) def ang2vec(theta, phi): """ang2vec : convert angles to 3D position vector Parameters ---------- theta : float, scalar or arry-like colatitude in radians measured southward from north pole (in [0,pi]). phi : float, scalar or array-like longitude in radians measured eastward (in [0, 2*pi]). Returns ------- vec : float, array if theta and phi are vectors, the result is a 2D array with a vector per row otherwise, it is a 1D array of shape (3,) See Also -------- vec2ang, rotator.dir2vec, rotator.vec2dir """ check_theta_valid(theta) if np.any(theta < 0) or np.any(theta > np.pi): raise ValueError('THETA is out of range [0,pi]') sintheta = np.sin(theta) return np.array([sintheta*np.cos(phi), sintheta*np.sin(phi), np.cos(theta)]).T def vec2ang(vectors): """vec2ang: vectors [x, y, z] -> theta[rad], phi[rad] Parameters ---------- vectors : float, array-like the vector(s) to convert, shape is (3,) or (N, 3) Returns ------- theta, phi : float, tuple of two arrays the colatitude and longitude in radians See Also -------- ang2vec, rotator.vec2dir, rotator.dir2vec """ vectors = vectors.reshape(-1,3) dnorm = np.sqrt(np.sum(np.square(vectors),axis=1)) theta = np.arccos(vectors[:,2]/dnorm) phi = np.arctan2(vectors[:,1],vectors[:,0]) phi[phi < 0] += 2*np.pi return theta, phi def ring2nest(nside, ipix): """Convert pixel number from RING ordering to NESTED ordering. Parameters ---------- nside : int, scalar or array-like the healpix nside parameter ipix : int, scalar or array-like the pixel number in RING scheme Returns ------- ipix : int, scalar or array-like the pixel number in NESTED scheme See Also -------- nest2ring, reorder Examples -------- >>> import healpy as hp >>> hp.ring2nest(16, 1504) 1130 >>> hp.ring2nest(2, np.arange(10)) array([ 3, 7, 11, 15, 2, 1, 6, 5, 10, 9]) >>> hp.ring2nest([1, 2, 4, 8], 11) array([ 11, 13, 61, 253]) """ check_nside(nside) return pixlib._ring2nest(nside, ipix) def nest2ring(nside, ipix): """Convert pixel number from NESTED ordering to RING ordering. Parameters ---------- nside : int, scalar or array-like the healpix nside parameter ipix : int, scalar or array-like the pixel number in NESTED scheme Returns ------- ipix : int, scalar or array-like the pixel number in RING scheme See Also -------- ring2nest, reorder Examples -------- >>> import healpy as hp >>> hp.nest2ring(16, 1130) 1504 >>> hp.nest2ring(2, np.arange(10)) array([13, 5, 4, 0, 15, 7, 6, 1, 17, 9]) >>> hp.nest2ring([1, 2, 4, 8], 11) array([ 11, 2, 12, 211]) """ check_nside(nside) return pixlib._nest2ring(nside, ipix) @accept_ma def reorder(map_in, inp=None, out=None, r2n=None, n2r=None): """Reorder an healpix map from RING/NESTED ordering to NESTED/RING Parameters ---------- map_in : array-like the input map to reorder, accepts masked arrays inp, out : ``'RING'`` or ``'NESTED'`` define the input and output ordering r2n : bool if True, reorder from RING to NESTED n2r : bool if True, reorder from NESTED to RING Returns ------- map_out : array-like the reordered map, as masked array if the input was a masked array Notes ----- if ``r2n`` or ``n2r`` is defined, override ``inp`` and ``out``. See Also -------- nest2ring, ring2nest Examples -------- >>> import healpy as hp >>> hp.reorder(np.arange(48), r2n = True) array([13, 5, 4, 0, 15, 7, 6, 1, 17, 9, 8, 2, 19, 11, 10, 3, 28, 20, 27, 12, 30, 22, 21, 14, 32, 24, 23, 16, 34, 26, 25, 18, 44, 37, 36, 29, 45, 39, 38, 31, 46, 41, 40, 33, 47, 43, 42, 35]) >>> hp.reorder(np.arange(12), n2r = True) array([ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]) >>> hp.reorder(hp.ma(np.arange(12)), n2r = True) masked_array(data = [ 0 1 2 3 4 5 6 7 8 9 10 11], mask = False, fill_value = 999999) >>> m = [np.arange(12.), np.arange(12.), np.arange(12.)] >>> m[0][2] = hp.UNSEEN >>> m[1][2] = hp.UNSEEN >>> m[2][2] = hp.UNSEEN >>> m = hp.ma(m) >>> hp.reorder(m, n2r = True) (masked_array(data = [0.0 1.0 -- 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0 11.0], mask = [False False True False False False False False False False False False], fill_value = -1.6375e+30) , masked_array(data = [0.0 1.0 -- 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0 11.0], mask = [False False True False False False False False False False False False], fill_value = -1.6375e+30) , masked_array(data = [0.0 1.0 -- 3.0 4.0 5.0 6.0 7.0 8.0 9.0 10.0 11.0], mask = [False False True False False False False False False False False False], fill_value = -1.6375e+30) ) """ typ = maptype(map_in) if typ == 0: npix = len(map_in) else: npix = len(map_in[0]) nside = npix2nside(npix) if nside>128: bunchsize = npix/24 else: bunchsize = npix if r2n: inp='RING' out='NEST' if n2r: inp='NEST' out='RING' inp = str(inp).upper()[0:4] out = str(out).upper()[0:4] if inp not in ['RING','NEST'] or out not in ['RING','NEST']: raise ValueError('inp and out must be either RING or NEST') if typ == 0: mapin = [map_in] else: mapin = map_in mapout = [] for m_in in mapin: if inp == out: mapout.append(m_in) elif inp == 'RING': m_out = np.zeros(npix,dtype=type(m_in[0])) for ibunch in range(npix//bunchsize): ipix_n = np.arange(ibunch*bunchsize, (ibunch+1)*bunchsize) ipix_r = nest2ring(nside, ipix_n) m_out[ipix_n] = np.asarray(m_in)[ipix_r] mapout.append(m_out) elif inp == 'NEST': m_out = np.zeros(npix,dtype=type(m_in[0])) for ibunch in range(npix//bunchsize): ipix_r = np.arange(ibunch*bunchsize, (ibunch+1)*bunchsize) ipix_n = ring2nest(nside, ipix_r) m_out[ipix_r] = np.asarray(m_in)[ipix_n] mapout.append(m_out) if typ == 0: return mapout[0] else: return mapout def nside2npix(nside): """Give the number of pixel for the given nside. Parameters ---------- nside : int healpix nside parameter; an exception is raised if nside is not valid (nside must be a power of 2, less than 2**30) Returns ------- npix : int corresponding number of pixels Notes ----- Raise a ValueError exception if nside is not valid. Examples -------- >>> import healpy as hp >>> import numpy as np >>> hp.nside2npix(8) 768 >>> np.all([hp.nside2npix(nside) == 12 * nside**2 for nside in [2**n for n in range(12)]]) True >>> hp.nside2npix(7) Traceback (most recent call last): ... ValueError: 7 is not a valid nside parameter (must be a power of 2, less than 2**30) """ check_nside(nside) return 12*nside**2 def nside2resol(nside, arcmin=False): """Give approximate resolution for nside. Resolution is just the square root of the pixel area, which is a gross approximation given the different pixel shapes Parameters ---------- nside : int healpix nside parameter, must be a power of 2, less than 2**30 arcmin : bool if True, return resolution in arcmin, otherwise in radian Returns ------- resol : float approximate pixel size in radians or arcmin Notes ----- Raise a ValueError exception if nside is not valid. Examples -------- >>> import healpy as hp >>> hp.nside2resol(128, arcmin = True) 27.483891294539248 >>> hp.nside2resol(256) 0.0039973699529159707 >>> hp.nside2resol(7) Traceback (most recent call last): ... ValueError: 7 is not a valid nside parameter (must be a power of 2, less than 2**30) """ check_nside(nside) resol = np.sqrt(nside2pixarea(nside)) if arcmin: resol = np.rad2deg(resol) * 60 return resol def nside2pixarea(nside, degrees=False): """Give pixel area given nside. Parameters ---------- nside : int healpix nside parameter, must be a power of 2, less than 2**30 degrees : bool if True, returns pixel area in square degrees, in square radians otherwise Returns ------- pixarea : float pixel area in square radian or square degree Notes ----- Raise a ValueError exception if nside is not valid. Examples -------- >>> import healpy as hp >>> hp.nside2pixarea(128, degrees = True) 0.2098234113027917 >>> hp.nside2pixarea(256) 1.5978966540475428e-05 >>> hp.nside2pixarea(7) Traceback (most recent call last): ... ValueError: 7 is not a valid nside parameter (must be a power of 2, less than 2**30) """ check_nside(nside) pixarea = 4*np.pi/nside2npix(nside) if degrees: pixarea = np.rad2deg(np.rad2deg(pixarea)) return pixarea def npix2nside(npix): """Give the nside parameter for the given number of pixels. Parameters ---------- npix : int the number of pixels Returns ------- nside : int the nside parameter corresponding to npix Notes ----- Raise a ValueError exception if number of pixel does not correspond to the number of pixel of an healpix map. Examples -------- >>> import healpy as hp >>> hp.npix2nside(768) 8 >>> np.all([hp.npix2nside(12 * nside**2) == nside for nside in [2**n for n in range(12)]]) True >>> hp.npix2nside(1000) Traceback (most recent call last): ... ValueError: Wrong pixel number (it is not 12*nside**2) """ nside = np.sqrt(npix/12.) if nside != np.floor(nside): raise ValueError("Wrong pixel number (it is not 12*nside**2)") nside=int(np.floor(nside)) check_nside(nside) return nside def isnsideok(nside): """Returns :const:`True` if nside is a valid nside parameter, :const:`False` otherwise. Parameters ---------- nside : int, scalar or array-like integer value to be tested Returns ------- ok : bool, scalar or array-like :const:`True` if given value is a valid nside, :const:`False` otherwise. Examples -------- >>> import healpy as hp >>> hp.isnsideok(13) False >>> hp.isnsideok(32) True >>> hp.isnsideok([1, 2, 3, 4, 8, 16]) array([ True, True, False, True, True, True], dtype=bool) """ # we use standard bithacks from http://graphics.stanford.edu/~seander/bithacks.html#DetermineIfPowerOf2 if hasattr(nside, '__len__'): if not isinstance(nside, np.ndarray): nside = np.asarray(nside) return ((nside == nside.astype(np.int)) & (0 < nside) & (nside <= max_nside) & ((nside.astype(np.int) & (nside.astype(np.int) - 1)) == 0)) else: return (nside == int(nside) and 0 < nside <= max_nside and (int(nside) & (int(nside) - 1)) == 0) def check_nside(nside): """Raises exception is nside is not valid""" if not np.all(isnsideok(nside)): raise ValueError("%s is not a valid nside parameter (must be a power of 2, less than 2**30)" % str(nside)) def isnpixok(npix): """Return :const:`True` if npix is a valid value for healpix map size, :const:`False` otherwise. Parameters ---------- npix : int, scalar or array-like integer value to be tested Returns ------- ok : bool, scalar or array-like :const:`True` if given value is a valid number of pixel, :const:`False` otherwise Examples -------- >>> import healpy as hp >>> hp.isnpixok(12) True >>> hp.isnpixok(768) True >>> hp.isnpixok([12, 768, 1002]) array([ True, True, False], dtype=bool) """ if hasattr(npix,'__len__'): nside = np.sqrt(np.asarray(npix)/12.) return isnsideok(nside) else: nside = np.sqrt(npix/12.) return isnsideok(nside) def get_interp_val(m,theta,phi,nest=False): """Return the bi-linear interpolation value of a map using 4 nearest neighbours. Parameters ---------- m : array-like an healpix map, accepts masked arrays theta, phi : float, scalar or array-like angular coordinates of point at which to interpolate the map nest : bool if True, the is assumed to be in NESTED ordering. Returns ------- val : float, scalar or arry-like the interpolated value(s), usual numpy broadcasting rules apply. See Also -------- get_neighbours, get_all_neighbours Examples -------- >>> import healpy as hp >>> hp.get_interp_val(np.arange(12.), np.pi/2, 0) 4.0 >>> hp.get_interp_val(np.arange(12.), np.pi/2, np.pi/2) 5.0 >>> hp.get_interp_val(np.arange(12.), np.pi/2, np.pi/2 + 2*np.pi) 5.0 >>> hp.get_interp_val(np.arange(12.), np.linspace(0, np.pi, 10), 0) array([ 1.5 , 1.5 , 1.5 , 2.20618428, 3.40206143, 5.31546486, 7.94639458, 9.5 , 9.5 , 9.5 ]) """ m2=m.ravel() nside=npix2nside(m2.size) if nest: r=pixlib._get_interpol_nest(nside,theta,phi) else: r=pixlib._get_interpol_ring(nside,theta,phi) p=np.array(r[0:4]) w=np.array(r[4:8]) del r return np.sum(m2[p]*w,0) def get_neighbours(nside,theta,phi=None,nest=False): """Return the 4 nearest pixels and corresponding weights. Parameters ---------- nside : int the healpix nside theta, phi : float, scalar or array-like if phi is not given, theta is interpreted as pixel number, otherwise theta[rad],phi[rad] are angular coordinates nest : bool if ``True``, NESTED ordering, otherwise RING ordering. Returns ------- res : tuple of length 2 contains pixel numbers in res[0] and weights in res[1]. Usual numpy broadcasting rules apply. See Also -------- get_interp_val, get_all_neighbours Examples -------- >>> import healpy as hp >>> hp.get_neighbours(1, 0) (array([0, 1, 4, 5]), array([ 1., 0., 0., 0.])) >>> hp.get_neighbours(1, 0, 0) (array([1, 2, 3, 0]), array([ 0.25, 0.25, 0.25, 0.25])) >>> hp.get_neighbours(1, [0, np.pi/2], 0) (array([[ 1, 4], [ 2, 5], [ 3, 11], [ 0, 8]]), array([[ 0.25, 1. ], [ 0.25, 0. ], [ 0.25, 0. ], [ 0.25, 0. ]])) """ check_nside(nside) if phi == None: theta,phi = pix2ang(nside,theta,nest=nest) if nest: r=pixlib._get_interpol_nest(nside,theta,phi) else: r=pixlib._get_interpol_ring(nside,theta,phi) p=np.array(r[0:4]) w=np.array(r[4:8]) return (p,w) def get_all_neighbours(nside, theta, phi=None, nest=False): """Return the 8 nearest pixels. Parameters ---------- nside : int the nside to work with theta, phi : scalar or array-like if phi is not given or None, theta is interpreted as pixel number, otherwise, theta[rad],phi[rad] are angular coordinates nest : bool if ``True``, pixel number will be NESTED ordering, otherwise RING ordering. Returns ------- ipix : int, array pixel number of the SW, W, NW, N, NE, E, SE and S neighbours, shape is (8,) if input is scalar, otherwise shape is (8, N) if input is of length N. If a neighbor does not exist (it can be the case for W, N, E and S) the corresponding pixel number will be -1. See Also -------- get_neighbours, get_interp_val Examples -------- >>> import healpy as hp >>> hp.get_all_neighbours(1, 4) array([11, 7, 3, -1, 0, 5, 8, -1]) >>> hp.get_all_neighbours(1, np.pi/2, np.pi/2) array([ 8, 4, 0, -1, 1, 6, 9, -1]) """ check_nside(nside) if phi is not None: theta = ang2pix(nside,theta, phi,nest=nest) if nest: r=pixlib._get_neighbors_nest(nside,theta) else: r=pixlib._get_neighbors_ring(nside,theta) res=np.array(r[0:8]) return res def max_pixrad(nside): """Maximum angular distance between any pixel center and its corners Parameters ---------- nside : int the nside to work with Returns ------- rads: double angular distance (in radians) Examples -------- >>> '%.15f' % max_pixrad(1) '0.841068670567930' >>> '%.15f' % max_pixrad(16) '0.066014761432513' """ check_nside(nside) return pixlib._max_pixrad(nside) def fit_dipole(m, nest=False, bad=UNSEEN, gal_cut=0): """Fit a dipole and a monopole to the map, excluding bad pixels. Parameters ---------- m : float, array-like the map to which a dipole is fitted and subtracted, accepts masked maps nest : bool if ``False`` m is assumed in RING scheme, otherwise map is NESTED bad : float bad values of pixel, default to :const:`UNSEEN`. gal_cut : float pixels at latitude in [-gal_cut;+gal_cut] degrees are not taken into account Returns ------- res : tuple of length 2 the monopole value in res[0] and the dipole vector (as array) in res[1] See Also -------- remove_dipole, fit_monopole, remove_monopole """ m=ma_to_array(m) m=np.asarray(m) npix = m.size nside = npix2nside(npix) if nside>128: bunchsize = npix/24 else: bunchsize = npix aa = np.zeros((4,4),dtype=np.float64) v = np.zeros(4,dtype=np.float64) for ibunch in range(npix//bunchsize): ipix = np.arange(ibunch*bunchsize, (ibunch+1)*bunchsize) ipix = ipix[(m.flat[ipix]!=bad) & (np.isfinite(m.flat[ipix]))] x,y,z = pix2vec(nside, ipix, nest) if gal_cut>0: w = (np.abs(z)>=np.sin(gal_cut*np.pi/180)) ipix=ipix[w] x=x[w] y=y[w] z=z[w] del w aa[0,0] += ipix.size aa[1,0] += x.sum() aa[2,0] += y.sum() aa[3,0] += z.sum() aa[1,1] += (x**2).sum() aa[2,1] += (x*y).sum() aa[3,1] += (x*z).sum() aa[2,2] += (y**2).sum() aa[3,2] += (y*z).sum() aa[3,3] += (z**2).sum() v[0] += m.flat[ipix].sum() v[1] += (m.flat[ipix]*x).sum() v[2] += (m.flat[ipix]*y).sum() v[3] += (m.flat[ipix]*z).sum() aa[0,1] = aa[1,0] aa[0,2] = aa[2,0] aa[0,3] = aa[3,0] aa[1,2] = aa[2,1] aa[1,3] = aa[3,1] aa[2,3] = aa[3,2] res = np.dot(np.linalg.inv(aa),v) mono = res[0] dipole = res[1:4] return mono,dipole def remove_dipole(m,nest=False,bad=UNSEEN,gal_cut=0,fitval=False, copy=True,verbose=True): """Fit and subtract the dipole and the monopole from the given map m. Parameters ---------- m : float, array-like the map to which a dipole is fitted and subtracted, accepts masked arrays nest : bool if ``False`` m is assumed in RING scheme, otherwise map is NESTED bad : float bad values of pixel, default to :const:`UNSEEN`. gal_cut : float pixels at latitude in [-gal_cut;+gal_cut] are not taken into account fitval : bool whether to return or not the fitted values of monopole and dipole copy : bool whether to modify input map or not (by default, make a copy) verbose : bool print values of monopole and dipole Returns ------- res : array or tuple of length 3 if fitval is False, returns map with monopole and dipole subtracted, otherwise, returns map (array, in res[0]), monopole (float, in res[1]), dipole_vector (array, in res[2]) See Also -------- fit_dipole, fit_monopole, remove_monopole """ input_ma = is_ma(m) m=ma_to_array(m) m=np.array(m,copy=copy) npix = m.size nside = npix2nside(npix) if nside>128: bunchsize = npix/24 else: bunchsize = npix mono,dipole = fit_dipole(m,nest=nest,bad=bad,gal_cut=gal_cut) for ibunch in range(npix//bunchsize): ipix = np.arange(ibunch*bunchsize, (ibunch+1)*bunchsize) ipix = ipix[(m.flat[ipix]!=bad) & (np.isfinite(m.flat[ipix]))] x,y,z = pix2vec(nside, ipix, nest) m.flat[ipix] -= (dipole[0]*x) m.flat[ipix] -= dipole[1]*y m.flat[ipix] -= dipole[2]*z m.flat[ipix] -= mono if verbose: import rotator as R lon,lat = R.vec2dir(dipole,lonlat=True) amp = np.sqrt((dipole**2).sum()) print( 'monopole: {0:g} dipole: lon: {1:g}, lat: {2:g}, amp: {3:g}' .format(mono, lon, lat, amp)) if is_ma: m = ma(m) if fitval: return m,mono,dipole else: return m def fit_monopole(m,nest=False,bad=pixlib.UNSEEN,gal_cut=0): """Fit a monopole to the map, excluding unseen pixels. Parameters ---------- m : float, array-like the map to which a dipole is fitted and subtracted, accepts masked arrays nest : bool if ``False`` m is assumed in RING scheme, otherwise map is NESTED bad : float bad values of pixel, default to :const:`UNSEEN`. gal_cut : float pixels at latitude in [-gal_cut;+gal_cut] degrees are not taken into account Returns ------- res: float fitted monopole value See Also -------- fit_dipole, remove_monopole, remove_monopole """ m=ma_to_array(m) m=np.asarray(m) npix=m.size nside = npix2nside(npix) if nside>128: bunchsize=npix/24 else: bunchsize=npix aa = v = 0.0 for ibunch in range(npix//bunchsize): ipix = np.arange(ibunch*bunchsize, (ibunch+1)*bunchsize) ipix = ipix[(m.flat[ipix]!=bad) & (np.isfinite(m.flat[ipix]))] x,y,z = pix2vec(nside, ipix, nest) if gal_cut>0: w = (np.abs(z)>=np.sin(gal_cut*np.pi/180)) ipix=ipix[w] x=x[w] y=y[w] z=z[w] del w aa += ipix.size v += m.flat[ipix].sum() mono = v/aa return mono def remove_monopole(m,nest=False,bad=pixlib.UNSEEN,gal_cut=0,fitval=False, copy=True,verbose=True): """Fit and subtract the monopole from the given map m. Parameters ---------- m : float, array-like the map to which a monopole is fitted and subtracted nest : bool if ``False`` m is assumed in RING scheme, otherwise map is NESTED bad : float bad values of pixel, default to :const:`UNSEEN`. gal_cut : float pixels at latitude in [-gal_cut;+gal_cut] are not taken into account fitval : bool whether to return or not the fitted value of monopole copy : bool whether to modify input map or not (by default, make a copy) verbose: bool whether to print values of monopole Returns ------- res : array or tuple of length 3 if fitval is False, returns map with monopole subtracted, otherwise, returns map (array, in res[0]) and monopole (float, in res[1]) See Also -------- fit_dipole, fit_monopole, remove_dipole """ input_ma = is_ma(m) m= ma_to_array(m) m=np.array(m,copy=copy) npix = m.size nside = npix2nside(npix) if nside>128: bunchsize = npix/24 else: bunchsize = npix mono = fit_monopole(m,nest=nest,bad=bad,gal_cut=gal_cut) for ibunch in range(npix//bunchsize): ipix = np.arange(ibunch*bunchsize, (ibunch+1)*bunchsize) ipix = ipix[(m.flat[ipix]!=bad) & (np.isfinite(m.flat[ipix]))] x,y,z = pix2vec(nside, ipix, nest) m.flat[ipix] -= mono if verbose: print('monopole: {0:g}'.format(mono)) if input_ma: m = ma(m) if fitval: return m,mono else: return m def get_map_size(m): """Returns the npix of a given map (implicit or explicit pixelization). If map is a dict type, assumes explicit pixelization: use nside key if present, or use nside attribute if present, otherwise use the smallest valid npix given the maximum key value. otherwise assumes implicit pixelization and returns len(m). Parameters ---------- m : array-like or dict-like a map with implicit (array-like) or explicit (dict-like) pixellization Returns ------- npix : int a valid number of pixel Notes ----- In implicit pixellization, raise a ValueError exception if the size of the input is not a valid pixel number. Examples -------- >>> import healpy as hp >>> m = {0: 1, 1: 1, 2: 1, 'nside': 1} >>> print(hp.get_map_size(m)) 12 >>> m = {0: 1, 767: 1} >>> print(hp.get_map_size(m)) 768 >>> print(hp.get_map_size(np.zeros(12 * 8 ** 2))) 768 """ if isinstance(m, dict): if 'nside' in m: return nside2npix(m['nside']) elif hasattr(ma, 'nside'): return nside2npix(m.nside) else: nside = get_min_valid_nside(max(m.keys())+1) return nside2npix(nside) else: if isnpixok(len(m)): return len(m) else: raise ValueError("Wrong pixel number (it is not 12*nside**2)") def get_min_valid_nside(npix): """Returns the minimum acceptable nside so that npix <= nside2npix(nside). Parameters ---------- npix : int a minimal number of pixel Returns ------- nside : int a valid healpix nside so that 12 * nside ** 2 >= npix Examples -------- >>> import healpy as hp >>> hp.pixelfunc.get_min_valid_nside(355) 8 >>> hp.pixelfunc.get_min_valid_nside(768) 8 """ order = 0.5 * np.log2(npix / 12.) return 2**int(np.ceil(order)) def get_nside(m): """Return the nside of the given map. Parameters ---------- m : sequence the map to get the nside from. Returns ------- nside : int the healpix nside parameter of the map (or sequence of maps) Notes ----- If the input is a sequence of maps, all of them must have same size. If the input is not a valid map (not a sequence, unvalid number of pixels), a TypeError exception is raised. """ typ = maptype(m) if typ == 0: return npix2nside(len(m)) else: return npix2nside(len(m[0])) @accept_ma def ud_grade(map_in,nside_out,pess=False,order_in='RING',order_out=None, power=None, dtype=None): """Upgrade or degrade resolution of a map (or list of maps). in degrading the resolution, ud_grade sets the value of the superpixel as the mean of the children pixels. Parameters ---------- map_in : array-like or sequence of array-like the input map(s) (if a sequence of maps, all must have same size) nside_out : int the desired nside of the output map(s) pess : bool if ``True``, in degrading, reject pixels which contains a bad sub_pixel. Otherwise, estimate average with good pixels order_in, order_out : str pixel ordering of input and output ('RING' or 'NESTED') power : float if non-zero, divide the result by (nside_in/nside_out)**power Examples: power=-2 keeps the sum of the map invariant (useful for hitmaps), power=2 divides the mean by another factor of (nside_in/nside_out)**2 (useful for variance maps) dtype : type the type of the output map Returns ------- map_out : array-like or sequence of array-like the upgraded or degraded map(s) Examples -------- >>> import healpy as hp >>> hp.ud_grade(np.arange(48.), 1) array([ 5.5 , 7.25, 9. , 10.75, 21.75, 21.75, 23.75, 25.75, 36.5 , 38.25, 40. , 41.75]) """ check_nside(nside_out) typ = maptype(map_in) if typ<0: raise TypeError('Invalid map') if typ == 0: m_in = [map_in] else: m_in = map_in mapout = [] if order_out is None: order_out = order_in for m in m_in: if str(order_in).upper()[0:4] == 'RING': m = reorder(m,r2n=True) mout = _ud_grade_core(m,nside_out,pess=pess, power=power, dtype=dtype) if str(order_out).upper()[0:4] == 'RING': mout = reorder(mout,n2r=True) mapout.append(mout) if typ == 0: return mapout[0] else: return mapout def _ud_grade_core(m,nside_out,pess=False,power=None, dtype=None): """Internal routine used by ud_grade. It assumes that the map is NESTED and single (not a list of maps) """ nside_in = get_nside(m) if dtype: type_out = dtype else: type_out = type(m[0]) check_nside(nside_out) npix_in = nside2npix(nside_in) npix_out = nside2npix(nside_out) if power: power = float(power) ratio = (float(nside_out)/float(nside_in))**power else: ratio = 1 if nside_out > nside_in: rat2 = npix_out/npix_in fact = np.ones(rat2, dtype=type_out)*ratio map_out = np.outer(m,fact).reshape(npix_out) elif nside_out < nside_in: rat2 = npix_in/npix_out bads = (mask_bad(m) | (~np.isfinite(m))) hit = np.ones(npix_in,dtype=np.int16) hit[bads] = 0 m[bads] = 0 mr = m.reshape(npix_out,rat2) hit = hit.reshape(npix_out,rat2) map_out = mr.sum(axis=1).astype(type_out) nhit = hit.sum(axis=1) if pess: badout = np.where(nhit != rat2) else: badout = np.where(nhit == 0) if power: nhit /= ratio map_out[nhit!=0] /= nhit[nhit!=0] try: map_out[badout] = UNSEEN m[bads] = UNSEEN except OverflowError: pass else: map_out = m return map_out.astype(type_out) healpy-1.8.1/healpy/projaxes.py0000644000175000017500000011356012346125412016746 0ustar zoncazonca00000000000000# # This file is part of Healpy. # # Healpy 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 2 of the License, or # (at your option) any later version. # # Healpy 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 Healpy; if not, write to the Free Software # Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA # # For more information about Healpy, see http://code.google.com/p/healpy # from . import projector as P from . import rotator as R from . import pixelfunc import matplotlib from matplotlib import axes,ticker,colors,cm,lines,cbook,figure import numpy as np from ._healpy_pixel_lib import UNSEEN pi = np.pi dtor = pi/180. class SphericalProjAxes(axes.Axes): """Define a special Axes to take care of spherical projection. Parameters ---------- projection : a SphericalProj class or a class derived from it. type of projection rot : list or string define rotation. See rotator. coord : list or string define coordinate system. See rotator. coordprec : number of digit after floating point for coordinates display. format : format string for value display. Notes ----- Other keywords from Axes (see Axes). """ def __init__(self, ProjClass, *args, **kwds): if not issubclass(ProjClass, P.SphericalProj): raise TypeError("First argument must be a SphericalProj class " "(or derived from)") self.proj = ProjClass(rot = kwds.pop('rot',None), coord = kwds.pop('coord',None), flipconv = kwds.pop('flipconv',None), **kwds.pop('arrayinfo', {})) kwds.setdefault('format','%g') kwds.setdefault('coordprec',2) kwds['aspect'] = 'equal' super(SphericalProjAxes,self).__init__(*args, **kwds) self.axis('off') self.set_autoscale_on(False) xmin,xmax,ymin,ymax = self.proj.get_extent() self.set_xlim(xmin,xmax) self.set_ylim(ymin,ymax) dx,dy = self.proj.ang2xy(pi/2.,1.*dtor,direct=True) self._segment_threshold = 16.*np.sqrt(dx**2+dy**2) self._segment_step_rad = 0.1*pi/180 self._do_border = True self._gratdef = {} self._gratdef['local'] = False self._gratdef['dpar'] = 30. def set_format(self,f): """Set the format string for value display """ self._format=f return f def set_coordprec(self,n): """Set the number of digits after floating point for coord display. """ self._coordprec = n def format_coord(self,x,y): """Format the coordinate for display in status bar. Take projection into account. """ format=self._format+' at ' pos=self.get_lonlat(x,y) if pos is None or np.isnan(pos).any(): return '' lon,lat = np.around(pos,decimals=self._coordprec) val = self.get_value(x,y) if val is None: format = '%s' val = '' elif type(val) is str: format='%s @ ' coordsys = self.proj.coordsysstr if coordsys != '': res=(format+'(%g, %g) in %s')%(val,lon,lat, coordsys[0:3]) else: res=(format+'lon=%g, lat=%g')%(val,lon,lat) return res def get_lonlat(self,x,y): """Get the coordinate in the coord system of the image, in lon/lat in deg. """ lon,lat = self.proj.xy2ang(x,y,lonlat=True) return lon,lat def get_value(self,x,y): """Get the value of the map at position x,y """ if len(self.get_images()) < 1: return None im = self.get_images()[-1] arr=im.get_array() i,j = self.proj.xy2ij(x,y) if i is None or j is None: return None elif arr.mask is not np.ma.nomask and arr.mask[i,j]: return 'UNSEEN' else: return arr[i,j] def projmap(self,map,vec2pix_func,vmin=None,vmax=None,badval=UNSEEN, cmap=None,norm=None,rot=None,coord=None,**kwds): """Project a map on the SphericalProjAxes. Parameters ---------- map : array-like The map to project. vec2pix_func : function The function describing the pixelisation. vmin, vmax : float, scalars min and max value to use instead of min max of the map badval : float The value of the bad pixels cmap : a color map The colormap to use (see matplotlib.cm) rot : sequence In the form (lon, lat, psi) (unit: degree):the center of the map is at (lon, lat) and rotated by angle psi around that direction. coord : {'G', 'E', 'C', None} The coordinate system of the map ('G','E' or 'C'), rotate the map if different from the axes coord syst. Notes ----- Other keywords are transmitted to :func:`matplotlib.Axes.imshow` """ img = self.proj.projmap(map,vec2pix_func,rot=rot,coord=coord) w = ~( np.isnan(img) | np.isinf(img) | pixelfunc.mask_bad(img, badval = badval) ) try: if vmin is None: vmin = img[w].min() except ValueError: vmin = 0. try: if vmax is None: vmax = img[w].max() except ValueError: vmax = 0. if vmin > vmax: vmin = vmax if vmin == vmax: vmin -= 1. vmax += 1. cm,nn = get_color_table(vmin,vmax,img[w],cmap=cmap,norm=norm) ext = self.proj.get_extent() img = np.ma.masked_values(img, badval) aximg = self.imshow(img,extent = ext,cmap=cm,norm=nn, interpolation='nearest',origin='lower', vmin=vmin,vmax=vmax,**kwds) xmin,xmax,ymin,ymax = self.proj.get_extent() self.set_xlim(xmin,xmax) self.set_ylim(ymin,ymax) return img def projplot(self,*args,**kwds): """projplot is a wrapper around :func:`matplotlib.Axes.plot` to take into account the spherical projection. You can call this function as:: projplot(theta, phi) # plot a line going through points at coord (theta, phi) projplot(theta, phi, 'bo') # plot 'o' in blue at coord (theta, phi) projplot(thetaphi) # plot a line going through points at coord (thetaphi[0], thetaphi[1]) projplot(thetaphi, 'bx') # idem but with blue 'x' Parameters ---------- theta, phi : float, array-like Coordinates of point to plot. Can be put into one 2-d array, first line is then *theta* and second line is *phi*. See *lonlat* parameter for unit. fmt : str A format string (see :func:`matplotlib.Axes.plot` for details) lonlat : bool, optional If True, theta and phi are interpreted as longitude and latitude in degree, otherwise, as colatitude and longitude in radian coord : {'E', 'G', 'C', None} The coordinate system of the points, only used if the coordinate coordinate system of the Axes has been defined and in this case, a rotation is performed rot : None or sequence rotation to be applied =(lon, lat, psi) : lon, lat will be position of the new Z axis, and psi is rotation around this axis, all in degree. if None, no rotation is performed direct : bool if True, the rotation to center the projection is not taken into account Notes ----- Other keywords are passed to :func:`matplotlib.Axes.plot`. See Also -------- projscatter, projtext """ fmt = None if len(args) < 1: raise ValueError("No argument given") if len(args) == 1: theta,phi = np.asarray(args[0]) elif len(args) == 2: if type(args[1]) is str: fmt=args[1] theta,phi = np.asarray(args[0]) else: theta,phi = np.asarray(args[0]),np.asarray(args[1]) elif len(args) == 3: if type(args[2]) is not str: raise TypeError("Third argument must be a string") else: theta,phi = np.asarray(args[0]),np.asarray(args[1]) fmt = args[2] else: raise TypeError("Three args maximum") rot=kwds.pop('rot',None) if rot is not None: rot = np.array(np.atleast_1d(rot),copy=1) rot.resize(3) rot[1] = rot[1]-90. coord=self.proj.mkcoord(kwds.pop('coord',None))[::-1] lonlat=kwds.pop('lonlat',False) vec = R.dir2vec(theta,phi,lonlat=lonlat) vec = (R.Rotator(rot=rot,coord=coord,eulertype='Y')).I(vec) x,y = self.proj.vec2xy(vec,direct=kwds.pop('direct',False)) x,y = self._make_segment(x,y,threshold=kwds.pop('threshold', self._segment_threshold)) thelines = [] for xx,yy in zip(x,y): if fmt is not None: linestyle, marker, color = axes._process_plot_format(fmt) kwds.setdefault('linestyle',linestyle) kwds.setdefault('marker',marker) if color is not None: kwds.setdefault('color',color) l = lines.Line2D(xx,yy,**kwds) self.add_line(l) thelines.append(l) return thelines def projscatter(self,theta, phi=None,*args,**kwds): """Projscatter is a wrapper around :func:`matplotlib.Axes.scatter` to take into account the spherical projection. You can call this function as:: projscatter(theta, phi) # plot points at coord (theta, phi) projplot(thetaphi) # plot points at coord (thetaphi[0], thetaphi[1]) Parameters ---------- theta, phi : float, array-like Coordinates of point to plot. Can be put into one 2-d array, first line is then *theta* and second line is *phi*. See *lonlat* parameter for unit. lonlat : bool, optional If True, theta and phi are interpreted as longitude and latitude in degree, otherwise, as colatitude and longitude in radian coord : {'E', 'G', 'C', None}, optional The coordinate system of the points, only used if the coordinate coordinate system of the axes has been defined and in this case, a rotation is performed rot : None or sequence, optional rotation to be applied =(lon, lat, psi) : lon, lat will be position of the new Z axis, and psi is rotation around this axis, all in degree. if None, no rotation is performed direct : bool, optional if True, the rotation to center the projection is not taken into account Notes ----- Other keywords are passed to :func:`matplotlib.Axes.plot`. See Also -------- projplot, projtext """ save_input_data = hasattr(self.figure, 'zoomtool') if save_input_data: input_data = (theta, phi, args, kwds.copy()) if phi is None: theta,phi = np.asarray(theta) else: theta, phi = np.asarray(theta), np.asarray(phi) rot=kwds.pop('rot',None) if rot is not None: rot = np.array(np.atleast_1d(rot),copy=1) rot.resize(3) rot[1] = rot[1]-90. coord=self.proj.mkcoord(kwds.pop('coord',None))[::-1] lonlat=kwds.pop('lonlat',False) vec = R.dir2vec(theta,phi,lonlat=lonlat) vec = (R.Rotator(rot=rot,coord=coord,eulertype='Y')).I(vec) x,y = self.proj.vec2xy(vec,direct=kwds.pop('direct',False)) s = self.scatter(x, y, *args, **kwds) if save_input_data: if not hasattr(self, '_scatter_data'): self._scatter_data = [] self._scatter_data.append((s, input_data)) return s def projtext(self, theta, phi, s, **kwds): """Projtext is a wrapper around :func:`matplotlib.Axes.text` to take into account the spherical projection. Parameters ---------- theta, phi : float, array-like Coordinates of point to plot. Can be put into one 2-d array, first line is then *theta* and second line is *phi*. See *lonlat* parameter for unit. text : str The text to be displayed. lonlat : bool, optional If True, theta and phi are interpreted as longitude and latitude in degree, otherwise, as colatitude and longitude in radian coord : {'E', 'G', 'C', None}, optional The coordinate system of the points, only used if the coordinate coordinate system of the axes has been defined and in this case, a rotation is performed rot : None or sequence, optional rotation to be applied =(lon, lat, psi) : lon, lat will be position of the new Z axis, and psi is rotation around this axis, all in degree. if None, no rotation is performed direct : bool, optional if True, the rotation to center the projection is not taken into account Notes ----- Other keywords are passed to :func:`matplotlib.Axes.text`. See Also -------- projplot, projscatter """ if phi is None: theta,phi = np.asarray(theta) else: theta, phi = np.asarray(theta), np.asarray(phi) rot=kwds.pop('rot',None) if rot is not None: rot = np.array(np.atleast_1d(rot),copy=1) rot.resize(3) rot[1] = rot[1]-90. coord=self.proj.mkcoord(kwds.pop('coord',None))[::-1] lonlat=kwds.pop('lonlat',False) vec = R.dir2vec(theta,phi,lonlat=lonlat) vec = (R.Rotator(rot=rot,coord=coord,eulertype='Y')).I(vec) x,y = self.proj.vec2xy(vec,direct=kwds.pop('direct',False)) return self.text(x,y,s,**kwds) def _make_segment(self,x,y,threshold=None): if threshold is None: threshold = self._segment_threshold x,y=np.atleast_1d(x),np.atleast_1d(y) d2 = np.sqrt((np.roll(x,1)-x)**2+(np.roll(y,1)-y)**2) w=np.where(d2 > threshold)[0] #w=w[w!=0] xx=[] yy=[] if len(w) == 1: x=np.roll(x,-w[0]) y=np.roll(y,-w[0]) xx.append(x) yy.append(y) elif len(w) >= 2: xx.append(x[0:w[0]]) yy.append(y[0:w[0]]) for i in xrange(len(w)-1): xx.append(x[w[i]:w[i+1]]) yy.append(y[w[i]:w[i+1]]) xx.append(x[w[-1]:]) yy.append(y[w[-1]:]) else: xx.append(x) yy.append(y) return xx,yy def get_parallel_interval(self,vx,vy=None,vz=None): """Get the min and max value of theta of the parallel to cover the field of view. Input: - the normalized vector of the direction of the center of the projection, in the reference frame of the graticule. Return: - vmin,vmax : between 0 and pi, vmin max_n_par: dpar = set_prec((pmax-pmin)/dtor,max_n_par/2)*dtor if n_mer > max_n_mer: dmer = set_prec((mmax-mmin)/dtor,max_n_mer/2,nn=1)*dtor if dmer/dpar < 0.2 or dmer/dpar > 5.: dmer = dpar = max(dmer,dpar) vdeg = np.floor(np.around(dpar/dtor,10)) varcmin = (dpar/dtor-vdeg)*60. if verbose: print("The interval between parallels is {0:d} deg {1:.2f}'.".format(vdeg,varcmin)) vdeg = np.floor(np.around(dmer/dtor,10)) varcmin = (dmer/dtor-vdeg)*60. if verbose: print("The interval between meridians is {0:d} deg {1:.2f}'.".format(vdeg,varcmin)) return dpar,dmer class GnomonicAxes(SphericalProjAxes): """Define a gnomonic Axes to handle gnomonic projection. Input: - rot=, coord= : define rotation and coordinate system. See rotator. - coordprec= : number of digit after floating point for coordinates display. - format= : format string for value display. Other keywords from Axes (see Axes). """ def __init__(self,*args,**kwds): kwds.setdefault('coordprec',3) super(GnomonicAxes,self).__init__(P.GnomonicProj, *args,**kwds) self._do_border = False self._gratdef['local'] = True self._gratdef['dpar'] = 1. def projmap(self,map,vec2pix_func,xsize=200,ysize=None,reso=1.5,**kwds): self.proj.set_proj_plane_info(xsize=xsize,ysize=ysize,reso=reso) return super(GnomonicAxes,self).projmap(map,vec2pix_func,**kwds) class HpxGnomonicAxes(GnomonicAxes): def projmap(self,map,nest=False,**kwds): nside = pixelfunc.npix2nside(pixelfunc.get_map_size(map)) f = lambda x,y,z: pixelfunc.vec2pix(nside,x,y,z,nest=nest) xsize = kwds.pop('xsize',200) ysize = kwds.pop('ysize',None) reso = kwds.pop('reso',1.5) return super(HpxGnomonicAxes,self).projmap(map,f,xsize=xsize, ysize=ysize,reso=reso,**kwds) class MollweideAxes(SphericalProjAxes): """Define a mollweide Axes to handle mollweide projection. Input: - rot=, coord= : define rotation and coordinate system. See rotator. - coordprec= : number of digit after floating point for coordinates display. - format= : format string for value display. Other keywords from Axes (see Axes). """ def __init__(self,*args,**kwds): kwds.setdefault('coordprec',2) super(MollweideAxes,self).__init__(P.MollweideProj, *args,**kwds) self.set_xlim(-2.01,2.01) self.set_ylim(-1.01,1.01) def projmap(self,map,vec2pix_func,xsize=800,**kwds): self.proj.set_proj_plane_info(xsize=xsize) img = super(MollweideAxes,self).projmap(map,vec2pix_func,**kwds) self.set_xlim(-2.01,2.01) self.set_ylim(-1.01,1.01) return img class HpxMollweideAxes(MollweideAxes): def projmap(self,map,nest=False,**kwds): nside = pixelfunc.npix2nside(pixelfunc.get_map_size(map)) f = lambda x,y,z: pixelfunc.vec2pix(nside,x,y,z,nest=nest) return super(HpxMollweideAxes,self).projmap(map,f,**kwds) class CartesianAxes(SphericalProjAxes): """Define a cylindrical Axes to handle cylindrical projection. """ def __init__(self,*args,**kwds): kwds.setdefault('coordprec',2) super(CartesianAxes,self).__init__(P.CartesianProj, *args, **kwds) self._segment_threshold = 180 self._segment_step_rad = 0.1*pi/180 self._do_border = True def projmap(self,map,vec2pix_func,xsize=800,ysize=None,lonra=None,latra=None,**kwds): self.proj.set_proj_plane_info(xsize=xsize,ysize=ysize,lonra=lonra,latra=latra) return super(CartesianAxes,self).projmap(map,vec2pix_func,**kwds) class HpxCartesianAxes(CartesianAxes): def projmap(self,map,nest=False,**kwds): nside = pixelfunc.npix2nside(pixelfunc.get_map_size(map)) f = lambda x,y,z: pixelfunc.vec2pix(nside,x,y,z,nest=nest) return super(HpxCartesianAxes,self).projmap(map,f,**kwds) class OrthographicAxes(SphericalProjAxes): """Define an orthographic Axes to handle orthographic projection. Input: - rot=, coord= : define rotation and coordinate system. See rotator. - coordprec= : num of digits after floating point for coordinates display. - format= : format string for value display. Other keywords from Axes (see Axes). """ def __init__(self,*args,**kwds): kwds.setdefault('coordprec',2) super(OrthographicAxes,self).__init__(P.OrthographicProj, *args,**kwds) self._segment_threshold = 0.01 self._do_border = False def projmap(self,map,vec2pix_func,xsize=800,half_sky=False,**kwds): self.proj.set_proj_plane_info(xsize=xsize,half_sky=half_sky) img = super(OrthographicAxes,self).projmap(map,vec2pix_func,**kwds) if half_sky: ratio = 1.01 else: ratio = 2.01 self.set_xlim(-ratio,ratio) self.set_ylim(-1.01,1.01) return img class HpxOrthographicAxes(OrthographicAxes): def projmap(self,map,nest=False,**kwds): nside = pixelfunc.npix2nside(len(map)) f = lambda x,y,z: pixelfunc.vec2pix(nside,x,y,z,nest=nest) return super(HpxOrthographicAxes,self).projmap(map,f,**kwds) ################################################################### # # Table color for mollview and gnomview, ... def get_color_table(vmin,vmax,val,cmap=None,norm=None): # Create color table newjet = create_colormap(cmap) if type(norm) is str: if norm.lower().startswith('log'): norm = LogNorm2(clip=False) elif norm.lower().startswith('hist'): norm = HistEqNorm(clip=False) else: norm = None if norm is None: norm = LinNorm2(clip=False) norm.vmin = vmin norm.vmax = vmax norm.autoscale_None(val) return newjet,norm def create_colormap(cmap): if cmap is not None: return cmap cmap0 = cm.jet newcm = colors.LinearSegmentedColormap('newcm',cmap0._segmentdata, cmap0.N) newcm.set_over(newcm(1.0)) newcm.set_under('w') newcm.set_bad('gray') return newcm ################################################################## # # A Locator that gives the bounds of the interval # class BoundaryLocator(ticker.Locator): def __init__(self,N=2): if N < 2: raise ValueError("Number of locs must be greater than 1") self.Nlocs=N def __call__(self): if matplotlib.__version__ < '0.98': vmin,vmax = self.viewInterval.get_bounds() else: vmin, vmax = self.axis.get_view_interval() locs = vmin + np.arange(self.Nlocs)*(vmax-vmin)/(self.Nlocs-1.) return locs def autoscale(self): self.verify_intervals() vmin,vmax = self.dataInterval.get_bounds() if vmax vmax: raise ValueError("minvalue must be less than or equal to maxvalue") elif vmin==vmax: return 0.0 * val else: if clip: mask = np.ma.getmask(val) val = np.ma.array(np.clip(val.filled(vmax), vmin, vmax), mask=mask) result = np.ma.array(np.interp(val, self.xval, self.yval), mask=np.ma.getmask(val)) result[np.isinf(val.data)] = -np.inf if vtype == 'scalar': result = result[0] return result def inverse(self, value): if not self.scaled(): raise ValueError("Not invertible until scaled") if cbook.iterable(value): vtype='array' val = np.ma.array(value) else: vtype='scalar' val = np.ma.array([value]) result = np.ma.array(self._lininterp(val, self.yval, self.xval), mask=np.ma.getmask(val)) result[np.isinf(val.data)] = -np.inf if vtype == 'scalar': result = result[0] return result def autoscale_None(self, val): changed = False if self.vmin is None: self.vmin = val.min() changed = True if self.vmax is None: self.vmax = val.max() changed = True if changed or self.xval is None or self.yval is None: self._set_xyvals(val) def autoscale(self, val): self.vmin = val.min() self.vmax = val.max() self._set_xyvals(val) def _set_xyvals(self,val): data = np.ma.asarray(val).ravel() w=np.isinf(data.data) if data.mask is not np.ma.nomask: w = w|data.mask data2 = data.data[~w] bins = long(min(data2.size/20, 5000)) if bins < 3: bins=data2.size try: # for numpy 1.1, use new bins format (left and right edges) hist, bins = np.histogram(data2,bins=bins, range=(self.vmin,self.vmax), new=True) except TypeError: # for numpy <= 1.0 or numpy >= 1.2, no new keyword hist, bins = np.histogram(data2,bins=bins, range=(self.vmin,self.vmax)) if bins.size == hist.size+1: # new bins format, remove last point bins = bins[:-1] hist = hist.astype(np.float)/np.float(hist.sum()) self.yval = np.concatenate([[0.], hist.cumsum(), [1.]]) self.xval = np.concatenate([[self.vmin], bins + 0.5*(bins[1]-bins[0]), [self.vmax]]) def _lininterp(self,x,X,Y): if hasattr(x,'__len__'): xtype = 'array' xx=np.asarray(x).astype(np.float) else: xtype = 'scalar' xx=np.asarray([x]).astype(np.float) idx = X.searchsorted(xx) yy = xx*0 yy[idx>len(X)-1] = Y[-1] # over yy[idx<=0] = Y[0] # under wok = np.where((idx>0) & (idx vmax: raise ValueError("minvalue must be less than or equal to maxvalue") elif vmin<=0: raise ValueError("values must all be positive") elif vmin==vmax: return type(value)(0.0 * np.asarray(value)) else: if clip: mask = np.ma.getmask(val) val = np.ma.array(np.clip(val.filled(vmax), vmin, vmax), mask=mask) result = (np.ma.log(val)-np.log(vmin))/(np.log(vmax)-np.log(vmin)) result.data[result.data<0]=0.0 result.data[result.data>1]=1.0 result[np.isinf(val.data)] = -np.inf if result.mask is not np.ma.nomask: result.mask[np.isinf(val.data)] = False if vtype == 'scalar': result = result[0] return result def autoscale_None(self, A): ' autoscale only None-valued vmin or vmax' if self.vmin is None or self.vmax is None: val = np.ma.masked_where(np.isinf(A.data),A) colors.Normalize.autoscale_None(self,val) def inverse(self, value): if not self.scaled(): raise ValueError("Not invertible until scaled") vmin, vmax = float(self.vmin), float(self.vmax) if cbook.iterable(value): val = np.ma.asarray(value) return vmin * np.ma.power((vmax/vmin), val) else: return vmin * np.pow((vmax/vmin), value) ################################################################## # # A normalization class to get linear color table # class LinNorm2(colors.Normalize): """ Normalize a given value to the 0-1 range on a lin scale """ def __call__(self, value, clip=None): if clip is None: clip = self.clip if cbook.iterable(value): vtype = 'array' val = np.ma.asarray(value).astype(np.float) else: vtype = 'scalar' val = np.ma.array([value]).astype(np.float) winf = np.isinf(val.data) val = np.ma.masked_where(winf,val) self.autoscale_None(val) vmin, vmax = float(self.vmin), float(self.vmax) if vmin > vmax: raise ValueError("minvalue must be less than or equal to maxvalue") elif vmin==vmax: return type(value)(0.0 * np.asarray(value)) else: if clip: mask = np.ma.getmask(val) val = np.ma.array(np.clip(val.filled(vmax), vmin, vmax), mask=mask) result = (val-vmin) * (1./(vmax-vmin)) result.data[result.data<0]=0.0 result.data[result.data>1]=1.0 result[winf] = -np.inf if result.mask is not np.ma.nomask: result.mask[winf] = False if vtype == 'scalar': result = result[0] return result def autoscale_None(self, A): ' autoscale only None-valued vmin or vmax' if self.vmin is None or self.vmax is None: val = np.ma.masked_where(np.isinf(A.data),A) colors.Normalize.autoscale_None(self,val) def inverse(self, value): if not self.scaled(): raise ValueError("Not invertible until scaled") vmin, vmax = float(self.vmin), float(self.vmax) if cbook.iterable(value): val = np.ma.asarray(value) return vmin + (vmax-vmin) * val else: return vmin + (vmax-vmin) * value healpy-1.8.1/healpy/cookbook.py0000650000175000017530000000314112120662776017061 0ustar zoncaplanck00000000000000"""Various generic useful functions """ def is_seq(o): """Check if the object is a sequence. Parameters ---------- o : any object The object to check Returns ------- is_seq : bool, scalar True if *o* is a sequence, False otherwise """ return hasattr(o, '__len__') def is_seq_of_seq(o): """Check if the object is a sequence of sequences. No check is done on the sizes of the sequences. Parameters ---------- o : any object The object to check Returns ------- is_seq_of_seq : bool True if *o* is a sequence of sequences, False otherwise. """ if not is_seq(o): return False for s in o: if not is_seq(s): return False return True def is_like2d(o): """Check if *o* is conformable to a 2d array. Parameters ---------- o : any object The object to check Returns ------- is_like2d : bool, scalar True if *o* is conformable to a 2d array, False otherwise. """ if not is_seq(o): return False size = None for s in o: if not is_seq(s): return False if size is None: size = len(s) if len(s) != size: return False return True def len_array_or_arrays(o): """Returns the length of a single array or list of arrays Parameters ---------- o : either array or sequence of arrays Returns ------- length : length of array """ if is_seq_of_seq(o): length = len(o[0]) else: length = len(o) return length healpy-1.8.1/setup.cfg0000644000175000017500000000007312351601662015074 0ustar zoncazonca00000000000000[egg_info] tag_build = tag_date = 0 tag_svn_revision = 0 healpy-1.8.1/healpixsubmodule/0000755000175000017500000000000012351601662016625 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/0000755000175000017500000000000012351601662017414 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/0000755000175000017500000000000012351601662020216 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/0000755000175000017500000000000012351601662022247 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/missing0000755000175000017500000001533012346122572023652 0ustar zoncazonca00000000000000#! /bin/sh # Common wrapper for a few potentially missing GNU programs. scriptversion=2013-10-28.13; # UTC # Copyright (C) 1996-2013 Free Software Foundation, Inc. # Originally written by Fran,cois Pinard , 1996. # 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 2, 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. if test $# -eq 0; then echo 1>&2 "Try '$0 --help' for more information" exit 1 fi case $1 in --is-lightweight) # Used by our autoconf macros to check whether the available missing # script is modern enough. exit 0 ;; --run) # Back-compat with the calling convention used by older automake. shift ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due to PROGRAM being missing or too old. Options: -h, --help display this help and exit -v, --version output version information and exit Supported PROGRAM values: aclocal autoconf autoheader autom4te automake makeinfo bison yacc flex lex help2man Version suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and 'g' are ignored when checking the name. Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: unknown '$1' option" echo 1>&2 "Try '$0 --help' for more information" exit 1 ;; esac # Run the given program, remember its exit status. "$@"; st=$? # If it succeeded, we are done. test $st -eq 0 && exit 0 # Also exit now if we it failed (or wasn't found), and '--version' was # passed; such an option is passed most likely to detect whether the # program is present and works. case $2 in --version|--help) exit $st;; esac # Exit code 63 means version mismatch. This often happens when the user # tries to use an ancient version of a tool on a file that requires a # minimum version. if test $st -eq 63; then msg="probably too old" elif test $st -eq 127; then # Program was missing. msg="missing on your system" else # Program was found and executed, but failed. Give up. exit $st fi perl_URL=http://www.perl.org/ flex_URL=http://flex.sourceforge.net/ gnu_software_URL=http://www.gnu.org/software program_details () { case $1 in aclocal|automake) echo "The '$1' program is part of the GNU Automake package:" echo "<$gnu_software_URL/automake>" echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/autoconf>" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; autoconf|autom4te|autoheader) echo "The '$1' program is part of the GNU Autoconf package:" echo "<$gnu_software_URL/autoconf/>" echo "It also requires GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; esac } give_advice () { # Normalize program name to check for. normalized_program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` printf '%s\n' "'$1' is $msg." configure_deps="'configure.ac' or m4 files included by 'configure.ac'" case $normalized_program in autoconf*) echo "You should only need it if you modified 'configure.ac'," echo "or m4 files included by it." program_details 'autoconf' ;; autoheader*) echo "You should only need it if you modified 'acconfig.h' or" echo "$configure_deps." program_details 'autoheader' ;; automake*) echo "You should only need it if you modified 'Makefile.am' or" echo "$configure_deps." program_details 'automake' ;; aclocal*) echo "You should only need it if you modified 'acinclude.m4' or" echo "$configure_deps." program_details 'aclocal' ;; autom4te*) echo "You might have modified some maintainer files that require" echo "the 'autom4te' program to be rebuilt." program_details 'autom4te' ;; bison*|yacc*) echo "You should only need it if you modified a '.y' file." echo "You may want to install the GNU Bison package:" echo "<$gnu_software_URL/bison/>" ;; lex*|flex*) echo "You should only need it if you modified a '.l' file." echo "You may want to install the Fast Lexical Analyzer package:" echo "<$flex_URL>" ;; help2man*) echo "You should only need it if you modified a dependency" \ "of a man page." echo "You may want to install the GNU Help2man package:" echo "<$gnu_software_URL/help2man/>" ;; makeinfo*) echo "You should only need it if you modified a '.texi' file, or" echo "any other file indirectly affecting the aspect of the manual." echo "You might want to install the Texinfo package:" echo "<$gnu_software_URL/texinfo/>" echo "The spurious makeinfo call might also be the consequence of" echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might" echo "want to install GNU make:" echo "<$gnu_software_URL/make/>" ;; *) echo "You might have modified some files without having the proper" echo "tools for further handling them. Check the 'README' file, it" echo "often tells you about the needed prerequisites for installing" echo "this package. You may also peek at any GNU archive site, in" echo "case some other package contains this missing '$1' program." ;; esac } give_advice "$1" | sed -e '1s/^/WARNING: /' \ -e '2,$s/^/ /' >&2 # Propagate the correct exit status (expected to be 127 for a program # not found, 63 for a program that failed due to version mismatch). exit $st # 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: "UTC" # time-stamp-end: "; # UTC" # End: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Makefile.in0000644000175000017500000022155712346122572024332 0ustar zoncazonca00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ bin_PROGRAMS = alm2map_cxx$(EXEEXT) anafast_cxx$(EXEEXT) \ calc_powspec$(EXEEXT) hotspots_cxx$(EXEEXT) map2tga$(EXEEXT) \ median_filter_cxx$(EXEEXT) mult_alm$(EXEEXT) \ rotalm_cxx$(EXEEXT) smoothing_cxx$(EXEEXT) \ syn_alm_cxx$(EXEEXT) udgrade_cxx$(EXEEXT) \ udgrade_harmonic_cxx$(EXEEXT) hpxtest$(EXEEXT) TESTS = hpxtest$(EXEEXT) subdir = . DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(top_srcdir)/configure $(am__configure_deps) depcomp \ $(include_HEADERS) test-driver ar-lib compile config.guess \ config.sub install-sh missing ltmain.sh ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/libtool.m4 \ $(top_srcdir)/m4/ltoptions.m4 $(top_srcdir)/m4/ltsugar.m4 \ $(top_srcdir)/m4/ltversion.m4 $(top_srcdir)/m4/lt~obsolete.m4 \ $(top_srcdir)/m4/m4_ax_create_pkgconfig_info.m4 \ $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } am__installdirs = "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" \ "$(DESTDIR)$(pkgconfigdir)" "$(DESTDIR)$(includedir)" LTLIBRARIES = $(lib_LTLIBRARIES) am__DEPENDENCIES_1 = libhealpix_cxx_la_DEPENDENCIES = $(am__DEPENDENCIES_1) am__dirstamp = $(am__leading_dot)dirstamp am__objects_1 = c_utils/c_utils.lo c_utils/walltime_c.lo am__objects_2 = libfftpack/bluestein.lo libfftpack/fftpack.lo \ libfftpack/ls_fft.lo am__objects_3 = libsharp/sharp.lo libsharp/sharp_almhelpers.lo \ libsharp/sharp_core.lo libsharp/sharp_geomhelpers.lo \ libsharp/sharp_ylmgen_c.lo am__objects_4 = cxxsupport/announce.lo cxxsupport/fitshandle.lo \ cxxsupport/geom_utils.lo cxxsupport/string_utils.lo \ cxxsupport/ls_image.lo cxxsupport/paramfile.lo \ cxxsupport/pointing.lo cxxsupport/rotmatrix.lo \ cxxsupport/trafos.lo cxxsupport/walltimer.lo \ cxxsupport/wigner.lo cxxsupport/error_handling.lo am__objects_5 = Healpix_cxx/alm.lo Healpix_cxx/alm2map_cxx_module.lo \ Healpix_cxx/alm_fitsio.lo Healpix_cxx/alm_healpix_tools.lo \ Healpix_cxx/alm_powspec_tools.lo \ Healpix_cxx/anafast_cxx_module.lo \ Healpix_cxx/calc_powspec_module.lo Healpix_cxx/healpix_base.lo \ Healpix_cxx/healpix_data_io.lo Healpix_cxx/healpix_map.lo \ Healpix_cxx/healpix_map_fitsio.lo \ Healpix_cxx/healpix_tables.lo \ Healpix_cxx/hotspots_cxx_module.lo \ Healpix_cxx/map2tga_module.lo \ Healpix_cxx/median_filter_cxx_module.lo \ Healpix_cxx/mult_alm_module.lo Healpix_cxx/powspec.lo \ Healpix_cxx/powspec_fitsio.lo \ Healpix_cxx/smoothing_cxx_module.lo \ Healpix_cxx/syn_alm_cxx_module.lo \ Healpix_cxx/udgrade_cxx_module.lo \ Healpix_cxx/udgrade_harmonic_cxx_module.lo am_libhealpix_cxx_la_OBJECTS = $(am__objects_1) $(am__objects_2) \ $(am__objects_3) $(am__objects_4) $(am__objects_5) libhealpix_cxx_la_OBJECTS = $(am_libhealpix_cxx_la_OBJECTS) AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent am__v_lt_1 = PROGRAMS = $(bin_PROGRAMS) am_alm2map_cxx_OBJECTS = Healpix_cxx/alm2map_cxx.$(OBJEXT) alm2map_cxx_OBJECTS = $(am_alm2map_cxx_OBJECTS) alm2map_cxx_DEPENDENCIES = libhealpix_cxx.la alm2map_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(alm2map_cxx_LDFLAGS) $(LDFLAGS) -o $@ am_anafast_cxx_OBJECTS = Healpix_cxx/anafast_cxx.$(OBJEXT) anafast_cxx_OBJECTS = $(am_anafast_cxx_OBJECTS) anafast_cxx_DEPENDENCIES = libhealpix_cxx.la anafast_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(anafast_cxx_LDFLAGS) $(LDFLAGS) -o $@ am_calc_powspec_OBJECTS = Healpix_cxx/calc_powspec.$(OBJEXT) calc_powspec_OBJECTS = $(am_calc_powspec_OBJECTS) calc_powspec_DEPENDENCIES = libhealpix_cxx.la calc_powspec_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(calc_powspec_LDFLAGS) $(LDFLAGS) -o $@ am_hotspots_cxx_OBJECTS = Healpix_cxx/hotspots_cxx.$(OBJEXT) hotspots_cxx_OBJECTS = $(am_hotspots_cxx_OBJECTS) hotspots_cxx_DEPENDENCIES = libhealpix_cxx.la hotspots_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(hotspots_cxx_LDFLAGS) $(LDFLAGS) -o $@ am_hpxtest_OBJECTS = Healpix_cxx/hpxtest.$(OBJEXT) hpxtest_OBJECTS = $(am_hpxtest_OBJECTS) hpxtest_DEPENDENCIES = libhealpix_cxx.la hpxtest_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(hpxtest_LDFLAGS) $(LDFLAGS) -o $@ am_map2tga_OBJECTS = Healpix_cxx/map2tga.$(OBJEXT) map2tga_OBJECTS = $(am_map2tga_OBJECTS) map2tga_DEPENDENCIES = libhealpix_cxx.la map2tga_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(map2tga_LDFLAGS) $(LDFLAGS) -o $@ am_median_filter_cxx_OBJECTS = \ Healpix_cxx/median_filter_cxx.$(OBJEXT) median_filter_cxx_OBJECTS = $(am_median_filter_cxx_OBJECTS) median_filter_cxx_DEPENDENCIES = libhealpix_cxx.la median_filter_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \ $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \ $(AM_CXXFLAGS) $(CXXFLAGS) $(median_filter_cxx_LDFLAGS) \ $(LDFLAGS) -o $@ am_mult_alm_OBJECTS = Healpix_cxx/mult_alm.$(OBJEXT) mult_alm_OBJECTS = $(am_mult_alm_OBJECTS) mult_alm_DEPENDENCIES = libhealpix_cxx.la mult_alm_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(mult_alm_LDFLAGS) $(LDFLAGS) -o $@ am_rotalm_cxx_OBJECTS = Healpix_cxx/rotalm_cxx.$(OBJEXT) rotalm_cxx_OBJECTS = $(am_rotalm_cxx_OBJECTS) rotalm_cxx_DEPENDENCIES = libhealpix_cxx.la rotalm_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(rotalm_cxx_LDFLAGS) $(LDFLAGS) -o $@ am_smoothing_cxx_OBJECTS = Healpix_cxx/smoothing_cxx.$(OBJEXT) smoothing_cxx_OBJECTS = $(am_smoothing_cxx_OBJECTS) smoothing_cxx_DEPENDENCIES = libhealpix_cxx.la smoothing_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \ $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \ $(AM_CXXFLAGS) $(CXXFLAGS) $(smoothing_cxx_LDFLAGS) $(LDFLAGS) \ -o $@ am_syn_alm_cxx_OBJECTS = Healpix_cxx/syn_alm_cxx.$(OBJEXT) syn_alm_cxx_OBJECTS = $(am_syn_alm_cxx_OBJECTS) syn_alm_cxx_DEPENDENCIES = libhealpix_cxx.la syn_alm_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(syn_alm_cxx_LDFLAGS) $(LDFLAGS) -o $@ am_udgrade_cxx_OBJECTS = Healpix_cxx/udgrade_cxx.$(OBJEXT) udgrade_cxx_OBJECTS = $(am_udgrade_cxx_OBJECTS) udgrade_cxx_DEPENDENCIES = libhealpix_cxx.la udgrade_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(udgrade_cxx_LDFLAGS) $(LDFLAGS) -o $@ am_udgrade_harmonic_cxx_OBJECTS = \ Healpix_cxx/udgrade_harmonic_cxx.$(OBJEXT) udgrade_harmonic_cxx_OBJECTS = $(am_udgrade_harmonic_cxx_OBJECTS) udgrade_harmonic_cxx_DEPENDENCIES = libhealpix_cxx.la udgrade_harmonic_cxx_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \ $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \ $(AM_CXXFLAGS) $(CXXFLAGS) $(udgrade_harmonic_cxx_LDFLAGS) \ $(LDFLAGS) -o $@ AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; am__v_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = DEFAULT_INCLUDES = -I.@am__isrc@ depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) AM_V_CC = $(am__v_CC_@AM_V@) am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@) am__v_CC_0 = @echo " CC " $@; am__v_CC_1 = CCLD = $(CC) LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CCLD = $(am__v_CCLD_@AM_V@) am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@) am__v_CCLD_0 = @echo " CCLD " $@; am__v_CCLD_1 = CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CXXFLAGS) $(CXXFLAGS) AM_V_CXX = $(am__v_CXX_@AM_V@) am__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@) am__v_CXX_0 = @echo " CXX " $@; am__v_CXX_1 = CXXLD = $(CXX) CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CXXLD = $(am__v_CXXLD_@AM_V@) am__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@) am__v_CXXLD_0 = @echo " CXXLD " $@; am__v_CXXLD_1 = SOURCES = $(libhealpix_cxx_la_SOURCES) $(alm2map_cxx_SOURCES) \ $(anafast_cxx_SOURCES) $(calc_powspec_SOURCES) \ $(hotspots_cxx_SOURCES) $(hpxtest_SOURCES) $(map2tga_SOURCES) \ $(median_filter_cxx_SOURCES) $(mult_alm_SOURCES) \ $(rotalm_cxx_SOURCES) $(smoothing_cxx_SOURCES) \ $(syn_alm_cxx_SOURCES) $(udgrade_cxx_SOURCES) \ $(udgrade_harmonic_cxx_SOURCES) DIST_SOURCES = $(libhealpix_cxx_la_SOURCES) $(alm2map_cxx_SOURCES) \ $(anafast_cxx_SOURCES) $(calc_powspec_SOURCES) \ $(hotspots_cxx_SOURCES) $(hpxtest_SOURCES) $(map2tga_SOURCES) \ $(median_filter_cxx_SOURCES) $(mult_alm_SOURCES) \ $(rotalm_cxx_SOURCES) $(smoothing_cxx_SOURCES) \ $(syn_alm_cxx_SOURCES) $(udgrade_cxx_SOURCES) \ $(udgrade_harmonic_cxx_SOURCES) am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac DATA = $(nodist_pkgconfig_DATA) HEADERS = $(include_HEADERS) am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags CSCOPE = cscope AM_RECURSIVE_TARGETS = cscope check recheck am__tty_colors_dummy = \ mgn= red= grn= lgn= blu= brg= std=; \ am__color_tests=no am__tty_colors = { \ $(am__tty_colors_dummy); \ if test "X$(AM_COLOR_TESTS)" = Xno; then \ am__color_tests=no; \ elif test "X$(AM_COLOR_TESTS)" = Xalways; then \ am__color_tests=yes; \ elif test "X$$TERM" != Xdumb && { test -t 1; } 2>/dev/null; then \ am__color_tests=yes; \ fi; \ if test $$am__color_tests = yes; then \ red=''; \ grn=''; \ lgn=''; \ blu=''; \ mgn=''; \ brg=''; \ std=''; \ fi; \ } am__recheck_rx = ^[ ]*:recheck:[ ]* am__global_test_result_rx = ^[ ]*:global-test-result:[ ]* am__copy_in_global_log_rx = ^[ ]*:copy-in-global-log:[ ]* # A command that, given a newline-separated list of test names on the # standard input, print the name of the tests that are to be re-run # upon "make recheck". am__list_recheck_tests = $(AWK) '{ \ recheck = 1; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ { \ if ((getline line2 < ($$0 ".log")) < 0) \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[nN][Oo]/) \ { \ recheck = 0; \ break; \ } \ else if (line ~ /$(am__recheck_rx)[yY][eE][sS]/) \ { \ break; \ } \ }; \ if (recheck) \ print $$0; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # A command that, given a newline-separated list of test names on the # standard input, create the global log from their .trs and .log files. am__create_global_log = $(AWK) ' \ function fatal(msg) \ { \ print "fatal: making $@: " msg | "cat >&2"; \ exit 1; \ } \ function rst_section(header) \ { \ print header; \ len = length(header); \ for (i = 1; i <= len; i = i + 1) \ printf "="; \ printf "\n\n"; \ } \ { \ copy_in_global_log = 1; \ global_test_result = "RUN"; \ while ((rc = (getline line < ($$0 ".trs"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".trs"); \ if (line ~ /$(am__global_test_result_rx)/) \ { \ sub("$(am__global_test_result_rx)", "", line); \ sub("[ ]*$$", "", line); \ global_test_result = line; \ } \ else if (line ~ /$(am__copy_in_global_log_rx)[nN][oO]/) \ copy_in_global_log = 0; \ }; \ if (copy_in_global_log) \ { \ rst_section(global_test_result ": " $$0); \ while ((rc = (getline line < ($$0 ".log"))) != 0) \ { \ if (rc < 0) \ fatal("failed to read from " $$0 ".log"); \ print line; \ }; \ printf "\n"; \ }; \ close ($$0 ".trs"); \ close ($$0 ".log"); \ }' # Restructured Text title. am__rst_title = { sed 's/.*/ & /;h;s/./=/g;p;x;s/ *$$//;p;g' && echo; } # Solaris 10 'make', and several other traditional 'make' implementations, # pass "-e" to $(SHELL), and POSIX 2008 even requires this. Work around it # by disabling -e (using the XSI extension "set +e") if it's set. am__sh_e_setup = case $$- in *e*) set +e;; esac # Default flags passed to test drivers. am__common_driver_flags = \ --color-tests "$$am__color_tests" \ --enable-hard-errors "$$am__enable_hard_errors" \ --expect-failure "$$am__expect_failure" # To be inserted before the command running the test. Creates the # directory for the log if needed. Stores in $dir the directory # containing $f, in $tst the test, in $log the log. Executes the # developer- defined test setup AM_TESTS_ENVIRONMENT (if any), and # passes TESTS_ENVIRONMENT. Set up options for the wrapper that # will run the test scripts (or their associated LOG_COMPILER, if # thy have one). am__check_pre = \ $(am__sh_e_setup); \ $(am__vpath_adj_setup) $(am__vpath_adj) \ $(am__tty_colors); \ srcdir=$(srcdir); export srcdir; \ case "$@" in \ */*) am__odir=`echo "./$@" | sed 's|/[^/]*$$||'`;; \ *) am__odir=.;; \ esac; \ test "x$$am__odir" = x"." || test -d "$$am__odir" \ || $(MKDIR_P) "$$am__odir" || exit $$?; \ if test -f "./$$f"; then dir=./; \ elif test -f "$$f"; then dir=; \ else dir="$(srcdir)/"; fi; \ tst=$$dir$$f; log='$@'; \ if test -n '$(DISABLE_HARD_ERRORS)'; then \ am__enable_hard_errors=no; \ else \ am__enable_hard_errors=yes; \ fi; \ case " $(XFAIL_TESTS) " in \ *[\ \ ]$$f[\ \ ]* | *[\ \ ]$$dir$$f[\ \ ]*) \ am__expect_failure=yes;; \ *) \ am__expect_failure=no;; \ esac; \ $(AM_TESTS_ENVIRONMENT) $(TESTS_ENVIRONMENT) # A shell command to get the names of the tests scripts with any registered # extension removed (i.e., equivalently, the names of the test logs, with # the '.log' extension removed). The result is saved in the shell variable # '$bases'. This honors runtime overriding of TESTS and TEST_LOGS. Sadly, # we cannot use something simpler, involving e.g., "$(TEST_LOGS:.log=)", # since that might cause problem with VPATH rewrites for suffix-less tests. # See also 'test-harness-vpath-rewrite.sh' and 'test-trs-basic.sh'. am__set_TESTS_bases = \ bases='$(TEST_LOGS)'; \ bases=`for i in $$bases; do echo $$i; done | sed 's/\.log$$//'`; \ bases=`echo $$bases` RECHECK_LOGS = $(TEST_LOGS) TEST_SUITE_LOG = test-suite.log TEST_EXTENSIONS = @EXEEXT@ .test LOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver LOG_COMPILE = $(LOG_COMPILER) $(AM_LOG_FLAGS) $(LOG_FLAGS) am__set_b = \ case '$@' in \ */*) \ case '$*' in \ */*) b='$*';; \ *) b=`echo '$@' | sed 's/\.log$$//'`; \ esac;; \ *) \ b='$*';; \ esac am__test_logs1 = $(TESTS:=.log) am__test_logs2 = $(am__test_logs1:@EXEEXT@.log=.log) TEST_LOGS = $(am__test_logs2:.test.log=.log) TEST_LOG_DRIVER = $(SHELL) $(top_srcdir)/test-driver TEST_LOG_COMPILE = $(TEST_LOG_COMPILER) $(AM_TEST_LOG_FLAGS) \ $(TEST_LOG_FLAGS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ if test -d "$(distdir)"; then \ find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -rf "$(distdir)" \ || { sleep 5 && rm -rf "$(distdir)"; }; \ else :; fi am__post_remove_distdir = $(am__remove_distdir) DIST_ARCHIVES = $(distdir).tar.gz GZIP_ENV = --best DIST_TARGETS = dist-gzip distuninstallcheck_listfiles = find . -type f -print am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \ | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$' distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFITSIO_CFLAGS = @CFITSIO_CFLAGS@ CFITSIO_LIBS = @CFITSIO_LIBS@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAINT = @MAINT@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OPENMP_CFLAGS = @OPENMP_CFLAGS@ OPENMP_CXXFLAGS = @OPENMP_CXXFLAGS@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ PKG_CONFIG = @PKG_CONFIG@ PKG_CONFIG_LIBDIR = @PKG_CONFIG_LIBDIR@ PKG_CONFIG_PATH = @PKG_CONFIG_PATH@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ pkgconfig_libdir = @pkgconfig_libdir@ pkgconfig_libfile = @pkgconfig_libfile@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ ACLOCAL_AMFLAGS = -I m4 lib_LTLIBRARIES = libhealpix_cxx.la src_c_utils = \ c_utils/c_utils.c \ c_utils/c_utils.h \ c_utils/walltime_c.c \ c_utils/walltime_c.h src_libfftpack = \ libfftpack/bluestein.h \ libfftpack/bluestein.c \ libfftpack/fftpack.h \ libfftpack/fftpack.c \ libfftpack/ls_fft.h \ libfftpack/ls_fft.c src_libsharp = \ libsharp/sharp.c \ libsharp/sharp.h \ libsharp/sharp_cxx.h \ libsharp/sharp_almhelpers.c \ libsharp/sharp_almhelpers.h \ libsharp/sharp_complex_hacks.h \ libsharp/sharp_core.c \ libsharp/sharp_core.h \ libsharp/sharp_geomhelpers.c \ libsharp/sharp_geomhelpers.h \ libsharp/sharp_internal.h \ libsharp/sharp_lowlevel.h \ libsharp/sharp_vecsupport.h \ libsharp/sharp_vecutil.h \ libsharp/sharp_ylmgen_c.c \ libsharp/sharp_ylmgen_c.h src_cxxsupport = \ cxxsupport/announce.cc \ cxxsupport/fitshandle.cc \ cxxsupport/geom_utils.cc \ cxxsupport/string_utils.cc \ cxxsupport/ls_image.cc \ cxxsupport/paramfile.cc \ cxxsupport/pointing.cc \ cxxsupport/rotmatrix.cc \ cxxsupport/trafos.cc \ cxxsupport/walltimer.cc \ cxxsupport/wigner.cc \ cxxsupport/error_handling.cc \ cxxsupport/alloc_utils.h \ cxxsupport/announce.h \ cxxsupport/arr.h \ cxxsupport/bstream.h \ cxxsupport/datatypes.h \ cxxsupport/error_handling.h \ cxxsupport/fftpack_support.h \ cxxsupport/fitshandle.h \ cxxsupport/geom_utils.h \ cxxsupport/levels_facilities.h \ cxxsupport/ls_image.h \ cxxsupport/lsconstants.h \ cxxsupport/math_utils.h \ cxxsupport/openmp_support.h \ cxxsupport/paramfile.h \ cxxsupport/planck_rng.h \ cxxsupport/pointing.h \ cxxsupport/rangeset.h \ cxxsupport/rotmatrix.h \ cxxsupport/safe_cast.h \ cxxsupport/safe_ptr.h \ cxxsupport/share_utils.h \ cxxsupport/sse_utils_cxx.h \ cxxsupport/string_utils.h \ cxxsupport/trafos.h \ cxxsupport/vec3.h \ cxxsupport/walltimer.h \ cxxsupport/wigner.h \ cxxsupport/xcomplex.h src_healpix_cxx = \ Healpix_cxx/alm.cc \ Healpix_cxx/alm.h \ Healpix_cxx/alm2map_cxx_module.cc \ Healpix_cxx/alm_fitsio.cc \ Healpix_cxx/alm_fitsio.h \ Healpix_cxx/alm_healpix_tools.cc \ Healpix_cxx/alm_healpix_tools.h \ Healpix_cxx/alm_powspec_tools.cc \ Healpix_cxx/alm_powspec_tools.h \ Healpix_cxx/anafast_cxx_module.cc \ Healpix_cxx/calc_powspec_module.cc \ Healpix_cxx/healpix_base.cc \ Healpix_cxx/healpix_base.h \ Healpix_cxx/healpix_data_io.cc \ Healpix_cxx/healpix_data_io.h \ Healpix_cxx/healpix_map.cc \ Healpix_cxx/healpix_map.h \ Healpix_cxx/healpix_map_fitsio.cc \ Healpix_cxx/healpix_map_fitsio.h \ Healpix_cxx/healpix_tables.cc \ Healpix_cxx/healpix_tables.h \ Healpix_cxx/hotspots_cxx_module.cc \ Healpix_cxx/map2tga_module.cc \ Healpix_cxx/median_filter_cxx_module.cc \ Healpix_cxx/mult_alm_module.cc \ Healpix_cxx/powspec.cc \ Healpix_cxx/powspec.h \ Healpix_cxx/powspec_fitsio.cc \ Healpix_cxx/powspec_fitsio.h \ Healpix_cxx/smoothing_cxx_module.cc \ Healpix_cxx/syn_alm_cxx_module.cc \ Healpix_cxx/udgrade_cxx_module.cc \ Healpix_cxx/udgrade_harmonic_cxx_module.cc EXTRA_DIST = \ libfftpack/fftpack_inc.c \ libsharp/sharp_core_inc.c \ libsharp/sharp_core_inc2.c \ libsharp/sharp_core_inchelper.c \ cxxsupport/font_data.inc include_HEADERS = \ libsharp/sharp.h \ libsharp/sharp_lowlevel.h \ libsharp/sharp_geomhelpers.c \ libsharp/sharp_geomhelpers.h \ cxxsupport/arr.h \ cxxsupport/xcomplex.h \ cxxsupport/datatypes.h \ cxxsupport/pointing.h \ cxxsupport/rangeset.h \ cxxsupport/fitshandle.h \ cxxsupport/alloc_utils.h \ cxxsupport/math_utils.h \ cxxsupport/error_handling.h \ cxxsupport/lsconstants.h \ cxxsupport/safe_cast.h \ cxxsupport/vec3.h \ cxxsupport/wigner.h \ cxxsupport/rotmatrix.h \ cxxsupport/sse_utils_cxx.h \ cxxsupport/string_utils.h \ Healpix_cxx/alm.h \ Healpix_cxx/alm_fitsio.h \ Healpix_cxx/alm_healpix_tools.h \ Healpix_cxx/alm_powspec_tools.h \ Healpix_cxx/healpix_base.h \ Healpix_cxx/healpix_data_io.h \ Healpix_cxx/healpix_map.h \ Healpix_cxx/healpix_map_fitsio.h \ Healpix_cxx/healpix_tables.h \ Healpix_cxx/powspec.h \ Healpix_cxx/powspec_fitsio.h libhealpix_cxx_la_SOURCES = $(src_c_utils) $(src_libfftpack) $(src_libsharp) $(src_cxxsupport) $(src_healpix_cxx) libhealpix_cxx_la_LIBADD = $(CFITSIO_LIBS) alm2map_cxx_SOURCES = Healpix_cxx/alm2map_cxx.cc alm2map_cxx_LDADD = libhealpix_cxx.la alm2map_cxx_LDFLAGS = -static-libtool-libs anafast_cxx_SOURCES = Healpix_cxx/anafast_cxx.cc anafast_cxx_LDADD = libhealpix_cxx.la anafast_cxx_LDFLAGS = -static-libtool-libs calc_powspec_SOURCES = Healpix_cxx/calc_powspec.cc calc_powspec_LDADD = libhealpix_cxx.la calc_powspec_LDFLAGS = -static-libtool-libs hotspots_cxx_SOURCES = Healpix_cxx/hotspots_cxx.cc hotspots_cxx_LDADD = libhealpix_cxx.la hotspots_cxx_LDFLAGS = -static-libtool-libs map2tga_SOURCES = Healpix_cxx/map2tga.cc map2tga_LDADD = libhealpix_cxx.la map2tga_LDFLAGS = -static-libtool-libs median_filter_cxx_SOURCES = Healpix_cxx/median_filter_cxx.cc median_filter_cxx_LDADD = libhealpix_cxx.la median_filter_cxx_LDFLAGS = -static-libtool-libs mult_alm_SOURCES = Healpix_cxx/mult_alm.cc mult_alm_LDADD = libhealpix_cxx.la mult_alm_LDFLAGS = -static-libtool-libs rotalm_cxx_SOURCES = Healpix_cxx/rotalm_cxx.cc rotalm_cxx_LDADD = libhealpix_cxx.la rotalm_cxx_LDFLAGS = -static-libtool-libs smoothing_cxx_SOURCES = Healpix_cxx/smoothing_cxx.cc smoothing_cxx_LDADD = libhealpix_cxx.la smoothing_cxx_LDFLAGS = -static-libtool-libs syn_alm_cxx_SOURCES = Healpix_cxx/syn_alm_cxx.cc syn_alm_cxx_LDADD = libhealpix_cxx.la syn_alm_cxx_LDFLAGS = -static-libtool-libs udgrade_cxx_SOURCES = Healpix_cxx/udgrade_cxx.cc udgrade_cxx_LDADD = libhealpix_cxx.la udgrade_cxx_LDFLAGS = -static-libtool-libs udgrade_harmonic_cxx_SOURCES = Healpix_cxx/udgrade_harmonic_cxx.cc udgrade_harmonic_cxx_LDADD = libhealpix_cxx.la udgrade_harmonic_cxx_LDFLAGS = -static-libtool-libs hpxtest_SOURCES = Healpix_cxx/hpxtest.cc hpxtest_LDADD = libhealpix_cxx.la hpxtest_LDFLAGS = -static-libtool-libs AM_CPPFLAGS = $(CFITSIO_CFLAGS) -I$(top_srcdir)/c_utils -I$(top_srcdir)/libfftpack -I$(top_srcdir)/libsharp -I$(top_srcdir)/cxxsupport pkgconfigdir = $(libdir)/pkgconfig nodist_pkgconfig_DATA = @PACKAGE_NAME@.pc DISTCLEANFILES = @PACKAGE_NAME@.pc @PACKAGE_NAME@.pc.in @PACKAGE_NAME@-uninstalled.pc @PACKAGE_NAME@-uninstalled.sh all: all-am .SUFFIXES: .SUFFIXES: .c .cc .lo .log .o .obj .test .test$(EXEEXT) .trs am--refresh: Makefile @: $(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --foreign'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --foreign \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --foreign Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } c_utils/$(am__dirstamp): @$(MKDIR_P) c_utils @: > c_utils/$(am__dirstamp) c_utils/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) c_utils/$(DEPDIR) @: > c_utils/$(DEPDIR)/$(am__dirstamp) c_utils/c_utils.lo: c_utils/$(am__dirstamp) \ c_utils/$(DEPDIR)/$(am__dirstamp) c_utils/walltime_c.lo: c_utils/$(am__dirstamp) \ c_utils/$(DEPDIR)/$(am__dirstamp) libfftpack/$(am__dirstamp): @$(MKDIR_P) libfftpack @: > libfftpack/$(am__dirstamp) libfftpack/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) libfftpack/$(DEPDIR) @: > libfftpack/$(DEPDIR)/$(am__dirstamp) libfftpack/bluestein.lo: libfftpack/$(am__dirstamp) \ libfftpack/$(DEPDIR)/$(am__dirstamp) libfftpack/fftpack.lo: libfftpack/$(am__dirstamp) \ libfftpack/$(DEPDIR)/$(am__dirstamp) libfftpack/ls_fft.lo: libfftpack/$(am__dirstamp) \ libfftpack/$(DEPDIR)/$(am__dirstamp) libsharp/$(am__dirstamp): @$(MKDIR_P) libsharp @: > libsharp/$(am__dirstamp) libsharp/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) libsharp/$(DEPDIR) @: > libsharp/$(DEPDIR)/$(am__dirstamp) libsharp/sharp.lo: libsharp/$(am__dirstamp) \ libsharp/$(DEPDIR)/$(am__dirstamp) libsharp/sharp_almhelpers.lo: libsharp/$(am__dirstamp) \ libsharp/$(DEPDIR)/$(am__dirstamp) libsharp/sharp_core.lo: libsharp/$(am__dirstamp) \ libsharp/$(DEPDIR)/$(am__dirstamp) libsharp/sharp_geomhelpers.lo: libsharp/$(am__dirstamp) \ libsharp/$(DEPDIR)/$(am__dirstamp) libsharp/sharp_ylmgen_c.lo: libsharp/$(am__dirstamp) \ libsharp/$(DEPDIR)/$(am__dirstamp) cxxsupport/$(am__dirstamp): @$(MKDIR_P) cxxsupport @: > cxxsupport/$(am__dirstamp) cxxsupport/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) cxxsupport/$(DEPDIR) @: > cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/announce.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/fitshandle.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/geom_utils.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/string_utils.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/ls_image.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/paramfile.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/pointing.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/rotmatrix.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/trafos.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/walltimer.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/wigner.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) cxxsupport/error_handling.lo: cxxsupport/$(am__dirstamp) \ cxxsupport/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/$(am__dirstamp): @$(MKDIR_P) Healpix_cxx @: > Healpix_cxx/$(am__dirstamp) Healpix_cxx/$(DEPDIR)/$(am__dirstamp): @$(MKDIR_P) Healpix_cxx/$(DEPDIR) @: > Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/alm.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/alm2map_cxx_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/alm_fitsio.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/alm_healpix_tools.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/alm_powspec_tools.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/anafast_cxx_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/calc_powspec_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/healpix_base.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/healpix_data_io.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/healpix_map.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/healpix_map_fitsio.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/healpix_tables.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/hotspots_cxx_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/map2tga_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/median_filter_cxx_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/mult_alm_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/powspec.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/powspec_fitsio.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/smoothing_cxx_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/syn_alm_cxx_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/udgrade_cxx_module.lo: Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) Healpix_cxx/udgrade_harmonic_cxx_module.lo: \ Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) libhealpix_cxx.la: $(libhealpix_cxx_la_OBJECTS) $(libhealpix_cxx_la_DEPENDENCIES) $(EXTRA_libhealpix_cxx_la_DEPENDENCIES) $(AM_V_CXXLD)$(CXXLINK) -rpath $(libdir) $(libhealpix_cxx_la_OBJECTS) $(libhealpix_cxx_la_LIBADD) $(LIBS) install-binPROGRAMS: $(bin_PROGRAMS) @$(NORMAL_INSTALL) @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \ $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \ fi; \ for p in $$list; do echo "$$p $$p"; done | \ sed 's/$(EXEEXT)$$//' | \ while read p p1; do if test -f $$p \ || test -f $$p1 \ ; then echo "$$p"; echo "$$p"; else :; fi; \ done | \ sed -e 'p;s,.*/,,;n;h' \ -e 's|.*|.|' \ -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \ sed 'N;N;N;s,\n, ,g' | \ $(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1 } \ { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \ if ($$2 == $$4) files[d] = files[d] " " $$1; \ else { print "f", $$3 "/" $$4, $$1; } } \ END { for (d in files) print "f", d, files[d] }' | \ while read type dir files; do \ if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \ test -z "$$files" || { \ echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'"; \ $(INSTALL_PROGRAM_ENV) $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL_PROGRAM) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \ } \ ; done uninstall-binPROGRAMS: @$(NORMAL_UNINSTALL) @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \ files=`for p in $$list; do echo "$$p"; done | \ sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \ -e 's/$$/$(EXEEXT)/' \ `; \ test -n "$$list" || exit 0; \ echo " ( cd '$(DESTDIR)$(bindir)' && rm -f" $$files ")"; \ cd "$(DESTDIR)$(bindir)" && rm -f $$files clean-binPROGRAMS: @list='$(bin_PROGRAMS)'; test -n "$$list" || exit 0; \ echo " rm -f" $$list; \ rm -f $$list || exit $$?; \ test -n "$(EXEEXT)" || exit 0; \ list=`for p in $$list; do echo "$$p"; done | sed 's/$(EXEEXT)$$//'`; \ echo " rm -f" $$list; \ rm -f $$list Healpix_cxx/alm2map_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) alm2map_cxx$(EXEEXT): $(alm2map_cxx_OBJECTS) $(alm2map_cxx_DEPENDENCIES) $(EXTRA_alm2map_cxx_DEPENDENCIES) @rm -f alm2map_cxx$(EXEEXT) $(AM_V_CXXLD)$(alm2map_cxx_LINK) $(alm2map_cxx_OBJECTS) $(alm2map_cxx_LDADD) $(LIBS) Healpix_cxx/anafast_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) anafast_cxx$(EXEEXT): $(anafast_cxx_OBJECTS) $(anafast_cxx_DEPENDENCIES) $(EXTRA_anafast_cxx_DEPENDENCIES) @rm -f anafast_cxx$(EXEEXT) $(AM_V_CXXLD)$(anafast_cxx_LINK) $(anafast_cxx_OBJECTS) $(anafast_cxx_LDADD) $(LIBS) Healpix_cxx/calc_powspec.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) calc_powspec$(EXEEXT): $(calc_powspec_OBJECTS) $(calc_powspec_DEPENDENCIES) $(EXTRA_calc_powspec_DEPENDENCIES) @rm -f calc_powspec$(EXEEXT) $(AM_V_CXXLD)$(calc_powspec_LINK) $(calc_powspec_OBJECTS) $(calc_powspec_LDADD) $(LIBS) Healpix_cxx/hotspots_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) hotspots_cxx$(EXEEXT): $(hotspots_cxx_OBJECTS) $(hotspots_cxx_DEPENDENCIES) $(EXTRA_hotspots_cxx_DEPENDENCIES) @rm -f hotspots_cxx$(EXEEXT) $(AM_V_CXXLD)$(hotspots_cxx_LINK) $(hotspots_cxx_OBJECTS) $(hotspots_cxx_LDADD) $(LIBS) Healpix_cxx/hpxtest.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) hpxtest$(EXEEXT): $(hpxtest_OBJECTS) $(hpxtest_DEPENDENCIES) $(EXTRA_hpxtest_DEPENDENCIES) @rm -f hpxtest$(EXEEXT) $(AM_V_CXXLD)$(hpxtest_LINK) $(hpxtest_OBJECTS) $(hpxtest_LDADD) $(LIBS) Healpix_cxx/map2tga.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) map2tga$(EXEEXT): $(map2tga_OBJECTS) $(map2tga_DEPENDENCIES) $(EXTRA_map2tga_DEPENDENCIES) @rm -f map2tga$(EXEEXT) $(AM_V_CXXLD)$(map2tga_LINK) $(map2tga_OBJECTS) $(map2tga_LDADD) $(LIBS) Healpix_cxx/median_filter_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) median_filter_cxx$(EXEEXT): $(median_filter_cxx_OBJECTS) $(median_filter_cxx_DEPENDENCIES) $(EXTRA_median_filter_cxx_DEPENDENCIES) @rm -f median_filter_cxx$(EXEEXT) $(AM_V_CXXLD)$(median_filter_cxx_LINK) $(median_filter_cxx_OBJECTS) $(median_filter_cxx_LDADD) $(LIBS) Healpix_cxx/mult_alm.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) mult_alm$(EXEEXT): $(mult_alm_OBJECTS) $(mult_alm_DEPENDENCIES) $(EXTRA_mult_alm_DEPENDENCIES) @rm -f mult_alm$(EXEEXT) $(AM_V_CXXLD)$(mult_alm_LINK) $(mult_alm_OBJECTS) $(mult_alm_LDADD) $(LIBS) Healpix_cxx/rotalm_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) rotalm_cxx$(EXEEXT): $(rotalm_cxx_OBJECTS) $(rotalm_cxx_DEPENDENCIES) $(EXTRA_rotalm_cxx_DEPENDENCIES) @rm -f rotalm_cxx$(EXEEXT) $(AM_V_CXXLD)$(rotalm_cxx_LINK) $(rotalm_cxx_OBJECTS) $(rotalm_cxx_LDADD) $(LIBS) Healpix_cxx/smoothing_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) smoothing_cxx$(EXEEXT): $(smoothing_cxx_OBJECTS) $(smoothing_cxx_DEPENDENCIES) $(EXTRA_smoothing_cxx_DEPENDENCIES) @rm -f smoothing_cxx$(EXEEXT) $(AM_V_CXXLD)$(smoothing_cxx_LINK) $(smoothing_cxx_OBJECTS) $(smoothing_cxx_LDADD) $(LIBS) Healpix_cxx/syn_alm_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) syn_alm_cxx$(EXEEXT): $(syn_alm_cxx_OBJECTS) $(syn_alm_cxx_DEPENDENCIES) $(EXTRA_syn_alm_cxx_DEPENDENCIES) @rm -f syn_alm_cxx$(EXEEXT) $(AM_V_CXXLD)$(syn_alm_cxx_LINK) $(syn_alm_cxx_OBJECTS) $(syn_alm_cxx_LDADD) $(LIBS) Healpix_cxx/udgrade_cxx.$(OBJEXT): Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) udgrade_cxx$(EXEEXT): $(udgrade_cxx_OBJECTS) $(udgrade_cxx_DEPENDENCIES) $(EXTRA_udgrade_cxx_DEPENDENCIES) @rm -f udgrade_cxx$(EXEEXT) $(AM_V_CXXLD)$(udgrade_cxx_LINK) $(udgrade_cxx_OBJECTS) $(udgrade_cxx_LDADD) $(LIBS) Healpix_cxx/udgrade_harmonic_cxx.$(OBJEXT): \ Healpix_cxx/$(am__dirstamp) \ Healpix_cxx/$(DEPDIR)/$(am__dirstamp) udgrade_harmonic_cxx$(EXEEXT): $(udgrade_harmonic_cxx_OBJECTS) $(udgrade_harmonic_cxx_DEPENDENCIES) $(EXTRA_udgrade_harmonic_cxx_DEPENDENCIES) @rm -f udgrade_harmonic_cxx$(EXEEXT) $(AM_V_CXXLD)$(udgrade_harmonic_cxx_LINK) $(udgrade_harmonic_cxx_OBJECTS) $(udgrade_harmonic_cxx_LDADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) -rm -f Healpix_cxx/*.$(OBJEXT) -rm -f Healpix_cxx/*.lo -rm -f c_utils/*.$(OBJEXT) -rm -f c_utils/*.lo -rm -f cxxsupport/*.$(OBJEXT) -rm -f cxxsupport/*.lo -rm -f libfftpack/*.$(OBJEXT) -rm -f libfftpack/*.lo -rm -f libsharp/*.$(OBJEXT) -rm -f libsharp/*.lo distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/alm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/alm2map_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/alm2map_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/alm_fitsio.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/alm_healpix_tools.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/alm_powspec_tools.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/anafast_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/anafast_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/calc_powspec.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/calc_powspec_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/healpix_base.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/healpix_data_io.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/healpix_map.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/healpix_map_fitsio.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/healpix_tables.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/hotspots_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/hotspots_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/hpxtest.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/map2tga.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/map2tga_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/median_filter_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/median_filter_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/mult_alm.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/mult_alm_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/powspec.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/powspec_fitsio.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/rotalm_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/smoothing_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/smoothing_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/syn_alm_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/syn_alm_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/udgrade_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/udgrade_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/udgrade_harmonic_cxx.Po@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@Healpix_cxx/$(DEPDIR)/udgrade_harmonic_cxx_module.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@c_utils/$(DEPDIR)/c_utils.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@c_utils/$(DEPDIR)/walltime_c.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/announce.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/error_handling.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/fitshandle.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/geom_utils.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/ls_image.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/paramfile.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/pointing.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/rotmatrix.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/string_utils.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/trafos.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/walltimer.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@cxxsupport/$(DEPDIR)/wigner.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libfftpack/$(DEPDIR)/bluestein.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libfftpack/$(DEPDIR)/fftpack.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libfftpack/$(DEPDIR)/ls_fft.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libsharp/$(DEPDIR)/sharp.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libsharp/$(DEPDIR)/sharp_almhelpers.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libsharp/$(DEPDIR)/sharp_core.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libsharp/$(DEPDIR)/sharp_geomhelpers.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@libsharp/$(DEPDIR)/sharp_ylmgen_c.Plo@am__quote@ .c.o: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c -o $@ $< .c.obj: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .c.lo: @am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCC_TRUE@ $(LTCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Plo @AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(LTCOMPILE) -c -o $@ $< .cc.o: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $< .cc.obj: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .cc.lo: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCXX_TRUE@ $(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $< mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs -rm -rf Healpix_cxx/.libs Healpix_cxx/_libs -rm -rf c_utils/.libs c_utils/_libs -rm -rf cxxsupport/.libs cxxsupport/_libs -rm -rf libfftpack/.libs libfftpack/_libs -rm -rf libsharp/.libs libsharp/_libs distclean-libtool: -rm -f libtool config.lt install-nodist_pkgconfigDATA: $(nodist_pkgconfig_DATA) @$(NORMAL_INSTALL) @list='$(nodist_pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(pkgconfigdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)" || exit 1; \ fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(pkgconfigdir)'"; \ $(INSTALL_DATA) $$files "$(DESTDIR)$(pkgconfigdir)" || exit $$?; \ done uninstall-nodist_pkgconfigDATA: @$(NORMAL_UNINSTALL) @list='$(nodist_pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(pkgconfigdir)'; $(am__uninstall_files_from_dir) install-includeHEADERS: $(include_HEADERS) @$(NORMAL_INSTALL) @list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(includedir)'"; \ $(MKDIR_P) "$(DESTDIR)$(includedir)" || exit 1; \ fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(includedir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(includedir)" || exit $$?; \ done uninstall-includeHEADERS: @$(NORMAL_UNINSTALL) @list='$(include_HEADERS)'; test -n "$(includedir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(includedir)'; $(am__uninstall_files_from_dir) ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-am TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) set x; \ here=`pwd`; \ $(am__define_uniq_tagged_files); \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: ctags-am CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" cscope: cscope.files test ! -s cscope.files \ || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS) clean-cscope: -rm -f cscope.files cscope.files: clean-cscope cscopelist cscopelist: cscopelist-am cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags -rm -f cscope.out cscope.in.out cscope.po.out cscope.files # Recover from deleted '.trs' file; this should ensure that # "rm -f foo.log; make foo.trs" re-run 'foo.test', and re-create # both 'foo.log' and 'foo.trs'. Break the recipe in two subshells # to avoid problems with "make -n". .log.trs: rm -f $< $@ $(MAKE) $(AM_MAKEFLAGS) $< # Leading 'am--fnord' is there to ensure the list of targets does not # expand to empty, as could happen e.g. with make check TESTS=''. am--fnord $(TEST_LOGS) $(TEST_LOGS:.log=.trs): $(am__force_recheck) am--force-recheck: @: $(TEST_SUITE_LOG): $(TEST_LOGS) @$(am__set_TESTS_bases); \ am__f_ok () { test -f "$$1" && test -r "$$1"; }; \ redo_bases=`for i in $$bases; do \ am__f_ok $$i.trs && am__f_ok $$i.log || echo $$i; \ done`; \ if test -n "$$redo_bases"; then \ redo_logs=`for i in $$redo_bases; do echo $$i.log; done`; \ redo_results=`for i in $$redo_bases; do echo $$i.trs; done`; \ if $(am__make_dryrun); then :; else \ rm -f $$redo_logs && rm -f $$redo_results || exit 1; \ fi; \ fi; \ if test -n "$$am__remaking_logs"; then \ echo "fatal: making $(TEST_SUITE_LOG): possible infinite" \ "recursion detected" >&2; \ else \ am__remaking_logs=yes $(MAKE) $(AM_MAKEFLAGS) $$redo_logs; \ fi; \ if $(am__make_dryrun); then :; else \ st=0; \ errmsg="fatal: making $(TEST_SUITE_LOG): failed to create"; \ for i in $$redo_bases; do \ test -f $$i.trs && test -r $$i.trs \ || { echo "$$errmsg $$i.trs" >&2; st=1; }; \ test -f $$i.log && test -r $$i.log \ || { echo "$$errmsg $$i.log" >&2; st=1; }; \ done; \ test $$st -eq 0 || exit 1; \ fi @$(am__sh_e_setup); $(am__tty_colors); $(am__set_TESTS_bases); \ ws='[ ]'; \ results=`for b in $$bases; do echo $$b.trs; done`; \ test -n "$$results" || results=/dev/null; \ all=` grep "^$$ws*:test-result:" $$results | wc -l`; \ pass=` grep "^$$ws*:test-result:$$ws*PASS" $$results | wc -l`; \ fail=` grep "^$$ws*:test-result:$$ws*FAIL" $$results | wc -l`; \ skip=` grep "^$$ws*:test-result:$$ws*SKIP" $$results | wc -l`; \ xfail=`grep "^$$ws*:test-result:$$ws*XFAIL" $$results | wc -l`; \ xpass=`grep "^$$ws*:test-result:$$ws*XPASS" $$results | wc -l`; \ error=`grep "^$$ws*:test-result:$$ws*ERROR" $$results | wc -l`; \ if test `expr $$fail + $$xpass + $$error` -eq 0; then \ success=true; \ else \ success=false; \ fi; \ br='==================='; br=$$br$$br$$br$$br; \ result_count () \ { \ if test x"$$1" = x"--maybe-color"; then \ maybe_colorize=yes; \ elif test x"$$1" = x"--no-color"; then \ maybe_colorize=no; \ else \ echo "$@: invalid 'result_count' usage" >&2; exit 4; \ fi; \ shift; \ desc=$$1 count=$$2; \ if test $$maybe_colorize = yes && test $$count -gt 0; then \ color_start=$$3 color_end=$$std; \ else \ color_start= color_end=; \ fi; \ echo "$${color_start}# $$desc $$count$${color_end}"; \ }; \ create_testsuite_report () \ { \ result_count $$1 "TOTAL:" $$all "$$brg"; \ result_count $$1 "PASS: " $$pass "$$grn"; \ result_count $$1 "SKIP: " $$skip "$$blu"; \ result_count $$1 "XFAIL:" $$xfail "$$lgn"; \ result_count $$1 "FAIL: " $$fail "$$red"; \ result_count $$1 "XPASS:" $$xpass "$$red"; \ result_count $$1 "ERROR:" $$error "$$mgn"; \ }; \ { \ echo "$(PACKAGE_STRING): $(subdir)/$(TEST_SUITE_LOG)" | \ $(am__rst_title); \ create_testsuite_report --no-color; \ echo; \ echo ".. contents:: :depth: 2"; \ echo; \ for b in $$bases; do echo $$b; done \ | $(am__create_global_log); \ } >$(TEST_SUITE_LOG).tmp || exit 1; \ mv $(TEST_SUITE_LOG).tmp $(TEST_SUITE_LOG); \ if $$success; then \ col="$$grn"; \ else \ col="$$red"; \ test x"$$VERBOSE" = x || cat $(TEST_SUITE_LOG); \ fi; \ echo "$${col}$$br$${std}"; \ echo "$${col}Testsuite summary for $(PACKAGE_STRING)$${std}"; \ echo "$${col}$$br$${std}"; \ create_testsuite_report --maybe-color; \ echo "$$col$$br$$std"; \ if $$success; then :; else \ echo "$${col}See $(subdir)/$(TEST_SUITE_LOG)$${std}"; \ if test -n "$(PACKAGE_BUGREPORT)"; then \ echo "$${col}Please report to $(PACKAGE_BUGREPORT)$${std}"; \ fi; \ echo "$$col$$br$$std"; \ fi; \ $$success || exit 1 check-TESTS: @list='$(RECHECK_LOGS)'; test -z "$$list" || rm -f $$list @list='$(RECHECK_LOGS:.log=.trs)'; test -z "$$list" || rm -f $$list @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ log_list=`for i in $$bases; do echo $$i.log; done`; \ trs_list=`for i in $$bases; do echo $$i.trs; done`; \ log_list=`echo $$log_list`; trs_list=`echo $$trs_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) TEST_LOGS="$$log_list"; \ exit $$?; recheck: all @test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) @set +e; $(am__set_TESTS_bases); \ bases=`for i in $$bases; do echo $$i; done \ | $(am__list_recheck_tests)` || exit 1; \ log_list=`for i in $$bases; do echo $$i.log; done`; \ log_list=`echo $$log_list`; \ $(MAKE) $(AM_MAKEFLAGS) $(TEST_SUITE_LOG) \ am__force_recheck=am--force-recheck \ TEST_LOGS="$$log_list"; \ exit $$? hpxtest.log: hpxtest$(EXEEXT) @p='hpxtest$(EXEEXT)'; \ b='hpxtest'; \ $(am__check_pre) $(LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_LOG_DRIVER_FLAGS) $(LOG_DRIVER_FLAGS) -- $(LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) .test.log: @p='$<'; \ $(am__set_b); \ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ --log-file $$b.log --trs-file $$b.trs \ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ "$$tst" $(AM_TESTS_FD_REDIRECT) @am__EXEEXT_TRUE@.test$(EXEEXT).log: @am__EXEEXT_TRUE@ @p='$<'; \ @am__EXEEXT_TRUE@ $(am__set_b); \ @am__EXEEXT_TRUE@ $(am__check_pre) $(TEST_LOG_DRIVER) --test-name "$$f" \ @am__EXEEXT_TRUE@ --log-file $$b.log --trs-file $$b.trs \ @am__EXEEXT_TRUE@ $(am__common_driver_flags) $(AM_TEST_LOG_DRIVER_FLAGS) $(TEST_LOG_DRIVER_FLAGS) -- $(TEST_LOG_COMPILE) \ @am__EXEEXT_TRUE@ "$$tst" $(AM_TESTS_FD_REDIRECT) distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__post_remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__post_remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__post_remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__post_remove_distdir) dist-tarZ: distdir @echo WARNING: "Support for shar distribution archives is" \ "deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__post_remove_distdir) dist-shar: distdir @echo WARNING: "Support for distribution archives compressed with" \ "legacy program 'compress' is deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__post_remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__post_remove_distdir) dist dist-all: $(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:' $(am__post_remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lz*) \ lzip -dc $(distdir).tar.lz | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir) chmod u+w $(distdir) mkdir $(distdir)/_build $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ --srcdir=.. --prefix="$$dc_install_base" \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__post_remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @test -n '$(distuninstallcheck_dir)' || { \ echo 'ERROR: trying to run $@ with an empty' \ '$$(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ $(am__cd) '$(distuninstallcheck_dir)' || { \ echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am $(MAKE) $(AM_MAKEFLAGS) check-TESTS check: check-am all-am: Makefile $(LTLIBRARIES) $(PROGRAMS) $(DATA) $(HEADERS) install-binPROGRAMS: install-libLTLIBRARIES installdirs: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(bindir)" "$(DESTDIR)$(pkgconfigdir)" "$(DESTDIR)$(includedir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: -test -z "$(TEST_LOGS)" || rm -f $(TEST_LOGS) -test -z "$(TEST_LOGS:.log=.trs)" || rm -f $(TEST_LOGS:.log=.trs) -test -z "$(TEST_SUITE_LOG)" || rm -f $(TEST_SUITE_LOG) clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) -rm -f Healpix_cxx/$(DEPDIR)/$(am__dirstamp) -rm -f Healpix_cxx/$(am__dirstamp) -rm -f c_utils/$(DEPDIR)/$(am__dirstamp) -rm -f c_utils/$(am__dirstamp) -rm -f cxxsupport/$(DEPDIR)/$(am__dirstamp) -rm -f cxxsupport/$(am__dirstamp) -rm -f libfftpack/$(DEPDIR)/$(am__dirstamp) -rm -f libfftpack/$(am__dirstamp) -rm -f libsharp/$(DEPDIR)/$(am__dirstamp) -rm -f libsharp/$(am__dirstamp) -test -z "$(DISTCLEANFILES)" || rm -f $(DISTCLEANFILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-binPROGRAMS clean-generic clean-libLTLIBRARIES \ clean-libtool mostlyclean-am distclean: distclean-am -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf Healpix_cxx/$(DEPDIR) c_utils/$(DEPDIR) cxxsupport/$(DEPDIR) libfftpack/$(DEPDIR) libsharp/$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-libtool distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-includeHEADERS install-nodist_pkgconfigDATA install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-binPROGRAMS install-libLTLIBRARIES install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -rf Healpix_cxx/$(DEPDIR) c_utils/$(DEPDIR) cxxsupport/$(DEPDIR) libfftpack/$(DEPDIR) libsharp/$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-binPROGRAMS uninstall-includeHEADERS \ uninstall-libLTLIBRARIES uninstall-nodist_pkgconfigDATA .MAKE: check-am install-am install-strip .PHONY: CTAGS GTAGS TAGS all all-am am--refresh check check-TESTS \ check-am clean clean-binPROGRAMS clean-cscope clean-generic \ clean-libLTLIBRARIES clean-libtool cscope cscopelist-am ctags \ ctags-am dist dist-all dist-bzip2 dist-gzip dist-lzip \ dist-shar dist-tarZ dist-xz dist-zip distcheck distclean \ distclean-compile distclean-generic distclean-libtool \ distclean-tags distcleancheck distdir distuninstallcheck dvi \ dvi-am html html-am info info-am install install-am \ install-binPROGRAMS install-data install-data-am install-dvi \ install-dvi-am install-exec install-exec-am install-html \ install-html-am install-includeHEADERS install-info \ install-info-am install-libLTLIBRARIES install-man \ install-nodist_pkgconfigDATA install-pdf install-pdf-am \ install-ps install-ps-am install-strip installcheck \ installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ recheck tags tags-am uninstall uninstall-am \ uninstall-binPROGRAMS uninstall-includeHEADERS \ uninstall-libLTLIBRARIES uninstall-nodist_pkgconfigDATA # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/test-driver0000755000175000017500000001027712346122572024456 0ustar zoncazonca00000000000000#! /bin/sh # test-driver - basic testsuite driver script. scriptversion=2013-07-13.22; # UTC # Copyright (C) 2011-2013 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 2, 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 file is maintained in Automake, please report # bugs to or send patches to # . # Make unconditional expansion of undefined variables an error. This # helps a lot in preventing typo-related bugs. set -u usage_error () { echo "$0: $*" >&2 print_usage >&2 exit 2 } print_usage () { cat <$log_file 2>&1 estatus=$? if test $enable_hard_errors = no && test $estatus -eq 99; then estatus=1 fi case $estatus:$expect_failure in 0:yes) col=$red res=XPASS recheck=yes gcopy=yes;; 0:*) col=$grn res=PASS recheck=no gcopy=no;; 77:*) col=$blu res=SKIP recheck=no gcopy=yes;; 99:*) col=$mgn res=ERROR recheck=yes gcopy=yes;; *:yes) col=$lgn res=XFAIL recheck=no gcopy=yes;; *:*) col=$red res=FAIL recheck=yes gcopy=yes;; esac # Report outcome to console. echo "${col}${res}${std}: $test_name" # Register the test result, and other relevant metadata. echo ":test-result: $res" > $trs_file echo ":global-test-result: $res" >> $trs_file echo ":recheck: $recheck" >> $trs_file echo ":copy-in-global-log: $gcopy" >> $trs_file # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/aclocal.m40000644000175000017500000015050312346122570024113 0ustar zoncazonca00000000000000# generated automatically by aclocal 1.14.1 -*- Autoconf -*- # Copyright (C) 1996-2013 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])]) m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],, [m4_warning([this file was generated for autoconf 2.69. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically 'autoreconf'.])]) # pkg.m4 - Macros to locate and utilise pkg-config. -*- Autoconf -*- # serial 1 (pkg-config-0.24) # # Copyright © 2004 Scott James Remnant . # # 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 2 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, write to the Free Software # Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. # # 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. # PKG_PROG_PKG_CONFIG([MIN-VERSION]) # ---------------------------------- AC_DEFUN([PKG_PROG_PKG_CONFIG], [m4_pattern_forbid([^_?PKG_[A-Z_]+$]) m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$]) m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$]) AC_ARG_VAR([PKG_CONFIG], [path to pkg-config utility]) AC_ARG_VAR([PKG_CONFIG_PATH], [directories to add to pkg-config's search path]) AC_ARG_VAR([PKG_CONFIG_LIBDIR], [path overriding pkg-config's built-in search path]) if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then AC_PATH_TOOL([PKG_CONFIG], [pkg-config]) fi if test -n "$PKG_CONFIG"; then _pkg_min_version=m4_default([$1], [0.9.0]) AC_MSG_CHECKING([pkg-config is at least version $_pkg_min_version]) if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) PKG_CONFIG="" fi fi[]dnl ])# PKG_PROG_PKG_CONFIG # PKG_CHECK_EXISTS(MODULES, [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND]) # # Check to see whether a particular set of modules exists. Similar # to PKG_CHECK_MODULES(), but does not set variables or print errors. # # Please remember that m4 expands AC_REQUIRE([PKG_PROG_PKG_CONFIG]) # only at the first occurence in configure.ac, so if the first place # it's called might be skipped (such as if it is within an "if", you # have to call PKG_CHECK_EXISTS manually # -------------------------------------------------------------- AC_DEFUN([PKG_CHECK_EXISTS], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl if test -n "$PKG_CONFIG" && \ AC_RUN_LOG([$PKG_CONFIG --exists --print-errors "$1"]); then m4_default([$2], [:]) m4_ifvaln([$3], [else $3])dnl fi]) # _PKG_CONFIG([VARIABLE], [COMMAND], [MODULES]) # --------------------------------------------- m4_define([_PKG_CONFIG], [if test -n "$$1"; then pkg_cv_[]$1="$$1" elif test -n "$PKG_CONFIG"; then PKG_CHECK_EXISTS([$3], [pkg_cv_[]$1=`$PKG_CONFIG --[]$2 "$3" 2>/dev/null` test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes]) else pkg_failed=untried fi[]dnl ])# _PKG_CONFIG # _PKG_SHORT_ERRORS_SUPPORTED # ----------------------------- AC_DEFUN([_PKG_SHORT_ERRORS_SUPPORTED], [AC_REQUIRE([PKG_PROG_PKG_CONFIG]) if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then _pkg_short_errors_supported=yes else _pkg_short_errors_supported=no fi[]dnl ])# _PKG_SHORT_ERRORS_SUPPORTED # PKG_CHECK_MODULES(VARIABLE-PREFIX, MODULES, [ACTION-IF-FOUND], # [ACTION-IF-NOT-FOUND]) # # # Note that if there is a possibility the first call to # PKG_CHECK_MODULES might not happen, you should be sure to include an # explicit call to PKG_PROG_PKG_CONFIG in your configure.ac # # # -------------------------------------------------------------- AC_DEFUN([PKG_CHECK_MODULES], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl AC_ARG_VAR([$1][_CFLAGS], [C compiler flags for $1, overriding pkg-config])dnl AC_ARG_VAR([$1][_LIBS], [linker flags for $1, overriding pkg-config])dnl pkg_failed=no AC_MSG_CHECKING([for $1]) _PKG_CONFIG([$1][_CFLAGS], [cflags], [$2]) _PKG_CONFIG([$1][_LIBS], [libs], [$2]) m4_define([_PKG_TEXT], [Alternatively, you may set the environment variables $1[]_CFLAGS and $1[]_LIBS to avoid the need to call pkg-config. See the pkg-config man page for more details.]) if test $pkg_failed = yes; then AC_MSG_RESULT([no]) _PKG_SHORT_ERRORS_SUPPORTED if test $_pkg_short_errors_supported = yes; then $1[]_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "$2" 2>&1` else $1[]_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "$2" 2>&1` fi # Put the nasty error message in config.log where it belongs echo "$$1[]_PKG_ERRORS" >&AS_MESSAGE_LOG_FD m4_default([$4], [AC_MSG_ERROR( [Package requirements ($2) were not met: $$1_PKG_ERRORS Consider adjusting the PKG_CONFIG_PATH environment variable if you installed software in a non-standard prefix. _PKG_TEXT])[]dnl ]) elif test $pkg_failed = untried; then AC_MSG_RESULT([no]) m4_default([$4], [AC_MSG_FAILURE( [The pkg-config script could not be found or is too old. Make sure it is in your PATH or set the PKG_CONFIG environment variable to the full path to pkg-config. _PKG_TEXT To get pkg-config, see .])[]dnl ]) else $1[]_CFLAGS=$pkg_cv_[]$1[]_CFLAGS $1[]_LIBS=$pkg_cv_[]$1[]_LIBS AC_MSG_RESULT([yes]) $3 fi[]dnl ])# PKG_CHECK_MODULES # PKG_INSTALLDIR(DIRECTORY) # ------------------------- # Substitutes the variable pkgconfigdir as the location where a module # should install pkg-config .pc files. By default the directory is # $libdir/pkgconfig, but the default can be changed by passing # DIRECTORY. The user can override through the --with-pkgconfigdir # parameter. AC_DEFUN([PKG_INSTALLDIR], [m4_pushdef([pkg_default], [m4_default([$1], ['${libdir}/pkgconfig'])]) m4_pushdef([pkg_description], [pkg-config installation directory @<:@]pkg_default[@:>@]) AC_ARG_WITH([pkgconfigdir], [AS_HELP_STRING([--with-pkgconfigdir], pkg_description)],, [with_pkgconfigdir=]pkg_default) AC_SUBST([pkgconfigdir], [$with_pkgconfigdir]) m4_popdef([pkg_default]) m4_popdef([pkg_description]) ]) dnl PKG_INSTALLDIR # PKG_NOARCH_INSTALLDIR(DIRECTORY) # ------------------------- # Substitutes the variable noarch_pkgconfigdir as the location where a # module should install arch-independent pkg-config .pc files. By # default the directory is $datadir/pkgconfig, but the default can be # changed by passing DIRECTORY. The user can override through the # --with-noarch-pkgconfigdir parameter. AC_DEFUN([PKG_NOARCH_INSTALLDIR], [m4_pushdef([pkg_default], [m4_default([$1], ['${datadir}/pkgconfig'])]) m4_pushdef([pkg_description], [pkg-config arch-independent installation directory @<:@]pkg_default[@:>@]) AC_ARG_WITH([noarch-pkgconfigdir], [AS_HELP_STRING([--with-noarch-pkgconfigdir], pkg_description)],, [with_noarch_pkgconfigdir=]pkg_default) AC_SUBST([noarch_pkgconfigdir], [$with_noarch_pkgconfigdir]) m4_popdef([pkg_default]) m4_popdef([pkg_description]) ]) dnl PKG_NOARCH_INSTALLDIR # PKG_CHECK_VAR(VARIABLE, MODULE, CONFIG-VARIABLE, # [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND]) # ------------------------------------------- # Retrieves the value of the pkg-config variable for the given module. AC_DEFUN([PKG_CHECK_VAR], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl AC_ARG_VAR([$1], [value of $3 for $2, overriding pkg-config])dnl _PKG_CONFIG([$1], [variable="][$3]["], [$2]) AS_VAR_COPY([$1], [pkg_cv_][$1]) AS_VAR_IF([$1], [""], [$5], [$4])dnl ])# PKG_CHECK_VAR # Copyright (C) 2002-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.14' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.14.1], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.14.1])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # Copyright (C) 2011-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_AR([ACT-IF-FAIL]) # ------------------------- # Try to determine the archiver interface, and trigger the ar-lib wrapper # if it is needed. If the detection of archiver interface fails, run # ACT-IF-FAIL (default is to abort configure with a proper error message). AC_DEFUN([AM_PROG_AR], [AC_BEFORE([$0], [LT_INIT])dnl AC_BEFORE([$0], [AC_PROG_LIBTOOL])dnl AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([ar-lib])dnl AC_CHECK_TOOLS([AR], [ar lib "link -lib"], [false]) : ${AR=ar} AC_CACHE_CHECK([the archiver ($AR) interface], [am_cv_ar_interface], [AC_LANG_PUSH([C]) am_cv_ar_interface=ar AC_COMPILE_IFELSE([AC_LANG_SOURCE([[int some_variable = 0;]])], [am_ar_try='$AR cru libconftest.a conftest.$ac_objext >&AS_MESSAGE_LOG_FD' AC_TRY_EVAL([am_ar_try]) if test "$ac_status" -eq 0; then am_cv_ar_interface=ar else am_ar_try='$AR -NOLOGO -OUT:conftest.lib conftest.$ac_objext >&AS_MESSAGE_LOG_FD' AC_TRY_EVAL([am_ar_try]) if test "$ac_status" -eq 0; then am_cv_ar_interface=lib else am_cv_ar_interface=unknown fi fi rm -f conftest.lib libconftest.a ]) AC_LANG_POP([C])]) case $am_cv_ar_interface in ar) ;; lib) # Microsoft lib, so override with the ar-lib wrapper script. # FIXME: It is wrong to rewrite AR. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__AR in this case, # and then we could set am__AR="$am_aux_dir/ar-lib \$(AR)" or something # similar. AR="$am_aux_dir/ar-lib $AR" ;; unknown) m4_default([$1], [AC_MSG_ERROR([could not determine $AR interface])]) ;; esac AC_SUBST([AR])dnl ]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to '$srcdir/foo'. In other projects, it is set to # '$srcdir', '$srcdir/..', or '$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is '.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl m4_if([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # There are a few dirty hacks below to avoid letting 'AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "OBJC", "OBJCXX", "UPC", or "GJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl m4_if([$1], [CC], [depcc="$CC" am_compiler_list=], [$1], [CXX], [depcc="$CXX" am_compiler_list=], [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], [OBJCXX], [depcc="$OBJCXX" am_compiler_list='gcc3 gcc'], [$1], [UPC], [depcc="$UPC" am_compiler_list=], [$1], [GCJ], [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES. AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE([dependency-tracking], [dnl AS_HELP_STRING( [--enable-dependency-tracking], [do not reject slow dependency extractors]) AS_HELP_STRING( [--disable-dependency-tracking], [speeds up one-time build])]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl AC_SUBST([am__nodep])dnl _AM_SUBST_NOTMAKE([am__nodep])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Older Autoconf quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named 'Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running 'make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "$am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each '.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O. m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC]) [_AM_PROG_CC_C_O ]) # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.65])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [AC_DIAGNOSE([obsolete], [$0: two- and three-arguments forms are deprecated.]) m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if( m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]), [ok:ok],, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package]) AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}]) AM_MISSING_PROG([AUTOCONF], [autoconf]) AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}]) AM_MISSING_PROG([AUTOHEADER], [autoheader]) AM_MISSING_PROG([MAKEINFO], [makeinfo]) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # AC_SUBST([mkdir_p], ['$(MKDIR_P)']) # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES([CC])], [m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES([CXX])], [m4_define([AC_PROG_CXX], m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES([OBJC])], [m4_define([AC_PROG_OBJC], m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJCXX], [_AM_DEPENDENCIES([OBJCXX])], [m4_define([AC_PROG_OBJCXX], m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl ]) AC_REQUIRE([AM_SILENT_RULES])dnl dnl The testsuite driver may need to know about EXEEXT, so add the dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END AC_MSG_ERROR([Your 'rm' program is bad, sorry.]) fi fi ]) dnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST([install_sh])]) # Copyright (C) 2003-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Add --enable-maintainer-mode option to configure. -*- Autoconf -*- # From Jim Meyering # Copyright (C) 1996-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_MAINTAINER_MODE([DEFAULT-MODE]) # ---------------------------------- # Control maintainer-specific portions of Makefiles. # Default is to disable them, unless 'enable' is passed literally. # For symmetry, 'disable' may be passed as well. Anyway, the user # can override the default with the --enable/--disable switch. AC_DEFUN([AM_MAINTAINER_MODE], [m4_case(m4_default([$1], [disable]), [enable], [m4_define([am_maintainer_other], [disable])], [disable], [m4_define([am_maintainer_other], [enable])], [m4_define([am_maintainer_other], [enable]) m4_warn([syntax], [unexpected argument to AM@&t@_MAINTAINER_MODE: $1])]) AC_MSG_CHECKING([whether to enable maintainer-specific portions of Makefiles]) dnl maintainer-mode's default is 'disable' unless 'enable' is passed AC_ARG_ENABLE([maintainer-mode], [AS_HELP_STRING([--]am_maintainer_other[-maintainer-mode], am_maintainer_other[ make rules and dependencies not useful (and sometimes confusing) to the casual installer])], [USE_MAINTAINER_MODE=$enableval], [USE_MAINTAINER_MODE=]m4_if(am_maintainer_other, [enable], [no], [yes])) AC_MSG_RESULT([$USE_MAINTAINER_MODE]) AM_CONDITIONAL([MAINTAINER_MODE], [test $USE_MAINTAINER_MODE = yes]) MAINT=$MAINTAINER_MODE_TRUE AC_SUBST([MAINT])dnl ] ) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from 'make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it is modern enough. # If it is, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --is-lightweight"; then am_missing_run="$MISSING " else am_missing_run= AC_MSG_WARN(['missing' script is too old or missing]) fi ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # -------------------- # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), [1])]) # _AM_SET_OPTIONS(OPTIONS) # ------------------------ # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Copyright (C) 1999-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_PROG_CC_C_O # --------------- # Like AC_PROG_CC_C_O, but changed for automake. We rewrite AC_PROG_CC # to automatically call this. AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([compile])dnl AC_LANG_PUSH([C])dnl AC_CACHE_CHECK( [whether $CC understands -c and -o together], [am_cv_prog_cc_c_o], [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])]) # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i]) if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi AC_LANG_POP([C])]) # For backward compatibility. AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])]) # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_RUN_LOG(COMMAND) # ------------------- # Run COMMAND, save the exit status in ac_status, and log it. # (This has been adapted from Autoconf's _AC_RUN_LOG macro.) AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD (exit $ac_status); }]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);; esac # Do 'set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi if test "$[2]" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT([yes]) # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi AC_CONFIG_COMMANDS_PRE( [AC_MSG_CHECKING([that generated files are newer than configure]) if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi AC_MSG_RESULT([done])]) rm -f conftest.file ]) # Copyright (C) 2009-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_SILENT_RULES([DEFAULT]) # -------------------------- # Enable less verbose build rules; with the default set to DEFAULT # ("yes" being less verbose, "no" or empty being verbose). AC_DEFUN([AM_SILENT_RULES], [AC_ARG_ENABLE([silent-rules], [dnl AS_HELP_STRING( [--enable-silent-rules], [less verbose build output (undo: "make V=1")]) AS_HELP_STRING( [--disable-silent-rules], [verbose build output (undo: "make V=0")])dnl ]) case $enable_silent_rules in @%:@ ((( yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);; esac dnl dnl A few 'make' implementations (e.g., NonStop OS and NextStep) dnl do not support nested variable expansions. dnl See automake bug#9928 and bug#10237. am_make=${MAKE-make} AC_CACHE_CHECK([whether $am_make supports nested variables], [am_cv_make_support_nested_variables], [if AS_ECHO([['TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi]) if test $am_cv_make_support_nested_variables = yes; then dnl Using '$V' instead of '$(V)' breaks IRIX make. AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AC_SUBST([AM_V])dnl AM_SUBST_NOTMAKE([AM_V])dnl AC_SUBST([AM_DEFAULT_V])dnl AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl AC_SUBST([AM_DEFAULT_VERBOSITY])dnl AM_BACKSLASH='\' AC_SUBST([AM_BACKSLASH])dnl _AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl ]) # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor 'install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in "make install-strip", and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using 'strip' when the user # run "make install-strip". However 'strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the 'STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be 'maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # -------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of 'v7', 'ustar', or 'pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar # AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AC_SUBST([AMTAR], ['$${TAR-tar}']) # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar], [# The POSIX 1988 'ustar' format is defined with fixed-size fields. # There is notably a 21 bits limit for the UID and the GID. In fact, # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343 # and bug#13588). am_max_uid=2097151 # 2^21 - 1 am_max_gid=$am_max_uid # The $UID and $GID variables are not portable, so we need to resort # to the POSIX-mandated id(1) utility. Errors in the 'id' calls # below are definitely unexpected, so allow the users to see them # (that is, avoid stderr redirection). am_uid=`id -u || echo unknown` am_gid=`id -g || echo unknown` AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format]) if test $am_uid -le $am_max_uid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format]) if test $am_gid -le $am_max_gid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi], [pax], [], [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Go ahead even if we have the value already cached. We do so because we # need to set the values for the 'am__tar' and 'am__untar' variables. _am_tools=${am_cv_prog_tar_$1-$_am_tools} for _am_tool in $_am_tools; do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works. rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR m4_include([m4/libtool.m4]) m4_include([m4/ltoptions.m4]) m4_include([m4/ltsugar.m4]) m4_include([m4/ltversion.m4]) m4_include([m4/lt~obsolete.m4]) m4_include([m4/m4_ax_create_pkgconfig_info.m4]) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/0000755000175000017500000000000012351601662024053 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp.h0000650000175000017530000000240312255154051025474 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp.h * Interface for the spherical transform library. * * Copyright (C) 2006-2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SHARP_H #define PLANCK_SHARP_H #ifdef __cplusplus #error This header file cannot be included from C++, only from C #endif #include #include "sharp_lowlevel.h" #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_ylmgen_c.c0000650000175000017530000001521212255154051027346 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Helper code for efficient calculation of Y_lm(theta,phi=0) * * Copyright (C) 2005-2012 Max-Planck-Society * Author: Martin Reinecke */ #include #include #include "sharp_ylmgen_c.h" #include "c_utils.h" static inline void normalize (double *val, int *scale, double xfmax) { while (fabs(*val)>xfmax) { *val*=sharp_fsmall; ++*scale; } if (*val!=0.) while (fabs(*val)lmax = l_max; gen->mmax = m_max; UTIL_ASSERT(spin>=0,"incorrect spin: must be nonnegative"); UTIL_ASSERT(m_max>=spin,"incorrect m_max: must be >= spin"); UTIL_ASSERT(l_max>=m_max,"incorrect l_max: must be >= m_max"); gen->s = spin; UTIL_ASSERT((sharp_minscale<=0)&&(sharp_maxscale>0), "bad value for min/maxscale"); gen->cf=RALLOC(double,sharp_maxscale-sharp_minscale+1); gen->cf[-sharp_minscale]=1.; for (int m=-sharp_minscale-1; m>=0; --m) gen->cf[m]=gen->cf[m+1]*sharp_fsmall; for (int m=-sharp_minscale+1; m<(sharp_maxscale-sharp_minscale+1); ++m) gen->cf[m]=gen->cf[m-1]*sharp_fbig; gen->m = -1; if (spin==0) { gen->rf = RALLOC(sharp_ylmgen_dbl2,gen->lmax+1); gen->mfac = RALLOC(double,gen->mmax+1); gen->mfac[0] = inv_sqrt4pi; for (int m=1; m<=gen->mmax; ++m) gen->mfac[m] = gen->mfac[m-1]*sqrt((2*m+1.)/(2*m)); gen->root = RALLOC(double,2*gen->lmax+5); gen->iroot = RALLOC(double,2*gen->lmax+5); for (int m=0; m<2*gen->lmax+5; ++m) { gen->root[m] = sqrt(m); gen->iroot[m] = (m==0) ? 0. : 1./gen->root[m]; } } else { gen->m=gen->mlo=gen->mhi=-1234567890; ALLOC(gen->fx,sharp_ylmgen_dbl3,gen->lmax+2); for (int m=0; mlmax+2; ++m) gen->fx[m].f[0]=gen->fx[m].f[1]=gen->fx[m].f[2]=0.; ALLOC(gen->inv,double,gen->lmax+1); gen->inv[0]=0; for (int m=1; mlmax+1; ++m) gen->inv[m]=1./m; ALLOC(gen->flm1,double,2*gen->lmax+1); ALLOC(gen->flm2,double,2*gen->lmax+1); for (int m=0; m<2*gen->lmax+1; ++m) { gen->flm1[m] = sqrt(1./(m+1.)); gen->flm2[m] = sqrt(m/(m+1.)); } ALLOC(gen->prefac,double,gen->mmax+1); ALLOC(gen->fscale,int,gen->mmax+1); double *fac = RALLOC(double,2*gen->lmax+1); int *facscale = RALLOC(int,2*gen->lmax+1); fac[0]=1; facscale[0]=0; for (int m=1; m<2*gen->lmax+1; ++m) { fac[m]=fac[m-1]*sqrt(m); facscale[m]=facscale[m-1]; normalize(&fac[m],&facscale[m],sharp_fbighalf); } for (int m=0; m<=gen->mmax; ++m) { int mlo=gen->s, mhi=m; if (mhiprefac[m]=tfac; gen->fscale[m]=tscale; } DEALLOC(fac); DEALLOC(facscale); } } void sharp_Ylmgen_destroy (sharp_Ylmgen_C *gen) { DEALLOC(gen->cf); if (gen->s==0) { DEALLOC(gen->rf); DEALLOC(gen->mfac); DEALLOC(gen->root); DEALLOC(gen->iroot); } else { DEALLOC(gen->fx); DEALLOC(gen->prefac); DEALLOC(gen->fscale); DEALLOC(gen->flm1); DEALLOC(gen->flm2); DEALLOC(gen->inv); } } void sharp_Ylmgen_prepare (sharp_Ylmgen_C *gen, int m) { if (m==gen->m) return; UTIL_ASSERT(m>=0,"incorrect m"); gen->m = m; if (gen->s==0) { gen->rf[m].f[0] = gen->root[2*m+3]; gen->rf[m].f[1] = 0.; for (int l=m+1; l<=gen->lmax; ++l) { double tmp=gen->root[2*l+3]*gen->iroot[l+1+m]*gen->iroot[l+1-m]; gen->rf[l].f[0] = tmp*gen->root[2*l+1]; gen->rf[l].f[1] = tmp*gen->root[l+m]*gen->root[l-m]*gen->iroot[2*l-1]; } } else { int mlo_=m, mhi_=gen->s; if (mhi_mhi==mhi_) && (gen->mlo==mlo_)); gen->mlo = mlo_; gen->mhi = mhi_; if (!ms_similar) { for (int l=gen->mhi; llmax; ++l) { double t = gen->flm1[l+gen->m]*gen->flm1[l-gen->m] *gen->flm1[l+gen->s]*gen->flm1[l-gen->s]; double lt = 2*l+1; double l1 = l+1; gen->fx[l+1].f[0]=l1*lt*t; gen->fx[l+1].f[1]=gen->m*gen->s*gen->inv[l]*gen->inv[l+1]; t = gen->flm2[l+gen->m]*gen->flm2[l-gen->m] *gen->flm2[l+gen->s]*gen->flm2[l-gen->s]; gen->fx[l+1].f[2]=t*l1*gen->inv[l]; } } gen->preMinus_p = gen->preMinus_m = 0; if (gen->mhi==gen->m) { gen->cosPow = gen->mhi+gen->s; gen->sinPow = gen->mhi-gen->s; gen->preMinus_p = gen->preMinus_m = ((gen->mhi-gen->s)&1); } else { gen->cosPow = gen->mhi+gen->m; gen->sinPow = gen->mhi-gen->m; gen->preMinus_m = ((gen->mhi+gen->m)&1); } } } double *sharp_Ylmgen_get_norm (int lmax, int spin) { const double pi = 3.141592653589793238462643383279502884197; double *res=RALLOC(double,lmax+1); /* sign convention for H=1 (LensPix paper) */ #if 1 double spinsign = (spin>0) ? -1.0 : 1.0; #else double spinsign = 1.0; #endif if (spin==0) { for (int l=0; l<=lmax; ++l) res[l]=1.; return res; } spinsign = (spin&1) ? -spinsign : spinsign; for (int l=0; l<=lmax; ++l) res[l] = (l
  • \ref introduction "Introduction"
  • Programming interface */ /*! \page introduction Introduction to libsharp "SHARP" is an acronym for Spherical HARmonic Package. All user-visible data types and functions in this library start with the prefix "sharp_" to avoid pollution of the global C namespace. libsharp's main functionality is the conversion between maps on the sphere and spherical harmonic coefficients (or a_lm). A map is defined as a set of rings, which in turn consist of individual pixels that
    • all have the same colatitude and
    • are uniformly spaced in azimuthal direction.
    Consequently, a ring is completely defined by
    • its colatitute (in radians)
    • the number of pixels it contains
    • the azimuth (in radians) of the first pixel in the ring
    • the weight that must be multiplied to every pixel during a map analysis (typically the solid angle of a pixel in the ring)
    • the offset of the first ring pixel in the map array
    • the stride between consecutive pixels in the ring.
    The map array is a one-dimensional array of type float or double, which contains the values of all map pixels. It is assumed that the pixels of every ring are stored inside this array in order of increasing azimuth and with the specified stride. Note however that the rings themselves can be stored in any order inside the array. The a_lm array is a one-dimensional array of type complex float or complex double, which contains all spherical harmonic coefficients for a full or partial set of m quantum numbers with 0<=m<=mmax and m<=l<=lmax. There is only one constraint on the internal structure of the array, which is: Index[a_l+1,m] = Index[a_l,m] + stride That means that coefficients with identical m but different l can be interpreted as a one-dimensional array in l with a unique stride. Several functions are provided for efficient index computation in this array; they are documented \ref almgroup "here". Information about a pixelisation of the sphere is stored in objects of type sharp_geom_info. It is possible to create such an object for any supported pixelisation by using the function sharp_make_geometry_info(); however, several easier-to-use functions are \ref geominfogroup "supplied" for generating often-used pixelisations like ECP grids, Gaussian grids, and Healpix grids. Currently, libsharp supports the following kinds of transforms:
    • scalar a_lm to map
    • scalar map to a_lm
    • spin a_lm to map
    • spin map to a_lm
    • scalar a_lm to maps of first derivatives
    libsharp supports shared-memory parallelisation via OpenMP; this feature will be automatically enabled if the compiler supports it. Libsharp will also make use of SSE2 and AVX instructions when compiled for a platform known to support them. Support for MPI-parallel transforms is also available; in this mode, every MPI task must provide a unique subset of the map and a_lm coefficients. The spherical harmonic transforms can be executed on double-precision and single-precision maps and a_lm, but for accuracy reasons the computations will always be performed in double precision. As a consequence, single-precision transforms will most likely not be faster than their double-precision counterparts, but they will require significantly less memory. */ healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_almhelpers.c0000650000175000017530000000403612255154051027707 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_almhelpers.c * Spherical transform library * * Copyright (C) 2008-2013 Max-Planck-Society * \author Martin Reinecke */ #include "sharp_almhelpers.h" #include "c_utils.h" void sharp_make_triangular_alm_info (int lmax, int mmax, int stride, sharp_alm_info **alm_info) { sharp_alm_info *info = RALLOC(sharp_alm_info,1); info->lmax = lmax; info->nm = mmax+1; info->mval = RALLOC(int,mmax+1); info->mvstart = RALLOC(ptrdiff_t,mmax+1); info->stride = stride; info->flags = 0; ptrdiff_t tval = 2*lmax+1; for (ptrdiff_t m=0; m<=mmax; ++m) { info->mval[m] = m; info->mvstart[m] = stride*((m*(tval-m))>>1); } *alm_info = info; } void sharp_make_rectangular_alm_info (int lmax, int mmax, int stride, sharp_alm_info **alm_info) { sharp_alm_info *info = RALLOC(sharp_alm_info,1); info->lmax = lmax; info->nm = mmax+1; info->mval = RALLOC(int,mmax+1); info->mvstart = RALLOC(ptrdiff_t,mmax+1); info->stride = stride; info->flags = 0; for (ptrdiff_t m=0; m<=mmax; ++m) { info->mval[m] = m; info->mvstart[m] = stride*m*(lmax+1); } *alm_info = info; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_vecutil.h0000650000175000017530000000236612255154051027237 0ustar zoncaplanck00000000000000/* * This file is part of libc_utils. * * libc_utils 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 2 of the License, or * (at your option) any later version. * * libc_utils 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 libc_utils; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_vecutil.h * Functionality related to vector instruction support * * Copyright (C) 2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef SHARP_VECUTIL_H #define SHARP_VECUTIL_H #if (defined (__AVX__)) #define VLEN 4 #elif (defined (__SSE2__)) #define VLEN 2 #else #define VLEN 1 #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_geomhelpers.c0000650000175000017530000002430512255154051030066 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_geomhelpers.c * Spherical transform library * * Copyright (C) 2006-2012 Max-Planck-Society
    * Copyright (C) 2007-2008 Pavel Holoborodko (for gauss_legendre_tbl) * \author Martin Reinecke \author Pavel Holoborodko */ #include #include "sharp_geomhelpers.h" #include "c_utils.h" #include "ls_fft.h" void sharp_make_weighted_healpix_geom_info (int nside, int stride, const double *weight, sharp_geom_info **geom_info) { const double pi=3.141592653589793238462643383279502884197; ptrdiff_t npix=(ptrdiff_t)nside*nside*12; ptrdiff_t ncap=2*(ptrdiff_t)nside*(nside-1); int nrings=4*nside-1; double *theta=RALLOC(double,nrings); double *weight_=RALLOC(double,nrings); int *nph=RALLOC(int,nrings); double *phi0=RALLOC(double,nrings); ptrdiff_t *ofs=RALLOC(ptrdiff_t,nrings); int *stride_=RALLOC(int,nrings); for (int m=0; m2*nside) ? 4*nside-ring : ring; stride_[m] = stride; if (northring < nside) { theta[m] = 2*asin(northring/(sqrt(6.)*nside)); nph[m] = 4*northring; phi0[m] = pi/nph[m]; ofs[m] = 2*northring*(northring-1)*stride; } else { double fact1 = (8.*nside)/npix; double costheta = (2*nside-northring)*fact1; theta[m] = acos(costheta); nph[m] = 4*nside; if ((northring-nside) & 1) phi0[m] = 0; else phi0[m] = pi/nph[m]; ofs[m] = (ncap + (northring-nside)*nph[m])*stride; } if (northring != ring) /* southern hemisphere */ { theta[m] = pi-theta[m]; ofs[m] = (npix - nph[m])*stride - ofs[m]; } weight_[m]=4.*pi/npix*((weight==NULL) ? 1. : weight[northring-1]); } sharp_make_geom_info (nrings, nph, ofs, stride_, phi0, theta, weight_, geom_info); DEALLOC(theta); DEALLOC(weight_); DEALLOC(nph); DEALLOC(phi0); DEALLOC(ofs); DEALLOC(stride_); } static inline double one_minus_x2 (double x) { return (fabs(x)>0.1) ? (1.+x)*(1.-x) : 1.-x*x; } /* Function adapted from GNU GSL file glfixed.c Original author: Pavel Holoborodko (http://www.holoborodko.com) Adjustments by M. Reinecke - adjusted interface (keep epsilon internal, return full number of points) - removed precomputed tables - tweaked Newton iteration to obtain higher accuracy */ static void gauss_legendre_tbl(int n, double *x, double *w) { const double pi = 3.141592653589793238462643383279502884197; const double eps = 3e-14; int m = (n+1)>>1; double t0 = 1 - (1-1./n) / (8.*n*n); double t1 = 1./(4.*n+2.); #pragma omp parallel { int i; #pragma omp for schedule(dynamic,100) for (i=1; i<=m; ++i) { double x0 = cos(pi * ((i<<2)-1) * t1) * t0; int dobreak=0; int j=0; double dpdx; while(1) { double P_1 = 1.0; double P0 = x0; double dx, x1; for (int k=2; k<=n; k++) { double P_2 = P_1; P_1 = P0; // P0 = ((2*k-1)*x0*P_1-(k-1)*P_2)/k; P0 = x0*P_1 + (k-1.)/k * (x0*P_1-P_2); } dpdx = (P_1 - x0*P0) * n / one_minus_x2(x0); /* Newton step */ x1 = x0 - P0/dpdx; dx = x0-x1; x0 = x1; if (dobreak) break; if (fabs(dx)<=eps) dobreak=1; UTIL_ASSERT(++j<100,"convergence problem"); } x[i-1] = -x0; x[n-i] = x0; w[i-1] = w[n-i] = 2. / (one_minus_x2(x0) * dpdx * dpdx); } } // end of parallel region } void sharp_make_gauss_geom_info (int nrings, int nphi, double phi0, int stride_lon, int stride_lat, sharp_geom_info **geom_info) { const double pi=3.141592653589793238462643383279502884197; double *theta=RALLOC(double,nrings); double *weight=RALLOC(double,nrings); int *nph=RALLOC(int,nrings); double *phi0_=RALLOC(double,nrings); ptrdiff_t *ofs=RALLOC(ptrdiff_t,nrings); int *stride_=RALLOC(int,nrings); gauss_legendre_tbl(nrings,theta,weight); for (int m=0; mpi-1e-15) theta[m]=pi-1e-15; nph[m]=ppring; phi0_[m]=phi0; ofs[m]=(ptrdiff_t)m*stride_lat; stride_[m]=stride_lon; } sharp_make_geom_info (nrings, nph, ofs, stride_, phi0_, theta, NULL, geom_info); DEALLOC(theta); DEALLOC(nph); DEALLOC(phi0_); DEALLOC(ofs); DEALLOC(stride_); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp.c0000650000175000017530000005732012255154051025477 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp.c * Spherical transform library * * Copyright (C) 2006-2013 Max-Planck-Society * \author Martin Reinecke \author Dag Sverre Seljebotn */ #include #include "ls_fft.h" #include "sharp_ylmgen_c.h" #include "sharp_internal.h" #include "c_utils.h" #include "sharp_core.h" #include "sharp_vecutil.h" #include "walltime_c.h" #include "sharp_almhelpers.h" #include "sharp_geomhelpers.h" typedef complex double dcmplx; typedef complex float fcmplx; static const double sqrt_one_half = 0.707106781186547572737310929369; static const double sqrt_two = 1.414213562373095145474621858739; static int chunksize_min=500, nchunks_max=10; static void get_chunk_info (int ndata, int nmult, int *nchunks, int *chunksize) { *chunksize = (ndata+nchunks_max-1)/nchunks_max; if (*chunksize>=chunksize_min) // use max number of chunks *chunksize = ((*chunksize+nmult-1)/nmult)*nmult; else // need to adjust chunksize and nchunks { *nchunks = (ndata+chunksize_min-1)/chunksize_min; *chunksize = (ndata+(*nchunks)-1)/(*nchunks); if (*nchunks>1) *chunksize = ((*chunksize+nmult-1)/nmult)*nmult; } *nchunks = (ndata+(*chunksize)-1)/(*chunksize); } int sharp_get_mlim (int lmax, int spin, double sth, double cth) { double ofs=lmax*0.01; if (ofs<100.) ofs=100.; double b = -2*spin*fabs(cth); double t1 = lmax*sth+ofs; double c = (double)spin*spin-t1*t1; double discr = b*b-4*c; if (discr<=0) return lmax; double res=(-b+sqrt(discr))/2.; if (res>lmax) res=lmax; return (int)(res+0.5); } typedef struct { double phi0_; dcmplx *shiftarr, *work; int s_shift, s_work; real_plan plan; int norot; } ringhelper; static void ringhelper_init (ringhelper *self) { static ringhelper rh_null = { 0, NULL, NULL, 0, 0, NULL, 0 }; *self = rh_null; } static void ringhelper_destroy (ringhelper *self) { if (self->plan) kill_real_plan(self->plan); DEALLOC(self->shiftarr); DEALLOC(self->work); ringhelper_init(self); } static void ringhelper_update (ringhelper *self, int nph, int mmax, double phi0) { self->norot = (fabs(phi0)<1e-14); if (!(self->norot)) if ((mmax!=self->s_shift-1) || (!FAPPROX(phi0,self->phi0_,1e-12))) { RESIZE (self->shiftarr,dcmplx,mmax+1); self->s_shift = mmax+1; self->phi0_ = phi0; for (int m=0; m<=mmax; ++m) self->shiftarr[m] = cos(m*phi0) + _Complex_I*sin(m*phi0); } if (!self->plan) self->plan=make_real_plan(nph); if (nph!=(int)self->plan->length) { kill_real_plan(self->plan); self->plan=make_real_plan(nph); } GROW(self->work,dcmplx,self->s_work,nph); } static int ringinfo_compare (const void *xa, const void *xb) { const sharp_ringinfo *a=xa, *b=xb; return (a->sth < b->sth) ? -1 : (a->sth > b->sth) ? 1 : 0; } static int ringpair_compare (const void *xa, const void *xb) { const sharp_ringpair *a=xa, *b=xb; if (a->r1.nph==b->r1.nph) return (a->r1.phi0 < b->r1.phi0) ? -1 : ((a->r1.phi0 > b->r1.phi0) ? 1 : (a->r1.cth>b->r1.cth ? -1 : 1)); return (a->r1.nphr1.nph) ? -1 : 1; } void sharp_make_general_alm_info (int lmax, int nm, int stride, const int *mval, const ptrdiff_t *mstart, int flags, sharp_alm_info **alm_info) { sharp_alm_info *info = RALLOC(sharp_alm_info,1); info->lmax = lmax; info->nm = nm; info->mval = RALLOC(int,nm); info->mvstart = RALLOC(ptrdiff_t,nm); info->stride = stride; info->flags = flags; for (int mi=0; mimval[mi] = mval[mi]; info->mvstart[mi] = mstart[mi]; } *alm_info = info; } void sharp_make_alm_info (int lmax, int mmax, int stride, const ptrdiff_t *mstart, sharp_alm_info **alm_info) { int *mval=RALLOC(int,mmax+1); for (int i=0; i<=mmax; ++i) mval[i]=i; sharp_make_general_alm_info (lmax, mmax+1, stride, mval, mstart, 0, alm_info); DEALLOC(mval); } ptrdiff_t sharp_alm_index (const sharp_alm_info *self, int l, int mi) { UTIL_ASSERT(!(self->flags & SHARP_PACKED), "sharp_alm_index not applicable with SHARP_PACKED alms"); return self->mvstart[mi]+self->stride*l; } void sharp_destroy_alm_info (sharp_alm_info *info) { DEALLOC (info->mval); DEALLOC (info->mvstart); DEALLOC (info); } void sharp_make_geom_info (int nrings, const int *nph, const ptrdiff_t *ofs, const int *stride, const double *phi0, const double *theta, const double *wgt, sharp_geom_info **geom_info) { sharp_geom_info *info = RALLOC(sharp_geom_info,1); sharp_ringinfo *infos = RALLOC(sharp_ringinfo,nrings); int pos=0; info->pair=RALLOC(sharp_ringpair,nrings); info->npairs=0; *geom_info = info; for (int m=0; mpair[info->npairs].r1=infos[pos]; if ((pos0) // make sure northern ring is in r1 info->pair[info->npairs].r2=infos[pos+1]; else { info->pair[info->npairs].r1=infos[pos+1]; info->pair[info->npairs].r2=infos[pos]; } ++pos; } else info->pair[info->npairs].r2.nph=-1; ++pos; ++info->npairs; } DEALLOC(infos); qsort(info->pair,info->npairs,sizeof(sharp_ringpair),ringpair_compare); } void sharp_destroy_geom_info (sharp_geom_info *geom_info) { DEALLOC (geom_info->pair); DEALLOC (geom_info); } /* This currently requires all m values from 0 to nm-1 to be present. It might be worthwhile to relax this criterion such that holes in the m distribution are permissible. */ static int sharp_get_mmax (int *mval, int nm) { int *mcheck=RALLOC(int,nm); SET_ARRAY(mcheck,0,nm,0); for (int i=0; i=0) && (m_curnph; int stride = info->stride; ringhelper_update (self, nph, mmax, info->phi0); self->work[0]=phase[0]; if (nph>=2*mmax+1) { for (int m=1; m<=mmax; ++m) { dcmplx tmp = phase[m*pstride]; if(!self->norot) tmp*=self->shiftarr[m]; self->work[m]=tmp; self->work[nph-m]=conj(tmp); } for (int m=mmax+1; m<(nph-mmax); ++m) self->work[m]=0.; } else { SET_ARRAY(self->work,1,nph,0.); int idx1=1, idx2=nph-1; for (int m=1; m<=mmax; ++m) { dcmplx tmp = phase[m*pstride]; if(!self->norot) tmp*=self->shiftarr[m]; self->work[idx1]+=tmp; self->work[idx2]+=conj(tmp); if (++idx1>=nph) idx1=0; if (--idx2<0) idx2=nph-1; } } real_plan_backward_c (self->plan, (double *)(self->work)); double wgt = (flags&SHARP_USE_WEIGHTS) ? info->weight : 1.; if (flags&SHARP_REAL_HARMONICS) wgt *= sqrt_one_half; if (flags&SHARP_DP) for (int m=0; mofs]+=creal(self->work[m])*wgt; else for (int m=0; mofs] += (float)(creal(self->work[m])*wgt); } static void ringhelper_ring2phase (ringhelper *self, const sharp_ringinfo *info, const void *data, int mmax, dcmplx *phase, int pstride, int flags) { int nph = info->nph; #if 1 int maxidx = mmax; /* Enable this for traditional Healpix compatibility */ #else int maxidx = IMIN(nph-1,mmax); #endif ringhelper_update (self, nph, mmax, -info->phi0); double wgt = (flags&SHARP_USE_WEIGHTS) ? info->weight : 1; if (flags&SHARP_REAL_HARMONICS) wgt *= sqrt_two; if (flags&SHARP_DP) for (int m=0; mwork[m] = ((double *)data)[info->ofs+m*info->stride]*wgt; else for (int m=0; mwork[m] = ((float *)data)[info->ofs+m*info->stride]*wgt; real_plan_forward_c (self->plan, (double *)self->work); if (maxidxnorot) for (int m=0; m<=maxidx; ++m) phase[m*pstride] = self->work[m]; else for (int m=0; m<=maxidx; ++m) phase[m*pstride]=self->work[m]*self->shiftarr[m]; } else { if (self->norot) for (int m=0; m<=maxidx; ++m) phase[m*pstride] = self->work[m%nph]; else for (int m=0; m<=maxidx; ++m) phase[m*pstride]=self->work[m%nph]*self->shiftarr[m]; } for (int m=maxidx+1;m<=mmax; ++m) phase[m*pstride]=0.; } static void ringhelper_pair2phase (ringhelper *self, int mmax, const sharp_ringpair *pair, const void *data, dcmplx *phase1, dcmplx *phase2, int pstride, int flags) { ringhelper_ring2phase (self,&(pair->r1),data,mmax,phase1,pstride,flags); if (pair->r2.nph>0) ringhelper_ring2phase (self,&(pair->r2),data,mmax,phase2,pstride,flags); } static void ringhelper_phase2pair (ringhelper *self, int mmax, const dcmplx *phase1, const dcmplx *phase2, int pstride, const sharp_ringpair *pair, void *data, int flags) { ringhelper_phase2ring (self,&(pair->r1),data,mmax,phase1,pstride,flags); if (pair->r2.nph>0) ringhelper_phase2ring (self,&(pair->r2),data,mmax,phase2,pstride,flags); } static void fill_map (const sharp_geom_info *ginfo, void *map, double value, int flags) { for (int j=0;jnpairs;++j) { if (flags&SHARP_DP) { for (ptrdiff_t i=0;ipair[j].r1.nph;++i) ((double *)map)[ginfo->pair[j].r1.ofs+i*ginfo->pair[j].r1.stride]=value; for (ptrdiff_t i=0;ipair[j].r2.nph;++i) ((double *)map)[ginfo->pair[j].r2.ofs+i*ginfo->pair[j].r2.stride]=value; } else { for (ptrdiff_t i=0;ipair[j].r1.nph;++i) ((float *)map)[ginfo->pair[j].r1.ofs+i*ginfo->pair[j].r1.stride] =(float)value; for (ptrdiff_t i=0;ipair[j].r2.nph;++i) ((float *)map)[ginfo->pair[j].r2.ofs+i*ginfo->pair[j].r2.stride] =(float)value; } } } static void clear_alm (const sharp_alm_info *ainfo, void *alm, int flags) { #define CLEARLOOP(real_t,body) \ { \ real_t *talm = (real_t *)alm; \ for (int l=m;l<=ainfo->lmax;++l) \ body \ } for (int mi=0;minm;++mi) { int m=ainfo->mval[mi]; ptrdiff_t mvstart = ainfo->mvstart[mi]; ptrdiff_t stride = ainfo->stride; if (!(ainfo->flags&SHARP_PACKED)) mvstart*=2; if ((ainfo->flags&SHARP_PACKED)&&(m==0)) { if (flags&SHARP_DP) CLEARLOOP(double, talm[mvstart+l*stride] = 0.;) else CLEARLOOP(float, talm[mvstart+l*stride] = 0.;) } else { stride*=2; if (flags&SHARP_DP) CLEARLOOP(double,talm[mvstart+l*stride]=talm[mvstart+l*stride+1]=0.;) else CLEARLOOP(float,talm[mvstart+l*stride]=talm[mvstart+l*stride+1]=0.;) } #undef CLEARLOOP } } static void init_output (sharp_job *job) { if (job->flags&SHARP_ADD) return; if (job->type == SHARP_MAP2ALM) for (int i=0; intrans*job->nalm; ++i) clear_alm (job->ainfo,job->alm[i],job->flags); else for (int i=0; intrans*job->nmaps; ++i) fill_map (job->ginfo,job->map[i],0.,job->flags); } static void alloc_phase (sharp_job *job, int nm, int ntheta) { if (job->type==SHARP_MAP2ALM) { if ((nm&1023)==0) nm+=3; // hack to avoid critical strides job->s_m=2*job->ntrans*job->nmaps; job->s_th=job->s_m*nm; } else { if ((ntheta&1023)==0) ntheta+=3; // hack to avoid critical strides job->s_th=2*job->ntrans*job->nmaps; job->s_m=job->s_th*ntheta; } job->phase=RALLOC(dcmplx,2*job->ntrans*job->nmaps*nm*ntheta); } static void dealloc_phase (sharp_job *job) { DEALLOC(job->phase); } //FIXME: set phase to zero if not SHARP_MAP2ALM? static void map2phase (sharp_job *job, int mmax, int llim, int ulim) { if (job->type != SHARP_MAP2ALM) return; int pstride = job->s_m; #pragma omp parallel if ((job->flags&SHARP_NO_OPENMP)==0) { ringhelper helper; ringhelper_init(&helper); #pragma omp for schedule(dynamic,1) for (int ith=llim; iths_th*(ith-llim); for (int i=0; intrans*job->nmaps; ++i) ringhelper_pair2phase(&helper,mmax,&job->ginfo->pair[ith], job->map[i], &job->phase[dim2+2*i], &job->phase[dim2+2*i+1], pstride, job->flags); } ringhelper_destroy(&helper); } /* end of parallel region */ } static void alloc_almtmp (sharp_job *job, int lmax) { job->almtmp=RALLOC(dcmplx,job->ntrans*job->nalm*(lmax+1)); } static void dealloc_almtmp (sharp_job *job) { DEALLOC(job->almtmp); } static void alm2almtmp (sharp_job *job, int lmax, int mi) { #define COPY_LOOP(real_t, source_t, expr_of_x) \ for (int l=job->ainfo->mval[mi]; l<=lmax; ++l) \ for (int i=0; intrans*job->nalm; ++i) \ { \ source_t x = *(source_t *)(((real_t *)job->alm[i])+ofs+l*stride); \ job->almtmp[job->ntrans*job->nalm*l+i] = expr_of_x; \ } if (job->type!=SHARP_MAP2ALM) { ptrdiff_t ofs=job->ainfo->mvstart[mi]; int stride=job->ainfo->stride; int m=job->ainfo->mval[mi]; /* in the case of SHARP_REAL_HARMONICS, phase2ring scales all the coefficients by sqrt_one_half; here we must compensate to avoid scaling m=0 */ double norm_m0=(job->flags&SHARP_REAL_HARMONICS) ? sqrt_two : 1.; if (!(job->ainfo->flags&SHARP_PACKED)) ofs *= 2; if (!((job->ainfo->flags&SHARP_PACKED)&&(m==0))) stride *= 2; if (job->spin==0) { if (m==0) { if (job->flags&SHARP_DP) COPY_LOOP(double, double, x*norm_m0) else COPY_LOOP(float, float, x*norm_m0) } else { if (job->flags&SHARP_DP) COPY_LOOP(double, dcmplx, x) else COPY_LOOP(float, fcmplx, x) } } else { if (m==0) { if (job->flags&SHARP_DP) COPY_LOOP(double, double, x*job->norm_l[l]*norm_m0) else COPY_LOOP(float, float, x*job->norm_l[l]*norm_m0) } else { if (job->flags&SHARP_DP) COPY_LOOP(double, dcmplx, x*job->norm_l[l]) else COPY_LOOP(float, fcmplx, x*job->norm_l[l]) } } } else SET_ARRAY(job->almtmp,job->ntrans*job->nalm*job->ainfo->mval[mi], job->ntrans*job->nalm*(lmax+1),0.); #undef COPY_LOOP } static void almtmp2alm (sharp_job *job, int lmax, int mi) { #define COPY_LOOP(real_t, target_t, expr_of_x) \ for (int l=job->ainfo->mval[mi]; l<=lmax; ++l) \ for (int i=0; intrans*job->nalm; ++i) \ { \ dcmplx x = job->almtmp[job->ntrans*job->nalm*l+i]; \ *(target_t *)(((real_t *)job->alm[i])+ofs+l*stride) += expr_of_x; \ } if (job->type != SHARP_MAP2ALM) return; ptrdiff_t ofs=job->ainfo->mvstart[mi]; int stride=job->ainfo->stride; int m=job->ainfo->mval[mi]; /* in the case of SHARP_REAL_HARMONICS, ring2phase scales all the coefficients by sqrt_two; here we must compensate to avoid scaling m=0 */ double norm_m0=(job->flags&SHARP_REAL_HARMONICS) ? sqrt_one_half : 1.; if (!(job->ainfo->flags&SHARP_PACKED)) ofs *= 2; if (!((job->ainfo->flags&SHARP_PACKED)&&(m==0))) stride *= 2; if (job->spin==0) { if (m==0) { if (job->flags&SHARP_DP) COPY_LOOP(double, double, creal(x)*norm_m0) else COPY_LOOP(float, float, crealf(x)*norm_m0) } else { if (job->flags&SHARP_DP) COPY_LOOP(double, dcmplx, x) else COPY_LOOP(float, fcmplx, (fcmplx)x) } } else { if (m==0) { if (job->flags&SHARP_DP) COPY_LOOP(double, double, creal(x)*job->norm_l[l]*norm_m0) else COPY_LOOP(float, fcmplx, (float)(creal(x)*job->norm_l[l]*norm_m0)) } else { if (job->flags&SHARP_DP) COPY_LOOP(double, dcmplx, x*job->norm_l[l]) else COPY_LOOP(float, fcmplx, (fcmplx)(x*job->norm_l[l])) } } #undef COPY_LOOP } static void phase2map (sharp_job *job, int mmax, int llim, int ulim) { if (job->type == SHARP_MAP2ALM) return; int pstride = job->s_m; #pragma omp parallel if ((job->flags&SHARP_NO_OPENMP)==0) { ringhelper helper; ringhelper_init(&helper); #pragma omp for schedule(dynamic,1) for (int ith=llim; iths_th*(ith-llim); for (int i=0; intrans*job->nmaps; ++i) ringhelper_phase2pair(&helper,mmax,&job->phase[dim2+2*i], &job->phase[dim2+2*i+1],pstride,&job->ginfo->pair[ith],job->map[i], job->flags); } ringhelper_destroy(&helper); } /* end of parallel region */ } static void sharp_execute_job (sharp_job *job) { double timer=wallTime(); job->opcnt=0; int lmax = job->ainfo->lmax, mmax=sharp_get_mmax(job->ainfo->mval, job->ainfo->nm); job->norm_l = (job->type==SHARP_ALM2MAP_DERIV1) ? sharp_Ylmgen_get_d1norm (lmax) : sharp_Ylmgen_get_norm (lmax, job->spin); /* clear output arrays if requested */ init_output (job); int nchunks, chunksize; get_chunk_info(job->ginfo->npairs,(job->flags&SHARP_NVMAX)*VLEN,&nchunks, &chunksize); alloc_phase (job,mmax+1,chunksize); /* chunk loop */ for (int chunk=0; chunkginfo->npairs); int *ispair = RALLOC(int,ulim-llim); int *mlim = RALLOC(int,ulim-llim); double *cth = RALLOC(double,ulim-llim), *sth = RALLOC(double,ulim-llim); for (int i=0; iginfo->pair[i+llim].r2.nph>0; cth[i] = job->ginfo->pair[i+llim].r1.cth; sth[i] = job->ginfo->pair[i+llim].r1.sth; mlim[i] = sharp_get_mlim(lmax, job->spin, sth[i], cth[i]); } /* map->phase where necessary */ map2phase (job, mmax, llim, ulim); #pragma omp parallel if ((job->flags&SHARP_NO_OPENMP)==0) { sharp_job ljob = *job; ljob.opcnt=0; sharp_Ylmgen_C generator; sharp_Ylmgen_init (&generator,lmax,mmax,ljob.spin); alloc_almtmp(&ljob,lmax); #pragma omp for schedule(dynamic,1) for (int mi=0; miainfo->nm; ++mi) { /* alm->alm_tmp where necessary */ alm2almtmp (&ljob, lmax, mi); inner_loop (&ljob, ispair, cth, sth, llim, ulim, &generator, mi, mlim); /* alm_tmp->alm where necessary */ almtmp2alm (&ljob, lmax, mi); } sharp_Ylmgen_destroy(&generator); dealloc_almtmp(&ljob); #pragma omp critical job->opcnt+=ljob.opcnt; } /* end of parallel region */ /* phase->map where necessary */ phase2map (job, mmax, llim, ulim); DEALLOC(ispair); DEALLOC(mlim); DEALLOC(cth); DEALLOC(sth); } /* end of chunk loop */ DEALLOC(job->norm_l); dealloc_phase (job); job->time=wallTime()-timer; } static void sharp_build_job_common (sharp_job *job, sharp_jobtype type, int spin, void *alm, void *map, const sharp_geom_info *geom_info, const sharp_alm_info *alm_info, int ntrans, int flags) { UTIL_ASSERT((ntrans>0)&&(ntrans<=SHARP_MAXTRANS), "bad number of simultaneous transforms"); if (type==SHARP_ALM2MAP_DERIV1) spin=1; if (type==SHARP_MAP2ALM) flags|=SHARP_USE_WEIGHTS; if (type==SHARP_Yt) type=SHARP_MAP2ALM; if (type==SHARP_WY) { type=SHARP_ALM2MAP; flags|=SHARP_USE_WEIGHTS; } UTIL_ASSERT((spin>=0)&&(spin<=alm_info->lmax), "bad spin"); job->type = type; job->spin = spin; job->norm_l = NULL; job->nmaps = (type==SHARP_ALM2MAP_DERIV1) ? 2 : ((spin>0) ? 2 : 1); job->nalm = (type==SHARP_ALM2MAP_DERIV1) ? 1 : ((spin>0) ? 2 : 1); job->ginfo = geom_info; job->ainfo = alm_info; job->flags = flags; if ((job->flags&SHARP_NVMAX)==0) job->flags|=sharp_nv_oracle (type, spin, ntrans); job->time = 0.; job->opcnt = 0; job->ntrans = ntrans; job->alm=alm; job->map=map; } void sharp_execute (sharp_jobtype type, int spin, void *alm, void *map, const sharp_geom_info *geom_info, const sharp_alm_info *alm_info, int ntrans, int flags, double *time, unsigned long long *opcnt) { sharp_job job; sharp_build_job_common (&job, type, spin, alm, map, geom_info, alm_info, ntrans, flags); sharp_execute_job (&job); if (time!=NULL) *time = job.time; if (opcnt!=NULL) *opcnt = job.opcnt; } void sharp_set_chunksize_min(int new_chunksize_min) { chunksize_min=new_chunksize_min; } void sharp_set_nchunks_max(int new_nchunks_max) { nchunks_max=new_nchunks_max; } int sharp_get_nv_max (void) { return 6; } static int sharp_oracle (sharp_jobtype type, int spin, int ntrans) { int lmax=511; int mmax=(lmax+1)/2; int nrings=(lmax+1)/4; int ppring=1; spin = (spin!=0) ? 2 : 0; ptrdiff_t npix=(ptrdiff_t)nrings*ppring; sharp_geom_info *tinfo; sharp_make_gauss_geom_info (nrings, ppring, 0., 1, ppring, &tinfo); ptrdiff_t nalms = ((mmax+1)*(mmax+2))/2 + (mmax+1)*(lmax-mmax); int ncomp = ntrans*((spin==0) ? 1 : 2); double **map; ALLOC2D(map,double,ncomp,npix); SET_ARRAY(map[0],0,npix*ncomp,0.); sharp_alm_info *alms; sharp_make_triangular_alm_info(lmax,mmax,1,&alms); dcmplx **alm; ALLOC2D(alm,dcmplx,ncomp,nalms); SET_ARRAY(alm[0],0,nalms*ncomp,0.); double time=1e30; int nvbest=-1; for (int nv=1; nv<=sharp_get_nv_max(); ++nv) { double time_acc=0.; double jtime; int ntries=0; do { sharp_execute(type,spin,&alm[0],&map[0],tinfo,alms,ntrans, nv|SHARP_DP|SHARP_NO_OPENMP,&jtime,NULL); if (jtime0),"bad number of simultaneous transforms"); UTIL_ASSERT(spin>=0, "bad spin"); ntrans=IMIN(ntrans,maxtr); if (nv_opt[ntrans-1][spin!=0][type]==0) nv_opt[ntrans-1][spin!=0][type]=sharp_oracle(type,spin,ntrans); return nv_opt[ntrans-1][spin!=0][type]; } #ifdef USE_MPI #include "sharp_mpi.c" #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/planck.make0000650000175000017530000000077512255154051026327 0ustar zoncaplanck00000000000000PKG:=libsharp SD:=$(SRCROOT)/$(PKG) OD:=$(BLDROOT)/$(PKG) FULL_INCLUDE+= -I$(SD) HDR_$(PKG):=$(SD)/*.h LIB_$(PKG):=$(LIBDIR)/libsharp.a LIBOBJ:=sharp_ylmgen_c.o sharp.o sharp_geomhelpers.o sharp_almhelpers.o sharp_core.o LIBOBJ:=$(LIBOBJ:%=$(OD)/%) ODEP:=$(HDR_$(PKG)) $(HDR_libfftpack) $(HDR_c_utils) $(OD)/sharp_core.o: $(SD)/sharp_core_inchelper.c $(SD)/sharp_core_inc.c $(SD)/sharp_core_inc2.c $(LIB_$(PKG)): $(LIBOBJ) $(LIBOBJ): $(ODEP) | $(OD)_mkdir all_hdr+=$(HDR_$(PKG)) all_lib+=$(LIB_$(PKG)) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_vecsupport.h0000650000175000017530000001227212255154051027773 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* \file sharp_vecsupport.h * Convenience functions for vector arithmetics * * Copyright (C) 2012 Max-Planck-Society * Author: Martin Reinecke */ #ifndef SHARP_VECSUPPORT_H #define SHARP_VECSUPPORT_H #include #include "sharp_vecutil.h" typedef double Ts; #if (VLEN==1) typedef double Tv; #define vadd(a,b) ((a)+(b)) #define vaddeq(a,b) ((a)+=(b)) #define vsub(a,b) ((a)-(b)) #define vsubeq(a,b) ((a)-=(b)) #define vmul(a,b) ((a)*(b)) #define vmuleq(a,b) ((a)*=(b)) #define vfmaeq(a,b,c) ((a)+=(b)*(c)) #define vfmseq(a,b,c) ((a)-=(b)*(c)) #define vfmaaeq(a,b,c,d,e) ((a)+=(b)*(c)+(d)*(e)) #define vfmaseq(a,b,c,d,e) ((a)+=(b)*(c)-(d)*(e)) #define vneg(a) (-(a)) #define vload(a) (a) #define vabs(a) fabs(a) #define vsqrt(a) sqrt(a) #define vlt(a,b) (((a)<(b))?1.:0.) #define vgt(a,b) (((a)>(b))?1.:0.) #define vge(a,b) (((a)>=(b))?1.:0.) #define vne(a,b) (((a)!=(b))?1.:0.) #define vand(a,b) ((((a)*(b))!=0.)?1.:0.) #define vor(a,b) ((((a)+(b))!=0.)?1.:0.) static inline Tv vmin (Tv a, Tv b) { return (ab) ? a : b; } #define vanyTrue(a) ((a)!=0.) #define vallTrue(a) ((a)!=0.) #define vblend(m,a,b) (((m)!=0.) ? (a) : (b)) #define vzero 0. #define vone 1. #endif #if (VLEN==2) #include #if defined (__SSE3__) #include #endif #if defined (__SSE4_1__) #include #endif typedef __m128d Tv; #define vadd(a,b) _mm_add_pd(a,b) #define vaddeq(a,b) a=_mm_add_pd(a,b) #define vsub(a,b) _mm_sub_pd(a,b) #define vsubeq(a,b) a=_mm_sub_pd(a,b) #define vmul(a,b) _mm_mul_pd(a,b) #define vmuleq(a,b) a=_mm_mul_pd(a,b) #define vfmaeq(a,b,c) a=_mm_add_pd(a,_mm_mul_pd(b,c)) #define vfmseq(a,b,c) a=_mm_sub_pd(a,_mm_mul_pd(b,c)) #define vfmaaeq(a,b,c,d,e) \ a=_mm_add_pd(a,_mm_add_pd(_mm_mul_pd(b,c),_mm_mul_pd(d,e))) #define vfmaseq(a,b,c,d,e) \ a=_mm_add_pd(a,_mm_sub_pd(_mm_mul_pd(b,c),_mm_mul_pd(d,e))) #define vneg(a) _mm_xor_pd(_mm_set1_pd(-0.),a) #define vload(a) _mm_set1_pd(a) #define vabs(a) _mm_andnot_pd(_mm_set1_pd(-0.),a) #define vsqrt(a) _mm_sqrt_pd(a) #define vlt(a,b) _mm_cmplt_pd(a,b) #define vgt(a,b) _mm_cmpgt_pd(a,b) #define vge(a,b) _mm_cmpge_pd(a,b) #define vne(a,b) _mm_cmpneq_pd(a,b) #define vand(a,b) _mm_and_pd(a,b) #define vor(a,b) _mm_or_pd(a,b) #define vmin(a,b) _mm_min_pd(a,b) #define vmax(a,b) _mm_max_pd(a,b); #define vanyTrue(a) (_mm_movemask_pd(a)!=0) #define vallTrue(a) (_mm_movemask_pd(a)==3) #if defined(__SSE4_1__) #define vblend(m,a,b) _mm_blendv_pd(b,a,m) #else static inline Tv vblend(Tv m, Tv a, Tv b) { return _mm_or_pd(_mm_and_pd(a,m),_mm_andnot_pd(m,b)); } #endif #define vzero _mm_setzero_pd() #define vone _mm_set1_pd(1.) #endif #if (VLEN==4) #include #ifdef __FMA4__ #include #endif typedef __m256d Tv; #define vadd(a,b) _mm256_add_pd(a,b) #define vaddeq(a,b) a=_mm256_add_pd(a,b) #define vsub(a,b) _mm256_sub_pd(a,b) #define vsubeq(a,b) a=_mm256_sub_pd(a,b) #define vmul(a,b) _mm256_mul_pd(a,b) #define vmuleq(a,b) a=_mm256_mul_pd(a,b) #ifdef __FMA4__ #define vfmaeq(a,b,c) a=_mm256_macc_pd(b,c,a) #define vfmseq(a,b,c) a=_mm256_nmacc_pd(b,c,a) #define vfmaaeq(a,b,c,d,e) a=_mm256_macc_pd(d,e,_mm256_macc_pd(b,c,a)) #define vfmaseq(a,b,c,d,e) a=_mm256_nmacc_pd(d,e,_mm256_macc_pd(b,c,a)) #else #define vfmaeq(a,b,c) a=_mm256_add_pd(a,_mm256_mul_pd(b,c)) #define vfmseq(a,b,c) a=_mm256_sub_pd(a,_mm256_mul_pd(b,c)) #define vfmaaeq(a,b,c,d,e) \ a=_mm256_add_pd(a,_mm256_add_pd(_mm256_mul_pd(b,c),_mm256_mul_pd(d,e))) #define vfmaseq(a,b,c,d,e) \ a=_mm256_add_pd(a,_mm256_sub_pd(_mm256_mul_pd(b,c),_mm256_mul_pd(d,e))) #endif #define vneg(a) _mm256_xor_pd(_mm256_set1_pd(-0.),a) #define vload(a) _mm256_set1_pd(a) #define vabs(a) _mm256_andnot_pd(_mm256_set1_pd(-0.),a) #define vsqrt(a) _mm256_sqrt_pd(a) #define vlt(a,b) _mm256_cmp_pd(a,b,_CMP_LT_OQ) #define vgt(a,b) _mm256_cmp_pd(a,b,_CMP_GT_OQ) #define vge(a,b) _mm256_cmp_pd(a,b,_CMP_GE_OQ) #define vne(a,b) _mm256_cmp_pd(a,b,_CMP_NEQ_OQ) #define vand(a,b) _mm256_and_pd(a,b) #define vor(a,b) _mm256_or_pd(a,b) #define vmin(a,b) _mm256_min_pd(a,b) #define vmax(a,b) _mm256_max_pd(a,b) #define vanyTrue(a) (_mm256_movemask_pd(a)!=0) #define vallTrue(a) (_mm256_movemask_pd(a)==15) #define vblend(m,a,b) _mm256_blendv_pd(b,a,m) #define vzero _mm256_setzero_pd() #define vone _mm256_set1_pd(1.) #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_lowlevel.h0000650000175000017530000002277012255154051027416 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_lowlevel.h * Low-level, portable interface for the spherical transform library. * * Copyright (C) 2012-2013 Max-Planck-Society * \author Martin Reinecke \author Dag Sverre Seljebotn */ #ifndef PLANCK_SHARP_LOWLEVEL_H #define PLANCK_SHARP_LOWLEVEL_H #include #ifdef __cplusplus extern "C" { #endif /*! \internal Helper type containing information about a single ring. */ typedef struct { double theta, phi0, weight, cth, sth; ptrdiff_t ofs; int nph, stride; } sharp_ringinfo; /*! \internal Helper type containing information about a pair of rings with colatitudes symmetric around the equator. */ typedef struct { sharp_ringinfo r1,r2; } sharp_ringpair; /*! \internal Type holding all required information about a map geometry. */ typedef struct { sharp_ringpair *pair; int npairs; } sharp_geom_info; /*! \defgroup almgroup Helpers for dealing with a_lm */ /*! \{ */ /*! \internal Helper type for index calculation in a_lm arrays. */ typedef struct { /*! Maximum \a l index of the array */ int lmax; /*! Number of different \a m values in this object */ int nm; /*! Array with \a nm entries containing the individual m values */ int *mval; /*! Combination of flags from sharp_almflags */ int flags; /*! Array with \a nm entries containing the (hypothetical) indices of the coefficients with quantum numbers 0,\a mval[i] */ ptrdiff_t *mvstart; /*! Stride between a_lm and a_(l+1),m */ ptrdiff_t stride; } sharp_alm_info; /*! alm_info flags */ typedef enum { SHARP_PACKED = 1 /*< m=0-coefficients are packed so that the (zero) imaginary part is not present. mvstart is in units of *real* float/double for all m; stride is in units of reals for m=0 and complex for m!=0 */ } sharp_almflags; /*! Creates an a_lm data structure from the following parameters: \param lmax maximum \a l quantum number (>=0) \param mmax maximum \a m quantum number (0<= \a mmax <= \a lmax) \param stride the stride between entries with identical \a m, and \a l differing by 1. \param mstart the index of the (hypothetical) coefficient with the quantum numbers 0,\a m. Must have \a mmax+1 entries. \param alm_info will hold a pointer to the newly created data structure */ void sharp_make_alm_info (int lmax, int mmax, int stride, const ptrdiff_t *mstart, sharp_alm_info **alm_info); /*! Creates an a_lm data structure which from the following parameters: \param lmax maximum \a l quantum number (\a >=0) \param nm number of different \a m (\a 0<=nm<=lmax+1) \param stride the stride between entries with identical \a m, and \a l differing by 1. \param mval array with \a nm entries containing the individual m values \param mvstart array with \a nm entries containing the (hypothetical) indices of the coefficients with the quantum numbers 0,\a mval[i] \param flags a combination of sharp_almflags (pass 0 unless you know you need this) \param alm_info will hold a pointer to the newly created data structure */ void sharp_make_general_alm_info (int lmax, int nm, int stride, const int *mval, const ptrdiff_t *mvstart, int flags, sharp_alm_info **alm_info); /*! Returns the index of the coefficient with quantum numbers \a l, \a mval[mi]. \note for a \a sharp_alm_info generated by sharp_make_alm_info() this is the index for the coefficient with the quantum numbers \a l, \a mi. */ ptrdiff_t sharp_alm_index (const sharp_alm_info *self, int l, int mi); /*! Deallocates the a_lm info object. */ void sharp_destroy_alm_info (sharp_alm_info *info); /*! \} */ /*! \defgroup geominfogroup Functions for dealing with geometry information */ /*! \{ */ /*! Creates a geometry information from a set of ring descriptions. All arrays passed to this function must have \a nrings elements. \param nrings the number of rings in the map \param nph the number of pixels in each ring \param ofs the index of the first pixel in each ring in the map array \param stride the stride between consecutive pixels \param phi0 the azimuth (in radians) of the first pixel in each ring \param theta the colatitude (in radians) of each ring \param wgt the pixel weight to be used for the ring in map2alm and adjoint map2alm transforms. Pass NULL to use 1.0 as weight for all rings. \param geom_info will hold a pointer to the newly created data structure */ void sharp_make_geom_info (int nrings, const int *nph, const ptrdiff_t *ofs, const int *stride, const double *phi0, const double *theta, const double *wgt, sharp_geom_info **geom_info); /*! Deallocates the geometry information in \a info. */ void sharp_destroy_geom_info (sharp_geom_info *info); /*! \} */ /*! \defgroup lowlevelgroup Low-level libsharp SHT interface */ /*! \{ */ /*! Enumeration of SHARP job types. */ typedef enum { SHARP_YtW=0, /*!< analysis */ SHARP_MAP2ALM=SHARP_YtW, /*!< analysis */ SHARP_Y=1, /*!< synthesis */ SHARP_ALM2MAP=SHARP_Y, /*!< synthesis */ SHARP_Yt=2, /*!< adjoint synthesis */ SHARP_WY=3, /*!< adjoint analysis */ SHARP_ALM2MAP_DERIV1=4 /*!< synthesis of first derivatives */ } sharp_jobtype; /*! Job flags */ typedef enum { SHARP_DP = 1<<4, /*!< map and a_lm are in double precision */ SHARP_ADD = 1<<5, /*!< results are added to the output arrays, instead of overwriting them */ SHARP_REAL_HARMONICS = 1<<6, /*!< Use the real spherical harmonic convention. For m==0, the alm are treated exactly the same as in the complex case. For m!=0, alm[i] represent a pair (+abs(m), -abs(m)) instead of (real, imag), and the coefficients are scaled by a factor of sqrt(2) relative to the complex case. In other words, (sqrt(.5) * alm[i]) recovers the corresponding complex coefficient (when accessed as complex). */ SHARP_USE_WEIGHTS = 1<<20, /* internal use only */ SHARP_NO_OPENMP = 1<<21, /* internal use only */ SHARP_NVMAX = (1<<4)-1 /* internal use only */ } sharp_jobflags; /*! Performs a libsharp SHT job. The interface deliberately does not use the C99 "complex" data type, in order to be callable from C89 and C++. \param type the type of SHT \param spin the spin of the quantities to be transformed \param alm contains pointers to the a_lm coefficients. If \a spin==0, alm[0] points to the a_lm of the first SHT, alm[1] to those of the second etc. If \a spin>0, alm[0] and alm[1] point to the a_lm of the first SHT, alm[2] and alm[3] to those of the second, etc. The exact data type of \a alm depends on whether the SHARP_DP flag is set. \param map contains pointers to the maps. If \a spin==0, map[0] points to the map of the first SHT, map[1] to that of the second etc. If \a spin>0, or \a type is SHARP_ALM2MAP_DERIV1, map[0] and map[1] point to the maps of the first SHT, map[2] and map[3] to those of the second, etc. The exact data type of \a map depends on whether the SHARP_DP flag is set. \param geom_info A \c sharp_geom_info object compatible with the provided \a map arrays. \param alm_info A \c sharp_alm_info object compatible with the provided \a alm arrays. All \c m values from 0 to some \c mmax<=lmax must be present exactly once. \param ntrans the number of simultaneous SHTs \param flags See sharp_jobflags. In particular, if SHARP_DP is set, then \a alm is expected to have the type "complex double **" and \a map is expected to have the type "double **"; otherwise, the expected types are "complex float **" and "float **", respectively. \param time If not NULL, the wall clock time required for this SHT (in seconds) will be written here. \param opcnt If not NULL, a conservative estimate of the total floating point operation count for this SHT will be written here. */ void sharp_execute (sharp_jobtype type, int spin, void *alm, void *map, const sharp_geom_info *geom_info, const sharp_alm_info *alm_info, int ntrans, int flags, double *time, unsigned long long *opcnt); void sharp_set_chunksize_min(int new_chunksize_min); void sharp_set_nchunks_max(int new_nchunks_max); /*! \} */ #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_almhelpers.h0000650000175000017530000000326512255154051027717 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_almhelpers.h * SHARP helper function for the creation of a_lm data structures * * Copyright (C) 2008-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SHARP_ALMHELPERS_H #define PLANCK_SHARP_ALMHELPERS_H #include "sharp_lowlevel.h" #ifdef __cplusplus extern "C" { #endif /*! Initialises an a_lm data structure according to the scheme used by Healpix_cxx. \ingroup almgroup */ void sharp_make_triangular_alm_info (int lmax, int mmax, int stride, sharp_alm_info **alm_info); /*! Initialises an a_lm data structure according to the scheme used by Fortran Healpix \ingroup almgroup */ void sharp_make_rectangular_alm_info (int lmax, int mmax, int stride, sharp_alm_info **alm_info); #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_core.c0000650000175000017530000001630612255154051026506 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_core.c * Computational core * * Copyright (C) 2012-2013 Max-Planck-Society * \author Martin Reinecke */ #include #include #include #include "sharp_vecsupport.h" #include "sharp_complex_hacks.h" #include "sharp_ylmgen_c.h" #include "sharp.h" #include "sharp_core.h" #include "c_utils.h" typedef complex double dcmplx; // must be in the range [0;6] #define MAXJOB_SPECIAL 2 #define XCONCAT2(a,b) a##_##b #define CONCAT2(a,b) XCONCAT2(a,b) #define XCONCAT3(a,b,c) a##_##b##_##c #define CONCAT3(a,b,c) XCONCAT3(a,b,c) #define nvec 1 #include "sharp_core_inchelper.c" #undef nvec #define nvec 2 #include "sharp_core_inchelper.c" #undef nvec #define nvec 3 #include "sharp_core_inchelper.c" #undef nvec #define nvec 4 #include "sharp_core_inchelper.c" #undef nvec #define nvec 5 #include "sharp_core_inchelper.c" #undef nvec #define nvec 6 #include "sharp_core_inchelper.c" #undef nvec void inner_loop (sharp_job *job, const int *ispair,const double *cth, const double *sth, int llim, int ulim, sharp_Ylmgen_C *gen, int mi, const int *mlim) { int njobs=job->ntrans, nv=job->flags&SHARP_NVMAX; if (njobs<=MAXJOB_SPECIAL) { switch (njobs*16+nv) { #if ((MAXJOB_SPECIAL>=1)&&(SHARP_MAXTRANS>=1)) case 0x11: CONCAT3(inner_loop,1,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x12: CONCAT3(inner_loop,2,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x13: CONCAT3(inner_loop,3,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x14: CONCAT3(inner_loop,4,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x15: CONCAT3(inner_loop,5,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x16: CONCAT3(inner_loop,6,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; #endif #if ((MAXJOB_SPECIAL>=2)&&(SHARP_MAXTRANS>=2)) case 0x21: CONCAT3(inner_loop,1,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x22: CONCAT3(inner_loop,2,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x23: CONCAT3(inner_loop,3,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x24: CONCAT3(inner_loop,4,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x25: CONCAT3(inner_loop,5,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x26: CONCAT3(inner_loop,6,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; #endif #if ((MAXJOB_SPECIAL>=3)&&(SHARP_MAXTRANS>=3)) case 0x31: CONCAT3(inner_loop,1,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x32: CONCAT3(inner_loop,2,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x33: CONCAT3(inner_loop,3,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x34: CONCAT3(inner_loop,4,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x35: CONCAT3(inner_loop,5,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x36: CONCAT3(inner_loop,6,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; #endif #if ((MAXJOB_SPECIAL>=4)&&(SHARP_MAXTRANS>=4)) case 0x41: CONCAT3(inner_loop,1,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x42: CONCAT3(inner_loop,2,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x43: CONCAT3(inner_loop,3,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x44: CONCAT3(inner_loop,4,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x45: CONCAT3(inner_loop,5,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x46: CONCAT3(inner_loop,6,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; #endif #if ((MAXJOB_SPECIAL>=5)&&(SHARP_MAXTRANS>=5)) case 0x51: CONCAT3(inner_loop,1,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x52: CONCAT3(inner_loop,2,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x53: CONCAT3(inner_loop,3,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x54: CONCAT3(inner_loop,4,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x55: CONCAT3(inner_loop,5,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x56: CONCAT3(inner_loop,6,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; #endif #if ((MAXJOB_SPECIAL>=6)&&(SHARP_MAXTRANS>=6)) case 0x61: CONCAT3(inner_loop,1,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x62: CONCAT3(inner_loop,2,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x63: CONCAT3(inner_loop,3,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x64: CONCAT3(inner_loop,4,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x65: CONCAT3(inner_loop,5,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; case 0x66: CONCAT3(inner_loop,6,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim); return; #endif } } #if (SHARP_MAXTRANS>MAXJOB_SPECIAL) else { switch (nv) { case 1: CONCAT2(inner_loop,1) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); return; case 2: CONCAT2(inner_loop,2) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); return; case 3: CONCAT2(inner_loop,3) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); return; case 4: CONCAT2(inner_loop,4) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); return; case 5: CONCAT2(inner_loop,5) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); return; case 6: CONCAT2(inner_loop,6) (job, ispair,cth,sth,llim,ulim,gen,mi,mlim,job->ntrans); return; } } #endif UTIL_FAIL("Incorrect vector parameters"); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_ylmgen_c.h0000650000175000017530000000575012255154051027361 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_ylmgen_c.h * Code for efficient calculation of Y_lm(phi=0,theta) * * Copyright (C) 2005-2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef SHARP_YLMGEN_C_H #define SHARP_YLMGEN_C_H #ifdef __cplusplus extern "C" { #endif enum { sharp_minscale=0, sharp_limscale=1, sharp_maxscale=1 }; static const double sharp_fbig=0x1p+800,sharp_fsmall=0x1p-800; static const double sharp_ftol=0x1p-60; static const double sharp_fbighalf=0x1p+400; typedef struct { double f[2]; } sharp_ylmgen_dbl2; typedef struct { double f[3]; } sharp_ylmgen_dbl3; typedef struct { /* for public use; immutable during lifetime */ int lmax, mmax, s; double *cf; /* for public use; will typically change after call to Ylmgen_prepare() */ int m; /* used if s==0 */ double *mfac; sharp_ylmgen_dbl2 *rf; /* used if s!=0 */ int sinPow, cosPow, preMinus_p, preMinus_m; double *prefac; int *fscale; sharp_ylmgen_dbl3 *fx; /* internal usage only */ /* used if s==0 */ double *root, *iroot; /* used if s!=0 */ double *flm1, *flm2, *inv; int mlo, mhi; } sharp_Ylmgen_C; /*! Creates a generator which will calculate helper data for Y_lm calculation up to \a l=l_max and \a m=m_max. */ void sharp_Ylmgen_init (sharp_Ylmgen_C *gen, int l_max, int m_max, int spin); /*! Deallocates a generator previously initialised by Ylmgen_init(). */ void sharp_Ylmgen_destroy (sharp_Ylmgen_C *gen); /*! Prepares the object for the calculation at \a m. */ void sharp_Ylmgen_prepare (sharp_Ylmgen_C *gen, int m); /*! Returns a pointer to an array with \a lmax+1 entries containing normalisation factors that must be applied to Y_lm values computed for \a spin. The array must be deallocated (using free()) by the user. */ double *sharp_Ylmgen_get_norm (int lmax, int spin); /*! Returns a pointer to an array with \a lmax+1 entries containing normalisation factors that must be applied to Y_lm values computed for first derivatives. The array must be deallocated (using free()) by the user. */ double *sharp_Ylmgen_get_d1norm (int lmax); #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_core_inc.c0000650000175000017530000002112112255154051027326 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_core_inc.c * Type-dependent code for the computational core * * Copyright (C) 2012 Max-Planck-Society * \author Martin Reinecke */ typedef struct { Tv v[nvec]; } Tb; typedef union { Tb b; double s[VLEN*nvec]; } Y(Tbu); typedef struct { Tb r, i; } Y(Tbri); typedef struct { Tb qr, qi, ur, ui; } Y(Tbqu); typedef struct { double r[VLEN*nvec], i[VLEN*nvec]; } Y(Tsri); typedef struct { double qr[VLEN*nvec],qi[VLEN*nvec],ur[VLEN*nvec],ui[VLEN*nvec]; } Y(Tsqu); typedef union { Y(Tbri) b; Y(Tsri)s; } Y(Tburi); typedef union { Y(Tbqu) b; Y(Tsqu)s; } Y(Tbuqu); static inline Tb Y(Tbconst)(double val) { Tv v=vload(val); Tb res; for (int i=0; iv[i],v); } static inline Tb Y(Tbprod)(Tb a, Tb b) { Tb r; for (int i=0; iv[i],b.v[i]); } static void Y(Tbnormalize) (Tb * restrict val, Tb * restrict scale, double maxval) { const Tv vfsmall=vload(sharp_fsmall), vfbig=vload(sharp_fbig); const Tv vfmin=vload(sharp_fsmall*maxval), vfmax=vload(maxval); for (int i=0;iv[i]),vfmax); while (vanyTrue(mask)) { vmuleq(val->v[i],vblend(mask,vfsmall,vone)); vaddeq(scale->v[i],vblend(mask,vone,vzero)); mask = vgt(vabs(val->v[i]),vfmax); } mask = vand(vlt(vabs(val->v[i]),vfmin),vne(val->v[i],vzero)); while (vanyTrue(mask)) { vmuleq(val->v[i],vblend(mask,vfbig,vone)); vsubeq(scale->v[i],vblend(mask,vone,vzero)); mask = vand(vlt(vabs(val->v[i]),vfmin),vne(val->v[i],vzero)); } } } static void Y(mypow) (Tb val, int npow, Tb * restrict resd, Tb * restrict ress) { Tb scale=Y(Tbconst)(0.), scaleint=Y(Tbconst)(0.), res=Y(Tbconst)(1.); Y(Tbnormalize)(&val,&scaleint,sharp_fbighalf); do { if (npow&1) { for (int i=0; i>=1); *resd=res; *ress=scale; } static inline int Y(rescale) (Tb * restrict lam1, Tb * restrict lam2, Tb * restrict scale) { int did_scale=0; for (int i=0;iv[i]),vload(sharp_ftol)); if (vanyTrue(mask)) { did_scale=1; Tv fact = vblend(mask,vload(sharp_fsmall),vone); vmuleq(lam1->v[i],fact); vmuleq(lam2->v[i],fact); vaddeq(scale->v[i],vblend(mask,vone,vzero)); } } return did_scale; } static inline int Y(TballLt)(Tb a,double b) { Tv vb=vload(b); Tv res=vlt(a.v[0],vb); for (int i=1; im; Tb lam_1=Y(Tbconst)(0.), lam_2, scale; Y(mypow) (sth,l,&lam_2,&scale); Y(Tbmuleq1) (&lam_2,(gen->m&1) ? -gen->mfac[gen->m]:gen->mfac[gen->m]); Y(Tbnormalize)(&lam_2,&scale,sharp_ftol); int below_limit = Y(TballLt)(scale,sharp_limscale); while (below_limit) { if (l+2>gen->lmax) {*l_=gen->lmax+1;return;} Tv r0=vload(gen->rf[l].f[0]),r1=vload(gen->rf[l].f[1]); for (int i=0; irf[l+1].f[0]); r1=vload(gen->rf[l+1].f[1]); for (int i=0; iv[i] = vsub(vmul(vsub(cth.v[i],fx1),vmul(fx0,ryp->v[i])), vmul(fx2,rxp->v[i])); rxm->v[i] = vsub(vmul(vadd(cth.v[i],fx1),vmul(fx0,rym->v[i])), vmul(fx2,rxm->v[i])); } } static void Y(iter_to_ieee_spin) (const Tb cth, const Tb sth, int *l_, Tb * rec1p_, Tb * rec1m_, Tb * rec2p_, Tb * rec2m_, Tb * scalep_, Tb * scalem_, const sharp_Ylmgen_C * restrict gen) { const sharp_ylmgen_dbl3 * restrict fx = gen->fx; Tb cth2, sth2; for (int i=0; icosPow,&ccp,&ccps); Y(mypow)(sth2,gen->sinPow,&ssp,&ssps); Y(mypow)(cth2,gen->sinPow,&csp,&csps); Y(mypow)(sth2,gen->cosPow,&scp,&scps); Tb rec2p, rec2m, scalep, scalem; Tb rec1p=Y(Tbconst)(0.), rec1m=Y(Tbconst)(0.); Tv prefac=vload(gen->prefac[gen->m]), prescale=vload(gen->fscale[gen->m]); for (int i=0; ipreMinus_p) rec2p.v[i]=vneg(rec2p.v[i]); if (gen->preMinus_m) rec2m.v[i]=vneg(rec2m.v[i]); if (gen->s&1) rec2p.v[i]=vneg(rec2p.v[i]); } Y(Tbnormalize)(&rec2m,&scalem,sharp_ftol); Y(Tbnormalize)(&rec2p,&scalep,sharp_ftol); int l=gen->mhi; int below_limit = Y(TballLt)(scalep,sharp_limscale) && Y(TballLt)(scalem,sharp_limscale); while (below_limit) { if (l+2>gen->lmax) {*l_=gen->lmax+1;return;} Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l+1]); Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l+2]); if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) below_limit = Y(TballLt)(scalep,sharp_limscale) && Y(TballLt)(scalem,sharp_limscale); l+=2; } *l_=l; *rec1p_=rec1p; *rec2p_=rec2p; *scalep_=scalep; *rec1m_=rec1m; *rec2m_=rec2m; *scalem_=scalem; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_core_inchelper.c0000650000175000017530000000243012255154051030530 0ustar zoncaplanck00000000000000#define Tb CONCAT2(Tb,nvec) #define Y(arg) CONCAT2(arg,nvec) #include "sharp_core_inc.c" #if (SHARP_MAXTRANS>MAXJOB_SPECIAL) #define NJ1 , int njobs #define NJ2 , njobs #define Z(arg) CONCAT2(arg,nvec) #include "sharp_core_inc2.c" #undef Z #undef NJ1 #undef NJ2 #endif #define NJ1 #define NJ2 #if ((MAXJOB_SPECIAL>=1)&&(SHARP_MAXTRANS>=1)) #define njobs 1 #define Z(arg) CONCAT3(arg,nvec,njobs) #include "sharp_core_inc2.c" #undef Z #undef njobs #endif #if ((MAXJOB_SPECIAL>=2)&&(SHARP_MAXTRANS>=2)) #define njobs 2 #define Z(arg) CONCAT3(arg,nvec,njobs) #include "sharp_core_inc2.c" #undef Z #undef njobs #endif #if ((MAXJOB_SPECIAL>=3)&&(SHARP_MAXTRANS>=3)) #define njobs 3 #define Z(arg) CONCAT3(arg,nvec,njobs) #include "sharp_core_inc2.c" #undef Z #undef njobs #endif #if ((MAXJOB_SPECIAL>=4)&&(SHARP_MAXTRANS>=4)) #define njobs 4 #define Z(arg) CONCAT3(arg,nvec,njobs) #include "sharp_core_inc2.c" #undef Z #undef njobs #endif #if ((MAXJOB_SPECIAL>=5)&&(SHARP_MAXTRANS>=5)) #define njobs 5 #define Z(arg) CONCAT3(arg,nvec,njobs) #include "sharp_core_inc2.c" #undef Z #undef njobs #endif #if ((MAXJOB_SPECIAL>=6)&&(SHARP_MAXTRANS>=6)) #define njobs 6 #define Z(arg) CONCAT3(arg,nvec,njobs) #include "sharp_core_inc2.c" #undef Z #undef njobs #endif #undef NJ1 #undef NJ2 #undef Y #undef Tb healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_complex_hacks.h0000650000175000017530000000740712255154051030405 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* \file sharp_complex_hacks.h * support for converting vector types and complex numbers * * Copyright (C) 2012 Max-Planck-Society * Author: Martin Reinecke */ #ifndef SHARP_COMPLEX_HACKS_H #define SHARP_COMPLEX_HACKS_H #ifdef __cplusplus #error This header file cannot be included from C++, only from C #endif #include #include #include "sharp_vecsupport.h" #define UNSAFE_CODE #if (VLEN==1) static inline complex double vhsum_cmplx(Tv a, Tv b) { return a+_Complex_I*b; } static inline void vhsum_cmplx2 (Tv a, Tv b, Tv c, Tv d, complex double * restrict c1, complex double * restrict c2) { *c1 += a+_Complex_I*b; *c2 += c+_Complex_I*d; } #endif #if (VLEN==2) static inline complex double vhsum_cmplx (Tv a, Tv b) { #if defined(__SSE3__) Tv tmp = _mm_hadd_pd(a,b); #else Tv tmp = vadd(_mm_shuffle_pd(a,b,_MM_SHUFFLE2(0,1)), _mm_shuffle_pd(a,b,_MM_SHUFFLE2(1,0))); #endif union {Tv v; complex double c; } u; u.v=tmp; return u.c; } static inline void vhsum_cmplx2 (Tv a, Tv b, Tv c, Tv d, complex double * restrict c1, complex double * restrict c2) { #ifdef UNSAFE_CODE #if defined(__SSE3__) vaddeq(*((__m128d *)c1),_mm_hadd_pd(a,b)); vaddeq(*((__m128d *)c2),_mm_hadd_pd(c,d)); #else vaddeq(*((__m128d *)c1),vadd(_mm_shuffle_pd(a,b,_MM_SHUFFLE2(0,1)), _mm_shuffle_pd(a,b,_MM_SHUFFLE2(1,0)))); vaddeq(*((__m128d *)c2),vadd(_mm_shuffle_pd(c,d,_MM_SHUFFLE2(0,1)), _mm_shuffle_pd(c,d,_MM_SHUFFLE2(1,0)))); #endif #else union {Tv v; complex double c; } u1, u2; #if defined(__SSE3__) u1.v = _mm_hadd_pd(a,b); u2.v=_mm_hadd_pd(c,d); #else u1.v = vadd(_mm_shuffle_pd(a,b,_MM_SHUFFLE2(0,1)), _mm_shuffle_pd(a,b,_MM_SHUFFLE2(1,0))); u2.v = vadd(_mm_shuffle_pd(c,d,_MM_SHUFFLE2(0,1)), _mm_shuffle_pd(c,d,_MM_SHUFFLE2(1,0))); #endif *c1+=u1.c; *c2+=u2.c; #endif } #endif #if (VLEN==4) static inline complex double vhsum_cmplx (Tv a, Tv b) { Tv tmp=_mm256_hadd_pd(a,b); Tv tmp2=_mm256_permute2f128_pd(tmp,tmp,1); tmp=_mm256_add_pd(tmp,tmp2); #ifdef UNSAFE_CODE complex double ret; *((__m128d *)&ret)=_mm256_extractf128_pd(tmp, 0); return ret; #else union {Tv v; complex double c[2]; } u; u.v=tmp; return u.c[0]; #endif } static inline void vhsum_cmplx2 (Tv a, Tv b, Tv c, Tv d, complex double * restrict c1, complex double * restrict c2) { Tv tmp1=_mm256_hadd_pd(a,b), tmp2=_mm256_hadd_pd(c,d); Tv tmp3=_mm256_permute2f128_pd(tmp1,tmp2,49), tmp4=_mm256_permute2f128_pd(tmp1,tmp2,32); tmp1=vadd(tmp3,tmp4); #ifdef UNSAFE_CODE *((__m128d *)c1)=_mm_add_pd(*((__m128d *)c1),_mm256_extractf128_pd(tmp1, 0)); *((__m128d *)c2)=_mm_add_pd(*((__m128d *)c2),_mm256_extractf128_pd(tmp1, 1)); #else union {Tv v; complex double c[2]; } u; u.v=tmp1; *c1+=u.c[0]; *c2+=u.c[1]; #endif } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_geomhelpers.h0000650000175000017530000001447212255154051030077 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_geomhelpers.h * SHARP helper function for the creation of grid geometries * * Copyright (C) 2006-2013 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SHARP_GEOMHELPERS_H #define PLANCK_SHARP_GEOMHELPERS_H #include "sharp_lowlevel.h" #ifdef __cplusplus extern "C" { #endif /*! Creates a geometry information describing a HEALPix map with an Nside parameter \a nside. \a weight contains the relative ring weights and must have \a 2*nside entries. \note if \a weight is a null pointer, all weights are assumed to be 1. \ingroup geominfogroup */ void sharp_make_weighted_healpix_geom_info (int nside, int stride, const double *weight, sharp_geom_info **geom_info); /*! Creates a geometry information describing a HEALPix map with an Nside parameter \a nside. \ingroup geominfogroup */ static inline void sharp_make_healpix_geom_info (int nside, int stride, sharp_geom_info **geom_info) { sharp_make_weighted_healpix_geom_info (nside, stride, NULL, geom_info); } /*! Creates a geometry information describing a Gaussian map with \a nrings iso-latitude rings and \a nphi pixels per ring. The azimuth of the first pixel in each ring is \a phi0 (in radians). The index difference between two adjacent pixels in an iso-latitude ring is \a stride_lon, the index difference between the two start pixels in consecutive iso-latitude rings is \a stride_lat. \ingroup geominfogroup */ void sharp_make_gauss_geom_info (int nrings, int nphi, double phi0, int stride_lon, int stride_lat, sharp_geom_info **geom_info); /*! Creates a geometry information describing an ECP map with \a nrings iso-latitude rings and \a nphi pixels per ring. The azimuth of the first pixel in each ring is \a phi0 (in radians). The index difference between two adjacent pixels in an iso-latitude ring is \a stride_lon, the index difference between the two start pixels in consecutive iso-latitude rings is \a stride_lat. \note The spacing of pixel centers is equidistant in colatitude and longitude. \note The sphere is pixelized in a way that the colatitude of the first ring is \a 0.5*(pi/nrings) and the colatitude of the last ring is \a pi-0.5*(pi/nrings). There are no pixel centers at the poles. \note This grid corresponds to Fejer's first rule. \ingroup geominfogroup */ void sharp_make_fejer1_geom_info (int nrings, int nphi, double phi0, int stride_lon, int stride_lat, sharp_geom_info **geom_info); /*! Old name for sharp_make_fejer1_geom_info() \ingroup geominfogroup */ static inline void sharp_make_ecp_geom_info (int nrings, int nphi, double phi0, int stride_lon, int stride_lat, sharp_geom_info **geom_info) { sharp_make_fejer1_geom_info (nrings, nphi, phi0, stride_lon, stride_lat, geom_info); } /*! Creates a geometry information describing an ECP map with \a nrings iso-latitude rings and \a nphi pixels per ring. The azimuth of the first pixel in each ring is \a phi0 (in radians). The index difference between two adjacent pixels in an iso-latitude ring is \a stride_lon, the index difference between the two start pixels in consecutive iso-latitude rings is \a stride_lat. \note The spacing of pixel centers is equidistant in colatitude and longitude. \note The sphere is pixelized in a way that the colatitude of the first ring is \a 0 and that of the last ring is \a pi. \note This grid corresponds to Clenshaw-Curtis integration. \ingroup geominfogroup */ void sharp_make_cc_geom_info (int nrings, int ppring, double phi0, int stride_lon, int stride_lat, sharp_geom_info **geom_info); /*! Creates a geometry information describing an ECP map with \a nrings iso-latitude rings and \a nphi pixels per ring. The azimuth of the first pixel in each ring is \a phi0 (in radians). The index difference between two adjacent pixels in an iso-latitude ring is \a stride_lon, the index difference between the two start pixels in consecutive iso-latitude rings is \a stride_lat. \note The spacing of pixel centers is equidistant in colatitude and longitude. \note The sphere is pixelized in a way that the colatitude of the first ring is \a pi/(nrings+1) and that of the last ring is \a pi-pi/(nrings+1). \note This grid corresponds to Fejer's second rule. \ingroup geominfogroup */ void sharp_make_fejer2_geom_info (int nrings, int ppring, double phi0, int stride_lon, int stride_lat, sharp_geom_info **geom_info); /*! Creates a geometry information describing a map with \a nrings iso-latitude rings and \a nphi pixels per ring. The azimuth of the first pixel in each ring is \a phi0 (in radians). The index difference between two adjacent pixels in an iso-latitude ring is \a stride_lon, the index difference between the two start pixels in consecutive iso-latitude rings is \a stride_lat. \note The spacing of pixel centers is equidistant in colatitude and longitude. \note The sphere is pixelized in a way that the colatitude of the first ring is \a pi/(2*nrings-1) and that of the last ring is \a pi. \note This is the grid introduced by McEwen & Wiaux 2011. \note This function does \e not define any quadrature weights. \ingroup geominfogroup */ void sharp_make_mw_geom_info (int nrings, int ppring, double phi0, int stride_lon, int stride_lat, sharp_geom_info **geom_info); #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_core_inc2.c0000650000175000017530000006461012255154051027422 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_core_inc2.c * Type-dependent code for the computational core * * Copyright (C) 2012-2013 Max-Planck-Society * \author Martin Reinecke */ static void Z(alm2map_kernel) (const Tb cth, Y(Tbri) * restrict p1, Y(Tbri) * restrict p2, Tb lam_1, Tb lam_2, const sharp_ylmgen_dbl2 * restrict rf, const dcmplx * restrict alm, int l, int lmax NJ1) { if (njobs>1) { while (llmax; Tb lam_1,lam_2,scale; Y(iter_to_ieee) (sth,cth,&l,&lam_1,&lam_2,&scale,gen); job->opcnt += (l-gen->m) * 4*VLEN*nvec; if (l>lmax) return; job->opcnt += (lmax+1-l) * (4+4*njobs)*VLEN*nvec; Tb corfac; Y(getCorfac)(scale,&corfac,gen->cf); const sharp_ylmgen_dbl2 * restrict rf = gen->rf; const dcmplx * restrict alm=job->almtmp; int full_ieee = Y(TballGe)(scale,sharp_minscale); while (!full_ieee) { for (int j=0; jlmax) break; Tv r0=vload(rf[l-1].f[0]),r1=vload(rf[l-1].f[1]); for (int i=0; ilmax) break; r0=vload(rf[l-1].f[0]); r1=vload(rf[l-1].f[1]); for (int i=0; icf); full_ieee = Y(TballGe)(scale,sharp_minscale); } } if (l>lmax) return; Y(Tbmuleq)(&lam_1,corfac); Y(Tbmuleq)(&lam_2,corfac); Z(alm2map_kernel) (cth, p1, p2, lam_1, lam_2, rf, alm, l, lmax NJ2); } static void Z(calc_map2alm) (const Tb cth, const Tb sth, const sharp_Ylmgen_C *gen, sharp_job *job, const Y(Tbri) * restrict p1, const Y(Tbri) * restrict p2 NJ1) { int lmax=gen->lmax; Tb lam_1,lam_2,scale; int l=gen->m; Y(iter_to_ieee) (sth,cth,&l,&lam_1,&lam_2,&scale,gen); job->opcnt += (l-gen->m) * 4*VLEN*nvec; if (l>lmax) return; job->opcnt += (lmax+1-l) * (4+4*njobs)*VLEN*nvec; const sharp_ylmgen_dbl2 * restrict rf = gen->rf; Tb corfac; Y(getCorfac)(scale,&corfac,gen->cf); dcmplx * restrict alm=job->almtmp; int full_ieee = Y(TballGe)(scale,sharp_minscale); while (!full_ieee) { for (int j=0; jlmax) return; Tv r0=vload(rf[l-1].f[0]),r1=vload(rf[l-1].f[1]); for (int i=0; ilmax) return; r0=vload(rf[l-1].f[0]); r1=vload(rf[l-1].f[1]); for (int i=0; icf); full_ieee = Y(TballGe)(scale,sharp_minscale); } } Y(Tbmuleq)(&lam_1,corfac); Y(Tbmuleq)(&lam_2,corfac); Z(map2alm_kernel) (cth, p1, p2, lam_1, lam_2, rf, alm, l, lmax NJ2); } static inline void Z(saddstep) (Y(Tbqu) * restrict px, Y(Tbqu) * restrict py, const Tb rxp, const Tb rxm, const dcmplx * restrict alm NJ1) { for (int j=0; jv[i],rxm->v[i]); vfmaeq(agr,px[j].qr.v[i],lw); vfmaeq(agi,px[j].qi.v[i],lw); vfmaeq(acr,px[j].ur.v[i],lw); vfmaeq(aci,px[j].ui.v[i],lw); } for (int i=0; iv[i],rxp->v[i]); vfmseq(agr,py[j].ui.v[i],lx); vfmaeq(agi,py[j].ur.v[i],lx); vfmaeq(acr,py[j].qi.v[i],lx); vfmseq(aci,py[j].qr.v[i],lx); } vhsum_cmplx2(agr,agi,acr,aci,&alm[2*j],&alm[2*j+1]); } } static void Z(alm2map_spin_kernel) (Tb cth, Y(Tbqu) * restrict p1, Y(Tbqu) * restrict p2, Tb rec1p, Tb rec1m, Tb rec2p, Tb rec2m, const sharp_ylmgen_dbl3 * restrict fx, const dcmplx * restrict alm, int l, int lmax NJ1) { while (llmax; Tb rec1p, rec1m, rec2p, rec2m, scalem, scalep; Y(iter_to_ieee_spin) (cth,sth,&l,&rec1p,&rec1m,&rec2p,&rec2m,&scalep,&scalem,gen); job->opcnt += (l-gen->m) * 10*VLEN*nvec; if (l>lmax) return; job->opcnt += (lmax+1-l) * (12+16*njobs)*VLEN*nvec; const sharp_ylmgen_dbl3 * restrict fx = gen->fx; Tb corfacp,corfacm; Y(getCorfac)(scalep,&corfacp,gen->cf); Y(getCorfac)(scalem,&corfacm,gen->cf); const dcmplx * restrict alm=job->almtmp; int full_ieee = Y(TballGe)(scalep,sharp_minscale) && Y(TballGe)(scalem,sharp_minscale); while (!full_ieee) { Z(saddstep)(p1, p2, Y(Tbprod)(rec2p,corfacp), Y(Tbprod)(rec2m,corfacm), &alm[2*njobs*l] NJ2); if (++l>lmax) break; Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l]); Z(saddstep)(p2, p1, Y(Tbprod)(rec1p,corfacp), Y(Tbprod)(rec1m,corfacm), &alm[2*njobs*l] NJ2); if (++l>lmax) break; Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l]); if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) { Y(getCorfac)(scalep,&corfacp,gen->cf); Y(getCorfac)(scalem,&corfacm,gen->cf); full_ieee = Y(TballGe)(scalep,sharp_minscale) && Y(TballGe)(scalem,sharp_minscale); } } if (l>lmax) return; Y(Tbmuleq)(&rec1p,corfacp); Y(Tbmuleq)(&rec2p,corfacp); Y(Tbmuleq)(&rec1m,corfacm); Y(Tbmuleq)(&rec2m,corfacm); Z(alm2map_spin_kernel) (cth, p1, p2, rec1p, rec1m, rec2p, rec2m, fx, alm, l, lmax NJ2); } static void Z(calc_map2alm_spin) (Tb cth, Tb sth, const sharp_Ylmgen_C * restrict gen, sharp_job *job, const Y(Tbqu) * restrict p1, const Y(Tbqu) * restrict p2 NJ1) { int l, lmax=gen->lmax; Tb rec1p, rec1m, rec2p, rec2m, scalem, scalep; Y(iter_to_ieee_spin) (cth,sth,&l,&rec1p,&rec1m,&rec2p,&rec2m,&scalep,&scalem,gen); job->opcnt += (l-gen->m) * 10*VLEN*nvec; if (l>lmax) return; job->opcnt += (lmax+1-l) * (12+16*njobs)*VLEN*nvec; const sharp_ylmgen_dbl3 * restrict fx = gen->fx; Tb corfacp,corfacm; Y(getCorfac)(scalep,&corfacp,gen->cf); Y(getCorfac)(scalem,&corfacm,gen->cf); dcmplx * restrict alm=job->almtmp; int full_ieee = Y(TballGe)(scalep,sharp_minscale) && Y(TballGe)(scalem,sharp_minscale); while (!full_ieee) { Tb t1=Y(Tbprod)(rec2p,corfacp), t2=Y(Tbprod)(rec2m,corfacm); Z(saddstep2)(p1, p2, &t1, &t2, &alm[2*njobs*l] NJ2); if (++l>lmax) return; Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l]); t1=Y(Tbprod)(rec1p,corfacp); t2=Y(Tbprod)(rec1m,corfacm); Z(saddstep2)(p2, p1, &t1, &t2, &alm[2*njobs*l] NJ2); if (++l>lmax) return; Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l]); if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) { Y(getCorfac)(scalep,&corfacp,gen->cf); Y(getCorfac)(scalem,&corfacm,gen->cf); full_ieee = Y(TballGe)(scalep,sharp_minscale) && Y(TballGe)(scalem,sharp_minscale); } } Y(Tbmuleq)(&rec1p,corfacp); Y(Tbmuleq)(&rec2p,corfacp); Y(Tbmuleq)(&rec1m,corfacm); Y(Tbmuleq)(&rec2m,corfacm); Z(map2alm_spin_kernel)(cth,p1,p2,rec1p,rec1m,rec2p,rec2m,fx,alm,l,lmax NJ2); } static inline void Z(saddstep_d) (Y(Tbqu) * restrict px, Y(Tbqu) * restrict py, const Tb rxp, const Tb rxm, const dcmplx * restrict alm NJ1) { for (int j=0; jlmax; Tb rec1p, rec1m, rec2p, rec2m, scalem, scalep; Y(iter_to_ieee_spin) (cth,sth,&l,&rec1p,&rec1m,&rec2p,&rec2m,&scalep,&scalem,gen); job->opcnt += (l-gen->m) * 10*VLEN*nvec; if (l>lmax) return; job->opcnt += (lmax+1-l) * (12+8*njobs)*VLEN*nvec; const sharp_ylmgen_dbl3 * restrict fx = gen->fx; Tb corfacp,corfacm; Y(getCorfac)(scalep,&corfacp,gen->cf); Y(getCorfac)(scalem,&corfacm,gen->cf); const dcmplx * restrict alm=job->almtmp; int full_ieee = Y(TballGe)(scalep,sharp_minscale) && Y(TballGe)(scalem,sharp_minscale); while (!full_ieee) { Z(saddstep_d)(p1, p2, Y(Tbprod)(rec2p,corfacp), Y(Tbprod)(rec2m,corfacm), &alm[njobs*l] NJ2); if (++l>lmax) break; Y(rec_step)(&rec1p,&rec1m,&rec2p,&rec2m,cth,fx[l]); Z(saddstep_d)(p2, p1, Y(Tbprod)(rec1p,corfacp), Y(Tbprod)(rec1m,corfacm), &alm[njobs*l] NJ2); if (++l>lmax) break; Y(rec_step)(&rec2p,&rec2m,&rec1p,&rec1m,cth,fx[l]); if (Y(rescale)(&rec1p,&rec2p,&scalep) | Y(rescale)(&rec1m,&rec2m,&scalem)) { Y(getCorfac)(scalep,&corfacp,gen->cf); Y(getCorfac)(scalem,&corfacm,gen->cf); full_ieee = Y(TballGe)(scalep,sharp_minscale) && Y(TballGe)(scalem,sharp_minscale); } } if (l>lmax) return; Y(Tbmuleq)(&rec1p,corfacp); Y(Tbmuleq)(&rec2p,corfacp); Y(Tbmuleq)(&rec1m,corfacm); Y(Tbmuleq)(&rec2m,corfacm); Z(alm2map_deriv1_kernel) (cth, p1, p2, rec1p, rec1m, rec2p, rec2m, fx, alm, l, lmax NJ2); } #define VZERO(var) do { memset(&(var),0,sizeof(var)); } while(0) static void Z(inner_loop) (sharp_job *job, const int *ispair, const double *cth_, const double *sth_, int llim, int ulim, sharp_Ylmgen_C *gen, int mi, const int *mlim NJ1) { const int nval=nvec*VLEN; const int m = job->ainfo->mval[mi]; sharp_Ylmgen_prepare (gen, m); switch (job->type) { case SHARP_ALM2MAP: case SHARP_ALM2MAP_DERIV1: { if (job->spin==0) { for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; if (mlim[itot]>=m) skip=0; cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; } if (!skip) Z(calc_alm2map) (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); for (int i=0; is_th + mi*job->s_m + 2*j; complex double r1 = p1[j].s.r[i] + p1[j].s.i[i]*_Complex_I, r2 = p2[j].s.r[i] + p2[j].s.i[i]*_Complex_I; job->phase[phas_idx] = r1+r2; if (ispair[itot]) job->phase[phas_idx+1] = r1-r2; } } } } } else { for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; if (mlim[itot]>=m) skip=0; cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; } if (!skip) (job->type==SHARP_ALM2MAP) ? Z(calc_alm2map_spin ) (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2) : Z(calc_alm2map_deriv1) (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); for (int i=0; is_th + mi*job->s_m + 4*j; complex double q1 = p1[j].s.qr[i] + p1[j].s.qi[i]*_Complex_I, q2 = p2[j].s.qr[i] + p2[j].s.qi[i]*_Complex_I, u1 = p1[j].s.ur[i] + p1[j].s.ui[i]*_Complex_I, u2 = p2[j].s.ur[i] + p2[j].s.ui[i]*_Complex_I; job->phase[phas_idx] = q1+q2; job->phase[phas_idx+2] = u1+u2; if (ispair[itot]) { dcmplx *phQ = &(job->phase[phas_idx+1]), *phU = &(job->phase[phas_idx+3]); *phQ = q1-q2; *phU = u1-u2; if ((gen->mhi-gen->m+gen->s)&1) { *phQ=-(*phQ); *phU=-(*phU); } } } } } } } break; } case SHARP_MAP2ALM: { if (job->spin==0) { for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; if (mlim[itot]>=m) skip=0; cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; if ((i+ith=m)) { for (int j=0; js_th + mi*job->s_m + 2*j; dcmplx ph1=job->phase[phas_idx]; dcmplx ph2=ispair[itot] ? job->phase[phas_idx+1] : 0.; p1[j].s.r[i]=creal(ph1+ph2); p1[j].s.i[i]=cimag(ph1+ph2); p2[j].s.r[i]=creal(ph1-ph2); p2[j].s.i[i]=cimag(ph1-ph2); } } } if (!skip) Z(calc_map2alm)(cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); } } else { for (int ith=0; ith=ulim-llim) itot=ulim-llim-1; if (mlim[itot]>=m) skip=0; cth.s[i]=cth_[itot]; sth.s[i]=sth_[itot]; if (i+iths_th + mi*job->s_m + 4*j; dcmplx p1Q=job->phase[phas_idx], p1U=job->phase[phas_idx+2], p2Q=ispair[itot] ? job->phase[phas_idx+1]:0., p2U=ispair[itot] ? job->phase[phas_idx+3]:0.; if ((gen->mhi-gen->m+gen->s)&1) { p2Q=-p2Q; p2U=-p2U; } p1[j].s.qr[i]=creal(p1Q+p2Q); p1[j].s.qi[i]=cimag(p1Q+p2Q); p1[j].s.ur[i]=creal(p1U+p2U); p1[j].s.ui[i]=cimag(p1U+p2U); p2[j].s.qr[i]=creal(p1Q-p2Q); p2[j].s.qi[i]=cimag(p1Q-p2Q); p2[j].s.ur[i]=creal(p1U-p2U); p2[j].s.ui[i]=cimag(p1U-p2U); } } } if (!skip) Z(calc_map2alm_spin) (cth.b,sth.b,gen,job,&p1[0].b,&p2[0].b NJ2); } } break; } default: { UTIL_FAIL("must not happen"); break; } } } #undef VZERO healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_internal.h0000650000175000017530000000353412255154051027376 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_internal.h * Internally used functionality for the spherical transform library. * * Copyright (C) 2006-2013 Max-Planck-Society * \author Martin Reinecke \author Dag Sverre Seljebotn */ #ifndef PLANCK_SHARP_INTERNAL_H #define PLANCK_SHARP_INTERNAL_H #ifdef __cplusplus #error This header file cannot be included from C++, only from C #endif #include "sharp.h" #define SHARP_MAXTRANS 1 typedef struct { sharp_jobtype type; int spin; int nmaps, nalm; int flags; void **map; void **alm; int s_m, s_th; // strides in m and theta direction complex double *phase; double *norm_l; complex double *almtmp; const sharp_geom_info *ginfo; const sharp_alm_info *ainfo; double time; int ntrans; unsigned long long opcnt; } sharp_job; int sharp_get_nv_max (void); int sharp_nv_oracle (sharp_jobtype type, int spin, int ntrans); int sharp_get_mlim (int lmax, int spin, double sth, double cth); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_cxx.h0000650000175000017530000001123312255154051026357 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_cxx.h * Spherical transform library * * Copyright (C) 2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SHARP_CXX_H #define PLANCK_SHARP_CXX_H #include "sharp_lowlevel.h" #include "sharp_geomhelpers.h" #include "sharp_almhelpers.h" class sharp_base { protected: sharp_alm_info *ainfo; sharp_geom_info *ginfo; public: sharp_base() : ainfo(0), ginfo(0) {} ~sharp_base() { sharp_destroy_geom_info(ginfo); sharp_destroy_alm_info(ainfo); } void set_general_geometry (int nrings, const int *nph, const ptrdiff_t *ofs, const int *stride, const double *phi0, const double *theta, const double *wgt) { if (ginfo) sharp_destroy_geom_info(ginfo); sharp_make_geom_info (nrings, nph, ofs, stride, phi0, theta, wgt, &ginfo); } void set_ECP_geometry (int nrings, int nphi) { if (ginfo) sharp_destroy_geom_info(ginfo); sharp_make_ecp_geom_info (nrings, nphi, 0., 1, nphi, &ginfo); } void set_Gauss_geometry (int nrings, int nphi) { if (ginfo) sharp_destroy_geom_info(ginfo); sharp_make_gauss_geom_info (nrings, nphi, 0., 1, nphi, &ginfo); } void set_Healpix_geometry (int nside) { if (ginfo) sharp_destroy_geom_info(ginfo); sharp_make_healpix_geom_info (nside, 1, &ginfo); } void set_weighted_Healpix_geometry (int nside, const double *weight) { if (ginfo) sharp_destroy_geom_info(ginfo); sharp_make_weighted_healpix_geom_info (nside, 1, weight, &ginfo); } void set_triangular_alm_info (int lmax, int mmax) { if (ainfo) sharp_destroy_alm_info(ainfo); sharp_make_triangular_alm_info (lmax, mmax, 1, &ainfo); } }; template struct cxxjobhelper__ {}; template<> struct cxxjobhelper__ { enum {val=SHARP_DP}; }; template<> struct cxxjobhelper__ { enum {val=0}; }; template class sharp_cxxjob: public sharp_base { private: static void *conv (T *ptr) { return reinterpret_cast(ptr); } static void *conv (const T *ptr) { return const_cast(reinterpret_cast(ptr)); } public: void alm2map (const T *alm, T *map, bool add) { void *aptr=conv(alm), *mptr=conv(map); int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); sharp_execute (SHARP_ALM2MAP, 0, &aptr, &mptr, ginfo, ainfo, 1, flags,0,0); } void alm2map_spin (const T *alm1, const T *alm2, T *map1, T *map2, int spin, bool add) { void *aptr[2], *mptr[2]; aptr[0]=conv(alm1); aptr[1]=conv(alm2); mptr[0]=conv(map1); mptr[1]=conv(map2); int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); sharp_execute (SHARP_ALM2MAP,spin,aptr,mptr,ginfo,ainfo,1,flags,0,0); } void alm2map_der1 (const T *alm, T *map1, T *map2, bool add) { void *aptr=conv(alm), *mptr[2]; mptr[0]=conv(map1); mptr[1]=conv(map2); int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); sharp_execute (SHARP_ALM2MAP_DERIV1,1,&aptr,mptr,ginfo,ainfo,1,flags,0,0); } void map2alm (const T *map, T *alm, bool add) { void *aptr=conv(alm), *mptr=conv(map); int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); sharp_execute (SHARP_MAP2ALM,0,&aptr,&mptr,ginfo,ainfo,1,flags,0,0); } void map2alm_spin (const T *map1, const T *map2, T *alm1, T *alm2, int spin, bool add) { void *aptr[2], *mptr[2]; aptr[0]=conv(alm1); aptr[1]=conv(alm2); mptr[0]=conv(map1); mptr[1]=conv(map2); int flags=cxxjobhelper__::val | (add ? SHARP_ADD : 0); sharp_execute (SHARP_MAP2ALM,spin,aptr,mptr,ginfo,ainfo,1,flags,0,0); } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libsharp/sharp_core.h0000650000175000017530000000263012255154051026506 0ustar zoncaplanck00000000000000/* * This file is part of libsharp. * * libsharp 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 2 of the License, or * (at your option) any later version. * * libsharp 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 libsharp; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libsharp is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sharp_core.h * Interface for the computational core * * Copyright (C) 2012-2013 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SHARP_CORE_H #define PLANCK_SHARP_CORE_H #include "sharp_internal.h" #include "sharp_ylmgen_c.h" #ifdef __cplusplus extern "C" { #endif void inner_loop (sharp_job *job, const int *ispair,const double *cth, const double *sth, int llim, int ulim, sharp_Ylmgen_C *gen, int mi, const int *mlim); #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/compile0000755000175000017500000001624512346122572023637 0ustar zoncazonca00000000000000#! /bin/sh # Wrapper for compilers which do not understand '-c -o'. scriptversion=2012-10-14.11; # UTC # Copyright (C) 1999-2013 Free Software Foundation, Inc. # Written by Tom Tromey . # # 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 2, 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 file is maintained in Automake, please report # bugs to or send patches to # . nl=' ' # We need space, tab and new line, in precisely that order. Quoting is # there to prevent tools from complaining about whitespace usage. IFS=" "" $nl" file_conv= # func_file_conv build_file lazy # Convert a $build file to $host form and store it in $file # Currently only supports Windows hosts. If the determined conversion # type is listed in (the comma separated) LAZY, no conversion will # take place. func_file_conv () { file=$1 case $file in / | /[!/]*) # absolute file, and not a UNC file if test -z "$file_conv"; then # lazily determine how to convert abs files case `uname -s` in MINGW*) file_conv=mingw ;; CYGWIN*) file_conv=cygwin ;; *) file_conv=wine ;; esac fi case $file_conv/,$2, in *,$file_conv,*) ;; mingw/*) file=`cmd //C echo "$file " | sed -e 's/"\(.*\) " *$/\1/'` ;; cygwin/*) file=`cygpath -m "$file" || echo "$file"` ;; wine/*) file=`winepath -w "$file" || echo "$file"` ;; esac ;; esac } # func_cl_dashL linkdir # Make cl look for libraries in LINKDIR func_cl_dashL () { func_file_conv "$1" if test -z "$lib_path"; then lib_path=$file else lib_path="$lib_path;$file" fi linker_opts="$linker_opts -LIBPATH:$file" } # func_cl_dashl library # Do a library search-path lookup for cl func_cl_dashl () { lib=$1 found=no save_IFS=$IFS IFS=';' for dir in $lib_path $LIB do IFS=$save_IFS if $shared && test -f "$dir/$lib.dll.lib"; then found=yes lib=$dir/$lib.dll.lib break fi if test -f "$dir/$lib.lib"; then found=yes lib=$dir/$lib.lib break fi if test -f "$dir/lib$lib.a"; then found=yes lib=$dir/lib$lib.a break fi done IFS=$save_IFS if test "$found" != yes; then lib=$lib.lib fi } # func_cl_wrapper cl arg... # Adjust compile command to suit cl func_cl_wrapper () { # Assume a capable shell lib_path= shared=: linker_opts= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. eat=1 case $2 in *.o | *.[oO][bB][jJ]) func_file_conv "$2" set x "$@" -Fo"$file" shift ;; *) func_file_conv "$2" set x "$@" -Fe"$file" shift ;; esac ;; -I) eat=1 func_file_conv "$2" mingw set x "$@" -I"$file" shift ;; -I*) func_file_conv "${1#-I}" mingw set x "$@" -I"$file" shift ;; -l) eat=1 func_cl_dashl "$2" set x "$@" "$lib" shift ;; -l*) func_cl_dashl "${1#-l}" set x "$@" "$lib" shift ;; -L) eat=1 func_cl_dashL "$2" ;; -L*) func_cl_dashL "${1#-L}" ;; -static) shared=false ;; -Wl,*) arg=${1#-Wl,} save_ifs="$IFS"; IFS=',' for flag in $arg; do IFS="$save_ifs" linker_opts="$linker_opts $flag" done IFS="$save_ifs" ;; -Xlinker) eat=1 linker_opts="$linker_opts $2" ;; -*) set x "$@" "$1" shift ;; *.cc | *.CC | *.cxx | *.CXX | *.[cC]++) func_file_conv "$1" set x "$@" -Tp"$file" shift ;; *.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO]) func_file_conv "$1" mingw set x "$@" "$file" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -n "$linker_opts"; then linker_opts="-link$linker_opts" fi exec "$@" $linker_opts exit 1 } eat= case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: compile [--help] [--version] PROGRAM [ARGS] Wrapper for compilers which do not understand '-c -o'. Remove '-o dest.o' from ARGS, run PROGRAM with the remaining arguments, and rename the output as expected. If you are trying to build a whole package this is not the right script to run: please start by reading the file 'INSTALL'. Report bugs to . EOF exit $? ;; -v | --v*) echo "compile $scriptversion" exit $? ;; cl | *[/\\]cl | cl.exe | *[/\\]cl.exe ) func_cl_wrapper "$@" # Doesn't return... ;; esac ofile= cfile= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. # So we strip '-o arg' only if arg is an object. eat=1 case $2 in *.o | *.obj) ofile=$2 ;; *) set x "$@" -o "$2" shift ;; esac ;; *.c) cfile=$1 set x "$@" "$1" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -z "$ofile" || test -z "$cfile"; then # If no '-o' option was seen then we might have been invoked from a # pattern rule where we don't need one. That is ok -- this is a # normal compilation that the losing compiler can handle. If no # '.c' file was seen then we are probably linking. That is also # ok. exec "$@" fi # Name of file we expect compiler to create. cofile=`echo "$cfile" | sed 's|^.*[\\/]||; s|^[a-zA-Z]:||; s/\.c$/.o/'` # Create the lock directory. # Note: use '[/\\:.-]' here to ensure that we don't use the same name # that we are using for the .o file. Also, base the name on the expected # object file name, since that is what matters with a parallel build. lockdir=`echo "$cofile" | sed -e 's|[/\\:.-]|_|g'`.d while true; do if mkdir "$lockdir" >/dev/null 2>&1; then break fi sleep 1 done # FIXME: race condition here if user kills between mkdir and trap. trap "rmdir '$lockdir'; exit 1" 1 2 15 # Run the compile. "$@" ret=$? if test -f "$cofile"; then test "$cofile" = "$ofile" || mv "$cofile" "$ofile" elif test -f "${cofile}bj"; then test "${cofile}bj" = "$ofile" || mv "${cofile}bj" "$ofile" fi rmdir "$lockdir" exit $ret # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/0000755000175000017500000000000012351601662024354 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/ls_fft.c0000650000175000017530000001546612255154051026145 0ustar zoncaplanck00000000000000/* * This file is part of libfftpack. * * libfftpack 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 2 of the License, or * (at your option) any later version. * * libfftpack 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 libfftpack; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2005 Max-Planck-Society * \author Martin Reinecke */ #include #include #include #include "bluestein.h" #include "fftpack.h" #include "ls_fft.h" complex_plan make_complex_plan (size_t length) { complex_plan plan = RALLOC(complex_plan_i,1); size_t pfsum = prime_factor_sum(length); double comp1 = (double)(length*pfsum); double comp2 = 2*3*length*log(3.*length); comp2*=3.; /* fudge factor that appears to give good overall performance */ plan->length=length; plan->bluestein = (comp2bluestein) bluestein_i (length,&(plan->work),&(plan->worksize)); else { plan->worksize=4*length+15; plan->work=RALLOC(double,4*length+15); cffti(length, plan->work); } return plan; } complex_plan copy_complex_plan (complex_plan plan) { if (!plan) return NULL; { complex_plan newplan = RALLOC(complex_plan_i,1); *newplan = *plan; newplan->work=RALLOC(double,newplan->worksize); memcpy(newplan->work,plan->work,sizeof(double)*newplan->worksize); return newplan; } } void kill_complex_plan (complex_plan plan) { DEALLOC(plan->work); DEALLOC(plan); } void complex_plan_forward (complex_plan plan, double *data) { if (plan->bluestein) bluestein (plan->length, data, plan->work, -1); else cfftf (plan->length, data, plan->work); } void complex_plan_backward (complex_plan plan, double *data) { if (plan->bluestein) bluestein (plan->length, data, plan->work, 1); else cfftb (plan->length, data, plan->work); } real_plan make_real_plan (size_t length) { real_plan plan = RALLOC(real_plan_i,1); size_t pfsum = prime_factor_sum(length); double comp1 = .5*length*pfsum; double comp2 = 2*3*length*log(3.*length); comp2*=3; /* fudge factor that appears to give good overall performance */ plan->length=length; plan->bluestein = (comp2bluestein) bluestein_i (length,&(plan->work),&(plan->worksize)); else { plan->worksize=2*length+15; plan->work=RALLOC(double,2*length+15); rffti(length, plan->work); } return plan; } real_plan copy_real_plan (real_plan plan) { if (!plan) return NULL; { real_plan newplan = RALLOC(real_plan_i,1); *newplan = *plan; newplan->work=RALLOC(double,newplan->worksize); memcpy(newplan->work,plan->work,sizeof(double)*newplan->worksize); return newplan; } } void kill_real_plan (real_plan plan) { DEALLOC(plan->work); DEALLOC(plan); } void real_plan_forward_fftpack (real_plan plan, double *data) { if (plan->bluestein) { size_t m; size_t n=plan->length; double *tmp = RALLOC(double,2*n); for (m=0; mwork,-1); data[0] = tmp[0]; memcpy (data+1, tmp+2, (n-1)*sizeof(double)); DEALLOC(tmp); } else rfftf (plan->length, data, plan->work); } static void fftpack2halfcomplex (double *data, size_t n) { size_t m; double *tmp = RALLOC(double,n); tmp[0]=data[0]; for (m=1; m<(n+1)/2; ++m) { tmp[m]=data[2*m-1]; tmp[n-m]=data[2*m]; } if (!(n&1)) tmp[n/2]=data[n-1]; memcpy (data,tmp,n*sizeof(double)); DEALLOC(tmp); } static void halfcomplex2fftpack (double *data, size_t n) { size_t m; double *tmp = RALLOC(double,n); tmp[0]=data[0]; for (m=1; m<(n+1)/2; ++m) { tmp[2*m-1]=data[m]; tmp[2*m]=data[n-m]; } if (!(n&1)) tmp[n-1]=data[n/2]; memcpy (data,tmp,n*sizeof(double)); DEALLOC(tmp); } void real_plan_forward_fftw (real_plan plan, double *data) { real_plan_forward_fftpack (plan, data); fftpack2halfcomplex (data,plan->length); } void real_plan_backward_fftpack (real_plan plan, double *data) { if (plan->bluestein) { size_t m; size_t n=plan->length; double *tmp = RALLOC(double,2*n); tmp[0]=data[0]; tmp[1]=0.; memcpy (tmp+2,data+1, (n-1)*sizeof(double)); if ((n&1)==0) tmp[n+1]=0.; for (m=2; mwork, 1); for (m=0; mlength, data, plan->work); } void real_plan_backward_fftw (real_plan plan, double *data) { halfcomplex2fftpack (data,plan->length); real_plan_backward_fftpack (plan, data); } void real_plan_forward_c (real_plan plan, double *data) { size_t m; size_t n=plan->length; if (plan->bluestein) { for (m=1; m<2*n; m+=2) data[m]=0; bluestein (plan->length, data, plan->work, -1); data[1]=0; for (m=2; mwork); data[0] = data[1]; data[1] = 0; for (m=2; mlength; if (plan->bluestein) { size_t m; data[1]=0; for (m=2; mlength, data, plan->work, 1); for (m=1; m<2*n; m+=2) data[m]=0; } else { ptrdiff_t m; data[1] = data[0]; rfftb (n, data+1, plan->work); for (m=n-1; m>=0; --m) { data[2*m] = data[m+1]; data[2*m+1] = 0.; } } } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/libfftpack.dox0000650000175000017530000000014612255154051027332 0ustar zoncaplanck00000000000000/*! \mainpage Libfftpack documentation
    • \ref fftgroup "Programming interface"
    */ healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/ls_fft.h0000650000175000017530000001442312255154051026142 0ustar zoncaplanck00000000000000/* * This file is part of libfftpack. * * libfftpack 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 2 of the License, or * (at your option) any later version. * * libfftpack 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 libfftpack; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file ls_fft.h * Interface for the LevelS FFT package. * * Copyright (C) 2004 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_LS_FFT_H #define PLANCK_LS_FFT_H #include "c_utils.h" #ifdef __cplusplus extern "C" { #endif /*!\defgroup fftgroup FFT interface This package is intended to calculate one-dimensional real or complex FFTs with high accuracy and good efficiency even for lengths containing large prime factors. The code is written in C, but a Fortran wrapper exists as well. Before any FFT is executed, a plan must be generated for it. Plan creation is designed to be fast, so that there is no significant overhead if the plan is only used once or a few times. The main component of the code is based on Paul N. Swarztrauber's FFTPACK in the double precision incarnation by Hugh C. Pumphrey (http://www.netlib.org/fftpack/dp.tgz). I replaced the iterative sine and cosine calculations in radfg() and radbg() by an exact calculation, which slightly improves the transform accuracy for real FFTs with lengths containing large prime factors. Since FFTPACK becomes quite slow for FFT lengths with large prime factors (in the worst case of prime lengths it reaches \f$\mathcal{O}(n^2)\f$ complexity), I implemented Bluestein's algorithm, which computes a FFT of length \f$n\f$ by several FFTs of length \f$n_2\ge 2n-1\f$ and a convolution. Since \f$n_2\f$ can be chosen to be highly composite, this algorithm is more efficient if \f$n\f$ has large prime factors. The longer FFTs themselves are then computed using the FFTPACK routines. Bluestein's algorithm was implemented according to the description on Wikipedia ( http://en.wikipedia.org/wiki/Bluestein%27s_FFT_algorithm). \b Thread-safety: All routines can be called concurrently; all information needed by ls_fft is stored in the plan variable. However, using the same plan variable on multiple threads simultaneously is not supported and will lead to data corruption. */ /*! \{ */ typedef struct { double *work; size_t length, worksize; int bluestein; } complex_plan_i; /*! The opaque handle type for complex-FFT plans. */ typedef complex_plan_i * complex_plan; /*! Returns a plan for a complex FFT with \a length elements. */ complex_plan make_complex_plan (size_t length); /*! Constructs a copy of \a plan. */ complex_plan copy_complex_plan (complex_plan plan); /*! Destroys a plan for a complex FFT. */ void kill_complex_plan (complex_plan plan); /*! Computes a complex forward FFT on \a data, using \a plan. \a Data has the form r0, i0, r1, i1, ..., r[length-1], i[length-1]. */ void complex_plan_forward (complex_plan plan, double *data); /*! Computes a complex backward FFT on \a data, using \a plan. \a Data has the form r0, i0, r1, i1, ..., r[length-1], i[length-1]. */ void complex_plan_backward (complex_plan plan, double *data); typedef struct { double *work; size_t length, worksize; int bluestein; } real_plan_i; /*! The opaque handle type for real-FFT plans. */ typedef real_plan_i * real_plan; /*! Returns a plan for a real FFT with \a length elements. */ real_plan make_real_plan (size_t length); /*! Constructs a copy of \a plan. */ real_plan copy_real_plan (real_plan plan); /*! Destroys a plan for a real FFT. */ void kill_real_plan (real_plan plan); /*! Computes a real forward FFT on \a data, using \a plan and assuming the FFTPACK storage scheme: - on entry, \a data has the form r0, r1, ..., r[length-1]; - on exit, it has the form r0, r1, i1, r2, i2, ... (a total of \a length values). */ void real_plan_forward_fftpack (real_plan plan, double *data); /*! Computes a real backward FFT on \a data, using \a plan and assuming the FFTPACK storage scheme: - on entry, \a data has the form r0, r1, i1, r2, i2, ... (a total of \a length values); - on exit, it has the form r0, r1, ..., r[length-1]. */ void real_plan_backward_fftpack (real_plan plan, double *data); /*! Computes a real forward FFT on \a data, using \a plan and assuming the FFTW halfcomplex storage scheme: - on entry, \a data has the form r0, r1, ..., r[length-1]; - on exit, it has the form r0, r1, r2, ..., i2, i1. */ void real_plan_forward_fftw (real_plan plan, double *data); /*! Computes a real backward FFT on \a data, using \a plan and assuming the FFTW halfcomplex storage scheme: - on entry, \a data has the form r0, r1, r2, ..., i2, i1. - on exit, it has the form r0, r1, ..., r[length-1]. */ void real_plan_backward_fftw (real_plan plan, double *data); /*! Computes a real forward FFT on \a data, using \a plan and assuming a full-complex storage scheme: - on entry, \a data has the form r0, [ignored], r1, [ignored], ..., r[length-1], [ignored]; - on exit, it has the form r0, i0, r1, i1, ..., r[length-1], i[length-1]. */ void real_plan_forward_c (real_plan plan, double *data); /*! Computes a real backward FFT on \a data, using \a plan and assuming a full-complex storage scheme: - on entry, \a data has the form r0, i0, r1, i1, ..., r[length-1], i[length-1]; - on exit, it has the form r0, 0, r1, 0, ..., r[length-1], 0. */ void real_plan_backward_c (real_plan plan, double *data); /*! \} */ #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/planck.make0000650000175000017530000000056712255154051026627 0ustar zoncaplanck00000000000000PKG:=libfftpack SD:=$(SRCROOT)/$(PKG) OD:=$(BLDROOT)/$(PKG) FULL_INCLUDE+= -I$(SD) HDR_$(PKG):=$(SD)/*.h LIB_$(PKG):=$(LIBDIR)/libfftpack.a OBJ:=fftpack.o bluestein.o ls_fft.o OBJ:=$(OBJ:%=$(OD)/%) ODEP:=$(HDR_$(PKG)) $(HDR_c_utils) $(OD)/fftpack.o: $(SD)/fftpack_inc.c $(OBJ): $(ODEP) | $(OD)_mkdir $(LIB_$(PKG)): $(OBJ) all_hdr+=$(HDR_$(PKG)) all_lib+=$(LIB_$(PKG)) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/fftpack_inc.c0000650000175000017530000002047712255154051027135 0ustar zoncaplanck00000000000000/* * This file is part of libfftpack. * * libfftpack 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 2 of the License, or * (at your option) any later version. * * libfftpack 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 libfftpack; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* fftpack.c : A set of FFT routines in C. Algorithmically based on Fortran-77 FFTPACK by Paul N. Swarztrauber (Version 4, 1985). C port by Martin Reinecke (2010) */ #ifdef BACKWARD #define PSIGN + #define PMSIGNC(a,b,c,d) { a.r=c.r+d.r; a.i=c.i+d.i; b.r=c.r-d.r; b.i=c.i-d.i; } /* a = b*c */ #define MULPMSIGNC(a,b,c) { a.r=b.r*c.r-b.i*c.i; a.i=b.r*c.i+b.i*c.r; } #else #define PSIGN - #define PMSIGNC(a,b,c,d) { a.r=c.r-d.r; a.i=c.i-d.i; b.r=c.r+d.r; b.i=c.i+d.i; } /* a = conj(b)*c */ #define MULPMSIGNC(a,b,c) { a.r=b.r*c.r+b.i*c.i; a.i=b.r*c.i-b.i*c.r; } #endif static void X(2) (size_t ido, size_t l1, const cmplx *cc, cmplx *ch, const cmplx *wa) { const size_t cdim=2; size_t k,i; cmplx t; if (ido==1) for (k=0;kip) iang-=ip; abr.r += ccl[l ].r*wal[iang].r; abr.i += ccl[l ].i*wal[iang].r; abi.r += ccl[lc].r*wal[iang].i; abi.i += ccl[lc].i*wal[iang].i; } #ifndef BACKWARD { abi.i=-abi.i; abi.r=-abi.r; } #endif CONJFLIPC(abi) PMC(CH(i,k,j),CH(i,k,jc),abr,abi) } } DEALLOC(tarr); if (ido==1) return; for (j=1; j=2*n-1 and a convolution. Since n2 can be chosen to be highly composite, this algorithm is more efficient if n has large prime factors. The longer FFTs themselves are then computed using the FFTPACK routines. Bluestein's algorithm was implemented according to the description at http://en.wikipedia.org/wiki/Bluestein's_FFT_algorithm. Thread-safety: All routines can be called concurrently; all information needed by ls_fft is stored in the plan variable. However, using the same plan variable on multiple threads simultaneously is not supported and will lead to data corruption. healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/bluestein.h0000654000175000017530000000260512264023644026665 0ustar zoncaplanck00000000000000/* * This file is part of libfftpack. * * libfftpack 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 2 of the License, or * (at your option) any later version. * * libfftpack 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 libfftpack; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file bluestein.h * Interface for the Bluestein algorithm * * Copyright (C) 2005 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_BLUESTEIN_H #define PLANCK_BLUESTEIN_H #include "c_utils.h" #ifdef __cplusplus extern "C" { #endif size_t prime_factor_sum (size_t n); void bluestein_i (size_t n, double **tstorage, size_t *worksize); void bluestein (size_t n, double *data, double *tstorage, int isign); #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/libfftpack/fftpack.c0000650000175000017530000005333312255154051026301 0ustar zoncaplanck00000000000000/* * This file is part of libfftpack. * * libfftpack 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 2 of the License, or * (at your option) any later version. * * libfftpack 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 libfftpack; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libfftpack is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* fftpack.c : A set of FFT routines in C. Algorithmically based on Fortran-77 FFTPACK by Paul N. Swarztrauber (Version 4, 1985). C port by Martin Reinecke (2010) */ #include #include #include #include "fftpack.h" #define WA(x,i) wa[(i)+(x)*ido] #define CH(a,b,c) ch[(a)+ido*((b)+l1*(c))] #define CC(a,b,c) cc[(a)+ido*((b)+cdim*(c))] #define PM(a,b,c,d) { a=c+d; b=c-d; } #define PMC(a,b,c,d) { a.r=c.r+d.r; a.i=c.i+d.i; b.r=c.r-d.r; b.i=c.i-d.i; } #define ADDC(a,b,c) { a.r=b.r+c.r; a.i=b.i+c.i; } #define SCALEC(a,b) { a.r*=b; a.i*=b; } #define CONJFLIPC(a) { double tmp_=a.r; a.r=-a.i; a.i=tmp_; } /* (a+ib) = conj(c+id) * (e+if) */ #define MULPM(a,b,c,d,e,f) { a=c*e+d*f; b=c*f-d*e; } typedef struct { double r,i; } cmplx; #define CONCAT(a,b) a ## b #define X(arg) CONCAT(passb,arg) #define BACKWARD #include "fftpack_inc.c" #undef BACKWARD #undef X #define X(arg) CONCAT(passf,arg) #include "fftpack_inc.c" #undef X #undef CC #undef CH #define CC(a,b,c) cc[(a)+ido*((b)+l1*(c))] #define CH(a,b,c) ch[(a)+ido*((b)+cdim*(c))] static void radf2 (size_t ido, size_t l1, const double *cc, double *ch, const double *wa) { const size_t cdim=2; size_t i, k, ic; double ti2, tr2; for (k=0; k=2*ip) aidx-=2*ip; ar2=csarr[aidx]; ai2=csarr[aidx+1]; for(ik=0; ik=2*ip) aidx-=2*ip; ar2=csarr[aidx]; ai2=csarr[aidx+1]; for(ik=0; ik0) ? passb4(ido, l1, p1, p2, wa+iw) : passf4(ido, l1, p1, p2, wa+iw); else if(ip==2) (isign>0) ? passb2(ido, l1, p1, p2, wa+iw) : passf2(ido, l1, p1, p2, wa+iw); else if(ip==3) (isign>0) ? passb3(ido, l1, p1, p2, wa+iw) : passf3(ido, l1, p1, p2, wa+iw); else if(ip==5) (isign>0) ? passb5(ido, l1, p1, p2, wa+iw) : passf5(ido, l1, p1, p2, wa+iw); else if(ip==6) (isign>0) ? passb6(ido, l1, p1, p2, wa+iw) : passf6(ido, l1, p1, p2, wa+iw); else (isign>0) ? passbg(ido, ip, l1, p1, p2, wa+iw) : passfg(ido, ip, l1, p1, p2, wa+iw); SWAP(p1,p2,cmplx *); l1=l2; iw+=(ip-1)*ido; } if (p1!=c) memcpy (c,p1,n*sizeof(cmplx)); } void cfftf(size_t n, double c[], double wsave[]) { if (n!=1) cfft1(n, (cmplx*)c, (cmplx*)wsave, (cmplx*)(wsave+2*n), (size_t*)(wsave+4*n),-1); } void cfftb(size_t n, double c[], double wsave[]) { if (n!=1) cfft1(n, (cmplx*)c, (cmplx*)wsave, (cmplx*)(wsave+2*n), (size_t*)(wsave+4*n),+1); } static void factorize (size_t n, const size_t *pf, size_t npf, size_t *ifac) { size_t nl=n, nf=0, ntry=0, j=0, i; startloop: j++; ntry = (j<=npf) ? pf[j-1] : ntry+2; do { size_t nq=nl / ntry; size_t nr=nl-ntry*nq; if (nr!=0) goto startloop; nf++; ifac[nf+1]=ntry; nl=nq; if ((ntry==2) && (nf!=1)) { for (i=nf+1; i>2; --i) ifac[i]=ifac[i-1]; ifac[2]=2; } } while(nl!=1); ifac[0]=n; ifac[1]=nf; } static void cffti1(size_t n, double wa[], size_t ifac[]) { static const size_t ntryh[5]={4,6,3,2,5}; static const double twopi=6.28318530717958647692; size_t j, k, fi; double argh=twopi/n; size_t i=0, l1=1; factorize (n,ntryh,5,ifac); for(k=1; k<=ifac[1]; k++) { size_t ip=ifac[k+1]; size_t ido=n/(l1*ip); for(j=1; j6) { wa[is ]=wa[i ]; wa[is+1]=wa[i+1]; } } l1*=ip; } } void cffti(size_t n, double wsave[]) { if (n!=1) cffti1(n, wsave+2*n,(size_t*)(wsave+4*n)); } /*---------------------------------------------------------------------- rfftf1, rfftb1, rfftf, rfftb, rffti1, rffti. Real FFTs. ----------------------------------------------------------------------*/ static void rfftf1(size_t n, double c[], double ch[], const double wa[], const size_t ifac[]) { size_t k1, l1=n, nf=ifac[1], iw=n-1; double *p1=ch, *p2=c; for(k1=1; k1<=nf;++k1) { size_t ip=ifac[nf-k1+2]; size_t ido=n / l1; l1 /= ip; iw-=(ip-1)*ido; SWAP (p1,p2,double *); if(ip==4) radf4(ido, l1, p1, p2, wa+iw); else if(ip==2) radf2(ido, l1, p1, p2, wa+iw); else if(ip==3) radf3(ido, l1, p1, p2, wa+iw); else if(ip==5) radf5(ido, l1, p1, p2, wa+iw); else { if (ido==1) SWAP (p1,p2,double *); radfg(ido, ip, l1, ido*l1, p1, p2, wa+iw); SWAP (p1,p2,double *); } } if (p1==c) memcpy (c,ch,n*sizeof(double)); } static void rfftb1(size_t n, double c[], double ch[], const double wa[], const size_t ifac[]) { size_t k1, l1=1, nf=ifac[1], iw=0; double *p1=c, *p2=ch; for(k1=1; k1<=nf; k1++) { size_t ip = ifac[k1+1], ido= n/(ip*l1); if(ip==4) radb4(ido, l1, p1, p2, wa+iw); else if(ip==2) radb2(ido, l1, p1, p2, wa+iw); else if(ip==3) radb3(ido, l1, p1, p2, wa+iw); else if(ip==5) radb5(ido, l1, p1, p2, wa+iw); else { radbg(ido, ip, l1, ido*l1, p1, p2, wa+iw); if (ido!=1) SWAP (p1,p2,double *); } SWAP (p1,p2,double *); l1*=ip; iw+=(ip-1)*ido; } if (p1!=c) memcpy (c,ch,n*sizeof(double)); } void rfftf(size_t n, double r[], double wsave[]) { if(n!=1) rfftf1(n, r, wsave, wsave+n,(size_t*)(wsave+2*n)); } void rfftb(size_t n, double r[], double wsave[]) { if(n!=1) rfftb1(n, r, wsave, wsave+n,(size_t*)(wsave+2*n)); } static void rffti1(size_t n, double wa[], size_t ifac[]) { static const size_t ntryh[4]={4,2,3,5}; static const double twopi=6.28318530717958647692; size_t i, j, k, fi; double argh=twopi/n; size_t is=0, l1=1; factorize (n,ntryh,4,ifac); for (k=1; k #include #include "fftpack.h" #include "bluestein.h" /* returns the sum of all prime factors of n */ size_t prime_factor_sum (size_t n) { size_t result=0,x,limit,tmp; while (((tmp=(n>>1))<<1)==n) { result+=2; n=tmp; } limit=(size_t)sqrt(n+0.01); for (x=3; x<=limit; x+=2) while ((tmp=(n/x))*x==n) { result+=x; n=tmp; limit=(size_t)sqrt(n+0.01); } if (n>1) result+=n; return result; } /* returns the smallest composite of 2, 3 and 5 which is >= n */ static size_t good_size(size_t n) { size_t f2, f23, f235, bestfac=2*n; if (n<=6) return n; for (f2=1; f2=n) bestfac=f235; return bestfac; } void bluestein_i (size_t n, double **tstorage, size_t *worksize) { static const double pi=3.14159265358979323846; size_t n2=good_size(n*2-1); size_t m, coeff; double angle, xn2; double *bk, *bkf, *work; double pibyn=pi/n; *worksize=2+2*n+8*n2+16; *tstorage = RALLOC(double,2+2*n+8*n2+16); ((size_t *)(*tstorage))[0]=n2; bk = *tstorage+2; bkf = *tstorage+2+2*n; work= *tstorage+2+2*(n+n2); /* initialize b_k */ bk[0] = 1; bk[1] = 0; coeff=0; for (m=1; m=2*n) coeff-=2*n; angle = pibyn*coeff; bk[2*m] = cos(angle); bk[2*m+1] = sin(angle); } /* initialize the zero-padded, Fourier transformed b_k. Add normalisation. */ xn2 = 1./n2; bkf[0] = bk[0]*xn2; bkf[1] = bk[1]*xn2; for (m=2; m<2*n; m+=2) { bkf[m] = bkf[2*n2-m] = bk[m] *xn2; bkf[m+1] = bkf[2*n2-m+1] = bk[m+1] *xn2; } for (m=2*n;m<=(2*n2-2*n+1);++m) bkf[m]=0.; cffti (n2,work); cfftf (n2,bkf,work); } void bluestein (size_t n, double *data, double *tstorage, int isign) { size_t n2=*((size_t *)tstorage); size_t m; double *bk, *bkf, *akf, *work; bk = tstorage+2; bkf = tstorage+2+2*n; work= tstorage+2+2*(n+n2); akf = tstorage+2+2*n+6*n2+16; /* initialize a_k and FFT it */ if (isign>0) for (m=0; m<2*n; m+=2) { akf[m] = data[m]*bk[m] - data[m+1]*bk[m+1]; akf[m+1] = data[m]*bk[m+1] + data[m+1]*bk[m]; } else for (m=0; m<2*n; m+=2) { akf[m] = data[m]*bk[m] + data[m+1]*bk[m+1]; akf[m+1] =-data[m]*bk[m+1] + data[m+1]*bk[m]; } for (m=2*n; m<2*n2; ++m) akf[m]=0; cfftf (n2,akf,work); /* do the convolution */ if (isign>0) for (m=0; m<2*n2; m+=2) { double im = -akf[m]*bkf[m+1] + akf[m+1]*bkf[m]; akf[m ] = akf[m]*bkf[m] + akf[m+1]*bkf[m+1]; akf[m+1] = im; } else for (m=0; m<2*n2; m+=2) { double im = akf[m]*bkf[m+1] + akf[m+1]*bkf[m]; akf[m ] = akf[m]*bkf[m] - akf[m+1]*bkf[m+1]; akf[m+1] = im; } /* inverse FFT */ cfftb (n2,akf,work); /* multiply by b_k* */ if (isign>0) for (m=0; m<2*n; m+=2) { data[m] = bk[m] *akf[m] - bk[m+1]*akf[m+1]; data[m+1] = bk[m+1]*akf[m] + bk[m] *akf[m+1]; } else for (m=0; m<2*n; m+=2) { data[m] = bk[m] *akf[m] + bk[m+1]*akf[m+1]; data[m+1] =-bk[m+1]*akf[m] + bk[m] *akf[m+1]; } } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/0000755000175000017500000000000012351601662024523 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/smoothing_cxx_module.cc0000654000175000017530000000757412264023644031450 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2005-2013 Max-Planck-Society * Author: Martin Reinecke */ #include "xcomplex.h" #include "paramfile.h" #include "healpix_data_io.h" #include "alm.h" #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "alm_healpix_tools.h" #include "alm_powspec_tools.h" #include "fitshandle.h" #include "levels_facilities.h" #include "lsconstants.h" #include "announce.h" using namespace std; namespace { template void smoothing_cxx (paramfile ¶ms) { int nlmax = params.template find("nlmax"); string infile = params.template find("infile"); string outfile = params.template find("outfile"); bool polarisation = params.template find("polarisation"); int num_iter = params.template find("iter_order",0); double fwhm = arcmin2rad*params.template find("fwhm_arcmin"); if (fwhm<0) cout << "NOTE: negative FWHM supplied, doing a deconvolution..." << endl; if (!polarisation) { Healpix_Map map; read_Healpix_map_from_fits(infile,map,1,2); double avg=map.average(); map.Add(T(-avg)); tsize nmod = map.replaceUndefWith0(); if (nmod!=0) cout << "WARNING: replaced " << nmod << " undefined map pixels with a value of 0" << endl; arr weight; get_ring_weights (params,map.Nside(),weight); Alm > alm(nlmax,nlmax); if (map.Scheme()==NEST) map.swap_scheme(); map2alm_iter(map,alm,num_iter,weight); smoothWithGauss (alm, fwhm); alm2map(alm,map); map.Add(T(avg)); write_Healpix_map_to_fits (outfile,map,planckType()); } else { Healpix_Map mapT, mapQ, mapU; read_Healpix_map_from_fits(infile,mapT,mapQ,mapU); double avg=mapT.average(); mapT.Add(T(-avg)); tsize nmod = mapT.replaceUndefWith0()+mapQ.replaceUndefWith0() +mapU.replaceUndefWith0(); if (nmod!=0) cout << "WARNING: replaced " << nmod << " undefined map pixels with a value of 0" << endl; arr weight; get_ring_weights (params,mapT.Nside(),weight); Alm > almT(nlmax,nlmax), almG(nlmax,nlmax), almC(nlmax,nlmax); if (mapT.Scheme()==NEST) mapT.swap_scheme(); if (mapQ.Scheme()==NEST) mapQ.swap_scheme(); if (mapU.Scheme()==NEST) mapU.swap_scheme(); map2alm_pol_iter (mapT,mapQ,mapU,almT,almG,almC,num_iter,weight); smoothWithGauss (almT, almG, almC, fwhm); alm2map_pol(almT,almG,almC,mapT,mapQ,mapU); mapT.Add(T(avg)); write_Healpix_map_to_fits (outfile,mapT,mapQ,mapU,planckType()); } } } // unnamed namespace int smoothing_cxx_module (int argc, const char **argv) { module_startup ("smoothing_cxx", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); bool dp = params.find ("double_precision",false); dp ? smoothing_cxx(params) : smoothing_cxx(params); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_healpix_tools.cc0000650000175000017530000003542312255154051030700 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2012 Max-Planck-Society * Author: Martin Reinecke */ #include "alm_healpix_tools.h" #include "alm.h" #include "healpix_map.h" #include "xcomplex.h" #include "sharp_cxx.h" using namespace std; namespace { void checkLmaxNside(tsize lmax, tsize nside) { if (lmax>4*nside) cout << "\nWARNING: map analysis requested with lmax>4*nside...\n" "is this really what you want?\n\n"; } } template void map2alm (const Healpix_Map &map, Alm > &alm, const arr &weight, bool add_alm) { planck_assert (map.Scheme()==RING, "map2alm: map must be in RING scheme"); planck_assert (int(weight.size())>=2*map.Nside(), "map2alm: weight array has too few entries"); planck_assert (map.fullyDefined(),"map contains undefined pixels"); checkLmaxNside(alm.Lmax(), map.Nside()); sharp_cxxjob job; job.set_weighted_Healpix_geometry (map.Nside(),&weight[0]); job.set_triangular_alm_info (alm.Lmax(), alm.Mmax()); job.map2alm(&map[0], &alm(0,0).re, add_alm); } template void map2alm (const Healpix_Map &map, Alm > &alm, const arr &weight, bool add_alm); template void map2alm (const Healpix_Map &map, Alm > &alm, const arr &weight, bool add_alm); template void map2alm_iter (const Healpix_Map &map, Alm > &alm, int num_iter, const arr &weight) { map2alm(map,alm,weight); for (int iter=1; iter<=num_iter; ++iter) { Healpix_Map map2(map.Nside(),map.Scheme(),SET_NSIDE); alm2map(alm,map2); for (int m=0; m &map, Alm > &alm, int num_iter, const arr &weight); template void map2alm_iter (const Healpix_Map &map, Alm > &alm, int num_iter, const arr &weight); template void map2alm_iter2 (const Healpix_Map &map, Alm > &alm, double err_abs, double err_rel) { double x_err_abs=1./err_abs, x_err_rel=1./err_rel; arr wgt(2*map.Nside()); wgt.fill(1); Healpix_Map map2(map); alm.SetToZero(); while(true) { map2alm(map2,alm,wgt,true); alm2map(alm,map2); double errmeasure=0; for (int m=0; m &map, Alm > &alm, double err_abs, double err_rel); template void map2alm_spin (const Healpix_Map &map1, const Healpix_Map &map2, Alm > &alm1, Alm > &alm2, int spin, const arr &weight, bool add_alm) { planck_assert (map1.Scheme()==RING, "map2alm_spin: maps must be in RING scheme"); planck_assert (map1.conformable(map2), "map2alm_spin: maps are not conformable"); planck_assert (alm1.conformable(alm1), "map2alm_spin: a_lm are not conformable"); planck_assert (int(weight.size())>=2*map1.Nside(), "map2alm_spin: weight array has too few entries"); planck_assert (map1.fullyDefined()&&map2.fullyDefined(), "map contains undefined pixels"); checkLmaxNside(alm1.Lmax(), map1.Nside()); sharp_cxxjob job; job.set_weighted_Healpix_geometry (map1.Nside(),&weight[0]); job.set_triangular_alm_info (alm1.Lmax(), alm1.Mmax()); job.map2alm_spin(&map1[0],&map2[0],&alm1(0,0).re,&alm2(0,0).re,spin,add_alm); } template void map2alm_spin (const Healpix_Map &map1, const Healpix_Map &map2, Alm > &alm1, Alm > &alm2, int spin, const arr &weight, bool add_alm); template void map2alm_spin (const Healpix_Map &map1, const Healpix_Map &map2, Alm > &alm1, Alm > &alm2, int spin, const arr &weight, bool add_alm); template void map2alm_spin_iter2 (const Healpix_Map &map1, const Healpix_Map &map2, Alm > &alm1, Alm > &alm2, int spin, double err_abs, double err_rel) { arr wgt(2*map1.Nside()); wgt.fill(1); Healpix_Map map1b(map1), map2b(map2); alm1.SetToZero(); alm2.SetToZero(); while(true) { map2alm_spin(map1b,map2b,alm1,alm2,spin,wgt,true); alm2map_spin(alm1,alm2,map1b,map2b,spin); double errmeasure=0; for (int m=0; m &map1, const Healpix_Map &map2, Alm > &alm1, Alm > &alm2, int spin, double err_abs, double err_rel); template void map2alm_pol (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, const arr &weight, bool add_alm) { planck_assert (mapT.Scheme()==RING, "map2alm_pol: maps must be in RING scheme"); planck_assert (mapT.conformable(mapQ) && mapT.conformable(mapU), "map2alm_pol: maps are not conformable"); planck_assert (almT.conformable(almG) && almT.conformable(almC), "map2alm_pol: a_lm are not conformable"); planck_assert (int(weight.size())>=2*mapT.Nside(), "map2alm_pol: weight array has too few entries"); planck_assert (mapT.fullyDefined()&&mapQ.fullyDefined()&&mapU.fullyDefined(), "map contains undefined pixels"); checkLmaxNside(almT.Lmax(), mapT.Nside()); sharp_cxxjob job; job.set_weighted_Healpix_geometry (mapT.Nside(),&weight[0]); job.set_triangular_alm_info (almT.Lmax(), almT.Mmax()); job.map2alm(&mapT[0], &almT(0,0).re, add_alm); job.map2alm_spin(&mapQ[0],&mapU[0],&almG(0,0).re,&almC(0,0).re,2,add_alm); } template void map2alm_pol (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, const arr &weight, bool add_alm); template void map2alm_pol (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, const arr &weight, bool add_alm); template void map2alm_pol_iter (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, int num_iter, const arr &weight) { map2alm_pol(mapT,mapQ,mapU,almT,almG,almC,weight); for (int iter=1; iter<=num_iter; ++iter) { Healpix_Map mapT2(mapT.Nside(),mapT.Scheme(),SET_NSIDE), mapQ2(mapT.Nside(),mapT.Scheme(),SET_NSIDE), mapU2(mapT.Nside(),mapT.Scheme(),SET_NSIDE); alm2map_pol(almT,almG,almC,mapT2,mapQ2,mapU2); for (int m=0; m &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, int num_iter, const arr &weight); template void map2alm_pol_iter (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, int num_iter, const arr &weight); template void map2alm_pol_iter2 (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, double err_abs, double err_rel) { arr wgt(2*mapT.Nside()); wgt.fill(1); Healpix_Map mapT2(mapT), mapQ2(mapQ), mapU2(mapU); almT.SetToZero(); almG.SetToZero(); almC.SetToZero(); while(true) { map2alm_pol(mapT2,mapQ2,mapU2,almT,almG,almC,wgt,true); alm2map_pol(almT,almG,almC,mapT2,mapQ2,mapU2); double errmeasure=0; for (int m=0; m &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, double err_abs, double err_rel); template void alm2map (const Alm > &alm, Healpix_Map &map) { planck_assert (map.Scheme()==RING, "alm2map: map must be in RING scheme"); sharp_cxxjob job; job.set_Healpix_geometry (map.Nside()); job.set_triangular_alm_info (alm.Lmax(), alm.Mmax()); job.alm2map(&alm(0,0).re, &map[0], false); } template void alm2map (const Alm > &alm, Healpix_Map &map); template void alm2map (const Alm > &alm, Healpix_Map &map); template void alm2map_spin (const Alm > &alm1, const Alm > &alm2, Healpix_Map &map1, Healpix_Map &map2, int spin) { planck_assert (map1.Scheme()==RING, "alm2map_spin: maps must be in RING scheme"); planck_assert (map1.conformable(map2), "alm2map_spin: maps are not conformable"); planck_assert (alm1.conformable(alm2), "alm2map_spin: a_lm are not conformable"); sharp_cxxjob job; job.set_Healpix_geometry (map1.Nside()); job.set_triangular_alm_info (alm1.Lmax(), alm1.Mmax()); job.alm2map_spin(&alm1(0,0).re,&alm2(0,0).re,&map1[0],&map2[0],spin,false); } template void alm2map_spin (const Alm > &alm1, const Alm > &alm2, Healpix_Map &map, Healpix_Map &map2, int spin); template void alm2map_spin (const Alm > &alm1, const Alm > &alm2, Healpix_Map &map, Healpix_Map &map2, int spin); template void alm2map_pol (const Alm > &almT, const Alm > &almG, const Alm > &almC, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU) { planck_assert (mapT.Scheme()==RING, "alm2map_pol: maps must be in RING scheme"); planck_assert (mapT.conformable(mapQ) && mapT.conformable(mapU), "alm2map_pol: maps are not conformable"); planck_assert (almT.conformable(almG) && almT.conformable(almC), "alm2map_pol: a_lm are not conformable"); sharp_cxxjob job; job.set_Healpix_geometry (mapT.Nside()); job.set_triangular_alm_info (almT.Lmax(), almT.Mmax()); job.alm2map(&almT(0,0).re, &mapT[0], false); job.alm2map_spin(&almG(0,0).re, &almC(0,0).re, &mapQ[0], &mapU[0], 2, false); } template void alm2map_pol (const Alm > &almT, const Alm > &almG, const Alm > &almC, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU); template void alm2map_pol (const Alm > &almT, const Alm > &almG, const Alm > &almC, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU); template void alm2map_der1 (const Alm > &alm, Healpix_Map &map, Healpix_Map &mapdth, Healpix_Map &mapdph) { planck_assert (map.Scheme()==RING, "alm2map_der1: maps must be in RING scheme"); planck_assert (map.conformable(mapdth) && map.conformable(mapdph), "alm2map_der1: maps are not conformable"); sharp_cxxjob job; job.set_Healpix_geometry (map.Nside()); job.set_triangular_alm_info (alm.Lmax(), alm.Mmax()); job.alm2map(&alm(0,0).re, &map[0], false); job.alm2map_der1(&alm(0,0).re, &mapdth[0], &mapdph[0], false); } template void alm2map_der1 (const Alm > &alm, Healpix_Map &map, Healpix_Map &map_dth, Healpix_Map &map_dph); template void alm2map_der1 (const Alm > &alm, Healpix_Map &map, Healpix_Map &map_dth, Healpix_Map &map_dph); healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/smoothing_cxx.cc0000650000175000017530000000030012255154051030050 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN smoothing_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/map2tga_module.cc0000650000175000017530000002320312255154051030066 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include #include #include #include "safe_ptr.h" #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "rotmatrix.h" #include "pointing.h" #include "ls_image.h" #include "paramfile.h" #include "levels_facilities.h" #include "lsconstants.h" #include "announce.h" #include "string_utils.h" using namespace std; namespace { void histo_eq (arr2 &img, float &minv, float &maxv, arr &newpos) { const int nbins=100; arr bincnt (nbins); bincnt.fill(0); int pixels=0; double fact = 1./(maxv-minv); for (tsize i=0; i-1e30) { img[i][j] = float((img[i][j]-minv)*fact); int idx = int(img[i][j]*nbins); idx=max(0,min(idx,nbins-1)); ++bincnt[idx]; ++pixels; } newpos.alloc(nbins+1); int accu=0; for (int m=0; m-1e30) { int idx = int(img[i][j]*nbins); idx=max(0,min(idx,nbins-1)); double frac = nbins*img[i][j] - idx; img[i][j] = float((1-frac)*newpos[idx] + frac*newpos[idx+1]); img[i][j] = float(minv+(maxv-minv)*img[i][j]); } } void pro_mollw (const Healpix_Map &map, double lon0, double lat0, int xsize, arr2 &img, float &minv, float &maxv, bool smooth) { int ysize=xsize/2; img.alloc(xsize,ysize); img.fill(-1e35); double xc=(xsize-1)/2., yc=(ysize-1)/2.; rotmatrix rot; rot.Make_CPAC_Euler_Matrix(0,-lat0,-lon0); minv=1e30; maxv=-1e30; for (tsize i=0; i(img[i][j],Healpix_undef)) { if (img[i][j]maxv) maxv=img[i][j]; } } } } void pro_gno (const Healpix_Map &map, double lon0, double lat0, int xsize, double delta, arr2 &img, float &minv, float &maxv, bool smooth) { rotmatrix rot; rot.Make_CPAC_Euler_Matrix(lon0,-lat0,0); double start=-(xsize/2.)*delta; img.alloc(xsize,xsize); minv=1e30; maxv=-1e30; for (tsize i=0; i(img[i][j],Healpix_undef)) { if (img[i][j]maxv) maxv=img[i][j]; } } } void colorbar (LS_Image &img, const Palette &pal, int xmin, int xmax, int ymin, int ymax, bool flippal, const arr &newpos) { int nbins = newpos.size()-1; for (int i=xmin; i<=xmax; ++i) { double val = (double(i)-xmin)/(xmax-xmin); if (nbins>0) { int idx = int(val*nbins); idx=max(0,min(idx,nbins-1)); double frac = nbins*val - idx; val = (1-frac)*newpos[idx] + frac*newpos[idx+1]; } if (flippal) val=1-val; Colour c = pal.Get_Colour(float(val)); for (int j=ymin; j<=ymax; ++j) img.put_pixel(i,j,c); } } string conv (double val) { ostringstream os; if (abs(val)>100 || abs(val)<0.01) { os << setw(10) << setprecision(3) << scientific << val; return os.str(); } os << setw(10) << setprecision(6) << fixed << val; return trim(os.str()); } } // unnamed namespace int map2tga_module (int argc, const char **argv) { module_startup ("map2tga",argc>=2, "\nUsage:\n" " map2tga \n\n" "or:\n" " map2tga [-sig ] [-pal ]\n" " [-xsz ] [-bar] [-log] [-asinh] [-lon ] [-lat ]\n" " [-mul ] [-add ] [-min ] [-max ]\n" " [-res ] [-title ] [-flippal] [-gnomonic]\n" " [-interpol] [-equalize] [-viewer ]\n\n"); safe_ptr params; if (argc>2) { vector leading; map dict; leading.push_back("infile"); leading.push_back("outfile"); parse_cmdline_classic (argc,argv,leading,dict); if (dict.find("gnomonic")!=dict.end()) { dict["pro"]="gno"; dict.erase("gnomonic"); } params = new paramfile(dict,false); } else params = new paramfile(argv[1]); string infile = params->find("infile"); string outfile = params->find("outfile"); int colnum = params->find("sig",1); int palnr = params->find("pal",4); bool flippal = params->find("flippal",false); int xres = params->find("xsz",1024); bool bar = params->find("bar",false); bool logflag = params->find("log",false); bool eqflag = params->find("equalize",false); bool asinhflag = params->find("asinh",false); double lon0 = degr2rad*params->find("lon",0); double lat0 = degr2rad*params->find("lat",0); double factor = params->find("mul",1); double offset = params->find("add",0); float usermin = params->find("min", -1e30); bool min_supplied = (usermin>-1e29); float usermax = params->find("max", 1e30); bool max_supplied = (usermax<1e29); double res = arcmin2rad*params->find("res",1); string title = params->find("title",""); string viewer = params->find("viewer",""); bool mollpro = (params->find("pro","")!="gno"); bool interpol = params->find("interpol",false); Healpix_Map map(0,RING); read_Healpix_map_from_fits(infile,map,colnum,2); for (int m=0; m(map[m],Healpix_undef)) { map[m] = float((map[m]+offset)*factor); if (logflag) map[m] = (map[m]<=0) ? float(Healpix_undef) : float(log(double(map[m]))/ln10); if (asinhflag) map[m] = (map[m]>=0) ? float( log(double( map[m]+sqrt(map[m]*map[m]+1)))) : float(-log(double(-map[m]+sqrt(map[m]*map[m]+1)))); if (min_supplied) if (map[m] < usermin) map[m] = usermin; if (max_supplied) if (map[m] > usermax) map[m] = usermax; } } arr2 imgarr; float minv, maxv; mollpro ? pro_mollw (map,lon0,lat0,xres,imgarr,minv,maxv,interpol) : pro_gno (map,lon0,lat0,xres,res,imgarr,minv,maxv,interpol); arr newpos; if (eqflag) histo_eq(imgarr,minv,maxv,newpos); if (min_supplied) minv = usermin; if (max_supplied) maxv = usermax; if (maxv==minv) maxv=minv+1e-10f; int xsz=imgarr.size1(); int ysz=imgarr.size2(); int yofs=ysz; int scale = max(1,xsz/800); if (bar) ysz+=60*scale; if (title != "") { ysz+=50*scale; yofs+=50*scale; } LS_Image img(xsz,ysz); img.fill(Colour(1,1,1)); img.set_font (giant_font); Palette pal; pal.setPredefined(palnr); if (title != "") img.annotate_centered(xsz/2,25*scale,Colour(0,0,0),title,scale); for (tsize i=0; i-1e32) { Colour c(0.5,0.5,0.5); if (!approx(imgarr[i][j],Healpix_undef)) { int col = int((imgarr[i][j]-minv)/(maxv-minv)*256); col = min(255,max(col,0)); float colfrac = (imgarr[i][j]-minv)/(maxv-minv); if (flippal) colfrac = 1-colfrac; c = pal.Get_Colour(colfrac); } img.put_pixel(i,yofs-j-1,c); } } if (bar) { colorbar (img,pal,xsz/10,(xsz*9)/10,ysz-40*scale,ysz-20*scale,flippal, newpos); img.set_font (medium_bold_font); img.annotate_centered (xsz/20,ysz-30*scale,Colour(0,0,0),conv(minv),scale); img.annotate_centered ((xsz*19)/20,ysz-30*scale,Colour(0,0,0),conv(maxv), scale); } img.write_TGA(outfile); if (viewer!="") { int retcode = system((viewer+" "+outfile).c_str()); if (retcode != 0) cout << "Warning: viewer return code was " << retcode << endl; } return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec.cc0000650000175000017530000001020112255154051026640 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "powspec.h" #include "lsconstants.h" using namespace std; void PowSpec::dealloc() { tt_.dealloc(); gg_.dealloc(); cc_.dealloc(); tg_.dealloc(); tc_.dealloc(); gc_.dealloc(); } PowSpec::PowSpec(int nspec, int lmax) { Set(nspec,lmax); } PowSpec::~PowSpec() {} void PowSpec::assertArraySizes() const { planck_assert((num_specs==1) || (num_specs==4) || (num_specs==6), "incorrect number of spectral components"); if (num_specs==1) planck_assert(multiequal(tsize(0),gg_.size(),cc_.size(),tg_.size(), tc_.size(),gc_.size()), "incorrect array sizes"); if (num_specs==4) { planck_assert(multiequal(tt_.size(),gg_.size(),cc_.size(),tg_.size()), "incorrect array sizes"); planck_assert(multiequal(tsize(0),tc_.size(),gc_.size()), "incorrect array sizes"); } if (num_specs==6) planck_assert(multiequal(tt_.size(),gg_.size(),cc_.size(),tg_.size(), tc_.size(),gc_.size()), "incorrect array sizes"); } bool PowSpec::consistentAutoPowspec() const { for (tsize l=0; l=4) for (tsize l=0; lsqrt(tt_[l]*gg_[l])) return false; } if (num_specs==6) for (tsize l=0; lsqrt(tt_[l]*cc_[l])) return false; if (abs(gc_[l])>sqrt(gg_[l]*cc_[l])) return false; } return true; } void PowSpec::Set(int nspec, int lmax) { num_specs=nspec; planck_assert ((num_specs==1) || (num_specs==4) || (num_specs==6), "wrong number of spectrums"); tt_.alloc(lmax+1); if (num_specs>1) { gg_.alloc(lmax+1); cc_.alloc(lmax+1); tg_.alloc(lmax+1); } if (num_specs>4) { tc_.alloc(lmax+1); gc_.alloc(lmax+1); } } void PowSpec::Set(arr &tt_new) { dealloc(); num_specs = 1; tt_.transfer(tt_new); //FIXME: temporarily relaxed to allow cross-spectra if (!consistentAutoPowspec()) cerr << "Warning: negative values in TT spectrum" << endl; } void PowSpec::Set(arr &tt_new, arr &gg_new, arr &cc_new, arr &tg_new) { dealloc(); num_specs = 4; tt_.transfer(tt_new); gg_.transfer(gg_new); cc_.transfer(cc_new); tg_.transfer(tg_new); assertArraySizes(); } void PowSpec::Set(arr &tt_new, arr &gg_new, arr &cc_new, arr &tg_new, arr &tc_new, arr &gc_new) { Set (tt_new, gg_new, cc_new, tg_new); num_specs = 6; tc_.transfer(tc_new); gc_.transfer(gc_new); assertArraySizes(); } void PowSpec::smoothWithGauss (double fwhm) { planck_assert (num_specs<=4, "not yet implemented for num_specs>4"); double sigma = fwhm*fwhm2sigma; double fact_pol = exp(2*sigma*sigma); for (tsize l=0; l1) { gg_[l] *= f2*f2; cc_[l] *= f2*f2; tg_[l] *= f1*f2; } } } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_base.h0000650000175000017530000004001612255154051027455 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file healpix_base.h * Copyright (C) 2003-2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef HEALPIX_BASE_H #define HEALPIX_BASE_H #include #include "healpix_tables.h" #include "pointing.h" #include "arr.h" #include "rangeset.h" /*! Functionality related to the HEALPix pixelisation. */ template class T_Healpix_Base: public Healpix_Tables { protected: /*! The order of the map; -1 for nonhierarchical map. */ int order_; /*! The N_side parameter of the map; 0 if not allocated. */ I nside_; I npface_, ncap_, npix_; double fact1_, fact2_; /*! The map's ordering scheme. */ Healpix_Ordering_Scheme scheme_; /*! Returns the number of the next ring to the north of \a z=cos(theta). It may return 0; in this case \a z lies north of all rings. */ inline I ring_above (double z) const; void in_ring (I iz, double phi0, double dphi, rangeset &pixset) const; template void query_multidisc (const arr &norm, const arr &rad, int fact, rangeset &pixset) const; void query_multidisc_general (const arr &norm, const arr &rad, bool inclusive, const std::vector &cmds, rangeset &pixset) const; void query_strip_internal (double theta1, double theta2, bool inclusive, rangeset &pixset) const; inline I spread_bits (int v) const; inline int compress_bits (I v) const; I xyf2nest(int ix, int iy, int face_num) const; void nest2xyf(I pix, int &ix, int &iy, int &face_num) const; I xyf2ring(int ix, int iy, int face_num) const; void ring2xyf(I pix, int &ix, int &iy, int &face_num) const; I loc2pix (double z, double phi, double sth, bool have_sth) const; void pix2loc (I pix, double &z, double &phi, double &sth, bool &have_sth) const; void xyf2loc(double x, double y, int face, double &z, double &ph, double &sth, bool &have_sth) const; I nest_peano_helper (I pix, int dir) const; typedef I (T_Healpix_Base::*swapfunc)(I pix) const; public: static const int order_max; /*! Calculates the map order from its \a N_side parameter. Returns -1 if \a nside is not a power of 2. \param nside the \a N_side parameter */ static int nside2order (I nside); /*! Calculates the \a N_side parameter from the number of pixels. \param npix the number of pixels */ static I npix2nside (I npix); /*! Constructs an unallocated object. */ T_Healpix_Base (); /*! Constructs an object with a given \a order and the ordering scheme \a scheme. */ T_Healpix_Base (int order, Healpix_Ordering_Scheme scheme) { Set (order, scheme); } /*! Constructs an object with a given \a nside and the ordering scheme \a scheme. The \a nside_dummy parameter must be set to SET_NSIDE. */ T_Healpix_Base (I nside, Healpix_Ordering_Scheme scheme, const nside_dummy) { SetNside (nside, scheme); } /*! Adjusts the object to \a order and \a scheme. */ void Set (int order, Healpix_Ordering_Scheme scheme); /*! Adjusts the object to \a nside and \a scheme. */ void SetNside (I nside, Healpix_Ordering_Scheme scheme); /*! Returns the z-coordinate of the ring \a ring. This also works for the (not really existing) rings 0 and 4*nside. */ double ring2z (I ring) const; /*! Returns the number of the ring in which \a pix lies. */ I pix2ring (I pix) const; I xyf2pix(int ix, int iy, int face_num) const { return (scheme_==RING) ? xyf2ring(ix,iy,face_num) : xyf2nest(ix,iy,face_num); } void pix2xyf(I pix, int &ix, int &iy, int &face_num) const { (scheme_==RING) ? ring2xyf(pix,ix,iy,face_num) : nest2xyf(pix,ix,iy,face_num); } /*! Translates a pixel number from NEST to RING. */ I nest2ring (I pix) const; /*! Translates a pixel number from RING to NEST. */ I ring2nest (I pix) const; /*! Translates a pixel number from NEST to its Peano index. */ I nest2peano (I pix) const; /*! Translates a pixel number from its Peano index to NEST. */ I peano2nest (I pix) const; /*! Returns the number of the pixel which contains the angular coordinates (\a z:=cos(theta), \a phi). \note This method is inaccurate near the poles at high resolutions. */ I zphi2pix (double z, double phi) const { return loc2pix(z,phi,0.,false); } /*! Returns the number of the pixel which contains the angular coordinates \a ang. */ I ang2pix (const pointing &ang) const { const double pi_=3.141592653589793238462643383279502884197; planck_assert((ang.theta>=0)&&(ang.theta<=pi_),"invalid theta value"); return ((ang.theta<0.01) || (ang.theta > 3.14159-0.01)) ? loc2pix(cos(ang.theta),ang.phi,sin(ang.theta),true) : loc2pix(cos(ang.theta),ang.phi,0.,false); } /*! Returns the number of the pixel which contains the vector \a vec (\a vec is normalized if necessary). */ I vec2pix (const vec3 &vec) const { double xl = 1./vec.Length(); double phi = safe_atan2(vec.y,vec.x); double nz = vec.z*xl; if (std::abs(nz)>0.99) return loc2pix (nz,phi,sqrt(vec.x*vec.x+vec.y*vec.y)*xl,true); else return loc2pix (nz,phi,0,false); } /*! Returns the angular coordinates (\a z:=cos(theta), \a phi) of the center of the pixel with number \a pix. \note This method is inaccurate near the poles at high resolutions. */ void pix2zphi (I pix, double &z, double &phi) const { bool dum_b; double dum_d; pix2loc(pix,z,phi,dum_d,dum_b); } /*! Returns the angular coordinates of the center of the pixel with number \a pix. */ pointing pix2ang (I pix) const { double z, phi, sth; bool have_sth; pix2loc (pix,z,phi,sth,have_sth); return have_sth ? pointing(atan2(sth,z),phi) : pointing(acos(z),phi); } /*! Returns the vector to the center of the pixel with number \a pix. */ vec3 pix2vec (I pix) const { double z, phi, sth; bool have_sth; pix2loc (pix,z,phi,sth,have_sth); if (have_sth) return vec3(sth*cos(phi),sth*sin(phi),z); else { vec3 res; res.set_z_phi (z, phi); return res; } } template void query_disc_internal (pointing ptg, double radius, int fact, rangeset &pixset) const; /*! Returns the range set of all pixels whose centers lie within the disk defined by \a dir and \a radius. \param dir the angular coordinates of the disk center \param radius the radius (in radians) of the disk \param pixset a \a rangeset object containing the indices of all pixels whose centers lie inside the disk \note This method is more efficient in the RING scheme. */ void query_disc (pointing ptg, double radius, rangeset &pixset) const; /*! Returns the range set of all pixels which overlap with the disk defined by \a dir and \a radius. \param dir the angular coordinates of the disk center \param radius the radius (in radians) of the disk \param pixset a \a rangeset object containing the indices of all pixels overlapping with the disk. \param fact The overlapping test will be done at the resolution \a fact*nside. For NESTED ordering, \a fact must be a power of 2, else it can be any positive integer. A typical choice would be 4. \note This method may return some pixels which don't overlap with the disk at all. The higher \a fact is chosen, the fewer false positives are returned, at the cost of increased run time. \note This method is more efficient in the RING scheme. */ void query_disc_inclusive (pointing ptg, double radius, rangeset &pixset, int fact=1) const; /*! \deprecated Please use the version based on \a rangeset */ void query_disc (const pointing &dir, double radius, std::vector &listpix) const { rangeset pixset; query_disc(dir,radius,pixset); pixset.toVector(listpix); } /*! \deprecated Please use the version based on \a rangeset */ void query_disc_inclusive (const pointing &dir, double radius, std::vector &listpix, int fact=1) const { rangeset pixset; query_disc_inclusive(dir,radius,pixset,fact); pixset.toVector(listpix); } template void query_polygon_internal (const std::vector &vertex, int fact, rangeset &pixset) const; /*! Returns a range set of pixels whose centers lie within the convex polygon defined by the \a vertex array. \param vertex array containing the vertices of the polygon. \param pixset a \a rangeset object containing the indices of all pixels whose centers lie inside the polygon \note This method is more efficient in the RING scheme. */ void query_polygon (const std::vector &vertex, rangeset &pixset) const; /*! Returns a range set of pixels which overlap with the convex polygon defined by the \a vertex array. \param vertex array containing the vertices of the polygon. \param pixset a \a rangeset object containing the indices of all pixels overlapping with the polygon. \param fact The overlapping test will be done at the resolution \a fact*nside. For NESTED ordering, \a fact must be a power of 2, else it can be any positive integer. A typical choice would be 4. \note This method may return some pixels which don't overlap with the polygon at all. The higher \a fact is chosen, the fewer false positives are returned, at the cost of increased run time. \note This method is more efficient in the RING scheme. */ void query_polygon_inclusive (const std::vector &vertex, rangeset &pixset, int fact=1) const; /*! Returns a range set of pixels whose centers lie within the colatitude range defined by \a theta1 and \a theta2 (if \a inclusive==false), or which overlap with this region (if \a inclusive==true). If \a theta1 &pixset) const; /*! Returns useful information about a given ring of the map. \param ring the ring number (the number of the first ring is 1) \param startpix the number of the first pixel in the ring (NOTE: this is always given in the RING numbering scheme!) \param ringpix the number of pixels in the ring \param costheta the cosine of the colatitude of the ring \param sintheta the sine of the colatitude of the ring \param shifted if \a true, the center of the first pixel is not at \a phi=0 */ void get_ring_info (I ring, I &startpix, I &ringpix, double &costheta, double &sintheta, bool &shifted) const; /*! Returns useful information about a given ring of the map. \param ring the ring number (the number of the first ring is 1) \param startpix the number of the first pixel in the ring (NOTE: this is always given in the RING numbering scheme!) \param ringpix the number of pixels in the ring \param theta the colatitude (in radians) of the ring \param shifted if \a true, the center of the first pixel is not at \a phi=0 */ void get_ring_info2 (I ring, I &startpix, I &ringpix, double &theta, bool &shifted) const; /*! Returns useful information about a given ring of the map. \param ring the ring number (the number of the first ring is 1) \param startpix the number of the first pixel in the ring (NOTE: this is always given in the RING numbering scheme!) \param ringpix the number of pixels in the ring \param shifted if \a true, the center of the first pixel is not at \a phi=0 */ void get_ring_info_small (I ring, I &startpix, I &ringpix, bool &shifted) const; /*! Returns the neighboring pixels of \a pix in \a result. On exit, \a result contains (in this order) the pixel numbers of the SW, W, NW, N, NE, E, SE and S neighbor of \a pix. If a neighbor does not exist (this can only be the case for the W, N, E and S neighbors), its entry is set to -1. \note This method works in both RING and NEST schemes, but is considerably faster in the NEST scheme. */ void neighbors (I pix, fix_arr &result) const; /*! Returns interpolation information for the direction \a ptg. The surrounding pixels are returned in \a pix, their corresponding weights in \a wgt. \note This method works in both RING and NEST schemes, but is considerably faster in the RING scheme. */ void get_interpol (const pointing &ptg, fix_arr &pix, fix_arr &wgt) const; /*! Returns the order parameter of the object. */ int Order() const { return order_; } /*! Returns the \a N_side parameter of the object. */ I Nside() const { return nside_; } /*! Returns the number of pixels of the object. */ I Npix() const { return npix_; } /*! Returns the ordering scheme of the object. */ Healpix_Ordering_Scheme Scheme() const { return scheme_; } /*! Returns \a true, if both objects have the same nside and scheme, else \a false. */ bool conformable (const T_Healpix_Base &other) const { return ((nside_==other.nside_) && (scheme_==other.scheme_)); } /*! Swaps the contents of two Healpix_Base objects. */ void swap (T_Healpix_Base &other); /*! Returns the maximum angular distance (in radian) between any pixel center and its corners. */ double max_pixrad() const; /*! Returns the maximum angular distance (in radian) between any pixel center and its corners in a given ring. */ double max_pixrad(I ring) const; /*! Returns a set of points along the boundary of the given pixel. \a step=1 gives 4 points on the corners. The first point corresponds to the northernmost corner, the subsequent points follow the pixel boundary through west, south and east corners. \param pix pixel index number \param step the number of returned points is 4*step. */ void boundaries (I pix, tsize step, std::vector &out) const; arr swap_cycles() const; }; /*! T_Healpix_Base for Nside up to 2^13. */ typedef T_Healpix_Base Healpix_Base; /*! T_Healpix_Base for Nside up to 2^29. */ typedef T_Healpix_Base Healpix_Base2; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/mult_alm_module.cc0000650000175000017530000001150512255154051030347 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "xcomplex.h" #include "paramfile.h" #include "healpix_data_io.h" #include "powspec.h" #include "powspec_fitsio.h" #include "alm.h" #include "alm_fitsio.h" #include "alm_powspec_tools.h" #include "fitshandle.h" #include "levels_facilities.h" #include "lsconstants.h" #include "announce.h" using namespace std; namespace { template void mult_alm (paramfile ¶ms) { string infile = params.template find("infile"); string outfile = params.template find("outfile"); int nside_pixwin_in = params.template find("nside_pixwin_in",0); planck_assert (nside_pixwin_in>=0,"nside_pixwin_in must be >= 0"); int nside_pixwin_out = params.template find("nside_pixwin_out",0); planck_assert (nside_pixwin_out>=0,"nside_pixwin_out must be >= 0"); string cl_in = params.template find("cl_in",""); string cl_out = params.template find("cl_out",""); double fwhm_in = arcmin2rad*params.template find("fwhm_arcmin_in",0); planck_assert (fwhm_in>=0,"fwhm_arcmin_in must be >= 0"); double fwhm_out = arcmin2rad*params.template find("fwhm_arcmin_out",0); planck_assert (fwhm_out>=0,"fwhm_arcmin_out must be >= 0"); string datadir; if ((nside_pixwin_in>0) || (nside_pixwin_out>0)) datadir = params.template find("healpix_data"); bool polarisation = params.template find("polarisation"); if (!polarisation) { int nlmax, nmmax; get_almsize(infile, nlmax, nmmax, 2); Alm > alm; read_Alm_from_fits(infile,alm,nlmax,nmmax,2); if (fwhm_in>0) smoothWithGauss (alm, -fwhm_in); arr temp(nlmax+1); PowSpec tps; if (nside_pixwin_in>0) { read_pixwin(datadir,nside_pixwin_in,temp); for (int l=0; l<=nlmax; ++l) temp[l] = 1/temp[l]; alm.ScaleL (temp); } if (cl_in!="") { read_powspec_from_fits (cl_in,tps,1,alm.Lmax()); for (int l=0; l<=nlmax; ++l) temp[l] = 1./sqrt(tps.tt(l)); alm.ScaleL (temp); } if (nside_pixwin_out>0) { read_pixwin(datadir,nside_pixwin_out,temp); alm.ScaleL (temp); } if (cl_out!="") { read_powspec_from_fits (cl_out,tps,1,alm.Lmax()); for (int l=0; l<=nlmax; ++l) temp[l] = sqrt(tps.tt(l)); alm.ScaleL (temp); } if (fwhm_out>0) smoothWithGauss (alm, fwhm_out); write_Alm_to_fits (outfile,alm,nlmax,nmmax,planckType()); } else { int nlmax, nmmax; get_almsize_pol(infile, nlmax, nmmax); Alm > almT, almG, almC; read_Alm_from_fits(infile,almT,almG,almC,nlmax,nmmax,2); if (fwhm_in>0) smoothWithGauss (almT, almG, almC, -fwhm_in); arr temp(nlmax+1), pol(nlmax+1); if (nside_pixwin_in>0) { read_pixwin(datadir,nside_pixwin_in,temp,pol); for (int l=0; l<=nlmax; ++l) { temp[l] = 1/temp[l]; if (pol[l]!=0) pol[l] = 1/pol[l]; } almT.ScaleL(temp); almG.ScaleL(pol); almC.ScaleL(pol); } if (cl_in!="") planck_fail ("power spectra not (yet) supported with polarisation"); if (nside_pixwin_out>0) { read_pixwin(datadir,nside_pixwin_out,temp,pol); almT.ScaleL(temp); almG.ScaleL(pol); almC.ScaleL(pol); } if (cl_out!="") planck_fail ("power spectra not (yet) supported with polarisation"); if (fwhm_out>0) smoothWithGauss (almT, almG, almC, fwhm_out); write_Alm_to_fits (outfile,almT,almG,almC,nlmax,nmmax,planckType()); } } } // unnamed namespace int mult_alm_module (int argc, const char **argv) { module_startup ("mult_alm", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); bool dp = params.find ("double_precision",false); dp ? mult_alm(params) : mult_alm(params); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_powspec_tools.h0000650000175000017530000001115212255154051030561 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file alm_powspec_tools.h * Copyright (C) 2003, 2004, 2005 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_ALM_POWSPEC_TOOLS_H #define PLANCK_ALM_POWSPEC_TOOLS_H #include "xcomplex.h" template class Alm; class PowSpec; class planck_rng; class rotmatrix; /*! \defgroup alm_ps_group Conversions between a_lm and power spectra */ /*! \{ */ /*! Creates a Gaussian realisation of the input power spectrum \a powspec, using the random number generator \a rng, and returns the result in \a alm. */ template void create_alm (const PowSpec &powspec, Alm > &alm, planck_rng &rng); /*! Creates a Gaussian realisation of the polarised input power spectrum \a powspec, using the random number generator \a rng, and returns the result in \a almT, \a almG and \a almC. */ template void create_alm_pol (const PowSpec &powspec, Alm > &almT, Alm > &almG, Alm > &almC, planck_rng &rng); /*! Returns the unpolarised power spectrum of \a alm in \a powspec. */ template void extract_powspec (const Alm > &alm, PowSpec &powspec); /*! Returns the cross power spectrum of \a alm1 and \a alm2 in \a powspec. */ template void extract_crosspowspec (const Alm > &alm1, const Alm > &alm2, PowSpec &powspec); /*! Returns the polarised power spectrum of \a almT, \a almG and \a almC in \a powspec. */ template void extract_powspec (const Alm > &almT, const Alm > &almG, const Alm > &almC, PowSpec &powspec); /*! \} */ /*! Applies a convolution with a Gaussian beam with an FWHM of \a fwhm (in radian) to \a alm. \note If \a fwhm<0, a deconvolution with \a -fwhm is performed. \relates Alm */ template void smoothWithGauss (Alm > &alm, double fwhm); /*! Applies a convolution with a Gaussian beam with an FWHM of \a fwhm (in radian) to \a almT, \a almG and \a almC. \note If \a fwhm<0, a deconvolution with \a -fwhm is performed. \relates Alm */ template void smoothWithGauss (Alm > &almT, Alm > &almG, Alm > &almC, double fwhm); /*! Rotates \a alm through the Euler angles \a psi, \a theta and \a phi. The Euler angle convention is right handed, rotations are active. - \a psi is the first rotation about the z-axis (vertical) - then \a theta about the ORIGINAL (unrotated) y-axis - then \a phi about the ORIGINAL (unrotated) z-axis (vertical) \relates Alm */ template void rotate_alm (Alm > &alm, double psi, double theta, double phi); /*! Rotates \a almT, \a almG and \a almC through the Euler angles \a psi, \a theta and \a phi. The Euler angle convention is right handed, rotations are active. - \a psi is the first rotation about the z-axis (vertical) - then \a theta about the ORIGINAL (unrotated) y-axis - then \a phi about the ORIGINAL (unrotated) z-axis (vertical) \relates Alm */ template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, double psi, double theta, double phi); /*! Rotates \a alm through the rotation matrix \a mat. \relates Alm */ template void rotate_alm (Alm > &alm, const rotmatrix &mat); /*! Rotates \a almT, \a almG and \a almC through the rotation matrix \a mat. \relates Alm */ template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, const rotmatrix &mat); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/syn_alm_cxx.cc0000650000175000017530000000027612255154051027517 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN syn_alm_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_cxx_module.cc0000650000175000017530000001155412255154051031036 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2012 Max-Planck-Society * Author: Martin Reinecke */ #include "paramfile.h" #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "fitshandle.h" #include "levels_facilities.h" #include "geom_utils.h" #include "xcomplex.h" #include "announce.h" using namespace std; namespace { double alpha (const pointing &p1, const pointing &p2) { vec3 v1(p1), v2(p2); vec3 dir(v2-v1); return orientation (v2, dir) - orientation (v1,dir); } template void degrade_pol (const Healpix_Map &q1, const Healpix_Map &u1, Healpix_Map &q2, Healpix_Map &u2, bool pessimistic) { planck_assert(q1.conformable(u1) && q2.conformable(u2), "map mismatch"); planck_assert(q2.Nside() sum = 0; for (int j=fact*y; j(q1[opix],Healpix_undef) ||approx(u1[opix],Healpix_undef))) { ++hits; xcomplex val(q1[opix],u1[opix]); double ang=alpha(q2.pix2ang(m),q1.pix2ang(opix)); xcomplex mul(cos(2*ang),sin(2*ang)); sum += val*mul; } } q2[m] = T((hits void udgrade_cxx (paramfile ¶ms) { string infile = params.template find("infile"); string outfile = params.template find("outfile"); int nside = params.template find("nside"); bool polarisation = params.template find("polarisation",false); bool pessimistic = params.template find("pessimistic",false); if (!polarisation) { Healpix_Map inmap; read_Healpix_map_from_fits(infile,inmap,1,2); Healpix_Map outmap (nside,inmap.Scheme(),SET_NSIDE); outmap.Import(inmap,pessimistic); write_Healpix_map_to_fits (outfile,outmap,planckType()); } else { Healpix_Map inmap; read_Healpix_map_from_fits(infile,inmap,1,2); Healpix_Map outmapT (nside,inmap.Scheme(),SET_NSIDE), outmapQ (nside,inmap.Scheme(),SET_NSIDE), outmapU (nside,inmap.Scheme(),SET_NSIDE); // planck_assert(inmap.Nside()<=outmapT.Nside(), // "degrading not supported for polarised maps"); outmapT.Import(inmap,pessimistic); if ((outmapQ.Nside()("parallel_transport",true)) { cout << "Experimental: polarised degrade with parallel transport" << endl; read_Healpix_map_from_fits(infile,inmap,2,2); Healpix_Map inmap2; read_Healpix_map_from_fits(infile,inmap2,3,2); degrade_pol (inmap, inmap2, outmapQ, outmapU, pessimistic); } else { cout << "WARNING: polarised degrade without parallel transport" << endl; read_Healpix_map_from_fits(infile,inmap,2,2); outmapQ.Import(inmap,pessimistic); read_Healpix_map_from_fits(infile,inmap,3,2); outmapU.Import(inmap,pessimistic); } write_Healpix_map_to_fits (outfile,outmapT,outmapQ,outmapU,planckType()); } } } // unnamed namespace int udgrade_cxx_module (int argc, const char **argv) { module_startup ("udgrade_cxx", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); bool dp = params.find ("double_precision",false); dp ? udgrade_cxx(params) : udgrade_cxx(params); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_base.cc0000650000175000017530000011567312255154051027627 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2012 Max-Planck-Society * Author: Martin Reinecke */ #include "healpix_base.h" #include "geom_utils.h" #include "lsconstants.h" using namespace std; template<> const int T_Healpix_Base::order_max=13; template<> const int T_Healpix_Base::order_max=29; template int T_Healpix_Base::nside2order (I nside) { planck_assert (nside>I(0), "invalid value for Nside"); return ((nside)&(nside-1)) ? -1 : ilog2(nside); } template I T_Healpix_Base::npix2nside (I npix) { I res=isqrt(npix/I(12)); planck_assert (npix==res*res*I(12), "invalid value for npix"); return res; } template I T_Healpix_Base::ring_above (double z) const { double az=abs(z); if (az<=twothird) // equatorial region return I(nside_*(2-1.5*z)); I iring = I(nside_*sqrt(3*(1-az))); return (z>0) ? iring : 4*nside_-iring-1; } namespace { /* Short note on the "zone": zone = 0: pixel lies completely outside the queried shape 1: pixel may overlap with the shape, pixel center is outside 2: pixel center is inside the shape, but maybe not the complete pixel 3: pixel lies completely inside the shape */ template inline void check_pixel (int o, int order_, int omax, int zone, rangeset &pixset, I pix, vector > &stk, bool inclusive, int &stacktop) { if (zone==0) return; if (o=3) { int sdist=2*(order_-o); // the "bit-shift distance" between map orders pixset.append(pix<=1) for (int i=0; i<4; ++i) stk.push_back(make_pair(4*pix+3-i,o+1)); // add children } else if (o>order_) // this implies that inclusive==true { if (zone>=2) // pixel center in shape { pixset.append(pix>>(2*(o-order_))); // output the parent pixel at order_ stk.resize(stacktop); // unwind the stack } else // (zone>=1): pixel center in safety range { if (o>(2*(o-order_))); // output the parent pixel at order_ stk.resize(stacktop); // unwind the stack } } } else // o==order_ { if (zone>=2) pixset.append(pix); else if (inclusive) // and (zone>=1) { if (order_ bool check_pixel_ring (const T_Healpix_Base &b1, const T_Healpix_Base &b2, I pix, I nr, I ipix1, int fct, double cz, double cphi, double cosrp2, I cpix) { if (pix>=nr) pix-=nr; if (pix<0) pix+=nr; pix+=ipix1; if (pix==cpix) return false; // disk center in pixel => overlap int px,py,pf; b1.pix2xyf(pix,px,py,pf); for (int i=0; icosrp2) // overlap return false; b2.pix2zphi(b2.xyf2pix(ox+fct-1,oy+i,pf),pz,pphi); if (cosdist_zphi(pz,pphi,cz,cphi)>cosrp2) // overlap return false; b2.pix2zphi(b2.xyf2pix(ox+fct-1-i,oy+fct-1,pf),pz,pphi); if (cosdist_zphi(pz,pphi,cz,cphi)>cosrp2) // overlap return false; b2.pix2zphi(b2.xyf2pix(ox,oy+fct-1-i,pf),pz,pphi); if (cosdist_zphi(pz,pphi,cz,cphi)>cosrp2) // overlap return false; } return true; } } // unnamed namespace template template void T_Healpix_Base::query_disc_internal (pointing ptg, double radius, int fact, rangeset &pixset) const { bool inclusive = (fact!=0); pixset.clear(); ptg.normalize(); if (scheme_==RING) { I fct=1; if (inclusive) { planck_assert (((I(1)<=fact, "invalid oversampling factor"); fct = fact; } T_Healpix_Base b2; double rsmall, rbig; if (fct>1) { b2.SetNside(fct*nside_,RING); rsmall = radius+b2.max_pixrad(); rbig = radius+max_pixrad(); } else rsmall = rbig = inclusive ? radius+max_pixrad() : radius; if (rsmall>=pi) { pixset.append(0,npix_); return; } rbig = min(pi,rbig); double cosrsmall = cos(rsmall); double cosrbig = cos(rbig); double z0 = cos(ptg.theta); double xa = 1./sqrt((1-z0)*(1+z0)); I cpix=zphi2pix(z0,ptg.phi); double rlat1 = ptg.theta - rsmall; double zmax = cos(rlat1); I irmin = ring_above (zmax)+1; if ((rlat1<=0) && (irmin>1)) // north pole in the disk { I sp,rp; bool dummy; get_ring_info_small(irmin-1,sp,rp,dummy); pixset.append(0,sp+rp); } if ((fct>1) && (rlat1>0)) irmin=max(I(1),irmin-1); double rlat2 = ptg.theta + rsmall; double zmin = cos(rlat2); I irmax = ring_above (zmin); if ((fct>1) && (rlat2(nr*inv_twopi*(ptg.phi-dphi) - shift)+1; I ip_hi = ifloor(nr*inv_twopi*(ptg.phi+dphi) - shift); if (fct>1) { while ((ip_lo<=ip_hi) && check_pixel_ring (*this,b2,ip_lo,nr,ipix1,fct,z0,ptg.phi,cosrsmall,cpix)) ++ip_lo; while ((ip_hi>ip_lo) && check_pixel_ring (*this,b2,ip_hi,nr,ipix1,fct,z0,ptg.phi,cosrsmall,cpix)) --ip_hi; } if (ip_lo<=ip_hi) { if (ip_hi>=nr) { ip_lo-=nr; ip_hi-=nr; } if (ip_lo<0) { pixset.append(ipix1,ipix1+ip_hi+1); pixset.append(ipix1+ip_lo+nr,ipix2+1); } else pixset.append(ipix1+ip_lo,ipix1+ip_hi+1); } } if ((rlat2>=pi) && (irmax+1<4*nside_)) // south pole in the disk { I sp,rp; bool dummy; get_ring_info_small(irmax+1,sp,rp,dummy); pixset.append(sp,npix_); } } else // scheme_==NEST { if (radius>=pi) // disk covers the whole sphere { pixset.append(0,npix_); return; } int oplus = 0; if (inclusive) { planck_assert ((I(1)<<(order_max-order_))>=fact, "invalid oversampling factor"); planck_assert ((fact&(fact-1))==0, "oversampling factor must be a power of 2"); oplus=ilog2(fact); } int omax=order_+oplus; // the order up to which we test vec3 vptg(ptg); arr > base(omax+1); arr crpdr(omax+1), crmdr(omax+1); double cosrad=cos(radius); for (int o=0; o<=omax; ++o) // prepare data at the required orders { base[o].Set(o,NEST); double dr=base[o].max_pixrad(); // safety distance crpdr[o] = (radius+dr>pi) ? -1. : cos(radius+dr); crmdr[o] = (radius-dr<0.) ? 1. : cos(radius-dr); } vector > stk; // stack for pixel numbers and their orders stk.reserve(12+3*omax); // reserve maximum size to avoid reallocation for (int i=0; i<12; ++i) // insert the 12 base pixels in reverse order stk.push_back(make_pair(I(11-i),0)); int stacktop=0; // a place to save a stack position while (!stk.empty()) // as long as there are pixels on the stack { // pop current pixel number and order from the stack I pix=stk.back().first; int o=stk.back().second; stk.pop_back(); double z,phi; base[o].pix2zphi(pix,z,phi); // cosine of angular distance between pixel center and disk center double cangdist=cosdist_zphi(vptg.z,ptg.phi,z,phi); if (cangdist>crpdr[o]) { int zone = (cangdist void T_Healpix_Base::query_disc (pointing ptg, double radius, rangeset &pixset) const { query_disc_internal (ptg, radius, 0, pixset); } template void T_Healpix_Base::query_disc_inclusive (pointing ptg, double radius, rangeset &pixset, int fact) const { planck_assert(fact>0,"fact must be a positive integer"); if ((sizeof(I)<8) && (((I(1)< base2(nside_,scheme_,SET_NSIDE); base2.query_disc_internal(ptg,radius,fact,pixset); return; } query_disc_internal (ptg, radius, fact, pixset); } template template void T_Healpix_Base::query_multidisc (const arr &norm, const arr &rad, int fact, rangeset &pixset) const { bool inclusive = (fact!=0); tsize nv=norm.size(); planck_assert(nv==rad.size(),"inconsistent input arrays"); pixset.clear(); if (scheme_==RING) { I fct=1; if (inclusive) { planck_assert (((I(1)<=fact, "invalid oversampling factor"); fct = fact; } T_Healpix_Base b2; double rpsmall, rpbig; if (fct>1) { b2.SetNside(fct*nside_,RING); rpsmall = b2.max_pixrad(); rpbig = max_pixrad(); } else rpsmall = rpbig = inclusive ? max_pixrad() : 0; I irmin=1, irmax=4*nside_-1; vector z0,xa,cosrsmall,cosrbig; vector ptg; vector cpix; for (tsize i=0; i1) cpix.push_back(zphi2pix(cth,pnt.phi)); xa.push_back(1./sqrt((1-cth)*(1+cth))); ptg.push_back(pnt); double rlat1 = pnt.theta - rsmall; double zmax = cos(rlat1); I irmin_t = (rlat1<=0) ? 1 : ring_above (zmax)+1; if ((fct>1) && (rlat1>0)) irmin_t=max(I(1),irmin_t-1); double rlat2 = pnt.theta + rsmall; double zmin = cos(rlat2); I irmax_t = (rlat2>=pi) ? 4*nside_-1 : ring_above (zmin); if ((fct>1) && (rlat2 irmin) irmin=irmin_t; } } for (I iz=irmin; iz<=irmax; ++iz) { double z=ring2z(iz); I ipix1,nr; bool shifted; get_ring_info_small(iz,ipix1,nr,shifted); double shift = shifted ? 0.5 : 0.; rangeset tr; tr.append(ipix1,ipix1+nr); for (tsize j=0; j(nr*inv_twopi*(ptg[j].phi-dphi) - shift)+1; I ip_hi = ifloor(nr*inv_twopi*(ptg[j].phi+dphi) - shift); if (fct>1) { while ((ip_lo<=ip_hi) && check_pixel_ring (*this,b2,ip_lo,nr,ipix1,fct,z0[j],ptg[j].phi,cosrsmall[j],cpix[j])) ++ip_lo; while ((ip_hi>ip_lo) && check_pixel_ring (*this,b2,ip_hi,nr,ipix1,fct,z0[j],ptg[j].phi,cosrsmall[j],cpix[j])) --ip_hi; } if (ip_hi>=nr) { ip_lo-=nr; ip_hi-=nr;} if (ip_lo<0) tr.remove(ipix1+ip_hi+1,ipix1+ip_lo+nr); else tr.intersect(ipix1+ip_lo,ipix1+ip_hi+1); } pixset.append(tr); } } else // scheme_ == NEST { int oplus = 0; if (inclusive) { planck_assert ((I(1)<<(order_max-order_))>=fact, "invalid oversampling factor"); planck_assert ((fact&(fact-1))==0, "oversampling factor must be a power of 2"); oplus=ilog2(fact); } int omax=order_+oplus; // the order up to which we test // TODO: ignore all disks with radius>=pi arr > base(omax+1); arr3 crlimit(omax+1,nv,3); for (int o=0; o<=omax; ++o) // prepare data at the required orders { base[o].Set(o,NEST); double dr=base[o].max_pixrad(); // safety distance for (tsize i=0; ipi) ? -1. : cos(rad[i]+dr); crlimit(o,i,1) = (o==0) ? cos(rad[i]) : crlimit(0,i,1); crlimit(o,i,2) = (rad[i]-dr<0.) ? 1. : cos(rad[i]-dr); } } vector > stk; // stack for pixel numbers and their orders stk.reserve(12+3*omax); // reserve maximum size to avoid reallocation for (int i=0; i<12; ++i) // insert the 12 base pixels in reverse order stk.push_back(make_pair(I(11-i),0)); int stacktop=0; // a place to save a stack position while (!stk.empty()) // as long as there are pixels on the stack { // pop current pixel number and order from the stack I pix=stk.back().first; int o=stk.back().second; stk.pop_back(); vec3 pv(base[o].pix2vec(pix)); tsize zone=3; for (tsize i=0; i void T_Healpix_Base::query_multidisc_general (const arr &norm, const arr &rad, bool inclusive, const vector &cmds, rangeset &pixset) const { tsize nv=norm.size(); planck_assert(nv==rad.size(),"inconsistent input arrays"); pixset.clear(); if (scheme_==RING) { planck_fail ("not yet implemented"); } else // scheme_ == NEST { int oplus=inclusive ? 2 : 0; int omax=min(order_max,order_+oplus); // the order up to which we test // TODO: ignore all disks with radius>=pi arr > base(omax+1); arr3 crlimit(omax+1,nv,3); for (int o=0; o<=omax; ++o) // prepare data at the required orders { base[o].Set(o,NEST); double dr=base[o].max_pixrad(); // safety distance for (tsize i=0; ipi) ? -1. : cos(rad[i]+dr); crlimit(o,i,1) = (o==0) ? cos(rad[i]) : crlimit(0,i,1); crlimit(o,i,2) = (rad[i]-dr<0.) ? 1. : cos(rad[i]-dr); } } vector > stk; // stack for pixel numbers and their orders stk.reserve(12+3*omax); // reserve maximum size to avoid reallocation for (int i=0; i<12; ++i) // insert the 12 base pixels in reverse order stk.push_back(make_pair(I(11-i),0)); int stacktop=0; // a place to save a stack position arr zone(nv); vector zstk; zstk.reserve(cmds.size()); while (!stk.empty()) // as long as there are pixels on the stack { // pop current pixel number and order from the stack I pix=stk.back().first; int o=stk.back().second; stk.pop_back(); vec3 pv(base[o].pix2vec(pix)); for (tsize i=0; i inline int T_Healpix_Base::spread_bits (int v) const { return utab[v&0xff] | (utab[(v>>8)&0xff]<<16); } template<> inline int64 T_Healpix_Base::spread_bits (int v) const { return int64(utab[ v &0xff]) | (int64(utab[(v>> 8)&0xff])<<16) | (int64(utab[(v>>16)&0xff])<<32) | (int64(utab[(v>>24)&0xff])<<48); } template<> inline int T_Healpix_Base::compress_bits (int v) const { int raw = (v&0x5555) | ((v&0x55550000)>>15); return ctab[raw&0xff] | (ctab[raw>>8]<<4); } template<> inline int T_Healpix_Base::compress_bits (int64 v) const { int64 raw = v&0x5555555555555555ull; raw|=raw>>15; return ctab[ raw &0xff] | (ctab[(raw>> 8)&0xff]<< 4) | (ctab[(raw>>32)&0xff]<<16) | (ctab[(raw>>40)&0xff]<<20); } template inline void T_Healpix_Base::nest2xyf (I pix, int &ix, int &iy, int &face_num) const { face_num = pix>>(2*order_); pix &= (npface_-1); ix = compress_bits(pix); iy = compress_bits(pix>>1); } template inline I T_Healpix_Base::xyf2nest (int ix, int iy, int face_num) const { return (I(face_num)<<(2*order_)) + spread_bits(ix) + (spread_bits(iy)<<1); } template void T_Healpix_Base::ring2xyf (I pix, int &ix, int &iy, int &face_num) const { I iring, iphi, kshift, nr; I nl2 = 2*nside_; if (pix>1; //counted from North pole iphi = (pix+1) - 2*iring*(iring-1); kshift = 0; nr = iring; face_num=(iphi-1)/nr; } else if (pix<(npix_-ncap_)) // Equatorial region { I ip = pix - ncap_; I tmp = (order_>=0) ? ip>>(order_+2) : ip/(4*nside_); iring = tmp+nside_; iphi = ip-tmp*4*nside_ + 1; kshift = (iring+nside_)&1; nr = nside_; I ire = iring-nside_+1, irm = nl2+2-ire; I ifm = iphi - ire/2 + nside_ -1, ifp = iphi - irm/2 + nside_ -1; if (order_>=0) { ifm >>= order_; ifp >>= order_; } else { ifm /= nside_; ifp /= nside_; } face_num = (ifp==ifm) ? (ifp|4) : ((ifp>1; //counted from South pole iphi = 4*iring + 1 - (ip - 2*iring*(iring-1)); kshift = 0; nr = iring; iring = 2*nl2-iring; face_num = 8 + (iphi-1)/nr; } I irt = iring - (jrll[face_num]*nside_) + 1; I ipt = 2*iphi- jpll[face_num]*nr - kshift -1; if (ipt>=nl2) ipt-=8*nside_; ix = (ipt-irt) >>1; iy = (-ipt-irt) >>1; } template I T_Healpix_Base::xyf2ring (int ix, int iy, int face_num) const { I nl4 = 4*nside_; I jr = (jrll[face_num]*nside_) - ix - iy - 1; I nr, kshift, n_before; bool shifted; get_ring_info_small(jr,n_before,nr,shifted); nr>>=2; kshift=1-shifted; I jp = (jpll[face_num]*nr + ix - iy + 1 + kshift) / 2; planck_assert(jp<=4*nr,"must not happen"); if (jp<1) jp+=nl4; // assumption: if this triggers, then nl4==4*nr return n_before + jp - 1; } template T_Healpix_Base::T_Healpix_Base () : order_(-1), nside_(0), npface_(0), ncap_(0), npix_(0), fact1_(0), fact2_(0), scheme_(RING) {} template void T_Healpix_Base::Set (int order, Healpix_Ordering_Scheme scheme) { planck_assert ((order>=0)&&(order<=order_max), "bad order"); order_ = order; nside_ = I(1)< void T_Healpix_Base::SetNside (I nside, Healpix_Ordering_Scheme scheme) { order_ = nside2order(nside); planck_assert ((scheme!=NEST) || (order_>=0), "SetNside: nside must be power of 2 for nested maps"); nside_ = nside; npface_ = nside_*nside_; ncap_ = (npface_-nside_)<<1; npix_ = 12*npface_; fact2_ = 4./npix_; fact1_ = (nside_<<1)*fact2_; scheme_ = scheme; } template double T_Healpix_Base::ring2z (I ring) const { if (ring I T_Healpix_Base::pix2ring (I pix) const { if (scheme_==RING) { if (pix>1; // counted from North pole else if (pix<(npix_-ncap_)) // Equatorial region return (pix-ncap_)/(4*nside_) + nside_; // counted from North pole else // South Polar cap return 4*nside_-((1+I(isqrt(2*(npix_-pix)-1)))>>1); } else { int face_num, ix, iy; nest2xyf(pix,ix,iy,face_num); return (I(jrll[face_num])< I T_Healpix_Base::nest2ring (I pix) const { planck_assert(order_>=0, "hierarchical map required"); int ix, iy, face_num; nest2xyf (pix, ix, iy, face_num); return xyf2ring (ix, iy, face_num); } template I T_Healpix_Base::ring2nest (I pix) const { planck_assert(order_>=0, "hierarchical map required"); int ix, iy, face_num; ring2xyf (pix, ix, iy, face_num); return xyf2nest (ix, iy, face_num); } template inline I T_Healpix_Base::nest_peano_helper (I pix, int dir) const { int face = pix>>(2*order_); I result = 0; uint8 path = peano_face2path[dir][face]; for (int shift=2*order_-2; shift>=0; shift-=2) { uint8 spix = uint8((pix>>shift) & 0x3); result <<= 2; result |= peano_subpix[dir][path][spix]; path=peano_subpath[dir][path][spix]; } return result + (I(peano_face2face[dir][face])<<(2*order_)); } template I T_Healpix_Base::nest2peano (I pix) const { return nest_peano_helper(pix,0); } template I T_Healpix_Base::peano2nest (I pix) const { return nest_peano_helper(pix,1); } template I T_Healpix_Base::loc2pix (double z, double phi, double sth, bool have_sth) const { double za = abs(z); double tt = fmodulo(phi*inv_halfpi,4.0); // in [0,4) if (scheme_==RING) { if (za<=twothird) // Equatorial region { I nl4 = 4*nside_; double temp1 = nside_*(0.5+tt); double temp2 = nside_*z*0.75; I jp = I(temp1-temp2); // index of ascending edge line I jm = I(temp1+temp2); // index of descending edge line // ring number counted from z=2/3 I ir = nside_ + 1 + jp - jm; // in {1,2n+1} I kshift = 1-(ir&1); // kshift=1 if ir even, 0 otherwise I t1 = jp+jm-nside_+kshift+1+nl4+nl4; I ip = (order_>0) ? (t1>>1)&(nl4-1) : ((t1>>1)%nl4); // in {0,4n-1} return ncap_ + (ir-1)*nl4 + ip; } else // North & South polar caps { double tp = tt-I(tt); double tmp = ((za<0.99)||(!have_sth)) ? nside_*sqrt(3*(1-za)) : nside_*sth/sqrt((1.+za)/3.); I jp = I(tp*tmp); // increasing edge line index I jm = I((1.0-tp)*tmp); // decreasing edge line index I ir = jp+jm+1; // ring number counted from the closest pole I ip = I(tt*ir); // in {0,4*ir-1} planck_assert((ip>=0)&&(ip<4*ir),"must not happen"); //ip %= 4*ir; return (z>0) ? 2*ir*(ir-1) + ip : npix_ - 2*ir*(ir+1) + ip; } } else // scheme_ == NEST { if (za<=twothird) // Equatorial region { double temp1 = nside_*(0.5+tt); double temp2 = nside_*(z*0.75); I jp = I(temp1-temp2); // index of ascending edge line I jm = I(temp1+temp2); // index of descending edge line I ifp = jp >> order_; // in {0,4} I ifm = jm >> order_; int face_num = (ifp==ifm) ? (ifp|4) : ((ifp 2/3 { int ntt = min(3,int(tt)); double tp = tt-ntt; double tmp = ((za<0.99)||(!have_sth)) ? nside_*sqrt(3*(1-za)) : nside_*sth/sqrt((1.+za)/3.); I jp = I(tp*tmp); // increasing edge line index I jm = I((1.0-tp)*tmp); // decreasing edge line index jp=min(jp,nside_-1); // for points too close to the boundary jm=min(jm,nside_-1); return (z>=0) ? xyf2nest(nside_-jm -1,nside_-jp-1,ntt) : xyf2nest(jp,jm,ntt+8); } } } template void T_Healpix_Base::pix2loc (I pix, double &z, double &phi, double &sth, bool &have_sth) const { have_sth=false; if (scheme_==RING) { if (pix>1; // counted from North pole I iphi = (pix+1) - 2*iring*(iring-1); double tmp=(iring*iring)*fact2_; z = 1.0 - tmp; if (z>0.99) { sth=sqrt(tmp*(2.-tmp)); have_sth=true; } phi = (iphi-0.5) * halfpi/iring; } else if (pix<(npix_-ncap_)) // Equatorial region { I nl4 = 4*nside_; I ip = pix - ncap_; I tmp = (order_>=0) ? ip>>(order_+2) : ip/nl4; I iring = tmp + nside_, iphi = ip-nl4*tmp+1; // 1 if iring+nside is odd, 1/2 otherwise double fodd = ((iring+nside_)&1) ? 1 : 0.5; z = (2*nside_-iring)*fact1_; phi = (iphi-fodd) * pi*0.75*fact1_; } else // South Polar cap { I ip = npix_ - pix; I iring = (1+I(isqrt(2*ip-1)))>>1; // counted from South pole I iphi = 4*iring + 1 - (ip - 2*iring*(iring-1)); double tmp=(iring*iring)*fact2_; z = tmp - 1.0; if (z<-0.99) { sth=sqrt(tmp*(2.-tmp)); have_sth=true; } phi = (iphi-0.5) * halfpi/iring; } } else { int face_num, ix, iy; nest2xyf(pix,ix,iy,face_num); I jr = (I(jrll[face_num])<0.99) { sth=sqrt(tmp*(2.-tmp)); have_sth=true; } } else if (jr > 3*nside_) { nr = nside_*4-jr; double tmp=(nr*nr)*fact2_; z = tmp - 1; if (z<-0.99) { sth=sqrt(tmp*(2.-tmp)); have_sth=true; } } else { nr = nside_; z = (2*nside_-jr)*fact1_; } I tmp=I(jpll[face_num])*nr+ix-iy; planck_assert(tmp<8*nr,"must not happen"); if (tmp<0) tmp+=8*nr; phi = (nr==nside_) ? 0.75*halfpi*tmp*fact1_ : (0.5*halfpi*tmp)/nr; } } template template void T_Healpix_Base::query_polygon_internal (const vector &vertex, int fact, rangeset &pixset) const { bool inclusive = (fact!=0); tsize nv=vertex.size(); tsize ncirc = inclusive ? nv+1 : nv; planck_assert(nv>=3,"not enough vertices in polygon"); arr vv(nv); for (tsize i=0; i normal(ncirc); int flip=0; for (tsize i=0; i1e-10,"degenerate corner"); if (i==0) flip = (hnd<0.) ? -1 : 1; else planck_assert(flip*hnd>0,"polygon is not convex"); normal[i]*=flip/normal[i].Length(); } arr rad(ncirc,halfpi); if (inclusive) { double cosrad; find_enclosing_circle (vv, normal[nv], cosrad); rad[nv]=acos(cosrad); } query_multidisc(normal,rad,fact,pixset); } template void T_Healpix_Base::query_polygon (const vector &vertex, rangeset &pixset) const { query_polygon_internal(vertex, 0, pixset); } template void T_Healpix_Base::query_polygon_inclusive (const vector &vertex, rangeset &pixset, int fact) const { planck_assert(fact>0,"fact must be a positive integer"); if ((sizeof(I)<8) && (((I(1)< base2(nside_,scheme_,SET_NSIDE); base2.query_polygon_internal(vertex,fact,pixset); return; } query_polygon_internal(vertex, fact, pixset); } template void T_Healpix_Base::query_strip_internal (double theta1, double theta2, bool inclusive, rangeset &pixset) const { if (scheme_==RING) { I ring1 = max(I(1),1+ring_above(cos(theta1))), ring2 = min(4*nside_-1,ring_above(cos(theta2))); if (inclusive) { ring1 = max(I(1),ring1-1); ring2 = min(4*nside_-1,ring2+1); } I sp1,rp1,sp2,rp2; bool dummy; get_ring_info_small(ring1,sp1,rp1,dummy); get_ring_info_small(ring2,sp2,rp2,dummy); I pix1 = sp1, pix2 = sp2+rp2; if (pix1<=pix2) pixset.append(pix1,pix2); } else planck_fail("query_strip not yet implemented for NESTED"); } template void T_Healpix_Base::query_strip (double theta1, double theta2, bool inclusive, rangeset &pixset) const { pixset.clear(); if (theta1 ps2; query_strip_internal(theta1,pi,inclusive,ps2); pixset.append(ps2); } } template inline void T_Healpix_Base::get_ring_info_small (I ring, I &startpix, I &ringpix, bool &shifted) const { if (ring < nside_) { shifted = true; ringpix = 4*ring; startpix = 2*ring*(ring-1); } else if (ring < 3*nside_) { shifted = ((ring-nside_) & 1) == 0; ringpix = 4*nside_; startpix = ncap_ + (ring-nside_)*ringpix; } else { shifted = true; I nr= 4*nside_-ring; ringpix = 4*nr; startpix = npix_-2*nr*(nr+1); } } template void T_Healpix_Base::get_ring_info (I ring, I &startpix, I &ringpix, double &costheta, double &sintheta, bool &shifted) const { I northring = (ring>2*nside_) ? 4*nside_-ring : ring; if (northring < nside_) { double tmp = northring*northring*fact2_; costheta = 1 - tmp; sintheta = sqrt(tmp*(2-tmp)); ringpix = 4*northring; shifted = true; startpix = 2*northring*(northring-1); } else { costheta = (2*nside_-northring)*fact1_; sintheta = sqrt((1+costheta)*(1-costheta)); ringpix = 4*nside_; shifted = ((northring-nside_) & 1) == 0; startpix = ncap_ + (northring-nside_)*ringpix; } if (northring != ring) // southern hemisphere { costheta = -costheta; startpix = npix_ - startpix - ringpix; } } template void T_Healpix_Base::get_ring_info2 (I ring, I &startpix, I &ringpix, double &theta, bool &shifted) const { I northring = (ring>2*nside_) ? 4*nside_-ring : ring; if (northring < nside_) { double tmp = northring*northring*fact2_; double costheta = 1 - tmp; double sintheta = sqrt(tmp*(2-tmp)); theta = atan2(sintheta,costheta); ringpix = 4*northring; shifted = true; startpix = 2*northring*(northring-1); } else { theta = acos((2*nside_-northring)*fact1_); ringpix = 4*nside_; shifted = ((northring-nside_) & 1) == 0; startpix = ncap_ + (northring-nside_)*ringpix; } if (northring != ring) // southern hemisphere { theta = pi-theta; startpix = npix_ - startpix - ringpix; } } template void T_Healpix_Base::neighbors (I pix, fix_arr &result) const { int ix, iy, face_num; (scheme_==RING) ? ring2xyf(pix,ix,iy,face_num) : nest2xyf(pix,ix,iy,face_num); const I nsm1 = nside_-1; if ((ix>0)&&(ix0)&&(iy=nside_) { x-=nside_; nbnum+=1; } if (y<0) { y+=nside_; nbnum-=3; } else if (y>=nside_) { y-=nside_; nbnum+=3; } int f = nb_facearray[nbnum][face_num]; if (f>=0) { int bits = nb_swaparray[nbnum][face_num>>2]; if (bits&1) x=nside_-x-1; if (bits&2) y=nside_-y-1; if (bits&4) std::swap(x,y); result[i] = (scheme_==RING) ? xyf2ring(x,y,f) : xyf2nest(x,y,f); } else result[i] = -1; } } } template void T_Healpix_Base::get_interpol (const pointing &ptg, fix_arr &pix, fix_arr &wgt) const { planck_assert((ptg.theta>=0)&&(ptg.theta<=pi),"invalid theta value"); double z = cos (ptg.theta); I ir1 = ring_above(z); I ir2 = ir1+1; double theta1, theta2, w1, tmp, dphi; I sp,nr; bool shift; I i1,i2; if (ir1>0) { get_ring_info2 (ir1, sp, nr, theta1, shift); dphi = twopi/nr; tmp = (ptg.phi/dphi - .5*shift); i1 = (tmp<0) ? I(tmp)-1 : I(tmp); w1 = (ptg.phi-(i1+.5*shift)*dphi)/dphi; i2 = i1+1; if (i1<0) i1 +=nr; if (i2>=nr) i2 -=nr; pix[0] = sp+i1; pix[1] = sp+i2; wgt[0] = 1-w1; wgt[1] = w1; } if (ir2<(4*nside_)) { get_ring_info2 (ir2, sp, nr, theta2, shift); dphi = twopi/nr; tmp = (ptg.phi/dphi - .5*shift); i1 = (tmp<0) ? I(tmp)-1 : I(tmp); w1 = (ptg.phi-(i1+.5*shift)*dphi)/dphi; i2 = i1+1; if (i1<0) i1 +=nr; if (i2>=nr) i2 -=nr; pix[2] = sp+i1; pix[3] = sp+i2; wgt[2] = 1-w1; wgt[3] = w1; } if (ir1==0) { double wtheta = ptg.theta/theta2; wgt[2] *= wtheta; wgt[3] *= wtheta; double fac = (1-wtheta)*0.25; wgt[0] = fac; wgt[1] = fac; wgt[2] += fac; wgt[3] +=fac; pix[0] = (pix[2]+2)&3; pix[1] = (pix[3]+2)&3; } else if (ir2==4*nside_) { double wtheta = (ptg.theta-theta1)/(pi-theta1); wgt[0] *= (1-wtheta); wgt[1] *= (1-wtheta); double fac = wtheta*0.25; wgt[0] += fac; wgt[1] += fac; wgt[2] = fac; wgt[3] =fac; pix[2] = ((pix[0]+2)&3)+npix_-4; pix[3] = ((pix[1]+2)&3)+npix_-4; } else { double wtheta = (ptg.theta-theta1)/(theta2-theta1); wgt[0] *= (1-wtheta); wgt[1] *= (1-wtheta); wgt[2] *= wtheta; wgt[3] *= wtheta; } if (scheme_==NEST) for (tsize m=0; m void T_Healpix_Base::swap (T_Healpix_Base &other) { std::swap(order_,other.order_); std::swap(nside_,other.nside_); std::swap(npface_,other.npface_); std::swap(ncap_,other.ncap_); std::swap(npix_,other.npix_); std::swap(fact1_,other.fact1_); std::swap(fact2_,other.fact2_); std::swap(scheme_,other.scheme_); } template double T_Healpix_Base::max_pixrad() const { vec3 va,vb; va.set_z_phi (2./3., pi/(4*nside_)); double t1 = 1.-1./nside_; t1*=t1; vb.set_z_phi (1-t1/3, 0); return v_angle(va,vb); } template double T_Healpix_Base::max_pixrad(I ring) const { if (ring>=2*nside_) ring=4*nside_-ring; double z=ring2z(ring), z_up=(ring>1) ? ring2z(ring-1) : 1.; vec3 mypos, uppos; uppos.set_z_phi(z_up,0); if (ring<=nside_) { mypos.set_z_phi(z,pi/(4*ring)); return v_angle(mypos,uppos); } mypos.set_z_phi(z,0); double vdist=v_angle(mypos,uppos); double hdist=sqrt(1.-z*z)*pi/(4*nside_); return max(hdist,vdist); } template void T_Healpix_Base::xyf2loc (double x, double y, int face, double &z, double &phi, double &sth, bool &have_sth) const { have_sth = false; double jr = jrll[face] - x - y; double nr; if (jr<1) { nr = jr; double tmp = nr*nr/3.; z = 1 - tmp; if (z > 0.99) { sth = std::sqrt(tmp*(2.0-tmp)); have_sth = true; } } else if (jr>3) { nr = 4-jr; double tmp = nr*nr/3.; z = tmp - 1; if (z<-0.99) { sth = std::sqrt(tmp*(2.-tmp)); have_sth = true; } } else { nr = 1; z = (2-jr)*2./3.; } double tmp=jpll[face]*nr+x-y; if (tmp<0) tmp+=8; if (tmp>=8) tmp-=8; phi = (nr<1e-15) ? 0 : (0.5*halfpi*tmp)/nr; } namespace { vec3 locToVec3 (double z, double phi, double sth, bool have_sth) { if (have_sth) return vec3(sth*cos(phi),sth*sin(phi),z); else { vec3 res; res.set_z_phi (z, phi); return res; } } } // unnamed namespace template void T_Healpix_Base::boundaries(I pix, tsize step, vector &out) const { out.resize(4*step); int ix, iy, face; pix2xyf(pix, ix, iy, face); double dc = 0.5 / nside_; double xc = (ix + 0.5)/nside_, yc = (iy + 0.5)/nside_; double d = 1.0/(step*nside_); for (tsize i=0; i arr T_Healpix_Base::swap_cycles() const { planck_assert(order_>=0, "need hierarchical map"); planck_assert(order_<=13, "map too large"); arr result(swap_clen[order_]); tsize ofs=0; for (int m=0; m; template class T_Healpix_Base; healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/Healpix_cxx.dox0000650000175000017530000001250112255154051027646 0ustar zoncaplanck00000000000000/*! \mainpage HEALPix C++ documentation
    • \ref components "Programming interface"
    • \ref facilities "Facilities"
    */ /*! \page components Code components Classes: - Healpix_Base contains all functionality related to the HEALPix pixelisation which does not require actual map data. - Healpix_Base2 is analogous to Healpix_Base, but allows for much higher resolutions. - Healpix_Map is derived from Healpix_Base and implements additional functionality like change of the ordering scheme, up- and degrading and interpolation. - Alm is used to store spherical harmonic coefficients. - PowSpec is used to store \f$C_l\f$ coefficients. Conversions between different data types: - \ref alm_healpix_group "HEALPix maps <-> a_lm". - \ref alm_ps_group "power spectra <-> a_lm". FITS I/O: - for \ref healpix_map_fitsio_group "HEALPix Maps" - for \ref alm_fitsio_group "spherical harmonic coefficients" - for \ref powspec_fitsio_group "power spectra" */ /*! \page facilities HEALPix C++ facilities \section syn_alm_cxx This program reads a set of \f$C_l\f$ from disk and converts it to a set of \f$a_{lm}\f$. \verbinclude syn_alm_cxx.par.txt \section alm2map_cxx This program reads a set of \f$a_{lm}\f$ from disk and converts them to a HEALPix map. \verbinclude alm2map_cxx.par.txt \section anafast_cxx This program performs harmonic analysis of a HEALPix map up to a user-specified maximum spherical harmonic order \f$l_{\mbox{max}}\f$. The integrals are computed on the whole sphere. Scalar, or scalar and tensor, spherical harmonic coefficients are evaluated from the map(s) if the input provides, respectively, only the temperature, or temperature and polarisation maps. The total operation count scales as \f${\cal {O}}(N_{\mbox{pix}}^{3/2})\f$ with a prefactor depending on \f$l_{\mbox{max}}\f$. Anafast_cxx reads a file containing the map(s) and produces a file containing the temperature power spectrum \f$C^T_l\f$ and, if requested, also the polarisation power spectra \f$C^E_l\f$, \f$C^B_l\f$ and \f$C^{T\times E}_l\f$. The \f$a_{lm}\f$ coefficients computed during the execution also can be written to a file if requested. Anafast_cxx executes an approximate, discrete point-set quadrature on a sphere sampled at the HEALPix pixel centers. Spherical harmonic transforms are computed using recurrence relations for Legendre polynomials on co-latitude (\f$\vartheta\f$) and Fast Fourier transforms on longitude (\f$\varphi\f$). Anafast permits two execution options which allow a significant improvement of accuracy of the approximate quadrature performed by this facility: - An improved analysis using the provided ring weights, which correct the quadrature on latitude, and/or - An iterative scheme using in succession several backward and forward harmonic transforms of the maps. \verbinclude anafast_cxx.par.txt \section map2tga This program reads in a HEALPix sky map in FITS format and generates an image in TGA format. map2tga allows the selection of the projection scheme (Mollweide or Gnomonic for small patches of the sky), color table, color bar inclusion, linear or log scaling, maximum and minimum range for the plot and plot-title. The facility provides a command-line interface, but can also read a parameter file. \verbinclude map2tga.par.txt \section rotalm_cxx Performs a coordinate transformation on a set of \f$a_{lm}\f$. \verbatim Usage: rotalm_cxx Transform 1: Equatorial (2000) -> Galactic (2000) 2: Galactic (2000) -> Equatorial (2000) 3: Equatorial (2000) -> Ecliptic (2000) 4: Ecliptic (2000) -> Equatorial (2000) 5: Ecliptic (2000) -> Galactic (2000) 6: Galactic (2000) -> Ecliptic (2000) 7: Equatorial (1950) -> Galactic (1950) 8: Galactic (1950) -> Equatorial (1950) 9: Equatorial (1950) -> Ecliptic (1950) 10: Ecliptic (1950) -> Equatorial (1950) 11: Ecliptic (1950) -> Galactic (1950) 12: Galactic (1950) -> Ecliptic (1950) \endverbatim \section mult_alm This program reads a set of (unpolarised or polarised) \f$a_{lm}\f$, removes pixel window functions and/or Gaussian beams, applies different pixel window functions or Gaussian beams, and outputs the result. \verbinclude mult_alm.par.txt \section smoothing_cxx This program reads a (unpolarised or polarised) HEALPix map, converts it to \f$a_{lm}\f$, performs a smoothing operation with a Gaussian beam, converts the \f$a_{lm}\f$ back to a map and outputs the result. \verbinclude smoothing_cxx.par.txt \section calc_powspec This program reads one or two sets of \f$a_{lm}\f$, extracts the (unpolarised or polarised) power spectrum or the unpolarised cross power spectrum, and outputs the result. \verbatim Usage: calc_powspec [] \endverbatim \section median_filter_cxx This program inputs a HEALPix map, runs a median filter with the desired radius on it and saves the result to another file. \verbatim Usage: median_filter_cxx \endverbatim */ healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/median_filter_cxx.cc0000650000175000017530000000030412255154051030647 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN median_filter_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_data_io.h0000650000175000017530000000332512255154051030145 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003, 2005 Max-Planck-Society * Author: Martin Reinecke */ #ifndef HEALPIX_DATA_IO_H #define HEALPIX_DATA_IO_H #include class paramfile; template class arr; void read_weight_ring (const std::string &dir, int nside, arr &weight); void get_ring_weights (paramfile ¶ms, int nside, arr &weight); void read_pixwin (const std::string &dir, int nside, arr &temp); void read_pixwin (const std::string &dir, int nside, arr &temp, arr &pol); void get_pixwin (paramfile ¶ms, int lmax, int nside, arr &pixwin); void get_pixwin (paramfile ¶ms, int lmax, int nside, arr &pixwin, arr &pixwin_pol); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_harmonic_cxx.cc0000650000175000017530000000030712255154051031343 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN udgrade_harmonic_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/hotspots_cxx_module.cc0000650000175000017530000000601312255154051031300 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2010 Max-Planck-Society * Author: Martin Reinecke */ #include #include "paramfile.h" #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "fitshandle.h" #include "levels_facilities.h" #include "announce.h" using namespace std; int hotspots_cxx_module (int argc, const char **argv) { module_startup ("hotspots_cxx", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); string infile = params.find("infile"); string mapfile = params.find("outmap",""); bool have_mapfile = mapfile!=""; string minfile = params.find("minfile",""); bool have_minfile = minfile!=""; string maxfile = params.find("maxfile",""); bool have_maxfile = maxfile!=""; planck_assert (have_mapfile || have_minfile || have_maxfile, "no output file specified"); Healpix_Map inmap; read_Healpix_map_from_fits(infile,inmap,1,2); Healpix_Map outmap; if (have_mapfile) outmap.Set(inmap.Order(),inmap.Scheme()); ofstream minout, maxout; if (have_minfile) minout.open(minfile.c_str()); if (have_maxfile) maxout.open(maxfile.c_str()); fix_arr nb; // FIXME: This should be parallelized for (int m=0; m(value, Healpix_undef)) { inmap.neighbors(m,nb); bool ismax=true, ismin=true; for (tsize n=0; n=0) { float nbval = inmap[nb[n]]; if (!approx(nbval, Healpix_undef)) { if (nbval>=value) ismax=false; if (nbval<=value) ismin=false; } } } if (have_mapfile) outmap[m] = float((ismax||ismin) ? value : Healpix_undef); if (have_minfile && ismin) minout << m << " " << value << endl; if (have_maxfile && ismax) maxout << m << " " << value << endl; } } if (have_mapfile) write_Healpix_map_to_fits (mapfile,outmap,PLANCK_FLOAT32); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_powspec_tools.cc0000650000175000017530000003246112255154051030725 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "alm_powspec_tools.h" #include "string_utils.h" #include "alm.h" #include "planck_rng.h" #include "powspec.h" #include "xcomplex.h" #include "rotmatrix.h" #include "openmp_support.h" #include "wigner.h" #include "lsconstants.h" using namespace std; template void create_alm (const PowSpec &powspec, Alm > &alm, planck_rng &rng) { int lmax = alm.Lmax(); int mmax = alm.Mmax(); const double hsqrt2 = 1/sqrt(2.); for (int l=0; l<=lmax; ++l) { double rms_tt = sqrt(powspec.tt(l)); double zeta1_r = rng.rand_gauss(); alm(l,0) = T(zeta1_r * rms_tt); for (int m=1; m<=min(l,mmax); ++m) { zeta1_r = rng.rand_gauss()*hsqrt2; double zeta1_i = rng.rand_gauss()*hsqrt2; alm(l,m).Set (T(zeta1_r*rms_tt), T(zeta1_i*rms_tt)); } } } template void create_alm (const PowSpec &powspec, Alm > &alm, planck_rng &rng); template void create_alm (const PowSpec &powspec, Alm > &alm, planck_rng &rng); template void create_alm_pol (const PowSpec &powspec, Alm > &almT, Alm > &almG, Alm > &almC, planck_rng &rng) { int lmax = almT.Lmax(); int mmax = almT.Mmax(); const double hsqrt2 = 1/sqrt(2.); for (int l=0; l<=lmax; ++l) { double rms_tt=0, rms_g1=0; if (powspec.tt(l) != 0) { rms_tt = sqrt(powspec.tt(l)); rms_g1 = powspec.tg(l)/rms_tt; } double zeta1_r = rng.rand_gauss(); almT(l,0) = T(zeta1_r * rms_tt); almG(l,0) = T(zeta1_r * rms_g1); for (int m=1; m<=min(l,mmax); ++m) { zeta1_r = rng.rand_gauss()*hsqrt2; double zeta1_i = rng.rand_gauss()*hsqrt2; almT(l,m).Set (T(zeta1_r*rms_tt), T(zeta1_i*rms_tt)); almG(l,m).Set (T(zeta1_r*rms_g1), T(zeta1_i*rms_g1)); } } for (int l=0; l<=lmax; ++l) { double rms_g2 = 0; double rms_cc = 0; if (powspec.tt(l) != 0) { rms_g2 = powspec.gg(l) - (powspec.tg(l)/powspec.tt(l))*powspec.tg(l); if (rms_g2 <= 0) { planck_assert (abs(rms_g2) <= 1e-8*abs(powspec.gg(l)), "Inconsistent TT, GG and TG spectra at l="+dataToString(l)); rms_g2 = 0; } rms_g2 = sqrt(rms_g2); rms_cc = sqrt(powspec.cc(l)); } almG(l,0) += T(rng.rand_gauss()*rms_g2); almC(l,0) = T(rng.rand_gauss()*rms_cc); for (int m=1; m<=min(l,mmax); ++m) { double zeta2_r = rng.rand_gauss()*hsqrt2; double zeta2_i = rng.rand_gauss()*hsqrt2; double zeta3_r = rng.rand_gauss()*hsqrt2; double zeta3_i = rng.rand_gauss()*hsqrt2; almG(l,m) += xcomplex (T(zeta2_r*rms_g2),T(zeta2_i*rms_g2)); almC(l,m).Set (T(zeta3_r*rms_cc),T(zeta3_i*rms_cc)); } } } template void create_alm_pol (const PowSpec &powspec, Alm > &almT, Alm > &almG, Alm > &almC, planck_rng &rng); template void create_alm_pol (const PowSpec &powspec, Alm > &almT, Alm > &almG, Alm > &almC, planck_rng &rng); template void extract_crosspowspec (const Alm > &alm1, const Alm > &alm2,PowSpec &powspec) { planck_assert (alm1.conformable(alm2), "a_lm are not conformable"); arr tt(alm1.Lmax()+1); for (int l=0; l<=alm1.Lmax(); ++l) { tt[l] = alm1(l,0).re*alm2(l,0).re; int limit = min(l,alm1.Mmax()); for (int m=1; m<=limit; ++m) tt[l] += 2 * (alm1(l,m).re*alm2(l,m).re + alm1(l,m).im*alm2(l,m).im); tt[l] /= (2*l+1); } powspec.Set(tt); } template void extract_crosspowspec (const Alm > &alm1, const Alm > &alm2, PowSpec &powspec); template void extract_crosspowspec (const Alm > &alm1, const Alm > &alm2, PowSpec &powspec); template void extract_powspec (const Alm > &alm, PowSpec &powspec) { extract_crosspowspec (alm,alm,powspec); } template void extract_powspec (const Alm > &alm, PowSpec &powspec); template void extract_powspec (const Alm > &alm, PowSpec &powspec); namespace { template void extract_crosspowspec (const Alm > &almT1, const Alm > &almG1, const Alm > &almC1, const Alm > &almT2, const Alm > &almG2, const Alm > &almC2, PowSpec &powspec) { planck_assert (almT1.conformable(almG1) && almT1.conformable(almC1) && almT1.conformable(almT2) && almT1.conformable(almG2) && almT1.conformable(almC2), "a_lm are not conformable"); int lmax = almT1.Lmax(); arr tt(lmax+1), gg(lmax+1), cc(lmax+1), tg(lmax+1), tc(lmax+1), gc(lmax+1); for (int l=0; l<=lmax; ++l) { tt[l] = almT1(l,0).re*almT2(l,0).re; gg[l] = almG1(l,0).re*almG2(l,0).re; cc[l] = almC1(l,0).re*almC2(l,0).re; tg[l] = almT1(l,0).re*almG2(l,0).re; tc[l] = almT1(l,0).re*almC2(l,0).re; gc[l] = almG1(l,0).re*almC2(l,0).re; int limit = min(l,almT1.Mmax()); for (int m=1; m<=limit; ++m) { tt[l] += 2 * (almT1(l,m).re*almT2(l,m).re + almT1(l,m).im*almT2(l,m).im); gg[l] += 2 * (almG1(l,m).re*almG2(l,m).re + almG1(l,m).im*almG2(l,m).im); cc[l] += 2 * (almC1(l,m).re*almC2(l,m).re + almC1(l,m).im*almC2(l,m).im); tg[l] += 2 * (almT1(l,m).re*almG2(l,m).re + almT1(l,m).im*almG2(l,m).im); tc[l] += 2 * (almT1(l,m).re*almC2(l,m).re + almT1(l,m).im*almC2(l,m).im); gc[l] += 2 * (almG1(l,m).re*almC2(l,m).re + almG1(l,m).im*almC2(l,m).im); } tt[l] /= (2*l+1); gg[l] /= (2*l+1); cc[l] /= (2*l+1); tg[l] /= (2*l+1); tc[l] /= (2*l+1); gc[l] /= (2*l+1); } powspec.Set(tt,gg,cc,tg,tc,gc); } } // unnamed namespace template void extract_powspec (const Alm > &almT, const Alm > &almG, const Alm > &almC, PowSpec &powspec) { extract_crosspowspec(almT,almG,almC,almT,almG,almC,powspec); } template void extract_powspec (const Alm > &almT, const Alm > &almG, const Alm > &almC, PowSpec &powspec); template void extract_powspec (const Alm > &almT, const Alm > &almG, const Alm > &almC, PowSpec &powspec); template void smoothWithGauss (Alm > &alm, double fwhm) { int fct = (fwhm>=0) ? 1 : -1; double sigma = fwhm*fwhm2sigma; arr gb(alm.Lmax()+1); for (int l=0; l<=alm.Lmax(); ++l) gb[l] = exp(-.5*fct*l*(l+1)*sigma*sigma); alm.ScaleL(gb); } template void smoothWithGauss (Alm > &alm, double fwhm); template void smoothWithGauss (Alm > &alm, double fwhm); template void smoothWithGauss (Alm > &almT, Alm > &almG, Alm > &almC, double fwhm) { int fct = (fwhm>=0) ? 1 : -1; double sigma = fwhm*fwhm2sigma; double fact_pol = exp(2*fct*sigma*sigma); arr gb(almT.Lmax()+1); for (int l=0; l<=almT.Lmax(); ++l) gb[l] = exp(-.5*fct*l*(l+1)*sigma*sigma); almT.ScaleL(gb); for (int l=0; l<=almT.Lmax(); ++l) gb[l] *= fact_pol; almG.ScaleL(gb); almC.ScaleL(gb); } template void smoothWithGauss (Alm > &almT, Alm > &almG, Alm > &almC, double fwhm); template void smoothWithGauss (Alm > &almT, Alm > &almG, Alm > &almC, double fwhm); template void rotate_alm (Alm > &alm, double psi, double theta, double phi) { planck_assert (alm.Lmax()==alm.Mmax(), "rotate_alm: lmax must be equal to mmax"); int lmax=alm.Lmax(); arr > exppsi(lmax+1), expphi(lmax+1); for (int m=0; m<=lmax; ++m) { exppsi[m].Set (cos(psi*m),-sin(psi*m)); expphi[m].Set (cos(phi*m),-sin(phi*m)); } wigner_d_risbo_openmp rec(lmax,theta); arr > almtmp(lmax+1); for (int l=0; l<=lmax; ++l) { const arr2 &d(rec.recurse()); for (int m=0; m<=l; ++m) almtmp[m] = xcomplex(alm(l,0))*d[l][l+m]; #pragma omp parallel { int64 lo,hi; openmp_calc_share(0,l+1,lo,hi); bool flip = true; for (int mm=1; mm<=l; ++mm) { xcomplex t1 = xcomplex(alm(l,mm))*exppsi[mm]; bool flip2 = ((mm+lo)&1) ? true : false; for (int m=lo; m(almtmp[m]*expphi[m]); } } template void rotate_alm (Alm > &alm, double psi, double theta, double phi); template void rotate_alm (Alm > &alm, double psi, double theta, double phi); template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, double psi, double theta, double phi) { planck_assert (almT.Lmax()==almT.Mmax(), "rotate_alm: lmax must be equal to mmax"); planck_assert (almG.conformable(almT) && almC.conformable(almT), "rotate_alm: a_lm are not conformable"); int lmax=almT.Lmax(); arr > exppsi(lmax+1), expphi(lmax+1); for (int m=0; m<=lmax; ++m) { exppsi[m].Set (cos(psi*m),-sin(psi*m)); expphi[m].Set (cos(phi*m),-sin(phi*m)); } wigner_d_risbo_openmp rec(lmax,theta); arr > almtmpT(lmax+1), almtmpG(lmax+1), almtmpC(lmax+1); for (int l=0; l<=lmax; ++l) { const arr2 &d(rec.recurse()); for (int m=0; m<=l; ++m) { almtmpT[m] = xcomplex(almT(l,0))*d[l][m+l]; almtmpG[m] = xcomplex(almG(l,0))*d[l][m+l]; almtmpC[m] = xcomplex(almC(l,0))*d[l][m+l]; } #pragma omp parallel { int64 lo,hi; openmp_calc_share(0,l+1,lo,hi); bool flip = true; for (int mm=1; mm<=l; ++mm) { xcomplex t1T = xcomplex(almT(l,mm))*exppsi[mm]; xcomplex t1G = xcomplex(almG(l,mm))*exppsi[mm]; xcomplex t1C = xcomplex(almC(l,mm))*exppsi[mm]; bool flip2 = ((mm+lo)&1) ? true : false; for (int m=lo; m(almtmpT[m]*expphi[m]); almG(l,m) = xcomplex(almtmpG[m]*expphi[m]); almC(l,m) = xcomplex(almtmpC[m]*expphi[m]); } } } template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, double psi, double theta, double phi); template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, double psi, double theta, double phi); template void rotate_alm (Alm > &alm, const rotmatrix &mat) { double a1, a2, a3; mat.Extract_CPAC_Euler_Angles (a1, a2, a3); rotate_alm (alm, a3, a2, a1); } template void rotate_alm (Alm > &alm, const rotmatrix &mat); template void rotate_alm (Alm > &alm, const rotmatrix &mat); template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, const rotmatrix &mat) { double a1, a2, a3; mat.Extract_CPAC_Euler_Angles (a1, a2, a3); rotate_alm (almT, almG, almC, a3, a2, a1); } template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, const rotmatrix &mat); template void rotate_alm (Alm > &almT, Alm > &almG, Alm > &almC, const rotmatrix &mat); healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/calc_powspec_module.cc0000650000175000017530000000507712255154051031206 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2004-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "fitshandle.h" #include "paramfile.h" #include "alm.h" #include "alm_fitsio.h" #include "powspec.h" #include "powspec_fitsio.h" #include "alm_powspec_tools.h" #include "levels_facilities.h" #include "announce.h" using namespace std; int calc_powspec_module (int argc, const char **argv) { module_startup ("calc_powspec",argc,argv); paramfile params (getParamsFromCmdline(argc,argv)); bool pol=params.find("pol",false); string alm1=params.find("alm1"); string ps=params.find("ps"); if (!params.param_present("alm2")) { int lmax,mmax; pol ? get_almsize_pol(alm1,lmax,mmax) : get_almsize (alm1,lmax,mmax); Alm > almT, almG, almC; pol ? read_Alm_from_fits (alm1,almT,almG,almC,lmax,mmax) : read_Alm_from_fits (alm1,almT,lmax,mmax); PowSpec powspec; pol ? extract_powspec (almT,almG,almC,powspec) : extract_powspec (almT,powspec); write_powspec_to_fits (ps,powspec,pol ? 6 : 1); } else { planck_assert(!pol, "polarisation not supported for cross-powerspectra"); int lmax,mmax; get_almsize(alm1,lmax,mmax); Alm > Alm1; read_Alm_from_fits (alm1,Alm1,lmax,mmax); string alm2=params.find("alm2"); get_almsize(alm2,lmax,mmax); Alm > Alm2; read_Alm_from_fits (alm2,Alm2,lmax,mmax); PowSpec powspec; extract_crosspowspec (Alm1,Alm2,powspec); write_powspec_to_fits (ps,powspec,1); } return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_tables.h0000650000175000017530000000366512255154051030026 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file healpix_tables.h * Copyright (C) 2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef HEALPIX_TABLES_H #define HEALPIX_TABLES_H #include "datatypes.h" /*! The two possible ordering schemes of a HEALPix map. */ enum Healpix_Ordering_Scheme { RING, /*!< RING scheme */ NEST /*!< NESTED scheme */ }; Healpix_Ordering_Scheme string2HealpixScheme (const std::string &inp); class nside_dummy {}; extern const nside_dummy SET_NSIDE; class Healpix_Tables { protected: static const uint16 ctab[], utab[]; static const int jrll[], jpll[]; static const uint8 peano_subpix[2][8][4], peano_subpath[2][8][4], peano_face2path[2][12], peano_face2face[2][12]; static const int nb_xoffset[], nb_yoffset[], nb_facearray[][12], nb_swaparray[][3]; static const int swap_clen[], swap_cycle[]; }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/planck.make0000650000175000017530000000245612255154051026775 0ustar zoncaplanck00000000000000PKG:=Healpix_cxx SD:=$(SRCROOT)/$(PKG) OD:=$(BLDROOT)/$(PKG) FULL_INCLUDE+= -I$(SD) HDR_$(PKG):=$(SD)/*.h LIB_$(PKG):=$(LIBDIR)/libhealpix_cxx.a CXXBIN:=syn_alm_cxx alm2map_cxx anafast_cxx map2tga udgrade_cxx udgrade_harmonic_cxx hotspots_cxx calc_powspec median_filter_cxx hpxtest smoothing_cxx mult_alm rotalm_cxx SPHERE_OBJ:= powspec.o alm.o alm_powspec_tools.o HEALPIX_OBJ:= healpix_tables.o healpix_base.o healpix_map.o alm_healpix_tools.o IO_OBJ:= alm_fitsio.o powspec_fitsio.o healpix_data_io.o healpix_map_fitsio.o MOD_OBJ:= syn_alm_cxx_module.o anafast_cxx_module.o alm2map_cxx_module.o map2tga_module.o udgrade_cxx_module.o udgrade_harmonic_cxx_module.o smoothing_cxx_module.o hotspots_cxx_module.o calc_powspec_module.o median_filter_cxx_module.o mult_alm_module.o LIBOBJ:= $(SPHERE_OBJ) $(HEALPIX_OBJ) $(IO_OBJ) $(MOD_OBJ) ALLOBJ:=$(LIBOBJ) $(CXXBIN:%=%.o) LIBOBJ:=$(LIBOBJ:%=$(OD)/%) ALLOBJ:=$(ALLOBJ:%=$(OD)/%) ODEP:=$(HDR_$(PKG)) $(HDR_cxxsupport) $(HDR_libsharp) $(HDR_libfftpack) $(HDR_c_utils) BDEP:=$(LIB_$(PKG)) $(LIB_cxxsupport) $(LIB_libsharp) $(LIB_libfftpack) $(LIB_c_utils) $(LIB_libcfitsio) $(LIB_$(PKG)): $(LIBOBJ) $(ALLOBJ): $(ODEP) | $(OD)_mkdir CXXBIN:=$(CXXBIN:%=$(BINDIR)/%) $(CXXBIN): $(BINDIR)/% : $(OD)/%.o $(BDEP) all_hdr+=$(HDR_$(PKG)) all_lib+=$(LIB_$(PKG)) all_cxxbin+=$(CXXBIN) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_harmonic_cxx_module.cc0000654000175000017530000001120112264023644032712 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2012-2013 Max-Planck-Society * Author: Martin Reinecke */ #include "paramfile.h" #include "alm.h" #include "xcomplex.h" #include "healpix_data_io.h" #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "alm_healpix_tools.h" #include "levels_facilities.h" #include "announce.h" #include "lsconstants.h" using namespace std; namespace { template void udgrade_harmonic_cxx (paramfile ¶ms) { string infile = params.template find("infile"); string outfile = params.template find("outfile"); int nlmax = params.template find("nlmax"); int nside = params.template find("nside"); int nside_pixwin_in = params.template find("nside_pixwin_in",0); planck_assert (nside_pixwin_in>=0,"nside_pixwin_in must be >= 0"); int nside_pixwin_out = params.template find("nside_pixwin_out",0); planck_assert (nside_pixwin_out>=0,"nside_pixwin_out must be >= 0"); int num_iter = params.template find("iter_order",0); bool polarisation = params.template find("polarisation",false); string datadir; if ((nside_pixwin_in>0) || (nside_pixwin_out>0)) datadir = params.template find("healpix_data"); if (!polarisation) { Healpix_Map map; read_Healpix_map_from_fits(infile,map,1,2); double avg=map.average(); map.Add(T(-avg)); arr weight; get_ring_weights (params,map.Nside(),weight); Alm > alm(nlmax,nlmax); if (map.Scheme()==NEST) map.swap_scheme(); map2alm_iter(map,alm,num_iter,weight); arr temp(nlmax+1); if (nside_pixwin_in>0) { read_pixwin(datadir,nside_pixwin_in,temp); for (int l=0; l<=nlmax; ++l) temp[l] = 1/temp[l]; alm.ScaleL (temp); } if (nside_pixwin_out>0) { read_pixwin(datadir,nside_pixwin_out,temp); alm.ScaleL (temp); } alm(0,0) += T(avg*sqrt(fourpi)); map.SetNside(nside,RING); alm2map (alm,map); write_Healpix_map_to_fits (outfile,map,planckType()); } else { Healpix_Map mapT, mapQ, mapU; read_Healpix_map_from_fits(infile,mapT,mapQ,mapU,2); double avg=mapT.average(); mapT.Add(T(-avg)); arr weight; get_ring_weights (params,mapT.Nside(),weight); Alm > almT(nlmax,nlmax), almG(nlmax,nlmax), almC(nlmax,nlmax); if (mapT.Scheme()==NEST) mapT.swap_scheme(); if (mapQ.Scheme()==NEST) mapQ.swap_scheme(); if (mapU.Scheme()==NEST) mapU.swap_scheme(); map2alm_pol_iter (mapT,mapQ,mapU,almT,almG,almC,num_iter,weight); arr temp(nlmax+1), pol(nlmax+1); if (nside_pixwin_in>0) { read_pixwin(datadir,nside_pixwin_in,temp,pol); for (int l=0; l<=nlmax; ++l) { temp[l] = 1/temp[l]; if (pol[l]!=0.) pol[l] = 1/pol[l]; } almT.ScaleL(temp); almG.ScaleL(pol); almC.ScaleL(pol); } if (nside_pixwin_out>0) { read_pixwin(datadir,nside_pixwin_out,temp,pol); almT.ScaleL(temp); almG.ScaleL(pol); almC.ScaleL(pol); } almT(0,0) += T(avg*sqrt(fourpi)); mapT.SetNside(nside,RING); mapQ.SetNside(nside,RING); mapU.SetNside(nside,RING); alm2map_pol (almT,almG,almC,mapT,mapQ,mapU); write_Healpix_map_to_fits (outfile,mapT,mapQ,mapU,planckType()); } } } // unnamed namespace int udgrade_harmonic_cxx_module (int argc, const char **argv) { module_startup ("udgrade_harmonic_cxx", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); bool dp = params.find ("double_precision",false); dp ? udgrade_harmonic_cxx(params) : udgrade_harmonic_cxx (params); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map_fitsio.h0000650000175000017530000001001712255154051030673 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file healpix_map_fitsio.h * Copyright (C) 2003-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef HEALPIX_MAP_FITSIO_H #define HEALPIX_MAP_FITSIO_H #include #include "datatypes.h" #include "fitshandle.h" #include "healpix_base.h" template class arr; template class Healpix_Map; /*! \defgroup healpix_map_fitsio_group FITS-based I/O of HEALPix maps */ /*! \{ */ /*! Reads the map stored in column \a colnum of the FITS binary table pointed to by \a inp into \a map. */ template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &map, int colnum=1); /*! Opens the FITS file \a filename, jumps to the HDU \a hdunum, and reads the column \a colnum into \a map. */ template void read_Healpix_map_from_fits (const std::string &filename, Healpix_Map &map, int colnum=1, int hdunum=2); template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU); template void read_Healpix_map_from_fits (const std::string &filename, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU, int hdunum=2); /*! Inserts a new binary table into \a out, which contains one column of Planck type \a datatype with the name \a name, and writes all HEALPix specific keywords based on the information in \a base. */ void prepare_Healpix_fitsmap (fitshandle &out, const Healpix_Base &base, PDT datatype, const arr &colname); /*! Inserts a new binary table into \a out, which contains one column of Planck type \a datatype, and stores \a map into this column. */ template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &map, PDT datatype); /*! Inserts a new binary table into \a out, which contains three columns of Planck type \a datatype, and stores \a mapT, \a mapQ and \a mapU into these columns. */ template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, PDT datatype); /*! Creates a new FITS file with the name \a outfile, with a binary table in HDU 2, which contains one column of Planck type \a datatype, and stores \a map into this column. */ template inline void write_Healpix_map_to_fits (const std::string &outfile, const Healpix_Map &map, PDT datatype) { fitshandle out; out.create (outfile); write_Healpix_map_to_fits (out,map,datatype); } /*! Creates a new FITS file with the name \a outfile, with a binary table in HDU 2, which contains three columns of Planck type \a datatype, and stores \a mapT, \a mapQ and \a mapU into this column. */ template inline void write_Healpix_map_to_fits (const std::string &outfile, const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, PDT datatype) { fitshandle out; out.create (outfile); write_Healpix_map_to_fits (out,mapT,mapQ,mapU,datatype); } /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/map2tga.cc0000650000175000017530000000027212255154051026522 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN map2tga_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm.cc0000650000175000017530000000275612255154051025751 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file alm.cc * Class for storing spherical harmonic coefficients. * * Copyright (C) 2003-2011 Max-Planck-Society * \author Martin Reinecke */ #include "alm.h" using namespace std; //static tsize Alm_Base::Num_Alms (int l, int m) { planck_assert(m<=l,"mmax must not be larger than lmax"); return ((m+1)*(m+2))/2 + (m+1)*(l-m); } void Alm_Base::swap (Alm_Base &other) { std::swap(lmax, other.lmax); std::swap(mmax, other.mmax); std::swap(tval, other.tval); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm.h0000650000175000017530000001320312255154051025600 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file alm.h * Class for storing spherical harmonic coefficients. * * Copyright (C) 2003-2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_ALM_H #define PLANCK_ALM_H #include "arr.h" /*! Base class for calculating the storage layout of spherical harmonic coefficients. */ class Alm_Base { protected: int lmax, mmax, tval; public: /*! Returns the total number of coefficients for maximum quantum numbers \a l and \a m. */ static tsize Num_Alms (int l, int m); /*! Constructs an Alm_Base object with given \a lmax and \a mmax. */ Alm_Base (int lmax_=0, int mmax_=0) : lmax(lmax_), mmax(mmax_), tval(2*lmax+1) {} /*! Changes the object's maximum quantum numbers to \a lmax and \a mmax. */ void Set (int lmax_, int mmax_) { lmax=lmax_; mmax=mmax_; tval=2*lmax+1; } /*! Returns the maximum \a l */ int Lmax() const { return lmax; } /*! Returns the maximum \a m */ int Mmax() const { return mmax; } /*! Returns an array index for a given m, from which the index of a_lm can be obtained by adding l. */ int index_l0 (int m) const { return ((m*(tval-m))>>1); } /*! Returns the array index of the specified coefficient. */ int index (int l, int m) const { return index_l0(m) + l; } /*! Returns \a true, if both objects have the same \a lmax and \a mmax, else \a false. */ bool conformable (const Alm_Base &other) const { return ((lmax==other.lmax) && (mmax==other.mmax)); } /*! Swaps the contents of two Alm_Base objects. */ void swap (Alm_Base &other); }; /*! Class for storing spherical harmonic coefficients. */ template class Alm: public Alm_Base { private: arr alm; public: /*! Constructs an Alm object with given \a lmax and \a mmax. */ Alm (int lmax_=0, int mmax_=0) : Alm_Base(lmax_,mmax_), alm (Num_Alms(lmax,mmax)) {} /*! Deletes the old coefficients and allocates storage according to \a lmax and \a mmax. */ void Set (int lmax_, int mmax_) { Alm_Base::Set(lmax_, mmax_); alm.alloc(Num_Alms(lmax,mmax)); } /*! Deallocates the old coefficients and uses the content of \a data for storage. \a data is deallocated during the call. */ void Set (arr &data, int lmax_, int mmax_) { planck_assert (Num_Alms(lmax_,mmax_)==data.size(),"wrong array size"); Alm_Base::Set(lmax_, mmax_); alm.transfer(data); } /*! Sets all coefficients to zero. */ void SetToZero () { alm.fill (0); } /*! Multiplies all coefficients by \a factor. */ template void Scale (const T2 &factor) { for (tsize m=0; m void ScaleL (const arr &factor) { planck_assert(factor.size()>tsize(lmax), "alm.ScaleL: factor array too short"); for (int m=0; m<=mmax; ++m) for (int l=m; l<=lmax; ++l) operator()(l,m)*=factor[l]; } /*! \a a(l,m) *= \a factor[m] for all \a l,m. */ template void ScaleM (const arr &factor) { planck_assert(factor.size()>tsize(mmax), "alm.ScaleM: factor array too short"); for (int m=0; m<=mmax; ++m) for (int l=m; l<=lmax; ++l) operator()(l,m)*=factor[m]; } /*! Adds \a num to a_00. */ template void Add (const T2 &num) { alm[0]+=num; } /*! Returns a reference to the specified coefficient. */ T &operator() (int l, int m) { return alm[index(l,m)]; } /*! Returns a constant reference to the specified coefficient. */ const T &operator() (int l, int m) const { return alm[index(l,m)]; } /*! Returns a pointer for a given m, from which the address of a_lm can be obtained by adding l. */ T *mstart (int m) { return &alm[index_l0(m)]; } /*! Returns a pointer for a given m, from which the address of a_lm can be obtained by adding l. */ const T *mstart (int m) const { return &alm[index_l0(m)]; } /*! Returns a constant reference to the a_lm data. */ const arr &Alms () const { return alm; } /*! Swaps the contents of two Alm objects. */ void swap (Alm &other) { Alm_Base::swap(other); alm.swap(other.alm); } /*! Adds all coefficients from \a other to the own coefficients. */ void Add (const Alm &other) { planck_assert (conformable(other), "A_lm are not conformable"); for (tsize m=0; m #include "alm_fitsio.h" #include "alm.h" #include "fitshandle.h" #include "xcomplex.h" #include "safe_cast.h" #include "share_utils.h" using namespace std; void get_almsize(fitshandle &inp, int &lmax, int &mmax) { if (inp.key_present("MAX-LPOL") && inp.key_present("MAX-MPOL")) { inp.get_key ("MAX-LPOL",lmax); inp.get_key ("MAX-MPOL",mmax); return; } int n_alms = safe_cast(inp.nelems(1)); arr index; lmax=mmax=-1; chunkMaker cm(n_alms,inp.efficientChunkSize(1)); uint64 offset,ppix; while(cm.getNext(offset,ppix)) { index.alloc(ppix); inp.read_column(1,index,offset); for (tsize i=0; ilmax) lmax=l; if (m>mmax) mmax=m; } } } void get_almsize(const string &filename, int &lmax, int &mmax, int hdunum) { fitshandle inp; inp.open (filename); inp.goto_hdu(hdunum); get_almsize (inp, lmax, mmax); } void get_almsize_pol(const string &filename, int &lmax, int &mmax) { int tlmax, tmmax; fitshandle inp; inp.open (filename); lmax=mmax=0; for (int hdu=2; hdu<=4; ++hdu) { inp.goto_hdu(hdu); get_almsize (inp,tlmax,tmmax); if (tlmax>lmax) lmax=tlmax; if (tmmax>mmax) mmax=tmmax; } } template void read_Alm_from_fits (fitshandle &inp, Alm >&alms, int lmax, int mmax) { int n_alms = safe_cast(inp.nelems(1)); arr index; arr re, im; alms.Set(lmax, mmax); alms.SetToZero(); int max_index = lmax*lmax + lmax + mmax + 1; chunkMaker cm(n_alms,inp.efficientChunkSize(1)); uint64 offset,ppix; while(cm.getNext(offset,ppix)) { index.alloc(ppix); re.alloc(ppix); im.alloc(ppix); inp.read_column(1,index,offset); inp.read_column(2,re,offset); inp.read_column(3,im,offset); for (tsize i=0; imax_index) continue; int l = isqrt(index[i]-1); int m = index[i] - l*l - l - 1; planck_assert(m>=0,"negative m encountered"); planck_assert(l>=m, "wrong l,m combination"); if ((l<=lmax) && (m<=mmax)) alms(l,m).Set (re[i], im[i]); } } } template void read_Alm_from_fits (fitshandle &inp, Alm > &alms, int lmax, int mmax); template void read_Alm_from_fits (fitshandle &inp, Alm > &alms, int lmax, int mmax); template void read_Alm_from_fits (const string &filename, Alm >&alms, int lmax, int mmax, int hdunum) { fitshandle inp; inp.open (filename); inp.goto_hdu(hdunum); read_Alm_from_fits(inp,alms,lmax,mmax); } template void read_Alm_from_fits (const string &filename, Alm > &alms, int lmax, int mmax, int hdunum); template void read_Alm_from_fits (const string &filename, Alm > &alms, int lmax, int mmax, int hdunum); template void write_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype) { vector cols; cols.push_back (fitscolumn("index","l*l+l+m+1",1,PLANCK_INT32)); cols.push_back (fitscolumn("real","unknown",1,datatype)); cols.push_back (fitscolumn("imag","unknown",1,datatype)); out.insert_bintab(cols); arr index; arr re, im; int lm=alms.Lmax(), mm=alms.Mmax(); int n_alms = ((mmax+1)*(mmax+2))/2 + (mmax+1)*(lmax-mmax); int l=0, m=0; chunkMaker cm(n_alms,out.efficientChunkSize(1)); uint64 offset,ppix; while(cm.getNext(offset,ppix)) { index.alloc(ppix); re.alloc(ppix); im.alloc(ppix); for (tsize i=0; il) || (m>mmax)) { ++l; m=0; } } out.write_column(1,index,offset); out.write_column(2,re,offset); out.write_column(3,im,offset); } out.set_key("MAX-LPOL",lmax,"highest l in the table"); out.set_key("MAX-MPOL",mmax,"highest m in the table"); } template void write_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype); template void write_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype); template void write_compressed_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype) { vector cols; cols.push_back (fitscolumn("index","l*l+l+m+1",1,PLANCK_INT32)); cols.push_back (fitscolumn("real","unknown",1,datatype)); cols.push_back (fitscolumn("imag","unknown",1,datatype)); out.insert_bintab(cols); arr index; arr re, im; int n_alms = 0; for (int m=0; m<=mmax; ++m) for (int l=m; l<=lmax; ++l) if (alms(l,m).norm()>0) ++n_alms; int l=0, m=0; int real_lmax=0, real_mmax=0; chunkMaker cm(n_alms,out.efficientChunkSize(1)); uint64 offset,ppix; while(cm.getNext(offset,ppix)) { index.alloc(ppix); re.alloc(ppix); im.alloc(ppix); for (tsize i=0; il) || (m>mmax)) { ++l; m=0; } } index[i] = l*l + l + m + 1; re[i] = alms(l,m).re; im[i] = alms(l,m).im; if (l>real_lmax) real_lmax=l; if (m>real_mmax) real_mmax=m; ++m; if ((m>l) || (m>mmax)) { ++l; m=0; } } out.write_column(1,index,offset); out.write_column(2,re,offset); out.write_column(3,im,offset); } out.set_key("MAX-LPOL",real_lmax,"highest l in the table"); out.set_key("MAX-MPOL",real_mmax,"highest m in the table"); } template void write_compressed_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype); template void write_compressed_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype); healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec.h0000650000175000017530000001073312255154051026514 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #ifndef POWSPEC_H #define POWSPEC_H #include "arr.h" /*! Class for storing unpolarised and polarised power spectra. */ class PowSpec { private: arr tt_, gg_, cc_, tg_, tc_, gc_; int num_specs; void dealloc(); public: /*! */ PowSpec() {} /*! Constructs a \a PowSpec with \a nspec components and a maximum multipole of \a lmax. \a nspec can be 1 (TT), 4 (TT,GG,CC,TG) or 6 (TT,GG,CC,TG,TC,GC). */ PowSpec(int nspec, int lmax); ~PowSpec(); /*! Ensures that the internal array sizes are consistent with the \a num_specs variable. */ void assertArraySizes() const; /*! Checks whether the object can be an auto power spectrum. If this is not the case, an exception is thrown. */ bool consistentAutoPowspec() const; /*! Returns the number of spectral components. */ int Num_specs() const { return num_specs; } /*! Returns the maximum \a l. */ int Lmax() const { return tt_.size()-1; } /*! Returns the TT array (read-only). */ const arr &tt() const { return tt_; } /*! Returns the GG array (read-only). */ const arr &gg() const { return gg_; } /*! Returns the CC array (read-only). */ const arr &cc() const { return cc_; } /*! Returns the TG array (read-only). */ const arr &tg() const { return tg_; } /*! Returns the TC array (read-only). */ const arr &tc() const { return tc_; } /*! Returns the GC array (read-only). */ const arr &gc() const { return gc_; } /*! Returns TT(l) (read-write). */ double &tt (int l) { return tt_[l]; } /*! Returns GG(l) (read-write). */ double &gg (int l) { return gg_[l]; } /*! Returns CC(l) (read-write). */ double &cc (int l) { return cc_[l]; } /*! Returns TG(l) (read-write). */ double &tg (int l) { return tg_[l]; } /*! Returns TC(l) (read-write). */ double &tc (int l) { return tc_[l]; } /*! Returns GC(l) (read-write). */ double &gc (int l) { return gc_[l]; } /*! Returns TT(l) (read-only). */ const double &tt (int l) const { return tt_[l]; } /*! Returns GG(l) (read-only). */ const double &gg (int l) const { return gg_[l]; } /*! Returns CC(l) (read-only). */ const double &cc (int l) const { return cc_[l]; } /*! Returns TG(l) (read-only). */ const double &tg (int l) const { return tg_[l]; } /*! Returns TC(l) (read-only). */ const double &tc (int l) const { return tc_[l]; } /*! Returns GC(l) (read-only). */ const double &gc (int l) const { return gc_[l]; } /*! Re-allocates the object */ void Set(int nspec, int lmax); /*! Sets the whole TT array. \note On exit, \a tt_new is zero-sized! */ void Set(arr &tt_new); /*! Sets the four first components. \note On exit, all arguments are zero-sized! */ void Set(arr &tt_new, arr &gg_new, arr &cc_new, arr &tg_new); /*! Sets all components. \note On exit, all arguments are zero-sized! */ void Set(arr &tt_new, arr &gg_new, arr &cc_new, arr &tg_new, arr &tc_new, arr &gc_new); /*! Smooths the spectrum with a Gaussian beam. \a fwhm is given in radian. \note This is only implememted for 1 and 4 spectra so far. */ void smoothWithGauss (double fwhm); }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/map2tga.par.txt0000650000175000017530000000377412255154051027547 0ustar zoncaplanck00000000000000Usage: map2tga or: map2tga [-sig ] [-pal ] [-xsz ] [-bar] [-log] [-asinh] [-lon ] [-lat ] [-mul ] [-add ] [-min ] [-max ] [-res ] [-title ] [-flippal] [-gnomonic] [-interpol] [-equalize] [-viewer ] Parameters read by map2tga: infile (string): input file containing the Healpix map outfile (string): output TGA file sig (integer, default=1): column number of the requested Healpix map pal (integer, default=4): number of the color palette flippal (bool, default=false): whether the palette should be flipped xsz (integer, default=1024): number of image pixels in x direction bar (logical, default=false): whether a color bar should be added to the image log (logical, default=false): whether the logarithm of the map values should be displayed equalize (logical, default=false): whether histogram equalisation should be performed asinh (logical, default=false): whether the hyperbolic arcsine of the map values should be displayed lon (double, default=0): the longitude (in degrees) of the image center lat (double, default=0): the latitude (in degrees) of the image center mul (double, default=1): scale factor applied to the data add (double, default=0): offset added to the data (before multiplication) min (double, optional): if specified, this value is used as minimum of the color scale max (double, optional): if specified, this value is used as maximum of the color scale res (double, default=1): only for gnomonic projection: the size (in arcmin) of an image pixel title (string, optional): if specified, this value is used as the image title viewer (string, optional): if specified, this executable is used to show the resulting image pro (string, default="mollw"): if this is equal to "gno", gnomonic projection is used, else Mollweide interpol (bool, default=false): false: no interpolation true : bilinear interpolation healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_healpix_tools.h0000650000175000017530000001720112310173024030525 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file alm_healpix_tools.h * Copyright (C) 2003-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef HEALPIX_ALM_HEALPIX_TOOLS_H #define HEALPIX_ALM_HEALPIX_TOOLS_H #include "xcomplex.h" #include "arr.h" template class Alm; template class Healpix_Map; /*! \defgroup alm_healpix_group Conversions between a_lm and HEALPix maps */ /*! \{ */ /*! Converts a Healpix map to a set of a_lms. \param map the input map, which must have RING ordering \param alm the output a_lms. l_max and m_max of the conversion are determined from this object. \param weight array containing the weights for the individual rings of the map. It must have at least 2*\a map.Nside() entries. \param add_alm If this is \a true, then the computed a_lm are added to the values already residing in \a alm. */ template void map2alm (const Healpix_Map &map, Alm > &alm, const arr &weight, bool add_alm=false); /*! Converts a Healpix map to a set of a_lms, using an iterative scheme which is more accurate than plain map2alm(). \param map the input map, which must have RING ordering. \param alm the output a_lms. l_max and m_max of the conversion are determined from this object. \param num_iter the number of iterations (0 is identical to map2alm()). \param weight array containing the weights for the individual rings of the map. It must have at least 2*\a map.Nside() entries. */ template void map2alm_iter (const Healpix_Map &map, Alm > &alm, int num_iter, const arr &weight); template inline void map2alm_iter (const Healpix_Map &map, Alm > &alm, int num_iter) { arr wgt(2*map.Nside(),1.); map2alm_iter(map,alm,num_iter,wgt); } template void map2alm_iter2 (const Healpix_Map &map, Alm > &alm, double err_abs, double err_rel); template void map2alm_spin (const Healpix_Map &map1, const Healpix_Map &map2, Alm > &alm1, Alm > &alm2, int spin, const arr &weight, bool add_alm); template void map2alm_spin_iter2 (const Healpix_Map &map1, const Healpix_Map &map2, Alm > &alm1, Alm > &alm2, int spin, double err_abs, double err_rel); /*! Converts Healpix maps containing the I, Q and U Stokes parameters to sets of a_lms. \param mapT the I-Stokes parameter input map \param mapQ the Q-Stokes parameter input map \param mapU the U-Stokes parameter input map \note All maps must have the same nside, and must be in RING scheme. \param almT the output temperature a_lms \param almG the output gradient a_lms \param almC the output curl a_lms \note all a_lm sets must have the the same lmax and mmax. \param weight ring weights for the maps. \param add_alm If this is \a true, then the computed a_lm are added to the values already residing in \a alm. \note The weight array must have at least 2*\a mapT.Nside() entries. */ template void map2alm_pol (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, const arr &weight, bool add_alm=false); /*! Converts Healpix maps containing the I, Q and U Stokes parameters to sets of a_lms, using an iterative scheme which is more accurate than plain map2alm_pol(). \param mapT the I-Stokes parameter input map \param mapQ the Q-Stokes parameter input map \param mapU the U-Stokes parameter input map \note All maps must have the same nside, and must be in RING scheme. \param almT the output temperature a_lms \param almG the output gradient a_lms \param almC the output curl a_lms \note all a_lm sets must have the the same lmax and mmax. \param num_iter the number of iterations (0 is identical to map2alm_pol()). \param weight ring weights for the maps. \note The weight array must have at least 2*\a mapT.Nside() entries. */ template void map2alm_pol_iter (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, int num_iter, const arr &weight); template inline void map2alm_pol_iter (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, int num_iter) { arr wgt(2*mapT.Nside(),1.); map2alm_pol_iter(mapT,mapQ,mapU,almT,almG,almC,num_iter,wgt); } template void map2alm_pol_iter2 (const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, Alm > &almT, Alm > &almG, Alm > &almC, double err_abs, double err_rel); /*! Converts a a set of a_lm to a HEALPix map. \param alm the input a_lms. l_max and m_max of the conversion are determined from this object. \param map the output map, which must have RING ordering. */ template void alm2map (const Alm > &alm, Healpix_Map &map); template void alm2map_spin (const Alm > &alm1, const Alm > &alm2, Healpix_Map &map1, Healpix_Map &map2, int spin); /*! Converts a a set of polarised a_lm to a HEALPix map. \param almT the input temperature a_lms \param almG the input gradient a_lms \param almC the input curl a_lms \param mapT the I-Stokes parameter output map \param mapQ the Q-Stokes parameter output map \param mapU the U-Stokes parameter output map */ template void alm2map_pol (const Alm > &almT, const Alm > &almG, const Alm > &almC, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU); /*! Converts a a set of a_lm to a HEALPix map and its first derivatives. \param alm the input a_lms. l_max and m_max of the conversion are determined from this object. \param map the output map, which must have RING ordering. \param mapdth an output map containing \f$d (\mbox{map})/d\vartheta\f$, which must have RING ordering. \param mapdph an output map containing \f$(\sin\vartheta)^{-1}d(\mbox{map})/d\varphi\f$, which must have RING ordering. */ template void alm2map_der1 (const Alm > &alm, Healpix_Map &map, Healpix_Map &mapdth, Healpix_Map &mapdph); /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_data_io.cc0000650000175000017530000000625712255154051030312 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003, 2005, 2009 Max-Planck-Society * Author: Martin Reinecke */ #include "healpix_data_io.h" #include "arr.h" #include "fitshandle.h" #include "paramfile.h" #include "string_utils.h" using namespace std; void read_weight_ring (const string &dir, int nside, arr &weight) { fitshandle inp; inp.open(dir+"/weight_ring_n"+intToString(nside,5)+".fits"); inp.goto_hdu(2); weight.alloc (2*nside); inp.read_column(1,weight); } void get_ring_weights (paramfile ¶ms, int nside, arr &weight) { bool weighted = params.find("weighted",false); weight.alloc (2*nside); if (weighted) { string datadir = params.find("healpix_data"); read_weight_ring (datadir, nside, weight); for (tsize m=0; m &temp) { fitshandle inp; inp.open(dir+"/pixel_window_n"+intToString(nside,4)+".fits"); inp.goto_hdu(2); if (temp.size()==0) inp.read_entire_column(1,temp); else inp.read_column(1,temp); } void read_pixwin (const string &dir, int nside, arr &temp, arr &pol) { fitshandle inp; inp.open(dir+"/pixel_window_n"+intToString(nside,4)+".fits"); inp.goto_hdu(2); if (temp.size()==0) inp.read_entire_column(1,temp); else inp.read_column(1,temp); if (pol.size()==0) inp.read_entire_column(2,pol); else inp.read_column(2,pol); } void get_pixwin (paramfile ¶ms, int lmax, int nside, arr &pixwin) { bool do_pixwin = params.find("pixel_window",false); pixwin.alloc(lmax+1); pixwin.fill(1); if (do_pixwin) { string datadir = params.find("healpix_data"); read_pixwin (datadir,nside,pixwin); } } void get_pixwin (paramfile ¶ms, int lmax, int nside, arr &pixwin, arr &pixwin_pol) { bool do_pixwin = params.find("pixel_window",false); pixwin.alloc(lmax+1); pixwin.fill(1); pixwin_pol.alloc(lmax+1); pixwin_pol.fill(1); if (do_pixwin) { string datadir = params.find("healpix_data"); read_pixwin (datadir,nside,pixwin,pixwin_pol); } } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/calc_powspec.cc0000650000175000017530000000027712255154051027636 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN calc_powspec_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm2map_cxx_module.cc0000650000175000017530000000764112255154051030756 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2010 Max-Planck-Society * Author: Martin Reinecke */ #include "xcomplex.h" #include "paramfile.h" #include "healpix_data_io.h" #include "alm.h" #include "alm_fitsio.h" #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "alm_healpix_tools.h" #include "alm_powspec_tools.h" #include "fitshandle.h" #include "levels_facilities.h" #include "lsconstants.h" #include "announce.h" using namespace std; namespace { template void alm2map_cxx (paramfile ¶ms) { int nlmax = params.template find("nlmax"); int nmmax = params.template find("nmmax",nlmax); planck_assert(nmmax<=nlmax,"nmmax must not be larger than nlmax"); string infile = params.template find("infile"); string outfile = params.template find("outfile"); int nside = params.template find("nside"); double fwhm = arcmin2rad*params.template find("fwhm_arcmin",0); arr temp, pol; get_pixwin (params,nlmax,nside,temp,pol); bool deriv = params.template find("derivatives",false); if (deriv) { Alm > alm; read_Alm_from_fits(infile,alm,nlmax,nmmax,2); if (fwhm>0) smoothWithGauss (alm, fwhm); Healpix_Map map(nside,RING,SET_NSIDE), mapdth(nside,RING,SET_NSIDE), mapdph(nside,RING,SET_NSIDE); alm.ScaleL(temp); double offset = alm(0,0).real()/sqrt(fourpi); alm(0,0) = 0; alm2map_der1(alm,map,mapdth,mapdph); map.Add(T(offset)); write_Healpix_map_to_fits (outfile,map,mapdth,mapdph,planckType()); return; } bool polarisation = params.template find("polarisation"); if (!polarisation) { Alm > alm; read_Alm_from_fits(infile,alm,nlmax,nmmax,2); if (fwhm>0) smoothWithGauss (alm, fwhm); Healpix_Map map(nside,RING,SET_NSIDE); alm.ScaleL(temp); double offset = alm(0,0).real()/sqrt(fourpi); alm(0,0) = 0; alm2map(alm,map); map.Add(T(offset)); write_Healpix_map_to_fits (outfile,map,planckType()); } else { Alm > almT, almG, almC; read_Alm_from_fits(infile,almT,almG,almC,nlmax,nmmax,2); if (fwhm>0) smoothWithGauss (almT, almG, almC, fwhm); Healpix_Map mapT(nside,RING,SET_NSIDE), mapQ(nside,RING,SET_NSIDE), mapU(nside,RING,SET_NSIDE); almT.ScaleL(temp); almG.ScaleL(pol); almC.ScaleL(pol); double offset = almT(0,0).real()/sqrt(fourpi); almT(0,0) = 0; alm2map_pol(almT,almG,almC,mapT,mapQ,mapU); mapT.Add(T(offset)); write_Healpix_map_to_fits (outfile,mapT,mapQ,mapU,planckType()); } } } // unnamed namespace int alm2map_cxx_module (int argc, const char **argv) { module_startup ("alm2map_cxx", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); bool dp = params.find ("double_precision",false); dp ? alm2map_cxx(params) : alm2map_cxx(params); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/syn_alm_cxx.par.txt0000650000175000017530000000126212255154051030526 0ustar zoncaplanck00000000000000Parameters read by syn_alm_cxx: nlmax (integer): maximum order of l nmmax (integer): maximum order of m (must not be larger than nlmax, default=nlmax) infile (string): input file containing the CMB power spectrum outfile (string): output file name for the calculated a_lm rand_seed (integer): random-number seed fwhm_arcmin (real): FWHM (in arcmin) of a Gaussian beam, which is used to smooth the resulting sky a_lm (default=0) polarisation (bool): if false, only the intensity a_lm are generated, if true, T, G and C a_lm are generated double_precision (bool, default=false): if false, the a_lm are created in single precision, otherwise in double precision. healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/smoothing_cxx.par.txt0000650000175000017530000000161712255154051031077 0ustar zoncaplanck00000000000000Parameters read by smoothing_cxx: fwhm_arcmin (double): FWHM (in arcmin) of the Gaussian beam used for smoothing. If the value is negative, the smoothing of a Gaussian beam with an FWHM of -fwhm_arcmin will be _removed_ from the input map. nlmax (integer): maximum order of l infile (string): input file containing the Healpix map outfile (string, default=""): output file for the smoothed Healpix map polarisation (bool): if false, only an intensity map is smoothed if true, an IQU map is smoothed weighted (bool, default=false): if true, weighted quadrature is used if (weighted) healpix_data (string): directory containing the Healpix data files endif iter_order (integer, default=0) number of iterations for the analysis (0: standard analysis) double_precision (bool, default=false): if false, a_lm are read/written in single precision, otherwise in double precision. healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/mult_alm.cc0000650000175000017530000000027312255154051027002 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN mult_alm_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/anafast_cxx.par.txt0000654000175000017530000000244212264023644030511 0ustar zoncaplanck00000000000000Parameters read by anafast_cxx: nlmax (integer): maximum order of l nmmax (integer): maximum order of m (must not be larger than nlmax, default=nlmax) infile (string): input file containing the Healpix map outfile (string, default=""): output file name for power spectrum; if empty, no spectrum is written outfile_alms (string, default=""): output file name for the a_lm; if empty, no a_lm are written polarisation (bool): if false, only the intensity a_lm are generated, if true, a_lm for T, G and C component are generated weighted (bool, default=false): if true, weighted quadrature is used if (weighted) healpix_data (string): directory containing the Healpix data files endif iter_order (integer, default=0) number of iterations for the analysis (0: standard analysis) double_precision (bool, default=false): if false, maps and a_lm are read/written in single precision, otherwise in double precision. if (polarisation==true && outfile!="") full_powerspectrum (bool, default=false): if true, write a 6-column power spectrum; if false, write a 4-column power spectrum. endif remove_monopole (bool, default=false): if true, subtract the average pixel value from the temperature map, and add the corresponding value to almT(0,0) after the map2alm transform. healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_tables.cc0000650000175000017530000001137612255154051030162 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2011 Max-Planck-Society * Author: Martin Reinecke */ #include "healpix_tables.h" #include "string_utils.h" using namespace std; const nside_dummy SET_NSIDE=nside_dummy(); Healpix_Ordering_Scheme string2HealpixScheme (const string &inp) { string tmp=trim(inp); if (equal_nocase(tmp,"RING")) return RING; if (equal_nocase(tmp,"NESTED")) return NEST; planck_fail ("bad Healpix ordering scheme '"+tmp+ "': expected 'RING' or 'NESTED'"); } const uint16 Healpix_Tables::utab[] = { #define Z(a) 0x##a##0, 0x##a##1, 0x##a##4, 0x##a##5 #define Y(a) Z(a##0), Z(a##1), Z(a##4), Z(a##5) #define X(a) Y(a##0), Y(a##1), Y(a##4), Y(a##5) X(0),X(1),X(4),X(5) #undef X #undef Y #undef Z }; const uint16 Healpix_Tables::ctab[] = { #define Z(a) a,a+1,a+256,a+257 #define Y(a) Z(a),Z(a+2),Z(a+512),Z(a+514) #define X(a) Y(a),Y(a+4),Y(a+1024),Y(a+1028) X(0),X(8),X(2048),X(2056) #undef X #undef Y #undef Z }; const int Healpix_Tables::jrll[] = { 2,2,2,2,3,3,3,3,4,4,4,4 }, Healpix_Tables::jpll[] = { 1,3,5,7,0,2,4,6,1,3,5,7 }; const uint8 Healpix_Tables::peano_subpix[2][8][4] = { { {0,1,3,2}, {3,0,2,1}, {2,3,1,0}, {1,2,0,3}, {0,3,1,2}, {1,0,2,3}, {2,1,3,0}, {3,2,0,1} }, { {0,1,3,2}, {1,3,2,0}, {3,2,0,1}, {2,0,1,3}, {0,2,3,1}, {1,0,2,3}, {3,1,0,2}, {2,3,1,0} } }; const uint8 Healpix_Tables::peano_subpath[2][8][4] = { { {4,0,6,0}, {7,5,1,1}, {2,4,2,6}, {3,3,7,5}, {0,2,4,4}, {5,1,5,3}, {6,6,0,2}, {1,7,3,7} }, { {4,0,0,6}, {5,1,1,7}, {6,2,2,4}, {7,3,3,5}, {0,4,4,2}, {1,5,5,3}, {2,6,6,0}, {3,7,7,1} } }; const uint8 Healpix_Tables::peano_face2path[2][12] = { { 2,5,2,5,3,6,3,6,2,3,2,3 }, { 2,6,2,3,3,5,2,6,2,3,3,5 } }; const uint8 Healpix_Tables::peano_face2face[2][12] = { { 0,5,6,11,10,1,4,7,2,3,8,9 }, { 0,5,8,9,6,1,2,7,10,11,4,3 } }; const int Healpix_Tables::nb_xoffset[] = { -1,-1, 0, 1, 1, 1, 0,-1 }, Healpix_Tables::nb_yoffset[] = { 0, 1, 1, 1, 0,-1,-1,-1 }; const int Healpix_Tables::nb_facearray[][12] = { { 8, 9,10,11,-1,-1,-1,-1,10,11, 8, 9 }, // S { 5, 6, 7, 4, 8, 9,10,11, 9,10,11, 8 }, // SE { -1,-1,-1,-1, 5, 6, 7, 4,-1,-1,-1,-1 }, // E { 4, 5, 6, 7,11, 8, 9,10,11, 8, 9,10 }, // SW { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11 }, // center { 1, 2, 3, 0, 0, 1, 2, 3, 5, 6, 7, 4 }, // NE { -1,-1,-1,-1, 7, 4, 5, 6,-1,-1,-1,-1 }, // W { 3, 0, 1, 2, 3, 0, 1, 2, 4, 5, 6, 7 }, // NW { 2, 3, 0, 1,-1,-1,-1,-1, 0, 1, 2, 3 } }; // N const int Healpix_Tables::nb_swaparray[][3] = { { 0,0,3 }, // S { 0,0,6 }, // SE { 0,0,0 }, // E { 0,0,5 }, // SW { 0,0,0 }, // center { 5,0,0 }, // NE { 0,0,0 }, // W { 6,0,0 }, // NW { 3,0,0 } }; // N const int Healpix_Tables::swap_clen[] = { 0,7,5,4,12,10,13,18,14,19,18,17,27,21 }; const int Healpix_Tables::swap_cycle[] = { 0,1,8,12,16,21,40, 0,1,2,40,114, 0,4,160,263, 0,4,30,49,51,87,526,1027,1105,1387,1807,2637, 0,8,10,18,39,74,146,307,452,4737, 0,1,2,7,9,17,80,410,1526,1921,32859,33566,38931, 0,5,6,10,12,24,27,95,372,494,924,1409,3492,4248,9137,66043,103369,156899, 0,1,2,3,4,45,125,351,697,24337,102940,266194,341855,419857, 0,1,2,3,9,16,1705,2082,2126,8177,12753,15410,52642,80493,83235,88387,99444, 1675361,2495125, 0,2,6,8,9,11,20,50,93,152,183,2137,13671,44794,486954,741908,4803258, 5692573, 0,1,5,6,44,53,470,2847,3433,4906,13654,14710,400447,1797382,2744492, 18775974,23541521, 0,4,9,10,16,33,83,117,318,451,5759,10015,128975,171834,211256,347608, 1278690,2154097,2590798,3427694,5581717,21012301,27023976,72522811, 95032729,139166747,171822389, 0,5,10,267,344,363,2968,3159,9083,18437,76602,147614,1246902,1593138, 2035574,6529391,9511830,11340287,29565945,281666026,677946848 }; healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/hpxtest.cc0000650000175000017530000007456112255154051026702 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2004-2013 Max-Planck-Society * Author: Martin Reinecke */ /* Candidates for testing the validity of the Healpix routines: - done: ang2pix(pix2ang(i)) = i for all Healpix_Bases - done: pix2ang(ang2pix(ptg)) dot ptg > 1-delta for all Healpix_Bases - done: ring2nest(nest2ring(i)) = i for all hierarchical Healpix_Bases - done: downgrade(upgrade(map)) = map for all maps - done: map and downgraded map should have same average - done: alm2map(map2alm(map)) approx map (same for pol) - partly done: neighbor tests - powspec -> alm -> powspec (should produce similar powspecs, also for pol) - done: two swap_schemes() should produce original map - done: query_disc tests (dot products etc.) - a_lms: test Set(), Scale(), Add(), alm(l,m) = alm.mstart(m)[l], etc. */ #include #include "healpix_base.h" #include "healpix_map.h" #include "arr.h" #include "planck_rng.h" #include "lsconstants.h" #include "alm.h" #include "alm_healpix_tools.h" #include "alm_powspec_tools.h" #include "geom_utils.h" #include "walltimer.h" #include "announce.h" using namespace std; const int nsamples = 1000000; planck_rng rng; namespace { void random_dir (pointing &ptg) { ptg.theta = acos(rng.rand_uni()*2-1); ptg.phi = rng.rand_uni()*twopi; } void random_zphi (double &z, double &phi) { z = rng.rand_uni()*2-1; phi = rng.rand_uni()*twopi; } template string bname() { return string("(basetype: ")+type2typename()+")"; } template void check_ringnestring() { cout << "testing ring2nest(nest2ring(m))==m " << bname() << endl; for (int order=0; order<=T_Healpix_Base::order_max; ++order) { T_Healpix_Base base (order,RING); for (int m=0; m() << endl; for (int order=0; order<=T_Healpix_Base::order_max; ++order) { T_Healpix_Base base (order,NEST); for (int m=0; m() << endl; int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base1 (order,RING), base2 (order,NEST); for (int m=0; m() << endl; int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base1 (order,NEST), base2 (order,RING); double mincos = min (cos(base1.max_pixrad()),0.999999999999999); for (int m=0; m base (nside,RING,SET_NSIDE); double mincos = min (cos(base.max_pixrad()),0.999999999999999); for (int m=0; m void check_pixangpix() { cout << "testing ang2pix(pix2ang(m))==m " << bname() << endl; int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base1 (order,RING), base2 (order,NEST); for (int m=0; m() << endl; int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,NEST), base2(order,RING); double maxang = 2.01*base.max_pixrad(); for (int m=0; m nb,nb2; vec3 pixpt = base.pix2vec(pix); base.neighbors(pix,nb); base2.neighbors(base.nest2ring(pix),nb2); for (int n=0; n<8; ++n) if (nb[n]<0) planck_assert(nb2[n]<0,"neighbor inconsistency"); else planck_assert(base.nest2ring(nb[n])==nb2[n],"neighbor inconsistency"); sort(&nb[0],&nb[0]+8); int check=0; for (int n=0; n<8; ++n) { if (nb[n]<0) ++check; else { if (v_angle(base.pix2vec(nb[n]),pixpt)>maxang) cout << " PROBLEM: order = " << order << ", pix = " << pix << endl; if ((n>0) && (nb[n]==nb[n-1])) cout << " PROBLEM: order = " << order << ", pix = " << pix << endl; } } planck_assert((check<=1)||((order==0)&&(check<=2)),"too few neighbors"); } } for (I nside=3; nside<(I(1)< base (nside,RING,SET_NSIDE); double maxang = 2.01*base.max_pixrad(); for (int m=0; m nb; vec3 pixpt = base.pix2vec(pix); base.neighbors(pix,nb); for (int n=0; n<8; ++n) if ((nb[n]>=0) && (v_angle(base.pix2vec(nb[n]),pixpt)>maxang)) cout << " PROBLEM: nside = " << nside << ", pix = " << pix << endl; } } } void check_swap_scheme() { cout << "testing whether double swap_scheme() returns the original map" << endl << "(for orders 0 to 10)." << endl; for (int order=0; order<=10; ++order) { Healpix_Map map(order,NEST); for (int m=0; m map (order,scheme); map.fill(false); Healpix_Map vmap(order,scheme); for (int m=0; m pixset; for (int m=0; m<100000; ++m) { pointing ptg; random_dir (ptg); double rad = pi/1 * rng.rand_uni(); map.query_disc(ptg,rad,pixset); vec3 vptg=ptg; double cosrad=cos(rad); for (tsize j=0; jcosrad; if (inside^map[i]) cout << " PROBLEM: order = " << order << ", ptg = " << ptg << endl; } for (tsize j=0; jvoid check_query_disc() { cout << "checking query_disc() " << bname() << endl; int omax=min(20,T_Healpix_Base::order_max); for (int order=0; order<=omax; ++order) { T_Healpix_Base rbase (order,RING), nbase (order,NEST); rangeset pr,pn; int niter=max(1,min(1000,100000>>order)); for (int m=0; m0; fct>>=1) { rangeset pri,pni; rbase.query_disc_inclusive(ptg,rad,pri,fct); nbase.query_disc_inclusive(ptg,rad,pni,fct); if (pni.nval()>pri.nval()) cout << "PROBLEM: RING inclusive < NEST inclusive" << endl; if (pni.nval() NEST inclusive " << order << " " << fct << endl; if (order<5) // takes too long for high resolutions { for (tsize i=0; ivoid check_query_polygon() { cout << "checking query_polygon() " << bname() << endl; int omax=min(20,T_Healpix_Base::order_max); for (int order=0; order<=omax; ++order) { T_Healpix_Base rbase (order,RING), nbase (order,NEST); rangeset pixset; int niter=max(1,min(1000,100000>>order)); for (int m=0; m corner(3); random_dir(corner[0]); random_dir(corner[1]); random_dir(corner[2]); rbase.query_polygon(corner,pixset); I nval = pixset.nval(); nbase.query_polygon(corner,pixset); if (nval!=pixset.nval()) cout << " PROBLEM: number of pixels different: " << nval << " vs. " << pixset.nval() << endl; rbase.query_polygon_inclusive(corner,pixset,4); I nv1=pixset.nval(); nbase.query_polygon_inclusive(corner,pixset,4); I nv2=pixset.nval(); if (nv1 map (order,RING), map2 (order,NEST), map3 (order,RING); for (int m=0; m map (order,RING), map2(1,RING); for (int m=0; m map (nside,RING,SET_NSIDE), map2(1,RING,SET_NSIDE); for (int m=0; m >&almT, Alm >&almG, Alm >&almC, int lmax, int mmax) { almT.Set(lmax,mmax); almG.Set(lmax,mmax); almC.Set(lmax,mmax); for (int l=0; l<=lmax; ++l) { almT(l,0).re=rng.rand_gauss(); almT(l,0).im=0.; almG(l,0).re=rng.rand_gauss(); almG(l,0).im=0.; almC(l,0).re=rng.rand_gauss(); almC(l,0).im=0.; } for (int m=1; m<=mmax; ++m) for (int l=m; l<=lmax; ++l) { almT(l,m).re=rng.rand_gauss(); almT(l,m).im=rng.rand_gauss(); almG(l,m).re=rng.rand_gauss(); almG(l,m).im=rng.rand_gauss(); almC(l,m).re=rng.rand_gauss(); almC(l,m).im=rng.rand_gauss(); } almG(0,0)=almC(0,0)=almG(1,0)=almC(1,0)=almG(1,1)=almC(1,1)=0; } void random_alm (Alm >&alm, int lmax, int mmax) { alm.Set(lmax,mmax); for (int l=0; l<=lmax; ++l) { alm(l,0).re=rng.rand_gauss(); alm(l,0).im=0.; } for (int m=1; m<=mmax; ++m) for (int l=m; l<=lmax; ++l) { alm(l,m).re=rng.rand_gauss(); alm(l,m).im=rng.rand_gauss(); } } void check_alm (const Alm >&oalm, const Alm >&alm, double epsilon) { for (int m=0; m<=alm.Mmax(); ++m) for (int l=m; l<=alm.Lmax(); ++l) { if (!abs_approx(oalm(l,m).re,alm(l,m).re,epsilon)) cout << "Problemr " << l << " " << m << endl; if (!abs_approx(oalm(l,m).im,alm(l,m).im,epsilon)) cout << "Problemi " << l << " " << m << endl; } } void check_alm2map2alm (int lmax, int mmax, int nside) { cout << "testing whether a_lm->map->a_lm returns original a_lm" << endl; cout << "lmax=" << lmax <<", mmax=" << mmax << ", nside=" << nside << endl; const double epsilon = 1e-8; Alm > oalmT(lmax,mmax),almT(lmax,mmax), oalmG(lmax,mmax),almG(lmax,mmax),oalmC(lmax,mmax),almC(lmax,mmax); Healpix_Map mapT(nside,RING,SET_NSIDE), mapQ(nside,RING,SET_NSIDE), mapU(nside,RING,SET_NSIDE); random_alm(oalmT,oalmG,oalmC,lmax,mmax); alm2map(oalmT,mapT); map2alm_iter2(mapT,almT,1e-12,1e-12); check_alm (oalmT, almT, epsilon); alm2map_spin(oalmG,oalmC,mapQ,mapU,1); map2alm_spin_iter2(mapQ,mapU,almG,almC,1,1e-12,1e-12); check_alm (oalmG, almG, epsilon); check_alm (oalmC, almC, epsilon); alm2map_pol(oalmT,oalmG,oalmC,mapT,mapQ,mapU); map2alm_pol_iter2(mapT,mapQ,mapU,almT,almG,almC,1e-12,1e-12); check_alm (oalmT, almT, epsilon); check_alm (oalmG, almG, epsilon); check_alm (oalmC, almC, epsilon); } void check_smooth_alm () { cout << "testing whether unsmooth(smooth(a_lm)) returns a_lm" << endl; const double epsilon = 1e-14; const double fwhm = 100.*arcmin2rad; const int lmax=300, mmax=300; Alm > oalmT(lmax,mmax),almT(lmax,mmax), oalmG(lmax,mmax),almG(lmax,mmax),oalmC(lmax,mmax),almC(lmax,mmax); random_alm(oalmT,oalmG,oalmC,lmax,mmax); almT=oalmT; almG=oalmG; almC=oalmC; smoothWithGauss (almT, fwhm); smoothWithGauss (almT, -fwhm); check_alm (oalmT, almT, epsilon); almT=oalmT; smoothWithGauss (almT, almG, almC, fwhm); smoothWithGauss (almT, almG, almC, -fwhm); check_alm (oalmT, almT, epsilon); check_alm (oalmG, almG, epsilon); check_alm (oalmC, almC, epsilon); } void check_rot_alm () { cout << "testing whether rot^-1(rot(a_lm)) returns a_lm" << endl; const double epsilon = 2e-13; const int lmax=300; Alm > oalm(lmax,lmax),alm(lmax,lmax); random_alm(oalm,lmax,lmax); alm=oalm; rotate_alm (alm,3,4,5); rotate_alm (alm,-5,-4,-3); check_alm (oalm, alm, epsilon); } void check_isqrt() { cout << "testing whether isqrt() works reliably" << endl; uint64 val=uint64(0xF234)<<16, valsq=val*val; if (isqrt(valsq)!=val) cout << "PROBLEM1" << endl; if (isqrt(valsq-1)!=val-1) cout << "PROBLEM2" << endl; } void check_pix2ang_acc() { cout << "testing accuracy of pix2ang at the poles" << endl; for (int m=0; m<=29;++m) { Healpix_Base2 base(m,RING); if (base.pix2ang(1).theta==0.) cout << "PROBLEM: order " << m << endl; } } const int nsteps=1000000; templatevoid perf_neighbors(const string &name, Healpix_Ordering_Scheme scheme) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,scheme); I dpix=max(base.Npix()/nsteps,I(1)); fix_arr nres; for (I pix=0; pixvoid perf_pix2ang(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,scheme); I dpix=max(base.Npix()/nsteps,I(1)); for (I pix=0; pixvoid perf_pix2vec(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,scheme); I dpix=max(base.Npix()/nsteps,I(1)); for (I pix=0; pixvoid perf_pix2zphi(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,scheme); I dpix=max(base.Npix()/nsteps,I(1)); double z,phi; for (I pix=0; pixvoid perf_zphi2pix(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; double dz=2./sqrt(nsteps); double dph=twopi/sqrt(nsteps); for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,scheme); for (double z=-1; z<1; z+=dz) for (double phi=0; phivoid perf_ang2pix(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; double dth=pi/sqrt(nsteps); double dph=twopi/sqrt(nsteps); for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,scheme); for (double theta=0; thetavoid perf_ring2nest(const string &name,double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,RING); I dpix=max(base.Npix()/nsteps,I(1)); for (I pix=0; pixvoid perf_nest2ring(const string &name,double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,RING); I dpix=max(base.Npix()/nsteps,I(1)); for (I pix=0; pixvoid perf_peano2nest(const string &name,double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,NEST); I dpix=max(base.Npix()/nsteps,I(1)); for (I pix=0; pixvoid perf_nest2peano(const string &name,double &dummy) { tsize cnt=0; wallTimers.start(name); int omax=T_Healpix_Base::order_max; for (int order=0; order<=omax; ++order) { T_Healpix_Base base (order,NEST); I dpix=max(base.Npix()/nsteps,I(1)); for (I pix=0; pixvoid perf_query_disc(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; T_Healpix_Base base(1024,scheme,SET_NSIDE); wallTimers.start(name); for (int m=0; m<1000; ++m) { rangeset pix; base.query_disc(vec3(1,0,0),halfpi/9,pix); dummy+=pix.size(); ++cnt; } wallTimers.stop(name); cout << name << ": " << cnt/wallTimers.acc(name)*1e-3 << "kOps/s" << endl; } templatevoid perf_query_triangle(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; T_Healpix_Base base(1024,scheme,SET_NSIDE); vector corner; corner.push_back(vec3(1,0.01,0.01)); corner.push_back(vec3(0.01,1,0.01)); corner.push_back(vec3(0.01,0.01,1)); wallTimers.start(name); for (int m=0; m<1000; ++m) { rangeset pix; base.query_polygon(corner,pix); dummy+=pix.size(); ++cnt; } wallTimers.stop(name); cout << name << ": " << cnt/wallTimers.acc(name)*1e-3 << "kOps/s" << endl; } templatevoid perf_query_polygon(const string &name, Healpix_Ordering_Scheme scheme, double &dummy) { tsize cnt=0; T_Healpix_Base base(1024,scheme,SET_NSIDE); vector corner; corner.push_back(vec3(1,0.01,0.01)); corner.push_back(vec3(1,1,-0.3)); corner.push_back(vec3(0.01,1,0.01)); corner.push_back(vec3(0.01,0.01,1)); wallTimers.start(name); for (int m=0; m<1000; ++m) { rangeset pix; base.query_polygon(corner,pix); dummy+=pix.size(); ++cnt; } wallTimers.stop(name); cout << name << ": " << cnt/wallTimers.acc(name)*1e-3 << "kOps/s" << endl; } void perftest() { double dummy=0; cout << "Measuring performance of Healpix_Base methods." << endl; perf_pix2zphi ("pix2zphi (RING):int ",RING,dummy); perf_pix2zphi ("pix2zphi (NEST):int ",NEST,dummy); perf_pix2zphi ("pix2zphi (RING):int64",RING,dummy); perf_pix2zphi ("pix2zphi (NEST):int64",NEST,dummy); perf_zphi2pix ("zphi2pix (RING):int ",RING,dummy); perf_zphi2pix ("zphi2pix (NEST):int ",NEST,dummy); perf_zphi2pix ("zphi2pix (RING):int64",RING,dummy); perf_zphi2pix ("zphi2pix (NEST):int64",NEST,dummy); perf_pix2ang ("pix2ang (RING):int ",RING,dummy); perf_pix2ang ("pix2ang (NEST):int ",NEST,dummy); perf_pix2ang ("pix2ang (RING):int64",RING,dummy); perf_pix2ang ("pix2ang (NEST):int64",NEST,dummy); perf_ang2pix ("ang2pix (RING):int ",RING,dummy); perf_ang2pix ("ang2pix (NEST):int ",NEST,dummy); perf_ang2pix ("ang2pix (RING):int64",RING,dummy); perf_ang2pix ("ang2pix (NEST):int64",NEST,dummy); perf_pix2vec ("pix2vec (RING):int ",RING,dummy); perf_pix2vec ("pix2vec (NEST):int ",NEST,dummy); perf_pix2vec ("pix2vec (RING):int64",RING,dummy); perf_pix2vec ("pix2vec (NEST):int64",NEST,dummy); perf_neighbors ("neighbors(NEST):int ",NEST); perf_neighbors ("neighbors(RING):int ",RING); perf_neighbors("neighbors(NEST):int64",NEST); perf_neighbors("neighbors(RING):int64",RING); perf_ring2nest ("ring2nest :int ",dummy); perf_ring2nest("ring2nest :int64",dummy); perf_nest2ring ("nest2ring :int ",dummy); perf_nest2ring("nest2ring :int64",dummy); perf_peano2nest ("peano2nest :int ",dummy); perf_peano2nest("peano2nest :int64",dummy); perf_nest2peano ("nest2peano :int ",dummy); perf_nest2peano("nest2peano :int64",dummy); perf_query_disc ("query_disc (RING):int ",RING,dummy); perf_query_disc ("query_disc (NEST):int ",NEST,dummy); perf_query_disc ("query_disc (RING):int64",RING,dummy); perf_query_disc ("query_disc (NEST):int64",NEST,dummy); perf_query_triangle ("query_triangle(RING):int ",RING,dummy); perf_query_triangle ("query_triangle(NEST):int ",NEST,dummy); perf_query_triangle("query_triangle(RING):int64",RING,dummy); perf_query_triangle("query_triangle(NEST):int64",NEST,dummy); perf_query_polygon ("query_polygon (RING):int ",RING,dummy); perf_query_polygon ("query_polygon (NEST):int ",NEST,dummy); perf_query_polygon ("query_polygon (RING):int64",RING,dummy); perf_query_polygon ("query_polygon (NEST):int64",NEST,dummy); if (dummy<0) cout << dummy << endl; } } // unnamed namespace int main(int argc, const char **argv) { module_startup ("hpxtest",argc,argv,1,""); perftest(); check_isqrt(); check_pix2ang_acc(); check_smooth_alm(); check_rot_alm(); check_alm2map2alm(620,620,256); check_alm2map2alm(620,2,256); check_average(); check_import(); check_ringnestring(); check_ringnestring(); check_nestpeanonest(); check_nestpeanonest(); check_pixzphipix(); check_pixzphipix(); check_zphipixzphi(); check_zphipixzphi(); check_pixangpix(); check_pixangpix(); check_neighbors(); check_neighbors(); check_swap_scheme(); check_query_disc_strict(RING); check_query_disc_strict(NEST); check_query_disc(); check_query_disc(); check_query_polygon(); check_query_polygon(); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/median_filter_cxx_module.cc0000650000175000017530000000513612255154051032224 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2005-2012 Max-Planck-Society * Author: Martin Reinecke */ #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "fitshandle.h" #include "levels_facilities.h" #include "lsconstants.h" #include "announce.h" #include "string_utils.h" using namespace std; namespace { template typename iterator_traits::value_type median(Iterator first, Iterator last) { Iterator mid = first+(last-first-1)/2; nth_element(first,mid,last); if ((last-first)&1) return *mid; return typename iterator_traits::value_type (0.5*((*mid)+(*min_element(mid+1,last)))); } } // unnamed namespace int median_filter_cxx_module (int argc, const char **argv) { module_startup ("median_filter_cxx", argc, argv, 4, " "); double radius = stringToData(argv[3])*arcmin2rad; Healpix_Map inmap; read_Healpix_map_from_fits(argv[1],inmap,1,2); Healpix_Map outmap (inmap.Nside(), inmap.Scheme(), SET_NSIDE); rangeset pixset; vector list; for (int m=0; m0) ? median(list.begin(),list.begin()+cnt) : Healpix_undef; } write_Healpix_map_to_fits (argv[2],outmap,PLANCK_FLOAT32); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/anafast_cxx_module.cc0000654000175000017530000001104712264023644031044 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2013 Max-Planck-Society * Author: Martin Reinecke */ #include "xcomplex.h" #include "paramfile.h" #include "healpix_data_io.h" #include "alm.h" #include "alm_fitsio.h" #include "healpix_map.h" #include "healpix_map_fitsio.h" #include "powspec.h" #include "powspec_fitsio.h" #include "alm_healpix_tools.h" #include "alm_powspec_tools.h" #include "fitshandle.h" #include "levels_facilities.h" #include "lsconstants.h" #include "announce.h" using namespace std; namespace { template void anafast_cxx (paramfile ¶ms) { int nlmax = params.template find("nlmax"); int nmmax = params.template find("nmmax",nlmax); string infile = params.template find("infile"); string outfile = params.template find("outfile",""); string outfile_alms = params.template find("outfile_alms",""); planck_assert ((outfile!="") || (outfile_alms!=""), "no output specified, nothing done"); bool polarisation = params.template find("polarisation"); int num_iter = params.template find("iter_order",0); bool remove_mono = params.template find("remove_monopole",false); if (!polarisation) { Healpix_Map map; read_Healpix_map_from_fits(infile,map,1,2); double avg=0.; if (remove_mono) { avg=map.average(); map.Add(T(-avg)); } tsize nmod = map.replaceUndefWith0(); if (nmod!=0) cout << "WARNING: replaced " << nmod << " undefined map pixels with a value of 0" << endl; arr weight; get_ring_weights (params,map.Nside(),weight); Alm > alm(nlmax,nmmax); if (map.Scheme()==NEST) map.swap_scheme(); map2alm_iter(map,alm,num_iter,weight); alm(0,0) += T(avg*sqrt(fourpi)); if (outfile!="") { PowSpec powspec; extract_powspec (alm,powspec); write_powspec_to_fits (outfile,powspec,1); } if (outfile_alms!="") write_Alm_to_fits(outfile_alms,alm,nlmax,nmmax,planckType()); } else { Healpix_Map mapT, mapQ, mapU; read_Healpix_map_from_fits(infile,mapT,mapQ,mapU,2); double avg=0.; if (remove_mono) { avg=mapT.average(); mapT.Add(T(-avg)); } tsize nmod = mapT.replaceUndefWith0()+mapT.replaceUndefWith0() +mapU.replaceUndefWith0(); if (nmod!=0) cout << "WARNING: replaced " << nmod << " undefined map pixels with a value of 0" << endl; arr weight; get_ring_weights (params,mapT.Nside(),weight); Alm > almT(nlmax,nmmax), almG(nlmax,nmmax), almC(nlmax,nmmax); if (mapT.Scheme()==NEST) mapT.swap_scheme(); if (mapQ.Scheme()==NEST) mapQ.swap_scheme(); if (mapU.Scheme()==NEST) mapU.swap_scheme(); map2alm_pol_iter (mapT,mapQ,mapU,almT,almG,almC,num_iter,weight); almT(0,0) += T(avg*sqrt(fourpi)); if (outfile!="") { PowSpec powspec; extract_powspec (almT,almG,almC,powspec); params.template find("full_powerspectrum",false) ? write_powspec_to_fits (outfile,powspec,6) : write_powspec_to_fits (outfile,powspec,4); } if (outfile_alms!="") write_Alm_to_fits (outfile_alms,almT,almG,almC,nlmax,nmmax,planckType()); } } } // unamed namespace int anafast_cxx_module (int argc, const char **argv) { module_startup ("anafast_cxx", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); bool dp = params.find ("double_precision",false); dp ? anafast_cxx(params) : anafast_cxx(params); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map.cc0000650000175000017530000000525012255154051027457 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2013 Max-Planck-Society * Author: Martin Reinecke */ #include "healpix_map.h" using namespace std; template void Healpix_Map::Import_degrade (const Healpix_Map &orig, bool pessimistic) { planck_assert(nside_ adder; for (int j=fact*y; j(orig.map[opix],Healpix_undef)) { ++hits; adder.add(orig.map[opix]); } } map[m] = T((hits::Import_degrade (const Healpix_Map &orig, bool pessimistic); template void Healpix_Map::Import_degrade (const Healpix_Map &orig, bool pessimistic); template void Healpix_Map::minmax (T &Min, T &Max) const { Min = T(1e30); Max = T(-1e30); for (int m=0; m(val,Healpix_undef)) { if (val>Max) Max=val; if (val::minmax (float &Min, float &Max) const; template void Healpix_Map::minmax (double &Min, double &Max) const; healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/anafast_cxx.cc0000650000175000017530000000027612255154051027472 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN anafast_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm_fitsio.h0000650000175000017530000001140212255154051027154 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file alm_fitsio.h * FITS I/O for spherical harmonic coefficients * * Copyright (C) 2003-2010 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_ALM_FITSIO_H #define PLANCK_ALM_FITSIO_H #include #include "xcomplex.h" #include "datatypes.h" #include "fitshandle.h" template class Alm; /*! \defgroup alm_fitsio_group FITS-based I/O of a_lm */ /*! \{ */ /*! Returns the maximum \a l and \a m multipole moments found in the FITS HDU pointed to be \a inp in \a lmax and \a mmax. */ void get_almsize(fitshandle &inp, int &lmax, int &mmax); /*! Returns the maximum \a l and \a m multipole moments found in the HDU \a hdunum of file \a filename in \a lmax and \a mmax. */ void get_almsize(const std::string &filename, int &lmax, int &mmax, int hdunum=2); /*! Returns the maximum \a l and \a m multipole moments found in the HDUs 2, 3 and 4 of file \a filename in \a lmax and \a mmax. */ void get_almsize_pol(const std::string &filename, int &lmax, int &mmax); /*! Reads the a_lm of the FITS binary table pointed to by \a inp into \a alms. \a alms is reallocated with the parameters \a lmax and \a mmax. Values not present in the FITS table are set to zero; values outside the requested (l,m) range are ignored. */ template void read_Alm_from_fits (fitshandle &inp, Alm > &alms, int lmax, int mmax); /*! Opens the FITS file \a filename, jumps to the HDU \a hdunum, then reads the a_lm from the FITS binary table there into \a alms. \a alms is reallocated with the parameters \a lmax and \a mmax. Values not present in the FITS table are set to zero; values outside the requested \a (l,m) range are ignored. */ template void read_Alm_from_fits (const std::string &filename, Alm > &alms, int lmax, int mmax, int hdunum=2); template inline void read_Alm_from_fits (const std::string &filename, Alm > &almT, Alm > &almG, Alm > &almC, int lmax, int mmax, int firsthdu=2) { read_Alm_from_fits (filename, almT, lmax, mmax, firsthdu); read_Alm_from_fits (filename, almG, lmax, mmax, firsthdu+1); read_Alm_from_fits (filename, almC, lmax, mmax, firsthdu+2); } /*! Inserts a new binary table into \a out, which contains three columns of type PLANCK_INT32, \a datatype and \a datatype, respectively. The data in \a alms is written into this table; values outside the requested (\a lmax, \a mmax) range are omitted. */ template void write_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype); template inline void write_Alm_to_fits (const std::string &outfile, const Alm > &alms, int lmax, int mmax, PDT datatype) { fitshandle out; out.create(outfile); write_Alm_to_fits (out, alms, lmax, mmax, datatype); } template inline void write_Alm_to_fits (const std::string &outfile, const Alm > &almT, const Alm > &almG, const Alm > &almC, int lmax, int mmax, PDT datatype) { fitshandle out; out.create(outfile); write_Alm_to_fits (out, almT, lmax, mmax, datatype); write_Alm_to_fits (out, almG, lmax, mmax, datatype); write_Alm_to_fits (out, almC, lmax, mmax, datatype); } /*! Inserts a new binary table into \a out, which contains three columns of type PLANCK_INT32, \a datatype and \a datatype, respectively. The data in \a alms is written into this table; values outside the requested (\a lmax, \a mmax) range are omitted. Values with an absolute magnitude of zero are not written. */ template void write_compressed_Alm_to_fits (fitshandle &out, const Alm > &alms, int lmax, int mmax, PDT datatype); /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/hotspots_cxx.cc0000650000175000017530000000027712255154051027741 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN hotspots_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec_fitsio.cc0000650000175000017530000000705612255154051030233 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2013 Max-Planck-Society * Author: Martin Reinecke */ #include "powspec_fitsio.h" #include "powspec.h" #include "fitshandle.h" using namespace std; void read_powspec_from_fits (fitshandle &inp, PowSpec &powspec, int nspecs, int lmax) { planck_assert ((nspecs==1)||(nspecs==4)||(nspecs==6), "wrong number of spectra"); arr tt(lmax+1,0),gg(lmax+1,0),cc(lmax+1,0),tg(lmax+1,0), tc(lmax+1,0),gc(lmax+1,0); int lmax_file = safe_cast(inp.nelems(1)-1); if (lmax_file=4) { inp.read_column_raw (2,&gg[0],lmax_read+1); inp.read_column_raw (3,&cc[0],lmax_read+1); inp.read_column_raw (4,&tg[0],lmax_read+1); } if (nspecs==6) { inp.read_column_raw (5,&tc[0],lmax_read+1); inp.read_column_raw (6,&gc[0],lmax_read+1); } if (nspecs==1) powspec.Set(tt); if (nspecs==4) powspec.Set(tt,gg,cc,tg); if (nspecs==6) powspec.Set(tt,gg,cc,tg,tc,gc); } void read_powspec_from_fits (const string &infile, PowSpec &powspec, int nspecs, int lmax, int hdunum) { fitshandle inp; inp.open(infile); inp.goto_hdu(hdunum); read_powspec_from_fits (inp,powspec,nspecs,lmax); } void write_powspec_to_fits (fitshandle &out, const PowSpec &powspec, int nspecs) { planck_assert ((nspecs==1)||(nspecs==4)||(nspecs==6), "incorrect number of spectra"); vector cols; cols.push_back(fitscolumn("Temperature C_l","unknown",1,PLANCK_FLOAT64)); if (nspecs>1) { cols.push_back(fitscolumn("E-mode C_l","unknown",1,PLANCK_FLOAT64)); cols.push_back(fitscolumn("B-mode C_l","unknown",1,PLANCK_FLOAT64)); cols.push_back(fitscolumn("T-E cross-corr.","unknown",1, PLANCK_FLOAT64)); } if (nspecs>4) { cols.push_back(fitscolumn("T-B cross-corr.","unknown",1,PLANCK_FLOAT64)); cols.push_back(fitscolumn("E-B cross-corr.","unknown",1,PLANCK_FLOAT64)); } out.insert_bintab(cols); out.write_column(1,powspec.tt()); if (nspecs>1) { out.write_column(2,powspec.gg()); out.write_column(3,powspec.cc()); out.write_column(4,powspec.tg()); } if (nspecs>4) { out.write_column(5,powspec.tc()); out.write_column(6,powspec.gc()); } } void write_powspec_to_fits (const string &outfile, const PowSpec &powspec, int nspecs) { fitshandle out; out.create(outfile); write_powspec_to_fits(out,powspec,nspecs); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm2map_cxx.cc0000650000175000017530000000027612255154051027406 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN alm2map_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map_fitsio.cc0000650000175000017530000001546512255154051031045 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "healpix_map_fitsio.h" #include "healpix_map.h" #include "fitshandle.h" #include "share_utils.h" #include "string_utils.h" using namespace std; namespace { unsigned int healpix_repcount (tsize npix) { if (npix<1024) return 1; if ((npix%1024)==0) return 1024; return isqrt (npix/12); } } // unnamed namespace template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &map, int colnum) { arr myarr; inp.read_entire_column (colnum, myarr); int64 nside = inp.get_key("NSIDE"); planck_assert (int64(myarr.size())==12*nside*nside, string("mismatch between number of map pixels (" +dataToString(myarr.size())+") and Nside ("+dataToString(nside)+")")); map.Set (myarr, string2HealpixScheme(inp.get_key("ORDERING"))); } template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &map, int colnum); template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &map, int colnum); template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &map, int colnum); template void read_Healpix_map_from_fits (const string &filename, Healpix_Map &map, int colnum, int hdunum) { fitshandle inp; inp.open (filename); inp.goto_hdu (hdunum); read_Healpix_map_from_fits (inp,map,colnum); } template void read_Healpix_map_from_fits (const string &filename, Healpix_Map &map, int colnum, int hdunum); template void read_Healpix_map_from_fits (const string &filename, Healpix_Map &map, int colnum, int hdunum); template void read_Healpix_map_from_fits (const string &filename, Healpix_Map &map, int colnum, int hdunum); template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU) { int64 nside = inp.get_key("NSIDE"); Healpix_Ordering_Scheme scheme = string2HealpixScheme(inp.get_key("ORDERING")); mapT.SetNside(nside,scheme); mapQ.SetNside(nside,scheme); mapU.SetNside(nside,scheme); planck_assert (multiequal(int64(mapT.Npix()),inp.nelems(1),inp.nelems(2), inp.nelems(3)), "mismatch between number of map pixels and Nside"); chunkMaker cm(mapT.Npix(),inp.efficientChunkSize(1)); uint64 offset,ppix; while(cm.getNext(offset,ppix)) { inp.read_column_raw(1,&mapT[offset],ppix,offset); inp.read_column_raw(2,&mapQ[offset],ppix,offset); inp.read_column_raw(3,&mapU[offset],ppix,offset); } } template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU); template void read_Healpix_map_from_fits (fitshandle &inp, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU); template void read_Healpix_map_from_fits (const string &filename, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU, int hdunum) { fitshandle inp; inp.open(filename); inp.goto_hdu(hdunum); read_Healpix_map_from_fits (inp,mapT,mapQ,mapU); } template void read_Healpix_map_from_fits (const string &filename, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU, int hdunum); template void read_Healpix_map_from_fits (const string &filename, Healpix_Map &mapT, Healpix_Map &mapQ, Healpix_Map &mapU, int hdunum); void prepare_Healpix_fitsmap (fitshandle &out, const Healpix_Base &base, PDT datatype, const arr &colname) { vector cols; int repcount = healpix_repcount (base.Npix()); for (tsize m=0; m void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &map, PDT datatype) { arr colname(1); colname[0] = "signal"; prepare_Healpix_fitsmap (out, map, datatype, colname); out.write_column(1,map.Map()); } template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &map, PDT datatype); template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &map, PDT datatype); template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &map, PDT datatype); template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, PDT datatype) { arr colname(3); colname[0] = "signal"; colname[1] = "Q-pol"; colname[2] = "U-pol"; prepare_Healpix_fitsmap (out, mapT, datatype, colname); chunkMaker cm(mapT.Npix(),out.efficientChunkSize(1)); uint64 offset,ppix; while(cm.getNext(offset,ppix)) { out.write_column_raw(1,&mapT[offset],ppix,offset); out.write_column_raw(2,&mapQ[offset],ppix,offset); out.write_column_raw(3,&mapU[offset],ppix,offset); } } template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, PDT datatype); template void write_Healpix_map_to_fits (fitshandle &out, const Healpix_Map &mapT, const Healpix_Map &mapQ, const Healpix_Map &mapU, PDT datatype); healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/healpix_map.h0000650000175000017530000002431112255154051027320 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file healpix_map.h * Copyright (C) 2003-2013 Max-Planck-Society * \author Martin Reinecke */ #ifndef HEALPIX_MAP_H #define HEALPIX_MAP_H #include "arr.h" #include "healpix_base.h" //! Healpix value representing "undefined" const double Healpix_undef=-1.6375e30; /*! A HEALPix map of a given datatype */ template class Healpix_Map: public Healpix_Base { private: arr map; public: /*! Constructs an unallocated map. */ Healpix_Map () {} /*! Constructs a map with a given \a order and the ordering scheme \a scheme. */ Healpix_Map (int order, Healpix_Ordering_Scheme scheme) : Healpix_Base (order, scheme), map(npix_) {} /*! Constructs a map with a given \a nside and the ordering scheme \a scheme. */ Healpix_Map (int nside, Healpix_Ordering_Scheme scheme, const nside_dummy) : Healpix_Base (nside, scheme, SET_NSIDE), map(npix_) {} /*! Constructs a map from the contents of \a data and sets the ordering scheme to \a Scheme. The size of \a data must be a valid HEALPix map size. */ Healpix_Map (const arr &data, Healpix_Ordering_Scheme scheme) : Healpix_Base (npix2nside(data.size()), scheme, SET_NSIDE), map(data) {} /*! Deletes the old map, creates a map from the contents of \a data and sets the ordering scheme to \a scheme. The size of \a data must be a valid HEALPix map size. \note On exit, \a data is zero-sized! */ void Set (arr &data, Healpix_Ordering_Scheme scheme) { Healpix_Base::SetNside(npix2nside (data.size()), scheme); map.transfer(data); } /*! Deletes the old map and creates a new map with a given \a order and the ordering scheme \a scheme. */ void Set (int order, Healpix_Ordering_Scheme scheme) { Healpix_Base::Set(order, scheme); map.alloc(npix_); } /*! Deletes the old map and creates a new map with a given \a nside and the ordering scheme \a scheme. */ void SetNside (int nside, Healpix_Ordering_Scheme scheme) { Healpix_Base::SetNside(nside, scheme); map.alloc(npix_); } /*! Fills the map with \a val. */ void fill (const T &val) { map.fill(val); } /*! Imports the map \a orig into the current map, adjusting the ordering scheme. \a orig must have the same resolution as the current map. */ void Import_nograde (const Healpix_Map &orig) { planck_assert (nside_==orig.nside_, "Import_nograde: maps have different nside"); if (orig.scheme_ == scheme_) for (int m=0; m*swapper)(m)] = orig.map[m]; } } } /*! Imports the map \a orig into the current map, adjusting the ordering scheme and the map resolution. \a orig must have lower resolution than the current map, and \a this->Nside() must be an integer multiple of \a orig.Nside(). */ void Import_upgrade (const Healpix_Map &orig) { planck_assert(nside_>orig.nside_,"Import_upgrade: this is no upgrade"); int fact = nside_/orig.nside_; planck_assert (nside_==orig.nside_*fact, "the larger Nside must be a multiple of the smaller one"); #pragma omp parallel { int m; #pragma omp for schedule (dynamic,5000) for (m=0; mNside(). \a pessimistic determines whether or not pixels are set to \a Healpix_undef when not all of the corresponding high-resolution pixels are defined. This method is instantiated for \a float and \a double only. */ void Import_degrade (const Healpix_Map &orig, bool pessimistic=false); /*! Imports the map \a orig into the current map, adjusting the ordering scheme and the map resolution if necessary. When downgrading, \a pessimistic determines whether or not pixels are set to \a Healpix_undef when not all of the corresponding high-resolution pixels are defined. This method is instantiated for \a float and \a double only. */ void Import (const Healpix_Map &orig, bool pessimistic=false) { if (orig.nside_ == nside_) // no up/degrading Import_nograde(orig); else if (orig.nside_ < nside_) // upgrading Import_upgrade(orig); else Import_degrade(orig,pessimistic); } /*! Returns a constant reference to the pixel with the number \a pix. */ const T &operator[] (int pix) const { return map[pix]; } /*! Returns a reference to the pixel with the number \a pix. */ T &operator[] (int pix) { return map[pix]; } /*! Swaps the map ordering from RING to NEST and vice versa. This is done in-place (i.e. with negligible space overhead). */ void swap_scheme() { swapfunc swapper = (scheme_ == NEST) ? &Healpix_Base::ring2nest : &Healpix_Base::nest2ring; arr cycle=swap_cycles(); for (tsize m=0; m*swapper)(istart); while (inew != istart) { map[iold] = map[inew]; iold = inew; inew = (this->*swapper)(inew); } map[iold] = pixbuf; } scheme_ = (scheme_==RING) ? NEST : RING; } /*! performs the actual interpolation using \a pix and \a wgt. */ T interpolation (const fix_arr &pix, const fix_arr &wgt) const { double wtot=0; T res=T(0); for (tsize i=0; i<4; ++i) { T val=map[pix[i]]; if (!approx(val,Healpix_undef)) { res+=T(val*wgt[i]); wtot+=wgt[i]; } } return (wtot==0.) ? T(Healpix_undef) : T(res/wtot); } /*! Returns the interpolated map value at \a ptg */ T interpolated_value (const pointing &ptg) const { fix_arr pix; fix_arr wgt; get_interpol (ptg, pix, wgt); return interpolation (pix, wgt); } /*! Returns a constant reference to the map data. */ const arr &Map() const { return map; } /*! Returns the minimum and maximum value of the map in \a Min and \a Max. This method is instantiated for \a float and \a double only. */ void minmax (T &Min, T &Max) const; /*! Swaps the contents of two Healpix_Map objects. */ void swap (Healpix_Map &other) { Healpix_Base::swap(other); map.swap(other.map); } /*! Returns the average of all defined map pixels. */ double average() const { kahan_adder adder; int pix=0; for (int m=0; m(map[m],Healpix_undef)) { ++pix; adder.add(map[m]); } return (pix>0) ? adder.result()/pix : Healpix_undef; } /*! Adds \a val to all defined map pixels. */ void Add (T val) { for (int m=0; m(map[m],Healpix_undef)) { map[m]+=val; } } /*! Multiplies all defined map pixels by \a val. */ void Scale (T val) { for (int m=0; m(map[m],Healpix_undef)) { map[m]*=val; } } /*! Returns the root mean square of the map, not counting undefined pixels. */ double rms() const { using namespace std; double result=0; int pix=0; for (int m=0; m(map[m],Healpix_undef)) { ++pix; result+=map[m]*map[m]; } return (pix>0) ? sqrt(result/pix) : Healpix_undef; } /*! Returns the maximum absolute value in the map, ignoring undefined pixels. */ T absmax() const { using namespace std; T result=0; for (int m=0; m(map[m],Healpix_undef)) { result = max(result,abs(map[m])); } return result; } /*! Returns \a true, if no pixel has the value \a Healpix_undef, else \a false. */ bool fullyDefined() const { for (int m=0; m(map[m],Healpix_undef)) return false; return true; } /*! Sets all pixels with the value \a Healpix_undef to 0, and returns the number of modified pixels. */ tsize replaceUndefWith0() { tsize res=0; for (int m=0; m(map[m],Healpix_undef)) { map[m]=0.; ++res; } return res; } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/powspec_fitsio.h0000650000175000017530000000450612255154051030072 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file powspec_fitsio.h * Copyright (C) 2003-2013 Max-Planck-Society * \author Martin Reinecke */ #ifndef POWSPEC_FITSIO_H #define POWSPEC_FITSIO_H #include class fitshandle; class PowSpec; /*! \defgroup powspec_fitsio_group FITS-based I/O of power spectra */ /*! \{ */ /*! Reads the power spectrum stored in the FITS binary table pointed to by \a inp into \a powspec. */ void read_powspec_from_fits (fitshandle &inp, PowSpec &powspec, int nspecs, int lmax); /*! Opens the FITS file \a filename, jumps to HDU \a hdunum, and reads \a nspecs columns into \a powspec. \a nspecs must be 1, 4, or 6. */ void read_powspec_from_fits (const std::string &infile, PowSpec &powspec, int nspecs, int lmax, int hdunum=2); /*! Inserts a new binary table into \a out, which contains \a nspecs columns of FITS type TDOUBLE, and writes the components of \a powspec into it. \a nspecs must be 1, 4, or 6. */ void write_powspec_to_fits (fitshandle &out, const PowSpec &powspec, int nspecs); /*! Creates a new FITS file called \a outfile, inserts a binary table, which contains \a nspecs columns of FITS type TDOUBLE, and writes the components of \a powspec into it. \a nspecs must be 1, 4, or 6. */ void write_powspec_to_fits (const std::string &outfile, const PowSpec &powspec, int nspecs); /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/syn_alm_cxx_module.cc0000650000175000017530000000553112255154051031063 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "xcomplex.h" #include "paramfile.h" #include "planck_rng.h" #include "alm.h" #include "alm_fitsio.h" #include "powspec.h" #include "powspec_fitsio.h" #include "alm_powspec_tools.h" #include "fitshandle.h" #include "levels_facilities.h" #include "lsconstants.h" #include "announce.h" using namespace std; namespace { template void syn_alm_cxx (paramfile ¶ms) { int nlmax = params.template find("nlmax"); int nmmax = params.template find("nmmax",nlmax); planck_assert(nmmax<=nlmax,"nmmax must not be larger than nlmax"); string infile = params.template find("infile"); string outfile = params.template find("outfile"); int rand_seed = params.template find("rand_seed"); double fwhm = arcmin2rad*params.template find("fwhm_arcmin",0.); bool polarisation = params.template find("polarisation"); PowSpec powspec; int nspecs = polarisation ? 4 : 1; read_powspec_from_fits (infile, powspec, nspecs, nlmax); powspec.smoothWithGauss(fwhm); planck_rng rng(rand_seed); if (polarisation) { Alm > almT(nlmax,nmmax), almG(nlmax,nmmax), almC(nlmax,nmmax); create_alm_pol (powspec, almT, almG, almC, rng); write_Alm_to_fits(outfile,almT,almG,almC,nlmax,nmmax,planckType()); } else { Alm > almT(nlmax,nmmax); create_alm (powspec, almT, rng); write_Alm_to_fits(outfile,almT,nlmax,nmmax,planckType()); } } } // unnamed namespace int syn_alm_cxx_module (int argc, const char **argv) { module_startup ("syn_alm_cxx", argc, argv); paramfile params (getParamsFromCmdline(argc,argv)); bool dp = params.find ("double_precision",false); dp ? syn_alm_cxx(params) : syn_alm_cxx(params); return 0; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/mult_alm.par.txt0000650000175000017530000000256612255154051030024 0ustar zoncaplanck00000000000000Parameters read by mult_alm: infile (string): input file containing the a_lm outfile (string): output file name for the calculated a_lm fwhm_arcmin_in (real, default=0): FWHM (in arcmin) of a Gaussian beam, which will be _removed_ from the input a_lm fwhm_arcmin_out (real, default=0): FWHM (in arcmin) of a Gaussian beam, which will be used to smoothe the output a_lm nside_pixwin_in (integer, default=0): If this is different from 0, the corresponding pixel window function will be _removed_ from the input a_lm nside_pixwin_out (integer, default=0): If this is different from 0, the corresponding pixel window function will be applied to the output a_lm if ((nside_pixwin_in>0)||(nside_pixwin_out>0)) healpix_data (string): directory containing the Healpix data files endif cl_in (string, default=""): if supplied, the power spectrum from this file will be _removed_ from the input a_lm NOTE: currently only supported for unpolarised a_lm cl_out (string, default=""): if supplied, the power pectrum from this file will be applied to the output a_lm NOTE: currently only supported for unpolarised a_lm polarisation (bool): if false, only the intensity a_lm are generated, if true, T, G and C a_lm are generated double_precision (bool, default=false): if false, the a_lm are read/written in single precision, otherwise in double precision. healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/udgrade_cxx.cc0000650000175000017530000000027612255154051027470 0ustar zoncaplanck00000000000000#include "levels_facilities.h" #include "error_handling.h" int main (int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN udgrade_cxx_module (argc, argv); PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/alm2map_cxx.par.txt0000650000175000017530000000160712255154051030420 0ustar zoncaplanck00000000000000Parameters read by alm2map_cxx: nlmax (integer): maximum order of l nmmax (integer): maximum order of m (must not be larger than nlmax, default=nlmax) infile (string): input file containing the a_lm outfile (string): output file name for the Healpix map(s) nside (integer): nside parameter for the output map(s) polarisation (bool): if false, only the intensity map is generated, if true, maps for I, Q and U are generated fwhm_arcmin (double, default=0): FWHM in arc minutes of a Gaussian beam, which is used to smooth the a_lm pixel_window (bool, default=false): if true, the a_lm are multiplied by the appropriate pixel window function if (pixel_window) healpix_data (string): directory containing the Healpix data files endif double_precision (bool, default=false): if false, a_lm and maps are read/written in single precision, otherwise in double precision. healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Healpix_cxx/rotalm_cxx.cc0000650000175000017530000001030512255154051027345 0ustar zoncaplanck00000000000000/* * This file is part of Healpix_cxx. * * Healpix_cxx 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 2 of the License, or * (at your option) any later version. * * Healpix_cxx 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 Healpix_cxx; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * For more information about HEALPix, see http://healpix.sourceforge.net */ /* * Healpix_cxx is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2005-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "alm.h" #include "alm_fitsio.h" #include "fitshandle.h" #include "alm_powspec_tools.h" #include "trafos.h" #include "announce.h" #include "string_utils.h" #include "lsconstants.h" using namespace std; namespace { Trafo maketrafo (int num) { switch (num) { case 1: return Trafo(2000,2000,Equatorial,Galactic); case 2: return Trafo(2000,2000,Galactic,Equatorial); case 3: return Trafo(2000,2000,Equatorial,Ecliptic); case 4: return Trafo(2000,2000,Ecliptic,Equatorial); case 5: return Trafo(2000,2000,Ecliptic,Galactic); case 6: return Trafo(2000,2000,Galactic,Ecliptic); case 7: return Trafo(1950,1950,Equatorial,Galactic); case 8: return Trafo(1950,1950,Galactic,Equatorial); case 9: return Trafo(1950,1950,Equatorial,Ecliptic); case 10: return Trafo(1950,1950,Ecliptic,Equatorial); case 11: return Trafo(1950,1950,Ecliptic,Galactic); case 12: return Trafo(1950,1950,Galactic,Ecliptic); default: planck_fail("Unsupported transformation "+dataToString(num)); } } } // unnamed namespace int main(int argc, const char **argv) { PLANCK_DIAGNOSIS_BEGIN module_startup("rotalm_cxx", (argc==5)||(argc==7), "Usage: rotalm_cxx \n" "or : rotalm_cxx \n\n" "itransform: 1: Equatorial (2000) -> Galactic (2000)\n" " 2: Galactic (2000) -> Equatorial (2000)\n" " 3: Equatorial (2000) -> Ecliptic (2000)\n" " 4: Ecliptic (2000) -> Equatorial (2000)\n" " 5: Ecliptic (2000) -> Galactic (2000)\n" " 6: Galactic (2000) -> Ecliptic (2000)\n" " 7: Equatorial (1950) -> Galactic (1950)\n" " 8: Galactic (1950) -> Equatorial (1950)\n" " 9: Equatorial (1950) -> Ecliptic (1950)\n" " 10: Ecliptic (1950) -> Equatorial (1950)\n" " 11: Ecliptic (1950) -> Galactic (1950)\n" " 12: Galactic (1950) -> Ecliptic (1950)\n\n" "psi, theta, phi: Euler angles (in degrees)\n\n" "pol: T or F\n"); string infile = argv[1]; string outfile = argv[2]; bool polarisation = stringToData(argv[argc-1]); rotmatrix rm; if (argc==5) { int trafo = stringToData(argv[3]); Trafo tr(maketrafo(trafo)); rm=tr.Matrix(); } else { rm.Make_CPAC_Euler_Matrix(degr2rad*stringToData(argv[5]), degr2rad*stringToData(argv[4]), degr2rad*stringToData(argv[3])); } Alm > almT,almG,almC; if (!polarisation) { int lmax, dummy; get_almsize (infile,lmax,dummy); read_Alm_from_fits (infile, almT, lmax, lmax); rotate_alm(almT,rm); write_Alm_to_fits (outfile,almT,lmax,lmax,PLANCK_FLOAT32); } else { int lmax, dummy; get_almsize_pol (infile,lmax,dummy); read_Alm_from_fits (infile, almT, almG, almC, lmax, lmax); rotate_alm(almT,almG,almC,rm); write_Alm_to_fits (outfile,almT,almG,almC,lmax,lmax,PLANCK_FLOAT32); } PLANCK_DIAGNOSIS_END } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/0000755000175000017500000000000012351601662024506 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/walltimer.h0000650000175000017530000000531312255154051027015 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file walltimer.h * Functionality related to wall-clock timers * * Copyright (C) 2010, 2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_WALLTIMER_H #define PLANCK_WALLTIMER_H #include #include #include class wallTimer { private: double t_acc, t_started; bool running; public: wallTimer() : t_acc(0.), t_started(0.), running(false) {} void start(double wtime_now) { if (!running) { t_started=wtime_now; running=true; } } void start(); void stop(double wtime_now) { if (running) { t_acc+=wtime_now-t_started; running=false; } } void stop(); void reset() { t_acc=t_started=0.; running=false;} double acc(double wtime_now) const { return running ? t_acc+wtime_now-t_started : t_acc; } double acc() const; }; class wallTimerSet { public: typedef std::map maptype; private: maptype lut; std::vector timer; public: int getIndex(const std::string &name); void start(int index); void stop(int index); void stopstart(int index1, int index2); void reset(int index); double acc(int index); void start(const std::string &name); void stop(const std::string &name); void stopstart(const std::string &name1, const std::string &name2); void reset(const std::string &name); double acc(const std::string &name); void report() const; const maptype &table() const { return lut; } }; extern wallTimerSet wallTimers; void tstack_push(const std::string &name); void tstack_pop(const std::string &name); void tstack_pop(); void tstack_replace(const std::string &name1, const std::string &name2); void tstack_replace(const std::string &name); void tstack_report(const std::string &stem); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/sse_utils_cxx.h0000650000175000017530000003122312255154051027710 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sse_utils_cxx.h * SSE/SSE2/SSE3-related functionality for C++ * * Copyright (C) 2011, 2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SSE_UTILS_CXX_H #define PLANCK_SSE_UTILS_CXX_H template class svec; #if (defined(__SSE2__)) #include #include template<> class svec { public: typedef int Ts; typedef __m128i Tv; typedef union { Tv v; Ts d[4]; } Tu; Tv v; svec () {} svec (const svec &b) : v(b.v) {} svec (const Tv &b) : v(b) {} svec (const Ts &val) : v(_mm_set1_epi32(val)) {} svec (const Ts &val1, const Ts &val2, const Ts &val3, const Ts &val4) : v(_mm_set_epi32(val4,val3,val2,val1)) {} const svec &operator= (const Ts &val) { v=_mm_set1_epi32(val); return *this; } const svec &operator= (const svec &b) { v=b.v; return *this; } Ts operator[] (int p) const { Tu u; u.v=v; return u.d[p]; } void set (int p, Ts val) { Tu u; u.v=v; u.d[p]=val; v=u.v; } const svec &operator+= (const svec &b) { v=_mm_add_epi32(v,b.v); return *this; } const svec &operator-= (const svec &b) { v=_mm_sub_epi32(v,b.v); return *this; } svec operator+ (const svec &b) const { return svec(_mm_add_epi32(v,b.v)); } svec operator- (const svec &b) const { return svec(_mm_sub_epi32(v,b.v)); } const svec &operator&= (const svec &b) { v=_mm_and_si128(v,b.v); return *this; } const svec &operator|= (const svec &b) { v=_mm_or_si128(v,b.v); return *this; } const svec &operator^= (const svec &b) { v=_mm_xor_si128(v,b.v); return *this; } svec operator& (const svec &b) const { return svec(_mm_and_si128(v,b.v)); } svec operator| (const svec &b) const { return svec(_mm_or_si128(v,b.v)); } svec operator^ (const svec &b) const { return svec(_mm_xor_si128(v,b.v)); } svec andnot (const svec &b) const { return svec(_mm_andnot_si128(v,b.v)); } const svec &operator<<= (int b) { v=_mm_slli_epi32(v,b); return *this; } svec operator<< (int b) const { return svec(_mm_slli_epi32(v,b)); } const svec &operator>>= (int b) { v=_mm_srai_epi32(v,b); return *this; } svec operator>> (int b) const { return svec(_mm_srai_epi32(v,b)); } svec eq (const svec &b) const { return svec(_mm_cmpeq_epi32(v,b.v)); } svec gt (const svec &b) const { return svec(_mm_cmpgt_epi32(v,b.v)); } svec lt (const svec &b) const { return svec(_mm_cmplt_epi32(v,b.v)); } }; typedef svec V4si; #if 0 template<> class svec { public: typedef long long Ts; typedef __m128i Tv; typedef union { Tv v; Ts d[2]; } Tu; Tv v; svec () {} svec (const svec &b) : v(b.v) {} svec (const Tv &b) : v(b) {} svec (const Ts &val) : v(_mm_set1_epi64x(val)) {} svec (const Ts &val1, const Ts &val2) : v(_mm_set_epi64x(val2,val1)) {} const svec &operator= (const Ts &val) { v=_mm_set1_epi64x(val); return *this; } const svec &operator= (const svec &b) { v=b.v; return *this; } int operator[] (int p) const { Tu u; u.v=v; return u.d[p]; } void set (int p, int val) { Tu u; u.v=v; u.d[p]=val; v=u.v; } const svec &operator+= (const svec &b) { v=_mm_add_epi64(v,b.v); return *this; } const svec &operator-= (const svec &b) { v=_mm_sub_epi64(v,b.v); return *this; } svec operator+ (const svec &b) const { return svec(_mm_add_epi64(v,b.v)); } svec operator- (const svec &b) const { return svec(_mm_sub_epi64(v,b.v)); } const svec &operator&= (const svec &b) { v=_mm_and_si128(v,b.v); return *this; } const svec &operator|= (const svec &b) { v=_mm_or_si128(v,b.v); return *this; } const svec &operator^= (const svec &b) { v=_mm_xor_si128(v,b.v); return *this; } svec operator& (const svec &b) const { return svec(_mm_and_si128(v,b.v)); } svec operator| (const svec &b) const { return svec(_mm_or_si128(v,b.v)); } svec operator^ (const svec &b) const { return svec(_mm_xor_si128(v,b.v)); } svec andnot (const svec &b) const { return svec(_mm_andnot_si128(v,b.v)); } const svec &operator<<= (int b) { v=_mm_slli_epi64(v,b); return *this; } svec operator<< (int b) const { return svec(_mm_slli_epi64(v,b)); } }; typedef svec V2di; #endif template<> class svec { public: typedef float Ts; typedef __m128 Tv; typedef union { Tv v; Ts d[4]; } Tu; Tv v; svec () {} svec (const svec &b) : v(b.v) {} svec (const Tv &b) : v(b) {} svec (const Ts &val) : v(_mm_set1_ps(val)) {} svec (Ts val1, Ts val2, Ts val3, Ts val4) : v(_mm_set_ps(val4,val3,val2,val1)) {} explicit svec (const svec &b) : v(_mm_cvtepi32_ps(b.v)) {} operator svec() const { return svec (_mm_cvtps_epi32(v)); } const svec &operator= (const Ts &val) { v=_mm_set1_ps(val); return *this; } const svec &operator= (const svec &b) { v=b.v; return *this; } Ts operator[] (int p) const { Tu u; u.v=v; return u.d[p]; } void set (int p, Ts val) { Tu u; u.v=v; u.d[p]=val; v=u.v; } const svec &operator+= (const svec &b) { v=_mm_add_ps(v,b.v); return *this; } const svec &operator-= (const svec &b) { v=_mm_sub_ps(v,b.v); return *this; } const svec &operator*= (const svec &b) { v=_mm_mul_ps(v,b.v); return *this; } const svec &operator/= (const svec &b) { v=_mm_div_ps(v,b.v); return *this; } svec operator+ (const svec &b) const { return svec(_mm_add_ps(v,b.v)); } svec operator- (const svec &b) const { return svec(_mm_sub_ps(v,b.v)); } svec operator* (const svec &b) const { return svec(_mm_mul_ps(v,b.v)); } svec operator/ (const svec &b) const { return svec(_mm_div_ps(v,b.v)); } const svec &operator&= (const svec &b) { v=_mm_and_ps(v,b.v); return *this; } const svec &operator|= (const svec &b) { v=_mm_or_ps(v,b.v); return *this; } const svec &operator^= (const svec &b) { v=_mm_xor_ps(v,b.v); return *this; } svec operator& (const svec &b) const { return svec(_mm_and_ps(v,b.v)); } svec andnot (const svec &b) const { return svec(_mm_andnot_ps(v,b.v)); } svec operator| (const svec &b) const { return svec(_mm_or_ps(v,b.v)); } svec operator^ (const svec &b) const { return svec(_mm_xor_ps(v,b.v)); } svec operator- () const { return svec(_mm_xor_ps(_mm_set1_ps(-0.),v)); } svec eq (const svec &b) const { return svec(_mm_cmpeq_ps(v,b.v)); } svec neq (const svec &b) const { return svec(_mm_cmpneq_ps(v,b.v)); } svec lt (const svec &b) const { return svec(_mm_cmplt_ps(v,b.v)); } svec le (const svec &b) const { return svec(_mm_cmple_ps(v,b.v)); } svec gt (const svec &b) const { return svec(_mm_cmpgt_ps(v,b.v)); } svec ge (const svec &b) const { return svec(_mm_cmpge_ps(v,b.v)); } void writeTo (Ts *val) const { _mm_storeu_ps (val, v); } void writeTo (Ts &a, Ts &b, Ts &c, Ts &d) const { Tu u; u.v=v; a=u.d[0]; b=u.d[1]; c=u.d[2]; d=u.d[3]; } void readFrom (const Ts *val) { v=_mm_loadu_ps(val); } void readFrom (Ts a, Ts b, Ts c, Ts d) { v=_mm_set_ps(d,c,b,a); } }; typedef svec V4sf; inline V4sf sqrt(const V4sf &v) { return V4sf(_mm_sqrt_ps(v.v)); } inline V4sf abs(const V4sf &v) { return V4sf(_mm_andnot_ps(_mm_set1_ps(-0.),v.v)); } inline V4sf blend(const V4sf &mask, const V4sf &a, const V4sf &b) { return (mask&a)|(mask.andnot(b)); } inline bool any (const V4sf &a) { return _mm_movemask_ps(a.v)!=0; } inline bool all (const V4sf &a) { return _mm_movemask_ps(a.v)==15; } inline bool none (const V4sf &a) { return _mm_movemask_ps(a.v)==0; } inline V4sf min (const V4sf &a, const V4sf &b) { return _mm_min_ps(a.v,b.v); } inline V4sf max (const V4sf &a, const V4sf &b) { return _mm_max_ps(a.v,b.v); } template<> class svec { public: typedef double Ts; typedef __m128d Tv; typedef union { Tv v; Ts d[2]; } Tu; Tv v; svec () {} svec (const svec &b) : v(b.v) {} svec (const Tv &b) : v(b) {} svec (const Ts &val) : v(_mm_set1_pd(val)) {} svec (const Ts &val1, const Ts &val2) : v(_mm_set_pd(val2,val1)) {} explicit svec (const svec &b) : v(_mm_cvtepi32_pd(b.v)) {} operator svec() const { return svec (_mm_cvtpd_epi32(v)); } const svec &operator= (const Ts &val) { v=_mm_set1_pd(val); return *this; } const svec &operator= (const svec &b) { v=b.v; return *this; } Ts operator[] (int p) const { Tu u; u.v=v; return u.d[p]; } void set (int p, Ts val) { Tu u; u.v=v; u.d[p]=val; v=u.v; } const svec &operator+= (const svec &b) { v=_mm_add_pd(v,b.v); return *this; } const svec &operator-= (const svec &b) { v=_mm_sub_pd(v,b.v); return *this; } const svec &operator*= (const svec &b) { v=_mm_mul_pd(v,b.v); return *this; } const svec &operator/= (const svec &b) { v=_mm_div_pd(v,b.v); return *this; } svec operator+ (const svec &b) const { return svec(_mm_add_pd(v,b.v)); } svec operator- (const svec &b) const { return svec(_mm_sub_pd(v,b.v)); } svec operator* (const svec &b) const { return svec(_mm_mul_pd(v,b.v)); } svec operator/ (const svec &b) const { return svec(_mm_div_pd(v,b.v)); } const svec &operator&= (const svec &b) { v=_mm_and_pd(v,b.v); return *this; } const svec &operator|= (const svec &b) { v=_mm_or_pd(v,b.v); return *this; } const svec &operator^= (const svec &b) { v=_mm_xor_pd(v,b.v); return *this; } svec operator& (const svec &b) const { return svec(_mm_and_pd(v,b.v)); } svec operator| (const svec &b) const { return svec(_mm_or_pd(v,b.v)); } svec operator^ (const svec &b) const { return svec(_mm_xor_pd(v,b.v)); } svec operator- () const { return svec(_mm_xor_pd(_mm_set1_pd(-0.),v)); } svec eq (const svec &b) const { return svec(_mm_cmpeq_pd(v,b.v)); } svec neq (const svec &b) const { return svec(_mm_cmpneq_pd(v,b.v)); } svec lt (const svec &b) const { return svec(_mm_cmplt_pd(v,b.v)); } svec le (const svec &b) const { return svec(_mm_cmple_pd(v,b.v)); } svec gt (const svec &b) const { return svec(_mm_cmpgt_pd(v,b.v)); } svec ge (const svec &b) const { return svec(_mm_cmpge_pd(v,b.v)); } void writeTo (Ts *val) const { _mm_storeu_pd (val, v); } void writeTo (Ts &a, Ts &b) const { _mm_store_sd(&a,v); _mm_storeh_pd(&b,v); } void readFrom (const Ts *val) { v=_mm_loadu_pd(val); } void readFrom (const Ts &a, const Ts &b) { v=_mm_set_pd(b,a); } }; typedef svec V2df; inline V2df sqrt(const V2df &v) { return V2df(_mm_sqrt_pd(v.v)); } inline V2df abs(const V2df &v) { return V2df(_mm_andnot_pd(_mm_set1_pd(-0.),v.v)); } inline V2df blend(const V2df &mask, const V2df &a, const V2df &b) { return V2df(_mm_or_pd(_mm_and_pd(a.v,mask.v),_mm_andnot_pd(mask.v,b.v))); } inline bool any (const V2df &a) { return _mm_movemask_pd(a.v)!=0; } inline bool all (const V2df &a) { return _mm_movemask_pd(a.v)==3; } inline bool none (const V2df &a) { return _mm_movemask_pd(a.v)==0; } template inline T vcast(const V4si &a); template inline T vcast(const V4sf &a); template inline T vcast(const V2df &a); template<> inline V4si vcast (const V4sf &a) { return V4si (_mm_castps_si128(a.v)); } template<> inline V4sf vcast (const V4si &a) { return V4sf (_mm_castsi128_ps(a.v)); } template<> inline V2df vcast (const V4si &a) { return V2df (_mm_castsi128_pd(a.v)); } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/walltimer.cc0000650000175000017530000001461612255154051027161 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * This file contains functionality related to wall-clock timers * * Copyright (C) 2010, 2011, 2012 Max-Planck-Society * Author: Martin Reinecke */ #include #include #include #include #include #include "walltimer.h" #include "walltime_c.h" #include "error_handling.h" using namespace std; void wallTimer::start() { start(wallTime()); } void wallTimer::stop() { stop(wallTime()); } double wallTimer::acc() const { return acc(wallTime()); } int wallTimerSet::getIndex(const string &name) { maptype::const_iterator it = lut.find(name); if (it!=lut.end()) return it->second; timer.push_back(wallTimer()); lut[name]=timer.size()-1; return timer.size()-1; } void wallTimerSet::start(int index) { timer[index].start(); } void wallTimerSet::stop(int index) { timer[index].stop(); } void wallTimerSet::stopstart(int index1, int index2) { double t=wallTime(); timer[index1].stop(t); timer[index2].start(t); } void wallTimerSet::reset(int index) { timer[index].reset(); } double wallTimerSet::acc(int index) { return timer[index].acc(); } void wallTimerSet::start(const string &name) { start(getIndex(name)); } void wallTimerSet::stop(const string &name) { stop(getIndex(name)); } void wallTimerSet::stopstart(const string &name1, const string &name2) { stopstart(getIndex(name1),getIndex(name2)); } void wallTimerSet::reset(const string &name) { reset(getIndex(name)); } double wallTimerSet::acc(const string &name) { return acc(getIndex(name)); } void wallTimerSet::report() const { cout << "\nWall clock timer report:" << endl; for (maptype::const_iterator it=lut.begin(); it!=lut.end(); ++it) printf(" %-15s: %10.5fs\n", it->first.c_str(), timer[it->second].acc()); cout << "End wall clock timer report\n" << endl; } wallTimerSet wallTimers; namespace { class tstack_node; typedef map::iterator Ti; typedef map::const_iterator Tci; typedef pair Tipair; class tstack_node { public: tstack_node *parent; wallTimer wt; string name; map child; tstack_node(const string &name_, tstack_node *parent_) : parent(parent_), name(name_) {} int max_namelen() const { int res=name.length(); for (Tci it=child.begin(); it!=child.end(); ++it) res=max(res,it->second.max_namelen()); return res; } }; tstack_node tstack_root("root",0); tstack_node *curnode=0; double overhead=0.; struct timecomp { bool operator() (const Tipair &a, const Tipair &b) const { return a.second>b.second; } }; void tstack_report(const tstack_node &node, const string &indent, int twidth, int slen) { double total=node.wt.acc(); vector tmp; for (Tci it=node.child.begin(); it!=node.child.end(); ++it) tmp.push_back(make_pair(it,it->second.wt.acc())); if (tmp.size()>0) { sort(tmp.begin(),tmp.end(),timecomp()); double tsum=0; printf("%s|\n", indent.c_str()); for (unsigned i=0; ifirst).c_str(), 100*tmp[i].second/total,twidth, tmp[i].second); tstack_report(tmp[i].first->second,indent+"| ",twidth,slen); tsum+=tmp[i].second; } printf("%s+- %-*s:%6.2f%% (%*.4fs)\n%s\n",indent.c_str(),slen, "",100*(total-tsum)/total,twidth,total-tsum,indent.c_str()); } } } // unnamed namespace void tstack_push(const string &name) { double t0=wallTime(); if (curnode==0) curnode=&tstack_root; Ti it=curnode->child.find(name); if (it==curnode->child.end()) it=curnode->child.insert (make_pair(name,tstack_node(name,curnode))).first; curnode=&(it->second); double t1=wallTime(); curnode->wt.start(0.5*(t0+t1)); overhead+=t1-t0; } void tstack_pop(const string &name) { double t0=wallTime(); planck_assert(curnode && (curnode->name==name), "invalid tstack operation"); double t1=wallTime(); curnode->wt.stop(0.5*(t0+t1)); curnode=curnode->parent; overhead+=t1-t0; } void tstack_pop() { double t0=wallTime(); planck_assert(curnode, "invalid tstack operation"); double t1=wallTime(); curnode->wt.stop(0.5*(t0+t1)); curnode=curnode->parent; overhead+=t1-t0; } void tstack_replace(const string &name2) { double t0=wallTime(); planck_assert(curnode, "invalid tstack operation"); tstack_node *savenode=curnode; curnode=curnode->parent; Ti it=curnode->child.find(name2); if (it==curnode->child.end()) it=curnode->child.insert(make_pair(name2,tstack_node(name2,curnode))).first; curnode=&(it->second); double t1=wallTime(); double t=0.5*(t0+t1); savenode->wt.stop(t); curnode->wt.start(t); overhead+=t1-t0; } void tstack_replace(const string &name1, const string &name2) { planck_assert(curnode && (curnode->name==name1), "invalid tstack operation"); tstack_replace(name2); } void tstack_report(const string &stem) { const tstack_node *ptr = 0; for (Tci it=tstack_root.child.begin(); it!=tstack_root.child.end(); ++it) if (it->first==stem) ptr=&(it->second); planck_assert(ptr,"invalid stem"); int slen=string("").size(); slen = max(slen,ptr->max_namelen()); double total=ptr->wt.acc(); printf("\nTotal wall clock time for '%s': %1.4fs\n",stem.c_str(),total); int logtime=max(1,int(log10(total)+1)); tstack_report(*ptr,"",logtime+5,slen); printf("\nAccumulated timing overhead: approx. %1.4fs\n",overhead); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/ls_image.h0000650000175000017530000001362512255154051026602 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file ls_image.h * Classes for creation and output of image files * * Copyright (C) 2003-2012 Max-Planck-Society * \author Martin Reinecke, David Larson */ #ifndef PLANCK_LS_IMAGE_H #define PLANCK_LS_IMAGE_H #include #include #include #include #include "arr.h" #include "datatypes.h" /*! \defgroup imagegroup Image creation */ /*! \{ */ /*! A very simple class for storing RGB colours. */ class Colour { public: float r, /*!< the red component */ g, /*!< the green component */ b; /*!< the blue component */ /*! Default constructor. Does not initialize \a r, \a g and \a b. */ Colour() {} /*! Initializes the colour with \a R, \a G and \a B. */ Colour (float R, float G, float B) : r(R), g(G), b(B) {} /*! Multiplies all components with \a fact. */ const Colour &operator*= (float fact) { r*=fact; g*=fact; b*=fact; return *this; } /*! Returns the sum colour of \a *this and \a c2. */ const Colour operator+ (const Colour &c2) const { return Colour(r+c2.r, g+c2.g, b+c2.b); } /*! Returns \a *this, scaled by \a f. */ const Colour operator* (double f) const { return Colour(float(r*f), float(g*f), float(b*f)); } }; /*! A class for mapping floting-point values into colours. */ class Palette { private: std::vector cv; std::vector fv; public: /*! Adds a new data point \a f, with the corresponding colour \a c. The additions must be done in the order of ascending \a f. */ void add (float f, const Colour &c) { fv.push_back(f); cv.push_back(c); } /*! Sets the palette to the predefined palette \a num. */ void setPredefined(int num); /*! Returns the colour corresponding to the value \a f. The colour is determined by linear interpolation between neighbouring data points. */ Colour Get_Colour (float f) const { if (f<=fv[0]) return cv[0]; if (f>=fv[fv.size()-1]) return cv[cv.size()-1]; int i=0; while (f>fv[i]) ++i; return cv[i-1]*((fv[i]-f)/(fv[i]-fv[i-1])) + cv[i]*((f-fv[i-1])/(fv[i]-fv[i-1])); } }; class Colour8 { private: void import (const Colour &col) { using namespace std; r = uint8(max(0,min(255,int(col.r*256)))); g = uint8(max(0,min(255,int(col.g*256)))); b = uint8(max(0,min(255,int(col.b*256)))); } public: uint8 r,g,b; Colour8() {} Colour8 (uint8 R, uint8 G, uint8 B) : r(R), g(G), b(B) {} Colour8 (const Colour &col) { import (col); } const Colour8 &operator= (const Colour &col) { import (col); return *this; } bool operator== (const Colour8 &that) { return (r == that.r) && (g == that.g) && (b == that.b); } bool operator!= (const Colour8 &that) { return (r != that.r) || (g != that.g) || (b != that.b); } }; class MP_Font { public: int offset, num_chars, xpix, ypix; const char *data; }; extern const MP_Font medium_bold_font; extern const MP_Font giant_font; /*! Class for creating and storing image files. */ class LS_Image { private: MP_Font font; arr2 pixel; void write_char (int xpos, int ypos, const Colour &col, char c, int scale=1); public: /*! */ LS_Image (); /*! Creates an image object with a resolution of \a xres by \a yres. */ LS_Image (int xres, int yres); /*! */ ~LS_Image () {} /*! Fills the entire image with colour \a col. */ void fill (const Colour &col) { pixel.fill(col); } /*! Sets the font used for annotations to \a fnt. */ void set_font (const MP_Font &fnt); /*! Outputs the string \a text in colour \a col. \a xpos, \a ypos is the lower left corner; the font is scaled by \a scale. */ void annotate (int xpos, int ypos, const Colour &col, const std::string &text, int scale=1); /*! Outputs the string \a text centered at position \a xpos, \a ypos in colour \a col. The font is scaled by \a scale. */ void annotate_centered (int xpos, int ypos, const Colour &col, const std::string &text, int scale=1); /*! Sets the pixel \a i, \a j, to the colour \a col. */ void put_pixel (tsize i, tsize j, const Colour &col) { if ((i #endif #include "share_utils.h" inline bool openmp_enabled() { #ifdef _OPENMP return true; #else return false; #endif } inline int openmp_max_threads () { #ifdef _OPENMP return omp_get_max_threads(); #else return 1; #endif } inline int openmp_num_threads () { #ifdef _OPENMP return omp_get_num_threads(); #else return 1; #endif } inline int openmp_thread_num () { #ifdef _OPENMP return omp_get_thread_num(); #else return 0; #endif } /*! Calculates the range of indices between \a glo and \a ghi which must be processed by this thread and returns it in \a lo and \a hi. The indices \a ghi and \a hi are "one past the last real index", in analogy to the STL iterators. */ inline void openmp_calc_share (int64 glo, int64 ghi, int64 &lo, int64 &hi) { #ifdef _OPENMP calcShareGeneral (glo,ghi,omp_get_num_threads(),omp_get_thread_num(),lo,hi); #else lo=glo; hi=ghi; #endif } #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/announce.h0000650000175000017530000000420612255154051026623 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file announce.h * Functions for printing information at startup. * * Copyright (C) 2002-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_ANNOUNCE_H #define PLANCK_ANNOUNCE_H #include /*! Prints a banner containing \a name, as well as some information about the source code and the parallelisation techniques enabled. */ void announce (const std::string &name); /*! Prints a banner containing \a name and checks if \a argc_valid is true. If not, the string \a usage is printed and the program is terminated. */ void module_startup (const std::string &name, bool argc_valid, const std::string &usage, bool verbose=true); /*! Prints a banner containing \a name and checks if \a argc==argc_expected. If not, a usage description is given and the program is terminated. */ void module_startup (const std::string &name, int argc, const char **argv, int argc_expected, const std::string &argv_expected, bool verbose=true); /*! Prints a banner containing \a name and checks if \a argc>=2. If not, a usage description is given and the program is terminated. */ void module_startup (const std::string &name, int argc, const char **argv, bool verbose=true); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/trafos.cc0000650000175000017530000001436012255154051026453 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file trafos.cc * Celestial coordinate transformations. * * Copyright (C) 2005-2011 Max-Planck-Society * \author Martin Reinecke */ #include "trafos.h" #include "geom_utils.h" #include "lsconstants.h" using namespace std; vec3 Trafo::xcc_dp_precess (const vec3 &iv, double iepoch, double oepoch) { // Z-axis rotation by OBL_LONG: double Tm = ((oepoch+iepoch)*0.5 - 1900.) *0.01; double gp_long = degr2rad * ((oepoch-iepoch) * (50.2564+0.0222*Tm) / 3600.); double obl_long = degr2rad * (180. - (173. + (57.06+54.77*Tm) / 60.)) + gp_long*0.5; double dco = cos(obl_long), dso = sin(obl_long); vec3 ov (iv.x*dco-iv.y*dso, iv.x*dso+iv.y*dco, iv.z); // X-axis rotation by dE: double dE = degr2rad * ((oepoch-iepoch) * (0.4711-0.0007*Tm) / 3600.); double dce = cos(dE), dse = sin(dE); double temp = ov.y*dce - ov.z*dse; ov.z = ov.y*dse + ov.z*dce; ov.y = temp; // Z-axis rotation by GP_LONG - OBL_LONG: double dL = gp_long - obl_long; double dcl = cos(dL), dsl = sin(dL); temp = ov.x*dcl - ov.y*dsl; ov.y = ov.x*dsl + ov.y*dcl; ov.x = temp; return ov; } double Trafo::get_epsilon (double epoch) { double T = (epoch - 1900.) * 0.01; return degr2rad * (23.452294 - 0.0130125*T - 1.63889e-6*T*T + 5.02778e-7*T*T*T); } /*! Routine to convert from ecliptic coordinates to equatorial (celestial) coordinates at the given epoch. Adapted from the COBLIB routine by Dr. E. Wright. */ vec3 Trafo::xcc_dp_e_to_q (const vec3 &iv, double epoch) { double epsilon=get_epsilon(epoch); double dc = cos(epsilon), ds = sin(epsilon); return vec3 (iv.x, dc*iv.y-ds*iv.z, dc*iv.z+ds*iv.y); } vec3 Trafo::xcc_dp_q_to_e (const vec3 &iv, double epoch) { double epsilon=-get_epsilon(epoch); double dc = cos(epsilon), ds = sin(epsilon); return vec3 (iv.x, dc*iv.y-ds*iv.z, dc*iv.z+ds*iv.y); } /*! Routine to convert galactic coordinates to ecliptic (celestial) coordinates at the given epoch. First the conversion to ecliptic 2000 is done, then if necessary the results are precessed. */ vec3 Trafo::xcc_dp_g_to_e (const vec3 &iv, double epoch) { static const rotmatrix T (-0.054882486, 0.494116468, -0.867661702, -0.993821033, -0.110993846, -0.000346354, -0.096476249, 0.862281440, 0.497154957); vec3 hv=T.Transform(iv); if (!approx(epoch,2000.)) hv=xcc_dp_precess(hv,2000.,epoch); return hv; } /*! Routine to convert ecliptic (celestial) coordinates at the given epoch to galactic coordinates. The ecliptic coordinates are first precessed to 2000.0, then converted. */ vec3 Trafo::xcc_dp_e_to_g (const vec3 &iv, double epoch) { static const rotmatrix T (-0.054882486, -0.993821033, -0.096476249, 0.494116468, -0.110993846, 0.862281440, -0.867661702, -0.000346354, 0.497154957); vec3 hv=iv; if (!approx(epoch,2000.)) hv=xcc_dp_precess(hv,epoch,2000.); return T.Transform(hv); } /*! Function to convert between standard coordinate systems, including precession. */ vec3 Trafo::xcc_v_convert(const vec3 &iv, double iepoch, double oepoch, coordsys isys,coordsys osys) { vec3 xv; if (isys == Ecliptic) xv=iv; else if (isys == Equatorial) xv = xcc_dp_q_to_e(iv,iepoch); else if (isys == Galactic) xv = xcc_dp_g_to_e(iv,iepoch); else planck_fail("Unsupported input coordinate system"); vec3 yv = approx(iepoch,oepoch) ? xv : xcc_dp_precess(xv,iepoch,oepoch); vec3 ov; if (osys == Ecliptic) ov = yv; else if (osys == Equatorial) ov = xcc_dp_e_to_q(yv,oepoch); else if (osys == Galactic) ov = xcc_dp_e_to_g(yv,oepoch); else planck_fail("Unsupported output coordinate system"); return ov; } void Trafo::coordsys2matrix (double iepoch, double oepoch, coordsys isys, coordsys osys, rotmatrix &matrix) { vec3 v1p = xcc_v_convert(vec3(1,0,0),iepoch,oepoch,isys,osys), v2p = xcc_v_convert(vec3(0,1,0),iepoch,oepoch,isys,osys), v3p = xcc_v_convert(vec3(0,0,1),iepoch,oepoch,isys,osys); v1p.Normalize(); v2p.Normalize(); v3p.Normalize(); matrix=rotmatrix(v1p,v2p,v3p); } Trafo::Trafo (double iepoch, double oepoch, coordsys isys, coordsys osys) { coordsys2matrix (iepoch, oepoch, isys, osys, mat); } pointing Trafo::operator() (const pointing &ptg) const { return pointing(operator()(vec3(ptg))); } void Trafo::rotatefull (const pointing &ptg, pointing &newptg, double &delta_psi) const { vec3 vec (ptg); vec3 east (-vec.y,vec.x,0.); vec3 newvec = operator()(vec); vec3 neweast = operator()(east); delta_psi = orientation(newvec,neweast)+halfpi; newptg = newvec; } void Trafo::rotatefull (pointing &ptg, double &psi) const { vec3 vec (ptg); vec3 east (-vec.y,vec.x,0.); vec3 newvec = operator()(vec); vec3 neweast = operator()(east); psi += orientation(newvec,neweast)+halfpi; ptg = newvec; } void Trafo::rotatefull (const vec3 &vec, vec3 &newvec, double &delta_psi) const { vec3 east (-vec.y,vec.x,0.); newvec = operator()(vec); vec3 neweast = operator()(east); delta_psi = orientation(newvec,neweast)+halfpi; } void Trafo::rotatefull (vec3 &vec, double &psi) const { vec3 east (-vec.y,vec.x,0.); vec3 newvec = operator()(vec); vec3 neweast = operator()(east); psi += orientation(newvec,neweast)+halfpi; vec = newvec; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/safe_cast.h0000650000175000017530000000530512255154051026746 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file safe_cast.h * Numerical cast operator with additional checks that the value is preserved. * * Copyright (C) 2009 Max-Planck-Society * Author: Martin Reinecke */ #ifndef PLANCK_SAFE_CAST_H #define PLANCK_SAFE_CAST_H #include #include "error_handling.h" template struct safe_cast_helper__ {}; template struct safe_cast_helper__ { static T1 cast (const T2 &arg) { T1 res = T1(arg); planck_assert(T2(res)==arg, "safe_cast: value changed during cast"); return res; } }; template struct safe_cast_helper__ { static T1 cast (const T2 &arg) { T1 res = T1(arg); planck_assert(T2(res)==arg, "safe_cast: value changed during cast"); return res; } }; template struct safe_cast_helper__ { static T1 cast (const T2 &arg) { T1 res = T1(arg); planck_assert((res>=0) && (T2(res)==arg), "safe_cast: value changed during cast"); return res; } }; template struct safe_cast_helper__ { static T1 cast (const T2 &arg) { T1 res = T1(arg); planck_assert((arg>=0) && (T2(res)==arg), "safe_cast: value changed during cast"); return res; } }; /*! Tries to cast \a arg from its type to a variable of type \c T1. If this conversion leads to a change of the actual value (e.g. due to overflow or truncation), an exception is thrown. */ template inline T1 safe_cast(const T2 &arg) { return safe_cast_helper__::is_signed, std::numeric_limits::is_signed>::cast(arg); } #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/trafos.h0000650000175000017530000000626412255154051026321 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file trafos.h * Celestial coordinate transformations. * * Copyright (C) 2005-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_TRAFOS_H #define PLANCK_TRAFOS_H #include "vec3.h" #include "pointing.h" #include "rotmatrix.h" enum coordsys { Ecliptic, Equatorial, Galactic }; /*! Class for celestial coordinate transformations. */ class Trafo { private: rotmatrix mat; static vec3 xcc_dp_precess (const vec3 &iv, double iepoch, double oepoch); static double get_epsilon (double epoch); static vec3 xcc_dp_e_to_q (const vec3 &iv, double epoch); static vec3 xcc_dp_q_to_e (const vec3 &iv, double epoch); static vec3 xcc_dp_g_to_e (const vec3 &iv, double epoch); static vec3 xcc_dp_e_to_g (const vec3 &iv, double epoch); static vec3 xcc_v_convert(const vec3 &iv, double iepoch, double oepoch, coordsys isys,coordsys osys); static void coordsys2matrix (double iepoch, double oepoch, coordsys isys, coordsys osys, rotmatrix &matrix); public: /*! Creates a \a Trafo for transformation from \a iepoch and \a isys to \a oepoch and \a osys. */ Trafo (double iepoch, double oepoch, coordsys isys, coordsys osys); /*! Transforms the vector \a vec and returns the result. */ vec3 operator() (const vec3 &vec) const { return mat.Transform(vec); } /*! Transforms the pointing \a ptg and returns the result. */ pointing operator() (const pointing &ptg) const; /*! Transforms the pointing \a ptg and returns it in \a newptg. On exit, \a delta_psi holds the change in orientation. */ void rotatefull (const pointing &ptg, pointing &newptg, double &delta_psi) const; /*! Transforms the pointing \a ptg and adjusts \a psi accordingly. */ void rotatefull (pointing &ptg, double &psi) const; /*! Transforms the vector \a vec and returns it in \a newvec. On exit, \a delta_psi holds the change in orientation. */ void rotatefull (const vec3 &vec, vec3 &newvec, double &delta_psi) const; /*! Transforms the vector \a vec and adjusts \a psi accordingly. */ void rotatefull (vec3 &vec, double &psi) const; /*! Returns the internally used rotation matrix. */ const rotmatrix &Matrix() const { return mat; } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/cxxsupport.dox0000650000175000017530000000025212255154051027614 0ustar zoncaplanck00000000000000/*! \mainpage LevelS C++ support library documentation Please refer to the Modules page for an overview of the supplied functionality. */ healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/rotmatrix.h0000650000175000017530000001127412255154051027051 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file rotmatrix.h * Class for rotation transforms in 3D space * * Copyright (C) 2003-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_ROTMATRIX_H #define PLANCK_ROTMATRIX_H #include #include "vec3.h" /*! \defgroup rotmatrixgroup Rotation matrices */ /*! \{ */ /*! Class for rotation transforms in 3D space */ class rotmatrix { public: double entry[3][3]; rotmatrix () {} /*! Constructs a rotation matrix from its nine entries */ rotmatrix (double a00, double a01, double a02, double a10, double a11, double a12, double a20, double a21, double a22) { entry[0][0]=a00; entry[0][1]=a01; entry[0][2]=a02; entry[1][0]=a10; entry[1][1]=a11; entry[1][2]=a12; entry[2][0]=a20; entry[2][1]=a21; entry[2][2]=a22; } /*! Constructs a rotation matrix so that \a a is the first column, \a b is the second column and \a c is the third column. \note The vectors \a a, \a b and \a c must form an orthonormal system! */ rotmatrix (const vec3 &a, const vec3 &b, const vec3 &c); /*! Sets the matrix to the identity matrix. */ void SetToIdentity (); /*! Sets all matrix elements to zero. */ void SetToZero (); /*! Transposes the matrix. */ void Transpose (); /*! Extracts a unit-length rotation axis \a axis and a rotation angle \a angle (in radian) from the matrix. */ void toAxisAngle (vec3 &axis, double &angle) const; /*! Constructs a matrix which causes a rotation by \a angle radians around \a axis. \a axis must have unit length. */ void Make_Axis_Rotation_Transform (const vec3 &axis, double angle); /*! Creates a rotation matrix \a A, which performs the following operations on a vector \a v, when \a Av is calculated: -# rotate \a v around the z-axis by \a gamma, -# rotate \a v' around the y-axis by \a beta, -# rotate \a v'' around the z-axis by \a alpha. \note \a alpha, \a beta and \a gamma are given in radians, the rotations are right handed. \note This transformation rotates the \e vectors, not the coordinate axes! */ void Make_CPAC_Euler_Matrix (double alpha, double beta, double gamma); /*! Extracts the Euler angles \a alpha, \a beta and \a gamma from the matrix. For their definition see Make_CPAC_Euler_Matrix(). \note In case of ambiguity \a alpha will be 0. */ void Extract_CPAC_Euler_Angles (double &alpha, double &beta, double &gamma) const; /*! Returns the vector \a vec, transformed by the matrix. */ vec3 Transform (const vec3 &vec) const { return vec3 (vec.x*entry[0][0] + vec.y*entry[0][1] + vec.z*entry[0][2], vec.x*entry[1][0] + vec.y*entry[1][1] + vec.z*entry[1][2], vec.x*entry[2][0] + vec.y*entry[2][1] + vec.z*entry[2][2]); } /*! Returns the vector \a vec, transformed by the matrix, in \a vec2. */ void Transform (const vec3 &vec, vec3 &vec2) const { vec2.x = vec.x*entry[0][0] + vec.y*entry[0][1] + vec.z*entry[0][2]; vec2.y = vec.x*entry[1][0] + vec.y*entry[1][1] + vec.z*entry[1][2]; vec2.z = vec.x*entry[2][0] + vec.y*entry[2][1] + vec.z*entry[2][2]; } }; /*! Returns \a a * \a b. \relates rotmatrix */ rotmatrix operator* (const rotmatrix &a, const rotmatrix &b); /*! Returns \a a * \a b in \a res. \relates rotmatrix */ void matmult (const rotmatrix &a, const rotmatrix &b, rotmatrix &res); /*! Returns \a a^T * \a b in \a res. \relates rotmatrix */ void TransposeTimes (const rotmatrix &a, const rotmatrix &b, rotmatrix &res); /*! Writes \a mat to \a os. \relates rotmatrix */ std::ostream &operator<< (std::ostream &os, const rotmatrix &mat); /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/rotmatrix.cc0000650000175000017530000001305412255154051027205 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Class for rotation transforms in 3D space * * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include #include "rotmatrix.h" #include "lsconstants.h" using namespace std; rotmatrix::rotmatrix (const vec3 &a, const vec3 &b, const vec3 &c) { entry[0][0]=a.x; entry[0][1]=b.x; entry[0][2]=c.x; entry[1][0]=a.y; entry[1][1]=b.y; entry[1][2]=c.y; entry[2][0]=a.z; entry[2][1]=b.z; entry[2][2]=c.z; } void rotmatrix::SetToIdentity () { entry[0][0] = entry[1][1] = entry[2][2] = 1.; entry[0][1] = entry[1][0] = entry[0][2] = entry[2][0] = entry[1][2] = entry[2][1] = 0.; } void rotmatrix::SetToZero () { for (int m=0; m<3; ++m) entry[m][0] = entry[m][1] = entry[m][2] = 0; } void rotmatrix::Transpose () { swap(entry[0][1], entry[1][0]); swap(entry[0][2], entry[2][0]); swap(entry[1][2], entry[2][1]); } void rotmatrix::toAxisAngle (vec3 &axis, double &angle) const { double c2 = entry[0][0] + entry[1][1] + entry[2][2] - 1; axis.x = entry[2][1] - entry[1][2]; axis.y = entry[0][2] - entry[2][0]; axis.z = entry[1][0] - entry[0][1]; double s2 = axis.Length(); if (s2>0) { angle = atan2(s2,c2); axis *= 1/s2; return; } if (c2>=2) // angle is 0 { axis = vec3(1,0,0); angle = 0; return; } angle = pi; int choice = 0; // assume entry[0][0] is the largest if ((entry[1][1]>entry[0][0]) && (entry[1][1]>entry[2][2])) choice=1; if ((entry[2][2]>entry[0][0]) && (entry[2][2]>entry[1][1])) choice=2; if (choice==0) { axis.x = 0.5*sqrt(entry[0][0]-entry[1][1]-entry[2][2]+1); double half_inv = 0.5/axis.x; axis.y = half_inv*entry[0][1]; axis.z = half_inv*entry[0][2]; return; } if (choice==1) { axis.y = 0.5*sqrt(entry[1][1]-entry[0][0]-entry[2][2]+1); double half_inv = 0.5/axis.y; axis.x = half_inv*entry[0][1]; axis.z = half_inv*entry[1][2]; return; } axis.z = 0.5*sqrt(entry[2][2]-entry[0][0]-entry[1][1]+1); double half_inv = 0.5/axis.z; axis.x = half_inv*entry[0][2]; axis.y = half_inv*entry[1][2]; } void rotmatrix::Make_Axis_Rotation_Transform (const vec3 &axis, double angle) { double sa=sin(angle), ca=cos(angle); double ica=1-ca; entry[0][0] = axis.x*axis.x*ica + ca; entry[1][1] = axis.y*axis.y*ica + ca; entry[2][2] = axis.z*axis.z*ica + ca; double t1 = axis.x*axis.y*ica, t2 = axis.z*sa; entry[1][0] = t1 + t2; entry[0][1] = t1 - t2; t1 = axis.x*axis.z*ica; t2 = axis.y*sa; entry[2][0] = t1 - t2; entry[0][2] = t1 + t2; t1 = axis.y*axis.z*ica; t2 = axis.x*sa; entry[1][2] = t1 - t2; entry[2][1] = t1 + t2; } void rotmatrix::Make_CPAC_Euler_Matrix (double alpha, double beta, double gamma) { double ca=cos(alpha), cb=cos(beta), cg=cos(gamma); double sa=sin(alpha), sb=sin(beta), sg=sin(gamma); entry[0][0]= ca*cb*cg-sa*sg; entry[0][1]=-ca*cb*sg-sa*cg; entry[0][2]= ca*sb; entry[1][0]= sa*cb*cg+ca*sg; entry[1][1]=-sa*cb*sg+ca*cg; entry[1][2]= sa*sb; entry[2][0]=-sb*cg; entry[2][1]= sb*sg; entry[2][2]= cb; } void rotmatrix::Extract_CPAC_Euler_Angles (double &alpha, double &beta, double &gamma) const { double cb = entry[2][2]; double sb = sqrt(entry[0][2]*entry[0][2] + entry[1][2]*entry[1][2]); beta=atan2(sb,cb); if (abs(sb)<=1e-6) { alpha=0; if (cb>0) gamma=atan2(entry[1][0],entry[0][0]); else gamma=atan2(entry[0][1],-entry[0][0]); } else { alpha=atan2(entry[1][2],entry[0][2]); gamma=atan2(entry[2][1],-entry[2][0]); } } rotmatrix operator* (const rotmatrix &a, const rotmatrix &b) { rotmatrix res; for (int i=0; i<3; ++i) for (int j=0; j<3; ++j) res.entry[i][j] = a.entry[i][0] * b.entry[0][j] + a.entry[i][1] * b.entry[1][j] + a.entry[i][2] * b.entry[2][j]; return res; } void matmult (const rotmatrix &a, const rotmatrix &b, rotmatrix &res) { for (int i=0; i<3; ++i) for (int j=0; j<3; ++j) res.entry[i][j] = a.entry[i][0] * b.entry[0][j] + a.entry[i][1] * b.entry[1][j] + a.entry[i][2] * b.entry[2][j]; } void TransposeTimes (const rotmatrix &a, const rotmatrix &b, rotmatrix &res) { for (int i=0; i<3; ++i) for (int j=0; j<3; ++j) res.entry[i][j] = a.entry[0][i] * b.entry[0][j] + a.entry[1][i] * b.entry[1][j] + a.entry[2][i] * b.entry[2][j]; } ostream &operator<< (ostream &os, const rotmatrix &mat) { for (int i=0;i<3;++i) os << mat.entry[i][0] << ' ' << mat.entry[i][1] << ' ' << mat.entry[i][2] << endl; return os; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/geom_utils.cc0000650000175000017530000000440412255154051027322 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Copyright (C) 2011 Max-Planck-Society * \author Martin Reinecke */ #include "geom_utils.h" #include "arr.h" using namespace std; namespace { void get_circle (const arr &point, tsize q1, tsize q2, vec3 ¢er, double &cosrad) { center = (point[q1]+point[q2]).Norm(); cosrad = dotprod(point[q1],center); for (tsize i=0; i &point, tsize q, vec3 ¢er, double &cosrad) { center = (point[0]+point[q]).Norm(); cosrad = dotprod(point[0],center); for (tsize i=1; i &point, vec3 ¢er, double &cosrad) { tsize np=point.size(); planck_assert(np>=3,"too few points"); center = (point[0]+point[1]).Norm(); cosrad = dotprod(point[0],center); for (tsize i=2; i class safe_ptr { private: T *p; bool set; // forbid copying of safe_ptrs, at least until we know how to do it safe_ptr (const safe_ptr &) {} safe_ptr &operator= (const safe_ptr &) { return *this; } public: safe_ptr() : p(0), set(false) {} safe_ptr (T *p2) : p(p2), set(true) {} ~safe_ptr() { delete p; } void operator= (T *p2) { planck_assert (!set, "safe_ptr: already set"); set = true; p=p2; } void reset() { delete p; p=0; set=false; } operator T*() { return p; } operator const T*() const { return p; } T *operator->() { return p; } const T *operator->() const { return p; } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/paramfile.h0000650000175000017530000001006212255154051026752 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file paramfile.h * Class for parsing parameter files * * Copyright (C) 2003-2012 Max-Planck-Society * Authors: Martin Reinecke */ #ifndef PLANCK_PARAMFILE_H #define PLANCK_PARAMFILE_H #include #include #include #include "datatypes.h" #include "string_utils.h" /*! Class for storing and querying key/value pairs. The name is historical; the parameters can actually be obtained from othersources as well (e.g. the command line). */ class paramfile { private: typedef std::map params_type; params_type params; mutable std::set read_params; bool verbose; std::string get_valstr(const std::string &key) const; bool param_unread (const std::string &key) const; void findhelper (const std::string &key, const std::string &value, NDT type, bool deflt) const; void setParamString (const std::string &key, const std::string &value); public: paramfile () {} /*! Constructs a paramfile object from the contents of \a filename. If \a verbose_==true, diagnostic output is generated when calling methods on this object, otherwise not. */ paramfile (const std::string &filename, bool verbose_=true); /*! Constructs a paramfile object from the contents of \a par. If \a verbose_==true, diagnostic output is generated when calling methods on this object, otherwise not. */ paramfile (const params_type &par, bool verbose_=true); ~paramfile(); /*! Allows adjusting the verbosity. */ void setVerbosity (bool verbose_) { verbose = verbose_; } /*! Returns the verbosity setting of the object. */ bool getVerbosity () const { return verbose; } /*! Returns \c true, if a paremeter called \a key is stored in the object, else \c false. */ bool param_present(const std::string &key) const; /*! Returns the value stored for the parameter name \a key, after converting it to the requested type. If \a key is not present, an exception is thrown. */ template T find (const std::string &key) const; /*! Returns the value stored for the parameter name \a key, after converting it to the requested type. If \a key is not present, \a deflt is returned instead, and is also entered into the parameter set. */ template T find (const std::string &key, const T &deflt); /*! Returns the entire set of currently stored parameters. */ const params_type &getParams() const { return params; } /*! Sets the parameter with the name \a key to \a value. */ template void setParam (const std::string &key, const T &value) { setParamString(key,dataToString(value)); } }; /*! Tries to build a \a paramfile object from the contents of a command line. If \a argc==2 and \a argv[1] does not contain the character "=", the function tries to input parameters from the file \a argv[1]. Otherwise the function interprets each command line argument as a "key=value" statement. */ paramfile getParamsFromCmdline (int argc, const char **argv, bool verbose=true); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/lsconstants.h0000654000175000017530000000564612264023644027410 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file lsconstants.h * Mathematical, physical and technical constants for LevelS. */ #ifndef PLANCK_CONSTANTS_H #define PLANCK_CONSTANTS_H /*! \defgroup mathconstgroup Mathematical constants */ /*! \{ */ const double pi=3.141592653589793238462643383279502884197; const double twopi=6.283185307179586476925286766559005768394; const double inv_twopi=1.0/twopi; const double fourpi=12.56637061435917295385057353311801153679; const double halfpi=1.570796326794896619231321691639751442099; const double inv_halfpi=0.6366197723675813430755350534900574; const double inv_sqrt4pi = 0.2820947917738781434740397257803862929220; const double ln2 = 0.6931471805599453094172321214581766; const double inv_ln2 = 1.4426950408889634073599246810018921; const double ln10 = 2.3025850929940456840179914546843642; const double onethird=1.0/3.0; const double twothird=2.0/3.0; const double fourthird=4.0/3.0; const double degr2rad=pi/180.0; const double arcmin2rad=degr2rad/60; const double rad2degr=180.0/pi; //! Ratio between FWHM and sigma of a Gauss curve (\f$\sqrt{8\ln2}\f$). const double sigma2fwhm=2.3548200450309493; // sqrt(8*log(2.)) const double fwhm2sigma=1/sigma2fwhm; /*! \} */ /*! \defgroup physconstgroup Physical constants */ /*! \{ */ const double Jansky2SI=1.0e-26; const double SI2Jansky=1.0e+26; //! Light speed in m/s (CODATA 2006) const double speedOfLight=2.99792458e8; //! Boltzmann's constant in J/K (CODATA 2006) const double kBoltzmann=1.3806504e-23; //! Stefan-Boltzmann constant in W/m^2/K^4 (CODATA 2006) const double sigmaStefanBoltzmann=5.6704e-8; //! Planck's constant in J s (CODATA 2006) const double hPlanck=6.62606896e-34; //! Astronomical unit in m const double astronomicalUnit=1.49597870691e11; //! Solar constant in W/m^2 const double solarConstant=1368.0; //! Average CMB temperature in K (Fixsen, ApJ 709 (2009), arXiv:0911.1955) const double tcmb = 2.72548; //! offset (in seconds) between Jan 1, 1958 and Jan 1, 1970 const double sec_58_70 = 378691200.; /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/error_handling.cc0000650000175000017530000000334312255154051030151 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Utilities for error reporting * * Copyright (C) 2003-2011 Max-Planck-Society * Author: Martin Reinecke */ #include "error_handling.h" using namespace std; PlanckError::PlanckError(const string &message) : msg (message) {} PlanckError::PlanckError(const char *message) : msg (message) {} //virtual PlanckError::~PlanckError() {} void planck_failure__(const char *file, int line, const char *func, const string &msg) { cerr << "Error encountered at " << file << ", line " << line << endl; if (func) cerr << "(function " << func << ")" << endl; if (msg!="") cerr << endl << msg << endl; cerr << endl; } void planck_failure__(const char *file, int line, const char *func, const char *msg) { planck_failure__ (file,line,func,string(msg)); } void killjob__() { throw; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/planck.make0000650000175000017530000000111212255154051026744 0ustar zoncaplanck00000000000000PKG:=cxxsupport SD:=$(SRCROOT)/$(PKG) OD:=$(BLDROOT)/$(PKG) FULL_INCLUDE+= -I$(SD) HDR_$(PKG):=$(SD)/*.h LIB_$(PKG):=$(LIBDIR)/libcxxsupport.a SUPPORT_OBJ:= error_handling.o string_utils.o paramfile.o walltimer.o ls_image.o MATH_OBJ:= rotmatrix.o trafos.o wigner.o pointing.o geom_utils.o FITS_OBJ:= fitshandle.o OBJ:=$(SUPPORT_OBJ) $(MATH_OBJ) $(FITS_OBJ) announce.o OBJ:=$(OBJ:%=$(OD)/%) ODEP:=$(HDR_$(PKG)) $(HDR_libfftpack) $(HDR_c_utils) $(OBJ): $(ODEP) | $(OD)_mkdir $(LIB_$(PKG)): $(OBJ) $(OD)/ls_image.o: $(SD)/font_data.inc all_hdr+=$(HDR_$(PKG)) all_lib+=$(LIB_$(PKG)) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/bstream.h0000650000175000017530000001654612255154051026464 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file bstream.h * Classes for binary I/O with streams * * Copyright (C) 2010 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_BSTREAM_H #define PLANCK_BSTREAM_H #include #include #include #include "datatypes.h" /*! An object of this class can be cast to a \a bool, which indicates whether the computer architecture is big-endian (true) or little-endian (false). */ class EndianTest__ { private: bool big_end; public: EndianTest__() { union { uint16 i16; uint8 i8; } tmp; tmp.i16 = 1; big_end = (tmp.i8==0); } operator bool() const { return big_end; } }; const EndianTest__ big_endian; template inline void byteswap_helper__ (char *); template<> inline void byteswap_helper__<1> (char *) {} template<> inline void byteswap_helper__<2> (char *val) { using namespace std; swap (val[0],val[1]); } template<> inline void byteswap_helper__<4> (char *val) { using namespace std; swap (val[0],val[3]); swap (val[1],val[2]); } template<> inline void byteswap_helper__<8> (char *val) { using namespace std; swap (val[0],val[7]); swap (val[1],val[6]); swap (val[2],val[5]); swap (val[3],val[4]); } /*! Performs an endianness conversion on \a val. \note \a T must be a primitive data type! */ template inline void byteswap (T &val) { byteswap_helper__ (reinterpret_cast (&val)); } const bool file_is_lsb=big_endian, file_is_msb=!big_endian, file_is_natural=false; /*! Class for writing binary data to a stream. */ class bostream { private: std::ostream &s; bool doswap; public: /*! Creates a new object which is attached to \a s_ and performs endianness conversion if \a doswap_==true. */ bostream (std::ostream &s_, bool doswap_=false) : s(s_), doswap(doswap_) {} /*! Writes a binary representation of \a num objects of type \a T (stored in \a data) to the attached stream. Endianness conversion is performed if requested in the constructor. \note \a T must be a primitive data type! */ template bostream &put (const T *data, size_t num) { if ((sizeof(T)>1) && doswap) for (size_t m=0; m (&tmp), sizeof(T)); } else s.write (reinterpret_cast (data), num*sizeof(T)); return *this; } /*! Writes a binary representation of \a data to the attached stream. Endianness conversion is performed if requested in the constructor. \note \a T must be a primitive data type! */ template bostream &operator<< (const T &data) { put(&data,1); return *this; } bool getSwap() const { return doswap; } void setSwap(bool newswap) { doswap=newswap; } void flipSwap() { doswap=!doswap; } }; /*! Class for reading binary data from a stream. */ class bistream { private: std::istream &s; bool doswap; public: /*! Creates a new object which is attached to \a s_ and performs endianness conversion if \a doswap_==true. */ bistream (std::istream &s_, bool doswap_=false) : s(s_), doswap(doswap_) {} /*! Reads a binary representation of \a num objects of type \a T from the attached stream and stores them in \a data. Endianness conversion is performed if requested in the constructor. \note \a T must be a primitive data type! */ template bistream &get (T *data, size_t num) { s.read (reinterpret_cast (data), num*sizeof(T)); if ((sizeof(T)>1) && doswap) for (size_t m=0; m bistream &operator>> (T &data) { get (&data,1); return *this; } bool getSwap() const { return doswap; } void setSwap(bool newswap) { doswap=newswap; } void flipSwap() { doswap=!doswap; } }; class bofstream: public std::ofstream { private: bool doswap; public: /*! */ bofstream (const char *fname, bool doswap_) : std::ofstream(fname,std::ios::binary), doswap(doswap_) {} template bofstream &operator<< (const T &data) { if (doswap) { T tmp = data; byteswap (tmp); write (reinterpret_cast (&tmp), sizeof(T)); } else write (reinterpret_cast (&data), sizeof(T)); return *this; } template bofstream &put (const T *data, size_t num) { if (doswap) for (size_t m=0; m (&tmp), sizeof(T)); } else write (reinterpret_cast (data), num*sizeof(T)); return *this; } bool getSwap() const { return doswap; } void setSwap(bool newswap) { doswap=newswap; } void flipSwap() { doswap=!doswap; } }; class bifstream: public std::ifstream { private: bool doswap; public: /*! */ bifstream () : doswap(false) {} bifstream (const char *fname, bool doswap_) : std::ifstream(fname,std::ios::binary), doswap(doswap_) {} void open (const char *fname, bool doswap_) { doswap=doswap_; std::ifstream::open(fname,std::ios::binary); } template bifstream &operator>> (T &data) { read (reinterpret_cast (&data), sizeof(T)); if (doswap) byteswap (data); return *this; } template bifstream &get (T *data, size_t num) { read (reinterpret_cast (data), num*sizeof(T)); if (doswap) for (size_t m=0; m #include #include #include "alloc_utils.h" #include "datatypes.h" #include "math_utils.h" /*! \defgroup arraygroup Array classes */ /*! \{ */ /*! View of a 1D array */ template class arr_ref { protected: tsize s; T *d; public: /*! Constructs an \a arr_ref of size \a s_, starting at \a d_. */ arr_ref(T *d_, tsize s_) : s(s_),d(d_) {} /*! Returns the current array size. */ tsize size() const { return s; } /*! Writes \a val into every element of the array. */ void fill (const T &val) { for (tsize m=0; m T &operator[] (T2 n) {return d[n];} /*! Returns a constant reference to element \a n */ template const T &operator[] (T2 n) const {return d[n];} /*! Returns a pointer to the first array element, or NULL if the array is zero-sized. */ T *begin() { return d; } /*! Returns a pointer to the one-past-last array element, or NULL if the array is zero-sized. */ T *end() { return d+s; } /*! Returns a constant pointer to the first array element, or NULL if the array is zero-sized. */ const T *begin() const { return d; } /*! Returns a constant pointer to the one-past-last array element, or NULL if the array is zero-sized. */ const T *end() const { return d+s; } /*! Copies all array elements to \a ptr. */ template void copyToPtr (T *ptr) const { for (tsize m=0; m void sort(Comp comp) { std::sort (d,d+s,comp); } /*! Helper function for linear interpolation (or extrapolation). \a idx and \a val are computed such that \a val=d[idx]+frac*(d[idx+1]-d[idx]). If \a vald[s-1], frac will be larger than 1. In all other cases \a 0<=frac<=1. The array must be ordered in ascending order; no two values may be equal. */ void interpol_helper (const T &val, tsize &idx, double &frac) const { ::interpol_helper (d, d+s, val, idx, frac); } /*! Helper function for linear interpolation (or extrapolation). \a idx and \a val are computed such that \a val=d[idx]+frac*(d[idx+1]-d[idx]). If \a comp(val,d[0])==true, \a frac will be negative, if \a comp(val,d[s-1])==false, frac will be larger than 1. In all other cases \a 0<=frac<=1. The array must be ordered such that \a comp(d[i],d[j])==true for \a i void interpol_helper (const T &val, Comp comp, tsize &idx, double &frac) const { ::interpol_helper (d, d+s, val, comp, idx, frac); } /*! Returns the minimum and maximum entry in \a minv and \a maxv, respectively. Throws an exception if the array is zero-sized. */ void minmax (T &minv, T &maxv) const { planck_assert(s>0,"trying to find min and max of a zero-sized array"); minv=maxv=d[0]; for (tsize m=1; mmaxv) maxv=d[m]; } } /*! Returns \a true, if \a val is found in the array, else \a false. */ bool contains (const T &val) const { for (tsize m=0; m class fix_arr { private: T d[sz]; public: /*! Returns the size of the array. */ tsize size() const { return sz; } /*! Returns a reference to element \a n */ template T &operator[] (T2 n) {return d[n];} /*! Returns a constant reference to element \a n */ template const T &operator[] (T2 n) const {return d[n];} }; /*! One-dimensional array type, with selectable storage management. */ template class arrT: public arr_ref { private: storageManager stm; bool own; void reset() { this->d=0; this->s=0; own=true; } public: /*! Creates a zero-sized array. */ arrT() : arr_ref(0,0), own(true) {} /*! Creates an array with \a sz entries. */ explicit arrT(tsize sz) : arr_ref(stm.alloc(sz),sz), own(true) {} /*! Creates an array with \a sz entries, and initializes them with \a inival. */ arrT(tsize sz, const T &inival) : arr_ref(stm.alloc(sz),sz), own(true) { this->fill(inival); } /*! Creates an array with \a sz entries, which uses the memory pointed to by \a ptr. \note \a ptr will not be deallocated by the destructor. \warning Only use this if you REALLY know what you are doing. In particular, this is only safely usable if
    • \a T is a POD type
    • \a ptr survives during the lifetime of the array object
    • \a ptr is not subject to garbage collection
    Other restrictions may apply. You have been warned. */ arrT (T *ptr, tsize sz): arr_ref(ptr,sz), own(false) {} /*! Creates an array which is a copy of \a orig. The data in \a orig is duplicated. */ arrT (const arrT &orig): arr_ref(stm.alloc(orig.s),orig.s), own(true) { for (tsize m=0; ms; ++m) this->d[m] = orig.d[m]; } /*! Frees the memory allocated by the object. */ ~arrT() { if (own) stm.dealloc(this->d); } /*! Allocates space for \a sz elements. The content of the array is undefined on exit. \a sz can be 0. If \a sz is the same as the current size, no reallocation is performed. */ void alloc (tsize sz) { if (sz==this->s) return; if (own) stm.dealloc(this->d); this->s = sz; this->d = stm.alloc(sz); own = true; } /*! Allocates space for \a sz elements. If \a sz is the same as the current size, no reallocation is performed. All elements are set to \a inival. */ void allocAndFill (tsize sz, const T &inival) { alloc(sz); this->fill(inival); } /*! Deallocates the memory held by the array, and sets the array size to 0. */ void dealloc() {if (own) stm.dealloc(this->d); reset();} /*! Resizes the array to hold \a sz elements. The existing content of the array is copied over to the new array to the extent possible. \a sz can be 0. If \a sz is the same as the current size, no reallocation is performed. */ void resize (tsize sz) { using namespace std; if (sz==this->s) return; T *tmp = stm.alloc(sz); for (tsize m=0; ms); ++m) tmp[m]=this->d[m]; if (own) stm.dealloc(this->d); this->s = sz; this->d = tmp; own = true; } /*! Changes the array to be a copy of \a orig. */ arrT &operator= (const arrT &orig) { if (this==&orig) return *this; alloc (orig.s); for (tsize m=0; ms; ++m) this->d[m] = orig.d[m]; return *this; } /*! Changes the array to be a copy of the std::vector \a orig. */ template void copyFrom (const std::vector &orig) { alloc (orig.size()); for (tsize m=0; ms; ++m) this->d[m] = orig[m]; } /*! Changes the std::vector \a vec to be a copy of the object. */ template void copyTo (std::vector &vec) const { vec.clear(); vec.reserve(this->s); for (tsize m=0; ms; ++m) vec.push_back(this->d[m]); } /*! Reserves space for \a sz elements, then copies \a sz elements from \a ptr into the array. */ template void copyFromPtr (const T2 *ptr, tsize sz) { alloc(sz); for (tsize m=0; ms; ++m) this->d[m]=ptr[m]; } /*! Assigns the contents and size of \a other to the array. \note On exit, \a other is zero-sized! */ void transfer (arrT &other) { if (own) stm.dealloc(this->d); this->d=other.d; this->s=other.s; own=other.own; other.reset(); } /*! Swaps contents and size with \a other. */ void swap (arrT &other) { std::swap(this->d,other.d); std::swap(this->s,other.s); std::swap(own,other.own); } }; /*! One-dimensional array type. */ template class arr: public arrT > { public: /*! Creates a zero-sized array. */ arr() : arrT >() {} /*! Creates an array with \a sz entries. */ explicit arr(tsize sz) : arrT >(sz) {} /*! Creates an array with \a sz entries, and initializes them with \a inival. */ arr(tsize sz, const T &inival) : arrT >(sz,inival) {} /*! Creates an array with \a sz entries, which uses the memory pointed to by \a ptr. \note \a ptr will not be deallocated by the destructor. \warning Only use this if you REALLY know what you are doing. In particular, this is only safely usable if
    • \a T is a POD type
    • \a ptr survives during the lifetime of the array object
    • \a ptr is not subject to garbage collection
    Other restrictions may apply. You have been warned. */ arr (T *ptr, tsize sz): arrT >(ptr,sz) {} /*! Creates an array which is a copy of \a orig. The data in \a orig is duplicated. */ arr (const arr &orig): arrT >(orig) {} }; /*! One-dimensional array type, with selectable storage alignment. */ template class arr_align: public arrT > { public: /*! Creates a zero-sized array. */ arr_align() : arrT >() {} /*! Creates an array with \a sz entries. */ explicit arr_align(tsize sz) : arrT >(sz) {} /*! Creates an array with \a sz entries, and initializes them with \a inival. */ arr_align(tsize sz, const T &inival) : arrT >(sz,inival) {} }; /*! Two-dimensional array type, with selectable storage management. The storage ordering is the same as in C. An entry is located by address arithmetic, not by double dereferencing. The indices start at zero. */ template class arr2T { private: tsize s1, s2; arrT d; public: /*! Creates a zero-sized array. */ arr2T() : s1(0), s2(0) {} /*! Creates an array with the dimensions \a sz1 and \a sz2. */ arr2T(tsize sz1, tsize sz2) : s1(sz1), s2(sz2), d(s1*s2) {} /*! Creates an array with the dimensions \a sz1 and \a sz2 and initializes them with \a inival. */ arr2T(tsize sz1, tsize sz2, const T &inival) : s1(sz1), s2(sz2), d (s1*s2) { fill(inival); } /*! Creates the array as a copy of \a orig. */ arr2T(const arr2T &orig) : s1(orig.s1), s2(orig.s2), d(orig.d) {} /*! Frees the memory associated with the array. */ ~arr2T() {} /*! Returns the first array dimension. */ tsize size1() const { return s1; } /*! Returns the second array dimension. */ tsize size2() const { return s2; } /*! Returns the total array size, i.e. the product of both dimensions. */ tsize size () const { return s1*s2; } /*! Allocates space for an array with \a sz1*sz2 elements. The content of the array is undefined on exit. \a sz1 or \a sz2 can be 0. If \a sz1*sz2 is the same as the currently allocated space, no reallocation is performed. */ void alloc (tsize sz1, tsize sz2) { if (sz1*sz2 != d.size()) d.alloc(sz1*sz2); s1=sz1; s2=sz2; } /*! Allocates space for an array with \a sz1*sz2 elements. All elements are set to \a inival. \a sz1 or \a sz2 can be 0. If \a sz1*sz2 is the same as the currently allocated space, no reallocation is performed. */ void allocAndFill (tsize sz1, tsize sz2, const T &inival) { alloc(sz1,sz2); fill(inival); } /*! Allocates space for an array with \a sz1*sz2 elements. The content of the array is undefined on exit. \a sz1 or \a sz2 can be 0. If \a sz1*sz2 is smaller than the currently allocated space, no reallocation is performed. */ void fast_alloc (tsize sz1, tsize sz2) { if (sz1*sz2<=d.size()) { s1=sz1; s2=sz2; } else alloc(sz1,sz2); } /*! Deallocates the space and makes the array zero-sized. */ void dealloc () {d.dealloc(); s1=0; s2=0;} /*! Sets all array elements to \a val. */ void fill (const T &val) { for (tsize m=0; m T *operator[] (T2 n) {return &d[n*s2];} /*! Returns a constant pointer to the beginning of slice \a n. */ template const T *operator[] (T2 n) const {return &d[n*s2];} /*! Returns a reference to the element with the indices \a n1 and \a n2. */ template T &operator() (T2 n1, T3 n2) {return d[n1*s2 + n2];} /*! Returns a constant reference to the element with the indices \a n1 and \a n2. */ template const T &operator() (T2 n1, T3 n2) const {return d[n1*s2 + n2];} /*! Returns the minimum and maximum entry in \a minv and \a maxv, respectively. Throws an exception if the array is zero-sized. */ void minmax (T &minv, T &maxv) const { planck_assert(s1*s2>0, "trying to find min and max of a zero-sized array"); minv=maxv=d[0]; for (tsize m=1; mmaxv) maxv=d[m]; } } /*! Swaps contents and sizes with \a other. */ void swap (arr2T &other) { d.swap(other.d); std::swap(s1,other.s1); std::swap(s2,other.s2); } /*! Returns \c true if the array and \a other have the same dimensions, else \c false. */ template bool conformable (const arr2T &other) const { return (other.size1()==s1) && (other.size2()==s2); } }; /*! Two-dimensional array type. The storage ordering is the same as in C. An entry is located by address arithmetic, not by double dereferencing. The indices start at zero. */ template class arr2: public arr2T > { public: /*! Creates a zero-sized array. */ arr2() : arr2T > () {} /*! Creates an array with the dimensions \a sz1 and \a sz2. */ arr2(tsize sz1, tsize sz2) : arr2T > (sz1,sz2) {} /*! Creates an array with the dimensions \a sz1 and \a sz2 and initializes them with \a inival. */ arr2(tsize sz1, tsize sz2, const T &inival) : arr2T > (sz1,sz2,inival) {} }; /*! Two-dimensional array type, with selectable storage alignment. The storage ordering is the same as in C. An entry is located by address arithmetic, not by double dereferencing. The indices start at zero. */ template class arr2_align: public arr2T > { public: /*! Creates a zero-sized array. */ arr2_align() : arr2T > () {} /*! Creates an array with the dimensions \a sz1 and \a sz2. */ arr2_align(tsize sz1, tsize sz2) : arr2T > (sz1,sz2) {} /*! Creates an array with the dimensions \a sz1 and \a sz2 and initializes them with \a inival. */ arr2_align(tsize sz1, tsize sz2, const T &inival) : arr2T > (sz1,sz2,inival) {} }; /*! Two-dimensional array type. An entry is located by double dereferencing, i.e. via an array of pointers. The indices start at zero. */ template class arr2b { private: tsize s1, s2; arr d; arr d1; void fill_d1() { for (tsize m=0; m T *operator[] (T2 n) {return d1[n];} /*! Returns a constant pointer to the beginning of slice \a n. */ template const T *operator[] (T2 n) const {return d1[n];} /*! Returns a pointer to the beginning of the pointer array. */ T **p0() {return &d1[0];} }; /*! Three-dimensional array type. The storage ordering is the same as in C. An entry is located by address arithmetic, not by multiple dereferencing. The indices start at zero. */ template class arr3 { private: tsize s1, s2, s3, s2s3; arr d; public: /*! Creates a zero-sized array. */ arr3() : s1(0), s2(0), s3(0), s2s3(0), d(0) {} /*! Creates an array with the dimensions \a sz1, \a sz2 and \a sz3. */ arr3(tsize sz1, tsize sz2, tsize sz3) : s1(sz1), s2(sz2), s3(sz3), s2s3(s2*s3), d(s1*s2*s3) {} /*! Creates the array as a copy of \a orig. */ arr3(const arr3 &orig) : s1(orig.s1), s2(orig.s2), s3(orig.s3), s2s3(orig.s2s3), d(orig.d) {} /*! Frees the memory associated with the array. */ ~arr3() {} /*! Returns the first array dimension. */ tsize size1() const { return s1; } /*! Returns the second array dimension. */ tsize size2() const { return s2; } /*! Returns the third array dimension. */ tsize size3() const { return s3; } /*! Returns the total array size, i.e. the product of all dimensions. */ tsize size () const { return s1*s2*s3; } /*! Allocates space for an array with \a sz1*sz2*sz3 elements. The content of the array is undefined on exit. */ void alloc (tsize sz1, tsize sz2, tsize sz3) { d.alloc(sz1*sz2*sz3); s1=sz1; s2=sz2; s3=sz3; s2s3=s2*s3; } /*! Deallocates the space and makes the array zero-sized. */ void dealloc () {d.dealloc(); s1=0; s2=0; s3=0; s2s3=0;} /*! Sets all array elements to \a val. */ void fill (const T &val) { d.fill(val); } /*! Changes the array to be a copy of \a orig. */ arr3 &operator= (const arr3 &orig) { if (this==&orig) return *this; alloc (orig.s1, orig.s2, orig.s3); d = orig.d; return *this; } /*! Returns a reference to the element with the indices \a n1, \a n2 and \a n3. */ template T &operator() (T2 n1, T3 n2, T4 n3) {return d[n1*s2s3 + n2*s3 + n3];} /*! Returns a constant reference to the element with the indices \a n1, \a n2 and \a n3. */ template const T &operator() (T2 n1, T3 n2, T4 n3) const {return d[n1*s2s3 + n2*s3 + n3];} /*! Swaps contents and sizes with \a other. */ void swap (arr3 &other) { d.swap(other.d); std::swap(s1,other.s1); std::swap(s2,other.s2); std::swap(s3,other.s3); std::swap(s2s3,other.s2s3); } /*! Returns \c true if the array and \a other have the same dimensions, else \c false. */ template bool conformable (const arr3 &other) const { return (other.size1()==s1)&&(other.size2()==s2)&&(other.size3()==s3); } }; /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/alloc_utils.h0000650000175000017530000000502212255154051027324 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file alloc_utils.h * Classes providing raw memory allocation and deallocation support. * * Copyright (C) 2011-2013 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_ALLOC_UTILS_H #define PLANCK_ALLOC_UTILS_H #include #include "datatypes.h" template class normalAlloc__ { public: T *alloc(tsize sz) const { return (sz>0) ? new T[sz] : 0; } void dealloc (T *ptr) const { delete[] ptr; } }; template class alignAlloc__ { private: enum { max_nat_align = sizeof(void *) }; // C++11: alignof(std::max_align_t) public: T *alloc(tsize sz) const { using namespace std; if (sz==0) return 0; planck_assert((align&(align-1))==0,"alignment must be power of 2"); void *res; if (align<=max_nat_align) { res=malloc(sz*sizeof(T)); planck_assert(res!=0,"error in malloc()"); } else { tsize overhead=align-1+sizeof(void*); void *ptr=malloc(sz*sizeof(T)+overhead); planck_assert(ptr!=0,"error in malloc()"); tsize sptr=reinterpret_cast(ptr); sptr = (sptr+overhead) & ~(align-1); void **ptr2 = reinterpret_cast(sptr); ptr2[-1]=ptr; res=ptr2; } return static_cast(res); } void dealloc(T *ptr) const { using namespace std; if (align<=max_nat_align) free(ptr); else { if (ptr==0) return; void **ptr2 = reinterpret_cast(ptr); free (ptr2[-1]); } } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/fitshandle.h0000650000175000017530000002660112255154051027141 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file fitshandle.h * Declaration of the FITS I/O helper class used by LevelS * * Copyright (C) 2002-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_FITSHANDLE_H #define PLANCK_FITSHANDLE_H #include #include #include "arr.h" #include "datatypes.h" #include "safe_cast.h" /*! \defgroup fitsgroup FITS-related functionality */ /*! \{ */ /*! Class containing information about a single column in a FITS table. */ class fitscolumn { private: std::string name_, unit_; int64 repcount_; PDT type_; public: fitscolumn(); /*! Creates a \a fitscolumn with name \a nm, unit \a un, a repetition count of \a rc, and a Planck type of \a tp. */ fitscolumn (const std::string &nm, const std::string &un, int64 rc, PDT tp); ~fitscolumn(); /*! Returns the column name. */ const std::string &name() const {return name_;} /*! Returns the column unit string. */ const std::string &unit() const {return unit_;} /*! Returns the repetition count of the column. */ int64 repcount() const {return repcount_;} /*! Returns the Planck type of the column. */ PDT type() const {return type_;} }; /*! Class for performing I/O from/to FITS files. */ class fitshandle { private: enum { INVALID = -4711 }; mutable int status; void *fptr; int hdutype_, bitpix_; std::vector axes_; std::vector columns_; int64 nrows_; void check_errors() const; void clean_data(); void clean_all(); bool connected() const { return (hdutype_!=INVALID); } bool table_hdu (tsize col) const; bool image_hdu () const; void init_image(); void init_asciitab(); void init_bintab(); void init_data(); void read_col (int colnum, void *data, int64 ndata, PDT type, int64 offset) const; void write_col (int colnum, const void *data, int64 ndata, PDT type, int64 offset); void getKeyHelper(const std::string &name) const; public: /*! the list of modes in which a \a fitshandle can be opened. */ enum openmethod { CREATE, /*!< the file must not yet exist */ OPEN /*!< the file must already exist */ }; /*! \name File-level access and manipulation. */ /*! \{ */ /*! Creates an unconnected \a fitshandle. */ fitshandle (); /*! Performs all necessary cleanups. */ ~fitshandle(); /*! Connects to the file \a fname. */ void open (const std::string &fname); /*! Creates the file \a fname and connects to it. */ void create (const std::string &fname); /*! Closes the current file. */ void close () { clean_all(); } /*! Deletes the file with name \a name. */ static void delete_file (const std::string &name); /*! Returns the name of the connected file. */ std::string fileName() const; /*! Jumps to the HDU with the absolute number \a hdu. */ void goto_hdu (int hdu); /*! Returns the number of HDUs in the file. */ int num_hdus () const; /*! Asserts that the PDMTYPE of the current HDU is \a pdmtype. */ void assert_pdmtype (const std::string &pdmtype) const; /*! Inserts a binary table described by \a cols. The HDU has the name \a extname. */ void insert_bintab (const std::vector &cols, const std::string &extname="xtension"); /*! Inserts an ASCII table described by \a cols. The width of the columns is chosen automatically, in a way that avoids truncation. The HDU has the name \a extname. */ void insert_asctab (const std::vector &cols, const std::string &extname="xtension"); /*! Inserts a FITS image with the type given by \a type and dimensions given by \a Axes. */ void insert_image (PDT type, const std::vector &Axes); /*! Inserts a 2D FITS image with the type given by \a type, whose contents are given in \a data. */ template void insert_image (PDT type, const arr2 &data); /*! Computes the checksum for the current HDU and writes it into the header. */ void write_checksum(); /*! \} */ /*! \name Information about the current HDU */ /*! \{ */ /*! Returns the dimensions of the current image. */ const std::vector &axes() const; /*! Returns the name of column \a #i. */ const std::string &colname(int i) const; /*! Returns the unit of column \a #i. */ const std::string &colunit(int i) const; /*! Returns repetition count of column \a #i. */ int64 repcount(int i) const; /*! Returns the Planck type for column \a #i. */ PDT coltype(int i) const; /*! Returns the number of columns in the current table. */ int ncols() const; /*! Returns the number of rows in the current table. */ int64 nrows() const; /*! Returns the total number of elements (nrows*repcount) in column \a #i. */ int64 nelems(int i) const; /*! Returns the number of elements that should be read/written in a single call for optimum performance. This depends on the current HDU. */ int64 efficientChunkSize(int i) const; /*! \} */ /*! \name Keyword-handling methods */ /*! \{ */ /*! Returns a list of all user-defined keys in the current HDU in \a keys. */ void get_all_keys (std::vector &keys) const; void set_key_void (const std::string &key, const void *value, PDT type, const std::string &comment=""); /*! Updates \a key with \a value and \a comment. */ template void set_key (const std::string &name, const T &value, const std::string &comment="") { set_key_void (name, &value, planckType(), comment); } /*! Deletes \a key from the header. */ void delete_key (const std::string &name); /*! Adds \a comment as a comment line. */ void add_comment (const std::string &comment); void get_key_void (const std::string &key, void *value, PDT type) const; /*! Reads the value belonging to \a key and returns it in \a value. */ template void get_key (const std::string &name, T &value) const { get_key_void (name,&value,planckType()); } /*! Returms the value belonging to \a key. */ template T get_key (const std::string &name) const { T tmp; get_key(name, tmp); return tmp; } /*! Returns \a true if \a key is present, else \a false. */ bool key_present (const std::string &name) const; /*! \} */ /*! \name Methods for table data I/O */ /*! \{ */ void read_column_raw_void (int colnum, void *data, PDT type, int64 num, int64 offset=0) const; /*! Copies \a num elements from column \a colnum to the memory pointed to by \a data, starting at offset \a offset in the column. */ template void read_column_raw (int colnum, T *data, int64 num, int64 offset=0) const { read_column_raw_void (colnum, data, planckType(), num, offset); } /*! Fills \a data with elements from column \a colnum, starting at offset \a offset in the column. */ template void read_column (int colnum, arr &data, int64 offset=0) const { read_column_raw (colnum, &(data[0]), data.size(), offset); } /*! Reads the element \a #offset from column \a colnum into \a data. */ template void read_column (int colnum, T &data, int64 offset=0) const { read_column_raw (colnum, &data, 1, offset); } /*! Reads the whole column \a colnum into \a data (which is resized accordingly). */ template void read_entire_column (int colnum, arr &data) const { data.alloc(safe_cast(nelems(colnum))); read_column (colnum, data); } void write_column_raw_void (int colnum, const void *data, PDT type, int64 num, int64 offset=0); /*! Copies \a num elements from the memory pointed to by \a data to the column \a colnum, starting at offset \a offset in the column. */ template void write_column_raw (int colnum, const T *data, int64 num, int64 offset=0) { write_column_raw_void (colnum, data, planckType(), num, offset); } /*! Copies all elements from \a data to the column \a colnum, starting at offset \a offset in the column. */ template void write_column (int colnum, const arr &data, int64 offset=0) { write_column_raw (colnum, &(data[0]), data.size(), offset); } /*! Copies \a data to the column \a colnum, at the position \a offset. */ template void write_column (int colnum, const T &data, int64 offset=0) { write_column_raw (colnum, &data, 1, offset); } /*! \} */ /*! \name Methods for image data I/O */ /*! \{ */ /*! Reads the current image into \a data, which is resized accordingly. */ template void read_image (arr2 &data) const; /*! Reads the current image into \a data, which is resized accordingly. */ template void read_image (arr3 &data) const; /*! Reads a partial image, whose dimensions are given by the dimensions of \a data, into data. The starting pixel indices are given by \a xl and \a yl. */ template void read_subimage (arr2 &data, int xl, int yl) const; void read_subimage_void (void *data, PDT type, tsize ndata, int64 offset=0) const; /*! Fills \a data with values from the image, starting at the offset \a offset in the image. The image is treated as a one-dimensional array. */ template void read_subimage (arr &data, int64 offset=0) const { read_subimage_void (&data[0],planckType(),data.size(),offset); } void write_image2D_void (const void *data, PDT type, tsize s1, tsize s2); /*! Writes \a data into the current image. \a data must have the same dimensions as specified in the HDU. */ template void write_image (const arr2 &data) { write_image2D_void (&data[0][0],planckType(),data.size1(), data.size2()); } void write_subimage_void (const void *data, PDT type, tsize sz, int64 offset); /*! Copies \a data to the image, starting at the offset \a offset in the image. The image is treated as a one-dimensional array. */ template void write_subimage (const arr &data, int64 offset=0) { write_subimage_void(&data[0],planckType(),data.size(),offset); } /*! \} */ }; /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/datatypes.h0000654000175000017530000002555412264023644027033 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file datatypes.h * This file defines various platform-independent data types. * If any of the requested types is not available, compilation aborts * with an error (unfortunately a rather obscure one). * * Copyright (C) 2004-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_DATATYPES_H #define PLANCK_DATATYPES_H #include #include #include #include "xcomplex.h" #include "error_handling.h" // Template magic to select the proper data types. These templates // should not be used outside this file. template struct sizeChooserHelper__ { typedef void TYPE; }; template struct sizeChooserHelper__ { typedef T TYPE; }; template struct sizeChooserHelper2__ { typedef T1 TYPE; }; template struct sizeChooserHelper2__ { typedef T2 TYPE; }; template struct sizeChooserHelper2__ { typedef T3 TYPE; }; template <> struct sizeChooserHelper2__ { }; template struct sizeChooser__ { typedef typename sizeChooserHelper2__ ::TYPE, typename sizeChooserHelper__::TYPE, typename sizeChooserHelper__::TYPE >::TYPE TYPE; }; typedef signed char int8; typedef unsigned char uint8; typedef sizeChooser__<2, short, int>::TYPE int16; typedef sizeChooser__<2, unsigned short, unsigned int>::TYPE uint16; typedef sizeChooser__<4, int, long, short>::TYPE int32; typedef sizeChooser__<4, unsigned int, unsigned long, unsigned short>::TYPE uint32; typedef sizeChooser__<8, long, long long>::TYPE int64; typedef sizeChooser__<8, unsigned long, unsigned long long>::TYPE uint64; typedef sizeChooser__<4, float, double>::TYPE float32; typedef sizeChooser__<8, double, long double>::TYPE float64; /*! unsigned integer type which should be used for array sizes */ typedef std::size_t tsize; /*! signed integer type which should be used for relative array indices */ typedef std::ptrdiff_t tdiff; /*! mapping of Planck data types to integer constants */ enum PDT { PLANCK_INT8 = 0, PLANCK_UINT8 = 1, PLANCK_INT16 = 2, PLANCK_UINT16 = 3, PLANCK_INT32 = 4, PLANCK_UINT32 = 5, PLANCK_INT64 = 6, PLANCK_UINT64 = 7, PLANCK_FLOAT32 = 8, PLANCK_FLOAT64 = 9, PLANCK_BOOL = 10, PLANCK_STRING = 11, PLANCK_INVALID = -1 }; /*! Returns the \a PDT constant associated with \a T. */ template inline PDT planckType() { planck_fail(T::UNSUPPORTED_DATA_TYPE); } template<> inline PDT planckType () { return PLANCK_INT8; } template<> inline PDT planckType () { return PLANCK_UINT8; } template<> inline PDT planckType () { return PLANCK_INT16; } template<> inline PDT planckType () { return PLANCK_UINT16; } template<> inline PDT planckType () { return PLANCK_INT32; } template<> inline PDT planckType () { return PLANCK_UINT32; } template<> inline PDT planckType () { return PLANCK_INT64; } template<> inline PDT planckType () { return PLANCK_UINT64; } template<> inline PDT planckType () { return PLANCK_FLOAT32;} template<> inline PDT planckType () { return PLANCK_FLOAT64;} template<> inline PDT planckType () { return PLANCK_BOOL; } template<> inline PDT planckType() { return PLANCK_STRING; } /*! Returns the size (in bytes) of the Planck data type \a type. */ inline int type2size (PDT type) { switch (type) { case PLANCK_INT8 : case PLANCK_UINT8 : case PLANCK_BOOL : case PLANCK_STRING : return 1; case PLANCK_INT16 : case PLANCK_UINT16 : return 2; case PLANCK_INT32 : case PLANCK_UINT32 : case PLANCK_FLOAT32: return 4; case PLANCK_INT64 : case PLANCK_UINT64 : case PLANCK_FLOAT64: return 8; default: planck_fail ("type2size: unsupported data type"); } } /*! Converts the string \a type to a \a PDT. */ inline PDT string2type(const std::string &type) { if (type=="FLOAT64") return PLANCK_FLOAT64; if (type=="FLOAT32") return PLANCK_FLOAT32; if (type=="INT8") return PLANCK_INT8; if (type=="UINT8") return PLANCK_UINT8; if (type=="INT16") return PLANCK_INT16; if (type=="UINT16") return PLANCK_UINT16; if (type=="INT32") return PLANCK_INT32; if (type=="UINT32") return PLANCK_UINT32; if (type=="INT64") return PLANCK_INT64; if (type=="UINT64") return PLANCK_UINT64; if (type=="BOOL") return PLANCK_BOOL; if (type=="STRING") return PLANCK_STRING; planck_fail ("string2type: unknown data type '"+type+"'"); } /*! Converts the Planck data type \a type to a C string. */ inline const char *type2string (PDT type) { switch (type) { case PLANCK_INT8 : return "INT8"; case PLANCK_UINT8 : return "UINT8"; case PLANCK_INT16 : return "INT16"; case PLANCK_UINT16 : return "UINT16"; case PLANCK_INT32 : return "INT32"; case PLANCK_UINT32 : return "UINT32"; case PLANCK_INT64 : return "INT64"; case PLANCK_UINT64 : return "UINT64"; case PLANCK_FLOAT32: return "FLOAT32"; case PLANCK_FLOAT64: return "FLOAT64"; case PLANCK_BOOL : return "BOOL"; case PLANCK_STRING : return "STRING"; default: planck_fail ("type2string: unsupported data type"); } } /*! Returns a C string describing the data type \a T. */ template inline const char *type2typename () { planck_fail(T::UNSUPPORTED_DATA_TYPE); } template<> inline const char *type2typename () { return "signed char"; } template<> inline const char *type2typename () { return "unsigned char"; } template<> inline const char *type2typename () { return "short"; } template<> inline const char *type2typename () { return "unsigned short"; } template<> inline const char *type2typename () { return "int"; } template<> inline const char *type2typename () { return "unsigned int"; } template<> inline const char *type2typename () { return "long"; } template<> inline const char *type2typename () { return "unsigned long"; } template<> inline const char *type2typename () { return "long long"; } template<> inline const char *type2typename () { return "unsigned long long"; } template<> inline const char *type2typename () { return "float"; } template<> inline const char *type2typename () { return "double"; } template<> inline const char *type2typename () { return "long double"; } template<> inline const char *type2typename () { return "bool"; } template<> inline const char *type2typename () { return "std::string"; } /*! mapping of "native" data types to integer constants */ enum NDT { NAT_CHAR, NAT_SCHAR, NAT_UCHAR, NAT_SHORT, NAT_USHORT, NAT_INT, NAT_UINT, NAT_LONG, NAT_ULONG, NAT_LONGLONG, NAT_ULONGLONG, NAT_FLOAT, NAT_DOUBLE, NAT_LONGDOUBLE, NAT_FCMPLX, NAT_DCMPLX, NAT_BOOL, NAT_STRING }; /*! Returns the \a NDT constant associated with \a T. */ template inline NDT nativeType() { planck_fail(T::UNSUPPORTED_DATA_TYPE); } template<> inline NDT nativeType () { return NAT_CHAR; } template<> inline NDT nativeType () { return NAT_SCHAR; } template<> inline NDT nativeType () { return NAT_UCHAR; } template<> inline NDT nativeType () { return NAT_SHORT; } template<> inline NDT nativeType () { return NAT_USHORT; } template<> inline NDT nativeType () { return NAT_INT; } template<> inline NDT nativeType () { return NAT_UINT; } template<> inline NDT nativeType () { return NAT_LONG; } template<> inline NDT nativeType () { return NAT_ULONG; } template<> inline NDT nativeType () { return NAT_LONGLONG; } template<> inline NDT nativeType() { return NAT_ULONGLONG; } template<> inline NDT nativeType () { return NAT_FLOAT; } template<> inline NDT nativeType () { return NAT_DOUBLE; } template<> inline NDT nativeType () { return NAT_LONGDOUBLE;} template<> inline NDT nativeType >() { return NAT_FCMPLX; } template<> inline NDT nativeType >() { return NAT_DCMPLX; } template<> inline NDT nativeType >() { return NAT_FCMPLX; } template<> inline NDT nativeType >() { return NAT_DCMPLX; } template<> inline NDT nativeType () { return NAT_BOOL; } template<> inline NDT nativeType () { return NAT_STRING; } /*! Returns the size (in bytes) of the native data type \a type. */ inline int ndt2size (NDT type) { switch (type) { case NAT_CHAR : case NAT_SCHAR : case NAT_UCHAR : return sizeof(char); case NAT_SHORT : case NAT_USHORT : return sizeof(short); case NAT_INT : case NAT_UINT : return sizeof(int); case NAT_LONG : case NAT_ULONG : return sizeof(long); case NAT_LONGLONG : case NAT_ULONGLONG : return sizeof(long long); case NAT_FLOAT : return sizeof(float); case NAT_DOUBLE : return sizeof(double); case NAT_LONGDOUBLE: return sizeof(long double); case NAT_FCMPLX : return sizeof(std::complex); case NAT_DCMPLX : return sizeof(std::complex); case NAT_BOOL : return sizeof(bool); default: planck_fail ("ndt2size: unsupported data type"); } } #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/math_utils.h0000654000175000017530000001537612264023644027207 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file math_utils.h * Various convenience mathematical functions. * * Copyright (C) 2002-2013 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_MATH_UTILS_H #define PLANCK_MATH_UTILS_H #include #include #include "datatypes.h" /*! \defgroup mathutilsgroup Mathematical helper functions */ /*! \{ */ /*! Returns \e true if | \a a-b | <= \a epsilon * | \a b |, else \e false. */ template inline bool approx (F a, F b, F epsilon=1e-5) { using namespace std; return abs(a-b) <= (epsilon*abs(b)); } /*! Returns \e true if | \a a-b | <= \a epsilon, else \e false. */ template inline bool abs_approx (F a, F b, F epsilon=1e-5) { using namespace std; return abs(a-b) <= epsilon; } /*! Returns the largest integer which is smaller than (or equal to) \a arg. */ template inline I ifloor (F arg) { using namespace std; return I(floor(arg)); } /*! Returns the integer which is nearest to \a arg. */ template inline I nearest (F arg) { return ifloor(arg+0.5); } /*! Returns the remainder of the division \a v1/v2. The result is non-negative. \a v1 can be positive or negative; \a v2 must be positive. */ inline double fmodulo (double v1, double v2) { using namespace std; if (v1>=0) return (v1=0) ? ((v1 inline I imodulo (I v1, I v2) { I v=v1%v2; return (v>=0) ? v : v+v2; } /*! Returns -1 if \a signvalue is negative, else +1. */ template inline T sign (const T& signvalue) { return (signvalue>=0) ? 1 : -1; } /*! Returns \a val*pow(-1,m) */ template inline T xpow (I m, T val) { return (m&1) ? -val : val; } template struct isqrt_helper__ {}; template struct isqrt_helper__ { static uint32 isqrt (I arg) { using namespace std; return uint32 (sqrt(arg+0.5)); } }; template struct isqrt_helper__ { static uint32 isqrt (I arg) { using namespace std; I res = sqrt(double(arg)+0.5); if (arg<(int64(1)<<50)) return uint32(res); if (res*res>arg) --res; else if ((res+1)*(res+1)<=arg) ++res; return uint32(res); } }; /*! Returns the integer \a n, which fulfills \a n*n<=arg<(n+1)*(n+1). */ template inline uint32 isqrt (I arg) { return isqrt_helper__4)>::isqrt(arg); } /*! Returns the largest integer \a n that fulfills \a 2^n<=arg. */ template inline int ilog2 (I arg) { #ifdef __GNUC__ if (arg==0) return 0; if (sizeof(I)==sizeof(int)) return 8*sizeof(int)-1-__builtin_clz(arg); if (sizeof(I)==sizeof(long)) return 8*sizeof(long)-1-__builtin_clzl(arg); if (sizeof(I)==sizeof(long long)) return 8*sizeof(long long)-1-__builtin_clzll(arg); #endif int res=0; while (arg > 0x0000FFFF) { res+=16; arg>>=16; } if (arg > 0x000000FF) { res|=8; arg>>=8; } if (arg > 0x0000000F) { res|=4; arg>>=4; } if (arg > 0x00000003) { res|=2; arg>>=2; } if (arg > 0x00000001) { res|=1; } return res; } template inline int ilog2_nonnull (I arg) { #ifdef __GNUC__ if (sizeof(I)<=sizeof(int)) return 8*sizeof(int)-1-__builtin_clz(arg); if (sizeof(I)==sizeof(long)) return 8*sizeof(long)-1-__builtin_clzl(arg); if (sizeof(I)==sizeof(long long)) return 8*sizeof(long long)-1-__builtin_clzll(arg); #endif return ilog2 (arg); } /*! Returns the number of bits needed to encode a value in the range [0; \a arg] */ template int nbits(I arg) { if (arg<=1) return 0; return 1+ilog2(arg-1); } /*! Returns \a atan2(y,x) if \a x!=0 or \a y!=0; else returns 0. */ inline double safe_atan2 (double y, double x) { using namespace std; return ((x==0.) && (y==0.)) ? 0.0 : atan2(y,x); } /*! Helper function for linear interpolation (or extrapolation). The array must be ordered in ascending order; no two values may be equal. */ template inline void interpol_helper (const Iter &begin, const Iter &end, const T &val, Comp comp, tsize &idx, T &frac) { using namespace std; planck_assert((end-begin)>1,"sequence too small for interpolation"); idx = lower_bound(begin,end,val,comp)-begin; if (idx>0) --idx; idx = min(tsize(end-begin-2),idx); frac = (val-begin[idx])/(begin[idx+1]-begin[idx]); } /*! Helper function for linear interpolation (or extrapolation). The array must be ordered in ascending order; no two values may be equal. */ template inline void interpol_helper (const Iter &begin, const Iter &end, const T &val, tsize &idx, T &frac) { interpol_helper (begin,end,val,std::less(),idx,frac); } /*! \} */ template inline bool multiequal (const T &a, const T &b, const T &c) { return (a==b) && (a==c); } template inline bool multiequal (const T &a, const T &b, const T &c, const T &d) { return (a==b) && (a==c) && (a==d); } template inline bool multiequal (const T &a, const T &b, const T &c, const T &d, const T &e) { return (a==b) && (a==c) && (a==d) && (a==e); } template inline bool multiequal (const T &a, const T &b, const T &c, const T &d, const T &e, const T &f) { return (a==b) && (a==c) && (a==d) && (a==e) && (a==f); } template class kahan_adder { private: T sum, c; public: kahan_adder(): sum(0), c(0) {} void add (const T &val) { T y=val-c; T t=sum+y; c=(t-sum)-y; sum=t; } T result() const { return sum; } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/font_data.inc0000650000175000017530000011620712255154051027303 0ustar zoncaplanck00000000000000#ifndef PLANCK_FONT_DATA_INC #define PLANCK_FONT_DATA_INC const char *medium_bold_font_data= " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XX " " XXXX " "XXXXXX " " XXXX " " XX " " " " " " " " " " " " " "XX XX " "XX XX " " XX " "XX XX " "XX XX " " XX " "XX XX " "XX XX " " " " " " " "XX XX " "XX XX " "XXXXX " "XX XX " "XX XX " " " " XXXX " " XX " " XX " " XX " " XX " " " " " "XXXX " "XX " "XXX " "XX " "XX " " " " XXXX " " XX " " XXX " " XX " " XX " " " " " " XXX " "XX " "XX " "XX " " XXX " " " " XXX " " XX X " " XXX " " XX X " " XX X " " " " " "XX " "XX " "XX " "XX " "XXXX " " " " XXXX " " XX " " XXX " " XX " " XX " " " " " " " " XXXX " "XX XX " "XX XX " " XXXX " " " " " " " " " " " " " " " " " " " " XX " " XX " "XXXXXX " "XXXXXX " " XX " " XX " " " "XXXXXX " "XXXXXX " " " " " " " "XX XX " "XXX XX " "XXXXXX " "XX XXX " "XX XX " " " " XX " " XX " " XX " " XX " " XXXX " " " " " "XX XX " "XX XX " " X X " " XXXX " " XX " " " " XXXX " " XX " " XX " " XX " " XX " " " " XX " " XX " " XX " " XX " " XX " " XX " "XXXX " "XXXX " " " " " " " " " " " " " " " " " " " " " " " "XXXX " "XXXX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " " " XXXXX" " XXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXX" " XXXXX" " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXXX" "XXXXXXX" " XX " " XX " " XX " " XX " " XX " " " " " "XXXXXXX" "XXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXX" "XXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXX" "XXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXX" "XXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXX" "XXXXXXX" " " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXX" " XXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXX " "XXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXXX" "XXXXXXX" " " " " " " " " " " " " " " " " " " " " " " "XXXXXXX" "XXXXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " XX " " XX " " XX " "XX " " XX " " XX " " XX " "XXXXXX " "XXXXXX " " " " " " " " " "XX " " XX " " XX " " XX " " XX " " XX " "XX " "XXXXXX " "XXXXXX " " " " " " " " " " " " " " " "XXXXXX " " XX XX " " XX XX " " XX XX " "XXX XX " "XX XX " " " " " " " " " " X " " XX " "XXXXXX " "XXXXXX " " XX " "XXXXXX " "XXXXXX " "XX " "X " " " " " " " " " " XXX " " XX XX " " XX " " XX " "XXXX " " XX " " XX " " XX XX " "X XXX " " " " " " " " " " " " " " " " " " XX " " XX " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " " " XX " " XX " " " " " " " " " " XX XX " " XX XX " " XX XX " " " " " " " " " " " " " " " " " " " " " " X X " " X X " " XXXXX " " XXXXX " " X X " " XXXXX " " XXXXX " " X X " " X X " " " " " " " " " " XX " " XXXX " "X XX X " "X XX " " XXXX " " XX X " "X XX X " " XXXX " " XX " " " " " " " " " "XXX X " "X X XX " "XXX X " " XX " " XX " " XX " " X XXX " "XX X X " "X XXX " " " " " " " " " " XXX " "XX XX " "XX XX " "XX XX " " XXX " "XX X X " "XX XXX " "XX XX " " XXX X " " " " " " " " " " XXX " " XXX " " XX " " XX " " " " " " " " " " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " " " X X " " XX " "XXXXXX " "XXXXXX " " XX " " X X " " " " " " " " " " " " " " " " XX " " XX " "XXXXXX " "XXXXXX " " XX " " XX " " " " " " " " " " " " " " " " " " " " " " " " XXX " " XXX " " XX " " XX " " " " " " " " " " " " " " " "XXXXXX " "XXXXXX " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XX " " XXXX " " XX " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XX " "XX " " " " " " " " " " XX " " X X " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " " X X " " XX " " " " " " " " " " XX " " XXX " "X XX " " XX " " XX " " XX " " XX " " XX " "XXXXXX " " " " " " " " " " XXXX " "XX XX " "XX XX " " XX " " XXX " " XX " "XX " "XX " "XXXXXX " " " " " " " " " " XXXX " "XX XX " " XX " " XX " " XXX " " XX " " XX " "XX XX " " XXXX " " " " " " " " " " XX " " XXX " " XXXX " " XX XX " "XX XX " "XX XX " "XXXXXX " " XX " " XX " " " " " " " " " "XXXXXX " "XX " "XX " "XXXXX " "XX XX " " XX " " XX " "XX XX " " XXXX " " " " " " " " " " XXXX " "XX XX " "XX " "XX " "XXXXX " "XX XX " "XX XX " "XX XX " " XXXX " " " " " " " " " "XXXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " XXXX " "XX XX " "XX XX " "XX XX " " XXXX " "XX XX " "XX XX " "XX XX " " XXXX " " " " " " " " " " XXXX " "XX XX " "XX XX " "XX XX " " XXXXX " " XX " " XX " "XX XX " " XXXX " " " " " " " " " " " " " " XX " " XXXX " " XX " " " " " " XX " " XXXX " " XX " " " " " " " " " " " " XX " " XXXX " " XX " " " " XXX " " XXX " " XX " " XX " " " " " " " " XX " " XX " " XX " " XX " "XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " " "XXXXXX " "XXXXXX " " " "XXXXXX " "XXXXXX " " " " " " " " " " " " " "XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XX " " " " " " " " " " XXXX " "XX XX " "XX XX " " XX " " XXX " " XX " " " " XX " " XX " " " " " " " " " " XXXX " "X XX " "X XX " "X XXXX " "X X XX " "X XXXX " "X " "X XX " " XXXX " " " " " " " " " " XXXX " "XX XX " "XX XX " "XX XX " "XXXXXX " "XX XX " "XX XX " "XX XX " "XX XX " " " " " " " " " "XXXXX " "XX XX " "XX XX " "XX XX " "XXXXX " "XX XX " "XX XX " "XX XX " "XXXXX " " " " " " " " " " XXXX " "XX XX " "XX " "XX " "XX " "XX " "XX " "XX XX " " XXXX " " " " " " " " " "XXXXX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XXXXX " " " " " " " " " "XXXXXX " "XX " "XX " "XX " "XXXXX " "XX " "XX " "XX " "XXXXXX " " " " " " " " " "XXXXXX " "XX " "XX " "XX " "XXXXX " "XX " "XX " "XX " "XX " " " " " " " " " " XXXX " "XX XX " "XX " "XX " "XX XXX " "XX XX " "XX XX " "XX XX " " XXXXX " " " " " " " " " "XX XX " "XX XX " "XX XX " "XX XX " "XXXXXX " "XX XX " "XX XX " "XX XX " "XX XX " " " " " " " " " "XXXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXX " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XX XX " " XXXX " " " " " " " " " "XX X " "XX XX " "XX XX " "XXXX " "XXX " "XXXX " "XX XX " "XX XX " "XX X " " " " " " " " " "XX " "XX " "XX " "XX " "XX " "XX " "XX " "XX " "XXXXXX " " " " " " " " " "X X " "XX XX " "XXXXXX " "XXXXXX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " " " " " " " " " "XX XX " "XX XX " "XXX XX " "XXX XX " "XXXXXX " "XX XXX " "XX XXX " "XX XX " "XX XX " " " " " " " " " " XXXX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " " XXXX " " " " " " " " " "XXXXX " "XX XX " "XX XX " "XX XX " "XXXXX " "XX " "XX " "XX " "XX " " " " " " " " " " XXXX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XXX XX " "XX XXX " " XXXX " " XX " " " " " " " "XXXXX " "XX XX " "XX XX " "XX XX " "XXXXX " "XXXX " "XX XX " "XX XX " "XX X " " " " " " " " " " XXXX " "XX XX " "XX " "XX " " XXXX " " XX " " XX " "XX XX " " XXXX " " " " " " " " " "XXXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " " XXXX " " " " " " " " " "XX XX " "XX XX " "XX XX " " X X " " X X " " XXXX " " XX " " XX " " XX " " " " " " " " " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " "XXXXXX " "XXXXXX " "XX XX " "X X " " " " " " " " " "X X " "XX XX " " X X " " XXXX " " XX " " XXXX " " X X " "XX XX " "X X " " " " " " " " " "XX XX " "XX XX " " XXXX " " XXXX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " "XXXXXX " " XX " " XX " " XX " " XX " " XX " "XX " "XX " "XXXXXX " " " " " " " " " " XXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXX " " " " " " " " " "XX " "XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " XXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXX " " " " " " " " " " XX " " XXXX " "XX XX " "X X " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXX " "XXXXXX " " " " " " " " XXX " " XXX " " XX " " XX " " " " " " " " " " " " " " " " " " " " " " " " " " XXXX " " XX " " XXXXX " "XX XX " "XX XX " " XXXXX " " " " " " " " " "XX " "XX " "XX " "XXXXX " "XX XX " "XX XX " "XX XX " "XX XX " "XXXXX " " " " " " " " " " " " " " " " XXXX " "XX XX " "XX " "XX " "XX XX " " XXXX " " " " " " " " " " XX " " XX " " XX " " XXXXX " "XX XX " "XX XX " "XX XX " "XX XX " " XXXXX " " " " " " " " " " " " " " " " XXXX " "XX XX " "XXXXXX " "XX " "XX XX " " XXXX " " " " " " " " " " XXX " " XX XX " " XX " " XX " "XXXX " " XX " " XX " " XX " " XX " " " " " " " " " " " " " " " " XXX X " "XX XX " "XX XX " " XXXX " "XX " " XXXX " "XX XX " " XXXX " " " " " "XX " "XX " "XX " "XXXXX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " " " " " " " " " " XX " " XX " " " " XXX " " XX " " XX " " XX " " XX " "XXXXXX " " " " " " " " " " XX " " XX " " " " XX " " XX " " XX " " XX " " XX " " XX " "XX XX " " XXXX " " " " " "XX " "XX " "XX " "XX XX " "XX XX " "XXXX " "XXXX " "XX XX " "XX XX " " " " " " " " " " XXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXX " " " " " " " " " " " " " " " "XX XX " "XXXXXX " "XXXXXX " "XX XX " "XX XX " "XX XX " " " " " " " " " " " " " " " "XXXXX " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " " " " " " " " " " " " " " " " XXXX " "XX XX " "XX XX " "XX XX " "XX XX " " XXXX " " " " " " " " " " " " " " " "XXXXX " "XX XX " "XX XX " "XX XX " "XXXXX " "XX " "XX " "XX " " " " " " " " " " " " XXXXX " "XX XX " "XX XX " "XX XX " " XXXXX " " XX " " XX " " XX " " " " " " " " " " " "XXXXX " "XX XX " "XX " "XX " "XX " "XX " " " " " " " " " " " " " " " " XXXX " "XX XX " " XX " " XX " "XX XX " " XXXX " " " " " " " " " " " "XX " "XX " "XXXX " "XX " "XX " "XX " "XX XX " " XXXX " " " " " " " " " " " " " " " "XX XX " "XX XX " "XX XX " "XX XX " "XX XX " " XXXXX " " " " " " " " " " " " " " " "XX XX " "XX XX " "XX XX " " XXXX " " XXXX " " XX " " " " " " " " " " " " " " " "XX XX " "XX XX " "XX XX " "XXXXXX " "XXXXXX " " X X " " " " " " " " " " " " " " " "XX XX " "XX XX " " XXXX " " XXXX " "XX XX " "XX XX " " " " " " " " " " " " " " " "XX XX " "XX XX " "XX XX " "XX XX " " XXXXX " " XX " "XX XX " " XXXX " " " " " " " " " " " "XXXXXX " " XX " " XX " " XX " "XX " "XXXXXX " " " " " " " " " " XXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXX " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " XXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXX " " " " " " " " " " XX X " "XXXXXX " "X XX " " " " " " " " " " " " " " " " " " X X X " " X X " " X X X " " X X " " X X X " " X X " " X X X " " X X " " X X X " " X X " " X X X " " X X " " X X X " ; const char *giant_font_data = " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XX " " XXXX " " XXXXXX " " XXXXXXXX" " XXXXXX " " XXXX " " XX " " " " " " " " " " " " " " " " " " XX XX XX" " XX XX " " XX XX XX" " XX XX " " XX XX XX" " XX XX " " XX XX XX" " " " " " " " " " " " " " XX XX " " XX XX " " XXXXXX " " XX XX " " XX XX " " " " XXXXXX" " XX " " XX " " XX " " XX " " " " " " " " " " XXXXX " " XX " " XXXX " " XX " " XX " " " " XXXXX" " XX " " XXXX " " XX " " XX " " " " " " " " " " XXXXX " " XX X " " XX " " XX X " " XXXXX " " " " XXXXX " " XX XX" " XXXXX " " XX XX" " XX XX" " " " " " " " " " XX " " XX " " XX " " XX " " XXXXX " " " " XXXXX" " XX " " XXXX " " XX " " XX " " " " " " " " " " " " " " XXXX " " XX XX " " XX XX " " XXXX " " " " " " " " " " " " " " " " " " XX " " XX " " XX " " XXXXXXXX" " XXXXXXXX" " XX " " XX " " XX " " " " XXXXXXXX" " XXXXXXXX" " " " " " " " " " " " XX XX " " XXX XX " " XXXXXX " " XX XXX " " XX XX " " " " XX " " XX " " XX " " XX " " XXXXX" " " " " " " " " " XX XX " " XX XX " " XX XX " " XXXX " " XX " " " " XXXXXX" " XX " " XX " " XX " " XX " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXX " "XXXXXX " " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXX " "XXXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " " " " " XXXXX" " XXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXX" " XXXXX" " " " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXXXXX" "XXXXXXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " "XXXXXXXXX" "XXXXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXXXX" "XXXXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXXXX" "XXXXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXXXX" "XXXXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXXXX" "XXXXXXXXX" " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXX" " XXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXX " "XXXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " "XXXXXXXXX" "XXXXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXXXX" "XXXXXXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " XXX" " XXX " " XXX " " XX " " XXX " " XXX " " XXX" " " " XXXXXXXX" " XXXXXXXX" " " " " " " " " " " " XXX " " XXX " " XXX " " XX" " XXX " " XXX " " XXX " " " " XXXXXXXX" " XXXXXXXX" " " " " " " " " " " " " " " " XXXXXXXX" " XXXXXXXX" " X XX " " X XX " " X XX " " XXX XX " " XXX XX " " " " " " " " " " " " " " XX" " XX " " XXXXXXXX" " XXXXXXXX" " XX " " XXXXXXXX" " XXXXXXXX" " XX " " XX " " " " " " " " " " " " " " XXXX " " XX XX" " XX " " XX " " XXXXXX " " XX " " XX " " XXXXX " " X XXXXXX" " XXX " " " " " " " " " " " " " " " " " " " " XX " " XX " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " XX " " " " " " " " " " " " XX XX " " XX XX " " XX XX " " " " " " " " " " " " " " " " " " " " " " " " " " " " XX XX " " XX XX " " XXXXXXX " " XX XX " " XX XX " " XXXXXXX " " XX XX " " XX XX " " " " " " " " " " " " " " X " " XXXXX " " XX X XX" " XX X " " XXXX " " XXXXX " " XXXX" " X XX" " XX X XX" " XXXXX " " X " " " " " " " " " " XX XX" " XXXX XX " " XXXX XX " " XX XX " " XX " " XX " " XX XX " " XX XXXX" " XX XXXX" " XX XX " " " " " " " " " " " " XXXX " " XX XX " " XX XX " " XX XX " " XXXX " " XX XX " " XX XXXX" " XX XX " " XX XXX " " XXXX XX" " " " " " " " " " " " XXXX " " XXX " " XX " " " " " " " " " " " " " " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " X " " XX X XX " " XXXXX " " XXX " " XXX XXX " " XXX " " XXXXX " " XX X XX " " X " " " " " " " " " " " " " " " " XX " " XX " " XX " " XXXXXXXX" " XX " " XX " " XX " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XXXX " " XXX " " XX " " " " " " " " " " " " " " " " " " " " XXXXXXXX" " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XX " " XXXX " " XX " " " " " " " " " " XX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XXXX " " XX XX " " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX " " XXXX " " " " " " " " " " " " XX " " XXX " " XXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXXX " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX" " XX " " XX " " XXX " " XX " " XX " " XXXXXXXX" " " " " " " " " " " " XXXXXXXX" " XX" " XX " " XX " " XXXX " " XX" " XX" " XX" " XX XX" " XXXXXX " " " " " " " " " " " " XX " " XXX " " XXXX " " XX XX " " XX XX " " XX XX " " XXXXXXXX" " XX " " XX " " XX " " " " " " " " " " " " XXXXXXXX" " XX " " XX " " XXXXXXX " " XXX XX" " XX" " XX" " XX" " XX XX" " XXXXXX " " " " " " " " " " " " XXXXX " " XX " " XX " " XX " " XXXXXXX " " XXX XX" " XX XX" " XX XX" " XX XX" " XXXXXX " " " " " " " " " " " " XXXXXXXX" " XX" " XX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX XX" " XXXXXX " " XX XX" " XX XX" " XX XX" " XX XX" " XXXXXX " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX XX" " XX XXX" " XXXXXXX" " XX" " XX" " XX " " XXXXX " " " " " " " " " " " " " " " " " " XX " " XXXX " " XX " " " " " " XX " " XXXX " " XX " " " " " " " " " " " " " " " " XX " " XXXX " " XX " " " " " " XXXX " " XXX " " XX " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " " " " " " " " " XXXXXXXX" " " " " " XXXXXXXX" " " " " " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX" " XX " " XX " " XX " " XX " " " " XX " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX XXXXX" " XXXX XX" " XXXX XXX" " XX XXXXX" " XX " " XX " " XXXXXX " " " " " " " " " " " " XX " " XXXX " " XX XX " " XX XX" " XX XX" " XX XX" " XXXXXXXX" " XX XX" " XX XX" " XX XX" " " " " " " " " " " " XXXXXXX " " XX XX" " XX XX" " XX XX" " XXXXXX " " XX XX" " XX XX" " XX XX" " XX XX" " XXXXXXX " " " " " " " " " " " " XXXXXX " " XX XX" " XX " " XX " " XX " " XX " " XX " " XX " " XX XX" " XXXXXX " " " " " " " " " " " " XXXXXXX " " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XXXXXXX " " " " " " " " " " " " XXXXXXXX" " XX " " XX " " XX " " XXXXX " " XX " " XX " " XX " " XX " " XXXXXXXX" " " " " " " " " " " " XXXXXXXX" " XX " " XX " " XX " " XXXXX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XXXXXX " " XX XX" " XX " " XX " " XX " " XX XXXX" " XX XX" " XX XX" " XX XX" " XXXXXX " " " " " " " " " " " " XX XX" " XX XX" " XX XX" " XX XX" " XXXXXXXX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " " " " " " " " " " " XXXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXXX " " " " " " " " " " " " XXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX XX " " XXXXX " " " " " " " " " " " " XX XX" " XX XX " " XX XX " " XX XX " " XXXX " " XXXX " " XX XX " " XX XX " " XX XX " " XX XX" " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXXXXX" " " " " " " " " " " " XX XX" " XX XX" " XXX XXX" " XXXXXXXX" " XXXXXXXX" " XX XX XX" " XX XX XX" " XX XX" " XX XX" " XX XX" " " " " " " " " " " " XX XX" " XX XX" " XXX XX" " XXXX XX" " XX XX XX" " XX XXXX" " XX XXX" " XX XX" " XX XX" " XX XX" " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XXXXXX " " " " " " " " " " " " XXXXXXX " " XX XX" " XX XX" " XX XX" " XXXXXXX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX XX" " XX XXXX" " XXXXXX " " XX" " " " " " " " " " XXXXXXX " " XX XX" " XX XX" " XX XX" " XXXXXXX " " XX XX " " XX XX " " XX XX " " XX XX" " XX XX" " " " " " " " " " " " XXXXXX " " XX XX" " XX " " XX " " XXXXXX " " XX" " XX" " XX" " XX XX" " XXXXXX " " " " " " " " " " " " XXXXXXXX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XXXXXX " " " " " " " " " " " " XX XX" " XX XX" " XX XX" " XX XX " " XX XX " " XX XX " " XXXX " " XXXX " " XXXX " " XX " " " " " " " " " " " " XX XX" " XX XX" " XX XX" " XX XX" " XX XX XX" " XX XX XX" " XX XX XX" " XX XX XX" " XXXXXXXX" " XX XX " " " " " " " " " " " " XX XX" " XX XX" " XX XX " " XXXX " " XX " " XX " " XXXX " " XX XX " " XX XX" " XX XX" " " " " " " " " " " " XX XX" " XX XX" " XX XX " " XXXX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XXXXXXXX" " XX" " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXXXXX" " " " " " " " " " " " XXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXX " " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX" " " " " " " " " " " " XXXXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXX " " " " " " " " " " " " XX " " XXXX " " XX XX " " XX XX" " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " "XXXXXXXXX" " " " " " " " " " XXXX " " XXX " " XX " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " XXXXXX " " XX" " XX" " XXXXXXX" " XX XX" " XX XXX" " XXXXXXX" " " " " " " " " " " " XX " " XX " " XX " " XXXXXXX " " XXX XX" " XX XX" " XX XX" " XX XX" " XXX XX" " XXXXXXX " " " " " " " " " " " " " " " " " " XXXXXX " " XX XX" " XX " " XX " " XX " " XX XX" " XXXXXX " " " " " " " " " " " " XX" " XX" " XX" " XXXXXXX" " XX XXX" " XX XX" " XX XX" " XX XX" " XX XXX" " XXXXXXX" " " " " " " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XXXXXXXX" " XX " " XX " " XXXXXX " " " " " " " " " " " " XXXX " " XX XX" " XX XX" " XX " " XX " " XXXXXX " " XX " " XX " " XX " " XX " " " " " " " " " " " " " " " " " " XXXXXXX" " XX XX " " XX XX " " XX XX " " XXXXX " " XX " " XXXXXX " " XX XX" " XX XX" " XXXXXX " " " " " " XX " " XX " " XX " " XXXXXXX " " XXX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " " " " " " " " " " " " " XX " " " " XXX " " XX " " XX " " XX " " XX " " XX " " XXXXXX " " " " " " " " " " " " " " XX " " " " XXXX " " XX " " XX " " XX " " XX " " XX " " XX XX " " XX XX " " XX XX " " XXXXX " " " " " " XX " " XX " " XX " " XX XX" " XX XXX " " XXXXX " " XXX " " XXXXX " " XX XXX " " XX XX" " " " " " " " " " " " XXX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XXXXXX " " " " " " " " " " " " " " " " " " XXXXXXX " " XX XX XX" " XX XX XX" " XX XX XX" " XX XX XX" " XX XX XX" " XX XX" " " " " " " " " " " " " " " " " " XXXXXXX " " XXX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " " " " " " " " " " " " " " " " " XXXXXX " " XX XX" " XX XX" " XX XX" " XX XX" " XX XX" " XXXXXX " " " " " " " " " " " " " " " " " " XXXXXXX " " XXX XX" " XX XX" " XX XX" " XX XX" " XXX XX" " XXXXXXX " " XX " " XX " " XX " " " " " " " " " " " " XXXXXXX" " XX XXX" " XX XX" " XX XX" " XX XX" " XX XXX" " XXXXXXX" " XX" " XX" " XX" " " " " " " " " " " " XX XXXX " " XXX XX" " XX XX" " XX " " XX " " XX " " XX " " " " " " " " " " " " " " " " " " XXXXXX " " XX XX" " XX " " XXXXXX " " XX" " XX XX" " XXXXXX " " " " " " " " " " " " " " XX " " XX " " XXXXXXX " " XX " " XX " " XX " " XX " " XX XX" " XXXX " " " " " " " " " " " " " " " " " " XX XX " " XX XX " " XX XX " " XX XX " " XX XX " " XX XX " " XXXXXXX" " " " " " " " " " " " " " " " " " XX XX" " XX XX" " XX XX " " XX XX " " XXXX " " XXXX " " XX " " " " " " " " " " " " " " " " " " XX XX" " XX XX" " XX XX XX" " XX XX XX" " XX XX XX" " XXXXXXXX" " XX XX " " " " " " " " " " " " " " " " " " XX XX" " XX XX " " XXXX " " XX " " XXXX " " XX XX " " XX XX" " " " " " " " " " " " " " " " " " XX XX " " XX XX " " XX XX " " XX XX " " XX XX " " XX XXX " " XXXXXX " " XX " " XX XX " " XXXXX " " " " " " " " " " " " XXXXXXXX" " XX " " XX " " XX " " XX " " XX " " XXXXXXXX" " " " " " " " " " " " XXXX" " XX " " XX " " XX " " XXX " " XXX " " XX " " XX " " XX " " XXXX" " " " " " " " " " " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " XX " " " " " " " " " " " " XXXX " " XX " " XX " " XX " " XXX " " XXX " " XX " " XX " " XX " " XXXX " " " " " " " " " " " " XXX XX" " XX XX XX" " XX XXX " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " " ; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/vec3.h0000650000175000017530000001132112255154051025651 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file vec3.h * Class representing 3D cartesian vectors * * Copyright (C) 2003, 2006 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_VEC3_H #define PLANCK_VEC3_H #include #include #include "datatypes.h" /*! \defgroup vec3group 3D vectors */ /*! \{ */ /*! Class representing a 3D cartesian vector. */ templateclass vec3_t { public: T x, /*!< x-coordinate */ y, /*!< y-coordinate */ z; /*!< z-coordinate */ /*! Default constructor. Does not initialize \a x, \a y, and \a z. */ vec3_t () {} /*! Creates a vector with the coordinates \a xc, \a yc, and \a zc. */ vec3_t (T xc, T yc, T zc) : x(xc), y(yc), z(zc) {} template explicit vec3_t (const vec3_t &orig) : x(orig.x), y(orig.y), z(orig.z) {} /*! Sets the vector components to \a xc, \a yc, and \a zc. */ void Set (T xc, T yc, T zc) { x=xc; y=yc; z=zc; } /*! Creates a unit vector from a z coordinate and an azimuthal angle. */ void set_z_phi (T z_, T phi) { using namespace std; T sintheta = sqrt((T(1)-z_)*(T(1)+z_)); x = sintheta*cos(phi); y = sintheta*sin(phi); z = z_; } /*! Normalizes the vector to length 1. */ void Normalize () { using namespace std; T l = T(1)/sqrt (x*x + y*y + z*z); x*=l; y*=l; z*=l; } vec3_t Norm() const { vec3_t res(*this); res.Normalize(); return res; } /*! Returns the length of the vector. */ T Length () const { return sqrt (x*x + y*y + z*z); } /*! Returns the squared length of the vector. */ T SquaredLength () const { return (x*x + y*y + z*z); } /*! Returns the vector with the signs of all coordinates flipped. */ const vec3_t operator- () const { return vec3_t (-x, -y, -z); } /*! Flips the signs of all coordinates. */ void Flip () { x=-x; y=-y; z=-z; } /*! Returns (\a *this + \a vec). */ const vec3_t operator+ (const vec3_t &vec) const { return vec3_t (x+vec.x, y+vec.y, z+vec.z); } /*! Adds \a vec to \a *this. */ vec3_t &operator+= (const vec3_t &vec) { x+=vec.x; y+=vec.y; z+=vec.z; return *this; } /*! Returns (\a *this - \a vec). */ const vec3_t operator- (const vec3_t &vec) const { return vec3_t (x-vec.x, y-vec.y, z-vec.z); } /*! Subtracts \a vec from \a *this. */ vec3_t &operator-= (const vec3_t &vec) { x-=vec.x; y-=vec.y; z-=vec.z; return *this; } /*! Returns the vector scaled by \a fact. */ const vec3_t operator* (T fact) const { return vec3_t (x*fact, y*fact, z*fact); } /*! Returns the vector scaled by \a 1/fact. */ const vec3_t operator/ (T fact) const { T xfact = T(1)/fact; return vec3_t (x*xfact, y*xfact, z*xfact); } /*! Scales the vector by \a fact. */ vec3_t &operator*= (T fact) { x*=fact; y*=fact; z*=fact; return *this; } }; /*! Returns the dot product of \a v1 and \a v2. \relates vec3_t */ template inline T dotprod(const vec3_t &v1, const vec3_t &v2) { return v1.x*v2.x + v1.y*v2.y + v1.z*v2.z; } /*! Returns the cross product of \a a and \a b. \relates vec3_t */ template inline vec3_t crossprod (const vec3_t &a, const vec3_t &b) { return vec3_t(a.y*b.z - a.z*b.y, a.z*b.x - a.x*b.z, a.x*b.y - a.y*b.x); } /*! Writes \a v to \a os. \relates vec3_t */ template inline std::ostream &operator<< (std::ostream &os, const vec3_t &v) { os << v.x << ", " << v.y << ", " << v.z << std::endl; return os; } /*! Specialisation of vec3_t for 64-bit floating point components */ typedef vec3_t vec3; /*! Specialisation of vec3_t for 32-bit floating point components */ typedef vec3_t vec3f; /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/planck_rng.h0000650000175000017530000001014512255154051027132 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file planck_rng.h * This file contains the random number generator * used by the Planck LevelS package. * The generator is a C++ port of the xorshift generator xor128() described * in Marsaglia, Journal of Statistical Software 2003, vol 8. * It has a period of 2^128 - 1. * * Copyright (C) 2003, 2004, 2005 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_RNG_H #define PLANCK_RNG_H #include #include "error_handling.h" /*! C++ port of the xorshift generator xor128() described in Marsaglia, Journal of Statistical Software 2003, vol 8. It has a period of 2^128 - 1. */ class planck_rng { private: unsigned int x,y,z,w; double small, gset; bool empty; void twiddle (unsigned int &v) { for (int i=0; i<9; ++i) { v ^= v<<13; v ^= v>>17; v ^= v<<5; } } void init_rng () { // avoid zero seeds if (x==0) x = 123456789; if (y==0) y = 362436069; if (z==0) z = 521288629; if (w==0) w = 88675123; // shuffle the bits of the seeds twiddle(x); twiddle(y); twiddle(z); twiddle(w); // burn in the RNG for (int i=0; i<16; ++i) int_rand_uni(); } public: /*! Initializes the generator with 0 to 4 seed values. */ planck_rng (unsigned int x1=123456789, unsigned int y1=362436069, unsigned int z1=521288629, unsigned int w1=88675123) : x(x1), y(y1), z(z1), w(w1), small(1./(1.+double(0xFFFFFFFF))), gset(0.), empty(true) { planck_assert (sizeof(unsigned int)==4, "wrong integer size for RNG"); init_rng(); } /*! Re-initializes the generator with 0 to 4 seed values. */ void seed (unsigned int x1=123456789, unsigned int y1=362436069, unsigned int z1=521288629, unsigned int w1=88675123) { x = x1; y = y1; z = z1; w = w1; empty = true; init_rng(); } /*! Returns uniformly distributed random integer numbers from the interval [0;0xFFFFFFFF]. */ unsigned int int_rand_uni() { unsigned int t = x^(x<<11); x = y; y = z; z = w; return w=(w^(w>>19))^(t^(t>>8)); } //! Returns uniformly distributed random numbers from the interval [0;1[. double rand_uni() { return small*int_rand_uni(); } //! Returns random numbers with Gaussian distribution (mean=0, sigma=1). /*! Uses rand_uni() internally. */ double rand_gauss() { using namespace std; if (empty) { double v1,v2,rsq; do { v1=2*rand_uni()-1.; v2=2*rand_uni()-1.; rsq=v1*v1+v2*v2; } while ((rsq>=1) || (rsq==0)); double fac=sqrt(-2*log(rsq)/rsq); gset=v1*fac; empty=false; return v2*fac; } else { empty=true; return gset; } } //! Returns exponentially distributed random numbers (mean=1, nonnegative) /*! Uses rand_uni() internally. */ double rand_exp() { using namespace std; double val=rand_uni(); if (val==0.) val=1.; return -log(val); } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/levels_facilities.h0000650000175000017530000000123712255154051030504 0ustar zoncaplanck00000000000000#ifndef LEVELS_FACILITIES_H #define LEVELS_FACILITIES_H int syn_alm_cxx_module (int argc, const char **argv); int alm2map_cxx_module (int argc, const char **argv); int anafast_cxx_module (int argc, const char **argv); int calc_powspec_module (int argc, const char **argv); int hotspots_cxx_module (int argc, const char **argv); int map2tga_module (int argc, const char **argv); int median_filter_cxx_module (int argc, const char **argv); int mult_alm_module (int argc, const char **argv); int smoothing_cxx_module (int argc, const char **argv); int udgrade_cxx_module (int argc, const char **argv); int udgrade_harmonic_cxx_module (int argc, const char **argv); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/pointing.h0000650000175000017530000000511712255154051026646 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file pointing.h * Class representing a direction in 3D space * * Copyright (C) 2003-2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_POINTING_H #define PLANCK_POINTING_H #include #include "vec3.h" /*! \defgroup pointinggroup Pointings */ /*! \{ */ /*! Class representing a direction in 3D space or a location on the unit sphere. All angles in radians. */ class pointing { public: /*! Colatitude of the pointing (i.e. the North pole is at \a theta=0). */ double theta; /*! Longitude of the pointing. */ double phi; /*! Default constructor. \a theta and \a phi are not initialized. */ pointing() {} /*! Creates a pointing with \a Theta and \a Phi. */ pointing (double Theta, double Phi) : theta(Theta), phi(Phi) {} // FIXME: should become "explicit" some time /*! Creates a pointing from the vector \a inp. \a inp need not be normalized. */ pointing (const vec3 &inp) { from_vec3(inp); } // FIXME: should be removed some time /*! Returns a normalized vector pointing in the same direction. */ operator vec3() const { return to_vec3(); } /*! Returns a normalized vector pointing in the same direction. */ vec3 to_vec3() const; /*! Converts \a inp to \a ptg. \a inp need not be normalized. */ void from_vec3 (const vec3 &inp); /*! Changes the angles so that \a 0<=theta<=pi. */ void normalize_theta(); /*! Changes the angles so that \a 0<=theta<=pi and \a 0<=phi<2*pi. */ void normalize(); }; /*! Writes \a p to \a os. \relates pointing */ std::ostream &operator<< (std::ostream &os, const pointing &p); /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/wigner.h0000650000175000017530000001353612255154051026316 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file wigner.h * Several C++ classes for calculating Wigner matrices * * Copyright (C) 2009-2011 Max-Planck-Society * \author Martin Reinecke and others (see individual classes) */ #ifndef PLANCK_WIGNER_H #define PLANCK_WIGNER_H #include #include "arr.h" #include "sse_utils_cxx.h" /*! Class for calculation of the Wigner matrix at pi/2, using Risbo recursion in a way that cannot easily be parallelised, but is fairly efficient on scalar machines. */ class wigner_d_halfpi_risbo_scalar { private: double pq; arr sqt; arr2 d; int n; void do_line0 (double *l1, int j); void do_line (const double *l1, double *l2, int j, int k); public: wigner_d_halfpi_risbo_scalar(int lmax); const arr2 &recurse (); }; /*! Class for calculation of the Wigner matrix at arbitrary angles, using Risbo recursion in a way that cannot easily be parallelised, but is fairly efficient on scalar machines. */ class wigner_d_risbo_scalar { private: double p,q; arr sqt; arr2 d; int n; void do_line0 (double *l1, int j); void do_line (const double *l1, double *l2, int j, int k); public: wigner_d_risbo_scalar(int lmax, double ang); const arr2 &recurse (); }; /*! Class for calculation of the Wigner matrix at pi/2, using Risbo recursion in a way that can be OpenMP-parallelised. This approach uses more memory and is slightly slower than wigner_d_halfpi_risbo_scalar. */ class wigner_d_halfpi_risbo_openmp { private: double pq; arr sqt; arr2 d,dd; int n; public: wigner_d_halfpi_risbo_openmp(int lmax); const arr2 &recurse (); }; /*! Class for calculation of the Wigner matrix at arbitrary angles, using Risbo recursion in a way that can be OpenMP-parallelised. This approach uses more memory and is slightly slower than wigner_d_risbo_scalar. */ class wigner_d_risbo_openmp { private: double p,q; arr sqt; arr2 d, dd; int n; public: wigner_d_risbo_openmp(int lmax, double ang); const arr2 &recurse (); }; /*! Class for calculation of the Wigner matrix elements by l-recursion. For details, see Prezeau & Reinecke 2010, http://arxiv.org/pdf/1002.1050 */ class wignergen_scalar { protected: typedef double dbl3[3]; // members set in the constructor and kept fixed afterwards double fsmall, fbig, eps; int lmax; arr logsum, lc05, ls05; arr flm1, flm2, cf, costh, xl; arr thetaflip; // members depending on m and m' int m1, m2, am1, am2, mlo, mhi, cosPow, sinPow; long double prefactor; arr fx; bool preMinus; // members depending on theta arr result; enum { large_exponent2=90, minscale=-4, maxscale=14 }; public: /*! Constructs an object that can compute Wigner matrix elements up to a maximum \a l value of \a lmax_, at the colatitudes provided in \a thetas. The generator will be allowed to regard values with absolute magnitudes smaller than \a epsilon as zero; a typical value is 1e-30. */ wignergen_scalar (int lmax_, const arr &thetas, double epsilon); /*! Prepares the object to produce Wigner matrix elements with \a m=m1_ and \a m'=m2_ in subsequent calls to calc(). This operation is not cheap so it is recommended to use calc() for many different colatitudes after every call to prepare(), if possible. */ void prepare (int m1_, int m2_); /*! Computes the Wigner matrix elements for the values of \a m and \a m' set by the preceding call to prepare(), for all \a l up to \a lmax (set in the constructor), and for the \a nth colatitude passed to the constructor. On return, \a firstl contains the index of the first matrix element larger than \a epsilon; all values with smaller indices in the result array are undefined. */ const arr &calc (int nth, int &firstl); void calc (int nth, int &firstl, arr &resx) const; }; class wignergen: public wignergen_scalar { #ifdef __SSE2__ private: arr_align result2; public: wignergen (int lmax_, const arr &thetas, double epsilon) : wignergen_scalar (lmax_,thetas,epsilon), result2(lmax_+1) {} using wignergen_scalar::calc; const arr_align &calc (int nth1, int nth2, int &firstl); void calc (int nth1, int nth2, int &firstl, arr_align &resx) const; #else public: wignergen (int lmax_, const arr &thetas, double epsilon) : wignergen_scalar (lmax_,thetas,epsilon) {} #endif }; class wigner_estimator { private: int lmax, m1, m2, mbig; double xlmax, epsPow, cosm1m2; public: wigner_estimator (int lmax_, double epsPow_); void prepare_m (int m1_, int m2_); bool canSkip (double theta) const; }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/xcomplex.h0000650000175000017530000001661012255154051026656 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file xcomplex.h * Class for representing complex numbers, strongly inspired by C++'s * std::complex * * Copyright (C) 2003-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_XCOMPLEX_H #define PLANCK_XCOMPLEX_H #include #include /*! \defgroup complexgroup Complex number support */ /*! \{ */ /*! A class for representing complex numbers. This template is intended as an (under-encapsulated) replacement for the (over-encapsulated) std::complex<>. The goal is to include the whole functionality of std::complex<>, with some additional methods that allow higher performance. The (known and intentional) differences between xcomplex<> and std::complex<> are: - the default constructor of xcomplex<> does nothing, in contrast to std::complex<>, which initialises its members to zero. - xcomplex<> implements the methods real() and imag() according to defect report DR387 */ template class xcomplex { public: T re, /*!< real part */ im; /*!< imaginary part */ /*! Default constructor. \a re and \a im are not initialised. */ xcomplex () {} /*! Creates the complex number (\a re_, \a im_). */ xcomplex (const T &re_, const T &im_) : re(re_), im(im_) {} /*! Creates the complex number (\a re_, 0). */ xcomplex (const T &re_) : re(re_), im(0) {} /*! Creates an xcomplex from a std::complex of identical precision. */ xcomplex (const std::complex &orig) : re(orig.real()), im(orig.imag()) {} /*! Creates a complex number as a copy of \a orig. */ template explicit xcomplex (const xcomplex &orig) : re(T(orig.re)), im(T(orig.im)) {} /*! Conversion operator to std::complex */ operator std::complex () const { return std::complex(re,im); } /*! Returns the real part as lvalue. */ T &real() { return re; } /*! Returns the real part. */ const T &real() const { return re; } /*! Returns the imaginary part as lvalue. */ T &imag() { return im; } /*! Returns the imaginary part. */ const T &imag() const { return im; } /*! Sets the number to (\a re_, \a im_). */ void Set (const T &re_, const T &im_) { re = re_; im = im_; } /*! Sets the number to \a orig. */ xcomplex &operator= (const xcomplex &orig) { re=orig.re; im=orig.im; return *this; } /*! Sets the number to \a orig. */ xcomplex &operator= (const std::complex &orig) { re=orig.real(); im=orig.imag(); return *this; } /*! Sets the number to (\a orig, 0). */ xcomplex &operator= (const T &orig) { re=orig; im=0; return *this; } /*! Adds \a b to \a *this. */ xcomplex &operator+= (const xcomplex &b) { re+=b.re; im+=b.im; return *this; } /*! Subtracts \a b from \a *this. */ xcomplex &operator-= (const xcomplex &b) { re-=b.re; im-=b.im; return *this; } /*! Multiplies \a *this by \a b. */ xcomplex &operator*= (const xcomplex &b) { T tr=re*b.re-im*b.im, ti=re*b.im+im*b.re; re=tr; im=ti; return *this; } /*! Divides \a *this by \a b. */ xcomplex &operator/= (const xcomplex &b) { std::complex tmp=*this; tmp /= std::complex(b); *this=tmp; return *this; } /*! Multiplies \a *this by \a fact. */ xcomplex &operator*= (const T &fact) { re*=fact; im*=fact; return *this; } /*! Divides \a *this by \a div. */ xcomplex &operator/= (const T &div) { re/=div; im/=div; return *this; } /*! Returns \a *this * \a fact. */ xcomplex operator* (const T &fact) const { return xcomplex (re*fact,im*fact); } /*! Returns \a *this * \a b. */ xcomplex operator* (const xcomplex &b) const { return xcomplex (re*b.re-im*b.im, re*b.im+im*b.re); } /*! Returns \a *this / \a b. */ xcomplex operator/ (const xcomplex &b) const { return xcomplex(std::complex(*this)/std::complex(b)); } /*! Returns \a *this / \a div. */ xcomplex operator/ (const T &div) const { return xcomplex (re/div,im/div); } /*! Returns \a *this + \a b. */ xcomplex operator+ (const xcomplex &b) const { return xcomplex (re+b.re, im+b.im); } /*! Returns \a *this - \a b. */ xcomplex operator- (const xcomplex &b) const { return xcomplex (re-b.re, im-b.im); } /*! Returns \a -(*this) */ xcomplex operator- () const { return xcomplex (-re,-im); } /*! Flips the signs of both components. */ void Negate() { re=-re; im=-im; } /*! Flips the signs of the imaginary component. */ void Conjugate() { im=-im; } /*! Multiplies the number by exp(i*\a angle) */ void Rotate(T angle) { T ca=cos(angle), sa=sin(angle); T tmp=re; re=tmp*ca-im*sa; im=tmp*sa+im*ca; } /*! Returns the complex conjugate of \a *this. */ xcomplex conj() const { return xcomplex (re,-im); } /*! Returns \a *this*i. */ xcomplex times_i() const { return xcomplex (-im,re); } /*! Returns the norm of \a *this. */ T norm() const { return re*re + im*im; } }; /*! Returns the complex conjugate of \a num. \relates xcomplex */ template inline xcomplex conj (const xcomplex &num) { return xcomplex (num.re, -num.im); } /*! Returns the norm of \a num. \relates xcomplex */ template inline T norm (const xcomplex &num) { return num.re*num.re + num.im*num.im; } /*! Returns the absolute value of \a num. \relates xcomplex */ template inline T abs (const xcomplex &num) { using namespace std; return abs(complex(num)); } /*! Returns the exponential of \a num. \relates xcomplex */ template inline xcomplex exp (const xcomplex &num) { using namespace std; return xcomplex(exp(complex(num))); } /*! Returns \a f1*f2. \relates xcomplex */ template inline xcomplex operator* (const T &f1, const xcomplex &f2) { return xcomplex (f1*f2.re, f1*f2.im); } /*! Returns \a f1/f2. \relates xcomplex */ template inline xcomplex operator/ (const T &f1, const xcomplex &f2) { return xcomplex(f1)/f2; } /*! Writes \a val to \a os. \relates xcomplex */ template inline std::ostream &operator<< (std::ostream &os, const xcomplex &val) { os << "(" << val.re << "," << val.im << ")"; return os; } typedef xcomplex dcomplex; typedef xcomplex fcomplex; /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/share_utils.h0000650000175000017530000000533012255154051027336 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file share_utils.h * Various convenience functions for subdividing tasks into chunks * * Copyright (C) 2002-2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SHARE_UTILS_H #define PLANCK_SHARE_UTILS_H #include "datatypes.h" /*! Divides the index range [\a glo; \a ghi) into \a nshares approximately equal parts, and returns the sub-range [\a lo; \a hi) of the part with the number \a myshare (first part has index 0). */ inline void calcShareGeneral (int64 glo, int64 ghi, int64 nshares, int64 myshare, int64 &lo, int64 &hi) { int64 nwork = ghi-glo; int64 nbase = nwork/nshares; int64 additional = nwork%nshares; lo = glo+myshare*nbase + ((myshare=s_full) return false; start=offset; size=min(s_chunk,s_full-offset); offset+=s_chunk; return true; } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/ls_image.cc0000650000175000017530000001440512255154051026735 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Classes for creation and output of image files * * Copyright (C) 2003-2012 Max-Planck-Society * Author: Martin Reinecke */ #include #include #include "ls_image.h" #include "bstream.h" #include "font_data.inc" #include "string_utils.h" #include "share_utils.h" using namespace std; const MP_Font medium_bold_font = { 0, 128, 7, 13, medium_bold_font_data }; const MP_Font giant_font = { 0, 128, 9, 15, giant_font_data }; void Palette::setPredefined (int num) { fv.clear(); cv.clear(); switch(num) { case 0: add(0,Colour(0,0,0)); add(1,Colour(1,1,1)); break; case 1: add(0,Colour(0,0,0)); add(0.4f,Colour(0,0,0.5f)); add(0.75f,Colour(0,0.6f,1)); add(1,Colour(1,1,1)); break; case 4: add(0,Colour(0,0,.5f)); add(0.15f,Colour(0,0,1)); add(0.4f,Colour(0,1,1)); add(0.7f,Colour(1,1,0)); add(0.9f,Colour(1,.33f,0)); add(1,Colour(.5f,0,0)); break; default: planck_fail("Palette #"+dataToString(num)+" not yet supported."); } } void LS_Image::write_char (int xpos, int ypos, const Colour &col, char c, int scale) { planck_assert ((c>=font.offset) && (c &px, tsize begin, tsize end, bostream &file) { chunkMaker cm (end-begin,128); uint64 cbeg, csz; while (cm.getNext(cbeg,csz)) { file << uint8(csz-1+128); file << px[begin].b << px[begin].g << px[begin].r; } } void write_unequal_range (const arr &px, tsize begin, tsize end, bostream &file) { chunkMaker cm (end-begin,128); uint64 cbeg, csz; while (cm.getNext(cbeg,csz)) { file << uint8(csz-1); for (tsize cnt=begin+cbeg; cnt< begin+cbeg+csz; ++cnt) file << px[cnt].b << px[cnt].g << px[cnt].r; } } } // unnamed namespace void LS_Image::write_TGA_rle(const string &file) const { ofstream out(file.c_str(), ios_base::out | ios_base::binary); planck_assert(out, "could not create file '" + file + "'"); tsize xres=pixel.size1(), yres=pixel.size2(); bostream bo(out); const uint8 header[18] = { 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, uint8(xres%256), uint8(xres/256), uint8(yres%256), uint8(yres/256), 24, 32}; bo.put(header,18); for (tsize y=0; y px(xres); for (tsize x=0; x *data) { complex_plan_forward(plan,&(data->re)); } void backward (xcomplex *data) { complex_plan_backward(plan,&(data->re)); } void forward (arr >&data) { forward(&(data[0].re)); } void backward (arr >&data) { backward(&(data[0].re)); } }; class rfft { private: tsize n; real_plan plan; public: rfft () : n(0), plan(0) {} rfft (const rfft &orig) : n(orig.n), plan(copy_real_plan(orig.plan)) {} rfft (tsize size_) : n(size_), plan(make_real_plan(size_)) {} ~rfft () { if (plan!=0) kill_real_plan (plan); } rfft &operator=(const rfft &orig) { if (n!=orig.n) { if (plan!=0) kill_real_plan (plan); n=orig.n; plan = copy_real_plan(orig.plan); } return *this; } void Set (tsize size_) { if (n==size_) return; if (plan!=0) kill_real_plan (plan); n=size_; plan=make_real_plan(size_); } tsize size() const { return n; } void forward_fftpack (double *data) { real_plan_forward_fftpack(plan,data); } void backward_fftpack (double *data) { real_plan_backward_fftpack(plan,data); } void forward_fftpack (arr &data) { forward_fftpack(&(data[0])); } void backward_fftpack (arr &data) { backward_fftpack(&(data[0])); } void forward_c (arr >&data) { real_plan_forward_c(plan,&(data[0].re)); } void backward_c (arr >&data) { real_plan_backward_c(plan,&(data[0].re)); } }; #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/paramfile.cc0000654000175000017530000001332512264023644027124 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Class for parsing parameter files * * Copyright (C) 2003-2011 Max-Planck-Society * Authors: Martin Reinecke, Reinhard Hell */ #include #include "paramfile.h" #include "string_utils.h" using namespace std; string paramfile::get_valstr(const string &key) const { params_type::const_iterator loc=params.find(key); if (loc!=params.end()) return loc->second; planck_fail ("Cannot find the key '" + key + "'."); } bool paramfile::param_unread (const string &key) const { return (read_params.find(key)==read_params.end()); } paramfile::paramfile (const string &filename, bool verbose_) : verbose(verbose_) { parse_file (filename, params); } paramfile::paramfile (const params_type &par, bool verbose_) : params (par), verbose(verbose_) {} paramfile::~paramfile() { if (verbose) for (params_type::const_iterator loc=params.begin(); loc!=params.end(); ++loc) if (param_unread(loc->first)) cout << "Parser warning: unused parameter '" << loc->first << "'" << endl; } bool paramfile::param_present(const string &key) const { return (params.find(key)!=params.end()); } void paramfile::findhelper (const string &key, const string &value, NDT type, bool deflt) const { string output = value; if (type==NAT_STRING) output = "'"+output+"'"; if (verbose && param_unread(key)) cout << "Parser: " << key << " = " << output << (deflt ? " " : "") << endl; read_params.insert(key); } template T paramfile::find (const string &key) const { T result = stringToData(get_valstr(key)); findhelper (key, dataToString(result), nativeType(), false); return result; } template unsigned char paramfile::find (const string &key) const; template signed char paramfile::find (const string &key) const; template unsigned short paramfile::find (const string &key) const; template short paramfile::find (const string &key) const; template unsigned int paramfile::find (const string &key) const; template int paramfile::find (const string &key) const; template unsigned long paramfile::find (const string &key) const; template long paramfile::find (const string &key) const; template unsigned long long paramfile::find (const string &key) const; template long long paramfile::find (const string &key) const; template float paramfile::find (const string &key) const; template double paramfile::find (const string &key) const; template long double paramfile::find (const string &key) const; template bool paramfile::find (const string &key) const; template string paramfile::find (const string &key) const; template T paramfile::find (const string &key, const T &deflt) { if (param_present(key)) return find(key); string sdeflt=dataToString(deflt); findhelper (key, sdeflt, nativeType(), true); params[key]=sdeflt; return deflt; } template unsigned char paramfile::find (const string &key, const unsigned char &deflt); template signed char paramfile::find (const string &key, const signed char &deflt); template unsigned short paramfile::find (const string &key, const unsigned short &deflt); template short paramfile::find (const string &key, const short &deflt); template unsigned int paramfile::find (const string &key, const unsigned int &deflt); template int paramfile::find (const string &key, const int &deflt); template unsigned long paramfile::find (const string &key, const unsigned long &deflt); template long paramfile::find (const string &key, const long &deflt); template unsigned long long paramfile::find (const string &key, const unsigned long long &deflt); template long long paramfile::find (const string &key, const long long &deflt); template float paramfile::find (const string &key, const float &deflt); template double paramfile::find (const string &key, const double &deflt); template long double paramfile::find (const string &key, const long double &deflt); template bool paramfile::find (const string &key, const bool &deflt); template string paramfile::find (const string &key, const string &deflt); void paramfile::setParamString (const string &key, const string &value) { if (param_present(key)) { if (params[key]!=value) { if (verbose) cout << "Parser: altering value of key '"<=2,"incorrect command line format"); if ((argc==2) && (string(argv[1]).find("=")==string::npos)) return paramfile(argv[1],verbose); map pmap; parse_cmdline_equalsign(argc,argv,pmap); return paramfile(pmap,verbose); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/rangeset.h0000654000175000017530000002266212271533767026654 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file rangeset.h * Class for storing sets of ranges of integer numbers * * Copyright (C) 2011-2013 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_RANGESET_H #define PLANCK_RANGESET_H #include #include #include #include #include "datatypes.h" #include "error_handling.h" /*! Class for storing sets of ranges of integer numbers */ template class rangeset { private: typedef std::vector rtype; typedef typename rtype::iterator iterator; typedef typename rtype::const_iterator c_iterator; rtype r; /*! Returns the index of the last number in \c r which is <= \a val. If \a val is smaller than all numbers in \c r, returns -1. */ tdiff iiv (const T &val) const { return tdiff(std::upper_bound(r.begin(),r.end(),val)-r.begin())-1; } void addRemove (T a, T b, tdiff v) { tdiff pos1=iiv(a), pos2=iiv(b); if ((pos1>=0) && (r[pos1]==a)) --pos1; // first to delete is at pos1+1; last is at pos2 bool insert_a = (pos1&1)==v; bool insert_b = (pos2&1)==v; int rmstart=pos1+1+(insert_a ? 1 : 0); int rmend =pos2-(insert_b?1:0); planck_assert((rmend-rmstart)&1,"cannot happen"); if (insert_a && insert_b && (pos1+1>pos2)) // insert { r.insert(r.begin()+pos1+1,2,a); r[pos1+2]=b; } else { if (insert_a) r[pos1+1]=a; if (insert_b) r[pos2]=b; r.erase(r.begin()+rmstart,r.begin()+rmend+1); } } static void generalUnion (const rtype &a, const rtype &b, bool flip_a, bool flip_b, rtype &c) { planck_assert((&c!=&a)&&(&c!=&b), "cannot overwrite the rangeset"); c.clear(); bool state_a=flip_a, state_b=flip_b, state_res=state_a||state_b; tsize ia=0, ea=a.size(), ib=0, eb=b.size(); bool runa = ia!=ea, runb = ib!=eb; while(runa||runb) { bool adv_a=false, adv_b=false; T val,va=T(),vb=T(); if (runa) va = a[ia]; if (runb) vb = b[ib]; if (runa && (!runb || (va<=vb))) { adv_a=true; val=va; } if (runb && (!runa || (vb<=va))) { adv_b=true; val=vb; } if (adv_a) { state_a=!state_a; ++ia; runa = ia!=ea; } if (adv_b) { state_b=!state_b; ++ib; runb = ib!=eb; } if ((state_a||state_b)!=state_res) { c.push_back(val); state_res = !state_res; } } } public: /*! Removes all rangeset entries. */ void clear() { r.clear(); } /*! Reserves space for \a n ranges. */ void reserve(tsize n) { r.reserve(2*n); } /*! Returns the current number of ranges. */ tsize size() const { return r.size()>>1; } /*! Returns the current vector of ranges. */ const rtype &data() const { return r; } /*! Returns the first value of range \a i. */ const T &ivbegin (tdiff i) const { return r[2*i]; } /*! Returns the one-past-last value of range \a i. */ const T &ivend (tdiff i) const { return r[2*i+1]; } /*! Returns the length of range \a i. */ T ivlen (tdiff i) const { return r[2*i+1]-r[2*i]; } /*! Appends \a [v1;v2[ to the rangeset. \a v1 must be larger than the minimum of the last range in the rangeset. */ void append(const T &v1, const T &v2) { if (v2<=v1) return; if ((!r.empty()) && (v1<=r.back())) { planck_assert (v1>=r[r.size()-2],"bad append operation"); if (v2>r.back()) r.back()=v2; } else { r.push_back(v1); r.push_back(v2); } } /*! Appends \a [v;v+1[ to the rangeset. \a v must be larger than the minimum of the last range in the rangeset. */ void append(const T &v) { append(v,v+1); } /*! Appends \a other to the rangeset. All values in \a other must be larger than the minimum of the last range in the rangeset. */ void append (const rangeset &other) { for (tsize j=0; j=r.back())) { r.clear(); return; } // no overlap if ((a<=r[0]) && (b>=r.back())) return; // full rangeset in interval tdiff pos2=iiv(b); if ((pos2>=0) && (r[pos2]==b)) --pos2; bool insert_b = (pos2&1)==0; r.erase(r.begin()+pos2+1,r.end()); if (insert_b) r.push_back(b); tdiff pos1=iiv(a); bool insert_a = (pos1&1)==0; if (insert_a) r[pos1--]=a; if (pos1>=0) r.erase(r.begin(),r.begin()+pos1+1); } /*! Returns the total number of elements in the rangeset. */ T nval() const { T result=T(0); for (tsize i=0; i &res) const { res.clear(); res.reserve(nval()); for (tsize i=0; i>1; } /*! Returns \a true if the rangeset is identical to \a other, else \a false. */ bool equals (const rangeset &other) const { return r==other.data(); } /*! Returns \a true if the rangeset contains all values in the range \a [a;b[, else \a false. */ bool containsAll (T a,T b) const { tdiff res=iiv(a); if (res&1) return false; return (b<=r[res+1]); } /*! Returns \a true if the rangeset contains the value \a v, else \a false. */ bool contains (T v) const { return !(iiv(v)&1); } /*! Returns \a true if the rangeset contains all values stored in \a other, else \a false. */ bool contains (const rangeset &other) const { tsize im=0, em=r.size(); for (tsize i=0; ia) || (r[im+1] inline std::ostream &operator<< (std::ostream &os, const rangeset &rs) { os << "{ "; for (tsize i=0; ipi) { phi+=pi; theta=twopi-theta; } } void pointing::normalize() { normalize_theta(); phi=fmodulo(phi,twopi); } ostream &operator<< (ostream &os, const pointing &p) { os << p.theta << ", " << p.phi << std::endl; return os; } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/geom_utils.h0000650000175000017530000000554712255154051027175 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file geom_utils.h * Geometric utility functions. * * Copyright (C) 2003-2011 Max-Planck-Society * \author Martin Reinecke * \author Reinhard Hell */ #ifndef PLANCK_GEOM_UTILS_H #define PLANCK_GEOM_UTILS_H #include "math_utils.h" #include "vec3.h" template class arr; /*! Returns the orientation when looking from point \a loc on the unit sphere in the direction \a dir. \a loc must be normalized. The result ranges from -pi to pi, is 0 for North and pi/2 for West, i.e. the angle is given in mathematically positive sense. If \a loc is the North or South pole, the returned angle is \a atan2(dir.y,dir.x). */ inline double orientation (const vec3 &loc, const vec3 &dir) { // FIXME: here is still optimization potential if (loc.x==0 && loc.y==0) return (loc.z>0) ? safe_atan2(dir.y,-dir.x) : safe_atan2(dir.y,dir.x); vec3 east (-loc.y, loc.x, 0); vec3 north = crossprod(loc,east); return safe_atan2(-dotprod(dir,east),dotprod(dir,north)); } /*! Returns the angle between \a v1 and \a v2 in radians. */ inline double v_angle (const vec3 &v1, const vec3 &v2) { using namespace std; return atan2 (crossprod(v1,v2).Length(), dotprod(v1,v2)); } /*! Returns the cosine of the angle between the two points on the sphere defined by (\a z1, \a phi1) and (\a z2, \a phi2), respectively. \a z is the cosine of the colatitude, and \a phi is the longitude. */ inline double cosdist_zphi (double z1, double phi1, double z2, double phi2) { using namespace std; return z1*z2+cos(phi1-phi2)*sqrt((1.-z1*z1)*(1.-z2*z2)); } /*! Finds the smallest enclosing cone for a point set on the sphere according to Barequet & Elber: Information Processing Letters 93(2005), p.83. All points are expected to be passed as unit vectors. The enclosing cone must have an opening angle &point, vec3 ¢er, double &cosrad); #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/string_utils.cc0000650000175000017530000002374212255154051027707 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * This file contains the implementation of various convenience functions * used by the Planck LevelS package. * * Copyright (C) 2002-2012 Max-Planck-Society * Author: Martin Reinecke */ #include #include #include #include #include #include #include #include "string_utils.h" using namespace std; string trim (const string &orig) { string::size_type p1=orig.find_first_not_of(" \t"); if (p1==string::npos) return ""; string::size_type p2=orig.find_last_not_of(" \t"); return orig.substr(p1,p2-p1+1); } template string dataToString (const T &x) { ostringstream strstrm; strstrm << x; return trim(strstrm.str()); } template<> string dataToString (const bool &x) { return x ? "T" : "F"; } template<> string dataToString (const string &x) { return trim(x); } template<> string dataToString (const float &x) { ostringstream strstrm; strstrm << setprecision(8) << x; return trim(strstrm.str()); } template<> string dataToString (const double &x) { ostringstream strstrm; strstrm << setprecision(16) << x; return trim(strstrm.str()); } template<> string dataToString (const long double &x) { ostringstream strstrm; strstrm << setprecision(25) << x; return trim(strstrm.str()); } template string dataToString (const signed char &x); template string dataToString (const unsigned char &x); template string dataToString (const short &x); template string dataToString (const unsigned short &x); template string dataToString (const int &x); template string dataToString (const unsigned int &x); template string dataToString (const long &x); template string dataToString (const unsigned long &x); template string dataToString (const long long &x); template string dataToString (const unsigned long long &x); string intToString(int64 x, tsize width) { ostringstream strstrm; (x>=0) ? strstrm << setw(width) << setfill('0') << x : strstrm << "-" << setw(width-1) << setfill('0') << -x; string res = strstrm.str(); planck_assert(res.size()==width,"number too large"); return trim(res); } namespace { void end_stringToData (const string &x, const char *tn, istringstream &strstrm) { string error = string("conversion error in stringToData<")+tn+">(\""+x+"\")"; planck_assert (strstrm,error); string rest; strstrm >> rest; // rest=trim(rest); planck_assert (rest.length()==0,error); } } // unnamed namespace template void stringToData (const string &x, T &value) { istringstream strstrm(x); strstrm >> value; end_stringToData (x,type2typename(),strstrm); } template<> void stringToData (const string &x, string &value) { value = trim(x); } template<> void stringToData (const string &x, bool &value) { const char *x2 = x.c_str(); const char *fval[] = {"F","f","n","N","false",".false.","FALSE",".FALSE." }; const char *tval[] = {"T","t","y","Y","true",".true.","TRUE",".TRUE." }; for (tsize i=0; i< sizeof(fval)/sizeof(fval[0]); ++i) if (strcmp(x2,fval[i])==0) { value=false; return; } for (tsize i=0; i< sizeof(tval)/sizeof(tval[0]); ++i) if (strcmp(x2,tval[i])==0) { value=true; return; } planck_fail("conversion error in stringToData(\""+x+"\")"); } template void stringToData (const string &x, signed char &value); template void stringToData (const string &x, unsigned char &value); template void stringToData (const string &x, short &value); template void stringToData (const string &x, unsigned short &value); template void stringToData (const string &x, int &value); template void stringToData (const string &x, unsigned int &value); template void stringToData (const string &x, long &value); template void stringToData (const string &x, unsigned long &value); template void stringToData (const string &x, long long &value); template void stringToData (const string &x, unsigned long long &value); template void stringToData (const string &x, float &value); template void stringToData (const string &x, double &value); template void stringToData (const string &x, long double &value); bool equal_nocase (const string &a, const string &b) { if (a.size()!=b.size()) return false; for (tsize m=0; m &dict) { int lineno=0; dict.clear(); ifstream inp(filename.c_str()); planck_assert (inp,"Could not open parameter file '"+filename+"'."); while (inp) { string line; getline(inp, line); ++lineno; // remove potential carriage returns at the end of the line line=line.substr(0,line.find("\r")); line=line.substr(0,line.find("#")); line=trim(line); if (line.size()>0) { string::size_type eqpos=line.find("="); if (eqpos!=string::npos) { string key=trim(line.substr(0,eqpos)), value=trim(line.substr(eqpos+1,string::npos)); if (key=="") cerr << "Warning: empty key in '" << filename << "', line " << lineno << endl; else { if (dict.find(key)!=dict.end()) cerr << "Warning: key '" << key << "' multiply defined in '" << filename << "', line " << lineno << endl; dict[key]=value; } } else cerr << "Warning: unrecognized format in '" << filename << "', line " << lineno << ":\n" << line << endl; } } } namespace { bool isParam (const string &s) { if (s.size()<2) return false; if (s[0]!='-') return false; return !(isdigit(s[1]) || (s[1]=='.')); } } // unnamed namespace void parse_cmdline_classic (int argc, const char **argv, const vector &leading_args, map &dict) { dict.clear(); planck_assert(tsize(argc)>leading_args.size(),"not enough arguments"); for (tsize i=0; i &dict) { parse_cmdline_classic (argc, argv, vector(), dict); } void parse_cmdline_equalsign (int argc, const char **argv, const vector &leading_args, map &dict) { dict.clear(); planck_assert(tsize(argc)>leading_args.size(),"not enough arguments"); for (tsize i=0; i0) { string::size_type eqpos=arg.find("="); if (eqpos!=string::npos) { string key=trim(arg.substr(0,eqpos)), value=trim(arg.substr(eqpos+1,string::npos)); if (key=="") cerr << "Warning: empty key in argument'" << arg << "'" << endl; else { if (dict.find(key)!=dict.end()) cerr << "Warning: key '" << key << "' multiply defined" << endl; dict[key]=value; } } else cerr << "Warning: unrecognized format in argument '" << arg << "'" << endl; } } } void parse_cmdline_equalsign (int argc, const char **argv, map &dict) { parse_cmdline_equalsign (argc, argv, vector(), dict); } namespace { template void split (istream &stream, vector &list) { list.clear(); while (stream) { string word; stream >> word; planck_assert (stream||stream.eof(), string("error while splitting stream into ") + type2typename() + "components"); if (stream) list.push_back(stringToData(word)); } } } // unnamed namespace template void split (const string &inp, vector &list) { istringstream stream(inp); split (stream,list); } template void split (const string &inp, vector &list); template void split (const string &inp, vector &list); template void split (const string &inp, vector &list); template void split (const string &inp, vector &list); template void split (const string &inp, vector &list); void tokenize (const string &inp, char delim, vector &list) { istringstream stream(inp); string token; list.clear(); while (getline(stream,token,delim)) list.push_back(token); } void parse_words_from_file (const string &filename, vector &words) { words.clear(); ifstream inp(filename.c_str()); planck_assert (inp,"Could not open file '"+filename+"'."); while (inp) { string word; inp>>word; word=trim(word); if (word!="") words.push_back(word); } } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/wigner.cc0000650000175000017530000003721212255154051026451 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file wigner.cc * Several C++ classes for calculating Wigner matrices * * Copyright (C) 2009-2011 Max-Planck-Society * \author Martin Reinecke and others (see individual classes) */ #include "wigner.h" #include "lsconstants.h" using namespace std; void wigner_d_halfpi_risbo_scalar::do_line0 (double *l1, int j) { double xj = pq/j; for (int i=n; i>=1; --i) l1[i] = xj*sqt[j]*(sqt[j-i]*l1[i] - sqt[i]*l1[i-1]); l1[0] = pq*l1[0]; } void wigner_d_halfpi_risbo_scalar::do_line (const double *l1, double *l2, int j, int k) { double xj = pq/j; double t1 = xj*sqt[j-k]; double t2 = xj*sqt[k]; for (int i=n; i>=1; --i) l2[i] = t1 * (sqt[j-i]*l2[i] - sqt[i]*l2[i-1]) +t2 * (sqt[j-i]*l1[i] + sqt[i]*l1[i-1]); l2[0] = sqt[j] * (t2*l1[0]+t1*l2[0]); } wigner_d_halfpi_risbo_scalar::wigner_d_halfpi_risbo_scalar(int lmax) : pq(.5*sqrt(2.)), sqt(2*lmax+1), d(lmax+2,lmax+2), n(-1) { for (tsize m=0; m &wigner_d_halfpi_risbo_scalar::recurse () { ++n; if (n==0) d[0][0] = 1; else if (n==1) { d[0][0] = .5; d[0][1] =-pq; d[1][0] = pq; d[1][1] = 0.; } else { //padding int flip = 1; for (int i=0; i=2; --k) { do_line (d[k-2],d[k-1],2*n-1,k-1); do_line (d[k-1],d[k],2*n,k); } do_line0 (d[0],2*n-1); do_line (d[0],d[1],2*n,1); do_line0 (d[0],2*n); } return d; } void wigner_d_risbo_scalar::do_line0 (double *l1, int j) { double xj = 1./j; l1[j] = -p*l1[j-1]; for (int i=j-1; i>=1; --i) l1[i] = xj*sqt[j]*(q*sqt[j-i]*l1[i] - p*sqt[i]*l1[i-1]); l1[0] = q*l1[0]; } void wigner_d_risbo_scalar::do_line (const double *l1, double *l2, int j, int k) { double xj = 1./j; double t1 = xj*sqt[j-k]*q, t2 = xj*sqt[j-k]*p; double t3 = xj*sqt[k]*p, t4 = xj*sqt[k]*q; l2[j] = sqt[j] * (t4*l1[j-1]-t2*l2[j-1]); for (int i=j-1; i>=1; --i) l2[i] = t1*sqt[j-i]*l2[i] - t2*sqt[i]*l2[i-1] +t3*sqt[j-i]*l1[i] + t4*sqt[i]*l1[i-1]; l2[0] = sqt[j] * (t3*l1[0]+t1*l2[0]); } wigner_d_risbo_scalar::wigner_d_risbo_scalar(int lmax, double ang) : p(sin(ang/2)), q(cos(ang/2)), sqt(2*lmax+1), d(lmax+1,2*lmax+1), n(-1) { for (tsize m=0; m &wigner_d_risbo_scalar::recurse () { ++n; if (n==0) d[0][0] = 1; else if (n==1) { d[0][0] = q*q; d[0][1] = -p*q*sqt[2]; d[0][2] = p*p; d[1][0] = -d[0][1]; d[1][1] = q*q-p*p; d[1][2] = d[0][1]; } else { // padding int sign = (n&1)? -1 : 1; for (int i=0; i<=2*n-2; ++i) { d[n][i] = sign*d[n-2][2*n-2-i]; sign=-sign; } do_line (d[n-1],d[n],2*n-1,n); for (int k=n; k>=2; --k) { do_line (d[k-2],d[k-1],2*n-1,k-1); do_line (d[k-1],d[k],2*n,k); } do_line0 (d[0],2*n-1); do_line (d[0],d[1],2*n,1); do_line0 (d[0],2*n); } return d; } wigner_d_halfpi_risbo_openmp::wigner_d_halfpi_risbo_openmp(int lmax) : pq(.5*sqrt(2.)), sqt(2*lmax+1), d(lmax+2,lmax+2), dd(lmax+2,lmax+2), n(-1) { for (tsize m=0; m &wigner_d_halfpi_risbo_openmp::recurse () { ++n; if (n==0) d[0][0] = 1; else if (n==1) { d.fast_alloc(3,3); d[0][0] = .5; d[0][1] =-pq; d[1][0] = pq; d[1][1] = 0.; } else { //padding int flip = 1; for (int i=0; i &wigner_d_risbo_openmp::recurse () { ++n; if (n==0) d[0][0] = 1; else if (n==1) { d[0][0] = q*q; d[0][1] = -p*q*sqt[2]; d[0][2] = p*p; d[1][0] = -d[0][1]; d[1][1] = q*q-p*p; d[1][2] = d[0][1]; } else { // padding int sign = (n&1)? -1 : 1; for (int i=0; i<=2*n-2; ++i) { d[n][i] = sign*d[n-2][2*n-2-i]; sign=-sign; } for (int j=2*n-1; j<=2*n; ++j) { double xj = 1./j; dd[0][0] = q*d[0][0]; for (int i=1;i &thetas, double epsilon) : eps(epsilon), lmax(lmax_), logsum(2*lmax+1), lc05(thetas.size()), ls05(thetas.size()), flm1(2*lmax+1), flm2(2*lmax+1), cf(maxscale+1-minscale), costh(thetas.size()), xl(lmax+1), thetaflip(thetas.size()), m1(-1234567890), m2(-1234567890), am1(-1234567890), am2(-1234567890), mlo(-1234567890), mhi(-1234567890), fx(lmax+2), result(lmax+1) { planck_assert(lmax>0,"lmax too small"); logsum[0] = 0.; for (tsize m=1; m(m)); for (tsize lm=0; lmpi) theta-=twopi; thetaflip[i]=(theta<0); theta=abs(theta); // now theta is in (0; pi) // tiny adjustments to make sure cos and sin (theta/2) are positive if (theta==0.) theta=1e-16; if (abs_approx(theta,pi,1e-15)) theta=pi-1e-15; costh[i]=cos(theta); lc05[i]=log(cos(0.5L*theta)); ls05[i]=log(sin(0.5L*theta)); } xl[0]=0; for (tsize l=1; l=0) { swap(cosPow, sinPow); preMinus=((mhi-m2)&1); } } else { cosPow = mhi+m1; sinPow = mhi-m1; if (m2<0) { swap(cosPow, sinPow); preMinus=((mhi+m1)&1); } } } const arr &wignergen_scalar::calc (int nth, int &firstl) { calc(nth, firstl, result); return result; } void wignergen_scalar::calc (int nth, int &firstl, arr &resx) const { int l=mhi; const dbl3 *fy = &fx[0]; const double cth = costh[nth]; double *res = &resx[0]; long double logval = prefactor + lc05[nth]*cosPow + ls05[nth]*sinPow; logval *= inv_ln2; int scale = int (logval/large_exponent2)-minscale; double rec1 = 0.; double rec2 = double(exp(ln2*(logval-(scale+minscale)*large_exponent2))); if (preMinus ^ (thetaflip[nth] && ((am1+am2)&1))) rec2 = -rec2; while(scale<0) // iterate until we reach the realm of IEEE numbers { if (++l>lmax) break; rec1 = (cth - fy[l][1])*fy[l][0]*rec2 - fy[l][2]*rec1; if (++l>lmax) break; rec2 = (cth - fy[l][1])*fy[l][0]*rec1 - fy[l][2]*rec2; while (abs(rec2)>fbig) { rec1 *= fsmall; rec2 *= fsmall; ++scale; } } if (scale<0) { firstl=lmax+1; return; } rec1 *= cf[scale]; rec2 *= cf[scale]; for (;leps) break; rec1 = (cth - fy[l+1][1])*fy[l+1][0]*rec2 - fy[l+1][2]*rec1; if (abs(rec1)>eps) { swap(rec1,rec2); ++l; break; } rec2 = (cth - fy[l+2][1])*fy[l+2][0]*rec1 - fy[l+2][2]*rec2; } if ((abs(rec2)<=eps) && (++l<=lmax)) { rec1 = (cth - fy[l][1])*fy[l][0]*rec2 - fy[l][2]*rec1; swap (rec1,rec2); } firstl = l; if (l>lmax) return; res[l]=rec2; for (;llmax) break; res[l] = rec1 = (cth - fy[l][1])*fy[l][0]*rec2 - fy[l][2]*rec1; if (++l>lmax) break; res[l] = rec2 = (cth - fy[l][1])*fy[l][0]*rec1 - fy[l][2]*rec2; } } #ifdef __SSE2__ #define RENORMALIZE \ do \ { \ double rec1a, rec1b, rec2a, rec2b, cfa, cfb; \ rec1.writeTo(rec1a,rec1b); rec2.writeTo(rec2a,rec2b); \ corfac.writeTo(cfa,cfb); \ while (abs(rec2a)>fbig) \ { \ rec1a*=fsmall; rec2a*=fsmall; ++scale1; \ cfa = (scale1<0) ? 0. : cf[scale1]; \ } \ while (abs(rec2b)>fbig) \ { \ rec1b*=fsmall; rec2b*=fsmall; ++scale2; \ cfb = (scale2<0) ? 0. : cf[scale2]; \ } \ rec1.readFrom(rec1a,rec1b); rec2.readFrom(rec2a,rec2b); \ corfac.readFrom(cfa,cfb); \ } \ while(0) #define GETPRE(prea,preb,lv) \ prea=(cth-fy[lv][1])*fy[lv][0]; \ preb=fy[lv][2]; #define NEXTSTEP(prea,preb,prec,pred,reca,recb,lv) \ { \ prec = fy[lv][1]; \ preb *= reca; \ prea *= recb; \ V2df t0 (fy[lv][0]); \ prec = cth-prec; \ pred = fy[lv][2]; \ reca = prea-preb; \ prec *= t0; \ } const arr_align &wignergen::calc (int nth1, int nth2, int &firstl) { calc(nth1, nth2, firstl, result2); return result2; } void wignergen::calc (int nth1, int nth2, int &firstl, arr_align &resx) const { int l=mhi; const dbl3 *fy = &fx[0]; const V2df cth(costh[nth1],costh[nth2]); V2df *res = &resx[0]; long double logval1 = prefactor + lc05[nth1]*cosPow + ls05[nth1]*sinPow, logval2 = prefactor + lc05[nth2]*cosPow + ls05[nth2]*sinPow; logval1 *= inv_ln2; logval2 *= inv_ln2; int scale1 = int (logval1/large_exponent2)-minscale, scale2 = int (logval2/large_exponent2)-minscale; V2df rec1(0.); double tr1 = double(exp(ln2*(logval1-(scale1+minscale)*large_exponent2))), tr2 = double(exp(ln2*(logval2-(scale2+minscale)*large_exponent2))); if (preMinus ^ (thetaflip[nth1] && ((am1+am2)&1))) tr1 = -tr1; if (preMinus ^ (thetaflip[nth2] && ((am1+am2)&1))) tr2 = -tr2; V2df rec2(tr1,tr2); V2df corfac ((scale1<0) ? 0. : cf[scale1], (scale2<0) ? 0. : cf[scale2]); V2df eps2(eps); V2df fbig2(fbig); V2df pre0,pre1,pre2,pre3; GETPRE(pre0,pre1,l+1) if ((scale1<0) && (scale2<0)) { while (true) { if (++l>lmax) break; NEXTSTEP(pre0,pre1,pre2,pre3,rec1,rec2,l+1) if (++l>lmax) break; NEXTSTEP(pre2,pre3,pre0,pre1,rec2,rec1,l+1) if (any(abs(rec2).gt(fbig2))) { RENORMALIZE; if ((scale1>=0) || (scale2>=0)) break; } } } if (l<=lmax) { GETPRE(pre0,pre1,l+1) while (true) { V2df t1; res[l]=t1=rec2*corfac; if (any(abs(t1).gt(eps2))) break; if (++l>lmax) break; NEXTSTEP(pre0,pre1,pre2,pre3,rec1,rec2,l+1) res[l]=t1=rec1*corfac; if (any(abs(t1).gt(eps2))) { swap(rec1,rec2); break; } if (++l>lmax) break; NEXTSTEP(pre2,pre3,pre0,pre1,rec2,rec1,l+1) if (any(abs(rec2).gt(fbig2))) RENORMALIZE; } } firstl=l; if (l>lmax) return; GETPRE(pre0,pre1,l+1) while (true) { V2df t1; res[l]=t1=rec2*corfac; if (all(abs(t1).ge(eps2))) break; if (++l>lmax) break; NEXTSTEP(pre0,pre1,pre2,pre3,rec1,rec2,l+1) res[l]=t1=rec1*corfac; if (all(abs(t1).ge(eps2))) { swap(rec1,rec2); break; } if (++l>lmax) break; NEXTSTEP(pre2,pre3,pre0,pre1,rec2,rec1,l+1) if (any(abs(rec2).gt(fbig2))) RENORMALIZE; } if (l>lmax) return; rec1*=corfac; rec2*=corfac; GETPRE(pre0,pre1,l+1) for (;l1.); // close to a pole return (((sqrt(delta)-epsPow)*cosm1m2/abs(sth)) > lmax); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/fitshandle.cc0000650000175000017530000005525212255154051027303 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * This file contains the implementation of the FITS I/O helper class * used by the Planck LevelS package. * * Copyright (C) 2002-2011 Max-Planck-Society * Author: Martin Reinecke */ #include #include #include #include "fitsio.h" #include "fitshandle.h" #include "string_utils.h" #define FPTR (static_cast (fptr)) #define OFPTR (static_cast (orig.fptr)) using namespace std; namespace { template inline int fitsType(); template<> inline int fitsType () { return TFLOAT; } template<> inline int fitsType() { return TDOUBLE; } int type2bitpix (PDT type) { switch (type) { case PLANCK_FLOAT32: return FLOAT_IMG; case PLANCK_FLOAT64: return DOUBLE_IMG; default: planck_fail ("unsupported component type"); } } /*! Converts a FITS type code (i.e. the data type of a FITS column) to the corresponding Planck type code. */ PDT ftc2type (int ftc) { switch (ftc) { case TLOGICAL : return PLANCK_BOOL; case TBYTE : return PLANCK_INT8; case TSHORT : return PLANCK_INT16; case TINT : case TINT32BIT: return PLANCK_INT32; case TLONGLONG: return PLANCK_INT64; case TFLOAT : return PLANCK_FLOAT32; case TDOUBLE : return PLANCK_FLOAT64; case TSTRING : return PLANCK_STRING; default: planck_fail ("unsupported component type"); } } /*! Converts a Planck type code to the corresponding FITS type code (i.e. the data type of a FITS column). */ int type2ftc (PDT type) { switch (type) { case PLANCK_BOOL : return TLOGICAL; case PLANCK_INT8 : case PLANCK_UINT8 : return TBYTE; case PLANCK_INT16 : return TSHORT; case PLANCK_INT32 : return TINT; case PLANCK_INT64 : return TLONGLONG; case PLANCK_FLOAT32: return TFLOAT; case PLANCK_FLOAT64: return TDOUBLE; case PLANCK_STRING : return TSTRING; default: planck_fail ("unsupported component type"); } } const char *type2fitschar (PDT type) { switch (type) { case PLANCK_BOOL : return "L"; case PLANCK_FLOAT32: return "E"; case PLANCK_FLOAT64: return "D"; case PLANCK_INT8 : case PLANCK_UINT8 : return "B"; case PLANCK_INT16 : return "I"; case PLANCK_INT32 : return "J"; case PLANCK_INT64 : return "K"; case PLANCK_STRING : return "A"; default: planck_fail(string("unknown data type ")+type2string(type)); } } const char *type2asciiform (PDT type) { switch (type) { case PLANCK_FLOAT32: return "E14.7"; case PLANCK_FLOAT64: return "D23.15"; case PLANCK_UINT8 : return "I3"; case PLANCK_INT8 : return "I4"; case PLANCK_INT16 : return "I6"; case PLANCK_INT32 : return "I11"; case PLANCK_INT64 : return "I22"; default: planck_fail(string("unknown data type ")+type2string(type)); } } string fixkey (const string &key) { for (tsize m=0; mcolumns_.size())) return false; return true; } bool fitshandle::image_hdu () const { return hdutype_==IMAGE_HDU; } void fitshandle::init_image() { int naxis; fits_get_img_type (FPTR, &bitpix_, &status); fits_get_img_dim (FPTR, &naxis, &status); check_errors(); arr naxes(naxis); fits_get_img_sizell (FPTR, naxis, &naxes[0], &status); for (long m=0; m(data), &status); nrows_ = max(nrows_,offset+ndata); check_errors(); } void fitshandle::getKeyHelper(const string &name) const { if (status==KEY_NO_EXIST) { fits_clear_errmsg(); status=0; planck_fail("fitshandle::get_key(): key '"+name+"' not found"); } check_errors(); } fitshandle::fitshandle () : status(0), fptr(0), hdutype_(INVALID), bitpix_(INVALID), nrows_(0) {} fitshandle::~fitshandle() { clean_all(); } void fitshandle::open (const string &fname) { clean_all(); fitsfile *ptr; fits_open_file(&ptr, fname.c_str(), READONLY, &status); fptr=ptr; check_errors(); init_data(); } void fitshandle::create (const string &fname) { clean_all(); fitsfile *ptr; fits_create_file(&ptr, fname.c_str(), &status); fptr=ptr; fits_write_imghdr(FPTR, 8, 0, 0, &status); // insert empty PHDU fits_write_date(FPTR, &status); check_errors(); init_data(); } // static void fitshandle::delete_file (const string &name) { fitsfile *ptr; int stat = 0; fits_open_file(&ptr, name.c_str(), READWRITE, &stat); fits_delete_file(ptr, &stat); if (stat==0) return; char msg[81]; fits_get_errstatus (stat, msg); cerr << msg << endl; while (fits_read_errmsg(msg)) cerr << msg << endl; planck_fail("FITS error"); } string fitshandle::fileName() const { planck_assert(connected(),"handle not connected to a file"); char *fname = new char[2048]; fits_file_name(FPTR, fname, &status); check_errors(); string result(fname); delete[] fname; return result; } void fitshandle::goto_hdu (int hdu) { int curhdu; fits_get_hdu_num(FPTR,&curhdu); if (curhdu!=hdu) { fits_movabs_hdu(FPTR, hdu, &hdutype_, &status); check_errors(); init_data(); } } int fitshandle::num_hdus () const { int result; fits_get_num_hdus (FPTR, &result, &status); check_errors(); return result; } void fitshandle::insert_bintab (const vector &cols, const string &extname) { clean_data(); int ncol=cols.size(); arr2b ttype(ncol,81), tform(ncol,81), tunit(ncol,81); for (long m=0; m(extname.c_str()), 0, &status); check_errors(); init_data(); } void fitshandle::insert_asctab (const vector &cols, const string &extname) { clean_data(); int ncol=cols.size(); arr2b ttype(ncol,81), tform(ncol,81), tunit(ncol,81); for (long m=0; m(extname.c_str()), &status); check_errors(); init_data(); } void fitshandle::insert_image (PDT type, const vector &Axes) { clean_data(); arr tmpax(Axes.size()); for (long m=0; m void fitshandle::insert_image (PDT type, const arr2 &data) { clean_data(); arr tmpax(2); tmpax[0] = data.size2(); tmpax[1] = data.size1(); fits_insert_imgll (FPTR, type2bitpix(type), 2, &tmpax[0], &status); arr2 &tmparr = const_cast &> (data); fits_write_img (FPTR, fitsType(), 1, tmpax[0]*tmpax[1], &tmparr[0][0], &status); check_errors(); init_data(); } template void fitshandle::insert_image (PDT type, const arr2 &data); template void fitshandle::insert_image (PDT type, const arr2 &data); void fitshandle::write_checksum() { planck_assert(connected(),"handle not connected to a file"); fits_write_chksum (FPTR, &status); check_errors(); } const vector &fitshandle::axes() const { planck_assert(image_hdu(),"not connected to an image"); return axes_; } const string &fitshandle::colname(int i) const { planck_assert(table_hdu(i),"incorrect FITS table access"); return columns_[i-1].name(); } const string &fitshandle::colunit(int i) const { planck_assert(table_hdu(i),"incorrect FITS table access"); return columns_[i-1].unit(); } int64 fitshandle::repcount(int i) const { planck_assert(table_hdu(i),"incorrect FITS table access"); return columns_[i-1].repcount(); } PDT fitshandle::coltype(int i) const { planck_assert(table_hdu(i),"incorrect FITS table access"); return columns_[i-1].type(); } int fitshandle::ncols() const { planck_assert(table_hdu(1),"incorrect FITS table access"); return columns_.size(); } int64 fitshandle::nrows() const { planck_assert(table_hdu(1),"incorrect FITS table access"); return nrows_; } int64 fitshandle::nelems(int i) const { planck_assert(table_hdu(i),"incorrect FITS table access"); if (columns_[i-1].type()==PLANCK_STRING) return nrows_; return nrows_*columns_[i-1].repcount(); } int64 fitshandle::efficientChunkSize(int i) const { planck_assert(table_hdu(1),"incorrect FITS table access"); long int res; fits_get_rowsize(FPTR, &res, &status); planck_assert(res>=1,"bad recommended FITS chunk size"); check_errors(); return res*columns_[i-1].repcount(); } void fitshandle::get_all_keys(vector &keys) const { keys.clear(); char card[81]; const char *inclist[] = { "*" }; planck_assert(connected(),"handle not connected to a file"); fits_read_record (FPTR, 0, card, &status); check_errors(); while (true) { fits_find_nextkey (FPTR, const_cast(inclist), 1, 0, 0, card, &status); if (status!=0) break; if (fits_get_keyclass(card)==TYP_USER_KEY) { char keyname[80]; int dummy; fits_get_keyname(card, keyname, &dummy, &status); check_errors(); keys.push_back(trim(keyname)); } check_errors(); } if (status==KEY_NO_EXIST) { fits_clear_errmsg(); status=0; } check_errors(); } void fitshandle::set_key_void (const string &key, const void *value, PDT type, const string &comment) { planck_assert(connected(),"handle not connected to a file"); string key2 = fixkey(key); switch (type) { case PLANCK_INT8: case PLANCK_UINT8: case PLANCK_INT16: case PLANCK_INT32: case PLANCK_INT64: case PLANCK_FLOAT32: case PLANCK_FLOAT64: fits_update_key (FPTR, type2ftc(type), const_cast(key2.c_str()), const_cast(value), const_cast(comment.c_str()), &status); break; case PLANCK_BOOL: { int val = *(static_cast(value)); fits_update_key (FPTR, TLOGICAL, const_cast(key2.c_str()), &val, const_cast(comment.c_str()), &status); break; } case PLANCK_STRING: { string val = *(static_cast(value)); fits_update_key_longstr (FPTR, const_cast(key2.c_str()), const_cast(val.c_str()), const_cast(comment.c_str()), &status); break; } default: planck_fail ("unsupported data type in set_key_void()"); } check_errors(); } void fitshandle::get_key_void (const string &name, void *value, PDT type) const { planck_assert(connected(),"handle not connected to a file"); switch (type) { case PLANCK_INT8: case PLANCK_UINT8: case PLANCK_INT16: case PLANCK_INT32: case PLANCK_INT64: case PLANCK_FLOAT32: case PLANCK_FLOAT64: fits_read_key (FPTR, type2ftc(type), const_cast(name.c_str()), value, 0, &status); getKeyHelper(name); break; case PLANCK_BOOL: { int val; fits_read_key (FPTR, TLOGICAL, const_cast(name.c_str()), &val, 0, &status); getKeyHelper(name); *(static_cast(value))=val; break; } case PLANCK_STRING: { char *tmp=0; fits_read_key_longstr (FPTR, const_cast(name.c_str()), &tmp, 0, &status); getKeyHelper(name); *(static_cast(value))=tmp; if (tmp) free(tmp); break; } default: planck_fail ("unsupported data type in get_key_void()"); } check_errors(); } void fitshandle::delete_key (const string &name) { planck_assert(connected(),"handle not connected to a file"); fits_delete_key (FPTR, const_cast(name.c_str()), &status); check_errors(); } void fitshandle::add_comment(const string &comment) { planck_assert(connected(),"handle not connected to a file"); fits_write_comment(FPTR,const_cast(comment.c_str()),&status); check_errors(); } bool fitshandle::key_present(const string &name) const { char card[81]; planck_assert(connected(),"handle not connected to a file"); fits_read_card(FPTR, const_cast(name.c_str()), card, &status); if (status==KEY_NO_EXIST) { fits_clear_errmsg(); status=0; return false; } check_errors(); return true; } void fitshandle::assert_pdmtype (const string &pdmtype) const { string type; get_key("PDMTYPE",type); if (pdmtype==type) return; cerr << "PDMTYPE " << pdmtype << " expected, but found " << type << endl; } void fitshandle::read_column_raw_void (int colnum, void *data, PDT type, int64 num, int64 offset) const { switch (type) { case PLANCK_INT8: case PLANCK_UINT8: case PLANCK_INT16: case PLANCK_INT32: case PLANCK_INT64: case PLANCK_FLOAT32: case PLANCK_FLOAT64: case PLANCK_BOOL: read_col (colnum, data, num, type, offset); break; case PLANCK_STRING: { string *data2 = static_cast (data); planck_assert(table_hdu(colnum),"incorrect FITS table access"); planck_assert (num<=(nrows_-offset), "read_column(): array too large"); arr2b tdata(safe_cast(num), safe_cast(columns_[colnum-1].repcount()+1)); int dispwidth; fits_get_col_display_width(FPTR, colnum, &dispwidth, &status); planck_assert(dispwidth<=columns_[colnum-1].repcount(),"column too wide"); fits_read_col (FPTR, TSTRING, colnum, offset+1, 1, num, 0, tdata.p0(), 0, &status); check_errors(); for (long m=0;m (data); planck_assert(table_hdu(colnum),"incorrect FITS table access"); tsize stringlen = safe_cast(columns_[colnum-1].repcount()+1); arr2b tdata(safe_cast(num), stringlen); for (long m=0;m(data), &status); check_errors(); } void fitshandle::write_subimage_void (const void *data, PDT type, tsize sz, int64 offset) { planck_assert(image_hdu(),"not connected to an image"); fits_write_img (FPTR, type2ftc(type), 1+offset, sz, const_cast(data), &status); check_errors(); } template void fitshandle::read_image (arr2 &data) const { planck_assert(image_hdu(),"not connected to an image"); planck_assert (axes_.size()==2, "wrong number of dimensions"); data.alloc(safe_cast(axes_[0]), safe_cast(axes_[1])); fits_read_img (FPTR, fitsType(), 1, axes_[0]*axes_[1], 0, &data[0][0], 0, &status); check_errors(); } template void fitshandle::read_image (arr2 &data) const; template void fitshandle::read_image (arr2 &data) const; template void fitshandle::read_image (arr3 &data) const { planck_assert(image_hdu(),"not connected to an image"); planck_assert (axes_.size()==3, "wrong number of dimensions"); data.alloc(safe_cast(axes_[0]), safe_cast(axes_[1]), safe_cast(axes_[2])); fits_read_img (FPTR, fitsType(), 1, axes_[0]*axes_[1]*axes_[2], 0, &data(0,0,0), 0, &status); check_errors(); } template void fitshandle::read_image (arr3 &data) const; template void fitshandle::read_image (arr3 &data) const; template void fitshandle::read_subimage (arr2 &data, int xl, int yl) const { planck_assert(image_hdu(),"not connected to an image"); planck_assert (axes_.size()==2, "wrong number of dimensions"); for (tsize m=0; m(), (xl+m)*axes_[1]+yl+1, data.size2(), 0, &data[m][0], 0, &status); check_errors(); } template void fitshandle::read_subimage (arr2 &data, int xl, int yl) const; template void fitshandle::read_subimage (arr2 &data, int xl, int yl) const; void fitshandle::read_subimage_void (void *data, PDT type, tsize ndata, int64 offset) const { planck_assert(image_hdu(),"not connected to an image"); fits_read_img (FPTR, type2ftc(type), 1+offset, ndata, 0, data, 0, &status); check_errors(); } namespace { class cfitsio_checker { public: cfitsio_checker() { float fitsversion; planck_assert(fits_get_version(&fitsversion), "error calling fits_get_version()"); int v_header = nearest(1000.*CFITSIO_VERSION), v_library = nearest(1000.*fitsversion); if (v_header!=v_library) cerr << endl << "WARNING: version mismatch between CFITSIO header (v" << dataToString(v_header*0.001) << ") and linked library (v" << dataToString(v_library*0.001) << ")." << endl << endl; } }; cfitsio_checker Cfitsio_Checker; } // unnamed namespace healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/announce.cc0000650000175000017530000000631612255154051026765 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * This file contains the implementation of various convenience functions * used by the Planck LevelS package. * * Copyright (C) 2002-2011 Max-Planck-Society * Authors: Martin Reinecke, Reinhard Hell */ // if we are using g++, check for version 4.0 or higher #ifdef __GNUC__ #if (__GNUC__<4) #error your C++ compiler is too old. g++ version 4.0 or higher is required. #endif #endif #include #include "announce.h" #include "openmp_support.h" using namespace std; namespace { void openmp_status() { #ifndef _OPENMP cout << "OpenMP: not supported by this binary" << endl; #else int threads = openmp_max_threads(); if (threads>1) cout << "OpenMP active: max. " << threads << " threads." << endl; else cout << "OpenMP active, but running with 1 thread only." << endl; #endif } void vec_status() { cout << "Vector math: "; #if(defined(__AVX__)) cout << "AVX" << endl; #elif(defined(__SSE2__)) cout << "SSE2" << endl; #elif(defined(__SSE__)) cout << "SSE" << endl; #else cout << "not supported by this binary" << endl; #endif } } //unnamed namespace void announce (const string &name) { #ifndef VERSION #define VERSION "?.?" #endif string version = "v" VERSION; string name2 = name+" "+version; cout << endl << "+-"; for (tsize m=0; m=2, string("Usage:\n ")+name+" \nor:\n " +name+" par1=val1 par2=val2 ...", verbose); } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/string_utils.h0000650000175000017530000000777012255154051027554 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file string_utils.h * Various functions for manipulating strings. * * Copyright (C) 2002-2012 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_STRING_UTILS_H #define PLANCK_STRING_UTILS_H #include #include #include "datatypes.h" /*! \defgroup stringutilsgroup String handling helper functions */ /*! \{ */ /*! Returns the string \a orig without leading and trailing whitespace. */ std::string trim (const std::string &orig); /*! Returns a string containing the text representation of \a x. Care is taken that no information is lost in the conversion. */ template std::string dataToString(const T &x); template<> std::string dataToString (const bool &x); template<> std::string dataToString (const std::string &x); template<> std::string dataToString (const float &x); template<> std::string dataToString (const double &x); template<> std::string dataToString (const long double &x); /*! Returns a string containing the text representation of \a x, padded with leading zeroes to \a width characters. */ std::string intToString(int64 x, tsize width); /*! Reads a value of a given datatype from a string */ template void stringToData (const std::string &x, T &value); template<> void stringToData (const std::string &x, std::string &value); template<> void stringToData (const std::string &x, bool &value); /*! Reads a value of a given datatype from a string */ template inline T stringToData (const std::string &x) { T result; stringToData(x,result); return result; } /*! Parses the file \a filename and returns the key/value pairs in \a dict. */ void parse_file (const std::string &filename, std::map &dict); void parse_cmdline_classic (int argc, const char **argv, const std::vector &leading_args, std::map &dict); void parse_cmdline_classic (int argc, const char **argv, std::map &dict); void parse_cmdline_equalsign (int argc, const char **argv, const std::vector &leading_args, std::map &dict); void parse_cmdline_equalsign (int argc, const char **argv, std::map &dict); /*! Case-insensitive string comparison Returns \a true, if \a a and \a b differ only in capitalisation, else \a false. */ bool equal_nocase (const std::string &a, const std::string &b); /*! Returns lowercase version of \a input. */ std::string tolower(const std::string &input); /*! Tries to split \a inp into a white-space separated list of values of type \a T, and appends them to \a list. */ template void split (const std::string &inp, std::vector &list); /*! Breaks the string \a inp into tokens separated by \a delim, and returns them in \a list. */ void tokenize (const std::string &inp, char delim, std::vector &list); /*! Reads all white-space separated strings from \a filename, and returns them in \a words. */ void parse_words_from_file (const std::string &filename, std::vector &words); /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/cxxsupport/error_handling.h0000650000175000017530000000605712255154051030020 0ustar zoncaplanck00000000000000/* * This file is part of libcxxsupport. * * libcxxsupport 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 2 of the License, or * (at your option) any later version. * * libcxxsupport 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 libcxxsupport; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libcxxsupport is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file error_handling.h * Utilities for error reporting * * Copyright (C) 2003-2011 Max-Planck-Society * Authors: Reinhard Hell, Martin Reinecke */ #ifndef PLANCK_ERROR_HANDLING_H #define PLANCK_ERROR_HANDLING_H #include #include #if defined (__GNUC__) #define PLANCK_FUNC_NAME__ __PRETTY_FUNCTION__ #else #define PLANCK_FUNC_NAME__ 0 #endif void planck_failure__(const char *file, int line, const char *func, const std::string &msg); void planck_failure__(const char *file, int line, const char *func, const char *msg); void killjob__(); class PlanckError { private: std::string msg; public: explicit PlanckError(const std::string &message); explicit PlanckError(const char *message); virtual const char* what() const { return msg.c_str(); } virtual ~PlanckError(); }; /*! \defgroup errorgroup Error handling */ /*! \{ */ /*! Writes diagnostic output and exits with an error status. */ #define planck_fail(msg) \ do { planck_failure__(__FILE__,__LINE__,PLANCK_FUNC_NAME__,msg); \ throw PlanckError(msg); } while(0) /*! Throws a PlanckError without diagnostic message. */ #define planck_fail_quietly(msg) \ do { throw PlanckError(msg); } while(0) /*! Writes diagnostic output and exits with an error status if \a testval is \a false. */ #define planck_assert(testval,msg) \ do { if (testval); else planck_fail(msg); } while(0) /*! Macro for improving error diagnostics. Should be placed immediately after the opening brace of \c main(). Must be used in conjunction with \c PLANCK_DIAGNOSIS_END. */ #define PLANCK_DIAGNOSIS_BEGIN try { /*! Macro for improving error diagnostics. Should be placed immediately before the closing brace of \c main(). Must be used in conjunction with \c PLANCK_DIAGNOSIS_BEGIN. */ #define PLANCK_DIAGNOSIS_END \ } \ catch (PlanckError &) \ { killjob__(); /* no need for further diagnostics; they were shown already */ } \ catch (std::exception &e) \ { std::cerr << "std::exception: " << e.what() << std::endl; killjob__(); } \ catch (...) \ { std::cerr << "Unknown exception" << std::endl; killjob__(); } /*! \} */ #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/install-sh0000755000175000017500000003325512346122572024265 0ustar zoncazonca00000000000000#!/bin/sh # install - install a program, script, or datafile scriptversion=2011-11-20.07; # 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. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # 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_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' 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 no_target_directory= 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 *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done 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 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; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi 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 eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob 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=$dstdir/_inst.$$_ rmtmp=$dstdir/_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` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob 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: "UTC" # time-stamp-end: "; # UTC" # End: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/Makefile.am0000650000175000017530000001472612255154051024451 0ustar zoncaplanck00000000000000ACLOCAL_AMFLAGS = -I m4 lib_LTLIBRARIES = libhealpix_cxx.la src_c_utils = \ c_utils/c_utils.c \ c_utils/c_utils.h \ c_utils/walltime_c.c \ c_utils/walltime_c.h src_libfftpack = \ libfftpack/bluestein.h \ libfftpack/bluestein.c \ libfftpack/fftpack.h \ libfftpack/fftpack.c \ libfftpack/ls_fft.h \ libfftpack/ls_fft.c src_libsharp = \ libsharp/sharp.c \ libsharp/sharp.h \ libsharp/sharp_cxx.h \ libsharp/sharp_almhelpers.c \ libsharp/sharp_almhelpers.h \ libsharp/sharp_complex_hacks.h \ libsharp/sharp_core.c \ libsharp/sharp_core.h \ libsharp/sharp_geomhelpers.c \ libsharp/sharp_geomhelpers.h \ libsharp/sharp_internal.h \ libsharp/sharp_lowlevel.h \ libsharp/sharp_vecsupport.h \ libsharp/sharp_vecutil.h \ libsharp/sharp_ylmgen_c.c \ libsharp/sharp_ylmgen_c.h src_cxxsupport = \ cxxsupport/announce.cc \ cxxsupport/fitshandle.cc \ cxxsupport/geom_utils.cc \ cxxsupport/string_utils.cc \ cxxsupport/ls_image.cc \ cxxsupport/paramfile.cc \ cxxsupport/pointing.cc \ cxxsupport/rotmatrix.cc \ cxxsupport/trafos.cc \ cxxsupport/walltimer.cc \ cxxsupport/wigner.cc \ cxxsupport/error_handling.cc \ cxxsupport/alloc_utils.h \ cxxsupport/announce.h \ cxxsupport/arr.h \ cxxsupport/bstream.h \ cxxsupport/datatypes.h \ cxxsupport/error_handling.h \ cxxsupport/fftpack_support.h \ cxxsupport/fitshandle.h \ cxxsupport/geom_utils.h \ cxxsupport/levels_facilities.h \ cxxsupport/ls_image.h \ cxxsupport/lsconstants.h \ cxxsupport/math_utils.h \ cxxsupport/openmp_support.h \ cxxsupport/paramfile.h \ cxxsupport/planck_rng.h \ cxxsupport/pointing.h \ cxxsupport/rangeset.h \ cxxsupport/rotmatrix.h \ cxxsupport/safe_cast.h \ cxxsupport/safe_ptr.h \ cxxsupport/share_utils.h \ cxxsupport/sse_utils_cxx.h \ cxxsupport/string_utils.h \ cxxsupport/trafos.h \ cxxsupport/vec3.h \ cxxsupport/walltimer.h \ cxxsupport/wigner.h \ cxxsupport/xcomplex.h src_healpix_cxx= \ Healpix_cxx/alm.cc \ Healpix_cxx/alm.h \ Healpix_cxx/alm2map_cxx_module.cc \ Healpix_cxx/alm_fitsio.cc \ Healpix_cxx/alm_fitsio.h \ Healpix_cxx/alm_healpix_tools.cc \ Healpix_cxx/alm_healpix_tools.h \ Healpix_cxx/alm_powspec_tools.cc \ Healpix_cxx/alm_powspec_tools.h \ Healpix_cxx/anafast_cxx_module.cc \ Healpix_cxx/calc_powspec_module.cc \ Healpix_cxx/healpix_base.cc \ Healpix_cxx/healpix_base.h \ Healpix_cxx/healpix_data_io.cc \ Healpix_cxx/healpix_data_io.h \ Healpix_cxx/healpix_map.cc \ Healpix_cxx/healpix_map.h \ Healpix_cxx/healpix_map_fitsio.cc \ Healpix_cxx/healpix_map_fitsio.h \ Healpix_cxx/healpix_tables.cc \ Healpix_cxx/healpix_tables.h \ Healpix_cxx/hotspots_cxx_module.cc \ Healpix_cxx/map2tga_module.cc \ Healpix_cxx/median_filter_cxx_module.cc \ Healpix_cxx/mult_alm_module.cc \ Healpix_cxx/powspec.cc \ Healpix_cxx/powspec.h \ Healpix_cxx/powspec_fitsio.cc \ Healpix_cxx/powspec_fitsio.h \ Healpix_cxx/smoothing_cxx_module.cc \ Healpix_cxx/syn_alm_cxx_module.cc \ Healpix_cxx/udgrade_cxx_module.cc \ Healpix_cxx/udgrade_harmonic_cxx_module.cc EXTRA_DIST = \ libfftpack/fftpack_inc.c \ libsharp/sharp_core_inc.c \ libsharp/sharp_core_inc2.c \ libsharp/sharp_core_inchelper.c \ cxxsupport/font_data.inc include_HEADERS = \ libsharp/sharp.h \ libsharp/sharp_lowlevel.h \ libsharp/sharp_geomhelpers.c \ libsharp/sharp_geomhelpers.h \ cxxsupport/arr.h \ cxxsupport/xcomplex.h \ cxxsupport/datatypes.h \ cxxsupport/pointing.h \ cxxsupport/rangeset.h \ cxxsupport/fitshandle.h \ cxxsupport/alloc_utils.h \ cxxsupport/math_utils.h \ cxxsupport/error_handling.h \ cxxsupport/lsconstants.h \ cxxsupport/safe_cast.h \ cxxsupport/vec3.h \ cxxsupport/wigner.h \ cxxsupport/rotmatrix.h \ cxxsupport/sse_utils_cxx.h \ cxxsupport/string_utils.h \ Healpix_cxx/alm.h \ Healpix_cxx/alm_fitsio.h \ Healpix_cxx/alm_healpix_tools.h \ Healpix_cxx/alm_powspec_tools.h \ Healpix_cxx/healpix_base.h \ Healpix_cxx/healpix_data_io.h \ Healpix_cxx/healpix_map.h \ Healpix_cxx/healpix_map_fitsio.h \ Healpix_cxx/healpix_tables.h \ Healpix_cxx/powspec.h \ Healpix_cxx/powspec_fitsio.h libhealpix_cxx_la_SOURCES = $(src_c_utils) $(src_libfftpack) $(src_libsharp) $(src_cxxsupport) $(src_healpix_cxx) libhealpix_cxx_la_LIBADD = $(CFITSIO_LIBS) bin_PROGRAMS = alm2map_cxx anafast_cxx calc_powspec hotspots_cxx map2tga \ median_filter_cxx mult_alm rotalm_cxx smoothing_cxx syn_alm_cxx udgrade_cxx \ udgrade_harmonic_cxx hpxtest alm2map_cxx_SOURCES = Healpix_cxx/alm2map_cxx.cc alm2map_cxx_LDADD = libhealpix_cxx.la alm2map_cxx_LDFLAGS = -static-libtool-libs anafast_cxx_SOURCES = Healpix_cxx/anafast_cxx.cc anafast_cxx_LDADD = libhealpix_cxx.la anafast_cxx_LDFLAGS = -static-libtool-libs calc_powspec_SOURCES = Healpix_cxx/calc_powspec.cc calc_powspec_LDADD = libhealpix_cxx.la calc_powspec_LDFLAGS = -static-libtool-libs hotspots_cxx_SOURCES = Healpix_cxx/hotspots_cxx.cc hotspots_cxx_LDADD = libhealpix_cxx.la hotspots_cxx_LDFLAGS = -static-libtool-libs map2tga_SOURCES = Healpix_cxx/map2tga.cc map2tga_LDADD = libhealpix_cxx.la map2tga_LDFLAGS = -static-libtool-libs median_filter_cxx_SOURCES = Healpix_cxx/median_filter_cxx.cc median_filter_cxx_LDADD = libhealpix_cxx.la median_filter_cxx_LDFLAGS = -static-libtool-libs mult_alm_SOURCES = Healpix_cxx/mult_alm.cc mult_alm_LDADD = libhealpix_cxx.la mult_alm_LDFLAGS = -static-libtool-libs rotalm_cxx_SOURCES = Healpix_cxx/rotalm_cxx.cc rotalm_cxx_LDADD = libhealpix_cxx.la rotalm_cxx_LDFLAGS = -static-libtool-libs smoothing_cxx_SOURCES = Healpix_cxx/smoothing_cxx.cc smoothing_cxx_LDADD = libhealpix_cxx.la smoothing_cxx_LDFLAGS = -static-libtool-libs syn_alm_cxx_SOURCES = Healpix_cxx/syn_alm_cxx.cc syn_alm_cxx_LDADD = libhealpix_cxx.la syn_alm_cxx_LDFLAGS = -static-libtool-libs udgrade_cxx_SOURCES = Healpix_cxx/udgrade_cxx.cc udgrade_cxx_LDADD = libhealpix_cxx.la udgrade_cxx_LDFLAGS = -static-libtool-libs udgrade_harmonic_cxx_SOURCES = Healpix_cxx/udgrade_harmonic_cxx.cc udgrade_harmonic_cxx_LDADD = libhealpix_cxx.la udgrade_harmonic_cxx_LDFLAGS = -static-libtool-libs hpxtest_SOURCES=Healpix_cxx/hpxtest.cc hpxtest_LDADD = libhealpix_cxx.la hpxtest_LDFLAGS = -static-libtool-libs TESTS=hpxtest AM_CPPFLAGS = $(CFITSIO_CFLAGS) -I$(top_srcdir)/c_utils -I$(top_srcdir)/libfftpack -I$(top_srcdir)/libsharp -I$(top_srcdir)/cxxsupport pkgconfigdir = $(libdir)/pkgconfig nodist_pkgconfig_DATA = @PACKAGE_NAME@.pc DISTCLEANFILES=@PACKAGE_NAME@.pc @PACKAGE_NAME@.pc.in @PACKAGE_NAME@-uninstalled.pc @PACKAGE_NAME@-uninstalled.sh healpy-1.8.1/healpixsubmodule/src/cxx/autotools/config.sub0000755000175000017500000010563412346122572024245 0ustar zoncazonca00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2014 Free Software Foundation, Inc. timestamp='2014-05-01' # 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 with a ChangeLog entry to config-patches@gnu.org. # # 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: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD # 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 $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -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-2014 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* | \ kopensolaris*-gnu* | \ 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/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -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 \ | be32 | be64 \ | bfin \ | c4x | c8051 | clipper \ | d10v | d30v | dlx | dsp16xx \ | epiphany \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | hexagon \ | i370 | i860 | i960 | 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 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle \ | pyramid \ | rl78 | rx \ | score \ | 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 \ | spu \ | tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \ | ubicom32 \ | v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \ | we32k \ | 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 ;; m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip) basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; 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-* \ | be32-* | be64-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* \ | c8051-* | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | hexagon-* \ | i*86-* | i860-* | i960-* | 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-* \ | pyramid-* \ | 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-* \ | 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-unknown 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 ;; 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* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; 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 ;; hppa-next) os=-nextstep3 ;; 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 ;; i386-vsta | 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 ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; 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 ;; 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 ;; 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 | ppc-le | powerpc-little) 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 | ppc64-le | powerpc64-little) 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 ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | 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 ;; 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 ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; 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 ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; 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 ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; 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 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First 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* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -bitrig* | -openbsd* | -solidbsd* \ | -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* \ | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \ | -linux-newlib* | -linux-musl* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* | -tirtos*) # 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 | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -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 ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -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 ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -nacl*) ;; -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 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-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 ;; *-next) os=-nextstep3 ;; *-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-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/m4/0000755000175000017500000000000012351601662022567 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/m4/lt~obsolete.m40000644000175000017500000001375612346122566025424 0ustar zoncazonca00000000000000# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2009 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004. # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 5 lt~obsolete.m4 # These exist entirely to fool aclocal when bootstrapping libtool. # # In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN) # which have later been changed to m4_define as they aren't part of the # exported API, or moved to Autoconf or Automake where they belong. # # The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN # in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us # using a macro with the same name in our local m4/libtool.m4 it'll # pull the old libtool.m4 in (it doesn't see our shiny new m4_define # and doesn't know about Autoconf macros at all.) # # So we provide this file, which has a silly filename so it's always # included after everything else. This provides aclocal with the # AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything # because those macros already exist, or will be overwritten later. # We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. # # Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. # Yes, that means every name once taken will need to remain here until # we give up compatibility with versions before 1.7, at which point # we need to keep only those names which we still refer to. # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) m4_ifndef([_LT_REQUIRED_DARWIN_CHECKS], [AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])]) m4_ifndef([_LT_AC_PROG_CXXCPP], [AC_DEFUN([_LT_AC_PROG_CXXCPP])]) m4_ifndef([_LT_PREPARE_SED_QUOTE_VARS], [AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])]) m4_ifndef([_LT_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_PROG_F77], [AC_DEFUN([_LT_PROG_F77])]) m4_ifndef([_LT_PROG_FC], [AC_DEFUN([_LT_PROG_FC])]) m4_ifndef([_LT_PROG_CXX], [AC_DEFUN([_LT_PROG_CXX])]) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/m4/m4_ax_create_pkgconfig_info.m40000650000175000017530000003415512255154051030572 0ustar zoncaplanck00000000000000# ============================================================================ # http://www.gnu.org/software/autoconf-archive/ax_create_pkgconfig_info.html # ============================================================================ # # SYNOPSIS # # AX_CREATE_PKGCONFIG_INFO [(outputfile, [requires [,libs [,summary [,cflags [, ldflags]]]]])] # # DESCRIPTION # # Defaults: # # $1 = $PACKAGE_NAME.pc # $2 = (empty) # $3 = $PACKAGE_LIBS $LIBS (as set at that point in configure.ac) # $4 = $PACKAGE_SUMMARY (or $1 Library) # $5 = $PACKAGE_CFLAGS (as set at the point in configure.ac) # $6 = $PACKAGE_LDFLAGS (as set at the point in configure.ac) # # PACKAGE_NAME defaults to $PACKAGE if not set. # PACKAGE_LIBS defaults to -l$PACKAGE_NAME if not set. # # The resulting file is called $PACKAGE.pc.in / $PACKAGE.pc # # You will find this macro most useful in conjunction with # ax_spec_defaults that can read good initializers from the .spec file. In # consequencd, most of the generatable installable stuff can be made from # information being updated in a single place for the whole project. # # LICENSE # # Copyright (c) 2008 Guido U. Draheim # Copyright (c) 2008 Sven Verdoolaege # # 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, the respective Autoconf Macro's copyright owner # gives unlimited permission to copy, distribute and modify the configure # scripts that are the output of Autoconf when processing the Macro. You # need not follow the terms of the GNU General Public License when using # or distributing such scripts, even though portions of the text of the # Macro appear in them. The GNU General Public License (GPL) does govern # all other use of the material that constitutes the Autoconf Macro. # # This special exception to the GPL applies to versions of the Autoconf # Macro released by the Autoconf Archive. When you make and distribute a # modified version of the Autoconf Macro, you may extend this special # exception to the GPL to apply to your modified version as well. #serial 12 AC_DEFUN([AX_CREATE_PKGCONFIG_INFO],[dnl AS_VAR_PUSHDEF([PKGCONFIG_suffix],[ax_create_pkgconfig_suffix])dnl AS_VAR_PUSHDEF([PKGCONFIG_libdir],[ax_create_pkgconfig_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_libfile],[ax_create_pkgconfig_libfile])dnl AS_VAR_PUSHDEF([PKGCONFIG_libname],[ax_create_pkgconfig_libname])dnl AS_VAR_PUSHDEF([PKGCONFIG_version],[ax_create_pkgconfig_version])dnl AS_VAR_PUSHDEF([PKGCONFIG_description],[ax_create_pkgconfig_description])dnl AS_VAR_PUSHDEF([PKGCONFIG_requires],[ax_create_pkgconfig_requires])dnl AS_VAR_PUSHDEF([PKGCONFIG_pkglibs],[ax_create_pkgconfig_pkglibs])dnl AS_VAR_PUSHDEF([PKGCONFIG_libs],[ax_create_pkgconfig_libs])dnl AS_VAR_PUSHDEF([PKGCONFIG_ldflags],[ax_create_pkgconfig_ldflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_cppflags],[ax_create_pkgconfig_cppflags])dnl AS_VAR_PUSHDEF([PKGCONFIG_generate],[ax_create_pkgconfig_generate])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_libdir],[ax_create_pkgconfig_src_libdir])dnl AS_VAR_PUSHDEF([PKGCONFIG_src_headers],[ax_create_pkgconfig_src_headers])dnl # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' AC_MSG_CHECKING(our pkgconfig libname) test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="ifelse($1,,${PACKAGE_NAME},`basename $1 .pc`)" test ".$PKGCONFIG_libname" != "." || \ PKGCONFIG_libname="$PACKAGE" PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` PKGCONFIG_libname=`eval echo "$PKGCONFIG_libname"` AC_MSG_RESULT($PKGCONFIG_libname) AC_MSG_CHECKING(our pkgconfig version) test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="${PACKAGE_VERSION}" test ".$PKGCONFIG_version" != "." || \ PKGCONFIG_version="$VERSION" PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` PKGCONFIG_version=`eval echo "$PKGCONFIG_version"` AC_MSG_RESULT($PKGCONFIG_version) AC_MSG_CHECKING(our pkgconfig_libdir) test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' PKGCONFIG_libdir=`eval echo "$pkgconfig_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` PKGCONFIG_libdir=`eval echo "$PKGCONFIG_libdir"` AC_MSG_RESULT($pkgconfig_libdir) test "$pkgconfig_libdir" != "$PKGCONFIG_libdir" && ( AC_MSG_RESULT(expanded our pkgconfig_libdir... $PKGCONFIG_libdir)) AC_SUBST([pkgconfig_libdir]) AC_MSG_CHECKING(our pkgconfig_libfile) test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="ifelse($1,,$PKGCONFIG_libname.pc,`basename $1`)" PKGCONFIG_libfile=`eval echo "$pkgconfig_libfile"` PKGCONFIG_libfile=`eval echo "$PKGCONFIG_libfile"` AC_MSG_RESULT($pkgconfig_libfile) test "$pkgconfig_libfile" != "$PKGCONFIG_libfile" && ( AC_MSG_RESULT(expanded our pkgconfig_libfile... $PKGCONFIG_libfile)) AC_SUBST([pkgconfig_libfile]) AC_MSG_CHECKING(our package / suffix) PKGCONFIG_suffix="$program_suffix" test ".$PKGCONFIG_suffix" != .NONE || PKGCONFIG_suffix="" AC_MSG_RESULT(${PACKAGE_NAME} / ${PKGCONFIG_suffix}) AC_MSG_CHECKING(our pkgconfig description) PKGCONFIG_description="ifelse($4,,$PACKAGE_SUMMARY,$4)" test ".$PKGCONFIG_description" != "." || \ PKGCONFIG_description="$PKGCONFIG_libname Library" PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` PKGCONFIG_description=`eval echo "$PKGCONFIG_description"` AC_MSG_RESULT($PKGCONFIG_description) AC_MSG_CHECKING(our pkgconfig requires) PKGCONFIG_requires="ifelse($2,,$PACKAGE_REQUIRES,$2)" PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` PKGCONFIG_requires=`eval echo "$PKGCONFIG_requires"` AC_MSG_RESULT($PKGCONFIG_requires) AC_MSG_CHECKING(our pkgconfig ext libs) PKGCONFIG_pkglibs="$PACKAGE_LIBS" test ".$PKGCONFIG_pkglibs" != "." || PKGCONFIG_pkglibs="-l$PKGCONFIG_libname" PKGCONFIG_libs="ifelse($3,,$PKGCONFIG_pkglibs $LIBS,$3)" PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` PKGCONFIG_libs=`eval echo "$PKGCONFIG_libs"` AC_MSG_RESULT($PKGCONFIG_libs) AC_MSG_CHECKING(our pkgconfig cppflags) PKGCONFIG_cppflags="ifelse($5,,$PACKAGE_CFLAGS,$5)" PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` PKGCONFIG_cppflags=`eval echo "$PKGCONFIG_cppflags"` AC_MSG_RESULT($PKGCONFIG_cppflags) AC_MSG_CHECKING(our pkgconfig ldflags) PKGCONFIG_ldflags="ifelse($6,,$PACKAGE_LDFLAGS,$5)" PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` PKGCONFIG_ldflags=`eval echo "$PKGCONFIG_ldflags"` AC_MSG_RESULT($PKGCONFIG_ldflags) test ".$PKGCONFIG_generate" != "." || \ PKGCONFIG_generate="ifelse($1,,$PKGCONFIG_libname.pc,$1)" PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` PKGCONFIG_generate=`eval echo "$PKGCONFIG_generate"` test "$pkgconfig_libfile" != "$PKGCONFIG_generate" && ( AC_MSG_RESULT(generate the pkgconfig later... $PKGCONFIG_generate)) if test ".$PKGCONFIG_src_libdir" = "." ; then PKGCONFIG_src_libdir=`pwd` PKGCONFIG_src_libdir=`AS_DIRNAME("$PKGCONFIG_src_libdir/$PKGCONFIG_generate")` test ! -d $PKGCONFIG_src_libdir/src || \ PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/src" case ".$objdir" in *libs) PKGCONFIG_src_libdir="$PKGCONFIG_src_libdir/$objdir" ;; esac AC_MSG_RESULT(noninstalled pkgconfig -L $PKGCONFIG_src_libdir) fi if test ".$PKGCONFIG_src_headers" = "." ; then PKGCONFIG_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) PKGCONFIG_src_headers="" ;; esac PKGCONFIG_src_headers=`AS_DIRNAME("$PKGCONFIG_src_headers/$v/x")` test ! -d $PKGCONFIG_src_headers/incl[]ude || \ PKGCONFIG_src_headers="$PKGCONFIG_src_headers/incl[]ude" AC_MSG_RESULT(noninstalled pkgconfig -I $PKGCONFIG_src_headers) fi dnl AC_CONFIG_COMMANDS crap disallows to use $PKGCONFIG_libfile here... AC_CONFIG_COMMANDS([$ax_create_pkgconfig_generate],[ pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then AC_MSG_NOTICE(creating $pkgconfig_generate.in) cat > $pkgconfig_generate.in <conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then AC_MSG_ERROR([$pkgconfig_generate is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` AC_MSG_NOTICE(creating $pkgconfig_uninstalled) cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then AC_MSG_ERROR([$pkgconfig_uninstalled is empty]) fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ],[ dnl AC_CONFIG_COMMANDS crap, the AS_PUSHVAR defines are invalid here... ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' ])dnl AS_VAR_POPDEF([PKGCONFIG_suffix])dnl AS_VAR_POPDEF([PKGCONFIG_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_libfile])dnl AS_VAR_POPDEF([PKGCONFIG_libname])dnl AS_VAR_POPDEF([PKGCONFIG_version])dnl AS_VAR_POPDEF([PKGCONFIG_description])dnl AS_VAR_POPDEF([PKGCONFIG_requires])dnl AS_VAR_POPDEF([PKGCONFIG_pkglibs])dnl AS_VAR_POPDEF([PKGCONFIG_libs])dnl AS_VAR_POPDEF([PKGCONFIG_ldflags])dnl AS_VAR_POPDEF([PKGCONFIG_cppflags])dnl AS_VAR_POPDEF([PKGCONFIG_generate])dnl AS_VAR_POPDEF([PKGCONFIG_src_libdir])dnl AS_VAR_POPDEF([PKGCONFIG_src_headers])dnl ]) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/m4/ltversion.m40000644000175000017500000000126212346122566025064 0ustar zoncazonca00000000000000# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # @configure_input@ # serial 3337 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.4.2]) m4_define([LT_PACKAGE_REVISION], [1.3337]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.4.2' macro_revision='1.3337' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/m4/ltsugar.m40000644000175000017500000001042412346122566024520 0ustar zoncazonca00000000000000# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltsugar.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) # lt_join(SEP, ARG1, [ARG2...]) # ----------------------------- # Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their # associated separator. # Needed until we can rely on m4_join from Autoconf 2.62, since all earlier # versions in m4sugar had bugs. m4_define([lt_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) m4_define([_lt_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) # lt_car(LIST) # lt_cdr(LIST) # ------------ # Manipulate m4 lists. # These macros are necessary as long as will still need to support # Autoconf-2.59 which quotes differently. m4_define([lt_car], [[$1]]) m4_define([lt_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) m4_define([lt_unquote], $1) # lt_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'. # Note that neither SEPARATOR nor STRING are expanded; they are appended # to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). # No SEPARATOR is output if MACRO-NAME was previously undefined (different # than defined and empty). # # This macro is needed until we can rely on Autoconf 2.62, since earlier # versions of m4sugar mistakenly expanded SEPARATOR but not STRING. m4_define([lt_append], [m4_define([$1], m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) # lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) # ---------------------------------------------------------- # Produce a SEP delimited list of all paired combinations of elements of # PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list # has the form PREFIXmINFIXSUFFIXn. # Needed until we can rely on m4_combine added in Autoconf 2.62. m4_define([lt_combine], [m4_if(m4_eval([$# > 3]), [1], [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl [[m4_foreach([_Lt_prefix], [$2], [m4_foreach([_Lt_suffix], ]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[, [_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])]) # lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) # ----------------------------------------------------------------------- # Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited # by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. m4_define([lt_if_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], [lt_append([$1], [$2], [$3])$4], [$5])], [lt_append([$1], [$2], [$3])$4])]) # lt_dict_add(DICT, KEY, VALUE) # ----------------------------- m4_define([lt_dict_add], [m4_define([$1($2)], [$3])]) # lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) # -------------------------------------------- m4_define([lt_dict_add_subkey], [m4_define([$1($2:$3)], [$4])]) # lt_dict_fetch(DICT, KEY, [SUBKEY]) # ---------------------------------- m4_define([lt_dict_fetch], [m4_ifval([$3], m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) # lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------------------- m4_define([lt_if_dict_fetch], [m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], [$5], [$6])]) # lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) # -------------------------------------------------------------- m4_define([lt_dict_filter], [m4_if([$5], [], [], [lt_join(m4_quote(m4_default([$4], [[, ]])), lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl ]) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/m4/libtool.m40000644000175000017500000106011112346122566024502 0ustar zoncazonca00000000000000# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. m4_define([_LT_COPYING], [dnl # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. ]) # serial 57 LT_INIT # LT_PREREQ(VERSION) # ------------------ # Complain and exit if this libtool version is less that VERSION. m4_defun([LT_PREREQ], [m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1, [m4_default([$3], [m4_fatal([Libtool version $1 or higher is required], 63)])], [$2])]) # _LT_CHECK_BUILDDIR # ------------------ # Complain if the absolute build directory name contains unusual characters m4_defun([_LT_CHECK_BUILDDIR], [case `pwd` in *\ * | *\ *) AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;; esac ]) # LT_INIT([OPTIONS]) # ------------------ AC_DEFUN([LT_INIT], [AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl AC_BEFORE([$0], [LT_LANG])dnl AC_BEFORE([$0], [LT_OUTPUT])dnl AC_BEFORE([$0], [LTDL_INIT])dnl m4_require([_LT_CHECK_BUILDDIR])dnl dnl Autoconf doesn't catch unexpanded LT_ macros by default: m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4 dnl unless we require an AC_DEFUNed macro: AC_REQUIRE([LTOPTIONS_VERSION])dnl AC_REQUIRE([LTSUGAR_VERSION])dnl AC_REQUIRE([LTVERSION_VERSION])dnl AC_REQUIRE([LTOBSOLETE_VERSION])dnl m4_require([_LT_PROG_LTMAIN])dnl _LT_SHELL_INIT([SHELL=${CONFIG_SHELL-/bin/sh}]) dnl Parse OPTIONS _LT_SET_OPTIONS([$0], [$1]) # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' AC_SUBST(LIBTOOL)dnl _LT_SETUP # Only expand once: m4_define([LT_INIT]) ])# LT_INIT # Old names: AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT]) AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PROG_LIBTOOL], []) dnl AC_DEFUN([AM_PROG_LIBTOOL], []) # _LT_CC_BASENAME(CC) # ------------------- # Calculate cc_basename. Skip known compiler wrappers and cross-prefix. m4_defun([_LT_CC_BASENAME], [for cc_temp in $1""; do case $cc_temp in compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;; distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` ]) # _LT_FILEUTILS_DEFAULTS # ---------------------- # It is okay to use these file commands and assume they have been set # sensibly after `m4_require([_LT_FILEUTILS_DEFAULTS])'. m4_defun([_LT_FILEUTILS_DEFAULTS], [: ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} ])# _LT_FILEUTILS_DEFAULTS # _LT_SETUP # --------- m4_defun([_LT_SETUP], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_REQUIRE([_LT_PREPARE_SED_QUOTE_VARS])dnl AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl _LT_DECL([], [PATH_SEPARATOR], [1], [The PATH separator for the build system])dnl dnl _LT_DECL([], [host_alias], [0], [The host system])dnl _LT_DECL([], [host], [0])dnl _LT_DECL([], [host_os], [0])dnl dnl _LT_DECL([], [build_alias], [0], [The build system])dnl _LT_DECL([], [build], [0])dnl _LT_DECL([], [build_os], [0])dnl dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl dnl AC_REQUIRE([AC_PROG_LN_S])dnl test -z "$LN_S" && LN_S="ln -s" _LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl dnl AC_REQUIRE([LT_CMD_MAX_LEN])dnl _LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl _LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl m4_require([_LT_PATH_CONVERSION_FUNCTIONS])dnl m4_require([_LT_CMD_RELOAD])dnl m4_require([_LT_CHECK_MAGIC_METHOD])dnl m4_require([_LT_CHECK_SHAREDLIB_FROM_LINKLIB])dnl m4_require([_LT_CMD_OLD_ARCHIVE])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_WITH_SYSROOT])dnl _LT_CONFIG_LIBTOOL_INIT([ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi ]) if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi _LT_CHECK_OBJDIR m4_require([_LT_TAG_COMPILER])dnl case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o _LT_CC_BASENAME([$compiler]) # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then _LT_PATH_MAGIC fi ;; esac # Use C for the default configuration in the libtool script LT_SUPPORTED_TAG([CC]) _LT_LANG_C_CONFIG _LT_LANG_DEFAULT_CONFIG _LT_CONFIG_COMMANDS ])# _LT_SETUP # _LT_PREPARE_SED_QUOTE_VARS # -------------------------- # Define a few sed substitution that help us do robust quoting. m4_defun([_LT_PREPARE_SED_QUOTE_VARS], [# Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\([["`$\\]]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([["`\\]]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ]) # _LT_PROG_LTMAIN # --------------- # Note that this code is called both from `configure', and `config.status' # now that we use AC_CONFIG_COMMANDS to generate libtool. Notably, # `config.status' has no value for ac_aux_dir unless we are using Automake, # so we pass a copy along to make sure it has a sensible value anyway. m4_defun([_LT_PROG_LTMAIN], [m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl _LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir']) ltmain="$ac_aux_dir/ltmain.sh" ])# _LT_PROG_LTMAIN ## ------------------------------------- ## ## Accumulate code for creating libtool. ## ## ------------------------------------- ## # So that we can recreate a full libtool script including additional # tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS # in macros and then make a single call at the end using the `libtool' # label. # _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS]) # ---------------------------------------- # Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL_INIT], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_INIT], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_INIT]) # _LT_CONFIG_LIBTOOL([COMMANDS]) # ------------------------------ # Register COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS]) # _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS]) # ----------------------------------------------------- m4_defun([_LT_CONFIG_SAVE_COMMANDS], [_LT_CONFIG_LIBTOOL([$1]) _LT_CONFIG_LIBTOOL_INIT([$2]) ]) # _LT_FORMAT_COMMENT([COMMENT]) # ----------------------------- # Add leading comment marks to the start of each line, and a trailing # full-stop to the whole comment if one is not present already. m4_define([_LT_FORMAT_COMMENT], [m4_ifval([$1], [ m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])], [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.]) )]) ## ------------------------ ## ## FIXME: Eliminate VARNAME ## ## ------------------------ ## # _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?]) # ------------------------------------------------------------------- # CONFIGNAME is the name given to the value in the libtool script. # VARNAME is the (base) name used in the configure script. # VALUE may be 0, 1 or 2 for a computed quote escaped value based on # VARNAME. Any other value will be used directly. m4_define([_LT_DECL], [lt_if_append_uniq([lt_decl_varnames], [$2], [, ], [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name], [m4_ifval([$1], [$1], [$2])]) lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3]) m4_ifval([$4], [lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])]) lt_dict_add_subkey([lt_decl_dict], [$2], [tagged?], [m4_ifval([$5], [yes], [no])])]) ]) # _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION]) # -------------------------------------------------------- m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])]) # lt_decl_tag_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_tag_varnames], [_lt_decl_filter([tagged?], [yes], $@)]) # _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..]) # --------------------------------------------------------- m4_define([_lt_decl_filter], [m4_case([$#], [0], [m4_fatal([$0: too few arguments: $#])], [1], [m4_fatal([$0: too few arguments: $#: $1])], [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)], [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)], [lt_dict_filter([lt_decl_dict], $@)])[]dnl ]) # lt_decl_quote_varnames([SEPARATOR], [VARNAME1...]) # -------------------------------------------------- m4_define([lt_decl_quote_varnames], [_lt_decl_filter([value], [1], $@)]) # lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_dquote_varnames], [_lt_decl_filter([value], [2], $@)]) # lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_varnames_tagged], [m4_assert([$# <= 2])dnl _$0(m4_quote(m4_default([$1], [[, ]])), m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]), m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))]) m4_define([_lt_decl_varnames_tagged], [m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])]) # lt_decl_all_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_all_varnames], [_$0(m4_quote(m4_default([$1], [[, ]])), m4_if([$2], [], m4_quote(lt_decl_varnames), m4_quote(m4_shift($@))))[]dnl ]) m4_define([_lt_decl_all_varnames], [lt_join($@, lt_decl_varnames_tagged([$1], lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl ]) # _LT_CONFIG_STATUS_DECLARE([VARNAME]) # ------------------------------------ # Quote a variable value, and forward it to `config.status' so that its # declaration there will have the same value as in `configure'. VARNAME # must have a single quote delimited value for this to work. m4_define([_LT_CONFIG_STATUS_DECLARE], [$1='`$ECHO "$][$1" | $SED "$delay_single_quote_subst"`']) # _LT_CONFIG_STATUS_DECLARATIONS # ------------------------------ # We delimit libtool config variables with single quotes, so when # we write them to config.status, we have to be sure to quote all # embedded single quotes properly. In configure, this macro expands # each variable declared with _LT_DECL (and _LT_TAGDECL) into: # # ='`$ECHO "$" | $SED "$delay_single_quote_subst"`' m4_defun([_LT_CONFIG_STATUS_DECLARATIONS], [m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames), [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAGS # ---------------- # Output comment and list of tags supported by the script m4_defun([_LT_LIBTOOL_TAGS], [_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl available_tags="_LT_TAGS"dnl ]) # _LT_LIBTOOL_DECLARE(VARNAME, [TAG]) # ----------------------------------- # Extract the dictionary values for VARNAME (optionally with TAG) and # expand to a commented shell variable setting: # # # Some comment about what VAR is for. # visible_name=$lt_internal_name m4_define([_LT_LIBTOOL_DECLARE], [_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [description])))[]dnl m4_pushdef([_libtool_name], m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])), [0], [_libtool_name=[$]$1], [1], [_libtool_name=$lt_[]$1], [2], [_libtool_name=$lt_[]$1], [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl ]) # _LT_LIBTOOL_CONFIG_VARS # ----------------------- # Produce commented declarations of non-tagged libtool config variables # suitable for insertion in the LIBTOOL CONFIG section of the `libtool' # script. Tagged libtool config variables (even for the LIBTOOL CONFIG # section) are produced by _LT_LIBTOOL_TAG_VARS. m4_defun([_LT_LIBTOOL_CONFIG_VARS], [m4_foreach([_lt_var], m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAG_VARS(TAG) # ------------------------- m4_define([_LT_LIBTOOL_TAG_VARS], [m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])]) # _LT_TAGVAR(VARNAME, [TAGNAME]) # ------------------------------ m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])]) # _LT_CONFIG_COMMANDS # ------------------- # Send accumulated output to $CONFIG_STATUS. Thanks to the lists of # variables for single and double quote escaping we saved from calls # to _LT_DECL, we can put quote escaped variables declarations # into `config.status', and then the shell code to quote escape them in # for loops in `config.status'. Finally, any additional code accumulated # from calls to _LT_CONFIG_LIBTOOL_INIT is expanded. m4_defun([_LT_CONFIG_COMMANDS], [AC_PROVIDE_IFELSE([LT_OUTPUT], dnl If the libtool generation code has been placed in $CONFIG_LT, dnl instead of duplicating it all over again into config.status, dnl then we will have config.status run $CONFIG_LT later, so it dnl needs to know what name is stored there: [AC_CONFIG_COMMANDS([libtool], [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])], dnl If the libtool generation code is destined for config.status, dnl expand the accumulated commands and init code now: [AC_CONFIG_COMMANDS([libtool], [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])]) ])#_LT_CONFIG_COMMANDS # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT], [ # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' _LT_CONFIG_STATUS_DECLARATIONS LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$[]1 _LTECHO_EOF' } # Quote evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_quote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_dquote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done _LT_OUTPUT_LIBTOOL_INIT ]) # _LT_GENERATED_FILE_INIT(FILE, [COMMENT]) # ------------------------------------ # Generate a child script FILE with all initialization necessary to # reuse the environment learned by the parent script, and make the # file executable. If COMMENT is supplied, it is inserted after the # `#!' sequence but before initialization text begins. After this # macro, additional text can be appended to FILE to form the body of # the child script. The macro ends with non-zero status if the # file could not be fully written (such as if the disk is full). m4_ifdef([AS_INIT_GENERATED], [m4_defun([_LT_GENERATED_FILE_INIT],[AS_INIT_GENERATED($@)])], [m4_defun([_LT_GENERATED_FILE_INIT], [m4_require([AS_PREPARE])]dnl [m4_pushdef([AS_MESSAGE_LOG_FD])]dnl [lt_write_fail=0 cat >$1 <<_ASEOF || lt_write_fail=1 #! $SHELL # Generated by $as_me. $2 SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$1 <<\_ASEOF || lt_write_fail=1 AS_SHELL_SANITIZE _AS_PREPARE exec AS_MESSAGE_FD>&1 _ASEOF test $lt_write_fail = 0 && chmod +x $1[]dnl m4_popdef([AS_MESSAGE_LOG_FD])])])# _LT_GENERATED_FILE_INIT # LT_OUTPUT # --------- # This macro allows early generation of the libtool script (before # AC_OUTPUT is called), incase it is used in configure for compilation # tests. AC_DEFUN([LT_OUTPUT], [: ${CONFIG_LT=./config.lt} AC_MSG_NOTICE([creating $CONFIG_LT]) _LT_GENERATED_FILE_INIT(["$CONFIG_LT"], [# Run this file to recreate a libtool stub with the current configuration.]) cat >>"$CONFIG_LT" <<\_LTEOF lt_cl_silent=false exec AS_MESSAGE_LOG_FD>>config.log { echo AS_BOX([Running $as_me.]) } >&AS_MESSAGE_LOG_FD lt_cl_help="\ \`$as_me' creates a local libtool stub from the current configuration, for use in further configure time tests before the real libtool is generated. Usage: $[0] [[OPTIONS]] -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files Report bugs to ." lt_cl_version="\ m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION]) configured by $[0], generated by m4_PACKAGE_STRING. Copyright (C) 2011 Free Software Foundation, Inc. This config.lt script is free software; the Free Software Foundation gives unlimited permision to copy, distribute and modify it." while test $[#] != 0 do case $[1] in --version | --v* | -V ) echo "$lt_cl_version"; exit 0 ;; --help | --h* | -h ) echo "$lt_cl_help"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --quiet | --q* | --silent | --s* | -q ) lt_cl_silent=: ;; -*) AC_MSG_ERROR([unrecognized option: $[1] Try \`$[0] --help' for more information.]) ;; *) AC_MSG_ERROR([unrecognized argument: $[1] Try \`$[0] --help' for more information.]) ;; esac shift done if $lt_cl_silent; then exec AS_MESSAGE_FD>/dev/null fi _LTEOF cat >>"$CONFIG_LT" <<_LTEOF _LT_OUTPUT_LIBTOOL_COMMANDS_INIT _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AC_MSG_NOTICE([creating $ofile]) _LT_OUTPUT_LIBTOOL_COMMANDS AS_EXIT(0) _LTEOF chmod +x "$CONFIG_LT" # configure is writing to config.log, but config.lt does its own redirection, # appending to config.log, which fails on DOS, as config.log is still kept # open by configure. Here we exec the FD to /dev/null, effectively closing # config.log, so it can be properly (re)opened and appended to by config.lt. lt_cl_success=: test "$silent" = yes && lt_config_lt_args="$lt_config_lt_args --quiet" exec AS_MESSAGE_LOG_FD>/dev/null $SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false exec AS_MESSAGE_LOG_FD>>config.log $lt_cl_success || AS_EXIT(1) ])# LT_OUTPUT # _LT_CONFIG(TAG) # --------------- # If TAG is the built-in tag, create an initial libtool script with a # default configuration from the untagged config vars. Otherwise add code # to config.status for appending the configuration named by TAG from the # matching tagged config vars. m4_defun([_LT_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_CONFIG_SAVE_COMMANDS([ m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl m4_if(_LT_TAG, [C], [ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # _LT_COPYING _LT_LIBTOOL_TAGS # ### BEGIN LIBTOOL CONFIG _LT_LIBTOOL_CONFIG_VARS _LT_LIBTOOL_TAG_VARS # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac _LT_PROG_LTMAIN # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) _LT_PROG_REPLACE_SHELLFNS mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ], [cat <<_LT_EOF >> "$ofile" dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded dnl in a comment (ie after a #). # ### BEGIN LIBTOOL TAG CONFIG: $1 _LT_LIBTOOL_TAG_VARS(_LT_TAG) # ### END LIBTOOL TAG CONFIG: $1 _LT_EOF ])dnl /m4_if ], [m4_if([$1], [], [ PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile'], []) ])dnl /_LT_CONFIG_SAVE_COMMANDS ])# _LT_CONFIG # LT_SUPPORTED_TAG(TAG) # --------------------- # Trace this macro to discover what tags are supported by the libtool # --tag option, using: # autoconf --trace 'LT_SUPPORTED_TAG:$1' AC_DEFUN([LT_SUPPORTED_TAG], []) # C support is built-in for now m4_define([_LT_LANG_C_enabled], []) m4_define([_LT_TAGS], []) # LT_LANG(LANG) # ------------- # Enable libtool support for the given language if not already enabled. AC_DEFUN([LT_LANG], [AC_BEFORE([$0], [LT_OUTPUT])dnl m4_case([$1], [C], [_LT_LANG(C)], [C++], [_LT_LANG(CXX)], [Go], [_LT_LANG(GO)], [Java], [_LT_LANG(GCJ)], [Fortran 77], [_LT_LANG(F77)], [Fortran], [_LT_LANG(FC)], [Windows Resource], [_LT_LANG(RC)], [m4_ifdef([_LT_LANG_]$1[_CONFIG], [_LT_LANG($1)], [m4_fatal([$0: unsupported language: "$1"])])])dnl ])# LT_LANG # _LT_LANG(LANGNAME) # ------------------ m4_defun([_LT_LANG], [m4_ifdef([_LT_LANG_]$1[_enabled], [], [LT_SUPPORTED_TAG([$1])dnl m4_append([_LT_TAGS], [$1 ])dnl m4_define([_LT_LANG_]$1[_enabled], [])dnl _LT_LANG_$1_CONFIG($1)])dnl ])# _LT_LANG m4_ifndef([AC_PROG_GO], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_GO. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_GO], [AC_LANG_PUSH(Go)dnl AC_ARG_VAR([GOC], [Go compiler command])dnl AC_ARG_VAR([GOFLAGS], [Go compiler flags])dnl _AC_ARG_VAR_LDFLAGS()dnl AC_CHECK_TOOL(GOC, gccgo) if test -z "$GOC"; then if test -n "$ac_tool_prefix"; then AC_CHECK_PROG(GOC, [${ac_tool_prefix}gccgo], [${ac_tool_prefix}gccgo]) fi fi if test -z "$GOC"; then AC_CHECK_PROG(GOC, gccgo, gccgo, false) fi ])#m4_defun ])#m4_ifndef # _LT_LANG_DEFAULT_CONFIG # ----------------------- m4_defun([_LT_LANG_DEFAULT_CONFIG], [AC_PROVIDE_IFELSE([AC_PROG_CXX], [LT_LANG(CXX)], [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])]) AC_PROVIDE_IFELSE([AC_PROG_F77], [LT_LANG(F77)], [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])]) AC_PROVIDE_IFELSE([AC_PROG_FC], [LT_LANG(FC)], [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])]) dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal dnl pulling things in needlessly. AC_PROVIDE_IFELSE([AC_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([A][M_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([LT_PROG_GCJ], [LT_LANG(GCJ)], [m4_ifdef([AC_PROG_GCJ], [m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([A][M_PROG_GCJ], [m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([LT_PROG_GCJ], [m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])]) AC_PROVIDE_IFELSE([AC_PROG_GO], [LT_LANG(GO)], [m4_define([AC_PROG_GO], defn([AC_PROG_GO])[LT_LANG(GO)])]) AC_PROVIDE_IFELSE([LT_PROG_RC], [LT_LANG(RC)], [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])]) ])# _LT_LANG_DEFAULT_CONFIG # Obsolete macros: AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)]) AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)]) AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)]) AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)]) AU_DEFUN([AC_LIBTOOL_RC], [LT_LANG(Windows Resource)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_CXX], []) dnl AC_DEFUN([AC_LIBTOOL_F77], []) dnl AC_DEFUN([AC_LIBTOOL_FC], []) dnl AC_DEFUN([AC_LIBTOOL_GCJ], []) dnl AC_DEFUN([AC_LIBTOOL_RC], []) # _LT_TAG_COMPILER # ---------------- m4_defun([_LT_TAG_COMPILER], [AC_REQUIRE([AC_PROG_CC])dnl _LT_DECL([LTCC], [CC], [1], [A C compiler])dnl _LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl _LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl _LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC ])# _LT_TAG_COMPILER # _LT_COMPILER_BOILERPLATE # ------------------------ # Check for compiler boilerplate output or warnings with # the simple compiler test code. m4_defun([_LT_COMPILER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ])# _LT_COMPILER_BOILERPLATE # _LT_LINKER_BOILERPLATE # ---------------------- # Check for linker boilerplate output or warnings with # the simple link test code. m4_defun([_LT_LINKER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ])# _LT_LINKER_BOILERPLATE # _LT_REQUIRED_DARWIN_CHECKS # ------------------------- m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[ case $host_os in rhapsody* | darwin*) AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:]) AC_CHECK_TOOL([NMEDIT], [nmedit], [:]) AC_CHECK_TOOL([LIPO], [lipo], [:]) AC_CHECK_TOOL([OTOOL], [otool], [:]) AC_CHECK_TOOL([OTOOL64], [otool64], [:]) _LT_DECL([], [DSYMUTIL], [1], [Tool to manipulate archived DWARF debug symbol files on Mac OS X]) _LT_DECL([], [NMEDIT], [1], [Tool to change global to local symbols on Mac OS X]) _LT_DECL([], [LIPO], [1], [Tool to manipulate fat objects and archives on Mac OS X]) _LT_DECL([], [OTOOL], [1], [ldd/readelf like tool for Mach-O binaries on Mac OS X]) _LT_DECL([], [OTOOL64], [1], [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4]) AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod], [lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test $_lt_result -eq 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -rf libconftest.dylib* rm -f conftest.* fi]) AC_CACHE_CHECK([for -exported_symbols_list linker flag], [lt_cv_ld_exported_symbols_list], [lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [lt_cv_ld_exported_symbols_list=yes], [lt_cv_ld_exported_symbols_list=no]) LDFLAGS="$save_LDFLAGS" ]) AC_CACHE_CHECK([for -force_load linker flag],[lt_cv_ld_force_load], [lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&AS_MESSAGE_LOG_FD echo "$AR cru libconftest.a conftest.o" >&AS_MESSAGE_LOG_FD $AR cru libconftest.a conftest.o 2>&AS_MESSAGE_LOG_FD echo "$RANLIB libconftest.a" >&AS_MESSAGE_LOG_FD $RANLIB libconftest.a 2>&AS_MESSAGE_LOG_FD cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then lt_cv_ld_force_load=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM ]) case $host_os in rhapsody* | darwin1.[[012]]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[[91]]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[[012]]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":" && test "$lt_cv_ld_force_load" = "no"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ]) # _LT_DARWIN_LINKER_FEATURES([TAG]) # --------------------------------- # Checks for linker and compiler features on darwin m4_defun([_LT_DARWIN_LINKER_FEATURES], [ m4_require([_LT_REQUIRED_DARWIN_CHECKS]) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported if test "$lt_cv_ld_force_load" = "yes"; then _LT_TAGVAR(whole_archive_flag_spec, $1)='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' m4_case([$1], [F77], [_LT_TAGVAR(compiler_needs_object, $1)=yes], [FC], [_LT_TAGVAR(compiler_needs_object, $1)=yes]) else _LT_TAGVAR(whole_archive_flag_spec, $1)='' fi _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=func_echo_all _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" m4_if([$1], [CXX], [ if test "$lt_cv_apple_cc_single_mod" != "yes"; then _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi ],[]) else _LT_TAGVAR(ld_shlibs, $1)=no fi ]) # _LT_SYS_MODULE_PATH_AIX([TAGNAME]) # ---------------------------------- # Links a minimal program and checks the executable # for the system default hardcoded library path. In most cases, # this is /usr/lib:/lib, but when the MPI compilers are used # the location of the communication and MPI libs are included too. # If we don't find anything, use the default library path according # to the aix ld manual. # Store the results from the different compilers for each TAGNAME. # Allow to override them for all tags through lt_cv_aix_libpath. m4_defun([_LT_SYS_MODULE_PATH_AIX], [m4_require([_LT_DECL_SED])dnl if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else AC_CACHE_VAL([_LT_TAGVAR([lt_cv_aix_libpath_], [$1])], [AC_LINK_IFELSE([AC_LANG_PROGRAM],[ lt_aix_libpath_sed='[ /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }]' _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi],[]) if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])="/usr/lib:/lib" fi ]) aix_libpath=$_LT_TAGVAR([lt_cv_aix_libpath_], [$1]) fi ])# _LT_SYS_MODULE_PATH_AIX # _LT_SHELL_INIT(ARG) # ------------------- m4_define([_LT_SHELL_INIT], [m4_divert_text([M4SH-INIT], [$1 ])])# _LT_SHELL_INIT # _LT_PROG_ECHO_BACKSLASH # ----------------------- # Find how we can fake an echo command that does not interpret backslash. # In particular, with Autoconf 2.60 or later we add some code to the start # of the generated configure script which will find a shell with a builtin # printf (which we can use as an echo command). m4_defun([_LT_PROG_ECHO_BACKSLASH], [ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO AC_MSG_CHECKING([how to print strings]) # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $[]1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } case "$ECHO" in printf*) AC_MSG_RESULT([printf]) ;; print*) AC_MSG_RESULT([print -r]) ;; *) AC_MSG_RESULT([cat]) ;; esac m4_ifdef([_AS_DETECT_SUGGESTED], [_AS_DETECT_SUGGESTED([ test -n "${ZSH_VERSION+set}${BASH_VERSION+set}" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test "X`printf %s $ECHO`" = "X$ECHO" \ || test "X`print -r -- $ECHO`" = "X$ECHO" )])]) _LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts]) _LT_DECL([], [ECHO], [1], [An echo program that protects backslashes]) ])# _LT_PROG_ECHO_BACKSLASH # _LT_WITH_SYSROOT # ---------------- AC_DEFUN([_LT_WITH_SYSROOT], [AC_MSG_CHECKING([for sysroot]) AC_ARG_WITH([sysroot], [ --with-sysroot[=DIR] Search for dependent libraries within DIR (or the compiler's sysroot if not specified).], [], [with_sysroot=no]) dnl lt_sysroot will always be passed unquoted. We quote it here dnl in case the user passed a directory name. lt_sysroot= case ${with_sysroot} in #( yes) if test "$GCC" = yes; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) AC_MSG_RESULT([${with_sysroot}]) AC_MSG_ERROR([The sysroot must be an absolute path.]) ;; esac AC_MSG_RESULT([${lt_sysroot:-no}]) _LT_DECL([], [lt_sysroot], [0], [The root where to search for ]dnl [dependent libraries, and in which our libraries should be installed.])]) # _LT_ENABLE_LOCK # --------------- m4_defun([_LT_ENABLE_LOCK], [AC_ARG_ENABLE([libtool-lock], [AS_HELP_STRING([--disable-libtool-lock], [avoid locking (might break parallel builds)])]) test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf, [AC_LANG_PUSH(C) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no]) AC_LANG_POP]) if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD="${LD-ld}_sol2" fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" ])# _LT_ENABLE_LOCK # _LT_PROG_AR # ----------- m4_defun([_LT_PROG_AR], [AC_CHECK_TOOLS(AR, [ar], false) : ${AR=ar} : ${AR_FLAGS=cru} _LT_DECL([], [AR], [1], [The archiver]) _LT_DECL([], [AR_FLAGS], [1], [Flags to create an archive]) AC_CACHE_CHECK([for archiver @FILE support], [lt_cv_ar_at_file], [lt_cv_ar_at_file=no AC_COMPILE_IFELSE([AC_LANG_PROGRAM], [echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&AS_MESSAGE_LOG_FD' AC_TRY_EVAL([lt_ar_try]) if test "$ac_status" -eq 0; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a AC_TRY_EVAL([lt_ar_try]) if test "$ac_status" -ne 0; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a ]) ]) if test "x$lt_cv_ar_at_file" = xno; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi _LT_DECL([], [archiver_list_spec], [1], [How to feed a file listing to the archiver]) ])# _LT_PROG_AR # _LT_CMD_OLD_ARCHIVE # ------------------- m4_defun([_LT_CMD_OLD_ARCHIVE], [_LT_PROG_AR AC_CHECK_TOOL(STRIP, strip, :) test -z "$STRIP" && STRIP=: _LT_DECL([], [STRIP], [1], [A symbol stripping program]) AC_CHECK_TOOL(RANLIB, ranlib, :) test -z "$RANLIB" && RANLIB=: _LT_DECL([], [RANLIB], [1], [Commands used to install an old-style archive]) # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac _LT_DECL([], [old_postinstall_cmds], [2]) _LT_DECL([], [old_postuninstall_cmds], [2]) _LT_TAGDECL([], [old_archive_cmds], [2], [Commands used to build an old-style archive]) _LT_DECL([], [lock_old_archive_extraction], [0], [Whether to use a lock for old archive extraction]) ])# _LT_CMD_OLD_ARCHIVE # _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------------------- # Check whether the given compiler option works AC_DEFUN([_LT_COMPILER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4]) echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$3" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi fi $RM conftest* ]) if test x"[$]$2" = xyes; then m4_if([$5], , :, [$5]) else m4_if([$6], , :, [$6]) fi ])# _LT_COMPILER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], []) # _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------- # Check whether the given linker option works AC_DEFUN([_LT_LINKER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $3" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&AS_MESSAGE_LOG_FD $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi else $2=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" ]) if test x"[$]$2" = xyes; then m4_if([$4], , :, [$4]) else m4_if([$5], , :, [$5]) fi ])# _LT_LINKER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], []) # LT_CMD_MAX_LEN #--------------- AC_DEFUN([LT_CMD_MAX_LEN], [AC_REQUIRE([AC_CANONICAL_HOST])dnl # find the maximum length of command line arguments AC_MSG_CHECKING([the maximum length of command line arguments]) AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[ ]]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac ]) if test -n $lt_cv_sys_max_cmd_len ; then AC_MSG_RESULT($lt_cv_sys_max_cmd_len) else AC_MSG_RESULT(none) fi max_cmd_len=$lt_cv_sys_max_cmd_len _LT_DECL([], [max_cmd_len], [0], [What is the maximum length of a command?]) ])# LT_CMD_MAX_LEN # Old name: AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], []) # _LT_HEADER_DLFCN # ---------------- m4_defun([_LT_HEADER_DLFCN], [AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl ])# _LT_HEADER_DLFCN # _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE, # ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING) # ---------------------------------------------------------------- m4_defun([_LT_TRY_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "$cross_compiling" = yes; then : [$4] else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF [#line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; }] _LT_EOF if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) $1 ;; x$lt_dlneed_uscore) $2 ;; x$lt_dlunknown|x*) $3 ;; esac else : # compilation failed $3 fi fi rm -fr conftest* ])# _LT_TRY_DLOPEN_SELF # LT_SYS_DLOPEN_SELF # ------------------ AC_DEFUN([LT_SYS_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[ lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ]) ;; *) AC_CHECK_FUNC([shl_load], [lt_cv_dlopen="shl_load"], [AC_CHECK_LIB([dld], [shl_load], [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld"], [AC_CHECK_FUNC([dlopen], [lt_cv_dlopen="dlopen"], [AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"], [AC_CHECK_LIB([svld], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"], [AC_CHECK_LIB([dld], [dld_link], [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld"]) ]) ]) ]) ]) ]) ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" AC_CACHE_CHECK([whether a program can dlopen itself], lt_cv_dlopen_self, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes, lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross) ]) if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" AC_CACHE_CHECK([whether a statically linked program can dlopen itself], lt_cv_dlopen_self_static, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross) ]) fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi _LT_DECL([dlopen_support], [enable_dlopen], [0], [Whether dlopen is supported]) _LT_DECL([dlopen_self], [enable_dlopen_self], [0], [Whether dlopen of programs is supported]) _LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0], [Whether dlopen of statically linked programs is supported]) ])# LT_SYS_DLOPEN_SELF # Old name: AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], []) # _LT_COMPILER_C_O([TAGNAME]) # --------------------------- # Check to see if options -c and -o are simultaneously supported by compiler. # This macro does not hard code the compiler like AC_PROG_CC_C_O. m4_defun([_LT_COMPILER_C_O], [m4_require([_LT_DECL_SED])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes fi fi chmod u+w . 2>&AS_MESSAGE_LOG_FD $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* ]) _LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1], [Does compiler simultaneously support -c and -o options?]) ])# _LT_COMPILER_C_O # _LT_COMPILER_FILE_LOCKS([TAGNAME]) # ---------------------------------- # Check to see if we can do hard links to lock some files if needed m4_defun([_LT_COMPILER_FILE_LOCKS], [m4_require([_LT_ENABLE_LOCK])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_COMPILER_C_O([$1]) hard_links="nottested" if test "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user AC_MSG_CHECKING([if we can lock with hard links]) hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no AC_MSG_RESULT([$hard_links]) if test "$hard_links" = no; then AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe]) need_locks=warn fi else need_locks=no fi _LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?]) ])# _LT_COMPILER_FILE_LOCKS # _LT_CHECK_OBJDIR # ---------------- m4_defun([_LT_CHECK_OBJDIR], [AC_CACHE_CHECK([for objdir], [lt_cv_objdir], [rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null]) objdir=$lt_cv_objdir _LT_DECL([], [objdir], [0], [The name of the directory that contains temporary libtool files])dnl m4_pattern_allow([LT_OBJDIR])dnl AC_DEFINE_UNQUOTED(LT_OBJDIR, "$lt_cv_objdir/", [Define to the sub-directory in which libtool stores uninstalled libraries.]) ])# _LT_CHECK_OBJDIR # _LT_LINKER_HARDCODE_LIBPATH([TAGNAME]) # -------------------------------------- # Check hardcoding attributes. m4_defun([_LT_LINKER_HARDCODE_LIBPATH], [AC_MSG_CHECKING([how to hardcode library paths into programs]) _LT_TAGVAR(hardcode_action, $1)= if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" || test -n "$_LT_TAGVAR(runpath_var, $1)" || test "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; then # Linking always hardcodes the temporary library directory. _LT_TAGVAR(hardcode_action, $1)=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. _LT_TAGVAR(hardcode_action, $1)=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. _LT_TAGVAR(hardcode_action, $1)=unsupported fi AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)]) if test "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi _LT_TAGDECL([], [hardcode_action], [0], [How to hardcode a shared library path into an executable]) ])# _LT_LINKER_HARDCODE_LIBPATH # _LT_CMD_STRIPLIB # ---------------- m4_defun([_LT_CMD_STRIPLIB], [m4_require([_LT_DECL_EGREP]) striplib= old_striplib= AC_MSG_CHECKING([whether stripping libraries is possible]) if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" AC_MSG_RESULT([yes]) else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi ;; *) AC_MSG_RESULT([no]) ;; esac fi _LT_DECL([], [old_striplib], [1], [Commands to strip libraries]) _LT_DECL([], [striplib], [1]) ])# _LT_CMD_STRIPLIB # _LT_SYS_DYNAMIC_LINKER([TAG]) # ----------------------------- # PORTME Fill in your ld.so characteristics m4_defun([_LT_SYS_DYNAMIC_LINKER], [AC_REQUIRE([AC_CANONICAL_HOST])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_OBJDUMP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl AC_MSG_CHECKING([dynamic linker characteristics]) m4_if([$1], [], [ if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq="s,=\([[A-Za-z]]:\),\1,g" ;; *) lt_sed_strip_eq="s,=/,/,g" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[[lt_foo]]++; } if (lt_freq[[lt_foo]] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's,/\([[A-Za-z]]:\),\1,g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi]) library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[[4-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[[01]] | aix4.[[01]].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[[45]]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api"]) ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' library_names_spec='${libname}.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([[a-zA-Z]]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec="$LIB" if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"]) sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[[23]].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[[01]]* | freebsdelf3.[[01]]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \ freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=yes sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[[3-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH AC_CACHE_VAL([lt_cv_shlibpath_overrides_runpath], [lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \ LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\"" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null], [lt_cv_shlibpath_overrides_runpath=yes])]) LDFLAGS=$save_LDFLAGS libdir=$save_libdir ]) shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac AC_MSG_RESULT([$dynamic_linker]) test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi _LT_DECL([], [variables_saved_for_relink], [1], [Variables whose values should be saved in libtool wrapper scripts and restored at link time]) _LT_DECL([], [need_lib_prefix], [0], [Do we need the "lib" prefix for modules?]) _LT_DECL([], [need_version], [0], [Do we need a version for libraries?]) _LT_DECL([], [version_type], [0], [Library versioning type]) _LT_DECL([], [runpath_var], [0], [Shared library runtime path variable]) _LT_DECL([], [shlibpath_var], [0],[Shared library path variable]) _LT_DECL([], [shlibpath_overrides_runpath], [0], [Is shlibpath searched before the hard-coded library search path?]) _LT_DECL([], [libname_spec], [1], [Format of library name prefix]) _LT_DECL([], [library_names_spec], [1], [[List of archive names. First name is the real one, the rest are links. The last name is the one that the linker finds with -lNAME]]) _LT_DECL([], [soname_spec], [1], [[The coded name of the library, if different from the real name]]) _LT_DECL([], [install_override_mode], [1], [Permission mode override for installation of shared libraries]) _LT_DECL([], [postinstall_cmds], [2], [Command to use after installation of a shared archive]) _LT_DECL([], [postuninstall_cmds], [2], [Command to use after uninstallation of a shared archive]) _LT_DECL([], [finish_cmds], [2], [Commands used to finish a libtool library installation in a directory]) _LT_DECL([], [finish_eval], [1], [[As "finish_cmds", except a single script fragment to be evaled but not shown]]) _LT_DECL([], [hardcode_into_libs], [0], [Whether we should hardcode library paths into libraries]) _LT_DECL([], [sys_lib_search_path_spec], [2], [Compile-time system search path for libraries]) _LT_DECL([], [sys_lib_dlsearch_path_spec], [2], [Run-time system search path for libraries]) ])# _LT_SYS_DYNAMIC_LINKER # _LT_PATH_TOOL_PREFIX(TOOL) # -------------------------- # find a file program which can recognize shared library AC_DEFUN([_LT_PATH_TOOL_PREFIX], [m4_require([_LT_DECL_EGREP])dnl AC_MSG_CHECKING([for $1]) AC_CACHE_VAL(lt_cv_path_MAGIC_CMD, [case $MAGIC_CMD in [[\\/*] | ?:[\\/]*]) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR dnl $ac_dummy forces splitting on constant user-supplied paths. dnl POSIX.2 word splitting is done only on the output of word expansions, dnl not every word. This closes a longstanding sh security hole. ac_dummy="m4_if([$2], , $PATH, [$2])" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$1; then lt_cv_path_MAGIC_CMD="$ac_dir/$1" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac]) MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then AC_MSG_RESULT($MAGIC_CMD) else AC_MSG_RESULT(no) fi _LT_DECL([], [MAGIC_CMD], [0], [Used to examine libraries when file_magic_cmd begins with "file"])dnl ])# _LT_PATH_TOOL_PREFIX # Old name: AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], []) # _LT_PATH_MAGIC # -------------- # find a file program which can recognize a shared library m4_defun([_LT_PATH_MAGIC], [_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH) if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH) else MAGIC_CMD=: fi fi ])# _LT_PATH_MAGIC # LT_PATH_LD # ---------- # find the pathname to the GNU or non-GNU linker AC_DEFUN([LT_PATH_LD], [AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PROG_ECHO_BACKSLASH])dnl AC_ARG_WITH([gnu-ld], [AS_HELP_STRING([--with-gnu-ld], [assume the C compiler uses GNU ld @<:@default=no@:>@])], [test "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by $CC]) case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [[\\/]]* | ?:[[\\/]]*) re_direlt='/[[^/]][[^/]]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(lt_cv_path_LD, [if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &1 /dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]'] lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]]\.[[0-9]]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[[3-9]]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac ]) file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[[\1]]\/[[\1]]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown _LT_DECL([], [deplibs_check_method], [1], [Method to check whether dependent libraries are shared objects]) _LT_DECL([], [file_magic_cmd], [1], [Command to use when deplibs_check_method = "file_magic"]) _LT_DECL([], [file_magic_glob], [1], [How to find potential files when deplibs_check_method = "file_magic"]) _LT_DECL([], [want_nocaseglob], [1], [Find potential files using nocaseglob when deplibs_check_method = "file_magic"]) ])# _LT_CHECK_MAGIC_METHOD # LT_PATH_NM # ---------- # find the pathname to a BSD- or MS-compatible name lister AC_DEFUN([LT_PATH_NM], [AC_REQUIRE([AC_PROG_CC])dnl AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM, [if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi]) if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else AC_CHECK_TOOLS(DUMPBIN, [dumpbin "link -dump"], :) case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) DUMPBIN=: ;; esac fi AC_SUBST([DUMPBIN]) if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm AC_SUBST([NM]) _LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface], [lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: output\"" >&AS_MESSAGE_LOG_FD) cat conftest.out >&AS_MESSAGE_LOG_FD if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest*]) ])# LT_PATH_NM # Old names: AU_ALIAS([AM_PROG_NM], [LT_PATH_NM]) AU_ALIAS([AC_PROG_NM], [LT_PATH_NM]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_PROG_NM], []) dnl AC_DEFUN([AC_PROG_NM], []) # _LT_CHECK_SHAREDLIB_FROM_LINKLIB # -------------------------------- # how to determine the name of the shared library # associated with a specific link library. # -- PORTME fill in with the dynamic library characteristics m4_defun([_LT_CHECK_SHAREDLIB_FROM_LINKLIB], [m4_require([_LT_DECL_EGREP]) m4_require([_LT_DECL_OBJDUMP]) m4_require([_LT_DECL_DLLTOOL]) AC_CACHE_CHECK([how to associate runtime and link libraries], lt_cv_sharedlib_from_linklib_cmd, [lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh # decide which to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd="$ECHO" ;; esac ]) sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO _LT_DECL([], [sharedlib_from_linklib_cmd], [1], [Command to associate shared and link libraries]) ])# _LT_CHECK_SHAREDLIB_FROM_LINKLIB # _LT_PATH_MANIFEST_TOOL # ---------------------- # locate the manifest tool m4_defun([_LT_PATH_MANIFEST_TOOL], [AC_CHECK_TOOL(MANIFEST_TOOL, mt, :) test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt AC_CACHE_CHECK([if $MANIFEST_TOOL is a manifest tool], [lt_cv_path_mainfest_tool], [lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&AS_MESSAGE_LOG_FD $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&AS_MESSAGE_LOG_FD if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest*]) if test "x$lt_cv_path_mainfest_tool" != xyes; then MANIFEST_TOOL=: fi _LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl ])# _LT_PATH_MANIFEST_TOOL # LT_LIB_M # -------- # check for math library AC_DEFUN([LT_LIB_M], [AC_REQUIRE([AC_CANONICAL_HOST])dnl LIBM= case $host in *-*-beos* | *-*-cegcc* | *-*-cygwin* | *-*-haiku* | *-*-pw32* | *-*-darwin*) # These system don't have libm, or don't need it ;; *-ncr-sysv4.3*) AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw") AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm") ;; *) AC_CHECK_LIB(m, cos, LIBM="-lm") ;; esac AC_SUBST([LIBM]) ])# LT_LIB_M # Old name: AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_CHECK_LIBM], []) # _LT_COMPILER_NO_RTTI([TAGNAME]) # ------------------------------- m4_defun([_LT_COMPILER_NO_RTTI], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= if test "$GCC" = yes; then case $cc_basename in nvcc*) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -Xcompiler -fno-builtin' ;; *) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' ;; esac _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions], lt_cv_prog_compiler_rtti_exceptions, [-fno-rtti -fno-exceptions], [], [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"]) fi _LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1], [Compiler flag to turn off builtin functions]) ])# _LT_COMPILER_NO_RTTI # _LT_CMD_GLOBAL_SYMBOLS # ---------------------- m4_defun([_LT_CMD_GLOBAL_SYMBOLS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([LT_PATH_NM])dnl AC_REQUIRE([LT_PATH_LD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_TAG_COMPILER])dnl # Check for command to grab the raw symbol name followed by C symbol from nm. AC_MSG_CHECKING([command to parse $NM output from $compiler object]) AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe], [ # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[[BCDEGRST]]' # Regexp to match symbols that can be accessed directly from C. sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[[BCDT]]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[[ABCDGISTW]]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[[ABCDEGRST]]' fi ;; irix* | nonstopux*) symcode='[[BCDEGRST]]' ;; osf*) symcode='[[BCDEGQRST]]' ;; solaris*) symcode='[[BDRT]]' ;; sco3.2v5*) symcode='[[DT]]' ;; sysv4.2uw2*) symcode='[[DT]]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[[ABDT]]' ;; sysv4) symcode='[[DFNSTU]]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[[ABCDGIRSTW]]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK ['"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx]" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if AC_TRY_EVAL(ac_compile); then # Now try to grab the symbols. nlist=conftest.nm if AC_TRY_EVAL(NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE) /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT@&t@_DLSYM_CONST #elif defined(__osf__) /* This system does not cope well with relocations in const data. */ # define LT@&t@_DLSYM_CONST #else # define LT@&t@_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT@&t@_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[[]] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)" if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD fi else echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done ]) if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then AC_MSG_RESULT(failed) else AC_MSG_RESULT(ok) fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[[@]]FILE' >/dev/null; then nm_file_list_spec='@' fi _LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1], [Take the output of nm and produce a listing of raw symbols and C names]) _LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1], [Transform the output of nm in a proper C declaration]) _LT_DECL([global_symbol_to_c_name_address], [lt_cv_sys_global_symbol_to_c_name_address], [1], [Transform the output of nm in a C name address pair]) _LT_DECL([global_symbol_to_c_name_address_lib_prefix], [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1], [Transform the output of nm in a C name address pair when lib prefix is needed]) _LT_DECL([], [nm_file_list_spec], [1], [Specify filename containing input files for $NM]) ]) # _LT_CMD_GLOBAL_SYMBOLS # _LT_COMPILER_PIC([TAGNAME]) # --------------------------- m4_defun([_LT_COMPILER_PIC], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_wl, $1)= _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)= m4_if([$1], [CXX], [ # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else case $host_os in aix[[4-9]]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; dgux*) case $cc_basename in ec++*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; ghcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' fi ;; aCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # KAI C++ Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xlc* | xlC* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL 8.0, 9.0 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; cxx*) # Digital/Compaq C++ _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; lcc*) # Lucid _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ], [ if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Xlinker ' if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_TAGVAR(lt_prog_compiler_pic, $1)="-Xcompiler $_LT_TAGVAR(lt_prog_compiler_pic, $1)" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; hpux9* | hpux10* | hpux11*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC (with -KPIC) is the default. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # Lahey Fortran 8.1. lf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared' _LT_TAGVAR(lt_prog_compiler_static, $1)='--static' ;; nagfor*) # NAG Fortran compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; ccc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All Alpha code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [[1-7]].* | *Sun*Fortran*\ 8.[[0-3]]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='' ;; *Sun\ F* | *Sun*Fortran*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' ;; *Intel*\ [[CF]]*Compiler*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; *Portland\ Group*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; esac ;; newsos6) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All OSF/1 code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; rdos*) _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; solaris*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';; *) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';; esac ;; sunos4*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then _LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; unicos*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; uts4*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ]) case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])" ;; esac AC_CACHE_CHECK([for $compiler option to produce PIC], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_prog_compiler_pic, $1)]) _LT_TAGVAR(lt_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_cv_prog_compiler_pic, $1) # # Check to make sure the PIC flag actually works. # if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works], [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)], [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [], [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in "" | " "*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;; esac], [_LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no]) fi _LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1], [Additional compiler flags for building library objects]) _LT_TAGDECL([wl], [lt_prog_compiler_wl], [1], [How to pass a linker flag through the compiler]) # # Check to make sure the static flag actually works. # wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\" _LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works], _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1), $lt_tmp_static_flag, [], [_LT_TAGVAR(lt_prog_compiler_static, $1)=]) _LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1], [Compiler flag to prevent dynamic linking]) ])# _LT_COMPILER_PIC # _LT_LINKER_SHLIBS([TAGNAME]) # ---------------------------- # See if the linker supports building shared libraries. m4_defun([_LT_LINKER_SHLIBS], [AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) m4_if([$1], [CXX], [ _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] case $host_os in aix[[4-9]]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global defined # symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) _LT_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) case $cc_basename in cl*) _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] ;; esac ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac ], [ runpath_var= _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_cmds, $1)= _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(old_archive_from_new_cmds, $1)= _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)= _LT_TAGVAR(thread_safe_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list _LT_TAGVAR(include_expsyms, $1)= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. dnl Note also adjust exclude_expsyms for C++ above. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=no ;; esac _LT_TAGVAR(ld_shlibs, $1)=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test "$with_gnu_ld" = yes; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[[2-9]]*) ;; *\ \(GNU\ Binutils\)\ [[3-9]]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test "$lt_use_gnu_ld_interface" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[[3-9]]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 _LT_TAGVAR(whole_archive_flag_spec, $1)= tmp_sharedflag='--shared' ;; xl[[cC]]* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac _LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*) _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; sunos4*) _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac if test "$_LT_TAGVAR(ld_shlibs, $1)" = no; then runpath_var= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. _LT_TAGVAR(hardcode_minus_L, $1)=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. _LT_TAGVAR(hardcode_direct, $1)=unsupported fi ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; bsdi[[45]]*) _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1,DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' # FIXME: Should let the user specify the lib program. _LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; hpux9*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; hpux10*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes fi ;; hpux11*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) m4_if($1, [], [ # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) _LT_LINKER_OPTION([if $CC understands -b], _LT_TAGVAR(lt_cv_prog_compiler__b, $1), [-b], [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'], [_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'])], [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags']) ;; esac fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. AC_CACHE_CHECK([whether the $host_os linker accepts -exported_symbol], [lt_cv_irix_exported_symbol], [save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" AC_LINK_IFELSE( [AC_LANG_SOURCE( [AC_LANG_CASE([C], [[int foo (void) { return 0; }]], [C++], [[int foo (void) { return 0; }]], [Fortran 77], [[ subroutine foo end]], [Fortran], [[ subroutine foo end]])])], [lt_cv_irix_exported_symbol=yes], [lt_cv_irix_exported_symbol=no]) LDFLAGS="$save_LDFLAGS"]) if test "$lt_cv_irix_exported_symbol" = yes; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' fi else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes _LT_TAGVAR(link_all_deplibs, $1)=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else _LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; newsos6) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' else case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' ;; esac fi else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; os2*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; solaris*) _LT_TAGVAR(no_undefined_flag, $1)=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' _LT_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' fi ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4) case $host_vendor in sni) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs' _LT_TAGVAR(hardcode_direct, $1)=no ;; motorola) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4.3*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes _LT_TAGVAR(ld_shlibs, $1)=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(ld_shlibs, $1)=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Blargedynsym' ;; esac fi fi ]) AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld _LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl _LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl _LT_DECL([], [extract_expsyms_cmds], [2], [The commands to extract the exported symbol list from a shared archive]) # # Do we need to explicitly link libc? # case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in x|xyes) # Assume -lc should be added _LT_TAGVAR(archive_cmds_need_lc, $1)=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $_LT_TAGVAR(archive_cmds, $1) in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. AC_CACHE_CHECK([whether -lc should be explicitly linked in], [lt_cv_]_LT_TAGVAR(archive_cmds_need_lc, $1), [$RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if AC_TRY_EVAL(ac_compile) 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1) compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1) _LT_TAGVAR(allow_undefined_flag, $1)= if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) then lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=no else lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=yes fi _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* ]) _LT_TAGVAR(archive_cmds_need_lc, $1)=$lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1) ;; esac fi ;; esac _LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0], [Whether or not to add -lc for building shared libraries]) _LT_TAGDECL([allow_libtool_libs_with_static_runtimes], [enable_shared_with_static_runtimes], [0], [Whether or not to disallow shared libs when runtime libs are static]) _LT_TAGDECL([], [export_dynamic_flag_spec], [1], [Compiler flag to allow reflexive dlopens]) _LT_TAGDECL([], [whole_archive_flag_spec], [1], [Compiler flag to generate shared objects directly from archives]) _LT_TAGDECL([], [compiler_needs_object], [1], [Whether the compiler copes with passing no objects directly]) _LT_TAGDECL([], [old_archive_from_new_cmds], [2], [Create an old-style archive from a shared archive]) _LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2], [Create a temporary old-style archive to link instead of a shared archive]) _LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive]) _LT_TAGDECL([], [archive_expsym_cmds], [2]) _LT_TAGDECL([], [module_cmds], [2], [Commands used to build a loadable module if different from building a shared archive.]) _LT_TAGDECL([], [module_expsym_cmds], [2]) _LT_TAGDECL([], [with_gnu_ld], [1], [Whether we are building with GNU ld or not]) _LT_TAGDECL([], [allow_undefined_flag], [1], [Flag that allows shared libraries with undefined symbols to be built]) _LT_TAGDECL([], [no_undefined_flag], [1], [Flag that enforces no undefined symbols]) _LT_TAGDECL([], [hardcode_libdir_flag_spec], [1], [Flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]) _LT_TAGDECL([], [hardcode_libdir_separator], [1], [Whether we need a single "-rpath" flag with a separated argument]) _LT_TAGDECL([], [hardcode_direct], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_direct_absolute], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary and the resulting library dependency is "absolute", i.e impossible to change by setting ${shlibpath_var} if the library is relocated]) _LT_TAGDECL([], [hardcode_minus_L], [0], [Set to "yes" if using the -LDIR flag during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_shlibpath_var], [0], [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_automatic], [0], [Set to "yes" if building a shared library automatically hardcodes DIR into the library and all subsequent libraries and executables linked against it]) _LT_TAGDECL([], [inherit_rpath], [0], [Set to yes if linker adds runtime paths of dependent libraries to runtime path list]) _LT_TAGDECL([], [link_all_deplibs], [0], [Whether libtool must link a program against all its dependency libraries]) _LT_TAGDECL([], [always_export_symbols], [0], [Set to "yes" if exported symbols are required]) _LT_TAGDECL([], [export_symbols_cmds], [2], [The commands to list exported symbols]) _LT_TAGDECL([], [exclude_expsyms], [1], [Symbols that should not be listed in the preloaded symbols]) _LT_TAGDECL([], [include_expsyms], [1], [Symbols that must always be exported]) _LT_TAGDECL([], [prelink_cmds], [2], [Commands necessary for linking programs (against libraries) with templates]) _LT_TAGDECL([], [postlink_cmds], [2], [Commands necessary for finishing linking programs]) _LT_TAGDECL([], [file_list_spec], [1], [Specify filename containing input files]) dnl FIXME: Not yet implemented dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1], dnl [Compiler flag to generate thread safe objects]) ])# _LT_LINKER_SHLIBS # _LT_LANG_C_CONFIG([TAG]) # ------------------------ # Ensure that the configuration variables for a C compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_C_CONFIG], [m4_require([_LT_DECL_EGREP])dnl lt_save_CC="$CC" AC_LANG_PUSH(C) # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' _LT_TAG_COMPILER # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) LT_SYS_DLOPEN_SELF _LT_CMD_STRIPLIB # Report which library types will actually be built AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_CONFIG($1) fi AC_LANG_POP CC="$lt_save_CC" ])# _LT_LANG_C_CONFIG # _LT_LANG_CXX_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a C++ compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_CXX_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then AC_PROG_CXXCPP else _lt_caught_CXX_error=yes fi AC_LANG_PUSH(C++) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} CFLAGS=$CXXFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' else _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration LT_PATH_LD # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) _LT_TAGVAR(ld_shlibs, $1)=yes case $host_os in aix3*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an empty # executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared # libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) case $GXX,$cc_basename in ,cl* | no,cl*) # Native MSVC # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ func_to_tool_file "$lt_outputfile"~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # g++ # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; freebsd2.*) # C++ shared libraries reported to be fairly broken before # switch to ELF _LT_TAGVAR(ld_shlibs, $1)=no ;; freebsd-elf*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions _LT_TAGVAR(ld_shlibs, $1)=yes ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; hpux9*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) ;; *) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` -o $lib' fi fi _LT_TAGVAR(link_all_deplibs, $1)=yes ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [[1-5]].* | *pgcpp\ [[1-5]].*) _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"' _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~ $RANLIB $oldlib' _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 and above use weak symbols _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed' ;; xl* | mpixl* | bgxl*) # IBM XL 8.0 on PPC, with GNU ld _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; m88k*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) _LT_TAGVAR(ld_shlibs, $1)=yes ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=func_echo_all else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; cxx*) case $host in osf3*) _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && func_echo_all "${wl}-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' ;; *) _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' ;; esac _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(archive_cmds_need_lc,$1)=yes _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir' case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(old_archive_cmds, $1)='$CC -Tprelink_objects $oldobjs~ '"$_LT_TAGVAR(old_archive_cmds, $1)" _LT_TAGVAR(reload_cmds, $1)='$CC -Tprelink_objects $reload_objs~ '"$_LT_TAGVAR(reload_cmds, $1)" ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(GCC, $1)="$GXX" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes AC_LANG_POP ])# _LT_LANG_CXX_CONFIG # _LT_FUNC_STRIPNAME_CNF # ---------------------- # func_stripname_cnf prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # # This function is identical to the (non-XSI) version of func_stripname, # except this one can be used by m4 code that may be executed by configure, # rather than the libtool script. m4_defun([_LT_FUNC_STRIPNAME_CNF],[dnl AC_REQUIRE([_LT_DECL_SED]) AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH]) func_stripname_cnf () { case ${2} in .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;; esac } # func_stripname_cnf ])# _LT_FUNC_STRIPNAME_CNF # _LT_SYS_HIDDEN_LIBDEPS([TAGNAME]) # --------------------------------- # Figure out "hidden" library dependencies from verbose # compiler output when linking a shared library. # Parse the compiler output and extract the necessary # objects, libraries and library flags. m4_defun([_LT_SYS_HIDDEN_LIBDEPS], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl AC_REQUIRE([_LT_FUNC_STRIPNAME_CNF])dnl # Dependencies to place before and after the object being linked: _LT_TAGVAR(predep_objects, $1)= _LT_TAGVAR(postdep_objects, $1)= _LT_TAGVAR(predeps, $1)= _LT_TAGVAR(postdeps, $1)= _LT_TAGVAR(compiler_lib_search_path, $1)= dnl we can't use the lt_simple_compile_test_code here, dnl because it contains code intended for an executable, dnl not a library. It's possible we should let each dnl tag define a new lt_????_link_test_code variable, dnl but it's only used here... m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF int a; void foo (void) { a = 0; } _LT_EOF ], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF ], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer*4 a a=0 return end _LT_EOF ], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer a a=0 return end _LT_EOF ], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF public class foo { private int a; public void bar (void) { a = 0; } }; _LT_EOF ], [$1], [GO], [cat > conftest.$ac_ext <<_LT_EOF package foo func foo() { } _LT_EOF ]) _lt_libdeps_save_CFLAGS=$CFLAGS case "$CC $CFLAGS " in #( *\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;; *\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;; *\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;; esac dnl Parse the compiler output and extract the necessary dnl objects, libraries and library flags. if AC_TRY_EVAL(ac_compile); then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case ${prev}${p} in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue fi # Expand the sysroot to ease extracting the directories later. if test -z "$prev"; then case $p in -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;; -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;; -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;; esac fi case $p in =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;; esac if test "$pre_test_object_deps_done" = no; then case ${prev} in -L | -R) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then _LT_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}" else _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$_LT_TAGVAR(postdeps, $1)"; then _LT_TAGVAR(postdeps, $1)="${prev}${p}" else _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} ${prev}${p}" fi fi prev= ;; *.lto.$objext) ;; # Ignore GCC LTO objects *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$_LT_TAGVAR(predep_objects, $1)"; then _LT_TAGVAR(predep_objects, $1)="$p" else _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p" fi else if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then _LT_TAGVAR(postdep_objects, $1)="$p" else _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling $1 test program" fi $RM -f confest.$objext CFLAGS=$_lt_libdeps_save_CFLAGS # PORTME: override above test on systems where it is broken m4_if([$1], [CXX], [case $host_os in interix[[3-9]]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. _LT_TAGVAR(predep_objects,$1)= _LT_TAGVAR(postdep_objects,$1)= _LT_TAGVAR(postdeps,$1)= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; esac ]) case " $_LT_TAGVAR(postdeps, $1) " in *" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; esac _LT_TAGVAR(compiler_lib_search_dirs, $1)= if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi _LT_TAGDECL([], [compiler_lib_search_dirs], [1], [The directories searched by this compiler when creating a shared library]) _LT_TAGDECL([], [predep_objects], [1], [Dependencies to place before and after the objects being linked to create a shared library]) _LT_TAGDECL([], [postdep_objects], [1]) _LT_TAGDECL([], [predeps], [1]) _LT_TAGDECL([], [postdeps], [1]) _LT_TAGDECL([], [compiler_lib_search_path], [1], [The library search path used internally by the compiler when linking a shared library]) ])# _LT_SYS_HIDDEN_LIBDEPS # _LT_LANG_F77_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a Fortran 77 compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_F77_CONFIG], [AC_LANG_PUSH(Fortran 77) if test -z "$F77" || test "X$F77" = "Xno"; then _lt_disable_F77=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the F77 compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_F77" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${F77-"f77"} CFLAGS=$FFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) GCC=$G77 if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$G77" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" CFLAGS="$lt_save_CFLAGS" fi # test "$_lt_disable_F77" != yes AC_LANG_POP ])# _LT_LANG_F77_CONFIG # _LT_LANG_FC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for a Fortran compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_FC_CONFIG], [AC_LANG_PUSH(Fortran) if test -z "$FC" || test "X$FC" = "Xno"; then _lt_disable_FC=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for fc test sources. ac_ext=${ac_fc_srcext-f} # Object file extension for compiled fc test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the FC compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_FC" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${FC-"f95"} CFLAGS=$FCFLAGS compiler=$CC GCC=$ac_cv_fc_compiler_gnu _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$ac_cv_fc_compiler_gnu" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS fi # test "$_lt_disable_FC" != yes AC_LANG_POP ])# _LT_LANG_FC_CONFIG # _LT_LANG_GCJ_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Java Compiler compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_GCJ_CONFIG], [AC_REQUIRE([LT_PROG_GCJ])dnl AC_LANG_SAVE # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GCJ-"gcj"} CFLAGS=$GCJFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)="$LD" _LT_CC_BASENAME([$compiler]) # GCJ did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GCJ_CONFIG # _LT_LANG_GO_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Go compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_GO_CONFIG], [AC_REQUIRE([LT_PROG_GO])dnl AC_LANG_SAVE # Source file extension for Go test sources. ac_ext=go # Object file extension for compiled Go test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="package main; func main() { }" # Code to be used in simple link tests lt_simple_link_test_code='package main; func main() { }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GOC-"gccgo"} CFLAGS=$GOFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)="$LD" _LT_CC_BASENAME([$compiler]) # Go did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GO_CONFIG # _LT_LANG_RC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for the Windows resource compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_RC_CONFIG], [AC_REQUIRE([LT_PROG_RC])dnl AC_LANG_SAVE # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }' # Code to be used in simple link tests lt_simple_link_test_code="$lt_simple_compile_test_code" # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC= CC=${RC-"windres"} CFLAGS= compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes if test -n "$compiler"; then : _LT_CONFIG($1) fi GCC=$lt_save_GCC AC_LANG_RESTORE CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_RC_CONFIG # LT_PROG_GCJ # ----------- AC_DEFUN([LT_PROG_GCJ], [m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ], [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ], [AC_CHECK_TOOL(GCJ, gcj,) test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2" AC_SUBST(GCJFLAGS)])])[]dnl ]) # Old name: AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_GCJ], []) # LT_PROG_GO # ---------- AC_DEFUN([LT_PROG_GO], [AC_CHECK_TOOL(GOC, gccgo,) ]) # LT_PROG_RC # ---------- AC_DEFUN([LT_PROG_RC], [AC_CHECK_TOOL(RC, windres,) ]) # Old name: AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_RC], []) # _LT_DECL_EGREP # -------------- # If we don't have a new enough Autoconf to choose the best grep # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_EGREP], [AC_REQUIRE([AC_PROG_EGREP])dnl AC_REQUIRE([AC_PROG_FGREP])dnl test -z "$GREP" && GREP=grep _LT_DECL([], [GREP], [1], [A grep program that handles long lines]) _LT_DECL([], [EGREP], [1], [An ERE matcher]) _LT_DECL([], [FGREP], [1], [A literal string matcher]) dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too AC_SUBST([GREP]) ]) # _LT_DECL_OBJDUMP # -------------- # If we don't have a new enough Autoconf to choose the best objdump # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_OBJDUMP], [AC_CHECK_TOOL(OBJDUMP, objdump, false) test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [An object symbol dumper]) AC_SUBST([OBJDUMP]) ]) # _LT_DECL_DLLTOOL # ---------------- # Ensure DLLTOOL variable is set. m4_defun([_LT_DECL_DLLTOOL], [AC_CHECK_TOOL(DLLTOOL, dlltool, false) test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program]) AC_SUBST([DLLTOOL]) ]) # _LT_DECL_SED # ------------ # Check for a fully-functional sed program, that truncates # as few characters as possible. Prefer GNU sed if found. m4_defun([_LT_DECL_SED], [AC_PROG_SED test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" _LT_DECL([], [SED], [1], [A sed program that does not truncate output]) _LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"], [Sed that helps us avoid accidentally triggering echo(1) options like -n]) ])# _LT_DECL_SED m4_ifndef([AC_PROG_SED], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_SED. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_SED], [AC_MSG_CHECKING([for a sed that does not truncate output]) AC_CACHE_VAL(lt_cv_path_SED, [# Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done IFS=$as_save_IFS lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f $lt_ac_sed && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test $lt_ac_count -gt 10 && break lt_ac_count=`expr $lt_ac_count + 1` if test $lt_ac_count -gt $lt_ac_max; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done ]) SED=$lt_cv_path_SED AC_SUBST([SED]) AC_MSG_RESULT([$SED]) ])#AC_PROG_SED ])#m4_ifndef # Old name: AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_SED], []) # _LT_CHECK_SHELL_FEATURES # ------------------------ # Find out whether the shell is Bourne or XSI compatible, # or has some other useful features. m4_defun([_LT_CHECK_SHELL_FEATURES], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi _LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac _LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl _LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl ])# _LT_CHECK_SHELL_FEATURES # _LT_PROG_FUNCTION_REPLACE (FUNCNAME, REPLACEMENT-BODY) # ------------------------------------------------------ # In `$cfgfile', look for function FUNCNAME delimited by `^FUNCNAME ()$' and # '^} FUNCNAME ', and replace its body with REPLACEMENT-BODY. m4_defun([_LT_PROG_FUNCTION_REPLACE], [dnl { sed -e '/^$1 ()$/,/^} # $1 /c\ $1 ()\ {\ m4_bpatsubsts([$2], [$], [\\], [^\([ ]\)], [\\\1]) } # Extended-shell $1 implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: ]) # _LT_PROG_REPLACE_SHELLFNS # ------------------------- # Replace existing portable implementations of several shell functions with # equivalent extended shell implementations where those features are available.. m4_defun([_LT_PROG_REPLACE_SHELLFNS], [if test x"$xsi_shell" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_dirname], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_basename], [dnl func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_dirname_and_basename], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_stripname], [dnl # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"}]) _LT_PROG_FUNCTION_REPLACE([func_split_long_opt], [dnl func_split_long_opt_name=${1%%=*} func_split_long_opt_arg=${1#*=}]) _LT_PROG_FUNCTION_REPLACE([func_split_short_opt], [dnl func_split_short_opt_arg=${1#??} func_split_short_opt_name=${1%"$func_split_short_opt_arg"}]) _LT_PROG_FUNCTION_REPLACE([func_lo2o], [dnl case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_xform], [ func_xform_result=${1%.*}.lo]) _LT_PROG_FUNCTION_REPLACE([func_arith], [ func_arith_result=$(( $[*] ))]) _LT_PROG_FUNCTION_REPLACE([func_len], [ func_len_result=${#1}]) fi if test x"$lt_shell_append" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_append], [ eval "${1}+=\\${2}"]) _LT_PROG_FUNCTION_REPLACE([func_append_quoted], [dnl func_quote_for_eval "${2}" dnl m4 expansion turns \\\\ into \\, and then the shell eval turns that into \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"]) # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then AC_MSG_WARN([Unable to substitute extended shell functions in $ofile]) fi ]) # _LT_PATH_CONVERSION_FUNCTIONS # ----------------------------- # Determine which file name conversion functions should be used by # func_to_host_file (and, implicitly, by func_to_host_path). These are needed # for certain cross-compile configurations and native mingw. m4_defun([_LT_PATH_CONVERSION_FUNCTIONS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_MSG_CHECKING([how to convert $build file names to $host format]) AC_CACHE_VAL(lt_cv_to_host_file_cmd, [case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac ]) to_host_file_cmd=$lt_cv_to_host_file_cmd AC_MSG_RESULT([$lt_cv_to_host_file_cmd]) _LT_DECL([to_host_file_cmd], [lt_cv_to_host_file_cmd], [0], [convert $build file names to $host format])dnl AC_MSG_CHECKING([how to convert $build file names to toolchain format]) AC_CACHE_VAL(lt_cv_to_tool_file_cmd, [#assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac ]) to_tool_file_cmd=$lt_cv_to_tool_file_cmd AC_MSG_RESULT([$lt_cv_to_tool_file_cmd]) _LT_DECL([to_tool_file_cmd], [lt_cv_to_tool_file_cmd], [0], [convert $build files to toolchain format])dnl ])# _LT_PATH_CONVERSION_FUNCTIONS healpy-1.8.1/healpixsubmodule/src/cxx/autotools/m4/ltoptions.m40000644000175000017500000003007312346122566025074 0ustar zoncazonca00000000000000# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008, 2009 Free Software Foundation, # Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 7 ltoptions.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) # _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) # ------------------------------------------ m4_define([_LT_MANGLE_OPTION], [[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) # _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) # --------------------------------------- # Set option OPTION-NAME for macro MACRO-NAME, and if there is a # matching handler defined, dispatch to it. Other OPTION-NAMEs are # saved as a flag. m4_define([_LT_SET_OPTION], [m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), _LT_MANGLE_DEFUN([$1], [$2]), [m4_warning([Unknown $1 option `$2'])])[]dnl ]) # _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) # ------------------------------------------------------------ # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. m4_define([_LT_IF_OPTION], [m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) # _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) # ------------------------------------------------------- # Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME # are set. m4_define([_LT_UNLESS_OPTIONS], [m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), [m4_define([$0_found])])])[]dnl m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 ])[]dnl ]) # _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) # ---------------------------------------- # OPTION-LIST is a space-separated list of Libtool options associated # with MACRO-NAME. If any OPTION has a matching handler declared with # LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about # the unknown option and exit. m4_defun([_LT_SET_OPTIONS], [# Set options m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [_LT_SET_OPTION([$1], _LT_Option)]) m4_if([$1],[LT_INIT],[ dnl dnl Simply set some default values (i.e off) if boolean options were not dnl specified: _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no ]) _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no ]) dnl dnl If no reference was made to various pairs of opposing options, then dnl we run the default mode handler for the pair. For example, if neither dnl `shared' nor `disable-shared' was passed, we enable building of shared dnl archives by default: _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], [_LT_ENABLE_FAST_INSTALL]) ]) ])# _LT_SET_OPTIONS ## --------------------------------- ## ## Macros to handle LT_INIT options. ## ## --------------------------------- ## # _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) # ----------------------------------------- m4_define([_LT_MANGLE_DEFUN], [[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) # LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) # ----------------------------------------------- m4_define([LT_OPTION_DEFINE], [m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl ])# LT_OPTION_DEFINE # dlopen # ------ LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes ]) AU_DEFUN([AC_LIBTOOL_DLOPEN], [_LT_SET_OPTION([LT_INIT], [dlopen]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `dlopen' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) # win32-dll # --------- # Declare package support for building win32 dll's. LT_OPTION_DEFINE([LT_INIT], [win32-dll], [enable_win32_dll=yes case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*) AC_CHECK_TOOL(AS, as, false) AC_CHECK_TOOL(DLLTOOL, dlltool, false) AC_CHECK_TOOL(OBJDUMP, objdump, false) ;; esac test -z "$AS" && AS=as _LT_DECL([], [AS], [1], [Assembler program])dnl test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl ])# win32-dll AU_DEFUN([AC_LIBTOOL_WIN32_DLL], [AC_REQUIRE([AC_CANONICAL_HOST])dnl _LT_SET_OPTION([LT_INIT], [win32-dll]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `win32-dll' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) # _LT_ENABLE_SHARED([DEFAULT]) # ---------------------------- # implement the --enable-shared flag, and supports the `shared' and # `disable-shared' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_SHARED], [m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([shared], [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], [build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_shared=]_LT_ENABLE_SHARED_DEFAULT) _LT_DECL([build_libtool_libs], [enable_shared], [0], [Whether or not to build shared libraries]) ])# _LT_ENABLE_SHARED LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) # Old names: AC_DEFUN([AC_ENABLE_SHARED], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) ]) AC_DEFUN([AC_DISABLE_SHARED], [_LT_SET_OPTION([LT_INIT], [disable-shared]) ]) AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_SHARED], []) dnl AC_DEFUN([AM_DISABLE_SHARED], []) # _LT_ENABLE_STATIC([DEFAULT]) # ---------------------------- # implement the --enable-static flag, and support the `static' and # `disable-static' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_STATIC], [m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([static], [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], [build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_static=]_LT_ENABLE_STATIC_DEFAULT) _LT_DECL([build_old_libs], [enable_static], [0], [Whether or not to build static libraries]) ])# _LT_ENABLE_STATIC LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) # Old names: AC_DEFUN([AC_ENABLE_STATIC], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) ]) AC_DEFUN([AC_DISABLE_STATIC], [_LT_SET_OPTION([LT_INIT], [disable-static]) ]) AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_STATIC], []) dnl AC_DEFUN([AM_DISABLE_STATIC], []) # _LT_ENABLE_FAST_INSTALL([DEFAULT]) # ---------------------------------- # implement the --enable-fast-install flag, and support the `fast-install' # and `disable-fast-install' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_FAST_INSTALL], [m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([fast-install], [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) _LT_DECL([fast_install], [enable_fast_install], [0], [Whether or not to optimize for fast installation])dnl ])# _LT_ENABLE_FAST_INSTALL LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) # Old names: AU_DEFUN([AC_ENABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `fast-install' option into LT_INIT's first parameter.]) ]) AU_DEFUN([AC_DISABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], [disable-fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `disable-fast-install' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) # _LT_WITH_PIC([MODE]) # -------------------- # implement the --with-pic flag, and support the `pic-only' and `no-pic' # LT_INIT options. # MODE is either `yes' or `no'. If omitted, it defaults to `both'. m4_define([_LT_WITH_PIC], [AC_ARG_WITH([pic], [AS_HELP_STRING([--with-pic@<:@=PKGS@:>@], [try to use only PIC/non-PIC objects @<:@default=use both@:>@])], [lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for lt_pkg in $withval; do IFS="$lt_save_ifs" if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS="$lt_save_ifs" ;; esac], [pic_mode=default]) test -z "$pic_mode" && pic_mode=m4_default([$1], [default]) _LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl ])# _LT_WITH_PIC LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) # Old name: AU_DEFUN([AC_LIBTOOL_PICMODE], [_LT_SET_OPTION([LT_INIT], [pic-only]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `pic-only' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) ## ----------------- ## ## LTDL_INIT Options ## ## ----------------- ## m4_define([_LTDL_MODE], []) LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], [m4_define([_LTDL_MODE], [nonrecursive])]) LT_OPTION_DEFINE([LTDL_INIT], [recursive], [m4_define([_LTDL_MODE], [recursive])]) LT_OPTION_DEFINE([LTDL_INIT], [subproject], [m4_define([_LTDL_MODE], [subproject])]) m4_define([_LTDL_TYPE], []) LT_OPTION_DEFINE([LTDL_INIT], [installable], [m4_define([_LTDL_TYPE], [installable])]) LT_OPTION_DEFINE([LTDL_INIT], [convenience], [m4_define([_LTDL_TYPE], [convenience])]) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/configure.ac0000654000175000017530000001357712271533767024727 0ustar zoncaplanck00000000000000AC_INIT([healpix_cxx], [3.11.2]) AM_INIT_AUTOMAKE([foreign subdir-objects -Wall -Werror]) AM_MAINTAINER_MODE([enable]) dnl dnl Needed for linking on Windows. dnl Protect with m4_ifdef because AM_PROG_AR is required in dnl autoconf >= 1.12 when using -Wall, but the macro is dnl absent in old versions of autoconf. dnl m4_ifdef([AM_PROG_AR], [AM_PROG_AR]) LT_INIT AC_CONFIG_MACRO_DIR([m4]) dnl dnl By default, install the headers into a subdirectory of dnl ${prefix}/include to avoid possible header filename collisions. dnl includedir="${includedir}/${PACKAGE_NAME}" dnl dnl Enable silent build rules if this version of Automake supports them dnl m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])]) AC_DEFUN([AX_CHECK_COMPILE_FLAG], [AS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_[]_AC_LANG_ABBREV[]flags_$4_$1])dnl AC_CACHE_CHECK([whether _AC_LANG compiler accepts $1], CACHEVAR, [ ax_check_save_flags=$[]_AC_LANG_PREFIX[]FLAGS _AC_LANG_PREFIX[]FLAGS="$[]_AC_LANG_PREFIX[]FLAGS $4 $1" AC_COMPILE_IFELSE([AC_LANG_PROGRAM()], [AS_VAR_SET(CACHEVAR,[yes])], [AS_VAR_SET(CACHEVAR,[no])]) _AC_LANG_PREFIX[]FLAGS=$ax_check_save_flags]) AS_IF([test x"AS_VAR_GET(CACHEVAR)" = xyes], [m4_default([$2], :)], [m4_default([$3], :)]) AS_VAR_POPDEF([CACHEVAR])dnl ])dnl AX_CHECK_COMPILE_FLAGS dnl dnl Introduce --enable-native-optimizations command line argument to turn on dnl -march=native compiler flag, disabled by default. dnl AC_ARG_ENABLE( [native-optimizations], [AS_HELP_STRING([--enable-native-optimizations], [Enable non-portable optimizations for your own CPU by compiling with -march=native @<:@default=no@:>@])] ) AC_PROG_CC_C99 AC_OPENMP CPPFLAGS="$CPPFLAGS $OPENMP_CFLAGS" CFLAGS="$CFLAGS $OPENMP_CFLAGS" AS_IF( [test "x$enable_native_optimizations" = "xyes"], [AX_CHECK_COMPILE_FLAG([-march=native],[CC="$CC -march=native"])], dnl dnl FIXME: On GCC 4.4, we hit an internal compiler error unless either dnl -march=native or -fno-tree-fre is specified. dnl [ AS_IF( [test "x$GCC" = "xyes" -a "x`$CC -dumpversion | cut -d. -f1,2`" = "x4.4"], [AX_CHECK_COMPILE_FLAG([-fno-tree-fre], [CFLAGS="$CFLAGS -fno-tree-fre"])] ) ] ) AX_CHECK_COMPILE_FLAG([-fno-tree-vectorize],[CFLAGS="$CFLAGS -fno-tree-vectorize"]) AX_CHECK_COMPILE_FLAG([-fno-math-errno],[CFLAGS="$CFLAGS -fno-math-errno"]) AX_CHECK_COMPILE_FLAG([-funsafe-math-optimizations],[CFLAGS="$CFLAGS -funsafe-math-optimizations"]) AX_CHECK_COMPILE_FLAG([-fno-trapping-math],[CFLAGS="$CFLAGS -fno-trapping-math"]) AX_CHECK_COMPILE_FLAG([-fno-rounding-math],[CFLAGS="$CFLAGS -fno-rounding-math"]) AX_CHECK_COMPILE_FLAG([-fno-signaling-nans],[CFLAGS="$CFLAGS -fno-signaling-nans"]) AX_CHECK_COMPILE_FLAG([-fcx-limited-range],[CFLAGS="$CFLAGS -fcx-limited-range"]) AX_CHECK_COMPILE_FLAG([-fomit-frame-pointer],[CFLAGS="$CFLAGS -fomit-frame-pointer"]) AC_PROG_CXX AC_LANG_PUSH([C++]) AC_OPENMP CXXFLAGS="$CXXFLAGS $OPENMP_CFLAGS" AS_IF( [test "x$enable_native_optimizations" = "xyes"], [AX_CHECK_COMPILE_FLAG([-march=native],[CXX="$CXX -march=native"])], dnl dnl FIXME: On GCC 4.4, we hit an internal compiler error unless either dnl -march=native or -fno-tree-fre is specified. dnl [ AS_IF( [test "x$GCC_CXX" = "xyes" -a "x`$CXX -dumpversion | cut -d. -f1,2`" = "x4.4"], [AX_CHECK_COMPILE_FLAG([-fno-tree-fre], [CXXFLAGS="$CXXFLAGS -fno-tree-fre"])] ) ] ) AX_CHECK_COMPILE_FLAG([-fno-tree-vectorize],[CXXFLAGS="$CXXFLAGS -fno-tree-vectorize"]) AX_CHECK_COMPILE_FLAG([-fno-math-errno],[CXXFLAGS="$CXXFLAGS -fno-math-errno"]) AX_CHECK_COMPILE_FLAG([-funsafe-math-optimizations],[CXXFLAGS="$CXXFLAGS -funsafe-math-optimizations"]) AX_CHECK_COMPILE_FLAG([-fno-trapping-math],[CXXFLAGS="$CXXFLAGS -fno-trapping-math"]) AX_CHECK_COMPILE_FLAG([-fno-rounding-math],[CXXFLAGS="$CXXFLAGS -fno-rounding-math"]) AX_CHECK_COMPILE_FLAG([-fno-signaling-nans],[CXXFLAGS="$CXXFLAGS -fno-signaling-nans"]) AX_CHECK_COMPILE_FLAG([-fcx-limited-range],[CXXFLAGS="$CXXFLAGS -fcx-limited-range"]) AX_CHECK_COMPILE_FLAG([-fomit-frame-pointer],[CXXFLAGS="$CXXFLAGS -fomit-frame-pointer"]) AC_LANG_POP([C++]) dnl dnl Determine the compiler flags (CFITSIO_CFLAGS) dnl and linker flags (CFITSIO_LIBS) required to build against libcfitsio. dnl dnl Add help messages to describe the variables CFITSIO_CFLAGS and CFITSIO_LIBS, dnl which can be provided as environment variables or as command-line arguments. dnl These are output variables of PKG_CHECK_MODULES, but they can be overridden. dnl AC_ARG_VAR([CFITSIO_CFLAGS], [compiler flags needed for building with cfitsio, if not found by pkg-config]) AC_ARG_VAR([CFITSIO_LIBS], [linker flags needed for building with cfitsio, if not found by pkg-config]) dnl dnl Now check for cfitsio using pkg-config. If cfitsio is not found with dnl pkg-config, CFITSIO_LIBS defaults to "-lcfitsio". dnl PKG_CHECK_MODULES([CFITSIO], [cfitsio], , [CFITSIO_LIBS=-lcfitsio]) dnl dnl Linking against libcfitsio requires libm too. dnl CFITSIO_LIBS="$CFITSIO_LIBS -lm" dnl dnl With pkg-config < 0.24, PKG_CHECK_MODULES does not AC_SUBST the _CFLAGS dnl and _LIBS variables. dnl AC_SUBST([CFITSIO_CFLAGS]) AC_SUBST([CFITSIO_LIBS]) dnl dnl Perform a test compile and link to determine if cfitsio is usable. If dnl pkg-config did not find cfitsio, then the user may still have provided dnl CFITSIO_CFLAGS and CFITSIO_LIBS manually. If pkg-config did find cfitsio, dnl it does not hurt to test that cfitsio is usable. dnl save_CFLAGS=$CFLAGS save_LIBS=$LIBS CFLAGS="$CFLAGS $CFITSIO_CFLAGS" LIBS="$LIBS $CFITSIO_LIBS" AC_CHECK_LIB([cfitsio], [ffgnrwll], [:], AC_MSG_ERROR([could not find the cfitsio library])) AC_CHECK_HEADERS([fitsio.h], [:], AC_MSG_ERROR([could not find the cfitsio header file])) CFLAGS=$save_CFLAGS LIBS=$save_LIBS AC_PROG_LIBTOOL dnl dnl Create pkgconfig .pc file. dnl AX_CREATE_PKGCONFIG_INFO(,,,,[$OPENMP_CFLAGS $CFITSIO_CFLAGS]) AC_CONFIG_FILES([Makefile]) AC_OUTPUT healpy-1.8.1/healpixsubmodule/src/cxx/autotools/depcomp0000755000175000017500000005601612346122572023636 0ustar zoncazonca00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2013-05-30.07; # UTC # Copyright (C) 1999-2013 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 2, 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. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by 'PROGRAMS ARGS'. object Object file output by 'PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputting dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac # Get the directory component of the given path, and save it in the # global variables '$dir'. Note that this directory component will # be either empty or ending with a '/' character. This is deliberate. set_dir_from () { case $1 in */*) dir=`echo "$1" | sed -e 's|/[^/]*$|/|'`;; *) dir=;; esac } # Get the suffix-stripped basename of the given path, and save it the # global variable '$base'. set_base_from () { base=`echo "$1" | sed -e 's|^.*/||' -e 's/\.[^.]*$//'` } # If no dependency file was actually created by the compiler invocation, # we still have to create a dummy depfile, to avoid errors with the # Makefile "include basename.Plo" scheme. make_dummy_depfile () { echo "#dummy" > "$depfile" } # Factor out some common post-processing of the generated depfile. # Requires the auxiliary global variable '$tmpdepfile' to be set. aix_post_process_depfile () { # If the compiler actually managed to produce a dependency file, # post-process it. if test -f "$tmpdepfile"; then # Each line is of the form 'foo.o: dependency.h'. # Do two passes, one to just change these to # $object: dependency.h # and one to simply output # dependency.h: # which is needed to avoid the deleted-header problem. { sed -e "s,^.*\.[$lower]*:,$object:," < "$tmpdepfile" sed -e "s,^.*\.[$lower]*:[$tab ]*,," -e 's,$,:,' < "$tmpdepfile" } > "$depfile" rm -f "$tmpdepfile" else make_dummy_depfile fi } # A tabulation character. tab=' ' # A newline character. nl=' ' # Character ranges might be problematic outside the C locale. # These definitions help. upper=ABCDEFGHIJKLMNOPQRSTUVWXYZ lower=abcdefghijklmnopqrstuvwxyz digits=0123456789 alpha=${upper}${lower} if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Avoid interferences from the environment. gccflag= dashmflag= # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi cygpath_u="cygpath -u -f -" if test "$depmode" = msvcmsys; then # This is just like msvisualcpp but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvisualcpp fi if test "$depmode" = msvc7msys; then # This is just like msvc7 but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvc7 fi if test "$depmode" = xlc; then # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information. gccflag=-qmakedep=gcc,-MF depmode=gcc fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## Note that this doesn't just cater to obsosete pre-3.x GCC compilers. ## but also to in-use compilers like IMB xlc/xlC and the HP C compiler. ## (see the conditional assignment to $gccflag above). ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). Also, it might not be ## supported by the other compilers which use the 'gcc' depmode. ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # The second -e expression handles DOS-style file names with drive # letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the "deleted header file" problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. ## Some versions of gcc put a space before the ':'. On the theory ## that the space means something, we add a space to the output as ## well. hp depmode also adds that space, but also prefixes the VPATH ## to the object. Take care to not repeat it in the output. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like '#:fec' to the end of the # dependency line. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' \ | tr "$nl" ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else make_dummy_depfile fi rm -f "$tmpdepfile" ;; xlc) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts '$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done aix_post_process_depfile ;; tcc) # tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26 # FIXME: That version still under development at the moment of writing. # Make that this statement remains true also for stable, released # versions. # It will wrap lines (doesn't matter whether long or short) with a # trailing '\', as in: # # foo.o : \ # foo.c \ # foo.h \ # # It will put a trailing '\' even on the last line, and will use leading # spaces rather than leading tabs (at least since its commit 0394caf7 # "Emit spaces for -MD"). "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each non-empty line is of the form 'foo.o : \' or ' dep.h \'. # We have to change lines of the first kind to '$object: \'. sed -e "s|.*:|$object :|" < "$tmpdepfile" > "$depfile" # And for each line of the second kind, we have to emit a 'dep.h:' # dummy dependency, to avoid the deleted-header problem. sed -n -e 's|^ *\(.*\) *\\$|\1:|p' < "$tmpdepfile" >> "$depfile" rm -f "$tmpdepfile" ;; ## The order of this option in the case statement is important, since the ## shell code in configure will try each of these formats in the order ## listed in this file. A plain '-MD' option would be understood by many ## compilers, so we must ensure this comes after the gcc and icc options. pgcc) # Portland's C compiler understands '-MD'. # Will always output deps to 'file.d' where file is the root name of the # source file under compilation, even if file resides in a subdirectory. # The object file name does not affect the name of the '.d' file. # pgcc 10.2 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using '\' : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... set_dir_from "$object" # Use the source, not the object, to determine the base name, since # that's sadly what pgcc will do too. set_base_from "$source" tmpdepfile=$base.d # For projects that build the same source file twice into different object # files, the pgcc approach of using the *source* file root name can cause # problems in parallel builds. Use a locking strategy to avoid stomping on # the same $tmpdepfile. lockdir=$base.d-lock trap " echo '$0: caught signal, cleaning up...' >&2 rmdir '$lockdir' exit 1 " 1 2 13 15 numtries=100 i=$numtries while test $i -gt 0; do # mkdir is a portable test-and-set. if mkdir "$lockdir" 2>/dev/null; then # This process acquired the lock. "$@" -MD stat=$? # Release the lock. rmdir "$lockdir" break else # If the lock is being held by a different process, wait # until the winning process is done or we timeout. while test -d "$lockdir" && test $i -gt 0; do sleep 1 i=`expr $i - 1` done fi i=`expr $i - 1` done trap - 1 2 13 15 if test $i -le 0; then echo "$0: failed to acquire lock after $numtries attempts" >&2 echo "$0: check lockdir '$lockdir'" >&2 exit 1 fi if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[$lower]*:,$object:," "$tmpdepfile" > "$depfile" # Add 'dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else make_dummy_depfile fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. 'cc -MD -o foo.o ...' puts the dependencies into 'foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in 'foo.d' instead, so we check for that too. # Subdirectories are respected. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then # Libtool generates 2 separate objects for the 2 libraries. These # two compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir$base.o.d # libtool 1.5 tmpdepfile2=$dir.libs/$base.o.d # Likewise. tmpdepfile3=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d "$@" -MD fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done # Same post-processing that is required for AIX mode. aix_post_process_depfile ;; msvc7) if test "$libtool" = yes; then showIncludes=-Wc,-showIncludes else showIncludes=-showIncludes fi "$@" $showIncludes > "$tmpdepfile" stat=$? grep -v '^Note: including file: ' "$tmpdepfile" if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # The first sed program below extracts the file names and escapes # backslashes for cygpath. The second sed program outputs the file # name when reading, but also accumulates all include files in the # hold buffer in order to output them again at the end. This only # works with sed implementations that can handle large buffers. sed < "$tmpdepfile" -n ' /^Note: including file: *\(.*\)/ { s//\1/ s/\\/\\\\/g p }' | $cygpath_u | sort -u | sed -n ' s/ /\\ /g s/\(.*\)/'"$tab"'\1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/'"$tab"'/ G p }' >> "$depfile" echo >> "$depfile" # make sure the fragment doesn't end with a backslash rm -f "$tmpdepfile" ;; msvc7msys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove '-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for ':' # in the target name. This is to cope with DOS-style filenames: # a dependency such as 'c:/foo/bar' could be seen as target 'c' otherwise. "$@" $dashmflag | sed "s|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |" > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this sed invocation # correctly. Breaking it into two sed invocations is a workaround. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # X makedepend shift cleared=no eat=no for arg do case $cleared in no) set ""; shift cleared=yes ;; esac if test $eat = yes; then eat=no continue fi case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -arch) eat=yes ;; -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix=`echo "$object" | sed 's/^.*\././'` touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" # makedepend may prepend the VPATH from the source file name to the object. # No need to regex-escape $object, excess matching of '.' is harmless. sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process the last invocation # correctly. Breaking it into two sed invocations is a workaround. sed '1,2d' "$tmpdepfile" \ | tr ' ' "$nl" \ | sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove '-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E \ | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi IFS=" " for arg do case "$arg" in -o) shift ;; $object) shift ;; "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E 2>/dev/null | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::'"$tab"'\1 \\:p' >> "$depfile" echo "$tab" >> "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; msvcmsys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/make_release0000650000175000017530000000050412255154051024742 0ustar zoncaplanck00000000000000#!/bin/sh NAME=HealpixCxx-3.12_experimental URL=http://svn.code.sf.net/p/healpix/code/trunk/src/cxx REV=HEAD svn export -r ${REV} ${URL} ${NAME} &&\ cd ${NAME}/autotools &&\ autoreconf --install &&\ ./configure &&\ make -j2 distcheck &&\ cd - &&\ mv ${NAME}/autotools/*tar.gz . &&\ chmod -R a+w ${NAME} &&\ rm -rf ${NAME} healpy-1.8.1/healpixsubmodule/src/cxx/autotools/config.guess0000755000175000017500000012355012346122572024577 0ustar zoncazonca00000000000000#! /bin/sh # Attempt to guess a canonical system name. # Copyright 1992-2014 Free Software Foundation, Inc. timestamp='2014-03-23' # 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. # # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD # # Please send patches with a ChangeLog entry to config-patches@gnu.org. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -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-2014 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'` ;; 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=`(/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 ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in 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 # 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/[-_].*/\./'` ;; 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}" 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 ;; *: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 ;; 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 ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; 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/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` 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:BSD:*) 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) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac 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*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 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 ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; 8664:Windows_NT:*) echo x86_64-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-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 '[A-Z]' '[a-z]'``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 ;; 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 ;; 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; } ;; 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 ;; 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:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} 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.*:* | i*86:SYSTEM_V: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 configury 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 ;; 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 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 ;; *: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 ;; esac cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp 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` /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-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: healpy-1.8.1/healpixsubmodule/src/cxx/autotools/ltmain.sh0000644000175000017500000105202612346122566024102 0ustar zoncazonca00000000000000 # libtool (GNU libtool) 2.4.2 # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, # 2007, 2008, 2009, 2010, 2011 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. # GNU Libtool 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 2 of the License, or # (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, # or obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --config show all configuration variables # --debug enable verbose shell tracing # -n, --dry-run display commands without modifying any files # --features display basic configuration information and exit # --mode=MODE use operation mode MODE # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --no-quiet, --no-silent # print informational messages (default) # --no-warn don't display warning messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print more informational messages than default # --no-verbose don't print the extra informational messages # --version print version information # -h, --help, --help-all print short, long, or detailed help message # # MODE must be one of the following: # # clean remove files from the build directory # compile compile a source file into a libtool object # execute automatically set library path, then run a program # finish complete the installation of libtool libraries # install install libraries or executables # link create a library or an executable # uninstall remove libraries from an installed directory # # MODE-ARGS vary depending on the MODE. When passed as first option, # `--mode=MODE' may be abbreviated as `MODE' or a unique abbreviation of that. # Try `$progname --help --mode=MODE' for a more detailed description of MODE. # # When reporting a bug, please describe a test case to reproduce it and # include the following information: # # host-triplet: $host # shell: $SHELL # compiler: $LTCC # compiler flags: $LTCFLAGS # linker: $LD (gnu? $with_gnu_ld) # $progname: (GNU libtool) 2.4.2 Debian-2.4.2-1.7 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . # GNU libtool home page: . # General help using GNU software: . PROGRAM=libtool PACKAGE=libtool VERSION="2.4.2 Debian-2.4.2-1.7" TIMESTAMP="" package_revision=1.3337 # Be Bourne compatible if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs 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 BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } # NLS nuisances: We save the old values to restore during execute mode. lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done LC_ALL=C LANGUAGE=C export LANGUAGE LC_ALL $lt_unset CDPATH # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath="$0" : ${CP="cp -f"} test "${ECHO+set}" = set || ECHO=${as_echo-'printf %s\n'} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: EXIT_SUCCESS=0 EXIT_FAILURE=1 EXIT_MISMATCH=63 # $? = 63 is used to indicate version mismatch to missing. EXIT_SKIP=77 # $? = 77 is used to indicate a skipped test to automake. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { func_dirname_result=`$ECHO "${1}" | $SED "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_dirname may be replaced by extended shell implementation # func_basename file func_basename () { func_basename_result=`$ECHO "${1}" | $SED "$basename"` } # func_basename may be replaced by extended shell implementation # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "${1}" | $SED -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "${1}" | $SED -e "$basename"` } # func_dirname_and_basename may be replaced by extended shell implementation # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;; esac } # func_stripname may be replaced by extended shell implementation # These SED scripts presuppose an absolute path with a trailing slash. pathcar='s,^/\([^/]*\).*$,\1,' pathcdr='s,^/[^/]*,,' removedotparts=':dotsl s@/\./@/@g t dotsl s,/\.$,/,' collapseslashes='s@/\{1,\}@/@g' finalslash='s,/*$,/,' # func_normal_abspath PATH # Remove doubled-up and trailing slashes, "." path components, # and cancel out any ".." path components in PATH after making # it an absolute path. # value returned in "$func_normal_abspath_result" func_normal_abspath () { # Start from root dir and reassemble the path. func_normal_abspath_result= func_normal_abspath_tpath=$1 func_normal_abspath_altnamespace= case $func_normal_abspath_tpath in "") # Empty path, that just means $cwd. func_stripname '' '/' "`pwd`" func_normal_abspath_result=$func_stripname_result return ;; # The next three entries are used to spot a run of precisely # two leading slashes without using negated character classes; # we take advantage of case's first-match behaviour. ///*) # Unusual form of absolute path, do nothing. ;; //*) # Not necessarily an ordinary path; POSIX reserves leading '//' # and for example Cygwin uses it to access remote file shares # over CIFS/SMB, so we conserve a leading double slash if found. func_normal_abspath_altnamespace=/ ;; /*) # Absolute path, do nothing. ;; *) # Relative path, prepend $cwd. func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath ;; esac # Cancel out all the simple stuff to save iterations. We also want # the path to end with a slash for ease of parsing, so make sure # there is one (and only one) here. func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$removedotparts" -e "$collapseslashes" -e "$finalslash"` while :; do # Processed it all yet? if test "$func_normal_abspath_tpath" = / ; then # If we ascended to the root using ".." the result may be empty now. if test -z "$func_normal_abspath_result" ; then func_normal_abspath_result=/ fi break fi func_normal_abspath_tcomponent=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$pathcar"` func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$pathcdr"` # Figure out what to do with it case $func_normal_abspath_tcomponent in "") # Trailing empty path component, ignore it. ;; ..) # Parent dir; strip last assembled component from result. func_dirname "$func_normal_abspath_result" func_normal_abspath_result=$func_dirname_result ;; *) # Actual path component, append it. func_normal_abspath_result=$func_normal_abspath_result/$func_normal_abspath_tcomponent ;; esac done # Restore leading double-slash if one was found on entry. func_normal_abspath_result=$func_normal_abspath_altnamespace$func_normal_abspath_result } # func_relative_path SRCDIR DSTDIR # generates a relative path from SRCDIR to DSTDIR, with a trailing # slash if non-empty, suitable for immediately appending a filename # without needing to append a separator. # value returned in "$func_relative_path_result" func_relative_path () { func_relative_path_result= func_normal_abspath "$1" func_relative_path_tlibdir=$func_normal_abspath_result func_normal_abspath "$2" func_relative_path_tbindir=$func_normal_abspath_result # Ascend the tree starting from libdir while :; do # check if we have found a prefix of bindir case $func_relative_path_tbindir in $func_relative_path_tlibdir) # found an exact match func_relative_path_tcancelled= break ;; $func_relative_path_tlibdir*) # found a matching prefix func_stripname "$func_relative_path_tlibdir" '' "$func_relative_path_tbindir" func_relative_path_tcancelled=$func_stripname_result if test -z "$func_relative_path_result"; then func_relative_path_result=. fi break ;; *) func_dirname $func_relative_path_tlibdir func_relative_path_tlibdir=${func_dirname_result} if test "x$func_relative_path_tlibdir" = x ; then # Have to descend all the way to the root! func_relative_path_result=../$func_relative_path_result func_relative_path_tcancelled=$func_relative_path_tbindir break fi func_relative_path_result=../$func_relative_path_result ;; esac done # Now calculate path; take care to avoid doubling-up slashes. func_stripname '' '/' "$func_relative_path_result" func_relative_path_result=$func_stripname_result func_stripname '/' '/' "$func_relative_path_tcancelled" if test "x$func_stripname_result" != x ; then func_relative_path_result=${func_relative_path_result}/${func_stripname_result} fi # Normalisation. If bindir is libdir, return empty string, # else relative path ending with a slash; either way, target # file name can be directly appended. if test ! -z "$func_relative_path_result"; then func_stripname './' '' "$func_relative_path_result/" func_relative_path_result=$func_stripname_result fi } # The name of this program: func_dirname_and_basename "$progpath" progname=$func_basename_result # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=${PATH_SEPARATOR-:} for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution that turns a string into a regex matching for the # string literally. sed_make_literal_regex='s,[].[^$\\*\/],\\&,g' # Sed substitution that converts a w32 file name or path # which contains forward slashes, into one that contains # (escaped) backslashes. A very naive implementation. lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to double_quote_subst, that '$' was protected from expansion. # Since each input `\' is now two `\'s, look for any number of runs of # four `\'s followed by two `\'s and then a '$'. `\' that '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname: ${opt_mode+$opt_mode: }$*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && func_echo ${1+"$@"} # A bug in bash halts the script if the last line of a function # fails when set -e is in force, so we need another command to # work around that: : } # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname: ${opt_mode+$opt_mode: }"${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname: ${opt_mode+$opt_mode: }warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "$my_directory_path" | $SED -e "$dirname"` done my_dir_list=`$ECHO "$my_dir_list" | $SED 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_mkdir_p_IFS" # mkdir can fail with a `File exist' error if two processes # try to create one of the directories concurrently. Don't # stop in that case! $MKDIR "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "$my_tmpdir" } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "$1" | $SED "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # func_quote_for_expand arg # Aesthetically quote ARG to be evaled later; same as above, # but do not quote variable references. func_quote_for_expand () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "$1" | $SED \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_arg in # Double-quote args containing shell metacharacters to delay # word splitting and command substitution for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. func_show_eval () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. Use the saved locale for evaluation. func_show_eval_locale () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_tr_sh # Turn $1 into a string suitable for a shell variable name. # Result is stored in $func_tr_sh_result. All characters # not in the set a-zA-Z0-9_ are replaced with '_'. Further, # if $1 begins with a digit, a '_' is prepended as well. func_tr_sh () { case $1 in [0-9]* | *[!a-zA-Z0-9_]*) func_tr_sh_result=`$ECHO "$1" | $SED 's/^\([0-9]\)/_\1/; s/[^a-zA-Z0-9_]/_/g'` ;; * ) func_tr_sh_result=$1 ;; esac } # func_version # Echo version message to standard output and exit. func_version () { $opt_debug $SED -n '/(C)/!b go :more /\./!{ N s/\n# / / b more } :go /^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $opt_debug $SED -n '/^# Usage:/,/^# *.*--help/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" echo $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help [NOEXIT] # Echo long help message to standard output and exit, # unless 'noexit' is passed as argument. func_help () { $opt_debug $SED -n '/^# Usage:/,/# Report bugs to/ { :print s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(${AUTOMAKE-automake} --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(${AUTOCONF-autoconf} --version) 2>/dev/null |$SED 1q`"'/ p d } /^# .* home page:/b print /^# General help using/b print ' < "$progpath" ret=$? if test -z "$1"; then exit $ret fi } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { $opt_debug func_error "missing argument for $1." exit_cmd=exit } # func_split_short_opt shortopt # Set func_split_short_opt_name and func_split_short_opt_arg shell # variables after splitting SHORTOPT after the 2nd character. func_split_short_opt () { my_sed_short_opt='1s/^\(..\).*$/\1/;q' my_sed_short_rest='1s/^..\(.*\)$/\1/;q' func_split_short_opt_name=`$ECHO "$1" | $SED "$my_sed_short_opt"` func_split_short_opt_arg=`$ECHO "$1" | $SED "$my_sed_short_rest"` } # func_split_short_opt may be replaced by extended shell implementation # func_split_long_opt longopt # Set func_split_long_opt_name and func_split_long_opt_arg shell # variables after splitting LONGOPT at the `=' sign. func_split_long_opt () { my_sed_long_opt='1s/^\(--[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^--[^=]*=//' func_split_long_opt_name=`$ECHO "$1" | $SED "$my_sed_long_opt"` func_split_long_opt_arg=`$ECHO "$1" | $SED "$my_sed_long_arg"` } # func_split_long_opt may be replaced by extended shell implementation exit_cmd=: magic="%%%MAGIC variable%%%" magic_exe="%%%MAGIC EXE variable%%%" # Global variables. nonopt= preserve_args= lo2o="s/\\.lo\$/.${objext}/" o2lo="s/\\.${objext}\$/.lo/" extracted_archives= extracted_serial=0 # If this variable is set in any of the actions, the command in it # will be execed at the end. This prevents here-documents from being # left over by shells. exec_cmd= # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "${1}=\$${1}\${2}" } # func_append may be replaced by extended shell implementation # func_append_quoted var value # Quote VALUE and append to the end of shell variable VAR, separated # by a space. func_append_quoted () { func_quote_for_eval "${2}" eval "${1}=\$${1}\\ \$func_quote_for_eval_result" } # func_append_quoted may be replaced by extended shell implementation # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "${@}"` } # func_arith may be replaced by extended shell implementation # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "${1}" : ".*" 2>/dev/null || echo $max_cmd_len` } # func_len may be replaced by extended shell implementation # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "${1}" | $SED "$lo2o"` } # func_lo2o may be replaced by extended shell implementation # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "${1}" | $SED 's/\.[^.]*$/.lo/'` } # func_xform may be replaced by extended shell implementation # func_fatal_configuration arg... # Echo program name prefixed message to standard error, followed by # a configuration failure hint, and exit. func_fatal_configuration () { func_error ${1+"$@"} func_error "See the $PACKAGE documentation for more information." func_fatal_error "Fatal configuration error." } # func_config # Display the configuration for all the tags in this script. func_config () { re_begincf='^# ### BEGIN LIBTOOL' re_endcf='^# ### END LIBTOOL' # Default configuration. $SED "1,/$re_begincf CONFIG/d;/$re_endcf CONFIG/,\$d" < "$progpath" # Now print the configurations for the tags. for tagname in $taglist; do $SED -n "/$re_begincf TAG CONFIG: $tagname\$/,/$re_endcf TAG CONFIG: $tagname\$/p" < "$progpath" done exit $? } # func_features # Display the features supported by this script. func_features () { echo "host: $host" if test "$build_libtool_libs" = yes; then echo "enable shared libraries" else echo "disable shared libraries" fi if test "$build_old_libs" = yes; then echo "enable static libraries" else echo "disable static libraries" fi exit $? } # func_enable_tag tagname # Verify that TAGNAME is valid, and either flag an error and exit, or # enable the TAGNAME tag. We also add TAGNAME to the global $taglist # variable here. func_enable_tag () { # Global variable: tagname="$1" re_begincf="^# ### BEGIN LIBTOOL TAG CONFIG: $tagname\$" re_endcf="^# ### END LIBTOOL TAG CONFIG: $tagname\$" sed_extractcf="/$re_begincf/,/$re_endcf/p" # Validate tagname. case $tagname in *[!-_A-Za-z0-9,/]*) func_fatal_error "invalid tag name: $tagname" ;; esac # Don't test for the "default" C tag, as we know it's # there but not specially marked. case $tagname in CC) ;; *) if $GREP "$re_begincf" "$progpath" >/dev/null 2>&1; then taglist="$taglist $tagname" # Evaluate the configuration. Be careful to quote the path # and the sed script, to avoid splitting on whitespace, but # also don't use non-portable quotes within backquotes within # quotes we have to do it in 2 steps: extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"` eval "$extractedcf" else func_error "ignoring unknown tag $tagname" fi ;; esac } # func_check_version_match # Ensure that we are using m4 macros, and libtool script from the same # release of libtool. func_check_version_match () { if test "$package_revision" != "$macro_revision"; then if test "$VERSION" != "$macro_version"; then if test -z "$macro_version"; then cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from an older release. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from $PACKAGE $macro_version. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF fi else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, revision $package_revision, $progname: but the definition of this LT_INIT comes from revision $macro_revision. $progname: You should recreate aclocal.m4 with macros from revision $package_revision $progname: of $PACKAGE $VERSION and run autoconf again. _LT_EOF fi exit $EXIT_MISMATCH fi } # Shorthand for --mode=foo, only valid as the first argument case $1 in clean|clea|cle|cl) shift; set dummy --mode clean ${1+"$@"}; shift ;; compile|compil|compi|comp|com|co|c) shift; set dummy --mode compile ${1+"$@"}; shift ;; execute|execut|execu|exec|exe|ex|e) shift; set dummy --mode execute ${1+"$@"}; shift ;; finish|finis|fini|fin|fi|f) shift; set dummy --mode finish ${1+"$@"}; shift ;; install|instal|insta|inst|ins|in|i) shift; set dummy --mode install ${1+"$@"}; shift ;; link|lin|li|l) shift; set dummy --mode link ${1+"$@"}; shift ;; uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u) shift; set dummy --mode uninstall ${1+"$@"}; shift ;; esac # Option defaults: opt_debug=: opt_dry_run=false opt_config=false opt_preserve_dup_deps=false opt_features=false opt_finish=false opt_help=false opt_help_all=false opt_silent=: opt_warning=: opt_verbose=: opt_silent=false opt_verbose=false # Parse options once, thoroughly. This comes as soon as possible in the # script to make things like `--version' happen as quickly as we can. { # this just eases exit handling while test $# -gt 0; do opt="$1" shift case $opt in --debug|-x) opt_debug='set -x' func_echo "enabling shell trace mode" $opt_debug ;; --dry-run|--dryrun|-n) opt_dry_run=: ;; --config) opt_config=: func_config ;; --dlopen|-dlopen) optarg="$1" opt_dlopen="${opt_dlopen+$opt_dlopen }$optarg" shift ;; --preserve-dup-deps) opt_preserve_dup_deps=: ;; --features) opt_features=: func_features ;; --finish) opt_finish=: set dummy --mode finish ${1+"$@"}; shift ;; --help) opt_help=: ;; --help-all) opt_help_all=: opt_help=': help-all' ;; --mode) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_mode="$optarg" case $optarg in # Valid mode arguments: clean|compile|execute|finish|install|link|relink|uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac shift ;; --no-silent|--no-quiet) opt_silent=false func_append preserve_args " $opt" ;; --no-warning|--no-warn) opt_warning=false func_append preserve_args " $opt" ;; --no-verbose) opt_verbose=false func_append preserve_args " $opt" ;; --silent|--quiet) opt_silent=: func_append preserve_args " $opt" opt_verbose=false ;; --verbose|-v) opt_verbose=: func_append preserve_args " $opt" opt_silent=false ;; --tag) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_tag="$optarg" func_append preserve_args " $opt $optarg" func_enable_tag "$optarg" shift ;; -\?|-h) func_usage ;; --help) func_help ;; --version) func_version ;; # Separate optargs to long options: --*=*) func_split_long_opt "$opt" set dummy "$func_split_long_opt_name" "$func_split_long_opt_arg" ${1+"$@"} shift ;; # Separate non-argument short options: -\?*|-h*|-n*|-v*) func_split_short_opt "$opt" set dummy "$func_split_short_opt_name" "-$func_split_short_opt_arg" ${1+"$@"} shift ;; --) break ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) set dummy "$opt" ${1+"$@"}; shift; break ;; esac done # Validate options: # save first non-option argument if test "$#" -gt 0; then nonopt="$opt" shift fi # preserve --debug test "$opt_debug" = : || func_append preserve_args " --debug" case $host in *cygwin* | *mingw* | *pw32* | *cegcc*) # don't eliminate duplications in $postdeps and $predeps opt_duplicate_compiler_generated_deps=: ;; *) opt_duplicate_compiler_generated_deps=$opt_preserve_dup_deps ;; esac $opt_help || { # Sanity checks first: func_check_version_match if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$opt_dlopen" && test "$opt_mode" != execute; then func_error "unrecognized option \`-dlopen'" $ECHO "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help="$help" help="Try \`$progname --help --mode=$opt_mode' for more information." } # Bail if the options were screwed $exit_cmd $EXIT_FAILURE } ## ----------- ## ## Main. ## ## ----------- ## # func_lalib_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_lalib_p () { test -f "$1" && $SED -e 4q "$1" 2>/dev/null \ | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1 } # func_lalib_unsafe_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function implements the same check as func_lalib_p without # resorting to external programs. To this end, it redirects stdin and # closes it afterwards, without saving the original file descriptor. # As a safety measure, use it only where a negative result would be # fatal anyway. Works if `file' does not exist. func_lalib_unsafe_p () { lalib_p=no if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then for lalib_p_l in 1 2 3 4 do read lalib_p_line case "$lalib_p_line" in \#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;; esac done exec 0<&5 5<&- fi test "$lalib_p" = yes } # func_ltwrapper_script_p file # True iff FILE is a libtool wrapper script # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_script_p () { func_lalib_p "$1" } # func_ltwrapper_executable_p file # True iff FILE is a libtool wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_executable_p () { func_ltwrapper_exec_suffix= case $1 in *.exe) ;; *) func_ltwrapper_exec_suffix=.exe ;; esac $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1 } # func_ltwrapper_scriptname file # Assumes file is an ltwrapper_executable # uses $file to determine the appropriate filename for a # temporary ltwrapper_script. func_ltwrapper_scriptname () { func_dirname_and_basename "$1" "" "." func_stripname '' '.exe' "$func_basename_result" func_ltwrapper_scriptname_result="$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper" } # func_ltwrapper_p file # True iff FILE is a libtool wrapper script or wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_p () { func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1" } # func_execute_cmds commands fail_cmd # Execute tilde-delimited COMMANDS. # If FAIL_CMD is given, eval that upon failure. # FAIL_CMD may read-access the current command in variable CMD! func_execute_cmds () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" func_show_eval "$cmd" "${2-:}" done IFS=$save_ifs } # func_source file # Source FILE, adding directory component if necessary. # Note that it is not necessary on cygwin/mingw to append a dot to # FILE even if both FILE and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # `FILE.' does not work on cygwin managed mounts. func_source () { $opt_debug case $1 in */* | *\\*) . "$1" ;; *) . "./$1" ;; esac } # func_resolve_sysroot PATH # Replace a leading = in PATH with a sysroot. Store the result into # func_resolve_sysroot_result func_resolve_sysroot () { func_resolve_sysroot_result=$1 case $func_resolve_sysroot_result in =*) func_stripname '=' '' "$func_resolve_sysroot_result" func_resolve_sysroot_result=$lt_sysroot$func_stripname_result ;; esac } # func_replace_sysroot PATH # If PATH begins with the sysroot, replace it with = and # store the result into func_replace_sysroot_result. func_replace_sysroot () { case "$lt_sysroot:$1" in ?*:"$lt_sysroot"*) func_stripname "$lt_sysroot" '' "$1" func_replace_sysroot_result="=$func_stripname_result" ;; *) # Including no sysroot. func_replace_sysroot_result=$1 ;; esac } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { $opt_debug if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case "$@ " in " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then func_echo "unable to infer tagged configuration" func_fatal_error "specify a tag with \`--tag'" # else # func_verbose "using $tagname tagged configuration" fi ;; esac fi } # func_write_libtool_object output_name pic_name nonpic_name # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. func_write_libtool_object () { write_libobj=${1} if test "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; then write_oldobj=\'${3}\' else write_oldobj=none fi $opt_dry_run || { cat >${write_libobj}T </dev/null` if test "$?" -eq 0 && test -n "${func_convert_core_file_wine_to_w32_tmp}"; then func_convert_core_file_wine_to_w32_result=`$ECHO "$func_convert_core_file_wine_to_w32_tmp" | $SED -e "$lt_sed_naive_backslashify"` else func_convert_core_file_wine_to_w32_result= fi fi } # end: func_convert_core_file_wine_to_w32 # func_convert_core_path_wine_to_w32 ARG # Helper function used by path conversion functions when $build is *nix, and # $host is mingw, cygwin, or some other w32 environment. Relies on a correctly # configured wine environment available, with the winepath program in $build's # $PATH. Assumes ARG has no leading or trailing path separator characters. # # ARG is path to be converted from $build format to win32. # Result is available in $func_convert_core_path_wine_to_w32_result. # Unconvertible file (directory) names in ARG are skipped; if no directory names # are convertible, then the result may be empty. func_convert_core_path_wine_to_w32 () { $opt_debug # unfortunately, winepath doesn't convert paths, only file names func_convert_core_path_wine_to_w32_result="" if test -n "$1"; then oldIFS=$IFS IFS=: for func_convert_core_path_wine_to_w32_f in $1; do IFS=$oldIFS func_convert_core_file_wine_to_w32 "$func_convert_core_path_wine_to_w32_f" if test -n "$func_convert_core_file_wine_to_w32_result" ; then if test -z "$func_convert_core_path_wine_to_w32_result"; then func_convert_core_path_wine_to_w32_result="$func_convert_core_file_wine_to_w32_result" else func_append func_convert_core_path_wine_to_w32_result ";$func_convert_core_file_wine_to_w32_result" fi fi done IFS=$oldIFS fi } # end: func_convert_core_path_wine_to_w32 # func_cygpath ARGS... # Wrapper around calling the cygpath program via LT_CYGPATH. This is used when # when (1) $build is *nix and Cygwin is hosted via a wine environment; or (2) # $build is MSYS and $host is Cygwin, or (3) $build is Cygwin. In case (1) or # (2), returns the Cygwin file name or path in func_cygpath_result (input # file name or path is assumed to be in w32 format, as previously converted # from $build's *nix or MSYS format). In case (3), returns the w32 file name # or path in func_cygpath_result (input file name or path is assumed to be in # Cygwin format). Returns an empty string on error. # # ARGS are passed to cygpath, with the last one being the file name or path to # be converted. # # Specify the absolute *nix (or w32) name to cygpath in the LT_CYGPATH # environment variable; do not put it in $PATH. func_cygpath () { $opt_debug if test -n "$LT_CYGPATH" && test -f "$LT_CYGPATH"; then func_cygpath_result=`$LT_CYGPATH "$@" 2>/dev/null` if test "$?" -ne 0; then # on failure, ensure result is empty func_cygpath_result= fi else func_cygpath_result= func_error "LT_CYGPATH is empty or specifies non-existent file: \`$LT_CYGPATH'" fi } #end: func_cygpath # func_convert_core_msys_to_w32 ARG # Convert file name or path ARG from MSYS format to w32 format. Return # result in func_convert_core_msys_to_w32_result. func_convert_core_msys_to_w32 () { $opt_debug # awkward: cmd appends spaces to result func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null | $SED -e 's/[ ]*$//' -e "$lt_sed_naive_backslashify"` } #end: func_convert_core_msys_to_w32 # func_convert_file_check ARG1 ARG2 # Verify that ARG1 (a file name in $build format) was converted to $host # format in ARG2. Otherwise, emit an error message, but continue (resetting # func_to_host_file_result to ARG1). func_convert_file_check () { $opt_debug if test -z "$2" && test -n "$1" ; then func_error "Could not determine host file name corresponding to" func_error " \`$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback: func_to_host_file_result="$1" fi } # end func_convert_file_check # func_convert_path_check FROM_PATHSEP TO_PATHSEP FROM_PATH TO_PATH # Verify that FROM_PATH (a path in $build format) was converted to $host # format in TO_PATH. Otherwise, emit an error message, but continue, resetting # func_to_host_file_result to a simplistic fallback value (see below). func_convert_path_check () { $opt_debug if test -z "$4" && test -n "$3"; then func_error "Could not determine the host path corresponding to" func_error " \`$3'" func_error "Continuing, but uninstalled executables may not work." # Fallback. This is a deliberately simplistic "conversion" and # should not be "improved". See libtool.info. if test "x$1" != "x$2"; then lt_replace_pathsep_chars="s|$1|$2|g" func_to_host_path_result=`echo "$3" | $SED -e "$lt_replace_pathsep_chars"` else func_to_host_path_result="$3" fi fi } # end func_convert_path_check # func_convert_path_front_back_pathsep FRONTPAT BACKPAT REPL ORIG # Modifies func_to_host_path_result by prepending REPL if ORIG matches FRONTPAT # and appending REPL if ORIG matches BACKPAT. func_convert_path_front_back_pathsep () { $opt_debug case $4 in $1 ) func_to_host_path_result="$3$func_to_host_path_result" ;; esac case $4 in $2 ) func_append func_to_host_path_result "$3" ;; esac } # end func_convert_path_front_back_pathsep ################################################## # $build to $host FILE NAME CONVERSION FUNCTIONS # ################################################## # invoked via `$to_host_file_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # Result will be available in $func_to_host_file_result. # func_to_host_file ARG # Converts the file name ARG from $build format to $host format. Return result # in func_to_host_file_result. func_to_host_file () { $opt_debug $to_host_file_cmd "$1" } # end func_to_host_file # func_to_tool_file ARG LAZY # converts the file name ARG from $build format to toolchain format. Return # result in func_to_tool_file_result. If the conversion in use is listed # in (the comma separated) LAZY, no conversion takes place. func_to_tool_file () { $opt_debug case ,$2, in *,"$to_tool_file_cmd",*) func_to_tool_file_result=$1 ;; *) $to_tool_file_cmd "$1" func_to_tool_file_result=$func_to_host_file_result ;; esac } # end func_to_tool_file # func_convert_file_noop ARG # Copy ARG to func_to_host_file_result. func_convert_file_noop () { func_to_host_file_result="$1" } # end func_convert_file_noop # func_convert_file_msys_to_w32 ARG # Convert file name ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_file_result. func_convert_file_msys_to_w32 () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_to_host_file_result="$func_convert_core_msys_to_w32_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_w32 # func_convert_file_cygwin_to_w32 ARG # Convert file name ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_file_cygwin_to_w32 () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then # because $build is cygwin, we call "the" cygpath in $PATH; no need to use # LT_CYGPATH in this case. func_to_host_file_result=`cygpath -m "$1"` fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_cygwin_to_w32 # func_convert_file_nix_to_w32 ARG # Convert file name ARG from *nix to w32 format. Requires a wine environment # and a working winepath. Returns result in func_to_host_file_result. func_convert_file_nix_to_w32 () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then func_convert_core_file_wine_to_w32 "$1" func_to_host_file_result="$func_convert_core_file_wine_to_w32_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_w32 # func_convert_file_msys_to_cygwin ARG # Convert file name ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_file_msys_to_cygwin () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_cygpath -u "$func_convert_core_msys_to_w32_result" func_to_host_file_result="$func_cygpath_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_cygwin # func_convert_file_nix_to_cygwin ARG # Convert file name ARG from *nix to Cygwin format. Requires Cygwin installed # in a wine environment, working winepath, and LT_CYGPATH set. Returns result # in func_to_host_file_result. func_convert_file_nix_to_cygwin () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then # convert from *nix to w32, then use cygpath to convert from w32 to cygwin. func_convert_core_file_wine_to_w32 "$1" func_cygpath -u "$func_convert_core_file_wine_to_w32_result" func_to_host_file_result="$func_cygpath_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_cygwin ############################################# # $build to $host PATH CONVERSION FUNCTIONS # ############################################# # invoked via `$to_host_path_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # The result will be available in $func_to_host_path_result. # # Path separators are also converted from $build format to $host format. If # ARG begins or ends with a path separator character, it is preserved (but # converted to $host format) on output. # # All path conversion functions are named using the following convention: # file name conversion function : func_convert_file_X_to_Y () # path conversion function : func_convert_path_X_to_Y () # where, for any given $build/$host combination the 'X_to_Y' value is the # same. If conversion functions are added for new $build/$host combinations, # the two new functions must follow this pattern, or func_init_to_host_path_cmd # will break. # func_init_to_host_path_cmd # Ensures that function "pointer" variable $to_host_path_cmd is set to the # appropriate value, based on the value of $to_host_file_cmd. to_host_path_cmd= func_init_to_host_path_cmd () { $opt_debug if test -z "$to_host_path_cmd"; then func_stripname 'func_convert_file_' '' "$to_host_file_cmd" to_host_path_cmd="func_convert_path_${func_stripname_result}" fi } # func_to_host_path ARG # Converts the path ARG from $build format to $host format. Return result # in func_to_host_path_result. func_to_host_path () { $opt_debug func_init_to_host_path_cmd $to_host_path_cmd "$1" } # end func_to_host_path # func_convert_path_noop ARG # Copy ARG to func_to_host_path_result. func_convert_path_noop () { func_to_host_path_result="$1" } # end func_convert_path_noop # func_convert_path_msys_to_w32 ARG # Convert path ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_path_result. func_convert_path_msys_to_w32 () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # Remove leading and trailing path separator characters from ARG. MSYS # behavior is inconsistent here; cygpath turns them into '.;' and ';.'; # and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result="$func_convert_core_msys_to_w32_result" func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_msys_to_w32 # func_convert_path_cygwin_to_w32 ARG # Convert path ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_path_cygwin_to_w32 () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_to_host_path_result=`cygpath -m -p "$func_to_host_path_tmp1"` func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_cygwin_to_w32 # func_convert_path_nix_to_w32 ARG # Convert path ARG from *nix to w32 format. Requires a wine environment and # a working winepath. Returns result in func_to_host_file_result. func_convert_path_nix_to_w32 () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result="$func_convert_core_path_wine_to_w32_result" func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_nix_to_w32 # func_convert_path_msys_to_cygwin ARG # Convert path ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_path_msys_to_cygwin () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_msys_to_w32_result" func_to_host_path_result="$func_cygpath_result" func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_msys_to_cygwin # func_convert_path_nix_to_cygwin ARG # Convert path ARG from *nix to Cygwin format. Requires Cygwin installed in a # a wine environment, working winepath, and LT_CYGPATH set. Returns result in # func_to_host_file_result. func_convert_path_nix_to_cygwin () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # Remove leading and trailing path separator characters from # ARG. msys behavior is inconsistent here, cygpath turns them # into '.;' and ';.', and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_path_wine_to_w32_result" func_to_host_path_result="$func_cygpath_result" func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_nix_to_cygwin # func_mode_compile arg... func_mode_compile () { $opt_debug # Get the compilation command and the source file. base_compile= srcfile="$nonopt" # always keep a non-empty value in "srcfile" suppress_opt=yes suppress_output= arg_mode=normal libobj= later= pie_flag= for arg do case $arg_mode in arg ) # do not "continue". Instead, add this to base_compile lastarg="$arg" arg_mode=normal ;; target ) libobj="$arg" arg_mode=normal continue ;; normal ) # Accept any command-line options. case $arg in -o) test -n "$libobj" && \ func_fatal_error "you cannot specify \`-o' more than once" arg_mode=target continue ;; -pie | -fpie | -fPIE) func_append pie_flag " $arg" continue ;; -shared | -static | -prefer-pic | -prefer-non-pic) func_append later " $arg" continue ;; -no-suppress) suppress_opt=no continue ;; -Xcompiler) arg_mode=arg # the next one goes into the "base_compile" arg list continue # The current "srcfile" will either be retained or ;; # replaced later. I would guess that would be a bug. -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result lastarg= save_ifs="$IFS"; IFS=',' for arg in $args; do IFS="$save_ifs" func_append_quoted lastarg "$arg" done IFS="$save_ifs" func_stripname ' ' '' "$lastarg" lastarg=$func_stripname_result # Add the arguments to base_compile. func_append base_compile " $lastarg" continue ;; *) # Accept the current argument as the source file. # The previous "srcfile" becomes the current argument. # lastarg="$srcfile" srcfile="$arg" ;; esac # case $arg ;; esac # case $arg_mode # Aesthetically quote the previous argument. func_append_quoted base_compile "$lastarg" done # for arg case $arg_mode in arg) func_fatal_error "you must specify an argument for -Xcompile" ;; target) func_fatal_error "you must specify a target with \`-o'" ;; *) # Get the name of the library object. test -z "$libobj" && { func_basename "$srcfile" libobj="$func_basename_result" } ;; esac # Recognize several different file suffixes. # If the user specifies -o file.o, it is replaced with file.lo case $libobj in *.[cCFSifmso] | \ *.ada | *.adb | *.ads | *.asm | \ *.c++ | *.cc | *.ii | *.class | *.cpp | *.cxx | \ *.[fF][09]? | *.for | *.java | *.go | *.obj | *.sx | *.cu | *.cup) func_xform "$libobj" libobj=$func_xform_result ;; esac case $libobj in *.lo) func_lo2o "$libobj"; obj=$func_lo2o_result ;; *) func_fatal_error "cannot determine name of library object from \`$libobj'" ;; esac func_infer_tag $base_compile for arg in $later; do case $arg in -shared) test "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no continue ;; -static) build_libtool_libs=no build_old_libs=yes continue ;; -prefer-pic) pic_mode=yes continue ;; -prefer-non-pic) pic_mode=no continue ;; esac done func_quote_for_eval "$libobj" test "X$libobj" != "X$func_quote_for_eval_result" \ && $ECHO "X$libobj" | $GREP '[]~#^*{};<>?"'"'"' &()|`$[]' \ && func_warning "libobj name \`$libobj' may not contain shell special characters." func_dirname_and_basename "$obj" "/" "" objname="$func_basename_result" xdir="$func_dirname_result" lobj=${xdir}$objdir/$objname test -z "$base_compile" && \ func_fatal_help "you must specify a compilation command" # Delete any leftover library objects. if test "$build_old_libs" = yes; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2* | cegcc*) pic_mode=default ;; esac if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test "$compiler_c_o" = no; then output_obj=`$ECHO "$srcfile" | $SED 's%^.*/%%; s%\.[^.]*$%%'`.${objext} lockfile="$output_obj.lock" else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test "$need_locks" = yes; then until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done elif test "$need_locks" = warn; then if test -f "$lockfile"; then $ECHO "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi func_append removelist " $output_obj" $ECHO "$srcfile" > "$lockfile" fi $opt_dry_run || $RM $removelist func_append removelist " $lockfile" trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15 func_to_tool_file "$srcfile" func_convert_file_msys_to_w32 srcfile=$func_to_tool_file_result func_quote_for_eval "$srcfile" qsrcfile=$func_quote_for_eval_result # Only build a PIC object if we are building libtool libraries. if test "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; then command="$base_compile $qsrcfile $pic_flag" else # Don't build PIC code command="$base_compile $qsrcfile" fi func_mkdir_p "$xdir$objdir" if test -z "$output_obj"; then # Place PIC objects in $objdir func_append command " -o $lobj" fi func_show_eval_locale "$command" \ 'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then func_show_eval '$MV "$output_obj" "$lobj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi # Allow error messages only from the first compilation. if test "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; then func_append command " -o $obj" fi # Suppress compiler output if we already did a PIC compilation. func_append command "$suppress_output" func_show_eval_locale "$command" \ '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then func_show_eval '$MV "$output_obj" "$obj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi fi $opt_dry_run || { func_write_libtool_object "$libobj" "$objdir/$objname" "$objname" # Unlock the critical section if it was locked if test "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$opt_mode" = compile && func_mode_compile ${1+"$@"} } func_mode_help () { # We need to display help for each of the modes. case $opt_mode in "") # Generic help is extracted from the usage comments # at the start of this file. func_help ;; clean) $ECHO \ "Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $ECHO \ "Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -no-suppress do not suppress compiler output for multiple passes -prefer-pic try to build PIC objects only -prefer-non-pic try to build non-PIC objects only -shared do not build a \`.o' file suitable for static linking -static only build a \`.o' file suitable for static linking -Wc,FLAG pass FLAG directly to the compiler COMPILE-COMMAND is a command to be used in creating a \`standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix \`.c' with the library object suffix, \`.lo'." ;; execute) $ECHO \ "Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to \`-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $ECHO \ "Usage: $progname [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the \`--dry-run' option if you just want to see what would be executed." ;; install) $ECHO \ "Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the \`install' or \`cp' program. The following components of INSTALL-COMMAND are treated specially: -inst-prefix-dir PREFIX-DIR Use PREFIX-DIR as a staging area for installation The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $ECHO \ "Usage: $progname [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -bindir BINDIR specify path to binaries directory (for systems where libraries must be found in the PATH setting at runtime) -dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -shared only do dynamic linking of libtool libraries -shrext SUFFIX override the standard shared library file extension -static do not do any dynamic linking of uninstalled libtool libraries -static-libtool-libs do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] -weak LIBNAME declare that the target provides the LIBNAME interface -Wc,FLAG -Xcompiler FLAG pass linker-specific FLAG directly to the compiler -Wl,FLAG -Xlinker FLAG pass linker-specific FLAG directly to the linker -XCClinker FLAG pass link-specific FLAG to the compiler driver (CC) All other options (arguments beginning with \`-') are ignored. Every other argument is treated as a filename. Files ending in \`.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in \`.la', then a libtool library is created, only library objects (\`.lo' files) may be specified, and \`-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created using \`ar' and \`ranlib', or on Windows using \`lib'. If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $ECHO \ "Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) func_fatal_help "invalid operation mode \`$opt_mode'" ;; esac echo $ECHO "Try \`$progname --help' for more information about other modes." } # Now that we've collected a possible --mode arg, show help if necessary if $opt_help; then if test "$opt_help" = :; then func_mode_help else { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do func_mode_help done } | sed -n '1p; 2,$s/^Usage:/ or: /p' { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do echo func_mode_help done } | sed '1d /^When reporting/,/^Report/{ H d } $x /information about other modes/d /more detailed .*MODE/d s/^Usage:.*--mode=\([^ ]*\) .*/Description of \1 mode:/' fi exit $? fi # func_mode_execute arg... func_mode_execute () { $opt_debug # The first argument is the command name. cmd="$nonopt" test -z "$cmd" && \ func_fatal_help "you must specify a COMMAND" # Handle -dlopen flags immediately. for file in $opt_dlopen; do test -f "$file" \ || func_fatal_help "\`$file' is not a file" dir= case $file in *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$lib' is not a valid libtool archive" # Read the libtool library. dlname= library_names= func_source "$file" # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && \ func_warning "\`$file' was not linked with \`-export-dynamic'" continue fi func_dirname "$file" "" "." dir="$func_dirname_result" if test -f "$dir/$objdir/$dlname"; then func_append dir "/$objdir" else if test ! -f "$dir/$dlname"; then func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'" fi fi ;; *.lo) # Just add the directory containing the .lo file. func_dirname "$file" "" "." dir="$func_dirname_result" ;; *) func_warning "\`-dlopen' is ignored for non-libtool libraries and objects" continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir="$absdir" # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic="$magic" # Check if any of the arguments is a wrapper script. args= for file do case $file in -* | *.la | *.lo ) ;; *) # Do a test to see if this is really a libtool program. if func_ltwrapper_script_p "$file"; then func_source "$file" # Transform arg to wrapped name. file="$progdir/$program" elif func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" func_source "$func_ltwrapper_scriptname_result" # Transform arg to wrapped name. file="$progdir/$program" fi ;; esac # Quote arguments (to preserve shell metacharacters). func_append_quoted args "$file" done if test "X$opt_dry_run" = Xfalse; then if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${save_$lt_var+set}\" = set; then $lt_var=\$save_$lt_var; export $lt_var else $lt_unset $lt_var fi" done # Now prepare to actually exec the command. exec_cmd="\$cmd$args" else # Display what would be done. if test -n "$shlibpath_var"; then eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\"" echo "export $shlibpath_var" fi $ECHO "$cmd$args" exit $EXIT_SUCCESS fi } test "$opt_mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug libs= libdirs= admincmds= for opt in "$nonopt" ${1+"$@"} do if test -d "$opt"; then func_append libdirs " $opt" elif test -f "$opt"; then if func_lalib_unsafe_p "$opt"; then func_append libs " $opt" else func_warning "\`$opt' is not a valid libtool archive" fi else func_fatal_error "invalid argument \`$opt'" fi done if test -n "$libs"; then if test -n "$lt_sysroot"; then sysroot_regex=`$ECHO "$lt_sysroot" | $SED "$sed_make_literal_regex"` sysroot_cmd="s/\([ ']\)$sysroot_regex/\1/g;" else sysroot_cmd= fi # Remove sysroot references if $opt_dry_run; then for lib in $libs; do echo "removing references to $lt_sysroot and \`=' prefixes from $lib" done else tmpdir=`func_mktempdir` for lib in $libs; do sed -e "${sysroot_cmd} s/\([ ']-[LR]\)=/\1/g; s/\([ ']\)=/\1/g" $lib \ > $tmpdir/tmp-la mv -f $tmpdir/tmp-la $lib done ${RM}r "$tmpdir" fi fi if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. func_execute_cmds "$finish_cmds" 'admincmds="$admincmds '"$cmd"'"' fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $opt_dry_run || eval "$cmds" || func_append admincmds " $cmds" fi done fi # Exit here if they wanted silent mode. $opt_silent && exit $EXIT_SUCCESS if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then echo "----------------------------------------------------------------------" echo "Libraries have been installed in:" for libdir in $libdirs; do $ECHO " $libdir" done echo echo "If you ever happen to want to link against installed libraries" echo "in a given directory, LIBDIR, you must either use libtool, and" echo "specify the full pathname of the library, or use the \`-LLIBDIR'" echo "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then echo " - add LIBDIR to the \`$shlibpath_var' environment variable" echo " during execution" fi if test -n "$runpath_var"; then echo " - add LIBDIR to the \`$runpath_var' environment variable" echo " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $ECHO " - use the \`$flag' linker flag" fi if test -n "$admincmds"; then $ECHO " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then echo " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'" fi echo echo "See any operating system documentation about shared libraries for" case $host in solaris2.[6789]|solaris2.1[0-9]) echo "more information, such as the ld(1), crle(1) and ld.so(8) manual" echo "pages." ;; *) echo "more information, such as the ld(1) and ld.so(8) manual pages." ;; esac echo "----------------------------------------------------------------------" fi exit $EXIT_SUCCESS } test "$opt_mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # Allow the use of GNU shtool's install command. case $nonopt in *shtool*) :;; *) false;; esac; then # Aesthetically quote it. func_quote_for_eval "$nonopt" install_prog="$func_quote_for_eval_result " arg=$1 shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. func_quote_for_eval "$arg" func_append install_prog "$func_quote_for_eval_result" install_shared_prog=$install_prog case " $install_prog " in *[\\\ /]cp\ *) install_cp=: ;; *) install_cp=false ;; esac # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=no stripme= no_mode=: for arg do arg2= if test -n "$dest"; then func_append files " $dest" dest=$arg continue fi case $arg in -d) isdir=yes ;; -f) if $install_cp; then :; else prev=$arg fi ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then if test "x$prev" = x-m && test -n "$install_override_mode"; then arg2=$install_override_mode no_mode=false fi prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. func_quote_for_eval "$arg" func_append install_prog " $func_quote_for_eval_result" if test -n "$arg2"; then func_quote_for_eval "$arg2" fi func_append install_shared_prog " $func_quote_for_eval_result" done test -z "$install_prog" && \ func_fatal_help "you must specify an install program" test -n "$prev" && \ func_fatal_help "the \`$prev' option requires an argument" if test -n "$install_override_mode" && $no_mode; then if $install_cp; then :; else func_quote_for_eval "$install_override_mode" func_append install_shared_prog " -m $func_quote_for_eval_result" fi fi if test -z "$files"; then if test -z "$dest"; then func_fatal_help "no file or destination specified" else func_fatal_help "you must specify a destination" fi fi # Strip any trailing slash from the destination. func_stripname '' '/' "$dest" dest=$func_stripname_result # Check to see that the destination is a directory. test -d "$dest" && isdir=yes if test "$isdir" = yes; then destdir="$dest" destname= else func_dirname_and_basename "$dest" "" "." destdir="$func_dirname_result" destname="$func_basename_result" # Not a directory, so check to see that there is only one file specified. set dummy $files; shift test "$#" -gt 1 && \ func_fatal_help "\`$dest' is not a directory" fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) func_fatal_help "\`$destdir' must be an absolute directory name" ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. func_append staticlibs " $file" ;; *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$file' is not a valid libtool archive" library_names= old_library= relink_command= func_source "$file" # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) func_append current_libdirs " $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) func_append future_libdirs " $libdir" ;; esac fi func_dirname "$file" "/" "" dir="$func_dirname_result" func_append dir "$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$ECHO "$destdir" | $SED -e "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. test "$inst_prefix_dir" = "$destdir" && \ func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir" if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%%"` fi func_warning "relinking \`$file'" func_show_eval "$relink_command" \ 'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"' fi # See the names of the shared library. set dummy $library_names; shift if test -n "$1"; then realname="$1" shift srcname="$realname" test -n "$relink_command" && srcname="$realname"T # Install the shared library and build the symlinks. func_show_eval "$install_shared_prog $dir/$srcname $destdir/$realname" \ 'exit $?' tstripme="$stripme" case $host_os in cygwin* | mingw* | pw32* | cegcc*) case $realname in *.dll.a) tstripme="" ;; esac ;; esac if test -n "$tstripme" && test -n "$striplib"; then func_show_eval "$striplib $destdir/$realname" 'exit $?' fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try `ln -sf' first, because the `ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do test "$linkname" != "$realname" \ && func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })" done fi # Do each command in the postinstall commands. lib="$destdir/$realname" func_execute_cmds "$postinstall_cmds" 'exit $?' fi # Install the pseudo-library for information purposes. func_basename "$file" name="$func_basename_result" instname="$dir/$name"i func_show_eval "$install_prog $instname $destdir/$name" 'exit $?' # Maybe install the static library, too. test -n "$old_library" && func_append staticlibs " $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) func_lo2o "$destfile" staticdest=$func_lo2o_result ;; *.$objext) staticdest="$destfile" destfile= ;; *) func_fatal_help "cannot copy a libtool object to \`$destfile'" ;; esac # Install the libtool object if requested. test -n "$destfile" && \ func_show_eval "$install_prog $file $destfile" 'exit $?' # Install the old object if enabled. if test "$build_old_libs" = yes; then # Deduce the name of the old-style object file. func_lo2o "$file" staticobj=$func_lo2o_result func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?' fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext="" case $file in *.exe) if test ! -f "$file"; then func_stripname '' '.exe' "$file" file=$func_stripname_result stripped_ext=".exe" fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin* | *mingw*) if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" wrapper=$func_ltwrapper_scriptname_result else func_stripname '' '.exe' "$file" wrapper=$func_stripname_result fi ;; *) wrapper=$file ;; esac if func_ltwrapper_script_p "$wrapper"; then notinst_deplibs= relink_command= func_source "$wrapper" # Check the variables that should have been set. test -z "$generated_by_libtool_version" && \ func_fatal_error "invalid libtool wrapper script \`$wrapper'" finalize=yes for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then func_source "$lib" fi libfile="$libdir/"`$ECHO "$lib" | $SED 's%^.*/%%g'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; then tmpdir=`func_mktempdir` func_basename "$file$stripped_ext" file="$func_basename_result" outputname="$tmpdir/$file" # Replace the output file specification. relink_command=`$ECHO "$relink_command" | $SED 's%@OUTPUT@%'"$outputname"'%g'` $opt_silent || { func_quote_for_expand "$relink_command" eval "func_echo $func_quote_for_expand_result" } if eval "$relink_command"; then : else func_error "error: relink \`$file' with the above command before installing it" $opt_dry_run || ${RM}r "$tmpdir" continue fi file="$outputname" else func_warning "cannot relink \`$file'" fi } else # Install the binary that we compiled earlier. file=`$ECHO "$file$stripped_ext" | $SED "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) func_stripname '' '.exe' "$destfile" destfile=$func_stripname_result ;; esac ;; esac func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?' $opt_dry_run || if test -n "$outputname"; then ${RM}r "$tmpdir" fi ;; esac done for file in $staticlibs; do func_basename "$file" name="$func_basename_result" # Set up the ranlib parameters. oldlib="$destdir/$name" func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result func_show_eval "$install_prog \$file \$oldlib" 'exit $?' if test -n "$stripme" && test -n "$old_striplib"; then func_show_eval "$old_striplib $tool_oldlib" 'exit $?' fi # Do each command in the postinstall commands. func_execute_cmds "$old_postinstall_cmds" 'exit $?' done test -n "$future_libdirs" && \ func_warning "remember to run \`$progname --finish$future_libdirs'" if test -n "$current_libdirs"; then # Maybe just do a dry run. $opt_dry_run && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi } test "$opt_mode" = install && func_mode_install ${1+"$@"} # func_generate_dlsyms outputname originator pic_p # Extract symbols from dlprefiles and create ${outputname}S.o with # a dlpreopen symbol table. func_generate_dlsyms () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then if test -n "$NM" && test -n "$global_symbol_pipe"; then my_dlsyms="${my_outputname}S.c" else func_error "not configured to extract global symbols from dlpreopened files" fi fi if test -n "$my_dlsyms"; then case $my_dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist="$output_objdir/${my_outputname}.nm" func_show_eval "$RM $nlist ${nlist}S ${nlist}T" # Parse the name list into a source file. func_verbose "creating $output_objdir/$my_dlsyms" $opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\ /* $my_dlsyms - symbol resolution table for \`$my_outputname' dlsym emulation. */ /* Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION */ #ifdef __cplusplus extern \"C\" { #endif #if defined(__GNUC__) && (((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4)) || (__GNUC__ > 4)) #pragma GCC diagnostic ignored \"-Wstrict-prototypes\" #endif /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE) /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined(__osf__) /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; then func_verbose "generating symbol list for \`$output'" $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$ECHO "$objs$old_deplibs" | $SP2NL | $SED "$lo2o" | $NL2SP` for progfile in $progfiles; do func_to_tool_file "$progfile" func_convert_file_msys_to_w32 func_verbose "extracting global C symbols from \`$func_to_tool_file_result'" $opt_dry_run || eval "$NM $func_to_tool_file_result | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $opt_dry_run || { eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi if test -n "$export_symbols_regex"; then $opt_dry_run || { eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols="$output_objdir/$outputname.exp" $opt_dry_run || { $RM $export_symbols eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac } else $opt_dry_run || { eval "${SED} -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac } fi fi for dlprefile in $dlprefiles; do func_verbose "extracting global C symbols from \`$dlprefile'" func_basename "$dlprefile" name="$func_basename_result" case $host in *cygwin* | *mingw* | *cegcc* ) # if an import library, we need to obtain dlname if func_win32_import_lib_p "$dlprefile"; then func_tr_sh "$dlprefile" eval "curr_lafile=\$libfile_$func_tr_sh_result" dlprefile_dlbasename="" if test -n "$curr_lafile" && func_lalib_p "$curr_lafile"; then # Use subshell, to avoid clobbering current variable values dlprefile_dlname=`source "$curr_lafile" && echo "$dlname"` if test -n "$dlprefile_dlname" ; then func_basename "$dlprefile_dlname" dlprefile_dlbasename="$func_basename_result" else # no lafile. user explicitly requested -dlpreopen . $sharedlib_from_linklib_cmd "$dlprefile" dlprefile_dlbasename=$sharedlib_from_linklib_result fi fi $opt_dry_run || { if test -n "$dlprefile_dlbasename" ; then eval '$ECHO ": $dlprefile_dlbasename" >> "$nlist"' else func_warning "Could not compute DLL name from $name" eval '$ECHO ": $name " >> "$nlist"' fi func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe | $SED -e '/I __imp/d' -e 's/I __nm_/D /;s/_nm__//' >> '$nlist'" } else # not an import lib $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } fi ;; *) $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } ;; esac done $opt_dry_run || { # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $MV "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if $GREP -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else $GREP -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"' else echo '/* NONE */' >> "$output_objdir/$my_dlsyms" fi echo >> "$output_objdir/$my_dlsyms" "\ /* The mapping between symbol names and symbols. */ typedef struct { const char *name; void *address; } lt_dlsymlist; extern LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[]; LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," case $need_lib_prefix in no) eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; *) eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; esac echo >> "$output_objdir/$my_dlsyms" "\ {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_${my_prefix}_LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " } # !$opt_dry_run pic_flag_for_symtable= case "$compile_command " in *" -static "*) ;; *) case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2.*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;; *-*-hpux*) pic_flag_for_symtable=" $pic_flag" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; esac ;; esac symtab_cflags= for arg in $LTCFLAGS; do case $arg in -pie | -fpie | -fPIE) ;; *) func_append symtab_cflags " $arg" ;; esac done # Now compile the dynamic symbol file. func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?' # Clean up the generated files. func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T"' # Transform the symbol file into the correct name. symfileobj="$output_objdir/${my_outputname}S.$objext" case $host in *cygwin* | *mingw* | *cegcc* ) if test -f "$output_objdir/$my_outputname.def"; then compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` else compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` fi ;; *) compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` ;; esac ;; *) func_fatal_error "unknown suffix for \`$my_dlsyms'" ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$ECHO "$compile_command" | $SED "s% @SYMFILE@%%"` finalize_command=`$ECHO "$finalize_command" | $SED "s% @SYMFILE@%%"` fi } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. # Despite the name, also deal with 64 bit binaries. func_win32_libid () { $opt_debug win32_libid_type="unknown" win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static # Keep the egrep pattern in sync with the one in _LT_CHECK_MAGIC_METHOD. if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | $EGREP 'file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' >/dev/null; then func_to_tool_file "$1" func_convert_file_msys_to_w32 win32_nmres=`eval $NM -f posix -A \"$func_to_tool_file_result\" | $SED -n -e ' 1,100{ / I /{ s,.*,import, p q } }'` case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $ECHO "$win32_libid_type" } # func_cygming_dll_for_implib ARG # # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib () { $opt_debug sharedlib_from_linklib_result=`$DLLTOOL --identify-strict --identify "$1"` } # func_cygming_dll_for_implib_fallback_core SECTION_NAME LIBNAMEs # # The is the core of a fallback implementation of a # platform-specific function to extract the name of the # DLL associated with the specified import library LIBNAME. # # SECTION_NAME is either .idata$6 or .idata$7, depending # on the platform and compiler that created the implib. # # Echos the name of the DLL associated with the # specified import library. func_cygming_dll_for_implib_fallback_core () { $opt_debug match_literal=`$ECHO "$1" | $SED "$sed_make_literal_regex"` $OBJDUMP -s --section "$1" "$2" 2>/dev/null | $SED '/^Contents of section '"$match_literal"':/{ # Place marker at beginning of archive member dllname section s/.*/====MARK====/ p d } # These lines can sometimes be longer than 43 characters, but # are always uninteresting /:[ ]*file format pe[i]\{,1\}-/d /^In archive [^:]*:/d # Ensure marker is printed /^====MARK====/p # Remove all lines with less than 43 characters /^.\{43\}/!d # From remaining lines, remove first 43 characters s/^.\{43\}//' | $SED -n ' # Join marker and all lines until next marker into a single line /^====MARK====/ b para H $ b para b :para x s/\n//g # Remove the marker s/^====MARK====// # Remove trailing dots and whitespace s/[\. \t]*$// # Print /./p' | # we now have a list, one entry per line, of the stringified # contents of the appropriate section of all members of the # archive which possess that section. Heuristic: eliminate # all those which have a first or second character that is # a '.' (that is, objdump's representation of an unprintable # character.) This should work for all archives with less than # 0x302f exports -- but will fail for DLLs whose name actually # begins with a literal '.' or a single character followed by # a '.'. # # Of those that remain, print the first one. $SED -e '/^\./d;/^.\./d;q' } # func_cygming_gnu_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is a GNU/binutils-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_gnu_implib_p () { $opt_debug func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_gnu_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $EGREP ' (_head_[A-Za-z0-9_]+_[ad]l*|[A-Za-z0-9_]+_[ad]l*_iname)$'` test -n "$func_cygming_gnu_implib_tmp" } # func_cygming_ms_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is an MS-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_ms_implib_p () { $opt_debug func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_ms_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $GREP '_NULL_IMPORT_DESCRIPTOR'` test -n "$func_cygming_ms_implib_tmp" } # func_cygming_dll_for_implib_fallback ARG # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # # This fallback implementation is for use when $DLLTOOL # does not support the --identify-strict option. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib_fallback () { $opt_debug if func_cygming_gnu_implib_p "$1" ; then # binutils import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$7' "$1"` elif func_cygming_ms_implib_p "$1" ; then # ms-generated import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$6' "$1"` else # unknown sharedlib_from_linklib_result="" fi } # func_extract_an_archive dir oldlib func_extract_an_archive () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" if test "$lock_old_archive_extraction" = yes; then lockfile=$f_ex_an_ar_oldlib.lock until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done fi func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" \ 'stat=$?; rm -f "$lockfile"; exit $stat' if test "$lock_old_archive_extraction" = yes; then $opt_dry_run || rm -f "$lockfile" fi if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" fi } # func_extract_archives gentop oldlib ... func_extract_archives () { $opt_debug my_gentop="$1"; shift my_oldlibs=${1+"$@"} my_oldobjs="" my_xlib="" my_xabs="" my_xdir="" for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs="$my_xlib" ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac func_basename "$my_xlib" my_xlib="$func_basename_result" my_xlib_u=$my_xlib while :; do case " $extracted_archives " in *" $my_xlib_u "*) func_arith $extracted_serial + 1 extracted_serial=$func_arith_result my_xlib_u=lt$extracted_serial-$my_xlib ;; *) break ;; esac done extracted_archives="$extracted_archives $my_xlib_u" my_xdir="$my_gentop/$my_xlib_u" func_mkdir_p "$my_xdir" case $host in *-darwin*) func_verbose "Extracting $my_xabs" # Do not bother doing anything if just a dry run $opt_dry_run || { darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` darwin_base_archive=`basename "$darwin_archive"` darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true` if test -n "$darwin_arches"; then darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= func_verbose "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches ; do func_mkdir_p "unfat-$$/${darwin_base_archive}-${darwin_arch}" $LIPO -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}" cd "unfat-$$/${darwin_base_archive}-${darwin_arch}" func_extract_an_archive "`pwd`" "${darwin_base_archive}" cd "$darwin_curdir" $RM "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" done # $darwin_arches ## Okay now we've a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP` $LIPO -create -output "$darwin_file" $darwin_files done # $darwin_filelist $RM -rf unfat-$$ cd "$darwin_orig_dir" else cd $darwin_orig_dir func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches } # !$opt_dry_run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | sort | $NL2SP` done func_extract_archives_result="$my_oldobjs" } # func_emit_wrapper [arg=no] # # Emit a libtool wrapper script on stdout. # Don't directly open a file because we may want to # incorporate the script contents within a cygwin/mingw # wrapper executable. Must ONLY be called from within # func_mode_link because it depends on a number of variables # set therein. # # ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR # variable will take. If 'yes', then the emitted script # will assume that the directory in which it is stored is # the $objdir directory. This is a cygwin/mingw-specific # behavior. func_emit_wrapper () { func_emit_wrapper_arg1=${1-no} $ECHO "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='$sed_quote_subst' # Be Bourne compatible if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs 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 BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variables: generated_by_libtool_version='$macro_version' notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$ECHO are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then file=\"\$0\"" qECHO=`$ECHO "$ECHO" | $SED "$sed_quote_subst"` $ECHO "\ # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } ECHO=\"$qECHO\" fi # Very basic option parsing. These options are (a) specific to # the libtool wrapper, (b) are identical between the wrapper # /script/ and the wrapper /executable/ which is used only on # windows platforms, and (c) all begin with the string "--lt-" # (application programs are unlikely to have options which match # this pattern). # # There are only two supported options: --lt-debug and # --lt-dump-script. There is, deliberately, no --lt-help. # # The first argument to this parsing function should be the # script's $0 value, followed by "$@". lt_option_debug= func_parse_lt_options () { lt_script_arg0=\$0 shift for lt_opt do case \"\$lt_opt\" in --lt-debug) lt_option_debug=1 ;; --lt-dump-script) lt_dump_D=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%/[^/]*$%%'\` test \"X\$lt_dump_D\" = \"X\$lt_script_arg0\" && lt_dump_D=. lt_dump_F=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%^.*/%%'\` cat \"\$lt_dump_D/\$lt_dump_F\" exit 0 ;; --lt-*) \$ECHO \"Unrecognized --lt- option: '\$lt_opt'\" 1>&2 exit 1 ;; esac done # Print the debug banner immediately: if test -n \"\$lt_option_debug\"; then echo \"${outputname}:${output}:\${LINENO}: libtool wrapper (GNU $PACKAGE$TIMESTAMP) $VERSION\" 1>&2 fi } # Used when --lt-debug. Prints its arguments to stdout # (redirection is the responsibility of the caller) func_lt_dump_args () { lt_dump_args_N=1; for lt_arg do \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[\$lt_dump_args_N]: \$lt_arg\" lt_dump_args_N=\`expr \$lt_dump_args_N + 1\` done } # Core function for launching the target application func_exec_program_core () { " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2* | *-cegcc*) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[0]: \$progdir\\\\\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[0]: \$progdir/\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $ECHO "\ \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2 exit 1 } # A function to encapsulate launching the target application # Strips options in the --lt-* namespace from \$@ and # launches target application with the remaining arguments. func_exec_program () { case \" \$* \" in *\\ --lt-*) for lt_wr_arg do case \$lt_wr_arg in --lt-*) ;; *) set x \"\$@\" \"\$lt_wr_arg\"; shift;; esac shift done ;; esac func_exec_program_core \${1+\"\$@\"} } # Parse options func_parse_lt_options \"\$0\" \${1+\"\$@\"} # Find the directory that this script lives in. thisdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | $SED -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$ECHO \"\$file\" | $SED 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | $SED -n 's/.*-> //p'\` done # Usually 'no', except on cygwin/mingw when embedded into # the cwrapper. WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1 if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then # special case for '.' if test \"\$thisdir\" = \".\"; then thisdir=\`pwd\` fi # remove .libs from thisdir case \"\$thisdir\" in *[\\\\/]$objdir ) thisdir=\`\$ECHO \"\$thisdir\" | $SED 's%[\\\\/][^\\\\/]*$%%'\` ;; $objdir ) thisdir=. ;; esac fi # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test "$fast_install" = yes; then $ECHO "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | ${SED} 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $MKDIR \"\$progdir\" else $RM \"\$progdir/\$file\" fi" $ECHO "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $ECHO \"\$relink_command_output\" >&2 $RM \"\$progdir/\$file\" exit 1 fi fi $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $RM \"\$progdir/\$program\"; $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; } $RM \"\$progdir/\$file\" fi" else $ECHO "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $ECHO "\ if test -f \"\$progdir/\$program\"; then" # fixup the dll searchpath if we need to. # # Fix the DLL searchpath if we need to. Do this before prepending # to shlibpath, because on Windows, both are PATH and uninstalled # libraries must come first. if test -n "$dllsearchpath"; then $ECHO "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi # Export our shlibpath_var if we have one. if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $ECHO "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$ECHO \"\$$shlibpath_var\" | $SED 's/::*\$//'\` export $shlibpath_var " fi $ECHO "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. func_exec_program \${1+\"\$@\"} fi else # The program doesn't exist. \$ECHO \"\$0: error: \\\`\$progdir/\$program' does not exist\" 1>&2 \$ECHO \"This script is just a wrapper for \$program.\" 1>&2 \$ECHO \"See the $PACKAGE documentation for more information.\" 1>&2 exit 1 fi fi\ " } # func_emit_cwrapperexe_src # emit the source code for a wrapper executable on stdout # Must ONLY be called from within func_mode_link because # it depends on a number of variable set therein. func_emit_cwrapperexe_src () { cat < #include #ifdef _MSC_VER # include # include # include #else # include # include # ifdef __CYGWIN__ # include # endif #endif #include #include #include #include #include #include #include #include /* declarations of non-ANSI functions */ #if defined(__MINGW32__) # ifdef __STRICT_ANSI__ int _putenv (const char *); # endif #elif defined(__CYGWIN__) # ifdef __STRICT_ANSI__ char *realpath (const char *, char *); int putenv (char *); int setenv (const char *, const char *, int); # endif /* #elif defined (other platforms) ... */ #endif /* portability defines, excluding path handling macros */ #if defined(_MSC_VER) # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv # define S_IXUSR _S_IEXEC # ifndef _INTPTR_T_DEFINED # define _INTPTR_T_DEFINED # define intptr_t int # endif #elif defined(__MINGW32__) # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv #elif defined(__CYGWIN__) # define HAVE_SETENV # define FOPEN_WB "wb" /* #elif defined (other platforms) ... */ #endif #if defined(PATH_MAX) # define LT_PATHMAX PATH_MAX #elif defined(MAXPATHLEN) # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef S_IXOTH # define S_IXOTH 0 #endif #ifndef S_IXGRP # define S_IXGRP 0 #endif /* path handling portability macros */ #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \ defined (__OS2__) # define HAVE_DOS_BASED_FILE_SYSTEM # define FOPEN_WB "wb" # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #ifndef FOPEN_WB # define FOPEN_WB "w" #endif #ifndef _O_BINARY # define _O_BINARY 0 #endif #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free ((void *) stale); stale = 0; } \ } while (0) #if defined(LT_DEBUGWRAPPER) static int lt_debug = 1; #else static int lt_debug = 0; #endif const char *program_name = "libtool-wrapper"; /* in case xstrdup fails */ void *xmalloc (size_t num); char *xstrdup (const char *string); const char *base_name (const char *name); char *find_executable (const char *wrapper); char *chase_symlinks (const char *pathspec); int make_executable (const char *path); int check_executable (const char *path); char *strendzap (char *str, const char *pat); void lt_debugprintf (const char *file, int line, const char *fmt, ...); void lt_fatal (const char *file, int line, const char *message, ...); static const char *nonnull (const char *s); static const char *nonempty (const char *s); void lt_setenv (const char *name, const char *value); char *lt_extend_str (const char *orig_value, const char *add, int to_end); void lt_update_exe_path (const char *name, const char *value); void lt_update_lib_path (const char *name, const char *value); char **prepare_spawn (char **argv); void lt_dump_script (FILE *f); EOF cat <= 0) && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return 1; else return 0; } int make_executable (const char *path) { int rval = 0; struct stat st; lt_debugprintf (__FILE__, __LINE__, "(make_executable): %s\n", nonempty (path)); if ((!path) || (!*path)) return 0; if (stat (path, &st) >= 0) { rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR); } return rval; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise Does not chase symlinks, even on platforms that support them. */ char * find_executable (const char *wrapper) { int has_slash = 0; const char *p; const char *p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; int tmp_len; char *concat_name; lt_debugprintf (__FILE__, __LINE__, "(find_executable): %s\n", nonempty (wrapper)); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined (HAVE_DOS_BASED_FILE_SYSTEM) if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } #if defined (HAVE_DOS_BASED_FILE_SYSTEM) } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char *path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char *q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR (*q)) break; p_len = q - p; p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC (char, p_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); return NULL; } char * chase_symlinks (const char *pathspec) { #ifndef S_ISLNK return xstrdup (pathspec); #else char buf[LT_PATHMAX]; struct stat s; char *tmp_pathspec = xstrdup (pathspec); char *p; int has_symlinks = 0; while (strlen (tmp_pathspec) && !has_symlinks) { lt_debugprintf (__FILE__, __LINE__, "checking path component for symlinks: %s\n", tmp_pathspec); if (lstat (tmp_pathspec, &s) == 0) { if (S_ISLNK (s.st_mode) != 0) { has_symlinks = 1; break; } /* search backwards for last DIR_SEPARATOR */ p = tmp_pathspec + strlen (tmp_pathspec) - 1; while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) p--; if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) { /* no more DIR_SEPARATORS left */ break; } *p = '\0'; } else { lt_fatal (__FILE__, __LINE__, "error accessing file \"%s\": %s", tmp_pathspec, nonnull (strerror (errno))); } } XFREE (tmp_pathspec); if (!has_symlinks) { return xstrdup (pathspec); } tmp_pathspec = realpath (pathspec, buf); if (tmp_pathspec == 0) { lt_fatal (__FILE__, __LINE__, "could not follow symlinks for %s", pathspec); } return xstrdup (tmp_pathspec); #endif } char * strendzap (char *str, const char *pat) { size_t len, patlen; assert (str != NULL); assert (pat != NULL); len = strlen (str); patlen = strlen (pat); if (patlen <= len) { str += len - patlen; if (strcmp (str, pat) == 0) *str = '\0'; } return str; } void lt_debugprintf (const char *file, int line, const char *fmt, ...) { va_list args; if (lt_debug) { (void) fprintf (stderr, "%s:%s:%d: ", program_name, file, line); va_start (args, fmt); (void) vfprintf (stderr, fmt, args); va_end (args); } } static void lt_error_core (int exit_status, const char *file, int line, const char *mode, const char *message, va_list ap) { fprintf (stderr, "%s:%s:%d: %s: ", program_name, file, line, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *file, int line, const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, file, line, "FATAL", message, ap); va_end (ap); } static const char * nonnull (const char *s) { return s ? s : "(null)"; } static const char * nonempty (const char *s) { return (s && !*s) ? "(empty)" : nonnull (s); } void lt_setenv (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_setenv) setting '%s' to '%s'\n", nonnull (name), nonnull (value)); { #ifdef HAVE_SETENV /* always make a copy, for consistency with !HAVE_SETENV */ char *str = xstrdup (value); setenv (name, str, 1); #else int len = strlen (name) + 1 + strlen (value) + 1; char *str = XMALLOC (char, len); sprintf (str, "%s=%s", name, value); if (putenv (str) != EXIT_SUCCESS) { XFREE (str); } #endif } } char * lt_extend_str (const char *orig_value, const char *add, int to_end) { char *new_value; if (orig_value && *orig_value) { int orig_value_len = strlen (orig_value); int add_len = strlen (add); new_value = XMALLOC (char, add_len + orig_value_len + 1); if (to_end) { strcpy (new_value, orig_value); strcpy (new_value + orig_value_len, add); } else { strcpy (new_value, add); strcpy (new_value + add_len, orig_value); } } else { new_value = xstrdup (add); } return new_value; } void lt_update_exe_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_exe_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); /* some systems can't cope with a ':'-terminated path #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\0'; } lt_setenv (name, new_value); XFREE (new_value); } } void lt_update_lib_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_lib_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); } } EOF case $host_os in mingw*) cat <<"EOF" /* Prepares an argument vector before calling spawn(). Note that spawn() does not by itself call the command interpreter (getenv ("COMSPEC") != NULL ? getenv ("COMSPEC") : ({ OSVERSIONINFO v; v.dwOSVersionInfoSize = sizeof(OSVERSIONINFO); GetVersionEx(&v); v.dwPlatformId == VER_PLATFORM_WIN32_NT; }) ? "cmd.exe" : "command.com"). Instead it simply concatenates the arguments, separated by ' ', and calls CreateProcess(). We must quote the arguments since Win32 CreateProcess() interprets characters like ' ', '\t', '\\', '"' (but not '<' and '>') in a special way: - Space and tab are interpreted as delimiters. They are not treated as delimiters if they are surrounded by double quotes: "...". - Unescaped double quotes are removed from the input. Their only effect is that within double quotes, space and tab are treated like normal characters. - Backslashes not followed by double quotes are not special. - But 2*n+1 backslashes followed by a double quote become n backslashes followed by a double quote (n >= 0): \" -> " \\\" -> \" \\\\\" -> \\" */ #define SHELL_SPECIAL_CHARS "\"\\ \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" #define SHELL_SPACE_CHARS " \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" char ** prepare_spawn (char **argv) { size_t argc; char **new_argv; size_t i; /* Count number of arguments. */ for (argc = 0; argv[argc] != NULL; argc++) ; /* Allocate new argument vector. */ new_argv = XMALLOC (char *, argc + 1); /* Put quoted arguments into the new argument vector. */ for (i = 0; i < argc; i++) { const char *string = argv[i]; if (string[0] == '\0') new_argv[i] = xstrdup ("\"\""); else if (strpbrk (string, SHELL_SPECIAL_CHARS) != NULL) { int quote_around = (strpbrk (string, SHELL_SPACE_CHARS) != NULL); size_t length; unsigned int backslashes; const char *s; char *quoted_string; char *p; length = 0; backslashes = 0; if (quote_around) length++; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') length += backslashes + 1; length++; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) length += backslashes + 1; quoted_string = XMALLOC (char, length + 1); p = quoted_string; backslashes = 0; if (quote_around) *p++ = '"'; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') { unsigned int j; for (j = backslashes + 1; j > 0; j--) *p++ = '\\'; } *p++ = c; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) { unsigned int j; for (j = backslashes; j > 0; j--) *p++ = '\\'; *p++ = '"'; } *p = '\0'; new_argv[i] = quoted_string; } else new_argv[i] = (char *) string; } new_argv[argc] = NULL; return new_argv; } EOF ;; esac cat <<"EOF" void lt_dump_script (FILE* f) { EOF func_emit_wrapper yes | $SED -n -e ' s/^\(.\{79\}\)\(..*\)/\1\ \2/ h s/\([\\"]\)/\\\1/g s/$/\\n/ s/\([^\n]*\).*/ fputs ("\1", f);/p g D' cat <<"EOF" } EOF } # end: func_emit_cwrapperexe_src # func_win32_import_lib_p ARG # True if ARG is an import lib, as indicated by $file_magic_cmd func_win32_import_lib_p () { $opt_debug case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in *import*) : ;; *) false ;; esac } # func_mode_link arg... func_mode_link () { $opt_debug case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) # It is impossible to link a dll without this setting, and # we shouldn't force the makefile maintainer to figure out # which system we are compiling for in order to pass an extra # flag for every libtool invocation. # allow_undefined=no # FIXME: Unfortunately, there are problems with the above when trying # to make a dll which has undefined symbols, in which case not # even a static library is built. For now, we need to specify # -no-undefined on the libtool link line when we can be certain # that all symbols are satisfied, otherwise we get a static library. allow_undefined=yes ;; *) allow_undefined=yes ;; esac libtool_args=$nonopt base_compile="$nonopt $@" compile_command=$nonopt finalize_command=$nonopt compile_rpath= finalize_rpath= compile_shlibpath= finalize_shlibpath= convenience= old_convenience= deplibs= old_deplibs= compiler_flags= linker_flags= dllsearchpath= lib_search_path=`pwd` inst_prefix_dir= new_inherited_linker_flags= avoid_version=no bindir= dlfiles= dlprefiles= dlself=no export_dynamic=no export_symbols= export_symbols_regex= generated= libobjs= ltlibs= module=no no_install=no objs= non_pic_objects= precious_files_regex= prefer_static_libs=no preload=no prev= prevarg= release= rpath= xrpath= perm_rpath= temp_rpath= thread_safe=no vinfo= vinfo_number=no weak_libs= single_module="${wl}-single_module" func_infer_tag $base_compile # We need to know -static, to get the right output filenames. for arg do case $arg in -shared) test "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && test -z "$link_static_flag"; then func_warning "complete static linking is impossible in this configuration" fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; -static) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built ;; -static-libtool-libs) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; esac build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg="$1" shift func_quote_for_eval "$arg" qarg=$func_quote_for_eval_unquoted_result func_append libtool_args " $func_quote_for_eval_result" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) func_append compile_command " @OUTPUT@" func_append finalize_command " @OUTPUT@" ;; esac case $prev in bindir) bindir="$arg" prev= continue ;; dlfiles|dlprefiles) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; then func_append dlfiles " $arg" else func_append dlprefiles " $arg" fi prev= continue ;; esac ;; expsyms) export_symbols="$arg" test -f "$arg" \ || func_fatal_error "symbol file \`$arg' does not exist" prev= continue ;; expsyms_regex) export_symbols_regex="$arg" prev= continue ;; framework) case $host in *-*-darwin*) case "$deplibs " in *" $qarg.ltframework "*) ;; *) func_append deplibs " $qarg.ltframework" # this is fixed later ;; esac ;; esac prev= continue ;; inst_prefix) inst_prefix_dir="$arg" prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat "$save_arg"` do # func_append moreargs " $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi done else func_fatal_error "link input file \`$arg' does not exist" fi arg=$save_arg prev= continue ;; precious_regex) precious_files_regex="$arg" prev= continue ;; release) release="-$arg" prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac if test "$prev" = rpath; then case "$rpath " in *" $arg "*) ;; *) func_append rpath " $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) func_append xrpath " $arg" ;; esac fi prev= continue ;; shrext) shrext_cmds="$arg" prev= continue ;; weak) func_append weak_libs " $arg" prev= continue ;; xcclinker) func_append linker_flags " $qarg" func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xcompiler) func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xlinker) func_append linker_flags " $qarg" func_append compiler_flags " $wl$qarg" prev= func_append compile_command " $wl$qarg" func_append finalize_command " $wl$qarg" continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg="$arg" case $arg in -all-static) if test -n "$link_static_flag"; then # See comment for -static flag below, for more details. func_append compile_command " $link_static_flag" func_append finalize_command " $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. func_fatal_error "\`-allow-undefined' must not be used because it is the default" ;; -avoid-version) avoid_version=yes continue ;; -bindir) prev=bindir continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then func_fatal_error "more than one -exported-symbols argument is not allowed" fi if test "X$arg" = "X-export-symbols"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework) prev=framework continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) func_append compile_command " $arg" func_append finalize_command " $arg" ;; esac continue ;; -L*) func_stripname "-L" '' "$arg" if test -z "$func_stripname_result"; then if test "$#" -gt 0; then func_fatal_error "require no space between \`-L' and \`$1'" else func_fatal_error "need path for \`-L' option" fi fi func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` test -z "$absdir" && \ func_fatal_error "cannot determine absolute directory name of \`$dir'" dir="$absdir" ;; esac case "$deplibs " in *" -L$dir "* | *" $arg "*) # Will only happen for absolute or sysroot arguments ;; *) # Preserve sysroot, but never include relative directories case $dir in [\\/]* | [A-Za-z]:[\\/]* | =*) func_append deplibs " $arg" ;; *) func_append deplibs " -L$dir" ;; esac func_append lib_search_path " $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "$dir" | $SED 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; ::) dllsearchpath=$dir;; *) func_append dllsearchpath ":$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac continue ;; -l*) if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc* | *-*-haiku*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test "X$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework func_append deplibs " System.ltframework" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test "X$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi func_append deplibs " $arg" continue ;; -module) module=yes continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. # Darwin uses the -arch flag to determine output architecture. -model|-arch|-isysroot|--sysroot) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" case "$new_inherited_linker_flags " in *" $arg "*) ;; * ) func_append new_inherited_linker_flags " $arg" ;; esac continue ;; -multi_module) single_module="${wl}-multi_module" continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*) # The PATH hackery in wrapper scripts is required on Windows # and Darwin in order for the loader to find any dlls it needs. func_warning "\`-no-install' is ignored for $host" func_warning "assuming \`-no-fast-install' instead" fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) func_stripname '-R' '' "$arg" dir=$func_stripname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; =*) func_stripname '=' '' "$dir" dir=$lt_sysroot$func_stripname_result ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac continue ;; -shared) # The effects of -shared are defined in a previous loop. continue ;; -shrext) prev=shrext continue ;; -static | -static-libtool-libs) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -weak) prev=weak continue ;; -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" func_append arg " $func_quote_for_eval_result" func_append compiler_flags " $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Wl,*) func_stripname '-Wl,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" func_append arg " $wl$func_quote_for_eval_result" func_append compiler_flags " $wl$func_quote_for_eval_result" func_append linker_flags " $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # -msg_* for osf cc -msg_*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; # Flags to be passed through unchanged, with rationale: # -64, -mips[0-9] enable 64-bit mode for the SGI compiler # -r[0-9][0-9]* specify processor for the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode for the Sun compiler # +DA*, +DD* enable 64-bit mode for the HP compiler # -q* compiler args for the IBM compiler # -m*, -t[45]*, -txscale* architecture-specific flags for GCC # -F/path path to uninstalled frameworks, gcc on darwin # -p, -pg, --coverage, -fprofile-* profiling flags for GCC # @file GCC response files # -tp=* Portland pgcc target processor selection # --sysroot=* for sysroot support # -O*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \ -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*|-tp=*|--sysroot=*| \ -O*|-flto*|-fwhopr*|-fuse-linker-plugin) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" func_append compile_command " $arg" func_append finalize_command " $arg" func_append compiler_flags " $arg" continue ;; # Some other compiler flag. -* | +*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; *.$objext) # A standard object. func_append objs " $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi ;; *.$libext) # An archive. func_append deplibs " $arg" func_append old_deplibs " $arg" continue ;; *.la) # A libtool-controlled library. func_resolve_sysroot "$arg" if test "$prev" = dlfiles; then # This library was specified with -dlopen. func_append dlfiles " $func_resolve_sysroot_result" prev= elif test "$prev" = dlprefiles; then # The library was specified with -dlpreopen. func_append dlprefiles " $func_resolve_sysroot_result" prev= else func_append deplibs " $func_resolve_sysroot_result" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then func_append compile_command " $arg" func_append finalize_command " $arg" fi done # argument parsing loop test -n "$prev" && \ func_fatal_help "the \`$prevarg' option requires an argument" if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" func_append compile_command " $arg" func_append finalize_command " $arg" fi oldlibs= # calculate the name of the file, without its directory func_basename "$output" outputname="$func_basename_result" libobjs_save="$libobjs" if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$ECHO \"\${$shlibpath_var}\" \| \$SED \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" func_dirname "$output" "/" "" output_objdir="$func_dirname_result$objdir" func_to_tool_file "$output_objdir/" tool_output_objdir=$func_to_tool_file_result # Create the object directory. func_mkdir_p "$output_objdir" # Determine the type of output case $output in "") func_fatal_help "you must specify an output file" ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if $opt_preserve_dup_deps ; then case "$libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append libs " $deplib" done if test "$linkmode" = lib; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if $opt_duplicate_compiler_generated_deps; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) func_append specialdeplibs " $pre_post_deps" ;; esac func_append pre_post_deps " $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries notinst_path= # paths that contain not-installed libtool libraries case $linkmode in lib) passes="conv dlpreopen link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) func_fatal_help "libraries can \`-dlopen' only libtool libraries: $file" ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=no newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do # The preopen pass in lib mode reverses $deplibs; put it back here # so that -L comes before libs that need it for instance... if test "$linkmode,$pass" = "lib,link"; then ## FIXME: Find the place where the list is rebuilt in the wrong ## order, and fix it there properly tmp_deplibs= for deplib in $deplibs; do tmp_deplibs="$deplib $tmp_deplibs" done deplibs="$tmp_deplibs" fi if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; then # Collect and forward deplibs of preopened libtool libs for lib in $dlprefiles; do # Ignore non-libtool-libs dependency_libs= func_resolve_sysroot "$lib" case $lib in *.la) func_source "$func_resolve_sysroot_result" ;; esac # Collect preopened libtool deplibs, except any this library # has declared as weak libs for deplib in $dependency_libs; do func_basename "$deplib" deplib_base=$func_basename_result case " $weak_libs " in *" $deplib_base "*) ;; *) func_append deplibs " $deplib" ;; esac done done libs="$dlprefiles" fi if test "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append compiler_flags " $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; then searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path" else searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path" fi for searchdir in $searchdirs; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib="$searchdir/lib${name}${search_ext}" if test -f "$lib"; then if test "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $deplib "*) if func_lalib_p "$lib"; then library_names= old_library= func_source "$lib" for l in $old_library $library_names; do ll="$l" done if test "X$ll" = "X$old_library" ; then # only static version available found=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test "$pass" = conv && continue newdependency_libs="$deplib $newdependency_libs" func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; prog) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; *) func_warning "\`-L' is ignored for archives/objects" ;; esac # linkmode continue ;; # -L -R*) if test "$pass" = link; then func_stripname '-R' '' "$deplib" func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) func_resolve_sysroot "$deplib" lib=$func_resolve_sysroot_result ;; *.$libext) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) # Linking convenience modules into shared libraries is allowed, # but linking other static libraries is non-portable. case " $dlpreconveniencelibs " in *" $deplib "*) ;; *) valid_a_lib=no case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` if eval "\$ECHO \"$deplib\"" 2>/dev/null | $SED 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then echo $ECHO "*** Warning: Trying to link with static lib archive $deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because the file extensions .$libext of this argument makes me believe" echo "*** that it is just a static archive that I should not use here." else echo $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlopen support or we're linking statically, # we need to preload. func_append newdlprefiles " $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append newdlfiles " $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$lib" \ || func_fatal_error "\`$lib' is not a valid libtool archive" func_dirname "$lib" "" "." ladir="$func_dirname_result" dlname= dlopen= dlpreopen= libdir= library_names= old_library= inherited_linker_flags= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file func_source "$lib" # Convert "-framework foo" to "foo.ltframework" if test -n "$inherited_linker_flags"; then tmp_inherited_linker_flags=`$ECHO "$inherited_linker_flags" | $SED 's/-framework \([^ $]*\)/\1.ltframework/g'` for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do case " $new_inherited_linker_flags " in *" $tmp_inherited_linker_flag "*) ;; *) func_append new_inherited_linker_flags " $tmp_inherited_linker_flag";; esac done fi dependency_libs=`$ECHO " $dependency_libs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && func_append dlfiles " $dlopen" test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen" fi if test "$pass" = conv; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # It is a libtool convenience library, so add in its objects. func_append convenience " $ladir/$objdir/$old_library" func_append old_convenience " $ladir/$objdir/$old_library" tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if $opt_preserve_dup_deps ; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= if test -n "$old_library" && { test "$prefer_static_libs" = yes || test "$prefer_static_libs,$installed" = "built,no"; }; then linklib=$old_library else for l in $old_library $library_names; do linklib="$l" done fi if test -z "$linklib"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # This library was specified with -dlopen. if test "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. func_append dlprefiles " $lib $dependency_libs" else func_append newdlfiles " $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir="$ladir" ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then func_warning "cannot determine absolute directory name of \`$ladir'" func_warning "passing it literally to the linker, although it might fail" abs_ladir="$ladir" fi ;; esac func_basename "$lib" laname="$func_basename_result" # Find the relevant object directory and library name. if test "X$installed" = Xyes; then if test ! -f "$lt_sysroot$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then func_warning "library \`$lib' was moved." dir="$ladir" absdir="$abs_ladir" libdir="$abs_ladir" else dir="$lt_sysroot$libdir" absdir="$lt_sysroot$libdir" fi test "X$hardcode_automatic" = Xyes && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir="$ladir" absdir="$abs_ladir" # Remove this search path later func_append notinst_path " $abs_ladir" else dir="$ladir/$objdir" absdir="$abs_ladir/$objdir" # Remove this search path later func_append notinst_path " $abs_ladir" fi fi # $installed = yes func_stripname 'lib' '.la' "$laname" name=$func_stripname_result # This library was specified with -dlpreopen. if test "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; then func_fatal_error "only libraries may -dlpreopen a convenience library: \`$lib'" fi case "$host" in # special handling for platforms with PE-DLLs. *cygwin* | *mingw* | *cegcc* ) # Linker will automatically link against shared library if both # static and shared are present. Therefore, ensure we extract # symbols from the import library if a shared library is present # (otherwise, the dlopen module name will be incorrect). We do # this by putting the import library name into $newdlprefiles. # We recover the dlopen module name by 'saving' the la file # name in a special purpose variable, and (later) extracting the # dlname from the la file. if test -n "$dlname"; then func_tr_sh "$dir/$linklib" eval "libfile_$func_tr_sh_result=\$abs_ladir/\$laname" func_append newdlprefiles " $dir/$linklib" else func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" fi ;; * ) # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then func_append newdlprefiles " $dir/$dlname" else func_append newdlprefiles " $dir/$linklib" fi ;; esac fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test "$linkmode" = prog && test "$pass" != link; then func_append newlib_search_path " $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; esac # Need to link against all dependency_libs? if test "$linkalldeplibs" = yes; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if $opt_preserve_dup_deps ; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done # for deplib continue fi # $linkmode = prog... if test "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath" ; then # Make sure the rpath contains only unique directories. case "$temp_rpath:" in *"$absdir:"*) ;; *) func_append temp_rpath "$absdir:" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi # $linkmode,$pass = prog,link... if test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || test -z "$old_library"; }; then case $host in *cygwin* | *mingw* | *cegcc*) # No point in relinking DLLs because paths are not encoded func_append notinst_deplibs " $lib" need_relink=no ;; *) if test "$installed" = no; then func_append notinst_deplibs " $lib" need_relink=yes fi ;; esac # This is a shared library # Warn about portability, can't link against -module's on some # systems (darwin). Don't bleat about dlopened modules though! dlopenmodule="" for dlpremoduletest in $dlprefiles; do if test "X$dlpremoduletest" = "X$lib"; then dlopenmodule="$dlpremoduletest" break fi done if test -z "$dlopenmodule" && test "$shouldnotlink" = yes && test "$pass" = link; then echo if test "$linkmode" = prog; then $ECHO "*** Warning: Linking the executable $output against the loadable module" else $ECHO "*** Warning: Linking the shared library $output against the loadable module" fi $ECHO "*** $linklib is not portable!" fi if test "$linkmode" = lib && test "$hardcode_into_libs" = yes; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names shift realname="$1" shift libname=`eval "\\$ECHO \"$libname_spec\""` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname="$dlname" elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw* | *cegcc*) func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; esac eval soname=\"$soname_spec\" else soname="$realname" fi # Make a new name for the extract_expsyms_cmds to use soroot="$soname" func_basename "$soroot" soname="$func_basename_result" func_stripname 'lib' '.dll' "$soname" newlib=libimp-$func_stripname_result.a # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else func_verbose "extracting exported symbol list from \`$soname'" func_execute_cmds "$extract_expsyms_cmds" 'exit $?' fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else func_verbose "generating import library for \`$soname'" func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?' fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test "$linkmode" = prog || test "$opt_mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; then add="$dir/$linklib" case $host in *-*-sco3.2v5.0.[024]*) add_dir="-L$dir" ;; *-*-sysv4*uw2*) add_dir="-L$dir" ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir="-L$dir" ;; *-*-darwin* ) # if the lib is a (non-dlopened) module then we can not # link against it, someone is ignoring the earlier warnings if /usr/bin/file -L $add 2> /dev/null | $GREP ": [^:]* bundle" >/dev/null ; then if test "X$dlopenmodule" != "X$lib"; then $ECHO "*** Warning: lib $linklib is a module, not a shared library" if test -z "$old_library" ; then echo echo "*** And there doesn't seem to be a static archive available" echo "*** The link will probably fail, sorry" else add="$dir/$old_library" fi elif test -n "$old_library"; then add="$dir/$old_library" fi fi esac elif test "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$absdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; then func_fatal_configuration "unsupported hardcode properties" fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) func_append compile_shlibpath "$add_shlibpath:" ;; esac fi if test "$linkmode" = prog; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$opt_mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib" ; then add="$inst_prefix_dir$libdir/$linklib" else add="$libdir/$linklib" fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir="-L$libdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" fi if test "$linkmode" = prog; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test "$linkmode" = prog; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test "$hardcode_direct" != unsupported; then test -n "$old_library" && linklib="$old_library" compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. echo $ECHO "*** Warning: This system can not link to static lib archive $lib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have." if test "$module" = yes; then echo "*** But as you try to build a module library, libtool will still create " echo "*** a static module, that should work as long as the dlopening application" echo "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using \`nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) func_stripname '-R' '' "$libdir" temp_xrpath=$func_stripname_result case " $xrpath " in *" $temp_xrpath "*) ;; *) func_append xrpath " $temp_xrpath";; esac;; *) func_append temp_deplibs " $libdir";; esac done dependency_libs="$temp_deplibs" fi func_append newlib_search_path " $absdir" # Link against this library test "$link_static" = no && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result";; *) func_resolve_sysroot "$deplib" ;; esac if $opt_preserve_dup_deps ; then case "$tmp_libs " in *" $func_resolve_sysroot_result "*) func_append specialdeplibs " $func_resolve_sysroot_result" ;; esac fi func_append tmp_libs " $func_resolve_sysroot_result" done if test "$link_all_deplibs" != no; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do path= case $deplib in -L*) path="$deplib" ;; *.la) func_resolve_sysroot "$deplib" deplib=$func_resolve_sysroot_result func_dirname "$deplib" "" "." dir=$func_dirname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then func_warning "cannot determine absolute directory name of \`$dir'" absdir="$dir" fi ;; esac if $GREP "^installed=no" $deplib > /dev/null; then case $host in *-*-darwin*) depdepl= eval deplibrary_names=`${SED} -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names" ; then for tmp in $deplibrary_names ; do depdepl=$tmp done if test -f "$absdir/$objdir/$depdepl" ; then depdepl="$absdir/$objdir/$depdepl" darwin_install_name=`${OTOOL} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` if test -z "$darwin_install_name"; then darwin_install_name=`${OTOOL64} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` fi func_append compiler_flags " ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}" func_append linker_flags " -dylib_file ${darwin_install_name}:${depdepl}" path= fi fi ;; *) path="-L$absdir/$objdir" ;; esac else eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" test "$absdir" != "$libdir" && \ func_warning "\`$deplib' seems to be moved" path="-L$absdir" fi ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs if test "$pass" = link; then if test "$linkmode" = "prog"; then compile_deplibs="$new_inherited_linker_flags $compile_deplibs" finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs" else compiler_flags="$compiler_flags "`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` fi fi dependency_libs="$newdependency_libs" if test "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) func_append lib_search_path " $dir" ;; esac done newlib_search_path= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_deplibs" fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) func_append tmp_libs " $deplib" ;; esac ;; *) func_append tmp_libs " $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs ; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i="" ;; esac if test -n "$i" ; then func_append tmp_libs " $i" fi done dependency_libs=$tmp_libs done # for pass if test "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for archives" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for archives" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for archives" test -n "$xrpath" && \ func_warning "\`-R' is ignored for archives" test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for archives" test -n "$release" && \ func_warning "\`-release' is ignored for archives" test -n "$export_symbols$export_symbols_regex" && \ func_warning "\`-export-symbols' is ignored for archives" # Now set the variables for building old libraries. build_libtool_libs=no oldlibs="$output" func_append objs "$old_deplibs" ;; lib) # Make sure we only generate libraries of the form `libNAME.la'. case $outputname in lib*) func_stripname 'lib' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) test "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; then # Add the "lib" prefix for modules if required func_stripname '' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else func_stripname '' '.la' "$outputname" libname=$func_stripname_result fi ;; esac if test -n "$objs"; then if test "$deplibs_check_method" != pass_all; then func_fatal_error "cannot build libtool library \`$output' from non-libtool objects on this host:$objs" else echo $ECHO "*** Warning: Linking the shared library $output against the non-libtool" $ECHO "*** objects $objs is not portable!" func_append libobjs " $objs" fi fi test "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; then # Building a libtool convenience library. # Some compilers have problems with a `.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for convenience libraries" test -n "$release" && \ func_warning "\`-release' is ignored for convenience libraries" else # Parse the version information argument. save_ifs="$IFS"; IFS=':' set dummy $vinfo 0 0 0 shift IFS="$save_ifs" test -n "$7" && \ func_fatal_help "too many parameters to \`-version-info'" # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major="$1" number_minor="$2" number_revision="$3" # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # which has an extra 1 added just for fun # case $version_type in # correct linux to gnu/linux during the next big refactor darwin|linux|osf|windows|none) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_revision" ;; freebsd-aout|freebsd-elf|qnx|sunos) current="$number_major" revision="$number_minor" age="0" ;; irix|nonstopux) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_minor" lt_irix_increment=no ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; esac ;; no) current="$1" revision="$2" age="$3" ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "CURRENT \`$current' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "REVISION \`$revision' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "AGE \`$age' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac if test "$age" -gt "$current"; then func_error "AGE \`$age' is greater than the current interface number \`$current'" func_fatal_error "\`$vinfo' is not valid version information" fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" # Darwin ld doesn't like 0 for these options... func_arith $current + 1 minor_current=$func_arith_result xlcverstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision" verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; then func_arith $current - $age else func_arith $current - $age + 1 fi major=$func_arith_result case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring="$verstring_prefix$major.$revision" # Add in all the interfaces that we are compatible with. loop=$revision while test "$loop" -ne 0; do func_arith $revision - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring_prefix$major.$iface:$verstring" done # Before this point, $major must not contain `.'. major=.$major versuffix="$major.$revision" ;; linux) # correct to gnu/linux during the next big refactor func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" ;; osf) func_arith $current - $age major=.$func_arith_result versuffix=".$current.$age.$revision" verstring="$current.$age.$revision" # Add in all the interfaces that we are compatible with. loop=$age while test "$loop" -ne 0; do func_arith $current - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring:${iface}.0" done # Make executables depend on our current version. func_append verstring ":${current}.0" ;; qnx) major=".$current" versuffix=".$current" ;; sunos) major=".$current" versuffix=".$current.$revision" ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 filesystems. func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; *) func_fatal_configuration "unknown library version type \`$version_type'" ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring="0.0" ;; esac if test "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" func_append libobjs " $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$opt_mode" != relink; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$ECHO "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext | *.gcno) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*) if test "X$precious_files_regex" != "X"; then if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi func_append removelist " $p" ;; *) ;; esac done test -n "$removelist" && \ func_show_eval "${RM}r \$removelist" fi # Now set the variables for building old libraries. if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then func_append oldlibs " $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.${libext}$/d; $lo2o" | $NL2SP` fi # Eliminate all temporary directories. #for path in $notinst_path; do # lib_search_path=`$ECHO "$lib_search_path " | $SED "s% $path % %g"` # deplibs=`$ECHO "$deplibs " | $SED "s% -L$path % %g"` # dependency_libs=`$ECHO "$dependency_libs " | $SED "s% -L$path % %g"` #done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do func_replace_sysroot "$libdir" func_append temp_xrpath " -R$func_replace_sysroot_result" case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done if test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles="$dlfiles" dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) func_append dlfiles " $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles="$dlprefiles" dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) func_append dlprefiles " $lib" ;; esac done if test "$build_libtool_libs" = yes; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc* | *-*-haiku*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework func_append deplibs " System.ltframework" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test "$build_libtool_need_lc" = "yes"; then func_append deplibs " -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release="" versuffix="" major="" newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $opt_dry_run || $RM conftest.c cat > conftest.c </dev/null` $nocaseglob else potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null` fi for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null | $GREP " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib="$potent_lib" while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | ${SED} 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib="$potliblink";; *) potlib=`$ECHO "$potlib" | $SED 's,[^/]*$,,'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null | $SED -e 10q | $EGREP "$file_magic_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for file magic test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a file magic. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` for a_deplib in $deplibs; do case $a_deplib in -l*) func_stripname -l '' "$a_deplib" name=$func_stripname_result if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $a_deplib "*) func_append newdeplibs " $a_deplib" a_deplib="" ;; esac fi if test -n "$a_deplib" ; then libname=`eval "\\$ECHO \"$libname_spec\""` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib="$potent_lib" # see symlink-check above in file_magic test if eval "\$ECHO \"$potent_lib\"" 2>/dev/null | $SED 10q | \ $EGREP "$match_pattern_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a regex pattern. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; none | unknown | *) newdeplibs="" tmp_deplibs=`$ECHO " $deplibs" | $SED 's/ -lc$//; s/ -[LR][^ ]*//g'` if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then for i in $predeps $postdeps ; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$ECHO " $tmp_deplibs" | $SED "s,$i,,"` done fi case $tmp_deplibs in *[!\ \ ]*) echo if test "X$deplibs_check_method" = "Xnone"; then echo "*** Warning: inter-library dependencies are not supported in this platform." else echo "*** Warning: inter-library dependencies are not known to be supported." fi echo "*** All declared inter-library dependencies are being dropped." droppeddeps=yes ;; esac ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library with the System framework newdeplibs=`$ECHO " $newdeplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac if test "$droppeddeps" = yes; then if test "$module" = yes; then echo echo "*** Warning: libtool could not satisfy all declared inter-library" $ECHO "*** dependencies of module $libname. Therefore, libtool will create" echo "*** a static module, that should work as long as the dlopening" echo "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using \`nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else echo "*** The inter-library dependencies that have been dropped here will be" echo "*** automatically added whenever a program is linked with this library" echo "*** or is declared to -dlopen it." if test "$allow_undefined" = no; then echo echo "*** Since this library must not contain undefined symbols," echo "*** because either the platform does not support them or" echo "*** it was explicitly requested with -no-undefined," echo "*** libtool will only create a static version of it." if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" case $host in *-*-darwin*) newdeplibs=`$ECHO " $newdeplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` new_inherited_linker_flags=`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` deplibs=`$ECHO " $deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done deplibs="$new_libs" # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test "$build_libtool_libs" = yes; then # Remove ${wl} instances when linking with ld. # FIXME: should test the right _cmds variable. case $archive_cmds in *\$LD\ *) wl= ;; esac if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$opt_mode" != relink && rpath="$compile_rpath$rpath" for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then func_replace_sysroot "$libdir" libdir=$func_replace_sysroot_result if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append dep_rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval "dep_rpath=\"$hardcode_libdir_flag_spec\"" fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath="$finalize_shlibpath" test "$opt_mode" != relink && shlibpath="$compile_shlibpath$shlibpath" if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names shift realname="$1" shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname="$realname" fi if test -z "$dlname"; then dlname=$soname fi lib="$output_objdir/$realname" linknames= for link do func_append linknames " $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$ECHO "$libobjs" | $SP2NL | $SED "$lo2o" | $NL2SP` test "X$libobjs" = "X " && libobjs= delfiles= if test -n "$export_symbols" && test -n "$include_expsyms"; then $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp" export_symbols="$output_objdir/$libname.uexp" func_append delfiles " $export_symbols" fi orig_export_symbols= case $host_os in cygwin* | mingw* | cegcc*) if test -n "$export_symbols" && test -z "$export_symbols_regex"; then # exporting using user supplied symfile if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # and it's NOT already a .def file. Must figure out # which of the given symbols are data symbols and tag # them as such. So, trigger use of export_symbols_cmds. # export_symbols gets reassigned inside the "prepare # the list of exported symbols" if statement, so the # include_expsyms logic still works. orig_export_symbols="$export_symbols" export_symbols= always_export_symbols=yes fi fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols cmds=$export_symbols_cmds save_ifs="$IFS"; IFS='~' for cmd1 in $cmds; do IFS="$save_ifs" # Take the normal branch if the nm_file_list_spec branch # doesn't work or if tool conversion is not needed. case $nm_file_list_spec~$to_tool_file_cmd in *~func_convert_file_noop | *~func_convert_file_msys_to_w32 | ~*) try_normal_branch=yes eval cmd=\"$cmd1\" func_len " $cmd" len=$func_len_result ;; *) try_normal_branch=no ;; esac if test "$try_normal_branch" = yes \ && { test "$len" -lt "$max_cmd_len" \ || test "$max_cmd_len" -le -1; } then func_show_eval "$cmd" 'exit $?' skipped_export=false elif test -n "$nm_file_list_spec"; then func_basename "$output" output_la=$func_basename_result save_libobjs=$libobjs save_output=$output output=${output_objdir}/${output_la}.nm func_to_tool_file "$output" libobjs=$nm_file_list_spec$func_to_tool_file_result func_append delfiles " $output" func_verbose "creating $NM input file list: $output" for obj in $save_libobjs; do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > "$output" eval cmd=\"$cmd1\" func_show_eval "$cmd" 'exit $?' output=$save_output libobjs=$save_libobjs skipped_export=false else # The command line is too long to execute in one step. func_verbose "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS="$save_ifs" if test -n "$export_symbols_regex" && test "X$skipped_export" != "X:"; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test "X$skipped_export" != "X:" && test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) func_append tmp_deplibs " $test_deplib" ;; esac done deplibs="$tmp_deplibs" if test -n "$convenience"; then if test -n "$whole_archive_flag_spec" && test "$compiler_needs_object" = yes && test -z "$libobjs"; then # extract the archives, so we have objects to list. # TODO: could optimize this to just extract one archive. whole_archive_flag_spec= fi if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= else gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $convenience func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi fi if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" func_append linker_flags " $flag" fi # Make a backup of the uninstalled library when relinking if test "$opt_mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test "X$skipped_export" != "X:" && func_len " $test_cmds" && len=$func_len_result && test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise # or, if using GNU ld and skipped_export is not :, use a linker # script. # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output func_basename "$output" output_la=$func_basename_result # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= last_robj= k=1 if test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; then output=${output_objdir}/${output_la}.lnkscript func_verbose "creating GNU ld script: $output" echo 'INPUT (' > $output for obj in $save_libobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done echo ')' >> $output func_append delfiles " $output" func_to_tool_file "$output" output=$func_to_tool_file_result elif test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; then firstobj="$1 " shift fi for obj do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done func_append delfiles " $output" func_to_tool_file "$output" output=$firstobj\"$file_list_spec$func_to_tool_file_result\" else if test -n "$save_libobjs"; then func_verbose "creating reloadable object files..." output=$output_objdir/$output_la-${k}.$objext eval test_cmds=\"$reload_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 # Loop over the list of objects to be linked. for obj in $save_libobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result if test "X$objlist" = X || test "$len" -lt "$max_cmd_len"; then func_append objlist " $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test "$k" -eq 1 ; then # The first file doesn't have a previous command to add. reload_objs=$objlist eval concat_cmds=\"$reload_cmds\" else # All subsequent reloadable object files will link in # the last one created. reload_objs="$objlist $last_robj" eval concat_cmds=\"\$concat_cmds~$reload_cmds~\$RM $last_robj\" fi last_robj=$output_objdir/$output_la-${k}.$objext func_arith $k + 1 k=$func_arith_result output=$output_objdir/$output_la-${k}.$objext objlist=" $obj" func_len " $last_robj" func_arith $len0 + $func_len_result len=$func_arith_result fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ reload_objs="$objlist $last_robj" eval concat_cmds=\"\${concat_cmds}$reload_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\${concat_cmds}~\$RM $last_robj\" fi func_append delfiles " $output" else output= fi if ${skipped_export-false}; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols libobjs=$output # Append the command to create the export file. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi fi test -n "$save_libobjs" && func_verbose "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs="$IFS"; IFS='~' for cmd in $concat_cmds; do IFS="$save_ifs" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$opt_mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" if test -n "$export_symbols_regex" && ${skipped_export-false}; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi if ${skipped_export-false}; then if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi fi libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi fi if test -n "$delfiles"; then # Append the command to remove temporary files to $cmds. eval cmds=\"\$cmds~\$RM $delfiles\" fi # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$opt_mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" # Restore the uninstalled library and exit if test "$opt_mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then func_show_eval '${RM}r "$gentop"' fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?' fi done # If -module or -export-dynamic was specified, set the dlname. if test "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for objects" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for objects" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for objects" test -n "$xrpath" && \ func_warning "\`-R' is ignored for objects" test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for objects" test -n "$release" && \ func_warning "\`-release' is ignored for objects" case $output in *.lo) test -n "$objs$old_deplibs" && \ func_fatal_error "cannot build library object \`$output' from non-libtool objects" libobj=$output func_lo2o "$libobj" obj=$func_lo2o_result ;; *) libobj= obj="$output" ;; esac # Delete the old objects. $opt_dry_run || $RM $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec and hope we can get by with # turning comma into space.. wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\" reload_conv_objs=$reload_objs\ `$ECHO "$tmp_whole_archive_flags" | $SED 's|,| |g'` else gentop="$output_objdir/${obj}x" func_append generated " $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # If we're not building shared, we need to use non_pic_objs test "$build_libtool_libs" != yes && libobjs="$non_pic_objects" # Create the old-style object. reload_objs="$objs$old_deplibs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.${libext}$/d; /\.lib$/d; $lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test output="$obj" func_execute_cmds "$reload_cmds" 'exit $?' # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS fi if test "$build_libtool_libs" != yes; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $opt_dry_run || eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS fi if test -n "$pic_flag" || test "$pic_mode" != default; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output="$libobj" func_execute_cmds "$reload_cmds" 'exit $?' fi if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) func_stripname '' '.exe' "$output" output=$func_stripname_result.exe;; esac test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for programs" test -n "$release" && \ func_warning "\`-release' is ignored for programs" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ func_warning "\`LT_INIT([dlopen])' not used. Assuming no dlopen support." case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's/ -lc / System.ltframework /'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac case $host in *-*-darwin*) # Don't allow lazy linking, it breaks C++ global constructors # But is supposedly fixed on 10.4 or later (yay!). if test "$tagname" = CXX ; then case ${MACOSX_DEPLOYMENT_TARGET-10.0} in 10.[0123]) func_append compile_command " ${wl}-bind_at_load" func_append finalize_command " ${wl}-bind_at_load" ;; esac fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done compile_deplibs="$new_libs" func_append compile_command " $compile_deplibs" func_append finalize_command " $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`${ECHO} "$libdir" | ${SED} -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; ::) dllsearchpath=$libdir;; *) func_append dllsearchpath ":$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath="$rpath" rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) func_append finalize_perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath="$rpath" if test -n "$libobjs" && test "$build_old_libs" = yes; then # Transform all the library objects into standard objects. compile_command=`$ECHO "$compile_command" | $SP2NL | $SED "$lo2o" | $NL2SP` finalize_command=`$ECHO "$finalize_command" | $SP2NL | $SED "$lo2o" | $NL2SP` fi func_generate_dlsyms "$outputname" "@PROGRAM@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cegcc* | *mingw32ce*) # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway. wrappers_required=no ;; *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # Replace the output file specification. compile_command=`$ECHO "$compile_command" | $SED 's%@OUTPUT@%'"$output"'%g'` link_command="$compile_command$compile_rpath" # We have no uninstalled library dependencies, so finalize right now. exit_status=0 func_show_eval "$link_command" 'exit_status=$?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Delete the generated files. if test -f "$output_objdir/${outputname}S.${objext}"; then func_show_eval '$RM "$output_objdir/${outputname}S.${objext}"' fi exit $exit_status fi if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do func_append rpath "$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test "$no_install" = yes; then # We don't need to create a wrapper script. link_command="$compile_var$compile_command$compile_rpath" # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $opt_dry_run || $RM $output # Link the executable and exit func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi exit $EXIT_SUCCESS fi if test "$hardcode_action" = relink; then # Fast installation is not supported link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" func_warning "this platform does not like uninstalled shared libraries" func_warning "\`$output' will be relinked during installation" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output_objdir/$outputname" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Now create the wrapper script. func_verbose "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` fi # Only actually do things if not in dry run mode. $opt_dry_run || { # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) func_stripname '' '.exe' "$output" output=$func_stripname_result ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe func_stripname '' '.exe' "$outputname" outputname=$func_stripname_result ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) func_dirname_and_basename "$output" "" "." output_name=$func_basename_result output_path=$func_dirname_result cwrappersource="$output_path/$objdir/lt-$output_name.c" cwrapper="$output_path/$output_name.exe" $RM $cwrappersource $cwrapper trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 func_emit_cwrapperexe_src > $cwrappersource # The wrapper executable is built using the $host compiler, # because it contains $host paths and files. If cross- # compiling, it, like the target executable, must be # executed on the $host or under an emulation environment. $opt_dry_run || { $LTCC $LTCFLAGS -o $cwrapper $cwrappersource $STRIP $cwrapper } # Now, create the wrapper script for func_source use: func_ltwrapper_scriptname $cwrapper $RM $func_ltwrapper_scriptname_result trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15 $opt_dry_run || { # note: this script will not be executed, so do not chmod. if test "x$build" = "x$host" ; then $cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result else func_emit_wrapper no > $func_ltwrapper_scriptname_result fi } ;; * ) $RM $output trap "$RM $output; exit $EXIT_FAILURE" 1 2 15 func_emit_wrapper no > $output chmod +x $output ;; esac } exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then func_append oldobjs " $symfileobj" fi fi addlibs="$old_convenience" fi if test -n "$addlibs"; then gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $addlibs func_append oldobjs " $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test "$build_libtool_libs" = yes; then cmds=$old_archive_from_new_cmds else # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append oldobjs " $func_extract_archives_result" fi # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do func_basename "$obj" $ECHO "$func_basename_result" done | sort | sort -uc >/dev/null 2>&1); then : else echo "copying selected object files to avoid basename conflicts..." gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_mkdir_p "$gentop" save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do func_basename "$obj" objbase="$func_basename_result" case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase func_arith $counter + 1 counter=$func_arith_result case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" func_append oldobjs " $gentop/$newobj" ;; *) func_append oldobjs " $obj" ;; esac done fi func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result eval cmds=\"$old_archive_cmds\" func_len " $cmds" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds elif test -n "$archiver_list_spec"; then func_verbose "using command file archive linking..." for obj in $oldobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > $output_objdir/$libname.libcmd func_to_tool_file "$output_objdir/$libname.libcmd" oldobjs=" $archiver_list_spec$func_to_tool_file_result" cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts func_verbose "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs oldobjs= # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done eval test_cmds=\"$old_archive_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 for obj in $save_oldobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result func_append objlist " $obj" if test "$len" -lt "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj" ; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\" objlist= len=$len0 fi done RANLIB=$save_RANLIB oldobjs=$objlist if test "X$oldobjs" = "X" ; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi func_execute_cmds "$cmds" 'exit $?' done test -n "$generated" && \ func_show_eval "${RM}r$generated" # Now create the libtool archive. case $output in *.la) old_library= test "$build_old_libs" = yes && old_library="$libname.$libext" func_verbose "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` if test "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; then if test -z "$install_libdir"; then break fi output="$output_objdir/$outputname"i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) func_basename "$deplib" name="$func_basename_result" func_resolve_sysroot "$deplib" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $func_resolve_sysroot_result` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" func_append newdependency_libs " ${lt_sysroot:+=}$libdir/$name" ;; -L*) func_stripname -L '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -L$func_replace_sysroot_result" ;; -R*) func_stripname -R '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -R$func_replace_sysroot_result" ;; *) func_append newdependency_libs " $deplib" ;; esac done dependency_libs="$newdependency_libs" newdlfiles= for lib in $dlfiles; do case $lib in *.la) func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" func_append newdlfiles " ${lt_sysroot:+=}$libdir/$name" ;; *) func_append newdlfiles " $lib" ;; esac done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in *.la) # Only pass preopened files to the pseudo-archive (for # eventual linking with the app. that links it) if we # didn't already link the preopened objects directly into # the library: func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" func_append newdlprefiles " ${lt_sysroot:+=}$libdir/$name" ;; esac done dlprefiles="$newdlprefiles" else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlfiles " $abs" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlprefiles " $abs" done dlprefiles="$newdlprefiles" fi $RM $output # place dlname in correct position for cygwin # In fact, it would be nice if we could use this code for all target # systems that can't hard-code library paths into their executables # and that have no shared library path variable independent of PATH, # but it turns out we can't easily determine that from inspecting # libtool variables, so we have to hard-code the OSs to which it # applies here; at the moment, that means platforms that use the PE # object format with DLL files. See the long comment at the top of # tests/bindir.at for full details. tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll) # If a -bindir argument was supplied, place the dll there. if test "x$bindir" != x ; then func_relative_path "$install_libdir" "$bindir" tdlname=$func_relative_path_result$dlname else # Otherwise fall back on heuristic. tdlname=../bin/$dlname fi ;; esac $ECHO > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Linker flags that can not go in dependency_libs. inherited_linker_flags='$new_inherited_linker_flags' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Names of additional weak libraries provided by this library weak_library_names='$weak_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test "$installed" = no && test "$need_relink" = yes; then $ECHO >> $output "\ relink_command=\"$relink_command\"" fi done } # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?' ;; esac exit $EXIT_SUCCESS } { test "$opt_mode" = link || test "$opt_mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" for arg do case $arg in -f) func_append RM " $arg"; rmforce=yes ;; -*) func_append RM " $arg" ;; *) func_append files " $arg" ;; esac done test -z "$RM" && \ func_fatal_help "you must specify an RM program" rmdirs= for file in $files; do func_dirname "$file" "" "." dir="$func_dirname_result" if test "X$dir" = X.; then odir="$objdir" else odir="$dir/$objdir" fi func_basename "$file" name="$func_basename_result" test "$opt_mode" = uninstall && odir="$dir" # Remember odir for removal later, being careful to avoid duplicates if test "$opt_mode" = clean; then case " $rmdirs " in *" $odir "*) ;; *) func_append rmdirs " $odir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if { test -L "$file"; } >/dev/null 2>&1 || { test -h "$file"; } >/dev/null 2>&1 || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif test "$rmforce" = yes; then continue fi rmfiles="$file" case $name in *.la) # Possibly a libtool archive, so verify it. if func_lalib_p "$file"; then func_source $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do func_append rmfiles " $odir/$n" done test -n "$old_library" && func_append rmfiles " $odir/$old_library" case "$opt_mode" in clean) case " $library_names " in *" $dlname "*) ;; *) test -n "$dlname" && func_append rmfiles " $odir/$dlname" ;; esac test -n "$libdir" && func_append rmfiles " $odir/$name $odir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. func_execute_cmds "$postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if func_lalib_p "$file"; then # Read the .lo file func_source $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" && test "$pic_object" != none; then func_append rmfiles " $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" && test "$non_pic_object" != none; then func_append rmfiles " $dir/$non_pic_object" fi fi ;; *) if test "$opt_mode" = clean ; then noexename=$name case $file in *.exe) func_stripname '' '.exe' "$file" file=$func_stripname_result func_stripname '' '.exe' "$name" noexename=$func_stripname_result # $file with .exe has already been added to rmfiles, # add $file without .exe func_append rmfiles " $file" ;; esac # Do a test to see if this is a libtool program. if func_ltwrapper_p "$file"; then if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" relink_command= func_source $func_ltwrapper_scriptname_result func_append rmfiles " $func_ltwrapper_scriptname_result" else relink_command= func_source $dir/$noexename fi # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles func_append rmfiles " $odir/$name $odir/${name}S.${objext}" if test "$fast_install" = yes && test -n "$relink_command"; then func_append rmfiles " $odir/lt-$name" fi if test "X$noexename" != "X$name" ; then func_append rmfiles " $odir/lt-${noexename}.c" fi fi fi ;; esac func_show_eval "$RM $rmfiles" 'exit_status=1' done # Try to remove the ${objdir}s in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then func_show_eval "rmdir $dir >/dev/null 2>&1" fi done exit $exit_status } { test "$opt_mode" = uninstall || test "$opt_mode" = clean; } && func_mode_uninstall ${1+"$@"} test -z "$opt_mode" && { help="$generic_help" func_fatal_help "you must specify a MODE" } test -z "$exec_cmd" && \ func_fatal_help "invalid operation mode \`$opt_mode'" if test -n "$exec_cmd"; then eval exec "$exec_cmd" exit $EXIT_FAILURE fi exit $exit_status # The TAGs below are defined such that we never get into a situation # in which we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared build_libtool_libs=no build_old_libs=yes # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: # vi:sw=2 healpy-1.8.1/healpixsubmodule/src/cxx/autotools/configure0000755000175000017500000223600612346122571024170 0ustar zoncazonca00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69 for healpix_cxx 3.11.2. # # # 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 -n \"\${ZSH_VERSION+set}\${BASH_VERSION+set}\" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test \"X\`printf %s \$ECHO\`\" = \"X\$ECHO\" \\ || test \"X\`print -r -- \$ECHO\`\" = \"X\$ECHO\" ) || 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'" SHELL=${CONFIG_SHELL-/bin/sh} 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='healpix_cxx' PACKAGE_TARNAME='healpix_cxx' PACKAGE_VERSION='3.11.2' PACKAGE_STRING='healpix_cxx 3.11.2' PACKAGE_BUGREPORT='' PACKAGE_URL='' # 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_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS LIBOBJS pkgconfig_libfile pkgconfig_libdir PKG_CONFIG_LIBDIR PKG_CONFIG_PATH PKG_CONFIG CFITSIO_LIBS CFITSIO_CFLAGS OPENMP_CXXFLAGS CXXCPP am__fastdepCXX_FALSE am__fastdepCXX_TRUE CXXDEPMODE ac_ct_CXX CXXFLAGS CXX OPENMP_CFLAGS CPP OTOOL64 OTOOL LIPO NMEDIT DSYMUTIL MANIFEST_TOOL RANLIB DLLTOOL OBJDUMP LN_S NM ac_ct_DUMPBIN DUMPBIN LD FGREP EGREP GREP SED host_os host_vendor host_cpu host build_os build_vendor build_cpu build LIBTOOL am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE am__nodep AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR OBJEXT EXEEXT ac_ct_CC CPPFLAGS LDFLAGS CFLAGS CC ac_ct_AR AR MAINT MAINTAINER_MODE_FALSE MAINTAINER_MODE_TRUE AM_BACKSLASH AM_DEFAULT_VERBOSITY AM_DEFAULT_V AM_V am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM 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_silent_rules enable_maintainer_mode enable_dependency_tracking enable_shared enable_static with_pic enable_fast_install with_gnu_ld with_sysroot enable_libtool_lock enable_native_optimizations enable_openmp ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP CXX CXXFLAGS CCC CXXCPP CFITSIO_CFLAGS CFITSIO_LIBS PKG_CONFIG PKG_CONFIG_PATH PKG_CONFIG_LIBDIR' # 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_TARNAME}' 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 healpix_cxx 3.11.2 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/healpix_cxx] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of healpix_cxx 3.11.2:";; esac 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] --enable-silent-rules less verbose build output (undo: "make V=1") --disable-silent-rules verbose build output (undo: "make V=0") --disable-maintainer-mode disable make rules and dependencies not useful (and sometimes confusing) to the casual installer --enable-dependency-tracking do not reject slow dependency extractors --disable-dependency-tracking speeds up one-time build --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) --enable-native-optimizations Enable non-portable optimizations for your own CPU by compiling with -march=native [default=no] --disable-openmp do not use OpenMP Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-pic[=PKGS] try to use only PIC/non-PIC objects [default=use both] --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-sysroot=DIR Search for dependent libraries within DIR (or the compiler's sysroot if not specified). 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 CXX C++ compiler command CXXFLAGS C++ compiler flags CXXCPP C++ preprocessor CFITSIO_CFLAGS compiler flags needed for building with cfitsio, if not found by pkg-config CFITSIO_LIBS linker flags needed for building with cfitsio, if not found by pkg-config PKG_CONFIG path to pkg-config utility PKG_CONFIG_PATH directories to add to pkg-config's search path PKG_CONFIG_LIBDIR path overriding pkg-config's built-in search path 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 healpix_cxx configure 3.11.2 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_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_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_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_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 # ac_fn_cxx_try_compile LINENO # ---------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_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_cxx_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_cxx_try_compile # ac_fn_cxx_try_cpp LINENO # ------------------------ # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_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_cxx_preproc_warn_flag$ac_cxx_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_cxx_try_cpp # ac_fn_cxx_try_link LINENO # ------------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_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_cxx_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_cxx_try_link # 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 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 healpix_cxx $as_me 3.11.2, 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 am__api_version='1.14' 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. # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if ${ac_cv_path_install+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;; esac # Do 'set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error $? "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi if test "$2" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done test "$2" = conftest.file ) then # Ok. : else as_fn_error $? "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi rm -f conftest.file test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --is-lightweight"; then am_missing_run="$MISSING " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using 'strip' when the user # run "make install-strip". However 'strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the 'STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; 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_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # 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_STRIP="${ac_tool_prefix}strip" $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 STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; 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_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # 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_STRIP="strip" $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_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" 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 STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if ${ac_cv_path_mkdir+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } for ac_prog in gawk mawk nawk awk 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_AWK+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # 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_AWK="$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 AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering ...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null # Check whether --enable-silent-rules was given. if test "${enable_silent_rules+set}" = set; then : enableval=$enable_silent_rules; fi case $enable_silent_rules in # ((( yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=1;; esac am_make=${MAKE-make} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5 $as_echo_n "checking whether $am_make supports nested variables... " >&6; } if ${am_cv_make_support_nested_variables+:} false; then : $as_echo_n "(cached) " >&6 else if $as_echo 'TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5 $as_echo "$am_cv_make_support_nested_variables" >&6; } if test $am_cv_make_support_nested_variables = yes; then AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AM_BACKSLASH='\' if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='healpix_cxx' VERSION='3.11.2' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # mkdir_p='$(MKDIR_P)' # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AMTAR='$${TAR-tar}' # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar pax cpio none' am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -' # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to enable maintainer-specific portions of Makefiles" >&5 $as_echo_n "checking whether to enable maintainer-specific portions of Makefiles... " >&6; } # Check whether --enable-maintainer-mode was given. if test "${enable_maintainer_mode+set}" = set; then : enableval=$enable_maintainer_mode; USE_MAINTAINER_MODE=$enableval else USE_MAINTAINER_MODE=yes fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $USE_MAINTAINER_MODE" >&5 $as_echo "$USE_MAINTAINER_MODE" >&6; } if test $USE_MAINTAINER_MODE = yes; then MAINTAINER_MODE_TRUE= MAINTAINER_MODE_FALSE='#' else MAINTAINER_MODE_TRUE='#' MAINTAINER_MODE_FALSE= fi MAINT=$MAINTAINER_MODE_TRUE DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from 'make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= 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 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 whether $CC understands -c and -o together" >&5 $as_echo_n "checking whether $CC understands -c and -o together... " >&6; } if ${am_cv_prog_cc_c_o+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if { echo "$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext" >&5 ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o" >&5 $as_echo "$am_cv_prog_cc_c_o" >&6; } if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" 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 depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CC_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi if test -n "$ac_tool_prefix"; then for ac_prog in ar lib "link -lib" 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_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="$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 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 test -n "$AR" && break done fi if test -z "$AR"; then ac_ct_AR=$AR for ac_prog in ar lib "link -lib" 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_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_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_ac_ct_AR="$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_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_AR" && break done if test "x$ac_ct_AR" = x; then AR="false" 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 AR=$ac_ct_AR fi fi : ${AR=ar} { $as_echo "$as_me:${as_lineno-$LINENO}: checking the archiver ($AR) interface" >&5 $as_echo_n "checking the archiver ($AR) interface... " >&6; } if ${am_cv_ar_interface+:} false; then : $as_echo_n "(cached) " >&6 else 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 am_cv_ar_interface=ar cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int some_variable = 0; _ACEOF if ac_fn_c_try_compile "$LINENO"; then : am_ar_try='$AR cru libconftest.a conftest.$ac_objext >&5' { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$am_ar_try\""; } >&5 (eval $am_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test "$ac_status" -eq 0; then am_cv_ar_interface=ar else am_ar_try='$AR -NOLOGO -OUT:conftest.lib conftest.$ac_objext >&5' { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$am_ar_try\""; } >&5 (eval $am_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test "$ac_status" -eq 0; then am_cv_ar_interface=lib else am_cv_ar_interface=unknown fi fi rm -f conftest.lib libconftest.a fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext 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 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_ar_interface" >&5 $as_echo "$am_cv_ar_interface" >&6; } case $am_cv_ar_interface in ar) ;; lib) # Microsoft lib, so override with the ar-lib wrapper script. # FIXME: It is wrong to rewrite AR. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__AR in this case, # and then we could set am__AR="$am_aux_dir/ar-lib \$(AR)" or something # similar. AR="$am_aux_dir/ar-lib $AR" ;; unknown) as_fn_error $? "could not determine $AR interface" "$LINENO" 5 ;; esac case `pwd` in *\ * | *\ *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5 $as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;; esac macro_version='2.4.2' macro_revision='1.3337' ltmain="$ac_aux_dir/ltmain.sh" # 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 # Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\(["`$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to print strings" >&5 $as_echo_n "checking how to print strings... " >&6; } # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "" } case "$ECHO" in printf*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: printf" >&5 $as_echo "printf" >&6; } ;; print*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: print -r" >&5 $as_echo "print -r" >&6; } ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: cat" >&5 $as_echo "cat" >&6; } ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5 $as_echo_n "checking for a sed that does not truncate output... " >&6; } if ${ac_cv_path_SED+:} false; then : $as_echo_n "(cached) " >&6 else ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/ for ac_i in 1 2 3 4 5 6 7; do ac_script="$ac_script$as_nl$ac_script" done echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed { ac_script=; unset ac_script;} if test -z "$SED"; then ac_path_SED_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 do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_SED="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_SED" || continue # Check for GNU ac_path_SED and select it if it is found. # Check for GNU $ac_path_SED case `"$ac_path_SED" --version 2>&1` in *GNU*) ac_cv_path_SED="$ac_path_SED" ac_path_SED_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 '' >> "conftest.nl" "$ac_path_SED" -f conftest.sed < "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_SED_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_SED="$ac_path_SED" ac_path_SED_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_SED_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_SED"; then as_fn_error $? "no acceptable sed could be found in \$PATH" "$LINENO" 5 fi else ac_cv_path_SED=$SED fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5 $as_echo "$ac_cv_path_SED" >&6; } SED="$ac_cv_path_SED" rm -f conftest.sed test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" { $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 fgrep" >&5 $as_echo_n "checking for fgrep... " >&6; } if ${ac_cv_path_FGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1 then ac_cv_path_FGREP="$GREP -F" else if test -z "$FGREP"; then ac_path_FGREP_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 fgrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_FGREP" || continue # Check for GNU ac_path_FGREP and select it if it is found. # Check for GNU $ac_path_FGREP case `"$ac_path_FGREP" --version 2>&1` in *GNU*) ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_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 'FGREP' >> "conftest.nl" "$ac_path_FGREP" FGREP < "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_FGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_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_FGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_FGREP"; then as_fn_error $? "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_FGREP=$FGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5 $as_echo "$ac_cv_path_FGREP" >&6; } FGREP="$ac_cv_path_FGREP" test -z "$GREP" && GREP=grep # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${lt_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${lt_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5 $as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; } if ${lt_cv_path_NM+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5 $as_echo "$lt_cv_path_NM" >&6; } if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else if test -n "$ac_tool_prefix"; then for ac_prog in dumpbin "link -dump" 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_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DUMPBIN"; then ac_cv_prog_DUMPBIN="$DUMPBIN" # 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_DUMPBIN="$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 DUMPBIN=$ac_cv_prog_DUMPBIN if test -n "$DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5 $as_echo "$DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DUMPBIN" && break done fi if test -z "$DUMPBIN"; then ac_ct_DUMPBIN=$DUMPBIN for ac_prog in dumpbin "link -dump" 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_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DUMPBIN"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # 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_DUMPBIN="$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_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN if test -n "$ac_ct_DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5 $as_echo "$ac_ct_DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_DUMPBIN" && break done if test "x$ac_ct_DUMPBIN" = x; then DUMPBIN=":" 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 DUMPBIN=$ac_ct_DUMPBIN fi fi case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) DUMPBIN=: ;; esac fi if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm { $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5 $as_echo_n "checking the name lister ($NM) interface... " >&6; } if ${lt_cv_nm_interface+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&5) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&5) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: output\"" >&5) cat conftest.out >&5 if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5 $as_echo "$lt_cv_nm_interface" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5 $as_echo_n "checking whether ln -s works... " >&6; } LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5 $as_echo "no, using $LN_S" >&6; } fi # find the maximum length of command line arguments { $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5 $as_echo_n "checking the maximum length of command line arguments... " >&6; } if ${lt_cv_sys_max_cmd_len+:} false; then : $as_echo_n "(cached) " >&6 else i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac fi if test -n $lt_cv_sys_max_cmd_len ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5 $as_echo "$lt_cv_sys_max_cmd_len" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5 $as_echo "none" >&6; } fi max_cmd_len=$lt_cv_sys_max_cmd_len : ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to $host format" >&5 $as_echo_n "checking how to convert $build file names to $host format... " >&6; } if ${lt_cv_to_host_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac fi to_host_file_cmd=$lt_cv_to_host_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_host_file_cmd" >&5 $as_echo "$lt_cv_to_host_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to toolchain format" >&5 $as_echo_n "checking how to convert $build file names to toolchain format... " >&6; } if ${lt_cv_to_tool_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else #assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac fi to_tool_file_cmd=$lt_cv_to_tool_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_tool_file_cmd" >&5 $as_echo "$lt_cv_to_tool_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5 $as_echo_n "checking for $LD option to reload object files... " >&6; } if ${lt_cv_ld_reload_flag+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_reload_flag='-r' fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5 $as_echo "$lt_cv_ld_reload_flag" >&6; } reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in cygwin* | mingw* | pw32* | cegcc*) if test "$GCC" != yes; then reload_cmds=false fi ;; darwin*) if test "$GCC" = yes; then reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args. set dummy ${ac_tool_prefix}objdump; 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_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OBJDUMP"; then ac_cv_prog_OBJDUMP="$OBJDUMP" # 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_OBJDUMP="${ac_tool_prefix}objdump" $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 OBJDUMP=$ac_cv_prog_OBJDUMP if test -n "$OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5 $as_echo "$OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OBJDUMP"; then ac_ct_OBJDUMP=$OBJDUMP # Extract the first word of "objdump", so it can be a program name with args. set dummy objdump; 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_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OBJDUMP"; then ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # 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_OBJDUMP="objdump" $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_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP if test -n "$ac_ct_OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5 $as_echo "$ac_ct_OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OBJDUMP" = x; then OBJDUMP="false" 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 OBJDUMP=$ac_ct_OBJDUMP fi else OBJDUMP="$ac_cv_prog_OBJDUMP" fi test -z "$OBJDUMP" && OBJDUMP=objdump { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5 $as_echo_n "checking how to recognize dependent libraries... " >&6; } if ${lt_cv_deplibs_check_method+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # `unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # which responds to the $file_magic_cmd with a given extended regex. # If you have `file' or equivalent on your system and you're not sure # whether `pass_all' will *always* work, you probably want this one. case $host_os in aix[4-9]*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump', # unless we find 'file', for example because we are cross-compiling. # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin. if ( test "$lt_cv_nm_interface" = "BSD nm" && file / ) >/dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9]\.[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[3-9]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5 $as_echo "$lt_cv_deplibs_check_method" >&6; } file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[\1]\/[\1]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dlltool", so it can be a program name with args. set dummy ${ac_tool_prefix}dlltool; 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_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DLLTOOL"; then ac_cv_prog_DLLTOOL="$DLLTOOL" # 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_DLLTOOL="${ac_tool_prefix}dlltool" $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 DLLTOOL=$ac_cv_prog_DLLTOOL if test -n "$DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DLLTOOL" >&5 $as_echo "$DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DLLTOOL"; then ac_ct_DLLTOOL=$DLLTOOL # Extract the first word of "dlltool", so it can be a program name with args. set dummy dlltool; 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_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DLLTOOL"; then ac_cv_prog_ac_ct_DLLTOOL="$ac_ct_DLLTOOL" # 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_DLLTOOL="dlltool" $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_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL if test -n "$ac_ct_DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL" >&5 $as_echo "$ac_ct_DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DLLTOOL" = x; then DLLTOOL="false" 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 DLLTOOL=$ac_ct_DLLTOOL fi else DLLTOOL="$ac_cv_prog_DLLTOOL" fi test -z "$DLLTOOL" && DLLTOOL=dlltool { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to associate runtime and link libraries" >&5 $as_echo_n "checking how to associate runtime and link libraries... " >&6; } if ${lt_cv_sharedlib_from_linklib_cmd+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh # decide which to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd="$ECHO" ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sharedlib_from_linklib_cmd" >&5 $as_echo "$lt_cv_sharedlib_from_linklib_cmd" >&6; } sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO if test -n "$ac_tool_prefix"; then for ac_prog in ar 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_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="$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 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 test -n "$AR" && break done fi if test -z "$AR"; then ac_ct_AR=$AR for ac_prog in ar 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_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_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_ac_ct_AR="$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_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_AR" && break done if test "x$ac_ct_AR" = x; then AR="false" 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 AR=$ac_ct_AR fi fi : ${AR=ar} : ${AR_FLAGS=cru} { $as_echo "$as_me:${as_lineno-$LINENO}: checking for archiver @FILE support" >&5 $as_echo_n "checking for archiver @FILE support... " >&6; } if ${lt_cv_ar_at_file+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ar_at_file=no cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&5' { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test "$ac_status" -eq 0; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test "$ac_status" -ne 0; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ar_at_file" >&5 $as_echo "$lt_cv_ar_at_file" >&6; } if test "x$lt_cv_ar_at_file" = xno; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; 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_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # 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_STRIP="${ac_tool_prefix}strip" $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 STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; 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_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # 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_STRIP="strip" $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_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" 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 STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi test -z "$STRIP" && STRIP=: 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 test -z "$RANLIB" && RANLIB=: # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check for command to grab the raw symbol name followed by C symbol from nm. { $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5 $as_echo_n "checking command to parse $NM output from $compiler object... " >&6; } if ${lt_cv_sys_global_symbol_pipe+:} false; then : $as_echo_n "(cached) " >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[ABCDGISTW]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[ABCDEGRST]' fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK '"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Now try to grab the symbols. nlist=conftest.nm if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist\""; } >&5 (eval $NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE) /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined(__osf__) /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[@]FILE' >/dev/null; then nm_file_list_spec='@' fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for sysroot" >&5 $as_echo_n "checking for sysroot... " >&6; } # Check whether --with-sysroot was given. if test "${with_sysroot+set}" = set; then : withval=$with_sysroot; else with_sysroot=no fi lt_sysroot= case ${with_sysroot} in #( yes) if test "$GCC" = yes; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${with_sysroot}" >&5 $as_echo "${with_sysroot}" >&6; } as_fn_error $? "The sysroot must be an absolute path." "$LINENO" 5 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${lt_sysroot:-no}" >&5 $as_echo "${lt_sysroot:-no}" >&6; } # Check whether --enable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then : enableval=$enable_libtool_lock; fi test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '#line '$LINENO' "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5 $as_echo_n "checking whether the C compiler needs -belf... " >&6; } if ${lt_cv_cc_needs_belf+:} false; then : $as_echo_n "(cached) " >&6 else 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_link "$LINENO"; then : lt_cv_cc_needs_belf=yes else lt_cv_cc_needs_belf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext 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 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5 $as_echo "$lt_cv_cc_needs_belf" >&6; } if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD="${LD-ld}_sol2" fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}mt", so it can be a program name with args. set dummy ${ac_tool_prefix}mt; 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_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$MANIFEST_TOOL"; then ac_cv_prog_MANIFEST_TOOL="$MANIFEST_TOOL" # 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_MANIFEST_TOOL="${ac_tool_prefix}mt" $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 MANIFEST_TOOL=$ac_cv_prog_MANIFEST_TOOL if test -n "$MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MANIFEST_TOOL" >&5 $as_echo "$MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_MANIFEST_TOOL"; then ac_ct_MANIFEST_TOOL=$MANIFEST_TOOL # Extract the first word of "mt", so it can be a program name with args. set dummy mt; 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_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_MANIFEST_TOOL"; then ac_cv_prog_ac_ct_MANIFEST_TOOL="$ac_ct_MANIFEST_TOOL" # 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_MANIFEST_TOOL="mt" $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_MANIFEST_TOOL=$ac_cv_prog_ac_ct_MANIFEST_TOOL if test -n "$ac_ct_MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_MANIFEST_TOOL" >&5 $as_echo "$ac_ct_MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_MANIFEST_TOOL" = x; then MANIFEST_TOOL=":" 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 MANIFEST_TOOL=$ac_ct_MANIFEST_TOOL fi else MANIFEST_TOOL="$ac_cv_prog_MANIFEST_TOOL" fi test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $MANIFEST_TOOL is a manifest tool" >&5 $as_echo_n "checking if $MANIFEST_TOOL is a manifest tool... " >&6; } if ${lt_cv_path_mainfest_tool+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&5 $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&5 if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_mainfest_tool" >&5 $as_echo "$lt_cv_path_mainfest_tool" >&6; } if test "x$lt_cv_path_mainfest_tool" != xyes; then MANIFEST_TOOL=: fi case $host_os in rhapsody* | darwin*) if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args. set dummy ${ac_tool_prefix}dsymutil; 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_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DSYMUTIL"; then ac_cv_prog_DSYMUTIL="$DSYMUTIL" # 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_DSYMUTIL="${ac_tool_prefix}dsymutil" $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 DSYMUTIL=$ac_cv_prog_DSYMUTIL if test -n "$DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5 $as_echo "$DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DSYMUTIL"; then ac_ct_DSYMUTIL=$DSYMUTIL # Extract the first word of "dsymutil", so it can be a program name with args. set dummy dsymutil; 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_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DSYMUTIL"; then ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # 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_DSYMUTIL="dsymutil" $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_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL if test -n "$ac_ct_DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5 $as_echo "$ac_ct_DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DSYMUTIL" = x; then DSYMUTIL=":" 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 DSYMUTIL=$ac_ct_DSYMUTIL fi else DSYMUTIL="$ac_cv_prog_DSYMUTIL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args. set dummy ${ac_tool_prefix}nmedit; 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_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NMEDIT"; then ac_cv_prog_NMEDIT="$NMEDIT" # 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_NMEDIT="${ac_tool_prefix}nmedit" $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 NMEDIT=$ac_cv_prog_NMEDIT if test -n "$NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5 $as_echo "$NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_NMEDIT"; then ac_ct_NMEDIT=$NMEDIT # Extract the first word of "nmedit", so it can be a program name with args. set dummy nmedit; 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_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_NMEDIT"; then ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # 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_NMEDIT="nmedit" $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_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT if test -n "$ac_ct_NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5 $as_echo "$ac_ct_NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_NMEDIT" = x; then NMEDIT=":" 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 NMEDIT=$ac_ct_NMEDIT fi else NMEDIT="$ac_cv_prog_NMEDIT" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args. set dummy ${ac_tool_prefix}lipo; 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_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$LIPO"; then ac_cv_prog_LIPO="$LIPO" # 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_LIPO="${ac_tool_prefix}lipo" $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 LIPO=$ac_cv_prog_LIPO if test -n "$LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5 $as_echo "$LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_LIPO"; then ac_ct_LIPO=$LIPO # Extract the first word of "lipo", so it can be a program name with args. set dummy lipo; 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_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_LIPO"; then ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # 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_LIPO="lipo" $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_LIPO=$ac_cv_prog_ac_ct_LIPO if test -n "$ac_ct_LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5 $as_echo "$ac_ct_LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_LIPO" = x; then LIPO=":" 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 LIPO=$ac_ct_LIPO fi else LIPO="$ac_cv_prog_LIPO" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args. set dummy ${ac_tool_prefix}otool; 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_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL"; then ac_cv_prog_OTOOL="$OTOOL" # 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_OTOOL="${ac_tool_prefix}otool" $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 OTOOL=$ac_cv_prog_OTOOL if test -n "$OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5 $as_echo "$OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL"; then ac_ct_OTOOL=$OTOOL # Extract the first word of "otool", so it can be a program name with args. set dummy otool; 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_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL"; then ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # 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_OTOOL="otool" $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_OTOOL=$ac_cv_prog_ac_ct_OTOOL if test -n "$ac_ct_OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5 $as_echo "$ac_ct_OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL" = x; then OTOOL=":" 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 OTOOL=$ac_ct_OTOOL fi else OTOOL="$ac_cv_prog_OTOOL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args. set dummy ${ac_tool_prefix}otool64; 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_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL64"; then ac_cv_prog_OTOOL64="$OTOOL64" # 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_OTOOL64="${ac_tool_prefix}otool64" $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 OTOOL64=$ac_cv_prog_OTOOL64 if test -n "$OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5 $as_echo "$OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL64"; then ac_ct_OTOOL64=$OTOOL64 # Extract the first word of "otool64", so it can be a program name with args. set dummy otool64; 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_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL64"; then ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # 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_OTOOL64="otool64" $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_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64 if test -n "$ac_ct_OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5 $as_echo "$ac_ct_OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL64" = x; then OTOOL64=":" 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 OTOOL64=$ac_ct_OTOOL64 fi else OTOOL64="$ac_cv_prog_OTOOL64" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5 $as_echo_n "checking for -single_module linker flag... " >&6; } if ${lt_cv_apple_cc_single_mod+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&5 $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&5 # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test $_lt_result -eq 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&5 fi rm -rf libconftest.dylib* rm -f conftest.* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5 $as_echo "$lt_cv_apple_cc_single_mod" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5 $as_echo_n "checking for -exported_symbols_list linker flag... " >&6; } if ${lt_cv_ld_exported_symbols_list+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_ld_exported_symbols_list=yes else lt_cv_ld_exported_symbols_list=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5 $as_echo "$lt_cv_ld_exported_symbols_list" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -force_load linker flag" >&5 $as_echo_n "checking for -force_load linker flag... " >&6; } if ${lt_cv_ld_force_load+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&5 $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&5 echo "$AR cru libconftest.a conftest.o" >&5 $AR cru libconftest.a conftest.o 2>&5 echo "$RANLIB libconftest.a" >&5 $RANLIB libconftest.a 2>&5 cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&5 $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&5 elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then lt_cv_ld_force_load=yes else cat conftest.err >&5 fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_force_load" >&5 $as_echo "$lt_cv_ld_force_load" >&6; } case $host_os in rhapsody* | darwin1.[012]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[91]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[012]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":" && test "$lt_cv_ld_force_load" = "no"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac 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 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 for ac_header in dlfcn.h do : ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default " if test "x$ac_cv_header_dlfcn_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_DLFCN_H 1 _ACEOF fi done # Set options enable_dlopen=no enable_win32_dll=no # Check whether --enable-shared was given. if test "${enable_shared+set}" = set; then : enableval=$enable_shared; p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac else enable_shared=yes fi # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac else enable_static=yes fi # Check whether --with-pic was given. if test "${with_pic+set}" = set; then : withval=$with_pic; lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for lt_pkg in $withval; do IFS="$lt_save_ifs" if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS="$lt_save_ifs" ;; esac else pic_mode=default fi test -z "$pic_mode" && pic_mode=default # Check whether --enable-fast-install was given. if test "${enable_fast_install+set}" = set; then : enableval=$enable_fast_install; p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac else enable_fast_install=yes fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' test -z "$LN_S" && LN_S="ln -s" if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5 $as_echo_n "checking for objdir... " >&6; } if ${lt_cv_objdir+:} false; then : $as_echo_n "(cached) " >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5 $as_echo "$lt_cv_objdir" >&6; } objdir=$lt_cv_objdir cat >>confdefs.h <<_ACEOF #define LT_OBJDIR "$lt_cv_objdir/" _ACEOF case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5 $as_echo_n "checking for ${ac_tool_prefix}file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/${ac_tool_prefix}file; then lt_cv_path_MAGIC_CMD="$ac_dir/${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5 $as_echo_n "checking for file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/file; then lt_cv_path_MAGIC_CMD="$ac_dir/file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi else MAGIC_CMD=: fi fi fi ;; esac # Use C for the default configuration in the libtool script lt_save_CC="$CC" 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 # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then lt_prog_compiler_no_builtin_flag= if test "$GCC" = yes; then case $cc_basename in nvcc*) lt_prog_compiler_no_builtin_flag=' -Xcompiler -fno-builtin' ;; *) lt_prog_compiler_no_builtin_flag=' -fno-builtin' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 $as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; } if ${lt_cv_prog_compiler_rtti_exceptions+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 $as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; } if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= if test "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. lt_prog_compiler_static= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; *) lt_prog_compiler_pic='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 lt_prog_compiler_wl='-Xlinker ' if test -n "$lt_prog_compiler_pic"; then lt_prog_compiler_pic="-Xcompiler $lt_prog_compiler_pic" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; # Lahey Fortran 8.1. lf95*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='--shared' lt_prog_compiler_static='--static' ;; nagfor*) # NAG Fortran compiler lt_prog_compiler_wl='-Wl,-Wl,,' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-qpic' lt_prog_compiler_static='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [1-7].* | *Sun*Fortran*\ 8.[0-3]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='' ;; *Sun\ F* | *Sun*Fortran*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Wl,' ;; *Intel*\ [CF]*Compiler*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; *Portland\ Group*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; esac ;; esac ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; rdos*) lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if ${lt_cv_prog_compiler_pic+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic=$lt_prog_compiler_pic fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic" >&5 $as_echo "$lt_cv_prog_compiler_pic" >&6; } lt_prog_compiler_pic=$lt_cv_prog_compiler_pic # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; } if ${lt_cv_prog_compiler_pic_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5 $as_echo "$lt_cv_prog_compiler_pic_works" >&6; } if test x"$lt_cv_prog_compiler_pic_works" = xyes; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if ${lt_cv_prog_compiler_static_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works=yes fi else lt_cv_prog_compiler_static_works=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5 $as_echo "$lt_cv_prog_compiler_static_works" >&6; } if test x"$lt_cv_prog_compiler_static_works" = xyes; then : else lt_prog_compiler_static= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } runpath_var= allow_undefined_flag= always_export_symbols=no archive_cmds= archive_expsym_cmds= compiler_needs_object=no enable_shared_with_static_runtimes=no export_dynamic_flag_spec= export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' hardcode_automatic=no hardcode_direct=no hardcode_direct_absolute=no hardcode_libdir_flag_spec= hardcode_libdir_separator= hardcode_minus_L=no hardcode_shlibpath_var=unsupported inherit_rpath=no link_all_deplibs=unknown module_cmds= module_expsym_cmds= old_archive_from_new_cmds= old_archive_from_expsyms_cmds= thread_safe_flag_spec= whole_archive_flag_spec= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs=no ;; esac ld_shlibs=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test "$with_gnu_ld" = yes; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[2-9]*) ;; *\ \(GNU\ Binutils\)\ [3-9]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test "$lt_use_gnu_ld_interface" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[3-9]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' export_dynamic_flag_spec='${wl}--export-all-symbols' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; haiku*) archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' link_all_deplibs=yes ;; interix[3-9]*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 whole_archive_flag_spec= tmp_sharedflag='--shared' ;; xl[cC]* | bgxl[cC]* | mpixl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 whole_archive_flag_spec='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else ld_shlibs=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test "$ld_shlibs" = no; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_direct_absolute=yes hardcode_libdir_separator=':' link_all_deplibs=yes file_list_spec='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an # empty executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' ${wl}-bernotok' allow_undefined_flag=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. whole_archive_flag_spec='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' fi archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported always_export_symbols=yes file_list_spec='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, )='true' enable_shared_with_static_runtimes=yes exclude_expsyms='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1,DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib old_postinstall_cmds='chmod 644 $oldlib' postlink_cmds='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_from_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs' enable_shared_with_static_runtimes=yes ;; esac ;; darwin* | rhapsody*) archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported if test "$lt_cv_ld_force_load" = "yes"; then whole_archive_flag_spec='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' else whole_archive_flag_spec='' fi link_all_deplibs=yes allow_undefined_flag="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=func_echo_all archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" else ld_shlibs=no fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='${wl}-E' ;; hpux10*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $CC understands -b" >&5 $as_echo_n "checking if $CC understands -b... " >&6; } if ${lt_cv_prog_compiler__b+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler__b=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -b" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler__b=yes fi else lt_cv_prog_compiler__b=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler__b" >&5 $as_echo "$lt_cv_prog_compiler__b" >&6; } if test x"$lt_cv_prog_compiler__b" = xyes; then archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $host_os linker accepts -exported_symbol" >&5 $as_echo_n "checking whether the $host_os linker accepts -exported_symbol... " >&6; } if ${lt_cv_irix_exported_symbol+:} false; then : $as_echo_n "(cached) " >&6 else save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int foo (void) { return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_irix_exported_symbol=yes else lt_cv_irix_exported_symbol=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_irix_exported_symbol" >&5 $as_echo "$lt_cv_irix_exported_symbol" >&6; } if test "$lt_cv_irix_exported_symbol" = yes; then archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' fi else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: inherit_rpath=yes link_all_deplibs=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct=yes hardcode_shlibpath_var=no hardcode_direct_absolute=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac fi else ld_shlibs=no fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi archive_cmds_need_lc='no' hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' archive_cmds='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then whole_archive_flag_spec='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else whole_archive_flag_spec='-z allextract$convenience -z defaultextract' fi ;; esac link_all_deplibs=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag='${wl}-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='${wl}-z,text' allow_undefined_flag='${wl}-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-R,$libdir' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) export_dynamic_flag_spec='${wl}-Blargedynsym' ;; esac fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5 $as_echo "$ld_shlibs" >&6; } test "$ld_shlibs" = no && can_build_shared=no with_gnu_ld=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } if ${lt_cv_archive_cmds_need_lc+:} false; then : $as_echo_n "(cached) " >&6 else $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then lt_cv_archive_cmds_need_lc=no else lt_cv_archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc" >&5 $as_echo "$lt_cv_archive_cmds_need_lc" >&6; } archive_cmds_need_lc=$lt_cv_archive_cmds_need_lc ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq="s,=\([A-Za-z]:\),\1,g" ;; *) lt_sed_strip_eq="s,=/,/,g" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[lt_foo]++; } if (lt_freq[lt_foo] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's,/\([A-Za-z]:\),\1,g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' library_names_spec='${libname}.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec="$LIB" if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib" sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[23].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=yes sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[3-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH if ${lt_cv_shlibpath_overrides_runpath+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : lt_cv_shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir fi shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action= if test -n "$hardcode_libdir_flag_spec" || test -n "$runpath_var" || test "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5 $as_echo "$hardcode_action" >&6; } if test "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $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 dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=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_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; *) ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load" if test "x$ac_cv_func_shl_load" = xyes; then : lt_cv_dlopen="shl_load" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5 $as_echo_n "checking for shl_load in -ldld... " >&6; } if ${ac_cv_lib_dld_shl_load+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $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 shl_load (); int main () { return shl_load (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_shl_load=yes else ac_cv_lib_dld_shl_load=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_dld_shl_load" >&5 $as_echo "$ac_cv_lib_dld_shl_load" >&6; } if test "x$ac_cv_lib_dld_shl_load" = xyes; then : lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld" else ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen" if test "x$ac_cv_func_dlopen" = xyes; then : lt_cv_dlopen="dlopen" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $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 dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=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_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5 $as_echo_n "checking for dlopen in -lsvld... " >&6; } if ${ac_cv_lib_svld_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $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 dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_svld_dlopen=yes else ac_cv_lib_svld_dlopen=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_svld_dlopen" >&5 $as_echo "$ac_cv_lib_svld_dlopen" >&6; } if test "x$ac_cv_lib_svld_dlopen" = xyes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5 $as_echo_n "checking for dld_link in -ldld... " >&6; } if ${ac_cv_lib_dld_dld_link+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $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 dld_link (); int main () { return dld_link (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_dld_link=yes else ac_cv_lib_dld_dld_link=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_dld_dld_link" >&5 $as_echo "$ac_cv_lib_dld_dld_link" >&6; } if test "x$ac_cv_lib_dld_dld_link" = xyes; then : lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld" fi fi fi fi fi fi ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5 $as_echo_n "checking whether a program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5 $as_echo "$lt_cv_dlopen_self" >&6; } if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5 $as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self_static+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5 $as_echo "$lt_cv_dlopen_self_static" >&6; } fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi striplib= old_striplib= { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5 $as_echo_n "checking whether stripping libraries is possible... " >&6; } if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" { $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 ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } ;; esac fi # Report which library types will actually be built { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5 $as_echo_n "checking if libtool supports shared libraries... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5 $as_echo "$can_build_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5 $as_echo_n "checking whether to build shared libraries... " >&6; } test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5 $as_echo "$enable_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5 $as_echo_n "checking whether to build static libraries... " >&6; } # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5 $as_echo "$enable_static" >&6; } 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 CC="$lt_save_CC" ac_config_commands="$ac_config_commands libtool" # Only expand once: includedir="${includedir}/${PACKAGE_NAME}" # Check whether --enable-silent-rules was given. if test "${enable_silent_rules+set}" = set; then : enableval=$enable_silent_rules; fi case $enable_silent_rules in # ((( yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=0;; esac am_make=${MAKE-make} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5 $as_echo_n "checking whether $am_make supports nested variables... " >&6; } if ${am_cv_make_support_nested_variables+:} false; then : $as_echo_n "(cached) " >&6 else if $as_echo 'TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5 $as_echo "$am_cv_make_support_nested_variables" >&6; } if test $am_cv_make_support_nested_variables = yes; then AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AM_BACKSLASH='\' # Check whether --enable-native-optimizations was given. if test "${enable_native_optimizations+set}" = set; then : enableval=$enable_native_optimizations; fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C99" >&5 $as_echo_n "checking for $CC option to accept ISO C99... " >&6; } if ${ac_cv_prog_cc_c99+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c99=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include #include // Check varargs macros. These examples are taken from C99 6.10.3.5. #define debug(...) fprintf (stderr, __VA_ARGS__) #define showlist(...) puts (#__VA_ARGS__) #define report(test,...) ((test) ? puts (#test) : printf (__VA_ARGS__)) static void test_varargs_macros (void) { int x = 1234; int y = 5678; debug ("Flag"); debug ("X = %d\n", x); showlist (The first, second, and third items.); report (x>y, "x is %d but y is %d", x, y); } // Check long long types. #define BIG64 18446744073709551615ull #define BIG32 4294967295ul #define BIG_OK (BIG64 / BIG32 == 4294967297ull && BIG64 % BIG32 == 0) #if !BIG_OK your preprocessor is broken; #endif #if BIG_OK #else your preprocessor is broken; #endif static long long int bignum = -9223372036854775807LL; static unsigned long long int ubignum = BIG64; struct incomplete_array { int datasize; double data[]; }; struct named_init { int number; const wchar_t *name; double average; }; typedef const char *ccp; static inline int test_restrict (ccp restrict text) { // See if C++-style comments work. // Iterate through items via the restricted pointer. // Also check for declarations in for loops. for (unsigned int i = 0; *(text+i) != '\0'; ++i) continue; return 0; } // Check varargs and va_copy. static void test_varargs (const char *format, ...) { va_list args; va_start (args, format); va_list args_copy; va_copy (args_copy, args); const char *str; int number; float fnumber; while (*format) { switch (*format++) { case 's': // string str = va_arg (args_copy, const char *); break; case 'd': // int number = va_arg (args_copy, int); break; case 'f': // float fnumber = va_arg (args_copy, double); break; default: break; } } va_end (args_copy); va_end (args); } int main () { // Check bool. _Bool success = false; // Check restrict. if (test_restrict ("String literal") == 0) success = true; char *restrict newvar = "Another string"; // Check varargs. test_varargs ("s, d' f .", "string", 65, 34.234); test_varargs_macros (); // Check flexible array members. struct incomplete_array *ia = malloc (sizeof (struct incomplete_array) + (sizeof (double) * 10)); ia->datasize = 10; for (int i = 0; i < ia->datasize; ++i) ia->data[i] = i * 1.234; // Check named initializers. struct named_init ni = { .number = 34, .name = L"Test wide string", .average = 543.34343, }; ni.number = 58; int dynamic_array[ni.number]; dynamic_array[ni.number - 1] = 543; // work around unused variable warnings return (!success || bignum == 0LL || ubignum == 0uLL || newvar[0] == 'x' || dynamic_array[ni.number - 1] != 543); ; return 0; } _ACEOF for ac_arg in '' -std=gnu99 -std=c99 -c99 -AC99 -D_STDC_C99= -qlanglvl=extc99 do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c99=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c99" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c99" 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_c99" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c99" >&5 $as_echo "$ac_cv_prog_cc_c99" >&6; } ;; esac if test "x$ac_cv_prog_cc_c99" != xno; then : fi OPENMP_CFLAGS= # Check whether --enable-openmp was given. if test "${enable_openmp+set}" = set; then : enableval=$enable_openmp; fi if test "$enable_openmp" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to support OpenMP" >&5 $as_echo_n "checking for $CC option to support OpenMP... " >&6; } if ${ac_cv_prog_c_openmp+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef _OPENMP choke me #endif #include int main () { return omp_get_num_threads (); } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_prog_c_openmp='none needed' else ac_cv_prog_c_openmp='unsupported' for ac_option in -fopenmp -xopenmp -openmp -mp -omp -qsmp=omp -homp \ -Popenmp --openmp; do ac_save_CFLAGS=$CFLAGS CFLAGS="$CFLAGS $ac_option" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef _OPENMP choke me #endif #include int main () { return omp_get_num_threads (); } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_prog_c_openmp=$ac_option fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext CFLAGS=$ac_save_CFLAGS if test "$ac_cv_prog_c_openmp" != unsupported; then break fi done fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_c_openmp" >&5 $as_echo "$ac_cv_prog_c_openmp" >&6; } case $ac_cv_prog_c_openmp in #( "none needed" | unsupported) ;; #( *) OPENMP_CFLAGS=$ac_cv_prog_c_openmp ;; esac fi CPPFLAGS="$CPPFLAGS $OPENMP_CFLAGS" CFLAGS="$CFLAGS $OPENMP_CFLAGS" if test "x$enable_native_optimizations" = "xyes"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -march=native" >&5 $as_echo_n "checking whether C compiler accepts -march=native... " >&6; } if ${ax_cv_check_cflags___march_native+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -march=native" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___march_native=yes else ax_cv_check_cflags___march_native=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___march_native" >&5 $as_echo "$ax_cv_check_cflags___march_native" >&6; } if test x"$ax_cv_check_cflags___march_native" = xyes; then : CC="$CC -march=native" else : fi else if test "x$GCC" = "xyes" -a "x`$CC -dumpversion | cut -d. -f1,2`" = "x4.4"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fno-tree-fre" >&5 $as_echo_n "checking whether C compiler accepts -fno-tree-fre... " >&6; } if ${ax_cv_check_cflags___fno_tree_fre+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fno-tree-fre" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fno_tree_fre=yes else ax_cv_check_cflags___fno_tree_fre=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fno_tree_fre" >&5 $as_echo "$ax_cv_check_cflags___fno_tree_fre" >&6; } if test x"$ax_cv_check_cflags___fno_tree_fre" = xyes; then : CFLAGS="$CFLAGS -fno-tree-fre" else : fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fno-tree-vectorize" >&5 $as_echo_n "checking whether C compiler accepts -fno-tree-vectorize... " >&6; } if ${ax_cv_check_cflags___fno_tree_vectorize+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fno-tree-vectorize" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fno_tree_vectorize=yes else ax_cv_check_cflags___fno_tree_vectorize=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fno_tree_vectorize" >&5 $as_echo "$ax_cv_check_cflags___fno_tree_vectorize" >&6; } if test x"$ax_cv_check_cflags___fno_tree_vectorize" = xyes; then : CFLAGS="$CFLAGS -fno-tree-vectorize" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fno-math-errno" >&5 $as_echo_n "checking whether C compiler accepts -fno-math-errno... " >&6; } if ${ax_cv_check_cflags___fno_math_errno+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fno-math-errno" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fno_math_errno=yes else ax_cv_check_cflags___fno_math_errno=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fno_math_errno" >&5 $as_echo "$ax_cv_check_cflags___fno_math_errno" >&6; } if test x"$ax_cv_check_cflags___fno_math_errno" = xyes; then : CFLAGS="$CFLAGS -fno-math-errno" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -funsafe-math-optimizations" >&5 $as_echo_n "checking whether C compiler accepts -funsafe-math-optimizations... " >&6; } if ${ax_cv_check_cflags___funsafe_math_optimizations+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -funsafe-math-optimizations" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___funsafe_math_optimizations=yes else ax_cv_check_cflags___funsafe_math_optimizations=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___funsafe_math_optimizations" >&5 $as_echo "$ax_cv_check_cflags___funsafe_math_optimizations" >&6; } if test x"$ax_cv_check_cflags___funsafe_math_optimizations" = xyes; then : CFLAGS="$CFLAGS -funsafe-math-optimizations" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fno-trapping-math" >&5 $as_echo_n "checking whether C compiler accepts -fno-trapping-math... " >&6; } if ${ax_cv_check_cflags___fno_trapping_math+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fno-trapping-math" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fno_trapping_math=yes else ax_cv_check_cflags___fno_trapping_math=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fno_trapping_math" >&5 $as_echo "$ax_cv_check_cflags___fno_trapping_math" >&6; } if test x"$ax_cv_check_cflags___fno_trapping_math" = xyes; then : CFLAGS="$CFLAGS -fno-trapping-math" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fno-rounding-math" >&5 $as_echo_n "checking whether C compiler accepts -fno-rounding-math... " >&6; } if ${ax_cv_check_cflags___fno_rounding_math+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fno-rounding-math" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fno_rounding_math=yes else ax_cv_check_cflags___fno_rounding_math=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fno_rounding_math" >&5 $as_echo "$ax_cv_check_cflags___fno_rounding_math" >&6; } if test x"$ax_cv_check_cflags___fno_rounding_math" = xyes; then : CFLAGS="$CFLAGS -fno-rounding-math" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fno-signaling-nans" >&5 $as_echo_n "checking whether C compiler accepts -fno-signaling-nans... " >&6; } if ${ax_cv_check_cflags___fno_signaling_nans+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fno-signaling-nans" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fno_signaling_nans=yes else ax_cv_check_cflags___fno_signaling_nans=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fno_signaling_nans" >&5 $as_echo "$ax_cv_check_cflags___fno_signaling_nans" >&6; } if test x"$ax_cv_check_cflags___fno_signaling_nans" = xyes; then : CFLAGS="$CFLAGS -fno-signaling-nans" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fcx-limited-range" >&5 $as_echo_n "checking whether C compiler accepts -fcx-limited-range... " >&6; } if ${ax_cv_check_cflags___fcx_limited_range+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fcx-limited-range" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fcx_limited_range=yes else ax_cv_check_cflags___fcx_limited_range=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fcx_limited_range" >&5 $as_echo "$ax_cv_check_cflags___fcx_limited_range" >&6; } if test x"$ax_cv_check_cflags___fcx_limited_range" = xyes; then : CFLAGS="$CFLAGS -fcx-limited-range" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C compiler accepts -fomit-frame-pointer" >&5 $as_echo_n "checking whether C compiler accepts -fomit-frame-pointer... " >&6; } if ${ax_cv_check_cflags___fomit_frame_pointer+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CFLAGS CFLAGS="$CFLAGS -fomit-frame-pointer" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ax_cv_check_cflags___fomit_frame_pointer=yes else ax_cv_check_cflags___fomit_frame_pointer=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cflags___fomit_frame_pointer" >&5 $as_echo "$ax_cv_check_cflags___fomit_frame_pointer" >&6; } if test x"$ax_cv_check_cflags___fomit_frame_pointer" = xyes; then : CFLAGS="$CFLAGS -fomit-frame-pointer" else : fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -z "$CXX"; then if test -n "$CCC"; then CXX=$CCC else if test -n "$ac_tool_prefix"; then for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC 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_CXX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # 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_CXX="$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 CXX=$ac_cv_prog_CXX if test -n "$CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5 $as_echo "$CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC 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_CXX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # 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_CXX="$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_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5 $as_echo "$ac_ct_CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CXX" && break done if test "x$ac_ct_CXX" = x; then CXX="g++" 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 CXX=$ac_ct_CXX fi fi fi fi # 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_cxx_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_cxx_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_cxx_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5 $as_echo "$ac_cv_cxx_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GXX=yes else GXX= fi ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5 $as_echo_n "checking whether $CXX accepts -g... " >&6; } if ${ac_cv_prog_cxx_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_cxx_werror_flag=$ac_cxx_werror_flag ac_cxx_werror_flag=yes ac_cv_prog_cxx_g=no CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes else CXXFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else ac_cxx_werror_flag=$ac_save_cxx_werror_flag CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_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_cxx_werror_flag=$ac_save_cxx_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5 $as_echo "$ac_cv_prog_cxx_g" >&6; } if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= 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 depcc="$CXX" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CXX_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5 $as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; } CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi func_stripname_cnf () { case ${2} in .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;; esac } # func_stripname_cnf if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_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; } if test -z "$CXXCPP"; then if ${ac_cv_prog_CXXCPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CXXCPP needs to be expanded for CXXCPP in "$CXX -E" "/lib/cpp" do ac_preproc_ok=false for ac_cxx_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_cxx_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_cxx_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_CXXCPP=$CXXCPP fi CXXCPP=$ac_cv_prog_CXXCPP else ac_cv_prog_CXXCPP=$CXXCPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXXCPP" >&5 $as_echo "$CXXCPP" >&6; } ac_preproc_ok=false for ac_cxx_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_cxx_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_cxx_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 \"$CXXCPP\" 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 else _lt_caught_CXX_error=yes fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu archive_cmds_need_lc_CXX=no allow_undefined_flag_CXX= always_export_symbols_CXX=no archive_expsym_cmds_CXX= compiler_needs_object_CXX=no export_dynamic_flag_spec_CXX= hardcode_direct_CXX=no hardcode_direct_absolute_CXX=no hardcode_libdir_flag_spec_CXX= hardcode_libdir_separator_CXX= hardcode_minus_L_CXX=no hardcode_shlibpath_var_CXX=unsupported hardcode_automatic_CXX=no inherit_rpath_CXX=no module_cmds_CXX= module_expsym_cmds_CXX= link_all_deplibs_CXX=unknown old_archive_cmds_CXX=$old_archive_cmds reload_flag_CXX=$reload_flag reload_cmds_CXX=$reload_cmds no_undefined_flag_CXX= whole_archive_flag_spec_CXX= enable_shared_with_static_runtimes_CXX=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o objext_CXX=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} CFLAGS=$CXXFLAGS compiler=$CC compiler_CXX=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin' else lt_prog_compiler_no_builtin_flag_CXX= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${lt_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${lt_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then archive_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_CXX= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } ld_shlibs_CXX=yes case $host_os in aix3*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_CXX='' hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes file_list_spec_CXX='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct_CXX=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_CXX=yes hardcode_libdir_flag_spec_CXX='-L$libdir' hardcode_libdir_separator_CXX= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec_CXX='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. always_export_symbols_CXX=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_CXX='-berok' # Determine the default libpath from the value encoded in an empty # executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath__CXX+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath__CXX fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_CXX='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_CXX="-z nodefs" archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath__CXX+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath__CXX fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_CXX=' ${wl}-bernotok' allow_undefined_flag_CXX=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_CXX='$convenience' fi archive_cmds_need_lc_CXX=yes # This is similar to how AIX traditionally builds its shared # libraries. archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_CXX=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_CXX=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) case $GXX,$cc_basename in ,cl* | no,cl*) # Native MSVC # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec_CXX=' ' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=yes file_list_spec_CXX='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, CXX)='true' enable_shared_with_static_runtimes_CXX=yes # Don't use ranlib old_postinstall_cmds_CXX='chmod 644 $oldlib' postlink_cmds_CXX='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ func_to_tool_file "$lt_outputfile"~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # g++ # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_CXX='-L$libdir' export_dynamic_flag_spec_CXX='${wl}--export-all-symbols' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=no enable_shared_with_static_runtimes_CXX=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_CXX=no fi ;; esac ;; darwin* | rhapsody*) archive_cmds_need_lc_CXX=no hardcode_direct_CXX=no hardcode_automatic_CXX=yes hardcode_shlibpath_var_CXX=unsupported if test "$lt_cv_ld_force_load" = "yes"; then whole_archive_flag_spec_CXX='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' else whole_archive_flag_spec_CXX='' fi link_all_deplibs_CXX=yes allow_undefined_flag_CXX="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=func_echo_all archive_cmds_CXX="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds_CXX="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds_CXX="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" if test "$lt_cv_apple_cc_single_mod" != "yes"; then archive_cmds_CXX="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi else ld_shlibs_CXX=no fi ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; freebsd2.*) # C++ shared libraries reported to be fairly broken before # switch to ELF ld_shlibs_CXX=no ;; freebsd-elf*) archive_cmds_need_lc_CXX=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions ld_shlibs_CXX=yes ;; haiku*) archive_cmds_CXX='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' link_all_deplibs_CXX=yes ;; hpux9*) hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: export_dynamic_flag_spec_CXX='${wl}-E' hardcode_direct_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: case $host_cpu in hppa*64*|ia64*) ;; *) export_dynamic_flag_spec_CXX='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no ;; *) hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; interix[3-9]*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_CXX='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` -o $lib' fi fi link_all_deplibs_CXX=yes ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: inherit_rpath_CXX=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac archive_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac archive_cmds_need_lc_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [1-5].* | *pgcpp\ [1-5].*) prelink_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"' old_archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~ $RANLIB $oldlib' archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 and above use weak symbols archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_CXX='-rpath $libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed' ;; xl* | mpixl* | bgxl*) # IBM XL 8.0 on PPC, with GNU ld hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds_CXX='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' hardcode_libdir_flag_spec_CXX='-R$libdir' whole_archive_flag_spec_CXX='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object_CXX=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; m88k*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds_CXX='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) ld_shlibs_CXX=yes ;; openbsd2*) # C++ shared libraries are fairly broken ld_shlibs_CXX=no ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no hardcode_direct_absolute_CXX=yes archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' export_dynamic_flag_spec_CXX='${wl}-E' whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=func_echo_all else ld_shlibs_CXX=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' hardcode_libdir_separator_CXX=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx*) case $host in osf3*) allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && func_echo_all "${wl}-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' ;; *) allow_undefined_flag_CXX=' -expect_unresolved \*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' hardcode_libdir_flag_spec_CXX='-rpath $libdir' ;; esac hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) archive_cmds_CXX='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ archive_cmds_need_lc_CXX=yes no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_shlibpath_var_CXX=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract' ;; esac link_all_deplibs_CXX=yes output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then no_undefined_flag_CXX=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. archive_cmds_CXX='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' fi hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir' case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag_CXX='${wl}-z,text' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag_CXX='${wl}-z,text' allow_undefined_flag_CXX='${wl}-z,nodefs' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-R,$libdir' hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes export_dynamic_flag_spec_CXX='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' old_archive_cmds_CXX='$CC -Tprelink_objects $oldobjs~ '"$old_archive_cmds_CXX" reload_cmds_CXX='$CC -Tprelink_objects $reload_objs~ '"$reload_cmds_CXX" ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no GCC_CXX="$GXX" LD_CXX="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... # Dependencies to place before and after the object being linked: predep_objects_CXX= postdep_objects_CXX= predeps_CXX= postdeps_CXX= compiler_lib_search_path_CXX= cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF _lt_libdeps_save_CFLAGS=$CFLAGS case "$CC $CFLAGS " in #( *\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;; *\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;; *\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;; esac if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case ${prev}${p} in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue fi # Expand the sysroot to ease extracting the directories later. if test -z "$prev"; then case $p in -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;; -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;; -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;; esac fi case $p in =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;; esac if test "$pre_test_object_deps_done" = no; then case ${prev} in -L | -R) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$compiler_lib_search_path_CXX"; then compiler_lib_search_path_CXX="${prev}${p}" else compiler_lib_search_path_CXX="${compiler_lib_search_path_CXX} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$postdeps_CXX"; then postdeps_CXX="${prev}${p}" else postdeps_CXX="${postdeps_CXX} ${prev}${p}" fi fi prev= ;; *.lto.$objext) ;; # Ignore GCC LTO objects *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$predep_objects_CXX"; then predep_objects_CXX="$p" else predep_objects_CXX="$predep_objects_CXX $p" fi else if test -z "$postdep_objects_CXX"; then postdep_objects_CXX="$p" else postdep_objects_CXX="$postdep_objects_CXX $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling CXX test program" fi $RM -f confest.$objext CFLAGS=$_lt_libdeps_save_CFLAGS # PORTME: override above test on systems where it is broken case $host_os in interix[3-9]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. predep_objects_CXX= postdep_objects_CXX= postdeps_CXX= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; esac case " $postdeps_CXX " in *" -lc "*) archive_cmds_need_lc_CXX=no ;; esac compiler_lib_search_dirs_CXX= if test -n "${compiler_lib_search_path_CXX}"; then compiler_lib_search_dirs_CXX=`echo " ${compiler_lib_search_path_CXX}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi lt_prog_compiler_wl_CXX= lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX= # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic_CXX='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_CXX='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all lt_prog_compiler_pic_CXX= ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. lt_prog_compiler_static_CXX= ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_CXX=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac else case $host_os in aix[4-9]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' else lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, CXX)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; dgux*) case $cc_basename in ec++*) lt_prog_compiler_pic_CXX='-KPIC' ;; ghcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then lt_prog_compiler_pic_CXX='+Z' fi ;; aCC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_CXX='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # KAI C++ Compiler lt_prog_compiler_wl_CXX='--backend -Wl,' lt_prog_compiler_pic_CXX='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fPIC' lt_prog_compiler_static_CXX='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fpic' lt_prog_compiler_static_CXX='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; xlc* | xlC* | bgxl[cC]* | mpixl[cC]*) # IBM XL 8.0, 9.0 on PPC and BlueGene lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-qpic' lt_prog_compiler_static_CXX='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) lt_prog_compiler_pic_CXX='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) lt_prog_compiler_wl_CXX='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 lt_prog_compiler_pic_CXX='-pic' ;; cxx*) # Digital/Compaq C++ lt_prog_compiler_wl_CXX='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x lt_prog_compiler_pic_CXX='-pic' lt_prog_compiler_static_CXX='-Bstatic' ;; lcc*) # Lucid lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 lt_prog_compiler_pic_CXX='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) lt_prog_compiler_can_build_shared_CXX=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_CXX= ;; *) lt_prog_compiler_pic_CXX="$lt_prog_compiler_pic_CXX -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if ${lt_cv_prog_compiler_pic_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_CXX=$lt_prog_compiler_pic_CXX fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_CXX" >&6; } lt_prog_compiler_pic_CXX=$lt_cv_prog_compiler_pic_CXX # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... " >&6; } if ${lt_cv_prog_compiler_pic_works_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works_CXX=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_CXX -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works_CXX=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_pic_works_CXX" = xyes; then case $lt_prog_compiler_pic_CXX in "" | " "*) ;; *) lt_prog_compiler_pic_CXX=" $lt_prog_compiler_pic_CXX" ;; esac else lt_prog_compiler_pic_CXX= lt_prog_compiler_can_build_shared_CXX=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\"$lt_prog_compiler_static_CXX\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if ${lt_cv_prog_compiler_static_works_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works_CXX=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works_CXX=yes fi else lt_cv_prog_compiler_static_works_CXX=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_static_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_static_works_CXX" = xyes; then : else lt_prog_compiler_static_CXX= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_CXX" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' case $host_os in aix[4-9]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global defined # symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) export_symbols_cmds_CXX="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) case $cc_basename in cl*) exclude_expsyms_CXX='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname' ;; esac ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs_CXX=no ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no with_gnu_ld_CXX=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_CXX" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_CXX=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_CXX in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } if ${lt_cv_archive_cmds_need_lc_CXX+:} false; then : $as_echo_n "(cached) " >&6 else $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_CXX pic_flag=$lt_prog_compiler_pic_CXX compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_CXX allow_undefined_flag_CXX= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then lt_cv_archive_cmds_need_lc_CXX=no else lt_cv_archive_cmds_need_lc_CXX=yes fi allow_undefined_flag_CXX=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc_CXX" >&5 $as_echo "$lt_cv_archive_cmds_need_lc_CXX" >&6; } archive_cmds_need_lc_CXX=$lt_cv_archive_cmds_need_lc_CXX ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' library_names_spec='${libname}.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec="$LIB" if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[23].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=yes sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[3-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH if ${lt_cv_shlibpath_overrides_runpath+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl_CXX\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec_CXX\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : lt_cv_shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir fi shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action_CXX= if test -n "$hardcode_libdir_flag_spec_CXX" || test -n "$runpath_var_CXX" || test "X$hardcode_automatic_CXX" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct_CXX" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, CXX)" != no && test "$hardcode_minus_L_CXX" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_CXX=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_CXX=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_CXX=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX" >&5 $as_echo "$hardcode_action_CXX" >&6; } if test "$hardcode_action_CXX" = relink || test "$inherit_rpath_CXX" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi fi # test -n "$compiler" CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes 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=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu OPENMP_CXXFLAGS= # Check whether --enable-openmp was given. if test "${enable_openmp+set}" = set; then : enableval=$enable_openmp; fi if test "$enable_openmp" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CXX option to support OpenMP" >&5 $as_echo_n "checking for $CXX option to support OpenMP... " >&6; } if ${ac_cv_prog_cxx_openmp+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef _OPENMP choke me #endif #include int main () { return omp_get_num_threads (); } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : ac_cv_prog_cxx_openmp='none needed' else ac_cv_prog_cxx_openmp='unsupported' for ac_option in -fopenmp -xopenmp -openmp -mp -omp -qsmp=omp -homp \ -Popenmp --openmp; do ac_save_CXXFLAGS=$CXXFLAGS CXXFLAGS="$CXXFLAGS $ac_option" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef _OPENMP choke me #endif #include int main () { return omp_get_num_threads (); } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : ac_cv_prog_cxx_openmp=$ac_option fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext CXXFLAGS=$ac_save_CXXFLAGS if test "$ac_cv_prog_cxx_openmp" != unsupported; then break fi done fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_openmp" >&5 $as_echo "$ac_cv_prog_cxx_openmp" >&6; } case $ac_cv_prog_cxx_openmp in #( "none needed" | unsupported) ;; #( *) OPENMP_CXXFLAGS=$ac_cv_prog_cxx_openmp ;; esac fi CXXFLAGS="$CXXFLAGS $OPENMP_CFLAGS" if test "x$enable_native_optimizations" = "xyes"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -march=native" >&5 $as_echo_n "checking whether C++ compiler accepts -march=native... " >&6; } if ${ax_cv_check_cxxflags___march_native+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -march=native" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___march_native=yes else ax_cv_check_cxxflags___march_native=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___march_native" >&5 $as_echo "$ax_cv_check_cxxflags___march_native" >&6; } if test x"$ax_cv_check_cxxflags___march_native" = xyes; then : CXX="$CXX -march=native" else : fi else if test "x$GCC_CXX" = "xyes" -a "x`$CXX -dumpversion | cut -d. -f1,2`" = "x4.4"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fno-tree-fre" >&5 $as_echo_n "checking whether C++ compiler accepts -fno-tree-fre... " >&6; } if ${ax_cv_check_cxxflags___fno_tree_fre+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fno-tree-fre" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fno_tree_fre=yes else ax_cv_check_cxxflags___fno_tree_fre=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fno_tree_fre" >&5 $as_echo "$ax_cv_check_cxxflags___fno_tree_fre" >&6; } if test x"$ax_cv_check_cxxflags___fno_tree_fre" = xyes; then : CXXFLAGS="$CXXFLAGS -fno-tree-fre" else : fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fno-tree-vectorize" >&5 $as_echo_n "checking whether C++ compiler accepts -fno-tree-vectorize... " >&6; } if ${ax_cv_check_cxxflags___fno_tree_vectorize+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fno-tree-vectorize" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fno_tree_vectorize=yes else ax_cv_check_cxxflags___fno_tree_vectorize=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fno_tree_vectorize" >&5 $as_echo "$ax_cv_check_cxxflags___fno_tree_vectorize" >&6; } if test x"$ax_cv_check_cxxflags___fno_tree_vectorize" = xyes; then : CXXFLAGS="$CXXFLAGS -fno-tree-vectorize" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fno-math-errno" >&5 $as_echo_n "checking whether C++ compiler accepts -fno-math-errno... " >&6; } if ${ax_cv_check_cxxflags___fno_math_errno+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fno-math-errno" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fno_math_errno=yes else ax_cv_check_cxxflags___fno_math_errno=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fno_math_errno" >&5 $as_echo "$ax_cv_check_cxxflags___fno_math_errno" >&6; } if test x"$ax_cv_check_cxxflags___fno_math_errno" = xyes; then : CXXFLAGS="$CXXFLAGS -fno-math-errno" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -funsafe-math-optimizations" >&5 $as_echo_n "checking whether C++ compiler accepts -funsafe-math-optimizations... " >&6; } if ${ax_cv_check_cxxflags___funsafe_math_optimizations+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -funsafe-math-optimizations" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___funsafe_math_optimizations=yes else ax_cv_check_cxxflags___funsafe_math_optimizations=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___funsafe_math_optimizations" >&5 $as_echo "$ax_cv_check_cxxflags___funsafe_math_optimizations" >&6; } if test x"$ax_cv_check_cxxflags___funsafe_math_optimizations" = xyes; then : CXXFLAGS="$CXXFLAGS -funsafe-math-optimizations" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fno-trapping-math" >&5 $as_echo_n "checking whether C++ compiler accepts -fno-trapping-math... " >&6; } if ${ax_cv_check_cxxflags___fno_trapping_math+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fno-trapping-math" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fno_trapping_math=yes else ax_cv_check_cxxflags___fno_trapping_math=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fno_trapping_math" >&5 $as_echo "$ax_cv_check_cxxflags___fno_trapping_math" >&6; } if test x"$ax_cv_check_cxxflags___fno_trapping_math" = xyes; then : CXXFLAGS="$CXXFLAGS -fno-trapping-math" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fno-rounding-math" >&5 $as_echo_n "checking whether C++ compiler accepts -fno-rounding-math... " >&6; } if ${ax_cv_check_cxxflags___fno_rounding_math+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fno-rounding-math" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fno_rounding_math=yes else ax_cv_check_cxxflags___fno_rounding_math=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fno_rounding_math" >&5 $as_echo "$ax_cv_check_cxxflags___fno_rounding_math" >&6; } if test x"$ax_cv_check_cxxflags___fno_rounding_math" = xyes; then : CXXFLAGS="$CXXFLAGS -fno-rounding-math" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fno-signaling-nans" >&5 $as_echo_n "checking whether C++ compiler accepts -fno-signaling-nans... " >&6; } if ${ax_cv_check_cxxflags___fno_signaling_nans+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fno-signaling-nans" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fno_signaling_nans=yes else ax_cv_check_cxxflags___fno_signaling_nans=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fno_signaling_nans" >&5 $as_echo "$ax_cv_check_cxxflags___fno_signaling_nans" >&6; } if test x"$ax_cv_check_cxxflags___fno_signaling_nans" = xyes; then : CXXFLAGS="$CXXFLAGS -fno-signaling-nans" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fcx-limited-range" >&5 $as_echo_n "checking whether C++ compiler accepts -fcx-limited-range... " >&6; } if ${ax_cv_check_cxxflags___fcx_limited_range+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fcx-limited-range" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fcx_limited_range=yes else ax_cv_check_cxxflags___fcx_limited_range=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fcx_limited_range" >&5 $as_echo "$ax_cv_check_cxxflags___fcx_limited_range" >&6; } if test x"$ax_cv_check_cxxflags___fcx_limited_range" = xyes; then : CXXFLAGS="$CXXFLAGS -fcx-limited-range" else : fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether C++ compiler accepts -fomit-frame-pointer" >&5 $as_echo_n "checking whether C++ compiler accepts -fomit-frame-pointer... " >&6; } if ${ax_cv_check_cxxflags___fomit_frame_pointer+:} false; then : $as_echo_n "(cached) " >&6 else ax_check_save_flags=$CXXFLAGS CXXFLAGS="$CXXFLAGS -fomit-frame-pointer" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ax_cv_check_cxxflags___fomit_frame_pointer=yes else ax_cv_check_cxxflags___fomit_frame_pointer=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext CXXFLAGS=$ax_check_save_flags fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_cv_check_cxxflags___fomit_frame_pointer" >&5 $as_echo "$ax_cv_check_cxxflags___fomit_frame_pointer" >&6; } if test x"$ax_cv_check_cxxflags___fomit_frame_pointer" = xyes; then : CXXFLAGS="$CXXFLAGS -fomit-frame-pointer" else : 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 "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args. set dummy ${ac_tool_prefix}pkg-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_path_PKG_CONFIG+:} false; then : $as_echo_n "(cached) " >&6 else case $PKG_CONFIG in [\\/]* | ?:[\\/]*) ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path. ;; *) 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_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext" $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 ;; esac fi PKG_CONFIG=$ac_cv_path_PKG_CONFIG if test -n "$PKG_CONFIG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5 $as_echo "$PKG_CONFIG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_path_PKG_CONFIG"; then ac_pt_PKG_CONFIG=$PKG_CONFIG # Extract the first word of "pkg-config", so it can be a program name with args. set dummy pkg-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_path_ac_pt_PKG_CONFIG+:} false; then : $as_echo_n "(cached) " >&6 else case $ac_pt_PKG_CONFIG in [\\/]* | ?:[\\/]*) ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path. ;; *) 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_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext" $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 ;; esac fi ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG if test -n "$ac_pt_PKG_CONFIG"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5 $as_echo "$ac_pt_PKG_CONFIG" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_pt_PKG_CONFIG" = x; then PKG_CONFIG="" 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 PKG_CONFIG=$ac_pt_PKG_CONFIG fi else PKG_CONFIG="$ac_cv_path_PKG_CONFIG" fi fi if test -n "$PKG_CONFIG"; then _pkg_min_version=0.9.0 { $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5 $as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; } if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then { $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; } PKG_CONFIG="" fi fi pkg_failed=no { $as_echo "$as_me:${as_lineno-$LINENO}: checking for CFITSIO" >&5 $as_echo_n "checking for CFITSIO... " >&6; } if test -n "$CFITSIO_CFLAGS"; then pkg_cv_CFITSIO_CFLAGS="$CFITSIO_CFLAGS" elif test -n "$PKG_CONFIG"; then if test -n "$PKG_CONFIG" && \ { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"cfitsio\""; } >&5 ($PKG_CONFIG --exists --print-errors "cfitsio") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then pkg_cv_CFITSIO_CFLAGS=`$PKG_CONFIG --cflags "cfitsio" 2>/dev/null` test "x$?" != "x0" && pkg_failed=yes else pkg_failed=yes fi else pkg_failed=untried fi if test -n "$CFITSIO_LIBS"; then pkg_cv_CFITSIO_LIBS="$CFITSIO_LIBS" elif test -n "$PKG_CONFIG"; then if test -n "$PKG_CONFIG" && \ { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"cfitsio\""; } >&5 ($PKG_CONFIG --exists --print-errors "cfitsio") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then pkg_cv_CFITSIO_LIBS=`$PKG_CONFIG --libs "cfitsio" 2>/dev/null` test "x$?" != "x0" && pkg_failed=yes else pkg_failed=yes fi else pkg_failed=untried fi if test $pkg_failed = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then _pkg_short_errors_supported=yes else _pkg_short_errors_supported=no fi if test $_pkg_short_errors_supported = yes; then CFITSIO_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "cfitsio" 2>&1` else CFITSIO_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "cfitsio" 2>&1` fi # Put the nasty error message in config.log where it belongs echo "$CFITSIO_PKG_ERRORS" >&5 CFITSIO_LIBS=-lcfitsio elif test $pkg_failed = untried; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } CFITSIO_LIBS=-lcfitsio else CFITSIO_CFLAGS=$pkg_cv_CFITSIO_CFLAGS CFITSIO_LIBS=$pkg_cv_CFITSIO_LIBS { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi CFITSIO_LIBS="$CFITSIO_LIBS -lm" save_CFLAGS=$CFLAGS save_LIBS=$LIBS CFLAGS="$CFLAGS $CFITSIO_CFLAGS" LIBS="$LIBS $CFITSIO_LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ffgnrwll in -lcfitsio" >&5 $as_echo_n "checking for ffgnrwll in -lcfitsio... " >&6; } if ${ac_cv_lib_cfitsio_ffgnrwll+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lcfitsio $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 ffgnrwll (); int main () { return ffgnrwll (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_cfitsio_ffgnrwll=yes else ac_cv_lib_cfitsio_ffgnrwll=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_cfitsio_ffgnrwll" >&5 $as_echo "$ac_cv_lib_cfitsio_ffgnrwll" >&6; } if test "x$ac_cv_lib_cfitsio_ffgnrwll" = xyes; then : : else as_fn_error $? "could not find the cfitsio library" "$LINENO" 5 fi for ac_header in fitsio.h do : ac_fn_c_check_header_mongrel "$LINENO" "fitsio.h" "ac_cv_header_fitsio_h" "$ac_includes_default" if test "x$ac_cv_header_fitsio_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_FITSIO_H 1 _ACEOF : else as_fn_error $? "could not find the cfitsio header file" "$LINENO" 5 fi done CFLAGS=$save_CFLAGS LIBS=$save_LIBS # we need the expanded forms... test "x$prefix" = xNONE && prefix=$ac_default_prefix test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig libname" >&5 $as_echo_n "checking our pkgconfig libname... " >&6; } test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="${PACKAGE_NAME}" test ".$ax_create_pkgconfig_libname" != "." || \ ax_create_pkgconfig_libname="$PACKAGE" ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` ax_create_pkgconfig_libname=`eval echo "$ax_create_pkgconfig_libname"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libname" >&5 $as_echo "$ax_create_pkgconfig_libname" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig version" >&5 $as_echo_n "checking our pkgconfig version... " >&6; } test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="${PACKAGE_VERSION}" test ".$ax_create_pkgconfig_version" != "." || \ ax_create_pkgconfig_version="$VERSION" ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` ax_create_pkgconfig_version=`eval echo "$ax_create_pkgconfig_version"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_version" >&5 $as_echo "$ax_create_pkgconfig_version" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libdir" >&5 $as_echo_n "checking our pkgconfig_libdir... " >&6; } test ".$pkgconfig_libdir" = "." && \ pkgconfig_libdir='${libdir}/pkgconfig' ax_create_pkgconfig_libdir=`eval echo "$pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` ax_create_pkgconfig_libdir=`eval echo "$ax_create_pkgconfig_libdir"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libdir" >&5 $as_echo "$pkgconfig_libdir" >&6; } test "$pkgconfig_libdir" != "$ax_create_pkgconfig_libdir" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&5 $as_echo "expanded our pkgconfig_libdir... $ax_create_pkgconfig_libdir" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig_libfile" >&5 $as_echo_n "checking our pkgconfig_libfile... " >&6; } test ".$pkgconfig_libfile" != "." || \ pkgconfig_libfile="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_libfile=`eval echo "$pkgconfig_libfile"` ax_create_pkgconfig_libfile=`eval echo "$ax_create_pkgconfig_libfile"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $pkgconfig_libfile" >&5 $as_echo "$pkgconfig_libfile" >&6; } test "$pkgconfig_libfile" != "$ax_create_pkgconfig_libfile" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&5 $as_echo "expanded our pkgconfig_libfile... $ax_create_pkgconfig_libfile" >&6; }) { $as_echo "$as_me:${as_lineno-$LINENO}: checking our package / suffix" >&5 $as_echo_n "checking our package / suffix... " >&6; } ax_create_pkgconfig_suffix="$program_suffix" test ".$ax_create_pkgconfig_suffix" != .NONE || ax_create_pkgconfig_suffix="" { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&5 $as_echo "${PACKAGE_NAME} / ${ax_create_pkgconfig_suffix}" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig description" >&5 $as_echo_n "checking our pkgconfig description... " >&6; } ax_create_pkgconfig_description="$PACKAGE_SUMMARY" test ".$ax_create_pkgconfig_description" != "." || \ ax_create_pkgconfig_description="$ax_create_pkgconfig_libname Library" ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` ax_create_pkgconfig_description=`eval echo "$ax_create_pkgconfig_description"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_description" >&5 $as_echo "$ax_create_pkgconfig_description" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig requires" >&5 $as_echo_n "checking our pkgconfig requires... " >&6; } ax_create_pkgconfig_requires="$PACKAGE_REQUIRES" ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` ax_create_pkgconfig_requires=`eval echo "$ax_create_pkgconfig_requires"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_requires" >&5 $as_echo "$ax_create_pkgconfig_requires" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ext libs" >&5 $as_echo_n "checking our pkgconfig ext libs... " >&6; } ax_create_pkgconfig_pkglibs="$PACKAGE_LIBS" test ".$ax_create_pkgconfig_pkglibs" != "." || ax_create_pkgconfig_pkglibs="-l$ax_create_pkgconfig_libname" ax_create_pkgconfig_libs="$ax_create_pkgconfig_pkglibs $LIBS" ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` ax_create_pkgconfig_libs=`eval echo "$ax_create_pkgconfig_libs"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_libs" >&5 $as_echo "$ax_create_pkgconfig_libs" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig cppflags" >&5 $as_echo_n "checking our pkgconfig cppflags... " >&6; } ax_create_pkgconfig_cppflags="$OPENMP_CFLAGS $CFITSIO_CFLAGS" ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` ax_create_pkgconfig_cppflags=`eval echo "$ax_create_pkgconfig_cppflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_cppflags" >&5 $as_echo "$ax_create_pkgconfig_cppflags" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking our pkgconfig ldflags" >&5 $as_echo_n "checking our pkgconfig ldflags... " >&6; } ax_create_pkgconfig_ldflags="$PACKAGE_LDFLAGS" ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` ax_create_pkgconfig_ldflags=`eval echo "$ax_create_pkgconfig_ldflags"` { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ax_create_pkgconfig_ldflags" >&5 $as_echo "$ax_create_pkgconfig_ldflags" >&6; } test ".$ax_create_pkgconfig_generate" != "." || \ ax_create_pkgconfig_generate="$ax_create_pkgconfig_libname.pc" ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` ax_create_pkgconfig_generate=`eval echo "$ax_create_pkgconfig_generate"` test "$pkgconfig_libfile" != "$ax_create_pkgconfig_generate" && ( { $as_echo "$as_me:${as_lineno-$LINENO}: result: generate the pkgconfig later... $ax_create_pkgconfig_generate" >&5 $as_echo "generate the pkgconfig later... $ax_create_pkgconfig_generate" >&6; }) if test ".$ax_create_pkgconfig_src_libdir" = "." ; then ax_create_pkgconfig_src_libdir=`pwd` ax_create_pkgconfig_src_libdir=`$as_dirname -- "$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" || $as_expr X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_libdir/$ax_create_pkgconfig_generate" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_libdir/src || \ ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/src" case ".$objdir" in *libs) ax_create_pkgconfig_src_libdir="$ax_create_pkgconfig_src_libdir/$objdir" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&5 $as_echo "noninstalled pkgconfig -L $ax_create_pkgconfig_src_libdir" >&6; } fi if test ".$ax_create_pkgconfig_src_headers" = "." ; then ax_create_pkgconfig_src_headers=`pwd` v="$ac_top_srcdir" ; test ".$v" != "." || v="$ax_spec_dir" test ".$v" != "." || v="$srcdir" case "$v" in /*) ax_create_pkgconfig_src_headers="" ;; esac ax_create_pkgconfig_src_headers=`$as_dirname -- "$ax_create_pkgconfig_src_headers/$v/x" || $as_expr X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)[^/]' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(//\)$' \| \ X"$ax_create_pkgconfig_src_headers/$v/x" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ax_create_pkgconfig_src_headers/$v/x" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test ! -d $ax_create_pkgconfig_src_headers/include || \ ax_create_pkgconfig_src_headers="$ax_create_pkgconfig_src_headers/include" { $as_echo "$as_me:${as_lineno-$LINENO}: result: noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&5 $as_echo "noninstalled pkgconfig -I $ax_create_pkgconfig_src_headers" >&6; } fi ac_config_commands="$ac_config_commands $ax_create_pkgconfig_generate" 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 { $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5 $as_echo_n "checking that generated files are newer than configure... " >&6; } if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5 $as_echo "done" >&6; } if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${MAINTAINER_MODE_TRUE}" && test -z "${MAINTAINER_MODE_FALSE}"; then as_fn_error $? "conditional \"MAINTAINER_MODE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error $? "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : "${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 healpix_cxx $as_me 3.11.2, 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" config_commands="$ac_config_commands" _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 Configuration commands: $config_commands 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="\\ healpix_cxx config.status 3.11.2 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' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' 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 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' macro_version='`$ECHO "$macro_version" | $SED "$delay_single_quote_subst"`' macro_revision='`$ECHO "$macro_revision" | $SED "$delay_single_quote_subst"`' enable_shared='`$ECHO "$enable_shared" | $SED "$delay_single_quote_subst"`' enable_static='`$ECHO "$enable_static" | $SED "$delay_single_quote_subst"`' pic_mode='`$ECHO "$pic_mode" | $SED "$delay_single_quote_subst"`' enable_fast_install='`$ECHO "$enable_fast_install" | $SED "$delay_single_quote_subst"`' SHELL='`$ECHO "$SHELL" | $SED "$delay_single_quote_subst"`' ECHO='`$ECHO "$ECHO" | $SED "$delay_single_quote_subst"`' PATH_SEPARATOR='`$ECHO "$PATH_SEPARATOR" | $SED "$delay_single_quote_subst"`' host_alias='`$ECHO "$host_alias" | $SED "$delay_single_quote_subst"`' host='`$ECHO "$host" | $SED "$delay_single_quote_subst"`' host_os='`$ECHO "$host_os" | $SED "$delay_single_quote_subst"`' build_alias='`$ECHO "$build_alias" | $SED "$delay_single_quote_subst"`' build='`$ECHO "$build" | $SED "$delay_single_quote_subst"`' build_os='`$ECHO "$build_os" | $SED "$delay_single_quote_subst"`' SED='`$ECHO "$SED" | $SED "$delay_single_quote_subst"`' Xsed='`$ECHO "$Xsed" | $SED "$delay_single_quote_subst"`' GREP='`$ECHO "$GREP" | $SED "$delay_single_quote_subst"`' EGREP='`$ECHO "$EGREP" | $SED "$delay_single_quote_subst"`' FGREP='`$ECHO "$FGREP" | $SED "$delay_single_quote_subst"`' LD='`$ECHO "$LD" | $SED "$delay_single_quote_subst"`' NM='`$ECHO "$NM" | $SED "$delay_single_quote_subst"`' LN_S='`$ECHO "$LN_S" | $SED "$delay_single_quote_subst"`' max_cmd_len='`$ECHO "$max_cmd_len" | $SED "$delay_single_quote_subst"`' ac_objext='`$ECHO "$ac_objext" | $SED "$delay_single_quote_subst"`' exeext='`$ECHO "$exeext" | $SED "$delay_single_quote_subst"`' lt_unset='`$ECHO "$lt_unset" | $SED "$delay_single_quote_subst"`' lt_SP2NL='`$ECHO "$lt_SP2NL" | $SED "$delay_single_quote_subst"`' lt_NL2SP='`$ECHO "$lt_NL2SP" | $SED "$delay_single_quote_subst"`' lt_cv_to_host_file_cmd='`$ECHO "$lt_cv_to_host_file_cmd" | $SED "$delay_single_quote_subst"`' lt_cv_to_tool_file_cmd='`$ECHO "$lt_cv_to_tool_file_cmd" | $SED "$delay_single_quote_subst"`' reload_flag='`$ECHO "$reload_flag" | $SED "$delay_single_quote_subst"`' reload_cmds='`$ECHO "$reload_cmds" | $SED "$delay_single_quote_subst"`' OBJDUMP='`$ECHO "$OBJDUMP" | $SED "$delay_single_quote_subst"`' deplibs_check_method='`$ECHO "$deplibs_check_method" | $SED "$delay_single_quote_subst"`' file_magic_cmd='`$ECHO "$file_magic_cmd" | $SED "$delay_single_quote_subst"`' file_magic_glob='`$ECHO "$file_magic_glob" | $SED "$delay_single_quote_subst"`' want_nocaseglob='`$ECHO "$want_nocaseglob" | $SED "$delay_single_quote_subst"`' DLLTOOL='`$ECHO "$DLLTOOL" | $SED "$delay_single_quote_subst"`' sharedlib_from_linklib_cmd='`$ECHO "$sharedlib_from_linklib_cmd" | $SED "$delay_single_quote_subst"`' AR='`$ECHO "$AR" | $SED "$delay_single_quote_subst"`' AR_FLAGS='`$ECHO "$AR_FLAGS" | $SED "$delay_single_quote_subst"`' archiver_list_spec='`$ECHO "$archiver_list_spec" | $SED "$delay_single_quote_subst"`' STRIP='`$ECHO "$STRIP" | $SED "$delay_single_quote_subst"`' RANLIB='`$ECHO "$RANLIB" | $SED "$delay_single_quote_subst"`' old_postinstall_cmds='`$ECHO "$old_postinstall_cmds" | $SED "$delay_single_quote_subst"`' old_postuninstall_cmds='`$ECHO "$old_postuninstall_cmds" | $SED "$delay_single_quote_subst"`' old_archive_cmds='`$ECHO "$old_archive_cmds" | $SED "$delay_single_quote_subst"`' lock_old_archive_extraction='`$ECHO "$lock_old_archive_extraction" | $SED "$delay_single_quote_subst"`' CC='`$ECHO "$CC" | $SED "$delay_single_quote_subst"`' CFLAGS='`$ECHO "$CFLAGS" | $SED "$delay_single_quote_subst"`' compiler='`$ECHO "$compiler" | $SED "$delay_single_quote_subst"`' GCC='`$ECHO "$GCC" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_pipe='`$ECHO "$lt_cv_sys_global_symbol_pipe" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_cdecl='`$ECHO "$lt_cv_sys_global_symbol_to_cdecl" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $SED "$delay_single_quote_subst"`' nm_file_list_spec='`$ECHO "$nm_file_list_spec" | $SED "$delay_single_quote_subst"`' lt_sysroot='`$ECHO "$lt_sysroot" | $SED "$delay_single_quote_subst"`' objdir='`$ECHO "$objdir" | $SED "$delay_single_quote_subst"`' MAGIC_CMD='`$ECHO "$MAGIC_CMD" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag='`$ECHO "$lt_prog_compiler_no_builtin_flag" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_pic='`$ECHO "$lt_prog_compiler_pic" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_wl='`$ECHO "$lt_prog_compiler_wl" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_static='`$ECHO "$lt_prog_compiler_static" | $SED "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o='`$ECHO "$lt_cv_prog_compiler_c_o" | $SED "$delay_single_quote_subst"`' need_locks='`$ECHO "$need_locks" | $SED "$delay_single_quote_subst"`' MANIFEST_TOOL='`$ECHO "$MANIFEST_TOOL" | $SED "$delay_single_quote_subst"`' DSYMUTIL='`$ECHO "$DSYMUTIL" | $SED "$delay_single_quote_subst"`' NMEDIT='`$ECHO "$NMEDIT" | $SED "$delay_single_quote_subst"`' LIPO='`$ECHO "$LIPO" | $SED "$delay_single_quote_subst"`' OTOOL='`$ECHO "$OTOOL" | $SED "$delay_single_quote_subst"`' OTOOL64='`$ECHO "$OTOOL64" | $SED "$delay_single_quote_subst"`' libext='`$ECHO "$libext" | $SED "$delay_single_quote_subst"`' shrext_cmds='`$ECHO "$shrext_cmds" | $SED "$delay_single_quote_subst"`' extract_expsyms_cmds='`$ECHO "$extract_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds_need_lc='`$ECHO "$archive_cmds_need_lc" | $SED "$delay_single_quote_subst"`' enable_shared_with_static_runtimes='`$ECHO "$enable_shared_with_static_runtimes" | $SED "$delay_single_quote_subst"`' export_dynamic_flag_spec='`$ECHO "$export_dynamic_flag_spec" | $SED "$delay_single_quote_subst"`' whole_archive_flag_spec='`$ECHO "$whole_archive_flag_spec" | $SED "$delay_single_quote_subst"`' compiler_needs_object='`$ECHO "$compiler_needs_object" | $SED "$delay_single_quote_subst"`' old_archive_from_new_cmds='`$ECHO "$old_archive_from_new_cmds" | $SED "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds='`$ECHO "$old_archive_from_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds='`$ECHO "$archive_cmds" | $SED "$delay_single_quote_subst"`' archive_expsym_cmds='`$ECHO "$archive_expsym_cmds" | $SED "$delay_single_quote_subst"`' module_cmds='`$ECHO "$module_cmds" | $SED "$delay_single_quote_subst"`' module_expsym_cmds='`$ECHO "$module_expsym_cmds" | $SED "$delay_single_quote_subst"`' with_gnu_ld='`$ECHO "$with_gnu_ld" | $SED "$delay_single_quote_subst"`' allow_undefined_flag='`$ECHO "$allow_undefined_flag" | $SED "$delay_single_quote_subst"`' no_undefined_flag='`$ECHO "$no_undefined_flag" | $SED "$delay_single_quote_subst"`' hardcode_libdir_flag_spec='`$ECHO "$hardcode_libdir_flag_spec" | $SED "$delay_single_quote_subst"`' hardcode_libdir_separator='`$ECHO "$hardcode_libdir_separator" | $SED "$delay_single_quote_subst"`' hardcode_direct='`$ECHO "$hardcode_direct" | $SED "$delay_single_quote_subst"`' hardcode_direct_absolute='`$ECHO "$hardcode_direct_absolute" | $SED "$delay_single_quote_subst"`' hardcode_minus_L='`$ECHO "$hardcode_minus_L" | $SED "$delay_single_quote_subst"`' hardcode_shlibpath_var='`$ECHO "$hardcode_shlibpath_var" | $SED "$delay_single_quote_subst"`' hardcode_automatic='`$ECHO "$hardcode_automatic" | $SED "$delay_single_quote_subst"`' inherit_rpath='`$ECHO "$inherit_rpath" | $SED "$delay_single_quote_subst"`' link_all_deplibs='`$ECHO "$link_all_deplibs" | $SED "$delay_single_quote_subst"`' always_export_symbols='`$ECHO "$always_export_symbols" | $SED "$delay_single_quote_subst"`' export_symbols_cmds='`$ECHO "$export_symbols_cmds" | $SED "$delay_single_quote_subst"`' exclude_expsyms='`$ECHO "$exclude_expsyms" | $SED "$delay_single_quote_subst"`' include_expsyms='`$ECHO "$include_expsyms" | $SED "$delay_single_quote_subst"`' prelink_cmds='`$ECHO "$prelink_cmds" | $SED "$delay_single_quote_subst"`' postlink_cmds='`$ECHO "$postlink_cmds" | $SED "$delay_single_quote_subst"`' file_list_spec='`$ECHO "$file_list_spec" | $SED "$delay_single_quote_subst"`' variables_saved_for_relink='`$ECHO "$variables_saved_for_relink" | $SED "$delay_single_quote_subst"`' need_lib_prefix='`$ECHO "$need_lib_prefix" | $SED "$delay_single_quote_subst"`' need_version='`$ECHO "$need_version" | $SED "$delay_single_quote_subst"`' version_type='`$ECHO "$version_type" | $SED "$delay_single_quote_subst"`' runpath_var='`$ECHO "$runpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_var='`$ECHO "$shlibpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_overrides_runpath='`$ECHO "$shlibpath_overrides_runpath" | $SED "$delay_single_quote_subst"`' libname_spec='`$ECHO "$libname_spec" | $SED "$delay_single_quote_subst"`' library_names_spec='`$ECHO "$library_names_spec" | $SED "$delay_single_quote_subst"`' soname_spec='`$ECHO "$soname_spec" | $SED "$delay_single_quote_subst"`' install_override_mode='`$ECHO "$install_override_mode" | $SED "$delay_single_quote_subst"`' postinstall_cmds='`$ECHO "$postinstall_cmds" | $SED "$delay_single_quote_subst"`' postuninstall_cmds='`$ECHO "$postuninstall_cmds" | $SED "$delay_single_quote_subst"`' finish_cmds='`$ECHO "$finish_cmds" | $SED "$delay_single_quote_subst"`' finish_eval='`$ECHO "$finish_eval" | $SED "$delay_single_quote_subst"`' hardcode_into_libs='`$ECHO "$hardcode_into_libs" | $SED "$delay_single_quote_subst"`' sys_lib_search_path_spec='`$ECHO "$sys_lib_search_path_spec" | $SED "$delay_single_quote_subst"`' sys_lib_dlsearch_path_spec='`$ECHO "$sys_lib_dlsearch_path_spec" | $SED "$delay_single_quote_subst"`' hardcode_action='`$ECHO "$hardcode_action" | $SED "$delay_single_quote_subst"`' enable_dlopen='`$ECHO "$enable_dlopen" | $SED "$delay_single_quote_subst"`' enable_dlopen_self='`$ECHO "$enable_dlopen_self" | $SED "$delay_single_quote_subst"`' enable_dlopen_self_static='`$ECHO "$enable_dlopen_self_static" | $SED "$delay_single_quote_subst"`' old_striplib='`$ECHO "$old_striplib" | $SED "$delay_single_quote_subst"`' striplib='`$ECHO "$striplib" | $SED "$delay_single_quote_subst"`' compiler_lib_search_dirs='`$ECHO "$compiler_lib_search_dirs" | $SED "$delay_single_quote_subst"`' predep_objects='`$ECHO "$predep_objects" | $SED "$delay_single_quote_subst"`' postdep_objects='`$ECHO "$postdep_objects" | $SED "$delay_single_quote_subst"`' predeps='`$ECHO "$predeps" | $SED "$delay_single_quote_subst"`' postdeps='`$ECHO "$postdeps" | $SED "$delay_single_quote_subst"`' compiler_lib_search_path='`$ECHO "$compiler_lib_search_path" | $SED "$delay_single_quote_subst"`' LD_CXX='`$ECHO "$LD_CXX" | $SED "$delay_single_quote_subst"`' reload_flag_CXX='`$ECHO "$reload_flag_CXX" | $SED "$delay_single_quote_subst"`' reload_cmds_CXX='`$ECHO "$reload_cmds_CXX" | $SED "$delay_single_quote_subst"`' old_archive_cmds_CXX='`$ECHO "$old_archive_cmds_CXX" | $SED "$delay_single_quote_subst"`' compiler_CXX='`$ECHO "$compiler_CXX" | $SED "$delay_single_quote_subst"`' GCC_CXX='`$ECHO "$GCC_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag_CXX='`$ECHO "$lt_prog_compiler_no_builtin_flag_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_pic_CXX='`$ECHO "$lt_prog_compiler_pic_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_wl_CXX='`$ECHO "$lt_prog_compiler_wl_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_static_CXX='`$ECHO "$lt_prog_compiler_static_CXX" | $SED "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o_CXX='`$ECHO "$lt_cv_prog_compiler_c_o_CXX" | $SED "$delay_single_quote_subst"`' archive_cmds_need_lc_CXX='`$ECHO "$archive_cmds_need_lc_CXX" | $SED "$delay_single_quote_subst"`' enable_shared_with_static_runtimes_CXX='`$ECHO "$enable_shared_with_static_runtimes_CXX" | $SED "$delay_single_quote_subst"`' export_dynamic_flag_spec_CXX='`$ECHO "$export_dynamic_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' whole_archive_flag_spec_CXX='`$ECHO "$whole_archive_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' compiler_needs_object_CXX='`$ECHO "$compiler_needs_object_CXX" | $SED "$delay_single_quote_subst"`' old_archive_from_new_cmds_CXX='`$ECHO "$old_archive_from_new_cmds_CXX" | $SED "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds_CXX='`$ECHO "$old_archive_from_expsyms_cmds_CXX" | $SED "$delay_single_quote_subst"`' archive_cmds_CXX='`$ECHO "$archive_cmds_CXX" | $SED "$delay_single_quote_subst"`' archive_expsym_cmds_CXX='`$ECHO "$archive_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`' module_cmds_CXX='`$ECHO "$module_cmds_CXX" | $SED "$delay_single_quote_subst"`' module_expsym_cmds_CXX='`$ECHO "$module_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`' with_gnu_ld_CXX='`$ECHO "$with_gnu_ld_CXX" | $SED "$delay_single_quote_subst"`' allow_undefined_flag_CXX='`$ECHO "$allow_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`' no_undefined_flag_CXX='`$ECHO "$no_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_CXX='`$ECHO "$hardcode_libdir_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' hardcode_libdir_separator_CXX='`$ECHO "$hardcode_libdir_separator_CXX" | $SED "$delay_single_quote_subst"`' hardcode_direct_CXX='`$ECHO "$hardcode_direct_CXX" | $SED "$delay_single_quote_subst"`' hardcode_direct_absolute_CXX='`$ECHO "$hardcode_direct_absolute_CXX" | $SED "$delay_single_quote_subst"`' hardcode_minus_L_CXX='`$ECHO "$hardcode_minus_L_CXX" | $SED "$delay_single_quote_subst"`' hardcode_shlibpath_var_CXX='`$ECHO "$hardcode_shlibpath_var_CXX" | $SED "$delay_single_quote_subst"`' hardcode_automatic_CXX='`$ECHO "$hardcode_automatic_CXX" | $SED "$delay_single_quote_subst"`' inherit_rpath_CXX='`$ECHO "$inherit_rpath_CXX" | $SED "$delay_single_quote_subst"`' link_all_deplibs_CXX='`$ECHO "$link_all_deplibs_CXX" | $SED "$delay_single_quote_subst"`' always_export_symbols_CXX='`$ECHO "$always_export_symbols_CXX" | $SED "$delay_single_quote_subst"`' export_symbols_cmds_CXX='`$ECHO "$export_symbols_cmds_CXX" | $SED "$delay_single_quote_subst"`' exclude_expsyms_CXX='`$ECHO "$exclude_expsyms_CXX" | $SED "$delay_single_quote_subst"`' include_expsyms_CXX='`$ECHO "$include_expsyms_CXX" | $SED "$delay_single_quote_subst"`' prelink_cmds_CXX='`$ECHO "$prelink_cmds_CXX" | $SED "$delay_single_quote_subst"`' postlink_cmds_CXX='`$ECHO "$postlink_cmds_CXX" | $SED "$delay_single_quote_subst"`' file_list_spec_CXX='`$ECHO "$file_list_spec_CXX" | $SED "$delay_single_quote_subst"`' hardcode_action_CXX='`$ECHO "$hardcode_action_CXX" | $SED "$delay_single_quote_subst"`' compiler_lib_search_dirs_CXX='`$ECHO "$compiler_lib_search_dirs_CXX" | $SED "$delay_single_quote_subst"`' predep_objects_CXX='`$ECHO "$predep_objects_CXX" | $SED "$delay_single_quote_subst"`' postdep_objects_CXX='`$ECHO "$postdep_objects_CXX" | $SED "$delay_single_quote_subst"`' predeps_CXX='`$ECHO "$predeps_CXX" | $SED "$delay_single_quote_subst"`' postdeps_CXX='`$ECHO "$postdeps_CXX" | $SED "$delay_single_quote_subst"`' compiler_lib_search_path_CXX='`$ECHO "$compiler_lib_search_path_CXX" | $SED "$delay_single_quote_subst"`' LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } # Quote evaled strings. for var in SHELL \ ECHO \ PATH_SEPARATOR \ SED \ GREP \ EGREP \ FGREP \ LD \ NM \ LN_S \ lt_SP2NL \ lt_NL2SP \ reload_flag \ OBJDUMP \ deplibs_check_method \ file_magic_cmd \ file_magic_glob \ want_nocaseglob \ DLLTOOL \ sharedlib_from_linklib_cmd \ AR \ AR_FLAGS \ archiver_list_spec \ STRIP \ RANLIB \ CC \ CFLAGS \ compiler \ lt_cv_sys_global_symbol_pipe \ lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ nm_file_list_spec \ lt_prog_compiler_no_builtin_flag \ lt_prog_compiler_pic \ lt_prog_compiler_wl \ lt_prog_compiler_static \ lt_cv_prog_compiler_c_o \ need_locks \ MANIFEST_TOOL \ DSYMUTIL \ NMEDIT \ LIPO \ OTOOL \ OTOOL64 \ shrext_cmds \ export_dynamic_flag_spec \ whole_archive_flag_spec \ compiler_needs_object \ with_gnu_ld \ allow_undefined_flag \ no_undefined_flag \ hardcode_libdir_flag_spec \ hardcode_libdir_separator \ exclude_expsyms \ include_expsyms \ file_list_spec \ variables_saved_for_relink \ libname_spec \ library_names_spec \ soname_spec \ install_override_mode \ finish_eval \ old_striplib \ striplib \ compiler_lib_search_dirs \ predep_objects \ postdep_objects \ predeps \ postdeps \ compiler_lib_search_path \ LD_CXX \ reload_flag_CXX \ compiler_CXX \ lt_prog_compiler_no_builtin_flag_CXX \ lt_prog_compiler_pic_CXX \ lt_prog_compiler_wl_CXX \ lt_prog_compiler_static_CXX \ lt_cv_prog_compiler_c_o_CXX \ export_dynamic_flag_spec_CXX \ whole_archive_flag_spec_CXX \ compiler_needs_object_CXX \ with_gnu_ld_CXX \ allow_undefined_flag_CXX \ no_undefined_flag_CXX \ hardcode_libdir_flag_spec_CXX \ hardcode_libdir_separator_CXX \ exclude_expsyms_CXX \ include_expsyms_CXX \ file_list_spec_CXX \ compiler_lib_search_dirs_CXX \ predep_objects_CXX \ postdep_objects_CXX \ predeps_CXX \ postdeps_CXX \ compiler_lib_search_path_CXX; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in reload_cmds \ old_postinstall_cmds \ old_postuninstall_cmds \ old_archive_cmds \ extract_expsyms_cmds \ old_archive_from_new_cmds \ old_archive_from_expsyms_cmds \ archive_cmds \ archive_expsym_cmds \ module_cmds \ module_expsym_cmds \ export_symbols_cmds \ prelink_cmds \ postlink_cmds \ postinstall_cmds \ postuninstall_cmds \ finish_cmds \ sys_lib_search_path_spec \ sys_lib_dlsearch_path_spec \ reload_cmds_CXX \ old_archive_cmds_CXX \ old_archive_from_new_cmds_CXX \ old_archive_from_expsyms_cmds_CXX \ archive_cmds_CXX \ archive_expsym_cmds_CXX \ module_cmds_CXX \ module_expsym_cmds_CXX \ export_symbols_cmds_CXX \ prelink_cmds_CXX \ postlink_cmds_CXX; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile' ax_create_pkgconfig_generate="$ax_create_pkgconfig_generate" pkgconfig_prefix='$prefix' pkgconfig_execprefix='$exec_prefix' pkgconfig_bindir='$bindir' pkgconfig_libdir='$libdir' pkgconfig_includedir='$includedir' pkgconfig_datarootdir='$datarootdir' pkgconfig_datadir='$datadir' pkgconfig_sysconfdir='$sysconfdir' pkgconfig_suffix='$ax_create_pkgconfig_suffix' pkgconfig_package='$PACKAGE_NAME' pkgconfig_libname='$ax_create_pkgconfig_libname' pkgconfig_description='$ax_create_pkgconfig_description' pkgconfig_version='$ax_create_pkgconfig_version' pkgconfig_requires='$ax_create_pkgconfig_requires' pkgconfig_libs='$ax_create_pkgconfig_libs' pkgconfig_ldflags='$ax_create_pkgconfig_ldflags' pkgconfig_cppflags='$ax_create_pkgconfig_cppflags' pkgconfig_src_libdir='$ax_create_pkgconfig_src_libdir' pkgconfig_src_headers='$ax_create_pkgconfig_src_headers' _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 "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;; "$ax_create_pkgconfig_generate") CONFIG_COMMANDS="$CONFIG_COMMANDS $ax_create_pkgconfig_generate" ;; "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 test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands 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 :C $CONFIG_COMMANDS" 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 # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _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 s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;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 ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Older Autoconf quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named 'Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running 'make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "$am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; "libtool":C) # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # The names of the tagged configurations supported by this script. available_tags="CXX " # ### BEGIN LIBTOOL CONFIG # Which release of libtool.m4 was used? macro_version=$macro_version macro_revision=$macro_revision # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # What type of objects to build. pic_mode=$pic_mode # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # An echo program that protects backslashes. ECHO=$lt_ECHO # The PATH separator for the build system. PATH_SEPARATOR=$lt_PATH_SEPARATOR # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="\$SED -e 1s/^X//" # A grep program that handles long lines. GREP=$lt_GREP # An ERE matcher. EGREP=$lt_EGREP # A literal string matcher. FGREP=$lt_FGREP # A BSD- or MS-compatible name lister. NM=$lt_NM # Whether we need soft or hard links. LN_S=$lt_LN_S # What is the maximum length of a command? max_cmd_len=$max_cmd_len # Object file suffix (normally "o"). objext=$ac_objext # Executable file suffix (normally ""). exeext=$exeext # whether the shell understands "unset". lt_unset=$lt_unset # turn spaces into newlines. SP2NL=$lt_lt_SP2NL # turn newlines into spaces. NL2SP=$lt_lt_NL2SP # convert \$build file names to \$host format. to_host_file_cmd=$lt_cv_to_host_file_cmd # convert \$build files to toolchain format. to_tool_file_cmd=$lt_cv_to_tool_file_cmd # An object symbol dumper. OBJDUMP=$lt_OBJDUMP # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method = "file_magic". file_magic_cmd=$lt_file_magic_cmd # How to find potential files when deplibs_check_method = "file_magic". file_magic_glob=$lt_file_magic_glob # Find potential files using nocaseglob when deplibs_check_method = "file_magic". want_nocaseglob=$lt_want_nocaseglob # DLL creation program. DLLTOOL=$lt_DLLTOOL # Command to associate shared and link libraries. sharedlib_from_linklib_cmd=$lt_sharedlib_from_linklib_cmd # The archiver. AR=$lt_AR # Flags to create an archive. AR_FLAGS=$lt_AR_FLAGS # How to feed a file listing to the archiver. archiver_list_spec=$lt_archiver_list_spec # A symbol stripping program. STRIP=$lt_STRIP # Commands used to install an old-style archive. RANLIB=$lt_RANLIB old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Whether to use a lock for old archive extraction. lock_old_archive_extraction=$lock_old_archive_extraction # A C compiler. LTCC=$lt_CC # LTCC compiler flags. LTCFLAGS=$lt_CFLAGS # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration. global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair. global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # Transform the output of nm in a C name address pair when lib prefix is needed. global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix # Specify filename containing input files for \$NM. nm_file_list_spec=$lt_nm_file_list_spec # The root where to search for dependent libraries,and in which our libraries should be installed. lt_sysroot=$lt_sysroot # The name of the directory that contains temporary libtool files. objdir=$objdir # Used to examine libraries when file_magic_cmd begins with "file". MAGIC_CMD=$MAGIC_CMD # Must we lock files when doing compilation? need_locks=$lt_need_locks # Manifest tool. MANIFEST_TOOL=$lt_MANIFEST_TOOL # Tool to manipulate archived DWARF debug symbol files on Mac OS X. DSYMUTIL=$lt_DSYMUTIL # Tool to change global to local symbols on Mac OS X. NMEDIT=$lt_NMEDIT # Tool to manipulate fat objects and archives on Mac OS X. LIPO=$lt_LIPO # ldd/readelf like tool for Mach-O binaries on Mac OS X. OTOOL=$lt_OTOOL # ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4. OTOOL64=$lt_OTOOL64 # Old archive suffix (normally "a"). libext=$libext # Shared library suffix (normally ".so"). shrext_cmds=$lt_shrext_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Variables whose values should be saved in libtool wrapper scripts and # restored at link time. variables_saved_for_relink=$lt_variables_saved_for_relink # Do we need the "lib" prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Library versioning type. version_type=$version_type # Shared library runtime path variable. runpath_var=$runpath_var # Shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Permission mode override for installation of shared libraries. install_override_mode=$lt_install_override_mode # Command to use after installation of a shared archive. postinstall_cmds=$lt_postinstall_cmds # Command to use after uninstallation of a shared archive. postuninstall_cmds=$lt_postuninstall_cmds # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # As "finish_cmds", except a single script fragment to be evaled but # not shown. finish_eval=$lt_finish_eval # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Compile-time system search path for libraries. sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries. sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # The linker used to build libraries. LD=$lt_LD # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds # A language specific compiler. CC=$lt_compiler # Is the compiler the GNU compiler? with_gcc=$GCC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds # Commands necessary for finishing linking programs. postlink_cmds=$lt_postlink_cmds # Specify filename containing input files. file_list_spec=$lt_file_list_spec # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects postdep_objects=$lt_postdep_objects predeps=$lt_predeps postdeps=$lt_postdeps # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac ltmain="$ac_aux_dir/ltmain.sh" # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) if test x"$xsi_shell" = xyes; then sed -e '/^func_dirname ()$/,/^} # func_dirname /c\ func_dirname ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ } # Extended-shell func_dirname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_basename ()$/,/^} # func_basename /c\ func_basename ()\ {\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_dirname_and_basename ()$/,/^} # func_dirname_and_basename /c\ func_dirname_and_basename ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_dirname_and_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_stripname ()$/,/^} # func_stripname /c\ func_stripname ()\ {\ \ # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\ \ # positional parameters, so assign one to ordinary parameter first.\ \ func_stripname_result=${3}\ \ func_stripname_result=${func_stripname_result#"${1}"}\ \ func_stripname_result=${func_stripname_result%"${2}"}\ } # Extended-shell func_stripname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_long_opt ()$/,/^} # func_split_long_opt /c\ func_split_long_opt ()\ {\ \ func_split_long_opt_name=${1%%=*}\ \ func_split_long_opt_arg=${1#*=}\ } # Extended-shell func_split_long_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_short_opt ()$/,/^} # func_split_short_opt /c\ func_split_short_opt ()\ {\ \ func_split_short_opt_arg=${1#??}\ \ func_split_short_opt_name=${1%"$func_split_short_opt_arg"}\ } # Extended-shell func_split_short_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_lo2o ()$/,/^} # func_lo2o /c\ func_lo2o ()\ {\ \ case ${1} in\ \ *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\ \ *) func_lo2o_result=${1} ;;\ \ esac\ } # Extended-shell func_lo2o implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_xform ()$/,/^} # func_xform /c\ func_xform ()\ {\ func_xform_result=${1%.*}.lo\ } # Extended-shell func_xform implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_arith ()$/,/^} # func_arith /c\ func_arith ()\ {\ func_arith_result=$(( $* ))\ } # Extended-shell func_arith implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_len ()$/,/^} # func_len /c\ func_len ()\ {\ func_len_result=${#1}\ } # Extended-shell func_len implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$lt_shell_append" = xyes; then sed -e '/^func_append ()$/,/^} # func_append /c\ func_append ()\ {\ eval "${1}+=\\${2}"\ } # Extended-shell func_append implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_append_quoted ()$/,/^} # func_append_quoted /c\ func_append_quoted ()\ {\ \ func_quote_for_eval "${2}"\ \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"\ } # Extended-shell func_append_quoted implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Unable to substitute extended shell functions in $ofile" >&5 $as_echo "$as_me: WARNING: Unable to substitute extended shell functions in $ofile" >&2;} fi mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" cat <<_LT_EOF >> "$ofile" # ### BEGIN LIBTOOL TAG CONFIG: CXX # The linker used to build libraries. LD=$lt_LD_CXX # How to create reloadable object files. reload_flag=$lt_reload_flag_CXX reload_cmds=$lt_reload_cmds_CXX # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds_CXX # A language specific compiler. CC=$lt_compiler_CXX # Is the compiler the GNU compiler? with_gcc=$GCC_CXX # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_CXX # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_CXX # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_CXX # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_CXX # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object_CXX # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds_CXX archive_expsym_cmds=$lt_archive_expsym_cmds_CXX # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds_CXX module_expsym_cmds=$lt_module_expsym_cmds_CXX # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld_CXX # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_CXX # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_CXX # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute_CXX # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L_CXX # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_CXX # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic_CXX # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath_CXX # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_CXX # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols_CXX # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_CXX # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_CXX # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_CXX # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds_CXX # Commands necessary for finishing linking programs. postlink_cmds=$lt_postlink_cmds_CXX # Specify filename containing input files. file_list_spec=$lt_file_list_spec_CXX # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_CXX # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects_CXX postdep_objects=$lt_postdep_objects_CXX predeps=$lt_predeps_CXX postdeps=$lt_postdeps_CXX # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_CXX # ### END LIBTOOL TAG CONFIG: CXX _LT_EOF ;; "$ax_create_pkgconfig_generate":C) pkgconfig_generate="$ax_create_pkgconfig_generate" if test ! -f "$pkgconfig_generate.in" then generate="true" elif grep ' generated by configure ' $pkgconfig_generate.in >/dev/null then generate="true" else generate="false"; fi if $generate ; then { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_generate.in" >&5 $as_echo "$as_me: creating $pkgconfig_generate.in" >&6;} cat > $pkgconfig_generate.in <&5 $as_echo "$as_me: creating $pkgconfig_generate" >&6;} cat >conftest.sed < $pkgconfig_generate if test ! -s $pkgconfig_generate ; then as_fn_error $? "$pkgconfig_generate is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_generate pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.pc/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed < $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error $? "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled pkgconfig_requires_add=`echo ${pkgconfig_requires}` if test ".$pkgconfig_requires_add" != "." ; then pkgconfig_requires_add="pkg-config $pkgconfig_requires_add" else pkgconfig_requires_add=":" ; fi pkgconfig_uninstalled=`echo $pkgconfig_generate |sed 's/.pc$/-uninstalled.sh/'` { $as_echo "$as_me:${as_lineno-$LINENO}: creating $pkgconfig_uninstalled" >&5 $as_echo "$as_me: creating $pkgconfig_uninstalled" >&6;} cat >conftest.sed <Name:>for option\\; do case \"\$option\" in --list-all|--name) echo > s>Description: *>\\;\\; --help) pkg-config --help \\; echo Buildscript Of > s>Version: *>\\;\\; --modversion|--version) echo > s>Requires:>\\;\\; --requires) echo $pkgconfig_requires_add> s>Libs: *>\\;\\; --libs) echo > s>Cflags: *>\\;\\; --cflags) echo > /--libs)/a\\ $pkgconfig_requires_add /--cflags)/a\\ $pkgconfig_requires_add\\ ;; --variable=*) eval echo '\$'\`echo \$option | sed -e 's/.*=//'\`\\ ;; --uninstalled) exit 0 \\ ;; *) ;; esac done AXEOF sed -f conftest.sed $pkgconfig_generate.in > $pkgconfig_uninstalled if test ! -s $pkgconfig_uninstalled ; then as_fn_error $? "$pkgconfig_uninstalled is empty" "$LINENO" 5 fi ; rm conftest.sed # DONE generate $pkgconfig_uninstalled ;; 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 healpy-1.8.1/healpixsubmodule/src/cxx/autotools/c_utils/0000755000175000017500000000000012351601662023711 5ustar zoncazonca00000000000000healpy-1.8.1/healpixsubmodule/src/cxx/autotools/c_utils/sse_utils.h0000650000175000017530000000546612255154051026243 0ustar zoncaplanck00000000000000/* * This file is part of libc_utils. * * libc_utils 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 2 of the License, or * (at your option) any later version. * * libc_utils 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 libc_utils; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file sse_utils.h * SSE/SSE2/SSE3-related functionality * * Copyright (C) 2010,2011 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_SSE_UTILS_H #define PLANCK_SSE_UTILS_H #if (defined(__SSE__)) #include #ifdef __cplusplus extern "C" { #endif typedef __m128 v4sf; /* vector of 4 floats (SSE1) */ typedef union { float f[4]; v4sf v; } V4SF; static inline v4sf build_v4sf (float a, float b, float c, float d) { return _mm_set_ps(d,c,b,a); } static inline void read_v4sf (v4sf v, float *a, float *b, float *c, float *d) { V4SF tmp; tmp.v = v; if (a) *a=tmp.f[0]; if (b) *b=tmp.f[1]; if (c) *c=tmp.f[2]; if (d) *d=tmp.f[3]; } #ifdef __cplusplus } #endif #endif #if (defined(__SSE2__)) #include #ifdef __cplusplus extern "C" { #endif typedef __m128d v2df; /* vector of 2 doubles (SSE2) */ typedef union { double d[2]; v2df v; } V2DF; typedef struct { v2df a,b; } v2df2; typedef struct { V2DF a,b; } V2DF2; #define V2DF_SIGNMASK _mm_set1_pd(-0.0) static inline v2df build_v2df (double a, double b) { return _mm_set_pd(b,a); } static inline void read_v2df (v2df v, double *a, double *b) { _mm_store_sd(a,v); _mm_storeh_pd(b,v); } static inline int v2df_any_gt (v2df a, v2df b) { return (_mm_movemask_pd(_mm_cmpgt_pd(_mm_andnot_pd(V2DF_SIGNMASK,a),b))!=0); } static inline int v2df_all_ge (v2df a, v2df b) { return (_mm_movemask_pd(_mm_cmplt_pd(_mm_andnot_pd(V2DF_SIGNMASK,a),b))==0); } static inline V2DF to_V2DF (v2df x) { V2DF X; X.v=x; return X; } static inline V2DF2 to_V2DF2 (v2df2 x) { V2DF2 X; X.a.v=x.a; X.b.v=x.b; return X; } static inline v2df2 to_v2df2 (V2DF2 X) { v2df2 x; x.a=X.a.v; x.b=X.b.v; return x; } static inline v2df2 zero_v2df2(void) { v2df2 x; x.a=x.b=_mm_setzero_pd(); return x; } #ifdef __cplusplus } #endif #endif #if (defined(__SSE3__)) #include #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/c_utils/c_utils.c0000650000175000017530000000471512255154051025662 0ustar zoncaplanck00000000000000/* * This file is part of libc_utils. * * libc_utils 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 2 of the License, or * (at your option) any later version. * * libc_utils 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 libc_utils; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Convenience functions * * Copyright (C) 2008-2013 Max-Planck-Society * Author: Martin Reinecke */ #include #include "c_utils.h" void util_fail_ (const char *file, int line, const char *func, const char *msg) { fprintf(stderr,"%s, %i (%s):\n%s\n",file,line,func,msg); exit(1); } void util_warn_ (const char *file, int line, const char *func, const char *msg) { fprintf(stderr,"%s, %i (%s):\n%s\n",file,line,func,msg); } /* This function tries to avoid allocations with a total size close to a high power of two (called the "critical stride" here), by adding a few more bytes if necssary. This lowers the probability that two arrays differ by a multiple of the critical stride in their starting address, which in turn lowers the risk of cache line contention. */ static size_t manipsize(size_t sz) { const size_t critical_stride=4096, cacheline=64, overhead=32; if (sz < (critical_stride/2)) return sz; if (((sz+overhead)%critical_stride)>(2*cacheline)) return sz; return sz+2*cacheline; } #ifdef __SSE__ #include void *util_malloc_ (size_t sz) { void *res; if (sz==0) return NULL; res = _mm_malloc(manipsize(sz),16); UTIL_ASSERT(res,"_mm_malloc() failed"); return res; } void util_free_ (void *ptr) { if ((ptr)!=NULL) _mm_free(ptr); } #else void *util_malloc_ (size_t sz) { void *res; if (sz==0) return NULL; res = malloc(manipsize(sz)); UTIL_ASSERT(res,"malloc() failed"); return res; } void util_free_ (void *ptr) { if ((ptr)!=NULL) free(ptr); } #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/c_utils/planck.make0000650000175000017530000000045112255154051026154 0ustar zoncaplanck00000000000000PKG:=c_utils SD:=$(SRCROOT)/$(PKG) OD:=$(BLDROOT)/$(PKG) FULL_INCLUDE+= -I$(SD) HDR_$(PKG):=$(SD)/*.h LIB_$(PKG):=$(LIBDIR)/libc_utils.a OBJ:=c_utils.o walltime_c.o OBJ:=$(OBJ:%=$(OD)/%) $(OBJ): $(HDR_$(PKG)) | $(OD)_mkdir $(LIB_$(PKG)): $(OBJ) all_hdr+=$(HDR_$(PKG)) all_lib+=$(LIB_$(PKG)) healpy-1.8.1/healpixsubmodule/src/cxx/autotools/c_utils/c_utils.h0000650000175000017530000001137412255154051025666 0ustar zoncaplanck00000000000000/* * This file is part of libc_utils. * * libc_utils 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 2 of the License, or * (at your option) any later version. * * libc_utils 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 libc_utils; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file c_utils.h * Convenience functions * * Copyright (C) 2008-2013 Max-Planck-Society * \author Martin Reinecke * \note This file should only be included from .c files, NOT from .h files. */ #ifndef PLANCK_C_UTILS_H #define PLANCK_C_UTILS_H #include #include #include #ifdef __cplusplus extern "C" { #endif void util_fail_ (const char *file, int line, const char *func, const char *msg); void util_warn_ (const char *file, int line, const char *func, const char *msg); void *util_malloc_ (size_t sz); void util_free_ (void *ptr); #if defined (__GNUC__) #define UTIL_FUNC_NAME__ __func__ #else #define UTIL_FUNC_NAME__ "unknown" #endif /*! \def UTIL_ASSERT(cond,msg) If \a cond is false, print an error message containing function name, source file name and line number of the call, as well as \a msg; then exit the program with an error status. */ #define UTIL_ASSERT(cond,msg) \ if(!(cond)) util_fail_(__FILE__,__LINE__,UTIL_FUNC_NAME__,msg) /*! \def UTIL_WARN(cond,msg) If \a cond is false, print an warning containing function name, source file name and line number of the call, as well as \a msg. */ #define UTIL_WARN(cond,msg) \ if(!(cond)) util_warn_(__FILE__,__LINE__,UTIL_FUNC_NAME__,msg) /*! \def UTIL_FAIL(msg) Print an error message containing function name, source file name and line number of the call, as well as \a msg; then exit the program with an error status. */ #define UTIL_FAIL(msg) \ util_fail_(__FILE__,__LINE__,UTIL_FUNC_NAME__,msg) /*! \def ALLOC(ptr,type,num) Allocate space for \a num objects of type \a type. Make sure that the allocation succeeded, else stop the program with an error. Return the resulting pointer in \a ptr. */ #define ALLOC(ptr,type,num) \ do { (ptr)=(type *)util_malloc_((num)*sizeof(type)); } while (0) /*! \def RALLOC(type,num) Allocate space for \a num objects of type \a type. Make sure that the allocation succeeded, else stop the program with an error. Cast the resulting pointer to \a (type*). */ #define RALLOC(type,num) \ ((type *)util_malloc_((num)*sizeof(type))) /*! \def DEALLOC(ptr) Deallocate \a ptr. It must have been allocated using \a ALLOC or \a RALLOC. */ #define DEALLOC(ptr) \ do { util_free_(ptr); (ptr)=NULL; } while(0) #define RESIZE(ptr,type,num) \ do { util_free_(ptr); ALLOC(ptr,type,num); } while(0) #define GROW(ptr,type,sz_old,sz_new) \ do { \ if ((sz_new)>(sz_old)) \ { RESIZE(ptr,type,2*(sz_new));sz_old=2*(sz_new); } \ } while(0) /*! \def SET_ARRAY(ptr,i1,i2,val) Set the entries \a ptr[i1] ... \a ptr[i2-1] to \a val. */ #define SET_ARRAY(ptr,i1,i2,val) \ do { \ ptrdiff_t cnt_; \ for (cnt_=(i1);cnt_<(i2);++cnt_) (ptr)[cnt_]=(val); \ } while(0) /*! \def COPY_ARRAY(src,dest,i1,i2) Copy the entries \a src[i1] ... \a src[i2-1] to \a dest[i1] ... \a dest[i2-1]. */ #define COPY_ARRAY(src,dest,i1,i2) \ do { \ ptrdiff_t cnt_; \ for (cnt_=(i1);cnt_<(i2);++cnt_) (dest)[cnt_]=(src)[cnt_]; \ } while(0) #define ALLOC2D(ptr,type,num1,num2) \ do { \ size_t cnt_, num1_=(num1), num2_=(num2); \ ALLOC((ptr),type *,num1_); \ ALLOC((ptr)[0],type,num1_*num2_); \ for (cnt_=1; cnt_(b)) ? (a) : (b)) #define IMIN(a,b) \ (((a)<(b)) ? (a) : (b)) #define SWAP(a,b,type) \ do { type tmp_=(a); (a)=(b); (b)=tmp_; } while(0) #define CHECK_STACK_ALIGN(align) \ do { \ double foo; \ UTIL_WARN((((size_t)(&foo))&(align-1))==0, \ "WARNING: stack not sufficiently aligned!"); \ } while(0) #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/c_utils/walltime_c.c0000650000175000017530000000266112255154051026336 0ustar zoncaplanck00000000000000/* * This file is part of libc_utils. * * libc_utils 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 2 of the License, or * (at your option) any later version. * * libc_utils 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 libc_utils; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /* * Functionality for reading wall clock time * * Copyright (C) 2010, 2011 Max-Planck-Society * Author: Martin Reinecke */ #if defined (_OPENMP) #include #elif defined (USE_MPI) #include "mpi.h" #else #include #include #endif #include "walltime_c.h" double wallTime(void) { #if defined (_OPENMP) return omp_get_wtime(); #elif defined (USE_MPI) return MPI_Wtime(); #else struct timeval t; gettimeofday(&t, NULL); return t.tv_sec + 1e-6*t.tv_usec; #endif } healpy-1.8.1/healpixsubmodule/src/cxx/autotools/c_utils/walltime_c.h0000650000175000017530000000320212255154051026333 0ustar zoncaplanck00000000000000/* * This file is part of libc_utils. * * libc_utils 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 2 of the License, or * (at your option) any later version. * * libc_utils 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 libc_utils; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */ /* * libc_utils is being developed at the Max-Planck-Institut fuer Astrophysik * and financially supported by the Deutsches Zentrum fuer Luft- und Raumfahrt * (DLR). */ /*! \file walltime_c.h * Functionality for reading wall clock time * * Copyright (C) 2010 Max-Planck-Society * \author Martin Reinecke */ #ifndef PLANCK_WALLTIME_C_H #define PLANCK_WALLTIME_C_H #ifdef __cplusplus extern "C" { #endif /*! Returns an approximation of the current wall time (in seconds). The first available of the following timers will be used:
    • \a omp_get_wtime(), if OpenMP is available
    • \a MPI_Wtime(), if MPI is available
    • \a gettimeofday() otherwise
    \note Only useful for measuring time differences. \note This function has an execution time between 10 and 100 nanoseconds. */ double wallTime(void); #ifdef __cplusplus } #endif #endif healpy-1.8.1/healpixsubmodule/src/cxx/autotools/ar-lib0000755000175000017500000001330212346122572023344 0ustar zoncazonca00000000000000#! /bin/sh # Wrapper for Microsoft lib.exe me=ar-lib scriptversion=2012-03-01.08; # UTC # Copyright (C) 2010-2013 Free Software Foundation, Inc. # Written by Peter Rosin . # # 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 2, 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 file is maintained in Automake, please report # bugs to or send patches to # . # func_error message func_error () { echo "$me: $1" 1>&2 exit 1 } file_conv= # func_file_conv build_file # Convert a $build file to $host form and store it in $file # Currently only supports Windows hosts. func_file_conv () { file=$1 case $file in / | /[!/]*) # absolute file, and not a UNC file if test -z "$file_conv"; then # lazily determine how to convert abs files case `uname -s` in MINGW*) file_conv=mingw ;; CYGWIN*) file_conv=cygwin ;; *) file_conv=wine ;; esac fi case $file_conv in mingw) file=`cmd //C echo "$file " | sed -e 's/"\(.*\) " *$/\1/'` ;; cygwin) file=`cygpath -m "$file" || echo "$file"` ;; wine) file=`winepath -w "$file" || echo "$file"` ;; esac ;; esac } # func_at_file at_file operation archive # Iterate over all members in AT_FILE performing OPERATION on ARCHIVE # for each of them. # When interpreting the content of the @FILE, do NOT use func_file_conv, # since the user would need to supply preconverted file names to # binutils ar, at least for MinGW. func_at_file () { operation=$2 archive=$3 at_file_contents=`cat "$1"` eval set x "$at_file_contents" shift for member do $AR -NOLOGO $operation:"$member" "$archive" || exit $? done } case $1 in '') func_error "no command. Try '$0 --help' for more information." ;; -h | --h*) cat <= 3.2 because of a # bug in earlier versions regarding C++ sources generated with Cython. See: # https://pypi.python.org/pypi/setuptools/3.6#id171 try: import pkg_resources pkg_resources.require("setuptools >= 3.2") except: from ez_setup import use_setuptools use_setuptools() import os from os.path import join import errno import fnmatch import sys import shlex from distutils.sysconfig import get_config_var, get_config_vars from setuptools import setup, Extension from setuptools.command.test import test as TestCommand from distutils.command.build_clib import build_clib from distutils.errors import DistutilsExecError from distutils.dir_util import mkpath from distutils.file_util import copy_file from distutils import log # Apple switched default C++ standard libraries (from gcc's libstdc++ to # clang's libc++), but some pre-packaged Python environments such as Anaconda # are built against the old C++ standard library. Luckily, we don't have to # actually detect which C++ standard library was used to build the Python # interpreter. We just have to propagate MACOSX_DEPLOYMENT_TARGET from the # configuration variables to the environment. # # This workaround fixes . if get_config_var('MACOSX_DEPLOYMENT_TARGET') and not 'MACOSX_DEPLOYMENT_TARGET' in os.environ: os.environ['MACOSX_DEPLOYMENT_TARGET'] = get_config_var('MACOSX_DEPLOYMENT_TARGET') # # FIXME: Copied from Python 2.7's subprocess.check_output, # but with the output= argument to CalledProcessError, which also # dates to Python 2.7, removed. # # When Python 2.6 becomes unsupported, replace this with: # from subprocess import check_output, CalledProcessError, check_call # from subprocess import Popen, PIPE, CalledProcessError, check_call def check_output(*popenargs, **kwargs): r"""Run command with arguments and return its output as a byte string. If the exit code was non-zero it raises a CalledProcessError. The CalledProcessError object will have the return code in the returncode attribute and output in the output attribute. The arguments are the same as for the Popen constructor. Example: >>> check_output(["ls", "-l", "/dev/null"]) 'crw-rw-rw- 1 root root 1, 3 Oct 18 2007 /dev/null\n' The stdout argument is not allowed as it is used internally. To capture standard error in the result, use stderr=STDOUT. >>> check_output(["/bin/sh", "-c", ... "ls -l non_existent_file ; exit 0"], ... stderr=STDOUT) 'ls: non_existent_file: No such file or directory\n' """ if 'stdout' in kwargs: raise ValueError('stdout argument not allowed, it will be overridden.') process = Popen(stdout=PIPE, *popenargs, **kwargs) output, unused_err = process.communicate() retcode = process.poll() if retcode: cmd = kwargs.get("args") if cmd is None: cmd = popenargs[0] raise CalledProcessError(retcode, cmd) return output # # FIXME: end section copied from Python 2.7's subprocess.check_output # # For ReadTheDocs, do not build the extensions, only install .py files on_rtd = os.environ.get('READTHEDOCS', None) == 'True' cython_require = 'Cython >= 0.16' try: pkg_resources.require(cython_require) from Cython.Distutils import build_ext ext = "pyx" extcpp = "pyx" except: # User does not have a sufficiently new version of Cython. if os.path.exists('healpy/src/_query_disc.cpp'): # This source package already contains the Cython-generated sources, # so we can just use them. from distutils.command.build_ext import build_ext ext = "c" extcpp = "cpp" else: # This source does not contain the Cython-generated sources, so fail. raise DistutilsExecError(''' It looks like you are attempting to build from the Healpy development sources, i.e., from GitHub. You need {0} to build Healpy from development sources. Either install Healpy from an official stable release from: https://pypi.python.org/pypi/healpy OR, to build from development sources, first get {0} from: https://pypi.python.org/pypi/Cython'''.format(cython_require)) if on_rtd: numpy_inc = '' else: from numpy import get_include numpy_inc = get_include() # Test if pkg-config is present. If not, fall back to pykg-config. try: check_output(['pkg-config', '--version']) setup_requires = [] except OSError as e: if e.errno != errno.ENOENT: raise ValueError log.warn('pkg-config is not installed, falling back to pykg-config') setup_requires = ['pykg-config >= 1.2.0'] os.environ['PKG_CONFIG'] = sys.executable + ' ' + os.path.abspath('pykg_config.py') class build_external_clib(build_clib): """Subclass of Distutils' standard build_clib subcommand. Adds support for libraries that are installed externally and detected with pkg-config, with an optional fallback to build from a local configure-make-install style distribution.""" def __init__(self, dist): build_clib.__init__(self, dist) self.build_args = {} @property def _environ(self): """Construct an environment dictionary suitable for having pkg-config pick up .pc files in the build_clib directory.""" pkg_config_path = os.path.join(os.path.realpath(self.build_clib), 'lib', 'pkgconfig') try: pkg_config_path += ':' + os.environ['PKG_CONFIG_PATH'] except KeyError: pass return dict(os.environ, PKG_CONFIG_PATH=pkg_config_path) def pkgconfig(self, *packages): PKG_CONFIG = tuple(shlex.split(os.environ.get('PKG_CONFIG', 'pkg-config'))) kw = {} index_key_flag = ( (2, '--cflags-only-I', ('include_dirs',)), (0, '--cflags-only-other', ('extra_compile_args', 'extra_link_args')), (2, '--libs-only-L', ('library_dirs', 'runtime_library_dirs')), (2, '--libs-only-l', ('libraries',)), (0, '--libs-only-other', ('extra_link_args',))) for index, flag, keys in index_key_flag: cmd = PKG_CONFIG + (flag,) + tuple(packages) log.debug('%s', ' '.join(cmd)) args = [token[index:].decode() for token in check_output(cmd, env=self._environ).split()] if args: for key in keys: kw.setdefault(key, []).extend(args) return kw def finalize_options(self): """Run 'autoreconf -i' for any bundled libraries to generate the configure script.""" build_clib.finalize_options(self) for lib_name, build_info in self.libraries: if 'sources' not in build_info: log.info("checking if configure script for library '%s' exists", lib_name) if not os.path.exists(os.path.join(build_info['local_source'], 'configure')): log.info("running 'autoreconf -i' for library '%s'", lib_name) check_call(['autoreconf', '-i'], cwd=build_info['local_source']) def build_library(self, library, pkg_config_name, local_source=None, supports_non_srcdir_builds=True): log.info("checking if library '%s' is installed", library) try: build_args = self.pkgconfig(pkg_config_name) log.info("found '%s' installed, using it", library) except CalledProcessError: # If local_source is not specified, then immediately fail. if local_source is None: raise DistutilsExecError("library '%s' is not installed", library) log.info("building library '%s' from source", library) # Determine which compilers we are to use, and what flags. # This is based on what distutils.sysconfig.customize_compiler() # does, but that function has a problem that it doesn't produce # necessary (e.g. architecture) flags for C++ compilers. cc, cxx, opt, cflags = get_config_vars('CC', 'CXX', 'OPT', 'CFLAGS') cxxflags = cflags if 'CC' in os.environ: cc = os.environ['CC'] if 'CXX' in os.environ: cxx = os.environ['CXX'] if 'CFLAGS' in os.environ: cflags = opt + ' ' + os.environ['CFLAGS'] if 'CXXLAGS' in os.environ: cxxflags = opt + ' ' + os.environ['CXXFLAGS'] # Use a subdirectory of build_temp as the build directory. build_temp = os.path.realpath(os.path.join(self.build_temp, library)) # Destination for headers and libraries is build_clib. build_clib = os.path.realpath(self.build_clib) # Create build directories if they do not yet exist. mkpath(build_temp) mkpath(build_clib) if not supports_non_srcdir_builds: self._stage_files_recursive(local_source, build_temp) # Run configure. cmd = ['/bin/sh', os.path.join(os.path.realpath(local_source), 'configure'), '--prefix=' + build_clib, '--disable-shared', '--with-pic', '--disable-maintainer-mode'] log.info('%s', ' '.join(cmd)) check_call(cmd, cwd=build_temp, env=dict(self._environ, CC=cc, CXX=cxx, CFLAGS=cflags, CXXFLAGS=cxxflags)) # Run make install. cmd = ['make', 'install'] log.info('%s', ' '.join(cmd)) check_call(cmd, cwd=build_temp, env=self._environ) build_args = self.pkgconfig(pkg_config_name) return build_args # Done! @staticmethod def _list_files_recursive(path, skip=('.*', '*.o', 'autom4te.cache')): """Yield paths to all of the files contained within the given path, following symlinks. If skip is a tuple of fnmatch()-style wildcard strings, skip any directory or filename matching any of the patterns in skip.""" for dirpath, dirnames, filenames in os.walk(path, followlinks=True): if not any(any(fnmatch.fnmatch(p, s) for s in skip) for p in dirpath.split(os.sep)): for filename in filenames: if not any(fnmatch.fnmatch(filename, s) for s in skip): yield os.path.join(dirpath, filename) @staticmethod def _stage_files_recursive(src, dest, skip=None): """Hard link or copy all of the files in the path src into the path dest. Subdirectories are created as needed, and files in dest are overwritten.""" # Use hard links if they are supported on this system. if hasattr(os, 'link'): link='hard' elif hasattr(os, 'symlink'): link='sym' else: link=None for dirpath, dirnames, filenames in os.walk(src, followlinks=True): if not any(p.startswith('.') for p in dirpath.split(os.sep)): dest_dirpath = os.path.join(dest, dirpath.split(src, 1)[1].lstrip(os.sep)) mkpath(dest_dirpath) for filename in filenames: if not filename.startswith('.'): src_path = os.path.join(dirpath, filename) dest_path = os.path.join(dest_dirpath, filename) if not os.path.exists(dest_path): copy_file(os.path.join(dirpath, filename), os.path.join(dest_dirpath, filename)) def get_source_files(self): """Copied from Distutils' own build_clib, but modified so that it is not an error for a build_info dictionary to lack a 'sources' key. If there is no 'sources' key, then all files contained within the path given by the 'local_sources' value are returned.""" self.check_library_list(self.libraries) filenames = [] for (lib_name, build_info) in self.libraries: sources = build_info.get('sources') if sources is None or not isinstance(sources, (list, tuple)): sources = list(self._list_files_recursive(build_info['local_source'])) filenames.extend(sources) return filenames def build_libraries(self, libraries): # Build libraries that have no 'sources' key, accumulating the output # from pkg-config. for lib_name, build_info in libraries: if 'sources' not in build_info: for key, value in self.build_library(lib_name, **build_info).items(): if key in self.build_args: self.build_args[key].extend(value) else: self.build_args[key] = value # Use parent method to build libraries that have a 'sources' key. build_clib.build_libraries(self, ((lib_name, build_info) for lib_name, build_info in libraries if 'sources' in build_info)) class custom_build_ext(build_ext): def run(self): # If we were asked to build any C/C++ libraries, add the directory # where we built them to the include path. (It's already on the library # path.) if self.distribution.has_c_libraries(): self.run_command('build_clib') build_clib = self.get_finalized_command('build_clib') for key, value in build_clib.build_args.items(): for ext in self.extensions: if not hasattr(ext, key) or getattr(ext, key) is None: setattr(ext, key, value) else: getattr(ext, key).extend(value) build_ext.run(self) class PyTest(TestCommand): """Custom Setuptools test command to run doctests with py.test. Based on http://pytest.org/latest/goodpractises.html#integration-with-setuptools-test-commands""" def finalize_options(self): TestCommand.finalize_options(self) self.test_args.insert(0, '--doctest-modules') def run_tests(self): import pytest sys.exit(pytest.main(self.test_args)) def get_version(): context = {} try: execfile except NameError: exec(open('healpy/version.py').read(), context) else: execfile('healpy/version.py', context) return context['__version__'] healpy_pixel_lib_src = '_healpy_pixel_lib.cc' healpy_spht_src = '_healpy_sph_transform_lib.cc' healpy_fitsio_src = '_healpy_fitsio_lib.cc' #start with base extension pixel_lib = Extension('healpy._healpy_pixel_lib', sources=[join('healpy','src', healpy_pixel_lib_src)], include_dirs=[numpy_inc], language='c++' ) spht_lib = Extension('healpy._healpy_sph_transform_lib', sources=[join('healpy','src', healpy_spht_src)], include_dirs=[numpy_inc], language='c++' ) hfits_lib = Extension('healpy._healpy_fitsio_lib', sources=[join('healpy','src', healpy_fitsio_src)], include_dirs=[numpy_inc], language='c++' ) if on_rtd: libraries = [] cmdclass = {} extension_list = [] else: cmdclass = { 'build_ext': custom_build_ext, 'build_clib': build_external_clib, 'test': PyTest} libraries = [ ('cfitsio', { 'pkg_config_name': 'cfitsio', 'local_source': 'cfitsio', 'supports_non_srcdir_builds': False}), ('healpix_cxx', { 'pkg_config_name': 'healpix_cxx', 'local_source': 'healpixsubmodule/src/cxx/autotools'}) ] extension_list = [pixel_lib, spht_lib, hfits_lib, Extension("healpy._query_disc", ['healpy/src/_query_disc.'+extcpp], include_dirs=[numpy_inc], language='c++'), Extension("healpy._sphtools", ['healpy/src/_sphtools.'+extcpp], include_dirs=[numpy_inc], language='c++'), Extension("healpy._pixelfunc", ['healpy/src/_pixelfunc.'+extcpp], include_dirs=[numpy_inc], language='c++'), ] for e in extension_list[-3:]: #extra setup for Cython extensions e.pyrex_directives = {"embedsignature": True} setup(name='healpy', version=get_version(), description='Healpix tools package for Python', classifiers=[ 'Development Status :: 5 - Production/Stable', 'Environment :: Console', 'Intended Audience :: Science/Research', 'License :: OSI Approved :: GNU General Public License v2 or later (GPLv2+)', 'Operating System :: POSIX', 'Programming Language :: C++', 'Programming Language :: Python :: 2.6', 'Programming Language :: Python :: 2.7', 'Programming Language :: Python :: 3.2', 'Programming Language :: Python :: 3.3', 'Programming Language :: Python :: 3.4', 'Topic :: Scientific/Engineering :: Astronomy', 'Topic :: Scientific/Engineering :: Visualization' ], author='C. Rosset, A. Zonca', author_email='cyrille.rosset@apc.univ-paris-diderot.fr', url='http://github.com/healpy', packages=['healpy','healpy.test'], libraries=libraries, py_modules=['healpy.pixelfunc','healpy.sphtfunc', 'healpy.visufunc','healpy.fitsfunc', 'healpy.projector','healpy.rotator', 'healpy.projaxes','healpy.version'], cmdclass = cmdclass, ext_modules = extension_list, package_data = {'healpy': ['data/*.fits', 'data/totcls.dat', 'test/data/*.fits', 'test/data/*.sh']}, setup_requires=setup_requires, install_requires=['pyfits', 'six'], tests_require=['pytest'], test_suite='healpy', license='GPLv2' ) healpy-1.8.1/README.rst0000644000175000017500000001104512351423510014735 0ustar zoncazonca00000000000000==================================== Healpy, a python wrapper for healpix ==================================== .. image:: https://travis-ci.org/healpy/healpy.png?branch=master :target: https://travis-ci.org/healpy/healpy Description ----------- Healpy provides a python package to manipulate healpix maps. It is based on the standard numeric and visualisation tools for Python, Numpy and matplotlib. To find more information about Healpix, please visit its home page at http://healpix.sourceforge.net/. The documentation can be found at http://healpy.readthedocs.org, tutorial at http://healpy.readthedocs.org/en/latest/tutorial.html. Characteristics --------------- * pixelisation manipulation (ang2pix, pix2ang, *etc.*) * spherical harmonic transforms (map2alm, alm2map, synfast, anafast, *etc.* both for temperature and polarisation) * plotting capabilities (mollweide and gnomonic projection) * reading and writing of Healpix FITS maps and alm Requirements ------------ * `Python `_ 2.6, 2.7, 3.2, 3.3, or 3.4 * `Numpy `_ (tested with version >=1.5.0) * `Matplotlib `_ * Python development package is required for some distribution (e.g., python-dev package for Ubuntu) * `PyFITS `_ Quick installation with Pip --------------------------- The quickest way to install Healpy is with `pip `_ (>= 1.4.2), which automatically fetches the latest version of Healpy and any missing dependencies:: pip install --user healpy If you have installed with ``pip``, you can keep your installation up to date by upgrading from time to time:: pip install --user --upgrade healpy See `INSTALL.rst `_ for further details and other installation options. Optional -------- Healpy depends on the Healpix C++ and cfitsio C libraries. Source code is include with Healpy and you do not have to install them separately. However, if you have them installed already, Healpy should detect and reuse them instead of building them from source. To use your own installations of HEALPix and cfitsio, you will also need: * `pkg-config `_ * `HEALPix `_ autotools-style C++ package * `cfitsio `_ See `INSTALL.rst `_ for further instructions. Known Issues ------------ healpy pixel functions, e.g. ang2pix, do not support 32bit platforms, we are working on fixing this issue. Support ------- For specific *HOWTO* questions please create a question on StackOverflow_ and tag it with the `healpy` tag, so that answers will be easily searchable on google. If you think you found a bug or you have install issues, open an issue on github: https://github.com/healpy/healpy/issues?state=open For more general discussion, you can write to the healpy mailing list: https://groups.google.com/d/forum/healpy .. _StackOverflow: http://stackoverflow.com/questions/ask Contribute ---------- Project development takes place on github, http://github.com/healpy/healpy, please open an issue over there for reporting bugs or suggest improvements. Collaboration is very welcome, just fork the project on github and send pull requests back to the main repository. Developers ---------- Core developers: * Cyrille Rosset * Andrea Zonca * Martin Reinecke * Leo Singer Contributors: * Pierre Chanial * Yu Feng * Duncan Hanson * Sergey Koposov * Maude Martin Lejeune * Paul Price * Maurizio Tomasi Acknowledgements ---------------- Note that, as stated `here `_ publications based on work using the HEALPix software package should include both of the following: 1. an acknowledgment statement: "Some of the results in this paper have been derived using the HEALPix (Górski et al., 2005) package". The complete reference is: Górski, K.M., E. Hivon, A.J. Banday, B.D. Wandelt, F.K. Hansen, M. Reinecke, and M. Bartelmann, HEALPix: A Framework for High-resolution Discretization and Fast Analysis of Data Distributed on the Sphere, Ap.J., 622, 759-771, 2005. 2. at the first use of the HEALPix acronym, a footnote placed in the main body of the paper referring to the HEALPix web site, currently http://healpix.sf.net As healpy is based on HEALPix Software (the C++ library), the same condition applies to it. healpy-1.8.1/CHANGELOG.rst0000654000175000017530000000475712351601560015450 0ustar zoncaplanck00000000000000Release 1.8.1, 22 Jun 2014 * Added `common.pxd` to source tarball * Check that nside is less than 2^30 Release 1.8.0, 21 Jun 2014 * Python 3 support * Fixed bug in `get_interpol_ring`: * Performance improvements in `_query_disc.pyx`: Release 1.7.4, 26 Feb 2014 * Fix bug for MAC OS X build Release 1.7.3, 28 Jan 2014 * Minor cleanup for submitting debian package Release 1.7.2, 27 Jan 2014 * now package does not require autotools, fixes #155 Release 1.7.1, 23 Jan 2014 * bugfix for Anaconda/Canopy on MAC OSX #152, #153 * fixed packaging issue #154 Release 1.7.0, 14 Jan 2014 * rewritten spherical armonics unit tests, now it uses low res maps included in the repository * fix in HEALPix C++ build flags allows easier install on MAC-OSX and other python environments (e.g. anaconda) * orthview: orthografic projection * fixed bug in monopole removal in anafast Release 1.6.3, 26 Aug 2013: * updated C++ sources to 3.11 * verbose=True default for most functions Release 1.6.2, 11 Jun 2013: * ez_setup, switch from distribute to the new setuptools Release 1.6.0, 15th March 2013: * support for NSIDE>8192, this broke compatibility with 32bit systems * using the new autotools based build system of healpix_cxx * pkg-config based install for cfitsio and healpix_cxx * common definition file for cython modules * test build script * new matplotlib based mollview in healpy.newvisufunc Release 1.5.0, 16th January 2013: * Healpix C++ sources and cython compiled files removed from the repository, they are however added for the release tarballs * Added back support for CFITSIO_EXT_INC and CFITSIO_EXT_LIB, but with same definition of HealPix * gauss_beam: gaussian beam transfer function Release 1.4.1, 5th November 2012: * Removed support for CFITSIO_EXT_INC and CFITSIO_EXT_LIB * Support for linking with libcfitsio.so or libcfitsio.dyn Release 1.4, 4th September 2012: * Support for building using an external HealPix library, by Leo Singer * fixes on masked array maps Release 1.3, 21th August 2012: * all functions covered with unit testing or doctests * rewrote setup.py using distutils, by Leo Singer * all functions accept and return masked arrays created with `hp.ma` * `read_cl` and `write_cl` support polarization * matplotlib imported only after first plotting function is called healpy-1.8.1/COPYING0000650000175000017530000004313311705033043014442 0ustar zoncaplanck00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 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 2 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, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. healpy-1.8.1/PKG-INFO0000644000175000017500000000165312351601662014355 0ustar zoncazonca00000000000000Metadata-Version: 1.1 Name: healpy Version: 1.8.1 Summary: Healpix tools package for Python Home-page: http://github.com/healpy Author: C. Rosset, A. Zonca Author-email: cyrille.rosset@apc.univ-paris-diderot.fr License: GPLv2 Description: UNKNOWN Platform: UNKNOWN Classifier: Development Status :: 5 - Production/Stable Classifier: Environment :: Console Classifier: Intended Audience :: Science/Research Classifier: License :: OSI Approved :: GNU General Public License v2 or later (GPLv2+) Classifier: Operating System :: POSIX Classifier: Programming Language :: C++ Classifier: Programming Language :: Python :: 2.6 Classifier: Programming Language :: Python :: 2.7 Classifier: Programming Language :: Python :: 3.2 Classifier: Programming Language :: Python :: 3.3 Classifier: Programming Language :: Python :: 3.4 Classifier: Topic :: Scientific/Engineering :: Astronomy Classifier: Topic :: Scientific/Engineering :: Visualization healpy-1.8.1/pykg_config.py0000650000175000017530000000025112255117320016254 0ustar zoncaplanck00000000000000# Helper to run pykg-config, whether it is installed or lives in a zipped egg. from pkg_resources import run_script run_script('pykg-config >= 1.2.0', 'pykg-config.py') healpy-1.8.1/CITATION0000650000175000017530000000222312255117320014541 0ustar zoncaplanck00000000000000Use of the HEALPix/healpy software package should be explicitly acknowledged in all publications in the following form: * an acknowledgment statement – "Some of the results in this paper have been derived using the HEALPix (K.M. Górski et al., 2005, ApJ, 622, p759) package" * at the first use of the HEALPix acronym, a footnote placed in the main body of the paper referring to the HEALPix website – currently http://healpix.sourceforge.net BibTeX record: @ARTICLE{2005ApJ...622..759G, author = {{G{\'o}rski}, K.~M. and {Hivon}, E. and {Banday}, A.~J. and {Wandelt}, B.~D. and {Hansen}, F.~K. and {Reinecke}, M. and {Bartelmann}, M.}, title = "{HEALPix: A Framework for High-Resolution Discretization and Fast Analysis of Data Distributed on the Sphere}", journal = {\apj}, eprint = {arXiv:astro-ph/0409513}, keywords = {Cosmology: Cosmic Microwave Background, Cosmology: Observations, Methods: Statistical}, year = 2005, month = apr, volume = 622, pages = {759-771}, doi = {10.1086/427976}, adsurl = {http://adsabs.harvard.edu/abs/2005ApJ...622..759G}, adsnote = {Provided by the SAO/NASA Astrophysics Data System} } healpy-1.8.1/cfitsio/0000755000175000017500000000000012351601662014713 5ustar zoncazonca00000000000000healpy-1.8.1/cfitsio/testprog.std0000654000175000017530000020700012272000775017437 0ustar zoncaplanck00000000000000SIMPLE = 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 î þ    @ € À @ Q b e v ˜ Ü  ¨ º Ì Ï á  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 healpy-1.8.1/cfitsio/getcolb.c0000654000175000017530000022552112272000775016647 0ustar zoncaplanck00000000000000/* 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) { sprintf(msg, "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 { sprintf(msg, "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) { sprintf(msg, "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]) { sprintf(msg, "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[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; 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 */ sprintf(message, "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) sprintf(message, "Error reading elements %.0f thru %.0f from column %d (ffgclb).", dtemp+1., dtemp+ntodo, colnum); else sprintf(message, "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 */ memcpy(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; 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 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[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; 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); sprintf(message, "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); } healpy-1.8.1/cfitsio/getcoll.c0000654000175000017530000005514112272000775016660 0ustar zoncaplanck00000000000000/* 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; sprintf(message, "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[81]; if (*status > 0 || nrows == 0) return(*status); /* check input parameters */ if (firstrow < 1) { sprintf(message, "Starting row number is less than 1: %ld (ffgcxui)", (long) firstrow); ffpmsg(message); return(*status = BAD_ROW_NUM); } else if (input_first_bit < 1) { sprintf(message, "Starting bit number is less than 1: %ld (ffgcxui)", input_first_bit); ffpmsg(message); return(*status = BAD_ELEM_NUM); } else if (input_nbits > 16) { sprintf(message, "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) { sprintf(message, "Specified column number is out of range: %d (ffgcxui)", colnum); ffpmsg(message); sprintf(message, " 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[81]; if (*status > 0 || nrows == 0) return(*status); /* check input parameters */ if (firstrow < 1) { sprintf(message, "Starting row number is less than 1: %ld (ffgcxuk)", (long) firstrow); ffpmsg(message); return(*status = BAD_ROW_NUM); } else if (input_first_bit < 1) { sprintf(message, "Starting bit number is less than 1: %ld (ffgcxuk)", input_first_bit); ffpmsg(message); return(*status = BAD_ELEM_NUM); } else if (input_nbits > 32) { sprintf(message, "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) { sprintf(message, "Specified column number is out of range: %d (ffgcxuk)", colnum); ffpmsg(message); sprintf(message, " 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); } healpy-1.8.1/cfitsio/vmsieee.c0000654000175000017530000000730612272000775016664 0ustar zoncaplanck00000000000000#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; } } } healpy-1.8.1/cfitsio/cookbook.f0000654000175000017530000007277312272000775017052 0ustar zoncaplanck00000000000000 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 healpy-1.8.1/cfitsio/Makefile.in0000654000175000017530000001252212272000775017124 0ustar zoncaplanck00000000000000# # Makefile for cfitsio library: # libcfits.a # # 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 # CFITSIO version numbers: CFITSIO_MAJOR = @CFITSIO_MAJOR@ CFITSIO_MINOR = @CFITSIO_MINOR@ CFITSIO_SONAME = @CFITSIO_SONAME@ prefix = @prefix@ exec_prefix = @exec_prefix@ DESTDIR = 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@ SSE_FLAGS = @SSE_FLAGS@ FC = @FC@ LDFLAGS = $(CFLAGS) DEFS = @DEFS@ LIBS = @LIBS@ 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 drvrgsiftp.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 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: libcfitsio.a libcfitsio.a: ${OBJECTS} ${ARCHIVE} libcfitsio.a ${OBJECTS}; \ ${RANLIB} libcfitsio.a; shared: libcfitsio${SHLIB_SUFFIX} libcfitsio${SHLIB_SUFFIX}: ${OBJECTS} ${SHLIB_LD} ${LDFLAGS} -o ${CFITSIO_SHLIB} ${OBJECTS} -lm ${LIBS} @if [ "x${CFITSIO_SHLIB_SONAME}" != x ]; then \ ln -sf ${CFITSIO_SHLIB} ${CFITSIO_SHLIB_SONAME}; \ ln -sf ${CFITSIO_SHLIB_SONAME} $@; \ fi install: libcfitsio.a $(INSTALL_DIRS) /bin/cp -a libcfitsio* ${CFITSIO_LIB} /bin/cp fitsio.h fitsio2.h longnam.h drvrsmem.h ${CFITSIO_INCLUDE} /bin/cp cfitsio.pc ${CFITSIO_LIB}/pkgconfig .c.o: $(CC) -c -o ${ eval_l.c1 /bin/sed -e 's/yy/ff/g' -e 's/YY/FF/g' eval_l.c1 > 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 -f *.o zlib/*.o libcfitsio* fpack funpack \ smem testprog y.output so_locations 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 healpy-1.8.1/cfitsio/group.c0000654000175000017530000052437712272000775016377 0ustar zoncaplanck00000000000000/* 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) #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(strcasecmp(ttype[i],"MEMBER_POSITION") == 0 || strcasecmp(ttype[i],"MEMBER_VERSION") == 0) { sprintf(keyword,"TFORM%d",i+1); *status = fits_read_key_str(fptr,keyword,keyvalue,comment, status); sprintf(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(strcasecmp(ttype[i],"MEMBER_POSITION") == 0 || 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); sprintf(keyword,"TFORM%d",colnum); *status = fits_read_key_str(gfptr,keyword,keyvalue,comment, status); sprintf(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(strcasecmp(ttype[i],"MEMBER_XTENSION") == 0 || strcasecmp(ttype[i],"MEMBER_NAME") == 0 || strcasecmp(ttype[i],"MEMBER_URI_TYPE") == 0 || 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(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; sprintf(errstr,"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; sprintf(errstr, "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; sprintf(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 */ sprintf(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; sprintf(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 */ sprintf(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; sprintf(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(strcasecmp(groupAccess1,"file://") && 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(strcasecmp(memberAccess1,"file://") == 0) { if(*memberFileName == '/') { strcpy(memberLocation,memberFileName); } else { strcpy(memberLocation,cwd); 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(strcasecmp(groupAccess1,"file://") == 0) { if(*groupFileName == '/') { strcpy(groupLocation,groupFileName); } else { strcpy(groupLocation,cwd); 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(strcasecmp(groupAccess1,"file://") == 0 && 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) { sprintf(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 */ sprintf(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,groupLocation,status); if(groupLocation[0] != '/') { strcpy(tmp, cwd); 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,groupLocation,status); if(groupLocation[0] != '/') { strcpy(tmp, cwd); 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 */ sprintf(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 */ sprintf(keyword,"GRPID%d",(int)ngroups); fits_insert_key_lng(tmpfptr,keyword,groupExtver, "EXTVER of Group containing this HDU",status); sprintf(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(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) { sprintf(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 */ sprintf(newKeyword,"GRPID%d",newIndex); fits_modify_name(mfptr,keyword,newKeyword,status); /* If present, update the GRPLCn keyword index */ sprintf(keyword,"GRPLC%d",index); sprintf(newKeyword,"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; /* 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(strcasecmp(xtension,"PRIMARY") == 0) hdutype = IMAGE_HDU; else if(strcasecmp(xtension,"IMAGE") == 0) hdutype = IMAGE_HDU; else if(strcasecmp(xtension,"TABLE") == 0) hdutype = ASCII_TBL; else if(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(strcasecmp(uri,"URL") != 0) { *status = FILE_NOT_OPENED; sprintf(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,"/"); 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); 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(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(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); strcat(grpLocation3,"/"); strcat(grpLocation3,grpLocation1); fits_clean_url(grpLocation3,grpLocation1,status); } if(*grpLocation2 != 0 && *grpLocation2 != '/' && !fits_is_url_absolute(grpLocation2)) { strcpy(grpLocation3,cwd); 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 */ sprintf(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 */ sprintf(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 */ sprintf(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'; } 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) { sprintf(keyword,"GRPID%d",found); *status = fits_delete_key(mfptr,keyword,status); sprintf(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(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 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; sprintf(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) { sprintf(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) { sprintf(keyword,"GRPID%d",(int)index); fits_delete_key(mfptr,keyword,status); sprintf(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,tmpLocation,status); if(*tmpLocation != '/') { fits_get_cwd(cwd,status); 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(strcasecmp(tmpPtr[0],xtension) != 0) continue; } if(extnameCol != 0) { fits_read_col_str(gfptr,extnameCol,i,1,1,nstr,tmpPtr,&dummy,status); if(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); 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); 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); 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); 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(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(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(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) { sprintf(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(strcasecmp(keyvalue,"MEMBER_XTENSION") != 0 && strcasecmp(keyvalue,"MEMBER_NAME") != 0 && strcasecmp(keyvalue,"MEMBER_VERSION") != 0 && strcasecmp(keyvalue,"MEMBER_POSITION") != 0 && strcasecmp(keyvalue,"MEMBER_LOCATION") != 0 && 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 */ 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,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; #elif defined(VMS) || defined(vms) || defined(__vms) int i; char *tmpStr; #elif defined(macintosh) char *tmpStr; #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 = strtok(buff,"/"), outpath[0] = 0; tmpStr != NULL; tmpStr = strtok(NULL,"/")) { 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 = strtok(buff,"/"), outpath[0] = 0; tmpStr != NULL; tmpStr = strtok(NULL,"/")) { if(strcasecmp(tmpStr,"FILE:") == 0) { /* the next token should contain the DECnet machine name */ tmpStr = strtok(NULL,"/"); 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 = strtok(buff,"/"), outpath[0] = 0; tmpStr != NULL; tmpStr = strtok(NULL,"/")) { 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 */ getcwd(buff,FLEN_FILENAME); #endif /* convert the cwd string to a URL standard path string */ fits_path2url(buff,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(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(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(strcasecmp(tmpStr3,"memkeep://") == 0) { strcpy(tmpStr3,"mem://"); *tmpStr4 = 0; *tmpStr2 = 0; tmpIOstate = 1; } /* file residing in shared memory */ else if(strcasecmp(tmpStr3,"shmem://") == 0) { *tmpStr4 = 0; *tmpStr2 = 0; tmpIOstate = 1; } /* file accessed via the ROOT network protocol */ else if(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(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(strcasecmp(tmpStr3,"httpfile://") == 0) { strcpy(tmpStr1,outfile); strcpy(tmpStr3,"file://"); strcpy(tmpStr4,"http://"); tmpIOstate = 1; } /* FTP accessd file written locally to disk */ else if(strcasecmp(tmpStr3,"ftpfile://") == 0) { strcpy(tmpStr1,outfile); strcpy(tmpStr3,"file://"); strcpy(tmpStr4,"ftp://"); tmpIOstate = 1; } /* file from STDIN written to disk */ else if(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(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(strcasecmp(tmpStr3,"http://") == 0) { *tmpStr1 = 0; strcpy(tmpStr3,"mem://"); strcpy(tmpStr4,"http://"); tmpIOstate = 0; } /* HTTP accessed compressed file transferred into memory */ else if(strcasecmp(tmpStr3,"httpcompress://") == 0) { *tmpStr1 = 0; strcpy(tmpStr3,"mem://"); strcpy(tmpStr4,"http://"); tmpIOstate = 0; } /* FTP accessed file transferred into memory */ else if(strcasecmp(tmpStr3,"ftp://") == 0) { *tmpStr1 = 0; strcpy(tmpStr3,"mem://"); strcpy(tmpStr4,"ftp://"); tmpIOstate = 0; } /* FTP accessed compressed file transferred into memory */ else if(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(strcasecmp(tmpStr3,"stdin://") == 0) { *status = URL_PARSE_ERROR; ffpmsg("cannot make vaild URL from stdin:// (fits_get_url)"); *tmpStr1 = *tmpStr2 = 0; } else if(strcasecmp(tmpStr3,"stdout://") == 0) { *status = URL_PARSE_ERROR; ffpmsg("cannot make vaild URL from stdout:// (fits_get_url)"); *tmpStr1 = *tmpStr2 = 0; } else if(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,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,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; 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 = strtok(inURL, "/"); /* 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 = strtok(NULL, "/"); /* 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); 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] == '/') strcat(relURL,"../"); /* copy all remaining characters of absURL to the output relURL */ 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 */ 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(strncasecmp(tmpStr,"MEM:",4) == 0 || 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; 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) 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 */ 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 */ 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 output path is at least as large as, if not larger than the input path, so that OUTPATH should be passed to this function with room for growth. If not a runtime error could result. It is assumed that OUTPATH has been allocated with enough room to hold the resulting encoded URL. 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"; 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; p++) { a = (unsigned char)*p; /* if the charcter requires encoding then process it */ if(!( a>=32 && a<128 && (isAcceptable[a-32]))) { /* 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]; } /* else just copy the character as is */ else *q++ = *p; } /* null terminate the outpath string */ *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); } } healpy-1.8.1/cfitsio/eval_y.c0000654000175000017530000073314712272000775016517 0ustar zoncaplanck00000000000000 /* A Bison parser, made from eval.y by GNU Bison version 1.25 */ #define FFBISON 1 /* Identify Bison output. */ #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 EQ 277 #define NE 278 #define GT 279 #define LT 280 #define LTE 281 #define GTE 282 #define POWER 283 #define NOT 284 #define INTCAST 285 #define FLTCAST 286 #define UMINUS 287 #define ACCUM 288 #define DIFF 289 #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 /* 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 "eval.y" typedef union { int Node; /* Index of Node */ double dbl; /* real value */ long lng; /* integer value */ char log; /* logical value */ char str[MAX_STRLEN]; /* string value */ } FFSTYPE; #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define FFFINAL 290 #define FFFLAG -32768 #define FFNTBASE 54 #define FFTRANSLATE(x) ((unsigned)(x) <= 289 ? fftranslate[x] : 62) static const char 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, 30, 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, 28, 29, 31, 32, 33, 34, 42, 43, 44, 45, 46, 48, 49 }; #if FFDEBUG != 0 static const short ffprhs[] = { 0, 0, 1, 4, 6, 9, 12, 15, 18, 21, 24, 28, 31, 35, 39, 43, 46, 49, 51, 53, 58, 62, 66, 70, 75, 82, 91, 102, 115, 118, 122, 124, 126, 128, 133, 135, 137, 141, 145, 149, 153, 157, 161, 164, 167, 171, 175, 179, 185, 191, 197, 200, 204, 208, 212, 216, 222, 228, 238, 243, 250, 259, 270, 283, 286, 289, 292, 295, 297, 299, 304, 308, 312, 316, 320, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 402, 408, 412, 416, 420, 426, 434, 446, 462, 465, 469, 475, 485, 489, 497, 507, 512, 519, 528, 539, 552, 555, 559, 561, 563, 568, 570, 574, 578, 584, 590 }; static const short ffrhs[] = { -1, 54, 55, 0, 50, 0, 58, 50, 0, 59, 50, 0, 61, 50, 0, 60, 50, 0, 1, 50, 0, 23, 59, 0, 56, 20, 59, 0, 23, 58, 0, 57, 20, 58, 0, 57, 20, 59, 0, 56, 20, 58, 0, 57, 24, 0, 56, 24, 0, 7, 0, 16, 0, 16, 23, 58, 24, 0, 60, 41, 60, 0, 60, 40, 60, 0, 60, 35, 60, 0, 60, 47, 58, 51, 0, 60, 47, 58, 20, 58, 51, 0, 60, 47, 58, 20, 58, 20, 58, 51, 0, 60, 47, 58, 20, 58, 20, 58, 20, 58, 51, 0, 60, 47, 58, 20, 58, 20, 58, 20, 58, 20, 58, 51, 0, 43, 60, 0, 52, 60, 53, 0, 4, 0, 5, 0, 13, 0, 13, 23, 58, 24, 0, 17, 0, 18, 0, 58, 37, 58, 0, 58, 35, 58, 0, 58, 36, 58, 0, 58, 38, 58, 0, 58, 39, 58, 0, 58, 42, 58, 0, 35, 58, 0, 36, 58, 0, 52, 58, 53, 0, 58, 38, 59, 0, 59, 38, 58, 0, 59, 25, 58, 22, 58, 0, 59, 25, 59, 22, 58, 0, 59, 25, 58, 22, 59, 0, 8, 53, 0, 8, 59, 53, 0, 8, 61, 53, 0, 8, 60, 53, 0, 8, 58, 53, 0, 10, 61, 20, 61, 53, 0, 8, 58, 20, 58, 53, 0, 8, 58, 20, 58, 20, 58, 20, 58, 53, 0, 58, 47, 58, 51, 0, 58, 47, 58, 20, 58, 51, 0, 58, 47, 58, 20, 58, 20, 58, 51, 0, 58, 47, 58, 20, 58, 20, 58, 20, 58, 51, 0, 58, 47, 58, 20, 58, 20, 58, 20, 58, 20, 58, 51, 0, 44, 58, 0, 44, 59, 0, 45, 58, 0, 45, 59, 0, 3, 0, 14, 0, 14, 23, 58, 24, 0, 60, 28, 60, 0, 60, 29, 60, 0, 60, 32, 60, 0, 60, 33, 60, 0, 60, 31, 60, 0, 60, 34, 60, 0, 58, 31, 58, 0, 58, 32, 58, 0, 58, 34, 58, 0, 58, 33, 58, 0, 58, 30, 58, 0, 58, 28, 58, 0, 58, 29, 58, 0, 61, 28, 61, 0, 61, 29, 61, 0, 61, 31, 61, 0, 61, 34, 61, 0, 61, 32, 61, 0, 61, 33, 61, 0, 59, 27, 59, 0, 59, 26, 59, 0, 59, 28, 59, 0, 59, 29, 59, 0, 58, 21, 58, 22, 58, 0, 59, 25, 59, 22, 59, 0, 9, 58, 53, 0, 9, 59, 53, 0, 9, 61, 53, 0, 8, 59, 20, 59, 53, 0, 9, 58, 20, 58, 20, 58, 53, 0, 9, 58, 20, 58, 20, 58, 20, 58, 20, 58, 53, 0, 9, 58, 20, 58, 20, 58, 20, 58, 20, 58, 20, 58, 20, 58, 53, 0, 11, 53, 0, 11, 6, 53, 0, 11, 6, 20, 58, 53, 0, 11, 6, 20, 58, 20, 6, 20, 6, 53, 0, 12, 6, 53, 0, 12, 6, 20, 58, 20, 58, 53, 0, 12, 6, 20, 58, 20, 58, 20, 6, 53, 0, 59, 47, 58, 51, 0, 59, 47, 58, 20, 58, 51, 0, 59, 47, 58, 20, 58, 20, 58, 51, 0, 59, 47, 58, 20, 58, 20, 58, 20, 58, 51, 0, 59, 47, 58, 20, 58, 20, 58, 20, 58, 20, 58, 51, 0, 43, 59, 0, 52, 59, 53, 0, 6, 0, 15, 0, 15, 23, 58, 24, 0, 19, 0, 52, 61, 53, 0, 61, 35, 61, 0, 59, 25, 61, 22, 61, 0, 8, 61, 20, 61, 53, 0, 8, 61, 20, 58, 20, 58, 53, 0 }; #endif #if FFDEBUG != 0 static const short ffrline[] = { 0, 241, 242, 245, 246, 252, 258, 264, 270, 273, 275, 288, 290, 303, 314, 328, 332, 336, 340, 342, 351, 354, 357, 366, 368, 370, 372, 374, 376, 379, 383, 385, 387, 389, 398, 400, 402, 405, 408, 411, 414, 417, 420, 422, 424, 426, 430, 434, 453, 472, 491, 504, 518, 530, 561, 659, 667, 729, 753, 755, 757, 759, 761, 763, 765, 767, 769, 773, 775, 777, 786, 789, 792, 795, 798, 801, 804, 807, 810, 813, 816, 819, 822, 825, 828, 831, 834, 837, 840, 843, 845, 847, 849, 852, 859, 876, 889, 902, 913, 929, 953, 981, 1018, 1022, 1026, 1029, 1033, 1037, 1040, 1044, 1046, 1048, 1050, 1052, 1054, 1056, 1060, 1063, 1065, 1074, 1076, 1078, 1087, 1106, 1125 }; #endif #if FFDEBUG != 0 || defined (FFERROR_VERBOSE) static const char * const fftname[] = { "$","error","$undefined.","BOOLEAN", "LONG","DOUBLE","STRING","BITSTR","FUNCTION","BFUNCTION","IFUNCTION","GTIFILTER", "REGFILTER","COLUMN","BCOLUMN","SCOLUMN","BITCOL","ROWREF","NULLREF","SNULLREF", "','","'='","':'","'{'","'}'","'?'","OR","AND","EQ","NE","'~'","GT","LT","LTE", "GTE","'+'","'-'","'%'","'*'","'/'","'|'","'&'","POWER","NOT","INTCAST","FLTCAST", "UMINUS","'['","ACCUM","DIFF","'\\n'","']'","'('","')'","lines","line","bvector", "vector","expr","bexpr","bits","sexpr", NULL }; #endif static const short ffr1[] = { 0, 54, 54, 55, 55, 55, 55, 55, 55, 56, 56, 57, 57, 57, 57, 58, 59, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 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, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 61, 61, 61, 61, 61, 61, 61, 61, 61 }; static const short ffr2[] = { 0, 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 }; static const short ffdefact[] = { 1, 0, 0, 67, 30, 31, 116, 17, 0, 0, 0, 0, 0, 32, 68, 117, 18, 34, 35, 119, 0, 0, 0, 0, 0, 0, 3, 0, 2, 0, 0, 0, 0, 0, 0, 8, 50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 102, 0, 0, 0, 0, 0, 11, 9, 0, 42, 43, 114, 28, 63, 64, 65, 66, 0, 0, 0, 0, 0, 16, 0, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 6, 0, 54, 0, 51, 53, 0, 52, 0, 95, 96, 97, 0, 0, 103, 0, 106, 0, 0, 0, 0, 44, 115, 29, 120, 14, 10, 12, 13, 0, 81, 82, 80, 76, 77, 79, 78, 37, 38, 36, 39, 45, 40, 41, 0, 0, 0, 0, 90, 89, 91, 92, 46, 0, 0, 0, 70, 71, 74, 72, 73, 75, 22, 21, 20, 0, 83, 84, 85, 87, 88, 86, 121, 0, 0, 0, 0, 0, 0, 0, 0, 33, 69, 118, 19, 0, 0, 58, 0, 0, 0, 0, 109, 28, 0, 0, 23, 0, 56, 98, 0, 123, 0, 55, 0, 104, 0, 93, 0, 47, 49, 48, 94, 122, 0, 0, 0, 0, 0, 0, 0, 0, 59, 0, 110, 0, 24, 0, 124, 0, 99, 0, 0, 107, 0, 0, 0, 0, 0, 0, 0, 0, 60, 0, 111, 0, 25, 57, 0, 105, 108, 0, 0, 0, 0, 0, 61, 0, 112, 0, 26, 0, 100, 0, 0, 0, 0, 62, 113, 27, 0, 0, 101, 0, 0 }; static const short ffdefgoto[] = { 1, 28, 29, 30, 45, 46, 43, 57 }; static const short ffpact[] = {-32768, 301, -41,-32768,-32768,-32768,-32768,-32768, 351, 402, 402, -5, 12, 8, 33, 34, 41,-32768,-32768,-32768, 402, 402, 402, 402, 402, 402,-32768, 402,-32768, -18, 9, 1092, 403, 1438, 79,-32768,-32768, 428, 143, 294, 10, 456, 224, 1478, 125, 1390, 1436, 1523, -6,-32768, 2, 402, 402, 402, 402, 1390, 1436, 1129, 19, 19, 20, 21, 19, 20, 19, 20, 623, 240, 344, 1120, 402, -32768, 402,-32768, 402, 402, 402, 402, 402, 402, 402, 402, 402, 402, 402, 402, 402, 402, 402,-32768, 402, 402, 402, 402, 402, 402, 402,-32768, -3, -3, -3, -3, -3, -3, -3, -3, -3, 402,-32768, 402, 402, 402, 402, 402, 402, 402,-32768, 402,-32768, 402,-32768, -32768, 402,-32768, 402,-32768,-32768,-32768, 402, 402,-32768, 402,-32768, 1266, 1286, 1306, 1326,-32768,-32768,-32768,-32768, 1390, 1436, 1390, 1436, 1348, 1503, 1503, 1503, 23, 23, 23, 23, 160, 160, 160, -15, 20, -15, -15, 732, 1370, 1413, 1531, 146, -13, -35, -35, -15, 756, -3, -3, -30, -30, -30, -30, -30, -30, 50, 21, 21, 780, 67, 67, 11, 11, 11, 11,-32768, 484, 1118, 1146, 1415, 1166, 1424, 512, 1186,-32768,-32768,-32768,-32768, 402, 402,-32768, 402, 402, 402, 402,-32768, 21, 1480, 402,-32768, 402,-32768,-32768, 402,-32768, 402,-32768, 66, -32768, 402, 1461, 804, 1461, 1436, 1461, 1436, 1129, 828, 852, 1206, 650, 540, 68, 568, 402,-32768, 402,-32768, 402,-32768, 402,-32768, 402,-32768, 86, 87,-32768, 876, 900, 924, 677, 1226, 52, 56, 402,-32768, 402,-32768, 402,-32768,-32768, 402,-32768,-32768, 948, 972, 996, 596, 402,-32768, 402,-32768, 402,-32768, 402,-32768, 1020, 1044, 1068, 1246,-32768,-32768,-32768, 402, 704,-32768, 126,-32768 }; static const short ffpgoto[] = {-32768, -32768,-32768,-32768, -1, 95, 124, 27 }; #define FFLAST 1566 static const short fftable[] = { 31, 48, 70, 95, 7, 104, 71, 37, 41, 35, 105, 106, 96, 16, 129, 93, 94, 107, 50, 55, 58, 59, 131, 62, 64, 95, 66, 87, 34, 72, 122, 51, 88, 73, 96, 40, 44, 47, 109, 110, 170, 111, 112, 113, 114, 115, 115, 130, 49, 171, 133, 134, 135, 136, 69, 132, 52, 53, 82, 83, 84, 85, 86, 123, 54, 87, 88, 96, 107, 141, 88, 143, 235, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 158, 159, 160, 247, 161, 105, 106, 255, 256, 168, 169, 32, 107, 111, 112, 113, 114, 115, 38, 42, 265, 181, 109, 110, 266, 111, 112, 113, 114, 115, 56, 189, 163, 60, 63, 65, 191, 67, 193, 0, 33, 290, 0, 195, 116, 196, 0, 39, 0, 0, 0, 182, 183, 184, 185, 186, 187, 188, 0, 0, 0, 0, 61, 0, 192, 0, 68, 0, 109, 110, 194, 111, 112, 113, 114, 115, 0, 0, 119, 0, 142, 0, 144, 90, 91, 92, 93, 94, 92, 93, 94, 0, 0, 127, 0, 157, 95, 0, 0, 95, 162, 164, 165, 166, 167, 96, 0, 0, 96, 0, 0, 120, 0, 85, 86, 223, 224, 87, 225, 227, 0, 230, 88, 0, 0, 231, 0, 232, 0, 190, 233, 0, 234, 0, 0, 0, 236, 172, 173, 174, 175, 176, 177, 178, 179, 180, 0, 0, 229, 0, 0, 250, 0, 251, 0, 252, 0, 253, 0, 254, 0, 0, 0, 0, 90, 91, 92, 93, 94, 0, 0, 267, 0, 268, 0, 269, 0, 95, 270, 0, 90, 91, 92, 93, 94, 279, 96, 280, 0, 281, 0, 282, 126, 95, 0, 0, 0, 0, 0, 0, 287, 0, 96, 0, 0, 0, 0, 0, 138, 209, 210, 0, 0, 0, 226, 228, 289, 2, 0, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 0, 98, 99, 20, 100, 101, 102, 103, 104, 0, 0, 0, 0, 105, 106, 21, 22, 0, 0, 0, 107, 0, 0, 23, 24, 25, 121, 0, 0, 0, 26, 0, 27, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 0, 98, 99, 20, 100, 101, 102, 103, 104, 0, 0, 0, 0, 105, 106, 21, 22, 0, 0, 0, 107, 0, 0, 23, 24, 25, 139, 0, 0, 0, 0, 0, 27, 36, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 0, 0, 0, 20, 0, 0, 90, 91, 92, 93, 94, 0, 0, 0, 0, 21, 22, 0, 0, 95, 0, 0, 0, 23, 24, 25, 117, 74, 96, 0, 0, 97, 27, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 124, 74, 0, 0, 0, 118, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 213, 74, 0, 0, 0, 125, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 220, 74, 0, 0, 0, 214, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 245, 74, 0, 0, 0, 221, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 248, 74, 0, 0, 0, 246, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 277, 74, 0, 0, 0, 249, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 74, 0, 0, 0, 0, 278, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 74, 0, 0, 0, 0, 137, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 74, 0, 0, 0, 0, 244, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 74, 0, 0, 0, 0, 263, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 202, 74, 0, 0, 0, 288, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 207, 74, 0, 88, 0, 0, 0, 203, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 211, 74, 0, 88, 0, 0, 0, 208, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 237, 74, 0, 88, 0, 0, 0, 212, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 239, 74, 0, 88, 0, 0, 0, 238, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 241, 74, 0, 88, 0, 0, 0, 240, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 257, 74, 0, 88, 0, 0, 0, 242, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 259, 74, 0, 88, 0, 0, 0, 258, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 261, 74, 0, 88, 0, 0, 0, 260, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 271, 74, 0, 88, 0, 0, 0, 262, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 273, 74, 0, 88, 0, 0, 0, 272, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 275, 74, 0, 88, 0, 0, 0, 274, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 74, 0, 88, 0, 0, 0, 276, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 74, 0, 88, 0, 0, 0, 283, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 74, 0, 88, 0, 0, 0, 284, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 74, 0, 88, 0, 0, 0, 285, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 0, 0, 88, 0, 0, 89, 90, 91, 92, 93, 94, 109, 110, 0, 111, 112, 113, 114, 115, 95, 109, 110, 0, 111, 112, 113, 114, 115, 96, 216, 74, 0, 0, 0, 215, 0, 140, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 218, 74, 87, 0, 0, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 222, 74, 87, 0, 0, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 243, 74, 87, 0, 0, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 264, 74, 87, 0, 0, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 286, 74, 87, 0, 0, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 74, 87, 0, 197, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 74, 87, 0, 198, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 74, 87, 0, 199, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 74, 87, 0, 200, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 74, 201, 0, 0, 88, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 74, 204, 0, 0, 88, 0, 0, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 74, 87, 0, 0, 0, 0, 88, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 205, 0, 88, 90, 91, 92, 93, 94, 109, 110, 0, 111, 112, 113, 114, 115, 95, 109, 110, 0, 111, 112, 113, 114, 115, 96, 90, 91, 92, 93, 94, 98, 99, 217, 100, 101, 102, 103, 104, 95, 0, 0, 219, 105, 106, 0, 0, 0, 96, 0, 107, 0, 0, 108, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 0, 0, 87, 0, 0, 98, 99, 88, 100, 101, 102, 103, 104, 0, 104, 0, 0, 105, 106, 105, 106, 0, 0, 0, 107, 0, 107, 0, 0, 0, 0, 0, 139, 78, 79, 80, 81, 82, 83, 84, 85, 86, 128, 0, 87, 0, 0, 0, 0, 88, 109, 110, 206, 111, 112, 113, 114, 115, 109, 110, 0, 111, 112, 113, 114, 115 }; static const short ffcheck[] = { 1, 6, 20, 38, 7, 35, 24, 8, 9, 50, 40, 41, 47, 16, 20, 28, 29, 47, 6, 20, 21, 22, 20, 24, 25, 38, 27, 42, 1, 20, 20, 23, 47, 24, 47, 8, 9, 10, 28, 29, 43, 31, 32, 33, 34, 35, 35, 53, 53, 52, 51, 52, 53, 54, 27, 53, 23, 23, 35, 36, 37, 38, 39, 53, 23, 42, 47, 47, 47, 70, 47, 72, 6, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 20, 90, 40, 41, 6, 6, 95, 96, 1, 47, 31, 32, 33, 34, 35, 8, 9, 53, 107, 28, 29, 53, 31, 32, 33, 34, 35, 20, 117, 90, 23, 24, 25, 122, 27, 124, -1, 1, 0, -1, 129, 50, 131, -1, 8, -1, -1, -1, 109, 110, 111, 112, 113, 114, 115, -1, -1, -1, -1, 23, -1, 122, -1, 27, -1, 28, 29, 128, 31, 32, 33, 34, 35, -1, -1, 20, -1, 70, -1, 72, 25, 26, 27, 28, 29, 27, 28, 29, -1, -1, 53, -1, 85, 38, -1, -1, 38, 90, 91, 92, 93, 94, 47, -1, -1, 47, -1, -1, 53, -1, 38, 39, 201, 202, 42, 204, 205, -1, 207, 47, -1, -1, 211, -1, 213, -1, 119, 216, -1, 218, -1, -1, -1, 222, 98, 99, 100, 101, 102, 103, 104, 105, 106, -1, -1, 206, -1, -1, 237, -1, 239, -1, 241, -1, 243, -1, 245, -1, -1, -1, -1, 25, 26, 27, 28, 29, -1, -1, 257, -1, 259, -1, 261, -1, 38, 264, -1, 25, 26, 27, 28, 29, 271, 47, 273, -1, 275, -1, 277, 53, 38, -1, -1, -1, -1, -1, -1, 286, -1, 47, -1, -1, -1, -1, -1, 53, 170, 171, -1, -1, -1, 204, 205, 0, 1, -1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, -1, 28, 29, 23, 31, 32, 33, 34, 35, -1, -1, -1, -1, 40, 41, 35, 36, -1, -1, -1, 47, -1, -1, 43, 44, 45, 53, -1, -1, -1, 50, -1, 52, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, -1, 28, 29, 23, 31, 32, 33, 34, 35, -1, -1, -1, -1, 40, 41, 35, 36, -1, -1, -1, 47, -1, -1, 43, 44, 45, 53, -1, -1, -1, -1, -1, 52, 53, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, -1, -1, -1, 23, -1, -1, 25, 26, 27, 28, 29, -1, -1, -1, -1, 35, 36, -1, -1, 38, -1, -1, -1, 43, 44, 45, 20, 21, 47, -1, -1, 50, 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, -1, -1, -1, -1, 47, -1, -1, 50, 25, 26, 27, 28, 29, 28, 29, -1, 31, 32, 33, 34, 35, 38, 28, 29, -1, 31, 32, 33, 34, 35, 47, 20, 21, -1, -1, -1, 53, -1, 53, 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, 22, -1, 47, 25, 26, 27, 28, 29, 28, 29, -1, 31, 32, 33, 34, 35, 38, 28, 29, -1, 31, 32, 33, 34, 35, 47, 25, 26, 27, 28, 29, 28, 29, 53, 31, 32, 33, 34, 35, 38, -1, -1, 53, 40, 41, -1, -1, -1, 47, -1, 47, -1, -1, 50, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, -1, -1, 42, -1, -1, 28, 29, 47, 31, 32, 33, 34, 35, -1, 35, -1, -1, 40, 41, 40, 41, -1, -1, -1, 47, -1, 47, -1, -1, -1, -1, -1, 53, 31, 32, 33, 34, 35, 36, 37, 38, 39, 20, -1, 42, -1, -1, -1, -1, 47, 28, 29, 22, 31, 32, 33, 34, 35, 28, 29, -1, 31, 32, 33, 34, 35 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr1/local/share/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 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 2, 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, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* As a special exception, when this file is copied by Bison into a Bison output file, you may use that output file without restriction. This special exception was added by the Free Software Foundation in version 1.24 of Bison. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void *alloca (unsigned int); }; #else /* not __cplusplus */ void *alloca (); #endif /* not __cplusplus */ #endif /* __hpux */ #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc. */ #endif /* not GNU C. */ #endif /* alloca not defined. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define fferrok (fferrstatus = 0) #define ffclearin (ffchar = FFEMPTY) #define FFEMPTY -2 #define FFEOF 0 #define FFACCEPT return(0) #define FFABORT return(1) #define FFERROR goto fferrlab1 /* 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); \ ffchar1 = FFTRANSLATE (ffchar); \ FFPOPSTACK; \ goto ffbackup; \ } \ else \ { fferror ("syntax error: cannot back up"); FFERROR; } \ while (0) #define FFTERROR 1 #define FFERRCODE 256 #ifndef FFPURE #define FFLEX fflex() #endif #ifdef FFPURE #ifdef FFLSP_NEEDED #ifdef FFLEX_PARAM #define FFLEX fflex(&fflval, &fflloc, FFLEX_PARAM) #else #define FFLEX fflex(&fflval, &fflloc) #endif #else /* not FFLSP_NEEDED */ #ifdef FFLEX_PARAM #define FFLEX fflex(&fflval, FFLEX_PARAM) #else #define FFLEX fflex(&fflval) #endif #endif /* not FFLSP_NEEDED */ #endif /* If nonreentrant, generate the variables here */ #ifndef FFPURE int ffchar; /* the lookahead symbol */ FFSTYPE fflval; /* the semantic value of the */ /* lookahead symbol */ #ifdef FFLSP_NEEDED FFLTYPE fflloc; /* location data for the lookahead */ /* symbol */ #endif int ffnerrs; /* number of parse errors so far */ #endif /* not FFPURE */ #if FFDEBUG != 0 int ffdebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* FFINITDEPTH indicates the initial size of the parser's stacks */ #ifndef FFINITDEPTH #define FFINITDEPTH 200 #endif /* FFMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if FFMAXDEPTH == 0 #undef FFMAXDEPTH #endif #ifndef FFMAXDEPTH #define FFMAXDEPTH 10000 #endif /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ int ffparse (void); #endif #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __ff_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __ff_memcpy (to, from, count) char *to; char *from; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __ff_memcpy (char *to, char *from, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 196 "/usr1/local/share/bison.simple" /* The user can define FFPARSE_PARAM as the name of an argument to be passed into ffparse. The argument should have type void *. It should actually point to an object. Grammar actions can access the variable by casting it to the proper pointer type. */ #ifdef FFPARSE_PARAM #ifdef __cplusplus #define FFPARSE_PARAM_ARG void *FFPARSE_PARAM #define FFPARSE_PARAM_DECL #else /* not __cplusplus */ #define FFPARSE_PARAM_ARG FFPARSE_PARAM #define FFPARSE_PARAM_DECL void *FFPARSE_PARAM; #endif /* not __cplusplus */ #else /* not FFPARSE_PARAM */ #define FFPARSE_PARAM_ARG #define FFPARSE_PARAM_DECL #endif /* not FFPARSE_PARAM */ int ffparse(FFPARSE_PARAM_ARG) FFPARSE_PARAM_DECL { register int ffstate; register int ffn; register short *ffssp; register FFSTYPE *ffvsp; int fferrstatus; /* number of tokens to shift before error messages enabled */ int ffchar1 = 0; /* lookahead token as an internal (translated) token number */ short ffssa[FFINITDEPTH]; /* the state stack */ FFSTYPE ffvsa[FFINITDEPTH]; /* the semantic value stack */ short *ffss = ffssa; /* refer to the stacks thru separate pointers */ FFSTYPE *ffvs = ffvsa; /* to allow ffoverflow to reallocate them elsewhere */ #ifdef FFLSP_NEEDED FFLTYPE fflsa[FFINITDEPTH]; /* the location stack */ FFLTYPE *ffls = fflsa; FFLTYPE *fflsp; #define FFPOPSTACK (ffvsp--, ffssp--, fflsp--) #else #define FFPOPSTACK (ffvsp--, ffssp--) #endif int ffstacksize = FFINITDEPTH; #ifdef FFPURE int ffchar; FFSTYPE fflval; int ffnerrs; #ifdef FFLSP_NEEDED FFLTYPE fflloc; #endif #endif FFSTYPE ffval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int fflen; #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Starting parse\n"); #endif 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 - 1; ffvsp = ffvs; #ifdef FFLSP_NEEDED fflsp = ffls; #endif /* Push a new state, which is found in ffstate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ ffnewstate: *++ffssp = ffstate; if (ffssp >= ffss + ffstacksize - 1) { /* 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; short *ffss1 = ffss; #ifdef FFLSP_NEEDED FFLTYPE *ffls1 = ffls; #endif /* Get the current used size of the three stacks, in elements. */ int size = ffssp - ffss + 1; #ifdef ffoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef FFLSP_NEEDED /* This used to be a conditional around just the two extra args, but that might be undefined if ffoverflow is a macro. */ ffoverflow("parser stack overflow", &ffss1, size * sizeof (*ffssp), &ffvs1, size * sizeof (*ffvsp), &ffls1, size * sizeof (*fflsp), &ffstacksize); #else ffoverflow("parser stack overflow", &ffss1, size * sizeof (*ffssp), &ffvs1, size * sizeof (*ffvsp), &ffstacksize); #endif ffss = ffss1; ffvs = ffvs1; #ifdef FFLSP_NEEDED ffls = ffls1; #endif #else /* no ffoverflow */ /* Extend the stack our own way. */ if (ffstacksize >= FFMAXDEPTH) { fferror("parser stack overflow"); return 2; } ffstacksize *= 2; if (ffstacksize > FFMAXDEPTH) ffstacksize = FFMAXDEPTH; ffss = (short *) alloca (ffstacksize * sizeof (*ffssp)); __ff_memcpy ((char *)ffss, (char *)ffss1, size * sizeof (*ffssp)); ffvs = (FFSTYPE *) alloca (ffstacksize * sizeof (*ffvsp)); __ff_memcpy ((char *)ffvs, (char *)ffvs1, size * sizeof (*ffvsp)); #ifdef FFLSP_NEEDED ffls = (FFLTYPE *) alloca (ffstacksize * sizeof (*fflsp)); __ff_memcpy ((char *)ffls, (char *)ffls1, size * sizeof (*fflsp)); #endif #endif /* no ffoverflow */ ffssp = ffss + size - 1; ffvsp = ffvs + size - 1; #ifdef FFLSP_NEEDED fflsp = ffls + size - 1; #endif #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Stack size increased to %d\n", ffstacksize); #endif if (ffssp >= ffss + ffstacksize - 1) FFABORT; } #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Entering state %d\n", ffstate); #endif goto ffbackup; ffbackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* ffresume: */ /* First try to decide what to do without reference to lookahead token. */ ffn = ffpact[ffstate]; if (ffn == FFFLAG) goto ffdefault; /* Not known => get a lookahead token if don't already have one. */ /* ffchar is either FFEMPTY or FFEOF or a valid token in external form. */ if (ffchar == FFEMPTY) { #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Reading a token: "); #endif ffchar = FFLEX; } /* Convert token to internal form (in ffchar1) for indexing tables with */ if (ffchar <= 0) /* This means end of input. */ { ffchar1 = 0; ffchar = FFEOF; /* Don't call FFLEX any more */ #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { ffchar1 = FFTRANSLATE(ffchar); #if FFDEBUG != 0 if (ffdebug) { fprintf (stderr, "Next token is %d (%s", ffchar, fftname[ffchar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ #ifdef FFPRINT FFPRINT (stderr, ffchar, fflval); #endif fprintf (stderr, ")\n"); } #endif } ffn += ffchar1; if (ffn < 0 || ffn > FFLAST || ffcheck[ffn] != ffchar1) goto ffdefault; ffn = fftable[ffn]; /* ffn is what to do for this token type in this state. Negative => reduce, -ffn is rule number. Positive => shift, ffn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (ffn < 0) { if (ffn == FFFLAG) goto fferrlab; ffn = -ffn; goto ffreduce; } else if (ffn == 0) goto fferrlab; if (ffn == FFFINAL) FFACCEPT; /* Shift the lookahead token. */ #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Shifting token %d (%s), ", ffchar, fftname[ffchar1]); #endif /* Discard the token being shifted unless it is eof. */ if (ffchar != FFEOF) ffchar = FFEMPTY; *++ffvsp = fflval; #ifdef FFLSP_NEEDED *++fflsp = fflloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (fferrstatus) fferrstatus--; ffstate = ffn; goto ffnewstate; /* Do the default action for the current state. */ ffdefault: ffn = ffdefact[ffstate]; if (ffn == 0) goto fferrlab; /* Do a reduction. ffn is the number of a rule to reduce with. */ ffreduce: fflen = ffr2[ffn]; if (fflen > 0) ffval = ffvsp[1-fflen]; /* implement default value of the action */ #if FFDEBUG != 0 if (ffdebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", ffn, ffrline[ffn]); /* Print the symbols being reduced, and their result. */ for (i = ffprhs[ffn]; ffrhs[i] > 0; i++) fprintf (stderr, "%s ", fftname[ffrhs[i]]); fprintf (stderr, " -> %s\n", fftname[ffr1[ffn]]); } #endif switch (ffn) { case 3: #line 245 "eval.y" {; break;} case 4: #line 247 "eval.y" { if( ffvsp[-1].Node<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = ffvsp[-1].Node; ; break;} case 5: #line 253 "eval.y" { if( ffvsp[-1].Node<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = ffvsp[-1].Node; ; break;} case 6: #line 259 "eval.y" { if( ffvsp[-1].Node<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = ffvsp[-1].Node; ; break;} case 7: #line 265 "eval.y" { if( ffvsp[-1].Node<0 ) { fferror("Couldn't build node structure: out of memory?"); FFERROR; } gParse.resultNode = ffvsp[-1].Node; ; break;} case 8: #line 270 "eval.y" { fferrok; ; break;} case 9: #line 274 "eval.y" { ffval.Node = New_Vector( ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 10: #line 276 "eval.y" { if( gParse.Nodes[ffvsp[-2].Node].nSubNodes >= MAXSUBS ) { ffvsp[-2].Node = Close_Vec( ffvsp[-2].Node ); TEST(ffvsp[-2].Node); ffval.Node = New_Vector( ffvsp[-2].Node ); TEST(ffval.Node); } else { ffval.Node = ffvsp[-2].Node; } gParse.Nodes[ffval.Node].SubNodes[ gParse.Nodes[ffval.Node].nSubNodes++ ] = ffvsp[0].Node; ; break;} case 11: #line 289 "eval.y" { ffval.Node = New_Vector( ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 12: #line 291 "eval.y" { if( TYPE(ffvsp[-2].Node) < TYPE(ffvsp[0].Node) ) TYPE(ffvsp[-2].Node) = TYPE(ffvsp[0].Node); if( gParse.Nodes[ffvsp[-2].Node].nSubNodes >= MAXSUBS ) { ffvsp[-2].Node = Close_Vec( ffvsp[-2].Node ); TEST(ffvsp[-2].Node); ffval.Node = New_Vector( ffvsp[-2].Node ); TEST(ffval.Node); } else { ffval.Node = ffvsp[-2].Node; } gParse.Nodes[ffval.Node].SubNodes[ gParse.Nodes[ffval.Node].nSubNodes++ ] = ffvsp[0].Node; ; break;} case 13: #line 304 "eval.y" { if( gParse.Nodes[ffvsp[-2].Node].nSubNodes >= MAXSUBS ) { ffvsp[-2].Node = Close_Vec( ffvsp[-2].Node ); TEST(ffvsp[-2].Node); ffval.Node = New_Vector( ffvsp[-2].Node ); TEST(ffval.Node); } else { ffval.Node = ffvsp[-2].Node; } gParse.Nodes[ffval.Node].SubNodes[ gParse.Nodes[ffval.Node].nSubNodes++ ] = ffvsp[0].Node; ; break;} case 14: #line 315 "eval.y" { TYPE(ffvsp[-2].Node) = TYPE(ffvsp[0].Node); if( gParse.Nodes[ffvsp[-2].Node].nSubNodes >= MAXSUBS ) { ffvsp[-2].Node = Close_Vec( ffvsp[-2].Node ); TEST(ffvsp[-2].Node); ffval.Node = New_Vector( ffvsp[-2].Node ); TEST(ffval.Node); } else { ffval.Node = ffvsp[-2].Node; } gParse.Nodes[ffval.Node].SubNodes[ gParse.Nodes[ffval.Node].nSubNodes++ ] = ffvsp[0].Node; ; break;} case 15: #line 329 "eval.y" { ffval.Node = Close_Vec( ffvsp[-1].Node ); TEST(ffval.Node); ; break;} case 16: #line 333 "eval.y" { ffval.Node = Close_Vec( ffvsp[-1].Node ); TEST(ffval.Node); ; break;} case 17: #line 337 "eval.y" { ffval.Node = New_Const( BITSTR, ffvsp[0].str, strlen(ffvsp[0].str)+1 ); TEST(ffval.Node); SIZE(ffval.Node) = strlen(ffvsp[0].str); ; break;} case 18: #line 341 "eval.y" { ffval.Node = New_Column( ffvsp[0].lng ); TEST(ffval.Node); ; break;} case 19: #line 343 "eval.y" { if( TYPE(ffvsp[-1].Node) != LONG || OPER(ffvsp[-1].Node) != CONST_OP ) { fferror("Offset argument must be a constant integer"); FFERROR; } ffval.Node = New_Offset( ffvsp[-3].lng, ffvsp[-1].Node ); TEST(ffval.Node); ; break;} case 20: #line 352 "eval.y" { ffval.Node = New_BinOp( BITSTR, ffvsp[-2].Node, '&', ffvsp[0].Node ); TEST(ffval.Node); SIZE(ffval.Node) = ( SIZE(ffvsp[-2].Node)>SIZE(ffvsp[0].Node) ? SIZE(ffvsp[-2].Node) : SIZE(ffvsp[0].Node) ); ; break;} case 21: #line 355 "eval.y" { ffval.Node = New_BinOp( BITSTR, ffvsp[-2].Node, '|', ffvsp[0].Node ); TEST(ffval.Node); SIZE(ffval.Node) = ( SIZE(ffvsp[-2].Node)>SIZE(ffvsp[0].Node) ? SIZE(ffvsp[-2].Node) : SIZE(ffvsp[0].Node) ); ; break;} case 22: #line 358 "eval.y" { if (SIZE(ffvsp[-2].Node)+SIZE(ffvsp[0].Node) >= MAX_STRLEN) { fferror("Combined bit string size exceeds " MAX_STRLEN_S " bits"); FFERROR; } ffval.Node = New_BinOp( BITSTR, ffvsp[-2].Node, '+', ffvsp[0].Node ); TEST(ffval.Node); SIZE(ffval.Node) = SIZE(ffvsp[-2].Node) + SIZE(ffvsp[0].Node); ; break;} case 23: #line 367 "eval.y" { ffval.Node = New_Deref( ffvsp[-3].Node, 1, ffvsp[-1].Node, 0, 0, 0, 0 ); TEST(ffval.Node); ; break;} case 24: #line 369 "eval.y" { ffval.Node = New_Deref( ffvsp[-5].Node, 2, ffvsp[-3].Node, ffvsp[-1].Node, 0, 0, 0 ); TEST(ffval.Node); ; break;} case 25: #line 371 "eval.y" { ffval.Node = New_Deref( ffvsp[-7].Node, 3, ffvsp[-5].Node, ffvsp[-3].Node, ffvsp[-1].Node, 0, 0 ); TEST(ffval.Node); ; break;} case 26: #line 373 "eval.y" { ffval.Node = New_Deref( ffvsp[-9].Node, 4, ffvsp[-7].Node, ffvsp[-5].Node, ffvsp[-3].Node, ffvsp[-1].Node, 0 ); TEST(ffval.Node); ; break;} case 27: #line 375 "eval.y" { ffval.Node = New_Deref( ffvsp[-11].Node, 5, ffvsp[-9].Node, ffvsp[-7].Node, ffvsp[-5].Node, ffvsp[-3].Node, ffvsp[-1].Node ); TEST(ffval.Node); ; break;} case 28: #line 377 "eval.y" { ffval.Node = New_Unary( BITSTR, NOT, ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 29: #line 380 "eval.y" { ffval.Node = ffvsp[-1].Node; ; break;} case 30: #line 384 "eval.y" { ffval.Node = New_Const( LONG, &(ffvsp[0].lng), sizeof(long) ); TEST(ffval.Node); ; break;} case 31: #line 386 "eval.y" { ffval.Node = New_Const( DOUBLE, &(ffvsp[0].dbl), sizeof(double) ); TEST(ffval.Node); ; break;} case 32: #line 388 "eval.y" { ffval.Node = New_Column( ffvsp[0].lng ); TEST(ffval.Node); ; break;} case 33: #line 390 "eval.y" { if( TYPE(ffvsp[-1].Node) != LONG || OPER(ffvsp[-1].Node) != CONST_OP ) { fferror("Offset argument must be a constant integer"); FFERROR; } ffval.Node = New_Offset( ffvsp[-3].lng, ffvsp[-1].Node ); TEST(ffval.Node); ; break;} case 34: #line 399 "eval.y" { ffval.Node = New_Func( LONG, row_fct, 0, 0, 0, 0, 0, 0, 0, 0 ); ; break;} case 35: #line 401 "eval.y" { ffval.Node = New_Func( LONG, null_fct, 0, 0, 0, 0, 0, 0, 0, 0 ); ; break;} case 36: #line 403 "eval.y" { PROMOTE(ffvsp[-2].Node,ffvsp[0].Node); ffval.Node = New_BinOp( TYPE(ffvsp[-2].Node), ffvsp[-2].Node, '%', ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 37: #line 406 "eval.y" { PROMOTE(ffvsp[-2].Node,ffvsp[0].Node); ffval.Node = New_BinOp( TYPE(ffvsp[-2].Node), ffvsp[-2].Node, '+', ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 38: #line 409 "eval.y" { PROMOTE(ffvsp[-2].Node,ffvsp[0].Node); ffval.Node = New_BinOp( TYPE(ffvsp[-2].Node), ffvsp[-2].Node, '-', ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 39: #line 412 "eval.y" { PROMOTE(ffvsp[-2].Node,ffvsp[0].Node); ffval.Node = New_BinOp( TYPE(ffvsp[-2].Node), ffvsp[-2].Node, '*', ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 40: #line 415 "eval.y" { PROMOTE(ffvsp[-2].Node,ffvsp[0].Node); ffval.Node = New_BinOp( TYPE(ffvsp[-2].Node), ffvsp[-2].Node, '/', ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 41: #line 418 "eval.y" { PROMOTE(ffvsp[-2].Node,ffvsp[0].Node); ffval.Node = New_BinOp( TYPE(ffvsp[-2].Node), ffvsp[-2].Node, POWER, ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 42: #line 421 "eval.y" { ffval.Node = ffvsp[0].Node; ; break;} case 43: #line 423 "eval.y" { ffval.Node = New_Unary( TYPE(ffvsp[0].Node), UMINUS, ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 44: #line 425 "eval.y" { ffval.Node = ffvsp[-1].Node; ; break;} case 45: #line 427 "eval.y" { ffvsp[0].Node = New_Unary( TYPE(ffvsp[-2].Node), 0, ffvsp[0].Node ); ffval.Node = New_BinOp( TYPE(ffvsp[-2].Node), ffvsp[-2].Node, '*', ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 46: #line 431 "eval.y" { ffvsp[-2].Node = New_Unary( TYPE(ffvsp[0].Node), 0, ffvsp[-2].Node ); ffval.Node = New_BinOp( TYPE(ffvsp[0].Node), ffvsp[-2].Node, '*', ffvsp[0].Node ); TEST(ffval.Node); ; break;} case 47: #line 435 "eval.y" { PROMOTE(ffvsp[-2].Node,ffvsp[0].Node); if( ! Test_Dims(ffvsp[-2].Node,ffvsp[0].Node) ) { fferror("Incompatible dimensions in '?:' arguments"); FFERROR; } ffval.Node = New_Func( 0, ifthenelse_fct, 3, ffvsp[-2].Node, ffvsp[0].Node, ffvsp[-4].Node, 0, 0, 0, 0 ); TEST(ffval.Node); if( SIZE(ffvsp[-2].Node)=SIZE(ffvsp[-1].Node) && Test_Dims( ffvsp[-3].Node, ffvsp[-1].Node ) ) { PROMOTE(ffvsp[-3].Node,ffvsp[-1].Node); ffval.Node = New_Func( 0, defnull_fct, 2, ffvsp[-3].Node, ffvsp[-1].Node, 0, 0, 0, 0, 0 ); TEST(ffval.Node); } else { fferror("Dimensions of DEFNULL arguments " "are not compatible"); FFERROR; } } else if (FSTRCMP(ffvsp[-4].str,"ARCTAN2(") == 0) { if( TYPE(ffvsp[-3].Node) != DOUBLE ) ffvsp[-3].Node = New_Unary( DOUBLE, 0, ffvsp[-3].Node ); if( TYPE(ffvsp[-1].Node) != DOUBLE ) ffvsp[-1].Node = New_Unary( DOUBLE, 0, ffvsp[-1].Node ); if( Test_Dims( ffvsp[-3].Node, ffvsp[-1].Node ) ) { ffval.Node = New_Func( 0, atan2_fct, 2, ffvsp[-3].Node, ffvsp[-1].Node, 0, 0, 0, 0, 0 ); TEST(ffval.Node); if( SIZE(ffvsp[-3].Node)=SIZE(ffvsp[-1].Node) && Test_Dims( ffvsp[-3].Node, ffvsp[-1].Node ) ) { ffval.Node = New_Func( 0, defnull_fct, 2, ffvsp[-3].Node, ffvsp[-1].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 99: #line 930 "eval.y" { if( TYPE(ffvsp[-5].Node) != DOUBLE ) ffvsp[-5].Node = New_Unary( DOUBLE, 0, ffvsp[-5].Node ); if( TYPE(ffvsp[-3].Node) != DOUBLE ) ffvsp[-3].Node = New_Unary( DOUBLE, 0, ffvsp[-3].Node ); if( TYPE(ffvsp[-1].Node) != DOUBLE ) ffvsp[-1].Node = New_Unary( DOUBLE, 0, ffvsp[-1].Node ); if( ! (Test_Dims( ffvsp[-5].Node, ffvsp[-3].Node ) && Test_Dims( ffvsp[-3].Node, ffvsp[-1].Node ) ) ) { fferror("Dimensions of NEAR arguments " "are not compatible"); FFERROR; } else { if (FSTRCMP(ffvsp[-6].str,"NEAR(") == 0) { ffval.Node = New_Func( BOOLEAN, near_fct, 3, ffvsp[-5].Node, ffvsp[-3].Node, ffvsp[-1].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[-2].Node, '+', ffvsp[0].Node ); TEST(ffval.Node); SIZE(ffval.Node) = SIZE(ffvsp[-2].Node) + SIZE(ffvsp[0].Node); ; break;} case 122: #line 1088 "eval.y" { int outSize; if( SIZE(ffvsp[-4].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[-2].Node); if (SIZE(ffvsp[0].Node) > outSize) outSize = SIZE(ffvsp[0].Node); ffval.Node = New_FuncSize( 0, ifthenelse_fct, 3, ffvsp[-2].Node, ffvsp[0].Node, ffvsp[-4].Node, 0, 0, 0, 0, outSize); TEST(ffval.Node); if( SIZE(ffvsp[-2].Node) outSize) outSize = SIZE(ffvsp[-1].Node); ffval.Node = New_FuncSize( 0, defnull_fct, 2, ffvsp[-3].Node, ffvsp[-1].Node, 0, 0, 0, 0, 0, outSize ); TEST(ffval.Node); if( SIZE(ffvsp[-1].Node)>SIZE(ffvsp[-3].Node) ) SIZE(ffval.Node) = SIZE(ffvsp[-1].Node); } else { fferror("Function(string,string) not supported"); FFERROR; } ; break;} case 124: #line 1126 "eval.y" { if (FSTRCMP(ffvsp[-6].str,"STRMID(") == 0) { int len; if( TYPE(ffvsp[-3].Node) != LONG || SIZE(ffvsp[-3].Node) != 1 || TYPE(ffvsp[-1].Node) != LONG || SIZE(ffvsp[-1].Node) != 1) { fferror("When using STRMID(S,P,N), P and N must be integers (and not vector columns)"); FFERROR; } if (OPER(ffvsp[-1].Node) == CONST_OP) { /* Constant value: use that directly */ len = (gParse.Nodes[ffvsp[-1].Node].value.data.lng); } else { /* Variable value: use the maximum possible (from $2) */ len = SIZE(ffvsp[-5].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[-5].Node, ffvsp[-3].Node,ffvsp[-1].Node,0,0,0,0,len); TEST(ffval.Node); } else { fferror("Function(string,expr,expr) not supported"); FFERROR; } ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 498 "/usr1/local/share/bison.simple" ffvsp -= fflen; ffssp -= fflen; #ifdef FFLSP_NEEDED fflsp -= fflen; #endif #if FFDEBUG != 0 if (ffdebug) { short *ssp1 = ffss - 1; fprintf (stderr, "state stack now"); while (ssp1 != ffssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++ffvsp = ffval; #ifdef FFLSP_NEEDED fflsp++; if (fflen == 0) { fflsp->first_line = fflloc.first_line; fflsp->first_column = fflloc.first_column; fflsp->last_line = (fflsp-1)->last_line; fflsp->last_column = (fflsp-1)->last_column; fflsp->text = 0; } else { fflsp->last_line = (fflsp+fflen-1)->last_line; fflsp->last_column = (fflsp+fflen-1)->last_column; } #endif /* 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 - FFNTBASE] + *ffssp; if (ffstate >= 0 && ffstate <= FFLAST && ffcheck[ffstate] == *ffssp) ffstate = fftable[ffstate]; else ffstate = ffdefgoto[ffn - FFNTBASE]; goto ffnewstate; fferrlab: /* here on detecting error */ if (! fferrstatus) /* If not already recovering from an error, report this error. */ { ++ffnerrs; #ifdef FFERROR_VERBOSE ffn = ffpact[ffstate]; if (ffn > FFFLAG && ffn < FFLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -ffn if nec to avoid negative indexes in ffcheck. */ for (x = (ffn < 0 ? -ffn : 0); x < (sizeof(fftname) / sizeof(char *)); x++) if (ffcheck[x + ffn] == x) size += strlen(fftname[x]) + 15, count++; msg = (char *) malloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (ffn < 0 ? -ffn : 0); x < (sizeof(fftname) / sizeof(char *)); x++) if (ffcheck[x + ffn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, fftname[x]); strcat(msg, "'"); count++; } } fferror(msg); free(msg); } else fferror ("parse error; also virtual memory exceeded"); } else #endif /* FFERROR_VERBOSE */ fferror("parse error"); } goto fferrlab1; fferrlab1: /* here on error raised explicitly by an action */ if (fferrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (ffchar == FFEOF) FFABORT; #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Discarding token %d (%s).\n", ffchar, fftname[ffchar1]); #endif ffchar = FFEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ fferrstatus = 3; /* Each real token shifted decrements this */ goto fferrhandle; fferrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ ffn = ffdefact[ffstate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (ffn) goto ffdefault; #endif fferrpop: /* pop the current state because it cannot handle the error token */ if (ffssp == ffss) FFABORT; ffvsp--; ffstate = *--ffssp; #ifdef FFLSP_NEEDED fflsp--; #endif #if FFDEBUG != 0 if (ffdebug) { short *ssp1 = ffss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != ffssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif fferrhandle: ffn = ffpact[ffstate]; if (ffn == FFFLAG) goto fferrdefault; ffn += FFTERROR; if (ffn < 0 || ffn > FFLAST || ffcheck[ffn] != FFTERROR) goto fferrdefault; ffn = fftable[ffn]; if (ffn < 0) { if (ffn == FFFLAG) goto fferrpop; ffn = -ffn; goto ffreduce; } else if (ffn == 0) goto fferrpop; if (ffn == FFFINAL) FFACCEPT; #if FFDEBUG != 0 if (ffdebug) fprintf(stderr, "Shifting error token, "); #endif *++ffvsp = fflval; #ifdef FFLSP_NEEDED *++fflsp = fflloc; #endif ffstate = ffn; goto ffnewstate; } #line 1155 "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; 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 */ /* This (commented out) algorithm uses the Low of Cosines, which becomes unstable for angles less than 0.1 arcsec. cd = sin(dec1*deg)*sin(dec2*deg) + cos(dec1*deg)*cos(dec2*deg)*cos((ra1-ra2)*deg); if (cd < (-1)) cd = -1; if (cd > (+1)) cd = +1; return acos(cd)/deg; */ /* 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 double ran1() { static double dval = 0.0; double rndVal; if (dval == 0.0) { if( rand()<32768 && rand()<32768 ) dval = 32768.0; else dval = 2147483648.0; } rndVal = (double)rand(); while( rndVal > dval ) dval *= 2.0; return rndVal/dval; } /* Gaussian deviate routine from Numerical Recipes */ static double gasdev() { static int iset = 0; static double gset; double fac, rsq, v1, v2; if (iset == 0) { do { v1 = 2.0*ran1()-1.0; v2 = 2.0*ran1()-1.0; rsq = v1*v1 + v2*v2; } while (rsq >= 1.0 || rsq == 0.0); fac = sqrt(-2.0*log(rsq)/rsq); gset = v1*fac; iset = 1; return v2*fac; } else { iset = 0; return gset; } } /* lgamma function - from Numerical Recipes */ float gammaln(float xx) /* Returns the value ln Gamma[(xx)] for xx > 0. */ { /* Internal arithmetic will be done in double precision, a nicety that you can omit if five-figure accuracy is good enough. */ double x,y,tmp,ser; static double cof[6]={76.18009172947146,-86.50532032941677, 24.01409824083091,-1.231739572450155, 0.1208650973866179e-2,-0.5395239384953e-5}; int j; y=x=xx; tmp=x+5.5; tmp -= (x+0.5)*log(tmp); ser=1.000000000190015; for (j=0;j<=5;j++) ser += cof[j]/++y; return (float) -tmp+log(2.5066282746310005*ser/x); } /* Poisson deviate - derived from Numerical Recipes */ static long poidev(double xm) { static double sq, alxm, g, oldm = -1.0; static double pi = 0; double em, t, y; if (pi == 0) pi = ((double)4)*atan((double)1); if (xm < 20.0) { if (xm != oldm) { oldm = xm; g = exp(-xm); } em = -1; t = 1.0; do { em += 1; t *= ran1(); } while (t > g); } else { if (xm != oldm) { oldm = xm; sq = sqrt(2.0*xm); alxm = log(xm); g = xm*alxm-gammaln( (float) (xm+1.0)); } do { do { y = tan(pi*ran1()); em = sq*y+xm; } while (em < 0.0); em = floor(em); t = 0.9*(1.0+y*y)*exp(em*alxm-gammaln( (float) (em+1.0) )-g); } while (ran1() > t); } /* Return integer version */ return (long int) floor(em+0.5); } 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 = poidev(pVals[0].data.dbl); else this->value.data.lng = poidev(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] = ran1(); this->value.undef[elem] = 0; } break; case gasrnd_fct: while( elem-- ) { this->value.data.dblptr[elem] = gasdev(); 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] = poidev(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] = poidev(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] = poidev(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] = poidev(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[256]; char chr1, chr2; l1 = strlen(bits1); l2 = strlen(bits2); if (l1 < l2) { length = 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) { length = l1; ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bits2++); stream[i] = '\0'; bits2 = stream; } else length = l1; 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; } return (result); } static void bitand(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff; char stream[256]; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); 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++; } *result = '\0'; } static void bitor(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff; char stream[256]; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); 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++; } *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; char stream[256]; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); 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')) ) return( 0 ); } 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); } healpy-1.8.1/cfitsio/iter_b.f0000654000175000017530000001305712272000775016476 0ustar zoncaplanck00000000000000 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 healpy-1.8.1/cfitsio/group.h0000654000175000017530000000360612272000775016367 0ustar zoncaplanck00000000000000#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 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, 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, char *outpath, int *status); int fits_unencode_url(char *inpath, char *outpath, int *status); int fits_is_url_absolute(char *url); healpy-1.8.1/cfitsio/fpack.c0000654000175000017530000003451012272000775016310 0ustar zoncaplanck00000000000000/* 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; 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; fp_msg ("Note: -tableonly is intended for feasibility studies, not general use.\n"); } else if (!strcmp(argv[iarg], "-table")) { fpptr->do_tables = 1; fp_msg ("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); /* checked below */ } 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 (++iarg >= argc) { fp_usage (); fp_hint (); exit (-1); } else strncpy (fpptr->outfile, argv[iarg], SZ_STR); } else if (argv[iarg][1] == 'H') { fp_help (); exit (0); } else if (argv[iarg][1] == 'V') { fp_version (); exit (0); } else { fp_msg ("Error: unknown command line flag `"); fp_msg (argv[iarg]); fp_msg ("'\n"); fp_usage (); fp_hint (); exit (-1); } } else break; } 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="); sprintf (tmp, "%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] [-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 using prototype method, as well as compress\n"); fp_msg (" any image HDUs. This option is intended for experimental use.\n"); fp_msg (" -tableonly Compress only FITS binary tables using prototype method; do not compress\n"); fp_msg (" any image HDUs. This option is intended for experimental use.\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 (" -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); } healpy-1.8.1/cfitsio/putcolu.c0000654000175000017530000005177712272000775016735 0ustar zoncaplanck00000000000000/* 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 */ sprintf(message, "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 */ { sprintf(message, "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 ffswap4( (INT32BIT*) &i8null, 2); /* 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 */ sprintf(message, "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 */ { sprintf(message, "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; } healpy-1.8.1/cfitsio/iter_b.fit0000654000175000017530000143660012272000775017037 0ustar zoncaplanck00000000000000SIMPLE = 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 Thealpy-1.8.1/cfitsio/makepc.bat0000654000175000017530000000440312272000775017006 0ustar zoncaplanck00000000000000rem: 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 healpy-1.8.1/cfitsio/quantize.c0000654000175000017530000034727312272000775017101 0ustar zoncaplanck00000000000000/* 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 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++; 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++; 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 < 5) { /* 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 */ 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; } /* 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 */ 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 */ 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 */ 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 */ 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 + 8); 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 < 5) { /* 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 */ 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; } /* 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 */ 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 */ 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 */ 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 */ 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 + 8); 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 < 5) { /* 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 */ 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; } /* 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 */ 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 */ 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 */ 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 */ 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 + 8); 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 < 5) { /* 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 */ 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; } /* 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 */ 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 */ 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 */ 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 */ 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 + 8); 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 healpy-1.8.1/cfitsio/getcold.c0000654000175000017530000020333412272000775016647 0ustar zoncaplanck00000000000000/* 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) { sprintf(msg, "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 { sprintf(msg, "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) { sprintf(msg, "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]) { sprintf(msg, "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[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; /*----------------------------------------------------------------------*/ /* 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 */ sprintf(message, "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) sprintf(message, "Error reading elements %.0f thru %.0f from column %d (ffgcld).", dtemp+1., dtemp+ntodo, colnum); else sprintf(message, "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; 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 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 */ { memcpy(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[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); sprintf(message, "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); } healpy-1.8.1/cfitsio/getcols.c0000654000175000017530000007055212272000775016672 0ustar zoncaplanck00000000000000/* 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; 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; 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) { sprintf(message, "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); 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 sprintf(tmpstr, 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 sprintf(tmpstr, 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 sprintf(tmpstr, 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 sprintf(tmpstr, cform, darray[jj]); strncat(array[ii], tmpstr, dwidth); strcat(array[ii], ")"); jj++; } } free(darray); /* free the memory */ } else if (tcode == 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) { strcpy(tmpnull, nulval); nulwidth = strlen(nulval); } 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 */ sprintf(tmpstr, "%20I64d", llarray[ii]); #elif (USE_LL_SUFFIX == 1) sprintf(tmpstr, "%20lld", llarray[ii]); #else sprintf(tmpstr, "%20ld", llarray[ii]); #endif *array[ii] = '\0'; strncat(array[ii], tmpstr, 20); } } free(flgarray); free(llarray); /* 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 { 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) { strcpy(tmpnull, nulval); nulwidth = strlen(nulval); } 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) sprintf(tmpstr, cform, (int) darray[ii]); else sprintf(tmpstr, 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) { sprintf(message, "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 { 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' */ { 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) { sprintf(message, "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; sprintf(message, "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); } healpy-1.8.1/cfitsio/getcolsb.c0000654000175000017530000022324512272000775017033 0ustar zoncaplanck00000000000000/* 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) { sprintf(msg, "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 { sprintf(msg, "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) { sprintf(msg, "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]) { sprintf(msg, "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[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; 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 */ sprintf(message, "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) sprintf(message, "Error reading elements %.0f thru %.0f from column %d (ffgclsb).", dtemp+1., dtemp+ntodo, colnum); else sprintf(message, "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; 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 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[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; 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); sprintf(message, "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); } healpy-1.8.1/cfitsio/imcompress.c0000654000175000017530000127366012272000775017421 0ustar zoncaplanck00000000000000# 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); /* 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, tstatus; 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 (!strncasecmp(value, "'RICE_1", 7) ) { comptype = RICE_1; } else if (!strncasecmp(value, "'GZIP_1", 7) ) { comptype = GZIP_1; } else if (!strncasecmp(value, "'GZIP_2", 7) ) { comptype = GZIP_2; } else if (!strncasecmp(value, "'PLIO_1", 7) ) { comptype = PLIO_1; } else if (!strncasecmp(value, "'HCOMPRESS_1", 12) ) { comptype = HCOMPRESS_1; } else if (!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) ) { tstatus = 0; if (!strncasecmp(value, "'row", 4) ) { tiledim[0] = -1; } else if (!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 (!strncasecmp(value, "'no_dither", 10) ) { ivalue = -1; /* just quantize, with no dithering */ } else if (!strncasecmp(value, "'subtractive_dither_1", 21) ) { ivalue = SUBTRACTIVE_DITHER_1; /* use subtractive dithering */ } else if (!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 (!strncasecmp(value, "'checksum", 9) ) { ivalue = -1; /* use checksum of first tile */ } else if (!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 (!strcasecmp(value, "t") ) { fits_set_lossy_int (outfptr, 1, status); } else if (!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, 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 */ 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)->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) { if (naxis < 2 ) { ffpmsg("Hcompress cannot be used with 1-dimensional images (imcomp_init_table)"); return(*status = DATA_COMPRESSION_ERR); } else if (naxes[0] < 4 || naxes[1] < 4) { ffpmsg("Hcompress minimum image dimension is 4 pixels (imcomp_init_table)"); return(*status = DATA_COMPRESSION_ERR); } if ((actual_tilesize[0] <= 0) && (actual_tilesize[1] == -1) ){ /* compress the whole image as a single tile */ actual_tilesize[0] = naxes[0]; actual_tilesize[1] = naxes[1]; for (ii = 2; ii < naxis; ii++) { /* set all higher tile dimensions = 1 */ actual_tilesize[ii] = 1; } } else if ((actual_tilesize[0] <= 0) && (actual_tilesize[1] == 0 || actual_tilesize[1] == 1) ){ /* The Hcompress algorithm is inherently 2D in nature, so the row by row tiling that is used for other compression algorithms is not appropriate. If the image has less than 30 rows, then the entire image will be compressed as a single tile. Otherwise the tiles will consist of 16 rows of the image. This keeps the tiles to a reasonable size, and it also includes enough rows to allow good compression efficiency. If the last tile of the image happens to contain less than 4 rows, then find another tile size with between 14 and 30 rows (preferably even), so that the last tile has at least 4 rows */ /* 1st tile dimension is the row length of the image */ actual_tilesize[0] = naxes[0]; if (naxes[1] <= 30) { /* use whole image if it is small */ actual_tilesize[1] = naxes[1]; } else { /* look for another good tile dimension */ if (naxes[1] % 16 == 0 || naxes[1] % 16 > 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] < 4 || actual_tilesize[1] < 4) { /* user-specified tile size is too small */ 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[0] % (actual_tilesize[0]); /* 1st dimension */ if (remain > 0 && remain < 4) { (actual_tilesize[0])++; /* try increasing tile size by 1 */ remain = naxes[0] % (actual_tilesize[0]); 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[1] % (actual_tilesize[1]); /* 2nd dimension */ if (remain > 0 && remain < 4) { (actual_tilesize[1])++; /* try increasing tile size by 1 */ remain = naxes[1] % (actual_tilesize[1]); 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); } /* 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 */ 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++) { sprintf (keyname, "ZNAXIS%d", ii+1); ffpkyj (outfptr, keyname, naxes[ii], "length of original image axis", status); } } for (ii = 0; ii < naxis; ii++) { sprintf (keyname, "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; 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 */ if (anynul && datatype == TFLOAT) { imcomp_compress_tile(outfptr, row, datatype, tiledata, tilelen, tile[0], tile[1], 1, &fltnull, status); } else if (anynul && datatype == TDOUBLE) { imcomp_compress_tile(outfptr, row, datatype, tiledata, tilelen, tile[0], tile[1], 1, &dblnull, status); } else { imcomp_compress_tile(outfptr, row, datatype, tiledata, tilelen, tile[0], tile[1], 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)) { ffpmsg("Lossless compression of floating point images must use GZIP (imcomp_compress_tile)"); return(*status = DATA_COMPRESSION_ERR); } } /* 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 */ lldata = (LONGLONG *) idata; for (ii = tilelen - 1; ii >= 0; ii--) { lldata[ii] = idata[ii]; } 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 if (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 */ for (ii = tilelen - 1; ii >= 0; ii--) idata[ii] = (int) sbuff[ii]; } } 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 { /* just do the data type conversion to int */ for (ii = tilelen - 1; ii >= 0; ii--) idata[ii] = (int) sbuff[ii] + 32768; } } 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 */ for (ii = tilelen - 1; ii >= 0; ii--) idata[ii] = (int) sbuff[ii]; } } } 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 (ii = tilelen - 1; ii >= 0; ii--) idata[ii] = ((int) usbuff[ii]) - 32768; } } 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 */ for (ii = tilelen - 1; ii >= 0; ii--) idata[ii] = (int) usbbuff[ii]; } } 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 */ for (ii = tilelen - 1; ii >= 0; ii--) idata[ii] = ((int) sbbuff[ii]) + 128; } } 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; 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); /* compress the tile again, and write it back to the FITS file */ imcomp_compress_tile (fptr, irow, datatype, buffer, thistilesize[0], tlpixel[0] - tfpixel[0] + 1, tlpixel[1] - tfpixel[1] + 1, 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, pixlen, 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)); pixlen = sizeof(short); if (cnull) { if (cnull[0] == 0 && cnull[1] == 0 ) { nullcheck = 0; } } } else if (datatype == TINT) { buffer = malloc ((fptr->Fptr)->maxtilelen * sizeof (int)); pixlen = 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)); pixlen = 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)); pixlen = 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)); pixlen = 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)); pixlen = sizeof(short); if (cnull) { if (cnull[0] == 0 && cnull[1] == 0 ){ nullcheck = 0; } } } else if (datatype == TUINT) { buffer = malloc ((fptr->Fptr)->maxtilelen * sizeof (unsigned int)); pixlen = sizeof(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)); pixlen = sizeof(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)); pixlen = 1; 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; } 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 */ sprintf (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 */ sprintf (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 (strncasecmp(card2, "'NONE", 5) ) { /* the value is not 'NONE' */ fits_write_history(outfptr, "Image was compressed by CFITSIO using scaled integer quantization:", status); sprintf(card2, " 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", "-" }, {"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 nelem = 0, offset = 0, tilesize; /* number of bytes */ int smooth, nx, ny, scale; /* hcompress parameters */ 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 */ ffgdes (infptr, (infptr->Fptr)->cn_compressed, nrow, &nelem, &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 (nelem == 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 */ ffgdes (infptr, (infptr->Fptr)->cn_uncompressed, nrow, &nelem, &offset, status); if (nelem == 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, nelem, 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, nelem, 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 */ ffgdes (infptr, (infptr->Fptr)->cn_gzip_data, nrow, &nelem, &offset, status); if (nelem == 0 && offset == 0) /* this should never happen */ return (*status = NO_COMPRESSED_TILE); /* allocate memory for the compressed tile of data */ cbuf = (unsigned char *) malloc (nelem); 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, nelem, &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, nelem, (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, nelem, (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 (nelem * sizeof (short)); } else { cbuf = (unsigned char *) malloc (nelem); } 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, nelem, &snull, (short *) cbuf, NULL, status); } else { fits_read_col(infptr, TBYTE, (infptr->Fptr)->cn_compressed, nrow, 1, nelem, &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, nelem, (unsigned char *)idata, tilelen, blocksize); tiledatatype = TBYTE; } else if ((infptr->Fptr)->rice_bytepix == 2 ) { *status = fits_rdecomp_short (cbuf, nelem, (unsigned short *)idata, tilelen, blocksize); tiledatatype = TSHORT; } else { *status = fits_rdecomp (cbuf, nelem, (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, nelem, (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) nelem, 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 && bzero == 0. && actual_bzero == 32768.) { /* special case where unsigned 16-bit integers have been */ /* offset by +32768 when using PLIO */ fffi4i2(idata, tilelen, bscale, -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 = 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) 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) 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) 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) 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) 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) 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) 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 (!strcasecmp(tempstring, "NONE")) { default_algor = NOCOMPRESS; } else if (!strcasecmp(tempstring, "GZIP") || !strcasecmp(tempstring, "GZIP_1")) { default_algor = GZIP_1; } else if (!strcasecmp(tempstring, "GZIP_2")) { default_algor = GZIP_2; } else if (!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, TLONGLONG, "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 (!strcasecmp(tempstring, "GZIP") || !strcasecmp(tempstring, "GZIP_1")) { compalgor[ii] = GZIP_1; } else if (!strcasecmp(tempstring, "GZIP_2")) { compalgor[ii] = GZIP_2; } else if (!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 */ sprintf(results[ii],"%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; sprintf(tempstring," r=%6.2f",cratio[ii]); strcat(results[ii],tempstring); /* 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 */ sprintf(tempstring," r=%6.2f",cratio[ii]); strcat(results[ii],tempstring); } /* 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); } 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); } healpy-1.8.1/cfitsio/smem.c0000654000175000017530000000500412272000775016161 0ustar zoncaplanck00000000000000#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); } healpy-1.8.1/cfitsio/iter_c.c0000654000175000017530000001356712272000775016502 0ustar zoncaplanck00000000000000#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); } healpy-1.8.1/cfitsio/fitsio2.h0000654000175000017530000016327612272000775016624 0ustar zoncaplanck00000000000000#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) #else #define FFLOCK #define FFUNLOCK #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 1000 /* 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__) /* 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__) /* IBM 64-bit AIX powerpc*/ /* could also test for __ppc64__ or __PPC64 */ #define BYTESWAPPED FALSE #define MACHINE NATIVE #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 #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 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 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 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 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 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 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, 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, float *datamin, float *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 ffrhdu(fitsfile *fptr, int *hdutype, int *status); 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 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 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 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 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 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 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 fflongfi8(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 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 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 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 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); 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 *size), 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); /* 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 #if defined(vms) || defined(__vms) || defined(WIN32) || defined(__WIN32__) || (defined(macintosh) && !defined(TARGET_API_MAC_CARBON)) /* A hack for nonunix machines, which lack strcasecmp and strncasecmp */ int strcasecmp (const char *s1, const char *s2 ); int strncasecmp(const char *s1, const char *s2, size_t n); #endif /* end of the entire "ifndef _FITSIO2_H" block */ #endif healpy-1.8.1/cfitsio/f77_wrap4.c0000654000175000017530000004577612272000775016764 0ustar zoncaplanck00000000000000/************************************************************************ 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" /*********************************************************************/ /* Iterator Functions */ /*********************************************************************/ /* Use a simple ellipse prototype for Fwork_fn to satisfy finicky compilers */ typedef struct { void *userData; void (*Fwork_fn)(PLONG_cfTYPE *total_n, ...); } FtnUserData; /* Declare protoypes to make C++ happy */ int Cwork_fn(long, long, long, long, int, iteratorCol *, void *); void Cffiter( int n_cols, int *units, int *colnum, char *colname[], int *datatype, int *iotype, long offset, long n_per_loop, void *Fwork_fn, void *userData, int *status); /******************************************************************/ /* Cffiter is the wrapper for CFITSIO's ffiter which takes most */ /* of its arguments via a structure, iteratorCol. This routine */ /* takes a list of arrays and converts them into a single array */ /* of type iteratorCol and passes it to CFITSIO. Because ffiter */ /* will be passing control to a Fortran work function, the C */ /* wrapper, Cwork_fn, must be passed in its place which then */ /* calls the Fortran routine after the necessary data */ /* manipulation. The Fortran routine is passed via the user- */ /* supplied parameter pointer. */ /******************************************************************/ void Cffiter( int n_cols, int *units, int *colnum, char *colname[], int *datatype, int *iotype, long offset, long n_per_loop, void *Fwork_fn, void *userData, int *status) { iteratorCol *cols; int i; FtnUserData FuserData; FuserData.Fwork_fn = (void(*)(PLONG_cfTYPE *,...))Fwork_fn; FuserData.userData = userData; cols = (iteratorCol *)malloc( n_cols*sizeof(iteratorCol) ); if( cols==NULL ) { *status = MEMORY_ALLOCATION; return; } for(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;i #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) { sprintf(msg, "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]) { sprintf(msg, "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) { sprintf(msg, "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]) { sprintf(msg, "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[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 ( 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 */ sprintf(message, "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) sprintf(message, "Error reading elements %.0f thru %.0f from column %d (ffgclui).", dtemp+1., dtemp+ntodo, colnum); else sprintf(message, "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; 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 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[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); sprintf(message, "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); } healpy-1.8.1/cfitsio/cookbook.c0000654000175000017530000005254212272000775017037 0ustar zoncaplanck00000000000000#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; } healpy-1.8.1/cfitsio/getcol.c0000654000175000017530000011541412272000775016504 0ustar zoncaplanck00000000000000 /* 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 == 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 == 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 == 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 == 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 == 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 == 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 == 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); } healpy-1.8.1/cfitsio/f77_wrap3.c0000654000175000017530000010140612272000775016742 0ustar zoncaplanck00000000000000/************************************************************************ 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" /*----------------- write single keywords --------------*/ FCALLSCSUB3(ffprec,FTPREC,ftprec,FITSUNIT,STRING,PINT) FCALLSCSUB3(ffpcom,FTPCOM,ftpcom,FITSUNIT,STRING,PINT) FCALLSCSUB4(ffpunt,FTPUNT,ftpunt,FITSUNIT,STRING,STRING,PINT) FCALLSCSUB3(ffphis,FTPHIS,ftphis,FITSUNIT,STRING,PINT) FCALLSCSUB2(ffpdat,FTPDAT,ftpdat,FITSUNIT,PINT) FCALLSCSUB3(ffgstm,FTGSTM,ftgstm,PSTRING,PINT,PINT) FCALLSCSUB4(ffgsdt,FTGSDT,ftgsdt,PINT,PINT,PINT,PINT) FCALLSCSUB5(ffdt2s,FTDT2S,ftdt2s,INT,INT,INT,PSTRING,PINT) FCALLSCSUB9(fftm2s,FTTM2S,fttm2s,INT,INT,INT,INT,INT,DOUBLE,INT,PSTRING,PINT) FCALLSCSUB5(ffs2dt,FTS2DT,fts2dt,STRING,PINT,PINT,PINT,PINT) FCALLSCSUB8(ffs2tm,FTS2TM,fts2tm,STRING,PINT,PINT,PINT,PINT,PINT,PDOUBLE,PINT) FCALLSCSUB4(ffpkyu,FTPKYU,ftpkyu,FITSUNIT,STRING,STRING,PINT) FCALLSCSUB5(ffpkys,FTPKYS,ftpkys,FITSUNIT,STRING,STRING,STRING,PINT) FCALLSCSUB5(ffpkls,FTPKLS,ftpkls,FITSUNIT,STRING,STRING,STRING,PINT) FCALLSCSUB2(ffplsw,FTPLSW,ftplsw,FITSUNIT,PINT) FCALLSCSUB5(ffpkyl,FTPKYL,ftpkyl,FITSUNIT,STRING,INT,STRING,PINT) FCALLSCSUB5(ffpkyj,FTPKYJ,ftpkyj,FITSUNIT,STRING,LONG,STRING,PINT) FCALLSCSUB5(ffpkyj,FTPKYK,ftpkyk,FITSUNIT,STRING,LONGLONG,STRING,PINT) FCALLSCSUB6(ffpkyf,FTPKYF,ftpkyf,FITSUNIT,STRING,FLOAT,INT,STRING,PINT) FCALLSCSUB6(ffpkye,FTPKYE,ftpkye,FITSUNIT,STRING,FLOAT,INT,STRING,PINT) FCALLSCSUB6(ffpkyg,FTPKYG,ftpkyg,FITSUNIT,STRING,DOUBLE,INT,STRING,PINT) FCALLSCSUB6(ffpkyd,FTPKYD,ftpkyd,FITSUNIT,STRING,DOUBLE,INT,STRING,PINT) FCALLSCSUB6(ffpkyc,FTPKYC,ftpkyc,FITSUNIT,STRING,FLOATV,INT,STRING,PINT) FCALLSCSUB6(ffpkym,FTPKYM,ftpkym,FITSUNIT,STRING,DOUBLEV,INT,STRING,PINT) FCALLSCSUB6(ffpkfc,FTPKFC,ftpkfc,FITSUNIT,STRING,FLOATV,INT,STRING,PINT) FCALLSCSUB6(ffpkfm,FTPKFM,ftpkfm,FITSUNIT,STRING,DOUBLEV,INT,STRING,PINT) FCALLSCSUB6(ffpkyt,FTPKYT,ftpkyt,FITSUNIT,STRING,LONG,DOUBLE,STRING,PINT) #define ftptdm_LONGV_A4 A3 FCALLSCSUB5(ffptdm,FTPTDM,ftptdm,FITSUNIT,INT,INT,LONGV,PINT) /*----------------- write array of keywords --------------*/ #define ftpkns_STRV_A5 NUM_ELEM_ARG(4) #define ftpkns_STRV_A6 NUM_ELEM_ARG(4) FCALLSCSUB7(ffpkns,FTPKNS,ftpkns,FITSUNIT,STRING,INT,INT,STRINGV,STRINGV,PINT) /* Must handle LOGICALV conversion manually... ffpknl uses ints */ void Cffpknl( fitsfile *fptr, char *keyroot, int nstart, int nkeys, int *numval, char **comment, int *status ); void Cffpknl( fitsfile *fptr, char *keyroot, int nstart, int nkeys, int *numval, char **comment, int *status ) { int i; for( i=0; i #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; } healpy-1.8.1/cfitsio/getcole.c0000654000175000017530000020350612272000775016651 0ustar zoncaplanck00000000000000/* 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) { sprintf(msg, "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 { sprintf(msg, "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) { sprintf(msg, "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]) { sprintf(msg, "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[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; /*----------------------------------------------------------------------*/ /* 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 */ sprintf(message, "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) sprintf(message, "Error reading elements %.0f thru %.0f from column %d (ffgcle).", dtemp+1., dtemp+ntodo, colnum); else sprintf(message, "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; 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 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 */ { memcpy(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[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); sprintf(message, "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); } healpy-1.8.1/cfitsio/buffers.c0000654000175000017530000014772612272000775016676 0ustar zoncaplanck00000000000000/* 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[81]; 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) { sprintf(message, "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); } healpy-1.8.1/cfitsio/editcol.c0000654000175000017530000024527112272000775016657 0ustar zoncaplanck00000000000000/* 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) { sprintf(message, "Illegal value for BITPIX keyword: %d", bitpix); ffpmsg(message); return(*status = BAD_BITPIX); } if (naxis < 0 || naxis > 999) { sprintf(message, "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) { sprintf(message, "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 (fficol)"); 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++) { 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); 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 sprintf is platform dependent ( %lld, %ld, %I64d ) */ sprintf(tfm,"%.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, anynull; long tfields, repeat, width, 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 */ 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 columns to or from IMAGE HDUs (ffcpcl)"); return(*status = NOT_TABLE); } if ( (infptr->Fptr)->hdutype == BINARY_TBL && (outfptr->Fptr)->hdutype == 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 ((infptr->Fptr)->hdutype == ASCII_TBL && (outfptr->Fptr)->hdutype == 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); } /* 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 ((infptr->Fptr)->hdutype == ASCII_TBL && (outfptr->Fptr)->hdutype == 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; } 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 && (infptr->Fptr)->hdutype == 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 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; unsigned char *buffer; 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); } /* 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); } /* copy the rows, 1 at a time */ jj = outnaxis2 + 1; 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); free(buffer); 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; 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); 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 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); } healpy-1.8.1/cfitsio/putcolk.c0000654000175000017530000010566112272000775016713 0ustar zoncaplanck00000000000000/* 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 */ sprintf(message, "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 */ { sprintf(message, "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 == 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); } healpy-1.8.1/cfitsio/configure.in0000654000175000017530000004067412272000775017401 0ustar zoncaplanck00000000000000# # 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,36) # Increment soname each time the interface changes: AC_SUBST(CFITSIO_SONAME,2) #-------------------------------------------------------------------- # Command options #-------------------------------------------------------------------- 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 AC_ARG_WITH( gsiftp-flavour, [AS_HELP_STRING([--with-gsiftp-flavour[[=PATH]]],[Enable Globus Toolkit gsiftp protocol support])], [ 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 ] ) 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 CFLAGS="$CFLAGS -I${withval}/include/${GSIFTP_FLAVOUR}" LDFLAGS="$LDFLAGS -L${withval}/lib -lglobus_ftp_client_${GSIFTP_FLAVOUR}" HAVE_GSIFTP=yes fi AC_DEFINE(HAVE_GSIFTP,1,[Define if you want Globus Toolkit gsiftp protocol support]) 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 *pc-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 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 *pc-cygwin*) CFLAGS="$CFLAGS -DHAVE_POSIX_SIGNALS" ;; *apple-darwin*) # Build for i386 & x86_64 architectures on Darwin 10.x or newer: changequote(,) case $host in *darwin[56789]*) ;; *) changequote([,]) # Test to see whether the C compiler accepts the "-arch" # flags for building "universal" binaries (Apple XCode only): SAVE_CFLAGS="$CFLAGS" C_UNIV_SWITCH="-arch i386 -arch x86_64" CFLAGS="$CFLAGS $C_UNIV_SWITCH" AC_MSG_CHECKING([whether $CC accepts $C_UNIV_SWITCH]) 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([]) # Value of C_UNIV_SWITCH will be needed later for SHLIB_LD: if test "$c_has_option" = no; then C_UNIV_SWITCH=""; fi CFLAGS="$SAVE_CFLAGS $C_UNIV_SWITCH" ;; 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) SHLIB_LD="$CC -shared" SHLIB_SUFFIX=".dll" ;; darwin) changequote(,) SHLIB_SUFFIX=".dylib" CFITSIO_SHLIB="libcfitsio.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}\${SHLIB_SUFFIX}" CFITSIO_SHLIB_SONAME="libcfitsio.\${CFITSIO_SONAME}\${SHLIB_SUFFIX}" case $host in *darwin[56789]*) SHLIB_LD="$CC -dynamiclib -install_name libcfitsio.\${CFITSIO_SONAME}\${SHLIB_SUFFIX} -compatibility_version \${CFITSIO_SONAME} -current_version \${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" ;; *) # Build for i386 & x86_64 architectures on Darwin 10.x or newer: SHLIB_LD="$CC -dynamiclib $C_UNIV_SWITCH -install_name libcfitsio.\${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="libcfitsio\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}" CFITSIO_SHLIB_SONAME="libcfitsio\${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,libcfitsio\${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="libcfitsio\${SHLIB_SUFFIX}"; 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) # ================= 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("do we have flock_t 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("do we have flock_t 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 # ------------------------------------------------------------------------- # there are some idiosyncrasies with semun defs (used in semxxx). Solaris # does not define it at all # ------------------------------------------------------------------------- AC_MSG_CHECKING("do we have union semun 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") ]) # ==================== 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 ================ # ------------------------------------------------------------------------------ # Define _REENTRANT & add -lpthread to LIBS if reentrant multithreading enabled: # ------------------------------------------------------------------------------ if test "x$BUILD_REENTRANT" = xyes; then AC_DEFINE(_REENTRANT) AC_CHECK_LIB([pthread],[main],[],[AC_MSG_ERROR(Unable to locate pthread library needed when enabling reentrant multithreading)]) fi # ------------------------------------------------------------------------------ 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([]) healpy-1.8.1/cfitsio/speed.c0000654000175000017530000003622712272000775016333 0ustar zoncaplanck00000000000000#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; struct timezone tz; 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, &tz); startsec = tv.tv_sec; startmilli = tv.tv_usec/1000; return( *status ); } /*--------------------------------------------------------------------------*/ int gettime(double *elapse, float *elapscpu, int *status) { struct timeval tv; struct timezone tz; int stopmilli; long stopsec; gettimeofday (&tv, &tz); 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 ); } healpy-1.8.1/cfitsio/fitscore.c0000654000175000017530000112222012272000775017037 0ustar zoncaplanck00000000000000/* 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.36; /* 6 Dec 2013 Previous releases: *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 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[81], 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 */ sprintf(msg, "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 */ sprintf(msg, "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[81]; 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) { sprintf(msg, "Character %d in this keyword is illegal. Hex Value = %X", (int) (ii+1), (int) card[ii] ); if (card[ii] == 0) strcat(msg, " (NULL char.)"); else if (card[ii] == 9) strcat(msg, " (TAB char.)"); else if (card[ii] == 10) strcat(msg, " (Line Feed char.)"); else if (card[ii] == 11) strcat(msg, " (Vertical Tab)"); else if (card[ii] == 12) strcat(msg, " (Form Feed char.)"); else if (card[ii] == 13) strcat(msg, " (Carriage Return)"); else if (card[ii] == 27) strcat(msg, " (Escape char.)"); else if (card[ii] == 127) strcat(msg, " (Delete char.)"); 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], *cptr; int tstatus = -1, nblank = 0; if (*status > 0) return(*status); *tmpname = '\0'; *card = '\0'; while(*(keyname + nblank) == ' ') /* skip leading blanks in the name */ nblank++; strncat(tmpname, keyname + nblank, FLEN_KEYWORD - 1); len = strlen(value); namelen = strlen(tmpname); if (namelen) { cptr = tmpname + namelen - 1; while(*cptr == ' ') /* skip trailing blanks */ { *cptr = '\0'; cptr--; } namelen = cptr - tmpname + 1; } if (namelen <= 8 && (fftkey(keyname, &tstatus) <= 0) ) { /* a normal 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 { /* use the ESO HIERARCH convention for longer keyword names */ /* 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); } /* Don't repeat HIERARCH if the keyword already contains it */ if (FSTRNCMP(tmpname, "HIERARCH ", 9) && FSTRNCMP(tmpname, "hierarch ", 9)) strcat(card, "HIERARCH "); else namelen -= 9; /* deleted the string 'HIERARCH ' */ strcat(card, tmpname); if (namelen + 12 + len > 80) { /* save 1 char by not putting a space before the equals sign */ strcat(card, "= "); namelen += 11; } else { strcat(card, " = "); namelen += 12; } } if (len > 0) { 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) */ } } } 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; /* 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] = ' '; for (ii=0; ii < 8; 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 || rootlen > 7 || value < 0 ) return(*status = 206); sprintf(suffix, "%d", value); /* construct keyword suffix */ if ( strlen(suffix) + rootlen > 8) return(*status = 206); strcpy(keyname, keyroot); /* copy root string to name string */ 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); sprintf(keyname, "%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, " ", 8) == 0 || FSTRNCMP(&card[8], "= ", 2) != 0 ) /* no '= ' in cols 9-10 */ { /* 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 { valpos = 10; /* starting position of the value field */ } 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; 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; if (len < 8) /* not a blank name? */ { len = strcspn(tok, " ="); /* length of name */ if (len >= FLEN_KEYWORD) return(*status = BAD_KEYCHAR); 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; } /* 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 */ if (len > 40) /* name has to fit on columns 41-80 of card */ 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+1); /* copy len+1 to get terminator */ /* 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, 73); 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; while (more) { tok++; /* temporarily move past the quote char */ len = strcspn(tok, "'"); /* length of quoted string */ tok--; strncat(value, tok, 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 */ 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 */ 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++; 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 { sprintf(message, "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; sprintf(message,"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); } 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 sscanf(form,"%ld", &repeat); /* read repeat count */ /*-----------------------------------------------*/ /* 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] == '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 { sprintf(message, "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); } 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] == '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 { sprintf(message, "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) { sprintf(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); *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; 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 */ (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 { /* exceeds the range of a 32-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[81]; 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)."); sprintf(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 */ sprintf(message,"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 */ sprintf(message,"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 */ sprintf(message,"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 ) { sprintf(message,"Column %d is too wide to fit in table (ffainit)", ii+1); ffpmsg(message); sprintf(message, " 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 */ sprintf(message,"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) { sprintf(message, "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 { sprintf(message, "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) { sprintf(message, "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) { sprintf(message, "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) { sprintf(message, "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) { sprintf(message, "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) { sprintf(message, "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[81]; 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 */ { sprintf(message, "Image group number is less than 1: %.0f", (double) firstrow); ffpmsg(message); return(*status = BAD_ROW_NUM); } else { sprintf(message, "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) { sprintf(message, "Starting element number less than 1: %ld", (long) firstelem); ffpmsg(message); return(*status = BAD_ELEM_NUM); } else if (nelem < 0) { sprintf(message, "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) { sprintf(message, "Specified column number is out of range: %d", colnum); ffpmsg(message); sprintf(message, " 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) { sprintf(message, "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) { sprintf(message, "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) { sprintf(message, "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) { sprintf(message, "Attempted to read from group %ld of the HDU,", (long) firstrow); ffpmsg(message); sprintf(message, "however the HDU only contains %ld group(s).", (long) ((fptr->Fptr)->numrows) ); ffpmsg(message); } else { ffpmsg("Attempt to read past end of array:"); sprintf(message, " Image has %ld elements;", (long) *repeat); ffpmsg(message); sprintf(message, " Tried to read %ld elements starting at element %ld.", (long) nelem, (long) firstelem); ffpmsg(message); } } else { ffpmsg("Attempt to read past end of table:"); sprintf(message, " Table has %.0f rows with %.0f elements per row;", (double) ((fptr->Fptr)->numrows), (double) *repeat); ffpmsg(message); sprintf(message, " 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) { sprintf(message, "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 */ { sprintf(message, "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"); sprintf(message, " 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) { sprintf(message, "Starting element to read in variable length column is too large: %ld", (long) firstelem); ffpmsg(message); sprintf(message, " 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[81]; 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 ) { sprintf(message,"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 */ sprintf(message, "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[81]; 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) ) { sprintf(message,"Failed to create temporary file for the heap"); ffpmsg(message); return(*status); } if ( ffcopy(fptr, tptr, 0, status) ) { sprintf(message,"Failed to create copy of the heap"); ffpmsg(message); ffclos(tptr, status); return(*status); } buffer = (char *) malloc(buffsize); /* allocate initial buffer */ if (!buffer) { sprintf(message,"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 */ { sprintf(message, "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) { sprintf(message, "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; 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) { sprintf(message, "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; strcat(newform, tform); /* print as double, because the string-to-64-bit */ /* conversion is platform dependent (%lld, %ld, %I64d) */ sprintf(lenval, "(%.0f)", (double) maxlen); 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 ) */ sprintf(valstring, "%.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) */ sprintf(message, "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 experimental 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 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 (*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 */ 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 > 19) { *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 { *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 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 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,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 */ 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 */ 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); } healpy-1.8.1/cfitsio/testf77.std0000654000175000017530000020130012272000775017070 0ustar zoncaplanck00000000000000SIMPLE = 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 î þ    @ € À @ Q b e v ˜ Ü  ¨ º Ì Ï á  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 healpy-1.8.1/cfitsio/License.txt0000654000175000017530000000260212272000775017200 0ustar zoncaplanck00000000000000Copyright (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. healpy-1.8.1/cfitsio/eval_tab.h0000654000175000017530000000154712272000775017012 0ustar zoncaplanck00000000000000typedef union { int Node; /* Index of Node */ double dbl; /* real value */ long lng; /* integer value */ char log; /* logical value */ char str[MAX_STRLEN]; /* string value */ } FFSTYPE; #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 EQ 277 #define NE 278 #define GT 279 #define LT 280 #define LTE 281 #define GTE 282 #define POWER 283 #define NOT 284 #define INTCAST 285 #define FLTCAST 286 #define UMINUS 287 #define ACCUM 288 #define DIFF 289 extern FFSTYPE fflval; healpy-1.8.1/cfitsio/eval.l0000654000175000017530000003743012272000775016170 0ustar zoncaplanck00000000000000%{ /************************************************************************/ /* */ /* 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( !strcasecmp(yytext,"#PI") ) { yylval.dbl = (double)(4) * atan((double)(1)); return( DOUBLE ); } else if( !strcasecmp(yytext,"#E") ) { yylval.dbl = exp((double)(1)); return( DOUBLE ); } else if( !strcasecmp(yytext,"#DEG") ) { yylval.dbl = ((double)4)*atan((double)1)/((double)180); return( DOUBLE ); } else if( !strcasecmp(yytext,"#ROW") ) { return( ROWREF ); } else if( !strcasecmp(yytext,"#NULL") ) { return( NULLREF ); } else if( !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 c2) return(1); if (c1 == 0) return(0); s1++; s2++; } } int 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); } #endif healpy-1.8.1/cfitsio/fpack.h0000654000175000017530000001576312272000775016326 0ustar zoncaplanck00000000000000/* 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); healpy-1.8.1/cfitsio/swapproc.c0000654000175000017530000001702712272000775017066 0ustar zoncaplanck00000000000000/* 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 healpy-1.8.1/cfitsio/f77_wrap.h0000654000175000017530000002427612272000775016675 0ustar zoncaplanck00000000000000#define UNSIGNED_BYTE #include "cfortran.h" /************************************************************************ Some platforms creates longs as 8-byte integers. On other machines, ints and longs are both 4-bytes, so both are compatible with Fortrans default integer which is 4-bytes. To support 8-byte longs, we must redefine LONGs and convert them to 8-bytes when going to C, and restore them to 4-bytes when returning to Fortran. Ugh!!! *************************************************************************/ #if defined(DECFortran) || (defined(__alpha) && defined(g77Fortran)) \ || (defined(mipsFortran) && _MIPS_SZLONG==64) \ || (defined(IBMR2Fortran) && defined(__64BIT__)) \ || defined(__ia64__) \ || defined (__sparcv9) || (defined(__sparc__) && defined(__arch64__)) \ || defined (__x86_64__) \ || defined (_SX) \ || defined (__powerpc64__)\ || defined (__s390x__) #define LONG8BYTES_INT4BYTES #undef LONGV_cfSTR #undef PLONG_cfSTR #undef LONGVVVVVVV_cfTYPE #undef PLONG_cfTYPE #undef LONGV_cfT #undef PLONG_cfT #define LONGV_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,LONGV,A,B,C,D,E) #define PLONG_cfSTR(N,T,A,B,C,D,E) _(CFARGS,N)(T,PLONG,A,B,C,D,E) #define LONGVVVVVVV_cfTYPE int #define PLONG_cfTYPE int #define LONGV_cfQ(B) long *B, _(B,N); #define PLONG_cfQ(B) long B; #define LONGV_cfT(M,I,A,B,D) ( (_(B,N) = * _3(M,_LONGV_A,I)), \ B = F2Clongv(_(B,N),A) ) #define PLONG_cfT(M,I,A,B,D) ((B=*A),&B) #define LONGV_cfR(A,B,D) C2Flongv(_(B,N),A,B); #define PLONG_cfR(A,B,D) *A=B; #define LONGV_cfH(S,U,B) #define PLONG_cfH(S,U,B) static long *F2Clongv(long size, int *A) { long i; long *B; B=(long *)malloc( size*sizeof(long) ); 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" ..\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'. =============================================================================== healpy-1.8.1/cfitsio/f77_wrap2.c0000654000175000017530000007720112272000775016746 0ustar zoncaplanck00000000000000/************************************************************************ 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; i /* 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]; 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, 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 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 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]; 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, 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 { /* This a HIERARCH keyword */ if (FSTRNCMP(cptr, "HIERARCH ", 9) && FSTRNCMP(cptr, "hierarch ", 9)) nchar = 66 - nquote - namelen; else nchar = 75 - nquote - namelen; /* don't count 'HIERARCH' twice */ } contin = 0; while (remain > 0) { 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffr2f(value[1], decim, tmpstring, status); /* convert to string */ 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffr2e(value[1], decim, tmpstring, status); /* convert to string */ 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffd2f(value[1], decim, tmpstring, status); /* convert to string */ 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffd2e(value[1], decim, tmpstring, status); /* convert to string */ 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 { /* This a HIERARCH keyword */ if (FSTRNCMP(cptr, "HIERARCH ", 9) && FSTRNCMP(cptr, "hierarch ", 9)) nchar = 66 - nquote - namelen; else nchar = 75 - nquote - namelen; /* don't count 'HIERARCH' twice */ } contin = 0; while (remain > 0) { 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffr2f(value[1], decim, tmpstring, status); /* convert to string */ 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffr2e(value[1], decim, tmpstring, status); /* convert to string */ 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffd2f(value[1], decim, tmpstring, status); /* convert to string */ 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 */ strcat(valstring, tmpstring); strcat(valstring, ", "); ffd2e(value[1], decim, tmpstring, status); /* convert to string */ 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; 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] = ' '; for (ii=0; ii < 8; 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]; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (ffgkey(fptr, keyname, valstring, comm, status) > 0) /* read keyword */ { sprintf(message, "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, 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]; if (*status > 0) /* inherit input status value if > 0 */ return(*status); if (ffgstr(fptr, string, card, status) > 0) /* read keyword */ { sprintf(message, "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, 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) { sprintf(message, "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); } healpy-1.8.1/cfitsio/getcoli.c0000654000175000017530000021636212272000775016661 0ustar zoncaplanck00000000000000/* 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) { sprintf(msg, "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 { sprintf(msg, "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) { sprintf(msg, "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]) { sprintf(msg, "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[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; /*----------------------------------------------------------------------*/ /* 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 */ sprintf(message, "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) sprintf(message, "Error reading elements %.0f thru %.0f from column %d (ffgcli).", dtemp+1, dtemp+ntodo, colnum); else sprintf(message, "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 */ { memcpy(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; 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 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[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); sprintf(message, "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); } healpy-1.8.1/cfitsio/eval.y0000654000175000017530000053305012272000775016204 0ustar zoncaplanck00000000000000%{ /************************************************************************/ /* */ /* 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 /* 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; 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 */ /* This (commented out) algorithm uses the Low of Cosines, which becomes unstable for angles less than 0.1 arcsec. cd = sin(dec1*deg)*sin(dec2*deg) + cos(dec1*deg)*cos(dec2*deg)*cos((ra1-ra2)*deg); if (cd < (-1)) cd = -1; if (cd > (+1)) cd = +1; return acos(cd)/deg; */ /* 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 double ran1() { static double dval = 0.0; double rndVal; if (dval == 0.0) { if( rand()<32768 && rand()<32768 ) dval = 32768.0; else dval = 2147483648.0; } rndVal = (double)rand(); while( rndVal > dval ) dval *= 2.0; return rndVal/dval; } /* Gaussian deviate routine from Numerical Recipes */ static double gasdev() { static int iset = 0; static double gset; double fac, rsq, v1, v2; if (iset == 0) { do { v1 = 2.0*ran1()-1.0; v2 = 2.0*ran1()-1.0; rsq = v1*v1 + v2*v2; } while (rsq >= 1.0 || rsq == 0.0); fac = sqrt(-2.0*log(rsq)/rsq); gset = v1*fac; iset = 1; return v2*fac; } else { iset = 0; return gset; } } /* lgamma function - from Numerical Recipes */ float gammaln(float xx) /* Returns the value ln Gamma[(xx)] for xx > 0. */ { /* Internal arithmetic will be done in double precision, a nicety that you can omit if five-figure accuracy is good enough. */ double x,y,tmp,ser; static double cof[6]={76.18009172947146,-86.50532032941677, 24.01409824083091,-1.231739572450155, 0.1208650973866179e-2,-0.5395239384953e-5}; int j; y=x=xx; tmp=x+5.5; tmp -= (x+0.5)*log(tmp); ser=1.000000000190015; for (j=0;j<=5;j++) ser += cof[j]/++y; return (float) (-tmp+log(2.5066282746310005*ser/x)); } /* Poisson deviate - derived from Numerical Recipes */ static long poidev(double xm) { static double sq, alxm, g, oldm = -1.0; static double pi = 0; double em, t, y; if (pi == 0) pi = ((double)4)*atan((double)1); if (xm < 20.0) { if (xm != oldm) { oldm = xm; g = exp(-xm); } em = -1; t = 1.0; do { em += 1; t *= ran1(); } while (t > g); } else { if (xm != oldm) { oldm = xm; sq = sqrt(2.0*xm); alxm = log(xm); g = xm*alxm-gammaln( (float) (xm+1.0)); } do { do { y = tan(pi*ran1()); em = sq*y+xm; } while (em < 0.0); em = floor(em); t = 0.9*(1.0+y*y)*exp(em*alxm-gammaln( (float) (em+1.0) )-g); } while (ran1() > t); } /* Return integer version */ return (long int) floor(em+0.5); } 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 = poidev(pVals[0].data.dbl); else this->value.data.lng = poidev(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] = ran1(); this->value.undef[elem] = 0; } break; case gasrnd_fct: while( elem-- ) { this->value.data.dblptr[elem] = gasdev(); 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] = poidev(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] = poidev(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] = poidev(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] = poidev(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[256]; char chr1, chr2; l1 = strlen(bits1); l2 = strlen(bits2); if (l1 < l2) { length = 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) { length = l1; ldiff = l1 - l2; i=0; while( ldiff-- ) stream[i++] = '0'; while( l2-- ) stream[i++] = *(bits2++); stream[i] = '\0'; bits2 = stream; } else length = l1; 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; } return (result); } static void bitand(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff; char stream[256]; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); 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++; } *result = '\0'; } static void bitor(char *result,char *bitstrm1,char *bitstrm2) { int i, l1, l2, ldiff; char stream[256]; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); 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++; } *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; char stream[256]; char chr1, chr2; l1 = strlen(bitstrm1); l2 = strlen(bitstrm2); 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')) ) return( 0 ); } 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); } healpy-1.8.1/cfitsio/testprog.c0000654000175000017530000024765612272000775017114 0ustar zoncaplanck00000000000000#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); } healpy-1.8.1/cfitsio/eval_f.c0000654000175000017530000030057712272000775016471 0ustar zoncaplanck00000000000000/************************************************************************/ /* */ /* 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 ( (strcasecmp(parName,"HISTORY") == 0 || 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 ) { sprintf(tform,"%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: sprintf(tform,"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; sprintf(tform,"%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 (strcasecmp(parName,"HISTORY") == 0) { ffphis( outfptr, result->value.data.str, status); } else if (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: sprintf(msg, "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: sprintf(temp, "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 (!strcasecmp(colName, gParse.pixFilter->tag[i])) colnum = i; } if (colnum < 0) { sprintf(temp, "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. */ sprintf(temp,"TZERO%d",colnum); istatus = 0; if(fits_read_key(fptr,TDOUBLE,temp,&tzero,NULL,&istatus)) { tzero = 0.0; } sprintf(temp,"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 ) { sprintf(temp, "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) { sprintf(temp, "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 */ sprintf(keyvalue, "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: sprintf(msg,"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)) { sprintf(msg, "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)) { sprintf(msg, "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: sprintf(msg, "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: sprintf(msg, "pixel_filter: unexpected constant result type [%d]\n", Info.datatype); ffpmsg(msg); } } CLEANUP: ffcprs(); FFUNLOCK; return (*status); } healpy-1.8.1/cfitsio/funpack.c0000654000175000017530000001056012272000775016652 0ustar zoncaplanck00000000000000/* 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 gottype=0, gottile=0, wholetile=0, 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); } else if (argv[iarg][1] == 'E') { if (++iarg >= argc) { fu_usage (); fu_hint (); exit (-1); } else strncpy (fpptr->extname, argv[iarg], SZ_STR); } 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); } 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);
}
healpy-1.8.1/cfitsio/iter_a.f0000654000175000017530000001533212272000775016473 0ustar  zoncaplanck00000000000000      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
healpy-1.8.1/cfitsio/fits_hcompress.c0000654000175000017530000013365012272000775020261 0ustar  zoncaplanck00000000000000/*  #########################################################################
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
	 */
	signbits = (unsigned char *) malloc((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 *) malloc((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		/* 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
healpy-1.8.1/cfitsio/getkey.c0000654000175000017530000034002412272000775016514 0ustar  zoncaplanck00000000000000/*  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);

  *nexist = (int) (( ((fptr->Fptr)->headend) - ((fptr->Fptr)->headstart[(fptr->Fptr)->curhdu]) ) / 80);
  *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);
        sprintf(message, "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.
*/
{
    long 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 (ffgkyj(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 (ffgkyj(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 (ffgkyj(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 (ffgkyj(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 (ffgkyj(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 (ffgkyj(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 (ffgkyd(fptr, keyname, &doubleval, comm, status) <= 0)
        {
            if (doubleval > (double) ULONG_MAX || doubleval < 0)
                *status = NUM_OVERFLOW;
            else
                 *(unsigned long *) value = (unsigned long) doubleval;
        }
    }
    else if (datatype == TLONG)
    {
        ffgkyj(fptr, keyname, (long *) 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;

    *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 < 8; ii++)
        {
           /* look for string terminator, or a blank */
           if (*(card+ii) != ' ' && *(card+ii) !='\0')
           {
               *(name+ii) = *(card+ii);
           }
           else
           {
               name[ii] = '\0';
               *length = ii;
               return(*status);
           }
        }

        /* if we got here, keyword is 8 characters long */
        name[8] = '\0';
        *length = 8;
    }

    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 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           */
            int  *status)       /* IO - error status             */
/*
  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];
    int contin;
    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 (!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 anpersand?  */
        {
            ffgcnt(fptr, valstring, 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;
        }
        else
            contin = 0;
      }
    }
    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    */
            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], comm[FLEN_COMMENT];

    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  */
        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 (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 */
    ffc2j(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[81];
    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 */
    {
      sprintf(message, "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[81];
    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 */
    {
      sprintf(message, "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 */
    {
     sprintf(sbuff,"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];

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, 8);
     
    lenroot = strlen(keyroot);
    if (lenroot == 0 || lenroot > 7)     /*  root must be 1 - 7 chars 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';
          strncat(keyindex, &card[lenroot], 8-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];

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, 8);

    lenroot = strlen(keyroot);
    if (lenroot == 0 || lenroot > 7)     /*  root must be 1 - 7 chars 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';
          strncat(keyindex, &card[lenroot], 8-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];

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, 8);

    lenroot = strlen(keyroot);
    if (lenroot == 0 || lenroot > 7)     /* root must be 1 - 7 chars 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';
          strncat(keyindex, &card[lenroot], 8-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];

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, 8);

    lenroot = strlen(keyroot);
    if (lenroot == 0 || lenroot > 7)     /* root must be 1 - 7 chars 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';
          strncat(keyindex, &card[lenroot], 8-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];

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, 8);

    lenroot = strlen(keyroot);
    if (lenroot == 0 || lenroot > 7)     /*  root must be 1 - 7 chars 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';
          strncat(keyindex, &card[lenroot], 8-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];

    if (*status > 0)
        return(*status);

    *nfound = 0;
    nend = nstart + nmax - 1;

    keyroot[0] = '\0';
    strncat(keyroot, keyname, 8);

    lenroot = strlen(keyroot);
    if (lenroot == 0 || lenroot > 7)     /*  root must be 1 - 7 chars 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';
          strncat(keyindex, &card[lenroot], 8-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[81];
    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)
    {
            sprintf(message, "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)
    {
            sprintf(message, "Illegal dimensions format: %s", tdimstr);
            return(*status = BAD_TDIM);
    }

    if (colnum != 0) {
        if ((colptr->tdatatype > 0) && ((long) colptr->trepeat != totalpix))
        {
          sprintf(message,
          "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[81];
    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)
        {
            sprintf(message, "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)
        {
            sprintf(message, "Illegal TDIM keyword value: %s", tdimstr);
            return(*status = BAD_TDIM);
        }

        if ((colptr->tdatatype > 0) && (colptr->trepeat != totalpix))
        {
          sprintf(message,
          "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[81];
    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") ) )
            {
                sprintf(message,
                "This is not a TABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_ATABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        sprintf(message,
        "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)
    {
       sprintf(message, "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[81];
    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") ) )
            {
                sprintf(message,
                "This is not a TABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_ATABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        sprintf(message,
        "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)
    {
       sprintf(message, "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[81];
    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")
                 ) )
            {
                sprintf(message,
                "This is not a BINTABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_BTABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        sprintf(message,
        "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[81];
    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")
                 ) )
            {
                sprintf(message,
                "This is not a BINTABLE extension: %s", value);
                ffpmsg(message);
                return(*status = NOT_BTABLE);
            }
    }

    else  /* error: 1st keyword of extension != XTENSION */
    {
        sprintf(message,
        "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
        {
            sprintf(message,
                   "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 */
                sprintf(message,
                   "This is not an IMAGE extension: %s", value);
                ffpmsg(message);
            }
        }

        else  /* error: 1st keyword of extension != XTENSION */
        {
            sprintf(message,
            "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"))
        {
            sprintf(message,
            "Second keyword of the extension is not BITPIX: %s", name);
            ffpmsg(message);
            return(*status = NO_BITPIX);
        }

        if (ffc2ii(value,  &longbitpix, status) > 0)
        {
            sprintf(message,
            "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)
        {
            sprintf(message,
            "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)
        {
            sprintf(message,"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 */
        {
          sprintf(message,
              "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;

                sprintf(message,
                "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;

                sprintf(message,
                "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;

                sprintf(message,
                "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 */
            {
                sprintf(message,
                "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 */
            {
                sprintf(message,
                "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;

                sprintf(message,
                "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)
        {
            sprintf(message,
              "ffgtkn found unexpected keyword or value for keyword no. %d.",
              numkey);
            ffpmsg(message);

            sprintf(message,
              " Expected positive integer keyword %s, but instead", name);
            ffpmsg(message);

            sprintf(message,
              " 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)
        {
            sprintf(message,
              "ffgtknjj found unexpected keyword or value for keyword no. %d.",
              numkey);
            ffpmsg(message);

            sprintf(message,
              " Expected positive integer keyword %s, but instead", name);
            ffpmsg(message);

            sprintf(message,
              " 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)
    {
        sprintf(message,
          "fftkyn found unexpected keyword or value for keyword no. %d.",
          numkey);
        ffpmsg(message);

        sprintf(message,
          " Expected keyword %s with value %s, but", name, value);
        ffpmsg(message);

        sprintf(message,
          " 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);
}
healpy-1.8.1/cfitsio/edithdu.c0000654000175000017530000007472712272000775016670 0ustar  zoncaplanck00000000000000/*  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) )  /* 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
    {
        sprintf(errmsg,
        "Illegal value for BITPIX keyword: %d", bitpix);
        ffpmsg(errmsg);
        return(*status = BAD_BITPIX);  /* illegal bitpix value */
    }
    if (naxis < 0 || naxis > 999)
    {
        sprintf(errmsg,
        "Illegal value for NAXIS keyword: %d", naxis);
        ffpmsg(errmsg);
        return(*status = BAD_NAXIS);
    }

    for (ii = 0; ii < naxis; ii++)
    {
        if (naxes[ii] < 0)
        {
            sprintf(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[81], 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)
    {
        sprintf(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[81], 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)
    {
        sprintf(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);
}

healpy-1.8.1/cfitsio/putcole.c0000654000175000017530000011315212272000775016677 0ustar  zoncaplanck00000000000000/*  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  */
                sprintf(message, 
                       "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 */
        {
          sprintf(message,
          "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 == 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 > DINT_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);
}
healpy-1.8.1/cfitsio/grparser.c0000654000175000017530000013315212272000775017053 0ustar  zoncaplanck00000000000000/*		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= 'a') && (c1 <= 'z')) c1 += ('A' - 'a');

      c2 = *p2;
      if ((c2 >= 'a') && (c2 <= 'z')) c2 += ('A' - 'a');

      if (c1 < c2) return(-1);
      if (c1 > c2) return(1);
      if (0 == c1) return(0);
      p1++;
      p2++;
    }
 }

int	ngp_strcasencmp(char *p1, char *p2, int n)
 { char c1, c2;
   int ii;

   for (ii=0;ii= 'a') && (c1 <= 'z')) c1 += ('A' - 'a');

      c2 = *p2;
      if ((c2 >= 'a') && (c2 <= 'z')) c2 += ('A' - 'a');

      if (c1 < c2) return(-1);
      if (c1 > c2) return(1);
      if (0 == c1) return(0);
      p1++;
      p2++;
    }
    return(0);
 }

	/* read one line from file */

int	ngp_line_from_file(FILE *fp, char **p)
 { int	c, r, llen, allocsize, alen;
   char	*p2;

   if (NULL == fp) return(NGP_NUL_PTR);		/* check for stupid args */
   if (NULL == p) return(NGP_NUL_PTR);		/* more foolproof checks */
   
   r = NGP_OK;					/* initialize stuff, reset err code */
   llen = 0;					/* 0 characters read so far */
   *p = (char *)ngp_alloc(1);			/* preallocate 1 byte */
   allocsize = 1;				/* signal that we have allocated 1 byte */
   if (NULL == *p) return(NGP_NO_MEMORY);	/* if this failed, system is in dire straits */

   for (;;)
    { c = getc(fp);				/* get next character */
      if ('\r' == c) continue;			/* carriage return character ?  Just ignore it */
      if (EOF == c)				/* EOF signalled ? */
        { 
          if (ferror(fp)) r = NGP_READ_ERR;	/* was it real error or simply EOF ? */
	  if (0 == llen) return(NGP_EOF);	/* signal EOF only if 0 characters read so far */
          break;
        }
      if ('\n' == c) break;			/* end of line character ? */
      
      llen++;					/* we have new character, make room for it */
      alen = ((llen + NGP_ALLOCCHUNK) / NGP_ALLOCCHUNK) * NGP_ALLOCCHUNK;
      if (alen > 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( 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 ((!ngp_strcasecmp("HISTORY", cl->name))
    || (!ngp_strcasecmp("COMMENT", cl->name))
    || (!ngp_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 (!ngp_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];

   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 = strtok(envfiles, ":"); NULL != p2; p2 = strtok(NULL, ":"))
            {
	      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 ((!ngp_strcasecmp("T", ngp_curline.value)) || (!ngp_strcasecmp("F", ngp_curline.value)))
                { ngp_linkey.type = NGP_TTYPE_BOOL;
                  ngp_linkey.value.b = (ngp_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;
			  }
			sprintf(buf, "%-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++;
			          }
			        sprintf(ngp_linkey.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
			  { sprintf(grnm, "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++;
			          }
			        sprintf(ngp_linkey.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
			  { sprintf(grnm, "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);
 }
healpy-1.8.1/cfitsio/README0000654000175000017530000001360712272000775015744 0ustar  zoncaplanck00000000000000                   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.  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).

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.

When building on Mac OS-X, users should follow the Unix instructions,
above. Previous MacOS versions of the cfitsio library can be built by
(1) un binhex and unstuff cfitsio_mac.sit.hqx, (2) put CFitsioPPC.mcp
in the cfitsio directory, and (3) 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 and
probably won't work
 on 68k macs.

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.

SUPPORTED PLATFORMS
-------------------

CFITSIO has currently been tested on the following platforms:

   Operating System          Compiler
   ----------------          --------
  OPERATING SYSTEM           COMPILER
   Sun OS                     gcc and cc (3.0.1)
   Sun Solaris                gcc and cc
   Silicon Graphics IRIX      gcc and cc
   Silicon Graphics IRIX64    MIPS
   Dec Alpha OSF/1            gcc and cc
   DECstation  Ultrix         gcc
   Dec Alpha OpenVMS          cc 
   DEC VAX/VMS                gcc and cc
   HP-UX                      gcc
   IBM AIX                    gcc
   Linux                      gcc
   MkLinux                    DR3
   Windows 95/98/NT           Borland C++ V4.5
   Windows 95/98/NT/ME/XP     Microsoft/Compaq Visual C++ v5.0, v6.0
   Windows 95/98/NT           Cygwin gcc
   OS/2                       gcc + EMX
   Mac OS 7.1 or greater      Metrowerks 10.+
   Mac OS-X 10.1 or greater   cc (gcc)

CFITSIO will probably run on most other Unix platforms without
modification.  Cray supercomputers and IBM mainframe computers are
currently not supported.

Reports of any success or failure to run CFITSIO on other platforms
would be appreciated.  Any problem reports or suggestions for
improvements are also welcome and should be sent to the primary author.

-------------------------------------------------------------------------
William D. Pence
HEASARC, NASA/GSFC
email: William.D.Pence@nasa.gov
healpy-1.8.1/cfitsio/drvrmem.c0000654000175000017530000010772112272000775016705 0ustar  zoncaplanck00000000000000/*  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"

/* 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);

#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 */
    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*/
    } 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);
}
healpy-1.8.1/cfitsio/wcsutil.c0000654000175000017530000004060112272000775016714 0ustar  zoncaplanck00000000000000#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 (',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
healpy-1.8.1/cfitsio/getcoluj.c0000654000175000017530000021665012272000775017047 0ustar  zoncaplanck00000000000000/*  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)
    {
        sprintf(msg, "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])
      {
        sprintf(msg, "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)
    {
        sprintf(msg, "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])
      {
        sprintf(msg, "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[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 ( 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:                        */
    {                             /* 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):
                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);
                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 */
                sprintf(message, 
                   "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)
            sprintf(message,
            "Error reading elements %.0f thru %.0f from column %d (ffgcluj).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            sprintf(message,
            "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;

  Process the array of data in reverse order, to handle the case where
  the input data is 4-bytes and the output is  8-bytes and the conversion
  is being done in place in the same array.
*/
{
    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 = ntodo - 1; ii >= 0; ii--)
               output[ii] =  ( *(unsigned int *) &input[ii] ) ^ 0x80000000;
        }
        else if (scale == 1. && zero == 0.)      /* no scaling */
        {       
            for (ii = ntodo - 1; ii >= 0; 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 = ntodo - 1; ii >= 0; 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 = ntodo - 1; ii >= 0; 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 = ntodo - 1; ii >= 0; 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 = ntodo - 1; ii >= 0; 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;

    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] > 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 == 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[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);
          sprintf(message, "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);
}
healpy-1.8.1/cfitsio/iter_image.c0000654000175000017530000000600412272000775017326 0ustar  zoncaplanck00000000000000#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 */
}
healpy-1.8.1/cfitsio/drvrgsiftp.h0000654000175000017530000000142312272000775017420 0ustar  zoncaplanck00000000000000#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
healpy-1.8.1/cfitsio/fpackutil.c0000654000175000017530000021770412272000775017216 0ustar  zoncaplanck00000000000000/* 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];

	fits_file_name(infptr, tempfilename, &status);
	fits_get_hdu_num(infptr, &hdunum);
	
        fits_close_file (infptr, &status);

	sprintf(msg, "Error processing file: %s\n", tempfilename);
	fp_msg (msg);
	sprintf(msg, "  in HDU number %d\n", hdunum);
	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);
        sprintf(cfitsioversion, " 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, i1 = 0, 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 */
		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);

	    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);
	    }

            sprintf (msg, "# %s (", infits); fp_msg (msg);

#if defined(_MSC_VER)
    /* Microsoft Visual C++ 6.0 uses '%I64d' syntax  for 8-byte integers */
        sprintf(msg, "%I64d bytes)\n", sizell); fp_msg (msg);
#elif (USE_LL_SUFFIX == 1)
        sprintf(msg, "%lld bytes)\n", sizell); fp_msg (msg);
#else
        sprintf(msg, "%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) {
		sprintf (msg, "  %d IMAGE", hdupos); fp_msg (msg);
                sprintf (msg, " SUMS=%lu/%lu", (unsigned long) (~((int) hdusum)), datasum); fp_msg (msg);

		fits_get_img_param (infptr, 9, &bitpix, &naxis, naxes, &stat);

                sprintf (msg, " BITPIX=%d", bitpix); fp_msg (msg);

		if (naxis == 0) {
                    sprintf (msg, " [no_pixels]"); fp_msg (msg);
		} else if (naxis == 1) {
		    sprintf (msg, " [%ld]", naxes[1]); fp_msg (msg);
		} else {
		    sprintf (msg, " [%ld", naxes[0]); fp_msg (msg);
		    for (ii=1; ii < naxis; ii++) {
			sprintf (msg, "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) {
                sprintf (msg, "  %d ASCII_TBL", hdupos); fp_msg (msg);
                sprintf (msg, " SUMS=%lu/%lu\n", (unsigned long) (~((int) hdusum)), datasum); fp_msg (msg);

            } else if (hdutype == BINARY_TBL) {
                sprintf (msg, "  %d BINARY_TBL", hdupos); fp_msg (msg);
                sprintf (msg, " SUMS=%lu/%lu\n", (unsigned long) (~((int) hdusum)), datasum); fp_msg (msg);

            } else {
                sprintf (msg, "  %d OTHER", hdupos); fp_msg (msg);
                sprintf (msg, " SUMS=%lu/%lu", (unsigned long) (~((int) hdusum), datasum)); fp_msg (msg);
                sprintf (msg, " %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);
	          }
	          strcat(outfits,fpptr->prefix);
	      }

	      /* construct output file name */
	      if (infits[0] == '-') {
	        strcpy(outfits, "output.fits");
	      } else {
	        strcpy(outfits, infits);
	      }

	      /* remove .gz suffix, if present (output is not gzipped) */
              namelen = strlen(outfits);
	      if ( !strcmp(".gz", outfits + namelen - 3) ) {
                        outfits[namelen - 3] = '\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 ( !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) {
	                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 */
		    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 ( !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;
	      }

	      /* construct output file name */
	      if (infits[0] == '-') {
	        strcpy(outfits, "input.fits");
	      } else {
	        strcpy(outfits, infits);
	      }

	      /* remove .gz suffix, if present (output is not gzipped) */
              namelen = strlen(outfits);
	      if ( !strcmp(".gz", outfits + namelen - 3) ) {
                        outfits[namelen - 3] = '\0';
	      }
	      
	      /* remove .imh suffix (IRAF format image), and replace with .fits */
              namelen = strlen(outfits);
	      if ( !strcmp(".imh", outfits + namelen - 4) ) {
                        outfits[namelen - 4] = '\0';
                        strcat(outfits, ".fits");
	      }

	      /* If not clobbering the input file, add .fz suffix to output name */
	      if (! fpptr->clobber)
		        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];
	int	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);

          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 */
	         }
	      }

	      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]) {
	              strcat(outfits,fpvar.prefix);
	          }

	          /* construct output file name */
	          if (infits[0] == '-') {
	            strcpy(outfits, "output.fits");
	          } else {
	            strcpy(outfits, infits);
	          }

	          /* remove .gz suffix, if present (output is not gzipped) */
                  namelen = strlen(outfits);
	          if ( !strcmp(".gz", outfits + namelen - 3) ) {
                        outfits[namelen - 3] = '\0';
	          }

	          /* check for .fz suffix that is sometimes required */
	          /* and remove it if present */
                  namelen = strlen(outfits);
	          if ( !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) {

	          /* construct output file name */
	          if (infits[0] == '-') {
	            strcpy(outfits, "input.fits");
	          } else {
	            strcpy(outfits, infits);
	          }
	      
	          /* remove .gz suffix, if present (output is not gzipped) */
                  namelen = strlen(outfits);
	          if ( !strcmp(".gz", outfits + namelen - 3) ) {
                        outfits[namelen - 3] = '\0';
	          }
	      
	          /* remove .imh suffix (IRAF format image), and replace with .fits */
                  namelen = strlen(outfits);
	          if ( !strcmp(".imh", outfits + namelen - 4) ) {
                        outfits[namelen - 4] = '\0';
                        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);

	  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 ");
		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};
	long	tilesize[9] = {0,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);
		sprintf(dimen," (%ld", naxes[0]);
		len =strlen(dimen);
		for (ii = 1; ii < naxis; ii++) {
		    sprintf(dimen+len,",%ld", naxes[ii]);
		    len =strlen(dimen);
		}
		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);
 		printf("\n File: %s, HDU %d,  %d cols X %ld rows\n", infits, extnum, ncols, nrows);
		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, rescale_flag = 0;
	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);

			/* 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, noloss = 0;
        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");
			noloss = 1;
		} 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 beta 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);
}
healpy-1.8.1/cfitsio/iter_c.f0000654000175000017530000002443512272000775016501 0ustar  zoncaplanck00000000000000      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

healpy-1.8.1/cfitsio/putcolj.c0000654000175000017530000021102512272000775016702 0ustar  zoncaplanck00000000000000/*  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):

                fflongfi8(&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  */
                sprintf(message, 
                     "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 */
        {
          sprintf(message,
          "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 fflongfi8(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 == 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 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 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 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 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  */
                sprintf(message, 
                     "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 */
        {
          sprintf(message,
          "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 == 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);
}
healpy-1.8.1/cfitsio/eval_defs.h0000654000175000017530000001023612272000775017160 0ustar  zoncaplanck00000000000000#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
healpy-1.8.1/cfitsio/install-sh0000755000175000017530000001272112272000775017063 0ustar  zoncaplanck00000000000000#! /bin/sh
#
# install - install a program, script, or datafile
# This comes from X11R5 (mit/util/scripts/install.sh).
#
# Copyright 1991 by the Massachusetts Institute of Technology
#
# Permission to use, copy, modify, distribute, and sell this software and its
# documentation for any purpose is hereby granted without fee, provided that
# the above copyright notice appear in all copies and that both that
# copyright notice and this permission notice appear in supporting
# documentation, and that the name of M.I.T. not be used in advertising or
# publicity pertaining to distribution of the software without specific,
# written prior permission.  M.I.T. makes no representations about the
# suitability of this software for any purpose.  It is provided "as is"
# without express or implied warranty.
#
# 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.  It can only install one file at a time, a restriction
# shared with many OS's install programs.


# set DOITPROG to echo to test this script

# Don't use :- since 4.3BSD and earlier shells don't like it.
doit="${DOITPROG-}"


# put in absolute paths if you don't have them in your path; or use env. vars.

mvprog="${MVPROG-mv}"
cpprog="${CPPROG-cp}"
chmodprog="${CHMODPROG-chmod}"
chownprog="${CHOWNPROG-chown}"
chgrpprog="${CHGRPPROG-chgrp}"
stripprog="${STRIPPROG-strip}"
rmprog="${RMPROG-rm}"
mkdirprog="${MKDIRPROG-mkdir}"

transformbasename=""
transform_arg=""
instcmd="$mvprog"
chmodcmd="$chmodprog 0755"
chowncmd=""
chgrpcmd=""
stripcmd=""
rmcmd="$rmprog -f"
mvcmd="$mvprog"
src=""
dst=""
dir_arg=""

while [ x"$1" != x ]; do
    case $1 in
	-c) instcmd="$cpprog"
	    shift
	    continue;;

	-d) dir_arg=true
	    shift
	    continue;;

	-m) chmodcmd="$chmodprog $2"
	    shift
	    shift
	    continue;;

	-o) chowncmd="$chownprog $2"
	    shift
	    shift
	    continue;;

	-g) chgrpcmd="$chgrpprog $2"
	    shift
	    shift
	    continue;;

	-s) stripcmd="$stripprog"
	    shift
	    continue;;

	-t=*) transformarg=`echo $1 | sed 's/-t=//'`
	    shift
	    continue;;

	-b=*) transformbasename=`echo $1 | sed 's/-b=//'`
	    shift
	    continue;;

	*)  if [ x"$src" = x ]
	    then
		src=$1
	    else
		# this colon is to work around a 386BSD /bin/sh bug
		:
		dst=$1
	    fi
	    shift
	    continue;;
    esac
done

if [ x"$src" = x ]
then
	echo "install:	no input file specified"
	exit 1
else
	true
fi

if [ x"$dir_arg" != x ]; then
	dst=$src
	src=""
	
	if [ -d $dst ]; then
		instcmd=:
	else
		instcmd=mkdir
	fi
else

# Waiting for this to be detected by the "$instcmd $src $dsttmp" command
# might cause directories to be created, which would be especially bad 
# if $src (and thus $dsttmp) contains '*'.

	if [ -f $src -o -d $src ]
	then
		true
	else
		echo "install:  $src does not exist"
		exit 1
	fi
	
	if [ x"$dst" = x ]
	then
		echo "install:	no destination specified"
		exit 1
	else
		true
	fi

# If destination is a directory, append the input filename; if your system
# does not like double slashes in filenames, you may need to add some logic

	if [ -d $dst ]
	then
		dst="$dst"/`basename $src`
	else
		true
	fi
fi

## this sed command emulates the dirname command
dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'`

# Make sure that the destination directory exists.
#  this part is taken from Noah Friedman's mkinstalldirs script

# Skip lots of stat calls in the usual case.
if [ ! -d "$dstdir" ]; then
defaultIFS='	
'
IFS="${IFS-${defaultIFS}}"

oIFS="${IFS}"
# Some sh's can't handle IFS=/ for some reason.
IFS='%'
set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'`
IFS="${oIFS}"

pathcomp=''

while [ $# -ne 0 ] ; do
	pathcomp="${pathcomp}${1}"
	shift

	if [ ! -d "${pathcomp}" ] ;
        then
		$mkdirprog "${pathcomp}"
	else
		true
	fi

	pathcomp="${pathcomp}/"
done
fi

if [ x"$dir_arg" != x ]
then
	$doit $instcmd $dst &&

	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi &&
	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi &&
	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi &&
	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi
else

# If we're going to rename the final executable, determine the name now.

	if [ x"$transformarg" = x ] 
	then
		dstfile=`basename $dst`
	else
		dstfile=`basename $dst $transformbasename | 
			sed $transformarg`$transformbasename
	fi

# don't allow the sed command to completely eliminate the filename

	if [ x"$dstfile" = x ] 
	then
		dstfile=`basename $dst`
	else
		true
	fi

# Make a temp file name in the proper directory.

	dsttmp=$dstdir/#inst.$$#

# Move or copy the file name to the temp name

	$doit $instcmd $src $dsttmp &&

	trap "rm -f ${dsttmp}" 0 &&

# 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 $instcmd $src $dsttmp" command.

	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi &&
	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi &&
	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi &&
	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi &&

# Now rename the file to the real destination.

	$doit $rmcmd -f $dstdir/$dstfile &&
	$doit $mvcmd $dsttmp $dstdir/$dstfile 

fi &&


exit 0
healpy-1.8.1/cfitsio/drvrgsiftp.c0000654000175000017530000003241612272000775017421 0ustar  zoncaplanck00000000000000
/*  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 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"));
    strcat(gsiftp_tmpfile, gsiftp_tmpdir);
    strcat(gsiftp_tmpfile, "/gsiftp_buffer.tmp");
  }

  return file_init();
}

int gsiftp_shutdown(void)
{
  free(gsiftpurl);
  free(gsiftp_tmpfile);
  free(gsiftp_tmpdir);

  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://");
    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://");
    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
healpy-1.8.1/cfitsio/f77.inc0000654000175000017530000000152512272000775016156 0ustar  zoncaplanck00000000000000C     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  )

healpy-1.8.1/cfitsio/FindPthreads.cmake0000654000175000017530000000621112272000775020432 0ustar  zoncaplanck00000000000000# - Find the Pthreads library
# This module searches for the Pthreads library (including the
# pthreads-win32 port).
#
# This module defines these variables:
#
#  PTHREADS_FOUND
#      True if the Pthreads library was found
#  PTHREADS_LIBRARY
#      The location of the Pthreads library
#  PTHREADS_INCLUDE_DIR
#      The include path of the Pthreads library
#  PTHREADS_DEFINITIONS
#      Preprocessor definitions to define
#
# This module responds to the PTHREADS_EXCEPTION_SCHEME
# variable on Win32 to allow the user to control the
# library linked against.  The Pthreads-win32 port
# provides the ability to link against a version of the
# library with exception handling.  IT IS NOT RECOMMENDED
# THAT YOU USE THIS because most POSIX thread implementations
# do not support stack unwinding.
#
#  PTHREADS_EXCEPTION_SCHEME
#      C  = no exceptions (default)
#         (NOTE: This is the default scheme on most POSIX thread
#          implementations and what you should probably be using)
#      CE = C++ Exception Handling
#      SE = Structure Exception Handling (MSVC only)
#

#
# Define a default exception scheme to link against
# and validate user choice.
#
IF(NOT DEFINED PTHREADS_EXCEPTION_SCHEME)
    # Assign default if needed
    SET(PTHREADS_EXCEPTION_SCHEME "C")
ELSE(NOT DEFINED PTHREADS_EXCEPTION_SCHEME)
    # Validate
    IF(NOT PTHREADS_EXCEPTION_SCHEME STREQUAL "C" AND
       NOT PTHREADS_EXCEPTION_SCHEME STREQUAL "CE" AND
       NOT PTHREADS_EXCEPTION_SCHEME STREQUAL "SE")

    MESSAGE(FATAL_ERROR "See documentation for FindPthreads.cmake, only C, CE, and SE modes are allowed")

    ENDIF(NOT PTHREADS_EXCEPTION_SCHEME STREQUAL "C" AND
          NOT PTHREADS_EXCEPTION_SCHEME STREQUAL "CE" AND
          NOT PTHREADS_EXCEPTION_SCHEME STREQUAL "SE")

     IF(NOT MSVC AND PTHREADS_EXCEPTION_SCHEME STREQUAL "SE")
         MESSAGE(FATAL_ERROR "Structured Exception Handling is only allowed for MSVC")
     ENDIF(NOT MSVC AND PTHREADS_EXCEPTION_SCHEME STREQUAL "SE")

ENDIF(NOT DEFINED PTHREADS_EXCEPTION_SCHEME)

#
# Find the header file
#
FIND_PATH(PTHREADS_INCLUDE_DIR pthread.h)

#
# Find the library
#
SET(names)
IF(MSVC)
    SET(names
            pthreadV${PTHREADS_EXCEPTION_SCHEME}2
            pthread
    )
ELSEIF(MINGW)
    SET(names
            pthreadG${PTHREADS_EXCEPTION_SCHEME}2
            pthread
    )
ELSE(MSVC) # Unix / Cygwin / Apple
    SET(names pthread)
ENDIF(MSVC)
    
FIND_LIBRARY(PTHREADS_LIBRARY ${names}
    DOC "The Portable Threads Library")

IF(PTHREADS_INCLUDE_DIR AND PTHREADS_LIBRARY)
    SET(PTHREADS_FOUND true)
    SET(PTHREADS_DEFINITIONS -DHAVE_PTHREAD_H)
    SET(PTHREADS_INCLUDE_DIRS ${PTHREADS_INCLUDE_DIR})
    SET(PTHREADS_LIBRARIES    ${PTHREADS_LIBRARY})
ENDIF(PTHREADS_INCLUDE_DIR AND PTHREADS_LIBRARY)

IF(PTHREADS_FOUND)
    IF(NOT PTHREADS_FIND_QUIETLY)
        MESSAGE(STATUS "Found Pthreads: ${PTHREADS_LIBRARY}")
    ENDIF(NOT PTHREADS_FIND_QUIETLY)
ELSE(PTHREADS_FOUND) 
    IF(PTHREADS_FIND_REQUIRED)
        MESSAGE(FATAL_ERROR "Could not find the Pthreads Library")
    ENDIF(PTHREADS_FIND_REQUIRED)
ENDIF(PTHREADS_FOUND)
healpy-1.8.1/cfitsio/iraffits.c0000654000175000017530000016015412272000775017037 0ustar  zoncaplanck00000000000000/*------------------------------------------------------------------------*/
/*                                                                        */
/*  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 		/* 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[81];
    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) {
	sprintf(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) {
	sprintf(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[81];
    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) {
	sprintf(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) {
	sprintf(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) {
	sprintf(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[81];

    /* 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) {
	sprintf(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:
	    sprintf(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;
	    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);
	    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;
	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);
	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 = strtok (v1,cwhite);
		    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 */
    sprintf (value,"%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);
	    }

}
healpy-1.8.1/cfitsio/wcssub.c0000654000175000017530000010470312272000775016534 0ustar  zoncaplanck00000000000000#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);
}
healpy-1.8.1/cfitsio/CMakeLists.txt0000654000175000017530000000537012272000775017622 0ustar  zoncaplanck00000000000000PROJECT(CFITSIO)
CMAKE_MINIMUM_REQUIRED(VERSION 2.8.0)

# 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}")

# Define project version
SET(${PROJECT_NAME}_MAJOR_VERSION 3)
SET(${PROJECT_NAME}_MINOR_VERSION 36)
SET(${PROJECT_NAME}_VERSION ${${PROJECT_NAME}_MAJOR_VERSION}.${${PROJECT_NAME}_MINOR_VERSION})

IF(WIN32)
    SET(LIB_NAME cfitsio)
ELSE()
    SET(LIB_NAME libcfitsio)
ENDIF()

# Define
IF(MSVC)
    ADD_DEFINITIONS(-D_CRT_SECURE_NO_DEPRECATE)
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()

SET(SRC_FILES
    buffers.c cfileio.c checksum.c drvrfile.c drvrmem.c
    drvrnet.c drvrsmem.c drvrgsiftp.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 zlib/zuncompress.c
    zlib/zcompress.c zlib/adler32.c zlib/crc32.c zlib/inffast.c
    zlib/inftrees.c zlib/trees.c zlib/zutil.c zlib/deflate.c
    zlib/infback.c zlib/inflate.c zlib/uncompr.c
    f77_wrap1.c f77_wrap2.c f77_wrap3.c f77_wrap4.c
)

ADD_LIBRARY(${LIB_NAME} ${LIB_TYPE} ${H_FILES} ${SRC_FILES})
TARGET_LINK_LIBRARIES(${LIB_NAME}
    ${PTHREADS_LIBRARY}
)

SET_TARGET_PROPERTIES(${LIB_NAME} PROPERTIES
    VERSION ${PROJECT_NAME}_VERSION
)

ENABLE_TESTING()

ADD_EXECUTABLE(TestProg testprog.c)
TARGET_LINK_LIBRARIES(TestProg ${LIB_NAME})
ADD_TEST(TestProg TestProg)

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})

# To expands 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)
healpy-1.8.1/cfitsio/config.sub0000755000175000017530000010437612272000775017052 0ustar  zoncaplanck00000000000000#! /bin/sh
# Configuration validation subroutine script.
#   Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
#   2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
#   Free Software Foundation, Inc.

timestamp='2010-09-11'

# This file is (in principle) common to ALL GNU software.
# The presence of a machine in this file suggests that SOME GNU software
# can handle that machine.  It does not imply ALL GNU software can.
#
# 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 2 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, write to the Free Software
# Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
# 02110-1301, USA.
#
# 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.


# Please send patches to .  Submit a context
# diff and a properly formatted GNU ChangeLog entry.
#
# 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:
# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD

# 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
       $0 [OPTION] ALIAS

Canonicalize a configuration name.

Operation modes:
  -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 (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 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-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \
  knetbsd*-gnu* | netbsd*-gnu* | \
  kopensolaris*-gnu* | \
  storm-chaos* | os2-emx* | rtmk-nova*)
    os=-$maybe_os
    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`
    ;;
  *)
    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*)
		os=-lynxos
		;;
	-ptx*)
		basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'`
		;;
	-windowsnt*)
		os=`echo $os | sed -e 's/windowsnt/winnt/'`
		;;
	-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 \
	| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \
	| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \
	| am33_2.0 \
	| arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \
	| bfin \
	| c4x | clipper \
	| d10v | d30v | dlx | dsp16xx \
	| fido | fr30 | frv \
	| h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \
	| i370 | i860 | i960 | ia64 \
	| ip2k | iq2000 \
	| lm32 \
	| m32c | m32r | m32rle | m68000 | m68k | m88k \
	| maxq | mb | microblaze | 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 \
	| mipsisa64 | mipsisa64el \
	| mipsisa64r2 | mipsisa64r2el \
	| mipsisa64sb1 | mipsisa64sb1el \
	| mipsisa64sr71k | mipsisa64sr71kel \
	| mipstx39 | mipstx39el \
	| mn10200 | mn10300 \
	| moxie \
	| mt \
	| msp430 \
	| nds32 | nds32le | nds32be \
	| nios | nios2 \
	| ns16k | ns32k \
	| or32 \
	| pdp10 | pdp11 | pj | pjl \
	| powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \
	| pyramid \
	| rx \
	| score \
	| 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 \
	| spu | strongarm \
	| tahoe | thumb | tic4x | tic54x | tic55x | tic6x | tic80 | tron \
	| ubicom32 \
	| v850 | v850e \
	| we32k \
	| x86 | xc16x | xscale | xscalee[bl] | xstormy16 | xtensa \
	| z8k | z80)
		basic_machine=$basic_machine-unknown
		;;
	c54x)
		basic_machine=tic54x-unknown
		;;
	c55x)
		basic_machine=tic55x-unknown
		;;
	c6x)
		basic_machine=tic6x-unknown
		;;
	m6811 | m68hc11 | m6812 | m68hc12 | picochip)
		# Motorola 68HC11/12.
		basic_machine=$basic_machine-unknown
		os=-none
		;;
	m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k)
		;;
	ms1)
		basic_machine=mt-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-* \
	| alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \
	| alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \
	| alphapca5[67]-* | alpha64pca5[67]-* | arc-* \
	| arm-*  | armbe-* | armle-* | armeb-* | armv*-* \
	| avr-* | avr32-* \
	| bfin-* | bs2000-* \
	| c[123]* | c30-* | [cjt]90-* | c4x-* \
	| clipper-* | craynv-* | cydra-* \
	| d10v-* | d30v-* | dlx-* \
	| elxsi-* \
	| f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \
	| h8300-* | h8500-* \
	| hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \
	| i*86-* | i860-* | i960-* | ia64-* \
	| ip2k-* | iq2000-* \
	| lm32-* \
	| m32c-* | m32r-* | m32rle-* \
	| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \
	| m88110-* | m88k-* | maxq-* | mcore-* | metag-* | microblaze-* \
	| 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-* \
	| mipsisa64-* | mipsisa64el-* \
	| mipsisa64r2-* | mipsisa64r2el-* \
	| mipsisa64sb1-* | mipsisa64sb1el-* \
	| mipsisa64sr71k-* | mipsisa64sr71kel-* \
	| mipstx39-* | mipstx39el-* \
	| mmix-* \
	| mt-* \
	| msp430-* \
	| nds32-* | nds32le-* | nds32be-* \
	| nios-* | nios2-* \
	| none-* | np1-* | ns16k-* | ns32k-* \
	| orion-* \
	| pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \
	| powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \
	| pyramid-* \
	| 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-* | strongarm-* | sv1-* | sx?-* \
	| tahoe-* | thumb-* \
	| tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \
	| tile-* | tilegx-* \
	| tron-* \
	| ubicom32-* \
	| v850-* | v850e-* | vax-* \
	| we32k-* \
	| x86-* | x86_64-* | xc16x-* | xps100-* | xscale-* | xscalee[bl]-* \
	| 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-unknown
		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
		;;
	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)
		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* | dpx2*-bull)
		basic_machine=m68k-bull
		os=-sysv3
		;;
	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
		;;
	hppa-next)
		os=-nextstep3
		;;
	hppaosf)
		basic_machine=hppa1.1-hp
		os=-osf
		;;
	hppro)
		basic_machine=hppa1.1-hp
		os=-proelf
		;;
	i370-ibm* | ibm*)
		basic_machine=i370-ibm
		;;
# I'm not sure what "Sysv32" means.  Should this be sysv3.2?
	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
		;;
	i386-vsta | 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
		;;
	m68knommu)
		basic_machine=m68k-unknown
		os=-linux
		;;
	m68knommu-*)
		basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'`
		os=-linux
		;;
	m88k-omron*)
		basic_machine=m88k-omron
		;;
	magnum | m3230)
		basic_machine=mips-mips
		os=-sysv
		;;
	merlin)
		basic_machine=ns32k-utek
		os=-sysv
		;;
        microblaze)
		basic_machine=microblaze-xilinx
		;;
	mingw32)
		basic_machine=i386-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
		;;
	msdos)
		basic_machine=i386-pc
		os=-msdos
		;;
	ms1-*)
		basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'`
		;;
	mvs)
		basic_machine=i370-ibm
		os=-mvs
		;;
	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
		;;
	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)	basic_machine=powerpc-unknown
		;;
	ppc-*)	basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	ppcle | powerpclittle | ppc-le | powerpc-little)
		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 | ppc64-le | powerpc64-little)
		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)
		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
		;;
	sh)
		basic_machine=sh-hitachi
		os=-hms
		;;
	sh5el)
		basic_machine=sh5le-unknown
		;;
	sh64)
		basic_machine=sh64-unknown
		;;
	sparclite-wrs | 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
		;;
	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
		;;
        # This must be matched before tile*.
        tilegx*)
		basic_machine=tilegx-unknown
		os=-linux-gnu
		;;
	tile*)
		basic_machine=tile-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
		;;
	xbox)
		basic_machine=i686-pc
		os=-mingw32
		;;
	xps | xps100)
		basic_machine=xps100-honeywell
		;;
	ymp)
		basic_machine=ymp-cray
		os=-unicos
		;;
	z8k-*-coff)
		basic_machine=z8k-unknown
		os=-sim
		;;
	z80-*-coff)
		basic_machine=z80-unknown
		os=-sim
		;;
	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
		;;
	pdp10)
		# there are many clones, so DEC is not a safe bet
		basic_machine=pdp10-unknown
		;;
	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
		;;
	sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v)
		basic_machine=sparc-sun
		;;
	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
		;;
	-svr4*)
		os=-sysv4
		;;
	-unixware*)
		os=-sysv4.2uw
		;;
	-gnu/linux*)
		os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'`
		;;
	# First 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* \
	      | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \
	      | -aos* | -aros* \
	      | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \
	      | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \
	      | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \
	      | -openbsd* | -solidbsd* \
	      | -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* \
	      | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \
	      | -mingw32* | -linux-gnu* | -linux-android* \
	      | -linux-newlib* | -linux-uclibc* \
	      | -uxpv* | -beos* | -mpeix* | -udk* \
	      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \
	      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \
	      | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \
	      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \
	      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \
	      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \
	      | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es*)
	# 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 | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \
	      | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \
	      | -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
		;;
	-osfrose*)
		os=-osfrose
		;;
	-osf*)
		os=-osf
		;;
	-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
		;;
	-es1800*)
		os=-ose
		;;
	-xenix)
		os=-xenix
		;;
	-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
		os=-mint
		;;
	-aros*)
		os=-aros
		;;
	-kaos*)
		os=-kaos
		;;
	-zvmoe)
		os=-zvmoe
		;;
	-dicos*)
		os=-dicos
		;;
        -nacl*)
	        ;;
	-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
		;;
	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
		# This also exists in the configure program, but was not the
		# default.
		# os=-sunos4
		;;
	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
		;;
	*-be)
		os=-beos
		;;
	*-haiku)
		os=-haiku
		;;
	*-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
		;;
	*-next)
		os=-nextstep3
		;;
	*-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-hooks 'time-stamp)
# time-stamp-start: "timestamp='"
# time-stamp-format: "%:y-%02m-%02d"
# time-stamp-end: "'"
# End:
healpy-1.8.1/cfitsio/drvrnet.c0000654000175000017530000021322712272000775016714 0ustar  zoncaplanck00000000000000/*  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.



   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 

#if defined(unix) || defined(__unix__)  || defined(__unix)
#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

#define NETTIMEOUT 180 /* in secs */

/* 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;

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 ftp_open_network(char *url, FILE **ftpfile, FILE **command, 
			    int *sock);

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 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;

/*--------------------------------------------------------------------------*/
/* 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 newfilename[MAXLEN];
  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)");
    goto error;
  }

  (void) signal(SIGALRM, signal_handler);
  
  /* Open the network connection */

  /* Does the file have a .Z or .gz in it */
  /* Also, if file has a '?' in it (probably cgi script) */
  if (strstr(filename,".Z") || strstr(filename,".gz") || 
      strstr(filename,"?")) {
    alarm(NETTIMEOUT);
    if (http_open_network(filename,&httpfile,contentencoding,
			       &contentlength)) {
      alarm(0);
      ffpmsg("Unable to open http file (http_open):");
      ffpmsg(filename);
      goto error;
    } 
  } else {
  
    if (strlen(filename) >= MAXLEN - 4) {
	  ffpmsg("http file name is too long (http_open)");
          ffpmsg(filename);
	  goto error;
    }
  
    alarm(NETTIMEOUT);
    /* Try the .gz one */    
    strcpy(newfilename,filename);
    strcat(newfilename,".gz");
    
    if (http_open_network(newfilename,&httpfile,contentencoding,
			  &contentlength)) {
      alarm(0);
      /* Now the .Z one */
      strcpy(newfilename,filename);
      strcat(newfilename,".Z");
      alarm(NETTIMEOUT);
      if (http_open_network(newfilename,&httpfile,contentencoding,
			    &contentlength)) {
	alarm(0);
	alarm(NETTIMEOUT);
	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*NETTIMEOUT,
       Given the choices for nettimeout above they'll probaby ^C before, but
       it's always worth a shot*/
    
    alarm(NETTIMEOUT*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) {
      sprintf(errorstr,"Content-Length not a multiple of 2880 (http_open) %d",
	      contentlength);
      ffpmsg(errorstr);
    }

    /* write a memory file */
    alarm(NETTIMEOUT);
    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(NETTIMEOUT); /* 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 recbuf[MAXLEN];
  long len;
  int contentlength;
  int ii, flen, status;
  char firstchar;

  closehttpfile = 0;
  closediskfile = 0;
  closefdiskfile = 0;
  closememfile = 0;

  /* cfileio made a mistake, should set the netoufile first otherwise 
     we don't know where to write the output file */

  flen = strlen(netoutfile);
  if (!flen)  {
      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)");
    goto error;
  }

  signal(SIGALRM, signal_handler);
  
  /* Open the http connectin */
  alarm(NETTIMEOUT);
  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(NETTIMEOUT);
    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(NETTIMEOUT);
    }
    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;

  /* cfileio made a mistake, we need to know where to write the file */
  flen = strlen(netoutfile);
  if (!flen) {
      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)");
    goto error;
  }

  signal(SIGALRM, signal_handler);
  
  /* Open the network connection */
  alarm(NETTIMEOUT);
  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*NETTIMEOUT,
       Given the choices for nettimeout above they'll probaby ^C before, but
       it's always worth a shot*/

    alarm(NETTIMEOUT*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) {
      sprintf(errorstr,
	      "Content-Length not a multiple of 2880 (http_file_open) %d",
	      contentlength);
      ffpmsg(errorstr);
    }
    
    /* write a file */
    alarm(NETTIMEOUT);
    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 lenght 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;
  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)) {
    sprintf(errorstr,"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)) {
      sprintf(errorstr,"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)
    sprintf(tmpstr,"GET http://%s:%-d%s HTTP/1.0\r\n",host,port,fn);
  else
    sprintf(tmpstr,"GET %s HTTP/1.0\r\n",fn);

  if (strcmp(userpass, "")) {
    encode64(strlen(userpass), userpass, MAXLEN, tmpstr2);
    sprintf(tmpstr1, "Authorization: Basic %s\r\n", tmpstr2);

    if (strlen(tmpstr) + strlen(tmpstr1) > MAXLEN - 1)
        return (FILE_NOT_OPENED);

    strcat(tmpstr,tmpstr1);
  }

  sprintf(tmpstr1,"User-Agent: HEASARC/CFITSIO/%-8.3f\r\n",ffvers(&version));

  if (strlen(tmpstr) + strlen(tmpstr1) > MAXLEN - 1)
        return (FILE_NOT_OPENED);

  strcat(tmpstr,tmpstr1);

  /* HTTP 1.1 servers require the following 'Host: ' string */
  sprintf(tmpstr1,"Host: %s:%-d\r\n\r\n",host,port);

  if (strlen(tmpstr) + strlen(tmpstr1) > MAXLEN - 1)
        return (FILE_NOT_OPENED);

  strcat(tmpstr,tmpstr1);

  status = NET_SendRaw(sock,tmpstr,strlen(tmpstr),NET_DEFAULT);

  /* read the header */
  if (!(fgets(recbuf,MAXLEN,*httpfile))) {
    sprintf (errorstr,"http header short (http_open_network) %s",recbuf);
    ffpmsg(errorstr);
    fclose(*httpfile);
    return (FILE_NOT_OPENED);
  }
  *contentlength = 0;
  contentencoding[0] = '\0';

  /* Our choices are 200, ok, 301, temporary redirect, or 302 perm redirect */
  sscanf(recbuf,"%s %d",tmpstr,&status);
  if (status != 200){
    if (status == 301 || status == 302) {
      /* got a redirect */
      if (status == 301) {
	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," 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 */
	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 
   file is uncompressed if necessary */

int ftp_open(char *filename, int rwmode, int *handle)
{

  FILE *ftpfile;
  FILE *command;
  int sock;
  char newfilename[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 (http_open)");
    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(NETTIMEOUT);
  strcpy(newfilename,filename);
  /* Does the file have a .Z or .gz in it */
  if (strstr(newfilename,".Z") || strstr(newfilename,".gz")) {
    alarm(NETTIMEOUT);
    if (ftp_open_network(filename,&ftpfile,&command,&sock)) {

      alarm(0);
      ffpmsg("Unable to open ftp file (ftp_open)");
      ffpmsg(filename);
      goto error;
    } 
  } else {
    /* Try the .gz one */
    strcpy(newfilename,filename);
    strcat(newfilename,".gz");
    alarm(NETTIMEOUT);
    if (ftp_open_network(newfilename,&ftpfile,&command,&sock)) {
      
      alarm(0);
      strcpy(newfilename,filename);
      strcat(newfilename,".Z");
      alarm(NETTIMEOUT);
      if (ftp_open_network(newfilename,&ftpfile,&command,&sock)) {
	
	/* Now as given */
	alarm(0);
	strcpy(newfilename,filename);
	alarm(NETTIMEOUT);
	if (ftp_open_network(newfilename,&ftpfile,&command,&sock)) {
	  alarm(0);
	  ffpmsg("Unable to open ftp file (ftp_open)");
          ffpmsg(newfilename);
	  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(newfilename,".gz") || 
      strstr(newfilename,".Z") ||
      ('\037' == firstchar)) {
    
    status = 0;
    /* A bit arbritary really, the user will probably hit ^C */
    alarm(NETTIMEOUT*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(NETTIMEOUT);
    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(NETTIMEOUT);
    }
  }

  /* close and clean up */
  fclose(ftpfile);
  closeftpfile--;

  NET_SendRaw(sock,"QUIT\n",5,NET_DEFAULT);
  fclose(command);
  closecommandfile--;

  signal(SIGALRM, SIG_DFL);
  alarm(0);

  return mem_seek(*handle,0);

 error:
  alarm(0); /* clear it */
  if (closecommandfile) {
    fclose(command);
  }
  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 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 (http_open)");
    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(NETTIMEOUT);
  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*NETTIMEOUT,
       Given the choices for nettimeout above they'll probaby ^C before, but
       it's always worth a shot*/

    alarm(NETTIMEOUT*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(NETTIMEOUT);
    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(NETTIMEOUT);
    }
    file_close(*handle);
  }
  fclose(ftpfile);
  closeftpfile--;
  
  NET_SendRaw(sock,"QUIT\n",5,NET_DEFAULT);
  fclose(command);
  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);
  }
  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 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 (http_open)");
    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(NETTIMEOUT);

  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(NETTIMEOUT);
    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(NETTIMEOUT);
    }

    file_close(*handle);
    closediskfile--;
    fclose(ftpfile);
    closeftpfile--;
    /* Close down the ftp connection */
    NET_SendRaw(sock,"QUIT\n",5,NET_DEFAULT);
    fclose(command);
    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);
  }
  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 */

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 *newhost;
  char *username;
  char *password;
  char fn[MAXLEN];
  char *newfn;
  char *passive;
  char *tstr;
  char ip[SHORTLEN];
  char turl[MAXLEN];
  int port;

  /* parse the URL */
  if (strlen(filename) > MAXLEN - 7) {
    ffpmsg("ftp filename is too long (ftp_open)");
    return (FILE_NOT_OPENED);
  }

  strcpy(turl,"ftp://");
  strcat(turl,filename);
  if (NET_ParseUrl(turl,proto,host,&port,fn)) {
    sprintf(errorstr,"URL Parse Error (ftp_open) %s",filename);
    ffpmsg(errorstr);
    return (FILE_NOT_OPENED);
  }
#ifdef DEBUG
  printf ("proto, %s, host, %s, port %d, fn %s\n",proto,host,port,fn);
#endif
  
  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;
  }
  
#ifdef DEBUG
  printf("User %s pass %s\n",username,password); 
#endif
  
  /* 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)");
    return (FILE_NOT_OPENED);
    
  }

  /* Wait for the 220 response */
  if (ftp_status(*command,"220 ")) {
    ffpmsg ("error connecting to remote server, no 220 seen (ftp_open)");
    fclose(*command);
    return (FILE_NOT_OPENED);
  }
  
  /* Send the user name and wait for the right response */
  sprintf(tmpstr,"USER %s\n",username);
  status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT);
  
  if (ftp_status(*command,"331 ")) {
    ffpmsg ("USER error no 331 seen (ftp_open)");
    fclose(*command);
    return (FILE_NOT_OPENED);
    
  }
  
  /* Send the password and wait for the right response */
  sprintf(tmpstr,"PASS %s\n",password);
  status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT);
  
  if (ftp_status(*command,"230 ")) {
    ffpmsg ("PASS error, no 230 seen (ftp_open)");
    fclose(*command);
    return (FILE_NOT_OPENED);
  }
  
  
  /* now do the cwd command */
  newfn = strrchr(fn,'/');
  if (newfn == NULL) {
    strcpy(tmpstr,"CWD /\n");
    newfn = fn;
  } else {
    *newfn = '\0';
    newfn++;
    if (strlen(fn) == 0) {
      strcpy(tmpstr,"CWD /\n");
    } else {
      /* remove the leading slash */
      if (fn[0] == '/') {
	sprintf(tmpstr,"CWD %s\n",&fn[1]);
      } else {
	sprintf(tmpstr,"CWD %s\n",fn);
      } 
    }
  }
  
#ifdef DEBUG
  printf("CWD command is %s\n",tmpstr);
#endif
  status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT);
  
  if (ftp_status(*command,"250 ")) {
    ffpmsg ("CWD error, no 250 seen (ftp_open)");
    fclose(*command);
    return (FILE_NOT_OPENED);
  }
  
  if (!strlen(newfn)) {
    ffpmsg("Null file name (ftp_open)");
    fclose(*command);
    return (FILE_NOT_OPENED);
  }
  
 
  /* Always use binary mode */
  sprintf(tmpstr,"TYPE I\n");
  status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT);
  
  if (ftp_status(*command,"200 ")) {
    ffpmsg ("TYPE I error, 200 not seen (ftp_open)");
    fclose(*command);
    return (FILE_NOT_OPENED);
  }
 
  status = NET_SendRaw(*sock,"PASV\n",5,NET_DEFAULT);
  if (!(fgets(recbuf,MAXLEN,*command))) {
    ffpmsg ("PASV error (ftp_open)");
    fclose(*command);
    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)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    
    *passive = '\0';
    passive++;
    ip[0] = '\0';
      
    /* Messy parsing of response from PASV *command */
    
    if (!(tstr = strtok(passive,",)"))) {
      ffpmsg ("PASV error (ftp_open)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    strcpy(ip,tstr);
    strcat(ip,".");
    
    if (!(tstr = strtok(NULL,",)"))) {
      ffpmsg ("PASV error (ftp_open)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    strcat(ip,tstr);
    strcat(ip,".");
    
    if (!(tstr = strtok(NULL,",)"))) {
      ffpmsg ("PASV error (ftp_open)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    strcat(ip,tstr);
    strcat(ip,".");
    
    if (!(tstr = strtok(NULL,",)"))) {
      ffpmsg ("PASV error (ftp_open)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    strcat(ip,tstr);
    
    /* Done the ip number, now do the port # */
    if (!(tstr = strtok(NULL,",)"))) {
      ffpmsg ("PASV error (ftp_open)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    sscanf(tstr,"%d",&port);
    port *= 256;
    
    if (!(tstr = strtok(NULL,",)"))) {
      ffpmsg ("PASV error (ftp_open)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    sscanf(tstr,"%d",&tmpint);
    port += tmpint;
    
    
    if (!strlen(newfn)) {
      ffpmsg("Null file name (ftp_open)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }
    

#ifdef DEBUG
    puts("connection to passive port");
#endif
    /* 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)");
      fclose(*command);
      return (FILE_NOT_OPENED);
    }

    /* now we return */

    /* Send the retrieve command */
    sprintf(tmpstr,"RETR %s\n",newfn);
    status = NET_SendRaw(*sock,tmpstr,strlen(tmpstr),NET_DEFAULT);

#ifdef DEBUG
    puts("Sent RETR command");
#endif
    if (ftp_status(*command,"150 ")) {
    /*  ffpmsg ("RETR error, most likely file is not there (ftp_open)"); */
      fclose(*command);
#ifdef DEBUG
      puts("File not there");
#endif
      return (FILE_NOT_OPENED);
    }
    return 0;
  }
  
  /* no passive mode */

  NET_SendRaw(*sock,"QUIT\n",5,NET_DEFAULT);
  fclose(*command);
  return (FILE_NOT_OPENED);
}

/*--------------------------------------------------------------------------*/
/* return a socket which results from connection to hostname on port port */
static 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("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;
     }
#ifdef DEBUG
     printf ("send raw, sent %d bytes\n",nsent);
#endif
   }
#ifdef DEBUG
   printf ("send raw end, sent %d bytes\n",n);
#endif
   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;

    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 */
    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) {
    strcpy(fn,urlcopy);
  }
  free(urlcopyorig);
  return 0;
}

/*--------------------------------------------------------------------------*/

/* Small helper functions to set the netoutfile static string */
/* Called by cfileio after parsing the output file off of the input file url */

int http_checkfile (char *urltype, char *infile, char *outfile1)
{
  char newinfile[MAXLEN];
  FILE *httpfile;
  char contentencoding[MAXLEN];
  int contentlength;
  
  /* default to http:// if there is no output file */
    
  strcpy(urltype,"http://");

  if (strlen(outfile1)) {
    /* there is an output file */

    /* 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 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; don't open it */
      strcpy(urltype,"httpfile://");
      return 0;
    }

    if (!http_open_network(infile,&httpfile,contentencoding,&contentlength)) {
      fclose(httpfile);
      /* It's there, we're happy */
      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;
    }

    /* Ok, let's try the .gz one */
    strcpy(newinfile,infile);
    strcat(newinfile,".gz");
    if (!http_open_network(newinfile,&httpfile,contentencoding,
			   &contentlength)) {
      fclose(httpfile);
      strcpy(infile,newinfile);
      /* It's there, we're happy, and, it's compressed  */
      /* It's compressed */
      if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) {
	strcpy(urltype,"httpcompress://");
      } else {
	strcpy(urltype,"httpfile://");
      }
      return 0;
    }
    
    /* Ok, let's try the .Z one */
    strcpy(newinfile,infile);
    strcat(newinfile,".Z");
    if (!http_open_network(newinfile,&httpfile,contentencoding,
			   &contentlength)) {
      fclose(httpfile);
      strcpy(infile,newinfile);
      /* It's there, we're happy, and, it's compressed  */
      if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) {
	strcpy(urltype,"httpcompress://");
      } else {
	strcpy(urltype,"httpfile://");
      }
      return 0;
    }
    
  } 
  return 0;
}
/*--------------------------------------------------------------------------*/
int ftp_checkfile (char *urltype, char *infile, char *outfile1)
{
  char newinfile[MAXLEN];
  FILE *ftpfile;
  FILE *command;
  int sock;

  
  /* default to ftp://   */
    
  strcpy(urltype,"ftp://");

  if (strlen(outfile1)) {
    /* there is an output file */

    /* 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 (!ftp_open_network(infile,&ftpfile,&command,&sock)) {
      fclose(ftpfile);
      fclose(command);
      /* It's there, we're happy */
      if (strstr(infile,".gz") || (strstr(infile,".Z"))) {
	/* It's compressed */
	if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) {
	  strcpy(urltype,"ftpcompress://");
	} else {
	  strcpy(urltype,"ftpfile://");
	}
      } else {
	strcpy(urltype,"ftpfile://");
      }
      return 0;
    }

    /* Ok, let's try the .gz one */
    strcpy(newinfile,infile);
    strcat(newinfile,".gz");
    if (!ftp_open_network(newinfile,&ftpfile,&command,&sock)) {
      fclose(ftpfile);
      fclose(command);
      strcpy(infile,newinfile);
      /* It's there, we're happy, and, it's compressed  */
      if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) {
	strcpy(urltype,"ftpcompress://");
      } else {
	strcpy(urltype,"ftpfile://");
      }
      return 0;
    }
    
    /* Ok, let's try the .Z one */
    strcpy(newinfile,infile);
    strcat(newinfile,".Z");
    if (!ftp_open_network(newinfile,&ftpfile,&command,&sock)) {
      fclose(ftpfile);
      fclose(command);
      strcpy(infile,newinfile);
      if (strstr(outfile1,".gz") || (strstr(outfile1,".Z"))) {
	strcpy(urltype,"ftpcompress://");
      } else {
	strcpy(urltype,"ftpfile://");
      }
      return 0;
    }
    
  } 
  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 */

  char recbuf[MAXLEN];
  int len;

  len = strlen(statusstr);
  while (1) {
    if (!(fgets(recbuf,MAXLEN,ftp))) {
#ifdef DEBUG
      puts("error reading response in ftp_status");
#endif
      return 1; /* error reading */
    }
    
#ifdef DEBUG
    printf("ftp_status, return string was %s\n",recbuf);
#endif

    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 */
      return 1; 
    }
  }
}


/*
 *----------------------------------------------------------------------
 *
 * 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 */
  sprintf(msg,"%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);
  }
#ifdef DEBUG
  printf("root_read, op %d astat %d\n",op,astat);
#endif
  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 */
  sprintf(msg,"%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);
#ifdef DEBUG
  printf("root_read, op %d astat %d\n",op,astat);
#endif
  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 */
  strcpy(turl,"root://");
  strcat(turl,url);
  if (NET_ParseUrl(turl,proto,host,&port,fn)) {
    sprintf(errorstr,"URL Parse Error (root_open) %s",url);
    ffpmsg(errorstr);
    return (FILE_NOT_OPENED);
  }
  
#ifdef DEBUG
  printf("Connecting to %s on port %d\n",host,port);
#endif
  /* Connect to the remote host */
  *sock = NET_TcpConnect(host,port);
  if (*sock < 0) {
    ffpmsg("Couldn't connect to host (http_open_network)");
    return (FILE_NOT_OPENED);
  }
  
  /* get the username */
  if (NULL != getenv("ROOTUSERNAME")) {
    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);
  }
  
#ifdef DEBUG
  printf("op is %d and authstat is %d\n",op,authstat);
#endif
  
  if (op != ROOTD_AUTH) {
    ffpmsg("ERROR on ROOTD_USER");
    ffpmsg(recbuf);
    return (FILE_NOT_OPENED);
  }
  

  /* now the password */
  if (NULL != getenv("ROOTPASSWORD")) {
    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
     
     

      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);

#ifdef DEBUG
  printf("len sent is %x\n",hdr[0]);
#endif

  hdr[1] = htonl(op);
#ifdef DEBUG
  printf("op sent is %x\n",hdr[1]);
#endif
  

#ifdef DEBUG
  printf("Sending op %d and length of %d\n",op,len);
#endif

  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);
#ifdef DEBUG
  printf("Recv: status from rec is %d\n",status);
#endif
  if (status < 0) {
    return status;
  }
  recv1 += status;

  len = ntohl(len);
#ifdef DEBUG
  printf ("Recv: length is %d\n",len);
#endif

  /* 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);
#ifdef DEBUG
  printf ("Recv: Operation is %d\n",*op);
#endif
  
  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 "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  */
                sprintf(message, 
                    "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 */
        {
         sprintf(message,
          "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 == 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, *tptr;
    
    cptr = output;
    tptr = 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);
}
healpy-1.8.1/cfitsio/makefile.bc0000654000175000017530000003072212272000775017144 0ustar  zoncaplanck00000000000000#
# 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
| $@


healpy-1.8.1/cfitsio/putcol.c0000654000175000017530000017765012272000775016547 0ustar  zoncaplanck00000000000000/*  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 == 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 == 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 == 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 == 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 == 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 == 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 == 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 == 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 == 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;
    strcpy(col->colname, colname);
    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
*/
{
    strcpy(col->colname, colname);
    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) {
	      sprintf(message,
              "Variable length array not allowed for output column number %d (ffiter)",
                    jj + 1);
	    } else {
            sprintf(message,
                   "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)
            {
                sprintf(message,
                "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)
            {
                sprintf(message,
                "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) )
                {
                    sprintf(message,
                      "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)
            {
                sprintf(message,
                  "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) {
 	        sprintf(message,
                "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)
            {
                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)
            {
                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)
          {
              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)
          {
              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)
          {
              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)
          {
              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)
          {
              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)
          {
              tnull = minvalue(tnull, INT32_MAX);
              tnull = maxvalue(tnull, 0);
              col[jj].null.uintnull = (unsigned int) tnull;
          }
          else
          {
              col[jj].null.intnull = 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)
          {
              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)
          {
              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)
          {
              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)
          {
              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)
          {
              col[jj].null.longlongnull = tnull;
          }
          else
          {
              col[jj].null.longlongnull = LONGLONG_MIN;   /* use minimum as null */
          }
          break;

         default:
          sprintf(message,
                  "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);
}

healpy-1.8.1/cfitsio/longnam.h0000654000175000017530000005010012272000775016655 0ustar  zoncaplanck00000000000000#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_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_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_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_read_key_longstr  ffgkls
#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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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

#endif
healpy-1.8.1/cfitsio/putcold.c0000654000175000017530000011206612272000775016701 0ustar  zoncaplanck00000000000000/*  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  */
                sprintf(message, 
                      "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 */
        {
          sprintf(message,
          "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 == 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);
}
healpy-1.8.1/cfitsio/region.h0000654000175000017530000000415512272000775016516 0ustar  zoncaplanck00000000000000/***************************************************************/
/*                   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);


healpy-1.8.1/cfitsio/README.MacOS0000654000175000017530000000414012272000775016675 0ustar  zoncaplanck00000000000000To build CFITSIO library on an Intel Mac as a Universal Binary

Unzip the library:
- tar xzf cfitsio3060.tar.gz (or whatever version this is)

- cd cfitsio/

- copy the cfitsio-xcodeproj.zip file here

- unzip cfitsio-xcodeproj.zip

- start Xcode and open cfitsio.xcodeproj

- expand the "Targets" menu under "Groups & Files" 

- choose one of the following build options:

  * right-click on Build PPC -> Build "Build PPC"

  * right-click on Build i386 -> Build "Build i386"

  * right-click on Build x86_64 -> Build "Build x86_64"

  * right-click on Build Universal -> Build "Build Universal"
    (Builds all three of the above options, i.e. a Universal Binary
     usable on ppc, i386, and x86_64 architectures)

  (For some reason clicking on the menu "Build" icon doesn't seem to
   work correctly, but the right-click menus do).

-------------------------------------------------------

Another way to build the universal binary:

- unpack the cfitsio source code tar file
- cd cfitsio

Set the CFLAGS environment variable for building a Universal Binary:

  C-Shell variants:
  setenv CFLAGS "-arch ppc -arch i386 -arch x86_64 -g -O2"

  Bourne Shell variants:
  export CFLAGS="-arch ppc -arch i386 -arch x86_64 -g -O2"

Then proceed with the standard cfitsio build, i.e.:

- ./configure
- make
- make install


-------------------------------------------------------

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.

healpy-1.8.1/cfitsio/cfitsio_mac.sit.hqx0000654000175000017530000005550612272000775020670 0ustar  zoncaplanck00000000000000(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!!!:
healpy-1.8.1/cfitsio/putcolui.c0000654000175000017530000010275512272000775017077 0ustar  zoncaplanck00000000000000/*  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  */
                sprintf(message, 
                    "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 */
        {
         sprintf(message,
          "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 == 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);
}
healpy-1.8.1/cfitsio/testf77.out0000654000175000017530000010122312272000775017110 0ustar  zoncaplanck00000000000000 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                                     
healpy-1.8.1/cfitsio/README_OLD.win0000654000175000017530000000671612272000775017241 0ustar  zoncaplanck00000000000000===============================================================================
===============================================================================
= 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'.

healpy-1.8.1/cfitsio/testprog.out0000654000175000017530000007673712272000775017501 0ustar  zoncaplanck00000000000000CFITSIO 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
healpy-1.8.1/cfitsio/config.guess0000755000175000017530000012776412272000775017415 0ustar  zoncaplanck00000000000000#! /bin/sh
# Attempt to guess a canonical system name.
#   Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
#   2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
#   Free Software Foundation, Inc.

timestamp='2010-08-21'

# 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 2 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, write to the Free Software
# Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
# 02110-1301, USA.
#
# 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.


# Originally written by Per Bothner.  Please send patches (context
# diff format) to  and include a ChangeLog
# entry.
#
# This script attempts to guess a canonical system name similar to
# config.sub.  If it succeeds, it prints the system name on stdout, and
# exits with 0.  Otherwise, it exits with 1.
#
# You can get the latest version of this script from:
# http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD

me=`echo "$0" | sed -e 's,.*/,,'`

usage="\
Usage: $0 [OPTION]

Output the configuration name of the system \`$me' is run on.

Operation modes:
  -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 (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 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' HUP INT TERM

# 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" HUP INT PIPE TERM ;
: ${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

# 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 tupples: *-*-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=`(/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 ;;
	    *) machine=${UNAME_MACHINE_ARCH}-unknown ;;
	esac
	# The Operating System including object format, if it has switched
	# to ELF recently, or will in the future.
	case "${UNAME_MACHINE_ARCH}" in
	    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
	# 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/[-_].*/\./'`
		;;
	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}"
	exit ;;
    *:OpenBSD:*:*)
	UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`
	echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${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 ;;
    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'`
	exit ;;
    Alpha\ *:Windows_NT*:*)
	# How do we know it's Interix rather than the generic POSIX subsystem?
	# Should we change UNAME_MACHINE based on the output of uname instead
	# of the specific Alpha model?
	echo alpha-pc-interix
	exit ;;
    21064:Windows_NT:50:3)
	echo alpha-dec-winnt3.5
	exit ;;
    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/oslevel ] ; then
		IBM_REV=`/usr/bin/oslevel`
	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:BSD:*)
	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:*:*)
	case ${UNAME_MACHINE} in
	    pc98)
		echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
	    amd64)
		echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
	    *)
		echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
	esac
	exit ;;
    i*:CYGWIN*:*)
	echo ${UNAME_MACHINE}-pc-cygwin
	exit ;;
    *:MINGW*:*)
	echo ${UNAME_MACHINE}-pc-mingw32
	exit ;;
    i*:windows32*:*)
    	# uname -m includes "-pc" on this system.
    	echo ${UNAME_MACHINE}-mingw32
	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 ;;
    [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*)
	echo i${UNAME_MACHINE}-pc-mks
	exit ;;
    8664:Windows_NT:*)
	echo x86_64-pc-mks
	exit ;;
    i*:Windows_NT*:* | Pentium*:Windows_NT*:*)
	# How do we know it's Interix rather than the generic POSIX subsystem?
	# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we
	# UNAME_MACHINE based on the output of uname instead of i386?
	echo i586-pc-interix
	exit ;;
    i*:UWIN*:*)
	echo ${UNAME_MACHINE}-pc-uwin
	exit ;;
    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)
	echo x86_64-unknown-cygwin
	exit ;;
    p*:CYGWIN*:*)
	echo powerpcle-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-gnu`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 '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu
	exit ;;
    i*86:Minix:*:*)
	echo ${UNAME_MACHINE}-pc-minix
	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="libc1" ; else LIBC="" ; fi
	echo ${UNAME_MACHINE}-unknown-linux-gnu${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-gnu
	else
	    echo ${UNAME_MACHINE}-unknown-linux-gnueabi
	fi
	exit ;;
    avr32*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    cris:Linux:*:*)
	echo cris-axis-linux-gnu
	exit ;;
    crisv32:Linux:*:*)
	echo crisv32-axis-linux-gnu
	exit ;;
    frv:Linux:*:*)
    	echo frv-unknown-linux-gnu
	exit ;;
    i*86:Linux:*:*)
	LIBC=gnu
	eval $set_cc_for_build
	sed 's/^	//' << EOF >$dummy.c
	#ifdef __dietlibc__
	LIBC=dietlibc
	#endif
EOF
	eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC'`
	echo "${UNAME_MACHINE}-pc-linux-${LIBC}"
	exit ;;
    ia64:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    m32r*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    m68*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	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-gnu"; exit; }
	;;
    or32:Linux:*:*)
	echo or32-unknown-linux-gnu
	exit ;;
    padre:Linux:*:*)
	echo sparc-unknown-linux-gnu
	exit ;;
    parisc64:Linux:*:* | hppa64:Linux:*:*)
	echo hppa64-unknown-linux-gnu
	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-gnu ;;
	  PA8*) echo hppa2.0-unknown-linux-gnu ;;
	  *)    echo hppa-unknown-linux-gnu ;;
	esac
	exit ;;
    ppc64:Linux:*:*)
	echo powerpc64-unknown-linux-gnu
	exit ;;
    ppc:Linux:*:*)
	echo powerpc-unknown-linux-gnu
	exit ;;
    s390:Linux:*:* | s390x:Linux:*:*)
	echo ${UNAME_MACHINE}-ibm-linux
	exit ;;
    sh64*:Linux:*:*)
    	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    sh*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    sparc:Linux:*:* | sparc64:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    tile*:Linux:*:*)
	echo ${UNAME_MACHINE}-tilera-linux-gnu
	exit ;;
    vax:Linux:*:*)
	echo ${UNAME_MACHINE}-dec-linux-gnu
	exit ;;
    x86_64:Linux:*:*)
	echo x86_64-unknown-linux-gnu
	exit ;;
    xtensa*:Linux:*:*)
    	echo ${UNAME_MACHINE}-unknown-linux-gnu
	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.*:* | i*86:SYSTEM_V: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 configury 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 ;;
    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 ;;
    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
	case $UNAME_PROCESSOR in
	    i386)
		eval $set_cc_for_build
		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
		      UNAME_PROCESSOR="x86_64"
		  fi
		fi ;;
	    unknown) UNAME_PROCESSOR=powerpc ;;
	esac
	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 ;;
    NSE-?:NONSTOP_KERNEL:*:*)
	echo nse-tandem-nsk${UNAME_RELEASE}
	exit ;;
    NSR-?:NONSTOP_KERNEL:*:*)
	echo nsr-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 ;;
esac

#echo '(No uname command or uname output not recognized.)' 1>&2
#echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2

eval $set_cc_for_build
cat >$dummy.c <
# include 
#endif
main ()
{
#if defined (sony)
#if defined (MIPSEB)
  /* BFD wants "bsd" instead of "newsos".  Perhaps BFD should be changed,
     I don't know....  */
  printf ("mips-sony-bsd\n"); exit (0);
#else
#include 
  printf ("m68k-sony-newsos%s\n",
#ifdef NEWSOS4
          "4"
#else
	  ""
#endif
         ); exit (0);
#endif
#endif

#if defined (__arm) && defined (__acorn) && defined (__unix)
  printf ("arm-acorn-riscix\n"); exit (0);
#endif

#if defined (hp300) && !defined (hpux)
  printf ("m68k-hp-bsd\n"); exit (0);
#endif

#if defined (NeXT)
#if !defined (__ARCHITECTURE__)
#define __ARCHITECTURE__ "m68k"
#endif
  int version;
  version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`;
  if (version < 4)
    printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version);
  else
    printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version);
  exit (0);
#endif

#if defined (MULTIMAX) || defined (n16)
#if defined (UMAXV)
  printf ("ns32k-encore-sysv\n"); exit (0);
#else
#if defined (CMU)
  printf ("ns32k-encore-mach\n"); exit (0);
#else
  printf ("ns32k-encore-bsd\n"); exit (0);
#endif
#endif
#endif

#if defined (__386BSD__)
  printf ("i386-pc-bsd\n"); exit (0);
#endif

#if defined (sequent)
#if defined (i386)
  printf ("i386-sequent-dynix\n"); exit (0);
#endif
#if defined (ns32000)
  printf ("ns32k-sequent-dynix\n"); exit (0);
#endif
#endif

#if defined (_SEQUENT_)
    struct utsname un;

    uname(&un);

    if (strncmp(un.version, "V2", 2) == 0) {
	printf ("i386-sequent-ptx2\n"); exit (0);
    }
    if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */
	printf ("i386-sequent-ptx1\n"); exit (0);
    }
    printf ("i386-sequent-ptx\n"); exit (0);

#endif

#if defined (vax)
# if !defined (ultrix)
#  include 
#  if defined (BSD)
#   if BSD == 43
      printf ("vax-dec-bsd4.3\n"); exit (0);
#   else
#    if BSD == 199006
      printf ("vax-dec-bsd4.3reno\n"); exit (0);
#    else
      printf ("vax-dec-bsd\n"); exit (0);
#    endif
#   endif
#  else
    printf ("vax-dec-bsd\n"); exit (0);
#  endif
# else
    printf ("vax-dec-ultrix\n"); exit (0);
# endif
#endif

#if defined (alliant) && defined (i860)
  printf ("i860-alliant-bsd\n"); exit (0);
#endif

  exit (1);
}
EOF

$CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` &&
	{ echo "$SYSTEM_NAME"; exit; }

# Apollos put the system type in the environment.

test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; }

# Convex versions that predate uname can use getsysinfo(1)

if [ -x /usr/convex/getsysinfo ]
then
    case `getsysinfo -f cpu_type` in
    c1*)
	echo c1-convex-bsd
	exit ;;
    c2*)
	if getsysinfo -f scalar_acc
	then echo c32-convex-bsd
	else echo c2-convex-bsd
	fi
	exit ;;
    c34*)
	echo c34-convex-bsd
	exit ;;
    c38*)
	echo c38-convex-bsd
	exit ;;
    c4*)
	echo c4-convex-bsd
	exit ;;
    esac
fi

cat >&2 < in order to provide the needed
information to handle your system.

config.guess timestamp = $timestamp

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`
/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-hooks 'time-stamp)
# time-stamp-start: "timestamp='"
# time-stamp-format: "%:y-%02m-%02d"
# time-stamp-end: "'"
# End:
healpy-1.8.1/cfitsio/eval_l.c0000654000175000017530000016627312272000775016502 0ustar  zoncaplanck00000000000000/* A lexical scanner generated by flex */

/* Scanner skeleton version:
 * $Header: /software/lheasoft/lheavc/hip/cfitsio/eval_l.c,v 3.47 2009/09/04 18:35:05 pence Exp $
 */

#define FLEX_SCANNER
#define FF_FLEX_MAJOR_VERSION 2
#define FF_FLEX_MINOR_VERSION 5

#include 


/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
#ifdef c_plusplus
#ifndef __cplusplus
#define __cplusplus
#endif
#endif


#ifdef __cplusplus

#include 
#include 

/* Use prototypes in function declarations. */
#define FF_USE_PROTOS

/* The "const" storage-class-modifier is valid. */
#define FF_USE_CONST

#else	/* ! __cplusplus */

#if __STDC__

#define FF_USE_PROTOS
#define FF_USE_CONST

#endif	/* __STDC__ */
#endif	/* ! __cplusplus */

#ifdef __TURBOC__
 #pragma warn -rch
 #pragma warn -use
#include 
#include 
#define FF_USE_CONST
#define FF_USE_PROTOS
#endif

#ifdef FF_USE_CONST
#define ffconst const
#else
#define ffconst
#endif


#ifdef FF_USE_PROTOS
#define FF_PROTO(proto) proto
#else
#define FF_PROTO(proto) ()
#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. */
#define FF_BUF_SIZE 16384

typedef struct ff_buffer_state *FF_BUFFER_STATE;

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

/* The funky do-while in the following #define is used to turn the definition
 * int a single C statement (which needs a semi-colon terminator).  This
 * avoids problems with code like:
 *
 * 	if ( condition_holds )
 *		ffless( 5 );
 *	else
 *		do_something_else();
 *
 * Prior to using the do-while the compiler would get upset at the
 * "else" because it interpreted the "if" statement as being all
 * done when it reached the ';' after the ffless() call.
 */

/* Return all but the first 'n' matched characters back to the input stream. */

#define ffless(n) \
	do \
		{ \
		/* Undo effects of setting up fftext. */ \
		*ff_cp = ff_hold_char; \
		FF_RESTORE_FF_MORE_OFFSET \
		ff_c_buf_p = ff_cp = ff_bp + n - FF_MORE_ADJ; \
		FF_DO_BEFORE_ACTION; /* set up fftext again */ \
		} \
	while ( 0 )

#define unput(c) ffunput( c, fftext_ptr )

/* The following is because we cannot portably get our hands on size_t
 * (without autoconf's help, which isn't available because we want
 * flex-generated scanners to compile on their own).
 */
typedef unsigned int ff_size_t;


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;

	/* 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
	};

static FF_BUFFER_STATE ff_current_buffer = 0;

/* 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".
 */
#define FF_CURRENT_BUFFER ff_current_buffer


/* 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 = 1;		/* 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 FF_PROTO(( FILE *input_file ));

void ff_switch_to_buffer FF_PROTO(( FF_BUFFER_STATE new_buffer ));
void ff_load_buffer_state FF_PROTO(( void ));
FF_BUFFER_STATE ff_create_buffer FF_PROTO(( FILE *file, int size ));
void ff_delete_buffer FF_PROTO(( FF_BUFFER_STATE b ));
void ff_init_buffer FF_PROTO(( FF_BUFFER_STATE b, FILE *file ));
void ff_flush_buffer FF_PROTO(( FF_BUFFER_STATE b ));
#define FF_FLUSH_BUFFER ff_flush_buffer( ff_current_buffer )

FF_BUFFER_STATE ff_scan_buffer FF_PROTO(( char *base, ff_size_t size ));
FF_BUFFER_STATE ff_scan_string FF_PROTO(( ffconst char *ff_str ));
FF_BUFFER_STATE ff_scan_bytes FF_PROTO(( ffconst char *bytes, int len ));

static void *ff_flex_alloc FF_PROTO(( ff_size_t ));
static void *ff_flex_realloc FF_PROTO(( void *, ff_size_t ));
static void ff_flex_free FF_PROTO(( void * ));

#define ff_new_buffer ff_create_buffer

#define ff_set_interactive(is_interactive) \
	{ \
	if ( ! ff_current_buffer ) \
		ff_current_buffer = ff_create_buffer( ffin, FF_BUF_SIZE ); \
	ff_current_buffer->ff_is_interactive = is_interactive; \
	}

#define ff_set_bol(at_bol) \
	{ \
	if ( ! ff_current_buffer ) \
		ff_current_buffer = ff_create_buffer( ffin, FF_BUF_SIZE ); \
	ff_current_buffer->ff_at_bol = at_bol; \
	}

#define FF_AT_BOL() (ff_current_buffer->ff_at_bol)

typedef unsigned char FF_CHAR;
FILE *ffin = (FILE *) 0, *ffout = (FILE *) 0;
typedef int ff_state_type;
extern char *fftext;
#define fftext_ptr fftext

static ff_state_type ff_get_previous_state FF_PROTO(( void ));
static ff_state_type ff_try_NUL_trans FF_PROTO(( ff_state_type current_state ));
static int ff_get_next_buffer FF_PROTO(( void ));
static void ff_fatal_error FF_PROTO(( 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 = (int) (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
static ffconst short int 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 int 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 int 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 short int 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 short int 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 short int 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 short int 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;

/* 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"
#define INITIAL 0
#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" );


/* Macros after this point can all be overridden by user definitions in
 * section 1.
 */

#ifndef FF_SKIP_FFWRAP
#ifdef __cplusplus
extern "C" int ffwrap FF_PROTO(( void ));
#else
extern int ffwrap FF_PROTO(( void ));
#endif
#endif

#ifndef FF_NO_UNPUT
static void ffunput FF_PROTO(( int c, char *buf_ptr ));
#endif

#ifndef fftext_ptr
static void ff_flex_strncpy FF_PROTO(( char *, ffconst char *, int ));
#endif

#ifdef FF_NEED_STRLEN
static int ff_flex_strlen FF_PROTO(( ffconst char * ));
#endif

#ifndef FF_NO_INPUT
#ifdef __cplusplus
static int ffinput FF_PROTO(( void ));
#else
static int input FF_PROTO(( void ));
#endif
#endif

#if FF_STACK_USED
static int ff_start_stack_ptr = 0;
static int ff_start_stack_depth = 0;
static int *ff_start_stack = 0;
#ifndef FF_NO_PUSH_STATE
static void ff_push_state FF_PROTO(( int new_state ));
#endif
#ifndef FF_NO_POP_STATE
static void ff_pop_state FF_PROTO(( void ));
#endif
#ifndef FF_NO_TOP_STATE
static int ff_top_state FF_PROTO(( void ));
#endif

#else
#define FF_NO_PUSH_STATE 1
#define FF_NO_POP_STATE 1
#define FF_NO_TOP_STATE 1
#endif

#ifdef FF_MALLOC_DECL
FF_MALLOC_DECL
#else
#if __STDC__
#ifndef __cplusplus
#include 
#endif
#else
/* Just try to get by without declaring the routines.  This will fail
 * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
 * or sizeof(void*) != sizeof(int).
 */
#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 (void) fwrite( fftext, ffleng, 1, ffout )
#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->ff_is_interactive ) \
		{ \
		int c = '*', 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 if ( ((result = fread( buf, 1, max_size, ffin )) == 0) \
		  && ferror( ffin ) ) \
		FF_FATAL_ERROR( "input in flex scanner failed" );
#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

/* Default declaration of generated scanner - a define so the user can
 * easily add parameters.
 */
#ifndef FF_DECL
#define FF_DECL int fflex FF_PROTO(( void ))
#endif

/* 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

FF_DECL
	{
	register ff_state_type ff_current_state;
	register char *ff_cp, *ff_bp;
	register int ff_act;

#line 142 "eval.l"



	if ( ff_init )
		{
		ff_init = 0;

#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 )
			ff_current_buffer =
				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(        !strcasecmp(fftext,"#PI") ) {
		     fflval.dbl = (double)(4) * atan((double)(1));
		     return( DOUBLE );
		  } else if( !strcasecmp(fftext,"#E") ) {
		     fflval.dbl = exp((double)(1));
		     return( DOUBLE );
		  } else if( !strcasecmp(fftext,"#DEG") ) {
		     fflval.dbl = ((double)4)*atan((double)1)/((double)180);
		     return( DOUBLE );
		  } else if( !strcasecmp(fftext,"#ROW") ) {
		     return( ROWREF );
		  } else if( !strcasecmp(fftext,"#NULL") ) {
		     return( NULLREF );
		  } else if( !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:
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
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->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->ff_n_chars;
			ff_current_buffer->ff_input_file = ffin;
			ff_current_buffer->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->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->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()
	{
	register char *dest = ff_current_buffer->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->ff_ch_buf[ff_n_chars + 1] )
		FF_FATAL_ERROR(
		"fatal flex scanner internal error--end of buffer missed" );

	if ( ff_current_buffer->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->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->ff_n_chars = ff_n_chars = 0;

	else
		{
		int num_to_read =
			ff_current_buffer->ff_buf_size - number_to_move - 1;

		while ( num_to_read <= 0 )
			{ /* Not enough room in the buffer - grow it. */
#ifdef FF_USES_REJECT
			FF_FATAL_ERROR(
"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
#else

			/* 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. */
					ff_flex_realloc( (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->ff_buf_size -
						number_to_move - 1;
#endif
			}

		if ( num_to_read > FF_READ_BUF_SIZE )
			num_to_read = FF_READ_BUF_SIZE;

		/* Read in more data. */
		FF_INPUT( (&ff_current_buffer->ff_ch_buf[number_to_move]),
			ff_n_chars, num_to_read );

		ff_current_buffer->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->ff_buffer_status =
				FF_BUFFER_EOF_PENDING;
			}
		}

	else
		ret_val = EOB_ACT_CONTINUE_SCAN;

	ff_n_chars += number_to_move;
	ff_current_buffer->ff_ch_buf[ff_n_chars] = FF_END_OF_BUFFER_CHAR;
	ff_current_buffer->ff_ch_buf[ff_n_chars + 1] = FF_END_OF_BUFFER_CHAR;

	fftext_ptr = &ff_current_buffer->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()
	{
	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 );
 */

#ifdef FF_USE_PROTOS
static ff_state_type ff_try_NUL_trans( ff_state_type ff_current_state )
#else
static ff_state_type ff_try_NUL_trans( ff_current_state )
ff_state_type ff_current_state;
#endif
	{
	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;
	}


#ifndef FF_NO_UNPUT
#ifdef FF_USE_PROTOS
static void ffunput( int c, register char *ff_bp )
#else
static void ffunput( c, ff_bp )
int c;
register char *ff_bp;
#endif
	{
	register char *ff_cp = ff_c_buf_p;

	/* undo effects of setting up fftext */
	*ff_cp = ff_hold_char;

	if ( ff_cp < ff_current_buffer->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->ff_ch_buf[
					ff_current_buffer->ff_buf_size + 2];
		register char *source =
				&ff_current_buffer->ff_ch_buf[number_to_move];

		while ( source > ff_current_buffer->ff_ch_buf )
			*--dest = *--source;

		ff_cp += (int) (dest - source);
		ff_bp += (int) (dest - source);
		ff_current_buffer->ff_n_chars =
			ff_n_chars = ff_current_buffer->ff_buf_size;

		if ( ff_cp < ff_current_buffer->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;
	}
#endif	/* ifndef FF_NO_UNPUT */


#ifdef __cplusplus
static int ffinput()
#else
static int input()
#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->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 );

					/* fall through */

				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;
	}


#ifdef FF_USE_PROTOS
void ffrestart( FILE *input_file )
#else
void ffrestart( input_file )
FILE *input_file;
#endif
	{
	if ( ! ff_current_buffer )
		ff_current_buffer = ff_create_buffer( ffin, FF_BUF_SIZE );

	ff_init_buffer( ff_current_buffer, input_file );
	ff_load_buffer_state();
	}


#ifdef FF_USE_PROTOS
void ff_switch_to_buffer( FF_BUFFER_STATE new_buffer )
#else
void ff_switch_to_buffer( new_buffer )
FF_BUFFER_STATE new_buffer;
#endif
	{
	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->ff_buf_pos = ff_c_buf_p;
		ff_current_buffer->ff_n_chars = ff_n_chars;
		}

	ff_current_buffer = 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;
	}


#ifdef FF_USE_PROTOS
void ff_load_buffer_state( void )
#else
void ff_load_buffer_state()
#endif
	{
	ff_n_chars = ff_current_buffer->ff_n_chars;
	fftext_ptr = ff_c_buf_p = ff_current_buffer->ff_buf_pos;
	ffin = ff_current_buffer->ff_input_file;
	ff_hold_char = *ff_c_buf_p;
	}


#ifdef FF_USE_PROTOS
FF_BUFFER_STATE ff_create_buffer( FILE *file, int size )
#else
FF_BUFFER_STATE ff_create_buffer( file, size )
FILE *file;
int size;
#endif
	{
	FF_BUFFER_STATE b;

	b = (FF_BUFFER_STATE) ff_flex_alloc( 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 *) ff_flex_alloc( 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;
	}


#ifdef FF_USE_PROTOS
void ff_delete_buffer( FF_BUFFER_STATE b )
#else
void ff_delete_buffer( b )
FF_BUFFER_STATE b;
#endif
	{
	if ( ! b )
		return;

	if ( b == ff_current_buffer )
		ff_current_buffer = (FF_BUFFER_STATE) 0;

	if ( b->ff_is_our_buffer )
		ff_flex_free( (void *) b->ff_ch_buf );

	ff_flex_free( (void *) b );
	}


#ifndef FF_ALWAYS_INTERACTIVE
#ifndef FF_NEVER_INTERACTIVE
extern int isatty FF_PROTO(( int ));
#endif
#endif

#ifdef FF_USE_PROTOS
void ff_init_buffer( FF_BUFFER_STATE b, FILE *file )
#else
void ff_init_buffer( b, file )
FF_BUFFER_STATE b;
FILE *file;
#endif


	{
	ff_flush_buffer( b );

	b->ff_input_file = file;
	b->ff_fill_buffer = 1;

#if FF_ALWAYS_INTERACTIVE
	b->ff_is_interactive = 1;
#else
#if FF_NEVER_INTERACTIVE
	b->ff_is_interactive = 0;
#else
	b->ff_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
#endif
#endif
	}


#ifdef FF_USE_PROTOS
void ff_flush_buffer( FF_BUFFER_STATE b )
#else
void ff_flush_buffer( b )
FF_BUFFER_STATE b;
#endif

	{
	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();
	}


#ifndef FF_NO_SCAN_BUFFER
#ifdef FF_USE_PROTOS
FF_BUFFER_STATE ff_scan_buffer( char *base, ff_size_t size )
#else
FF_BUFFER_STATE ff_scan_buffer( base, size )
char *base;
ff_size_t size;
#endif
	{
	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) ff_flex_alloc( 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;
	}
#endif


#ifndef FF_NO_SCAN_STRING
#ifdef FF_USE_PROTOS
FF_BUFFER_STATE ff_scan_string( ffconst char *ff_str )
#else
FF_BUFFER_STATE ff_scan_string( ff_str )
ffconst char *ff_str;
#endif
	{
	int len;
	for ( len = 0; ff_str[len]; ++len )
		;

	return ff_scan_bytes( ff_str, len );
	}
#endif


#ifndef FF_NO_SCAN_BYTES
#ifdef FF_USE_PROTOS
FF_BUFFER_STATE ff_scan_bytes( ffconst char *bytes, int len )
#else
FF_BUFFER_STATE ff_scan_bytes( bytes, len )
ffconst char *bytes;
int len;
#endif
	{
	FF_BUFFER_STATE b;
	char *buf;
	ff_size_t n;
	int i;

	/* Get memory for full buffer, including space for trailing EOB's. */
	n = len + 2;
	buf = (char *) ff_flex_alloc( n );
	if ( ! buf )
		FF_FATAL_ERROR( "out of dynamic memory in ff_scan_bytes()" );

	for ( i = 0; i < len; ++i )
		buf[i] = bytes[i];

	buf[len] = buf[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;
	}
#endif


#ifndef FF_NO_PUSH_STATE
#ifdef FF_USE_PROTOS
static void ff_push_state( int new_state )
#else
static void ff_push_state( new_state )
int new_state;
#endif
	{
	if ( ff_start_stack_ptr >= ff_start_stack_depth )
		{
		ff_size_t new_size;

		ff_start_stack_depth += FF_START_STACK_INCR;
		new_size = ff_start_stack_depth * sizeof( int );

		if ( ! ff_start_stack )
			ff_start_stack = (int *) ff_flex_alloc( new_size );

		else
			ff_start_stack = (int *) ff_flex_realloc(
					(void *) ff_start_stack, new_size );

		if ( ! ff_start_stack )
			FF_FATAL_ERROR(
			"out of memory expanding start-condition stack" );
		}

	ff_start_stack[ff_start_stack_ptr++] = FF_START;

	BEGIN(new_state);
	}
#endif


#ifndef FF_NO_POP_STATE
static void ff_pop_state()
	{
	if ( --ff_start_stack_ptr < 0 )
		FF_FATAL_ERROR( "start-condition stack underflow" );

	BEGIN(ff_start_stack[ff_start_stack_ptr]);
	}
#endif


#ifndef FF_NO_TOP_STATE
static int ff_top_state()
	{
	return ff_start_stack[ff_start_stack_ptr - 1];
	}
#endif

#ifndef FF_EXIT_FAILURE
#define FF_EXIT_FAILURE 2
#endif

#ifdef FF_USE_PROTOS
static void ff_fatal_error( ffconst char msg[] )
#else
static void ff_fatal_error( msg )
char msg[];
#endif
	{
	(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. */ \
		fftext[ffleng] = ff_hold_char; \
		ff_c_buf_p = fftext + n; \
		ff_hold_char = *ff_c_buf_p; \
		*ff_c_buf_p = '\0'; \
		ffleng = n; \
		} \
	while ( 0 )


/* Internal utility routines. */

#ifndef fftext_ptr
#ifdef FF_USE_PROTOS
static void ff_flex_strncpy( char *s1, ffconst char *s2, int n )
#else
static void ff_flex_strncpy( s1, s2, n )
char *s1;
ffconst char *s2;
int n;
#endif
	{
	register int i;
	for ( i = 0; i < n; ++i )
		s1[i] = s2[i];
	}
#endif

#ifdef FF_NEED_STRLEN
#ifdef FF_USE_PROTOS
static int ff_flex_strlen( ffconst char *s )
#else
static int ff_flex_strlen( s )
ffconst char *s;
#endif
	{
	register int n;
	for ( n = 0; s[n]; ++n )
		;

	return n;
	}
#endif


#ifdef FF_USE_PROTOS
static void *ff_flex_alloc( ff_size_t size )
#else
static void *ff_flex_alloc( size )
ff_size_t size;
#endif
	{
	return (void *) malloc( size );
	}

#ifdef FF_USE_PROTOS
static void *ff_flex_realloc( void *ptr, ff_size_t size )
#else
static void *ff_flex_realloc( ptr, size )
void *ptr;
ff_size_t size;
#endif
	{
	/* 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 );
	}

#ifdef FF_USE_PROTOS
static void ff_flex_free( void *ptr )
#else
static void ff_flex_free( ptr )
void *ptr;
#endif
	{
	free( ptr );
	}

#if FF_MAIN
int main()
	{
	fflex();
	return 0;
	}
#endif
#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 c2) return(1);
      if (c1 == 0) return(0);
      s1++;
      s2++;
   }
}

int 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);
}

#endif
healpy-1.8.1/cfitsio/putcols.c0000654000175000017530000002523112272000775016715 0ustar  zoncaplanck00000000000000/*  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)
    {
        sprintf(message, "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 */
      {
         sprintf(message,
          "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 */
      {
         sprintf(message,
          "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);
}
healpy-1.8.1/cfitsio/iter_c.fit0000654000175000017530000026400012272000775017030 0ustar  zoncaplanck00000000000000SIMPLE  =                    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àhealpy-1.8.1/cfitsio/testprog.tpt0000654000175000017530000000061412272000775017456 0ustar  zoncaplanck00000000000000tmpcard1  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
healpy-1.8.1/cfitsio/cfortran.h0000654000175000017530000040757212272000775017063 0ustar  zoncaplanck00000000000000/* 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;
#else                   /* newer versions do support 'long long' */
    typedef long long LONGLONG; 
#endif

#elif defined( __BORLANDC__)  /* (WDP) for the free Borland compiler, in particular */
    typedef __int64 LONGLONG;
#else
    typedef long long LONGLONG; 
#endif

#define LONGLONG_TYPE
#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 */
healpy-1.8.1/cfitsio/getcolk.c0000654000175000017530000021616312272000775016662 0ustar  zoncaplanck00000000000000/*  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)
    {
        sprintf(msg, "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
        {
          sprintf(msg, "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)
    {
        sprintf(msg, "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])
      {
        sprintf(msg, "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[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);

    /* 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 */
                sprintf(message, 
                   "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)
            sprintf(message,
            "Error reading elements %.0f thru %.0f from column %d (ffgclk).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            sprintf(message,
            "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;

    if (nullcheck == 0)     /* no null checking required */
    {
        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 == 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[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);
          sprintf(message, "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);
}
healpy-1.8.1/cfitsio/imcopy.c0000654000175000017530000002223012272000775016520 0ustar  zoncaplanck00000000000000#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);
}
healpy-1.8.1/cfitsio/getcoluk.c0000654000175000017530000021750412272000775017047 0ustar  zoncaplanck00000000000000/*  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)
    {
        sprintf(msg, "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])
      {
        sprintf(msg, "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)
    {
        sprintf(msg, "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])
      {
        sprintf(msg, "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[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);

    /* 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 */
                sprintf(message, 
                   "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)
            sprintf(message,
            "Error reading elements %.0f thru %.0f from column %d (ffgcluk).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            sprintf(message,
            "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;

    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] > 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 == 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[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);
          sprintf(message, "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);
}
healpy-1.8.1/cfitsio/grparser.h0000654000175000017530000001326512272000775017062 0ustar  zoncaplanck00000000000000/*		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_strcasecmp(char *p1, char *p2);
int	ngp_strcasencmp(char *p1, char *p2, int n);
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
healpy-1.8.1/cfitsio/drvrsmem.c0000654000175000017530000011306612272000775017067 0ustar  zoncaplanck00000000000000/*              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
23-Mar-98 : shmem://0, shmem://1, etc changed to shmem://h0, etc due to bug
            in url parser.
10-Apr-98 : code cleanup
13-May-99 : delayed initialization added, global table deleted on exit when
            no shmem segments remain, and last process terminates
*/

#ifdef HAVE_SHMEM_SERVICES
#include "fitsio2.h"                         /* drvrsmem.h is included by it */

#include 
#include 
#include 
#include 
#include 
#include 
#include 

#if defined(unix) || defined(__unix__)  || defined(__unix)
#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=");
       sprintf(buf, "%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
healpy-1.8.1/cfitsio/scalnull.c0000654000175000017530000002141512272000775017041 0ustar  zoncaplanck00000000000000/*  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);
}
healpy-1.8.1/cfitsio/putcolsb.c0000654000175000017530000010404112272000775017054 0ustar  zoncaplanck00000000000000/*  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  */
                sprintf(message, 
                       "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 */
        {
          sprintf(message,
          "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 == 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);
}
healpy-1.8.1/cfitsio/putcoll.c0000654000175000017530000003264512272000775016715 0ustar  zoncaplanck00000000000000/*  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 */
      {
        sprintf(message,
           "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};
    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).        */

        if (tcode == -TBIT)
            ffpdes(fptr, colnum, frow, (long) repeat, offset, 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;
    }
}

healpy-1.8.1/cfitsio/configure0000755000175000017530000060057712272000775017002 0ustar  zoncaplanck00000000000000#! /bin/sh
# Guess values for system-dependent variables and create Makefiles.
# Generated by GNU Autoconf 2.68.
#
#
# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
# 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 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

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"
  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 :
  # 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
	export CONFIG_SHELL
	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+"$@"}
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_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; }

  # 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 -p'.
    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
      as_ln_s='cp -p'
  elif ln conf$$.file conf$$ 2>/dev/null; then
    as_ln_s=ln
  else
    as_ln_s='cp -p'
  fi
else
  as_ln_s='cp -p'
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

if test -x / >/dev/null 2>&1; then
  as_test_x='test -x'
else
  if ls -dL / >/dev/null 2>&1; then
    as_ls_L_option=L
  else
    as_ls_L_option=
  fi
  as_test_x='
    eval sh -c '\''
      if test -d "$1"; then
	test -d "$1/.";
      else
	case $1 in #(
	-*)set "./$1";;
	esac;
	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #((
	???[sx]*):;;*)false;;esac;fi
    '\'' sh
  '
fi
as_executable_p=$as_test_x

# 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"
ac_default_prefix=`pwd`
# 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_subst_vars='LTLIBOBJS
LIBOBJS
my_shmem
F77_WRAPPERS
CFITSIO_SHLIB_SONAME
CFITSIO_SHLIB
SHLIB_SUFFIX
SHLIB_LD
LIBPRE
ARCH
GCCVERSION
SSE_FLAGS
EGREP
GREP
CPP
RANLIB
ARCHIVE
AR
FC
OBJEXT
EXEEXT
ac_ct_CC
CPPFLAGS
LDFLAGS
CFLAGS
CC
INSTALL_ROOT
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_reentrant
enable_sse2
enable_ssse3
enable_hera
with_gsiftp_flavour
with_gsiftp
'
      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
    $as_echo "$as_me: WARNING: if you wanted to set the --build type, don't use --host.
    If a cross compiler is detected then cross compile mode will be used" >&2
  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]
  --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-gsiftp-flavour[=PATH]
                          Enable Globus Toolkit gsiftp protocol support
  --with-gsiftp[=PATH]    Enable Globus Toolkit gsiftp protocol support

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.68

Copyright (C) 2010 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_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_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 ||
	 $as_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
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.68.  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=36

# Increment soname each time the interface changes:
CFITSIO_SONAME=2


#--------------------------------------------------------------------
# Command options
#--------------------------------------------------------------------

# 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


# 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 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
            CFLAGS="$CFLAGS -I${withval}/include/${GSIFTP_FLAVOUR}"
            LDFLAGS="$LDFLAGS -L${withval}/lib -lglobus_ftp_client_${GSIFTP_FLAVOUR}"
            HAVE_GSIFTP=yes
        fi

$as_echo "#define HAVE_GSIFTP 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
    *pc-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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 
#include 
#include 
/* 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


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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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 { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$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



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"
      { test -f "$ac_path_GREP" && $as_test_x "$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"
      { test -f "$ac_path_EGREP" && $as_test_x "$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


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
    *pc-cygwin*)
	CFLAGS="$CFLAGS -DHAVE_POSIX_SIGNALS"
	;;
    *apple-darwin*)
        # Build for i386 & x86_64 architectures on Darwin 10.x or newer:

        case $host in
            *darwin[56789]*)
                ;;
            *)

                # Test to see whether the C compiler accepts the "-arch"
                # flags for building "universal" binaries (Apple XCode only):
                SAVE_CFLAGS="$CFLAGS"
                C_UNIV_SWITCH="-arch i386 -arch x86_64"
                CFLAGS="$CFLAGS $C_UNIV_SWITCH"
                { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts $C_UNIV_SWITCH" >&5
$as_echo_n "checking whether $CC accepts $C_UNIV_SWITCH... " >&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

                # Value of C_UNIV_SWITCH will be needed later for SHLIB_LD:
                if test "$c_has_option" = no; then C_UNIV_SWITCH=""; fi
                CFLAGS="$SAVE_CFLAGS $C_UNIV_SWITCH"
                ;;
        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)
    SHLIB_LD="$CC -shared"
    SHLIB_SUFFIX=".dll"
    ;;
  darwin)

    SHLIB_SUFFIX=".dylib"
    CFITSIO_SHLIB="libcfitsio.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}\${SHLIB_SUFFIX}"
    CFITSIO_SHLIB_SONAME="libcfitsio.\${CFITSIO_SONAME}\${SHLIB_SUFFIX}"
    case $host in
        *darwin[56789]*)
            SHLIB_LD="$CC -dynamiclib -install_name libcfitsio.\${CFITSIO_SONAME}\${SHLIB_SUFFIX} -compatibility_version \${CFITSIO_SONAME} -current_version \${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}"
            ;;
        *)
            # Build for i386 & x86_64 architectures on Darwin 10.x or newer:
            SHLIB_LD="$CC -dynamiclib $C_UNIV_SWITCH -install_name libcfitsio.\${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="libcfitsio\${SHLIB_SUFFIX}.\${CFITSIO_SONAME}.\${CFITSIO_MAJOR}.\${CFITSIO_MINOR}"
    CFITSIO_SHLIB_SONAME="libcfitsio\${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,libcfitsio\${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="libcfitsio\${SHLIB_SUFFIX}"; 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 \"do we have flock_t defined in sys/fcntl.h\"" >&5
$as_echo_n "checking \"do we have flock_t 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 \"do we have flock_t defined in sys/flock.h\"" >&5
$as_echo_n "checking \"do we have flock_t 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

# -------------------------------------------------------------------------
# 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 \"do we have union semun defined\"" >&5
$as_echo_n "checking \"do we have union semun 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

# ==================== 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 ================

# ------------------------------------------------------------------------------
# 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 "$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
# ------------------------------------------------------------------------------

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 -p'.
    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
      as_ln_s='cp -p'
  elif ln conf$$.file conf$$ 2>/dev/null; then
    as_ln_s=ln
  else
    as_ln_s='cp -p'
  fi
else
  as_ln_s='cp -p'
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

if test -x / >/dev/null 2>&1; then
  as_test_x='test -x'
else
  if ls -dL / >/dev/null 2>&1; then
    as_ls_L_option=L
  else
    as_ls_L_option=
  fi
  as_test_x='
    eval sh -c '\''
      if test -d "$1"; then
	test -d "$1/.";
      else
	case $1 in #(
	-*)set "./$1";;
	esac;
	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #((
	???[sx]*):;;*)false;;esac;fi
    '\'' sh
  '
fi
as_executable_p=$as_test_x

# 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.68.  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.68,
  with options \\"\$ac_cs_config\\"

Copyright (C) 2010 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 -p'.
    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
      as_ln_s='cp -p'
  elif ln conf$$.file conf$$ 2>/dev/null; then
    as_ln_s=ln
  else
    as_ln_s='cp -p'
  fi
else
  as_ln_s='cp -p'
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

if test -x / >/dev/null 2>&1; then
  as_test_x='test -x'
else
  if ls -dL / >/dev/null 2>&1; then
    as_ls_L_option=L
  else
    as_ls_L_option=
  fi
  as_test_x='
    eval sh -c '\''
      if test -d "$1"; then
	test -d "$1/.";
      else
	case $1 in #(
	-*)set "./$1";;
	esac;
	case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in #((
	???[sx]*):;;*)false;;esac;fi
    '\'' sh
  '
fi
as_executable_p=$as_test_x

# 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.68.  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.68,
  with options \\"\$ac_cs_config\\"

Copyright (C) 2010 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; }

healpy-1.8.1/cfitsio/zlib/0000755000175000017500000000000012351601662015653 5ustar  zoncazonca00000000000000healpy-1.8.1/cfitsio/zlib/zconf.h0000654000175000017530000003205112272000775017306 0ustar  zoncaplanck00000000000000/* 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 */
healpy-1.8.1/cfitsio/zlib/inflate.c0000654000175000017530000014661712272000775017622 0ustar  zoncaplanck00000000000000/* 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));
}
healpy-1.8.1/cfitsio/zlib/deflate.h0000654000175000017530000003055712272000775017604 0ustar  zoncaplanck00000000000000/* 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 */
healpy-1.8.1/cfitsio/zlib/trees.c0000654000175000017530000013025112272000775017305 0ustar  zoncaplanck00000000000000/* 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++);
    }
}
healpy-1.8.1/cfitsio/zlib/zcompress.c0000654000175000017530000004230312272000775020210 0ustar  zoncaplanck00000000000000#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 */

    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 = *buffsize;

    /* 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 */
                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;

        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);
}
healpy-1.8.1/cfitsio/zlib/adler32.c0000654000175000017530000001164712272000775017426 0ustar  zoncaplanck00000000000000/* 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);
}
healpy-1.8.1/cfitsio/zlib/infback.c0000654000175000017530000005413612272000775017567 0ustar  zoncaplanck00000000000000/* 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;
}
healpy-1.8.1/cfitsio/zlib/deflate.c0000654000175000017530000020460712272000775017576 0ustar  zoncaplanck00000000000000/* 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;
}
healpy-1.8.1/cfitsio/zlib/inffast.h0000654000175000017530000000065312272000775017624 0ustar  zoncaplanck00000000000000/* 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));
healpy-1.8.1/cfitsio/zlib/crc32.c0000654000175000017530000003254012272000775017101 0ustar  zoncaplanck00000000000000/* 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);
}
healpy-1.8.1/cfitsio/zlib/inftrees.c0000654000175000017530000003271112272000775020004 0ustar  zoncaplanck00000000000000/* 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;
}
healpy-1.8.1/cfitsio/zlib/inflate.h0000654000175000017530000001437712272000775017624 0ustar  zoncaplanck00000000000000/* 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 */
};
healpy-1.8.1/cfitsio/zlib/inffixed.h0000654000175000017530000001430712272000775017767 0ustar  zoncaplanck00000000000000    /* 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}
    };
healpy-1.8.1/cfitsio/zlib/crc32.h0000654000175000017530000007355012272000775017114 0ustar  zoncaplanck00000000000000/* 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
  }
};
healpy-1.8.1/cfitsio/zlib/zutil.h0000654000175000017530000001574012272000775017344 0ustar  zoncaplanck00000000000000/* 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 */
healpy-1.8.1/cfitsio/zlib/inffast.c0000654000175000017530000003217712272000775017625 0ustar  zoncaplanck00000000000000/* 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 */
healpy-1.8.1/cfitsio/zlib/zutil.c0000654000175000017530000001620012272000775017327 0ustar  zoncaplanck00000000000000/* 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 */
healpy-1.8.1/cfitsio/zlib/zlib.h0000654000175000017530000023331412272000775017134 0ustar  zoncaplanck00000000000000/* 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 */
healpy-1.8.1/cfitsio/zlib/inftrees.h0000654000175000017530000000556012272000775020013 0ustar  zoncaplanck00000000000000/* 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));
healpy-1.8.1/cfitsio/zlib/zuncompress.c0000654000175000017530000004005112272000775020551 0ustar  zoncaplanck00000000000000/* 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);
}
healpy-1.8.1/cfitsio/zlib/uncompr.c0000654000175000017530000000367112272000775017653 0ustar  zoncaplanck00000000000000/* 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;
}
healpy-1.8.1/cfitsio/zlib/trees.h0000654000175000017530000002043012272000775017307 0ustar  zoncaplanck00000000000000/* 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
};

healpy-1.8.1/cfitsio/sample.tpl0000654000175000017530000000677512272000775017076 0ustar  zoncaplanck00000000000000# 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#   0healpy-1.8.1/cfitsio/iter_b.c0000654000175000017530000000716612272000775016477 0ustar  zoncaplanck00000000000000#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);
}
healpy-1.8.1/cfitsio/histo.c0000654000175000017530000022162312272000775016355 0ustar  zoncaplanck00000000000000/*   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;
   float amin1, amin2, amin3, amin4;
   float maxbin1, maxbin2, maxbin3, maxbin4;
   float binsize1, binsize2, binsize3, binsize4;
   int   wtrecip, wtcolnum;
   float 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[30], *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;
    char token[FLEN_VALUE];

    if (*status > 0)
        return(*status);

    slen = fits_get_token(ptr, " ,=:;", token, &isanumber); /* get 1st token */

    if (slen == 0 && (**ptr == '\0' || **ptr == ',' || **ptr == ';') )
        return(*status);   /* a null range string */

    if (!isanumber && **ptr != ':')
    {
        /* this looks like the column name */

        if (token[0] == '#' && isdigit((int) token[1]) )
        {
            /* omit the leading '#' in the column number */
            strcpy(colname, token+1);
        }
        else
            strcpy(colname, token);

        while (**ptr == ' ')  /* skip over blanks */
             (*ptr)++;

        if (**ptr != '=')
            return(*status);  /* reached the end */

        (*ptr)++;   /* skip over the = sign */

        while (**ptr == ' ')  /* skip over blanks */
             (*ptr)++;

        slen = fits_get_token(ptr, " ,:;", token, &isanumber); /* get token */
    }

    if (**ptr != ':')
    {
        /* this is the first token, and since it is not followed by */
        /* a ':' this must be the binsize token */
        if (!isanumber)
            strcpy(binname, token);
        else
            *binsizein =  strtod(token, NULL);

        return(*status);  /* reached the end */
    }
    else
    {
        /* the token contains the min value */
        if (slen)
        {
            if (!isanumber)
                strcpy(minname, token);
            else
                *minin = strtod(token, NULL);
        }
    }

    (*ptr)++;  /* skip the colon between the min and max values */
    slen = fits_get_token(ptr, " ,:;", token, &isanumber); /* get token */

    /* the token contains the max value */
    if (slen)
    {
        if (!isanumber)
            strcpy(maxname, token);
        else
            *maxin = strtod(token, NULL);
    }

    if (**ptr != ':')
        return(*status);  /* reached the end; no binsize token */

    (*ptr)++;  /* skip the colon between the max and binsize values */
    slen = fits_get_token(ptr, " ,:;", token, &isanumber); /* get token */

    /* the token contains the binsize value */
    if (slen)
    {
        if (!isanumber)
            strcpy(binname, token);
        else
            *binsizein = strtod(token, NULL);
    }

    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];
    float 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_binning(
      *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, TFLOAT, 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 = FLOATNULLVALUE;
        }
    }
    else
        weight = (float) weightin;

    if (weight <= 0. && weight != FLOATNULLVALUE)
    {
        ffpmsg("Illegal histogramming weighting factor <= 0.");
        return(*status = URL_PARSE_ERROR);
    }

    if (recip && weight != FLOATNULLVALUE)
       /* take reciprocal of weight */
       weight = (float) (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_wcs(histptr, naxis, amin, binsize,  status);      
    
    /* now compute the output image by binning the column values */
    if (fits_make_hist(*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);
}
/*--------------------------------------------------------------------------*/
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 */
    
    float amin[4], amax[4], binsize[4], maxbin[4];
    float datamin = FLOATNULLVALUE, datamax = FLOATNULLVALUE;
    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: ");
        strcat(errmsg, colname[ii]);
        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: ");
        strcat(errmsg, colname[ii]);
        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: ");
        strcat(errmsg, colname[ii]);
        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, TFLOAT, 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: ");
                strcat(errmsg, colname[ii]);
                ffpmsg(errmsg);
                return(*status);
            }
         }
      }
      else
      {
        amin[ii] = (float) minin[ii];
      }

      if (maxin[ii] == DOUBLENULLVALUE)
      {
        ffkeyn("TLMAX", histData.hcolnum[ii], keyname, status);
        if (ffgky(*fptr, TFLOAT, keyname, &amax[ii], NULL, status) > 0)
        {
          *status = 0;
          if(datamax != FLOATNULLVALUE)  /* 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: ");
                 strcat(errmsg, colname[ii]);
                 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] = (float) 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] = (float) -binsizein[ii];  /* reverse the sign of binsize */
      else
          binsize[ii] =  (float) 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 && (float) imin == amin[ii] &&
                               (float) imax == amax[ii] &&
                               (float) 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] = (float) (haxes[ii] + 1.);  /* add 1. instead of .5 to avoid roundoff */

        if (amin[ii] < amax[ii])
        {
          amin[ii] = (float) (amin[ii] - 0.5);
          amax[ii] = (float) (amax[ii] + 0.5);
        }
        else
        {
          amin[ii] = (float) (amin[ii] + 0.5);
          amax[ii] = (float) (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, TFLOAT, 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 = FLOATNULLVALUE;
        }
    }
    else
        histData.weight = (float) weightin;

    if (histData.weight <= 0. && histData.weight != FLOATNULLVALUE)
    {
        ffpmsg("Illegal histogramming weighting factor <= 0.");
        return(*status = URL_PARSE_ERROR);
    }

    if (recip && histData.weight != FLOATNULLVALUE)
       /* take reciprocal of weight */
       histData.weight = (float) (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);
}
/*--------------------------------------------------------------------------*/
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)
/*_
    Calculate the actual binning parameters, based on various user input
    options.
*/
{
    tcolumn *colptr;
    char *cptr, cpref[4][FLEN_VALUE];
    char errmsg[FLEN_ERRMSG], keyname[FLEN_KEYWORD];
    int tstatus, ii;
    int datatype, repeat, imin, imax, ibin,  use_datamax = 0;
    float datamin, datamax;

    /* check inputs */
    
    if (*status > 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: ");
          strcat(errmsg, colname[ii]);
          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: ");
        strcat(errmsg, colname[ii]);
        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: ");
        strcat(errmsg, colname[ii]);
        ffpmsg(errmsg);
        return(*status = BAD_DATATYPE);
      }

      /* ================================================================ */
      /* get the minimum value */

      datamin = FLOATNULLVALUE;
      datamax = FLOATNULLVALUE;
      
      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] = (float) minin[ii];
      }
      else
      {
        ffkeyn("TLMIN", colnum[ii], keyname, status);
        if (ffgky(fptr, TFLOAT, 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: ");
                strcat(errmsg, colname[ii]);
                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] = (float) maxin[ii];
      }
      else
      {
        ffkeyn("TLMAX", colnum[ii], keyname, status);
        if (ffgky(fptr, TFLOAT, keyname, &amax[ii], NULL, status) > 0)
        {
          *status = 0;
          if(datamax != FLOATNULLVALUE)  /* 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: ");
                 strcat(errmsg, colname[ii]);
                 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] = (float) 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 && (float) imin == amin[ii] &&
                               (float) imax == amax[ii] &&
                               (float) 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] = (float) (amin[ii] - 0.5);
          amax[ii] = (float) (amax[ii] + 0.5);
        }
        else
        {
          amin[ii] = (float) (amin[ii] + 0.5);
          amax[ii] = (float) (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)      
{      
   /*  Update the  WCS keywords that define the location of the reference */
   /*  pixel, and the pixel size, along each axis.   */

    int ii, jj, tstatus, reset ;
    char keyname[FLEN_KEYWORD], svalue[FLEN_VALUE];
    double dvalue;
    
    if (*status > 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);
}
/*--------------------------------------------------------------------------*/

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)
{		  
    int ii, imagetype, datatype;
    int n_cols = 1;
    long imin, imax, ibin;
    long  offset = 0;
    long n_per_loop = -1;  /* force whole array to be passed at one time */
    float taxes[4], tmin[4], tmax[4], tbin[4], maxbin[4];
    histType histData;    /* Structure holding histogram info for iterator */
    iteratorCol imagepars[1];

    /* check inputs */
    
    if (*status > 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] = (float) 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 && (float) imin == tmin[ii] &&
                               (float) imax == tmax[ii] &&
                               (float) 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, float *datamin, 
                     float *datamax, int *status)
/* 
   Simple utility routine to compute the min and max value in a column
*/
{
    int anynul;
    long nrows, ntodo, firstrow, ii;
    float array[1000], nulval;

    ffgky(fptr, TLONG, "NAXIS2", &nrows, NULL, status); /* no. of rows */

    firstrow = 1;
    nulval = FLOATNULLVALUE;
    *datamin =  9.0E36F;
    *datamax = -9.0E36F;

    while(nrows)
    {
        ntodo = minvalue(nrows, 100);
        ffgcv(fptr, TFLOAT, 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], TFLOAT, InputCol);
    }
    ncols = histData->haxis;

    if (histData->weight == FLOATNULLVALUE)
    {
      fits_iter_set_by_num(&colpars[histData->haxis], histData->tblptr,
			   histData->wtcolnum, TFLOAT, 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;
    float pix, axisbin;
    static float *col1, *col2, *col3, *col4; /* static to preserve values */
    static float *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 = (float *) fits_iter_get_array(&colpars[0]);
      if (histData.haxis > 1)
      {
        col2 = (float *) fits_iter_get_array(&colpars[1]);
        incr2 = histData.haxis1;

        if (histData.haxis > 2)
        {
          col3 = (float *) fits_iter_get_array(&colpars[2]);
          incr3 = incr2 * histData.haxis2;

          if (histData.haxis > 3)
          {
            col4 = (float *) fits_iter_get_array(&colpars[3]);
            incr4 = incr3 * histData.haxis3;
          }
        }
      }

      if (ncols > histData.haxis)  /* then weights are give in a column */
      {
        wtcol = (float *) 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] == FLOATNULLVALUE)  /* 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] == FLOATNULLVALUE)
              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] == FLOATNULLVALUE)
                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] == FLOATNULLVALUE)
                  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 != FLOATNULLVALUE) /* 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);
}

healpy-1.8.1/cfitsio/pliocomp.c0000654000175000017530000001563312272000775017053 0ustar  zoncaplanck00000000000000/* 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_ */

healpy-1.8.1/cfitsio/iter_a.c0000654000175000017530000001220512272000775016464 0ustar  zoncaplanck00000000000000#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 */
}
healpy-1.8.1/cfitsio/putcoluj.c0000654000175000017530000010316512272000775017074 0ustar  zoncaplanck00000000000000/*  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  */
                sprintf(message, 
                     "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 */
        {
          sprintf(message,
          "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 == 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);
}
healpy-1.8.1/cfitsio/putcolb.c0000654000175000017530000010745012272000775016700 0ustar  zoncaplanck00000000000000/*  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  */
                sprintf(message, 
                       "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 */
        {
          sprintf(message,
          "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 == 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);
}
healpy-1.8.1/cfitsio/region.c0000654000175000017530000015446512272000775016523 0ustar  zoncaplanck00000000000000#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 ) {
      sprintf(currLine,"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( !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( !strncasecmp( currLoc, "pixel", 5 ) ) {
               cFmt = pixel_fmt;
            } else if( !strncasecmp( currLoc, "degree", 6 ) ) {
               cFmt = degree_fmt;
            } else if( !strncasecmp( currLoc, "hhmmss", 6 ) ) {
               cFmt = hhmmss_fmt;
            } else if( !strncasecmp( currLoc, "hms", 3 ) ) {
               cFmt = hhmmss_fmt;
            } else {
               ffpmsg("Unknown format code encountered in region file.");
               *status = PARSE_SYNTAX_ERR;
               goto error;
            }
         }

      } else if( !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( !strncasecmp( namePtr, "image;", 6 ) ) {
				namePtr += 6;
				cFmt = pixel_fmt;
            } else if( !strncasecmp( namePtr, "physical;", 9 ) ) {
                                namePtr += 9;
                                cFmt = pixel_fmt;
            } else if( !strncasecmp( namePtr, "linear;", 7 ) ) {
                                namePtr += 7;
                                cFmt = pixel_fmt;
            } else if( !strncasecmp( namePtr, "fk4;", 4 ) ) {
				namePtr += 4;
				cFmt = degree_fmt;
            } else if( !strncasecmp( namePtr, "fk5;", 4 ) ) {
				namePtr += 4;
				cFmt = degree_fmt;
            } else if( !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( !strncasecmp( namePtr, "fk5", 3 ) ) {
				cFmt = degree_fmt;
                                continue;  /* supports POW region file format */
            } else if( !strncasecmp( namePtr, "fk4", 3 ) ) {
				cFmt = degree_fmt;
                                continue;  /* supports POW region file format */
            } else if( !strncasecmp( namePtr, "icrs", 4 ) ) {
				cFmt = degree_fmt;
                                continue;  /* supports POW region file format */
            } else if( !strncasecmp( namePtr, "image", 5 ) ) {
				cFmt = pixel_fmt;
                                continue;  /* supports POW region file format */
            } else if( !strncasecmp( namePtr, "physical", 8 ) ) {
				cFmt = pixel_fmt;
                                continue;  /* supports POW region file format */


            } else if( !strncasecmp( namePtr, "galactic;", 9 ) ) {
               ffpmsg( "Galactic region coordinates not supported" );
               ffpmsg( namePtr );
               *status = PARSE_SYNTAX_ERR;
               goto error;
            } else if( !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(        !strcasecmp( namePtr, "circle"  ) ) {
               newShape->shape = circle_rgn;
               if( nParams != 3 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !strcasecmp( namePtr, "annulus" ) ) {
               newShape->shape = annulus_rgn;
               if( nParams != 4 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !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( !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( !strcasecmp( namePtr, "box"    ) 
                    || !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( !strcasecmp( namePtr, "rectangle"    )
                    || !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( !strcasecmp( namePtr, "diamond"    )
                    || !strcasecmp( namePtr, "rotdiamond" )
                    || !strcasecmp( namePtr, "rhombus"    )
                    || !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( !strcasecmp( namePtr, "sector"  )
                    || !strcasecmp( namePtr, "pie"     ) ) {
               newShape->shape = sector_rgn;
               if( nParams != 4 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !strcasecmp( namePtr, "point"   ) ) {
               newShape->shape = point_rgn;
               if( nParams != 2 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !strcasecmp( namePtr, "line"    ) ) {
               newShape->shape = line_rgn;
               if( nParams != 4 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 4;
            } else if( !strcasecmp( namePtr, "polygon" ) ) {
               newShape->shape = poly_rgn;
               if( nParams < 6 || (nParams&1) )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = nParams;
            } else if( !strcasecmp( namePtr, "panda" ) ) {
               newShape->shape = panda_rgn;
               if( nParams != 8 )
                  *status = PARSE_SYNTAX_ERR;
               nCoords = 2;
            } else if( !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( !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<9; 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 );
}

healpy-1.8.1/cfitsio/iter_var.c0000654000175000017530000000636712272000775017050 0ustar  zoncaplanck00000000000000#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 */
}
healpy-1.8.1/cfitsio/f77_wrap1.c0000654000175000017530000003032112272000775016735 0ustar  zoncaplanck00000000000000/************************************************************************

     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)

healpy-1.8.1/cfitsio/drvrfile.c0000654000175000017530000006700012272000775017041 0ustar  zoncaplanck00000000000000/*  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)
#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 (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 */
	    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 - 1)
          return(0);

      strcpy(tmpfilename,filename);
      strcat(filename,".gz");
      if (file_openfile(filename, 0, &diskfile))
      {
        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 (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   */
         (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);
}




healpy-1.8.1/cfitsio/fits_hdecompress.c0000654000175000017530000017356612272000775020604 0ustar  zoncaplanck00000000000000/*  #########################################################################
These routines to apply the H-compress decompression 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 
  hinv.c 
  hsmooth.c 
  undigitize.c 
  decode.c 
  dodecode.c 
  qtree_decode.c 
  qread.c 
  bit_input.c


The following modifications have been made to the original code:

  - commented out redundant "include" statements
  - added the nextchar global variable 
  - changed all the 'extern' declarations to 'static', since all the routines are in
    the same source file
  - changed the first parameter in decode (and in lower level routines from a file stream
    to a char array
  - modified the myread routine, and lower level byte reading routines,  to copy 
    the input bytes to a char array, instead of reading them from a file stream
  - changed the function declarations to the more modern ANSI C style
  - changed calls to printf and perror to call the CFITSIO ffpmsg routine
  - replace "exit" statements with "return" statements

 ############################################################################  */
 
#include 
#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 nel, 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	*/
	
	nel = (*nx) * (*ny);

	/* 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 nel, 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	*/
	
	nel = (*nx) * (*ny);

	/* 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;
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] |= ((((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 ); 
}
healpy-1.8.1/cfitsio/getcolj.c0000654000175000017530000043137712272000775016667 0ustar  zoncaplanck00000000000000/*  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)
    {
        sprintf(msg, "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
        {
          sprintf(msg, "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)
    {
        sprintf(msg, "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])
      {
        sprintf(msg, "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[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;

    /*----------------------------------------------------------------------*/
    /*  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/8) {
            maxelem = nelem;
        } else {
        /* divide by 8 instead of 4 in case sizeof(long) = 8 */
            maxelem = INT32_MAX/8;   
        }

        if (nulcheck == 0 && scale == 1. && zero == 0. && LONGSIZE == 32)
            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)
                    fffi4i4((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);
                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 */
                sprintf(message, 
                   "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)
            sprintf(message,
            "Error reading elements %.0f thru %.0f from column %d (ffgclj).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            sprintf(message,
            "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;

  Process the array of data in reverse order, to handle the case where
  the input data is 4-bytes and the output is  8-bytes and the conversion
  is being done in place in the same array.
*/
{
    long ii;
    double dvalue;

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

    if (nullcheck == 0)     /* no null checking required */
    {
        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 == 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[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);
          sprintf(message, "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)
    {
        sprintf(msg, "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
        {
          sprintf(msg, "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)
    {
        sprintf(msg, "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])
      {
        sprintf(msg, "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[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;

    /*----------------------------------------------------------------------*/
    /*  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 */
                sprintf(message, 
                   "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)
            sprintf(message,
            "Error reading elements %.0f thru %.0f from column %d (ffgclj).",
              dtemp+1., dtemp+ntodo, colnum);
          else
            sprintf(message,
            "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;

    if (nullcheck == 0)     /* no null checking required */
    {
        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 == 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[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);
          sprintf(message, "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);
}
healpy-1.8.1/cfitsio/fitsio.h0000654000175000017530000033540112272000775016531 0ustar  zoncaplanck00000000000000/*  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.36
#define CFITSIO_MINOR 36
#define CFITSIO_MAJOR 3
#define CFITSIO_SONAME 2

/* 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(_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;
#else                   /* newer versions do support 'long long' */
    typedef long long LONGLONG; 
#endif

#elif defined( __BORLANDC__)  /* for the Borland 5.5 compiler, in particular */
    typedef __int64 LONGLONG;
#else
    typedef long long LONGLONG; 
#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   72  /* 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 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 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;

int CFITS_API fits_read_wcstab(fitsfile *fptr, int nwtb, wtbarr *wtb, int *status);

#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_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 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 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 ffgkls(fitsfile *fptr, const char *keyname, char **value, 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 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 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 zero, int *status);
int CFITS_API ffpnul(fitsfile *fptr, LONGLONG nulvalue, int *status);
int CFITS_API fftscl(fitsfile *fptr, int colnum, double scale, double zero, 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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);

/*--------------------- 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 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 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 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);

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_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_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);

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);

/*  The following exclusion if __CINT__ is defined is needed for ROOT */
#ifndef __CINT__
#ifdef __cplusplus
}
#endif
#endif

#endif

healpy-1.8.1/cfitsio/putcoluk.c0000654000175000017530000010442312272000775017073 0ustar  zoncaplanck00000000000000/*  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  */
                sprintf(message, 
                     "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 */
        {
          sprintf(message,
          "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 == 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);
}
healpy-1.8.1/cfitsio/checksum.c0000654000175000017530000004226412272000775017033 0ustar  zoncaplanck00000000000000/*  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 */ 
        sprintf(datasum, "%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);
}

healpy-1.8.1/cfitsio/cfileio.c0000654000175000017530000072305112272000775016643 0ustar  zoncaplanck00000000000000/*  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"

#define MAX_PREFIX_LEN 20  /* max length of file type prefix (e.g. 'http://') */
#define MAX_DRIVERS 24     /* 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)
{
  static int need_to_init = 1;
  int status = 0;
  
#ifdef _REENTRANT

  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 linux
    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_settu[e 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)
        {
          sprintf(errmsg,
          " extension number %d doesn't exist or couldn't be opened.",extnum);
          ffpmsg(errmsg);
        }
        else
        {
          sprintf(errmsg,
          " extension with EXTNAME = %s,", extname);
          ffpmsg(errmsg);

          if (extvers)
          {
             sprintf(errmsg,
             "           and with EXTVERS = %d,", extvers);
             ffpmsg(errmsg);
          }

          if (movetotype != ANY_HDU)
          {
             sprintf(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 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)
        {
          sprintf(errmsg,
          " extension number %d doesn't exist or couldn't be opened.",extnum);
          ffpmsg(errmsg);
        }
        else
        {
          sprintf(errmsg,
          " extension with EXTNAME = %s,", extname);
          ffpmsg(errmsg);

          if (extvers)
          {
             sprintf(errmsg,
             "           and with EXTVERS = %d,", extvers);
             ffpmsg(errmsg);
          }

          if (movetotype != ANY_HDU)
          {
             sprintf(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")) &&
                    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 */

       /* add some HISTORY; fits_copy_image_cell also wrote HISTORY keywords */
       
/*  disable this; leave it up to calling routine to write any HISTORY keywords
       if (*extname)
        sprintf(card,"HISTORY  in HDU '%.16s' of file '%.36s'",extname,infile);
       else
        sprintf(card,"HISTORY  in HDU %d of file '%.45s'", extnum, infile);

       ffprec(*fptr, card, status);
*/
    }

    /* --------------------------------------------------------------------- */
    /* 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(strcasecmp(urltype,"FILE://") == 0)
      {
        fits_path2url(infile,tmpinfile,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(strcasecmp(oldurltype,"FILE://") == 0)
            {
              fits_path2url(oldinfile,tmpStr,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 *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] == '-')
        {
            /* ===================================== */
            /* Case I. delete this column or keyword */
            /* ===================================== */

            if (ffgcno(*fptr, CASEINSEN, &clause[1], &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;
            }
            else
            {
	        ffcmsg();   /* clear previous error message from ffgcno */
                /* try deleting a keyword with this name */
                *status = 0;
                if (ffdkey(*fptr, &clause[1], status) > 0)
                {
                    ffpmsg("column or keyword to be deleted does not exist:");
                    ffpmsg(clause);
                    if( colindex ) free( colindex );
                    if( file_expr ) free( file_expr );
		    if( clause ) free(clause);
                    return(*status);
                }
            }
        }
        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_token(&cptr2, "( =", colname, NULL);

            if (slen == 0)
            {
                ffpmsg("error: column or keyword name is blank:");
                ffpmsg(clause);
                if( colindex ) free( colindex );
                if( file_expr ) free( file_expr );
		if (clause) free(clause);
                return(*status= URL_PARSE_ERROR);
            }

	    /* 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  == '(')
            {
                fits_get_token(&cptr2, ")", oldname, NULL);
                strcat(colname, oldname);
                strcat(colname, ")");
                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 */

                fits_get_token(&cptr2, " ", oldname, NULL);

                /* 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;

                fits_get_token(&cptr3, "(", oldname, NULL);

                if (cptr3[0] == '(' )
                {
                   cptr3++;  /* skip the '(' */
                   fits_get_token(&cptr3, ")", colformat, NULL);
                }

                /* 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  */
    sprintf(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;
      sprintf(tform, "%.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;

    sprintf(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);
    sprintf(filename+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];

    if (*status > 0)
        return(*status);

    slen = fits_get_token(ptr, " ,:", token, &isanumber); /* get 1st token */

    /* support [:2,:2] type syntax, where the leading * is implied */
    if (slen==0) strcpy(token,"*");

    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_token(ptr, " ,:", token, &isanumber); /* get token */

      if (slen == 0 || !isanumber)
        return(*status = URL_PARSE_ERROR);   

      /* the token contains the max value */
      *secmax = atol(token);
    }

    if (**ptr == ':')
    {
        (*ptr)++;  /* skip the colon between the max and incre values */
        slen = fits_get_token(ptr, " ,", token, &isanumber); /* get token */

        if (slen == 0 || !isanumber)
            return(*status = URL_PARSE_ERROR);   

        *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.
*/
{
    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;

    if (*status > 0)
        return(*status);

    if (*status == CREATE_DISK_FILE)
    {
       create_disk_file = 1;
       *status = 0;
    }

    *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 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);
    }

    /* 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 *size),
	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 (!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 (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 ( !strncasecmp(tmptr, "col ", 4) )
              colStart = 1;

           if ( !strncasecmp(tmptr, "bin", 3) )
              binStart = 1;

           if ( !strncasecmp(tmptr, "pix", 3) )
              pixStart = 1;

           if ( !strncasecmp(tmptr, "compress ", 9) ||
                !strncasecmp(tmptr, "compress]", 9) )
              compStart = 1;

           if ( !strncasecmp(tmptr, "gtifilter(", 10) ||
                !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 ) {
      sprintf(line,"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.
*/
{
    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);
}
healpy-1.8.1/cfitsio/fitscopy.c0000654000175000017530000000512212272000775017061 0ustar  zoncaplanck00000000000000#include 
#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);
}
healpy-1.8.1/cfitsio/windumpexts.c0000654000175000017530000003122612272000775017614 0ustar  zoncaplanck00000000000000/* 
 * winDumpExts.c --
 * Author:   Gordon Chaffee, Scott Stanton
 *
 * History:  The real functionality of this file was written by
 *           Matt Pietrek in 1993 in his pedump utility.  I've
 *           modified it to dump the externals in a bunch of object
 *           files to create a .def file.
 *
 * 10/12/95  Modified by Scott Stanton to support Relocatable Object Module
 *	     Format files for Borland C++ 4.5.
 *
 * Notes:    Visual C++ puts an underscore before each exported symbol.
 *           This file removes them.  I don't know if this is a problem
 *           this other compilers.  If _MSC_VER is defined,
 *           the underscore is removed.  If not, it isn't.  To get a
 *           full dump of an object file, use the -f option.  This can
 *           help determine the something that may be different with a
 *           compiler other than Visual C++.
 *----------------------------------------------------------------------
 *
 */

#include 
#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;
		    strcpy(symbol, s);
		}
		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++) {
		strcpy(&cmdline[pos], argv[i]);
		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);
}
healpy-1.8.1/cfitsio/iter_a.fit0000654000175000017530000037510012272000775017032 0ustar  zoncaplanck00000000000000SIMPLE  =                    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 @@°?€@ healpy-1.8.1/cfitsio/putkey.c0000654000175000017530000032176012272000775016553 0ustar  zoncaplanck00000000000000/*  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[81];

    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)
    {
        ffpkyg(fptr, keyname, (double) *(unsigned long *) value, 0,
               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
    {
        sprintf(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;

    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] = ' ';

    for (ii=0; ii < 8; 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;

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

    remain = maxvalue(strlen(value), 1); /* no. of chars to write (at least 1) */    
    /* 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
    {
        /* This a HIERARCH keyword */
        if (FSTRNCMP(cptr, "HIERARCH ", 9) && 
            FSTRNCMP(cptr, "hierarch ", 9))
            nchar = 66 - nquote - namelen;
        else
            nchar = 75 - nquote - namelen;  /* don't count 'HIERARCH' twice */

    }

    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);  /* 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 */
        }

        ffprec(fptr, card, status);  /* write the keyword */

        contin = 1;
        remain -= nchar;
        next  += nchar;

        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 */
        }
    }
    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 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 */
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2e(value[1], decim, tmpstring, status); /* convert to string */
    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 */
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2e(value[1], decim, tmpstring, status); /* convert to string */
    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 */
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffr2f(value[1], decim, tmpstring, status); /* convert to string */
    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 */
    strcat(valstring, tmpstring);
    strcat(valstring, ", ");
    ffd2f(value[1], decim, tmpstring, status); /* convert to string */
    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 */
    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[81];
    

    if (year < 0 || year > 9999)
    {
       sprintf(errmsg, 
       "input year value = %d is out of range 0 - 9999", year);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }
    else if (month < 1 || month > 12)
    {
       sprintf(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)
        {
           sprintf(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)
        {
           sprintf(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);
		   
 	        sprintf(errmsg, 
           "input day value = %d is out of range 1 - 28 for February %d (not leap year)", day, year);
                ffpmsg(errmsg);
	    } else {
                sprintf(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[81];

    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)
    {
       sprintf(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)
    {
       sprintf(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)
    {
       sprintf(errmsg, 
       "input second value is out of range 0 - 60.999: %f (fftm2s)", second);
       ffpmsg(errmsg);
       return(*status = BAD_DATE);
    }
    else if (decimals > 25)
    {
       sprintf(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[81];

    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)
       {
          sprintf(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)
       {
          sprintf(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.)
       {
          sprintf(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[81];
    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);
        }

        sprintf(value, "%ld", naxes[ii]);
        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)
      {
        sprintf(message,
        "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 )            */

        sprintf(value, "%.0f", (double) naxes[ii]);

        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)
      {
        sprintf(message,
        "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];

    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 == SBYTE_IMG)
        longbitpix = BYTE_IMG;

    if (longbitpix != BYTE_IMG && longbitpix != SHORT_IMG && 
        longbitpix != LONG_IMG && longbitpix != LONGLONG_IMG &&
        longbitpix != FLOAT_IMG && longbitpix != DOUBLE_IMG)
    {
        sprintf(message,
        "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)
    {
        sprintf(message,
        "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)
        {
            sprintf(message,
            "Illegal negative value for NAXIS%d keyword: %.0f", ii + 1, (double) (naxes[ii]));
            ffpmsg(message);
            return(*status = BAD_NAXES);
        }

        sprintf(&comm[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 == 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 */
        {
          sprintf(comm, "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;

        sprintf(comm, "beginning column of field %3d", ii + 1);
        ffkeyn("TBCOL", ii + 1, name, status);
        ffpkyj(fptr, name, tbcol[ii], comm, status);

        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;

    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')
           /* 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 */
        {
          sprintf(comm, "label for field %3d", ii + 1);
          ffkeyn("TTYPE", ii + 1, name, status);
          ffpkys(fptr, name, ttype[ii], comm, status);
        }

        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 == 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
        {
           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)
    {
        sprintf(message,
        "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)
        {
            sprintf(message,
            "Illegal negative value for NAXIS%d keyword: %.0f", ii + 1, (double) (naxes[ii]));
            ffpmsg(message);
            return(*status = BAD_NAXES);
        }

        sprintf(&comm[20], "%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 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 (sprintf(cval, "%.*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 ( sprintf(cval, "%.*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 ( sprintf(cval, "%.1E", fval) < 0)
                {
                    ffpmsg("Error in ffr2e converting float to string");
                    *status = BAD_F2C;
                }

                return(*status);  
            }
        }
    }
    else
    {
        if ( sprintf(cval, "%.*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') )
        {
            /* 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 (sprintf(cval, "%.*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 ( sprintf(cval, "%.*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 ( sprintf(cval, "%.1E", dval) < 0)
                {
                    ffpmsg("Error in ffd2e converting float to string");
                    *status = BAD_F2C;
                }

                return(*status);  
            }
        }
    }
    else
    {
        if ( sprintf(cval, "%.*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') )
        {
            /* add decimal point if necessary to distinquish from integer */
            strcat(cval, ".");
        }
    }

    return(*status);
}

healpy-1.8.1/MANIFEST.in0000644000175000017500000000110612351601276015010 0ustar  zoncazonca00000000000000recursive-include healpy/data *.fits
recursive-include healpy/test/data *
exclude healpy/test/data/ipython*
exclude cfitsio/*pdf cfitsio/*ps cfitsio/*doc cfitsio/*tex
prune cfitsio/docs
exclude *.so
exclude *.a
include COPYING CITATION INSTALL.rst README.rst MANIFEST.in CHANGELOG.rst ez_setup.py pykg_config.py
include healpy/src/_healpy_utils.h
include healpy/src/_query_disc.cpp
include healpy/src/_sphtools.cpp
include healpy/src/_pixelfunc.cpp
include healpy/src/_common.pxd
include healpy/src/_query_disc.pyx
include healpy/src/_sphtools.pyx
include healpy/src/_pixelfunc.pyx
healpy-1.8.1/ez_setup.py0000644000175000017500000002413412336442722015472 0ustar  zoncazonca00000000000000#!/usr/bin/env python
"""Bootstrap setuptools installation

To use setuptools in your package's setup.py, include this
file in the same directory and add this to the top of your setup.py::

    from ez_setup import use_setuptools
    use_setuptools()

To require a specific version of setuptools, set a download
mirror, or use an alternate download directory, simply supply
the appropriate options to ``use_setuptools()``.

This file can also be run as a script to install or upgrade setuptools.
"""
import os
import shutil
import sys
import tempfile
import zipfile
import optparse
import subprocess
import platform
import textwrap
import contextlib

from distutils import log

try:
    from site import USER_SITE
except ImportError:
    USER_SITE = None

DEFAULT_VERSION = "3.5.1"
DEFAULT_URL = "https://pypi.python.org/packages/source/s/setuptools/"

def _python_cmd(*args):
    """
    Return True if the command succeeded.
    """
    args = (sys.executable,) + args
    return subprocess.call(args) == 0


def _install(archive_filename, install_args=()):
    with archive_context(archive_filename):
        # installing
        log.warn('Installing Setuptools')
        if not _python_cmd('setup.py', 'install', *install_args):
            log.warn('Something went wrong during the installation.')
            log.warn('See the error message above.')
            # exitcode will be 2
            return 2


def _build_egg(egg, archive_filename, to_dir):
    with archive_context(archive_filename):
        # building an egg
        log.warn('Building a Setuptools egg in %s', to_dir)
        _python_cmd('setup.py', '-q', 'bdist_egg', '--dist-dir', to_dir)
    # returning the result
    log.warn(egg)
    if not os.path.exists(egg):
        raise IOError('Could not build the egg.')


def get_zip_class():
    """
    Supplement ZipFile class to support context manager for Python 2.6
    """
    class ContextualZipFile(zipfile.ZipFile):
        def __enter__(self):
            return self
        def __exit__(self, type, value, traceback):
            self.close
    return zipfile.ZipFile if hasattr(zipfile.ZipFile, '__exit__') else \
        ContextualZipFile


@contextlib.contextmanager
def archive_context(filename):
    # extracting the archive
    tmpdir = tempfile.mkdtemp()
    log.warn('Extracting in %s', tmpdir)
    old_wd = os.getcwd()
    try:
        os.chdir(tmpdir)
        with get_zip_class()(filename) as archive:
            archive.extractall()

        # going in the directory
        subdir = os.path.join(tmpdir, os.listdir(tmpdir)[0])
        os.chdir(subdir)
        log.warn('Now working in %s', subdir)
        yield

    finally:
        os.chdir(old_wd)
        shutil.rmtree(tmpdir)


def _do_download(version, download_base, to_dir, download_delay):
    egg = os.path.join(to_dir, 'setuptools-%s-py%d.%d.egg'
                       % (version, sys.version_info[0], sys.version_info[1]))
    if not os.path.exists(egg):
        archive = download_setuptools(version, download_base,
                                      to_dir, download_delay)
        _build_egg(egg, archive, to_dir)
    sys.path.insert(0, egg)

    # Remove previously-imported pkg_resources if present (see
    # https://bitbucket.org/pypa/setuptools/pull-request/7/ for details).
    if 'pkg_resources' in sys.modules:
        del sys.modules['pkg_resources']

    import setuptools
    setuptools.bootstrap_install_from = egg


def use_setuptools(version=DEFAULT_VERSION, download_base=DEFAULT_URL,
        to_dir=os.curdir, download_delay=15):
    to_dir = os.path.abspath(to_dir)
    rep_modules = 'pkg_resources', 'setuptools'
    imported = set(sys.modules).intersection(rep_modules)
    try:
        import pkg_resources
    except ImportError:
        return _do_download(version, download_base, to_dir, download_delay)
    try:
        pkg_resources.require("setuptools>=" + version)
        return
    except pkg_resources.DistributionNotFound:
        return _do_download(version, download_base, to_dir, download_delay)
    except pkg_resources.VersionConflict as VC_err:
        if imported:
            msg = textwrap.dedent("""
                The required version of setuptools (>={version}) is not available,
                and can't be installed while this script is running. Please
                install a more recent version first, using
                'easy_install -U setuptools'.

                (Currently using {VC_err.args[0]!r})
                """).format(VC_err=VC_err, version=version)
            sys.stderr.write(msg)
            sys.exit(2)

        # otherwise, reload ok
        del pkg_resources, sys.modules['pkg_resources']
        return _do_download(version, download_base, to_dir, download_delay)

def _clean_check(cmd, target):
    """
    Run the command to download target. If the command fails, clean up before
    re-raising the error.
    """
    try:
        subprocess.check_call(cmd)
    except subprocess.CalledProcessError:
        if os.access(target, os.F_OK):
            os.unlink(target)
        raise

def download_file_powershell(url, target):
    """
    Download the file at url to target using Powershell (which will validate
    trust). Raise an exception if the command cannot complete.
    """
    target = os.path.abspath(target)
    cmd = [
        'powershell',
        '-Command',
        "(new-object System.Net.WebClient).DownloadFile(%(url)r, %(target)r)" % vars(),
    ]
    _clean_check(cmd, target)

def has_powershell():
    if platform.system() != 'Windows':
        return False
    cmd = ['powershell', '-Command', 'echo test']
    devnull = open(os.path.devnull, 'wb')
    try:
        try:
            subprocess.check_call(cmd, stdout=devnull, stderr=devnull)
        except Exception:
            return False
    finally:
        devnull.close()
    return True

download_file_powershell.viable = has_powershell

def download_file_curl(url, target):
    cmd = ['curl', url, '--silent', '--output', target]
    _clean_check(cmd, target)

def has_curl():
    cmd = ['curl', '--version']
    devnull = open(os.path.devnull, 'wb')
    try:
        try:
            subprocess.check_call(cmd, stdout=devnull, stderr=devnull)
        except Exception:
            return False
    finally:
        devnull.close()
    return True

download_file_curl.viable = has_curl

def download_file_wget(url, target):
    cmd = ['wget', url, '--quiet', '--output-document', target]
    _clean_check(cmd, target)

def has_wget():
    cmd = ['wget', '--version']
    devnull = open(os.path.devnull, 'wb')
    try:
        try:
            subprocess.check_call(cmd, stdout=devnull, stderr=devnull)
        except Exception:
            return False
    finally:
        devnull.close()
    return True

download_file_wget.viable = has_wget

def download_file_insecure(url, target):
    """
    Use Python to download the file, even though it cannot authenticate the
    connection.
    """
    try:
        from urllib.request import urlopen
    except ImportError:
        from urllib2 import urlopen
    src = dst = None
    try:
        src = urlopen(url)
        # Read/write all in one block, so we don't create a corrupt file
        # if the download is interrupted.
        data = src.read()
        dst = open(target, "wb")
        dst.write(data)
    finally:
        if src:
            src.close()
        if dst:
            dst.close()

download_file_insecure.viable = lambda: True

def get_best_downloader():
    downloaders = [
        download_file_powershell,
        download_file_curl,
        download_file_wget,
        download_file_insecure,
    ]

    for dl in downloaders:
        if dl.viable():
            return dl

def download_setuptools(version=DEFAULT_VERSION, download_base=DEFAULT_URL,
        to_dir=os.curdir, delay=15, downloader_factory=get_best_downloader):
    """
    Download setuptools from a specified location and return its filename

    `version` should be a valid setuptools version number that is available
    as an egg for download under the `download_base` URL (which should end
    with a '/'). `to_dir` is the directory where the egg will be downloaded.
    `delay` is the number of seconds to pause before an actual download
    attempt.

    ``downloader_factory`` should be a function taking no arguments and
    returning a function for downloading a URL to a target.
    """
    # making sure we use the absolute path
    to_dir = os.path.abspath(to_dir)
    zip_name = "setuptools-%s.zip" % version
    url = download_base + zip_name
    saveto = os.path.join(to_dir, zip_name)
    if not os.path.exists(saveto):  # Avoid repeated downloads
        log.warn("Downloading %s", url)
        downloader = downloader_factory()
        downloader(url, saveto)
    return os.path.realpath(saveto)

def _build_install_args(options):
    """
    Build the arguments to 'python setup.py install' on the setuptools package
    """
    return ['--user'] if options.user_install else []

def _parse_args():
    """
    Parse the command line for options
    """
    parser = optparse.OptionParser()
    parser.add_option(
        '--user', dest='user_install', action='store_true', default=False,
        help='install in user site package (requires Python 2.6 or later)')
    parser.add_option(
        '--download-base', dest='download_base', metavar="URL",
        default=DEFAULT_URL,
        help='alternative URL from where to download the setuptools package')
    parser.add_option(
        '--insecure', dest='downloader_factory', action='store_const',
        const=lambda: download_file_insecure, default=get_best_downloader,
        help='Use internal, non-validating downloader'
    )
    parser.add_option(
        '--version', help="Specify which version to download",
        default=DEFAULT_VERSION,
    )
    options, args = parser.parse_args()
    # positional arguments are ignored
    return options

def main():
    """Install or upgrade setuptools and EasyInstall"""
    options = _parse_args()
    archive = download_setuptools(
        version=options.version,
        download_base=options.download_base,
        downloader_factory=options.downloader_factory,
    )
    return _install(archive, _build_install_args(options))

if __name__ == '__main__':
    sys.exit(main())